Java Doc for IndexNode.java in » Search-Engine » Jofti » com » jofti » btree » Java Source Code / Java DocumentationJava Source Code and Java Documentation

Java Source Code / Java Documentation

1.	6.0 JDK Core
2.	6.0 JDK Modules
3.	6.0 JDK Modules com.sun
4.	6.0 JDK Modules com.sun.java
5.	6.0 JDK Modules sun
6.	6.0 JDK Platform
7.	Ajax
8.	Apache Harmony Java SE
9.	Aspect oriented
10.	Authentication Authorization
11.	Blogger System
12.	Build
13.	Byte Code
14.	Cache
15.	Chart
16.	Chat
17.	Code Analyzer
18.	Collaboration
19.	Content Management System
20.	Database Client
21.	Database DBMS
22.	Database JDBC Connection Pool
23.	Database ORM
24.	Development
25.	EJB Server geronimo
26.	EJB Server GlassFish
27.	EJB Server JBoss 4.2.1
28.	EJB Server resin 3.1.5
29.	ERP CRM Financial
30.	ESB
31.	Forum
32.	GIS
33.	Graphic Library
34.	Groupware
35.	HTML Parser
36.	IDE
37.	IDE Eclipse
38.	IDE Netbeans
39.	Installer
40.	Internationalization Localization
41.	Inversion of Control
42.	Issue Tracking
43.	J2EE
44.	JBoss
45.	JMS
46.	JMX
47.	Library
48.	Mail Clients
49.	Net
50.	Parser
51.	PDF
52.	Portal
53.	Profiler
54.	Project Management
55.	Report
56.	RSS RDF
57.	Rule Engine
58.	Science
59.	Scripting
60.	Search Engine
61.	Security
62.	Sevlet Container
63.	Source Control
64.	Swing Library
65.	Template Engine
66.	Test Coverage
67.	Testing
68.	UML
69.	Web Crawler
70.	Web Framework
71.	Web Mail
72.	Web Server
73.	Web Services
74.	Web Services apache cxf 2.0.1
75.	Web Services AXIS2
76.	Wiki Engine
77.	Workflow Engines
78.	XML
79.	XML UI

Java

Java Tutorial

Illustrator Tutorials

GIMP Tutorials

C# / C Sharp

C# / CSharp Tutorial

C# / CSharp Open Source

SQL Server / T-SQL Tutorial

Oracle PL / SQL

Oracle PL/SQL Tutorial

Flash / Flex / ActionScript

VBA / Excel / Access / Word

XML

XML Tutorial

Microsoft Office PowerPoint 2007 Tutorial

Microsoft Office Excel 2007 Tutorial

Microsoft Office Word 2007 Tutorial

Java Source Code / Java Documentation » Search Engine » Jofti » com.jofti.btree

Source Cross Reference

Class Diagram

Java Document (Java Doc)

java.lang .Object

com.jofti.btree .Node

com.jofti.btree .IndexNode

IndexNode

class IndexNode extends Node (Code)

The internal nodes in the BTree. These nodes do not contain any data - they are simply pointers to lower level index nodes or leaf nodes.

Each node follows the pattern of an indexnode which is an array of sorted pointers to a lower level index or leaf node. Each entry in the array contains the largest value in the subtree under the pointer. The Node itself in its right value contains the largest entry in its array.

author:
Steve Woodcock (steve@jofti.com)

version:
1.12

Field Summary
protected Object[]	keyList

Constructor Summary
protected	IndexNode()

Method Summary
public boolean	contains(Comparable value) This method checks to see if the value should be contained in the leaf nodes that are children of this indexNode (or children of its children).
public boolean	deleteEntry(NodeEntry entry)
public Node	getContainingNode(Comparable entry) Returns the node entry where the entry should be.
public Object[]	getEntries()
public int	getEntryNumber()
public NodeLink	getLinkNode()
IndexNodeEntry	getParentKey()
public Comparable	getRightValue()
protected int	indexedBinaryLocate(Object[] list1, Object obj)
protected Node	indexedBinaryRetrieve(Object[] list1, Object obj)
public Object[]	insertEntry(NodeEntry key)
public boolean	isDeleted()
public boolean	isEmpty()
public boolean	isUnderFull()
public void	setDeleted(boolean deleted)
public void	setEntries(Object[] entries)
public void	setKeyList(Object[] temp)
public void	setLinkNode(NodeLink node)
void	setParentKey(IndexNodeEntry parentKey) Setter for property parentNode.
public void	setRightValue(Comparable value)
public Node	splitNode(Object[] entries)
public String	toString()
public boolean	updateEntry(NodeEntry key)

Field Detail

keyList
protected Object[] keyList(Code)

Constructor Detail

IndexNode
protected IndexNode()(Code)
	Creates a new instance of IndexNode

Method Detail

contains
public boolean contains(Comparable value)(Code)
	This method checks to see if the value should be contained in the leaf nodes that are children of this indexNode (or children of its children). It does not check if the actual value is in the sub tree- rather it checks if its values are larger than this value. Parameters: value - true if the node has a larger value in it - false otherwise.

deleteEntry
public boolean deleteEntry(NodeEntry entry)(Code)

getContainingNode
public Node getContainingNode(Comparable entry)(Code)
	Returns the node entry where the entry should be. This is achieved by comparing the right values of the node entries in the node. Parameters: entry - the value to find. The node in this index node that the value should be in (or in a subtreee from that node).

getEntries
public Object[] getEntries()(Code)

getEntryNumber
public int getEntryNumber()(Code)

getLinkNode
public NodeLink getLinkNode()(Code)

getParentKey
IndexNodeEntry getParentKey()(Code)

getRightValue
public Comparable getRightValue()(Code)

indexedBinaryLocate
protected int indexedBinaryLocate(Object[] list1, Object obj)(Code)

indexedBinaryRetrieve
protected Node indexedBinaryRetrieve(Object[] list1, Object obj)(Code)

insertEntry
public Object[] insertEntry(NodeEntry key)(Code)

isDeleted
public boolean isDeleted()(Code)
	if the node has been deleted.

isEmpty
public boolean isEmpty()(Code)

isUnderFull
public boolean isUnderFull()(Code)

setDeleted
public void setDeleted(boolean deleted)(Code)
	Parameters: deleted - Sets the node to deleted if true.

setEntries
public void setEntries(Object[] entries)(Code)

setKeyList
public void setKeyList(Object[] temp)(Code)
	Sets the keylist for the node entries. Parameters: keys - - the new entry list for the node.

setLinkNode
public void setLinkNode(NodeLink node)(Code)

setParentKey
void setParentKey(IndexNodeEntry parentKey)(Code)
	Setter for property parentNode. Parameters: parentNode - New value of property parentNode.

setRightValue
public void setRightValue(Comparable value)(Code)

splitNode
public Node splitNode(Object[] entries)(Code)

toString
public String toString()(Code)

updateEntry
public boolean updateEntry(NodeEntry key)(Code)
	updates the key right value for the node entry passed in. Parameters: key - - the key for the entry to update. - true of the right value for the entire node was updated - false if the node entry was not the right most entry.

Fields inherited from com.jofti.btree.Node

protected int entryNumber(Code)(Java Doc)
final public ReadWriteLock nodeLock(Code)(Java Doc)

Methods inherited from com.jofti.btree.Node

public ReadWriteLock getNodeLock()(Code)(Java Doc)
public boolean isLeaf()(Code)(Java Doc)
protected Object[] split(Object[] tempEntries, int entryNumber)(Code)(Java Doc)

Methods inherited from java.lang.Object

native protected Object clone() throws CloneNotSupportedException(Code)(Java Doc)
public boolean equals(Object obj)(Code)(Java Doc)
protected void finalize() throws Throwable(Code)(Java Doc)
final native public Class getClass()(Code)(Java Doc)
native public int hashCode()(Code)(Java Doc)
final native public void notify()(Code)(Java Doc)
final native public void notifyAll()(Code)(Java Doc)
public String toString()(Code)(Java Doc)
final native public void wait(long timeout) throws InterruptedException(Code)(Java Doc)
final public void wait(long timeout, int nanos) throws InterruptedException(Code)(Java Doc)
final public void wait() throws InterruptedException(Code)(Java Doc)

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.