construct

I have the edges and i want to build a tree with it. The problem is that i can construct my tree structure only when edges are in specific order. Example of orders: (vertex, parent_vertex) good: bad: (0, ) <-top (3, 2) (1, 0) (1, 0) (2, 1) (3, 2) (3, 2) (0, ) <-top I iterate throw the edges and for current vertex trying to find it's parent in created tree, then i construct the node and insert it. result tree: 0 - 1 - 2 - 3 So there is always must exist a parent in the tree for the new added vertex. The question is how to sort the input edges. Voices tells me about the topological sort, but it

Is there a Java equivalent of Python's "construct" library? I want to write "structs" like so: message = Struct("message", UBInt8("protocol"), UBInt16("length"), MetaField("data", lambda ctx: ctx["length"]) ) It doesn't have to specifically be a library with some sort of abstraction using the Java language. I mean, it could be a "portable" format, with an API for parsing the documents. I guess this could work out with XML, but it would be be a lot more ugly. I realize I could just inter-operate with Python, but I don't want to do that. I've looked a lot around and all I could find was Ragel

why this code isn't working? I was trying to rename, switch location and other, but it seems to be str_replace bug. It would be nice, if somebody told me, what's wrong... This is my index.php <?php header('Content-Type:text/html;charset=utf-8'); session_start(); require_once ('inc/core.php'); $core = new core($_GET['viev']); this is core.php <?php class core{ var $template; var $view; public function __construct($view) { $this->template = $this->loadTemplate(); $this->view = $view; $this->loadView(); echo $this->template; } private function loadTemplate(){ if(file_exists('template/template

I'm not sure what this construct means but I've seen it a few times. The example below is from another Stack Overflow question. I'm not sure how to interpret the initial "or" construct itself: Object.keys = Object.keys || (function () { var hasOwnProperty = Object.prototype.hasOwnProperty, hasDontEnumBug = !{toString:null}.propertyIsEnumerable("toString"), DontEnums = [ 'toString', 'toLocaleString', 'valueOf', 'hasOwnProperty', 'isPrototypeOf', 'propertyIsEnumerable', 'constructor' ], DontEnumsLength = DontEnums.length; //etc... }); Peter Olson a = a || function(){...} is an idiom that is very

Is there any way that I can use a hashcode of a string in java, and recreate that string? e.g. something like this: String myNewstring = StringUtils.createFromHashCode("Hello World".hashCode()); if (!myNewstring.equals("Hello World")) System.out.println("Hmm, something went wrong: " + myNewstring); I say this, because I must turn a string into an integer value, and reconstruct that string from that integer value. This is impossible. The hash code for String is lossy; many String values will result in the same hash code. An integer has 32 bit positions and each position has two values. There's

I've those 2 entities Class A { @OneToMany(mappedBy="a") private List<B> bs; } Class B { @ManyToOne private A a; private String name; } 1) I would like to construct a query that says get all A's that have at least one B with name ="mohamede1945" 2) I would like to construct a query that says get all A's that don't have any B with name = "mohamede1945" Could anyone help me? You can use the ANY and ALL constructs to filter the subquery. So something like 1. FROM A aEntity WHERE 'mohamede1945' = ANY (SELECT bEntity.name FROM aEntity.bs bEntity) 2. FROM A aEntity WHERE 'mohamede1945' <> ALL