cross hatch pattern
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 1279
Isotopic Pattern Calculator 1.4
Isotopic Pattern Calculator is a calculates isotopic distributions. more>>
IPC is a program that calculates the isotopic distribution of a given chemical formula. It gives the rel. intensities and the propability of the masses belonging to a molecule ion, fragment or whatever is represented by the given chemical formula.
Furthernmore it can use GNUPlot to visualize the result. Only masses with a rel. Intensity bigger then 0.009% are shown. Additionaly ipc prints the overall number of peaks and the needed computation time.
The program uses an algorithm which computes the exact isotopic distribution. This leads to a large number of peaks which have very low rel. abundances. Even for a small molecule as Acetylsalicylic acid ( C9H8O4, Mr=180.15) there are 1350 peaks but only nine of them have a rel. abundance higher then 0.01%.
Enhancements:
- A complete list of elements and isotopes is now used.
- The list of elements is taken from the NIST.
<<lessFurthernmore it can use GNUPlot to visualize the result. Only masses with a rel. Intensity bigger then 0.009% are shown. Additionaly ipc prints the overall number of peaks and the needed computation time.
The program uses an algorithm which computes the exact isotopic distribution. This leads to a large number of peaks which have very low rel. abundances. Even for a small molecule as Acetylsalicylic acid ( C9H8O4, Mr=180.15) there are 1350 peaks but only nine of them have a rel. abundance higher then 0.01%.
Enhancements:
- A complete list of elements and isotopes is now used.
- The list of elements is taken from the NIST.
Download (0.070MB)
Added: 2005-08-15 License: GPL (GNU General Public License) Price:
1531 downloads
Pattern-lab 0.4.0
Pattern-lab is a pattern recognition program. more>>
Pattern-lab is a pattern recognition program. Pattern-lab project is optimized for OCR, but not constrained to it. The method used is mainly pattern matching. Separation of merged patterns is one of the main goals. It is currently under development.
Enhancements:
- This release adds the Standardizing Transformation (ST) embedding IMage Euclidean Distance (IMED) in the preprocessing phase.
- Positive and negative effects of the new feature are explained in the manual.
<<lessEnhancements:
- This release adds the Standardizing Transformation (ST) embedding IMage Euclidean Distance (IMED) in the preprocessing phase.
- Positive and negative effects of the new feature are explained in the manual.
Download (2.5MB)
Added: 2007-03-21 License: GPL (GNU General Public License) Price:
950 downloads
SIMD Cross-platform headers 2004.10.26
SIMD Cross-platform headers is a cross- platform, cross-compiler, cross CPU C/C++ header collection. more>>
SIMD Cross-platform headers is a cross- platform, cross-compiler, cross CPU C/C++ header collection that aids the creation portable vectorized (SIMD) C/C++ code.
SIMD Cross-platform headerst supports (or partially supports) x86 (MMX/SSE/SSE2) GCC and MSVC, PPC Altivec GCC and CodeWarrior, ARM GCC, and software-emulated SIMD.
NOTE: Code must be 16-byte aligned. Align to 16 when allocating memory.
X86/XSCALE (Intel) vs. PowerPC/MIPS
While the PowerPC and MIPS SIMD instructions take 2 source vectors and a destination vector, the Intel platforms only take a source and destination. Example:
PPC/MIPS can do:
C = A + B
X86 can only do:
A = A + B (or A+=B)
Code written either way will work on the X86, and still be faster than 387 math, but preserving the registers takes significant overhead (Disassemble the test program for an example. The prints preserve, the disassembly test does not.) For the fastest code between systems, write your SIMD math as the X86 expects, manually preserving SIMD variables.
At least GCC for PPC doesnt seem to have any issues figuring out how to deal with a source and destination memory address being the same.
Enhancements:
- Created file with some i386, GCC dialect
<<lessSIMD Cross-platform headerst supports (or partially supports) x86 (MMX/SSE/SSE2) GCC and MSVC, PPC Altivec GCC and CodeWarrior, ARM GCC, and software-emulated SIMD.
NOTE: Code must be 16-byte aligned. Align to 16 when allocating memory.
X86/XSCALE (Intel) vs. PowerPC/MIPS
While the PowerPC and MIPS SIMD instructions take 2 source vectors and a destination vector, the Intel platforms only take a source and destination. Example:
PPC/MIPS can do:
C = A + B
X86 can only do:
A = A + B (or A+=B)
Code written either way will work on the X86, and still be faster than 387 math, but preserving the registers takes significant overhead (Disassemble the test program for an example. The prints preserve, the disassembly test does not.) For the fastest code between systems, write your SIMD math as the X86 expects, manually preserving SIMD variables.
At least GCC for PPC doesnt seem to have any issues figuring out how to deal with a source and destination memory address being the same.
Enhancements:
- Created file with some i386, GCC dialect
Download (0.008MB)
Added: 2006-03-17 License: zlib/libpng License Price:
1319 downloads
Cross Browser Ajax 0.01
Diminutive JavaScript-on-Demand based library that helps web developers add AJAX functionally to projects. in a few easy steps. Supports ALL modern ... more>> <<less
Download (0KB)
Added: 2009-04-05 License: Freeware Price: Free
203 downloads
Knitting Pattern Generator 0.3
Knitting Pattern Generator is a Python script to convert image files (PNG, GIF, BMP, etc.) into knitting patterns. more>>
Knitting Pattern Generator is a Python script to convert image files (PNG, GIF, BMP, etc.) into knitting patterns.
Usage:
python kpg.py myimage.png
<<lessUsage:
python kpg.py myimage.png
Download (0.008MB)
Added: 2007-04-25 License: GPL (GNU General Public License) Price:
923 downloads
Array::PatternMatcher 0.04
Array::PatternMatcher is a pattern matching for arrays. more>>
Array::PatternMatcher is a pattern matching for arrays.
SYNOPSIS
This section inlines the entire test suite. Please excuse the ok()s.
use Array::PatternMatcher;
Matching logical variables to input stream
# 1 - simple match of logical variable to input
my $pattern = AGE ;
my $input = 969 ;
my $result = pat_match ($pattern, $input, {} ) ;
ok($result->{AGE}, 969) ;
# 2 - if binding exists, it must equal the input
$input = 12;
my $new_result = pat_match ($pattern, $input, $result) ;
ok(!defined($new_result)) ;
# 3 - bind the pattern logical variables to the input list
$pattern = [qw(X Y)] ;
$input = [ 77, 45 ] ;
my $result = pat_match ($pattern, $input, {} ) ;
ok($result->{X}, 77) ;
Matching segments (quantifying) portions of the input stream
# 1
{
my $pattern = [a, [qw(X *)], d] ;
my $input = [a, b, c, d] ;
my $result = pat_match ($pattern, $input, {} ) ;
ok ("@{$result->{X}}","b c") ;
}
# 2
{
my $pattern = [a, [qw(X *)], [qw(Y *)], d] ;
my $input = [a, b, c, d] ;
my $result = pat_match ($pattern, $input, {} ) ;
ok ("@{$result->{Y}}","b c") ;
}
# 3
{
my $pattern = [a, [qw(X +)], d] ;
my $input = [a, b, c, d] ;
ok ("@{$result->{X}}","b c") ;
}
# 4
{
my $pattern = [ a, [qw(X ?)], c ] ;
my $input = [ a, b, c ] ;
my $result = pat_match ($pattern, $input, {} ) ;
ok ("$result->{X}","b") ;
}
# 5
{
my $pattern = [ qw(X OP Y is Z),
[
sub { "($_->{X} $_->{OP} $_->{Y}) == $_->{Z}" },
IF?
]
] ;
my $input = [qw(3 + 4 is 7) ] ;
my $result = pat_match ($pattern, $input, {} ) ;
ok ($result) ;
}
Single-matching:
Take a single input and a series of patterns and decide which pattern
matches the input:
# 1 - Here all input patterns must match the input
{
my @pattern ;
push @pattern, [ qw(X Y) ] ;
push @pattern, [ qw(22 Z ) ] ;
push @pattern, [ qw(M 33) ] ;
my $input = [ qw(22 33) ] ;
my $meta_pattern = [ AND?, @pattern ] ;
# if no bindings, add a binding between pattern and input
my $result = pat_match ($meta_pattern, $input, {} ) ;
ok ($result->{Z},33) ;
}
# 2 - Here, any one of the patterns must match the input
{
my @pattern ;
push @pattern, [ qw(99 22) ] ;
push @pattern, [ qw(33 22) ] ;
push @pattern, [ qw(44 3) ] ;
push @pattern, [ qw(22 Z) ] ;
my $input = [ qw(22 33) ] ;
my $meta_pattern = [ OR?, @pattern ] ;
# if no bindings, add a binding between pattern and input
my $result = pat_match ($meta_pattern, $input, {} ) ;
ok ($result->{Z},33) ;
}
# 3 - Here, none of the patterns must match the input
{
my @pattern ;
push @pattern, [ qw(99 22) ] ;
push @pattern, [ qw(33 22) ] ;
push @pattern, [ qw(44 3) ] ;
push @pattern, [ qw(22 Z) ] ;
my $input = [ qw(22 33) ] ;
my $meta_pattern = [ NOT?, @pattern ] ;
# if no bindings, add a binding between pattern and input
my $result = pat_match ($meta_pattern, $input, {} ) ;
ok (scalar keys %$result == 0) ;
}
# 4 - here the input must satisfy the predicate
{
sub numberp { $_[0] =~ /d+/ }
my $pattern = [ qw(X age), [qw(IS? N), νmberp] ] ;
my $input = [ qw(Mary age), thirty-four ] ;
# if no bindings, add a binding between pattern and input
my $result = pat_match ($pattern, $input, {} ) ;
ok (!defined($result));
}
# 5 - same thing, but this time a failing result ---
# not undef because it is the return val of numberp
{
sub numberp { $_[0] =~ /d+/ }
my $pattern = [ qw(X age), [qw(IS? N), νmberp] ] ;
my $input = [ qw(Mary age), 34 ] ;
my $result = pat_match ($pattern, $input, {} ) ;
ok ($result->{N},34) ;
}
Segment-matching:
Match a chunk of the input stream using *, +, ?
# 1 - * is greedy in this case, but not with 2 consecutve * patterns
{
my $pattern = [a, [qw(X *)], d] ;
my $input = [a, b, c, d] ;
# if no bindings, add a binding between pattern and input
my $result = pat_match ($pattern, $input, {} ) ;
warn sprintf "X*RETVAL: %s", Data::Dumper::Dumper($result) ;
ok ("@{$result->{X}}","b c") ;
}
# 2 - X* gets nothing, Y* gets all it can:
{
my $pattern = [a, [qw(X *)], [qw(Y *)], d] ;
my $input = [a, b, c, d] ;
# if no bindings, add a binding between pattern and input
my $result = pat_match ($pattern, $input, {} ) ;
warn sprintf "X*Y*RETVAL: %s", Data::Dumper::Dumper($result) ;
ok ("@{$result->{Y}}","b c") ;
}
# 3 - samething , but require at least one match for X
{
my $pattern = [a, [qw(X +)], d] ;
my $input = [a, b, c, d] ;
my $result = pat_match ($pattern, $input, {} ) ;
warn sprintf "RETVAL: @{$result->{X}}" ;
ok ("@{$result->{X}}","b c") ;
}
# 4 - require 0 or 1 match for X
{
my $pattern = [ a, [qw(X ?)], c ] ;
my $input = [ a, b, c ] ;
my $result = pat_match ($pattern, $input, {} ) ;
ok ("$result->{X}","b") ;
}
# 5 - evaluate a sub on the fly after match
{
my $pattern = [ qw(X OP Y is Z),
[
sub { "($_->{X} $_->{OP} $_->{Y}) == $_->{Z}" },
IF?
]
] ;
my $input = [qw(3 + 4 is 7) ] ;
my $result = pat_match ($pattern, $input, {} ) ;
ok ($result) ;
}
# --- 6 same thing, but fail
{
my $pattern = [ qw(X OP Y is Z),
[
sub { "($_->{X} $_->{OP} $_->{Y}) == $_->{Z}" },
IF?
]
] ;
my $input = [qw(3 + 4 is 8) ] ;
my $result = pat_match ($pattern, $input, {} ) ;
warn sprintf "IF_RETVAL2: *%s*", Data::Dumper::Dumper($result);
ok ($result eq ) ;
}
<<lessSYNOPSIS
This section inlines the entire test suite. Please excuse the ok()s.
use Array::PatternMatcher;
Matching logical variables to input stream
# 1 - simple match of logical variable to input
my $pattern = AGE ;
my $input = 969 ;
my $result = pat_match ($pattern, $input, {} ) ;
ok($result->{AGE}, 969) ;
# 2 - if binding exists, it must equal the input
$input = 12;
my $new_result = pat_match ($pattern, $input, $result) ;
ok(!defined($new_result)) ;
# 3 - bind the pattern logical variables to the input list
$pattern = [qw(X Y)] ;
$input = [ 77, 45 ] ;
my $result = pat_match ($pattern, $input, {} ) ;
ok($result->{X}, 77) ;
Matching segments (quantifying) portions of the input stream
# 1
{
my $pattern = [a, [qw(X *)], d] ;
my $input = [a, b, c, d] ;
my $result = pat_match ($pattern, $input, {} ) ;
ok ("@{$result->{X}}","b c") ;
}
# 2
{
my $pattern = [a, [qw(X *)], [qw(Y *)], d] ;
my $input = [a, b, c, d] ;
my $result = pat_match ($pattern, $input, {} ) ;
ok ("@{$result->{Y}}","b c") ;
}
# 3
{
my $pattern = [a, [qw(X +)], d] ;
my $input = [a, b, c, d] ;
ok ("@{$result->{X}}","b c") ;
}
# 4
{
my $pattern = [ a, [qw(X ?)], c ] ;
my $input = [ a, b, c ] ;
my $result = pat_match ($pattern, $input, {} ) ;
ok ("$result->{X}","b") ;
}
# 5
{
my $pattern = [ qw(X OP Y is Z),
[
sub { "($_->{X} $_->{OP} $_->{Y}) == $_->{Z}" },
IF?
]
] ;
my $input = [qw(3 + 4 is 7) ] ;
my $result = pat_match ($pattern, $input, {} ) ;
ok ($result) ;
}
Single-matching:
Take a single input and a series of patterns and decide which pattern
matches the input:
# 1 - Here all input patterns must match the input
{
my @pattern ;
push @pattern, [ qw(X Y) ] ;
push @pattern, [ qw(22 Z ) ] ;
push @pattern, [ qw(M 33) ] ;
my $input = [ qw(22 33) ] ;
my $meta_pattern = [ AND?, @pattern ] ;
# if no bindings, add a binding between pattern and input
my $result = pat_match ($meta_pattern, $input, {} ) ;
ok ($result->{Z},33) ;
}
# 2 - Here, any one of the patterns must match the input
{
my @pattern ;
push @pattern, [ qw(99 22) ] ;
push @pattern, [ qw(33 22) ] ;
push @pattern, [ qw(44 3) ] ;
push @pattern, [ qw(22 Z) ] ;
my $input = [ qw(22 33) ] ;
my $meta_pattern = [ OR?, @pattern ] ;
# if no bindings, add a binding between pattern and input
my $result = pat_match ($meta_pattern, $input, {} ) ;
ok ($result->{Z},33) ;
}
# 3 - Here, none of the patterns must match the input
{
my @pattern ;
push @pattern, [ qw(99 22) ] ;
push @pattern, [ qw(33 22) ] ;
push @pattern, [ qw(44 3) ] ;
push @pattern, [ qw(22 Z) ] ;
my $input = [ qw(22 33) ] ;
my $meta_pattern = [ NOT?, @pattern ] ;
# if no bindings, add a binding between pattern and input
my $result = pat_match ($meta_pattern, $input, {} ) ;
ok (scalar keys %$result == 0) ;
}
# 4 - here the input must satisfy the predicate
{
sub numberp { $_[0] =~ /d+/ }
my $pattern = [ qw(X age), [qw(IS? N), νmberp] ] ;
my $input = [ qw(Mary age), thirty-four ] ;
# if no bindings, add a binding between pattern and input
my $result = pat_match ($pattern, $input, {} ) ;
ok (!defined($result));
}
# 5 - same thing, but this time a failing result ---
# not undef because it is the return val of numberp
{
sub numberp { $_[0] =~ /d+/ }
my $pattern = [ qw(X age), [qw(IS? N), νmberp] ] ;
my $input = [ qw(Mary age), 34 ] ;
my $result = pat_match ($pattern, $input, {} ) ;
ok ($result->{N},34) ;
}
Segment-matching:
Match a chunk of the input stream using *, +, ?
# 1 - * is greedy in this case, but not with 2 consecutve * patterns
{
my $pattern = [a, [qw(X *)], d] ;
my $input = [a, b, c, d] ;
# if no bindings, add a binding between pattern and input
my $result = pat_match ($pattern, $input, {} ) ;
warn sprintf "X*RETVAL: %s", Data::Dumper::Dumper($result) ;
ok ("@{$result->{X}}","b c") ;
}
# 2 - X* gets nothing, Y* gets all it can:
{
my $pattern = [a, [qw(X *)], [qw(Y *)], d] ;
my $input = [a, b, c, d] ;
# if no bindings, add a binding between pattern and input
my $result = pat_match ($pattern, $input, {} ) ;
warn sprintf "X*Y*RETVAL: %s", Data::Dumper::Dumper($result) ;
ok ("@{$result->{Y}}","b c") ;
}
# 3 - samething , but require at least one match for X
{
my $pattern = [a, [qw(X +)], d] ;
my $input = [a, b, c, d] ;
my $result = pat_match ($pattern, $input, {} ) ;
warn sprintf "RETVAL: @{$result->{X}}" ;
ok ("@{$result->{X}}","b c") ;
}
# 4 - require 0 or 1 match for X
{
my $pattern = [ a, [qw(X ?)], c ] ;
my $input = [ a, b, c ] ;
my $result = pat_match ($pattern, $input, {} ) ;
ok ("$result->{X}","b") ;
}
# 5 - evaluate a sub on the fly after match
{
my $pattern = [ qw(X OP Y is Z),
[
sub { "($_->{X} $_->{OP} $_->{Y}) == $_->{Z}" },
IF?
]
] ;
my $input = [qw(3 + 4 is 7) ] ;
my $result = pat_match ($pattern, $input, {} ) ;
ok ($result) ;
}
# --- 6 same thing, but fail
{
my $pattern = [ qw(X OP Y is Z),
[
sub { "($_->{X} $_->{OP} $_->{Y}) == $_->{Z}" },
IF?
]
] ;
my $input = [qw(3 + 4 is 8) ] ;
my $result = pat_match ($pattern, $input, {} ) ;
warn sprintf "IF_RETVAL2: *%s*", Data::Dumper::Dumper($result);
ok ($result eq ) ;
}
Download (0.006MB)
Added: 2007-07-12 License: Perl Artistic License Price:
836 downloads
Cross-LFS 1.0.0
Cross-LFS is a project that provides you with step-by-step instructions for building your own customized Linux system. more>>
Cross-LFS stands for Cross Linux From Scratch (CLFS) and is a project that provides you with step-by-step instructions for building your own customized Linux system entirely from source.
Why would I want a CLFS system?
Many wonder why they should go through the hassle of building a Linux system from scratch when they could just download an existing Linux distribution. However, there are several benefits of building CLFS. Consider the following:
CLFS teaches people how to build a cross compiler
Building CLFS teaches you how to make a cross-compiler and the necessary tools, to build a basic system on a different architecture. For example you would be able to build a Sparc toolchain on an x86 machine, and utilize that toolchain to build a Linux system from source code.
CLFS teaches people how to utilize a multilib system
CLFS takes advantage of the target systems capability, by utilizing a multilib capable build system.
CLFS teaches people how a Linux system works internally
Building CLFS teaches you about all that makes Linux tick, how things work together and depend on each other. And most importantly, how to customize it to your own tastes and needs.
Building CLFS produces a very compact Linux system
When you install a regular distribution, you often end up installing a lot of programs that you would probably never use. Theyre just sitting there taking up (precious) disk space.
CLFS can be built from most Unix Style Operating Systems
You can build CLFS even if you dont have Linux running. Our build instructions have been tested to build from Solaris and the BSDs.
CLFS is extremely flexible
Building CLFS could be compared to a finished house. CLFS will give you the skeleton of a house, but its up to you to install plumbing, electrical outlets, kitchen, bath, wallpaper, etc. You have the ability to turn it into whatever type of system you need it to be, customized completely for you.
CLFS offers you added security
You will compile the entire system from source, thus allowing you to audit everything, if you wish to do so, and apply all the security patches you want or need to apply. You dont have to wait for someone else to provide a new binary package that (hopefully) fixes a security hole. Often, you never truly know whether a security hole is fixed or not unless you do it yourself.
What can I do with my CLFS system?
A by-the-book CLFS system is fairly minimal, but is designed to provide a strong base on which you can add any packages you want. See the BLFS project for a selection of commonly used packages.
<<lessWhy would I want a CLFS system?
Many wonder why they should go through the hassle of building a Linux system from scratch when they could just download an existing Linux distribution. However, there are several benefits of building CLFS. Consider the following:
CLFS teaches people how to build a cross compiler
Building CLFS teaches you how to make a cross-compiler and the necessary tools, to build a basic system on a different architecture. For example you would be able to build a Sparc toolchain on an x86 machine, and utilize that toolchain to build a Linux system from source code.
CLFS teaches people how to utilize a multilib system
CLFS takes advantage of the target systems capability, by utilizing a multilib capable build system.
CLFS teaches people how a Linux system works internally
Building CLFS teaches you about all that makes Linux tick, how things work together and depend on each other. And most importantly, how to customize it to your own tastes and needs.
Building CLFS produces a very compact Linux system
When you install a regular distribution, you often end up installing a lot of programs that you would probably never use. Theyre just sitting there taking up (precious) disk space.
CLFS can be built from most Unix Style Operating Systems
You can build CLFS even if you dont have Linux running. Our build instructions have been tested to build from Solaris and the BSDs.
CLFS is extremely flexible
Building CLFS could be compared to a finished house. CLFS will give you the skeleton of a house, but its up to you to install plumbing, electrical outlets, kitchen, bath, wallpaper, etc. You have the ability to turn it into whatever type of system you need it to be, customized completely for you.
CLFS offers you added security
You will compile the entire system from source, thus allowing you to audit everything, if you wish to do so, and apply all the security patches you want or need to apply. You dont have to wait for someone else to provide a new binary package that (hopefully) fixes a security hole. Often, you never truly know whether a security hole is fixed or not unless you do it yourself.
What can I do with my CLFS system?
A by-the-book CLFS system is fairly minimal, but is designed to provide a strong base on which you can add any packages you want. See the BLFS project for a selection of commonly used packages.
Download (MB)
Added: 2006-09-28 License: BSD License Price:
1125 downloads
ScratchboxMultiCpu 2.3
Scratchbox is a cross-compilation toolkit designed to make embedded Linux application development easier. more>>
Scratchbox is a cross-compilation toolkit designed to make embedded Linux application development easier.
The project also provides a full set of tools to integrate and cross-compile an entire Linux distribution.
<<lessThe project also provides a full set of tools to integrate and cross-compile an entire Linux distribution.
Download (680.6MB)
Added: 2007-06-14 License: GPL (GNU General Public License) Price:
872 downloads
JRicochet 2
JRicochet is a simple puzzle game. more>>
JRicochet is a simple puzzle game. It consists of a 10x10 grid, which contains 5 invisible blocks. From each side a player can shoot probes into the grid. Goal is to find the blocks by the pattern of the ricochetting probes in as few shots as possible.
<<less Download (0.54MB)
Added: 2007-06-25 License: GPL (GNU General Public License) Price:
852 downloads
KXStitch 0.8
KXStitch can be used to create cross stitch patterns. more>>
KXStitchs aim is to create software to allow the creation and editing of cross stitch patterns. Although software for this type of application has existed on the Windows platform for many years, there has never been an application written specifically for the Linux platform.
KXStitch will be developed for Linux using KDE/QT.
Main features:
- Creation of new patterns
- User defined size
- Selection of material type
- Selection of material colour
- Importing of various picture formats
- Importing images from a scanner
- Importing options will allow
- Limiting colours to a specific palette
- Limiting the number of colours
- Setting of the finished size
- Cropping of the image
- Support for transparancy in images
- Use of an image background for tracing
- Editing of existing patterns
- Editing tools will include
- Open and filled recangles
- Open and filled ellipses
- Filled polylines
- Lines
- Erasing stitches and backstitches
- Colour selection from existing stitch
- Swap colours
- Replace colour
- Cut, copy and paste of rectangular regions
- Stitch type and colour masks can be used to limit the selection
- Undo, Redo
- Mirroring
- Rotation
- Scaling
- Resizing of the canvas
- Extending canvas left, top, right, bottom
- Cropping canvas to the pattern
- Cropping canvas to selection
- Inserting rows and columns
- Centering current pattern on the canvas
- Conversion between floss schemes
- Display scales in Stitches,CM and inches
- Use of various floss palettes, DMC, Anchor, Madeira
- Creation of custom palettes
- Creation of new colours
- Use of standard stitches
- Creation of custom stitches
- Free use of backstitching
- Printing of patterns and floss keys
- (implemented, but needs to be enhanced)
- Mapping of symbols to flosses
- Calibration of floss colours
- Adding notes to patterns
- Full previews with layout tools
- Pattern library
Enhancements:
- Added a new palette manager to replace add floss and remove flosses dialogs
- New palette manager allows allocation of strands for stitches and backstitches
- New palette manager allows allocation of symbols for flosses
- Import / Export of library patterns
- Undo / Redo partially implemented
- Faster rendering speed
- Mouse tracking display in the status bar
- Selection tool and drawing tools scroll the editor screen
- Bug fix for using background images not on the local file system
- Bug fix for filenames used on the command line
- Bug fix page page wrapping
<<lessKXStitch will be developed for Linux using KDE/QT.
Main features:
- Creation of new patterns
- User defined size
- Selection of material type
- Selection of material colour
- Importing of various picture formats
- Importing images from a scanner
- Importing options will allow
- Limiting colours to a specific palette
- Limiting the number of colours
- Setting of the finished size
- Cropping of the image
- Support for transparancy in images
- Use of an image background for tracing
- Editing of existing patterns
- Editing tools will include
- Open and filled recangles
- Open and filled ellipses
- Filled polylines
- Lines
- Erasing stitches and backstitches
- Colour selection from existing stitch
- Swap colours
- Replace colour
- Cut, copy and paste of rectangular regions
- Stitch type and colour masks can be used to limit the selection
- Undo, Redo
- Mirroring
- Rotation
- Scaling
- Resizing of the canvas
- Extending canvas left, top, right, bottom
- Cropping canvas to the pattern
- Cropping canvas to selection
- Inserting rows and columns
- Centering current pattern on the canvas
- Conversion between floss schemes
- Display scales in Stitches,CM and inches
- Use of various floss palettes, DMC, Anchor, Madeira
- Creation of custom palettes
- Creation of new colours
- Use of standard stitches
- Creation of custom stitches
- Free use of backstitching
- Printing of patterns and floss keys
- (implemented, but needs to be enhanced)
- Mapping of symbols to flosses
- Calibration of floss colours
- Adding notes to patterns
- Full previews with layout tools
- Pattern library
Enhancements:
- Added a new palette manager to replace add floss and remove flosses dialogs
- New palette manager allows allocation of strands for stitches and backstitches
- New palette manager allows allocation of symbols for flosses
- Import / Export of library patterns
- Undo / Redo partially implemented
- Faster rendering speed
- Mouse tracking display in the status bar
- Selection tool and drawing tools scroll the editor screen
- Bug fix for using background images not on the local file system
- Bug fix for filenames used on the command line
- Bug fix page page wrapping
Download (0.71MB)
Added: 2006-07-03 License: GPL (GNU General Public License) Price:
700 downloads
Rock Dodgers 0.6.0a
Rock Dodgers project is a game in which you avoid flying space rocks. more>>
Rock Dodgers project is a game in which you avoid flying space rocks.
Use your shields, fire your thrusters, cross your fingers, and kiss your ship goodbye.
<<lessUse your shields, fire your thrusters, cross your fingers, and kiss your ship goodbye.
Download (0.41MB)
Added: 2006-12-07 License: GPL (GNU General Public License) Price:
1054 downloads
AVR Cross Development Kit 20060719
AVR Cross Development Kit is a cross development kit for the AVR RISC processor. more>>
CDK4AVR stands for Cross Development Kit for Atmels AVR RISC processor serie and should support your development with a comprehensive Assembler and C development environment for even this processor familie under Linux. It will present only free of fee tools, so you can use it without risks. Further you will find some useful OS projects and related sample code all arround AVRs inside of the example packages.
CDK4AVR collects all programms and development tools in one directory (/opt/cdk4avr) and will try to present an easy to admin installation.
My intention for CDK4AVR is / was to provide a full featurd tool chain distribution of all the free accessible resources, because the most stuff is scattered to the wide of the whole Internet and only compileable by wizards or professions.
Installation:
Each package will be provided as RPM only. It is not necessary to install all packages,but you have to install the base package cdk-avr-base every time you want to use another package. Here is an example for a typical GNU development environment:
[user@host]$ rpm -hiv cdk-avr-base-0.3-20031111.i386.rpm
[user@host]$ rpm -hiv cdk-avr-binutils-2.14-20030906.i386.rpm
[user@host]$ rpm -hiv cdk-avr-gcc-3.3.2-20031021.i386.rpm
[user@host]$ rpm -hiv cdk-avr-gcc-c++-3.3.2-20031021.i386.rpm
[user@host]$ rpm -hiv cdk-avr-gcc-colorgcc-3.3.2-20031021.i386.rpm
[user@host]$ rpm -hiv cdk-avr-libc-1.0.2-20040229.noarch.rpm
[user@host]$ rpm -hiv cdk-avr-gdb-6.0-20031019.i386.rpm
[user@host]$ rpm -hiv cdk-avr-simulavr-0.1.2.20040304cvs-20040304.i386.rpm
[user@host]$ rpm -hiv cdk-avr-avarice-2.2-20040229.i386.rpm
[user@host]$ rpm -hiv cdk-avr-uisp-20040207cvs-20040304.i386.rpm
[user@host]$ rpm -hiv cdk-avr-avrdude-4.3.0-20040229.i386.rpm
Base package -- is needed every time you will use any CDK4AVR package.
NOTE: Users of base packages with version 0.2 and prior have to update to latest version. There was a damaged (t)csh startup script. As a result of an buggy %preun script in previous packages you have to update in two cycles:
[user@host]$ rpm -hUv cdk-nios-base-0.3-20031111.i386.rpm
[user@host]$ rpm -hUv --force cdk-nios-base-0.3-20031111.i386.rpm
Enhancements:
- There are minor feature enhancements in AVR-Ada 0.4.1.
- As a result, the packeges for binutils and gcc/gnat were rebuilt.
- There are new packages for the AVR-Ada run time system and related examples.
<<lessCDK4AVR collects all programms and development tools in one directory (/opt/cdk4avr) and will try to present an easy to admin installation.
My intention for CDK4AVR is / was to provide a full featurd tool chain distribution of all the free accessible resources, because the most stuff is scattered to the wide of the whole Internet and only compileable by wizards or professions.
Installation:
Each package will be provided as RPM only. It is not necessary to install all packages,but you have to install the base package cdk-avr-base every time you want to use another package. Here is an example for a typical GNU development environment:
[user@host]$ rpm -hiv cdk-avr-base-0.3-20031111.i386.rpm
[user@host]$ rpm -hiv cdk-avr-binutils-2.14-20030906.i386.rpm
[user@host]$ rpm -hiv cdk-avr-gcc-3.3.2-20031021.i386.rpm
[user@host]$ rpm -hiv cdk-avr-gcc-c++-3.3.2-20031021.i386.rpm
[user@host]$ rpm -hiv cdk-avr-gcc-colorgcc-3.3.2-20031021.i386.rpm
[user@host]$ rpm -hiv cdk-avr-libc-1.0.2-20040229.noarch.rpm
[user@host]$ rpm -hiv cdk-avr-gdb-6.0-20031019.i386.rpm
[user@host]$ rpm -hiv cdk-avr-simulavr-0.1.2.20040304cvs-20040304.i386.rpm
[user@host]$ rpm -hiv cdk-avr-avarice-2.2-20040229.i386.rpm
[user@host]$ rpm -hiv cdk-avr-uisp-20040207cvs-20040304.i386.rpm
[user@host]$ rpm -hiv cdk-avr-avrdude-4.3.0-20040229.i386.rpm
Base package -- is needed every time you will use any CDK4AVR package.
NOTE: Users of base packages with version 0.2 and prior have to update to latest version. There was a damaged (t)csh startup script. As a result of an buggy %preun script in previous packages you have to update in two cycles:
[user@host]$ rpm -hUv cdk-nios-base-0.3-20031111.i386.rpm
[user@host]$ rpm -hUv --force cdk-nios-base-0.3-20031111.i386.rpm
Enhancements:
- There are minor feature enhancements in AVR-Ada 0.4.1.
- As a result, the packeges for binutils and gcc/gnat were rebuilt.
- There are new packages for the AVR-Ada run time system and related examples.
Download (MB)
Added: 2006-07-20 License: Freely Distributable Price:
1206 downloads
Original Gamers Client 0.4.7
Original Gamers Client is a cross-platform GUI MUD client. more>>
Original Gamers Client project is a cross-platform GUI MUD client.
Original Gamers Client aims to combine the convenience of a GUI-based MUD client with the power that seems reserved for TUI-based clients. OGC implements its GUI using Tk.
<<lessOriginal Gamers Client aims to combine the convenience of a GUI-based MUD client with the power that seems reserved for TUI-based clients. OGC implements its GUI using Tk.
Download (MB)
Added: 2006-12-13 License: GPL (GNU General Public License) Price:
1046 downloads
La Carta Mas Alta 2005-12-19
La Carta Mas Alta is a card game written in PHP and HTML. more>>
La Carta Mas Alta is a card game written in PHP and HTML.
La Carta Mas Alta is a cross-platform and cross-browser game was tested under BeOS, Linux, NetBSD, OpenBSD, FreeBSD, Windows, and others.
<<lessLa Carta Mas Alta is a cross-platform and cross-browser game was tested under BeOS, Linux, NetBSD, OpenBSD, FreeBSD, Windows, and others.
Download (0.011MB)
Added: 2006-08-18 License: MPL (Mozilla Public License) Price:
1162 downloads
BushSweeper 0.5
BushSweeper is a clone of minesweeper game and it is cross platform. more>>
BushSweeper is a clone of minesweeper game and it is cross platform. Clone of minesweeper game but you sweep bushs from your country. It was programmed in C++ and used FLTK GUI library cross platform.
<<less Download (1.2MB)
Added: 2007-02-16 License: GPL (GNU General Public License) Price:
980 downloads
Secleted [ 0 ] software to compare
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above cross hatch pattern search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed