Hi all,
Right now I'm using this but it seems to be a hack:
if (prefix(arg, "mark=")) {
for (markid = strtok(args,"="); markid; markid=strtok((char *)NULL, "=")) {
basically the user passes "mark=ny" to the command. I want to be able to extract "ny" from that... (7 Replies)
can any help me out y dis program is giving me a segmentation fault.....
#include<stdio.h>
#include<string.h>
int main()
{
char *str="Tanvir/home/root/hello";
const char *d ="/";
char *ret;
ret=strtok(str,d);
if(ret==NULL)
printf("NULL NULL");
else
... (3 Replies)
Hi,
I just wrote a program in C to split a comma seperated string in to group of strings using strtok() function. The code is:
int main()
{
char *temp;//not used here but basically we extract one string after another using strtok() and assign to a string pointer defined like this.
... (3 Replies)
Hi,
i want to write a script that executes a program (exec?) .
this program then requires a filename as input.
how do i give it this input in the script so the program will be complete run and close by the script.
e.g.
exec prog.exe
program then asks for filename
"enter filename:"... (1 Reply)
Why is line (null) after the first while loop run? (keyword does jump to the next word.)
#include <ftw.h>
#include <stdio.h>
#include <string.h>
char filenames = "";
int list(const char *name, const struct stat *status, int type)
{
if( (type == FTW_F) && strstr(name, ".txt") &&... (3 Replies)
I wrote a simple program that generates a random word 10,000,000 times.
I wrote it in python, then in C++ and compared the two completion times. The python script was faster! Is that normal? Why would the python script be faster? I was under the impression that C++ was faster. What are some of... (2 Replies)
Long story short: I'm working inside of a Unix SSH under a bash shell. I have to code a C program that generates a random number. Then I have to call the compiled C program with a Perl program to run the C program 20 times and put all the generated random #s into a text file, then print that text... (1 Reply)
I created a program, so a kid can practice there math on it. It dispenses varies math problems and the kid must input an answer. I also want it to grade the work they have done, but I can't find the best place for it to print out the grade.
I have:
if ( $response =~ m/^/ ) {
$user_wants_to_quit... (1 Reply)
Discussion started by: germany1517
1 Replies
LEARN ABOUT OPENDARWIN
strtok_r
STRTOK(3) Linux Programmer's Manual STRTOK(3)NAME
strtok, strtok_r - extract tokens from strings
SYNOPSIS
#include <string.h>
char *strtok(char *str, const char *delim);
char *strtok_r(char *str, const char *delim, char **saveptr);
Feature Test Macro Requirements for glibc (see feature_test_macros(7)):
strtok_r(): _POSIX_C_SOURCE
|| /* Glibc versions <= 2.19: */ _BSD_SOURCE || _SVID_SOURCE
DESCRIPTION
The strtok() function breaks a string into a sequence of zero or more nonempty tokens. On the first call to strtok(), the string to be
parsed should be specified in str. In each subsequent call that should parse the same string, str must be NULL.
The delim argument specifies a set of bytes that delimit the tokens in the parsed string. The caller may specify different strings in
delim in successive calls that parse the same string.
Each call to strtok() returns a pointer to a null-terminated string containing the next token. This string does not include the delimiting
byte. If no more tokens are found, strtok() returns NULL.
A sequence of calls to strtok() that operate on the same string maintains a pointer that determines the point from which to start searching
for the next token. The first call to strtok() sets this pointer to point to the first byte of the string. The start of the next token is
determined by scanning forward for the next nondelimiter byte in str. If such a byte is found, it is taken as the start of the next token.
If no such byte is found, then there are no more tokens, and strtok() returns NULL. (A string that is empty or that contains only delim-
iters will thus cause strtok() to return NULL on the first call.)
The end of each token is found by scanning forward until either the next delimiter byte is found or until the terminating null byte ('