|
| | btree () |
| |
| | btree (const discreta_base &x) |
| |
| btree & | operator= (const discreta_base &x) |
| |
| void * | operator new (size_t, void *p) |
| |
| void | settype_btree () |
| |
| kind | s_virtual_kind () |
| |
| | ~btree () |
| |
| void | freeself_btree () |
| |
| void | copyobject_to (discreta_base &x) |
| |
| std::ostream & | print (std::ostream &) |
| |
| int & | f_duplicatekeys () |
| |
| Vector & | key () |
| |
| hollerith & | filename () |
| |
| int & | f_open () |
| |
| int & | stream () |
| |
| int & | buf_idx () |
| |
| int & | Root () |
| |
| int & | FreeRec () |
| |
| int & | AllocRec () |
| |
| int & | btree_idx () |
| |
| int & | page_table_idx () |
| |
| void | init (const char *file_name, int f_duplicatekeys, int btree_idx) |
| |
| void | add_key_int4 (int field1, int field2) |
| |
| void | add_key_int2 (int field1, int field2) |
| |
| void | add_key_string (int output_size, int field1, int field2) |
| |
| void | key_fill_in (char *the_key, Vector &the_object) |
| |
| void | key_print (char *the_key, std::ostream &ost) |
| |
| void | create (int verbose_level) |
| |
| void | open (int verbose_level) |
| |
| void | close (int verbose_level) |
| |
| void | ReadInfo (int verbose_level) |
| |
| void | WriteInfo (int verbose_level) |
| |
| int | AllocateRec (int verbose_level) |
| |
| void | ReleaseRec (int x) |
| |
| void | LoadPage (Buffer *BF, int x, int verbose_level) |
| |
| void | SavePage (Buffer *BF, int verbose_level) |
| |
| int | search_string (discreta_base &key_op, int &pos, int verbose_level) |
| |
| void | search_interval_int4 (int i_min, int i_max, int &first, int &len, int verbose_level) |
| |
| void | search_interval_int4_int4 (int l0, int u0, int l1, int u1, int &first, int &len, int verbose_level) |
| |
| void | search_interval_int4_int4_int4 (int l0, int u0, int l1, int u1, int l2, int u2, int &first, int &len, int verbose_level) |
| |
| void | search_interval_int4_int4_int4_int4 (int l0, int u0, int l1, int u1, int l2, int u2, int l3, int u3, int &first, int &len, int verbose_level) |
| |
| int | search_int4_int4 (int data1, int data2, int &idx, int verbose_level) |
| |
| int | search_unique_int4 (int i, int verbose_level) |
| |
| int | search_unique_int4_int4_int4_int4 (int i0, int i1, int i2, int i3, int verbose_level) |
| |
| int | search_datref_of_unique_int4 (int i, int verbose_level) |
| |
| int | search_datref_of_unique_int4_if_there (int i, int verbose_level) |
| |
| int | get_highest_int4 () |
| |
| void | get_datrefs (int first, int len, Vector &datrefs) |
| |
| int | search (void *pSearchKey, DATATYPE *pData, int *idx, int key_depth, int verbose_level) |
| |
| int | SearchBtree (int page, void *pSearchKey, DATATYPE *pData, Buffer *Buf, int *idx, int key_depth, int verbose_level) |
| |
| int | SearchPage (Buffer *buffer, void *pSearchKey, DATATYPE *pSearchData, int *cur, int *x, int key_depth, int verbose_level) |
| |
| int | length (int verbose_level) |
| |
| void | ith (int l, KEYTYPE *key, DATATYPE *data, int verbose_level) |
| |
| int | page_i_th (int l, Buffer *buffer, int *cur, int *i, int verbose_level) |
| |
| void | insert_key (KEYTYPE *pKey, DATATYPE *pData, int verbose_level) |
| |
| void | Update (int Node, int *Rise, ItemTyp *RisenItem, int *RisenNeighbourChilds, int f_v) |
| |
| void | Split (Buffer *BF, ItemTyp *Item, int x, int *RisenNeighbourChilds, int verbose_level) |
| |
| void | delete_ith (int idx, int verbose_level) |
| |
| void | Delete (int Node, int &Underflow, int verbose_level) |
| |
| void | FindGreatest (int Node1, int &Underflow, Buffer *DKBF, int x, int verbose_level) |
| |
| void | Compensate (int Precedent, int Node, int Path, int &Underflow, int verbose_level) |
| |
| void | print_all (std::ostream &ost) |
| |
| void | print_range (int first, int len, std::ostream &ost) |
| |
| void | print_page (int x, std::ostream &ost) |
| |
| void | page_print (Buffer *BF, std::ostream &ost) |
| |
| void | item_print (ItemTyp *item, int i, std::ostream &ost) |
| |
| void | file_open () |
| |
| void | file_create () |
| |
| void | file_close () |
| |
| void | file_write (PageTyp *page, const char *message) |
| |
| void | file_read (PageTyp *page, const char *message) |
| |
| void | file_seek (int page_no) |
| |
| | Vector () |
| |
| | Vector (const discreta_base &x) |
| |
| Vector & | operator= (const discreta_base &x) |
| |
| void * | operator new (size_t, void *p) |
| |
| void | settype_vector () |
| |
| | ~Vector () |
| |
| void | freeself_vector () |
| |
| kind | s_virtual_kind () |
| |
| void | copyobject_to (discreta_base &x) |
| |
| std::ostream & | Print (std::ostream &) |
| |
| std::ostream & | print (std::ostream &) |
| |
| std::ostream & | print_unformatted (std::ostream &ost) |
| |
| std::ostream & | print_intvec (std::ostream &ost) |
| |
| discreta_base & | s_i (int i) |
| |
| int & | s_ii (int i) |
| |
| void | m_ii (int i, int a) |
| |
| discreta_base & | operator[] (int i) |
| |
| int | s_l () |
| |
| void | m_l (int l) |
| |
| void | m_l_n (int l) |
| |
| void | m_l_e (int l) |
| |
| void | m_l_x (int l, discreta_base &x) |
| |
| Vector & | realloc (int l) |
| |
| void | mult_to (discreta_base &x, discreta_base &y) |
| |
| void | add_to (discreta_base &x, discreta_base &y) |
| |
| void | inc () |
| |
| void | dec () |
| |
| int | compare_with (discreta_base &a) |
| |
| void | append_vector (Vector &v) |
| |
| Vector & | append_integer (int a) |
| |
| Vector & | append (discreta_base &x) |
| |
| Vector & | insert_element (int i, discreta_base &x) |
| |
| Vector & | get_and_delete_element (int i, discreta_base &x) |
| |
| Vector & | delete_element (int i) |
| |
| void | get_first_and_remove (discreta_base &x) |
| |
| bool | insert_sorted (discreta_base &x) |
| |
| bool | search (discreta_base &x, int *idx) |
| |
| Vector & | sort () |
| |
| void | sort_with_fellow (Vector &fellow) |
| |
| Vector & | sort_with_logging (permutation &p) |
| |
| void | sum_of_all_entries (discreta_base &x) |
| |
| void | n_choose_k_first (int n, int k) |
| |
| int | n_choose_k_next (int n, int k) |
| |
| void | first_lehmercode (int n) |
| |
| int | next_lehmercode () |
| |
| void | lehmercode2perm (permutation &p) |
| |
| void | q_adic (int n, int q) |
| |
| int | q_adic_as_int (int q) |
| |
| void | mult_scalar (discreta_base &a) |
| |
| void | first_word (int n, int q) |
| |
| int | next_word (int q) |
| |
| void | first_regular_word (int n, int q) |
| |
| int | next_regular_word (int q) |
| |
| int | is_regular_word () |
| |
| void | apply_permutation (permutation &p) |
| |
| void | apply_permutation_to_elements (permutation &p) |
| |
| void | content (Vector &c, Vector &where) |
| |
| void | content_multiplicities_only (Vector &c, Vector &mult) |
| |
| int | hip () |
| |
| int | hip1 () |
| |
| void | write_mem (memory &m, int debug_depth) |
| |
| void | read_mem (memory &m, int debug_depth) |
| |
| int | csf () |
| |
| void | conjugate (discreta_base &a) |
| |
| void | conjugate_with_inverse (discreta_base &a) |
| |
| void | replace (Vector &v) |
| |
| void | vector_of_vectors_replace (Vector &v) |
| |
| void | extract_subvector (Vector &v, int first, int len) |
| |
| void | PG_element_normalize () |
| |
| void | PG_element_rank (int &a) |
| |
| void | PG_element_rank_modified (int &a) |
| |
| void | PG_element_unrank (int a) |
| |
| void | PG_element_unrank_modified (int a) |
| |
| void | AG_element_rank (int &a) |
| |
| void | AG_element_unrank (int a) |
| |
| int | hamming_weight () |
| |
| void | scalar_product (Vector &w, discreta_base &a) |
| |
| void | hadamard_product (Vector &w) |
| |
| void | intersect (Vector &b, Vector &c) |
| |
| int | vector_of_vectors_overall_length () |
| |
| void | first_divisor (Vector &exponents) |
| |
| int | next_divisor (Vector &exponents) |
| |
| int | next_non_trivial_divisor (Vector &exponents) |
| |
| void | multiply_out (Vector &primes, discreta_base &x) |
| |
| int | hash (int hash0) |
| |
| int | is_subset_of (Vector &w) |
| |
| void | concatenation (Vector &v1, Vector &v2) |
| |
| void | print_word_nicely (std::ostream &ost, int f_generator_labels, Vector &generator_labels) |
| |
| void | print_word_nicely2 (std::ostream &ost) |
| |
| void | print_word_nicely_with_generator_labels (std::ostream &ost, Vector &generator_labels) |
| |
| void | vector_of_vectors_lengths (Vector &lengths) |
| |
| void | get_element_orders (Vector &vec_of_orders) |
| |
| | discreta_base () |
| |
| | discreta_base (const discreta_base &x) |
| |
| discreta_base & | operator= (const discreta_base &x) |
| |
| virtual | ~discreta_base () |
| |
| void | freeself_discreta_base () |
| |
| void | freeself () |
| |
| void | freeself_kind (kind k) |
| |
| void | clearself () |
| |
| integer & | as_integer () |
| |
| longinteger & | as_longinteger () |
| |
| Vector & | as_vector () |
| |
| permutation & | as_permutation () |
| |
| number_partition & | as_number_partition () |
| |
| discreta_matrix & | as_matrix () |
| |
| unipoly & | as_unipoly () |
| |
| memory & | as_memory () |
| |
| hollerith & | as_hollerith () |
| |
| bt_key & | as_bt_key () |
| |
| database & | as_database () |
| |
| btree & | as_btree () |
| |
| design_parameter_source & | as_design_parameter_source () |
| |
| design_parameter & | as_design_parameter () |
| |
| integer & | change_to_integer () |
| |
| longinteger & | change_to_longinteger () |
| |
| Vector & | change_to_vector () |
| |
| permutation & | change_to_permutation () |
| |
| number_partition & | change_to_number_partition () |
| |
| discreta_matrix & | change_to_matrix () |
| |
| unipoly & | change_to_unipoly () |
| |
| memory & | change_to_memory () |
| |
| hollerith & | change_to_hollerith () |
| |
| bt_key & | change_to_bt_key () |
| |
| database & | change_to_database () |
| |
| btree & | change_to_btree () |
| |
| design_parameter_source & | change_to_design_parameter_source () |
| |
| design_parameter & | change_to_design_parameter () |
| |
| void * | operator new (size_t, void *p) |
| |
| void | settype_base () |
| |
| kind | s_kind () |
| |
| virtual kind | s_virtual_kind () |
| |
| void | c_kind (kind k) |
| |
| void | swap (discreta_base &a) |
| |
| void | copyobject (discreta_base &x) |
| |
| virtual void | copyobject_to (discreta_base &x) |
| |
| virtual std::ostream & | print (std::ostream &) |
| |
| void | print_to_hollerith (hollerith &h) |
| |
| std::ostream & | println (std::ostream &) |
| |
| std::ostream & | printobjectkind (std::ostream &) |
| |
| std::ostream & | printobjectkindln (std::ostream &) |
| |
| int & | s_i_i () |
| |
| void | m_i_i (int i) |
| |
| virtual int | compare_with (discreta_base &a) |
| |
| int | eq (discreta_base &a) |
| |
| int | neq (discreta_base &a) |
| |
| int | le (discreta_base &a) |
| |
| int | lt (discreta_base &a) |
| |
| int | ge (discreta_base &a) |
| |
| int | gt (discreta_base &a) |
| |
| int | is_even () |
| |
| int | is_odd () |
| |
| void | mult (discreta_base &x, discreta_base &y) |
| |
| void | mult_mod (discreta_base &x, discreta_base &y, discreta_base &p) |
| |
| virtual void | mult_to (discreta_base &x, discreta_base &y) |
| |
| int | invert () |
| |
| int | invert_mod (discreta_base &p) |
| |
| virtual int | invert_to (discreta_base &x) |
| |
| void | mult_apply (discreta_base &x) |
| |
| discreta_base & | operator*= (discreta_base &y) |
| |
| discreta_base & | power_int (int l) |
| |
| discreta_base & | power_int_mod (int l, discreta_base &p) |
| |
| discreta_base & | power_longinteger (longinteger &l) |
| |
| discreta_base & | power_longinteger_mod (longinteger &l, discreta_base &p) |
| |
| discreta_base & | commutator (discreta_base &x, discreta_base &y) |
| |
| discreta_base & | conjugate (discreta_base &x, discreta_base &y) |
| |
| discreta_base & | divide_by (discreta_base &x) |
| |
| discreta_base & | divide_by_exact (discreta_base &x) |
| |
| int | order () |
| |
| int | order_mod (discreta_base &p) |
| |
| void | add (discreta_base &x, discreta_base &y) |
| |
| void | add_mod (discreta_base &x, discreta_base &y, discreta_base &p) |
| |
| virtual void | add_to (discreta_base &x, discreta_base &y) |
| |
| void | negate () |
| |
| virtual void | negate_to (discreta_base &x) |
| |
| void | add_apply (discreta_base &x) |
| |
| discreta_base & | operator+= (discreta_base &y) |
| |
| virtual void | normalize (discreta_base &p) |
| |
| virtual void | zero () |
| |
| virtual void | one () |
| |
| virtual void | m_one () |
| |
| virtual void | homo_z (int z) |
| |
| virtual void | inc () |
| |
| virtual void | dec () |
| |
| virtual int | is_zero () |
| |
| virtual int | is_one () |
| |
| virtual int | is_m_one () |
| |
| discreta_base & | factorial (int z) |
| |
| discreta_base & | i_power_j (int i, int j) |
| |
| virtual int | compare_with_euclidean (discreta_base &a) |
| |
| virtual void | integral_division (discreta_base &x, discreta_base &q, discreta_base &r, int verbose_level) |
| |
| void | integral_division_exact (discreta_base &x, discreta_base &q) |
| |
| void | integral_division_by_integer (int x, discreta_base &q, discreta_base &r) |
| |
| void | integral_division_by_integer_exact (int x, discreta_base &q) |
| |
| void | integral_division_by_integer_exact_apply (int x) |
| |
| int | is_divisor (discreta_base &y) |
| |
| void | modulo (discreta_base &p) |
| |
| void | extended_gcd (discreta_base &n, discreta_base &u, discreta_base &v, discreta_base &g, int verbose_level) |
| |
| void | write_memory (memory &m, int debug_depth) |
| |
| void | read_memory (memory &m, int debug_depth) |
| |
| int | calc_size_on_file () |
| |
| void | pack (memory &M, int verbose_level, int debug_depth) |
| |
| void | unpack (memory &M, int verbose_level, int debug_depth) |
| |
| void | save_ascii (std::ostream &f) |
| |
| void | load_ascii (std::istream &f) |
| |
| void | save_file (const char *fname) |
| |
| void | load_file (const char *fname) |
| |
DISCRETA class for a database.
Definition at line 1671 of file discreta.h.