Заготовки по С / Динамические структуры / GDSL / Документация

Hashtable manipulation module

87

4.8.2.7

ushort gdsl_hash_get_lists_max_size ( onst gdsl_hash_t

H)

Get the max number of elements allowed in ea h entry of a hashtable.

Note:

re ondition:y: O( 1 )

Complexitust be

valid gdsl_hash_t

H

The hashtable to use.

Parameters:

Returns:

(ie. no limit for H's ntries).

0 if no lists max size was set

the max number

elements forbeforeh entryof the hashtable H, if the fun tion

hash

modify()(p. 91) was used with a NEW LISTS MAX

SIZE

reather than the a tual one.

dsl_hash_ ll fa t r()

See also:

get

longest

list size()(p. 87)

gdsl_hash

entries

number()(p. 86)

modify()(p. 91)

4.8.2.8

ushort gdsl

hash_get_longest_list_size ( onst

gdsl

hash

t H)

Get the number of elements of the longest list entry of a hashtable.

Note:

Complexity: O( L ), where L = gdsl_hash_get_entries_number(H)

re ondition:

valid gdsl_hash_t

Parameters:ust be

H

The hashtable to use.

Returns:the umber of elements of the longest list entry of the hashtable H.

See also:

ll

(p. 88)

_

size()(p. 87)

gdsl_hash

getfa tor()size()lis

max

en ries

numb r()(p. 86)

Generated on Thu Jun 22 11:15:30 2006 for gdsl by Doxygen

4.8 Hashtable manipulation module

89

ˆ its2 + 1

gdsl_

_get_lists_max_size( (say M) is modi ed

M

y:.element84)KtoOhed,HASH(.)zero(1modulogdsl)soEif gdslHisFhashneedsaregdslthhashntheminsertedthashofundifygrowgettionget(H)listsintopoin)eniftrimaxHgdsleatrs__passednumber(H)size(H)thehashentgetoryisgdslnot.listsomputedALLOCreamaxhedbyF,or--

Note:size(H)ComplexitifalloKEYHASH2isThe()qualisF(pF(reaand

re ondition:

valid gdsl_hash_t

ust be

Parameters:

H The hashtable to mo ify

VALUE The value used to make the new element to insert into H

Generated on Thu Jun 22 11:15:30 2006 for gdsl by Doxygen

90

gdsl Module Do umentation

Returns:

the

lement E

ase of su ess.

NULLinsertedase of insu ient memory.

See also:

allo ()(p. 84)

remov

(p. 90)

get size()ntries number()(p. 86)

let

(p. 90)

gdsl_hash_modify()(p. 91)

4.8.2.13

(p. 88)

gdsl_element_t gdsl_hash_remove (gdsl_hash_t H,

arameters:ust be valid gdsl_hash_t

H The hashtable to modify

KEY The key used to nd the element to remov

Returns:

t

in H ase is found.

the rst founded

NULL in ase no element equal to KEY is fouind in H.

See also:

ins rt()

. 89)

gdsl_hash_delete()(p.

90)

sear h() .

2)

4.8.2.14 gdsl_hash_

gdsl_hash_delete (gdsl_hash_t H, onst

4.8

table manipulation module

93

HashThe hashtable to map

Parameters:

map fun tion.

MAP F

USER_DATheA User's datas passed to MAP_F

Returns:

for whi h MAP_F returns GDSL_MAP_STOP.

the rst elemen

NULL when the parsing is done.

( onst gdsl_hash_t H,

4.8.2.18

gdsl_hash_

voidgdsl_write_fun writeWRITE_F, FILE OUTPUT_FILE,

WritetionComplexity:allthe.theAdditionnalelemementsO(USERofts USERtheofahashtableDATADATA) HargumentotoOUTPUTle.tould_beFILE,passedusingtoWRITE__FF.

Note:fun

OUTPUT

FILE The le where to write H's elements.

USER DATA User's datas passed to WRITE F.

See also:

write xml()(p. 93)

gdsl_hash_dump()(p. 94)

_xml ( onst gdsl_hash_t H,

4.8.2.19

gdsl_hash_

94

gdsl Module Do umentation

Note:

HComplexitondition:Theust hashbey:FtablevalidO(FILETheHtogdslwrite)Thewritehashfun.le tionwheret &. OUTPUTtowriteH'sFILEelements!=NULL.

Parameters:reOUTPUTWRITE

| |

.9 Heap m nipulation module

95

4.9

Heap manipulation module

T

ateoyALLOCCOMPaheapnwheap.F)F,free.ushgdsl(gdsl(gdslfreeheapheapfun t( H)onstH)FREE NAME,F,gdslgdslompareallo _-

gdsl

voidfunDestrCr

Flush

he .

Getelementhargdslthe topsizenamegdslheapofofoftheapgdslget.. . heapsizeget(namegetonst gdsltop ( heaponstgdslgdsltheapH)heapt H)t H)

gdslulongonst

bool gdsl_

is

empty ( onst gdsl_heap_t H)

ˆ

Che k if ahe

is empty.

_set_name (gdsl_heap_t H, onst har

gdsl heap_t gdsl

ˆ gdslNEWSet elementheNAME)namethe oftopa hegdslheap. heap_set_top (gdsl_heap_t

H,

void

ˆ gdslVALUE)Substituteelemen _

elementgdsl_of heapinsertby a lesser(gdslone. heap_t

H,

void

96

R

the top element from a he

gdsl Module Do umentation

(POP).

Deletemovethe

from he .

top (gdsl_heap_t H)

ˆ gdsl

h ap_ gdsl heap delete

ele entop_elementgdsl_heap_map_forward ( onst gdsl_heap_t