Package it.unimi.dsi.fastutil.longs

Examples of it.unimi.dsi.fastutil.longs.LongOpenHashSet

104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
     * @param uvec The user's normalized preference vector.
     * @param itemSet The set of target items.
     * @return The set of IDs of candidate neighbors.
     */
    private LongSet findCandidateNeighbors(long user, SparseVector uvec, LongCollection itemSet) {
        LongSet users = new LongOpenHashSet(100);
        LongSet userItems = uvec.keySet();

        LongIterator items;
        if (userItems.size() < itemSet.size()) {
            items = userItems.iterator();
        } else {
            items = itemSet.iterator();
        }
        while (items.hasNext()) {
            LongSet iusers = itemDAO.getUsersForItem(items.nextLong());
            if (iusers != null) {
                users.addAll(iusers);
            }
        }
        users.remove(user);

        return users;
    }
View Full Code Here
179
180
181
182
183
184
185
186
187
188
189
190
191
    }

    protected LongSet getIdSet(PreparedStatement s) throws SQLException {
        ResultSet results = s.executeQuery();
        try {
            LongSet ids = new LongOpenHashSet();
            while (results.next()) {
                ids.add(results.getLong(1));
            }
            return ids;
        } finally {
            results.close();
        }
View Full Code Here
85
86
87
88
89
90
91
92
93
94
95
    public LongSet finishSet() {
        if (scores == null) {
            return LongSets.EMPTY_SET;
        }

        LongSet set = new LongOpenHashSet(scores.size());
        for (ScoredId id: finish()) {
            set.add(id.getId());
        }
        return set;
    }
View Full Code Here
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
    }

    private class ItemScanner implements Supplier<LongSet> {
        @Override
        public LongSet get() {
            LongSet items = new LongOpenHashSet();
            Cursor<Event> events = eventDAO.streamEvents();
            try {
                for (Event e: events) {
                    items.add(e.getItemId());
                }
            } finally {
                events.close();
            }
            return items;
View Full Code Here
188
189
190
191
192
193
194
195
196
197
198
199
200
    @Override
    public LongSet finishSet() {
        assert size == heap.size();

        LongSet longs = new LongOpenHashSet(size);
        while (!heap.isEmpty()) {
            longs.add(items.get(heap.dequeue()));
        }
        clear();

        return longs;
    }
View Full Code Here
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
    }

    private class UserScanner implements Supplier<LongSet> {
        @Override
        public LongSet get() {
            LongSet us = new LongOpenHashSet();
            Cursor<Event> events = eventDAO.streamEvents();
            try {
                for (Event e: events) {
                    us.add(e.getUserId());
                }
            } finally {
                events.close();
            }
            return us;
View Full Code Here
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
    public void testItemItemRecommender4() {
        List<ScoredId> recs = recommender.recommend(5, -1, null, null);
        assertThat(Lists.transform(recs, ScoredIds.idFunction()),
                   containsInAnyOrder(6L, 7L, 9L));

        LongOpenHashSet candidates = new LongOpenHashSet();
        candidates.add(6);
        candidates.add(7);
        candidates.add(8);
        candidates.add(9);
        recs = recommender.recommend(5, -1, candidates, null);
        assertThat(Lists.transform(recs, ScoredIds.idFunction()),
                   containsInAnyOrder(6L, 7L, 9L));

        candidates.remove(6);
        recs = recommender.recommend(5, -1, candidates, null);
        assertThat(Lists.transform(recs, ScoredIds.idFunction()),
                   containsInAnyOrder(7L, 9L));

        candidates.remove(7);
        recs = recommender.recommend(5, -1, candidates, null);
        assertThat(Lists.transform(recs, ScoredIds.idFunction()),
                   containsInAnyOrder(9L));

        candidates.remove(9);
        recs = recommender.recommend(5, -1, candidates, null);
        assertThat(recs, hasSize(0));

        candidates.add(9);
        candidates.add(7);
        recs = recommender.recommend(5, 1, candidates, null);
        assertThat(Lists.transform(recs, ScoredIds.idFunction()),
                   anyOf(contains(9L), contains(7L)));

        LongOpenHashSet exclude = new LongOpenHashSet();
        exclude.add(7);
        recs = recommender.recommend(5, 2, candidates, exclude);
        assertThat(Lists.transform(recs, ScoredIds.idFunction()),
                   containsInAnyOrder(9L));

        recs = recommender.recommend(5, 0, candidates, null);
        assertThat(recs, hasSize(0));

        candidates.clear();
        candidates.add(7);
        candidates.add(9);
        recs = recommender.recommend(5, -1, candidates, null);
        assertThat(Lists.transform(recs, ScoredIds.idFunction()),
                   containsInAnyOrder(7L, 9L));

        candidates.add(6);
        exclude.clear();
        exclude.add(9);
        recs = recommender.recommend(5, -1, candidates, exclude);
        assertThat(Lists.transform(recs, ScoredIds.idFunction()),
                   containsInAnyOrder(6L, 7L));

        exclude.add(7);
        recs = recommender.recommend(5, -1, candidates, exclude);
        assertThat(Lists.transform(recs, ScoredIds.idFunction()),
                   containsInAnyOrder(6L));

        exclude.add(6);
        recs = recommender.recommend(5, -1, candidates, exclude);
        assertThat(recs, hasSize(0));
    }
View Full Code Here
52
53
54
55
56
57
58
59
60
61
62
63
64
     */
    private Vectors() {}

    @SuppressWarnings({"rawtypes", "unchecked"})
    public static MutableSparseVector fromScoredIds(List<ScoredId> scores) {
        LongSet ids = new LongOpenHashSet();
        for (ScoredId sid: scores) {
            ids.add(sid.getId());
        }
        MutableSparseVector vec = MutableSparseVector.create(ids);
        for (ScoredId sid: scores) {
            long id = sid.getId();
            if (!vec.containsKey(id)) {
View Full Code Here
241
242
243
244
245
246
247
248
249
250
251
        List<Rating> ratings = getEventsForItem(item, Rating.class);
        if (ratings == null) {
            return null;
        }

        LongSet users = new LongOpenHashSet(ratings.size());
        for (Rating rating: ratings) {
            users.add(rating.getUserId());
        }
        return users;
    }
View Full Code Here
124
125
126
127
128
129
130
131
132
133
134
        List<Event> events = getEventsForItem(item);
        if (events == null) {
            return null;
        }

        LongSet users = new LongOpenHashSet();
        for (Event evt: events) {
            users.add(evt.getUserId());
        }
        return users;
    }
View Full Code Here
TOP

Related Classes of it.unimi.dsi.fastutil.longs.LongOpenHashSet

  • cc.twittertools.index.IndexStatuses
  • cc.twittertools.util.ExtractSubcollection
  • cc.twittertools.util.VerifySubcollection
  • com.browseengine.bobo.zoie.UIDFacetHandler
  • com.opengamma.engine.cache.AbstractIdentifierMap
  • com.opengamma.engine.cache.BerkeleyDBValueIdentifierMapTest
  • com.senseidb.search.facet.UIDFacetHandler
  • com.senseidb.search.relevance.impl.CompilationHelper
  • com.senseidb.search.relevance.impl.MFacetLong
  • com.senseidb.search.req.mapred.functions.DistinctCountMapReduce
    • 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.