【lab2】scanner读文件

最新推荐文章于 2023-08-31 08:30:24 发布

Pin_BOY

最新推荐文章于 2023-08-31 08:30:24 发布

阅读量98

点赞数

分类专栏：软构文章标签： java

本文链接：https://blog.csdn.net/Pin_BOY/article/details/117753645

版权

软构专栏收录该内容

22 篇文章 0 订阅

订阅专栏

    public GraphPoet(File corpus) throws IOException {
        try {
            File file = new File("assets/test.txt");
            Scanner scanner = new Scanner(corpus);
            scanner.useDelimiter("\\s+");
            String preWord = null;
            String thisWord;
            int i=0;
            while (scanner.hasNext()) {
                thisWord = scanner.next();

                graph.add(thisWord.toLowerCase());

                    if(i>0){
                        //不存在边，加入
                        int lastEdgeWeight = this.graph.set(preWord.toLowerCase(), thisWord.toLowerCase(), 1);
                        //如果边已经存在了，weight++
                        if (lastEdgeWeight != 0)
                            this.graph.set(preWord.toLowerCase(), thisWord.toLowerCase(), lastEdgeWeight + 1);
                    }
                i=1;
                preWord=thisWord;

                System.out.println();

            }

            scanner.close();

        } catch (Exception e) {
            throw new      IOException("File Not Readable or Not Found");

        }

    public GraphPoet(File corpus) throws IOException {

        //读文件
        try{
            BufferedReader reader=new BufferedReader(new FileReader(corpus));
            BufferedReader bReader = new BufferedReader(reader);
            String line;
            List<String> words=new ArrayList<>();
            while ((line = bReader.readLine()) != null) {
                //单词小写加入图
                words.clear();
                words.addAll(Arrays.asList(line.split("\\s+")));
                int num=words.size();
                for(int i=0;i<num;i++){
                    graph.add(words.get(i).toLowerCase());
                    if(i>0){
                        //不存在边，加入
                        int lastEdgeWeight = this.graph.set(words.get(i-1).toLowerCase(), words.get(i).toLowerCase(), 1);
                        //如果边已经存在了，weight++
                        if (lastEdgeWeight != 0)
                            this.graph.set(words.get(i-1).toLowerCase(), words.get(i).toLowerCase(), lastEdgeWeight + 1);
                    }
                }

            }
            bReader.close();
            checkRep();

        }catch (Exception e){
            throw new IOException("File Not Readable or Not Found");
        }
        //throw new RuntimeException("not implemented");
    }
    ```