2018年 4月の投稿一覧

2018.04.21

truffleでイベント監視

truffle(ropsten)> event = eb.Transfer()

truffle(ropsten)> event.watch((e,r)=>{console.log(r)});

truffle(ropsten)> { address: '0x4d5a5f3b612f3b48780b0fc0a5c7ca87d7a89684',
  blockNumber: 3079488,
  transactionHash: '0x951ec7efa7a2da35e5358f56466506319852aa7eaeada51d20657eaaec2d00bb',
  transactionIndex: 19,
  blockHash: '0xc093ef62458d3c31cacbd024fe99932b95d0c872388e48a15decef1cb4803652',
  logIndex: 5,
  removed: false,
  event: 'Transfer',
  args: 
   { from: '0x4d5a5f3b612f3b48780b0fc0a5c7ca87d7a89684',
     to: '0x5ed767cfebf5953835340e012fee4048661b7d1b',
     tokenId: { [String: '7'] s: 1, e: 0, c: [Object] } } }
truffle(ropsten)>

truffle(ropsten)> event = eb.Transfer()

truffle(ropsten)> event.watch((e,r)=>{console.log(r)});

truffle(ropsten)> { address: '0x4d5a5f3b612f3b48780b0fc0a5c7ca87d7a89684',

blockNumber: 3079488,

transactionHash: '0x951ec7efa7a2da35e5358f56466506319852aa7eaeada51d20657eaaec2d00bb',

transactionIndex: 19,

blockHash: '0xc093ef62458d3c31cacbd024fe99932b95d0c872388e48a15decef1cb4803652',

logIndex: 5,

removed: false,

event: 'Transfer',

args:

{ from: '0x4d5a5f3b612f3b48780b0fc0a5c7ca87d7a89684',

to: '0x5ed767cfebf5953835340e012fee4048661b7d1b',

tokenId: { [String: '7'] s: 1, e: 0, c: [Object] } } }

truffle(ropsten)>

2018.04.21

NextCloud13を入れると最初から管理画面に出るセキュリティ警告を消す方法

この動画で8割くらい解消した。
この動画の英語は聴き取りやすい。
https://youtu.be/K6E65oKFOeE

〜やったこと〜
0. 上記の動画を字幕ONにして視聴する。Linuxに必要なモジュールがなければ適宜インストールする(APCuとか)。

1. .htaccessファイルのIfModule mod_headers.cタグに下記を追加

  Header always set Strict-Transport-Security "max-age=15768000; includeSubDomains; preload"

1	Header always set Strict-Transport-Security "max-age=15768000; includeSubDomains; preload"

.htaccessファイルはこうなる

<IfModule mod_headers.c>
  Header always set Strict-Transport-Security "max-age=15768000; includeSubDomains; preload"
  <IfModule mod_setenvif.c>
    <IfModule mod_fcgid.c>
       SetEnvIfNoCase ^Authorization$ "(.+)" XAUTHORIZATION=$1
       RequestHeader set XAuthorization %{XAUTHORIZATION}e env=XAUTHORIZATION
    </IfModule>
    <IfModule mod_proxy_fcgi.c>
       SetEnvIfNoCase Authorization "(.+)" HTTP_AUTHORIZATION=$1
    </IfModule>
  </IfModule>

  <IfModule mod_env.c>
    # Add security and privacy related headers
    Header set X-Content-Type-Options "nosniff"
    Header set X-XSS-Protection "1; mode=block"
    Header set X-Robots-Tag "none"
    Header set X-Download-Options "noopen"
    Header set X-Permitted-Cross-Domain-Policies "none"
    SetEnv modHeadersAvailable true
  </IfModule>

  # Add cache control for static resources
  <FilesMatch "\.(css|js|svg|gif)$">
    Header set Cache-Control "max-age=15778463"
  </FilesMatch>
  
  # Let browsers cache WOFF files for a week
  <FilesMatch "\.woff$">
    Header set Cache-Control "max-age=604800"
  </FilesMatch>
</IfModule>
<IfModule mod_php5.c>
  php_value upload_max_filesize 511M
  php_value post_max_size 511M
  php_value memory_limit 512M
  php_value mbstring.func_overload 0
  php_value always_populate_raw_post_data -1
  php_value default_charset 'UTF-8'
  php_value output_buffering 0
  <IfModule mod_env.c>
    SetEnv htaccessWorking true
  </IfModule>
</IfModule>
<IfModule mod_php7.c>
  php_value upload_max_filesize 511M
  php_value post_max_size 511M
  php_value memory_limit 512M
  php_value mbstring.func_overload 0
  php_value default_charset 'UTF-8'
  php_value output_buffering 0
  <IfModule mod_env.c>
    SetEnv htaccessWorking true
  </IfModule>
</IfModule>
<IfModule mod_rewrite.c>
  RewriteEngine on
  RewriteCond %{HTTP_USER_AGENT}  DavClnt
  RewriteRule ^$         /remote.php/webdav/          [L,R=302]
  RewriteRule .* - [env=HTTP_AUTHORIZATION:%{HTTP:Authorization}]
  RewriteRule ^\.well-known/host-meta /public.php?service=host-meta [QSA,L]
  RewriteRule ^\.well-known/host-meta\.json /public.php?service=host-meta-json [QSA,L]
  RewriteRule ^\.well-known/carddav /remote.php/dav/ [R=301,L]
  RewriteRule ^\.well-known/caldav /remote.php/dav/ [R=301,L]
  RewriteRule ^remote/(.*) remote.php [QSA,L]
  RewriteRule ^(?:build|tests|config|lib|3rdparty|templates)/.* - [R=404,L]
  RewriteCond %{REQUEST_URI} !^/.well-known/(acme-challenge|pki-validation)/.*
  RewriteRule ^(?:\.|autotest|occ|issue|indie|db_|console).* - [R=404,L]
</IfModule>
<IfModule mod_mime.c>
  AddType image/svg+xml svg svgz
  AddEncoding gzip svgz
</IfModule>
<IfModule mod_dir.c>
  DirectoryIndex index.php index.html
</IfModule>
AddDefaultCharset utf-8
Options -Indexes
<IfModule pagespeed_module>
  ModPagespeed Off
