zoukankan      html  css  js  c++  java
  • Stream系列(六)Match方法使用

    #java##stream##match#

    条件比配

    视频讲解:https://www.bilibili.com/video/av77403655/

    EmployeeTestCase.java
    package com.example.demo;
    
    import lombok.Data;
    import lombok.ToString;
    import lombok.extern.log4j.Log4j2;
    import org.junit.Test;
    
    import java.util.Collection;
    import java.util.Comparator;
    import java.util.List;
    import java.util.stream.Collectors;
    import java.util.stream.LongStream;
    import java.util.stream.Stream;
    
    import static org.junit.Assert.assertEquals;
    import static org.junit.Assert.assertTrue;
    
    @Log4j2
    public class EmployeeTestCase extends BaseTest{
        @Test
        public void match() {
            //列表中所有元素都比配我们的条件
            boolean isAllMatch = list.stream().allMatch(e -> e.getSalary() >=1000);
            assertTrue(isAllMatch);
            //列表中任一元素比配我们的条件
            boolean isManyMatch = list.stream().anyMatch(e -> e.getSalary() ==1500);
            assertTrue(isManyMatch);
            //列表中没有一个元素比配我们的条件
            boolean isNoneMatch2 = list.stream().noneMatch(e -> e.getSalary() > 3000);
            assertTrue(isNoneMatch2);
        }
    
    }
    BaseTest.java
    package com.example.demo;
    
    import java.util.Arrays;
    import java.util.List;
    
    public class BaseTest {
        protected static final List<Employee> list = Arrays.asList(
                new Employee(1, "Alex", 1000),
                new Employee(2, "Michael", 2000),
                new Employee(3, "Jack", 1500),
                new Employee(4, "Owen", 1500),
                new Employee(5, "Denny", 2000));
    
        protected static final List<List<Employee>> listFlat = Arrays.asList(
                Arrays.asList(new Employee(1, "Alex", 1000),
                        new Employee(2, "Michael", 2000)),
                Arrays.asList(new Employee(3, "Jack", 1500),
                        new Employee(4, "Owen", 1500)),
                Arrays.asList(new Employee(5, "Denny", 2000)));
    }

    关注公众号,坚持每天3分钟学习

  • 相关阅读:
    BZOJ 4726: [POI2017]Sabota? 树形dp
    Codeforces Round #381 (Div. 1) B. Alyona and a tree dfs序 二分 前缀和
    uestc_retarded 模板
    CROC 2016
    Codeforces Round #381 (Div. 1) A. Alyona and mex 构造
    BZOJ 2648: SJY摆棋子 kdtree
    BZOJ 3732: Network 最小生成树 倍增
    HDU 5914 Triangle 数学找规律
    HDU 5902 GCD is Funny 数学
    Codeforces Round #379 (Div. 2) E. Anton and Tree 缩点 直径
  • 原文地址:https://www.cnblogs.com/JavaWeiBianCheng/p/11957072.html
Copyright © 2011-2022 走看看