tx · cnjgS154pFETMTS2p15gRPc4HpEWY1z3seEneB9D63g

3N2wcNfEWihUVJV2S6jKwcw3QDupKgXPBnp:  -0.01400000 Waves

2021.03.13 15:25 [1435909] smart account 3N2wcNfEWihUVJV2S6jKwcw3QDupKgXPBnp > SELF 0.00000000 Waves

{
    "type": 13,
    "id": "cnjgS154pFETMTS2p15gRPc4HpEWY1z3seEneB9D63g",
    "fee": 1400000,
    "feeAssetId": null,
    "timestamp": 1615638437617,
    "version": 1,
    "sender": "3N2wcNfEWihUVJV2S6jKwcw3QDupKgXPBnp",
    "senderPublicKey": "2Ek8QRiW2SC3s4ZC79pXUmvJbmqU6agaNsjN2wmnzmSs",
    "proofs": [
        "3QQivAWFUujURuuZb1MD9LDmUNtHanWyXyAiumxgQjY9unoXsVakpdaqdfuuQG71F7N9Qhiq4oXTzw2Pzut9w21Q"
    ],
    "script": "base64:AAIEAAAAAAAAAAgIAhIECgIYEQAAAAcAAAAAEWtVc2VyUG9vbFZvdGVTV09QAgAAAAVfdm90ZQAAAAASa1VzZXJUb3RhbFZvdGVTV09QAgAAABVfdXNlcl90b3RhbF9TV09QX3ZvdGUAAAAADWtQb29sVm90ZVNXT1ACAAAACl92b3RlX1NXT1AAAAAADmtUb3RhbFZvdGVTV09QAgAAAA90b3RhbF92b3RlX1NXT1AAAAAAB2dvdkFkZHIJAQAAAAdBZGRyZXNzAAAAAQEAAAAaAVRAR/HWw3DxHB4C9lwcyuInima35raJGzsBAAAAFGlzQ2FsbGVySW5Hb3Zlcm5hbmNlAAAAAQAAAAR1c2VyAwMJAABmAAAAAgkBAAAAC3ZhbHVlT3JFbHNlAAAAAgkABBoAAAACBQAAAAdnb3ZBZGRyCQABLAAAAAIJAAQlAAAAAQUAAAAEdXNlcgIAAAAMX1NXT1BfYW1vdW50AAAAAAAAAAAAAAAAAAAAAAAABgkAAGYAAAACCQEAAAALdmFsdWVPckVsc2UAAAACCQAEGgAAAAIFAAAABHRoaXMJAAEsAAAAAgkABCUAAAABBQAAAAR1c2VyBQAAABJrVXNlclRvdGFsVm90ZVNXT1AAAAAAAAAAAAAAAAAAAAAAAAAGBwEAAAASaXNQb29sSW5Hb3Zlcm5hbmNlAAAAAQAAAAtwb29sQWRkcmVzcwMJAABmAAAAAgkBAAAAC3ZhbHVlT3JFbHNlAAAAAgkABBoAAAACBQAAAAdnb3ZBZGRyCQABLAAAAAIFAAAAC3Bvb2xBZGRyZXNzAgAAAB1fY3VycmVudF9wb29sX2ZyYWN0aW9uX3Jld2FyZAAAAAAAAAAAAAAAAAAAAAAAAAYHAAAAAQAAAAFpAQAAAA52b3RlUG9vbFdlaWdodAAAAAIAAAANcG9vbEFkZHJlc3NlcwAAABBwb29sc1ZvdGVTV09QTmV3CgEAAAAQY2FsY1ZvdGVEaWZmU1dPUAAAAAIAAAALYWNjdW11bGF0ZWQAAAALcG9vbEFkZHJlc3MDCQEAAAABIQAAAAEJAQAAABJpc1Bvb2xJbkdvdmVybmFuY2UAAAABBQAAAAtwb29sQWRkcmVzcwkAAAIAAAABAgAAAEFUaGlzIHBvb2wgaGFzIG5vIF9jdXJyZW50X3Bvb2xfZnJhY3Rpb25fcmV3YXJkIGluIEdvdmVybmFuY2UgZEFwcAQAAAAJcG9vbEluZGV4CQEAAAAFdmFsdWUAAAABCQAETwAAAAIFAAAADXBvb2xBZGRyZXNzZXMFAAAAC3Bvb2xBZGRyZXNzBAAAABN1c2VyUG9vbFZvdGVTV09QTmV3CQABkQAAAAIFAAAAEHBvb2xzVm90ZVNXT1BOZXcFAAAACXBvb2xJbmRleAQAAAAQdXNlclBvb2xWb3RlU1dPUAkBAAAAC3ZhbHVlT3JFbHNlAAAAAgkABBoAAAACBQAAAAR0aGlzCQABLAAAAAIJAAEsAAAAAgkAASwAAAACCQAEJQAAAAEIBQAAAAFpAAAABmNhbGxlcgUAAAARa1VzZXJQb29sVm90ZVNXT1ACAAAAAV8FAAAAC3Bvb2xBZGRyZXNzAAAAAAAAAAAABAAAABBwb29sVm90ZURpZmZTV09QCQAAZQAAAAIFAAAAE3VzZXJQb29sVm90ZVNXT1BOZXcFAAAAEHVzZXJQb29sVm90ZVNXT1ADBgkAAAIAAAABCQABLAAAAAIJAAEsAAAAAgkAAaQAAAABBQAAABN1c2VyUG9vbFZvdGVTV09QTmV3AgAAAAEgCQABpAAAAAEFAAAAEHVzZXJQb29sVm90ZVNXT1AJAABkAAAAAgUAAAALYWNjdW11bGF0ZWQFAAAAEHBvb2xWb3RlRGlmZlNXT1AKAQAAAA11c2VyVm90ZUVudHJ5AAAAAgAAAAthY2N1bXVsYXRlZAAAAAtwb29sQWRkcmVzcwQAAAAJcG9vbEluZGV4CQEAAAAFdmFsdWUAAAABCQAETwAAAAIFAAAADXBvb2xBZGRyZXNzZXMFAAAAC3Bvb2xBZGRyZXNzBAAAABN1c2VyUG9vbFZvdGVTV09QTmV3CQABkQAAAAIFAAAAEHBvb2xzVm90ZVNXT1BOZXcFAAAACXBvb2xJbmRleAkABEwAAAACCQEAAAAMSW50ZWdlckVudHJ5AAAAAgkAASwAAAACCQABLAAAAAIJAAEsAAAAAgkABCUAAAABCAUAAAABaQAAAAZjYWxsZXICAAAAAV8FAAAAC3Bvb2xBZGRyZXNzBQAAABFrVXNlclBvb2xWb3RlU1dPUAUAAAATdXNlclBvb2xWb3RlU1dPUE5ldwUAAAALYWNjdW11bGF0ZWQKAQAAAA1wb29sVm90ZUVudHJ5AAAAAgAAAAthY2N1bXVsYXRlZAAAAAtwb29sQWRkcmVzcwQAAAAJcG9vbEluZGV4CQEAAAAFdmFsdWUAAAABCQAETwAAAAIFAAAADXBvb2xBZGRyZXNzZXMFAAAAC3Bvb2xBZGRyZXNzBAAAABB1c2VyUG9vbFZvdGVTV09QCQEAAAALdmFsdWVPckVsc2UAAAACCQAEGgAAAAIFAAAABHRoaXMJAAEsAAAAAgkAASwAAAACCQABLAAAAAIJAAQlAAAAAQgFAAAAAWkAAAAGY2FsbGVyAgAAAAFfBQAAAAtwb29sQWRkcmVzcwUAAAARa1VzZXJQb29sVm90ZVNXT1AAAAAAAAAAAAAEAAAAE3VzZXJQb29sVm90ZVNXT1BOZXcJAAGRAAAAAgUAAAAQcG9vbHNWb3RlU1dPUE5ldwUAAAAJcG9vbEluZGV4BAAAABBwb29sVm90ZURpZmZTV09QCQAAZQAAAAIFAAAAE3VzZXJQb29sVm90ZVNXT1BOZXcFAAAAEHVzZXJQb29sVm90ZVNXT1AEAAAADHBvb2xWb3RlU1dPUAkBAAAAC3ZhbHVlT3JFbHNlAAAAAgkABBoAAAACBQAAAAR0aGlzCQABLAAAAAIFAAAAC3Bvb2xBZGRyZXNzBQAAAA1rUG9vbFZvdGVTV09QAAAAAAAAAAAABAAAAA9wb29sVm90ZVNXT1BuZXcJAABkAAAAAgUAAAAMcG9vbFZvdGVTV09QBQAAABBwb29sVm90ZURpZmZTV09QCQAETAAAAAIJAQAAAAxJbnRlZ2VyRW50cnkAAAACCQABLAAAAAIFAAAAC3Bvb2xBZGRyZXNzBQAAAA1rUG9vbFZvdGVTV09QBQAAAA9wb29sVm90ZVNXT1BuZXcFAAAAC2FjY3VtdWxhdGVkAwkBAAAAASEAAAABCQEAAAAUaXNDYWxsZXJJbkdvdmVybmFuY2UAAAABCAUAAAABaQAAAAZjYWxsZXIJAAACAAAAAQIAAAAqVGhpcyBhZGRyZXNzIGhhcyAwIFNXT1AgaW4gR292ZXJuYW5jZSBkQXBwBAAAAA10b3RhbFZvdGVTV09QCQEAAAALdmFsdWVPckVsc2UAAAACCQAEGgAAAAIFAAAABHRoaXMFAAAADmtUb3RhbFZvdGVTV09QAAAAAAAAAAAABAAAABF1c2VyVG90YWxWb3RlU1dPUAkBAAAAC3ZhbHVlT3JFbHNlAAAAAgkABBoAAAACBQAAAAR0aGlzCQABLAAAAAIJAAQlAAAAAQgFAAAAAWkAAAAGY2FsbGVyBQAAABJrVXNlclRvdGFsVm90ZVNXT1AAAAAAAAAAAAAEAAAAFHVzZXJTV09QaW5Hb3Zlcm5hbmNlCQEAAAARQGV4dHJOYXRpdmUoMTA1MCkAAAACBQAAAAdnb3ZBZGRyCQABLAAAAAIJAAQlAAAAAQgFAAAAAWkAAAAGY2FsbGVyAgAAAAxfU1dPUF9hbW91bnQEAAAAEHVzZXJWb3RlRGlmZlNXT1AEAAAADSRsaXN0Mjk0NzI5OTAFAAAADXBvb2xBZGRyZXNzZXMEAAAADSRzaXplMjk0NzI5OTAJAAGQAAAAAQUAAAANJGxpc3QyOTQ3Mjk5MAQAAAANJGFjYzAyOTQ3Mjk5MAAAAAAAAAAAAAMJAAAAAAAAAgUAAAANJHNpemUyOTQ3Mjk5MAAAAAAAAAAAAAUAAAANJGFjYzAyOTQ3Mjk5MAQAAAANJGFjYzEyOTQ3Mjk5MAkBAAAAEGNhbGNWb3RlRGlmZlNXT1AAAAACBQAAAA0kYWNjMDI5NDcyOTkwCQABkQAAAAIFAAAADSRsaXN0Mjk0NzI5OTAAAAAAAAAAAAADCQAAAAAAAAIFAAAADSRzaXplMjk0NzI5OTAAAAAAAAAAAAEFAAAADSRhY2MxMjk0NzI5OTAEAAAADSRhY2MyMjk0NzI5OTAJAQAAABBjYWxjVm90ZURpZmZTV09QAAAAAgUAAAANJGFjYzEyOTQ3Mjk5MAkAAZEAAAACBQAAAA0kbGlzdDI5NDcyOTkwAAAAAAAAAAABAwkAAAAAAAACBQAAAA0kc2l6ZTI5NDcyOTkwAAAAAAAAAAACBQAAAA0kYWNjMjI5NDcyOTkwBAAAAA0kYWNjMzI5NDcyOTkwCQEAAAAQY2FsY1ZvdGVEaWZmU1dPUAAAAAIFAAAADSRhY2MyMjk0NzI5OTAJAAGRAAAAAgUAAAANJGxpc3QyOTQ3Mjk5MAAAAAAAAAAAAgMJAAAAAAAAAgUAAAANJHNpemUyOTQ3Mjk5MAAAAAAAAAAAAwUAAAANJGFjYzMyOTQ3Mjk5MAQAAAANJGFjYzQyOTQ3Mjk5MAkBAAAAEGNhbGNWb3RlRGlmZlNXT1AAAAACBQAAAA0kYWNjMzI5NDcyOTkwCQABkQAAAAIFAAAADSRsaXN0Mjk0NzI5OTAAAAAAAAAAAAMDCQAAAAAAAAIFAAAADSRzaXplMjk0NzI5OTAAAAAAAAAAAAQFAAAADSRhY2M0Mjk0NzI5OTAEAAAADSRhY2M1Mjk0NzI5OTAJAQAAABBjYWxjVm90ZURpZmZTV09QAAAAAgUAAAANJGFjYzQyOTQ3Mjk5MAkAAZEAAAACBQAAAA0kbGlzdDI5NDcyOTkwAAAAAAAAAAAEAwkAAAAAAAACBQAAAA0kc2l6ZTI5NDcyOTkwAAAAAAAAAAAFBQAAAA0kYWNjNTI5NDcyOTkwBAAAAA0kYWNjNjI5NDcyOTkwCQEAAAAQY2FsY1ZvdGVEaWZmU1dPUAAAAAIFAAAADSRhY2M1Mjk0NzI5OTAJAAGRAAAAAgUAAAANJGxpc3QyOTQ3Mjk5MAAAAAAAAAAABQkAAAIAAAABAgAAABJMaXN0IHNpemUgZXhjZWVkIDUEAAAAFHVzZXJUb3RhbFZvdGVTV09QTmV3CQAAZAAAAAIFAAAAEXVzZXJUb3RhbFZvdGVTV09QBQAAABB1c2VyVm90ZURpZmZTV09QBAAAABB0b3RhbFZvdGVTV09QbmV3CQAAZAAAAAIFAAAADXRvdGFsVm90ZVNXT1AFAAAAEHVzZXJWb3RlRGlmZlNXT1ADBgkAAAIAAAABCQABLAAAAAIJAAEsAAAAAgkAASwAAAACCQABLAAAAAIJAAGkAAAAAQUAAAAQdG90YWxWb3RlU1dPUG5ldwIAAAABIAkAAaQAAAABBQAAAA10b3RhbFZvdGVTV09QAgAAAAEgCQABpAAAAAEFAAAAEHVzZXJWb3RlRGlmZlNXT1AEAAAADXVzZXJEYXRhRW50cnkEAAAADSRsaXN0MzI3MDMzMTEFAAAADXBvb2xBZGRyZXNzZXMEAAAADSRzaXplMzI3MDMzMTEJAAGQAAAAAQUAAAANJGxpc3QzMjcwMzMxMQQAAAANJGFjYzAzMjcwMzMxMQUAAAADbmlsAwkAAAAAAAACBQAAAA0kc2l6ZTMyNzAzMzExAAAAAAAAAAAABQAAAA0kYWNjMDMyNzAzMzExBAAAAA0kYWNjMTMyNzAzMzExCQEAAAANdXNlclZvdGVFbnRyeQAAAAIFAAAADSRhY2MwMzI3MDMzMTEJAAGRAAAAAgUAAAANJGxpc3QzMjcwMzMxMQAAAAAAAAAAAAMJAAAAAAAAAgUAAAANJHNpemUzMjcwMzMxMQAAAAAAAAAAAQUAAAANJGFjYzEzMjcwMzMxMQQAAAANJGFjYzIzMjcwMzMxMQkBAAAADXVzZXJWb3RlRW50cnkAAAACBQAAAA0kYWNjMTMyNzAzMzExCQABkQAAAAIFAAAADSRsaXN0MzI3MDMzMTEAAAAAAAAAAAEDCQAAAAAAAAIFAAAADSRzaXplMzI3MDMzMTEAAAAAAAAAAAIFAAAADSRhY2MyMzI3MDMzMTEEAAAADSRhY2MzMzI3MDMzMTEJAQAAAA11c2VyVm90ZUVudHJ5AAAAAgUAAAANJGFjYzIzMjcwMzMxMQkAAZEAAAACBQAAAA0kbGlzdDMyNzAzMzExAAAAAAAAAAACAwkAAAAAAAACBQAAAA0kc2l6ZTMyNzAzMzExAAAAAAAAAAADBQAAAA0kYWNjMzMyNzAzMzExBAAAAA0kYWNjNDMyNzAzMzExCQEAAAANdXNlclZvdGVFbnRyeQAAAAIFAAAADSRhY2MzMzI3MDMzMTEJAAGRAAAAAgUAAAANJGxpc3QzMjcwMzMxMQAAAAAAAAAAAwMJAAAAAAAAAgUAAAANJHNpemUzMjcwMzMxMQAAAAAAAAAABAUAAAANJGFjYzQzMjcwMzMxMQQAAAANJGFjYzUzMjcwMzMxMQkBAAAADXVzZXJWb3RlRW50cnkAAAACBQAAAA0kYWNjNDMyNzAzMzExCQABkQAAAAIFAAAADSRsaXN0MzI3MDMzMTEAAAAAAAAAAAQDCQAAAAAAAAIFAAAADSRzaXplMzI3MDMzMTEAAAAAAAAAAAUFAAAADSRhY2M1MzI3MDMzMTEEAAAADSRhY2M2MzI3MDMzMTEJAQAAAA11c2VyVm90ZUVudHJ5AAAAAgUAAAANJGFjYzUzMjcwMzMxMQkAAZEAAAACBQAAAA0kbGlzdDMyNzAzMzExAAAAAAAAAAAFCQAAAgAAAAECAAAAEkxpc3Qgc2l6ZSBleGNlZWQgNQQAAAANcG9vbERhdGFFbnRyeQQAAAANJGxpc3QzMzM2MzM3NwUAAAANcG9vbEFkZHJlc3NlcwQAAAANJHNpemUzMzM2MzM3NwkAAZAAAAABBQAAAA0kbGlzdDMzMzYzMzc3BAAAAA0kYWNjMDMzMzYzMzc3BQAAAANuaWwDCQAAAAAAAAIFAAAADSRzaXplMzMzNjMzNzcAAAAAAAAAAAAFAAAADSRhY2MwMzMzNjMzNzcEAAAADSRhY2MxMzMzNjMzNzcJAQAAAA1wb29sVm90ZUVudHJ5AAAAAgUAAAANJGFjYzAzMzM2MzM3NwkAAZEAAAACBQAAAA0kbGlzdDMzMzYzMzc3AAAAAAAAAAAAAwkAAAAAAAACBQAAAA0kc2l6ZTMzMzYzMzc3AAAAAAAAAAABBQAAAA0kYWNjMTMzMzYzMzc3BAAAAA0kYWNjMjMzMzYzMzc3CQEAAAANcG9vbFZvdGVFbnRyeQAAAAIFAAAADSRhY2MxMzMzNjMzNzcJAAGRAAAAAgUAAAANJGxpc3QzMzM2MzM3NwAAAAAAAAAAAQMJAAAAAAAAAgUAAAANJHNpemUzMzM2MzM3NwAAAAAAAAAAAgUAAAANJGFjYzIzMzM2MzM3NwQAAAANJGFjYzMzMzM2MzM3NwkBAAAADXBvb2xWb3RlRW50cnkAAAACBQAAAA0kYWNjMjMzMzYzMzc3CQABkQAAAAIFAAAADSRsaXN0MzMzNjMzNzcAAAAAAAAAAAIDCQAAAAAAAAIFAAAADSRzaXplMzMzNjMzNzcAAAAAAAAAAAMFAAAADSRhY2MzMzMzNjMzNzcEAAAADSRhY2M0MzMzNjMzNzcJAQAAAA1wb29sVm90ZUVudHJ5AAAAAgUAAAANJGFjYzMzMzM2MzM3NwkAAZEAAAACBQAAAA0kbGlzdDMzMzYzMzc3AAAAAAAAAAADAwkAAAAAAAACBQAAAA0kc2l6ZTMzMzYzMzc3AAAAAAAAAAAEBQAAAA0kYWNjNDMzMzYzMzc3BAAAAA0kYWNjNTMzMzYzMzc3CQEAAAANcG9vbFZvdGVFbnRyeQAAAAIFAAAADSRhY2M0MzMzNjMzNzcJAAGRAAAAAgUAAAANJGxpc3QzMzM2MzM3NwAAAAAAAAAABAMJAAAAAAAAAgUAAAANJHNpemUzMzM2MzM3NwAAAAAAAAAABQUAAAANJGFjYzUzMzM2MzM3NwQAAAANJGFjYzYzMzM2MzM3NwkBAAAADXBvb2xWb3RlRW50cnkAAAACBQAAAA0kYWNjNTMzMzYzMzc3CQABkQAAAAIFAAAADSRsaXN0MzMzNjMzNzcAAAAAAAAAAAUJAAACAAAAAQIAAAASTGlzdCBzaXplIGV4Y2VlZCA1AwkAAGYAAAACBQAAABR1c2VyU1dPUGluR292ZXJuYW5jZQUAAAAUdXNlclRvdGFsVm90ZVNXT1BOZXcJAAACAAAAAQkAASwAAAACCQABLAAAAAIJAAEsAAAAAgkAASwAAAACCQAEJQAAAAEFAAAABHRoaXMCAAAABSBoYXMgCQABpAAAAAEFAAAAFHVzZXJTV09QaW5Hb3Zlcm5hbmNlAgAAACdTV09QIGluIGdvdmVybmFuY2UuIE5ldyBTV09QIGluIHZvdGluZyAJAAGkAAAAAQUAAAAUdXNlclRvdGFsVm90ZVNXT1BOZXcJAAROAAAAAgkABE4AAAACBQAAAA11c2VyRGF0YUVudHJ5BQAAAA1wb29sRGF0YUVudHJ5CQAETAAAAAIJAQAAAAxJbnRlZ2VyRW50cnkAAAACCQABLAAAAAIJAAQlAAAAAQgFAAAAAWkAAAAGY2FsbGVyBQAAABJrVXNlclRvdGFsVm90ZVNXT1AFAAAAFHVzZXJUb3RhbFZvdGVTV09QTmV3CQAETAAAAAIJAQAAAAxJbnRlZ2VyRW50cnkAAAACBQAAAA5rVG90YWxWb3RlU1dPUAUAAAAQdG90YWxWb3RlU1dPUG5ldwUAAAADbmlsAAAAAGgbmsY=",
    "chainId": 84,
    "height": 1435909,
    "applicationStatus": "succeeded",
    "spentComplexity": 0
}

