node.getKeyReference(), instanceOf(WeakKeyReference.class)); } else { desc.expectThat("not null key", key, is(not(nullValue()))); desc.expectThat("found wrong node", cache.data.get(node.getKeyReference()), is(node));
prior = data.computeIfAbsent(node.getKeyReference(), k -> { writer.write(key, value); return computed; prior = data.putIfAbsent(node.getKeyReference(), node); if (prior == null) { afterWrite(new AddTask(node, newWeight));
RemovalCause[] cause = new RemovalCause[1]; data.computeIfPresent(node.getKeyReference(), (k, n) -> { if (n != node) { return n;
RemovalCause[] actualCause = new RemovalCause[1]; data.computeIfPresent(node.getKeyReference(), (k, n) -> { if (n != node) { return n;
prior = data.computeIfAbsent(node.getKeyReference(), k -> { writer.write(key, value); return computed; prior = data.putIfAbsent(node.getKeyReference(), node); if (prior == null) { afterWrite(new AddTask(node, newWeight));
RemovalCause[] cause = new RemovalCause[1]; data.computeIfPresent(node.getKeyReference(), (k, n) -> { if (n != node) { return n;
RemovalCause[] actualCause = new RemovalCause[1]; data.computeIfPresent(node.getKeyReference(), (k, n) -> { if (n != node) { return n;