</IfModule>
#### DO NOT CHANGE ANYTHING ABOVE THIS LINE ####

ErrorDocument 403 //
ErrorDocument 404 //

Header always set Strict-Transport-Security "max-age=15768000; includeSubDomains; preload"

SetEnvIfNoCase ^Authorization$ "(.+)" XAUTHORIZATION=$1

RequestHeader set XAuthorization %{XAUTHORIZATION}e env=XAUTHORIZATION

</IfModule>

SetEnvIfNoCase Authorization "(.+)" HTTP_AUTHORIZATION=$1

</IfModule>

# Add security and privacy related headers

Header set X-Content-Type-Options "nosniff"

Header set X-XSS-Protection "1; mode=block"

Header set X-Robots-Tag "none"

Header set X-Download-Options "noopen"

Header set X-Permitted-Cross-Domain-Policies "none"

SetEnv modHeadersAvailable true

</IfModule>

# Add cache control for static resources

Header set Cache-Control "max-age=15778463"

</FilesMatch>

# Let browsers cache WOFF files for a week

Header set Cache-Control "max-age=604800"

</FilesMatch>

</IfModule>

php_value upload_max_filesize 511M

php_value post_max_size 511M

php_value memory_limit 512M

php_value mbstring.func_overload 0

php_value always_populate_raw_post_data -1

php_value default_charset 'UTF-8'

php_value output_buffering 0

SetEnv htaccessWorking true

</IfModule>

php_value upload_max_filesize 511M

php_value post_max_size 511M

php_value memory_limit 512M

php_value mbstring.func_overload 0

php_value default_charset 'UTF-8'

php_value output_buffering 0

SetEnv htaccessWorking true

</IfModule>

RewriteEngine on

RewriteCond %{HTTP_USER_AGENT} DavClnt

RewriteRule ^$ /remote.php/webdav/ [L,R=302]

RewriteRule .* - [env=HTTP_AUTHORIZATION:%{HTTP:Authorization}]

RewriteRule ^\.well-known/host-meta /public.php?service=host-meta [QSA,L]

RewriteRule ^\.well-known/host-meta\.json /public.php?service=host-meta-json [QSA,L]

RewriteRule ^\.well-known/carddav /remote.php/dav/ [R=301,L]

RewriteRule ^\.well-known/caldav /remote.php/dav/ [R=301,L]

RewriteRule ^remote/(.*) remote.php [QSA,L]

RewriteCond %{REQUEST_URI} !^/.well-known/(acme-challenge|pki-validation)/.*

</IfModule>

AddType image/svg+xml svg svgz

AddEncoding gzip svgz

</IfModule>

DirectoryIndex index.php index.html

</IfModule>

AddDefaultCharset utf-8

Options -Indexes

ModPagespeed Off

</IfModule>

#### DO NOT CHANGE ANYTHING ABOVE THIS LINE ####

ErrorDocument 403 //

ErrorDocument 404 //

2. php.iniの[PHP]セクションのどこでもいいので下記を追加

opcache.enable=1
opcache.enable_cli=1
opcache.interned_strings_buffer=8
opcache.max_accelerated_files=10000
opcache.memory_consumption=128
opcache.save_comments=1
opcache.revalidate_freq=1

opcache.enable=1

opcache.enable_cli=1

opcache.interned_strings_buffer=8

opcache.max_accelerated_files=10000

opcache.memory_consumption=128

opcache.save_comments=1

opcache.revalidate_freq=1

セキュリティ警告が消えた

2018.04.13

solidityで文字列とバイトコードの相互変換

こんなに簡単だったとは。
有効文字数は何文字だろう。

//Write your own contracts here. Currently compiles using solc v0.4.15+commit.bbb8e64f.
pragma solidity ^0.4.18;
contract SimpleStore {
  function s2b(string s) public pure returns(bytes) {
    return bytes(s);
  }
  function b2s(bytes b) public pure returns(string) {
    return string(b);
  }
  function s2btest(string s) public pure returns(string) {
    return b2s(s2b(s));
  }
}

//Write your own contracts here. Currently compiles using solc v0.4.15+commit.bbb8e64f.

pragma solidity ^0.4.18;

