HomeSort by relevance Sort by last modified time
    Searched refs:item (Results 1 - 25 of 5060) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/openssl/crypto/pqueue/
pq_test.c 65 pitem *item; local
70 item = pitem_new(3, NULL);
71 pqueue_insert(pq, item);
73 item = pitem_new(1, NULL);
74 pqueue_insert(pq, item);
76 item = pitem_new(2, NULL);
77 pqueue_insert(pq, item);
79 item = pqueue_find(pq, 1);
80 fprintf(stderr, "found %ld\n", item->priority);
82 item = pqueue_find(pq, 2)
    [all...]
  /external/chromium/webkit/glue/
webmenuitem.cc 16 WebMenuItem::WebMenuItem(const WebKit::WebMenuItemInfo& item)
17 : label(item.label),
18 type(static_cast<Type>(item.type)),
19 action(item.action),
20 rtl(item.textDirection == WebKit::WebTextDirectionRightToLeft),
21 has_directional_override(item.hasTextDirectionOverride),
22 enabled(item.enabled),
23 checked(item.checked) {
26 WebMenuItem::WebMenuItem(const WebMenuItem& item)
27 : label(item.label)
    [all...]
  /system/core/toolbox/grep/
queue.c 62 struct qentry *item; local
64 item = grep_malloc(sizeof(struct qentry));
65 item->data.dat = grep_malloc(sizeof(char) * x->len);
66 item->data.len = x->len;
67 item->data.line_no = x->line_no;
68 item->data.off = x->off;
69 memcpy(item->data.dat, x->dat, x->len);
70 item->data.file = x->file;
72 STAILQ_INSERT_TAIL(&queue, item, list);
75 item = dequeue()
84 struct qentry *item; local
98 struct qentry *item; local
110 struct qentry *item; local
    [all...]
  /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/LexicalConventions/
7.7.3.js 49 var item = 0;
51 array[item++] = new TestCase( SECTION, "0", 0, 0 );
52 array[item++] = new TestCase( SECTION, "1", 1, 1 );
53 array[item++] = new TestCase( SECTION, "2", 2, 2 );
54 array[item++] = new TestCase( SECTION, "3", 3, 3 );
55 array[item++] = new TestCase( SECTION, "4", 4, 4 );
56 array[item++] = new TestCase( SECTION, "5", 5, 5 );
57 array[item++] = new TestCase( SECTION, "6", 6, 6 );
58 array[item++] = new TestCase( SECTION, "7", 7, 7 );
59 array[item++] = new TestCase( SECTION, "8", 8, 8 )
    [all...]
7.7.4.js 47 var item = 0;
51 array[item++] = new TestCase( SECTION, "\"\"", "", "" );
52 array[item++] = new TestCase( SECTION, "\'\'", "", '' );
55 array[item++] = new TestCase( SECTION, "\\\"", String.fromCharCode(0x0022), "\"" );
56 array[item++] = new TestCase( SECTION, "\\\'", String.fromCharCode(0x0027), "\'" );
57 array[item++] = new TestCase( SECTION, "\\", String.fromCharCode(0x005C), "\\" );
58 array[item++] = new TestCase( SECTION, "\\b", String.fromCharCode(0x0008), "\b" );
59 array[item++] = new TestCase( SECTION, "\\f", String.fromCharCode(0x000C), "\f" );
60 array[item++] = new TestCase( SECTION, "\\n", String.fromCharCode(0x000A), "\n" );
61 array[item++] = new TestCase( SECTION, "\\r", String.fromCharCode(0x000D), "\r" )
    [all...]
  /external/clang/test/CodeGen/
2003-11-19-AddressOfRegister.c 3 struct item { struct
8 register struct item *aa;
  /frameworks/base/core/java/android/webkit/
WebBackForwardListClient.java 27 * Notify the client that <var>item</var> has been added to the
29 * @param item The newly created WebHistoryItem
31 public void onNewHistoryItem(WebHistoryItem item) { }
34 * Notify the client that the <var>item</var> at <var>index</var> is now
35 * the current history item.
36 * @param item A WebHistoryItem
39 public void onIndexChanged(WebHistoryItem item, int index) { }
  /frameworks/support/v4/honeycomb/android/support/v4/view/
MenuItemCompatHoneycomb.java 26 public static void setShowAsAction(MenuItem item, int actionEnum) {
27 item.setShowAsAction(actionEnum);
30 public static MenuItem setActionView(MenuItem item, View view) {
31 return item.setActionView(view);
34 public static MenuItem setActionView(MenuItem item, int resId) {
35 return item.setActionView(resId);
38 public static View getActionView(MenuItem item) {
39 return item.getActionView();
  /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/TypeConversion/
9.8.1.js 105 var item = 0;
107 array[item++] = new TestCase( SECTION, "Number.NaN", "NaN", Number.NaN + "" );
108 array[item++] = new TestCase( SECTION, "0", "0", 0 + "" );
109 array[item++] = new TestCase( SECTION, "-0", "0", -0 + "" );
110 array[item++] = new TestCase( SECTION, "Number.POSITIVE_INFINITY", "Infinity", Number.POSITIVE_INFINITY + "" );
111 array[item++] = new TestCase( SECTION, "Number.NEGATIVE_INFINITY", "-Infinity", Number.NEGATIVE_INFINITY + "" );
112 array[item++] = new TestCase( SECTION, "-1", "-1", -1 + "" );
116 array[item++] = new TestCase( SECTION, "1", "1", 1 + "" );
117 array[item++] = new TestCase( SECTION, "10", "10", 10 + "" );
118 array[item++] = new TestCase( SECTION, "100", "100", 100 + "" )
    [all...]
9.3.1-1.js 68 var item = 0;
79 array[item++] = new TestCase( SECTION, "Number('')", 0, Number("") );
80 array[item++] = new TestCase( SECTION, "Number(' ')", 0, Number(" ") );
81 array[item++] = new TestCase( SECTION, "Number(\\t)", 0, Number("\t") );
82 array[item++] = new TestCase( SECTION, "Number(\\n)", 0, Number("\n") );
83 array[item++] = new TestCase( SECTION, "Number(\\r)", 0, Number("\r") );
84 array[item++] = new TestCase( SECTION, "Number(\\f)", 0, Number("\f") );
86 array[item++] = new TestCase( SECTION, "Number(String.fromCharCode(0x0009)", 0, Number(String.fromCharCode(0x0009)) );
87 array[item++] = new TestCase( SECTION, "Number(String.fromCharCode(0x0020)", 0, Number(String.fromCharCode(0x0020)) );
88 array[item++] = new TestCase( SECTION, "Number(String.fromCharCode(0x000C)", 0, Number(String.fromCharCod (…)
    [all...]
  /system/core/libcutils/
list.c 25 void list_add_tail(struct listnode *head, struct listnode *item)
27 item->next = head;
28 item->prev = head->prev;
29 head->prev->next = item;
30 head->prev = item;
33 void list_remove(struct listnode *item)
35 item->next->prev = item->prev;
36 item->prev->next = item->next
    [all...]
  /external/webrtc/src/system_wrappers/source/
map_no_stl.cc 17 MapNoStlItem::MapNoStlItem(int id, void* item)
21 item_ptr_(item)
79 MapNoStlItem* item = first_; local
81 if (!item)
87 while(item->next_)
90 // 1. Item should be inserted first.
91 // 2. Item should be inserted between two items
92 // 3. Item should be inserted last
93 if (item->GetId() > id)
95 new_item->next_ = item;
148 MapNoStlItem* item = Locate(id); local
165 MapNoStlItem* item = Locate(id); local
175 MapNoStlItem* item = first_; local
    [all...]
  /frameworks/support/v4/ics/android/support/v4/view/
MenuItemCompatIcs.java 23 public static boolean expandActionView(MenuItem item) {
24 return item.expandActionView();
27 public static boolean collapseActionView(MenuItem item) {
28 return item.collapseActionView();
31 public static boolean isActionViewExpanded(MenuItem item) {
32 return item.isActionViewExpanded();
35 public static MenuItem setOnActionExpandListener(MenuItem item,
37 return item.setOnActionExpandListener(new OnActionExpandListenerWrapper(listener));
46 boolean onMenuItemActionExpand(MenuItem item);
47 boolean onMenuItemActionCollapse(MenuItem item);
    [all...]
  /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/GlobalObject/
15.1.2.3-2.js 73 var item = 0;
75 array[item++] = new TestCase( SECTION, "parseFloat(true)", Number.NaN, parseFloat(true) );
76 array[item++] = new TestCase( SECTION, "parseFloat(false)", Number.NaN, parseFloat(false) );
77 array[item++] = new TestCase( SECTION, "parseFloat('string')", Number.NaN, parseFloat("string") );
79 array[item++] = new TestCase( SECTION, "parseFloat(' Infinity')", Number.POSITIVE_INFINITY, parseFloat("Infinity") );
80 // array[item++] = new TestCase( SECTION, "parseFloat(Infinity)", Number.POSITIVE_INFINITY, parseFloat(Infinity) );
82 array[item++] = new TestCase( SECTION, "parseFloat(' 0')", 0, parseFloat(" 0") );
83 array[item++] = new TestCase( SECTION, "parseFloat(' -0')", -0, parseFloat(" -0") );
84 array[item++] = new TestCase( SECTION, "parseFloat(' +0')", 0, parseFloat(" +0") );
86 array[item++] = new TestCase( SECTION, "parseFloat(' 1')", 1, parseFloat(" (…)
    [all...]
15.1.2.6.js 49 var item = 0;
51 array[item++] = new TestCase( SECTION, "isNaN.length", 1, isNaN.length );
52 array[item++] = new TestCase( SECTION, "var MYPROPS=''; for ( var p in isNaN ) { MYPROPS+= p }; MYPROPS", "", eval("var MYPROPS=''; for ( var p in isNaN ) { MYPROPS+= p }; MYPROPS") );
53 array[item++] = new TestCase( SECTION, "isNaN.length = null; isNaN.length", 1, eval("isNaN.length=null; isNaN.length") );
54 array[item++] = new TestCase( SECTION, "delete isNaN.length", false, delete isNaN.length );
55 array[item++] = new TestCase( SECTION, "delete isNaN.length; isNaN.length", 1, eval("delete isNaN.length; isNaN.length") );
57 // array[item++] = new TestCase( SECTION, "isNaN.__proto__", Function.prototype, isNaN.__proto__ );
59 array[item++] = new TestCase( SECTION, "isNaN()", true, isNaN() );
60 array[item++] = new TestCase( SECTION, "isNaN( null )", false, isNaN(null) );
61 array[item++] = new TestCase( SECTION, "isNaN( void 0 )", true, isNaN(void 0) )
    [all...]
  /frameworks/support/v4/java/android/support/v4/view/
MenuItemCompat.java 32 * Never show this item as a button in an Action Bar.
37 * Show this item as a button in an Action Bar if the system
43 * Always show this item as a button in an Action Bar. Use sparingly!
52 * When this item is in the action bar, always show it with a
58 * This item's action view collapses to a normal menu item.
68 boolean setShowAsAction(MenuItem item, int actionEnum);
69 MenuItem setActionView(MenuItem item, View view);
70 MenuItem setActionView(MenuItem item, int resId);
71 View getActionView(MenuItem item);
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Misc/
ListStack`1.cs 47 T item;
48 if (!TryPeek(depth, out item))
51 return item;
54 public bool TryPeek(out T item)
56 return TryPeek(0, out item);
59 public bool TryPeek(int depth, out T item)
63 item = default(T);
67 item = this[Count - depth - 1];
80 public bool TryPop(out T item)
84 item = default(T)
    [all...]
  /external/wpa_supplicant_8/src/utils/
list.h 26 static inline void dl_list_add(struct dl_list *list, struct dl_list *item)
28 item->next = list->next;
29 item->prev = list;
30 list->next->prev = item;
31 list->next = item;
34 static inline void dl_list_add_tail(struct dl_list *list, struct dl_list *item)
36 dl_list_add(list->prev, item);
39 static inline void dl_list_del(struct dl_list *item)
41 item->next->prev = item->prev
54 struct dl_list *item; local
    [all...]
  /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/String/
15.5.1.js 51 var item = 0;
53 array[item++] = new TestCase( SECTION, "String('string primitive')", "string primitive", String('string primitive') );
54 array[item++] = new TestCase( SECTION, "String(void 0)", "undefined", String( void 0) );
55 array[item++] = new TestCase( SECTION, "String(null)", "null", String( null ) );
56 array[item++] = new TestCase( SECTION, "String(true)", "true", String( true) );
57 array[item++] = new TestCase( SECTION, "String(false)", "false", String( false ) );
58 array[item++] = new TestCase( SECTION, "String(Boolean(true))", "true", String(Boolean(true)) );
59 array[item++] = new TestCase( SECTION, "String(Boolean(false))", "false", String(Boolean(false)) );
60 array[item++] = new TestCase( SECTION, "String(Boolean())", "false", String(Boolean(false)) );
61 array[item++] = new TestCase( SECTION, "String(new Array())", "", String( new Array()) )
    [all...]
  /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/Expressions/
11.9.1.js 65 var item = 0;
69 array[item++] = new TestCase( SECTION, "void 0 = void 0", true, void 0 == void 0 );
70 array[item++] = new TestCase( SECTION, "null == null", true, null == null );
74 array[item++] = new TestCase( SECTION, "NaN == NaN", false, Number.NaN == Number.NaN );
75 array[item++] = new TestCase( SECTION, "NaN == 0", false, Number.NaN == 0 );
76 array[item++] = new TestCase( SECTION, "0 == NaN", false, 0 == Number.NaN );
77 array[item++] = new TestCase( SECTION, "NaN == Infinity", false, Number.NaN == Number.POSITIVE_INFINITY );
78 array[item++] = new TestCase( SECTION, "Infinity == NaN", false, Number.POSITIVE_INFINITY == Number.NaN );
82 array[item++] = new TestCase( SECTION, "Number.MAX_VALUE == Number.MAX_VALUE", true, Number.MAX_VALUE == Number.MAX_VALUE );
83 array[item++] = new TestCase( SECTION, "Number.MIN_VALUE == Number.MIN_VALUE", true, Number.MIN_VALUE (…)
    [all...]
11.9.2.js 64 var item = 0;
68 array[item++] = new TestCase( SECTION, "void 0 == void 0", false, void 0 != void 0 );
69 array[item++] = new TestCase( SECTION, "null == null", false, null != null );
73 array[item++] = new TestCase( SECTION, "NaN != NaN", true, Number.NaN != Number.NaN );
74 array[item++] = new TestCase( SECTION, "NaN != 0", true, Number.NaN != 0 );
75 array[item++] = new TestCase( SECTION, "0 != NaN", true, 0 != Number.NaN );
76 array[item++] = new TestCase( SECTION, "NaN != Infinity", true, Number.NaN != Number.POSITIVE_INFINITY );
77 array[item++] = new TestCase( SECTION, "Infinity != NaN", true, Number.POSITIVE_INFINITY != Number.NaN );
81 array[item++] = new TestCase( SECTION, "Number.MAX_VALUE != Number.MAX_VALUE", false, Number.MAX_VALUE != Number.MAX_VALUE );
82 array[item++] = new TestCase( SECTION, "Number.MIN_VALUE != Number.MIN_VALUE", false, Number.MIN_VALUE (…)
    [all...]
11.9.3.js 64 var item = 0;
68 array[item++] = new TestCase( SECTION, "void 0 = void 0", true, void 0 == void 0 );
69 array[item++] = new TestCase( SECTION, "null == null", true, null == null );
73 array[item++] = new TestCase( SECTION, "NaN == NaN", false, Number.NaN == Number.NaN );
74 array[item++] = new TestCase( SECTION, "NaN == 0", false, Number.NaN == 0 );
75 array[item++] = new TestCase( SECTION, "0 == NaN", false, 0 == Number.NaN );
76 array[item++] = new TestCase( SECTION, "NaN == Infinity", false, Number.NaN == Number.POSITIVE_INFINITY );
77 array[item++] = new TestCase( SECTION, "Infinity == NaN", false, Number.POSITIVE_INFINITY == Number.NaN );
81 array[item++] = new TestCase( SECTION, "Number.MAX_VALUE == Number.MAX_VALUE", true, Number.MAX_VALUE == Number.MAX_VALUE );
82 array[item++] = new TestCase( SECTION, "Number.MIN_VALUE == Number.MIN_VALUE", true, Number.MIN_VALUE (…)
    [all...]
11.4.6.js 54 var item = 0;
55 array[item++] = new TestCase( SECTION, "+('')", 0, +("") );
56 array[item++] = new TestCase( SECTION, "+(' ')", 0, +(" ") );
57 array[item++] = new TestCase( SECTION, "+(\\t)", 0, +("\t") );
58 array[item++] = new TestCase( SECTION, "+(\\n)", 0, +("\n") );
59 array[item++] = new TestCase( SECTION, "+(\\r)", 0, +("\r") );
60 array[item++] = new TestCase( SECTION, "+(\\f)", 0, +("\f") );
62 array[item++] = new TestCase( SECTION, "+(String.fromCharCode(0x0009)", 0, +(String.fromCharCode(0x0009)) );
63 array[item++] = new TestCase( SECTION, "+(String.fromCharCode(0x0020)", 0, +(String.fromCharCode(0x0020)) );
64 array[item++] = new TestCase( SECTION, "+(String.fromCharCode(0x000C)", 0, +(String.fromCharCode(0x000C)) (…)
    [all...]
  /hardware/ti/wlan/lib/
shlist.c 19 SHLIST *item; local
21 for(item=head->next;( item != head );item=item->next)
23 if( func( val, item->data ) ) {
24 return( item );
28 if( item->data == val ) {
29 return( item );
51 SHLIST *item; local
96 SHLIST *item; local
114 SHLIST *item; local
133 SHLIST *item, *iptr; local
158 SHLIST *item; local
170 SHLIST *item; local
    [all...]
  /external/chromium/chrome/browser/importer/
importer_progress_observer.h 20 // Invoked when data for the specified item is about to be collected.
21 virtual void ImportItemStarted(ImportItem item) = 0;
23 // Invoked when data for the specified item has been collected from the
25 virtual void ImportItemEnded(ImportItem item) = 0;

Completed in 1618 milliseconds

1 2 3 4 5 6 7 8 91011>>