01-10-2018
See revised. All positions are checked. If match by position then use previous.
Last edited by rdrtx1; 01-10-2018 at 08:48 PM..
This User Gave Thanks to rdrtx1 For This Post:
9 More Discussions You Might Find Interesting
1. Programming
Hello Everyone
Im planning to make a C program to check a proxy server if it is working or bot, test the proxy speed ,response time , as well as a proxy type.
i'm learning using libcurl right now to fetch http headers. do you guys have some links about how to check proxy headers?. Thank you.
... (0 Replies)
Discussion started by: magictalong
0 Replies
2. Shell Programming and Scripting
Well I have a 3000 lines result log file that contains all the machine data when it does the testing... It has 3 different section that i am intrsted in
1) starting with "20071126 11:11:11 Machine Header 1"
1000 lines...
"End machine header 1"
2) starting with "20071126 12:12:12 Machine... (5 Replies)
Discussion started by: vikas.iet
5 Replies
3. UNIX for Dummies Questions & Answers
hello
showrev -p | wc -l
returns:
381
What to do in case I want to have this output:
number of lines returned by showrev -p is: 381
thx (3 Replies)
Discussion started by: melanie_pfefer
3 Replies
4. Shell Programming and Scripting
Hi
I want the user to enter a date in the format 16-APR-2000 .
I need to put validations for that in my script ..
Please help
Thanks and Regards
Ultimatix (1 Reply)
Discussion started by: ultimatix
1 Replies
5. What is on Your Mind?
If you want to win some Bits, the jackpot for tomorrow's drawing is up to 219,500 Bits
Lottery tickets are only 100 Bits :D (0 Replies)
Discussion started by: Neo
0 Replies
6. Homework & Coursework Questions
Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted!
1. The problem statement, all variables and given/known data:
When "niuspell" is invoked from the command line it reads "file" and checks it for spelling of the words it... (1 Reply)
Discussion started by: Jeffthrow5
1 Replies
7. Debian
Guys I am new to Linux in general and want to know what is the use of the following files-:
/usr/share/dict/words
/usr/share/dict/words.pre-dictionaries-common
Are they used by the spell checker to find potential typos ?
If so are there any better larger word lists out there ? I am sure... (2 Replies)
Discussion started by: sreyan32
2 Replies
8. Shell Programming and Scripting
Hi Gurus,
I have requirement to compare current result with previous reuslt.
The sample case is below.
1 job1 1
1 job2 2
1 job3 3
2 job_a1 1
2 job_a2 2
2 job_a3 3
3 job_b1 1
3 job_b2 2
for above sample file, GID is group ID, for input line, the job run... (1 Reply)
Discussion started by: ken6503
1 Replies
9. Shell Programming and Scripting
hi ,
Let me put it in a different way with words.
Assume the lottery have numbers from 1-50.
Out of this 50 numbers, I am going to pick up only 35 numbers randomly.
so, my total numbers would be 35 numbers shuffled from nos.
I have list of winning numbers in file.
Now, the... (9 Replies)
Discussion started by: gsiva
9 Replies
LEARN ABOUT DEBIAN
regexp
Regexp(3I) InterViews Reference Manual Regexp(3I)
NAME
Regexp - regular expression searching
SYNOPSIS
#include <InterViews/regexp.h>
DESCRIPTION
A Regexp encapsulates a regular expression pattern and defines operations for searching and matching the pattern against a string. The
syntax of the regular expression pattern is the same as that for ed(1). Information can be obtained about the most recent match of the
regular expression (and its sub-expressions).
PUBLIC OPERATIONS
Regexp(const char* pattern)
Regexp(const char* pattern, int length)
Construct a new Regexp for pattern.
int Match(const char* text, int length, int index)
Attempt a match against text (of length length) at position index. The return value is the length of the matching string, or a neg-
ative number if the match failed.
int Search(const char* text, int length, int index, int range)
Search for a match in the string text (of length length). Matches are attempted starting at positions between index and index plus
range. If range is positive the first match after index is reported. If range is negative the first match before index is
reported. The return value is the index of the starting position of the match, or a negative number if there is no match in the
specified range.
int BeginningOfMatch(int subexp)
int EndOfMatch(int subexp)
Return information about the most recent match. If subexp is zero (the default), information is reported for the complete regular
expression. Other values of subexp refer to sub-expressions in the pattern. For example, if subexp is 2, information is returned
for the sub-expression specified by the second pair of ( and ) delimiters in the pattern.
SEE ALSO
ed(1)
InterViews 23 May 1989 Regexp(3I)