栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 软件开发 > 后端开发 > Java

Java 队列的使用

Java 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

Java 队列的使用

BlockQueue 的核心方法

 

 

 add方法实例,队列大小是3  当add第四个元素时报错

package com.example.starter;

import java.util.concurrent.ArrayBlockingQueue;
import java.util.concurrent.BlockingQueue;


public class BlockingQueueDemo {
  public static void main(String[] args) {
    //List list = null;
    BlockingQueue blockingQueue = new ArrayBlockingQueue<>(3);
    System.out.println(blockingQueue.add("a"));
    System.out.println(blockingQueue.add("b"));
    System.out.println(blockingQueue.add("c"));

    System.out.println(blockingQueue.add("x"));
  }
}

输出

 

 remove,当没有元素可以remove的时候 抛异常

package com.example.starter;

import java.util.concurrent.ArrayBlockingQueue;
import java.util.concurrent.BlockingQueue;


public class BlockingQueueDemo {
  public static void main(String[] args) {
    //List list = null;
    BlockingQueue blockingQueue = new ArrayBlockingQueue<>(3);
    System.out.println(blockingQueue.add("a"));
    System.out.println(blockingQueue.add("b"));
    System.out.println(blockingQueue.add("c"));
    
    System.out.println(blockingQueue.remove());
    System.out.println(blockingQueue.remove());
    System.out.println(blockingQueue.remove());
    System.out.println(blockingQueue.remove());
  }
}

offer,队列满了再次插入报false

package com.example.starter;

import java.util.concurrent.ArrayBlockingQueue;
import java.util.concurrent.BlockingQueue;


public class BlockingQueueDemo {
  public static void main(String[] args) {
    //List list = null;
    BlockingQueue blockingQueue = new ArrayBlockingQueue<>(3);
    System.out.println(blockingQueue.offer("a"));
    System.out.println(blockingQueue.offer("a"));
    System.out.println(blockingQueue.offer("a"));
    System.out.println(blockingQueue.offer("x"));
  }
}

poll方法:没有还回null

package com.example.starter;

import java.util.concurrent.ArrayBlockingQueue;
import java.util.concurrent.BlockingQueue;


public class BlockingQueueDemo {
  public static void main(String[] args) {
    //List list = null;
    BlockingQueue blockingQueue = new ArrayBlockingQueue<>(3);
    System.out.println(blockingQueue.offer("a"));
    System.out.println(blockingQueue.offer("a"));
    System.out.println(blockingQueue.offer("a"));
    //System.out.println(blockingQueue.offer("x"));
    System.out.println(blockingQueue.poll());
    System.out.println(blockingQueue.poll());
    System.out.println(blockingQueue.poll());
    System.out.println(blockingQueue.poll());

  }
}

 结果

 add 和take

package com.example.starter;

import java.util.concurrent.ArrayBlockingQueue;
import java.util.concurrent.BlockingQueue;

public class BlockingQueueDemo {
  public static void main(String[] args) throws InterruptedException {
    BlockingQueue blockingQueue = new ArrayBlockingQueue<>(3);
    blockingQueue.put("a");
    blockingQueue.put("a");
    blockingQueue.put("a");
    blockingQueue.put("x");
    System.out.println("===============================================");
    blockingQueue.take();
    blockingQueue.take();
    blockingQueue.take();
    blockingQueue.take();
  }
}

offer

package com.example.starter;

import java.util.concurrent.ArrayBlockingQueue;
import java.util.concurrent.BlockingQueue;
import java.util.concurrent.TimeUnit;

public class BlockingQueueDemo {
  public static void main(String[] args) throws InterruptedException {
    BlockingQueue blockingQueue = new ArrayBlockingQueue<>(3);
    blockingQueue.offer("a",2, TimeUnit.SECONDS);
    blockingQueue.offer("a",2, TimeUnit.SECONDS);
    blockingQueue.offer("a",2, TimeUnit.SECONDS);
    blockingQueue.offer("a",2, TimeUnit.SECONDS);
    
  }
}

转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/444847.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号