But a good one.
c ?. setDoubleBuffered(b);
if (c != null) c.setDoubleBuffered(c);
The demo is word-based, but we have a function for efficient phrase-based translation too.
I invented a new data structure (I think). It's an array (variable-size list) where each add, remove, update and random access completes in O(log n) time.
I call it a Log-N array. The implementation uses an order statistic red-black tree. This could be nice for handling long token lists during JavaX transpilation.
Stefan Reich builds agi.blue, the Google-killing AI database & chat bot making platform. New functions built: Inter-slice links, Delete page, Checkboxes.
Randall Brown & band (including me).
Consider this text:
First, I wake up. Then, I get dressed. I walk to school. I do not ride a bike. [...] Question 1: What happens first? 1 Get dressed 2 Wake up 3 Eat lunch 4 Walk to school [+4 more questions]
Program that solves this. (One screen of code as always.)
The engine is pretty generic. It works by correlating words in the text, the question and the answer. The only additional information we put in is a list of "important words"—this time in the form of regular expressions:
"(?<!not )like", "not like", "dinner", "school", "bed"
The first expression matches on "like", but not on "not like" which avoids some confusion.
(Why do we have to put in these regular expressions? Well, the AI is young, so we help it out a little bit. The semantic knowledge the AI gathers in these exercises will eventually allow it to function without human help.)
Now on to more challenges!