Free zip codes software for linux

Zipios++ project is a java.util.zip-like C++ library for reading and writing Zip files. Access to individual entries is provided through standard C++ iostreams. A simple read-only virtual file system that mounts regular directories and zip files is also provided.

Spanned archives are not supported, and support is not planned.

The library has been tested and appears to be working with:

FreeBSD stable and current / gcc 2.95.3
Red Hat Linux release 7.0 / gcc 2.96
Red Hat Linux release 6.2 (Zoot) / egcs-2.91.66
Linux Mandrake release 7.0 (Air) / gcc 2.95.2
SGI IRIX64 6.5 / gcc 2.95.2
SGI IRIX64 6.5 / MIPSpro Compilers: Version 7.30

Zip file access:

The two most important classes are ZipFile and ZipInputStream. ZipInputStream is an istream for reading zipfiles. It can be instantiated directly, without the use of ZipFile. A new ZipInputStream reads from the first entry, and the user can skip to the next entry by calling ZipInputStream::getNextEntry().

ZipFile scans the central directory of a zipfile and provides an interface to access that directory. The user may search for entries with a particular filename using ZipFile::getEntry(), or simply get the complete list of entries with ZipFile::entries(). To get an istream (ZipInputStream) to a particular entry simply use ZipFile::getInputStream().
example_zip.cpp demonstrates the central elements of Zipios++.

A Zip file appended to another file, e.g. a binary program, with the program appendzip, can be read with ZipFile::openEmbeddedZipFile().

Kenzip is a frontend for p7-zip.

You can create password protected 7z and zip archives with this python-qt3 utility

(Unfortunately ark does not support password protected archives.) KenZip has feasible dependency, you can install it to almost any existing distro.

It has been tested on OpenSuSE 10.2, Debian testing 2006.01. and Kanotix 2006-01-RC4 using the distros python qt3 package.

Do not forget to install python qt3 and p7-zip before! Prefer the distros package from repository for Debian based distributions, and the binary installer for other linux distros.

metazip project is an Apache 2.0 module that allows you to serve dynamically-constructed, uncompressed zip files. Thus, your users can choose to download individual files or entire collections, but you dont have to reserve disk space for both.
Main features:
- Extremely efficient, by hooking into Apaches filter system.
- Works equally well for zip, tar, and other archive files.
- Supports resumption of aborted downloads.
- Lightweight, self-contained C implementation.
- Free, open source license (Apache).
Version restrictions:
- Works for uncompressed archives only.
- Requires command line utility to construct .zip.mz "template" file.
- Currently only supported on Linux with GNU bash, gcc, and make.
metazip works by comparing a real, uncompressed archive to the files it contains. It then constructs a special .mz file that contains the "difference" between the files and the archive. This difference contains the metadata that the archive tool uses to extract the files. metazip does not interpret this metadata; it simply records it in the .mz file. After the .mz file has been created, the original archive file can be deleted. Simply place the newly-created .mz file in the same directory as the files it references. The mz command-line utility takes care of most of the details.
When the .mz file is requested, metazip "glues together" the files and the contents of the .mz file to reconstruct the archive file. Because metazip hooks into Apaches filter system, Apache handles all of the heavy lifting. metazip merely creates some high-level data structures.
Therefore, metazips overhead is practically negligible. In addition, Apaches normal functions for resuming aborted downloads, calculating the content length, setting headers, etc. work identically for static files and for metazips dynamically-generated output.
[Note: The only "catch" is that metazip must be prepared to handle its input in arbitrary-sized chunks (called "bucket brigades" in Apache-speak), even though in practice the input will generally be in one large buffer (because its input is the small .mz file). This is reflected in metazips code structure (in metazip.c), but is completely transparent to you.]

Geo:Coder:US 1.00 offers a full-feature facility for geocoding US addresses, that is, estimating the latitude and longitude of any street address or intersection in the United States, using the TIGER/Line data set from the US Census Bureau. Geo:Coder:US uses Geo:TigerLine to parse this data, and DB_File to store a highly compressed distillation of it, and Geo:StreetAddress:US to parse addresses into normalized components suitable for looking up in its database.

You can find a live demo of this code at http://geocoder.us/. The demo.cgi script is included in eg/ directory distributed with this module, along with a whole bunch of other goodies. See Geo:Coder:US:Import for how to build your own Geo:Coder:US database.

Consider using a web service to access this geocoder over the Internet, rather than going to all the trouble of building a database yourself. See eg/soap-client.pl, eg/xmlrpc-client.pl, and eg/rest-client.pl for different examples of working clients for the rpc.geocoder.us geocoder web service.

Major Features:

