Re: Hash tables - how to look up values?

Re: Hash tables - how to look up values?

[Pascal J. Bourguignon]

Thorsten Jolitz <tjolitz@googlemail.com> writes:

> Hi List, 
> I would need a function that does the opposite of 
>
> ,--------------------
> | (gethash key table)
> `--------------------
>
> i.e. something like 
>
> ,-------------------
> | (getkey val table)
> `-------------------
>
> that returns the corresponding key of a known (string) value in a hash
> table (similar to 'rassoc' for alists). 
>
> I could not find such a function - does it exist already?

rassoc returns the first hit, because lists, even association lists are
ordered.  Hash tables are not ordered.  We can write something similar,
returning the first hit, but there's no guarantee the first will always
be the same.


(require 'cl)

(defun* getkey (val table &key (test (function eql)) (default nil))
   ;; (hash-table-test table)  is for keys, not for values…
   (maphash (lambda (k v) 
              (when (funcall test val v) (return-from getkey k)))
            table)
   default)

(let ((h (make-hash-table)))
  (setf (gethash :one h) "un"
        (gethash :two h) "deux"
        (gethash :a   h) "un")
  (getkey "un" h :test (function string=)))
--> :one ; or :a, who knows?

I'd rather write:

(defun* getkeys (val table &key (test (function eql)))
   ;; (hash-table-test table)  is for keys, not for values…
   (let ((keys '()))
     (maphash (lambda (k v) 
                 (when (funcall test val v) (push k keys)))
              table)
     keys))

(let ((h (make-hash-table)))
  (setf (gethash :one h) "un"
        (gethash :two h) "deux"
        (gethash :a   h) "un")
  (getkeys "un" h :test (function string=)))
--> (:a :one)


-- 
__Pascal Bourguignon__                     http://www.informatimago.com/
A bad day in () is better than a good day in {}.

Re: Hash tables - how to look up values?

[Thorsten Jolitz]

"Pascal J. Bourguignon" <pjb@informatimago.com> writes:

>> I could not find such a function - does it exist already?
>
> rassoc returns the first hit, because lists, even association lists are
> ordered.  Hash tables are not ordered.  We can write something similar,
> returning the first hit, but there's no guarantee the first will always
> be the same.
>
>
> (require 'cl)
>
> (defun* getkey (val table &key (test (function eql)) (default nil))
>    ;; (hash-table-test table)  is for keys, not for values…
>    (maphash (lambda (k v) 
>               (when (funcall test val v) (return-from getkey k)))
>             table)
>    default)
>
> (let ((h (make-hash-table)))
>   (setf (gethash :one h) "un"
>         (gethash :two h) "deux"
>         (gethash :a   h) "un")
>   (getkey "un" h :test (function string=)))
> --> :one ; or :a, who knows?
>
> I'd rather write:
>
> (defun* getkeys (val table &key (test (function eql)))
>    ;; (hash-table-test table)  is for keys, not for values…
>    (let ((keys '()))
>      (maphash (lambda (k v) 
>                  (when (funcall test val v) (push k keys)))
>               table)
>      keys))
>
> (let ((h (make-hash-table)))
>   (setf (gethash :one h) "un"
>         (gethash :two h) "deux"
>         (gethash :a   h) "un")
>   (getkeys "un" h :test (function string=)))
> --> (:a :one)

Great! Thats most amazing about Emacs and its community - if you ask for
a functionality that does not yet exists, it might well exist 5 minutes
later just because you asked for it. 

Thanks a lot, exactly what I need. 

-- 
cheers,
Thorsten

Hash tables - how to look up values?

[Thorsten Jolitz]

Hi List, 
I would need a function that does the opposite of 

,--------------------
| (gethash key table)
`--------------------

i.e. something like 

,-------------------
| (getkey val table)
`-------------------

that returns the corresponding key of a known (string) value in a hash
table (similar to 'rassoc' for alists). 

I could not find such a function - does it exist already?

-- 
cheers,
Thorsten

Re: Hash tables - how to look up values?

[Teemu Likonen]

Thorsten Jolitz [2012-07-04 15:48:09 +0200] wrote:

> that returns the corresponding key of a known (string) value in a hash
> table (similar to 'rassoc' for alists).
>
> I could not find such a function - does it exist already?

There is no such thing. You need to traverse the hash table with maphash
and look for your value. This is obviously slower than gethash but this
is how hash tables work.

If you need fast two-way access in your programs you could create your
own access functions which synchronize two hash tables and thus get fast
two-way access.

Re: Hash tables - how to look up values?

[Bastien]

Hi Thorsten,

Thorsten Jolitz <tjolitz@googlemail.com> writes:

> I would need a function that does the opposite of 
>
> ,--------------------
> | (gethash key table)
> `--------------------
>
> i.e. something like 
>
> ,-------------------
> | (getkey val table)
> `-------------------
>
> that returns the corresponding key of a known (string) value in a hash
> table (similar to 'rassoc' for alists). 
>
> I could not find such a function - does it exist already?

I don't think so.  But here is a start:

(let (key-found)
  (maphash (lambda (key val)
	     (when (equal val "my_value")
	       (setq key-found key)))
	   hashtest)
  key-found)

Of course, the shortcoming is that it stops at the first key it finds,
and discards multiple keys if several have the same value.

HTH,

-- 
 Bastien

Re: Hash tables - how to look up values?

[Thorsten Jolitz]

Bastien <bzg@gnu.org> writes:

Hi Bastien,

>> I could not find such a function - does it exist already?
>
> I don't think so.  But here is a start:
>
> (let (key-found)
>   (maphash (lambda (key val)
> 	     (when (equal val "my_value")
> 	       (setq key-found key)))
> 	   hashtest)
>   key-found)
>
> Of course, the shortcoming is that it stops at the first key it finds,
> and discards multiple keys if several have the same value.

Thanks, now I even have the 'agony of choice' (is that how they call it
in English?), but I might very well need both solutions - return the
first or all values found.

-- 
cheers,
Thorsten