summaryrefslogtreecommitdiff
path: root/sql/multi_range_read.h
diff options
context:
space:
mode:
authorSergey Petrunya <psergey@askmonty.org>2010-08-14 22:35:50 +0400
committerSergey Petrunya <psergey@askmonty.org>2010-08-14 22:35:50 +0400
commit937db4bff4575971996e401f0a5b969ce3475801 (patch)
tree6724ecb95b89037e7536a3c6a84a4fae7a23c226 /sql/multi_range_read.h
parentc964cb1b626d9ff1c995b42fde406342aa35547a (diff)
downloadmariadb-git-937db4bff4575971996e401f0a5b969ce3475801.tar.gz
- Remove out-of-date comments
- Make testcase stable
Diffstat (limited to 'sql/multi_range_read.h')
-rw-r--r--sql/multi_range_read.h13
1 files changed, 2 insertions, 11 deletions
diff --git a/sql/multi_range_read.h b/sql/multi_range_read.h
index 4941cac688d..0696dde21ca 100644
--- a/sql/multi_range_read.h
+++ b/sql/multi_range_read.h
@@ -47,12 +47,6 @@
When reading, there is current position pointing at start (for reverse
buffer, end) of the element that will be read next.
^^ why end for reverse? it's more logical to point at start
-
- One can peek at what's behind that element by using advance_ptr function.
-
- TODO: will the reverse buffer store {tuple; rowid} or {rowid; tuple} pairs?
- (why does it matter??? Read and write in the same order and then it
- shouldn't matter.)
*/
class SimpleBuffer
@@ -63,7 +57,7 @@ class SimpleBuffer
uchar *write_pos;
/*
- 1 <=> buffer grows/is filled/is read from start to end
+ 1 <=> buffer grows/is filled/is read from start to end
-1 <=> everthing is done from end to start instead.
*/
int direction;
@@ -141,10 +135,7 @@ public:
DBUG_ASSERT(0); /* Attempt to grow buffer in wrong direction */
}
- /* */
- void grow();
-
- friend class PeekIterator;
+ //friend class PeekIterator;
class PeekIterator
{
// if direction==1 : pointer to what to return next