sesquipedalian

10 ms·

1.
by sesquipedalian 10y ago
1) Tastes bland. 2) Think about how it tastes. 3) Tastes salty now. 4) Think again about how it tastes. 5) Goto 1. Hence the "strange loop".
2.
by sesquipedalian 10y ago
Care to elaborate?
3.
by sesquipedalian 10y ago
Very bare-bones implementation in one source file (+ 1 header) https://github.com/pedro-onate/eva/tree/84a62881c610ef23f9f1... . Later versions include GC, and bytecode compiler + VM. Edit: I highly recommend
4.
by sesquipedalian 10y ago
Probably some form of verlet integration: http://gamedevelopment.tutsplus.com/tutorials/simulate-teara... . Author's github page also has links to a list of cloth simulation resources.
5.
by sesquipedalian 10y ago
Interesting. I've never heard of D-list nomenclature before. With the A-list method you typically need to write a "zipper" function, that recursively conses the heads of two lists to generate the A-list. Makes "apply&quo
6.
by sesquipedalian 10y ago
Its both a compiler and an interpreter. Read up on Petite Chez Scheme.
7.
by sesquipedalian 10y ago
I'm very excited about this. I've been using Chez as my performance benchmark target for my own Scheme implementation.
8.
by sesquipedalian 10y ago
First of all, it's great that you're exploring functional programming paradigms and their applicability to game programming/state management. That being said I have to point out some things that bothered me: I believe you&#x2
9.
by sesquipedalian 11y ago
I've found that BSP trees are a quite elegant, albeit, more complicated alternative for handling point-in-polygon queries compared to raycasting. Essentially, it decomposes an arbitrary non-convex polygon into a binary tree of half-spa
10.
by sesquipedalian 11y ago
I found the statement regarding runtime exceptions confusing as well. Perhaps what is meant by that statement is that Pony lacks unchecked (i.e. Java) rather than runtime exceptions.
11.
by sesquipedalian 11y ago
What makes Common Lisp macros easier to use than Scheme's?
12.
by sesquipedalian 11y ago
Good example. Minor nitpick, you listed 0.09 twice.
13.
by sesquipedalian 11y ago
This is one of those things that seems obvious in hindsight. However, it never occurred to me that one could simply use the lock address to impose a consistent and unique ordering on the locks rather than some other explicit mechanism. It&#
14.
by sesquipedalian 11y ago
I wouldn't place too much importance on their choice of implementation language. I'd imagine the goal of showcasing their reference implementation is to demonstrate the operational semantics of their virtual machine. Equivalent im
15.
by sesquipedalian 11y ago
Real computer scientists use comic sans for their presentations. In all seriousness though, I've noticed that it was the font of choice for my CS professors in college.
16.
by sesquipedalian 11y ago
Why does it matter what approach he took to solve the problem? What relevance does it have that someone else without domain expertise or post-graduate education is capable of solving this? I'm not an expert in this field, nor do I thin
17.
by sesquipedalian 11y ago
I believe something like http://sweetjs.org can polyfill "let" and "class" syntax.
18.
by sesquipedalian 11y ago
If I'm not mistaken, this sounds like an incremental fisher-yates shuffle.
19.
by sesquipedalian 12y ago
I don't believe non-stack based APIs prevent the implementation of the features you just mentioned. You don't necessarily have to expose the underlying stack manipulation routines as your defacto API although it is easier to do so
20.
by sesquipedalian 12y ago
Agreed. The biggest drawback IMHO is you defer errors that could have been caught at compile time to runtime if you had a saner interface.
21.
by sesquipedalian 12y ago
Google buys these guys out.
22.
by sesquipedalian 12y ago
I know it is too early to say, but if I had to guess what the next Google would look like, it would be this.