Re: [racket-users] How to require untrusted module?
Yes, ou can use `dynamic-require` with a limited code inspector like this: (parameterize ([current-code-inspector (make-inspector)]) (dynamic-require 'untrusted-foo 'foo-provided-name)) At Fri, 22 Oct 2021 12:42:58 -0700 (PDT), "kalime...@gmail.com" wrote: > Thank you! > > Is it possible to safely load untrusted module with dynamic-require? > > пятница, 22 октября 2021 г. в 22:59:57 UTC+5, Robby Findler: > > > On Fri, Oct 22, 2021 at 12:43 PM Matthew Flatt wrote: > > > >> At Thu, 21 Oct 2021 07:37:12 -0700 (PDT), "kalime...@gmail.com" wrote: > >> > I've read about protect-out and current-code-inspector, but I still > >> cannot > >> > understand, how to require a module and forbid it to run protected > >> modules. > >> > > >> > Something like (require untrusted-foo) (foo-proc) but to forbid > >> foo-proc to > >> > use ffi/unsafe. > >> > >> If you use > >> > >> (current-code-inspector (make-inspector)) > >> (require untrusted-foo) > >> > >> > > Just in case: I think Matthew as thinking of two subsequent REPL > > interactions (or calls to eval or suchlike). If you put those two together > > into a file in #lang racket, say, you won't be protected against > > untrusted-foo. > > > > Robby > > > > > >> and assuming that `untrusted-foo` hasn't been loaded earlier, then > >> `untrusted-foo` will not be able to use protected binding. > >> > >> That sequence will also disable the use of protected bindings by > >> anything that `untrusted-foo` depends on and that hasn't already been > >> loaded. So, if you want those dependencies to be able to use untrusted > >> things, you need to load the before `(current-code-inspector > >> (make-inspector))`. > >> > >> -- > >> You received this message because you are subscribed to the Google Groups > >> "Racket Users" group. > >> To unsubscribe from this group and stop receiving emails from it, send an > >> email to racket-users...@googlegroups.com. > >> > > To view this discussion on the web visit > >> > https://groups.google.com/d/msgid/racket-users/20211022114302.3e4%40sirmail.smtp > s.cs.utah.edu > >> . > >> > > > > -- > You received this message because you are subscribed to the Google Groups > "Racket Users" group. > To unsubscribe from this group and stop receiving emails from it, send an > email > to racket-users+unsubscr...@googlegroups.com. > To view this discussion on the web visit > https://groups.google.com/d/msgid/racket-users/004de0e0-b25f-4bae-be79-9bdd561a1 > e18n%40googlegroups.com. -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/racket-users/20211023102301.11%40sirmail.smtps.cs.utah.edu.
Re: [racket-users] hash->list with try-order? (like hash-map)
On Friday, October 22, 2021 at 6:45:18 PM UTC+2 david@gmail.com wrote: > On Thu, Oct 21, 2021 at 5:26 AM George Neuner wrote: > >> >> On 10/20/2021 5:53 PM, unlimitedscolobb wrote: >> >> >> > You can get a lot of mileage out of the 'set' datatype, which removes > ordering from the equation, especially since lists will act as sets in a > pinch. (When you want to improve performance, use 'in-set' and/or > 'list->set'. > > To see if 2 hashes contain the same set of keys: >> >> (and (= (hash-count hash1) (hash-count hash2)) >> (for/and ([k (in-list (hash-keys hash1))]) >>(hash-has-key? hash2 k))) >> > > Alternatively: > > (set=? (hash-keys hash1) (hash-keys hash2)) > > Ah, sure, good point! > > ; Return an unordered list of the keys that are in hash1 but not in hash2 > (set-subtract (hash-keys hash1) (hash-keys hash2)) > > ; Get a new hash consisting of the key/values that are in hash1 but not in > hash2 > (for/hash ([k (set-subtract (hash-keys hash1) (hash-keys hash2))]) > (values k (hash-ref hash1 k))) > > ; Get a ore detailed breakdown: > (require handy) > (define hash1 (for/hash ([k '(a b c d e f g)] [v 10]) (values k v))) > (define hash2 (for/hash ([k '(a b c d e z y)] [v 10]) (values k v))) > (define hash3 (hash-set* hash2 'c 111 'd 184)) > (disjunction hash1 hash3) > Result: > (dict-disjunction > '#hash((c . (2 111)) (d . (3 184))); values that differ between the hashes > '#hash((f . 5) (g . 6)) ; key/values that exist only in hash1 > '#hash((y . 6) (z . 5)) ; key/values that exist only in hash3 > '#hash((a . 0) (b . 1) (c . 2) (d . 3) (e . 4) (f . 5) (g . 6)) ; hash1 > '#hash((a . 0) (b . 1) (c . 111) (d . 3) (e . 4) (y . 6) (z . 5))) ; hash3 > > Wow, `handy` is very handy! I wasn't aware of its existence, but I'll guess you've got yourself a new user :-) > >> Unfortunately, there is no variant of "for" that creates mutable hashes. >> But the general form works for anything. >> > > If you don't mind inefficiency then handy can be, well, handy: > > (define imm-h (for/hash ([k '(a b c)][v 3]) (values k v))) > (immutable? imm-h) > (immutable? (hash->mutable imm-h)) > > hash->mutable takes an existing hash, which can be either immutable or > mutable, and adds its key/values to a new mutable hash one by one, then > returns that hash. > > Very nice! The handy module is a bit of a Fibber McGee that really needs to be broken > out. It's thoroughly documented, but unfortunately only in comments. > Converting that to proper scribble is one of my Copious Free Times projects. > > Ah, I see :-) /me looks at his own CFT projects and sighs lightly. - Sergiu -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/racket-users/0c1f416f-d254-4770-98e2-80f2873fc529n%40googlegroups.com.
Re: [racket-users] hash->list with try-order? (like hash-map)
On Thursday, October 21, 2021 at 11:26:16 AM UTC+2 gneuner2 wrote:
>
> On 10/20/2021 5:53 PM, unlimitedscolobb wrote:
>
> I have two main use cases for producing an ordered list from a hash table:
>
> 1. A canonical way to pretty print a hash table: In my projects, I carry
> around and print out hash tables a lot, so I like the elements to appear in
> the same order all the time, whatever that order may be. Luckily,
> `hash-map` orders symbols alphabetically and numbers according to the
> natural order, so it's perfect for my use.
>
>
> It's fine if it works for you. Just beware hashing on things like lists,
> structs, objects, etc.
>
>
Good point indeed, thank you.
> You might look into Laurent Orseau's "text-table" package. Tables are a
> great way to print structured output.
>
> Nice package! These are things which I typically want to do sometimes.
At the moment I rely on Org-mode: when evaluating a Racket source code
block, I can ask Org-mode to typeset the resulting list as a table, which
is often perfect for my purposes.
>
> 2. Testing the contents of a mutable hash table: The only way I found to
> that is to convert the hash table to an ordered list and compared it to the
> test list. This is clearly not the most efficient use of a hash table, but
> I can totally go with that, since it's about testing and not the actual
> performance.
>
> Of course, I am totally open to learning better ways of doing these things!
>
>
> Depends on what you're trying to do. Sometimes changing the data format
> IS the best way. That said ...
>
> Be aware that the code fragments below were just made up as I wrote this
> ... they have not been tested and may contain unbalanced parentheses but
> they should give you the idea. Nothing here depends on the ordering of
> data in the hashes. Also if you prefer "do" loops to "for" loops, you can
> use them instead.
>
> Note also the use of "in-list", "in-hash-pairs","in-mutable-hash-pairs".
> Racket "for" loops work with sequences, and although many data types -
> including lists and hashes - will implicitly ACT as sequences, explicitly
> using the relevant sequence constructors can make your "for" loops run
> faster.
>
> see https://docs.racket-lang.org/reference/sequences.html
>
>
Oh, sequences, of course! I try using them as much as I can in my code
because they are so nice, but I just forgot about them in this particular
situation :D
>
>=
>
>
> To see if 2 hashes contain the same set of keys:
>
> (and (= (hash-count hash1) (hash-count hash2))
> (for/and ([k (in-list (hash-keys hash1))])
>(hash-has-key? hash2 k)))
>
> There is a function "hash-keys-subset?" that checks if the keys in one
> hash are a subset of keys in another hash. It generally will be faster
> than an equivalent loop, but it requires that both hashes use the same key
> comparison function.
>
>
> To see if 2 hashes contain the same set of (k,v) pairs:
>
> ; immutable
> (for/and ([(k,v) (in-hash-pairs hash1)])
> (equal v (hash-ref hash2 k fail))
>
> ; mutable
> (for/and ([(k,v) (in-mutable-hash-pairs hash1)])
> (equal v (hash-ref hash2 k fail))
>
>
>
> Figuring out the difference between one hash vs another is a bit harder,
> but a loop similar to the equality check works for this also:
>
> (for/list ([(k,v) (in-{mutable-}hash-pairs hash1)]
> #:unless (equal v (hash-ref hash2 k fail)))
>(cons k v))
>
> Note that the ordering matters - the loop finds things that are in hash1
> but not in hash2. Also instead of creating a list of what's missing, you
> could create another hash:
>
> ; create immutable hash
> (for/hash ([(k,v) (in-{mutable-}hash-pairs hash1)]
> #:unless (equal v (hash-ref hash2 k fail)))
>(values k v))
>
> ; update a mutable hash
> (for ([(k,v) (in-{mutable-}hash-pairs hash1)]
> #:unless (equal v (hash-ref hash2 k fail)))
>(hash-set! result k v))
>
> Unfortunately, there is no variant of "for" that creates mutable hashes.
> But the general form works for anything.
>
>
>
> Obviously there is a theme here.
>
> You are free to mix and match things: if your test data already is in
> lists, you can use the lists directly - either as the source sequences or
> as the lookup targets (since it's only a test, searching lists with
> "member" et al shouldn't matter ).
>
>
Thank you for all these examples George!
Which makes me wonder: why is there not a hash table comparison function
which would be built like one of your suggestions? I'd typically expect
such a comparison function to be part of a hash table library. Another
opportunity for contributions I guess.
-
Sergiu
Hope this helps,
> George
>
>
--
You received this message because you are subscribed to the Google Groups
"Racket Users" group.
To unsubscribe from this group and stop receiving emails from
