internal override IList <IEnumerable <KeyValuePair <long, TSource> > > GetOrderedEnumerables(QueryOptions options)
{
ReverseList <TSource> reversed = new ReverseList <TSource> (source.ToListOrdered());
OrderablePartitioner <TSource> partitioner = ParallelPartitioner.CreateForStrips(reversed, 1);
return(WrapHelper.Wrap(partitioner.GetOrderablePartitions(options.PartitionCount)));
}
static void Main(string[] args)
{
List list = new List();
list.Add(1);
list.Add(2);
list.Add(3);
IListIterator iterator = list.CreateIterator();
while (iterator.MoveNext())
{
Console.WriteLine(iterator.Current);
}
ReverseList revList = new ReverseList();
revList.Add(1);
revList.Add(2);
revList.Add(3);
IListIterator revIterator = revList.CreateIterator();
while (revIterator.MoveNext())
{
Console.WriteLine(revIterator.Current);
}
Console.Read();
}
static void Main(string[] args)
{
ReverseList<string> test = new ReverseList<string>();
test.Add("item");
test.Add("item2");
test.Add("item3");
test.Add("item4");
test.Add("item5");
test.Add("item6");
for (int i = 0; i < test.Count; i++)
{
Console.WriteLine(test[i]);
}
test.Remove(2);
for (int i = 0; i < test.Count; i++)
{
Console.WriteLine(test[i]);
}
foreach (var item in test)
{
Console.WriteLine(item);
}
}
public void TestNull()
{
ListNode head = null;
Assert.IsNull(ReverseList.Process(head));
Assert.IsNull(ReverseList.Process_Recursively(head));
}
public static void Main()
{
TrippleSum.Do();
ConnectNodesAtTheSameLevel.Do();
JumpingNumbers.Do();
LongestValidSubstring.Do();
SizeOfSubarrayWithMaximumSum.Do();
SubarrayWithSumNonNegative.Do();
SubArrayWithNegativeSum.Do();
SmallestPositiveInteger.Do();
CommonAncestor.Do();
BinaryTreeIsBST.Do();
BalancedBinaryTree.Do();
ReverseList.Do();
SumToGivenValue.Do();
Rectangle.Do();
Parentheses.Do();
FindTripplets.Do();
SubTree.Do();
NumberOfIntInArray.Do();
MinimumArrayOfSumGreater.Do();
ReplaceNumbers.Do();
SubArrayWithSum.Do();
SmallestPositiveInteger.Do();
}
public void TestReverseRecursive()
{
Console.WriteLine("Test started!");
ReverseList reverse = new ReverseList();
list = reverse.ReverseLinkedListRecursive(list);
Console.WriteLine("Reverse Ended!");
list.Print();
Console.WriteLine("Test Ended!");
}
public void TestOnlyOneNode()
{
ListNode head = new ListNode(1);
Assert.AreEqual(new ListNode(1), ReverseList.Process(head));
head = new ListNode(1);
Assert.AreEqual(new ListNode(1), ReverseList.Process_Recursively(head));
}
public static int ReversedListCapacity(int[] data)
{
ReverseList<int> testList = new ReverseList<int>();
foreach (var i in data)
{
testList.Add(i);
}
return testList.Capacity;
}
public void TestLengthIsOdd()
{
ListNode head = Helper.CreateLinkedList(new int[] { 1, 2, 3 });
ListNode expected = Helper.CreateLinkedList(new int[] { 3, 2, 1 });
Assert.IsTrue(Helper.CompareLinkedList(expected, ReverseList.Process(head)));
head = Helper.CreateLinkedList(new int[] { 1, 2, 3 });
Assert.IsTrue(Helper.CompareLinkedList(expected, ReverseList.Process_Recursively(head)));
}
public static int ReversedListCapacity(int[] data)
{
ReverseList <int> testList = new ReverseList <int>();
foreach (var i in data)
{
testList.Add(i);
}
return(testList.Capacity);
}
public static void ReversedListRemove(int[] data,int[] indexToRemove)
{
ReverseList<int> testList = new ReverseList<int>();
foreach (var i in data)
{
testList.Add(i);
}
foreach (var i in indexToRemove)
{
testList.Remove(i);
}
Assert.AreEqual(testList.Count, data.Length - indexToRemove.Length);
}
public static void ReversedListRemove(int[] data, int[] indexToRemove)
{
ReverseList <int> testList = new ReverseList <int>();
foreach (var i in data)
{
testList.Add(i);
}
foreach (var i in indexToRemove)
{
testList.Remove(i);
}
Assert.AreEqual(testList.Count, data.Length - indexToRemove.Length);
}
public static void ReversedListAdd(int[] data)
{
ReverseList<int> testList = new ReverseList<int>();
foreach (var i in data)
{
testList.Add(i);
}
Assert.AreEqual(data.Length, testList.Count);
int count = testList.Count;
for (int i = 0; i < count; i++)
{
Assert.AreEqual(data[count-1-i], testList[i]);
}
}
public static void ReversedListAdd(int[] data)
{
ReverseList <int> testList = new ReverseList <int>();
foreach (var i in data)
{
testList.Add(i);
}
Assert.AreEqual(data.Length, testList.Count);
int count = testList.Count;
for (int i = 0; i < count; i++)
{
Assert.AreEqual(data[count - 1 - i], testList[i]);
}
}
public void Solution1Test()
{
ListNode head = new ListNode(1);
ListNode node1 = new ListNode(2);
ListNode node2 = new ListNode(3);
ListNode node3 = new ListNode(4);
ListNode node4 = new ListNode(5);
head.next = node1;
node1.next = node2;
node2.next = node3;
node3.next = node4;
ReverseList myRl = new ReverseList();
myRl.Solution2(head);
Assert.Fail();
}
public static void Main(string[] args)
{
var list = new ReverseList<int>();
list.Add(8);
list.Add(4);
list.Add(3);
list.Add(2);
list.Add(1);
// Console.WriteLine(list[4]);
list.Remove(4);
foreach (var i in list)
{
Console.WriteLine(i);
}
}
static void Main(string[] args)
{
ReverseList<string> test = new ReverseList<string>();
test.Add("blabla");
test.Add("blabla2");
test.Add("blabla3");
test.Add("blabla4");
test.Add("blabla5");
test.Add("blabla6");
for (int i = 0; i < test.Count; i++)
{
Console.WriteLine(test[i]);
}
test.Remove(2);
for (int i = 0; i < test.Count; i++)
{
Console.WriteLine(test[i]);
}
foreach (var VARIABLE in test)
{
Console.WriteLine(VARIABLE);
}
}
public void MyTest()
{
Assert.AreEqual(new int[0], ReverseList.reverseList(new int[0]));
Assert.AreEqual(new int[] { 3, 2, 1 }, ReverseList.reverseList(new int[] { 1, 2, 3 }));
}
// Method selection
public void select(int num)
{
switch (num)
{
case 1:
basic display = new basic();
display.one();
display.two();
display.three();
break;
case 2:
summation res = new summation();
res.four();
res.five();
res.six();
break;
case 3:
MultiplicationTable multiply = new MultiplicationTable();
multiply.seven();
break;
case 4:
PrimeNumbers printPrime = new PrimeNumbers();
printPrime.eight();
break;
case 5:
MaxNum maxi = new MaxNum();
maxi.nine();
break;
case 6:
ReverseList rev = new ReverseList();
rev.ten();
break;
case 7:
ContainsElement con = new ContainsElement();
con.eleven();
break;
case 8:
ReturnItemsOddPos oddPos = new ReturnItemsOddPos();
oddPos.twelve();
break;
case 9:
RunningTotal runTotal = new RunningTotal();
runTotal.thirteen();
break;
case 10:
Palindrome pali = new Palindrome();
pali.fourteen();
break;
case 11:
SumFunct sumF = new SumFunct();
sumF.fifteenA();
sumF.fifteenB();
sumF.fifteenC();
break;
case 12:
Concatenation conca = new Concatenation();
conca.display();
conca.seventeen();
conca.nineteen();
break;
default:
Console.WriteLine("Choose a valid option");
break;
}
}
