Codota Logo
ConcurrentQueueSpec.<init>
Code IndexAdd Codota to your IDE (free)

How to use
org.jctools.queues.spec.ConcurrentQueueSpec
constructor

Best Java code snippets using org.jctools.queues.spec.ConcurrentQueueSpec.<init> (Showing top 18 results out of 315)

  • Add the Codota plugin to your IDE and get smart completions
private void myMethod () {
FileOutputStream f =
  • Codota IconFile file;new FileOutputStream(file)
  • Codota IconString name;new FileOutputStream(name)
  • Codota IconFile file;new FileOutputStream(file, true)
  • Smart code suggestions by Codota
}
origin: JCTools/JCTools

public static ConcurrentQueueSpec createBoundedSpmc(int capacity)
{
  return new ConcurrentQueueSpec(1, 0, capacity, Ordering.FIFO, Preference.NONE);
}
origin: JCTools/JCTools

public static ConcurrentQueueSpec createBoundedMpsc(int capacity)
{
  return new ConcurrentQueueSpec(0, 1, capacity, Ordering.FIFO, Preference.NONE);
}
origin: JCTools/JCTools

public static ConcurrentQueueSpec createBoundedMpmc(int capacity)
{
  return new ConcurrentQueueSpec(0, 0, capacity, Ordering.FIFO, Preference.NONE);
}
origin: JCTools/JCTools

public static ConcurrentQueueSpec createBoundedSpsc(int capacity)
{
  return new ConcurrentQueueSpec(1, 1, capacity, Ordering.FIFO, Preference.NONE);
}
origin: ben-manes/caffeine

public static Object[] makeQueue(int producers, int consumers, int capacity, Ordering ordering,
  Queue<Integer> q) {
 ConcurrentQueueSpec spec =
   new ConcurrentQueueSpec(producers, consumers, capacity, ordering, Preference.NONE);
 if (q == null) {
  q = QueueFactory.newQueue(spec);
 }
 return new Object[] {spec, q};
}
origin: ben-manes/caffeine

public static Object[] makeAtomic(int producers, int consumers, int capacity, Ordering ordering,
  Queue<Integer> q) {
 ConcurrentQueueSpec spec =
   new ConcurrentQueueSpec(producers, consumers, capacity, ordering, Preference.NONE);
 if (q == null) {
  q = AtomicQueueFactory.newQueue(spec);
 }
 return new Object[] {spec, q};
}
origin: JCTools/JCTools

public static Object[] makeAtomic(int producers, int consumers, int capacity, Ordering ordering, Queue<Integer> q)
{
  ConcurrentQueueSpec spec = new ConcurrentQueueSpec(producers, consumers, capacity, ordering,
    Preference.NONE);
  if (q == null)
  {
    q = AtomicQueueFactory.newQueue(spec);
  }
  return new Object[] {spec, q};
}
origin: JCTools/JCTools

public static Object[] makeAtomic(int producers, int consumers, int capacity, Ordering ordering, Queue<Integer> q)
{
  ConcurrentQueueSpec spec = new ConcurrentQueueSpec(producers, consumers, capacity, ordering,
    Preference.NONE);
  if (q == null)
  {
    q = AtomicQueueFactory.newQueue(spec);
  }
  return new Object[] {spec, q};
}
@After
origin: JCTools/JCTools

public static Object[] makeMpq(int producers, int consumers, int capacity, Ordering ordering, Queue<Integer> q)
{
  ConcurrentQueueSpec spec = new ConcurrentQueueSpec(producers, consumers, capacity, ordering,
    Preference.NONE);
  if (q == null)
  {
    q = QueueFactory.newQueue(spec);
  }
  return new Object[] {spec, q};
}
origin: JCTools/JCTools

public static Object[] makeQueue(int producers, int consumers, int capacity, Ordering ordering, Queue<Integer> q)
{
  ConcurrentQueueSpec spec = new ConcurrentQueueSpec(producers, consumers, capacity, ordering,
    Preference.NONE);
  if (q == null)
  {
    q = QueueFactory.newQueue(spec);
  }
  return new Object[] {spec, q};
}
origin: org.jctools/jctools-core

public static ConcurrentQueueSpec createBoundedMpsc(int capacity)
{
  return new ConcurrentQueueSpec(0, 1, capacity, Ordering.FIFO, Preference.NONE);
}
origin: org.jctools/jctools-core

public static ConcurrentQueueSpec createBoundedSpmc(int capacity)
{
  return new ConcurrentQueueSpec(1, 0, capacity, Ordering.FIFO, Preference.NONE);
}
origin: org.jctools/jctools-core

