From 103ad2a43707109d7f6ad09ba2a3d0c668c249ce Mon Sep 17 00:00:00 2001
From: danielr <danielr@6c8d7289-2bf4-0310-a012-ef5d649a1542>
Date: Fri, 24 Oct 2008 13:58:26 +0000
Subject: [PATCH] some javadoc

git-svn-id: https://svn.berlios.de/svnroot/repos/yacy/trunk@5299 6c8d7289-2bf4-0310-a012-ef5d649a1542
---
 source/de/anomic/kelondro/kelondroBLOBHeap.java   |  2 +-
 .../de/anomic/kelondro/kelondroRowCollection.java | 15 +++++++++++----
 2 files changed, 12 insertions(+), 5 deletions(-)

diff --git a/source/de/anomic/kelondro/kelondroBLOBHeap.java b/source/de/anomic/kelondro/kelondroBLOBHeap.java
index 862b4ac35..5584bc4d3 100755
--- a/source/de/anomic/kelondro/kelondroBLOBHeap.java
+++ b/source/de/anomic/kelondro/kelondroBLOBHeap.java
@@ -189,7 +189,7 @@ public final class kelondroBLOBHeap implements kelondroBLOB {
     /**
      * test if a key is in the heap file. This does not need any IO, because it uses only the ram index
      * @param key
-     * @return true if the key exists, false othervise
+     * @return true if the key exists, false otherwise
      */
     public synchronized boolean has(final byte[] key) {
         assert index != null;
diff --git a/source/de/anomic/kelondro/kelondroRowCollection.java b/source/de/anomic/kelondro/kelondroRowCollection.java
index 4247f3a21..cba931030 100644
--- a/source/de/anomic/kelondro/kelondroRowCollection.java
+++ b/source/de/anomic/kelondro/kelondroRowCollection.java
@@ -388,8 +388,11 @@ public class kelondroRowCollection {
         this.lastTimeWrote = System.currentTimeMillis();
     }
     
+    /**
+     * removes the last entry from the collection
+     * @return
+     */
     public synchronized kelondroRow.Entry removeOne() {
-    	// removes the last entry from the collection
         if (chunkcount == 0) return null;
         final kelondroRow.Entry r = get(chunkcount - 1, true);
         if (chunkcount == sortBound) sortBound--;
@@ -610,10 +613,14 @@ public class kelondroRowCollection {
         }
     }
     
+    /**
+     * @param L is the first element in the sequence
+     * @param R is the right bound of the sequence, and outside of the sequence
+     * @param S is the bound of the sorted elements in the sequence
+     * @param swapspace
+     * @return
+     */
     final int partition(final int L, final int R, int S, final byte[] swapspace) {
-		// L is the first element in the sequence
-        // R is the right bound of the sequence, and outside of the sequence
-        // S is the bound of the sorted elements in the sequence
         assert (L < R - 1): "L = " + L + ", R = " + R + ", S = " + S;
         assert (R - L >= isortlimit): "L = " + L + ", R = " + R + ", S = " + S;