#!/usr/bin/perl

use strict;
use warnings;

use Sort::Naturally qw(nsort);

# This program reads an abstract sentence file and produces
# output with the following format ...

if ($#ARGV != 1) {
    print "usage: $0 <inputfile> <outputfile>\n";
}

my $inputfile1 = $ARGV[0];
my $outputfile = $ARGV[1];

my %hashunique;

open RF, "<", $inputfile1 or die "Can't open $inputfile1: $!";

local $/ = '';  # blank line, paragraph break

while (<RF>) {
    my @lines = split /\n/, $_;
  # my ($indexofdashinarray) = grep { $lines[$_] =~ /\-\-/ } 0..$#lines;

    for my $i (1..$#lines) {
        next if $lines[$i] eq '--';
        while ($lines[$i] =~ m/(?:\b)D\*(.*?)\*(.*?)\*D(?:\b)/g) {
            $hashunique{"D$1"}{$2} = undef;
        }
    }
}

close RF;

# Results.

open WF, ">", $outputfile or die "Can't open $outputfile: $!";

foreach my $k (nsort keys %hashunique) {
    $hashunique{$k} = join '|', sort(keys %{$hashunique{$k}});
    print WF "$k=>$hashunique{$k}\n";
}

close WF;