java - 尝试读取 txt 文件并将其存储到多值 HashMap 内的数组列表中

Question

我有一个文本文件，它看起来像这样:

gui awtui   swingui
swingui runner  extensions
textui  runner  framework
awtui   runner
runner  framework
extensions  framework

它们由制表符分隔

我使用 HashMap 来存储这些内容，其中键是第一行，值是该行中的其余字符，例如键 = gui 值 = atwui swingui

因此，我使用单键、多值 HashMap 来实现此目的，这就是我迄今为止所做的。

import java.util.*;
import java.io.*;

public class PackageAnalyser {

public static void main(String[] args) throws IOException{
    HashMap<String, List<String>> dependencies = new HashMap<String, List<String>>();
        List<String> pack = new ArrayList<String>();    
        try (Scanner in = new Scanner(new File(args[0]))){
            //String line = null;
            while ((in.hasNext() )){
                String [] packs = in.nextLine().split("\t");
                for (int i = 0; i < packs.length; i++){
                    pack.add(packs[i]);
                    Arrays.sort(packs);
                } 
                dependencies.put(packs[0], pack);
                }

            }catch (IOException ex){
                System.err.println(ex);
            } finally {
        }System.out.println(dependencies);
    }
}

经过多次尝试修改代码，这就是我运行它时的输出

`{awtui = [awtui, swingui, runner, swingui, runner, textui, runner, framework, framework], framework=[awtui, swingui, runner, swingui, textui, runner, framework, framework], extensions=[awtui, swingui, runner, swingui, runner, textui, runner, framework, framework]}

我想要的输出是:

{gui = [awtui, swingui], swingui = [runner, extensions], textui =[runner, framework], awtui = [runner], runner = [framework], extensions = [framework]}

如图所示，我正在从文本文件中读取内容，并且我想显示上面的输出所示的内容。请帮忙。

Answer 1

public class PackageAnalyser {

    public static void main(String[] args) throws IOException {
        HashMap<String, SortedSet<String>> dependencies = new HashMap<String, SortedSet<String>>();

        try (Scanner in = new Scanner(new File(args[0]))) {
            while ((in.hasNext())) {
                String[] packs = in.nextLine().split("\\s");
                String key = packs[0];

                SortedSet<String> deps = dependencies.get(key);
                if (deps == null) {
                    deps = new TreeSet<String>();
                    dependencies.put(key, deps);
                }

                for (int i = 1; i < packs.length; i++) {
                    if (!packs[i].equals("")) {
                        deps.add(packs[i]);                 
                    }
                }                
            }

        } catch (IOException ex) {
            System.err.println(ex);
        } finally {
        }
        System.out.println(dependencies);
    }
}

给出 {extensions=[framework], textui=[framework, runner], gui=[awtui, swingui], swingui=[extensions, runner], awtui=[runner], runner=[framework]}

如果要保留插入顺序，可以使用 LinkedHashMap 而不是普通的 HashMap