Examples with PriReference jcog.pri.PriReference used on opensource projects

Example 1 with PriReference

use of jcog.pri.PriReference in project narchy by automenta.

the class HijackBagTest method testHijackFlatBagRemainsRandomInNormalizedSampler.

@Test
public void testHijackFlatBagRemainsRandomInNormalizedSampler() {
    int n = 256;
    Bag<String, PriReference<String>> a = new DefaultHijackBag<>(max, n, 4);
    for (int i = 0; i < n * 8; i++) {
        a.put(new PLink("x" + Integer.toString(Float.floatToIntBits(1f / i), 5), ((float) (i)) / (n)));
    }
    a.commit();
    int size = a.size();
    // assertTrue(size >= 20 && size <= 30);
    // TreeSet<String> keys = new TreeSet();
    // Iterators.transform(a.iterator(), x -> x.get()).forEachRemaining(keys::add);
    // System.out.println( keys.size() + " " + Joiner.on(' ').join(keys) );
    TreeSet<String> keys2 = new TreeSet();
    a.forEach((b) -> {
        if (!keys2.add(b.get()))
            throw new RuntimeException("duplicate detected");
    });
    System.out.println(keys2.size() + " " + Joiner.on(' ').join(keys2));
    assertEquals(size, keys2.size());
// int b = 20;
// EmpiricalDistribution e = BagTest.getSamplingPriorityDistribution(a, n * 500, b);
// 
// printDist(e);
// 
// //monotonically increasing:
// assertTrue(e.getBinStats().get(0).getMean() < e.getBinStats().get(b-1).getMean());
// assertTrue(e.getBinStats().get(0).getMean() < e.getBinStats().get(b/2).getMean());
// assertTrue(e.getBinStats().get(b/2).getMean() < e.getBinStats().get(b-2).getMean());
// a.print();
}

Example 2 with PriReference

use of jcog.pri.PriReference in project narchy by automenta.

the class BagLab method update.

private synchronized void update() {
    int inputRate = 20;
    for (int j = 0; j < inputRate; j++) {
        int n = inputSliders.size();
        for (int i = 0; i < n; i++) {
            if (Math.random() < inputSliders.get(i).value()) {
                float p = (i + (float) Math.random()) / (n - 1);
                // float q = (float)Math.random(); //random quality
                bag.put(new PLink<>((int) Math.floor(Math.random() * uniques), p));
            }
        }
    }
    bag.commit();
    int bins = selectionHistogram.length;
    float sampleBatches = 1;
    int batchSize = 32;
    if (iteration++ % histogramResetPeriod == 0)
        Arrays.fill(selectionHistogram, 0);
    // System.out.println(bag.size());
    XorShift128PlusRandom rng = new XorShift128PlusRandom(1);
    List<PriReference<Integer>> sampled = $.newArrayList(1024);
    for (int i = 0; i < (int) sampleBatches; i++) {
        sampled.clear();
        // System.out.println(h + " " + v);
        bag.sample(rng, batchSize, (Consumer<PriReference<Integer>>) sampled::add);
        // BLink<Integer> sample = bag.sample();
        for (PriReference<Integer> sample : sampled) {
            if (sample != null) {
                float p = sample.priElseZero();
                selectionHistogram[Util.bin(p, bins - 1)]++;
            } else {
                break;
            }
        }
    }
}

Example 3 with PriReference

use of jcog.pri.PriReference in project narchy by automenta.

the class Builtin method registerFunctors.

