Free null master software for linux

Hanzi Master project is a visual, interactive Chinese character and word dictionary.
Hanzim ("Hanzi Master") is an interactive visual dictionary for learning and seeing relationships between Chinese radicals, characters, and compounds.
All the characters with a given radical, phonetic component, or pronunciation can be displayed, and all words containing a character, with English meanings.
All data is stored locally. Either simplified or traditional characters can be used.
Main features:
- typing in pinyin gives list of characters and definitions with that pronunciation
- clicking on a radical gives list of characters and definitions with that radical
- clicking on any character in any list displays that character along with the compounds it occurs in as the first or second character.

ISO Master is an open-source, graphical CD image editor that runs on Linux; and bkisofs, the underlying library used for reading, modifying and writing ISO images.
The hard part of this project is the library for working with ISOs (bkisofs). My hope is that people will like this library enough to make their own GUIs using it. So my choice of widget set (GTK, that is) will not necessarily annoy too many people.
Main features:
- Display file/directory contents of the image and and the regular filesystem in two panels and be able to navigate them.
- Display file sizes for files on image/filesystem.
- Sort by name or by size
- Select any number of items in the file browsers.
- Extract selected from image to the filesystem
- Delete selected from image.
- Add selected from filesystem to image.
- Save modified image.
- Create image from scratch.
Enhancements:
- Usability and performance improvements.
- 10 new translations.
- A bug that sometimes caused corrupt ISOs to be written has been fixed.

ResearchMaster project has been designed to make working a little easier. Specifically, the application can be either a storage facility for all of your precious, miscellaneous digital information, or for just some of it. The project began as a way for the author to [1] have a centralized library for all the papers and various snippets he collects, and [2] to have some powerful, built-in support for BibTeX, the LaTeX bibliography system ( The LaTeX bibliography system, as described in the Leslie Lamport book. ISBN 0-201-52983-1).
When the application starts up, it creates a virtual filesystem (vfs) from information contained in records. Each record appends itself under at least one folder in the vfs, and the vfs is represented by a tree-widget system of folders and records. The application is divided into folder controls (left) and record controls (right).
Each record is actually a set of three python dictionaries, stored in a flat ascii text file. The three dictionaries correspond to [1] BibTex information corresponding to the record, [2] Meta information (eg. isbn, call number, url, membership) and [3] an endless notes file. When a record is selected from the tree widget, the corresponding three dictionaries are presented in a three-tabbed notebook widget on the right side of the application.
New records are created via a button on the records toolbar. When you create a new record the application pops a filechooser and you are given the opportunity to import a single file. Perhaps the imported file is a pdf copy of a research paper that you dont want to lose. ResearchMaster is a good place to store it. First, the record and the imported file now have each other. Now you can keep a log of your involvement with the file in the notes portion of the record. The Meta portion of the record contains non-BibTex information, such as which folders the record is a member of. The application accesses the records BibTex information whenever the record has membership within the subtree of a particular folder for which a recursive bibliography is being generated.
Heres a typical example: Say you create a folder for some project. Lets say that after six months your folder now has several subtrees of folders and records, all arranged according to the scheme that happened. Now imagine there are twenty records with BibTex information strewn throughout the projects subtree, side-by-side with other records that dont have BibTex information (notes, whatever). By pushing the Create Bibliography button on the left toolbar the application will produce a perfectly formatted BibTex file with all twenty records.
Each record can be made a member of any folder simply by adding the folders path to the membership list in the Meta portion of the record. The tree widget is dynamically constructed by recursively examining a directory tree (corresponding to the folders of the tree-widget) and the membership list contained in each record. This is done so that we only have one physical copy of each record, despite the fact that the record might show up in fifty different places throughout the tree widget.
The file that gets imported with a record can be any file of any format. You can tell ResearchMaster to launch the file as an argument to any external application, based on the filenames suffix (.gif, .avi, .mpg, .mp3). Then, select the record from the tree, push the launch button (on the records toolbar), and voila! The associated application brings up your file. Thats one feature that makes working a little easier.
Enhancements:
- Small correction was needed on line 1140 of ResearchMaster_wxuser.py, where "researchmaster" needed to be "ReseaerchMaster" for preferences initialization.

NullableTypes for .NET are a very reliable and efficient version of built-in value-types that can be Null. NullableTypes pass more than 800 differents test cases and have close-to-optimal efficiency as built-in value-types. They may be used every time you need to store a Null value in a .NET built-in value-type.

Types implemented by NullableTypes are: NullableBoolean, NullableByte, NullableInt16, NullableInt32, NullableInt64, NullableSingle, NullableDouble, NullableDecimal, NullableString and NullableDateTime.

Helper functions provide seamless integration with Windows and ASP.NET user controls and with ADO.NET.

NullableTypes will let you write code like this:

public sealed class Order{
public int OrderID {get {/*...*/}}
public int CustomerID {get {/*...*/}}
public NullableDateTime RequestedDeliveryDate {get {/*...*/}}
// remaining members elided for clarity
}

where RequestedDeliveryDate can be either NullableDateTime.Null or a valid DateTime value.

