docs: public void uniq() {
          if (size <= 1) { return; }
          int cursor = 0;
          for (int i=1; i<size; i++) {
              if (elements[cursor] != elements[i]) {
                  cursor++;
                  elements[cursor] = elements[i];
              }
          }
          size = cursor+1;
      }