problem about object-graph-Collection of common programming errors

12 years ago
admin
2 minutes

  • Pascal Thivent
    nhibernate serialization orm entity-relationship object-graph
    I have two NHibernate-managed entities that have a bi-directional one-to-many relationship:public class Storage {public virtual string Name { get; set; }public virtual IList<Box> Boxes { get; set; } }public class Box {public virtual string Box { get; set; }[DoNotSerialize] public virtual Storage ParentStorage { get; set; } }A Storage can contain many Boxes, and a Box always belongs in a Storage. I want to edit a Box’s name, so I send it to the client using JSON. Note that I don’t serialize

  • DON1101
    java static-analysis object-graph
    In Java language. Given a root class, I want to find out all the classes referenced by the root(the whole object graph). Java Reflect is not sufficient. Because :Class A{List list = new ArrayList();public void add(Object obj){list.add(obj);}public void add2(){Ent ent = new Ent();add(ent);} }Using Reflect, I can easily get “Class A contains (Object)”. But actually what I want is “Class A contains (Ent)”.I want to analyze the java src code or .class file to find out the whole object graph statica

  • Debugger

  • ila
    ios core-data nscoding object-graph
    I am trying to save an NSMutableArray in CoreData. The Array contains objects NSDictionary NSDictionary has following Structure valueDict = {FloorId = F0001;endCoordinates = “NSPoint: {541, 413}”;linePath = “<UIBezierPath: 0x1d0903c0>”;pointsOnLine = ();startCoordinates = “NSPoint: {418, 504}”; },To write to the Core Data I use following code: parray is type BinaryDatapoints.parray = [NSKeyedArchiver archivedDataWithRootObject:self.locationsArray];and to retrieve value I uselocationsA

  • MgSam
    javascript deep-copy object-graph
    I need a function which makes a deep copy of an object in JavaScript. Each object is part of a larger graph (thus the need for a deep copy function). For example,//Node “class” with references to its parent and children var MyNode = (function () {function MyNode() {this.children = undefined;this.parent = undefined;}return MyNode; })();The graph has no loops. My thought was to do a depth-first-search through the graph and use a dictionary that stores a hash of each Node with its copy. As each nod

Web site is in building