HomeSort by relevance Sort by last modified time
    Searched refs:ENTRIES (Results 1 - 14 of 14) sorted by null

  /prebuilts/tools/linux-x86_64/kythe/studio/
serve_studio_kythe.sh 15 OUT_ENTRIES="${OUT}/entries"
27 # entries created using "build_studio_kythe.sh"
33 ENTRIES=$(find "${OUT_ENTRIES}" -name *.entries \
36 for ENTRY in ${ENTRIES}; do
build_studio_kythe.sh 25 OUT_ENTRIES="${OUT}/entries"
41 # entries.
43 # on the entries and produce indexes for builds with 95% coverage and up.
46 ENTRIES="$(basename "${KINDEX}").entries"
47 if [ ! -f "${ENTRIES}" ]; then
50 "${KINDEX}" > "${ENTRIES}" || true
  /external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/gs/
acl.py 32 ENTRIES = 'Entries'
59 self.entries = Entries(self)
71 acl_entries = self.entries
82 self.entries.entry_list.append(entry)
88 self.entries.entry_list.append(entry)
93 self.entries.entry_list.append(entry)
97 self.entries.entry_list.append(entry)
103 elif name.lower() == ENTRIES.lower()
    [all...]
  /frameworks/base/tools/aapt/
StringPool.cpp 72 printf("String pool of " ZD " unique %s %s strings, " ZD " entries and "
239 // Place blank entries in the span array up to this index.
267 // This is a vector that starts out with a 1:1 mapping to entries
296 SortedVector<entry> entries;
301 entries.add(mEntries[mEntryArray[i]]);
304 for (size_t i=0; i<entries.size(); i++) {
306 entries[i].makeConfigsString().string());
350 // Now trim any entries at the end of the new style array that are
436 const size_t ENTRIES = mEntryArray.size();
442 + (sizeof(uint32_t)*ENTRIES)
    [all...]
  /external/libxml2/os400/
make-src.sh 194 eval ENTRIES=\"\${${PGMEXP}}\"
196 for ENTRY in ${ENTRIES} ${OS400SYMS}
  /build/core/
cleanspec.mk 19 # 1. DELETE ANY "add-clean-step" ENTRIES THAT HAVE PILED UP IN THIS FILE.
  /libcore/ojluni/src/main/java/java/util/
Hashtable.java 47 * collision", a single bucket stores multiple entries, which must be searched
62 * capacity is greater than the maximum number of entries the
66 * If many entries are to be made into a <code>Hashtable</code>,
68 * entries to be inserted more efficiently than letting it perform
140 * The total number of entries in the hash table.
161 * Structural modifications are those that change the number of entries in
386 * hashtable, in order to accommodate and access its entries more
557 * in the form of a set of entries, enclosed in braces and separated
679 return getIterator(ENTRIES);
    [all...]
  /prebuilts/tools/common/fest/
fest-assert-1.2.jar 
  /external/antlr/antlr-3.4/runtime/ActionScript/project/lib/
FlexAntTasks.jar 
  /external/guice/extensions/struts2/lib/
freemarker-2.3.16.jar 
  /prebuilts/tools/common/m2/repository/org/freemarker/freemarker/2.3.20/
freemarker-2.3.20.jar 
  /development/tools/checkstyle/
checkstyle.jar 
  /prebuilts/sdk/tools/
jack-launcher.jar 
jack-server-4.8.ALPHA.jar 

Completed in 366 milliseconds