Documentation for module btree

B-tree

source: btree.F
Loading...

public Types:

btree_i8_zp2d
...
btree_data_sp2d
...
btree_i8_cp2d
...
btree_data_dp2d
...
btree_data_cp2d
...
btree_data_zp2d
...
btree_i8_dp2d
...
btree_i8_sp2d
...

Generic procedures:

btree_add
btree_delete
btree_find
btree_get_entries
btree_new

public Types:

TYPE :: btree_data_cp2d

...


COMPLEX(sp),
DIMENSION(:,:), POINTER :: p ...
LOGICAL
:: tr ...

TYPE :: btree_data_dp2d

...


REAL(dp),
DIMENSION(:,:), POINTER :: p ...
LOGICAL
:: tr ...

TYPE :: btree_data_sp2d

...


REAL(sp),
DIMENSION(:,:), POINTER :: p ...
LOGICAL
:: tr ...

TYPE :: btree_data_zp2d

...


COMPLEX(dp),
DIMENSION(:,:), POINTER :: p ...
LOGICAL
:: tr ...

TYPE :: btree_i8_cp2d

...


:: b ...

TYPE :: btree_i8_dp2d

...


:: b ...

TYPE :: btree_i8_sp2d

...


:: b ...

TYPE :: btree_i8_zp2d

...


:: b ...


Generic procedure btree_add

...

INTENT(inout)
:: tree ×
INTENT(inout)
:: tree ×
INTENT(inout)
:: tree ×
INTENT(inout)
:: tree ×
INTEGER(keyt),
INTENT(in)
:: key × × × ×
INTENT(in)
:: value ×
INTENT(in)
:: value ×
INTENT(in)
:: value ×
INTENT(in)
:: value ×
LOGICAL,
INTENT(out),
OPTIONAL
:: exists × × × ×
INTENT(out),
OPTIONAL
:: existing_value ×
INTENT(out),
OPTIONAL
:: existing_value ×
INTENT(out),
OPTIONAL
:: existing_value ×
INTENT(out),
OPTIONAL
:: existing_value ×
LOGICAL,
INTENT(in),
OPTIONAL
:: replace × × × ×

Generic procedure btree_delete

...

INTENT(inout)
:: tree ×
INTENT(inout)
:: tree ×
INTENT(inout)
:: tree ×
INTENT(inout)
:: tree ×
INTEGER(keyt),
INTENT(out),
OPTIONAL
:: keys(:) × × × ×
INTENT(out),
OPTIONAL
:: values(:) ×
INTENT(out),
OPTIONAL
:: values(:) ×
INTENT(out),
OPTIONAL
:: values(:) ×
INTENT(out),
OPTIONAL
:: values(:) ×

Generic procedure btree_find

...

INTENT(in)
:: tree ×
INTENT(in)
:: tree ×
INTENT(in)
:: tree ×
INTENT(in)
:: tree ×
INTEGER(keyt),
INTENT(in)
:: key × × × ×
INTENT(out)
:: value ×
INTENT(out)
:: value ×
INTENT(out)
:: value ×
INTENT(out)
:: value ×
LOGICAL,
INTENT(out),
OPTIONAL
:: exists × × × ×

Generic procedure btree_get_entries

...

INTENT(inout)
:: tree ×
INTENT(inout)
:: tree ×
INTENT(inout)
:: tree ×
INTENT(inout)
:: tree ×

Generic procedure btree_new

...

INTENT(out)
:: tree ×
INTENT(out)
:: tree ×
INTENT(out)
:: tree ×
INTENT(out)
:: tree ×
INTEGER,
INTENT(in),
OPTIONAL
:: order × × × ×

SUBROUTINEbtree_add_i8_sp2d(tree, key, value, exists, existing_value, replace)

...

Arguments:
INTENT(inout)
:: tree ...
INTEGER(keyt),
INTENT(in)
:: key ...
INTENT(in)
:: value ...
LOGICAL,
INTENT(out),
OPTIONAL
:: exists ...
INTENT(out),
OPTIONAL
:: existing_value ...
LOGICAL,
INTENT(in),
OPTIONAL
:: replace ...

SUBROUTINEbtree_add_i8_dp2d(tree, key, value, exists, existing_value, replace)

