libgee r2 - in trunk: . gee
- From: juergbi svn gnome org
- To: svn-commits-list gnome org
- Subject: libgee r2 - in trunk: . gee
- Date: Tue, 22 Jan 2008 10:40:07 +0000 (GMT)
Author: juergbi
Date: Tue Jan 22 10:40:07 2008
New Revision: 2
URL: http://svn.gnome.org/viewvc/libgee?rev=2&view=rev
Log:
* Initial import.
Added:
trunk/AUTHORS
trunk/COPYING
trunk/ChangeLog
trunk/INSTALL
trunk/MAINTAINERS
trunk/Makefile.am
trunk/NEWS
trunk/README
trunk/autogen.sh (contents, props changed)
trunk/configure.ac
trunk/gee/
trunk/gee-1.0.pc.in
trunk/gee/Makefile.am
trunk/gee/arraylist.vala
trunk/gee/collection.vala
trunk/gee/gee.h
trunk/gee/hashmap.vala
trunk/gee/hashset.vala
trunk/gee/iterable.vala
trunk/gee/iterator.vala
trunk/gee/list.vala
trunk/gee/map.vala
trunk/gee/readonlycollection.vala
trunk/gee/readonlylist.vala
trunk/gee/readonlymap.vala
trunk/gee/readonlyset.vala
trunk/gee/set.vala
Added: trunk/AUTHORS
==============================================================================
--- (empty file)
+++ trunk/AUTHORS Tue Jan 22 10:40:07 2008
@@ -0,0 +1 @@
+JÃrg Billeter <j bitron ch>
Added: trunk/COPYING
==============================================================================
--- (empty file)
+++ trunk/COPYING Tue Jan 22 10:40:07 2008
@@ -0,0 +1,504 @@
+ GNU LESSER GENERAL PUBLIC LICENSE
+ Version 2.1, February 1999
+
+ Copyright (C) 1991, 1999 Free Software Foundation, Inc.
+ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+[This is the first released version of the Lesser GPL. It also counts
+ as the successor of the GNU Library Public License, version 2, hence
+ the version number 2.1.]
+
+ Preamble
+
+ The licenses for most software are designed to take away your
+freedom to share and change it. By contrast, the GNU General Public
+Licenses are intended to guarantee your freedom to share and change
+free software--to make sure the software is free for all its users.
+
+ This license, the Lesser General Public License, applies to some
+specially designated software packages--typically libraries--of the
+Free Software Foundation and other authors who decide to use it. You
+can use it too, but we suggest you first think carefully about whether
+this license or the ordinary General Public License is the better
+strategy to use in any particular case, based on the explanations below.
+
+ When we speak of free software, we are referring to freedom of use,
+not price. Our General Public Licenses are designed to make sure that
+you have the freedom to distribute copies of free software (and charge
+for this service if you wish); that you receive source code or can get
+it if you want it; that you can change the software and use pieces of
+it in new free programs; and that you are informed that you can do
+these things.
+
+ To protect your rights, we need to make restrictions that forbid
+distributors to deny you these rights or to ask you to surrender these
+rights. These restrictions translate to certain responsibilities for
+you if you distribute copies of the library or if you modify it.
+
+ For example, if you distribute copies of the library, whether gratis
+or for a fee, you must give the recipients all the rights that we gave
+you. You must make sure that they, too, receive or can get the source
+code. If you link other code with the library, you must provide
+complete object files to the recipients, so that they can relink them
+with the library after making changes to the library and recompiling
+it. And you must show them these terms so they know their rights.
+
+ We protect your rights with a two-step method: (1) we copyright the
+library, and (2) we offer you this license, which gives you legal
+permission to copy, distribute and/or modify the library.
+
+ To protect each distributor, we want to make it very clear that
+there is no warranty for the free library. Also, if the library is
+modified by someone else and passed on, the recipients should know
+that what they have is not the original version, so that the original
+author's reputation will not be affected by problems that might be
+introduced by others.
+
+ Finally, software patents pose a constant threat to the existence of
+any free program. We wish to make sure that a company cannot
+effectively restrict the users of a free program by obtaining a
+restrictive license from a patent holder. Therefore, we insist that
+any patent license obtained for a version of the library must be
+consistent with the full freedom of use specified in this license.
+
+ Most GNU software, including some libraries, is covered by the
+ordinary GNU General Public License. This license, the GNU Lesser
+General Public License, applies to certain designated libraries, and
+is quite different from the ordinary General Public License. We use
+this license for certain libraries in order to permit linking those
+libraries into non-free programs.
+
+ When a program is linked with a library, whether statically or using
+a shared library, the combination of the two is legally speaking a
+combined work, a derivative of the original library. The ordinary
+General Public License therefore permits such linking only if the
+entire combination fits its criteria of freedom. The Lesser General
+Public License permits more lax criteria for linking other code with
+the library.
+
+ We call this license the "Lesser" General Public License because it
+does Less to protect the user's freedom than the ordinary General
+Public License. It also provides other free software developers Less
+of an advantage over competing non-free programs. These disadvantages
+are the reason we use the ordinary General Public License for many
+libraries. However, the Lesser license provides advantages in certain
+special circumstances.
+
+ For example, on rare occasions, there may be a special need to
+encourage the widest possible use of a certain library, so that it becomes
+a de-facto standard. To achieve this, non-free programs must be
+allowed to use the library. A more frequent case is that a free
+library does the same job as widely used non-free libraries. In this
+case, there is little to gain by limiting the free library to free
+software only, so we use the Lesser General Public License.
+
+ In other cases, permission to use a particular library in non-free
+programs enables a greater number of people to use a large body of
+free software. For example, permission to use the GNU C Library in
+non-free programs enables many more people to use the whole GNU
+operating system, as well as its variant, the GNU/Linux operating
+system.
+
+ Although the Lesser General Public License is Less protective of the
+users' freedom, it does ensure that the user of a program that is
+linked with the Library has the freedom and the wherewithal to run
+that program using a modified version of the Library.
+
+ The precise terms and conditions for copying, distribution and
+modification follow. Pay close attention to the difference between a
+"work based on the library" and a "work that uses the library". The
+former contains code derived from the library, whereas the latter must
+be combined with the library in order to run.
+
+ GNU LESSER GENERAL PUBLIC LICENSE
+ TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+ 0. This License Agreement applies to any software library or other
+program which contains a notice placed by the copyright holder or
+other authorized party saying it may be distributed under the terms of
+this Lesser General Public License (also called "this License").
+Each licensee is addressed as "you".
+
+ A "library" means a collection of software functions and/or data
+prepared so as to be conveniently linked with application programs
+(which use some of those functions and data) to form executables.
+
+ The "Library", below, refers to any such software library or work
+which has been distributed under these terms. A "work based on the
+Library" means either the Library or any derivative work under
+copyright law: that is to say, a work containing the Library or a
+portion of it, either verbatim or with modifications and/or translated
+straightforwardly into another language. (Hereinafter, translation is
+included without limitation in the term "modification".)
+
+ "Source code" for a work means the preferred form of the work for
+making modifications to it. For a library, complete source code means
+all the source code for all modules it contains, plus any associated
+interface definition files, plus the scripts used to control compilation
+and installation of the library.
+
+ Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope. The act of
+running a program using the Library is not restricted, and output from
+such a program is covered only if its contents constitute a work based
+on the Library (independent of the use of the Library in a tool for
+writing it). Whether that is true depends on what the Library does
+and what the program that uses the Library does.
+
+ 1. You may copy and distribute verbatim copies of the Library's
+complete source code as you receive it, in any medium, provided that
+you conspicuously and appropriately publish on each copy an
+appropriate copyright notice and disclaimer of warranty; keep intact
+all the notices that refer to this License and to the absence of any
+warranty; and distribute a copy of this License along with the
+Library.
+
+ You may charge a fee for the physical act of transferring a copy,
+and you may at your option offer warranty protection in exchange for a
+fee.
+
+ 2. You may modify your copy or copies of the Library or any portion
+of it, thus forming a work based on the Library, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+ a) The modified work must itself be a software library.
+
+ b) You must cause the files modified to carry prominent notices
+ stating that you changed the files and the date of any change.
+
+ c) You must cause the whole of the work to be licensed at no
+ charge to all third parties under the terms of this License.
+
+ d) If a facility in the modified Library refers to a function or a
+ table of data to be supplied by an application program that uses
+ the facility, other than as an argument passed when the facility
+ is invoked, then you must make a good faith effort to ensure that,
+ in the event an application does not supply such function or
+ table, the facility still operates, and performs whatever part of
+ its purpose remains meaningful.
+
+ (For example, a function in a library to compute square roots has
+ a purpose that is entirely well-defined independent of the
+ application. Therefore, Subsection 2d requires that any
+ application-supplied function or table used by this function must
+ be optional: if the application does not supply it, the square
+ root function must still compute square roots.)
+
+These requirements apply to the modified work as a whole. If
+identifiable sections of that work are not derived from the Library,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works. But when you
+distribute the same sections as part of a whole which is a work based
+on the Library, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote
+it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Library.
+
+In addition, mere aggregation of another work not based on the Library
+with the Library (or with a work based on the Library) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+ 3. You may opt to apply the terms of the ordinary GNU General Public
+License instead of this License to a given copy of the Library. To do
+this, you must alter all the notices that refer to this License, so
+that they refer to the ordinary GNU General Public License, version 2,
+instead of to this License. (If a newer version than version 2 of the
+ordinary GNU General Public License has appeared, then you can specify
+that version instead if you wish.) Do not make any other change in
+these notices.
+
+ Once this change is made in a given copy, it is irreversible for
+that copy, so the ordinary GNU General Public License applies to all
+subsequent copies and derivative works made from that copy.
+
+ This option is useful when you wish to copy part of the code of
+the Library into a program that is not a library.
+
+ 4. You may copy and distribute the Library (or a portion or
+derivative of it, under Section 2) in object code or executable form
+under the terms of Sections 1 and 2 above provided that you accompany
+it with the complete corresponding machine-readable source code, which
+must be distributed under the terms of Sections 1 and 2 above on a
+medium customarily used for software interchange.
+
+ If distribution of object code is made by offering access to copy
+from a designated place, then offering equivalent access to copy the
+source code from the same place satisfies the requirement to
+distribute the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+ 5. A program that contains no derivative of any portion of the
+Library, but is designed to work with the Library by being compiled or
+linked with it, is called a "work that uses the Library". Such a
+work, in isolation, is not a derivative work of the Library, and
+therefore falls outside the scope of this License.
+
+ However, linking a "work that uses the Library" with the Library
+creates an executable that is a derivative of the Library (because it
+contains portions of the Library), rather than a "work that uses the
+library". The executable is therefore covered by this License.
+Section 6 states terms for distribution of such executables.
+
+ When a "work that uses the Library" uses material from a header file
+that is part of the Library, the object code for the work may be a
+derivative work of the Library even though the source code is not.
+Whether this is true is especially significant if the work can be
+linked without the Library, or if the work is itself a library. The
+threshold for this to be true is not precisely defined by law.
+
+ If such an object file uses only numerical parameters, data
+structure layouts and accessors, and small macros and small inline
+functions (ten lines or less in length), then the use of the object
+file is unrestricted, regardless of whether it is legally a derivative
+work. (Executables containing this object code plus portions of the
+Library will still fall under Section 6.)
+
+ Otherwise, if the work is a derivative of the Library, you may
+distribute the object code for the work under the terms of Section 6.
+Any executables containing that work also fall under Section 6,
+whether or not they are linked directly with the Library itself.
+
+ 6. As an exception to the Sections above, you may also combine or
+link a "work that uses the Library" with the Library to produce a
+work containing portions of the Library, and distribute that work
+under terms of your choice, provided that the terms permit
+modification of the work for the customer's own use and reverse
+engineering for debugging such modifications.
+
+ You must give prominent notice with each copy of the work that the
+Library is used in it and that the Library and its use are covered by
+this License. You must supply a copy of this License. If the work
+during execution displays copyright notices, you must include the
+copyright notice for the Library among them, as well as a reference
+directing the user to the copy of this License. Also, you must do one
+of these things:
+
+ a) Accompany the work with the complete corresponding
+ machine-readable source code for the Library including whatever
+ changes were used in the work (which must be distributed under
+ Sections 1 and 2 above); and, if the work is an executable linked
+ with the Library, with the complete machine-readable "work that
+ uses the Library", as object code and/or source code, so that the
+ user can modify the Library and then relink to produce a modified
+ executable containing the modified Library. (It is understood
+ that the user who changes the contents of definitions files in the
+ Library will not necessarily be able to recompile the application
+ to use the modified definitions.)
+
+ b) Use a suitable shared library mechanism for linking with the
+ Library. A suitable mechanism is one that (1) uses at run time a
+ copy of the library already present on the user's computer system,
+ rather than copying library functions into the executable, and (2)
+ will operate properly with a modified version of the library, if
+ the user installs one, as long as the modified version is
+ interface-compatible with the version that the work was made with.
+
+ c) Accompany the work with a written offer, valid for at
+ least three years, to give the same user the materials
+ specified in Subsection 6a, above, for a charge no more
+ than the cost of performing this distribution.
+
+ d) If distribution of the work is made by offering access to copy
+ from a designated place, offer equivalent access to copy the above
+ specified materials from the same place.
+
+ e) Verify that the user has already received a copy of these
+ materials or that you have already sent this user a copy.
+
+ For an executable, the required form of the "work that uses the
+Library" must include any data and utility programs needed for
+reproducing the executable from it. However, as a special exception,
+the materials to be distributed need not include anything that is
+normally distributed (in either source or binary form) with the major
+components (compiler, kernel, and so on) of the operating system on
+which the executable runs, unless that component itself accompanies
+the executable.
+
+ It may happen that this requirement contradicts the license
+restrictions of other proprietary libraries that do not normally
+accompany the operating system. Such a contradiction means you cannot
+use both them and the Library together in an executable that you
+distribute.
+
+ 7. You may place library facilities that are a work based on the
+Library side-by-side in a single library together with other library
+facilities not covered by this License, and distribute such a combined
+library, provided that the separate distribution of the work based on
+the Library and of the other library facilities is otherwise
+permitted, and provided that you do these two things:
+
+ a) Accompany the combined library with a copy of the same work
+ based on the Library, uncombined with any other library
+ facilities. This must be distributed under the terms of the
+ Sections above.
+
+ b) Give prominent notice with the combined library of the fact
+ that part of it is a work based on the Library, and explaining
+ where to find the accompanying uncombined form of the same work.
+
+ 8. You may not copy, modify, sublicense, link with, or distribute
+the Library except as expressly provided under this License. Any
+attempt otherwise to copy, modify, sublicense, link with, or
+distribute the Library is void, and will automatically terminate your
+rights under this License. However, parties who have received copies,
+or rights, from you under this License will not have their licenses
+terminated so long as such parties remain in full compliance.
+
+ 9. You are not required to accept this License, since you have not
+signed it. However, nothing else grants you permission to modify or
+distribute the Library or its derivative works. These actions are
+prohibited by law if you do not accept this License. Therefore, by
+modifying or distributing the Library (or any work based on the
+Library), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Library or works based on it.
+
+ 10. Each time you redistribute the Library (or any work based on the
+Library), the recipient automatically receives a license from the
+original licensor to copy, distribute, link with or modify the Library
+subject to these terms and conditions. You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties with
+this License.
+
+ 11. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License. If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Library at all. For example, if a patent
+license would not permit royalty-free redistribution of the Library by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Library.
+
+If any portion of this section is held invalid or unenforceable under any
+particular circumstance, the balance of the section is intended to apply,
+and the section as a whole is intended to apply in other circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system which is
+implemented by public license practices. Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+ 12. If the distribution and/or use of the Library is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Library under this License may add
+an explicit geographical distribution limitation excluding those countries,
+so that distribution is permitted only in or among countries not thus
+excluded. In such case, this License incorporates the limitation as if
+written in the body of this License.
+
+ 13. The Free Software Foundation may publish revised and/or new
+versions of the Lesser General Public License from time to time.
+Such new versions will be similar in spirit to the present version,
+but may differ in detail to address new problems or concerns.
+
+Each version is given a distinguishing version number. If the Library
+specifies a version number of this License which applies to it and
+"any later version", you have the option of following the terms and
+conditions either of that version or of any later version published by
+the Free Software Foundation. If the Library does not specify a
+license version number, you may choose any version ever published by
+the Free Software Foundation.
+
+ 14. If you wish to incorporate parts of the Library into other free
+programs whose distribution conditions are incompatible with these,
+write to the author to ask for permission. For software which is
+copyrighted by the Free Software Foundation, write to the Free
+Software Foundation; we sometimes make exceptions for this. Our
+decision will be guided by the two goals of preserving the free status
+of all derivatives of our free software and of promoting the sharing
+and reuse of software generally.
+
+ NO WARRANTY
+
+ 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
+WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
+EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
+OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY
+KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
+LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
+THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+ 16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
+WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
+AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU
+FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
+CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
+LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
+RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
+FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
+SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
+DAMAGES.
+
+ END OF TERMS AND CONDITIONS
+
+ How to Apply These Terms to Your New Libraries
+
+ If you develop a new library, and you want it to be of the greatest
+possible use to the public, we recommend making it free software that
+everyone can redistribute and change. You can do so by permitting
+redistribution under these terms (or, alternatively, under the terms of the
+ordinary General Public License).
+
+ To apply these terms, attach the following notices to the library. It is
+safest to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least the
+"copyright" line and a pointer to where the full notice is found.
+
+ <one line to give the library's name and a brief idea of what it does.>
+ Copyright (C) <year> <name of author>
+
+ This library is free software; you can redistribute it and/or
+ modify it under the terms of the GNU Lesser General Public
+ License as published by the Free Software Foundation; either
+ version 2.1 of the License, or (at your option) any later version.
+
+ This library is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ Lesser General Public License for more details.
+
+ You should have received a copy of the GNU Lesser General Public
+ License along with this library; if not, write to the Free Software
+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+
+Also add information on how to contact you by electronic and paper mail.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the library, if
+necessary. Here is a sample; alter the names:
+
+ Yoyodyne, Inc., hereby disclaims all copyright interest in the
+ library `Frob' (a library for tweaking knobs) written by James Random Hacker.
+
+ <signature of Ty Coon>, 1 April 1990
+ Ty Coon, President of Vice
+
+That's all there is to it!
+
+
Added: trunk/INSTALL
==============================================================================
--- (empty file)
+++ trunk/INSTALL Tue Jan 22 10:40:07 2008
@@ -0,0 +1,234 @@
+Installation Instructions
+*************************
+
+Copyright (C) 1994, 1995, 1996, 1999, 2000, 2001, 2002, 2004, 2005,
+2006 Free Software Foundation, Inc.
+
+This file is free documentation; the Free Software Foundation gives
+unlimited permission to copy, distribute and modify it.
+
+Basic Installation
+==================
+
+Briefly, the shell commands `./configure; make; make install' should
+configure, build, and install this package. The following
+more-detailed instructions are generic; see the `README' file for
+instructions specific to this package.
+
+ The `configure' shell script attempts to guess correct values for
+various system-dependent variables used during compilation. It uses
+those values to create a `Makefile' in each directory of the package.
+It may also create one or more `.h' files containing system-dependent
+definitions. Finally, it creates a shell script `config.status' that
+you can run in the future to recreate the current configuration, and a
+file `config.log' containing compiler output (useful mainly for
+debugging `configure').
+
+ It can also use an optional file (typically called `config.cache'
+and enabled with `--cache-file=config.cache' or simply `-C') that saves
+the results of its tests to speed up reconfiguring. Caching is
+disabled by default to prevent problems with accidental use of stale
+cache files.
+
+ If you need to do unusual things to compile the package, please try
+to figure out how `configure' could check whether to do them, and mail
+diffs or instructions to the address given in the `README' so they can
+be considered for the next release. If you are using the cache, and at
+some point `config.cache' contains results you don't want to keep, you
+may remove or edit it.
+
+ The file `configure.ac' (or `configure.in') is used to create
+`configure' by a program called `autoconf'. You need `configure.ac' if
+you want to change it or regenerate `configure' using a newer version
+of `autoconf'.
+
+The simplest way to compile this package is:
+
+ 1. `cd' to the directory containing the package's source code and type
+ `./configure' to configure the package for your system.
+
+ Running `configure' might take a while. While running, it prints
+ some messages telling which features it is checking for.
+
+ 2. Type `make' to compile the package.
+
+ 3. Optionally, type `make check' to run any self-tests that come with
+ the package.
+
+ 4. Type `make install' to install the programs and any data files and
+ documentation.
+
+ 5. You can remove the program binaries and object files from the
+ source code directory by typing `make clean'. To also remove the
+ files that `configure' created (so you can compile the package for
+ a different kind of computer), type `make distclean'. There is
+ also a `make maintainer-clean' target, but that is intended mainly
+ for the package's developers. If you use it, you may have to get
+ all sorts of other programs in order to regenerate files that came
+ with the distribution.
+
+Compilers and Options
+=====================
+
+Some systems require unusual options for compilation or linking that the
+`configure' script does not know about. Run `./configure --help' for
+details on some of the pertinent environment variables.
+
+ You can give `configure' initial values for configuration parameters
+by setting variables in the command line or in the environment. Here
+is an example:
+
+ ./configure CC=c99 CFLAGS=-g LIBS=-lposix
+
+ *Note Defining Variables::, for more details.
+
+Compiling For Multiple Architectures
+====================================
+
+You can compile the package for more than one kind of computer at the
+same time, by placing the object files for each architecture in their
+own directory. To do this, you can use GNU `make'. `cd' to the
+directory where you want the object files and executables to go and run
+the `configure' script. `configure' automatically checks for the
+source code in the directory that `configure' is in and in `..'.
+
+ With a non-GNU `make', it is safer to compile the package for one
+architecture at a time in the source code directory. After you have
+installed the package for one architecture, use `make distclean' before
+reconfiguring for another architecture.
+
+Installation Names
+==================
+
+By default, `make install' installs the package's commands under
+`/usr/local/bin', include files under `/usr/local/include', etc. You
+can specify an installation prefix other than `/usr/local' by giving
+`configure' the option `--prefix=PREFIX'.
+
+ You can specify separate installation prefixes for
+architecture-specific files and architecture-independent files. If you
+pass the option `--exec-prefix=PREFIX' to `configure', the package uses
+PREFIX as the prefix for installing programs and libraries.
+Documentation and other data files still use the regular prefix.
+
+ In addition, if you use an unusual directory layout you can give
+options like `--bindir=DIR' to specify different values for particular
+kinds of files. Run `configure --help' for a list of the directories
+you can set and what kinds of files go in them.
+
+ If the package supports it, you can cause programs to be installed
+with an extra prefix or suffix on their names by giving `configure' the
+option `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'.
+
+Optional Features
+=================
+
+Some packages pay attention to `--enable-FEATURE' options to
+`configure', where FEATURE indicates an optional part of the package.
+They may also pay attention to `--with-PACKAGE' options, where PACKAGE
+is something like `gnu-as' or `x' (for the X Window System). The
+`README' should mention any `--enable-' and `--with-' options that the
+package recognizes.
+
+ For packages that use the X Window System, `configure' can usually
+find the X include and library files automatically, but if it doesn't,
+you can use the `configure' options `--x-includes=DIR' and
+`--x-libraries=DIR' to specify their locations.
+
+Specifying the System Type
+==========================
+
+There may be some features `configure' cannot figure out automatically,
+but needs to determine by the type of machine the package will run on.
+Usually, assuming the package is built to be run on the _same_
+architectures, `configure' can figure that out, but if it prints a
+message saying it cannot guess the machine type, give it the
+`--build=TYPE' option. TYPE can either be a short name for the system
+type, such as `sun4', or a canonical name which has the form:
+
+ CPU-COMPANY-SYSTEM
+
+where SYSTEM can have one of these forms:
+
+ OS KERNEL-OS
+
+ See the file `config.sub' for the possible values of each field. If
+`config.sub' isn't included in this package, then this package doesn't
+need to know the machine type.
+
+ If you are _building_ compiler tools for cross-compiling, you should
+use the option `--target=TYPE' to select the type of system they will
+produce code for.
+
+ If you want to _use_ a cross compiler, that generates code for a
+platform different from the build platform, you should specify the
+"host" platform (i.e., that on which the generated programs will
+eventually be run) with `--host=TYPE'.
+
+Sharing Defaults
+================
+
+If you want to set default values for `configure' scripts to share, you
+can create a site shell script called `config.site' that gives default
+values for variables like `CC', `cache_file', and `prefix'.
+`configure' looks for `PREFIX/share/config.site' if it exists, then
+`PREFIX/etc/config.site' if it exists. Or, you can set the
+`CONFIG_SITE' environment variable to the location of the site script.
+A warning: not all `configure' scripts look for a site script.
+
+Defining Variables
+==================
+
+Variables not defined in a site shell script can be set in the
+environment passed to `configure'. However, some packages may run
+configure again during the build, and the customized values of these
+variables may be lost. In order to avoid this problem, you should set
+them in the `configure' command line, using `VAR=value'. For example:
+
+ ./configure CC=/usr/local2/bin/gcc
+
+causes the specified `gcc' to be used as the C compiler (unless it is
+overridden in the site shell script).
+
+Unfortunately, this technique does not work for `CONFIG_SHELL' due to
+an Autoconf bug. Until the bug is fixed you can use this workaround:
+
+ CONFIG_SHELL=/bin/bash /bin/bash ./configure CONFIG_SHELL=/bin/bash
+
+`configure' Invocation
+======================
+
+`configure' recognizes the following options to control how it operates.
+
+`--help'
+`-h'
+ Print a summary of the options to `configure', and exit.
+
+`--version'
+`-V'
+ Print the version of Autoconf used to generate the `configure'
+ script, and exit.
+
+`--cache-file=FILE'
+ Enable the cache: use and save the results of the tests in FILE,
+ traditionally `config.cache'. FILE defaults to `/dev/null' to
+ disable caching.
+
+`--config-cache'
+`-C'
+ Alias for `--cache-file=config.cache'.
+
+`--quiet'
+`--silent'
+`-q'
+ Do not print messages saying which checks are being made. To
+ suppress all normal output, redirect it to `/dev/null' (any error
+ messages will still be shown).
+
+`--srcdir=DIR'
+ Look for the package's source code in directory DIR. Usually
+ `configure' can determine that directory automatically.
+
+`configure' also accepts some other, not widely useful, options. Run
+`configure --help' for more details.
+
Added: trunk/MAINTAINERS
==============================================================================
--- (empty file)
+++ trunk/MAINTAINERS Tue Jan 22 10:40:07 2008
@@ -0,0 +1,4 @@
+JÃrg Billeter
+E-mail: j bitron ch
+Userid: juergbi
+
Added: trunk/Makefile.am
==============================================================================
--- (empty file)
+++ trunk/Makefile.am Tue Jan 22 10:40:07 2008
@@ -0,0 +1,14 @@
+NULL =
+
+SUBDIRS = \
+ gee \
+ $(NULL)
+
+pkgconfigdir = $(libdir)/pkgconfig
+pkgconfig_DATA = gee-1.0.pc
+
+EXTRA_DIST = \
+ MAINTAINERS \
+ gee-1.0.pc.in \
+ $(NULL)
+
Added: trunk/NEWS
==============================================================================
Added: trunk/README
==============================================================================
--- (empty file)
+++ trunk/README Tue Jan 22 10:40:07 2008
@@ -0,0 +1,20 @@
+libgee is a collection library providing GObject-based interfaces and
+classes for commonly used data structures.
+
+libgee provides the following interfaces:
+
+ * Iterable
+ * Collection
+ * List
+ * Set
+ * Iterator
+ * Map
+
+The ArrayList, HashSet, and HashMap classes provide a reasonable sample
+implementation of the List, Set, and Map interfaces. ReadOnlyCollection,
+ReadOnlyList, ReadOnlySet, and ReadOnlyMap are read-only wrapper classes
+that prevent modification of the underlying collection.
+
+libgee is written in Vala and can be used like any GObject-based C library.
+It's planned to provide bindings for further languages.
+
Added: trunk/autogen.sh
==============================================================================
--- (empty file)
+++ trunk/autogen.sh Tue Jan 22 10:40:07 2008
@@ -0,0 +1,12 @@
+#!/bin/sh
+
+srcdir=`dirname $0`
+test -z "$srcdir" && srcdir=.
+
+ORIGDIR=`pwd`
+cd $srcdir
+
+autoreconf -v --install || exit 1
+cd $ORIGDIR || exit $?
+
+$srcdir/configure "$@"
Added: trunk/configure.ac
==============================================================================
--- (empty file)
+++ trunk/configure.ac Tue Jan 22 10:40:07 2008
@@ -0,0 +1,29 @@
+AC_INIT([vala], [0.1.0], [j bitron ch], [libgee])
+AC_CONFIG_SRCDIR([Makefile.am])
+AC_CONFIG_HEADERS(config.h)
+AM_INIT_AUTOMAKE([dist-bzip2])
+
+# Checks for programs.
+AC_PROG_CC
+AM_PROG_CC_C_O
+AC_DISABLE_STATIC
+AC_PROG_LIBTOOL
+
+AC_PATH_PROG(VALAC, valac, valac)
+AC_SUBST(VALAC)
+
+AC_SUBST(CFLAGS)
+AC_SUBST(CPPFLAGS)
+AC_SUBST(LDFLAGS)
+
+GLIB_REQUIRED=2.10.0
+
+PKG_CHECK_MODULES(GLIB, glib-2.0 >= $GLIB_REQUIRED gobject-2.0 >= $GLIB_REQUIRED)
+AC_SUBST(GLIB_CFLAGS)
+AC_SUBST(GLIB_LIBS)
+
+AC_CONFIG_FILES([Makefile
+ gee-1.0.pc
+ gee/Makefile])
+
+AC_OUTPUT
Added: trunk/gee-1.0.pc.in
==============================================================================
--- (empty file)
+++ trunk/gee-1.0.pc.in Tue Jan 22 10:40:07 2008
@@ -0,0 +1,13 @@
+prefix= prefix@
+exec_prefix= exec_prefix@
+libdir= libdir@
+includedir= includedir@
+datarootdir= datarootdir@
+datadir= datadir@
+
+Name: libgee
+Description: The GObject collection library
+Version: @VERSION@
+Requires: glib-2.0 gobject-2.0
+Libs: -L${libdir} -lgee
+Cflags: -I${includedir}/gee-1.0
Added: trunk/gee/Makefile.am
==============================================================================
--- (empty file)
+++ trunk/gee/Makefile.am Tue Jan 22 10:40:07 2008
@@ -0,0 +1,92 @@
+NULL =
+
+INCLUDES = \
+ $(GLIB_CFLAGS) \
+ $(NULL)
+
+BUILT_SOURCES = gee.vala.stamp
+
+lib_LTLIBRARIES = \
+ libgee.la
+ $(NULL)
+
+libgee_la_SOURCES = \
+ gee.vala.stamp \
+ arraylist.c \
+ arraylist.h \
+ arraylist.vala \
+ collection.c \
+ collection.h \
+ collection.vala \
+ hashmap.c \
+ hashmap.h \
+ hashmap.vala \
+ hashset.c \
+ hashset.h \
+ hashset.vala \
+ iterable.c \
+ iterable.h \
+ iterable.vala \
+ iterator.c \
+ iterator.h \
+ iterator.vala \
+ list.c \
+ list.h \
+ list.vala \
+ map.c \
+ map.h \
+ map.vala \
+ readonlycollection.c \
+ readonlycollection.h \
+ readonlycollection.vala \
+ readonlylist.c \
+ readonlylist.h \
+ readonlylist.vala \
+ readonlymap.c \
+ readonlymap.h \
+ readonlymap.vala \
+ readonlyset.c \
+ readonlyset.h \
+ readonlyset.vala \
+ set.c \
+ set.h \
+ set.vala \
+ $(NULL)
+
+geeincludedir = $(includedir)/gee-1.0/gee
+
+geeinclude_HEADERS = \
+ arraylist.h \
+ collection.h \
+ gee.h \
+ hashmap.h \
+ hashset.h \
+ iterable.h \
+ iterator.h \
+ list.h \
+ map.h \
+ readonlycollection.h \
+ readonlylist.h \
+ readonlymap.h \
+ readonlyset.h \
+ set.h \
+ $(NULL)
+
+gee.vala gee.vala.stamp: $(filter %.vala,$(libgee_la_SOURCES))
+ $(VALAC) --library gee $^
+ touch $@
+
+libgee_la_LIBADD = \
+ $(GLIB_LIBS) \
+ $(NULL)
+
+vapidir = $(datadir)/vala/vapi
+
+gee-1.0.vala: gee.vala
+ cp $^ $@
+
+dist_vapi_DATA = \
+ gee-1.0.vala \
+ $(NULL)
+
+EXTRA_DIST = gee.vala.stamp
Added: trunk/gee/arraylist.vala
==============================================================================
--- (empty file)
+++ trunk/gee/arraylist.vala Tue Jan 22 10:40:07 2008
@@ -0,0 +1,186 @@
+/* arraylist.vala
+ *
+ * Copyright (C) 2004-2005 Novell, Inc
+ * Copyright (C) 2005 David Waite
+ * Copyright (C) 2007 JÃrg Billeter
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2 of the License, or (at your option) any later version.
+
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * Lesser General Public License for more details.
+
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ *
+ * Author:
+ * JÃrg Billeter <j bitron ch>
+ */
+
+using GLib;
+
+/**
+ * Arrays of arbitrary elements which grow automatically as elements are added.
+ */
+public class Gee.ArrayList<G> : Iterable<G>, Collection<G>, List<G> {
+ public int size {
+ get { return _size; }
+ }
+
+ public EqualFunc equal_func {
+ set { _equal_func = value; }
+ }
+
+ private G[] _items = new G[4];
+ private int _size;
+ private EqualFunc _equal_func;
+
+ // concurrent modification protection
+ private int _stamp = 0;
+
+ public ArrayList (construct EqualFunc equal_func = GLib.direct_equal) {
+ }
+
+ public Gee.Iterator<G> iterator () {
+ return new Iterator<G> (this);
+ }
+
+ public bool contains (G item) {
+ return (index_of (item) != -1);
+ }
+
+ public int index_of (G item) {
+ for (int index = 0; index < _size; index++) {
+ if (_equal_func (_items[index], item)) {
+ return index;
+ }
+ }
+ return -1;
+ }
+
+ public G get (int index) {
+ assert (index >= 0 && index < _size);
+
+ return _items[index];
+ }
+
+ public void set (int index, G item) {
+ assert (index >= 0 && index < _size);
+
+ _items[index] = item;
+ }
+
+ public bool add (G item) {
+ if (_size == _items.length) {
+ grow_if_needed (1);
+ }
+ _items[_size++] = item;
+ _stamp++;
+ return true;
+ }
+
+ public void insert (int index, G item) {
+ assert (index >= 0 && index <= _size);
+
+ if (_size == _items.length) {
+ grow_if_needed (1);
+ }
+ shift (index, 1);
+ _items[index] = item;
+ _stamp++;
+ }
+
+ public bool remove (G item) {
+ for (int index = 0; index < _size; index++) {
+ if (_equal_func (_items[index], item)) {
+ remove_at (index);
+ return true;
+ }
+ }
+ return false;
+ }
+
+ public void remove_at (int index) {
+ assert (index >= 0 && index < _size);
+
+ _items[index] = null;
+
+ shift (index + 1, -1);
+
+ _stamp++;
+ }
+
+ public void clear () {
+ for (int index = 0; index < _size; index++) {
+ _items[index] = null;
+ }
+ _size = 0;
+ _stamp++;
+ }
+
+ private void shift (int start, int delta) {
+ assert (start >= 0 && start <= _size && start >= -delta);
+
+ _items.move (start, start + delta, _size - start);
+
+ _size += delta;
+ }
+
+ private void grow_if_needed (int new_count) {
+ assert (new_count >= 0);
+
+ int minimum_size = _size + new_count;
+ if (minimum_size > _items.length) {
+ // double the capacity unless we add even more items at this time
+ set_capacity (new_count > _items.length ? minimum_size : 2 * _items.length);
+ }
+ }
+
+ private void set_capacity (int value) {
+ assert (value >= _size);
+
+ _items.resize (value);
+ }
+
+ private class Iterator<G> : Gee.Iterator<G> {
+ public ArrayList<G> list {
+ set {
+ _list = value;
+ _stamp = _list._stamp;
+ }
+ }
+
+ private ArrayList<G> _list;
+ private int _index = -1;
+
+ // concurrent modification protection
+ public int _stamp = 0;
+
+ public Iterator (construct ArrayList! list) {
+ }
+
+ public bool next () {
+ assert (_stamp == _list._stamp);
+ if (_index < _list._size) {
+ _index++;
+ }
+ return (_index < _list._size);
+ }
+
+ public G get () {
+ assert (_stamp == _list._stamp);
+
+ if (_index < 0 || _index >= _list._size) {
+ return null;
+ }
+
+ return _list.get (_index);
+ }
+ }
+}
+
Added: trunk/gee/collection.vala
==============================================================================
--- (empty file)
+++ trunk/gee/collection.vala Tue Jan 22 10:40:07 2008
@@ -0,0 +1,68 @@
+/* collection.vala
+ *
+ * Copyright (C) 2007 JÃrg Billeter
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2 of the License, or (at your option) any later version.
+
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * Lesser General Public License for more details.
+
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ *
+ * Author:
+ * JÃrg Billeter <j bitron ch>
+ */
+
+/**
+ * Serves as the base interface for implementing collection classes. Defines
+ * size, iteration, and modification methods.
+ */
+public interface Gee.Collection<G> : Iterable<G> {
+ /**
+ * The number of items in this collection.
+ */
+ public abstract int size { get; }
+
+ /**
+ * Determines whether this collection contains the specified item.
+ *
+ * @param item the item to locate in the collection
+ *
+ * @return true if item is found, false otherwise
+ */
+ public abstract bool contains (G item);
+
+ /**
+ * Adds an item to this collection. Must not be called on read-only
+ * collections.
+ *
+ * @param item the item to add to the collection
+ *
+ * @return true if the collection has been changed, false otherwise
+ */
+ public abstract bool add (G item);
+
+ /**
+ * Removes the first occurence of an item from this collection. Must not
+ * be called on read-only collections.
+ *
+ * @param item the item to remove from the collection
+ *
+ * @return true if the collection has been changed, false otherwise
+ */
+ public abstract bool remove (G item);
+
+ /**
+ * Removes all items from this collection. Must not be called on
+ * read-only collections.
+ */
+ public abstract void clear ();
+}
+
Added: trunk/gee/gee.h
==============================================================================
--- (empty file)
+++ trunk/gee/gee.h Tue Jan 22 10:40:07 2008
@@ -0,0 +1,41 @@
+/* gee.h
+ *
+ * Copyright (C) 2007 JÃrg Billeter
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2 of the License, or (at your option) any later version.
+
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * Lesser General Public License for more details.
+
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ *
+ * Author:
+ * JÃrg Billeter <j bitron ch>
+ */
+
+#ifndef __GEE_H__
+#define __GEE_H__
+
+#include <gee/arraylist.h>
+#include <gee/collection.h>
+#include <gee/hashmap.h>
+#include <gee/hashset.h>
+#include <gee/iterable.h>
+#include <gee/iterator.h>
+#include <gee/list.h>
+#include <gee/map.h>
+#include <gee/readonlycollection.h>
+#include <gee/readonlylist.h>
+#include <gee/readonlymap.h>
+#include <gee/readonlyset.h>
+#include <gee/set.h>
+
+#endif
+
Added: trunk/gee/hashmap.vala
==============================================================================
--- (empty file)
+++ trunk/gee/hashmap.vala Tue Jan 22 10:40:07 2008
@@ -0,0 +1,332 @@
+/* hashmap.vala
+ *
+ * Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald
+ * Copyright (C) 1997-2000 GLib Team and others
+ * Copyright (C) 2007 JÃrg Billeter
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2 of the License, or (at your option) any later version.
+
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * Lesser General Public License for more details.
+
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ *
+ * Author:
+ * JÃrg Billeter <j bitron ch>
+ */
+
+using GLib;
+
+/**
+ * Hashtable implementation of the Map interface.
+ */
+public class Gee.HashMap<K,V> : Map<K,V> {
+ public int size {
+ get { return _nnodes; }
+ }
+
+ public HashFunc key_hash_func {
+ set { _key_hash_func = value; }
+ }
+
+ public EqualFunc key_equal_func {
+ set { _key_equal_func = value; }
+ }
+
+ public EqualFunc value_equal_func {
+ set { _value_equal_func = value; }
+ }
+
+ private int _array_size;
+ private int _nnodes;
+ private Node<K,V>[] _nodes;
+
+ // concurrent modification protection
+ private int _stamp = 0;
+
+ private HashFunc _key_hash_func;
+ private EqualFunc _key_equal_func;
+ private EqualFunc _value_equal_func;
+
+ private const int MIN_SIZE = 11;
+ private const int MAX_SIZE = 13845163;
+
+ public HashMap (construct HashFunc key_hash_func = GLib.direct_hash, construct EqualFunc key_equal_func = GLib.direct_equal, construct EqualFunc value_equal_func = GLib.direct_equal) {
+ }
+
+ construct {
+ _array_size = MIN_SIZE;
+ _nodes = new Node<K,V>[_array_size];
+ }
+
+ public Set<K> get_keys () {
+ return new KeySet<K,V> (this);
+ }
+
+ public Collection<V> get_values () {
+ return new ValueCollection<K,V> (this);
+ }
+
+ private Node<K,V>* lookup_node (K key) {
+ uint hash_value = _key_hash_func (key);
+ Node<K,V>* node = &_nodes[hash_value % _array_size];
+ while ((*node) != null && (hash_value != (*node).key_hash || !_key_equal_func ((*node).key, key))) {
+ node = &((*node).next);
+ }
+ return node;
+ }
+
+ public bool contains (K key) {
+ Node<K,V>* node = lookup_node (key);
+ return (*node != null);
+ }
+
+ public V get (K key) {
+ weak Node<K,V> node = *lookup_node (key);
+ if (node != null) {
+ return node.value;
+ } else {
+ return null;
+ }
+ }
+
+ public void set (K key, V value) {
+ Node<K,V>* node = lookup_node (key);
+ if (*node != null) {
+ (*node).value = value;
+ } else {
+ uint hash_value = _key_hash_func (key);
+ *node = new Node<K,V> (key, value, hash_value);
+ _nnodes++;
+ resize ();
+ }
+ _stamp++;
+ }
+
+ public bool remove (K key) {
+ Node<K,V>* node = lookup_node (key);
+ if (*node != null) {
+ (*node).key = null;
+ (*node).value = null;
+ *node = (*node).next;
+ _nnodes--;
+ resize ();
+ _stamp++;
+ return true;
+ }
+ return false;
+ }
+
+ public void clear () {
+ for (int i = 0; i < _array_size; i++) {
+ Node<K,V> node = #_nodes[i];
+ while (node != null) {
+ Node next = #node.next;
+ node.key = null;
+ node.value = null;
+ node = #next;
+ }
+ }
+ _nnodes = 0;
+ resize ();
+ }
+
+ private void resize () {
+ if ((_array_size >= 3 * _nnodes && _array_size >= MIN_SIZE) ||
+ (3 * _array_size <= _nnodes && _array_size < MAX_SIZE)) {
+ int new_array_size = SpacedPrimes.closest (_nnodes);
+ new_array_size = new_array_size.clamp (MIN_SIZE, MAX_SIZE);
+
+ Node<K,V>[] new_nodes = new Node<K,V>[new_array_size];
+
+ for (int i = 0; i < _array_size; i++) {
+ Node<K,V> node;
+ Node<K,V> next;
+ for (node = #_nodes[i]; node != null; node = #next) {
+ next = #node.next;
+ uint hash_val = node.key_hash % new_array_size;
+ node.next = #new_nodes[hash_val];
+ new_nodes[hash_val] = #node;
+ }
+ }
+ _nodes = #new_nodes;
+ _array_size = new_array_size;
+ }
+ }
+
+ ~HashSet () {
+ clear ();
+ }
+
+ [ReferenceType]
+ private struct Node<K,V> {
+ public K key;
+ public V value;
+ public Node<K,V> next;
+ public uint key_hash;
+
+ public Node (K# k, V# v, uint hash) {
+ key = #k;
+ value = #v;
+ key_hash = hash;
+ }
+ }
+
+ private class KeySet<K,V> : Iterable<K>, Collection<K>, Set<K> {
+ public HashMap<K,V> map {
+ set { _map = value; }
+ }
+
+ private HashMap<K,V> _map;
+
+ public KeySet (construct HashMap! map) {
+ }
+
+ public Iterator<K> iterator () {
+ return new KeyIterator<K,V> (_map);
+ }
+
+ public int size {
+ get { return _map.size; }
+ }
+
+ public bool add (K key) {
+ assert_not_reached ();
+ return false;
+ }
+
+ public void clear () {
+ assert_not_reached ();
+ }
+
+ public bool remove (K key) {
+ assert_not_reached ();
+ return false;
+ }
+
+ public bool contains (K key) {
+ return _map.contains (key);
+ }
+ }
+
+ private class KeyIterator<K,V> : Iterator<K> {
+ public HashMap<K,V> map {
+ set {
+ _map = value;
+ _stamp = _map._stamp;
+ }
+ }
+
+ private HashMap<K,V> _map;
+ private int _index = -1;
+ private weak Node<K,V> _node;
+
+ // concurrent modification protection
+ private int _stamp;
+
+ public KeyIterator (construct HashMap! map) {
+ }
+
+ public bool next () {
+ if (_node != null) {
+ _node = _node.next;
+ }
+ while (_node == null && _index + 1 < _map._array_size) {
+ _index++;
+ _node = _map._nodes[_index];
+ }
+ return (_node != null);
+ }
+
+ public K get () {
+ assert (_stamp == _map._stamp);
+ assert (_node != null);
+ return _node.key;
+ }
+ }
+
+ private class ValueCollection<K,V> : Iterable<V>, Collection<V> {
+ public HashMap<K,V> map {
+ set { _map = value; }
+ }
+
+ private HashMap<K,V> _map;
+
+ public ValueCollection (construct HashMap! map) {
+ }
+
+ public Iterator<V> iterator () {
+ return new ValueIterator<K,V> (_map);
+ }
+
+ public int size {
+ get { return _map.size; }
+ }
+
+ public bool add (V value) {
+ assert_not_reached ();
+ }
+
+ public void clear () {
+ assert_not_reached ();
+ }
+
+ public bool remove (V value) {
+ assert_not_reached ();
+ }
+
+ public bool contains (V value) {
+ Iterator<V> it = iterator ();
+ while (it.next ()) {
+ if (_map._value_equal_func (it.get (), value)) {
+ return true;
+ }
+ }
+ return false;
+ }
+ }
+
+ private class ValueIterator<K,V> : Iterator<V> {
+ public HashMap<K,V> map {
+ set {
+ _map = value;
+ _stamp = _map._stamp;
+ }
+ }
+
+ private HashMap<V,K> _map;
+ private int _index = -1;
+ private weak Node<K,V> _node;
+
+ // concurrent modification protection
+ private int _stamp;
+
+ public ValueIterator (construct HashMap! map) {
+ }
+
+ public bool next () {
+ if (_node != null) {
+ _node = _node.next;
+ }
+ while (_node == null && _index + 1 < _map._array_size) {
+ _index++;
+ _node = _map._nodes[_index];
+ }
+ return (_node != null);
+ }
+
+ public V get () {
+ assert (_stamp == _map._stamp);
+ assert (_node != null);
+ return _node.value;
+ }
+ }
+}
+
Added: trunk/gee/hashset.vala
==============================================================================
--- (empty file)
+++ trunk/gee/hashset.vala Tue Jan 22 10:40:07 2008
@@ -0,0 +1,202 @@
+/* hashset.vala
+ *
+ * Copyright (C) 1995-1997 Peter Mattis, Spencer Kimball and Josh MacDonald
+ * Copyright (C) 1997-2000 GLib Team and others
+ * Copyright (C) 2007 JÃrg Billeter
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2 of the License, or (at your option) any later version.
+
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * Lesser General Public License for more details.
+
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ *
+ * Author:
+ * JÃrg Billeter <j bitron ch>
+ */
+
+using GLib;
+
+/**
+ * Hashtable implementation of the Set interface.
+ */
+public class Gee.HashSet<G> : Iterable<G>, Collection<G>, Set<G> {
+ public int size {
+ get { return _nnodes; }
+ }
+
+ public HashFunc hash_func {
+ set { _hash_func = value; }
+ }
+
+ public EqualFunc equal_func {
+ set { _equal_func = value; }
+ }
+
+ private int _array_size;
+ private int _nnodes;
+ private Node<G>[] _nodes;
+
+ // concurrent modification protection
+ private int _stamp = 0;
+
+ private HashFunc _hash_func;
+ private EqualFunc _equal_func;
+
+ private const int MIN_SIZE = 11;
+ private const int MAX_SIZE = 13845163;
+
+ public HashSet (construct HashFunc hash_func = GLib.direct_hash, construct EqualFunc equal_func = GLib.direct_equal) {
+ }
+
+ construct {
+ _array_size = MIN_SIZE;
+ _nodes = new Node<G>[_array_size];
+ }
+
+ private Node<G>* lookup_node (G key) {
+ uint hash_value = _hash_func (key);
+ Node<G>* node = &_nodes[hash_value % _array_size];
+ while ((*node) != null && (hash_value != (*node).key_hash || !_equal_func ((*node).key, key))) {
+ node = &((*node).next);
+ }
+ return node;
+ }
+
+ public bool contains (G key) {
+ Node<G>* node = lookup_node (key);
+ return (*node != null);
+ }
+
+ public Gee.Iterator<G> iterator () {
+ return new Iterator<G> (this);
+ }
+
+ public bool add (G key) {
+ Node<G>* node = lookup_node (key);
+ if (*node != null) {
+ return false;
+ } else {
+ uint hash_value = _hash_func (key);
+ *node = new Node<G> (key, hash_value);
+ _nnodes++;
+ resize ();
+ _stamp++;
+ return true;
+ }
+ }
+
+ public bool remove (G key) {
+ Node<G>* node = lookup_node (key);
+ if (*node != null) {
+ (*node).key = null;
+ *node = (*node).next;
+ _nnodes--;
+ resize ();
+ _stamp++;
+ return true;
+ }
+ return false;
+ }
+
+ public void clear () {
+ for (int i = 0; i < _array_size; i++) {
+ Node<G> node = #_nodes[i];
+ while (node != null) {
+ Node next = #node.next;
+ node.key = null;
+ node = #next;
+ }
+ }
+ _nnodes = 0;
+ resize ();
+ }
+
+ private void resize () {
+ if ((_array_size >= 3 * _nnodes && _array_size >= MIN_SIZE) ||
+ (3 * _array_size <= _nnodes && _array_size < MAX_SIZE)) {
+ int new_array_size = SpacedPrimes.closest (_nnodes);
+ new_array_size = new_array_size.clamp (MIN_SIZE, MAX_SIZE);
+
+ Node<G>[] new_nodes = new Node<G>[new_array_size];
+
+ for (int i = 0; i < _array_size; i++) {
+ Node<G> node;
+ Node<G> next;
+ for (node = #_nodes[i]; node != null; node = #next) {
+ next = #node.next;
+ uint hash_val = node.key_hash % new_array_size;
+ node.next = #new_nodes[hash_val];
+ new_nodes[hash_val] = #node;
+ }
+ }
+ _nodes = #new_nodes;
+ _array_size = new_array_size;
+ }
+ }
+
+ ~HashSet () {
+ clear ();
+ }
+
+ [ReferenceType]
+ private struct Node<G> {
+ public G key;
+ public Node<G> next;
+ public uint key_hash;
+
+ public Node (G# k, uint hash) {
+ key = #k;
+ key_hash = hash;
+ }
+ }
+
+ private class Iterator<G> : Gee.Iterator<G> {
+ public HashSet<G> set {
+ set {
+ _set = value;
+ _stamp = _set._stamp;
+ // find first node
+ while (_node == null && _index + 1 < _set._array_size) {
+ _index++;
+ _node = _set._nodes[_index];
+ }
+ }
+ }
+
+ private HashSet<G> _set;
+ private int _index = -1;
+ private weak Node<G> _node;
+
+ // concurrent modification protection
+ private int _stamp = 0;
+
+ public Iterator (construct HashSet! set) {
+ }
+
+ public bool next () {
+ if (_node != null) {
+ _node = _node.next;
+ }
+ while (_node == null && _index + 1 < _set._array_size) {
+ _index++;
+ _node = _set._nodes[_index];
+ }
+ return (_node != null);
+ }
+
+ public G get () {
+ assert (_stamp == _set._stamp);
+ assert (_node != null);
+ return _node.key;
+ }
+ }
+}
+
Added: trunk/gee/iterable.vala
==============================================================================
--- (empty file)
+++ trunk/gee/iterable.vala Tue Jan 22 10:40:07 2008
@@ -0,0 +1,37 @@
+/* iterable.vala
+ *
+ * Copyright (C) 2007 JÃrg Billeter
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2 of the License, or (at your option) any later version.
+
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * Lesser General Public License for more details.
+
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ *
+ * Author:
+ * JÃrg Billeter <j bitron ch>
+ */
+
+/**
+ * Implemented by classes that support a simple iteration over instances of the
+ * collection.
+ */
+public interface Gee.Iterable<G> {
+ /**
+ * Returns a Iterator that can be used for simple iteration over a
+ * collection.
+ *
+ * @return a Iterator that can be used for simple iteration over a
+ * collection
+ */
+ public abstract Iterator<G> iterator ();
+}
+
Added: trunk/gee/iterator.vala
==============================================================================
--- (empty file)
+++ trunk/gee/iterator.vala Tue Jan 22 10:40:07 2008
@@ -0,0 +1,42 @@
+/* iterator.vala
+ *
+ * Copyright (C) 2007 JÃrg Billeter
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2 of the License, or (at your option) any later version.
+
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * Lesser General Public License for more details.
+
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ *
+ * Author:
+ * JÃrg Billeter <j bitron ch>
+ */
+
+/**
+ * Implemented by classes that support a simple iteration over instances of the
+ * collection.
+ */
+public interface Gee.Iterator<G> {
+ /**
+ * Advances to the next element in the iteration.
+ *
+ * @return true if the iterator has a next element
+ */
+ public abstract bool next ();
+
+ /**
+ * Returns the current element in the iteration.
+ *
+ * @return the current element in the iteration
+ */
+ public abstract G get ();
+}
+
Added: trunk/gee/list.vala
==============================================================================
--- (empty file)
+++ trunk/gee/list.vala Tue Jan 22 10:40:07 2008
@@ -0,0 +1,67 @@
+/* list.vala
+ *
+ * Copyright (C) 2007 JÃrg Billeter
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2 of the License, or (at your option) any later version.
+
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * Lesser General Public License for more details.
+
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ *
+ * Author:
+ * JÃrg Billeter <j bitron ch>
+ */
+
+/**
+ * Represents a collection of items in a well-defined order.
+ */
+public interface Gee.List<G> : GLib.Object, Collection<G> {
+ /**
+ * Returns the item at the specified index in this list.
+ *
+ * @param index zero-based index of the item to be returned
+ *
+ * @return the item at the specified index in the list
+ */
+ public abstract G get (int index);
+
+ /**
+ * Sets the item at the specified index in this list.
+ *
+ * @param index zero-based index of the item to be set
+ */
+ public abstract void set (int index, G item);
+
+ /**
+ * Returns the index of the first occurence of the specified item in
+ * this list.
+ *
+ * @return the index of the first occurence of the specified item, or
+ * -1 if the item could not be found
+ */
+ public abstract int index_of (G item);
+
+ /**
+ * Inserts an item into this list at the specified position.
+ *
+ * @param index zero-based index at which item is inserted
+ * @param item item to insert into the list
+ */
+ public abstract void insert (int index, G item);
+
+ /**
+ * Removes the item at the specified index of this list.
+ *
+ * @param index zero-based index of the item to be removed
+ */
+ public abstract void remove_at (int index);
+}
+
Added: trunk/gee/map.vala
==============================================================================
--- (empty file)
+++ trunk/gee/map.vala Tue Jan 22 10:40:07 2008
@@ -0,0 +1,88 @@
+/* map.vala
+ *
+ * Copyright (C) 2007 JÃrg Billeter
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2 of the License, or (at your option) any later version.
+
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * Lesser General Public License for more details.
+
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ *
+ * Author:
+ * JÃrg Billeter <j bitron ch>
+ */
+
+/**
+ * A map is a generic collection of key/value pairs.
+ */
+public interface Gee.Map<K,V> {
+ /**
+ * The number of items in this map.
+ */
+ public abstract int size { get; }
+
+ /**
+ * Returns the keys of this map as a read-only set.
+ *
+ * @return the keys of the map
+ */
+ public abstract Set<K> get_keys ();
+
+ /**
+ * Returns the values of this map as a read-only collection.
+ *
+ * @return the values of the map
+ */
+ public abstract Collection<V> get_values ();
+
+ /**
+ * Determines whether this map contains the specified key.
+ *
+ * @param key the key to locate in the map
+ *
+ * @return true if key is found, false otherwise
+ */
+ public abstract bool contains (K key);
+
+ /**
+ * Returns the value of the specified key in this map.
+ *
+ * @param key the key whose value is to be retrieved
+ *
+ * @return the value associated with the key, or null if the key
+ * couldn't be found
+ */
+ public abstract V get (K key);
+
+ /**
+ * Inserts a new key and value into this map.
+ *
+ * @param key the key to insert
+ * @param value the value to associate with the key
+ */
+ public abstract void set (K key, V value);
+
+ /**
+ * Removes the specified key from this map.
+ *
+ * @param key the key to remove from the map
+ *
+ * @return true if the map has been changed, false otherwise
+ */
+ public abstract bool remove (K key);
+
+ /**
+ * Removes all items from this collection. Must not be called on
+ * read-only collections.
+ */
+ public abstract void clear ();
+}
+
Added: trunk/gee/readonlycollection.vala
==============================================================================
--- (empty file)
+++ trunk/gee/readonlycollection.vala Tue Jan 22 10:40:07 2008
@@ -0,0 +1,82 @@
+/* readonlycollection.vala
+ *
+ * Copyright (C) 2007 JÃrg Billeter
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2 of the License, or (at your option) any later version.
+
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * Lesser General Public License for more details.
+
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ *
+ * Author:
+ * JÃrg Billeter <j bitron ch>
+ */
+
+using GLib;
+
+/**
+ * Represents a read-only collection of items.
+ */
+public class Gee.ReadOnlyCollection<G> : Iterable<G>, Collection<G> {
+ public int size {
+ get { return _collection.size; }
+ }
+
+ public Collection<G> collection {
+ set { _collection = value; }
+ }
+
+ private Collection<G> _collection;
+
+ public ReadOnlyCollection (construct Collection<G> collection = null) {
+ }
+
+ public Gee.Iterator<G> iterator () {
+ if (_collection == null) {
+ return new Iterator<G> ();
+ }
+
+ return _collection.iterator ();
+ }
+
+ public bool contains (G item) {
+ if (_collection == null) {
+ return false;
+ }
+
+ return _collection.contains (item);
+ }
+
+ public bool add (G item) {
+ assert_not_reached ();
+ return false;
+ }
+
+ public bool remove (G item) {
+ assert_not_reached ();
+ return false;
+ }
+
+ public void clear () {
+ assert_not_reached ();
+ }
+
+ private class Iterator<G> : Gee.Iterator<G> {
+ public bool next () {
+ return false;
+ }
+
+ public G get () {
+ return null;
+ }
+ }
+}
+
Added: trunk/gee/readonlylist.vala
==============================================================================
--- (empty file)
+++ trunk/gee/readonlylist.vala Tue Jan 22 10:40:07 2008
@@ -0,0 +1,110 @@
+/* readonlylist.vala
+ *
+ * Copyright (C) 2007 JÃrg Billeter
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2 of the License, or (at your option) any later version.
+
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * Lesser General Public License for more details.
+
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ *
+ * Author:
+ * JÃrg Billeter <j bitron ch>
+ */
+
+using GLib;
+
+/**
+ * Represents a read-only collection of items in a well-defined order.
+ */
+public class Gee.ReadOnlyList<G> : Iterable<G>, Collection<G>, List<G> {
+ public int size {
+ get { return _list.size; }
+ }
+
+ public List<G> list {
+ set { _list = value; }
+ }
+
+ private List<G> _list;
+
+ public ReadOnlyList (construct List<G> list = null) {
+ }
+
+ public Gee.Iterator<G> iterator () {
+ if (_list == null) {
+ return new Iterator<G> ();
+ }
+
+ return _list.iterator ();
+ }
+
+ public bool contains (G item) {
+ if (_list == null) {
+ return false;
+ }
+
+ return _list.contains (item);
+ }
+
+ public int index_of (G item) {
+ if (_list == null) {
+ return -1;
+ }
+
+ return _list.index_of (item);
+ }
+
+ public bool add (G item) {
+ assert_not_reached ();
+ return false;
+ }
+
+ public bool remove (G item) {
+ assert_not_reached ();
+ return false;
+ }
+
+ public void insert (int index, G item) {
+ assert_not_reached ();
+ }
+
+ public void remove_at (int index) {
+ assert_not_reached ();
+ }
+
+ public G get (int index) {
+ if (_list == null) {
+ return null;
+ }
+
+ return _list.get (index);
+ }
+
+ public void set (int index, G o) {
+ assert_not_reached ();
+ }
+
+ public void clear () {
+ assert_not_reached ();
+ }
+
+ class Iterator<G> : Gee.Iterator<G> {
+ public bool next () {
+ return false;
+ }
+
+ public G get () {
+ return null;
+ }
+ }
+}
+
Added: trunk/gee/readonlymap.vala
==============================================================================
--- (empty file)
+++ trunk/gee/readonlymap.vala Tue Jan 22 10:40:07 2008
@@ -0,0 +1,87 @@
+/* readonlymap.vala
+ *
+ * Copyright (C) 2007 JÃrg Billeter
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2 of the License, or (at your option) any later version.
+
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * Lesser General Public License for more details.
+
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ *
+ * Author:
+ * JÃrg Billeter <j bitron ch>
+ */
+
+using GLib;
+
+/**
+ * Represents a read-only collection of key/value pairs.
+ */
+public class Gee.ReadOnlyMap<K,V> : Map<K,V> {
+ public int size {
+ get { return _map.size; }
+ }
+
+ public Map<K,V> map {
+ set { _map = value; }
+ }
+
+ private Map<K,V> _map;
+
+ public ReadOnlyMap (construct Map<K,V> map = null) {
+ }
+
+ public Set<K> get_keys () {
+ if (_map == null) {
+ return new ReadOnlySet<K> ();
+ }
+
+ return _map.get_keys ();
+ }
+
+ public Collection<V> get_values () {
+ if (_map == null) {
+ return new ReadOnlyCollection<V> ();
+ }
+
+ return _map.get_values ();
+ }
+
+ public bool contains (K key) {
+ if (_map == null) {
+ return false;
+ }
+
+ return _map.contains (key);
+ }
+
+ public V get (K key) {
+ if (_map == null) {
+ return null;
+ }
+
+ return _map.get (key);
+ }
+
+ public void set (K key, V value) {
+ assert_not_reached ();
+ }
+
+ public bool remove (K key) {
+ assert_not_reached ();
+ return false;
+ }
+
+ public void clear () {
+ assert_not_reached ();
+ }
+}
+
Added: trunk/gee/readonlyset.vala
==============================================================================
--- (empty file)
+++ trunk/gee/readonlyset.vala Tue Jan 22 10:40:07 2008
@@ -0,0 +1,82 @@
+/* readonlyset.vala
+ *
+ * Copyright (C) 2007 JÃrg Billeter
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2 of the License, or (at your option) any later version.
+
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * Lesser General Public License for more details.
+
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ *
+ * Author:
+ * JÃrg Billeter <j bitron ch>
+ */
+
+using GLib;
+
+/**
+ * Represents a read-only collection of items without duplicates.
+ */
+public class Gee.ReadOnlySet<G> : Iterable<G>, Collection<G>, Set<G> {
+ public int size {
+ get { return _set.size; }
+ }
+
+ public Set<G> set {
+ set { _set = value; }
+ }
+
+ private Set<G> _set;
+
+ public ReadOnlySet (construct Set<G> set = null) {
+ }
+
+ public Gee.Iterator<G> iterator () {
+ if (_set == null) {
+ return new Iterator<G> ();
+ }
+
+ return _set.iterator ();
+ }
+
+ public bool contains (G item) {
+ if (_set == null) {
+ return false;
+ }
+
+ return _set.contains (item);
+ }
+
+ public bool add (G item) {
+ assert_not_reached ();
+ return false;
+ }
+
+ public bool remove (G item) {
+ assert_not_reached ();
+ return false;
+ }
+
+ public void clear () {
+ assert_not_reached ();
+ }
+
+ private class Iterator<G> : Gee.Iterator<G> {
+ public bool next () {
+ return false;
+ }
+
+ public G get () {
+ return null;
+ }
+ }
+}
+
Added: trunk/gee/set.vala
==============================================================================
--- (empty file)
+++ trunk/gee/set.vala Tue Jan 22 10:40:07 2008
@@ -0,0 +1,28 @@
+/* set.vala
+ *
+ * Copyright (C) 2007 JÃrg Billeter
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2 of the License, or (at your option) any later version.
+
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * Lesser General Public License for more details.
+
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ *
+ * Author:
+ * JÃrg Billeter <j bitron ch>
+ */
+
+/**
+ * A set is a collection without duplicates.
+ */
+public interface Gee.Set<G> : Collection<G> {
+}
+
[
Date Prev][
Date Next] [
Thread Prev][
Thread Next]
[
Thread Index]
[
Date Index]
[
Author Index]
