/forgerock/web-agents-v4/tests/ |
H A D | test_policy_cache.c | 413 static void test_cache_keys(int test_size, char** keys, am_request_t* request, struct am_policy_result* result) argument 419 assert_int_equal(am_add_session_policy_cache_entry(request, keys [i], result, NULL), AM_SUCCESS); 424 assert_int_equal(am_add_session_policy_cache_entry(request, keys [i], result, NULL), AM_SUCCESS); 433 assert_int_equal(am_get_session_policy_cache_entry(request, keys [i], &r, &session, &ets), AM_SUCCESS); 730 char* keys[TEST_SIZE_1]; local 737 keys[i] = strdup(key); 743 assert_string_equal(key, keys[i]);
|
H A D | test_utility.c | 777 char keys[KEY_REMOVE_TEST_ITERATIONS][KEY_REMOVE_BUFFER_SIZE]; local 782 create_random_cache_key(keys [i], KEY_REMOVE_BUFFER_SIZE); 783 char **addr = property_map_get_value_addr(map, keys[i]); 791 qsort(keys, KEY_REMOVE_TEST_ITERATIONS, KEY_REMOVE_BUFFER_SIZE, compare_keys); 794 if (! property_map_remove_key(map, keys[i]))
|
/forgerock/openam/openam-oauth2/src/main/java/org/forgerock/openidconnect/ |
H A D | OpenIdConnectToken.java | 151 protected void setClaims(JwtClaimsSet claims, String... keys) { argument 152 for (String key : keys) {
|
/forgerock/opendj-b2.6/src/server/org/opends/server/schema/ |
H A D | CollationMatchingRuleFactory.java | 1474 * Decomposes an attribute value into a set of substring index keys. 1479 * A set into which the keys will be inserted. 1481 private void subtringKeys(ByteString attValue, Set<byte[]> keys) argument 1489 keys.add(keyBytes); 1496 * Decomposes an attribute value into a set of substring index keys. 1501 * The map into which the modified keys will be inserted. 1503 * <code>true</code> if generated keys should be inserted 1626 // Read the range: lower <= keys < upper. 1905 // Read the range: lower < keys <= upper. 2042 // Read the range: lower <= keys < uppe 2094 getKeys(AttributeValue value, Set<byte[]> keys) argument 2180 getKeys(AttributeValue value, Set<byte[]> keys) argument [all...] |
/forgerock/opendj2/src/server/org/opends/server/backends/jeb/importLDIF/ |
H A D | IndexOutputBuffer.java | 39 * This class represents a index buffer used to store the keys and entry IDs 92 * id is used to break a tie (keys equal) when the buffers are being merged 107 /** keys - number of keys in the buffer. */ 108 private int keys = 0; field in class:IndexOutputBuffer 114 /** The comparator to use sort the keys. */ 160 keys = 0; 275 sort(0, keys); 296 keys++; 401 /** Used to minimized memory usage when comparing keys [all...] |
/forgerock/opendj-b2.6/src/server/org/opends/server/backends/jeb/importLDIF/ |
H A D | IndexOutputBuffer.java | 42 * This class represents a index buffer used to store the keys and entry IDs 79 //id is used to break a tie (keys equal) when the buffers are being merged 93 //keys - number of keys in the buffer 95 private int keys = 0, position = 0; field in class:IndexOutputBuffer 97 //The comparator to use sort the keys. 137 keys = 0; 253 sort(0, keys); 272 keys++; 366 //Used to minimized memory usage when comparing keys [all...] |
/forgerock/opendj2/src/server/org/opends/server/schema/ |
H A D | CollationMatchingRuleFactory.java | 1473 * Decomposes an attribute value into a set of substring index keys. 1478 * A set into which the keys will be inserted. 1480 private void subtringKeys(ByteString attValue, Set<byte[]> keys) argument 1488 keys.add(keyBytes); 1495 * Decomposes an attribute value into a set of substring index keys. 1500 * The map into which the modified keys will be inserted. 1502 * <code>true</code> if generated keys should be inserted 1625 // Read the range: lower <= keys < upper. 1904 // Read the range: lower < keys <= upper. 2041 // Read the range: lower <= keys < uppe 2093 getKeys(AttributeValue value, Set<byte[]> keys) argument 2179 getKeys(AttributeValue value, Set<byte[]> keys) argument [all...] |
/forgerock/opendj2.6.2/src/server/org/opends/server/backends/jeb/importLDIF/ |
H A D | IndexOutputBuffer.java | 42 * This class represents a index buffer used to store the keys and entry IDs 79 //id is used to break a tie (keys equal) when the buffers are being merged 93 //keys - number of keys in the buffer 95 private int keys = 0, position = 0; field in class:IndexOutputBuffer 97 //The comparator to use sort the keys. 137 keys = 0; 253 sort(0, keys); 272 keys++; 366 //Used to minimized memory usage when comparing keys [all...] |
/forgerock/opendj2.6.2/src/server/org/opends/server/schema/ |
H A D | CollationMatchingRuleFactory.java | 1474 * Decomposes an attribute value into a set of substring index keys. 1479 * A set into which the keys will be inserted. 1481 private void subtringKeys(ByteString attValue, Set<byte[]> keys) argument 1489 keys.add(keyBytes); 1496 * Decomposes an attribute value into a set of substring index keys. 1501 * The map into which the modified keys will be inserted. 1503 * <code>true</code> if generated keys should be inserted 1626 // Read the range: lower <= keys < upper. 1905 // Read the range: lower < keys <= upper. 2042 // Read the range: lower <= keys < uppe 2094 getKeys(AttributeValue value, Set<byte[]> keys) argument 2180 getKeys(AttributeValue value, Set<byte[]> keys) argument [all...] |
/forgerock/opendj2-jel-hg/src/server/org/opends/server/schema/ |
H A D | CollationMatchingRuleFactory.java | 1474 * Decomposes an attribute value into a set of substring index keys. 1479 * A set into which the keys will be inserted. 1481 private void subtringKeys(ByteString attValue, Set<byte[]> keys) argument 1489 keys.add(keyBytes); 1496 * Decomposes an attribute value into a set of substring index keys. 1501 * The map into which the modified keys will be inserted. 1503 * <code>true</code> if generated keys should be inserted 1626 // Read the range: lower <= keys < upper. 1905 // Read the range: lower < keys <= upper. 2042 // Read the range: lower <= keys < uppe 2094 getKeys(AttributeValue value, Set<byte[]> keys) argument 2180 getKeys(AttributeValue value, Set<byte[]> keys) argument [all...] |
/forgerock/opendj2-hg/src/server/org/opends/server/backends/jeb/importLDIF/ |
H A D | IndexOutputBuffer.java | 39 * This class represents a index buffer used to store the keys and entry IDs 92 * id is used to break a tie (keys equal) when the buffers are being merged 107 /** keys - number of keys in the buffer. */ 108 private int keys = 0; field in class:IndexOutputBuffer 114 /** The comparator to use sort the keys. */ 160 keys = 0; 275 sort(0, keys); 296 keys++; 401 /** Used to minimized memory usage when comparing keys [all...] |
/forgerock/opendj2-hg/src/server/org/opends/server/schema/ |
H A D | CollationMatchingRuleFactory.java | 1473 * Decomposes an attribute value into a set of substring index keys. 1478 * A set into which the keys will be inserted. 1480 private void subtringKeys(ByteString attValue, Set<byte[]> keys) argument 1488 keys.add(keyBytes); 1495 * Decomposes an attribute value into a set of substring index keys. 1500 * The map into which the modified keys will be inserted. 1502 * <code>true</code> if generated keys should be inserted 1625 // Read the range: lower <= keys < upper. 1904 // Read the range: lower < keys <= upper. 2041 // Read the range: lower <= keys < uppe 2093 getKeys(AttributeValue value, Set<byte[]> keys) argument 2179 getKeys(AttributeValue value, Set<byte[]> keys) argument [all...] |
/forgerock/opendj2-jel-hg/src/server/org/opends/server/backends/jeb/importLDIF/ |
H A D | IndexOutputBuffer.java | 42 * This class represents a index buffer used to store the keys and entry IDs 79 //id is used to break a tie (keys equal) when the buffers are being merged 93 //keys - number of keys in the buffer 95 private int keys = 0, position = 0; field in class:IndexOutputBuffer 97 //The comparator to use sort the keys. 137 keys = 0; 253 sort(0, keys); 272 keys++; 366 //Used to minimized memory usage when comparing keys [all...] |
/forgerock/openam-v13/openam-core/src/main/java/com/sun/identity/entitlement/opensso/ |
H A D | Cache.java | 69 * This class implements a Cache, which maps keys to values. Any 73 * objects used as keys must implement the <code>hashCode</code> 116 * The Enumerations returned by Cache's keys and values methods are 248 * Returns the number of keys in this Cache. 250 * @return the number of keys in this Cache. 257 * Tests if this Cache maps no keys to values. 259 * @return <code>true</code> if this Cache maps no keys to values; 267 * Returns an enumeration of the keys in this Cache. 269 * @return an enumeration of the keys in this Cache. 275 public synchronized Enumeration keys() { method in class:Cache [all...] |
/forgerock/opendj-v3/opendj-server-legacy/src/main/java/org/opends/server/backends/pluggable/ |
H A D | AttributeIndex.java | 66 * indexing are equality, presence, substrings and ordering. The keys in the 122 void indexEntry(Entry entry, Set<ByteString> keys) argument 125 indexAttribute(attributes, keys); 130 final Set<ByteString> keys = new HashSet<>(); 131 indexEntry(entry, keys); 132 return keys; 158 private void indexAttribute(List<Attribute> attributes, Set<ByteString> keys) argument 172 indexer.createKeys(Schema.getDefaultSchema(), value, keys); 203 SortedSet<ByteString> keys = new TreeSet<>(); 204 indexer.createKeys(Schema.getDefaultSchema(), ByteString.valueOfUtf8(key), keys); [all...] |
/forgerock/openam-v13/openam-federation/openam-federation-library/src/main/java/com/sun/identity/saml/ |
H A D | AssertionManager.java | 2558 private Set keys; field in class:AssertionManager.GoThroughRunnable 2562 this.keys = new HashSet(); 2567 synchronized (keys) { 2568 return keys.add(obj); 2573 synchronized (keys) { 2574 return keys.remove(obj); 2592 synchronized (keys) { 2593 Iterator keyIter = keys.iterator();
|
/forgerock/openam-v13/openam-shared/src/main/java/com/iplanet/am/util/ |
H A D | Cache.java | 67 * This class implements a Cache, which maps keys to values. Any 71 * objects used as keys must implement the <code>hashCode</code> 114 * The Enumerations returned by Cache's keys and values methods are 230 * Returns the number of keys in this Cache. 232 * @return the number of keys in this Cache. 239 * Tests if this Cache maps no keys to values. 241 * @return <code>true</code> if this Cache maps no keys to values; 249 * Returns an enumeration of the keys in this Cache. 251 * @return an enumeration of the keys in this Cache. 257 public synchronized Enumeration keys() { method in class:Cache [all...] |
/forgerock/openidm-v4/openidm-repo-jdbc/src/main/java/org/forgerock/openidm/repo/jdbc/impl/ |
H A D | MappedTableHandler.java | 534 // Check for sort keys and build up order-by syntax 536 List<String> keys = new ArrayList<String>(); 540 keys.add("${" + tokenName + "}" + (sortKey.isAscendingOrder() ? " ASC" : " DESC")); 543 pageClause = " ORDER BY " + StringUtils.join(keys, ", ") + pageClause; 552 * Loops through sort keys constructing the key statements. 554 * @param sortKeys a {@link List} of sort keys 555 * @param keys a {@link List} to store ORDER BY keys 558 protected void prepareSortKeyStatements(List<SortKey> sortKeys, List<String> keys, Map<String, Object> replacementTokens) { argument 561 keys [all...] |
/forgerock/openam/openam-shared/src/main/java/com/iplanet/am/util/ |
H A D | Cache.java | 67 * This class implements a Cache, which maps keys to values. Any 71 * objects used as keys must implement the <code>hashCode</code> 114 * The Enumerations returned by Cache's keys and values methods are 230 * Returns the number of keys in this Cache. 232 * @return the number of keys in this Cache. 239 * Tests if this Cache maps no keys to values. 241 * @return <code>true</code> if this Cache maps no keys to values; 249 * Returns an enumeration of the keys in this Cache. 251 * @return an enumeration of the keys in this Cache. 257 public synchronized Enumeration keys() { method in class:Cache [all...] |
/forgerock/openam/openam-core/src/main/java/com/sun/identity/entitlement/opensso/ |
H A D | Cache.java | 69 * This class implements a Cache, which maps keys to values. Any 73 * objects used as keys must implement the <code>hashCode</code> 116 * The Enumerations returned by Cache's keys and values methods are 248 * Returns the number of keys in this Cache. 250 * @return the number of keys in this Cache. 257 * Tests if this Cache maps no keys to values. 259 * @return <code>true</code> if this Cache maps no keys to values; 267 * Returns an enumeration of the keys in this Cache. 269 * @return an enumeration of the keys in this Cache. 275 public synchronized Enumeration keys() { method in class:Cache [all...] |
/forgerock/openam/openam-federation/openam-federation-library/src/main/java/com/sun/identity/saml/ |
H A D | AssertionManager.java | 2560 private Set keys; field in class:AssertionManager.GoThroughRunnable 2564 this.keys = new HashSet(); 2569 synchronized (keys) { 2570 return keys.add(obj); 2575 synchronized (keys) { 2576 return keys.remove(obj); 2594 synchronized (keys) { 2595 Iterator keyIter = keys.iterator();
|
/forgerock/openam-v13/openam-core/src/main/java/com/sun/identity/jaxrpc/ |
H A D | SOAPClient.java | 540 List types, maps, keys; field in class:SOAPClient.SOAPContentHandler 557 keys = new LinkedList(); 634 map1.put(keys.remove(0), currentSet); 638 map2.put(keys.remove(0), map1); 641 map1.put(keys.remove(0), currentList); 645 map.put(keys.remove(0), currentString.toString()); 650 keys.add(0, currentString.toString());
|
/forgerock/openam-v13/openam-shared/src/main/java/com/sun/identity/shared/jaxrpc/ |
H A D | SOAPClient.java | 608 List types, maps, keys; field in class:SOAPClient.SOAPContentHandler 640 keys = new LinkedList(); 726 map1.put(keys.remove(0), currentSet); 730 map2.put(keys.remove(0), map1); 733 map1.put(keys.remove(0), currentList); 737 map.put(keys.remove(0), currentString.toString()); 742 keys.add(0, currentString.toString());
|
/forgerock/openam/openam-shared/src/main/java/com/sun/identity/shared/jaxrpc/ |
H A D | SOAPClient.java | 608 List types, maps, keys; field in class:SOAPClient.SOAPContentHandler 640 keys = new LinkedList(); 726 map1.put(keys.remove(0), currentSet); 730 map2.put(keys.remove(0), map1); 733 map1.put(keys.remove(0), currentList); 737 map.put(keys.remove(0), currentString.toString()); 742 keys.add(0, currentString.toString());
|
/forgerock/openam/openam-core/src/main/java/com/sun/identity/jaxrpc/ |
H A D | SOAPClient.java | 540 List types, maps, keys; field in class:SOAPClient.SOAPContentHandler 557 keys = new LinkedList(); 634 map1.put(keys.remove(0), currentSet); 638 map2.put(keys.remove(0), map1); 641 map1.put(keys.remove(0), currentList); 645 map.put(keys.remove(0), currentString.toString()); 650 keys.add(0, currentString.toString());
|