de.h2b.scala.lib.coll.adt.searching
SequentialSearchTable
Companion object SequentialSearchTable
class SequentialSearchTable[Key, Value] extends BasicSymbolTable[Key, Value]
This class implements an unordered symbol table of generic key/value pairs.
This implementation uses a singly-linked list and sequential search.
It relies on the equals
method to test whether two keys are equal.
It does not call either the compare
or hashCode
method.
The put and delete operations take linear time; the get and contains operations takes linear time in the worst case. The size, and is-empty operations take constant time. Construction takes constant time.
Adapted from the book Algorithms 4 by R. Sedgewick and K. Wayne.
- See also
Section 3.1 of Algorithms, 4th Edition
Algorithms, 4th edition by Robert Sedgewick and Kevin Wayne, Addison-Wesley Professional, 2011, ISBN 0-321-57351-X. http://algs4.cs.princeton.edu
- Alphabetic
- By Inheritance
- SequentialSearchTable
- BasicSymbolTable
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
apply(key: Key): Value
- returns
value paired with key
- Definition Classes
- SequentialSearchTable → BasicSymbolTable
- Exceptions thrown
NoSuchElementException
if key is not in table
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
contains(key: Key): Boolean
- Definition Classes
- BasicSymbolTable
-
def
delete(key: Key): Unit
Removes key/value pair from table.
Removes key/value pair from table.
- Definition Classes
- SequentialSearchTable → BasicSymbolTable
- Exceptions thrown
NoSuchElementException
if key is not in table
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
get(key: Key): Option[Value]
- Definition Classes
- BasicSymbolTable
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
getOrElse(key: Key, default: ⇒ Value): Value
- Definition Classes
- BasicSymbolTable
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
def
isEmpty: Boolean
- Definition Classes
- BasicSymbolTable
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
keys(): Iterable[Key]
- returns
all keys in the table
- Definition Classes
- SequentialSearchTable → BasicSymbolTable
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
def
size: Int
- Definition Classes
- SequentialSearchTable → BasicSymbolTable
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- SequentialSearchTable → BasicSymbolTable → AnyRef → Any
-
def
update(key: Key, value: Value): Unit
Inserts key/value pair into table.
Inserts key/value pair into table. Replaces value if key is already there.
- Definition Classes
- SequentialSearchTable → BasicSymbolTable
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )