Lines Matching defs:names
47 * <p> X.500 names are used to identify entities, such as those which are
114 * in distinguished names are irrelevant. The characters themselves are
136 private RDN[] names; // RDNs (never null)
206 names = new RDN[4];
211 names[3] = new RDN(1);
212 names[3].assertion[0] = new AVA(commonName_oid,
214 names[2] = new RDN(1);
215 names[2].assertion[0] = new AVA(orgUnitName_oid,
217 names[1] = new RDN(1);
218 names[1].assertion[0] = new AVA(orgName_oid,
220 names[0] = new RDN(1);
221 names[0].assertion[0] = new AVA(countryName_oid,
244 names = new RDN[6];
249 names[5] = new RDN(1);
250 names[5].assertion[0] = new AVA(commonName_oid,
252 names[4] = new RDN(1);
253 names[4].assertion[0] = new AVA(orgUnitName_oid,
255 names[3] = new RDN(1);
256 names[3].assertion[0] = new AVA(orgName_oid,
258 names[2] = new RDN(1);
259 names[2].assertion[0] = new AVA(localityName_oid,
261 names[1] = new RDN(1);
262 names[1].assertion[0] = new AVA(stateName_oid,
264 names[0] = new RDN(1);
265 names[0].assertion[0] = new AVA(countryName_oid,
270 * Constructs a name from an array of relative distinguished names
272 * @param rdnArray array of relative distinguished names
277 names = new RDN[0];
279 names = rdnArray.clone();
280 for (int i = 0; i < names.length; i++) {
281 if (names[i] == null) {
326 list = Collections.unmodifiableList(Arrays.asList(names));
336 return names.length;
347 for (int i = 0; i < names.length; i++) {
348 list.addAll(names[i].avas());
367 int n = names.length;
372 if (names[i].assertion.length != 0) {
390 * @return true iff the names are identical.
405 int n = this.names.length;
406 if (n != other.names.length) {
410 RDN r1 = this.names[i];
411 RDN r2 = other.names[i];
680 if (names.length == 0) {
694 for (int i = names.length - 1; i >= 0; i--) {
695 if (i < names.length - 1) {
698 fullname.append(names[i].toRFC2253String(oidMap));
712 if (names.length == 0) {
727 for (int i = names.length - 1; i >= 0; i--) {
728 if (i < names.length - 1) {
731 fullname.append(names[i].toRFC2253String(true));
748 if (names != null) {
749 for (int i = 0; i < names.length; i++) {
750 DerValue value = names[i].findAttribute(attribute);
764 if (names != null) {
765 for (int i = names.length - 1; i >= 0; i--) {
766 DerValue value = names[i].findAttribute(attribute);
779 // X.500 names are a "SEQUENCE OF" RDNs, which means zero or
800 names = new RDN[0];
802 names = new RDN[nameseq.length];
804 names[i] = new RDN(nameseq[i]);
827 for (int i = 0; i < names.length; i++) {
828 names[i].encode(tmp);
842 for (int i = 0; i < names.length; i++) {
843 names[i].encode(tmp);
876 names = new RDN[0];
943 names = dnVector.toArray(new RDN[dnVector.size()]);
948 names = new RDN[0];
995 names = dnVector.toArray(new RDN[dnVector.size()]);
1059 * relative names have "label=value" syntax.
1064 if (names.length == 1) {
1065 dn = names[0].toString();
1070 if (names != null) {
1071 for (int i = names.length - 1; i >= 0; i--) {
1072 if (i != names.length - 1) {
1075 sb.append(names[i].toString());
1084 * relative names have "label=value" syntax.
1091 if (names.length == 1) {
1092 return names[0].toRFC1779String(oidMap);
1096 if (names != null) {
1097 for (int i = names.length - 1; i >= 0; i--) {
1098 if (i != names.length - 1) {
1101 sb.append(names[i].toRFC1779String(oidMap));
1218 * OIDs from other sources which show up in X.500 names we
1229 * OID for "DC=" domain component attributes, used with DNS names in DN
1267 } else if (inputX500.names.length == 0) {
1269 } else if (this.names.length == 0) {
1296 if (other.names.length == 0) {
1299 if (this.names.length == 0) {
1302 if (names.length < other.names.length) {
1305 for (int i = 0; i < other.names.length; i++) {
1306 if (!names[i].equals(other.names[i])) {
1322 return names.length;
1336 int otherLen = other.names.length;
1337 int thisLen = this.names.length;
1343 //Compare names from highest RDN down the naming tree
1347 if (!names[i].equals(other.names[i])) {
1359 ancestor[j] = names[j];