Searched defs:Lists (Results 1 - 7 of 7) sorted by relevance

/barrelfish-master/usr/eclipseclp/documents/libman/
H A Dfdglobal.tex
/barrelfish-master/usr/eclipseclp/documents/internal/project/
H A Dorganisation.tex
/barrelfish-master/usr/eclipseclp/documents/userman/
H A Dumsstring.tex
H A Dexthsusp.tex
H A Dumslanguage.tex
/barrelfish-master/usr/eclipseclp/documents/internal/kernel/
H A Dkernel.tex
/barrelfish-master/usr/eclipseclp/documents/applications/
H A Dtutorial.tex504 \\index{structure, nested}\\index{nested structure}A very common data representation problem is how to access information about some structure from another structure, for example in RiskWise how to access the information about a router from an interface of the router. There are two main alternatives. The first is to insert the data of the first entity (router) directly in the representation of the second entity (interface) as an additional attribute, the second is to store a key which can be used to look up the entity. Although the first method has the advantage of avoiding the extra lookup, we do not recommend this approach. If we have recursive references to objects (in our example above if the router also contains a link to all its interfaces) then this direct representation becomes an infinite data structure, which causes problems for printing and debugging. If we use the second approach, we obviously need a way to find the entity belonging to a particular key without too much overhead. The choice of the key depends on the representation of our overall data structure, which we will discuss in the next sections. subsubsection

Completed in 181 milliseconds