susumu.yata
null+****@clear*****
Wed Nov 26 18:41:47 JST 2014
susumu.yata 2014-11-26 18:41:47 +0900 (Wed, 26 Nov 2014) New Revision: 3e03e86f545d2f659e9dcdcb4d801876e28fe25b https://github.com/groonga/grnxx/commit/3e03e86f545d2f659e9dcdcb4d801876e28fe25b Message: Remove wrong comments. Modified files: lib/grnxx/impl/sorter.cpp Modified: lib/grnxx/impl/sorter.cpp (+0 -5) =================================================================== --- lib/grnxx/impl/sorter.cpp 2014-11-26 18:40:04 +0900 (21ab0fe) +++ lib/grnxx/impl/sorter.cpp 2014-11-26 18:41:47 +0900 (7fc1768) @@ -20,7 +20,6 @@ class Node { // Sort records in [begin, end). // - // On success, returns true. // On failure, throws an exception. virtual void sort(ArrayRef<Record> ref, size_t begin, size_t end) = 0; @@ -74,7 +73,6 @@ class ScoreNode : public Node { // // Switches to insertion sort when the sorting range becomes small enough. // - // On success, returns true. // On failure, throws an exception. void quick_sort(ArrayRef<Record> records, size_t begin, size_t end); @@ -82,7 +80,6 @@ class ScoreNode : public Node { // // Insertion sort should be used when there few records. // - // On success, returns true. // On failure, throws an exception. void insertion_sort(ArrayRef<Record> records); @@ -347,7 +344,6 @@ class ConvertNode : public Node { // // Switches to insertion sort when the sorting range becomes small enough. // - // On success, returns true. // On failure, throws an exception. void quick_sort(ArrayRef<Record> records, uint64_t *values, @@ -358,7 +354,6 @@ class ConvertNode : public Node { // // Insertion sort should be used when there few records. // - // On success, returns true. // On failure, throws an exception. void insertion_sort(ArrayRef<Record> records, uint64_t *values); -------------- next part -------------- HTML����������������������������...Download