Examples of abstrasy.Hash.ref()

abstrasy.Hash.ref()
Permet de récupérer le Node enregistré dans la table à l'aide de la clé k. Si la clé k n'existe pas, elle est toutefois créée dynamiquement. De cette manière l'intégrité référentielle de la table est respectée. On peut assigner les valeurs par node.derefTo(Hash.ref(K))... @param k @return v (ou une nouvelle cellule Node si k n'existe pas) @throws InterpreterException

            
            Hash hash =xnode.getHash();
            ArrayList<Node> kn=hash.keys_nodes();
            for(int i=0;i<kn.size();i++) {
                Node k=kn.get(i);
                Node v=hash.ref(k);
                if (Node.equalsNodes(v, snode))
                    res.addElement(k.secure());
            }
            
        }

View Full Code Here

            // forme (hash hash)
            //
            Hash hash2=startAt.getSubNode(1, Node.TYPE_HASH).getHash();
            ArrayList<Node> kn=hash2.keys_nodes();
            for(int i=0;i<kn.size();i++)
                hash.store(kn.get(i), hash2.ref(kn.get(i)).secure());
            return nhash;
        }
        
        //    
        // autres formes...

View Full Code Here

                Node ap=startAt.getSubNode(i, qt);
                Hash your_h=ap.getHash();
                ArrayList<Node> kn=your_h.keys_nodes();
                int kn_size=kn.size();
                for(int j=0;j<kn_size;j++)
                    my_h.store(kn.get(j),your_h.ref(kn.get(j)).secure());
            }
            return Node.createHash(my_h);
        }


    }

View Full Code Here

                Node ap=startAt.getSubNode(i, qt);
                Hash your_h=ap.getHash();
                ArrayList<Node> kn=your_h.keys_nodes();
                int kn_size=kn.size();
                for(int j=0;j<kn_size;j++)
                    my_h.store(kn.get(j),your_h.ref(kn.get(j)).secure());
            }
            return null;
        }


    }

View Full Code Here

                     *  forme (@hash clé)
                     *
                     */
                    startAt.isGoodArgsCnt(3);
                    Hash hash = target.getHash();
                    target = hash.ref(startAt.getSubNode(2, Hash.KEY_TYPES));
                    return Node.createRef(target);
                }


            case Node.TYPE_CLIST:
                {

View Full Code Here

         * Post-traitepment de r.
         */
        if (force_enc) {
            ArrayList<Node> kn=r.keys_nodes();
            for (int i = 0; i < kn.size(); i++)
                r.store(kn.get(i), Node.quoteEncoded_encode(r.ref(kn.get(i))));
        }


        return Node.createHash(r);
    }

View Full Code Here

                    for (int i = 0; i < kn.size(); i++) {


                        Node a = kn.get(i);
                        a.requireNodeType(Node.TYPE_QSYMBOL);


                        Node b = l.ref(a);


                        a = Node.quoteEncoded_decode(a); /* astuce pour ici */
                        if (!b.isQuoted())
                            b = Node.quoteEncoded_encode(b);
                        b = Node.quoteEncoded_decode(b);

View Full Code Here

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.