![BST<T>
+BST()
+BST(BST<T>, Comparator<T>)
+getRoot(): T
+isEmpty(): Boolean
-getSize(): int
+getSize(Node): int
+getHight(): int
-getHight(Node): int
+findMin(): T
-findMin(Node): T
+findMax(): T
-findMax(Node): T
+search(T, boolean, Comparator<T> )
-search(T, Node, boolean, Comparator<T> )
+insert(T data, Comparator<T> ): void
-insert(T, Node, Comparator<T> ): void
+remove(T data, Comparator<T> c): void
-remove(T, Node, Comparator<T> ): Node
+preOrderPrint(): void
-preOrderPrint(Node): void
+inOrderPrint(): void
-inOrderPrint(Node): void
+postOrderPrint(): void
-postOrderPrint(Node): void
Node<T>
-data: T
-left: Node
-right: Node
+Node(T)
List<T>
-length: int
- first: Node
-last: Node
- iterator: Node
+List()
+List(List<T> )
+getFirst() : T
+getLast(): T
+getLength(): int
+getIterator(): T
+isEmpty(): boolean
+offEnd(): boolean
+equals(Object ) :
boolean
+linearSearch(T): int
+addFirst(T): void
+addLast(T): void
+removeFirst(): void
+removeLast(): vod
+placeIterator() : void
+addIterator(T) : void
+removeIterator(): void
+advanceIterator(): void
+reverseIterator(): void
+iteratorToIndex(int ):
void
+toString(): String
+printNumberedList():
void
Node<T>
-data: T
-next: Node
-prev: Node
+Node(T)
HashTable<T>
-numElements: int
-Table:
ArrayList<List<T>>
HashTable(int): int
-hash(T): T
+countBucket(int): int
+getNumElements(): int
+get(T) : T
+contains(T): boolean
+put(T): void
+remove(T): void
+clear(): void
+printBucket(int): void
+printTable(): void
+toString(): String
WordID
-word: String
-id: int
+WordID(String):
+ WordID(String, int )
+Id(): int
+toString(): String
+equals(Object):
boolean
Poem
-title: String
- author: String
-year: int
-country: String
- text: String
+Poem(String)
+Poem(String , String)
+Poem(String , String, int, String, String)
+getTitle(): String
+getText(): String
+setTitle(String): void
+setTitle(String): void
+setAuthor(String): void
+toString(): String
+equals(Object): boolean
+hashCode(): int
PoemInterface
-htPms: HashTable<Poem>
-w_ids: HashTable<WordID>
-alBsts: ArrayList<BST<Poem>>
-count : int <<static>>
-words: ArrayList<String>
+main(String[] args) : void
+readFile(Scanner, String, String[]): void
+uploadNewPoem(Scanner, Scanner, String[]) : void
+searchPoemByPrimaryKey(Scanner):Poem
+updateAPoem(Scanner): void
+deleteAPoem(Scanner, String[]): void
+getKeywords(String, String[]): ArrayList<String>
+searchARecodAndDisplay(Scanner): void
+searchPoemsByKeyword(Scanner , String):
ArrayList<Poem>
+getInt(Scanner, int, int, String): int
+dataStatistics(): void
+getSpaces(int, String): String
+writeFile(Scanner): void
+binarySearch(String[], String): void
<<interface>>
java.lang.Comparator
+comparTo(Object, Object): int
TitleComparator
+compare(Poem , Poem ): int](https://image.slidesharecdn.com/kamiexport-cis22cfinalprojectuml1-211023205623/85/CS-210-Project-UML-1-320.jpg)
CS 210 Project UML
- 1. BST<T> +BST() +BST(BST<T>, Comparator<T>) +getRoot(): T +isEmpty(): Boolean -getSize(): int +getSize(Node): int +getHight(): int -getHight(Node): int +findMin(): T -findMin(Node): T +findMax(): T -findMax(Node): T +search(T, boolean, Comparator<T> ) -search(T, Node, boolean, Comparator<T> ) +insert(T data, Comparator<T> ): void -insert(T, Node, Comparator<T> ): void +remove(T data, Comparator<T> c): void -remove(T, Node, Comparator<T> ): Node +preOrderPrint(): void -preOrderPrint(Node): void +inOrderPrint(): void -inOrderPrint(Node): void +postOrderPrint(): void -postOrderPrint(Node): void Node<T> -data: T -left: Node -right: Node +Node(T) List<T> -length: int - first: Node -last: Node - iterator: Node +List() +List(List<T> ) +getFirst() : T +getLast(): T +getLength(): int +getIterator(): T +isEmpty(): boolean +offEnd(): boolean +equals(Object ) : boolean +linearSearch(T): int +addFirst(T): void +addLast(T): void +removeFirst(): void +removeLast(): vod +placeIterator() : void +addIterator(T) : void +removeIterator(): void +advanceIterator(): void +reverseIterator(): void +iteratorToIndex(int ): void +toString(): String +printNumberedList(): void Node<T> -data: T -next: Node -prev: Node +Node(T) HashTable<T> -numElements: int -Table: ArrayList<List<T>> HashTable(int): int -hash(T): T +countBucket(int): int +getNumElements(): int +get(T) : T +contains(T): boolean +put(T): void +remove(T): void +clear(): void +printBucket(int): void +printTable(): void +toString(): String WordID -word: String -id: int +WordID(String): + WordID(String, int ) +Id(): int +toString(): String +equals(Object): boolean Poem -title: String - author: String -year: int -country: String - text: String +Poem(String) +Poem(String , String) +Poem(String , String, int, String, String) +getTitle(): String +getText(): String +setTitle(String): void +setTitle(String): void +setAuthor(String): void +toString(): String +equals(Object): boolean +hashCode(): int PoemInterface -htPms: HashTable<Poem> -w_ids: HashTable<WordID> -alBsts: ArrayList<BST<Poem>> -count : int <<static>> -words: ArrayList<String> +main(String[] args) : void +readFile(Scanner, String, String[]): void +uploadNewPoem(Scanner, Scanner, String[]) : void +searchPoemByPrimaryKey(Scanner):Poem +updateAPoem(Scanner): void +deleteAPoem(Scanner, String[]): void +getKeywords(String, String[]): ArrayList<String> +searchARecodAndDisplay(Scanner): void +searchPoemsByKeyword(Scanner , String): ArrayList<Poem> +getInt(Scanner, int, int, String): int +dataStatistics(): void +getSpaces(int, String): String +writeFile(Scanner): void +binarySearch(String[], String): void <<interface>> java.lang.Comparator +comparTo(Object, Object): int TitleComparator +compare(Poem , Poem ): int