From 7062b9327cea485e510f8ff8efe25e19bc75890d Mon Sep 17 00:00:00 2001
From: "Kristian S. Stangeland" <kr_stang@hotmail.com>
Date: Tue, 4 Dec 2012 00:21:14 +0100
Subject: [PATCH] Fix documentation.

---
 .../comphenix/protocol/concurrency/AbstractIntervalTree.java    | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/ProtocolLib/src/main/java/com/comphenix/protocol/concurrency/AbstractIntervalTree.java b/ProtocolLib/src/main/java/com/comphenix/protocol/concurrency/AbstractIntervalTree.java
index 571083d5..9b241e90 100644
--- a/ProtocolLib/src/main/java/com/comphenix/protocol/concurrency/AbstractIntervalTree.java
+++ b/ProtocolLib/src/main/java/com/comphenix/protocol/concurrency/AbstractIntervalTree.java
@@ -132,7 +132,7 @@ public abstract class AbstractIntervalTree<TKey extends Comparable<TKey>, TValue
 	 * Removes every interval that intersects with the given range.
 	 * @param lowerBound - lowest value to remove.
 	 * @param upperBound - highest value to remove.
-	 * @param preserveOutside - whether or not to preserve the intervals that are partially outside.
+	 * @param preserveDifference - whether or not to preserve the intervals that are partially outside.
 	 */
 	public Set<Entry> remove(TKey lowerBound, TKey upperBound, boolean preserveDifference) {
 		checkBounds(lowerBound, upperBound);