base
C++ base 1.0
C++ base is a base class suite contains several powerful c++ base classes for basic encapsulation. more>>
Further packages you may access from this page require the installation of this base package
Know Base 1.3
Know Base project consists of knowledge, document, and project management tool. more>>
Know Base is a Web-based knowledge management system. It allows users to share files and projects across multiple business divisions.
A unique notification system alerts users when projects are modified, or when new projects are added that match their search terms.
DNA BASER 2.60
Visit us for updated info: http://www.DNABaser.com DNA Baser Assembler is easy to use software for simple and batch DNA sequence assembly, DNA sequence analysis, contig editing, metadata integration and mutation detection. It also offers a powerful chromatogram viewer/editor. The truly user-friendly interface makes DNA Baser the best choice for DNA contig assembly. For more details, see the DNA BASER Features page. File formats supported are abi, scf and seq (or FASTA). Features: end clip, export,auto trim... more>>
DNA BASER - Visit us for updated info: http://www.DNABaser.com
DNA Baser Assembler is easy to use software for simple and batch DNA sequence assembly, DNA sequence analysis, contig editing, metadata integration and mutation detection. It also offers a powerful chromatogram viewer/editor. The truly user-friendly interface makes DNA Baser the best choice for DNA contig assembly. For more details, see the DNA BASER Features page.
Why is DNA Baser Assembler special?
Any software company pretends that their product is the best. But lets see for real if DNA Baser can offer you a better proposition. As you will see below we concentrate on adding automatic and batch functions to our product in order to decrease the time. Additional to this, DNA Baser is available at a "kill your competition" price.
Forget about manually trimming the low quality ends of your sequences. DNA Baser Assembler will do it for you!
Do you think you need weeks to assemble hundreds of contigs? What about doing this in minutes? DNA Baser is the only software that can automatically detect and assemble sequences belonging to the same contig based on their filename.
Do you think that is necessary to spend more than 20 minutes to correct discrepancies and mismatches in every contig? Wrong! DNA Baser is the first software which can make correct suggestions in at least 98% of cases.
Have you ever wondered how others laboratories afford to have sequence assembly software in EVERY computer? Simple! They dont spend thousands of dollars for each license. They use DNA Baser Assembler. DNA Baser is affordable, has no annual maintenance fees, technical support is included in price and you have instant access to your key, right after purchase.
You dont have to fill in and submit forms in order to get a trial version. If you want to try it, you can download and install it in less than one minute. No personal data or registration process is required. The trial version is fully functional.
DNA BASER Assembler offers a smart navigation system that takes you to the location of each sequence ambiguity / mutation with a single click.
Enhancements:
Version 2.60
New: Metadata and batch metadata integration.
New: Button to open Windows Explorer in contigs folder, after sequence assembly.
New: Remove vectors from single chromatograms.
New: SEQUENCE ANALISYS - mark al bases with a confidence level (QV) below a specified threshold, in red.
New: Batch convert from chromatogram to Fasta with vector removal and automatic metadata integration.
New: Resizable chromatograms.
Full support for low quality sample ends editing.
100% compatible with Mac via Parallels/Bootcamp/VMWare.
Improved handling of corrupted/invalid ABI/SCF files.
Improved contig editor.
Improved file association.
Improved Assemble to reference.
Improved log window.
Improved file handling: Before starting the contig, check if all files in the JobList are valid. Invalid samples are automatically removed from Job List so the assembly process can continue without human intervention. Build a list of invalid files and report it.
Improved user interface: new toolbar, improved embedded help, interactive help, workflow...
Improved sample viewer: Mark as trusted/un-trusted can now be used also in Sample viewer window
New: Show error message while trying to open empty/invalid FASTA files
Improved: Correctly handle multiple contigs resulted when assembling to a reference.
Improved: menu Save as Fasta/Seq/Scf was replaced with Save all as... and Save selected as.... Now the user can choose where to save the file.
Version 2.10
Batch assembly. Thousand of contigs can be assembled at once.
System Requirements:CPU: 333MHz, 64MB RAM, Video 1024x768, 2MB HDD free space<<less
base::ball 0.0.2
base::ball - b all the namespaces under the given one(s). more>>
SYNOPSIS
use base::ball qw(Foo::Utils);
equivalent to:
use base qw(Foo::Utils);
use base qw(Foo::Utils::Data);
use base qw(Foo::Utils::UI);
use base qw(Foo::Utils::Sys);
use base qw(Foo::Utils::Sys::Unix);
use base qw(Foo::Utils::Sys::Win32);
use base qw(Foo::Utils::Run);
Recursively searches the directory that the given name spaces are in to also use base on their "child" name spaces based on any .pm files found and any directories that belong to that .pm
In other words, assuming that the Foo/ that Foo::Utils is in has:
Utils/Data.pm, Utils/UI.pm, Utils/Sys.pm, Utils/Sys/Unix.pm, Utils/Sys/Win32.pm, Utils/Run.pm
then the synopsis is correct.
Note it does not follow directories who do not firts have a .pm, in other words:
Foo/Utils/Whatever/Fiddle.pm will no get Foo:Utils::Whatever::Fiddle as base unless Foo/Utils/Whatever.pm exists (and therefore Foo::Utils::Whatever is a base)
This is by design for good reasons and given enough popular demand may lead to support for it.
XML::SAX::Base 1.02
XML::SAX::Base is a base class SAX Drivers and Filters. more>>
SYNOPSIS
package MyFilter;
use XML::SAX::Base;
@ISA = (XML::SAX::Base);
This module has a very simple task - to be a base class for PerlSAX drivers and filters. Its default behaviour is to pass the input directly to the output unchanged. It can be useful to use this module as a base class so you dont have to, for example, implement the characters() callback.
The main advantages that it provides are easy dispatching of events the right way (ie it takes care for you of checking that the handler has implemented that method, or has defined an AUTOLOAD), and the guarantee that filters will pass along events that they arent implementing to handlers downstream that might nevertheless be interested in them.
WRITING SAX DRIVERS AND FILTERS
Writing SAX Filters is tremendously easy: all you need to do is inherit from this module, and define the events you want to handle. A more detailed explanation can be found at http://www.xml.com/pub/a/2001/10/10/sax-filters.html.
Writing Drivers is equally simple. The one thing you need to pay attention to is NOT to call events yourself (this applies to Filters as well). For instance:
package MyFilter;
use base qw(XML::SAX::Base);
sub start_element {
my $self = shift;
my $data = shift;
# do something
$self->{Handler}->start_element($data); # BAD
}
The above example works well as precisely that: an example. But it has several faults: 1) it doesnt test to see whether the handler defines start_element. Perhaps it doesnt want to see that event, in which case you shouldnt throw it (otherwise itll die). 2) it doesnt check ContentHandler and then Handler (ie it doesnt look to see that the user hasnt requested events on a specific handler, and if not on the default one), 3) if it did check all that, not only would the code be cumbersome (see this modules source to get an idea) but it would also probably have to check for a DocumentHandler (in case this were SAX1) and for AUTOLOADs potentially defined in all these packages. As you can tell, that would be fairly painful. Instead of going through that, simply remember to use code similar to the following instead:
package MyFilter;
use base qw(XML::SAX::Base);
sub start_element {
my $self = shift;
my $data = shift;
# do something to filter
$self->SUPER::start_element($data); # GOOD (and easy) !
}
This way, once youve done your job you hand the ball back to XML::SAX::Base and it takes care of all those problems for you!
Note that the above example doesnt apply to filters only, drivers will benefit from the exact same feature.
MP3::Find::Base 0.06
MP3::Find::Base is a base class for MP3::Find backends. more>>
SYNOPSIS
package MyFinder;
use base MP3::Find::Base;
sub search {
my $self = shift;
my ($query, $dirs, $sort, $options) = @_;
# do something to find and sort the mp3s...
my @results = do_something(...);
return @results;
}
package main;
my $finder = MyFinder->new;
# see MP3::Find for details about %options
print "$_n" foreach $finder->find_mp3s(%options);
This is the base class for the classes that actually do the searching and sorting for MP3::Find.
Exception::Base 0.07
Exception::Base is a Perl module with lightweight exceptions. more>>
SYNOPSIS
# Use module and create needed exceptions
use Exception::Base (
Exception::IO,
Exception::FileNotFound => { message => File not found,
isa => Exception::IO },
);
# try / catch
try Exception eval {
do_something() or throw Exception::FileNotFound
message=>Something wrong,
tag=>something;
};
# Catch the Exception::Base, other exceptions throw immediately
if (catch Exception::Base my $e) {
# $e is an exception object for sure, no need to check if is blessed
if ($e->isa(Exception::IO)) { warn "IO problem"; }
elsif ($e->isa(Exception::Die)) { warn "eval died"; }
elsif ($e->isa(Exception::Warn)) { warn "some warn was caught"; }
elsif ($e->with(tag=>something)) { warn "something happened"; }
elsif ($e->with(qr/^Error/)) { warn "some error based on regex"; }
else { $e->throw; } # rethrow the exception
}
# the exception can be thrown later
$e = new Exception::Base;
$e->throw;
# try with array context
@v = try Exception::Base [eval { do_something_returning_array(); }];
# use syntactic sugar
use Exception::Base qw , Exception::IO;
try eval {
throw Exception::IO;
}; # dont forget about semicolon
catch my $e, [Exception::IO]; # Exception::Base is by default
This class implements a fully OO exception mechanism similar to Exception::Class or Class::Throwable. It does not depend on other modules like Exception::Class and it is more powerful than Class::Throwable. Also it does not use closures as Error and does not polute namespace as Exception::Class::TryCatch. It is also much faster than Exception::Class.
Main features:
- fast implementation of an exception object
- fully OO without closures and source code filtering
- does not mess with $SIG{__DIE__} and $SIG{__WARN__}
- no external modules dependencies, requires core Perl modules only
- implements error stack, the try/catch blocks can be nested
- shows full backtrace stack on die by default
- the default behaviour of exception class can be changed globally or just for the thrown exception
- the exception can be created with defined custom properties
- matching the exception by class, message or custom properties
- matching with string, regex or closure function
- creating automatically the derived exception classes ("use" interface)
- easly expendable, see Exception::System class for example
Persistent::Base 0.52
Persistent::Base is an Abstract Persistent Base Class. more>>
SYNOPSIS
### we are a subclass of ... ###
use Persistent::Base;
@ISA = qw(Persistent::Base);
ABSTRACT
This is an abstract class used by the Persistent framework of classes to implement persistence with various types of data stores. This class provides the methods and interface for implementing Persistent classes. Refer to the Persistent documentation for a very thorough introduction to using the Persistent framework of classes.
This class is part of the Persistent base package which is available from:
http://www.bigsnow.org/persistent
ftp://ftp.bigsnow.org/pub/persistent
Before we get started describing the methods in detail, it should be noted that all error handling in this class is done with exceptions. So you should wrap an eval block around all of your code. Please see the Persistent documentation for more information on exception handling in Perl.
ABSTRACT METHODS THAT NEED TO BE OVERRIDDEN IN THE SUBCLASS
datastore -- Sets/Returns the Data Store Parameters
eval {
### set the data store ###
$person->datastore(@args);
### get the data store ###
$href = $person->datastore();
};
croak "Exception caught: $@" if $@;
Returns (and optionally sets) the data store of the object. This method throws Perl execeptions so use it with an eval block.
Setting the data store can involve anything from initializing a connection to opening a file. Getting a data store usually means returning information pertaining to the data store in a useful form, such as a connection to a database or a location of a file.
EB::Shell::Base 1.01.02
EB::Shell::Base is a generic class to build line-oriented command interpreters. more>>
SYNOPSIS
package My::Shell;
use base qw(EB::Shell::Base);
sub do_greeting {
return "Hello!"
}
EB::Shell::Base is a slightly modified version of Shell::Base. It is modifed for the EekBoek program http://www.squirrel.nl/eekboek and NOT intended for general use. Please use Shell::Base instead.
Shell::Base is a base class designed for building command line programs. It defines a number of useful defaults, simplifies adding commands and help, and integrates well with Term::ReadLine.
After writing several REP (Read-Eval-Print) loops in Perl, I found myself wishing for something a little more convenient than starting with:
while(1) {
my $line = ;
last unless defined $line;
chomp $line;
if ($line =~ /^...
Features
Shell::Base provides simple access to many of the things I always write into my REPs, as well as support for many thing that I always intend to, but never find time for:
readline support
Shell::Base provides simple access to the readline library via Term::ReadLine, including built-in tab-completion and easy integration with the history file features.
If a subclass does want or need Term::ReadLine support, then it can be replaced in subclasses by overriding a few methods. See "Using Shell::Base Without readline", below.
Trivial to add commands
Adding commands to your shell is as simple as creating methods: the command foo is dispatched to do_foo. In addition, there are hooks for unknown commands and for when the user just hits , both of which a subclass can override.
Integrated help system
Shell::Base makes it simple to integrate online help within alongside your command methods. Help for a command foo can be retrieved with help foo, with the addition of one method. In addition, a general help command lists all possible help commands; this list is generated at run time, so theres no possibility of forgetting to add help methods to the list of available topics.
Pager integration
Output can be sent through the users default pager (as defined by $ENV{PAGER}, with a reasonable default) or dumped directly to STDOUT.
Customizable output stream(s)
Printing is handled through a print() method, which can be overridden in a subclass to send output anywhere.
Pre- and post-processing methods
Input received from readline() can be processed before it is parsed, and output from command methods can be post-processed before it is sent to print().
Automatic support for RC files
A simple RC-file parser is built in, which handles name = value type configuration files. This parser handles comments, whitespace, multiline definitions, boolean and (name, value) option types, and multiple files (e.g., /etc/foorc, $HOME/.foorc).
Shell::Base was originally based, conceptually, on Pythons cmd.Cmd class, though it has expanded far beyond what Cmd offers.
Math::BaseArith 1.00
Math::BaseArith is a Perl extension for mixed-base number representation (like APL encode/decode). more>>
SYNOPSIS
use Math::BaseArith;
encode( value, base_list );
decode( representation_list, base_list );
The inspiration for this module is a pair of functions in the APL programming language called encode (a.k.a. "representation") and decode (a.k.a. base-value). Their principal use is to convert numbers from one number base to another. Mixed number bases are permitted.
In this perl implementation, the representation of a number in a particular number base consists of a list whose elements are the digit values in that base. For example, the decimal number 31 would be expressed in binary as a list of five ones with any number of leading zeros: [0, 0, 0, 1, 1, 1, 1, 1]. The same number expressed as three hexadecimal (base 16) digits would be [0, 1, 15], while in base 10 it would be [0, 3, 1]. Fifty-one inches would be expressed in yards, feet, inches as [1, 1, 3], an example of a mixed number base.
In the following description of encode and decode, Q will mean an abstract value or quantity, R will be its representation and B will define the number base. Q will be a perl scalar; R and B are perl lists. The values in R correspond to the radix values in B.
In the examples below, assume the output of print has been altered by setting $, = and that => is your shell prompt.
Games::LMSolve::Base 0.8.1
Games::LMSolve::Base is a base class for puzzle solvers. more>>
SYNOPSIS
package MyPuzzle::Solver;
use Games::LMSolve::Base;
@ISA = qw(Games::LMSolve::Base);
# Override these methods:
sub input_board { ... }
sub pack_state { ... }
sub unpack_state { ... }
sub display_state { ... }
sub check_if_final_state { ... }
sub enumerate_moves { ... }
sub perform_move { ... }
# Optionally:
sub render_move { ... }
sub check_if_unsolvable { ... }
package main;
my $self = MyPuzzle::Solver->new();
$self->solve_board($filename);
This class implements a generic solver for single player games. In order to use it, one must inherit from it and implement some abstract methods. Afterwards, its interface functions can be invoked to actually solve the game.
Qalculate! Bases 0.9.4
Qalculate! is a multi-purpose desktop calculator for GNU/Linux. more>>
Main features:
- Redesigned GUI with history view in the main window
- Display of as-you-type expression parsing and function hints
- Enhanced completion
- Scaling of result display to vertically fit the window
- Nicer history listing
- Enhanced result display with much nicer parentheses
- Meta modes
- 67 new units: bel (B) and neper (Np), information units such as bit and byte, many convenience units (km/h, deciliter, etc), and more.
- Binary prefixes
- Some new variables and functions
- Fixed help display in new yelp
- Fixed compile with cln-1.1.10
- Fixed regressions in simplification
- Fixed f(x) return type analysis (ex. log(x) represents a real number if x represents a positive). This was by accident unused.
- ...and many more bug fixes and enhancements...
Math::Symbolic::Base 0.508
Math::Symbolic::Base is a case class for symbols in symbolic calculations. more>>
SYNOPSIS
use Math::Symbolic::Base;
This is a base class for all Math::Symbolic::* terms such as Math::Symbolic::Operator, Math::Symbolic::Variable and Math::Symbolic::Constant objects.
METHODS
Method to_string
Default method for stringification just returns the objects value.
Method value
value() evaluates the Math::Symbolic tree to its numeric representation.
value() without arguments requires that every variable in the tree contains a defined value attribute. Please note that this refers to every variable object, not just every named variable.
value() with one argument sets the objects value (in case of a variable or constant).
value() with named arguments (key/value pairs) associates variables in the tree with the value-arguments if the corresponging key matches the variable name. (Can one say this any more complicated?) Since version 0.132, an alternative syntax is to pass a single hash reference.
Example: $tree->value(x => 1, y => 2, z => 3, t => 0) assigns the value 1 to any occurrances of variables of the name "x", aso.
If a variable in the tree has no value set (and no argument of value sets it temporarily), the call to value() returns undef.
Method signature
signature() returns a trees signature.
In the context of Math::Symbolic, signatures are the list of variables any given tree depends on. That means the tree "v*t+x" depends on the variables v, t, and x. Thus, applying signature() on the tree that would be parsed from above example yields the sorted list (t, v, x).
Constants do not depend on any variables and therefore return the empty list. Obviously, operators dependencies vary.
Math::Symbolic::Variable objects, however, may have a slightly more involved signature. By convention, Math::Symbolic variables depend on themselves. That means their signature contains their own name. But they can also depend on various other variables because variables themselves can be viewed as placeholders for more compicated terms. For example in mechanics, the acceleration of a particle depends on its mass and the sum of all forces acting on it. So the variable acceleration would have the signature (acceleration, force1, force2,..., mass, time).
If youre just looking for a list of the names of all variables in the tree, you should use the explicit_signature() method instead.
Method explicit_signature
explicit_signature() returns a lexicographically sorted list of variable names in the tree.
See also: signature().
Method set_signature
set_signature expects any number of variable identifiers as arguments. It sets a variables signature to this list of identifiers.
Method implement
implement() works in-place!
Takes key/value pairs as arguments. The keys are to be variable names and the values must be valid Math::Symbolic trees. All occurrances of the variables will be replaced with their implementation.
Method replace
First argument must be a valid Math::Symbolic tree.
replace() modifies the object it is called on in-place in that it replaces it with its first argument. Doing that, it retains the original object reference. This destroys the object it is called on.
However, this also means that you can create recursive trees of objects if the new tree is to contain the old tree. So make sure you clone the old tree using the new() method before using it in the replacement tree or you will end up with a program that eats your memory fast.
fill_in_vars
This method returns a modified copy of the tree it was called on.
It walks the tree and replaces all variables whose value attribute is defined (either done at the time of object creation or using set_value()) with the corresponding constant objects. Variables whose value is not defined are unaffected. Take, for example, the following code:
$tree = parse_from_string(a*b+a*c);
$tree->set_value(a => 4, c => 10); # value of b still not defined.
print $tree->fill_in_vars();
# prints "(4 * b) + (4 * 10)"
Method simplify
Minimum method for term simpilification just clones.
Method descending_operands
When called on an operator, descending_operands tries hard to determine which operands to descend into. (Which usually means all operands.) A list of these is returned.
When called on a constant or a variable, it returns the empty list.
Of course, some routines may have to descend into different branches of the Math::Symbolic tree, but this routine returns the default operands.
The first argument to this method may control its behaviour. If it is any of the following key-words, behaviour is modified accordingly:
default -- obvious. Use default heuristics.
These are all supersets of default:
all -- returns ALL operands. Use with caution.
all_vars -- returns all operands that may contain vars.
SurakWare Base Library 0.4.0
The purpose of the SurakWare Base Library (SWL/libswl) is to serve as a platform independent framework for C++ and QPascal. more>>
The SWL includes both thin layers over functionality exposed by the Linux and Windows operating systems as well as higher level classes for many purposes. Save for a few exceptions, the SWL is completely indpedenent from the STL and the C/C++ runtime library.
Platform independence has been achieved by encapsulating OS-specific implementation details in a number of SWL classes. There should never be a need to use "#ifdef"s to distinguish between platforms.
Enhancements:
- Some memory and file descriptor leaks were fixed.
- Some buffer indexing problems were fixed. I/O dispatcher problems on high load notifies were fixed.
- TFile::directory() was fixed.
- TEventManagers add/remove operation logic was improved.
- TNullEnumerator::moveNext() was fixed so that it returns false rather than throwing an exception.
- Some 64-bit vs. 32-bit compilation fixes were made.
- TStream::readTimeout and writeTimeout were backported from trunk to 0.4 (and thus introduced EIOTimeout exception).
- General improvements were made to TArgumentEvaluator and TAnsiColor.
- General code cleanup was done.
Acme::MorningMusume::Base 0.07
Acme::MorningMusume::Base is a baseclass of the class represents each member of Morning Musume. more>>
SYNOPSIS
use Acme::MorningMusume;
my $musume = Acme::MorningMusume->new;
# retrieve the members as a list of
# Acme::MorningMusume::Base based objects
my @members = $musume->members;
for my $member (@members) {
my $name_ja = $member->name_ja;
my $first_name_ja = $member->first_name_ja;
my $family_name_ja = $member->family_name_ja;
my $name_en = $member->name_en;
my $first_name_en = $member->first_name_en;
my $family_name_en = $member->family_name_en;
my $nick = $member->nick; # arrayref
my $birthday = $member->birthday; # Date::Simple object
my $age = $member->age;
my $blood_type = $member->blood_type;
my $hometown = $member->hometown;
my $emoticon = $member->emoticon; # arrayref
my $class = $member->class;
my $graduate_date = $member->graduate_date; # Date::Simple object
my $count;
my $images = $member->images(limit => 5);
while (my $image = $images->next) {
$count++;
my $content_url = $image->content_url;
my $context_url = $image->context_url;
$image->save_content(base => image . $count);
$image->save_context(base => page . $count);
}
}
Acme::MorningMusume::Base is a baseclass of the class represents each member of Morning Musume.