For clarity of others finding this thread, you need to prevent the shell expanding your command line before it executes.
Wrapping your search criteria in quotes will pass the value directly to the find command rather than match all files in the current directory and passing them into the find command.
If you have two files, /mydir/a.cbl and /mydir/source/b.cbl, the following will have the problem:-
This is because the shell expands the command to match the files in the current directory, so the actual find command executed will become:-
If you quote the search mask, you will get both files:-
You can get odd results if you also had a file a.cbl in a subdirectory as that would be matched with or without the quotes.
Can someone tell me the command to display the info about the CPU? I need the CPI id.. of my SUN box. Solaris 8.
It's some totally un-intuitive command, and i can't recall it.
tnx. (3 Replies)
Hi,
I have a challenging task,in which i have to find the duplicate files by its name and size,then i need to take anyone of the file.Then i need to open the file and find for more than one pattern and count of that pattern.
Note:These are the samples of two files,but i can have more... (2 Replies)
Hi,
There are multiple files like
file1_11
file2_11
file3_11.....and so on.
How to rename them such tht the suffix _11 is removed and they become file1, file2, file3.
Any help is appreciated.
Regards
er_ashu (1 Reply)
if I want to search those files which were suffix with .c,
I can use find ./ -name *.c
but how to find out those files which were not suffix with .c ??
Thanks a lot! (2 Replies)
Hi,
I am new in using unix systems and I need your help.
I would like to make a command that prints all files (not directories) from a file system. These files must be executable from all users (--x --x --x)
Thank you in advance (2 Replies)
Hello
I have a directory with a list of files which have a particular numerical suffix.
E.g
filename_0
filename_1
filename_18500
filename_10000
I want to delete all files from this directory which have a filename which have a numerical suffix greater than 10540.
So any files... (5 Replies)
Hi,
I have a lot of files similar to the below order. I want to rename all the files .discrading the time stamp/numbers after cnf.
Existing files
id_info_20130405.cnf_20130801
in_info_20130405.cnf_20130891
iz_info_20130405.cnf_20130821
in_info_20130405.cnf_20130818... (2 Replies)
Hello,
First time poster. I am looking for a way to script or program the process of moving files from one folder to another, automatically, based on the count of files in the destination folder.
I was thinking a shell script would work, but am open to the suggestions of the experts... (6 Replies)
Discussion started by: comtech
6 Replies
LEARN ABOUT DEBIAN
tree::simple::visitor::findbyuid
Tree::Simple::Visitor::FindByUID(3pm) User Contributed Perl Documentation Tree::Simple::Visitor::FindByUID(3pm)NAME
Tree::Simple::Visitor::FindByUID - A Visitor for finding an element in a Tree::Simple hierarchy by UID
SYNOPSIS
use Tree::Simple::Visitor::FindByUID;
# create a visitor object
my $visitor = Tree::Simple::Visitor::FindByUID->new();
# set the search path for our tree
$visitor->searchForUID("MyTreeUID");
# pass the visitor to a tree
$tree->accept($visitor);
# fetch the result, which will
# be the Tree::Simple object that
# we have found, or undefined
my $result = $visitor->getResult() || die "No Tree found";
DESCRIPTION
Given a UID and Tree::Simple hierarchy, this Visitor will attempt to find the node with the same UID.
METHODS
new There are no arguments to the constructor the object will be in its default state. You can use the "setNodeFilter",
"setTraversalMethod", "includeTrunk" and "searchForUID" methods to customize its behavior.
includeTrunk ($boolean)
Based upon the value of $boolean, this will tell the visitor to include the trunk of the tree in the search as well.
setTraversalMethod ($visitor)
By default we will use Tree::Simple's built in depth-first (pre-order) traverse method. If however, you desire the tree to be search in
a different ordering, this can be accomplished using a different traversal method, you can supply a $visitor object implementing that
traversal type to this method (See Tree::Simple::Visitor::BreadthFirstTraversal, Tree::Simple::Visitor::PreOrderTraversal and
Tree::Simple::Visitor::PostOrderTraversal).
searchForUID ($UID)
This is the UID we will attempt to find within the tree.
setNodeFilter ($filter_function)
This method accepts a CODE reference as its $filter_function argument and throws an exception if it is not a code reference. This code
reference is used to further check the tree nodes as they are searched and so can be used to customize search behavior. For instance,
you could to check against the UID as well as some other criteria. The filter function should accept a single argument, which is the
current Tree::Simple object and return either true(1) on success, or false(0) on failure.
visit ($tree)
This is the method that is used by Tree::Simple's "accept" method. It can also be used on its own, it requires the $tree argument to be
a Tree::Simple object (or derived from a Tree::Simple object), and will throw and exception otherwise.
getResult
This method will return the tree found with the specified UID (set by the "searchForUID" method) or "undef" if no tree is found.
BUGS
None that I am aware of. Of course, if you find a bug, let me know, and I will be sure to fix it.
CODE COVERAGE
See the CODE COVERAGE section in Tree::Simple::VisitorFactory for more inforamtion.
SEE ALSO
These Visitor classes are all subclasses of Tree::Simple::Visitor, which can be found in the Tree::Simple module, you should refer to that
module for more information.
ACKNOWLEDGEMENTS
Thanks to Vitor Mori for the idea for this Visitor.
AUTHOR
stevan little, <stevan@iinteractive.com>
COPYRIGHT AND LICENSE
Copyright 2004, 2005 by Infinity Interactive, Inc.
<http://www.iinteractive.com>
This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself.
perl v5.10.1 2005-07-14 Tree::Simple::Visitor::FindByUID(3pm)