| package main | |
| import ( | |
| "bytes" | |
| "compress/zlib" | |
| "context" | |
| "encoding/binary" | |
| "fmt" | |
| "log" | |
| "math/big" |
| // Find the latest version of this script here: | |
| // https://gist.github.com/rsms/a8ad736ba3d448100577de2b88e826de | |
| // | |
| const EM = 2048 | |
| interface FontInfo { | |
| familyName :string | |
| styleName :string | |
| unitsPerEm :int | |
| ascender :int |
| /// Decodes a dynamically-generated Uniform Type Identifier for inspection purposes. (**NOT FOR PRODUCTION USE!**) | |
| /// Many, many thanks to http://alastairs-place.net/blog/2012/06/06/utis-are-better-than-you-think-and-heres-why/ | |
| /// | |
| /// <https://developer.apple.com/library/ios/documentation/FileManagement/Conceptual/understanding_utis/understand_utis_conc/understand_utis_conc.html#//apple_ref/doc/uid/TP40001319-CH202-BCGCDHIJ> | |
| func decodeDynUTI(_ uti: String) -> String? | |
| { | |
| let vec = Array("abcdefghkmnpqrstuvwxyz0123456789") | |
| let encoded = Array(uti).suffix(from: 5) | |
| var result: [UInt8] = [] |
| // SPDX-License-Identifier: Apache-2.0 | |
| pragma solidity 0.6.8; | |
| library SafeMath { | |
| /** | |
| * @dev Returns the addition of two unsigned integers, reverting on | |
| * overflow. | |
| * |
This a short overview of some of the things you can do with Ezno today. If you find any problems, file an issue.
The following examples show some errors that have been caught using type checking, partial/const evaluation and effects.
To get started we will install oxidation-compiler which has bindings for Ezno's checker. (you can also get the binary from the releases page).
npm install -g oxidation-compiler@latest
Go's "multiple return values" feature, can be used for several purposes. Among them for failure reporting to the function caller. Go has two conventions for failure reporting, but currently, no clear convention for which to use when. I've encountered different programmers that prefer different choices in different cases. In this article, we will discuss the two, and try to make the process of choosing our next function signature more conscious.
The algorithm takes as input a target which represents a number of blocks within which you would like your transaction to be included in the blockchain. It returns a fee rate that you should use on your transaction in order to achieve this.
The algorithm is conceptually very simple and does not attempt to have any predictive power over future conditions. It only looks at some recent history of transactions and returns the lowest fee rate such that in that recent history a very high fraction of transactions with that fee rate were confirmed in the block chain in less than the target number of blocks.
Transactions can occur with a nearly continuous range of fee rates and so in order to avoid tracking every historical transaction independently, they are grouped into fee rate "buckets". A fee rate bucket represents a range of fee rates within which the algorithm treats all transactions as having approximately the same fee rate and the answer th
| #!/usr/bin/bash | |
| ## | |
| ## Creates Service file based on JSON data | |
| ## | |
| # Sample JSON file: | |
| # { | |
| # "service_name": "test_service", | |
| # "description": "Netcore dev server", |
| // SPDX-License-Identifier: MIT | |
| pragma solidity ^0.8.0; | |
| contract HeapSort { | |
| function sort(uint256[] calldata _input) external pure returns (uint256[] memory) { | |
| _buildMaxHeap(_input); | |
| uint256 length = _input.length; | |
| unchecked { | |
| for (uint256 i = length - 1; i > 0; --i) { |
| // SPDX-License-Identifier: MIT | |
| pragma solidity >=0.8.4; | |
| library RadixSort { | |
| uint256 internal constant ALPHABET_SIZE_LOG_2 = 7; | |
| uint256 internal constant ALPHABET_SIZE = 1 << ALPHABET_SIZE_LOG_2; | |
| uint256 internal constant MASK = ALPHABET_SIZE - 1; | |
| function sort(uint256[] memory _list) internal pure { | |
| uint256 iterations; |