zoukankan      html  css  js  c++  java
  • Java8 新API读取文件内容

    import java.io.IOException;
    import java.nio.charset.Charset;
    import java.nio.file.Files;
    import java.nio.file.Paths;
    import java.util.Arrays;
    import java.util.List;
    import java.util.stream.Collectors;
    import java.util.stream.Stream;

    /**
    * Java8 新API读取文件内容
    *
    * Created by wangyingjie1 on 2017/2/22.
    */
    public class ReadFile {

    public static void main(String[] args) {

    try {

    String fileName = "D:\SrcCode\Java8InAction\src\main\resources\lambdasinaction\chap5\data.txt";

    //读取文件
    Stream<String> stringStream = Files
    .lines(Paths.get(fileName), Charset.defaultCharset())
    .flatMap(line -> Arrays.stream(line.split(" ")));

    List<String> words = stringStream.collect(Collectors.toList());
    System.out.println("words===>" + words);


    List<String> lineLists = Files
    .lines(Paths.get(fileName), Charset.defaultCharset())
    .flatMap(line -> Arrays.stream(line.split(" ")))
    .collect(Collectors.toList());

    //输出文件函数
    System.out.println("lineLists====" + lineLists.size());

    //输出每一行文件内容
    lineLists.stream().forEach(System.out::println);

    //统计单词的个数
    long uniqueWords = Files.lines(Paths.get(fileName), Charset.defaultCharset())
    .flatMap(line -> Arrays.stream(line.split(" ")))
    .distinct()
    .count();

    System.out.println("There are " + uniqueWords + " unique words in data.txt");

    } catch (IOException e) {
    e.printStackTrace();
    }
    }


    }

  • 相关阅读:
    最小费用最大流
    bzoj1070[SCOI2007]修车
    bzoj1877[SDOI2009]晨跑
    bzoj2879[NOI2012]美食节
    bzoj1834[ZJOI2010]网络扩容
    Tic-Tac-Toe-(暴力模拟)
    javascript慕课入门
    hdu2586-How far away ?-(最近公共祖先-Tarjan离线算法)
    CSS初识盒子
    CF1047C-Enlarge GCD-(欧拉筛+gcd+唯一分解定理)
  • 原文地址:https://www.cnblogs.com/huangwentian/p/10423586.html
Copyright © 2011-2022 走看看