Example usage for java.util.concurrent.atomic AtomicInteger get

Introduction

In this page you can find the example usage for java.util.concurrent.atomic AtomicInteger get.

Prototype

public final int get()

Source Link

Document

Returns the current value, with memory effects as specified by VarHandle#getVolatile .

Usage

From source file:org.jasig.cas.web.support.AbstractInMemoryThrottledSubmissionHandlerInterceptorAdapter.java

@Override
protected final int findCount(final HttpServletRequest request, final String usernameParameter,
        final int failureRangeInSeconds) {
    final AtomicInteger existingValue = this.ipMap.get(constructKey(request, usernameParameter));
    return existingValue == null ? 0 : existingValue.get();
}

From source file:com.ewcms.web.pubsub.ProgressSender.java

private void constructTreeGridRows(StringBuilder builder, AtomicInteger count, int partenId, Taskable task) {
    if (task.getProgress() == -1) {
        return;//from  w w w. ja  v  a2 s. co m
    }

    if (count.get() != 0) {
        builder.append(",");
    }
    int id = count.incrementAndGet();
    builder.append("{");
    builder.append("\"id\":").append(id);
    builder.append(",\"taskId\":\"").append(task.getId()).append("\"");
    builder.append(",\"name\":\"").append(task.getDescription()).append("\"");
    builder.append(",\"username\":\"").append(task.getUsername()).append("\"");
    builder.append(",\"progress\":").append(task.getProgress());
    if (partenId != -1) {
        builder.append(",\"_parentId\":").append(partenId);
    }
    builder.append("}");

    for (Taskable child : task.getDependenceTasks()) {
        constructTreeGridRows(builder, count, id, child);
    }
}

From source file:net.nfpj.webcounter.dm.MemCounterDM.java

@Override
public Counter get(String name) {
    if (name == null || name.isEmpty()) {
        throw new NullPointerException("Name cannot be null");
    }/*from   ww w .  ja  v  a 2 s  . co m*/
    AtomicInteger ai = counters.get(name);
    return (ai == null) ? null : new Counter(name, ai.get());
}

From source file:net.nfpj.webcounter.dm.MemCounterDM.java

@Override
public Counter remove(String name) {
    if (name != null && !name.isEmpty()) {
        AtomicInteger ai = counters.remove(name);
        return ai == null ? null : new Counter(name, ai.get());
    }//from w  ww  .j a v  a 2 s.c  o m
    return null;
}

From source file:net.audumla.scheduler.quartz.SunScheduleTest.java

@Test
public void testSingleRiseOnly() throws Exception {
    AstronomicEvent event = getSunRiseEvent();
    Trigger trigger = AstronomicScheduleBuilder.astronomicalSchedule().startEvent(event)
            .startEventOffset(getOffsetFromEvent(event) + 2).withEventCount(1).build();
    AtomicInteger ai = scheduleJob(trigger, 1, 5);
    assert ai.get() == 0;
    trigger = StdSchedulerFactory.getDefaultScheduler().getTrigger(trigger.getKey());
    if (trigger != null) {
        assert trigger.getNextFireTime() == null;
    }//from   ww  w .j  a  v a  2 s  .co m

}

From source file:net.audumla.scheduler.quartz.SunScheduleTest.java

@Test
public void testEveryRise() throws Exception {
    AstronomicEvent event = getSunRiseEvent();
    long offset = getOffsetFromEvent(event) + 1;
    Trigger trigger = AstronomicScheduleBuilder.astronomicalSchedule().startEvent(event)
            .startEventOffset(offset).forEveryEvent().build();
    AtomicInteger ai = scheduleJob(trigger, 1, 5);
    assert ai.get() == 0;
    Assert.assertEquals(/*from w  ww.j  av  a  2  s. c  o m*/
            StdSchedulerFactory.getDefaultScheduler().getTrigger(trigger.getKey()).getNextFireTime().getTime(),
            event.getNextEvent().getCalculatedEventTime().getTime() + (offset * 1000), 100);

}

From source file:fr.landel.utils.assertor.utils.AssertorMap.java

private static <M extends Map<K, V>, K, V, T> boolean hasInOrder(final M map, final Iterable<T> objects,
        final boolean not, final EnumAnalysisMode analysisMode,
        final BiPredicate<Entry<K, V>, T> entriesEqualChecker, final Class<T> objectsClass) {

    int found = 0;

    final int size1 = map.size();
    final int size2 = IterableUtils.size(objects);

    if (size1 < size2) {
        return not;
    }//from w  w  w  .  j  a  v a 2 s . co  m

    final Set<Entry<K, V>> entries1 = map.entrySet();
    final List<T> entries2 = IterableUtils.toList(objects);

    if (EnumAnalysisMode.STANDARD.equals(analysisMode)) {
        for (Entry<K, V> entry1 : entries1) {
            if (found < size2) {
                if (entriesEqualChecker.test(entry1, entries2.get(found))) {
                    ++found;
                } else if (found > 0) {
                    found = 0;
                }
            }
        }
    } else {
        final AtomicInteger count = new AtomicInteger(0);

        final Stream<Entry<K, V>> stream;
        if (EnumAnalysisMode.PARALLEL.equals(analysisMode)) {
            stream = entries1.parallelStream();
        } else {
            stream = entries1.stream();
        }

        stream.forEachOrdered(o -> {
            int inc = count.get();
            if (inc < size2) {
                if (entriesEqualChecker.test(o, entries2.get(inc))) {
                    count.incrementAndGet();
                } else if (inc > 0) {
                    count.set(0);
                }
            }
        });

        found = count.get();
    }

    return not ^ (found == size2);
}

From source file:com.appleframework.monitor.service.AlertService.java

protected boolean isNeedNotify(Alert alert) {
    if (alert == null)
        return false;
    String key = alert.getProjectName() + "_" + alert.getTitle();

    AtomicInteger init = new AtomicInteger(0);
    AtomicInteger times = notifyTimes.putIfAbsent(key, init);
    if (times == null)
        times = init;//from w  ww . j a v a  2  s .c  o m
    logger.debug("{} notify times ={}", key, times.get());
    return times.getAndIncrement() < limitTimes;
}

From source file:com.pepaproch.gtswsdl.client.RateLimitTest.java

private synchronized void addTask(AtomicInteger cc, ScheduledExecutorService schelduler, RateLimit rate,
        Instant[] end) {/* w ww.jav a2 s  .  c om*/

    Callable<Integer> callable = (Callable<Integer>) () -> {

        return cc.get();
    };
    ListenableFutureTask request = new ListenableFutureTask(callable);

    schelduler.schedule(() -> {
        FutureTask<?> schelduledTask = request;
        if (!request.isCancelled() && !request.isDone()) {
            schelduledTask.run();
        }

    }, rate.consumeSlot(), TimeUnit.MILLISECONDS);

    request.addCallback(new ListenableFutureCallback<Integer>() {

        @Override
        public void onSuccess(Integer result) {
            cc.incrementAndGet();
            end[0] = Instant.now();
            System.out.println("FINISHEDLISTENBALE: " + result + end[0].toString());
        }

        @Override
        public void onFailure(Throwable ex) {
            System.out.println("FAILURE");
        }
    });

}

From source file:de.tudarmstadt.ukp.dkpro.core.norvig.NorvigSpellingAlgorithm.java

/**
 * Consider the given candidate. If it is better than a previously found candidate, then
 * remember it, otherwise forget it.//from  w w w.j  av a  2 s .  c  o m
 *
 * @param candidate
 *            the candidate to consider.
 */
protected void consider(String candidate) {
    AtomicInteger score = nWords.get(candidate);
    if (score != null) {
        if (score.get() > bestScore) {
            bestScore = score.get();
            bestCandidate = candidate;
        }
    }
}