From: Thomas Walker Lynch Date: Fri, 10 Jan 2025 05:23:41 +0000 (+0000) Subject: SRMT -> SRTM typo fix X-Git-Url: https://git.reasoningtechnology.com/usr/lib/python2.7/encodings/cp1026.py?a=commitdiff_plain;h=5f47a7a45fde4b7ccdb25045172d7473fd1ba7af;p=Ariadne SRMT -> SRTM typo fix --- diff --git "a/developer/document\360\237\226\211/Step_Right_Machine.txt" "b/developer/document\360\237\226\211/Step_Right_Machine.txt" index 7191296..a6b64c4 100644 --- "a/developer/document\360\237\226\211/Step_Right_Machine.txt" +++ "b/developer/document\360\237\226\211/Step_Right_Machine.txt" @@ -44,7 +44,7 @@ Singly Linked Tape --- -The Step Right Machine +The Step Right Tape Machine This is a conventional iterator for traversing through containers. The items visited during the traversal are as though values in cells on a single linked tape. diff --git a/developer/example/CountingNumber/CountingNumber.java b/developer/example/CountingNumber/CountingNumber.java index 11ce61c..3255c30 100644 --- a/developer/example/CountingNumber/CountingNumber.java +++ b/developer/example/CountingNumber/CountingNumber.java @@ -1,7 +1,7 @@ -import com.ReasoningTechnology.Ariadne.Ariadne_SRMT; +import com.ReasoningTechnology.Ariadne.Ariadne_SRTM; import java.math.BigInteger; -public class CountingNumber extends Ariadne_SRMT{ +public class CountingNumber extends Ariadne_SRTM{ public static CountingNumber make(BigInteger maximum){ return new CountingNumber(maximum); @@ -14,10 +14,10 @@ public class CountingNumber extends Ariadne_SRMT{ private BigInteger i; private BigInteger maximum; - private final TopoIface state_null = new ASRMT_Null(); - private final TopoIface state_segment = new ASRMT_Segment(); - private final TopoIface state_rightmost = new ASRMT_Rightmost(); - private final TopoIface state_infinite = new ASRMT_Infinite(); + private final TopoIface state_null = new ASRTM_Null(); + private final TopoIface state_segment = new ASRTM_Segment(); + private final TopoIface state_rightmost = new ASRTM_Rightmost(); + private final TopoIface state_infinite = new ASRTM_Infinite(); public CountingNumber(){ this.i = BigInteger.ONE; @@ -43,7 +43,7 @@ public class CountingNumber extends Ariadne_SRMT{ } - private class ASRMT_Null implements TopoIface{ + private class ASRTM_Null implements TopoIface{ @Override public boolean can_read(){ return false; @@ -66,7 +66,7 @@ public class CountingNumber extends Ariadne_SRMT{ } } - private class ASRMT_Segment implements TopoIface{ + private class ASRTM_Segment implements TopoIface{ @Override public boolean can_read(){ return true; @@ -92,7 +92,7 @@ public class CountingNumber extends Ariadne_SRMT{ } } - private class ASRMT_Rightmost implements TopoIface{ + private class ASRTM_Rightmost implements TopoIface{ @Override public boolean can_read(){ return true; @@ -115,7 +115,7 @@ public class CountingNumber extends Ariadne_SRMT{ } } - private class ASRMT_Infinite implements TopoIface{ + private class ASRTM_Infinite implements TopoIface{ @Override public boolean can_read(){ return true; diff --git a/developer/example/CountingNumber/Example_CountingNumber_0.java b/developer/example/CountingNumber/Example_CountingNumber_0.java index 48ec99b..9d340b4 100644 --- a/developer/example/CountingNumber/Example_CountingNumber_0.java +++ b/developer/example/CountingNumber/Example_CountingNumber_0.java @@ -1,4 +1,4 @@ -import com.ReasoningTechnology.Ariadne.Ariadne_SRMT; +import com.ReasoningTechnology.Ariadne.Ariadne_SRTM; import java.math.BigInteger; public class Example_CountingNumber_0{ @@ -8,14 +8,14 @@ public class Example_CountingNumber_0{ if( !n.can_read() ) return; - if( n.topology() == Ariadne_SRMT.Topology.SEGMENT ){ + if( n.topology() == Ariadne_SRTM.Topology.SEGMENT ){ do{ System.out.println("Current Number: " + n.read()); if( !n.can_step() ) break; n.step(); }while( true ); - }else if( n.topology() == Ariadne_SRMT.Topology.INFINITE ){ + }else if( n.topology() == Ariadne_SRTM.Topology.INFINITE ){ int count = 0; do{ System.out.println("Current Number: " + n.read()); diff --git a/developer/example/IndexTree/Example_IndexTree_4x4.java b/developer/example/IndexTree/Example_IndexTree_4x4.java index 9e1b008..233532f 100644 --- a/developer/example/IndexTree/Example_IndexTree_4x4.java +++ b/developer/example/IndexTree/Example_IndexTree_4x4.java @@ -1,6 +1,6 @@ -import com.ReasoningTechnology.Ariadne.Ariadne_SRMT; -import com.ReasoningTechnology.Ariadne.Ariadne_SRMT_List; -import com.ReasoningTechnology.Ariadne.IndexTree_SRMT_Child; +import com.ReasoningTechnology.Ariadne.Ariadne_SRTM; +import com.ReasoningTechnology.Ariadne.Ariadne_SRTM_List; +import com.ReasoningTechnology.Ariadne.IndexTree_SRTM_Child; import com.ReasoningTechnology.Ariadne.IndexTree_Graph; import com.ReasoningTechnology.Ariadne.IndexTree_Node; @@ -12,14 +12,14 @@ public class Example_IndexTree_4x4{ // Initialize graph and start at root IndexTree_Graph graph = IndexTree_Graph.make(); - IndexTree_SRMT_Child root = graph.start(); + IndexTree_SRTM_Child root = graph.start(); System.out.println("root: " + root.read().toString()); // Variables for traversal IndexTree_Label label = root.read(); IndexTree_Node node; - Ariadne_SRMT child_srm; + Ariadne_SRTM child_srm; // Descend 3 more levels int i = 1; diff --git a/developer/example/IndexTree/Example_IndexTree_Diagonal_SRM.java b/developer/example/IndexTree/Example_IndexTree_Diagonal_SRM.java index 84c4400..5e6bbf6 100644 --- a/developer/example/IndexTree/Example_IndexTree_Diagonal_SRM.java +++ b/developer/example/IndexTree/Example_IndexTree_Diagonal_SRM.java @@ -1,13 +1,13 @@ import java.math.BigInteger; import java.util.Queue; -public class Example_IndexTree_Diagonal_SRMT { +public class Example_IndexTree_Diagonal_SRTM { public static void main(String[] args){ - System.out.println("Starting IndexTree SRMT Example"); + System.out.println("Starting IndexTree SRTM Example"); - // Instantiate the IndexTree Diagonal SRMT - IndexTree_Diagonal_SRMT srm = IndexTree_Diagonal_SRMT.make(); + // Instantiate the IndexTree Diagonal SRTM + IndexTree_Diagonal_SRTM srm = IndexTree_Diagonal_SRTM.make(); int step_count = 0; do{ diff --git a/developer/example/IndexTree/IndexTree_Graph.java b/developer/example/IndexTree/IndexTree_Graph.java index 6b4f873..96e92f5 100644 --- a/developer/example/IndexTree/IndexTree_Graph.java +++ b/developer/example/IndexTree/IndexTree_Graph.java @@ -8,9 +8,9 @@ public class IndexTree_Graph{ protected IndexTree_Graph(){ } - public IndexTree_SRMT_Child start(){ + public IndexTree_SRTM_Child start(){ IndexTree_Label root_label = IndexTree_Label.root(); - return IndexTree_SRMT_Child.make(root_label); + return IndexTree_SRTM_Child.make(root_label); } IndexTree_Node lookup(IndexTree_Label label){ diff --git a/developer/example/IndexTree/IndexTree_Node.java b/developer/example/IndexTree/IndexTree_Node.java index bf1f7cd..f1ddd30 100644 --- a/developer/example/IndexTree/IndexTree_Node.java +++ b/developer/example/IndexTree/IndexTree_Node.java @@ -15,9 +15,9 @@ public class IndexTree_Node extends Ariadne_Node{ first_child_label.inc_down(); } - // public IndexTree_SRMT_Child neighbor(){ - public IndexTree_SRMT_Child neighbor(){ - return IndexTree_SRMT_Child.make(first_child_label); + // public IndexTree_SRTM_Child neighbor(){ + public IndexTree_SRTM_Child neighbor(){ + return IndexTree_SRTM_Child.make(first_child_label); } } diff --git a/developer/example/IndexTree/IndexTree_SRTM_Child.java b/developer/example/IndexTree/IndexTree_SRTM_Child.java index 7b84ac2..a9fbffe 100644 --- a/developer/example/IndexTree/IndexTree_SRTM_Child.java +++ b/developer/example/IndexTree/IndexTree_SRTM_Child.java @@ -1,14 +1,14 @@ package com.ReasoningTechnology.Ariadne; -public class IndexTree_SRMT_Child extends Ariadne_SRMT_Label { +public class IndexTree_SRTM_Child extends Ariadne_SRTM_Label { - public static IndexTree_SRMT_Child make( IndexTree_Label first_child_label ){ - return new IndexTree_SRMT_Child( first_child_label ); + public static IndexTree_SRTM_Child make( IndexTree_Label first_child_label ){ + return new IndexTree_SRTM_Child( first_child_label ); } private final IndexTree_Label label; - protected IndexTree_SRMT_Child( IndexTree_Label first_child_label ){ + protected IndexTree_SRTM_Child( IndexTree_Label first_child_label ){ this.label = first_child_label.copy(); if( label == null ){ diff --git a/developer/example/IndexTree/IndexTree_SRTM_Diagonal.java b/developer/example/IndexTree/IndexTree_SRTM_Diagonal.java index 5e39c93..5bebc07 100644 --- a/developer/example/IndexTree/IndexTree_SRTM_Diagonal.java +++ b/developer/example/IndexTree/IndexTree_SRTM_Diagonal.java @@ -13,16 +13,16 @@ import java.math.BigInteger; import java.util.ArrayList; import java.util.List; import com.ReasoningTechnology.Ariadne.Ariadne_Test; -import com.ReasoningTechnology.Ariadne.Ariadne_SRMT; +import com.ReasoningTechnology.Ariadne.Ariadne_SRTM; import com.ReasoningTechnology.Ariadne.Ariadne_IndexTree_Node; -public class IndexTree_Diagonal_SRMT extends Ariadne_SRMT_Label>{ +public class IndexTree_Diagonal_SRTM extends Ariadne_SRTM_Label>{ // Static // - public static IndexTree_Diagonal_SRMT make(){ - return new IndexTree_Diagonal_SRMT(); + public static IndexTree_Diagonal_SRTM make(){ + return new IndexTree_Diagonal_SRTM(); } //Instance data @@ -30,14 +30,14 @@ public class IndexTree_Diagonal_SRMT extends Ariadne_SRMT_Label>{ private final List list_of__unopened_node; // each node has a child list, this is a list of child lists - private final List list_of__opened_incomplete_child_list; + private final List list_of__opened_incomplete_child_list; // Each diagonal is a list of nodes, referenced by their label private final List read_list; // Constructor(s) // - protected IndexTree_Diagonal_SRMT(){ + protected IndexTree_Diagonal_SRTM(){ list_of__unopened_node = new ArrayList<>(); list_of__opened_incomplete_child_list = new ArrayList<>(); read_list = new ArrayList<>(); @@ -61,7 +61,7 @@ public class IndexTree_Diagonal_SRMT extends Ariadne_SRMT_Label>{ private List fetch_child_labels(Ariadne_IndexTree_Node node){ List child_labels = new ArrayList<>(); if(node != null){ - IndexTree_Diagonal_SRMT child_srm = node.neighbor(); + IndexTree_Diagonal_SRTM child_srm = node.neighbor(); if( child_srm.can_read() ){ do{ child_labels.add(child_srm.read()); diff --git a/developer/example/SRTM/Example_SRTMI_Array.java b/developer/example/SRTM/Example_SRTMI_Array.java index 7283167..86efa6b 100644 --- a/developer/example/SRTM/Example_SRTMI_Array.java +++ b/developer/example/SRTM/Example_SRTMI_Array.java @@ -1,16 +1,16 @@ -import com.ReasoningTechnology.Ariadne.Ariadne_SRMT; -import com.ReasoningTechnology.Ariadne.Ariadne_SRMTI_Array; +import com.ReasoningTechnology.Ariadne.Ariadne_SRTM; +import com.ReasoningTechnology.Ariadne.Ariadne_SRTMI_Array; import java.util.Arrays; import java.util.List; -public class Example_SRMTI_Array { +public class Example_SRTMI_Array { public static void main( String[] args ){ // Create an Array List label_array = Arrays.asList( "A", "B", "C", "D" ); - // Attach SRMTI to the array - Ariadne_SRMTI_Array srm = Ariadne_SRMTI_Array.make( label_array ); + // Attach SRTMI to the array + Ariadne_SRTMI_Array srm = Ariadne_SRTMI_Array.make( label_array ); if( srm.can_read() ){ do{ System.out.println( "Reading: " + srm.read() ); diff --git a/developer/example/SRTM/Example_SRTM_List.java b/developer/example/SRTM/Example_SRTM_List.java index 6d35ead..489e5fe 100644 --- a/developer/example/SRTM/Example_SRTM_List.java +++ b/developer/example/SRTM/Example_SRTM_List.java @@ -1,9 +1,9 @@ -import com.ReasoningTechnology.Ariadne.Ariadne_SRMT; -import com.ReasoningTechnology.Ariadne.Ariadne_SRMT_List; +import com.ReasoningTechnology.Ariadne.Ariadne_SRTM; +import com.ReasoningTechnology.Ariadne.Ariadne_SRTM_List; import java.util.LinkedList; -public class Example_SRMT_List { +public class Example_SRTM_List { public static void main( String[] args ){ // Create a linked list LinkedList label_list = new LinkedList<>(); @@ -11,8 +11,8 @@ public class Example_SRMT_List { label_list.add( "B" ); label_list.add( "C" ); - // Attach SRMT to the linked list and traverse - Ariadne_SRMT_List srm = Ariadne_SRMT_List.make(label_list); + // Attach SRTM to the linked list and traverse + Ariadne_SRTM_List srm = Ariadne_SRTM_List.make(label_list); if( srm.can_read() ){ do{ System.out.println( "Reading: " + srm.read() ); diff --git a/developer/example/temp.java b/developer/example/temp.java index 2f09bb4..39e629d 100644 --- a/developer/example/temp.java +++ b/developer/example/temp.java @@ -1,5 +1,5 @@ /* - IndexTree_SRMT_Diagonal + IndexTree_SRTM_Diagonal An index tree is infinite. @@ -13,15 +13,15 @@ import java.math.BigInteger; import java.util.ArrayList; import java.util.List; -import com.ReasoningTechnology.Ariadne.Ariadne_SRMT; +import com.ReasoningTechnology.Ariadne.Ariadne_SRTM; import com.ReasoningTechnology.Ariadne.IndexTree_Node; -public class IndexTree_SRMT_Diagonal extends Ariadne_SRMT_Label { +public class IndexTree_SRTM_Diagonal extends Ariadne_SRTM_Label { // Static - public static IndexTree_SRMT_Diagonal make(){ - return new IndexTree_SRMT_Diagonal(); + public static IndexTree_SRTM_Diagonal make(){ + return new IndexTree_SRTM_Diagonal(); } // Instance Data @@ -29,15 +29,15 @@ public class IndexTree_SRMT_Diagonal extends Ariadne_SRMT_Label { private final List list_of__unopened_node; private final List> list_of__opened_incomplete_child_list; private final List read_list; - private final Ariadne_SRMT_Label breadth_srm; + private final Ariadne_SRTM_Label breadth_srm; // Constructor - protected IndexTree_SRMT_Diagonal(){ + protected IndexTree_SRTM_Diagonal(){ list_of__unopened_node = new ArrayList<>(); list_of__opened_incomplete_child_list = new ArrayList<>(); read_list = new ArrayList<>(); - breadth_srm = Ariadne_SRMT_Label.make(); + breadth_srm = Ariadne_SRTM_Label.make(); enqueue_root(); } @@ -75,7 +75,7 @@ public class IndexTree_SRMT_Diagonal extends Ariadne_SRMT_Label { // Retrieve the node using lookup IndexTree_Node node = lookup( label ); - // Mount a new breadth-first SRMT for children + // Mount a new breadth-first SRTM for children breadth_srm.mount( node.neighbor() ); if( breadth_srm.can_read() ){ diff --git "a/developer/javac\360\237\226\211/Ariadne_Graph.java" "b/developer/javac\360\237\226\211/Ariadne_Graph.java" index 6739911..dea283c 100644 --- "a/developer/javac\360\237\226\211/Ariadne_Graph.java" +++ "b/developer/javac\360\237\226\211/Ariadne_Graph.java" @@ -12,7 +12,7 @@ package com.ReasoningTechnology.Ariadne; public interface Ariadne_Graph { - Ariadne_SRMT start(); + Ariadne_SRTM start(); Ariadne_Node lookup(Ariadne_Label label); diff --git "a/developer/javac\360\237\226\211/Ariadne_Node.java" "b/developer/javac\360\237\226\211/Ariadne_Node.java" index 89f50ad..781360c 100644 --- "a/developer/javac\360\237\226\211/Ariadne_Node.java" +++ "b/developer/javac\360\237\226\211/Ariadne_Node.java" @@ -54,7 +54,7 @@ public class Ariadne_Node extends HashMap{ return this.label; } - public Ariadne_SRMT_Label neighbor(){ + public Ariadne_SRTM_Label neighbor(){ throw new UnsupportedOperationException("Ariadne_Node::neighbor not implemented in the base class."); } @@ -88,7 +88,7 @@ public class Ariadne_Node extends HashMap{ // Marks representation if( !mark_set.isEmpty() ){ - Ariadne_SRMT_Set srm = Ariadne_SRMT_Set.make(mark_set); + Ariadne_SRTM_Set srm = Ariadne_SRTM_Set.make(mark_set); output.append( " Mark(" ); do{ diff --git "a/developer/javac\360\237\226\211/Ariadne_SRTM.java" "b/developer/javac\360\237\226\211/Ariadne_SRTM.java" index ba15c04..993336c 100644 --- "a/developer/javac\360\237\226\211/Ariadne_SRTM.java" +++ "b/developer/javac\360\237\226\211/Ariadne_SRTM.java" @@ -1,5 +1,5 @@ /* - Step Right Machine + Step Right Tape Machine This is a mostly abstract base class. @@ -8,7 +8,7 @@ */ package com.ReasoningTechnology.Ariadne; -public class Ariadne_SRMT{ +public class Ariadne_SRTM{ // static // @@ -21,8 +21,8 @@ public class Ariadne_SRMT{ ,INFINITE } - public static Ariadne_SRMT make(){ - return new Ariadne_SRMT(); + public static Ariadne_SRTM make(){ + return new Ariadne_SRTM(); } // instance data @@ -34,7 +34,7 @@ public class Ariadne_SRMT{ // constructor(s) // - protected Ariadne_SRMT(){ + protected Ariadne_SRTM(){ set_topology( not_mounted ); } @@ -60,16 +60,16 @@ public class Ariadne_SRMT{ return false; } @Override public Object read(){ - throw new UnsupportedOperationException("Ariadne_SRMT::NotMounted::read."); + throw new UnsupportedOperationException("Ariadne_SRTM::NotMounted::read."); } @Override public boolean can_step(){ return false; } @Override public void step(){ - throw new UnsupportedOperationException("Ariadne_SRMT::NotMounted::step."); + throw new UnsupportedOperationException("Ariadne_SRTM::NotMounted::step."); } @Override public Topology topology(){ - throw new UnsupportedOperationException("Ariadne_SRMT::NotMounted::topology."); + throw new UnsupportedOperationException("Ariadne_SRTM::NotMounted::topology."); } } diff --git "a/developer/javac\360\237\226\211/Ariadne_SRTMI.java" "b/developer/javac\360\237\226\211/Ariadne_SRTMI.java" index 4bdd585..6bb9b3d 100644 --- "a/developer/javac\360\237\226\211/Ariadne_SRTMI.java" +++ "b/developer/javac\360\237\226\211/Ariadne_SRTMI.java" @@ -1,16 +1,16 @@ /* -Ariadne_SRMT with index +Ariadne_SRTM with index */ package com.ReasoningTechnology.Ariadne; import java.math.BigInteger; -public abstract class Ariadne_SRMTI extends Ariadne_SRMT{ +public abstract class Ariadne_SRTMI extends Ariadne_SRTM{ private BigInteger current_index; - public Ariadne_SRMTI(){ + public Ariadne_SRTMI(){ this.current_index = BigInteger.ZERO; } diff --git "a/developer/javac\360\237\226\211/Ariadne_SRTMI_Array.java" "b/developer/javac\360\237\226\211/Ariadne_SRTMI_Array.java" index c63fe73..1411803 100644 --- "a/developer/javac\360\237\226\211/Ariadne_SRTMI_Array.java" +++ "b/developer/javac\360\237\226\211/Ariadne_SRTMI_Array.java" @@ -3,11 +3,11 @@ package com.ReasoningTechnology.Ariadne; import java.math.BigInteger; import java.util.List; -public class Ariadne_SRMTI_Array extends Ariadne_SRMTI{ +public class Ariadne_SRTMI_Array extends Ariadne_SRTMI{ // Static methods - public static Ariadne_SRMTI_Array make(List array){ - return new Ariadne_SRMTI_Array( array ); + public static Ariadne_SRTMI_Array make(List array){ + return new Ariadne_SRTMI_Array( array ); } // Instance data @@ -18,7 +18,7 @@ public class Ariadne_SRMTI_Array extends Ariadne_SRMTI{ private final TopoIface topo_rightmost = new TopoRightmost(); // Constructor - protected Ariadne_SRMTI_Array(List array){ + protected Ariadne_SRTMI_Array(List array){ super(); this.array = array; diff --git "a/developer/javac\360\237\226\211/Ariadne_SRTM_Label.java" "b/developer/javac\360\237\226\211/Ariadne_SRTM_Label.java" index 1aa4824..0dc5a14 100644 --- "a/developer/javac\360\237\226\211/Ariadne_SRTM_Label.java" +++ "b/developer/javac\360\237\226\211/Ariadne_SRTM_Label.java" @@ -1,9 +1,9 @@ package com.ReasoningTechnology.Ariadne; -public class Ariadne_SRMT_Label extends Ariadne_SRMT { +public class Ariadne_SRTM_Label extends Ariadne_SRTM { - public static Ariadne_SRMT_Label make(){ - return new Ariadne_SRMT_Label(); + public static Ariadne_SRTM_Label make(){ + return new Ariadne_SRTM_Label(); } @Override public Ariadne_Label read(){ diff --git "a/developer/javac\360\237\226\211/Ariadne_SRTM_List.java" "b/developer/javac\360\237\226\211/Ariadne_SRTM_List.java" index 233db1e..4ff9fe2 100644 --- "a/developer/javac\360\237\226\211/Ariadne_SRTM_List.java" +++ "b/developer/javac\360\237\226\211/Ariadne_SRTM_List.java" @@ -1,5 +1,5 @@ /* - The Ariadne_SRMT_List class provides a Step Right Machine (SRMT) for linked lists. + The Ariadne_SRTM_List class provides a Step Right Tape Machine (SRTMT) for linked lists. This implementation uses Java's ListIterator, which lacks a direct method to read the current element without advancing the iterator. @@ -8,11 +8,11 @@ package com.ReasoningTechnology.Ariadne; import java.util.List; import java.util.ListIterator; -public class Ariadne_SRMT_List extends Ariadne_SRMT{ +public class Ariadne_SRTM_List extends Ariadne_SRTM{ // Static methods - public static Ariadne_SRMT_List make(List list){ - return new Ariadne_SRMT_List(list); + public static Ariadne_SRTM_List make(List list){ + return new Ariadne_SRTM_List(list); } private List list; // The attached linked list @@ -23,7 +23,7 @@ public class Ariadne_SRMT_List extends Ariadne_SRMT{ private final TopoIface topo_segment = new TopoSegment(); private final TopoIface topo_rightmost = new TopoRightmost(); - protected Ariadne_SRMT_List(List list){ + protected Ariadne_SRTM_List(List list){ this.list = list; if( list == null || list.isEmpty() ){ diff --git "a/developer/javac\360\237\226\211/Ariadne_SRTM_Set.java" "b/developer/javac\360\237\226\211/Ariadne_SRTM_Set.java" index 84bdaa1..1b41b76 100644 --- "a/developer/javac\360\237\226\211/Ariadne_SRTM_Set.java" +++ "b/developer/javac\360\237\226\211/Ariadne_SRTM_Set.java" @@ -3,14 +3,14 @@ package com.ReasoningTechnology.Ariadne; import java.util.ArrayList; import java.util.Set; -public class Ariadne_SRMT_Set extends Ariadne_SRMTI_Array{ +public class Ariadne_SRTM_Set extends Ariadne_SRTMI_Array{ // Static factory method - public static Ariadne_SRMT_Set make(Set set){ - return new Ariadne_SRMT_Set( set ); + public static Ariadne_SRTM_Set make(Set set){ + return new Ariadne_SRTM_Set( set ); } - protected Ariadne_SRMT_Set(Set set){ + protected Ariadne_SRTM_Set(Set set){ super( new ArrayList(set) ); }