Examples with IntArrayList org.eclipse.collections.impl.list.mutable.primitive.IntArrayList used on opensource projects

Example 16 with IntArrayList

use of org.eclipse.collections.impl.list.mutable.primitive.IntArrayList 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 17 with IntArrayList

use of org.eclipse.collections.impl.list.mutable.primitive.IntArrayList in project neo4j by neo4j.

the class SimpleBitSetTest method shouldAllowIterating.

@Test
void shouldAllowIterating() {
    // Given
    SimpleBitSet set = new SimpleBitSet(64);
    set.put(4);
    set.put(7);
    set.put(63);
    set.put(78);
    // When
    IntIterator iterator = set.iterator();
    MutableIntList found = new IntArrayList();
    while (iterator.hasNext()) {
        found.add(iterator.next());
    }
    // Then
    assertThat(found).isEqualTo(IntLists.immutable.of(4, 7, 63, 78));
}

Example 18 with IntArrayList

use of org.eclipse.collections.impl.list.mutable.primitive.IntArrayList in project narchy by automenta.

the class RankIndexing method getChain.

/**
 * relatively unoptimized, as it allocates memory!
 *
 * @param chainNumber
 * @param I0
 * @param IStar
 * @param is
 * @return
 */
public static IntArrayList getChain(int chainNumber, long I0, long IStar, int is) {
    IntArrayList itemIdx = new IntArrayList(3);
    int[] offsets = getItemsPerLevel(I0, IStar);
    int firstItem = getNextChainIndex(chainNumber, I0, 0);
    itemIdx.add(firstItem);
    int offset = 0;
    int i = 0;
    while (firstItem >= 0 && i <= is) {
        firstItem = getNextChainIndex(firstItem, IStar, offset);
        if (firstItem < 0)
            return itemIdx;
        offset += offsets[i];
        // item offset within level.  + level offset
        int levelOffset = offset;
        // if(!itemIdx.contains(levelOffset+firstItem))
        itemIdx.add(levelOffset + firstItem);
        // go for next level. - if needed.
        i++;
    }
    return itemIdx;
}

Example 19 with IntArrayList

use of org.eclipse.collections.impl.list.mutable.primitive.IntArrayList in project narchy by automenta.

the class GraphMeter method bfs.

// =================== public methods ================================
// ====================================================================
/**
 * Collects nodes accessible from node "from" using breadth-first search.
 * Its parameters and side-effects are identical to those of dfs.
 * In addition, it stores the shortest distances from "from" in {@link #d},
 * if it is not null. On return, <code>d[i]</code> contains the length of
 * the shortest path from "from" to "i", if such a path exists, or it is
 * unchanged (ie the original value of <code>d[i]</code> is kept,
 * whatever that was.
 * <code>d</code> must either be long enough or null.
 */
private void bfs(int from) {
    IntArrayList q = new IntArrayList();
    q.add(from);
    q.add(0);
    if (d != null)
        d[from] = 0;
    color[from] = GREY;
    while (!q.isEmpty()) {
        int u = q.removeAtIndex(0);
        int du = q.removeAtIndex(0);
        g.neighbors(u).forEach(j -> {
            int cj = color[j];
            if (cj == WHITE) {
                color[j] = GREY;
                q.add(j);
                q.add(du + 1);
                if (d != null)
                    d[j] = du + 1;
            } else {
                if (cj < 0)
                    cluster.add(cj);
            }
        });
        color[u] = BLACK;
    }
}

Example 20 with IntArrayList

use of org.eclipse.collections.impl.list.mutable.primitive.IntArrayList in project narchy by automenta.

the class TinyCountingTable method adjustChainToItems.

/**
 * After storing a value the number of items in the chain may change, this function adjust the number to be sufficient for all fingerprint items and counter items.
 *
 * @param bucketId
 * @param chainId
 * @param items
 * @return
 */
private IntList adjustChainToItems(int bucketId, int chainId, PrimitiveIterable items) {
    IntArrayList chain = RankIndexing.getChain(chainId, I0[bucketId], IStar[bucketId], this.bucketCapacity);
    FingerPrint fpaux = new FingerPrint(bucketId, chainId, 1L);
    // if the chain is shorter than needed we add dummy items.
    int cs = chain.size();
    int is = items.size();
    if (cs < is) {
        int diff = is - cs;
        while (diff > 0) {
            this.add(fpaux);
            diff--;
        }
    } else // if the chain is longer than needed we remove items.
    if (cs > is) {
        int diff = cs - is;
        while (diff > 0) {
            shrinkChain(bucketId, chainId);
            diff--;
        // this.nrItems--;
        }
    }
    chain = RankIndexing.getChain(chainId, I0[bucketId], IStar[bucketId], bucketCapacity);
    return chain;
}