public virtual IEnumerator <KeyValuePair <AttributeValue, long> > GetEnumerator() { try { return(MergeEnumerators(_tree.GetEnumerator(), _transitionTree.GetEnumerator())); } catch (Exception ex) { LoggerManager.Instance.IndexLogger.Error("BPlusIndex", "Index Enumeration Failure: " + ex.ToString()); throw; } }
public void TestEnumeration() { var options = Options; options.BTreeOrder = 4; using (BPlusTree <int, string> data = new BPlusTree <int, string>(options)) { data.EnableCount(); data.DebugSetOutput(new StringWriter()); data.DebugSetValidateOnCheckpoint(true); for (int id = 0; id < 10; id++) { data.Add(id, id.ToString()); } using (IEnumerator <KeyValuePair <int, string> > enu = data.GetEnumerator()) { Assert.IsTrue(enu.MoveNext()); Assert.AreEqual(0, enu.Current.Key); for (int id = 2; id < 10; id++) { Assert.IsTrue(data.Remove(id)); } for (int id = 6; id < 11; id++) { data.Add(id, id.ToString()); } Assert.IsTrue(enu.MoveNext()); Assert.AreEqual(1, enu.Current.Key); Assert.IsTrue(enu.MoveNext()); Assert.AreEqual(6, enu.Current.Key); Assert.IsTrue(enu.MoveNext()); Assert.AreEqual(7, enu.Current.Key); Assert.IsTrue(data.Remove(8)); Assert.IsTrue(data.Remove(9)); Assert.IsTrue(data.Remove(10)); data.Add(11, 11.ToString()); Assert.IsTrue(enu.MoveNext()); Assert.AreEqual(11, enu.Current.Key); Assert.IsTrue(false == enu.MoveNext()); } data.Clear(); } }
public void ExplicitRangeAddRemove() { string test; using (BPlusTree <int, string> data = Create(Options)) { data.Add(2, "v2"); data.Add(1, "v1"); int i = 0; for (; i < 8; i++) { data.TryAdd(i, "v" + i); } for (i = 16; i >= 8; i--) { data.TryAdd(i, "v" + i); } data.TryAdd(13, "v" + i); for (i = 0; i <= 16; i++) { if (!data.TryGetValue(i, out test)) { throw new ApplicationException(); } Assert.AreEqual("v" + i, test); } data.Remove(1); data.Remove(3); IEnumerator <KeyValuePair <int, string> > e = data.GetEnumerator(); Assert.IsTrue(e.MoveNext()); Assert.AreEqual(0, e.Current.Key); data.Add(1, "v1"); Assert.IsTrue(e.MoveNext()); data.Add(3, "v3"); Assert.IsTrue(e.MoveNext()); data.Remove(8); Assert.IsTrue(e.MoveNext()); e.Dispose(); data.Add(8, "v8"); i = 0; foreach (KeyValuePair <int, string> pair in data) { Assert.AreEqual(pair.Key, i++); } for (i = 0; i <= 16; i++) { Assert.IsTrue(data.Remove(i) && data.TryAdd(i, "v" + i)); } for (i = 6; i <= 12; i++) { Assert.IsTrue(data.Remove(i)); } for (i = 6; i <= 12; i++) { Assert.IsFalse(data.TryGetValue(i, out test)); Assert.IsNull(test); } for (i = 0; i <= 5; i++) { Assert.IsTrue(data.TryGetValue(i, out test)); Assert.AreEqual("v" + i, test); } for (i = 13; i <= 16; i++) { Assert.IsTrue(data.TryGetValue(i, out test)); Assert.AreEqual("v" + i, test); } for (i = 0; i <= 16; i++) { Assert.AreEqual(i < 6 || i > 12, data.Remove(i)); } } }
private static void BasicTest() { BPlusTree <double, string> .OptionsV2 options = new BPlusTree <double, string> .OptionsV2(PrimitiveSerializer.Double, PrimitiveSerializer.String); options.CalcBTreeOrder(16, 24); options.CreateFile = CreatePolicy.Always; options.FileName = System.IO.Path.GetTempFileName(); using (var tree = new BPlusTree <double, string>(options)) { // Insertion to tree. // Note: numbers are NOT inserted sorted. tree.Add(30.1, "30.2"); tree.Add(10.1, "10.2"); tree.Add(20.1, "20.2"); tree.Add(80.1, "80.2"); tree.Add(40.1, "40.2"); tree.Add(60.1, "60.2"); tree.Add(70.1, "70.2"); tree.Add(50.1, "50.2"); // To get first element. // Since sorted, first element is: 10.1 KeyValuePair <double, string> first_with_Try; tree.TryGetFirst(out first_with_Try); // Similar to previous function. var first = tree.First(); // To get last element. // Since sorted, last element is: 80.1 KeyValuePair <double, string> last_with_Try; tree.TryGetLast(out last_with_Try); // Similar to previous function. var last = tree.Last(); // Given key get the value. // Key is valid, region.e., it is available in tree. // Hence it returns: "50.2" string value_of_valid_key; tree.TryGetValue(50.1, out value_of_valid_key); // Given key get the value. // Key is invalid, region.e., it is NOT available in tree. // Hence it returns: null (default value of int) string value_of_invalid_key; tree.TryGetValue(55, out value_of_invalid_key); // The "100" key is not available and no key is available greater than // that, hence .Current should return default value of key type (0 in this case). var key_not_available = tree.EnumerateFrom(100).GetEnumerator().Current; // Runtime error //var list = tree.ToList(); // Gets an enumerator. IEnumerator <KeyValuePair <double, string> > enumerator = tree.GetEnumerator(); // Iterating through items with enumerator. // starting from first item to last. while (enumerator.MoveNext()) { var item = enumerator.Current; } // Another syntac of iterations, which is automatically // calling "GetEnumerator" function. // starting from first item to last. foreach (var item in tree) { } // Iterates through items starting from given key: 40.1 (inclusively) // and goes till the last item. foreach (var item in tree.EnumerateFrom(39.1)) { } // Iterates through items starting from given index: 2 (inclusively) // and goes till the last item. foreach (var item in tree.EnumerateFrom(tree.ElementAtOrDefault(2).Key)) { } // Iterate from an item that is NOT available in collection // to the item which is neither available. foreach (var item in tree.EnumerateRange(20.5, 40.9)) { } // Gets the item at specific index. // All return valid values, but the last one which is // refereing to an index out-of-bound; the return of this // call is the default value for key and value. var element_at_0 = tree.ElementAtOrDefault(0); var element_at_1 = tree.ElementAtOrDefault(1); var element_at_2 = tree.ElementAtOrDefault(2); var element_at_3 = tree.ElementAtOrDefault(3); var element_at_100 = tree.ElementAtOrDefault(100); using (BPlusTree <double, string> data = new BPlusTree <double, string>(options)) { bool sT1 = data.TryAdd(1, "a"); bool sF1 = data.TryAdd(1, "a"); data[1] = "did it"; bool sT2 = data.TryUpdate(1, "a"); bool sT3 = data.TryUpdate(1, "c"); bool sT4 = data.TryUpdate(1, "d", "c"); bool sF2 = data.TryUpdate(1, "f", "c"); bool equality1 = "d".Equals(data[1]); bool sT5 = data.TryUpdate(1, "a", data[1]); bool equality2 = "a".Equals(data[1]); bool sF3 = data.TryUpdate(2, "b"); string val; bool st6 = data.TryRemove(1, out val) && val == "a"; bool sF4 = data.TryRemove(2, out val); bool notEqual = val.Equals("a"); } } }
public IEnumerator <KeyValuePair <string, ContentRecord> > GetEnumerator() { return(_index.GetEnumerator()); }