View: original | compacted
Prev: CGEX7wrP9sPkHo3ZUuBk1iTH3nGe4sWB3s5DSWfkJiHn
Next: HFqCVY3kVGib5gm4JsSKBMGvGbFKKVLxB8jDHsodNUHg

Diff: 
Old
New
Differences
33
33
 
            let q = valueOrElse(getInteger(this, (((toString(j.caller) + a) + "_") + i)), 0)
34
34
 
            let r = (p - q)
35
35
 
            if (true)
36
-
                then throw(toString(r))
36
+
                then throw(((toString(p) + " ") + toString(q)))
37
37
 
                else (n + r)
38
38
 
            }
39
39
 
87
87
 
                                                            then H
88
88
 
                                                            else {
89
89
 
                                                                let I = m(H, A[5])
90
-
                                                                if ((B == 6))
91
-
                                                                    then I
90
+
                                                                throw("List size exceed 5")
91
+
                                                                }
92
+
                                                        }
93
+
                                                }
94
+
                                        }
95
+
                                }
96
+
                        }
97
+
                }
98
+
            let J = (x + z)
99
+
            let K = (w + z)
100
+
            if (true)
101
+
                then throw(((((toString(K) + " ") + toString(w)) + " ") + toString(z)))
102
+
                else {
103
+
                    let L = {
104
+
                        let M = k
105
+
                        let N = size(M)
106
+
                        let O = nil
107
+
                        if ((N == 0))
108
+
                            then O
109
+
                            else {
110
+
                                let P = s(O, M[0])
111
+
                                if ((N == 1))
112
+
                                    then P
113
+
                                    else {
114
+
                                        let Q = s(P, M[1])
115
+
                                        if ((N == 2))
116
+
                                            then Q
117
+
                                            else {
118
+
                                                let R = s(Q, M[2])
119
+
                                                if ((N == 3))
120
+
                                                    then R
121
+
                                                    else {
122
+
                                                        let S = s(R, M[3])
123
+
                                                        if ((N == 4))
124
+
                                                            then S
125
+
                                                            else {
126
+
                                                                let T = s(S, M[4])
127
+
                                                                if ((N == 5))
128
+
                                                                    then T
92
129
 
                                                                    else {
93
-
                                                                        let J = m(I, A[6])
94
-
                                                                        if ((B == 7))
95
-
                                                                            then J
96
-
                                                                            else {
97
-
                                                                                let K = m(J, A[7])
98
-
                                                                                if ((B == 8))
99
-
                                                                                    then K
100
-
                                                                                    else {
101
-
                                                                                        let L = m(K, A[8])
102
-
                                                                                        throw("List size exceed 8")
103
-
                                                                                        }
104
-
                                                                                }
130
+
                                                                        let U = s(T, M[5])
131
+
                                                                        throw("List size exceed 5")
105
132
 
                                                                        }
106
133
 
                                                                }
107
134
 
                                                        }
109
136
 
                                        }
110
137
 
                                }
111
138
 
                        }
112
-
                }
113
-
            let M = (x + z)
114
-
            let N = (w + z)
115
-
            if (true)
116
-
                then throw(((((toString(N) + " ") + toString(w)) + " ") + toString(z)))
117
-
                else {
118
-
                    let O = {
119
-
                        let P = k
120
-
                        let Q = size(P)
121
-
                        let R = nil
122
-
                        if ((Q == 0))
123
-
                            then R
139
+
                    let V = {
140
+
                        let W = k
141
+
                        let X = size(W)
142
+
                        let Y = nil
143
+
                        if ((X == 0))
144
+
                            then Y
124
145
 
                            else {
125
-
                                let S = s(R, P[0])
126
-
                                if ((Q == 1))
127
-
                                    then S
146
+
                                let Z = t(Y, W[0])
147
+
                                if ((X == 1))
148
+
                                    then Z
128
149
 
                                    else {
129
-
                                        let T = s(S, P[1])
130
-
                                        if ((Q == 2))
131
-
                                            then T
150
+
                                        let aa = t(Z, W[1])
151
+
                                        if ((X == 2))
152
+
                                            then aa
132
153
 
                                            else {
133
-
                                                let U = s(T, P[2])
134
-
                                                if ((Q == 3))
135
-
                                                    then U
154
+
                                                let ab = t(aa, W[2])
155
+
                                                if ((X == 3))
156
+
                                                    then ab
136
157
 
                                                    else {
137
-
                                                        let V = s(U, P[3])
138
-
                                                        if ((Q == 4))
139
-
                                                            then V
158
+
                                                        let ac = t(ab, W[3])
159
+
                                                        if ((X == 4))
160
+
                                                            then ac
140
161
 
                                                            else {
141
-
                                                                let W = s(V, P[4])
142
-
                                                                if ((Q == 5))
143
-
                                                                    then W
162
+
                                                                let ad = t(ac, W[4])
163
+
                                                                if ((X == 5))
164
+
                                                                    then ad
144
165
 
                                                                    else {
145
-
                                                                        let X = s(W, P[5])
146
-
                                                                        if ((Q == 6))
147
-
                                                                            then X
148
-
                                                                            else {
149
-
                                                                                let Y = s(X, P[6])
150
-
                                                                                if ((Q == 7))
151
-
                                                                                    then Y
152
-
                                                                                    else {
153
-
                                                                                        let Z = s(Y, P[7])
154
-
                                                                                        if ((Q == 8))
155
-
                                                                                            then Z
156
-
                                                                                            else {
157
-
                                                                                                let aa = s(Z, P[8])
158
-
                                                                                                throw("List size exceed 8")
159
-
                                                                                                }
160
-
                                                                                        }
161
-
                                                                                }
166
+
                                                                        let ae = t(ad, W[5])
167
+
                                                                        throw("List size exceed 5")
162
168
 
                                                                        }
163
169
 
                                                                }
164
170
 
                                                        }
166
172
 
                                        }
167
173
 
                                }
168
174
 
                        }
169
-
                    let ab = {
170
-
                        let ac = k
171
-
                        let ad = size(ac)
172
-
                        let ae = nil
173
-
                        if ((ad == 0))
174
-
                            then ae
175
-
                            else {
176
-
                                let af = t(ae, ac[0])
177
-
                                if ((ad == 1))
178
-
                                    then af
179
-
                                    else {
180
-
                                        let ag = t(af, ac[1])
181
-
                                        if ((ad == 2))
182
-
                                            then ag
183
-
                                            else {
184
-
                                                let ah = t(ag, ac[2])
185
-
                                                if ((ad == 3))
186
-
                                                    then ah
187
-
                                                    else {
188
-
                                                        let ai = t(ah, ac[3])
189
-
                                                        if ((ad == 4))
190
-
                                                            then ai
191
-
                                                            else {
192
-
                                                                let aj = t(ai, ac[4])
193
-
                                                                if ((ad == 5))
194
-
                                                                    then aj
195
-
                                                                    else {
196
-
                                                                        let ak = t(aj, ac[5])
197
-
                                                                        if ((ad == 6))
198
-
                                                                            then ak
199
-
                                                                            else {
200
-
                                                                                let al = t(ak, ac[6])
201
-
                                                                                if ((ad == 7))
202
-
                                                                                    then al
203
-
                                                                                    else {
204
-
                                                                                        let am = t(al, ac[7])
205
-
                                                                                        if ((ad == 8))
206
-
                                                                                            then am
207
-
                                                                                            else {
208
-
                                                                                                let an = t(am, ac[8])
209
-
                                                                                                throw("List size exceed 8")
210
-
                                                                                                }
211
-
                                                                                        }
212
-
                                                                                }
213
-
                                                                        }
214
-
                                                                }
215
-
                                                        }
216
-
                                                }
217
-
                                        }
218
-
                                }
219
-
                        }
220
-
                    if ((y > M))
221
-
                        then throw(((((toString(this) + " has ") + toString(y)) + "SWOP in governance. New SWOP in voting ") + toString(M)))
222
-
                        else ((O ++ ab) ++ [IntegerEntry((toString(j.caller) + b), M), IntegerEntry(d, N)])
175
+
                    if ((y > J))
176
+
                        then throw(((((toString(this) + " has ") + toString(y)) + "SWOP in governance. New SWOP in voting ") + toString(J)))
177
+
                        else ((L ++ V) ++ [IntegerEntry((toString(j.caller) + b), J), IntegerEntry(d, K)])
223
178
 
                    }
224
179
 
            }
225
180
 
    }
Full: 
Old
New
Differences
1
1
 
{-# STDLIB_VERSION 4 #-}
2
2
 
{-# SCRIPT_TYPE ACCOUNT #-}
3
3
 
{-# CONTENT_TYPE DAPP #-}
4
4
 
let a = "_vote"
5
5
 
6
6
 
let b = "_user_total_SWOP_vote"
7
7
 
8
8
 
let c = "_vote_SWOP"
9
9
 
10
10
 
let d = "total_vote_SWOP"
11
11
 
12
12
 
let e = Address(base58'3MumyD14hrRb2Vj3HAifsnCcUpsELAZWxAE')
13
13
 
14
14
 
func f (g) = if (if ((valueOrElse(getInteger(e, (toString(g) + "_SWOP_amount")), 0) > 0))
15
15
 
    then true
16
16
 
    else (valueOrElse(getInteger(this, (toString(g) + b)), 0) > 0))
17
17
 
    then true
18
18
 
    else false
19
19
 
20
20
 
21
21
 
func h (i) = if ((valueOrElse(getInteger(e, (i + "_current_pool_fraction_reward")), 0) > 0))
22
22
 
    then true
23
23
 
    else false
24
24
 
25
25
 
26
26
 
@Callable(j)
27
27
 
func votePoolWeight (k,l) = {
28
28
 
    func m (n,i) =     if (!(h(i)))
29
29
 
        then throw("This pool has no _current_pool_fraction_reward in Governance dApp")
30
30
 
        else {
31
31
 
            let o = value(indexOf(k, i))
32
32
 
            let p = l[o]
33
33
 
            let q = valueOrElse(getInteger(this, (((toString(j.caller) + a) + "_") + i)), 0)
34
34
 
            let r = (p - q)
35
35
 
            if (true)
36
-
                then throw(toString(r))
36
+
                then throw(((toString(p) + " ") + toString(q)))
37
37
 
                else (n + r)
38
38
 
            }
39
39
 
40
40
 
    func s (n,i) =     {
41
41
 
        let o = value(indexOf(k, i))
42
42
 
        let p = l[o]
43
43
 
IntegerEntry((((toString(j.caller) + "_") + i) + a), p) :: n
44
44
 
        }
45
45
 
46
46
 
    func t (n,i) =     {
47
47
 
        let o = value(indexOf(k, i))
48
48
 
        let q = valueOrElse(getInteger(this, (((toString(j.caller) + "_") + i) + a)), 0)
49
49
 
        let p = l[o]
50
50
 
        let r = (p - q)
51
51
 
        let u = valueOrElse(getInteger(this, (i + c)), 0)
52
52
 
        let v = (u + r)
53
53
 
IntegerEntry((i + c), v) :: n
54
54
 
        }
55
55
 
56
56
 
    if (!(f(j.caller)))
57
57
 
        then throw("This address has 0 SWOP in Governance dApp")
58
58
 
        else {
59
59
 
            let w = valueOrElse(getInteger(this, d), 0)
60
60
 
            let x = valueOrElse(getInteger(this, (toString(j.caller) + b)), 0)
61
61
 
            let y = getIntegerValue(e, (toString(j.caller) + "_SWOP_amount"))
62
62
 
            let z = {
63
63
 
                let A = k
64
64
 
                let B = size(A)
65
65
 
                let C = 0
66
66
 
                if ((B == 0))
67
67
 
                    then C
68
68
 
                    else {
69
69
 
                        let D = m(C, A[0])
70
70
 
                        if ((B == 1))
71
71
 
                            then D
72
72
 
                            else {
73
73
 
                                let E = m(D, A[1])
74
74
 
                                if ((B == 2))
75
75
 
                                    then E
76
76
 
                                    else {
77
77
 
                                        let F = m(E, A[2])
78
78
 
                                        if ((B == 3))
79
79
 
                                            then F
80
80
 
                                            else {
81
81
 
                                                let G = m(F, A[3])
82
82
 
                                                if ((B == 4))
83
83
 
                                                    then G
84
84
 
                                                    else {
85
85
 
                                                        let H = m(G, A[4])
86
86
 
                                                        if ((B == 5))
87
87
 
                                                            then H
88
88
 
                                                            else {
89
89
 
                                                                let I = m(H, A[5])
90
-
                                                                if ((B == 6))
91
-
                                                                    then I
90
+
                                                                throw("List size exceed 5")
91
+
                                                                }
92
+
                                                        }
93
+
                                                }
94
+
                                        }
95
+
                                }
96
+
                        }
97
+
                }
98
+
            let J = (x + z)
99
+
            let K = (w + z)
100
+
            if (true)
101
+
                then throw(((((toString(K) + " ") + toString(w)) + " ") + toString(z)))
102
+
                else {
103
+
                    let L = {
104
+
                        let M = k
105
+
                        let N = size(M)
106
+
                        let O = nil
107
+
                        if ((N == 0))
108
+
                            then O
109
+
                            else {
110
+
                                let P = s(O, M[0])
111
+
                                if ((N == 1))
112
+
                                    then P
113
+
                                    else {
114
+
                                        let Q = s(P, M[1])
115
+
                                        if ((N == 2))
116
+
                                            then Q
117
+
                                            else {
118
+
                                                let R = s(Q, M[2])
119
+
                                                if ((N == 3))
120
+
                                                    then R
121
+
                                                    else {
122
+
                                                        let S = s(R, M[3])
123
+
                                                        if ((N == 4))
124
+
                                                            then S
125
+
                                                            else {
126
+
                                                                let T = s(S, M[4])
127
+
                                                                if ((N == 5))
128
+
                                                                    then T
92
129
 
                                                                    else {
93
-
                                                                        let J = m(I, A[6])
94
-
                                                                        if ((B == 7))
95
-
                                                                            then J
96
-
                                                                            else {
97
-
                                                                                let K = m(J, A[7])
98
-
                                                                                if ((B == 8))
99
-
                                                                                    then K
100
-
                                                                                    else {
101
-
                                                                                        let L = m(K, A[8])
102
-
                                                                                        throw("List size exceed 8")
103
-
                                                                                        }
104
-
                                                                                }
130
+
                                                                        let U = s(T, M[5])
131
+
                                                                        throw("List size exceed 5")
105
132
 
                                                                        }
106
133
 
                                                                }
107
134
 
                                                        }
108
135
 
                                                }
109
136
 
                                        }
110
137
 
                                }
111
138
 
                        }
112
-
                }
113
-
            let M = (x + z)
114
-
            let N = (w + z)
115
-
            if (true)
116
-
                then throw(((((toString(N) + " ") + toString(w)) + " ") + toString(z)))
117
-
                else {
118
-
                    let O = {
119
-
                        let P = k
120
-
                        let Q = size(P)
121
-
                        let R = nil
122
-
                        if ((Q == 0))
123
-
                            then R
139
+
                    let V = {
140
+
                        let W = k
141
+
                        let X = size(W)
142
+
                        let Y = nil
143
+
                        if ((X == 0))
144
+
                            then Y
124
145
 
                            else {
125
-
                                let S = s(R, P[0])
126
-
                                if ((Q == 1))
127
-
                                    then S
146
+
                                let Z = t(Y, W[0])
147
+
                                if ((X == 1))
148
+
                                    then Z
128
149
 
                                    else {
129
-
                                        let T = s(S, P[1])
130
-
                                        if ((Q == 2))
131
-
                                            then T
150
+
                                        let aa = t(Z, W[1])
151
+
                                        if ((X == 2))
152
+
                                            then aa
132
153
 
                                            else {
133
-
                                                let U = s(T, P[2])
134
-
                                                if ((Q == 3))
135
-
                                                    then U
154
+
                                                let ab = t(aa, W[2])
155
+
                                                if ((X == 3))
156
+
                                                    then ab
136
157
 
                                                    else {
137
-
                                                        let V = s(U, P[3])
138
-
                                                        if ((Q == 4))
139
-
                                                            then V
158
+
                                                        let ac = t(ab, W[3])
159
+
                                                        if ((X == 4))
160
+
                                                            then ac
140
161
 
                                                            else {
141
-
                                                                let W = s(V, P[4])
142
-
                                                                if ((Q == 5))
143
-
                                                                    then W
162
+
                                                                let ad = t(ac, W[4])
163
+
                                                                if ((X == 5))
164
+
                                                                    then ad
144
165
 
                                                                    else {
145
-
                                                                        let X = s(W, P[5])
146
-
                                                                        if ((Q == 6))
147
-
                                                                            then X
148
-
                                                                            else {
149
-
                                                                                let Y = s(X, P[6])
150
-
                                                                                if ((Q == 7))
151
-
                                                                                    then Y
152
-
                                                                                    else {
153
-
                                                                                        let Z = s(Y, P[7])
154
-
                                                                                        if ((Q == 8))
155
-
                                                                                            then Z
156
-
                                                                                            else {
157
-
                                                                                                let aa = s(Z, P[8])
158
-
                                                                                                throw("List size exceed 8")
159
-
                                                                                                }
160
-
                                                                                        }
161
-
                                                                                }
166
+
                                                                        let ae = t(ad, W[5])
167
+
                                                                        throw("List size exceed 5")
162
168
 
                                                                        }
163
169
 
                                                                }
164
170
 
                                                        }
165
171
 
                                                }
166
172
 
                                        }
167
173
 
                                }
168
174
 
                        }
169
-
                    let ab = {
170
-
                        let ac = k
171
-
                        let ad = size(ac)
172
-
                        let ae = nil
173
-
                        if ((ad == 0))
174
-
                            then ae
175
-
                            else {
176
-
                                let af = t(ae, ac[0])
177
-
                                if ((ad == 1))
178
-
                                    then af
179
-
                                    else {
180
-
                                        let ag = t(af, ac[1])
181
-
                                        if ((ad == 2))
182
-
                                            then ag
183
-
                                            else {
184
-
                                                let ah = t(ag, ac[2])
185
-
                                                if ((ad == 3))
186
-
                                                    then ah
187
-
                                                    else {
188
-
                                                        let ai = t(ah, ac[3])
189
-
                                                        if ((ad == 4))
190
-
                                                            then ai
191
-
                                                            else {
192
-
                                                                let aj = t(ai, ac[4])
193
-
                                                                if ((ad == 5))
194
-
                                                                    then aj
195
-
                                                                    else {
196
-
                                                                        let ak = t(aj, ac[5])
197
-
                                                                        if ((ad == 6))
198
-
                                                                            then ak
199
-
                                                                            else {
200
-
                                                                                let al = t(ak, ac[6])
201
-
                                                                                if ((ad == 7))
202
-
                                                                                    then al
203
-
                                                                                    else {
204
-
                                                                                        let am = t(al, ac[7])
205
-
                                                                                        if ((ad == 8))
206
-
                                                                                            then am
207
-
                                                                                            else {
208
-
                                                                                                let an = t(am, ac[8])
209
-
                                                                                                throw("List size exceed 8")
210
-
                                                                                                }
211
-
                                                                                        }
212
-
                                                                                }
213
-
                                                                        }
214
-
                                                                }
215
-
                                                        }
216
-
                                                }
217
-
                                        }
218
-
                                }
219
-
                        }
220
-
                    if ((y > M))
221
-
                        then throw(((((toString(this) + " has ") + toString(y)) + "SWOP in governance. New SWOP in voting ") + toString(M)))
222
-
                        else ((O ++ ab) ++ [IntegerEntry((toString(j.caller) + b), M), IntegerEntry(d, N)])
175
+
                    if ((y > J))
176
+
                        then throw(((((toString(this) + " has ") + toString(y)) + "SWOP in governance. New SWOP in voting ") + toString(J)))
177
+
                        else ((L ++ V) ++ [IntegerEntry((toString(j.caller) + b), J), IntegerEntry(d, K)])
223
178
 
                    }
224
179
 
            }
225
180
 
    }
226
181
 
227
182
 

github/deemru/w8io/169f3d6 
67.15 ms ◑