Searched defs:items (Results 51 - 75 of 281) sorted by relevance

1234567891011>>

/external/webrtc/webrtc/libjingle/xmpp/
H A Dpubsub_task.cc116 // <items node="node-name">
120 // </items>
129 // <items node="node-name">
131 // </items>
154 // <items node="node-name">
158 // </items>
177 // 'items' is the child of a pubsub#event:event node or pubsub:pubsub node.
178 void PubsubTask::HandlePubsubItems(const buzz::XmlElement* items) { argument
179 ASSERT(items->HasAttr(QN_NODE));
180 const std::string& node_name(items
[all...]
H A Dpubsubtasks_unittest.cc34 const std::vector<buzz::PubSubItem>& items) {
35 OnItems(items);
39 const std::vector<buzz::PubSubItem>& items) {
40 OnItems(items);
43 void OnItems(const std::vector<buzz::PubSubItem>& items) { argument
44 for (std::vector<buzz::PubSubItem>::const_iterator item = items.begin();
45 item != items.end(); ++item) {
51 this->items.push_back(handled_item);
67 std::vector<HandledPubSubItem> items; member in class:TestPubSubTasksListener
103 "<pub:items nod
33 OnReceiveUpdate(buzz::PubSubReceiveTask* task, const std::vector<buzz::PubSubItem>& items) argument
38 OnRequestResult(buzz::PubSubRequestTask* task, const std::vector<buzz::PubSubItem>& items) argument
[all...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/
H A DBitSet.cs76 public BitSet(IEnumerable<int> items) argument
78 foreach (int i in items)
/external/bison/src/
H A Dstate.h27 Each state of the machine is described by a set of items --
30 state. These symbols at these items are the allowable inputs that
44 Each core contains a vector of NITEMS items which are the indices
45 in the RITEM vector of the items that are selected in this state.
220 /* Its items. Must be last, since ITEMS can be arbitrarily large. Sorted
223 item_number items[1]; member in struct:state
229 /* Create a new state with ACCESSING_SYMBOL for those items. */
/external/brotli/enc/
H A Dmemory.c79 static void SortPointers(void** items, const size_t n) { argument
88 void* tmp = items[i];
89 for (; j >= gap && tmp < items[j - gap]; j -= gap) {
90 items[j] = items[j - gap];
92 items[j] = tmp;
/external/caliper/caliper/src/main/java/com/google/caliper/util/
H A DUtil.java138 public static <T> ImmutableBiMap<T, String> assignNames(Set<T> items) { argument
139 ImmutableList<T> itemList = ImmutableList.copyOf(items);
/external/clang/utils/analyzer/
H A DCmpRuns.py105 def items(self): member in class:multidict
106 return self.data.items()
/external/dagger2/compiler/src/main/java/dagger/internal/codegen/
H A DValidationReport.java34 * A collection of items describing contractual issues with the code as presented to an annotation
35 * processor. A "clean" report (i.e. with no issues) is a report with no {@linkplain Item items}
39 * <p>A report describes a subject {@link Element}. Callers may choose to add report items about
53 abstract ImmutableSet<Item> items(); method in class:ValidationReport
57 for (Item item : items()) {
74 for (Item item : items()) {
137 private final ImmutableSet.Builder<Item> items = ImmutableSet.builder(); field in class:ValidationReport.Builder
149 items.addAll(newItems);
210 items.add(new AutoValue_ValidationReport_Item(message, kind, element, annotation));
220 return new AutoValue_ValidationReport<T>(subject, items
[all...]
/external/elfutils/backends/
H A Di386_corenote.c110 nitems, items); \
124 size_t *nitems, const Ebl_Core_Item **items)
133 *items = tls_items;
122 tls_info(GElf_Word descsz, GElf_Word *regs_offset, size_t *nregloc, const Ebl_Register_Location **reglocs, size_t *nitems, const Ebl_Core_Item **items) argument
H A Dlinux-core-note.c210 size_t *nitems, const Ebl_Core_Item **items)
237 *items = vmcoreinfo_items;
253 *items = prstatus_items;
263 *items = prpsinfo_items;
274 *items = NULL; \
285 *items = extra_items; \
296 *items = extra_items; \
207 core_note(const GElf_Nhdr *nhdr, const char *name, GElf_Word *regs_offset, size_t *nregloc, const Ebl_Register_Location **reglocs, size_t *nitems, const Ebl_Core_Item **items) argument
/external/harfbuzz_ng/src/
H A Dhb-object-private.hh86 hb_lockable_set_t<hb_user_data_item_t, hb_mutex_t> items; member in struct:hb_user_data_array_t
88 inline void init (void) { lock.init (); items.init (); }
97 inline void finish (void) { items.finish (lock); lock.finish (); }
/external/icu/icu4c/source/tools/toolutil/
H A Dpackage.h73 * but the items are left unswapped.
77 * Write a .dat package file with the items in this object.
81 * Also, the items themselves are swapped in-place
90 // find the item in items[], return the non-negative index if found, else the binary-not of the insertion point
95 * indexes for items whose names match the pattern.
138 * @param check will be called with context and any missing items
172 Item *items; member in class:Package
/external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/table/
H A DTable.java75 * @param items
76 * items that will make the table rows
78 * the summary of all coverage data items in the table static
88 final List<? extends ITableItem> items, final ICoverageNode total,
91 final List<? extends ITableItem> sortedItems = sort(items);
100 final List<? extends ITableItem> items, final ICoverageNode total)
104 c.init(tr, items, total);
118 final List<? extends ITableItem> items, final Resources resources,
122 for (final ITableItem item : items) {
132 final List<? extends ITableItem> items) {
87 render(final HTMLElement parent, final List<? extends ITableItem> items, final ICoverageNode total, final Resources resources, final ReportOutputFolder base) argument
99 header(final HTMLElement table, final List<? extends ITableItem> items, final ICoverageNode total) argument
117 body(final HTMLElement table, final List<? extends ITableItem> items, final Resources resources, final ReportOutputFolder base) argument
131 sort( final List<? extends ITableItem> items) argument
162 init(final HTMLElement tr, final List<? extends ITableItem> items, final ICoverageNode total) argument
[all...]
/external/jacoco/org.jacoco.report.test/src/org/jacoco/report/internal/html/table/
H A DTableTest.java81 public boolean init(List<? extends ITableItem> items,
105 final List<ITableItem> items = Arrays.asList(createItem("A", 1),
108 table.render(body, items, createTotal("Sum", 6), resources, root);
119 public boolean init(List<? extends ITableItem> items,
136 final List<ITableItem> items = Arrays.asList(createItem("A", 1));
138 table.render(body, items, createTotal("Sum", 1), resources, root);
153 final List<ITableItem> items = Arrays.asList(createItem("C", 3),
162 table.render(body, items, createTotal("Sum", 6), resources, root);
199 final List<ITableItem> items = Arrays.asList(createItem("C", 3),
204 table.render(body, items, createTota
265 init(List<? extends ITableItem> items, ICoverageNode total) argument
[all...]
/external/jarjar/src/main/com/tonicsystems/jarjar/util/
H A DClassHeaderReader.java32 private int[] items = new int[1000]; field in class:ClassHeaderReader
74 items = (int[])resizeArray(items, constant_pool_count);
81 items[i] = index + 1;
130 index = readUnsignedShort(items[index]);
131 bin.readFrom(b, items[index]);
/external/libexif/libexif/olympus/
H A Dmnote-olympus-entry.c89 } items[] = { variable in typeref:struct:__anon10664
436 for (i = 0; (items[i].tag && items[i].tag != entry->tag); i++)
438 if (!items[i].tag) {
442 CF (entry->format, items[i].fmt, v, maxlen);
444 for (j = 0; items[i].elem[j].string &&
445 (items[i].elem[j].index < vs); j++);
446 if (items[i].elem[j].index != vs) {
450 strncpy (v, _(items[i].elem[j].string), maxlen);
506 for (i = 0; (items[
[all...]
/external/mesa3d/src/gallium/drivers/svga/include/
H A Dsvga_overlay.h71 /* May include zero or more items. */
75 } items[1]; member in struct:SVGAEscapeVideoSetRegs
106 } items[1]; member in struct:__anon15467
115 } items[SVGA_VIDEO_NUM_REGS]; member in struct:__anon15469
/external/python/cpython2/Lib/
H A DUserDict.py57 def items(self): return self.data.items() member in class:UserDict
84 elif isinstance(dict, type({})) or not hasattr(dict, 'items'):
87 for k, v in dict.items():
154 def items(self): member in class:DictMixin
/external/python/cpython2/Lib/test/
H A Dtest_userdict.py94 # Test keys, items, values
96 self.assertEqual(u2.items(), d2.items())
114 def items(self): member in class:UserDictTest.test_all.Items
156 self.assertEqual(list(UserDict.UserDict(**{kw: 42}).items()),
158 self.assertEqual(list(UserDict.UserDict({}, dict=42).items()),
160 self.assertEqual(list(UserDict.UserDict({}, dict=None).items()),
164 self.assertEqual(list(UserDict.UserDict(dict={'a': 42}).items()),
174 self.assertEqual(list(d.items()), [(kw, 42)])
179 self.assertEqual(list(d.items()), [('
[all...]
/external/python/cpython2/Modules/zlib/
H A Dzutil.c220 voidpf ZLIB_INTERNAL zcalloc (voidpf opaque, unsigned items, unsigned size) argument
223 ulg bsize = (ulg)items*size;
279 voidpf ZLIB_INTERNAL zcalloc (voidpf opaque, uInt items, uInt size) argument
282 return _halloc((long)items, size);
300 extern voidp calloc OF((uInt items, uInt size));
304 voidpf ZLIB_INTERNAL zcalloc (opaque, items, size)
306 unsigned items;
309 if (opaque) items += size - size; /* make compiler happy */
310 return sizeof(uInt) > 2 ? (voidpf)malloc(items * size) :
311 (voidpf)calloc(items, siz
[all...]
/external/regex-re2/util/
H A Dbenchmark.cc37 static int64 items; variable
55 items = n;
68 items = 0;
/external/selinux/libselinux/src/
H A Dlabel_db.c96 int items; local
108 items = sscanf(line_buf, "%ms %ms %ms %ms",
110 if (items != 3) {
111 if (items > 0)
H A Dlabel_media.c37 int items; local
47 items = sscanf(line_buf, "%ms %ms ", &key, &context);
48 if (items < 2) {
52 if (items == 1)
H A Dlabel_x.c39 int items; local
49 items = sscanf(line_buf, "%ms %ms %ms ", &type, &key, &context);
50 if (items < 3) {
54 if (items > 0)
56 if (items > 1)
/external/skia/src/pdf/
H A DSkDeflate.cpp21 template <typename T> void* skia_alloc_func(void*, T items, T size) { argument
22 return sk_calloc_throw(SkToSizeT(items) * SkToSizeT(size));

Completed in 838 milliseconds

1234567891011>>