Perl - "Complex"数据结构

Question

我正在尝试获得一个可行的数据结构，我可以以合理的方式从中提取元素值。一旦数据进入结构，处理数据就有很大的困难。结构的构建方式如下：

sub hopCompare
{
    my %count;
    my %master;
    my $index = 0;
    foreach my $objPath (@latest)    #get Path object out of master array
    {
            my @path = @{$objPath->_getHopList()}; #dereferencing
            my $iter = 0;
            foreach my $hop (@path)
            {
                    ++$count{$hop}->{FREQ};
                    $count{$hop}->{INDEX} = $index;
                    $count{$hop}->{NODE} = $hop;
                    $index++;
            }
            $index = 0;
    }
    foreach my $element( keys %count )
    {
            if (defined($count{$element}->{NODE}))
            {
                    my $curr = $count{$element}->{INDEX};
                    my $freq = $count{$element}->{FREQ};
                    if (($freq > 1) || ($count{$element}->{INDEX} =~ /[0-1]/))
                    {
                            push @{ $master{$curr} }, {$count{$element}->{NODE}, {FREQ => $count{$element}->{FREQ}}};
                    }
                    print "$element = $count{$element}n";
                    print "$element Index = $count{$element}->{INDEX}n";
            }
    }
    print "n Master contains: n" . Dumper (%master);
    if (%master){return %master;} else {die "NO FINAL HOPS MATCHED";}

}

产生此结构：

%主包含：

$VAR1 = '4';
$VAR2 = [
      {
        '1.1.1.2' => {
                              'FREQ' => 2
                            }
      }
    ];
$VAR3 = '1';
$VAR4 = [
      {
        '1.1.1.9' => {
                              'FREQ' => 5
                            }
      },
      {
        '1.1.1.8' => {
                              'FREQ' => 1
                            }
      }
    ];
    {truncated}

虽然理想情况下结构应该看起来像这样，但我在尝试在 sub identifyNode 上提取数据时就更少了：

$VAR1 = {
      '1' => [
               {
                 '1.1.1.9' => {
                                       'FREQ' => 5
                                     }
               },
               {
                 '1.1.5.8' => {
                                       'FREQ' => 1
                                     }
               }
             ],

然后以我正在使用的另一种方法返回数据：

 sub identifyNode
 {
    my %hops = %{$_[0]};
    my $i = 0;
    foreach my $h ( keys %hops )                   #The HOP-INDEX is the key
    {
            print "n$h looks like n" . Dumper ($hops{$h});
            my %host = %{ $hops{$h}[0] };           #Push the first HASH in INDEX to the %host HASH
            foreach my $hip (keys %host)
            {
                            my $corelink = `corelinks $hip`;
                            my ($node) = $corelink =~ /([a-z0-9-]+),[a-z0-9-/]+,$hip/s;
                            print "ntttHostname is $noden";
            }
            $i++;
    }
}

然后生成：

$h looks like
$VAR1 = [
      {
        '1.1.1.2' => {
                              'FREQ' => 2
                            }
      }
    ];
                    Hostname is blabla-bla-a1
$h looks like
$VAR1 = [
      {
        '1.1.1.9' => {
                              'FREQ' => 5
                            }
      },
      {
        '1.1.1.8' => {
                              'FREQ' => 1
                            }
      }
    ];
                    Hostname is somew-some-a1

因此，对于$h中的每个哈希，只有最顶层的主机被评估并返回主机名。这是因为行中的 [0] 告诉它这样做：

my %host = %{ $hops{$h}[0] };

我玩过不同的数据结构，并以多种方式取消引用结构，这是我找到的唯一一个中途之家......

（IP已被混淆，因此在我的示例中不一致）

Answer 1

感谢您的建议，它让我走到了一半。它现在可以工作了（仍然有点复杂！

sub identifyNode
{
    my %hops = %{$_[0]};
    my $i = 0;
    my @fin_nodes;
    my $hindex;
    foreach my $h ( keys %hops )                   #The HOP-INDEX is the key
    {
            $hindex = $h;
            foreach my $e (@{$hops{$h}})       #first part of solution credit Zdim
            {
                    my @host = %{ $e };      #second part of solution
                    my $hip = $host[0];
                    my $corelink = `corelinks $hip`;
                    my ($node) = $corelink =~ /([a-z0-9-]+),[a-z0-9-/]+,$hip/s;
                    print "ntttHostname is $noden";
                    push (@fin_nodes, [$node, $hindex, $e->{$hip}->{FREQ}]);
            }
            $i++;
    }
    return (@fin_nodes);
}

我是否有足够的勇气将数据作为哈希添加到@fin_nodes..嗯