| /external/webkit/LayoutTests/dom/xhtml/level3/core/ |
| nodesetuserdata04.js | 81 twice using different Keys. Using getUserData with each Key and isNodeEqual
|
| /external/webkit/Source/WebCore/inspector/front-end/ |
| KeyboardShortcut.js | 51 WebInspector.KeyboardShortcut.Keys = {
91 * It is useful for matching pressed keys.
|
| SearchController.js | 174 if (event.keyCode === WebInspector.KeyboardShortcut.Keys.Esc.code) {
|
| Toolbar.js | 215 if (event.keyCode !== WebInspector.KeyboardShortcut.Keys.Esc.code)
|
| treeoutline.js | 392 } else if (event.keyCode === WebInspector.KeyboardShortcut.Keys.Backspace.code || event.keyCode === WebInspector.KeyboardShortcut.Keys.Delete.code) {
|
| inspector.js | 670 var keys = [
674 section.addRelatedKeys(keys, WebInspector.UIString("Next/previous panel"));
675 section.addKey(shortcut.shortcutToString(shortcut.Keys.Esc), WebInspector.UIString("Toggle console"));
678 keys = [
682 section.addRelatedKeys(keys, WebInspector.UIString("Find next/previous"));
[all...] |
| NetworkPanel.js | 131 if (this._viewingResourceMode && event.keyCode === WebInspector.KeyboardShortcut.Keys.Esc.code) {
[all...] |
| TextViewer.js | 249 var keys = WebInspector.KeyboardShortcut.Keys;
256 this._shortcuts[WebInspector.KeyboardShortcut.makeKey(keys.Enter.code, modifiers.CtrlOrMeta)] = commitEditing;
257 this._shortcuts[WebInspector.KeyboardShortcut.makeKey(keys.Esc.code)] = cancelEditing;
266 this._shortcuts[WebInspector.KeyboardShortcut.makeKey(keys.Tab.code)] = handleTabKey;
267 this._shortcuts[WebInspector.KeyboardShortcut.makeKey(keys.Tab.code, modifiers.Shift)] = handleShiftTabKey;
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Collections/ |
| HashList.cs | 48 /// An Hashtable-backed dictionary that enumerates Keys and Values in
206 ArrayList keys = _hashList._insertionOrderList;
207 for (int i = 0; i < keys.Count; i++)
213 result.Append(keys[i]);
432 public ICollection Keys
|
| /external/guava/guava/src/com/google/common/collect/ |
| Multimaps.java | 491 transient Multiset<K> keys; field in class:Multimaps.UnmodifiableMultimap
564 @Override public Multiset<K> keys() { method in class:Multimaps.UnmodifiableMultimap
565 Multiset<K> result = keys;
567 keys = result = Multisets.unmodifiableMultiset(delegate.keys());
[all...] |
| AbstractMultimap.java | 63 * through the keys and values in sorted order.
65 * <p>Keys and values may be null, as long as the underlying collection classes
993 public Multiset<K> keys() { method
996 return multiset = new Multimaps.Keys<K, V>() {
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| Multimaps.java | 402 transient Multiset<K> keys; field in class:Multimaps.UnmodifiableMultimap
475 @Override public Multiset<K> keys() { method in class:Multimaps.UnmodifiableMultimap
476 Multiset<K> result = keys;
478 keys = result = Multisets.unmodifiableMultiset(delegate.keys());
[all...] |
| /external/webkit/Source/WebKit/win/ |
| WebHistory.cpp | 157 static BSTR keys[6] = {0}; local
158 if (!keys[0]) {
159 keys[0] = SysAllocString(WebHistoryItemsAddedNotification);
160 keys[1] = SysAllocString(WebHistoryItemsRemovedNotification);
161 keys[2] = SysAllocString(WebHistoryAllItemsRemovedNotification);
162 keys[3] = SysAllocString(WebHistoryLoadedNotification);
163 keys[4] = SysAllocString(WebHistoryItemsDiscardedWhileLoadingNotification);
164 keys[5] = SysAllocString(WebHistorySavedNotification);
166 return keys[notifyType];
478 DateToEntriesMap::const_iterator::Keys end = m_entriesByDate.end().keys()
[all...] |
| /external/libvpx/examples/includes/geshi/geshi/ |
| rails.php | 239 'ActiveSupport::CoreExtensions::Hash::Keys',
|
| /external/webkit/Source/JavaScriptCore/wtf/ |
| HashMap.h | 60 // iterators iterate over pairs of keys and values
382 typedef typename HashMap<T, U, V, W, X>::const_iterator::Keys iterator;
386 iterator it = collection.begin().keys();
387 iterator end = collection.end().keys();
|
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.Collections.pas | 48 /// An Hashtable-backed dictionary that enumerates Keys and Values in
|
| /external/clang/lib/CodeGen/ |
| CGObjC.cpp | 108 llvm::Value *Keys = 0;
110 Keys = CreateMemTemp(ElementArrayType, "keys");
125 LValue KeyLV = LValue::MakeAddr(Builder.CreateStructGEP(Keys, i),
150 Args.add(RValue::get(Keys), ArgQT);
[all...] |
| /external/webkit/PerformanceTests/SunSpider/tests/parse-only/ |
| mootools-1.2.2-core-nc.js | 497 associate: function(keys){
498 var obj = {}, length = Math.min(this.length, keys.length);
499 for (var i = 0; i < length; i++) obj[keys[i]] = this[i];
879 var keys = [];
881 keys.push(key);
883 return keys;
945 var key = Event.Keys.keyOf(code);
1003 Event.Keys = new Hash({
[all...] |
| /prebuilt/common/tradefed/ |
| tradefed-prebuilt.jar | |
| /prebuilts/tools/common/guava-tools/ |
| guava-10.0.1.jar | |
| /external/dropbear/libtomcrypt/ |
| crypt.tex | 409 All ciphers store their scheduled keys in a single data type called \textit{symmetric\_key}. This allows all ciphers to
410 have the same prototype and store their keys as naturally as possible. This also removes the need for dynamic memory
411 allocation, and allows you to allocate a fixed sized buffer for storing scheduled keys. All ciphers must provide six visible
544 \index{Symmetric Keys}
545 As a general rule of thumb, do not use symmetric keys under 80 bits if you can help it. Only a few of the ciphers support smaller
546 keys (mainly for test vectors anyways). Ideally, your application should be making at least 256 bit keys. This is not
652 Note that for \textit{DES} and \textit{3DES} they use 8 and 24 byte keys but only 7 and 21 [respectively] bytes of the keys are in
653 fact used for the purposes of encryption. My suggestion is just to use random 8/24 byte keys instead of trying to make a 8/2
[all...] |
