2 /* -*- Mode: java; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
\r
4 * The contents of this file are subject to the Netscape Public
\r
5 * License Version 1.1 (the "License"); you may not use this file
\r
6 * except in compliance with the License. You may obtain a copy of
\r
7 * the License at http://www.mozilla.org/NPL/
\r
9 * Software distributed under the License is distributed on an "AS
\r
10 * IS" basis, WITHOUT WARRANTY OF ANY KIND, either express oqr
\r
11 * implied. See the License for the specific language governing
\r
12 * rights and limitations under the License.
\r
14 * The Original Code is Rhino code, released
\r
17 * The Initial Developer of the Original Code is Netscape
\r
18 * Communications Corporation. Portions created by Netscape are
\r
19 * Copyright (C) 1997-1999 Netscape Communications Corporation. All
\r
25 * Alternatively, the contents of this file may be used under the
\r
26 * terms of the GNU Public License (the "GPL"), in which case the
\r
27 * provisions of the GPL are applicable instead of those above.
\r
28 * If you wish to allow use of your version of this file only
\r
29 * under the terms of the GPL and not to allow others to use your
\r
30 * version of this file under the NPL, indicate your decision by
\r
31 * deleting the provisions above and replace them with the notice
\r
32 * and other provisions required by the GPL. If you do not delete
\r
33 * the provisions above, a recipient may use your version of this
\r
34 * file under either the NPL or the GPL.
\r
36 package org.mozilla.javascript;
\r
38 final class BinaryDigitReader {
\r
39 int lgBase; // Logarithm of base of number
\r
40 int digit; // Current digit value in radix given by base
\r
41 int digitPos; // Bit position of last bit extracted from digit
\r
42 String digits; // String containing the digits
\r
43 int start; // Index of the first remaining digit
\r
44 int end; // Index past the last remaining digit
\r
46 BinaryDigitReader(int base, String digits, int start, int end) {
\r
53 this.digits = digits;
\r
58 /* Return the next binary digit from the number or -1 if done */
\r
59 int getNextBinaryDigit()
\r
61 if (digitPos == 0) {
\r
65 char c = digits.charAt(start++);
\r
66 if ('0' <= c && c <= '9')
\r
68 else if ('a' <= c && c <= 'z')
\r
69 digit = c - 'a' + 10;
\r
70 else digit = c - 'A' + 10;
\r
73 return digit >> --digitPos & 1;
\r