Free 0.0215 kg equals how many mg software for linux

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.

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.

pTest framework is an Object Oriented PHP 5 testing framework. The project differs from other testing frameworks in that it doesnt suffer from a dogmatic following of JUnit.

A good feature of this framework is that it can be as easily used from the commandline as embedded and extended by your application. Tests are easy to write and dont require naming conventions or other weirdness.

A simple test

< ?php

class SimpleTest extends BaseTest {
public function setup() {

}

public function aIsB() {
$this->false( ( 1 == 2 ), "one is not equal to two" );
$this->false( ( a == b ), "a is not equal to b" );
}

public function knownFacts() {
$this->true( ( 1 + 1 == 2 ), one and one is two );
}

public function fatal() {
$this->true( new thisfatalerror(), division by zero );
}

public function tearDown() {

}
}

? >

The console output

SimpleTest:
aIsB
false( one is not equal to two ) = passed
false( a is not equal to b ) = passed
knownFacts
true( one and one is two ) = passed
fatal
errored
Output
====================================================

Fatal error: Class thisfatalerror not found in /usr/local/pTest/examples/SimpleTest.php on line 18

====================================================


4 total tests
3 passed
0 failed
0 skipped
1 errored
75.00% success

Gregorian calendar 1582 is a small Python script to generate calendars for any year in the history greater or equal to one.

The output format is the same as the Unix "cal" command. However, it supposes the Gregorian Reformation took place on October 4th, 1582, in contrast to the cal, which supposes the reformation took place on September 3rd, 1752.

WESTBANG is a western FPS style game for Linux.

Comics

