Mercurial > hg > bitcoin
comparison uint256.h @ 153:de492f5bf245 draft
automatically change displayed address whenever it receives anything,
added help and -? for daemon command line rpc commands,
only relay addr messages to 5 random nodes to save bandwidth,
started setting wtx.fFromMe flag,
trickle out tx inventory messages to protect privacy
-- version 0.2.10
author | s_nakamoto <s_nakamoto@1a98c847-1fd6-4fd8-948a-caf3550aa51b> |
---|---|
date | Thu, 10 Jun 2010 23:10:30 +0000 |
parents | 52226e2e4fc3 |
children | c6961d8d9a4f |
comparison
equal
deleted
inserted
replaced
152:4c6e1d4a4fb0 | 153:de492f5bf245 |
---|---|
386 | 386 |
387 | 387 |
388 // | 388 // |
389 // uint160 and uint256 could be implemented as templates, but to keep | 389 // uint160 and uint256 could be implemented as templates, but to keep |
390 // compile errors and debugging cleaner, they're copy and pasted. | 390 // compile errors and debugging cleaner, they're copy and pasted. |
391 // It's safe to search and replace 160 with 256 and vice versa. | |
392 // | 391 // |
393 | 392 |
394 | 393 |
395 | 394 |
396 ////////////////////////////////////////////////////////////////////////////// | 395 ////////////////////////////////////////////////////////////////////////////// |
403 public: | 402 public: |
404 typedef base_uint160 basetype; | 403 typedef base_uint160 basetype; |
405 | 404 |
406 uint160() | 405 uint160() |
407 { | 406 { |
407 for (int i = 0; i < WIDTH; i++) | |
408 pn[i] = 0; | |
408 } | 409 } |
409 | 410 |
410 uint160(const basetype& b) | 411 uint160(const basetype& b) |
411 { | 412 { |
412 for (int i = 0; i < WIDTH; i++) | 413 for (int i = 0; i < WIDTH; i++) |
515 public: | 516 public: |
516 typedef base_uint256 basetype; | 517 typedef base_uint256 basetype; |
517 | 518 |
518 uint256() | 519 uint256() |
519 { | 520 { |
521 for (int i = 0; i < WIDTH; i++) | |
522 pn[i] = 0; | |
520 } | 523 } |
521 | 524 |
522 uint256(const basetype& b) | 525 uint256(const basetype& b) |
523 { | 526 { |
524 for (int i = 0; i < WIDTH; i++) | 527 for (int i = 0; i < WIDTH; i++) |