Hello,
I have a directory that holds all of my matlab codes. I am trying to run a searh on all of the matlab files that have the word "while" written inside the sytax of the code.
Looking for all of the times that I did a while loop.
Can someone help me do this?
Thanks in advance.
... (1 Reply)
Hi
I am trying to search a firewall syslog space delimeted file for all of the different tcp and udp destination ports.
I know that grep will find lines that contain specific text. And I have tried using the the the cut command to cut out of the file certain colums. However the test I am... (6 Replies)
Hi all,
I need some help with using sed/awk/other linux tools to meet the following goal:
I'm trying to take the output of /proc/net/dev:
Inter-| Receive | Transmit
face |bytes packets errs drop fifo frame compressed multicast|bytes ... (0 Replies)
I need help extracting a column in a file separated by quotations. I would like to extract the first column of data and write it to a flat text file. EXAMPLE of data:
"c6e181396a1100ba19c53a6757a845c4","2012-05-18","email"
"70879000563753bb9051b4ab8df43ac4","2012-05-18","email"... (5 Replies)
Hi experts,
e.g.
i/p data looks like
0000xm7zcNDIkP888vRqGv93xA7:176n00qql||9700005405552747,9700005405717924,9700005405733788|unidentified,unidentified,unidentified||
o/p data should like -
row1: 0000xm7zcNDIkP888vRqGv93xA7:176n00qql||9700005405552747|unidentified
... (1 Reply)
HI ,
I have the following type of lines in a file and need to create a csv file that can be bcp'ed into a db
The problem that I have is the delimited of the <name :value> is a space but some of the values in the pairs have space . eg msg_src_time:03/05/13 10:40:17.919
Need sugesstions on... (9 Replies)
Hi All,
I have question , How to generate the SSH keys for the two servers in the pair.
So if the server will be replicated , same SSH key pairs will work on each server. No need to generate the SSH keys for the second server.
I have created the SSH keys for the single server. I was... (1 Reply)
I am extracting a number of key/value pairs in awk using following:
awk '
/xyz_session_id/ {
n=index($0,"xyz_session_id");
id=substr($0,n+15,25);
a=$4;
}
END{
for (ix in a) { print a }
}'
I don't like this Index + substr with manually calculated... (5 Replies)
Hi All,
I have a XML file which is looks like as below. <<please see the attachment >>
<?xml version="1.0" encoding="UTF-8"?>
<esites>
<esite>
<name>XXX.com</name>
<storeId>10001</storeId>
<module>
... (4 Replies)
I thought I had this figured out but was wrong so am humbly asking for help.
The task is to add an additional column to FILE 1 based on records in FILE 2.
The key is in COLUMN 1 for FILE 1 and in COLUMN 1 OR COLUMN 2 for FILE 2.
I want to add the third column from FILE 2 to the beginning of... (8 Replies)
Discussion started by: andmal
8 Replies
LEARN ABOUT DEBIAN
tst
tst(3) InterNetNews Documentation tst(3)NAME
tst - ternary search trie functions
SYNOPSIS
#include <inn/tst.h>
struct tst;
struct tst *tst_init(int node_line_width);
void tst_cleanup(struct tst *tst);
int tst_insert(struct tst *tst, const unsigned char *key, void *data, int option, void **exist_ptr);
void *tst_search(struct tst *tst, const unsigned char *key);
void *tst_delete(struct tst *tst, const unsigned char *key);
DESCRIPTION
tst_init allocates memory for members of struct tst, and allocates the first node_line_width nodes. A NULL pointer is returned by tst_init
if any part of the memory allocation fails. On success, a pointer to a struct tst is returned.
The value for node_line_width must be chosen very carefully. One node is required for every character in the tree. If you choose a value
that is too small, your application will spend too much time calling malloc(3) and your node space will be too spread out. Too large a
value is just a waste of space.
tst_cleanup frees all memory allocated to nodes, internal structures, as well as tst itself.
tst_insert inserts the string key into the tree. Behavior when a duplicate key is inserted is controlled by option. If key is already in
the tree then TST_DUPLICATE_KEY is returned, and the data pointer for the existing key is placed in exist_ptr. If option is set to
TST_REPLACE then the existing data pointer for the existing key is replaced by data. Note that the old data pointer will still be placed
in exist_ptr.
If a duplicate key is encountered and option is not set to TST_REPLACE then TST_DUPLICATE_KEY is returned. If key is zero length then
TST_NULL_KEY is returned. A successful insert or replace returns TST_OK. A return value of TST_ERROR indicates that a memory allocation
error occurred while trying to grow the node free.
Note that the data argument must never be NULL. If it is, then calls to tst_search will fail for a key that exists because the data value
was set to NULL, which is what tst_search returns. If you just want a simple existence tree, use the tst pointer as the data pointer.
tst_search finds the string key in the tree if it exists and returns the data pointer associated with that key.
If key is not found then NULL is returned, otherwise the data pointer associated with key is returned.
tst_delete deletes the string key from the tree if it exists and returns the data pointer assocaited with that key.
If key is not found then NULL is returned, otherwise the data pointer associated with key is returned.
HISTORY
Converted to POD from Peter A. Friend's ternary search trie documentation by Alex Kiernan <alex.kiernan@thus.net> for InterNetNews 2.4.0.
$Id: tst.pod 9074 2010-05-31 19:01:32Z iulius $
INN 2.5.3 2011-06-10 tst(3)