Sponsored Content
Full Discussion: [BASH] Gawk + MYSQL script
Top Forums Shell Programming and Scripting [BASH] Gawk + MYSQL script Post 302839787 by DGPickett on Friday 2nd of August 2013 05:30:26 PM
Old 08-02-2013
You could do much more is SQL, with case. Part of the task is to compare lists, which should say if either list is short, something comm is good at. You could sort and rely on order to merge the lists.

Last edited by DGPickett; 08-02-2013 at 07:34 PM..
 

10 More Discussions You Might Find Interesting

1. Shell Programming and Scripting

gawk and bash

Hi. I'm having trouble using gawk within a bash script and I can't figure out why. I have a command that takes in a data file with two columns, the first one numbers and the second words. My code takes each line, and prints the word its corresponding number of times. The code works from the... (2 Replies)
Discussion started by: cdislater
2 Replies

2. Shell Programming and Scripting

Passing a MySql password from bash script

Hi all, I am running this script on Mandrakelinux release 10.1, 2.6.8.1-12mdksmp #1 SMP I have also installed 'expect' separately. I have created an Rsync script, but before any Rsync command does run, a MySql dump must be done first, and I am battling a bit to pass the MySql password from... (2 Replies)
Discussion started by: codenjanod
2 Replies

3. Shell Programming and Scripting

Create mysql database with bash script - confused

Hi, i have the following: db="create database xxx;GRANT ALL PRIVILEGES ON xxx.* TO user@localhost IDENTIFIED BY 'password';FLUSH PRIVILEGES;quit;" mysql -u root -p$mysql_pass -e "$db" I don't understand why this is failing, it works fine when run from cmd but when is run in a bash script,... (1 Reply)
Discussion started by: ktm
1 Replies

4. Shell Programming and Scripting

mysql and bash...

