void setUserVector(String user, float[] vector) { Preconditions.checkArgument(vector.length == features); X.setVector(user, vector); try (AutoLock al = expectedUserIDsLock.autoWriteLock()) { expectedUserIDs.remove(user); } }
/** * @param id ID to remove feature vector for */ void removeVector(String id) { try (AutoLock al = lock.autoWriteLock()) { vectors.remove(id); recentIDs.remove(id); } }
public void setItemVector(String item, float[] vector) { Preconditions.checkArgument(vector.length == features); Y.setVector(item, vector); try (AutoLock al = expectedItemIDsLock.autoWriteLock()) { expectedItemIDs.remove(item); } cachedYTYSolver.setDirty(); }
public void setUserVector(String user, float[] vector) { Preconditions.checkArgument(vector.length == features); X.setVector(user, vector); try (AutoLock al = expectedUserIDsLock.autoWriteLock()) { expectedUserIDs.remove(user); } cachedXTXSolver.setDirty(); }
void setItemVector(String item, float[] vector) { Preconditions.checkArgument(vector.length == features); Y.setVector(item, vector); try (AutoLock al = expectedItemIDsLock.autoWriteLock()) { expectedItemIDs.remove(item); } // Not clear if it's too inefficient to clear and recompute YtY solver every time any bit // of Y changes, but it's the most correct cachedYTYSolver.setDirty(); }
@Override public ImmutableSet<T> newWithout(T element) { if (this.contains(element)) { MutableSet<T> result = UnifiedSet.newSet(this); result.remove(element); return result.toImmutable(); } return this; }
@Override public ImmutableSet<T> newWithout(T element) { if (this.contains(element)) { MutableSet<T> result = UnifiedSet.newSet(this); result.remove(element); return result.toImmutable(); } return this; }
futures.remove(future);
futures.remove(future);
futures.remove(future);
futures.remove(future);
/** * @param id ID to remove feature vector for */ void removeVector(String id) { try (AutoLock al = lock.autoWriteLock()) { vectors.remove(id); recentIDs.remove(id); } }
public void setUserVector(String user, float[] vector) { Preconditions.checkArgument(vector.length == features); X.setVector(user, vector); try (AutoLock al = expectedUserIDsLock.autoWriteLock()) { expectedUserIDs.remove(user); } cachedXTXSolver.setDirty(); }
public void setItemVector(String item, float[] vector) { Preconditions.checkArgument(vector.length == features); Y.setVector(item, vector); try (AutoLock al = expectedItemIDsLock.autoWriteLock()) { expectedItemIDs.remove(item); } cachedYTYSolver.setDirty(); }
@Override public ImmutableSet<T> newWithout(T element) { if (this.contains(element)) { MutableSet<T> result = UnifiedSet.newSet(this); result.remove(element); return result.toImmutable(); } return this; }
futures.remove(future);
futures.remove(future);
dependencies.remove(change); // the iterator result includes the self; we can remove this
dependencies.remove(change); // the iterator result includes the self; we can remove this