contract SimpleStore {

function s2b(string s) public pure returns(bytes) {

return bytes(s);

}

function b2s(bytes b) public pure returns(string) {

return string(b);

}

function s2btest(string s) public pure returns(string) {

return b2s(s2b(s));

}

2018.04.12

ガスコスト比較。Auctions

構造体のネーミングをミスった。

pragma solidity ^0.4.18;
contract Store {
    struct SaleAuctionSmallPrice {
        address seller;
        uint128 startPrice;
        uint128 endPrice;
        uint32  startTimeSec;
        uint32  durationSec;
        uint32  auctionId;
    }
    struct SaleAuctionBigPrice {
        address seller;
        uint    startPrice;
        uint    endPrice;
        uint32  startTimeSec;
        uint32  durationSec;
        uint32  auctionId;
    }
    struct SaleAuctionBigPriceSmallId {
        address seller;
        uint128 startPrice;
        uint128 endPrice;
        uint32  startTimeSec;
        uint32  durationSec;
        uint8   auctionId;
    }
    struct SaleAuctionSmallPriceSmallId {
        address seller;
        uint128 startPrice;
        uint128 endPrice;
        uint32  startTimeSec;
        uint32  durationSec;
        uint8   auctionId;
    }
    
    mapping(address => SaleAuctionSmallPrice        ) a;
    mapping(address => SaleAuctionBigPrice          ) b;
    mapping(address => SaleAuctionBigPriceSmallId   ) c;
    mapping(address => SaleAuctionSmallPriceSmallId ) d;
    
    function updateA() public {
		a[msg.sender].seller = msg.sender;
		a[msg.sender].startPrice++;
		a[msg.sender].endPrice++;
		a[msg.sender].startTimeSec++;
		a[msg.sender].durationSec++;
		a[msg.sender].auctionId++;
    }
    function updateB() public {
		b[msg.sender].seller = msg.sender;
		b[msg.sender].startPrice++;
		b[msg.sender].endPrice++;
		b[msg.sender].startTimeSec++;
		b[msg.sender].durationSec++;
		b[msg.sender].auctionId++;
    }
    function updateC() public {
		c[msg.sender].seller = msg.sender;
		c[msg.sender].startPrice++;
		c[msg.sender].endPrice++;
		c[msg.sender].startTimeSec++;
		c[msg.sender].durationSec++;
		c[msg.sender].auctionId++;
    }
    function updateD() public {
		d[msg.sender].seller = msg.sender;
		d[msg.sender].startPrice++;
		d[msg.sender].endPrice++;
		d[msg.sender].startTimeSec++;
		d[msg.sender].durationSec++;
		d[msg.sender].auctionId++;
    }
}

pragma solidity ^0.4.18;

contract Store {

struct SaleAuctionSmallPrice {

address seller;

uint128 startPrice;

uint128 endPrice;

uint32 startTimeSec;

uint32 durationSec;

uint32 auctionId;

}

struct SaleAuctionBigPrice {

address seller;

uint startPrice;

uint endPrice;

uint32 startTimeSec;

uint32 durationSec;

uint32 auctionId;

}

struct SaleAuctionBigPriceSmallId {

address seller;

uint128 startPrice;

uint128 endPrice;

uint32 startTimeSec;

uint32 durationSec;

uint8 auctionId;

}

struct SaleAuctionSmallPriceSmallId {

address seller;

uint128 startPrice;

uint128 endPrice;

uint32 startTimeSec;

uint32 durationSec;

uint8 auctionId;

}

mapping(address => SaleAuctionSmallPrice ) a;

mapping(address => SaleAuctionBigPrice ) b;

mapping(address => SaleAuctionBigPriceSmallId ) c;

mapping(address => SaleAuctionSmallPriceSmallId ) d;

function updateA() public {

a[msg.sender].seller = msg.sender;

a[msg.sender].startPrice++;

a[msg.sender].endPrice++;

a[msg.sender].startTimeSec++;

a[msg.sender].durationSec++;

a[msg.sender].auctionId++;

}

function updateB() public {

b[msg.sender].seller = msg.sender;

b[msg.sender].startPrice++;

b[msg.sender].endPrice++;

b[msg.sender].startTimeSec++;

b[msg.sender].durationSec++;

b[msg.sender].auctionId++;

}

function updateC() public {

c[msg.sender].seller = msg.sender;

c[msg.sender].startPrice++;

c[msg.sender].endPrice++;

c[msg.sender].startTimeSec++;

c[msg.sender].durationSec++;

c[msg.sender].auctionId++;

}

function updateD() public {

d[msg.sender].seller = msg.sender;

d[msg.sender].startPrice++;

d[msg.sender].endPrice++;

d[msg.sender].startTimeSec++;

d[msg.sender].durationSec++;

d[msg.sender].auctionId++;

}

メソッド	1回目   2回目  3回目
updateA 100225 55225 55225
updateB 114497 54497 54497
updateC 100203 55203 55203
updateD 100247 55247 55247

メソッド 1回目 2回目 3回目

updateA 100225 55225 55225

updateB 114497 54497 54497

updateC 100203 55203 55203

updateD 100247 55247 55247

2018.04.11

solidityのmappingのvalueは小さくしたほうが安いのか検証2

今度はmappingのvalueが構造体の場合を検証。

構造体の中身は、初回は小さいほどgasが安いが、
2回め以降は変わらない。というかそれほど構造体のパッキングは
gas節約に寄与しないような気がしてきた。

ropstenがおかしいのかな。
でもmainnetでの検証はおかねかかるからやりたくない。

pragma solidity ^0.4.18;

contract GasTest2 {
    struct SaleAuction32 {
        address seller;
        uint32 startPrice;
        uint32 endPrice;
        uint32 startTimeSec;
        uint32 durationSec;
    }
    struct SaleAuction128 {
        address seller;
        uint128 startPrice;
        uint128 endPrice;
        uint32 startTimeSec;
        uint32 durationSec;
    }
    struct SaleAuction256 {
        address seller;
        uint256 startPrice;
        uint256 endPrice;
        uint32 startTimeSec;
        uint32 durationSec;
    }

    mapping(address => SaleAuction32)    mapSale32;
    mapping(address => SaleAuction128)   mapSale128;
    mapping(address => SaleAuction256)   mapSale256;

    function setSale256() public {
        SaleAuction256 storage sale = mapSale256[msg.sender];
        sale.seller = msg.sender;
        sale.startPrice++;
        sale.endPrice++;
        sale.startTimeSec++;
        sale.durationSec++;
    }
    function setSale128() public {
        SaleAuction128 storage sale = mapSale128[msg.sender];
        sale.seller = msg.sender;
        sale.startPrice++;
        sale.endPrice++;
        sale.startTimeSec++;
        sale.durationSec++;
    }
    function setSale32 () public {
        SaleAuction32 storage sale = mapSale32[msg.sender];
        sale.seller = msg.sender;
        sale.startPrice++;
        sale.endPrice++;
        sale.startTimeSec++;
        sale.durationSec++;
    }
}

pragma solidity ^0.4.18;

contract GasTest2 {

struct SaleAuction32 {

address seller;

uint32 startPrice;

uint32 endPrice;

uint32 startTimeSec;

uint32 durationSec;

}

struct SaleAuction128 {

address seller;

uint128 startPrice;

uint128 endPrice;

uint32 startTimeSec;

uint32 durationSec;

}

struct SaleAuction256 {

address seller;

uint256 startPrice;

uint256 endPrice;

uint32 startTimeSec;

uint32 durationSec;

}

mapping(address => SaleAuction32) mapSale32;

mapping(address => SaleAuction128) mapSale128;

mapping(address => SaleAuction256) mapSale256;

function setSale256() public {

SaleAuction256 storage sale = mapSale256[msg.sender];

sale.seller = msg.sender;

sale.startPrice++;

sale.endPrice++;

sale.startTimeSec++;

sale.durationSec++;

}

function setSale128() public {

SaleAuction128 storage sale = mapSale128[msg.sender];

sale.seller = msg.sender;

sale.startPrice++;

sale.endPrice++;

sale.startTimeSec++;

sale.durationSec++;

}

function setSale32 () public {

SaleAuction32 storage sale = mapSale32[msg.sender];

sale.seller = msg.sender;

sale.startPrice++;

sale.endPrice++;

sale.startTimeSec++;

sale.durationSec++;

}

ガスコスト
関数        1回目   2回目  3回目
setSale256 108452  48452  48452
setSale128  94114  49114  49114
setSale32   79258  49258  49258

ガスコスト

関数 1回目 2回目 3回目

setSale256 108452 48452 48452

setSale128 94114 49114 49114

setSale32 79258 49258 49258

2018.04.11

solidityのmappingのvalueは小さくしたほうが安いのか検証

検証結果→そんなことない。むしろuint256が一番安い。

テストネットropstenで検証した。

pragma solidity ^0.4.18;

contract GasTest {
    mapping(address => uint256) map256;
    mapping(address => uint128) map128;
    mapping(address => uint64)  map64; 
    mapping(address => uint32)  map32; 
    mapping(address => uint16)  map16; 
    mapping(address => uint8)   map8;  

    function setMap256() public { map256[msg.sender]++; }
    function setMap128() public { map128[msg.sender]++; }
    function setMap64 () public { map64 [msg.sender]++; }
    function setMap32 () public { map32 [msg.sender]++; }
    function setMap16 () public { map16 [msg.sender]++; }
    function setMap8  () public { map8  [msg.sender]++; }
}

pragma solidity ^0.4.18;

contract GasTest {

mapping(address => uint256) map256;

mapping(address => uint128) map128;

mapping(address => uint64) map64;

mapping(address => uint32) map32;

mapping(address => uint16) map16;

mapping(address => uint8) map8;

function setMap256() public { map256[msg.sender]++; }

function setMap128() public { map128[msg.sender]++; }

function setMap64 () public { map64 [msg.sender]++; }

function setMap32 () public { map32 [msg.sender]++; }

function setMap16 () public { map16 [msg.sender]++; }

function setMap8 () public { map8 [msg.sender]++; }

}

ガスコスト
関数       1回目 2回目
setMap256 41748 26748
setMap128 42062 27062
setMap64  42084 27084
setMap32  42128 27128
setMap16  42106 27106
setMap8   42018 27018

ガスコスト

関数 1回目 2回目

setMap256 41748 26748

setMap128 42062 27062

setMap64 42084 27084

setMap32 42128 27128

setMap16 42106 27106

setMap8 42018 27018

2018.04.10

solidityで文字列連結して返却

文字列連結はこちらを使わせていただきました。
https://qiita.com/onokatio/items/4d74229bd6015379e379

デリミタを入力禁止にして運用する必要があるね

//Write your own contracts here. Currently compiles using solc v0.4.15+commit.bbb8e64f.
pragma solidity ^0.4.18;
contract SimpleStore {
  mapping(address => mapping(uint => string))
    addressToIdToMsg;
  mapping(address => uint) idToStoreCnt;

  string delimiter = "/";

  function setMsg(string _msg) public {
    uint cnt = idToStoreCnt[msg.sender];
    addressToIdToMsg[msg.sender][cnt] = _msg;
    idToStoreCnt[msg.sender]++;
  }

  function getMyAllMsg()
    public view returns(string)
  {
    string memory ret;
    string memory buf;
    uint storeLen = idToStoreCnt[msg.sender];
    for(uint i=0; i<storeLen; i++){
      buf = addressToIdToMsg[msg.sender][i];
      ret = _strConnect(ret, delimiter);
      ret = _strConnect(ret, buf);
    }
    return ret;
  }

  function _strConnect(string str1, string str2)
    private pure returns(string)
  {
    bytes memory strbyte1 = bytes(str1);
    bytes memory strbyte2 = bytes(str2);
    bytes memory str = new bytes(strbyte1.length + strbyte2.length);
    uint8 point = 0;
    for(uint8 j = 0; j < strbyte1.length;j++){
      str[point] = strbyte1[j];
      point++;
    }
    for(uint8 k = 0; k < strbyte2.length;k++){
      str[point] = strbyte2[k];
      point++;
    }
    return string(str);
  }
}

//Write your own contracts here. Currently compiles using solc v0.4.15+commit.bbb8e64f.

pragma solidity ^0.4.18;

contract SimpleStore {

mapping(address => mapping(uint => string))

addressToIdToMsg;

mapping(address => uint) idToStoreCnt;

string delimiter = "/";

function setMsg(string _msg) public {

uint cnt = idToStoreCnt[msg.sender];

addressToIdToMsg[msg.sender][cnt] = _msg;

idToStoreCnt[msg.sender]++;

}

function getMyAllMsg()

public view returns(string)

{

string memory ret;

string memory buf;

uint storeLen = idToStoreCnt[msg.sender];

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

buf = addressToIdToMsg[msg.sender][i];

ret = _strConnect(ret, delimiter);

ret = _strConnect(ret, buf);

}

return ret;

}

function _strConnect(string str1, string str2)

private pure returns(string)

{

bytes memory strbyte1 = bytes(str1);

bytes memory strbyte2 = bytes(str2);

bytes memory str = new bytes(strbyte1.length + strbyte2.length);

uint8 point = 0;

for(uint8 j = 0; j < strbyte1.length;j++){

str[point] = strbyte1[j];

point++;

}

for(uint8 k = 0; k < strbyte2.length;k++){

str[point] = strbyte2[k];

point++;

}

return string(str);

}

https://ethfiddle.com/-wjoyLlfIZ

2018.04.02

storageのstruct型配列とpush時のgasの関係

・packingとは別問題で、uint8はuint32に比べて微妙にgasが多く掛かるらしい（圧縮のためだとか）。

参考
https://www.bitdegree.org/learn/solidity-layout/
https://gitter.im/ethereum/solidity?at=5a1454772837ee5106af8fbb

//Write your own contracts here. Currently compiles using solc v0.4.15+commit.bbb8e64f.
pragma solidity ^0.4.18;
contract SimpleBirdsStore {
	/** structs */
    struct GoodBird {
        uint128 gene;
        uint32 sireId;
        uint32 matronId;
        uint32 cooldownEndTime;
        uint16 cooldownIndex;
        uint16 generation;
    }

    struct BadBird {
        uint128 gene;
        uint32 sireId;
        uint32 matronId;
        uint32 cooldownEndTime;
        uint16 cooldownIndex;
        uint32 generation;
    }

    struct TestBird {
        uint128 gene;
        uint32 sireId;
        uint32 matronId;
        uint16 generation;
        uint16 cooldownIndex;
        uint32 cooldownEndTime;
    }
    
    struct VeryBadBird {
        uint128 gene;
        uint32 sireId;
        uint32 matronId;
        uint16 generation;
        uint16 cooldownIndex;
        uint32 cooldownEndTime;
        uint32 cooldownEndTime2;
    }
    
    struct HeavyBird {
        uint128 gene;
        uint32 sireId;
        uint32 matronId;
        uint32 generation;
        uint32 cooldownIndex;
        uint32 cooldownEndTime;
    }
    
    struct VeryHeavyBird {
        uint128 gene;
        uint32 sireId;
        uint32 matronId;
        uint32 generation;
        uint32 cooldownIndex;
        uint32 cooldownEndTime;
        uint32 cooldownEndTime2;
    }
    
    GoodBird[] public goodBirds;
    BadBird[] public badBirds;
    TestBird[] public testBirds;
    VeryBadBird[] public veryBadBirds;
    HeavyBird[] public heavyBirds;
    VeryHeavyBird[] public veryHeavyBirds;
    
    event AddGoodBird(address indexed msgSender, uint indexed id);
    event AddBadBird(address indexed msgSender, uint indexed id);
    event AddTestBird(address indexed msgSender, uint indexed id);
    event AddVeryBadBird(address indexed msgSender, uint indexed id);
    event AddHeavyBird(address indexed msgSender, uint indexed id);
    event AddVeryHeavyBird(address indexed msgSender, uint indexed id);

    function addGoodBird() public {
        uint id = goodBirds.push(
            GoodBird(0, 0, 0, 0, 0, 0)
        ) - 1;
        AddGoodBird(msg.sender, id);
    }

    function addBadBird() public {
        uint id = badBirds.push(
            BadBird(0, 0, 0, 0, 0, 0)
        ) - 1;
        AddBadBird(msg.sender, id);
    }

    function addTestBird() public {
        uint id = testBirds.push(
            TestBird(0, 0, 0, 0, 0, 0)
        ) - 1;
        AddTestBird(msg.sender, id);
    }

    function addVeryBadBird() public {
        uint id = veryBadBirds.push(
            VeryBadBird(0, 0, 0, 0, 0, 0, 0)
        ) - 1;
        AddVeryBadBird(msg.sender, id);
    }

    function addHeavyBird() public {
        uint id = heavyBirds.push(
            HeavyBird(0, 0, 0, 0, 0, 0)
        ) - 1;
        AddHeavyBird(msg.sender, id);
    }

    function addVeryHeavyBird() public {
        uint id = veryHeavyBirds.push(
            VeryHeavyBird(0, 0, 0, 0, 0, 0, 0)
        ) - 1;
        AddVeryHeavyBird(msg.sender, id);
    }

}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

//Write your own contracts here. Currently compiles using solc v0.4.15+commit.bbb8e64f.

pragma solidity ^0.4.18;

contract SimpleBirdsStore {

/** structs */

struct GoodBird {

uint128 gene;

uint32 sireId;

uint32 matronId;

uint32 cooldownEndTime;

uint16 cooldownIndex;

uint16 generation;

}

struct BadBird {

uint128 gene;

uint32 sireId;

uint32 matronId;

uint32 cooldownEndTime;

uint16 cooldownIndex;

uint32 generation;

}

struct TestBird {

uint128 gene;

uint32 sireId;

uint32 matronId;

uint16 generation;

uint16 cooldownIndex;

uint32 cooldownEndTime;

}

struct VeryBadBird {

uint128 gene;

uint32 sireId;

uint32 matronId;

uint16 generation;

uint16 cooldownIndex;

uint32 cooldownEndTime;

uint32 cooldownEndTime2;

}

struct HeavyBird {

uint128 gene;

uint32 sireId;

uint32 matronId;

uint32 generation;

uint32 cooldownIndex;

uint32 cooldownEndTime;

}

struct VeryHeavyBird {

uint128 gene;

uint32 sireId;

uint32 matronId;

uint32 generation;

uint32 cooldownIndex;

uint32 cooldownEndTime;

uint32 cooldownEndTime2;

}

GoodBird[] public goodBirds;

BadBird[] public badBirds;

TestBird[] public testBirds;

VeryBadBird[] public veryBadBirds;

HeavyBird[] public heavyBirds;

VeryHeavyBird[] public veryHeavyBirds;

event AddGoodBird(address indexed msgSender, uint indexed id);

event AddBadBird(address indexed msgSender, uint indexed id);

event AddTestBird(address indexed msgSender, uint indexed id);

event AddVeryBadBird(address indexed msgSender, uint indexed id);

event AddHeavyBird(address indexed msgSender, uint indexed id);

event AddVeryHeavyBird(address indexed msgSender, uint indexed id);

function addGoodBird() public {

uint id = goodBirds.push(

GoodBird(0, 0, 0, 0, 0, 0)

) - 1;

AddGoodBird(msg.sender, id);

}

function addBadBird() public {

uint id = badBirds.push(

BadBird(0, 0, 0, 0, 0, 0)

) - 1;

AddBadBird(msg.sender, id);

}

function addTestBird() public {

uint id = testBirds.push(

TestBird(0, 0, 0, 0, 0, 0)

) - 1;

AddTestBird(msg.sender, id);

}

function addVeryBadBird() public {

uint id = veryBadBirds.push(

VeryBadBird(0, 0, 0, 0, 0, 0, 0)

) - 1;

AddVeryBadBird(msg.sender, id);

}

function addHeavyBird() public {

uint id = heavyBirds.push(

HeavyBird(0, 0, 0, 0, 0, 0)

) - 1;

AddHeavyBird(msg.sender, id);

}

function addVeryHeavyBird() public {

uint id = veryHeavyBirds.push(

VeryHeavyBird(0, 0, 0, 0, 0, 0, 0)

) - 1;

AddVeryHeavyBird(msg.sender, id);

}

2018.04.02

solidityでbubblesort

solidityは破壊的関数が実装できるようだ。Javaと一緒。

https://ethfiddle.com/18YvWzBm06

//Write your own contracts here. Currently compiles using solc v0.4.15+commit.bbb8e64f.
pragma solidity ^0.4.18;
contract SimpleStore {
  function getHashArray() public view returns(uint[]){
    bytes32 hash = keccak256(now);
    uint[] memory ret = new uint[](32);
    for(uint i=0; i<32; i++){
      ret[i] = uint(hash[i]);
    }
    return ret;
  }
  function swap(uint[] a, uint l, uint r)
    private pure
  {
    uint t = a[l];
    a[l] = a[r];
    a[r] = t;
  }
  function bubblesort(uint[] a) private pure {
    uint len = a.length;
    for(uint i=0; i<len-1; i++){
      for(uint j=i; j<len; j++){
        if(a[j] < a[i]){
          swap(a, i, j);
        }
      }
    }
  }
  function get() public view returns(uint[]){
    uint[] memory a = getHashArray();
    bubblesort(a);
    return a;
  }
}

//Write your own contracts here. Currently compiles using solc v0.4.15+commit.bbb8e64f.

pragma solidity ^0.4.18;

contract SimpleStore {

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

bytes32 hash = keccak256(now);

uint[] memory ret = new uint[](32);

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

ret[i] = uint(hash[i]);

}

return ret;

}

function swap(uint[] a, uint l, uint r)

private pure

{

uint t = a[l];

a[l] = a[r];

a[r] = t;

}

function bubblesort(uint[] a) private pure {

uint len = a.length;

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

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

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

swap(a, i, j);

}

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

uint[] memory a = getHashArray();

bubblesort(a);

return a;

}

getHashArray
[
"248",
"226",
"185",
"19",
"94",
"22",
"14",
"128",
"144",
"188",
"151",
"237",
"200",
"124",
"90",
"47",
"161",
"113",
"146",
"192",
"67",
"54",
"203",
"213",
"189",
"193",
"192",
"100",
"95",
"46",
"103",
"161"
]

get
[
"14",
"19",
"22",
"46",
"47",
"54",
"67",
"90",
"94",
"95",
"100",
"103",
"113",
"124",
"128",
"144",
"146",
"151",
"161",
"161",
"185",
"188",
"189",
"192",
"192",
"193",
"200",
"203",
"213",
"226",
"237",
"248"
]

getHashArray

[

"248",

"226",

"185",

"19",

"94",

"22",

"14",

"128",

"144",

"188",

"151",

"237",

"200",

"124",

"90",

"47",

"161",

"113",

"146",

"192",

"67",

"54",

"203",

"213",

"189",

"193",

"192",

"100",

"95",

"46",

"103",

"161"

]

get

[

"14",

"19",

"22",

"46",

"47",

"54",

"67",

"90",

"94",

"95",

"100",

"103",

"113",

"124",

"128",

"144",

"146",

"151",

"161",

"185",

"188",

"189",

"192",

"193",

"200",

"203",

"213",

"226",

"237",

"248"

]

2018.04.01

2^i ・3^j ・5^k(i,j,kは非負整数)という形で表せる正の整数

100個以前に変数がオーバーフローします。

/*
2^i ・3^j ・5^k(i,j,kは非負整数)という形で表せる正の整数を
小さい順に100個求めるc言語のプログラムを作成してください。
*/
#include <stdio.h>
#include <math.h>

long getNum(int i, int j, int k){
    if(i<=0 || j<=0 || k<=0){
        return -1;
    }
    return (long)(pow(2, i) * pow(3, j) * pow(5, k));
}

#define SIZE 100

typedef struct Num_ {
    long long n;
    int i;
    int j;
    int k;
} Num;

void cntUpNum(Num *a, int cnt, int i, int j, int k){
    a[cnt].n = getNum(i, j, k);
    a[cnt].i = i;
    a[cnt].j = j;
    a[cnt].k = k;
}

void disp(Num *a, int size){
    for(int i=0; i<size; i++){
        printf("%lld = 2^%d x 3^%d x 5^%d\n", a[i].n, a[i].i, a[i].j, a[i].k);
    }
}

int main(void){
    Num a[SIZE];
    int i, j, k, cnt = 0;
    i = j = k = 1;

    while(1){
        cntUpNum(a, cnt++, i  , j  , k  );
        cntUpNum(a, cnt++, i+1, j  , k  );
        cntUpNum(a, cnt++, i  , j+1, k  );
        if(SIZE <= cnt){
            break;
        }
        cntUpNum(a, cnt++, i  , j  , k+1);
        cntUpNum(a, cnt++, i+1, j+1, k  );
        cntUpNum(a, cnt++, i+1, j  , k+1);
        cntUpNum(a, cnt++, i  , j+1, k+1);
        i++;
        j++;
        k++;
    }
    
    disp(a, SIZE);
}

2^i ・3^j ・5^k(i,j,kは非負整数)という形で表せる正の整数を

小さい順に100個求めるc言語のプログラムを作成してください。

#include <stdio.h>

#include <math.h>

long getNum(int i, int j, int k){

if(i<=0 || j<=0 || k<=0){

return -1;

}

return (long)(pow(2, i) * pow(3, j) * pow(5, k));

}

#define SIZE 100

typedef struct Num_ {

long long n;

int i;

int j;

int k;

} Num;

void cntUpNum(Num *a, int cnt, int i, int j, int k){

a[cnt].n = getNum(i, j, k);

a[cnt].i = i;

a[cnt].j = j;

a[cnt].k = k;

}

void disp(Num *a, int size){

for(int i=0; i<size; i++){

printf("%lld = 2^%d x 3^%d x 5^%d\n", a[i].n, a[i].i, a[i].j, a[i].k);

}

int main(void){

Num a[SIZE];

int i, j, k, cnt = 0;

i = j = k = 1;

while(1){

cntUpNum(a, cnt++, i , j , k );

cntUpNum(a, cnt++, i+1, j , k );

cntUpNum(a, cnt++, i , j+1, k );

if(SIZE <= cnt){

break;

}

cntUpNum(a, cnt++, i , j , k+1);

cntUpNum(a, cnt++, i+1, j+1, k );

cntUpNum(a, cnt++, i+1, j , k+1);

cntUpNum(a, cnt++, i , j+1, k+1);

i++;

j++;

k++;

}

disp(a, SIZE);

}

30 = 2^1 x 3^1 x 5^1
60 = 2^2 x 3^1 x 5^1
90 = 2^1 x 3^2 x 5^1
150 = 2^1 x 3^1 x 5^2
180 = 2^2 x 3^2 x 5^1
300 = 2^2 x 3^1 x 5^2
450 = 2^1 x 3^2 x 5^2
900 = 2^2 x 3^2 x 5^2
1800 = 2^3 x 3^2 x 5^2
2700 = 2^2 x 3^3 x 5^2
4500 = 2^2 x 3^2 x 5^3
5400 = 2^3 x 3^3 x 5^2
9000 = 2^3 x 3^2 x 5^3
13500 = 2^2 x 3^3 x 5^3
27000 = 2^3 x 3^3 x 5^3
54000 = 2^4 x 3^3 x 5^3
81000 = 2^3 x 3^4 x 5^3
135000 = 2^3 x 3^3 x 5^4
162000 = 2^4 x 3^4 x 5^3
270000 = 2^4 x 3^3 x 5^4
405000 = 2^3 x 3^4 x 5^4
810000 = 2^4 x 3^4 x 5^4
1620000 = 2^5 x 3^4 x 5^4
2430000 = 2^4 x 3^5 x 5^4
4050000 = 2^4 x 3^4 x 5^5
4860000 = 2^5 x 3^5 x 5^4
8100000 = 2^5 x 3^4 x 5^5
12150000 = 2^4 x 3^5 x 5^5
24300000 = 2^5 x 3^5 x 5^5
48600000 = 2^6 x 3^5 x 5^5
72900000 = 2^5 x 3^6 x 5^5
121500000 = 2^5 x 3^5 x 5^6
145800000 = 2^6 x 3^6 x 5^5
243000000 = 2^6 x 3^5 x 5^6
364500000 = 2^5 x 3^6 x 5^6
729000000 = 2^6 x 3^6 x 5^6
1458000000 = 2^7 x 3^6 x 5^6
2187000000 = 2^6 x 3^7 x 5^6
3645000000 = 2^6 x 3^6 x 5^7
4374000000 = 2^7 x 3^7 x 5^6
7290000000 = 2^7 x 3^6 x 5^7
10935000000 = 2^6 x 3^7 x 5^7
21870000000 = 2^7 x 3^7 x 5^7
43740000000 = 2^8 x 3^7 x 5^7
65610000000 = 2^7 x 3^8 x 5^7
109350000000 = 2^7 x 3^7 x 5^8
131220000000 = 2^8 x 3^8 x 5^7
218700000000 = 2^8 x 3^7 x 5^8
328050000000 = 2^7 x 3^8 x 5^8
656100000000 = 2^8 x 3^8 x 5^8
1312200000000 = 2^9 x 3^8 x 5^8
1968300000000 = 2^8 x 3^9 x 5^8
3280500000000 = 2^8 x 3^8 x 5^9
3936600000000 = 2^9 x 3^9 x 5^8
6561000000000 = 2^9 x 3^8 x 5^9
9841500000000 = 2^8 x 3^9 x 5^9
19683000000000 = 2^9 x 3^9 x 5^9
39366000000000 = 2^10 x 3^9 x 5^9
59049000000000 = 2^9 x 3^10 x 5^9
98415000000000 = 2^9 x 3^9 x 5^10
118098000000000 = 2^10 x 3^10 x 5^9
196830000000000 = 2^10 x 3^9 x 5^10
295245000000000 = 2^9 x 3^10 x 5^10
590490000000000 = 2^10 x 3^10 x 5^10
1180980000000000 = 2^11 x 3^10 x 5^10
1771470000000000 = 2^10 x 3^11 x 5^10
2952450000000000 = 2^10 x 3^10 x 5^11
3542940000000000 = 2^11 x 3^11 x 5^10
5904900000000000 = 2^11 x 3^10 x 5^11
8857350000000000 = 2^10 x 3^11 x 5^11
17714700000000000 = 2^11 x 3^11 x 5^11
35429400000000000 = 2^12 x 3^11 x 5^11
53144100000000000 = 2^11 x 3^12 x 5^11
88573500000000000 = 2^11 x 3^11 x 5^12
106288200000000000 = 2^12 x 3^12 x 5^11
177147000000000000 = 2^12 x 3^11 x 5^12
265720500000000000 = 2^11 x 3^12 x 5^12
531441000000000000 = 2^12 x 3^12 x 5^12
1062882000000000000 = 2^13 x 3^12 x 5^12
1594323000000000000 = 2^12 x 3^13 x 5^12
2657205000000000000 = 2^12 x 3^12 x 5^13
3188646000000000000 = 2^13 x 3^13 x 5^12
5314410000000000000 = 2^13 x 3^12 x 5^13
7971615000000000000 = 2^12 x 3^13 x 5^13
-9223372036854775808 = 2^13 x 3^13 x 5^13
-9223372036854775808 = 2^14 x 3^13 x 5^13
-9223372036854775808 = 2^13 x 3^14 x 5^13
-9223372036854775808 = 2^13 x 3^13 x 5^14
-9223372036854775808 = 2^14 x 3^14 x 5^13
-9223372036854775808 = 2^14 x 3^13 x 5^14
-9223372036854775808 = 2^13 x 3^14 x 5^14
-9223372036854775808 = 2^14 x 3^14 x 5^14
-9223372036854775808 = 2^15 x 3^14 x 5^14
-9223372036854775808 = 2^14 x 3^15 x 5^14
-9223372036854775808 = 2^14 x 3^14 x 5^15
-9223372036854775808 = 2^15 x 3^15 x 5^14
-9223372036854775808 = 2^15 x 3^14 x 5^15
-9223372036854775808 = 2^14 x 3^15 x 5^15
-9223372036854775808 = 2^15 x 3^15 x 5^15
-9223372036854775808 = 2^16 x 3^15 x 5^15

100

30 = 2^1 x 3^1 x 5^1

60 = 2^2 x 3^1 x 5^1

90 = 2^1 x 3^2 x 5^1

150 = 2^1 x 3^1 x 5^2

180 = 2^2 x 3^2 x 5^1

300 = 2^2 x 3^1 x 5^2

450 = 2^1 x 3^2 x 5^2

900 = 2^2 x 3^2 x 5^2

1800 = 2^3 x 3^2 x 5^2

2700 = 2^2 x 3^3 x 5^2

4500 = 2^2 x 3^2 x 5^3

5400 = 2^3 x 3^3 x 5^2

9000 = 2^3 x 3^2 x 5^3

13500 = 2^2 x 3^3 x 5^3

27000 = 2^3 x 3^3 x 5^3

54000 = 2^4 x 3^3 x 5^3

81000 = 2^3 x 3^4 x 5^3

135000 = 2^3 x 3^3 x 5^4

162000 = 2^4 x 3^4 x 5^3

270000 = 2^4 x 3^3 x 5^4

405000 = 2^3 x 3^4 x 5^4

810000 = 2^4 x 3^4 x 5^4

1620000 = 2^5 x 3^4 x 5^4

2430000 = 2^4 x 3^5 x 5^4

4050000 = 2^4 x 3^4 x 5^5

4860000 = 2^5 x 3^5 x 5^4

8100000 = 2^5 x 3^4 x 5^5

12150000 = 2^4 x 3^5 x 5^5

24300000 = 2^5 x 3^5 x 5^5

48600000 = 2^6 x 3^5 x 5^5

72900000 = 2^5 x 3^6 x 5^5

121500000 = 2^5 x 3^5 x 5^6

145800000 = 2^6 x 3^6 x 5^5

243000000 = 2^6 x 3^5 x 5^6

364500000 = 2^5 x 3^6 x 5^6

729000000 = 2^6 x 3^6 x 5^6

1458000000 = 2^7 x 3^6 x 5^6

2187000000 = 2^6 x 3^7 x 5^6

3645000000 = 2^6 x 3^6 x 5^7

4374000000 = 2^7 x 3^7 x 5^6

7290000000 = 2^7 x 3^6 x 5^7

10935000000 = 2^6 x 3^7 x 5^7

21870000000 = 2^7 x 3^7 x 5^7

43740000000 = 2^8 x 3^7 x 5^7

65610000000 = 2^7 x 3^8 x 5^7

109350000000 = 2^7 x 3^7 x 5^8

131220000000 = 2^8 x 3^8 x 5^7

218700000000 = 2^8 x 3^7 x 5^8

328050000000 = 2^7 x 3^8 x 5^8

656100000000 = 2^8 x 3^8 x 5^8

1312200000000 = 2^9 x 3^8 x 5^8

1968300000000 = 2^8 x 3^9 x 5^8

3280500000000 = 2^8 x 3^8 x 5^9

3936600000000 = 2^9 x 3^9 x 5^8

6561000000000 = 2^9 x 3^8 x 5^9

9841500000000 = 2^8 x 3^9 x 5^9

19683000000000 = 2^9 x 3^9 x 5^9

39366000000000 = 2^10 x 3^9 x 5^9

59049000000000 = 2^9 x 3^10 x 5^9

98415000000000 = 2^9 x 3^9 x 5^10

118098000000000 = 2^10 x 3^10 x 5^9

196830000000000 = 2^10 x 3^9 x 5^10

295245000000000 = 2^9 x 3^10 x 5^10

590490000000000 = 2^10 x 3^10 x 5^10

1180980000000000 = 2^11 x 3^10 x 5^10

1771470000000000 = 2^10 x 3^11 x 5^10

2952450000000000 = 2^10 x 3^10 x 5^11

3542940000000000 = 2^11 x 3^11 x 5^10

5904900000000000 = 2^11 x 3^10 x 5^11

8857350000000000 = 2^10 x 3^11 x 5^11

17714700000000000 = 2^11 x 3^11 x 5^11

35429400000000000 = 2^12 x 3^11 x 5^11

53144100000000000 = 2^11 x 3^12 x 5^11

88573500000000000 = 2^11 x 3^11 x 5^12

106288200000000000 = 2^12 x 3^12 x 5^11

177147000000000000 = 2^12 x 3^11 x 5^12

265720500000000000 = 2^11 x 3^12 x 5^12

531441000000000000 = 2^12 x 3^12 x 5^12

1062882000000000000 = 2^13 x 3^12 x 5^12

1594323000000000000 = 2^12 x 3^13 x 5^12

2657205000000000000 = 2^12 x 3^12 x 5^13

3188646000000000000 = 2^13 x 3^13 x 5^12

5314410000000000000 = 2^13 x 3^12 x 5^13

7971615000000000000 = 2^12 x 3^13 x 5^13

-9223372036854775808 = 2^13 x 3^13 x 5^13

-9223372036854775808 = 2^14 x 3^13 x 5^13

-9223372036854775808 = 2^13 x 3^14 x 5^13

-9223372036854775808 = 2^13 x 3^13 x 5^14

-9223372036854775808 = 2^14 x 3^14 x 5^13

-9223372036854775808 = 2^14 x 3^13 x 5^14

-9223372036854775808 = 2^13 x 3^14 x 5^14

-9223372036854775808 = 2^14 x 3^14 x 5^14

-9223372036854775808 = 2^15 x 3^14 x 5^14

-9223372036854775808 = 2^14 x 3^15 x 5^14

-9223372036854775808 = 2^14 x 3^14 x 5^15

-9223372036854775808 = 2^15 x 3^15 x 5^14

-9223372036854775808 = 2^15 x 3^14 x 5^15

-9223372036854775808 = 2^14 x 3^15 x 5^15

-9223372036854775808 = 2^15 x 3^15 x 5^15

-9223372036854775808 = 2^16 x 3^15 x 5^15

2018年 4月の投稿一覧

truffleでイベント監視

NextCloud13を入れると最初から管理画面に出るセキュリティ警告を消す方法

solidityで文字列とバイトコードの相互変換

ガスコスト比較。Auctions

solidityのmappingのvalueは小さくしたほうが安いのか検証2

solidityのmappingのvalueは小さくしたほうが安いのか検証

solidityで文字列連結して返却

storageのstruct型配列とpush時のgasの関係

solidityでbubblesort

2^i ・3^j ・5^k(i,j,kは非負整数)という形で表せる正の整数

最近の投稿

サイトマップ

カテゴリー

アーカイブ

人気の投稿とページ

Twitter