diff options
| author | unknown <cmiller@zippy.cornsilk.net> | 2007-10-11 13:29:09 -0400 |
|---|---|---|
| committer | unknown <cmiller@zippy.cornsilk.net> | 2007-10-11 13:29:09 -0400 |
| commit | d43c15b0dee8f67a63de601f82d9358c38f68b49 (patch) | |
| tree | dc8fcee29ee23089c456415062c32abb0468c823 /sql/gen_lex_hash.cc | |
| parent | 39062b7e4ee782ca7853808a1c006846ae027263 (diff) | |
| download | mariadb-git-d43c15b0dee8f67a63de601f82d9358c38f68b49.tar.gz | |
Doxygenization of comments.
Diffstat (limited to 'sql/gen_lex_hash.cc')
| -rw-r--r-- | sql/gen_lex_hash.cc | 17 |
1 files changed, 11 insertions, 6 deletions
diff --git a/sql/gen_lex_hash.cc b/sql/gen_lex_hash.cc index 36b7f30dc64..c9c1813a429 100644 --- a/sql/gen_lex_hash.cc +++ b/sql/gen_lex_hash.cc @@ -13,8 +13,11 @@ along with this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ -/* +/** + @file + @details +@verbatim The idea of presented algorithm see in "The Art of Computer Programming" by Donald E. Knuth Volume 3 "Sorting and searching" @@ -63,12 +66,14 @@ for optimization, link is the 16-bit index in 'symbols' or 'sql_functions' or search-array.. So, we can read full search-structure as 32-bit word +@endverbatim + +@todo + use instead to_upper_lex, special array + (substitute chars) without skip codes.. +@todo + try use reverse order of comparing.. -TODO: -1. use instead to_upper_lex, special array - (substitute chars) without skip codes.. -2. try use reverse order of comparing.. - */ #define NO_YACC_SYMBOLS |