Searched refs:key (Results 1 - 25 of 6813) sorted by path

1234567891011>>

/external/antlr/antlr-3.4/lib/
H A Dantlr-3.4-complete.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ...
/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/
H A DFlexAntTasks.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/adobe/ com/adobe/ac/ com/adobe/ac/ant/ ...
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/
H A DRecognizerSharedState.as47 * the memoization table for ruleIndex. For key ruleStartIndex, you
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3collections.h52 key; member in struct:ANTLR3_HASH_KEY_struct
57 * Stores the original key so that duplicate keys can be rejected
58 * if necessary, and contains function can be supported. If the hash key
131 void (*del) (struct ANTLR3_HASH_TABLE_struct * table, void * key);
132 pANTLR3_HASH_ENTRY (*remove) (struct ANTLR3_HASH_TABLE_struct * table, void * key);
133 void * (*get) (struct ANTLR3_HASH_TABLE_struct * table, void * key);
134 ANTLR3_INT32 (*put) (struct ANTLR3_HASH_TABLE_struct * table, void * key, void * element, void (ANTLR3_CDECL *freeptr)(void *));
137 void (*delI) (struct ANTLR3_HASH_TABLE_struct * table, ANTLR3_INTKEY key);
138 pANTLR3_HASH_ENTRY (*removeI) (struct ANTLR3_HASH_TABLE_struct * table, ANTLR3_INTKEY key);
139 void * (*getI) (struct ANTLR3_HASH_TABLE_struct * table, ANTLR3_INTKEY key);
352 ANTLR3_INTKEY key; /**< This is the actual key that the entry represents if it is a terminal node */ member in struct:ANTLR3_INT_TRIE_NODE_struct
[all...]
H A Dantlr3defs.h546 ANTLR3_API ANTLR3_UINT32 antlr3Hash (void * key, ANTLR3_UINT32 keylen);
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3bitset.c212 pANTLR3_HASH_KEY key; local
223 while (en->next(en, &key, (void **)(&bit)) == ANTLR3_SUCCESS)
H A Dantlr3collections.c47 static void antlr3HashDelete (pANTLR3_HASH_TABLE table, void * key);
48 static void * antlr3HashGet (pANTLR3_HASH_TABLE table, void * key);
49 static pANTLR3_HASH_ENTRY antlr3HashRemove (pANTLR3_HASH_TABLE table, void * key);
50 static ANTLR3_INT32 antlr3HashPut (pANTLR3_HASH_TABLE table, void * key, void * element, void (ANTLR3_CDECL *freeptr)(void *));
54 static void antlr3HashDeleteI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key);
55 static void * antlr3HashGetI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key);
56 static pANTLR3_HASH_ENTRY antlr3HashRemoveI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key);
57 static ANTLR3_INT32 antlr3HashPutI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key, void * element, void (ANTLR3_CDECL *freeptr)(void *));
66 static int antlr3EnumNext (pANTLR3_HASH_ENUM en, pANTLR3_HASH_KEY * key, void ** data);
72 static void antlr3ListDelete(pANTLR3_LIST list, ANTLR3_INTKEY key);
274 antlr3HashRemoveI(pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key) argument
331 antlr3HashRemove(pANTLR3_HASH_TABLE table, void * key) argument
396 antlr3HashDeleteI(pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key) argument
420 antlr3HashDelete(pANTLR3_HASH_TABLE table, void * key) argument
444 antlr3HashGetI(pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key) argument
483 antlr3HashGet(pANTLR3_HASH_TABLE table, void * key) argument
523 antlr3HashPutI(pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key, void * element, void (ANTLR3_CDECL *freeptr)(void *)) argument
594 antlr3HashPut(pANTLR3_HASH_TABLE table, void * key, void * element, void (ANTLR3_CDECL *freeptr)(void *)) argument
729 antlr3EnumNext(pANTLR3_HASH_ENUM en, pANTLR3_HASH_KEY * key, void ** data) argument
834 antlr3Hash(void * key, ANTLR3_UINT32 keylen) argument
916 antlr3ListDelete(pANTLR3_LIST list, ANTLR3_INTKEY key) argument
922 antlr3ListGet(pANTLR3_LIST list, ANTLR3_INTKEY key) argument
931 ANTLR3_INTKEY key; local
941 antlr3ListRemove(pANTLR3_LIST list, ANTLR3_INTKEY key) argument
958 antlr3ListPut(pANTLR3_LIST list, ANTLR3_INTKEY key, void * element, void (ANTLR3_CDECL *freeptr)(void *)) argument
1035 antlr3StackGet(pANTLR3_STACK stack, ANTLR3_INTKEY key) argument
1821 intTrieGet(pANTLR3_INT_TRIE trie, ANTLR3_INTKEY key) argument
1891 intTrieDel(pANTLR3_INT_TRIE trie, ANTLR3_INTKEY key) argument
1913 intTrieAdd(pANTLR3_INT_TRIE trie, ANTLR3_INTKEY key, ANTLR3_UINT32 type, ANTLR3_INTKEY intVal, void * data, void (ANTLR3_CDECL *freeptr)(void *)) argument
[all...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Collections/
H A DHashList.cs388 public object this[object key]
390 get { return _dictionary[key]; }
393 bool isNewEntry = !_dictionary.Contains(key);
394 _dictionary[key] = value;
396 _insertionOrderList.Add(key);
401 public void Remove(object key) argument
403 _dictionary.Remove(key);
404 _insertionOrderList.Remove(key);
408 public bool Contains(object key) argument
410 return _dictionary.Contains(key);
425 Add(object key, object value) argument
[all...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.JavaExtensions/
H A DDictionaryExtensions.cs45 public static bool containsKey(IDictionary map, object key) { argument
46 return map.Contains(key);
50 public static object get(IDictionary map, object key) { argument
51 return map[key];
55 public static TValue get<TKey, TValue>(IDictionary<TKey, TValue> map, TKey key) { argument
57 if (map.TryGetValue(key, out value))
67 public static TValue get<TKey, TValue>(Dictionary<TKey, TValue> map, TKey key) { argument
69 if (map.TryGetValue(key, out value))
78 public static TValue get<TKey, TValue>(SortedList<TKey, TValue> map, TKey key) { argument
80 if (map.TryGetValue(key, ou
91 put(IDictionary map, object key, object value) argument
96 put(IDictionary<TKey, TValue> map, TKey key, TValue value) argument
101 put(Dictionary<TKey, TValue> map, TKey key, TValue value) argument
[all...]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/
H A DDictionaryExtensions.cs44 public static bool containsKey( this IDictionary map, object key )
46 return map.Contains( key );
50 public static object get( this IDictionary map, object key )
52 return map[key];
55 public static TValue get<TKey, TValue>( this IDictionary<TKey, TValue> map, TKey key )
58 if ( map.TryGetValue( key, out value ) )
68 public static TValue get<TKey, TValue>( this Dictionary<TKey, TValue> map, TKey key )
71 if ( map.TryGetValue( key, out value ) )
80 public static TValue get<TKey, TValue>( this SortedList<TKey, TValue> map, TKey key )
83 if ( map.TryGetValue( key, ou
93 put( this IDictionary map, object key, object value ) argument
99 put( this IDictionary<TKey, TValue> map, TKey key, TValue value ) argument
105 put( this Dictionary<TKey, TValue> map, TKey key, TValue value ) argument
[all...]
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/
H A DAntlr.Runtime.Tools.Tests.pas571 Check(False, 'Unknown key in dictionary');
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
H A DAntlr.Runtime.pas574 /// For key RuleStartIndex, you get back the stop token for
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
H A DACBTree.h26 __strong NSString *key; /* key pointer id */ variable
27 char kstr[BTKeySize]; /* key entry */
31 @property (retain) NSString *key; variable
55 NSInteger keylen; /* length of key */
82 - (ACBTree *) internalinsert:(ACBKey *)key value:(id)value split:(NSInteger *)h;
83 - (ACBTree *) insert:(ACBKey *)key value:(id)value index:(NSInteger)hi split:(NSInteger *)h;
85 - (NSInteger)insinnode:(ACBKey *)key value:(id)value;
88 - (ACBTree *)search:(id)key;
89 - (NSInteger)searchnode:(id)key matc
[all...]
/external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/
H A DAssignTokenTypesWalker.g233 String key = $ID.text;
234 $opts.put(key, $optionValue.value);
236 if ( currentRuleName==null && key.equals("tokenVocab") )
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
H A DMultiMap.java34 /** A hash table that maps a key to a list of elements not just a single. */
36 public void map(K key, V value) { argument
37 List<V> elementsForKey = get(key);
40 super.put(key, elementsForKey);
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
H A DAttributeScope.java179 String key = (String) it.next();
180 if ( other.attributes.get(key)!=null ) {
181 inter.add(key);
H A DCompositeGrammar.java161 public Object getOption(String key) { argument
162 return delegateGrammarTreeRoot.getOption(key);
H A DCompositeGrammarTree.java70 public Object getOption(String key) { argument
71 if ( grammar.tool!=null && key!=null && key.equals("language") &&
75 Object o = grammar.getLocallyDefinedOption(key);
80 return parent.getOption(key);
H A DGrammar.java193 * interpretation of the key/value pairs...they are simply available for
2476 /** Save the option key/value pair and process it; return the key
2479 public String setOption(String key, Object value, Token optionsStartToken) { argument
2480 if ( legalOption(key) ) {
2484 key);
2487 if ( !optionIsValid(key, value) ) {
2490 if ( key.equals("backtrack") && value.toString().equals("true") ) {
2496 options.put(key, value);
2497 return key;
2500 legalOption(String key) argument
2529 getOption(String key) argument
2533 getLocallyDefinedOption(String key) argument
2544 getBlockOption(GrammarAST blockAST, String key) argument
2587 optionIsValid(String key, Object value) argument
[all...]
H A DGrammarAST.java195 /** Save the option key/value pair and process it; return the key
198 public String setBlockOption(Grammar grammar, String key, Object value) { argument
202 return setOption(blockOptions, Grammar.legalBlockOptions, grammar, key, value);
205 public String setTerminalOption(Grammar grammar, String key, Object value) { argument
209 return setOption(terminalOptions, Grammar.legalTokenOptions, grammar, key, value);
212 public String setOption(Map options, Set legalOptions, Grammar grammar, String key, Object value) { argument
213 if ( !legalOptions.contains(key) ) {
217 key);
226 if ( key
236 getBlockOption(String key) argument
[all...]
H A DNameSpaceChecker.java84 String key = (String) it.next();
89 key,
H A DRule.java523 /** Save the option key/value pair and process it; return the key
526 public String setOption(String key, Object value, Token optionsStartToken) { argument
527 if ( !legalOptions.contains(key) ) {
531 key);
537 if ( key.equals("memoize") && value.toString().equals("true") ) {
540 if ( key.equals("backtrack") && value.toString().equals("true") ) {
543 if ( key.equals("k") ) {
546 options.put(key, value);
547 return key;
[all...]
/external/apache-harmony/crypto/src/test/api/java.injected/javax/crypto/
H A DCipherSpiTest.java253 protected void engineInit(int opmode, Key key, SecureRandom random) argument
257 protected void engineInit(int opmode, Key key, argument
262 protected void engineInit(int opmode, Key key, AlgorithmParameters params, argument
H A DExemptionMechanismSpiTest.java65 Key key = null;
69 emSpi.engineInit(key);
74 emSpi.engineInit(key, params);
79 emSpi.engineInit(key, parSpec);
83 key = ((MyExemptionMechanismSpi) emSpi).new tmp1Key("Proba", new byte[0]);
85 emSpi.engineInit(key);
90 emSpi.engineInit(key, params);
95 emSpi.engineInit(key, parSpec);
99 key = ((MyExemptionMechanismSpi) emSpi).new tmpKey("Proba", new byte[0]);
100 emSpi.engineInit(key);
[all...]
H A DKeyAgreementSpiTest.java75 Key key = null;
77 kaSpi.engineInit(key, new SecureRandom());
83 kaSpi.engineInit(key, params, new SecureRandom());

Completed in 603 milliseconds

1234567891011>>