Lines Matching refs:nodes
210 rootPrimaryIndexes(errorCode), nodes(errorCode) {
322 int64_t node = nodes.elementAti(index);
324 // then skip backwards over this and further "weaker" nodes.
327 node = nodes.elementAti(index);
357 // Tailor after the last node between adjacent root nodes.
359 node = nodes.elementAti(index);
372 node = nodes.elementAti(index);
394 node = nodes.elementAti(i);
408 // Skip weaker nodes and same-level tailored nodes.
412 // maybe with following weaker or tailored nodes.
449 node = nodes.elementAti(index);
462 node = nodes.elementAti(index);
499 int64_t node = nodes.elementAti(index);
501 node = nodes.elementAti(index);
518 int64_t node = nodes.elementAti(index);
520 node = nodes.elementAti(index);
526 index = nextIndexFromNode(nodes.elementAti(nextIndexFromNode(node)));
527 U_ASSERT(isTailoredNode(nodes.elementAti(index)));
584 int64_t node = nodes.elementAti(index);
596 node = nodes.elementAti(index);
608 node = nodes.elementAti(index);
614 index = nextIndexFromNode(nodes.elementAti(nextIndexFromNode(node)));
615 node = nodes.elementAti(index);
618 index = nextIndexFromNode(nodes.elementAti(nextIndexFromNode(node)));
620 U_ASSERT(isTailoredNode(nodes.elementAti(index)));
630 int64_t nextNode = nodes.elementAti(nextIndex);
802 // Root CEs must have common=zero quaternary weights (for which we never insert any nodes).
827 const int64_t *nodes, uint32_t p) {
833 int64_t node = nodes[rootPrimaryIndexes[i]];
858 rootPrimaryIndexes.getBuffer(), rootPrimaryIndexes.size(), nodes.getBuffer(), p);
862 // Start a new list of nodes with this primary.
863 int32_t index = nodes.size();
864 nodes.addElement(nodeFromWeight32(p), errorCode);
873 U_ASSERT(0 <= index && index < nodes.size());
882 int64_t node = nodes.elementAti(index);
896 nodes.setElementAt(node | hasThisLevelBefore, index);
914 node = nodes.elementAti(nextIndex);
940 U_ASSERT(0 <= index && index < nodes.size());
949 int64_t node = nodes.elementAti(index);
952 node = nodes.elementAti(nextIndex);
967 U_ASSERT(nextIndexFromNode(nodes.elementAti(index)) == nextIndex);
968 // Append the new node and link it to the existing nodes.
969 int32_t newIndex = nodes.size();
971 nodes.addElement(node, errorCode);
973 // nodes[index].nextIndex = newIndex
974 node = nodes.elementAti(index);
975 nodes.setElementAt(changeNodeNextIndex(node, newIndex), index);
976 // nodes[nextIndex].previousIndex = newIndex
978 node = nodes.elementAti(nextIndex);
979 nodes.setElementAt(changeNodePreviousIndex(node, newIndex), nextIndex);
987 int64_t node = nodes.elementAti(index);
997 node = nodes.elementAti(index);
1003 node = nodes.elementAti(index);
1389 int64_t *nodesArray = nodes.getBuffer();
1615 CEFinalizer finalizer(nodes.getBuffer());
