Τη Τρίτη, 22 Ιανουαρίου 2013 7:24:26 μ.μ. UTC+2, ο χρήστης Leonard, Arah έγραψε:
> > No need, to turn the number back to a path anymore, just the path to a
> > number, to identify the specific .html page
>
> >
>
> > Can this be done?
>
>
>
> Guaranteed to be unique? Not even remotely possible. Even with a lookup
> table approach (which defeats your purpose of not storing the path) with 4
> digits you're looking at a maximum 10000 unique file paths before your system
> duplicates numbers. And that's the best-case scenario. Anything else would
> be worse.
>
>
>
> Not guaranteed to be unique? Easy. Just take then previously given example
> of pin = int( htmlpage.encode("hex"), 16 ) and mod it to your limit, to make:
>
> pin = int( htmlpage.encode("hex"), 16 ) % 10000
>
> It'll give you your number, but there are no guarantees of uniqueness.
> You're looking at more blind random luck using that.
==============================================
pin = int( htmlpage.encode("hex"), 16 ) % 10000
==============================================
Can you please explain the differences to what you have posted opposed to this
perl coding?
==============================================
foreach my $ltr(@ltrs){
$hash = ( $hash + ord($ltr)) %10000;
==============================================
I want to understand this and see it implemented in Python.
--
http://mail.python.org/mailman/listinfo/python-list
