mirror of
https://github.com/ruby/ruby.git
synced 2022-11-09 12:17:21 -05:00
c35ff11ae5
[Feature #11420] This table only manage ID->VALUE table to reduce overhead of st. Some functions prefixed rb_id_table_* are provided. * id_table.c: implement rb_id_table_*. There are several algorithms to implement it. Now, there are roughly 4 types: * st * array * hash (implemented by Yura Sokolov) * mix of array and hash The macro ID_TABLE_IMPL can choose implementation. You can see detailes about them at the head of id_table.c. At the default, I choose 34 (mix of list and hash). This is not final decision. Please report your suitable parameters or your data structure. * symbol.c: introduce rb_id_serial_t and rb_id_to_serial() to represent ID by serial number. * internal.h: use id_table for method tables. * class.c, gc.c, marshal.c, vm.c, vm_method.c: ditto. git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@51541 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
23 lines
933 B
C
23 lines
933 B
C
#include "ruby/ruby.h"
|
|
|
|
struct rb_id_table;
|
|
|
|
/* compatible with ST_* */
|
|
enum rb_id_table_iterator_result {
|
|
ID_TABLE_CONTINUE = ST_CONTINUE,
|
|
ID_TABLE_STOP = ST_STOP,
|
|
ID_TABLE_DELETE = ST_DELETE,
|
|
};
|
|
|
|
struct rb_id_table *rb_id_table_create(size_t size);
|
|
void rb_id_table_free(struct rb_id_table *tbl);
|
|
void rb_id_table_clear(struct rb_id_table *tbl);
|
|
|
|
size_t rb_id_table_size(struct rb_id_table *tbl);
|
|
size_t rb_id_table_memsize(struct rb_id_table *tbl);
|
|
|
|
int rb_id_table_insert(struct rb_id_table *tbl, ID id, VALUE val);
|
|
int rb_id_table_lookup(struct rb_id_table *tbl, ID id, VALUE *valp);
|
|
int rb_id_table_delete(struct rb_id_table *tbl, ID id);
|
|
void rb_id_table_foreach(struct rb_id_table *tbl, enum rb_id_table_iterator_result (*func)(ID id, VALUE val, void *data), void *data);
|
|
void rb_id_table_foreach_values(struct rb_id_table *tbl, enum rb_id_table_iterator_result (*func)(VALUE val, void *data), void *data);
|