public static void registerFunctors(NAR nar) {
    for (Concept t : Builtin.statik) {
        nar.on(t);
    }
    nar.on(Functor.f1("varIntro", (x) -> {
        Pair<Term, Map<Term, Term>> result = DepIndepVarIntroduction.the.apply(x, nar.random());
        return result != null ? result.getOne() : Null;
    }));
    nar.on(Functor.f1((Atom) $.the("termlinkRandom"), (Term t) -> {
        @Nullable Concept c = nar.conceptualize(t);
        if (c == null)
            return Null;
        @Nullable PriReference<Term> tl = c.termlinks().sample(nar.random());
        if (tl == null)
            return Null;
        return tl.get();
    }));
    // nar.on(Functor.f("service", (TermContainer c) ->
    // $.sete(
    // nar.services().map(
    // (e) ->
    // $.p(e, $.the(e.getValue().state())))
    // .toArray(Term[]::new)
    // )
    // ));
    /**
     * subterm, but specifically inside an ellipsis. otherwise pass through
     */
    nar.on(Functor.f("esubterm", (Subterms c) -> {
        Term x = c.sub(0, null);
        if (x == null)
            return Null;
        Term index = c.sub(1, Null);
        if (index == Null)
            return Null;
        int which;
        if (index != null) {
            if (index instanceof Variable)
                return Null;
            which = $.intValue(index, -1);
            if (which < 0) {
                return Null;
            }
        } else {
            // random
            which = nar.random().nextInt(x.subs());
        }
        return x.sub(which);
    }));
    nar.on(Functor.f2((Atom) $.the("without"), (Term container, Term content) -> Op.without(container, x -> x.equals(content), nar.random())));
    nar.on(Functor.f2((Atom) $.the("withoutPosOrNeg"), (Term container, Term content) -> Op.without(container, x -> x.unneg().equals(content), nar.random())));
    /**
     * TODO rename this to 'dropAnyCommutive'
     * remove an element from a commutive conjunction (or set), at random, and try re-creating
     * the compound. wont necessarily work in all situations.
     * TODO move the type restriction to another functor to wrap this
     *
     * this also filter a single variable (depvar) from being a result
     */
    nar.on(Functor.f1((Atom) $.the("dropAnySet"), (Term t) -> {
        Op oo = t.op();
        if (oo == INT) {
            if (t instanceof Int.IntRange) {
                // select random location in the int and split either up or down
                Int.IntRange i = (Int.IntRange) t;
                Random rng = nar.random();
                if (i.min + 1 == i.max) {
                    // arity=2
                    return Int.the(rng.nextBoolean() ? i.min : i.max);
                } else if (i.min + 2 == i.max) {
                    // arity=3
                    switch(rng.nextInt(4)) {
                        case 0:
                            return Int.the(i.min);
                        case 1:
                            return Int.range(i.min, i.min + 1);
                        case 2:
                            return Int.range(i.min + 1, i.min + 2);
                        case 3:
                            return Int.the(i.max);
                        default:
                            throw new UnsupportedOperationException();
                    }
                } else {
                    int split = // midpoint, deterministic
                    (i.max + i.min) / 2;
                    // rng.nextInt(i.max-i.min-2);
                    return (rng.nextBoolean()) ? Int.range(i.min, split + 1) : Int.range(split + 1, i.max);
                }
            }
            // cant drop int by itself
            return Null;
        }
        if (!oo.in(SETi.bit | SETe.bit | SECTi.bit | SECTe.bit))
            // returning the original value may cause feedback loop in callees expcting a change in value
            return Null;
        int size = t.subs();
        switch(size) {
            case 0:
                assert (false) : "empty set impossible here";
                return Null;
            case 1:
                return Null;
            /* can't shrink below one element */
            case 2:
                int n = nar.random().nextInt(2);
                return oo.the(t.sub(n));
            default:
                Term[] y = Terms.dropRandom(nar.random(), t.subterms());
                return oo.the(y);
        }
    }));
    /**
     * depvar cleaning from commutive conj
     */
    nar.on(Functor.f1((Atom) $.the("ifConjCommNoDepVars"), (Term t) -> {
        if (!t.hasAny(VAR_DEP))
            return t;
        Op oo = t.op();
        if (oo != CONJ)
            return t;
        SortedSet<Term> s = t.subterms().toSetSorted();
        if (!s.removeIf(x -> x.unneg().op() == VAR_DEP))
            return t;
        return CONJ.the(t.dt(), s);
    }));
    /**
     * drops a random contained event, whether at first layer or below
     */
    nar.on(Functor.f1((Atom) $.the("dropAnyEvent"), (Term t) -> {
        Op oo = t.op();
        if (oo != CONJ)
            // returning the original value may cause feedback loop in callees expcting a change in value
            return Null;
        FasterList<LongObjectPair<Term>> ee = Conj.eventList(t);
        ee.remove(nar.random().nextInt(ee.size()));
        return Conj.conj(ee);
    // }
    // if (r instanceof Variable /*&& r.op()!=VAR_DEP*/)
    // return Null; //HACK dont allow returning a variable as an event during decomposition HACK TODO make more careful and return the only result if one subterm is a non-returnable variable
    // return r;
    }));
    nar.on(Functor.f2((Atom) $.the("conjEvent"), (Term c, Term when) -> {
        if (c.op() != CONJ || !(when instanceof Atom))
            return Null;
        // extract earliest or latest &| timeslice of events
        throw new TODO();
    // if (c.dt() == DTERNAL || c.dt() == 0) {
    // return c.sub(nar.random().nextInt(c.subs())); //choose a subterm at random
    // }
    // assert (c.subs() == 2);
    // int target;
    // switch (when.toString()) {
    // case "early":
    // target = 0;
    // break;
    // case "late":
    // target = 1;
    // break;
    // default:
    // throw new UnsupportedOperationException();
    // }
    // if (c.dt() < 0)
    // target = 1 - target;
    // return c.sub(target);
    }));
    /**
     * similar to without() but special handling for CONJ sub-events
     */
    nar.on(Functor.f2((Atom) $.the("conjWithout"), (Term conj, Term event) -> {
        if (conj.op() != CONJ || conj.impossibleSubTerm(event))
            return Null;
        FasterList<LongObjectPair<Term>> events = Conj.eventList(conj);
        IntArrayList found = new IntArrayList(2);
        int es = events.size();
        assert (es > 1);
        for (int i = 0; i < es; i++) {
            if (event.equalsRoot(events.get(i).getTwo())) {
                found.add(i);
            }
        }
        int fs = found.size(), r;
        switch(fs) {
            case 0:
                return Null;
            case 1:
                r = found.get(0);
                break;
            default:
                r = found.get(nar.random().nextInt(fs));
                break;
        }
        events.remove(r);
        return Conj.conj(events);
    // } else {
    // return nullToNull(Op.without(conj, event::equalsRoot, nar.random()));
    // }
    }));
    /**
     * extracts only the events preceding the specified events
     */
    nar.on(Functor.f2((Atom) $.the("conjDropIfLatest"), (Term conj, Term event) -> Conj.conjDrop(conj, event, false)));
    nar.on(Functor.f2((Atom) $.the("conjDropIfEarliest"), (Term conj, Term event) -> Conj.conjDrop(conj, event, true)));
    nar.on(Functor.f1Concept("belief", nar, (c, n) -> $.quote(n.belief(c, n.time()))));
    nar.on(Functor.f1Concept("goal", nar, (c, n) -> $.quote(n.goal(c, n.time()))));
    nar.on(f0("self", nar::self));
    nar.on(Functor.f1("the", what -> {
        if (what instanceof Atom) {
            switch(what.toString()) {
                case "sys":
                    return $.p($.quote(nar.emotion.summary()), $.quote(nar.concepts.summary()), $.quote(nar.emotion.summary()), $.quote(nar.exe.toString()));
            }
        }
        Object x = nar.concept(what);
        if (x == null)
            x = what;
        return $.quote($.p($.quote(x.getClass().toString()), $.quote(x.toString())));
    }));
    // /** slice(<compound>,<selector>)
    // selector :-
    // a specific integer value index, from 0 to compound size
    // (a,b) pair of integers, a range of indices */
    nar.on(Functor.f("slice", (args) -> {
        if (args.subs() == 2) {
            Term x = args.sub(0);
            if (x.subs() > 0) {
                int len = x.subs();
                Term index = args.sub(1);
                Op o = index.op();
                if (o == INT) {
                    // specific index
                    int i = ((Int) index).id;
                    if (i >= 0 && i < len)
                        return x.sub(i);
                    else
                        return False;
                } else if (o == PROD && index.subs() == 2) {
                    Term start = (index).sub(0);
                    if (start.op() == INT) {
                        Term end = (index).sub(1);
                        if (end.op() == INT) {
                            int si = ((Int) start).id;
                            if (si >= 0 && si < len) {
                                int ei = ((Int) end).id;
                                if (ei >= 0 && ei <= len) {
                                    if (si == ei)
                                        return Op.EmptyProduct;
                                    if (si < ei) {
                                        return $.p(Arrays.copyOfRange(x.subterms().arrayClone(), si, ei));
                                    }
                                }
                            }
                            // TODO maybe reverse order will return reversed subproduct
                            return False;
                        }
                    }
                }
            }
        }
        return null;
    }));
}

