Re: Tallying appearance of a unique string from hash keys

If we take %hash as a given and the code is immutable, I think you can get statistics this way.

use English '-no_match_vars';

my %appearances_of;
$appearances_of{$_}++ for map { split /\Q$SUBSCRIPT_SEPARATOR/ }
                              keys %hash;
[download]

Easier than that, however, is to collect the numbers as you're collecting %hash.

        $hash{$1,$3} = "$holder";
# add these lines:
        $appearances_of{$1}++;
        $appearances_of{$3}++;
[download]

Update: Come to think of it, those don't do the same thing at all. Now I'm not sure I answered the question asked in either case.

Comment on Re: Tallying appearance of a unique string from hash keys Select or Download Code

Replies are listed 'Best First'.
Re^2: Tallying appearance of a unique string from hash keys by jack_j (Initiate) on Mar 28, 2009 at 19:24 UTC
Hello, I've discovered that my random hashes based on my above code are not actually random, but are biased based on the original network. What I should do is outlined in my pseudocode, some elements of which I am having trouble with: #read IDs into %edges using match operator /(\S)(\t)(\S)/ and specia +l variables $1, $3 for each ID per line #assign IDs as format $edge{ID1,ID2} #skip edge assignment if ID2,ID1 already exists .. the network needs t +o be undirected such that ID2-ID1 is equivalent to ID1-ID2 and should + therefore not be counted twice #populate hash of unique IDs from %edges #create array of unique IDs from hash of unique IDs .... @uniqIDs, $un +iqIDs[0]=ID1, uniqIDs[1]=ID2 etc .. how do i do this? #initialize degree counter hash (IDs are keys, values are degrees) usi +ng @uniqIDs with foreach #go through %edges and increment %counter for each ID #generate random network with rand(int(scalar(@uniqIDs))), discard ran +dom picks if they already exist or represent undirected equivalent #initialize random network degree counter hash, and then count random +network degrees as before [download] I'm already stuck at how to skip an edge assignment if $2,$1 exists. Then, how can I populate a new hash of unique IDs? Again, the problem of excluding something if it already exists. `my $filename = "edges.txt"; #Set a variable for our file name open(my $fh, "<", $filename) or die "Can't open file $filename."; #Op +en the file edges.txt while (<$fh>) { if ($_ =~ m/(\S+)\t(\S+)/) { #Match the IDs in the fil +e to $1 and $2 $edge{$1,$2}= $holder; #assign IDs as format $edge +{ID1,ID2} close $fh; #Close the file edges.txt my @list = keys %edge; print "@list\n"; #Prints the list of keys, but they are un +i-directional (i.e. repeated for ID1-ID2 and ID2-ID1)` [download] Once I have these steps, I can proceed to counting and using the unique IDs list to create my random networks.	[reply] [d/l] [select]

Replies are listed 'Best First'.

Re^2: Tallying appearance of a unique string from hash keys
by jack_j (Initiate) on Mar 28, 2009 at 19:24 UTC

#read IDs into %edges using match operator /(\S*)(\t)(\S*)/ and specia
+l variables $1, $3 for each ID per line
#assign IDs as format $edge{ID1,ID2}
#skip edge assignment if ID2,ID1 already exists .. the network needs t
+o be undirected such that ID2-ID1 is equivalent to ID1-ID2 and should
+ therefore not be counted twice
#populate hash of unique IDs from %edges
#create array of unique IDs from hash of unique IDs .... @uniqIDs, $un
+iqIDs[0]=ID1, uniqIDs[1]=ID2 etc .. how do i do this?
#initialize degree counter hash (IDs are keys, values are degrees) usi
+ng @uniqIDs with foreach
#go through %edges and increment %counter for each ID
#generate random network with rand(int(scalar(@uniqIDs))), discard ran
+dom picks if they already exist or represent undirected equivalent
#initialize random network degree counter hash, and then count random 
+network degrees as before
[download]

my $filename = "edges.txt";   #Set a variable for our file name
open(my $fh, "<", $filename) or die "Can't open file $filename.";  #Op
+en the file edges.txt
    while (<$fh>) {
      if ($_ =~ m/(\S+)\t(\S+)/) {           #Match the IDs in the fil
+e to $1 and $2
        $edge{$1,$2}= $holder;             #assign IDs as format $edge
+{ID1,ID2}
close $fh;   #Close the file edges.txt
   my @list = keys %edge;
   print "@list\n";          #Prints the list of keys, but they are un
+i-directional (i.e. repeated for ID1-ID2 and ID2-ID1)
[download]

[reply]
[d/l]
[select]