Skip to main content

Transcript from "Enter The Matrix" video game, Niobe and the Oracle conversation

ORACLE: Niobe.....
NIOBE: Do I know you?
ORACLE: You know me, though you just may not recognize me.
NIOBE: Are you telling me that you are the Oracle?
ORACLE: I know this may not be easy for any of you, change never is. I wish the face you remember was the face I was still wearing, but that face is gone.
NIOBE: If you are the Oracle, tell me if I believe you are.
ORACLE: You don't right now, but you will.
NIOBE: Are you going to tell me something to make me believe you?
ORACLE: Come on Niobe, you know I can't do that.
N: Why not?
O: Because I cannot make you do anything.
N: At least you sound the same.
O: As I said, you may not recognize the face, but who and what I am underneath remains the same.
N: Can I ask what happened?
O: The Merovingian warned me, that If I made a certain choice it would cost me. He is, among other things, a man of his word.
N: What was the choice?
O: The same one you yourself will have to make: The choice to help Neo or not.
N: Then Neo is still alive?
O: Yes, he touched the source and seperated his mind from his body. Now he lies trapped in a place between your world and ours.
N: Can we free him?
O: Trinity can, but she will have to fight her way through hell to do it.
N: Can I help?
O: That's why I called you. I cannot tell you what is going to happen. All I can do is hope that if given the chance, you will find the courage to do what you can.
N: You once told me you knew everything you needed to.
O: I do. I knew everything from the begining of this path to the end.
N: I don't understand.
O: Even I can't see beyond the end.
N: The end? Are you trying to tell me the world is going to end?
O: Yes. If we cannot save it, it will end.
N: You mean Neo.
O: I mean we. The path of the one is made by the many. I have a role to play just as you have yours.

Comments

Popular posts from this blog

Spring, Angular and other reasons I like and hate Bazel at the same time

For several weeks I've been trying to put together an Angular application served Java Spring MVC web server in Bazel. I've seen the Java, Angular combination works well in Google, and given the popularity of Java, I want get it to work with open source. How hard can it be to run arguably the best JS framework on a server in probably the most popular server-side language with  the mono-repo of planet-scale ? The rest of this post walks through the headaches and nightmares I had to get things to work but if you are just here to look for a working example, github/jiaqi/angular-on-java is all you need. https://github.com/jiaqi/angular-on-java Java web application with Appengine rule Surprisingly there isn't an official way of building Java web application in Bazel, the closest thing is the Appengine rule  and Spring MVC seems to work well with it. 3 Java classes, a JSP and an appengine.xml was all I need. At this point, the server starts well but I got "No ...

Customize IdGenerator in JPA, gap between Hibernate and JPA annotations

JPA annotation is like a subset of Hibernate annotation, this means people will find something available in Hibernate missing in JPA. One of the important missing features in JPA is customized ID generator. JPA doesn't provide an approach for developer to plug in their own IdGenerator. For example, if you want the primary key of a table to be BigInteger coming from sequence, JPA will be out of solution. Assume you don't mind the mixture of Hibernate and JPA Annotation and your JPA provider is Hibernate, which is mostly the case, a solution before JPA starts introducing new Annotation is, to replace JPA @SequenceGenerator with Hibernate @GenericGenerator. Now, let the code talk. /** * Ordinary JPA sequence. * If the Long is changed into BigInteger, * there will be runtime error complaining about the type of primary key */ @Id @Column(name = "id", precision = 12) @GeneratedValue(strategy = GenerationType.SEQUENCE, generator = "XyzIdGenerator") @SequenceGe...

Project Euler problem 220 - Heighway Dragon

This document goes through a Java solution for Project Euler problem 220 . If you want to achieve the pleasure of solving the unfamiliarity and you don't have a solution yet, PLEASE STOP READING UNTIL YOU FIND A SOLUTION. Problem 220 is to tell the coordinate after a given large number of steps in a Dragon Curve . The first thing came to my mind, is to DFS traverse a 50 level tree by 10^12 steps, during which it keeps track of a direction and a coordinate. Roughly estimate, this solution takes a 50 level recursion, which isn't horrible, and 10^12 switch/case calls. Written by a lazy and irresponsible Java engineer, this solution vaguely looks like: Traveler traveler = new Traveler(new Coordinate(0, 0), Direction.UP); void main() { try { traverse("Fa", 0); } catch (TerminationSignal signal) { print signal; } } void traverse(String plan, int level) { foreach(char c:plan) { switch(c) { case 'F': traveler.stepForward(); break; ca...