Source Code Cross Referenced for BitVector.java in  » Rule-Engine » JLisa » org » armedbear » lisp » Java Source Code / Java DocumentationJava Source Code and Java Documentation

Java Source Code / Java Documentation
1. 6.0 JDK Core
2. 6.0 JDK Modules
3. 6.0 JDK Modules com.sun
4. 6.0 JDK Modules com.sun.java
5. 6.0 JDK Modules sun
6. 6.0 JDK Platform
7. Ajax
8. Apache Harmony Java SE
9. Aspect oriented
10. Authentication Authorization
11. Blogger System
12. Build
13. Byte Code
14. Cache
15. Chart
16. Chat
17. Code Analyzer
18. Collaboration
19. Content Management System
20. Database Client
21. Database DBMS
22. Database JDBC Connection Pool
23. Database ORM
24. Development
25. EJB Server geronimo
26. EJB Server GlassFish
27. EJB Server JBoss 4.2.1
28. EJB Server resin 3.1.5
29. ERP CRM Financial
30. ESB
31. Forum
32. GIS
33. Graphic Library
34. Groupware
35. HTML Parser
36. IDE
37. IDE Eclipse
38. IDE Netbeans
39. Installer
40. Internationalization Localization
41. Inversion of Control
42. Issue Tracking
43. J2EE
44. JBoss
45. JMS
46. JMX
47. Library
48. Mail Clients
49. Net
50. Parser
51. PDF
52. Portal
53. Profiler
54. Project Management
55. Report
56. RSS RDF
57. Rule Engine
58. Science
59. Scripting
60. Search Engine
61. Security
62. Sevlet Container
63. Source Control
64. Swing Library
65. Template Engine
66. Test Coverage
67. Testing
68. UML
69. Web Crawler
70. Web Framework
71. Web Mail
72. Web Server
73. Web Services
74. Web Services apache cxf 2.0.1
75. Web Services AXIS2
76. Wiki Engine
77. Workflow Engines
78. XML
79. XML UI
Java
Java Tutorial
Java Open Source
Jar File Download
Java Articles
Java Products
Java by API
Photoshop Tutorials
Maya Tutorials
Flash Tutorials
3ds-Max Tutorials
Illustrator Tutorials
GIMP Tutorials
C# / C Sharp
C# / CSharp Tutorial
C# / CSharp Open Source
ASP.Net
ASP.NET Tutorial
JavaScript DHTML
JavaScript Tutorial
JavaScript Reference
HTML / CSS
HTML CSS Reference
C / ANSI-C
C Tutorial
C++
C++ Tutorial
Ruby
PHP
Python
Python Tutorial
Python Open Source
SQL Server / T-SQL
SQL Server / T-SQL Tutorial
Oracle PL / SQL
Oracle PL/SQL Tutorial
PostgreSQL
SQL / MySQL
MySQL Tutorial
VB.Net
VB.Net Tutorial
Flash / Flex / ActionScript
VBA / Excel / Access / Word
XML
XML Tutorial
Microsoft Office PowerPoint 2007 Tutorial
Microsoft Office Excel 2007 Tutorial
Microsoft Office Word 2007 Tutorial
Java Source Code / Java Documentation » Rule Engine » JLisa » org.armedbear.lisp 
Source Cross Referenced  Class Diagram Java Document (Java Doc) 


