I want a soultion to compare two arrays in sh with an easy way.I want a solution to synchrose users between different AIX servers where no NIS is available. All users are meant to be same on all 10 servers. So the approach is to consider first server as master user repository and whatever the users... (0 Replies)
Hi all,
I have the following script where the contents of file1 and file2 would be something like this:
file1:
56790,0,0,100998765
89756,0,0,100567876
867645,1,3,678777654
file2:
56790,0,0,100998765
65776,0,0,4766457890
+5896,0,0,675489876
What I then want to do is check if... (4 Replies)
Hi there all,
I am having a question.
Is it posible to compare elements of 2 different arrays?
For example I got
Array 1 | Array 2
123_abc | 123_bcd
123_bcd | 234_bcd
234_abc | 567_abc
234_bcd | 123_abc
than the match is
123_abc & 234_bcd and non of the others.
So... (3 Replies)
Hello,
Let's say that we have the two following arrays
@array1=
@array2=
Is there any easy way to compare these two arrays and print the values that exist in array1 and not in array2 and the values that exist in array2 and not in array1?
Regards,
Chriss_58 (3 Replies)
Hi Im supposed to compare lines in a file :
KB0005 1019 T IFVATVPVI 0.691 PKC YES
KB0005 1036 T YFLQTSQQL 0.785 PKC YES
KB0005 1037 S FLQTSQQLK 0.585 DNAPK YES
KB0005 1045 S KQLESEGRS 0.669 PKC YES
KB0005 1045 S KQLESEGRS 0.880 unsp YES
KB204320 1019 T IFVATVPVI 0.699 PKC YES
... (7 Replies)
Hi,
my first post here!
Description of my problem:
I have one txt-file with six rows and each row contains seven numbers seperated with whitespaces.
I want to:
Compare one array with seven numbers with each row of numbers in the txt-file.
I have managed to compare one array with... (6 Replies)
Hi,
I am trying to compare two lists that are held in two variables so I believe I need to access the array elements to compare these. I am using ksh 88 and the code I have tried is below:
for file in ${origfilelist}
do
if ]]
then
print -- "File ${file}... (3 Replies)
I have two arrays and they look like this:
array=(`cat /local/mnt/*sys/*includes|grep -v NEW`)
array2=(`cat /tmp/*sys.z |grep -v NEW`)
I am trying to compare them but I need to use the diff -u command. I am not sure how to do this. I cannot just do diff -u ${array} ${array2}
I cannot... (4 Replies)
Hello everyone,
I need help comparing 2 arrays. the first array is static; the second array is not ..
array1=( "macOS Mojave" "iTunes" )
cd /Volumes
array2=( * )
# output of array2
macOS Mojave
iTunes
Mac me
The problem occurs when I compare the arrays with the following code -
... (6 Replies)
Discussion started by: trexthurman
6 Replies
LEARN ABOUT DEBIAN
tree::simple::visitor::fromnestedhash
Tree::Simple::Visitor::FromNestedHash(3pm) User Contributed Perl Documentation Tree::Simple::Visitor::FromNestedHash(3pm)NAME
Tree::Simple::Visitor::FromNestedHash - A Visitor for creating Tree::Simple objects from nested hash trees.
SYNOPSIS
use Tree::Simple::Visitor::FromNestedHash;
my $visitor = Tree::Simple::Visitor::FromNestedHash->new();
# given this nested hash tree
my $hash_tree = {
Root => {
Child1 => {
GrandChild1 => {},
GrandChild2 => {}
},
Child2 => {}
}
};
# set the array tree we
# are going to convert
$visitor->setHashTree($hash_tree);
$tree->accept($visitor);
# this then creates the equivalent Tree::Simple object:
# Tree::Simple->new("Root")
# ->addChildren(
# Tree::Simple->new("Child1")
# ->addChildren(
# Tree::Simple->new("GrandChild1"),
# Tree::Simple->new("GrandChild2")
# ),
# Tree::Simple->new("Child2"),
# );
DESCRIPTION
Given a tree constructed from nested hashs, this Visitor will create the equivalent Tree::Simple heirarchy.
METHODS
new There are no arguments to the constructor the object will be in its default state. You can use the "setNodeFilter" 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 $filter_function is passed the node value extracted from the hash
prior to it being inserted into the tree being built. The $filter_function is expected to return the value desired for inclusion into
the tree.
setHashTree ($hash_tree)
This method is used to set the $hash_tree that our Tree::Simple heirarchy will be constructed from. It must be in the following form:
{
Root => {
Child1 => {
GrandChild1 => {},
GrandChild2 => {}
},
Child2 => {}
}
}
Basically each key in the hash is considered a node, values are ignored unless it is a hash reference with at least one key in it, in
which case it is interpreted as containing the children of the node created from the key.
The tree is validated prior being accepted, if it fails validation an execption will be thrown. The rules are as follows;
The hash tree must not be empty.
It makes not sense to create a tree out of nothing, so it is assumed that this is a sign of something wrong.
The hash tree must be a single rooted tree.
The hash tree should have only one key in it's first level, if it has more than one, then it is not a single rooted tree.
NOTE: Hash keys are sorted ascii-betically before being added to the tree, this results in a somewhat more predictable hierarchy.
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.
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::FromNestedHash(3pm)