12-06-2013
10 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
Please explain this command line ?
wc<infile<newfile
Thanx,
Saneesh Joseph. (2 Replies)
Discussion started by: saneeshjose
2 Replies
2. Shell Programming and Scripting
:start
/@~/{
h
s/\(.*\)@~.*$/\1/
s/@~$//
s/@~/\
/g
p
g
s/.*@~\(.*\)/\1/
}
//{
N
s/\n/ /
b start
} (2 Replies)
Discussion started by: djkane
2 Replies
3. UNIX for Dummies Questions & Answers
Hi Friends,
Can any of you explain me about the below line of code?
mn_code=`env|grep "..mn"|awk -F"=" '{print $2}'`
Im not able to understand, what exactly it is doing :confused:
Any help would be useful for me.
Lokesha (4 Replies)
Discussion started by: Lokesha
4 Replies
4. Shell Programming and Scripting
I did not understand what is ${0##/}
PGM=${0##/}
TMP=/tmp/${PGM}.$$
Please explain me. (2 Replies)
Discussion started by: gadege
2 Replies
5. Shell Programming and Scripting
could u please convert the below statement to shell script
----------
logdir=/smp/dyn/logfiles/cpm/pgm/pgIm
$logdir = $logdir ."/pgIm${toDate}*";
----
could u please explain the below clearly
grep -i adding $logdir | grep -iv equation | awk '{print \$NF}' | sort -u | sed -e... (1 Reply)
Discussion started by: mail2sant
1 Replies
6. AIX
this is the mksys b script....
can anyone explain .. what # and 1 in if condition
this is the first line of the script... it is not from middle of the script....
if
then
echo "Not enough parameters, need a client name for mksysb"
Usage="Usage: $0 <client name>"
... (2 Replies)
Discussion started by: honeym210
2 Replies
7. Homework & Coursework Questions
1. The problem statement, all variables and given/known data:
I have a retake assignment to complete for my computer networks and OS class. This isn't really my area, had I known last year I could have swapped it for a different module I would have done so. I'm determined to get through it... (6 Replies)
Discussion started by: Squall Moogle
6 Replies
8. Shell Programming and Scripting
I'm trying to follow a script and I see it begins with this:
if ; then
if ; then
print "blah $0 blah blah "
exit
fi
fi
What does $# mean? I found out that $1 refers to the shell environment and the last argument that was entered or passed in the previous command. I couldn't find $#... (2 Replies)
Discussion started by: MaindotC
2 Replies
9. Shell Programming and Scripting
why the case 2 will happen ? , ' should stop the history substitution ,shouldn't it?
case 1
# echo "123"|sed '/123/!d'
123
case 2
# echo "123
> 456
> 1
> "|sed '/123/!d'
-bash: !d': event not found
case 3
# echo "123
> 456
> 12
> "|sed '/123/'\!d
123
# bash --version (1 Reply)
Discussion started by: justlooks
1 Replies
10. UNIX for Dummies Questions & Answers
Hi friends! I'm learning UNIX and I have a small question. Working with Shell, i put the name of one executable (in c language) + one number and it says this:
$ gcc misterioso_4.c
$ ./misterioso_4 6
got: ,
I can not find an answer in the manual because I havent applied any variable.... (5 Replies)
Discussion started by: dakota
5 Replies
LEARN ABOUT DEBIAN
math::vector::real::kdtree
Math::Vector::Real::kdTree(3pm) User Contributed Perl Documentation Math::Vector::Real::kdTree(3pm)
NAME
Math::Vector::Real::kdTree - kd-Tree implementation on top of Math::Vector::Real
SYNOPSIS
use Math::Vector::Real::kdTree;
use Math::Vector::Real;
use Math::Vector::Real::Random;
my @v = map Math::Vector::Real->random_normal(4), 1..1000;
my $tree = Math::Vector::Real::kdTree->new(@v);
my $ix = $tree->find_nearest_neighbor(V(0, 0, 0, 0));
say "nearest neighbor is $ix, $v[$ix]";
DESCRIPTION
This module implements a kd-Tree data structure in Perl and some related algorithms.
The following methods are provided:
$t = Math::Vector::Real::kdTree->new(@points)
Creates a new kdTree containing the gived points.
$t->insert($p)
Inserts the given point into the kdTree.
$s = $t->size
Returns the number of points inside the tree.
$p = $t->at($ix)
Returns the point at the given index inside the tree.
$t->move($ix, $p)
Moves the point at index $ix to the new given position readjusting the tree structure accordingly.
($ix, $d) = $t->find_nearest_neighbor($p, $max_d, $but_ix)
Find the nearest neighbor for the given point $p and returns its index and the distance between the two points (in scalar context the
index is returned).
If $max_d is defined, the search is limited to the points within that distance
If $but_ix is defined, the point with the given index is not considered.
@ix = $t->find_nearest_neighbor_all_internal
Returns the index of the nearest neighbor for every point inside the tree.
It is equivalent to (though, internally, it uses a better algorithm):
@ix = map {
scalar $t->nearest_neighbor($t->at($_), undef, $_)
} 0..($t->size - 1);
@ix = $t->find_in_ball($z, $d, $but)
$n = $t->find_in_ball($z, $d, $but)
Finds the points inside the tree contained in the hypersphere with center $z and radius $d.
In scalar context returns the number of points found. In list context returns the indexes of the points.
If the extra argument $but is provided. The point with that index is ignored.
@ix = $t->ordered_by_proximity
Returns the indexes of the points in an ordered where is likely that the indexes of near vectors are also in near positions in the
list.
SEE ALSO
http://en.wikipedia.org/wiki/K-d_tree <http://en.wikipedia.org/wiki/K-d_tree>
Math::Vector::Real
COPYRIGHT AND LICENSE
Copyright (C) 2011, 2012 by Salvador FandiA~Xo <sfandino@yahoo.com>
This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself, either Perl version 5.12.3 or,
at your option, any later version of Perl 5 you may have available.
perl v5.14.2 2012-06-18 Math::Vector::Real::kdTree(3pm)