But I am now stuck on an issue that is similar but not the same really. I want to join parts of one line with parts of another line that share the same ID. The ID can repeat many times. Below I show an example of 4 repeats of the same ID. The combinations I want to generate are the following:
The substrings that should be joined should be 9 characters in length. Here are the 4 repeated ID's as input:
Hi,
I trying to find the solution for writing the programming in unix by shell programming for sorting thr string in alphabetical order.
I getting diffculty in that ,, so i want to find out the solution for that
Please do needful
Thanks
Bhagyesh (1 Reply)
Hi,
Would anyone know how to compare two strings, and only throw an error if there were different words, not that the same words were in a different order?
e.g
"A B C" vs "B C A" ->OK
"A B C" vs "A D C" -> BAD
Thanks! (2 Replies)
Hi to all,
I have a file where the subject could contain "Summarized Availability Report" or only "Summarized Report"
If the subject is "Summarized Availability Report" I want to apply it Scrip1 and if the subject is "Summarized Report"
I want to apply it Scrip2.
1-) I would like you... (5 Replies)
Hello friends!
Each line of my input file has this format:
word<TAB>tag1<blankspace>lemma<TAB>tag2<blankspace>lemma ... <TAB>tag3<blankspace>lemma
Of this file I need to eliminate all the repeated tags (of the same word) in a line, as in the example here below, but conserving both (all) the... (2 Replies)
I have a vector of strings that contain a list of channels like this:
101,99,22HD,432,300HD
I have tried using the sort routine like this:
sort(mychans.begin(),mychans.end());
For some reason my channels are not being sorted at all. I was hoping someone might have some input that might... (2 Replies)
Hello,
I have a large database of words and would like them sorted in reverse order i.e. from the end up.
An example will make this clear:
I have tried to write a program in Perl which basically takes the string from the end and tries to sort from that end but it does not seem... (5 Replies)
Hi,
I have a sequence which has 30000 strings which looks like this
>string2991 234445
>string224 470561
>string121 675386
>string4098 177229
>string8049 255838
>string8 672382
>string1115 578415
I want it to be arranged in ascending order
>string8 672382
>string121... (5 Replies)
Hi below is the input file, i need to find repeated words and sum up the values of it which is second field from the repeated work.Im trying but getting no where close to it.Kindly give me a hint on how to go about it
Input
fruits,apple,20,fruits,mango,20,veg,carrot,12,veg,raddish,30... (11 Replies)
I am new to bash/shell scripting.
I want to find all the files in directory and subdirectories, which are not ends with “.zip” and which are contains in the file name “*.log*” or “*.out*”.
I know below command to get the files which ends with “.log”; but I need which are not ends with this... (4 Replies)
Hi. May somebody help me with this.
I´m trying to tabulate the following input file, but the desired output I´m getting is incorrect.
I have access to GNU/LINUX (Ubuntu) and Cygwin
Input file
STAGE = 1
ID = 0
NAME = JFMSC
TYPE = MLRR
DFRUL = PERMISSION
ADDR = 1001
RRUL =... (10 Replies)
Discussion started by: Ophiuchus
10 Replies
LEARN ABOUT DEBIAN
pcresample
PCRESAMPLE(3) Library Functions Manual PCRESAMPLE(3)NAME
PCRE - Perl-compatible regular expressions
PCRE SAMPLE PROGRAM
A simple, complete demonstration program, to get you started with using PCRE, is supplied in the file pcredemo.c in the PCRE distribution.
A listing of this program is given in the pcredemo documentation. If you do not have a copy of the PCRE distribution, you can save this
listing to re-create pcredemo.c.
The demonstration program, which uses the original PCRE 8-bit library, compiles the regular expression that is its first argument, and
matches it against the subject string in its second argument. No PCRE options are set, and default character tables are used. If matching
succeeds, the program outputs the portion of the subject that matched, together with the contents of any captured substrings.
If the -g option is given on the command line, the program then goes on to check for further matches of the same regular expression in the
same subject string. The logic is a little bit tricky because of the possibility of matching an empty string. Comments in the code explain
what is going on.
If PCRE is installed in the standard include and library directories for your operating system, you should be able to compile the demon-
stration program using this command:
gcc -o pcredemo pcredemo.c -lpcre
If PCRE is installed elsewhere, you may need to add additional options to the command line. For example, on a Unix-like system that has
PCRE installed in /usr/local, you can compile the demonstration program using a command like this:
gcc -o pcredemo -I/usr/local/include pcredemo.c
-L/usr/local/lib -lpcre
In a Windows environment, if you want to statically link the program against a non-dll pcre.a file, you must uncomment the line that
defines PCRE_STATIC before including pcre.h, because otherwise the pcre_malloc() and pcre_free() exported functions will be declared
__declspec(dllimport), with unwanted results.
Once you have compiled and linked the demonstration program, you can run simple tests like this:
./pcredemo 'cat|dog' 'the cat sat on the mat'
./pcredemo -g 'cat|dog' 'the dog sat on the cat'
Note that there is a much more comprehensive test program, called pcretest, which supports many more facilities for testing regular expres-
sions and both PCRE libraries. The pcredemo program is provided as a simple coding example.
If you try to run pcredemo when PCRE is not installed in the standard library directory, you may get an error like this on some operating
systems (e.g. Solaris):
ld.so.1: a.out: fatal: libpcre.so.0: open failed: No such file or directory
This is caused by the way shared library support works on those systems. You need to add
-R/usr/local/lib
(for example) to the compile command to get round this problem.
AUTHOR
Philip Hazel
University Computing Service
Cambridge CB2 3QH, England.
REVISION
Last updated: 10 January 2012
Copyright (c) 1997-2012 University of Cambridge.
PCRESAMPLE(3)