2018年 8月の投稿一覧

2018.08.28

Promise.all()は本当に並列処理しているのか

⇒Promise.all()は本当に並列処理している

main();

function main() {
  const p = console.log;
  const getTimeoutPromise = timespan_ms => {
    return new Promise(resolve => {
      setTimeout(() => {
        resolve("timespan_ms : " + timespan_ms);
      }, timespan_ms);
    });
  };
  const sub = () => {
    const ps = [];
    ps.push(getTimeoutPromise(50));
    ps.push(getTimeoutPromise(40));
    ps.push(getTimeoutPromise(100));
    ps.push(getTimeoutPromise(30));
    ps.push(getTimeoutPromise(20));
    ps.push(getTimeoutPromise(10));

    const start = new Date();
    new Promise(resolve => {
      Promise.all(ps).then(results => {
        resolve(results);
      });
    }).then(result => {
      p(result);
      const end = new Date();
      const timelapse = end.getTime() - start.getTime();
      p("timelapse : " + timelapse + "[ms]");
    });
  };
  sub();
}

main();

function main() {

const p = console.log;

const getTimeoutPromise = timespan_ms => {

return new Promise(resolve => {

setTimeout(() => {

resolve("timespan_ms : " + timespan_ms);

}, timespan_ms);

});

};

const sub = () => {

const ps = [];

ps.push(getTimeoutPromise(50));

ps.push(getTimeoutPromise(40));

ps.push(getTimeoutPromise(100));

ps.push(getTimeoutPromise(30));

ps.push(getTimeoutPromise(20));

ps.push(getTimeoutPromise(10));

const start = new Date();

new Promise(resolve => {

Promise.all(ps).then(results => {

resolve(results);

});

}).then(result => {

p(result);

const end = new Date();

const timelapse = end.getTime() - start.getTime();

p("timelapse : " + timelapse + "[ms]");

});

};

sub();

}

[ 'timespan_ms : 50',
  'timespan_ms : 40',
  'timespan_ms : 100',
  'timespan_ms : 30',
  'timespan_ms : 20',
  'timespan_ms : 10' ]
timelapse : 103[ms]

[ 'timespan_ms : 50',

'timespan_ms : 40',

'timespan_ms : 100',

'timespan_ms : 30',

'timespan_ms : 20',

'timespan_ms : 10' ]

timelapse : 103[ms]

2018.08.26

60％を3回試行と80%を2回試行ではどちらの期待値が高いか

~~60％を3回の方が高い~~
すみません、80％を2回の方が高いです。答えの見方を間違えておりました。
本件の最新記事はこちらです。

60％を3回試行と80%を2回試行ではどちらの期待値が高いか→80%を2回の方が高い

// 60％の成功率を3回チャレンジして2回以上成功する確率を教えて下さいヾ(｡>д<)ﾉ
main();

function main() {
  const p = console.log;
  const probabilityOf = n => Math.random() * 100 < n;
  const challenge = (percent, limit, targetCnt, isBool = false) => {
    let cnt = 0;
    for (let i = 0; i < limit; i++) {
      if (probabilityOf(percent)) {
        if (isBool) {
          return true;
        }
        cnt++;
      }
    }
    if (isBool) {
      if (cnt === 0) {
        return false;
      }
    }
    return targetCnt <= cnt;
  };
  const calcProportion = (percent, limit, times) => {
    let cnt = 0;
    for (let i = 0; i < times; i++) {
      if (challenge(percent, limit, 1, true)) {
        cnt++;
      }
    }
    const proportion = cnt * 100.0 / times;
    return proportion;
  };
  const dispProportion = (percent, limit, times) => {
    const proportion = calcProportion(percent, limit, times);
    let msg = percent + "% に" + limit + "回 挑戦して成功する割合 " + proportion + "% (" + times + "回試行)";
    p(msg);
  };
  const calcHitCnt = (percent, limit) => {
    let cnt = 0;
    for (let i = 0; i < limit; i++) {
      if (probabilityOf(percent)) {
        cnt++;
      }
    }
    return cnt;
  };
  const calcExpectedValue = (percent, limit, times) => {
    let cnt = 0;
    for (let i = 0; i < times; i++) {
      cnt += calcHitCnt(percent, limit);
    }
    expectedValue = cnt / times;
    return expectedValue;
  };
  const dispExpectedValue = (percent, limit, times) => {
    const expectedValue = calcExpectedValue(percent, limit, times);
    let msg = percent + "% に" + limit + "回 挑戦した時の期待値 " + expectedValue + "% (" + times + "回試行)";
    p(msg);
  };

  const times = 2000000;
  let percent = 60.0;
  let limit = 3;
  dispExpectedValue(percent, limit, times);
  percent = 80.0;
  limit = 2;
  dispExpectedValue(percent, limit, times);
}

// 60％の成功率を3回チャレンジして2回以上成功する確率を教えて下さいヾ(｡>д<)ﾉ

main();

