StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
8109545
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2011-11-13T04:11:05.803
FavoriteCount
0
LastActivityDate
2011-11-13T04:11:05.803
LastEditDate
LastEditorUserId
0
OwnerUserId
368630
ParentId
8108654
PostTypeId
2
Score
1
ViewCount
0
LastEditorDisplayName
text
Body
A hash has only a single key and a single value, and each key must be unique. In your original problem you have this: <pre><code>%hash = ( bob => "4.9", gita =>"3.9 , 6,8", diu => "3.0", ); </code></pre> Well, <code>gita</code> can't have two values. Nor, can you have two keys in your hash equal to <code>gita</code>. Thus, you can't use a simple hash to store your values. There are ways around this though by using references. For example, each element in your hash can contain a <a href="http://perldoc.perl.org/perlreftut.html" rel="nofollow">reference to an array</a>. Thus, your data structure can look like this: <pre><code>%hash = ( bob => [(4.9)], gita => [(3.9, 6.8)], diu => [(3.0)], ); </code></pre> The <code>[</code> and <code>]</code> marks a reference to an array. However, this wouldn't really solve your particular problem since you now have to go through each key in the hash, then each element in the array for each key, and sort those. You could create a sorting subroutine, but just because you can say <code>sort</code> doesn't make it efficient. Maybe what you need is an array of arrays. This will get rid of the issue you have with <code>gita</code> having two values, but make sorting a bit easier. Imagine a structure like this: <pre><code>my @array = ( [bob => 4.9], [gita => 3.9], [gita => 6.8], [diu => 3.0], ); </code></pre> Now, we can do a sort on <code>@array</code> depending upon the value of <code>$array[$x]->[1]</code>! All we need is for each element of the array <code>@array</code> is to compare $a->[1] with $b->[1]. Then, if we do a reverse sort on it, the biggest element will be <code>$array[0]</code>. The name is <code>$array[0]->[0]</code> and the element is <code>$array->[0]->[1]</code>. <pre><code>#! /usr/bin/env perl use strict; use warnings; use feature qw(say switch); my @array = ( [bob => 4.9], [gita => 3.9], [gita => 6.8], [diu => 3.0], ); @array = reverse sort mysort @array; say "$array[0]->[0] $array[0]->[1]"; sub mysort { $a->[1] <=> $b->[1]; } </code></pre> And the output is: <pre><code>gita 6.8. </code></pre> You notice that link to <a href="http://perldoc.perl.org/perlreftut.html" rel="nofollow">Perldoc's perllol</a>? I suggest you read it if you've never worked with Perl references before.
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POHow do I find the key associated with the maximum computed value?
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USDavid W.
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.