Source Code Cross Referenced for AbstractIntKeyMap.java in  » Web-Framework » rife-1.6.1 » com » uwyn » rife » pcj » map » 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 » Web Framework » rife 1.6.1 » com.uwyn.rife.pcj.map 
Source Cross Referenced  Class Diagram Java Document (Java Doc) 


001:        /*
002:         *  Primitive Collections for Java.
003:         *  Copyright (C) 2003  S�ren Bak
004:         *
005:         *  This library is free software; you can redistribute it and/or
006:         *  modify it under the terms of the GNU Lesser General Public
007:         *  License as published by the Free Software Foundation; either
008:         *  version 2.1 of the License, or (at your option) any later version.
009:         *
010:         *  This library is distributed in the hope that it will be useful,
011:         *  but WITHOUT ANY WARRANTY; without even the implied warranty of
012:         *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
013:         *  Lesser General Public License for more details.
014:         *
015:         *  You should have received a copy of the GNU Lesser General Public
016:         *  License along with this library; if not, write to the Free Software
017:         *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
018:         */
019:        package com.uwyn.rife.pcj.map;
020:
021:        import com.uwyn.rife.pcj.hash.DefaultIntHashFunction;
022:
023:        /**
024:         *  This class represents an abstract base for implementing
025:         *  maps from int values to objects. All operations that can be implemented
026:         *  using iterators
027:         *  are implemented as such. In most cases, this is
028:         *  hardly an efficient solution, and at least some of those
029:         *  methods should be overridden by sub-classes.
030:         *
031:         *  @author     Søren Bak
032:         *  @version    1.0     2003/10/1
033:         *  @since      1.0
034:         */
035:        public abstract class AbstractIntKeyMap<E> implements  IntKeyMap<E> {
036:
037:            /** Default constructor to be invoked by sub-classes. */
038:            protected AbstractIntKeyMap() {
039:            }
040:
041:            public void clear() {
042:                IntKeyMapIterator i = entries();
043:                while (i.hasNext()) {
044:                    i.next();
045:                    i.remove();
046:                }
047:            }
048:
049:            public E remove(int key) {
050:                IntKeyMapIterator<E> i = entries();
051:                while (i.hasNext()) {
052:                    i.next();
053:                    if (i.getKey() == key) {
054:                        E value = i.getValue();
055:                        i.remove();
056:                        return value;
057:                    }
058:                }
059:                return null;
060:            }
061:
062:            public void putAll(IntKeyMap<E> map) {
063:                IntKeyMapIterator<E> i = map.entries();
064:                while (i.hasNext()) {
065:                    i.next();
066:                    put(i.getKey(), i.getValue());
067:                }
068:            }
069:
070:            public boolean containsKey(int key) {
071:                IntKeyMapIterator i = entries();
072:                while (i.hasNext()) {
073:                    i.next();
074:                    if (i.getKey() == key)
075:                        return true;
076:                }
077:                return false;
078:            }
079:
080:            public E get(int key) {
081:                IntKeyMapIterator<E> i = entries();
082:                while (i.hasNext()) {
083:                    i.next();
084:                    if (i.getKey() == key)
085:                        return i.getValue();
086:                }
087:                return null;
088:            }
089:
090:            public boolean containsValue(Object value) {
091:                IntKeyMapIterator i = entries();
092:                if (value == null) {
093:                    while (i.hasNext()) {
094:                        i.next();
095:                        if (value == null)
096:                            return true;
097:                    }
098:                } else {
099:                    while (i.hasNext()) {
100:                        i.next();
101:                        if (value.equals(i.getValue()))
102:                            return true;
103:                    }
104:                }
105:                return false;
106:            }
107:
108:            public boolean equals(Object obj) {
109:                if (!(obj instanceof  IntKeyMap))
110:                    return false;
111:                IntKeyMap map = (IntKeyMap) obj;
112:                if (size() != map.size())
113:                    return false;
114:                IntKeyMapIterator<E> i = entries();
115:                while (i.hasNext()) {
116:                    i.next();
117:                    int k = i.getKey();
118:                    E v = i.getValue();
119:                    if (v == null) {
120:                        if (map.get(k) != null)
121:                            return false;
122:                        if (!map.containsKey(k))
123:                            return false;
124:                    } else {
125:                        if (!v.equals(map.get(k)))
126:                            return false;
127:                    }
128:                }
129:                return true;
130:            }
131:
132:            public int hashCode() {
133:                int h = 0;
134:                IntKeyMapIterator i = entries();
135:                while (i.hasNext()) {
136:                    i.next();
137:                    h += (DefaultIntHashFunction.INSTANCE.hash(i.getKey()) ^ i
138:                            .getValue().hashCode());
139:                }
140:                return h;
141:            }
142:
143:            public boolean isEmpty() {
144:                return size() == 0;
145:            }
146:
147:            public int size() {
148:                int size = 0;
149:                IntKeyMapIterator i = entries();
150:                while (i.hasNext()) {
151:                    i.next();
152:                    size++;
153:                }
154:                return size;
155:            }
156:
157:            /**
158:             *  Returns a string representation of this map.
159:             *
160:             *  @return     a string representation of this map.
161:             */
162:            public String toString() {
163:                StringBuffer s = new StringBuffer();
164:                s.append('[');
165:                IntKeyMapIterator i = entries();
166:                while (i.hasNext()) {
167:                    if (s.length() > 1)
168:                        s.append(',');
169:                    i.next();
170:                    s.append(String.valueOf(i.getKey()));
171:                    s.append("->");
172:                    s.append(String.valueOf(i.getValue()));
173:                }
174:                s.append(']');
175:                return s.toString();
176:            }
177:
178:            /**
179:             *  Does nothing. Sub-classes may provide an implementation to
180:             *  minimize memory usage, but this is not required since many
181:             *  implementations will always have minimal memory usage.
182:             */
183:            public void trimToSize() {
184:            }
185:
186:        }
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.