Hi All,
I am trying to run a do while for an array. And in the do while, I'm trying to get a user response. Depending on the the answer, I go ahead and do something or I move on to next element in the array.
So far I can read the array, but I can't get the if statement to work. Any suggestions will be greatly appreciated!
Code:
#!/bin/bash
set -x
linenum=1
array=
ps -ef | grep myAgent | grep -v grep | awk '{print $8}' | while read line ;
do
echo "$linenum : $line"
set -- $line
echo "$1"
array[$linenum]=$1
echo " Would you like to analyze this instance ${array[$linenum]} (y/n)? "
read response ### this does not work
if [ "$response" = Y ] || [ "$response" = y ] ; then
echo "Analysing"
sleep 10
# do some thing.. code snip ..
fi
linenum=$(( linenum + 1 ))
done
I am just stucked in syntax.This is more like a array and for loop problem.
I want to use ls -l command and get filezise and filename of all filenames in the directory in an array (say array#1).
After 2 minutes of sleep, i want to get the same information in another array (say array#2).
The... (4 Replies)
- I m retreving values from database and wish to use those values later in my shell script. I m placing these values in an array da_data but outside loop array is empty.Problem is its treating array as local inside loop hence array is empty outside loop.
Plz go through the script and suggest how... (1 Reply)
Hello!
I have a question about loops and arrays. I'm trying to go through this:
for aa in 01 02 03
OrigNum=$(grep ${Orig} Ba3In2F12.prepos | wc -l)
OrigNum=$((${OrigNum} - 1))
echo ${OrigNum}
etc
It gets stuck on the second line. The error reads:
./asdf: line 30:... (5 Replies)
Hi
I have something like
cat $HOME/all_dirs | while read ln_old_dirs
do
if
then
echo "$ln_all_old_dirs"
fi
done
As you know that the variable ln_all_old_dirs is not accessable from outside the... (2 Replies)
Hi everyone:)
I have 2 files - IN & OUT. Example:
IN
A:13:30
B:45:40
.
.
. UNLIMITED
OUT
Z:12:24
Y:20:15
.
.
. UNLIMITED
I want first row of numbers of IN - OUT. Example 13-12 45-20
My code is (2 Replies)
I've got this problem, if I modify an array in the loop and print it, everything is fine as long as I stay in the loop. But, when I print it outside the loop, nothing happens... How can I solve this problem?
Here I prepared a sample for you to see my problem;
zgrw@Rain:~$ cat test
asd
123... (4 Replies)
Hello All,
Maybe I'm Missing something here but I have NOOO idea what the heck is going on with this....?
I have a Variable that contains a PATTERN of what I'm considering "Illegal Characters". So what I'm doing is looping
through a string containing some of these "Illegal Characters". Now... (5 Replies)
Hi, I have the following problem that is beyond what I can currently do with bash scripting.
In file 1, I have ~ 2500000 values. Note this file is not sorted.
3 19 LABEL_A
3 37 LABEL_B
2 12 LABEL_C
1 15 LABEL_D
I have a list of values in "file 2" ~ 25000 unique lines:
Note -... (6 Replies)
Hi there,
A bit new to bash and am having an issue with a for loop. I look for filenames in a specified directory and pull the date string from each meeting a certain criteria, and then would like to make a directory for each date found, like this:
search 20180101.gz 20180102.gz 20180103.gz... (5 Replies)
Discussion started by: mwheeler12
5 Replies
LEARN ABOUT CENTOS
arraylabels
ArrayLabels(3) OCaml library ArrayLabels(3)NAME
ArrayLabels - Array operations.
Module
Module ArrayLabels
Documentation
Module ArrayLabels
: sig end
Array operations.
val length : 'a array -> int
Return the length (number of elements) of the given array.
val get : 'a array -> int -> 'a
Array.get a n returns the element number n of array a . The first element has number 0. The last element has number Array.length a - 1 .
You can also write a.(n) instead of Array.get a n .
Raise Invalid_argument index out of bounds if n is outside the range 0 to (Array.length a - 1) .
val set : 'a array -> int -> 'a -> unit
Array.set a n x modifies array a in place, replacing element number n with x . You can also write a.(n) <- x instead of Array.set a n x .
Raise Invalid_argument index out of bounds if n is outside the range 0 to Array.length a - 1 .
val make : int -> 'a -> 'a array
Array.make n x returns a fresh array of length n , initialized with x . All the elements of this new array are initially physically equal
to x (in the sense of the == predicate). Consequently, if x is mutable, it is shared among all elements of the array, and modifying x
through one of the array entries will modify all other entries at the same time.
Raise Invalid_argument if n < 0 or n > Sys.max_array_length . If the value of x is a floating-point number, then the maximum size is only
Sys.max_array_length / 2 .
val create : int -> 'a -> 'a array
Deprecated.
Array.create is an alias for ArrayLabels.make .
val init : int -> f:(int -> 'a) -> 'a array
Array.init n f returns a fresh array of length n , with element number i initialized to the result of f i . In other terms, Array.init n f
tabulates the results of f applied to the integers 0 to n-1 .
Raise Invalid_argument if n < 0 or n > Sys.max_array_length . If the return type of f is float , then the maximum size is only
Sys.max_array_length / 2 .
val make_matrix : dimx:int -> dimy:int -> 'a -> 'a array array
Array.make_matrix dimx dimy e returns a two-dimensional array (an array of arrays) with first dimension dimx and second dimension dimy .
All the elements of this new matrix are initially physically equal to e . The element ( x,y ) of a matrix m is accessed with the notation
m.(x).(y) .
Raise Invalid_argument if dimx or dimy is negative or greater than Sys.max_array_length . If the value of e is a floating-point number,
then the maximum size is only Sys.max_array_length / 2 .
val create_matrix : dimx:int -> dimy:int -> 'a -> 'a array array
Deprecated.
Array.create_matrix is an alias for ArrayLabels.make_matrix .
val append : 'a array -> 'a array -> 'a array
Array.append v1 v2 returns a fresh array containing the concatenation of the arrays v1 and v2 .
val concat : 'a array list -> 'a array
Same as Array.append , but concatenates a list of arrays.
val sub : 'a array -> pos:int -> len:int -> 'a array
Array.sub a start len returns a fresh array of length len , containing the elements number start to start + len - 1 of array a .
Raise Invalid_argument Array.sub if start and len do not designate a valid subarray of a ; that is, if start < 0 , or len < 0 , or start +
len > Array.length a .
val copy : 'a array -> 'a array
Array.copy a returns a copy of a , that is, a fresh array containing the same elements as a .
val fill : 'a array -> pos:int -> len:int -> 'a -> unit
Array.fill a ofs len x modifies the array a in place, storing x in elements number ofs to ofs + len - 1 .
Raise Invalid_argument Array.fill if ofs and len do not designate a valid subarray of a .
val blit : src:'a array -> src_pos:int -> dst:'a array -> dst_pos:int -> len:int -> unit
Array.blit v1 o1 v2 o2 len copies len elements from array v1 , starting at element number o1 , to array v2 , starting at element number o2
. It works correctly even if v1 and v2 are the same array, and the source and destination chunks overlap.
Raise Invalid_argument Array.blit if o1 and len do not designate a valid subarray of v1 , or if o2 and len do not designate a valid subar-
ray of v2 .
val to_list : 'a array -> 'a list
Array.to_list a returns the list of all the elements of a .
val of_list : 'a list -> 'a array
Array.of_list l returns a fresh array containing the elements of l .
val iter : f:('a -> unit) -> 'a array -> unit
Array.iter f a applies function f in turn to all the elements of a . It is equivalent to f a.(0); f a.(1); ...; f a.(Array.length a - 1);
() .
val map : f:('a -> 'b) -> 'a array -> 'b array
Array.map f a applies function f to all the elements of a , and builds an array with the results returned by f : [| f a.(0); f a.(1); ...;
f a.(Array.length a - 1) |] .
val iteri : f:(int -> 'a -> unit) -> 'a array -> unit
Same as ArrayLabels.iter , but the function is applied to the index of the element as first argument, and the element itself as second
argument.
val mapi : f:(int -> 'a -> 'b) -> 'a array -> 'b array
Same as ArrayLabels.map , but the function is applied to the index of the element as first argument, and the element itself as second argu-
ment.
val fold_left : f:('a -> 'b -> 'a) -> init:'a -> 'b array -> 'a
Array.fold_left f x a computes f (... (f (f x a.(0)) a.(1)) ...) a.(n-1) , where n is the length of the array a .
val fold_right : f:('b -> 'a -> 'a) -> 'b array -> init:'a -> 'a
Array.fold_right f a x computes f a.(0) (f a.(1) ( ... (f a.(n-1) x) ...)) , where n is the length of the array a .
=== Sorting ===
val sort : cmp:('a -> 'a -> int) -> 'a array -> unit
Sort an array in increasing order according to a comparison function. The comparison function must return 0 if its arguments compare as
equal, a positive integer if the first is greater, and a negative integer if the first is smaller (see below for a complete specification).
For example, Pervasives.compare is a suitable comparison function, provided there are no floating-point NaN values in the data. After
calling Array.sort , the array is sorted in place in increasing order. Array.sort is guaranteed to run in constant heap space and (at
most) logarithmic stack space.
The current implementation uses Heap Sort. It runs in constant stack space.
Specification of the comparison function: Let a be the array and cmp the comparison function. The following must be true for all x, y, z
in a :
- cmp x y > 0 if and only if cmp y x < 0
- if cmp x y >= 0 and cmp y z >= 0 then cmp x z >= 0
When Array.sort returns, a contains the same elements as before, reordered in such a way that for all i and j valid indices of a :
- cmp a.(i) a.(j) >= 0 if and only if i >= j
val stable_sort : cmp:('a -> 'a -> int) -> 'a array -> unit
Same as ArrayLabels.sort , but the sorting algorithm is stable (i.e. elements that compare equal are kept in their original order) and not
guaranteed to run in constant heap space.
The current implementation uses Merge Sort. It uses n/2 words of heap space, where n is the length of the array. It is usually faster than
the current implementation of ArrayLabels.sort .
val fast_sort : cmp:('a -> 'a -> int) -> 'a array -> unit
Same as Array.sort or Array.stable_sort , whichever is faster on typical input.
OCamldoc 2014-06-09 ArrayLabels(3)
11-14-2011
