Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
saagarjha
on Oct 18, 2020
|
parent
|
context
|
favorite
| on:
C++ still isn't cutting it
Maybe 5x, with most of that increase being a handrolled associative array.
zabzonk
on Oct 18, 2020
[–]
You also need at least dynamic string of some sort. Actually, I would estimate 20x - I was being kind with 10x. But feel free to prove me wrong.
saagarjha
on Oct 18, 2020
|
parent
|
next
[–]
So it turns out that factor is just over 2.5x:
https://gist.github.com/saagarjha/00faa1963023206a8ccd987798...
. You can split hairs about it being POSIX and inefficient or not checking all the errors, but it works and isn't really all that massive.
tptacek
on Oct 18, 2020
|
parent
|
prev
[–]
Why do you need a dynamic string of any sort for this problem?
(I think you estimated badly, for what it's worth.)
saagarjha
on Oct 18, 2020
|
root
|
parent
[–]
You'd need it to read words, unless you're using a libc function that does the allocation for you. (Not that you actually need a full string, realloc works just fine for the code I'm writing.)
tptacek
on Oct 18, 2020
|
root
|
parent
[–]
Yeah, I just used strdup and strsep, like a C programmer. You don't need a dynamic string to count words.
:P
Consider applying for YC's Spring batch! Applications are open till Feb 11.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: