snow path
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 1297
Snow Path Formation Simulator 0.5.3
Snow Path Formation Simulator it graphically displays the formation of paths in the snow formed by people. more>>
Snow Path Formation Simulator is a program that models the process of people forming very distinct, and yet not always altogether logical looking, paths in the snow as they walk across open spaces.
The evolving condition of the snow is displayed graphically. This project may eventually mature into a screensaver.
<<lessThe evolving condition of the snow is displayed graphically. This project may eventually mature into a screensaver.
Download (0.10MB)
Added: 2005-04-25 License: GPL (GNU General Public License) Price:
1646 downloads
Snow-Apple
Snow-Apple provides an icon pack for Gnome. more>>
Snow-Apple provides an icon pack for Gnome.
Mark Finlay fairly converted the nautilus 2.0.x theme called Snow-Apple, to an icon theme for gnome 2.2.x. thanks to him.
<<lessMark Finlay fairly converted the nautilus 2.0.x theme called Snow-Apple, to an icon theme for gnome 2.2.x. thanks to him.
Download (0.50MB)
Added: 2007-01-27 License: GPL (GNU General Public License) Price:
1010 downloads
Xsnow 1.42
Xsnow is the X-windows application that will let it snow on the root, in between and on windows. more>>
Xsnow application is the X-windows application that will let it snow on the root, in between and on windows.
Santa and his reindeer will complete your festive-season feeling.
How to compile:
To build:
xmkmf
make depend
make
To run:
./xsnow
or:
./xsnow& (in the background)
To install (be root):
make install
make install.man
If xmkmf does not work and you cannot get a working Makefile that way then try compiling yourself, eh, xsnow this way:
cc -o xsnow snow.c -lXext -lX11 -lXpm -lm -lsocket -lnsl
gcc, SUN Solaris users without a C-compiler, but with gcc installed, try the following two commands. The first compiles Xsnow, the second links Xsnow.
gcc -c -O2 -I/usr/openwin/include -DSVR4 -DSYSV xsnow.c
gcc -o xsnow xsnow.o -O2 -L/usr/openwin/lib -lXext -lX11 -lXpm -lm -lsocket -lnsl
Note: Xsnow-1.41 needs the Xpm library. It is available from:
ftp://ftp.x.org/contrib/libraries/
The current Xpm version is xpm3.4k
Enhancements:
- All you KDE-users can now be even happier with a KDE-enabled Xsnow 1.42!
- The snow will magnificently wipe out your icons, but not to worry, theyre not really gone.
- By wiping with a window or something you can make them reappear.
- Car owners are used to this for years. Thanks to Robin Hogan who figured this out for xpenguin.
<<lessSanta and his reindeer will complete your festive-season feeling.
How to compile:
To build:
xmkmf
make depend
make
To run:
./xsnow
or:
./xsnow& (in the background)
To install (be root):
make install
make install.man
If xmkmf does not work and you cannot get a working Makefile that way then try compiling yourself, eh, xsnow this way:
cc -o xsnow snow.c -lXext -lX11 -lXpm -lm -lsocket -lnsl
gcc, SUN Solaris users without a C-compiler, but with gcc installed, try the following two commands. The first compiles Xsnow, the second links Xsnow.
gcc -c -O2 -I/usr/openwin/include -DSVR4 -DSYSV xsnow.c
gcc -o xsnow xsnow.o -O2 -L/usr/openwin/lib -lXext -lX11 -lXpm -lm -lsocket -lnsl
Note: Xsnow-1.41 needs the Xpm library. It is available from:
ftp://ftp.x.org/contrib/libraries/
The current Xpm version is xpm3.4k
Enhancements:
- All you KDE-users can now be even happier with a KDE-enabled Xsnow 1.42!
- The snow will magnificently wipe out your icons, but not to worry, theyre not really gone.
- By wiping with a window or something you can make them reappear.
- Car owners are used to this for years. Thanks to Robin Hogan who figured this out for xpenguin.
Download (0.055MB)
Added: 2006-04-13 License: Freeware Price:
1292 downloads
Added: 2008-03-01 License: GPL Price: FREE
14 downloads
Env::Path 0.18
Env::Path is a Perl module with advanced operations on path variables. more>>
Env::Path is a Perl module with advanced operations on path variables.
SYNOPSIS
use Env::Path;
# basic usage
my $manpath = Env::Path->MANPATH;
$manpath->Append(/opt/samba/man);
for ($manpath->List) { print $_, "n" };
# similar to above using the "implicit object" shorthand
Env::Path->MANPATH;
MANPATH->Append(/opt/samba/man);
for (MANPATH->List) { print $_, "n" };
# one-shot use
Env::Path->PATH->Append(/usr/sbin);
# change instances of /usr/local/bin to an architecture-specific dir
Env::Path->PATH->Replace(/usr/local/bin, "/usr/local/$ENV{PLATFORM}/bin");
# more complex use (different names for same semantics)
my $libpath;
if ($^O =~ /aix/) {
$libpath = Env::Path->LIBPATH;
} else {
$libpath = Env::Path->LD_LIBRARY_PATH;
}
$libpath->Assign(qw(/usr/lib /usr/openwin/lib));
$libpath->Prepend(/usr/ucblib) unless $libpath->Contains(/usr/ucblib);
$libpath->InsertAfter(/usr/ucblib, /xx/yy/zz);
$libpath->Uniqify;
$libpath->DeleteNonexistent;
$libpath->Remove(/usr/local/lib);
print $libpath->Name, ":";
for ($libpath->List) { print " $_" };
print "n";
# simplest usage: bless all existing EVs as Env::Path objects
use Env::Path :all;
my @cats = PATH->Whence(cat*);
print "@catsn";
<<lessSYNOPSIS
use Env::Path;
# basic usage
my $manpath = Env::Path->MANPATH;
$manpath->Append(/opt/samba/man);
for ($manpath->List) { print $_, "n" };
# similar to above using the "implicit object" shorthand
Env::Path->MANPATH;
MANPATH->Append(/opt/samba/man);
for (MANPATH->List) { print $_, "n" };
# one-shot use
Env::Path->PATH->Append(/usr/sbin);
# change instances of /usr/local/bin to an architecture-specific dir
Env::Path->PATH->Replace(/usr/local/bin, "/usr/local/$ENV{PLATFORM}/bin");
# more complex use (different names for same semantics)
my $libpath;
if ($^O =~ /aix/) {
$libpath = Env::Path->LIBPATH;
} else {
$libpath = Env::Path->LD_LIBRARY_PATH;
}
$libpath->Assign(qw(/usr/lib /usr/openwin/lib));
$libpath->Prepend(/usr/ucblib) unless $libpath->Contains(/usr/ucblib);
$libpath->InsertAfter(/usr/ucblib, /xx/yy/zz);
$libpath->Uniqify;
$libpath->DeleteNonexistent;
$libpath->Remove(/usr/local/lib);
print $libpath->Name, ":";
for ($libpath->List) { print " $_" };
print "n";
# simplest usage: bless all existing EVs as Env::Path objects
use Env::Path :all;
my @cats = PATH->Whence(cat*);
print "@catsn";
Download (0.010MB)
Added: 2007-04-14 License: Perl Artistic License Price:
924 downloads
Extended Path Index 2.4
Extended Path Index provides an extended index type based on the Zope index type that has additional query methods. more>>
Extended Path Index provides an extended index type based on the Zope index type that has additional query methods that are especially suited to generating navigation trees, site maps - and also supports querying a single folder, something the standard PathIndex cant do.
Note: You normally dont need to install this separately, as it ships as a standard part of Plone 2.1 and up. This download is for people wanting to use it outside of Plone or in earlier releases of Plone.
This index supports depth limiting, and the ability to build a structure usable for navtrees and sitemaps. The actual navtree implementations are not (and should not) be in this Product, this is the index implementation only.
Main features:
- Can construct a site map with a single catalog query
- Can construct a navigation tree with a single catalog query
- Doesnt wake up any objects
- Much lower RAM consumption
- Massively improved performance
- Catalog based instead of traversal based
Works with:
- Plone 2.5.1
- Plone 2.5
- Plone 2.1.4
- Plone 2.1.3
- Plone 2.1.2
- Plone 2.1.1
- Plone 2.1
Enhancements:
- A minor release for Plone 2.5.1
<<lessNote: You normally dont need to install this separately, as it ships as a standard part of Plone 2.1 and up. This download is for people wanting to use it outside of Plone or in earlier releases of Plone.
This index supports depth limiting, and the ability to build a structure usable for navtrees and sitemaps. The actual navtree implementations are not (and should not) be in this Product, this is the index implementation only.
Main features:
- Can construct a site map with a single catalog query
- Can construct a navigation tree with a single catalog query
- Doesnt wake up any objects
- Much lower RAM consumption
- Massively improved performance
- Catalog based instead of traversal based
Works with:
- Plone 2.5.1
- Plone 2.5
- Plone 2.1.4
- Plone 2.1.3
- Plone 2.1.2
- Plone 2.1.1
- Plone 2.1
Enhancements:
- A minor release for Plone 2.5.1
Download (0.014MB)
Added: 2007-03-28 License: GPL (GNU General Public License) Price:
940 downloads
XTM::Path 0.37
XTM::Path is a Perl module with topic map management, XPath like retrieval and construction facility. more>>
XTM::Path is a Perl module with topic map management, XPath like retrieval and construction facility.
SYNOPSIS
use XTM::XML;
$tm = new XTM (tie => new XTM::XML (file => mymap.tm)); # binds variable to channel
use XTM::Path;
my $xtmp = new XTM::Path (default => $tm);
# find particular topics and print topic id
foreach my $t ($xtmp->find (/topic[.//baseNameString/text() = "test"])) {
print $t->id;
}
# same using find twice
foreach my $t ($xtmp->find (/topic[.//baseNameString/text() = "test"])) {
print $xtmp->find (@id, $t);
}
# create a topic
$t = $xtmp->create (topic[@id = "id0815"]);
# same but with baseName
$t = $xtmp->create (topic[@id = "id0815"]/baseNameString[text() = "test"]);
# associations are always cumbersome
$a = $xtmp->create (association[member
[roleSpec/topicRef/@href = "#role1"]
[topicRef/@href = "#player1"]]
[member
[roleSpec/topicRef/@href = "#role2"]
[topicRef/@href = "#player2"]]);
This class provides a simple way to drill down the XTM data structures by following an XPath like approach.
The XTM standard (http://www.topicmaps.org/xtm/) is used as the basis to formulate XTM-Path queries. To find a particular topic, for instance, you might use
/topic[.//baseNameString = "some name"]
It is important to note that this package will NOT work on the original XTM document (this might even not exist if the map is created via other means), but is instead using the XTM::base data structure. This implies that all querying is done after merging and consolidation has been done.
Obviously, XTM::Path cannot be a complete query language, but it is useful in many development situations where drilling down the data structure is a cumbersome exercise. Together with intelligent add methods in XTM::Memory and XTM::generic this should simplify drastically the access, creation and manipulation of XTM data structures.
<<lessSYNOPSIS
use XTM::XML;
$tm = new XTM (tie => new XTM::XML (file => mymap.tm)); # binds variable to channel
use XTM::Path;
my $xtmp = new XTM::Path (default => $tm);
# find particular topics and print topic id
foreach my $t ($xtmp->find (/topic[.//baseNameString/text() = "test"])) {
print $t->id;
}
# same using find twice
foreach my $t ($xtmp->find (/topic[.//baseNameString/text() = "test"])) {
print $xtmp->find (@id, $t);
}
# create a topic
$t = $xtmp->create (topic[@id = "id0815"]);
# same but with baseName
$t = $xtmp->create (topic[@id = "id0815"]/baseNameString[text() = "test"]);
# associations are always cumbersome
$a = $xtmp->create (association[member
[roleSpec/topicRef/@href = "#role1"]
[topicRef/@href = "#player1"]]
[member
[roleSpec/topicRef/@href = "#role2"]
[topicRef/@href = "#player2"]]);
This class provides a simple way to drill down the XTM data structures by following an XPath like approach.
The XTM standard (http://www.topicmaps.org/xtm/) is used as the basis to formulate XTM-Path queries. To find a particular topic, for instance, you might use
/topic[.//baseNameString = "some name"]
It is important to note that this package will NOT work on the original XTM document (this might even not exist if the map is created via other means), but is instead using the XTM::base data structure. This implies that all querying is done after merging and consolidation has been done.
Obviously, XTM::Path cannot be a complete query language, but it is useful in many development situations where drilling down the data structure is a cumbersome exercise. Together with intelligent add methods in XTM::Memory and XTM::generic this should simplify drastically the access, creation and manipulation of XTM data structures.
Download (0.15MB)
Added: 2007-01-05 License: Perl Artistic License Price:
1023 downloads
Geo::Google::Path 0.02
Geo::Google::Path is a path, by automobile, between two loci. more>>
Geo::Google::Path is a path, by automobile, between two loci.
SYNOPSIS
use Geo::Google::Path;
# you shouldnt need to construct these yourself,
# have a Geo::Google object do it for you.
Google Maps is able to serve up directions between two points. Directions consist of two types of components:
1. a series of points along a "polyline".
2. a series of annotations, each of which applies to a contiguous
range of points.
In the Geo::Google object model, directions are available by calling path() on a Geo::Google instance. The return value is a Geo::Google::Path object, which is a composite of Geo::Google::Segment objects, which are in turn composites of Geo::Google::Location objects.
<<lessSYNOPSIS
use Geo::Google::Path;
# you shouldnt need to construct these yourself,
# have a Geo::Google object do it for you.
Google Maps is able to serve up directions between two points. Directions consist of two types of components:
1. a series of points along a "polyline".
2. a series of annotations, each of which applies to a contiguous
range of points.
In the Geo::Google object model, directions are available by calling path() on a Geo::Google instance. The return value is a Geo::Google::Path object, which is a composite of Geo::Google::Segment objects, which are in turn composites of Geo::Google::Location objects.
Download (0.010MB)
Added: 2006-11-24 License: Perl Artistic License Price:
1064 downloads
Path::Graph 0.02
Path::Graph is a Perl module created to generate paths from hash graph. more>>
Path::Graph is a Perl module created to generate paths from hash graph.
SYNOPSIS
Code 1
#!usr/bin/perl
my %graph = ( A => {B=>1,C=>4}, B => {A=>1,C=>2}, C => {A=>4,B=>2}
);
use Paths::Graph;
my $g = Paths::Graph->new(-origin=>"A",-destiny=>"C",-graph=>%graph);
my @paths = $g->shortest_path();
for my $path (@paths) {
print "Shortest Path:" . join ("->" , @$path) . " Cost:". $g->get_path_cost(@$path) ."n";
}
This package provides an object class which can be used to get diferents graph paths , with only pure perl code and I dont use other packet or module cpan.
This class calculates the shortest path between two nodes in a graph and return in other method , vals in the execution time (free_path_event).
Technically , the graph is composed of vertices (nodes) and edges (with optional weights) linked between them.
The shortest path is found using the Dijkstras algorithm. This algorithm is the fastest and requires all weights to be positive.
The object builds a help about this concept of the graphs , exist a method named debug().
<<lessSYNOPSIS
Code 1
#!usr/bin/perl
my %graph = ( A => {B=>1,C=>4}, B => {A=>1,C=>2}, C => {A=>4,B=>2}
);
use Paths::Graph;
my $g = Paths::Graph->new(-origin=>"A",-destiny=>"C",-graph=>%graph);
my @paths = $g->shortest_path();
for my $path (@paths) {
print "Shortest Path:" . join ("->" , @$path) . " Cost:". $g->get_path_cost(@$path) ."n";
}
This package provides an object class which can be used to get diferents graph paths , with only pure perl code and I dont use other packet or module cpan.
This class calculates the shortest path between two nodes in a graph and return in other method , vals in the execution time (free_path_event).
Technically , the graph is composed of vertices (nodes) and edges (with optional weights) linked between them.
The shortest path is found using the Dijkstras algorithm. This algorithm is the fastest and requires all weights to be positive.
The object builds a help about this concept of the graphs , exist a method named debug().
Download (0.006MB)
Added: 2007-06-28 License: Perl Artistic License Price:
857 downloads
File::Path 5.8.8
File::Path is a Perl module to create or remove directory trees. more>>
File::Path is a Perl module to create or remove directory trees.
SYNOPSIS
use File::Path;
mkpath([/foo/bar/baz, blurfl/quux], 1, 0711);
rmtree([foo/bar/baz, blurfl/quux], 1, 1);
The mkpath function provides a convenient way to create directories, even if your mkdir kernel call wont create more than one level of directory at a time. mkpath takes three arguments:
the name of the path to create, or a reference to a list of paths to create,
a boolean value, which if TRUE will cause mkpath to print the name of each directory as it is created (defaults to FALSE), and
the numeric mode to use when creating the directories (defaults to 0777), to be modified by the current umask.
It returns a list of all directories (including intermediates, determined using the Unix / separator) created.
If a system error prevents a directory from being created, then the mkpath function throws a fatal error with Carp::croak. This error can be trapped with an eval block:
eval { mkpath($dir) };
if ($@) {
print "Couldnt create $dir: $@";
}
Similarly, the rmtree function provides a convenient way to delete a subtree from the directory structure, much like the Unix command rm -r. rmtree takes three arguments:
the root of the subtree to delete, or a reference to a list of roots. All of the files and directories below each root, as well as the roots themselves, will be deleted.
a boolean value, which if TRUE will cause rmtree to print a message each time it examines a file, giving the name of the file, and indicating whether its using rmdir or unlink to remove it, or that its skipping it. (defaults to FALSE)
a boolean value, which if TRUE will cause rmtree to skip any files to which you do not have delete access (if running under VMS) or write access (if running under another OS). This will change in the future when a criterion for delete permission under OSs other than VMS is settled. (defaults to FALSE)
It returns the number of files successfully deleted. Symlinks are simply deleted and not followed.
NOTE: There are race conditions internal to the implementation of rmtree making it unsafe to use on directory trees which may be altered or moved while rmtree is running, and in particular on any directory trees with any path components or subdirectories potentially writable by untrusted users.
Additionally, if the third parameter is not TRUE and rmtree is interrupted, it may leave files and directories with permissions altered to allow deletion (and older versions of this module would even set files and directories to world-read/writable!)
Note also that the occurrence of errors in rmtree can be determined only by trapping diagnostic messages using $SIG{__WARN__}; it is not apparent from the return value.
<<lessSYNOPSIS
use File::Path;
mkpath([/foo/bar/baz, blurfl/quux], 1, 0711);
rmtree([foo/bar/baz, blurfl/quux], 1, 1);
The mkpath function provides a convenient way to create directories, even if your mkdir kernel call wont create more than one level of directory at a time. mkpath takes three arguments:
the name of the path to create, or a reference to a list of paths to create,
a boolean value, which if TRUE will cause mkpath to print the name of each directory as it is created (defaults to FALSE), and
the numeric mode to use when creating the directories (defaults to 0777), to be modified by the current umask.
It returns a list of all directories (including intermediates, determined using the Unix / separator) created.
If a system error prevents a directory from being created, then the mkpath function throws a fatal error with Carp::croak. This error can be trapped with an eval block:
eval { mkpath($dir) };
if ($@) {
print "Couldnt create $dir: $@";
}
Similarly, the rmtree function provides a convenient way to delete a subtree from the directory structure, much like the Unix command rm -r. rmtree takes three arguments:
the root of the subtree to delete, or a reference to a list of roots. All of the files and directories below each root, as well as the roots themselves, will be deleted.
a boolean value, which if TRUE will cause rmtree to print a message each time it examines a file, giving the name of the file, and indicating whether its using rmdir or unlink to remove it, or that its skipping it. (defaults to FALSE)
a boolean value, which if TRUE will cause rmtree to skip any files to which you do not have delete access (if running under VMS) or write access (if running under another OS). This will change in the future when a criterion for delete permission under OSs other than VMS is settled. (defaults to FALSE)
It returns the number of files successfully deleted. Symlinks are simply deleted and not followed.
NOTE: There are race conditions internal to the implementation of rmtree making it unsafe to use on directory trees which may be altered or moved while rmtree is running, and in particular on any directory trees with any path components or subdirectories potentially writable by untrusted users.
Additionally, if the third parameter is not TRUE and rmtree is interrupted, it may leave files and directories with permissions altered to allow deletion (and older versions of this module would even set files and directories to world-read/writable!)
Note also that the occurrence of errors in rmtree can be determined only by trapping diagnostic messages using $SIG{__WARN__}; it is not apparent from the return value.
Download (12.2MB)
Added: 2007-04-27 License: Perl Artistic License Price:
910 downloads
Radio Shortest Path First 1.1
Radio Shortest Path First (RSPF) is a routing protocol for wireless networks. more>>
Radio Shortest Path First (RSPF) is a routing protocol for wireless networks. This particular implementation is written for Linux and conforms to version 2.2 of the protocol specification. There are many reasons why our networks are complicated, but one significant thing is that you can no longer assume that just because you hear one station, then they can hear you. This means you can have a lot of unidirectional routes.
The current specification is RSPF version 2.2, written by Fred Goldstein K1IO. Until recently, if people were using RSPF at all, they would of been using RSPF version 2.1, which is available in the NOS program, written by Phil Karn and others. The RSPF code itself in NOS was written by Anders Klements.Thats why standard protocols dont work very well over amateur packet radio.
Now with the knowledge of how his protocol worked in real life, Fred then updated and improved RSPF to version 2.2. And, until late 1995, that was all that happened.
What did happen was that I was in my senior years in my undergraduate degree at University of Technology, Sydney and looking for an interesting Thesis. After seeing emails from Carl Makin VK1KCM asking if anyone was going to fix RSPF in NOS, this gave me my idea for my Thesis.
Enhancements:
- Control port speaks IPv6
- Made the ChangeLog prettier
- Fixed the checksum code so it works.
- Put everything through syslog()
- :s/t/ /
<<lessThe current specification is RSPF version 2.2, written by Fred Goldstein K1IO. Until recently, if people were using RSPF at all, they would of been using RSPF version 2.1, which is available in the NOS program, written by Phil Karn and others. The RSPF code itself in NOS was written by Anders Klements.Thats why standard protocols dont work very well over amateur packet radio.
Now with the knowledge of how his protocol worked in real life, Fred then updated and improved RSPF to version 2.2. And, until late 1995, that was all that happened.
What did happen was that I was in my senior years in my undergraduate degree at University of Technology, Sydney and looking for an interesting Thesis. After seeing emails from Carl Makin VK1KCM asking if anyone was going to fix RSPF in NOS, this gave me my idea for my Thesis.
Enhancements:
- Control port speaks IPv6
- Made the ChangeLog prettier
- Fixed the checksum code so it works.
- Put everything through syslog()
- :s/t/ /
Download (0.10MB)
Added: 2006-06-27 License: GPL (GNU General Public License) Price:
1217 downloads
arrows 0.6
Iamge in which you find a path through a maze of arrows more>>
Iamge iproject) in which you find a path through a maze of arrows
The goal is to guide the blue spinning thing through a maze of arrows, collecting the green things to score points.
Arrows can be created and destroyed along the way. The player is chased by an enemy sprite which slowly catches up.
<<lessThe goal is to guide the blue spinning thing through a maze of arrows, collecting the green things to score points.
Arrows can be created and destroyed along the way. The player is chased by an enemy sprite which slowly catches up.
Download (0.032MB)
Added: 2006-11-28 License: GPL (GNU General Public License) Price:
1077 downloads
Copy file or directory path 0.2
Copy file or directory path is a service menu that can copy the full path of file or directory to klipper. more>>
Copy file or directory path is a service menu that can copy the full path of file or directory to klipper.
<<less Download (MB)
Added: 2006-11-30 License: GPL (GNU General Public License) Price:
1059 downloads
Path::Abstract 0.06
Path::Abstract is a fast and featurefull class for UNIX-style path manipulation. more>>
Path::Abstract is a fast and featurefull class for UNIX-style path manipulation.
SYNOPSIS
use Path::Abstract;
my $path = Path::Abstract->new("/apple/banana");
# $parent is "/apple"
my $parent = $path->parent;
# $cherry is "/apple/banana/cherry.txt"
my $cherry = $path->child("cherry.txt");
Path::Abstract->new( < path> )
Path::Abstract->new( < part>, [ < part>, ..., < part> ] )
Create a new Path::Abstract object using < path> or by joining each < part> with "/"
Returns the new Path::Abstract object
Path::Abstract::path( < path> )
Path::Abstract::path( < part>, [ < part>, ..., < part> ] )
Create a new Path::Abstract object using < path> or by joining each < part> with "/"
Returns the new Path::Abstract object
$path->clone
Returns an exact copy of $path
$path->set( < path> )
$path->set( < part>, [ < part>, ..., < part> ] )
Set the path of $path to < path> or the concatenation of each < part> (separated by "/")
Returns $path
$path->is_nil
$path->is_empty
Returns true if $path is equal to ""
$path->is_root
Returns true if $path is equal to "/"
$path->is_tree
Returns true if $path begins with "/"
path("/a/b")->is_tree # Returns true
path("c/d")->is_tree # Returns false
$path->is_branch
Returns true if $path does NOT begin with a "/"
path("c/d")->is_branch # Returns true
path("/a/b")->is_branch # Returns false
$path->to_tree
Change $path by prefixing a "/" if it doesnt have one already
Returns $path
$path->to_branch
Change $path by removing a leading "/" if it has one
Returns $path
$path->list
$path->split
Returns the path in list form by splitting at each "/"
path("c/d")->list # Returns ("c", "d")
path("/a/b/")->last # Returns ("a", "b")
$path->first
Returns the first part of $path up to the first "/" (but not including the leading slash, if any)
path("c/d")->first # Returns "c"
path("/a/b")->first # Returns "a"
$path->last
Returns the last part of $path up to the last "/"
path("c/d")->last # Returns "d"
path("/a/b/")->last # Returns "b"
path
$path->get
$path->stringify
Returns the path in string or scalar form
path("c/d")->list # Returns "c/d"
path("/a/b/")->last # Returns "/a/b"
$path->push( < part>, [ < part>, ..., < part> ] )
$path->down( < part>, [ < part>, ..., < part> ] )
Modify $path by appending each < part> to the end of $path, separated by "/"
Returns $path
$path->child( < part>, [ < part>, ..., < part> ] )
Make a copy of $path and push each < part> to the end of the new path.
Returns the new child path
$path->pop( < count> )
Modify $path by removing < count> parts from the end of $path
Returns the removed path as a Path::Abstract object
$path->up( < count> )
Modify $path by removing < count> parts from the end of $path
Returns $path
$path->parent( < count> )
Make a copy of $path and pop < count> parts from the end of the new path
Returns the new parent path
$path->file
$path->file( < part>, [ < part>, ..., < part> ] )
Create a new Path::Class::File object using $path as a base, and optionally extending it by each < part>
Returns the new file object
$path->dir
$path->dir( < part>, [ < part>, ..., < part> ] )
Create a new Path::Class::Dir object using $path as a base, and optionally extending it by each < part>
Returns the new dir object
<<lessSYNOPSIS
use Path::Abstract;
my $path = Path::Abstract->new("/apple/banana");
# $parent is "/apple"
my $parent = $path->parent;
# $cherry is "/apple/banana/cherry.txt"
my $cherry = $path->child("cherry.txt");
Path::Abstract->new( < path> )
Path::Abstract->new( < part>, [ < part>, ..., < part> ] )
Create a new Path::Abstract object using < path> or by joining each < part> with "/"
Returns the new Path::Abstract object
Path::Abstract::path( < path> )
Path::Abstract::path( < part>, [ < part>, ..., < part> ] )
Create a new Path::Abstract object using < path> or by joining each < part> with "/"
Returns the new Path::Abstract object
$path->clone
Returns an exact copy of $path
$path->set( < path> )
$path->set( < part>, [ < part>, ..., < part> ] )
Set the path of $path to < path> or the concatenation of each < part> (separated by "/")
Returns $path
$path->is_nil
$path->is_empty
Returns true if $path is equal to ""
$path->is_root
Returns true if $path is equal to "/"
$path->is_tree
Returns true if $path begins with "/"
path("/a/b")->is_tree # Returns true
path("c/d")->is_tree # Returns false
$path->is_branch
Returns true if $path does NOT begin with a "/"
path("c/d")->is_branch # Returns true
path("/a/b")->is_branch # Returns false
$path->to_tree
Change $path by prefixing a "/" if it doesnt have one already
Returns $path
$path->to_branch
Change $path by removing a leading "/" if it has one
Returns $path
$path->list
$path->split
Returns the path in list form by splitting at each "/"
path("c/d")->list # Returns ("c", "d")
path("/a/b/")->last # Returns ("a", "b")
$path->first
Returns the first part of $path up to the first "/" (but not including the leading slash, if any)
path("c/d")->first # Returns "c"
path("/a/b")->first # Returns "a"
$path->last
Returns the last part of $path up to the last "/"
path("c/d")->last # Returns "d"
path("/a/b/")->last # Returns "b"
path
$path->get
$path->stringify
Returns the path in string or scalar form
path("c/d")->list # Returns "c/d"
path("/a/b/")->last # Returns "/a/b"
$path->push( < part>, [ < part>, ..., < part> ] )
$path->down( < part>, [ < part>, ..., < part> ] )
Modify $path by appending each < part> to the end of $path, separated by "/"
Returns $path
$path->child( < part>, [ < part>, ..., < part> ] )
Make a copy of $path and push each < part> to the end of the new path.
Returns the new child path
$path->pop( < count> )
Modify $path by removing < count> parts from the end of $path
Returns the removed path as a Path::Abstract object
$path->up( < count> )
Modify $path by removing < count> parts from the end of $path
Returns $path
$path->parent( < count> )
Make a copy of $path and pop < count> parts from the end of the new path
Returns the new parent path
$path->file
$path->file( < part>, [ < part>, ..., < part> ] )
Create a new Path::Class::File object using $path as a base, and optionally extending it by each < part>
Returns the new file object
$path->dir
$path->dir( < part>, [ < part>, ..., < part> ] )
Create a new Path::Class::Dir object using $path as a base, and optionally extending it by each < part>
Returns the new dir object
Download (0.005MB)
Added: 2007-07-11 License: Perl Artistic License Price:
835 downloads
File::PathList 0.02
File::PathList is a Perl module that can find a file within a set of paths (like @INC or Java classpaths). more>>
File::PathList is a Perl module that can find a file within a set of paths (like @INC or Java classpaths).
SYNOPSIS
# Create a basic pathset
my $inc = File::PathList->new( @INC );
# Again, but with more explicit params
my $inc2 = File::PathList->new(
paths => @INC,
cache => 1,
);
# Get the full (localised) path for a unix-style relative path
my $file = "foo/bar/baz.txt";
my $path = $inc->find_file( $file );
if ( $path ) {
print "Found $file at $pathn";
} else {
print "Failed to find $filen";
}
Many systems that map generic relative paths to absolute paths do so with a set of base paths.
For example, perl itself when loading classes first turn a Class::Name into a path like Class/Name.pm, and thens looks through each element of @INC to find the actual file.
To aid in portability, all relative paths are provided as unix-style relative paths, and converted to the localised version in the process of looking up the path.
<<lessSYNOPSIS
# Create a basic pathset
my $inc = File::PathList->new( @INC );
# Again, but with more explicit params
my $inc2 = File::PathList->new(
paths => @INC,
cache => 1,
);
# Get the full (localised) path for a unix-style relative path
my $file = "foo/bar/baz.txt";
my $path = $inc->find_file( $file );
if ( $path ) {
print "Found $file at $pathn";
} else {
print "Failed to find $filen";
}
Many systems that map generic relative paths to absolute paths do so with a set of base paths.
For example, perl itself when loading classes first turn a Class::Name into a path like Class/Name.pm, and thens looks through each element of @INC to find the actual file.
To aid in portability, all relative paths are provided as unix-style relative paths, and converted to the localised version in the process of looking up the path.
Download (0.026MB)
Added: 2007-06-06 License: Perl Artistic License Price:
870 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 snow path 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
