Compare commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
a407c10b02 | ||
|
|
995b5a6666 | ||
|
|
4badde8595 | ||
|
|
6cce052bf7 | ||
|
|
df4a86a0df | ||
|
|
11f5bf4243 | ||
|
|
5d22b17af5 | ||
|
|
4a2738ddf1 | ||
|
|
4e147cb380 | ||
|
|
dc34766423 | ||
|
|
cd10b981b1 | ||
|
|
fe493bff9e | ||
|
|
7930840005 | ||
|
|
d5df3ff10d | ||
|
|
a0221c3bf7 | ||
|
|
c3d315ed49 | ||
|
|
e120c1de69 | ||
|
|
6fc7e0860e | ||
|
|
1d071a9998 | ||
|
|
6b13bd1d45 | ||
|
|
c0f7584503 | ||
|
|
ff07b5b927 | ||
|
|
4e1df4de23 | ||
|
|
4ff143387e | ||
|
|
8817a7df51 | ||
|
|
6f0b24d62d | ||
|
|
62f4bedb17 | ||
|
|
0a2c49911d | ||
|
|
2f7c03cbe8 | ||
|
|
172f6aca32 | ||
|
|
d26db867dd | ||
|
|
39580f1740 | ||
|
|
29bc408431 | ||
|
|
dffd498152 | ||
|
|
a2fa2c0720 | ||
|
|
b2ba3f5ea0 | ||
|
|
52628772b3 | ||
|
|
cc84e7fb91 | ||
|
|
04b3983844 | ||
|
|
83e1df0403 | ||
|
|
fbbf63fa54 | ||
|
|
3238cd9735 | ||
|
|
047e41be82 | ||
|
|
cb9c633936 | ||
|
|
d29f110a11 | ||
|
|
40e034ef1b | ||
|
|
865f746636 | ||
|
|
6179347045 | ||
|
|
b2216fd270 | ||
|
|
5a1d288b17 | ||
|
|
800bb51fbf | ||
|
|
30e941195a | ||
|
|
32e73f4586 | ||
|
|
d438e9f968 | ||
|
|
20ae466765 | ||
|
|
84b093b981 | ||
|
|
84f074b9fa | ||
|
|
7a0724098f | ||
|
|
04d77ab376 | ||
|
|
24d5e64d0b | ||
|
|
3a7e7adfe3 | ||
|
|
2b1d07fee4 | ||
|
|
dd8638dba8 | ||
|
|
4ec3516045 | ||
|
|
5913a70f7e | ||
|
|
e6629319a5 | ||
|
|
4a8e372720 | ||
|
|
1b896ae75b | ||
|
|
ffad0154c1 | ||
|
|
61664b027b | ||
|
|
86592934cb | ||
|
|
6542b53b36 | ||
|
|
e20f6785ad | ||
|
|
51d6b690cb | ||
|
|
03b3828a65 | ||
|
|
34f61bbbf0 | ||
|
|
cddeccd2b9 | ||
|
|
af860d89cf | ||
|
|
65505b3d55 | ||
|
|
b6d9e4e591 | ||
|
|
b89ff5f456 | ||
|
|
f288fac940 | ||
|
|
7308f24663 | ||
|
|
5a83924245 | ||
|
|
df5f764d52 | ||
|
|
c8199b158d | ||
|
|
270307a290 | ||
|
|
0d0d7c5320 | ||
|
|
e7eaf46f3c | ||
|
|
fa505b789a | ||
|
|
1b80858a44 | ||
|
|
e0089d19f2 | ||
|
|
50c2ed0fee | ||
|
|
e4481fc213 | ||
|
|
083a4a1b88 | ||
|
|
cbb6acd75c | ||
|
|
b51444fd5c | ||
|
|
774246d16f | ||
|
|
3e26b5f342 | ||
|
|
93eb2e3c47 | ||
|
|
ec3801f07a | ||
|
|
2df151e325 | ||
|
|
a186aaa073 | ||
|
|
80bb42c912 | ||
|
|
e713501a5d | ||
|
|
0551e881f5 | ||
|
|
31008a84b2 |
No files matched your search
@@ -0,0 +1,5 @@
|
||||
[bumpversion]
|
||||
current_version = 0.3.16
|
||||
commit = True
|
||||
tag = True
|
||||
|
||||
@@ -45,7 +45,7 @@ src/qt/forms/ui_*.h
|
||||
|
||||
src/qt/test/moc*.cpp
|
||||
|
||||
dependencies/*
|
||||
lbrycrd-dependencies/*
|
||||
|
||||
.deps
|
||||
.dirstamp
|
||||
@@ -74,6 +74,7 @@ dependencies/*
|
||||
#libtool object files
|
||||
*.lo
|
||||
*.la
|
||||
start_time
|
||||
|
||||
# Compilation and Qt preprocessor part
|
||||
*.qm
|
||||
|
||||
@@ -4,14 +4,23 @@ matrix:
|
||||
sudo: required
|
||||
dist: trusty
|
||||
language: c
|
||||
env: TARGET=linux
|
||||
- os: linux
|
||||
sudo: required
|
||||
dist: trusty
|
||||
language: c
|
||||
env: TARGET=windows
|
||||
- os: osx
|
||||
language: c
|
||||
osx_image: xcode7.3
|
||||
env: TARGET=osx
|
||||
|
||||
cache:
|
||||
apt: true
|
||||
ccache: true
|
||||
directories:
|
||||
- build
|
||||
- depends/built
|
||||
|
||||
before_install:
|
||||
- date +%s > "${TRAVIS_BUILD_DIR}/start_time"
|
||||
@@ -20,8 +29,12 @@ before_install:
|
||||
|
||||
install: true
|
||||
script:
|
||||
- ./reproducible_build.sh -t -o -c
|
||||
- zip -j "lbrycrd-${TRAVIS_OS_NAME}.zip" src/lbrycrdd src/lbrycrd-cli src/lbrycrd-tx
|
||||
- if [[ "${TARGET}" == "osx" ]]; then ./reproducible_build.sh -t -o -c; fi
|
||||
- if [[ "${TARGET}" == "linux" ]]; then ./reproducible_build.sh -t -o -c; fi
|
||||
- if [[ "${TARGET}" == "windows" ]]; then ./packaging/build_windows.sh; fi
|
||||
- if [[ "${TARGET}" == "osx" ]]; then zip -j "lbrycrd-${TARGET}.zip" src/lbrycrdd src/lbrycrd-cli src/lbrycrd-tx; fi
|
||||
- if [[ "${TARGET}" == "linux" ]]; then zip -j "lbrycrd-${TARGET}.zip" src/lbrycrdd src/lbrycrd-cli src/lbrycrd-tx; fi
|
||||
- if [[ "${TARGET}" == "windows" ]]; then zip -j "lbrycrd-${TARGET}.zip" src/lbrycrdd.exe src/lbrycrd-cli.exe src/lbrycrd-tx.exe; fi
|
||||
|
||||
before_cache:
|
||||
- ls -lh build
|
||||
@@ -33,7 +46,7 @@ deploy:
|
||||
skip_cleanup: true
|
||||
on:
|
||||
tags: true
|
||||
condition: "$TRAVIS_OS_NAME = linux"
|
||||
condition: "$TARGET = linux"
|
||||
api_key:
|
||||
secure: "ibN+PQg84f0tgJLV3KaHjkHmgFNOPqBLIrSU42moen22xxT2VIn0j7DkFaLLts1fs/+/gxmrvhOQ0vUFJqmflZ3kCeyedP/CVgZz7D7HRVK0cYUMJ2F9VWMZAFIX6A67OUlypqZqzKAKrZHx3HXky6Z8NBU23JgWqDm8PcrbbgMLvB2lvWVASjJVKreaL9BOxFOOOrAj6xAIm9ogTOnFVI/AhufNOKOTZaiprcbqMngwHeaILbwEJVqv5P2YUurC6Sq+QaH26tX00DtsYOW+n8AA3Fe48+L6rqa6Q8ru+dhPuR/Apr2+DTZ+npzY8leV3A7mYUeLo4JLaEH6n1TLVt65cX7nuesS7KsSKBSxs7q7bsqeapDcMskZz5JR4EK4S96CuHZEnn6+efpH8IrxWpbeO3EibJfyT8tMJKw7Zym5mPr+sz6xSlVMoBVcCm+7z9e7Zcqukdvdy8jM7sGP9qusqEhpojh0o+gPgr9p13SfR+6OCpj9gwxPCnZO8RBfh1cbz9vFSVlDyUYcpI2CCCpPazA1glTsEDk+VtznnUMmWksXWfxBFV81jQB2SnoZKlnsiEuNMwhiMCMEkRFo74+AsUr2UjmKJ5KC8ACwsn475PoLZBh2J6fyXBHMdbrGfK+Zt5K2IHRRtDaZVT4eHqYzxh8KhalsuBNxCo3FygI="
|
||||
- provider: releases
|
||||
@@ -41,7 +54,15 @@ deploy:
|
||||
skip_cleanup: true
|
||||
on:
|
||||
tags: true
|
||||
condition: "$TRAVIS_OS_NAME = osx"
|
||||
condition: "$TARGET = osx"
|
||||
api_key:
|
||||
secure: "ibN+PQg84f0tgJLV3KaHjkHmgFNOPqBLIrSU42moen22xxT2VIn0j7DkFaLLts1fs/+/gxmrvhOQ0vUFJqmflZ3kCeyedP/CVgZz7D7HRVK0cYUMJ2F9VWMZAFIX6A67OUlypqZqzKAKrZHx3HXky6Z8NBU23JgWqDm8PcrbbgMLvB2lvWVASjJVKreaL9BOxFOOOrAj6xAIm9ogTOnFVI/AhufNOKOTZaiprcbqMngwHeaILbwEJVqv5P2YUurC6Sq+QaH26tX00DtsYOW+n8AA3Fe48+L6rqa6Q8ru+dhPuR/Apr2+DTZ+npzY8leV3A7mYUeLo4JLaEH6n1TLVt65cX7nuesS7KsSKBSxs7q7bsqeapDcMskZz5JR4EK4S96CuHZEnn6+efpH8IrxWpbeO3EibJfyT8tMJKw7Zym5mPr+sz6xSlVMoBVcCm+7z9e7Zcqukdvdy8jM7sGP9qusqEhpojh0o+gPgr9p13SfR+6OCpj9gwxPCnZO8RBfh1cbz9vFSVlDyUYcpI2CCCpPazA1glTsEDk+VtznnUMmWksXWfxBFV81jQB2SnoZKlnsiEuNMwhiMCMEkRFo74+AsUr2UjmKJ5KC8ACwsn475PoLZBh2J6fyXBHMdbrGfK+Zt5K2IHRRtDaZVT4eHqYzxh8KhalsuBNxCo3FygI="
|
||||
- provider: releases
|
||||
file: lbrycrd-windows.zip
|
||||
skip_cleanup: true
|
||||
on:
|
||||
tags: true
|
||||
condition: "$TARGET = windows"
|
||||
api_key:
|
||||
secure: "ibN+PQg84f0tgJLV3KaHjkHmgFNOPqBLIrSU42moen22xxT2VIn0j7DkFaLLts1fs/+/gxmrvhOQ0vUFJqmflZ3kCeyedP/CVgZz7D7HRVK0cYUMJ2F9VWMZAFIX6A67OUlypqZqzKAKrZHx3HXky6Z8NBU23JgWqDm8PcrbbgMLvB2lvWVASjJVKreaL9BOxFOOOrAj6xAIm9ogTOnFVI/AhufNOKOTZaiprcbqMngwHeaILbwEJVqv5P2YUurC6Sq+QaH26tX00DtsYOW+n8AA3Fe48+L6rqa6Q8ru+dhPuR/Apr2+DTZ+npzY8leV3A7mYUeLo4JLaEH6n1TLVt65cX7nuesS7KsSKBSxs7q7bsqeapDcMskZz5JR4EK4S96CuHZEnn6+efpH8IrxWpbeO3EibJfyT8tMJKw7Zym5mPr+sz6xSlVMoBVcCm+7z9e7Zcqukdvdy8jM7sGP9qusqEhpojh0o+gPgr9p13SfR+6OCpj9gwxPCnZO8RBfh1cbz9vFSVlDyUYcpI2CCCpPazA1glTsEDk+VtznnUMmWksXWfxBFV81jQB2SnoZKlnsiEuNMwhiMCMEkRFo74+AsUr2UjmKJ5KC8ACwsn475PoLZBh2J6fyXBHMdbrGfK+Zt5K2IHRRtDaZVT4eHqYzxh8KhalsuBNxCo3FygI="
|
||||
|
||||
@@ -1,5 +0,0 @@
|
||||
Building LBRYcrd
|
||||
|
||||
See doc/build-*.md for instructions on building bitcoind,
|
||||
the intended-for-services, no-graphical-interface, reference
|
||||
implementation of LBRYcrd.
|
||||
@@ -0,0 +1,15 @@
|
||||
The MIT License (MIT)
|
||||
|
||||
Copyright (c) 2015-2018 LBRY Inc
|
||||
|
||||
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.
|
||||
@@ -1,87 +1,87 @@
|
||||
LBRYcrd integration/staging tree
|
||||
=====================================
|
||||
# LBRYcrd - The LBRY blockchain
|
||||
|
||||
http://lbry.io
|
||||

|
||||
|
||||
What is LBRYcrd?
|
||||
----------------
|
||||
LBRYcrd uses a blockchain similar to bitcoin's to implement an index and payment system for content on the LBRY network. It is a fork of bitcoin core.
|
||||
|
||||
LBRYcrd is a fork of bitcoin core designed for use in the LBRY network.
|
||||
## Installation
|
||||
|
||||
LBRYcrd uses a blockchain similar to bitcoin's to implement a unique naming system in which the person who dedicates the largest amount of LBC to a name has control over that name.
|
||||
Latest binaries are available from https://github.com/lbryio/lbrycrd/releases. There is no installation procedure, the binaries run as is.
|
||||
|
||||
What is Bitcoin?
|
||||
----------------
|
||||
## Usage
|
||||
|
||||
Bitcoin is an experimental new digital currency that enables instant payments to
|
||||
anyone, anywhere in the world. Bitcoin uses peer-to-peer technology to operate
|
||||
with no central authority: managing transactions and issuing money are carried
|
||||
out collectively by the network. Bitcoin Core is the name of open source
|
||||
software which enables the use of this currency.
|
||||
The `lbrycrdd` executable will start a LBRYcrd node and connect you to the LBRYcrd network. Use the `lbrycrd-cli` executable
|
||||
to interact with lbrycrdd through the command line. Help pages for both executable are available through
|
||||
the "--help" flag (e.g. `lbrycrd-cli --help`).
|
||||
|
||||
For more information, as well as an immediately useable, binary version of
|
||||
the Bitcoin Core software, see https://bitcoin.org/en/download, or read the
|
||||
[original whitepaper](https://bitcoincore.org/bitcoin.pdf).
|
||||
### Example Usage
|
||||
|
||||
License
|
||||
-------
|
||||
Run `./lbrycrdd -server -daemon` to start lbrycrdd in the background.
|
||||
|
||||
Bitcoin Core is released under the terms of the MIT license. See [COPYING](COPYING) for more
|
||||
information or see https://opensource.org/licenses/MIT.
|
||||
Run `./lbrycrd-cli getinfo` to check for some basic informations about your LBRYcrd node.
|
||||
|
||||
Development Process
|
||||
-------------------
|
||||
Run `./lbrycrd-cli help` to get a list of all commands that you can run. To get help on specific commands run `./lbrycrd-cli [command_name] help`
|
||||
|
||||
### Data directory
|
||||
|
||||
Lbrycrdd will use the below default data directories
|
||||
|
||||
Windows < Vista: C:\Documents and Settings\Username\Application Data\lbrycrd
|
||||
Windows >= Vista: C:\Users\Username\AppData\Roaming\lbrycrd
|
||||
Mac: ~/Library/Application Support/lbrycrd
|
||||
Unix: ~/.lbrycrd
|
||||
|
||||
The data directory contains various things such as your default wallet (wallet.dat), debug logs (debug.log), and blockchain data. You can optionally
|
||||
create a configuration file lbrycrd.conf in the default data directory which will be used by default when running lbrycrdd.
|
||||
For a list of configuration parameters run `./lbrycrdd --help`. Below is a sample lbrycrd.conf to enable JSON RPC server on lbrycrdd.
|
||||
|
||||
```rpcuser=lbry
|
||||
rpcpassword=xyz123456790
|
||||
daemon=1
|
||||
server=1
|
||||
txindex=1
|
||||
```
|
||||
|
||||
## Running from Source
|
||||
|
||||
Run `./reproducible_build.sh -c -t`. This will build the binaries and put them into the `./src` directory.
|
||||
|
||||
If you encounter any errors, please check `doc/build-*.md` for further instructions. If you're still stuck, [create an issue](https://github.com/lbryio/lbrycrd/issues/new) with the output of that command, your system info, and any other information you think might be helpful.
|
||||
|
||||
## Contributing
|
||||
|
||||
Contributions to this project are welcome, encouraged, and compensated. For more details, see [lbry.io/faq/contributing](https://lbry.io/faq/contributing)
|
||||
|
||||
The codebase is in C++03, C++11 is currently not supported but we will be migrating to it in the near future. Recommended GCC version is 4.8 or greater.
|
||||
|
||||
The `master` branch is regularly built and tested, but is not guaranteed to be
|
||||
completely stable. [Tags](https://github.com/bitcoin/bitcoin/tags) are created
|
||||
regularly to indicate new official, stable release versions of Bitcoin Core.
|
||||
|
||||
The contribution workflow is described in [CONTRIBUTING.md](CONTRIBUTING.md).
|
||||
|
||||
The developer [mailing list](https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev)
|
||||
should be used to discuss complicated or controversial changes before working
|
||||
on a patch set.
|
||||
|
||||
Developer IRC can be found on Freenode at #bitcoin-core-dev.
|
||||
|
||||
Testing
|
||||
-------
|
||||
completely stable. [Releases](https://github.com/lbryio/lbrycrd/releases) are created
|
||||
regularly to indicate new official, stable release versions.
|
||||
|
||||
Testing and code review is the bottleneck for development; we get more pull
|
||||
requests than we can review and test on short notice. Please be patient and help out by testing
|
||||
other people's pull requests, and remember this is a security-critical project where any mistake might cost people
|
||||
lots of money.
|
||||
|
||||
### Automated Testing
|
||||
|
||||
Developers are strongly encouraged to write [unit tests](/doc/unit-tests.md) for new code, and to
|
||||
lots of money. Developers are strongly encouraged to write [unit tests](/doc/unit-tests.md) for new code, and to
|
||||
submit new unit tests for old code. Unit tests can be compiled and run
|
||||
(assuming they weren't disabled in configure) with: `make check`
|
||||
|
||||
There are also [regression and integration tests](/qa) of the RPC interface, written
|
||||
in Python, that are run automatically on the build server.
|
||||
These tests can be run (if the [test dependencies](/qa) are installed) with: `qa/pull-tester/rpc-tests.py`
|
||||
The Travis CI system makes sure that every pull request is built, and that unit and sanity tests are automatically run.
|
||||
|
||||
The Travis CI system makes sure that every pull request is built for Windows
|
||||
and Linux, OS X, and that unit and sanity tests are automatically run.
|
||||
### Testnet
|
||||
|
||||
### Manual Quality Assurance (QA) Testing
|
||||
Testnet is maintained for testing purposes and can be accessed using the command `./lbrycrdd -testnet`. If you would like testnet credits, please contact kay@lbry.io or grin@lbry.io.
|
||||
|
||||
Changes should be tested by somebody other than the developer who wrote the
|
||||
code. This is especially important for large or high-risk changes. It is useful
|
||||
to add a test plan to the pull request description if testing the changes is
|
||||
not straightforward.
|
||||
## License
|
||||
|
||||
Translations
|
||||
------------
|
||||
This project is MIT licensed. For the full license, see [LICENSE](LICENSE).
|
||||
|
||||
Changes to translations as well as new translations can be submitted to
|
||||
[Bitcoin Core's Transifex page](https://www.transifex.com/projects/p/bitcoin/).
|
||||
## Security
|
||||
|
||||
Translations are periodically pulled from Transifex and merged into the git repository. See the
|
||||
[translation process](doc/translation_process.md) for details on how this works.
|
||||
We take security seriously. Please contact security@lbry.io regarding any security issues.
|
||||
Our PGP key is [here](https://keybase.io/lbry/key.asc) if you need it.
|
||||
|
||||
## Contact
|
||||
|
||||
The primary contact for this project is [@kaykurokawa](https://github.com/kaykurokawa) (kay@lbry.io)
|
||||
|
||||
**Important**: We do not accept translation changes as GitHub pull requests because the next
|
||||
pull from Transifex would automatically overwrite them again.
|
||||
|
||||
Translators should also subscribe to the [mailing list](https://groups.google.com/forum/#!forum/bitcoin-translators).
|
||||
@@ -2,9 +2,9 @@ dnl require autoconf 2.60 (AS_ECHO/AS_ECHO_N)
|
||||
AC_PREREQ([2.60])
|
||||
define(_CLIENT_VERSION_MAJOR, 0)
|
||||
define(_CLIENT_VERSION_MINOR, 12)
|
||||
define(_CLIENT_VERSION_REVISION, 99)
|
||||
define(_CLIENT_VERSION_REVISION, 2)
|
||||
define(_CLIENT_VERSION_BUILD, 0)
|
||||
define(_CLIENT_VERSION_IS_RELEASE, false)
|
||||
define(_CLIENT_VERSION_IS_RELEASE, true)
|
||||
define(_COPYRIGHT_YEAR, 2016)
|
||||
define(_COPYRIGHT_HOLDERS,[The %s developers])
|
||||
define(_COPYRIGHT_HOLDERS_SUBSTITUTION,[[LBRY]])
|
||||
|
||||
@@ -1,2 +1,2 @@
|
||||
45.32.39.241:9246
|
||||
45.32.40.180:9246
|
||||
138.68.198.142:9246
|
||||
138.197.224.252:9246
|
||||
@@ -1,6 +1,6 @@
|
||||
# List of fixed seed nodes for testnet
|
||||
|
||||
45.32.39.241:19246
|
||||
159.203.154.219:19246
|
||||
|
||||
# Onion nodes
|
||||
#thfsmmn2jbitcoin.onion
|
||||
|
||||
@@ -95,6 +95,7 @@ wallet_packages_$(NO_WALLET) = $(wallet_packages)
|
||||
upnp_packages_$(NO_UPNP) = $(upnp_packages)
|
||||
|
||||
packages += $($(host_arch)_$(host_os)_packages) $($(host_os)_packages) $(qt_packages_) $(wallet_packages_) $(upnp_packages_)
|
||||
$(info $$packages is [${packages}])
|
||||
native_packages += $($(host_arch)_$(host_os)_native_packages) $($(host_os)_native_packages) $(qt_native_packages_)
|
||||
all_packages = $(packages) $(native_packages)
|
||||
|
||||
|
||||
@@ -2,6 +2,16 @@ Mac OS X Build Instructions and Notes
|
||||
====================================
|
||||
This guide will show you how to build Bitcoin Core for OS X.
|
||||
|
||||
|
||||
TRY THIS FIRST
|
||||
-----
|
||||
|
||||
Run `./reproducible_build.sh -c -t` in the Terminal. This should build the binaries and put them into the `./src` directory.
|
||||
|
||||
If that errors, please report the issue. See below for other ways of building the binaries.
|
||||
|
||||
---
|
||||
|
||||
Notes
|
||||
-----
|
||||
|
||||
|
||||
@@ -7,7 +7,7 @@ Release Process
|
||||
|
||||
* * *
|
||||
|
||||
###First time / New builders
|
||||
### First time / New builders
|
||||
Check out the source code in the following directory hierarchy.
|
||||
|
||||
cd /path/to/your/toplevel/build
|
||||
@@ -16,7 +16,7 @@ Check out the source code in the following directory hierarchy.
|
||||
git clone https://github.com/devrandom/gitian-builder.git
|
||||
git clone https://github.com/bitcoin/bitcoin.git
|
||||
|
||||
###Bitcoin maintainers/release engineers, update (commit) version in sources
|
||||
### Bitcoin maintainers/release engineers, update (commit) version in sources
|
||||
|
||||
pushd ./bitcoin
|
||||
contrib/verifysfbinaries/verify.sh
|
||||
@@ -37,7 +37,7 @@ Check out the source code in the following directory hierarchy.
|
||||
|
||||
* * *
|
||||
|
||||
###Setup and perform Gitian builds
|
||||
### Setup and perform Gitian builds
|
||||
|
||||
Setup Gitian descriptors:
|
||||
|
||||
@@ -59,7 +59,7 @@ Check out the source code in the following directory hierarchy.
|
||||
pushd ./gitian-builder
|
||||
git pull
|
||||
|
||||
###Fetch and create inputs: (first time, or when dependency versions change)
|
||||
### Fetch and create inputs: (first time, or when dependency versions change)
|
||||
|
||||
mkdir -p inputs
|
||||
wget -P inputs https://bitcoincore.org/cfields/osslsigncode-Backports-to-1.7.1.patch
|
||||
@@ -73,7 +73,7 @@ Check out the source code in the following directory hierarchy.
|
||||
|
||||
tar -C /Volumes/Xcode/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/ -czf MacOSX10.9.sdk.tar.gz MacOSX10.9.sdk
|
||||
|
||||
###Optional: Seed the Gitian sources cache and offline git repositories
|
||||
### Optional: Seed the Gitian sources cache and offline git repositories
|
||||
|
||||
By default, Gitian will fetch source files as needed. To cache them ahead of time:
|
||||
|
||||
@@ -87,7 +87,7 @@ NOTE: Offline builds must use the --url flag to ensure Gitian fetches only from
|
||||
```
|
||||
The gbuild invocations below <b>DO NOT DO THIS</b> by default.
|
||||
|
||||
###Build and sign Bitcoin Core for Linux, Windows, and OS X:
|
||||
### Build and sign Bitcoin Core for Linux, Windows, and OS X:
|
||||
|
||||
./bin/gbuild --commit bitcoin=v${VERSION} ../bitcoin/contrib/gitian-descriptors/gitian-linux.yml
|
||||
./bin/gsign --signer $SIGNER --release ${VERSION}-linux --destination ../gitian.sigs/ ../bitcoin/contrib/gitian-descriptors/gitian-linux.yml
|
||||
@@ -111,7 +111,7 @@ The gbuild invocations below <b>DO NOT DO THIS</b> by default.
|
||||
4. OS X unsigned installer and dist tarball (bitcoin-${VERSION}-osx-unsigned.dmg, bitcoin-${VERSION}-osx64.tar.gz)
|
||||
5. Gitian signatures (in gitian.sigs/${VERSION}-<linux|{win,osx}-unsigned>/(your Gitian key)/
|
||||
|
||||
###Verify other gitian builders signatures to your own. (Optional)
|
||||
### Verify other gitian builders signatures to your own. (Optional)
|
||||
|
||||
Add other gitian builders keys to your gpg keyring
|
||||
|
||||
@@ -125,7 +125,7 @@ The gbuild invocations below <b>DO NOT DO THIS</b> by default.
|
||||
|
||||
popd
|
||||
|
||||
###Next steps:
|
||||
### Next steps:
|
||||
|
||||
Commit your signature to gitian.sigs:
|
||||
|
||||
|
||||
|
After Width: | Height: | Size: 49 KiB |
@@ -0,0 +1,18 @@
|
||||
#! /bin/bash
|
||||
|
||||
set -euo pipefail
|
||||
|
||||
sudo apt-get update
|
||||
sudo apt-get install -y --no-install-recommends \
|
||||
g++-mingw-w64-i686 mingw-w64-i686-dev g++-mingw-w64-x86-64 \
|
||||
mingw-w64-x86-64-dev build-essential libtool autotools-dev automake pkg-config \
|
||||
libssl-dev libevent-dev bsdmainutils curl ca-certificates
|
||||
|
||||
cd depends
|
||||
make HOST=i686-w64-mingw32 NO_QT=1
|
||||
cd ..
|
||||
patch -p1 < packaging/remove_consensus.patch
|
||||
./autogen.sh
|
||||
./configure --prefix=`pwd`/depends/i686-w64-mingw32 --without-gui
|
||||
make
|
||||
|
||||
@@ -0,0 +1,23 @@
|
||||
diff --git a/src/Makefile.am b/src/Makefile.am
|
||||
index a9f0a94..d71bfeb 100644
|
||||
--- a/src/Makefile.am
|
||||
+++ b/src/Makefile.am
|
||||
@@ -64,12 +64,12 @@ if ENABLE_ZMQ
|
||||
EXTRA_LIBRARIES += libbitcoin_zmq.a
|
||||
endif
|
||||
|
||||
-if BUILD_BITCOIN_LIBS
|
||||
-lib_LTLIBRARIES = libbitcoinconsensus.la
|
||||
-LIBBITCOINCONSENSUS=libbitcoinconsensus.la
|
||||
-else
|
||||
-LIBBITCOINCONSENSUS=
|
||||
-endif
|
||||
+# if BUILD_BITCOIN_LIBS
|
||||
+# lib_LTLIBRARIES = libbitcoinconsensus.la
|
||||
+# LIBBITCOINCONSENSUS=libbitcoinconsensus.la
|
||||
+# else
|
||||
+# LIBBITCOINCONSENSUS=
|
||||
+# endif
|
||||
|
||||
bin_PROGRAMS =
|
||||
TESTS =
|
||||
@@ -19,7 +19,7 @@ function HELP {
|
||||
echo "-r: remove intermediate files."
|
||||
echo "-l: build only lbrycrd"
|
||||
echo "-d: build only the dependencies"
|
||||
echo "-o: timeout build after 45 minutes"
|
||||
echo "-o: timeout build after 40 minutes"
|
||||
echo "-t: turn trace on"
|
||||
echo "-h: show help"
|
||||
exit 1
|
||||
@@ -31,6 +31,9 @@ BUILD_DEPENDENCIES=true
|
||||
BUILD_LBRYCRD=true
|
||||
TIMEOUT=false
|
||||
THREE_MB=3145728
|
||||
# this flag gets set to False if
|
||||
# the script exits due to a timeout
|
||||
OUTPUT_LOG=true
|
||||
|
||||
while getopts :crldoth:w:d: FLAG; do
|
||||
case $FLAG in
|
||||
@@ -104,18 +107,19 @@ fi
|
||||
|
||||
|
||||
NEXT_TIME=60
|
||||
function exit_at_45() {
|
||||
function exit_at_40() {
|
||||
if [ -f "${START_TIME_FILE}" ]; then
|
||||
NOW=$(date +%s)
|
||||
START=$(cat "${START_TIME_FILE}")
|
||||
TIMEOUT_SECS=2700 # 45 * 60
|
||||
TIMEOUT_SECS=2400 # 40 * 60
|
||||
TIME=$((NOW - START))
|
||||
if (( TIME > NEXT_TIME )); then
|
||||
echo "Build has taken $((TIME / 60)) minutes: $1"
|
||||
NEXT_TIME=$((TIME + 60))
|
||||
fi
|
||||
if [ "$TIMEOUT" = true ] && (( TIME > TIMEOUT_SECS )); then
|
||||
echo 'Exiting at 45 minutes to allow the cache to populate'
|
||||
echo 'Exiting at 40 minutes to allow the cache to populate'
|
||||
OUTPUT_LOG=false
|
||||
exit 1
|
||||
fi
|
||||
fi
|
||||
@@ -136,7 +140,7 @@ function wait_and_echo() {
|
||||
# loop until the process is no longer running
|
||||
# check every $SLEEP seconds, echoing a message every minute
|
||||
while (ps -p "${PID}" > /dev/null); do
|
||||
exit_at_45 "$2"
|
||||
exit_at_40 "$2"
|
||||
sleep "${SLEEP}"
|
||||
done
|
||||
# restore the xtrace setting
|
||||
@@ -159,11 +163,11 @@ function background() {
|
||||
function cleanup() {
|
||||
rv=$?
|
||||
# cat the log file if it exists
|
||||
if [ -f "$2" ]; then
|
||||
if [ -f "$2" ] && [ "${OUTPUT_LOG}" = true ]; then
|
||||
echo
|
||||
echo "Output of log file $2"
|
||||
echo
|
||||
tail -c $THREE_MB "$1"
|
||||
tail -n 1000 "$2"
|
||||
echo
|
||||
fi
|
||||
# delete the build directory
|
||||
@@ -175,14 +179,15 @@ function cleanup() {
|
||||
function cat_and_exit() {
|
||||
rv=$?
|
||||
# cat the log file if it exists
|
||||
if [ -f "$1" ]; then
|
||||
if [ -f "$1" ] && [ "${OUTPUT_LOG}" = true ]; then
|
||||
echo
|
||||
echo "Output of log file $1"
|
||||
echo
|
||||
# log size is limited to 4MB on travis
|
||||
# so hopefully the last 3MB is enough
|
||||
# This used to be the last 3MB but outputing that
|
||||
# caused problems on travis.
|
||||
# Hopefully the last 1000 lines is enough
|
||||
# to debug whatever went wrong
|
||||
tail -c $THREE_MB "$1"
|
||||
tail -n 1000 "$1"
|
||||
echo
|
||||
fi
|
||||
exit $rv
|
||||
@@ -227,7 +232,7 @@ function build_dependencies() {
|
||||
else
|
||||
install_apt_packages
|
||||
fi
|
||||
|
||||
|
||||
if [ "$CLEAN" = true ]; then
|
||||
rm -rf "${LBRYCRD_DEPENDENCIES}"
|
||||
rm -rf "${OUTPUT_DIR}"
|
||||
@@ -241,7 +246,7 @@ function build_dependencies() {
|
||||
|
||||
build_dependency "${BDB_PREFIX}" "${LOG_DIR}/bdb_build.log" build_bdb
|
||||
build_dependency "${OPENSSL_PREFIX}" "${LOG_DIR}/openssl_build.log" build_openssl
|
||||
|
||||
|
||||
set +u
|
||||
export PKG_CONFIG_PATH="${PKG_CONFIG_PATH}:${OPENSSL_PREFIX}/lib/pkgconfig/"
|
||||
set -u
|
||||
@@ -272,8 +277,9 @@ function build_openssl() {
|
||||
-fPIC darwin64-x86_64-cc \
|
||||
no-shared no-dso no-engines > "${OPENSSL_LOG}"
|
||||
else
|
||||
[[ $(uname -m) = 'i686' ]] && OS_ARCH="linux-generic32" || OS_ARCH="linux-x86_64"
|
||||
./Configure --prefix="${OPENSSL_PREFIX}" --openssldir="${OPENSSL_PREFIX}/ssl" \
|
||||
linux-x86_64 -fPIC -static no-shared no-dso > "${OPENSSL_LOG}"
|
||||
${OS_ARCH} -fPIC -static no-shared no-dso > "${OPENSSL_LOG}"
|
||||
fi
|
||||
background make "${OPENSSL_LOG}" "Waiting for openssl to finish building"
|
||||
make install >> "${OPENSSL_LOG}" 2>&1
|
||||
@@ -292,7 +298,7 @@ function build_boost() {
|
||||
function build_libevent() {
|
||||
LIBEVENT_LOG="$1"
|
||||
if [ ! -d libevent ]; then
|
||||
git clone https://github.com/libevent/libevent.git
|
||||
git clone --branch release-2.0.22-stable https://github.com/libevent/libevent.git
|
||||
fi
|
||||
cd libevent
|
||||
echo "Building libevent. tail -f ${LIBEVENT_LOG} to see the details and monitor progress"
|
||||
|
||||
|
Before Width: | Height: | Size: 67 KiB After Width: | Height: | Size: 17 KiB |
|
Before Width: | Height: | Size: 10 KiB After Width: | Height: | Size: 9.3 KiB |
@@ -1,384 +1,612 @@
|
||||
/* XPM */
|
||||
static char *bitcoin___[] = {
|
||||
/* columns rows colors chars-per-pixel */
|
||||
"128 128 250 2",
|
||||
" c #845415",
|
||||
". c #895616",
|
||||
"X c #84581E",
|
||||
"o c #8D5C18",
|
||||
"O c #925A15",
|
||||
"+ c #925E1C",
|
||||
"@ c #98621C",
|
||||
"# c #9E711C",
|
||||
"$ c #A36E1A",
|
||||
"% c #A96F1B",
|
||||
"& c #A6711C",
|
||||
"* c #AC741C",
|
||||
"= c #B2741E",
|
||||
"- c #B37C1E",
|
||||
"; c #BB7C1E",
|
||||
": c #835B21",
|
||||
"> c #8F6125",
|
||||
", c #956727",
|
||||
"< c #916B2E",
|
||||
"1 c #996B2C",
|
||||
"2 c #B47B23",
|
||||
"3 c #BD7C20",
|
||||
"4 c #A17330",
|
||||
"5 c #AB7D3B",
|
||||
"6 c #C17F20",
|
||||
"7 c #B9831F",
|
||||
"8 c #BB842B",
|
||||
"9 c #BD8533",
|
||||
"0 c #B68F3D",
|
||||
"q c #BE8C3B",
|
||||
"w c #C4801F",
|
||||
"e c #FE8C03",
|
||||
"r c #F38A0F",
|
||||
"t c #FD8E0A",
|
||||
"y c #FF910C",
|
||||
"u c #F78F13",
|
||||
"i c #F98F10",
|
||||
"p c #F79016",
|
||||
"a c #FE9314",
|
||||
"s c #F6931E",
|
||||
"d c #FD961B",
|
||||
"f c #FE991E",
|
||||
"g c #C58421",
|
||||
"h c #CD8621",
|
||||
"j c #C78B21",
|
||||
"k c #CC8B23",
|
||||
"l c #C2852B",
|
||||
"z c #C08B2D",
|
||||
"x c #D28722",
|
||||
"c c #D38B25",
|
||||
"v c #DB8E22",
|
||||
"b c #D28E2C",
|
||||
"n c #D49323",
|
||||
"m c #DC9224",
|
||||
"M c #DC9B25",
|
||||
"N c #D4922D",
|
||||
"B c #DF972A",
|
||||
"V c #DF982E",
|
||||
"C c #C18D33",
|
||||
"Z c #C58E38",
|
||||
"A c #CB9332",
|
||||
"S c #C2933C",
|
||||
"D c #CD9339",
|
||||
"F c #CC9938",
|
||||
"G c #D19733",
|
||||
"H c #DA9230",
|
||||
"J c #D59935",
|
||||
"K c #DC9C33",
|
||||
"L c #DC9E3B",
|
||||
"P c #E49124",
|
||||
"I c #EA9426",
|
||||
"U c #E09D26",
|
||||
"Y c #EC972B",
|
||||
"T c #F79625",
|
||||
"R c #F99524",
|
||||
"E c #F69A26",
|
||||
"W c #F89825",
|
||||
"Q c #F2972B",
|
||||
"! c #F59A2C",
|
||||
"~ c #F89B2B",
|
||||
"^ c #E79D33",
|
||||
"/ c #EF9D31",
|
||||
"( c #E19F3A",
|
||||
") c #EF9D3A",
|
||||
"_ c #F49C33",
|
||||
"` c #F99E32",
|
||||
"' c #F49F39",
|
||||
"] c #D6A13E",
|
||||
"[ c #DAA33B",
|
||||
"{ c #E3A127",
|
||||
"} c #E7A328",
|
||||
"| c #EDA32C",
|
||||
" . c #EDA829",
|
||||
".. c #FFA325",
|
||||
"X. c #FFAB25",
|
||||
"o. c #F3A42B",
|
||||
"O. c #FFA429",
|
||||
"+. c #F4A929",
|
||||
"@. c #FFAC2A",
|
||||
"#. c #FFB227",
|
||||
"$. c #FFB32C",
|
||||
"%. c #FFBA2D",
|
||||
"&. c #EEA830",
|
||||
"*. c #F7A334",
|
||||
"=. c #FAA036",
|
||||
"-. c #FCAB34",
|
||||
";. c #F4A13C",
|
||||
":. c #F9A33B",
|
||||
">. c #F4A83B",
|
||||
",. c #FFA83F",
|
||||
"<. c #FDB432",
|
||||
"1. c #FFBB33",
|
||||
"2. c #FFB73A",
|
||||
"3. c #FDB93E",
|
||||
"4. c #FFC12F",
|
||||
"5. c #FFC432",
|
||||
"6. c #FFC338",
|
||||
"7. c #D2A043",
|
||||
"8. c #D8A140",
|
||||
"9. c #EEA144",
|
||||
"0. c #E2A840",
|
||||
"q. c #EDA34B",
|
||||
"w. c #F4A444",
|
||||
"e. c #F9A642",
|
||||
"r. c #FBA945",
|
||||
"t. c #F3A64B",
|
||||
"y. c #F4A84E",
|
||||
"u. c #FBAB4B",
|
||||
"i. c #EEB041",
|
||||
"p. c #FABA44",
|
||||
"a. c #ECA653",
|
||||
"s. c #EEAC5D",
|
||||
"d. c #F3AA53",
|
||||
"f. c #FAAE53",
|
||||
"g. c #F2AD5A",
|
||||
"h. c #FBB056",
|
||||
"j. c #F6B15E",
|
||||
"k. c #FBB25B",
|
||||
"l. c #DDAF79",
|
||||
"z. c #E3A962",
|
||||
"x. c #EBAE63",
|
||||
"c. c #E4AC68",
|
||||
"v. c #EAAF69",
|
||||
"b. c #EEB065",
|
||||
"n. c #E7B06C",
|
||||
"m. c #EEB36B",
|
||||
"M. c #F5B263",
|
||||
"N. c #FBB461",
|
||||
"B. c #E6B274",
|
||||
"V. c #ECB574",
|
||||
"C. c #E7B57B",
|
||||
"Z. c #EAB77C",
|
||||
"A. c #ECB97C",
|
||||
"S. c #F2B770",
|
||||
"D. c #F0BB7A",
|
||||
"F. c #DBB485",
|
||||
"G. c #DFB888",
|
||||
"H. c #E4B984",
|
||||
"J. c #EDBD82",
|
||||
"K. c #E5BC8B",
|
||||
"L. c #EABE8A",
|
||||
"P. c #F0BE82",
|
||||
"I. c #E0BF96",
|
||||
"U. c #EDC089",
|
||||
"Y. c #F0C28B",
|
||||
"T. c #E5C194",
|
||||
"R. c #E9C191",
|
||||
"E. c #E4C39C",
|
||||
"W. c #EBC699",
|
||||
"Q. c #EBC99F",
|
||||
"!. c #DFC3A0",
|
||||
"~. c #DDCAAF",
|
||||
"^. c #CFC7BD",
|
||||
"/. c #D2CBB6",
|
||||
"(. c #DBC8B1",
|
||||
"). c #DBCDBB",
|
||||
"_. c #E2C6A4",
|
||||
"`. c #E6C8A5",
|
||||
"'. c #EACBA5",
|
||||
"]. c #E1C7A8",
|
||||
"[. c #E3CBAD",
|
||||
"{. c #EACCAA",
|
||||
"}. c #EED1AC",
|
||||
"|. c #E1CDB3",
|
||||
" X c #E3CFB8",
|
||||
".X c #E6D1B6",
|
||||
"XX c #EBD2B3",
|
||||
"oX c #E3D1BB",
|
||||
"OX c #EAD6BB",
|
||||
"+X c #EBD8BF",
|
||||
"@X c #D3CDC2",
|
||||
"#X c #D8CDC2",
|
||||
"$X c #D0CECA",
|
||||
"%X c #DDD3C4",
|
||||
"&X c #D3D2CC",
|
||||
"*X c #DDD5CB",
|
||||
"=X c #CCD3D5",
|
||||
"-X c #C9D7DF",
|
||||
";X c #D2D4D6",
|
||||
":X c #DEDAD4",
|
||||
">X c #DDDCDB",
|
||||
",X c #E2D4C2",
|
||||
"<X c #ECDBC2",
|
||||
"1X c #E2D7CA",
|
||||
"2X c #E3D8CC",
|
||||
"3X c #E2DCD6",
|
||||
"4X c #E9DED2",
|
||||
"5X c #E1DEDA",
|
||||
"6X c #EEE0CE",
|
||||
"7X c #EEE3D4",
|
||||
"8X c #E7E2DA",
|
||||
"9X c #EEE4D8",
|
||||
"0X c #F3E6D1",
|
||||
"qX c #C5D7ED",
|
||||
"wX c #CDDBEB",
|
||||
"eX c #DBDEE2",
|
||||
"rX c #CBDCF1",
|
||||
"tX c #C4DFFF",
|
||||
"yX c #DEE1E4",
|
||||
"uX c #DDE4EC",
|
||||
"iX c #D3E1F2",
|
||||
"pX c #DDE6F1",
|
||||
"aX c #DEE9F4",
|
||||
"sX c #D8E5F8",
|
||||
"dX c #D6EEFF",
|
||||
"fX c #DEECFB",
|
||||
"gX c #D5F4FF",
|
||||
"hX c #DDF3FF",
|
||||
"jX c #DCF9FF",
|
||||
"kX c #E3E4E6",
|
||||
"lX c #EFEBE4",
|
||||
"zX c #E1E5EB",
|
||||
"xX c #E2E8ED",
|
||||
"cX c #F1F1ED",
|
||||
"vX c #E0E7F0",
|
||||
"bX c #E2E9F2",
|
||||
"nX c #EAEFF6",
|
||||
"mX c #E1EEFD",
|
||||
"MX c #E4F1F6",
|
||||
"NX c #E3F4FF",
|
||||
"BX c #EAF6FF",
|
||||
"VX c #E5F9FF",
|
||||
"CX c #EBFAFF",
|
||||
"ZX c #F5F5F5",
|
||||
"AX c #F9F7F5",
|
||||
"SX c #FAF8F6",
|
||||
"DX c #F3F7FB",
|
||||
"FX c #F4FAFE",
|
||||
"GX c #FEFEFE",
|
||||
"HX c None",
|
||||
/* pixels */
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX1 Z L >.N b b b b N >.( C > HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX4 L _ *.@.<.$.X.X...X.X.X.X.X.X...X.@.$.<.@.*./ G , HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX< L -.@.$.X...R R R T T T T W W W W W W T T T T R R W ..X.$.@.*.J HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXD -.%.X.W R T T W W W W W W W W W W W W W W W W W W W W W W T T R W X.%.+.A HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXS -.$.X.R T T W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W T T R X.$.-.C HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXF <.@.f R T W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W T R W #.<.A HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX[ <.X.f T W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W T R X.$.K HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX0.$...R T W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W E W W W W W W W T R ..%.G HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXS 1...R T W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W E ~ ~ E W W W W W W W W W T R X.1.A HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX3.X.d T W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ E W W W W W W W W W W T R @.2.HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX7.5.f T W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ~ E W W W W W W W W W W W W T W %.z HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX3.X.s T W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W T R $.<.HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX1...R W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ E E W W W W W W W W W W W W W R ..1.HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX0 5.f T W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W T W 5.8 HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX8.$.s W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ` ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W T R %.N HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXi.#.R W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ` ` ` ` ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W R $.&.HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXp.X.R W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ` ` ` ` ` ~ ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W R @.<.HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXp.X.R W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ` ` ` ` ` ` ` ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W R @.<.HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXi.X.R W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W E ~ E ~ W R ~ ~ ~ ~ ~ ~ ` ` ` ` ` ` ` ` ` ` ~ ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W R @.| HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX] #.R W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ! s e t d ~ ` ` ` ` ` ` =.=.=.` ` ` ` ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W W R %.N HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXq %.R W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W E W E ~ ~ ~ ~ y l.=XI.x.) p a =.` ` =.=.=.=.=.=.` ` ` ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W W W R %.2 HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX5 5.d W W W W W W W W W W W W W W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ~ ~ ~ t (.jXVXNXuX@XF.W ` =.:.` W =.:.=.=.` ` ` ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W W W T R 5.HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX1.f T W W W W W W W W W W W W W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ~ ~ ~ R Q eXDXSXSXDXgX#Xa ` =.=.;.q.W a a R ` ` ` ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W W W T W %.HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX3...T W W W W W W W W W W W W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ~ ~ ~ ~ ` a a.NXSXGXGXAXNXV.a :.:.f c.tX*XE.n.9.R ~ ` ` ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W W W T @.@.HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXD #.R W W W W W W W W W W W W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ` t H.VXSXGXGXDXmXy.f :.:.a I.hXBXCXNXiX^.' W ` ~ ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W W W R %.g HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX5.d W W W W W W W W W W W W W W W W W W W W W W W W W E ~ W ~ ~ ~ ~ ~ ~ ~ ~ ~ ` ` ` i |.CXGXGXGXCX3X~ ` :.:.R %XCXSXGXAXNX>XW ~ ` ` ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W W W W R 5.HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX2.W T W W W W W W W W W W W W W W W W W W W W W W W W ~ ~ ~ s t e a W ~ ` ` ` ` ` ` W ! eXFXGXGXSXVX[.d :.:.~ w.uXFXGXGXSXVXW.a ` ` ` ` ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W W W W T ..@.HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHX9 $.R W W W W W W W W W W W W W W W W W W W W W W E W ~ ~ ~ y F./.B.9.T t t a ~ =.` =.a a.hXDXGXGXSXNXA.d :.e.R v.NXSXGXGXSXNXm.a =.` ` ` ~ ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W W W R %.= HXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHX6.d W W W W W W W W W W W W W W W W W W W W W W E ~ ~ ~ ~ W i &XjXNXfX:X].B.q.T t a d e K.VXSXGXGXDXaXd.W e.e.d E.VXSXGXGXDXvXw.W =.` ` ` ` ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W W W W W %.HXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXK X.T W W W W W W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ~ a ) uXDXSXFXFXCXNXfX:X_.B.q.r .XFXGXGXGXCX3X=.=.e.,.~ %XCXGXGXGXCX1XW ` =.` ` ` ` ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W W W W T $.m HXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHX5.R W W W W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ~ ~ ~ t x.NXSXGXGXGXSXSXDXFXCXNXmX8XcXSXGXGXGXCXW.e :.e.=.t.uXFXGXGXSXVXE.d :.=.=.` ` ` ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W W W W W R %.HXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHX^ X.T W W W W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ~ ~ ~ ` t T.VXSXGXGXGXGXGXGXGXSXSXFXGXGXGXGXGXGXFX}.9.' W e v.VXSXGXGXSXNXm.d :.=.=.=.` ` ` ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W W W W T @.P HXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHX1.R W W W W W W W W W W W W W W W W E E ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ s ;XNXAXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXSXFXNX>X|.V.XXFXGXGXGXFXbXy.~ :.:.=.=.` ` ` ` ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W W W W W R %.HXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXH X.T W W W W W W W W W W W W W W E E ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ` ` R ' $XsXNXVXFXSXSXGXGXGXGXGXGXGXGXGXGXGXGXGXGXSXFXCXCXFXSXGXGXGXCXOXa :.:.:.=.=.=.` ` ` ~ ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W W W T $.c HXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHX1.R W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ` ` ` ` ` ` ~ t.V.`.5XVXFXSXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXFX<X_ d d =.:.=.=.` ` ` ` ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W W W W R $.HXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHX8 $.T W W W W W W W W W W W E E ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ` ` ` ` ` =.=.~ f a a W b.xXFXSXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXSXFXmX~.x.T a =.:.=.` ` ` ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W W W W T $.3 HXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHX-.W W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ` ` ` ` ` ` =.=.=.=.=.:.:.:.` e y.MXFXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXSXFXCXhX*Xn.p a :.=.` ` ` ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W W W W ~ O.HXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHX1.R W W W W W W W W W ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ` ` ` ` ` =.` =.=.=.:.:.:.:.:.:.:.a .XFXGXGXGXGXGXGXGXGXGXFXFXSXSXGXGXGXGXGXGXGXGXGXGXGXSXAXCXhX%Xq.t ~ =.` ` ` ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W W W R %.HXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXb @.T W W W W W W W W E ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ` ` ` ` ` ` =.=.=.=.=.:.:.:.:.:.:.:.e.d [.CXGXGXGXGXGXGXGXGXSXZXnXNXNXBXDXSXSXGXGXGXGXGXGXGXGXGXSXAXCXhXH.t W :.` ` ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W W W T @.x HXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHX<.R W W W W W E E E ~ ~ ~ ~ ~ ~ ~ ~ ~ ` ~ ` ` ` ` ` =.=.=.=.=.:.:.:.:.:.:.:.:.e.=.' >XFXGXGXGXGXGXGXGXSXCX{.e.P.'.2XvXNXBXDXSXGXGXGXGXGXGXGXGXGXSXDXjX~.y W =.` ` ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W W W W W @.HXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHX: 1.R W W W W E ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ` ` ` ` ` ` =.=.=.=.=.:.:.:.:.:.:.:.:.e.e.e.~ s.fXDXGXGXGXGXGXGXGXSXNXD.f =.=.,.M.L.oXaXVXDXSXGXGXGXGXGXGXGXGXGXAXVX(.t ~ ` ` ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W W W R %. HXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXl #.T W W W E ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ` ` ` ` ` ` =.=.=.=.:.:.:.:.:.:.:.:.:.e.e.e.e.r.W H.NXSXGXGXGXGXGXGXGXDXzXg.r.f.f.f.r.=.=.g.`.fXBXAXGXGXGXGXGXGXGXGXGXAXjXH.t =.` ` ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W W W T $.6 HXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHX~ ..W W W W E ~ ~ ~ ~ ~ ~ ~ ~ ` ` ` ` ` ` =.=.=.=.=.:.:.:.:.:.:.:.e.e.e.e.e.e.e.r.W |.CXGXGXGXGXGXGXGXGXBX1X,.f.f.f.f.h.h.f.,.~ d.3XVXAXGXGXGXGXGXGXGXGXGXDXsX' f ` ` ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W W W ..~ HXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHX$.R W W W W W E ~ ~ ~ ~ ~ ` ` ` ` ` ` =.=.=.=.=.=.:.:.:.:.:.:.:.e.e.e.e.e.r.r.r.,.w.>XFXGXGXGXGXGXGXGXSXNX`.=.f.h.h.h.h.f.f.f.f.=.~ ,XVXSXGXGXGXGXGXGXGXGXSXVXT.y ` ` ` ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W W R $.HXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXX %.T W W W W W E ~ ~ ~ ~ ~ ` ` ` ` =.=.=.=.=.:.:.:.:.:.:.:.:.e.e.e.e.e.e.r.r.r.u.=.x.fXDXGXGXGXGXGXGXGXSXmXA.,.h.h.h.k.k.h.f.f.f.f.:.~ 5XFXGXGXGXGXGXGXGXGXGXCX:XW ~ ` ` ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W W T $.. HXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHX8 $.T W W W W W W E ~ ~ ~ ~ ~ ` ` ` =.=.=.:.:.:.:.:.:.:.:.e.e.e.e.e.r.r.r.r.r.u.u.~ K.NXSXGXGXGXGXGXGXGXDXzXj.r.k.k.k.k.k.h.f.f.f.f.f.W V.VXSXGXGXGXGXGXGXGXGXDXuXw.f ` ` ` ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W T $.3 HXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXY ..W W W W W W W E ~ ~ ~ ~ ~ ~ ` ` ` =.=.=.:.:.:.:.:.e.e.e.e.e.e.r.r.r.r.u.u.u.u.~ |.CXGXGXGXGXGXGXGXGXBX2Xr.f.k.k.k.k.k.k.h.f.f.f.f.,.d.bXFXGXGXGXGXGXGXGXGXDXfXd.d =.` ` ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W W O.P HXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXO.W W W W W W W W W ~ ~ ~ ~ ~ ~ ` ` ` ` =.=.:.:.:.:.e.e.e.e.r.r.r.r.r.r.u.u.u.u.r.w.>XFXGXGXGXGXGXGXGXSXNX'.,.k.k.k.k.k.k.k.h.h.f.f.f.e.y.kXFXGXGXGXGXGXGXGXGXDXfXg.d =.` ` ` ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W W W O.HXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHX$.R W W W W W W W W E ~ ~ ~ ~ ~ ` ` ` ` =.=.=.:.:.:.:.e.e.r.r.r.r.u.u.u.u.u.u.f.=.b.fXDXGXGXGXGXGXGXGXSXmXJ.r.k.k.k.k.k.k.k.h.h.f.f.f.:.s.mXFXGXGXGXGXGXGXGXGXDXpXy.R =.` ` ` ~ ~ ~ ~ ~ E E W W W W W W W W W W W W W W W W W $.HXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHX1.R W W W W W W W W W ~ ~ ~ ~ ~ ~ ` ` ` =.=.=.:.:.:.:.e.e.e.r.r.u.u.u.u.u.u.u.f.=.K.NXSXGXGXGXGXGXGXGXFXxXM.u.k.k.k.k.k.k.k.k.h.f.f.k.~ K.VXSXGXGXGXGXGXGXGXGXCX5X=.~ =.=.` ` ` ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W $.HXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHX+ $.T W W W W W W W W W W ~ ~ ~ ~ ~ ~ ` ` ` =.=.=.:.:.:.:.e.e.e.r.r.u.u.u.u.f.f.f.=.|.CXGXGXGXGXGXGXGXGXFX<X~ u.k.N.N.N.k.k.k.k.k.k.k.=.;.uXFXGXGXGXGXGXGXGXGXSXBXoXR =.=.=.` ` ` ~ ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W T $.O HXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXl @.T W W W W W W W W W W ~ ~ ~ ~ ~ ~ ` ` ` =.=.=.:.:.:.:.e.e.e.r.r.u.u.u.u.f.f.u.t.>XFXGXGXGXGXGXGXGXGXFX9XA.b.u.r.r.u.u.h.h.h.u.r.O.w.:XCXSXGXGXGXGXGXGXGXGXSXhXL.a :.=.=.=.` ` ` ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W T $.* HXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXV X.T W W W W W W W W W W E ~ ~ ~ ~ ~ ~ ` ` ` =.=.=.:.:.:.:.e.e.e.r.r.u.u.u.u.f.,.b.fXFXGXGXGXGXGXGXGXGXSXFXVXpX*X[.R.V.M.g.d.d.g.b.T.pXCXSXGXGXGXGXGXGXGXGXGXDXpXe.~ :.:.=.=.` ` ` ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W T $.; HXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHX| O.T W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ` ` ` ` =.=.:.:.:.:.:.e.e.r.r.u.u.u.u.f.=.K.NXSXGXGXGXGXGXGXGXGXGXGXSXFXFXBXNXmXuX>X3X3XyXmXVXFXSXGXGXGXGXGXGXGXGXGXAXhXE.d :.:.:.=.=.` ` ` ` ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W T @.h HXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXc @.T W W W W W W W W W W W E ~ ~ ~ ~ ~ ~ ` ` ` ` =.:.:.:.:.:.e.e.e.r.r.u.u.u.u.=.|.BXGXGXGXGXGXGXGXGXGXGXGXGXGXGXSXSXSXFXFXFXFXFXSXSXGXGXGXGXGXGXGXGXGXGXAXNX>X~ =.e.:.:.:.=.` ` ` ` ~ ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W @.h HXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXk @.T W W W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ` ` ` =.=.:.:.:.:.e.e.e.r.r.r.u.u.r.w.>XFXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXSXZXNXeXe.~ e.:.:.:.:.=.=.=.` ` ` ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W W @.h HXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXc @.T W W W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ` ` ` =.=.=.:.:.:.:.e.e.e.r.r.u.u.=.x.fXFXGXGXGXGXGXGXGXGXGXFXFXSXSXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXFXCXfXoX:.~ r.e.:.:.:.:.:.=.` ` ` ` ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W W @.h HXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXc @.T W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ` ` ` ` =.=.:.:.:.:.:.e.e.r.r.r.u.~ K.NXSXGXGXGXGXGXGXGXSXZX6XkXmXNXBXDXAXSXGXGXGXGXGXGXGXGXGXGXGXGXGXGX0X'.S.~ =.u.e.e.e.:.:.:.:.=.=.` ` ` ` ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W @.h HXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXk @.T W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ` ` ` ` =.=.:.:.:.:.e.e.e.r.r.u.~ |.CXGXGXGXGXGXGXGXGXFX4X,.k.D.Q.,XkXmXNXDXSXSXGXGXGXGXGXGXGXGXGXGXGX<X_ y r.u.r.r.e.e.e.:.:.:.:.=.=.` ` ` ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W @.h HXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXc @.T W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ` ` ` ` =.=.=.:.:.:.e.e.e.r.r.e.;.>XFXGXGXGXGXGXGXGXSXVX{.,.f.u.r.u.N.J.{.5XNXBXAXSXGXGXGXGXGXGXGXGXGXFXMXH.W r.u.r.e.e.e.:.:.:.:.=.=.` ` ` ` ~ ~ ~ ~ ~ ~ W W W W W W W W W W W T @.h HXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXo.O.T W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ~ ` ` ` =.=.=.:.:.:.:.e.e.e.r.O.s.fXFXGXGXGXGXGXGXGXSXmXJ.r.N.N.N.N.h.r.r.f.J.1XhXBXAXGXGXGXGXGXGXGXGXSXDXjX!.W e.u.r.e.e.e.:.:.:.:.=.=.` ` ` ` ~ ~ ~ ~ ~ E W W W W W W W W W W T @.g HXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXB X.T W W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ` ` ` =.=.:.:.:.:.:.e.e.r.W H.NXSXGXGXGXGXGXGXGXDXuXM.u.k.k.N.N.N.N.N.h.,.e.D.>XNXSXGXGXGXGXGXGXGXGXSXZXjXE.W r.r.e.e.e.:.:.:.:.=.=.=.` ` ` ~ ~ ~ ~ ~ ~ W W W W W W W W W W T $.- HXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXl @.T W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ` ` ` =.=.=.:.:.:.:.e.e.r.W |.CXGXGXGXGXGXGXGXGXBX2Xr.h.k.k.k.k.k.k.k.k.k.h.,.,.|.NXZXGXGXGXGXGXGXGXGXGXZXgXV.~ u.e.e.e.:.:.:.:.:.=.=.` ` ` ` ~ ~ ~ ~ ~ ~ W W W W W W W W W T $.% HXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHX@ $.T W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ~ ` ` ` ` =.=.:.:.:.:.e.:.' >XFXGXGXGXGXGXGXGXSXNX{.,.k.k.k.k.k.k.k.k.k.k.k.k.u.~ `.NXSXGXGXGXGXGXGXGXGXSXCX>X=.e.r.r.e.e.:.:.:.:.:.=.=.` ` ` ~ ~ ~ ~ ~ ~ W W W W W W W W W T $.. HXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHX%.R W W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ` ` ` ` =.=.:.:.:.:.e.~ s.fXFXGXGXGXGXGXGXGXSXNXJ.,.k.k.k.k.k.k.k.k.k.k.h.h.k.u.O.2XCXGXGXGXGXGXGXGXGXGXAXhXV.~ u.r.e.e.e.:.:.:.:.=.=.=.` ` ` ~ ~ ~ ~ ~ W W W W W W W W W W $.HXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHX$.R W W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ~ ` ` ` ` ~ :.:.:.:.e.f Z.VXSXGXGXGXGXGXGXGXDXzXM.r.k.k.k.k.k.k.k.h.h.h.h.f.f.k.=.V.NXSXGXGXGXGXGXGXGXGXSXVX`.W r.e.e.e.e.:.:.:.:.=.=.=.` ` ` ~ ~ ~ ~ ~ ~ E W W W W W W W W $.HXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXO.W W W W W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ` ` =.~ Q a a W =.=.t XCXGXGXGXGXGXGXGXGXBX2Xr.f.k.k.k.k.k.k.h.h.h.h.f.f.f.f.r.y.kXFXGXGXGXGXGXGXGXGXGXBX,X~ :.e.e.e.:.:.:.:.:.:.=.=.` ` ` ` ~ ~ ~ ~ ~ E W W W W W W W ~ ..HXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXI O.W W W W W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ` a z.-X_.B.q.! u C.NXSXGXGXGXGXGXGXGXSXNX'.=.h.h.k.k.k.h.h.f.f.f.f.f.f.f.f.r.w.5XFXGXGXGXGXGXGXGXGXGXCX2X=.:.e.:.:.:.:.:.:.:.:.=.=.=.` ` ` ` ~ ~ ~ ~ ~ E W W W W W W O.P HXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXk @.T W W W W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ~ t ).jXVXNXaX2X1XBXDXSXGXGXGXGXGXGXGXSXmXA.:.h.h.h.h.h.f.f.f.f.f.f.f.f.f.f.,.d.vXFXGXGXGXGXGXGXGXGXGXCX1X` =.:.:.:.:.:.:.=.=.=.=.=.=.` ` ` ` ~ ~ ~ ~ ~ ~ W W W W W T $.; HXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXo %.T W W W W W W W W W W W W W W W W W W W W ~ ~ ~ ` y q.fXZXSXSXFXFXFXSXSXGXGXGXGXGXGXGXGXFXxXj.r.f.h.h.h.f.f.f.f.f.f.f.f.u.u.f.W B.NXSXGXGXGXGXGXGXGXGXSXBXoXW :.:.:.:.:.:.=.=.=.=.=.` ` ` ` ` ` ~ ~ ~ ~ ~ ~ W W W W W W %. HXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHX$.R W W W W W W W W W W W W W W W W W W W E ~ ~ ~ ` e !.CXSXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXFX+Xd ,.f.h.h.h.f.f.f.f.f.f.u.u.u.f.,.T :XFXGXGXGXGXGXGXGXGXGXSXNXE.f :.:.:.:.:.=.=.=.=.` ` ` ` ` ` ~ ~ ~ ~ ~ ~ ~ ~ ~ W W W W R $.HXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHX~ ..W W W W W W W W W W W W W W W W W W W W E ~ ~ a _ aXFXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXFX7XV.s.:.=.:.,.u.f.f.f.f.u.u.u.r.~ s ~.VXSXGXGXGXGXGXGXGXGXGXAXhXV.d :.:.=.=.=.=.=.` ` ` ` ` ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ W W W W O.E HXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXg $.T W W W W W W W W W W W W W W W W W W W E ~ ~ e G.hXAXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXSXFXVXpX*X_.Z.x.t.:.` ~ ~ ~ ~ ~ ' x.*XVXSXGXGXGXGXGXGXGXGXGXGXDXuXw.W :.=.=.=.=.` ` ` ` ` ` ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ W W W W W W T $.; HXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHX %.R W W W W W W W W W W W W W W W W W W W W ~ d T qXgXBXFXSXSXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXSXFXFXBXNXaX>X,X[._.T.T.E.|.:XNXCXSXGXGXGXGXGXGXGXGXGXGXSXVX Xd =.=.=.=.` ` ` ` ` ` ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ E W W W W W W R %.HXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHX@.W W W W W W W W W W W W W W W W W W W W W ~ R ` s.H.oXkXNXNXCXFXSXSXGXGXGXGXGXGXGXGXGXGXGXGXGXGXSXSXDXFXCXCXBXVXVXBXCXFXSXSXGXGXGXGXGXGXGXGXGXGXGXAXhXm.a :.` =.` ` ` ` ` ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ W W W W W W W W W W @.HXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXx @.T W W W W W W W W W W W W W W W W W W W W ~ ~ y t a _ g.L.oXkXhXVXCXFXSXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXSXGXSXSXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXSXBX:Xf ~ ` ` ` ` ` ` ` ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ E W W W W W W W W W T $.h HXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHX%.R W W W W W W W W W W W W W W W W W W W W W ~ ~ ~ ~ d a t a ' s.R.oXnXDXSXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXZXhXg.y =.` ` ` ` ` ~ ~ ~ ~ ~ ~ ~ ~ ~ E ~ E W W W W W W W W W W R %.HXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXO.~ W W W W W W W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ` ` ~ W a a d ! <XFXGXGXGXGXGXFXSXSXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXAXjX`.y ` ` ` ` ` ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ E E W W W W W W W W W W W W ..O.HXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHX; $.T W W W W W W W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ` ` ` =.~ p 2XFXGXGXGXSXZXMXNXVXFXSXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXZXjX%Xa W =.` ` ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W W T %.= HXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHX%.R W W W W W W W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ~ ` ` =.d a.mXSXGXGXSXCXY.:.U..XkXDXSXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXGXSXAXBXjX Xa d =.` ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W R $.HXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXv $.T W W W W W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ~ ` ` ` a C.NXSXGXGXDXNXg.a ~ ~ ~ '.FXGXGXGXGXFXFXFXDXDXSXSXSXSXSXSXSXSXDXBXhXuXZ.y d ` ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W T $.x HXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHX%.R W W W W W W W W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ` ` =.i ].CXGXGXGXCX5X:.:.r.r.d [.FXGXGXGXFXlXXX3XzXmXNXNXNXNXNXNXNXfXuX,XJ.~ t ~ ` ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W W R %.HXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXP @.T W W W W W W W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ` ~ E :XFXGXGXGXVX|.R e.r.:.w.yXFXGXGXSXCX'.e ` t.g.m.J.L.R.R.L.A.x.;.d t f ` ` ~ ~ ~ ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W W W W T @.m HXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHX%.R W W W W W W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ` a q.fXDXGXGXSXNXJ.f e.r.~ x.hXSXGXGXSXNXV.d ` W f d d a a a a a a d ~ ` ` ~ ~ ~ ~ ~ ~ ~ ~ E E W W W W W W W W W W W W W W W W W W W W W R %.HXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXP $.T W W W W W W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ` t C.VXSXGXGXDXfXg.W e.r.f K.VXSXGXGXDXbXt.W :.:.:.=.=.=.` ` ` ` ` ` ~ ~ ~ ~ ~ ~ ~ ~ ~ E E W W W W W W W W W W W W W W W W W W W W W W T $.v HXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHX%.W W W W W W W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ t ].CXSXGXGXFX3X` =.e.e.R ).CXGXGXGXCX2XW ` =.=.=.` ` ` ` ` ` ~ ` ~ ~ ~ ~ ~ ~ ~ ~ ~ E E W W W W W W W W W W W W W W W W W W W W W W W W %.HXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHX* %.R W W W W W W W W W W W W W W W W W W W W W ~ ~ ~ ~ R Q wXNXAXSXSXVX[.d :.e.=.;.yXFXGXGXSXVX`.a =.=.=.` ` ` ` ` ` ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W W W W W W W W T %.* HXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX@.O.T W W W W W W W W W W W W W W W W W W W W E ~ ~ ~ d ' @XyXNXVXNXdXZ.d :.e.R s.NXSXGXGXSXNXV.a =.` ` ` ` ` ` ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W W W W W W W W W W W T O.@.HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX5.R W W W W W W W W W W W W W W W W W W W W W ~ ~ ~ ! ~ d ' b.W.%XrXd.R :.:.a K.NXSXGXGXFXbXw.f =.` ` ` ` ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ E E W W W W W W W W W W W W W W W W W W W W W W W W W W W R 5.HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXg %.R W W W W W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ d a y R w.:.=.:.=.R =XgXDXSXAXBX1XR ~ ` ` ` ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W W W W W W W W W W W W T %.w HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX+.@.T W W W W W W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ` ` ` ~ R ` :.:.=.` K.%XzXNXNXgXE.y ` ` ` ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W W W W W W W W W W W W W T @.o.HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX%.~ T W W W W W W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ` ` ` ` =.=.:.:.:.d d ;.b.R.&Xv.a ` ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W T ~ %.HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX4.R T W W W W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ` ` ` ` =.=.=.=.=.` R a y R ~ ` ~ ~ ~ ~ ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W T R 5.HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX& %.R W W W W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ~ ` ` ` =.=.` ` ` ` ` ` ` ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W R 4.$ HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXk %.R W W W W W W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ` ` ` ` ` ` ` ` ` ` ~ ~ ~ ~ ~ ~ ~ ~ ~ E E E W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W R %.g HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXM %.R W W W W W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ` ` ` ` ` ` ` ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W R %.n HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX{ $.R W W W W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ` ` ` ` ` ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W R $.U HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX{ $.R W W W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ` ` ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ E E W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W R %.M HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXM %.R W W W W W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W R %.n HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXk %.R T W W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W T W %.g HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX* 4.~ T W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W T ..4.# HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX%.@.T W W W W W W W W W W W W W W W ~ ~ ~ ~ ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W T @.%.HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX .%.R T W W W W W W W W W W W W W E ~ ~ ~ ~ ~ ~ ~ E W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W T R %.} HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX7 4.O.T W W W W W W W W W W W W W ~ ~ ~ ~ E E W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W T O.%.- HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX+.%.W T W W W W W W W W W W W E ~ E E W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W T W %. .HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX- %.@.R T W W W W W W W W W W ~ W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W T R $.%.* HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXk %.@.R T W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W T R @.%.j HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXn %.@.R T W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W T W @.%.n HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXk $.$.~ R T W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W T R ..$.$.j HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX- O.%.@.W T T W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W T T W @.%.O.* HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXk @.%.$.O.R T T W W W W W W W W W W W W W W W W W W W W W W T T R O.$.%.@.h HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX; E $.%.$.O.~ W W T T T T T T T T T T T T T T W W W O.$.$.$.E ; HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX ; P ..$.$.$.$.$.@.@.@.@.@.@.@.@.$.$.$.$.$.O.P ; . HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXO % ; g h h h h h h h ; % O HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX",
|
||||
"HXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHXHX"
|
||||
};
|
||||
static char * bitcoin128_xpm[] = {
|
||||
"128 128 481 2",
|
||||
" c None",
|
||||
". c #FFFFFF",
|
||||
"+ c #ECEEEE",
|
||||
"@ c #CED3D4",
|
||||
"# c #F0F2F2",
|
||||
"$ c #F9FAFA",
|
||||
"% c #C7CDCD",
|
||||
"& c #6B7A7C",
|
||||
"* c #405457",
|
||||
"= c #6C7B7D",
|
||||
"- c #B8BFC0",
|
||||
"; c #EFF1F1",
|
||||
"> c #E3E6E7",
|
||||
", c #8E9A9B",
|
||||
"' c #415558",
|
||||
") c #2B4145",
|
||||
"! c #2B4245",
|
||||
"~ c #2B4144",
|
||||
"{ c #374C4F",
|
||||
"] c #667679",
|
||||
"^ c #B3BBBC",
|
||||
"/ c #EEF0F0",
|
||||
"( c #F6F7F7",
|
||||
"_ c #B5BCBD",
|
||||
": c #58696C",
|
||||
"< c #2E4447",
|
||||
"[ c #2C4245",
|
||||
"} c #2D4346",
|
||||
"| c #344A4D",
|
||||
"1 c #617274",
|
||||
"2 c #B0B8B9",
|
||||
"3 c #EEEFF0",
|
||||
"4 c #FEFEFE",
|
||||
"5 c #D7DBDC",
|
||||
"6 c #7A888A",
|
||||
"7 c #364B4E",
|
||||
"8 c #32474A",
|
||||
"9 c #5D6E71",
|
||||
"0 c #ADB5B6",
|
||||
"a c #A2ACAD",
|
||||
"b c #495C5E",
|
||||
"c c #2C4346",
|
||||
"d c #2A4043",
|
||||
"e c #304649",
|
||||
"f c #5A6B6E",
|
||||
"g c #A6AFB1",
|
||||
"h c #E6E8E9",
|
||||
"i c #FDFEFE",
|
||||
"j c #F8F9F9",
|
||||
"k c #C2C9CA",
|
||||
"l c #657577",
|
||||
"m c #2F4548",
|
||||
"n c #314749",
|
||||
"o c #506365",
|
||||
"p c #56676A",
|
||||
"q c #9FA9AA",
|
||||
"r c #E1E4E4",
|
||||
"s c #FCFDFD",
|
||||
"t c #DDE0E1",
|
||||
"u c #879496",
|
||||
"v c #3D5154",
|
||||
"w c #475A5D",
|
||||
"x c #9AA5A6",
|
||||
"y c #E2E5E6",
|
||||
"z c #C9CFD0",
|
||||
"A c #7F8C8E",
|
||||
"B c #435659",
|
||||
"C c #526466",
|
||||
"D c #98A3A4",
|
||||
"E c #DCDFE0",
|
||||
"F c #FBFCFC",
|
||||
"G c #F1F3F3",
|
||||
"H c #ABB4B5",
|
||||
"I c #536568",
|
||||
"J c #778587",
|
||||
"K c #D1D6D7",
|
||||
"L c #F8F8F8",
|
||||
"M c #CFD3D4",
|
||||
"N c #869394",
|
||||
"O c #45595B",
|
||||
"P c #2A4044",
|
||||
"Q c #2D4347",
|
||||
"R c #4E6063",
|
||||
"S c #919C9E",
|
||||
"T c #D6DADB",
|
||||
"U c #FAFBFB",
|
||||
"V c #FBFBFB",
|
||||
"W c #CCD1D2",
|
||||
"X c #718082",
|
||||
"Y c #354A4D",
|
||||
"Z c #2A4144",
|
||||
"` c #F3F4F4",
|
||||
" . c #FAFAFA",
|
||||
".. c #D4D9DA",
|
||||
"+. c #8D999A",
|
||||
"@. c #485C5E",
|
||||
"#. c #495C5F",
|
||||
"$. c #8A9698",
|
||||
"%. c #D2D7D8",
|
||||
"&. c #E6E9E9",
|
||||
"*. c #939EA0",
|
||||
"=. c #43575A",
|
||||
"-. c #3E5255",
|
||||
";. c #8E9A9C",
|
||||
">. c #DADEDF",
|
||||
",. c #4C5F61",
|
||||
"'. c #859193",
|
||||
"). c #D1D6D6",
|
||||
"!. c #F7F8F8",
|
||||
"~. c #B9C0C1",
|
||||
"{. c #5B6C6F",
|
||||
"]. c #314649",
|
||||
"^. c #68787A",
|
||||
"/. c #C8CECF",
|
||||
"(. c #FDFDFD",
|
||||
"_. c #E0E4E4",
|
||||
":. c #9BA5A6",
|
||||
"<. c #4F6264",
|
||||
"[. c #818E90",
|
||||
"}. c #CFD4D4",
|
||||
"|. c #DBDFDF",
|
||||
"1. c #7E8B8D",
|
||||
"2. c #384D50",
|
||||
"3. c #4B5E60",
|
||||
"4. c #A3ADAE",
|
||||
"5. c #E3E6E6",
|
||||
"6. c #9CA6A8",
|
||||
"7. c #536567",
|
||||
"8. c #7B898B",
|
||||
"9. c #A5AEB0",
|
||||
"0. c #394E51",
|
||||
"a. c #D8DDDD",
|
||||
"b. c #E4E6E7",
|
||||
"c. c #A0AAAB",
|
||||
"d. c #3B5052",
|
||||
"e. c #768586",
|
||||
"f. c #C4CACB",
|
||||
"g. c #F4F5F5",
|
||||
"h. c #FAFAFB",
|
||||
"i. c #C6CCCD",
|
||||
"j. c #6A7A7C",
|
||||
"k. c #5D6E70",
|
||||
"l. c #5E6F71",
|
||||
"m. c #33494C",
|
||||
"n. c #BEC4C5",
|
||||
"o. c #F1F2F2",
|
||||
"p. c #E0E3E4",
|
||||
"q. c #8E999B",
|
||||
"r. c #3F5456",
|
||||
"s. c #45585B",
|
||||
"t. c #95A0A1",
|
||||
"u. c #E5E7E8",
|
||||
"v. c #E9EBEC",
|
||||
"w. c #ADB6B7",
|
||||
"x. c #647476",
|
||||
"y. c #384C4F",
|
||||
"z. c #B6BEBF",
|
||||
"A. c #EDEFEF",
|
||||
"B. c #F2F3F3",
|
||||
"C. c #AFB7B8",
|
||||
"D. c #56686A",
|
||||
"E. c #34494C",
|
||||
"F. c #728183",
|
||||
"G. c #CDD2D3",
|
||||
"H. c #B4BCBD",
|
||||
"I. c #69797B",
|
||||
"J. c #657678",
|
||||
"K. c #EAEDED",
|
||||
"L. c #FCFCFC",
|
||||
"M. c #CFD4D5",
|
||||
"N. c #748385",
|
||||
"O. c #AEB6B7",
|
||||
"P. c #F1F2F3",
|
||||
"Q. c #F0F1F1",
|
||||
"R. c #BCC3C4",
|
||||
"S. c #707F81",
|
||||
"T. c #607173",
|
||||
"U. c #AAB3B4",
|
||||
"V. c #E9EBEB",
|
||||
"W. c #EAECED",
|
||||
"X. c #465A5C",
|
||||
"Y. c #3C5053",
|
||||
"Z. c #899697",
|
||||
"`. c #758386",
|
||||
" + c #3A4F52",
|
||||
".+ c #33484B",
|
||||
"++ c #5A6C6E",
|
||||
"@+ c #A4AEAF",
|
||||
"#+ c #BFC5C6",
|
||||
"$+ c #304548",
|
||||
"%+ c #798789",
|
||||
"&+ c #556769",
|
||||
"*+ c #E5E8E8",
|
||||
"=+ c #DEE1E2",
|
||||
"-+ c #849192",
|
||||
";+ c #3A4E51",
|
||||
">+ c #485B5E",
|
||||
",+ c #9DA7A8",
|
||||
"'+ c #EDEEEF",
|
||||
")+ c #CAD0D1",
|
||||
"!+ c #7D8A8C",
|
||||
"~+ c #516366",
|
||||
"{+ c #E2E5E5",
|
||||
"]+ c #788688",
|
||||
"^+ c #D3D8D9",
|
||||
"/+ c #828F91",
|
||||
"(+ c #44585A",
|
||||
"_+ c #4E6163",
|
||||
":+ c #97A2A3",
|
||||
"<+ c #CBD0D1",
|
||||
"[+ c #6E7D7F",
|
||||
"}+ c #32484B",
|
||||
"|+ c #596B6D",
|
||||
"1+ c #F4F5F6",
|
||||
"2+ c #D2D6D7",
|
||||
"3+ c #899597",
|
||||
"4+ c #4B5E61",
|
||||
"5+ c #D8DCDC",
|
||||
"6+ c #919D9E",
|
||||
"7+ c #425658",
|
||||
"8+ c #909C9E",
|
||||
"9+ c #D6DBDB",
|
||||
"0+ c #8A9798",
|
||||
"a+ c #D2D7D7",
|
||||
"b+ c #F9F9F9",
|
||||
"c+ c #F5F6F6",
|
||||
"d+ c #5B6C6E",
|
||||
"e+ c #6D7C7F",
|
||||
"f+ c #DCE0E0",
|
||||
"g+ c #D3D7D8",
|
||||
"h+ c #506265",
|
||||
"i+ c #A9B3B4",
|
||||
"j+ c #EFF0F1",
|
||||
"k+ c #9EA8AA",
|
||||
"l+ c #7C898C",
|
||||
"m+ c #C7CDCE",
|
||||
"n+ c #EBEDED",
|
||||
"o+ c #849193",
|
||||
"p+ c #596A6D",
|
||||
"q+ c #768486",
|
||||
"r+ c #C3C9CA",
|
||||
"s+ c #C2C8C9",
|
||||
"t+ c #637476",
|
||||
"u+ c #C0C6C7",
|
||||
"v+ c #EAECEC",
|
||||
"w+ c #5C6D70",
|
||||
"x+ c #A8B1B2",
|
||||
"y+ c #889496",
|
||||
"z+ c #99A4A5",
|
||||
"A+ c #EBEEEE",
|
||||
"B+ c #ECEEEF",
|
||||
"C+ c #AEB7B8",
|
||||
"D+ c #617174",
|
||||
"E+ c #344A4C",
|
||||
"F+ c #273E41",
|
||||
"G+ c #F2F3F4",
|
||||
"H+ c #748284",
|
||||
"I+ c #D0D5D6",
|
||||
"J+ c #FCFCFD",
|
||||
"K+ c #283F42",
|
||||
"L+ c #919D9F",
|
||||
"M+ c #738284",
|
||||
"N+ c #33494B",
|
||||
"O+ c #4D6062",
|
||||
"P+ c #96A1A3",
|
||||
"Q+ c #3F5356",
|
||||
"R+ c #8B9799",
|
||||
"S+ c #DFE2E2",
|
||||
"T+ c #D9DDDE",
|
||||
"U+ c #B8C0C1",
|
||||
"V+ c #31474A",
|
||||
"W+ c #F9F9FA",
|
||||
"X+ c #A6B0B1",
|
||||
"Y+ c #D7DCDC",
|
||||
"Z+ c #7D8B8D",
|
||||
"`+ c #A5AEAF",
|
||||
" @ c #6B7B7D",
|
||||
".@ c #263D40",
|
||||
"+@ c #8F9B9D",
|
||||
"@@ c #4C5F62",
|
||||
"#@ c #384D4F",
|
||||
"$@ c #DADEDE",
|
||||
"%@ c #8D989A",
|
||||
"&@ c #405557",
|
||||
"*@ c #B6BDBE",
|
||||
"=@ c #C7CCCD",
|
||||
"-@ c #5C6D6F",
|
||||
";@ c #BBC2C3",
|
||||
">@ c #B1BABB",
|
||||
",@ c #E4E7E7",
|
||||
"'@ c #8D999B",
|
||||
")@ c #939E9F",
|
||||
"!@ c #E7EAEA",
|
||||
"~@ c #D4D8D9",
|
||||
"{@ c #516365",
|
||||
"]@ c #F6F7F8",
|
||||
"^@ c #2D4345",
|
||||
"/@ c #6F7E80",
|
||||
"(@ c #CCD2D2",
|
||||
"_@ c #9BA6A7",
|
||||
":@ c #46595C",
|
||||
"<@ c #859294",
|
||||
"[@ c #DDE1E1",
|
||||
"}@ c #FEFFFF",
|
||||
"|@ c #C9CFCF",
|
||||
"1@ c #3B4F52",
|
||||
"2@ c #526467",
|
||||
"3@ c #A9B2B4",
|
||||
"4@ c #BEC5C6",
|
||||
"5@ c #C0C7C8",
|
||||
"6@ c #F7F8F9",
|
||||
"7@ c #879395",
|
||||
"8@ c #C1C7C8",
|
||||
"9@ c #637375",
|
||||
"0@ c #A3ACAE",
|
||||
"a@ c #BAC1C2",
|
||||
"b@ c #F6F6F7",
|
||||
"c@ c #DBDEDF",
|
||||
"d@ c #CAD0D0",
|
||||
"e@ c #DFE2E3",
|
||||
"f@ c #44575A",
|
||||
"g@ c #97A2A4",
|
||||
"h@ c #E8EAEA",
|
||||
"i@ c #E0E3E3",
|
||||
"j@ c #516466",
|
||||
"k@ c #68787B",
|
||||
"l@ c #F3F5F5",
|
||||
"m@ c #425659",
|
||||
"n@ c #293F42",
|
||||
"o@ c #6A797C",
|
||||
"p@ c #D0D5D5",
|
||||
"q@ c #AFB8B9",
|
||||
"r@ c #DBDFE0",
|
||||
"s@ c #69787A",
|
||||
"t@ c #B8C0C0",
|
||||
"u@ c #F0F1F2",
|
||||
"v@ c #8A9697",
|
||||
"w@ c #E8EAEB",
|
||||
"x@ c #D9DDDD",
|
||||
"y@ c #ACB4B6",
|
||||
"z@ c #6F7E81",
|
||||
"A@ c #5F7072",
|
||||
"B@ c #738183",
|
||||
"C@ c #3B5053",
|
||||
"D@ c #677779",
|
||||
"E@ c #B9C1C1",
|
||||
"F@ c #C3CACB",
|
||||
"G@ c #627375",
|
||||
"H@ c #55676A",
|
||||
"I@ c #3C5153",
|
||||
"J@ c #283E42",
|
||||
"K@ c #294043",
|
||||
"L@ c #D8DCDD",
|
||||
"M@ c #374C4E",
|
||||
"N@ c #B0B9BA",
|
||||
"O@ c #FEFFFE",
|
||||
"P@ c #D5DADA",
|
||||
"Q@ c #273D41",
|
||||
"R@ c #45595C",
|
||||
"S@ c #768587",
|
||||
"T@ c #627274",
|
||||
"U@ c #ACB5B6",
|
||||
"V@ c #E9ECEC",
|
||||
"W@ c #829091",
|
||||
"X@ c #808E90",
|
||||
"Y@ c #C1C8C9",
|
||||
"Z@ c #A8B1B3",
|
||||
"`@ c #BFC6C7",
|
||||
" # c #3E5355",
|
||||
".# c #C5CCCC",
|
||||
"+# c #A6AFB0",
|
||||
"@# c #9CA6A7",
|
||||
"## c #596A6C",
|
||||
"$# c #F2F4F4",
|
||||
"%# c #758485",
|
||||
"&# c #C3CACA",
|
||||
"*# c #4A5D60",
|
||||
"=# c #7C8A8B",
|
||||
"-# c #58696B",
|
||||
";# c #B1B9BA",
|
||||
"># c #CBD1D2",
|
||||
",# c #57686B",
|
||||
"'# c #929E9F",
|
||||
")# c #405456",
|
||||
"!# c #8C9899",
|
||||
"~# c #E1E4E5",
|
||||
"{# c #B5BDBE",
|
||||
"]# c #57696B",
|
||||
"^# c #A1ABAD",
|
||||
"/# c #5A6B6D",
|
||||
"(# c #939FA0",
|
||||
"_# c #E1E5E5",
|
||||
":# c #46595B",
|
||||
"<# c #2F4447",
|
||||
"[# c #546668",
|
||||
"}# c #9DA8A9",
|
||||
"|# c #E7E9EA",
|
||||
"1# c #9AA4A6",
|
||||
"2# c #475B5D",
|
||||
"3# c #FDFDFE",
|
||||
"4# c #2E4346",
|
||||
"5# c #B7BEBF",
|
||||
"6# c #D3D8D8",
|
||||
"7# c #99A3A5",
|
||||
"8# c #D7DBDB",
|
||||
"9# c #4F6164",
|
||||
"0# c #949FA1",
|
||||
"a# c #808D8F",
|
||||
"b# c #96A1A2",
|
||||
"c# c #2D4447",
|
||||
"d# c #9FAAAB",
|
||||
"e# c #929D9F",
|
||||
"f# c #9EA8A9",
|
||||
"g# c #EBEDEE",
|
||||
"h# c #4D5F62",
|
||||
"i# c #959FA1",
|
||||
"j# c #4C5E61",
|
||||
"k# c #4A5D5F",
|
||||
"l# c #909B9D",
|
||||
"m# c #7A8889",
|
||||
"n# c #F4F6F6",
|
||||
"o# c #DEE2E2",
|
||||
"p# c #DFE3E3",
|
||||
"q# c #4E6062",
|
||||
"r# c #8F9B9C",
|
||||
"s# c #CACFD0",
|
||||
"t# c #586A6C",
|
||||
"u# c #B5BCBE",
|
||||
"v# c #8B9798",
|
||||
"w# c #3F5355",
|
||||
"x# c #425558",
|
||||
"y# c #949FA0",
|
||||
"z# c #9BA5A7",
|
||||
"A# c #6D7C7E",
|
||||
"B# c #C8CECE",
|
||||
"C# c #4F6163",
|
||||
"D# c #919C9D",
|
||||
"E# c #A0AAAC",
|
||||
"F# c #889596",
|
||||
"G# c #A8B2B3",
|
||||
"H# c #E4E7E8",
|
||||
"I# c #818F90",
|
||||
"J# c #D5D9DA",
|
||||
"K# c #2C4345",
|
||||
"L# c #889597",
|
||||
"M# c #DCE0E1",
|
||||
"N# c #A2ABAD",
|
||||
"O# c #56686B",
|
||||
"P# c #2F4547",
|
||||
"Q# c #2C4246",
|
||||
"R# c #667678",
|
||||
"S# c #5F6F72",
|
||||
"T# c #A1ABAC",
|
||||
"U# c #9BA6A8",
|
||||
"V# c #E8EBEB",
|
||||
"W# c #D9DCDD",
|
||||
"X# c #627275",
|
||||
"Y# c #859293",
|
||||
"Z# c #A7B0B1",
|
||||
"`# c #4F6265",
|
||||
" $ c #839091",
|
||||
".$ c #F8F8F9",
|
||||
"+$ c #CBD1D1",
|
||||
"@$ c #415557",
|
||||
"#$ c #7D8B8C",
|
||||
"$$ c #758385",
|
||||
"%$ c #C5CBCC",
|
||||
"&$ c #B7BFC0",
|
||||
"*$ c #607072",
|
||||
"=$ c #758486",
|
||||
"-$ c #465A5D",
|
||||
";$ c #394D50",
|
||||
">$ c #69787B",
|
||||
",$ c #728082",
|
||||
"'$ c #BDC4C5",
|
||||
")$ c #546568",
|
||||
"!$ c #717F81",
|
||||
"~$ c #68777A",
|
||||
"{$ c #778688",
|
||||
"]$ c #3A4F51",
|
||||
"^$ c #F5F6F7",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" . . . . . . . ",
|
||||
" . . . . . . . . . . . ",
|
||||
" . . . . . . . . . . . . . . ",
|
||||
" . . . . . . . + @ # . . . . . . . . ",
|
||||
" . . . . . . . $ % & * = - ; . . . . . . . . ",
|
||||
" . . . . . . . > , ' ) ! ~ { ] ^ / . . . . . . . . ",
|
||||
" . . . . . . . ( _ : < [ } } } [ ~ | 1 2 3 . . . . . . . . ",
|
||||
" . . . . . . . 4 5 6 7 ~ } } } } } } } [ ~ 8 9 0 + 4 . . . . . . . ",
|
||||
" . . . . . . . + a b ~ [ } } } } ~ [ } } } } c d e f g h i . . . . . . . . ",
|
||||
" . . . . . . . j k l m ~ } } } } ~ n o * ~ ~ } } } } } d m p q r s . . . . . . . . ",
|
||||
" . . . . . . 4 t u v d c } } } [ ~ w x y z A B ~ ~ } } } } } d < C D E F . . . . . . . . ",
|
||||
" . . . . . . . G H I } ! } } } } d 7 J K F . . L M N O ! ~ } } } } } P Q R S T U . . . . . . . . ",
|
||||
" . . . . . . . V W X Y Z } } } } ! [ : ^ ` . . . . . . ...+.@.[ ~ } } } } } ~ } #.$.%.$ . . . . . . . . ",
|
||||
" . . . . . . . &.*.=.~ [ } } } c Z -.;.> . . . . . . . . . . F >.*.,.} ~ } } } } } ~ } O '.).$ . . . . . . . . ",
|
||||
" . . . . . . . !.~.{.m ! } } } } ~ ].^./.U . . . . . . . . . . . . . (._.:.<.< ~ } } } } } ! [ ' [.}.$ . . . . . . . . ",
|
||||
" . . . . . . 4 |.1.2.~ } } } } [ [ 3.4.# . . . . . . . . . . . . . . . . . 4 5.6.7.e ~ c } } } } [ ~ -.8.z !.. . . . . . . . ",
|
||||
" . . . . . . . / 9.,.~ [ } } } } ~ 0.1.a.4 . . . . . . . . . . . . . . . . . . . . 4 b.c.: 8 ~ [ } } } } [ d d.e.f.g.. . . . . . . . ",
|
||||
" . . . . . . . h.i.j.e ~ } } } } ~ m k.- ( . . . . . . . . . . . . . . . . . . . . . . . . 4 h g l.m.Z [ } } } } [ d 0.X n.o.. . . . . . . . ",
|
||||
" . . . . . . 4 p.q.r.d [ } } } [ ~ s.t.u.. . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 v.w.x.Y d [ } } } } [ d y.= z.A.. . . . . . . . ",
|
||||
" . . . . . . . B.C.D.} ~ } } } } d E.F.G.V . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . + H.I.{ d [ } } } } [ d 7 J.2 K.. . . . . . . . ",
|
||||
" . . . . . . . L.M.N.7 Z } } } } ! [ 7.O.P.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Q.R.S.2.d [ } } } } [ Z Y T.U.V.4 . . . . . . . ",
|
||||
" . . . . . . . W.D X.[ [ } } } } d Y.Z.r 4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . g.f.`. +d [ } } } } [ ~ .+++@+&.4 . . . . . . . . ",
|
||||
" . . . . . . . j #+T.$+~ } } } } ) $+l f. .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . !./.%+v ~ [ } } } } [ ~ ].&+c.*+4 . . . . . . . . ",
|
||||
" . . . . . . . 4 =+-+;+~ } } } } [ [ >+,+'+. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . j )+!+* [ ! } } } } } ~ < ~+6.{+(.. . . . . . . . ",
|
||||
" . . . . . . . # U.<.~ [ } } } } ~ { ]+^+(.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . j G./+(+c ~ } } } } } ~ } _+:+t L.. . . . . . . . ",
|
||||
" . . . . . . . U <+[+}+~ } } } } ~ < |+^ 1+. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . $ 2+3+@.} ~ } } } } } ~ [ 4+S 5+U . . . . . . . . ",
|
||||
" . . . . . . . 5.6+7+d [ } } } [ Z 7+8+y . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . U 9+S R < Z } } } } } ~ [ >+0+a+b+. . . . . . . . ",
|
||||
" . . . . . . . c+H.d+< ~ } } } } Z }+e+z .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . F f+D ~+< d } } } } } ~ [ O -+W !.. . . . . . . ",
|
||||
" . . . . . . . s g+%+2.P } } } } [ ~ h+i+j+. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . s _.k+&+m d } } } } } ~ [ ' l+m+( . . . . . . ",
|
||||
" . . . . . . . n+6.b [ [ } } } } d 0.o+t 4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 *+9.p+e d c } } } } ! ! -.q+r+( . . . . ",
|
||||
" . . . . . . . $ s+t+].~ } } } } ~ m T.u+j . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . v+U.w+8 ~ [ } } } } [ ~ 2.x+. . . . ",
|
||||
" . . . . . . . {+y+Y.~ } } } } [ [ O z+A+. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . B+C+D+E+~ [ } } } } F+8+. . . . ",
|
||||
" . . . . . . . G+C.I [ [ } } } } ~ 7 H+I+J+. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . / ^ ] { c } } } K+L+. . . . ",
|
||||
" . . . . . . . F @ M+N+Z } } } } ! } &+w.` . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . o.- O+~ } } K+L+. . . . ",
|
||||
" . . . . . . . *+P+s.d [ } } } [ d Q+R+S+4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 T+: d } } K+L+. . . . ",
|
||||
" . . . . . . . ( U+l.m ~ } } } } Z V+I.f.W+. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . / X+o < } } } K+L+. . . . ",
|
||||
" . . . . . . 4 Y+Z+;+Z } } } } [ ~ ,.`+A.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . $ i. @.+~ } } } } .@+@. . . . ",
|
||||
" . . . . . . . Q.a @@[ [ } } } } Z #@A $@(.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . y %@&@~ [ } } } [ d * *@. . . . ",
|
||||
". . . . . . U =@^.8 ~ } } } } [ < -@;@!.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . c+>@D.< [ } } } } ~ .+X M.L.. . . . ",
|
||||
". . . . . ,@'@-.~ c } } } [ ~ 7+)@!@. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (.~@J Y ~ } } } } [ } {@H ` . . . . . . ",
|
||||
". . . ]@H.D.^@[ } } } } ~ E./@(@F . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . v+_@:@Z [ } } } [ ~ v <@[@}@. . . . . . . ",
|
||||
". . . |@1@d } } } } ! } 2@3@B.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ( 4@T.< ~ } } } } ~ V+l 5@6@. . . . . . . . . ",
|
||||
". . . 5@8 [ } } } Z v 7@t 4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . (.5+[. +d } } } } [ ! 4+c.W.. . . . . . . . . . . ",
|
||||
". . . 8@.+[ } } m 9@5@j . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . + 0@_+[ [ } } } } d 2.1.T L.. . . . . . . . . . . . . ",
|
||||
". . . 8@.+[ } [ Q+}.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . b+f.^.8 ~ } } } } ~ < l.a@b@. . . . . . . . . . . . . . . . ",
|
||||
". . . 8@.+[ } [ B c@. . . . . . . G d@G . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 e@3+-.~ [ } } } [ Z f@g@h@. . . . . . . . . . . . . . . . . . . . ",
|
||||
". . . 8@.+[ } [ B >.. . . . . . . i@j@k@;@` . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . l@w.2@} [ } } } } ~ E.F.2+s . . . . . . . . . . . . . . . . . . . . . ",
|
||||
". . . 8@.+[ } [ B >.. . . . . . . =+m@n@7 o@;@B.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . L.p@X E.~ } } } } [ } I q@g.. . . . . . . . . . . . . . . (.]@# + $ . . . ",
|
||||
". . . 8@.+[ } [ B >.. . . . . . . r@Q+! [ d Y s@t@u@. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . !@g@=.Z [ } } } [ ~ -.v@p.. . . . 4 4 s !.; w@r x@(@R.y@6.+.A z@A@B@*+. . . ",
|
||||
". . . 8@.+[ } [ B >.. . . . . . . T+C@[ } } [ d E.D@_ A.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . c+E@9 } ~ } } } } ~ }+^.F@b+. . . . .- $.Z+S.G@H@>+I@7 .+m [ n@J@n@K@R+V . . . ",
|
||||
". . . 8@.+[ } [ B >.. . . . . . . L@M@~ } } } } [ d E.l N@n+O@. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . L.P@!+2.d } } } } [ [ R a + . . . . . . 4 C+E+Q@K+K@d ~ [ [ [ } } } } ) R@%.. . . . ",
|
||||
". . . 8@.+[ } [ B >.. . . . . . . K.S@0.d [ } } } } [ d E.T@U@v.4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . V@k+3.~ [ } } } } d ;+[.L@s . . . . . . . . c+W@} } } } } } } } } } } } [ X@$ . . . . ",
|
||||
". . . 8@.+[ } [ B >.. . . . . . . . ` Y@N. +d [ } } } } [ Z E.l.Z@w@4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . L `@l n ~ } } } } ~ < T.R.( . . . . . . . . . . . _.d+~ } } } } } } } } } [ #/.. . . . ",
|
||||
". . . 8@.+[ } [ B >.. . . . . . . . . . c+.#J 1@d [ } } } } [ ~ .+{.+#w@4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . }@t '.v ~ [ } } } [ ~ :@@#V@. . . . . . . . . . . . . . s+Q+[ } } } } } } } } ~ N.( . . . . ",
|
||||
". . . 8@.+[ } [ B >.. . . . . . . . . . . . !.z 6 v ~ [ } } } } [ ~ V+##+#V.}@. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . $#H o } [ } } } } ~ Y %#g+(.. . . . . . . . . . . . . . F &#*#[ } } } } } } } [ 2.4@. . . . ",
|
||||
". . . 8@.+[ } [ B >.. . . . . . . . . . . . . . b+W =#Q+[ [ } } } } } ~ e -#X+V.4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . L.@ [+}+~ } } } } [ < &+;#c+. . . . . . . . . . . . . . . *+S * } } } } } } } } } ~ s@$#. . . . ",
|
||||
". . . 8@.+[ } [ B c@. . . . . . . . . . . . . . . . j >#Z+' [ ! } } } } } Z m ,#@+&.4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . *+'#' Z [ } } } [ ~ )#!#~#. . . . . . . . . . . . . . . c+{#]#} ! } } } } } } } } [ E.{#. . . . ",
|
||||
". . . 8@.+[ } [ m@$@. . . . . . . . . . . . . . . . . . j W [.=.[ ~ } } } } } d < p ^#5.(.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . g.{#/#} ~ } } } } Z .+& i.$ . . . . . . . . . . . . . . L.2+]+7 d } } } } [ ~ } } } } d A@; . . . . ",
|
||||
". . . 8@.+[ } [ 7 (#_#(.. . . . . . . . . . . . . . . . . . j @ <@:#[ ~ } } } } } P <#[#}#p.s . . . . . . . . . . . . . . . . . . . . . . . . . . F %.6 { d } } } } [ [ o g 3 . . . . . . . . . . . . . . . |#1#w Z [ } } } } P 0.,.< } } } e H . . . . ",
|
||||
". . . 8@.+[ } } } e [#@#i@s . . . . . . . . . . . . . . . . . . $ %.$.2#[ ~ } } } } } P < C D [@L.. . . . . . . . . . . . . . . . . . . . . . . w@_@>+~ [ } } } } d C@-+>.3#. . . . . . . . . . . . . . ( a@T.m ~ } } } } ~ 4#-@5#6#p P } d ]#V.. . . . ",
|
||||
". . . u+].[ } } } } ~ m C 7#S+(.. . . . . . . . . . . . . . . . . . U 8#;.#.[ ~ } } } } } ~ < 9#0#E L.. . . . . . . . . . . . . . . . . . . ( ;@D+e ~ } } } } ~ m 9@u+!.. . . . . . . . . . . . . . i 5+a# +Z } } } } [ d =.b#*+. . E@d.~ c#d#. . . . ",
|
||||
". . . g+<.[ ~ } } } } } ~ m <.b#=+(.. . . . . . . . . . . . . . . . . . F $@e#*#[ ~ } } } } } ~ < ,.6+|.L.. . . . . . . . . . . . . . . 4 T+a#1@~ c } } } [ Z w f#g#. . . . . . . . . . . . . . . ; a @@[ [ } } } } Z E.B@}.L.. . . $ ;.~ _+r . . . . ",
|
||||
". . . s e@t.4+} ~ } } } } } ~ < h#t.e@(.. . . . . . . . . . . . . . . . . . s =+i#j#} ~ } } } } } ~ 4#k#l#|.s . . . . . . . . . . . . u@`+O+} [ } } } } ~ Y m#T (.. . . . . . . . . . . . . . h.i.D@V+~ } } } } [ } 7.2 n#. . . . . . &.9@e#(.. . . ",
|
||||
". . . . . (.o#0#h#< ~ } } } } } ~ } ,.P+p.(.. . . . . . . . . . . . . . . . . . (.p#b#q#< ~ } } } } } ~ [ >+r#$@L.. . . . . . . . V s# @V+~ } } } } [ < t#u#( . . . . . . . . . . . . . . . {+v#v ~ c } } } [ ~ -.v@r . . . . . . . . . T > . . . . ",
|
||||
". . . . . . . (.o#b#9#m ~ } } } } } ~ c ,.b#=+s . . . . . . . . . . . . . . . . . . (.e@g@o m ~ } } } } } ~ ) w '@5 V . . . . 4 ,@;.w#d [ } } } [ ~ x#+@,@. . . . . . . . . . . . . . . G+2 [#[ [ } } } } ~ }+D@f.$ . . . . . . . . . . . . . . . . ",
|
||||
" . . . . . . . . s S+7#C m Z } } } } } ~ [ j#y#c@F . . . . . . . . . . . . . . . . . . (.i@z#[#e Z c } } } } ~ ) :@$.^+ .. G+;#D.[ ) } } } } ~ E.A#B# .. . . . . . . . . . . . . . V }.B@E.Z } } } } [ [ C#4.A.. . . . . . . . . . . . . . . ",
|
||||
" . . . . . . . . s p#_@[#m d } } } } } Z [ 3.D#Y+U . . . . . . . . . . . . . . . . . . (.{+E#t#e d [ } } } } ~ ~ O F#U+q+Y P } } } } ! [ C G#j+. . . . . . . . . . . . . . . H#t.(+Z [ } } } c d C@I#T+4 . . . . . . . . . . . . . . . ",
|
||||
" . . . . . . . . s r q H@m d } } } } } ~ } k#+.J#U . . . . . . . . . . . . . . . . . . (.*++#d+e d [ } } } } ~ K#m.! [ } } } [ d v L#M#i . . . . . . . . . . . . . . n#{#-@< ~ } } } } ~ $+G@4@!.. . . . . . . . . . . ",
|
||||
" . . . . . . . (.> N#O#P#d } } } } } ~ } >+Z.~@h.. . . . . . . . . . . . . . . . . . 4 w@U.k.].d Q#} } } } [ } } } } ~ $+R#k $ . . . . . . . . . . . . . . s %.%+2.Z } } } } [ Z >+,+V@. . . . . . . ",
|
||||
" . . . . . . . 4 &.`+]#m Z } } } } } ~ } R@7@^+U . . . . . . . . . . . . . . . . . . }@n+w.S#V+d [ } } } } } [ ~ k#T#B+. . . . . . . . . . . . . . . W.U#b [ [ } } } } Z 7 8.J#(.. . . . . . . ",
|
||||
" . . . . . . . }@V#g ]#e ~ } } } } } ! Q#=.<@6#V . . . . . . . . . . . . . . . . . . . A.2 T.}+~ [ } } ~ { 8.W#4 . . . . . . . . . . . . . . W+8@T@e ! } } } } ! < /#- ( . . . . . . . ",
|
||||
" . . . . . . . }@v.g ##V+~ [ } } } } [ [ 7+<@6#U . . . . . . . . . . . . . . . . . . . / ;#X#E+Z < f - ( . . . . . . . . . . . . . . 4 =+Y#1@~ } } } } [ ! m@e#!@. . . . . . . ",
|
||||
" . . . . . . . 4 V.Z#d+}+~ [ } } } } ! ~ x#o+K $ . . . . . . . . . . . . . . . . . . . / >@ @e#h . . . . . . . . . . . . . . . # U.`#) [ } } } } ~ | /@<+V . . . . . . . ",
|
||||
" . . . . . . . 4 V#x+k.N+Z [ } } } } ~ Z ' $@ .$. . . . . . . . . . . . . . . . . . 4 n#U . . . . . . . . . . . . . . h.|@[+V+Z } } } } ! } I 3@o.. . . . . . . ",
|
||||
" . . . . . . . 4 V.H T.m.d [ } } } } ~ Z ' a#+$!.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 _#r#@$d [ } } } [ d Q+Z.[@4 . . . . . . ",
|
||||
" . . . . . . . 4 W.q@x.m.d [ } } } } ~ ~ &@#$/.( . . . . . . . . . . . . . . . . . . . . . . . . . . . . ` 2 : c#~ } } } } Z V+I.f.b+. . . . . . . ",
|
||||
" . . . . . . . . A.H.R#m.d [ } } } } ) ~ Q+6 i.( . . . . . . . . . . . . . . . . . . . . . . . . L.M.$$7 Z } } } } [ ~ O+g / . . . . . . . ",
|
||||
" . . . . . . . . u@z.R#E.d [ } } } } ! ! -.J %$( . . . . . . . . . . . . . . . . . . . . . h@P+:@! [ } } } } Z 0.-+|.i . . . . . . ",
|
||||
" . . . . . . . . G &$R#| ~ [ } } } } [ ~ Y.$$%$!.. . . . . . . . . . . . . . . . . !.;@k.m ! } } } } ~ m *$#+j . . . . . . . ",
|
||||
" . . . . . . . . G z.] 7 ~ [ } } } } [ ~ 1@=$i.!.. . . . . . . . . . . . . 4 |.A 2.~ } } } } [ ! -$1#n+. . . . . . . ",
|
||||
" . . . . . . . . o.&$I.{ ~ [ } } } } [ P ;+`.%$c+. . . . . . . . . . / @+,.~ [ } } } } ~ { J 6#(.. . . . . . ",
|
||||
" . . . . . . . . o.U+ @;$~ [ } } } } [ d ;+H+Y@` . . . . . . $ %$>$e ~ } } } } ~ < |+^ n#. . . . . . . ",
|
||||
" . . . . . . . . # a@[+0.d [ } } } } [ d ;+,$4@B.. . 4 =+$.-.d [ } } } [ Z =.S {+. . . . . . . ",
|
||||
" . . . . . . . . P.'$X 0.d [ } } } } [ Z ;+/@R.!@H )$c ) } } } } d m.!$)+h.. . . . . . . ",
|
||||
" . . . . . . . . ` 8@M+;+d [ } } } } [ Z 1@7.7 ~ } } } } ! [ I w.# . . . . . . . ",
|
||||
" . . . . . . . . c+f.$$;+P [ } } } } [ ~ [ } } } c P v $.r 4 . . . . . . ",
|
||||
" . . . . . . . . ( i.=$ +~ [ } } } } } } } ~ ].~$i. .. . . . . . . ",
|
||||
" . . . . . . . . !.i.q+Y.~ [ } } } [ [ 4+T#/ . . . . . . . ",
|
||||
" . . . . . . . . !.i.{$-.! ~ ~ ]$Z+5+4 . . . . . . . ",
|
||||
" . . . . . . . . ( % 6 B A@a@( . . . . . . . ",
|
||||
" . . . . . . . . ^$K &.. . . . . . . ",
|
||||
" . . . . . . . . . . . . . . . ",
|
||||
" . . . . . . . . . . . ",
|
||||
" . . . . . . . ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" "};
|
||||
|
Before Width: | Height: | Size: 827 B After Width: | Height: | Size: 1006 B |
@@ -1,181 +1,159 @@
|
||||
/* XPM */
|
||||
static char *bitcoin__[] = {
|
||||
/* columns rows colors chars-per-pixel */
|
||||
"16 16 159 2",
|
||||
" c #CA7C1E",
|
||||
". c #CB7D1E",
|
||||
"X c #D1811E",
|
||||
"o c #D0801F",
|
||||
"O c #D1801F",
|
||||
"+ c #D3821F",
|
||||
"@ c #D7831F",
|
||||
"# c #EE8D18",
|
||||
"$ c #F4931F",
|
||||
"% c #D78625",
|
||||
"& c #D88520",
|
||||
"* c #D98521",
|
||||
"= c #D98620",
|
||||
"- c #D78B2D",
|
||||
"; c #DF8D2A",
|
||||
": c #DF8F2F",
|
||||
"> c #DF943B",
|
||||
", c #D8913C",
|
||||
"< c #D8923E",
|
||||
"1 c #DF953E",
|
||||
"2 c #E28B23",
|
||||
"3 c #E38B23",
|
||||
"4 c #EA9023",
|
||||
"5 c #EB9023",
|
||||
"6 c #ED9122",
|
||||
"7 c #ED9123",
|
||||
"8 c #EE9123",
|
||||
"9 c #EE9223",
|
||||
"0 c #F39421",
|
||||
"q c #F19423",
|
||||
"w c #F39523",
|
||||
"e c #F79521",
|
||||
"r c #F59422",
|
||||
"t c #F49623",
|
||||
"y c #F69622",
|
||||
"u c #F79623",
|
||||
"i c #F09324",
|
||||
"p c #F19424",
|
||||
"a c #F19525",
|
||||
"s c #F49624",
|
||||
"d c #F59625",
|
||||
"f c #F49725",
|
||||
"g c #F79624",
|
||||
"h c #F79724",
|
||||
"j c #F69725",
|
||||
"k c #F79725",
|
||||
"l c #F69726",
|
||||
"z c #F79726",
|
||||
"x c #F89621",
|
||||
"c c #F89722",
|
||||
"v c #F89723",
|
||||
"b c #F89724",
|
||||
"n c #F89824",
|
||||
"m c #F89825",
|
||||
"M c #F99825",
|
||||
"N c #F89925",
|
||||
"B c #F89926",
|
||||
"V c #F89927",
|
||||
"C c #F99927",
|
||||
"Z c #F0972E",
|
||||
"A c #F7992A",
|
||||
"S c #F79A2B",
|
||||
"D c #F79B2C",
|
||||
"F c #F69A2D",
|
||||
"G c #F79D2F",
|
||||
"H c #F89929",
|
||||
"J c #F89A28",
|
||||
"K c #F89A29",
|
||||
"L c #F99A29",
|
||||
"P c #F99B29",
|
||||
"I c #F89A2A",
|
||||
"U c #F89A2B",
|
||||
"Y c #F99B2B",
|
||||
"T c #F89B2C",
|
||||
"R c #F89C2C",
|
||||
"E c #F99C2D",
|
||||
"W c #F99C2E",
|
||||
"Q c #F89D2E",
|
||||
"! c #F99D2F",
|
||||
"~ c #E29335",
|
||||
"^ c #E49639",
|
||||
"/ c #E2983F",
|
||||
"( c #F79F35",
|
||||
") c #F99E31",
|
||||
"_ c #F89E32",
|
||||
"` c #F99E32",
|
||||
"' c #F9A033",
|
||||
"] c #F9A035",
|
||||
"[ c #F9A135",
|
||||
"{ c #F9A036",
|
||||
"} c #F9A136",
|
||||
"| c #F9A137",
|
||||
" . c #F3A03F",
|
||||
".. c #F7A43F",
|
||||
"X. c #F8A139",
|
||||
"o. c #F9A23A",
|
||||
"O. c #FAA33B",
|
||||
"+. c #FAA43E",
|
||||
"@. c #FAA43F",
|
||||
"#. c #EF9F41",
|
||||
"$. c #EEA244",
|
||||
"%. c #ECA34B",
|
||||
"&. c #F8A440",
|
||||
"*. c #F9A541",
|
||||
"=. c #F9A644",
|
||||
"-. c #F9A947",
|
||||
";. c #F0A349",
|
||||
":. c #F5A648",
|
||||
">. c #F1A74E",
|
||||
",. c #F7AA4F",
|
||||
"<. c #E4A458",
|
||||
"1. c #E4A55B",
|
||||
"2. c #E8A95E",
|
||||
"3. c #F2A950",
|
||||
"4. c #F4AA52",
|
||||
"5. c #FBAF55",
|
||||
"6. c #E4A860",
|
||||
"7. c #EAAC63",
|
||||
"8. c #EBAF68",
|
||||
"9. c #F2AF61",
|
||||
"0. c #EBB16C",
|
||||
"q. c #F6B568",
|
||||
"w. c #E3AF71",
|
||||
"e. c #EBBE89",
|
||||
"r. c #E0BC93",
|
||||
"t. c #E3C199",
|
||||
"y. c #E6C59D",
|
||||
"u. c #EAC89E",
|
||||
"i. c #E7C8A2",
|
||||
"p. c #EACBA6",
|
||||
"a. c #EBCFAF",
|
||||
"s. c #F1CCA0",
|
||||
"d. c #E7CEB1",
|
||||
"f. c #ECD1B0",
|
||||
"g. c #E5D2BB",
|
||||
"h. c #E8D2B8",
|
||||
"j. c #DFDFDF",
|
||||
"k. c #E7D5C1",
|
||||
"l. c #E7D7C4",
|
||||
"z. c #E5D7C7",
|
||||
"x. c #E7DACB",
|
||||
"c. c #EADAC8",
|
||||
"v. c #E9DCCC",
|
||||
"b. c #EDDFCE",
|
||||
"n. c #E5DDD3",
|
||||
"m. c #E4DFD9",
|
||||
"M. c #ECE0D1",
|
||||
"N. c #E4E1DD",
|
||||
"B. c #EDE3D8",
|
||||
"V. c #EAE4DD",
|
||||
"C. c #ECE5DC",
|
||||
"Z. c #E2E2E2",
|
||||
"A. c #E5E2E0",
|
||||
"S. c #E4E4E4",
|
||||
"D. c #E7E7E7",
|
||||
"F. c #EAEAE9",
|
||||
"G. c gray92",
|
||||
"H. c #EEEEEE",
|
||||
"J. c None",
|
||||
/* pixels */
|
||||
"J.J.J.J.J.J.J.1 > J.J.J.J.J.J.J.",
|
||||
"J.J.J.J.J./ ..| ' ( ~ J.J.J.J.J.",
|
||||
"J.J.J.< *.{ V $ r U W _ - J.J.J.",
|
||||
"J.J., o.J 0 # <.w.$.F N H % J.J.",
|
||||
"J.J.o.T e 1.r.k.x.t.S z B u J.J.",
|
||||
"J.^ [ Y ! #.z.H.M.n.0.d n m 2 J.",
|
||||
"J.X.) | =. .h.B.5.f.j.;.v B d J.",
|
||||
": Q M ` &.>.A.V.p.c.l.4.E n d = ",
|
||||
"; I b A Z 2.D.s.u.F.a.-.} C w & ",
|
||||
"J.l g y 6.m.G.q.3.b.Z.,.] D 8 J.",
|
||||
"J.3 k c %.d.C.v.N.S.y.@.L a * J.",
|
||||
"J.J.j z x 8.i.g.e.9.+.W t 6 J.J.",
|
||||
"J.J.+ s h G :.7.O.R B s 7 . J.J.",
|
||||
"J.J.J.O i f P L K d p 5 J.J.J.",
|
||||
"J.J.J.J.J.@ 9 q i 4 + J.J.J.J.J.",
|
||||
"J.J.J.J.J.J.J.X o J.J.J.J.J.J.J."
|
||||
};
|
||||
static char * bitcoin16_xpm[] = {
|
||||
"16 16 140 2",
|
||||
" c None",
|
||||
". c #FFFFFF",
|
||||
"+ c #FFFFFF",
|
||||
"@ c #FFFFFF",
|
||||
"# c #F8F9F9",
|
||||
"$ c #C1C7C8",
|
||||
"% c #B5BDBE",
|
||||
"& c #E9EBEB",
|
||||
"* c #FFFFFF",
|
||||
"= c #FFFFFF",
|
||||
"- c #DADEDE",
|
||||
"; c #9AA5A6",
|
||||
"> c #8A9698",
|
||||
", c #B0B8B9",
|
||||
"' c #E5E8E8",
|
||||
") c #FFFFFF",
|
||||
"! c #FFFFFF",
|
||||
"~ c #EFF1F1",
|
||||
"{ c #B1B9BA",
|
||||
"] c #869395",
|
||||
"^ c #899597",
|
||||
"/ c #ACB5B6",
|
||||
"( c #E2E5E5",
|
||||
"_ c #FFFFFF",
|
||||
": c #FFFFFF",
|
||||
"< c #FEFEFE",
|
||||
"[ c #CBD0D1",
|
||||
"} c #8F9B9C",
|
||||
"| c #8A9698",
|
||||
"1 c #B0B8B9",
|
||||
"2 c #F1F3F3",
|
||||
"3 c #E5E8E8",
|
||||
"4 c #A3ADAE",
|
||||
"5 c #E0E3E3",
|
||||
"6 c #9BA6A7",
|
||||
"7 c #F5F6F6",
|
||||
"8 c #BEC4C5",
|
||||
"9 c #98A3A4",
|
||||
"0 c #808D8F",
|
||||
"a c #808D8F",
|
||||
"b c #D7DBDB",
|
||||
"c c #E0E3E4",
|
||||
"d c #A5AEB0",
|
||||
"e c #889496",
|
||||
"f c #97A2A3",
|
||||
"g c #D8DCDC",
|
||||
"h c #F3F4F4",
|
||||
"i c #F9F9F9",
|
||||
"j c #FFFFFF",
|
||||
"k c #FFFFFF",
|
||||
"l c #DCE0E0",
|
||||
"m c #A6AFB0",
|
||||
"n c #889596",
|
||||
"o c #899697",
|
||||
"p c #BEC5C6",
|
||||
"q c #F7F8F8",
|
||||
"r c #FFFFFF",
|
||||
"s c #FFFFFF",
|
||||
"t c #FFFFFF",
|
||||
"u c #DEE2E2",
|
||||
"v c #A7B0B2",
|
||||
"w c #899597",
|
||||
"x c #899697",
|
||||
"y c #A6AFB1",
|
||||
"z c #E6E9E9",
|
||||
"A c #FFFFFF",
|
||||
"B c #FFFFFF",
|
||||
"C c #FFFFFF",
|
||||
"D c #DDE1E1",
|
||||
"E c #B0B8B9",
|
||||
"F c #CED3D4",
|
||||
"G c #FFFFFF",
|
||||
"H c #FFFFFF",
|
||||
"I c #FFFFFF",
|
||||
"J c #FFFFFF",
|
||||
"K c #8D999A",
|
||||
"L c #96A1A3",
|
||||
"M c #B5BDBE",
|
||||
"N c #F5F6F7",
|
||||
"O c #FDFEFE",
|
||||
"P c #DCE0E0",
|
||||
"Q c #9FA9AA",
|
||||
"R c #99A4A5",
|
||||
"S c #E3E6E6",
|
||||
"T c #FFFFFF",
|
||||
"U c #FEFEFE",
|
||||
"V c #E0E3E4",
|
||||
"W c #A3ADAE",
|
||||
"X c #8A9698",
|
||||
"Y c #C8CECF",
|
||||
"Z c #FBFCFC",
|
||||
"` c #FDFDFD",
|
||||
" . c #B6BEBF",
|
||||
".. c #738284",
|
||||
"+. c #9BA5A7",
|
||||
"@. c #DDE1E1",
|
||||
"#. c #FDFDFD",
|
||||
"$. c #EBEDEE",
|
||||
"%. c #A2ACAD",
|
||||
"&. c #8C9899",
|
||||
"*. c #D0D5D5",
|
||||
"=. c #8D999B",
|
||||
"-. c #CFD4D4",
|
||||
";. c #AAB3B4",
|
||||
">. c #95A0A1",
|
||||
",. c #D5DADA",
|
||||
"'. c #FCFCFC",
|
||||
"). c #F9FAFA",
|
||||
"!. c #BFC6C7",
|
||||
"~. c #879395",
|
||||
"{. c #B9C1C2",
|
||||
"]. c #B3BBBC",
|
||||
"^. c #6A797B",
|
||||
"/. c #9CA6A7",
|
||||
"(. c #E3E6E6",
|
||||
"_. c #CBD1D2",
|
||||
":. c #909B9D",
|
||||
"<. c #95A0A1",
|
||||
"[. c #D3D8D9",
|
||||
"}. c #FBFBFB",
|
||||
"|. c #DCE0E0",
|
||||
"1. c #929D9F",
|
||||
"2. c #9CA6A8",
|
||||
"3. c #DEE1E2",
|
||||
"4. c #BBC2C3",
|
||||
"5. c #ADB5B6",
|
||||
"6. c #E3E6E6",
|
||||
"7. c #CED3D4",
|
||||
"8. c #929E9F",
|
||||
"9. c #879496",
|
||||
"0. c #8B9799",
|
||||
"a. c #CBD1D1",
|
||||
"b. c #D4D9D9",
|
||||
"c. c #909C9D",
|
||||
"d. c #ABB4B5",
|
||||
"e. c #E2E5E5",
|
||||
"f. c #DCE0E0",
|
||||
"g. c #DFE2E3",
|
||||
"h. c #A7B0B1",
|
||||
"i. c #9BA6A7",
|
||||
" ",
|
||||
" ",
|
||||
" $ % ",
|
||||
" - ; K L > , ",
|
||||
" { ] M N O P Q ^ / ",
|
||||
" [ } R S T T T T U V W | 1 ",
|
||||
" 4 X Y Z T T T T T T T ` ...5 ",
|
||||
"6 +.@.#.T T T T T T T $.%.&.*.7 ",
|
||||
"=.-.;.>.,.'.T T T ).!.~.{.].^.8 ",
|
||||
"9 /.(._.:.<.[.}.|.1.2.3.4.0 a b ",
|
||||
"c d e 5.6.7.8.9.0.a.b.c.f g ",
|
||||
" m n d.e.f.g.h.o p ",
|
||||
" v w i.x y ",
|
||||
" E F ",
|
||||
" ",
|
||||
" "};
|
||||
|
Before Width: | Height: | Size: 28 KiB After Width: | Height: | Size: 19 KiB |
|
Before Width: | Height: | Size: 1.9 KiB After Width: | Height: | Size: 1.9 KiB |
@@ -1,140 +1,233 @@
|
||||
/* XPM */
|
||||
static char *bitcoin__[] = {
|
||||
/* columns rows colors chars-per-pixel */
|
||||
"32 32 102 2",
|
||||
" c #CC7D1D",
|
||||
". c #D5831F",
|
||||
"X c #D48221",
|
||||
"o c #D98621",
|
||||
"O c #DC8820",
|
||||
"+ c #DC8D2C",
|
||||
"@ c #D98F36",
|
||||
"# c #D68F39",
|
||||
"$ c #DD943E",
|
||||
"% c #E28B23",
|
||||
"& c #E98F24",
|
||||
"* c #E18F2D",
|
||||
"= c #ED9124",
|
||||
"- c #EC942A",
|
||||
"; c #F59624",
|
||||
": c #F89724",
|
||||
"> c #F79827",
|
||||
", c #F89825",
|
||||
"< c #F0962B",
|
||||
"1 c #F59A2D",
|
||||
"2 c #F99B2B",
|
||||
"3 c #EC9732",
|
||||
"4 c #EC9A37",
|
||||
"5 c #E2963B",
|
||||
"6 c #E6983A",
|
||||
"7 c #EC9C3B",
|
||||
"8 c #F69D33",
|
||||
"9 c #F99E32",
|
||||
"0 c #F49E3A",
|
||||
"q c #F9A036",
|
||||
"w c #F6A13C",
|
||||
"e c #F9A33B",
|
||||
"r c #D79341",
|
||||
"t c #DC9641",
|
||||
"y c #E39A43",
|
||||
"u c #EA9D42",
|
||||
"i c #EFA041",
|
||||
"p c #EDA34B",
|
||||
"a c #F5A443",
|
||||
"s c #F9A643",
|
||||
"d c #FAA846",
|
||||
"f c #F2A64C",
|
||||
"g c #F9AA4B",
|
||||
"h c #E5A251",
|
||||
"j c #ECA756",
|
||||
"k c #EBA758",
|
||||
"l c #FAAF57",
|
||||
"z c #FBB057",
|
||||
"x c #FBB25B",
|
||||
"c c #DFB179",
|
||||
"v c #E4AA65",
|
||||
"b c #EBAE64",
|
||||
"n c #E9AF69",
|
||||
"m c #FBB665",
|
||||
"M c #F1B46A",
|
||||
"N c #F8B96D",
|
||||
"B c #E5B071",
|
||||
"V c #EBB777",
|
||||
"C c #EEB877",
|
||||
"Z c #E7B478",
|
||||
"A c #EBB97D",
|
||||
"S c #F0B671",
|
||||
"D c #F2B871",
|
||||
"F c #EFBC80",
|
||||
"G c #E6BD8D",
|
||||
"H c #EDBF88",
|
||||
"J c #E6BF90",
|
||||
"K c #F1C187",
|
||||
"L c #F1C288",
|
||||
"P c #E5C093",
|
||||
"I c #EEC493",
|
||||
"U c #E1C19B",
|
||||
"Y c #E9C69C",
|
||||
"T c #ECC89D",
|
||||
"R c #F1C897",
|
||||
"E c #DFC5A4",
|
||||
"W c #DBCBB8",
|
||||
"Q c #E2C7A7",
|
||||
"! c #EBCBA6",
|
||||
"~ c #E6CBAB",
|
||||
"^ c #E9D2B7",
|
||||
"/ c #E5D1B9",
|
||||
"( c #EBD6BD",
|
||||
") c #EFD9BE",
|
||||
"_ c #DDD0C2",
|
||||
"` c #DCD7D2",
|
||||
"' c #DEDEDE",
|
||||
"] c #ECDAC5",
|
||||
"[ c #EDDECB",
|
||||
"{ c #E9E0D5",
|
||||
"} c #E7E0D9",
|
||||
"| c #E9E2DB",
|
||||
" . c #EFE8DF",
|
||||
".. c #E5E5E5",
|
||||
"X. c #EBE7E2",
|
||||
"o. c #EFEAE6",
|
||||
"O. c #ECECEC",
|
||||
"+. c #F2ECE6",
|
||||
"@. c #F1F0EE",
|
||||
"#. c #F4F4F4",
|
||||
"$. c #FBFBFB",
|
||||
"%. c None",
|
||||
/* pixels */
|
||||
"%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.",
|
||||
"%.%.%.%.%.%.%.%.%.%.%.%.%.%.t 5 5 $ %.%.%.%.%.%.%.%.%.%.%.%.%.%.",
|
||||
"%.%.%.%.%.%.%.%.%.%.%.r u w q 9 9 9 8 4 # %.%.%.%.%.%.%.%.%.%.%.",
|
||||
"%.%.%.%.%.%.%.%.%.y s e 9 2 , , , : > 2 9 q 5 %.%.%.%.%.%.%.%.%.",
|
||||
"%.%.%.%.%.%.%.%.s q 2 , , , , : , > 2 2 > > 2 9 %.%.%.%.%.%.%.%.",
|
||||
"%.%.%.%.%.%.t e 1 , , , , : : ; > 2 9 9 2 , , > 2 + %.%.%.%.%.%.",
|
||||
"%.%.%.%.%.$ e 2 , , , , , , ; u u 8 1 1 2 > , , > > + %.%.%.%.%.",
|
||||
"%.%.%.%.%.e 2 , , : > ; ; > < ` ` 0 c n 1 2 , , , > , %.%.%.%.%.",
|
||||
"%.%.%.%.e 1 , , , , ; h v - 3 ..! w ' _ 9 2 > , , , > : %.%.%.%.",
|
||||
"%.%.%.6 q , : , > 2 > W ..| [ #.H V ..D 9 9 2 , , , , , % %.%.%.",
|
||||
"%.%.%.e 2 , > 2 2 2 9 b ! #.$.$.#.#.#.Y i 1 2 > , , , > ; %.%.%.",
|
||||
"%.%.@ q > 2 2 2 9 q e q 0 o.$.+.) { #.#.| b 2 2 , , , , : X %.%.",
|
||||
"%.%.4 9 2 2 9 q e e s w b O.#.( m x I @.$...f > > , , , : & %.%.",
|
||||
"%.%.8 > 2 2 9 e s d g a P #.#.L x l a [ $.#.A 2 2 , : , , ; %.%.",
|
||||
"%.+ 1 , , 2 2 q e d g f / $.#.T n k Z o.$.O.M 9 2 > , , , ; X %.",
|
||||
"%.* 2 , , , 2 9 q e s f X.$.#.O.O.O.#.$.+.Y g e 9 2 , , , ; o %.",
|
||||
"%.* 2 , , , 2 2 q e w n O.$.[ R ( O.$.$.[ d s e 9 2 2 , , ; o %.",
|
||||
"%.+ 2 , , , > 2 8 8 1 G #.#.T m m N ] #.#.~ s e e 9 2 > : ; X %.",
|
||||
"%.%.> , , , , 2 < v B [ $.O.m z z s b #.$...g e e q 9 2 ; = %.%.",
|
||||
"%.%.= : , , , : 7 ' O.#.$.@.C j p u ~ #.$.} g q 9 9 2 2 ; % %.%.",
|
||||
"%.%.o , , , , : 0 G ^ .$.#.O.X.{ X.#.$.#.Y e 9 2 2 > , ; %.%.",
|
||||
"%.%.%., : , , , 2 2 2 M O.) ] #.#.#.#.O./ d 9 2 > , , ; = %.%.%.",
|
||||
"%.%.%.& ; , , , , 2 ; Q ..g F O.K A H S s 9 2 > , : , ; o %.%.%.",
|
||||
"%.%.%.%.; ; , , , , 2 E _ d ' ..d q q 9 2 > , : , , ; = %.%.%.%.",
|
||||
"%.%.%.%.%.; : , , , 2 q d g U J e 2 2 > , , , , , ; = %.%.%.%.%.",
|
||||
"%.%.%.%.%.o ; : , , , 2 9 q 9 q 9 > , : , , , , ; = . %.%.%.%.%.",
|
||||
"%.%.%.%.%.%.. ; ; , , > 2 2 2 > , , , , , , , ; = %.%.%.%.%.%.",
|
||||
"%.%.%.%.%.%.%.%.= ; : > 2 2 , , : , , , , ; ; & %.%.%.%.%.%.%.%.",
|
||||
"%.%.%.%.%.%.%.%.%.. = ; > : , , , , ; ; = = X %.%.%.%.%.%.%.%.%.",
|
||||
"%.%.%.%.%.%.%.%.%.%.%. % = ; ; ; ; & O %.%.%.%.%.%.%.%.%.%.%.",
|
||||
"%.%.%.%.%.%.%.%.%.%.%.%.%.%. X X %.%.%.%.%.%.%.%.%.%.%.%.%.%.",
|
||||
"%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%.%."
|
||||
};
|
||||
static char * bitcoin32_xpm[] = {
|
||||
"32 32 198 2",
|
||||
" c None",
|
||||
". c #FDFDFD",
|
||||
"+ c #FCFCFC",
|
||||
"@ c #FFFFFF",
|
||||
"# c #EDEFEF",
|
||||
"$ c #9DA7A8",
|
||||
"% c #839092",
|
||||
"& c #CFD4D4",
|
||||
"* c #FAFAFA",
|
||||
"= c #C2C9CA",
|
||||
"- c #5E6F71",
|
||||
"; c #43575A",
|
||||
"> c #526467",
|
||||
", c #405457",
|
||||
"' c #788688",
|
||||
") c #CAD0D0",
|
||||
"! c #F7F8F8",
|
||||
"~ c #E0E3E4",
|
||||
"{ c #828F91",
|
||||
"] c #3E5255",
|
||||
"^ c #707F81",
|
||||
"/ c #D4D8D9",
|
||||
"( c #EFF0F1",
|
||||
"_ c #B2BABB",
|
||||
": c #5F7072",
|
||||
"< c #3F5356",
|
||||
"[ c #728082",
|
||||
"} c #C5CBCC",
|
||||
"| c #F6F7F7",
|
||||
"1 c #F3F4F4",
|
||||
"2 c #ABB4B5",
|
||||
"3 c #4C5F61",
|
||||
"4 c #4F6264",
|
||||
"5 c #B0B8BA",
|
||||
"6 c #B8BFC0",
|
||||
"7 c #647477",
|
||||
"8 c #6C7C7E",
|
||||
"9 c #BFC6C7",
|
||||
"0 c #F4F5F5",
|
||||
"a c #6A7A7C",
|
||||
"b c #3F5355",
|
||||
"c c #889596",
|
||||
"d c #E4E7E7",
|
||||
"e c #F5F6F6",
|
||||
"f c #BEC5C6",
|
||||
"g c #6B7A7C",
|
||||
"h c #667678",
|
||||
"i c #B9C1C2",
|
||||
"j c #F2F3F3",
|
||||
"k c #E8EBEB",
|
||||
"l c #929E9F",
|
||||
"m c #415558",
|
||||
"n c #627275",
|
||||
"o c #C7CDCE",
|
||||
"p c #C4CACB",
|
||||
"q c #617274",
|
||||
"r c #B4BCBD",
|
||||
"s c #EFF1F1",
|
||||
"t c #B9C0C1",
|
||||
"u c #56686A",
|
||||
"v c #475A5D",
|
||||
"w c #A1ABAD",
|
||||
"x c #F1F2F2",
|
||||
"y c #F9F9F9",
|
||||
"z c #CACFD0",
|
||||
"A c #778587",
|
||||
"B c #5D6E70",
|
||||
"C c #B6BEBF",
|
||||
"D c #FBFCFC",
|
||||
"E c #FEFEFE",
|
||||
"F c #DADDDE",
|
||||
"G c #798789",
|
||||
"H c #3D5154",
|
||||
"I c #788788",
|
||||
"J c #DBDEDF",
|
||||
"K c #CFD4D5",
|
||||
"L c #596A6D",
|
||||
"M c #536568",
|
||||
"N c #A1ABAC",
|
||||
"O c #BAC1C2",
|
||||
"P c #EEF0F0",
|
||||
"Q c #435659",
|
||||
"R c #738284",
|
||||
"S c #EBEDED",
|
||||
"T c #6D7D7F",
|
||||
"U c #415557",
|
||||
"V c #929D9F",
|
||||
"W c #FAFBFB",
|
||||
"X c #C0C7C8",
|
||||
"Y c #5C6D6F",
|
||||
"Z c #44575A",
|
||||
"` c #98A3A5",
|
||||
" . c #D8DCDD",
|
||||
".. c #A9B2B4",
|
||||
"+. c #E3E6E6",
|
||||
"@. c #EBEDEE",
|
||||
"#. c #DEE2E2",
|
||||
"$. c #7F8C8E",
|
||||
"%. c #738183",
|
||||
"&. c #D8DCDC",
|
||||
"*. c #FCFDFD",
|
||||
"=. c #FDFEFE",
|
||||
"-. c #D9DDDE",
|
||||
";. c #45595B",
|
||||
">. c #BFC5C6",
|
||||
",. c #98A3A4",
|
||||
"'. c #A8B1B2",
|
||||
"). c #ECEEEE",
|
||||
"!. c #F2F3F4",
|
||||
"~. c #A6AFB1",
|
||||
"{. c #4A5D5F",
|
||||
"]. c #526466",
|
||||
"^. c #EAEDED",
|
||||
"/. c #AFB7B8",
|
||||
"(. c #939EA0",
|
||||
"_. c #818E90",
|
||||
":. c #939FA0",
|
||||
"<. c #DDE0E1",
|
||||
"[. c #808D8F",
|
||||
"}. c #A4AEAF",
|
||||
"|. c #657577",
|
||||
"1. c #8D999A",
|
||||
"2. c #E7E9E9",
|
||||
"3. c #6B7A7D",
|
||||
"4. c #273D40",
|
||||
"5. c #283F42",
|
||||
"6. c #97A1A3",
|
||||
"7. c #425659",
|
||||
"8. c #D5DADA",
|
||||
"9. c #A2ACAD",
|
||||
"0. c #E9EBEB",
|
||||
"a. c #E5E8E8",
|
||||
"b. c #8B9798",
|
||||
"c. c #677779",
|
||||
"d. c #CCD1D2",
|
||||
"e. c #EAECED",
|
||||
"f. c #94A0A1",
|
||||
"g. c #34494C",
|
||||
"h. c #475B5D",
|
||||
"i. c #435759",
|
||||
"j. c #899697",
|
||||
"k. c #DADEDF",
|
||||
"l. c #879495",
|
||||
"m. c #44585A",
|
||||
"n. c #506265",
|
||||
"o. c #9EA8AA",
|
||||
"p. c #E7EAEA",
|
||||
"q. c #B1B9BA",
|
||||
"r. c #506365",
|
||||
"s. c #4B5E60",
|
||||
"t. c #57686B",
|
||||
"u. c #A0AAAB",
|
||||
"v. c #9CA6A8",
|
||||
"w. c #516366",
|
||||
"x. c #D9DDDD",
|
||||
"y. c #8A9698",
|
||||
"z. c #46595C",
|
||||
"A. c #4E6163",
|
||||
"B. c #9DA7A9",
|
||||
"C. c #C6CCCD",
|
||||
"D. c #717F81",
|
||||
"E. c #808E8F",
|
||||
"F. c #E0E3E3",
|
||||
"G. c #DADEDE",
|
||||
"H. c #D7DCDC",
|
||||
"I. c #FBFBFB",
|
||||
"J. c #E8EAEA",
|
||||
"K. c #A4ADAF",
|
||||
"L. c #536567",
|
||||
"M. c #859294",
|
||||
"N. c #D7DBDC",
|
||||
"O. c #DDE1E1",
|
||||
"P. c #8E9A9C",
|
||||
"Q. c #485B5E",
|
||||
"R. c #384D50",
|
||||
"S. c #C2C8C9",
|
||||
"T. c #E9EBEC",
|
||||
"U. c #A5AFB0",
|
||||
"V. c #546668",
|
||||
"W. c #D6DADB",
|
||||
"X. c #DEE1E2",
|
||||
"Y. c #B7BFC0",
|
||||
"Z. c #A9B2B3",
|
||||
"`. c #425658",
|
||||
" + c #E1E4E4",
|
||||
".+ c #6E7D7F",
|
||||
"++ c #D1D5D6",
|
||||
"@+ c #AAB3B4",
|
||||
"#+ c #57696B",
|
||||
"$+ c #7F8D8E",
|
||||
"%+ c #D3D8D8",
|
||||
"&+ c #F0F2F2",
|
||||
"*+ c #AFB8B9",
|
||||
"=+ c #ACB5B6",
|
||||
"-+ c #596B6D",
|
||||
";+ c #ADB5B7",
|
||||
">+ c #7B898B",
|
||||
",+ c #C8CDCE",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" . + ",
|
||||
" @ # $ % & * ",
|
||||
" * = - ; > , ' ) ! ",
|
||||
" @ ~ { ] ^ / ( _ : < [ } | ",
|
||||
" 1 2 3 4 5 | @ @ @ 1 6 7 ] 8 9 0 @ ",
|
||||
" . & a b c d @ @ @ @ @ @ @ e f g ] h i j @ ",
|
||||
" @ k l m n o + @ @ @ @ @ @ @ @ @ @ ! p ^ < q r s @ ",
|
||||
" ! t u v w x @ @ @ @ @ @ @ @ @ @ @ @ @ @ y z A , B C D ",
|
||||
" E F G H I J @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ + K L M s ",
|
||||
"@ s N v u O y @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ P $ Q R e ",
|
||||
"S T U V S @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ W X Y Z ` # @ ",
|
||||
" .m ..@ +.@.@ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ #.$.] %.&.@ @ *.=.",
|
||||
"-.;.>.@ ,.M '.).@ @ @ @ @ @ @ @ @ @ @ @ @ !.~.{.].r ^./.(._.:.0 ",
|
||||
"-.;.>.@ <.[.m M }.^.@ @ @ @ @ @ @ @ @ *.) |., 1.2.@ e 3.4.5.6.@ ",
|
||||
" .7./.@ @ + 8.% 7.].9.0.@ @ @ @ @ @ a.b.< c.d.. @ e.f.Q g.h.#. ",
|
||||
"a.- i.j.k.. @ *.&.l.m.n.o.p.@ @ | q.r.s.'.1 @ y O t.;.u._ v.=. ",
|
||||
"@ p.N w.m.c x.. @ . k.y.z.A.B.C.D.] E.F.@ E G.' H A H.E I.| ",
|
||||
" @ J.K.L.; M.N.*.@ . O.P.Q.R.- S.W @ s o.z.u t ! ",
|
||||
" @ T.U.V.Q % W.+ @ E X.Y.# @ I.p : m (.k @ ",
|
||||
" @ e.Z.u `._./ + @ @ @ +{ ] .+++. ",
|
||||
" @ ).@+#+m $+%+&+@+3 4 *+0 ",
|
||||
" @ ).=+-+7.M , j.+.@ ",
|
||||
" @ # ;+>+,+D ",
|
||||
" E D ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" "};
|
||||
|
Before Width: | Height: | Size: 4.5 KiB After Width: | Height: | Size: 4.2 KiB |
@@ -1,242 +1,406 @@
|
||||
/* XPM */
|
||||
static char *bitcoin__[] = {
|
||||
/* columns rows colors chars-per-pixel */
|
||||
"64 64 172 2",
|
||||
" c #8F6319",
|
||||
". c #8F6A1A",
|
||||
"X c #90651A",
|
||||
"o c #916C1A",
|
||||
"O c #AF7C1E",
|
||||
"+ c #B1781E",
|
||||
"@ c #9A7026",
|
||||
"# c #AC801F",
|
||||
"$ c #B1811F",
|
||||
"% c #A9812B",
|
||||
"& c #B08320",
|
||||
"* c #BB8621",
|
||||
"= c #BD8E22",
|
||||
"- c #A58132",
|
||||
"; c #FC8400",
|
||||
": c #FD8A03",
|
||||
"> c #FD8E0C",
|
||||
", c #FF910E",
|
||||
"< c #F98F14",
|
||||
"1 c #F79117",
|
||||
"2 c #FD9314",
|
||||
"3 c #FC951B",
|
||||
"4 c #FE9A1D",
|
||||
"5 c #CA8E22",
|
||||
"6 c #CC8E2A",
|
||||
"7 c #D48D23",
|
||||
"8 c #C39223",
|
||||
"9 c #CE9925",
|
||||
"0 c #D19C25",
|
||||
"q c #D19329",
|
||||
"w c #D5992B",
|
||||
"e c #DD9D33",
|
||||
"r c #D69F3C",
|
||||
"t c #E29425",
|
||||
"y c #E79925",
|
||||
"u c #EA9926",
|
||||
"i c #E69A2C",
|
||||
"p c #F79625",
|
||||
"a c #F99524",
|
||||
"s c #F79825",
|
||||
"d c #F89825",
|
||||
"f c #F3962A",
|
||||
"g c #F69B2C",
|
||||
"h c #F89B2B",
|
||||
"j c #E19F30",
|
||||
"k c #EE9B34",
|
||||
"l c #F49D33",
|
||||
"z c #F99E32",
|
||||
"x c #F39F3B",
|
||||
"c c #DFA731",
|
||||
"v c #D7A43D",
|
||||
"b c #DCA63C",
|
||||
"n c #EEA328",
|
||||
"m c #FFA225",
|
||||
"M c #FFAB26",
|
||||
"N c #F3A529",
|
||||
"B c #FEA429",
|
||||
"V c #F4AB2A",
|
||||
"C c #FFAC2A",
|
||||
"Z c #FFB325",
|
||||
"A c #FFB42C",
|
||||
"S c #FFBB2D",
|
||||
"D c #E3A335",
|
||||
"F c #E5A438",
|
||||
"G c #EDA03D",
|
||||
"H c #F7A037",
|
||||
"J c #FAA135",
|
||||
"K c #F3AB31",
|
||||
"L c #FEAB31",
|
||||
"P c #F4A13C",
|
||||
"I c #F9A33B",
|
||||
"U c #FDB432",
|
||||
"Y c #FFBF37",
|
||||
"T c #FFC12F",
|
||||
"R c #FFC230",
|
||||
"E c #FFC03E",
|
||||
"W c #DFAF41",
|
||||
"Q c #ECA34D",
|
||||
"! c #EDA84E",
|
||||
"~ c #F2A343",
|
||||
"^ c #FAA642",
|
||||
"/ c #FAA846",
|
||||
"( c #F1A74C",
|
||||
") c #F6A94F",
|
||||
"_ c #FAAA4A",
|
||||
"` c #E7A451",
|
||||
"' c #ECA754",
|
||||
"] c #EFAA56",
|
||||
"[ c #ECAC5B",
|
||||
"{ c #F3AA52",
|
||||
"} c #FCAE52",
|
||||
"| c #FBB056",
|
||||
" . c #FBB25C",
|
||||
".. c #E7AB61",
|
||||
"X. c #ECB067",
|
||||
"o. c #E7B36D",
|
||||
"O. c #EBB36C",
|
||||
"+. c #F2B163",
|
||||
"@. c #FCB460",
|
||||
"#. c #F0B56B",
|
||||
"$. c #E3B274",
|
||||
"%. c #EDB672",
|
||||
"&. c #EDB877",
|
||||
"*. c #E2B57C",
|
||||
"=. c #ECB97B",
|
||||
"-. c #E4BA83",
|
||||
";. c #EBBD83",
|
||||
":. c #E7BF8D",
|
||||
">. c #EBBD88",
|
||||
",. c #E9C08C",
|
||||
"<. c #E7C496",
|
||||
"1. c #EBC393",
|
||||
"2. c #EBC997",
|
||||
"3. c #E7C49A",
|
||||
"4. c #E9C69A",
|
||||
"5. c #E3CA9D",
|
||||
"6. c #E9C89E",
|
||||
"7. c #DCC9AE",
|
||||
"8. c #DDCBB2",
|
||||
"9. c #E3C7A2",
|
||||
"0. c #E5CAA3",
|
||||
"q. c #E9CBA3",
|
||||
"w. c #E5CEAB",
|
||||
"e. c #E8CEAA",
|
||||
"r. c #E4D4AC",
|
||||
"t. c #EBD2AF",
|
||||
"y. c #E7CFB2",
|
||||
"u. c #E1D4B4",
|
||||
"i. c #E8D5B6",
|
||||
"p. c #E5D7BB",
|
||||
"a. c #E9D6BB",
|
||||
"s. c #E5D8B9",
|
||||
"d. c #EAD8BE",
|
||||
"f. c #F0D6B4",
|
||||
"g. c #DFDFC6",
|
||||
"h. c #E3D6C1",
|
||||
"j. c #E9D7C0",
|
||||
"k. c #E6DAC5",
|
||||
"l. c #EBDCC7",
|
||||
"z. c #E5DCCA",
|
||||
"x. c #EADEC9",
|
||||
"c. c #E8DFD0",
|
||||
"v. c #D7E2D9",
|
||||
"b. c #E3E0C9",
|
||||
"n. c #EEE2CB",
|
||||
"m. c #E6E1D4",
|
||||
"M. c #E9E2D3",
|
||||
"N. c #E4E4DC",
|
||||
"B. c #E9E5DE",
|
||||
"V. c #F4EDDE",
|
||||
"C. c #DFE8E6",
|
||||
"Z. c #DEEEE8",
|
||||
"A. c #DFF2F3",
|
||||
"S. c #DDFFFF",
|
||||
"D. c #E1E6E0",
|
||||
"F. c #E8E6E2",
|
||||
"G. c #E8E9E5",
|
||||
"H. c #E5EFEC",
|
||||
"J. c #E8E9EA",
|
||||
"K. c #EAF3EE",
|
||||
"L. c #F3F3EB",
|
||||
"P. c #E7EDF2",
|
||||
"I. c #E8EEF3",
|
||||
"U. c #E7F4F7",
|
||||
"Y. c #E9F0F7",
|
||||
"T. c #EBF5FD",
|
||||
"R. c #E4FEFF",
|
||||
"E. c #ECFCFF",
|
||||
"W. c #F4F5F4",
|
||||
"Q. c #F4FFFF",
|
||||
"!. c #FEFFFF",
|
||||
"~. c None",
|
||||
/* pixels */
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.F L h C C A A A A C C h L e ~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.D N C m d d a a p a a p a a d m m C N j ~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.- K M m a p s d d d d d d d d d d d d s p d m M V % ~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.Y M d a d d d d d d d d d d d d d d d d h h d s a d M U ~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.E m 4 a d d d d d d d d d d d d d d d d d d h h h d d d a d M U ~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.C 4 a d d d d d d d d d d d d d d d d d h h h h h h d d d d d a m C ~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.~.W S a p d d d d d d d d d d d d d d d d h h h h g g h h h d d d d d p a S c ~.~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.v M a s d d d d d d d d d d d d d d d h h h h h g z z g h h d d d d d d s a C w ~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.r Z a d d d d d d d d d d d d d d d g 4 : 2 h z z z z z h h h h d d d d d d d a S q ~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.b Z a d d d d d d d d d d d d d d h h 4 x $.l a z H h h H z h h h d d d d d d d d a A w ~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.T a s d d d d d d d d d d d d h h h g : $.R.T.7.a B x f > a H h h d d d d d d d d s a R ~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.U a s d d d d d d d d d d d d h h h h z : e.!.!.p.2 3 8.D.5.' a h h h d d d d d d d d p d A ~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.U M p d d d d d d d d d d h h 1 : : 2 h h p B.!.Q.%., l J.!.R.-.> z h h h d d d d d d d d p C N ~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.S a d d d d d d d d d d h d 3 7.r.O.G p ; k E.!.T.( , [ E.!.T.~ 4 z h h h d d d d d d d d d a S ~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.V d s d d d d d d d d h h h 2 l E.!.Q.T.m.:.q.!.!.l.: : -.Q.!.c.a z z z g h h d d d d d d d d s m A ~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.@ S a d d d d d d d h h h h z : *.R.!.!.!.!.Q.!.!.!.V.,.Q d.!.Q.1.2 I z z h h h d d d d d d d d d a S X ~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.U d s d d d d d h h h h h g z a [ 5.M.Q.!.!.!.!.!.!.!.Q.E.!.!.Q.&.; 3 J H z h h h d d d d d d d d s h C ~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.S a d d d d h h h h h h z z z I d > < %.W.!.!.!.!.!.!.!.!.!.!.!.W.s.[ > 4 H g h h d d d d d d d d d a S ~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.i M p d d d h h h h g z z z z J H I I J > x.!.!.!.!.Q.T.E.Q.!.!.!.!.!.E.u.f 2 H h h h d d d d d d d d p C 7 ~.~.~.~.~.",
|
||||
"~.~.~.~.~.C a d h h h h h g g z z z J J I I I I J P J.!.!.!.!.d.P =.e.G.E.!.!.!.!.Q.Z.f 2 z h h d d d d d d d d d d A ~.~.~.~.~.",
|
||||
"~.~.~.~.~.A a h h h h h g z z z J H I I I I ^ / d X.E.!.!.!.Q.1.4 I J I ;.U.!.!.!.!.!.N.1 h g h h d d d d d d d d a S ~.~.~.~.~.",
|
||||
"~.~.~.~.6 C p d h h h z z J J J I I I I ^ ^ ^ _ a 3.Q.!.!.!.E.#.I . ._ 3 ] K.!.!.!.!.E.O., z h h h d d d d d d d p A + ~.~.~.~.",
|
||||
"~.~.~.~.i B d d h h h g z J I I I I ^ ^ ^ / / _ h k.!.!.!.!.J.) } . .| .3 6.Q.!.!.!.Q.q.> z g h h d d d d d d d d B t ~.~.~.~.",
|
||||
"~.~.~.~.B d d d d h h h z z J I I ^ / / / _ _ ^ ( I.!.!.!.Q.d.I . . .| .d 1.Q.!.!.!.Q.q.2 z h h h d d d d d d d d d B ~.~.~.~.",
|
||||
"~.~.~.~.C a d d d d h h g z J H I ^ ^ / _ _ } J %.E.!.!.!.Q.;.4 _ } | } J f m.!.!.!.!.Q.;.2 J z g h h d d d d d d d a A ~.~.~.~.",
|
||||
"~.~.~.~.C a d d d d h h h z z J I I ^ ^ / _ } z 6.Q.!.!.!.!.n.<.&.+.{ ) ] h.Q.!.!.!.!.R.~ d H z z h h h d d d d d d a A ~.~.~.~.",
|
||||
"~.~.~.~.A a d d d d d h h g z z H I I ^ / _ _ z k.!.!.!.!.!.!.Q.E.I.F.F.T.Q.!.!.!.!.E.9.2 I J z z h h h d d d d d d d A ~.~.~.~.",
|
||||
"~.~.~.~.S a d d d d d h h h z z J I I ^ ^ / I ( P.!.!.!.!.Q.Q.!.!.!.!.!.!.!.!.!.!.E.w.d J I I J z h h h d d d d d d d A ~.~.~.~.",
|
||||
"~.~.~.~.A a d d d d d d h h h z J J I I ^ / h O.E.!.!.!.Q.f.1.z.Y.E.!.!.!.!.!.!.L.! , ^ / I I H z z h h h d d d d d d A ~.~.~.~.",
|
||||
"~.~.~.~.S p d d d d d d h h h z z J I I ^ / d <.Q.!.!.!.E.+.d _ +.>.k.E.!.!.!.!.Q.s.P J _ ^ I I J z z h h h d d d d d A ~.~.~.~.",
|
||||
"~.~.~.~.C a d d d d d d d h h g z z H I I ^ d k.!.!.!.!.J.{ | @.} I I O.H.!.!.!.!.Q.C.l I ^ I I H J z g h h d d d d a A ~.~.~.~.",
|
||||
"~.~.~.~.B a d d d d d d d h h h h z z J I J x P.!.!.!.Q.j.I . . . . .B { K.!.!.!.!.Q.0.a / ^ I I J z z h h h d d d a A ~.~.~.~.",
|
||||
"~.~.~.~.B d d d d d d d d d h h h J h f 2 ; [ E.!.!.!.Q.1.I . . .| | .d 4.Q.!.!.!.!.m.z I ^ I I I J z h h h h d d d B ~.~.~.~.",
|
||||
"~.~.~.~.u B d d d d d d d d h h z , ' v.q.X.M.!.!.!.!.E.#.^ . .| } } } d >.Q.!.!.!.!.F.x J I I I J J z z h h h d d C t ~.~.~.~.",
|
||||
"~.~.~.~.7 C p d d d d d d d d h h : y.Q.Q.Q.!.!.!.!.!.B.d B / _ } } } J 1 k.!.!.!.!.!.c.s J I H J J z z z h h h h s A + ~.~.~.~.",
|
||||
"~.~.~.~.~.A a d d d d d d d d h > ` R.!.!.!.!.!.!.!.!.L.q.=.[ ~ z h h l 0.Q.!.!.!.!.Q.q.2 I J J z z h h h h h h h a S ~.~.~.~.~.",
|
||||
"~.~.~.~.~.C d d d d d d d d d d > ..g.Y.E.Q.!.!.!.!.!.!.Q.E.T.B.k.a.d.P.Q.!.!.!.!.!.E.[ 2 J z z z g h h h h d d d d C ~.~.~.~.~.",
|
||||
"~.~.~.~.~.y C p d d d d d d d d g 3 > l [ <.x.W.!.!.!.!.!.!.!.!.!.!.!.!.!.!.!.!.!.Q.z.> z z z h h h h h d d d d p C 7 ~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.S a d d d d d d d d d h h 3 , > ; =.Q.!.W.T.Q.!.!.!.!.!.!.!.!.!.!.!.Q.A.g 2 z h h h h h h d d d d d a S ~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.C h s d d d d d d d d d h g z H : <.!.!.t.l &.V.!.!.Q.Q.Q.Q.!.Q.Q.E.b.l > H h h h h h d d d d d d s m C ~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.X S a d d d d d d d d d h h h h p N.!.Q.=.: < c.!.Q.2.&.e.a.d.i.6.[ < 2 z h h h h d d d d d d d d a S ~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.A h s d d d d d d d d d h g 2 ~ E.!.E.{ 2 [ E.!.T.l : 2 1 3 2 > > h z h h h h d d d d d d d d s m A ~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.S a d d d d d d d d d h h : -.R.!.B.h 2 =.Q.!.M.p z z z h h z g h h h d d d d d d d d d d d a S ~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.N C p d d d d d d d d d h 3 ' 2.N.9.2 3 z.!.!.q.> J z h h h h h h d d d d d d d d d d d d p C n ~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.S h p d d d d d d d d d z 3 : p l J g 8.T.S.O.> z h h h h h d d d d d d d d d d d d d p h S ~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.S a s d d d d d d d d h h z d h I J a P o.P d g h h h d d d d d d d d d d d d d d s a S ~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.* S a s d d d d d d d d h h g z J J h 3 > d z h h h d d d d d d d d d d d d d d s a S * ~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.$ T a s d d d d d d d h h h z z z h g g h h d d d d d d d d d d d d d d d d s a T O ~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.& S a p d d d d d d h h h z g h h h h h d d d d d d d d d d d d d d d d p a S # ~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.~.8 S d p d d d d d d h h g h h h h d d d d d d d d d d d d d d d d d p h S = ~.~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.S A a s d d d d h h h h h d d d d d d d d d d d d d d d d d s a A S ~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.0 T m p d d d d h h h d d d d d d d d d d d d d d d d d p B S 9 ~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.V S m a p d h d d d d d d d d d d d d d d d d p a m S V ~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.o V S C d p p d d d d d d d d d d d d p p d C S N . ~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.5 C S A B d d a a d d a a a d B A S C 5 ~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.O t B A A A A A A A A B t O ~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.",
|
||||
"~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~.~."
|
||||
};
|
||||
static char * bitcoin64_xpm[] = {
|
||||
"64 64 339 2",
|
||||
" c None",
|
||||
". c #FFFFFF",
|
||||
"+ c #FAFAFA",
|
||||
"@ c #BFC6C7",
|
||||
"# c #9EA8A9",
|
||||
"$ c #DEE1E2",
|
||||
"% c #FDFEFE",
|
||||
"& c #DFE3E3",
|
||||
"* c #828F91",
|
||||
"= c #384D50",
|
||||
"- c #2C4245",
|
||||
"; c #485B5E",
|
||||
"> c #8F9B9D",
|
||||
", c #DCDFE0",
|
||||
"' c #FDFDFD",
|
||||
") c #F3F4F5",
|
||||
"! c #ABB4B5",
|
||||
"~ c #4D6062",
|
||||
"{ c #2B4144",
|
||||
"] c #2A4043",
|
||||
"^ c #2A4144",
|
||||
"/ c #294043",
|
||||
"( c #45585B",
|
||||
"_ c #8B9799",
|
||||
": c #D8DCDC",
|
||||
"< c #FCFCFC",
|
||||
"[ c #FCFDFD",
|
||||
"} c #CDD2D3",
|
||||
"| c #6C7C7E",
|
||||
"1 c #314649",
|
||||
"2 c #2D4346",
|
||||
"3 c #5B6C6F",
|
||||
"4 c #526467",
|
||||
"5 c #2E4447",
|
||||
"6 c #293F42",
|
||||
"7 c #425558",
|
||||
"8 c #849192",
|
||||
"9 c #D2D6D7",
|
||||
"0 c #FAFBFB",
|
||||
"a c #E8EAEA",
|
||||
"b c #919D9E",
|
||||
"c c #3F5356",
|
||||
"d c #415557",
|
||||
"e c #95A0A2",
|
||||
"f c #E9ECEC",
|
||||
"g c #E7E9EA",
|
||||
"h c #A3ADAE",
|
||||
"i c #56686A",
|
||||
"j c #2F4548",
|
||||
"k c #3E5355",
|
||||
"l c #7D8A8C",
|
||||
"m c #CCD1D2",
|
||||
"n c #F9FAFA",
|
||||
"o c #F8F9F9",
|
||||
"p c #B8BFC0",
|
||||
"q c #57696B",
|
||||
"r c #31474A",
|
||||
"s c #6F7E80",
|
||||
"t c #D0D5D6",
|
||||
"u c #EBEDEE",
|
||||
"v c #5B6D6F",
|
||||
"w c #304649",
|
||||
"x c #3B5053",
|
||||
"y c #778688",
|
||||
"z c #C9CECF",
|
||||
"A c #FEFEFE",
|
||||
"B c #D9DDDE",
|
||||
"C c #7A888A",
|
||||
"D c #354A4D",
|
||||
"E c #4F6164",
|
||||
"F c #ADB5B6",
|
||||
"G c #F4F5F6",
|
||||
"H c #EFF0F1",
|
||||
"I c #AFB7B9",
|
||||
"J c #5F7072",
|
||||
"K c #32484B",
|
||||
"L c #394E50",
|
||||
"M c #728183",
|
||||
"N c #C3CACA",
|
||||
"O c #F6F7F7",
|
||||
"P c #EFF1F1",
|
||||
"Q c #A1ABAC",
|
||||
"R c #475A5D",
|
||||
"S c #3A4E51",
|
||||
"T c #859294",
|
||||
"U c #E1E4E4",
|
||||
"V c #F0F2F2",
|
||||
"W c #B5BCBE",
|
||||
"X c #657577",
|
||||
"Y c #34494C",
|
||||
"Z c #364B4E",
|
||||
"` c #6D7C7E",
|
||||
" . c #BDC4C5",
|
||||
".. c #FBFBFB",
|
||||
"+. c #C4CACB",
|
||||
"@. c #637476",
|
||||
"#. c #627275",
|
||||
"$. c #C3C9CA",
|
||||
"%. c #F3F4F4",
|
||||
"&. c #BBC3C4",
|
||||
"*. c #6C7B7D",
|
||||
"=. c #344A4D",
|
||||
"-. c #667679",
|
||||
";. c #B6BEBF",
|
||||
">. c #F1F2F3",
|
||||
",. c #E3E6E6",
|
||||
"'. c #889496",
|
||||
"). c #3B4F52",
|
||||
"!. c #46595C",
|
||||
"~. c #9FA9AA",
|
||||
"{. c #EFF0F0",
|
||||
"]. c #718082",
|
||||
"^. c #33484B",
|
||||
"/. c #617174",
|
||||
"(. c #B1B9BA",
|
||||
"_. c #F5F6F6",
|
||||
":. c #B0B8B9",
|
||||
"<. c #516365",
|
||||
"[. c #2B4245",
|
||||
"}. c #778587",
|
||||
"|. c #D7DBDC",
|
||||
"1. c #C7CDCD",
|
||||
"2. c #768486",
|
||||
"3. c #293F43",
|
||||
"4. c #5C6D70",
|
||||
"5. c #ACB5B6",
|
||||
"6. c #ECEEEE",
|
||||
"7. c #D1D6D7",
|
||||
"8. c #B5BDBE",
|
||||
"9. c #F7F8F8",
|
||||
"0. c #F9F9FA",
|
||||
"a. c #CBD1D2",
|
||||
"b. c #58696C",
|
||||
"c. c #A6AFB0",
|
||||
"d. c #E8EBEB",
|
||||
"e. c #EAECED",
|
||||
"f. c #96A1A3",
|
||||
"g. c #425658",
|
||||
"h. c #3E5255",
|
||||
"i. c #E6E9E9",
|
||||
"j. c #839092",
|
||||
"k. c #415558",
|
||||
"l. c #536568",
|
||||
"m. c #9EA8AA",
|
||||
"n. c #E4E7E8",
|
||||
"o. c #BCC3C4",
|
||||
"p. c #6A7A7C",
|
||||
"q. c #8A9698",
|
||||
"r. c #44585B",
|
||||
"s. c #A9B2B4",
|
||||
"t. c #DDE0E1",
|
||||
"u. c #7F8D8E",
|
||||
"v. c #374C4E",
|
||||
"w. c #4B5E61",
|
||||
"x. c #A7B0B2",
|
||||
"y. c #DBDFDF",
|
||||
"z. c #8F9B9C",
|
||||
"A. c #495C5F",
|
||||
"B. c #273E41",
|
||||
"C. c #4A5D60",
|
||||
"D. c #384C4F",
|
||||
"E. c #808D8F",
|
||||
"F. c #C8CECE",
|
||||
"G. c #435759",
|
||||
"H. c #283F42",
|
||||
"I. c #667779",
|
||||
"J. c #C9CFCF",
|
||||
"K. c #68787A",
|
||||
"L. c #5E6F71",
|
||||
"M. c #BFC5C6",
|
||||
"N. c #C0C6C7",
|
||||
"O. c #283E41",
|
||||
"P. c #657578",
|
||||
"Q. c #E6E8E9",
|
||||
"R. c #8D999B",
|
||||
"S. c #3D5154",
|
||||
"T. c #435659",
|
||||
"U. c #99A4A5",
|
||||
"V. c #DEE2E2",
|
||||
"W. c #818E90",
|
||||
"X. c #FEFEFF",
|
||||
"Y. c #546668",
|
||||
"Z. c #D3D8D8",
|
||||
"`. c #F2F3F4",
|
||||
" + c #A8B1B3",
|
||||
".+ c #4C5F61",
|
||||
"++ c #374C4F",
|
||||
"@+ c #7D8B8D",
|
||||
"#+ c #DCE0E0",
|
||||
"$+ c #DADEDE",
|
||||
"%+ c #B0B9BA",
|
||||
"&+ c #CAD0D0",
|
||||
"*+ c #6A797B",
|
||||
"=+ c #F9F9F9",
|
||||
"-+ c #D5D9DA",
|
||||
";+ c #E3E6E7",
|
||||
">+ c #E5E7E8",
|
||||
",+ c #8D989A",
|
||||
"'+ c #3D5254",
|
||||
")+ c #99A3A5",
|
||||
"!+ c #EBEDED",
|
||||
"~+ c #D5DADA",
|
||||
"{+ c #3A4F52",
|
||||
"]+ c #909C9D",
|
||||
"^+ c #DFE2E3",
|
||||
"/+ c #B2BABB",
|
||||
"(+ c #748284",
|
||||
"_+ c #D4D9D9",
|
||||
":+ c #909B9D",
|
||||
"<+ c #E1E4E5",
|
||||
"[+ c #425659",
|
||||
"}+ c #485B5D",
|
||||
"|+ c #939EA0",
|
||||
"1+ c #D4D8D9",
|
||||
"2+ c #738284",
|
||||
"3+ c #B3BBBC",
|
||||
"4+ c #DCE0E1",
|
||||
"5+ c #CFD4D5",
|
||||
"6+ c #C1C8C9",
|
||||
"7+ c #B1B9BB",
|
||||
"8+ c #B0B8BA",
|
||||
"9+ c #F3F5F5",
|
||||
"0+ c #E0E3E3",
|
||||
"a+ c #283E42",
|
||||
"b+ c #98A3A4",
|
||||
"c+ c #8C989A",
|
||||
"d+ c #69797B",
|
||||
"e+ c #32474A",
|
||||
"f+ c #798789",
|
||||
"g+ c #9CA6A8",
|
||||
"h+ c #4C5F62",
|
||||
"i+ c #D9DDDD",
|
||||
"j+ c #5C6D6F",
|
||||
"k+ c #7E8C8D",
|
||||
"l+ c #9BA6A7",
|
||||
"m+ c #4F6264",
|
||||
"n+ c #44585A",
|
||||
"o+ c #899597",
|
||||
"p+ c #D8DCDD",
|
||||
"q+ c #4C5E61",
|
||||
"r+ c #A8B1B2",
|
||||
"s+ c #6E7D7F",
|
||||
"t+ c #516366",
|
||||
"u+ c #889596",
|
||||
"v+ c #A4AEAF",
|
||||
"w+ c #2F4447",
|
||||
"x+ c #2C4346",
|
||||
"y+ c #788688",
|
||||
"z+ c #A0AAAC",
|
||||
"A+ c #FBFCFC",
|
||||
"B+ c #C7CCCD",
|
||||
"C+ c #667678",
|
||||
"D+ c #3E5254",
|
||||
"E+ c #384D4F",
|
||||
"F+ c #5D6E70",
|
||||
"G+ c #ADB6B7",
|
||||
"H+ c #EDEFEF",
|
||||
"I+ c #E9EBEB",
|
||||
"J+ c #A5AFB0",
|
||||
"K+ c #57686B",
|
||||
"L+ c #405457",
|
||||
"M+ c #D1D6D6",
|
||||
"N+ c #E2E5E5",
|
||||
"O+ c #9AA4A6",
|
||||
"P+ c #869394",
|
||||
"Q+ c #677779",
|
||||
"R+ c #EEF0F0",
|
||||
"S+ c #849193",
|
||||
"T+ c #5B6C6E",
|
||||
"U+ c #A9B2B3",
|
||||
"V+ c #596A6D",
|
||||
"W+ c #304548",
|
||||
"X+ c #2A4044",
|
||||
"Y+ c #506265",
|
||||
"Z+ c #D7DBDB",
|
||||
"`+ c #5D6E71",
|
||||
" @ c #637375",
|
||||
".@ c #CED3D4",
|
||||
"+@ c #FBFBFC",
|
||||
"@@ c #808E8F",
|
||||
"#@ c #5A6B6D",
|
||||
"$@ c #EDEEEF",
|
||||
"%@ c #ACB4B5",
|
||||
"&@ c #7C8A8C",
|
||||
"*@ c #707F81",
|
||||
"=@ c #56676A",
|
||||
"-@ c #B6BDBE",
|
||||
";@ c #DDE1E1",
|
||||
">@ c #9FA9AB",
|
||||
",@ c #D3D7D8",
|
||||
"'@ c #596A6C",
|
||||
")@ c #AEB7B8",
|
||||
"!@ c #3C5053",
|
||||
"~@ c #C2C8C9",
|
||||
"{@ c #95A0A1",
|
||||
"]@ c #4B5D60",
|
||||
"^@ c #7B898B",
|
||||
"/@ c #D4D9DA",
|
||||
"(@ c #869294",
|
||||
"_@ c #A5AEB0",
|
||||
":@ c #F0F1F2",
|
||||
"<@ c #627375",
|
||||
"[@ c #FCFCFD",
|
||||
"}@ c #BBC2C3",
|
||||
"|@ c #546669",
|
||||
"1@ c #E9EBEC",
|
||||
"2@ c #F2F3F3",
|
||||
"3@ c #B7BFC0",
|
||||
"4@ c #4E6063",
|
||||
"5@ c #899697",
|
||||
"6@ c #97A2A4",
|
||||
"7@ c #EAEDED",
|
||||
"8@ c #44575A",
|
||||
"9@ c #A2ACAD",
|
||||
"0@ c #E8EAEB",
|
||||
"a@ c #B9C0C1",
|
||||
"b@ c #E0E4E4",
|
||||
"c@ c #728082",
|
||||
"d@ c #D2D7D8",
|
||||
"e@ c #45595C",
|
||||
"f@ c #A0AAAB",
|
||||
"g@ c #506365",
|
||||
"h@ c #9DA7A8",
|
||||
"i@ c #E4E7E7",
|
||||
"j@ c #949FA1",
|
||||
"k@ c #929D9F",
|
||||
"l@ c #4E6163",
|
||||
"m@ c #9AA5A6",
|
||||
"n@ c #6A797C",
|
||||
"o@ c #DFE2E2",
|
||||
"p@ c #4D5F62",
|
||||
"q@ c #F2F4F4",
|
||||
"r@ c #4B5E60",
|
||||
"s@ c #394E51",
|
||||
"t@ c #97A2A3",
|
||||
"u@ c #627274",
|
||||
"v@ c #9BA5A7",
|
||||
"w@ c #354B4D",
|
||||
"x@ c #F8F8F8",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" . . ",
|
||||
" . . . . . . . ",
|
||||
" . . + @ # $ % . . . ",
|
||||
" . . . & * = - ; > , ' . . . ",
|
||||
" . . . ) ! ~ { ] ^ / { ( _ : < . . . ",
|
||||
" . . [ } | 1 / 2 3 _ 4 5 6 ^ 7 8 9 0 . . . ",
|
||||
" . . . a b c ] ] d e f . g h i j 6 ] k l m n . . . ",
|
||||
" . . . o p q 2 / r s t ' . . . . u ! v w / ] x y z o . . . ",
|
||||
" . . A B C D ] { E F G . . . . . . . . H I J K / ] L M N O . . . ",
|
||||
" . . . P Q R ^ ] S T U . . . . . . . . . . . . V W X Y / / Z ` .) . . . ",
|
||||
" . . ..+.@.j / 5 #.$.0 . . . . . . . . . . . . . . . %.&.*.Z / / =.-.;.>.. . . ",
|
||||
" . . . ,.'.).] ^ !.~.{.. . . . . . . . . . . . . . . . . . . O $.].= ] / ^./.(.P . . . ",
|
||||
" . . . _.:.<.[.] Y }.|.A . . . . . . . . . . . . . . . . . . . . . . o 1.2.).] 3.1 4.5.6.. . . ",
|
||||
" . . ' 7.].K / - i 8.9.. . . . . . . . . . . . . . . . . . . . . . . . . . 0.a.l k ] 6 j b.c.d.. . . ",
|
||||
" . . . e.f.g.] ] h.> i.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 0 7.j.k.^ 6 5 l.m.n.A . . ",
|
||||
" . . . n o.3 2 / w p.m [ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . < |.q.r.{ 6 2 ~ s.A . ",
|
||||
" . . . t.u.v.] { w.x.%.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ' y.z.A.5 B.X 0 . ",
|
||||
" . . . >.c.C.^ / D.E.t.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . F.G.H.I.0 . ",
|
||||
" . . < J.K.w / 2 L.M.n . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . n N./.w O.P.0 . ",
|
||||
". . . Q.R.S.] ] T.U.6.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . V.W.= ] { A.:.X.. ",
|
||||
". + 8.Y.- ] ^.M Z.A . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . `. +.+{ ] ++@+#+. . . ",
|
||||
". $+c ] 2 4 %+_.. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . < &+*+w / 2 4.o.=+. . . . ",
|
||||
". -+S ] p.;+. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . >+,+'+] ] G.)+!+. . . . . . . ",
|
||||
". ~+{+/ ]+. . . 6.x.^+A . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . O /+l.- / ^.(+_+A . . . . . . . . . ",
|
||||
". ~+{+/ :+. . . <+[+}+|+V.% . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . % 1+2+^./ - l.3+O ' O P i.4+5+6+7+8+9+. ",
|
||||
". ~+{+/ :+. . . 0+c a+[.}+:+, ' . . . . . . . . . . . . . . . . . . . . . . . . . . . !+b+T.] ] S.c+>+. . |.d+Y.A.c = e+{ f++ . ",
|
||||
". ~+{+/ :+. . . _.g+h+- 3.{ !.c+i+[ . . . . . . . . . . . . . . . . . . . . . . . =+o.j+2 / w d+&+< . . . O k+^ { - - - = 1.. . ",
|
||||
". ~+{+/ :+. . . . A ;+l+m+2 / { n+o+p+' . . . . . . . . . . . . . . . . . . . . #+@+++] { q+r+`.. . . . . . m h.- 2 2 ] s+9.. ",
|
||||
". ~+{+/ ]+. . . . . . . i.m.t+5 / { T.u+|.< . . . . . . . . . . . . . . . . V v+A.{ ] = W.$ . . . . . . 9.8.i w+- 2 x+Y o.. . ",
|
||||
". ~+{+] y+H . . . . . . . . i.z+Y.5 6 ^ k.T 1+A+. . . . . . . . . . . . ..B+C+j / 5 J @ n . . . . . % _+2.Y / - D+j ] @.%.. ",
|
||||
". -+E+{ e+F+G+H+. . . . . . . . I+J+K+j 6 ^ L+W.M+... . . . . . . . . N+u+x ] ] ( g+H+. . . . . . 6.O+n+] ] S P+t Q+5 (.. . ",
|
||||
". R+S+h.] / w T+! H+. . . . . . . . u U+V+W+/ X+h.k+5+... . . . . _.G+Y+[./ Y }.Z+A . . . . . + M.`+5 ] w+ @+.0 . .@M 6.. ",
|
||||
". . +@7.@@c ^ / j #@! $@. . . . . . . . H+%@3 1 / ] S.&@.@+ . ' t *@e+] - =@-@9.. . . . . . ;@E.++] { R >@P . . . < u A . ",
|
||||
" . . . +@,@j.d ^ 6 j '@ +!+. . . . . . . . R+)@J e+3.] !@C ~@{@L+] ] c :+i.. . . . . . V J+]@{ ] Z ^@i+A . . . . . . ",
|
||||
" . . . A+/@(@g.^ 6 j K+_@f . . . . . . . . :@3+<@K 6 ] Y 5 / 1 | } [@. . . . . +@1.C+W+/ 2 T+}@o . . . ",
|
||||
" . . . < |.u+T.{ 3.5 |@h 1@. . . . . . . . 2@3@X ^./ { 4@! 9+. . . . . . ;+5@!@] ] g.6@7@. . . ",
|
||||
" . . . ' p+o+8@{ 3.5 l.9@0@. . . . . . . . 9+a@p.S+b@. . . . . . _.:.t+- ] ^.c@d@% . . ",
|
||||
" . . . ' i+_ e@{ 6 2 4 f@i.A . . . . . . . 9.0 . . . . . ' t *@K / - l.(._.. . . ",
|
||||
" . . . ' y.> R { 6 2 g@h@i@A . . . . . . . . . . . I+j@k.] ] '+R.>+. . . ",
|
||||
" . . . % V.k@; [.6 2 l@m@i@A . . . . . . . o a@'@2 / w n@m < . . ",
|
||||
" . . . A o@k@A.- 3.2 ~ m@,.A . . . A B C D ] { p@ +q@. . . ",
|
||||
" . . . A ^+j@r@- 6 - h+6@<+A R+>@R ^ / s@j.o@. . . ",
|
||||
" . . . A U t@h+- 6 - .+5@ @w+/ 5 u@~@+ . . ",
|
||||
" . . . A ,.O+~ 2 / ^ ] ^ R f@H . . . ",
|
||||
" . . A i@v@E 2 w@f+p+A . . ",
|
||||
" . . A i@9@a@x@. . . ",
|
||||
" . . . . . . ",
|
||||
" . . ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" ",
|
||||
" "};
|
||||
|
Before Width: | Height: | Size: 25 KiB After Width: | Height: | Size: 34 KiB |
|
Before Width: | Height: | Size: 151 KiB After Width: | Height: | Size: 201 KiB |
@@ -50,9 +50,9 @@ Var StartMenuGroup
|
||||
# Installer attributes
|
||||
OutFile @abs_top_srcdir@/@PACKAGE_TARNAME@-${VERSION}-win@WINDOWS_BITS@-setup.exe
|
||||
!if "@WINDOWS_BITS@" == "64"
|
||||
InstallDir $PROGRAMFILES64\Bitcoin
|
||||
InstallDir $PROGRAMFILES64\Lbrycrd
|
||||
!else
|
||||
InstallDir $PROGRAMFILES\Bitcoin
|
||||
InstallDir $PROGRAMFILES\Lbrycrd
|
||||
!endif
|
||||
CRCCheck on
|
||||
XPStyle on
|
||||
|
||||
@@ -357,7 +357,7 @@ lbrycrdd_CXXFLAGS = $(AM_CXXFLAGS) $(PIE_FLAGS)
|
||||
lbrycrdd_LDFLAGS = $(RELDFLAGS) $(AM_LDFLAGS) $(LIBTOOL_APP_LDFLAGS)
|
||||
|
||||
if TARGET_WINDOWS
|
||||
lbrycrdd_SOURCES += lbrycrdd-res.rc
|
||||
lbrycrdd_SOURCES += bitcoin-cli-res.rc
|
||||
endif
|
||||
|
||||
lbrycrdd_LDADD = \
|
||||
|
||||
@@ -61,6 +61,9 @@ BITCOIN_TESTS =\
|
||||
test/miner_tests.cpp \
|
||||
test/multisig_tests.cpp \
|
||||
test/claimtrie_tests.cpp \
|
||||
test/claimtriecache_tests.cpp \
|
||||
test/claimtriebranching_tests.cpp \
|
||||
test/nameclaim_tests.cpp \
|
||||
test/netbase_tests.cpp \
|
||||
test/pmt_tests.cpp \
|
||||
test/policyestimator_tests.cpp \
|
||||
|
||||
@@ -7,7 +7,7 @@
|
||||
|
||||
#include "tinyformat.h"
|
||||
|
||||
const std::string CURRENCY_UNIT = "BTC";
|
||||
const std::string CURRENCY_UNIT = "LBC";
|
||||
|
||||
CFeeRate::CFeeRate(const CAmount& nFeePaid, size_t nBytes_)
|
||||
{
|
||||
|
||||
@@ -126,11 +126,14 @@ public:
|
||||
consensus.nMajorityEnforceBlockUpgrade = 750;
|
||||
consensus.nMajorityRejectBlockOutdated = 950;
|
||||
consensus.nMajorityWindow = 1000;
|
||||
consensus.BIP34Height = 1;
|
||||
consensus.BIP34Hash = uint256S("0xdecb9e2cca03a419fd9cca0cb2b1d5ad11b088f22f8f38556d93ac4358b86c24");
|
||||
consensus.BIP34Height = 1;
|
||||
consensus.BIP34Hash = uint256S("0xdecb9e2cca03a419fd9cca0cb2b1d5ad11b088f22f8f38556d93ac4358b86c24");
|
||||
consensus.powLimit = uint256S("0000ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff");
|
||||
consensus.nPowTargetTimespan = 150; //retarget every block
|
||||
consensus.nPowTargetSpacing = 150;
|
||||
consensus.nOriginalClaimExpirationTime = 262974;
|
||||
consensus.nExtendedClaimExpirationTime = 2102400;
|
||||
consensus.nExtendedClaimExpirationForkHeight = 400155;
|
||||
consensus.fPowAllowMinDifficultyBlocks = false;
|
||||
consensus.fPowNoRetargeting = false;
|
||||
consensus.nRuleChangeActivationThreshold = 1916; // 95% of 2016
|
||||
@@ -215,6 +218,9 @@ public:
|
||||
consensus.powLimit = uint256S("0000ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff");
|
||||
consensus.nPowTargetTimespan = 150;
|
||||
consensus.nPowTargetSpacing = 150;
|
||||
consensus.nOriginalClaimExpirationTime = 262974;
|
||||
consensus.nExtendedClaimExpirationTime = 2102400;
|
||||
consensus.nExtendedClaimExpirationForkHeight = 278160;
|
||||
consensus.fPowAllowMinDifficultyBlocks = true;
|
||||
consensus.fPowNoRetargeting = false;
|
||||
consensus.nRuleChangeActivationThreshold = 1512; // 75% for testchains
|
||||
@@ -247,9 +253,8 @@ public:
|
||||
|
||||
vFixedSeeds.clear();
|
||||
vSeeds.clear();
|
||||
//vSeeds.push_back(CDNSSeedData("bitcoin.petertodd.org", "testnet-seed.bitcoin.petertodd.org"));
|
||||
//vSeeds.push_back(CDNSSeedData("bluematt.me", "testnet-seed.bluematt.me"));
|
||||
//vSeeds.push_back(CDNSSeedData("bitcoin.schildbach.de", "testnet-seed.bitcoin.schildbach.de"));
|
||||
vSeeds.push_back(CDNSSeedData("lbry.io", "testdnsseed1.lbry.io"));
|
||||
vSeeds.push_back(CDNSSeedData("lbry.io", "testdnsseed2.lbry.io"));
|
||||
|
||||
base58Prefixes[PUBKEY_ADDRESS] = std::vector<unsigned char>(1,111);
|
||||
base58Prefixes[SCRIPT_ADDRESS] = std::vector<unsigned char>(1,196);
|
||||
@@ -293,6 +298,9 @@ public:
|
||||
consensus.powLimit = uint256S("7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff");
|
||||
consensus.nPowTargetTimespan = 1;//14 * 24 * 60 * 60; // two weeks
|
||||
consensus.nPowTargetSpacing = 1;
|
||||
consensus.nOriginalClaimExpirationTime = 500;
|
||||
consensus.nExtendedClaimExpirationTime = 600;
|
||||
consensus.nExtendedClaimExpirationForkHeight = 800;
|
||||
consensus.fPowAllowMinDifficultyBlocks = false;
|
||||
consensus.fPowNoRetargeting = false;
|
||||
consensus.nRuleChangeActivationThreshold = 108; // 75% for testchains
|
||||
|
||||
@@ -8,11 +8,11 @@
|
||||
* IPv4 as well as onion addresses are wrapped inside a IPv6 address accordingly.
|
||||
*/
|
||||
static SeedSpec6 pnSeed6_main[] = {
|
||||
{{0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0xff,0xff,0x2d,0x20,0x27,0xf1}, 9246},
|
||||
{{0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0xff,0xff,0x2d,0x20,0x28,0xb4}, 9246}
|
||||
{{0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0xff,0xff,0x8a,0x44,0xc6,0x8e}, 9246},
|
||||
{{0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0xff,0xff,0x8a,0xc5,0xe0,0xfc}, 9246}
|
||||
};
|
||||
|
||||
static SeedSpec6 pnSeed6_test[] = {
|
||||
{{0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0xff,0xff,0x2d,0x20,0x27,0xf1}, 19246}
|
||||
{{0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0xff,0xff,0x9f,0xcb,0x9a,0xdb}, 19246}
|
||||
};
|
||||
#endif // BITCOIN_CHAINPARAMSSEEDS_H
|
||||
@@ -218,6 +218,7 @@ bool CClaimTrie::supportQueueEmpty() const
|
||||
void CClaimTrie::setExpirationTime(int t)
|
||||
{
|
||||
nExpirationTime = t;
|
||||
LogPrintf("%s: Expiration time is now %d\n", __func__, nExpirationTime);
|
||||
}
|
||||
|
||||
void CClaimTrie::clear()
|
||||
@@ -458,6 +459,110 @@ bool CClaimTrie::getLastTakeoverForName(const std::string& name, int& lastTakeov
|
||||
return false;
|
||||
}
|
||||
|
||||
claimsForNameType CClaimTrie::getClaimsForName(const std::string& name) const
|
||||
{
|
||||
std::vector<CClaimValue> claims;
|
||||
std::vector<CSupportValue> supports;
|
||||
int nLastTakeoverHeight = 0;
|
||||
const CClaimTrieNode* current = getNodeForName(name);
|
||||
if (current)
|
||||
{
|
||||
if (!current->claims.empty())
|
||||
{
|
||||
nLastTakeoverHeight = current->nHeightOfLastTakeover;
|
||||
}
|
||||
for (std::vector<CClaimValue>::const_iterator itClaims = current->claims.begin(); itClaims != current->claims.end(); ++itClaims)
|
||||
{
|
||||
claims.push_back(*itClaims);
|
||||
}
|
||||
}
|
||||
supportMapEntryType supportNode;
|
||||
if (getSupportNode(name, supportNode))
|
||||
{
|
||||
for (std::vector<CSupportValue>::const_iterator itSupports = supportNode.begin(); itSupports != supportNode.end(); ++itSupports)
|
||||
{
|
||||
supports.push_back(*itSupports);
|
||||
}
|
||||
}
|
||||
queueNameRowType namedClaimRow;
|
||||
if (getQueueNameRow(name, namedClaimRow))
|
||||
{
|
||||
for (queueNameRowType::const_iterator itClaimsForName = namedClaimRow.begin(); itClaimsForName != namedClaimRow.end(); ++itClaimsForName)
|
||||
{
|
||||
claimQueueRowType claimRow;
|
||||
if (getQueueRow(itClaimsForName->nHeight, claimRow))
|
||||
{
|
||||
for (claimQueueRowType::const_iterator itClaimRow = claimRow.begin(); itClaimRow != claimRow.end(); ++itClaimRow)
|
||||
{
|
||||
if (itClaimRow->first == name && itClaimRow->second.outPoint == itClaimsForName->outPoint)
|
||||
{
|
||||
claims.push_back(itClaimRow->second);
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
queueNameRowType namedSupportRow;
|
||||
if (getSupportQueueNameRow(name, namedSupportRow))
|
||||
{
|
||||
for (queueNameRowType::const_iterator itSupportsForName = namedSupportRow.begin(); itSupportsForName != namedSupportRow.end(); ++itSupportsForName)
|
||||
{
|
||||
supportQueueRowType supportRow;
|
||||
if (getSupportQueueRow(itSupportsForName->nHeight, supportRow))
|
||||
{
|
||||
for (supportQueueRowType::const_iterator itSupportRow = supportRow.begin(); itSupportRow != supportRow.end(); ++itSupportRow)
|
||||
{
|
||||
if (itSupportRow->first == name && itSupportRow->second.outPoint == itSupportsForName->outPoint)
|
||||
{
|
||||
supports.push_back(itSupportRow->second);
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
claimsForNameType allClaims(claims, supports, nLastTakeoverHeight);
|
||||
return allClaims;
|
||||
}
|
||||
|
||||
//return effective amount from claim, retuns 0 if claim is not found
|
||||
CAmount CClaimTrie::getEffectiveAmountForClaim(const std::string& name, uint160 claimId) const
|
||||
{
|
||||
std::vector<CSupportValue> supports;
|
||||
return getEffectiveAmountForClaimWithSupports(name, claimId, supports);
|
||||
}
|
||||
|
||||
//return effective amount from claim and the supports used as inputs, retuns 0 if claim is not found
|
||||
CAmount CClaimTrie::getEffectiveAmountForClaimWithSupports(const std::string& name, uint160 claimId,
|
||||
std::vector<CSupportValue>& supports) const
|
||||
{
|
||||
claimsForNameType claims = getClaimsForName(name);
|
||||
CAmount effectiveAmount = 0;
|
||||
bool claim_found = false;
|
||||
for (std::vector<CClaimValue>::iterator it=claims.claims.begin(); it!=claims.claims.end(); ++it)
|
||||
{
|
||||
if (it->claimId == claimId && it->nValidAtHeight < nCurrentHeight)
|
||||
{
|
||||
effectiveAmount += it->nAmount;
|
||||
claim_found = true;
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (!claim_found)
|
||||
return effectiveAmount;
|
||||
|
||||
for (std::vector<CSupportValue>::iterator it=claims.supports.begin(); it!=claims.supports.end(); ++it)
|
||||
{
|
||||
if (it->supportedClaimId == claimId && it->nValidAtHeight < nCurrentHeight)
|
||||
{
|
||||
effectiveAmount += it->nAmount;
|
||||
supports.push_back(*it);
|
||||
}
|
||||
}
|
||||
return effectiveAmount;
|
||||
}
|
||||
|
||||
bool CClaimTrie::checkConsistency() const
|
||||
{
|
||||
if (empty())
|
||||
@@ -497,6 +602,31 @@ bool CClaimTrie::recursiveCheckConsistency(const CClaimTrieNode* node) const
|
||||
return calculatedHash == node->hash;
|
||||
}
|
||||
|
||||
void CClaimTrie::addToClaimIndex(const std::string& name, const CClaimValue& claim)
|
||||
{
|
||||
CClaimIndexElement element = { name, claim };
|
||||
LogPrintf("%s: ClaimIndex[%s] updated %s\n", __func__, claim.claimId.GetHex(), name);
|
||||
|
||||
db.Write(std::make_pair(CLAIM_BY_ID, claim.claimId), element);
|
||||
}
|
||||
|
||||
void CClaimTrie::removeFromClaimIndex(const CClaimValue& claim)
|
||||
{
|
||||
db.Erase(std::make_pair(CLAIM_BY_ID, claim.claimId));
|
||||
}
|
||||
|
||||
bool CClaimTrie::getClaimById(const uint160 claimId, std::string& name, CClaimValue& claim) const
|
||||
{
|
||||
CClaimIndexElement element;
|
||||
if (db.Read(std::make_pair(CLAIM_BY_ID, claimId), element))
|
||||
{
|
||||
name = element.name;
|
||||
claim = element.claim;
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
bool CClaimTrie::getQueueRow(int nHeight, claimQueueRowType& row) const
|
||||
{
|
||||
claimQueueType::const_iterator itQueueRow = dirtyQueueRows.find(nHeight);
|
||||
@@ -677,17 +807,26 @@ bool CClaimTrie::update(nodeCacheType& cache, hashMapType& hashes, std::map<std:
|
||||
for (nodeCacheType::iterator itcache = cache.begin(); itcache != cache.end(); ++itcache)
|
||||
{
|
||||
if (!updateName(itcache->first, itcache->second))
|
||||
{
|
||||
LogPrintf("%s: Failed to update name for:%s\n", __func__, itcache->first);
|
||||
return false;
|
||||
}
|
||||
}
|
||||
for (hashMapType::iterator ithash = hashes.begin(); ithash != hashes.end(); ++ithash)
|
||||
{
|
||||
if (!updateHash(ithash->first, ithash->second))
|
||||
{
|
||||
LogPrintf("%s: Failed to update hash for:%s\n", __func__, ithash->first);
|
||||
return false;
|
||||
}
|
||||
}
|
||||
for (std::map<std::string, int>::iterator itheight = takeoverHeights.begin(); itheight != takeoverHeights.end(); ++itheight)
|
||||
{
|
||||
if (!updateTakeoverHeight(itheight->first, itheight->second))
|
||||
{
|
||||
LogPrintf("%s: Failed to update takeover height for:%s\n", __func__, itheight->first);
|
||||
return false;
|
||||
}
|
||||
}
|
||||
for (claimQueueType::iterator itQueueCacheRow = queueCache.begin(); itQueueCacheRow != queueCache.end(); ++itQueueCacheRow)
|
||||
{
|
||||
@@ -991,9 +1130,11 @@ bool CClaimTrie::ReadFromDisk(bool check)
|
||||
LogPrintf("%s: Couldn't read the best block's hash\n", __func__);
|
||||
if (!db.Read(CURRENT_HEIGHT, nCurrentHeight))
|
||||
LogPrintf("%s: Couldn't read the current height\n", __func__);
|
||||
setExpirationTime(Params().GetConsensus().GetExpirationTime(nCurrentHeight-1));
|
||||
|
||||
boost::scoped_ptr<CDBIterator> pcursor(const_cast<CDBWrapper*>(&db)->NewIterator());
|
||||
|
||||
pcursor->SeekToFirst();
|
||||
|
||||
while (pcursor->Valid())
|
||||
{
|
||||
std::pair<char, std::string> key;
|
||||
@@ -1017,6 +1158,7 @@ bool CClaimTrie::ReadFromDisk(bool check)
|
||||
}
|
||||
pcursor->Next();
|
||||
}
|
||||
|
||||
if (check)
|
||||
{
|
||||
LogPrintf("Checking Claim trie consistency...");
|
||||
@@ -1119,14 +1261,24 @@ bool CClaimTrieCache::empty() const
|
||||
|
||||
CClaimTrieNode* CClaimTrieCache::addNodeToCache(const std::string& position, CClaimTrieNode* original) const
|
||||
{
|
||||
if (!original)
|
||||
original = new CClaimTrieNode();
|
||||
CClaimTrieNode* cacheCopy = new CClaimTrieNode(*original);
|
||||
// create a copy of the node in the cache, if new node, create empty node
|
||||
CClaimTrieNode* cacheCopy;
|
||||
if(!original)
|
||||
cacheCopy = new CClaimTrieNode();
|
||||
else
|
||||
cacheCopy = new CClaimTrieNode(*original);
|
||||
cache[position] = cacheCopy;
|
||||
|
||||
// check to see if there is the original node in block_originals,
|
||||
// if not, add it to block_originals cache
|
||||
nodeCacheType::const_iterator itOriginals = block_originals.find(position);
|
||||
if (block_originals.end() == itOriginals)
|
||||
{
|
||||
CClaimTrieNode* originalCopy = new CClaimTrieNode(*original);
|
||||
CClaimTrieNode* originalCopy;
|
||||
if(!original)
|
||||
originalCopy = new CClaimTrieNode();
|
||||
else
|
||||
originalCopy = new CClaimTrieNode(*original);
|
||||
block_originals[position] = originalCopy;
|
||||
}
|
||||
return cacheCopy;
|
||||
@@ -1205,6 +1357,7 @@ bool CClaimTrieCache::insertClaimIntoTrie(const std::string& name, CClaimValue c
|
||||
{
|
||||
fChanged = true;
|
||||
currentNode->insertClaim(claim);
|
||||
base->addToClaimIndex(name, claim);
|
||||
}
|
||||
else
|
||||
{
|
||||
@@ -1279,7 +1432,8 @@ bool CClaimTrieCache::removeClaimFromTrie(const std::string& name, const COutPoi
|
||||
CClaimValue currentTop = currentNode->claims.front();
|
||||
|
||||
success = currentNode->removeClaim(outPoint, claim);
|
||||
|
||||
base->removeFromClaimIndex(claim);
|
||||
|
||||
if (!currentNode->claims.empty())
|
||||
{
|
||||
supportMapEntryType node;
|
||||
@@ -1317,6 +1471,9 @@ bool CClaimTrieCache::removeClaimFromTrie(const std::string& name, const COutPoi
|
||||
|
||||
bool CClaimTrieCache::recursivePruneName(CClaimTrieNode* tnCurrent, unsigned int nPos, std::string sName, bool* pfNullified) const
|
||||
{
|
||||
// Recursively prune leaf node(s) without any claims in it and store
|
||||
// the modified nodes in the cache
|
||||
|
||||
bool fNullified = false;
|
||||
std::string sCurrentSubstring = sName.substr(0, nPos);
|
||||
if (nPos < sName.size())
|
||||
@@ -1473,6 +1630,7 @@ bool CClaimTrieCache::addClaimToQueues(const std::string& name, CClaimValue& cla
|
||||
itQueueNameRow->second.push_back(outPointHeightType(claim.outPoint, claim.nValidAtHeight));
|
||||
nameOutPointType expireEntry(name, claim.outPoint);
|
||||
addToExpirationQueue(claim.nHeight + base->nExpirationTime, expireEntry);
|
||||
base->addToClaimIndex(name, claim);
|
||||
return true;
|
||||
}
|
||||
|
||||
@@ -1511,6 +1669,8 @@ bool CClaimTrieCache::removeClaimFromQueue(const std::string& name, const COutPo
|
||||
std::swap(claim, itQueue->second);
|
||||
itQueueNameRow->second.erase(itQueueName);
|
||||
itQueueRow->second.erase(itQueue);
|
||||
|
||||
base->removeFromClaimIndex(claim);
|
||||
return true;
|
||||
}
|
||||
}
|
||||
@@ -1545,7 +1705,8 @@ bool CClaimTrieCache::removeClaim(const std::string& name, const COutPoint& outP
|
||||
if (removed == true)
|
||||
{
|
||||
nValidAtHeight = claim.nValidAtHeight;
|
||||
removeFromExpirationQueue(name, outPoint, nHeight);
|
||||
int expirationHeight = nHeight + base->nExpirationTime;
|
||||
removeFromExpirationQueue(name, outPoint, expirationHeight);
|
||||
}
|
||||
return removed;
|
||||
}
|
||||
@@ -1556,9 +1717,8 @@ void CClaimTrieCache::addToExpirationQueue(int nExpirationHeight, nameOutPointTy
|
||||
itQueueRow->second.push_back(entry);
|
||||
}
|
||||
|
||||
void CClaimTrieCache::removeFromExpirationQueue(const std::string& name, const COutPoint& outPoint, int nHeight) const
|
||||
void CClaimTrieCache::removeFromExpirationQueue(const std::string& name, const COutPoint& outPoint, int expirationHeight) const
|
||||
{
|
||||
int expirationHeight = nHeight + base->nExpirationTime;
|
||||
expirationQueueType::iterator itQueueRow = getExpirationQueueCacheRow(expirationHeight, false);
|
||||
expirationQueueRowType::iterator itQueue;
|
||||
if (itQueueRow != expirationQueueCache.end())
|
||||
@@ -1568,10 +1728,11 @@ void CClaimTrieCache::removeFromExpirationQueue(const std::string& name, const C
|
||||
if (name == itQueue->name && outPoint == itQueue->outPoint)
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (itQueue != itQueueRow->second.end())
|
||||
{
|
||||
itQueueRow->second.erase(itQueue);
|
||||
|
||||
if (itQueue != itQueueRow->second.end())
|
||||
{
|
||||
itQueueRow->second.erase(itQueue);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
@@ -1603,7 +1764,12 @@ bool CClaimTrieCache::reorderTrieNode(const std::string& name, bool fCheckTakeov
|
||||
cachedNode = cache.find(name);
|
||||
if (cachedNode == cache.end())
|
||||
{
|
||||
CClaimTrieNode* currentNode = &(base->root);
|
||||
CClaimTrieNode* currentNode;
|
||||
cachedNode = cache.find("");
|
||||
if(cachedNode == cache.end())
|
||||
currentNode = &(base->root);
|
||||
else
|
||||
currentNode = cachedNode->second;
|
||||
for (std::string::const_iterator itCur = name.begin(); itCur != name.end(); ++itCur)
|
||||
{
|
||||
std::string sCurrentSubstring(name.begin(), itCur);
|
||||
@@ -1871,7 +2037,8 @@ bool CClaimTrieCache::removeSupport(const std::string& name, const COutPoint& ou
|
||||
removed = true;
|
||||
if (removed)
|
||||
{
|
||||
removeSupportFromExpirationQueue(name, outPoint, nHeight);
|
||||
int expirationHeight = nHeight + base->nExpirationTime;
|
||||
removeSupportFromExpirationQueue(name, outPoint, expirationHeight);
|
||||
nValidAtHeight = support.nValidAtHeight;
|
||||
}
|
||||
return removed;
|
||||
@@ -1883,9 +2050,8 @@ void CClaimTrieCache::addSupportToExpirationQueue(int nExpirationHeight, nameOut
|
||||
itQueueRow->second.push_back(entry);
|
||||
}
|
||||
|
||||
void CClaimTrieCache::removeSupportFromExpirationQueue(const std::string& name, const COutPoint& outPoint, int nHeight) const
|
||||
void CClaimTrieCache::removeSupportFromExpirationQueue(const std::string& name, const COutPoint& outPoint, int expirationHeight) const
|
||||
{
|
||||
int expirationHeight = nHeight + base->nExpirationTime;
|
||||
expirationQueueType::iterator itQueueRow = getSupportExpirationQueueCacheRow(expirationHeight, false);
|
||||
expirationQueueRowType::iterator itQueue;
|
||||
if (itQueueRow != supportExpirationQueueCache.end())
|
||||
@@ -1939,6 +2105,7 @@ bool CClaimTrieCache::spendSupport(const std::string& name, const COutPoint& out
|
||||
bool CClaimTrieCache::incrementBlock(insertUndoType& insertUndo, claimQueueRowType& expireUndo, insertUndoType& insertSupportUndo, supportQueueRowType& expireSupportUndo, std::vector<std::pair<std::string, int> >& takeoverHeightUndo) const
|
||||
{
|
||||
LogPrintf("%s: nCurrentHeight (before increment): %d\n", __func__, nCurrentHeight);
|
||||
|
||||
claimQueueType::iterator itQueueRow = getQueueCacheRow(nCurrentHeight, false);
|
||||
if (itQueueRow != claimQueueCache.end())
|
||||
{
|
||||
@@ -1988,6 +2155,7 @@ bool CClaimTrieCache::incrementBlock(insertUndoType& insertUndo, claimQueueRowTy
|
||||
CClaimValue claim;
|
||||
assert(removeClaimFromTrie(itEntry->name, itEntry->outPoint, claim, true));
|
||||
expireUndo.push_back(std::make_pair(itEntry->name, claim));
|
||||
LogPrintf("Expiring claim %s: %s, nHeight: %d, nValidAtHeight: %d\n", claim.claimId.GetHex(), itEntry->name, claim.nHeight, claim.nValidAtHeight);
|
||||
}
|
||||
itExpirationRow->second.clear();
|
||||
}
|
||||
@@ -2039,6 +2207,7 @@ bool CClaimTrieCache::incrementBlock(insertUndoType& insertUndo, claimQueueRowTy
|
||||
CSupportValue support;
|
||||
assert(removeSupportFromMap(itEntry->name, itEntry->outPoint, support, true));
|
||||
expireSupportUndo.push_back(std::make_pair(itEntry->name, support));
|
||||
LogPrintf("Expiring support %s: %s, nHeight: %d, nValidAtHeight: %d\n", support.supportedClaimId.GetHex(), itEntry->name, support.nHeight, support.nValidAtHeight);
|
||||
}
|
||||
itSupportExpirationRow->second.clear();
|
||||
}
|
||||
@@ -2254,6 +2423,7 @@ bool CClaimTrieCache::decrementBlock(insertUndoType& insertUndo, claimQueueRowTy
|
||||
{
|
||||
cacheTakeoverHeights[itTakeoverHeightUndo->first] = itTakeoverHeightUndo->second;
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
@@ -2351,6 +2521,7 @@ bool CClaimTrieCache::clear() const
|
||||
supportCache.clear();
|
||||
supportQueueCache.clear();
|
||||
supportQueueNameCache.clear();
|
||||
supportExpirationQueueCache.clear();
|
||||
namesToCheckForTakeover.clear();
|
||||
cacheTakeoverHeights.clear();
|
||||
return true;
|
||||
@@ -2441,3 +2612,106 @@ CClaimTrieProof CClaimTrieCache::getProofForName(const std::string& name) const
|
||||
return CClaimTrieProof(nodes, fNameHasValue, outPoint,
|
||||
nHeightOfLastTakeover);
|
||||
}
|
||||
|
||||
|
||||
void CClaimTrieCache::removeAndAddToExpirationQueue(expirationQueueRowType &row, int height, bool increment) const
|
||||
{
|
||||
for (expirationQueueRowType::iterator e = row.begin(); e != row.end(); ++e)
|
||||
{
|
||||
// remove and insert with new expiration time
|
||||
removeFromExpirationQueue(e->name, e->outPoint, height);
|
||||
int extend_expiration = Params().GetConsensus().nExtendedClaimExpirationTime - Params().GetConsensus().nOriginalClaimExpirationTime;
|
||||
int new_expiration_height = increment ? height + extend_expiration : height - extend_expiration;
|
||||
nameOutPointType entry(e->name, e->outPoint);
|
||||
addToExpirationQueue(new_expiration_height, entry);
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
void CClaimTrieCache::removeAndAddSupportToExpirationQueue(expirationQueueRowType &row, int height, bool increment) const
|
||||
{
|
||||
for (expirationQueueRowType::iterator e = row.begin(); e != row.end(); ++e)
|
||||
{
|
||||
// remove and insert with new expiration time
|
||||
removeSupportFromExpirationQueue(e->name, e->outPoint, height);
|
||||
int extend_expiration = Params().GetConsensus().nExtendedClaimExpirationTime - Params().GetConsensus().nOriginalClaimExpirationTime;
|
||||
int new_expiration_height = increment ? height + extend_expiration : height - extend_expiration;
|
||||
nameOutPointType entry(e->name, e->outPoint);
|
||||
addSupportToExpirationQueue(new_expiration_height, entry);
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
bool CClaimTrieCache::forkForExpirationChange(bool increment) const
|
||||
{
|
||||
/*
|
||||
If increment is True, we have forked to extend the expiration time, thus items in the expiration queue
|
||||
will have their expiration extended by "new expiration time - original expiration time"
|
||||
|
||||
If increment is False, we are decremented a block to reverse the fork. Thus items in the expiration queue
|
||||
will have their expiration extension removed.
|
||||
*/
|
||||
|
||||
// look through dirty expiration queues
|
||||
std::set<int> dirtyHeights;
|
||||
for (expirationQueueType::const_iterator i = base->dirtyExpirationQueueRows.begin(); i != base->dirtyExpirationQueueRows.end(); ++i)
|
||||
{
|
||||
int height = i->first;
|
||||
dirtyHeights.insert(height);
|
||||
expirationQueueRowType row = i->second;
|
||||
removeAndAddToExpirationQueue(row, height, increment);
|
||||
}
|
||||
|
||||
std::set<int> dirtySupportHeights;
|
||||
for (expirationQueueType::const_iterator i = base->dirtySupportExpirationQueueRows.begin(); i != base->dirtySupportExpirationQueueRows.end(); ++i)
|
||||
{
|
||||
int height = i->first;
|
||||
dirtySupportHeights.insert(height);
|
||||
expirationQueueRowType row = i->second;
|
||||
removeAndAddSupportToExpirationQueue(row, height, increment);
|
||||
}
|
||||
|
||||
|
||||
//look through db for expiration queues, if we haven't already found it in dirty expiration queue
|
||||
boost::scoped_ptr<CDBIterator> pcursor(const_cast<CDBWrapper*>(&base->db)->NewIterator());
|
||||
pcursor->SeekToFirst();
|
||||
while (pcursor->Valid())
|
||||
{
|
||||
std::pair<char, int> key;
|
||||
if (pcursor->GetKey(key))
|
||||
{
|
||||
int height = key.second;
|
||||
// if we've looked throught this in dirtyExprirationQueueRows, don't use it
|
||||
// because its stale
|
||||
if ((key.first == EXP_QUEUE_ROW) & (dirtyHeights.count(height) == 0))
|
||||
{
|
||||
expirationQueueRowType row;
|
||||
if (pcursor->GetValue(row))
|
||||
{
|
||||
removeAndAddToExpirationQueue(row, height, increment);
|
||||
}
|
||||
else
|
||||
{
|
||||
return error("%s(): error reading expiration queue rows from disk", __func__);
|
||||
}
|
||||
}
|
||||
else if ((key.first == SUPPORT_EXP_QUEUE_ROW) & (dirtySupportHeights.count(height) == 0))
|
||||
{
|
||||
expirationQueueRowType row;
|
||||
if (pcursor->GetValue(row))
|
||||
{
|
||||
removeAndAddSupportToExpirationQueue(row, height, increment);
|
||||
}
|
||||
else
|
||||
{
|
||||
return error("%s(): error reading support expiration queue rows from disk", __func__);
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
pcursor->Next();
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
@@ -6,15 +6,18 @@
|
||||
#include "uint256.h"
|
||||
#include "util.h"
|
||||
#include "dbwrapper.h"
|
||||
#include "chainparams.h"
|
||||
#include "primitives/transaction.h"
|
||||
|
||||
#include <string>
|
||||
#include <vector>
|
||||
#include <map>
|
||||
|
||||
// leveldb keys
|
||||
#define HASH_BLOCK 'h'
|
||||
#define CURRENT_HEIGHT 't'
|
||||
#define TRIE_NODE 'n'
|
||||
#define CLAIM_BY_ID 'i'
|
||||
#define CLAIM_QUEUE_ROW 'r'
|
||||
#define CLAIM_QUEUE_NAME_ROW 'm'
|
||||
#define EXP_QUEUE_ROW 'e'
|
||||
@@ -54,7 +57,7 @@ public:
|
||||
READWRITE(nHeight);
|
||||
READWRITE(nValidAtHeight);
|
||||
}
|
||||
|
||||
|
||||
bool operator<(const CClaimValue& other) const
|
||||
{
|
||||
if (nEffectiveAmount < other.nEffectiveAmount)
|
||||
@@ -71,12 +74,12 @@ public:
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
|
||||
bool operator==(const CClaimValue& other) const
|
||||
{
|
||||
return outPoint == other.outPoint && claimId == other.claimId && nAmount == other.nAmount && nHeight == other.nHeight && nValidAtHeight == other.nValidAtHeight;
|
||||
}
|
||||
|
||||
|
||||
bool operator!=(const CClaimValue& other) const
|
||||
{
|
||||
return !(*this == other);
|
||||
@@ -91,7 +94,7 @@ public:
|
||||
CAmount nAmount;
|
||||
int nHeight;
|
||||
int nValidAtHeight;
|
||||
|
||||
|
||||
CSupportValue() {};
|
||||
CSupportValue(COutPoint outPoint, uint160 supportedClaimId,
|
||||
CAmount nAmount, int nHeight, int nValidAtHeight)
|
||||
@@ -99,7 +102,7 @@ public:
|
||||
, nAmount(nAmount), nHeight(nHeight)
|
||||
, nValidAtHeight(nValidAtHeight)
|
||||
{}
|
||||
|
||||
|
||||
ADD_SERIALIZE_METHODS;
|
||||
|
||||
template <typename Stream, typename Operation>
|
||||
@@ -147,7 +150,7 @@ public:
|
||||
bool empty() const {return children.empty() && claims.empty();}
|
||||
bool haveClaim(const COutPoint& outPoint) const;
|
||||
void reorderClaims(supportMapEntryType& supports);
|
||||
|
||||
|
||||
ADD_SERIALIZE_METHODS;
|
||||
|
||||
template <typename Stream, typename Operation>
|
||||
@@ -156,7 +159,7 @@ public:
|
||||
READWRITE(claims);
|
||||
READWRITE(nHeightOfLastTakeover);
|
||||
}
|
||||
|
||||
|
||||
bool operator==(const CClaimTrieNode& other) const
|
||||
{
|
||||
return hash == other.hash && claims == other.claims;
|
||||
@@ -241,6 +244,21 @@ struct nameOutPointType
|
||||
}
|
||||
};
|
||||
|
||||
class CClaimIndexElement
|
||||
{
|
||||
public:
|
||||
ADD_SERIALIZE_METHODS;
|
||||
|
||||
template <typename Stream, typename Operation>
|
||||
inline void SerializationOp(Stream& s, Operation ser_action, int nType, int nVersion) {
|
||||
READWRITE(name);
|
||||
READWRITE(claim);
|
||||
}
|
||||
|
||||
std::string name;
|
||||
CClaimValue claim;
|
||||
};
|
||||
|
||||
typedef std::pair<std::string, CClaimValue> claimQueueEntryType;
|
||||
|
||||
typedef std::pair<std::string, CSupportValue> supportQueueEntryType;
|
||||
@@ -265,6 +283,16 @@ typedef std::map<std::string, CClaimTrieNode*, nodenamecompare> nodeCacheType;
|
||||
|
||||
typedef std::map<std::string, uint256> hashMapType;
|
||||
|
||||
struct claimsForNameType
|
||||
{
|
||||
std::vector<CClaimValue> claims;
|
||||
std::vector<CSupportValue> supports;
|
||||
int nLastTakeoverHeight;
|
||||
|
||||
claimsForNameType(std::vector<CClaimValue> claims, std::vector<CSupportValue> supports, int nLastTakeoverHeight)
|
||||
: claims(claims), supports(supports), nLastTakeoverHeight(nLastTakeoverHeight) {}
|
||||
};
|
||||
|
||||
class CClaimTrieCache;
|
||||
|
||||
class CClaimTrie
|
||||
@@ -272,33 +300,42 @@ class CClaimTrie
|
||||
public:
|
||||
CClaimTrie(bool fMemory = false, bool fWipe = false, int nProportionalDelayFactor = 32)
|
||||
: db(GetDataDir() / "claimtrie", 100, fMemory, fWipe, false)
|
||||
, nCurrentHeight(0), nExpirationTime(262974)
|
||||
, nCurrentHeight(0), nExpirationTime(Params().GetConsensus().nOriginalClaimExpirationTime)
|
||||
, nProportionalDelayFactor(nProportionalDelayFactor)
|
||||
, root(uint256S("0000000000000000000000000000000000000000000000000000000000000001"))
|
||||
{}
|
||||
|
||||
|
||||
uint256 getMerkleHash();
|
||||
|
||||
|
||||
bool empty() const;
|
||||
void clear();
|
||||
|
||||
|
||||
bool checkConsistency() const;
|
||||
|
||||
|
||||
bool WriteToDisk();
|
||||
bool ReadFromDisk(bool check = false);
|
||||
|
||||
|
||||
std::vector<namedNodeType> flattenTrie() const;
|
||||
bool getInfoForName(const std::string& name, CClaimValue& claim) const;
|
||||
bool getLastTakeoverForName(const std::string& name, int& lastTakeoverHeight) const;
|
||||
|
||||
|
||||
claimsForNameType getClaimsForName(const std::string& name) const;
|
||||
CAmount getEffectiveAmountForClaim(const std::string& name, uint160 claimId) const;
|
||||
CAmount getEffectiveAmountForClaimWithSupports(const std::string& name, uint160 claimId,
|
||||
std::vector<CSupportValue>& supports) const;
|
||||
|
||||
bool queueEmpty() const;
|
||||
bool supportEmpty() const;
|
||||
bool supportQueueEmpty() const;
|
||||
bool expirationQueueEmpty() const;
|
||||
bool supportExpirationQueueEmpty() const;
|
||||
|
||||
|
||||
void setExpirationTime(int t);
|
||||
|
||||
|
||||
void addToClaimIndex(const std::string& name, const CClaimValue& claim);
|
||||
void removeFromClaimIndex(const CClaimValue& claim);
|
||||
|
||||
bool getClaimById(const uint160 claimId, std::string& name, CClaimValue& claim) const;
|
||||
bool getQueueRow(int nHeight, claimQueueRowType& row) const;
|
||||
bool getQueueNameRow(const std::string& name, queueNameRowType& row) const;
|
||||
bool getExpirationQueueRow(int nHeight, expirationQueueRowType& row) const;
|
||||
@@ -306,21 +343,22 @@ public:
|
||||
bool getSupportQueueRow(int nHeight, supportQueueRowType& row) const;
|
||||
bool getSupportQueueNameRow(const std::string& name, queueNameRowType& row) const;
|
||||
bool getSupportExpirationQueueRow(int nHeight, expirationQueueRowType& row) const;
|
||||
|
||||
|
||||
|
||||
bool haveClaim(const std::string& name, const COutPoint& outPoint) const;
|
||||
bool haveClaimInQueue(const std::string& name, const COutPoint& outPoint,
|
||||
int& nValidAtHeight) const;
|
||||
|
||||
|
||||
bool haveSupport(const std::string& name, const COutPoint& outPoint) const;
|
||||
bool haveSupportInQueue(const std::string& name, const COutPoint& outPoint,
|
||||
int& nValidAtHeight) const;
|
||||
|
||||
|
||||
unsigned int getTotalNamesInTrie() const;
|
||||
unsigned int getTotalClaimsInTrie() const;
|
||||
CAmount getTotalValueOfClaimsInTrie(bool fControllingOnly) const;
|
||||
|
||||
|
||||
friend class CClaimTrieCache;
|
||||
|
||||
|
||||
CDBWrapper db;
|
||||
int nCurrentHeight;
|
||||
int nExpirationTime;
|
||||
@@ -329,7 +367,7 @@ private:
|
||||
void clear(CClaimTrieNode* current);
|
||||
|
||||
const CClaimTrieNode* getNodeForName(const std::string& name) const;
|
||||
|
||||
|
||||
bool update(nodeCacheType& cache, hashMapType& hashes,
|
||||
std::map<std::string, int>& takeoverHeights,
|
||||
const uint256& hashBlock, claimQueueType& queueCache,
|
||||
@@ -343,11 +381,11 @@ private:
|
||||
bool updateHash(const std::string& name, uint256& hash);
|
||||
bool updateTakeoverHeight(const std::string& name, int nTakeoverHeight);
|
||||
bool recursiveNullify(CClaimTrieNode* node, std::string& name);
|
||||
|
||||
|
||||
bool recursiveCheckConsistency(const CClaimTrieNode* node) const;
|
||||
|
||||
|
||||
bool InsertFromDisk(const std::string& name, CClaimTrieNode* node);
|
||||
|
||||
|
||||
unsigned int getTotalNamesRecursive(const CClaimTrieNode* current) const;
|
||||
unsigned int getTotalClaimsRecursive(const CClaimTrieNode* current) const;
|
||||
CAmount getTotalValueOfClaimsRecursive(const CClaimTrieNode* current,
|
||||
@@ -355,7 +393,7 @@ private:
|
||||
bool recursiveFlattenTrie(const std::string& name,
|
||||
const CClaimTrieNode* current,
|
||||
std::vector<namedNodeType>& nodes) const;
|
||||
|
||||
|
||||
void markNodeDirty(const std::string& name, CClaimTrieNode* node);
|
||||
void updateQueueRow(int nHeight, claimQueueRowType& row);
|
||||
void updateQueueNameRow(const std::string& name,
|
||||
@@ -366,10 +404,11 @@ private:
|
||||
void updateSupportNameQueue(const std::string& name,
|
||||
queueNameRowType& row);
|
||||
void updateSupportExpirationQueue(int nHeight, expirationQueueRowType& row);
|
||||
|
||||
|
||||
void BatchWriteNode(CDBBatch& batch, const std::string& name,
|
||||
const CClaimTrieNode* pNode) const;
|
||||
void BatchEraseNode(CDBBatch& batch, const std::string& nome) const;
|
||||
void BatchWriteClaimIndex(CDBBatch& batch) const;
|
||||
void BatchWriteQueueRows(CDBBatch& batch);
|
||||
void BatchWriteQueueNameRows(CDBBatch& batch);
|
||||
void BatchWriteExpirationQueueRows(CDBBatch& batch);
|
||||
@@ -378,18 +417,18 @@ private:
|
||||
void BatchWriteSupportQueueNameRows(CDBBatch& batch);
|
||||
void BatchWriteSupportExpirationQueueRows(CDBBatch& batch);
|
||||
template<typename K> bool keyTypeEmpty(char key, K& dummy) const;
|
||||
|
||||
|
||||
CClaimTrieNode root;
|
||||
uint256 hashBlock;
|
||||
|
||||
|
||||
claimQueueType dirtyQueueRows;
|
||||
queueNameType dirtyQueueNameRows;
|
||||
expirationQueueType dirtyExpirationQueueRows;
|
||||
|
||||
|
||||
supportQueueType dirtySupportQueueRows;
|
||||
queueNameType dirtySupportQueueNameRows;
|
||||
expirationQueueType dirtySupportExpirationQueueRows;
|
||||
|
||||
|
||||
nodeCacheType dirtyNodes;
|
||||
supportMapType dirtySupportNodes;
|
||||
};
|
||||
@@ -428,13 +467,13 @@ public:
|
||||
assert(base);
|
||||
nCurrentHeight = base->nCurrentHeight;
|
||||
}
|
||||
|
||||
|
||||
uint256 getMerkleHash() const;
|
||||
|
||||
|
||||
bool empty() const;
|
||||
bool flush();
|
||||
bool dirty() const { return !dirtyHashes.empty(); }
|
||||
|
||||
|
||||
bool addClaim(const std::string& name, const COutPoint& outPoint,
|
||||
uint160 claimId, CAmount nAmount, int nHeight) const;
|
||||
bool undoAddClaim(const std::string& name, const COutPoint& outPoint,
|
||||
@@ -444,7 +483,7 @@ public:
|
||||
bool undoSpendClaim(const std::string& name, const COutPoint& outPoint,
|
||||
uint160 claimId, CAmount nAmount, int nHeight,
|
||||
int nValidAtHeight) const;
|
||||
|
||||
|
||||
bool addSupport(const std::string& name, const COutPoint& outPoint,
|
||||
CAmount nAmount, uint160 supportedClaimId,
|
||||
int nHeight) const;
|
||||
@@ -455,7 +494,7 @@ public:
|
||||
bool undoSpendSupport(const std::string& name, const COutPoint& outPoint,
|
||||
uint160 supportedClaimId, CAmount nAmount,
|
||||
int nHeight, int nValidAtHeight) const;
|
||||
|
||||
|
||||
uint256 getBestBlock();
|
||||
void setBestBlock(const uint256& hashBlock);
|
||||
|
||||
@@ -469,9 +508,9 @@ public:
|
||||
insertUndoType& insertSupportUndo,
|
||||
supportQueueRowType& expireSupportUndo,
|
||||
std::vector<std::pair<std::string, int> >& takeoverHeightUndo) const;
|
||||
|
||||
|
||||
~CClaimTrieCache() { clear(); }
|
||||
|
||||
|
||||
bool insertClaimIntoTrie(const std::string& name, CClaimValue claim,
|
||||
bool fCheckTakeover = false) const;
|
||||
bool removeClaimFromTrie(const std::string& name, const COutPoint& outPoint,
|
||||
@@ -480,7 +519,14 @@ public:
|
||||
CClaimTrieProof getProofForName(const std::string& name) const;
|
||||
|
||||
bool finalizeDecrement() const;
|
||||
private:
|
||||
|
||||
void removeAndAddSupportToExpirationQueue(expirationQueueRowType &row, int height, bool increment) const;
|
||||
void removeAndAddToExpirationQueue(expirationQueueRowType &row, int height, bool increment) const;
|
||||
|
||||
bool forkForExpirationChange(bool increment) const;
|
||||
|
||||
|
||||
protected:
|
||||
CClaimTrie* base;
|
||||
|
||||
bool fRequireTakeoverHeights;
|
||||
@@ -500,48 +546,48 @@ private:
|
||||
mutable std::map<std::string, int> cacheTakeoverHeights;
|
||||
mutable int nCurrentHeight; // Height of the block that is being worked on, which is
|
||||
// one greater than the height of the chain's tip
|
||||
|
||||
|
||||
uint256 hashBlock;
|
||||
|
||||
|
||||
uint256 computeHash() const;
|
||||
|
||||
|
||||
bool reorderTrieNode(const std::string& name, bool fCheckTakeover) const;
|
||||
bool recursiveComputeMerkleHash(CClaimTrieNode* tnCurrent,
|
||||
std::string sPos) const;
|
||||
bool recursivePruneName(CClaimTrieNode* tnCurrent, unsigned int nPos,
|
||||
std::string sName,
|
||||
bool* pfNullified = NULL) const;
|
||||
|
||||
|
||||
bool clear() const;
|
||||
|
||||
|
||||
bool removeClaim(const std::string& name, const COutPoint& outPoint,
|
||||
int nHeight, int& nValidAtHeight, bool fCheckTakeover) const;
|
||||
|
||||
|
||||
bool addClaimToQueues(const std::string& name, CClaimValue& claim) const;
|
||||
bool removeClaimFromQueue(const std::string& name, const COutPoint& outPoint,
|
||||
CClaimValue& claim) const;
|
||||
void addToExpirationQueue(int nExpirationHeight, nameOutPointType& entry) const;
|
||||
void removeFromExpirationQueue(const std::string& name, const COutPoint& outPoint,
|
||||
int nHeight) const;
|
||||
|
||||
|
||||
claimQueueType::iterator getQueueCacheRow(int nHeight,
|
||||
bool createIfNotExists) const;
|
||||
queueNameType::iterator getQueueCacheNameRow(const std::string& name,
|
||||
bool createIfNotExists) const;
|
||||
expirationQueueType::iterator getExpirationQueueCacheRow(int nHeight,
|
||||
bool createIfNotExists) const;
|
||||
|
||||
|
||||
bool removeSupport(const std::string& name, const COutPoint& outPoint,
|
||||
int nHeight, int& nValidAtHeight,
|
||||
bool fCheckTakeover) const;
|
||||
bool removeSupportFromMap(const std::string& name, const COutPoint& outPoint,
|
||||
CSupportValue& support,
|
||||
bool fCheckTakeover) const;
|
||||
|
||||
|
||||
bool insertSupportIntoMap(const std::string& name,
|
||||
CSupportValue support,
|
||||
bool fCheckTakeover) const;
|
||||
|
||||
|
||||
supportQueueType::iterator getSupportQueueCacheRow(int nHeight,
|
||||
bool createIfNotExists) const;
|
||||
queueNameType::iterator getSupportQueueCacheNameRow(const std::string& name,
|
||||
@@ -558,12 +604,12 @@ private:
|
||||
void removeSupportFromExpirationQueue(const std::string& name,
|
||||
const COutPoint& outPoint,
|
||||
int nHeight) const;
|
||||
|
||||
|
||||
bool getSupportsForName(const std::string& name,
|
||||
supportMapEntryType& node) const;
|
||||
|
||||
bool getLastTakeoverForName(const std::string& name, int& lastTakeoverHeight) const;
|
||||
|
||||
|
||||
int getDelayForName(const std::string& name) const;
|
||||
|
||||
uint256 getLeafHashForProof(const std::string& currentPosition, unsigned char nodeChar,
|
||||
|
||||
@@ -13,7 +13,7 @@
|
||||
* for both bitcoind and bitcoin-core, to make it harder for attackers to
|
||||
* target servers or GUI users specifically.
|
||||
*/
|
||||
const std::string CLIENT_NAME("Satoshi");
|
||||
const std::string CLIENT_NAME("LBRY");
|
||||
|
||||
/**
|
||||
* Client version number
|
||||
|
||||
@@ -16,11 +16,11 @@
|
||||
//! These need to be macros, as clientversion.cpp's and bitcoin*-res.rc's voodoo requires it
|
||||
#define CLIENT_VERSION_MAJOR 0
|
||||
#define CLIENT_VERSION_MINOR 12
|
||||
#define CLIENT_VERSION_REVISION 99
|
||||
#define CLIENT_VERSION_REVISION 2
|
||||
#define CLIENT_VERSION_BUILD 0
|
||||
|
||||
//! Set to true for release, false for prerelease or test build
|
||||
#define CLIENT_VERSION_IS_RELEASE false
|
||||
#define CLIENT_VERSION_IS_RELEASE true
|
||||
|
||||
/**
|
||||
* Copyright year (2009-this)
|
||||
|
||||
@@ -58,6 +58,14 @@ struct Params {
|
||||
bool fPowNoRetargeting;
|
||||
int64_t nPowTargetSpacing;
|
||||
int64_t nPowTargetTimespan;
|
||||
int64_t nOriginalClaimExpirationTime;
|
||||
int64_t nExtendedClaimExpirationTime;
|
||||
int64_t nExtendedClaimExpirationForkHeight;
|
||||
int64_t GetExpirationTime(int64_t nHeight) const {
|
||||
return nHeight < nExtendedClaimExpirationForkHeight ?
|
||||
nOriginalClaimExpirationTime :
|
||||
nExtendedClaimExpirationTime;
|
||||
}
|
||||
int64_t DifficultyAdjustmentInterval() const { return nPowTargetTimespan / nPowTargetSpacing; }
|
||||
};
|
||||
} // namespace Consensus
|
||||
|
||||
@@ -1229,6 +1229,8 @@ bool AppInit2(boost::thread_group& threadGroup, CScheduler& scheduler)
|
||||
LogPrintf("* Using %.1fMiB for chain state database\n", nCoinDBCache * (1.0 / 1024 / 1024));
|
||||
LogPrintf("* Using %.1fMiB for in-memory UTXO set\n", nCoinCacheUsage * (1.0 / 1024 / 1024));
|
||||
|
||||
const Consensus::Params& consensusParams = Params().GetConsensus();
|
||||
|
||||
bool fLoaded = false;
|
||||
while (!fLoaded) {
|
||||
bool fReset = fReindex;
|
||||
@@ -1266,7 +1268,7 @@ bool AppInit2(boost::thread_group& threadGroup, CScheduler& scheduler)
|
||||
|
||||
// If the loaded chain has a wrong genesis, bail out immediately
|
||||
// (we're likely using a testnet datadir, or the other way around).
|
||||
if (!mapBlockIndex.empty() && mapBlockIndex.count(chainparams.GetConsensus().hashGenesisBlock) == 0)
|
||||
if (!mapBlockIndex.empty() && mapBlockIndex.count(consensusParams.hashGenesisBlock) == 0)
|
||||
return InitError(_("Incorrect or no genesis block found. Wrong datadir for network?"));
|
||||
|
||||
// Initialize the block index (no-op if non-empty database was already loaded)
|
||||
@@ -1422,6 +1424,8 @@ bool AppInit2(boost::thread_group& threadGroup, CScheduler& scheduler)
|
||||
|
||||
RandAddSeedPerfmon();
|
||||
|
||||
pclaimTrie->setExpirationTime(consensusParams.GetExpirationTime(chainActive.Height()));
|
||||
|
||||
//// debug print
|
||||
LogPrintf("mapBlockIndex.size() = %u\n", mapBlockIndex.size());
|
||||
LogPrintf("nBestHeight = %d\n", chainActive.Height());
|
||||
@@ -1437,7 +1441,7 @@ bool AppInit2(boost::thread_group& threadGroup, CScheduler& scheduler)
|
||||
StartNode(threadGroup, scheduler);
|
||||
|
||||
// Monitor the chain, and alert if we get blocks much quicker or slower than expected
|
||||
int64_t nPowTargetSpacing = Params().GetConsensus().nPowTargetSpacing;
|
||||
int64_t nPowTargetSpacing = consensusParams.nPowTargetSpacing;
|
||||
CScheduler::Function f = boost::bind(&PartitionCheck, &IsInitialBlockDownload,
|
||||
boost::ref(cs_main), boost::cref(pindexBestHeader), nPowTargetSpacing);
|
||||
scheduler.scheduleEvery(f, nPowTargetSpacing);
|
||||
|
||||
@@ -1,6 +1,7 @@
|
||||
#include "lbry.h"
|
||||
#include "uint256.h"
|
||||
#include "lbry.h"
|
||||
#include "uint256.h"
|
||||
#include <cstdio>
|
||||
|
||||
unsigned int CalculateLbryNextWorkRequired(const CBlockIndex* pindexLast, int64_t nFirstBlockTime, const Consensus::Params& params)
|
||||
{
|
||||
if (params.fPowNoRetargeting)
|
||||
@@ -26,9 +27,7 @@ unsigned int CalculateLbryNextWorkRequired(const CBlockIndex* pindexLast, int64_
|
||||
// Retarget
|
||||
const arith_uint256 bnPowLimit = UintToArith256(params.powLimit);
|
||||
arith_uint256 bnNew;
|
||||
arith_uint256 bnOld;
|
||||
bnNew.SetCompact(pindexLast->nBits);
|
||||
bnOld = bnNew;
|
||||
bnNew *= nModulatedTimespan;
|
||||
bnNew /= retargetTimespan;
|
||||
if (bnNew > bnPowLimit)
|
||||
|
||||
@@ -82,6 +82,7 @@ bool fEnableReplacement = DEFAULT_ENABLE_REPLACEMENT;
|
||||
|
||||
CFeeRate minRelayTxFee = CFeeRate(DEFAULT_MIN_RELAY_TX_FEE);
|
||||
CAmount maxTxFee = DEFAULT_TRANSACTION_MAXFEE;
|
||||
CAmount minFeePerNameClaimChar = MIN_FEE_PER_NAMECLAIM_CHAR;
|
||||
|
||||
CTxMemPool mempool(::minRelayTxFee);
|
||||
FeeFilterRounder filterRounder(::minRelayTxFee);
|
||||
@@ -1194,6 +1195,14 @@ bool AcceptToMemoryPoolWorker(CTxMemPool& pool, CValidationState& state, const C
|
||||
return state.DoS(0, false, REJECT_NONSTANDARD, "bad-txns-too-many-sigops", false,
|
||||
strprintf("%d", nSigOps));
|
||||
|
||||
// If a ClaimTrie transaction, it must meet the minimum fee requirement due to
|
||||
// it consuming extra system resources, compared to an ordinary transaction
|
||||
CAmount minClaimTrieFee = CalcMinClaimTrieFee(tx, minFeePerNameClaimChar);
|
||||
if (nModifiedFees < minClaimTrieFee) {
|
||||
return state.DoS(0, false, REJECT_INSUFFICIENTFEE, "minimum claim trie fee not met", false,
|
||||
strprintf("%d < %d", nFees, minClaimTrieFee));
|
||||
}
|
||||
|
||||
CAmount mempoolRejectFee = pool.GetMinFee(GetArg("-maxmempool", DEFAULT_MAX_MEMPOOL_SIZE) * 1000000).GetFee(nSize);
|
||||
if (mempoolRejectFee > 0 && nModifiedFees < mempoolRejectFee) {
|
||||
return state.DoS(0, false, REJECT_INSUFFICIENTFEE, "mempool min fee not met", false, strprintf("%d < %d", nFees, mempoolRejectFee));
|
||||
@@ -1201,7 +1210,6 @@ bool AcceptToMemoryPoolWorker(CTxMemPool& pool, CValidationState& state, const C
|
||||
// Require that free transactions have sufficient priority to be mined in the next block.
|
||||
return state.DoS(0, false, REJECT_INSUFFICIENTFEE, "insufficient priority");
|
||||
}
|
||||
|
||||
// Continuously rate-limit free (really, very-low-fee) transactions
|
||||
// This mitigates 'penny-flooding' -- sending thousands of free transactions just to
|
||||
// be annoying or make others' transactions take longer to confirm.
|
||||
@@ -2163,12 +2171,22 @@ bool DisconnectBlock(const CBlock& block, CValidationState& state, const CBlockI
|
||||
if (op == OP_CLAIM_NAME)
|
||||
{
|
||||
assert(vvchParams.size() == 2);
|
||||
std::string name(vvchParams[0].begin(), vvchParams[0].end());
|
||||
std::string value(vvchParams[1].begin(), vvchParams[1].end());
|
||||
claimId = ClaimIdHash(hash, i);
|
||||
LogPrintf("--- %s[%lu]: OP_CLAIM_NAME \"%s\" = \"%s\" with claimId %s and tx prevout %s at index %d\n",
|
||||
__func__, pindex->nHeight, name, SanitizeString(value),
|
||||
claimId.GetHex(), hash.ToString(), i);
|
||||
}
|
||||
else if (op == OP_UPDATE_CLAIM)
|
||||
{
|
||||
assert(vvchParams.size() == 3);
|
||||
std::string name(vvchParams[0].begin(), vvchParams[0].end());
|
||||
std::string value(vvchParams[1].begin(), vvchParams[1].end());
|
||||
claimId = uint160(vvchParams[1]);
|
||||
LogPrintf("--- %s[%lu]: OP_UPDATE_CLAIM \"%s\" = \"%s\" with claimId %s and tx prevout %s at index %d\n",
|
||||
__func__, pindex->nHeight, name, SanitizeString(value),
|
||||
claimId.GetHex(), hash.ToString(), i);
|
||||
}
|
||||
std::string name(vvchParams[0].begin(), vvchParams[0].end());
|
||||
LogPrintf("%s: (txid: %s, nOut: %d) Trying to remove %s from the claim trie due to its block being disconnected\n", __func__, hash.ToString(), i, name.c_str());
|
||||
@@ -2182,6 +2200,8 @@ bool DisconnectBlock(const CBlock& block, CValidationState& state, const CBlockI
|
||||
assert(vvchParams.size() == 2);
|
||||
std::string name(vvchParams[0].begin(), vvchParams[0].end());
|
||||
uint160 supportedClaimId(vvchParams[1]);
|
||||
LogPrintf("--- %s[%lu]: OP_SUPPORT_CLAIM \"%s\" with claimId %s and tx prevout %s at index %d\n",
|
||||
__func__, pindex->nHeight, name, supportedClaimId.GetHex(), hash.ToString(), i);
|
||||
LogPrintf("%s: (txid: %s, nOut: %d) Removing support for claim id %s on %s due to its block being disconnected\n", __func__, hash.ToString(), i, supportedClaimId.ToString(), name.c_str());
|
||||
if (!trieCache.undoAddSupport(name, COutPoint(hash, i), pindex->nHeight))
|
||||
LogPrintf("%s: Something went wrong removing support for name %s in hash %s\n", __func__, name.c_str(), hash.ToString());
|
||||
@@ -2212,6 +2232,13 @@ bool DisconnectBlock(const CBlock& block, CValidationState& state, const CBlockI
|
||||
assert(trieCache.finalizeDecrement());
|
||||
trieCache.setBestBlock(pindex->pprev->GetBlockHash());
|
||||
assert(trieCache.getMerkleHash() == pindex->pprev->hashClaimTrie);
|
||||
if (pindex->nHeight == Params().GetConsensus().nExtendedClaimExpirationForkHeight)
|
||||
{
|
||||
LogPrintf("Decremented past the extended claim expiration hard fork height");
|
||||
pclaimTrie->setExpirationTime(Params().GetConsensus().GetExpirationTime(pindex->nHeight-1));
|
||||
trieCache.forkForExpirationChange(false);
|
||||
}
|
||||
|
||||
|
||||
if (pfClean) {
|
||||
*pfClean = fClean;
|
||||
@@ -2472,6 +2499,15 @@ bool ConnectBlock(const CBlock& block, CValidationState& state, CBlockIndex* pin
|
||||
flags |= SCRIPT_VERIFY_CHECKSEQUENCEVERIFY;
|
||||
nLockTimeFlags |= LOCKTIME_VERIFY_SEQUENCE;
|
||||
}
|
||||
|
||||
// v 13 LBRYcrd hard fork to extend expiration time
|
||||
if (pindex->nHeight == Params().GetConsensus().nExtendedClaimExpirationForkHeight)
|
||||
{
|
||||
LogPrintf("Incremented past the extended claim expiration hard fork height");
|
||||
pclaimTrie->setExpirationTime(chainparams.GetConsensus().GetExpirationTime(pindex->nHeight));
|
||||
trieCache.forkForExpirationChange(true);
|
||||
}
|
||||
|
||||
|
||||
int64_t nTime2 = GetTimeMicros(); nTimeForks += nTime2 - nTime1;
|
||||
LogPrint("bench", " - Fork checks: %.2fms [%.2fs]\n", 0.001 * (nTime2 - nTime1), nTimeForks * 0.000001);
|
||||
@@ -2565,12 +2601,22 @@ bool ConnectBlock(const CBlock& block, CValidationState& state, CBlockIndex* pin
|
||||
if (op == OP_CLAIM_NAME)
|
||||
{
|
||||
assert(vvchParams.size() == 2);
|
||||
std::string name(vvchParams[0].begin(), vvchParams[0].end());
|
||||
std::string value(vvchParams[1].begin(), vvchParams[1].end());
|
||||
claimId = ClaimIdHash(txin.prevout.hash, txin.prevout.n);
|
||||
LogPrintf("+++ %s[%lu]: OP_CLAIM_NAME \"%s\" = \"%s\" with claimId %s and tx prevout %s at index %d\n",
|
||||
__func__, pindex->nHeight, name, SanitizeString(value),
|
||||
claimId.GetHex(), txin.prevout.hash.GetHex(), txin.prevout.n);
|
||||
}
|
||||
else if (op == OP_UPDATE_CLAIM)
|
||||
{
|
||||
assert(vvchParams.size() == 3);
|
||||
std::string name(vvchParams[0].begin(), vvchParams[0].end());
|
||||
std::string value(vvchParams[1].begin(), vvchParams[1].end());
|
||||
claimId = uint160(vvchParams[1]);
|
||||
LogPrintf("+++ %s[%lu]: OP_UPDATE_CLAIM \"%s\" = \"%s\" with claimId %s and tx prevout %s at index %d\n",
|
||||
__func__, pindex->nHeight, name, SanitizeString(value),
|
||||
claimId.GetHex(), txin.prevout.hash.GetHex(), txin.prevout.n);
|
||||
}
|
||||
std::string name(vvchParams[0].begin(), vvchParams[0].end());
|
||||
int nValidAtHeight;
|
||||
@@ -2587,11 +2633,14 @@ bool ConnectBlock(const CBlock& block, CValidationState& state, CBlockIndex* pin
|
||||
assert(vvchParams.size() == 2);
|
||||
std::string name(vvchParams[0].begin(), vvchParams[0].end());
|
||||
uint160 supportedClaimId(vvchParams[1]);
|
||||
LogPrintf("+++ %s[%lu]: OP_SUPPORT_CLAIM \"%s\" with claimId %s and tx prevout %s at index %d\n",
|
||||
__func__, pindex->nHeight, name,
|
||||
supportedClaimId.GetHex(), txin.prevout.hash.GetHex(), txin.prevout.n);
|
||||
int nValidAtHeight;
|
||||
LogPrintf("%s: Removing support for %s in %s. Tx: %s, nOut: %d\n", __func__, supportedClaimId.ToString(), name, txin.prevout.hash.ToString(), txin.prevout.n);
|
||||
LogPrintf("%s: Removing support for %s in %s. Tx: %s, nOut: %d, removed txid: %s\n", __func__, supportedClaimId.ToString(), name, txin.prevout.hash.ToString(), txin.prevout.n,tx.GetHash().ToString());
|
||||
if (trieCache.spendSupport(name, COutPoint(txin.prevout.hash, txin.prevout.n), coins->nHeight, nValidAtHeight))
|
||||
{
|
||||
mClaimUndoHeights[0] = nValidAtHeight;
|
||||
mClaimUndoHeights[i] = nValidAtHeight;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
@@ -50,7 +50,7 @@ static const bool DEFAULT_WHITELISTFORCERELAY = true;
|
||||
/** Default for -minrelaytxfee, minimum relay fee for transactions */
|
||||
static const unsigned int DEFAULT_MIN_RELAY_TX_FEE = 1000;
|
||||
//! -maxtxfee default
|
||||
static const CAmount DEFAULT_TRANSACTION_MAXFEE = 0.1 * COIN;
|
||||
static const CAmount DEFAULT_TRANSACTION_MAXFEE = 1 * COIN;
|
||||
//! Discourage users to set fees higher than this amount (in satoshis) per kB
|
||||
static const CAmount HIGH_TX_FEE_PER_KB = 0.01 * COIN;
|
||||
//! -maxtxfee will warn if called with a higher fee than this amount (in satoshis)
|
||||
@@ -163,6 +163,9 @@ extern size_t nCoinCacheUsage;
|
||||
extern CFeeRate minRelayTxFee;
|
||||
/** Absolute maximum transaction fee (in satoshis) used by wallet and mempool (rejects high fee in sendrawtransaction) */
|
||||
extern CAmount maxTxFee;
|
||||
/** Used to calculate minimum fee for claim trie transactions **/
|
||||
extern CAmount minFeePerNameClaimChar;
|
||||
|
||||
/** If the tip is older than this (in seconds), the node is considered to be in initial block download. */
|
||||
extern int64_t nMaxTipAge;
|
||||
extern bool fEnableReplacement;
|
||||
|
||||
@@ -1,7 +1,9 @@
|
||||
#include <boost/foreach.hpp>
|
||||
#include "nameclaim.h"
|
||||
#include "hash.h"
|
||||
#include "util.h"
|
||||
|
||||
|
||||
std::vector<unsigned char> uint32_t_to_vch(uint32_t n)
|
||||
{
|
||||
std::vector<unsigned char> vchN;
|
||||
@@ -25,6 +27,29 @@ uint32_t vch_to_uint32_t(std::vector<unsigned char>& vchN)
|
||||
return n;
|
||||
}
|
||||
|
||||
CScript ClaimNameScript(std::string name, std::string value)
|
||||
{
|
||||
std::vector<unsigned char> vchName(name.begin(), name.end());
|
||||
std::vector<unsigned char> vchValue(value.begin(), value.end());
|
||||
return CScript() << OP_CLAIM_NAME << vchName << vchValue << OP_2DROP << OP_DROP << OP_TRUE;
|
||||
|
||||
}
|
||||
CScript SupportClaimScript(std::string name, uint160 claimId)
|
||||
{
|
||||
std::vector<unsigned char> vchName(name.begin(), name.end());
|
||||
std::vector<unsigned char> vchClaimId(claimId.begin(),claimId.end());
|
||||
return CScript() << OP_SUPPORT_CLAIM << vchName << vchClaimId << OP_2DROP << OP_DROP << OP_TRUE;
|
||||
}
|
||||
CScript UpdateClaimScript(std::string name, uint160 claimId, std::string value)
|
||||
{
|
||||
std::vector<unsigned char> vchName(name.begin(), name.end());
|
||||
std::vector<unsigned char> vchClaimId(claimId.begin(),claimId.end());
|
||||
std::vector<unsigned char> vchValue(value.begin(), value.end());
|
||||
return CScript() << OP_UPDATE_CLAIM << vchName << vchClaimId << vchValue << OP_2DROP << OP_2DROP << OP_TRUE;
|
||||
|
||||
}
|
||||
|
||||
|
||||
bool DecodeClaimScript(const CScript& scriptIn, int& op, std::vector<std::vector<unsigned char> >& vvchParams)
|
||||
{
|
||||
CScript::const_iterator pc = scriptIn.begin();
|
||||
@@ -150,3 +175,27 @@ size_t ClaimNameSize(const CScript& scriptIn)
|
||||
return vvchParams[0].size();
|
||||
}
|
||||
}
|
||||
|
||||
CAmount CalcMinClaimTrieFee(const CTransaction& tx, const CAmount &minFeePerNameClaimChar)
|
||||
{
|
||||
if (minFeePerNameClaimChar == 0)
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
|
||||
CAmount min_fee = 0;
|
||||
BOOST_FOREACH(const CTxOut& txout, tx.vout)
|
||||
{
|
||||
int op;
|
||||
std::vector<std::vector<unsigned char> > vvchParams;
|
||||
if (DecodeClaimScript(txout.scriptPubKey, op, vvchParams))
|
||||
{
|
||||
if (op == OP_CLAIM_NAME)
|
||||
{
|
||||
int claim_name_size = vvchParams[0].size();
|
||||
min_fee += claim_name_size*minFeePerNameClaimChar;
|
||||
}
|
||||
}
|
||||
}
|
||||
return min_fee;
|
||||
}
|
||||
@@ -1,19 +1,33 @@
|
||||
#ifndef BITCOIN_NAMECLAIM_H
|
||||
#define BITCOIN_NAMECLAIM_H
|
||||
|
||||
#include "amount.h"
|
||||
#include "script/script.h"
|
||||
#include "primitives/transaction.h"
|
||||
#include "uint256.h"
|
||||
|
||||
#include <vector>
|
||||
|
||||
// This is the minimum claim fee per character in the name of an OP_CLAIM_NAME command that must
|
||||
// be attached to transactions for it to be accepted into the memory pool.
|
||||
// Rationale: current implementation of the claim trie uses more memory for longer name claims
|
||||
// due to the fact that each chracater is assigned a trie node regardless of whether it contains
|
||||
// any claims or not. In the future, we can switch to a radix tree implementation where
|
||||
// empty nodes do not take up any memory and the minimum fee can be priced on a per claim
|
||||
// basis.
|
||||
#define MIN_FEE_PER_NAMECLAIM_CHAR 200000
|
||||
|
||||
// This is the max claim script size in bytes, not including the script pubkey part of the script.
|
||||
// Scripts exceeding this size are rejected in CheckTransaction in main.cpp
|
||||
#define MAX_CLAIM_SCRIPT_SIZE 8192
|
||||
|
||||
// This is the max claim name size in bytes, for all claim trie transactions.
|
||||
// This is the max claim name size in bytes, for all claim trie transactions.
|
||||
// Scripts exceeding this size are rejected in CheckTransaction in main.cpp
|
||||
#define MAX_CLAIM_NAME_SIZE 255
|
||||
|
||||
CScript ClaimNameScript(std::string name, std::string value);
|
||||
CScript SupportClaimScript(std::string name, uint160 claimId);
|
||||
CScript UpdateClaimScript(std::string name, uint160 claimId, std::string value);
|
||||
bool DecodeClaimScript(const CScript& scriptIn, int& op, std::vector<std::vector<unsigned char> >& vvchParams);
|
||||
bool DecodeClaimScript(const CScript& scriptIn, int& op, std::vector<std::vector<unsigned char> >& vvchParams, CScript::const_iterator& pc);
|
||||
CScript StripClaimScriptPrefix(const CScript& scriptIn);
|
||||
@@ -21,9 +35,11 @@ CScript StripClaimScriptPrefix(const CScript& scriptIn, int& op);
|
||||
uint160 ClaimIdHash(const uint256& txhash, uint32_t nOut);
|
||||
std::vector<unsigned char> uint32_t_to_vch(uint32_t n);
|
||||
uint32_t vch_to_uint32_t(std::vector<unsigned char>& vchN);
|
||||
// get size of the claim script, minus the script pubkey part
|
||||
// get size of the claim script, minus the script pubkey part
|
||||
size_t ClaimScriptSize(const CScript& scriptIn);
|
||||
// get size of the name in a claim script, returns 0 if scriptin is not a claimetrie transaction
|
||||
size_t ClaimNameSize(const CScript& scriptIn);
|
||||
// get size of the name in a claim script, returns 0 if scriptin is not a claimetrie transaction
|
||||
size_t ClaimNameSize(const CScript& scriptIn);
|
||||
// calculate the minimum fee (mempool rule) required for transaction
|
||||
CAmount CalcMinClaimTrieFee(const CTransaction& tx, const CAmount &minFeePerNameClaimChar);
|
||||
|
||||
#endif // BITCOIN_NAMECLAIM_H
|
||||
@@ -14,31 +14,21 @@
|
||||
unsigned int GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlockHeader *pblock, const Consensus::Params& params)
|
||||
{
|
||||
unsigned int nProofOfWorkLimit = UintToArith256(params.powLimit).GetCompact();
|
||||
|
||||
// Genesis block
|
||||
if (pindexLast == NULL)
|
||||
return nProofOfWorkLimit;
|
||||
|
||||
// Only change once per difficulty adjustment interval
|
||||
if ((pindexLast->nHeight+1) % params.DifficultyAdjustmentInterval() != 0)
|
||||
if (params.fPowAllowMinDifficultyBlocks && pindexLast->nHeight >= 277299)
|
||||
{
|
||||
if (params.fPowAllowMinDifficultyBlocks)
|
||||
{
|
||||
// Special difficulty rule for testnet:
|
||||
// If the new block's timestamp is more than 2* 10 minutes
|
||||
// then allow mining of a min-difficulty block.
|
||||
if (pblock->GetBlockTime() > pindexLast->GetBlockTime() + params.nPowTargetSpacing*2)
|
||||
return nProofOfWorkLimit;
|
||||
else
|
||||
{
|
||||
// Return the last non-special-min-difficulty-rules-block
|
||||
const CBlockIndex* pindex = pindexLast;
|
||||
while (pindex->pprev && pindex->nHeight % params.DifficultyAdjustmentInterval() != 0 && pindex->nBits == nProofOfWorkLimit)
|
||||
pindex = pindex->pprev;
|
||||
return pindex->nBits;
|
||||
}
|
||||
// Special difficulty rule for testnet:
|
||||
// If the new block's timestamp is twice the target block time
|
||||
// then allow mining of a min-difficulty block.
|
||||
// This is to prevent the testnet from gettig stuck when a large amount
|
||||
// of hashrate drops off the network.
|
||||
// This rule was not implemented properly until testnet block 277299.
|
||||
if (pblock->GetBlockTime() > pindexLast->GetBlockTime() + params.nPowTargetSpacing*2){
|
||||
return nProofOfWorkLimit;
|
||||
}
|
||||
return pindexLast->nBits;
|
||||
}
|
||||
|
||||
// Go back the full period unless it's the first retarget after genesis.
|
||||
|
||||
@@ -170,15 +170,19 @@ public:
|
||||
// 546*minRelayTxFee/1000 (in satoshis)
|
||||
if (scriptPubKey.IsUnspendable())
|
||||
return 0;
|
||||
|
||||
size_t nSize = GetSerializeSize(SER_DISK,0)+148u;
|
||||
return 3*minRelayTxFee.GetFee(nSize);
|
||||
|
||||
// for lbrycrd this is mainly to prevent 0 value claims
|
||||
// and some spam protection without limiting small
|
||||
// lbrynet transactions
|
||||
return 1;
|
||||
// below is original bitcoin core code
|
||||
//size_t nSize = GetSerializeSize(SER_DISK,0)+dd148u;
|
||||
//return 3*minRelayTxFee.GetFee(nSize);
|
||||
}
|
||||
|
||||
bool IsDust(const CFeeRate &minRelayTxFee) const
|
||||
{
|
||||
return false;
|
||||
// return (nValue < GetDustThreshold(minRelayTxFee));
|
||||
return (nValue < GetDustThreshold(minRelayTxFee));
|
||||
}
|
||||
|
||||
friend bool operator==(const CTxOut& a, const CTxOut& b)
|
||||
|
||||
@@ -40,9 +40,9 @@ QString BitcoinUnits::name(int unit)
|
||||
{
|
||||
switch(unit)
|
||||
{
|
||||
case BTC: return QString("BTC");
|
||||
case mBTC: return QString("mBTC");
|
||||
case uBTC: return QString::fromUtf8("μBTC");
|
||||
case BTC: return QString("LBC");
|
||||
case mBTC: return QString("mLBC");
|
||||
case uBTC: return QString::fromUtf8("μLBC");
|
||||
default: return QString("???");
|
||||
}
|
||||
}
|
||||
|
||||
@@ -4,6 +4,8 @@
|
||||
#include "univalue.h"
|
||||
#include "txmempool.h"
|
||||
|
||||
// Maximum block decrement that is allowed from rpc calls
|
||||
const int MAX_RPC_BLOCK_DECREMENTS = 50;
|
||||
|
||||
UniValue getclaimsintrie(const UniValue& params, bool fHelp)
|
||||
{
|
||||
@@ -19,6 +21,7 @@ UniValue getclaimsintrie(const UniValue& params, bool fHelp)
|
||||
" \"name\" (string) the name claimed\n"
|
||||
" \"claims\": [ (array of object) the claims for this name\n"
|
||||
" {\n"
|
||||
" \"claimId\" (string) the claimId of the claim\n"
|
||||
" \"txid\" (string) the txid of the claim\n"
|
||||
" \"n\" (numeric) the vout value of the claim\n"
|
||||
" \"amount\" (numeric) txout amount\n"
|
||||
@@ -46,6 +49,7 @@ UniValue getclaimsintrie(const UniValue& params, bool fHelp)
|
||||
for (std::vector<CClaimValue>::iterator itClaims = it->second.claims.begin(); itClaims != it->second.claims.end(); ++itClaims)
|
||||
{
|
||||
UniValue claim(UniValue::VOBJ);
|
||||
claim.push_back(Pair("claimId", itClaims->claimId.GetHex()));
|
||||
claim.push_back(Pair("txid", itClaims->outPoint.hash.GetHex()));
|
||||
claim.push_back(Pair("n", (int)itClaims->outPoint.n));
|
||||
claim.push_back(Pair("amount", ValueFromAmount(itClaims->nAmount)));
|
||||
@@ -123,6 +127,41 @@ UniValue getclaimtrie(const UniValue& params, bool fHelp)
|
||||
return ret;
|
||||
}
|
||||
|
||||
bool getValueForClaim(const COutPoint& out, std::string& sValue)
|
||||
{
|
||||
CCoinsViewCache view(pcoinsTip);
|
||||
const CCoins* coin = view.AccessCoins(out.hash);
|
||||
if (!coin)
|
||||
{
|
||||
LogPrintf("%s: %s does not exist in the coins view, despite being associated with a name\n",
|
||||
__func__, out.hash.GetHex());
|
||||
return true;
|
||||
}
|
||||
if (coin->vout.size() < out.n || coin->vout[out.n].IsNull())
|
||||
{
|
||||
LogPrintf("%s: the specified txout of %s appears to have been spent\n", __func__, out.hash.GetHex());
|
||||
return true;
|
||||
}
|
||||
|
||||
int op;
|
||||
std::vector<std::vector<unsigned char> > vvchParams;
|
||||
if (!DecodeClaimScript(coin->vout[out.n].scriptPubKey, op, vvchParams))
|
||||
{
|
||||
LogPrintf("%s: the specified txout of %s does not have a name claim command\n", __func__, out.hash.GetHex());
|
||||
return false;
|
||||
}
|
||||
if (op == OP_CLAIM_NAME)
|
||||
{
|
||||
sValue = std::string(vvchParams[1].begin(), vvchParams[1].end());
|
||||
}
|
||||
else if (op == OP_UPDATE_CLAIM)
|
||||
{
|
||||
sValue = std::string(vvchParams[2].begin(), vvchParams[2].end());
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
|
||||
UniValue getvalueforname(const UniValue& params, bool fHelp)
|
||||
{
|
||||
if (fHelp || params.size() != 1)
|
||||
@@ -133,6 +172,7 @@ UniValue getvalueforname(const UniValue& params, bool fHelp)
|
||||
"1. \"name\" (string) the name to look up\n"
|
||||
"Result: \n"
|
||||
"\"value\" (string) the value of the name, if it exists\n"
|
||||
"\"claimId\" (string) the claimId for this name claim\n"
|
||||
"\"txid\" (string) the hash of the transaction which successfully claimed the name\n"
|
||||
"\"n\" (numeric) vout value\n"
|
||||
"\"amount\" (numeric) txout amount\n"
|
||||
@@ -145,36 +185,239 @@ UniValue getvalueforname(const UniValue& params, bool fHelp)
|
||||
UniValue ret(UniValue::VOBJ);
|
||||
if (!pclaimTrie->getInfoForName(name, claim))
|
||||
return ret;
|
||||
CCoinsViewCache view(pcoinsTip);
|
||||
const CCoins* coin = view.AccessCoins(claim.outPoint.hash);
|
||||
if (!coin)
|
||||
{
|
||||
LogPrintf("%s: %s does not exist in the coins view, despite being associated with a name\n",
|
||||
__func__, claim.outPoint.hash.GetHex());
|
||||
std::string sValue;
|
||||
if (!getValueForClaim(claim.outPoint, sValue))
|
||||
return ret;
|
||||
}
|
||||
if (coin->vout.size() < claim.outPoint.n || coin->vout[claim.outPoint.n].IsNull())
|
||||
{
|
||||
LogPrintf("%s: the specified txout of %s appears to have been spent\n", __func__, claim.outPoint.hash.GetHex());
|
||||
return ret;
|
||||
}
|
||||
|
||||
int op;
|
||||
std::vector<std::vector<unsigned char> > vvchParams;
|
||||
if (!DecodeClaimScript(coin->vout[claim.outPoint.n].scriptPubKey, op, vvchParams))
|
||||
{
|
||||
LogPrintf("%s: the specified txout of %s does not have a name claim command\n", __func__, claim.outPoint.hash.GetHex());
|
||||
}
|
||||
std::string sValue(vvchParams[1].begin(), vvchParams[1].end());
|
||||
ret.push_back(Pair("value", sValue));
|
||||
ret.push_back(Pair("claimId", claim.claimId.GetHex()));
|
||||
ret.push_back(Pair("txid", claim.outPoint.hash.GetHex()));
|
||||
ret.push_back(Pair("n", (int)claim.outPoint.n));
|
||||
ret.push_back(Pair("amount", claim.nAmount));
|
||||
ret.push_back(Pair("effective amount", claim.nEffectiveAmount));
|
||||
ret.push_back(Pair("effective amount", pclaimTrie->getEffectiveAmountForClaim(name, claim.claimId)));
|
||||
ret.push_back(Pair("height", claim.nHeight));
|
||||
return ret;
|
||||
}
|
||||
|
||||
typedef std::pair<CClaimValue, std::vector<CSupportValue> > claimAndSupportsType;
|
||||
typedef std::map<uint160, claimAndSupportsType> claimSupportMapType;
|
||||
typedef std::map<uint160, std::vector<CSupportValue> > supportsWithoutClaimsMapType;
|
||||
|
||||
UniValue claimsAndSupportsToJSON(claimSupportMapType::const_iterator itClaimsAndSupports, int nCurrentHeight)
|
||||
{
|
||||
UniValue ret(UniValue::VOBJ);
|
||||
const CClaimValue claim = itClaimsAndSupports->second.first;
|
||||
const std::vector<CSupportValue> supports = itClaimsAndSupports->second.second;
|
||||
CAmount nEffectiveAmount = 0;
|
||||
UniValue supportObjs(UniValue::VARR);
|
||||
for (std::vector<CSupportValue>::const_iterator itSupports = supports.begin(); itSupports != supports.end(); ++itSupports)
|
||||
{
|
||||
UniValue supportObj(UniValue::VOBJ);
|
||||
supportObj.push_back(Pair("txid", itSupports->outPoint.hash.GetHex()));
|
||||
supportObj.push_back(Pair("n", (int)itSupports->outPoint.n));
|
||||
supportObj.push_back(Pair("nHeight", itSupports->nHeight));
|
||||
supportObj.push_back(Pair("nValidAtHeight", itSupports->nValidAtHeight));
|
||||
if (itSupports->nValidAtHeight < nCurrentHeight)
|
||||
{
|
||||
nEffectiveAmount += itSupports->nAmount;
|
||||
}
|
||||
supportObj.push_back(Pair("nAmount", itSupports->nAmount));
|
||||
supportObjs.push_back(supportObj);
|
||||
}
|
||||
ret.push_back(Pair("claimId", itClaimsAndSupports->first.GetHex()));
|
||||
ret.push_back(Pair("txid", claim.outPoint.hash.GetHex()));
|
||||
ret.push_back(Pair("n", (int)claim.outPoint.n));
|
||||
ret.push_back(Pair("nHeight", claim.nHeight));
|
||||
ret.push_back(Pair("nValidAtHeight", claim.nValidAtHeight));
|
||||
if (claim.nValidAtHeight < nCurrentHeight)
|
||||
{
|
||||
nEffectiveAmount += claim.nAmount;
|
||||
}
|
||||
ret.push_back(Pair("nAmount", claim.nAmount));
|
||||
std::string sValue;
|
||||
if (getValueForClaim(claim.outPoint, sValue))
|
||||
{
|
||||
ret.push_back(Pair("value", sValue));
|
||||
}
|
||||
ret.push_back(Pair("nEffectiveAmount", nEffectiveAmount));
|
||||
ret.push_back(Pair("supports", supportObjs));
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
UniValue supportsWithoutClaimsToJSON(supportsWithoutClaimsMapType::const_iterator itSupportsWithoutClaims, int nCurrentHeight)
|
||||
{
|
||||
const std::vector<CSupportValue> supports = itSupportsWithoutClaims->second;
|
||||
UniValue ret(UniValue::VOBJ);
|
||||
UniValue supportObjs(UniValue::VARR);
|
||||
ret.push_back(Pair("claimId (no matching claim)", itSupportsWithoutClaims->first.GetHex()));
|
||||
for (std::vector<CSupportValue>::const_iterator itSupports = supports.begin(); itSupports != supports.end(); ++itSupports)
|
||||
{
|
||||
UniValue supportObj(UniValue::VOBJ);
|
||||
supportObj.push_back(Pair("txid", itSupports->outPoint.hash.GetHex()));
|
||||
supportObj.push_back(Pair("n", (int)itSupports->outPoint.n));
|
||||
supportObj.push_back(Pair("nHeight", itSupports->nHeight));
|
||||
supportObj.push_back(Pair("nValidAtHeight", itSupports->nValidAtHeight));
|
||||
supportObj.push_back(Pair("nAmount", itSupports->nAmount));
|
||||
supportObjs.push_back(supportObj);
|
||||
}
|
||||
ret.push_back(Pair("supports", supportObjs));
|
||||
return ret;
|
||||
}
|
||||
|
||||
UniValue getclaimsforname(const UniValue& params, bool fHelp)
|
||||
{
|
||||
if (fHelp || params.size() != 1)
|
||||
throw std::runtime_error(
|
||||
"getclaimsforname\n"
|
||||
"Return all claims and supports for a name\n"
|
||||
"Arguments: \n"
|
||||
"1. \"name\" (string) the name for which to get claims and supports\n"
|
||||
"Result:\n"
|
||||
"{\n"
|
||||
" \"nLastTakeoverheight\" (numeric) the last height at which ownership of the name changed\n"
|
||||
" \"claims\": [ (array of object) claims for this name\n"
|
||||
" {\n"
|
||||
" \"claimId\" (string) the claimId of this claim\n"
|
||||
" \"txid\" (string) the txid of this claim\n"
|
||||
" \"n\" (numeric) the index of the claim in the transaction's list of outputs\n"
|
||||
" \"nHeight\" (numeric) the height at which the claim was included in the blockchain\n"
|
||||
" \"nValidAtHeight\" (numeric) the height at which the claim became/becomes valid\n"
|
||||
" \"nAmount\" (numeric) the amount of the claim\n"
|
||||
" \"nEffectiveAmount\" (numeric) the total effective amount of the claim, taking into effect whether the claim or support has reached its nValidAtHeight\n"
|
||||
" \"supports\" : [ (array of object) supports for this claim\n"
|
||||
" \"txid\" (string) the txid of the support\n"
|
||||
" \"n\" (numeric) the index of the support in the transaction's list of outputs\n"
|
||||
" \"nHeight\" (numeric) the height at which the support was included in the blockchain\n"
|
||||
" \"nValidAtHeight\" (numeric) the height at which the support became/becomes valid\n"
|
||||
" \"nAmount\" (numeric) the amount of the support\n"
|
||||
" ]\n"
|
||||
" }\n"
|
||||
" ],\n"
|
||||
" \"unmatched supports\": [ (array of object) supports that did not match a claim for this name\n"
|
||||
" {\n"
|
||||
" \"txid\" (string) the txid of the support\n"
|
||||
" \"n\" (numeric) the index of the support in the transaction's list of outputs\n"
|
||||
" \"nHeight\" (numeric) the height at which the support was included in the blockchain\n"
|
||||
" \"nValidAtHeight\" (numeric) the height at which the support became/becomes valid\n"
|
||||
" \"nAmount\" (numeric) the amount of the support\n"
|
||||
" }\n"
|
||||
" ]\n"
|
||||
"}\n"
|
||||
);
|
||||
|
||||
LOCK(cs_main);
|
||||
std::string name = params[0].get_str();
|
||||
claimsForNameType claimsForName = pclaimTrie->getClaimsForName(name);
|
||||
int nCurrentHeight = chainActive.Height();
|
||||
|
||||
claimSupportMapType claimSupportMap;
|
||||
supportsWithoutClaimsMapType supportsWithoutClaims;
|
||||
for (std::vector<CClaimValue>::const_iterator itClaims = claimsForName.claims.begin(); itClaims != claimsForName.claims.end(); ++itClaims)
|
||||
{
|
||||
claimAndSupportsType claimAndSupports = std::make_pair(*itClaims, std::vector<CSupportValue>());
|
||||
claimSupportMap.insert(std::pair<uint160, claimAndSupportsType>(itClaims->claimId, claimAndSupports));
|
||||
}
|
||||
for (std::vector<CSupportValue>::const_iterator itSupports = claimsForName.supports.begin(); itSupports != claimsForName.supports.end(); ++itSupports)
|
||||
{
|
||||
claimSupportMapType::iterator itClaimAndSupports = claimSupportMap.find(itSupports->supportedClaimId);
|
||||
if (itClaimAndSupports == claimSupportMap.end())
|
||||
{
|
||||
std::pair<supportsWithoutClaimsMapType::iterator, bool> ret = supportsWithoutClaims.insert(std::pair<uint160, std::vector<CSupportValue> >(itSupports->supportedClaimId, std::vector<CSupportValue>()));
|
||||
ret.first->second.push_back(*itSupports);
|
||||
}
|
||||
else
|
||||
{
|
||||
itClaimAndSupports->second.second.push_back(*itSupports);
|
||||
}
|
||||
}
|
||||
UniValue ret(UniValue::VOBJ);
|
||||
UniValue claimObjs(UniValue::VARR);
|
||||
ret.push_back(Pair("nLastTakeoverHeight", claimsForName.nLastTakeoverHeight));
|
||||
for (claimSupportMapType::const_iterator itClaimsAndSupports = claimSupportMap.begin(); itClaimsAndSupports != claimSupportMap.end(); ++itClaimsAndSupports)
|
||||
{
|
||||
UniValue claimAndSupportsObj = claimsAndSupportsToJSON(itClaimsAndSupports, nCurrentHeight);
|
||||
claimObjs.push_back(claimAndSupportsObj);
|
||||
}
|
||||
ret.push_back(Pair("claims", claimObjs));
|
||||
UniValue unmatchedSupports(UniValue::VARR);
|
||||
for (supportsWithoutClaimsMapType::const_iterator itSupportsWithoutClaims = supportsWithoutClaims.begin(); itSupportsWithoutClaims != supportsWithoutClaims.end(); ++itSupportsWithoutClaims)
|
||||
{
|
||||
UniValue supportsObj = supportsWithoutClaimsToJSON(itSupportsWithoutClaims, nCurrentHeight);
|
||||
unmatchedSupports.push_back(supportsObj);
|
||||
}
|
||||
ret.push_back(Pair("supports without claims", unmatchedSupports));
|
||||
return ret;
|
||||
}
|
||||
|
||||
UniValue getclaimbyid(const UniValue& params, bool fHelp)
|
||||
{
|
||||
if (fHelp || params.size() != 1)
|
||||
throw std::runtime_error(
|
||||
"getclaimbyid\n"
|
||||
"Get a claim by claim id\n"
|
||||
"Arguments: \n"
|
||||
"1. \"claimId\" (string) the claimId of this claim\n"
|
||||
"Result:\n"
|
||||
"{\n"
|
||||
" \"name\" (string) the name of the claim\n"
|
||||
" \"value\" (string) claim metadata\n"
|
||||
" \"claimId\" (string) the claimId of this claim\n"
|
||||
" \"txid\" (string) the hash of the transaction which has successfully claimed this name\n"
|
||||
" \"n\" (numeric) vout value\n"
|
||||
" \"amount\" (numeric) txout value\n"
|
||||
" \"effective amount\" (numeric) txout amount plus amount from all supports associated with the claim\n"
|
||||
" \"height\" (numeric) the height of the block in which this claim transaction is located\n"
|
||||
" \"supports\" (array of object) supports for this claim\n"
|
||||
" \"valid at height\" (numeric) the height at which the claim is valid\n"
|
||||
" [\n"
|
||||
" \"txid\" (string) the txid of the support\n"
|
||||
" \"n\" (numeric) the index of the support in the transaction's list of outputs\n"
|
||||
" \"height\" (numeric) the height at which the support was included in the blockchain\n"
|
||||
" \"valid at height\" (numeric) the height at which the support is valid\n"
|
||||
" \"amount\" (numeric) the amount of the support\n"
|
||||
" ]\n"
|
||||
"}\n"
|
||||
);
|
||||
|
||||
LOCK(cs_main);
|
||||
uint160 claimId;
|
||||
claimId.SetHex(params[0].get_str());
|
||||
UniValue claim(UniValue::VOBJ);
|
||||
std::string name;
|
||||
CClaimValue claimValue;
|
||||
pclaimTrie->getClaimById(claimId, name, claimValue);
|
||||
if (claimValue.claimId == claimId)
|
||||
{
|
||||
std::vector<CSupportValue> supports;
|
||||
CAmount effectiveAmount = pclaimTrie->getEffectiveAmountForClaimWithSupports(
|
||||
name, claimValue.claimId, supports);
|
||||
|
||||
std::string sValue;
|
||||
getValueForClaim(claimValue.outPoint, sValue);
|
||||
claim.push_back(Pair("name", name));
|
||||
claim.push_back(Pair("value", sValue));
|
||||
claim.push_back(Pair("claimId", claimValue.claimId.GetHex()));
|
||||
claim.push_back(Pair("txid", claimValue.outPoint.hash.GetHex()));
|
||||
claim.push_back(Pair("n", (int) claimValue.outPoint.n));
|
||||
claim.push_back(Pair("amount", claimValue.nAmount));
|
||||
claim.push_back(Pair("effective amount", effectiveAmount));
|
||||
UniValue supportList(UniValue::VARR);
|
||||
BOOST_FOREACH(const CSupportValue& support, supports) {
|
||||
UniValue supportEntry(UniValue::VOBJ);
|
||||
supportEntry.push_back(Pair("txid", support.outPoint.hash.GetHex()));
|
||||
supportEntry.push_back(Pair("n", (int)support.outPoint.n));
|
||||
supportEntry.push_back(Pair("height", support.nHeight));
|
||||
supportEntry.push_back(Pair("valid at height", support.nValidAtHeight));
|
||||
supportEntry.push_back(Pair("amount", support.nAmount));
|
||||
supportList.push_back(supportEntry);
|
||||
}
|
||||
claim.push_back(Pair("supports", supportList));
|
||||
claim.push_back(Pair("height", claimValue.nHeight));
|
||||
claim.push_back(Pair("valid at height", claimValue.nValidAtHeight));
|
||||
}
|
||||
return claim;
|
||||
}
|
||||
|
||||
UniValue gettotalclaimednames(const UniValue& params, bool fHelp)
|
||||
{
|
||||
if (fHelp || params.size() != 0)
|
||||
@@ -513,7 +756,7 @@ UniValue getnameproof(const UniValue& params, bool fHelp)
|
||||
if (!chainActive.Contains(pblockIndex))
|
||||
throw JSONRPCError(RPC_INTERNAL_ERROR, "Block not in main chain");
|
||||
|
||||
if (chainActive.Tip()->nHeight > (pblockIndex->nHeight + 20))
|
||||
if (chainActive.Tip()->nHeight > (pblockIndex->nHeight + MAX_RPC_BLOCK_DECREMENTS))
|
||||
throw JSONRPCError(RPC_INTERNAL_ERROR, "Block too deep to generate proof");
|
||||
|
||||
CClaimTrieProof proof;
|
||||
@@ -529,11 +772,13 @@ static const CRPCCommand commands[] =
|
||||
{ "Claimtrie", "getclaimsintrie", &getclaimsintrie, true },
|
||||
{ "Claimtrie", "getclaimtrie", &getclaimtrie, true },
|
||||
{ "Claimtrie", "getvalueforname", &getvalueforname, true },
|
||||
{ "Claimtrie", "getclaimsforname", &getclaimsforname, true },
|
||||
{ "Claimtrie", "gettotalclaimednames", &gettotalclaimednames, true },
|
||||
{ "Claimtrie", "gettotalclaims", &gettotalclaims, true },
|
||||
{ "Claimtrie", "gettotalvalueofclaims", &gettotalvalueofclaims, true },
|
||||
{ "Claimtrie", "getclaimsfortx", &getclaimsfortx, true },
|
||||
{ "Claimtrie", "getnameproof", &getnameproof, true },
|
||||
{ "Claimtrie", "getclaimbyid", &getclaimbyid, true },
|
||||
};
|
||||
|
||||
void RegisterClaimTrieRPCCommands(CRPCTable &tableRPC)
|
||||
|
||||
@@ -658,9 +658,7 @@ UniValue getblocktemplate(const UniValue& params, bool fHelp)
|
||||
result.push_back(Pair("curtime", pblock->GetBlockTime()));
|
||||
result.push_back(Pair("bits", strprintf("%08x", pblock->nBits)));
|
||||
result.push_back(Pair("height", (int64_t)(pindexPrev->nHeight+1)));
|
||||
|
||||
if (pclaimTrie)
|
||||
result.push_back(Pair("claimtrie", pclaimTrie->getMerkleHash().GetHex()));
|
||||
result.push_back(Pair("claimtrie", pblock->hashClaimTrie.GetHex()));
|
||||
|
||||
return result;
|
||||
}
|
||||
|
||||
@@ -2768,5 +2768,64 @@ BOOST_AUTO_TEST_CASE(claimtrievalue_proof)
|
||||
|
||||
}
|
||||
|
||||
// Check that blocks with bogus calimtrie hash is rejected
|
||||
BOOST_AUTO_TEST_CASE(bogus_claimtrie_hash)
|
||||
{
|
||||
fRequireStandard = false;
|
||||
BOOST_CHECK(pclaimTrie->nCurrentHeight = chainActive.Height() + 1);
|
||||
LOCK(cs_main);
|
||||
std::string sName("test");
|
||||
std::string sValue1("test");
|
||||
|
||||
std::vector<unsigned char> vchName(sName.begin(), sName.end());
|
||||
std::vector<unsigned char> vchValue1(sValue1.begin(), sValue1.end());
|
||||
|
||||
std::vector<CTransaction> coinbases;
|
||||
|
||||
BOOST_CHECK(CreateCoinbases(3, coinbases));
|
||||
|
||||
int orig_chain_height = chainActive.Height();
|
||||
|
||||
CMutableTransaction tx1 = BuildTransaction(coinbases[0]);
|
||||
tx1.vout[0].scriptPubKey = CScript() << OP_CLAIM_NAME << vchName << vchValue1 << OP_2DROP << OP_DROP << OP_TRUE;
|
||||
tx1.vout[0].nValue = 1;
|
||||
COutPoint tx1OutPoint(tx1.GetHash(), 0);
|
||||
|
||||
AddToMempool(tx1);
|
||||
|
||||
CBlockTemplate *pblockTemp;
|
||||
BOOST_CHECK(pblockTemp = CreateNewBlock(Params(), scriptPubKey));
|
||||
pblockTemp->block.hashPrevBlock = chainActive.Tip()->GetBlockHash();
|
||||
pblockTemp->block.nVersion = 1;
|
||||
pblockTemp->block.nTime = chainActive.Tip()->GetBlockTime()+Params().GetConsensus().nPowTargetSpacing;
|
||||
CMutableTransaction txCoinbase(pblockTemp->block.vtx[0]);
|
||||
txCoinbase.vin[0].scriptSig = CScript() << CScriptNum(chainActive.Height());
|
||||
txCoinbase.vout[0].nValue = GetBlockSubsidy(chainActive.Height() + 1, Params().GetConsensus());
|
||||
pblockTemp->block.vtx[0] = CTransaction(txCoinbase);
|
||||
pblockTemp->block.hashMerkleRoot = BlockMerkleRoot(pblockTemp->block);
|
||||
//create bogus hash
|
||||
|
||||
uint256 bogusHashClaimTrie;
|
||||
bogusHashClaimTrie.SetHex("aaa");
|
||||
pblockTemp->block.hashClaimTrie = bogusHashClaimTrie;
|
||||
|
||||
for (int i = 0; ; ++i)
|
||||
{
|
||||
pblockTemp->block.nNonce = i;
|
||||
if (CheckProofOfWork(pblockTemp->block.GetPoWHash(), pblockTemp->block.nBits, Params().GetConsensus()))
|
||||
{
|
||||
break;
|
||||
}
|
||||
}
|
||||
CValidationState state;
|
||||
bool success = ProcessNewBlock(state, Params(), NULL, &pblockTemp->block, true, NULL);
|
||||
// will process , but will not be connected
|
||||
BOOST_CHECK(success);
|
||||
BOOST_CHECK(state.IsValid());
|
||||
BOOST_CHECK(pblockTemp->block.GetHash() != chainActive.Tip()->GetBlockHash());
|
||||
BOOST_CHECK_EQUAL(orig_chain_height,chainActive.Height());
|
||||
delete pblockTemp;
|
||||
|
||||
}
|
||||
|
||||
BOOST_AUTO_TEST_SUITE_END()
|
||||
@@ -0,0 +1,92 @@
|
||||
#include "claimtrie.h"
|
||||
#include "main.h"
|
||||
#include "uint256.h"
|
||||
|
||||
#include "test/test_bitcoin.h"
|
||||
#include <boost/test/unit_test.hpp>
|
||||
using namespace std;
|
||||
|
||||
|
||||
class CClaimTrieCacheTest : public CClaimTrieCache {
|
||||
public:
|
||||
CClaimTrieCacheTest(CClaimTrie* base):
|
||||
CClaimTrieCache(base, false){}
|
||||
|
||||
bool recursiveComputeMerkleHash(CClaimTrieNode* tnCurrent,
|
||||
std::string sPos) const
|
||||
{
|
||||
return CClaimTrieCache::recursiveComputeMerkleHash(tnCurrent, sPos);
|
||||
}
|
||||
|
||||
bool recursivePruneName(CClaimTrieNode* tnCurrent, unsigned int nPos, std::string sName, bool* pfNullified) const
|
||||
{
|
||||
return CClaimTrieCache::recursivePruneName(tnCurrent,nPos,sName, pfNullified);
|
||||
}
|
||||
int cacheSize()
|
||||
{
|
||||
return cache.size();
|
||||
}
|
||||
|
||||
nodeCacheType::iterator getCache(std::string key)
|
||||
{
|
||||
return cache.find(key);
|
||||
}
|
||||
|
||||
};
|
||||
|
||||
BOOST_FIXTURE_TEST_SUITE(claimtriecache_tests, RegTestingSetup)
|
||||
|
||||
|
||||
BOOST_AUTO_TEST_CASE(merklehash_test)
|
||||
{
|
||||
// check empty trie
|
||||
uint256 one(uint256S("0000000000000000000000000000000000000000000000000000000000000001"));
|
||||
CClaimTrieCacheTest cc(pclaimTrie);
|
||||
BOOST_CHECK(one == cc.getMerkleHash());
|
||||
|
||||
// check trie with only root node
|
||||
CClaimTrieNode base_node;
|
||||
cc.recursiveComputeMerkleHash(&base_node, "");
|
||||
BOOST_CHECK(one == cc.getMerkleHash());
|
||||
}
|
||||
|
||||
BOOST_AUTO_TEST_CASE(recursiveprune_test)
|
||||
{
|
||||
CClaimTrieCacheTest cc(pclaimTrie);
|
||||
BOOST_CHECK_EQUAL(0, cc.cacheSize());
|
||||
|
||||
COutPoint outpoint;
|
||||
uint160 claimId;
|
||||
CAmount amount(20);
|
||||
int height = 0;
|
||||
int validAtHeight = 0;
|
||||
CClaimValue test_claim(outpoint, claimId, amount, height, validAtHeight);
|
||||
|
||||
CClaimTrieNode base_node;
|
||||
// base node has a claim, so it should not be pruned
|
||||
base_node.insertClaim(test_claim);
|
||||
|
||||
// node 1 has a claim so it should not be pruned
|
||||
CClaimTrieNode node_1;
|
||||
const char c = 't';
|
||||
base_node.children[c] = &node_1;
|
||||
node_1.insertClaim(test_claim);
|
||||
// set this just to make sure we get the right CClaimTrieNode back
|
||||
node_1.nHeightOfLastTakeover = 10;
|
||||
|
||||
//node 2 does not have a claim so it should be pruned
|
||||
// thus we should find pruned node 1 in cache
|
||||
CClaimTrieNode node_2;
|
||||
const char c_2 = 'e';
|
||||
node_1.children[c_2] = &node_2;
|
||||
|
||||
cc.recursivePruneName(&base_node, 0, std::string("te"), NULL);
|
||||
BOOST_CHECK_EQUAL(1, cc.cacheSize());
|
||||
nodeCacheType::iterator it = cc.getCache(std::string("t"));
|
||||
BOOST_CHECK_EQUAL(10, it->second->nHeightOfLastTakeover);
|
||||
BOOST_CHECK_EQUAL(1, it->second->claims.size());
|
||||
BOOST_CHECK_EQUAL(0, it->second->children.size());
|
||||
}
|
||||
|
||||
|
||||
BOOST_AUTO_TEST_SUITE_END()
|
||||
@@ -3,6 +3,7 @@
|
||||
#include "lbry.h"
|
||||
#include "main.h"
|
||||
#include "test/test_bitcoin.h"
|
||||
#include "hash.h"
|
||||
#include <cstdio>
|
||||
#include <boost/test/unit_test.hpp>
|
||||
|
||||
@@ -95,6 +96,35 @@ BOOST_AUTO_TEST_CASE(pow_limit_check)
|
||||
}
|
||||
|
||||
|
||||
boost::test_tools::predicate_result
|
||||
check_powhash_equals(std::string test_string,std::string expected_hash_hex)
|
||||
{
|
||||
std::vector<unsigned char> test_vect(test_string.begin(),test_string.end());
|
||||
uint256 expected;
|
||||
expected.SetHex(expected_hash_hex);
|
||||
uint256 hash = PoWHash(test_vect);
|
||||
|
||||
//std::cout<<"hash :"<<hash.ToString()<<"\n";
|
||||
|
||||
if (hash == expected){
|
||||
return true;
|
||||
}
|
||||
else
|
||||
{
|
||||
boost::test_tools::predicate_result res( false );
|
||||
res.message() << "Hash of " << test_string << " != " << expected_hash_hex;
|
||||
return res;
|
||||
}
|
||||
}
|
||||
|
||||
BOOST_AUTO_TEST_CASE(lbry_pow_test)
|
||||
{
|
||||
|
||||
BOOST_CHECK(check_powhash_equals("test string","485f3920d48a0448034b0852d1489cfa475341176838c7d36896765221be35ce"));
|
||||
BOOST_CHECK(check_powhash_equals(std::string(70,'a'),"eb44af2f41e7c6522fb8be4773661be5baa430b8b2c3a670247e9ab060608b75"));
|
||||
BOOST_CHECK(check_powhash_equals(std::string(140,'d'),"74044747b7c1ff867eb09a84d026b02d8dc539fb6adcec3536f3dfa9266495d9"));
|
||||
|
||||
}
|
||||
|
||||
|
||||
|
||||
|
||||
@@ -0,0 +1,38 @@
|
||||
#include "nameclaim.h"
|
||||
#include "primitives/transaction.h"
|
||||
#include <boost/test/unit_test.hpp>
|
||||
#include "test/test_bitcoin.h"
|
||||
|
||||
//BOOST_FIXTURE_TEST_SUITE(nameclaim_tests, BasicTestingSetup)
|
||||
|
||||
BOOST_AUTO_TEST_CASE(calc_min_claimtrie_fee)
|
||||
{
|
||||
|
||||
CMutableTransaction tx;
|
||||
tx.vout.resize(1);
|
||||
tx.vout[0].scriptPubKey = ClaimNameScript("A","test");
|
||||
BOOST_CHECK_EQUAL(CalcMinClaimTrieFee(tx, MIN_FEE_PER_NAMECLAIM_CHAR), MIN_FEE_PER_NAMECLAIM_CHAR);
|
||||
|
||||
// check that fee is adjusted based on name length
|
||||
CMutableTransaction tx2;
|
||||
tx2.vout.resize(1);
|
||||
tx2.vout[0].scriptPubKey = ClaimNameScript("ABCDE","test");
|
||||
BOOST_CHECK_EQUAL(CalcMinClaimTrieFee(tx2,MIN_FEE_PER_NAMECLAIM_CHAR), MIN_FEE_PER_NAMECLAIM_CHAR*5);
|
||||
|
||||
// check that multiple OP_CLAIM_NAME outputs are counted
|
||||
CMutableTransaction tx3;
|
||||
tx3.vout.resize(2);
|
||||
tx3.vout[0].scriptPubKey = ClaimNameScript("A","test");
|
||||
tx3.vout[1].scriptPubKey = ClaimNameScript("AB","test");
|
||||
BOOST_CHECK_EQUAL(CalcMinClaimTrieFee(tx3,MIN_FEE_PER_NAMECLAIM_CHAR), MIN_FEE_PER_NAMECLAIM_CHAR*3);
|
||||
|
||||
// if tx has no claim minimum fee is 0
|
||||
CMutableTransaction tx4;
|
||||
tx4.vout.resize(1);
|
||||
BOOST_CHECK_EQUAL(CalcMinClaimTrieFee(tx4,MIN_FEE_PER_NAMECLAIM_CHAR), 0);
|
||||
|
||||
}
|
||||
|
||||
|
||||
|
||||
//BOOST_AUTO_TEST_SUITE_END()
|
||||
@@ -153,6 +153,7 @@ TestChain100Setup::~TestChain100Setup()
|
||||
RegTestingSetup::RegTestingSetup() : TestingSetup(CBaseChainParams::REGTEST)
|
||||
{
|
||||
minRelayTxFee = CFeeRate(0);
|
||||
minFeePerNameClaimChar = 0;
|
||||
}
|
||||
|
||||
RegTestingSetup::~RegTestingSetup()
|
||||
|
||||
@@ -337,11 +337,14 @@ BOOST_AUTO_TEST_CASE(test_IsStandard)
|
||||
BOOST_CHECK(IsStandardTx(t, reason));
|
||||
|
||||
// Check dust with default relay fee:
|
||||
CAmount nDustThreshold = 182 * minRelayTxFee.GetFeePerK()/1000 * 3;
|
||||
BOOST_CHECK_EQUAL(nDustThreshold, 546);
|
||||
//CAmount nDustThreshold = 182 * minRelayTxFee.GetFeePerK()/1000 * 3;
|
||||
//BOOST_CHECK_EQUAL(nDustThreshold, 546);
|
||||
// lbry dust is set to 1, regardless of minRelayTxfee
|
||||
CAmount nDustThreshold = 1;
|
||||
|
||||
// dust:
|
||||
//t.vout[0].nValue = nDustThreshold - 1;
|
||||
//BOOST_CHECK(!IsStandardTx(t, reason));
|
||||
t.vout[0].nValue = nDustThreshold - 1;
|
||||
BOOST_CHECK(!IsStandardTx(t, reason));
|
||||
// not dust:
|
||||
t.vout[0].nValue = nDustThreshold;
|
||||
BOOST_CHECK(IsStandardTx(t, reason));
|
||||
|
||||
@@ -455,9 +455,9 @@ void PrintExceptionContinue(const std::exception* pex, const char* pszThread)
|
||||
boost::filesystem::path GetDefaultDataDir()
|
||||
{
|
||||
namespace fs = boost::filesystem;
|
||||
// Windows < Vista: C:\Documents and Settings\Username\Application Data\Bitcoin
|
||||
// Windows >= Vista: C:\Users\Username\AppData\Roaming\Bitcoin
|
||||
// Mac: ~/Library/Application Support/Bitcoin
|
||||
// Windows < Vista: C:\Documents and Settings\Username\Application Data\lbrycrd
|
||||
// Windows >= Vista: C:\Users\Username\AppData\Roaming\lbrycrd
|
||||
// Mac: ~/Library/Application Support/lbrycrd
|
||||
// Unix: ~/.lbrycrd
|
||||
#ifdef WIN32
|
||||
// Windows
|
||||
|
||||
@@ -390,10 +390,10 @@ void CreateClaim(CScript& claimScript, CAmount nAmount, CWalletTx& wtxNew)
|
||||
|
||||
vector<CRecipient> vecSend;
|
||||
int nChangePosRet = -1;
|
||||
|
||||
|
||||
CRecipient recipient = {claimScript, nAmount, false};
|
||||
vecSend.push_back(recipient);
|
||||
|
||||
|
||||
CReserveKey reservekey(pwalletMain);
|
||||
CAmount nFeeRequired;
|
||||
if (!pwalletMain->CreateTransaction(vecSend, wtxNew, reservekey, nFeeRequired, nChangePosRet, strError))
|
||||
@@ -411,7 +411,7 @@ UniValue claimname(const UniValue& params, bool fHelp)
|
||||
{
|
||||
if (!EnsureWalletIsAvailable(fHelp))
|
||||
return NullUniValue;
|
||||
|
||||
|
||||
if (fHelp || params.size() != 3)
|
||||
throw runtime_error(
|
||||
"claimname \"name\" \"value\" amount\n"
|
||||
@@ -419,7 +419,7 @@ UniValue claimname(const UniValue& params, bool fHelp)
|
||||
+ HelpRequiringPassphrase() +
|
||||
"\nArguments:\n"
|
||||
"1. \"name\" (string, required) The name to be assigned the value.\n"
|
||||
"2. \"value\" (string, required) The value to assign to the name.\n"
|
||||
"2. \"value\" (string, required) The value to assign to the name encoded in hexadecimal.\n"
|
||||
"3. \"amount\" (numeric, required) The amount in LBRYcrd to send. eg 0.1\n"
|
||||
"\nResult:\n"
|
||||
"\"transactionid\" (string) The transaction id.\n"
|
||||
@@ -427,7 +427,8 @@ UniValue claimname(const UniValue& params, bool fHelp)
|
||||
string sName = params[0].get_str();
|
||||
string sValue = params[1].get_str();
|
||||
std::vector<unsigned char> vchName (sName.begin(), sName.end());
|
||||
std::vector<unsigned char> vchValue (sValue.begin(), sValue.end());
|
||||
std::vector<unsigned char> vchValue(ParseHex(sValue));
|
||||
|
||||
CAmount nAmount = AmountFromValue(params[2]);
|
||||
|
||||
CWalletTx wtx;
|
||||
@@ -435,14 +436,14 @@ UniValue claimname(const UniValue& params, bool fHelp)
|
||||
EnsureWalletIsUnlocked();
|
||||
|
||||
CScript claimScript = CScript() << OP_CLAIM_NAME << vchName << vchValue << OP_2DROP << OP_DROP;
|
||||
|
||||
|
||||
CreateClaim(claimScript, nAmount, wtx);
|
||||
|
||||
return wtx.GetHash().GetHex();
|
||||
}
|
||||
|
||||
|
||||
void UpdateName(const std::vector<unsigned char> vchName, const std::vector<unsigned char> vchValue, CAmount nAmount, CWalletTx& wtxNew, CWalletTx wtxIn, unsigned int nTxOut)
|
||||
void UpdateName(const std::vector<unsigned char> vchName, const uint160 claimId, const std::vector<unsigned char> vchValue, CAmount nAmount, CWalletTx& wtxNew, CWalletTx wtxIn, unsigned int nTxOut)
|
||||
{
|
||||
// Check amount
|
||||
if (nAmount <= 0)
|
||||
@@ -464,16 +465,17 @@ void UpdateName(const std::vector<unsigned char> vchName, const std::vector<unsi
|
||||
if (!pwalletMain->GetKeyFromPool(newKey))
|
||||
throw JSONRPCError(RPC_WALLET_KEYPOOL_RAN_OUT, "Error: Keypool ran out, please call keypoolrefill first");
|
||||
|
||||
std::vector<unsigned char> vchClaimId(claimId.begin(), claimId.end());
|
||||
CScript scriptPubKey = GetScriptForDestination(CTxDestination(newKey.GetID()));
|
||||
CScript claimScript = CScript() << OP_CLAIM_NAME << vchName << vchValue << OP_2DROP << OP_DROP;
|
||||
CScript claimScript = CScript() << OP_UPDATE_CLAIM << vchName << vchClaimId << vchValue << OP_2DROP << OP_2DROP;
|
||||
claimScript = claimScript + scriptPubKey;
|
||||
|
||||
vector<CRecipient> vecSend;
|
||||
int nChangePosRet = -1;
|
||||
|
||||
|
||||
CRecipient recipient = {claimScript, nAmount, false};
|
||||
vecSend.push_back(recipient);
|
||||
|
||||
|
||||
CReserveKey reservekey(pwalletMain);
|
||||
CAmount nFeeRequired;
|
||||
if (!pwalletMain->CreateTransaction(vecSend, wtxNew, reservekey, nFeeRequired, nChangePosRet, strError, NULL, true, &wtxIn, nTxOut))
|
||||
@@ -492,7 +494,7 @@ UniValue updateclaim(const UniValue& params, bool fHelp)
|
||||
{
|
||||
if (!EnsureWalletIsAvailable(fHelp))
|
||||
return NullUniValue;
|
||||
|
||||
|
||||
if (fHelp || params.size() != 3)
|
||||
throw runtime_error(
|
||||
"updateclaim \"txid\" \"value\" amount\n"
|
||||
@@ -500,20 +502,20 @@ UniValue updateclaim(const UniValue& params, bool fHelp)
|
||||
+ HelpRequiringPassphrase() +
|
||||
"\nArguments:\n"
|
||||
"1. \"txid\" (string, required) The transaction containing the unspent txout which should be spent.\n"
|
||||
"2. \"value\" (string, required) The value to assign to the name.\n"
|
||||
"3. \"amount\" (numeric, required) The amount in LBRYcrd to send. eg 0.1\n"
|
||||
"2. \"value\" (string, required) The value to assign to the name encoded in hexadecimal.\n"
|
||||
"3. \"amount\" (numeric, required) The amount in LBRYcrd to use to bid for the name. eg 0.1\n"
|
||||
"\nResult:\n"
|
||||
"\"transactionid\" (string) The new transaction id.\n"
|
||||
);
|
||||
|
||||
|
||||
uint256 hash;
|
||||
hash.SetHex(params[0].get_str());
|
||||
|
||||
|
||||
std::vector<unsigned char> vchName;
|
||||
string sValue = params[1].get_str();
|
||||
std::vector<unsigned char> vchValue (sValue.begin(), sValue.end());
|
||||
std::vector<unsigned char> vchValue(ParseHex(sValue));
|
||||
CAmount nAmount = AmountFromValue(params[2]);
|
||||
|
||||
|
||||
isminefilter filter = ISMINE_CLAIM;
|
||||
|
||||
UniValue entry;
|
||||
@@ -523,6 +525,7 @@ UniValue updateclaim(const UniValue& params, bool fHelp)
|
||||
const CWalletTx& wtx = pwalletMain->mapWallet[hash];
|
||||
int op;
|
||||
std::vector<std::vector<unsigned char> > vvchParams;
|
||||
uint160 claimId;
|
||||
CWalletTx wtxNew;
|
||||
bool fFound = false;
|
||||
for (unsigned int i = 0; !fFound && i < wtx.vout.size(); i++)
|
||||
@@ -533,7 +536,15 @@ UniValue updateclaim(const UniValue& params, bool fHelp)
|
||||
{
|
||||
vchName = vvchParams[0];
|
||||
EnsureWalletIsUnlocked();
|
||||
UpdateName(vchName, vchValue, nAmount, wtxNew, wtx, i);
|
||||
if (op == OP_CLAIM_NAME)
|
||||
{
|
||||
claimId = ClaimIdHash(wtx.GetHash(), i);
|
||||
}
|
||||
else if (op == OP_UPDATE_CLAIM)
|
||||
{
|
||||
claimId = uint160(vvchParams[1]);
|
||||
}
|
||||
UpdateName(vchName, claimId, vchValue, nAmount, wtxNew, wtx, i);
|
||||
fFound = true;
|
||||
}
|
||||
}
|
||||
@@ -562,13 +573,13 @@ void AbandonClaim(const CTxDestination &address, CAmount nAmount, CWalletTx& wtx
|
||||
}
|
||||
|
||||
CScript scriptPubKey = GetScriptForDestination(address);
|
||||
|
||||
|
||||
vector<CRecipient> vecSend;
|
||||
int nChangePosRet = -1;
|
||||
|
||||
|
||||
CRecipient recipient = {scriptPubKey, nAmount, false};
|
||||
vecSend.push_back(recipient);
|
||||
|
||||
|
||||
CReserveKey reservekey(pwalletMain);
|
||||
CAmount nFeeRequired;
|
||||
if (!pwalletMain->CreateTransaction(vecSend, wtxNew, reservekey, nFeeRequired, nChangePosRet, strError, NULL, true, &wtxIn, nTxOut))
|
||||
@@ -586,7 +597,7 @@ UniValue abandonclaim(const UniValue& params, bool fHelp)
|
||||
{
|
||||
if (!EnsureWalletIsAvailable(fHelp))
|
||||
return NullUniValue;
|
||||
|
||||
|
||||
if (fHelp || params.size() != 3)
|
||||
throw runtime_error(
|
||||
"abandonclaim \"txid\" \"lbrycrdaddress\" \"amount\"\n"
|
||||
@@ -668,7 +679,8 @@ void ListNameClaims(const CWalletTx& wtx, const string& strAccount, int nMinDept
|
||||
LogPrintf("%s(): Txout classified as name claim could not be decoded. Txid: %s", __func__, wtx.GetHash().ToString());
|
||||
continue;
|
||||
}
|
||||
else if (((op == OP_CLAIM_NAME) && (vvchParams.size() != 2)) || ((op == OP_SUPPORT_CLAIM) && (vvchParams.size() != 3)))
|
||||
else if (((op == OP_CLAIM_NAME || op == OP_SUPPORT_CLAIM) && (vvchParams.size() != 2)) ||
|
||||
((op == OP_UPDATE_CLAIM) && (vvchParams.size() != 3)))
|
||||
{
|
||||
LogPrintf("%s(): Wrong number of params to name claim script. Got %d, expected %d. Txid: %s", __func__, vvchParams.size(), ((op == OP_CLAIM_NAME) ? 2 : 3), wtx.GetHash().ToString());
|
||||
continue;
|
||||
@@ -677,15 +689,22 @@ void ListNameClaims(const CWalletTx& wtx, const string& strAccount, int nMinDept
|
||||
entry.push_back(Pair("name", sName));
|
||||
if (op == OP_CLAIM_NAME)
|
||||
{
|
||||
uint160 claimId = ClaimIdHash(wtx.GetHash(), s.vout);
|
||||
entry.push_back(Pair("claimId", claimId.GetHex()));
|
||||
string sValue (vvchParams[1].begin(), vvchParams[1].end());
|
||||
entry.push_back(Pair("value", sValue));
|
||||
}
|
||||
else if (op == OP_UPDATE_CLAIM)
|
||||
{
|
||||
uint160 claimId(vvchParams[1]);
|
||||
entry.push_back(Pair("claimId", claimId.GetHex()));
|
||||
string sValue(vvchParams[2].begin(), vvchParams[2].end());
|
||||
entry.push_back(Pair("value", sValue));
|
||||
}
|
||||
else if (op == OP_SUPPORT_CLAIM)
|
||||
{
|
||||
uint256 txhash(vvchParams[1]);
|
||||
entry.push_back(Pair("supported_txid", txhash.GetHex()));
|
||||
int32_t nOut = vch_to_uint32_t(vvchParams[2]);
|
||||
entry.push_back(Pair("supported_nOut", nOut));
|
||||
uint160 claimId(vvchParams[1]);
|
||||
entry.push_back(Pair("supported_claimid", claimId.GetHex()));
|
||||
}
|
||||
entry.push_back(Pair("txid", wtx.GetHash().ToString()));
|
||||
entry.push_back(Pair("account", strSentAccount));
|
||||
@@ -734,10 +753,10 @@ UniValue listnameclaims(const UniValue& params, bool fHelp)
|
||||
{
|
||||
if (!EnsureWalletIsAvailable(fHelp))
|
||||
return NullUniValue;
|
||||
|
||||
|
||||
if (fHelp || params.size() > 3)
|
||||
throw runtime_error(
|
||||
"listnameclaims activeonly minconf\n"
|
||||
"listnameclaims includesuppports activeonly minconf\n"
|
||||
"Return a list of all transactions claiming names.\n"
|
||||
"\nArguments\n"
|
||||
"1. includesupports (bool, optional) Whether to also include claim supports. Default is true.\n"
|
||||
@@ -748,6 +767,7 @@ UniValue listnameclaims(const UniValue& params, bool fHelp)
|
||||
" {\n"
|
||||
" \"name\":\"claimedname\", (string) The name that is claimed.\n"
|
||||
" \"claimtype\":\"claimtype\", (string) CLAIM or SUPPORT.\n"
|
||||
" \"claimId\":\"claimId\", (string) The claimId of the claim.\n"
|
||||
" \"value\":\"value\" (string) The value assigned to the name, if claimtype is CLAIM.\n"
|
||||
" \"account\":\"accountname\", (string) The account name associated with the transaction. \n"
|
||||
" It will be \"\" for the default account.\n"
|
||||
@@ -774,7 +794,7 @@ UniValue listnameclaims(const UniValue& params, bool fHelp)
|
||||
isminefilter claim_filter = ISMINE_CLAIM;
|
||||
if (params.size() < 1 || params[0].get_bool())
|
||||
claim_filter |= ISMINE_SUPPORT;
|
||||
|
||||
|
||||
bool fListSpent = true;
|
||||
if (params.size() > 1)
|
||||
fListSpent = !params[1].get_bool();
|
||||
@@ -783,7 +803,7 @@ UniValue listnameclaims(const UniValue& params, bool fHelp)
|
||||
int nMinDepth = 1;
|
||||
if (params.size() > 2)
|
||||
nMinDepth = params[2].get_int();
|
||||
|
||||
|
||||
UniValue ret(UniValue::VARR);
|
||||
|
||||
const CWallet::TxItems& txOrdered = pwalletMain->wtxOrdered;
|
||||
@@ -813,35 +833,33 @@ UniValue supportclaim(const UniValue& params, bool fHelp)
|
||||
if (!EnsureWalletIsAvailable(fHelp))
|
||||
return NullUniValue;
|
||||
|
||||
if (fHelp || params.size() != 4)
|
||||
if (fHelp || params.size() != 3)
|
||||
throw runtime_error(
|
||||
"supportclaim \"name\" \"txid\" nout amount\n"
|
||||
"supportclaim \"name\" \"claimid\" \"amount\"\n"
|
||||
"Increase the value of a claim. Whichever claim has the greatest value, including all support values, will be the authoritative claim, according to the rest of the rules. The name is the name which is claimed by the claim that will be supported, the txid is the txid of the claim that will be supported, nout is the transaction output which contains the claim to be supported, and amount is the amount which will be added to the value of the claim. If the claim is currently the authoritative claim, this support will go into effect immediately. Otherwise, it will go into effect after 100 blocks. The support will be in effect until it is spent, and will lose its effect when the claim is spent or expires. The amount is a real and is rounded to the nearest .00000001\n"
|
||||
+ HelpRequiringPassphrase() +
|
||||
"\nArguments:\n"
|
||||
"1. \"name\" (string, required) The name claimed by the claim to support.\n"
|
||||
"2. \"txid\" (string, required) The transaction id of the claim to support.\n"
|
||||
"3. \"nout\" (integer, required) The transaction output of the transaction which contains the claim to be supported.\n"
|
||||
"4. \"amount\" (numeric, required) The amount in LBC to use to support the claim.\n"
|
||||
"2. \"claimid\" (string, required) The claimid of the claim to support. This can be obtained by TODO PUT IN PLACE THAT SHOWS THIS.\n"
|
||||
"3. \"amount\" (numeric, required) The amount in LBC to use to support the claim.\n"
|
||||
"\nResult:\n"
|
||||
"\"transactionid\" (string) The transaction id of the support.\n"
|
||||
);
|
||||
|
||||
string sName = params[0].get_str();
|
||||
string sTxid = params[1].get_str();
|
||||
uint256 txid;
|
||||
txid.SetHex(sTxid);
|
||||
string sClaimId = params[1].get_str();
|
||||
uint160 claimId;
|
||||
claimId.SetHex(sClaimId);
|
||||
std::vector<unsigned char> vchName (sName.begin(), sName.end());
|
||||
std::vector<unsigned char> vchTxid (txid.begin(), txid.end());
|
||||
std::vector<unsigned char> vchnOut = uint32_t_to_vch(params[2].get_int());
|
||||
CAmount nAmount = AmountFromValue(params[3]);
|
||||
std::vector<unsigned char> vchClaimId (claimId.begin(), claimId.end());
|
||||
CAmount nAmount = AmountFromValue(params[2]);
|
||||
|
||||
CWalletTx wtx;
|
||||
|
||||
EnsureWalletIsUnlocked();
|
||||
|
||||
CScript supportScript = CScript() << OP_SUPPORT_CLAIM << vchName << vchTxid << vchnOut << OP_2DROP << OP_2DROP;
|
||||
|
||||
CScript supportScript = CScript() << OP_SUPPORT_CLAIM << vchName << vchClaimId << OP_2DROP << OP_DROP;
|
||||
|
||||
CreateClaim(supportScript, nAmount, wtx);
|
||||
|
||||
return wtx.GetHash().GetHex();
|
||||
|
||||
@@ -2279,6 +2279,9 @@ bool CWallet::CreateTransaction(const vector<CRecipient>& vecSend, CWalletTx& wt
|
||||
if (coinControl && nFeeNeeded > 0 && coinControl->nMinimumTotalFee > nFeeNeeded) {
|
||||
nFeeNeeded = coinControl->nMinimumTotalFee;
|
||||
}
|
||||
// Make sure we meet the minimum claimtrie fee, pick which ever one is largest
|
||||
CAmount minClaimTrieFee = CalcMinClaimTrieFee(wtxNew, minFeePerNameClaimChar);
|
||||
nFeeNeeded = std::max(nFeeNeeded, minClaimTrieFee);
|
||||
|
||||
// If we made it here and we aren't even able to meet the relay fee on the next pass, give up
|
||||
// because we must be at the maximum allowed fee.
|
||||
|
||||