/external/chromium_org/third_party/libjingle/source/talk/xmpp/ |
H A D | pubsubtasks_unittest.cc | 27 const std::vector<buzz::PubSubItem>& items) { 28 OnItems(items); 32 const std::vector<buzz::PubSubItem>& items) { 33 OnItems(items); 36 void OnItems(const std::vector<buzz::PubSubItem>& items) { argument 37 for (std::vector<buzz::PubSubItem>::const_iterator item = items.begin(); 38 item != items.end(); ++item) { 44 this->items.push_back(handled_item); 60 std::vector<HandledPubSubItem> items; member in class:TestPubSubTasksListener 96 "<pub:items nod 26 OnReceiveUpdate(buzz::PubSubReceiveTask* task, const std::vector<buzz::PubSubItem>& items) argument 31 OnRequestResult(buzz::PubSubRequestTask* task, const std::vector<buzz::PubSubItem>& items) argument [all...] |
/external/chromium_org/third_party/mesa/src/src/mesa/program/ |
H A D | prog_cache.c | 47 struct cache_item **items; member in struct:gl_program_cache 84 struct cache_item **items; local 91 items = (struct cache_item**) malloc(size * sizeof(*items)); 92 memset(items, 0, size * sizeof(*items)); 95 for (c = cache->items[i]; c; c = next) { 97 c->next = items[c->hash % size]; 98 items[c->hash % size] = c; 101 free(cache->items); [all...] |
/external/chromium_org/third_party/simplejson/ |
H A D | ordered_dict.py | 76 items = [[k, self[k]] for k in self] 82 return (self.__class__, (items,), inst_dict) 83 return self.__class__, (items,) 92 items = DictMixin.items variable in class:OrderedDict 100 return '%s(%r)' % (self.__class__.__name__, self.items()) 115 all(p==q for p, q in zip(self.items(), other.items()))
|
/external/chromium_org/ui/accessibility/ |
H A D | ax_node_data.cc | 20 std::string IntVectorToString(const std::vector<int>& items) { argument 22 for (size_t i = 0; i < items.size(); ++i) { 25 str += IntToString(items[i]);
|
/external/compiler-rt/lib/sanitizer_common/tests/ |
H A D | sanitizer_list_test.cc | 64 ListItem items[6]; local 70 ListItem *x = &items[0]; 71 ListItem *y = &items[1]; 72 ListItem *z = &items[2]; 73 ListItem *a = &items[3]; 74 ListItem *b = &items[4]; 75 ListItem *c = &items[5];
|
/external/deqp/executor/tools/ |
H A D | xeExtractSampleLists.cpp | 78 void extractSampleLists (const char* casePath, int* listNdx, const xe::ri::List& items) argument 80 for (int itemNdx = 0; itemNdx < items.getNumItems(); itemNdx++) 82 const xe::ri::Item& child = items.getItem(itemNdx); 85 extractSampleLists(casePath, listNdx, static_cast<const xe::ri::Section&>(child).items);
|
/external/dexmaker/src/dx/java/com/android/dx/dex/file/ |
H A D | 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[ [all...] |
H A D | ClassDefsSection.java | 57 public Collection<? extends Item> items() { method in class:ClassDefsSection
|
H A D | 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) { argument 56 super(getAlignment(items), writeSize(items)); 62 this.items 74 getAlignment(List<? extends OffsettedItem> items) argument 93 writeSize(List<? extends OffsettedItem> items) argument [all...] |
/external/freetype/src/gzip/ |
H A D | zutil.c | 83 voidpf zcalloc (voidpf opaque, unsigned items, unsigned size) argument 86 ulg bsize = (ulg)items*size; 142 voidpf zcalloc (voidpf opaque, unsigned items, unsigned size) argument 145 return _halloc((long)items, size); 160 extern voidp ft_scalloc OF((uInt items, uInt size)); 164 voidpf zcalloc (opaque, items, size) 166 unsigned items; 169 if (opaque) items += size - size; /* make compiler happy */ 170 return (voidpf)ft_scalloc(items, size);
|
/external/icu/icu4c/source/test/perf/leperf/ |
H A D | letrperf.cpp | 19 long *items = 0; variable 22 long items[ITEM_COUNT]; member in struct:OneObject 30 Long items[ITEM_COUNT]; member in struct:CompObject 36 if(items[i]==2) { 47 if(obj.items[i]==2) { 55 long *items2 = ((OneObject*)ref)->items; 75 long *items2 = ((OneObject*)ref)->items; 77 if(items[i]==2) { 91 long *items2 = ((OneObject*)ref)->items; 98 if(items[ [all...] |
/external/libexif/libexif/pentax/ |
H A D | mnote-pentax-entry.c | 74 } items[] = { variable in typeref:struct:__anon23677 347 for (i = 0; (items[i].tag && items[i].tag != entry->tag); i++); 348 if (!items[i].tag) { 355 for (j = 0; items[i].elem[j].string && 356 (items[i].elem[j].index < vs); j++); 357 if (items[i].elem[j].index != vs) { 362 strncpy (val, _(items[i].elem[j].string), maxlen);
|
/external/markdown/markdown/ |
H A D | odict.py | 57 def items(self): member in class:OrderedDict 78 for k, v in dict_.items(): 112 return '{%s}' % ', '.join(['%r: %r' % (k, v) for k, v in self.items()])
|
/external/mesa3d/src/mesa/program/ |
H A D | prog_cache.c | 47 struct cache_item **items; member in struct:gl_program_cache 84 struct cache_item **items; local 91 items = (struct cache_item**) malloc(size * sizeof(*items)); 92 memset(items, 0, size * sizeof(*items)); 95 for (c = cache->items[i]; c; c = next) { 97 c->next = items[c->hash % size]; 98 items[c->hash % size] = c; 101 free(cache->items); [all...] |
/external/openssl/crypto/pqueue/ |
H A D | pqueue.c | 66 pitem *items; member in struct:_pqueue 115 if (pq->items == NULL) 117 pq->items = item; 121 for(curr = NULL, next = pq->items; 133 pq->items = item; 153 return pq->items; 159 pitem *item = pq->items; 161 if (pq->items != NULL) 162 pq->items = pq->items [all...] |
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/ |
H A D | fx_zlib_zutil.c | 222 voidpf ZLIB_INTERNAL zcalloc (voidpf opaque, unsigned items, unsigned size) 225 ulg bsize = (ulg)items*size; 281 voidpf ZLIB_INTERNAL zcalloc (voidpf opaque, uInt items, uInt size) 284 return _halloc((long)items, size); 302 extern voidp calloc OF((uInt items, uInt size)); 306 voidpf ZLIB_INTERNAL zcalloc (opaque, items, size) 308 unsigned items; 311 if (opaque) items += size - size; /* make compiler happy */ 312 return sizeof(uInt) > 2 ? (voidpf)malloc(items * size) : 313 (voidpf)calloc(items, siz 341 zcalloc(voidpf opaque, unsigned items, unsigned size) argument [all...] |
/external/qemu/android/tools/ |
H A D | gen-hw-config.py | 58 # parse the source file and record items 60 # support files without sections, or multiply defined items 62 items = [] variable 109 if lastItem: items.append(lastItem) 115 items.append(lastItem) 133 for item in items:
|
/external/qemu/android/utils/ |
H A D | reflist.h | 31 * - 'count' is the number of items in the list 33 * always >= 'count'. Some slots correspond to deleted items 37 * - 'u.items' is the slot array if 'max > 1' 46 void** items; member in union:ARefList::__anon29212 60 /* Return the number of items in a list */
|
/external/qemu/scripts/ |
H A D | ordereddict.py | 80 items = [[k, self[k]] for k in self] 86 return (self.__class__, (items,), inst_dict) 87 return self.__class__, (items,) 96 items = DictMixin.items variable in class:OrderedDict 104 return '%s(%r)' % (self.__class__.__name__, self.items()) 120 for p, q in zip(self.items(), other.items()):
|
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
H A D | ShadowItemizedOverlay.java | 23 private ArrayList<Item> items = new ArrayList<Item>(); field in class:ShadowItemizedOverlay 32 items.clear(); 34 items.add(getBridge().createItem(i)); 40 return items.get(position);
|
/external/smack/src/org/jivesoftware/smackx/packet/ |
H A D | DiscoverItems.java | 33 * A DiscoverItems IQ packet, which is used by XMPP clients to request and receive items 36 * The items could also be queried in order to discover if they contain items inside. Some items 43 public static final String NAMESPACE = "http://jabber.org/protocol/disco#items"; 45 private final List<Item> items = new CopyOnWriteArrayList<Item>(); field in class:DiscoverItems 54 synchronized (items) { 55 items.add(item); 60 * Adds a collection of items to the discovered information. Does nothing if itemsToAdd is null 72 * Returns the discovered items o [all...] |
H A D | MUCAdmin.java | 39 private List<Item> items = new ArrayList<Item>(); field in class:MUCAdmin 49 synchronized (items) { 50 return Collections.unmodifiableList(new ArrayList<Item>(items)).iterator(); 60 synchronized (items) { 61 items.add(item); 68 synchronized (items) { 69 for (int i = 0; i < items.size(); i++) { 70 Item item = items.get(i);
|
/external/smack/src/org/jivesoftware/smackx/pubsub/ |
H A D | ItemsExtension.java | 22 * <li>It can represent an event containing a list of items that have been published
23 * <li>It can represent an event containing a list of retracted (deleted) items.
24 * <li>It can represent a request to delete a list of items.
25 * <li>It can represent a request to get existing items.
36 protected List<? extends PacketExtension> items;
field in class:ItemsExtension 40 /** An items element, which has an optional <b>max_items</b> attribute when requesting items */
41 items(PubSubElementType.ITEMS, "max_items"),
enum constant in enum:ItemsExtension.ItemsElementType 67 * Construct an instance with a list representing items that have been published or deleted.
70 * <li>Request items fro 84 ItemsExtension(ItemsElementType itemsType, String nodeId, List<? extends PacketExtension> items) argument 109 ItemsExtension(String nodeId, List<? extends PacketExtension> items, boolean notify) argument [all...] |
/external/stlport/test/eh/ |
H A D | test_algo.cpp | 41 SortClass* begin() { return items; } 42 const SortClass* begin() const { return items; } 43 SortClass* end() { return items + kBufferSize; } 44 const SortClass* end() const { return items + kBufferSize; } 69 SortClass items[kBufferSize]; member in struct:SortBuffer 115 // Check that adjacent items with the same value haven't been
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
H A D | BitSet.cs | 76 public BitSet(IEnumerable<int> items) argument 78 foreach (int i in items)
|