The property RequestedDeliveryDate.IsNull tests if the date is Null, and when it is not Null the property RequestedDeliveryDate.Value returns a valid DateTime value.

DBIx::EnumConstraints is a Perl module that generates enum-like SQL constraints.

SYNOPSIS

use DBIx::EnumConstraints;

my $ec = DBIx::EnumConstraints->new({
name => kind, fields => [ [ k1, a, b ]
, [ k2, b ] ]
});

# get enum field definition
my $edef = $ec->enum_definition;

# $edef is now kind smallint not null check (kind > 0 and kind < 2)

# get constraints array
my @cons = $ec->constraints;

# @cons is now (
# constraint k1_has_a check (kind 1 or a is not null)
# , constraint k1_has_b check (kind 1 or a is not null)
# , constraint k2_has_b check (kind 2 or b is not null)
# , constraint k2_has_no_a check (kind 2 or a is null))

This module generates SQL statements for enforcing enum semantics on the database columns.

Enum columns is the column which can get one of 1 .. k values. For each of those values there are other columns which should or should not be null.
For example in the SYNOPSIS above, when kind column is 1 the row should have both of a and b columns not null. When kind column is 2 the row should have a but no b columns.

CONSTRUCTORS

$class->new($args)

$args should be HASH reference containing the following parameters:

name

The name of the enum.

fields

Array of arrays describing fields dependent on the enum. Each row is index is the possible value of enum minus 1 (e.g. row number 1 is for enum value 2).
First item in the array is the state name. The rest of the items are field names. There is a possibility to mark optional fields by using trailing ? (e.g. b? denotes an optional b field.

METHODS

$self->enum_definition

Returns the definition of enum column. See SYNOPSIS for example.

$self->for_each_kind($callback)

Runs $callback over registered enum states. For each state passes state name, fields which are in the state and fields which are out of the state.

The fields are passed as ARRAY references.

$self->constraints

Returns the list of generated constraints. See SYNOPSIS above for an example.

GStreamer is a Perl interface to the GStreamer library.

SYNOPSIS

use GStreamer -init;

my $loop = Glib::MainLoop -> new();

# set up
my $play = GStreamer::ElementFactory -> make("playbin", "play");
$play -> set(uri => Glib::filename_to_uri $file, "localhost");
$play -> get_bus() -> add_watch(&my_bus_callback, $loop);
$play -> set_state("playing");

# run
$loop -> run();

# clean up
$play -> set_state("null");

sub my_bus_callback {
my ($bus, $message, $loop) = @_;

if ($message -> type & "error") {
warn $message -> error;
$loop -> quit();
}

elsif ($message -> type & "eos") {
$loop -> quit();
}

# remove message from the queue
return TRUE;
}

MassResolve application performs reverse DNS lookups for network blocks or an input file. The requests can be performed mulit-threaded.

Usage:

./res < subnet or filename to resolve > < forks >

Code:

/*
MassResolve (C) 2000 John Anderson (john@ev6.net)
This program performs reverse dns lookups for network blocks
or an input file and supports multi threading.

*/

#include < stdio.h>
#include < fcntl.h>
#include < netdb.h>
#include < signal.h>
#include < sys/time.h>
#include < unistd.h>
#include < netinet/in.h>
#include < netinet/ip.h>
#include < netinet/ip_icmp.h>
#include < errno.h>
#include < string.h>
#include < getopt.h>
#include < setjmp.h>

char *
rlookup (u_long ip)
{
static char hostname[256];
struct hostent *host;
struct sockaddr_in addr;

addr.sin_addr.s_addr = ip;

host =
gethostbyaddr ((char *) &addr.sin_addr, sizeof (addr.sin_addr), AF_INET);

if (host == NULL)
{
printf ("%s does not resolve.n", inet_ntoa (ip));
fflush (stdout);
}
else
{
printf ("%s resolves to %sn", inet_ntoa (ip), host->h_name);
fflush (stdout);
}
}

int maxforq = 0;

int
main (int argc, char **argv)
{
int pid, k, j, frk, i, mforks;
char *pt;
char mehost[200], sv[3];
FILE *inp;

mforks = 64; /* default */
if (argv[1] == NULL)
{
printf ("Usage: %s n", argv[0]);
exit (0);
}
if (!argv[2] == NULL)
{
mforks = atoi (argv[2]);
}
/* printf ("Resolving all hosts in %s with %d threadsn", argv[1], mforks); */
if((inp=fopen(argv[1],"r"))!=NULL)
{
while(fgets(mehost,sizeof(mehost),inp))
{
sscanf(mehost,"%sn",mehost);
frk = fork ();
if (frk == 0)
{
fflush (stdout);
rlookup (inet_addr (mehost));
exit (0);
}
else
{ /* frk = 0 */
maxforq++;
if (maxforq > mforks)
{
wait (NULL); // waiting until the child died
maxforq--;
}

}

}
fclose(inp);
exit(0);
}

pt = strchr (argv[1], .);
if (pt == NULL)
{ /* ANET */
for (k = 0; k<<less