One thing should be mentioned. IFS typically contains a space, a tab, and a newline character. You may want to save IFS's original value or typeset it in a function when changing it as it may change how your other scripting constructs tokenize lists. This way, IFS can be restored back to its original field separators.
We have a situation in a large dept of programmers where critical accounting data files were deleted. Is there any way in UNIX to trace deletions and or possibly retrieve the deleted file? (14 Replies)
I have an ultra 10 - running solaris 9 that I installed a few weeks ago...
I am not sure how to phrase this but basically I have some html doc's that I store on the ultra but I want people to be able to access from their windows workstation on our lan...
How can I do this?
If you could help... (4 Replies)
Hello All,
Q1) I have the below code but when the email was sent out all lines are merged and coming out as a single line though my printf statement has newline "\n", How do i avoid that?
Q2) In my second IF statement when i introduced the backslash "\" for continuation of a line or command, i... (10 Replies)
Experts,
I'm having problems with a portion of my perl script.
I have a perl array that contains the following:
Port1,circuit3,2;4
Port2,circuit1,9;6
Port3,circuit2,12;5
Port4,circuit4,11;10;3
Port5,circuit7,8;7;1
I'm trying to produce the following output: (3 Replies)
Discussion started by: timj123
3 Replies
LEARN ABOUT DEBIAN
tie::array::sorted
Tie::Array::Sorted(3pm) User Contributed Perl Documentation Tie::Array::Sorted(3pm)NAME
Tie::Array::Sorted - An array which is kept sorted
SYNOPSIS
use Tie::Array::Sorted;
tie @a, "Tie::Array::Sorted", sub { $_[0] <=> $_[1] };
push @a, 10, 4, 7, 3, 4;
print "@a"; # "3 4 4 7 10"
DESCRIPTION
This presents an ordinary array, but is kept sorted. All pushes and unshifts cause the elements in question to be inserted in the appropri-
ate location to maintain order.
Direct stores ("$a[10] = "wibble"") effectively splice out the original value and insert the new element. It's not clear why you'd want to
use direct stores like that, but this module does the right thing if you do.
If you don't like the ordinary lexical comparator, you can provide your own; it should compare the two elements it is given. For instance,
a numeric comparator would look like this:
tie @a, "Tie::Array::Sorted", sub { $_[0] <=> $_[1] }
Whereas to compare a list of files by their sizes, you'd so something like:
tie @a, "Tie::Array::Sorted", sub { -s $_[0] <=> -s $_[1] }
LAZY SORTING
If you do more stores than fetches, you may find Tie::Array::Sorted::Lazy more efficient.
AUTHOR
Original author: Simon Cozens
Current maintainer: Tony Bowden
BUGS and QUERIES
Please direct all correspondence regarding this module to: bug-Tie-Array-Sorted@rt.cpan.org
This module was originall written as part of the Plucene project. However, as Plucene no longer uses this, it is effectively unmaintained.
COPYRIGHT AND LICENSE
Copyright (C) 2003-2006 Simon Cozens and Tony Bowden.
This program is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License; either version 2 of the License,
or (at your option) any later version.
This program is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
FOR A PARTICULAR PURPOSE.
perl v5.8.8 2004-10-10 Tie::Array::Sorted(3pm)