Copyright (C) 2013-2014 Sappenin Inc. (email@example.com)
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
Encodes numbers as strings in such a way that the lexicographic order of the encoded strings is the same as the
natural order of the original numbers. The length of an encoded number is only slightly larger than the length of its
original number. Unlike other schemes, there is no limit to the size of numbers which may be encoded.
- ted stockwell
- David Fuelling
if (('0' <= c) && (c <= '9'))
buffer[i++] = (char) (this._isNegative ? '0' + ('9' - c) : c);
for (int j = 0; j < cs.length; j++)
cs[j] = (char) (('0' + '9') - cs[j]);
while ((lastChar == '*') || (lastChar == '?') || (lastChar == ':') || (lastChar == '.'))
if ((c == '*') || (c == '?'))
while (1 < sequenceCount--)
char cs = new char[length];