Example 4 with PriReference

use of jcog.pri.PriReference in project narchy by automenta.

the class BagTest method testBasicInsertionRemoval.

public static void testBasicInsertionRemoval(Bag<String, PriReference<String>> c) {
    assertEquals(1, c.capacity());
    if (!(c instanceof DefaultHijackBag)) {
        assertEquals(0, c.size());
        assertTrue(c.isEmpty());
    }
    // insert an item with (nearly) zero budget
    PLink x0 = new PLink("x", 2 * Prioritized.EPSILON);
    PriReference added = c.put(x0);
    assertSame(added, x0);
    c.commit();
    assertEquals(1, c.size());
    assertEquals(0, c.priMin(), Prioritized.EPSILON * 2);
    PriReference<String> x = c.get("x");
    assertNotNull(x);
    assertSame(x, x0);
    assertTrue(Util.equals(Prioritized.Zero.priElseNeg1(), x.priElseNeg1(), 0.01f));
}

Example 5 with PriReference

use of jcog.pri.PriReference in project narchy by automenta.

the class ArrayBagTest method testSort.

@Test
public void testSort() {
    PLinkArrayBag a = new PLinkArrayBag(4, plus, new HashMap<>(4));
    a.put(new PLink("x", 0.1f));
    a.put(new PLink("y", 0.2f));
    a.commit(null);
    Iterator<PriReference<String>> ii = a.iterator();
    assertEquals("y", ii.next().get());
    assertEquals("x", ii.next().get());
    assertEquals("[$0.2000 y, $0.1000 x]", a.listCopy().toString());
    System.out.println(a.listCopy());
    a.put(new PLink("x", 0.2f));
    System.out.println(a.listCopy());
    a.commit();
    // x should now be ahead
    // x first
    assertTrue(a.listCopy().toString().contains("x,"));
    // y second
    assertTrue(a.listCopy().toString().contains("y]"));
    ii = a.iterator();
    assertEquals("x", ii.next().get());
    assertEquals("y", ii.next().get());
}