prettier-plugin-solidity/tests/format/IndexOf/__snapshots__/format.test.js.snap at a48c29a3252b1f5e442c1bd2dc5198d060a976ae · prettier-solidity/prettier-plugin-solidity · GitHub

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
// Jest Snapshot v1, https://jestjs.io/docs/snapshot-testing

exports[`IndexOf.sol - {"compiler":"0.4.26"} format 1`] = `
====================================options=====================================
compiler: "0.4.26"
parsers: ["slang"]
printWidth: 80
                                                                                | printWidth
=====================================input======================================
contract IndexOf {

    address creator;

    function IndexOf()
    {
        creator = msg.sender;
    }

    int whatwastheval = -10; // -2 = not yet tested, as separate from -1, tested but error

    function indexOf(string _a, string _b) returns (int) // _a = string to search, _b = string we want to find
    {
    	bytes memory a = bytes(_a);
        bytes memory b = bytes(_b);

    	if(a.length < 1 || b.length < 1 || (b.length > a.length))
    	{
    		whatwastheval = -1;
    		return -1;
    	}
    	else if(a.length > (2**128 -1)) // since we have to be able to return -1 (if the char isn't found or input error), this function must return an "int" type with a max length of (2^128 - 1)
    	{
    		whatwastheval = -1;
    		return -1;
    	}
    	else
    	{
    		uint subindex = 0;
    		for (uint i = 0; i < a.length; i ++)
    		{
    			if (a[i] == b[0]) // found the first char of b
    			{
    				subindex = 1;
    				while(subindex < b.length && (i + subindex) < a.length && a[i + subindex] == b[subindex]) // search until the chars don't match or until we reach the end of a or b
    				{
    					subindex++;
    				}
    				if(subindex == b.length)
    				{
    					whatwastheval = int(i);
    					return int(i);
    				}
    			}
    		}
    		whatwastheval = -1;
    		return -1;
    	}
    }

    function whatWasTheVal() constant returns (int)
    {
    	return whatwastheval;
    }

    /**********
     Standard kill() function to recover funds
     **********/

    function kill()
    {
        if (msg.sender == creator)
        {
            suicide(creator);  // kills this contract and sends remaining funds back to creator
        }
    }
}

=====================================output=====================================
contract IndexOf {
    address creator;

    function IndexOf() {
        creator = msg.sender;
    }

    int whatwastheval = -10; // -2 = not yet tested, as separate from -1, tested but error

    function indexOf(
        string _a,
        string _b
    )
        returns (int) // _a = string to search, _b = string we want to find
    {
        bytes memory a = bytes(_a);
        bytes memory b = bytes(_b);

        if (a.length < 1 || b.length < 1 || (b.length > a.length)) {
            whatwastheval = -1;
            return -1;
        } else if (a.length > (2 ** 128 - 1)) {
            // since we have to be able to return -1 (if the char isn't found or input error), this function must return an "int" type with a max length of (2^128 - 1)
            whatwastheval = -1;
            return -1;
        } else {
            uint subindex = 0;
            for (uint i = 0; i < a.length; i++) {
                if (a[i] == b[0]) {
                    // found the first char of b
                    subindex = 1;
                    while (
                        subindex < b.length &&
                        (i + subindex) < a.length &&
                        a[i + subindex] == b[subindex] // search until the chars don't match or until we reach the end of a or b
                    ) {
                        subindex++;
                    }
                    if (subindex == b.length) {
                        whatwastheval = int(i);
                        return int(i);
                    }
                }
            }
            whatwastheval = -1;
            return -1;
        }
    }

    function whatWasTheVal() constant returns (int) {
        return whatwastheval;
    }

    /**********
     Standard kill() function to recover funds
     **********/

    function kill() {
        if (msg.sender == creator) {
            suicide(creator); // kills this contract and sends remaining funds back to creator
        }
    }
}

================================================================================
`;