|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||
| Uses of Array in <Unnamed> |
|---|
| Subclasses of Array in <Unnamed> | |
|---|---|
class |
OArray<D extends Comparable<D>>
An (O)rdered array is like an array but there additional methods to sort an array ( OArray.quicksort() and OArray.heapsort()). |
| Methods in <Unnamed> that return Array | |
|---|---|
Array<K> |
Dictionary.array()
|
Array<K> |
Map.array()
Converts this map into an array of all keys. |
Array<K> |
Set.array()
Creates a new array which stores all elements of this set. |
| Methods in <Unnamed> with parameters of type Array | |
|---|---|
void |
Searchtree.opt_searchtree(int n,
Array<K> keys,
Array<java.lang.Double> p,
Array<java.lang.Double> q)
Constructs an optimal search tree in the general case with n given keys where the propabilities to access each key are stored in p and the propabilities to access values between two keys are stored in q. |
void |
Searchtree.opt_searchtree(int n,
Array<K> keys,
Array<java.lang.Double> p,
Array<java.lang.Double> q)
Constructs an optimal search tree in the general case with n given keys where the propabilities to access each key are stored in p and the propabilities to access values between two keys are stored in q. |
void |
Searchtree.opt_searchtree(int n,
Array<K> keys,
Array<java.lang.Double> p,
Array<java.lang.Double> q)
Constructs an optimal search tree in the general case with n given keys where the propabilities to access each key are stored in p and the propabilities to access values between two keys are stored in q. |
|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||