Uses of Interface org.zkoss.util.ListX (The ZKoss Common Library 5.0.9 API)

Overview

Package

Class

Use

Tree

Deprecated

Index

Help

PREV NEXT

FRAMES NO FRAMES

Uses of Interface
org.zkoss.util.ListX

Packages that use ListX
org.zkoss.util	Utilities for handling data structures.

Uses of ListX in org.zkoss.util

Classes in org.zkoss.util that implement ListX
`class`	`CheckableTreeArray` Deprecated. As of release 5.0.8, it is not used and no longer maintained. The checkable TreeArray. It extends TreeArray such that deriving classes could add validation when an element is added, removed or set. It is also useful to maintain the modification flag.
`class`	`TreeArray` Deprecated. As of release 5.0.8, it is not used and no longer maintained. Red-black tree based array implementation of List interface. Unlike LinkedList, the random access by index is as fast as log(n). Unlike ArrayList, the insertion is as fast as log(n). It is a great compromise between random and sequential access. In additions, it extends the features by also implementing ListX. The deriving class might override newEntry if it also extends RbEntry; override insert(RbEntry, RbEntry) for adding element; override delete(RbEntry) for removing element; clear() for clearing the whole list. Also, RbEntry.setElement might be overridden if the deriving class wants to do something when the set method is called. The iterator method is designed such that next() will proceed correctly even if getElement() throws an exception. The original algorithm is invented by Henri Chen.

Classes in org.zkoss.util that implement ListX

class CheckableTreeArray
Deprecated. As of release 5.0.8, it is not used and no longer maintained. The checkable TreeArray. It extends TreeArray such that deriving classes could add validation when an element is added, removed or set. It is also useful to maintain the modification flag.

class

TreeArray
Deprecated. As of release 5.0.8, it is not used and no longer maintained. Red-black tree based array implementation of List interface. Unlike LinkedList, the random access by index is as fast as log(n). Unlike ArrayList, the insertion is as fast as log(n). It is a great compromise between random and sequential access.
In additions, it extends the features by also implementing ListX.
The deriving class might override newEntry if it also extends RbEntry; override insert(RbEntry, RbEntry) for adding element; override delete(RbEntry) for removing element; clear() for clearing the whole list.
Also, RbEntry.setElement might be overridden if the deriving class wants to do something when the set method is called.
The iterator method is designed such that next() will proceed correctly even if getElement() throws an exception.

The original algorithm is invented by Henri Chen.