function main() {

const p = console.log;

const probabilityOf = n => Math.random() * 100 < n;

const challenge = (percent, limit, targetCnt, isBool = false) => {

let cnt = 0;

for (let i = 0; i < limit; i++) {

if (probabilityOf(percent)) {

if (isBool) {

return true;

}

cnt++;

}

if (isBool) {

if (cnt === 0) {

return false;

}

return targetCnt <= cnt;

};

const calcProportion = (percent, limit, times) => {

let cnt = 0;

for (let i = 0; i < times; i++) {

if (challenge(percent, limit, 1, true)) {

cnt++;

}

const proportion = cnt * 100.0 / times;

return proportion;

};

const dispProportion = (percent, limit, times) => {

const proportion = calcProportion(percent, limit, times);

let msg = percent + "% に" + limit + "回挑戦して成功する割合 " + proportion + "% (" + times + "回試行)";

p(msg);

};

const calcHitCnt = (percent, limit) => {

let cnt = 0;

for (let i = 0; i < limit; i++) {

if (probabilityOf(percent)) {

cnt++;

}

return cnt;

};

const calcExpectedValue = (percent, limit, times) => {

let cnt = 0;

for (let i = 0; i < times; i++) {

cnt += calcHitCnt(percent, limit);

}

expectedValue = cnt / times;

return expectedValue;

};

const dispExpectedValue = (percent, limit, times) => {

const expectedValue = calcExpectedValue(percent, limit, times);

let msg = percent + "% に" + limit + "回挑戦した時の期待値 " + expectedValue + "% (" + times + "回試行)";

p(msg);

};

const times = 2000000;

let percent = 60.0;

let limit = 3;

dispExpectedValue(percent, limit, times);

percent = 80.0;

limit = 2;

dispExpectedValue(percent, limit, times);

}

60% に3回 挑戦した時の期待値 1.800217% (2000000回試行)
80% に2回 挑戦した時の期待値 1.600028% (2000000回試行)

1 2	60% に3回挑戦した時の期待値 1.800217% (2000000回試行) 80% に2回挑戦した時の期待値 1.600028% (2000000回試行)

2018.08.25

indexの宣言がletかvarかで結果が変わる件を難しく書いた

jsらしい気がする。

const main = () => {
  const p = console.log;
  const copyFromBtoA = (a, b) => {
    for (const k of Object.keys(b)) {
      const v = b[k];
      a[k] = v;
    }
  };
  const getPromiseArr_let = () => {
    const ps = [];
    for (let i = 0; i < 5; i++) {
      ps.push(new Promise(resolve => {
        setTimeout(() => {
          resolve(i);
        }, 0);
      }));
    }
    return ps;
  };
  const getPromiseArr_var = () => {
    const ps = [];
    for (var i = 0; i < 5; i++) {
      ps.push(new Promise(resolve => {
        setTimeout(() => {
          resolve(i);
        }, 0);
      }));
    }
    return ps;
  };
  const doPromiseAll = (ps, func) => {
    Promise.all(ps).then(results => {
      func(results);
    });
  };
  const sub = () => {
    const psLet = [];
    const psVar = [];
    copyFromBtoA(psLet, getPromiseArr_let());
    copyFromBtoA(psVar, getPromiseArr_var());
    doPromiseAll(psLet, p);
    doPromiseAll(psVar, p);
  };
  sub();
};
main();

const main = () => {

const p = console.log;

const copyFromBtoA = (a, b) => {

for (const k of Object.keys(b)) {

const v = b[k];

a[k] = v;

}

};

const getPromiseArr_let = () => {

const ps = [];

for (let i = 0; i < 5; i++) {

ps.push(new Promise(resolve => {

setTimeout(() => {

resolve(i);

}, 0);

}));

}

return ps;

};

const getPromiseArr_var = () => {

const ps = [];

for (var i = 0; i < 5; i++) {

ps.push(new Promise(resolve => {

setTimeout(() => {

resolve(i);

}, 0);

}));

}

return ps;

};

const doPromiseAll = (ps, func) => {

Promise.all(ps).then(results => {

func(results);

});

};

const sub = () => {

const psLet = [];

const psVar = [];

copyFromBtoA(psLet, getPromiseArr_let());

copyFromBtoA(psVar, getPromiseArr_var());

doPromiseAll(psLet, p);

doPromiseAll(psVar, p);

};

sub();

};

main();

[ 0, 1, 2, 3, 4 ]
[ 5, 5, 5, 5, 5 ]

1 2	[ 0, 1, 2, 3, 4 ] [ 5, 5, 5, 5, 5 ]

2018.08.24

ループとコールバックの問題(varとletで結果が変わる)

非同期処理を実行するfor文で使うindexの宣言をvarでするかletでするかで、するかだけで結果が変わる。
こんなの難しすぎる。

const main_idxVar = () => {
  var ps = [];
  for (var i = 0; i < 5; i++) {
    ps.push(new Promise(resolve => {
      setTimeout(() => {
        resolve(i);
      }, 0);
    }));
  }
  Promise.all(ps).then(values => {
    console.log(values);
  });
};
const main_idxLet = () => {
  var ps = [];
  var len = 5;
  for (let i = 0; i < 5; i++) {
    ps.push(new Promise(resolve => {
      setTimeout(() => {
        resolve(i);
      }, 0);
    }));
  }
  Promise.all(ps).then(values => {
    console.log(values);
  });
};
main_idxVar();
main_idxLet();

const main_idxVar = () => {

var ps = [];

for (var i = 0; i < 5; i++) {

ps.push(new Promise(resolve => {

setTimeout(() => {

resolve(i);

}, 0);

}));

}

Promise.all(ps).then(values => {

console.log(values);

});

};

const main_idxLet = () => {

var ps = [];

var len = 5;

for (let i = 0; i < 5; i++) {

ps.push(new Promise(resolve => {

setTimeout(() => {

resolve(i);

}, 0);

}));

}

Promise.all(ps).then(values => {

console.log(values);

});

};

main_idxVar();

main_idxLet();

[ 5, 5, 5, 5, 5 ]
[ 0, 1, 2, 3, 4 ]

1 2	[ 5, 5, 5, 5, 5 ] [ 0, 1, 2, 3, 4 ]

2018.08.22

その年最初の落雷が起こった日の統計

1年間に平均12回雷が落ちる街がある。
1日あたりの落雷の発生確率を3.29%とすると、
その年最初の落雷が起こった日となる確率は、1月1日から数えて何日がいちばん高いか。

こたえ：1月1日

const p = console.log;
const probabilityOf = (percent) => {
  percent = Number(percent);
  if (Math.random() * 100 < percent) {
    return true;
  }
  return false;
};
const calcFirstDay = (percent) => {
  percent = Number(percent);
  if (percent <= 0) {
    p("invalid percent : " + percent);
    return -1;
  }
  let cnt = 0;
  while (true) {
    cnt++;
    if (probabilityOf(percent)) {
      return cnt;
    }
  }
};
const calcCntOfYear = (percent) => {
  let cnt = 0;
  for (let i = 0; i < 365; i++) {
    if (probabilityOf(percent)) {
      cnt++;
    }
  }
  return cnt;
};
const calcAverage = (a) => {
  let sum = 0;
  for (const n of a) {
    sum += n;
  }
  return sum / a.length;
};
const zeroPadding = (NUM, LEN) => {
  return (Array(LEN).join('0') + NUM).slice(-LEN);
};
const spacePadding = (NUM, LEN) => {
  return (Array(LEN).join(' ') + NUM).slice(-LEN);
};
const dispLine = (k, v, per = 1) => {
  let l = "";
  v = v * 1.0 / per;
  for (let i = 0; i < v; i++) {
    l += ".";
  }
  k = spacePadding(k, 3);
  p(k + " : " + l);
};
const dispChart = (a, per = 1) => {
  for (const k of Object.keys(a)) {
    const v = a[k];
    dispLine(k, v, per);
  }
};
const scoreFirstDay = [];
const percent = 3.29;
const times = 100000;
for (let i = 0; i < times; i++) {
  const fd = calcFirstDay(percent);
  if (scoreFirstDay[fd] === undefined) {
    scoreFirstDay[fd] = 1;
  } else {
    scoreFirstDay[fd] += 1;
  }
}

p("その年最初の落雷が起こった日の統計");
p();
p("1日あたりの落雷が起こる確率 : " + percent + "%");
p("観測年数 : " + times + "年");
p();
p("[日/年数(30分の1)]");

dispChart(scoreFirstDay, 30);

const p = console.log;

const probabilityOf = (percent) => {

percent = Number(percent);

if (Math.random() * 100 < percent) {

return true;

}

return false;

};

const calcFirstDay = (percent) => {

percent = Number(percent);

if (percent <= 0) {

p("invalid percent : " + percent);

return -1;

}

let cnt = 0;

while (true) {

cnt++;

if (probabilityOf(percent)) {

return cnt;

}

};

const calcCntOfYear = (percent) => {

let cnt = 0;

for (let i = 0; i < 365; i++) {

if (probabilityOf(percent)) {

cnt++;

}

return cnt;

};

const calcAverage = (a) => {

let sum = 0;

for (const n of a) {

sum += n;

}

return sum / a.length;

};

const zeroPadding = (NUM, LEN) => {

return (Array(LEN).join('0') + NUM).slice(-LEN);

};

const spacePadding = (NUM, LEN) => {

return (Array(LEN).join(' ') + NUM).slice(-LEN);

};

const dispLine = (k, v, per = 1) => {

let l = "";

v = v * 1.0 / per;

for (let i = 0; i < v; i++) {

l += ".";

}

k = spacePadding(k, 3);

p(k + " : " + l);

};

const dispChart = (a, per = 1) => {

for (const k of Object.keys(a)) {

const v = a[k];

dispLine(k, v, per);

}

};

const scoreFirstDay = [];

const percent = 3.29;

const times = 100000;

for (let i = 0; i < times; i++) {

const fd = calcFirstDay(percent);

if (scoreFirstDay[fd] === undefined) {

scoreFirstDay[fd] = 1;

} else {

scoreFirstDay[fd] += 1;

}

p("その年最初の落雷が起こった日の統計");

p();

p("1日あたりの落雷が起こる確率 : " + percent + "%");

p("観測年数 : " + times + "年");

p();

p("[日/年数(30分の1)]");

dispChart(scoreFirstDay, 30);

その年最初の落雷が起こった日の統計

1日あたりの落雷が起こる確率 : 3.29%
観測年数 : 100000年

[日/年数(30分の1)]
  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 : .
212 : .
213 : .
214 : .
216 : .
217 : .
218 : .
219 : .
220 : .
221 : .
223 : .
224 : .
226 : .
227 : .
229 : .
230 : .
231 : .
232 : .
234 : .
235 : .
237 : .
238 : .
239 : .
240 : .
241 : .
242 : .
243 : .
244 : .
245 : .
248 : .
249 : .
251 : .
252 : .
253 : .
255 : .
256 : .
257 : .
258 : .
262 : .
265 : .
271 : .
277 : .
279 : .
280 : .
291 : .
294 : .
300 : .
305 : .
413 : .

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

その年最初の落雷が起こった日の統計

1日あたりの落雷が起こる確率 : 3.29%

観測年数 : 100000年

[日/年数(30分の1)]

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 : .

212 : .

213 : .

214 : .

216 : .

217 : .

218 : .

219 : .

220 : .

221 : .

223 : .

224 : .

226 : .

227 : .

229 : .

230 : .

231 : .

232 : .

234 : .

235 : .

237 : .

238 : .

239 : .

240 : .

241 : .

242 : .

243 : .

244 : .

245 : .

248 : .

249 : .

251 : .

252 : .

253 : .

255 : .

256 : .

257 : .

258 : .

262 : .

265 : .

271 : .

277 : .

279 : .

280 : .

291 : .

294 : .

300 : .

305 : .

413 : .

2018.08.21

oraclizeを初めて使った

使用元のコントラクトにetherの残高が必要らしい。
ケチだな。

pragma solidity ^0.4.19;

import "./usingOraclize.sol";

contract SimpleOraclizeContract is usingOraclize {
    struct NumberLog {
        bytes32 id;
        uint number;
    }

    NumberLog[] public numberLogs;
    event SetNewNumber(bytes32 id, uint number);
    event NewOraclizeQuery(string description, uint price);

    function __callback(bytes32 myid, string result) public {
        if (msg.sender != oraclize_cbAddress()) {
            revert();
        }

        uint number = parseInt(result);
        numberLogs.push(NumberLog(myid, number));

        emit SetNewNumber(myid, number);
    }

    function updateNumber() public payable {
        uint price = oraclize_getPrice("URL");

        if(price > address(this).balance){
            emit NewOraclizeQuery("NG", price);
        } else {
            oraclize_query("WolframAlpha", "random integer number between 0 and 99");

            emit NewOraclizeQuery("OK", price);
        }
    }

    function getNumbers() public view returns(uint[]) {
        uint len = numberLogs.length;
        uint[] memory nums = new uint[](len);
        for(uint i=0; i<len; i++){
            nums[i] = numberLogs[i].number;
        }
        return nums;
    }

    function getIds() public view returns(bytes32[]) {
        uint len = numberLogs.length;
        bytes32[] memory ids = new bytes32[](len);
        for(uint i=0; i<len; i++){
            ids[i] = numberLogs[i].id;
        }
        return ids;
    }

}

pragma solidity ^0.4.19;

import "./usingOraclize.sol";

contract SimpleOraclizeContract is usingOraclize {

struct NumberLog {

bytes32 id;

uint number;

}

NumberLog[] public numberLogs;

event SetNewNumber(bytes32 id, uint number);

event NewOraclizeQuery(string description, uint price);

function __callback(bytes32 myid, string result) public {

if (msg.sender != oraclize_cbAddress()) {

revert();

}

uint number = parseInt(result);

numberLogs.push(NumberLog(myid, number));

emit SetNewNumber(myid, number);

}

function updateNumber() public payable {

uint price = oraclize_getPrice("URL");

if(price > address(this).balance){

emit NewOraclizeQuery("NG", price);

} else {

oraclize_query("WolframAlpha", "random integer number between 0 and 99");

emit NewOraclizeQuery("OK", price);

}

function getNumbers() public view returns(uint[]) {

uint len = numberLogs.length;

uint[] memory nums = new uint[](len);

for(uint i=0; i<len; i++){

nums[i] = numberLogs[i].number;

}

return nums;

}

function getIds() public view returns(bytes32[]) {

uint len = numberLogs.length;

bytes32[] memory ids = new bytes32[](len);

for(uint i=0; i<len; i++){

ids[i] = numberLogs[i].id;

}

return ids;

}

// <ORACLIZE_API>
/*
Copyright (c) 2015-2016 Oraclize SRL
Copyright (c) 2016 Oraclize LTD



Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:



The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.



THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/

pragma solidity ^0.4.0;//please import oraclizeAPI_pre0.4.sol when solidity < 0.4.0

contract OraclizeI {
    address public cbAddress;
    function query(uint _timestamp, string _datasource, string _arg) payable returns (bytes32 _id);
    function query_withGasLimit(uint _timestamp, string _datasource, string _arg, uint _gaslimit) payable returns (bytes32 _id);
    function query2(uint _timestamp, string _datasource, string _arg1, string _arg2) payable returns (bytes32 _id);
    function query2_withGasLimit(uint _timestamp, string _datasource, string _arg1, string _arg2, uint _gaslimit) payable returns (bytes32 _id);
    function queryN(uint _timestamp, string _datasource, bytes _argN) payable returns (bytes32 _id);
    function queryN_withGasLimit(uint _timestamp, string _datasource, bytes _argN, uint _gaslimit) payable returns (bytes32 _id);
    function getPrice(string _datasource) returns (uint _dsprice);
    function getPrice(string _datasource, uint gaslimit) returns (uint _dsprice);
    function useCoupon(string _coupon);
    function setProofType(byte _proofType);
    function setConfig(bytes32 _config);
    function setCustomGasPrice(uint _gasPrice);
    function randomDS_getSessionPubKeyHash() returns(bytes32);
}
contract OraclizeAddrResolverI {
    function getAddress() returns (address _addr);
}
contract usingOraclize {
    uint constant day = 60*60*24;
    uint constant week = 60*60*24*7;
    uint constant month = 60*60*24*30;
    byte constant proofType_NONE = 0x00;
    byte constant proofType_TLSNotary = 0x10;
    byte constant proofType_Android = 0x20;
    byte constant proofType_Ledger = 0x30;
    byte constant proofType_Native = 0xF0;
    byte constant proofStorage_IPFS = 0x01;
    uint8 constant networkID_auto = 0;
    uint8 constant networkID_mainnet = 1;
    uint8 constant networkID_testnet = 2;
    uint8 constant networkID_morden = 2;
    uint8 constant networkID_consensys = 161;

    OraclizeAddrResolverI OAR;

    OraclizeI oraclize;
    modifier oraclizeAPI {
        if((address(OAR)==0)||(getCodeSize(address(OAR))==0)) oraclize_setNetwork(networkID_auto);
        oraclize = OraclizeI(OAR.getAddress());
        _;
    }
    modifier coupon(string code){
        oraclize = OraclizeI(OAR.getAddress());
        oraclize.useCoupon(code);
        _;
    }

    function oraclize_setNetwork(uint8 networkID) internal returns(bool){
        if (getCodeSize(0x1d3B2638a7cC9f2CB3D298A3DA7a90B67E5506ed)>0){ //mainnet
            OAR = OraclizeAddrResolverI(0x1d3B2638a7cC9f2CB3D298A3DA7a90B67E5506ed);
            oraclize_setNetworkName("eth_mainnet");
            return true;
        }
        if (getCodeSize(0xc03A2615D5efaf5F49F60B7BB6583eaec212fdf1)>0){ //ropsten testnet
            OAR = OraclizeAddrResolverI(0xc03A2615D5efaf5F49F60B7BB6583eaec212fdf1);
            oraclize_setNetworkName("eth_ropsten3");
            return true;
        }
        if (getCodeSize(0xB7A07BcF2Ba2f2703b24C0691b5278999C59AC7e)>0){ //kovan testnet
            OAR = OraclizeAddrResolverI(0xB7A07BcF2Ba2f2703b24C0691b5278999C59AC7e);
            oraclize_setNetworkName("eth_kovan");
            return true;
        }
        if (getCodeSize(0x146500cfd35B22E4A392Fe0aDc06De1a1368Ed48)>0){ //rinkeby testnet
            OAR = OraclizeAddrResolverI(0x146500cfd35B22E4A392Fe0aDc06De1a1368Ed48);
            oraclize_setNetworkName("eth_rinkeby");
            return true;
        }
        if (getCodeSize(0x6f485C8BF6fc43eA212E93BBF8ce046C7f1cb475)>0){ //ethereum-bridge
            OAR = OraclizeAddrResolverI(0x6f485C8BF6fc43eA212E93BBF8ce046C7f1cb475);
            return true;
        }
        if (getCodeSize(0x20e12A1F859B3FeaE5Fb2A0A32C18F5a65555bBF)>0){ //ether.camp ide
            OAR = OraclizeAddrResolverI(0x20e12A1F859B3FeaE5Fb2A0A32C18F5a65555bBF);
            return true;
        }
        if (getCodeSize(0x51efaF4c8B3C9AfBD5aB9F4bbC82784Ab6ef8fAA)>0){ //browser-solidity
            OAR = OraclizeAddrResolverI(0x51efaF4c8B3C9AfBD5aB9F4bbC82784Ab6ef8fAA);
            return true;
        }
        return false;
    }

    function __callback(bytes32 myid, string result) {
        __callback(myid, result, new bytes(0));
    }
    function __callback(bytes32 myid, string result, bytes proof) {
    }
    
    function oraclize_useCoupon(string code) oraclizeAPI internal {
        oraclize.useCoupon(code);
    }

    function oraclize_getPrice(string datasource) oraclizeAPI internal returns (uint){
        return oraclize.getPrice(datasource);
    }

    function oraclize_getPrice(string datasource, uint gaslimit) oraclizeAPI internal returns (uint){
        return oraclize.getPrice(datasource, gaslimit);
    }
    
    function oraclize_query(string datasource, string arg) oraclizeAPI internal returns (bytes32 id){
        uint price = oraclize.getPrice(datasource);
        if (price > 1 ether + tx.gasprice*200000) return 0; // unexpectedly high price
        return oraclize.query.value(price)(0, datasource, arg);
    }
    function oraclize_query(uint timestamp, string datasource, string arg) oraclizeAPI internal returns (bytes32 id){
        uint price = oraclize.getPrice(datasource);
        if (price > 1 ether + tx.gasprice*200000) return 0; // unexpectedly high price
        return oraclize.query.value(price)(timestamp, datasource, arg);
    }
    function oraclize_query(uint timestamp, string datasource, string arg, uint gaslimit) oraclizeAPI internal returns (bytes32 id){
        uint price = oraclize.getPrice(datasource, gaslimit);
        if (price > 1 ether + tx.gasprice*gaslimit) return 0; // unexpectedly high price
        return oraclize.query_withGasLimit.value(price)(timestamp, datasource, arg, gaslimit);
    }
    function oraclize_query(string datasource, string arg, uint gaslimit) oraclizeAPI internal returns (bytes32 id){
        uint price = oraclize.getPrice(datasource, gaslimit);
        if (price > 1 ether + tx.gasprice*gaslimit) return 0; // unexpectedly high price
        return oraclize.query_withGasLimit.value(price)(0, datasource, arg, gaslimit);
    }
    function oraclize_query(string datasource, string arg1, string arg2) oraclizeAPI internal returns (bytes32 id){
        uint price = oraclize.getPrice(datasource);
        if (price > 1 ether + tx.gasprice*200000) return 0; // unexpectedly high price
        return oraclize.query2.value(price)(0, datasource, arg1, arg2);
    }
    function oraclize_query(uint timestamp, string datasource, string arg1, string arg2) oraclizeAPI internal returns (bytes32 id){
        uint price = oraclize.getPrice(datasource);
        if (price > 1 ether + tx.gasprice*200000) return 0; // unexpectedly high price
        return oraclize.query2.value(price)(timestamp, datasource, arg1, arg2);
    }
    function oraclize_query(uint timestamp, string datasource, string arg1, string arg2, uint gaslimit) oraclizeAPI internal returns (bytes32 id){
        uint price = oraclize.getPrice(datasource, gaslimit);
        if (price > 1 ether + tx.gasprice*gaslimit) return 0; // unexpectedly high price
        return oraclize.query2_withGasLimit.value(price)(timestamp, datasource, arg1, arg2, gaslimit);
    }
    function oraclize_query(string datasource, string arg1, string arg2, uint gaslimit) oraclizeAPI internal returns (bytes32 id){
        uint price = oraclize.getPrice(datasource, gaslimit);
        if (price > 1 ether + tx.gasprice*gaslimit) return 0; // unexpectedly high price
        return oraclize.query2_withGasLimit.value(price)(0, datasource, arg1, arg2, gaslimit);
    }
    function oraclize_query(string datasource, string[] argN) oraclizeAPI internal returns (bytes32 id){
        uint price = oraclize.getPrice(datasource);
        if (price > 1 ether + tx.gasprice*200000) return 0; // unexpectedly high price
        bytes memory args = stra2cbor(argN);
        return oraclize.queryN.value(price)(0, datasource, args);
    }
    function oraclize_query(uint timestamp, string datasource, string[] argN) oraclizeAPI internal returns (bytes32 id){
        uint price = oraclize.getPrice(datasource);
        if (price > 1 ether + tx.gasprice*200000) return 0; // unexpectedly high price
        bytes memory args = stra2cbor(argN);
        return oraclize.queryN.value(price)(timestamp, datasource, args);
    }
    function oraclize_query(uint timestamp, string datasource, string[] argN, uint gaslimit) oraclizeAPI internal returns (bytes32 id){
        uint price = oraclize.getPrice(datasource, gaslimit);
        if (price > 1 ether + tx.gasprice*gaslimit) return 0; // unexpectedly high price
        bytes memory args = stra2cbor(argN);
        return oraclize.queryN_withGasLimit.value(price)(timestamp, datasource, args, gaslimit);
    }
    function oraclize_query(string datasource, string[] argN, uint gaslimit) oraclizeAPI internal returns (bytes32 id){
        uint price = oraclize.getPrice(datasource, gaslimit);
        if (price > 1 ether + tx.gasprice*gaslimit) return 0; // unexpectedly high price
        bytes memory args = stra2cbor(argN);
        return oraclize.queryN_withGasLimit.value(price)(0, datasource, args, gaslimit);
    }
    function oraclize_query(string datasource, string[1] args) oraclizeAPI internal returns (bytes32 id) {
        string[] memory dynargs = new string[](1);
        dynargs[0] = args[0];
        return oraclize_query(datasource, dynargs);
    }
    function oraclize_query(uint timestamp, string datasource, string[1] args) oraclizeAPI internal returns (bytes32 id) {
        string[] memory dynargs = new string[](1);
        dynargs[0] = args[0];
        return oraclize_query(timestamp, datasource, dynargs);
    }
    function oraclize_query(uint timestamp, string datasource, string[1] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {
        string[] memory dynargs = new string[](1);
        dynargs[0] = args[0];
        return oraclize_query(timestamp, datasource, dynargs, gaslimit);
    }
    function oraclize_query(string datasource, string[1] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {
        string[] memory dynargs = new string[](1);
        dynargs[0] = args[0];       
        return oraclize_query(datasource, dynargs, gaslimit);
    }
    
    function oraclize_query(string datasource, string[2] args) oraclizeAPI internal returns (bytes32 id) {
        string[] memory dynargs = new string[](2);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        return oraclize_query(datasource, dynargs);
    }
    function oraclize_query(uint timestamp, string datasource, string[2] args) oraclizeAPI internal returns (bytes32 id) {
        string[] memory dynargs = new string[](2);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        return oraclize_query(timestamp, datasource, dynargs);
    }
    function oraclize_query(uint timestamp, string datasource, string[2] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {
        string[] memory dynargs = new string[](2);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        return oraclize_query(timestamp, datasource, dynargs, gaslimit);
    }
    function oraclize_query(string datasource, string[2] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {
        string[] memory dynargs = new string[](2);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        return oraclize_query(datasource, dynargs, gaslimit);
    }
    function oraclize_query(string datasource, string[3] args) oraclizeAPI internal returns (bytes32 id) {
        string[] memory dynargs = new string[](3);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        return oraclize_query(datasource, dynargs);
    }
    function oraclize_query(uint timestamp, string datasource, string[3] args) oraclizeAPI internal returns (bytes32 id) {
        string[] memory dynargs = new string[](3);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        return oraclize_query(timestamp, datasource, dynargs);
    }
    function oraclize_query(uint timestamp, string datasource, string[3] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {
        string[] memory dynargs = new string[](3);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        return oraclize_query(timestamp, datasource, dynargs, gaslimit);
    }
    function oraclize_query(string datasource, string[3] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {
        string[] memory dynargs = new string[](3);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        return oraclize_query(datasource, dynargs, gaslimit);
    }
    
    function oraclize_query(string datasource, string[4] args) oraclizeAPI internal returns (bytes32 id) {
        string[] memory dynargs = new string[](4);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        dynargs[3] = args[3];
        return oraclize_query(datasource, dynargs);
    }
    function oraclize_query(uint timestamp, string datasource, string[4] args) oraclizeAPI internal returns (bytes32 id) {
        string[] memory dynargs = new string[](4);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        dynargs[3] = args[3];
        return oraclize_query(timestamp, datasource, dynargs);
    }
    function oraclize_query(uint timestamp, string datasource, string[4] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {
        string[] memory dynargs = new string[](4);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        dynargs[3] = args[3];
        return oraclize_query(timestamp, datasource, dynargs, gaslimit);
    }
    function oraclize_query(string datasource, string[4] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {
        string[] memory dynargs = new string[](4);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        dynargs[3] = args[3];
        return oraclize_query(datasource, dynargs, gaslimit);
    }
    function oraclize_query(string datasource, string[5] args) oraclizeAPI internal returns (bytes32 id) {
        string[] memory dynargs = new string[](5);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        dynargs[3] = args[3];
        dynargs[4] = args[4];
        return oraclize_query(datasource, dynargs);
    }
    function oraclize_query(uint timestamp, string datasource, string[5] args) oraclizeAPI internal returns (bytes32 id) {
        string[] memory dynargs = new string[](5);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        dynargs[3] = args[3];
        dynargs[4] = args[4];
        return oraclize_query(timestamp, datasource, dynargs);
    }
    function oraclize_query(uint timestamp, string datasource, string[5] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {
        string[] memory dynargs = new string[](5);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        dynargs[3] = args[3];
        dynargs[4] = args[4];
        return oraclize_query(timestamp, datasource, dynargs, gaslimit);
    }
    function oraclize_query(string datasource, string[5] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {
        string[] memory dynargs = new string[](5);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        dynargs[3] = args[3];
        dynargs[4] = args[4];
        return oraclize_query(datasource, dynargs, gaslimit);
    }
    function oraclize_query(string datasource, bytes[] argN) oraclizeAPI internal returns (bytes32 id){
        uint price = oraclize.getPrice(datasource);
        if (price > 1 ether + tx.gasprice*200000) return 0; // unexpectedly high price
        bytes memory args = ba2cbor(argN);
        return oraclize.queryN.value(price)(0, datasource, args);
    }
    function oraclize_query(uint timestamp, string datasource, bytes[] argN) oraclizeAPI internal returns (bytes32 id){
        uint price = oraclize.getPrice(datasource);
        if (price > 1 ether + tx.gasprice*200000) return 0; // unexpectedly high price
        bytes memory args = ba2cbor(argN);
        return oraclize.queryN.value(price)(timestamp, datasource, args);
    }
    function oraclize_query(uint timestamp, string datasource, bytes[] argN, uint gaslimit) oraclizeAPI internal returns (bytes32 id){
        uint price = oraclize.getPrice(datasource, gaslimit);
        if (price > 1 ether + tx.gasprice*gaslimit) return 0; // unexpectedly high price
        bytes memory args = ba2cbor(argN);
        return oraclize.queryN_withGasLimit.value(price)(timestamp, datasource, args, gaslimit);
    }
    function oraclize_query(string datasource, bytes[] argN, uint gaslimit) oraclizeAPI internal returns (bytes32 id){
        uint price = oraclize.getPrice(datasource, gaslimit);
        if (price > 1 ether + tx.gasprice*gaslimit) return 0; // unexpectedly high price
        bytes memory args = ba2cbor(argN);
        return oraclize.queryN_withGasLimit.value(price)(0, datasource, args, gaslimit);
    }
    function oraclize_query(string datasource, bytes[1] args) oraclizeAPI internal returns (bytes32 id) {
        bytes[] memory dynargs = new bytes[](1);
        dynargs[0] = args[0];
        return oraclize_query(datasource, dynargs);
    }
    function oraclize_query(uint timestamp, string datasource, bytes[1] args) oraclizeAPI internal returns (bytes32 id) {
        bytes[] memory dynargs = new bytes[](1);
        dynargs[0] = args[0];
        return oraclize_query(timestamp, datasource, dynargs);
    }
    function oraclize_query(uint timestamp, string datasource, bytes[1] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {
        bytes[] memory dynargs = new bytes[](1);
        dynargs[0] = args[0];
        return oraclize_query(timestamp, datasource, dynargs, gaslimit);
    }
    function oraclize_query(string datasource, bytes[1] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {
        bytes[] memory dynargs = new bytes[](1);
        dynargs[0] = args[0];       
        return oraclize_query(datasource, dynargs, gaslimit);
    }
    
    function oraclize_query(string datasource, bytes[2] args) oraclizeAPI internal returns (bytes32 id) {
        bytes[] memory dynargs = new bytes[](2);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        return oraclize_query(datasource, dynargs);
    }
    function oraclize_query(uint timestamp, string datasource, bytes[2] args) oraclizeAPI internal returns (bytes32 id) {
        bytes[] memory dynargs = new bytes[](2);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        return oraclize_query(timestamp, datasource, dynargs);
    }
    function oraclize_query(uint timestamp, string datasource, bytes[2] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {
        bytes[] memory dynargs = new bytes[](2);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        return oraclize_query(timestamp, datasource, dynargs, gaslimit);
    }
    function oraclize_query(string datasource, bytes[2] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {
        bytes[] memory dynargs = new bytes[](2);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        return oraclize_query(datasource, dynargs, gaslimit);
    }
    function oraclize_query(string datasource, bytes[3] args) oraclizeAPI internal returns (bytes32 id) {
        bytes[] memory dynargs = new bytes[](3);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        return oraclize_query(datasource, dynargs);
    }
    function oraclize_query(uint timestamp, string datasource, bytes[3] args) oraclizeAPI internal returns (bytes32 id) {
        bytes[] memory dynargs = new bytes[](3);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        return oraclize_query(timestamp, datasource, dynargs);
    }
    function oraclize_query(uint timestamp, string datasource, bytes[3] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {
        bytes[] memory dynargs = new bytes[](3);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        return oraclize_query(timestamp, datasource, dynargs, gaslimit);
    }
    function oraclize_query(string datasource, bytes[3] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {
        bytes[] memory dynargs = new bytes[](3);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        return oraclize_query(datasource, dynargs, gaslimit);
    }
    
    function oraclize_query(string datasource, bytes[4] args) oraclizeAPI internal returns (bytes32 id) {
        bytes[] memory dynargs = new bytes[](4);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        dynargs[3] = args[3];
        return oraclize_query(datasource, dynargs);
    }
    function oraclize_query(uint timestamp, string datasource, bytes[4] args) oraclizeAPI internal returns (bytes32 id) {
        bytes[] memory dynargs = new bytes[](4);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        dynargs[3] = args[3];
        return oraclize_query(timestamp, datasource, dynargs);
    }
    function oraclize_query(uint timestamp, string datasource, bytes[4] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {
        bytes[] memory dynargs = new bytes[](4);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        dynargs[3] = args[3];
        return oraclize_query(timestamp, datasource, dynargs, gaslimit);
    }
    function oraclize_query(string datasource, bytes[4] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {
        bytes[] memory dynargs = new bytes[](4);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        dynargs[3] = args[3];
        return oraclize_query(datasource, dynargs, gaslimit);
    }
    function oraclize_query(string datasource, bytes[5] args) oraclizeAPI internal returns (bytes32 id) {
        bytes[] memory dynargs = new bytes[](5);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        dynargs[3] = args[3];
        dynargs[4] = args[4];
        return oraclize_query(datasource, dynargs);
    }
    function oraclize_query(uint timestamp, string datasource, bytes[5] args) oraclizeAPI internal returns (bytes32 id) {
        bytes[] memory dynargs = new bytes[](5);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        dynargs[3] = args[3];
        dynargs[4] = args[4];
        return oraclize_query(timestamp, datasource, dynargs);
    }
    function oraclize_query(uint timestamp, string datasource, bytes[5] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {
        bytes[] memory dynargs = new bytes[](5);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        dynargs[3] = args[3];
        dynargs[4] = args[4];
        return oraclize_query(timestamp, datasource, dynargs, gaslimit);
    }
    function oraclize_query(string datasource, bytes[5] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {
        bytes[] memory dynargs = new bytes[](5);
        dynargs[0] = args[0];
        dynargs[1] = args[1];
        dynargs[2] = args[2];
        dynargs[3] = args[3];
        dynargs[4] = args[4];
        return oraclize_query(datasource, dynargs, gaslimit);
    }

    function oraclize_cbAddress() oraclizeAPI internal returns (address){
        return oraclize.cbAddress();
    }
    function oraclize_setProof(byte proofP) oraclizeAPI internal {
        return oraclize.setProofType(proofP);
    }
    function oraclize_setCustomGasPrice(uint gasPrice) oraclizeAPI internal {
        return oraclize.setCustomGasPrice(gasPrice);
    }
    function oraclize_setConfig(bytes32 config) oraclizeAPI internal {
        return oraclize.setConfig(config);
    }
    
    function oraclize_randomDS_getSessionPubKeyHash() oraclizeAPI internal returns (bytes32){
        return oraclize.randomDS_getSessionPubKeyHash();
    }

    function getCodeSize(address _addr) constant internal returns(uint _size) {
        assembly {
            _size := extcodesize(_addr)
        }
    }

    function parseAddr(string _a) internal returns (address){
        bytes memory tmp = bytes(_a);
        uint160 iaddr = 0;
        uint160 b1;
        uint160 b2;
        for (uint i=2; i<2+2*20; i+=2){
            iaddr *= 256;
            b1 = uint160(tmp[i]);
            b2 = uint160(tmp[i+1]);
            if ((b1 >= 97)&&(b1 <= 102)) b1 -= 87;
            else if ((b1 >= 65)&&(b1 <= 70)) b1 -= 55;
            else if ((b1 >= 48)&&(b1 <= 57)) b1 -= 48;
            if ((b2 >= 97)&&(b2 <= 102)) b2 -= 87;
            else if ((b2 >= 65)&&(b2 <= 70)) b2 -= 55;
            else if ((b2 >= 48)&&(b2 <= 57)) b2 -= 48;
            iaddr += (b1*16+b2);
        }
        return address(iaddr);
    }

    function strCompare(string _a, string _b) internal returns (int) {
        bytes memory a = bytes(_a);
        bytes memory b = bytes(_b);
        uint minLength = a.length;
        if (b.length < minLength) minLength = b.length;
        for (uint i = 0; i < minLength; i ++)
            if (a[i] < b[i])
                return -1;
            else if (a[i] > b[i])
                return 1;
        if (a.length < b.length)
            return -1;
        else if (a.length > b.length)
            return 1;
        else
            return 0;
    }

    function indexOf(string _haystack, string _needle) internal returns (int) {
        bytes memory h = bytes(_haystack);
        bytes memory n = bytes(_needle);
        if(h.length < 1 || n.length < 1 || (n.length > h.length))
            return -1;
        else if(h.length > (2**128 -1))
            return -1;
        else
        {
            uint subindex = 0;
            for (uint i = 0; i < h.length; i ++)
            {
                if (h[i] == n[0])
                {
                    subindex = 1;
                    while(subindex < n.length && (i + subindex) < h.length && h[i + subindex] == n[subindex])
                    {
                        subindex++;
                    }
                    if(subindex == n.length)
                        return int(i);
                }
            }
            return -1;
        }
    }

    function strConcat(string _a, string _b, string _c, string _d, string _e) internal returns (string) {
        bytes memory _ba = bytes(_a);
        bytes memory _bb = bytes(_b);
        bytes memory _bc = bytes(_c);
        bytes memory _bd = bytes(_d);
        bytes memory _be = bytes(_e);
        string memory abcde = new string(_ba.length + _bb.length + _bc.length + _bd.length + _be.length);
        bytes memory babcde = bytes(abcde);
        uint k = 0;
        for (uint i = 0; i < _ba.length; i++) babcde[k++] = _ba[i];
        for (i = 0; i < _bb.length; i++) babcde[k++] = _bb[i];
        for (i = 0; i < _bc.length; i++) babcde[k++] = _bc[i];
        for (i = 0; i < _bd.length; i++) babcde[k++] = _bd[i];
        for (i = 0; i < _be.length; i++) babcde[k++] = _be[i];
        return string(babcde);
    }

    function strConcat(string _a, string _b, string _c, string _d) internal returns (string) {
        return strConcat(_a, _b, _c, _d, "");
    }

    function strConcat(string _a, string _b, string _c) internal returns (string) {
        return strConcat(_a, _b, _c, "", "");
    }

    function strConcat(string _a, string _b) internal returns (string) {
        return strConcat(_a, _b, "", "", "");
    }

    // parseInt
    function parseInt(string _a) internal returns (uint) {
        return parseInt(_a, 0);
    }

    // parseInt(parseFloat*10^_b)
    function parseInt(string _a, uint _b) internal returns (uint) {
        bytes memory bresult = bytes(_a);
        uint mint = 0;
        bool decimals = false;
        for (uint i=0; i<bresult.length; i++){
            if ((bresult[i] >= 48)&&(bresult[i] <= 57)){
                if (decimals){
                   if (_b == 0) break;
                    else _b--;
                }
                mint *= 10;
                mint += uint(bresult[i]) - 48;
            } else if (bresult[i] == 46) decimals = true;
        }
        if (_b > 0) mint *= 10**_b;
        return mint;
    }

    function uint2str(uint i) internal returns (string){
        if (i == 0) return "0";
        uint j = i;
        uint len;
        while (j != 0){
            len++;
            j /= 10;
        }
        bytes memory bstr = new bytes(len);
        uint k = len - 1;
        while (i != 0){
            bstr[k--] = byte(48 + i % 10);
            i /= 10;
        }
        return string(bstr);
    }
    
    function stra2cbor(string[] arr) internal returns (bytes) {
            uint arrlen = arr.length;

            // get correct cbor output length
            uint outputlen = 0;
            bytes[] memory elemArray = new bytes[](arrlen);
            for (uint i = 0; i < arrlen; i++) {
                elemArray[i] = (bytes(arr[i]));
                outputlen += elemArray[i].length + (elemArray[i].length - 1)/23 + 3; //+3 accounts for paired identifier types
            }
            uint ctr = 0;
            uint cborlen = arrlen + 0x80;
            outputlen += byte(cborlen).length;
            bytes memory res = new bytes(outputlen);

            while (byte(cborlen).length > ctr) {
                res[ctr] = byte(cborlen)[ctr];
                ctr++;
            }
            for (i = 0; i < arrlen; i++) {
                res[ctr] = 0x5F;
                ctr++;
                for (uint x = 0; x < elemArray[i].length; x++) {
                    // if there's a bug with larger strings, this may be the culprit
                    if (x % 23 == 0) {
                        uint elemcborlen = elemArray[i].length - x >= 24 ? 23 : elemArray[i].length - x;
                        elemcborlen += 0x40;
                        uint lctr = ctr;
                        while (byte(elemcborlen).length > ctr - lctr) {
                            res[ctr] = byte(elemcborlen)[ctr - lctr];
                            ctr++;
                        }
                    }
                    res[ctr] = elemArray[i][x];
                    ctr++;
                }
                res[ctr] = 0xFF;
                ctr++;
            }
            return res;
        }

    function ba2cbor(bytes[] arr) internal returns (bytes) {
            uint arrlen = arr.length;

            // get correct cbor output length
            uint outputlen = 0;
            bytes[] memory elemArray = new bytes[](arrlen);
            for (uint i = 0; i < arrlen; i++) {
                elemArray[i] = (bytes(arr[i]));
                outputlen += elemArray[i].length + (elemArray[i].length - 1)/23 + 3; //+3 accounts for paired identifier types
            }
            uint ctr = 0;
            uint cborlen = arrlen + 0x80;
            outputlen += byte(cborlen).length;
            bytes memory res = new bytes(outputlen);

            while (byte(cborlen).length > ctr) {
                res[ctr] = byte(cborlen)[ctr];
                ctr++;
            }
            for (i = 0; i < arrlen; i++) {
                res[ctr] = 0x5F;
                ctr++;
                for (uint x = 0; x < elemArray[i].length; x++) {
                    // if there's a bug with larger strings, this may be the culprit
                    if (x % 23 == 0) {
                        uint elemcborlen = elemArray[i].length - x >= 24 ? 23 : elemArray[i].length - x;
                        elemcborlen += 0x40;
                        uint lctr = ctr;
                        while (byte(elemcborlen).length > ctr - lctr) {
                            res[ctr] = byte(elemcborlen)[ctr - lctr];
                            ctr++;
                        }
                    }
                    res[ctr] = elemArray[i][x];
                    ctr++;
                }
                res[ctr] = 0xFF;
                ctr++;
            }
            return res;
        }
        
        
    string oraclize_network_name;
    function oraclize_setNetworkName(string _network_name) internal {
        oraclize_network_name = _network_name;
    }
    
    function oraclize_getNetworkName() internal returns (string) {
        return oraclize_network_name;
    }
    
    function oraclize_newRandomDSQuery(uint _delay, uint _nbytes, uint _customGasLimit) internal returns (bytes32){
        if ((_nbytes == 0)||(_nbytes > 32)) throw;
        bytes memory nbytes = new bytes(1);
        nbytes[0] = byte(_nbytes);
        bytes memory unonce = new bytes(32);
        bytes memory sessionKeyHash = new bytes(32);
        bytes32 sessionKeyHash_bytes32 = oraclize_randomDS_getSessionPubKeyHash();
        assembly {
            mstore(unonce, 0x20)
            mstore(add(unonce, 0x20), xor(blockhash(sub(number, 1)), xor(coinbase, timestamp)))
            mstore(sessionKeyHash, 0x20)
            mstore(add(sessionKeyHash, 0x20), sessionKeyHash_bytes32)
        }
        bytes[3] memory args = [unonce, nbytes, sessionKeyHash]; 
        bytes32 queryId = oraclize_query(_delay, "random", args, _customGasLimit);
        oraclize_randomDS_setCommitment(queryId, sha3(bytes8(_delay), args[1], sha256(args[0]), args[2]));
        return queryId;
    }
    
    function oraclize_randomDS_setCommitment(bytes32 queryId, bytes32 commitment) internal {
        oraclize_randomDS_args[queryId] = commitment;
    }
    
    mapping(bytes32=>bytes32) oraclize_randomDS_args;
    mapping(bytes32=>bool) oraclize_randomDS_sessionKeysHashVerified;

    function verifySig(bytes32 tosignh, bytes dersig, bytes pubkey) internal returns (bool){
        bool sigok;
        address signer;
        
        bytes32 sigr;
        bytes32 sigs;
        
        bytes memory sigr_ = new bytes(32);
        uint offset = 4+(uint(dersig[3]) - 0x20);
        sigr_ = copyBytes(dersig, offset, 32, sigr_, 0);
        bytes memory sigs_ = new bytes(32);
        offset += 32 + 2;
        sigs_ = copyBytes(dersig, offset+(uint(dersig[offset-1]) - 0x20), 32, sigs_, 0);

        assembly {
            sigr := mload(add(sigr_, 32))
            sigs := mload(add(sigs_, 32))
        }
        
        
        (sigok, signer) = safer_ecrecover(tosignh, 27, sigr, sigs);
        if (address(sha3(pubkey)) == signer) return true;
        else {
            (sigok, signer) = safer_ecrecover(tosignh, 28, sigr, sigs);
            return (address(sha3(pubkey)) == signer);
        }
    }

    function oraclize_randomDS_proofVerify__sessionKeyValidity(bytes proof, uint sig2offset) internal returns (bool) {
        bool sigok;
        
        // Step 6: verify the attestation signature, APPKEY1 must sign the sessionKey from the correct ledger app (CODEHASH)
        bytes memory sig2 = new bytes(uint(proof[sig2offset+1])+2);
        copyBytes(proof, sig2offset, sig2.length, sig2, 0);
        
        bytes memory appkey1_pubkey = new bytes(64);
        copyBytes(proof, 3+1, 64, appkey1_pubkey, 0);
        
        bytes memory tosign2 = new bytes(1+65+32);
        tosign2[0] = 1; //role
        copyBytes(proof, sig2offset-65, 65, tosign2, 1);
        bytes memory CODEHASH = hex"fd94fa71bc0ba10d39d464d0d8f465efeef0a2764e3887fcc9df41ded20f505c";
        copyBytes(CODEHASH, 0, 32, tosign2, 1+65);
        sigok = verifySig(sha256(tosign2), sig2, appkey1_pubkey);
        
        if (sigok == false) return false;
        
        
        // Step 7: verify the APPKEY1 provenance (must be signed by Ledger)
        bytes memory LEDGERKEY = hex"7fb956469c5c9b89840d55b43537e66a98dd4811ea0a27224272c2e5622911e8537a2f8e86a46baec82864e98dd01e9ccc2f8bc5dfc9cbe5a91a290498dd96e4";
        
        bytes memory tosign3 = new bytes(1+65);
        tosign3[0] = 0xFE;
        copyBytes(proof, 3, 65, tosign3, 1);
        
        bytes memory sig3 = new bytes(uint(proof[3+65+1])+2);
        copyBytes(proof, 3+65, sig3.length, sig3, 0);
        
        sigok = verifySig(sha256(tosign3), sig3, LEDGERKEY);
        
        return sigok;
    }
    
    modifier oraclize_randomDS_proofVerify(bytes32 _queryId, string _result, bytes _proof) {
        // Step 1: the prefix has to match 'LP\x01' (Ledger Proof version 1)
        if ((_proof[0] != "L")||(_proof[1] != "P")||(_proof[2] != 1)) throw;
        
        bool proofVerified = oraclize_randomDS_proofVerify__main(_proof, _queryId, bytes(_result), oraclize_getNetworkName());
        if (proofVerified == false) throw;
        
        _;
    }
    
    function matchBytes32Prefix(bytes32 content, bytes prefix) internal returns (bool){
        bool match_ = true;
        
        for (var i=0; i<prefix.length; i++){
            if (content[i] != prefix[i]) match_ = false;
        }
        
        return match_;
    }

    function oraclize_randomDS_proofVerify__main(bytes proof, bytes32 queryId, bytes result, string context_name) internal returns (bool){
        bool checkok;
        
        
        // Step 2: the unique keyhash has to match with the sha256 of (context name + queryId)
        uint ledgerProofLength = 3+65+(uint(proof[3+65+1])+2)+32;
        bytes memory keyhash = new bytes(32);
        copyBytes(proof, ledgerProofLength, 32, keyhash, 0);
        checkok = (sha3(keyhash) == sha3(sha256(context_name, queryId)));
        if (checkok == false) return false;
        
        bytes memory sig1 = new bytes(uint(proof[ledgerProofLength+(32+8+1+32)+1])+2);
        copyBytes(proof, ledgerProofLength+(32+8+1+32), sig1.length, sig1, 0);
        
        
        // Step 3: we assume sig1 is valid (it will be verified during step 5) and we verify if 'result' is the prefix of sha256(sig1)
        checkok = matchBytes32Prefix(sha256(sig1), result);
        if (checkok == false) return false;
        
        
        // Step 4: commitment match verification, sha3(delay, nbytes, unonce, sessionKeyHash) == commitment in storage.
        // This is to verify that the computed args match with the ones specified in the query.
        bytes memory commitmentSlice1 = new bytes(8+1+32);
        copyBytes(proof, ledgerProofLength+32, 8+1+32, commitmentSlice1, 0);
        
        bytes memory sessionPubkey = new bytes(64);
        uint sig2offset = ledgerProofLength+32+(8+1+32)+sig1.length+65;
        copyBytes(proof, sig2offset-64, 64, sessionPubkey, 0);
        
        bytes32 sessionPubkeyHash = sha256(sessionPubkey);
        if (oraclize_randomDS_args[queryId] == sha3(commitmentSlice1, sessionPubkeyHash)){ //unonce, nbytes and sessionKeyHash match
            delete oraclize_randomDS_args[queryId];
        } else return false;
        
        
        // Step 5: validity verification for sig1 (keyhash and args signed with the sessionKey)
        bytes memory tosign1 = new bytes(32+8+1+32);
        copyBytes(proof, ledgerProofLength, 32+8+1+32, tosign1, 0);
        checkok = verifySig(sha256(tosign1), sig1, sessionPubkey);
        if (checkok == false) return false;
        
        // verify if sessionPubkeyHash was verified already, if not.. let's do it!
        if (oraclize_randomDS_sessionKeysHashVerified[sessionPubkeyHash] == false){
            oraclize_randomDS_sessionKeysHashVerified[sessionPubkeyHash] = oraclize_randomDS_proofVerify__sessionKeyValidity(proof, sig2offset);
        }
        
        return oraclize_randomDS_sessionKeysHashVerified[sessionPubkeyHash];
    }

    
    // the following function has been written by Alex Beregszaszi (@axic), use it under the terms of the MIT license
    function copyBytes(bytes from, uint fromOffset, uint length, bytes to, uint toOffset) internal returns (bytes) {
        uint minLength = length + toOffset;

        if (to.length < minLength) {
            // Buffer too small
            throw; // Should be a better way?
        }

        // NOTE: the offset 32 is added to skip the `size` field of both bytes variables
        uint i = 32 + fromOffset;
        uint j = 32 + toOffset;

        while (i < (32 + fromOffset + length)) {
            assembly {
                let tmp := mload(add(from, i))
                mstore(add(to, j), tmp)
            }
            i += 32;
            j += 32;
        }

        return to;
    }
    
    // the following function has been written by Alex Beregszaszi (@axic), use it under the terms of the MIT license
    // Duplicate Solidity's ecrecover, but catching the CALL return value
    function safer_ecrecover(bytes32 hash, uint8 v, bytes32 r, bytes32 s) internal returns (bool, address) {
        // We do our own memory management here. Solidity uses memory offset
        // 0x40 to store the current end of memory. We write past it (as
        // writes are memory extensions), but don't update the offset so
        // Solidity will reuse it. The memory used here is only needed for
        // this context.

        // FIXME: inline assembly can't access return values
        bool ret;
        address addr;

        assembly {
            let size := mload(0x40)
            mstore(size, hash)
            mstore(add(size, 32), v)
            mstore(add(size, 64), r)
            mstore(add(size, 96), s)

            // NOTE: we can reuse the request memory because we deal with
            //       the return code
            ret := call(3000, 1, 0, size, 128, size, 32)
            addr := mload(size)
        }
  
        return (ret, addr);
    }

    // the following function has been written by Alex Beregszaszi (@axic), use it under the terms of the MIT license
    function ecrecovery(bytes32 hash, bytes sig) internal returns (bool, address) {
        bytes32 r;
        bytes32 s;
        uint8 v;

        if (sig.length != 65)
          return (false, 0);

        // The signature format is a compact form of:
        //   {bytes32 r}{bytes32 s}{uint8 v}
        // Compact means, uint8 is not padded to 32 bytes.
        assembly {
            r := mload(add(sig, 32))
            s := mload(add(sig, 64))

            // Here we are loading the last 32 bytes. We exploit the fact that
            // 'mload' will pad with zeroes if we overread.
            // There is no 'mload8' to do this, but that would be nicer.
            v := byte(0, mload(add(sig, 96)))

            // Alternative solution:
            // 'byte' is not working due to the Solidity parser, so lets
            // use the second best option, 'and'
            // v := and(mload(add(sig, 65)), 255)
        }

        // albeit non-transactional signatures are not specified by the YP, one would expect it
        // to match the YP range of [27, 28]
        //
        // geth uses [0, 1] and some clients have followed. This might change, see:
        //  https://github.com/ethereum/go-ethereum/issues/2053
        if (v < 27)
          v += 27;

        if (v != 27 && v != 28)
            return (false, 0);

        return safer_ecrecover(hash, v, r, s);
    }
        
}
// </ORACLIZE_API>

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

1001

1002

1003

1004

1005

1006

1007

1008

1009

1010

1011

1012

1013

1014

1015

1016

// <ORACLIZE_API>

Permission is hereby granted, free of charge, to any person obtaining a copy

of this software and associated documentation files (the "Software"), to deal

in the Software without restriction, including without limitation the rights

to use, copy, modify, merge, publish, distribute, sublicense, and/or sell

copies of the Software, and to permit persons to whom the Software is

furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in

all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR

IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,

FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE

AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER

LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,

OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN

THE SOFTWARE.

pragma solidity ^0.4.0;//please import oraclizeAPI_pre0.4.sol when solidity < 0.4.0

contract OraclizeI {

address public cbAddress;

function query(uint _timestamp, string _datasource, string _arg) payable returns (bytes32 _id);

function query_withGasLimit(uint _timestamp, string _datasource, string _arg, uint _gaslimit) payable returns (bytes32 _id);

function query2(uint _timestamp, string _datasource, string _arg1, string _arg2) payable returns (bytes32 _id);

function query2_withGasLimit(uint _timestamp, string _datasource, string _arg1, string _arg2, uint _gaslimit) payable returns (bytes32 _id);

function queryN(uint _timestamp, string _datasource, bytes _argN) payable returns (bytes32 _id);

function queryN_withGasLimit(uint _timestamp, string _datasource, bytes _argN, uint _gaslimit) payable returns (bytes32 _id);

function getPrice(string _datasource) returns (uint _dsprice);

function getPrice(string _datasource, uint gaslimit) returns (uint _dsprice);

function useCoupon(string _coupon);

function setProofType(byte _proofType);

function setConfig(bytes32 _config);

function setCustomGasPrice(uint _gasPrice);

function randomDS_getSessionPubKeyHash() returns(bytes32);

}

contract OraclizeAddrResolverI {

function getAddress() returns (address _addr);

}

contract usingOraclize {

uint constant day = 60*60*24;

uint constant week = 60*60*24*7;

uint constant month = 60*60*24*30;

byte constant proofType_NONE = 0x00;

byte constant proofType_TLSNotary = 0x10;

byte constant proofType_Android = 0x20;

byte constant proofType_Ledger = 0x30;

byte constant proofType_Native = 0xF0;

byte constant proofStorage_IPFS = 0x01;

uint8 constant networkID_auto = 0;

uint8 constant networkID_mainnet = 1;

uint8 constant networkID_testnet = 2;

uint8 constant networkID_morden = 2;

uint8 constant networkID_consensys = 161;

OraclizeAddrResolverI OAR;

OraclizeI oraclize;

modifier oraclizeAPI {

if((address(OAR)==0)||(getCodeSize(address(OAR))==0)) oraclize_setNetwork(networkID_auto);

oraclize = OraclizeI(OAR.getAddress());

}

modifier coupon(string code){

oraclize = OraclizeI(OAR.getAddress());

oraclize.useCoupon(code);

}

function oraclize_setNetwork(uint8 networkID) internal returns(bool){

if (getCodeSize(0x1d3B2638a7cC9f2CB3D298A3DA7a90B67E5506ed)>0){ //mainnet

OAR = OraclizeAddrResolverI(0x1d3B2638a7cC9f2CB3D298A3DA7a90B67E5506ed);

oraclize_setNetworkName("eth_mainnet");

return true;

}

if (getCodeSize(0xc03A2615D5efaf5F49F60B7BB6583eaec212fdf1)>0){ //ropsten testnet

OAR = OraclizeAddrResolverI(0xc03A2615D5efaf5F49F60B7BB6583eaec212fdf1);

oraclize_setNetworkName("eth_ropsten3");

return true;

}

if (getCodeSize(0xB7A07BcF2Ba2f2703b24C0691b5278999C59AC7e)>0){ //kovan testnet

OAR = OraclizeAddrResolverI(0xB7A07BcF2Ba2f2703b24C0691b5278999C59AC7e);

oraclize_setNetworkName("eth_kovan");

return true;

}

if (getCodeSize(0x146500cfd35B22E4A392Fe0aDc06De1a1368Ed48)>0){ //rinkeby testnet

OAR = OraclizeAddrResolverI(0x146500cfd35B22E4A392Fe0aDc06De1a1368Ed48);

oraclize_setNetworkName("eth_rinkeby");

return true;

}

if (getCodeSize(0x6f485C8BF6fc43eA212E93BBF8ce046C7f1cb475)>0){ //ethereum-bridge

OAR = OraclizeAddrResolverI(0x6f485C8BF6fc43eA212E93BBF8ce046C7f1cb475);

return true;

}

if (getCodeSize(0x20e12A1F859B3FeaE5Fb2A0A32C18F5a65555bBF)>0){ //ether.camp ide

OAR = OraclizeAddrResolverI(0x20e12A1F859B3FeaE5Fb2A0A32C18F5a65555bBF);

return true;

}

if (getCodeSize(0x51efaF4c8B3C9AfBD5aB9F4bbC82784Ab6ef8fAA)>0){ //browser-solidity

OAR = OraclizeAddrResolverI(0x51efaF4c8B3C9AfBD5aB9F4bbC82784Ab6ef8fAA);

return true;

}

return false;

}

function __callback(bytes32 myid, string result) {

__callback(myid, result, new bytes(0));

}

function __callback(bytes32 myid, string result, bytes proof) {

}

function oraclize_useCoupon(string code) oraclizeAPI internal {

oraclize.useCoupon(code);

}

function oraclize_getPrice(string datasource) oraclizeAPI internal returns (uint){

return oraclize.getPrice(datasource);

}

function oraclize_getPrice(string datasource, uint gaslimit) oraclizeAPI internal returns (uint){

return oraclize.getPrice(datasource, gaslimit);

}

function oraclize_query(string datasource, string arg) oraclizeAPI internal returns (bytes32 id){

uint price = oraclize.getPrice(datasource);

if (price > 1 ether + tx.gasprice*200000) return 0; // unexpectedly high price

return oraclize.query.value(price)(0, datasource, arg);

}

function oraclize_query(uint timestamp, string datasource, string arg) oraclizeAPI internal returns (bytes32 id){

uint price = oraclize.getPrice(datasource);

if (price > 1 ether + tx.gasprice*200000) return 0; // unexpectedly high price

return oraclize.query.value(price)(timestamp, datasource, arg);

}

function oraclize_query(uint timestamp, string datasource, string arg, uint gaslimit) oraclizeAPI internal returns (bytes32 id){

uint price = oraclize.getPrice(datasource, gaslimit);

if (price > 1 ether + tx.gasprice*gaslimit) return 0; // unexpectedly high price

return oraclize.query_withGasLimit.value(price)(timestamp, datasource, arg, gaslimit);

}

function oraclize_query(string datasource, string arg, uint gaslimit) oraclizeAPI internal returns (bytes32 id){

uint price = oraclize.getPrice(datasource, gaslimit);

if (price > 1 ether + tx.gasprice*gaslimit) return 0; // unexpectedly high price

return oraclize.query_withGasLimit.value(price)(0, datasource, arg, gaslimit);

}

function oraclize_query(string datasource, string arg1, string arg2) oraclizeAPI internal returns (bytes32 id){

uint price = oraclize.getPrice(datasource);

if (price > 1 ether + tx.gasprice*200000) return 0; // unexpectedly high price

return oraclize.query2.value(price)(0, datasource, arg1, arg2);

}

function oraclize_query(uint timestamp, string datasource, string arg1, string arg2) oraclizeAPI internal returns (bytes32 id){

uint price = oraclize.getPrice(datasource);

if (price > 1 ether + tx.gasprice*200000) return 0; // unexpectedly high price

return oraclize.query2.value(price)(timestamp, datasource, arg1, arg2);

}

function oraclize_query(uint timestamp, string datasource, string arg1, string arg2, uint gaslimit) oraclizeAPI internal returns (bytes32 id){

uint price = oraclize.getPrice(datasource, gaslimit);

if (price > 1 ether + tx.gasprice*gaslimit) return 0; // unexpectedly high price

return oraclize.query2_withGasLimit.value(price)(timestamp, datasource, arg1, arg2, gaslimit);

}

function oraclize_query(string datasource, string arg1, string arg2, uint gaslimit) oraclizeAPI internal returns (bytes32 id){

uint price = oraclize.getPrice(datasource, gaslimit);

if (price > 1 ether + tx.gasprice*gaslimit) return 0; // unexpectedly high price

return oraclize.query2_withGasLimit.value(price)(0, datasource, arg1, arg2, gaslimit);

}

function oraclize_query(string datasource, string[] argN) oraclizeAPI internal returns (bytes32 id){

uint price = oraclize.getPrice(datasource);

if (price > 1 ether + tx.gasprice*200000) return 0; // unexpectedly high price

bytes memory args = stra2cbor(argN);

return oraclize.queryN.value(price)(0, datasource, args);

}

function oraclize_query(uint timestamp, string datasource, string[] argN) oraclizeAPI internal returns (bytes32 id){

uint price = oraclize.getPrice(datasource);

if (price > 1 ether + tx.gasprice*200000) return 0; // unexpectedly high price

bytes memory args = stra2cbor(argN);

return oraclize.queryN.value(price)(timestamp, datasource, args);

}

function oraclize_query(uint timestamp, string datasource, string[] argN, uint gaslimit) oraclizeAPI internal returns (bytes32 id){

uint price = oraclize.getPrice(datasource, gaslimit);

if (price > 1 ether + tx.gasprice*gaslimit) return 0; // unexpectedly high price

bytes memory args = stra2cbor(argN);

return oraclize.queryN_withGasLimit.value(price)(timestamp, datasource, args, gaslimit);

}

function oraclize_query(string datasource, string[] argN, uint gaslimit) oraclizeAPI internal returns (bytes32 id){

uint price = oraclize.getPrice(datasource, gaslimit);

if (price > 1 ether + tx.gasprice*gaslimit) return 0; // unexpectedly high price

bytes memory args = stra2cbor(argN);

return oraclize.queryN_withGasLimit.value(price)(0, datasource, args, gaslimit);

}

function oraclize_query(string datasource, string[1] args) oraclizeAPI internal returns (bytes32 id) {

string[] memory dynargs = new string[](1);

dynargs[0] = args[0];

return oraclize_query(datasource, dynargs);

}

function oraclize_query(uint timestamp, string datasource, string[1] args) oraclizeAPI internal returns (bytes32 id) {

string[] memory dynargs = new string[](1);

dynargs[0] = args[0];

return oraclize_query(timestamp, datasource, dynargs);

}

function oraclize_query(uint timestamp, string datasource, string[1] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {

string[] memory dynargs = new string[](1);

dynargs[0] = args[0];

return oraclize_query(timestamp, datasource, dynargs, gaslimit);

}

function oraclize_query(string datasource, string[1] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {

string[] memory dynargs = new string[](1);

dynargs[0] = args[0];

return oraclize_query(datasource, dynargs, gaslimit);

}

function oraclize_query(string datasource, string[2] args) oraclizeAPI internal returns (bytes32 id) {

string[] memory dynargs = new string[](2);

dynargs[0] = args[0];

dynargs[1] = args[1];

return oraclize_query(datasource, dynargs);

}

function oraclize_query(uint timestamp, string datasource, string[2] args) oraclizeAPI internal returns (bytes32 id) {

string[] memory dynargs = new string[](2);

dynargs[0] = args[0];

dynargs[1] = args[1];

return oraclize_query(timestamp, datasource, dynargs);

}

function oraclize_query(uint timestamp, string datasource, string[2] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {

string[] memory dynargs = new string[](2);

dynargs[0] = args[0];

dynargs[1] = args[1];

return oraclize_query(timestamp, datasource, dynargs, gaslimit);

}

function oraclize_query(string datasource, string[2] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {

string[] memory dynargs = new string[](2);

dynargs[0] = args[0];

dynargs[1] = args[1];

return oraclize_query(datasource, dynargs, gaslimit);

}

function oraclize_query(string datasource, string[3] args) oraclizeAPI internal returns (bytes32 id) {

string[] memory dynargs = new string[](3);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

return oraclize_query(datasource, dynargs);

}

function oraclize_query(uint timestamp, string datasource, string[3] args) oraclizeAPI internal returns (bytes32 id) {

string[] memory dynargs = new string[](3);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

return oraclize_query(timestamp, datasource, dynargs);

}

function oraclize_query(uint timestamp, string datasource, string[3] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {

string[] memory dynargs = new string[](3);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

return oraclize_query(timestamp, datasource, dynargs, gaslimit);

}

function oraclize_query(string datasource, string[3] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {

string[] memory dynargs = new string[](3);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

return oraclize_query(datasource, dynargs, gaslimit);

}

function oraclize_query(string datasource, string[4] args) oraclizeAPI internal returns (bytes32 id) {

string[] memory dynargs = new string[](4);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

dynargs[3] = args[3];

return oraclize_query(datasource, dynargs);

}

function oraclize_query(uint timestamp, string datasource, string[4] args) oraclizeAPI internal returns (bytes32 id) {

string[] memory dynargs = new string[](4);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

dynargs[3] = args[3];

return oraclize_query(timestamp, datasource, dynargs);

}

function oraclize_query(uint timestamp, string datasource, string[4] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {

string[] memory dynargs = new string[](4);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

dynargs[3] = args[3];

return oraclize_query(timestamp, datasource, dynargs, gaslimit);

}

function oraclize_query(string datasource, string[4] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {

string[] memory dynargs = new string[](4);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

dynargs[3] = args[3];

return oraclize_query(datasource, dynargs, gaslimit);

}

function oraclize_query(string datasource, string[5] args) oraclizeAPI internal returns (bytes32 id) {

string[] memory dynargs = new string[](5);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

dynargs[3] = args[3];

dynargs[4] = args[4];

return oraclize_query(datasource, dynargs);

}

function oraclize_query(uint timestamp, string datasource, string[5] args) oraclizeAPI internal returns (bytes32 id) {

string[] memory dynargs = new string[](5);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

dynargs[3] = args[3];

dynargs[4] = args[4];

return oraclize_query(timestamp, datasource, dynargs);

}

function oraclize_query(uint timestamp, string datasource, string[5] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {

string[] memory dynargs = new string[](5);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

dynargs[3] = args[3];

dynargs[4] = args[4];

return oraclize_query(timestamp, datasource, dynargs, gaslimit);

}

function oraclize_query(string datasource, string[5] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {

string[] memory dynargs = new string[](5);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

dynargs[3] = args[3];

dynargs[4] = args[4];

return oraclize_query(datasource, dynargs, gaslimit);

}

function oraclize_query(string datasource, bytes[] argN) oraclizeAPI internal returns (bytes32 id){

uint price = oraclize.getPrice(datasource);

if (price > 1 ether + tx.gasprice*200000) return 0; // unexpectedly high price

bytes memory args = ba2cbor(argN);

return oraclize.queryN.value(price)(0, datasource, args);

}

function oraclize_query(uint timestamp, string datasource, bytes[] argN) oraclizeAPI internal returns (bytes32 id){

uint price = oraclize.getPrice(datasource);

if (price > 1 ether + tx.gasprice*200000) return 0; // unexpectedly high price

bytes memory args = ba2cbor(argN);

return oraclize.queryN.value(price)(timestamp, datasource, args);

}

function oraclize_query(uint timestamp, string datasource, bytes[] argN, uint gaslimit) oraclizeAPI internal returns (bytes32 id){

uint price = oraclize.getPrice(datasource, gaslimit);

if (price > 1 ether + tx.gasprice*gaslimit) return 0; // unexpectedly high price

bytes memory args = ba2cbor(argN);

return oraclize.queryN_withGasLimit.value(price)(timestamp, datasource, args, gaslimit);

}

function oraclize_query(string datasource, bytes[] argN, uint gaslimit) oraclizeAPI internal returns (bytes32 id){

uint price = oraclize.getPrice(datasource, gaslimit);

if (price > 1 ether + tx.gasprice*gaslimit) return 0; // unexpectedly high price

bytes memory args = ba2cbor(argN);

return oraclize.queryN_withGasLimit.value(price)(0, datasource, args, gaslimit);

}

function oraclize_query(string datasource, bytes[1] args) oraclizeAPI internal returns (bytes32 id) {

bytes[] memory dynargs = new bytes[](1);

dynargs[0] = args[0];

return oraclize_query(datasource, dynargs);

}

function oraclize_query(uint timestamp, string datasource, bytes[1] args) oraclizeAPI internal returns (bytes32 id) {

bytes[] memory dynargs = new bytes[](1);

dynargs[0] = args[0];

return oraclize_query(timestamp, datasource, dynargs);

}

function oraclize_query(uint timestamp, string datasource, bytes[1] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {

bytes[] memory dynargs = new bytes[](1);

dynargs[0] = args[0];

return oraclize_query(timestamp, datasource, dynargs, gaslimit);

}

function oraclize_query(string datasource, bytes[1] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {

bytes[] memory dynargs = new bytes[](1);

dynargs[0] = args[0];

return oraclize_query(datasource, dynargs, gaslimit);

}

function oraclize_query(string datasource, bytes[2] args) oraclizeAPI internal returns (bytes32 id) {

bytes[] memory dynargs = new bytes[](2);

dynargs[0] = args[0];

dynargs[1] = args[1];

return oraclize_query(datasource, dynargs);

}

function oraclize_query(uint timestamp, string datasource, bytes[2] args) oraclizeAPI internal returns (bytes32 id) {

bytes[] memory dynargs = new bytes[](2);

dynargs[0] = args[0];

dynargs[1] = args[1];

return oraclize_query(timestamp, datasource, dynargs);

}

function oraclize_query(uint timestamp, string datasource, bytes[2] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {

bytes[] memory dynargs = new bytes[](2);

dynargs[0] = args[0];

dynargs[1] = args[1];

return oraclize_query(timestamp, datasource, dynargs, gaslimit);

}

function oraclize_query(string datasource, bytes[2] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {

bytes[] memory dynargs = new bytes[](2);

dynargs[0] = args[0];

dynargs[1] = args[1];

return oraclize_query(datasource, dynargs, gaslimit);

}

function oraclize_query(string datasource, bytes[3] args) oraclizeAPI internal returns (bytes32 id) {

bytes[] memory dynargs = new bytes[](3);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

return oraclize_query(datasource, dynargs);

}

function oraclize_query(uint timestamp, string datasource, bytes[3] args) oraclizeAPI internal returns (bytes32 id) {

bytes[] memory dynargs = new bytes[](3);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

return oraclize_query(timestamp, datasource, dynargs);

}

function oraclize_query(uint timestamp, string datasource, bytes[3] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {

bytes[] memory dynargs = new bytes[](3);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

return oraclize_query(timestamp, datasource, dynargs, gaslimit);

}

function oraclize_query(string datasource, bytes[3] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {

bytes[] memory dynargs = new bytes[](3);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

return oraclize_query(datasource, dynargs, gaslimit);

}

function oraclize_query(string datasource, bytes[4] args) oraclizeAPI internal returns (bytes32 id) {

bytes[] memory dynargs = new bytes[](4);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

dynargs[3] = args[3];

return oraclize_query(datasource, dynargs);

}

function oraclize_query(uint timestamp, string datasource, bytes[4] args) oraclizeAPI internal returns (bytes32 id) {

bytes[] memory dynargs = new bytes[](4);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

dynargs[3] = args[3];

return oraclize_query(timestamp, datasource, dynargs);

}

function oraclize_query(uint timestamp, string datasource, bytes[4] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {

bytes[] memory dynargs = new bytes[](4);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

dynargs[3] = args[3];

return oraclize_query(timestamp, datasource, dynargs, gaslimit);

}

function oraclize_query(string datasource, bytes[4] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {

bytes[] memory dynargs = new bytes[](4);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

dynargs[3] = args[3];

return oraclize_query(datasource, dynargs, gaslimit);

}

function oraclize_query(string datasource, bytes[5] args) oraclizeAPI internal returns (bytes32 id) {

bytes[] memory dynargs = new bytes[](5);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

dynargs[3] = args[3];

dynargs[4] = args[4];

return oraclize_query(datasource, dynargs);

}

function oraclize_query(uint timestamp, string datasource, bytes[5] args) oraclizeAPI internal returns (bytes32 id) {

bytes[] memory dynargs = new bytes[](5);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

dynargs[3] = args[3];

dynargs[4] = args[4];

return oraclize_query(timestamp, datasource, dynargs);

}

function oraclize_query(uint timestamp, string datasource, bytes[5] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {

bytes[] memory dynargs = new bytes[](5);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

dynargs[3] = args[3];

dynargs[4] = args[4];

return oraclize_query(timestamp, datasource, dynargs, gaslimit);

}

function oraclize_query(string datasource, bytes[5] args, uint gaslimit) oraclizeAPI internal returns (bytes32 id) {

bytes[] memory dynargs = new bytes[](5);

dynargs[0] = args[0];

dynargs[1] = args[1];

dynargs[2] = args[2];

dynargs[3] = args[3];

dynargs[4] = args[4];

return oraclize_query(datasource, dynargs, gaslimit);

}

function oraclize_cbAddress() oraclizeAPI internal returns (address){

return oraclize.cbAddress();

}

function oraclize_setProof(byte proofP) oraclizeAPI internal {

return oraclize.setProofType(proofP);

}

function oraclize_setCustomGasPrice(uint gasPrice) oraclizeAPI internal {

return oraclize.setCustomGasPrice(gasPrice);

}

function oraclize_setConfig(bytes32 config) oraclizeAPI internal {

return oraclize.setConfig(config);

}

function oraclize_randomDS_getSessionPubKeyHash() oraclizeAPI internal returns (bytes32){

return oraclize.randomDS_getSessionPubKeyHash();

}

function getCodeSize(address _addr) constant internal returns(uint _size) {

assembly {

_size := extcodesize(_addr)

}

function parseAddr(string _a) internal returns (address){

bytes memory tmp = bytes(_a);

uint160 iaddr = 0;

uint160 b1;

uint160 b2;

for (uint i=2; i<2+2*20; i+=2){

iaddr *= 256;

b1 = uint160(tmp[i]);

b2 = uint160(tmp[i+1]);

if ((b1 >= 97)&&(b1 <= 102)) b1 -= 87;

else if ((b1 >= 65)&&(b1 <= 70)) b1 -= 55;

else if ((b1 >= 48)&&(b1 <= 57)) b1 -= 48;

if ((b2 >= 97)&&(b2 <= 102)) b2 -= 87;

else if ((b2 >= 65)&&(b2 <= 70)) b2 -= 55;

else if ((b2 >= 48)&&(b2 <= 57)) b2 -= 48;

iaddr += (b1*16+b2);

}

return address(iaddr);

}

function strCompare(string _a, string _b) internal returns (int) {

bytes memory a = bytes(_a);

bytes memory b = bytes(_b);

uint minLength = a.length;

if (b.length < minLength) minLength = b.length;

for (uint i = 0; i < minLength; i ++)

if (a[i] < b[i])

return -1;

else if (a[i] > b[i])

return 1;

if (a.length < b.length)

return -1;

else if (a.length > b.length)

return 1;

else

return 0;

}

function indexOf(string _haystack, string _needle) internal returns (int) {

bytes memory h = bytes(_haystack);

bytes memory n = bytes(_needle);

if(h.length < 1 || n.length < 1 || (n.length > h.length))

return -1;

else if(h.length > (2**128 -1))

return -1;

else

{

uint subindex = 0;

for (uint i = 0; i < h.length; i ++)

{

if (h[i] == n[0])

{

subindex = 1;

while(subindex < n.length && (i + subindex) < h.length && h[i + subindex] == n[subindex])

{

subindex++;

}

if(subindex == n.length)

return int(i);

}

return -1;

}

function strConcat(string _a, string _b, string _c, string _d, string _e) internal returns (string) {

bytes memory _ba = bytes(_a);

bytes memory _bb = bytes(_b);

bytes memory _bc = bytes(_c);

bytes memory _bd = bytes(_d);

bytes memory _be = bytes(_e);

string memory abcde = new string(_ba.length + _bb.length + _bc.length + _bd.length + _be.length);

bytes memory babcde = bytes(abcde);

uint k = 0;

for (uint i = 0; i < _ba.length; i++) babcde[k++] = _ba[i];

for (i = 0; i < _bb.length; i++) babcde[k++] = _bb[i];

for (i = 0; i < _bc.length; i++) babcde[k++] = _bc[i];

for (i = 0; i < _bd.length; i++) babcde[k++] = _bd[i];

for (i = 0; i < _be.length; i++) babcde[k++] = _be[i];

return string(babcde);

}

function strConcat(string _a, string _b, string _c, string _d) internal returns (string) {

return strConcat(_a, _b, _c, _d, "");

}

function strConcat(string _a, string _b, string _c) internal returns (string) {

return strConcat(_a, _b, _c, "", "");

}

function strConcat(string _a, string _b) internal returns (string) {

return strConcat(_a, _b, "", "", "");

}

// parseInt

function parseInt(string _a) internal returns (uint) {

return parseInt(_a, 0);

}

// parseInt(parseFloat*10^_b)

function parseInt(string _a, uint _b) internal returns (uint) {

bytes memory bresult = bytes(_a);

uint mint = 0;

bool decimals = false;

for (uint i=0; i<bresult.length; i++){

if ((bresult[i] >= 48)&&(bresult[i] <= 57)){

if (decimals){

if (_b == 0) break;

else _b--;

}

mint *= 10;

mint += uint(bresult[i]) - 48;

} else if (bresult[i] == 46) decimals = true;

}

if (_b > 0) mint *= 10**_b;

return mint;

}

function uint2str(uint i) internal returns (string){

if (i == 0) return "0";

uint j = i;

uint len;

while (j != 0){

len++;

j /= 10;

}

bytes memory bstr = new bytes(len);

uint k = len - 1;

while (i != 0){

bstr[k--] = byte(48 + i % 10);

i /= 10;

}

return string(bstr);

}

function stra2cbor(string[] arr) internal returns (bytes) {

uint arrlen = arr.length;

// get correct cbor output length

uint outputlen = 0;

bytes[] memory elemArray = new bytes[](arrlen);

for (uint i = 0; i < arrlen; i++) {

elemArray[i] = (bytes(arr[i]));

outputlen += elemArray[i].length + (elemArray[i].length - 1)/23 + 3; //+3 accounts for paired identifier types

}

uint ctr = 0;

uint cborlen = arrlen + 0x80;

outputlen += byte(cborlen).length;

bytes memory res = new bytes(outputlen);

while (byte(cborlen).length > ctr) {

res[ctr] = byte(cborlen)[ctr];

ctr++;

}

for (i = 0; i < arrlen; i++) {

res[ctr] = 0x5F;

ctr++;

for (uint x = 0; x < elemArray[i].length; x++) {

// if there's a bug with larger strings, this may be the culprit

if (x % 23 == 0) {

uint elemcborlen = elemArray[i].length - x >= 24 ? 23 : elemArray[i].length - x;

elemcborlen += 0x40;

uint lctr = ctr;

while (byte(elemcborlen).length > ctr - lctr) {

res[ctr] = byte(elemcborlen)[ctr - lctr];

ctr++;

}

res[ctr] = elemArray[i][x];

ctr++;

}

res[ctr] = 0xFF;

ctr++;

}

return res;

}

function ba2cbor(bytes[] arr) internal returns (bytes) {

uint arrlen = arr.length;

// get correct cbor output length

uint outputlen = 0;

bytes[] memory elemArray = new bytes[](arrlen);

for (uint i = 0; i < arrlen; i++) {

elemArray[i] = (bytes(arr[i]));

outputlen += elemArray[i].length + (elemArray[i].length - 1)/23 + 3; //+3 accounts for paired identifier types

}

uint ctr = 0;

uint cborlen = arrlen + 0x80;

outputlen += byte(cborlen).length;

bytes memory res = new bytes(outputlen);

while (byte(cborlen).length > ctr) {

res[ctr] = byte(cborlen)[ctr];

ctr++;

}

for (i = 0; i < arrlen; i++) {

res[ctr] = 0x5F;

ctr++;

for (uint x = 0; x < elemArray[i].length; x++) {

// if there's a bug with larger strings, this may be the culprit

if (x % 23 == 0) {

uint elemcborlen = elemArray[i].length - x >= 24 ? 23 : elemArray[i].length - x;

elemcborlen += 0x40;

uint lctr = ctr;

while (byte(elemcborlen).length > ctr - lctr) {

res[ctr] = byte(elemcborlen)[ctr - lctr];

ctr++;

}

res[ctr] = elemArray[i][x];

ctr++;

}

res[ctr] = 0xFF;

ctr++;

}

return res;

}

string oraclize_network_name;

function oraclize_setNetworkName(string _network_name) internal {

oraclize_network_name = _network_name;

}

function oraclize_getNetworkName() internal returns (string) {

return oraclize_network_name;

}

function oraclize_newRandomDSQuery(uint _delay, uint _nbytes, uint _customGasLimit) internal returns (bytes32){

if ((_nbytes == 0)||(_nbytes > 32)) throw;

bytes memory nbytes = new bytes(1);

nbytes[0] = byte(_nbytes);

bytes memory unonce = new bytes(32);

bytes memory sessionKeyHash = new bytes(32);

bytes32 sessionKeyHash_bytes32 = oraclize_randomDS_getSessionPubKeyHash();

assembly {

mstore(unonce, 0x20)

mstore(add(unonce, 0x20), xor(blockhash(sub(number, 1)), xor(coinbase, timestamp)))

mstore(sessionKeyHash, 0x20)

mstore(add(sessionKeyHash, 0x20), sessionKeyHash_bytes32)

}

bytes[3] memory args = [unonce, nbytes, sessionKeyHash];

bytes32 queryId = oraclize_query(_delay, "random", args, _customGasLimit);

oraclize_randomDS_setCommitment(queryId, sha3(bytes8(_delay), args[1], sha256(args[0]), args[2]));

return queryId;

}

function oraclize_randomDS_setCommitment(bytes32 queryId, bytes32 commitment) internal {

oraclize_randomDS_args[queryId] = commitment;

}

mapping(bytes32=>bytes32) oraclize_randomDS_args;

mapping(bytes32=>bool) oraclize_randomDS_sessionKeysHashVerified;

function verifySig(bytes32 tosignh, bytes dersig, bytes pubkey) internal returns (bool){

bool sigok;

address signer;

bytes32 sigr;

bytes32 sigs;

bytes memory sigr_ = new bytes(32);

uint offset = 4+(uint(dersig[3]) - 0x20);

sigr_ = copyBytes(dersig, offset, 32, sigr_, 0);

bytes memory sigs_ = new bytes(32);

offset += 32 + 2;

sigs_ = copyBytes(dersig, offset+(uint(dersig[offset-1]) - 0x20), 32, sigs_, 0);

assembly {

sigr := mload(add(sigr_, 32))

sigs := mload(add(sigs_, 32))

}

(sigok, signer) = safer_ecrecover(tosignh, 27, sigr, sigs);

if (address(sha3(pubkey)) == signer) return true;

else {

(sigok, signer) = safer_ecrecover(tosignh, 28, sigr, sigs);

return (address(sha3(pubkey)) == signer);

}

function oraclize_randomDS_proofVerify__sessionKeyValidity(bytes proof, uint sig2offset) internal returns (bool) {

bool sigok;

// Step 6: verify the attestation signature, APPKEY1 must sign the sessionKey from the correct ledger app (CODEHASH)

bytes memory sig2 = new bytes(uint(proof[sig2offset+1])+2);

copyBytes(proof, sig2offset, sig2.length, sig2, 0);

bytes memory appkey1_pubkey = new bytes(64);

copyBytes(proof, 3+1, 64, appkey1_pubkey, 0);

bytes memory tosign2 = new bytes(1+65+32);

tosign2[0] = 1; //role

copyBytes(proof, sig2offset-65, 65, tosign2, 1);

bytes memory CODEHASH = hex"fd94fa71bc0ba10d39d464d0d8f465efeef0a2764e3887fcc9df41ded20f505c";

copyBytes(CODEHASH, 0, 32, tosign2, 1+65);

sigok = verifySig(sha256(tosign2), sig2, appkey1_pubkey);

if (sigok == false) return false;

// Step 7: verify the APPKEY1 provenance (must be signed by Ledger)

bytes memory LEDGERKEY = hex"7fb956469c5c9b89840d55b43537e66a98dd4811ea0a27224272c2e5622911e8537a2f8e86a46baec82864e98dd01e9ccc2f8bc5dfc9cbe5a91a290498dd96e4";

bytes memory tosign3 = new bytes(1+65);

tosign3[0] = 0xFE;

copyBytes(proof, 3, 65, tosign3, 1);

bytes memory sig3 = new bytes(uint(proof[3+65+1])+2);

copyBytes(proof, 3+65, sig3.length, sig3, 0);

sigok = verifySig(sha256(tosign3), sig3, LEDGERKEY);

return sigok;

}

modifier oraclize_randomDS_proofVerify(bytes32 _queryId, string _result, bytes _proof) {

// Step 1: the prefix has to match 'LP\x01' (Ledger Proof version 1)

if ((_proof[0] != "L")||(_proof[1] != "P")||(_proof[2] != 1)) throw;

bool proofVerified = oraclize_randomDS_proofVerify__main(_proof, _queryId, bytes(_result), oraclize_getNetworkName());

if (proofVerified == false) throw;

}

function matchBytes32Prefix(bytes32 content, bytes prefix) internal returns (bool){

bool match_ = true;

for (var i=0; i<prefix.length; i++){

if (content[i] != prefix[i]) match_ = false;

}

return match_;

}

function oraclize_randomDS_proofVerify__main(bytes proof, bytes32 queryId, bytes result, string context_name) internal returns (bool){

bool checkok;

// Step 2: the unique keyhash has to match with the sha256 of (context name + queryId)

uint ledgerProofLength = 3+65+(uint(proof[3+65+1])+2)+32;

bytes memory keyhash = new bytes(32);

copyBytes(proof, ledgerProofLength, 32, keyhash, 0);

checkok = (sha3(keyhash) == sha3(sha256(context_name, queryId)));

if (checkok == false) return false;

bytes memory sig1 = new bytes(uint(proof[ledgerProofLength+(32+8+1+32)+1])+2);

copyBytes(proof, ledgerProofLength+(32+8+1+32), sig1.length, sig1, 0);

// Step 3: we assume sig1 is valid (it will be verified during step 5) and we verify if 'result' is the prefix of sha256(sig1)

checkok = matchBytes32Prefix(sha256(sig1), result);

if (checkok == false) return false;

// Step 4: commitment match verification, sha3(delay, nbytes, unonce, sessionKeyHash) == commitment in storage.

// This is to verify that the computed args match with the ones specified in the query.

bytes memory commitmentSlice1 = new bytes(8+1+32);

copyBytes(proof, ledgerProofLength+32, 8+1+32, commitmentSlice1, 0);

bytes memory sessionPubkey = new bytes(64);

uint sig2offset = ledgerProofLength+32+(8+1+32)+sig1.length+65;

copyBytes(proof, sig2offset-64, 64, sessionPubkey, 0);

bytes32 sessionPubkeyHash = sha256(sessionPubkey);

if (oraclize_randomDS_args[queryId] == sha3(commitmentSlice1, sessionPubkeyHash)){ //unonce, nbytes and sessionKeyHash match

delete oraclize_randomDS_args[queryId];

} else return false;

// Step 5: validity verification for sig1 (keyhash and args signed with the sessionKey)

bytes memory tosign1 = new bytes(32+8+1+32);

copyBytes(proof, ledgerProofLength, 32+8+1+32, tosign1, 0);

checkok = verifySig(sha256(tosign1), sig1, sessionPubkey);

if (checkok == false) return false;

// verify if sessionPubkeyHash was verified already, if not.. let's do it!

if (oraclize_randomDS_sessionKeysHashVerified[sessionPubkeyHash] == false){

oraclize_randomDS_sessionKeysHashVerified[sessionPubkeyHash] = oraclize_randomDS_proofVerify__sessionKeyValidity(proof, sig2offset);

}

return oraclize_randomDS_sessionKeysHashVerified[sessionPubkeyHash];

}

// the following function has been written by Alex Beregszaszi (@axic), use it under the terms of the MIT license

function copyBytes(bytes from, uint fromOffset, uint length, bytes to, uint toOffset) internal returns (bytes) {

uint minLength = length + toOffset;

if (to.length < minLength) {

// Buffer too small

throw; // Should be a better way?

}

// NOTE: the offset 32 is added to skip the `size` field of both bytes variables

uint i = 32 + fromOffset;

uint j = 32 + toOffset;

while (i < (32 + fromOffset + length)) {

assembly {

let tmp := mload(add(from, i))

mstore(add(to, j), tmp)

}

i += 32;

j += 32;

}

return to;

}

// the following function has been written by Alex Beregszaszi (@axic), use it under the terms of the MIT license

// Duplicate Solidity's ecrecover, but catching the CALL return value

function safer_ecrecover(bytes32 hash, uint8 v, bytes32 r, bytes32 s) internal returns (bool, address) {

// We do our own memory management here. Solidity uses memory offset

// 0x40 to store the current end of memory. We write past it (as

// writes are memory extensions), but don't update the offset so

// Solidity will reuse it. The memory used here is only needed for

// this context.

// FIXME: inline assembly can't access return values

bool ret;

address addr;

assembly {

let size := mload(0x40)

mstore(size, hash)

mstore(add(size, 32), v)

mstore(add(size, 64), r)

mstore(add(size, 96), s)

// NOTE: we can reuse the request memory because we deal with

// the return code

ret := call(3000, 1, 0, size, 128, size, 32)

addr := mload(size)

}

return (ret, addr);

}

// the following function has been written by Alex Beregszaszi (@axic), use it under the terms of the MIT license

function ecrecovery(bytes32 hash, bytes sig) internal returns (bool, address) {

bytes32 r;

bytes32 s;

uint8 v;

if (sig.length != 65)

return (false, 0);

// The signature format is a compact form of:

// {bytes32 r}{bytes32 s}{uint8 v}

// Compact means, uint8 is not padded to 32 bytes.

assembly {

r := mload(add(sig, 32))

s := mload(add(sig, 64))

// Here we are loading the last 32 bytes. We exploit the fact that

// 'mload' will pad with zeroes if we overread.

// There is no 'mload8' to do this, but that would be nicer.

v := byte(0, mload(add(sig, 96)))

// Alternative solution:

// 'byte' is not working due to the Solidity parser, so lets

// use the second best option, 'and'

// v := and(mload(add(sig, 65)), 255)

}

// albeit non-transactional signatures are not specified by the YP, one would expect it

// to match the YP range of [27, 28]

// geth uses [0, 1] and some clients have followed. This might change, see:

// https://github.com/ethereum/go-ethereum/issues/2053

if (v < 27)

v += 27;

if (v != 27 && v != 28)

return (false, 0);

return safer_ecrecover(hash, v, r, s);

}

// </ORACLIZE_API>

2018.08.19

ループとコールバックの問題(一応解決)

関数を外部で宣言しておくと期待通り動くらしい。

var ps = [];
var len = 5;

const metafunc = (func, arg) => {
    func(arg);
};

for(var i=0; i<len; i++){
    ps.push(new Promise(resolve => {
        setTimeout(
            metafunc(resolve, i),
            0
        );
    }));    
}
Promise.all(ps).then(results => {
    console.log(results)
});

var ps = [];

var len = 5;

const metafunc = (func, arg) => {

func(arg);

};

for(var i=0; i<len; i++){

ps.push(new Promise(resolve => {

setTimeout(

metafunc(resolve, i),

);

}));

}

Promise.all(ps).then(results => {

console.log(results)

});

[ 0, 1, 2, 3, 4 ]

1	[ 0, 1, 2, 3, 4 ]

2018.08.18

ループとコールバックの問題(未解決)

これ謎すぎる

var ps = [];
var len = 5;
for(var i=0; i<len; i++){
    ps.push(new Promise(resolve => {
        setTimeout(()=>{
            resolve(i);
        }, 0);
    }));    
}
Promise.all(ps).then(results => {
    console.log(results)
});

var ps = [];

var len = 5;

for(var i=0; i<len; i++){

ps.push(new Promise(resolve => {

setTimeout(()=>{

resolve(i);

}, 0);

}));

}

Promise.all(ps).then(results => {

console.log(results)

});

[ 5, 5, 5, 5, 5 ]

1	[ 5, 5, 5, 5, 5 ]

2018.08.13

素数判定高速化を関数ポインタでやる

素数判定高速化
を関数ポインタですっきりさせた

〜判定の流れ〜
(nが素数ならtrueを返す)
nが1以下ならfalse
nが2または3ならtrue
nが2の倍数ならfalse
nの平方根を整数で取得(5なら2, 10なら3)
nがnの平方根以下の、3以上の奇数(3,5,7,9,11,...)で1回でも割れたらfalse
上記すべて回避したらtrue

〜判定の流れ〜

(nが素数ならtrueを返す)

nが1以下ならfalse

nが2または3ならtrue

nが2の倍数ならfalse

nの平方根を整数で取得(5なら2, 10なら3)

nがnの平方根以下の、3以上の奇数(3,5,7,9,11,...)で1回でも割れたらfalse

上記すべて回避したらtrue

#include <stdio.h>
#include <math.h>
#include <time.h>
 
int isPrime_old(int n){
    if(n<=1){
        return 0;
    }
    if(2==n || 3==n){
        return 1;
    }
    int square_root = (int)sqrt(n);
    for(int i=2; i<=square_root; i++){
        if(0==n%i){
            return 0;
        }
    }
    return 1;
}
 
int isPrime_new(int n){
    if(n<=1){
        return 0;
    }
    if(2==n){
        return 1;
    }
    if(0==n%2){
        return 0;
    }
    int square_root = (int)sqrt(n);
    for(int i=3; i<=square_root; i+=2){
        if(0==n%i){
            return 0;
        }
    }
    return 1;
}
 
int getTimeSpanNanoSec(struct timespec tsStart, struct timespec tsEnd){
    int nsec = tsEnd.tv_nsec - tsStart.tv_nsec;
    int sec = tsEnd.tv_sec - tsStart.tv_sec;
    if(0 < sec){
        nsec += sec * 1000000000;
    }
    return nsec;
}

int dispTimeForPrimeSearch(
    char* title,
    int (*primeSearch)(int),
    int n
){
    printf("(%s) ", title);
    
    int cnt = 0;
    struct timespec tsStart, tsEnd;

    timespec_get(&tsStart, TIME_UTC);
    for(int i=-5; i<=n; i++){
        if(primeSearch(i)){ // landmark
            cnt++;
        }
    }
    timespec_get(&tsEnd, TIME_UTC);
    
    int nsec = getTimeSpanNanoSec(tsStart, tsEnd);
 
    printf("%d以下の素数の数 : %d個\t", n, cnt);
    printf("所要時間 %f ミリ秒\n", nsec / 1000000.0);
}

int main(){
    int n = 1000000; // n以下の素数
 
    dispTimeForPrimeSearch("NEW", isPrime_new, n);
    dispTimeForPrimeSearch("OLD", isPrime_old, n);
    
    return 0;
}

#include <stdio.h>

#include <math.h>

#include <time.h>

int isPrime_old(int n){

if(n<=1){

return 0;

}

if(2==n || 3==n){

return 1;

}

int square_root = (int)sqrt(n);

for(int i=2; i<=square_root; i++){

if(0==n%i){

return 0;

}

return 1;

}

int isPrime_new(int n){

if(n<=1){

return 0;

}

if(2==n){

return 1;

}

if(0==n%2){

return 0;

}

int square_root = (int)sqrt(n);

for(int i=3; i<=square_root; i+=2){

if(0==n%i){

return 0;

}

return 1;

}

int getTimeSpanNanoSec(struct timespec tsStart, struct timespec tsEnd){

int nsec = tsEnd.tv_nsec - tsStart.tv_nsec;

int sec = tsEnd.tv_sec - tsStart.tv_sec;

if(0 < sec){

nsec += sec * 1000000000;

}

return nsec;

}

int dispTimeForPrimeSearch(

char* title,

int (*primeSearch)(int),

int n

){

printf("(%s) ", title);

int cnt = 0;

struct timespec tsStart, tsEnd;

timespec_get(&tsStart, TIME_UTC);

for(int i=-5; i<=n; i++){

if(primeSearch(i)){ // landmark

cnt++;

}

timespec_get(&tsEnd, TIME_UTC);

int nsec = getTimeSpanNanoSec(tsStart, tsEnd);

printf("%d以下の素数の数 : %d個\t", n, cnt);

printf("所要時間 %f ミリ秒\n", nsec / 1000000.0);

}

int main(){

int n = 1000000; // n以下の素数

dispTimeForPrimeSearch("NEW", isPrime_new, n);

dispTimeForPrimeSearch("OLD", isPrime_old, n);

return 0;

}

(NEW) 1000000以下の素数の数 : 78498個	所要時間 108.884822 ミリ秒
(OLD) 1000000以下の素数の数 : 78498個	所要時間 227.985358 ミリ秒

1 2	(NEW) 1000000以下の素数の数 : 78498個所要時間 108.884822 ミリ秒 (OLD) 1000000以下の素数の数 : 78498個所要時間 227.985358 ミリ秒

2018.08.08

keyを保持したままvalueでソート

javascriptはkeyが勝手に昇順ソートされる。
そういうことはしないで欲しい。

// (u.js)
'use strict';
module.exports = {
  p(a) {
    if(undefined === a){
      a = '';
    }
    console.log(a);
  },
  foreach(obj, func) {
    for (const key of Object.keys(obj)) {
      const value = obj[key];
      func(key, value);
    }
  },
  dispKeyValue(k, v) {
    console.log(k + " => " + v);
  },
  getRandomInt(min = 0, max = 9) {
    min = Number(min);
    max = Number(max);
    if (max <= min) {
      return max;
    }
    const randomOffset = Math.floor(Math.random() * (max - min + 1));
    return min + randomOffset;
  }
};

// (u.js)

'use strict';

module.exports = {

p(a) {

if(undefined === a){

a = '';

}

console.log(a);

foreach(obj, func) {

for (const key of Object.keys(obj)) {

const value = obj[key];

func(key, value);

}

dispKeyValue(k, v) {

console.log(k + " => " + v);

getRandomInt(min = 0, max = 9) {

min = Number(min);

max = Number(max);

if (max <= min) {

return max;

}

const randomOffset = Math.floor(Math.random() * (max - min + 1));

return min + randomOffset;

}

};

// (Main.js)
main();

function main() {
  'use strict';
  const u = require('./u');
  const swap = (a, l, r) => {
    const t = a[l];
    a[l] = a[r];
    a[r] = t;
  };
  const bubblesort = (a) => {
    const len = a.length;
    for (let i = 0; i < len - 1; i++) {
      for (let j = i + 1; j < len; j++) {
        if (a[j] < a[i]) {
          swap(a, i, j);
        }
      }
    }
  };
  const getKeyOfValue = (a, v) => {
    for (const key of Object.keys(a)) {
      const value = a[key];
      if (v === value) {
        return key;
      }
    }
    return null;
  };
  const getDeepCopy = (a) => {
    let b = [];
    for(const k of Object.keys(a)){
        const v = a[k];
        b[k] = v;
    }
    return b;
  };
  const deepCopy_fromAtoB = (a, b) => {
      u.foreach(b, (k, v) => {
        delete b[k];
      });
      
      u.foreach(a, (k, v) => {
          b[k] = v;
      });
  };
  const bubblesort_keepkey = (a) => {
    let b = getDeepCopy(a);
    bubblesort(b);
    let c = [];
    for (const v of b) {
      const key = getKeyOfValue(a, v);
      c['_' + key] = v;
    }
//    a = getDeepCopy(c);
    deepCopy_fromAtoB(c, a);
  };
  const sub = () => {
    const times = 1000000;
    const a = [];
    for (let i = 0; i < times; i++) {
      const n = u.getRandomInt(0, 10);
      if (undefined === a[n]) {
        a[n] = 1;
      } else {
        a[n] += 1;
      }
    }
    bubblesort_keepkey(a);
    u.foreach(a, u.dispKeyValue);
  };
  // 実質、main関数
  sub();
}

// (Main.js)

main();

function main() {

'use strict';

const u = require('./u');

const swap = (a, l, r) => {

const t = a[l];

a[l] = a[r];

a[r] = t;

};

const bubblesort = (a) => {

const len = a.length;

for (let i = 0; i < len - 1; i++) {

for (let j = i + 1; j < len; j++) {

if (a[j] < a[i]) {

swap(a, i, j);

}

};

const getKeyOfValue = (a, v) => {

for (const key of Object.keys(a)) {

const value = a[key];

if (v === value) {

return key;

}

return null;

};

const getDeepCopy = (a) => {

let b = [];

for(const k of Object.keys(a)){

const v = a[k];

b[k] = v;

}

return b;

};

const deepCopy_fromAtoB = (a, b) => {

u.foreach(b, (k, v) => {

delete b[k];

});

u.foreach(a, (k, v) => {

b[k] = v;

});

};

const bubblesort_keepkey = (a) => {

let b = getDeepCopy(a);

bubblesort(b);

let c = [];

for (const v of b) {

const key = getKeyOfValue(a, v);

c['_' + key] = v;

}

// a = getDeepCopy(c);

deepCopy_fromAtoB(c, a);

};

const sub = () => {

const times = 1000000;

const a = [];

for (let i = 0; i < times; i++) {

const n = u.getRandomInt(0, 10);

if (undefined === a[n]) {

a[n] = 1;

} else {

a[n] += 1;

}

bubblesort_keepkey(a);

u.foreach(a, u.dispKeyValue);

};

// 実質、main関数

sub();

}

_8 => 90527
_3 => 90615
_2 => 90618
_9 => 90679
_6 => 90697
_0 => 90701
_5 => 91005
_7 => 91153
_4 => 91288
_1 => 91310
_10 => 91407

_8 => 90527

_3 => 90615

_2 => 90618

_9 => 90679

_6 => 90697

_0 => 90701

_5 => 91005

_7 => 91153

_4 => 91288

_1 => 91310

_10 => 91407

2018年 8月の投稿一覧

Promise.all()は本当に並列処理しているのか

60％を3回試行と80%を2回試行ではどちらの期待値が高いか

indexの宣言がletかvarかで結果が変わる件を難しく書いた

ループとコールバックの問題(varとletで結果が変わる)

その年最初の落雷が起こった日の統計

oraclizeを初めて使った

ループとコールバックの問題(一応解決)

ループとコールバックの問題(未解決)

素数判定高速化を関数ポインタでやる

keyを保持したままvalueでソート

最近の投稿

サイトマップ

カテゴリー

アーカイブ

人気の投稿とページ

Twitter