Free 0.20 inches equals how many inches software for linux

CodeSugar Eclipse Plugin is an Eclipse plugin that can generate methods such as equals(), clone(), toString(), and hashCode() for Java classes.
Enhancements:
- This release includes many feature enhancements in generated code, as well as UI refinements like enabling actions in the menu only when a type of .java file is selected.

MCP2510 Bit Timing Calculator project is a bit timing calculator for the MCP2510.

It is a bit timing calculator which is very easy to use.

All you have to do is to choose the baudrate and the oscilator-frequency.

Sure you can edit and change all setting. You will see a graphical bit timing diagram which show you your current options.

At the end you will get a detailed report of your choosen options. See an example here: mcp2510btn

HowTo

On the first step you have to choose your wished baudrate and the oscilator-frequency.

Second you will get a great table with all avaible baudrate for you oscilator-frequency. The are already choosen some baudrates if your baudrate equals with some on the table. Otherwise you have to select them manually, but you will get deviations to you choosen baudrate. You will the the deviation in percent at the right table.

When you are ready you can go forward to step three.
Here you have first to select your wanted Nominal Bit Time Screenshot 2 [Step 3]and then you can edit/change to values for the single segments of a bit timing.

Minesweeper is a Java game clone from the Windows version of Minesweeper.

Minesweeper is a game written by Chris Dailey in Java using Swing.

Version 1.1 features the basic game play.

The following table shows what the mouse clicks on squares do while the game is started.

COVERED

Set the square to UNCOVERED.
If there is a mine, the game ends (lose).
If all empty squares are uncovered, the game ends (win).
Otherwise the game continues. Set the square to FLAGGED.

UNCOVERED

Nothing if the number of flags in adjacent squares equals the number in the uncovered square
UNCOVER adjacent covered squares
else
temporarily highlight adjacent covered squares

FLAGGED

Nothing Set the square to QUESTIONED.

QUESTIONED

Nothing Set the square to COVERED.

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

Gip is an IP address calculator that integrates well with the GNOME desktop environment.

Gip provides system administrators with tools for IP address based calculations. For example, an administrator who needs to find out which IP prefix length equals the IP netmask 255.255.240.0, just types in the mask and gets the prefix length presented. But many more advanced calculations can be made.

Gip can convert an address range into a list of prefix lengths. It can also split subnets using a given IP netmask or IP prefix length. Many more calculations are possible.

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.

Zim is a WYSIWYG text editor written in Gtk2-Perl. Zim aims at bringing the concept of a wiki to your desktop. For example every page is saved as a text file with wiki markup. Pages can contain links to other pages, and are saved automatically.
Creating a new page is as easy as linking to a non-existing page. This tool is intended to keep track of TODO lists or serve as a personal scratch book.
Development on Zim started september 2005. This means there is no stable version yet. We are currently in beta testing. New releases will be announced on freshmeat. Please subscribe there to stay in touch.
Zim handles several types of markup, like headings, bullet lists and of course bold, italic and highlighted. This markup is saved as wiki text so you can easily edit it with other editors. Because of the autosave feature you can switch between pages and follow links while editing without worries.
Enhancements:
- Among other fixes, a bug where zim would hang on "new link" on some platforms was fixed, as well as a bug that could corrupt links on "update link".
- New features are the option to control the look of a new page through a template and to control the rendering of pages through a simple kind of stylesheet.
- Support for slow filesystems was added.
- Other improvements include better handling of formatting in the undo stack and the addition of a "document root" setting to the repository.

jset project is an implementation of the Set board game.

The game can be played alone or on the network. The Set board game is a card game whose goal is to find matching sets of cards.

The game is played using 81 (3^4) unique cards. On each card is drawn a set of identical shapes.

These sets of shapes have 4 properties, each shape property taken from a set of 3 possibilities: color (e.g. red, blue, and green), type (e.g. rectangle, circle, and triangle), fill (e.g. empty, full, and shaded), and number (e.g. one, two, and three).

The cards are disposed on the table in front of the players. The players must try to identify matching sets of cards.