Ok the issue I have is a bit complicated, for me, and my understanding of shell programming and bash is non-existent. Background: I do web development for a team of programmers that make custom kernels for the Android OS. The guys are using a bash script (through gerrit or github, like I said... (4 Replies)
Discussion started by: Nyght
4 Replies

5. Shell Programming and Scripting

How to run bash script from within MySQL

Can someone tell me the syntax to run a shell script from within MySQL? I know there is a way to do it, but I can't remember the syntax. I thought it was something like: mysql> \. /user/myscript; but I get this error: Failed to open file '/user/myscript;', error: 2 Please help!... (4 Replies)
Discussion started by: peterv6
4 Replies

6. Shell Programming and Scripting

syntax issue with quotes in mysql command for a bash script

i'm trying to write a bash script that executes a mysql statement mysql -sN -e INSERT INTO "$database"."$tableprefix"users (var1, var2,var3) VALUES (123, '1','') i don't know where to put the quotes it doesnt work with this one: ` it seems i can only put double quotes around the... (0 Replies)
Discussion started by: vanessafan99
0 Replies

7. Shell Programming and Scripting

syntax issue mysql in bash script

I'm running mysql in a bash script mysql <<EOF query EOF one query is like this: UPDATE $dbname.$prefix"config" SET value = $var WHERE "$prefix"config.name = 'table colname'; with variable but it's giving an error i'm not sure what to put for "$prefix"config.name the table... (3 Replies)
Discussion started by: vanessafan99
3 Replies

8. Shell Programming and Scripting

Update a mysql column via bash script

Hello, I want to check the value of all MySQL columns.(column name is "status") via bash script. If value is "0" at I want to make only single column value to "1" I have many "0" values on mysql database(on "status" column) "0" means it is a draft post. I want to publish a post. I... (2 Replies)
Discussion started by: tara123
2 Replies

9. Ubuntu

Bash script for FTP download -Mysql

Hi guys, I recently managed to write up my working script, but now I have a problem. If the file isn't there in the remote server, my actual script jumps it and all ok, but I need something like this: Search file -> if there, then download -> if not, download next file in the list. Any... (7 Replies)
Discussion started by: virtus96
7 Replies

10. UNIX for Beginners Questions & Answers

Using bash script : How to Import data from a dsv file into multiple tables in mysql

HI I have a dsv file that looks like: <<BOF>> record_number|id_number|first name|last name|msisdn|network|points|card number|gender 312|9101011234011|Test Junior|Smith|071 123 4321|MTN|73|1241551413214444|M 313|9012023213011|Bob|Smith|27743334321|Vodacom|3|1231233232323244|M... (4 Replies)
Discussion started by: tera
4 Replies
List(3o)							   OCaml library							  List(3o)

NAME
List - List operations. Module Module List Documentation Module List : sig end List operations. Some functions are flagged as not tail-recursive. A tail-recursive function uses constant stack space, while a non-tail-recursive function uses stack space proportional to the length of its list argument, which can be a problem with very long lists. When the function takes several list arguments, an approximate formula giving stack usage (in some unspecified constant unit) is shown in parentheses. The above considerations can usually be ignored if your lists are not longer than about 10000 elements. val length : 'a list -> int Return the length (number of elements) of the given list. val hd : 'a list -> 'a Return the first element of the given list. Raise Failure hd if the list is empty. val tl : 'a list -> 'a list Return the given list without its first element. Raise Failure tl if the list is empty. val nth : 'a list -> int -> 'a Return the n -th element of the given list. The first element (head of the list) is at position 0. Raise Failure nth if the list is too short. Raise Invalid_argument List.nth if n is negative. val rev : 'a list -> 'a list List reversal. val append : 'a list -> 'a list -> 'a list Catenate two lists. Same function as the infix operator @ . Not tail-recursive (length of the first argument). The @ operator is not tail-recursive either. val rev_append : 'a list -> 'a list -> 'a list List.rev_append l1 l2 reverses l1 and concatenates it to l2 . This is equivalent to List.rev l1 @ l2 , but rev_append is tail-recursive and more efficient. val concat : 'a list list -> 'a list Concatenate a list of lists. The elements of the argument are all concatenated together (in the same order) to give the result. Not tail-recursive (length of the argument + length of the longest sub-list). val flatten : 'a list list -> 'a list Same as concat . Not tail-recursive (length of the argument + length of the longest sub-list). === Iterators === val iter : ('a -> unit) -> 'a list -> unit List.iter f [a1; ...; an] applies function f in turn to a1; ...; an . It is equivalent to begin f a1; f a2; ...; f an; () end . val map : ('a -> 'b) -> 'a list -> 'b list List.map f [a1; ...; an] applies function f to a1, ..., an , and builds the list [f a1; ...; f an] with the results returned by f . Not tail-recursive. val rev_map : ('a -> 'b) -> 'a list -> 'b list List.rev_map f l gives the same result as List.rev ( List.map f l) , but is tail-recursive and more efficient. val fold_left : ('a -> 'b -> 'a) -> 'a -> 'b list -> 'a List.fold_left f a [b1; ...; bn] is f (... (f (f a b1) b2) ...) bn . val fold_right : ('a -> 'b -> 'b) -> 'a list -> 'b -> 'b List.fold_right f [a1; ...; an] b is f a1 (f a2 (... (f an b) ...)) . Not tail-recursive. === Iterators on two lists === val iter2 : ('a -> 'b -> unit) -> 'a list -> 'b list -> unit List.iter2 f [a1; ...; an] [b1; ...; bn] calls in turn f a1 b1; ...; f an bn . Raise Invalid_argument if the two lists have different lengths. val map2 : ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list List.map2 f [a1; ...; an] [b1; ...; bn] is [f a1 b1; ...; f an bn] . Raise Invalid_argument if the two lists have different lengths. Not tail-recursive. val rev_map2 : ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list List.rev_map2 f l1 l2 gives the same result as List.rev ( List.map2 f l1 l2) , but is tail-recursive and more efficient. val fold_left2 : ('a -> 'b -> 'c -> 'a) -> 'a -> 'b list -> 'c list -> 'a List.fold_left2 f a [b1; ...; bn] [c1; ...; cn] is f (... (f (f a b1 c1) b2 c2) ...) bn cn . Raise Invalid_argument if the two lists have different lengths. val fold_right2 : ('a -> 'b -> 'c -> 'c) -> 'a list -> 'b list -> 'c -> 'c List.fold_right2 f [a1; ...; an] [b1; ...; bn] c is f a1 b1 (f a2 b2 (... (f an bn c) ...)) . Raise Invalid_argument if the two lists have different lengths. Not tail-recursive. === List scanning === val for_all : ('a -> bool) -> 'a list -> bool for_all p [a1; ...; an] checks if all elements of the list satisfy the predicate p . That is, it returns (p a1) && (p a2) && ... && (p an) . val exists : ('a -> bool) -> 'a list -> bool exists p [a1; ...; an] checks if at least one element of the list satisfies the predicate p . That is, it returns (p a1) || (p a2) || ... || (p an) . val for_all2 : ('a -> 'b -> bool) -> 'a list -> 'b list -> bool Same as List.for_all , but for a two-argument predicate. Raise Invalid_argument if the two lists have different lengths. val exists2 : ('a -> 'b -> bool) -> 'a list -> 'b list -> bool Same as List.exists , but for a two-argument predicate. Raise Invalid_argument if the two lists have different lengths. val mem : 'a -> 'a list -> bool mem a l is true if and only if a is equal to an element of l . val memq : 'a -> 'a list -> bool Same as List.mem , but uses physical equality instead of structural equality to compare list elements. === List searching === val find : ('a -> bool) -> 'a list -> 'a find p l returns the first element of the list l that satisfies the predicate p . Raise Not_found if there is no value that satisfies p in the list l . val filter : ('a -> bool) -> 'a list -> 'a list filter p l returns all the elements of the list l that satisfy the predicate p . The order of the elements in the input list is preserved. val find_all : ('a -> bool) -> 'a list -> 'a list find_all is another name for List.filter . val partition : ('a -> bool) -> 'a list -> 'a list * 'a list partition p l returns a pair of lists (l1, l2) , where l1 is the list of all the elements of l that satisfy the predicate p , and l2 is the list of all the elements of l that do not satisfy p . The order of the elements in the input list is preserved. === Association lists === val assoc : 'a -> ('a * 'b) list -> 'b assoc a l returns the value associated with key a in the list of pairs l . That is, assoc a [ ...; (a,b); ...] = b if (a,b) is the leftmost binding of a in list l . Raise Not_found if there is no value associated with a in the list l . val assq : 'a -> ('a * 'b) list -> 'b Same as List.assoc , but uses physical equality instead of structural equality to compare keys. val mem_assoc : 'a -> ('a * 'b) list -> bool Same as List.assoc , but simply return true if a binding exists, and false if no bindings exist for the given key. val mem_assq : 'a -> ('a * 'b) list -> bool Same as List.mem_assoc , but uses physical equality instead of structural equality to compare keys. val remove_assoc : 'a -> ('a * 'b) list -> ('a * 'b) list remove_assoc a l returns the list of pairs l without the first pair with key a , if any. Not tail-recursive. val remove_assq : 'a -> ('a * 'b) list -> ('a * 'b) list Same as List.remove_assoc , but uses physical equality instead of structural equality to compare keys. Not tail-recursive. === Lists of pairs === val split : ('a * 'b) list -> 'a list * 'b list Transform a list of pairs into a pair of lists: split [(a1,b1); ...; (an,bn)] is ([a1; ...; an], [b1; ...; bn]) . Not tail-recursive. val combine : 'a list -> 'b list -> ('a * 'b) list Transform a pair of lists into a list of pairs: combine [a1; ...; an] [b1; ...; bn] is [(a1,b1); ...; (an,bn)] . Raise Invalid_argument if the two lists have different lengths. Not tail-recursive. === Sorting === val sort : ('a -> 'a -> int) -> 'a list -> 'a list Sort a list 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 Array.sort for a complete specifica- tion). For example, Pervasives.compare is a suitable comparison function. The resulting list is sorted in increasing order. List.sort is guaranteed to run in constant heap space (in addition to the size of the result list) and logarithmic stack space. The current implementation uses Merge Sort. It runs in constant heap space and logarithmic stack space. val stable_sort : ('a -> 'a -> int) -> 'a list -> 'a list Same as List.sort , but the sorting algorithm is guaranteed to be stable (i.e. elements that compare equal are kept in their original order) . The current implementation uses Merge Sort. It runs in constant heap space and logarithmic stack space. val fast_sort : ('a -> 'a -> int) -> 'a list -> 'a list Same as List.sort or List.stable_sort , whichever is faster on typical input. val merge : ('a -> 'a -> int) -> 'a list -> 'a list -> 'a list Merge two lists: Assuming that l1 and l2 are sorted according to the comparison function cmp , merge cmp l1 l2 will return a sorted list containting all the elements of l1 and l2 . If several elements compare equal, the elements of l1 will be before the elements of l2 . Not tail-recursive (sum of the lengths of the arguments). OCamldoc 2012-06-26 List(3o)
All times are GMT -4. The time now is 09:01 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy