-
Notifications
You must be signed in to change notification settings - Fork 1
/
RealTimeSimulator.html
2682 lines (2405 loc) · 98.5 KB
/
RealTimeSimulator.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<!DOCTYPE html>
<html>
<head>
<title>Group Income Simulator</title>
<meta name="viewport" content="width=device-width, initial-scale=1.0, user-scalable=no" />
<link rel="icon" type="image/svg+xml" href="favicon.ico">
<link rel="stylesheet" href="style.css">
</head>
<body>
<div class="gis_layout">
<header class="gis_wrapper gis_header_wrapper">
<div class="gis_logo">
<img src="./images/logo.svg">
<h1 class="gis_logo_label">Simulator</h1>
</div>
<button class="gis_logo_button button" onclick="clear_all()">Reset</button>
</header>
<div id="gis_body" class="gis_main gis_wrapper">
<p class="gis_instruction" id="load_message">
Group income makes it easy for small communities to voluntarily provide a financial safety net for their
members.
<br>
<br>
Members of the group can contribute with monetary (pledges) or non-monetary donations, securing everyone in your
group with a basic income.
<br>
<br>
Start adding members to see how it works.
</p>
<div id="gis_canvas_div">
<div style="width:100%; height: 100%; position: absolute;" id="gis_label_div">
</div>
<div id="gis_options_div">
</div>
</div>
</div>
<footer class="gis_footer">
<div class="gis_footer_wrapper gis_wrapper">
<div class="gis_buttons" onclick="add_pledger()">Add Pledger</div>
<div class="gis_input_wrapper">
<div class="gis_input_field">
<label class="gis_input_label">Amount:</label>
<input id="amount" class="gis_amount" type="number" value="10" min="0" step="1" />
</div>
<label class="gis_currency">$ USD</label>
</div>
<div class="gis_buttons" onclick="add_receiver()">Add Receiver</div>
</div>
</footer>
</div>
<!-- Add Javascript at the end to load faster -->
<script type="text/javascript">
/* https://github.com/okTurtles/group-income/blob/master/contracts/0.0.9/group.js */
// frontend/model/contracts/misc/flowTyper.js
var EMPTY_VALUE = Symbol("@@empty");
var isEmpty = (v) => v === EMPTY_VALUE;
var isNil = (v) => v === null;
var isUndef2 = (v) => typeof v === "undefined";
var isBoolean2 = (v) => typeof v === "boolean";
var isNumber = (v) => typeof v === "number";
var isString = (v) => typeof v === "string";
var isObject2 = (v) => !isNil(v) && typeof v === "object";
var isFunction = (v) => typeof v === "function";
var getType2 = (typeFn, _options) => {
if (isFunction(typeFn.type))
return typeFn.type(_options);
return typeFn.name || "?";
};
var TypeValidatorError = class extends Error {
expectedType;
valueType;
value;
typeScope;
sourceFile;
constructor(message, expectedType, valueType, value, typeName = "", typeScope = "") {
const errMessage = message || `invalid "${valueType}" value type; ${typeName || expectedType} type expected`;
super(errMessage);
this.expectedType = expectedType;
this.valueType = valueType;
this.value = value;
this.typeScope = typeScope || "";
this.sourceFile = this.getSourceFile();
this.message = `${errMessage}
${this.getErrorInfo()}`;
this.name = this.constructor.name;
if (Error.captureStackTrace) {
Error.captureStackTrace(this, TypeValidatorError);
}
}
getSourceFile() {
const fileNames = this.stack.match(/(\/[\w_\-.]+)+(\.\w+:\d+:\d+)/g) || [];
return fileNames.find((fileName) => fileName.indexOf("/flowTyper-js/dist/") === -1) || "";
}
getErrorInfo() {
return `
file ${this.sourceFile}
scope ${this.typeScope}
expected ${this.expectedType.replace(/\n/g, "")}
type ${this.valueType}
value ${this.value}
`;
}
};
var validatorError = (typeFn, value, scope, message, expectedType, valueType) => {
return new TypeValidatorError(message, expectedType || getType2(typeFn), valueType || typeof value, JSON.stringify(value), typeFn.name, scope);
};
var arrayOf = (typeFn, _scope = "Array") => {
function array(value) {
if (isEmpty(value))
return [typeFn(value)];
if (Array.isArray(value)) {
let index2 = 0;
return value.map((v) => typeFn(v, `${_scope}[${index2++}]`));
}
throw validatorError(array, value, _scope);
}
array.type = () => `Array<${getType2(typeFn)}>`;
return array;
};
var literalOf = (primitive) => {
function literal(value, _scope = "") {
if (isEmpty(value) || value == primitive)
return primitive;
throw validatorError(literal, value, _scope);
}
literal.type = () => {
if (isBoolean2(primitive))
return `${primitive ? "true" : "false"}`;
else
return `"${primitive}"`;
};
return literal;
};
var mapOf = (keyTypeFn, typeFn) => {
function mapOf2(value) {
if (isEmpty(value))
return {};
const o = object(value);
const reducer = (acc, key) => Object.assign(acc, {
[keyTypeFn(key, "Map[_]")]: typeFn(o[key], `Map.${key}`)
});
return Object.keys(o).reduce(reducer, {});
}
mapOf2.type = () => `{ [_:${getType2(keyTypeFn)}]: ${getType2(typeFn)} }`;
return mapOf2;
};
var object = function (value) {
if (isEmpty(value))
return {};
if (isObject2(value) && !Array.isArray(value)) {
return Object.assign({}, value);
}
throw validatorError(object, value);
};
var objectOf = (typeObj, _scope = "Object") => {
function object2(value) {
const o = object(value);
const typeAttrs = Object.keys(typeObj);
const unknownAttr = Object.keys(o).find((attr) => !typeAttrs.includes(attr));
if (unknownAttr) {
throw validatorError(object2, value, _scope, `missing object property '${unknownAttr}' in ${_scope} type`);
}
const undefAttr = typeAttrs.find((property) => {
const propertyTypeFn = typeObj[property];
return propertyTypeFn.name.includes("maybe") && !o.hasOwnProperty(property);
});
if (undefAttr) {
throw validatorError(object2, o[undefAttr], `${_scope}.${undefAttr}`, `empty object property '${undefAttr}' for ${_scope} type`, `void | null | ${getType2(typeObj[undefAttr]).substr(1)}`, "-");
}
const reducer = isEmpty(value) ? (acc, key) => Object.assign(acc, {
[key]: typeObj[key](value)
}) : (acc, key) => {
const typeFn = typeObj[key];
if (typeFn.name.includes("optional") && !o.hasOwnProperty(key)) {
return Object.assign(acc, {});
} else {
return Object.assign(acc, {
[key]: typeFn(o[key], `${_scope}.${key}`)
});
}
};
return typeAttrs.reduce(reducer, {});
}
object2.type = () => {
const props2 = Object.keys(typeObj).map((key) => {
const ret = typeObj[key].name.includes("optional") ? `${key}?: ${getType2(typeObj[key], { noVoid: true })}` : `${key}: ${getType2(typeObj[key])}`;
return ret;
});
return `{|
${props2.join(",\n ")}
|}`;
};
return object2;
};
function objectMaybeOf(validations, _scope = "Object") {
return function (data) {
object(data);
for (const key in data) {
validations[key]?.(data[key], `${_scope}.${key}`);
}
return data;
};
}
var optional = (typeFn) => {
const unionFn = unionOf(typeFn, undef);
function optional2(v) {
return unionFn(v);
}
optional2.type = ({
noVoid
}) => !noVoid ? getType2(unionFn) : getType2(typeFn);
return optional2;
};
function undef(value, _scope = "") {
if (isEmpty(value) || isUndef2(value))
return void 0;
throw validatorError(undef, value, _scope);
}
undef.type = () => "void";
var boolean = function boolean2(value, _scope = "") {
if (isEmpty(value))
return false;
if (isBoolean2(value))
return value;
throw validatorError(boolean2, value, _scope);
};
var number = function number2(value, _scope = "") {
if (isEmpty(value))
return 0;
if (isNumber(value))
return value;
throw validatorError(number2, value, _scope);
};
var string = function string2(value, _scope = "") {
if (isEmpty(value))
return "";
if (isString(value))
return value;
throw validatorError(string2, value, _scope);
};
function tupleOf_(...typeFuncs) {
function tuple(value, _scope = "") {
const cardinality = typeFuncs.length;
if (isEmpty(value))
return typeFuncs.map((fn) => fn(value));
if (Array.isArray(value) && value.length == cardinality) {
const tupleValue = [];
for (let i = 0; i < cardinality; i += 1) {
tupleValue.push(typeFuncs[i](value[i], _scope));
}
return tupleValue;
}
throw validatorError(tuple, value, _scope);
}
tuple.type = () => `[${typeFuncs.map((fn) => getType2(fn)).join(", ")}]`;
return tuple;
}
var tupleOf = tupleOf_;
function unionOf_(...typeFuncs) {
function union(value, _scope = "") {
for (const typeFn of typeFuncs) {
try {
return typeFn(value, _scope);
} catch (_) { }
}
throw validatorError(union, value, _scope);
}
union.type = () => `(${typeFuncs.map((fn) => getType2(fn)).join(" | ")})`;
return union;
}
var unionOf = unionOf_;
// frontend/model/contracts/shared/constants.js
var INVITE_INITIAL_CREATOR = "invite-initial-creator";
var INVITE_STATUS = {
REVOKED: "revoked",
VALID: "valid",
USED: "used"
};
var PROFILE_STATUS = {
ACTIVE: "active",
PENDING: "pending",
REMOVED: "removed"
};
var PROPOSAL_RESULT = "proposal-result";
var PROPOSAL_INVITE_MEMBER = "invite-member";
var PROPOSAL_REMOVE_MEMBER = "remove-member";
var PROPOSAL_GROUP_SETTING_CHANGE = "group-setting-change";
var PROPOSAL_PROPOSAL_SETTING_CHANGE = "proposal-setting-change";
var PROPOSAL_GENERIC = "generic";
var PROPOSAL_ARCHIVED = "proposal-archived";
var MAX_ARCHIVED_PROPOSALS = 100;
var PAYMENTS_ARCHIVED = "payments-archived";
var MAX_ARCHIVED_PERIODS = 100;
var MAX_SAVED_PERIODS = 2;
var STATUS_OPEN = "open";
var STATUS_PASSED = "passed";
var STATUS_FAILED = "failed";
var STATUS_CANCELLED = "cancelled";
var CHATROOM_TYPES = {
INDIVIDUAL: "individual",
GROUP: "group"
};
var CHATROOM_PRIVACY_LEVEL = {
GROUP: "chatroom-privacy-level-group",
PRIVATE: "chatroom-privacy-level-private",
PUBLIC: "chatroom-privacy-level-public"
};
var MESSAGE_TYPES = {
POLL: "message-poll",
TEXT: "message-text",
INTERACTIVE: "message-interactive",
NOTIFICATION: "message-notification"
};
var INVITE_EXPIRES_IN_DAYS = {
ON_BOARDING: 30,
PROPOSAL: 7
};
var MESSAGE_NOTIFICATIONS = {
ADD_MEMBER: "add-member",
JOIN_MEMBER: "join-member",
LEAVE_MEMBER: "leave-member",
KICK_MEMBER: "kick-member",
UPDATE_DESCRIPTION: "update-description",
UPDATE_NAME: "update-name",
DELETE_CHANNEL: "delete-channel",
VOTE: "vote"
};
var PROPOSAL_VARIANTS = {
CREATED: "proposal-created",
EXPIRING: "proposal-expiring",
ACCEPTED: "proposal-accepted",
REJECTED: "proposal-rejected",
EXPIRED: "proposal-expired"
};
var MAIL_TYPE_MESSAGE = "message";
var MAIL_TYPE_FRIEND_REQ = "friend-request";
// frontend/model/contracts/shared/payments/index.js
var PAYMENT_PENDING = "pending";
var PAYMENT_CANCELLED = "cancelled";
var PAYMENT_ERROR = "error";
var PAYMENT_NOT_RECEIVED = "not-received";
var PAYMENT_COMPLETED = "completed";
var paymentStatusType = unionOf(...[PAYMENT_PENDING, PAYMENT_CANCELLED, PAYMENT_ERROR, PAYMENT_NOT_RECEIVED, PAYMENT_COMPLETED].map((k) => literalOf(k)));
var PAYMENT_TYPE_MANUAL = "manual";
var PAYMENT_TYPE_BITCOIN = "bitcoin";
var PAYMENT_TYPE_PAYPAL = "paypal";
var paymentType = unionOf(...[PAYMENT_TYPE_MANUAL, PAYMENT_TYPE_BITCOIN, PAYMENT_TYPE_PAYPAL].map((k) => literalOf(k)));
// frontend/model/contracts/shared/functions.js
function paymentHashesFromPaymentPeriod(periodPayments) {
let hashes = [];
if (periodPayments) {
const {
paymentsFrom
} = periodPayments;
for (const fromUser in paymentsFrom) {
for (const toUser in paymentsFrom[fromUser]) {
hashes = hashes.concat(paymentsFrom[fromUser][toUser]);
}
}
}
return hashes;
}
function createPaymentInfo(paymentHash, payment) {
return {
from: payment.meta.username,
to: payment.data.toUser,
hash: paymentHash,
amount: payment.data.amount,
isLate: !!payment.data.isLate,
when: payment.data.completedDate,
unlocked: true
};
}
// frontend/model/contracts/shared/distribution/mincome-proportional.js
function mincomeProportional(haveNeeds) {
let totalHave = 0;
let totalNeed = 0;
const pledgers = [];
const receivers = [];
for (const haveNeed of haveNeeds) {
if (haveNeed.haveNeed > 0) {
pledgers.push(haveNeed);
totalHave += haveNeed.haveNeed;
} else if (haveNeed.haveNeed < 0) {
receivers.push(haveNeed);
totalNeed += Math.abs(haveNeed.haveNeed);
}
}
const totalPercent = Math.min(1, totalNeed / totalHave);
const payments = [];
for (const pledger of pledgers) {
const distributionAmount = totalPercent * pledger.haveNeed;
for (const receiver of receivers) {
const belowPercentage = Math.abs(receiver.haveNeed) / totalNeed;
payments.push({
amount: distributionAmount * belowPercentage,
from: pledger.name,
to: receiver.name,
unlocked: true
});
}
}
return payments;
}
// frontend/model/contracts/shared/distribution/payments-minimizer.js
function minimizeTotalPaymentsCount(distribution) {
const receiverTotalReceived = {};
const pledgerTotalHave = {};
const pledgersSorted = [];
const receiversSorted = [];
const minimizedDistribution = [];
for (const todo of distribution) {
receiverTotalReceived[todo.to] = (receiverTotalReceived[todo.to] || 0) + todo.amount;
pledgerTotalHave[todo.from] = (pledgerTotalHave[todo.from] || 0) + todo.amount;
}
for (const name in pledgerTotalHave) {
pledgersSorted.push({
name,
amount: pledgerTotalHave[name]
});
}
for (const name in receiverTotalReceived) {
receiversSorted.push({
name,
amount: receiverTotalReceived[name]
});
}
pledgersSorted.sort((a, b) => b.amount - a.amount);
receiversSorted.sort((a, b) => b.amount - a.amount);
while (pledgersSorted.length > 0 && receiversSorted.length > 0) {
const mostPledger = pledgersSorted.pop();
const mostReceiver = receiversSorted.pop();
const diff = mostPledger.amount - mostReceiver.amount;
if (diff < 0) {
minimizedDistribution.push({
amount: mostPledger.amount,
from: mostPledger.name,
to: mostReceiver.name
});
mostReceiver.amount -= mostPledger.amount;
receiversSorted.push(mostReceiver);
} else if (diff > 0) {
minimizedDistribution.push({
amount: mostReceiver.amount,
from: mostPledger.name,
to: mostReceiver.name
});
mostPledger.amount -= mostReceiver.amount;
pledgersSorted.push(mostPledger);
} else {
minimizedDistribution.push({
amount: mostReceiver.amount,
from: mostPledger.name,
to: mostReceiver.name
});
}
}
return minimizedDistribution;
}
// frontend/model/contracts/shared/currencies.js
var DECIMALS_MAX = 8;
function commaToDots(value) {
return typeof value === "string" ? value.replace(/,/, ".") : value.toString();
}
function isNumeric(nr) {
return !isNaN(nr - parseFloat(nr));
}
function isInDecimalsLimit(nr, decimalsMax) {
const decimals = nr.split(".")[1];
return !decimals || decimals.length <= decimalsMax;
}
function validateMincome(value, decimalsMax) {
const nr = commaToDots(value);
return isNumeric(nr) && isInDecimalsLimit(nr, decimalsMax);
}
function decimalsOrInt(num, decimalsMax) {
return num.toFixed(decimalsMax).replace(/\.0+$/, "");
}
function saferFloat(value) {
return parseFloat(value.toFixed(DECIMALS_MAX));
}
function makeCurrency(options) {
const {
symbol,
symbolWithCode,
decimalsMax,
formatCurrency
} = options;
return {
symbol,
symbolWithCode,
decimalsMax,
displayWithCurrency: (n) => formatCurrency(decimalsOrInt(n, decimalsMax)),
displayWithoutCurrency: (n) => decimalsOrInt(n, decimalsMax),
validate: (n) => validateMincome(n, decimalsMax)
};
}
var currencies = {
USD: makeCurrency({
symbol: "$",
symbolWithCode: "$ USD",
decimalsMax: 2,
formatCurrency: (amount) => "$" + amount
}),
EUR: makeCurrency({
symbol: "\u20AC",
symbolWithCode: "\u20AC EUR",
decimalsMax: 2,
formatCurrency: (amount) => "\u20AC" + amount
}),
BTC: makeCurrency({
symbol: "\u0243",
symbolWithCode: "\u0243 BTC",
decimalsMax: DECIMALS_MAX,
formatCurrency: (amount) => amount + "\u0243"
})
};
var currencies_default = currencies;
// frontend/model/contracts/shared/distribution/distribution.js
var tinyNum = 1 / Math.pow(10, DECIMALS_MAX);
function cloneDeep(obj) { return JSON.parse(JSON.stringify(obj)) }
function unadjustedDistribution({
haveNeeds = [],
minimize
}) {
const distribution = mincomeProportional(haveNeeds);
return minimize ? minimizeTotalPaymentsCount(distribution) : distribution;
}
function adjustedDistribution({
distribution,
payments,
dueOn
}) {
distribution = cloneDeep(distribution);
for (const todo of distribution) {
todo.total = todo.amount;
}
distribution = subtractDistributions(distribution, payments).filter((todo) => todo.amount >= tinyNum);
for (const todo of distribution) {
todo.amount = saferFloat(todo.amount);
todo.total = saferFloat(todo.total);
todo.partial = todo.total != todo.amount;
todo.isLate = false;
todo.dueOn = dueOn;
todo.unlocked = true;
}
return distribution;
}
// Merges multiple payments between any combinations two of users:
function reduceDistribution(payments) {
// Don't modify the payments list/object parameter in-place, as this is not intended:
payments = cloneDeep(payments)
for (let i = 0; i < payments.length; i++) {
const paymentA = payments[i]
for (let j = i + 1; j < payments.length; j++) {
const paymentB = payments[j]
// Were paymentA and paymentB between the same two users?
if ((paymentA.from == paymentB.from && paymentA.to == paymentB.to) ||
(paymentA.to == paymentB.from && paymentA.from == paymentB.to)) {
// Add or subtract paymentB's amount to paymentA's amount, depending on the relative
// direction of the two payments:
paymentA.amount += (paymentA.from == paymentB.from ? 1 : -1) * paymentB.amount
if (!paymentA.totalLocked && !paymentB.totalLocked) {
paymentA.total += (paymentA.from == paymentB.from ? 1 : -1) * paymentB.total
}
// Remove paymentB from payments, and decrement the inner sentinal loop variable:
payments.splice(j, 1)
j--
}
}
}
return payments
}
function addDistributions(paymentsA, paymentsB) {
return reduceDistribution([...paymentsA, ...paymentsB])
}
function subtractDistributions(paymentsA, paymentsB) {
// Don't modify any payment list/objects parameters in-place, as this is not intended:
paymentsB = cloneDeep(paymentsB)
// Reverse the sign of the second operand's amounts so that the final addition is actually subtraction:
for (const p of paymentsB) {
p.amount *= -1
p.total *= -1
}
return addDistributions(paymentsA, paymentsB)
}
// This algorithm is responsible for calculating the monthly-rated distribution of
// payments.
function parsedistributionFromEvents(
distributionEvents,
opts
) {
const distributionEventsCopy = cloneDeep(distributionEvents)
const groupMembers = []
let payments = []
const { adjusted, minimizeTxns } = opts
// Convenience function for retreiving a user by name:
const getUser = (name) => groupMembers.find(member => member.name == name)
const eventHandlers = {
haveNeedEvent(event) {
const oldUser = getUser(event.data.name)
if (oldUser) {
const oldHaveNeed = oldUser.haveNeed
oldUser.haveNeed = event.data.haveNeed
oldUser.oldHaveNeed = oldHaveNeed
} else {
groupMembers.push({
name: event.data.name,
haveNeed: event.data.haveNeed
})
}
},
paymentEvent(event) {
payments.push({
from: event.data.from,
to: event.data.to,
amount: event.data.amount,
total: 0,
dueOn: '',
isLate: !!event.data.isLate,
partial: false
})
},
userExitsGroupEvent(event) {
const idx = groupMembers.findIndex(v => v.name == event.data.name)
if (idx == -1) throw new Error(`userExitsGroupEvent: no such user: ${event.data.name}`)
groupMembers.splice(idx, 1)
}
// TODO: if we decide to handle latePayments as part of the distribution
// events, then add a dummy function here that does nothing for latePaymentEvents
// and handle the events separately down below (see other TODO at end of function)
}
// handle all events, filling out payments and groupMembers arrays
let prevDistEvent
let sequence = []
const distributionSequences = [sequence]
while (distributionEventsCopy.length > 0) {
const event = distributionEventsCopy.shift()
if (prevDistEvent == 'paymentEvent' && event.type != 'paymentEvent') {
sequence = [event]
distributionSequences.push(sequence)
} else {
sequence.push(event)
}
prevDistEvent = event.type
}
const reduceField = (field, dir, name, dist) => {
return dist.reduce((a, p) => {
return p[dir] == name ? a + p[field] : a
}, 0)
}
const ensureTotalSet = (dist) => {
for (const todo of dist) {
todo.total = todo.amount
}
return dist
}
const todoExistsInDistribution = (todo, dist) => {
for (const oldTodo of dist) {
if (oldTodo.from == todo.from && oldTodo.to == todo.to) {
return true
}
}
}
const lockTodos = (dist) => {
for (const todo of dist) {
if (todo.amount != todo.total) {
todo.totalLocked = true
// this is a kind of hack for dealing with certain minimization scenarios
// where the amount we paid results in a negative value for the unminimized
// but adjusted distribution
if (todo.amount < 0) {
todo.total -= todo.amount
// todo.amount = 0
}
}
}
return dist
}
// Principles:
// 1. Once a payment is made, the .total between those two users is set for life
// 2. mincomeProportional should be re-applied to the remainer of the haveNeeds,
// subtracting the .total from them, and redistributing todos between any parties
// that already have payments between them to other todos, and then concattenating
// that todo list with the previous todo list, and then subtracting any new
// payments
let distribution = []
let prevPayments = []
// for (const sequence of distributionSequences) {
for (let i = 0; i < distributionSequences.length; i++) {
const sequence = distributionSequences[i]
// console.log('\n===== LOOP!!! Sequence:', sequence, '\n')
payments = []
for (const event of sequence) {
eventHandlers[event.type](event)
}
if (distribution.length == 0) {
distribution = ensureTotalSet(mincomeProportional(groupMembers))
}
if (adjusted) {
const reserves = cloneDeep(groupMembers)
const lockedTodos = distribution.filter(todo => todo.totalLocked)
// if we wanted to handle partial payments + haveNeed changes, it would go here
// and it would look something like this:
// // loop through reserves to find those with modified haveNeeds
// // remember to delete groupMember.oldHaveNeed afterward
// for (const reserver of reserves) {
// if (reserver.oldHaveNeed) {
// const totalChange = reserver.oldHaveNeed - reserver.haveNeed
// // now find affected lockedTodos
// for (const todo of lockedTodos) {
// console.log({ reserver, totalChange, todo })
// if (Math.sign(reserver.oldHaveNeed) == Math.sign(reserver.haveNeed)) {
// if (reserver.haveNeed < 0) {
// // a needer has changed their need, only modify old todo if need was reduced
// if (totalChange < 0) {
// todo.total += totalChange
// todo.amount += totalChange
// }
// } else {
// // a pledger has changed their pledge, only modify old todo if pledge was reduced
// if (totalChange > 0) {
// todo.total -= totalChange
// todo.amount -= totalChange
// }
// }
// } else {
// // handle those who've switched sides differently
// }
// }
// delete getUser(reserver.name).oldHaveNeed
// }
// }
// now set the reserve haveNeeds to the actual reserves
for (const reserver of reserves) {
if (reserver.haveNeed > 0) {
reserver.haveNeed -= reduceField('total', 'from', reserver.name, lockedTodos)
// reserver.haveNeed -= reduceField('amount', 'from', reserver.name, payments)
reserver.haveNeed = Math.max(reserver.haveNeed, 0)
} else if (reserver.haveNeed < 0) {
reserver.haveNeed += reduceField('total', 'to', reserver.name, lockedTodos)
// reserver.haveNeed += reduceField('amount', 'to', reserver.name, payments)
reserver.haveNeed = Math.min(reserver.haveNeed, 0)
}
}
// TODO: figure out whether subTodos or massagedDistribution or distribution needs to be minimized
const subTodos = ensureTotalSet(mincomeProportional(reserves))
// console.log(`minimization (${minimizeTxns ? 'on' : 'off'}):`, { reserves, payments, subTodos, distribution })
const todosWithoutExistingPayments = {}
const redistributeTodoHaveNeed = {}
// console.log({ reserves, lockedTodos, distribution, prevPayments })
for (const todo of subTodos) {
todosWithoutExistingPayments[todo.from] = []
redistributeTodoHaveNeed[todo.from] = []
}
// take any todos generated this time for user X that have a corresponding existing payment
// from the previous sequence and remove them, redistributing their amount to the other
// todos for user X that don't have existing payments
for (const todo of subTodos) {
if (todoExistsInDistribution(todo, prevPayments)) {
redistributeTodoHaveNeed[todo.from].push({
name: todo.from,
haveNeed: todo.amount
})
} else {
todosWithoutExistingPayments[todo.from].push(todo)
redistributeTodoHaveNeed[todo.from].push({
name: todo.to,
haveNeed: -(todo.amount)
})
}
}
// console.log({ prevTodos, subTodos, reserves, prevPayments })
let redistribution
let redistributions = []
for (const name in redistributeTodoHaveNeed) {
redistribution = ensureTotalSet(mincomeProportional(redistributeTodoHaveNeed[name]))
// console.log(`redistributeTodoHaveNeed for ${name}`, redistributeTodoHaveNeed[name], 'redistribution', redistribution, 'adding to:', todosWithoutExistingPayments[name])
todosWithoutExistingPayments[name] = addDistributions(
todosWithoutExistingPayments[name], redistribution
)
// take the total amount that were increased to each "to" from this "from"
// and proportionally subtract them from each other inputs to this "to"
const totalRedistributed = redistribution.reduce((a, i) => a + i.amount, 0)
if (totalRedistributed > 0) {
redistributions = redistributions.concat(redistribution)
}
}
let massagedDistribution = Object.values(todosWithoutExistingPayments).reduce((a, i) => a.concat(i), [])
// console.log({ massagedDistribution, redistributions })
for (redistribution of redistributions) {
// take the total that was redistributed and subtract it from the inputs proportionally
const tempHaveNeeds = [{ name: redistribution.from, haveNeed: redistribution.amount }]
massagedDistribution.filter(todo => {
return todo.to == redistribution.to && todo.from != redistribution.from
}).forEach(todo => {
tempHaveNeeds.push({ name: todo.from, haveNeed: -(todo.amount) })
})
mincomeProportional(tempHaveNeeds).forEach(todo => {
const theTodo = massagedDistribution.find(i => i.from == todo.to && i.to == redistribution.to)
theTodo.amount -= todo.amount
theTodo.total -= todo.amount
})
}
// now find the amount remaining in each haver who still has some to give,
// and find the needers who still need some, and create a new list of haveNeeds based on that
// to create a "remainderDistribution" that we add back to our massagedDistribution
const remainderHaveNeeds = []
const reserverRemainders = {}
for (const reserver of reserves) {
if (reserver.haveNeed > 0) {
const remainder = reserver.haveNeed - massagedDistribution
.filter(todo => todo.from == reserver.name).reduce((a, i) => a + i.amount, 0)
// TODO: next line doesn't seem necessary, remove if certain
// remainder -= payments.filter(p => p.from == reserver.name).reduce((a, i) => a + i.amount, 0)
if (remainder > 0) {
remainderHaveNeeds.push({ name: reserver.name, haveNeed: remainder })
reserverRemainders[reserver.name] = remainder
}
} else if (reserver.haveNeed < 0) {
const remainder = reserver.haveNeed + massagedDistribution
.filter(todo => todo.to == reserver.name).reduce((a, i) => a + i.amount, 0)
// remainder += payments.filter(p => p.from == reserver.name).reduce((a, i) => a + i.amount, 0)
if (remainder < 0) {
remainderHaveNeeds.push({ name: reserver.name, haveNeed: remainder })
reserverRemainders[reserver.name] = remainder
}
}
}
redistribution = []
// console.log({ remainderHaveNeeds, redistribution, distribution })
// before we add it however, we need one last check, and that is
// "verboten remainders". this redistribution can still contain a payment
// from a user to someone they already did their whole todo for, in which
// case we must remove it and redistribute it to the other remainders
const badRemainders = []
ensureTotalSet(mincomeProportional(remainderHaveNeeds)).forEach(todo => {
if (todoExistsInDistribution(todo, prevPayments)) {
badRemainders.push(todo)
} else {
redistribution.push(todo)
}
})
for (const badRemainder of badRemainders) {
const remainderRedist = [{ name: badRemainder.from, haveNeed: badRemainder.amount }]
for (const r of redistribution) {
if (r.to == badRemainder.to) {
// for this input, calculate how much room there is available to distribute
// the remainder too, subtract the room from the sum of the other remainders
const availableRoom = reserverRemainders[r.from] - redistribution
.filter(todo => todo.from == r.from)
.reduce((a, i) => a + i.amount, 0)
remainderRedist.push({ name: r.from, haveNeed: -availableRoom })
}
}
mincomeProportional(remainderRedist).forEach(todo => {
const theTodo = redistribution.find(i => i.to == badRemainder.to && i.from == todo.to)
theTodo.amount += todo.amount
theTodo.total += todo.amount
})
}
// console.log({ massagedDistribution, redistribution })
massagedDistribution = addDistributions(massagedDistribution, redistribution)
distribution = distribution.filter(todo => todo.totalLocked)
// console.log('distribution', distribution, 'adding:', massagedDistribution, 'subtracting:', payments)
if (minimizeTxns) {
massagedDistribution = ensureTotalSet(minimizeTotalPaymentsCount(massagedDistribution))
}
distribution = distribution.concat(massagedDistribution)
distribution = subtractDistributions(distribution, payments)
// lock todos that have payments this round as well
distribution = lockTodos(distribution)
// console.log({ prevPayments, payments, reserves, subTodos, distribution })
prevPayments = prevPayments.concat(payments)
// console.log({ distribution })
}
}
if (!adjusted) {
return mincomeProportional(groupMembers)
}
const tinyNum = 1 / Math.pow(10, DECIMALS_MAX)
distribution = distribution.filter(todo => {
// remove any todos for containing miniscule amounts
// and pledgers who switched sides should have their todos removed
return todo.amount >= tinyNum && getUser(todo.from).haveNeed > 0
})
// console.log({ finalDistribution })
const dueDate = 1E32
for (const todo of distribution) {
todo.amount = saferFloat(todo.amount)
todo.total = saferFloat(todo.total)
todo.partial = todo.total != todo.amount
todo.isLate = false
todo.dueOn = dueDate
delete todo.totalLocked
}
// TODO: add in latePayments to the end of the distribution
// consider passing in latePayments through distributionEvents
// instead of as a separate option, and simply do the event handler
// for it down here instead of up above.
return distribution
}
</script>
<script type="text/javascript">
function getFormat() {
function File() { }
File.prototype = function () {
this.name = ""
this.data = ""
}
function OpenGLDimension() {
this.type = ""
this.value = ""
this.Type = {
UNSET: "",
SCREEN_SIZE: "SCREEN_SIZE",
NEXT_LOWEST_POWER_OF_TWO: "NEXT_LOWEST_POWER_OF_TWO",
NEXT_HIGHEST_POWER_OF_TWO: "NEXT_HIGHEST_POWER_OF_TWO",
EXACT: "EXACT"
}
}
OpenGLDimension.prototype = function () { }
function OpenGLUniform() {
this.type = ""
this.name = ""
this.value = ""
this.Type = {
UNSET: "",
FLOAT: "FLOAT",
INT: "INT",
BOOL: "BOOL",
VEC_TWO: "VEC_TWO",
VEC_THREE: "VEC_THREE",
VEC_FOUR: "VEC_FOUR",
IVEC_TWO: "IVEC_TWO",
IVEC_THREE: "IVEC_THREE",
IVEC_FOUR: "IVEC_FOUR",
BVEC_TWO: "BVEC_TWO",
BVEC_THREE: "BVEC_THREE",
BVEC_FOUR: "BVEC_FOUR",
MAT_TWO: "MAT_TWO",
MAT_THREE: "MAT_THREE",
MAT_FOUR: "MAT_FOUR",
SAMPLER_TWO_D: "SAMPLER_TWO_D",
SAMPLERCUBE: "SAMPLERCUBE"
}
}
OpenGLUniform.prototype = function () { }
function OpenGLContext() {
this.name = ""
this.width = new OpenGLDimension()
this.height = new OpenGLDimension()
this.depth_test = false
}
OpenGLContext.prototype = function () { }
function OpenGLProgram() {