/forgerock/openam-v13/openam-core/src/main/java/com/sun/identity/entitlement/ |
H A D | DenyOverride.java | 42 protected boolean combine(Boolean b1, Boolean b2) { argument 43 return b1.booleanValue() && b2.booleanValue();
|
/forgerock/opendj-v3/opendj-legacy/src/main/java/org/opends/server/backends/jeb/ |
H A D | VLVKeyComparator.java | 41 public int compare(byte[] b1, byte[] b2) { argument
|
/forgerock/openam/openam-core/src/main/java/com/sun/identity/entitlement/ |
H A D | DenyOverride.java | 42 protected boolean combine(Boolean b1, Boolean b2) { argument 43 return b1.booleanValue() && b2.booleanValue();
|
/forgerock/opendj2/src/server/org/opends/server/backends/jeb/ |
H A D | VLVKeyComparator.java | 88 * @param b2 The second byte array to use in the comparison. 91 * <CODE>b2</CODE> in ascending order, a positive integer if 92 * <CODE>b1</CODE> should come after <CODE>b2</CODE> in ascending 96 public int compare(byte[] b1, byte[] b2) argument 102 if(b2.length == 0) 111 else if(b2.length == 0) 119 j < orderingRules.length && b1Pos < b1.length && b2Pos < b2.length; 134 int b2Length = b2[b2Pos] & 0x7F; 135 if (b2[b2Pos++] != b2Length) 142 (b2[b2Po [all...] |
/forgerock/opendj-b2.6/src/server/org/opends/server/backends/jeb/ |
H A D | VLVKeyComparator.java | 89 * @param b2 The second byte array to use in the comparison. 92 * <CODE>b2</CODE> in ascending order, a positive integer if 93 * <CODE>b1</CODE> should come after <CODE>b2</CODE> in ascending 97 public int compare(byte[] b1, byte[] b2) argument 103 if(b2.length == 0) 112 else if(b2.length == 0) 120 j < orderingRules.length && b1Pos < b1.length && b2Pos < b2.length; 135 int b2Length = b2[b2Pos] & 0x7F; 136 if (b2[b2Pos++] != b2Length) 143 (b2[b2Po [all...] |
/forgerock/opendj2.6.2/src/server/org/opends/server/backends/jeb/ |
H A D | VLVKeyComparator.java | 89 * @param b2 The second byte array to use in the comparison. 92 * <CODE>b2</CODE> in ascending order, a positive integer if 93 * <CODE>b1</CODE> should come after <CODE>b2</CODE> in ascending 97 public int compare(byte[] b1, byte[] b2) argument 103 if(b2.length == 0) 112 else if(b2.length == 0) 120 j < orderingRules.length && b1Pos < b1.length && b2Pos < b2.length; 135 int b2Length = b2[b2Pos] & 0x7F; 136 if (b2[b2Pos++] != b2Length) 143 (b2[b2Po [all...] |
/forgerock/opendj2-hg/src/server/org/opends/server/backends/jeb/ |
H A D | VLVKeyComparator.java | 88 * @param b2 The second byte array to use in the comparison. 91 * <CODE>b2</CODE> in ascending order, a positive integer if 92 * <CODE>b1</CODE> should come after <CODE>b2</CODE> in ascending 96 public int compare(byte[] b1, byte[] b2) argument 102 if(b2.length == 0) 111 else if(b2.length == 0) 119 j < orderingRules.length && b1Pos < b1.length && b2Pos < b2.length; 134 int b2Length = b2[b2Pos] & 0x7F; 135 if (b2[b2Pos++] != b2Length) 142 (b2[b2Po [all...] |
/forgerock/opendj2-jel-hg/src/server/org/opends/server/backends/jeb/ |
H A D | VLVKeyComparator.java | 89 * @param b2 The second byte array to use in the comparison. 92 * <CODE>b2</CODE> in ascending order, a positive integer if 93 * <CODE>b1</CODE> should come after <CODE>b2</CODE> in ascending 97 public int compare(byte[] b1, byte[] b2) argument 103 if(b2.length == 0) 112 else if(b2.length == 0) 120 j < orderingRules.length && b1Pos < b1.length && b2Pos < b2.length; 135 int b2Length = b2[b2Pos] & 0x7F; 136 if (b2[b2Pos++] != b2Length) 143 (b2[b2Po [all...] |
/forgerock/opendj-b2.6/src/server/org/opends/server/replication/plugin/ |
H A D | HistoricalCsnOrderingMatchingRule.java | 162 public int compare(byte[] b1, byte[] b2) argument 170 int minLength = Math.min(b1.length, b2.length); 174 if (b1[i] == b2[i]) 178 else if (b1[i] < b2[i]) 182 else if (b1[i] > b2[i]) 188 if (b1.length == b2.length) 192 else if (b1.length < b2.length)
|
/forgerock/opendj-b2.6/src/server/org/opends/server/schema/ |
H A D | CaseExactOrderingMatchingRule.java | 219 * @param b2 The second byte array to use in the comparison. 222 * <CODE>b2</CODE> in ascending order, a positive integer if 223 * <CODE>b1</CODE> should come after <CODE>b2</CODE> in ascending 227 public int compare(byte[] b1, byte[] b2) argument 229 return StaticUtils.compare(b1, b2);
|
H A D | CaseIgnoreOrderingMatchingRule.java | 219 * @param b2 The second byte array to use in the comparison. 222 * <CODE>b2</CODE> in ascending order, a positive integer if 223 * <CODE>b1</CODE> should come after <CODE>b2</CODE> in ascending 227 public int compare(byte[] b1, byte[] b2) argument 229 return StaticUtils.compare(b1, b2);
|
H A D | GeneralizedTimeOrderingMatchingRule.java | 246 * @param b2 The second byte array to use in the comparison. 249 * <CODE>b2</CODE> in ascending order, a positive integer if 250 * <CODE>b1</CODE> should come after <CODE>b2</CODE> in ascending 254 public int compare(byte[] b1, byte[] b2) argument 256 return compareValues(ByteString.wrap(b1), ByteString.wrap(b2));
|
H A D | IntegerOrderingMatchingRule.java | 489 * @param b2 The second byte array to use in the comparison. 492 * <CODE>b2</CODE> in ascending order, a positive integer if 493 * <CODE>b1</CODE> should come after <CODE>b2</CODE> in ascending 497 public int compare(byte[] b1, byte[] b2) argument 500 int b2Length = b2.length; 510 else if (b2[0] == '-') 535 if (b2[0] == '-') 549 if (b1[i] > b2[i]) 553 else if (b1[i] < b2[i]) 567 else if (b2[ [all...] |
H A D | NumericStringOrderingMatchingRule.java | 231 * @param b2 The second byte array to use in the comparison. 234 * <CODE>b2</CODE> in ascending order, a positive integer if 235 * <CODE>b1</CODE> should come after <CODE>b2</CODE> in ascending 239 public int compare(byte[] b1, byte[] b2) argument 241 return StaticUtils.compare(b1, b2);
|
H A D | OctetStringOrderingMatchingRule.java | 186 * @param b2 The second byte array to use in the comparison. 189 * <CODE>b2</CODE> in ascending order, a positive integer if 190 * <CODE>b1</CODE> should come after <CODE>b2</CODE> in ascending 194 public int compare(byte[] b1, byte[] b2) argument 196 return StaticUtils.compare(b1, b2);
|
H A D | UUIDOrderingMatchingRule.java | 296 * @param b2 The second byte array to use in the comparison. 299 * <CODE>b2</CODE> in ascending order, a positive integer if 300 * <CODE>b1</CODE> should come after <CODE>b2</CODE> in ascending 304 public int compare(byte[] b1, byte[] b2) argument 306 return StaticUtils.compare(b1, b2);
|
/forgerock/opendj2/src/server/org/opends/server/replication/plugin/ |
H A D | HistoricalCsnOrderingMatchingRule.java | 161 public int compare(byte[] b1, byte[] b2) argument 169 int minLength = Math.min(b1.length, b2.length); 173 if (b1[i] == b2[i]) 177 else if (b1[i] < b2[i]) 181 else if (b1[i] > b2[i]) 187 if (b1.length == b2.length) 191 else if (b1.length < b2.length)
|
/forgerock/opendj2/src/server/org/opends/server/schema/ |
H A D | CaseExactOrderingMatchingRule.java | 218 * @param b2 The second byte array to use in the comparison. 221 * <CODE>b2</CODE> in ascending order, a positive integer if 222 * <CODE>b1</CODE> should come after <CODE>b2</CODE> in ascending 226 public int compare(byte[] b1, byte[] b2) argument 228 return StaticUtils.compare(b1, b2);
|
H A D | CaseIgnoreOrderingMatchingRule.java | 218 * @param b2 The second byte array to use in the comparison. 221 * <CODE>b2</CODE> in ascending order, a positive integer if 222 * <CODE>b1</CODE> should come after <CODE>b2</CODE> in ascending 226 public int compare(byte[] b1, byte[] b2) argument 228 return StaticUtils.compare(b1, b2);
|
H A D | GeneralizedTimeOrderingMatchingRule.java | 245 * @param b2 The second byte array to use in the comparison. 248 * <CODE>b2</CODE> in ascending order, a positive integer if 249 * <CODE>b1</CODE> should come after <CODE>b2</CODE> in ascending 253 public int compare(byte[] b1, byte[] b2) argument 255 return compareValues(ByteString.wrap(b1), ByteString.wrap(b2));
|
H A D | IntegerOrderingMatchingRule.java | 488 * @param b2 The second byte array to use in the comparison. 491 * <CODE>b2</CODE> in ascending order, a positive integer if 492 * <CODE>b1</CODE> should come after <CODE>b2</CODE> in ascending 496 public int compare(byte[] b1, byte[] b2) argument 499 int b2Length = b2.length; 509 else if (b2[0] == '-') 534 if (b2[0] == '-') 548 if (b1[i] > b2[i]) 552 else if (b1[i] < b2[i]) 566 else if (b2[ [all...] |
H A D | NumericStringOrderingMatchingRule.java | 230 * @param b2 The second byte array to use in the comparison. 233 * <CODE>b2</CODE> in ascending order, a positive integer if 234 * <CODE>b1</CODE> should come after <CODE>b2</CODE> in ascending 238 public int compare(byte[] b1, byte[] b2) argument 240 return StaticUtils.compare(b1, b2);
|
H A D | OctetStringOrderingMatchingRule.java | 185 * @param b2 The second byte array to use in the comparison. 188 * <CODE>b2</CODE> in ascending order, a positive integer if 189 * <CODE>b1</CODE> should come after <CODE>b2</CODE> in ascending 193 public int compare(byte[] b1, byte[] b2) argument 195 return StaticUtils.compare(b1, b2);
|
H A D | UUIDOrderingMatchingRule.java | 295 * @param b2 The second byte array to use in the comparison. 298 * <CODE>b2</CODE> in ascending order, a positive integer if 299 * <CODE>b1</CODE> should come after <CODE>b2</CODE> in ascending 303 public int compare(byte[] b1, byte[] b2) argument 305 return StaticUtils.compare(b1, b2);
|
/forgerock/opendj2.6.2/src/server/org/opends/server/replication/plugin/ |
H A D | HistoricalCsnOrderingMatchingRule.java | 162 public int compare(byte[] b1, byte[] b2) argument 170 int minLength = Math.min(b1.length, b2.length); 174 if (b1[i] == b2[i]) 178 else if (b1[i] < b2[i]) 182 else if (b1[i] > b2[i]) 188 if (b1.length == b2.length) 192 else if (b1.length < b2.length)
|