Free fireplace inserts software for linux

Templayer is a layered template library for Python. Templayer currently supports only HTML generation, but its simple design is easily extended to support other file formats.
Templayer was created to offer an alternative to the more common ways of generating dynamic HTML: embedding code within the HTML (PHP etc.) , or embedding HTML within code (traditional CGI).
Neither of these methods allow for a clean separation of the form, or layout, of a page and the function of page generation. Instead of mixing HTML and Python, two rich and extremely expressive languages, we can add a small amount of syntax to each and keep the two separate and coherent.
Enhancements:
- Added a django_form convenience function for using Templayer with the Django web frameworks FormWrapper objects.
- Added an allow_degenerate parameter to Template.__init__. If set to True then a template file that is missing a contents block will be accepted and not cause an exception to be raised.
- Added a special layer name * that treats the entire contents of a template file as a layer.
- Added two new HTML Markup elements: - (pluralize,count,singular_markup,plural_markup) inserts singular_markup if count equals one, and plural_markup otherwise. - (&,entity) inserts the given HTML entity where valid entity values include "gt", "#161" and "#xA9".
- FileLayer.close now returns the file object to which it wrote.
- This simplifies the code required to use Templayer in Django view functions.
- Fixed a really obvious bug in the html_href function.

Tree::Binary::Search is a binary search tree for Perl.

SYNOPSIS

use Tree::Binary::Search;

my $btree = Tree::Binary::Search->new();

$btree->useNumericComparison();

$btree->insert(5 => "Five");
$btree->insert(2 => "Two");
$btree->insert(1 => "One");
$btree->insert(3 => "Three");
$btree->insert(4 => "Four");
$btree->insert(9 => "Nine");
$btree->insert(8 => "Eight");
$btree->insert(6 => "Six");
$btree->insert(7 => "Seven");

# this creates the following tree:
#
# +-------(5)----------+
# | |
# +-(2)-+ +-(9)
# | | |
# (1) (3)-+ +----(8)
# | |
# (4) (6)-+
# |
# (7)
#

$btree->exists(7); # return true

$btree->update(7 => "Seven (updated)");

$btree->select(9); # return Nine

$btree->min_key(); # returns 1

$btree->min(); # returns One

$btree->max_key(); # return 9

$btree->max(); # return Nine

$btree->delete(5);

# this results in the following tree:
#
# +-------(6)-------+
# | |
# +-(2)-+ +-(9)
# | | |
# (1) (3)-+ +-(8)
# | |
# (4) (7)
#

This module implements a binary search tree, which is a specialized usage of a binary tree. The basic principle is that all elements to the left are less than the root, all elements to the right are greater than the root. This reduces the search time for elements in the tree, by halving the number of nodes that need to be searched each time a node is examined.

Binary search trees are a very well understood data-structure and there is a wealth of information on the web about them.

Trees are a naturally recursive data-structure, and therefore, tend to lend themselves well to recursive traversal functions. I however, have chosen to implement the tree traversal in this module without using recursive subroutines. This is partially a performance descision, even though perl can handle theoreticaly unlimited recursion, subroutine calls to have some overhead. My algorithm is still recursive, I have just chosen to keep it within a single subroutine.

packet2sql converts any text file/log file which contains ipchains packet logs into a stream of SQL inserts.
If called with no options, packet2sql will read the log input from stdin. Since syslog dates do not include the year, packet2sql will assign one. If the month of a log entry comes after the current month, it assigns the previous year, otherwise it assigns the current year. This is helpful for processing Decembers logs in January. It is also helpful for people who archive logs and wish to recreate them. You can also use the -y option to override the
month guessing heuristic and assign one yourself. The option -y 1998 will assign the year 1998 to all log files specified after the -y option. Note that if you use the -y option and wish to read log entries from stdin, you must specify - for the file to read from.
Enhancements:
- Made it possible to install somewhere else with INSTALL_PREFIX env. var
- Fix for occasional misaligned IP address fields (Closes 465208) (schuppy)

FProfiler project is a Java profiler for finding hotspots in Java libs/apps.
FProfiler is a Java Profiler using BCEL and log4j.
Its very fast because it inserts the needed instructions into the Bytecode of the classes. It can be used to find Hotspots in Java programs, libs, and servlet environments--simply every Java class.
Enhancements:
- Mark Atwell fixed a bug with are branch (jump/goto) instructions directly to the return statement bypassing the stop call.

Algorithm::SkipList is a Perl implementation of skip lists.

SYNOPSIS

my $list = new Algorithm::SkipList();

$list->insert( key1, value );
$list->insert( key2, another value );

$value = $list->find(key2);

