case structure in .sh file Post: 302457868

10 More Discussions You Might Find Interesting

1. UNIX for Dummies Questions & Answers

Problem w. case structure

Hello, I am having a problem setting a range of numbers for the "case" structure. I can use with no problems, but when I use it doesn't work??? Does the case struture allow numeric ranges? eg: echo -e "enter number between 0 and 60: \c" read $answer case $answer in ) echo...

2. UNIX for Dummies Questions & Answers

Copying a Directory Structure to a new structure

Hi all Is it possible to copy a structure of a directory only. e.g. I have a file with the following entries that is a result of a find :- /dir1/dir2/file.dbf /dir1/dir2/dir3/file1.dbf /dir1/file.dbf I want to copy these to a directory and keep the structure however starting at a new dir...

3. Shell Programming and Scripting

Case structure

Hi, Can anyone help me with the following case structure? echo "Please enter the date for which you want the Report:\c" read dat d1=`echo $dat|cut -c7-8` m1=`echo $dat|cut -c5-6` y1=`echo $dat|cut -c1-4` yr=`expr "$d1" - 1` case "$yr" in 0) MONTH=`expr "$m1" - 1`...

4. Shell Programming and Scripting

file structure

Hi, Is there a command that can help me to determain a unix file structure ? Thanks

5. Programming

Search attributes in one structure using the values from another structure

Hello Groups I am trying to find out ways of comparing a value from a 'c' structure to a value in another 'C' structure. the 'C' structure can be a List or liked list as it contains lot many records. if we loop it in both the structures it is going to consume time. I am looking for a simple...

6. Programming

compare XML/flat file with UNIX file system structure

Before i start doing something, I wanted to know whether the approach to compare XML file with UNIX file system structure. I have a pre-configured file(contains a list of paths to executables) and i need to check against the UNIX directory structure. what are the various approches should i use ? I...

7. UNIX for Dummies Questions & Answers

ksh case structure

Hello Experts, I ve been trying to build another shell where I am using the following code. transact="tv5cpc1" case "$transact" in "...cp..") xActType="" ;; "...de..") xActType="sp_dep" ;; "...ep..") xActType="sp_epa" ;; "....v.") ...

8. UNIX for Dummies Questions & Answers

Fall through case structure

Hello Experts, I was wondering how can we get a fall trough case structure. Eg: If we have two cases A and B and a default; if I do not break after A, it should execute all the statements of A as well as B if I break after B else fall through even lower. I tried this: #!/bin/sh v1=1...

9. Red Hat

Copy certain file types recursively while maintaining file structure on destination?

Hi guys, I have just been bothered by a fairly small issue for some time now. I am trying to search (using find -name) for some .jpg files recursively. This is a Redhat environment with bash. I get this job done though I need to copy ALL of them and put them in a separate folder BUT I also...

10. Shell Programming and Scripting

Case structure combined with standard input

Hi folks, I am new to bash scripting so please excuse my question. Is there any chance to combine a case structure with the read command? Like case (read -p "" variable) in x) Thx!

LEARN ABOUT BSD

boggle

BOGGLE(6)							   Games Manual 							 BOGGLE(6)

NAME

       boggle - play the game of boggle

SYNOPSIS

       /usr/games/boggle [ + ] [ ++ ]

DESCRIPTION

       This  program  is  intended for people wishing to sharpen their skills at Boggle (TM Parker Bros.).  If you invoke the program with 4 argu-
       ments of 4 letters each, (e.g.  "boggle appl epie moth erhd") the program forms the obvious Boggle  grid  and  lists  all  the  words  from
       /usr/dict/words	found  therein.  If  you invoke the program without arguments, it will generate a board for you, let you enter words for 3
       minutes, and then tell you how well you did relative to /usr/dict/words.

       The object of Boggle is to find, within 3 minutes, as many words as possible in a 4 by 4 grid of letters. Words	may  be  formed  from  any
       sequence  of 3 or more adjacent letters in the grid. The letters may join horizontally, vertically, or diagonally.  However, no position in
       the grid may be used more than once within any one word. In competitive play amongst humans, each player is given credit for those  of  his
       words which no other player has found.

       In  interactive play, enter your words separated by spaces, tabs, or newlines. A bell will ring when there is 2:00, 1:00, 0:10, 0:02, 0:01,
       and 0:00 time left. You may complete any word started before the expiration of time. You  can  surrender  before  time  is  up  by  hitting
       'break'. While entering words, your erase character is only effective within the current word and your line kill character is ignored.

       Advanced  players  may wish to invoke the program with 1 or 2 +'s as the first argument. The first + removes the restriction that positions
       can only be used once in each word. The second + causes a position to be considered adjacent to itself as well as its (up to) 8 neighbors.

4th Berkeley Distribution					   May 20, 1985 							 BOGGLE(6)