📄 basetreemap.java
字号:
// You can redistribute this software and/or modify it under the terms of// the Ozone Library License version 1 published by ozone-db.org.//// This file is// Copyright (C) 2002-@year@ by Leo Mekenkamp. All rights reserved.// $Id: BaseTreeMap.java,v 1.9 2003/11/20 23:18:41 per_nyfelt Exp $package org.ozoneDB.collections;import java.util.Collection;import java.util.Iterator;import java.util.Set;/** * <p>You are encouraged NOT to use this interface, but rather just use {@link * OzoneTreeMap}, which does not contain the 'internal' methods, or even * {@link java.util.SortedMap}, which does not have any ozone dependency at all</p> * <p>This interface functions as a sort of base interface for ozone aware treemaps, * were those treemaps themselves can implement if the nodes in the tree are * ozone objects themselves or merely serializables.</p> * * @author <a href="mailto:ozoneATmekenkampD0Tcom">Leo Mekenkamp (mind the anti-sp@m)</a> (adaptation for ozone) */public interface BaseTreeMap extends OzoneTreeMap { public void _org_ozoneDB_resetEntries(); /*update*/ public void _org_ozoneDB_fabricateTree(int count); /*update*/ public int _org_ozoneDB_compare(Object o1, Object o2); public Node _org_ozoneDB_firstNode(); public Node _org_ozoneDB_getNode(Object key); public Node _org_ozoneDB_highestLessThan(Object key); public Node _org_ozoneDB_lowestGreaterThan(Object key, boolean first); public void _org_ozoneDB_putKeysLinear(Iterator keys, int count); /*update*/ public void _org_ozoneDB_removeNode(Node node); /*update*/ public Node _org_ozoneDB_successor(Node node); public int _org_ozoneDB_getModification(); public Set _org_ozoneDB_keySet(); /*update*/ public Set _org_ozoneDB_entrySet(); /*update*/ public Collection _org_ozoneDB_values(); /*update*/ public boolean _org_ozoneDB_alwaysUseInternalIterator(); /** * Node interface should be here and not in the Impl class; the BaseTreeMap * interface _is_ part of the implementation for an OzoneMap... */ public interface Node extends AbstractOzoneMap.Node { /** * Color status of a node. */ static final int RED = -1; static final int BLACK = 1; public void setLeft(Node left); public Node getLeft(); public void setRight(Node right); public Node getRight(); public void setParent(Node parent); public Node getParent(); public void setColor(int color); public int getColor(); public boolean isNil(); }}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -