LucioFranco

Amethyst Networking TODO

• Fix warnings
• Make docs + book section
• Merge
• Prototype a proper connection manager (partially implemented in connection_manager.rs)
• Abstract away UdpSocket behind a trait so we can also have tcp and others
• Different ways of sending messages (reliable ordered, reliable unordered, unreliable/fast)
• Finish filter (partial implementation in filter.rs)
• then comes the harder stuff: Entity creation deletion and sync

LucioFranco

Keybase proof

I hereby claim:

• I am luciofranco on github.
• I am luciofranco (https://keybase.io/luciofranco) on keybase.
• I have a public key ASCkjMKCgrqAIgx1cE5rUGm_RIYLk0d2xDgCb-WbAtgPNgo

To claim this, I am signing this object:

LucioFranco

(check-expect (eval-program (bool-parser (lex-this bool-lexer (open-input-string "(((false)) or true)")))) true)
(check-expect (eval-program (bool-parser (lex-this bool-lexer (open-input-string "(not true)")))) false)
(check-expect (eval-program (bool-parser (lex-this bool-lexer (open-input-string "(if true then ((false) or true) else false)")))) true)
(check-expect (eval-program (bool-parser (lex-this bool-lexer (open-input-string "(let (verytrue false) in (verytrue))")))) false)
(check-expect (eval-program (bool-parser (lex-this bool-lexer (open-input-string "(let (tango (lambda (x) (x and false))) in (call tango with true))")))) false)

LucioFranco

// components.rs
use amethyst::ecs::{Component, VecStorage};

#[derive(Debug)]
pub struct Position {
    pub x: f32,
    pub y: f32,
    pub z: f32,
}

LucioFranco

	public LinkedList iCopy() {
		LinkedList temp = new LinkedList();
		Node currentNode = this.startNode;
		while(currentNode != null) {
			temp.add(currentNode.getValue());
			currentNode = currentNode.getNextNode();
		}
		return temp;
	}