davidecaruso

#!/bin/bash
cd /tmp || exit

printf "Downloading Robo 3T...\n"
filename="${1:-robo3t-1.4.4-linux-x86_64-e6ac9ec}"; # Default: v1.4.4
wget -q https://download.studio3t.com/robomongo/linux/$filename.tar.gz
if [ $? -ne 0 ];then
  printf "Invalid package given.\n"
  exit 1
fi

islishude

Complete example

pragma solidity ^0.6.2;

interface IERC20 {
    function totalSupply() external view returns (uint);
    function balanceOf(address tokenOwner) external view returns (uint balance);
    function allowance(address tokenOwner, address spender) external view returns (uint remaining);
    function transfer(address to, uint tokens) external returns (bool success);

Spyna

const pushServerPublicKey = "BIN2Jc5Vmkmy-S3AUrcMlpKxJpLeVRAfu9WBqUbJ70SJOCWGCGXKY-Xzyh7HDr6KbRDGYHjqZ06OcS3BjD7uAm8";

/**
 * checks if Push notification and service workers are supported by your browser
 */
function isPushNotificationSupported() {
  return "serviceWorker" in navigator && "PushManager" in window;
}

/**

bjoveski

function buildCreate2Address(senderAddress, saltHex, bytecode) {
  return web3.utils.toChecksumAddress(`0x${web3.utils.sha3(`0x${[
    'ff',
    senderAddress,
    saltHex,
    web3.utils.sha3(bytecode)
  ].map(x => x.replace(/0x/, ''))
    .join('')}`).slice(-40)}`);
}

miguelmota

function buildCreate2Address(creatorAddress, saltHex, byteCode) {
  const parts = [
    'ff',
    creatorAddress.slice(2),
    saltHex.slice(2),
    web3.utils.sha3(byteCode).slice(2),
  ]

  const partsHash = web3.utils.sha3(`0x${parts.join('')}`)
  return `0x${partsHash.slice(-40)}`.toLowerCase()

willianmano

pragma solidity ^0.4.21;

contract Lottery {
  address public manager;
  address[] public players;

  constructor() public {
    manager = msg.sender;
  }

edhaase

/*
* Not actually a JS file; Normally you'd break these components up.
*/

/* creating the database connection */
var db = new Sequelize('database', 'username', 'password', ...);

/* loading the models */
var fs = require('fs');
var path = require('path');

marcoscastro

// Grafos - Lista de adjacência

#include <iostream>
#include <list>
#include <algorithm> // função find

using namespace std;

class Grafo
{