/external/webkit/LayoutTests/http/tests/appcache/ |
dynamic-entries-no-cache-expected.txt | 3 PASS: applicationCache.items.length is 0 4 PASS: applicationCache.items.item(0) is null 5 PASS: applicationCache.items.item(1) is null 6 PASS: applicationCache.items.item(0xffffffff) is null 7 PASS: applicationCache.items.item(0xfffffffe) is null 8 PASS: applicationCache.items.item(-1) is null 9 PASS: applicationCache.items.item(-2) is null 10 PASS: applicationCache.items[0xfffffffe] is undefined 11 PASS: applicationCache.items[0xffffffff] is undefined 12 PASS: applicationCache.items['0'] is undefine [all...] |
dynamic-entries-no-cache.html-disabled | 54 shouldBe("applicationCache.items.length", "0"); 55 shouldBe("applicationCache.items.item(0)", "null"); 56 shouldBe("applicationCache.items.item(1)", "null"); 57 shouldBe("applicationCache.items.item(0xffffffff)", "null"); 58 shouldBe("applicationCache.items.item(0xfffffffe)", "null"); 59 shouldBe("applicationCache.items.item(-1)", "null"); 60 shouldBe("applicationCache.items.item(-2)", "null"); 62 shouldBe("applicationCache.items[0xfffffffe]", "undefined"); 63 shouldBe("applicationCache.items[0xffffffff]", "undefined"); 66 shouldBe("applicationCache.items['0']", "undefined") [all...] |
/external/bluetooth/glib/tests/ |
completion-test.c | 33 GList *items; local 38 items = NULL; 39 items = g_list_append (items, "a\302\243"); 40 items = g_list_append (items, "a\302\244"); 41 items = g_list_append (items, "bb"); 42 items = g_list_append (items, "bc") [all...] |
/external/webkit/WebCore/manual-tests/memory/ |
xhr-multiple-requests-responseXML.html | 27 var items = xmlHttp.responseXML; 30 for ( var i = 0; i < items.childNodes.length; i++ ) { 33 if ( items.childNodes[i].nodeName == "plist" ) { 35 //alert( items.childNodes[i].nodeName ); 37 for ( var j = 0; j < items.childNodes[i].childNodes.length; j++) { 40 if ( items.childNodes[i].childNodes[j].nodeName == "dict" ) { 42 //alert( items.childNodes[i].childNodes[j].nodeName ); 44 for ( var k = 0; k < items.childNodes[i].childNodes[j].childNodes.length; k++) { 47 if ( items.childNodes[i].childNodes[j].childNodes[k].nodeName == "key" ) { 49 //alert( items.childNodes[i].childNodes[j].childNodes[k].nodeName ) [all...] |
/external/qemu/android/utils/ |
reflist.c | 20 /* deferred empty, set all items to NULL 22 void** items = areflist_items(l); local 23 memset(items, 0, l->count*sizeof(items[0])); 28 free(l->u.items); 39 void** items = (l->max == 1) ? &l->u.item0 : l->u.items; local 40 void** end = items + l->count; 41 void** ii = items; 45 return (ii - items); 75 void** items; local 90 void** items = areflist_items(l); local 121 void** items = areflist_items(l); local 151 void** items = areflist_items(l); local 195 void** items; local [all...] |
/dalvik/dx/src/com/android/dx/dex/file/ |
UniformListItem.java | 26 * Class that represents a contiguous list of uniform items. Each 30 * <p>This class inherits its alignment from its items, bumped up to 31 * {@code 4} if the items have a looser alignment requirement. If 46 private final List<T> items; field in class:UniformListItem 53 * @param items {@code non-null and non-empty;} list of items to represent 55 public UniformListItem(ItemType itemType, List<T> items) { 56 super(getAlignment(items), writeSize(items)); 62 this.items = items [all...] |
AnnotationSetItem.java | 38 * {@code non-null;} set of annotations as individual items in an array. 42 private final AnnotationItem[] items; field in class:AnnotationSetItem 53 this.items = new AnnotationItem[annotations.size()]; 57 items[at] = new AnnotationItem(a); 117 int size = items.length; 120 items[i] = byteData.intern(items[i]); 128 AnnotationItem.sortByTypeIdIndex(items); 135 int size = items.length; 145 AnnotationItem item = items[i] [all...] |
UniformItemSection.java | 26 * {@link Item} objects. Each of the items must have the same size in 46 Collection<? extends Item> items = items(); local 47 int sz = items.size(); 54 return sz * items.iterator().next().writeSize(); 75 for (Item one : items()) { 86 for (Item one : items()) { 96 * Since all items must be the same size, we can use the size 106 * Alters or picks the order for items in this instance if desired, 107 * so that subsequent calls to {@link #items} will yield [all...] |
MixedItemSection.java | 63 /** {@code non-null;} the items in this part */ 64 private final ArrayList<OffsettedItem> items; field in class:MixedItemSection 66 /** {@code non-null;} items that have been explicitly interned */ 69 /** {@code non-null;} how to sort the items */ 86 * @param sort how the items should be sorted in the final output 92 this.items = new ArrayList<OffsettedItem>(100); 100 public Collection<? extends Item> items() { method in class:MixedItemSection 101 return items; 119 * Gets the size of this instance, in items. 124 return items.size() [all...] |
/external/openssl/crypto/des/ |
DES.pm | 6 # Items to export into callers namespace by default 10 # Other items we are prepared to export if requested
|
/external/dbus/ |
cleanup-man-pages.sh | 28 (find . -maxdepth 1 -name "_*" | xargs -I ITEMS /bin/mv ITEMS nuke) || die "could not move all underscore-prefixed items" 29 (find . -maxdepth 1 -name "DBus*Internal*" | xargs -I ITEMS /bin/mv ITEMS nuke) || die "could not move all internal-containing items" 30 (find . -maxdepth 1 -name "dbus_*_internal_*" | xargs -I ITEMS /bin/mv ITEMS nuke) || die "could not move all internal-containing items" 65 (find . -maxdepth 1 -name "dbus_*" | xargs -I ITEMS /bin/mv ITEMS keep) || die "could not move all dbus-prefixed items [all...] |
/external/clearsilver/util/ |
ulist.c | 37 new_items = (void **) realloc ((void *)(ul->items), new_size * sizeof(void *)); 43 ul->items = new_items; 66 r_ul->items = (void **) calloc (size, sizeof(void *)); 67 if (r_ul->items == NULL) 115 ul->items[ul->num] = data; 126 *data = ul->items[ul->num - 1]; 148 start = &(ul->items[x]); 150 ul->items[x] = data; 168 *data = ul->items[x]; 170 start = &(ul->items[x]) [all...] |
/packages/apps/Contacts/src/com/android/contacts/ |
Collapser.java | 24 * Class used for collapsing data items into groups of similar items. The data items that should be 26 * function that takes an ArrayList of items and returns a list of the same items collapsed into 38 * can be used for example to collapse similar contact data items into a single item. 46 * Collapses a list of Collapsible items into a list of collapsed items. Items are collapsed 71 // Remove the null items [all...] |
/external/webkit/WebCore/platform/mac/ |
SearchPopupMenuMac.mm | 51 NSMutableArray* items = [[NSMutableArray alloc] initWithCapacity:size]; 53 [items addObject:searchItems[i]]; 54 [[NSUserDefaults standardUserDefaults] setObject:items forKey:autosaveKey(name)]; 55 [items release]; 65 NSArray* items = [[NSUserDefaults standardUserDefaults] arrayForKey:autosaveKey(name)]; 66 size_t size = [items count]; 68 NSString* item = [items objectAtIndex:i];
|
/sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/sdk/ |
FrameworkResourceRepository.java | 53 List<ResourceItem> items = mResourcesMap.get(type); local 55 if (items != null) { 56 return items.toArray(new ResourceItem[items.size()]); 65 List<ResourceItem> items = mResourcesMap.get(type); local 67 return (items != null && items.size() > 0);
|
/external/bluetooth/glib/docs/reference/glib/tmpl/ |
completion.sgml | 15 Target items are added and removed with 23 Items in the completion can be simple strings (e.g. filenames), 44 @items: list of target items (strings or data structures). 46 item. It is %NULL if the target items are strings. 49 @cache: the list of items which begin with @prefix. 60 #GCompletion items. 68 This is used when you use data structures as #GCompletion items. 77 Adds items to the #GCompletion. 81 @items: the list of items to add [all...] |
/external/webkit/WebCore/platform/win/ |
SearchPopupMenuWin.cpp | 49 RetainPtr<CFMutableArrayRef> items; 53 items.adoptCF(CFArrayCreateMutable(0, size, &kCFTypeArrayCallBacks)); 56 CFArrayAppendValue(items.get(), item.get()); 60 CFPreferencesSetAppValue(autosaveKey(name).get(), items.get(), kCFPreferencesCurrentApplication); 70 RetainPtr<CFArrayRef> items(AdoptCF, reinterpret_cast<CFArrayRef>(CFPreferencesCopyAppValue(autosaveKey(name).get(), kCFPreferencesCurrentApplication))); 72 if (!items || CFGetTypeID(items.get()) != CFArrayGetTypeID()) 75 size_t size = CFArrayGetCount(items.get()); 77 CFStringRef item = (CFStringRef)CFArrayGetValueAtIndex(items.get(), i);
|
/external/quake/quake/src/QW/progs/ |
progs.src | 6 items.qc
|
/packages/providers/CalendarProvider/src/com/android/providers/calendar/ |
CalendarDebug.java | 80 // items is the list of items to display in the list. 81 List<Map<String, String>> items = new ArrayList<Map<String, String>>(); local 88 addItem(items, mActivity.getString(R.string.calendar_info_error), ""); 128 addItem(items, displayName, text); 134 addItem(items, mActivity.getString(R.string.calendar_info_error), e.toString()); 141 if (items.size() == 0) { 142 addItem(items, mActivity.getString(R.string.calendar_info_no_calendars), ""); 144 return items; 150 * @param items The info items to display [all...] |
/external/bison/src/ |
closure.h | 36 ITEMS, of length N), set up RULESET and ITEMSET to indicate what 37 rules could be run and which items could be accepted when those 38 items are the active ones. 46 significant). CLOSURE places there the indices of all items which 49 void closure (item_number *items, size_t n);
|
/external/webkit/WebCore/dom/ |
SelectElement.cpp | 100 const Vector<Element*>& items = data.listItems(element); local 101 for (unsigned i = 0; i < items.size(); ++i) { 102 OptionElement* optionElement = toOptionElement(items[i]); 109 const Vector<Element*>& items = data.listItems(element); local 111 while (index >= 0 && (unsigned) index < items.size() && (!isOptionElement(items[index]) || items[index]->disabled())) 113 if ((unsigned) index == items.size()) 120 const Vector<Element*>& items = data.listItems(element); local 122 startIndex = items.size() 139 const Vector<Element*>& items = data.listItems(element); local 160 const Vector<Element*>& items = data.listItems(element); local 182 const Vector<Element*>& items = data.listItems(element); local 302 const Vector<Element*>& items = data.listItems(element); local 316 const Vector<Element*>& items = data.listItems(element); local 360 const Vector<Element*>& items = data.listItems(element); local 379 const Vector<Element*>& items = data.listItems(element); local 409 const Vector<Element*>& items = data.listItems(element); local 421 const Vector<Element*>& items = data.listItems(element); local 440 const Vector<Element*>& items = data.listItems(element); local 468 const Vector<Element*>& items = data.listItems(element); local 501 const Vector<Element*>& items = data.listItems(element); local 817 const Vector<Element*>& items = data.listItems(element); local 872 const Vector<Element*>& items = data.listItems(element); local 919 const Vector<Element*>& items = data.listItems(element); local 936 const Vector<Element*>& items = data.listItems(element); local 962 const Vector<Element*>& items = m_listItems; local [all...] |
/libcore/luni/src/main/java/java/util/concurrent/ |
ArrayBlockingQueue.java | 57 * even for the items array, which is default-serialized, even if 63 /** The queued items */ 64 private final E[] items; field in class:ArrayBlockingQueue 65 /** items index for next take, poll or remove */ 67 /** items index for next put, offer, or add. */ 69 /** Number of items in the queue */ 90 return (++i == items.length)? 0 : i; 98 items[putIndex] = x; 109 final E[] items = this.items; local 123 final E[] items = this.items; local 251 final E[] items = this.items; local 484 final E[] items = this.items; local 538 final E[] items = this.items; local 577 final E[] items = this.items; local 607 final E[] items = this.items; local [all...] |
/external/chromium/third_party/icu/source/data/brkitr/ |
title.txt | 17 # If the iterator starts on a cased item, advance through all adjacent cased items plus 29 # If the iterator starts on a cased item, advance through all adjacent cased items plus
|
/external/icu4c/data/brkitr/ |
title.txt | 17 # If the iterator starts on a cased item, advance through all adjacent cased items plus 29 # If the iterator starts on a cased item, advance through all adjacent cased items plus
|
/frameworks/base/telephony/java/com/android/internal/telephony/gsm/stk/ |
Menu.java | 31 public List<Item> items; field in class:Menu 44 items = new ArrayList<Item>(); 60 // rebuild items list. 61 items = new ArrayList<Item>(); 65 items.add(item); 82 // write items list to the parcel. 83 int size = items.size(); 86 dest.writeParcelable(items.get(i), flags);
|