8000 Hashes · Issue #2 · dominictarr/poset · GitHub
[go: up one dir, main page]

Skip to content

Hashes #2

Open
Open

Description

@refset

From my email to Dominic:

For mathematical correctness it might be best to refactor our
description of posets to make clear that we are talking about inline
hashes vs a true binary relation. What I mean is that in the object or
fs example the result of the binary relation is in a sense memoized
and stored alongside the element. There are two other possibilities:

1 the full hash is a separate object that only references the

elements and #2 the hash is "generated" by a binary relation function
(probably not that useful unless dealing with numbers or the poset is
encoded for storage).

To clarify that a little:
By 'hash' I simply mean storing references to elements somewhere, as opposed to having to compute a binary relation against the entire set every time you want to do something useful. So an inline hash is a reference to an ancestor or descendent stored directly within the element's object (temporarily or not).

The suggestion, therefore, is to use terms like hash within the code / API to give clarity.

Disclaimer: I've semi-invented this terminology

Activity

  1. refset commented on Mar 20, 2013

    @refset
    CollaboratorAuthor

    Here is some actual functioning stuff I wrote that probably doesn't help:
    https://gist.github.com/jez0990/5204604

    I haven't actually namespaced the inline hashes but it follows my logic and boy did I make a mess of the parameters :D

    The 'tests' are at the bottom, delete "true |" to run!

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

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions

      0