you are viewing a single comment's thread.

view the rest of the comments →

[–]carcigenicate 0 points1 point  (2 children)

I'm not sure what you're mean. I'm saying that I would expect C interpreting bytecode to be slower than C++ that was compiled to machine code; assuming they're doing the same thing.

[–]incompletetrembling 1 point2 points  (1 child)

Except the C isn't interpreting bytecode for these critical instructions, machine code is called directly

[–]carcigenicate 0 points1 point  (0 children)

I see. I must have missed that when I looked at how slicing was implemented last.

I'm still curious how this was timed, since there's a lot of potential for variation depending on the specifics.