...

Arguments:
INTENT(inout)
:: tree ...
INTEGER(keyt),
INTENT(in)
:: key ...
INTENT(in)
:: value ...
LOGICAL,
INTENT(out),
OPTIONAL
:: exists ...
INTENT(out),
OPTIONAL
:: existing_value ...
LOGICAL,
INTENT(in),
OPTIONAL
:: replace ...

SUBROUTINEbtree_add_i8_cp2d(tree, key, value, exists, existing_value, replace)

...

Arguments:
INTENT(inout)
:: tree ...
INTEGER(keyt),
INTENT(in)
:: key ...
INTENT(in)
:: value ...
LOGICAL,
INTENT(out),
OPTIONAL
:: exists ...
INTENT(out),
OPTIONAL
:: existing_value ...
LOGICAL,
INTENT(in),
OPTIONAL
:: replace ...

SUBROUTINEbtree_add_i8_zp2d(tree, key, value, exists, existing_value, replace)

...

Arguments:
INTENT(inout)
:: tree ...
INTEGER(keyt),
INTENT(in)
:: key ...
INTENT(in)
:: value ...
LOGICAL,
INTENT(out),
OPTIONAL
:: exists ...
INTENT(out),
OPTIONAL
:: existing_value ...
LOGICAL,
INTENT(in),
OPTIONAL
:: replace ...

SUBROUTINEbtree_delete_i8_sp2d(tree, keys, values)

...

Arguments:
INTENT(inout)
:: tree ...
INTEGER(keyt),
INTENT(out),
OPTIONAL
:: keys(:) ...
INTENT(out),
OPTIONAL
:: values(:) ...

SUBROUTINEbtree_delete_i8_dp2d(tree, keys, values)

...

Arguments:
INTENT(inout)
:: tree ...
INTEGER(keyt),
INTENT(out),
OPTIONAL
:: keys(:) ...
INTENT(out),
OPTIONAL
:: values(:) ...

SUBROUTINEbtree_delete_i8_cp2d(tree, keys, values)

...

Arguments:
INTENT(inout)
:: tree ...
INTEGER(keyt),
INTENT(out),
OPTIONAL
:: keys(:) ...
INTENT(out),
OPTIONAL
:: values(:) ...

SUBROUTINEbtree_delete_i8_zp2d(tree, keys, values)

...

Arguments:
INTENT(inout)
:: tree ...
INTEGER(keyt),
INTENT(out),
OPTIONAL
:: keys(:) ...
INTENT(out),
OPTIONAL
:: values(:) ...

SUBROUTINEbtree_find_i8_sp2d(tree, key, value, exists)

...

Arguments:
INTENT(in)
:: tree ...
INTEGER(keyt),
INTENT(in)
:: key ...
INTENT(out)
:: value ...
LOGICAL,
INTENT(out),
OPTIONAL
:: exists ...

SUBROUTINEbtree_find_i8_dp2d(tree, key, value, exists)

...

Arguments:
INTENT(in)
:: tree ...
INTEGER(keyt),
INTENT(in)
:: key ...
INTENT(out)
:: value ...
LOGICAL,
INTENT(out),
OPTIONAL
:: exists ...

SUBROUTINEbtree_find_i8_cp2d(tree, key, value, exists)

...

Arguments:
INTENT(in)
:: tree ...
INTEGER(keyt),
INTENT(in)
:: key ...
INTENT(out)
:: value ...
LOGICAL,
INTENT(out),
OPTIONAL
:: exists ...

SUBROUTINEbtree_find_i8_zp2d(tree, key, value, exists)

...

Arguments:
INTENT(in)
:: tree ...
INTEGER(keyt),
INTENT(in)
:: key ...
INTENT(out)
:: value ...
LOGICAL,
INTENT(out),
OPTIONAL
:: exists ...

FUNCTIONbtree_get_entries_i8_sp2d(tree)

...

Return Value ::
INTEGER
Arguments:
INTENT(inout)
:: tree ...

FUNCTIONbtree_get_entries_i8_dp2d(tree)

...

Return Value ::
INTEGER
Arguments:
INTENT(inout)
:: tree ...

FUNCTIONbtree_get_entries_i8_cp2d(tree)

...

Return Value ::
INTEGER
Arguments:
INTENT(inout)
:: tree ...

FUNCTIONbtree_get_entries_i8_zp2d(tree)

...

Return Value ::
INTEGER
Arguments:
INTENT(inout)
:: tree ...

SUBROUTINEbtree_new_i8_sp2d(tree, order)

...

Arguments:
INTENT(out)
:: tree ...
INTEGER,
INTENT(in),
OPTIONAL
:: order ...

SUBROUTINEbtree_new_i8_dp2d(tree, order)

...

Arguments:
INTENT(out)
:: tree ...
INTEGER,
INTENT(in),
OPTIONAL
:: order ...

SUBROUTINEbtree_new_i8_cp2d(tree, order)

...

Arguments:
INTENT(out)
:: tree ...
INTEGER,
INTENT(in),
OPTIONAL
:: order ...

SUBROUTINEbtree_new_i8_zp2d(tree, order)

...

Arguments:
INTENT(out)
:: tree ...
INTEGER,
INTENT(in),
OPTIONAL
:: order ...

private Parameters/Types:

Parameters:

INTEGER
:: dp = kind(0.0d0)
INTEGER
:: keyt = selected_int_kind(10)
INTEGER
:: keyt = selected_int_kind(10)
INTEGER
:: keyt = selected_int_kind(10)
INTEGER
:: keyt = selected_int_kind(10)
INTEGER
:: sp = kind(0.0)
private Types:

TYPE :: btree_node_i8_cp2d

...


INTEGER
:: id ...
INTEGER
:: filled ...
INTEGER(keyt),
DIMENSION(:), POINTER :: keys ...
DIMENSION(:), POINTER :: values ...
DIMENSION(:), POINTER :: subtrees ...
POINTER :: parent ...

TYPE :: btree_node_i8_dp2d

...


INTEGER
:: id ...
INTEGER
:: filled ...
INTEGER(keyt),
DIMENSION(:), POINTER :: keys ...
DIMENSION(:), POINTER :: values ...
DIMENSION(:), POINTER :: subtrees ...
POINTER :: parent ...

TYPE :: btree_node_i8_sp2d

...


INTEGER
:: id ...
INTEGER
:: filled ...
INTEGER(keyt),
DIMENSION(:), POINTER :: keys ...
DIMENSION(:), POINTER :: values ...
DIMENSION(:), POINTER :: subtrees ...
POINTER :: parent ...

TYPE :: btree_node_i8_zp2d

...


INTEGER
:: id ...
INTEGER
:: filled ...
INTEGER(keyt),
DIMENSION(:), POINTER :: keys ...
DIMENSION(:), POINTER :: values ...
DIMENSION(:), POINTER :: subtrees ...
POINTER :: parent ...

TYPE :: btree_node_p_i8_cp2d

...


POINTER :: node ...

TYPE :: btree_node_p_i8_dp2d

...


POINTER :: node ...

TYPE :: btree_node_p_i8_sp2d

...


POINTER :: node ...

TYPE :: btree_node_p_i8_zp2d

...


POINTER :: node ...

TYPE :: btree_node_structure_i8_cp2d

...


INTEGER
:: min_fill ...
INTEGER
:: max_fill ...
INTEGER
:: n ...
INTEGER
:: lastid ...
INTEGER
:: refcount ...
POINTER :: root ...

TYPE :: btree_node_structure_i8_dp2d

...


INTEGER
:: min_fill ...
INTEGER
:: max_fill ...
INTEGER
:: n ...
INTEGER
:: lastid ...
INTEGER
:: refcount ...
POINTER :: root ...

TYPE :: btree_node_structure_i8_sp2d

...


INTEGER
:: min_fill ...
INTEGER
:: max_fill ...
INTEGER
:: n ...
INTEGER
:: lastid ...
INTEGER
:: refcount ...
POINTER :: root ...

TYPE :: btree_node_structure_i8_zp2d

...


INTEGER
:: min_fill ...
INTEGER
:: max_fill ...
INTEGER
:: n ...
INTEGER
:: lastid ...
INTEGER
:: refcount ...
POINTER :: root ...