Some shiney props for anyone that can help me out.
I am sure someone will be able to do this simply.

I have a string that's 36 characters long and I need to return the nth character in a string. Have looked through all the functions starting with str* but none are helping me out.

I am assuming its a while loop, but the googles isn't helping me out either.

lookup substr() instead

Will do, cheers Teq.

stringname[n]

stringname[n-1]

Fixed.

Though given the simplicity, the question is probably not what it seems.

http://en.wikipedia.org/wiki/0th

As if you wouldn't be counting from zero.

stringname[nF]

?

As if you wouldn't be counting from zero.

Oooh, nice save! Difficult to argue with this one.

BASIC anyone? :-P

Am counting from zero, :P

Worked it out thanks guys.

Unless its apples you always count from 0

Say I have a few of these

stringname[3]
stringname[4]
stringname[5]

How do I get them back into a string by themselves? ie I want to be able to use %s in printf instead of using %c.

last edited by redhat at 16:33:56 29/Oct/09

this is the first google result for 'strings in C'

http://www.macdonald.egate.net/CompSci/hstrings.html

redhat is very bad at programming

u need ansi c by denis ritchie and some skillz

either concat or copy.

Hahah hi Perlboy

Thanks guys.

Stupid engine written in C, WTB perl.

Stupid engine written in C, WTB perl

Hahah what the fuck ... first time this phrase has ever been uttered?!

u know it hoggy!

lols, we got bought out by cpu a little while back, they love windows like no ones business and even they run all their jobs on perl

perl on windows, teehee

last edited by 3dee at 17:14:41 29/Oct/09

cpu?

perl is just easier because i've done it before :P

edit: ended up using sprintf!

use snprintf
pretend sprintf doesn't exist

you almost had us fooled thinking you were competent at your job ry.

cpu?

cpu = computershare
look us up on the asx

stringname[n-1]

Fixed.

Though given the simplicity, the question is probably not what it seems.

You assume, of course, that it's a null-terminated string and not a crazy length-specified variant.

You assume, of course, that it's a null-terminated string

Actually my assumption was that the characters of the string are in contiguous memory, zero-indexed. The termination token can be arbitrary or not present at all. pew pew.

Oh DIAF.
:)

ack! clazy C style null terminated string handling!

System.String.Substring() gets the thumbs up.

nah

LOLCODE > *

HAI

CAN HAS STDIO?

VISIBLE "HAI WORLD!"

KTHXBYE

http://lolcode.com/home

>> "whheee"[3..5]

=> "eee"

http://tryruby.sophrinix.com/

>>> "whheee"[3:6]

'eee'

http://www.python.org/

System.String.Substring()

Daz speaks the truth.

Fuck, I've just gone back ... 10 years!

ps - Trim

Actually for it to be correct for the QGL forums:
(assuming a string called: stringname and saving the nth character in c)

int minimum = 0;


c = stringname[minimum + n - 1];


(Because surely 0 is the minimum index right Obes and Jim?)

;P

last edited by Rukh at 01:12:40 30/Oct/09

oh ffs...

*checks his calendar again*

I have no issue with a 0 indexed array... however you can't have 0 apples.

you can have a zeroth apple though

nah ya can't

hold on, I thought zero was the minimum number of apples you could have?

that's because you're confused

So I need to 1-index Apple arrays?

not if you have a healthy human brain

I'm not your friend anymore Jim.

hey you're learning
that's heaps better than trying to count the absence of a friendship

If you don't have any apples how can you have 0 of them ? It's illogical!!!