AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
aud.BinarySearchTree.Entry Class Reference

Key-value pair as entry (= node data) in a search tree. More...

Public Member Functions

 Entry (Key key, Value value)
 construct node More...
 
Key getKey ()
 get key More...
 
Value getValue ()
 get value More...
 
void setValue (Value value)
 set value More...
 
String toString ()
 

Detailed Description

Key-value pair as entry (= node data) in a search tree.

See also
BinarySearchTree

Definition at line 145 of file BinarySearchTree.java.

Constructor & Destructor Documentation

◆ Entry()

aud.BinarySearchTree.Entry.Entry ( Key  key,
Value  value 
)

construct node

Definition at line 150 of file BinarySearchTree.java.

150 {
151 key_=key;
152 value_=value;
153 }

Member Function Documentation

◆ getKey()

Key aud.BinarySearchTree.Entry.getKey ( )

get key

Definition at line 155 of file BinarySearchTree.java.

155{ return key_; }

◆ getValue()

Value aud.BinarySearchTree.Entry.getValue ( )

get value

Definition at line 157 of file BinarySearchTree.java.

157{ return value_; }

◆ setValue()

void aud.BinarySearchTree.Entry.setValue ( Value  value)

set value

Definition at line 159 of file BinarySearchTree.java.

159{ value_=value; }

◆ toString()

String aud.BinarySearchTree.Entry.toString ( )

Definition at line 161 of file BinarySearchTree.java.

161 {
162 return key_!=null ?
163 (key_.toString()+
164 (value_!=null? "=>"+value_.toString():"")) : "head";
165 }

The documentation for this class was generated from the following file: