Lines Matching refs:elems
1330 Elem[] elems = [7, 8, 6, 9, 10, 8];
1331 assert(ts.stableInsert(elems) == 5);
1536 size_t removeKey(U...)(U elems)
1539 Elem[U.length] toRemove = [elems];
1544 size_t removeKey(U)(scope U[] elems)
1549 foreach (e; elems)
1867 this(Elem[] elems...)
1870 stableInsert(elems);
1975 elems = elements to insert into the rbtree (variadic arguments)
1976 range = range elements to insert into the rbtree (alternative to elems)
1978 auto redBlackTree(E)(E[] elems...)
1980 return new RedBlackTree!E(elems);
1984 auto redBlackTree(bool allowDuplicates, E)(E[] elems...)
1986 return new RedBlackTree!(E, "a < b", allowDuplicates)(elems);
1990 auto redBlackTree(alias less, E)(E[] elems...)
1993 return new RedBlackTree!(E, less)(elems);
1997 auto redBlackTree(alias less, bool allowDuplicates, E)(E[] elems...)
2003 return new RedBlackTree!(E, binaryFun!less, allowDuplicates)(elems);