$list->delete(key1);

This is an implementation of skip lists in Perl.

Skip lists are similar to linked lists, except that they have random links at various levels that allow searches to skip over sections of the list, like so:

4 +---------------------------> +----------------------> +
| | |
3 +------------> +------------> +-------> +-------> +--> +
| | | | | |
2 +-------> +--> +-------> +--> +--> +--> +-------> +--> +
| | | | | | | | |
1 +--> +--> +--> +--> +--> +--> +--> +--> +--> +--> +--> +
A B C D E F G H I J NIL

A search would start at the top level: if the link to the right exceeds the target key, then it descends a level.

Skip lists generally perform as well as balanced trees for searching but do not have the overhead with respect to inserting new items. See the included file Benchmark.txt for a comparison of performance with other Perl modules.

The purpose of this project is to provide a simple, generic GUI database browsing frontend. The tool is a very simple aggregation of the Qt database classes.
The database abstraction is provided by the Qt database drivers. So far, the drivers for PostgreSQL and MySQL have been found to work well.
In principle, there is no reason why ODBC drivers for popular databases such as Oracle, DB2, Informix as well as Firebird and SAP/DB shouldnt work via the Qt ODBC3 abstraction layer.
However, some preliminary tests with these have not been promising. It may be that the only way to get some of these working is to create a native Qt database driver. This is something Ill be looking into much later.
At the moment, it is only possible to build the system on Unix and similar systems. Since Trolltech have released a version of Qt for OSX under the GPL and have announced their intention to do likewise for Win32, it should be possible to provide ports for both of these platforms. For the moment though, I just provide the source.
Main features:
- Tree browser for databases and tables
- Display of table descriptions
- Display of table contents in main window
- Execution of ad-hoc SQL queries in the query tab
- Command line history in the query tab
- Retrieval of database connection details from XML config file
- Retrieval of other configuration parameters from XML config file
- Prompting for connection password
- Addition of new connections via GUI to the running application and the config file
- Display database views with a separate icon
- Create a connection name independent of the database name
- A "Test" button when creating a new connection
- Dynamically generate a list of available drivers
- Configuration via autoconf
- Fixed bug with executing updates/inserts twice
- Refreshing of a DB connection
- Deleting of connections via the GUI
- Editting of connections via the GUI
- Check for the existence of ~/.qtsql
- Creation of skeleton config file
- Auto saving/restoring of history
- Loading of queries
- Saving of results
- Keyboard shortcuts

squid_redirect uses a list of patterns to zap annoying ad banners from Web pages, inserting a placeholder image.
It lives in a Web proxy and so requires no special browser facilities. squid_redirect is readily customizable, small, fast, and easy to install.
Enhancements:
- A security fix was made for pathological behavior for certain URLs.
- A new ad class was added for text-only ads, which are off by default.

WAVE Utilities package contains three programs for dealing with WAVE format audio files.
SimplifyWave
The standard permits WAVE format audio files to contain a variety of chunks, such as playlists, cue lists, and padding. A fair amount of software, however, is unable to parse such complex files. This program converts complex WAVE files into the simplest standard-conforming format by stripping out everything other than the obligatory format chunk and the first data chunk. Messages are printed indicating what chunks have been removed.
RepairWave
Some software generates non-conformant files that purport to be WAVE files. They contain a WAVE header but lack the obligatory data chunk id and size information. The audio data immediately follows the header. This program inserts the missing data chunk id and size information and updates the WAVE chunk size information in the header to reflect this.
InfoWave
Extracts information from a RIFF/WAV or RIFX/WAV file and reports on the contents of the file. It shows the size, type, and location of each chunk and gives the encoding of the audio data, its sampling rate, resolution, number of channels and other information. Typical output looks like this:
0: RIFF identifier.
4: chunk size = 38,642 bytes.
8: WAV identifier.
12: format chunk identifier
16: format chunk size = 18 bytes.
20: data format: PCM.
22: one channel (mono).
24: Sampling Rate = 11,025 samples per second.
28: Average Data Rate = 11,025 bytes per second.
32: Bytes_Per_Sample value of 1 indicates 8-bit mono
34: Bits_Per_Sample = 8.
36: chunk id
40: chunk length
44: chunk of type fact (standard) length 4 bytes
48: chunk id
52: chunk length
56: chunk of type data (standard) length 38,591 bytes
amounting to 0 minutes and 3.5 seconds
These programs were originally called SimplifyWav, wavrepair, and wavinfo.
Enhancements:
- The programs have been adapted to run correctly on 64-bit architectures as well as 32-bit architectures.
- They should now compile on systems whose printf does not support thousands separators.