code: private int insertTailoredNodeAfter(int index, int strength) {
          assert(0 <= index && index < nodes.size());
          if(strength >= Collator.SECONDARY) {
              index = findCommonNode(index, Collator.SECONDARY);
              if(strength >= Collator.TERTIARY) {
                  index = findCommonNode(index, Collator.TERTIARY);
              }
          }
          // Postpone insertion:
          // Insert the new node before the next one with a strength at least as strong.
          long node = nodes.elementAti(index);
          int nextIndex;
          while((nextIndex = nextIndexFromNode(node)) != 0) {
              node = nodes.elementAti(nextIndex);
              if(strengthFromNode(node) <= strength) { break; }
              // Skip the next node which has a weaker (larger) strength than the new one.
              index = nextIndex;
          }
          node = IS_TAILORED | nodeFromStrength(strength);
          return insertNodeBetween(index, nextIndex, node);
      }
docs: Makes and inserts a new tailored node into the list, after the one at index.
  Skips over nodes of weaker strength to maintain collation order
  ("postpone insertion").
  @return the new node's index