naming/ldap/LdapName.java

145         this.rdns = new ArrayList<>(rdns.size());
146         for (int i = 0; i < rdns.size(); i++) {
174     public int size() {
175         return rdns.size();
215      *              Must be in the range [0,size()).
227      *          Must be in the range [0,size()).
242      *                  Must be in the range [0,size()].
254                 "Posn: " + posn + ", Size: "+ rdns.size());
265      *                  Must be in the range [0,size()].
267      *          components at indexes in the range [posn,size()).
268      *          If posn is equal to size(), an empty LDAP name is
275             return new LdapName(null, rdns, posn, rdns.size());
278                 "Posn: " + posn + ", Size: "+ rdns.size());
286      * {@code getPrefix(n.size())}--in other words this LDAP
299         int len1 = rdns.size();
300         int len2 = n.size();
308      * and for every position p in the range [0, rdns.size()) the component
320         int len1 = this.rdns.size();
321         int len2 = rdns.size();
330      * {@code getSuffix(size()-n.size())}--in other words this LDAP
342         int len1 = rdns.size();
343         int len2 = n.size();
351      * and for every position p in the range [size() - rdns.size(), size())
363         int len1 = this.rdns.size();
364         int len2 = rdns.size();
383      * The following must hold:  end - beg == n.size().
417          return addAll(size(), suffix);
428         return addAll(size(), suffixRdns);
439      *                  Must be in the range [0,size()].
474      *                          Must be in the range [0,size()].
482         for (int i = 0; i < suffixRdns.size(); i++) {
503         return add(size(), comp);
515         return add(size(), comp);
527      *                  Must be in the range [0,size()].
551      *                  Must be in the range [0,size()].
573      *                  Must be in the range [0,size()).
608         return new LdapName(unparsed, rdns, 0, rdns.size());
624         int size = rdns.size();
625         if ((size - 1) >= 0) {
626             builder.append(rdns.get(size - 1));
628         for (int next = size - 2; next >= 0; next--) {
661         if (rdns.size() != that.rdns.size()) {
669         for (int i = 0; i < rdns.size(); i++) {
723         int minSize = Math.min(rdns.size(), that.rdns.size());
734         return (rdns.size() - that.rdns.size());        // longer DN wins
750         for (int i = 0; i < rdns.size(); i++) {