Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Wish: iteration must operate on the initial state of the table #3362

Closed
vicuna opened this issue May 27, 2002 · 1 comment
Closed

Wish: iteration must operate on the initial state of the table #3362

vicuna opened this issue May 27, 2002 · 1 comment

Comments

@vicuna
Copy link

vicuna commented May 27, 2002

Original bug ID: 1170
Reporter: administrator
Status: closed
Resolution: won't fix
Priority: normal
Severity: feature
Category: ~DO NOT USE (was: OCaml general)

Bug description

If you need stronger guarantees (e.g. the iteration must
operate on the initial state of the table), consider
replacing the hash table by a reference to a binary tree (module Map).

  • Xavier Leroy

Plz add this to the manual. It is only obvious when you know that Map is
pure and have no side-effects.

In the MLI-file there is a strange comment for iter:

Only current bindings are presented to [f]:
bindings hidden by more recent bindings are not passed to [f].

This sentence should probably be included in map, mapi and fold too.

@vicuna
Copy link
Author

vicuna commented Jul 3, 2004

Comment author: administrator

That Map is pure is well-documented already.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant