naming/ldap/LdapName.java

107     private transient List<Rdn> rdns;   // parsed name components
132      * @param rdns The non-null list of {@code Rdn}s forming this LDAP name.
134     public LdapName(List<Rdn> rdns) {
136         // if (rdns instanceof ArrayList<Rdn>) {
137         //      this.rdns = rdns.clone();
138         // } else if (rdns instanceof List<Rdn>) {
139         //      this.rdns = new ArrayList<Rdn>(rdns);
145         this.rdns = new ArrayList<>(rdns.size());
146         for (int i = 0; i < rdns.size(); i++) {
147             Object obj = rdns.get(i);
152             this.rdns.add((Rdn)obj);
158      * of "rdns" in the range [beg,end)) and, optionally
162     private LdapName(String name, List<Rdn> rdns, int beg, int end) {
164         // this.rdns = rdns.subList(beg, end);
166         List<Rdn> sList = rdns.subList(beg, end);
167         this.rdns = new ArrayList<>(sList);
175         return rdns.size();
184         return rdns.isEmpty();
200         final Iterator<Rdn> iter = rdns.iterator();
221         return rdns.get(posn).toString();
233         return rdns.get(posn);
251             return new LdapName(null, rdns, 0, posn);
254                 "Posn: " + posn + ", Size: "+ rdns.size());
275             return new LdapName(null, rdns, posn, rdns.size());
278                 "Posn: " + posn + ", Size: "+ rdns.size());
299         int len1 = rdns.size();
307      * LDAP name.  Returns true if this LdapName is at least as long as rdns,
308      * and for every position p in the range [0, rdns.size()) the component
309      * getRdn(p) matches rdns.get(p). Returns false otherwise. If rdns is
312      * @param rdns The sequence of {@code Rdn}s to check.
313      * @return  true if {@code rdns} form a prefix of this LDAP name,
316     public boolean startsWith(List<Rdn> rdns) {
317         if (rdns == null) {
320         int len1 = this.rdns.size();
321         int len2 = rdns.size();
323                 doesListMatch(0, len2, rdns));
342         int len1 = rdns.size();
350      * LDAP name.  Returns true if this LdapName is at least as long as rdns,
351      * and for every position p in the range [size() - rdns.size(), size())
352      * the component getRdn(p) matches rdns.get(p). Returns false otherwise.
353      * If rdns is null, false is returned.
355      * @param rdns The sequence of {@code Rdn}s to check.
356      * @return  true if {@code rdns} form a suffix of this LDAP name,
359     public boolean endsWith(List<Rdn> rdns) {
360         if (rdns == null) {
363         int len1 = this.rdns.size();
364         int len2 = rdns.size();
366                 doesListMatch(len1 - len2, len1, rdns));
369     private boolean doesListMatch(int beg, int end, List<Rdn> rdns) {
371             if (!this.rdns.get(i).equals(rdns.get(i - beg))) {
388             return doesListMatch(beg, end, ln.rdns);
398                 if (!rdn.equals(rdns.get(i))) {
454             rdns.addAll(posn, s.rdns);
458                 rdns.add(posn++,
488             rdns.add(i + posn, (Rdn)obj);
537         rdns.add(posn, rdn);
561         rdns.add(posn, comp);
583         return rdns.remove(posn).toString();
597         return Collections.unmodifiableList(rdns);
608         return new LdapName(unparsed, rdns, 0, rdns.size());
624         int size = rdns.size();
626             builder.append(rdns.get(size - 1));
630             builder.append(rdns.get(next));
661         if (rdns.size() != that.rdns.size()) {
669         for (int i = 0; i < rdns.size(); i++) {
671             Rdn rdn1 = rdns.get(i);
672             Rdn rdn2 = that.rdns.get(i);
723         int minSize = Math.min(rdns.size(), that.rdns.size());
726             Rdn rdn1 = rdns.get(i);
727             Rdn rdn2 = that.rdns.get(i);
734         return (rdns.size() - that.rdns.size());        // longer DN wins
750         for (int i = 0; i < rdns.size(); i++) {
751             Rdn rdn = rdns.get(i);
783         // rdns = (ArrayList<Rdn>) (new RFC2253Parser(unparsed)).getDN();
785         rdns = new Rfc2253Parser(unparsed).parseDn();