This is actually a more complex Pascal program I
am converting to Perl. The code given is a smaller
example of a larger program.
In pascal the program code looks like this:
It is supposed to create a 4 x 4 dimensional array with only
the first row of vector being initialized.
My question is to reproduce this in Perl. I would like to
pass the array as a reference and put values in the 4 x 4
dimentional array through a subroutine.
Odviously I can do this without a subroutine but with a
larger program this is not practicle.
I am going to develop a address book using the shell scripting commands without sed, awk, .... I am thinking to apply the concept of 2 dimenstional array. Can I create a two dimensional array for the insertion/updation/deletion of record in unix. If yes then tell me plz or recommend me some... (1 Reply)
I am trying to implementing two dimensinal array in ksh script.Would you pls help me out.
I have a large size of file, File contains looks like
ID SID VLAUE1 VALUE2 TOTALVALUE
1 a1 01 02 03
1 b1 02 05 07 ... (2 Replies)
Hi All,
I'm writing a nagios check that will see if our ldap servers are in sync...
I got the status data into a nested array, I would like to search key of each array and if "OK" is NOT present, echo other key=>values in the current array to a variable
so...eg...let take the single array... (1 Reply)
I am writing matrix multiplication and trying to return a two dimensional array from a function but I keep getting errors. Can someone please help me?
here is my code (it is just the skeleton of my program):
void main ()
{
...
int *matmultiply (int, int, int, int , int , int )
...
}
... (4 Replies)
hi,
total newbie to shell scripting and wondering if some of you guru's can give me a hand on a problem I'm trying to solve.
The tmplsnr.a file contains
LSNR_51526
db1
db2
LSNR_51527
db3
db4
db5
Summary - depending on which db is set, the script will start the relevant listener... (5 Replies)
Hey guyz.
Here is my sample input file following by first part of my code:
* A B C D E
reg1 1 0 1 1 0
reg2 0 1 0 0 1
reg3 1 0 0 1 0
reg4 0 0 1 0 1
reg5 1 1 0 0 1
use strict;
use warnings;
open (IN, "test_input.txt") or die ("Can't open file.txt: $!\n");
my $line = <IN>; ... (2 Replies)
Hello, all
For a 1-dimensional array, such as
myarr_1=1
myarr_1=2
myarr_1=3I know I can write a loop as below to show the array member one by one:
for (i in myarr_1){print i, myarr_1}Now, suppose I have a two dimensional array such as:
myarray_2=1 myarray_2=2
myarray_2=10 myarray_2=20My... (3 Replies)
I have an array of names. Each one of the name, has a number represented to it.
For example A has an ID 8, B has an ID 2.
What I am after is a for loop that when the array is in position 1, a particular variable is set to the value of position 1 in array 2
declare -a arr=("A" "B" "C"... (6 Replies)
Hi,
I have a 10*10 two dimensional array. How do I assign value to all it's 100 elements at once? I don't want to open two for loops and assign one by one.
Thanks,
Shuri (1 Reply)
Discussion started by: shurimano
1 Replies
LEARN ABOUT DEBIAN
vector
Vector(7rheolef) rheolef-6.1 Vector(7rheolef)NAME
Vector - STL vector<T> with reference counting
DESCRIPTION
The class implement a reference counting wrapper for
the STL vector<T> container class, with shallow copies.
See also:
@quotation The Standard Template Library, by Alexander Stephanov and Meng Lee.
@end quotation
This class provides the full vector<T>
interface specification
an could be used instead of vector<T>.
NOTE
The write accessors
T& operator[](size_type)
as in v[i]
may checks the reference count for each access.
For a loop, a better usage is:
Vector<T>::iterator i = v.begin();
Vector<T>::iterator last = v.end();
while (i != last) { ...}
and the reference count check step occurs only two time,
when accessing via begin() and end().
Thus, in order to encourage users to do it, we declare private
theses member functions. A synonym of operator[] is at.
IMPLEMENTATION
template<class T>
class Vector : private smart_pointer<vector_rep<T> > {
public:
// typedefs:
typedef iterator;
typedef const_iterator;
typedef pointer;
typedef reference;
typedef const_reference;
typedef size_type;
typedef difference_type;
typedef value_type;
typedef reverse_iterator;
typedef const_reverse_iterator;
// allocation/deallocation:
explicit Vector (size_type n = 0, const T& value = T ());
Vector (const_iterator first, const_iterator last);
void reserve (size_type n);
void swap (Vector<T>& x) ;
// accessors:
iterator begin ();
const_iterator begin () const;
iterator end ();
const_iterator end () const;
reverse_iterator rbegin();
const_reverse_iterator rbegin() const;
reverse_iterator rend();
const_reverse_iterator rend() const;
size_type size () const;
size_type max_size () const;
size_type capacity () const;
bool empty () const;
void resize (size_type sz, T v = T ()); // non-standard ?
private:
const_reference operator[] (size_type n) const;
reference operator[] (size_type n);
public:
const_reference at (size_type n) const; // non-standard ?
reference at (size_type n);
reference front ();
const_reference front () const;
reference back ();
const_reference back () const;
// insert/erase:
void push_back (const T& x);
iterator insert (iterator position, const T& x = T ());
void insert (iterator position, size_type n, const T& x);
void insert (iterator position, const_iterator first, const_iterator last);
void pop_back ();
void erase (iterator position);
void erase (iterator first, iterator last);
};
rheolef-6.1 rheolef-6.1 Vector(7rheolef)