Skip to content
This repository has been archived by the owner on Jun 28, 2023. It is now read-only.

Input validation for gossip graphs #17

Closed
3 of 8 tasks
RamonMeffert opened this issue Nov 7, 2020 · 2 comments
Closed
3 of 8 tasks

Input validation for gossip graphs #17

RamonMeffert opened this issue Nov 7, 2020 · 2 comments
Assignees

Comments

@RamonMeffert
Copy link
Owner

RamonMeffert commented Nov 7, 2020

  • The identity relation for N and S should always be satisfied
    • either Flag input as incorrect w/ error;
      • 😕 bad ux
      • 😃 easy
    • or Give a warning and add implied identity relations.
      • 😃 good ux
      • 😕 might be unclear to some users
  • Input should be in correct format
    • Numeric (03-20-123 0-1-2-3) or alphabetic (Abc ABC abC)
    • Different separators
      • either always allow multiple (possibly arbitrary) separators in input, and give a warning when more than one is used
        • 😃 good ux
        • 😕 how would number input work, as it needs 2 different separators?
      • or reject input when separators are inconsistent
        • 😕 bad ux
        • 😃 easy
  • Input should not contain unconnected nodes (?)
    • If no one can reach a node, it will never be included in any ca
@RamonMeffert RamonMeffert self-assigned this Nov 8, 2020
@RamonMeffert RamonMeffert added this to the Meeting Nov 24 milestone Nov 10, 2020
@RamonMeffert
Copy link
Owner Author

Most of this is included in #29

@RamonMeffert
Copy link
Owner Author

The most important parts of this are done, the other issues are addressed in #15 and #16 (and possibly #21) so I'm closing this

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

No branches or pull requests

1 participant