001:        /*
002:         * BitVector.java
003:         *
004:         * Copyright (C) 2003 Peter Graves
005:         * $Id: BitVector.java,v 1.6 2003/11/15 11:03:30 beedlem Exp $
006:         *
007:         * This program is free software; you can redistribute it and/or
008:         * modify it under the terms of the GNU General Public License
009:         * as published by the Free Software Foundation; either version 2
010:         * of the License, or (at your option) any later version.
011:         *
012:         * This program is distributed in the hope that it will be useful,
013:         * but WITHOUT ANY WARRANTY; without even the implied warranty of
014:         * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
015:         * GNU General Public License for more details.
016:         *
017:         * You should have received a copy of the GNU General Public License
018:         * along with this program; if not, write to the Free Software
019:         * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
020:         */
021:
022:        package org.armedbear.lisp;
023:
024:        public final class BitVector extends AbstractVector {
025:            private static final int LONG_MASK = 0x3f;
026:
027:            private int capacity;
028:            private long[] bits;
029:
030:            public BitVector(int length) throws ConditionThrowable {
031:                if (length < 0)
032:                    throw new NegativeArraySizeException();
033:                capacity = length;
034:                int size = length >>> 6;
035:                if ((length & LONG_MASK) != 0)
036:                    ++size;
037:                bits = new long[size];
038:            }
039:
040:            public BitVector(String s) throws ConditionThrowable {
041:                this (s.length());
042:                for (int i = s.length(); i-- > 0;) {
043:                    char c = s.charAt(i);
044:                    if (c == '0')
045:                        ;
046:                    else if (c == '1')
047:                        set(i);
048:                    else
049:                        Debug.assertTrue(false);
050:                }
051:            }
052:
053:            public LispObject typeOf() {
054:                if (isSimpleVector())
055:                    return list2(Symbol.SIMPLE_BIT_VECTOR, new Fixnum(length()));
056:                return list2(Symbol.BIT_VECTOR, new Fixnum(length()));
057:            }
058:
059:            public LispClass classOf() {
060:                return BuiltInClass.BIT_VECTOR;
061:            }
062:
063:            public LispObject typep(LispObject type) throws ConditionThrowable {
064:                if (type == Symbol.BIT_VECTOR)
065:                    return T;
066:                if (type == Symbol.SIMPLE_BIT_VECTOR)
067:                    return isSimpleVector() ? T : NIL;
068:                if (type == Symbol.SIMPLE_VECTOR)
069:                    return NIL; // Can't hold elements of any type, only bits.
070:                if (type == BuiltInClass.BIT_VECTOR)
071:                    return T;
072:                return super .typep(type);
073:            }
074:
075:            public LispObject BIT_VECTOR_P() {
076:                return T;
077:            }
078:
079:            public LispObject getElementType() {
080:                return Symbol.BIT;
081:            }
082:
083:            public int capacity() {
084:                return capacity;
085:            }
086:
087:            public final void ensureCapacity(int minCapacity) {
088:                if (capacity < minCapacity) {
089:                    int size = minCapacity >>> 6;
090:                    if ((minCapacity & LONG_MASK) != 0)
091:                        ++size;
092:                    long[] newBits = new long[size];
093:                    System.arraycopy(bits, 0, newBits, 0, bits.length);
094:                    bits = newBits;
095:                    capacity = minCapacity;
096:                }
097:            }
098:
099:            public int length() {
100:                return fillPointer >= 0 ? fillPointer : capacity;
101:            }
102:
103:            public LispObject elt(int index) throws ConditionThrowable {
104:                if (index < 0 || index >= length())
105:                    badIndex(index, length());
106:                int offset = index >> 6;
107:                return (bits[offset] & (1L << index)) != 0 ? Fixnum.ONE
108:                        : Fixnum.ZERO;
109:            }
110:
111:            // Ignores fill pointer.
112:            public LispObject AREF(LispObject index) throws ConditionThrowable {
113:                return get(Fixnum.getValue(index));
114:            }
115:
116:            public LispObject reverse() throws ConditionThrowable {
117:                int length = length();
118:                BitVector result = new BitVector(length);
119:                int i, j;
120:                for (i = 0, j = length - 1; i < length; i++, j--) {
121:                    if (_get(j) == 1)
122:                        result.set(i);
123:                    else
124:                        result.clear(i);
125:                }
126:                return result;
127:            }
128:
129:            public LispObject getRowMajor(int index) throws ConditionThrowable {
130:                return get(index);
131:            }
132:
133:            public void setRowMajor(int index, LispObject newValue)
134:                    throws ConditionThrowable {
135:                set(index, newValue);
136:            }
137:
138:            public LispObject get(int index) throws ConditionThrowable {
139:                if (index >= capacity)
140:                    badIndex(index, capacity);
141:                int offset = index >> 6;
142:                return (bits[offset] & (1L << index)) != 0 ? Fixnum.ONE
143:                        : Fixnum.ZERO;
144:            }
145:
146:            private int _get(int index) {
147:                int offset = index >> 6;
148:                return (bits[offset] & (1L << index)) != 0 ? 1 : 0;
149:            }
150:
151:            public void set(int index, LispObject newValue)
152:                    throws ConditionThrowable {
153:                if (index >= capacity)
154:                    badIndex(index, capacity);
155:                try {
156:                    int n = Fixnum.getValue(newValue);
157:                    if (n == 1) {
158:                        set(index);
159:                        return;
160:                    }
161:                    if (n == 0) {
162:                        clear(index);
163:                        return;
164:                    }
165:                    // None of the above...
166:                } catch (ConditionThrowable t) {
167:                }
168:                throw new ConditionThrowable(new TypeError(newValue, "bit"));
169:            }
170:
171:            public void set(int index) {
172:                int offset = index >> 6;
173:                bits[offset] |= 1L << index;
174:            }
175:
176:            public void clear(int index) {
177:                int offset = index >> 6;
178:                bits[offset] &= ~(1L << index);
179:            }
180:
181:            public LispObject subseq(int start, int end)
182:                    throws ConditionThrowable {
183:                BitVector v = new BitVector(end - start);
184:                int i = start, j = 0;
185:                while (i < end) {
186:                    if (_get(i++) == 0)
187:                        v.clear(j++);
188:                    else
189:                        v.set(j++);
190:                }
191:                return v;
192:            }
193:
194:            public void fill(LispObject obj) throws ConditionThrowable {
195:                try {
196:                    int n = Fixnum.getValue(obj);
197:                    if (n == 1) {
198:                        for (int i = bits.length; i-- > 0;)
199:                            bits[i] = -1L;
200:                        return;
201:                    }
202:                    if (n == 0) {
203:                        for (int i = bits.length; i-- > 0;)
204:                            bits[i] = 0;
205:                        return;
206:                    }
207:                    // None of the above...
208:                } catch (ConditionThrowable t) {
209:                }
210:                throw new ConditionThrowable(new TypeError(obj, "bit"));
211:            }
212:
213:            public void shrink(int n) throws ConditionThrowable {
214:                if (n < capacity) {
215:                    int size = n >>> 6;
216:                    if ((n & LONG_MASK) != 0)
217:                        ++size;
218:                    if (size < bits.length) {
219:                        long[] newbits = new long[size];
220:                        System.arraycopy(bits, 0, newbits, 0, size);
221:                        bits = newbits;
222:                    }
223:                    capacity = n;
224:                    return;
225:                }
226:                if (n == capacity)
227:                    return;
228:                throw new ConditionThrowable(new LispError());
229:            }
230:
231:            public boolean isSimpleVector() {
232:                return fillPointer < 0;
233:            }
234:
235:            public boolean equal(LispObject obj) throws ConditionThrowable {
236:                if (this  == obj)
237:                    return true;
238:                if (obj instanceof  BitVector) {
239:                    BitVector v = (BitVector) obj;
240:                    if (length() != v.length())
241:                        return false;
242:                    for (int i = length(); i-- > 0;) {
243:                        if (_get(i) != v._get(i))
244:                            return false;
245:                    }
246:                    return true;
247:                }
248:                return false;
249:            }
250:
251:            public boolean equalp(LispObject obj) throws ConditionThrowable {
252:                if (this  == obj)
253:                    return true;
254:                if (obj instanceof  BitVector) {
255:                    BitVector v = (BitVector) obj;
256:                    if (length() != v.length())
257:                        return false;
258:                    for (int i = length(); i-- > 0;) {
259:                        if (_get(i) != v._get(i))
260:                            return false;
261:                    }
262:                    return true;
263:                }
264:                if (obj instanceof  AbstractVector)
265:                    return ((AbstractVector) obj).equalp(this );
266:                return false;
267:            }
268:
269:            public String toString() {
270:                final int limit = length();
271:                StringBuffer sb = new StringBuffer(limit + 2);
272:                sb.append("#*");
273:                for (int i = 0; i < limit; i++)
274:                    sb.append(_get(i) == 1 ? '1' : '0');
275:                return sb.toString();
276:            }
277:        }
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.