/macosx-10.9.5/CPANInternal-140/DBIx-Class/t/lib/DBICTest/Schema/ |
H A D | ArtistSubclass.pm | 6 __PACKAGE__->table(__PACKAGE__->table);
|
H A D | ArtistSourceName.pm | 5 __PACKAGE__->table(__PACKAGE__->table);
|
/macosx-10.9.5/postfix-252/postfix/src/util/ |
H A D | nvtable.h | 24 #define nvtable_locate(table, key) htable_locate((table), (key)) 25 #define nvtable_walk(table, action, ptr) htable_walk((table), (action), (ptr)) 26 #define nvtable_list(table) htable_list(table) 27 #define nvtable_find(table, key) htable_find((table), (key)) 28 #define nvtable_delete(table, key) htable_delete((table), (ke [all...] |
/macosx-10.9.5/CPANInternal-140/Class-DBI/t/testlib/ |
H A D | MyBase.pm | 11 my @table; 13 END { $dbh->do("DROP TABLE $_") foreach @table } 19 $class->table($class->create_test_table); 24 my $table = $self->next_available_table; 25 my $create = sprintf "CREATE TABLE $table ( %s )", $self->create_sql; 26 push @table, $table; 28 return $table; 40 my $table = $tables[-1] || "aaa"; 41 return "z$table"; [all...] |
/macosx-10.9.5/CPANInternal-140/Class-DBI-v3.0.17/t/testlib/ |
H A D | MyBase.pm | 11 my @table; 13 END { $dbh->do("DROP TABLE $_") foreach @table } 19 $class->table($class->create_test_table); 24 my $table = $self->next_available_table; 25 my $create = sprintf "CREATE TABLE $table ( %s )", $self->create_sql; 26 push @table, $table; 28 return $table; 40 my $table = $tables[-1] || "aaa"; 41 return "z$table"; [all...] |
/macosx-10.9.5/tcl-102/tcl_ext/tktable/tktable/demos/ |
H A D | maxsize.tcl | 7 ## This demo uses a really big table. The big startup time is in 8 ## filling the table's Tcl array var. 14 array set table { 17 table .t 35 fill $table(array) $table(rows) $table(cols) 36 table $table(table) \ [all...] |
H A D | basic.tcl | 7 ## This demo shows the basic use of the table widget 13 array set table { 16 table .t 33 fill $table(array) $table(rows) $table(cols) 34 table $table(table) -rows $table(row [all...] |
H A D | debug.tcl | 7 ## This demo uses most features of the table widget 13 array set table { 16 table .t 32 fill $table(array) $table(rows) $table(cols) 33 table $table(table) \ 34 -rows $table(row [all...] |
H A D | command.tcl | 7 ## This demo shows the use of the table widget's -command options 13 array set table { 16 table .table 51 bind .active <Return> "$table(table) curvalue \[%W get\]" 53 fill $table(array) $table(rows) $table(cols) 54 set t $table(tabl [all...] |
/macosx-10.9.5/tcl-102/tcl_ext/tclxml/tclxml/expat/xmlparse/ |
H A D | hashtable.c | 61 NAMED *lookup(HASH_TABLE *table, KEY name, size_t createSize) argument 64 if (table->size == 0) { 67 table->v = calloc(INIT_SIZE, sizeof(NAMED *)); 68 if (!table->v) 70 table->size = INIT_SIZE; 71 table->usedLim = INIT_SIZE / 2; 72 i = hash(name) & (table->size - 1); 76 for (i = h & (table->size - 1); 77 table->v[i]; 78 i == 0 ? i = table 117 hashTableDestroy(HASH_TABLE *table) argument 136 hashTableIterInit(HASH_TABLE_ITER *iter, const HASH_TABLE *table) argument [all...] |
/macosx-10.9.5/tcl-102/tcl_ext/xotcl/xotcl/library/xml/TclExpat-1.1/ |
H A D | hashtable.c | 44 NAMED *lookup(HASH_TABLE *table, KEY name, size_t createSize) argument 47 if (table->size == 0) { 50 table->v = calloc(INIT_SIZE, sizeof(NAMED *)); 51 if (!table->v) 53 table->size = INIT_SIZE; 54 table->usedLim = INIT_SIZE / 2; 55 i = hash(name) & (table->size - 1); 59 for (i = h & (table->size - 1); 60 table->v[i]; 61 i == 0 ? i = table 100 hashTableDestroy(HASH_TABLE *table) argument 119 hashTableIterInit(HASH_TABLE_ITER *iter, const HASH_TABLE *table) argument [all...] |
/macosx-10.9.5/postfix-252/postfix/src/global/ |
H A D | mail_conf_raw.c | 21 /* void get_mail_conf_raw_table(table) 22 /* const CONFIG_RAW_TABLE *table; 24 /* void get_mail_conf_raw_fn_table(table) 25 /* const CONFIG_RAW_TABLE *table; 42 /* lists of variables, as directed by their table arguments. A table 121 /* get_mail_conf_raw_table - look up table of strings */ 123 void get_mail_conf_raw_table(const CONFIG_RAW_TABLE *table) argument 125 while (table->name) { 126 if (table 136 get_mail_conf_raw_fn_table(const CONFIG_RAW_FN_TABLE *table) argument [all...] |
H A D | mail_conf_str.c | 25 /* void get_mail_conf_str_table(table) 26 /* const CONFIG_STR_TABLE *table; 28 /* void get_mail_conf_str_fn_table(table) 29 /* const CONFIG_STR_TABLE *table; 57 /* lists of variables, as directed by their table arguments. A table 166 /* get_mail_conf_str_table - look up table of strings */ 168 void get_mail_conf_str_table(const CONFIG_STR_TABLE *table) argument 170 while (table->name) { 171 if (table 181 get_mail_conf_str_fn_table(const CONFIG_STR_FN_TABLE *table) argument [all...] |
/macosx-10.9.5/emacs-92/emacs/oldXMenu/ |
H A D | XDestAssoc.c | 13 XDestroyAssocTable(table) 14 register XAssocTable *table; 21 for (i = 0; i < table->size; i++) { 22 bucket = &table->buckets[i]; 34 free((char *)table->buckets); 36 /* Free the table. */ 37 free((char *)table);
|
/macosx-10.9.5/CPANInternal-140/DBIx-Class/t/cdbi/testlib/ |
H A D | MyBase.pm | 13 my @table; 15 END { $dbh->do("DROP TABLE $_") foreach @table } 21 $class->table($class->create_test_table); 26 my $table = $self->next_available_table; 27 my $create = sprintf "CREATE TABLE $table ( %s )", $self->create_sql; 28 push @table, $table; 30 return $table; 42 my $table = $tables[-1] || "aaa"; 43 return "z$table"; [all...] |
/macosx-10.9.5/ICU-511.35/icuSources/layout/ |
H A D | NonContextualGlyphSubst.h | 23 LookupTable table; member in struct:NonContextualGlyphSubstitutionHeader 28 LookupTable table; member in struct:NonContextualGlyphSubstitutionHeader2
|
/macosx-10.9.5/ruby-104/ruby/test/csv/ |
H A D | test_table.rb | 20 @table = CSV::Table.new(@rows) 28 assert_not_nil(@table) 29 assert_instance_of(CSV::Table, @table) 33 assert_equal(:col_or_row, @table.mode) 36 cols = @table.by_col 37 assert_equal(:col_or_row, @table.mode) 39 assert_equal(@table, cols) 41 rows = @table.by_row 42 assert_equal(:col_or_row, @table.mode) 44 assert_equal(@table, row [all...] |
/macosx-10.9.5/cxxfilt-11/cxxfilt/bfd/ |
H A D | hash.c | 1 /* hash.c -- hash table routines for BFD 33 BFD provides a simple set of hash table functions. Routines 34 are provided to initialize a hash table, to free a hash table, 35 to look up a string in a hash table and optionally create an 36 entry for it, and to traverse a hash table. There is 37 currently no routine to delete an string from a hash table. 39 The basic hash table does not permit any data to be stored 40 with a string. However, a hash table is designed to present a 44 rather than simply providing a data pointer in a hash table 359 bfd_hash_table_init_n(struct bfd_hash_table *table, struct bfd_hash_entry *(*newfunc) (struct bfd_hash_entry *, struct bfd_hash_table *, const char *), unsigned int entsize, unsigned int size) argument 394 bfd_hash_table_init(struct bfd_hash_table *table, struct bfd_hash_entry *(*newfunc) (struct bfd_hash_entry *, struct bfd_hash_table *, const char *), unsigned int entsize) argument 407 bfd_hash_table_free(struct bfd_hash_table *table) argument 416 bfd_hash_lookup(struct bfd_hash_table *table, const char *string, bfd_boolean create, bfd_boolean copy) argument 519 bfd_hash_replace(struct bfd_hash_table *table, struct bfd_hash_entry *old, struct bfd_hash_entry *nw) argument 544 bfd_hash_allocate(struct bfd_hash_table *table, unsigned int size) argument 558 bfd_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string ATTRIBUTE_UNUSED) argument 570 bfd_hash_traverse(struct bfd_hash_table *table, bfd_boolean (*func) (struct bfd_hash_entry *, void *), void * info) argument 634 struct bfd_hash_table table; member in struct:bfd_strtab_hash 649 strtab_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument 687 struct bfd_strtab_hash *table; local 727 _bfd_stringtab_free(struct bfd_strtab_hash *table) argument [all...] |
/macosx-10.9.5/CPANInternal-140/DBIx-Class/t/lib/DBICNSTest/RtBug41083/Schema/ |
H A D | Foo.pm | 5 __PACKAGE__->table('foo');
|
/macosx-10.9.5/CPANInternal-140/DBIx-Class/t/lib/DBICNSTest/RtBug41083/Schema_A/ |
H A D | A.pm | 5 __PACKAGE__->table('a');
|
/macosx-10.9.5/CPANInternal-140/DBIx-Class/t/lib/DBICTest/Taint/Classes/ |
H A D | Auto.pm | 5 __PACKAGE__->table('test');
|
H A D | Manual.pm | 5 __PACKAGE__->table('test');
|
/macosx-10.9.5/CPANInternal-140/DBIx-Class/t/lib/DBICTest/Taint/Namespaces/Result/ |
H A D | Test.pm | 5 __PACKAGE__->table('test');
|
/macosx-10.9.5/gnutar-452/gnutar/lib/ |
H A D | hash.c | 1 /* hash - hashing table processing. 22 /* A generic hash table package. */ 54 are not empty, there are N_ENTRIES active entries in the table. */ 84 /* A hash table contains many internal entries, each holding a pointer to 89 and the current table size. At each slot position in the hash table, 95 entries divided by the table size. Finding the slot for a data is usually 98 larger hash table size (that is, a larger number of buckets) is prone to 101 Long buckets slow down the lookup algorithm. One might use big hash table 103 become inordinate, as unused slots in the hash table tak 148 hash_get_n_buckets(const Hash_table *table) argument 156 hash_get_n_buckets_used(const Hash_table *table) argument 164 hash_get_n_entries(const Hash_table *table) argument 172 hash_get_max_bucket_length(const Hash_table *table) argument 199 hash_table_ok(const Hash_table *table) argument 228 hash_print_statistics(const Hash_table *table, FILE *stream) argument 248 hash_lookup(const Hash_table *table, const void *entry) argument 277 hash_get_first(const Hash_table *table) argument 296 hash_get_next(const Hash_table *table, const void *entry) argument 324 hash_get_entries(const Hash_table *table, void **buffer, size_t buffer_size) argument 356 hash_do_for_each(const Hash_table *table, Hash_processor processor, void *processor_data) argument 482 check_tuning(Hash_table *table) argument 542 Hash_table *table; local 603 hash_clear(Hash_table *table) argument 646 hash_free(Hash_table *table) argument 703 allocate_entry(Hash_table *table) argument 728 free_entry(Hash_table *table, struct hash_entry *entry) argument 742 hash_find_entry(Hash_table *table, const void *entry, struct hash_entry **bucket_head, bool delete) argument 817 hash_rehash(Hash_table *table, size_t candidate) argument 906 hash_insert(Hash_table *table, const void *entry) argument 981 hash_delete(Hash_table *table, const void *entry) argument 1027 hash_print(const Hash_table *table) argument [all...] |
/macosx-10.9.5/ruby-104/ruby/ext/tk/sample/tkextlib/tktable/ |
H A D | debug.rb | 5 ## This demo uses most features of the table widget 12 # create the table 17 # fill table variable 26 table = Tk::TkTable.new(:rows=>rows, :cols=>cols, :variable=>ary, 38 sx = table.xscrollbar(TkScrollbar.new) 39 sy = table.yscrollbar(TkScrollbar.new) 44 Tk.grid(table, sy, :sticky=>:news) 51 table.tag_configure('OddCol', :bg=>'brown', :fg=>'pink') 52 table.tag_configure('title', :bg=>'red', :fg=>'green', :relief=>:sunken) 53 table [all...] |