Bubble sort an array inside the function, which calls an array by reference, so the arrays are sorted afterwards. Then compare arrays outside the function.
This is using a sorting method, but since the only goal is to find out if all values are present in both strings, it seems to me that this could also be done without sorting...
--
@shamrock: if (sortme(srt_pref, m) == sortme(srt_baseline, n)) is always true, no? Since the output of the sortme function is always an empty string..
Last edited by Scrutinizer; 03-12-2014 at 09:20 PM..
Hi,
I need help to sort a file contents.
I am using sort -r option to basically reverse the comparison in descending order. However, i found out that my file is not sorted according, can anyone please help.
My data is something like:-
Hello world
20.982342864 343
19.234355545 222... (5 Replies)
hey gurus,
my-build1-abc
my-build10-abc
my-build2-abc
my-build22-abc
my-build3-abc
basically i want to numerically sort the entire lines based on the build number. I dont zero pad the numbers because thats "how it is" ;-)
sort -n won't work because it starts from the beginning.
... (10 Replies)
I'm not familiar with find.
If i use find in a certain directory i want it to show based on hierarchy.
find . type d
fol1
fol1/subfol1
fol1/subfol1/subfol1
fol2
fol2/subfol2
i want it to show like this
fol1/subfol1/subfol1
fol1/subfol1
fol1
fol2/subfol2
fol2
do i need to use... (5 Replies)
Hi Folks,
Currently am working with 10g db. I want to sort the below o/p.
Current output:
============
SQL> select partition_name from user_tab_partitions where table_name='USER_AUDIT';
PARTITION_NAME
------------------------------
PARTMAX
PART_AUDIT_NOV02
PART_AUDIT_NOV08... (4 Replies)
I want to sort lines by how many times a string occurs in each line (the most times first).
I know how to do this in two passes (add a count field in the first pass then sort on it in the second pass).
However, can it be done more optimally with a single AWK command? My AWK has improved... (11 Replies)
It is for HP-Unix B.11.31.
Requirement:
1. List the directories, which directories name has given particular string.
Example: Directories with name "Build"
2. On the output of 1. list the directories by creation date as sort order.
I tried with; find . -type d -name "Build*"
... (3 Replies)
here is what i want to achieve... consider a file contains below contents. the file size is large about 60mb
cat dump.sql
INSERT INTO `table1` (`id`, `action`, `date`, `descrip`, `lastModified`) VALUES (1,'Change','2011-05-05 00:00:00','Account Updated','2012-02-10... (10 Replies)
Hi guys,
I am trying to sort numbers in the string in descending order but for some reason sort fails.
n129$ echo "81 240" | sort -r
81 240
n129$
I am not sure what am I doing wrong. Is there a 100% reliable way to make sure that sort will always work. I mean on SUNS and IBM machines. ... (4 Replies)
Hi,
I am having contents in a file like below,
cat testfile
rpool/swap
rpool/swap14
rpool/swap2
rpool/swap3
I want to sort the above contents like,
rpool/swap
rpool/swap2
rpool/swap3
rpool/swap14
I have tried in this way, (7 Replies)
Discussion started by: Sumanthsv
7 Replies
LEARN ABOUT DEBIAN
tree::simple::visitor::loaddirectorytree
Tree::Simple::Visitor::LoadDirectoryTree(3pm) User Contributed Perl Documentation Tree::Simple::Visitor::LoadDirectoryTree(3pm)NAME
Tree::Simple::Visitor::LoadDirectoryTree - A Visitor for loading the contents of a directory into a Tree::Simple object
SYNOPSIS
use Tree::Simple::Visitor::LoadDirectoryTree;
# create a Tree::Simple object whose
# node is path to a directory
my $tree = Tree::Simple->new("./");
# create an instance of our visitor
my $visitor = Tree::Simple::Visitor::LoadDirectoryTree->new();
# set the directory sorting style
$visitor->setSortStyle($visitor->SORT_FILES_FIRST);
# create node filter to filter
# out certain files and directories
$visitor->setNodeFilter(sub {
my ($item) = @_;
return 0 if $item =~ /CVS/;
return 1;
});
# pass the visitor to a Tree::Simple object
$tree->accept($visitor);
# the tree now mirrors the structure of the directory
DESCRIPTION
This visitor can be used to load a directory tree into a Tree::Simple hierarchy.
METHODS
new There are no arguments to the constructor the object will be in its default state. You can use the "setNodeFilter" and "setSortStyle"
methods to customize its behavior.
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 filter the tree nodes as they are created. The function is given the current directory or file being added to the
tree, and it is expected to return either true(1) of false(0) to determine if that directory should be traversed or file added to the
tree.
setSortStyle ($sort_function)
This method accepts a CODE reference as its $sort_function argument and throws an exception if it is not a code reference. This
function is used to sort the individual levels of the directory tree right before it is added to the tree being built. The function is
passed the the current path, followed by the two items being sorted. The reason for passing the path in is so that sorting operations
can be performed on the entire path if desired.
Two pre-built functions are supplied and described below.
SORT_FILES_FIRST
This sorting function will sort files before directories, so that files are sorted alphabetically first in the list followed by
directories sorted alphabetically. Here is example of how that would look:
Tree/
Simple.pm
Simple/
Visitor.pm
VisitorFactory.pm
Visitor/
PathToRoot.pm
SORT_DIRS_FIRST
This sorting function will sort directories before files, so that directories are sorted alphabetically first in the list followed
by files sorted alphabetically. Here is example of how that would look:
Tree/
Simple/
Visitor/
PathToRoot.pm
Visitor.pm
VisitorFactory.pm
Simple.pm
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.
The node value of the $tree argument (gotten by calling "getNodeValue") is considered the root directory from which we begin our
traversal. We use File::Spec to keep our paths cross-platform, but it is expected that you will feed in a valid path for your OS. If
the path either does not exist, or is not a directory, then an exception is thrown.
The $tree argument which is passed to "visit" must be a leaf node. This is because this Visitor will create all the sub-nodes for this
tree. If the tree is not a leaf, an exception is thrown. We do not require the tree to be a root though, and this Visitor will not
affect any nodes above the $tree argument.
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.
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::LoadDirectoryTree(3pm)