1. Geo:Coder:US->geocode( $string )
   • Given a string containing a street address or intersection, return a list of specifiers including latitude and longitude for all matching entities in the database. To keep from churning over the entire database, the given address string must contain either a city and state, or a ZIP code (or both), or geocode() will return undef.
   • geocode() will attempt to normalize directional prefixes and suffixes, street types, and state abbreviations, as well as substitute TIGER/Line's idea of the "primary street name", if an alternate street name was provided instead.
   • If geocode() can parse the address, but not find a match in the database, it will return a hashref containing the parsed and normalized address or intersection, but without the "lat" and "long" keys specifying the location. If geocode() cannot even parse the address, it will return undef. Be sure to check for the existence of "lat" and "long" keys in the hashes returned from geocode() before attempting to use the values! This serves to distinguish between addresses that cannot be found versus addresses that are completely unparseable.
   • geocode() attempts to be as forgiving as possible when geocoding an address. If you say "Mission Ave" and all it knows about is "Mission St", then "Mission St" is what you'll get back. If you leave off directional identifiers, geocode() will return address geocoded in all the variants it can find, i.e. both "N Main St" and "S Main St".
   • Don't be surprised if geocoding an intersection returns more than one lat/long pair for a single intersection. If one of the streets curves greatly or doglegs even slightly, this will be the likely outcome.
   • geocode() is probably the method you want to use. See more in the following section on the structure of the returned address and intersection specifiers.
2. Geo:Coder:US->geocode_address( $string )
   • Works exactly like geocode(), but only parses addresses.
3. Geo:Coder:US->geocode_intersection( $string )
   • Works exactly like geocode(), but only parses intersections.
4. Geo:Coder:US->filter_ranges( $spec, @candidates )
   • Filters a list of address specifiers (presumably from the database) against a query specifier, filtering by prefix, type, suffix, or primary name if possible. Returns a list of matching specifiers. filter_ranges() will ignore a filtering step if it would result in no specifiers being returned. You probably won't need to use this.
5. Geo:Coder:US->find_ranges( $address_spec )
   • Given a normalized address specifier, return all the address ranges in the database that appear to cover that address. find_ranges() ignores prefix, suffix, and type fields in the specifier for search purposes, and then filters against them ex post facto. The intention for find_ranges() to find the closest match possible in preference to returning nothing. You probably want to use lookup_ranges() instead, which will call find_ranges() for you.
6. Geo:Coder:US->lookup_ranges( $address_spec, @ranges )
   • Given an address specifier and (optionally) some address ranges from the database, interpolate the street address into the street segment referred to by the address range, and return a latitude and longitude for the given address within each of the given ranges. If @ranges is not given, lookup_ranges() calls find_ranges() with the given address specifier, and uses those returned. You probably want to just use geocode() instead, which also parses an address string and determines whether it's a proper address or an intersection automatically.
7. Geo:Coder:US->find_segments( $intersection_spec )
   • Given a normalized intersection specifier, find all of the street segments in the database matching the two given streets in the given locale or ZIP code. find_segments() ignores prefix, suffix, and type fields in the specifier for search purposes, and then filters against them ex post facto. The intention for find_segments() to find the closest match possible in preference to returning nothing. You probably want to use lookup_intersection() instead, which will call find_segments() for you.
8. Geo:Coder:US->lookup_intersection( $intersection_spec )
   • Given an intersection specifier, return all of the intersections in the database between the two streets specified, plus a latitude and longitude for each intersection. You probably want to just use geocode() instead, which also parses an address string and determines whether it's a proper address or an intersection automatically.

Requirements: Perl

BlueZip is a cross-platform compression utility.
Main features:
- clean interface
- full drag and drop support
- Zip support
- RAR support
Enhancements:
- This release of BlueZip brings official support for the Linux platform.
- Furthermore, this release implements read-only RAR support for Linux.

ICD Browser for the ICD-10 codes from W.H.O.
This program is an easy to use browser with search capability for the International Classification of Diseases (ICD) codes, as they are published from the W.H.O.
Main features:
- Three versions, for Windows (XP, 2000, 98), Linux and Pocket PC (WM2003, WM5).
- Two ways for displaying codes, Grouped all together into a treebox, or separeted into chapters, sections and subsections.
- Search codes.
- Easy to use interface.

HTML Code Convert helps speed up the conversion of HTML code into different format including Java Script, JavaServer Pages, Microsoft ASP, PHP, Perl, Python, and the UNIX Shell. It is particularly useful in CGI scripting.
Enhancements:
- Colors and font selected in prefeferences box.
- Fixe bug with Quit button. First try to support accessibility.
- Updated schemas.