Package abstrasy

Examples of abstrasy.Hash

94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
           
        }

        if (qt==Node.TYPE_HASH) {
           
            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
53
54
55
56
57
58
59
60
61
62
63
        Node a = startAt.getSubNode(1, CAST);
        Node b = startAt.getSubNode(2, a.getQType());

        boolean force_enc = (a.isQuoted() || a.getType() == Node.TYPE_LAZY);

        Hash r = new Hash();

        /*
         * Attention, si l'unification n'est pas valide, retourner une liste vide...
         */
        boolean res = PCFx_unify.unify_symbol(a, b, r, force_enc);
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
         *         
     */
   
   
        Node nhash=Node.createHash();
        Hash hash=nhash.getHash();
       
        if(startAt.size()==2){
            //
            // 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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
            }
            return acc;
        }
        else {
            // hash
            Hash my_h=arg0.getHash().copy_my_self();
            for(int i=2;i < startAt.size();i++){
                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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
            }
            return null;
        }
        else{
            // hash
            Hash my_h=arg0.getHash();
            for(int i=2;i < startAt.size();i++){
                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
93
94
95
96
97
98
99
100
101
102
103
104
                     *
                     *  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
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
                        case Node.TYPE_CLIST:
                            {
                                /*
                                 * (remove! [primvals] from (hash ...))
                                 */
                                Hash hash=xnode.getHash();
                                for (int i = 0; i < inode.size(); i++) {
                                    Node enode = inode.getSubNode(i, Hash.KEY_TYPES);
                                    if(!hash.remove(enode))
                                        throw new InterpreterException(StdErrors.extend(StdErrors.Not_found, enode.toString()));
                                }
                                break;
                            }
                        default:
                            {
                                /*
                                 * (remove! primval from (hash ...))
                                 */
                                Hash hash=xnode.getHash();
                                if(!hash.remove(inode))
                                        throw new InterpreterException(StdErrors.extend(StdErrors.Not_found, inode.toString()));
                                break;
                            }
                    }
                }
View Full Code Here
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
        Node a = startAt.getSubNode(1, CAST);
        Node b = startAt.getSubNode(2, a.getQType());

        boolean force_enc = (a.isQuoted() || a.getType() == Node.TYPE_LAZY);

        Hash r = new Hash();

        /*
         * Attention, si l'unification n'est pas valide, retourner une liste vide...
         */
        if (!unify_symbol(a, b, r, force_enc)) {
            r = new Hash();
        }

        /*
         * 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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
                }
            case 4:
                {
                    startAt.requirePCode(2, PCoder.PC_IN);
                    c = Node.createClone(startAt.getSubNode(3, Node.VTYPE_METAEXPRESSION));
                    Hash l = startAt.getSubNode(1, Node.TYPE_HASH).getHash();

                    Node[] symbols = new Node[l.size()];
                    Node[] values = new Node[l.size()];

                    ArrayList<Node> kn = l.keys_nodes();
                    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

Related Classes of abstrasy.Hash

  • abstrasy.externals.External_Date
  • abstrasy.libraries.io.External_File
  • abstrasy.libraries.os.External_SystemAdapter
  • abstrasy.pcfx.PCFx_find
  • abstrasy.pcfx.PCFx_hash
  • abstrasy.pcfx.PCFx_is__match
  • abstrasy.pcfx.PCFx_merge
  • abstrasy.pcfx.PCFx_merge_static
  • abstrasy.pcfx.PCFx_ref
  • abstrasy.pcfx.PCFx_remove_static
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.