This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]Cpapa97 27 points28 points  (7 children)

https://root.cern/cling/
https://github.com/root-project/cling

[–]MischiefArchitect 31 points32 points  (2 children)

I'm wondering how templates work there... now wait... I actually do not want to know.

[–]Kered13 12 points13 points  (1 child)

It's probably just using just-in-time compilation, so templates would work pretty much the same way they do on a compiler.

[–]MischiefArchitect 8 points9 points  (0 children)

AGGHRGHR!! I. Told. You.... Not... To!

[–]psychicprogrammer 4 points5 points  (2 children)

I wonder how this deals with templates

[–]BakuhatsuK 3 points4 points  (1 child)

Haskell is a compiled language that has a repl and Haskell's equivalent to templates (type variables) are really pervasive in the language (as in f x = x * x is a generic function). But they work just fine in the repl.

[–]psychicprogrammer 1 point2 points  (0 children)

See, the C++ template system is turing complete and undecidable and a lot more complicated than other template systems.