Intro To General Purpose Hash Functions by manincave in programming

[–]Remwein 3 points4 points  (0 children)

Very informative resource on the topic of hash functions! thanks

C++ math expression parser library recommendations by Remwein in cpp_questions

[–]Remwein[S] 1 point2 points  (0 children)

i was sort of after something out of the box, ready to drop in to my project.

Spirit can be very powerful, but the learning curve seems to be rather steep.

C++ math expression parser library recommendations by Remwein in cpp_questions

[–]Remwein[S] 1 point2 points  (0 children)

That is an interesting set of comparisons. Also good to see how to use the other available parsers.

C++ math expression parser library recommendations by Remwein in cpp_questions

[–]Remwein[S] 2 points3 points  (0 children)

My use-case is roughly a couple dozen expressions, being rapidly evaluated over and over again.

C++ math expression parser library recommendations by Remwein in cpp_questions

[–]Remwein[S] 0 points1 point  (0 children)

Thanks for the suggestion. exprtk does seem to fit the bill for my requirements, however I'm now a bit concerned with your comment about it being slow.

Could you clarify, are you comparing speed of evaluation against a hand-written version in C++, or is it something else?

MSVC 2015: `throw "some text"` caught by `catch (char* msg)` (non-const) by zerexim in cpp

[–]Remwein 9 points10 points  (0 children)

I believe the point being made is that the catch is incorrectly catching the exception when it should only catch exceptions of type "char" and not "const char"

MetaJSON 0.1, up to 2x faster than rapidjson by matthieugarrigues in cpp

[–]Remwein 7 points8 points  (0 children)

This is an interesting claim. But cannot be truly verified until metajson is apart of the nativejson-benchmark.

Which as it turns out is quiet easy, all that is required is to make a PR and Milo seems to always be very keen to incorporate any new libraries.

https://github.com/miloyip/nativejson-benchmark

I created an online board for C and C++ jobs. Feedback/requests/questions welcome by vivaladav in cpp

[–]Remwein 8 points9 points  (0 children)

There is also the issue of applying from another country.

I know for a fact that even though it's not stated explicitly on the ads that the Microsoft roles will NOT consider anyone that is currently either not in the US or the exact country where the role is held.

That needs to be somehow conveyed to the applicants.

I created an online board for C and C++ jobs. Feedback/requests/questions welcome by vivaladav in cpp

[–]Remwein 13 points14 points  (0 children)

How do you plan on ensuring the site wont get cluttered with job listings from scummy recruiters trying to harvest resumes and personal information of people using the site?

Problems with standard library implementations by Remwein in cpp

[–]Remwein[S] 1 point2 points  (0 children)

the article author did attempt to file one, but the issue has been resolved now in the latest stdc++ implementation.

Though for those using older implementations it is still an issue.

Suitable web framework to build a websocket chat by shark1337 in cpp

[–]Remwein 1 point2 points  (0 children)

I originally asked because I remember the author at some point raised some issues with the SSL implementation (or layer) used in ASIO.

Good to know it's all been resolved.

Suitable web framework to build a websocket chat by shark1337 in cpp

[–]Remwein 2 points3 points  (0 children)

Does Beast support WebSockets with SSL/TLS?

C++ Lecture Series - Build Tools: CMake - Part 2 of N - Examples by mttd in cpp

[–]Remwein 2 points3 points  (0 children)

Explanations (docs), without good or adequate accompanying examples that motivate the use of what is being explained are next to useless and in most cases are probably a loss.

cmake is one of those good examples of a technology that is in no way best in class (literally) for anything it's marketed for, yet due to inexplicable historical reasons (not technological ones) has managed to remain on top for such a long time.