2013-02-05 23:35:15 +01:00
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<!-- NewPage -->
< html lang = "en" >
< head >
2013-05-14 01:29:12 +02:00
<!-- Generated by javadoc (version 1.7.0_21) on Tue May 14 01:28:32 CEST 2013 -->
2013-02-05 23:35:15 +01:00
< title > IntegerSet< / title >
2013-05-14 01:29:12 +02:00
< meta name = "date" content = "2013-05-14" >
2013-02-05 23:35:15 +01:00
< 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="IntegerSet";
}
//-->
< / 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/IntegerSet.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" >
2013-05-14 01:29:12 +02:00
< li > < a href = "../../../../com/comphenix/protocol/concurrency/BlockingHashMapTest.html" title = "class in com.comphenix.protocol.concurrency" > < span class = "strong" > Prev Class< / span > < / a > < / li >
2013-02-05 23:35:15 +01:00
< li > < a href = "../../../../com/comphenix/protocol/concurrency/SortedCopyOnWriteArray.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/IntegerSet.html" target = "_top" > Frames< / a > < / li >
< li > < a href = "IntegerSet.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: < / li >
< li > Nested | < / li >
< li > Field | < / li >
< li > < a href = "#constructor_summary" > Constr< / a > | < / li >
< li > < a href = "#method_summary" > Method< / a > < / li >
< / ul >
< ul class = "subNavList" >
< li > Detail: < / li >
< li > Field | < / li >
< li > < a href = "#constructor_detail" > Constr< / a > | < / 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 IntegerSet" class = "title" > Class IntegerSet< / h2 >
< / div >
< div class = "contentContainer" >
< ul class = "inheritance" >
< li > java.lang.Object< / li >
< li >
< ul class = "inheritance" >
< li > com.comphenix.protocol.concurrency.IntegerSet< / li >
< / ul >
< / li >
< / ul >
< div class = "description" >
< ul class = "blockList" >
< li class = "blockList" >
< hr >
< br >
< pre > public class < span class = "strong" > IntegerSet< / span >
extends java.lang.Object< / pre >
< div class = "block" > Represents a very quick integer set that uses a lookup table to store membership.
< p >
This class is intentionally missing a size method.< / 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" >
<!-- ======== 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" > < / 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/IntegerSet.html#IntegerSet(int)" > IntegerSet< / a > < / strong > (int maximumCount)< / code >
< div class = "block" > Initialize a lookup table with the given maximum number of elements.< / div >
< / 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" > < / 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 > void< / code > < / td >
< td class = "colLast" > < code > < strong > < a href = "../../../../com/comphenix/protocol/concurrency/IntegerSet.html#add(int)" > add< / a > < / strong > (int element)< / code >
< div class = "block" > Add the given element to the set, or do nothing if it already exists.< / div >
< / td >
< / tr >
< tr class = "rowColor" >
< td class = "colFirst" > < code > void< / code > < / td >
2013-05-14 01:29:12 +02:00
< td class = "colLast" > < code > < strong > < a href = "../../../../com/comphenix/protocol/concurrency/IntegerSet.html#addAll(java.util.Collection)" > addAll< / a > < / strong > (java.util.Collection< java.lang.Integer> packets)< / code >
< div class = "block" > Add the given collection of elements to the set.< / div >
< / td >
< / tr >
< tr class = "altColor" >
< td class = "colFirst" > < code > void< / code > < / td >
2013-02-05 23:35:15 +01:00
< td class = "colLast" > < code > < strong > < a href = "../../../../com/comphenix/protocol/concurrency/IntegerSet.html#clear()" > clear< / a > < / strong > ()< / code >
< div class = "block" > Remove every element from the set.< / div >
< / td >
< / tr >
2013-05-14 01:29:12 +02:00
< tr class = "rowColor" >
2013-02-05 23:35:15 +01:00
< td class = "colFirst" > < code > boolean< / code > < / td >
< td class = "colLast" > < code > < strong > < a href = "../../../../com/comphenix/protocol/concurrency/IntegerSet.html#contains(int)" > contains< / a > < / strong > (int element)< / code >
< div class = "block" > Determine whether or not the given element exists in the set.< / div >
< / td >
< / tr >
2013-05-14 01:29:12 +02:00
< tr class = "altColor" >
2013-02-05 23:35:15 +01:00
< td class = "colFirst" > < code > void< / code > < / td >
< td class = "colLast" > < code > < strong > < a href = "../../../../com/comphenix/protocol/concurrency/IntegerSet.html#remove(int)" > remove< / a > < / strong > (int element)< / code >
< div class = "block" > Remove the given element from the set, or do nothing if it's already removed.< / div >
< / td >
< / tr >
2013-05-14 01:29:12 +02:00
< tr class = "rowColor" >
2013-02-05 23:35:15 +01:00
< td class = "colFirst" > < code > java.util.Set< java.lang.Integer> < / code > < / td >
< td class = "colLast" > < code > < strong > < a href = "../../../../com/comphenix/protocol/concurrency/IntegerSet.html#toSet()" > toSet< / a > < / strong > ()< / code >
< div class = "block" > Convert the current IntegerSet to an equivalent HashSet.< / 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 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" >
<!-- ========= CONSTRUCTOR DETAIL ======== -->
< ul class = "blockList" >
< li class = "blockList" > < a name = "constructor_detail" >
<!-- -->
< / a >
< h3 > Constructor Detail< / h3 >
< a name = "IntegerSet(int)" >
<!-- -->
< / a >
< ul class = "blockListLast" >
< li class = "blockList" >
< h4 > IntegerSet< / h4 >
< pre > public IntegerSet(int maximumCount)< / pre >
< div class = "block" > Initialize a lookup table with the given maximum number of elements.
< p >
This creates a set for elements in the range [0, count).
< p >
Formally, the current set must be a subset of [0, 1, 2, ..., count - 1].< / div >
< dl > < dt > < span class = "strong" > Parameters:< / span > < / dt > < dd > < code > maximumCount< / code > - - maximum element value and count.< / dd > < / dl >
< / li >
< / ul >
< / li >
< / ul >
<!-- ============ METHOD DETAIL ========== -->
< ul class = "blockList" >
< li class = "blockList" > < a name = "method_detail" >
<!-- -->
< / a >
< h3 > Method Detail< / h3 >
< a name = "contains(int)" >
<!-- -->
< / a >
< ul class = "blockList" >
< li class = "blockList" >
< h4 > contains< / h4 >
< pre > public boolean contains(int element)< / pre >
< div class = "block" > Determine whether or not the given element exists in the set.< / div >
< dl > < dt > < span class = "strong" > Parameters:< / span > < / dt > < dd > < code > element< / code > - - the element to check. Must be in the range [0, count).< / dd >
< dt > < span class = "strong" > Returns:< / span > < / dt > < dd > TRUE if the given element exists, FALSE otherwise.< / dd > < / dl >
< / li >
< / ul >
< a name = "add(int)" >
<!-- -->
< / a >
< ul class = "blockList" >
< li class = "blockList" >
< h4 > add< / h4 >
< pre > public void add(int element)< / pre >
< div class = "block" > Add the given element to the set, or do nothing if it already exists.< / div >
< dl > < dt > < span class = "strong" > Parameters:< / span > < / dt > < dd > < code > element< / code > - - element to add.< / dd >
< dt > < span class = "strong" > Throws:< / span > < / dt >
< dd > < code > OutOfBoundsException< / code > - If the given element is not in the range [0, count).< / dd > < / dl >
< / li >
< / ul >
2013-05-14 01:29:12 +02:00
< a name = "addAll(java.util.Collection)" >
<!-- -->
< / a >
< ul class = "blockList" >
< li class = "blockList" >
< h4 > addAll< / h4 >
< pre > public void addAll(java.util.Collection< java.lang.Integer> packets)< / pre >
< div class = "block" > Add the given collection of elements to the set.< / div >
< dl > < dt > < span class = "strong" > Parameters:< / span > < / dt > < dd > < code > packets< / code > - - elements to add.< / dd > < / dl >
< / li >
< / ul >
2013-02-05 23:35:15 +01:00
< a name = "remove(int)" >
<!-- -->
< / a >
< ul class = "blockList" >
< li class = "blockList" >
< h4 > remove< / h4 >
< pre > public void remove(int element)< / pre >
< div class = "block" > Remove the given element from the set, or do nothing if it's already removed.< / div >
< dl > < dt > < span class = "strong" > Parameters:< / span > < / dt > < dd > < code > element< / code > - - element to remove.< / dd > < / dl >
< / li >
< / ul >
< a name = "clear()" >
<!-- -->
< / a >
< ul class = "blockList" >
< li class = "blockList" >
< h4 > clear< / h4 >
< pre > public void clear()< / pre >
< div class = "block" > Remove every element from the set.< / div >
< / li >
< / ul >
< a name = "toSet()" >
<!-- -->
< / a >
< ul class = "blockListLast" >
< li class = "blockList" >
< h4 > toSet< / h4 >
< pre > public java.util.Set< java.lang.Integer> toSet()< / pre >
< div class = "block" > Convert the current IntegerSet to an equivalent HashSet.< / div >
< dl > < dt > < span class = "strong" > Returns:< / span > < / dt > < dd > The resulting HashSet.< / 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/IntegerSet.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" >
2013-05-14 01:29:12 +02:00
< li > < a href = "../../../../com/comphenix/protocol/concurrency/BlockingHashMapTest.html" title = "class in com.comphenix.protocol.concurrency" > < span class = "strong" > Prev Class< / span > < / a > < / li >
2013-02-05 23:35:15 +01:00
< li > < a href = "../../../../com/comphenix/protocol/concurrency/SortedCopyOnWriteArray.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/IntegerSet.html" target = "_top" > Frames< / a > < / li >
< li > < a href = "IntegerSet.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: < / li >
< li > Nested | < / li >
< li > Field | < / li >
< li > < a href = "#constructor_summary" > Constr< / a > | < / li >
< li > < a href = "#method_summary" > Method< / a > < / li >
< / ul >
< ul class = "subNavList" >
< li > Detail: < / li >
< li > Field | < / li >
< li > < a href = "#constructor_detail" > Constr< / a > | < / li >
< li > < a href = "#method_detail" > Method< / a > < / li >
< / ul >
< / div >
< a name = "skip-navbar_bottom" >
<!-- -->
< / a > < / div >
<!-- ======== END OF BOTTOM NAVBAR ======= -->
< / body >
< / html >
