Here's a sample input for an example of 3 occurrences. I want to generate specific combinations of a 9 character substring based on the last occurrence of the ID %dog (line 3) with the beginning substring of the second occurrence of the ID.
input:
output:
In this example, I show what the output looks like for 1 of the rules. Notice how the last 9 character substring from the third line is now in the beginning of column 2 and it is followed by the first 9 character substring from the second occurrence of the line with the ID %dog. Another possibility exists and that is to swap the beginning and end substrings of the last line (line 3) with itself. And also to swap the last substring with the beginning substring of the first line with itself.
output:
The final output for this example should have three lines, based on the following rules:
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 V7
memmem
MEMMEM(3) Linux Programmer's Manual MEMMEM(3)NAME
memmem - locate a substring
SYNOPSIS
#define _GNU_SOURCE /* See feature_test_macros(7) */
#include <string.h>
void *memmem(const void *haystack, size_t haystacklen,
const void *needle, size_t needlelen);
DESCRIPTION
The memmem() function finds the start of the first occurrence of the substring needle of length needlelen in the memory area haystack of
length haystacklen.
RETURN VALUE
The memmem() function returns a pointer to the beginning of the substring, or NULL if the substring is not found.
ATTRIBUTES
For an explanation of the terms used in this section, see attributes(7).
+----------+---------------+---------+
|Interface | Attribute | Value |
+----------+---------------+---------+
|memmem() | Thread safety | MT-Safe |
+----------+---------------+---------+
CONFORMING TO
This function is not specified in POSIX.1, but is present on a number of other systems.
BUGS
In glibc 2.0, if needle is empty, memmem() returns a pointer to the last byte of haystack. This is fixed in glibc 2.1.
SEE ALSO bstring(3), strstr(3)COLOPHON
This page is part of release 4.15 of the Linux man-pages project. A description of the project, information about reporting bugs, and the
latest version of this page, can be found at https://www.kernel.org/doc/man-pages/.
GNU 2017-03-13 MEMMEM(3)