Searched defs:entries (Results 1 - 25 of 48) sorted by relevance

12

/lucene-3.6.0/lucene/contrib/facet/src/java/org/apache/lucene/facet/taxonomy/writercache/cl2o/
H A DCollisionMap.java55 private Entry[] entries; field in class:CollisionMap
70 this.entries = new Entry[this.capacity];
85 Entry[] src = this.entries;
103 this.entries = newEntries;
109 Entry e = this.entries[bucketIndex];
123 Entry e = this.entries[bucketIndex];
137 for (Entry e = this.entries[bucketIndex]; e != null; e = e.next) {
157 for (Entry e = this.entries[bucketIndex]; e != null; e = e.next) {
186 Entry e = this.entries[bucketIndex];
187 this.entries[bucketInde
228 EntryIterator(Entry[] entries, int size) argument
[all...]
/lucene-3.6.0/lucene/contrib/spellchecker/src/java/org/apache/lucene/search/suggest/
H A DBufferingTermFreqIteratorWrapper.java32 protected BytesRefList entries = new BytesRefList(); field in class:BufferingTermFreqIteratorWrapper
42 entries.append(spare);
57 if (++curPos < entries.size()) {
58 entries.get(spare, curPos);
/lucene-3.6.0/lucene/contrib/spellchecker/src/java/org/apache/lucene/search/suggest/fst/
H A DFSTLookup.java176 List<Entry> entries = new ArrayList<Entry>();
183 entries.add(new Entry(termChars, tfit.weight()));
193 if (entries.size() > 0) {
194 redistributeWeightsProportionalMinMax(entries, buckets);
195 encodeWeightPrefix(entries);
200 this.automaton = buildAutomaton(entries);
448 * Builds the final automaton from a list of entries.
450 private FST<Object> buildAutomaton(List<Entry> entries) throws IOException { argument
451 if (entries.size() == 0)
470 Collections.sort(entries, com
508 encodeWeightPrefix(List<Entry> entries) argument
523 redistributeWeightsProportionalMinMax(List<Entry> entries, int buckets) argument
[all...]
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/index/
H A DCompoundFileReader.java50 private HashMap<String,FileEntry> entries = new HashMap<String,FileEntry>(); field in class:CompoundFileReader
105 entries.put(id, entry);
138 entries.clear();
155 FileEntry entry = entries.get(id);
157 throw new FileNotFoundException("No sub-file with id " + id + " found (fileName=" + fileName + " files: " + entries.keySet() + ")");
166 String[] res = entries.keySet().toArray(new String[entries.size()]);
178 return entries.containsKey(IndexFileNames.stripSegmentName(name));
213 FileEntry e = entries.get(IndexFileNames.stripSegmentName(name));
H A DCompoundFileWriter.java36 * fileCount entries with the following structure:</li>
42 * fileCount entries with the raw data of the corresponding file</li>
46 * file. The {directory} that follows has that many entries. Each directory entry
82 private LinkedList<FileEntry> entries; field in class:CompoundFileWriter
103 entries = new LinkedList<FileEntry>();
148 entries.add(entry);
161 if (entries.isEmpty())
162 throw new IllegalStateException("No entries to merge have been defined");
174 // Write the number of entries
175 os.writeVInt(entries
[all...]
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/util/
H A DFieldCacheSanityChecker.java31 * Provides methods for sanity checking that entries in the FieldCache
122 // It's OK to have dup entries, where one is eg
230 // we have cache entries for the kid
251 // now the entries for the descendants
329 private final CacheEntry[] entries; field in class:FieldCacheSanityChecker.Insanity
330 public Insanity(InsanityType type, String msg, CacheEntry... entries) { argument
335 if (null == entries || 0 == entries.length) {
341 this.entries = entries;
[all...]
/osnet-11/usr/src/lib/libresolv2/common/irs/
H A Dirpmarshall.c101 static void free_array(char **argv, size_t entries);
1905 * static void free_array(char **argv, size_t entries)
1911 * entries is > 0, then NULL pointers inside the array do
1917 free_array(char **argv, size_t entries) { argument
1919 int useEntries = (entries > 0U);
1924 while ((useEntries && entries > 0U) || *p) {
1929 entries--;
2039 size_t entries; local
2046 if (irp_unmarshall_ng(&ngname, &entries,
2056 for (i = 0 ; i < entries ;
[all...]
/osnet-11/usr/src/lib/libldap4/common/
H A Dfriendly.c49 int i, entries; local
65 entries = 0;
68 entries++;
72 if ( (*map = (FriendlyMap *) malloc( (entries + 1) *
79 while ( fgets( buf, sizeof(buf), fp ) != NULL && i < entries ) {
/osnet-11/usr/src/lib/libldap5/sources/ldap/common/
H A Dfriendly.c48 int i, entries; local
65 entries = 0;
68 entries++;
72 if ( (*map = (FriendlyMap)NSLDAPI_MALLOC( (entries + 1) *
79 while ( fgets( buf, sizeof(buf), fp ) != NULL && i < entries ) {
/osnet-11/usr/src/lib/libnisdb/
H A Ddb.cc507 * Returns TRUE always for valid log entries; FALSE otherwise.
734 db_log_entry * head; // head of list of log entries found
735 db_log_entry * tail; // tail of list of log entries found
741 * 2. add the entry to the list of log entries found.
764 /* Return structure db_log_list containing entries that are later
787 db_log_entry_p *entries; local
791 entries = answer->list.list_val = new db_log_entry_p[count];
792 if (entries == NULL) {
795 "db::get_log_entries_since: cannot allocate space for entries",
802 entries[
[all...]
H A Ddb_mindex.cc84 * entries.
322 entry_object_p * entries = new entry_object_p[count]; local
325 if (entries == NULL) {
337 free_entry(entries[j]);
342 entries[i] =
347 READUNLOCK2(this, table, entries, entries,
351 return (entries);
615 * Note that the answers are pointers to the COPIES of entries.
641 * Return all entries withi
[all...]
/osnet-11/usr/src/lib/libnisdb/yptol/
H A Dshim.h47 DBM *entries; /* NIS entry DBM file */ member in struct:__anon2015
/osnet-11/usr/src/lib/libnwam/common/
H A Dlibnwam_impl.h108 struct nwam_prop_table_entry *entries; member in struct:nwam_prop_table
/osnet-11/usr/src/lib/libdhcputil/common/
H A Ddhcp_inittab.c102 * inittab_load(): returns all inittab entries with the specified criteria
106 * size_t *: set to the number of entries returned
107 * output: dhcp_symbol_t *: an array of dynamically allocated entries
150 * inittab_lookup(): returns inittab entries with the specified criteria
158 * size_t *: set to the number of entries returned
168 dhcp_symbol_t *new_entries, *entries = NULL; local
229 * validate the values in the entries; skip if invalid.
252 * and if so, throw it onto the set of entries we'll return.
271 new_entries = realloc(entries, (n_entries + 1) *
294 entries
[all...]
/osnet-11/usr/src/lib/libdscfg/common/
H A Dcfg_vols.c586 int set, rc, entries; local
605 entries = cfg_get_section(cfg, &entry, "dsvol");
606 for (set = 1; set <= entries; set++) {
654 while (set < entries)
656 if (entries)
665 return (rc < 0? rc : entries);
701 int set, entries, offset = 0; local
716 entries = cfg_get_section(cfg, &entry, "sv");
717 for (set = 1; set <= entries; set++) {
750 while (set < entries)
845 int set, self_loaded, rc, entries; local
[all...]
/osnet-11/usr/src/lib/libfedfs/common/
H A Dlist_fsns.c57 char **entries; local
78 entries = calloc(sizeof (char *), n + 1);
90 free(entries);
121 if (n > 0 && strcmp(entries[n - 1],
124 entries[n] =
127 entries = realloc(entries,
129 entries[n] = NULL;
146 entries[i]);
150 *locations = entries;
158 free_fsns(int n, char **entries) argument
[all...]
H A Dnsdb_lookup.c122 * Store NSDB entries in the cache
195 * Look up LDAP entries in the cache
274 nsdb_entry_t **entries; local
353 entries = calloc(sizeof (nsdb_entry_t *), n + 1);
354 entries[n] = calloc(sizeof (nsdb_entry_t), 1);
378 /* Skip FSN UUID entries */
412 entries[n]->host =
426 entries[n]->path =
436 entries[n]->share =
445 if (entries[
532 nsdb_free(int n, nsdb_entry_t **entries) argument
[all...]
/osnet-11/usr/src/lib/fm/libdiskstatus/common/
H A Dds_scsi.c721 * 20 entries, where each entry's parameter code is its index in the log. We
724 * entries in this log, so we must also be sure to validate the contents as part
733 int entries = 0; local
736 for (i = 0; i < log_length; i += plen, entries++) {
1110 int entries = 0; local
1120 for (i = 0; i < log_length; i += plen, entries++) {
/osnet-11/usr/src/lib/krb5/kdb/
H A Dkdb_convert.c300 * log (ulog) entry format. Space for the update log entries should
304 ulog_conv_2logentry(krb5_context context, krb5_db_entry *entries, argument
321 if ((updates == NULL) || (entries == NULL))
325 ent = entries;
619 * This routine converts one or more update log (ulog) entries into
625 ulog_conv_2dbentry(krb5_context context, krb5_db_entry *entries, argument
634 if ((updates == NULL) || (entries == NULL))
637 ent = entries;
886 * This routine frees up memory associated with the bunched ulog entries.
1030 * Finally, free up the pointer to the bunched ulog entries
[all...]
/osnet-11/usr/src/lib/krb5/plugins/kdb/db2/
H A Dkdb_db2.c941 * returns number of entries found, and whether there were
948 krb5_db_entry *entries, /* filled in */
1002 retval = krb5_decode_princ_contents(context, &contdata, entries);
1017 krb5_db2_db_free_principal(krb5_context context, krb5_db_entry *entries, argument
1022 krb5_dbe_free_contents(context, &entries[i]);
1027 Stores the *"nentries" entry structures pointed to by "entries" in the
1038 krb5_db_entry *entries,
1077 retval = krb5_encode_princ_contents(context, &contdata, entries);
1082 retval = krb5_encode_princ_dbkey(context, &keydata, entries->princ);
1096 entries
946 krb5_db2_db_get_principal(krb5_context context, krb5_const_principal searchfor, krb5_db_entry *entries, int *nentries, krb5_boolean *more) argument
1037 krb5_db2_db_put_principal(krb5_context context, krb5_db_entry *entries, int *nentries, char **db_args) argument
1204 krb5_db_entry entries; local
[all...]
/osnet-11/usr/src/lib/krb5/plugins/kdb/ldap/libkdb_ldap/
H A Dldap_principal.c131 krb5_ldap_free_principal(krb5_context kcontext, krb5_db_entry *entries, argument
136 krb5_dbe_free_contents(kcontext, &entries[i]);
261 krb5_db_entry entries; local
269 if ((st=krb5_ldap_get_principal(context, searchfor, 0, &entries, nentries, &more)) != 0 || *nentries == 0)
272 if (((st=krb5_get_princ_type(context, &entries, &(ptype))) != 0) ||
273 ((st=krb5_get_attributes_mask(context, &entries, &(attrsetmask))) != 0) ||
274 ((st=krb5_get_princ_count(context, &entries, &(pcount))) != 0) ||
275 ((st=krb5_get_userdn(context, &entries, &(DN))) != 0))
317 * NOTE: krbsecretkey attribute has per principal entries. There can be chances that the
376 krb5_ldap_free_principal(context, &entries, *nentrie
[all...]
H A Dldap_principal2.c104 unsigned int flags, krb5_db_entry *entries,
124 memset(entries, 0, sizeof(*entries));
209 entries)) != 0)
224 krb5_dbe_free_contents(context, entries);
507 krb5_ldap_put_principal(krb5_context context, krb5_db_entry *entries, argument
542 for (i=0; i < *nentries; ++i, ++entries) {
543 if (is_principal_in_realm(ldap_context, entries->princ) != 0) {
550 if (entries->princ) {
551 if (((st=krb5_unparse_name(context, entries
103 krb5_ldap_get_principal(krb5_context context, krb5_const_principal searchfor, unsigned int flags, krb5_db_entry *entries, int *nentries, krb5_boolean *more) argument
1287 krb5_read_tkt_policy(krb5_context context, krb5_ldap_context *ldap_context, krb5_db_entry *entries, char *policy) argument
1338 krb5_decode_krbsecretkey(krb5_context context, krb5_db_entry *entries, struct berval **bvalues, krb5_tl_data *userinfo_tl_data, krb5_kvno *mkvno) argument
[all...]
/osnet-11/usr/src/lib/libadutils/common/
H A Dadutils_impl.h93 adutils_entry_t *entries; member in struct:adutils_result
/osnet-11/usr/src/grub/grub2/grub-core/commands/i386/pc/
H A Ddrivemap.c279 int entries = 0; local
282 /* Count entries to prepare a contiguous map block. */
285 entries++;
288 if (entries == 0)
307 + (entries + 1) * sizeof (int13map_node_t);
328 for (i = 0; i < entries; ++i, curentry = curentry->next)
/osnet-11/usr/src/grub/grub2/grub-core/fs/
H A Dbfs.c258 struct grub_bfs_extent *entries; local
265 entries = grub_malloc (nentries << LOG_EXTENT_SIZE);
266 if (!entries)
269 entries, nentries << LOG_EXTENT_SIZE);
273 newpos = pos + (grub_bfs_to_cpu16 (entries[i].len)
282 err = read_extent (disk, sb, &entries[i], 0, off - pos,
287 grub_free (entries);
295 grub_free (entries);
301 grub_free (entries);

Completed in 775 milliseconds

12