private void reusableSlistTestCase(String caseName, int numberOfElements) { tml.setTestCaseName(caseName); var listBuilder = ImmutableList.Create <Payload>(); Payload firstElement = new Payload("Load 0"); tml.setInitialTimeAndMemory(); listBuilder = listBuilder.Add(firstElement); tml.logTimeAndMemoryUsage(1); for (int i = 1; i < numberOfElements; i++) { listBuilder = listBuilder.Add(new Payload("Load " + i)); if (i < numberOfElements) { tml.logTimeAndMemoryUsage(i + 1); } } ImmutableList <Payload> outputList = listBuilder.ToImmutableList <Payload>(); tml.logTimeAndMemoryUsage(numberOfElements); }
public void FindElementIn100() { tml.setTestCaseName("Find elements in 100"); SSearchTree <Payload> tree = createTreeOfSize(100); Payload toBeFound_25 = new Payload("Load 25"); Payload toBeFound_50 = new Payload("Load 50"); Payload toBeFound_75 = new Payload("Load 75"); Payload toBeFound_100 = new Payload("Load 99"); tml.setInitialTimeAndMemory(); tree.Contains(toBeFound_25); tml.logTimeAndMemoryUsage(25); tree.Contains(toBeFound_50); tml.logTimeAndMemoryUsage(50); tree.Contains(toBeFound_75); tml.logTimeAndMemoryUsage(75); tree.Contains(toBeFound_100); tml.logTimeAndMemoryUsage(100); }
private void reusableSTreeTestCase(String caseName, int numberOfElements) { tml.setTestCaseName(caseName); var treeBuilder = ImmutableSortedDictionary.Create <Payload, Payload>(); Payload firstElement = new Payload("Load 0"); tml.setInitialTimeAndMemory(); treeBuilder = treeBuilder.Add(firstElement, firstElement); for (int i = 1; i < numberOfElements; i++) { Payload objecttoAdd = new Payload("Load " + i); treeBuilder = treeBuilder.Add(objecttoAdd, objecttoAdd); if (i < numberOfElements) { tml.logTimeAndMemoryUsage(i + 1); } } ImmutableSortedDictionary <Payload, Payload> tree = treeBuilder.ToImmutableSortedDictionary <Payload, Payload>(); tml.logTimeAndMemoryUsage(numberOfElements); }
private void reusableSTreeTestCase(String caseName, int numberOfElements) { tml.setTestCaseName(caseName); tml.setInitialTimeAndMemory(); SSearchTree <Payload> tree = SSearchTree <Payload> .New(new Payload("Load 0")); for (int i = 1; i < numberOfElements; i++) { tree += new Payload("Load " + i); tml.logTimeAndMemoryUsage(i + 1); } }
private void reusableLinkedlistTestCase(String caseName, int numberOfElements) { tml.setTestCaseName(caseName); LinkedList <Payload> list = new LinkedList <Payload>(); list.AddFirst(new Payload("Load 0")); tml.setInitialTimeAndMemory(); tml.logTimeAndMemoryUsage(1); for (int i = 1; i < numberOfElements; i++) { list.AddFirst(new Payload("load " + i)); tml.logTimeAndMemoryUsage(i + 1); } }
private void reusableSlistTestCase(String caseName, int numberOfElements) { tml.setTestCaseName(caseName); SList <Payload> list; Payload firstElement = new Payload("Load 0"); tml.setInitialTimeAndMemory(); list = SList <Payload> .New(firstElement); tml.logTimeAndMemoryUsage(1); for (int i = 1; i < numberOfElements; i++) { (SList <Payload> operand, int pos)prevList = (SList <Payload> .New(new Payload("Load " + i)), i); //list = list + prevList; //list = list + (SList<Payload>.New(new Payload("Load " + i)), i); //list.InsertAt(new Payload("Load "+i), 0); tml.logTimeAndMemoryUsage(i + 1); } }