Lines Matching refs:where
314 // circularly linked list where we snip the 'next' link from the sentinel node
409 iterator insert(iterator where, NodeTy *New) {
410 NodeTy *CurNode = where.getNodePtrUnchecked();
425 iterator insertAfter(iterator where, NodeTy *New) {
429 return insert(++where, New);
447 // strictly required, but this catches errors where a node is removed from
465 iterator erase(iterator where) {
466 this->deleteNode(remove(where));
467 return where;
568 template<class InIt> void insert(iterator where, InIt first, InIt last) {
569 for (; first != last; ++first) insert(where, *first);
573 void splice(iterator where, iplist &L2) {
575 transfer(where, L2, L2.begin(), L2.end());
577 void splice(iterator where, iplist &L2, iterator first) {
579 if (where == first || where == last) return; // No change
580 transfer(where, L2, first, last);
582 void splice(iterator where, iplist &L2, iterator first, iterator last) {
583 if (first != last) transfer(where, L2, first, last);
585 void splice(iterator where, iplist &L2, NodeTy &N) {
586 splice(where, L2, iterator(N));
588 void splice(iterator where, iplist &L2, NodeTy *N) {
589 splice(where, L2, iterator(N));
690 iterator insert(iterator where, const NodeTy &val) {
691 return insert(where, this->createNode(val));
699 void insert(iterator where, size_type count, const NodeTy &val) {
700 for (; count != 0; --count) insert(where, val);
