The find -depth primary produces a post-order walk of the file hierarchy instead of the default pre-order walk; it has no effect on how deep find goes as it walks the hierarchy. To get what TomG requested, just using standard find primaries, try:
or if the name of the directory being searched was specified by a variable:
This User Gave Thanks to Don Cragun For This Post:
How can I use the 'ps' command to view current sessions but only for a given process/user, with the -u parm?
In older versions of Unix, this used to work, but not in Sun Solaris.
Thanks (4 Replies)
There r 2 servers. Lets call them S1 and S2..
S1 is OSF1 and S2 is SunOS..
One directory of S2 is mounted on S1. say abc/xyz
There is one application which continuously put xml files in that directory (on S2).
If we give command “ls -lrt” on S2 it gives proper output.. (i.e. gives list... (1 Reply)
Hi, I am using Solaris 5.8
I searched online, the find command has an option called maxdepth which can be used to limit the number of directories find will look into.
find . -maxdepth 2 -type f
When I run the above command in solaris, I get an error
find: bad option -maxdepth
find:... (2 Replies)
Hi
I have a directory say mydir and inside it there are many files and subdirectories and also a directory called lost+found owned by root user
I want to print all files directories and subdirectorres from my directory using find command except lost+found
If i do
find . \( -name... (3 Replies)
Running HP 11.31 on a HP3600. But when I log in as a user the who command works but if I use an option like "who -m" I get nothing. Any thoughts on what is causing this problem. (11 Replies)
Hi,
I am trying to list all the files created / modified today in a directory.
With reference to this thread,
https://www.unix.com/shell-programming-scripting/20324-capture-all-today-files.html
I have used the below command to list all the files modified today.
find . -daystart -type f... (8 Replies)
Hi All,
Could you please help me in searching files in a better way satisfying the below conditions
I want to search files in a path whose access time is more than 5min and less than 60 min and whose Byte size is greater than zero
For this, i am using the below command, but it is... (2 Replies)
Hi All,
I am trying to select 30 days older files under current directory ,but not from subdirectory using below command.
find <Dir> -type f -mtime + 30
This command selecting all the files from current directory and also from sub directory .
I read some documention through internet ,... (1 Reply)
Have you tried running the command below? On the same RHEl 6.8 or 6.6. It will give you different output.
find . -maxdepth 1 -ctime -7 -type f
rpm -qa|grep find
findutils-4.4.2-9.el6.x86_64
# cat /etc/redhat-release
Red Hat Enterprise Linux Server release 6.8 (Santiago)
# (6 Replies)
Discussion started by: invinzin21
6 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)