Files: DATA/COMIX/*.CMX

Comics are simple animations with given images made by a script file.
Comics are used for intro and outro animation and for interlevel shots.
There are these reserved comics:

intro.cmx played after the start of the program
gameover.cmx played, when a player loose his last life
goodbye.cmx played after the quit

You can modify these files as you wish, but you have to keep these names,
because they are called directly from the program. Other comics, their
names or number, is random.

Any of the *.cmx file can contain these commands:

delay < ticks >

Specifies the time the computer will wait before he does the next
command.

image < index > < name >

Image loads the specified bitmap and gives it an index number. In the
< name > can be just the name of the bitmap (the *.bmp file) or the path
and the name. The path starts in ../WESTBANG/DATA/COMIX, so all your
bitmaps and dirs have to be in the COMIX directory.

Note: The color 255,0,255 is transparent.

destroy < index >

Removes the image from the memory. Dont forget to destroy images,
or you can glut the memory.

virtual < v_index > < index > < pos_X > < pos_Y > < width > < height >

Virtual is the quad shaped object taken out of the image you can work
with by the commands of the comics. You can define more than one virtual
in one image.
< v_index > is the index given to the new virtual.
< index > is the index of the source bitmap.
< pox_X > < pos_Y > are the coords of the upper left corner of the virtual
in the image.
< width > < height > set the size of the virtual.

anime < v_inde x> < frames > < delay >

Makes the specified virtual the animated one. < Frames > is the number of
the frames and < delay > sets the pause between the two frames (speed of
animation).
Animated virtuals are made of bitmaps with all the frames placed in the
row. So the height of the bitmap is the same as the frames height and
width equals to times width of the frame.

anime_type < v_index > < type >

Sets the type of the animation of the specified virtual.
1: from first to last (1->2->3->...)
2: zig zag (1->2->3->2->1->...)
3: random

Example: These three commands make a short animated virtual.
virtual 3 1 0 0 10 10 //defines the first frame (size 10x10)
//taken from the image 1 (size 40x10)
anime 3 4 18 //makes 4-frames animation
anime_type 3 1 //sets the type of the animation to normal

setxy < v_index > < x > < y >

Puts the specified virtual on the given coords.

vis_on < v_index >

Shows the specified virtual. New created virtuals are hiden. You have to
use vis_on, if you want to see them on the screen.

vis_off < v_index >

Hides the specified virtual.

move < v_index > < tx > < ty > < sx > < sy > < tempo >

Sets the virtual as "the moving" one. Moving virtual goes automaticaly
from actual coords to target coords < tx >,< ty >. The speed of the motion
can be controled by the length of the single step (< sx >: step along the
x-axis, < sy >: step along the y-axis in pixels), or by the < tempo > - the
delay between the two steps.

resize < v_index> < sw> < sh> < speed_x> < speed_y>

Sets the virtual as "the resizing" one. < Sw> and < sh> are starting
height and witdth. Resizing can go by the very small steps, thats why
you have to set sw=100000 and sh=100000 if you want the starting size
of the virtual to be 100% x 100%.

sound < index> < name>

This is the same as the image command for the bitmaps.

play_sound < index> < volume> < panning>

Plays the sound once.

repeat_sound < index> < volume> < panning>

Repeats the sound, until you stop it by the command:

stop_sound < index>

destroy_sound < index>

Removes the sound from the memory.

pause

Waits for input. The script wont continue, until the user presses any key.

include < file_name>

Plays the < file_name> comics file. You can make the hierarchy in the files by this command. Its usefull for the good control of the long comics to create one "main" cmx file, that calls the single scenes as you can see in the "intro.cmx".

If you want to learn more, how to create the script look in our *.cmx files. Note: Max number of images is 50. Max number of virtuals is 50. Max number of samples is 20.

Search::Binary is a Perl module for generic binary search.

SYNOPSIS

use Seach::Binary;
$pos = binary_search($min, $max, $val, $read, $handle, [$size]);

binary_search implements a generic binary search algorithm returning the position of the first record whose index value is greater than or equal to $val. The search routine does not define any of the terms position, record or index value, but leaves their interpretation and implementation to the user supplied function &$read(). The only restriction is that positions must be integer scalars.

During the search the read function will be called with three arguments: the input parameters $handle and $val, and a position. If the position is not undef, the read function should read the first whole record starting at or after the position; otherwise, the read function should read the record immediately following the last record it read. The search algorithm will guarantee that the first call to the read function will not be with a position of undef. The read function needs to return a two element array consisting of the result of comparing $val with the index value of the read record and the position of the read record. The comparison value must be positive if $val is strictly greater than the index value of the read record, 0 if equal, and negative if strictly less. Furthermore, the returned position value must be greater than or equal to the position the read function was called with.

The input parameters $min and $max are positions and represents the extent of the search. Only records which begin at positions within this range (inclusive) will be searched. Moreover, $min must be the starting position of a record. If present $size is a difference between positions and determines when the algorithms switches to a sequential search. $val is an index value. The value of $handle is of no consequence to the binary search algorithm; it is merely passed as a convenience to the read function.

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.

Magpy is a Python wrapper for the mg search engine.
magpy module features fast full text sarch, indexing and boolean queries.
Both mg and magpy are released under the GPL (General Public License).
Installation:
To install magpy from source, extract the archive magpy-*.tar.gz, and run the following commands:
./configure
python setup.py build
python setup.py install
Usage:
The following script demonstrates a simple search frontend:
#!/usr/bin/python
import mgindexer
import mgquery
import sys
store = mgquery.MGSearchStore("/tmp/data","alice")
while 1:
query = sys.stdin.readline()
q = store.newQuery(query)
print "Searching for",query,"(words",q.words(),")"
for docnum,ranking in q.execute():
print "Document",docnum,"matches (Ranking",ranking,")"
Before this works, you first have to create search store at (here) the location
"/tmp/data", with the name "alice".
The following script creates such a store from a raw text file, which it splits into individual documents by splitting it into paragraphs.
#!/usr/bin/python
import mgindexer
fi = open("alice13a.txt", "rb")
fo = open("alice13a.splitted.txt", "wb")
for line in fi.readlines():
# split the file on the paragraph boundaries
if line.strip() == "":
fo.write(mgindexer.SEPARATOR)
else:
fo.write(line)
fo.close()
fi.close()
mgindexer.makeindex("alice13a.splitted.txt", "/tmp/data/", "alice")
If you have many individual documents you would like to run a search on, the following script is probably closer to what you need (notice it creates a new collection of the name "files", so you have to substitute "alice" by "files" in the example query script above):
#!/usr/bin/python
import mgindexer
import os
PATH = "files/"
fo = open("searchdata.txt", "wb")
for file in os.listdir(PATH):
if os.path.isfile(PATH + file):
# copy file
fi = open(PATH + file, "rb")
for line in fi.readlines():
fo.write(line)
# write document boundary
fo.write(mgindexer.SEPARATOR)
fo.close()
mgindexer.makeindex("searchdata.txt", "/tmp/data", "files")
Enhancements:
- This release adds support for wildcard search (truncation).
- Document types that have delimiters different from whitespace are now supported.