Search Results

Search found 4650 results on 186 pages for 'perfect hash'.

Page 4/186 | < Previous Page | 1 2 3 4 5 6 7 8 9 10 11 12  | Next Page >

• Simple Hash that is always equal between C# and Java

  - by GaiusSensei

  I have a C# WebService and a (Java) Android Application. Is there a SIMPLE hash function that produces the same result between these two languages? The simplest C# hash is a String.GetHashCode(), but I can't replicate it in Java. The simplest Java hash is not simple at all. And I don't know if I can replicate it exactly in C#. In case it's relevant, I'm hashing passwords before sending it across the internet. I'm currently using Encode64, but that's obviously not secure since we can reverse it.

  Read the article

• Comparing large strings in JavaScript with a hash

  - by user4815162342

  I have a form with a textarea that can contain large amounts of content (say, articles for a blog) edited using one of a number of third party rich text editors. I'm trying to implement something like an autosave feature, which should submit the content through ajax if it's changed. However, I have to work around the fact that some of the editors I have as options don't support an "isdirty" flag, or an "onchange" event which I can use to see if the content has changed since the last save. So, as a workaround, what I'd like to do is keep a copy of the content in a variable (let's call it lastSaveContent), as of the last save, and compare it with the current text when the "autosave" function fires (on a timer) to see if it's different. However, I'm worried about how much memory that could take up with very large documents. Would it be more efficient to store some sort of hash in the lastSaveContent variable, instead of the entire string, and then compare the hash values? If so, can you recommend a good javascript library/jquery plugin that implements an appropriate hash for this requirement?

  Read the article

• Reversing a hash function

  - by martani_net

  Hi, I have the following hash function, and I'm trying to get my way to reverse it, so that I can find the key from a hashed value. uint Hash(string s) { uint result = 0; for (int i = 0; i < s.Length; i++) { result = ((result << 5) + result) + s[i]; } return result; } The code is in C# but I assume it is clear. I am aware that for one hashed value, there can be more than one key, but my intent is not to find them all, just one that satisfies the hash function suffices. Any ideas? Thank you.

  Read the article

• Short Python alphanumeric hash with minimal collisions

  - by ensnare

  I'd like to set non-integer primary keys for a table using some kind of hash function. md5() seems to be kind of long (32-characters). What are some alternative hash functions that perhaps use every letter in the alphabet as well as integers that are perhaps shorter in string length and have low collision rates? Thanks!

  Read the article

• Print Current Mercurial Revision Hash?

  - by rentzsch

  Is there a better way extract the current revision hash in Mercurial than hg log -l1|grep changeset|cut -d: -f3 ? Part of my webapp deployment script "tags" the uploaded app tarball with its unique revision hash.

  Read the article

• Sorting a 2-D hash in reverse order

  - by Shreyas Satish

  I have a 2-d hash.I need to sort each sub-hash by value in descending order. hsh={"a"={0=1, 1=2}} output= {"a"={1=2,0=1}} Thanks & Cheers !

  Read the article

• PHP - Generate an 8 character hash from an integer

  - by doc

  Is there a way to take any number, from say, 1 to 40000 and generate an 8 character hash? I was thinking of using base_convert but couldn't figure out a way to force it to be an 8 character hash. Any help would be appreciated! Thanks.

  Read the article

• Hadoop's Map-side join implements Hash join?

  - by ge0rgi0

  I try to implement Hash join in Hadoop. However, Hadoop seems to have already a map-side join and a reduce - side join already implemented. What is the difference between these techniques and hash join?

  Read the article

• turn a ruby hash into html list

  - by JAlberto

  I'm trying to parse a yaml file like this: a: a1: a2: b: b1: b11: b2: i get a hash like this: {"a"=>{"a1"=>nil, "a2"=>nil}, "b"=>{"b1"=>{"b11"=>nil}, "b2"=>nil}} and i want to turn it to a list: %ul %li a %ul %li a1 %li a2 %li b %ul %li b1 %ul %li b11 %li b2 I'm trying to search the most efficent way doesn't matter how deep is the hash

  Read the article

• How can I hash passwords in postgresql?

  - by Tchalvak

  I need to hash some passwords with salt on postgresql, and I haven't been able to find any relevant documentation on how to get that done. So how can I hash passwords (with some salts) in postgresql?

  Read the article

• Return hash with modified values in Ruby

  - by smotchkkiss

  I'm trying this: {:id => 5, :foos => [1,2,3]}.each {|k,v| v.to_s} But that's returning this: {:id=>5, :foos=>[1, 2, 3]} I'd like to see this: {:id=>"5", :foos=>"[1, 2, 3]"} I've also tried variations of Hash#collect and Hash#map. Any ideas?

  Read the article

• how .hash string method work ?

  - by mgpyone

  I'm just a newbie to ruby. I've seen a string method (String).hash . For example, in irb, I've tried >> "mgpyone".hash returns => 144611910 how does this method works ?

  Read the article

• Ruby Inserting Key, Value elements in Hash.

  - by kokogyi

  I want to add elements to my Hash lists, which can have more than one value. Here is my code. I don't know how I can solve it! class dictionary def initialize(publisher) @publisher=publisher @list=Hash.new() end def []=(key,value) @list << key unless @list.has_key?(key) @list[key] = value end end dic = Dictionary.new dic["tall"] = ["long", "word-2", "word-3"] p dic Many thanks in advance. regards, koko

  Read the article

• dereferencing hash from params

  - by k0re

  Hi, This code works: my $href = shift @_; # get reference to hash my %h = %{$href}; # dereference hash This one does not: my %h = %{shift @_}; As well as this one: my %h = ${$_[0]} Why?

  Read the article

• Creating a unique URL safe hash

  - by Ben Foster

  I want to hash/encode a unique integer (database ID) to create a similarly unique string. It needs to meet the following requirements: Must start with a letter or number, and can contain only letters and numbers. All letters in a container name must be lowercase. Must be from 3 through 63 characters long (although the shorter the better) The result does not need to be reversible, just repeatable - so a 1-way hash would be fine.

  Read the article

• Perl: is there a simple way to validate a hash of hash element exist and defined?

  - by WL

  I need to validate a Perl hash of hash element such as $Table{$key1}{$key2} exist and defined. Here is what i do. (i have no idea key1 even exist) if ((defined $Table{$key1}) && (exists $Table{$key1}) && (defined $Table{$key1}{$key2}) && (exists $Table{$key1}{$key2})) { #do whatever } Is there an easier and cleaner way to do it?

  Read the article

• Perl, time efficient hash

  - by Mike

  Is it possible to use a Perl hash in a manner that has O(log(n)) lookup and insertion? By default, I assume the lookup is O(n) since it's represented by an unsorted list. I know I could create a data structure to satisfy this (ie, a tree, etc) however, it would be nicer if it was built in and could be used as a normal hash (ie, with %)

  Read the article

• mootools hash() in jquery?

  - by terrani

  Hi, I have been using mootools for a year now. I need to use jquery for my new projects. I always used hash() to make namespaces for my functions in mootools. For example, var person = new Hash({ say_name: function(){ }, say_age: function(){ } }); Does Jquery has similar stuff?

  Read the article

• Looking for a fast hash-function.

  - by Julian

  Hello, I'm looking for a special hash-function. Let's say I have a large list of strings, if I order them by their hash-values they should be ordered quasi randomly. The most important point is: it must be super fast. I've tried md5 and sha1 and they're using to much cpu power. Clashes are not a problem. I'm using javascript, so it shouldn't be too complicated to implement.

  Read the article

• Is there a simple way to validate a hash of hash element exist and defined?

  - by WL

  I need to validate a Perl hash of hash element such as $Table{$key1}{$key2} exist and defined. Here is what i do. (i have no idea key1 even exist) if ((defined $Table{$key1}) && (exists $Table{$key1}) && (defined $Table{$key1}{$key2}) && (exists $Table{$key1}{$key2})) { #do whatever } Is there an easier and cleaner way to do it?

  Read the article

• Question : Perl map - need to map a array into a hash as arrayelement->array_index

  - by TGV

  Hi folks. I have a array like this: my @arr = ("Field3","Field1","Field2","Field5","Field4"); Now i use map like below , where /DOSOMETHING/ is the answer am seeking. my %hash = map {$_ => **/DOSOMETHING/** } @arr Now I require the hash to look like below: Field3 = 0 Field1 = 1 Field2 = 2 Field5 = 3 Field4 = 4 Any help?

  Read the article

• Defining the hash of an object as the sum of hashes of its members

  - by Space_C0wb0y

  I have a class that represents undirected edges in a graph. Every edge has two members vertex1 and vertex2 representing the vertices it connects. The problem is, that an edge can be specified two directions. My idea was now to define the hash of an edge as the sum of the hashes of its vertices. This way, the direction plays no role anymore, the hash would be the same. Are there any pitfalls with that?

  Read the article

• Is there a simple way to validate a hash of hash element exists and is defined?

  - by WL

  I need to validate a Perl hash of hash element such as $Table{$key1}{$key2} exist and defined. Here is what i do. (i have no idea key1 even exist) if ((defined $Table{$key1}) && (exists $Table{$key1}) && (defined $Table{$key1}{$key2}) && (exists $Table{$key1}{$key2})) { #do whatever } Is there an easier and cleaner way to do it?

  Read the article

• Filezilla Install Problem: Hash Sum Mismatch

  - by kyleskool

  I'm new to the Ubuntu scene, and I tried to install Filezilla today by going to terminal and typing "sudo apt-get install filezilla", and got this error: Failed to fetch http://us.archive.ubuntu.com/ubuntu/pool/universe/w/wxwidgets2.8/libwxbase2.8-0_2.8.12.1-6ubuntu2_amd64.deb Hash Sum mismatch Failed to fetch http://us.archive.ubuntu.com/ubuntu/pool/universe/w/wxwidgets2.8/libwxgtk2.8-0_2.8.12.1-6ubuntu2_amd64.deb Hash Sum mismatch Failed to fetch http://universe/t/tinyxml/libtinyxml2.6.2_2.6.2-1build1_amd64.deb Hash Sum mismatch Failed to fetch http://universe/f/filezilla/filezilla-common_3.5.3-1ubuntu2_all.deb Hash Sum mismatch Failed to fetch http://universe/f/filezilla/filezilla_3.5.3-1ubuntu2_amd64.deb Hash Sum mismatch E: Unable to fetch some archives, maybe run apt-get update or try with --fix-missing? Running it again with "--fix-missing" appended to the command didn't work, nor did running apt-get update. Any suggestion? Thanks!

  Read the article

• Are programming languages perfect?

  - by mohabitar

  I'm not sure if I'm being naive, as I'm still a student, but a curious question came to my mind. In another thread here, a user stated that in order to protect against piracy of your software, you must have perfect software. So is it possible to have perfect software? This is an extremely silly hypothetical situation, but if you were to gather the most talented and gifted programmers in the world and have them spend years trying to create 'perfect' software, could they be successful? Could it be that not a single exploitable bug could be created? Or are there flaws in programming languages that can still, no matter how hard you try, cause bugs that allow your program to be hijacked? As you can tell, I know nothing about security, but essentially what I'm asking is: is the reason why software is easily exploitable the fact that imperfect human beings create it, or that imperfect programming languages are being used?

  Read the article

< Previous Page | 1 2 3 4 5 6 7 8 9 10 11 12  | Next Page >