<> <> <> <> <> <> <> <> <> DIRECTORY IntHashTable, Basics; IntHashTableImpl: CEDAR MONITOR LOCKS table USING table: Table IMPORTS Basics EXPORTS IntHashTable = { OPEN IntHashTable; <> Create: PUBLIC PROC [mod: SeqIndex Ź 17] RETURNS [Table] = { mod Ź MAX[mod, minMod]; RETURN [NEW [TableRec Ź [ size: 0, sizeLimit: mod, inhibitCount: 0, data: NEW [Seq[mod]] ]]]; }; minMod: SeqIndex = 2; GetSize: PUBLIC PROC [table: Table] RETURNS [INT] = { RETURN [table.size]; }; Nicefy: PROC [key: INT32] RETURNS [CARD16] = TRUSTED INLINE { RETURN[ Basics.LowHalf[LOOPHOLE[key]] + Basics.HighHalf[LOOPHOLE[key]] ]; }; ComputeIndex: PROC [table: Table, key: Key] RETURNS [index: SeqIndex] = INLINE { index Ź Nicefy[key] MOD table.data.max; }; Fetch: PUBLIC ENTRY PROC [table: Table, key: Key] RETURNS [found: BOOL, value: Value] = { ENABLE UNWIND => NULL; hash: SeqIndex Ź ComputeIndex[table, key]; node: Node Ź table.data[hash]; WHILE node # NIL DO IF key=node.key THEN RETURN [TRUE, node.value]; node Ź node.next; ENDLOOP; RETURN [FALSE, NIL]; }; Replace: PUBLIC ENTRY PROC [table: Table, key: Key, value: Value] RETURNS [BOOL] = { ENABLE UNWIND => NULL; hash: SeqIndex Ź ComputeIndex[table, key]; node: Node Ź table.data[hash]; WHILE node # NIL DO IF key=node.key THEN {node.value Ź value; RETURN [TRUE]}; node Ź node.next; ENDLOOP; RETURN [FALSE]; }; Store: PUBLIC ENTRY PROC [table: Table, key: Key, value: Value] RETURNS [BOOL] = { ENABLE UNWIND => NULL; hash: SeqIndex Ź ComputeIndex[table, key]; node: Node Ź table.data[hash]; WHILE node # NIL DO IF key=node.key THEN {node.value Ź value; RETURN [FALSE]}; node Ź node.next; ENDLOOP; table.data[hash] Ź NEW[NodeRep Ź [key: key, value: value, next: table.data[hash]]]; IF (table.size Ź table.size + 1) > table.sizeLimit AND table.inhibitCount = 0 THEN ReHash[table]; RETURN [TRUE]; }; Insert: PUBLIC ENTRY PROC [table: Table, key: Key, value: Value] RETURNS [BOOL] = { ENABLE UNWIND => NULL; hash: SeqIndex Ź ComputeIndex[table, key]; node: Node Ź table.data[hash]; WHILE node # NIL DO IF key=node.key THEN RETURN [FALSE]; node Ź node.next; ENDLOOP; table.data[hash] Ź NEW[NodeRep Ź [key: key, value: value, next: table.data[hash]]]; IF (table.size Ź table.size + 1) > table.sizeLimit AND table.inhibitCount = 0 THEN ReHash[table]; RETURN [TRUE]; }; Delete: PUBLIC ENTRY PROC [table: Table, key: Key] RETURNS [BOOL] = { ENABLE UNWIND => NULL; hash: SeqIndex Ź ComputeIndex[table, key]; node: Node Ź table.data[hash]; lag: Node Ź NIL; WHILE node # NIL DO IF key=node.key THEN { IF lag = NIL THEN table.data[hash] Ź node.next ELSE lag.next Ź node.next; table.size Ź table.size - 1; RETURN [TRUE]; }; lag Ź node; node Ź node.next; ENDLOOP; RETURN [FALSE]; }; Pairs: PUBLIC PROC [table: Table, action: EachPairAction] RETURNS [quit: BOOL] = { node: Node Ź NIL; {ENABLE UNWIND => index: CARDINAL Ź table.data.max; DO [node, index] Ź GetNext[table, node, index]; IF node = NIL THEN {quit Ź FALSE; EXIT}; IF action[node.key, node.value] THEN {quit Ź TRUE; EXIT}; ENDLOOP; }; }; table.inhibitCount Ź table.inhibitCount + WHILE table.inhibitCount = 0 AND table.size > table.sizeLimit DO ReHash[table] ENDLOOP; }; GetNext: ENTRY PROC [table: Table, node: Node, index: CARDINAL] RETURNS [Node, CARDINAL] = { ENABLE UNWIND => NULL; IF node # NIL THEN { node Ź node.next; IF node # NIL THEN RETURN [node, index]; }; WHILE index > 0 DO index Ź index - 1; node Ź table.data[index]; IF node # NIL THEN RETURN [node, index]; ENDLOOP; RETURN [NIL, 0]; }; Erase: PUBLIC ENTRY PROC [table: Table] = { FOR i: CARDINAL IN [0..table.data.max) DO table.data[i] Ź NIL ENDLOOP; table.size Ź 0; }; ReHash: INTERNAL PROC [table: Table] = { oldData: REF Seq = table.data; newData: REF Seq; seek: CARDINAL = table.data.max * 2; newPTI, newMod: CARDINAL Ź 0; IF primeTable[PrimeTableSize-1] > LAST[SeqIndex] THEN ERROR; FOR newPTI Ź 0, newPTI+1 WHILE newPTI+1 < PrimeTableSize AND primeTable[newPTI] < seek DO NULL ENDLOOP; newMod Ź primeTable[newPTI]; IF newMod = table.data.max THEN {table.sizeLimit Ź LAST[INT]; RETURN}; table.sizeLimit Ź newMod; table.data Ź newData Ź NEW [Seq[newMod]]; FOR i: NAT IN [0 .. oldData.max) DO next: Node Ź NIL; FOR cur: Node Ź oldData[i], next WHILE cur # NIL DO hash: SeqIndex Ź ComputeIndex[table, cur.key]; next Ź cur.next; cur.next Ź newData[hash]; newData[hash] Ź cur; ENDLOOP; IF next # NIL THEN ERROR; ENDLOOP; table Ź table; }; PrimeTableSize: NAT = 14; primeTable: ARRAY [0 .. PrimeTableSize) OF CARDINAL = [ 00002, 00005, 00011, 00023, 00053, 00113, 00251, 00509, 01019, 02039, 04079, 08179, 16369, 32749]; }.