函数式编程-收集器

集合对象收集器

1、toList

 @Test
    public void givenUsers_withMap_thenTransformUsingStream() {
        List<UserDTO> userDTOList = userList.stream().map(user -> UserDTO.builder()
                .username(user.getUsername())
                .enabled(user.isEnabled() ? "可用" : "不可用").build()).collect(Collectors.toList());
        assertEquals(3, userDTOList.size());
    }

2、toSet

 @Test
    public void givenUsers_withToSet_thenSuccess() {
       Set<String> usernames = userList.stream()
               .map(User::getName)
               .collect(toSet());
       assertEquals(2, usernames.size());
    }
    
    @Test
    public void givenUsers_withToCollection_thenSuccess() {
        Comparator<User> byAge = Comparator.comparing(User::getAge);
        TreeSet<User> users = userList.stream()
                .collect(toCollection(() -> new TreeSet<>(byAge)));
        assertEquals(30, users.stream().map(User::getAge).findFirst().orElse(-1));
    }

3、toMap

 @Test
    public void givenUsers_withToMap_thenSuccess() {
        Map<String, User> userMap = userList.stream()
                .collect(toMap(
                        User::getUsername,
                        user -> user
                ));
        assertTrue(userMap.containsKey("lisi"));
        Map<String, User> duplicateMap = Stream.concat(userList.stream(), userList.stream())
                .peek(user -> log.debug("username, {}", user.getUsername()))
                .collect(toMap(
                        User::getUsername,
                        user -> user,
                        (existing, replace) -> existing
                ));
        assertEquals(3, duplicateMap.keySet().size());
        TreeMap<String, User> sortedMap = Stream.concat(userList.stream(), userList.stream())
                .peek(user -> log.debug("username, {}", user.getUsername()))
                .collect(toMap(
                        User::getUsername,
                        user -> user,
                        (existing, replace) -> existing,
                        TreeMap::new
                ));
        assertEquals("lisi", sortedMap.keySet().stream().findFirst().get());
    }
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值