Main > Free Download Search >

Free one tree hill software for linux

one tree hill

Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 1054
Image Tree 1.0

Image Tree 1.0


Image Tree is a complete and versatile photo publishing system in less than 200 lines of code. more>>
Image Tree is a complete and versatile photo publishing system in less than 200 lines of code.

ImgTree is based only on three files:

index php : contains all the php and html code. Must be put, unmodified in every folder of the directory tree.
data.php : contains the specific settings of every folder
style.css : the css style sheet

Every folder of the folder tree must contain the three files. Clearly index.php and style.php should be simply linked:

imgtree/
|-- data.php
|-- index.php
|-- style.css
|-- Section-A
| |-- data.php
| |-- index.php -> ../index.php
| |-- style.css -> ../style.css
| |-- 01-thumb.jpg
| |-- 01.jpg
| |-- 02-thumb.jpg
| |-- 02.jpg
| `-- ...
`-- Section-B
|-- data.php
|-- index.php -> ../index.php
|-- style.css -> ../style.css
|-- 00.jpg
|-- Subsection-B1
| |-- data.php
| |-- index.php -> ../index.php
| `-- style.css -> ../style.css
| |-- cover.jpg
`-- Subsection-B2
|-- data.php
|-- index.php -> ../index.php
|-- style.css -> ../style.css
|-- 01-thumb.jpg
|-- 01.jpg
|-- 02-thumb.jpg
|-- 02.jpg
`-- ...

Every folder act as a section and the behaviour can be choose between:

index : Contains a list of links to every subfolder of the current folder. For every section an image and a description are shown.
thumb : Thumbnails page. Shows every image file of the folder. Thumbnail must be named "xxx-thumb.jpg" for the xxx.jpg file. Ex: 01-thumb.jpg -> 01.jpg ; tramonto-thumb.jpg -> tramonto.jpg ; ecc.
cover : Cover page. Shows an image, a text and an associated link

The file data.php contin the settings specific for every section:

$gallerystart : is the gallery start to generate the back-menu. The path must be relative to the starting folder of the site
$name : name used to link the current section in the menus
$title : page title
$description: description, used as subtitle and for brief description in index pages
$indeximage : image used in index pages to link this section
$type : type of the page (cover|thumb|index)
$imgtitle : associtive array of the images descriptions. Used only by "thumb" pages
$coverimage : image used by "cover" pages
$covertext : text used by "cover" pages
$coverlink= : link used by "cover" pages
$covertitle : title used by "cover" pages

NEEDS a web server (Apache or similar) with PHP support
<<less
Download (0.033MB)
Added: 2006-09-11 License: GPL (GNU General Public License) Price:
1139 downloads
King of the Hill 0.8.0

King of the Hill 0.8.0


King of the Hill project is a full client/server multiplayer artillery game in the scorched earth tradition. more>>
King of the Hill project is a full client/server multiplayer artillery game in the scorched earth tradition.
King of the Hill (KOTH) is an artillery game in the grand old tradition of little tanks with ridiculously powerful weapons trying to blow each other up while trying to avoid getting blown up themselves.
Koth features LibGGI for fast portable graphics, full client/server multiplayer, a few cool weapons, in-game chat, and nice terrain generation algorithm.
Open source in the hopes that others will help out and make this a really great game.
Main features:
- Supports up to ten players at once, with unlimited observers (ten only because beyond that the game would get unwieldy, not an architectural limitation)
- Players can join and leave at any time without disrupting the game
- Pregame and In-game color-coded chat
- Buy and sell various types of neat weapons to use against your enemies
- Fractal-tessalation terrain generating algorithm produces endless variations of interesting terrain (before you start blowing massing craters into it that is
- Falling dirt and falling damage to tanks
- Lightweight, asynchronous networking protocol - perfectly playable on a modem over the Internet even with high pingtime
- LibGGI for portable graphics. Currently supports 8/15/16/24/32 bits per pixel in any resolution
- Free software so anyone can and is encouraged to add in their own favorite weapons, equipment, and other features.
Enhancements:
- kick (through server console)
- new weapons: black hole, laser, dirt curtain, dirt vaporizer and depth charge
- infinite number of observers
- new status area in battle window (nickname/armor/shield)
- readiness indication in pregame
- new "who already fired" ingame bar
- bugfixes and other misc changes (weapons price, power, behavior etc)
- weapons name in death messages
- New explosions
- Koth is now playable on fast computers (sleep in animations)
<<less
Download (0.13MB)
Added: 2006-11-10 License: GPL (GNU General Public License) Price:
634 downloads
Deluxe Tree 1.0

Deluxe Tree 1.0


Deluxe Tree is a powerful, JavaScript-based site navigation menu. more>>
Deluxe Tree is a powerful, JavaScript-based site navigation menu. Deluxe Tree is a versatile, ready-made solution that allows professional and amateur Web developers to create superior navigation systems for their Web sites and Web applications.
It supports a special JavaScript API to change your menu "on-the-fly", animation effects, floating, drag-n-drop, state saving, XP Style, relative and absolute positions, animated icons and arrows, normal state, mouseover state, expanded state, unlimited submenus, separators, lines, and more.
Main features:
Compatibility
- Full cross-browser compatibility including IE, Netscape, Mozilla, Opera, Firefox, Konqueror and Safari
- on Windows, Mac OS and Linux
- Section 508 compliant
- Support for any doctypes
- Menu can be populated from a database using ASP, PHP, etc.
Seamless Integration
- Multiple menus on the same page
- Friendly to other scripts and css styles
- Any HTML code can be used within menu items
High Performance
- Generally loads faster than other page elements
- Performs perfectly with unlimited number of submenus and items
Easy Setup
- Comprehensible menu parameters for manual editing
Professional Look-n-Feel
- Fully customizable appearance, individual styles for each element
- Animation effects for submenus in XP Style
Unique Features
- Dragable, floating, state-saving menus
- Special JavaScript API for changing menu "on-the-fly"
Cost Effective
- Starts at just $39.95. Buy Now!
- Free for non-profit websites. Order Now!
- Full-functional free trial version.
Enhancements:
- Several .js modules were added.
- A special JavaScript API was added to change your menu "on-the-fly".
- New animation effects were added.
<<less
Download (0.82MB)
Added: 2006-09-18 License: Free for non-commercial use Price:
1131 downloads
mod_domaintree 1.6

mod_domaintree 1.6


mod_domaintree is a hostname to filesystem mapper for Apache2. more>>
mod_domaintree is a hostname to filesystem mapper for Apache2. It maps host names like www.example.com to a filesystem tree like $prefix/com/example/www/$suffix.
mod_domaintree module can optionally strip the www prefix of host names.
Enhancements:
- The suexec hook and DomainTreeSuexec directory configuration directive were added.
- "make clean" was fixed.
<<less
Download (0.038MB)
Added: 2007-05-07 License: The Apache License 2.0 Price:
900 downloads
Ports Tree Explorer 0.2

Ports Tree Explorer 0.2


Ports Tree Explorer is a navigation tool for a ports tree. more>>
Ports Tree Explorer (PTE) is a small tool that allows you to navigate through your /usr/ports tree, showing you information about a selected port, tree view, software categories (/usr/ports main dirs) and finally allows you to install a selected port using childs for the installation.
PTE Allows you to monitor background installs and allow you to perform certain operations related to your software ports tree, with a plain and simple GUI requires almost minimum shell interaction.
Newer versions will include CVS updates off the ports, managing/modifying a specific port, see available FLAVORS and finally specify compilation options for this port. Ports Tree Explorer is written in perl/tk and its working (tested) on Open BSD. PTE is free and improvements, adjustments etc. are more than welcomed.
PTE aims to be an easy to use tool. Plain and simple as possible, functional for new users of /usr/ports tree along with experienced users that get bored often.
The scope of this project is to provide an easy way to use/maintain and install programs from your ports tree.
At the current stage, we aim to be usable and all the required functions be implemented and work.
After this goes to a stable release, security enhancements and extra functionality will be added.
Main features:
- Ports Category separation
- Ports Program separation
- Description of Port
- Install selected port
- History of executed commands (Installations)
Enhancements:
- Kill a background install.
- Changed the state of background install from Started to Finished (when the install is actually finished)
- Save history to file.
- Direct output from the fork to the output window.
- Support for other ports, like NetBSD, Free BSD ports.
<<less
Download (0.16MB)
Added: 2005-05-05 License: BSD License Price:
1633 downloads
Bio::Tree::Tree 1.4

Bio::Tree::Tree 1.4


Bio::Tree::Tree is an Implementation of TreeI interface. more>>
Bio::Tree::Tree is an implementation of TreeI interface.

SYNOPSIS

# like from a TreeIO
my $treeio = new Bio::TreeIO(-format => newick, -file => treefile.dnd);
my $tree = $treeio->next_tree;
my @nodes = $tree->get_nodes;
my $root = $tree->get_root_node;

This object holds handles to Nodes which make up a tree.

<<less
Download (4.7MB)
Added: 2006-10-10 License: Perl Artistic License Price:
1110 downloads
STX B+ Tree 0.8

STX B+ Tree 0.8


STX B+ Tree project is a set of C++ template classes implementing a B+ tree key/data container in main memory. more>>
STX B+ Tree project is a set of C++ template classes implementing a B+ tree key/data container in main memory. The classes are designed as drop-in replacements of the STL containers set, map, multiset and multimap and follow their interfaces very closely. By packing multiple value pairs into each node of the tree the B+ tree reduces heap fragmentation and utilizes cache-line effects better than the standard red-black binary tree.
The tree algorithms are based on the implementation in Cormen, Leiserson and Rivests Introduction into Algorithms, Jan Janninks paper and other algorithm resources. The classes contain extensive assertion and verification mechanisms to ensure the implementations correctness by testing the tree invariants.
The main B+ tree implementation can be found in doxygen stx/btree.h or with plain text comments btree.h.
Special interest was put into performing a speed comparison test between the standard red-black tree and the new B+ tree implementation. The speed test results are interesting and show the B+ tree to be significantly faster.
Enhancements:
- This release introduces the demonstration program wxBTreeDemo.
- This program draws illustrations of the B+ trees constructed by the STX B+ Tree template classes.
- It allows the user to select different types of B+ tree instantiations: integer or string keys and different slot numbers.
- The user may insert and erase key/data pairs from the tree and run different search operations.
- The demo program uses the cross-platform wxWidgets toolkit and can be compiled on Linux, Windows, and Mac OS X.
<<less
Download (0.36MB)
Added: 2007-05-15 License: LGPL (GNU Lesser General Public License) Price:
548 downloads
AJAX Tree Control 0.1

AJAX Tree Control 0.1


AJAX Tree Control is a modified version of SilverStripes tree control. more>>
AJAX Tree Control is a modified version of SilverStripes tree control. It adds dynamic loading of child nodes via AJAX.

The default implementation uses the prototype library to make dynamic requests, but this behavior can be overridden by setting functions on the global Tree object.

There are a few demo Ruby on Rails applications included in the distribution that show how to use and customize the tree.
<<less
Download (0.082MB)
Added: 2007-05-07 License: BSD License Price:
902 downloads
AI::DecisionTree 0.08

AI::DecisionTree 0.08


AI::DecisionTree is Perl module for automatically Learns Decision Trees. more>>
AI::DecisionTree is Perl module for automatically Learns Decision Trees.

SYNOPSIS

use AI::DecisionTree;
my $dtree = new AI::DecisionTree;

# A set of training data for deciding whether to play tennis
$dtree->add_instance
(attributes => {outlook => sunny,
temperature => hot,
humidity => high},
result => no);

$dtree->add_instance
(attributes => {outlook => overcast,
temperature => hot,
humidity => normal},
result => yes);

... repeat for several more instances, then:
$dtree->train;

# Find results for unseen instances
my $result = $dtree->get_result
(attributes => {outlook => sunny,
temperature => hot,
humidity => normal});

The AI::DecisionTree module automatically creates so-called "decision trees" to explain a set of training data. A decision tree is a kind of categorizer that use a flowchart-like process for categorizing new instances. For instance, a learned decision tree might look like the following, which classifies for the concept "play tennis":

OUTLOOK
/ |
/ |
/ |
sunny/ overcast rainy
/ |
HUMIDITY | WIND
/ *no* /
/ /
high/ normal /
/ strong/ weak
*no* *yes* /
*no* *yes*

(This example, and the inspiration for the AI::DecisionTree module, come directly from Tom Mitchells excellent book "Machine Learning", available from McGraw Hill.)

A decision tree like this one can be learned from training data, and then applied to previously unseen data to obtain results that are consistent with the training data.

The usual goal of a decision tree is to somehow encapsulate the training data in the smallest possible tree. This is motivated by an "Occams Razor" philosophy, in which the simplest possible explanation for a set of phenomena should be preferred over other explanations. Also, small trees will make decisions faster than large trees, and they are much easier for a human to look at and understand. One of the biggest reasons for using a decision tree instead of many other machine learning techniques is that a decision tree is a much more scrutable decision maker than, say, a neural network.

The current implementation of this module uses an extremely simple method for creating the decision tree based on the training instances. It uses an Information Gain metric (based on expected reduction in entropy) to select the "most informative" attribute at each node in the tree. This is essentially the ID3 algorithm, developed by J. R. Quinlan in 1986. The idea is that the attribute with the highest Information Gain will (probably) be the best attribute to split the tree on at each point if were interested in making small trees.

<<less
Download (0.025MB)
Added: 2006-10-12 License: Perl Artistic License Price:
1111 downloads
Generic Game-Tree Library 2.1.4

Generic Game-Tree Library 2.1.4


Generic Game-Tree Library is a library designed to make it easier to program games in C. more>>
GGTL is a library designed to make it easier to program games in C. Generic Game-Tree Library provides an AI that is able to play most 2 player strategic games.
Nim, Tic-Tac-Toe, Reversi (aka Othello), Connect-4 and Chess are all examples of games that can all be implemented using GGTL.
GGTL comes with game-specific extensions that enables it to play Nim and Reversi almost out of the box. Please see the documentation for details.
Enhancements:
- "clock()" is used as a fallback for sub-second timing if "gettimeofday()" is not found.
- An internal typedef was dropped, and a header declaration for a function that didnt exist was removed.
- Some build system refactoring was done.
<<less
Download (0.25MB)
Added: 2006-12-21 License: GPL (GNU General Public License) Price:
609 downloads
Tree::BPTree 1.07

Tree::BPTree 1.07


Tree::BPTree is a Perl implementation of B+ trees. more>>
Tree::BPTree is a Perl implementation of B+ trees.

SYNOPSIS

use Tree::BPTree;

# These arguments are actually the defaults
my $tree = new Tree::BPTree(
-n => 3,
-unique => 0,
-keycmp => sub { $_[0] cmp $_[1] },
-valuecmp => sub { $_[0] $_[1] },
);

# index the entries in this string:
my $string = "THERES MORE THAN ONE WAY TO DO IT"; # TMTOWTDI
my $i = 0;
$tree->insert($_, $i++) foreach (split //, $string);

# find the index of the first T
my $t = $tree->find(T);

# find the indexes of every T
my @t = $tree->find(T);

# We dont like the word WAY , so lets remove it
my $i = index $string, W;
$tree->delete($_, $i++) foreach (split //, substr($string, $i, 4));

# Reverse the sort order
$tree->reverse;

# Iterate through each key/value pair just like built-in each operator
while (my ($key, $value) = $tree->each) {
print "$key => $valuen";
}

# Reset the iterator when we quit from an "each-loop" early
$tree->reset;

# You might also be interested in using multiple each loops at once, which is
# possible through the cursor syntax. You can even delete individual pairs
# from the list during iteration.
my $cursor = $tree->new_cursor;
while (my ($key, $value) = $cursor->each) {
my $nested = $tree->new_cursor;
while (my ($nkey, $nvalue) = $nested->each) {
if ($key->shouldnt_be_in_this_tree_with($nkey)) {
$nested->delete;
}
}
}

# Iterate using an iterator subroutine
$tree->iterate(sub { print "$_[0] => $_[1]n" });

# Iterate using an iterator subroutine that returns the list of return values
# returned by the iterator
print join(, , $tree->map(sub { "$_[0] => $_[1]" })),"n";

# Grep-like operations
my @pairs = $tree->grep (sub { $_[0] =~ /S/ });
my @keys = $tree->grep_keys (sub { $_[0] =~ /S/ });
my @values = $tree->grep_values (sub { $_[0] =~ /S/ });

# Get all keys, values
my @all_keys = $tree->keys;
my @all_values = $tree->values;

# Clear it out and start over
$tree->clear;

B+ trees are balanced trees which provide an ordered map from keys to values. They are useful for indexing large bodies of data. They are similar to 2-3-4 Trees and Red-Black Trees. This implementation supports B+ trees using an arbitrary n value.

<<less
Download (0.017MB)
Added: 2006-07-04 License: Perl Artistic License Price:
1208 downloads
B::Tree 0.02

B::Tree 0.02


B::Tree is a simplified version of B::Graph for demonstration. more>>
B::Tree is a simplified version of B::Graph for demonstration.

SYNOPSIS

perl -MO=Tree program | dot -Tps > tree.ps

This is a very cut-down version of B::Graph; it generates minimalist tree graphs of the op tree of a Perl program, merely connecting the op nodes and labelling each node with the type of op.

It was written as an example of how to write compiler modules for "Professional Perl", but Ive found it extremely useful for creating simple op tree graphs for use in presentations on Perl internals.

It requires the CPAN GraphViz module and the GraphViz package from http://www.research.att.com/sw/tools/graphviz/. It takes no options.

<<less
Download (0.002MB)
Added: 2007-06-26 License: Perl Artistic License Price:
856 downloads
IRCTree 0.10

IRCTree 0.10


IRCTree is a project which shows a tree representing the structure of an IRC network in ASCII. more>>
IRCTree is a project which shows a tree representing the structure of an IRC network in ASCII.

Introduction

IRCTree shows a tree in ascii format representing the structure of an
IRC network.

You need netcat (nc) for it to work.

Example uses

$ irctree irc.swipnet.se

Compiling

No need to compile, but you can copy it into /usr/local/bin with make install.
<<less
Download (0.008MB)
Added: 2007-04-20 License: GPL (GNU General Public License) Price:
919 downloads
Bio::NEXUS::TreesBlock 0.67

Bio::NEXUS::TreesBlock 0.67


Bio::NEXUS::TreesBlock is a Perl module that represents TREES block of a NEXUS file. more>>
Bio::NEXUS::TreesBlock is a Perl module that represents TREES block of a NEXUS file.

SYNOPSIS

if ( $type =~ /trees/i ) {
$block_object = new Bio::NEXUS::TreesBlock( $block_type, $block, $verbose );
}

If a NEXUS block is a Trees Block, this module parses the block and stores the tree data.

METHODS

new

Title : new
Usage : block_object = new Bio::NEXUS::TreesBlock($block_type, $commands, $verbose );
Function: Creates a new Bio::NEXUS::TreesBlock object and automatically reads the file
Returns : Bio::NEXUS::TreesBlock object
Args : type (string), the commands/comments to parse (array ref), and a verbose flag (0 or 1; optional)

clone

Title : clone
Usage : my $newblock = $block->clone();
Function: clone a block object (shallow)
Returns : Block object
Args : none

set_trees

Title : set_trees
Usage : $block->set_trees($trees);
Function: Sets the list of trees (Bio::NEXUS::Tree objects)
Returns : none
Args : ref to array of Bio::NEXUS::Tree objects

add_tree

Title : add_tree
Usage : $block->add_tree($tree);
Function: Add trees (Bio::NEXUS::Tree object)
Returns : none
Args : a Bio::NEXUS::Tree object

add_tree_from_newick

Title : add_tree_from_newick
Usage : $block->add_tree_from_newick($newick_tree, $tree_name);
Function: Add a tree (Bio::NEXUS::Tree object)
Returns : none
Args : a tree string in newick format and a name for the tree (scalars)

get_trees

Title : get_trees
Usage : $block->get_trees();
Function: Gets the list of trees (Bio::NEXUS::Tree objects) and returns it
Returns : ref to array of Bio::NEXUS::Tree objects
Args : none

get_tree

Title : get_tree
Usage : $block->get_tree($treename);
Function: Gets the first tree (Bio::NEXUS::Tree object) that matches the name given or the first tree if $treename is not specified. If no tree matches, returns undef.
Returns : a Bio::NEXUS::Tree object
Args : tree name or none

set_translate

Title : set_translate
Usage : $block->set_translate($translate);
Function: Sets the hash of translates for nodes names
Returns : none
Args : hash of translates

translate

Title : translate
Usage : $self->translate($num);
Function: Translates a number with its associated name.
Returns : integer or string
Args : integer
Method : Returns the name associated with that numbers translated name.
If it cant find an association, returns the number.

reroot_tree

Title : reroot_tree
Usage : $block->reroot_tree($outgroup,$root_position, $treename);
Function: Reroot a tree using an OTU as new outgroup.
Returns : none
Args : outgroup name, the distance before the root position and tree name

reroot_all_trees

Title : reroot_all_trees
Usage : $block->reroot_all_trees($outgroup, $root_position);
Function: Reroot all the trees in the treesblock tree. use an OTU as new outgroup
Returns : none
Args : outgroup name and root position

rename_otus

Title : rename_otus
Usage : $block->rename_otus(%translation);
Function: Renames nodes based on a translation hash
Returns : none
Args : hash containing translation (e.g., { old_name => new_name} )
Comments: nodes not included in translation hash are unaffected

select_otus

Name : select_otus
Usage : $nexus->select_otus(@otunames);
Function: select a subset of OTUs
Returns : a new nexus object
Args : a ref to array of OTU names

select_tree

Name : select_tree
Usage : $nexus->select_tree($treename);
Function: select a tree
Returns : a new nexus object
Args : a tree name

select_subtree

Name : select_subtree
Usage : $nexus->select_subtree($inodename);
Function: select a subtree
Returns : a new nexus object
Args : an internal node name for subtree to be selected

exclude_subtree

Name : exclude_subtree
Usage : $nexus->exclude_subtree($inodename);
Function: remove a subtree
Returns : a new nexus object
Args : an internal node for subtree to be removed

equals

Name : equals
Usage : $nexus->equals($another);
Function: compare if two NEXUS objects are equal
Returns : boolean
Args : a NEXUS object

<<less
Download (0.15MB)
Added: 2006-12-19 License: Perl Artistic License Price:
1039 downloads
XML::Handler::Trees 0.02

XML::Handler::Trees 0.02


XML::Handler::Trees is a PerlSAX handlers for building tree structures. more>>
XML::Handler::Trees is a PerlSAX handlers for building tree structures.

SYNOPSIS

use XML::Handler::Trees;
use XML::Parser::PerlSAX;

my $p=XML::Parser::PerlSAX->new();
my $h=XML::Handler::Tree->new();
my $tree=$p->parse(Handler=>$h,Source=>{SystemId=>file.xml});

my $p=XML::Parser::PerlSAX->new();
my $h=XML::Handler::EasyTree->new(Noempty=>1);
my $easytree=$p->parse(Handler=>$h,Source=>{SystemId=>file.xml});

my $p=XML::Parser::PerlSAX->new();
my $h=XML::Handler::TreeBuilder->new();
$h->store_pis(1);
my $tree=$p->parse(Handler=>$h,Source=>{SystemId=>file.xml});

XML::Handler::Trees provides three PerlSAX handler classes for building tree structures. XML::Handler::Tree builds the same type of tree as the "Tree" style in XML::Parser.

XML::Handler::EasyTree builds the same type of tree as the "EasyTree" style added to XML::Parser by XML::Parser::EasyTree. XML::Handler::TreeBuilder builds the same type of tree as Sean M. Burkes XML::TreeBuilder. These classes make it possible to construct these tree structures from sources other than XML::Parser.

All three handlers can be driven by either PerlSAX 1 or PerlSAX 2 drivers. In all cases, the end_document() method returns a reference to the constructed tree, which normally becomes the return value of the PerlSAX driver.

<<less
Download (0.007MB)
Added: 2006-09-01 License: Perl Artistic License Price:
1148 downloads
Secleted [ 0 ] software to compare
  • Page: 1 of 5
  • 1
  • 2
  • 3
  • 4
  • 5