- Notifications
You must be signed in to change notification settings - Fork0
nadgerz/Wie-viel-schulde-ich-dir-nodejs
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
Splittr(lite)=============TODO:osave to local storageoname of splittr sessionoenter number of people - P or a pulldown one can add to? add names to people -> array (option element)oadd groups name pick from list Pcan add more, but adds as a SetoAdd an IOU pick who owes - could be a groupin which case it will add an array of names pick who is owed pick an ammount - X this will then generate individual IOU'sAIM (all to PDFs)===olowest number of transactionsodetailed report on who owed who what - actualofilter by parasite/benefactorHOW to reduce transactionsA->B=5B->D=3D->A=7C->A=2C->A=1A->C=4Get list of unique combinationsA->B=5B->D=3D->A=7C->A=3A->C=4Then cancel 'opposites', so for each pair...A->B=5B->D=3D->A=7C->A=3 - (A -> C)=> C->A=3 - 4=> C->A=-1=> A->C=1=> Who owes the most different, starting with the lowest?=> means that although A -> c = 1, it may turn out that A does not pay C, but say, in this case, D does.The main AIM is to reduce/cancel transactions OR can we remove someone from owing anything?A->B=5B->D=3D->A=7A->C=1=>A->B=5B->D=3 <-- B is owed and owes, so we can eliminateD->A=7A->C=1=> A->B=5 - 3D->A=7 - 3A->C=1=> A->B=2D->A=4A->C=1Now reduce the number of people payingA->B=2D->A=4A->C=1=>D->B=2D->A=2A->C=1=>D->B=2D->A=1D->C=1
About
Command line version of a Splittr(lite)
Resources
Uh oh!
There was an error while loading.Please reload this page.
Stars
Watchers
Forks
Releases
No releases published
Packages0
No packages published
Uh oh!
There was an error while loading.Please reload this page.