public static ConcurrentQueueSpec createBoundedSpsc(int capacity)
{
  return new ConcurrentQueueSpec(1, 1, capacity, Ordering.FIFO, Preference.NONE);
}
origin: org.jctools/jctools-core

public static ConcurrentQueueSpec createBoundedMpmc(int capacity)
{
  return new ConcurrentQueueSpec(0, 0, capacity, Ordering.FIFO, Preference.NONE);
}
origin: net.sourceforge.teetime/teetime

public UnboundedSynchedPipe(final OutputPort<? extends T> sourcePort, final InputPort<T> targetPort) {
  super(sourcePort, targetPort);
  ConcurrentQueueSpec specification = new ConcurrentQueueSpec(1, 1, 0, Ordering.FIFO, Preference.THROUGHPUT);
  this.queue = QueueFactory.newQueue(specification);
}
origin: net.sourceforge.teetime/teetime

protected AbstractSynchedPipe(final OutputPort<? extends T> sourcePort, final InputPort<T> targetPort) {
  super(sourcePort, targetPort);
  final Queue<ISignal> localSignalQueue = QueueFactory.newQueue(new ConcurrentQueueSpec(1, 1, 0, Ordering.FIFO, Preference.THROUGHPUT));
  final PutStrategy<ISignal> putStrategy = new YieldPutStrategy<ISignal>();
  final TakeStrategy<ISignal> takeStrategy = new SCParkTakeStrategy<ISignal>();
  signalQueue = new PCBlockingQueue<ISignal>(localSignalQueue, putStrategy, takeStrategy);
}
origin: net.sourceforge.teetime/teetime

public static <T> BlockingQueue<T> createPortActionQueue() {
  final Queue<T> localQueue = QueueFactory.newQueue(new ConcurrentQueueSpec(1, 1, 0, Ordering.FIFO, Preference.THROUGHPUT));
  final PutStrategy<T> putStrategy = new YieldPutStrategy<T>();
  final TakeStrategy<T> takeStrategy = new SCParkTakeStrategy<T>();
  PCBlockingQueue<T> portActions = new PCBlockingQueue<T>(localQueue, putStrategy, takeStrategy);
  return portActions;
}
origin: net.sourceforge.teetime/teetime

protected AbstractSynchedPipe(final OutputPort<? extends T> sourcePort, final InputPort<T> targetPort) {
  super(sourcePort, targetPort);
  final Queue<ISignal> localSignalQueue = QueueFactory.newQueue(new ConcurrentQueueSpec(1, 1, 0, Ordering.FIFO, Preference.THROUGHPUT));
  final PutStrategy<ISignal> putStrategy = new YieldPutStrategy<ISignal>();
  final TakeStrategy<ISignal> takeStrategy = new SCParkTakeStrategy<ISignal>();
  signalQueue = new PCBlockingQueue<ISignal>(localSignalQueue, putStrategy, takeStrategy);
}
org.jctools.queues.specConcurrentQueueSpec<init>

Popular methods of ConcurrentQueueSpec

  • isBounded
  • createBoundedMpmc
  • isMpmc
  • isMpsc
  • isSpmc
  • isSpsc
  • createBoundedMpsc
  • createBoundedSpmc
  • createBoundedSpsc

Popular in Java

  • Making http requests using okhttp
  • scheduleAtFixedRate (ScheduledExecutorService)
  • getSharedPreferences (Context)
  • getOriginalFilename (MultipartFile)
    Return the original filename in the client's filesystem.This may contain path information depending
  • BufferedInputStream (java.io)
    Wraps an existing InputStream and buffers the input. Expensive interaction with the underlying input
  • FileWriter (java.io)
    Convenience class for writing character files. The constructors of this class assume that the defaul
  • InetAddress (java.net)
    This class represents an Internet Protocol (IP) address. An IP address is either a 32-bit or 128-bit
  • DecimalFormat (java.text)
    DecimalFormat is a concrete subclass ofNumberFormat that formats decimal numbers. It has a variety o
  • SimpleDateFormat (java.text)
    Formats and parses dates in a locale-sensitive manner. Formatting turns a Date into a String, and pa
  • TreeMap (java.util)
    A Red-Black tree based NavigableMap implementation. The map is sorted according to the Comparable of
Codota Logo
  • Products

    Search for Java codeSearch for JavaScript codeEnterprise
  • IDE Plugins

    IntelliJ IDEAWebStormAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimAtomGoLandRubyMineEmacsJupyter
  • Company

    About UsContact UsCareers
  • Resources

    FAQBlogCodota Academy Plugin user guide Terms of usePrivacy policyJava Code IndexJavascript Code Index
Get Codota for your IDE now