All,
For some reason I can't figure out why I can't wildcard my find statement to check for anything with a wildcard after. I can before the -name but not after.
ie.
but find . -name test* gives me the error: find: paths must precede expression
Usage: find [-H] [-L] [-P] [path...] [expression]
Any reason?
Last edited by Yogesh Sawant; 04-05-2010 at 09:15 AM..
Reason: added code tags
My problem is as follows:
I have to write a korn shell script which will run mutiple java applications one after one. For example,
I will execute the java application A first, after it is done I will run application B.
My question is how do I do this? How does my korn shell script know that... (1 Reply)
ok i decided to go with Mandrake so i went to the site to download it and that took me to a mirror site. ok. so once i get there were can i find the install file(s) that i need? i only see a series of folder and files. the ones that say intall are instructions but i don't see the files themselves.... (3 Replies)
Hi,
i'm dealing with a script and I have one question. If I have these:
#!/bin/bash
wget http://somesite/file.tar
tar xvf file.tar
exit
I need the line that contains the command tar to wait until file.tar is completly downloaded, but it doesn't and continues with the next line... (6 Replies)
Does anyone have detailed info on how to download the files. I go to www.freebsd.com and then i dont know what to do. I dont know why i dont know but im drawing a complete blank so is there anyone that can provide a step by step procedure for downloading/installing Linux? :confused: :confused: (3 Replies)
Guys, ive been looking about , but obviously not hard enough, Where do i get AIX 5.3 from ?
DO i need to purchase it or is it free to download on a single user license ?:confused:
Thanks (2 Replies)
Probably a really easy one for you guru's out there...:rolleyes:
I need to make sure the reverse address lookup daemon in rarpd, is running. How do I do so? :confused:
Did a grep for the process but couldnt find it, also looked in all the normal places, /bin etc...
Cheers (1 Reply)
When getting a listing of files using "ls -l", my output shows the permissions, #oflinks???, owner, group, size, month-day-time, and file.
In the example below, how would I know what year the file was last modified?
-rw-rw-r--, 28, root, root, 2048, Oct 28 15:10, somefile.txt (2 Replies)
hi,
when we do an "ls -l" on a directory, we get the listing of the contents of that dir...
what is the meaning of some numbers...example in ;
-rw-r--r-- 1 idr supp 0 Feb 18 19:41 dmesg
drwxrwsrwx 2 root sys 96 Dec 27 15:31 test09
drwxr-xr-x 3 bin ... (1 Reply)
can anyone please suggest what is wrong with this command:
for i in ;
do
cat ~/Downloads/Project/p0s0n15.tcl>>~/Downloads/Project/p0s0n15_$i.tcl;
./setdest -n 15 -p 0 -M 5 -t 100 -x 500 -y 500 >>~/Downloads/Project/p0s0n15_$i.tcl;
cat... (3 Replies)
Hi,
Im trying to do move a file like this as mart of my script on Solaris
mv /path/to/file/file.txt ..
mv: cannot rename /path/to/file/file.txt to ../file.txt: Permission denied.
Im just trying to move it up one level using the following command on a bunch of directories:
find... (4 Replies)
Discussion started by: ideal2545
4 Replies
LEARN ABOUT DEBIAN
graph::unionfind
Graph::UnionFind(3pm) User Contributed Perl Documentation Graph::UnionFind(3pm)NAME
Graph::UnionFind - union-find data structures
SYNOPSIS
use Graph::UnionFind;
my $uf = Graph::UnionFind->new;
# Add the vertices to the data structure.
$uf->add($u);
$uf->add($v);
# Join the partitions of the vertices.
$uf->union( $u, $v );
# Find the partitions the vertices belong to
# in the union-find data structure. If they
# are equal, they are in the same partition.
# If the vertex has not been seen,
# undef is returned.
my $pu = $uf->find( $u );
my $pv = $uf->find( $v );
$uf->same($u, $v) # Equal to $pu eq $pv.
# Has the union-find seen this vertex?
$uf->has( $v )
DESCRIPTION
Union-find is a special data structure that can be used to track the partitioning of a set into subsets (a problem known also as disjoint
sets).
Graph::UnionFind() is used for Graph::connected_components(), Graph::connected_component(), and Graph::same_connected_components() if you
specify a true "union_find" parameter when you create an undirected graph.
Note that union-find is one way: you cannot (easily) 'ununion' vertices once you have 'unioned' them. This means that if you delete edges
from a "union_find" graph, you will get wrong results from the Graph::connected_components(), Graph::connected_component(), and
Graph::same_connected_components().
API
add
$uf->add($v)
Add the vertex v to the union-find.
union
$uf->union($u, $v)
Add the edge u-v to the union-find. Also implicitly adds the vertices.
has
$uf->has($v)
Return true if the vertex v has been added to the union-find, false otherwise.
find
$uf->find($v)
Return the union-find partition the vertex v belongs to, or "undef" if it has not been added.
new
$uf = Graph::UnionFind->new()
The constructor.
same
$uf->same($u, $v)
Return true of the vertices belong to the same union-find partition the vertex v belongs to, false otherwise.
AUTHOR AND COPYRIGHT
Jarkko Hietaniemi jhi@iki.fi
LICENSE
This module is licensed under the same terms as Perl itself.
perl v5.10.0 2008-11-27 Graph::UnionFind(3pm)