SteamWar/ProtocolLib
Archiviert
13
0
Fork 0
Code Issues Pull-Requests Releases Wiki Aktivität
Dieses Repository wurde am 2021-01-06 archiviert. Du kannst Dateien ansehen und es klonen, aber nicht pushen oder Issues/Pull-Requests öffnen.
cc88232c8e
ProtocolLib/Javadoc/com/comphenix/protocol/concurrency/AbstractIntervalTree.html
Kristian S. Stangeland cc88232c8e Updated documentation for 1.7.1
2012-12-04 00:58:16 +01:00

655 Zeilen
38 KiB
HTML
Originalformat Blame Verlauf

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<!-- NewPage -->
<html lang="en">
<head>
<!-- Generated by javadoc (version 1.7.0_07) on Tue Dec 04 00:55:53 CET 2012 -->
<title>AbstractIntervalTree</title>
<meta name="date" content="2012-12-04">
<link rel="stylesheet" type="text/css" href="../../../../stylesheet.css" title="Style">
</head>
<body>
<script type="text/javascript"><!--
if (location.href.indexOf('is-external=true') == -1) {
parent.document.title="AbstractIntervalTree";
}
//-->
</script>
<noscript>
<div>JavaScript is disabled on your browser.</div>
</noscript>
<!-- ========= START OF TOP NAVBAR ======= -->
<div class="topNav"><a name="navbar_top">
<!-- -->
</a><a href="#skip-navbar_top" title="Skip navigation links"></a><a name="navbar_top_firstrow">
<!-- -->
</a>
<ul class="navList" title="Navigation">
<li><a href="../../../../overview-summary.html">Overview</a></li>
<li><a href="package-summary.html">Package</a></li>
<li class="navBarCell1Rev">Class</li>
<li><a href="class-use/AbstractIntervalTree.html">Use</a></li>
<li><a href="package-tree.html">Tree</a></li>
<li><a href="../../../../deprecated-list.html">Deprecated</a></li>
<li><a href="../../../../index-files/index-1.html">Index</a></li>
<li><a href="../../../../help-doc.html">Help</a></li>
</ul>
</div>
<div class="subNav">
<ul class="navList">
<li><a href="../../../../com/comphenix/protocol/concurrency/AbstractConcurrentListenerMultimap.html" title="class in com.comphenix.protocol.concurrency"><span class="strong">Prev Class</span></a></li>
<li><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.EndPoint.html" title="class in com.comphenix.protocol.concurrency"><span class="strong">Next Class</span></a></li>
</ul>
<ul class="navList">
<li><a href="../../../../index.html?com/comphenix/protocol/concurrency/AbstractIntervalTree.html" target="_top">Frames</a></li>
<li><a href="AbstractIntervalTree.html" target="_top">No Frames</a></li>
</ul>
<ul class="navList" id="allclasses_navbar_top">
<li><a href="../../../../allclasses-noframe.html">All Classes</a></li>
</ul>
<div>
<script type="text/javascript"><!--
allClassesLink = document.getElementById("allclasses_navbar_top");
if(window==top) {
allClassesLink.style.display = "block";
}
else {
allClassesLink.style.display = "none";
}
//-->
</script>
</div>
<div>
<ul class="subNavList">
<li>Summary:&nbsp;</li>
<li><a href="#nested_class_summary">Nested</a>&nbsp;|&nbsp;</li>
<li><a href="#field_summary">Field</a>&nbsp;|&nbsp;</li>
<li><a href="#constructor_summary">Constr</a>&nbsp;|&nbsp;</li>
<li><a href="#method_summary">Method</a></li>
</ul>
<ul class="subNavList">
<li>Detail:&nbsp;</li>
<li><a href="#field_detail">Field</a>&nbsp;|&nbsp;</li>
<li><a href="#constructor_detail">Constr</a>&nbsp;|&nbsp;</li>
<li><a href="#method_detail">Method</a></li>
</ul>
</div>
<a name="skip-navbar_top">
<!-- -->
</a></div>
<!-- ========= END OF TOP NAVBAR ========= -->
<!-- ======== START OF CLASS DATA ======== -->
<div class="header">
<div class="subTitle">com.comphenix.protocol.concurrency</div>
<h2 title="Class AbstractIntervalTree" class="title">Class AbstractIntervalTree&lt;TKey extends java.lang.Comparable&lt;TKey&gt;,TValue&gt;</h2>
</div>
<div class="contentContainer">
<ul class="inheritance">
<li>java.lang.Object</li>
<li>
<ul class="inheritance">
<li>com.comphenix.protocol.concurrency.AbstractIntervalTree&lt;TKey,TValue&gt;</li>
</ul>
</li>
</ul>
<div class="description">
<ul class="blockList">
<li class="blockList">
<dl><dt><span class="strong">Type Parameters:</span></dt><dd><code>TKey</code> - - type of the key. Must implement Comparable.</dd><dd><code>TValue</code> - - type of the value to associate.</dd></dl>
<hr>
<br>
<pre>public abstract class <span class="strong">AbstractIntervalTree&lt;TKey extends java.lang.Comparable&lt;TKey&gt;,TValue&gt;</span>
extends java.lang.Object</pre>
<div class="block">Represents a generic store of intervals and associated values. No two intervals
can overlap in this representation.
<p>
Note that this implementation is not thread safe.</div>
<dl><dt><span class="strong">Author:</span></dt>
<dd>Kristian</dd></dl>
</li>
</ul>
</div>
<div class="summary">
<ul class="blockList">
<li class="blockList">
<!-- ======== NESTED CLASS SUMMARY ======== -->
<ul class="blockList">
<li class="blockList"><a name="nested_class_summary">
<!-- -->
</a>
<h3>Nested Class Summary</h3>
<table class="overviewSummary" border="0" cellpadding="3" cellspacing="0" summary="Nested Class Summary table, listing nested classes, and an explanation">
<caption><span>Nested Classes</span><span class="tabEnd">&nbsp;</span></caption>
<tr>
<th class="colFirst" scope="col">Modifier and Type</th>
<th class="colLast" scope="col">Class and Description</th>
</tr>
<tr class="altColor">
<td class="colFirst"><code>protected class&nbsp;</code></td>
<td class="colLast"><code><strong><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.EndPoint.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.EndPoint</a></strong></code>
<div class="block">Represents a single end point (open, close or both) of a range.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>class&nbsp;</code></td>
<td class="colLast"><code><strong><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.Entry.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.Entry</a></strong></code>
<div class="block">Represents a range and a value in this interval tree.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>protected static class&nbsp;</code></td>
<td class="colLast"><code><strong><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.State.html" title="enum in com.comphenix.protocol.concurrency">AbstractIntervalTree.State</a></strong></code>&nbsp;</td>
</tr>
</table>
</li>
</ul>
<!-- =========== FIELD SUMMARY =========== -->
<ul class="blockList">
<li class="blockList"><a name="field_summary">
<!-- -->
</a>
<h3>Field Summary</h3>
<table class="overviewSummary" border="0" cellpadding="3" cellspacing="0" summary="Field Summary table, listing fields, and an explanation">
<caption><span>Fields</span><span class="tabEnd">&nbsp;</span></caption>
<tr>
<th class="colFirst" scope="col">Modifier and Type</th>
<th class="colLast" scope="col">Field and Description</th>
</tr>
<tr class="altColor">
<td class="colFirst"><code>protected java.util.NavigableMap&lt;<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>,<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.EndPoint.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.EndPoint</a>&gt;</code></td>
<td class="colLast"><code><strong><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html#bounds">bounds</a></strong></code>&nbsp;</td>
</tr>
</table>
</li>
</ul>
<!-- ======== CONSTRUCTOR SUMMARY ======== -->
<ul class="blockList">
<li class="blockList"><a name="constructor_summary">
<!-- -->
</a>
<h3>Constructor Summary</h3>
<table class="overviewSummary" border="0" cellpadding="3" cellspacing="0" summary="Constructor Summary table, listing constructors, and an explanation">
<caption><span>Constructors</span><span class="tabEnd">&nbsp;</span></caption>
<tr>
<th class="colOne" scope="col">Constructor and Description</th>
</tr>
<tr class="altColor">
<td class="colOne"><code><strong><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html#AbstractIntervalTree()">AbstractIntervalTree</a></strong>()</code>&nbsp;</td>
</tr>
</table>
</li>
</ul>
<!-- ========== METHOD SUMMARY =========== -->
<ul class="blockList">
<li class="blockList"><a name="method_summary">
<!-- -->
</a>
<h3>Method Summary</h3>
<table class="overviewSummary" border="0" cellpadding="3" cellspacing="0" summary="Method Summary table, listing methods, and an explanation">
<caption><span>Methods</span><span class="tabEnd">&nbsp;</span></caption>
<tr>
<th class="colFirst" scope="col">Modifier and Type</th>
<th class="colLast" scope="col">Method and Description</th>
</tr>
<tr class="altColor">
<td class="colFirst"><code>protected <a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.EndPoint.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.EndPoint</a></code></td>
<td class="colLast"><code><strong><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html#addEndPoint(TKey, TValue, com.comphenix.protocol.concurrency.AbstractIntervalTree.State)">addEndPoint</a></strong>(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;key,
<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TValue</a>&nbsp;value,
<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.State.html" title="enum in com.comphenix.protocol.concurrency">AbstractIntervalTree.State</a>&nbsp;state)</code>&nbsp;</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>void</code></td>
<td class="colLast"><code><strong><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html#clear()">clear</a></strong>()</code>
<div class="block">Remove every interval.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>boolean</code></td>
<td class="colLast"><code><strong><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html#containsKey(TKey)">containsKey</a></strong>(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;key)</code>
<div class="block">Determines if the given key is within an interval.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>protected abstract <a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a></code></td>
<td class="colLast"><code><strong><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html#decrementKey(TKey)">decrementKey</a></strong>(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;key)</code>
<div class="block">Decrement the given key by one unit.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>java.util.Set&lt;<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.Entry.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.Entry</a>&gt;</code></td>
<td class="colLast"><code><strong><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html#entrySet()">entrySet</a></strong>()</code>
<div class="block">Enumerates over every range in this interval tree.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TValue</a></code></td>
<td class="colLast"><code><strong><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html#get(TKey)">get</a></strong>(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;key)</code>
<div class="block">Retrieves the value of the range that matches the given key, or NULL if nothing was found.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>protected <a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.EndPoint.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.EndPoint</a></code></td>
<td class="colLast"><code><strong><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html#getEndPoint(TKey)">getEndPoint</a></strong>(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;key)</code>
<div class="block">Get the left-most end-point associated with this key.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>protected <a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.Entry.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.Entry</a></code></td>
<td class="colLast"><code><strong><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html#getEntry(com.comphenix.protocol.concurrency.AbstractIntervalTree.EndPoint, com.comphenix.protocol.concurrency.AbstractIntervalTree.EndPoint)">getEntry</a></strong>(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.EndPoint.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.EndPoint</a>&nbsp;left,
<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.EndPoint.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.EndPoint</a>&nbsp;right)</code>
<div class="block">Retrieve the entry from a given set of end points.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>protected <a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.EndPoint.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.EndPoint</a></code></td>
<td class="colLast"><code><strong><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html#getNextEndPoint(TKey, boolean)">getNextEndPoint</a></strong>(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;point,
boolean&nbsp;inclusive)</code>
<div class="block">Get the next end point of a given key.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>protected <a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.EndPoint.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.EndPoint</a></code></td>
<td class="colLast"><code><strong><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html#getPreviousEndPoint(TKey, boolean)">getPreviousEndPoint</a></strong>(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;point,
boolean&nbsp;inclusive)</code>
<div class="block">Get the previous end point of a given key.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>protected abstract <a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a></code></td>
<td class="colLast"><code><strong><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html#incrementKey(TKey)">incrementKey</a></strong>(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;key)</code>
<div class="block">Increment the given key by one unit.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>protected void</code></td>
<td class="colLast"><code><strong><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html#onEntryAdded(com.comphenix.protocol.concurrency.AbstractIntervalTree.Entry)">onEntryAdded</a></strong>(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.Entry.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.Entry</a>&nbsp;added)</code>
<div class="block">Invoked when an entry is added.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>protected void</code></td>
<td class="colLast"><code><strong><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html#onEntryRemoved(com.comphenix.protocol.concurrency.AbstractIntervalTree.Entry)">onEntryRemoved</a></strong>(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.Entry.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.Entry</a>&nbsp;removed)</code>
<div class="block">Invoked when an entry is removed.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>void</code></td>
<td class="colLast"><code><strong><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html#put(TKey, TKey, TValue)">put</a></strong>(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;lowerBound,
<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;upperBound,
<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TValue</a>&nbsp;value)</code>
<div class="block">Associates a given interval of keys with a certain value.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>void</code></td>
<td class="colLast"><code><strong><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html#putAll(com.comphenix.protocol.concurrency.AbstractIntervalTree)">putAll</a></strong>(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree</a>&lt;<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>,<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TValue</a>&gt;&nbsp;other)</code>
<div class="block">Inserts every range from the given tree into the current tree.</div>
</td>
</tr>
<tr class="rowColor">
<td class="colFirst"><code>java.util.Set&lt;<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.Entry.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.Entry</a>&gt;</code></td>
<td class="colLast"><code><strong><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html#remove(TKey, TKey)">remove</a></strong>(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;lowerBound,
<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;upperBound)</code>
<div class="block">Removes every interval that intersects with the given range.</div>
</td>
</tr>
<tr class="altColor">
<td class="colFirst"><code>java.util.Set&lt;<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.Entry.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.Entry</a>&gt;</code></td>
<td class="colLast"><code><strong><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html#remove(TKey, TKey, boolean)">remove</a></strong>(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;lowerBound,
<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;upperBound,
boolean&nbsp;preserveDifference)</code>
<div class="block">Removes every interval that intersects with the given range.</div>
</td>
</tr>
</table>
<ul class="blockList">
<li class="blockList"><a name="methods_inherited_from_class_java.lang.Object">
<!-- -->
</a>
<h3>Methods inherited from class&nbsp;java.lang.Object</h3>
<code>clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait</code></li>
</ul>
</li>
</ul>
</li>
</ul>
</div>
<div class="details">
<ul class="blockList">
<li class="blockList">
<!-- ============ FIELD DETAIL =========== -->
<ul class="blockList">
<li class="blockList"><a name="field_detail">
<!-- -->
</a>
<h3>Field Detail</h3>
<a name="bounds">
<!-- -->
</a>
<ul class="blockListLast">
<li class="blockList">
<h4>bounds</h4>
<pre>protected&nbsp;java.util.NavigableMap&lt;<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a> extends java.lang.Comparable&lt;<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&gt;,<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.EndPoint.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.EndPoint</a>&gt; bounds</pre>
</li>
</ul>
</li>
</ul>
<!-- ========= CONSTRUCTOR DETAIL ======== -->
<ul class="blockList">
<li class="blockList"><a name="constructor_detail">
<!-- -->
</a>
<h3>Constructor Detail</h3>
<a name="AbstractIntervalTree()">
<!-- -->
</a>
<ul class="blockListLast">
<li class="blockList">
<h4>AbstractIntervalTree</h4>
<pre>public&nbsp;AbstractIntervalTree()</pre>
</li>
</ul>
</li>
</ul>
<!-- ============ METHOD DETAIL ========== -->
<ul class="blockList">
<li class="blockList"><a name="method_detail">
<!-- -->
</a>
<h3>Method Detail</h3>
<a name="remove(java.lang.Comparable,java.lang.Comparable)">
<!-- -->
</a><a name="remove(TKey, TKey)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>remove</h4>
<pre>public&nbsp;java.util.Set&lt;<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.Entry.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.Entry</a>&gt;&nbsp;remove(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;lowerBound,
<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;upperBound)</pre>
<div class="block">Removes every interval that intersects with the given range.</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>lowerBound</code> - - lowest value to remove.</dd><dd><code>upperBound</code> - - highest value to remove.</dd></dl>
</li>
</ul>
<a name="remove(java.lang.Comparable,java.lang.Comparable,boolean)">
<!-- -->
</a><a name="remove(TKey, TKey, boolean)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>remove</h4>
<pre>public&nbsp;java.util.Set&lt;<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.Entry.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.Entry</a>&gt;&nbsp;remove(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;lowerBound,
<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;upperBound,
boolean&nbsp;preserveDifference)</pre>
<div class="block">Removes every interval that intersects with the given range.</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>lowerBound</code> - - lowest value to remove.</dd><dd><code>upperBound</code> - - highest value to remove.</dd><dd><code>preserveDifference</code> - - whether or not to preserve the intervals that are partially outside.</dd></dl>
</li>
</ul>
<a name="getEntry(com.comphenix.protocol.concurrency.AbstractIntervalTree.EndPoint, com.comphenix.protocol.concurrency.AbstractIntervalTree.EndPoint)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>getEntry</h4>
<pre>protected&nbsp;<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.Entry.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.Entry</a>&nbsp;getEntry(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.EndPoint.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.EndPoint</a>&nbsp;left,
<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.EndPoint.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.EndPoint</a>&nbsp;right)</pre>
<div class="block">Retrieve the entry from a given set of end points.</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>left</code> - - leftmost end point.</dd><dd><code>right</code> - - rightmost end point.</dd>
<dt><span class="strong">Returns:</span></dt><dd>The associated entry.</dd></dl>
</li>
</ul>
<a name="addEndPoint(java.lang.Comparable,java.lang.Object,com.comphenix.protocol.concurrency.AbstractIntervalTree.State)">
<!-- -->
</a><a name="addEndPoint(TKey, TValue, com.comphenix.protocol.concurrency.AbstractIntervalTree.State)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>addEndPoint</h4>
<pre>protected&nbsp;<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.EndPoint.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.EndPoint</a>&nbsp;addEndPoint(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;key,
<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TValue</a>&nbsp;value,
<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.State.html" title="enum in com.comphenix.protocol.concurrency">AbstractIntervalTree.State</a>&nbsp;state)</pre>
</li>
</ul>
<a name="put(java.lang.Comparable,java.lang.Comparable,java.lang.Object)">
<!-- -->
</a><a name="put(TKey, TKey, TValue)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>put</h4>
<pre>public&nbsp;void&nbsp;put(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;lowerBound,
<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;upperBound,
<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TValue</a>&nbsp;value)</pre>
<div class="block">Associates a given interval of keys with a certain value. Any previous
association will be overwritten in the given interval.
<p>
Overlapping intervals are not permitted. A key can only be associated with a single value.</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>lowerBound</code> - - the minimum key (inclusive).</dd><dd><code>upperBound</code> - - the maximum key (inclusive).</dd><dd><code>value</code> - - the value, or NULL to reset this range.</dd></dl>
</li>
</ul>
<a name="containsKey(java.lang.Comparable)">
<!-- -->
</a><a name="containsKey(TKey)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>containsKey</h4>
<pre>public&nbsp;boolean&nbsp;containsKey(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;key)</pre>
<div class="block">Determines if the given key is within an interval.</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>key</code> - - key to check.</dd>
<dt><span class="strong">Returns:</span></dt><dd>TRUE if the given key is within an interval in this tree, FALSE otherwise.</dd></dl>
</li>
</ul>
<a name="entrySet()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>entrySet</h4>
<pre>public&nbsp;java.util.Set&lt;<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.Entry.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.Entry</a>&gt;&nbsp;entrySet()</pre>
<div class="block">Enumerates over every range in this interval tree.</div>
<dl><dt><span class="strong">Returns:</span></dt><dd>Number of ranges.</dd></dl>
</li>
</ul>
<a name="clear()">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>clear</h4>
<pre>public&nbsp;void&nbsp;clear()</pre>
<div class="block">Remove every interval.</div>
</li>
</ul>
<a name="putAll(com.comphenix.protocol.concurrency.AbstractIntervalTree)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>putAll</h4>
<pre>public&nbsp;void&nbsp;putAll(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree</a>&lt;<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>,<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TValue</a>&gt;&nbsp;other)</pre>
<div class="block">Inserts every range from the given tree into the current tree.</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>other</code> - - the other tree to read from.</dd></dl>
</li>
</ul>
<a name="get(java.lang.Comparable)">
<!-- -->
</a><a name="get(TKey)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>get</h4>
<pre>public&nbsp;<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TValue</a>&nbsp;get(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;key)</pre>
<div class="block">Retrieves the value of the range that matches the given key, or NULL if nothing was found.</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>key</code> - - the level to read for.</dd>
<dt><span class="strong">Returns:</span></dt><dd>The correct amount of experience, or NULL if nothing was recorded.</dd></dl>
</li>
</ul>
<a name="getEndPoint(java.lang.Comparable)">
<!-- -->
</a><a name="getEndPoint(TKey)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>getEndPoint</h4>
<pre>protected&nbsp;<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.EndPoint.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.EndPoint</a>&nbsp;getEndPoint(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;key)</pre>
<div class="block">Get the left-most end-point associated with this key.</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>key</code> - - key to search for.</dd>
<dt><span class="strong">Returns:</span></dt><dd>The end point found, or NULL.</dd></dl>
</li>
</ul>
<a name="getPreviousEndPoint(java.lang.Comparable,boolean)">
<!-- -->
</a><a name="getPreviousEndPoint(TKey, boolean)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>getPreviousEndPoint</h4>
<pre>protected&nbsp;<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.EndPoint.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.EndPoint</a>&nbsp;getPreviousEndPoint(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;point,
boolean&nbsp;inclusive)</pre>
<div class="block">Get the previous end point of a given key.</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>point</code> - - the point to search with.</dd><dd><code>inclusive</code> - - whether or not to include the current point in the search.</dd>
<dt><span class="strong">Returns:</span></dt><dd>The previous end point of a given given key, or NULL if not found.</dd></dl>
</li>
</ul>
<a name="getNextEndPoint(java.lang.Comparable,boolean)">
<!-- -->
</a><a name="getNextEndPoint(TKey, boolean)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>getNextEndPoint</h4>
<pre>protected&nbsp;<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.EndPoint.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.EndPoint</a>&nbsp;getNextEndPoint(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;point,
boolean&nbsp;inclusive)</pre>
<div class="block">Get the next end point of a given key.</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>point</code> - - the point to search with.</dd><dd><code>inclusive</code> - - whether or not to include the current point in the search.</dd>
<dt><span class="strong">Returns:</span></dt><dd>The next end point of a given given key, or NULL if not found.</dd></dl>
</li>
</ul>
<a name="onEntryAdded(com.comphenix.protocol.concurrency.AbstractIntervalTree.Entry)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>onEntryAdded</h4>
<pre>protected&nbsp;void&nbsp;onEntryAdded(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.Entry.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.Entry</a>&nbsp;added)</pre>
<div class="block">Invoked when an entry is added.</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>added</code> - - the entry that was added.</dd></dl>
</li>
</ul>
<a name="onEntryRemoved(com.comphenix.protocol.concurrency.AbstractIntervalTree.Entry)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>onEntryRemoved</h4>
<pre>protected&nbsp;void&nbsp;onEntryRemoved(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.Entry.html" title="class in com.comphenix.protocol.concurrency">AbstractIntervalTree.Entry</a>&nbsp;removed)</pre>
<div class="block">Invoked when an entry is removed.</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>removed</code> - - the removed entry.</dd></dl>
</li>
</ul>
<a name="decrementKey(java.lang.Comparable)">
<!-- -->
</a><a name="decrementKey(TKey)">
<!-- -->
</a>
<ul class="blockList">
<li class="blockList">
<h4>decrementKey</h4>
<pre>protected abstract&nbsp;<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;decrementKey(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;key)</pre>
<div class="block">Decrement the given key by one unit.</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>key</code> - - the key that should be decremented.</dd>
<dt><span class="strong">Returns:</span></dt><dd>The new decremented key.</dd></dl>
</li>
</ul>
<a name="incrementKey(java.lang.Comparable)">
<!-- -->
</a><a name="incrementKey(TKey)">
<!-- -->
</a>
<ul class="blockListLast">
<li class="blockList">
<h4>incrementKey</h4>
<pre>protected abstract&nbsp;<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;incrementKey(<a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.html" title="type parameter in AbstractIntervalTree">TKey</a>&nbsp;key)</pre>
<div class="block">Increment the given key by one unit.</div>
<dl><dt><span class="strong">Parameters:</span></dt><dd><code>key</code> - - the key that should be incremented.</dd>
<dt><span class="strong">Returns:</span></dt><dd>The new incremented key.</dd></dl>
</li>
</ul>
</li>
</ul>
</li>
</ul>
</div>
</div>
<!-- ========= END OF CLASS DATA ========= -->
<!-- ======= START OF BOTTOM NAVBAR ====== -->
<div class="bottomNav"><a name="navbar_bottom">
<!-- -->
</a><a href="#skip-navbar_bottom" title="Skip navigation links"></a><a name="navbar_bottom_firstrow">
<!-- -->
</a>
<ul class="navList" title="Navigation">
<li><a href="../../../../overview-summary.html">Overview</a></li>
<li><a href="package-summary.html">Package</a></li>
<li class="navBarCell1Rev">Class</li>
<li><a href="class-use/AbstractIntervalTree.html">Use</a></li>
<li><a href="package-tree.html">Tree</a></li>
<li><a href="../../../../deprecated-list.html">Deprecated</a></li>
<li><a href="../../../../index-files/index-1.html">Index</a></li>
<li><a href="../../../../help-doc.html">Help</a></li>
</ul>
</div>
<div class="subNav">
<ul class="navList">
<li><a href="../../../../com/comphenix/protocol/concurrency/AbstractConcurrentListenerMultimap.html" title="class in com.comphenix.protocol.concurrency"><span class="strong">Prev Class</span></a></li>
<li><a href="../../../../com/comphenix/protocol/concurrency/AbstractIntervalTree.EndPoint.html" title="class in com.comphenix.protocol.concurrency"><span class="strong">Next Class</span></a></li>
</ul>
<ul class="navList">
<li><a href="../../../../index.html?com/comphenix/protocol/concurrency/AbstractIntervalTree.html" target="_top">Frames</a></li>
<li><a href="AbstractIntervalTree.html" target="_top">No Frames</a></li>
</ul>
<ul class="navList" id="allclasses_navbar_bottom">
<li><a href="../../../../allclasses-noframe.html">All Classes</a></li>
</ul>
<div>
<script type="text/javascript"><!--
allClassesLink = document.getElementById("allclasses_navbar_bottom");
if(window==top) {
allClassesLink.style.display = "block";
}
else {
allClassesLink.style.display = "none";
}
//-->
</script>
</div>
<div>
<ul class="subNavList">
<li>Summary:&nbsp;</li>
<li><a href="#nested_class_summary">Nested</a>&nbsp;|&nbsp;</li>
<li><a href="#field_summary">Field</a>&nbsp;|&nbsp;</li>
<li><a href="#constructor_summary">Constr</a>&nbsp;|&nbsp;</li>
<li><a href="#method_summary">Method</a></li>
</ul>
<ul class="subNavList">
<li>Detail:&nbsp;</li>
<li><a href="#field_detail">Field</a>&nbsp;|&nbsp;</li>
<li><a href="#constructor_detail">Constr</a>&nbsp;|&nbsp;</li>
<li><a href="#method_detail">Method</a></li>
</ul>
</div>
<a name="skip-navbar_bottom">
<!-- -->
</a></div>
<!-- ======== END OF BOTTOM NAVBAR ======= -->
</body>
</html>
In neuem Issue referenzieren Git Blame ansehen Permalink kopieren