:rolleyes: Hi,
How to take the time diffence between start and finish time from a log file?
It is like
..... started at Jun 20 23:20
.
.
..... finished at Jun 21 01:40
Tryed so many ways but failed to ger exact way. :confused:
Your help will be honoured.
Ta........Lokesha (1 Reply)
Im trying to replace every line
line1
line2
line3
with:
line1
extraline1
line2
extraline2
line3
extraline3
with about 10 extra lines
I am able to add axtra lines with: (17 Replies)
--------------------------------------------------------------------------------
Hi,
Plz help me out with this.
I have some requirement like this.....
I have a file like this...
* CS sent email (11.20)
CALYPSO 1031276 9076673 CDSHY FAILED Nov 19 2007 7:28AM OASYS: Unable to find CUSTOMER... (0 Replies)
Hi,
I'm a beginners, this is one of my first script, it's easy, but I don't know how to write this script:
The script receive in input 4 parameters:
1) user_name
2) r and/or w and/or x ( rwx, rw, x, ....)
3) u and/or g and/or o ( u, uo, ugo, ...)
4) the path name
The script print a... (2 Replies)
en...how to grep some words from some file,
the goal is that, we donot want the words are exactly 9 charactor,
and want to grep from some words that are longer than 9 and it contain a substring that with 9 different charactors (2 Replies)
I'm working on writing a shell script that logs out whenever I have a firefox process running during certain times of the day (1 am - 8 am). I'll put it in crontab when it runs properly unless someone knows of a different and better way to do this. Here it is so far.
if ps ax | grep... (4 Replies)
Hello,
I have a problem with the declaration of a function.
This is how I declare the function :
c:63: void foo(threadpool *tp,void (*func)(void*), (void*)arg);
Inside main, I call it like this:
main(){
..........
threadpool y;
c:104: ... (4 Replies)
I don't know if this is a big issue or not, but I'm having difficulties. I apoligize for the upcoming essay :o.
I'm writing a script, similar to a paint program that edits images, but in the form of ANSI block characters. The program so far is working. I managed to save the image into a file,... (14 Replies)
Hello,
I was reading Heuritics text and came across an algorithm below. Finding hard to analyze it can any one help me out below...
How to analyze if I take say no. of types are 5 and each type has say 20 coins.
thanks.
Let {c1, c2...cn=1} be a set of distinct coin types where ci is... (1 Reply)
I know Xenix is a little outdated, and is dangerous to use on network.
But this is a virtual machine, and I like to play retrocomputing sometime.
The question is..why ftp over slip doesn't work?
I've set this Xenix vm on libvirt
<domain type='kvm' id='5'... (2 Replies)
Discussion started by: Linusolaradm1
2 Replies
LEARN ABOUT SUSE
match
MATCH(1L) Schily's USER COMMANDS MATCH(1L)NAME
match - searches for patterns in files
SYNOPSIS
match [ -option ] pattern [ file ... ]
DESCRIPTION
Match searches the named files or standard input (if no filenames are given) for the occurrences of the given pattern on each line. The
program accepts literal characters or special pattern matching characters. All lines that match the pattern are output on standard output.
You can only specify one pattern string for each match, however, you can construct an arbitrarily complex string. When you do not specify
a file, match can be used as a filter to display desired lines. Standard in is used if no files are specified.
OPTIONS -not, -v
Prints all lines that do not match.
-i Ignore the case of letters
-m Force not to use the magic mode
-w Search for pattern as a word
-x Display only those lines which match exactly
-c Display matching count for each file
-l Display name of each file which matches
-s Be silent indicate match in exit code
-h Do not display filenames
-n Precede matching lines with line number (with respect to the input file)
-b Precede matching lines with block number
REGULAR EXPRESSIONS
The following is a table of all the pattern matching characters:
c An ordinary character (not one of the special characters discussed below) is a one character regular expression that matches that
character.
c A backslash () followed by any special character is a one character regular expression that matches the special character itself.
The special characters are:
! # % * { } [ ] ? ^ $
! Logical OR as in match this!that!the_other. You may have to use `{}' for precedence grouping.
# A hash mark followed by any regular expression matches any number (including zero) occurrences of the regular expression.
? Matches exactly any one character. W? matches Wa, Wb, Wc, W1, W2, W3 ...
* Matches any number of any character.
% Matches exactly nothing. It can be used in groups of ored patterns to specify that an empty alternative is possible.
{} Curly brackets may be used to enclose patterns to specify a precedence grouping, and may be nested. {%!{test}}version matches the
strings testversion and version.
[string]
A non empty string of characters enclosed in square brackets is a one character regular expression that matches any one character in
that string. If however the first character of the string is a circumflex (^), the one character expression matches any character
which is not in the string. The ^ has this special meaning only if it occurs first in the string. The minus (-) may be used to indi-
cate a range of consecutive ASCII characters; for example, [0-9] is equivalent to any one of the digits. The - loses it's special
meaning if it occurs first (after an initial ^, if any) or last in the string. The right square bracket (]) and the backslash ()
must be quoted with a backslash if you want to use it within the string.
^ Matches the beginning of a line.
$ Matches the end of a line. (^*$ matches any entire line)
EXAMPLES FILES
None.
SEE ALSO grep(1), fgrep(1), egrep(1)DIAGNOSTICS NOTES
Even if a match occurs more than once per line, the line is output only once.
Quote special pattern matching characters to prevent them from being expanded by the Command Interpreter.
BUGS
The length of the pattern is currently limited to 100 characters.
This limit is reduced by 38 if the -w option is used.
Joerg Schilling 15. Juli 1988 MATCH(1L)