Re: Output hash-table from a function

[Heime <heimeborgia@protonmail.com>]

Sent with Proton Mail secure email.

On Monday, September 23rd, 2024 at 2:46 AM, Yuri Khan <yuri.v.khan@gmail.com> wrote:

> On Sun, 22 Sept 2024 at 18:48, Heime heimeborgia@protonmail.com wrote:
> 
> > I want to write a function xiakos-anctr that taking the hash table xiakos,
> 
> 
> You should really start naming your functions, arguments and variables
> using words rather than random sequences.

They are not random sequences as you say, but that's fine.
 
> > produces another hash-table, with the same keys but the associated value
> > would be 1 (if directory path does not exist) or 0 (if the directory path exists).
> > 
> > (defun xiakos-anctr (fpln)
> > 
> > (if (hash-table-p fpln)
> > 
> > (let ( (anctr (make-hash-table :test 'equal)) )
> > (maphash (lambda (waypt dirpath)
> > (puthash
> > waypt (not (file-directory-p dirpath))
> > anctr))
> > fpln)) ))
> 
> 
> Hint 1: What does your function to return right now?

xiakos-anctr is certainly not returning a hash table, as I wanted
 
> Hint 2: You’ve created a hash table, bound it to a local variable,
> then did a bunch of mutations to that hash table, and then what?

I want to call the function and store the hash table result in a let statement

(let ( (anctr (xiakos-anctr flpn)) )
  (do-this flpn anctr)
  (do-that flpn anctr))