1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122
| package com;
public class SymbolTable<Key, Value> {
public Node head; public int symbolTableLength;
private class Node { public Key key; public Value value; public Node next;
public Node(Key key, Value value, Node next) { this.key = key; this.value = value; this.next = next; } }
public SymbolTable() { head = new Node(null, null, null); symbolTableLength = 0; }
public int size() { return symbolTableLength; }
public Value get(Key key) { Node n = head; while (n.next!=null) { n = n.next; if (n.key.equals(key)) { return n.value; } } return null; }
public void put(Key key, Value value) { boolean flag = true; Node n = head; while (n.next!=null) { n = n.next; if (n.key.equals(key)) { n.value = value; flag = false; break; } } if (flag) { Node nLast = head; while (nLast.next!=null) { nLast = nLast.next; } Node node = new Node(key, value, null); nLast.next = node; } symbolTableLength++; }
public boolean delete(Key key) { Node nLeft = null; Node n = head; while (n.next!=null) { nLeft = n; n = n.next; if (n.key.equals(key)) { if (n.next!=null) { nLeft.next = n.next; } else { nLeft.next = null; } symbolTableLength--; return true; } } return false; }
public String toString() { String str = "{"; Node n = head; while (n.next!=null) { n = n.next; str += n.key + ":" + n.value + ", "; } str += "}"; return str; }
}
|