blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 3 264 | content_id stringlengths 40 40 | detected_licenses listlengths 0 85 | license_type stringclasses 2
values | repo_name stringlengths 5 140 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringclasses 905
values | visit_date timestamp[us]date 2015-08-09 11:21:18 2023-09-06 10:45:07 | revision_date timestamp[us]date 1997-09-14 05:04:47 2023-09-17 19:19:19 | committer_date timestamp[us]date 1997-09-14 05:04:47 2023-09-06 06:22:19 | github_id int64 3.89k 681M ⌀ | star_events_count int64 0 209k | fork_events_count int64 0 110k | gha_license_id stringclasses 22
values | gha_event_created_at timestamp[us]date 2012-06-07 00:51:45 2023-09-14 21:58:39 ⌀ | gha_created_at timestamp[us]date 2008-03-27 23:40:48 2023-08-21 23:17:38 ⌀ | gha_language stringclasses 141
values | src_encoding stringclasses 34
values | language stringclasses 1
value | is_vendor bool 1
class | is_generated bool 2
classes | length_bytes int64 3 10.4M | extension stringclasses 115
values | content stringlengths 3 10.4M | authors listlengths 1 1 | author_id stringlengths 0 158 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
655e12020fe6d9c66093f8683da398fac9d1d7cd | e76ea38dbe5774fccaf14e1a0090d9275cdaee08 | /src/cc/output/output_surface_client.h | 9f150a844340727af08f8c43056b8dd2cacb5dd4 | [
"BSD-3-Clause"
] | permissive | eurogiciel-oss/Tizen_Crosswalk | efc424807a5434df1d5c9e8ed51364974643707d | a68aed6e29bd157c95564e7af2e3a26191813e51 | refs/heads/master | 2021-01-18T19:19:04.527505 | 2014-02-06T13:43:21 | 2014-02-06T13:43:21 | 16,070,101 | 1 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 2,067 | h | // Copyright 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef CC_OUTPUT_OUTPUT_SURFACE_CLIENT_H_
#define CC_OUTPUT_OUTPUT_SURFACE_CLIENT_H_
#include "base/callback.h"
#include "base/memory/ref_counted.h"
#include "base/time/time.h"
#include "cc/base/cc_export.h"
#include "cc/output/begin_frame_args.h"
#include "cc/output/context_provider.h"
#include "ui/gfx/rect.h"
namespace gfx {
class Transform;
}
namespace cc {
class CompositorFrameAck;
struct ManagedMemoryPolicy;
class CC_EXPORT OutputSurfaceClient {
public:
// Called to synchronously re-initialize using the Context3D. Upon returning
// the compositor should be able to draw using GL what was previously
// committed.
virtual bool DeferredInitialize(
scoped_refptr<ContextProvider> offscreen_context_provider) = 0;
virtual void ReleaseGL() = 0;
virtual void SetNeedsRedrawRect(gfx::Rect damage_rect) = 0;
virtual void BeginImplFrame(const BeginFrameArgs& args) = 0;
virtual void OnSwapBuffersComplete() = 0;
virtual void ReclaimResources(const CompositorFrameAck* ack) = 0;
virtual void DidLoseOutputSurface() = 0;
virtual void SetExternalDrawConstraints(const gfx::Transform& transform,
gfx::Rect viewport,
gfx::Rect clip,
bool valid_for_tile_management) = 0;
virtual void SetMemoryPolicy(const ManagedMemoryPolicy& policy) = 0;
// If set, |callback| will be called subsequent to each new tree activation,
// regardless of the compositor visibility or damage. |callback| must remain
// valid for the lifetime of the OutputSurfaceClient or until unregisted --
// use SetTreeActivationCallback(base::Closure()) to unregister it.
virtual void SetTreeActivationCallback(const base::Closure& callback) = 0;
protected:
virtual ~OutputSurfaceClient() {}
};
} // namespace cc
#endif // CC_OUTPUT_OUTPUT_SURFACE_CLIENT_H_
| [
"ronan@fridu.net"
] | ronan@fridu.net |
018ab12809ebd2699c11d65dd8a79c64404b9d19 | 9e679c1c7cb9515fb638cda7854ba0641db846f9 | /src/shared/mathexpression/StdComplexMathExpression.h | 805818f504cda6a617c5460caf3e2736cee46d16 | [
"BSD-3-Clause"
] | permissive | FarPlugins/Calculator | 0eed0189b4cdaf60feb697b5b2f574e5da6c1d27 | 679cd57cfa223719e02dffd4a1b7876210a64e61 | refs/heads/master | 2023-08-15T06:48:13.408331 | 2021-10-10T10:57:38 | 2021-10-10T10:57:38 | 326,977,138 | 4 | 1 | BSD-3-Clause | 2021-06-14T17:38:38 | 2021-01-05T11:25:19 | C++ | UTF-8 | C++ | false | false | 5,127 | h | /*
* StdComplexMathExpression.h
*
* Created on: May 27, 2009
* Author: amyznikov
*/
#ifndef __STD_COMPLEX_MATHEXPRESSION_H__
#define __STD_COMPLEX_MATHEXPRESSION_H__
#include <cmath>
#include <cfloat>
#include <complex>
#include <stdexcept>
#include "MathExpressionBase.h"
template<class T>
class StdComplexMathExpression
: public MathExpressionBase<std::complex<T> >
{
typedef StdComplexMathExpression this_class;
typedef MathExpressionBase<std::complex<T> > base_class;
using base_class :: BinaryOpTable;
public:
typedef T value_type;
typedef std::complex<T> complex_type;
StdComplexMathExpression()
{
BinaryOpTable.set_num_levels(4);
BinaryOpTable[0]->template add<std::operator==<value_type> > ("==");
BinaryOpTable[0]->template add<std::operator!=<value_type> >("!=");
BinaryOpTable[1]->template add<base_class::operator_plus>("+");
BinaryOpTable[1]->template add<base_class::operator_minus>("-");
BinaryOpTable[2]->template add<base_class::operator_multiply >("*");
BinaryOpTable[2]->template add<base_class::operator_divide >("/");
BinaryOpTable[3]->template add<std::pow<value_type> >("**");
base_class::template add_function<std::conj<value_type> >("conj","complex conjugate");
base_class::template add_function<std::exp<value_type> > ("exp","complex exponential function");
base_class::template add_function<std::cos<value_type> >("cos","complex cosine function");
base_class::template add_function<std::cosh<value_type> >("cosh","complex hyperbolic cosine");
base_class::template add_function<std::log<value_type> >("log","natural logarithm of a complex number");
base_class::template add_function<std::log10<value_type> >("log10","base-10 logarithm of a complex number");
base_class::template add_function<std::pow<value_type> >("pow","complex power function");
base_class::template add_function<std::sin<value_type> >("sin","complex sine function");
base_class::template add_function<std::sinh<value_type> >("sinh","complex hyperbolic sine");
base_class::template add_function<std::sqrt<value_type> >("sqrt","complex square root");
base_class::template add_function<std::tan<value_type> >("tan","complex tangent function");
base_class::template add_function<std::tanh<value_type> >("tanh","complex hyperbolic tangent");
base_class::template add_function<&this_class::real> ("real","get real part of a complex number");
base_class::template add_function<&this_class::imag> ("imag","get imaginary part of a complex number");
base_class::template add_function<&this_class::polar>("polar","Return complex with magnitude @a rho and angle @a theta");
base_class::template add_function<&this_class::arg >("arg","get argument of a complex number");
base_class::template add_function<&this_class::abs>("abs","absolute value of a complex number");
base_class::template add_function<&this_class::norm>("norm","Return @a z magnitude squared");
base_class::template add_function<&this_class::rand> ("rand","get real random number");
base_class::template add_function<&this_class::crand> ("crand","get complex random number");
base_class::template add_function("sum",base_class :: sum,"calculates the sum of arguments");
base_class::template add_function("product",base_class :: product,"calculates the product of arguments");
}
protected:
static complex_type rand()
{ return complex_type((value_type)::rand()/RAND_MAX);
}
static complex_type crand()
{ return complex_type((value_type)::rand()/RAND_MAX,(value_type)::rand()/RAND_MAX);
}
static complex_type real( const complex_type & x )
{ return x.real();
}
static complex_type imag( const complex_type & x )
{ return x.imag();
}
static complex_type arg( const complex_type & x )
{ return std::arg(x);
}
static complex_type abs( const complex_type & x )
{ return std::abs(x);
}
static complex_type norm( const complex_type & x )
{ return std::norm(x);
}
static complex_type polar(const complex_type & a, const complex_type & b )
{
if( a.imag() != 0 )
{ throw std::invalid_argument("polar() : first argument is not real");
}
if( b.imag() != 0 )
{ throw std::invalid_argument("polar() : second argument is not real");
}
return std::polar(a.real(),b.real());
}
protected:
bool parse_number( complex_type * value, const char * curpos, char ** endptr )
{
if( (*curpos == 'i' || *curpos == 'I') && !base_class :: can_be_part_of_identifier(*(curpos+1)) )
{ value->real() = 0, value->imag() = 1;
*endptr = (char*)( curpos+1 );
return true;
}
value_type v = (value_type)strtod(curpos,endptr);
if( *endptr > curpos )
{
if( **endptr=='i' || **endptr == 'I' )
{ value->real() = 0, value->imag() = v;
++*endptr;
}
else
{ value->real() = v, value->imag() = 0;
}
return true;
}
return false;
}
};
#endif /* __STD_COMPLEX_MATHEXPRESSION_H__ */
| [
"samlyukov@gmail.com"
] | samlyukov@gmail.com |
5244afa6332cabf90d91d9110ad31b27e6cd1444 | 98592f44a62198669586d33b31c84da5b3830fbb | /Catalogo.hpp | b5cb1301d219824a4b07ae99c2850271a88b1738 | [
"MIT"
] | permissive | monicastle/P3Lab3_MonicaCastillo | 95ee0ce274925c5a8e05295b2897156ac38ada0b | 629801dd1955d690c5d49b1304fc4d7128850dcc | refs/heads/master | 2022-11-28T21:24:25.677334 | 2020-08-08T02:09:45 | 2020-08-08T02:09:45 | 285,899,848 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 696 | hpp | #include <string>
#include <vector>
using namespace std;
#include "Libro.hpp"
class Catalogo {
vector<Libro*> libros;
public:
Catalogo() {
} // Fin Constructor Catalogo
vector<Libro*> getLibro() {
return libros;
} // Fin Get Libro
void setLibro(string titulo, string autor, int ano) {
libros.push_back(new Libro(titulo, autor, ano));
} // Fin Set Libro
~Catalogo() {
} // Fin Destructor Catalogo
string toString() {
string acum = "";
for (int i = 0; i < libros.size(); i++) {
acum += libros[i]->toString() + " ";
} // Fin For
return "" + acum;
} // Fin To String
}; // Fin Class Catalogo | [
"monicastillo@unitec.edu"
] | monicastillo@unitec.edu |
81a993d29c63980b650106f00c02bbfd9d905a09 | 904537ded5004eb9d3dcbab9b54232be3f63b3b2 | /code forces/281A - Word Capitalization.cpp | 8bef95f3283c8a36a8d928971895492ef624daa7 | [
"MIT"
] | permissive | montukv/Coding-problem-solutions | 6fd6554173433808647b2719a13096da5f400f81 | f6eca27151b37955a446747629f2f39ea51536ed | refs/heads/master | 2023-05-14T02:37:15.576951 | 2023-05-11T14:08:17 | 2023-05-11T14:08:17 | 252,090,276 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,886 | cpp | #include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) printf("%lld\n",x)
#define ps(s) printf("%s\n",s)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626
#define po(x,y) fixed<<setprecision(y)<<x
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define vfor(v) for (int i = 1; i < v.size(); i++) // for iterating in a vector
#define vsort(v) sort(v.begin(), v.end()); // for sorting a vector
#define chartonum(str,i) (str[i] & NUM); // print position of a char in alaphabet
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
mt19937_64 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim) {
uniform_int_distribution<int> uid(0, lim - 1);
return uid(rang);
}
int mpow(int base, int exp);
void ipgraph(int n, int m);
void dfs(int u, int par);
//const int mod = 1'000'000'007;
const int N = 3e5, M = N , NUM = 31;;
//=======================
vi g[N];
int a[N];
void solve() {
string s;
cin >> s;
if (islower(s[0]))
{
s[0] = toupper(s[0]);
cout << s ;
}
else {
cout << s;
}
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
int t = 1;
//cin >> t;
while (t--) {
solve();
}
return 0;
}
/*
int mpow(int base, int exp) {
base %= mod;
int result = 1;
while (exp > 0) {
if (exp & 1) result = ((ll)result * base) % mod;
base = ((ll)base * base) % mod;
exp >>= 1;
}
return result;
}
*/
void ipgraph(int n, int m) {
int i, u, v;
while (m--) {
cin >> u >> v;
u--, v--;
g[u].pb(v);
g[v].pb(u);
}
}
void dfs(int u, int par) {
for (int v : g[u]) {
if (v == par) continue;
dfs(v, u);
}
}
| [
"montukeshwar.v@winkl.co"
] | montukeshwar.v@winkl.co |
691475d082027ca5a845f91dc65c9f911e8253fc | 4004f0f7bef6d53ec23a62954d12f6483be1ea39 | /sw/detect_change_soma/detect_change_soma.cpp | ad2d8ec400bfafb954fb17e3cd3ae9eac6e25979 | [
"MIT"
] | permissive | danilo94/BenchmarksHambugFramework- | 64f95663c2dbb704dca984c743a2f084dda04e19 | 938df6b3761d4066ec857084e28543cf002f519b | refs/heads/master | 2022-11-12T08:39:29.663225 | 2020-06-14T22:02:02 | 2020-06-14T22:02:02 | 265,136,040 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,858 | cpp | #include <stdint.h>
#include <stdlib.h>
#include <unistd.h>
#include <assert.h>
#include <thread>
#include <iostream>
#include <string>
#include <atomic>
#include <mutex>
#include <vector>
#include <random>
#include <utility>
using namespace std;
#include "opae_svc_wrapper.h"
#include "csr_mgr.h"
typedef struct samples_t{
union{
int data[16];
struct{
uint32_t newData;
uint32_t oldData;
uint64_t time;
};
};
}samples_t;
typedef struct status_t{
union{
int data[16];
struct{
char done:1;
};
};
}status_t;
typedef struct {
int thread_id;
int valor;
}result_t;
constexpr long size= 10000;
constexpr long firBound= 2500;
constexpr long secBound= 5000;
constexpr long thiBound= 7500;
constexpr long fouBound= 10000;
std::mutex myMutex;
void sumUp(result_t somatorio, int *val, int beg, int end){
for (int it= beg; it < end; it++){
std::lock_guard<std::mutex> myLock(myMutex);
*somatorio.valor+= val[it];
}
}
int main(int argc, char *argv[]){
OPAE_SVC_WRAPPER *fpga = new OPAE_SVC_WRAPPER("9f81ba12-1d38-4cc7-953a-dafeef45065b");
assert(fpga->isOk());
CSR_MGR csrs(*fpga);
int samples = 1000;
int *randValues = new int [size];
for ( long i=0 ; i< size ; ++i) randValues[i] = 10;
auto somatorio = (result *)fpga->allocBuffer(CL(1));
*somatorio.valor = 0;
*somatorio.thread_id = 0;
assert(NULL != somatorio);
auto samples_buffer = (samples_t *)fpga->allocBuffer(samples*sizeof(samples_t));
assert(NULL != samples_buffer);
auto status = (status_t *)fpga->allocBuffer(CL(1));
assert(NULL != status);
csrs.writeCSR(0, intptr_t(somatorio)/64);
csrs.writeCSR(1, intptr_t(samples_buffer)/64);
csrs.writeCSR(2, intptr_t(status)/64);
csrs.writeCSR(3, samples);
csrs.writeCSR(4, 200);
std::thread t1(sumUp,somatorio,randValues,0,firBound);
std::thread t2(sumUp,somatorio,randValues,firBound,secBound);
std::thread t3(sumUp,somatorio,randValues,secBound,thiBound);
std::thread t4(sumUp,somatorio,randValues,thiBound,fouBound);
t1.join();
t2.join();
t3.join();
t4.join();
struct timespec pause;
pause.tv_sec = 0;//(fpga->hwIsSimulated() ? 1 : 0);
pause.tv_nsec = 1;
std::terminate;
for(int i = 0; i < samples; i++){
std::cout << i <<" Tempo: " << samples_buffer[i].time << " Old data: " << samples_buffer[i].oldData << " New Data: " << samples_buffer[i].newData << std::endl;
}
while (status->done == 0 ){
*somatorio.valor = *somatorio.valor +1;
nanosleep(&pause, NULL);
};
delete fpga;
return 0;
}
| [
"danilooalmeida94@gmail.com"
] | danilooalmeida94@gmail.com |
20484b945b2ae621a45d4ffa1ac4a29bd85ff586 | 83289aa3276b0d3d1b06cefca5743745e6c8e916 | /builds/debug/rddl_parser/parser.tab.cc | 30ccaf45e0db5447cfb595fe8326257c4d0b71e4 | [] | no_license | 1124562662/NN-transfer | e82aba31c7622b7a4894c1682c0f7162bb7cae73 | 3a2c5b35fa2bb9b56824e98bf25a4766ab13215d | refs/heads/master | 2022-12-20T13:55:37.733520 | 2020-09-21T17:19:31 | 2020-09-21T17:19:31 | 278,586,159 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 173,345 | cc | /* A Bison parser, made by GNU Bison 3.5.1. */
/* Bison implementation for Yacc-like parsers in C
Copyright (C) 1984, 1989-1990, 2000-2015, 2018-2020 Free Software Foundation,
Inc.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
/* As a special exception, you may create a larger work that contains
part or all of the Bison parser skeleton and distribute that work
under terms of your choice, so long as that work isn't itself a
parser generator using the skeleton or a modified version thereof
as a parser skeleton. Alternatively, if you modify or redistribute
the parser skeleton itself, you may (at your option) remove this
special exception, which will cause the skeleton and the resulting
Bison output files to be licensed under the GNU General Public
License without this special exception.
This special exception was added by the Free Software Foundation in
version 2.2 of Bison. */
/* C LALR(1) parser skeleton written by Richard Stallman, by
simplifying the original so-called "semantic" parser. */
/* All symbols defined below should begin with yy or YY, to avoid
infringing on user name space. This should be done even for local
variables, as they might otherwise be expanded by user macros.
There are some unavoidable exceptions within include files to
define necessary library symbols; they are noted "INFRINGES ON
USER NAME SPACE" below. */
/* Undocumented macros, especially those whose name start with YY_,
are private implementation details. Do not rely on them. */
/* Identify Bison output. */
#define YYBISON 1
/* Bison version. */
#define YYBISON_VERSION "3.5.1"
/* Skeleton name. */
#define YYSKELETON_NAME "yacc.c"
/* Pure parsers. */
#define YYPURE 0
/* Push parsers. */
#define YYPUSH 0
/* Pull parsers. */
#define YYPULL 1
/* First part of user prologue. */
#line 1 "parser.ypp"
#include <cstdlib>
#include <cstdio>
#include <fstream>
#include <iostream>
#include <limits>
#include <sstream>
#include <string>
#include <vector>
#include "logical_expressions.h"
#include "rddl.h"
#include "utils/system_utils.h"
#include "utils/timer.h"
#define DOCTEST_CONFIG_IMPLEMENT
#define DOCTEST_CONFIG_NO_UNPREFIXED_OPTIONS
#include "../doctest/doctest.h"
extern int yylex();
extern int yyparse();
typedef struct yy_buffer_state* YY_BUFFER_STATE;
extern YY_BUFFER_STATE yy_scan_string(const char * str);
extern void yy_delete_buffer(YY_BUFFER_STATE buffer);
extern void yyerror (std::string message);
std::string targetDir;
RDDLTask* rddlTask;
#line 101 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
# ifndef YY_CAST
# ifdef __cplusplus
# define YY_CAST(Type, Val) static_cast<Type> (Val)
# define YY_REINTERPRET_CAST(Type, Val) reinterpret_cast<Type> (Val)
# else
# define YY_CAST(Type, Val) ((Type) (Val))
# define YY_REINTERPRET_CAST(Type, Val) ((Type) (Val))
# endif
# endif
# ifndef YY_NULLPTR
# if defined __cplusplus
# if 201103L <= __cplusplus
# define YY_NULLPTR nullptr
# else
# define YY_NULLPTR 0
# endif
# else
# define YY_NULLPTR ((void*)0)
# endif
# endif
/* Enabling verbose error messages. */
#ifdef YYERROR_VERBOSE
# undef YYERROR_VERBOSE
# define YYERROR_VERBOSE 1
#else
# define YYERROR_VERBOSE 0
#endif
/* Use api.header.include to #include this header
instead of duplicating it here. */
#ifndef YY_YY_HOME_ZIQI_PROST_MASTER_BUILDS_DEBUG_RDDL_PARSER_PARSER_TAB_HH_INCLUDED
# define YY_YY_HOME_ZIQI_PROST_MASTER_BUILDS_DEBUG_RDDL_PARSER_PARSER_TAB_HH_INCLUDED
/* Debug traces. */
#ifndef YYDEBUG
# define YYDEBUG 0
#endif
#if YYDEBUG
extern int yydebug;
#endif
/* Token type. */
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
enum yytokentype
{
lessOrEqual_token = 258,
greaterOrEqual_token = 259,
negative_infinity_token = 260,
equivalent_token = 261,
imply_token = 262,
equal_token = 263,
nonEqual_token = 264,
positive_infinity_token = 265,
forall_token = 266,
exists_token = 267,
case_token = 268,
if_token = 269,
switch_token = 270,
then_token = 271,
else_token = 272,
otherwise_token = 273,
sum_token = 274,
product_token = 275,
kronDelta_token = 276,
diracDelta_token = 277,
uniform_token = 278,
bernoulli_token = 279,
discrete_token = 280,
normal_token = 281,
poisson_token = 282,
exponential_token = 283,
weibull_token = 284,
gama_token = 285,
dirichlet_token = 286,
multinomial_token = 287,
types_token = 288,
variables_token = 289,
cpfs_token = 290,
cdfs_token = 291,
reward_token = 292,
domain_token = 293,
requirements_token = 294,
objects_token = 295,
init_state_token = 296,
state_action_constraints_token = 297,
action_preconditions_token = 298,
state_invariants_token = 299,
instance_token = 300,
non_fluents_token = 301,
discount_token = 302,
terminate_when_token = 303,
horizon_token = 304,
max_nondef_actions_token = 305,
doubleNum_token = 306,
id_token = 307,
variable_token = 308,
enum_token = 309,
object_token = 310,
integer_token = 311,
real_token = 312,
bool_token = 313,
true_token = 314,
false_token = 315,
default_token = 316,
level_token = 317,
observ_fluent_token = 318,
action_fluent_token = 319,
state_fluent_token = 320,
intermediate_token = 321,
derived_fluent_token = 322,
non_fluent_token = 323,
intNum_token = 324,
AgregateOperator = 325,
NEGATIVE = 326
};
#endif
/* Value type. */
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
union YYSTYPE
{
#line 32 "parser.ypp"
double d;
int i;
std::string* str;
std::vector<std::string>* strs;
RDDLTask* rddlTask;
Parameter* parameter;
std::vector<Parameter*>* parameters;
ParameterList* parameterList;
ParametrizedVariable* parametrizedVariable;
std::vector<ParametrizedVariable*>* parametrizedVariables;
LogicalExpression* logicalExpression;
Type* type;
std::vector<Type*>* types;
std::vector<LogicalExpression*>* logicalExpressions;
ConditionEffectPair* conditionEffect;
std::vector<ConditionEffectPair*>* conditionEffects;
DiscreteDistribution* lConstCaseList;
#line 246 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
};
typedef union YYSTYPE YYSTYPE;
# define YYSTYPE_IS_TRIVIAL 1
# define YYSTYPE_IS_DECLARED 1
#endif
extern YYSTYPE yylval;
int yyparse (void);
#endif /* !YY_YY_HOME_ZIQI_PROST_MASTER_BUILDS_DEBUG_RDDL_PARSER_PARSER_TAB_HH_INCLUDED */
#ifdef short
# undef short
#endif
/* On compilers that do not define __PTRDIFF_MAX__ etc., make sure
<limits.h> and (if available) <stdint.h> are included
so that the code can choose integer types of a good width. */
#ifndef __PTRDIFF_MAX__
# include <limits.h> /* INFRINGES ON USER NAME SPACE */
# if defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
# include <stdint.h> /* INFRINGES ON USER NAME SPACE */
# define YY_STDINT_H
# endif
#endif
/* Narrow types that promote to a signed type and that can represent a
signed or unsigned integer of at least N bits. In tables they can
save space and decrease cache pressure. Promoting to a signed type
helps avoid bugs in integer arithmetic. */
#ifdef __INT_LEAST8_MAX__
typedef __INT_LEAST8_TYPE__ yytype_int8;
#elif defined YY_STDINT_H
typedef int_least8_t yytype_int8;
#else
typedef signed char yytype_int8;
#endif
#ifdef __INT_LEAST16_MAX__
typedef __INT_LEAST16_TYPE__ yytype_int16;
#elif defined YY_STDINT_H
typedef int_least16_t yytype_int16;
#else
typedef short yytype_int16;
#endif
#if defined __UINT_LEAST8_MAX__ && __UINT_LEAST8_MAX__ <= __INT_MAX__
typedef __UINT_LEAST8_TYPE__ yytype_uint8;
#elif (!defined __UINT_LEAST8_MAX__ && defined YY_STDINT_H \
&& UINT_LEAST8_MAX <= INT_MAX)
typedef uint_least8_t yytype_uint8;
#elif !defined __UINT_LEAST8_MAX__ && UCHAR_MAX <= INT_MAX
typedef unsigned char yytype_uint8;
#else
typedef short yytype_uint8;
#endif
#if defined __UINT_LEAST16_MAX__ && __UINT_LEAST16_MAX__ <= __INT_MAX__
typedef __UINT_LEAST16_TYPE__ yytype_uint16;
#elif (!defined __UINT_LEAST16_MAX__ && defined YY_STDINT_H \
&& UINT_LEAST16_MAX <= INT_MAX)
typedef uint_least16_t yytype_uint16;
#elif !defined __UINT_LEAST16_MAX__ && USHRT_MAX <= INT_MAX
typedef unsigned short yytype_uint16;
#else
typedef int yytype_uint16;
#endif
#ifndef YYPTRDIFF_T
# if defined __PTRDIFF_TYPE__ && defined __PTRDIFF_MAX__
# define YYPTRDIFF_T __PTRDIFF_TYPE__
# define YYPTRDIFF_MAXIMUM __PTRDIFF_MAX__
# elif defined PTRDIFF_MAX
# ifndef ptrdiff_t
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
# endif
# define YYPTRDIFF_T ptrdiff_t
# define YYPTRDIFF_MAXIMUM PTRDIFF_MAX
# else
# define YYPTRDIFF_T long
# define YYPTRDIFF_MAXIMUM LONG_MAX
# endif
#endif
#ifndef YYSIZE_T
# ifdef __SIZE_TYPE__
# define YYSIZE_T __SIZE_TYPE__
# elif defined size_t
# define YYSIZE_T size_t
# elif defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
# define YYSIZE_T size_t
# else
# define YYSIZE_T unsigned
# endif
#endif
#define YYSIZE_MAXIMUM \
YY_CAST (YYPTRDIFF_T, \
(YYPTRDIFF_MAXIMUM < YY_CAST (YYSIZE_T, -1) \
? YYPTRDIFF_MAXIMUM \
: YY_CAST (YYSIZE_T, -1)))
#define YYSIZEOF(X) YY_CAST (YYPTRDIFF_T, sizeof (X))
/* Stored state numbers (used for stacks). */
typedef yytype_int16 yy_state_t;
/* State numbers in computations. */
typedef int yy_state_fast_t;
#ifndef YY_
# if defined YYENABLE_NLS && YYENABLE_NLS
# if ENABLE_NLS
# include <libintl.h> /* INFRINGES ON USER NAME SPACE */
# define YY_(Msgid) dgettext ("bison-runtime", Msgid)
# endif
# endif
# ifndef YY_
# define YY_(Msgid) Msgid
# endif
#endif
#ifndef YY_ATTRIBUTE_PURE
# if defined __GNUC__ && 2 < __GNUC__ + (96 <= __GNUC_MINOR__)
# define YY_ATTRIBUTE_PURE __attribute__ ((__pure__))
# else
# define YY_ATTRIBUTE_PURE
# endif
#endif
#ifndef YY_ATTRIBUTE_UNUSED
# if defined __GNUC__ && 2 < __GNUC__ + (7 <= __GNUC_MINOR__)
# define YY_ATTRIBUTE_UNUSED __attribute__ ((__unused__))
# else
# define YY_ATTRIBUTE_UNUSED
# endif
#endif
/* Suppress unused-variable warnings by "using" E. */
#if ! defined lint || defined __GNUC__
# define YYUSE(E) ((void) (E))
#else
# define YYUSE(E) /* empty */
#endif
#if defined __GNUC__ && ! defined __ICC && 407 <= __GNUC__ * 100 + __GNUC_MINOR__
/* Suppress an incorrect diagnostic about yylval being uninitialized. */
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
_Pragma ("GCC diagnostic push") \
_Pragma ("GCC diagnostic ignored \"-Wuninitialized\"") \
_Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"")
# define YY_IGNORE_MAYBE_UNINITIALIZED_END \
_Pragma ("GCC diagnostic pop")
#else
# define YY_INITIAL_VALUE(Value) Value
#endif
#ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
# define YY_IGNORE_MAYBE_UNINITIALIZED_END
#endif
#ifndef YY_INITIAL_VALUE
# define YY_INITIAL_VALUE(Value) /* Nothing. */
#endif
#if defined __cplusplus && defined __GNUC__ && ! defined __ICC && 6 <= __GNUC__
# define YY_IGNORE_USELESS_CAST_BEGIN \
_Pragma ("GCC diagnostic push") \
_Pragma ("GCC diagnostic ignored \"-Wuseless-cast\"")
# define YY_IGNORE_USELESS_CAST_END \
_Pragma ("GCC diagnostic pop")
#endif
#ifndef YY_IGNORE_USELESS_CAST_BEGIN
# define YY_IGNORE_USELESS_CAST_BEGIN
# define YY_IGNORE_USELESS_CAST_END
#endif
#define YY_ASSERT(E) ((void) (0 && (E)))
#if ! defined yyoverflow || YYERROR_VERBOSE
/* The parser invokes alloca or malloc; define the necessary symbols. */
# ifdef YYSTACK_USE_ALLOCA
# if YYSTACK_USE_ALLOCA
# ifdef __GNUC__
# define YYSTACK_ALLOC __builtin_alloca
# elif defined __BUILTIN_VA_ARG_INCR
# include <alloca.h> /* INFRINGES ON USER NAME SPACE */
# elif defined _AIX
# define YYSTACK_ALLOC __alloca
# elif defined _MSC_VER
# include <malloc.h> /* INFRINGES ON USER NAME SPACE */
# define alloca _alloca
# else
# define YYSTACK_ALLOC alloca
# if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
/* Use EXIT_SUCCESS as a witness for stdlib.h. */
# ifndef EXIT_SUCCESS
# define EXIT_SUCCESS 0
# endif
# endif
# endif
# endif
# endif
# ifdef YYSTACK_ALLOC
/* Pacify GCC's 'empty if-body' warning. */
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
# ifndef YYSTACK_ALLOC_MAXIMUM
/* The OS might guarantee only one guard page at the bottom of the stack,
and a page size can be as small as 4096 bytes. So we cannot safely
invoke alloca (N) if N exceeds 4096. Use a slightly smaller number
to allow for a few compiler-allocated temporary stack slots. */
# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
# endif
# else
# define YYSTACK_ALLOC YYMALLOC
# define YYSTACK_FREE YYFREE
# ifndef YYSTACK_ALLOC_MAXIMUM
# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
# endif
# if (defined __cplusplus && ! defined EXIT_SUCCESS \
&& ! ((defined YYMALLOC || defined malloc) \
&& (defined YYFREE || defined free)))
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
# ifndef EXIT_SUCCESS
# define EXIT_SUCCESS 0
# endif
# endif
# ifndef YYMALLOC
# define YYMALLOC malloc
# if ! defined malloc && ! defined EXIT_SUCCESS
void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# ifndef YYFREE
# define YYFREE free
# if ! defined free && ! defined EXIT_SUCCESS
void free (void *); /* INFRINGES ON USER NAME SPACE */
# endif
# endif
# endif
#endif /* ! defined yyoverflow || YYERROR_VERBOSE */
#if (! defined yyoverflow \
&& (! defined __cplusplus \
|| (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
/* A type that is properly aligned for any stack member. */
union yyalloc
{
yy_state_t yyss_alloc;
YYSTYPE yyvs_alloc;
};
/* The size of the maximum gap between one aligned stack and the next. */
# define YYSTACK_GAP_MAXIMUM (YYSIZEOF (union yyalloc) - 1)
/* The size of an array large to enough to hold all stacks, each with
N elements. */
# define YYSTACK_BYTES(N) \
((N) * (YYSIZEOF (yy_state_t) + YYSIZEOF (YYSTYPE)) \
+ YYSTACK_GAP_MAXIMUM)
# define YYCOPY_NEEDED 1
/* Relocate STACK from its old location to the new one. The
local variables YYSIZE and YYSTACKSIZE give the old and new number of
elements in the stack, and YYPTR gives the new location of the
stack. Advance YYPTR to a properly aligned location for the next
stack. */
# define YYSTACK_RELOCATE(Stack_alloc, Stack) \
do \
{ \
YYPTRDIFF_T yynewbytes; \
YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \
Stack = &yyptr->Stack_alloc; \
yynewbytes = yystacksize * YYSIZEOF (*Stack) + YYSTACK_GAP_MAXIMUM; \
yyptr += yynewbytes / YYSIZEOF (*yyptr); \
} \
while (0)
#endif
#if defined YYCOPY_NEEDED && YYCOPY_NEEDED
/* Copy COUNT objects from SRC to DST. The source and destination do
not overlap. */
# ifndef YYCOPY
# if defined __GNUC__ && 1 < __GNUC__
# define YYCOPY(Dst, Src, Count) \
__builtin_memcpy (Dst, Src, YY_CAST (YYSIZE_T, (Count)) * sizeof (*(Src)))
# else
# define YYCOPY(Dst, Src, Count) \
do \
{ \
YYPTRDIFF_T yyi; \
for (yyi = 0; yyi < (Count); yyi++) \
(Dst)[yyi] = (Src)[yyi]; \
} \
while (0)
# endif
# endif
#endif /* !YYCOPY_NEEDED */
/* YYFINAL -- State number of the termination state. */
#define YYFINAL 12
/* YYLAST -- Last index in YYTABLE. */
#define YYLAST 1582
/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS 96
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS 63
/* YYNRULES -- Number of rules. */
#define YYNRULES 237
/* YYNSTATES -- Number of states. */
#define YYNSTATES 767
#define YYUNDEFTOK 2
#define YYMAXUTOK 326
/* YYTRANSLATE(TOKEN-NUM) -- Symbol number corresponding to TOKEN-NUM
as returned by yylex, with out-of-bounds checking. */
#define YYTRANSLATE(YYX) \
(0 <= (YYX) && (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM
as returned by yylex. */
static const yytype_int8 yytranslate[] =
{
0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 94, 2, 73, 2,
92, 93, 79, 77, 86, 78, 88, 80, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 87, 85,
75, 84, 76, 91, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 89, 2, 90, 72, 95, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 82, 71, 83, 74, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 1, 2, 3, 4,
5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
15, 16, 17, 18, 19, 20, 21, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 33, 34,
35, 36, 37, 38, 39, 40, 41, 42, 43, 44,
45, 46, 47, 48, 49, 50, 51, 52, 53, 54,
55, 56, 57, 58, 59, 60, 61, 62, 63, 64,
65, 66, 67, 68, 69, 70, 81
};
#if YYDEBUG
/* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
static const yytype_int16 yyrline[] =
{
0, 101, 101, 107, 108, 109, 110, 111, 112, 120,
126, 127, 128, 129, 130, 131, 132, 133, 134, 135,
136, 137, 138, 139, 140, 141, 142, 143, 148, 149,
150, 151, 154, 155, 161, 164, 165, 169, 170, 171,
175, 176, 177, 180, 181, 184, 185, 186, 187, 190,
191, 194, 195, 196, 197, 198, 199, 205, 208, 209,
212, 213, 214, 215, 216, 217, 218, 219, 222, 223,
226, 227, 230, 231, 232, 233, 234, 235, 236, 237,
238, 242, 243, 246, 247, 250, 251, 254, 255, 256,
257, 260, 261, 268, 271, 272, 275, 276, 279, 282,
296, 309, 310, 311, 314, 315, 318, 319, 320, 321,
324, 325, 328, 329, 330, 331, 332, 340, 341, 342,
343, 344, 346, 347, 348, 349, 350, 351, 352, 373,
374, 375, 376, 377, 378, 379, 380, 381, 382, 383,
384, 385, 386, 387, 388, 389, 390, 391, 392, 393,
394, 395, 396, 397, 398, 401, 402, 403, 404, 405,
406, 407, 408, 409, 410, 411, 414, 415, 418, 419,
422, 423, 426, 435, 436, 439, 440, 444, 445, 446,
452, 459, 460, 463, 464, 467, 473, 474, 477, 478,
481, 487, 488, 491, 492, 495, 501, 505, 506, 509,
516, 517, 518, 519, 527, 538, 548, 560, 561, 565,
577, 578, 590, 591, 603, 606, 607, 617, 627, 636,
645, 653, 662, 670, 678, 687, 696, 704, 712, 719,
727, 734, 741, 747, 758, 759, 762, 763
};
#endif
#if YYDEBUG || YYERROR_VERBOSE || 0
/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
First, the terminals, then, starting at YYNTOKENS, nonterminals. */
static const char *const yytname[] =
{
"$end", "error", "$undefined", "lessOrEqual_token",
"greaterOrEqual_token", "negative_infinity_token", "equivalent_token",
"imply_token", "equal_token", "nonEqual_token",
"positive_infinity_token", "forall_token", "exists_token", "case_token",
"if_token", "switch_token", "then_token", "else_token",
"otherwise_token", "sum_token", "product_token", "kronDelta_token",
"diracDelta_token", "uniform_token", "bernoulli_token", "discrete_token",
"normal_token", "poisson_token", "exponential_token", "weibull_token",
"gama_token", "dirichlet_token", "multinomial_token", "types_token",
"variables_token", "cpfs_token", "cdfs_token", "reward_token",
"domain_token", "requirements_token", "objects_token",
"init_state_token", "state_action_constraints_token",
"action_preconditions_token", "state_invariants_token", "instance_token",
"non_fluents_token", "discount_token", "terminate_when_token",
"horizon_token", "max_nondef_actions_token", "doubleNum_token",
"id_token", "variable_token", "enum_token", "object_token",
"integer_token", "real_token", "bool_token", "true_token", "false_token",
"default_token", "level_token", "observ_fluent_token",
"action_fluent_token", "state_fluent_token", "intermediate_token",
"derived_fluent_token", "non_fluent_token", "intNum_token",
"AgregateOperator", "'|'", "'^'", "'&'", "'~'", "'<'", "'>'", "'+'",
"'-'", "'*'", "'/'", "NEGATIVE", "'{'", "'}'", "'='", "';'", "','",
"':'", "'.'", "'['", "']'", "'?'", "'('", "')'", "'$'", "'_'", "$accept",
"Program", "RddlBlock", "DomainBlock", "DomainList",
"RequirementsSection", "RequirementsList", "TypeSection", "TypeList",
"SchematicType", "EnumList", "TypeSpecification", "StructMemberList",
"LConst", "VarSection", "VarList", "VariableSchematic", "ParametarList",
"ParametarListTypeSpecs", "RangeConstant", "StructRangeConsant",
"StructRangeConsantList", "BoolType", "DoubleType", "IntType",
"CPFSection", "CPFHeader", "CPFList", "CPFSchematic",
"VariableExpression", "TermList", "Term", "MemberList", "Pterm",
"Expression", "StructExpressionList", "ExpressionList", "TypedVarList",
"TypedVariable", "CaseList", "CaseSchematic", "LConstCaseList",
"RewardsSection", "StateConstraintsSection", "StateConstraintList",
"StateConstraintSchematic", "ActionPreconditionsSection",
"ActionPreconditionsList", "ActionPreconditionsSchematic",
"StateInvariantSection", "StateInvariantList", "StateInvariantSchematic",
"ObjectsSection", "ObjectsList", "ObjectsSchematic", "ObjectsConstList",
"NonfluentBlock", "VariablesInstanceList", "VariableInstanceSchematic",
"LConstList", "InstanceBlock", "HorizonSpecification",
"PositiveIntOrPositiveInfinity", YY_NULLPTR
};
#endif
# ifdef YYPRINT
/* YYTOKNUM[NUM] -- (External) token number corresponding to the
(internal) symbol number NUM (which must be that of a token). */
static const yytype_int16 yytoknum[] =
{
0, 256, 257, 258, 259, 260, 261, 262, 263, 264,
265, 266, 267, 268, 269, 270, 271, 272, 273, 274,
275, 276, 277, 278, 279, 280, 281, 282, 283, 284,
285, 286, 287, 288, 289, 290, 291, 292, 293, 294,
295, 296, 297, 298, 299, 300, 301, 302, 303, 304,
305, 306, 307, 308, 309, 310, 311, 312, 313, 314,
315, 316, 317, 318, 319, 320, 321, 322, 323, 324,
325, 124, 94, 38, 126, 60, 62, 43, 45, 42,
47, 326, 123, 125, 61, 59, 44, 58, 46, 91,
93, 63, 40, 41, 36, 95
};
# endif
#define YYPACT_NINF (-472)
#define yypact_value_is_default(Yyn) \
((Yyn) == YYPACT_NINF)
#define YYTABLE_NINF (-1)
#define yytable_value_is_error(Yyn) \
0
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
STATE-NUM. */
static const yytype_int16 yypact[] =
{
52, -30, 0, 10, 112, 52, -472, -472, -472, 87,
103, 107, -472, -472, -472, -472, 245, 44, 160, 118,
127, -472, -472, 78, 9, 130, 134, 143, 155, 123,
245, 245, 245, 245, 162, 245, 245, 245, 245, 245,
144, 158, 198, 201, 1089, -17, 191, 242, 777, 853,
929, -472, -472, -472, -472, -472, 249, -472, -472, -472,
-472, -472, 254, 272, 233, 243, 198, -51, 244, 201,
235, 236, 241, 250, 255, 263, 257, 270, 271, 274,
275, 276, 279, 22, 280, 286, 287, 288, -472, 138,
-472, -472, -472, -472, -472, 1089, 151, 1089, 1089, 1089,
1089, 284, -472, 1334, 295, 298, 277, -2, 301, 299,
242, 308, 1357, 311, 1089, 310, 1368, 316, 1089, 319,
1379, 322, 320, 75, 324, 249, 300, 323, 325, 142,
326, -472, -472, 71, 330, 328, -472, 332, 336, 1089,
-22, 341, 342, 1089, 1089, 1089, 1089, 373, 1089, 1089,
1089, 1089, 1089, 1089, 374, 375, -16, 1089, -22, -472,
-472, -472, -472, -472, -472, -472, -472, 343, -472, -472,
-472, 682, 80, -472, 1089, 1089, 1089, 1089, 1089, 1089,
1089, 1089, 1089, 1089, 1089, 1089, 1089, 1089, 1089, -472,
376, -472, 344, 347, 351, 354, 352, -472, -472, -472,
353, -472, -472, -472, 355, -472, -472, -472, 363, 1089,
364, -472, 1089, 146, 39, 365, 367, 151, 385, 401,
-472, -472, -472, -472, -472, 371, 382, 82, -472, 411,
411, 232, -472, -472, 416, -472, 384, 411, 411, 268,
383, 739, 394, 392, 891, 413, 705, 438, 1051, 1195,
393, 395, -472, -472, -472, 249, 249, 428, 240, 1223,
406, 389, 415, 1089, -472, -472, 297, 297, 1493, 655,
297, 297, 1502, 40, 40, 297, 297, -33, -33, -472,
-472, -472, -472, -472, 417, -29, -472, -472, -472, -472,
-472, -472, 1414, 421, 422, 423, 424, 437, 420, 430,
444, -472, -472, 451, 441, 91, 453, 447, 71, 452,
454, 455, 456, 457, 458, 459, 460, 463, 464, 472,
522, -472, 474, 475, 476, -472, -472, 1089, -472, 151,
1089, -472, -472, -472, 1089, 1089, 1089, 1089, 467, 468,
-472, 72, -472, 1089, -472, 240, -22, 1241, -472, 479,
508, 496, -472, 242, -13, 528, 11, 1, 527, 242,
-13, 497, 71, 529, 493, 500, 511, -472, -472, 71,
71, 71, 71, 71, 71, 538, 1089, 411, 1089, 1089,
6, 1089, 1089, 491, 513, 521, 516, 526, 545, 569,
1276, -472, -472, -472, -472, -472, 1165, 151, -29, 540,
530, 544, 129, 576, 546, -13, 547, -472, 539, -472,
-472, 548, 550, 552, 553, -472, 551, 557, -472, 585,
-472, 559, 568, 567, 570, 38, 88, 574, -472, 1471,
-472, 1471, 1459, -22, 543, 571, 575, 1471, 1471, -472,
1013, -472, -472, -472, -472, -472, 151, -472, -472, -29,
-472, 580, 647, -472, 151, 563, 581, -472, 206, 1089,
618, 617, 584, 586, 151, 587, 591, 588, 611, 613,
602, 630, 608, 632, 634, 1089, 609, 1089, -472, 6,
-472, 1322, 607, -472, 273, -472, -472, -472, -472, -472,
-472, -472, -472, 124, -11, 627, 628, 652, 620, -472,
-472, -472, 624, 622, 151, 131, 635, 636, 637, 638,
604, 639, 644, -12, 654, -472, 653, 71, -472, 656,
660, -472, 665, -472, 666, 667, 1471, 1089, 1471, -472,
151, -472, 670, 674, 679, 680, 633, 677, 643, -472,
-472, -472, 124, 124, -472, -472, 151, 148, 673, 683,
684, 242, -13, 1, 721, -472, 723, 688, 691, -472,
-472, -472, 698, 647, 647, 647, 647, 647, 1471, -472,
-13, -13, 1, 728, 647, 647, -472, 703, 710, -472,
647, -472, 702, 1, 743, 711, 730, 708, 736, 737,
-472, -13, 738, 741, 744, 749, 750, 751, 752, 755,
754, 742, -472, 756, 732, 747, 758, -472, 759, 757,
760, 762, 618, 797, 798, 767, -472, 768, 771, 772,
773, 774, 776, 778, 618, 811, 151, -472, -472, -472,
618, 819, 19, 199, 801, 802, 803, 804, -472, -472,
-472, -472, -472, 219, 849, 806, 807, -472, 808, 816,
814, 818, 823, 825, 826, 856, 827, 831, 832, 833,
834, 836, 869, 837, 874, 840, -13, 1, 877, 1,
878, 842, -472, -472, -472, 1, 882, -13, 848, -472,
850, -472, 852, 854, 862, 880, 888, 886, 889, 892,
855, 922, 924, 893, 618, 928, 618, 933, 900, 618,
935, 902, 905, 906, 246, 907, 908, 909, 910, 913,
912, 914, 618, 917, 918, 921, 923, 955, 926, 963,
930, -472, 964, 931, 932, -472, -472, 1, 968, 936,
-472, 938, -472, 942, -472, 969, 934, 945, 979, 995,
996, 965, 618, 997, 966, 967, 971, 999, 976, 977,
970, 980, 985, 984, 1023, 988, -472, -472, -472, 991,
992, -472, -472, 1024, 993, 994, -472
};
/* YYDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM.
Performed when YYTABLE does not specify something else to do. Zero
means the default is an error. */
static const yytype_uint8 yydefact[] =
{
0, 0, 0, 0, 0, 2, 3, 5, 4, 0,
0, 0, 1, 6, 8, 7, 0, 0, 0, 0,
0, 94, 95, 0, 0, 0, 0, 0, 0, 0,
25, 19, 20, 21, 0, 22, 23, 26, 27, 24,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 9, 16, 10, 11, 12, 0, 13, 14, 17,
18, 15, 0, 0, 0, 0, 35, 0, 0, 58,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 149, 99,
117, 119, 151, 152, 150, 0, 0, 0, 0, 0,
0, 0, 118, 0, 32, 0, 0, 0, 0, 0,
197, 0, 0, 0, 183, 0, 0, 0, 188, 0,
0, 0, 193, 99, 0, 96, 0, 0, 0, 0,
0, 36, 68, 0, 0, 0, 59, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 101,
146, 51, 53, 56, 54, 55, 52, 0, 121, 131,
130, 0, 0, 120, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 180,
0, 31, 0, 0, 0, 0, 0, 198, 182, 185,
0, 184, 187, 190, 0, 189, 192, 195, 0, 0,
0, 97, 0, 0, 0, 0, 0, 0, 0, 0,
34, 45, 46, 47, 48, 70, 0, 0, 57, 0,
0, 0, 106, 108, 0, 107, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 112, 115, 103, 0, 0, 0, 110, 168,
0, 0, 104, 0, 142, 141, 137, 138, 147, 148,
139, 140, 145, 143, 144, 136, 135, 129, 132, 133,
134, 33, 30, 29, 0, 0, 196, 181, 186, 191,
194, 93, 0, 0, 0, 0, 0, 0, 0, 0,
0, 38, 37, 0, 0, 43, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 170, 0,
0, 109, 0, 0, 0, 156, 158, 0, 155, 0,
0, 162, 154, 153, 0, 0, 0, 0, 0, 0,
116, 0, 111, 0, 122, 100, 0, 0, 28, 200,
0, 0, 98, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 71, 69, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 114, 113, 169, 102, 105, 166, 0, 0, 202,
0, 0, 0, 0, 0, 207, 0, 237, 0, 236,
234, 0, 0, 0, 0, 42, 49, 43, 44, 0,
39, 0, 0, 0, 0, 0, 0, 0, 172, 123,
171, 124, 0, 0, 0, 0, 173, 125, 126, 159,
0, 157, 160, 163, 164, 161, 0, 167, 201, 0,
199, 0, 0, 210, 0, 212, 0, 208, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 128, 0,
178, 177, 0, 203, 0, 90, 89, 87, 75, 77,
85, 86, 91, 0, 0, 0, 0, 0, 0, 72,
73, 74, 215, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 50, 0, 0, 67, 0,
0, 65, 0, 66, 0, 0, 127, 0, 176, 174,
0, 165, 0, 0, 0, 0, 0, 0, 0, 82,
88, 92, 0, 0, 76, 214, 0, 0, 0, 0,
0, 0, 0, 0, 0, 235, 0, 0, 0, 206,
205, 40, 0, 0, 0, 0, 0, 0, 175, 179,
0, 0, 0, 0, 0, 0, 78, 0, 0, 216,
0, 209, 0, 0, 0, 0, 0, 0, 0, 0,
232, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 81, 83, 0, 0, 0, 211, 0, 0,
0, 0, 0, 0, 0, 0, 41, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 80, 79, 213,
0, 0, 0, 0, 0, 0, 0, 0, 62, 60,
63, 64, 61, 0, 0, 0, 0, 84, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 231, 224, 204, 0, 0, 0, 0, 230,
0, 228, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 223, 0, 0, 0, 222, 220, 0, 0, 0,
229, 0, 227, 0, 226, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 221, 219, 218, 0,
0, 225, 233, 0, 0, 0, 217
};
/* YYPGOTO[NTERM-NUM]. */
static const yytype_int16 yypgoto[] =
{
-472, -472, -472, 1074, 228, -472, -87, -472, 867, -472,
717, -345, 619, -95, -472, 1012, -472, -472, 781, -210,
-226, 466, -472, -472, -472, -472, -472, 959, -472, -48,
740, -136, -249, -472, -44, 696, 753, -223, -472, 606,
-472, -436, -472, -472, 981, -472, -472, 1007, -472, -472,
885, -472, -472, -108, -472, -385, 1092, -348, -472, -471,
1093, -442, -354
};
/* YYDEFGOTO[NTERM-NUM]. */
static const yytype_int16 yydefgoto[] =
{
-1, 4, 5, 6, 29, 30, 106, 31, 65, 66,
306, 225, 303, 537, 32, 68, 69, 134, 226, 498,
538, 539, 499, 500, 501, 33, 34, 124, 125, 102,
261, 262, 159, 258, 112, 168, 260, 317, 318, 435,
436, 385, 35, 36, 113, 114, 37, 117, 118, 38,
121, 122, 39, 109, 110, 351, 7, 404, 405, 503,
8, 298, 410
};
/* YYTABLE[YYPACT[STATE-NUM]] -- What to do in state STATE-NUM. If
positive, shift that token. If negative, reduce the rule whose
number is the opposite. If YYTABLE_NINF, syntax error. */
static const yytype_int16 yytable[] =
{
103, 167, 197, 411, 236, 116, 120, 319, 126, 342,
482, 407, 414, 448, 323, 324, 509, 416, 511, 433,
194, 407, 9, 349, 422, 423, 424, 425, 426, 427,
123, 232, 233, 548, 558, 104, 132, 252, 253, 402,
540, 133, 535, 174, 175, 254, 187, 188, 178, 179,
104, 160, 10, 169, 170, 171, 172, 457, 541, 408,
650, 403, 11, 550, 483, 350, 105, 434, 296, 651,
409, 559, 234, 255, 116, 579, 256, 126, 257, 299,
409, 193, 40, 174, 175, 300, 176, 177, 178, 179,
1, 45, 235, 46, 569, 231, 394, 2, 3, 239,
240, 241, 242, 281, 244, 245, 246, 247, 248, 249,
235, 150, 12, 259, 151, 183, 184, 185, 186, 187,
188, 470, 304, 221, 471, 252, 253, 222, 223, 224,
266, 267, 268, 269, 270, 271, 272, 273, 274, 275,
276, 277, 278, 279, 280, 310, 311, 312, 313, 314,
315, 180, 181, 182, 430, 183, 184, 185, 186, 187,
188, 255, 44, 156, 256, 120, 257, 158, 292, 16,
634, 472, 562, 265, 473, 161, 162, 363, 163, 364,
296, 549, 645, 164, 165, 17, 293, 294, 648, 18,
652, 654, 295, 166, 215, 296, 297, 216, 41, 587,
42, 660, 161, 162, 586, 163, 51, 338, 339, 43,
164, 165, 47, 452, 453, 536, 48, 217, 600, 347,
166, 454, 598, 599, 218, 49, 156, 157, 62, 608,
158, 219, 580, 581, 384, 174, 175, 50, 176, 177,
178, 179, 63, 615, 56, 401, 506, 507, 296, 653,
64, 413, 705, 67, 707, 296, 508, 710, 52, 53,
54, 55, 716, 57, 58, 59, 60, 61, 296, 659,
724, 174, 175, 107, 176, 177, 178, 179, 19, 20,
21, 22, 23, 383, 24, 25, 386, 26, 27, 28,
387, 388, 389, 390, 108, 296, 715, 476, 235, 259,
748, 123, 167, 180, 181, 182, 127, 183, 184, 185,
186, 187, 188, 683, 532, 685, 577, 578, 682, 533,
129, 688, 296, 534, 128, 320, 130, 135, 341, 690,
137, 138, 429, 139, 431, 432, 173, 437, 438, 180,
181, 182, 140, 183, 184, 185, 186, 187, 188, 143,
141, 384, 276, 593, 594, 595, 596, 597, 142, 502,
192, 325, 144, 145, 602, 603, 146, 147, 148, 304,
606, 149, 152, 736, 185, 186, 187, 188, 153, 154,
155, 190, 196, 191, 212, 235, 174, 175, 195, 176,
177, 178, 179, 198, 200, 202, 481, 174, 175, 204,
176, 177, 178, 179, 206, 208, 209, 210, 213, 502,
214, 220, 227, 228, 229, 510, 174, 175, 230, 176,
177, 178, 179, 237, 238, 243, 250, 251, 104, 282,
263, 526, 283, 528, 284, 384, 285, 286, 287, 305,
288, 174, 175, 585, 176, 177, 178, 179, 289, 291,
301, 502, 302, 307, 180, 181, 182, 308, 183, 184,
185, 186, 187, 188, 316, 180, 181, 182, 321, 183,
184, 185, 186, 187, 188, 309, 326, 322, 329, 336,
340, 337, 345, 568, 180, 181, 182, 328, 183, 184,
185, 186, 187, 188, 174, 175, 344, 176, 177, 178,
179, 346, 348, 353, 354, 358, 331, 355, 356, 180,
181, 182, 359, 183, 184, 185, 186, 187, 188, 174,
175, 357, 176, 177, 178, 179, 360, 361, 362, 174,
175, 333, 176, 177, 178, 179, 365, 366, 379, 368,
369, 370, 371, 372, 373, 374, 376, 375, 174, 175,
377, 176, 177, 178, 179, 378, 380, 391, 381, 382,
399, 392, 180, 181, 182, 398, 183, 184, 185, 186,
187, 188, 174, 175, 412, 176, 177, 178, 179, 400,
406, 419, 415, 417, 439, 420, 421, 180, 181, 182,
428, 183, 184, 185, 186, 187, 188, 180, 181, 182,
440, 183, 184, 185, 186, 187, 188, 174, 175, 442,
176, 177, 178, 179, 441, 450, 180, 181, 182, 443,
183, 184, 185, 186, 187, 188, 449, 451, 455, 456,
477, 459, 458, 460, 461, 462, 463, 464, 444, 465,
180, 181, 182, 363, 183, 184, 185, 186, 187, 188,
466, 467, 485, 468, 478, 504, 469, 486, 174, 175,
474, 479, 445, 178, 179, 484, 505, 296, 512, 513,
516, 514, 519, 518, 520, 180, 181, 182, 517, 183,
184, 185, 186, 187, 188, 174, 175, 521, 176, 177,
178, 179, 522, 523, 524, 525, 527, 555, 487, 488,
531, 489, 542, 543, 544, 545, 490, 491, 174, 175,
546, 176, 177, 178, 179, 547, 492, 551, 552, 576,
574, 553, 493, 554, 556, 494, 180, 181, 182, 557,
183, 184, 185, 186, 187, 188, 495, 560, 561, 496,
563, 497, 174, 175, 564, 176, 177, 178, 179, 565,
566, 567, 570, 180, 181, 182, 571, 183, 184, 185,
186, 187, 188, 572, 575, 573, 582, 583, 588, 584,
589, 590, 264, 591, 592, 601, 180, 181, 182, 604,
183, 184, 185, 186, 187, 188, 605, 607, 70, 71,
609, 72, 73, 612, 610, 332, 74, 75, 76, 77,
78, 79, 80, 81, 82, 83, 84, 85, 86, 87,
180, 181, 182, 611, 183, 184, 185, 186, 187, 188,
613, 614, 627, 616, 617, 327, 625, 618, 88, 89,
90, 91, 619, 620, 621, 622, 92, 93, 623, 624,
628, 631, 626, 629, 630, 632, 94, 633, 635, 636,
637, 95, 96, 638, 97, 98, 639, 640, 641, 642,
111, 643, 646, 644, 70, 71, 99, 72, 73, 100,
649, 101, 74, 75, 76, 77, 78, 79, 80, 81,
82, 83, 84, 85, 86, 87, 655, 656, 657, 658,
661, 662, 663, 664, 174, 175, 666, 176, 177, 178,
179, 665, 667, 671, 88, 89, 90, 91, 668, 669,
672, 670, 92, 93, 673, 674, 678, 675, 677, 676,
679, 680, 94, 681, 684, 686, 687, 95, 96, 689,
97, 98, 691, 131, 692, 693, 115, 698, 701, 694,
70, 71, 99, 72, 73, 100, 695, 101, 74, 75,
76, 77, 78, 79, 80, 81, 82, 83, 84, 85,
86, 87, 180, 181, 182, 696, 183, 184, 185, 186,
187, 188, 697, 702, 699, 703, 700, 330, 704, 706,
88, 89, 90, 91, 708, 709, 711, 712, 92, 93,
713, 714, 717, 718, 719, 720, 721, 722, 94, 723,
725, 726, 729, 95, 96, 727, 97, 98, 728, 730,
731, 733, 119, 732, 734, 737, 741, 735, 99, 742,
738, 100, 739, 101, 70, 71, 740, 72, 73, 743,
744, 480, 74, 75, 76, 77, 78, 79, 80, 81,
82, 83, 84, 85, 86, 87, 745, 746, 749, 747,
753, 750, 751, 756, 174, 175, 752, 176, 177, 178,
179, 754, 755, 757, 88, 89, 90, 91, 758, 759,
760, 761, 92, 93, 762, 764, 763, 766, 765, 13,
418, 136, 94, 515, 211, 529, 395, 95, 96, 367,
97, 98, 647, 447, 290, 201, 393, 14, 15, 0,
70, 71, 99, 72, 73, 100, 0, 101, 74, 75,
76, 77, 78, 79, 80, 81, 82, 83, 84, 85,
86, 87, 180, 181, 182, 205, 183, 184, 185, 186,
187, 188, 0, 0, 0, 0, 0, 334, 0, 0,
88, 89, 90, 91, 0, 0, 0, 0, 92, 93,
0, 0, 0, 0, 0, 0, 0, 0, 94, 0,
0, 0, 0, 95, 96, 0, 97, 98, 0, 0,
0, 0, 0, 0, 0, 0, 70, 71, 99, 72,
73, 100, 0, 101, 74, 75, 76, 77, 78, 79,
80, 81, 82, 83, 84, 85, 86, 87, 174, 175,
0, 176, 177, 178, 179, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 88, 89, 90, 91,
0, 0, 0, 0, 92, 93, 174, 175, 0, 176,
177, 178, 179, 0, 94, 0, 0, 0, 0, 95,
0, 0, 97, 98, 174, 175, 0, 176, 177, 178,
179, 0, 0, 0, 99, 0, 0, 100, 0, 101,
0, 0, 0, 0, 0, 0, 180, 181, 182, 0,
183, 184, 185, 186, 187, 188, 0, 0, 0, 174,
175, 335, 176, 177, 178, 179, 0, 0, 0, 0,
0, 0, 0, 0, 180, 181, 182, 0, 183, 184,
185, 186, 187, 188, 0, 0, 0, 0, 0, 343,
0, 0, 180, 181, 182, 0, 183, 396, 185, 186,
187, 188, 0, 0, 0, 174, 175, 397, 176, 177,
178, 179, 0, 0, 0, 0, 0, 174, 175, 0,
176, 177, 178, 179, 0, 0, 0, 180, 181, 182,
0, 183, 184, 185, 186, 187, 188, 0, 0, 0,
174, 175, 446, 176, 177, 178, 179, 0, 0, 0,
0, 174, 175, 0, 176, 177, 178, 179, 0, 0,
0, 0, 174, 175, 0, 176, 177, 178, 179, 0,
0, 0, 0, 180, 181, 182, 0, 183, 184, 185,
186, 187, 188, 0, 0, 180, 181, 182, 530, 183,
184, 185, 186, 187, 188, 0, 0, 174, 175, 189,
176, 177, 178, 179, 0, 0, 0, 0, 180, 181,
182, 0, 183, 184, 185, 186, 187, 188, 0, 180,
181, 182, 199, 183, 184, 185, 186, 187, 188, 0,
180, 181, 182, 203, 183, 184, 185, 186, 187, 188,
0, 0, 174, 175, 207, 176, 177, 178, 179, 0,
0, 0, 0, 0, 174, 175, 475, 176, 177, 178,
179, 0, 0, 0, 0, 180, 181, 182, 0, 183,
184, 185, 186, 187, 188, 0, 174, 175, 0, 352,
177, 178, 179, 0, 0, 174, 175, 0, 0, 0,
178, 179, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
180, 181, 182, 0, 183, 184, 185, 186, 187, 188,
0, 0, 180, 181, 182, 0, 183, 184, 185, 186,
187, 188, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 180, 181, 182, 0, 183, 184,
185, 186, 187, 188, 181, 182, 0, 183, 184, 185,
186, 187, 188
};
static const yytype_int16 yycheck[] =
{
44, 96, 110, 357, 140, 49, 50, 230, 56, 258,
446, 10, 360, 398, 237, 238, 458, 362, 460, 13,
107, 10, 52, 52, 369, 370, 371, 372, 373, 374,
52, 53, 54, 504, 46, 52, 87, 53, 54, 52,
51, 92, 484, 3, 4, 61, 79, 80, 8, 9,
52, 95, 52, 97, 98, 99, 100, 405, 69, 48,
41, 74, 52, 505, 449, 94, 83, 61, 49, 50,
69, 83, 94, 89, 118, 546, 92, 125, 94, 40,
69, 83, 38, 3, 4, 46, 6, 7, 8, 9,
38, 82, 140, 84, 530, 139, 345, 45, 46, 143,
144, 145, 146, 190, 148, 149, 150, 151, 152, 153,
158, 89, 0, 157, 92, 75, 76, 77, 78, 79,
80, 83, 217, 52, 86, 53, 54, 56, 57, 58,
174, 175, 176, 177, 178, 179, 180, 181, 182, 183,
184, 185, 186, 187, 188, 63, 64, 65, 66, 67,
68, 71, 72, 73, 377, 75, 76, 77, 78, 79,
80, 89, 84, 88, 92, 209, 94, 92, 212, 82,
612, 83, 517, 93, 86, 51, 52, 86, 54, 88,
49, 50, 624, 59, 60, 82, 40, 41, 630, 82,
632, 633, 46, 69, 52, 49, 50, 55, 38, 553,
82, 643, 51, 52, 552, 54, 83, 255, 256, 82,
59, 60, 82, 84, 85, 91, 82, 75, 572, 263,
69, 92, 570, 571, 82, 82, 88, 89, 84, 583,
92, 89, 84, 85, 329, 3, 4, 82, 6, 7,
8, 9, 84, 591, 82, 353, 40, 41, 49, 50,
52, 359, 694, 52, 696, 49, 50, 699, 30, 31,
32, 33, 704, 35, 36, 37, 38, 39, 49, 50,
712, 3, 4, 82, 6, 7, 8, 9, 33, 34,
35, 36, 37, 327, 39, 40, 330, 42, 43, 44,
334, 335, 336, 337, 52, 49, 50, 433, 346, 343,
742, 52, 397, 71, 72, 73, 52, 75, 76, 77,
78, 79, 80, 667, 41, 669, 542, 543, 666, 46,
87, 675, 49, 50, 52, 93, 83, 83, 88, 677,
95, 95, 376, 92, 378, 379, 52, 381, 382, 71,
72, 73, 92, 75, 76, 77, 78, 79, 80, 92,
95, 446, 396, 563, 564, 565, 566, 567, 95, 454,
83, 93, 92, 92, 574, 575, 92, 92, 92, 464,
580, 92, 92, 727, 77, 78, 79, 80, 92, 92,
92, 86, 83, 85, 84, 433, 3, 4, 87, 6,
7, 8, 9, 85, 83, 85, 440, 3, 4, 83,
6, 7, 8, 9, 85, 83, 86, 83, 85, 504,
85, 85, 82, 85, 82, 459, 3, 4, 82, 6,
7, 8, 9, 82, 82, 52, 52, 52, 52, 85,
87, 475, 85, 477, 83, 530, 82, 85, 85, 54,
85, 3, 4, 551, 6, 7, 8, 9, 85, 85,
85, 546, 85, 52, 71, 72, 73, 86, 75, 76,
77, 78, 79, 80, 53, 71, 72, 73, 52, 75,
76, 77, 78, 79, 80, 93, 93, 93, 86, 86,
52, 86, 93, 527, 71, 72, 73, 93, 75, 76,
77, 78, 79, 80, 3, 4, 90, 6, 7, 8,
9, 86, 85, 82, 82, 85, 93, 84, 84, 71,
72, 73, 82, 75, 76, 77, 78, 79, 80, 3,
4, 84, 6, 7, 8, 9, 82, 76, 87, 3,
4, 93, 6, 7, 8, 9, 83, 90, 16, 87,
86, 86, 86, 86, 86, 86, 83, 87, 3, 4,
86, 6, 7, 8, 9, 83, 82, 90, 83, 83,
52, 93, 71, 72, 73, 86, 75, 76, 77, 78,
79, 80, 3, 4, 47, 6, 7, 8, 9, 83,
52, 88, 85, 54, 93, 85, 75, 71, 72, 73,
52, 75, 76, 77, 78, 79, 80, 71, 72, 73,
87, 75, 76, 77, 78, 79, 80, 3, 4, 93,
6, 7, 8, 9, 93, 85, 71, 72, 73, 93,
75, 76, 77, 78, 79, 80, 86, 83, 52, 83,
87, 92, 85, 85, 84, 83, 83, 86, 93, 54,
71, 72, 73, 86, 75, 76, 77, 78, 79, 80,
91, 83, 5, 86, 83, 92, 86, 10, 3, 4,
86, 86, 93, 8, 9, 85, 85, 49, 51, 85,
83, 85, 61, 85, 61, 71, 72, 73, 87, 75,
76, 77, 78, 79, 80, 3, 4, 85, 6, 7,
8, 9, 62, 85, 62, 61, 87, 93, 51, 52,
93, 54, 75, 75, 52, 85, 59, 60, 3, 4,
86, 6, 7, 8, 9, 93, 69, 82, 82, 76,
87, 84, 75, 85, 85, 78, 71, 72, 73, 85,
75, 76, 77, 78, 79, 80, 89, 83, 85, 92,
84, 94, 3, 4, 84, 6, 7, 8, 9, 84,
84, 84, 82, 71, 72, 73, 82, 75, 76, 77,
78, 79, 80, 84, 87, 85, 93, 84, 47, 85,
47, 83, 90, 82, 76, 47, 71, 72, 73, 76,
75, 76, 77, 78, 79, 80, 76, 85, 11, 12,
47, 14, 15, 85, 83, 90, 19, 20, 21, 22,
23, 24, 25, 26, 27, 28, 29, 30, 31, 32,
71, 72, 73, 83, 75, 76, 77, 78, 79, 80,
84, 84, 90, 85, 83, 86, 84, 83, 51, 52,
53, 54, 83, 83, 83, 83, 59, 60, 83, 85,
93, 84, 86, 85, 85, 85, 69, 85, 51, 51,
83, 74, 75, 85, 77, 78, 85, 85, 85, 85,
83, 85, 51, 85, 11, 12, 89, 14, 15, 92,
51, 94, 19, 20, 21, 22, 23, 24, 25, 26,
27, 28, 29, 30, 31, 32, 85, 85, 85, 85,
41, 85, 85, 85, 3, 4, 82, 6, 7, 8,
9, 85, 84, 47, 51, 52, 53, 54, 85, 84,
83, 85, 59, 60, 83, 83, 47, 84, 82, 85,
83, 47, 69, 83, 47, 47, 84, 74, 75, 47,
77, 78, 84, 66, 84, 83, 83, 51, 83, 85,
11, 12, 89, 14, 15, 92, 84, 94, 19, 20,
21, 22, 23, 24, 25, 26, 27, 28, 29, 30,
31, 32, 71, 72, 73, 85, 75, 76, 77, 78,
79, 80, 84, 51, 85, 51, 84, 86, 85, 51,
51, 52, 53, 54, 51, 85, 51, 85, 59, 60,
85, 85, 85, 85, 85, 85, 83, 85, 69, 85,
83, 83, 47, 74, 75, 84, 77, 78, 85, 83,
47, 47, 83, 83, 83, 47, 47, 85, 89, 85,
84, 92, 84, 94, 11, 12, 84, 14, 15, 84,
51, 18, 19, 20, 21, 22, 23, 24, 25, 26,
27, 28, 29, 30, 31, 32, 51, 51, 51, 84,
51, 85, 85, 83, 3, 4, 85, 6, 7, 8,
9, 85, 85, 83, 51, 52, 53, 54, 83, 85,
47, 83, 59, 60, 83, 51, 84, 83, 85, 5,
363, 69, 69, 464, 125, 479, 346, 74, 75, 308,
77, 78, 626, 397, 209, 114, 343, 5, 5, -1,
11, 12, 89, 14, 15, 92, -1, 94, 19, 20,
21, 22, 23, 24, 25, 26, 27, 28, 29, 30,
31, 32, 71, 72, 73, 118, 75, 76, 77, 78,
79, 80, -1, -1, -1, -1, -1, 86, -1, -1,
51, 52, 53, 54, -1, -1, -1, -1, 59, 60,
-1, -1, -1, -1, -1, -1, -1, -1, 69, -1,
-1, -1, -1, 74, 75, -1, 77, 78, -1, -1,
-1, -1, -1, -1, -1, -1, 11, 12, 89, 14,
15, 92, -1, 94, 19, 20, 21, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 3, 4,
-1, 6, 7, 8, 9, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, 51, 52, 53, 54,
-1, -1, -1, -1, 59, 60, 3, 4, -1, 6,
7, 8, 9, -1, 69, -1, -1, -1, -1, 74,
-1, -1, 77, 78, 3, 4, -1, 6, 7, 8,
9, -1, -1, -1, 89, -1, -1, 92, -1, 94,
-1, -1, -1, -1, -1, -1, 71, 72, 73, -1,
75, 76, 77, 78, 79, 80, -1, -1, -1, 3,
4, 86, 6, 7, 8, 9, -1, -1, -1, -1,
-1, -1, -1, -1, 71, 72, 73, -1, 75, 76,
77, 78, 79, 80, -1, -1, -1, -1, -1, 86,
-1, -1, 71, 72, 73, -1, 75, 76, 77, 78,
79, 80, -1, -1, -1, 3, 4, 86, 6, 7,
8, 9, -1, -1, -1, -1, -1, 3, 4, -1,
6, 7, 8, 9, -1, -1, -1, 71, 72, 73,
-1, 75, 76, 77, 78, 79, 80, -1, -1, -1,
3, 4, 86, 6, 7, 8, 9, -1, -1, -1,
-1, 3, 4, -1, 6, 7, 8, 9, -1, -1,
-1, -1, 3, 4, -1, 6, 7, 8, 9, -1,
-1, -1, -1, 71, 72, 73, -1, 75, 76, 77,
78, 79, 80, -1, -1, 71, 72, 73, 86, 75,
76, 77, 78, 79, 80, -1, -1, 3, 4, 85,
6, 7, 8, 9, -1, -1, -1, -1, 71, 72,
73, -1, 75, 76, 77, 78, 79, 80, -1, 71,
72, 73, 85, 75, 76, 77, 78, 79, 80, -1,
71, 72, 73, 85, 75, 76, 77, 78, 79, 80,
-1, -1, 3, 4, 85, 6, 7, 8, 9, -1,
-1, -1, -1, -1, 3, 4, 17, 6, 7, 8,
9, -1, -1, -1, -1, 71, 72, 73, -1, 75,
76, 77, 78, 79, 80, -1, 3, 4, -1, 85,
7, 8, 9, -1, -1, 3, 4, -1, -1, -1,
8, 9, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
71, 72, 73, -1, 75, 76, 77, 78, 79, 80,
-1, -1, 71, 72, 73, -1, 75, 76, 77, 78,
79, 80, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, 71, 72, 73, -1, 75, 76,
77, 78, 79, 80, 72, 73, -1, 75, 76, 77,
78, 79, 80
};
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
symbol of state STATE-NUM. */
static const yytype_uint8 yystos[] =
{
0, 38, 45, 46, 97, 98, 99, 152, 156, 52,
52, 52, 0, 99, 152, 156, 82, 82, 82, 33,
34, 35, 36, 37, 39, 40, 42, 43, 44, 100,
101, 103, 110, 121, 122, 138, 139, 142, 145, 148,
38, 38, 82, 82, 84, 82, 84, 82, 82, 82,
82, 83, 100, 100, 100, 100, 82, 100, 100, 100,
100, 100, 84, 84, 52, 104, 105, 52, 111, 112,
11, 12, 14, 15, 19, 20, 21, 22, 23, 24,
25, 26, 27, 28, 29, 30, 31, 32, 51, 52,
53, 54, 59, 60, 69, 74, 75, 77, 78, 89,
92, 94, 125, 130, 52, 83, 102, 82, 52, 149,
150, 83, 130, 140, 141, 83, 130, 143, 144, 83,
130, 146, 147, 52, 123, 124, 125, 52, 52, 87,
83, 104, 87, 92, 113, 83, 111, 95, 95, 92,
92, 95, 95, 92, 92, 92, 92, 92, 92, 92,
89, 92, 92, 92, 92, 92, 88, 89, 92, 128,
130, 51, 52, 54, 59, 60, 69, 109, 131, 130,
130, 130, 130, 52, 3, 4, 6, 7, 8, 9,
71, 72, 73, 75, 76, 77, 78, 79, 80, 85,
86, 85, 83, 83, 102, 87, 83, 149, 85, 85,
83, 140, 85, 85, 83, 143, 85, 85, 83, 86,
83, 123, 84, 85, 85, 52, 55, 75, 82, 89,
85, 52, 56, 57, 58, 107, 114, 82, 85, 82,
82, 130, 53, 54, 94, 125, 127, 82, 82, 130,
130, 130, 130, 52, 130, 130, 130, 130, 130, 130,
52, 52, 53, 54, 61, 89, 92, 94, 129, 130,
132, 126, 127, 87, 90, 93, 130, 130, 130, 130,
130, 130, 130, 130, 130, 130, 130, 130, 130, 130,
130, 102, 85, 85, 83, 82, 85, 85, 85, 85,
146, 85, 130, 40, 41, 46, 49, 50, 157, 40,
46, 85, 85, 108, 109, 54, 106, 52, 86, 93,
63, 64, 65, 66, 67, 68, 53, 133, 134, 133,
93, 52, 93, 133, 133, 93, 93, 86, 93, 86,
86, 93, 90, 93, 86, 86, 86, 86, 125, 125,
52, 88, 128, 86, 90, 93, 86, 130, 85, 52,
94, 151, 85, 82, 82, 84, 84, 84, 85, 82,
82, 76, 87, 86, 88, 83, 90, 114, 87, 86,
86, 86, 86, 86, 86, 87, 83, 86, 83, 16,
82, 83, 83, 130, 109, 137, 130, 130, 130, 130,
130, 90, 93, 132, 128, 126, 76, 86, 86, 52,
83, 149, 52, 74, 153, 154, 52, 10, 48, 69,
158, 158, 47, 149, 153, 85, 107, 54, 106, 88,
85, 75, 107, 107, 107, 107, 107, 107, 52, 130,
133, 130, 130, 13, 61, 135, 136, 130, 130, 93,
87, 93, 93, 93, 93, 93, 86, 131, 151, 86,
85, 83, 84, 85, 92, 52, 83, 153, 85, 92,
85, 84, 83, 83, 86, 54, 91, 83, 86, 86,
83, 86, 83, 86, 86, 17, 127, 87, 83, 86,
18, 130, 137, 151, 85, 5, 10, 51, 52, 54,
59, 60, 69, 75, 78, 89, 92, 94, 115, 118,
119, 120, 109, 155, 92, 85, 40, 41, 50, 157,
130, 157, 51, 85, 85, 108, 83, 87, 85, 61,
61, 85, 62, 85, 62, 61, 130, 87, 130, 135,
86, 93, 41, 46, 50, 157, 91, 109, 116, 117,
51, 69, 75, 75, 52, 85, 86, 93, 155, 50,
157, 82, 82, 84, 85, 93, 85, 85, 46, 83,
83, 85, 107, 84, 84, 84, 84, 84, 130, 137,
82, 82, 84, 85, 87, 87, 76, 116, 116, 155,
84, 85, 93, 84, 85, 149, 153, 158, 47, 47,
83, 82, 76, 115, 115, 115, 115, 115, 153, 153,
158, 47, 115, 115, 76, 76, 115, 85, 158, 47,
83, 83, 85, 84, 84, 153, 85, 83, 83, 83,
83, 83, 83, 83, 85, 84, 86, 90, 93, 85,
85, 84, 85, 85, 157, 51, 51, 83, 85, 85,
85, 85, 85, 85, 85, 157, 51, 117, 157, 51,
41, 50, 157, 50, 157, 85, 85, 85, 85, 50,
157, 41, 85, 85, 85, 85, 82, 84, 85, 84,
85, 47, 83, 83, 83, 84, 85, 82, 47, 83,
47, 83, 153, 158, 47, 158, 47, 84, 158, 47,
153, 84, 84, 83, 85, 84, 85, 84, 51, 85,
84, 83, 51, 51, 85, 157, 51, 157, 51, 85,
157, 51, 85, 85, 85, 50, 157, 85, 85, 85,
85, 83, 85, 85, 157, 83, 83, 84, 85, 47,
83, 47, 83, 47, 83, 85, 158, 47, 84, 84,
84, 47, 85, 84, 51, 51, 51, 84, 157, 51,
85, 85, 85, 51, 85, 85, 83, 83, 83, 85,
47, 83, 83, 84, 51, 85, 83
};
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
static const yytype_uint8 yyr1[] =
{
0, 96, 97, 98, 98, 98, 98, 98, 98, 99,
100, 100, 100, 100, 100, 100, 100, 100, 100, 100,
100, 100, 100, 100, 100, 100, 100, 100, 101, 101,
101, 101, 102, 102, 103, 104, 104, 105, 105, 105,
105, 105, 105, 106, 106, 107, 107, 107, 107, 108,
108, 109, 109, 109, 109, 109, 109, 110, 111, 111,
112, 112, 112, 112, 112, 112, 112, 112, 113, 113,
114, 114, 115, 115, 115, 115, 115, 115, 115, 115,
115, 116, 116, 117, 117, 118, 118, 119, 119, 119,
119, 120, 120, 121, 122, 122, 123, 123, 124, 125,
125, 125, 125, 125, 126, 126, 127, 127, 127, 127,
128, 128, 129, 129, 129, 129, 129, 130, 130, 130,
130, 130, 130, 130, 130, 130, 130, 130, 130, 130,
130, 130, 130, 130, 130, 130, 130, 130, 130, 130,
130, 130, 130, 130, 130, 130, 130, 130, 130, 130,
130, 130, 130, 130, 130, 130, 130, 130, 130, 130,
130, 130, 130, 130, 130, 130, 131, 131, 132, 132,
133, 133, 134, 135, 135, 136, 136, 137, 137, 137,
138, 139, 139, 140, 140, 141, 142, 142, 143, 143,
144, 145, 145, 146, 146, 147, 148, 149, 149, 150,
151, 151, 151, 151, 152, 152, 152, 153, 153, 154,
154, 154, 154, 154, 154, 155, 155, 156, 156, 156,
156, 156, 156, 156, 156, 156, 156, 156, 156, 156,
156, 156, 156, 156, 157, 157, 158, 158
};
/* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. */
static const yytype_int8 yyr2[] =
{
0, 2, 1, 1, 1, 1, 2, 2, 2, 5,
2, 2, 2, 2, 2, 2, 2, 2, 2, 1,
1, 1, 1, 1, 1, 1, 1, 1, 6, 5,
5, 4, 1, 3, 5, 1, 2, 4, 4, 6,
9, 11, 6, 1, 3, 1, 1, 1, 1, 3,
5, 1, 1, 1, 1, 1, 1, 5, 1, 2,
12, 12, 12, 12, 12, 8, 8, 8, 1, 4,
1, 3, 1, 1, 1, 1, 2, 1, 3, 5,
5, 3, 1, 3, 5, 1, 1, 1, 2, 1,
1, 1, 2, 5, 1, 1, 1, 2, 4, 1,
4, 2, 5, 3, 1, 3, 1, 1, 1, 2,
2, 3, 1, 3, 3, 1, 2, 1, 1, 1,
2, 2, 4, 6, 6, 6, 6, 8, 7, 3,
2, 2, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 2, 3, 3, 1,
1, 1, 1, 4, 4, 4, 4, 6, 4, 6,
6, 6, 4, 6, 6, 8, 4, 5, 1, 3,
1, 3, 3, 1, 3, 4, 3, 3, 3, 5,
4, 5, 4, 1, 2, 2, 5, 4, 1, 2,
2, 5, 4, 1, 3, 2, 5, 1, 2, 6,
1, 3, 2, 4, 18, 13, 13, 1, 2, 5,
2, 6, 2, 7, 4, 1, 3, 32, 28, 27,
23, 27, 23, 22, 18, 28, 24, 23, 19, 23,
19, 18, 14, 29, 3, 6, 1, 1
};
#define yyerrok (yyerrstatus = 0)
#define yyclearin (yychar = YYEMPTY)
#define YYEMPTY (-2)
#define YYEOF 0
#define YYACCEPT goto yyacceptlab
#define YYABORT goto yyabortlab
#define YYERROR goto yyerrorlab
#define YYRECOVERING() (!!yyerrstatus)
#define YYBACKUP(Token, Value) \
do \
if (yychar == YYEMPTY) \
{ \
yychar = (Token); \
yylval = (Value); \
YYPOPSTACK (yylen); \
yystate = *yyssp; \
goto yybackup; \
} \
else \
{ \
yyerror (YY_("syntax error: cannot back up")); \
YYERROR; \
} \
while (0)
/* Error token number */
#define YYTERROR 1
#define YYERRCODE 256
/* Enable debugging if requested. */
#if YYDEBUG
# ifndef YYFPRINTF
# include <stdio.h> /* INFRINGES ON USER NAME SPACE */
# define YYFPRINTF fprintf
# endif
# define YYDPRINTF(Args) \
do { \
if (yydebug) \
YYFPRINTF Args; \
} while (0)
/* This macro is provided for backward compatibility. */
#ifndef YY_LOCATION_PRINT
# define YY_LOCATION_PRINT(File, Loc) ((void) 0)
#endif
# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \
do { \
if (yydebug) \
{ \
YYFPRINTF (stderr, "%s ", Title); \
yy_symbol_print (stderr, \
Type, Value); \
YYFPRINTF (stderr, "\n"); \
} \
} while (0)
/*-----------------------------------.
| Print this symbol's value on YYO. |
`-----------------------------------*/
static void
yy_symbol_value_print (FILE *yyo, int yytype, YYSTYPE const * const yyvaluep)
{
FILE *yyoutput = yyo;
YYUSE (yyoutput);
if (!yyvaluep)
return;
# ifdef YYPRINT
if (yytype < YYNTOKENS)
YYPRINT (yyo, yytoknum[yytype], *yyvaluep);
# endif
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
YYUSE (yytype);
YY_IGNORE_MAYBE_UNINITIALIZED_END
}
/*---------------------------.
| Print this symbol on YYO. |
`---------------------------*/
static void
yy_symbol_print (FILE *yyo, int yytype, YYSTYPE const * const yyvaluep)
{
YYFPRINTF (yyo, "%s %s (",
yytype < YYNTOKENS ? "token" : "nterm", yytname[yytype]);
yy_symbol_value_print (yyo, yytype, yyvaluep);
YYFPRINTF (yyo, ")");
}
/*------------------------------------------------------------------.
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
| TOP (included). |
`------------------------------------------------------------------*/
static void
yy_stack_print (yy_state_t *yybottom, yy_state_t *yytop)
{
YYFPRINTF (stderr, "Stack now");
for (; yybottom <= yytop; yybottom++)
{
int yybot = *yybottom;
YYFPRINTF (stderr, " %d", yybot);
}
YYFPRINTF (stderr, "\n");
}
# define YY_STACK_PRINT(Bottom, Top) \
do { \
if (yydebug) \
yy_stack_print ((Bottom), (Top)); \
} while (0)
/*------------------------------------------------.
| Report that the YYRULE is going to be reduced. |
`------------------------------------------------*/
static void
yy_reduce_print (yy_state_t *yyssp, YYSTYPE *yyvsp, int yyrule)
{
int yylno = yyrline[yyrule];
int yynrhs = yyr2[yyrule];
int yyi;
YYFPRINTF (stderr, "Reducing stack by rule %d (line %d):\n",
yyrule - 1, yylno);
/* The symbols being reduced. */
for (yyi = 0; yyi < yynrhs; yyi++)
{
YYFPRINTF (stderr, " $%d = ", yyi + 1);
yy_symbol_print (stderr,
yystos[+yyssp[yyi + 1 - yynrhs]],
&yyvsp[(yyi + 1) - (yynrhs)]
);
YYFPRINTF (stderr, "\n");
}
}
# define YY_REDUCE_PRINT(Rule) \
do { \
if (yydebug) \
yy_reduce_print (yyssp, yyvsp, Rule); \
} while (0)
/* Nonzero means print parse trace. It is left uninitialized so that
multiple parsers can coexist. */
int yydebug;
#else /* !YYDEBUG */
# define YYDPRINTF(Args)
# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
# define YY_STACK_PRINT(Bottom, Top)
# define YY_REDUCE_PRINT(Rule)
#endif /* !YYDEBUG */
/* YYINITDEPTH -- initial size of the parser's stacks. */
#ifndef YYINITDEPTH
# define YYINITDEPTH 200
#endif
/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
if the built-in stack extension method is used).
Do not make this value too large; the results are undefined if
YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
evaluated with infinite-precision integer arithmetic. */
#ifndef YYMAXDEPTH
# define YYMAXDEPTH 10000
#endif
#if YYERROR_VERBOSE
# ifndef yystrlen
# if defined __GLIBC__ && defined _STRING_H
# define yystrlen(S) (YY_CAST (YYPTRDIFF_T, strlen (S)))
# else
/* Return the length of YYSTR. */
static YYPTRDIFF_T
yystrlen (const char *yystr)
{
YYPTRDIFF_T yylen;
for (yylen = 0; yystr[yylen]; yylen++)
continue;
return yylen;
}
# endif
# endif
# ifndef yystpcpy
# if defined __GLIBC__ && defined _STRING_H && defined _GNU_SOURCE
# define yystpcpy stpcpy
# else
/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
YYDEST. */
static char *
yystpcpy (char *yydest, const char *yysrc)
{
char *yyd = yydest;
const char *yys = yysrc;
while ((*yyd++ = *yys++) != '\0')
continue;
return yyd - 1;
}
# endif
# endif
# ifndef yytnamerr
/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
quotes and backslashes, so that it's suitable for yyerror. The
heuristic is that double-quoting is unnecessary unless the string
contains an apostrophe, a comma, or backslash (other than
backslash-backslash). YYSTR is taken from yytname. If YYRES is
null, do not copy; instead, return the length of what the result
would have been. */
static YYPTRDIFF_T
yytnamerr (char *yyres, const char *yystr)
{
if (*yystr == '"')
{
YYPTRDIFF_T yyn = 0;
char const *yyp = yystr;
for (;;)
switch (*++yyp)
{
case '\'':
case ',':
goto do_not_strip_quotes;
case '\\':
if (*++yyp != '\\')
goto do_not_strip_quotes;
else
goto append;
append:
default:
if (yyres)
yyres[yyn] = *yyp;
yyn++;
break;
case '"':
if (yyres)
yyres[yyn] = '\0';
return yyn;
}
do_not_strip_quotes: ;
}
if (yyres)
return yystpcpy (yyres, yystr) - yyres;
else
return yystrlen (yystr);
}
# endif
/* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message
about the unexpected token YYTOKEN for the state stack whose top is
YYSSP.
Return 0 if *YYMSG was successfully written. Return 1 if *YYMSG is
not large enough to hold the message. In that case, also set
*YYMSG_ALLOC to the required number of bytes. Return 2 if the
required number of bytes is too large to store. */
static int
yysyntax_error (YYPTRDIFF_T *yymsg_alloc, char **yymsg,
yy_state_t *yyssp, int yytoken)
{
enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
/* Internationalized format string. */
const char *yyformat = YY_NULLPTR;
/* Arguments of yyformat: reported tokens (one for the "unexpected",
one per "expected"). */
char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
/* Actual size of YYARG. */
int yycount = 0;
/* Cumulated lengths of YYARG. */
YYPTRDIFF_T yysize = 0;
/* There are many possibilities here to consider:
- If this state is a consistent state with a default action, then
the only way this function was invoked is if the default action
is an error action. In that case, don't check for expected
tokens because there are none.
- The only way there can be no lookahead present (in yychar) is if
this state is a consistent state with a default action. Thus,
detecting the absence of a lookahead is sufficient to determine
that there is no unexpected or expected token to report. In that
case, just report a simple "syntax error".
- Don't assume there isn't a lookahead just because this state is a
consistent state with a default action. There might have been a
previous inconsistent state, consistent state with a non-default
action, or user semantic action that manipulated yychar.
- Of course, the expected token list depends on states to have
correct lookahead information, and it depends on the parser not
to perform extra reductions after fetching a lookahead from the
scanner and before detecting a syntax error. Thus, state merging
(from LALR or IELR) and default reductions corrupt the expected
token list. However, the list is correct for canonical LR with
one exception: it will still contain any token that will not be
accepted due to an error action in a later state.
*/
if (yytoken != YYEMPTY)
{
int yyn = yypact[+*yyssp];
YYPTRDIFF_T yysize0 = yytnamerr (YY_NULLPTR, yytname[yytoken]);
yysize = yysize0;
yyarg[yycount++] = yytname[yytoken];
if (!yypact_value_is_default (yyn))
{
/* Start YYX at -YYN if negative to avoid negative indexes in
YYCHECK. In other words, skip the first -YYN actions for
this state because they are default actions. */
int yyxbegin = yyn < 0 ? -yyn : 0;
/* Stay within bounds of both yycheck and yytname. */
int yychecklim = YYLAST - yyn + 1;
int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
int yyx;
for (yyx = yyxbegin; yyx < yyxend; ++yyx)
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR
&& !yytable_value_is_error (yytable[yyx + yyn]))
{
if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
{
yycount = 1;
yysize = yysize0;
break;
}
yyarg[yycount++] = yytname[yyx];
{
YYPTRDIFF_T yysize1
= yysize + yytnamerr (YY_NULLPTR, yytname[yyx]);
if (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM)
yysize = yysize1;
else
return 2;
}
}
}
}
switch (yycount)
{
# define YYCASE_(N, S) \
case N: \
yyformat = S; \
break
default: /* Avoid compiler warnings. */
YYCASE_(0, YY_("syntax error"));
YYCASE_(1, YY_("syntax error, unexpected %s"));
YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s"));
YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s"));
YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s"));
YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"));
# undef YYCASE_
}
{
/* Don't count the "%s"s in the final size, but reserve room for
the terminator. */
YYPTRDIFF_T yysize1 = yysize + (yystrlen (yyformat) - 2 * yycount) + 1;
if (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM)
yysize = yysize1;
else
return 2;
}
if (*yymsg_alloc < yysize)
{
*yymsg_alloc = 2 * yysize;
if (! (yysize <= *yymsg_alloc
&& *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM))
*yymsg_alloc = YYSTACK_ALLOC_MAXIMUM;
return 1;
}
/* Avoid sprintf, as that infringes on the user's name space.
Don't have undefined behavior even if the translation
produced a string with the wrong number of "%s"s. */
{
char *yyp = *yymsg;
int yyi = 0;
while ((*yyp = *yyformat) != '\0')
if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount)
{
yyp += yytnamerr (yyp, yyarg[yyi++]);
yyformat += 2;
}
else
{
++yyp;
++yyformat;
}
}
return 0;
}
#endif /* YYERROR_VERBOSE */
/*-----------------------------------------------.
| Release the memory associated to this symbol. |
`-----------------------------------------------*/
static void
yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep)
{
YYUSE (yyvaluep);
if (!yymsg)
yymsg = "Deleting";
YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
YYUSE (yytype);
YY_IGNORE_MAYBE_UNINITIALIZED_END
}
/* The lookahead symbol. */
int yychar;
/* The semantic value of the lookahead symbol. */
YYSTYPE yylval;
/* Number of syntax errors so far. */
int yynerrs;
/*----------.
| yyparse. |
`----------*/
int
yyparse (void)
{
yy_state_fast_t yystate;
/* Number of tokens to shift before error messages enabled. */
int yyerrstatus;
/* The stacks and their tools:
'yyss': related to states.
'yyvs': related to semantic values.
Refer to the stacks through separate pointers, to allow yyoverflow
to reallocate them elsewhere. */
/* The state stack. */
yy_state_t yyssa[YYINITDEPTH];
yy_state_t *yyss;
yy_state_t *yyssp;
/* The semantic value stack. */
YYSTYPE yyvsa[YYINITDEPTH];
YYSTYPE *yyvs;
YYSTYPE *yyvsp;
YYPTRDIFF_T yystacksize;
int yyn;
int yyresult;
/* Lookahead token as an internal (translated) token number. */
int yytoken = 0;
/* The variables used to return semantic value and location from the
action routines. */
YYSTYPE yyval;
#if YYERROR_VERBOSE
/* Buffer for error messages, and its allocated size. */
char yymsgbuf[128];
char *yymsg = yymsgbuf;
YYPTRDIFF_T yymsg_alloc = sizeof yymsgbuf;
#endif
#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N))
/* The number of symbols on the RHS of the reduced rule.
Keep to zero when no symbol should be popped. */
int yylen = 0;
yyssp = yyss = yyssa;
yyvsp = yyvs = yyvsa;
yystacksize = YYINITDEPTH;
YYDPRINTF ((stderr, "Starting parse\n"));
yystate = 0;
yyerrstatus = 0;
yynerrs = 0;
yychar = YYEMPTY; /* Cause a token to be read. */
goto yysetstate;
/*------------------------------------------------------------.
| yynewstate -- push a new state, which is found in yystate. |
`------------------------------------------------------------*/
yynewstate:
/* In all cases, when you get here, the value and location stacks
have just been pushed. So pushing a state here evens the stacks. */
yyssp++;
/*--------------------------------------------------------------------.
| yysetstate -- set current state (the top of the stack) to yystate. |
`--------------------------------------------------------------------*/
yysetstate:
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
YY_ASSERT (0 <= yystate && yystate < YYNSTATES);
YY_IGNORE_USELESS_CAST_BEGIN
*yyssp = YY_CAST (yy_state_t, yystate);
YY_IGNORE_USELESS_CAST_END
if (yyss + yystacksize - 1 <= yyssp)
#if !defined yyoverflow && !defined YYSTACK_RELOCATE
goto yyexhaustedlab;
#else
{
/* Get the current used size of the three stacks, in elements. */
YYPTRDIFF_T yysize = yyssp - yyss + 1;
# if defined yyoverflow
{
/* Give user a chance to reallocate the stack. Use copies of
these so that the &'s don't force the real ones into
memory. */
yy_state_t *yyss1 = yyss;
YYSTYPE *yyvs1 = yyvs;
/* Each stack pointer address is followed by the size of the
data in use in that stack, in bytes. This used to be a
conditional around just the two extra args, but that might
be undefined if yyoverflow is a macro. */
yyoverflow (YY_("memory exhausted"),
&yyss1, yysize * YYSIZEOF (*yyssp),
&yyvs1, yysize * YYSIZEOF (*yyvsp),
&yystacksize);
yyss = yyss1;
yyvs = yyvs1;
}
# else /* defined YYSTACK_RELOCATE */
/* Extend the stack our own way. */
if (YYMAXDEPTH <= yystacksize)
goto yyexhaustedlab;
yystacksize *= 2;
if (YYMAXDEPTH < yystacksize)
yystacksize = YYMAXDEPTH;
{
yy_state_t *yyss1 = yyss;
union yyalloc *yyptr =
YY_CAST (union yyalloc *,
YYSTACK_ALLOC (YY_CAST (YYSIZE_T, YYSTACK_BYTES (yystacksize))));
if (! yyptr)
goto yyexhaustedlab;
YYSTACK_RELOCATE (yyss_alloc, yyss);
YYSTACK_RELOCATE (yyvs_alloc, yyvs);
# undef YYSTACK_RELOCATE
if (yyss1 != yyssa)
YYSTACK_FREE (yyss1);
}
# endif
yyssp = yyss + yysize - 1;
yyvsp = yyvs + yysize - 1;
YY_IGNORE_USELESS_CAST_BEGIN
YYDPRINTF ((stderr, "Stack size increased to %ld\n",
YY_CAST (long, yystacksize)));
YY_IGNORE_USELESS_CAST_END
if (yyss + yystacksize - 1 <= yyssp)
YYABORT;
}
#endif /* !defined yyoverflow && !defined YYSTACK_RELOCATE */
if (yystate == YYFINAL)
YYACCEPT;
goto yybackup;
/*-----------.
| yybackup. |
`-----------*/
yybackup:
/* Do appropriate processing given the current state. Read a
lookahead token if we need one and don't already have one. */
/* First try to decide what to do without reference to lookahead token. */
yyn = yypact[yystate];
if (yypact_value_is_default (yyn))
goto yydefault;
/* Not known => get a lookahead token if don't already have one. */
/* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */
if (yychar == YYEMPTY)
{
YYDPRINTF ((stderr, "Reading a token: "));
yychar = yylex ();
}
if (yychar <= YYEOF)
{
yychar = yytoken = YYEOF;
YYDPRINTF ((stderr, "Now at end of input.\n"));
}
else
{
yytoken = YYTRANSLATE (yychar);
YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
}
/* If the proper action on seeing token YYTOKEN is to reduce or to
detect an error, take that action. */
yyn += yytoken;
if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
goto yydefault;
yyn = yytable[yyn];
if (yyn <= 0)
{
if (yytable_value_is_error (yyn))
goto yyerrlab;
yyn = -yyn;
goto yyreduce;
}
/* Count tokens shifted since error; after three, turn off error
status. */
if (yyerrstatus)
yyerrstatus--;
/* Shift the lookahead token. */
YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
yystate = yyn;
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
*++yyvsp = yylval;
YY_IGNORE_MAYBE_UNINITIALIZED_END
/* Discard the shifted token. */
yychar = YYEMPTY;
goto yynewstate;
/*-----------------------------------------------------------.
| yydefault -- do the default action for the current state. |
`-----------------------------------------------------------*/
yydefault:
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
goto yyreduce;
/*-----------------------------.
| yyreduce -- do a reduction. |
`-----------------------------*/
yyreduce:
/* yyn is the number of a rule to reduce with. */
yylen = yyr2[yyn];
/* If YYLEN is nonzero, implement the default value of the action:
'$$ = $1'.
Otherwise, the following line sets YYVAL to garbage.
This behavior is undocumented and Bison
users should not rely upon it. Assigning to YYVAL
unconditionally makes the parser a bit smaller, and it avoids a
GCC warning that YYVAL may be used uninitialized. */
yyval = yyvsp[1-yylen];
YY_REDUCE_PRINT (yyn);
switch (yyn)
{
case 2:
#line 101 "parser.ypp"
{ }
#line 2088 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 3:
#line 107 "parser.ypp"
{ (yyval.rddlTask) = rddlTask; }
#line 2094 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 4:
#line 108 "parser.ypp"
{ (yyval.rddlTask) = rddlTask; }
#line 2100 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 5:
#line 109 "parser.ypp"
{ (yyval.rddlTask) = rddlTask; }
#line 2106 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 6:
#line 110 "parser.ypp"
{ (yyval.rddlTask) = (yyvsp[-1].rddlTask); }
#line 2112 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 7:
#line 111 "parser.ypp"
{ (yyval.rddlTask) = (yyvsp[-1].rddlTask); }
#line 2118 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 8:
#line 112 "parser.ypp"
{ (yyval.rddlTask) = (yyvsp[-1].rddlTask); }
#line 2124 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 9:
#line 120 "parser.ypp"
{ rddlTask->domainName = *(yyvsp[-3].str); }
#line 2130 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 10:
#line 126 "parser.ypp"
{ }
#line 2136 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 11:
#line 127 "parser.ypp"
{ }
#line 2142 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 12:
#line 128 "parser.ypp"
{ }
#line 2148 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 13:
#line 129 "parser.ypp"
{ }
#line 2154 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 14:
#line 130 "parser.ypp"
{ }
#line 2160 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 15:
#line 131 "parser.ypp"
{ }
#line 2166 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 16:
#line 132 "parser.ypp"
{ }
#line 2172 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 17:
#line 133 "parser.ypp"
{ }
#line 2178 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 18:
#line 134 "parser.ypp"
{ }
#line 2184 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 19:
#line 135 "parser.ypp"
{ }
#line 2190 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 20:
#line 136 "parser.ypp"
{ }
#line 2196 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 21:
#line 137 "parser.ypp"
{ }
#line 2202 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 22:
#line 138 "parser.ypp"
{ }
#line 2208 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 23:
#line 139 "parser.ypp"
{ }
#line 2214 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 24:
#line 140 "parser.ypp"
{ }
#line 2220 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 25:
#line 141 "parser.ypp"
{ }
#line 2226 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 26:
#line 142 "parser.ypp"
{ }
#line 2232 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 27:
#line 143 "parser.ypp"
{ }
#line 2238 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 28:
#line 148 "parser.ypp"
{ }
#line 2244 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 29:
#line 149 "parser.ypp"
{ }
#line 2250 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 30:
#line 150 "parser.ypp"
{ }
#line 2256 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 31:
#line 151 "parser.ypp"
{ }
#line 2262 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 32:
#line 154 "parser.ypp"
{ }
#line 2268 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 33:
#line 155 "parser.ypp"
{ }
#line 2274 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 34:
#line 161 "parser.ypp"
{ }
#line 2280 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 35:
#line 164 "parser.ypp"
{ }
#line 2286 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 36:
#line 165 "parser.ypp"
{ }
#line 2292 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 37:
#line 169 "parser.ypp"
{ rddlTask->addType(*(yyvsp[-3].str), *(yyvsp[-1].str)); }
#line 2298 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 38:
#line 170 "parser.ypp"
{ rddlTask->addType(*(yyvsp[-3].str), *(yyvsp[-1].str)); }
#line 2304 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 39:
#line 171 "parser.ypp"
{ rddlTask->addType(*(yyvsp[-5].str));
for (const std::string& s : *(yyvsp[-2].strs)) {
rddlTask->addObject(*(yyvsp[-5].str), s);
}}
#line 2313 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 40:
#line 175 "parser.ypp"
{ SystemUtils::abort("Defining types using Enum range error. Not implemented yet.") ; }
#line 2319 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 41:
#line 176 "parser.ypp"
{ SystemUtils::abort("Defining types using TypeSpecification error. Not implemented yet.") ;}
#line 2325 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 42:
#line 177 "parser.ypp"
{ SystemUtils::abort("Defining types using StructMemberList error. Not implemented yet.") ;}
#line 2331 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 43:
#line 180 "parser.ypp"
{ (yyval.strs) = new std::vector<std::string>(); (yyval.strs)->push_back(*(yyvsp[0].str)); }
#line 2337 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 44:
#line 181 "parser.ypp"
{ (yyval.strs) = (yyvsp[0].strs); (yyval.strs)->insert((yyval.strs)->begin(), *(yyvsp[-2].str)); }
#line 2343 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 45:
#line 184 "parser.ypp"
{ (yyval.type) = rddlTask->getType(*(yyvsp[0].str)); }
#line 2349 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 46:
#line 185 "parser.ypp"
{ (yyval.type) = rddlTask->getType(*(yyvsp[0].str)); }
#line 2355 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 47:
#line 186 "parser.ypp"
{ (yyval.type) = rddlTask->getType(*(yyvsp[0].str)); }
#line 2361 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 48:
#line 187 "parser.ypp"
{ (yyval.type) = rddlTask->getType(*(yyvsp[0].str)); }
#line 2367 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 49:
#line 190 "parser.ypp"
{ SystemUtils::abort("StructMemberList not implemented yet."); }
#line 2373 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 50:
#line 191 "parser.ypp"
{ SystemUtils::abort("StructMemberList not implemented yet."); }
#line 2379 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 51:
#line 194 "parser.ypp"
{ (yyval.logicalExpression) = new NumericConstant((yyvsp[0].d)); }
#line 2385 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 52:
#line 195 "parser.ypp"
{ (yyval.logicalExpression) = new NumericConstant((yyvsp[0].i)); }
#line 2391 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 53:
#line 196 "parser.ypp"
{ (yyval.logicalExpression) = new Parameter(*(yyvsp[0].str)); }
#line 2397 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 54:
#line 197 "parser.ypp"
{ (yyval.logicalExpression) = new NumericConstant(1.0); }
#line 2403 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 55:
#line 198 "parser.ypp"
{ (yyval.logicalExpression) = new NumericConstant(0.0); }
#line 2409 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 56:
#line 199 "parser.ypp"
{ assert(rddlTask->objects.find(*(yyvsp[0].str)) != rddlTask->objects.end()); (yyval.logicalExpression) = rddlTask->objects[*(yyvsp[0].str)]; }
#line 2415 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 57:
#line 205 "parser.ypp"
{ (yyval.parametrizedVariables) = (yyvsp[-2].parametrizedVariables); }
#line 2421 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 58:
#line 208 "parser.ypp"
{ (yyval.parametrizedVariables) = new std::vector<ParametrizedVariable*>(); (yyval.parametrizedVariables)->push_back((yyvsp[0].parametrizedVariable)); }
#line 2427 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 59:
#line 209 "parser.ypp"
{ (yyval.parametrizedVariables) = (yyvsp[0].parametrizedVariables); (yyval.parametrizedVariables)->insert((yyval.parametrizedVariables)->begin(), (yyvsp[-1].parametrizedVariable)); }
#line 2433 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 60:
#line 212 "parser.ypp"
{ (yyval.parametrizedVariable) = new ParametrizedVariable(*(yyvsp[-11].str), *(yyvsp[-10].parameters), ParametrizedVariable::STATE_FLUENT, (yyvsp[-6].type), (yyvsp[-2].d)); rddlTask->addVariableSchematic((yyval.parametrizedVariable)); }
#line 2439 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 61:
#line 213 "parser.ypp"
{ (yyval.parametrizedVariable) = new ParametrizedVariable(*(yyvsp[-11].str), *(yyvsp[-10].parameters), ParametrizedVariable::NON_FLUENT, (yyvsp[-6].type), (yyvsp[-2].d)); rddlTask->addVariableSchematic((yyval.parametrizedVariable)); }
#line 2445 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 62:
#line 214 "parser.ypp"
{ (yyval.parametrizedVariable) = new ParametrizedVariable(*(yyvsp[-11].str), *(yyvsp[-10].parameters), ParametrizedVariable::ACTION_FLUENT, (yyvsp[-6].type), (yyvsp[-2].d)); rddlTask->addVariableSchematic((yyval.parametrizedVariable)); }
#line 2451 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 63:
#line 215 "parser.ypp"
{ SystemUtils::abort("interm-fluent parametrized variables definition not implemented. "); }
#line 2457 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 64:
#line 216 "parser.ypp"
{ SystemUtils::abort("derived-fluent parametrized variables definition not implemented. "); }
#line 2463 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 65:
#line 217 "parser.ypp"
{ SystemUtils::abort("interm-fluent parametrized variables definition not implemented. "); }
#line 2469 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 66:
#line 218 "parser.ypp"
{ SystemUtils::abort("derived-fluent parametrized variables definition not implemented. "); }
#line 2475 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 67:
#line 219 "parser.ypp"
{ SystemUtils::abort("observ-fluent parametrized variables definition not implemented. "); }
#line 2481 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 68:
#line 222 "parser.ypp"
{ (yyval.parameters) = new std::vector<Parameter*>(); }
#line 2487 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 69:
#line 223 "parser.ypp"
{ (yyval.parameters) = (yyvsp[-2].parameters); }
#line 2493 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 70:
#line 226 "parser.ypp"
{ (yyval.parameters) = new std::vector<Parameter*>(); (yyval.parameters)->push_back(new Parameter((yyvsp[0].type)->name, (yyvsp[0].type))); }
#line 2499 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 71:
#line 227 "parser.ypp"
{ (yyval.parameters) = (yyvsp[0].parameters); (yyval.parameters)->insert((yyval.parameters)->begin(), new Parameter((yyvsp[-2].type)->name, (yyvsp[-2].type))); }
#line 2505 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 72:
#line 230 "parser.ypp"
{ (yyval.d) = (*(yyvsp[0].str) == "true") ? 1 : 0; }
#line 2511 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 73:
#line 231 "parser.ypp"
{ (yyval.d) = (yyvsp[0].d); }
#line 2517 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 74:
#line 232 "parser.ypp"
{ (yyval.d) = (yyvsp[0].d); }
#line 2523 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 75:
#line 233 "parser.ypp"
{ Object* obj = rddlTask->getObject(*(yyvsp[0].str)); (yyval.d) = obj->value; }
#line 2529 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 76:
#line 234 "parser.ypp"
{ SystemUtils::abort("Range constant variable with tag '$' definition implemented yet."); }
#line 2535 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 77:
#line 235 "parser.ypp"
{ assert(rddlTask->objects.find(*(yyvsp[0].str)) != rddlTask->objects.end()); (yyval.d) = rddlTask->objects[*(yyvsp[0].str)]->value; }
#line 2541 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 78:
#line 236 "parser.ypp"
{ SystemUtils::abort("< Structured ranged constatnts > not implemented yet."); }
#line 2547 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 79:
#line 237 "parser.ypp"
{ SystemUtils::abort("(< Structured ranged constatnts >) not implemented yet."); }
#line 2553 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 80:
#line 238 "parser.ypp"
{ SystemUtils::abort("[< Structured ranged constatnts >] not implemented yet."); }
#line 2559 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 81:
#line 242 "parser.ypp"
{ SystemUtils::abort("StructRangeConsant not implemented yet."); }
#line 2565 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 82:
#line 243 "parser.ypp"
{ SystemUtils::abort("StructRangeConsant not implemented yet."); }
#line 2571 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 83:
#line 246 "parser.ypp"
{ SystemUtils::abort("StructRangeConsantList not implemented yet."); }
#line 2577 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 84:
#line 247 "parser.ypp"
{ SystemUtils::abort("StructRangeConsantList not implemented yet."); }
#line 2583 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 85:
#line 250 "parser.ypp"
{ (yyval.str) = (yyvsp[0].str); }
#line 2589 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 86:
#line 251 "parser.ypp"
{ (yyval.str) = (yyvsp[0].str); }
#line 2595 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 87:
#line 254 "parser.ypp"
{ (yyval.d) = (yyvsp[0].d); }
#line 2601 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 88:
#line 255 "parser.ypp"
{ (yyval.d) = -(yyvsp[0].d); }
#line 2607 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 89:
#line 256 "parser.ypp"
{ (yyval.d) = std::numeric_limits<double>::infinity(); }
#line 2613 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 90:
#line 257 "parser.ypp"
{ (yyval.d) = -std::numeric_limits<double>::infinity();}
#line 2619 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 91:
#line 260 "parser.ypp"
{ (yyval.d) = (yyvsp[0].i); }
#line 2625 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 92:
#line 261 "parser.ypp"
{ (yyval.d) = -(yyvsp[0].i); }
#line 2631 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 93:
#line 268 "parser.ypp"
{ }
#line 2637 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 94:
#line 271 "parser.ypp"
{ }
#line 2643 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 95:
#line 272 "parser.ypp"
{ }
#line 2649 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 96:
#line 275 "parser.ypp"
{ }
#line 2655 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 97:
#line 276 "parser.ypp"
{ }
#line 2661 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 98:
#line 279 "parser.ypp"
{ rddlTask->addCPF(*(yyvsp[-3].parametrizedVariable), (yyvsp[-1].logicalExpression)); }
#line 2667 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 99:
#line 282 "parser.ypp"
{
std::string varName;
if ((*(yyvsp[0].str))[(yyvsp[0].str)->length() - 1] == '\'')
varName = (yyvsp[0].str)->substr(0, (yyvsp[0].str)->length() - 1);
else
varName = *(yyvsp[0].str);
if (rddlTask->variableDefinitions.find(varName) != rddlTask->variableDefinitions.end()) {
(yyval.parametrizedVariable) = rddlTask->variableDefinitions[varName];
} else {
SystemUtils::abort("Unknown parametrized variable " + varName + ".");
}
(yyval.parametrizedVariable) = new ParametrizedVariable(*(rddlTask->variableDefinitions[varName]), std::vector<Parameter*>());
}
#line 2686 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 100:
#line 296 "parser.ypp"
{
std::string varName;
if ((*(yyvsp[-3].str))[(yyvsp[-3].str)->length() - 1] == '\'')
varName = (yyvsp[-3].str)->substr(0, (yyvsp[-3].str)->length() - 1);
else
varName = *(yyvsp[-3].str);
if (rddlTask->variableDefinitions.find(varName) != rddlTask->variableDefinitions.end()) {
(yyval.parametrizedVariable) = rddlTask->variableDefinitions[varName];
} else {
SystemUtils::abort("Unknown parametrized variable " + varName + ".");
}
(yyval.parametrizedVariable) = new ParametrizedVariable(*(rddlTask->variableDefinitions[varName]), *(yyvsp[-1].parameters));
}
#line 2704 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 101:
#line 309 "parser.ypp"
{ SystemUtils::abort("Undefined variable: " + *(yyvsp[-1].str) + ". Syntax not implemented yet."); }
#line 2710 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 102:
#line 310 "parser.ypp"
{ SystemUtils::abort("Undefined variable: " + *(yyvsp[-4].str) + ". Syntax not implemented yet."); }
#line 2716 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 103:
#line 311 "parser.ypp"
{ SystemUtils::abort("Undefined variable: " + *(yyvsp[-2].str) + ". Syntax not implemented yet."); }
#line 2722 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 104:
#line 314 "parser.ypp"
{ (yyval.parameters) = new std::vector<Parameter*>(); (yyval.parameters)->push_back((yyvsp[0].parameter)); }
#line 2728 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 105:
#line 315 "parser.ypp"
{ (yyval.parameters) = (yyvsp[0].parameters); (yyval.parameters)->insert((yyval.parameters)->begin(), (yyvsp[-2].parameter)); }
#line 2734 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 106:
#line 318 "parser.ypp"
{ (yyval.parameter) = new Parameter(*(yyvsp[0].str)); }
#line 2740 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 107:
#line 319 "parser.ypp"
{ SystemUtils::abort("Definition of Term using parametrized variable not implemented yet."); }
#line 2746 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 108:
#line 320 "parser.ypp"
{ assert(rddlTask->objects.find(*(yyvsp[0].str)) != rddlTask->objects.end()); (yyval.parameter) = rddlTask->objects[*(yyvsp[0].str)]; }
#line 2752 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 109:
#line 321 "parser.ypp"
{ SystemUtils::abort("Definition of Term using variable with '$' sign not implemented yet."); }
#line 2758 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 110:
#line 324 "parser.ypp"
{ SystemUtils::abort("MemberList not implemented yet."); }
#line 2764 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 111:
#line 325 "parser.ypp"
{ SystemUtils::abort("MemberList not implemented yet."); }
#line 2770 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 112:
#line 328 "parser.ypp"
{ SystemUtils::abort("Pterm not implemented yet."); }
#line 2776 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 113:
#line 329 "parser.ypp"
{ SystemUtils::abort("Pterm not implemented yet."); }
#line 2782 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 114:
#line 330 "parser.ypp"
{ SystemUtils::abort("Pterm not implemented yet."); }
#line 2788 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 115:
#line 331 "parser.ypp"
{ SystemUtils::abort("Pterm not implemented yet."); }
#line 2794 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 116:
#line 332 "parser.ypp"
{ SystemUtils::abort("Pterm not implemented yet."); }
#line 2800 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 117:
#line 340 "parser.ypp"
{ (yyval.logicalExpression) = new Parameter(*(yyvsp[0].str)); }
#line 2806 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 118:
#line 341 "parser.ypp"
{ (yyval.logicalExpression) = (yyvsp[0].parametrizedVariable); }
#line 2812 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 119:
#line 342 "parser.ypp"
{ assert(rddlTask->objects.find(*(yyvsp[0].str)) != rddlTask->objects.end()); (yyval.logicalExpression) = rddlTask->objects[*(yyvsp[0].str)]; }
#line 2818 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 120:
#line 343 "parser.ypp"
{ SystemUtils::abort("'$<variable_name>' not implemented yet."); }
#line 2824 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 121:
#line 344 "parser.ypp"
{ SystemUtils::abort("Structured expression list not implemented yet."); }
#line 2830 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 122:
#line 346 "parser.ypp"
{ SystemUtils::abort("Unknow special function " + *(yyvsp[-3].str) + " defined as expression. Special functions not implemented yet."); }
#line 2836 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 123:
#line 347 "parser.ypp"
{ (yyval.logicalExpression) = new UniversalQuantification((yyvsp[-2].parameterList), (yyvsp[0].logicalExpression)); }
#line 2842 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 124:
#line 348 "parser.ypp"
{ (yyval.logicalExpression) = new ExistentialQuantification((yyvsp[-2].parameterList), (yyvsp[0].logicalExpression));}
#line 2848 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 125:
#line 349 "parser.ypp"
{ (yyval.logicalExpression) = new Sumation((yyvsp[-2].parameterList), (yyvsp[0].logicalExpression)); }
#line 2854 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 126:
#line 350 "parser.ypp"
{ (yyval.logicalExpression) = new Product((yyvsp[-2].parameterList), (yyvsp[0].logicalExpression)); }
#line 2860 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 127:
#line 351 "parser.ypp"
{ (yyval.logicalExpression) = new IfThenElseExpression((yyvsp[-5].logicalExpression), (yyvsp[-2].logicalExpression), (yyvsp[0].logicalExpression)); }
#line 2866 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 128:
#line 352 "parser.ypp"
{ // TODO: Text switch case control
LogicalExpression* switchVar = rddlTask->getParametrizedVariable((yyvsp[-4].parameter)->name);
std::vector<LogicalExpression*> conditions;
std::vector<LogicalExpression*> effects;
for (ConditionEffectPair* cs : *(yyvsp[-1].conditionEffects)) {
if (!cs->first) {
// If we reached the end of switch case and instead of 'case', we have 'default' -> default action
conditions.push_back(new NumericConstant(1.0));
}
else {
std::vector<LogicalExpression*> switchVarEquality;
switchVarEquality.push_back(switchVar);
switchVarEquality.push_back(cs->first);
conditions.push_back(new EqualsExpression(switchVarEquality));
}
effects.push_back(cs->second);
}
(yyval.logicalExpression) = new MultiConditionChecker(conditions, effects);
}
#line 2891 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 129:
#line 373 "parser.ypp"
{ std::vector<LogicalExpression*> exprs; exprs.push_back((yyvsp[-2].logicalExpression)); exprs.push_back((yyvsp[0].logicalExpression)); (yyval.logicalExpression) = new Addition(exprs); }
#line 2897 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 130:
#line 374 "parser.ypp"
{ std::vector<LogicalExpression*> exprs; exprs.push_back(new NumericConstant(0.0)); exprs.push_back((yyvsp[0].logicalExpression)); (yyval.logicalExpression) = new Subtraction(exprs); }
#line 2903 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 131:
#line 375 "parser.ypp"
{ (yyval.logicalExpression) = (yyvsp[0].logicalExpression); }
#line 2909 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 132:
#line 376 "parser.ypp"
{ std::vector<LogicalExpression*> exprs; exprs.push_back((yyvsp[-2].logicalExpression)); exprs.push_back((yyvsp[0].logicalExpression)); (yyval.logicalExpression) = new Subtraction(exprs); }
#line 2915 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 133:
#line 377 "parser.ypp"
{ std::vector<LogicalExpression*> exprs; exprs.push_back((yyvsp[-2].logicalExpression)); exprs.push_back((yyvsp[0].logicalExpression)); (yyval.logicalExpression) = new Multiplication(exprs); }
#line 2921 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 134:
#line 378 "parser.ypp"
{ std::vector<LogicalExpression*> exprs; exprs.push_back((yyvsp[-2].logicalExpression)); exprs.push_back((yyvsp[0].logicalExpression)); (yyval.logicalExpression) = new Division(exprs); }
#line 2927 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 135:
#line 379 "parser.ypp"
{ std::vector<LogicalExpression*> exprs; exprs.push_back((yyvsp[-2].logicalExpression)); exprs.push_back((yyvsp[0].logicalExpression)); (yyval.logicalExpression) = new GreaterExpression(exprs); }
#line 2933 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 136:
#line 380 "parser.ypp"
{ std::vector<LogicalExpression*> exprs; exprs.push_back((yyvsp[-2].logicalExpression)); exprs.push_back((yyvsp[0].logicalExpression)); (yyval.logicalExpression) = new LowerExpression(exprs); }
#line 2939 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 137:
#line 381 "parser.ypp"
{ std::vector<LogicalExpression*> exprs; exprs.push_back((yyvsp[-2].logicalExpression)); exprs.push_back((yyvsp[0].logicalExpression)); (yyval.logicalExpression) = new LowerEqualsExpression(exprs); }
#line 2945 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 138:
#line 382 "parser.ypp"
{ std::vector<LogicalExpression*> exprs; exprs.push_back((yyvsp[-2].logicalExpression)); exprs.push_back((yyvsp[0].logicalExpression)); (yyval.logicalExpression) = new GreaterEqualsExpression(exprs); }
#line 2951 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 139:
#line 383 "parser.ypp"
{ std::vector<LogicalExpression*> exprs; exprs.push_back((yyvsp[-2].logicalExpression)); exprs.push_back((yyvsp[0].logicalExpression)); (yyval.logicalExpression) = new EqualsExpression(exprs); }
#line 2957 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 140:
#line 384 "parser.ypp"
{ std::vector<LogicalExpression*> exprs; exprs.push_back((yyvsp[-2].logicalExpression)); exprs.push_back((yyvsp[0].logicalExpression)); (yyval.logicalExpression) = new Negation(new EqualsExpression(exprs)); }
#line 2963 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 141:
#line 385 "parser.ypp"
{ (yyval.logicalExpression) = (yyvsp[-1].logicalExpression); }
#line 2969 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 142:
#line 386 "parser.ypp"
{ (yyval.logicalExpression) = (yyvsp[-1].logicalExpression); }
#line 2975 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 143:
#line 387 "parser.ypp"
{ std::vector<LogicalExpression*> exprs; exprs.push_back((yyvsp[-2].logicalExpression)); exprs.push_back((yyvsp[0].logicalExpression)); (yyval.logicalExpression) = new Conjunction(exprs); }
#line 2981 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 144:
#line 388 "parser.ypp"
{ std::vector<LogicalExpression*> exprs; exprs.push_back((yyvsp[-2].logicalExpression)); exprs.push_back((yyvsp[0].logicalExpression)); (yyval.logicalExpression) = new Conjunction(exprs); }
#line 2987 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 145:
#line 389 "parser.ypp"
{ std::vector<LogicalExpression*> exprs; exprs.push_back((yyvsp[-2].logicalExpression)); exprs.push_back((yyvsp[0].logicalExpression)); (yyval.logicalExpression) = new Disjunction(exprs); }
#line 2993 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 146:
#line 390 "parser.ypp"
{ (yyval.logicalExpression) = new Negation((yyvsp[0].logicalExpression)); }
#line 2999 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 147:
#line 391 "parser.ypp"
{ std::vector<LogicalExpression*> posExprs, negExprs, exprs; posExprs.push_back((yyvsp[-2].logicalExpression)); negExprs.push_back((yyvsp[0].logicalExpression)); exprs.push_back(new Conjunction(posExprs)); exprs.push_back(new Conjunction(posExprs)); (yyval.logicalExpression) = new Disjunction(exprs); }
#line 3005 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 148:
#line 392 "parser.ypp"
{ std::vector<LogicalExpression*> exprs; exprs.push_back(new Negation((yyvsp[-2].logicalExpression))); exprs.push_back((yyvsp[0].logicalExpression)); (yyval.logicalExpression) = new Disjunction(exprs); }
#line 3011 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 149:
#line 393 "parser.ypp"
{ (yyval.logicalExpression) = new NumericConstant((yyvsp[0].d)); }
#line 3017 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 150:
#line 394 "parser.ypp"
{ (yyval.logicalExpression) = new NumericConstant((yyvsp[0].i)); }
#line 3023 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 151:
#line 395 "parser.ypp"
{ (yyval.logicalExpression) = new NumericConstant(1.0); }
#line 3029 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 152:
#line 396 "parser.ypp"
{ (yyval.logicalExpression) = new NumericConstant(0.0); }
#line 3035 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 153:
#line 397 "parser.ypp"
{ (yyval.logicalExpression) = new ExponentialFunction((yyvsp[-1].logicalExpression)); }
#line 3041 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 154:
#line 398 "parser.ypp"
{ (yyval.logicalExpression) = new ExponentialFunction((yyvsp[-1].logicalExpression)); }
#line 3047 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 155:
#line 401 "parser.ypp"
{ (yyval.logicalExpression) = new BernoulliDistribution((yyvsp[-1].logicalExpression)); }
#line 3053 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 156:
#line 402 "parser.ypp"
{ (yyval.logicalExpression) = new KronDeltaDistribution((yyvsp[-1].logicalExpression)); }
#line 3059 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 157:
#line 403 "parser.ypp"
{ (yyval.logicalExpression) = (yyvsp[-1].lConstCaseList); }
#line 3065 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 158:
#line 404 "parser.ypp"
{ SystemUtils::abort("DiracDelta not implemtend."); }
#line 3071 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 159:
#line 405 "parser.ypp"
{ SystemUtils::abort("Uniform not implemtend."); }
#line 3077 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 160:
#line 406 "parser.ypp"
{ SystemUtils::abort("Normal not implemtend."); }
#line 3083 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 161:
#line 407 "parser.ypp"
{ SystemUtils::abort("Dirichelt not implemtend."); }
#line 3089 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 162:
#line 408 "parser.ypp"
{ SystemUtils::abort("Poisson not implemtend."); }
#line 3095 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 163:
#line 409 "parser.ypp"
{ SystemUtils::abort("Weibull not implemtend."); }
#line 3101 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 164:
#line 410 "parser.ypp"
{ SystemUtils::abort("Gama not implemtend."); }
#line 3107 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 165:
#line 411 "parser.ypp"
{ SystemUtils::abort("Multinomial not implemtend."); }
#line 3113 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 166:
#line 414 "parser.ypp"
{ SystemUtils::abort("StructExpressionList not implemented yet."); }
#line 3119 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 167:
#line 415 "parser.ypp"
{ SystemUtils::abort("StructExpressionList not implemented yet."); }
#line 3125 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 168:
#line 418 "parser.ypp"
{ (yyval.logicalExpressions) = new std::vector<LogicalExpression*>(); (yyval.logicalExpressions)->push_back((yyvsp[0].logicalExpression)); }
#line 3131 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 169:
#line 419 "parser.ypp"
{ (yyval.logicalExpressions) = (yyvsp[0].logicalExpressions); (yyval.logicalExpressions)->insert((yyval.logicalExpressions)->begin(), (yyvsp[-2].logicalExpression)); }
#line 3137 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 170:
#line 422 "parser.ypp"
{ (yyval.parameterList) = new ParameterList({}, {}); (yyval.parameterList)->params.push_back(new Parameter((yyvsp[0].parameter)->name, (yyvsp[0].parameter)->type)); (yyval.parameterList)->types.push_back((yyvsp[0].parameter)->type); }
#line 3143 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 171:
#line 423 "parser.ypp"
{ (yyval.parameterList) = (yyvsp[0].parameterList); (yyval.parameterList)->params.insert((yyval.parameterList)->params.begin(), new Parameter((yyvsp[-2].parameter)->name, (yyvsp[-2].parameter)->type)); (yyval.parameterList)->types.insert((yyval.parameterList)->types.begin(), (yyvsp[-2].parameter)->type); }
#line 3149 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 172:
#line 426 "parser.ypp"
{ if (rddlTask->getType(*(yyvsp[0].str))) {
(yyval.parameter) = new Parameter(*(yyvsp[-2].str), rddlTask->getType(*(yyvsp[0].str)));
}
else {
SystemUtils::abort("Type " + *(yyvsp[0].str) + " not defined");
}
}
#line 3161 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 173:
#line 435 "parser.ypp"
{ (yyval.conditionEffects) = new std::vector<ConditionEffectPair*>(); (yyval.conditionEffects)->push_back((yyvsp[0].conditionEffect)); }
#line 3167 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 174:
#line 436 "parser.ypp"
{ (yyval.conditionEffects) = (yyvsp[0].conditionEffects); (yyval.conditionEffects)->insert((yyval.conditionEffects)->begin(), (yyvsp[-2].conditionEffect)); }
#line 3173 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 175:
#line 439 "parser.ypp"
{ LogicalExpression* var = rddlTask->getParametrizedVariable((yyvsp[-2].parameter)->name); (yyval.conditionEffect) = new ConditionEffectPair(var, (yyvsp[0].logicalExpression)); }
#line 3179 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 176:
#line 440 "parser.ypp"
{ (yyval.conditionEffect) = new ConditionEffectPair(nullptr, (yyvsp[0].logicalExpression)); }
#line 3185 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 177:
#line 444 "parser.ypp"
{ (yyval.lConstCaseList) = new DiscreteDistribution(); (yyval.lConstCaseList)->values.push_back((yyvsp[-2].logicalExpression)); (yyval.lConstCaseList)->probabilities.push_back((yyvsp[0].logicalExpression)); }
#line 3191 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 178:
#line 445 "parser.ypp"
{ SystemUtils::abort("Key word 'otherwise' not supported yet"); }
#line 3197 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 179:
#line 446 "parser.ypp"
{ (yyval.lConstCaseList) = (yyvsp[0].lConstCaseList); (yyval.lConstCaseList)->values.insert((yyval.lConstCaseList)->values.begin(), (yyvsp[-4].logicalExpression)); (yyval.lConstCaseList)->probabilities.insert((yyval.lConstCaseList)->probabilities.begin(), (yyvsp[-2].logicalExpression)); }
#line 3203 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 180:
#line 452 "parser.ypp"
{ rddlTask->setRewardCPF((yyvsp[-1].logicalExpression)); }
#line 3209 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 181:
#line 459 "parser.ypp"
{ }
#line 3215 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 182:
#line 460 "parser.ypp"
{ }
#line 3221 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 183:
#line 463 "parser.ypp"
{ }
#line 3227 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 184:
#line 464 "parser.ypp"
{ }
#line 3233 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 185:
#line 467 "parser.ypp"
{ rddlTask->SACs.push_back((yyvsp[-1].logicalExpression)); }
#line 3239 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 186:
#line 473 "parser.ypp"
{ }
#line 3245 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 187:
#line 474 "parser.ypp"
{ }
#line 3251 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 188:
#line 477 "parser.ypp"
{ }
#line 3257 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 189:
#line 478 "parser.ypp"
{ }
#line 3263 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 190:
#line 481 "parser.ypp"
{ rddlTask->SACs.push_back((yyvsp[-1].logicalExpression)); }
#line 3269 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 191:
#line 487 "parser.ypp"
{ }
#line 3275 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 192:
#line 488 "parser.ypp"
{ }
#line 3281 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 196:
#line 501 "parser.ypp"
{ }
#line 3287 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 197:
#line 505 "parser.ypp"
{ }
#line 3293 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 198:
#line 506 "parser.ypp"
{ }
#line 3299 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 199:
#line 509 "parser.ypp"
{
for (std::string str : *(yyvsp[-2].strs)) {
rddlTask->addObject(*(yyvsp[-5].str), str);
}
}
#line 3309 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 200:
#line 516 "parser.ypp"
{ (yyval.strs) = new std::vector<std::string>(); (yyval.strs)->push_back(*(yyvsp[0].str)); }
#line 3315 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 201:
#line 517 "parser.ypp"
{ (yyval.strs) = (yyvsp[0].strs); (yyval.strs)->insert((yyval.strs)->begin(), *(yyvsp[-2].str)); }
#line 3321 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 202:
#line 518 "parser.ypp"
{ SystemUtils::abort("Definition of an object using '$' not implemented yet."); }
#line 3327 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 203:
#line 519 "parser.ypp"
{ SystemUtils::abort("Definition of an object using '$' not implemented yet."); }
#line 3333 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 204:
#line 531 "parser.ypp"
{
rddlTask->nonFluentsName = *(yyvsp[-16].str);
if (rddlTask->domainName != *(yyvsp[-12].str)) {
SystemUtils::abort("Unknown domain " + *(yyvsp[-12].str) +
" used in non-fluents section");
}
}
#line 3345 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 205:
#line 541 "parser.ypp"
{
rddlTask->nonFluentsName = *(yyvsp[-11].str);
if (rddlTask->domainName != *(yyvsp[-7].str)) {
SystemUtils::abort("Unknown domain " + *(yyvsp[-7].str) +
" used in non-fluents section");
}
}
#line 3357 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 206:
#line 551 "parser.ypp"
{
rddlTask->nonFluentsName = *(yyvsp[-11].str);
if (rddlTask->domainName != *(yyvsp[-7].str)) {
SystemUtils::abort("Unknown domain " + *(yyvsp[-7].str) +
" used in non-fluents section");
}
}
#line 3369 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 207:
#line 560 "parser.ypp"
{ }
#line 3375 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 208:
#line 561 "parser.ypp"
{ }
#line 3381 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 209:
#line 565 "parser.ypp"
{
ParametrizedVariable* parent = rddlTask->getParametrizedVariable(*(yyvsp[-4].str));
std::vector<Parameter*> params;
for (LogicalExpression* le : *(yyvsp[-2].logicalExpressions)) {
Parameter* param = dynamic_cast<Parameter*>(le);
if (!param) {
SystemUtils::abort("Passing anything other than Parameter object to ParametrizedVariable is not allowed.");
}
params.push_back(rddlTask->getObject(param->name));
}
rddlTask->addParametrizedVariable(parent, params, 1);
}
#line 3398 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 210:
#line 577 "parser.ypp"
{ ParametrizedVariable* parent = rddlTask->getParametrizedVariable(*(yyvsp[-1].str)); rddlTask->addParametrizedVariable(parent, {}, 1); }
#line 3404 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 211:
#line 578 "parser.ypp"
{
ParametrizedVariable* parent = rddlTask->getParametrizedVariable(*(yyvsp[-4].str));
std::vector<Parameter*> params;
for (LogicalExpression* le : *(yyvsp[-2].logicalExpressions)) {
Parameter* param = dynamic_cast<Parameter*>(le);
if (!param) {
SystemUtils::abort("Passing anything other than Parameter object to ParametrizedVariable is not allowed.");
}
params.push_back(rddlTask->getObject(param->name));
}
rddlTask->addParametrizedVariable(parent, params, 0);
}
#line 3421 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 212:
#line 590 "parser.ypp"
{ ParametrizedVariable* parent = rddlTask->getParametrizedVariable(*(yyvsp[0].str)); rddlTask->addParametrizedVariable(parent, {}, 0); }
#line 3427 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 213:
#line 591 "parser.ypp"
{
ParametrizedVariable* parent = rddlTask->getParametrizedVariable(*(yyvsp[-6].str));
std::vector<Parameter*> params;
for (LogicalExpression* le : *(yyvsp[-4].logicalExpressions)) {
Parameter* param = dynamic_cast<Parameter*>(le);
if (!param) {
SystemUtils::abort("Passing anything other than Parameter object to ParametrizedVariable is not allowed.");
}
params.push_back(rddlTask->getObject(param->name));
}
rddlTask->addParametrizedVariable(parent, params, (yyvsp[-1].d));
}
#line 3444 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 214:
#line 603 "parser.ypp"
{ ParametrizedVariable* parent = rddlTask->getParametrizedVariable(*(yyvsp[-3].str)); rddlTask->addParametrizedVariable(parent, {}, (yyvsp[-1].d));}
#line 3450 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 215:
#line 606 "parser.ypp"
{ (yyval.logicalExpressions) = new std::vector<LogicalExpression*>(); (yyval.logicalExpressions)->push_back((yyvsp[0].logicalExpression)); }
#line 3456 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 216:
#line 607 "parser.ypp"
{ (yyval.logicalExpressions) = (yyvsp[0].logicalExpressions); (yyval.logicalExpressions)->insert((yyval.logicalExpressions)->begin(), (yyvsp[-2].logicalExpression)); }
#line 3462 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 217:
#line 625 "parser.ypp"
{ rddlTask->setInstance(*(yyvsp[-30].str), *(yyvsp[-26].str), *(yyvsp[-22].str), (yyvsp[-8].i), (yyvsp[-6].i), (yyvsp[-2].d)); }
#line 3468 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 218:
#line 634 "parser.ypp"
{ rddlTask->setInstance(*(yyvsp[-26].str), *(yyvsp[-22].str), "", (yyvsp[-8].i), (yyvsp[-6].i), (yyvsp[-2].d)); }
#line 3474 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 219:
#line 643 "parser.ypp"
{ rddlTask->setInstance(*(yyvsp[-25].str), *(yyvsp[-21].str), *(yyvsp[-17].str), (yyvsp[-8].i), (yyvsp[-6].i), (yyvsp[-2].d)); }
#line 3480 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 220:
#line 651 "parser.ypp"
{ rddlTask->setInstance(*(yyvsp[-21].str), *(yyvsp[-17].str), "", (yyvsp[-8].i), (yyvsp[-6].i), (yyvsp[-2].d)); }
#line 3486 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 221:
#line 660 "parser.ypp"
{ rddlTask->setInstance(*(yyvsp[-25].str), *(yyvsp[-21].str), *(yyvsp[-17].str), (yyvsp[-8].i), (yyvsp[-6].i), (yyvsp[-2].d)); }
#line 3492 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 222:
#line 668 "parser.ypp"
{ rddlTask->setInstance(*(yyvsp[-21].str), *(yyvsp[-17].str), "", (yyvsp[-8].i), (yyvsp[-6].i), (yyvsp[-2].d)); }
#line 3498 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 223:
#line 676 "parser.ypp"
{ rddlTask->setInstance(*(yyvsp[-20].str), *(yyvsp[-16].str), *(yyvsp[-12].str), (yyvsp[-8].i), (yyvsp[-6].i), (yyvsp[-2].d)); }
#line 3504 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 224:
#line 683 "parser.ypp"
{ rddlTask->setInstance(*(yyvsp[-16].str), *(yyvsp[-12].str), "", (yyvsp[-8].i), (yyvsp[-6].i), (yyvsp[-2].d)); }
#line 3510 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 225:
#line 694 "parser.ypp"
{ rddlTask->setInstance(*(yyvsp[-26].str), *(yyvsp[-22].str), *(yyvsp[-18].str), std::numeric_limits<int>::max(), (yyvsp[-6].i), (yyvsp[-2].d)); }
#line 3516 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 226:
#line 702 "parser.ypp"
{ rddlTask->setInstance(*(yyvsp[-22].str), *(yyvsp[-18].str), "", std::numeric_limits<int>::max(), (yyvsp[-6].i), (yyvsp[-2].d)); }
#line 3522 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 227:
#line 710 "parser.ypp"
{ rddlTask->setInstance(*(yyvsp[-21].str), *(yyvsp[-17].str), *(yyvsp[-13].str), std::numeric_limits<int>::max(), (yyvsp[-6].i), (yyvsp[-2].d)); }
#line 3528 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 228:
#line 717 "parser.ypp"
{ rddlTask->setInstance(*(yyvsp[-17].str), *(yyvsp[-13].str), "", std::numeric_limits<int>::max(), (yyvsp[-6].i), (yyvsp[-2].d)); }
#line 3534 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 229:
#line 725 "parser.ypp"
{ rddlTask->setInstance(*(yyvsp[-21].str), *(yyvsp[-17].str), *(yyvsp[-13].str), std::numeric_limits<int>::max(), (yyvsp[-6].i), (yyvsp[-2].d)); }
#line 3540 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 230:
#line 732 "parser.ypp"
{ rddlTask->setInstance(*(yyvsp[-17].str), *(yyvsp[-13].str), "", std::numeric_limits<int>::max(), (yyvsp[-6].i), (yyvsp[-2].d)); }
#line 3546 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 231:
#line 739 "parser.ypp"
{ rddlTask->setInstance(*(yyvsp[-16].str), *(yyvsp[-12].str), *(yyvsp[-8].str), std::numeric_limits<int>::max(), (yyvsp[-6].i), (yyvsp[-2].d)); }
#line 3552 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 232:
#line 745 "parser.ypp"
{ rddlTask->setInstance(*(yyvsp[-12].str), *(yyvsp[-8].str), "", std::numeric_limits<int>::max(), (yyvsp[-6].i), (yyvsp[-2].d)); }
#line 3558 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 233:
#line 754 "parser.ypp"
{ rddlTask->setInstance(*(yyvsp[-27].str), *(yyvsp[-23].str), "", std::numeric_limits<int>::max(), (yyvsp[-6].i), (yyvsp[-2].d)); }
#line 3564 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 234:
#line 758 "parser.ypp"
{ (yyval.i) = (yyvsp[0].i); }
#line 3570 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 235:
#line 759 "parser.ypp"
{ SystemUtils::abort("Definition of horizon using 'terminate-when' token not implemented yet."); }
#line 3576 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 236:
#line 762 "parser.ypp"
{ (yyval.i) = (yyvsp[0].i); }
#line 3582 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
case 237:
#line 763 "parser.ypp"
{ (yyval.i) = std::numeric_limits<int>::max(); }
#line 3588 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
break;
#line 3592 "/home/ziqi/prost-master/builds/debug/rddl_parser/parser.tab.cc"
default: break;
}
/* User semantic actions sometimes alter yychar, and that requires
that yytoken be updated with the new translation. We take the
approach of translating immediately before every use of yytoken.
One alternative is translating here after every semantic action,
but that translation would be missed if the semantic action invokes
YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or
if it invokes YYBACKUP. In the case of YYABORT or YYACCEPT, an
incorrect destructor might then be invoked immediately. In the
case of YYERROR or YYBACKUP, subsequent parser actions might lead
to an incorrect destructor call or verbose syntax error message
before the lookahead is translated. */
YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
YYPOPSTACK (yylen);
yylen = 0;
YY_STACK_PRINT (yyss, yyssp);
*++yyvsp = yyval;
/* Now 'shift' the result of the reduction. Determine what state
that goes to, based on the state we popped back to and the rule
number reduced by. */
{
const int yylhs = yyr1[yyn] - YYNTOKENS;
const int yyi = yypgoto[yylhs] + *yyssp;
yystate = (0 <= yyi && yyi <= YYLAST && yycheck[yyi] == *yyssp
? yytable[yyi]
: yydefgoto[yylhs]);
}
goto yynewstate;
/*--------------------------------------.
| yyerrlab -- here on detecting error. |
`--------------------------------------*/
yyerrlab:
/* Make sure we have latest lookahead translation. See comments at
user semantic actions for why this is necessary. */
yytoken = yychar == YYEMPTY ? YYEMPTY : YYTRANSLATE (yychar);
/* If not already recovering from an error, report this error. */
if (!yyerrstatus)
{
++yynerrs;
#if ! YYERROR_VERBOSE
yyerror (YY_("syntax error"));
#else
# define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \
yyssp, yytoken)
{
char const *yymsgp = YY_("syntax error");
int yysyntax_error_status;
yysyntax_error_status = YYSYNTAX_ERROR;
if (yysyntax_error_status == 0)
yymsgp = yymsg;
else if (yysyntax_error_status == 1)
{
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
yymsg = YY_CAST (char *, YYSTACK_ALLOC (YY_CAST (YYSIZE_T, yymsg_alloc)));
if (!yymsg)
{
yymsg = yymsgbuf;
yymsg_alloc = sizeof yymsgbuf;
yysyntax_error_status = 2;
}
else
{
yysyntax_error_status = YYSYNTAX_ERROR;
yymsgp = yymsg;
}
}
yyerror (yymsgp);
if (yysyntax_error_status == 2)
goto yyexhaustedlab;
}
# undef YYSYNTAX_ERROR
#endif
}
if (yyerrstatus == 3)
{
/* If just tried and failed to reuse lookahead token after an
error, discard it. */
if (yychar <= YYEOF)
{
/* Return failure if at end of input. */
if (yychar == YYEOF)
YYABORT;
}
else
{
yydestruct ("Error: discarding",
yytoken, &yylval);
yychar = YYEMPTY;
}
}
/* Else will try to reuse lookahead token after shifting the error
token. */
goto yyerrlab1;
/*---------------------------------------------------.
| yyerrorlab -- error raised explicitly by YYERROR. |
`---------------------------------------------------*/
yyerrorlab:
/* Pacify compilers when the user code never invokes YYERROR and the
label yyerrorlab therefore never appears in user code. */
if (0)
YYERROR;
/* Do not reclaim the symbols of the rule whose action triggered
this YYERROR. */
YYPOPSTACK (yylen);
yylen = 0;
YY_STACK_PRINT (yyss, yyssp);
yystate = *yyssp;
goto yyerrlab1;
/*-------------------------------------------------------------.
| yyerrlab1 -- common code for both syntax error and YYERROR. |
`-------------------------------------------------------------*/
yyerrlab1:
yyerrstatus = 3; /* Each real token shifted decrements this. */
for (;;)
{
yyn = yypact[yystate];
if (!yypact_value_is_default (yyn))
{
yyn += YYTERROR;
if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
{
yyn = yytable[yyn];
if (0 < yyn)
break;
}
}
/* Pop the current state because it cannot handle the error token. */
if (yyssp == yyss)
YYABORT;
yydestruct ("Error: popping",
yystos[yystate], yyvsp);
YYPOPSTACK (1);
yystate = *yyssp;
YY_STACK_PRINT (yyss, yyssp);
}
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
*++yyvsp = yylval;
YY_IGNORE_MAYBE_UNINITIALIZED_END
/* Shift the error token. */
YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
yystate = yyn;
goto yynewstate;
/*-------------------------------------.
| yyacceptlab -- YYACCEPT comes here. |
`-------------------------------------*/
yyacceptlab:
yyresult = 0;
goto yyreturn;
/*-----------------------------------.
| yyabortlab -- YYABORT comes here. |
`-----------------------------------*/
yyabortlab:
yyresult = 1;
goto yyreturn;
#if !defined yyoverflow || YYERROR_VERBOSE
/*-------------------------------------------------.
| yyexhaustedlab -- memory exhaustion comes here. |
`-------------------------------------------------*/
yyexhaustedlab:
yyerror (YY_("memory exhausted"));
yyresult = 2;
/* Fall through. */
#endif
/*-----------------------------------------------------.
| yyreturn -- parsing is finished, return the result. |
`-----------------------------------------------------*/
yyreturn:
if (yychar != YYEMPTY)
{
/* Make sure we have latest lookahead translation. See comments at
user semantic actions for why this is necessary. */
yytoken = YYTRANSLATE (yychar);
yydestruct ("Cleanup: discarding lookahead",
yytoken, &yylval);
}
/* Do not reclaim the symbols of the rule whose action triggered
this YYABORT or YYACCEPT. */
YYPOPSTACK (yylen);
YY_STACK_PRINT (yyss, yyssp);
while (yyssp != yyss)
{
yydestruct ("Cleanup: popping",
yystos[+*yyssp], yyvsp);
YYPOPSTACK (1);
}
#ifndef yyoverflow
if (yyss != yyssa)
YYSTACK_FREE (yyss);
#endif
#if YYERROR_VERBOSE
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
#endif
return yyresult;
}
#line 766 "parser.ypp"
bool checkExtension(std::string s) {
return ((s.length() > 5) && (s.substr(s.length() - 5).compare(".rddl") == 0));
}
int main (int argc, char** argv) {
Timer t;
std::cout << "Parsing..." << std::endl;
if (argc < 3) {
// Run unit tests
doctest::Context context;
context.applyCommandLine(argc, argv);
int res = context.run();
if (context.shouldExit()) {
return res;
}
SystemUtils::abort("Usage: ./rddl-parser <rddlDesc> <targetDir-or-targetFile> [options]\n"
"where rddlDesc consists of 1-3 individual files");
}
// Find input files and combine them in one file
std::stringstream combined;
unsigned int index = 1;
while (index < argc && checkExtension(argv[index])) {
std::ifstream ifs(argv[index], std::ifstream::in);
combined << ifs.rdbuf();
ifs.close();
index++;
}
if (index == 1 || index > 4 || index >= argc) {
SystemUtils::abort("Usage: ./rddl-parser <rddlDesc> <targetDir> [options]\n"
"where rddlDesc consists of 1-3 individual files");
}
std::string targetDir = std::string(argv[index++]);
double seed = time(nullptr);
int numStates = 250;
int numSimulations = 25;
double timeout = 10.0;
bool useIPC2018Rules = false;
// Read optionals
for (; index < argc; ++index) {
std::string nextOption = std::string(argv[index]);
if (nextOption == "-s") {
seed = atoi(std::string(argv[++index]).c_str());
std::cout << "Setting seed to " << seed << std::endl;
} else if (nextOption == "-trainingSimulations") {
numSimulations = atoi(std::string(argv[++index]).c_str());
std::cout << "Setting number of simulations for training set creation to "
<< numSimulations << std::endl;
} else if (nextOption == "-trainingSetSize") {
numStates = atoi(std::string(argv[++index]).c_str());
std::cout << "Setting target training set size to " << numStates << std::endl;
} else if (nextOption == "-trainingTimeout") {
timeout = atof(std::string(argv[++index]).c_str());
std::cout << "Setting training timeout to " << timeout << std::endl;
} else if (nextOption == "-ipc2018") {
useIPC2018Rules = atoi(std::string(argv[++index]).c_str());
std::cout << "Using IPC 2018 rules: " << useIPC2018Rules << std::endl;
} else {
assert(false);
}
}
// Creating RDDLTask object
rddlTask = new RDDLTask();
yy_scan_string(combined.str().c_str());
yyparse();
std::cout << "...finished (" << t << ")." << std::endl;
rddlTask->execute(targetDir, seed, numStates, numSimulations, timeout, useIPC2018Rules);
std::cout << "PROST parser complete running time: " << t << std::endl;
return EXIT_SUCCESS;
}
| [
"Z1124562662@gmail.com"
] | Z1124562662@gmail.com |
e1b5b1fbce02009ff132db978e3374f1dc6c8e27 | ba4a20e4910e727b24bf8348c1be2cacec31b526 | /MTH9821/fd/heat_pde.cpp | d6c0656e072c9e99728bc23d8f9a03eebe7a1269 | [] | no_license | ZHANG-Quentin/baruch-mfe-lab | 4f953eb61f40a88b3fa7e6aa3f3b9fd6a608ad3c | 66ce6a330db34acfd1375438ba2172a98de43c33 | refs/heads/master | 2021-10-08T03:58:40.601316 | 2018-11-24T06:54:19 | 2018-11-24T06:54:19 | 307,905,412 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,534 | cpp | #include <heat_pde.h>
#include <updater.h>
#include <evaluator.h>
#include <cassert>
#include <iostream>
#include <iomanip>
HeatPDE::HeatPDE( double xl,
double xr,
double tf,
double ti,
double (*f)(double),
double (*gl)(double),
double (*gr)(double) )
: d_xl(xl), d_xr(xr), d_tf(tf), d_ti(ti)
{
d_f = new FunctionEvaluator(f);
d_gl = new FunctionEvaluator(gl);
d_gr = new FunctionEvaluator(gr);
d_functionalTerminal = true;
}
HeatPDE::HeatPDE( double xl,
double xr,
double tf,
double ti,
const std::vector<double> & u0,
const Evaluator & gl,
const Evaluator & gr,
const Evaluator & prem )
: d_xl(xl), d_xr(xr), d_tf(tf), d_ti(ti),
d_gl(&gl), d_gr(&gr), d_prem(&prem)
{
d_functionalTerminal = false;
d_u0 = u0;
}
HeatPDE::HeatPDE( double xl,
double xr,
double tf,
double ti,
const Evaluator & f,
const Evaluator & gl,
const Evaluator & gr,
const Evaluator & prem )
: d_xl(xl), d_xr(xr), d_tf(tf), d_ti(ti),
d_f(&f), d_gl(&gl), d_gr(&gr), d_prem(&prem)
{
d_functionalTerminal = true;
}
void HeatPDE::print(double t, const std::vector<double> & u, int step)
{
int uLen = u.size();
std::cout << std::fixed << std::setprecision(9) << t;
for (int n=0; n<uLen; n++) {
if ( n%step == 0 ) {
std::cout << "," << u[n];
}
}
std::cout << std::endl;
}
std::vector<double> HeatPDE::earlyExercisePremiumAtGivemTime(int N, double t,
bool xReversed)
{
std::vector<double> earlyExercisePremium(N+1);
double dx = (d_xr-d_xl)/N;
for (int n=0; n<N+1; n++) {
double x = d_xl + n*dx;
if (xReversed) { x = d_xr - n*dx; }
earlyExercisePremium[n] = (*d_prem)(x,t);
}
return earlyExercisePremium;
}
int HeatPDE::earlyExerciseBoundaryAtGivenTime(const std::vector<double> & u,
const std::vector<double> & p,
bool xReversed)
{
int uLen = u.size();
if (!xReversed) {
for (int n=0; n<uLen-1; n++) {
if (u[n] == p[n] && u[n+1] > p[n+1]) {
return n;
}
}
return uLen;
}
else {
for (int n=uLen; n>0;) {
n--;
if (u[n] == p[n] && u[n-1] > p[n-1]) {
return n;
}
}
return 0;
}
}
void HeatPDE::fdSolve( int M, int N, std::vector<double>* u, Updater* up,
bool isAmerican, bool xReversed, int dM, int dN )
{
assert(u->size() == (unsigned int)(N+1));
d_earlyExerciseBoundary.resize(0);
bool doPrint = false;
if ( dM>0 && dN>0 ) { doPrint = true; }
// grid parameters
double dt = (d_tf-d_ti)/M;
double dx = (d_xr-d_xl)/N;
double c = dt/(dx*dx);
up->config(c,N);
std::vector<double> uNew(N+1,0);
// initial condition
for (int n=0; n<N+1; n++) {
double x = d_xl + n*dx;
if (xReversed) {
x = d_xr - n*dx;
std::reverse(std::begin(*u), std::end(*u));
}
// initialize if functional terminal condition is given
if (d_functionalTerminal) {
(*u)[n] = (*d_f)(x);
}
// print x-coordinates
if (doPrint && n%dN == 0) { std::cout << "," << x; }
}
// Hack!!! Set u at boundaries to zero, only for double barrier test
//(*u)[0]=0;
//(*u)[N]=0;
// End of Hack!!
//std::cout << "==============" << std::endl;
//std::cout << "u initial: " << std::endl;
//for (int i=0; i<(*u).size(); i++) { std::cout << std::setprecision(3) << (*u)[i] << ", "; }
//std::cout << std::endl;
//std::cout << "--------------" << std::endl;
d_earlyExerciseBoundary.push_back(0);
if (doPrint) {
std::cout << std::endl;
print(0, *u, dN);
}
for (int m=0; m<M; m++) {
// boundary conditions at the next time step
double t = d_ti + (m+1)*dt;
uNew[0] = (*d_gl)(t); // set to zero if want to hack
uNew[N] = (*d_gr)(t); // set to zero if want to hack
// Some methods like Backward Euler by LU.
// works in reversed x-coordinates
if (xReversed) {
uNew[N] = 0; // (*d_gl)(t);
uNew[0] = 0; // (*d_gr)(t);
}
// early exercise boundary at the current time step
std::vector<double> prem;
if (isAmerican) {
prem = earlyExercisePremiumAtGivemTime(N, t, xReversed);
}
// time evolution
up->update((*u), &uNew, prem);
// store the solution at T-dt
if ( m == M-1 ) { d_uOld = (*u); }
// write back to output
for (int n=0; n<=N; n++) { (*u)[n] = uNew[n]; }
if (isAmerican) {
int nb = earlyExerciseBoundaryAtGivenTime((*u), prem, xReversed);
if (!xReversed) {
d_earlyExerciseBoundary.push_back(d_xl+nb*dx);
}
else {
d_earlyExerciseBoundary.push_back(d_xr-nb*dx);
}
}
if ( doPrint && m%dM == 0 ) { print(t, *u, dN); }
}
if (xReversed) {
std::reverse(std::begin(*u), std::end(*u));
}
//std::cout << "u final: " << std::endl;
//for (int i=0; i<(*u).size(); i++) { std::cout << std::setprecision(3) << (*u)[i] << ", "; }
//std::cout << std::endl;
//std::cout << "=============" << std::endl;
}
void HeatPDE::fdSolveForwardEuler(int M, int N,
std::vector<double>* u,
int dM, int dN)
{
ForwardEulerUpdater up;
fdSolve(M,N,u,&up,false,false,dM,dN);
}
void HeatPDE::fdSolveBackwardEulerByLU(int M, int N,
std::vector<double>* u,
int dM, int dN)
{
BackwardEulerUpdater up;
fdSolve(M,N,u,&up,false,false,dM,dN);
}
void HeatPDE::fdSolveBackwardEulerBySOR(int M, int N, double w,
std::vector<double>* u,
int dM, int dN)
{
BackwardEulerSorUpdater up(w);
fdSolve(M,N,u,&up,false,false,dM,dN);
}
void HeatPDE::fdSolveCrankNicolsonByLU(int M, int N,
std::vector<double>* u,
int dM, int dN)
{
CrankNicolsonUpdater up;
fdSolve(M,N,u,&up,false,false,dM,dN);
}
void HeatPDE::fdSolveCrankNicolsonBySOR(int M, int N, double w,
std::vector<double>* u,
int dM, int dN)
{
CrankNicolsonSorUpdater up(w);
fdSolve(M,N,u,&up,false,false,dM,dN);
}
void HeatPDE::fdSolveAmericanForwardEuler(int M, int N,
std::vector<double>* u,
int dM, int dN)
{
ForwardEulerUpdater up;
fdSolve(M,N,u,&up,true,false,dM,dN);
}
void HeatPDE::fdSolveAmericanBackwardEulerByLU(int M, int N,
std::vector<double>* u,
int dM, int dN)
{
BackwardEulerUpdater up;
fdSolve(M,N,u,&up,true,true,dM,dN);
}
void HeatPDE::fdSolveAmericanBackwardEulerBySOR(int M, int N, double w,
std::vector<double>* u,
int dM, int dN)
{
BackwardEulerSorUpdater up(w);
fdSolve(M,N,u,&up,true,false,dM,dN);
}
void HeatPDE::fdSolveAmericanCrankNicolsonByLU(int M, int N,
std::vector<double>* u,
int dM, int dN)
{
CrankNicolsonUpdater up;
fdSolve(M,N,u,&up,true,true,dM,dN);
}
void HeatPDE::fdSolveAmericanCrankNicolsonBySOR(int M, int N, double w,
std::vector<double>* u,
int dM, int dN)
{
CrankNicolsonSorUpdater up(w);
fdSolve(M,N,u,&up,true,false,dM,dN);
}
| [
"sqzhou2004@gmail.com"
] | sqzhou2004@gmail.com |
5a9af970727a70c814e3b1fdeaa0235f2c7a832c | f0761aa2dfc54217a4c1dcfdf5717e2d9168b823 | /Arduino/ButtonTest/ButtonTest.ino | ed72c116fd629c1841576d1a73d2bdeb394f4aa4 | [] | no_license | imclab/moonlander-trails | 978b50cf349aa78938b24ef1429ca1f2b52236b2 | 757eda6b27d2defb4c11ec00b9241960cd607a35 | refs/heads/master | 2021-01-22T13:30:57.090707 | 2014-04-10T22:28:44 | 2014-04-10T22:28:44 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,675 | ino |
int const A_END_STOP_MIN_PIN = 28;
int const A_END_STOP_MAX_PIN = 32;
int const B_END_STOP_MIN_PIN = 38;
int const B_END_STOP_MAX_PIN = 42;
int const BOTH_RESET_PIN = 48;
int const A_CALIBRATION_PIN = 30;
int const B_CALIBRATION_PIN = 40;
#include "Button.h"
Button endStopMinButtonA = Button(A_END_STOP_MIN_PIN, true, HIGH);
Button endStopMaxButtonA = Button(A_END_STOP_MAX_PIN, true, HIGH);//, false, HIGH);
Button calibrationButtonA = Button(A_CALIBRATION_PIN, true, HIGH);//, false, HIGH);
Button endStopMinButtonB = Button(B_END_STOP_MIN_PIN, true, HIGH);//, false, HIGH);
Button endStopMaxButtonB = Button(B_END_STOP_MAX_PIN, true, HIGH);//, false);
Button calibrationButtonB = Button(B_CALIBRATION_PIN, true, HIGH);//, false);
// DON'T FORGET to add to NUM_BUTTONS if you add to the array
Button* buttons[] = {
&endStopMinButtonA,
&endStopMaxButtonA,
&endStopMinButtonB,
&endStopMaxButtonB,
&calibrationButtonA,
&calibrationButtonB
};
const int NUM_BUTTONS = 6;
void setup() {
// put your setup code here, to run once:
pinMode(A_END_STOP_MIN_PIN, INPUT_PULLUP);
Serial.begin(115200);
}
void loop() {
// put your main code here, to run repeatedly:
Serial.println(digitalRead(A_END_STOP_MIN_PIN));
updateButtons();
}
void updateButtons() {
boolean changed = true;
for(int i = 0; i< NUM_BUTTONS; i++) {
if( buttons[i]->update() ) changed = true;
}
if(changed) {
// send button data...
Serial.print("buttons:");
for(int i = 0; i< NUM_BUTTONS; i++) {
if(buttons[i]->isOn()) Serial.print("1");
else Serial.print("0");
}
Serial.println("");
}
}
| [
"sebleedelisle@gmail.com"
] | sebleedelisle@gmail.com |
aeb80d6b39d9e4c487661a37f5eab7b99e6c0a59 | 104ce9775b9214e2c286c0162eefb72e593607f9 | /Src/EB/AMReX_algoim_K.H | 0aa75427b157c63253414b83d017806ef710d0b7 | [
"BSD-2-Clause"
] | permissive | daseven/amrex | c792758281928c8f056118ea9e926768f2886c45 | bdd1146139e8727a513d451075f900c172eb81fd | refs/heads/master | 2020-07-13T10:19:05.529081 | 2019-08-01T15:59:24 | 2019-08-01T15:59:51 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 18,929 | h | /*
* This file contains a modified version of Algoim developed by
* R. Saye, SIAM J. Sci. Comput., Vol. 37, No. 2, pp. A993-A1019,
* http://dx.doi.org/10.1137/140966290, https://algoim.github.io/.
*
* Algoim Copyright (c) 2018, The Regents of the University of
* California, through Lawrence Berkeley National Laboratory (subject
* to receipt of any required approvals from the U.S. Dept. of
* Energy). All rights reserved.
*/
#ifndef AMREX_ALGOIM_K_H_
#define AMREX_ALGOIM_K_H_
#include <AMReX_algoim.H>
#include <AMReX_Array.H>
#include <limits>
#include <cfloat>
namespace amrex { namespace algoim {
struct EBPlane
{
GpuArray<Real,3> cent{};
GpuArray<Real,3> norm{};
EBPlane () = default;
AMREX_GPU_HOST_DEVICE
constexpr
EBPlane (GpuArray<Real,3> const& c, GpuArray<Real,3> const n) noexcept
: cent(c), norm(n)
{}
AMREX_GPU_HOST_DEVICE
constexpr
EBPlane (Real cx, Real cy, Real cz, Real nx, Real ny, Real nz) noexcept
: cent{cx,cy,cz}, norm{nx,ny,nz}
{}
AMREX_GPU_HOST_DEVICE AMREX_FORCE_INLINE
Real operator() (Real x, Real y, Real z) const noexcept
{
return (x-cent[0])*norm[0] + (y-cent[1])*norm[1] + (z-cent[2])*norm[2];
}
AMREX_GPU_HOST_DEVICE AMREX_FORCE_INLINE
Real operator() (GpuArray<Real,3> const& p) const noexcept
{
return (p[0]-cent[0])*norm[0] + (p[1]-cent[1])*norm[1]
+ (p[2]-cent[2])*norm[2];
}
AMREX_GPU_HOST_DEVICE AMREX_FORCE_INLINE
Real grad (int d) const noexcept
{
return norm[d];
}
};
struct QuadratureRule
{
struct Node
{
Real x, y, z, w;
};
int nnodes = 0;
GpuArray<Node,256> nodes;
template<typename F>
AMREX_GPU_HOST_DEVICE AMREX_FORCE_INLINE
Real
operator() (const F& f) const noexcept
{
Real r = 0;
for (int i = 0; i < nnodes; ++i) {
r += f(nodes[i].x,nodes[i].y,nodes[i].z) * nodes[i].w;
}
return r;
}
template<typename F>
AMREX_GPU_HOST AMREX_FORCE_INLINE
Real
eval (const F& f) const noexcept
{
Real r = 0;
for (int i = 0; i < nnodes; ++i) {
r += f(nodes[i].x,nodes[i].y,nodes[i].z) * nodes[i].w;
}
return r;
}
// evalIntegrand records quadrature nodes when it is invoked by
// ImplicitIntegral
AMREX_GPU_HOST_DEVICE AMREX_FORCE_INLINE
void
evalIntegrand (const GpuArray<Real,3>& x_, Real w_) noexcept
{
nodes[nnodes].x = x_[0];
nodes[nnodes].y = x_[1];
nodes[nnodes].z = x_[2];
nodes[nnodes].w = w_;
++nnodes;
}
};
namespace detail
{
template <class T>
AMREX_GPU_HOST_DEVICE AMREX_FORCE_INLINE
void swap (T& a, T& b) noexcept {
T c(a); a=b; b=c;
}
// Determines the sign conditions for restricting a (possibly
// already restricted) level set function, i.e., sgn_L and sgn_U
// in [R. Saye, High-Order Quadrature Methods for Implicitly
// Defined Surfaces and Volumes in Hyperrectangles, SIAM
// J. Sci. Comput., Vol. 37, No. 2, pp. A993-A1019,
// http://dx.doi.org/10.1137/140966290].
AMREX_GPU_HOST_DEVICE AMREX_FORCE_INLINE
void
determineSigns (bool positiveAbove, int sign, int& bottomSign, int& topSign) noexcept
{
// When evaluating a volume integral:
// If 0 integrating over the positive part:
// if positive above the height function: bottom = +/-, top = +
// if positive below the height function: bottom = +, top = +/-
// If integrating over the negative part:
// if positive above the height function: bottom = -, top = +/-
// if positive below the height function: bottom = +/-, top = -
// If integrating over both the positive and negative part (i.e. unrestricted in sign), keep it alive
if (sign == 1)
{
bottomSign = positiveAbove? 0 : 1;
topSign = positiveAbove? 1 : 0;
}
else if (sign == -1)
{
bottomSign = positiveAbove? -1 : 0;
topSign = positiveAbove? 0 : -1;
}
else {
bottomSign = topSign = 0;
}
}
} // namespace detail
// PsiCode encodes sign information of restricted level set functions
// on particular sides of a hyperrectangle in a packed array of
// bits. The first N bits encodes side information, the N+1st bit is
// true iff the sign == 0, while the N+2nd bit stores the sign if sign
// != 0.
template<int N>
struct PsiCode
{
unsigned char bits = 0;
AMREX_GPU_HOST_DEVICE AMREX_FORCE_INLINE constexpr
PsiCode () noexcept {}
AMREX_GPU_HOST_DEVICE AMREX_FORCE_INLINE
PsiCode (const GpuArray<int,N>& sides, int sign) noexcept
{
static_assert(N <= 3, "algoim::PsiCode: N must be <= 3");
for (int dim = 0; dim < N; ++dim) {
if (sides[dim] == 1) {
bits |= (1 << dim);
}
}
if (sign == 0) {
bits |= (1 << N);
} else {
bits &= ~(1 << N);
if (sign == 1) {
bits |= (1 << (N+1));
}
}
}
// Modify an existing code by restriction in a particular dimension.
AMREX_GPU_HOST_DEVICE AMREX_FORCE_INLINE
PsiCode (const PsiCode& i, int dim, int side, int sign) noexcept
: bits(i.bits)
{
if (side == 1) {
bits |= (1 << dim);
}
if (sign == 0) {
bits |= (1 << N);
} else {
bits &= ~(1 << N);
if (sign == 1) {
bits |= (1 << (N+1));
}
}
}
AMREX_GPU_HOST_DEVICE AMREX_FORCE_INLINE
int side (int dim) const noexcept
{
return bits & (1 << dim);
}
AMREX_GPU_HOST_DEVICE AMREX_FORCE_INLINE
int sign () const noexcept
{
return (bits & (1 << N)) ? 0 : ((bits & (1 << (N+1))) ? 1 : -1);
}
};
template <int N>
struct BoundingBox
{
static constexpr Real min (int /*dim*/) noexcept { return -0.5; }
static constexpr Real max (int /*dim*/) noexcept { return 0.5; }
static constexpr Real extent (int /*dim*/) noexcept { return 1.0; }
static constexpr GpuArray<Real,N> midpoint () noexcept {
return GpuArray<Real,N>{};
}
static constexpr Real midpoint (int /*dim*/) noexcept { return 0.0; }
constexpr Real operator() (int side, int /*dim*/) const noexcept {
return (side == 0) ? -0.5 : 0.5;
}
};
struct Interval
{
Real alpha;
};
// M-dimensional integral of an N-dimensional function restricted to
// given implicitly defined domains
template<int M, int N, typename Phi, typename F>
struct ImplicitIntegral
{
const Phi& phi;
F& f;
const GpuArray<bool,N> free;
GpuArray<PsiCode<N>,1 << (N - 1)> psi;
int psiCount;
const BoundingBox<N> xrange;
int e0;
GpuArray<Interval,N> xint;
static constexpr int p = 4;
// Prune the given set of functions by checking for the existence
// of the interface. If a function is uniformly positive or
// negative and is consistent with specified sign, it can be
// removed. If a function is uniformly positive or negative but
// inconsistent with specified sign, the domain of integration is
// empty.
AMREX_GPU_HOST_DEVICE
bool prune () noexcept
{
#if !defined(__CUDACC__) || (__CUDACC_VER_MAJOR__ != 9) || (__CUDACC_VER_MINOR__ != 2)
static constexpr Real eps = std::numeric_limits<Real>::epsilon();
#else
static constexpr Real eps = DBL_EPSILON;
#endif
static constexpr Real almostone = 1.0-10.*eps;
for (int i = 0; i < psiCount; )
{
GpuArray<Real,N> mid = xrange.midpoint();
Real dphi_max = 0.0;
for (int dim = 0; dim < N; ++dim) {
if (free[dim]) {
dphi_max += std::abs(phi.grad(dim));
} else {
mid[dim] = xrange(psi[i].side(dim),dim);
}
}
dphi_max *= 0.5*almostone;
const Real phi_0 = phi(mid);
bool uniform_sign = (phi_0 > dphi_max) or (phi_0 < -dphi_max);
if (uniform_sign)
{
if ((phi_0 >= 0.0 and psi[i].sign() >= 0) or
(phi_0 <= 0.0 and psi[i].sign() <= 0) )
{
--psiCount;
detail::swap(psi[i], psi[psiCount]);
}
else {
return false;
}
}
else {
++i;
}
}
return true;
}
// Gaussian quadrature for when the domain of integration is
// determined to be the entire M-dimensional cube.
AMREX_GPU_HOST_DEVICE
void tensorProductIntegral () noexcept
{
constexpr Real gauss_x[4]={0.069431844202973712388026755553595247452,
0.33000947820757186759866712044837765640,
0.66999052179242813240133287955162234360,
0.93056815579702628761197324444640475255};
constexpr Real gauss_w[4]={0.173927422568726928686531974610999703618,
0.326072577431273071313468025389000296382,
0.326072577431273071313468025389000296382,
0.173927422568726928686531974610999703618};
int nloops = 1;
for (int i = 0; i < M; ++i) {
nloops *= p;
}
GpuArray<int,M> i{}; // i is initialized to zero.
for (int iloop = 0; iloop < nloops; ++iloop)
{
GpuArray<Real,N> x{};
Real w = 1.0;
for (int dim = 0, k = 0; dim < N; ++dim) {
if (free[dim]) {
x[dim] = xrange.min(dim) + xrange.extent(dim) * gauss_x[i[k]];
w *= xrange.extent(dim) * gauss_w[i[k]];
++k;
}
}
f.evalIntegrand(x, w);
for (int m = M-1; m >= 0; --m) {
++(i[m]);
if (i[m] < p) {
break;
} else {
i[m] = 0;
}
}
}
}
// Given x, valid in all free variables barring e0, root find in
// the e0 direction on each of the implicit functions, and apply
// Gaussian quadrature to each segment. Weights are multiplied
// upon going back up the tree of recursive calls.
AMREX_GPU_HOST_DEVICE
void evalIntegrand (GpuArray<Real,N> x, Real w) const noexcept
{
constexpr Real gauss_x[4]={0.069431844202973712388026755553595247452,
0.33000947820757186759866712044837765640,
0.66999052179242813240133287955162234360,
0.93056815579702628761197324444640475255};
constexpr Real gauss_w[4]={0.173927422568726928686531974610999703618,
0.326072577431273071313468025389000296382,
0.326072577431273071313468025389000296382,
0.173927422568726928686531974610999703618};
// Each thread has its own storage for computing roots. These
// are not corrupted by the recursive chain of evalIntegrand()
// calls since each call is in a different templated
// namespace. Moreover, if using OpenMP tasking, each task is
// assumed tied and so one thread can only execute
// "evalIntegrand" from start to end uninterrupted.
GpuArray<Real,4> roots;
// Partition [xmin(e0), xmax(e0)] by roots found
Real x_min = xrange.min(e0);
Real x_max = xrange.max(e0);
roots[0] = x_min;
int nroots = 1;
for (int i = 0; i < psiCount; ++i)
{
for (int dim = 0; dim < N; ++dim) {
if (!free[dim]) {
x[dim] = xrange(psi[i].side(dim),dim);
}
}
// x is now valid in all variables except e0
x[e0] = x_min;
Real phi_lo = phi(x);
Real xroot = x[e0] - phi_lo / phi.grad(e0);
if (xroot > x_min and xroot < x_max) {
roots[nroots++] = xroot;
}
}
AMREX_ASSERT(nroots <= 3);
if (nroots == 3 and roots[1] > roots[2]) {
detail::swap(roots[1],roots[2]);
}
roots[nroots++] = x_max;
// In rare cases, degenerate segments can be found, filter out with a tolerance
#if !defined(__CUDACC__) || (__CUDACC_VER_MAJOR__ != 9) || (__CUDACC_VER_MINOR__ != 2)
static constexpr Real eps = std::numeric_limits<Real>::epsilon();
#else
static constexpr Real eps = DBL_EPSILON;
#endif
constexpr Real tol = 50.0*eps;
// Loop over segments of divided interval
for (int i = 0; i < nroots - 1; ++i)
{
if (roots[i+1] - roots[i] < tol) continue;
// Evaluate sign of phi within segment and check for consistency with psi
bool okay = true;
x[e0] = (roots[i] + roots[i+1])*0.5;
for (int j = 0; j < psiCount && okay; ++j)
{
for (int dim = 0; dim < N; ++dim) {
if (!free[dim]) {
x[dim] = xrange(psi[j].side(dim), dim);
}
}
bool new_ok = (phi(x) > 0.0) ? (psi[j].sign() >= 0) : (psi[j].sign() <= 0);
okay = okay and new_ok;
}
if (!okay) continue;
for (int j = 0; j < p; ++j)
{
x[e0] = roots[i] + (roots[i+1] - roots[i]) * gauss_x[j];
Real gw = (roots[i+1] - roots[i]) * gauss_w[j];
f.evalIntegrand(x, w * gw);
}
}
}
// Main calling engine; parameters with underscores are copied
// upon entry but modified internally in the ctor
AMREX_GPU_HOST_DEVICE
ImplicitIntegral (const Phi& phi_, F& f_, const GpuArray<bool,N>& free_,
const GpuArray<PsiCode<N>,1 << (N-1)>& psi_,
int psiCount_) noexcept
: phi(phi_), f(f_), free(free_), psi(psi_), psiCount(psiCount_),
xrange()
{
// For the one-dimensional base case, evaluate the
// bottom-level integral.
if (M == 1)
{
for (int dim = 0; dim < N; ++dim) {
if (free[dim]) {
e0 = dim;
}
}
evalIntegrand(GpuArray<Real,N>{}, 1.0);
return;
}
// Establish interval bounds for prune() and remaining part of ctor.
for (int dim = 0; dim < N; ++dim)
{
if (free[dim])
{
xint[dim].alpha = xrange.midpoint(dim);
}
else
{
xint[dim].alpha = 0.0;
}
}
// Prune list of psi functions: if prune procedure returns
// false, then the domain of integration is empty.
if (!prune()) {
return;
}
// If all psi functions were pruned, then the volumetric
// integral domain is the entire hyperrectangle.
if (psiCount == 0)
{
tensorProductIntegral();
return;
}
// Among all monotone height function directions, choose the
// one that makes the associated height function look as flat
// as possible. This is a modification to the criterion
// presented in [R. Saye, High-Order Quadrature Methods for
// Implicitly Defined Surfaces and Volumes in Hyperrectangles,
// SIAM J. Sci. Comput., Vol. 37, No. 2, pp. A993-A1019,
// http://dx.doi.org/10.1137/140966290].
e0 = -1;
{
Real gmax = -1.;
for (int dim = 0; dim < N; ++dim) {
if (free[dim] && std::abs(phi.grad(dim)) > gmax) {
gmax = std::abs(phi.grad(dim));
e0 = dim;
}
}
}
// Check compatibility with all implicit functions whilst
// simultaneously constructing new implicit functions.
GpuArray<PsiCode<N>,1 << (N-1)> newPsi;
int newPsiCount = 0;
for (int i = 0; i < psiCount; ++i)
{
// Evaluate gradient in an interval
for (int dim = 0; dim < N; ++dim) {
if (!free[dim]) {
xint[dim].alpha = xrange(psi[i].side(dim), dim);
}
}
// w.z. We assume grad does not change.
int bottomSign, topSign;
detail::determineSigns(phi.grad(e0) > 0.0, psi[i].sign(),
bottomSign, topSign);
// w.z. There are sides 0 and 1.
newPsi[newPsiCount++] = PsiCode<N>(psi[i], e0, 0, bottomSign);
newPsi[newPsiCount++] = PsiCode<N>(psi[i], e0, 1, topSign);
}
// Dimension reduction call
GpuArray<bool,N> new_free = free;
new_free[e0] = false;
ImplicitIntegral<M-1,N,Phi,ImplicitIntegral<M,N,Phi,F> >
(phi, *this, new_free, newPsi, newPsiCount);
}
};
// Partial specialisation on M=0 as a dummy base case for the compiler
template<int N, typename Phi, typename F>
struct ImplicitIntegral<0,N,Phi,F>
{
AMREX_GPU_HOST_DEVICE
ImplicitIntegral (const Phi&, F&, const GpuArray<bool,N>&,
const GpuArray<PsiCode<N>,1 << (N-1)>&,
int) noexcept {}
};
AMREX_GPU_HOST_DEVICE inline
QuadratureRule
quadGen (EBPlane const& phi) noexcept
{
QuadratureRule q;
GpuArray<bool,3> free{true,true,true};
GpuArray<PsiCode<3>,4> psi;
psi[0] = PsiCode<3>({0,0,0}, -1);
ImplicitIntegral<3,3,EBPlane,QuadratureRule>(phi, q, free, psi, 1);
return q;
}
AMREX_GPU_HOST_DEVICE AMREX_FORCE_INLINE
void set_regular (int i, int j, int k, Array4<Real> const& intg) noexcept
{
constexpr Real twelfth = 1./12.;
constexpr Real offth = 1./144.;
intg(i,j,k,i_S_x ) = 0.0;
intg(i,j,k,i_S_y ) = 0.0;
intg(i,j,k,i_S_z ) = 0.0;
intg(i,j,k,i_S_x2 ) = twelfth;
intg(i,j,k,i_S_y2 ) = twelfth;
intg(i,j,k,i_S_z2 ) = twelfth;
intg(i,j,k,i_S_x_y ) = 0.0;
intg(i,j,k,i_S_x_z ) = 0.0;
intg(i,j,k,i_S_y_z ) = 0.0;
intg(i,j,k,i_S_x2_y ) = 0.0;
intg(i,j,k,i_S_x2_z ) = 0.0;
intg(i,j,k,i_S_x_y2 ) = 0.0;
intg(i,j,k,i_S_y2_z ) = 0.0;
intg(i,j,k,i_S_x_z2 ) = 0.0;
intg(i,j,k,i_S_y_z2 ) = 0.0;
intg(i,j,k,i_S_x2_y2) = offth;
intg(i,j,k,i_S_x2_z2) = offth;
intg(i,j,k,i_S_y2_z2) = offth;
}
}}
#endif
| [
"weiqunzhang@lbl.gov"
] | weiqunzhang@lbl.gov |
0d4692a95b5b1027f3e78d9145d8a49dbb722ff9 | ec042cf3280a01eb87999364abb55880f69373a3 | /DeviceCreator/parsers/distroparser.h | 4365d514c58eed734b724fe769efd33c845fb774 | [] | no_license | JosephMillsAtWork/devicecreator | a57a69f29abeff9be3f7538a885d02eb1459a4e5 | 2bcb7a45bee0e75f3a4c8010e28d8820d89a88d7 | refs/heads/master | 2020-05-23T18:54:58.407038 | 2019-05-15T11:01:00 | 2019-05-15T11:01:00 | 186,899,886 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 233 | h | #ifndef DISTROPARSER_H
#define DISTROPARSER_H
#include <QObject>
class DistroParser : public QObject
{
Q_OBJECT
public:
explicit DistroParser(QObject *parent = nullptr);
signals:
public slots:
};
#endif // DISTROPARSER_H | [
"josephjamesmills2@gmail.com"
] | josephjamesmills2@gmail.com |
cde11b959e53372654381fce639a40d9b3a4e0bb | 5a7dfe347104ef2c8234df61a6a7a846cfe844a1 | /JetEngine/Graphics/FoliageRenderer.cpp | 12f53b0eb6636b518257cd2c499ff8bd57965339 | [
"MIT"
] | permissive | matt-attack/Jet-Engine | 348251a235416834216b1841edaa9ed867ed3452 | 4b86ae2b7b60a326a7a329942d2c8f656ed2bd9f | refs/heads/master | 2021-01-12T04:16:48.145129 | 2020-04-05T16:51:24 | 2020-04-05T16:51:24 | 77,561,904 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 18,301 | cpp | #include "FoliageRenderer.h"
#include "RenderTexture.h"
#include "Models/ObjModel.h"
#include "../ModelData.h"
#include "ParticleRenderer.h"
#include <D3D11.h>
#include "Shader.h"
#include "CRenderer.h"
#include "../ResourceManager.h"
#include "CTexture.h"
#include "../Util/Profile.h"
const int tile_size = 1024;
FoliageRenderer::FoliageRenderer()
{
this->shader = 0;
this->texture = 0;
}
FoliageRenderer::~FoliageRenderer()
{
delete[] tiles;
}
Vec2 FoliageRenderer::GetImpostorSize(ObjModel* model)
{
//ObjModel model;// = new ObjModel;
//model.Load(name);// mech2.iqm");
model->animate = true;//uses keyframe number for bounds
model->aabb = model->data->joints[0].bb;
//model.aabb.min = Vec3(model.t->bounds[25].bbmin);// -Vec3(2, 0, 10);
//model.aabb.max = Vec3(model.t->bounds[25].bbmax);// +Vec3(2, 0, -10);
auto ii = model;
Matrix4 view = Matrix4::BuildMatrix(Vec3(0, 0, 1), Vec3(1, 0, 0), Vec3(0, 1, 0));// cam._matrix.LookAtLHMatrix(cam._pos, Vec3(0, 0, 0), Vec3(0, 1, 0));//cam._matrix;
//Matrix4 view = Matrix4::BuildMatrix(Vec3(0, 0, 1), Vec3(0, 1, 0), Vec3(1, 0, 0));
float objsNear = FLT_MAX, objsFar = -FLT_MAX;
float objsXmin = FLT_MAX;
float objsXmax = -FLT_MAX;
float objsYmin = FLT_MAX;
float objsYmax = -FLT_MAX;
Vec3 boxCorners[6];
boxCorners[0] = view * ii->aabb.max;//Vec3(ii->_position.x, ii->_position.y, ii->_position.z);
boxCorners[1] = view * ii->aabb.min;//Vec3(ii->_position.x, ii->_position.y+16, ii->_position.z);
boxCorners[2] = view * Vec3(ii->aabb.min.x, ii->aabb.max.y, ii->aabb.max.z);//Vec3(ii->_position.x, ii->_position.y, ii->_position.z+16);
boxCorners[3] = view * Vec3(ii->aabb.min.x, ii->aabb.min.y, ii->aabb.max.z);//Vec3(ii->_position.x+16, ii->_position.y, ii->_position.z+16);
boxCorners[4] = view * Vec3(ii->aabb.max.x, ii->aabb.min.y, ii->aabb.max.z);//Vec3(ii->_position.x+16, ii->_position.y+16, ii->_position.z+16);
boxCorners[5] = view * Vec3(ii->aabb.min.x, ii->aabb.max.y, ii->aabb.min.z);//Vec3(ii->_position.x+16, ii->_position.y, ii->_position.z);
//TransformArray(boxCorners, _countof(boxCorners), view);
for (unsigned int corner_i = 0; corner_i < 6; corner_i++)
{
if (boxCorners[corner_i].z < objsNear) objsNear = boxCorners[corner_i].z;
if (boxCorners[corner_i].z > objsFar) objsFar = boxCorners[corner_i].z;
if (boxCorners[corner_i].x < objsXmin) objsXmin = boxCorners[corner_i].x;
if (boxCorners[corner_i].x > objsXmax) objsXmax = boxCorners[corner_i].x;
if (boxCorners[corner_i].y < objsYmin) objsYmin = boxCorners[corner_i].y;
if (boxCorners[corner_i].y > objsYmax) objsYmax = boxCorners[corner_i].y;
}
auto dimensions = Vec2(abs(objsXmax - objsXmin), abs(objsYmax - objsYmin));
std::swap(dimensions.x, dimensions.y);//bug fix
return dimensions;
}
TreeBillboard* FoliageRenderer::AddTree(float inx, float iny)
{
int x = (int)inx / tile_size;
int y = (int)iny / tile_size;
this->tiles[x + y * this->tiles_dim].data.push_back({});
return &this->tiles[x + y * this->tiles_dim].data.back();
}
#include "../Util/Noise.h"
void FoliageRenderer::Init(HeightmapTerrainSystem* system)
{ //need to document materials and models for exporting so can add new trees
if (this->shader)
return;//already loaded
//ok, lets swap to a tile based system, split world into 1024x1024 tiles?
//this->AddModel("tree.iqm");
//this->AddModel("tree2.iqm");
this->AddModel("tree3.iqm");
this->size = system->GetSize();
//subdivide
int num = size / tile_size;
if (size % tile_size)
num++;
num++;
this->tiles_dim = num;
this->tiles = new TreeTile[num*num];
for (int x = 0; x < num; x++)
{
for (int y = 0; y < num; y++)
{
TreeTile* tile = &tiles[x + y * num];
tile->x = x * tile_size;
tile->y = y * tile_size;
tile->size = tile_size;
}
}
// The initial particle emitter has type 0 and age 0. The rest
// of the particle attributes do not apply to an emitter.
//this->data = new TreeBillboard[41024];
//Particle p[20];
//ZeroMemory(&p, sizeof(Particle));
//p.Age = 0.0f;
//p.Type = 0;
//experiment with forests and add tree collisions
// how to do groupings of trees???
//new algorithm
int cols = 175;
int rows = 175;
float w = 2048 * TerrainScale;
float h = 2048 * TerrainScale;
float xd = w / cols;
float yd = h / rows;
int i = 0;
Vec3 normal;
for (int ix = 0; ix < (cols + 1); ix++)
{
for (int iy = 0; iy < (rows + 1); iy++)
{
int model = rand() % this->tree_models.size();
float x = 0 + xd * ix + 0.0f*xd;
float y = 0 + yd * iy + 0.0f*yd;
x += (static_cast <float> (rand()) / (static_cast <float> (RAND_MAX / (0.8f*xd)))) - 0.4f*xd;
y += (static_cast <float> (rand()) / (static_cast <float> (RAND_MAX / (0.8f*yd)))) - 0.4f*yd;
//data[i].position += (Vec3::random(0.8*xd, 0, 0.8*yd) - Vec3(0.4*xd,0,0.4*yd));// +Vec3(512, 0, 512);
float z = system->GetHeightAndNormal(x, y, normal);
if (normal.z < 0.9)
continue;
float noise = noise2d_perlin(x / 300.0, y / 300.0, 84652, 3, 0.9);
if (noise < 0.3)
continue;
auto tree = this->AddTree(x, y);
tree->position.x = x;
tree->position.y = y;
tree->position.z = z;
float h = 1.0 + (rand() % 100) / 100.0f;
float w = 1.0 + (rand() % 100) / 100.0f;
tree->size.x = this->tree_models[model].dimensions.x*w;
tree->size.y = this->tree_models[model].dimensions.y*h;
tree->position.z += tree->size.y / 2;
tree->normal = normal;
tree->color = COLOR_ARGB(255, rand() % 155 + 100, rand() % 155 + 100, 0);
tree->type = model;
i++;
}
}
//update vertex buffers for tiles
for (int i = 0; i < this->tiles_dim*this->tiles_dim; i++)
{
if (this->tiles[i].data.size() > 0)
this->tiles[i].vb.Data(this->tiles[i].data.data(), this->tiles[i].data.size() * sizeof(TreeBillboard), sizeof(TreeBillboard));
}
VertexElement elm9[] = { { ELEMENT_FLOAT3, USAGE_POSITION },
{ ELEMENT_FLOAT3, USAGE_NORMAL },
//{ ELEMENT_FLOAT3, USAGE_TEXCOORD },
{ ELEMENT_FLOAT2, USAGE_TANGENT },
//{ ELEMENT_FLOAT2, USAGE_NORMAL },
//{ ELEMENT_FLOAT, USAGE_BLENDWEIGHT },
{ ELEMENT_COLOR, USAGE_COLOR },
{ ELEMENT_FLOAT, USAGE_BLENDWEIGHT } };
this->vd = renderer->GetVertexDeclaration(elm9, 5);
//ok, need to make geometry shaders reloadable too
// maybe add some metadata in start of shader file?
this->shader = resources.get_shader("Shaders/tree_billboards.shdr");
this->shader_shadow = resources.get_shader("Shaders/tree_billboards_shadow.shdr");
}
void FoliageRenderer::AddModel(const char* name)
{
ObjModel* model = new ObjModel;
model->Load(name);
model->animate = true;//uses keyframe number for bounds
model->aabb = model->data->joints[0].bb;
this->tree_models.push_back({ this->GetImpostorSize(model), model });
}
void FoliageRenderer::Render(CRenderer* renderer, const CCamera& cam)
{
PROFILE("foliage render");
float fade_distance = 100;
//ok, now lets be super dumb
//ok, lets speed this up considerably
int count[8] = { 0, 0, 0, 0, 0, 0, 0, 0 };
int dist = this->tiles[0].size + fade_distance;
for (int i = 0; i < this->tiles_dim*this->tiles_dim; i++)
{
int x = this->tiles[i].x + this->tiles[i].size / 2;
int y = this->tiles[i].y + this->tiles[i].size / 2;
int index = i;// x + y*this->tiles_dim;
if (((x - cam._pos.x) * (x - cam._pos.x) + (y - cam._pos.y)*(y - cam._pos.y)) < dist*dist)
{
//render whats inside
for (int i = 0; i < this->tiles[index].data.size(); i++)
{
if (this->tiles[index].data[i].position.distsqr(cam._pos) < fade_distance * fade_distance)
{
int type = this->tiles[index].data[i].type;
auto& model = this->tree_models[type];
//make trees use the alpha test material
//get available model
ObjModel* rm = 0;
if (render_models[type].size() <= count[type])
{
//allocate new one
auto tmp = new ObjModel;
tmp->Load(model.model->name);
render_models[type].push_back(tmp);
rm = tmp;
count[type]++;
}
else
{
rm = render_models[type][count[type]++];
}
//render it
float hf = this->tiles[index].data[i].size.x / model.dimensions.x;
float vf = this->tiles[index].data[i].size.y / model.dimensions.y;
Vec3 offset = this->tiles[index].data[i].position - Vec3(0, 0, model.dimensions.y*vf / 2);
rm->aabb = rm->data->joints[0].bb;
rm->aabb.min *= 2;
rm->aabb.max *= 2;
rm->aabb.max += offset;
rm->aabb.min += offset;
//rm->matrix = Matrix4::ScaleMatrixXYZ(hf, hf, vf)*/*Matrix4::RotationMatrixX(-3.1415926535895f / 2.0f)**/Matrix4::TranslationMatrix(offset);
auto mat = r.AllocateMatrix();
*mat = Matrix4::ScaleMatrixXYZ(hf, hf, vf)*Matrix4::TranslationMatrix(offset);
rm->color = this->tiles[index].data[i].color;
//add color here
r.add_renderables_.push_back({ rm, mat, rm->aabb });
//r.AddRenderable(rm);
}
}
}
}
}
void FoliageRenderer::RenderImpostors(CRenderer* renderer, const CCamera& cam)
{
//todo: need to generate normal map in each and make sure to render at fullbright
this->GenerateImpostors();
ID3D11DeviceContext* dc = renderer->context;
ID3D11Buffer* b = 0;
renderer->context->PSSetConstantBuffers(2, 1, &b);
Matrix4 VP = cam._matrix*cam._projectionMatrix;// ViewProj();
//int total = mNum;
//
// Set constants.
//
struct ConstantBufferType
{
Matrix4 vp;
Vec4 eyep;
Vec4 light;
//float padding2;
//Vec3 lightd;
Vec2 pos[4];
} skyb;
skyb.pos[0] = Vec2(0.0f, 1.0f);
skyb.pos[1] = Vec2(1.0f, 1.0f);
skyb.pos[2] = Vec2(0.0f, 0.0f);
skyb.pos[3] = Vec2(1.0f, 0.0f);
skyb.vp = VP.Transpose();
skyb.eyep = (Vec4)cam._pos;
skyb.light.xyz = r.GetSunLightDirection();
//lets try shadows
renderer->SetShader(this->shader_shadow);
renderer->SetCullmode(CULL_NONE);
this->shader_shadow->cbuffers["Variables"].UploadAndSet(&skyb, sizeof(ConstantBufferType));
//renderer->DepthWriteEnable(false);
renderer->SetFilter(0, FilterMode::Linear);
renderer->DepthWriteEnable(false);
//renderer->SetDepthRange(0.0f, 0.0f);
this->shader_shadow->BindIL(&this->vd);
renderer->EnableAlphaBlending(true);
renderer->context->GSSetShader(this->shader_shadow->gshader, 0, 0);
renderer->SetPrimitiveType(PrimitiveType::PT_POINTS);
//dc->IASetPrimitiveTopology(D3D11_PRIMITIVE_TOPOLOGY_POINTLIST);
UINT stride = sizeof(TreeBillboard);
UINT offset = 0;
//this->texture = resources.get<CTexture>("smoke.png");
renderer->SetPixelTexture(4, this->texture);
//render tiles
for (int i = 0; i < this->tiles_dim*this->tiles_dim; i++)
{
if (this->tiles[i].data.size() == 0)
continue;
//todo, check if visible too
if (cam.BoxInFrustum(AABB(Vec3(tiles[i].x, tiles[i].y, 0), Vec3(tiles[i].x + tile_size, tiles[i].y + tile_size, 20000))) == false)
continue;
//actually render it
dc->IASetVertexBuffers(0, 1, &this->tiles[i].vb.vb, &stride, &offset);
dc->Draw(this->tiles[i].data.size(), 0);
}
renderer->context->GSSetShader(0, 0, 0);
renderer->EnableAlphaBlending(false);
renderer->DepthWriteEnable(true);
renderer->SetDepthRange(0, 1.0);
renderer->SetShader(this->shader);
renderer->SetCullmode(CULL_NONE);
this->shader->cbuffers["Variables"].UploadAndSet(&skyb, sizeof(ConstantBufferType));
//
// Set IA stage.
//
//renderer->DepthWriteEnable(true);
renderer->SetFilter(0, FilterMode::Linear);
this->shader->BindIL(&this->vd);// GetVertexDeclaration(22));
renderer->EnableAlphaBlending(false);
renderer->context->GSSetShader(this->shader->gshader, 0, 0);
//dc->IASetInputLayout(renderer->GetVertexDeclaration(15));
renderer->SetPrimitiveType(PrimitiveType::PT_POINTS);
//dc->IASetPrimitiveTopology(D3D11_PRIMITIVE_TOPOLOGY_POINTLIST);
//UINT stride = sizeof(TreeBillboard);
//UINT offset = 0;
//this->texture = resources.get<CTexture>("smoke.png");
renderer->SetPixelTexture(4, this->texture);
renderer->SetPixelTexture(5, this->normals);
//render tiles
for (int i = 0; i < this->tiles_dim*this->tiles_dim; i++)
{
if (this->tiles[i].data.size() == 0)
continue;
//todo, check if visible too
if (cam.BoxInFrustum(AABB(Vec3(tiles[i].x, tiles[i].y, 0), Vec3(tiles[i].x + tile_size, tiles[i].y + tile_size, 20000))) == false)
continue;
//actually render it
dc->IASetVertexBuffers(0, 1, &this->tiles[i].vb.vb, &stride, &offset);
dc->Draw(this->tiles[i].data.size(), 0);
}
renderer->context->GSSetShader(0, 0, 0);
}
#include "../IMaterial.h"
void FoliageRenderer::GenerateImpostors()
{
//todo need to call this on lighting updates
if (this->texture == 0)
{
this->normals = CRenderTexture::Create(2048, 2048, DXGI_FORMAT::DXGI_FORMAT_R8G8B8A8_UNORM, DXGI_FORMAT::DXGI_FORMAT_UNKNOWN, true);
this->texture = CRenderTexture::Create(2048, 2048, DXGI_FORMAT::DXGI_FORMAT_R8G8B8A8_UNORM, DXGI_FORMAT::DXGI_FORMAT_D24_UNORM_S8_UINT, true);
}
else
{
return;
}
//else if (hack++ > 1)
// return;
auto rt = (CRenderTexture*)this->texture;
auto nrt = (CRenderTexture*)this->normals;
CCamera cam;
auto oldrt = renderer->GetRenderTarget(0);
//Set the render targers
ID3D11RenderTargetView* views[2] = { rt->color, nrt->color };
renderer->context->OMSetRenderTargets(2, views, rt->depth);
Viewport old;
renderer->GetViewport(&old);
rt->Clear(0, 0, 0, 0);
nrt->Clear(0, 0, 0, 0);
renderer->EnableAlphaBlending(false);
//todo need to not have to do lighting in this, lets export normals
r.SetAmbient(ambient, ambient);
//cam._matrix = Matrix4::BuildMatrix(Vec3(0, 1, 0), Vec3(0, 0, 1), Vec3(1, 0, 0));//
//cam._matrix = Matrix4::BuildMatrix(Vec3(0, 0, 1), Vec3(1, 0, 0), Vec3(0, 1, 0));
cam._matrix = Matrix4::BuildMatrix(Vec3(0, 0, 1), Vec3(-1, 0, 0), Vec3(0, 1, 0));
if (this->tree_models.size() > 8)
throw 7;
// lets do a quick pass through render system to clean up any junk in lighting and figure out how to delete a material
// also make sure we dont leak directx objects literally everywhere
//render each view
for (size_t m = 0; m < this->tree_models.size(); m++)
{
auto model = this->tree_models[m].model;
for (int i = 0; i < 8; i++)
{
//setup viewport....
Viewport vp;
vp.Height = 256;
vp.Width = 256;
vp.MinZ = 0;
vp.MaxZ = 1;
vp.X = 256 * i;
vp.Y = 256 * m;// 256;
renderer->SetViewport(&vp);
//model.aabb.min = Vec3(model.t->bounds[25].bbmin);// -Vec3(2, 0, 10);
//model.aabb.max = Vec3(model.t->bounds[25].bbmax);// +Vec3(2, 0, -10);
//ok, need to make sure the normals are properly rotated, sometimes it seems this matrix cancels out any change in normals
// need to note that this works the opposite of rotating the camera around the object
// also need to make sure the normals are properly oriented the same as they will be in view space
// todo ok, I need to actually move the camera around the object or else the normals just get rotated, either that or I need to
// skip rotating just the normals;
//model->matrix = Matrix4::RotationMatrixX(-3.1415926535895f / 2.0f)*Matrix4::RotationMatrixY((3.14159265 / 4.0) * ((float)i));// *Matrix4::TranslationMatrix(Vec3(0, 0, -model.aabb.min.z));
Matrix4 matrix = Matrix4::RotationMatrixZ((3.14159265 / 4.0) * ((float)i));// *Matrix4::TranslationMatrix(Vec3(0, 0, -model.aabb.min.z));
auto ii = model;
AABB aabb = ii->aabb;
//aabb.Transform(Matrix4::RotationMatrixX(-3.1415926535895f / 2.0f));
Matrix4 view = cam._matrix;
float objsNear = FLT_MAX, objsFar = -FLT_MAX;
float objsXmin = FLT_MAX;
float objsXmax = -FLT_MAX;
float objsYmin = FLT_MAX;
float objsYmax = -FLT_MAX;
Vec3 boxCorners[6];
boxCorners[0] = view * aabb.max;//Vec3(ii->_position.x, ii->_position.y, ii->_position.z);
boxCorners[1] = view * aabb.min;//Vec3(ii->_position.x, ii->_position.y+16, ii->_position.z);
boxCorners[2] = view * Vec3(aabb.min.x, aabb.max.y, aabb.max.z);//Vec3(_position.x, _position.y, _position.z+16);
boxCorners[3] = view * Vec3(aabb.min.x, aabb.min.y, aabb.max.z);//Vec3(_position.x+16, _position.y, _position.z+16);
boxCorners[4] = view * Vec3(aabb.max.x, aabb.min.y, aabb.max.z);//Vec3(_position.x+16, _position.y+16, _position.z+16);
boxCorners[5] = view * Vec3(aabb.min.x, aabb.max.y, aabb.min.z);//Vec3(ii->_position.x+16, ii->_position.y, ii->_position.z);
//TransformArray(boxCorners, _countof(boxCorners), view);
for (unsigned int corner_i = 0; corner_i < 6; corner_i++)
{
if (boxCorners[corner_i].z < objsNear) objsNear = boxCorners[corner_i].z;
if (boxCorners[corner_i].z > objsFar) objsFar = boxCorners[corner_i].z;
if (boxCorners[corner_i].x < objsXmin) objsXmin = boxCorners[corner_i].x;
if (boxCorners[corner_i].x > objsXmax) objsXmax = boxCorners[corner_i].x;
if (boxCorners[corner_i].y < objsYmin) objsYmin = boxCorners[corner_i].y;
if (boxCorners[corner_i].y > objsYmax) objsYmax = boxCorners[corner_i].y;
}
cam._projectionMatrix = Matrix4::OrthographicOffCenterLHMatrix(
objsXmin,// left
objsXmax,// right
objsYmin,// bottom
objsYmax,// top
objsNear,// near
objsFar).Transpose();// far
model->color = 0xFFFFFFFF;
IMaterial* mats[20];
//need to temporarily replace all the materials with ones with the right shaders
for (int i = 0; i < model->data->num_meshes; i++)
{
mats[i] = model->mesh_materials[i];
if (this->tree_models[m].impostor_mats[i])
{
model->mesh_materials[i] = this->tree_models[m].impostor_mats[i];
}
else
{
IMaterial* mat = new IMaterial((std::string(mats[i]->name) + "_raw").c_str(), mats[i]);
model->mesh_materials[i] = mat;
model->mesh_materials[i]->SetDefine("RAW_OUTPUT", "true");
model->mesh_materials[i]->SetDefine("IMPOSTOR", "true");
this->tree_models[m].impostor_mats[i] = mat;
mat->Update(renderer);
}
}
r.Render(&cam, model, &matrix);
for (int i = 0; i < model->data->num_meshes; i++)
{
//model->mesh_materials[i]->Release();
//IMaterial::GetList().erase(IMaterial::GetList().find(model->mesh_materials[i]->name));
//delete model->mesh_materials[i];
model->mesh_materials[i] = mats[i];
}
}
}
renderer->SetRenderTarget(0, &oldrt);
renderer->SetViewport(&old);
// Generate mipmaps for the trees
renderer->context->GenerateMips(this->normals->texture_rv);
renderer->context->GenerateMips(this->texture->texture_rv);
} | [
"space-explorer@hotmail.com"
] | space-explorer@hotmail.com |
7d38f1967c842c06f907e0d57d9c817c96480de8 | 42cfc9395a6b27a9e0d24d6f00e71cc60b0b2496 | /Tech report/Code/ros_catkin_ws/src/cvpr-ros-pkg/rgbd_benchmark/cortex_stream/src/cortex_fake_stream.cpp | 6ebff06067b211631d6fdbce6fd0ccb14c2ccdd2 | [] | no_license | michielaernouts/MAP-Portfolio | 947f4419697fc8847831b07e1850bd341f7ec285 | 877f0f4eeaeecc011511b36fed54a6844a274431 | refs/heads/master | 2021-01-21T19:44:09.024141 | 2017-05-26T08:35:20 | 2017-05-26T08:35:20 | 92,153,014 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,423 | cpp | #include <ros/ros.h>
#include <cortex_stream/cortex.h>
#include <map>
#include <visualization_msgs/Marker.h>
#include <visualization_msgs/MarkerArray.h>
#include <geometry_msgs/Pose.h>
#include <geometry_msgs/Vector3.h>
//#include <boost/thread.hpp>
#include <boost/lexical_cast.hpp>
#include <cmath>
#include <time.h>
using namespace std;
using namespace visualization_msgs;
visualization_msgs::MarkerArray markerArrayMsg;
void populate_marker_msg()
{
// define 4 props
Marker freespace;
Marker nao;
Marker box_obstacle_1;
Marker box_obstacle_2;
geometry_msgs::Point p;
p.x = -0.5; p.y = -0.75; p.z = 1.1;
freespace.points.push_back(p);
p.x = 4.5; p.y = -0.7; p.z = 0.8;
freespace.points.push_back(p);
p.x = 4.4; p.y = 3.3; p.z = 1.1;
freespace.points.push_back(p);
p.x = -0.45; p.y = 3.4; p.z = 1.0;
freespace.points.push_back(p);
geometry_msgs::Point box_origin;
double box_size_x = 0.4;
double box_size_y = 0.2;
double box_size_z = 0.2;
double box_rotation = 1.0; // rad
static double offset_x = 0.0;
static double offset_y = 0.0;
box_origin.x = 2.5 + offset_x; box_origin.y = 0.5 + offset_y ; box_origin.z = box_size_z;
//offset_x += 0.002;
//offset_y += 0.002;
offset_x += (rand()%100 - 50)/2000.0; // uniform in range
offset_y += (rand()%100 - 50)/2000.0; // uniform in range of [0.025, 0.025]m
box_obstacle_1.points.push_back(box_origin);
p.x = box_origin.x + box_size_x; p.y = box_origin.y; p.z = box_origin.z - 0.03;
box_obstacle_1.points.push_back(p);
p.y += box_size_y; p.z += 0.02;
box_obstacle_1.points.push_back(p);
p.x -= box_size_x; p.z -= 0.01;
box_obstacle_1.points.push_back(p);
static int drop_out_counter = 0;
static bool drop_out = false;
if( drop_out_counter % 50 == 0) // flip
{
drop_out = !drop_out;
}
box_origin.x = 2.0 + offset_y; box_origin.y = 1.0 + offset_x; box_origin.z = box_size_z;
box_obstacle_2.points.push_back(box_origin);
p.x = box_origin.x + box_size_x; p.y = box_origin.y; p.z = box_origin.z - 0.03;
box_obstacle_2.points.push_back(p);
p.y += box_size_y; p.z += 0.02;
box_obstacle_2.points.push_back(p);
p.x -= box_size_x; p.z -= 0.01;
if(!drop_out)
box_obstacle_2.points.push_back(p);
drop_out_counter ++;
markerArrayMsg.markers.clear();
vector<string> object_names;
markerArrayMsg.markers.push_back(freespace);
object_names.push_back("map_free_space_boundings");
//markerArrayMsg.markers.push_back(nao);
markerArrayMsg.markers.push_back(box_obstacle_1);
object_names.push_back("box_obstacle_3");
markerArrayMsg.markers.push_back(box_obstacle_2);
object_names.push_back("box_obstacle_4");
int cnt = 0; // TODO: randomize this
double scale_fac = 0.1;
for(MarkerArray::_markers_type::iterator it = markerArrayMsg.markers.begin(); it!=markerArrayMsg.markers.end(); ++it, ++cnt)
{
visualization_msgs::Marker & markerMsg = *it;
markerMsg.type = visualization_msgs::Marker::SPHERE_LIST;
markerMsg.header.frame_id = "/mocap";
markerMsg.action = visualization_msgs::Marker::ADD;
// stamp is missing
markerMsg.id = cnt;
markerMsg.ns = object_names[cnt];
markerMsg.color.r = 1.0;
markerMsg.color.g = 0.0;
markerMsg.color.b = 0.0;
markerMsg.color.a = 1.0;
markerMsg.scale.x = scale_fac;
markerMsg.scale.y = scale_fac;
markerMsg.scale.z = scale_fac;
geometry_msgs::Pose pose;
pose.position.x = 0;
pose.position.y = 0;
pose.position.z = 0;
}
}
int main(int argc, char ** argv)
{
ros::init(argc,argv,"cortex_fake_stream");
ros::NodeHandle nh;
ros::Rate r(20.0);
srand ( time(NULL) );
ros::Publisher marker_pub = nh.advertise<visualization_msgs::MarkerArray>( "cortex_marker_array", 0 );
while(ros::ok())
{
populate_marker_msg();
r.sleep();
ros::Time timestamp = ros::Time::now()-ros::Duration(0.1);
int cnt = 0;
for(MarkerArray::_markers_type::iterator it = markerArrayMsg.markers.begin(); it!=markerArrayMsg.markers.end(); ++it )
{
visualization_msgs::Marker & markerMsg = *it;
markerMsg.header.stamp = timestamp;
++cnt;
}
ROS_INFO("Publishing %d markers",cnt);
marker_pub.publish(markerArrayMsg);
ros::spinOnce();
}
ROS_INFO("Exit peacefully");
return 0;
}
| [
"michiel.aernouts@student.uantwerpen.be"
] | michiel.aernouts@student.uantwerpen.be |
c0cc7f15b7956ee9bd41287f90b68fe6c88c3916 | e008b9b43818bd5854516f9d0634da2a65997e27 | /Linux/TCPIP/socket/advanced_io/zero_copy/bigfile_send_server.cpp | 3abce829a9ba3b62490fe41c2874896f4032c8e9 | [] | no_license | Sockke/MyData | 99a8875aff4d0c85e83c1643a435417785506c6b | ac4f78fb8418ab117a4be52d8a27941ed3972209 | refs/heads/master | 2023-06-21T13:08:18.778010 | 2021-08-07T15:36:34 | 2021-08-07T15:36:34 | 260,892,331 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,063 | cpp | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <sys/sendfile.h>
#include "../tcpsocket.h"
/*
* 通过sendfile, 在网络中实现高效的大文件传输
* 1. sendfile是零拷贝技术, 在内核中实现socket与本地文件的数据拷贝
* 不需要用户态与内核态之间的数据拷贝, 大大提高了性能
*
* */
int main(int argc, char* argv[]) {
if (argc != 4) {
perror("format: ./server ip port filename");
return 1;
}
const char* ip = argv[1];
unsigned short port = atoi(argv[2]);
int l_sock = t_socket();
t_bind(l_sock, ip, port);
t_listen(l_sock, 5);
int c_sock = t_accept(l_sock);
if (c_sock < 0) {
printf("errno is %d\n", c_sock);
} else {
const char* filename = argv[3];
struct stat file_stat;
if (stat(filename, &file_stat) < 0) {
printf("no such file named %s\n", filename);
} else {
int fd = open(filename, O_RDONLY);
sendfile(c_sock, fd, nullptr, file_stat.st_size);
}
}
close(c_sock);
}
| [
"1109008311@qq.com"
] | 1109008311@qq.com |
27e02a833c9ee3ac54e49aa82d92d404e90cf0f5 | 28bb681d8d3043a798ac72c09ed64f24a2ba0824 | /protobuf/protobuf.pb.h | f98d0d8b76184abd11ff665bb0c25e14002907d5 | [] | no_license | AndreevSemen/cluster-researches | 66a7ff66a8ce1686d978c48470a4128526ffaa71 | cd7bc09cb14be5a41dab6effbb2ffcf91d7105d6 | refs/heads/master | 2022-12-08T04:39:41.446541 | 2020-09-02T20:02:59 | 2020-09-02T20:02:59 | 200,610,518 | 0 | 0 | null | 2019-08-20T06:45:08 | 2019-08-05T08:02:45 | null | UTF-8 | C++ | false | true | 48,837 | h | // Generated by the protocol buffer compiler. DO NOT EDIT!
// source: protobuf.proto
#ifndef PROTOBUF_protobuf_2eproto__INCLUDED
#define PROTOBUF_protobuf_2eproto__INCLUDED
#include <string>
#include <google/protobuf/stubs/common.h>
#if GOOGLE_PROTOBUF_VERSION < 3005000
#error This file was generated by a newer version of protoc which is
#error incompatible with your Protocol Buffer headers. Please update
#error your headers.
#endif
#if 3005001 < GOOGLE_PROTOBUF_MIN_PROTOC_VERSION
#error This file was generated by an older version of protoc which is
#error incompatible with your Protocol Buffer headers. Please
#error regenerate this file with a newer version of protoc.
#endif
#include <google/protobuf/io/coded_stream.h>
#include <google/protobuf/arena.h>
#include <google/protobuf/arenastring.h>
#include <google/protobuf/generated_message_table_driven.h>
#include <google/protobuf/generated_message_util.h>
#include <google/protobuf/metadata.h>
#include <google/protobuf/message.h>
#include <google/protobuf/repeated_field.h> // IWYU pragma: export
#include <google/protobuf/extension_set.h> // IWYU pragma: export
#include <google/protobuf/generated_enum_reflection.h>
#include <google/protobuf/unknown_field_set.h>
// @@protoc_insertion_point(includes)
namespace protobuf_protobuf_2eproto {
// Internal implementation detail -- do not use these members.
struct TableStruct {
static const ::google::protobuf::internal::ParseTableField entries[];
static const ::google::protobuf::internal::AuxillaryParseTableField aux[];
static const ::google::protobuf::internal::ParseTable schema[6];
static const ::google::protobuf::internal::FieldMetadata field_metadata[];
static const ::google::protobuf::internal::SerializationTable serialization_table[];
static const ::google::protobuf::uint32 offsets[];
};
void AddDescriptors();
void InitDefaultsMemberAddrImpl();
void InitDefaultsMemberAddr();
void InitDefaultsTimeStampImpl();
void InitDefaultsTimeStamp();
void InitDefaultsMemberInfoImpl();
void InitDefaultsMemberInfo();
void InitDefaultsMemberImpl();
void InitDefaultsMember();
void InitDefaultsTableImpl();
void InitDefaultsTable();
void InitDefaultsGossipImpl();
void InitDefaultsGossip();
inline void InitDefaults() {
InitDefaultsMemberAddr();
InitDefaultsTimeStamp();
InitDefaultsMemberInfo();
InitDefaultsMember();
InitDefaultsTable();
InitDefaultsGossip();
}
} // namespace protobuf_protobuf_2eproto
namespace Proto {
class Gossip;
class GossipDefaultTypeInternal;
extern GossipDefaultTypeInternal _Gossip_default_instance_;
class Member;
class MemberDefaultTypeInternal;
extern MemberDefaultTypeInternal _Member_default_instance_;
class MemberAddr;
class MemberAddrDefaultTypeInternal;
extern MemberAddrDefaultTypeInternal _MemberAddr_default_instance_;
class MemberInfo;
class MemberInfoDefaultTypeInternal;
extern MemberInfoDefaultTypeInternal _MemberInfo_default_instance_;
class Table;
class TableDefaultTypeInternal;
extern TableDefaultTypeInternal _Table_default_instance_;
class TimeStamp;
class TimeStampDefaultTypeInternal;
extern TimeStampDefaultTypeInternal _TimeStamp_default_instance_;
} // namespace Proto
namespace Proto {
enum MemberInfo_State {
MemberInfo_State_ALIVE = 0,
MemberInfo_State_SUSPICIOUS = 1,
MemberInfo_State_DEAD = 2
};
bool MemberInfo_State_IsValid(int value);
const MemberInfo_State MemberInfo_State_State_MIN = MemberInfo_State_ALIVE;
const MemberInfo_State MemberInfo_State_State_MAX = MemberInfo_State_DEAD;
const int MemberInfo_State_State_ARRAYSIZE = MemberInfo_State_State_MAX + 1;
const ::google::protobuf::EnumDescriptor* MemberInfo_State_descriptor();
inline const ::std::string& MemberInfo_State_Name(MemberInfo_State value) {
return ::google::protobuf::internal::NameOfEnum(
MemberInfo_State_descriptor(), value);
}
inline bool MemberInfo_State_Parse(
const ::std::string& name, MemberInfo_State* value) {
return ::google::protobuf::internal::ParseNamedEnum<MemberInfo_State>(
MemberInfo_State_descriptor(), name, value);
}
enum Gossip_MessageType {
Gossip_MessageType_Ping = 0,
Gossip_MessageType_Ack = 1
};
bool Gossip_MessageType_IsValid(int value);
const Gossip_MessageType Gossip_MessageType_MessageType_MIN = Gossip_MessageType_Ping;
const Gossip_MessageType Gossip_MessageType_MessageType_MAX = Gossip_MessageType_Ack;
const int Gossip_MessageType_MessageType_ARRAYSIZE = Gossip_MessageType_MessageType_MAX + 1;
const ::google::protobuf::EnumDescriptor* Gossip_MessageType_descriptor();
inline const ::std::string& Gossip_MessageType_Name(Gossip_MessageType value) {
return ::google::protobuf::internal::NameOfEnum(
Gossip_MessageType_descriptor(), value);
}
inline bool Gossip_MessageType_Parse(
const ::std::string& name, Gossip_MessageType* value) {
return ::google::protobuf::internal::ParseNamedEnum<Gossip_MessageType>(
Gossip_MessageType_descriptor(), name, value);
}
// ===================================================================
class MemberAddr : public ::google::protobuf::Message /* @@protoc_insertion_point(class_definition:Proto.MemberAddr) */ {
public:
MemberAddr();
virtual ~MemberAddr();
MemberAddr(const MemberAddr& from);
inline MemberAddr& operator=(const MemberAddr& from) {
CopyFrom(from);
return *this;
}
#if LANG_CXX11
MemberAddr(MemberAddr&& from) noexcept
: MemberAddr() {
*this = ::std::move(from);
}
inline MemberAddr& operator=(MemberAddr&& from) noexcept {
if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) {
if (this != &from) InternalSwap(&from);
} else {
CopyFrom(from);
}
return *this;
}
#endif
inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
return _internal_metadata_.unknown_fields();
}
inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
return _internal_metadata_.mutable_unknown_fields();
}
static const ::google::protobuf::Descriptor* descriptor();
static const MemberAddr& default_instance();
static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY
static inline const MemberAddr* internal_default_instance() {
return reinterpret_cast<const MemberAddr*>(
&_MemberAddr_default_instance_);
}
static PROTOBUF_CONSTEXPR int const kIndexInFileMessages =
0;
void Swap(MemberAddr* other);
friend void swap(MemberAddr& a, MemberAddr& b) {
a.Swap(&b);
}
// implements Message ----------------------------------------------
inline MemberAddr* New() const PROTOBUF_FINAL { return New(NULL); }
MemberAddr* New(::google::protobuf::Arena* arena) const PROTOBUF_FINAL;
void CopyFrom(const ::google::protobuf::Message& from) PROTOBUF_FINAL;
void MergeFrom(const ::google::protobuf::Message& from) PROTOBUF_FINAL;
void CopyFrom(const MemberAddr& from);
void MergeFrom(const MemberAddr& from);
void Clear() PROTOBUF_FINAL;
bool IsInitialized() const PROTOBUF_FINAL;
size_t ByteSizeLong() const PROTOBUF_FINAL;
bool MergePartialFromCodedStream(
::google::protobuf::io::CodedInputStream* input) PROTOBUF_FINAL;
void SerializeWithCachedSizes(
::google::protobuf::io::CodedOutputStream* output) const PROTOBUF_FINAL;
::google::protobuf::uint8* InternalSerializeWithCachedSizesToArray(
bool deterministic, ::google::protobuf::uint8* target) const PROTOBUF_FINAL;
int GetCachedSize() const PROTOBUF_FINAL { return _cached_size_; }
private:
void SharedCtor();
void SharedDtor();
void SetCachedSize(int size) const PROTOBUF_FINAL;
void InternalSwap(MemberAddr* other);
private:
inline ::google::protobuf::Arena* GetArenaNoVirtual() const {
return NULL;
}
inline void* MaybeArenaPtr() const {
return NULL;
}
public:
::google::protobuf::Metadata GetMetadata() const PROTOBUF_FINAL;
// nested types ----------------------------------------------------
// accessors -------------------------------------------------------
// required uint32 IP = 1;
bool has_ip() const;
void clear_ip();
static const int kIPFieldNumber = 1;
::google::protobuf::uint32 ip() const;
void set_ip(::google::protobuf::uint32 value);
// required uint32 port = 2;
bool has_port() const;
void clear_port();
static const int kPortFieldNumber = 2;
::google::protobuf::uint32 port() const;
void set_port(::google::protobuf::uint32 value);
// @@protoc_insertion_point(class_scope:Proto.MemberAddr)
private:
void set_has_ip();
void clear_has_ip();
void set_has_port();
void clear_has_port();
// helper for ByteSizeLong()
size_t RequiredFieldsByteSizeFallback() const;
::google::protobuf::internal::InternalMetadataWithArena _internal_metadata_;
::google::protobuf::internal::HasBits<1> _has_bits_;
mutable int _cached_size_;
::google::protobuf::uint32 ip_;
::google::protobuf::uint32 port_;
friend struct ::protobuf_protobuf_2eproto::TableStruct;
friend void ::protobuf_protobuf_2eproto::InitDefaultsMemberAddrImpl();
};
// -------------------------------------------------------------------
class TimeStamp : public ::google::protobuf::Message /* @@protoc_insertion_point(class_definition:Proto.TimeStamp) */ {
public:
TimeStamp();
virtual ~TimeStamp();
TimeStamp(const TimeStamp& from);
inline TimeStamp& operator=(const TimeStamp& from) {
CopyFrom(from);
return *this;
}
#if LANG_CXX11
TimeStamp(TimeStamp&& from) noexcept
: TimeStamp() {
*this = ::std::move(from);
}
inline TimeStamp& operator=(TimeStamp&& from) noexcept {
if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) {
if (this != &from) InternalSwap(&from);
} else {
CopyFrom(from);
}
return *this;
}
#endif
inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
return _internal_metadata_.unknown_fields();
}
inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
return _internal_metadata_.mutable_unknown_fields();
}
static const ::google::protobuf::Descriptor* descriptor();
static const TimeStamp& default_instance();
static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY
static inline const TimeStamp* internal_default_instance() {
return reinterpret_cast<const TimeStamp*>(
&_TimeStamp_default_instance_);
}
static PROTOBUF_CONSTEXPR int const kIndexInFileMessages =
1;
void Swap(TimeStamp* other);
friend void swap(TimeStamp& a, TimeStamp& b) {
a.Swap(&b);
}
// implements Message ----------------------------------------------
inline TimeStamp* New() const PROTOBUF_FINAL { return New(NULL); }
TimeStamp* New(::google::protobuf::Arena* arena) const PROTOBUF_FINAL;
void CopyFrom(const ::google::protobuf::Message& from) PROTOBUF_FINAL;
void MergeFrom(const ::google::protobuf::Message& from) PROTOBUF_FINAL;
void CopyFrom(const TimeStamp& from);
void MergeFrom(const TimeStamp& from);
void Clear() PROTOBUF_FINAL;
bool IsInitialized() const PROTOBUF_FINAL;
size_t ByteSizeLong() const PROTOBUF_FINAL;
bool MergePartialFromCodedStream(
::google::protobuf::io::CodedInputStream* input) PROTOBUF_FINAL;
void SerializeWithCachedSizes(
::google::protobuf::io::CodedOutputStream* output) const PROTOBUF_FINAL;
::google::protobuf::uint8* InternalSerializeWithCachedSizesToArray(
bool deterministic, ::google::protobuf::uint8* target) const PROTOBUF_FINAL;
int GetCachedSize() const PROTOBUF_FINAL { return _cached_size_; }
private:
void SharedCtor();
void SharedDtor();
void SetCachedSize(int size) const PROTOBUF_FINAL;
void InternalSwap(TimeStamp* other);
private:
inline ::google::protobuf::Arena* GetArenaNoVirtual() const {
return NULL;
}
inline void* MaybeArenaPtr() const {
return NULL;
}
public:
::google::protobuf::Metadata GetMetadata() const PROTOBUF_FINAL;
// nested types ----------------------------------------------------
// accessors -------------------------------------------------------
// required int64 time = 1;
bool has_time() const;
void clear_time();
static const int kTimeFieldNumber = 1;
::google::protobuf::int64 time() const;
void set_time(::google::protobuf::int64 value);
// @@protoc_insertion_point(class_scope:Proto.TimeStamp)
private:
void set_has_time();
void clear_has_time();
::google::protobuf::internal::InternalMetadataWithArena _internal_metadata_;
::google::protobuf::internal::HasBits<1> _has_bits_;
mutable int _cached_size_;
::google::protobuf::int64 time_;
friend struct ::protobuf_protobuf_2eproto::TableStruct;
friend void ::protobuf_protobuf_2eproto::InitDefaultsTimeStampImpl();
};
// -------------------------------------------------------------------
class MemberInfo : public ::google::protobuf::Message /* @@protoc_insertion_point(class_definition:Proto.MemberInfo) */ {
public:
MemberInfo();
virtual ~MemberInfo();
MemberInfo(const MemberInfo& from);
inline MemberInfo& operator=(const MemberInfo& from) {
CopyFrom(from);
return *this;
}
#if LANG_CXX11
MemberInfo(MemberInfo&& from) noexcept
: MemberInfo() {
*this = ::std::move(from);
}
inline MemberInfo& operator=(MemberInfo&& from) noexcept {
if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) {
if (this != &from) InternalSwap(&from);
} else {
CopyFrom(from);
}
return *this;
}
#endif
inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
return _internal_metadata_.unknown_fields();
}
inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
return _internal_metadata_.mutable_unknown_fields();
}
static const ::google::protobuf::Descriptor* descriptor();
static const MemberInfo& default_instance();
static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY
static inline const MemberInfo* internal_default_instance() {
return reinterpret_cast<const MemberInfo*>(
&_MemberInfo_default_instance_);
}
static PROTOBUF_CONSTEXPR int const kIndexInFileMessages =
2;
void Swap(MemberInfo* other);
friend void swap(MemberInfo& a, MemberInfo& b) {
a.Swap(&b);
}
// implements Message ----------------------------------------------
inline MemberInfo* New() const PROTOBUF_FINAL { return New(NULL); }
MemberInfo* New(::google::protobuf::Arena* arena) const PROTOBUF_FINAL;
void CopyFrom(const ::google::protobuf::Message& from) PROTOBUF_FINAL;
void MergeFrom(const ::google::protobuf::Message& from) PROTOBUF_FINAL;
void CopyFrom(const MemberInfo& from);
void MergeFrom(const MemberInfo& from);
void Clear() PROTOBUF_FINAL;
bool IsInitialized() const PROTOBUF_FINAL;
size_t ByteSizeLong() const PROTOBUF_FINAL;
bool MergePartialFromCodedStream(
::google::protobuf::io::CodedInputStream* input) PROTOBUF_FINAL;
void SerializeWithCachedSizes(
::google::protobuf::io::CodedOutputStream* output) const PROTOBUF_FINAL;
::google::protobuf::uint8* InternalSerializeWithCachedSizesToArray(
bool deterministic, ::google::protobuf::uint8* target) const PROTOBUF_FINAL;
int GetCachedSize() const PROTOBUF_FINAL { return _cached_size_; }
private:
void SharedCtor();
void SharedDtor();
void SetCachedSize(int size) const PROTOBUF_FINAL;
void InternalSwap(MemberInfo* other);
private:
inline ::google::protobuf::Arena* GetArenaNoVirtual() const {
return NULL;
}
inline void* MaybeArenaPtr() const {
return NULL;
}
public:
::google::protobuf::Metadata GetMetadata() const PROTOBUF_FINAL;
// nested types ----------------------------------------------------
typedef MemberInfo_State State;
static const State ALIVE =
MemberInfo_State_ALIVE;
static const State SUSPICIOUS =
MemberInfo_State_SUSPICIOUS;
static const State DEAD =
MemberInfo_State_DEAD;
static inline bool State_IsValid(int value) {
return MemberInfo_State_IsValid(value);
}
static const State State_MIN =
MemberInfo_State_State_MIN;
static const State State_MAX =
MemberInfo_State_State_MAX;
static const int State_ARRAYSIZE =
MemberInfo_State_State_ARRAYSIZE;
static inline const ::google::protobuf::EnumDescriptor*
State_descriptor() {
return MemberInfo_State_descriptor();
}
static inline const ::std::string& State_Name(State value) {
return MemberInfo_State_Name(value);
}
static inline bool State_Parse(const ::std::string& name,
State* value) {
return MemberInfo_State_Parse(name, value);
}
// accessors -------------------------------------------------------
// required .Proto.TimeStamp time_stamp = 3;
bool has_time_stamp() const;
void clear_time_stamp();
static const int kTimeStampFieldNumber = 3;
const ::Proto::TimeStamp& time_stamp() const;
::Proto::TimeStamp* release_time_stamp();
::Proto::TimeStamp* mutable_time_stamp();
void set_allocated_time_stamp(::Proto::TimeStamp* time_stamp);
// required .Proto.MemberInfo.State status = 1;
bool has_status() const;
void clear_status();
static const int kStatusFieldNumber = 1;
::Proto::MemberInfo_State status() const;
void set_status(::Proto::MemberInfo_State value);
// required uint32 incarnation = 2;
bool has_incarnation() const;
void clear_incarnation();
static const int kIncarnationFieldNumber = 2;
::google::protobuf::uint32 incarnation() const;
void set_incarnation(::google::protobuf::uint32 value);
// @@protoc_insertion_point(class_scope:Proto.MemberInfo)
private:
void set_has_status();
void clear_has_status();
void set_has_incarnation();
void clear_has_incarnation();
void set_has_time_stamp();
void clear_has_time_stamp();
// helper for ByteSizeLong()
size_t RequiredFieldsByteSizeFallback() const;
::google::protobuf::internal::InternalMetadataWithArena _internal_metadata_;
::google::protobuf::internal::HasBits<1> _has_bits_;
mutable int _cached_size_;
::Proto::TimeStamp* time_stamp_;
int status_;
::google::protobuf::uint32 incarnation_;
friend struct ::protobuf_protobuf_2eproto::TableStruct;
friend void ::protobuf_protobuf_2eproto::InitDefaultsMemberInfoImpl();
};
// -------------------------------------------------------------------
class Member : public ::google::protobuf::Message /* @@protoc_insertion_point(class_definition:Proto.Member) */ {
public:
Member();
virtual ~Member();
Member(const Member& from);
inline Member& operator=(const Member& from) {
CopyFrom(from);
return *this;
}
#if LANG_CXX11
Member(Member&& from) noexcept
: Member() {
*this = ::std::move(from);
}
inline Member& operator=(Member&& from) noexcept {
if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) {
if (this != &from) InternalSwap(&from);
} else {
CopyFrom(from);
}
return *this;
}
#endif
inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
return _internal_metadata_.unknown_fields();
}
inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
return _internal_metadata_.mutable_unknown_fields();
}
static const ::google::protobuf::Descriptor* descriptor();
static const Member& default_instance();
static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY
static inline const Member* internal_default_instance() {
return reinterpret_cast<const Member*>(
&_Member_default_instance_);
}
static PROTOBUF_CONSTEXPR int const kIndexInFileMessages =
3;
void Swap(Member* other);
friend void swap(Member& a, Member& b) {
a.Swap(&b);
}
// implements Message ----------------------------------------------
inline Member* New() const PROTOBUF_FINAL { return New(NULL); }
Member* New(::google::protobuf::Arena* arena) const PROTOBUF_FINAL;
void CopyFrom(const ::google::protobuf::Message& from) PROTOBUF_FINAL;
void MergeFrom(const ::google::protobuf::Message& from) PROTOBUF_FINAL;
void CopyFrom(const Member& from);
void MergeFrom(const Member& from);
void Clear() PROTOBUF_FINAL;
bool IsInitialized() const PROTOBUF_FINAL;
size_t ByteSizeLong() const PROTOBUF_FINAL;
bool MergePartialFromCodedStream(
::google::protobuf::io::CodedInputStream* input) PROTOBUF_FINAL;
void SerializeWithCachedSizes(
::google::protobuf::io::CodedOutputStream* output) const PROTOBUF_FINAL;
::google::protobuf::uint8* InternalSerializeWithCachedSizesToArray(
bool deterministic, ::google::protobuf::uint8* target) const PROTOBUF_FINAL;
int GetCachedSize() const PROTOBUF_FINAL { return _cached_size_; }
private:
void SharedCtor();
void SharedDtor();
void SetCachedSize(int size) const PROTOBUF_FINAL;
void InternalSwap(Member* other);
private:
inline ::google::protobuf::Arena* GetArenaNoVirtual() const {
return NULL;
}
inline void* MaybeArenaPtr() const {
return NULL;
}
public:
::google::protobuf::Metadata GetMetadata() const PROTOBUF_FINAL;
// nested types ----------------------------------------------------
// accessors -------------------------------------------------------
// required .Proto.MemberAddr addr = 1;
bool has_addr() const;
void clear_addr();
static const int kAddrFieldNumber = 1;
const ::Proto::MemberAddr& addr() const;
::Proto::MemberAddr* release_addr();
::Proto::MemberAddr* mutable_addr();
void set_allocated_addr(::Proto::MemberAddr* addr);
// required .Proto.MemberInfo info = 2;
bool has_info() const;
void clear_info();
static const int kInfoFieldNumber = 2;
const ::Proto::MemberInfo& info() const;
::Proto::MemberInfo* release_info();
::Proto::MemberInfo* mutable_info();
void set_allocated_info(::Proto::MemberInfo* info);
// @@protoc_insertion_point(class_scope:Proto.Member)
private:
void set_has_addr();
void clear_has_addr();
void set_has_info();
void clear_has_info();
// helper for ByteSizeLong()
size_t RequiredFieldsByteSizeFallback() const;
::google::protobuf::internal::InternalMetadataWithArena _internal_metadata_;
::google::protobuf::internal::HasBits<1> _has_bits_;
mutable int _cached_size_;
::Proto::MemberAddr* addr_;
::Proto::MemberInfo* info_;
friend struct ::protobuf_protobuf_2eproto::TableStruct;
friend void ::protobuf_protobuf_2eproto::InitDefaultsMemberImpl();
};
// -------------------------------------------------------------------
class Table : public ::google::protobuf::Message /* @@protoc_insertion_point(class_definition:Proto.Table) */ {
public:
Table();
virtual ~Table();
Table(const Table& from);
inline Table& operator=(const Table& from) {
CopyFrom(from);
return *this;
}
#if LANG_CXX11
Table(Table&& from) noexcept
: Table() {
*this = ::std::move(from);
}
inline Table& operator=(Table&& from) noexcept {
if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) {
if (this != &from) InternalSwap(&from);
} else {
CopyFrom(from);
}
return *this;
}
#endif
inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
return _internal_metadata_.unknown_fields();
}
inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
return _internal_metadata_.mutable_unknown_fields();
}
static const ::google::protobuf::Descriptor* descriptor();
static const Table& default_instance();
static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY
static inline const Table* internal_default_instance() {
return reinterpret_cast<const Table*>(
&_Table_default_instance_);
}
static PROTOBUF_CONSTEXPR int const kIndexInFileMessages =
4;
void Swap(Table* other);
friend void swap(Table& a, Table& b) {
a.Swap(&b);
}
// implements Message ----------------------------------------------
inline Table* New() const PROTOBUF_FINAL { return New(NULL); }
Table* New(::google::protobuf::Arena* arena) const PROTOBUF_FINAL;
void CopyFrom(const ::google::protobuf::Message& from) PROTOBUF_FINAL;
void MergeFrom(const ::google::protobuf::Message& from) PROTOBUF_FINAL;
void CopyFrom(const Table& from);
void MergeFrom(const Table& from);
void Clear() PROTOBUF_FINAL;
bool IsInitialized() const PROTOBUF_FINAL;
size_t ByteSizeLong() const PROTOBUF_FINAL;
bool MergePartialFromCodedStream(
::google::protobuf::io::CodedInputStream* input) PROTOBUF_FINAL;
void SerializeWithCachedSizes(
::google::protobuf::io::CodedOutputStream* output) const PROTOBUF_FINAL;
::google::protobuf::uint8* InternalSerializeWithCachedSizesToArray(
bool deterministic, ::google::protobuf::uint8* target) const PROTOBUF_FINAL;
int GetCachedSize() const PROTOBUF_FINAL { return _cached_size_; }
private:
void SharedCtor();
void SharedDtor();
void SetCachedSize(int size) const PROTOBUF_FINAL;
void InternalSwap(Table* other);
private:
inline ::google::protobuf::Arena* GetArenaNoVirtual() const {
return NULL;
}
inline void* MaybeArenaPtr() const {
return NULL;
}
public:
::google::protobuf::Metadata GetMetadata() const PROTOBUF_FINAL;
// nested types ----------------------------------------------------
// accessors -------------------------------------------------------
// repeated .Proto.Member table = 1;
int table_size() const;
void clear_table();
static const int kTableFieldNumber = 1;
const ::Proto::Member& table(int index) const;
::Proto::Member* mutable_table(int index);
::Proto::Member* add_table();
::google::protobuf::RepeatedPtrField< ::Proto::Member >*
mutable_table();
const ::google::protobuf::RepeatedPtrField< ::Proto::Member >&
table() const;
// @@protoc_insertion_point(class_scope:Proto.Table)
private:
::google::protobuf::internal::InternalMetadataWithArena _internal_metadata_;
::google::protobuf::internal::HasBits<1> _has_bits_;
mutable int _cached_size_;
::google::protobuf::RepeatedPtrField< ::Proto::Member > table_;
friend struct ::protobuf_protobuf_2eproto::TableStruct;
friend void ::protobuf_protobuf_2eproto::InitDefaultsTableImpl();
};
// -------------------------------------------------------------------
class Gossip : public ::google::protobuf::Message /* @@protoc_insertion_point(class_definition:Proto.Gossip) */ {
public:
Gossip();
virtual ~Gossip();
Gossip(const Gossip& from);
inline Gossip& operator=(const Gossip& from) {
CopyFrom(from);
return *this;
}
#if LANG_CXX11
Gossip(Gossip&& from) noexcept
: Gossip() {
*this = ::std::move(from);
}
inline Gossip& operator=(Gossip&& from) noexcept {
if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) {
if (this != &from) InternalSwap(&from);
} else {
CopyFrom(from);
}
return *this;
}
#endif
inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
return _internal_metadata_.unknown_fields();
}
inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
return _internal_metadata_.mutable_unknown_fields();
}
static const ::google::protobuf::Descriptor* descriptor();
static const Gossip& default_instance();
static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY
static inline const Gossip* internal_default_instance() {
return reinterpret_cast<const Gossip*>(
&_Gossip_default_instance_);
}
static PROTOBUF_CONSTEXPR int const kIndexInFileMessages =
5;
void Swap(Gossip* other);
friend void swap(Gossip& a, Gossip& b) {
a.Swap(&b);
}
// implements Message ----------------------------------------------
inline Gossip* New() const PROTOBUF_FINAL { return New(NULL); }
Gossip* New(::google::protobuf::Arena* arena) const PROTOBUF_FINAL;
void CopyFrom(const ::google::protobuf::Message& from) PROTOBUF_FINAL;
void MergeFrom(const ::google::protobuf::Message& from) PROTOBUF_FINAL;
void CopyFrom(const Gossip& from);
void MergeFrom(const Gossip& from);
void Clear() PROTOBUF_FINAL;
bool IsInitialized() const PROTOBUF_FINAL;
size_t ByteSizeLong() const PROTOBUF_FINAL;
bool MergePartialFromCodedStream(
::google::protobuf::io::CodedInputStream* input) PROTOBUF_FINAL;
void SerializeWithCachedSizes(
::google::protobuf::io::CodedOutputStream* output) const PROTOBUF_FINAL;
::google::protobuf::uint8* InternalSerializeWithCachedSizesToArray(
bool deterministic, ::google::protobuf::uint8* target) const PROTOBUF_FINAL;
int GetCachedSize() const PROTOBUF_FINAL { return _cached_size_; }
private:
void SharedCtor();
void SharedDtor();
void SetCachedSize(int size) const PROTOBUF_FINAL;
void InternalSwap(Gossip* other);
private:
inline ::google::protobuf::Arena* GetArenaNoVirtual() const {
return NULL;
}
inline void* MaybeArenaPtr() const {
return NULL;
}
public:
::google::protobuf::Metadata GetMetadata() const PROTOBUF_FINAL;
// nested types ----------------------------------------------------
typedef Gossip_MessageType MessageType;
static const MessageType Ping =
Gossip_MessageType_Ping;
static const MessageType Ack =
Gossip_MessageType_Ack;
static inline bool MessageType_IsValid(int value) {
return Gossip_MessageType_IsValid(value);
}
static const MessageType MessageType_MIN =
Gossip_MessageType_MessageType_MIN;
static const MessageType MessageType_MAX =
Gossip_MessageType_MessageType_MAX;
static const int MessageType_ARRAYSIZE =
Gossip_MessageType_MessageType_ARRAYSIZE;
static inline const ::google::protobuf::EnumDescriptor*
MessageType_descriptor() {
return Gossip_MessageType_descriptor();
}
static inline const ::std::string& MessageType_Name(MessageType value) {
return Gossip_MessageType_Name(value);
}
static inline bool MessageType_Parse(const ::std::string& name,
MessageType* value) {
return Gossip_MessageType_Parse(name, value);
}
// accessors -------------------------------------------------------
// required .Proto.Member owner = 2;
bool has_owner() const;
void clear_owner();
static const int kOwnerFieldNumber = 2;
const ::Proto::Member& owner() const;
::Proto::Member* release_owner();
::Proto::Member* mutable_owner();
void set_allocated_owner(::Proto::Member* owner);
// required .Proto.Member dest = 3;
bool has_dest() const;
void clear_dest();
static const int kDestFieldNumber = 3;
const ::Proto::Member& dest() const;
::Proto::Member* release_dest();
::Proto::Member* mutable_dest();
void set_allocated_dest(::Proto::Member* dest);
// required .Proto.Table table = 4;
bool has_table() const;
void clear_table();
static const int kTableFieldNumber = 4;
const ::Proto::Table& table() const;
::Proto::Table* release_table();
::Proto::Table* mutable_table();
void set_allocated_table(::Proto::Table* table);
// required .Proto.Gossip.MessageType type = 1;
bool has_type() const;
void clear_type();
static const int kTypeFieldNumber = 1;
::Proto::Gossip_MessageType type() const;
void set_type(::Proto::Gossip_MessageType value);
// @@protoc_insertion_point(class_scope:Proto.Gossip)
private:
void set_has_type();
void clear_has_type();
void set_has_owner();
void clear_has_owner();
void set_has_dest();
void clear_has_dest();
void set_has_table();
void clear_has_table();
// helper for ByteSizeLong()
size_t RequiredFieldsByteSizeFallback() const;
::google::protobuf::internal::InternalMetadataWithArena _internal_metadata_;
::google::protobuf::internal::HasBits<1> _has_bits_;
mutable int _cached_size_;
::Proto::Member* owner_;
::Proto::Member* dest_;
::Proto::Table* table_;
int type_;
friend struct ::protobuf_protobuf_2eproto::TableStruct;
friend void ::protobuf_protobuf_2eproto::InitDefaultsGossipImpl();
};
// ===================================================================
// ===================================================================
#ifdef __GNUC__
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wstrict-aliasing"
#endif // __GNUC__
// MemberAddr
// required uint32 IP = 1;
inline bool MemberAddr::has_ip() const {
return (_has_bits_[0] & 0x00000001u) != 0;
}
inline void MemberAddr::set_has_ip() {
_has_bits_[0] |= 0x00000001u;
}
inline void MemberAddr::clear_has_ip() {
_has_bits_[0] &= ~0x00000001u;
}
inline void MemberAddr::clear_ip() {
ip_ = 0u;
clear_has_ip();
}
inline ::google::protobuf::uint32 MemberAddr::ip() const {
// @@protoc_insertion_point(field_get:Proto.MemberAddr.IP)
return ip_;
}
inline void MemberAddr::set_ip(::google::protobuf::uint32 value) {
set_has_ip();
ip_ = value;
// @@protoc_insertion_point(field_set:Proto.MemberAddr.IP)
}
// required uint32 port = 2;
inline bool MemberAddr::has_port() const {
return (_has_bits_[0] & 0x00000002u) != 0;
}
inline void MemberAddr::set_has_port() {
_has_bits_[0] |= 0x00000002u;
}
inline void MemberAddr::clear_has_port() {
_has_bits_[0] &= ~0x00000002u;
}
inline void MemberAddr::clear_port() {
port_ = 0u;
clear_has_port();
}
inline ::google::protobuf::uint32 MemberAddr::port() const {
// @@protoc_insertion_point(field_get:Proto.MemberAddr.port)
return port_;
}
inline void MemberAddr::set_port(::google::protobuf::uint32 value) {
set_has_port();
port_ = value;
// @@protoc_insertion_point(field_set:Proto.MemberAddr.port)
}
// -------------------------------------------------------------------
// TimeStamp
// required int64 time = 1;
inline bool TimeStamp::has_time() const {
return (_has_bits_[0] & 0x00000001u) != 0;
}
inline void TimeStamp::set_has_time() {
_has_bits_[0] |= 0x00000001u;
}
inline void TimeStamp::clear_has_time() {
_has_bits_[0] &= ~0x00000001u;
}
inline void TimeStamp::clear_time() {
time_ = GOOGLE_LONGLONG(0);
clear_has_time();
}
inline ::google::protobuf::int64 TimeStamp::time() const {
// @@protoc_insertion_point(field_get:Proto.TimeStamp.time)
return time_;
}
inline void TimeStamp::set_time(::google::protobuf::int64 value) {
set_has_time();
time_ = value;
// @@protoc_insertion_point(field_set:Proto.TimeStamp.time)
}
// -------------------------------------------------------------------
// MemberInfo
// required .Proto.MemberInfo.State status = 1;
inline bool MemberInfo::has_status() const {
return (_has_bits_[0] & 0x00000002u) != 0;
}
inline void MemberInfo::set_has_status() {
_has_bits_[0] |= 0x00000002u;
}
inline void MemberInfo::clear_has_status() {
_has_bits_[0] &= ~0x00000002u;
}
inline void MemberInfo::clear_status() {
status_ = 0;
clear_has_status();
}
inline ::Proto::MemberInfo_State MemberInfo::status() const {
// @@protoc_insertion_point(field_get:Proto.MemberInfo.status)
return static_cast< ::Proto::MemberInfo_State >(status_);
}
inline void MemberInfo::set_status(::Proto::MemberInfo_State value) {
assert(::Proto::MemberInfo_State_IsValid(value));
set_has_status();
status_ = value;
// @@protoc_insertion_point(field_set:Proto.MemberInfo.status)
}
// required uint32 incarnation = 2;
inline bool MemberInfo::has_incarnation() const {
return (_has_bits_[0] & 0x00000004u) != 0;
}
inline void MemberInfo::set_has_incarnation() {
_has_bits_[0] |= 0x00000004u;
}
inline void MemberInfo::clear_has_incarnation() {
_has_bits_[0] &= ~0x00000004u;
}
inline void MemberInfo::clear_incarnation() {
incarnation_ = 0u;
clear_has_incarnation();
}
inline ::google::protobuf::uint32 MemberInfo::incarnation() const {
// @@protoc_insertion_point(field_get:Proto.MemberInfo.incarnation)
return incarnation_;
}
inline void MemberInfo::set_incarnation(::google::protobuf::uint32 value) {
set_has_incarnation();
incarnation_ = value;
// @@protoc_insertion_point(field_set:Proto.MemberInfo.incarnation)
}
// required .Proto.TimeStamp time_stamp = 3;
inline bool MemberInfo::has_time_stamp() const {
return (_has_bits_[0] & 0x00000001u) != 0;
}
inline void MemberInfo::set_has_time_stamp() {
_has_bits_[0] |= 0x00000001u;
}
inline void MemberInfo::clear_has_time_stamp() {
_has_bits_[0] &= ~0x00000001u;
}
inline void MemberInfo::clear_time_stamp() {
if (time_stamp_ != NULL) time_stamp_->Clear();
clear_has_time_stamp();
}
inline const ::Proto::TimeStamp& MemberInfo::time_stamp() const {
const ::Proto::TimeStamp* p = time_stamp_;
// @@protoc_insertion_point(field_get:Proto.MemberInfo.time_stamp)
return p != NULL ? *p : *reinterpret_cast<const ::Proto::TimeStamp*>(
&::Proto::_TimeStamp_default_instance_);
}
inline ::Proto::TimeStamp* MemberInfo::release_time_stamp() {
// @@protoc_insertion_point(field_release:Proto.MemberInfo.time_stamp)
clear_has_time_stamp();
::Proto::TimeStamp* temp = time_stamp_;
time_stamp_ = NULL;
return temp;
}
inline ::Proto::TimeStamp* MemberInfo::mutable_time_stamp() {
set_has_time_stamp();
if (time_stamp_ == NULL) {
time_stamp_ = new ::Proto::TimeStamp;
}
// @@protoc_insertion_point(field_mutable:Proto.MemberInfo.time_stamp)
return time_stamp_;
}
inline void MemberInfo::set_allocated_time_stamp(::Proto::TimeStamp* time_stamp) {
::google::protobuf::Arena* message_arena = GetArenaNoVirtual();
if (message_arena == NULL) {
delete time_stamp_;
}
if (time_stamp) {
::google::protobuf::Arena* submessage_arena = NULL;
if (message_arena != submessage_arena) {
time_stamp = ::google::protobuf::internal::GetOwnedMessage(
message_arena, time_stamp, submessage_arena);
}
set_has_time_stamp();
} else {
clear_has_time_stamp();
}
time_stamp_ = time_stamp;
// @@protoc_insertion_point(field_set_allocated:Proto.MemberInfo.time_stamp)
}
// -------------------------------------------------------------------
// Member
// required .Proto.MemberAddr addr = 1;
inline bool Member::has_addr() const {
return (_has_bits_[0] & 0x00000001u) != 0;
}
inline void Member::set_has_addr() {
_has_bits_[0] |= 0x00000001u;
}
inline void Member::clear_has_addr() {
_has_bits_[0] &= ~0x00000001u;
}
inline void Member::clear_addr() {
if (addr_ != NULL) addr_->Clear();
clear_has_addr();
}
inline const ::Proto::MemberAddr& Member::addr() const {
const ::Proto::MemberAddr* p = addr_;
// @@protoc_insertion_point(field_get:Proto.Member.addr)
return p != NULL ? *p : *reinterpret_cast<const ::Proto::MemberAddr*>(
&::Proto::_MemberAddr_default_instance_);
}
inline ::Proto::MemberAddr* Member::release_addr() {
// @@protoc_insertion_point(field_release:Proto.Member.addr)
clear_has_addr();
::Proto::MemberAddr* temp = addr_;
addr_ = NULL;
return temp;
}
inline ::Proto::MemberAddr* Member::mutable_addr() {
set_has_addr();
if (addr_ == NULL) {
addr_ = new ::Proto::MemberAddr;
}
// @@protoc_insertion_point(field_mutable:Proto.Member.addr)
return addr_;
}
inline void Member::set_allocated_addr(::Proto::MemberAddr* addr) {
::google::protobuf::Arena* message_arena = GetArenaNoVirtual();
if (message_arena == NULL) {
delete addr_;
}
if (addr) {
::google::protobuf::Arena* submessage_arena = NULL;
if (message_arena != submessage_arena) {
addr = ::google::protobuf::internal::GetOwnedMessage(
message_arena, addr, submessage_arena);
}
set_has_addr();
} else {
clear_has_addr();
}
addr_ = addr;
// @@protoc_insertion_point(field_set_allocated:Proto.Member.addr)
}
// required .Proto.MemberInfo info = 2;
inline bool Member::has_info() const {
return (_has_bits_[0] & 0x00000002u) != 0;
}
inline void Member::set_has_info() {
_has_bits_[0] |= 0x00000002u;
}
inline void Member::clear_has_info() {
_has_bits_[0] &= ~0x00000002u;
}
inline void Member::clear_info() {
if (info_ != NULL) info_->Clear();
clear_has_info();
}
inline const ::Proto::MemberInfo& Member::info() const {
const ::Proto::MemberInfo* p = info_;
// @@protoc_insertion_point(field_get:Proto.Member.info)
return p != NULL ? *p : *reinterpret_cast<const ::Proto::MemberInfo*>(
&::Proto::_MemberInfo_default_instance_);
}
inline ::Proto::MemberInfo* Member::release_info() {
// @@protoc_insertion_point(field_release:Proto.Member.info)
clear_has_info();
::Proto::MemberInfo* temp = info_;
info_ = NULL;
return temp;
}
inline ::Proto::MemberInfo* Member::mutable_info() {
set_has_info();
if (info_ == NULL) {
info_ = new ::Proto::MemberInfo;
}
// @@protoc_insertion_point(field_mutable:Proto.Member.info)
return info_;
}
inline void Member::set_allocated_info(::Proto::MemberInfo* info) {
::google::protobuf::Arena* message_arena = GetArenaNoVirtual();
if (message_arena == NULL) {
delete info_;
}
if (info) {
::google::protobuf::Arena* submessage_arena = NULL;
if (message_arena != submessage_arena) {
info = ::google::protobuf::internal::GetOwnedMessage(
message_arena, info, submessage_arena);
}
set_has_info();
} else {
clear_has_info();
}
info_ = info;
// @@protoc_insertion_point(field_set_allocated:Proto.Member.info)
}
// -------------------------------------------------------------------
// Table
// repeated .Proto.Member table = 1;
inline int Table::table_size() const {
return table_.size();
}
inline void Table::clear_table() {
table_.Clear();
}
inline const ::Proto::Member& Table::table(int index) const {
// @@protoc_insertion_point(field_get:Proto.Table.table)
return table_.Get(index);
}
inline ::Proto::Member* Table::mutable_table(int index) {
// @@protoc_insertion_point(field_mutable:Proto.Table.table)
return table_.Mutable(index);
}
inline ::Proto::Member* Table::add_table() {
// @@protoc_insertion_point(field_add:Proto.Table.table)
return table_.Add();
}
inline ::google::protobuf::RepeatedPtrField< ::Proto::Member >*
Table::mutable_table() {
// @@protoc_insertion_point(field_mutable_list:Proto.Table.table)
return &table_;
}
inline const ::google::protobuf::RepeatedPtrField< ::Proto::Member >&
Table::table() const {
// @@protoc_insertion_point(field_list:Proto.Table.table)
return table_;
}
// -------------------------------------------------------------------
// Gossip
// required .Proto.Gossip.MessageType type = 1;
inline bool Gossip::has_type() const {
return (_has_bits_[0] & 0x00000008u) != 0;
}
inline void Gossip::set_has_type() {
_has_bits_[0] |= 0x00000008u;
}
inline void Gossip::clear_has_type() {
_has_bits_[0] &= ~0x00000008u;
}
inline void Gossip::clear_type() {
type_ = 0;
clear_has_type();
}
inline ::Proto::Gossip_MessageType Gossip::type() const {
// @@protoc_insertion_point(field_get:Proto.Gossip.type)
return static_cast< ::Proto::Gossip_MessageType >(type_);
}
inline void Gossip::set_type(::Proto::Gossip_MessageType value) {
assert(::Proto::Gossip_MessageType_IsValid(value));
set_has_type();
type_ = value;
// @@protoc_insertion_point(field_set:Proto.Gossip.type)
}
// required .Proto.Member owner = 2;
inline bool Gossip::has_owner() const {
return (_has_bits_[0] & 0x00000001u) != 0;
}
inline void Gossip::set_has_owner() {
_has_bits_[0] |= 0x00000001u;
}
inline void Gossip::clear_has_owner() {
_has_bits_[0] &= ~0x00000001u;
}
inline void Gossip::clear_owner() {
if (owner_ != NULL) owner_->Clear();
clear_has_owner();
}
inline const ::Proto::Member& Gossip::owner() const {
const ::Proto::Member* p = owner_;
// @@protoc_insertion_point(field_get:Proto.Gossip.owner)
return p != NULL ? *p : *reinterpret_cast<const ::Proto::Member*>(
&::Proto::_Member_default_instance_);
}
inline ::Proto::Member* Gossip::release_owner() {
// @@protoc_insertion_point(field_release:Proto.Gossip.owner)
clear_has_owner();
::Proto::Member* temp = owner_;
owner_ = NULL;
return temp;
}
inline ::Proto::Member* Gossip::mutable_owner() {
set_has_owner();
if (owner_ == NULL) {
owner_ = new ::Proto::Member;
}
// @@protoc_insertion_point(field_mutable:Proto.Gossip.owner)
return owner_;
}
inline void Gossip::set_allocated_owner(::Proto::Member* owner) {
::google::protobuf::Arena* message_arena = GetArenaNoVirtual();
if (message_arena == NULL) {
delete owner_;
}
if (owner) {
::google::protobuf::Arena* submessage_arena = NULL;
if (message_arena != submessage_arena) {
owner = ::google::protobuf::internal::GetOwnedMessage(
message_arena, owner, submessage_arena);
}
set_has_owner();
} else {
clear_has_owner();
}
owner_ = owner;
// @@protoc_insertion_point(field_set_allocated:Proto.Gossip.owner)
}
// required .Proto.Member dest = 3;
inline bool Gossip::has_dest() const {
return (_has_bits_[0] & 0x00000002u) != 0;
}
inline void Gossip::set_has_dest() {
_has_bits_[0] |= 0x00000002u;
}
inline void Gossip::clear_has_dest() {
_has_bits_[0] &= ~0x00000002u;
}
inline void Gossip::clear_dest() {
if (dest_ != NULL) dest_->Clear();
clear_has_dest();
}
inline const ::Proto::Member& Gossip::dest() const {
const ::Proto::Member* p = dest_;
// @@protoc_insertion_point(field_get:Proto.Gossip.dest)
return p != NULL ? *p : *reinterpret_cast<const ::Proto::Member*>(
&::Proto::_Member_default_instance_);
}
inline ::Proto::Member* Gossip::release_dest() {
// @@protoc_insertion_point(field_release:Proto.Gossip.dest)
clear_has_dest();
::Proto::Member* temp = dest_;
dest_ = NULL;
return temp;
}
inline ::Proto::Member* Gossip::mutable_dest() {
set_has_dest();
if (dest_ == NULL) {
dest_ = new ::Proto::Member;
}
// @@protoc_insertion_point(field_mutable:Proto.Gossip.dest)
return dest_;
}
inline void Gossip::set_allocated_dest(::Proto::Member* dest) {
::google::protobuf::Arena* message_arena = GetArenaNoVirtual();
if (message_arena == NULL) {
delete dest_;
}
if (dest) {
::google::protobuf::Arena* submessage_arena = NULL;
if (message_arena != submessage_arena) {
dest = ::google::protobuf::internal::GetOwnedMessage(
message_arena, dest, submessage_arena);
}
set_has_dest();
} else {
clear_has_dest();
}
dest_ = dest;
// @@protoc_insertion_point(field_set_allocated:Proto.Gossip.dest)
}
// required .Proto.Table table = 4;
inline bool Gossip::has_table() const {
return (_has_bits_[0] & 0x00000004u) != 0;
}
inline void Gossip::set_has_table() {
_has_bits_[0] |= 0x00000004u;
}
inline void Gossip::clear_has_table() {
_has_bits_[0] &= ~0x00000004u;
}
inline void Gossip::clear_table() {
if (table_ != NULL) table_->Clear();
clear_has_table();
}
inline const ::Proto::Table& Gossip::table() const {
const ::Proto::Table* p = table_;
// @@protoc_insertion_point(field_get:Proto.Gossip.table)
return p != NULL ? *p : *reinterpret_cast<const ::Proto::Table*>(
&::Proto::_Table_default_instance_);
}
inline ::Proto::Table* Gossip::release_table() {
// @@protoc_insertion_point(field_release:Proto.Gossip.table)
clear_has_table();
::Proto::Table* temp = table_;
table_ = NULL;
return temp;
}
inline ::Proto::Table* Gossip::mutable_table() {
set_has_table();
if (table_ == NULL) {
table_ = new ::Proto::Table;
}
// @@protoc_insertion_point(field_mutable:Proto.Gossip.table)
return table_;
}
inline void Gossip::set_allocated_table(::Proto::Table* table) {
::google::protobuf::Arena* message_arena = GetArenaNoVirtual();
if (message_arena == NULL) {
delete table_;
}
if (table) {
::google::protobuf::Arena* submessage_arena = NULL;
if (message_arena != submessage_arena) {
table = ::google::protobuf::internal::GetOwnedMessage(
message_arena, table, submessage_arena);
}
set_has_table();
} else {
clear_has_table();
}
table_ = table;
// @@protoc_insertion_point(field_set_allocated:Proto.Gossip.table)
}
#ifdef __GNUC__
#pragma GCC diagnostic pop
#endif // __GNUC__
// -------------------------------------------------------------------
// -------------------------------------------------------------------
// -------------------------------------------------------------------
// -------------------------------------------------------------------
// -------------------------------------------------------------------
// @@protoc_insertion_point(namespace_scope)
} // namespace Proto
namespace google {
namespace protobuf {
template <> struct is_proto_enum< ::Proto::MemberInfo_State> : ::google::protobuf::internal::true_type {};
template <>
inline const EnumDescriptor* GetEnumDescriptor< ::Proto::MemberInfo_State>() {
return ::Proto::MemberInfo_State_descriptor();
}
template <> struct is_proto_enum< ::Proto::Gossip_MessageType> : ::google::protobuf::internal::true_type {};
template <>
inline const EnumDescriptor* GetEnumDescriptor< ::Proto::Gossip_MessageType>() {
return ::Proto::Gossip_MessageType_descriptor();
}
} // namespace protobuf
} // namespace google
// @@protoc_insertion_point(global_scope)
#endif // PROTOBUF_protobuf_2eproto__INCLUDED
| [
"semen.andreev00@mail.ru"
] | semen.andreev00@mail.ru |
a1de3be870945d27cc05ea0d4bdfa36cadb91ec8 | cf103a57a16b591dfaa68fec40e2d78be543d123 | /9.Stack and Queue/4.Next_greatest_right.cpp | 78c3cacf91b56a6e16fd598c9b13be44d2247bea | [] | no_license | shubham-gupta-17/Interview-Preparation | 56366d9b1fdbffa2ddb0086ef588c5f5a418d074 | 0b27098ba8638c65997fab327609df3f645baed1 | refs/heads/master | 2023-02-15T00:07:00.286859 | 2021-01-06T05:56:21 | 2021-01-06T05:56:21 | 270,090,687 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 655 | cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int *arr=new int[n];
for(int i=0;i<n;i++) cin>>arr[i];
stack<int> st;
int *right=new int[n]();
// initialise
for(int i=0;i<n;i++) right[i]=-1;
// find greatest on right
for(int i=0;i<n-1;i++)
{
while(!st.empty() && arr[i]>=arr[st.top()])
{
int idx=st.top();
st.pop();
right[idx]=i;
}
st.push(i);
}
for(int i=0;i<n;i++) {
if(right[i]==-1) cout<<arr[i]<<" "<<"-1"<<endl;
else cout<<arr[i]<<" "<<arr[right[i]]<<endl;
}
return 0;
} | [
"39772611+shubham-gupta-17@users.noreply.github.com"
] | 39772611+shubham-gupta-17@users.noreply.github.com |
cec7594c71dcd192a8b87bcb13275af04289ffc6 | 8f66efe36fb3a70df3495f7305aac613781575d1 | /pid_str2/src/virtual_event_generator.cxx | 356ae6fdfaaf03868ab40f9b59291f1ec9cbab75 | [] | no_license | Clorophyllia/NAMIRIN | 22136bc7306b22feea63bb517f5bea8db6be319f | ae88a189f074382220bf5e48f020474220f847a4 | refs/heads/main | 2023-08-30T10:03:33.884716 | 2021-11-18T05:08:56 | 2021-11-18T05:08:56 | 378,851,756 | 0 | 0 | null | 2021-11-18T05:08:56 | 2021-06-21T07:57:54 | C++ | UTF-8 | C++ | false | false | 10,139 | cxx | //#######################################################################################################################################################################
/************************************************************************************************************************************************************************
Virtual events generator for the DAQ' online PID SW test and evaluation.
It would create pseudo date set and would replace pdata in the frontend layer. (e.g. which means it will be interact with ODB in MIDAS DAQ)
Data have been gathered from LISE++ simulation.
Current version is using a Normal distribution approximztion about distributions of ADC and TDC values.
************************************************************************************************************************************************************************/
//#######################################################################################################################################################################
#include <iostream>
#include <string>
#include <stdio.h>
#include <stdlib.h>
#include <stdarg.h>
#include <time.h>
#include <math.h>
#include <string.h>
#include <unistd.h>
#include <memory.h>
#include <ctype.h>
#include <termios.h>
#include <assert.h>
#include "midas.h"
#include "odb_trigger.h"
#include "detector_conf.h"
#include "virtual_gaussian.h"
#include "focal_cond.h"
#include "mfe_PID.h"
#include "mfe.h"
#include "msystem.h"
#include "msystem.h"
#define BL_FORBID 1.e+7
#define PERI_INTV 1000
#define SCAN_INTV 5000
#define NUMB_STAT 10
#define Pi 3.141592
#define TDC_VIR_DELAY 100. // TDC counting -> measurment [ns]
#define ADC_VIR_PEDST 0.125 // Silicon pedestal [MeV]
#define ADC_CONV_GRAD 41.667
//#define FOD 40.257 // dp/p [%] - x [mm]
#define TOF_X_COEF -0.01113
#define SYS_BARRIER_L -181. // [mm] Specific shortest TOF boundary condition. Would be cut out forbidden values on the local Cal. function
#define SYS_BARRIER_H 187.5
#define INTENSITY_NORM 7.94692
#define PPAC_ANODE 500
#define PPAC_CATHODE 500
#define PPAC_CONV_GRAD 0.01522
#define PPAC_TDC_SUM 7000
#define brho_ref 1.9709
int seed;
int VEG_TAG;
uint32_t vir_ev_count;
uint32_t vir_tdc_value[13];
uint32_t vir_adc_value[32];
uint32_t vir_tdc_tof[2];
int vir_tdc_ch;
double elem_prop[15] = {0};
GAUSS_ISOTOPE sort_isotopes[15];
//------------------------------ model variables -----------------------------------------//
//@ @//
/*
extern GAUSS_ISOTOPE S38;
extern GAUSS_ISOTOPE S39;
extern GAUSS_ISOTOPE P35;
extern GAUSS_ISOTOPE P36;
extern GAUSS_ISOTOPE P37;
extern GAUSS_ISOTOPE P38;
extern GAUSS_ISOTOPE SI33;
extern GAUSS_ISOTOPE SI34;
extern GAUSS_ISOTOPE SI35;
*/
//@ @//
//-------------------------------------------------------------------------------------------------------//
//------------------------------ local funtions for mathmatical Cal. ---------------------------------------------//
double gauss_engine(double sigma, double mu){
double pt, po, P1;
while(1){ // hard endge cut of a 2.4 sigma window
pt = (double)drand48();
po = (double)drand48();
P1 = (double)sqrt(-2*log(1-pt))*cos(2*Pi*(1-po));
if(fabs(P1) > /*0.0223945*/0.0022/sigma) break;
}
return P1*sigma + mu;
}
/*double ambi_engine(double *f(double), double min, double max){ // General distribution generator; This may have a low precision (relatively), and a low computing efficiency.
srand48((unsigned int)seed);
double x, x_uni, x_intv, xi, norm;
double fmax = 0.;
x = (double)drand48();
x_uni = (max - min)*x + min;
x_intv = (max - min)/20000.;
for(xi = min; xi <= max; xi += x_intv) if(fmax < f(xi)) fmax = f(xi);
norm = 1./fmax;
return x_uni*(1. - norm*f(x_uni));
}*/
double br_tof_cor(double ti, double tf, double intercept, double div){ // tof start; tof end; conversion factor; deviation of tof;
// set brho value based on the tof correlation
return gauss_engine(div ,(tf - ti))*TOF_X_COEF + intercept;
}
double br_to_tdc(double ti, double tf, double intercept, double div){ // doesn't give a damn about a y-axis :P
// ignore calibration & segment edge correction on this test code
int i;
double brho_c = br_tof_cor(ti, tf, intercept,div); // [T * m]
double podp = (brho_c - brho_ref)/brho_ref*100.; // [%]
double xpos = podp*FOD; // [mm]
for(i = 0; i < 12; i++) vir_tdc_value[i] = 0;
vir_tdc_value[12] = PPAC_ANODE;
if(xpos < -100){
vir_tdc_value[0] = (xpos + 150.)/PPAC_CONV_GRAD*0.5 + PPAC_TDC_SUM*0.5;
vir_tdc_value[1] = PPAC_TDC_SUM - vir_tdc_value[0];
}
if(xpos >= -100 && xpos < 0 ){
vir_tdc_value[2] = (xpos + 50.)/PPAC_CONV_GRAD*0.5 + PPAC_TDC_SUM*0.5;
vir_tdc_value[3] = PPAC_TDC_SUM - vir_tdc_value[2];
//printf("F1_CH3 Value: %u F1_CH4 Value: %u \n",vir_tdc_value[2],vir_tdc_value[3]);
}
if(xpos >= 0 && xpos < 100 ){
vir_tdc_value[4] = (xpos - 50.)/PPAC_CONV_GRAD*0.5 + PPAC_TDC_SUM*0.5;
vir_tdc_value[5] = PPAC_TDC_SUM - vir_tdc_value[4];
//printf("F1_CH5 Value: %u F1_CH6 Value: %u \n",vir_tdc_value[4],vir_tdc_value[5]);
}
if(xpos > 100){
vir_tdc_value[6] = (xpos - 150.)/PPAC_CONV_GRAD*0.5 + PPAC_TDC_SUM*0.5;
vir_tdc_value[7] = PPAC_TDC_SUM - vir_tdc_value[6];
}
//if(fabs(xpos) > 200) return 1; // reject the event?
//else return 0;
return xpos;
}
double de_to_adc(double de){ // energy loss in MeV
int i;
double ch_sel;
ch_sel = 16.*drand48();
vir_tdc_ch = (int)ch_sel;
if(vir_tdc_ch == 16) ch_sel = 16.*drand48();
vir_tdc_ch = (int)ch_sel;
for(i = 0 ; i < 32; i++) vir_adc_value[i] = (uint32_t)(ADC_VIR_PEDST*ADC_CONV_GRAD);
vir_adc_value[vir_tdc_ch] = (uint32_t)((ADC_VIR_PEDST + de)*ADC_CONV_GRAD);
printf("generated adc: %u, channel: %d \n",vir_adc_value[vir_tdc_ch], vir_tdc_ch);
return vir_adc_value[vir_tdc_ch];
}
bool accept_cut(double pos){
if( pos < SYS_BARRIER_L || pos > SYS_BARRIER_H) return 1; // if a generated event has a forbiden value, reject the event.
else return 0;
}
//----------------------------------------------------------------------------------------------------------------------------//
INT veg_init(){
srand48((unsigned int)seed);
int i;
vir_ev_count = 0;
sort_isotopes[0] = S37;
sort_isotopes[1] = S38;
sort_isotopes[2] = S39;
sort_isotopes[3] = P35;
sort_isotopes[4] = P36;
sort_isotopes[5] = P37;
sort_isotopes[6] = P38;
sort_isotopes[7] = SI33;
sort_isotopes[8] = SI34;
sort_isotopes[9] = SI35;
for(i = 0; i <= 9; i++) elem_prop[i] += S37.inten;
for(i = 1; i <= 9; i++) elem_prop[i] += S38.inten;
for(i = 2; i <= 9; i++) elem_prop[i] += S39.inten;
for(i = 3; i <= 9; i++) elem_prop[i] += P35.inten;
for(i = 4; i <= 9; i++) elem_prop[i] += P36.inten;
for(i = 5; i <= 9; i++) elem_prop[i] += P37.inten;
for(i = 6; i <= 9; i++) elem_prop[i] += P38.inten;
for(i = 7; i <= 9; i++) elem_prop[i] += SI33.inten;
for(i = 8; i <= 9; i++) elem_prop[i] += SI34.inten;
elem_prop[9] += SI35.inten;
VEG_TAG = 0;
//for(i = 0; i < 10; i++) printf("Elements of an elem array: %lf \n", elem_prop[i]);
return SUCCESS;
}
INT veg_exit(){
return SUCCESS;
}
INT veg_begin(){
return SUCCESS;
}
INT veg_end(){
return SUCCESS;
}
INT veg_check_fifo(int32_t lBHandle){
uint32_t addr;
int16_t output_buffer_event;
return output_buffer_event;
}
INT veg_read_fifo(int32_t lBHandle, void *buff_tmp, int size){
int count;
uint32_t addr;
return count;
}
/* ---------------------------------------------------------------------------
Read one block of data
------------------------------------------------------------------------- */
INT veg_ReadBlock(int32_t lBHandle, uint32_t *buffer, int MaxSize, int *nw){
return 0;
}
/* ---------------------------------------------------------------------------
Read one or more events from the PLUscaler
------------------------------------------------------------------------- */
INT veg_ReadEvents(int32_t lBHandle, uint32_t *buffer, int *nw){
return 0;
}
INT veg_create_event(){
int i;
int selem = -1;
double elem_select;
double t_start, t_end, e_loss;
double s_brho,adc_tmp;
//########## Virtual isotope selection #################//
if(VEG_TAG == 0 || VEG_TAG > 4){
elem_select = INTENSITY_NORM*drand48();
if(elem_select < elem_prop[0]) selem = 0;
for(i = 1; i < 9; i++) if(elem_select <= elem_prop[i] && elem_select > elem_prop[i-1]) selem = i;
if(selem == -1) selem = 9;
GAUSS_ISOTOPE *SELI = &sort_isotopes[selem];
printf("ISOTOPES SELECTION : #%d, RV: %lf \n",selem,elem_select);
//########### Virtual Timing generation #################//
t_start = gauss_engine(SELI->tof_sigm/sqrt(2), TDC_VIR_DELAY);
t_end = gauss_engine(SELI->tof_sigm/sqrt(2), TDC_VIR_DELAY + SELI->tof_mean);
//########### Virtual ADC generation #################//
e_loss = gauss_engine(SELI->de_sigm, SELI->de_mean); // any problem on offset..?
s_brho = br_tof_cor(t_start, t_end, SELI->br_intc, SELI->br_intv);
double xp = br_to_tdc(t_start, t_end, SELI->br_intc, SELI->br_intv); // create corresponding F1_PPAC data set
adc_tmp = de_to_adc(e_loss); // create corresponding F3_Silicon data set
vir_tdc_tof[0] = (int32_t)(t_start/0.025); vir_tdc_tof[1] = (int32_t)(t_end/0.025); // create corresponding F2_PPAC and F3_Plastic data set
//(Probably;) Need to add gain Ch. specification function on the conversion fth
printf("t0: %lf, t1: %lf, E: %lf, ADC: %lf, brho: %lf, pos: %lf\n", t_start, t_end, e_loss, adc_tmp, s_brho, xp);
//for(i = 0; i < 8 ; i++) if(vir_tdc_value[i] != 0 ) printf("F1_CH: %d, Value: %lf ",i,vir_tdc_value[i]);
printf("\n");
vir_ev_count ++;
VEG_TAG = 1;
}
//-------------------------------------------------------------------------------------------------------------------------//
return 0;// bk_size(pevent);
}
| [
"ldy@DYLee.localdomain"
] | ldy@DYLee.localdomain |
c5926f242049976483693daa876944f9b0c4f77d | e8be5e13152f1ccfece36ba47569614a87842d96 | /GameSanGuo/GameSanGuo/Classes/game/battle/heroSkills/SGHeroSkill12.h | daeaa937b9fda060d04db3f5d19c4105db7467b2 | [] | no_license | Crasader/warCraft | 571ed9a3181b0eb52940cdd2965b7445c004d58f | b9cf69828c61bdf55b2af3b587f3be06de93768c | refs/heads/master | 2020-12-13T18:05:17.592831 | 2016-01-19T13:42:19 | 2016-01-19T13:42:19 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 487 | h | //
// SGHeroSkill12.h
// GameSanGuo
//
// Created by wenlong w on 13-8-27.
//
//
#ifndef __GameSanGuo__SGHeroSkill12__
#define __GameSanGuo__SGHeroSkill12__
#include <iostream>
#include "SGHeroSkillsBase.h"
class SGHeroSkill12 : public SGHeroSkillsBase {
public:
SGHeroSkill12();
~SGHeroSkill12();
void activateSkill_20014(SGHeroLayer *heroLayer, float value1, float value2, int round, int buffid);
};
#endif /* defined(__GameSanGuo__SGHeroSkill12__) */
| [
"350232751@qq.com"
] | 350232751@qq.com |
555bf52d61b27afe173291d06581df3ea88bcaee | 23fce171d033b33bb8d8cf31185842a146af2eb1 | /Apriori/Apriori/classes.cpp | 166852f6058ec0a4d042947dd3dea1b3be929c74 | [] | no_license | OwenEnders/Final-281 | 5d8377fd39aa86ef750971603ba8c1cb4ccd32dd | af23e81534c45fe7ed0bec2a92e9e35fe5b8e03c | refs/heads/master | 2021-01-10T16:00:16.207071 | 2015-12-13T01:25:28 | 2015-12-13T01:25:28 | 47,565,680 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 603 | cpp | #include "classes.h"
void ItemsetHolder::buildItemsets()
{
//for single item itemsets, fill in linked list with the item of the itemset
//call the determineSupport function
//move to next spot in array and repeat
//when all single itemsets added, call pruneItemsets function
//for remaining itemsets, combind and repeat
}
void ItemsetHolder::pruneItemsets()
{
//go through array, if an itemsets support isnt great enough, destroy the itemset.
//every time function is called, start off where it last stopped, instead of at the beginning of the array
}
void Itemset::determineSupport()
{
} | [
"samuel.poquette@mymail.champlain.edu"
] | samuel.poquette@mymail.champlain.edu |
d0b56d120e265c79039f19608185e9089a8d7a84 | 61e91921378733fabfbf5534c6deb612387f5542 | /Interval List Intersections/Interval List Intersections.cpp | 17ed95c61fe3e7aa527932da246de21397f92b42 | [] | no_license | karnies/LeetCode | 4e7b99c06971bfbc96ab7af1482b6cd41f31853b | feb18118dda38d1b80294c38c63c0e484633e742 | refs/heads/master | 2022-08-20T12:58:16.198661 | 2020-05-29T06:54:45 | 2020-05-29T06:54:45 | 266,031,960 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 828 | cpp | class Solution {
public:
vector<vector<int>> intervalIntersection(vector<vector<int>>& A, vector<vector<int>>& B) {
int sizeA = A.size();
int sizeB = B.size();
int i, j;
if (sizeA == 0 || sizeB == 0)
return {};
vector<vector<int>> ret;
ret.reserve(max(sizeA, sizeB));
i = j = 0;
while (i < sizeA && j < sizeB)
{
// check not intersect
if (B[j][0] > A[i][1])
{
i++;
continue;
}
// check not intersect
if (B[j][1] < A[i][0])
{
j++;
continue;
}
// max start and min end is intersect
vector<int> a({ max(A[i][0], B[j][0]), min(A[i][1], B[j][1]) });
ret.emplace_back(a);
// Change the block in front of the end point
if (A[i][1] < B[j][1])
i++;
else if (A[i][1] > B[j][1])
j++;
else
{
i++;
j++;
}
}
return ret;
}
};
| [
"karnies1981@gmail.com"
] | karnies1981@gmail.com |
334b756cc2742cbb101298cf083738ce9e1168bf | 850cc4f4f1d89a385ef53fdfb06073c89987c228 | /extras/regina/engine/snappea/kernel/matrix_generators.cpp | f59d1968c7a37632e43e383129cbc06ddcdeb385 | [] | no_license | unhyperbolic/sageRegina | 45e449394c83de68f5c530a5718bd8e78ff89a44 | c1d52c25b1dcb73ab1839f5cb50c619ead2c5158 | refs/heads/master | 2021-12-27T14:13:21.848360 | 2021-12-18T23:57:09 | 2021-12-18T23:57:09 | 233,320,291 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 31 | cpp | #include "matrix_generators.c"
| [
"enischte@gmail.com"
] | enischte@gmail.com |
1c2d5ed31b1d2057e25728d1491c62ca9f7f0608 | ca5a48823f28a43d9f96facbbb9f025fe8d21f20 | /PASS firmware/lib/BNO055/Adafruit_BNO055.cpp | db4720c271fc0b5270891ca8d1d4c857f3756c9d | [] | no_license | avpripri/BackFlip | bbf0c181ea5c257805612caf5baa2fc233f4c3ea | eb83adf4108a0b8a6a1574fd837c3e6c951b0b54 | refs/heads/master | 2022-07-11T15:57:41.699516 | 2022-07-03T14:32:06 | 2022-07-03T14:32:06 | 248,351,293 | 3 | 1 | null | 2021-02-06T15:12:02 | 2020-03-18T21:53:43 | Pascal | UTF-8 | C++ | false | false | 26,699 | cpp | /*!
* @file Adafruit_BNO055.cpp
*
* @mainpage Adafruit BNO055 Orientation Sensor
*
* @section intro_sec Introduction
*
* This is a library for the BNO055 orientation sensor
*
* Designed specifically to work with the Adafruit BNO055 9-DOF Breakout.
*
* Pick one up today in the adafruit shop!
* ------> https://www.adafruit.com/product/2472
*
* These sensors use I2C to communicate, 2 pins are required to interface.
*
* Adafruit invests time and resources providing this open source code,
* please support Adafruit andopen-source hardware by purchasing products
* from Adafruit!
*
* @section author Author
*
* K.Townsend (Adafruit Industries)
*
* @section license License
*
* MIT license, all text above must be included in any redistribution
*/
#include "Arduino.h"
#include <limits.h>
#include <math.h>
#include "Adafruit_BNO055.h"
/*!
* @brief Instantiates a new Adafruit_BNO055 class
* @param sensorID
* sensor ID
* @param address
* i2c address
* @param theWire
* Wire object
*/
Adafruit_BNO055::Adafruit_BNO055(int32_t sensorID, uint8_t address,
TwoWire *theWire) {
_sensorID = sensorID;
_address = address;
_wire = theWire;
}
/*!
* @brief Sets up the HW
* @param mode
* mode values
* [OPERATION_MODE_CONFIG,
* OPERATION_MODE_ACCONLY,
* OPERATION_MODE_MAGONLY,
* OPERATION_MODE_GYRONLY,
* OPERATION_MODE_ACCMAG,
* OPERATION_MODE_ACCGYRO,
* OPERATION_MODE_MAGGYRO,
* OPERATION_MODE_AMG,
* OPERATION_MODE_IMUPLUS,
* OPERATION_MODE_COMPASS,
* OPERATION_MODE_M4G,
* OPERATION_MODE_NDOF_FMC_OFF,
* OPERATION_MODE_NDOF]
* @return true if process is successful
*/
bool Adafruit_BNO055::begin(adafruit_bno055_opmode_t mode) {
#if defined(ARDUINO_SAMD_ZERO) && (_address == BNO055_ADDRESS_A)
#error \
"On an arduino Zero, BNO055's ADR pin must be high. Fix that, then delete this line."
_address = BNO055_ADDRESS_B;
#endif
/* Enable I2C */
_wire->begin();
// BNO055 clock stretches for 500us or more!
#ifdef ESP8266
_wire->setClockStretchLimit(1000); // Allow for 1000us of clock stretching
#endif
/* Make sure we have the right device */
uint8_t id = read8(BNO055_CHIP_ID_ADDR);
if (id != BNO055_ID) {
delay(1000); // hold on for boot
id = read8(BNO055_CHIP_ID_ADDR);
if (id != BNO055_ID) {
return false; // still not? ok bail
}
}
/* Switch to config mode (just in case since this is the default) */
setMode(OPERATION_MODE_CONFIG);
/* Reset */
write8(BNO055_SYS_TRIGGER_ADDR, 0x20);
/* Delay incrased to 30ms due to power issues https://tinyurl.com/y375z699 */
delay(30);
while (read8(BNO055_CHIP_ID_ADDR) != BNO055_ID) {
delay(10);
}
delay(50);
/* Set to normal power mode */
write8(BNO055_PWR_MODE_ADDR, POWER_MODE_NORMAL);
delay(10);
write8(BNO055_PAGE_ID_ADDR, 0);
/* Set the output units */
/*
uint8_t unitsel = (0 << 7) | // Orientation = Android
(0 << 4) | // Temperature = Celsius
(0 << 2) | // Euler = Degrees
(1 << 1) | // Gyro = Rads
(0 << 0); // Accelerometer = m/s^2
write8(BNO055_UNIT_SEL_ADDR, unitsel);
*/
/* Configure axis mapping (see section 3.4) */
/*
write8(BNO055_AXIS_MAP_CONFIG_ADDR, REMAP_CONFIG_P2); // P0-P7, Default is P1
delay(10);
write8(BNO055_AXIS_MAP_SIGN_ADDR, REMAP_SIGN_P2); // P0-P7, Default is P1
delay(10);
*/
write8(BNO055_SYS_TRIGGER_ADDR, 0x0);
delay(10);
/* Set the requested operating mode (see section 3.3) */
setMode(mode);
delay(20);
return true;
}
/*!
* @brief Puts the chip in the specified operating mode
* @param mode
* mode values
* [OPERATION_MODE_CONFIG,
* OPERATION_MODE_ACCONLY,
* OPERATION_MODE_MAGONLY,
* OPERATION_MODE_GYRONLY,
* OPERATION_MODE_ACCMAG,
* OPERATION_MODE_ACCGYRO,
* OPERATION_MODE_MAGGYRO,
* OPERATION_MODE_AMG,
* OPERATION_MODE_IMUPLUS,
* OPERATION_MODE_COMPASS,
* OPERATION_MODE_M4G,
* OPERATION_MODE_NDOF_FMC_OFF,
* OPERATION_MODE_NDOF]
*/
void Adafruit_BNO055::setMode(adafruit_bno055_opmode_t mode) {
_mode = mode;
write8(BNO055_OPR_MODE_ADDR, _mode);
delay(30);
}
/*!
* @brief Changes the chip's axis remap
* @param remapcode
* remap code possible values
* [REMAP_CONFIG_P0
* REMAP_CONFIG_P1 (default)
* REMAP_CONFIG_P2
* REMAP_CONFIG_P3
* REMAP_CONFIG_P4
* REMAP_CONFIG_P5
* REMAP_CONFIG_P6
* REMAP_CONFIG_P7]
*/
void Adafruit_BNO055::setAxisRemap(
adafruit_bno055_axis_remap_config_t remapcode) {
adafruit_bno055_opmode_t modeback = _mode;
setMode(OPERATION_MODE_CONFIG);
delay(25);
write8(BNO055_AXIS_MAP_CONFIG_ADDR, remapcode);
delay(10);
/* Set the requested operating mode (see section 3.3) */
setMode(modeback);
delay(20);
}
/*!
* @brief Changes the chip's axis signs
* @param remapsign
* remap sign possible values
* [REMAP_SIGN_P0
* REMAP_SIGN_P1 (default)
* REMAP_SIGN_P2
* REMAP_SIGN_P3
* REMAP_SIGN_P4
* REMAP_SIGN_P5
* REMAP_SIGN_P6
* REMAP_SIGN_P7]
*/
void Adafruit_BNO055::setAxisSign(adafruit_bno055_axis_remap_sign_t remapsign) {
adafruit_bno055_opmode_t modeback = _mode;
setMode(OPERATION_MODE_CONFIG);
delay(25);
write8(BNO055_AXIS_MAP_SIGN_ADDR, remapsign);
delay(10);
/* Set the requested operating mode (see section 3.3) */
setMode(modeback);
delay(20);
}
/*!
* @brief Use the external 32.768KHz crystal
* @param usextal
* use external crystal boolean
*/
void Adafruit_BNO055::setExtCrystalUse(bool usextal) {
adafruit_bno055_opmode_t modeback = _mode;
/* Switch to config mode (just in case since this is the default) */
setMode(OPERATION_MODE_CONFIG);
delay(25);
write8(BNO055_PAGE_ID_ADDR, 0);
if (usextal) {
write8(BNO055_SYS_TRIGGER_ADDR, 0x80);
} else {
write8(BNO055_SYS_TRIGGER_ADDR, 0x00);
}
delay(10);
/* Set the requested operating mode (see section 3.3) */
setMode(modeback);
delay(20);
}
/*!
* @brief Gets the latest system status info
* @param system_status
* system status info
* @param self_test_result
* self test result
* @param system_error
* system error info
*/
void Adafruit_BNO055::getSystemStatus(uint8_t *system_status,
uint8_t *self_test_result,
uint8_t *system_error) {
write8(BNO055_PAGE_ID_ADDR, 0);
/* System Status (see section 4.3.58)
0 = Idle
1 = System Error
2 = Initializing Peripherals
3 = System Iniitalization
4 = Executing Self-Test
5 = Sensor fusio algorithm running
6 = System running without fusion algorithms
*/
if (system_status != 0)
*system_status = read8(BNO055_SYS_STAT_ADDR);
/* Self Test Results
1 = test passed, 0 = test failed
Bit 0 = Accelerometer self test
Bit 1 = Magnetometer self test
Bit 2 = Gyroscope self test
Bit 3 = MCU self test
0x0F = all good!
*/
if (self_test_result != 0)
*self_test_result = read8(BNO055_SELFTEST_RESULT_ADDR);
/* System Error (see section 4.3.59)
0 = No error
1 = Peripheral initialization error
2 = System initialization error
3 = Self test result failed
4 = Register map value out of range
5 = Register map address out of range
6 = Register map write error
7 = BNO low power mode not available for selected operat ion mode
8 = Accelerometer power mode not available
9 = Fusion algorithm configuration error
A = Sensor configuration error
*/
if (system_error != 0)
*system_error = read8(BNO055_SYS_ERR_ADDR);
delay(200);
}
/*!
* @brief Gets the chip revision numbers
* @param info
* revision info
*/
void Adafruit_BNO055::getRevInfo(adafruit_bno055_rev_info_t *info) {
uint8_t a, b;
memset(info, 0, sizeof(adafruit_bno055_rev_info_t));
/* Check the accelerometer revision */
info->accel_rev = read8(BNO055_ACCEL_REV_ID_ADDR);
/* Check the magnetometer revision */
info->mag_rev = read8(BNO055_MAG_REV_ID_ADDR);
/* Check the gyroscope revision */
info->gyro_rev = read8(BNO055_GYRO_REV_ID_ADDR);
/* Check the SW revision */
info->bl_rev = read8(BNO055_BL_REV_ID_ADDR);
a = read8(BNO055_SW_REV_ID_LSB_ADDR);
b = read8(BNO055_SW_REV_ID_MSB_ADDR);
info->sw_rev = (((uint16_t)b) << 8) | ((uint16_t)a);
}
/*!
* @brief Gets current calibration state. Each value should be a uint8_t
* pointer and it will be set to 0 if not calibrated and 3 if
* fully calibrated.
* See section 34.3.54
* @param sys
* Current system calibration status, depends on status of all sensors,
* read-only
* @param gyro
* Current calibration status of Gyroscope, read-only
* @param accel
* Current calibration status of Accelerometer, read-only
* @param mag
* Current calibration status of Magnetometer, read-only
*/
void Adafruit_BNO055::getCalibration(uint8_t *sys, uint8_t *gyro,
uint8_t *accel, uint8_t *mag) {
uint8_t calData = read8(BNO055_CALIB_STAT_ADDR);
if (sys != NULL) {
*sys = (calData >> 6) & 0x03;
}
if (gyro != NULL) {
*gyro = (calData >> 4) & 0x03;
}
if (accel != NULL) {
*accel = (calData >> 2) & 0x03;
}
if (mag != NULL) {
*mag = calData & 0x03;
}
}
/*!
* @brief Gets the temperature in degrees celsius
* @return temperature in degrees celsius
*/
int8_t Adafruit_BNO055::getTemp() {
int8_t temp = (int8_t)(read8(BNO055_TEMP_ADDR));
return temp;
}
/*!
* @brief Gets a vector reading from the specified source
* @param vector_type
* possible vector type values
* [VECTOR_ACCELEROMETER
* VECTOR_MAGNETOMETER
* VECTOR_GYROSCOPE
* VECTOR_EULER
* VECTOR_LINEARACCEL
* VECTOR_GRAVITY]
* @return vector from specified source
*/
imu::Vector<3> Adafruit_BNO055::getVector(adafruit_vector_type_t vector_type) {
imu::Vector<3> xyz;
uint8_t buffer[6];
memset(buffer, 0, 6);
int16_t x, y, z;
x = y = z = 0;
/* Read vector data (6 bytes) */
readLen((adafruit_bno055_reg_t)vector_type, buffer, 6);
x = ((int16_t)buffer[0]) | (((int16_t)buffer[1]) << 8);
y = ((int16_t)buffer[2]) | (((int16_t)buffer[3]) << 8);
z = ((int16_t)buffer[4]) | (((int16_t)buffer[5]) << 8);
/*!
* Convert the value to an appropriate range (section 3.6.4)
* and assign the value to the Vector type
*/
switch (vector_type) {
case VECTOR_MAGNETOMETER:
/* 1uT = 16 LSB */
xyz[0] = ((double)x) / 16.0;
xyz[1] = ((double)y) / 16.0;
xyz[2] = ((double)z) / 16.0;
break;
case VECTOR_GYROSCOPE:
/* 1dps = 16 LSB */
xyz[0] = ((double)x) / 16.0;
xyz[1] = ((double)y) / 16.0;
xyz[2] = ((double)z) / 16.0;
break;
case VECTOR_EULER:
/* 1 degree = 16 LSB */
xyz[0] = ((double)x) / 16.0;
xyz[1] = ((double)y) / 16.0;
xyz[2] = ((double)z) / 16.0;
break;
case VECTOR_ACCELEROMETER:
/* 1m/s^2 = 100 LSB */
xyz[0] = ((double)x) / 100.0;
xyz[1] = ((double)y) / 100.0;
xyz[2] = ((double)z) / 100.0;
break;
case VECTOR_LINEARACCEL:
/* 1m/s^2 = 100 LSB */
xyz[0] = ((double)x) / 100.0;
xyz[1] = ((double)y) / 100.0;
xyz[2] = ((double)z) / 100.0;
break;
case VECTOR_GRAVITY:
/* 1m/s^2 = 100 LSB */
xyz[0] = ((double)x) / 100.0;
xyz[1] = ((double)y) / 100.0;
xyz[2] = ((double)z) / 100.0;
break;
}
return xyz;
}
/*!
* @brief Gets a quaternion reading from the specified source
* @return quaternion reading
*/
imu::Quaternion Adafruit_BNO055::getQuat() {
uint8_t buffer[8];
memset(buffer, 0, 8);
int16_t x, y, z, w;
x = y = z = w = 0;
/* Read quat data (8 bytes) */
readLen(BNO055_QUATERNION_DATA_W_LSB_ADDR, buffer, 8);
w = (((uint16_t)buffer[1]) << 8) | ((uint16_t)buffer[0]);
x = (((uint16_t)buffer[3]) << 8) | ((uint16_t)buffer[2]);
y = (((uint16_t)buffer[5]) << 8) | ((uint16_t)buffer[4]);
z = (((uint16_t)buffer[7]) << 8) | ((uint16_t)buffer[6]);
/*!
* Assign to Quaternion
* See
* https://cdn-shop.adafruit.com/datasheets/BST_BNO055_DS000_12.pdf
* 3.6.5.5 Orientation (Quaternion)
*/
const double scale = (1.0 / (1 << 14));
imu::Quaternion quat(scale * w, scale * x, scale * y, scale * z);
return quat;
}
/*!
* @brief Provides the sensor_t data for this sensor
* @param sensor
* Sensor description
*/
void Adafruit_BNO055::getSensor(sensor_t *sensor) {
/* Clear the sensor_t object */
memset(sensor, 0, sizeof(sensor_t));
/* Insert the sensor name in the fixed length char array */
strncpy(sensor->name, "BNO055", sizeof(sensor->name) - 1);
sensor->name[sizeof(sensor->name) - 1] = 0;
sensor->version = 1;
sensor->sensor_id = _sensorID;
sensor->type = SENSOR_TYPE_ORIENTATION;
sensor->min_delay = 0;
sensor->max_value = 0.0F;
sensor->min_value = 0.0F;
sensor->resolution = 0.01F;
}
/*!
* @brief Reads the sensor and returns the data as a sensors_event_t
* @param event
* Event description
* @return always returns true
*/
bool Adafruit_BNO055::getEvent(sensors_event_t *event) {
/* Clear the event */
memset(event, 0, sizeof(sensors_event_t));
event->version = sizeof(sensors_event_t);
event->sensor_id = _sensorID;
event->type = SENSOR_TYPE_ORIENTATION;
event->timestamp = millis();
/* Get a Euler angle sample for orientation */
imu::Vector<3> euler = getVector(Adafruit_BNO055::VECTOR_EULER);
event->orientation.x = euler.x();
event->orientation.y = euler.y();
event->orientation.z = euler.z();
return true;
}
/*!
* @brief Reads the sensor and returns the data as a sensors_event_t
* @param event
* Event description
* @param vec_type
* specify the type of reading
* @return always returns true
*/
bool Adafruit_BNO055::getEvent(sensors_event_t *event,
adafruit_vector_type_t vec_type) {
/* Clear the event */
memset(event, 0, sizeof(sensors_event_t));
event->version = sizeof(sensors_event_t);
event->sensor_id = _sensorID;
event->timestamp = millis();
// read the data according to vec_type
imu::Vector<3> vec;
if (vec_type == Adafruit_BNO055::VECTOR_LINEARACCEL) {
event->type = SENSOR_TYPE_LINEAR_ACCELERATION;
vec = getVector(Adafruit_BNO055::VECTOR_LINEARACCEL);
event->acceleration.x = vec.x();
event->acceleration.y = vec.y();
event->acceleration.z = vec.z();
} else if (vec_type == Adafruit_BNO055::VECTOR_ACCELEROMETER) {
event->type = SENSOR_TYPE_ACCELEROMETER;
vec = getVector(Adafruit_BNO055::VECTOR_ACCELEROMETER);
event->acceleration.x = vec.x();
event->acceleration.y = vec.y();
event->acceleration.z = vec.z();
} else if (vec_type == Adafruit_BNO055::VECTOR_GRAVITY) {
event->type = SENSOR_TYPE_ACCELEROMETER;
vec = getVector(Adafruit_BNO055::VECTOR_GRAVITY);
event->acceleration.x = vec.x();
event->acceleration.y = vec.y();
event->acceleration.z = vec.z();
} else if (vec_type == Adafruit_BNO055::VECTOR_EULER) {
event->type = SENSOR_TYPE_ORIENTATION;
vec = getVector(Adafruit_BNO055::VECTOR_EULER);
event->orientation.x = vec.x();
event->orientation.y = vec.y();
event->orientation.z = vec.z();
} else if (vec_type == Adafruit_BNO055::VECTOR_GYROSCOPE) {
event->type = SENSOR_TYPE_ROTATION_VECTOR;
vec = getVector(Adafruit_BNO055::VECTOR_GYROSCOPE);
event->gyro.x = vec.x();
event->gyro.y = vec.y();
event->gyro.z = vec.z();
} else if (vec_type == Adafruit_BNO055::VECTOR_MAGNETOMETER) {
event->type = SENSOR_TYPE_MAGNETIC_FIELD;
vec = getVector(Adafruit_BNO055::VECTOR_MAGNETOMETER);
event->magnetic.x = vec.x();
event->magnetic.y = vec.y();
event->magnetic.z = vec.z();
}
return true;
}
/*!
* @brief Reads the sensor's offset registers into a byte array
* @param calibData
* Calibration offset (buffer size should be 22)
* @return true if read is successful
*/
bool Adafruit_BNO055::getSensorOffsets(uint8_t *calibData) {
if (isFullyCalibrated()) {
adafruit_bno055_opmode_t lastMode = _mode;
setMode(OPERATION_MODE_CONFIG);
readLen(ACCEL_OFFSET_X_LSB_ADDR, calibData, NUM_BNO055_OFFSET_REGISTERS);
setMode(lastMode);
return true;
}
return false;
}
/*!
* @brief Reads the sensor's offset registers into an offset struct
* @param offsets_type
* type of offsets
* @return true if read is successful
*/
bool Adafruit_BNO055::getSensorOffsets(
adafruit_bno055_offsets_t &offsets_type) {
if (isFullyCalibrated()) {
adafruit_bno055_opmode_t lastMode = _mode;
setMode(OPERATION_MODE_CONFIG);
delay(25);
/* Accel offset range depends on the G-range:
+/-2g = +/- 2000 mg
+/-4g = +/- 4000 mg
+/-8g = +/- 8000 mg
+/-1§g = +/- 16000 mg */
offsets_type.accel_offset_x = (read8(ACCEL_OFFSET_X_MSB_ADDR) << 8) |
(read8(ACCEL_OFFSET_X_LSB_ADDR));
offsets_type.accel_offset_y = (read8(ACCEL_OFFSET_Y_MSB_ADDR) << 8) |
(read8(ACCEL_OFFSET_Y_LSB_ADDR));
offsets_type.accel_offset_z = (read8(ACCEL_OFFSET_Z_MSB_ADDR) << 8) |
(read8(ACCEL_OFFSET_Z_LSB_ADDR));
/* Magnetometer offset range = +/- 6400 LSB where 1uT = 16 LSB */
offsets_type.mag_offset_x =
(read8(MAG_OFFSET_X_MSB_ADDR) << 8) | (read8(MAG_OFFSET_X_LSB_ADDR));
offsets_type.mag_offset_y =
(read8(MAG_OFFSET_Y_MSB_ADDR) << 8) | (read8(MAG_OFFSET_Y_LSB_ADDR));
offsets_type.mag_offset_z =
(read8(MAG_OFFSET_Z_MSB_ADDR) << 8) | (read8(MAG_OFFSET_Z_LSB_ADDR));
/* Gyro offset range depends on the DPS range:
2000 dps = +/- 32000 LSB
1000 dps = +/- 16000 LSB
500 dps = +/- 8000 LSB
250 dps = +/- 4000 LSB
125 dps = +/- 2000 LSB
... where 1 DPS = 16 LSB */
offsets_type.gyro_offset_x =
(read8(GYRO_OFFSET_X_MSB_ADDR) << 8) | (read8(GYRO_OFFSET_X_LSB_ADDR));
offsets_type.gyro_offset_y =
(read8(GYRO_OFFSET_Y_MSB_ADDR) << 8) | (read8(GYRO_OFFSET_Y_LSB_ADDR));
offsets_type.gyro_offset_z =
(read8(GYRO_OFFSET_Z_MSB_ADDR) << 8) | (read8(GYRO_OFFSET_Z_LSB_ADDR));
/* Accelerometer radius = +/- 1000 LSB */
offsets_type.accel_radius =
(read8(ACCEL_RADIUS_MSB_ADDR) << 8) | (read8(ACCEL_RADIUS_LSB_ADDR));
/* Magnetometer radius = +/- 960 LSB */
offsets_type.mag_radius =
(read8(MAG_RADIUS_MSB_ADDR) << 8) | (read8(MAG_RADIUS_LSB_ADDR));
setMode(lastMode);
return true;
}
return false;
}
/*!
* @brief Writes an array of calibration values to the sensor's offset
* @param calibData
* calibration data
*/
void Adafruit_BNO055::setSensorOffsets(const uint8_t *calibData) {
adafruit_bno055_opmode_t lastMode = _mode;
setMode(OPERATION_MODE_CONFIG);
delay(25);
/* Note: Configuration will take place only when user writes to the last
byte of each config data pair (ex. ACCEL_OFFSET_Z_MSB_ADDR, etc.).
Therefore the last byte must be written whenever the user wants to
changes the configuration. */
/* A writeLen() would make this much cleaner */
write8(ACCEL_OFFSET_X_LSB_ADDR, calibData[0]);
write8(ACCEL_OFFSET_X_MSB_ADDR, calibData[1]);
write8(ACCEL_OFFSET_Y_LSB_ADDR, calibData[2]);
write8(ACCEL_OFFSET_Y_MSB_ADDR, calibData[3]);
write8(ACCEL_OFFSET_Z_LSB_ADDR, calibData[4]);
write8(ACCEL_OFFSET_Z_MSB_ADDR, calibData[5]);
write8(MAG_OFFSET_X_LSB_ADDR, calibData[6]);
write8(MAG_OFFSET_X_MSB_ADDR, calibData[7]);
write8(MAG_OFFSET_Y_LSB_ADDR, calibData[8]);
write8(MAG_OFFSET_Y_MSB_ADDR, calibData[9]);
write8(MAG_OFFSET_Z_LSB_ADDR, calibData[10]);
write8(MAG_OFFSET_Z_MSB_ADDR, calibData[11]);
write8(GYRO_OFFSET_X_LSB_ADDR, calibData[12]);
write8(GYRO_OFFSET_X_MSB_ADDR, calibData[13]);
write8(GYRO_OFFSET_Y_LSB_ADDR, calibData[14]);
write8(GYRO_OFFSET_Y_MSB_ADDR, calibData[15]);
write8(GYRO_OFFSET_Z_LSB_ADDR, calibData[16]);
write8(GYRO_OFFSET_Z_MSB_ADDR, calibData[17]);
write8(ACCEL_RADIUS_LSB_ADDR, calibData[18]);
write8(ACCEL_RADIUS_MSB_ADDR, calibData[19]);
write8(MAG_RADIUS_LSB_ADDR, calibData[20]);
write8(MAG_RADIUS_MSB_ADDR, calibData[21]);
setMode(lastMode);
}
/*!
* @brief Writes to the sensor's offset registers from an offset struct
* @param offsets_type
* accel_offset_x = acceleration offset x
* accel_offset_y = acceleration offset y
* accel_offset_z = acceleration offset z
*
* mag_offset_x = magnetometer offset x
* mag_offset_y = magnetometer offset y
* mag_offset_z = magnetometer offset z
*
* gyro_offset_x = gyroscrope offset x
* gyro_offset_y = gyroscrope offset y
* gyro_offset_z = gyroscrope offset z
*/
void Adafruit_BNO055::setSensorOffsets(
const adafruit_bno055_offsets_t &offsets_type) {
adafruit_bno055_opmode_t lastMode = _mode;
setMode(OPERATION_MODE_CONFIG);
delay(25);
/* Note: Configuration will take place only when user writes to the last
byte of each config data pair (ex. ACCEL_OFFSET_Z_MSB_ADDR, etc.).
Therefore the last byte must be written whenever the user wants to
changes the configuration. */
write8(ACCEL_OFFSET_X_LSB_ADDR, (offsets_type.accel_offset_x) & 0x0FF);
write8(ACCEL_OFFSET_X_MSB_ADDR, (offsets_type.accel_offset_x >> 8) & 0x0FF);
write8(ACCEL_OFFSET_Y_LSB_ADDR, (offsets_type.accel_offset_y) & 0x0FF);
write8(ACCEL_OFFSET_Y_MSB_ADDR, (offsets_type.accel_offset_y >> 8) & 0x0FF);
write8(ACCEL_OFFSET_Z_LSB_ADDR, (offsets_type.accel_offset_z) & 0x0FF);
write8(ACCEL_OFFSET_Z_MSB_ADDR, (offsets_type.accel_offset_z >> 8) & 0x0FF);
write8(MAG_OFFSET_X_LSB_ADDR, (offsets_type.mag_offset_x) & 0x0FF);
write8(MAG_OFFSET_X_MSB_ADDR, (offsets_type.mag_offset_x >> 8) & 0x0FF);
write8(MAG_OFFSET_Y_LSB_ADDR, (offsets_type.mag_offset_y) & 0x0FF);
write8(MAG_OFFSET_Y_MSB_ADDR, (offsets_type.mag_offset_y >> 8) & 0x0FF);
write8(MAG_OFFSET_Z_LSB_ADDR, (offsets_type.mag_offset_z) & 0x0FF);
write8(MAG_OFFSET_Z_MSB_ADDR, (offsets_type.mag_offset_z >> 8) & 0x0FF);
write8(GYRO_OFFSET_X_LSB_ADDR, (offsets_type.gyro_offset_x) & 0x0FF);
write8(GYRO_OFFSET_X_MSB_ADDR, (offsets_type.gyro_offset_x >> 8) & 0x0FF);
write8(GYRO_OFFSET_Y_LSB_ADDR, (offsets_type.gyro_offset_y) & 0x0FF);
write8(GYRO_OFFSET_Y_MSB_ADDR, (offsets_type.gyro_offset_y >> 8) & 0x0FF);
write8(GYRO_OFFSET_Z_LSB_ADDR, (offsets_type.gyro_offset_z) & 0x0FF);
write8(GYRO_OFFSET_Z_MSB_ADDR, (offsets_type.gyro_offset_z >> 8) & 0x0FF);
write8(ACCEL_RADIUS_LSB_ADDR, (offsets_type.accel_radius) & 0x0FF);
write8(ACCEL_RADIUS_MSB_ADDR, (offsets_type.accel_radius >> 8) & 0x0FF);
write8(MAG_RADIUS_LSB_ADDR, (offsets_type.mag_radius) & 0x0FF);
write8(MAG_RADIUS_MSB_ADDR, (offsets_type.mag_radius >> 8) & 0x0FF);
setMode(lastMode);
}
/*!
* @brief Checks of all cal status values are set to 3 (fully calibrated)
* @return status of calibration
*/
bool Adafruit_BNO055::isFullyCalibrated() {
uint8_t system, gyro, accel, mag;
getCalibration(&system, &gyro, &accel, &mag);
switch (_mode) {
case OPERATION_MODE_ACCONLY:
return (accel == 3);
case OPERATION_MODE_MAGONLY:
return (mag == 3);
case OPERATION_MODE_GYRONLY:
case OPERATION_MODE_M4G: /* No magnetometer calibration required. */
return (gyro == 3);
case OPERATION_MODE_ACCMAG:
case OPERATION_MODE_COMPASS:
return (accel == 3 && mag == 3);
case OPERATION_MODE_ACCGYRO:
case OPERATION_MODE_IMUPLUS:
return (accel == 3 && gyro == 3);
case OPERATION_MODE_MAGGYRO:
return (mag == 3 && gyro == 3);
default:
return (system == 3 && gyro == 3 && accel == 3 && mag == 3);
}
}
/*!
* @brief Enter Suspend mode (i.e., sleep)
*/
void Adafruit_BNO055::enterSuspendMode() {
adafruit_bno055_opmode_t modeback = _mode;
/* Switch to config mode (just in case since this is the default) */
setMode(OPERATION_MODE_CONFIG);
delay(25);
write8(BNO055_PWR_MODE_ADDR, 0x02);
/* Set the requested operating mode (see section 3.3) */
setMode(modeback);
delay(20);
}
/*!
* @brief Enter Normal mode (i.e., wake)
*/
void Adafruit_BNO055::enterNormalMode() {
adafruit_bno055_opmode_t modeback = _mode;
/* Switch to config mode (just in case since this is the default) */
setMode(OPERATION_MODE_CONFIG);
delay(25);
write8(BNO055_PWR_MODE_ADDR, 0x00);
/* Set the requested operating mode (see section 3.3) */
setMode(modeback);
delay(20);
}
/*!
* @brief Writes an 8 bit value over I2C
*/
bool Adafruit_BNO055::write8(adafruit_bno055_reg_t reg, byte value) {
_wire->beginTransmission(_address);
#if ARDUINO >= 100
_wire->write((uint8_t)reg);
_wire->write((uint8_t)value);
#else
_wire->send(reg);
_wire->send(value);
#endif
_wire->endTransmission();
/* ToDo: Check for error! */
return true;
}
/*!
* @brief Reads an 8 bit value over I2C
*/
byte Adafruit_BNO055::read8(adafruit_bno055_reg_t reg) {
byte value = 0;
_wire->beginTransmission(_address);
#if ARDUINO >= 100
_wire->write((uint8_t)reg);
#else
_wire->send(reg);
#endif
_wire->endTransmission();
_wire->requestFrom(_address, (byte)1);
#if ARDUINO >= 100
value = _wire->read();
#else
value = _wire->receive();
#endif
return value;
}
/*!
* @brief Reads the specified number of bytes over I2C
*/
bool Adafruit_BNO055::readLen(adafruit_bno055_reg_t reg, byte *buffer,
uint8_t len) {
_wire->beginTransmission(_address);
#if ARDUINO >= 100
_wire->write((uint8_t)reg);
#else
_wire->send(reg);
#endif
_wire->endTransmission();
_wire->requestFrom(_address, (byte)len);
for (uint8_t i = 0; i < len; i++) {
#if ARDUINO >= 100
buffer[i] = _wire->read();
#else
buffer[i] = _wire->receive();
#endif
}
/* ToDo: Check for errors! */
return true;
}
| [
"meabru@gmail.com"
] | meabru@gmail.com |
e201888b12124c30b9eb47f5048396e5d2eb2249 | 7111c4bed898072005bc4e06a221e31303c2f61e | /Week_03/code/二叉树的最近公共祖先.cpp | 79664d9e2852e67d5e41c939d019684f953ac66d | [] | no_license | Sunrise-123/algorithm017 | 9dfa3d21c02060c618abd49fc26a18e93b54a6cc | 9d2e46f4377b8d2f0368708ed53caf8aead85f0a | refs/heads/master | 2023-01-27T11:43:31.510468 | 2020-12-13T01:39:32 | 2020-12-13T01:39:32 | 298,916,748 | 0 | 0 | null | 2020-09-26T23:29:50 | 2020-09-26T23:29:50 | null | GB18030 | C++ | false | false | 1,247 | cpp | //思路：
// 最近公共祖先所满足的条件：(leftSon && rightSon) ||((x==p || x== q) && (leftSon || rightSon))
// 即: 1.左子树和右子树分别包含 p和q;
// 2.当前结点x为p或q,同时该节点的左子树或右子树为q或p
// 以上两个条件只要满足其一，即可得到最近公共祖先
//
// 法1：递归。 时间复杂度：O(n)
class Solution {
public:
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
if (!root || root == p || root == q) return root;
TreeNode *left = lowestCommonAncestor(root->left, p, q);
TreeNode *right = lowestCommonAncestor(root->right, p, q);
if (left && right) return root;
return left ? left : right;
}
};
class Solution {
public:
TreeNode* ans;
bool dfs(TreeNode* root, TreeNode* p, TreeNode* q) {
if (root == NULL) return false;
bool leftson = dfs(root->left, p, q);
bool rightson = dfs(root->right, p, q);
if ((leftson && rightson) || ((root->val == p->val || root->val == q->val) && (leftson || rightson))) {
ans = root;
}
return leftson || rightson || (root->val == p->val || root->val == q->val);
}
TreeNode* lowestCommonAncestor(TreeNode* root, TreeNode* p, TreeNode* q) {
dfs(root, p, q);
return ans;
}
}; | [
"hxf6020@126.com"
] | hxf6020@126.com |
b7e72c2725f1ebb395c64a6d9a001bc295e12d1f | ec0e1779383bec96de803ba893de5096c563158f | /tensorflow/core/ops/array_ops.cc | 42bc1d84dc6feb4cce98d50410b23fdfe085c191 | [] | no_license | DengZhuangSouthRd/simple_tensorflow | 45d8fc7c2ef9da947f11f876aff7c1e169dc457c | 83d742219c4a04c61822935487626890bc735301 | refs/heads/master | 2021-01-18T19:05:36.414639 | 2017-04-01T15:06:16 | 2017-04-01T15:06:16 | 86,887,616 | 11 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 176,886 | cc | /* Copyright 2015 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
==============================================================================*/
#include "tensorflow/core/framework/common_shape_fns.h"
#include "tensorflow/core/framework/op.h"
#include "tensorflow/core/framework/shape_inference.h"
#include "tensorflow/core/util/mirror_pad_mode.h"
#include "tensorflow/core/util/padding.h"
#include "tensorflow/core/util/strided_slice_op.h"
namespace tensorflow {
using shape_inference::DimensionHandle;
using shape_inference::InferenceContext;
using shape_inference::ShapeHandle;
namespace {
Status GetAxisForPackAndUnpack(InferenceContext* c, int32 rank_after_pack,
int32* axis) {
TF_RETURN_IF_ERROR(c->GetAttr("axis", axis));
if (*axis < -1 * rank_after_pack || *axis >= rank_after_pack) {
return errors::InvalidArgument("Invalid axis: ", *axis, "; must be in [",
-1 * rank_after_pack, ",", rank_after_pack,
")");
}
if (*axis < 0) *axis = (rank_after_pack + *axis);
return Status::OK();
}
template <typename T>
std::vector<int64> AsInt64(const Tensor* tensor, int num_elements) {
std::vector<int64> ret(num_elements);
auto data = tensor->vec<T>();
for (int i = 0; i < num_elements; ++i) {
ret[i] = data(i);
}
return ret;
}
template <typename T>
Status PadKnown(InferenceContext* c, ShapeHandle input,
const Tensor* paddings_t, int32 num_dims) {
// paddings_t is known.
std::vector<DimensionHandle> dims(num_dims);
auto paddings_data = paddings_t->matrix<T>();
for (int i = 0; i < num_dims; ++i) {
const T pad0 = paddings_data(i, 0);
const T pad1 = paddings_data(i, 1);
if (pad0 < 0 || pad1 < 0) {
return errors::InvalidArgument("Paddings must be non-negative");
}
TF_RETURN_IF_ERROR(c->Add(c->Dim(input, i), pad0 + pad1, &dims[i]));
}
c->set_output(0, c->MakeShape(dims));
return Status::OK();
}
Status PadShapeFn(InferenceContext* c) {
// Paddings is a matrix of [input_rank, 2].
ShapeHandle paddings;
TF_RETURN_IF_ERROR(c->WithRank(c->input(1), 2, &paddings));
DimensionHandle unused;
TF_RETURN_IF_ERROR(c->WithValue(c->Dim(paddings, 1), 2, &unused));
// n_dim and input.rank are equivalent.
ShapeHandle input = c->input(0);
DimensionHandle n_dim = c->Dim(paddings, 0);
if (c->ValueKnown(n_dim)) {
TF_RETURN_IF_ERROR(c->WithRank(input, c->Value(n_dim), &input));
} else if (c->RankKnown(input)) {
TF_RETURN_IF_ERROR(c->WithValue(n_dim, c->Rank(input), &n_dim));
}
const Tensor* paddings_t = c->input_tensor(1);
// paddings_t is unknown
if (paddings_t == nullptr) {
if (c->ValueKnown(n_dim)) {
// Make output with n_dim unknown dims.
c->set_output(0, c->UnknownShapeOfRank(c->Value(n_dim)));
} else {
c->set_output(0, c->UnknownShape());
}
return Status::OK();
}
const int64 num_dims = paddings_t->shape().dim_size(0);
TF_RETURN_IF_ERROR(c->WithRank(input, num_dims, &input));
TF_RETURN_IF_ERROR(c->WithValue(n_dim, num_dims, &n_dim));
if (paddings_t->dtype() == DT_INT32) {
return PadKnown<int32>(c, input, paddings_t, num_dims);
} else {
return PadKnown<int64>(c, input, paddings_t, num_dims);
}
}
Status SetOutputShapeForReshape(InferenceContext* c) {
ShapeHandle in = c->input(0);
ShapeHandle out;
TF_RETURN_IF_ERROR(c->MakeShapeFromShapeTensor(1, &out));
if (!c->RankKnown(out)) {
// We have no information about the shape of the output.
c->set_output(0, out);
return Status::OK();
}
DimensionHandle num_in_elems = c->NumElements(in);
if (c->FullyDefined(out)) {
DimensionHandle num_out_elems = c->NumElements(out);
if (c->ValueKnown(num_in_elems) &&
c->Value(num_in_elems) != c->Value(num_out_elems)) {
return errors::InvalidArgument(
"Cannot reshape a tensor with ", c->DebugString(num_in_elems),
" elements to shape ", c->DebugString(out), " (",
c->DebugString(num_out_elems), " elements)");
}
c->set_output(0, out);
return Status::OK();
}
if (c->ValueKnown(num_in_elems)) {
// We don't know the number of output elements, but we can try to infer
// the missing dimension.
int32 unknown_idx = -1;
bool too_many_unknown = false;
DimensionHandle known_elems = c->MakeDim(1);
for (int32 i = 0; i < c->Rank(out); ++i) {
DimensionHandle dim = c->Dim(out, i);
if (!c->ValueKnown(dim)) {
if (unknown_idx >= 0) {
too_many_unknown = true;
break;
}
unknown_idx = i;
} else {
TF_RETURN_IF_ERROR(c->Multiply(known_elems, dim, &known_elems));
}
}
if (!too_many_unknown && c->Value(known_elems) != 0) {
DimensionHandle inferred_dim;
TF_RETURN_IF_ERROR(c->Divide(num_in_elems, c->Value(known_elems),
true /* evenly_divisible */, &inferred_dim));
TF_RETURN_IF_ERROR(c->ReplaceDim(out, unknown_idx, inferred_dim, &out));
}
}
c->set_output(0, out);
return Status::OK();
}
} // namespace
REGISTER_OP("ParallelConcat")
.Input("values: N * T")
.Output("output: T")
.Attr("N: int >= 1")
.Attr("T: type")
.Attr("shape: shape")
.SetShapeFn([](InferenceContext* c) {
// Validate that the shape attr is correct.
TensorShapeProto passed_shape_proto;
TF_RETURN_IF_ERROR(c->GetAttr("shape", &passed_shape_proto));
ShapeHandle passed_shape;
TF_RETURN_IF_ERROR(
c->MakeShapeFromShapeProto(passed_shape_proto, &passed_shape));
if (!c->FullyDefined(passed_shape)) {
return errors::InvalidArgument("shape attr must be fully defined.");
}
ShapeHandle cur;
TF_RETURN_IF_ERROR(c->ReplaceDim(
passed_shape, 0, c->MakeDim(shape_inference::DimensionOrConstant(1)),
&cur));
for (int i = 0; i < c->num_inputs(); ++i) {
if (!c->FullyDefined(c->input(i))) {
return errors::InvalidArgument(
"All input shapes must be fully defined.");
}
DimensionHandle unused;
if (!c->WithValue(c->Dim(c->input(i), 0), 1, &unused).ok()) {
return errors::InvalidArgument("Size of first dimension must be 1.");
}
TF_RETURN_WITH_CONTEXT_IF_ERROR(c->Merge(c->input(i), cur, &cur),
"From merging shape ", i,
" with other shapes.");
}
c->set_output(0, passed_shape);
return Status::OK();
})
.Doc(R"doc(
Concatenates a list of `N` tensors along the first dimension.
The input tensors are all required to have size 1 in the first dimension.
For example:
```prettyprint
# 'x' is [[1, 4]]
# 'y' is [[2, 5]]
# 'z' is [[3, 6]]
parallel_concat([x, y, z]) => [[1, 4], [2, 5], [3, 6]] # Pack along first dim.
```
The difference between concat and parallel_concat is that concat requires all
of the inputs be computed before the operation will begin but doesn't require
that the input shapes be known during graph construction. Parallel concat
will copy pieces of the input into the output as they become available, in
some situations this can provide a performance benefit.
values: Tensors to be concatenated. All must have size 1 in the first dimension
and same shape.
output: The concatenated tensor.
shape: the final shape of the result; should be equal to the shapes of any input
but with the number of input values in the first dimension.
)doc");
REGISTER_OP("Pack")
.Input("values: N * T")
.Output("output: T")
.Attr("N: int >= 1")
.Attr("T: type")
.Attr("axis: int = 0")
.SetShapeFn([](InferenceContext* c) {
// Validate shapes of all inputs are compatible
ShapeHandle cur = c->input(c->num_inputs() - 1);
for (int i = c->num_inputs() - 2; i >= 0; --i) {
TF_RETURN_WITH_CONTEXT_IF_ERROR(c->Merge(c->input(i), cur, &cur),
"From merging shape ", i,
" with other shapes.");
}
if (!c->RankKnown(cur)) {
c->set_output(0, c->UnknownShape());
return Status::OK();
}
// Determine the axis that will be added, converting from negative
// axes to a positive point per negative indexing rules.
int32 rank = c->Rank(cur);
int32 axis;
TF_RETURN_IF_ERROR(GetAxisForPackAndUnpack(c, rank + 1, &axis));
// Copy all dimensions over, inserting a dimension of value #inputs
// at <axis>.
std::vector<DimensionHandle> dims;
int index = 0;
while (index < axis) dims.push_back(c->Dim(cur, index++));
dims.push_back(c->MakeDim(c->num_inputs()));
while (index < rank) dims.push_back(c->Dim(cur, index++));
c->set_output(0, c->MakeShape(dims));
return Status::OK();
})
.Doc(R"doc(
Packs a list of `N` rank-`R` tensors into one rank-`(R+1)` tensor.
Packs the `N` tensors in `values` into a tensor with rank one higher than each
tensor in `values`, by packing them along the `axis` dimension.
Given a list of tensors of shape `(A, B, C)`;
if `axis == 0` then the `output` tensor will have the shape `(N, A, B, C)`.
if `axis == 1` then the `output` tensor will have the shape `(A, N, B, C)`.
Etc.
For example:
```prettyprint
# 'x' is [1, 4]
# 'y' is [2, 5]
# 'z' is [3, 6]
pack([x, y, z]) => [[1, 4], [2, 5], [3, 6]] # Pack along first dim.
pack([x, y, z], axis=1) => [[1, 2, 3], [4, 5, 6]]
```
This is the opposite of `unpack`.
values: Must be of same shape and type.
axis: Dimension along which to pack. Negative values wrap around, so the
valid range is `[-(R+1), R+1)`.
output: The packed tensor.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("Unpack")
.Input("value: T")
.Output("output: num * T")
.Attr("num: int >= 0")
.Attr("T: type")
.Attr("axis: int = 0")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle s = c->input(0);
ShapeHandle out;
if (c->RankKnown(s)) {
// Determine the axis that will be removed, converting from negative
// axes to a positive point per negative indexing rules.
int32 rank = c->Rank(s);
int32 axis;
TF_RETURN_IF_ERROR(GetAxisForPackAndUnpack(c, rank, &axis));
// The axis dim matches the number of outputs.
DimensionHandle unused;
TF_RETURN_IF_ERROR(
c->WithValue(c->Dim(s, axis), c->num_outputs(), &unused));
// Copy all dimensions, removing the <axis> dimension.
std::vector<DimensionHandle> dims;
for (int i = 0; i < rank; ++i) {
if (i != axis) dims.push_back(c->Dim(s, i));
}
out = c->MakeShape(dims);
} else {
// All outputs are the same shape, but it's not known.
out = c->UnknownShape();
}
for (int i = 0; i < c->num_outputs(); ++i) c->set_output(i, out);
return Status::OK();
})
.Doc(R"doc(
Unpacks a given dimension of a rank-`R` tensor into `num` rank-`(R-1)` tensors.
Unpacks `num` tensors from `value` by chipping it along the `axis` dimension.
For example, given a tensor of shape `(A, B, C, D)`;
If `axis == 0` then the i'th tensor in `output` is the slice `value[i, :, :, :]`
and each tensor in `output` will have shape `(B, C, D)`. (Note that the
dimension unpacked along is gone, unlike `split`).
If `axis == 1` then the i'th tensor in `output` is the slice `value[:, i, :, :]`
and each tensor in `output` will have shape `(A, C, D)`.
Etc.
This is the opposite of `pack`.
value: 1-D or higher, with `axis` dimension size equal to `num`.
axis: Dimension along which to unpack. Negative values wrap around, so the
valid range is `[-R, R)`.
output: The list of tensors unpacked from `value`.
)doc");
// --------------------------------------------------------------------------
// TODO(josh11b): Remove the >= 2 constraint, once we can rewrite the graph
// in the N == 1 case to remove the node.
REGISTER_OP("Concat")
.Input("concat_dim: int32")
.Input("values: N * T")
.Output("output: T")
.Attr("N: int >= 2")
.Attr("T: type")
.SetShapeFn([](InferenceContext* c) {
return shape_inference::ConcatShape(c, c->num_inputs() - 1);
})
.Doc(R"doc(
Concatenates tensors along one dimension.
concat_dim: 0-D. The dimension along which to concatenate. Must be in the
range [0, rank(values)).
values: The `N` Tensors to concatenate. Their ranks and types must match,
and their sizes must match in all dimensions except `concat_dim`.
output: A `Tensor` with the concatenation of values stacked along the
`concat_dim` dimension. This tensor's shape matches that of `values` except
in `concat_dim` where it has the sum of the sizes.
)doc");
REGISTER_OP("ConcatV2")
.Input("values: N * T")
.Input("axis: Tidx")
.Output("output: T")
.Attr("N: int >= 2")
.Attr("T: type")
.Attr("Tidx: {int32, int64} = DT_INT32")
.SetShapeFn(shape_inference::ConcatV2Shape)
.Doc(R"doc(
Concatenates tensors along one dimension.
values: List of `N` Tensors to concatenate. Their ranks and types must match,
and their sizes must match in all dimensions except `concat_dim`.
axis: 0-D. The dimension along which to concatenate. Must be in the
range [-rank(values), rank(values)).
output: A `Tensor` with the concatenation of values stacked along the
`concat_dim` dimension. This tensor's shape matches that of `values` except
in `concat_dim` where it has the sum of the sizes.
)doc");
REGISTER_OP("ConcatOffset")
.Input("concat_dim: int32")
.Input("shape: N * int32")
.Output("offset: N * int32")
.Attr("N: int >= 2")
.SetShapeFn([](InferenceContext* c) {
for (int i = 1; i < c->num_inputs(); ++i) {
c->set_output(i - 1, c->input(i));
}
return Status::OK();
})
.Doc(R"doc(
Computes offsets of concat inputs within its output.
For example:
```prettyprint
# 'x' is [2, 2, 7]
# 'y' is [2, 3, 7]
# 'z' is [2, 5, 7]
concat_offset(2, [x, y, z]) => [0, 0, 0], [0, 2, 0], [0, 5, 0]
```
concat_dim: The dimension along which to concatenate.
shape: The `N` int32 vectors representing shape of tensors being concatenated.
offset: The `N` int32 vectors representing the starting offset
of input tensors within the concatenated output.
This is typically used by gradient computations for a concat operation.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("Split")
.Input("split_dim: int32")
.Input("value: T")
.Output("output: num_split * T")
.Attr("num_split: int >= 1")
.Attr("T: type")
.SetShapeFn([](InferenceContext* c) {
DimensionHandle split_dimension;
TF_RETURN_IF_ERROR(c->MakeDimForScalarInput(0, &split_dimension));
int num_split = c->num_outputs();
ShapeHandle input = c->input(1);
ShapeHandle out;
if (!c->ValueKnown(split_dimension)) {
if (c->RankKnown(input)) {
out = c->UnknownShapeOfRank(c->Rank(input));
} else {
out = c->UnknownShape();
}
} else {
int64 split_dim = c->Value(split_dimension);
TF_RETURN_IF_ERROR(c->WithRankAtLeast(input, split_dim + 1, &input));
DimensionHandle split_dim_size;
TF_RETURN_WITH_CONTEXT_IF_ERROR(
c->Divide(c->Dim(input, split_dim), num_split,
true /* evenly_divisible */, &split_dim_size),
"Number of ways to split should evenly divide the split dimension");
TF_RETURN_IF_ERROR(
c->ReplaceDim(input, split_dim, split_dim_size, &out));
}
for (int i = 0; i < num_split; ++i) c->set_output(i, out);
return Status::OK();
})
.Doc(R"doc(
Splits a tensor into `num_split` tensors along one dimension.
split_dim: 0-D. The dimension along which to split. Must be in the range
`[0, rank(value))`.
num_split: The number of ways to split. Must evenly divide
`value.shape[split_dim]`.
value: The tensor to split.
output: They are identically shaped tensors, whose shape matches that of `value`
except along `split_dim`, where their sizes are
`values.shape[split_dim] / num_split`.
)doc");
REGISTER_OP("SplitV")
.Input("value: T")
.Input("size_splits: Tlen")
.Input("split_dim: int32")
.Output("output: num_split * T")
.Attr("num_split: int >= 1")
.Attr("T: type")
.Attr("Tlen: {int32, int64} = DT_INT64")
.SetShapeFn([](InferenceContext* c) {
DimensionHandle split_dimension;
TF_RETURN_IF_ERROR(c->MakeDimForScalarInput(2, &split_dimension));
int32 num_outputs = c->num_outputs();
ShapeHandle input = c->input(0);
int32 rank = c->Rank(input);
ShapeHandle output_shape;
const Tensor* size_splits = c->input_tensor(1);
if (rank == InferenceContext::kUnknownRank) {
// If the rank of input tensor is unknown, then return unkown shapes.
output_shape = c->UnknownShape();
for (int i = 0; i < num_outputs; ++i) {
c->set_output(i, output_shape);
}
} else if (rank == 0) {
// Throw error if input is a scalar.
return errors::InvalidArgument("Can't split scalars");
} else if (size_splits == nullptr || !c->ValueKnown(split_dimension)) {
// If split dimension or tensor containing the split sizes is unkown,
// then return unknown shapes of same rank as input.
output_shape = c->UnknownShapeOfRank(rank);
for (int i = 0; i < num_outputs; ++i) {
c->set_output(i, output_shape);
}
} else {
// Determine the output shape if split dimension and split sizes are
// known.
int64 split_dim = c->Value(split_dimension);
TF_RETURN_IF_ERROR(c->WithRankAtLeast(input, split_dim + 1, &input));
std::vector<int64> data;
if (size_splits->dtype() == DT_INT32) {
data = AsInt64<int32>(size_splits, size_splits->shape().dim_size(0));
} else {
data = AsInt64<int64>(size_splits, size_splits->shape().dim_size(0));
}
if (num_outputs != data.size()) {
return errors::InvalidArgument(
"Length of size_splits should be equal to num_outputs");
}
for (int i = 0; i < num_outputs; ++i) {
output_shape = c->UnknownShapeOfRank(rank);
TF_RETURN_IF_ERROR(c->ReplaceDim(input, split_dim,
c->MakeDim(data[i]), &output_shape));
c->set_output(i, output_shape);
}
}
return Status::OK();
})
.Doc(R"doc(
Splits a tensor into `num_split` tensors along one dimension.
value: The tensor to split.
size_splits: list containing the sizes of each output tensor along the split
dimension. Must sum to the dimension of value along split_dim.
Can contain one -1 indicating that dimension is to be inferred.
split_dim: 0-D. The dimension along which to split. Must be in the range
`[0, rank(value))`.
output: Tensors whose shape matches that of `value`
except along `split_dim`, where their sizes are
`size_splits[i]`.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("Const")
.Output("output: dtype")
.Attr("value: tensor")
.Attr("dtype: type")
.SetShapeFn([](InferenceContext* c) {
const TensorProto* proto = nullptr;
TF_RETURN_IF_ERROR(c->GetAttr("value", &proto));
TF_RETURN_IF_ERROR(TensorShape::IsValidShape(proto->tensor_shape()));
TensorShape shape(proto->tensor_shape());
std::vector<DimensionHandle> dims;
for (int i = 0; i < shape.dims(); ++i) {
dims.push_back(c->MakeDim(shape.dim_size(i)));
}
c->set_output(0, c->MakeShape(dims));
return Status::OK();
})
.Doc(R"doc(
Returns a constant tensor.
value: Attr `value` is the tensor to return.
)doc");
// --------------------------------------------------------------------------
// TODO(mgubin): Update the doc when the freeze_graph script supports converting
// into memmapped format.
REGISTER_OP("ImmutableConst")
.Attr("dtype: type")
.Attr("shape: shape")
.Attr("memory_region_name: string")
.Output("tensor: dtype")
.SetShapeFn([](InferenceContext* c) {
TensorShape shape_from_attr;
TF_RETURN_IF_ERROR(c->GetAttr("shape", &shape_from_attr));
TensorShapeProto shape_proto;
shape_from_attr.AsProto(&shape_proto);
ShapeHandle output_shape;
TF_RETURN_IF_ERROR(
c->MakeShapeFromShapeProto(shape_proto, &output_shape));
c->set_output(0, output_shape);
return Status::OK();
})
.Doc(R"doc(
Returns immutable tensor from memory region.
The current implementation memmaps the tensor from a file.
dtype: Type of the returned tensor.
shape: Shape of the returned tensor.
memory_region_name: Name of readonly memory region used by the tensor, see
NewReadOnlyMemoryRegionFromFile in tensorflow::Env.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("ZerosLike")
.Input("x: T")
.Output("y: T")
.Attr("T: type")
.SetShapeFn(shape_inference::UnchangedShape)
.Doc(R"doc(
Returns a tensor of zeros with the same shape and type as x.
x: a tensor of type T.
y: a tensor of the same shape and type as x but filled with zeros.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("Diag")
.Input("diagonal: T")
.Output("output: T")
.Attr("T: {float, double, int32, int64, complex64, complex128}")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle in = c->input(0);
TF_RETURN_IF_ERROR(c->WithRankAtMost(in, 3, &in));
// Output shape is original concatenated with itself.
ShapeHandle out;
TF_RETURN_IF_ERROR(c->Concatenate(in, in, &out));
c->set_output(0, out);
return Status::OK();
})
.Doc(R"doc(
Returns a diagonal tensor with a given diagonal values.
Given a `diagonal`, this operation returns a tensor with the `diagonal` and
everything else padded with zeros. The diagonal is computed as follows:
Assume `diagonal` has dimensions [D1,..., Dk], then the output is a tensor of
rank 2k with dimensions [D1,..., Dk, D1,..., Dk] where:
`output[i1,..., ik, i1,..., ik] = diagonal[i1, ..., ik]` and 0 everywhere else.
For example:
```prettyprint
# 'diagonal' is [1, 2, 3, 4]
tf.diag(diagonal) ==> [[1, 0, 0, 0]
[0, 2, 0, 0]
[0, 0, 3, 0]
[0, 0, 0, 4]]
```
diagonal: Rank k tensor where k is at most 3.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("DiagPart")
.Input("input: T")
.Output("diagonal: T")
.Attr("T: {float, double, int32, int64, complex64, complex128}")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle in = c->input(0);
if (!c->RankKnown(in)) {
c->set_output(0, c->UnknownShape());
return Status::OK();
}
// Rank must be even, and result will have rank <rank/2>.
const int32 rank = c->Rank(in);
if ((rank % 2) != 0 || rank > 6) {
return errors::InvalidArgument(
"Input must have even rank <= 6, input rank is ", rank);
}
const int32 mid = rank / 2;
// output dim[i] is the merge of in.dim[i] and in.dim[i+mid].
std::vector<DimensionHandle> dims(mid);
for (int i = 0; i < mid; ++i) {
TF_RETURN_IF_ERROR(
c->Merge(c->Dim(in, i), c->Dim(in, i + mid), &dims[i]));
}
c->set_output(0, c->MakeShape(dims));
return Status::OK();
})
.Doc(R"doc(
Returns the diagonal part of the tensor.
This operation returns a tensor with the `diagonal` part
of the `input`. The `diagonal` part is computed as follows:
Assume `input` has dimensions `[D1,..., Dk, D1,..., Dk]`, then the output is a
tensor of rank `k` with dimensions `[D1,..., Dk]` where:
`diagonal[i1,..., ik] = input[i1, ..., ik, i1,..., ik]`.
For example:
```prettyprint
# 'input' is [[1, 0, 0, 0]
[0, 2, 0, 0]
[0, 0, 3, 0]
[0, 0, 0, 4]]
tf.diag_part(input) ==> [1, 2, 3, 4]
```
input: Rank k tensor where k is 2, 4, or 6.
diagonal: The extracted diagonal.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("MatrixDiag")
.Input("diagonal: T")
.Output("output: T")
.Attr("T: type")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle in;
TF_RETURN_IF_ERROR(c->WithRankAtLeast(c->input(0), 1, &in));
if (!c->RankKnown(in)) {
c->set_output(0, c->UnknownShape());
return Status::OK();
}
const int32 rank = c->Rank(in);
ShapeHandle out;
TF_RETURN_IF_ERROR(
c->Concatenate(in, c->Vector(c->Dim(in, rank - 1)), &out));
c->set_output(0, out);
return Status::OK();
})
.Doc(R"doc(
Returns a batched diagonal tensor with a given batched diagonal values.
Given a `diagonal`, this operation returns a tensor with the `diagonal` and
everything else padded with zeros. The diagonal is computed as follows:
Assume `diagonal` has `k` dimensions `[I, J, K, ..., N]`, then the output is a
tensor of rank `k+1` with dimensions [I, J, K, ..., N, N]` where:
`output[i, j, k, ..., m, n] = 1{m=n} * diagonal[i, j, k, ..., n]`.
For example:
```prettyprint
# 'diagonal' is [[1, 2, 3, 4], [5, 6, 7, 8]]
and diagonal.shape = (2, 4)
tf.matrix_diag(diagonal) ==> [[[1, 0, 0, 0]
[0, 2, 0, 0]
[0, 0, 3, 0]
[0, 0, 0, 4]],
[[5, 0, 0, 0]
[0, 6, 0, 0]
[0, 0, 7, 0]
[0, 0, 0, 8]]]
which has shape (2, 4, 4)
```
diagonal: Rank `k`, where `k >= 1`.
output: Rank `k+1`, with `output.shape = diagonal.shape + [diagonal.shape[-1]]`.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("MatrixSetDiag")
.Input("input: T")
.Input("diagonal: T")
.Output("output: T")
.Attr("T: type")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle input;
ShapeHandle diag;
TF_RETURN_IF_ERROR(c->WithRankAtLeast(c->input(0), 2, &input));
TF_RETURN_IF_ERROR(c->WithRankAtLeast(c->input(1), 1, &diag));
if (c->RankKnown(input)) {
TF_RETURN_IF_ERROR(c->WithRank(c->input(1), c->Rank(input) - 1, &diag));
}
DimensionHandle smallest_dim;
TF_RETURN_IF_ERROR(
c->Min(c->Dim(input, -2), c->Dim(input, -1), &smallest_dim));
TF_RETURN_IF_ERROR(
c->Merge(smallest_dim, c->Dim(diag, -1), &smallest_dim));
ShapeHandle output = input;
if (c->RankKnown(diag) && !c->FullyDefined(input)) {
// Try to infer parts of shape from diag.
ShapeHandle diag_prefix;
TF_RETURN_IF_ERROR(c->Subshape(diag, 0, -1, &diag_prefix));
TF_RETURN_IF_ERROR(
c->Concatenate(diag_prefix, c->UnknownShapeOfRank(2), &diag));
TF_RETURN_IF_ERROR(c->Merge(input, diag, &output));
}
c->set_output(0, output);
return Status::OK();
})
.Doc(R"doc(
Returns a batched matrix tensor with new batched diagonal values.
Given `input` and `diagonal`, this operation returns a tensor with the
same shape and values as `input`, except for the main diagonal of the
innermost matrices. These will be overwritten by the values in `diagonal`.
The output is computed as follows:
Assume `input` has `k+1` dimensions `[I, J, K, ..., M, N]` and `diagonal` has
`k` dimensions `[I, J, K, ..., min(M, N)]`. Then the output is a
tensor of rank `k+1` with dimensions `[I, J, K, ..., M, N]` where:
* `output[i, j, k, ..., m, n] = diagonal[i, j, k, ..., n]` for `m == n`.
* `output[i, j, k, ..., m, n] = input[i, j, k, ..., m, n]` for `m != n`.
input: Rank `k+1`, where `k >= 1`.
diagonal: Rank `k`, where `k >= 1`.
output: Rank `k+1`, with `output.shape = input.shape`.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("MatrixDiagPart")
.Input("input: T")
.Output("diagonal: T")
.Attr("T: type")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle in;
TF_RETURN_IF_ERROR(c->WithRankAtLeast(c->input(0), 2, &in));
if (!c->RankKnown(in)) {
c->set_output(0, c->UnknownShape());
return Status::OK();
}
const int32 rank = c->Rank(in);
std::vector<DimensionHandle> dims;
for (int i = 0; i < rank - 2; ++i) dims.push_back(c->Dim(in, i));
DimensionHandle min_dim;
TF_RETURN_IF_ERROR(
c->Min(c->Dim(in, rank - 2), c->Dim(in, rank - 1), &min_dim));
dims.push_back(min_dim);
c->set_output(0, c->MakeShape(dims));
return Status::OK();
})
.Doc(R"doc(
Returns the batched diagonal part of a batched tensor.
This operation returns a tensor with the `diagonal` part
of the batched `input`. The `diagonal` part is computed as follows:
Assume `input` has `k` dimensions `[I, J, K, ..., M, N]`, then the output is a
tensor of rank `k - 1` with dimensions `[I, J, K, ..., min(M, N)]` where:
`diagonal[i, j, k, ..., n] = input[i, j, k, ..., n, n]`.
The input must be at least a matrix.
For example:
```prettyprint
# 'input' is [[[1, 0, 0, 0]
[0, 2, 0, 0]
[0, 0, 3, 0]
[0, 0, 0, 4]],
[[5, 0, 0, 0]
[0, 6, 0, 0]
[0, 0, 7, 0]
[0, 0, 0, 8]]]
and input.shape = (2, 4, 4)
tf.matrix_diag_part(input) ==> [[1, 2, 3, 4], [5, 6, 7, 8]]
which has shape (2, 4)
```
input: Rank `k` tensor where `k >= 2`.
diagonal: The extracted diagonal(s) having shape
`diagonal.shape = input.shape[:-2] + [min(input.shape[-2:])]`.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("MatrixBandPart")
.Input("input: T")
.Input("num_lower: int64")
.Input("num_upper: int64")
.Output("band: T")
.Attr("T: type")
.SetShapeFn(shape_inference::UnchangedShape)
.Doc(R"doc(
Copy a tensor setting everything outside a central band in each innermost matrix
to zero.
The `band` part is computed as follows:
Assume `input` has `k` dimensions `[I, J, K, ..., M, N]`, then the output is a
tensor with the same shape where
`band[i, j, k, ..., m, n] = in_band(m, n) * input[i, j, k, ..., m, n]`.
The indicator function
`in_band(m, n) = (num_lower < 0 || (m-n) <= num_lower)) &&
(num_upper < 0 || (n-m) <= num_upper)`.
For example:
```prettyprint
# if 'input' is [[ 0, 1, 2, 3]
[-1, 0, 1, 2]
[-2, -1, 0, 1]
[-3, -2, -1, 0]],
tf.matrix_band_part(input, 1, -1) ==> [[ 0, 1, 2, 3]
[-1, 0, 1, 2]
[ 0, -1, 0, 1]
[ 0, 0, -1, 0]],
tf.matrix_band_part(input, 2, 1) ==> [[ 0, 1, 0, 0]
[-1, 0, 1, 0]
[-2, -1, 0, 1]
[ 0, -2, -1, 0]]
```
Useful special cases:
```prettyprint
tf.matrix_band_part(input, 0, -1) ==> Upper triangular part.
tf.matrix_band_part(input, -1, 0) ==> Lower triangular part.
tf.matrix_band_part(input, 0, 0) ==> Diagonal.
```
input: Rank `k` tensor.
num_lower: 0-D tensor. Number of subdiagonals to keep. If negative, keep entire
lower triangle.
num_upper: 0-D tensor. Number of superdiagonals to keep. If negative, keep
entire upper triangle.
band: Rank `k` tensor of the same shape as input. The extracted banded tensor.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("Reverse")
.Input("tensor: T")
.Input("dims: bool")
.Output("output: T")
.Attr(
"T: {uint8, int8, int32, int64, bool, half, float, double, complex64, "
"complex128}")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle input = c->input(0);
ShapeHandle dims;
TF_RETURN_IF_ERROR(c->WithRank(c->input(1), 1, &dims));
DimensionHandle dims_dim = c->Dim(dims, 0);
if (c->ValueKnown(dims_dim)) {
TF_RETURN_IF_ERROR(c->WithRank(input, c->Value(dims_dim), &input));
}
if (c->Rank(input) > 8) {
return errors::InvalidArgument(
"reverse does not work on tensors with more than 8 dimensions");
}
c->set_output(0, input);
return Status::OK();
})
.Doc(R"Doc(
Reverses specific dimensions of a tensor.
Given a `tensor`, and a `bool` tensor `dims` representing the dimensions
of `tensor`, this operation reverses each dimension i of `tensor` where
`dims[i]` is `True`.
`tensor` can have up to 8 dimensions. The number of dimensions
of `tensor` must equal the number of elements in `dims`. In other words:
`rank(tensor) = size(dims)`
For example:
```prettyprint
# tensor 't' is [[[[ 0, 1, 2, 3],
# [ 4, 5, 6, 7],
# [ 8, 9, 10, 11]],
# [[12, 13, 14, 15],
# [16, 17, 18, 19],
# [20, 21, 22, 23]]]]
# tensor 't' shape is [1, 2, 3, 4]
# 'dims' is [False, False, False, True]
reverse(t, dims) ==> [[[[ 3, 2, 1, 0],
[ 7, 6, 5, 4],
[ 11, 10, 9, 8]],
[[15, 14, 13, 12],
[19, 18, 17, 16],
[23, 22, 21, 20]]]]
# 'dims' is [False, True, False, False]
reverse(t, dims) ==> [[[[12, 13, 14, 15],
[16, 17, 18, 19],
[20, 21, 22, 23]
[[ 0, 1, 2, 3],
[ 4, 5, 6, 7],
[ 8, 9, 10, 11]]]]
# 'dims' is [False, False, True, False]
reverse(t, dims) ==> [[[[8, 9, 10, 11],
[4, 5, 6, 7],
[0, 1, 2, 3]]
[[20, 21, 22, 23],
[16, 17, 18, 19],
[12, 13, 14, 15]]]]
```
tensor: Up to 8-D.
dims: 1-D. The dimensions to reverse.
output: The same shape as `tensor`.
)Doc");
// --------------------------------------------------------------------------
REGISTER_OP("ReverseV2")
.Input("tensor: T")
.Input("axis: Tidx")
.Output("output: T")
.Attr("Tidx: {int32, int64} = DT_INT32")
.Attr(
"T: {uint8, int8, int32, int64, bool, half, float, double, complex64, "
"complex128}")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle input = c->input(0);
ShapeHandle axis;
TF_RETURN_IF_ERROR(c->WithRank(c->input(1), 1, &axis));
// TODO(aselle): if input(0)'s dimension is known we could validate axis
if (c->Rank(input) > 8) {
return errors::InvalidArgument(
"reverse does not work on tensors with more than 8 dimensions");
}
c->set_output(0, input);
return Status::OK();
})
.Doc(R"Doc(
Reverses specific dimensions of a tensor.
NOTE `tf.reverse` has now changed behavior in preparation for 1.0.
`tf.reverse_v2` is currently an alias that will be deprecated before TF 1.0.
Given a `tensor`, and a `int32` tensor `axis` representing the set of
dimensions of `tensor` to reverse. This operation reverses each dimension
`i` for which there exists `j` s.t. `axis[j] == i`.
`tensor` can have up to 8 dimensions. The number of dimensions specified
in `axis` may be 0 or more entries. If an index is specified more than
once, a InvalidArgument error is raised.
For example:
```prettyprint
# tensor 't' is [[[[ 0, 1, 2, 3],
# [ 4, 5, 6, 7],
# [ 8, 9, 10, 11]],
# [[12, 13, 14, 15],
# [16, 17, 18, 19],
# [20, 21, 22, 23]]]]
# tensor 't' shape is [1, 2, 3, 4]
# 'dims' is [3] or 'dims' is -1
reverse(t, dims) ==> [[[[ 3, 2, 1, 0],
[ 7, 6, 5, 4],
[ 11, 10, 9, 8]],
[[15, 14, 13, 12],
[19, 18, 17, 16],
[23, 22, 21, 20]]]]
# 'dims' is '[1]' (or 'dims' is '[-3]')
reverse(t, dims) ==> [[[[12, 13, 14, 15],
[16, 17, 18, 19],
[20, 21, 22, 23]
[[ 0, 1, 2, 3],
[ 4, 5, 6, 7],
[ 8, 9, 10, 11]]]]
# 'dims' is '[2]' (or 'dims' is '[-2]')
reverse(t, dims) ==> [[[[8, 9, 10, 11],
[4, 5, 6, 7],
[0, 1, 2, 3]]
[[20, 21, 22, 23],
[16, 17, 18, 19],
[12, 13, 14, 15]]]]
```
tensor: Up to 8-D.
axis: 1-D. The indices of the dimensions to reverse.
output: The same shape as `tensor`.
)Doc");
// --------------------------------------------------------------------------
REGISTER_OP("EditDistance")
.Input("hypothesis_indices: int64")
.Input("hypothesis_values: T")
.Input("hypothesis_shape: int64")
.Input("truth_indices: int64")
.Input("truth_values: T")
.Input("truth_shape: int64")
.Attr("normalize: bool = true")
.Attr("T: type")
.Output("output: float")
.SetShapeFn([](InferenceContext* c) {
TF_RETURN_IF_ERROR(shape_inference::ValidateSparseTensor(
c, c->input(0), c->input(1), c->input(2)));
TF_RETURN_IF_ERROR(shape_inference::ValidateSparseTensor(
c, c->input(3), c->input(4), c->input(5)));
const Tensor* hypothesis_shape_t = c->input_tensor(2);
const Tensor* truth_shape_t = c->input_tensor(5);
if (hypothesis_shape_t == nullptr || truth_shape_t == nullptr) {
// We need to know the runtime shape of the two tensors,
// or else the output shape is unknown.
return shape_inference::UnknownShape(c);
}
if (hypothesis_shape_t->NumElements() != truth_shape_t->NumElements()) {
return errors::InvalidArgument(
"Num elements of hypothesis_shape does not match truth_shape: ",
hypothesis_shape_t->NumElements(), " vs. ",
truth_shape_t->NumElements());
}
auto h_values = hypothesis_shape_t->flat<int64>();
auto t_values = truth_shape_t->flat<int64>();
std::vector<DimensionHandle> dims(hypothesis_shape_t->NumElements() - 1);
for (int i = 0; i < dims.size(); ++i) {
dims[i] = c->MakeDim(std::max(h_values(i), t_values(i)));
}
c->set_output(0, c->MakeShape(dims));
return Status::OK();
})
.Doc(R"doc(
Computes the (possibly normalized) Levenshtein Edit Distance.
The inputs are variable-length sequences provided by SparseTensors
(hypothesis_indices, hypothesis_values, hypothesis_shape)
and
(truth_indices, truth_values, truth_shape).
The inputs are:
hypothesis_indices: The indices of the hypothesis list SparseTensor.
This is an N x R int64 matrix.
hypothesis_values: The values of the hypothesis list SparseTensor.
This is an N-length vector.
hypothesis_shape: The shape of the hypothesis list SparseTensor.
This is an R-length vector.
truth_indices: The indices of the truth list SparseTensor.
This is an M x R int64 matrix.
truth_values: The values of the truth list SparseTensor.
This is an M-length vector.
truth_shape: The shape of the truth list SparseTensor.
This is an R-length vector.
truth_shape: truth indices, vector.
normalize: boolean (if true, edit distances are normalized by length of truth).
The output is:
output: A dense float tensor with rank R - 1.
For the example input:
// hypothesis represents a 2x1 matrix with variable-length values:
// (0,0) = ["a"]
// (1,0) = ["b"]
hypothesis_indices = [[0, 0, 0],
[1, 0, 0]]
hypothesis_values = ["a", "b"]
hypothesis_shape = [2, 1, 1]
// truth represents a 2x2 matrix with variable-length values:
// (0,0) = []
// (0,1) = ["a"]
// (1,0) = ["b", "c"]
// (1,1) = ["a"]
truth_indices = [[0, 1, 0],
[1, 0, 0],
[1, 0, 1],
[1, 1, 0]]
truth_values = ["a", "b", "c", "a"]
truth_shape = [2, 2, 2]
normalize = true
The output will be:
// output is a 2x2 matrix with edit distances normalized by truth lengths.
output = [[inf, 1.0], // (0,0): no truth, (0,1): no hypothesis
[0.5, 1.0]] // (1,0): addition, (1,1): no hypothesis
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("Fill")
.Input("dims: int32")
.Input("value: T")
.Output("output: T")
.Attr("T: type")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle unused;
TF_RETURN_IF_ERROR(c->WithRank(c->input(0), 1, &unused));
TF_RETURN_IF_ERROR(c->WithRank(c->input(1), 0, &unused));
const Tensor* t = c->input_tensor(0);
if (t != nullptr) {
for (int i = 0; i < t->NumElements(); ++i) {
if (t->vec<int32>()(i) < 0) {
return errors::InvalidArgument("Fill dimensions must be >= 0");
}
}
}
ShapeHandle out;
TF_RETURN_IF_ERROR(c->MakeShapeFromShapeTensor(0, &out));
c->set_output(0, out);
return Status::OK();
})
.Doc(R"doc(
Creates a tensor filled with a scalar value.
This operation creates a tensor of shape `dims` and fills it with `value`.
For example:
```prettyprint
# Output tensor has shape [2, 3].
fill([2, 3], 9) ==> [[9, 9, 9]
[9, 9, 9]]
```
dims: 1-D. Represents the shape of the output tensor.
value: 0-D (scalar). Value to fill the returned tensor.
@compatibility(numpy)
Equivalent to np.full
@end_compatibility
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("_ParallelConcatStart")
.Output("output: dtype")
.Attr("shape: shape")
.Attr("dtype: type")
.SetIsStateful()
.SetShapeFn([](InferenceContext* c) {
ShapeHandle out;
TF_RETURN_IF_ERROR(c->MakeShapeFromShapeTensor(0, &out));
c->set_output(0, out);
return Status::OK();
})
.Doc(R"doc(
Creates an empty Tensor with shape `shape` and type `dtype`.
The memory can optionally be initialized. This is usually useful in
conjunction with inplace operations.
shape: 1-D `Tensor` indicating the shape of the output.
dtype: The element type of the returned tensor.
output: An empty Tensor of the specified type.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("_ParallelConcatUpdate")
.Input("value: T")
.Input("update: T")
.Output("output: T")
.Attr("T: type")
.Attr("loc: int")
.SetShapeFn(shape_inference::UnchangedShape)
.Doc(R"doc(
Updates input `value` at `loc` with `update`.
If you use this function you will almost certainly want to add
a control dependency as done in the implementation of parallel_stack to
avoid race conditions.
value: A `Tensor` object that will be updated in-place.
loc: A scalar indicating the index of the first dimension such that
value[loc, :] is updated.
update: A `Tensor` of rank one less than `value` if `loc` is a scalar,
otherwise of rank equal to `value` that contains the new values
for `value`.
output: `value` that has been updated accordingly.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("Gather")
.Input("params: Tparams")
.Input("indices: Tindices")
.Attr("validate_indices: bool = true")
.Output("output: Tparams")
.Attr("Tparams: type")
.Attr("Tindices: {int32,int64}")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle unused;
TF_RETURN_IF_ERROR(c->WithRankAtLeast(c->input(0), 1, &unused));
ShapeHandle params_subshape;
TF_RETURN_IF_ERROR(c->Subshape(c->input(0), 1, ¶ms_subshape));
ShapeHandle indices_shape = c->input(1);
ShapeHandle out;
TF_RETURN_IF_ERROR(c->Concatenate(indices_shape, params_subshape, &out));
c->set_output(0, out);
return Status::OK();
})
.Doc(R"doc(
Gather slices from `params` according to `indices`.
`indices` must be an integer tensor of any dimension (usually 0-D or 1-D).
Produces an output tensor with shape `indices.shape + params.shape[1:]` where:
```python
# Scalar indices
output[:, ..., :] = params[indices, :, ... :]
# Vector indices
output[i, :, ..., :] = params[indices[i], :, ... :]
# Higher rank indices
output[i, ..., j, :, ... :] = params[indices[i, ..., j], :, ..., :]
```
If `indices` is a permutation and `len(indices) == params.shape[0]` then
this operation will permute `params` accordingly.
<div style="width:70%; margin:auto; margin-bottom:10px; margin-top:20px;">
<img style="width:100%" src="../../images/Gather.png" alt>
</div>
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("GatherNd")
.Input("params: Tparams")
.Input("indices: Tindices")
.Output("output: Tparams")
.Attr("Tparams: type")
.Attr("Tindices: {int32,int64}")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle params = c->input(0);
ShapeHandle indices;
TF_RETURN_IF_ERROR(c->WithRankAtLeast(c->input(1), 1, &indices));
DimensionHandle r_dim = c->Dim(indices, -1);
if (!c->RankKnown(params) || !c->ValueKnown(r_dim)) {
c->set_output(0, c->UnknownShape());
return Status::OK();
}
if (c->Value(r_dim) > c->Rank(params)) {
return errors::InvalidArgument(
"indices.shape[-1] must be <= params.rank, but saw indices shape: ",
c->DebugString(indices),
" and params shape: ", c->DebugString(params));
}
// Remove r_dim from indices to get output.
ShapeHandle indices_slice;
ShapeHandle params_slice;
TF_RETURN_IF_ERROR(c->Subshape(indices, 0, -1, &indices_slice));
TF_RETURN_IF_ERROR(c->Subshape(params, c->Value(r_dim), ¶ms_slice));
ShapeHandle out;
TF_RETURN_IF_ERROR(c->Concatenate(indices_slice, params_slice, &out));
c->set_output(0, out);
return Status::OK();
})
.Doc(R"doc(
Gather values or slices from `params` according to `indices`.
`params` is a Tensor of rank `P` and `indices` is a Tensor of rank `Q`.
`indices` must be integer tensor, containing indices into `params`.
It must be shape `[d_0, ..., d_{Q-2}, K]` where `0 < K <= P`.
The innermost dimension of `indices` (with length `K`) corresponds to
indices into elements (if `K = P`) or slices (if `K < P`) along the `K`th
dimension of `params`.
Produces an output tensor with shape
```
[d_0, ..., d_{Q-2}, params.shape[K], ..., params.shape[P-1]].
```
Some examples below.
Simple indexing into a matrix:
```python
indices = [[0, 0], [1, 1]]
params = [['a', 'b'], ['c', 'd']]
output = ['a', 'd']
```
Slice indexing into a matrix:
```python
indices = [[1], [0]]
params = [['a', 'b'], ['c', 'd']]
output = [['c', 'd'], ['a', 'b']]
```
Indexing into a 3-tensor:
```python
indices = [[1]]
params = [[['a0', 'b0'], ['c0', 'd0']],
[['a1', 'b1'], ['c1', 'd1']]]
output = [[['a1', 'b1'], ['c1', 'd1']]]
indices = [[0, 1], [1, 0]]
params = [[['a0', 'b0'], ['c0', 'd0']],
[['a1', 'b1'], ['c1', 'd1']]]
output = [['c0', 'd0'], ['a1', 'b1']]
indices = [[0, 0, 1], [1, 0, 1]]
params = [[['a0', 'b0'], ['c0', 'd0']],
[['a1', 'b1'], ['c1', 'd1']]]
output = ['b0', 'b1']
```
Batched indexing into a matrix:
```python
indices = [[[0, 0]], [[0, 1]]]
params = [['a', 'b'], ['c', 'd']]
output = [['a'], ['b']]
```
Batched slice indexing into a matrix:
```python
indices = [[[1]], [[0]]]
params = [['a', 'b'], ['c', 'd']]
output = [[['c', 'd']], [['a', 'b']]]
```
Batched indexing into a 3-tensor:
```python
indices = [[[1]], [[0]]]
params = [[['a0', 'b0'], ['c0', 'd0']],
[['a1', 'b1'], ['c1', 'd1']]]
output = [[[['a1', 'b1'], ['c1', 'd1']]],
[[['a0', 'b0'], ['c0', 'd0']]]]
indices = [[[0, 1], [1, 0]], [[0, 0], [1, 1]]]
params = [[['a0', 'b0'], ['c0', 'd0']],
[['a1', 'b1'], ['c1', 'd1']]]
output = [[['c0', 'd0'], ['a1', 'b1']],
[['a0', 'b0'], ['c1', 'd1']]]
indices = [[[0, 0, 1], [1, 0, 1]], [[0, 1, 1], [1, 1, 0]]]
params = [[['a0', 'b0'], ['c0', 'd0']],
[['a1', 'b1'], ['c1', 'd1']]]
output = [['b0', 'b1'], ['d0', 'c1']]
```
params: `P-D`. The tensor from which to gather values.
indices: `Q-D`. Index tensor having shape `[d_0, ..., d_{Q-2}, K]`.
output: `(P+Q-K-1)-D`. Values from `params` gathered from indices given by
`indices`.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("Identity")
.Input("input: T")
.Output("output: T")
.Attr("T: type")
.SetShapeFn([](shape_inference::InferenceContext* c) {
c->set_output(0, c->input(0));
c->set_output_handle_dtype(0, c->input_handle_dtype(0));
c->set_output_handle_shape(0, c->input_handle_shape(0));
return Status::OK();
})
.Doc(R"Doc(
Return a tensor with the same shape and contents as the input tensor or value.
)Doc");
// --------------------------------------------------------------------------
REGISTER_OP("RefIdentity")
.Input("input: Ref(T)")
.Output("output: Ref(T)")
.Attr("T: type")
.SetShapeFn(shape_inference::UnchangedShape)
.SetAllowsUninitializedInput()
.Doc(R"Doc(
Return the same ref tensor as the input ref tensor.
)Doc");
// --------------------------------------------------------------------------
REGISTER_OP("StopGradient")
.Input("input: T")
.Output("output: T")
.Attr("T: type")
.SetShapeFn(shape_inference::UnchangedShape)
.Doc(R"Doc(
Stops gradient computation.
When executed in a graph, this op outputs its input tensor as-is.
When building ops to compute gradients, this op prevents the contribution of
its inputs to be taken into account. Normally, the gradient generator adds ops
to a graph to compute the derivatives of a specified 'loss' by recursively
finding out inputs that contributed to its computation. If you insert this op
in the graph it inputs are masked from the gradient generator. They are not
taken into account for computing gradients.
This is useful any time you want to compute a value with TensorFlow but need
to pretend that the value was a constant. Some examples include:
* The *EM* algorithm where the *M-step* should not involve backpropagation
through the output of the *E-step*.
* Contrastive divergence training of Boltzmann machines where, when
differentiating the energy function, the training must not backpropagate
through the graph that generated the samples from the model.
* Adversarial training, where no backprop should happen through the adversarial
example generation process.
)Doc");
REGISTER_OP("PreventGradient")
.Input("input: T")
.Output("output: T")
.Attr("T: type")
.Attr("message: string = ''")
.SetShapeFn(shape_inference::UnchangedShape)
.Doc(R"Doc(
An identity op that triggers an error if a gradient is requested.
When executed in a graph, this op outputs its input tensor as-is.
When building ops to compute gradients, the TensorFlow gradient system
will return an error when trying to lookup the gradient of this op,
because no gradient must ever be registered for this function. This
op exists to prevent subtle bugs from silently returning unimplemented
gradients in some corner cases.
input: any tensor.
output: the same input tensor.
message: Will be printed in the error when anyone tries to differentiate
this operation.
)Doc");
// --------------------------------------------------------------------------
REGISTER_OP("CheckNumerics")
.Input("tensor: T")
.Output("output: T")
.Attr("T: {half, float, double}")
.Attr("message: string")
.SetShapeFn(shape_inference::UnchangedShape)
.Doc(R"doc(
Checks a tensor for NaN and Inf values.
When run, reports an `InvalidArgument` error if `tensor` has any values
that are not a number (NaN) or infinity (Inf). Otherwise, passes `tensor` as-is.
message: Prefix of the error message.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("Reshape")
.Input("tensor: T")
.Input("shape: Tshape")
.Output("output: T")
.Attr("T: type")
.Attr("Tshape: {int32, int64} = DT_INT32")
.SetShapeFn([](InferenceContext* c) { return SetOutputShapeForReshape(c); })
.Doc(R"Doc(
Reshapes a tensor.
Given `tensor`, this operation returns a tensor that has the same values
as `tensor` with shape `shape`.
If one component of `shape` is the special value -1, the size of that dimension
is computed so that the total size remains constant. In particular, a `shape`
of `[-1]` flattens into 1-D. At most one component of `shape` can be -1.
If `shape` is 1-D or higher, then the operation returns a tensor with shape
`shape` filled with the values of `tensor`. In this case, the number of elements
implied by `shape` must be the same as the number of elements in `tensor`.
For example:
```prettyprint
# tensor 't' is [1, 2, 3, 4, 5, 6, 7, 8, 9]
# tensor 't' has shape [9]
reshape(t, [3, 3]) ==> [[1, 2, 3],
[4, 5, 6],
[7, 8, 9]]
# tensor 't' is [[[1, 1], [2, 2]],
# [[3, 3], [4, 4]]]
# tensor 't' has shape [2, 2, 2]
reshape(t, [2, 4]) ==> [[1, 1, 2, 2],
[3, 3, 4, 4]]
# tensor 't' is [[[1, 1, 1],
# [2, 2, 2]],
# [[3, 3, 3],
# [4, 4, 4]],
# [[5, 5, 5],
# [6, 6, 6]]]
# tensor 't' has shape [3, 2, 3]
# pass '[-1]' to flatten 't'
reshape(t, [-1]) ==> [1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6]
# -1 can also be used to infer the shape
# -1 is inferred to be 9:
reshape(t, [2, -1]) ==> [[1, 1, 1, 2, 2, 2, 3, 3, 3],
[4, 4, 4, 5, 5, 5, 6, 6, 6]]
# -1 is inferred to be 2:
reshape(t, [-1, 9]) ==> [[1, 1, 1, 2, 2, 2, 3, 3, 3],
[4, 4, 4, 5, 5, 5, 6, 6, 6]]
# -1 is inferred to be 3:
reshape(t, [ 2, -1, 3]) ==> [[[1, 1, 1],
[2, 2, 2],
[3, 3, 3]],
[[4, 4, 4],
[5, 5, 5],
[6, 6, 6]]]
# tensor 't' is [7]
# shape `[]` reshapes to a scalar
reshape(t, []) ==> 7
```
shape: Defines the shape of the output tensor.
)Doc");
// --------------------------------------------------------------------------
REGISTER_OP("InvertPermutation")
.Input("x: T")
.Output("y: T")
.Attr("T: {int32, int64} = DT_INT32")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle x;
TF_RETURN_IF_ERROR(c->WithRank(c->input(0), 1, &x));
c->set_output(0, x);
return Status::OK();
})
.Doc(R"doc(
Computes the inverse permutation of a tensor.
This operation computes the inverse of an index permutation. It takes a 1-D
integer tensor `x`, which represents the indices of a zero-based array, and
swaps each value with its index position. In other words, for an output tensor
`y` and an input tensor `x`, this operation computes the following:
`y[x[i]] = i for i in [0, 1, ..., len(x) - 1]`
The values must include 0. There can be no duplicate values or negative values.
For example:
```prettyprint
# tensor `x` is [3, 4, 0, 2, 1]
invert_permutation(x) ==> [2, 4, 3, 0, 1]
```
x: 1-D.
y: 1-D.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("Transpose")
.Input("x: T")
.Input("perm: Tperm")
.Output("y: T")
.Attr("T: type")
.Attr("Tperm: {int32, int64} = DT_INT32")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle input = c->input(0);
ShapeHandle perm_shape = c->input(1);
const Tensor* perm = c->input_tensor(1);
DimensionHandle perm_elems = c->NumElements(perm_shape);
// If we don't have rank information on the input or value information on
// perm we can't return any shape information, otherwise we have enough
// information to at least find the rank of the output.
if (!c->RankKnown(input) && !c->ValueKnown(perm_elems) &&
perm == nullptr) {
c->set_output(0, c->UnknownShape());
return Status::OK();
}
// Find our value of the rank.
int64 rank;
if (c->RankKnown(input)) {
rank = c->Rank(input);
} else if (c->ValueKnown(perm_elems)) {
rank = c->Value(perm_elems);
} else {
rank = perm->NumElements();
}
std::vector<DimensionHandle> dims;
dims.resize(rank);
TF_RETURN_IF_ERROR(c->WithRank(input, rank, &input));
// Ensure that perm is a vector and has rank elements.
TF_RETURN_IF_ERROR(c->WithRank(perm_shape, 1, &perm_shape));
TF_RETURN_IF_ERROR(c->WithValue(perm_elems, rank, &perm_elems));
// If we know the rank of the input and the value of perm, we can return
// all shape informantion, otherwise we can only return rank information,
// but no information for the dimensions.
if (perm != nullptr) {
std::vector<int64> data;
if (perm->dtype() == DT_INT32) {
data = AsInt64<int32>(perm, rank);
} else {
data = AsInt64<int64>(perm, rank);
}
for (int32 i = 0; i < rank; ++i) {
int64 in_idx = data[i];
if (in_idx >= rank) {
return errors::InvalidArgument(
"perm dim ", in_idx, " is out of range of input rank ", rank);
}
dims[i] = c->Dim(input, in_idx);
}
} else {
for (int i = 0; i < rank; ++i) {
dims[i] = c->UnknownDim();
}
}
c->set_output(0, c->MakeShape(dims));
return Status::OK();
})
.Doc(R"doc(
Shuffle dimensions of x according to a permutation.
The output `y` has the same rank as `x`. The shapes of `x` and `y` satisfy:
`y.shape[i] == x.shape[perm[i]] for i in [0, 1, ..., rank(x) - 1]`
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("Unique")
.Input("x: T")
.Output("y: T")
.Output("idx: out_idx")
.Attr("T: type")
.Attr("out_idx: {int32, int64} = DT_INT32")
.SetShapeFn([](InferenceContext* c) {
c->set_output(0, c->Vector(InferenceContext::kUnknownDim));
c->set_output(1, c->input(0));
return Status::OK();
})
.Doc(R"doc(
Finds unique elements in a 1-D tensor.
This operation returns a tensor `y` containing all of the unique elements of `x`
sorted in the same order that they occur in `x`. This operation also returns a
tensor `idx` the same size as `x` that contains the index of each value of `x`
in the unique output `y`. In other words:
`y[idx[i]] = x[i] for i in [0, 1,...,rank(x) - 1]`
For example:
```prettyprint
# tensor 'x' is [1, 1, 2, 4, 4, 4, 7, 8, 8]
y, idx = unique(x)
y ==> [1, 2, 4, 7, 8]
idx ==> [0, 0, 1, 2, 2, 2, 3, 4, 4]
```
x: 1-D.
y: 1-D.
idx: 1-D.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("UniqueWithCounts")
.Input("x: T")
.Output("y: T")
.Output("idx: out_idx")
.Output("count: out_idx")
.Attr("T: type")
.Attr("out_idx: {int32, int64} = DT_INT32")
.SetShapeFn([](InferenceContext* c) {
auto uniq = c->Vector(InferenceContext::kUnknownDim);
c->set_output(0, uniq);
c->set_output(1, c->input(0));
c->set_output(2, uniq);
return Status::OK();
})
.Doc(R"doc(
Finds unique elements in a 1-D tensor.
This operation returns a tensor `y` containing all of the unique elements of `x`
sorted in the same order that they occur in `x`. This operation also returns a
tensor `idx` the same size as `x` that contains the index of each value of `x`
in the unique output `y`. Finally, it returns a third tensor `count` that
contains the count of each element of `y` in `x`. In other words:
`y[idx[i]] = x[i] for i in [0, 1,...,rank(x) - 1]`
For example:
```prettyprint
# tensor 'x' is [1, 1, 2, 4, 4, 4, 7, 8, 8]
y, idx, count = unique_with_counts(x)
y ==> [1, 2, 4, 7, 8]
idx ==> [0, 0, 1, 2, 2, 2, 3, 4, 4]
count ==> [2, 1, 3, 1, 2]
```
x: 1-D.
y: 1-D.
idx: 1-D.
count: 1-D.
)doc");
namespace {
Status ShapeShapeFn(InferenceContext* c) {
for (int i = 0; i < c->num_inputs(); ++i) {
DimensionHandle dim;
if (c->RankKnown(c->input(i))) {
dim = c->MakeDim(c->Rank(c->input(i)));
} else {
dim = c->UnknownDim();
}
c->set_output(i, c->Vector(dim));
}
return Status::OK();
}
} // namespace
// --------------------------------------------------------------------------
REGISTER_OP("Shape")
.Input("input: T")
.Output("output: out_type")
.Attr("T: type")
.Attr("out_type: {int32, int64} = DT_INT32")
.SetShapeFn(ShapeShapeFn)
.Doc(R"doc(
Returns the shape of a tensor.
This operation returns a 1-D integer tensor representing the shape of `input`.
For example:
```prettyprint
# 't' is [[[1, 1, 1], [2, 2, 2]], [[3, 3, 3], [4, 4, 4]]]
shape(t) ==> [2, 2, 3]
```
)doc");
REGISTER_OP("ShapeN")
.Input("input: N * T")
.Output("output: N * out_type")
.Attr("N: int")
.Attr("T: type")
.Attr("out_type: {int32, int64} = DT_INT32")
.SetShapeFn(ShapeShapeFn)
.Doc(R"doc(
Returns shape of tensors.
This operation returns N 1-D integer tensors representing shape of `input[i]s`.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("ReverseSequence")
.Input("input: T")
.Input("seq_lengths: Tlen")
.Output("output: T")
.Attr("seq_dim: int")
.Attr("batch_dim: int = 0")
.Attr("T: type")
.Attr("Tlen: {int32, int64} = DT_INT64")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle input = c->input(0);
ShapeHandle seq_lens_shape;
TF_RETURN_IF_ERROR(c->WithRank(c->input(1), 1, &seq_lens_shape));
int64 seq_dim;
TF_RETURN_IF_ERROR(c->GetAttr("seq_dim", &seq_dim));
int64 batch_dim;
TF_RETURN_IF_ERROR(c->GetAttr("batch_dim", &batch_dim));
if (!c->RankKnown(input)) {
return shape_inference::UnknownShape(c);
}
// Validate batch_dim and seq_dim against input.
const int32 input_rank = c->Rank(input);
if (batch_dim >= input_rank) {
return errors::InvalidArgument(
"batch_dim must be < input rank: ", batch_dim, " vs. ", input_rank);
}
if (seq_dim >= input_rank) {
return errors::InvalidArgument(
"seq_dim must be < input rank: ", seq_dim, " vs. ", input_rank);
}
DimensionHandle batch_dim_dim = c->Dim(input, batch_dim);
TF_RETURN_IF_ERROR(
c->Merge(batch_dim_dim, c->Dim(seq_lens_shape, 0), &batch_dim_dim));
// Replace batch_dim of input with batch_size
ShapeHandle output_shape;
TF_RETURN_IF_ERROR(
c->ReplaceDim(input, batch_dim, batch_dim_dim, &output_shape));
c->set_output(0, output_shape);
return Status::OK();
})
.Doc(R"doc(
Reverses variable length slices.
This op first slices `input` along the dimension `batch_dim`, and for each
slice `i`, reverses the first `seq_lengths[i]` elements along
the dimension `seq_dim`.
The elements of `seq_lengths` must obey `seq_lengths[i] <= input.dims[seq_dim]`,
and `seq_lengths` must be a vector of length `input.dims[batch_dim]`.
The output slice `i` along dimension `batch_dim` is then given by input
slice `i`, with the first `seq_lengths[i]` slices along dimension
`seq_dim` reversed.
For example:
```prettyprint
# Given this:
batch_dim = 0
seq_dim = 1
input.dims = (4, 8, ...)
seq_lengths = [7, 2, 3, 5]
# then slices of input are reversed on seq_dim, but only up to seq_lengths:
output[0, 0:7, :, ...] = input[0, 7:0:-1, :, ...]
output[1, 0:2, :, ...] = input[1, 2:0:-1, :, ...]
output[2, 0:3, :, ...] = input[2, 3:0:-1, :, ...]
output[3, 0:5, :, ...] = input[3, 5:0:-1, :, ...]
# while entries past seq_lens are copied through:
output[0, 7:, :, ...] = input[0, 7:, :, ...]
output[1, 2:, :, ...] = input[1, 2:, :, ...]
output[2, 3:, :, ...] = input[2, 3:, :, ...]
output[3, 2:, :, ...] = input[3, 2:, :, ...]
```
In contrast, if:
```prettyprint
# Given this:
batch_dim = 2
seq_dim = 0
input.dims = (8, ?, 4, ...)
seq_lengths = [7, 2, 3, 5]
# then slices of input are reversed on seq_dim, but only up to seq_lengths:
output[0:7, :, 0, :, ...] = input[7:0:-1, :, 0, :, ...]
output[0:2, :, 1, :, ...] = input[2:0:-1, :, 1, :, ...]
output[0:3, :, 2, :, ...] = input[3:0:-1, :, 2, :, ...]
output[0:5, :, 3, :, ...] = input[5:0:-1, :, 3, :, ...]
# while entries past seq_lens are copied through:
output[7:, :, 0, :, ...] = input[7:, :, 0, :, ...]
output[2:, :, 1, :, ...] = input[2:, :, 1, :, ...]
output[3:, :, 2, :, ...] = input[3:, :, 2, :, ...]
output[2:, :, 3, :, ...] = input[2:, :, 3, :, ...]
```
input: The input to reverse.
seq_lengths: 1-D with length `input.dims(batch_dim)` and
`max(seq_lengths) <= input.dims(seq_dim)`
seq_dim: The dimension which is partially reversed.
batch_dim: The dimension along which reversal is performed.
output: The partially reversed input. It has the same shape as `input`.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("Rank")
.Input("input: T")
.Output("output: int32")
.Attr("T: type")
.SetShapeFn(shape_inference::ScalarShape)
.Doc(R"doc(
Returns the rank of a tensor.
This operation returns an integer representing the rank of `input`.
For example:
```prettyprint
# 't' is [[[1, 1, 1], [2, 2, 2]], [[3, 3, 3], [4, 4, 4]]]
# shape of tensor 't' is [2, 2, 3]
rank(t) ==> 3
```
**Note**: The rank of a tensor is not the same as the rank of a matrix. The rank
of a tensor is the number of indices required to uniquely select each element
of the tensor. Rank is also known as "order", "degree", or "ndims."
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("Size")
.Input("input: T")
.Output("output: out_type")
.Attr("T: type")
.Attr("out_type: {int32, int64} = DT_INT32")
.SetShapeFn(shape_inference::ScalarShape)
.Doc(R"doc(
Returns the size of a tensor.
This operation returns an integer representing the number of elements in
`input`.
For example:
```prettyprint
# 't' is [[[1, 1,, 1], [2, 2, 2]], [[3, 3, 3], [4, 4, 4]]]]
size(t) ==> 12
```
)doc");
namespace {
template <typename T>
Status SliceHelper(InferenceContext* c, ShapeHandle begin_value,
const Tensor* sizes_value,
std::vector<DimensionHandle>* dims) {
auto sizes_vec = sizes_value->vec<T>();
for (int i = 0; i < sizes_value->NumElements(); ++i) {
DimensionHandle dim = c->Dim(c->input(0), i);
if (sizes_vec(i) != -1) {
auto dim_val = c->Value(dim);
if (sizes_vec(i) < 0) {
return errors::InvalidArgument(
"Out of bounds slicing on dimension ", i, " of length ", dim_val,
": sizes vector cannot be < -1, but was ", sizes_vec(i));
}
dims->emplace_back(c->MakeDim(sizes_vec(i)));
} else {
DimensionHandle result;
TF_RETURN_IF_ERROR(c->Subtract(dim, c->Dim(begin_value, i), &result));
dims->emplace_back(result);
}
}
return Status::OK();
}
} // namespace
// --------------------------------------------------------------------------
REGISTER_OP("Slice")
.Input("input: T")
.Input("begin: Index")
.Input("size: Index")
.Output("output: T")
.Attr("T: type")
.Attr("Index: {int32,int64}")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle input = c->input(0);
ShapeHandle begin_shape;
TF_RETURN_IF_ERROR(c->WithRank(c->input(1), 1, &begin_shape));
ShapeHandle sizes_shape;
TF_RETURN_IF_ERROR(c->WithRank(c->input(2), 1, &sizes_shape));
// Merge to check compatibility of begin and sizes tensors.
TF_RETURN_IF_ERROR(c->Merge(begin_shape, sizes_shape, &begin_shape));
DimensionHandle ndims = c->Dim(begin_shape, 0);
if (c->ValueKnown(ndims)) {
TF_RETURN_IF_ERROR(c->WithRank(input, c->Value(ndims), &input));
}
// NOTE(mrry): Use MakeShapeFromShapeTensor to handle partially-known
// values, even though the `begin` value does not represent a shape.
ShapeHandle begin_value;
TF_RETURN_IF_ERROR(c->MakeShapeFromShapeTensor(1, &begin_value));
// NOTE(mrry): We can't use `MakeShapeFromShapeTensor` for `sizes` because
// it might contain -1, which can't be represented (-1 in the ShapeHandle
// would mean "unknown".
const Tensor* sizes_value = c->input_tensor(2);
if (sizes_value != nullptr) {
TF_RETURN_IF_ERROR(
c->WithRank(begin_value, sizes_value->NumElements(), &begin_value));
std::vector<DimensionHandle> dims;
// If the begin and sizes tensors are available, then
// we can be precise about the shape of the output.
if (sizes_value->dtype() == DT_INT64) {
TF_RETURN_IF_ERROR(
SliceHelper<int64>(c, begin_value, sizes_value, &dims));
} else {
TF_RETURN_IF_ERROR(
SliceHelper<int32>(c, begin_value, sizes_value, &dims));
}
c->set_output(0, c->MakeShape(dims));
return Status::OK();
} else {
// We might know the rank of the input.
if (c->RankKnown(input)) {
c->set_output(0, c->UnknownShapeOfRank(c->Rank(input)));
return Status::OK();
} else {
return shape_inference::UnknownShape(c);
}
}
return Status::OK();
})
.Doc(R"doc(
Return a slice from 'input'.
The output tensor is a tensor with dimensions described by 'size'
whose values are extracted from 'input' starting at the offsets in
'begin'.
*Requirements*:
0 <= begin[i] <= begin[i] + size[i] <= Di for i in [0, n)
begin: begin[i] specifies the offset into the 'i'th dimension of
'input' to slice from.
size: size[i] specifies the number of elements of the 'i'th dimension
of 'input' to slice. If size[i] is -1, all remaining elements in dimension
i are included in the slice (i.e. this is equivalent to setting
size[i] = input.dim_size(i) - begin[i]).
)doc");
REGISTER_OP("StridedSlice")
.Input("input: T")
.Input("begin: Index")
.Input("end: Index")
.Input("strides: Index")
.Output("output: T")
.Attr("T: type")
.Attr("Index: {int32, int64}")
.Attr("begin_mask: int = 0")
.Attr("end_mask: int = 0")
.Attr("ellipsis_mask: int = 0")
.Attr("new_axis_mask: int = 0")
.Attr("shrink_axis_mask: int = 0")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle input = c->input(0);
ShapeHandle begin_shape, end_shape, strides_shape;
TF_RETURN_IF_ERROR(c->WithRank(c->input(1), 1, &begin_shape));
TF_RETURN_IF_ERROR(c->WithRank(c->input(2), 1, &end_shape));
TF_RETURN_IF_ERROR(c->WithRank(c->input(3), 1, &strides_shape));
TF_RETURN_IF_ERROR(c->Merge(begin_shape, end_shape, &begin_shape));
TF_RETURN_IF_ERROR(c->Merge(begin_shape, strides_shape, &begin_shape));
DimensionHandle sparse_dims_dim = c->Dim(begin_shape, 0);
const Tensor* strides_value = c->input_tensor(3);
// TODO(aselle,allenl): If we had a stride_mask it would be possible to do
// more shape inference here (e.g. for x[3, ::T]).
if (!c->RankKnown(input) || !c->ValueKnown(sparse_dims_dim) ||
strides_value == nullptr) {
c->set_output(0, c->UnknownShape());
return Status::OK();
}
TensorShapeProto input_shape_proto;
for (int i = 0; i < c->Rank(input); ++i) {
auto dim = c->Dim(input, i);
input_shape_proto.add_dim()->set_size(c->ValueKnown(dim) ? c->Value(dim)
: -1);
}
int32 begin_mask, end_mask, ellipsis_mask, new_axis_mask,
shrink_axis_mask;
TF_RETURN_IF_ERROR(c->GetAttr("begin_mask", &begin_mask));
TF_RETURN_IF_ERROR(c->GetAttr("end_mask", &end_mask));
TF_RETURN_IF_ERROR(c->GetAttr("ellipsis_mask", &ellipsis_mask));
TF_RETURN_IF_ERROR(c->GetAttr("new_axis_mask", &new_axis_mask));
TF_RETURN_IF_ERROR(c->GetAttr("shrink_axis_mask", &shrink_axis_mask));
const Tensor* begin_value = c->input_tensor(1);
const Tensor* end_value = c->input_tensor(2);
TensorShapeProto processing_shape, final_shape;
ShapeReadWriteFromTensorShapeProto wrapped_processing_shape(
&processing_shape);
ShapeReadWriteFromTensorShapeProto wrapped_final_shape(&final_shape);
bool is_identity, is_simple_slice, slice_dim0;
gtl::InlinedVector<int64, 4> begin, end, strides;
TF_RETURN_IF_ERROR(ValidateStridedSliceOp(
begin_value, end_value, *strides_value,
ShapeReadWriteFromTensorShapeProto(&input_shape_proto), begin_mask,
end_mask, ellipsis_mask, new_axis_mask, shrink_axis_mask,
&wrapped_processing_shape, &wrapped_final_shape, &is_identity,
&is_simple_slice, &slice_dim0, &begin, &end, &strides));
ShapeHandle out;
TF_RETURN_IF_ERROR(c->MakeShapeFromShapeProto(final_shape, &out));
c->set_output(0, out);
return Status::OK();
})
.Doc(R"doc(
Return a strided slice from `input`.
Note, most python users will want to use the Python `Tensor.__getitem__`
or `Variable.__getitem__` rather than this op directly.
The goal of this op is to produce a new tensor with a subset of
the elements from the `n` dimensional `input` tensor. The subset is chosen using
a sequence of `m` sparse range specifications encoded into the arguments
of this function. Note, in some cases
`m` could be equal to `n`, but this need not be the case. Each
range specification entry can be one of the following:
- An ellipsis (...). Ellipses are used to imply zero or more
dimensions of full-dimension selection and are produced using
`ellipsis_mask`. For example, `foo[...]` is the identity slice.
- A new axis. This is used to insert a new shape=1 dimension and is
produced using `new_axis_mask`. For example, `foo[:, ...]` where
`foo` is shape `(3, 4)` produces a `(1, 3, 4)` tensor.
- A range `begin:end:stride`. This is used to specify how much to choose from
a given dimension. `stride` can be any integer but 0. `begin` is an integer
which represents the index of the first value to select while `end` represents
the index of the last value to select. The number of values selected in each
dimension is `end - begin` if `stride > 0` and `begin - end` if `stride < 0`.
`begin` and `end` can be negative where `-1` is the last element, `-2` is
the second to last. `begin_mask` controls whether to replace the explicitly
given `begin` with an implicit effective value of `0` if `stride > 0` and
`-1` if `stride < 0`. `end_mask` is analogous but produces the number
required to create the largest open interval. For example, given a shape
`(3,)` tensor `foo[:]`, the effective `begin` and `end` are `0` and `3`. Do
not assume this is equivalent to `foo[0:-1]` which has an effective `begin`
and `end` of `0` and `2`. Another example is `foo[-2::-1]` which reverses the
first dimension of a tensor while dropping the last two (in the original
order elements). For example `foo = [1,2,3,4]; foo[-2::-1]` is `[4,3]`.
- A single index. This is used to keep only elements that have a given
index. For example (`foo[2, :]` on a shape `(5,6)` tensor produces a
shape `(6,)` tensor. This is encoded in `begin` and `end` and
`shrink_axis_mask`.
Each conceptual range specification is encoded in the op's argument. This
encoding is best understand by considering a non-trivial example. In
particular,
`foo[1, 2:4, None, ..., :-3:-1, :]` will be encoded as
```prettyprint
begin = [1, 2, x, x, 0, x] # x denotes don't care (usually 0)
end = [2, 4, x, x, -3, x]
strides = [1, 1, x, x, -1, 1]
begin_mask = 1<<4 | 1 << 5 = 48
end_mask = 1<<5 = 32
ellipsis_mask = 1<<3 = 8
new_axis_mask = 1<<2 4
shrink_axis_mask = 1<<0
```
In this case if `foo.shape` is (5, 5, 5, 5, 5, 5) the final shape of
the slice becomes (2, 1, 5, 5, 2, 5).
Let us walk step by step through each argument specification.
1. The first argument in the example slice is turned into `begin = 1` and
`end = begin + 1 = 2`. To disambiguate from the original spec `2:4` we
also set the appropriate bit in `shrink_axis_mask`.
2. `2:4` is contributes 2, 4, 1 to begin, end, and stride. All masks have
zero bits contributed.
3. None is a synonym for `tf.newaxis`. This means insert a dimension of size 1
dimension in the final shape. Dummy values are contributed to begin,
end and stride, while the new_axis_mask bit is set.
4. `...` grab the full ranges from as many dimensions as needed to
fully specify a slice for every dimension of the input shape.
5. `:-3:-1` shows the use of negative indices. A negative index `i` associated
with a dimension that has shape `s` is converted to a positive index
`s + i`. So `-1` becomes `s-1` (i.e. the last element). This conversion
is done internally so begin, end and strides receive x, -3, and -1.
The appropriate begin_mask bit is set to indicate the start range is the
full range (ignoring the x).
6. `:` indicates that the entire contents of the corresponding dimension
is selected. This is equivalent to `::` or `0::1`. begin, end, and strides
receive 0, 0, and 1, respectively. The appropriate bits in `begin_mask` and
`end_mask` are also set.
*Requirements*:
`0 != strides[i] for i in [0, m)`
`ellipsis_mask must be a power of two (only one ellipsis)`
begin: `begin[k]` specifies the offset into the `k`th range specification.
The exact dimension this corresponds to will be determined by context.
Out-of-bounds values will be silently clamped. If the `k`th bit of
`begin_mask` then `begin[k]` is ignored and the full range of the
appropriate dimension is used instead. Negative values causes indexing
to start from the highest element e.g. If `foo==[1,2,3]` then `foo[-1]==3`.
end: `end[i]` is like `begin` with the exception that `end_mask` is
used to determine full ranges.
strides: `strides[i]` specifies the increment in the `i`th specification
after extracting a given element. Negative indices will reverse
the original order. Out or range values are
clamped to `[0,dim[i]) if slice[i]>0` or `[-1,dim[i]-1] if slice[i] < 0`
begin_mask: a bitmask where a bit i being 1 means to ignore the begin
value and instead use the largest interval possible. At runtime
begin[i] will be replaced with `[0, n-1) if `stride[i] > 0` or
`[-1, n-1]` if `stride[i] < 0`
end_mask: analogous to `begin_mask`
ellipsis_mask: a bitmask where bit `i` being 1 means the `i`th
position is actually an ellipsis. One bit at most can be 1.
If `ellipsis_mask == 0`, then an implicit ellipsis mask of `1 << (m+1)`
is provided. This means that `foo[3:5] == foo[3:5, ...]`. An ellipsis
implicitly creates as many range specifications as necessary to fully
specify the sliced range for every dimension. For example for a 4-dimensional
tensor `foo` the slice `foo[2, ..., 5:8]` implies `foo[2, :, :, 5:8]`.
new_axis_mask: a bitmask where bit `i` being 1 means the `i`th
specification creates a new shape 1 dimension. For example
`foo[:4, tf.newaxis, :2]` would produce a shape `(4, 1, 2)` tensor.
shrink_axis_mask: a bitmask where bit `i` implies that the `i`th
specification should shrink the dimensionality. begin and end
must imply a slice of size 1 in the dimension. For example in
python one might do `foo[:, 3, :]` which would result in
`shrink_axis_mask` being 2.
)doc");
REGISTER_OP("StridedSliceGrad")
.Input("shape: Index")
.Input("begin: Index")
.Input("end: Index")
.Input("strides: Index")
.Input("dy: T")
.Output("output: T")
.Attr("T: type")
.Attr("Index: {int32, int64}")
.Attr("begin_mask: int = 0")
.Attr("end_mask: int = 0")
.Attr("ellipsis_mask: int = 0")
.Attr("new_axis_mask: int = 0")
.Attr("shrink_axis_mask: int = 0")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle out;
TF_RETURN_IF_ERROR(c->MakeShapeFromShapeTensor(0, &out));
c->set_output(0, out);
return Status::OK();
})
.Doc(R"doc(
Returns the gradient of `StridedSlice`.
Since `StridedSlice` cuts out pieces of its `input` which is size
`shape`, its gradient will have the same shape (which is passed here
as `shape`). The gradient will be zero in any element that the slice
does not select.
Arguments are the same as StridedSliceGrad with the exception that
`dy` is the input gradient to be propagated and `shape` is the
shape of `StridedSlice`'s `input`.
)doc");
REGISTER_OP("StridedSliceAssign")
.Input("ref: Ref(T)")
.Input("begin: Index")
.Input("end: Index")
.Input("strides: Index")
.Input("value: T")
.Output("output_ref: Ref(T)")
.Attr("T: type")
.Attr("Index: {int32, int64}")
.Attr("begin_mask: int = 0")
.Attr("end_mask: int = 0")
.Attr("ellipsis_mask: int = 0")
.Attr("new_axis_mask: int = 0")
.Attr("shrink_axis_mask: int = 0")
.SetShapeFn(shape_inference::UnchangedShape)
.Doc(R"doc(
Assign `value` to the sliced l-value reference of `ref`.
The values of `value` are assigned to the positions in the variable
`ref` that are selected by the slice parameters. The slice parameters
`begin, `end`, `strides`, etc. work exactly as in `StridedSlice`.
NOTE this op currently does not support broadcasting and so `value`'s
shape must be exactly the shape produced by the slice of `ref`.
)doc");
// TODO(aselle): Fix this documentation once StridedSliceAssign Supports
// broadcasting.
// --------------------------------------------------------------------------
REGISTER_OP("Tile")
.Input("input: T")
.Input("multiples: Tmultiples")
.Output("output: T")
.Attr("T: type")
.Attr("Tmultiples: {int32, int64} = DT_INT32")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle input = c->input(0);
// NOTE(mrry): Represent `multiples` as a `TensorShape` because (i)
// it is a vector of non-negative integers, and (ii) doing so allows
// us to handle partially-known multiples.
ShapeHandle multiples;
TF_RETURN_IF_ERROR(c->MakeShapeFromShapeTensor(1, &multiples));
if (c->RankKnown(input)) {
TF_RETURN_IF_ERROR(c->WithRank(multiples, c->Rank(input), &multiples));
}
if (!c->RankKnown(multiples)) {
return shape_inference::UnknownShape(c);
}
int32 rank = c->Rank(multiples);
TF_RETURN_IF_ERROR(c->WithRank(input, rank, &input));
std::vector<DimensionHandle> dims(rank);
for (int i = 0; i < rank; ++i) {
TF_RETURN_IF_ERROR(
c->Multiply(c->Dim(input, i), c->Dim(multiples, i), &dims[i]));
}
c->set_output(0, c->MakeShape(dims));
return Status::OK();
})
.Doc(R"doc(
Constructs a tensor by tiling a given tensor.
This operation creates a new tensor by replicating `input` `multiples` times.
The output tensor's i'th dimension has `input.dims(i) * multiples[i]` elements,
and the values of `input` are replicated `multiples[i]` times along the 'i'th
dimension. For example, tiling `[a b c d]` by `[2]` produces
`[a b c d a b c d]`.
input: 1-D or higher.
multiples: 1-D. Length must be the same as the number of dimensions in `input`
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("TileGrad")
.Input("input: T")
.Input("multiples: int32")
.Output("output: T")
.Attr("T: type")
.Deprecated(3, "TileGrad has been replaced with reduce_sum")
.SetShapeFn(tensorflow::shape_inference::UnknownShape)
.Doc(R"doc(
Returns the gradient of `Tile`.
Since `Tile` takes an input and repeats the input `multiples` times
along each dimension, `TileGrad` takes in `multiples` and aggregates
each repeated tile of `input` into `output`.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("Where")
.Input("input: bool")
.Output("index: int64")
.SetShapeFn([](InferenceContext* c) {
c->set_output(0, c->Matrix(c->UnknownDim(), c->Rank(c->input(0))));
return Status::OK();
})
.Doc(R"doc(
Returns locations of true values in a boolean tensor.
This operation returns the coordinates of true elements in `input`. The
coordinates are returned in a 2-D tensor where the first dimension (rows)
represents the number of true elements, and the second dimension (columns)
represents the coordinates of the true elements. Keep in mind, the shape of
the output tensor can vary depending on how many true values there are in
`input`. Indices are output in row-major order.
For example:
```prettyprint
# 'input' tensor is [[True, False]
# [True, False]]
# 'input' has two true values, so output has two coordinates.
# 'input' has rank of 2, so coordinates have two indices.
where(input) ==> [[0, 0],
[1, 0]]
# `input` tensor is [[[True, False]
# [True, False]]
# [[False, True]
# [False, True]]
# [[False, False]
# [False, True]]]
# 'input' has 5 true values, so output has 5 coordinates.
# 'input' has rank of 3, so coordinates have three indices.
where(input) ==> [[0, 0, 0],
[0, 1, 0],
[1, 0, 1],
[1, 1, 1],
[2, 1, 1]]
```
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("BroadcastArgs")
.Input("s0: T")
.Input("s1: T")
.Output("r0: T")
.Attr("T: {int32, int64} = DT_INT32")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle unused;
ShapeHandle shape_x = c->input(0);
ShapeHandle shape_y = c->input(1);
TF_RETURN_IF_ERROR(c->WithRank(shape_x, 1, &unused));
TF_RETURN_IF_ERROR(c->WithRank(shape_y, 1, &unused));
if (!c->ValueKnown(c->Dim(shape_x, 0)) ||
!c->ValueKnown(c->Dim(shape_y, 0))) {
c->set_output(0, c->Vector(InferenceContext::kUnknownDim));
return Status::OK();
}
int64 x_dim = c->Value(c->Dim(shape_x, 0));
int64 y_dim = c->Value(c->Dim(shape_y, 0));
// Broadcasted shape is going to be as large as the largest dimension.
c->set_output(0, c->Vector(std::max(x_dim, y_dim)));
return Status::OK();
})
.Doc(R"doc(
Return the shape of s0 op s1 with broadcast.
Given `s0` and `s1`, tensors that represent shapes, compute `r0`, the
broadcasted shape. `s0`, `s1` and `r0` are all integer vectors.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("BroadcastGradientArgs")
.Input("s0: T")
.Input("s1: T")
.Output("r0: T")
.Output("r1: T")
.Attr("T: {int32, int64} = DT_INT32")
.SetShapeFn([](InferenceContext* c) {
// TODO(mrry): Implement constant_value for BroadcastGradientArgs?
ShapeHandle unused;
TF_RETURN_IF_ERROR(c->WithRank(c->input(0), 1, &unused));
TF_RETURN_IF_ERROR(c->WithRank(c->input(1), 1, &unused));
c->set_output(0, c->Vector(InferenceContext::kUnknownDim));
c->set_output(1, c->Vector(InferenceContext::kUnknownDim));
return Status::OK();
})
.Doc(R"doc(
Return the reduction indices for computing gradients of s0 op s1 with broadcast.
This is typically used by gradient computations for a broadcasting operation.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("Pad")
.Input("input: T")
.Input("paddings: Tpaddings")
.Output("output: T")
.Attr("T: type")
.Attr("Tpaddings: {int32, int64} = DT_INT32")
.SetShapeFn(PadShapeFn)
.Doc(R"doc(
Pads a tensor with zeros.
This operation pads a `input` with zeros according to the `paddings` you
specify. `paddings` is an integer tensor with shape `[Dn, 2]`, where n is the
rank of `input`. For each dimension D of `input`, `paddings[D, 0]` indicates
how many zeros to add before the contents of `input` in that dimension, and
`paddings[D, 1]` indicates how many zeros to add after the contents of `input`
in that dimension.
The padded size of each dimension D of the output is:
`paddings(D, 0) + input.dim_size(D) + paddings(D, 1)`
For example:
```prettyprint
# 't' is [[1, 1], [2, 2]]
# 'paddings' is [[1, 1], [2, 2]]
# rank of 't' is 2
pad(t, paddings) ==> [[0, 0, 0, 0, 0, 0]
[0, 0, 1, 1, 0, 0]
[0, 0, 2, 2, 0, 0]
[0, 0, 0, 0, 0, 0]]
```
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("MirrorPad")
.Input("input: T")
.Input("paddings: Tpaddings")
.Output("output: T")
.Attr("T: type")
.Attr("Tpaddings: {int32, int64} = DT_INT32")
.Attr(GetMirrorPadModeAttrString())
.SetShapeFn(PadShapeFn)
.Doc(R"doc(
Pads a tensor with mirrored values.
This operation pads a `input` with mirrored values according to the `paddings`
you specify. `paddings` is an integer tensor with shape `[n, 2]`, where n is
the rank of `input`. For each dimension D of `input`, `paddings[D, 0]` indicates
how many values to add before the contents of `input` in that dimension, and
`paddings[D, 1]` indicates how many values to add after the contents of `input`
in that dimension. Both `paddings[D, 0]` and `paddings[D, 1]` must be no greater
than `input.dim_size(D)` (or `input.dim_size(D) - 1`) if `copy_border` is true
(if false, respectively).
The padded size of each dimension D of the output is:
`paddings(D, 0) + input.dim_size(D) + paddings(D, 1)`
For example:
```prettyprint
# 't' is [[1, 2, 3], [4, 5, 6]].
# 'paddings' is [[1, 1]], [2, 2]].
# 'mode' is SYMMETRIC.
# rank of 't' is 2.
pad(t, paddings) ==> [[2, 1, 1, 2, 3, 3, 2]
[2, 1, 1, 2, 3, 3, 2]
[5, 4, 4, 5, 6, 6, 5]
[5, 4, 4, 5, 6, 6, 5]]
```
input: The input tensor to be padded.
paddings: A two-column matrix specifying the padding sizes. The number of
rows must be the same as the rank of `input`.
mode: Either `REFLECT` or `SYMMETRIC`. In reflect mode the padded regions
do not include the borders, while in symmetric mode the padded regions
do include the borders. For example, if `input` is `[1, 2, 3]` and `paddings`
is `[0, 2]`, then the output is `[1, 2, 3, 2, 1]` in reflect mode, and
it is `[1, 2, 3, 3, 2]` in symmetric mode.
output: The padded tensor.
)doc");
// --------------------------------------------------------------------------
namespace {
template <typename T>
Status MirrorPadKnown(InferenceContext* c, ShapeHandle input,
const Tensor* paddings_t, int32 input_rank) {
auto paddings_data = paddings_t->matrix<T>();
std::vector<DimensionHandle> dims(input_rank);
for (int i = 0; i < input_rank; ++i) {
const int64 pad0 = static_cast<int64>(paddings_data(i, 0));
const int64 pad1 = static_cast<int64>(paddings_data(i, 1));
if (pad0 < 0 || pad1 < 0) {
return errors::InvalidArgument("Paddings must be non-negative");
}
TF_RETURN_IF_ERROR(c->Subtract(c->Dim(input, i), pad0 + pad1, &dims[i]));
}
c->set_output(0, c->MakeShape(dims));
return Status::OK();
}
} // namespace
REGISTER_OP("MirrorPadGrad")
.Input("input: T")
.Input("paddings: Tpaddings")
.Output("output: T")
.Attr("T: type")
.Attr("Tpaddings: {int32, int64} = DT_INT32")
.Attr(GetMirrorPadModeAttrString())
.SetShapeFn([](InferenceContext* c) {
ShapeHandle paddings;
TF_RETURN_IF_ERROR(c->WithRank(c->input(1), 2, &paddings));
DimensionHandle pad_0 = c->Dim(paddings, 0);
if (!c->ValueKnown(pad_0)) {
// We don't know the rank of the output since the first
// padding dimension is unknown.
c->set_output(0, c->UnknownShape());
return Status::OK();
}
int64 input_rank = c->Value(pad_0);
ShapeHandle input;
TF_RETURN_IF_ERROR(c->WithRank(c->input(0), input_rank, &input));
TF_RETURN_IF_ERROR(
c->Merge(paddings, c->Matrix(input_rank, 2), &paddings));
const Tensor* paddings_t = c->input_tensor(1);
if (paddings_t == nullptr) {
// Values of 'paddings' is not available, but we know the
// input rank, so return the rank of the output with unknown
// dimensions.
c->set_output(0, c->UnknownShapeOfRank(input_rank));
return Status::OK();
}
if (paddings_t->dtype() == DT_INT32) {
return MirrorPadKnown<int32>(c, input, paddings_t, input_rank);
} else {
return MirrorPadKnown<int64>(c, input, paddings_t, input_rank);
}
})
.Doc(R"doc(
Gradient op for `MirrorPad` op. This op folds a mirror-padded tensor.
This operation folds the padded areas of `input` by `MirrorPad` according to the
`paddings` you specify. `paddings` must be the same as `paddings` argument
given to the corresponding `MirrorPad` op.
The folded size of each dimension D of the output is:
`input.dim_size(D) - paddings(D, 0) - paddings(D, 1)`
For example:
```prettyprint
# 't' is [[1, 2, 3], [4, 5, 6], [7, 8, 9]].
# 'paddings' is [[0, 1]], [0, 1]].
# 'mode' is SYMMETRIC.
# rank of 't' is 2.
pad(t, paddings) ==> [[ 1, 5]
[11, 28]]
```
input: The input tensor to be folded.
paddings: A two-column matrix specifying the padding sizes. The number of
rows must be the same as the rank of `input`.
mode: The mode used in the `MirrorPad` op.
output: The folded tensor.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("Placeholder")
.Output("output: dtype")
.Attr("dtype: type")
.Attr("shape: shape = {}")
.SetShapeFn([](InferenceContext* c) {
PartialTensorShape shape;
TF_RETURN_IF_ERROR(c->GetAttr("shape", &shape));
// Placeholder has legacy behavior where we cannot tell the difference
// between a scalar shape attribute and 'unknown shape'. So if the shape
// is a scalar, we return an unknown shape.
if (shape.dims() <= 0) {
return shape_inference::UnknownShape(c);
}
TensorShapeProto shape_proto;
shape.AsProto(&shape_proto);
ShapeHandle out;
TF_RETURN_IF_ERROR(c->MakeShapeFromShapeProto(shape_proto, &out));
c->set_output(0, out);
return Status::OK();
})
.Doc(R"doc(
A placeholder op for a value that will be fed into the computation.
N.B. This operation will fail with an error if it is executed. It is
intended as a way to represent a value that will always be fed, and to
provide attrs that enable the fed value to be checked at runtime.
output: A placeholder tensor that must be replaced using the feed mechanism.
dtype: The type of elements in the tensor.
shape: (Optional) The shape of the tensor. If the shape has 0 dimensions, the
shape is unconstrained.
)doc");
// This version fixes an issue with the original version of Placeholder
// where the empty shape attribute "[]" was used to denote
// an unknown shape. This meant that scalars (added later) could
// not be represented natively. This new version fixes that
// limitation.
REGISTER_OP("PlaceholderV2")
.Output("output: dtype")
.Attr("dtype: type")
.Attr("shape: shape")
.SetShapeFn([](InferenceContext* c) {
TensorShapeProto shape;
TF_RETURN_IF_ERROR(c->GetAttr("shape", &shape));
ShapeHandle output;
TF_RETURN_IF_ERROR(c->MakeShapeFromShapeProto(shape, &output));
c->set_output(0, output);
return Status::OK();
})
.Doc(R"doc(
A placeholder op for a value that will be fed into the computation.
N.B. This operation will fail with an error if it is executed. It is
intended as a way to represent a value that will always be fed, and to
provide attrs that enable the fed value to be checked at runtime.
output: A placeholder tensor that must be replaced using the feed mechanism.
dtype: The type of elements in the tensor.
shape: The shape of the tensor. The shape can be any partially-specified
shape. To be unconstrained, pass in a shape with unknown rank.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("PlaceholderWithDefault")
.Input("input: dtype")
.Output("output: dtype")
.Attr("dtype: type")
.Attr("shape: shape")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle input = c->input(0);
PartialTensorShape shape;
TF_RETURN_IF_ERROR(c->GetAttr("shape", &shape));
TensorShapeProto shape_proto;
shape.AsProto(&shape_proto);
ShapeHandle out;
TF_RETURN_IF_ERROR(c->MakeShapeFromShapeProto(shape_proto, &out));
// We merge for compatibility checking, but return the output,
// since output_shape may be less precise than input_shape.
ShapeHandle unused;
TF_RETURN_IF_ERROR(c->Merge(input, out, &unused));
c->set_output(0, out);
return Status::OK();
})
.Doc(R"doc(
A placeholder op that passes through `input` when its output is not fed.
input: The default value to produce when `output` is not fed.
output: A placeholder tensor that defaults to `input` if it is not fed.
dtype: The type of elements in the tensor.
shape: The (possibly partial) shape of the tensor.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("ExpandDims")
.Input("input: T")
.Input("dim: Tdim")
.Output("output: T")
.Attr("T: type")
.Attr("Tdim: {int32, int64} = DT_INT32")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle input = c->input(0);
const Tensor* dim_t = c->input_tensor(1);
if (dim_t != nullptr && dim_t->NumElements() != 1) {
return errors::InvalidArgument(
"'dim' input must be a tensor with a single value");
}
if (dim_t == nullptr || !c->RankKnown(input)) {
c->set_output(0, c->UnknownShape());
return Status::OK();
}
int64 dim;
if (dim_t->dtype() == DT_INT32) {
dim = static_cast<int64>(dim_t->flat<int32>()(0));
} else {
dim = dim_t->flat<int64>()(0);
}
const int32 rank = c->Rank(input);
const int32 min_dim = -1 * rank - 1;
if (dim < min_dim || dim > rank) {
return errors::InvalidArgument("dim ", dim, " not in the interval [",
min_dim, ", ", rank, "].");
}
if (dim < 0) {
dim += rank + 1;
}
ShapeHandle end;
TF_RETURN_IF_ERROR(c->Subshape(input, dim, &end));
// Build output as start + 1 + end.
ShapeHandle output;
TF_RETURN_IF_ERROR(c->Subshape(input, 0, dim, &output));
TF_RETURN_IF_ERROR(c->Concatenate(output, c->Vector(1), &output));
TF_RETURN_IF_ERROR(c->Concatenate(output, end, &output));
c->set_output(0, output);
return Status::OK();
})
.Doc(R"doc(
Inserts a dimension of 1 into a tensor's shape.
Given a tensor `input`, this operation inserts a dimension of 1 at the
dimension index `dim` of `input`'s shape. The dimension index `dim` starts at
zero; if you specify a negative number for `dim` it is counted backward from
the end.
This operation is useful if you want to add a batch dimension to a single
element. For example, if you have a single image of shape `[height, width,
channels]`, you can make it a batch of 1 image with `expand_dims(image, 0)`,
which will make the shape `[1, height, width, channels]`.
Other examples:
```prettyprint
# 't' is a tensor of shape [2]
shape(expand_dims(t, 0)) ==> [1, 2]
shape(expand_dims(t, 1)) ==> [2, 1]
shape(expand_dims(t, -1)) ==> [2, 1]
# 't2' is a tensor of shape [2, 3, 5]
shape(expand_dims(t2, 0)) ==> [1, 2, 3, 5]
shape(expand_dims(t2, 2)) ==> [2, 3, 1, 5]
shape(expand_dims(t2, 3)) ==> [2, 3, 5, 1]
```
This operation requires that:
`-1-input.dims() <= dim <= input.dims()`
This operation is related to `squeeze()`, which removes dimensions of
size 1.
dim: 0-D (scalar). Specifies the dimension index at which to
expand the shape of `input`.
output: Contains the same data as `input`, but its shape has an additional
dimension of size 1 added.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("Squeeze")
.Input("input: T")
.Output("output: T")
.Attr("T: type")
.Attr("squeeze_dims: list(int) >= 0 = []")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle input = c->input(0);
if (!c->RankKnown(input)) {
// Input shape unknown.
return shape_inference::UnknownShape(c);
}
const int32 input_rank = c->Rank(input);
// Validate and wrap squeeze dimensions.
std::vector<int32> squeeze_dims;
TF_RETURN_IF_ERROR(c->GetAttr("squeeze_dims", &squeeze_dims));
for (int i = 0; i < squeeze_dims.size(); ++i) {
if (squeeze_dims[i] < -input_rank || squeeze_dims[i] >= input_rank) {
return errors::InvalidArgument("squeeze_dims[", i, "] not in [",
-input_rank, ",", input_rank, ").");
}
if (squeeze_dims[i] < 0) {
squeeze_dims[i] += input_rank;
}
}
std::vector<DimensionHandle> result_shape;
for (int i = 0; i < input_rank; ++i) {
// True if squeeze_dims contains an entry to squeeze this
// dimension.
bool is_explicit_match =
std::find(squeeze_dims.begin(), squeeze_dims.end(), i) !=
squeeze_dims.end();
DimensionHandle dim = c->Dim(input, i);
if (!c->ValueKnown(dim)) {
// Assume that the squeezed dimension will be 1 at runtime.
if (is_explicit_match) continue;
// If squeezing all 1 dimensions, and we see an unknown value,
// give up and return Unknown Shape.
if (squeeze_dims.empty()) {
c->set_output(0, c->UnknownShape());
return Status::OK();
}
} else if (c->Value(dim) == 1) {
if (is_explicit_match || squeeze_dims.empty()) {
// If explicitly squeezing, or squeezing all 1s, remove
// this dimension.
continue;
}
} else if (is_explicit_match) {
return errors::InvalidArgument("Can not squeeze dim[", i,
"], expected a dimension of 1, got ",
c->Value(c->Dim(input, i)));
}
result_shape.emplace_back(dim);
}
c->set_output(0, c->MakeShape(result_shape));
return Status::OK();
})
.Doc(R"doc(
Removes dimensions of size 1 from the shape of a tensor.
Given a tensor `input`, this operation returns a tensor of the same type with
all dimensions of size 1 removed. If you don't want to remove all size 1
dimensions, you can remove specific size 1 dimensions by specifying
`squeeze_dims`.
For example:
```prettyprint
# 't' is a tensor of shape [1, 2, 1, 3, 1, 1]
shape(squeeze(t)) ==> [2, 3]
```
Or, to remove specific size 1 dimensions:
```prettyprint
# 't' is a tensor of shape [1, 2, 1, 3, 1, 1]
shape(squeeze(t, [2, 4])) ==> [1, 2, 3, 1]
```
input: The `input` to squeeze.
squeeze_dims: If specified, only squeezes the dimensions listed. The dimension
index starts at 0. It is an error to squeeze a dimension that is not 1.
output: Contains the same data as `input`, but has one or more dimensions of
size 1 removed.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("ListDiff")
.Input("x: T")
.Input("y: T")
.Output("out: T")
.Output("idx: out_idx")
.Attr("T: type")
.Attr("out_idx: {int32, int64} = DT_INT32")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle unused;
TF_RETURN_IF_ERROR(c->WithRank(c->input(0), 1, &unused));
TF_RETURN_IF_ERROR(c->WithRank(c->input(1), 1, &unused));
// TODO(mrry): Indicate that the length falls within an interval?
ShapeHandle out = c->Vector(InferenceContext::kUnknownDim);
c->set_output(0, out);
c->set_output(1, out);
return Status::OK();
})
.Doc(R"doc(
Computes the difference between two lists of numbers or strings.
Given a list `x` and a list `y`, this operation returns a list `out` that
represents all values that are in `x` but not in `y`. The returned list `out`
is sorted in the same order that the numbers appear in `x` (duplicates are
preserved). This operation also returns a list `idx` that represents the
position of each `out` element in `x`. In other words:
`out[i] = x[idx[i]] for i in [0, 1, ..., len(out) - 1]`
For example, given this input:
```prettyprint
x = [1, 2, 3, 4, 5, 6]
y = [1, 3, 5]
```
This operation would return:
```prettyprint
out ==> [2, 4, 6]
idx ==> [1, 3, 5]
```
x: 1-D. Values to keep.
y: 1-D. Values to remove.
out: 1-D. Values present in `x` but not in `y`.
idx: 1-D. Positions of `x` values preserved in `out`.
)doc");
namespace {
// Converts Tensor to flat std::vector<int64>.
template <typename InputType>
std::vector<int64> GetFlatInt64(const Tensor& t) {
std::vector<int64> output(t.shape().num_elements());
auto eigen_vec = t.flat<InputType>();
std::copy_n(&eigen_vec(0), output.size(), output.begin());
return output;
}
// Converts int32 or int64 Tensor to flat std::vector<int64>.
std::vector<int64> GetFlatInt64(const Tensor& t) {
if (t.dtype() == DT_INT32) {
return GetFlatInt64<int32>(t);
} else {
return GetFlatInt64<int64>(t);
}
}
Status SpaceToBatchShapeHelper(InferenceContext* c, ShapeHandle input_shape,
ShapeHandle block_shape_shape,
const Tensor* block_shape_t,
ShapeHandle paddings_shape,
const Tensor* paddings_t) {
if (c->Rank(block_shape_shape) != 1) {
return errors::InvalidArgument("block_shape must have rank 1.");
}
const DimensionHandle num_block_dims_handle = c->Dim(block_shape_shape, 0);
if (!c->ValueKnown(num_block_dims_handle)) {
return errors::InvalidArgument("block_shape must have known size.");
}
const int64 num_block_dims = c->Value(num_block_dims_handle);
TF_RETURN_IF_ERROR(
c->WithRankAtLeast(input_shape, num_block_dims + 1, &input_shape));
TF_RETURN_IF_ERROR(
c->Merge(paddings_shape, c->Matrix(num_block_dims, 2), &paddings_shape));
DimensionHandle batch_size = c->Dim(input_shape, 0);
std::vector<int64> block_shape_vec;
if (block_shape_t) {
block_shape_vec = GetFlatInt64(*block_shape_t);
for (int64 dim = 0; dim < num_block_dims; ++dim) {
const int64 block_shape_value = block_shape_vec[dim];
if (block_shape_value < 1) {
return errors::InvalidArgument("block_shape must be positive");
}
if (c->ValueKnown(batch_size)) {
TF_RETURN_IF_ERROR(
c->Multiply(batch_size, block_shape_value, &batch_size));
} else {
batch_size = c->UnknownDim();
}
}
} else if (num_block_dims > 0) {
batch_size = c->UnknownDim();
}
std::vector<DimensionHandle> output_dims{batch_size};
output_dims.resize(num_block_dims + 1, c->UnknownDim());
if (paddings_t) {
const std::vector<int64> paddings_vec = GetFlatInt64(*paddings_t);
for (int64 dim = 0; dim < num_block_dims; ++dim) {
const int64 pad_start = paddings_vec[dim * 2],
pad_end = paddings_vec[dim * 2 + 1];
if (pad_start < 0 || pad_end < 0) {
return errors::InvalidArgument("paddings cannot be negative");
}
if (block_shape_t) {
DimensionHandle padded_size;
TF_RETURN_IF_ERROR(
c->Add(c->Dim(input_shape, dim + 1), pad_start, &padded_size));
TF_RETURN_IF_ERROR(c->Add(padded_size, pad_end, &padded_size));
TF_RETURN_IF_ERROR(c->Divide(padded_size, block_shape_vec[dim],
/*evenly_divisible=*/true,
&output_dims[dim + 1]));
}
}
}
ShapeHandle remaining_input_shape;
TF_RETURN_IF_ERROR(
c->Subshape(input_shape, 1 + num_block_dims, &remaining_input_shape));
ShapeHandle result;
TF_RETURN_IF_ERROR(c->Concatenate(c->MakeShape(output_dims),
remaining_input_shape, &result));
c->set_output(0, result);
return Status::OK();
}
Status BatchToSpaceShapeHelper(InferenceContext* c, ShapeHandle input_shape,
ShapeHandle block_shape_shape,
const Tensor* block_shape_t,
ShapeHandle crops_shape, const Tensor* crops_t) {
if (c->Rank(block_shape_shape) != 1) {
return errors::InvalidArgument("block_shape must have rank 1.");
}
const DimensionHandle num_block_dims_handle = c->Dim(block_shape_shape, 0);
if (!c->ValueKnown(num_block_dims_handle)) {
return errors::InvalidArgument("block_shape must have known size.");
}
const int64 num_block_dims = c->Value(num_block_dims_handle);
TF_RETURN_IF_ERROR(
c->WithRankAtLeast(input_shape, num_block_dims + 1, &input_shape));
TF_RETURN_IF_ERROR(
c->Merge(crops_shape, c->Matrix(num_block_dims, 2), &crops_shape));
DimensionHandle batch_size = c->Dim(input_shape, 0);
std::vector<int64> block_shape_vec;
if (block_shape_t) {
block_shape_vec = GetFlatInt64(*block_shape_t);
for (int64 dim = 0; dim < num_block_dims; ++dim) {
const int64 block_shape_value = block_shape_vec[dim];
if (block_shape_value < 1) {
return errors::InvalidArgument("block_shape must be positive");
}
if (c->ValueKnown(batch_size)) {
TF_RETURN_IF_ERROR(c->Divide(batch_size, block_shape_value,
/*evenly_divisible=*/true, &batch_size));
} else {
batch_size = c->UnknownDim();
}
}
} else if (num_block_dims > 0) {
batch_size = c->UnknownDim();
}
std::vector<DimensionHandle> output_dims{batch_size};
output_dims.resize(num_block_dims + 1, c->UnknownDim());
if (crops_t) {
const std::vector<int64> crops_vec = GetFlatInt64(*crops_t);
for (int64 dim = 0; dim < num_block_dims; ++dim) {
const int64 crop_start = crops_vec[dim * 2],
crop_end = crops_vec[dim * 2 + 1];
if (crop_start < 0 || crop_end < 0) {
return errors::InvalidArgument("crops cannot be negative");
}
if (block_shape_t) {
DimensionHandle cropped_size;
TF_RETURN_IF_ERROR(c->Multiply(c->Dim(input_shape, dim + 1),
block_shape_vec[dim], &cropped_size));
TF_RETURN_IF_ERROR(
c->Subtract(cropped_size, crop_start, &cropped_size));
TF_RETURN_IF_ERROR(
c->Subtract(cropped_size, crop_end, &output_dims[dim + 1]));
}
}
}
ShapeHandle remaining_input_shape;
TF_RETURN_IF_ERROR(
c->Subshape(input_shape, 1 + num_block_dims, &remaining_input_shape));
ShapeHandle result;
TF_RETURN_IF_ERROR(c->Concatenate(c->MakeShape(output_dims),
remaining_input_shape, &result));
c->set_output(0, result);
return Status::OK();
}
} // namespace
// --------------------------------------------------------------------------
REGISTER_OP("SpaceToBatchND")
.Input("input: T")
.Input("block_shape: Tblock_shape")
.Input("paddings: Tpaddings")
.Output("output: T")
.Attr("T: type")
.Attr("Tblock_shape: {int32, int64} = DT_INT32")
.Attr("Tpaddings: {int32, int64} = DT_INT32")
.SetShapeFn([](InferenceContext* c) {
return SpaceToBatchShapeHelper(c, c->input(0), c->input(1),
c->input_tensor(1), c->input(2),
c->input_tensor(2));
})
.Doc(R"doc(
SpaceToBatch for N-D tensors of type T.
This operation divides "spatial" dimensions `[1, ..., M]` of the input into a
grid of blocks of shape `block_shape`, and interleaves these blocks with the
"batch" dimension (0) such that in the output, the spatial dimensions
`[1, ..., M]` correspond to the position within the grid, and the batch
dimension combines both the position within a spatial block and the original
batch position. Prior to division into blocks, the spatial dimensions of the
input are optionally zero padded according to `paddings`. See below for a
precise description.
input: N-D with shape `input_shape = [batch] + spatial_shape + remaining_shape`,
where spatial_shape has `M` dimensions.
block_shape: 1-D with shape `[M]`, all values must be >= 1.
paddings: 2-D with shape `[M, 2]`, all values must be >= 0.
`paddings[i] = [pad_start, pad_end]` specifies the padding for input dimension
`i + 1`, which corresponds to spatial dimension `i`. It is required that
`block_shape[i]` divides `input_shape[i + 1] + pad_start + pad_end`.
This operation is equivalent to the following steps:
1. Zero-pad the start and end of dimensions `[1, ..., M]` of the
input according to `paddings` to produce `padded` of shape `padded_shape`.
2. Reshape `padded` to `reshaped_padded` of shape:
[batch] +
[padded_shape[1] / block_shape[0],
block_shape[0],
...,
padded_shape[M] / block_shape[M-1],
block_shape[M-1]] +
remaining_shape
3. Permute dimensions of `reshaped_padded` to produce
`permuted_reshaped_padded` of shape:
block_shape +
[batch] +
[padded_shape[1] / block_shape[0],
...,
padded_shape[M] / block_shape[M-1]] +
remaining_shape
4. Reshape `permuted_reshaped_padded` to flatten `block_shape` into the batch
dimension, producing an output tensor of shape:
[batch * prod(block_shape)] +
[padded_shape[1] / block_shape[0],
...,
padded_shape[M] / block_shape[M-1]] +
remaining_shape
Some examples:
(1) For the following input of shape `[1, 2, 2, 1]`, `block_shape = [2, 2]`, and
`paddings = [[0, 0], [0, 0]]`:
```prettyprint
x = [[[[1], [2]], [[3], [4]]]]
```
The output tensor has shape `[4, 1, 1, 1]` and value:
```prettyprint
[[[[1]]], [[[2]]], [[[3]]], [[[4]]]]
```
(2) For the following input of shape `[1, 2, 2, 3]`, `block_shape = [2, 2]`, and
`paddings = [[0, 0], [0, 0]]`:
```prettyprint
x = [[[[1, 2, 3], [4, 5, 6]],
[[7, 8, 9], [10, 11, 12]]]]
```
The output tensor has shape `[4, 1, 1, 3]` and value:
```prettyprint
[[[1, 2, 3]], [[4, 5, 6]], [[7, 8, 9]], [[10, 11, 12]]]
```
(3) For the following input of shape `[1, 4, 4, 1]`, `block_shape = [2, 2]`, and
`paddings = [[0, 0], [0, 0]]`:
```prettyprint
x = [[[[1], [2], [3], [4]],
[[5], [6], [7], [8]],
[[9], [10], [11], [12]],
[[13], [14], [15], [16]]]]
```
The output tensor has shape `[4, 2, 2, 1]` and value:
```prettyprint
x = [[[[1], [3]], [[9], [11]]],
[[[2], [4]], [[10], [12]]],
[[[5], [7]], [[13], [15]]],
[[[6], [8]], [[14], [16]]]]
```
(4) For the following input of shape `[2, 2, 4, 1]`, block_shape = `[2, 2]`, and
paddings = `[[0, 0], [2, 0]]`:
```prettyprint
x = [[[[1], [2], [3], [4]],
[[5], [6], [7], [8]]],
[[[9], [10], [11], [12]],
[[13], [14], [15], [16]]]]
```
The output tensor has shape `[8, 1, 3, 1]` and value:
```prettyprint
x = [[[[0], [1], [3]]], [[[0], [9], [11]]],
[[[0], [2], [4]]], [[[0], [10], [12]]],
[[[0], [5], [7]]], [[[0], [13], [15]]],
[[[0], [6], [8]]], [[[0], [14], [16]]]]
```
Among others, this operation is useful for reducing atrous convolution into
regular convolution.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("SpaceToBatch")
.Input("input: T")
.Input("paddings: Tpaddings")
.Output("output: T")
.Attr("T: type")
.Attr("Tpaddings: {int32, int64} = DT_INT32")
.Attr("block_size: int >= 2")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle input_shape;
TF_RETURN_IF_ERROR(c->WithRank(c->input(0), 4, &input_shape));
int32 block_size;
TF_RETURN_IF_ERROR(c->GetAttr("block_size", &block_size));
Tensor block_shape(tensorflow::DT_INT64, TensorShape({2}));
auto block_shape_vec = block_shape.vec<int64>();
block_shape_vec(0) = block_size;
block_shape_vec(1) = block_size;
return SpaceToBatchShapeHelper(c, input_shape, c->MakeShape({2}),
&block_shape, c->input(1),
c->input_tensor(1));
})
.Doc(R"doc(
SpaceToBatch for 4-D tensors of type T.
This is a legacy version of the more general SpaceToBatchND.
Zero-pads and then rearranges (permutes) blocks of spatial data into batch.
More specifically, this op outputs a copy of the input tensor where values from
the `height` and `width` dimensions are moved to the `batch` dimension. After
the zero-padding, both `height` and `width` of the input must be divisible by the
block size.
input: 4-D with shape `[batch, height, width, depth]`.
paddings: 2-D tensor of non-negative integers with shape `[2, 2]`. It specifies
the padding of the input with zeros across the spatial dimensions as follows:
paddings = [[pad_top, pad_bottom], [pad_left, pad_right]]
The effective spatial dimensions of the zero-padded input tensor will be:
height_pad = pad_top + height + pad_bottom
width_pad = pad_left + width + pad_right
The attr `block_size` must be greater than one. It indicates the block size.
* Non-overlapping blocks of size `block_size x block size` in the height and
width dimensions are rearranged into the batch dimension at each location.
* The batch of the output tensor is `batch * block_size * block_size`.
* Both height_pad and width_pad must be divisible by block_size.
The shape of the output will be:
[batch*block_size*block_size, height_pad/block_size, width_pad/block_size,
depth]
Some examples:
(1) For the following input of shape `[1, 2, 2, 1]` and block_size of 2:
```prettyprint
x = [[[[1], [2]], [[3], [4]]]]
```
The output tensor has shape `[4, 1, 1, 1]` and value:
```prettyprint
[[[[1]]], [[[2]]], [[[3]]], [[[4]]]]
```
(2) For the following input of shape `[1, 2, 2, 3]` and block_size of 2:
```prettyprint
x = [[[[1, 2, 3], [4, 5, 6]],
[[7, 8, 9], [10, 11, 12]]]]
```
The output tensor has shape `[4, 1, 1, 3]` and value:
```prettyprint
[[[1, 2, 3]], [[4, 5, 6]], [[7, 8, 9]], [[10, 11, 12]]]
```
(3) For the following input of shape `[1, 4, 4, 1]` and block_size of 2:
```prettyprint
x = [[[[1], [2], [3], [4]],
[[5], [6], [7], [8]],
[[9], [10], [11], [12]],
[[13], [14], [15], [16]]]]
```
The output tensor has shape `[4, 2, 2, 1]` and value:
```prettyprint
x = [[[[1], [3]], [[9], [11]]],
[[[2], [4]], [[10], [12]]],
[[[5], [7]], [[13], [15]]],
[[[6], [8]], [[14], [16]]]]
```
(4) For the following input of shape `[2, 2, 4, 1]` and block_size of 2:
```prettyprint
x = [[[[1], [2], [3], [4]],
[[5], [6], [7], [8]]],
[[[9], [10], [11], [12]],
[[13], [14], [15], [16]]]]
```
The output tensor has shape `[8, 1, 2, 1]` and value:
```prettyprint
x = [[[[1], [3]]], [[[9], [11]]], [[[2], [4]]], [[[10], [12]]],
[[[5], [7]]], [[[13], [15]]], [[[6], [8]]], [[[14], [16]]]]
```
Among others, this operation is useful for reducing atrous convolution into
regular convolution.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("BatchToSpaceND")
.Input("input: T")
.Input("block_shape: Tblock_shape")
.Input("crops: Tcrops")
.Output("output: T")
.Attr("T: type")
.Attr("Tblock_shape: {int32, int64} = DT_INT32")
.Attr("Tcrops: {int32, int64} = DT_INT32")
.SetShapeFn([](InferenceContext* c) {
return BatchToSpaceShapeHelper(c, c->input(0), c->input(1),
c->input_tensor(1), c->input(2),
c->input_tensor(2));
})
.Doc(R"doc(
BatchToSpace for N-D tensors of type T.
This operation reshapes the "batch" dimension 0 into `M + 1` dimensions of shape
`block_shape + [batch]`, interleaves these blocks back into the grid defined by
the spatial dimensions `[1, ..., M]`, to obtain a result with the same rank as
the input. The spatial dimensions of this intermediate result are then
optionally cropped according to `crops` to produce the output. This is the
reverse of SpaceToBatch. See below for a precise description.
input: N-D with shape `input_shape = [batch] + spatial_shape + remaining_shape`,
where spatial_shape has M dimensions.
block_shape: 1-D with shape `[M]`, all values must be >= 1.
crops: 2-D with shape `[M, 2]`, all values must be >= 0.
`crops[i] = [crop_start, crop_end]` specifies the amount to crop from input
dimension `i + 1`, which corresponds to spatial dimension `i`. It is
required that
`crop_start[i] + crop_end[i] <= block_shape[i] * input_shape[i + 1]`.
This operation is equivalent to the following steps:
1. Reshape `input` to `reshaped` of shape:
[block_shape[0], ..., block_shape[M-1],
batch / prod(block_shape),
input_shape[1], ..., input_shape[N-1]]
2. Permute dimensions of `reshaped` to produce `permuted` of shape
[batch / prod(block_shape),
input_shape[1], block_shape[0],
...,
input_shape[M], block_shape[M-1],
input_shape[M+1], ..., input_shape[N-1]]
3. Reshape `permuted` to produce `reshaped_permuted` of shape
[batch / prod(block_shape),
input_shape[1] * block_shape[0],
...,
input_shape[M] * block_shape[M-1],
input_shape[M+1],
...,
input_shape[N-1]]
4. Crop the start and end of dimensions `[1, ..., M]` of
`reshaped_permuted` according to `crops` to produce the output of shape:
[batch / prod(block_shape),
input_shape[1] * block_shape[0] - crops[0,0] - crops[0,1],
...,
input_shape[M] * block_shape[M-1] - crops[M-1,0] - crops[M-1,1],
input_shape[M+1], ..., input_shape[N-1]]
Some examples:
(1) For the following input of shape `[4, 1, 1, 1]`, `block_shape = [2, 2]`, and
`crops = [[0, 0], [0, 0]]`:
```prettyprint
[[[[1]]], [[[2]]], [[[3]]], [[[4]]]]
```
The output tensor has shape `[1, 2, 2, 1]` and value:
```prettyprint
x = [[[[1], [2]], [[3], [4]]]]
```
(2) For the following input of shape `[4, 1, 1, 3]`, `block_shape = [2, 2]`, and
`crops = [[0, 0], [0, 0]]`:
```prettyprint
[[[1, 2, 3]], [[4, 5, 6]], [[7, 8, 9]], [[10, 11, 12]]]
```
The output tensor has shape `[1, 2, 2, 3]` and value:
```prettyprint
x = [[[[1, 2, 3], [4, 5, 6]],
[[7, 8, 9], [10, 11, 12]]]]
```
(3) For the following input of shape `[4, 2, 2, 1]`, `block_shape = [2, 2]`, and
`crops = [[0, 0], [0, 0]]`:
```prettyprint
x = [[[[1], [3]], [[9], [11]]],
[[[2], [4]], [[10], [12]]],
[[[5], [7]], [[13], [15]]],
[[[6], [8]], [[14], [16]]]]
```
The output tensor has shape `[1, 4, 4, 1]` and value:
```prettyprint
x = [[[1], [2], [3], [4]],
[[5], [6], [7], [8]],
[[9], [10], [11], [12]],
[[13], [14], [15], [16]]]
```
(4) For the following input of shape `[8, 1, 3, 1]`, `block_shape = [2, 2]`, and
`crops = [[0, 0], [2, 0]]`:
```prettyprint
x = [[[[0], [1], [3]]], [[[0], [9], [11]]],
[[[0], [2], [4]]], [[[0], [10], [12]]],
[[[0], [5], [7]]], [[[0], [13], [15]]],
[[[0], [6], [8]]], [[[0], [14], [16]]]]
```
The output tensor has shape `[2, 2, 4, 1]` and value:
```prettyprint
x = [[[[1], [2], [3], [4]],
[[5], [6], [7], [8]]],
[[[9], [10], [11], [12]],
[[13], [14], [15], [16]]]]
```
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("BatchToSpace")
.Input("input: T")
.Input("crops: Tidx")
.Output("output: T")
.Attr("T: type")
.Attr("block_size: int >= 2")
.Attr("Tidx: {int32, int64} = DT_INT32")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle input_shape;
TF_RETURN_IF_ERROR(c->WithRank(c->input(0), 4, &input_shape));
int32 block_size;
TF_RETURN_IF_ERROR(c->GetAttr("block_size", &block_size));
Tensor block_shape(tensorflow::DT_INT64, TensorShape({2}));
auto block_shape_vec = block_shape.vec<int64>();
block_shape_vec(0) = block_size;
block_shape_vec(1) = block_size;
return BatchToSpaceShapeHelper(c, input_shape, c->MakeShape({2}),
&block_shape, c->input(1),
c->input_tensor(1));
})
.Doc(R"doc(
BatchToSpace for 4-D tensors of type T.
This is a legacy version of the more general BatchToSpaceND.
Rearranges (permutes) data from batch into blocks of spatial data, followed by
cropping. This is the reverse transformation of SpaceToBatch. More specifically,
this op outputs a copy of the input tensor where values from the `batch`
dimension are moved in spatial blocks to the `height` and `width` dimensions,
followed by cropping along the `height` and `width` dimensions.
input: 4-D tensor with shape
`[batch*block_size*block_size, height_pad/block_size, width_pad/block_size,
depth]`. Note that the batch size of the input tensor must be divisible by
`block_size * block_size`.
crops: 2-D tensor of non-negative integers with shape `[2, 2]`. It specifies
how many elements to crop from the intermediate result across the spatial
dimensions as follows:
crops = [[crop_top, crop_bottom], [crop_left, crop_right]]
output: 4-D with shape `[batch, height, width, depth]`, where:
height = height_pad - crop_top - crop_bottom
width = width_pad - crop_left - crop_right
The attr `block_size` must be greater than one. It indicates the block size.
Some examples:
(1) For the following input of shape `[4, 1, 1, 1]` and block_size of 2:
```prettyprint
[[[[1]]], [[[2]]], [[[3]]], [[[4]]]]
```
The output tensor has shape `[1, 2, 2, 1]` and value:
```prettyprint
x = [[[[1], [2]], [[3], [4]]]]
```
(2) For the following input of shape `[4, 1, 1, 3]` and block_size of 2:
```prettyprint
[[[1, 2, 3]], [[4, 5, 6]], [[7, 8, 9]], [[10, 11, 12]]]
```
The output tensor has shape `[1, 2, 2, 3]` and value:
```prettyprint
x = [[[[1, 2, 3], [4, 5, 6]],
[[7, 8, 9], [10, 11, 12]]]]
```
(3) For the following input of shape `[4, 2, 2, 1]` and block_size of 2:
```prettyprint
x = [[[[1], [3]], [[9], [11]]],
[[[2], [4]], [[10], [12]]],
[[[5], [7]], [[13], [15]]],
[[[6], [8]], [[14], [16]]]]
```
The output tensor has shape `[1, 4, 4, 1]` and value:
```prettyprint
x = [[[1], [2], [3], [4]],
[[5], [6], [7], [8]],
[[9], [10], [11], [12]],
[[13], [14], [15], [16]]]
```
(4) For the following input of shape `[8, 1, 2, 1]` and block_size of 2:
```prettyprint
x = [[[[1], [3]]], [[[9], [11]]], [[[2], [4]]], [[[10], [12]]],
[[[5], [7]]], [[[13], [15]]], [[[6], [8]]], [[[14], [16]]]]
```
The output tensor has shape `[2, 2, 4, 1]` and value:
```prettyprint
x = [[[[1], [3]], [[5], [7]]],
[[[2], [4]], [[10], [12]]],
[[[5], [7]], [[13], [15]]],
[[[6], [8]], [[14], [16]]]]
```
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("SpaceToDepth")
.Input("input: T")
.Output("output: T")
.Attr("T: type")
.Attr("block_size: int >= 2")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle input;
TF_RETURN_IF_ERROR(c->WithRank(c->input(0), 4, &input));
int32 block_size;
TF_RETURN_IF_ERROR(c->GetAttr("block_size", &block_size));
DimensionHandle output_height;
DimensionHandle output_width;
DimensionHandle output_depth;
// Will return an error if does not evenly divide
TF_RETURN_IF_ERROR(c->Divide(c->Dim(input, 1), block_size,
true /* evenly_divisible */,
&output_height));
TF_RETURN_IF_ERROR(c->Divide(c->Dim(input, 2), block_size,
true /* evenly_divisible */, &output_width));
TF_RETURN_IF_ERROR(c->Multiply(c->Dim(input, 3), block_size * block_size,
&output_depth));
c->set_output(0,
c->MakeShape({c->Dim(input, 0), output_height, output_width,
output_depth}));
return Status::OK();
})
.Doc(R"doc(
SpaceToDepth for tensors of type T.
Rearranges blocks of spatial data, into depth. More specifically,
this op outputs a copy of the input tensor where values from the `height`
and `width` dimensions are moved to the `depth` dimension.
The attr `block_size` indicates the input block size and how the data is moved.
* Non-overlapping blocks of size `block_size x block size` are rearranged
into depth at each location.
* The depth of the output tensor is `input_depth * block_size * block_size`.
* The input tensor's height and width must be divisible by block_size.
That is, assuming the input is in the shape:
`[batch, height, width, depth]`,
the shape of the output will be:
`[batch, height/block_size, width/block_size, depth*block_size*block_size]`
This operation requires that the input tensor be of rank 4, and that
`block_size` be >=1 and a divisor of both the input `height` and `width`.
This operation is useful for resizing the activations between convolutions
(but keeping all data), e.g. instead of pooling. It is also useful for training
purely convolutional models.
For example, given this input of shape `[1, 2, 2, 1]`, and block_size of 2:
```prettyprint
x = [[[[1], [2]],
[[3], [4]]]]
```
This operation will output a tensor of shape `[1, 1, 1, 4]`:
```prettyprint
[[[[1, 2, 3, 4]]]]
```
Here, the input has a batch of 1 and each batch element has shape `[2, 2, 1]`,
the corresponding output will have a single element (i.e. width and height are
both 1) and will have a depth of 4 channels (1 * block_size * block_size).
The output element shape is `[1, 1, 4]`.
For an input tensor with larger depth, here of shape `[1, 2, 2, 3]`, e.g.
```prettyprint
x = [[[[1, 2, 3], [4, 5, 6]],
[[7, 8, 9], [10, 11, 12]]]]
```
This operation, for block_size of 2, will return the following tensor of shape
`[1, 1, 1, 12]`
```prettyprint
[[[[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]]]]
```
Similarly, for the following input of shape `[1 4 4 1]`, and a block size of 2:
```prettyprint
x = [[[[1], [2], [5], [6]],
[[3], [4], [7], [8]],
[[9], [10], [13], [14]],
[[11], [12], [15], [16]]]]
```
the operator will return the following tensor of shape `[1 2 2 4]`:
```prettyprint
x = [[[[1, 2, 3, 4],
[5, 6, 7, 8]],
[[9, 10, 11, 12],
[13, 14, 15, 16]]]]
```
block_size: The size of the spatial block.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("DepthToSpace")
.Input("input: T")
.Output("output: T")
.Attr("T: type")
.Attr("block_size: int >= 2")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle input;
TF_RETURN_IF_ERROR(c->WithRank(c->input(0), 4, &input));
int32 block_size;
TF_RETURN_IF_ERROR(c->GetAttr("block_size", &block_size));
DimensionHandle output_height;
DimensionHandle output_width;
DimensionHandle output_depth;
TF_RETURN_IF_ERROR(
c->Multiply(c->Dim(input, 1), block_size, &output_height));
TF_RETURN_IF_ERROR(
c->Multiply(c->Dim(input, 2), block_size, &output_width));
TF_RETURN_IF_ERROR(c->Divide(c->Dim(input, 3), block_size * block_size,
true /* evenly_divisible */, &output_depth));
c->set_output(0,
c->MakeShape({c->Dim(input, 0), output_height, output_width,
output_depth}));
return Status::OK();
})
.Doc(R"doc(
DepthToSpace for tensors of type T.
Rearranges data from depth into blocks of spatial data.
This is the reverse transformation of SpaceToDepth. More specifically,
this op outputs a copy of the input tensor where values from the `depth`
dimension are moved in spatial blocks to the `height` and `width` dimensions.
The attr `block_size` indicates the input block size and how the data is moved.
* Chunks of data of size `block_size * block_size` from depth are rearranged
into non-overlapping blocks of size `block_size x block_size`
* The width the output tensor is `input_depth * block_size`, whereas the
height is `input_height * block_size`.
* The depth of the input tensor must be divisible by
`block_size * block_size`.
That is, assuming the input is in the shape:
`[batch, height, width, depth]`,
the shape of the output will be:
`[batch, height*block_size, width*block_size, depth/(block_size*block_size)]`
This operation requires that the input tensor be of rank 4, and that
`block_size` be >=1 and that `block_size * block_size` be a divisor of the
input depth.
This operation is useful for resizing the activations between convolutions
(but keeping all data), e.g. instead of pooling. It is also useful for training
purely convolutional models.
For example, given this input of shape `[1, 1, 1, 4]`, and a block size of 2:
```prettyprint
x = [[[[1, 2, 3, 4]]]]
```
This operation will output a tensor of shape `[1, 2, 2, 1]`:
```prettyprint
[[[[1], [2]],
[[3], [4]]]]
```
Here, the input has a batch of 1 and each batch element has shape `[1, 1, 4]`,
the corresponding output will have 2x2 elements and will have a depth of
1 channel (1 = `4 / (block_size * block_size)`).
The output element shape is `[2, 2, 1]`.
For an input tensor with larger depth, here of shape `[1, 1, 1, 12]`, e.g.
```prettyprint
x = [[[[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]]]]
```
This operation, for block size of 2, will return the following tensor of shape
`[1, 2, 2, 3]`
```prettyprint
[[[[1, 2, 3], [4, 5, 6]],
[[7, 8, 9], [10, 11, 12]]]]
```
Similarly, for the following input of shape `[1 2 2 4]`, and a block size of 2:
```prettyprint
x = [[[[1, 2, 3, 4],
[5, 6, 7, 8]],
[[9, 10, 11, 12],
[13, 14, 15, 16]]]]
```
the operator will return the following tensor of shape `[1 4 4 1]`:
```prettyprint
x = [[ [1], [2], [5], [6]],
[ [3], [4], [7], [8]],
[ [9], [10], [13], [14]],
[ [11], [12], [15], [16]]]
```
block_size: The size of the spatial block, same as in Space2Depth.
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("ExtractImagePatches")
.Input("images: T")
.Output("patches: T")
.Attr("ksizes: list(int) >= 4")
.Attr("strides: list(int) >= 4")
.Attr("rates: list(int) >= 4")
.Attr("T: realnumbertype")
.Attr(GetPaddingAttrString())
.SetShapeFn([](InferenceContext* c) {
ShapeHandle input_shape;
TF_RETURN_IF_ERROR(c->WithRank(c->input(0), 4, &input_shape));
std::vector<int32> ksizes;
TF_RETURN_IF_ERROR(c->GetAttr("ksizes", &ksizes));
if (ksizes.size() != 4) {
return errors::InvalidArgument(
"ExtractImagePatches requires the ksizes attribute to contain 4 "
"values, but got: ",
ksizes.size());
}
std::vector<int32> strides;
TF_RETURN_IF_ERROR(c->GetAttr("strides", &strides));
if (strides.size() != 4) {
return errors::InvalidArgument(
"ExtractImagePatches requires the stride attribute to contain 4 "
"values, but got: ",
strides.size());
}
std::vector<int32> rates;
TF_RETURN_IF_ERROR(c->GetAttr("rates", &rates));
if (rates.size() != 4) {
return errors::InvalidArgument(
"ExtractImagePatches requires the rates attribute to contain 4 "
"values, but got: ",
rates.size());
}
int32 ksize_rows = ksizes[1];
int32 ksize_cols = ksizes[2];
int32 stride_rows = strides[1];
int32 stride_cols = strides[2];
int32 rate_rows = rates[1];
int32 rate_cols = rates[2];
int32 ksize_rows_eff = ksize_rows + (ksize_rows - 1) * (rate_rows - 1);
int32 ksize_cols_eff = ksize_cols + (ksize_cols - 1) * (rate_cols - 1);
DimensionHandle batch_size_dim = c->Dim(input_shape, 0);
DimensionHandle in_rows_dim = c->Dim(input_shape, 1);
DimensionHandle in_cols_dim = c->Dim(input_shape, 2);
DimensionHandle output_depth_dim;
TF_RETURN_IF_ERROR(c->Multiply(
c->Dim(input_shape, 3), ksize_rows * ksize_cols, &output_depth_dim));
if (!c->ValueKnown(in_rows_dim) || !c->ValueKnown(in_cols_dim)) {
ShapeHandle output_shape =
c->MakeShape({batch_size_dim, InferenceContext::kUnknownDim,
InferenceContext::kUnknownDim, output_depth_dim});
c->set_output(0, output_shape);
return Status::OK();
}
auto in_rows = c->Value(in_rows_dim);
auto in_cols = c->Value(in_cols_dim);
Padding padding;
TF_RETURN_IF_ERROR(c->GetAttr("padding", &padding));
int64 output_rows, output_cols;
int64 padding_before, padding_after;
TF_RETURN_IF_ERROR(GetWindowedOutputSizeVerbose(
in_rows, ksize_rows_eff, stride_rows, padding, &output_rows,
&padding_before, &padding_after));
TF_RETURN_IF_ERROR(GetWindowedOutputSizeVerbose(
in_cols, ksize_cols_eff, stride_cols, padding, &output_cols,
&padding_before, &padding_after));
ShapeHandle output_shape = c->MakeShape(
{batch_size_dim, output_rows, output_cols, output_depth_dim});
c->set_output(0, output_shape);
return Status::OK();
})
.Doc(R"doc(
Extract `patches` from `images` and put them in the "depth" output dimension.
images: 4-D Tensor with shape `[batch, in_rows, in_cols, depth]`.
patches: 4-D Tensor with shape `[batch, out_rows, out_cols, ksize_rows *
ksize_cols * depth]` containing image patches with size
`ksize_rows x ksize_cols x depth` vectorized in the "depth" dimension.
ksizes: The size of the sliding window for each dimension of `images`.
strides: 1-D of length 4. How far the centers of two consecutive patches are in
the images. Must be: `[1, stride_rows, stride_cols, 1]`.
rates: 1-D of length 4. Must be: `[1, rate_rows, rate_cols, 1]`. This is the
input stride, specifying how far two consecutive patch samples are in the
input. Equivalent to extracting patches with
`patch_sizes_eff = patch_sizes + (patch_sizes - 1) * (rates - 1)`, followed by
subsampling them spatially by a factor of `rates`.
padding: The type of padding algorithm to use.
We specify the size-related attributes as:
```python
ksizes = [1, ksize_rows, ksize_cols, 1]
strides = [1, strides_rows, strides_cols, 1]
rates = [1, rates_rows, rates_cols, 1]
```
)doc");
// --------------------------------------------------------------------------
REGISTER_OP("Bitcast")
.Input("input: T")
.Output("output: type")
.Attr("T: numbertype")
.Attr("type: numbertype")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle input = c->input(0);
if (!c->RankKnown(input)) {
// Input shape unknown.
return shape_inference::UnknownShape(c);
}
// Find the size of the input and output data types.
DataType input_type;
DataType output_type;
TF_RETURN_IF_ERROR(c->GetAttr("T", &input_type));
TF_RETURN_IF_ERROR(c->GetAttr("type", &output_type));
const int input_type_size = DataTypeSize(input_type);
const int output_type_size = DataTypeSize(output_type);
if (input_type_size == 0 || output_type_size == 0) {
return errors::InvalidArgument("Cannot bitcast types ",
DataTypeString(input_type), " to ",
DataTypeString(output_type),
" because "
"one of the type sizes is zero.");
}
ShapeHandle new_shape;
if (input_type_size == output_type_size) {
// No change in size.
new_shape = input;
} else if (input_type_size < output_type_size) {
TF_RETURN_IF_ERROR(c->WithRankAtLeast(input, 1, &new_shape));
int64 divisor_val = output_type_size / input_type_size;
DimensionHandle last_dim = c->Dim(new_shape, -1);
if (!c->ValueKnown(last_dim) || c->Value(last_dim) == divisor_val) {
TF_RETURN_IF_ERROR(c->Subshape(new_shape, 0, -1, &new_shape));
} else {
return errors::InvalidArgument("Cannot bitcast due to shape. ",
c->Value(last_dim), " does not match ",
divisor_val);
}
} else {
// Input type size is larger than output type size.
int64 divisor_val = input_type_size / output_type_size;
ShapeHandle extension = c->Vector(divisor_val);
TF_RETURN_IF_ERROR(c->Concatenate(input, extension, &new_shape));
}
c->set_output(0, new_shape);
return Status::OK();
})
.Doc(R"doc(
Bitcasts a tensor from one type to another without copying data.
Given a tensor `input`, this operation returns a tensor that has the same buffer
data as `input` with datatype `type`.
If the input datatype `T` is larger than the output datatype `type` then the
shape changes from [...] to [..., sizeof(`T`)/sizeof(`type`)].
If `T` is smaller than `type`, the operator requires that the rightmost
dimension be equal to sizeof(`type`)/sizeof(`T`). The shape then goes from
[..., sizeof(`type`)/sizeof(`T`)] to [...].
*NOTE*: Bitcast is implemented as a low-level cast, so machines with different
endian orderings will give different results.
)doc");
REGISTER_OP("OneHot")
.Input("indices: TI")
.Input("depth: int32")
.Input("on_value: T")
.Input("off_value: T")
.Attr("axis: int = -1")
.Output("output: T")
.Attr("T: type")
.Attr("TI: {uint8, int32, int64} = DT_INT64")
.SetShapeFn([](InferenceContext* c) {
int32 axis;
TF_RETURN_IF_ERROR(c->GetAttr("axis", &axis));
if (axis < -1) return errors::InvalidArgument("axis must be >= -1");
DimensionHandle depth;
TF_RETURN_IF_ERROR(c->MakeDimForScalarInput(1, &depth));
ShapeHandle indices = c->input(0);
if (!c->RankKnown(indices)) return shape_inference::UnknownShape(c);
int32 new_rank = c->Rank(indices) + 1;
// We need to add new_rank to axis in the case the axis is -1 because
// C++ returns negative values from % if the dividend is negative.
int32 depth_index = (axis + new_rank) % new_rank;
// Out shape is indices[0:depth_index] + [depth] + indices[depth_index:].
ShapeHandle front;
ShapeHandle back;
ShapeHandle out;
TF_RETURN_IF_ERROR(c->Subshape(indices, 0, depth_index, &front));
TF_RETURN_IF_ERROR(c->Subshape(indices, depth_index, &back));
TF_RETURN_IF_ERROR(c->Concatenate(front, c->Vector(depth), &front));
TF_RETURN_IF_ERROR(c->Concatenate(front, back, &out));
c->set_output(0, out);
return Status::OK();
})
.Doc(R"doc(
Returns a one-hot tensor.
The locations represented by indices in `indices` take value `on_value`,
while all other locations take value `off_value`.
If the input `indices` is rank `N`, the output will have rank `N+1`,
The new axis is created at dimension `axis` (default: the new axis is
appended at the end).
If `indices` is a scalar the output shape will be a vector of length `depth`.
If `indices` is a vector of length `features`, the output shape will be:
```
features x depth if axis == -1
depth x features if axis == 0
```
If `indices` is a matrix (batch) with shape `[batch, features]`,
the output shape will be:
```
batch x features x depth if axis == -1
batch x depth x features if axis == 1
depth x batch x features if axis == 0
```
Examples
=========
Suppose that
```
indices = [0, 2, -1, 1]
depth = 3
on_value = 5.0
off_value = 0.0
axis = -1
```
Then output is `[4 x 3]`:
```output =
[5.0 0.0 0.0] // one_hot(0)
[0.0 0.0 5.0] // one_hot(2)
[0.0 0.0 0.0] // one_hot(-1)
[0.0 5.0 0.0] // one_hot(1)
```
Suppose that
```
indices = [0, 2, -1, 1]
depth = 3
on_value = 0.0
off_value = 3.0
axis = 0
```
Then output is `[3 x 4]`:
```output =
[0.0 3.0 3.0 3.0]
[3.0 3.0 3.0 0.0]
[3.0 3.0 3.0 3.0]
[3.0 0.0 3.0 3.0]
// ^ one_hot(0)
// ^ one_hot(2)
// ^ one_hot(-1)
// ^ one_hot(1)
```
Suppose that
```
indices = [[0, 2], [1, -1]]
depth = 3
on_value = 1.0
off_value = 0.0
axis = -1
```
Then output is `[2 x 2 x 3]`:
```output =
[
[1.0, 0.0, 0.0] // one_hot(0)
[0.0, 0.0, 1.0] // one_hot(2)
][
[0.0, 1.0, 0.0] // one_hot(1)
[0.0, 0.0, 0.0] // one_hot(-1)
]```
indices: A tensor of indices.
depth: A scalar defining the depth of the one hot dimension.
on_value: A scalar defining the value to fill in output when `indices[j] = i`.
off_value: A scalar defining the value to fill in output when `indices[j] != i`.
axis: The axis to fill (default: -1, a new inner-most axis).
output: The one-hot tensor.
)doc");
// EXPERIMENTAL. DO NOT USE OR DEPEND ON THIS YET.
REGISTER_OP("QuantizeAndDequantize")
.Input("input: T")
.Attr("signed_input: bool = true")
.Attr("num_bits: int = 8")
.Attr("range_given: bool = false")
.Attr("input_min: float = 0")
.Attr("input_max: float = 0")
.Output("output: T")
.Attr("T: {float, double}")
.SetShapeFn(shape_inference::UnchangedShape)
.Deprecated(22, "Replaced by QuantizeAndDequantizeV2")
.Doc(R"doc(
Use QuantizeAndDequantizeV2 instead.
)doc");
REGISTER_OP("QuantizeAndDequantizeV2")
.Input("input: T")
.Input("input_min: T")
.Input("input_max: T")
.Attr("signed_input: bool = true")
.Attr("num_bits: int = 8")
.Attr("range_given: bool = false")
.Output("output: T")
.Attr("T: {float, double}")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle unused;
TF_RETURN_IF_ERROR(c->WithRank(c->input(1), 0, &unused));
TF_RETURN_IF_ERROR(c->WithRank(c->input(2), 0, &unused));
c->set_output(0, c->input(0));
return Status::OK();
})
.Doc(R"doc(
Quantizes then dequantizes a tensor.
This op simulates the precision loss from the quantized forward pass by:
1. Quantizing the tensor to fixed point numbers, which should match the target
quantization method when it is used in inference.
2. Dequantizing it back to floating point numbers for the following ops, most
likely matmul.
There are different ways to quantize. This version does not use the full range
of the output type, choosing to elide the lowest possible value for symmetry
(e.g., output range is -127 to 127, not -128 to 127 for signed 8 bit
quantization), so that 0.0 maps to 0.
To perform this op, we first find the range of values in our tensor. The range
we use is always centered on 0, so we find m such that
1. m = max(abs(input_min), abs(input_max)) if range_given is true,
2. m = max(abs(min_elem(input)), abs(max_elem(input))) otherwise.
Our input tensor range is then [-m, m].
Next, we choose our fixed-point quantization buckets, [min_fixed, max_fixed].
If signed_input is true, this is
[min_fixed, max_fixed ] =
[-(1 << (num_bits - 1) - 1), (1 << (num_bits - 1)) - 1].
Otherwise, if signed_input is false, the fixed-point range is
[min_fixed, max_fixed] = [0, (1 << num_bits) - 1].
From this we compute our scaling factor, s:
s = (max_fixed - min_fixed) / (2 * m).
Now we can quantize and dequantize the elements of our tensor. An element e
is transformed into e':
e' = (e * s).round_to_nearest() / s.
Note that we have a different number of buckets in the signed vs. unsigned
cases. For example, if num_bits == 8, we get 254 buckets in the signed case
vs. 255 in the unsigned case.
For example, suppose num_bits = 8 and m = 1. Then
[min_fixed, max_fixed] = [-127, 127], and
s = (127 + 127) / 2 = 127.
Given the vector {-1, -0.5, 0, 0.3}, this is quantized to
{-127, -63, 0, 38}, and dequantized to {-1, -63.0/127, 0, 38.0/127}.
input: Tensor to quantize and then dequantize.
signed_input: If the quantization is signed or unsigned.
num_bits: The bitwidth of the quantization.
range_given: If the range is given or should be computed from the tensor.
input_min: If range_given, this is the min of the range, otherwise this input
will be ignored.
input_max: If range_given, this is the max of the range, otherwise this input
will be ignored.
)doc");
// EXPERIMENTAL: tfdbg debugger-inserted ops.
REGISTER_OP("Copy")
.Input("input: T")
.Output("output: T")
.Attr("T: type")
.Attr("tensor_name: string = ''")
.SetAllowsUninitializedInput()
.Doc(R"doc(
Copy Op.
Performs CPU-to-CPU or GPU-to-GPU deep-copying of tensor, depending on the
device on which the tensor is allocated.
Unlike the CopyHost Op, this op does not have HostMemory constraint on its
input or output.
input: Input tensor.
output: Output tensor, deep-copied from input.
tensor_name: The name of the input tensor.
)doc");
REGISTER_OP("CopyHost")
.Input("input: T")
.Output("output: T")
.Attr("T: type")
.Attr("tensor_name: string = ''")
.SetAllowsUninitializedInput()
.Doc(R"doc(
Copy Host Op.
Performs CPU-to-CPU deep-copying of tensor.
Unlike the Copy Op, this op has HostMemory constraint on its input or output.
input: Input tensor.
output: Output tensor, deep-copied from input.
tensor_name: The name of the input tensor.
)doc");
REGISTER_OP("DebugIdentity")
.Input("input: T")
.Output("output: T")
.Attr("T: type")
.Attr("tensor_name: string = ''")
.Attr("debug_urls: list(string) = []")
.SetAllowsUninitializedInput()
.Doc(R"doc(
Debug Identity Op.
Provides an identity mapping of the non-Ref type input tensor for debugging.
input: Input tensor, non-Reference type.
output: Output tensor that equals the input tensor.
tensor_name: Name of the input tensor.
debug_urls: List of URLs to debug targets, e.g.,
file:///foo/tfdbg_dump, grpc:://localhost:11011
)doc");
REGISTER_OP("DebugNanCount")
.Input("input: T")
.Output("output: int64") // The debug signal (nan count) is int64
.Attr("T: type")
.Attr("tensor_name: string = ''")
.Attr("debug_urls: list(string) = []")
.SetAllowsUninitializedInput()
.Doc(R"doc(
Debug NaN Value Counter Op
Counts number of NaNs in the input tensor, for debugging.
input: Input tensor, non-Reference type.
output: An integer output tensor that is the number of NaNs in the input.
tensor_name: Name of the input tensor.
debug_urls: List of URLs to debug targets, e.g.,
file:///foo/tfdbg_dump, grpc:://localhost:11011
)doc");
REGISTER_OP("DebugNumericSummary")
.Input("input: T")
.Output("output: double")
.Attr("T: type")
.Attr("tensor_name: string = ''")
.Attr("debug_urls: list(string) = []")
.SetAllowsUninitializedInput()
.Doc(R"doc(
Debug Numeric Summary Op.
Provide a basic summary of numeric value types, range and distribution.
input: Input tensor, non-Reference type, float or double.
output: A double tensor of shape [12], the elements of which are:
[0]: is initialized (1.0) or not (0.0).
[1]: total number of elements
[2]: -inf count
[3]: negative element count (excluding -inf)
[4]: zero element count
[5]: positive element count (excluding +inf)
[6]: +inf element count
[7]: NaN element count
Output elements [1:8] are all zero, if the tensor is uninitialized.
[8]: minimum of all non-inf and non-NaN elements.
If uninitialized or no such element exists: +inf.
[9]: maximum of all non-inf and non-NaN elements.
If uninitialized or no such element exists: -inf.
[10]: mean of all non-inf and non-NaN elements.
If uninitialized or no such element exists: NaN.
[11]: variance of all non-inf and non-NaN elements.
If uninitialized or no such element exists: NaN.
tensor_name: Name of the input tensor.
debug_urls: List of URLs to debug targets, e.g.,
file:///foo/tfdbg_dump, grpc:://localhost:11011
)doc");
REGISTER_OP("QuantizeV2")
.Input("input: float")
.Input("min_range: float")
.Input("max_range: float")
.Output("output: T")
.Output("output_min: float")
.Output("output_max: float")
.Attr("T: quantizedtype")
.Attr("mode: {'MIN_COMBINED', 'MIN_FIRST'} = 'MIN_COMBINED'")
.SetShapeFn([](InferenceContext* c) {
TF_RETURN_IF_ERROR(shape_inference::UnchangedShape(c));
ShapeHandle unused;
TF_RETURN_IF_ERROR(c->WithRank(c->input(1), 0, &unused));
TF_RETURN_IF_ERROR(c->WithRank(c->input(2), 0, &unused));
c->set_output(1, c->Scalar());
c->set_output(2, c->Scalar());
return Status::OK();
})
.Doc(R"doc(
Quantize the 'input' tensor of type float to 'output' tensor of type 'T'.
[min_range, max_range] are scalar floats that specify the range for
the 'input' data. The 'mode' attribute controls exactly which calculations are
used to convert the float values to their quantized equivalents.
In 'MIN_COMBINED' mode, each value of the tensor will undergo the following:
```
out[i] = (in[i] - min_range) * range(T) / (max_range - min_range)
if T == qint8, out[i] -= (range(T) + 1) / 2.0
```
here `range(T) = numeric_limits<T>::max() - numeric_limits<T>::min()`
*MIN_COMBINED Mode Example*
Assume the input is type float and has a possible range of [0.0, 6.0] and the
output type is quint8 ([0, 255]). The min_range and max_range values should be
specified as 0.0 and 6.0. Quantizing from float to quint8 will multiply each
value of the input by 255/6 and cast to quint8.
If the output type was qint8 ([-128, 127]), the operation will additionally
subtract each value by 128 prior to casting, so that the range of values aligns
with the range of qint8.
If the mode is 'MIN_FIRST', then this approach is used:
```
number_of_steps = 1 << (# of bits in T)
range_adjust = number_of_steps / (number_of_steps - 1)
range = (range_max - range_min) * range_adjust
range_scale = number_of_steps / range
quantized = round(input * range_scale) - round(range_min * range_scale) +
numeric_limits<T>::min()
quantized = max(quantized, numeric_limits<T>::min())
quantized = min(quantized, numeric_limits<T>::max())
```
The biggest difference between this and MIN_COMBINED is that the minimum range
is rounded first, before it's subtracted from the rounded value. With
MIN_COMBINED, a small bias is introduced where repeated iterations of quantizing
and dequantizing will introduce a larger and larger error.
One thing to watch out for is that the operator may choose to adjust the
requested minimum and maximum values slightly during the quantization process,
so you should always use the output ports as the range for further calculations.
For example, if the requested minimum and maximum values are close to equal,
they will be separated by a small epsilon value to prevent ill-formed quantized
buffers from being created. Otherwise, you can end up with buffers where all the
quantized values map to the same float value, which causes problems for
operations that have to perform further calculations on them.
min_range: The minimum scalar value possibly produced for the input.
max_range: The maximum scalar value possibly produced for the input.
output: The quantized data produced from the float input.
output_min: The actual minimum scalar value used for the output.
output_max: The actual maximum scalar value used for the output.
)doc");
REGISTER_OP("Dequantize")
.Input("input: T")
.Input("min_range: float")
.Input("max_range: float")
.Output("output: float")
.Attr("T: quantizedtype")
.Attr("mode: {'MIN_COMBINED', 'MIN_FIRST'} = 'MIN_COMBINED'")
.SetShapeFn([](InferenceContext* c) {
TF_RETURN_IF_ERROR(shape_inference::UnchangedShape(c));
ShapeHandle unused;
TF_RETURN_IF_ERROR(c->WithRank(c->input(1), 0, &unused));
TF_RETURN_IF_ERROR(c->WithRank(c->input(2), 0, &unused));
return Status::OK();
})
.Doc(R"doc(
Dequantize the 'input' tensor into a float Tensor.
[min_range, max_range] are scalar floats that specify the range for
the 'input' data. The 'mode' attribute controls exactly which calculations are
used to convert the float values to their quantized equivalents.
In 'MIN_COMBINED' mode, each value of the tensor will undergo the following:
```
if T == qint8, in[i] += (range(T) + 1)/ 2.0
out[i] = min_range + (in[i]* (max_range - min_range) / range(T))
```
here `range(T) = numeric_limits<T>::max() - numeric_limits<T>::min()`
*MIN_COMBINED Mode Example*
If the input comes from a QuantizedRelu6, the output type is
quint8 (range of 0-255) but the possible range of QuantizedRelu6 is
0-6. The min_range and max_range values are therefore 0.0 and 6.0.
Dequantize on quint8 will take each value, cast to float, and multiply
by 6 / 255.
Note that if quantizedtype is qint8, the operation will additionally add
each value by 128 prior to casting.
If the mode is 'MIN_FIRST', then this approach is used:
```
number_of_steps = 1 << (# of bits in T)
range_adjust = number_of_steps / (number_of_steps - 1)
range = (range_max - range_min) * range_adjust
range_scale = range / number_of_steps
const double offset_input = static_cast<double>(input) - lowest_quantized;
result = range_min + ((input - numeric_limits<T>::min()) * range_scale)
```
min_range: The minimum scalar value possibly produced for the input.
max_range: The maximum scalar value possibly produced for the input.
)doc");
REGISTER_OP("QuantizedConcat")
.Input("concat_dim: int32")
.Input("values: N * T")
.Input("input_mins: N * float32")
.Input("input_maxes: N * float32")
.Output("output: T")
.Output("output_min: float")
.Output("output_max: float")
.Attr("N: int >= 2")
.Attr("T: type")
.SetShapeFn([](InferenceContext* c) {
const int n = (c->num_inputs() - 1) / 3;
TF_RETURN_IF_ERROR(shape_inference::ConcatShape(c, n));
ShapeHandle unused;
for (int i = n + 1; i < c->num_inputs(); ++i) {
TF_RETURN_IF_ERROR(c->WithRank(c->input(i), 0, &unused));
}
c->set_output(1, c->Scalar());
c->set_output(2, c->Scalar());
return Status::OK();
})
.Doc(R"doc(
Concatenates quantized tensors along one dimension.
concat_dim: 0-D. The dimension along which to concatenate. Must be in the
range [0, rank(values)).
values: The `N` Tensors to concatenate. Their ranks and types must match,
and their sizes must match in all dimensions except `concat_dim`.
input_mins: The minimum scalar values for each of the input tensors.
input_maxes: The maximum scalar values for each of the input tensors.
output_min: The float value that the minimum quantized output value represents.
output_max: The float value that the maximum quantized output value represents.
output: A `Tensor` with the concatenation of values stacked along the
`concat_dim` dimension. This tensor's shape matches that of `values` except
in `concat_dim` where it has the sum of the sizes.
)doc");
REGISTER_OP("QuantizedReshape")
.Input("tensor: T")
.Input("shape: Tshape")
.Input("input_min: float")
.Input("input_max: float")
.Output("output: T")
.Output("output_min: float")
.Output("output_max: float")
.Attr("T: type")
.Attr("Tshape: {int32, int64} = DT_INT32")
.SetShapeFn([](InferenceContext* c) {
TF_RETURN_IF_ERROR(SetOutputShapeForReshape(c));
ShapeHandle unused;
TF_RETURN_IF_ERROR(c->WithRank(c->input(2), 0, &unused));
TF_RETURN_IF_ERROR(c->WithRank(c->input(3), 0, &unused));
c->set_output(1, c->Scalar());
c->set_output(2, c->Scalar());
return Status::OK();
})
.Doc(R"Doc(
Reshapes a quantized tensor as per the Reshape op.
```
shape: Defines the shape of the output tensor.
input_min: The minimum value of the input.
input_max: The maximum value of the input.
output_min: This value is copied from input_min.
output_max: This value is copied from input_max.
)Doc");
REGISTER_OP("QuantizedInstanceNorm")
.Input("x: T")
.Input("x_min: float")
.Input("x_max: float")
.Output("y: T")
.Output("y_min: float")
.Output("y_max: float")
.Attr("T: quantizedtype")
.Attr("output_range_given: bool = false")
.Attr("given_y_min: float = 0")
.Attr("given_y_max: float = 0")
.Attr("variance_epsilon: float = 1e-5")
.Attr("min_separation: float = 1e-3")
.SetShapeFn([](shape_inference::InferenceContext* c) {
shape_inference::ShapeHandle unused;
// x should be a rank 4 tensor.
TF_RETURN_IF_ERROR(c->WithRank(c->input(0), 4, &unused));
// Assert x_min and x_max are scalars (rank 0).
TF_RETURN_IF_ERROR(c->WithRank(c->input(1), 0, &unused));
TF_RETURN_IF_ERROR(c->WithRank(c->input(2), 0, &unused));
// y has the same shape as x.
TF_RETURN_IF_ERROR(shape_inference::UnchangedShape(c));
// y_min and y_max are scalars.
c->set_output(1, c->Scalar());
c->set_output(2, c->Scalar());
return Status::OK();
})
.Doc(R"doc(
Quantized Instance normalization.
x: A 4D input Tensor.
x_min: The value represented by the lowest quantized input.
x_max: The value represented by the highest quantized input.
y: A 4D Tensor.
y_min: The value represented by the lowest quantized output.
y_max: The value represented by the highest quantized output.
output_range_given: If True, `given_y_min` and `given_y_min`
and `given_y_max` are used as the output range. Otherwise,
the implementation computes the output range.
given_y_min: Output in `y_min` if `output_range_given` is True.
given_y_max: Output in `y_max` if `output_range_given` is True.
variance_epsilon: A small float number to avoid dividing by 0.
min_separation: Minimum value of `y_max - y_min`
)doc");
namespace {
Status ScatterNdShape(InferenceContext* c) {
ShapeHandle indices_shape;
TF_RETURN_IF_ERROR(c->WithRankAtLeast(c->input(0), 1, &indices_shape));
ShapeHandle updates_shape;
TF_RETURN_IF_ERROR(c->WithRankAtLeast(c->input(1), 1, &updates_shape));
ShapeHandle output_shape;
TF_RETURN_IF_ERROR(c->MakeShapeFromShapeTensor(2, &output_shape));
if (c->Value(c->NumElements(output_shape)) == 0 &&
(c->Value(c->NumElements(indices_shape)) > 0 ||
c->Value(c->NumElements(updates_shape)) > 0)) {
return errors::InvalidArgument(
"Indices and updates specified for empty output shape");
}
if (c->RankKnown(indices_shape) && c->RankKnown(updates_shape)) {
const int64 outer_dims = c->Rank(indices_shape) - 1;
const DimensionHandle ixdim = c->Dim(indices_shape, -1);
// We can only do more validation if the last dimension of indices
// is a known value.
if (c->ValueKnown(ixdim)) {
int64 ix = c->Value(ixdim);
ShapeHandle unused;
ShapeHandle prefix_indices;
TF_RETURN_IF_ERROR(
c->Subshape(indices_shape, 0, outer_dims, &prefix_indices));
ShapeHandle prefix_updates;
TF_RETURN_IF_ERROR(
c->Subshape(updates_shape, 0, outer_dims, &prefix_updates));
Status s = c->Merge(prefix_indices, prefix_updates, &unused);
if (!s.ok()) {
return errors::InvalidArgument(
"The outer ", outer_dims,
" dimensions of indices.shape=", c->DebugString(indices_shape),
" must match the outer ", outer_dims,
" dimensions of updates.shape=", c->DebugString(updates_shape),
": ", s.error_message());
}
ShapeHandle suffix_output;
TF_RETURN_IF_ERROR(c->Subshape(output_shape, ix, &suffix_output));
ShapeHandle suffix_updates;
TF_RETURN_IF_ERROR(
c->Subshape(updates_shape, outer_dims, &suffix_updates));
s = c->Merge(suffix_output, suffix_updates, &unused);
if (!s.ok()) {
return errors::InvalidArgument(
"The inner ", c->Rank(output_shape) - ix,
" dimensions of output.shape=", c->DebugString(output_shape),
" must match the inner ", c->Rank(updates_shape) - outer_dims,
" dimensions of updates.shape=", c->DebugString(updates_shape),
": ", s.error_message());
}
}
}
c->set_output(0, output_shape);
return Status::OK();
}
} // namespace
REGISTER_OP("ScatterNd")
.Input("indices: Tindices")
.Input("updates: T")
.Input("shape: Tindices")
.Output("output: T")
.Attr("T: type")
.Attr("Tindices: {int32, int64}")
.SetShapeFn(ScatterNdShape)
.Doc(
R"doc(Creates a new tensor by applying sparse `updates` to individual
values or slices within a zero tensor of the given `shape` tensor according to
indices. This operator is the inverse of the [tf.gather_nd](#gather_nd)
operator which extracts values or slices from a given tensor.
TODO(simister): Add a link to Variable.__getitem__ documentation on slice
syntax.
`shape` is a `TensorShape` with rank `P` and `indices` is a `Tensor` of rank
`Q`.
`indices` must be integer tensor, containing indices into `shape`.
It must be shape `[d_0, ..., d_{Q-2}, K]` where `0 < K <= P`.
The innermost dimension of `indices` (with length `K`) corresponds to
indices into elements (if `K = P`) or slices (if `K < P`) along the `K`th
dimension of `shape`.
`updates` is Tensor of rank `Q-1+P-K` with shape:
```
[d_0, ..., d_{Q-2}, shape[K], ..., shape[P-1]].
```
The simplest form of scatter is to insert individual elements in a tensor by
index. For example, say we want to insert 4 scattered elements in a rank-1
tensor with 8 elements.
<div style="width:70%; margin:auto; margin-bottom:10px; margin-top:20px;">
<img style="width:100%" src="../../images/ScatterNd1.png" alt>
</div>
In Python, this scatter operation would look like this:
indices = tf.constant([[4], [3], [1], [7]])
updates = tf.constant([9, 10, 11, 12])
shape = tf.constant([8])
scatter = tf.scatter_nd(indices, updates, shape)
with tf.Session() as sess:
print sess.run(scatter)
The resulting tensor would look like this:
[0, 11, 0, 10, 9, 0, 0, 12]
We can also, insert entire slices of a higher rank tensor all at once. For
example, if we wanted to insert two slices in the first dimension of a
rank-3 tensor with two matrices of new values.
<div style="width:70%; margin:auto; margin-bottom:10px; margin-top:20px;">
<img style="width:100%" src="../../images/ScatterNd2.png" alt>
</div>
In Python, this scatter operation would look like this:
indices = tf.constant([[0], [2]])
updates = tf.constant([[[5, 5, 5, 5], [6, 6, 6, 6],
[7, 7, 7, 7], [8, 8, 8, 8]],
[[5, 5, 5, 5], [6, 6, 6, 6],
[7, 7, 7, 7], [8, 8, 8, 8]]])
shape = tf.constant([4, 4, 4])
scatter = tf.scatter_nd(indices, updates, shape)
with tf.Session() as sess:
print sess.run(scatter)
The resulting tensor would look like this:
[[[5, 5, 5, 5], [6, 6, 6, 6], [7, 7, 7, 7], [8, 8, 8, 8]],
[[0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]],
[[5, 5, 5, 5], [6, 6, 6, 6], [7, 7, 7, 7], [8, 8, 8, 8]],
[[0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]]]
indices: A Tensor. Must be one of the following types: int32, int64.
A tensor of indices into ref.
updates: A Tensor. Must have the same type as tensor. A tensor of updated values
to store in ref.
shape: A vector. The shape of the resulting tensor.
output: A new tensor with the given shape and updates applied according
to the indices.
)doc");
REGISTER_OP("FakeQuantWithMinMaxArgs")
.Attr("min: float = -6.0")
.Attr("max: float = 6.0")
.Input("inputs: float")
.Output("outputs: float")
.SetShapeFn(shape_inference::UnchangedShape)
.Doc(R"doc(
Fake-quantize the 'inputs' tensor, type float to 'outputs' tensor of same type.
Attributes [min; max] define the clamping range for the 'inputs' data. Op
divides this range into 255 steps (total of 256 values), then replaces each
'inputs' value with the closest of the quantized step values.
Quantization is called fake since the output is still in floating point.
)doc");
REGISTER_OP("FakeQuantWithMinMaxArgsGradient")
.Attr("min: float = -6.0")
.Attr("max: float = 6.0")
.Input("gradients: float")
.Input("inputs: float")
.Output("backprops: float")
.SetShapeFn(shape_inference::UnchangedShape)
.Doc(R"doc(
Compute gradients for a FakeQuantWithMinMaxArgs operation.
gradients: Backpropagated gradients above the FakeQuantWithMinMaxArgs operation.
inputs: Values passed as inputs to the FakeQuantWithMinMaxArgs operation.
backprops: Backpropagated gradients below the FakeQuantWithMinMaxArgs operation:
`gradients * (inputs >= min && inputs <= max)`.
)doc");
REGISTER_OP("FakeQuantWithMinMaxVars")
.Input("inputs: float")
.Input("min: float")
.Input("max: float")
.Output("outputs: float")
.SetShapeFn([](InferenceContext* c) {
TF_RETURN_IF_ERROR(shape_inference::UnchangedShape(c));
ShapeHandle unused;
TF_RETURN_IF_ERROR(c->WithRank(c->input(1), 0, &unused));
TF_RETURN_IF_ERROR(c->WithRank(c->input(2), 0, &unused));
return Status::OK();
})
.Doc(R"doc(
Fake-quantize the 'inputs' tensor of type float via global float scalars `min`
and `max` to 'outputs' tensor of same shape as `inputs`.
[min; max] is the clamping range for the 'inputs' data. Op divides this range
into 255 steps (total of 256 values), then replaces each 'inputs' value with the
closest of the quantized step values.
This operation has a gradient and thus allows for training `min` and `max` values.
)doc");
REGISTER_OP("FakeQuantWithMinMaxVarsGradient")
.Input("gradients: float")
.Input("inputs: float")
.Input("min: float")
.Input("max: float")
.Output("backprops_wrt_input: float")
.Output("backprop_wrt_min: float")
.Output("backprop_wrt_max: float")
.SetShapeFn([](InferenceContext* c) {
// gradients and inputs are same size.
ShapeHandle inputs;
TF_RETURN_IF_ERROR(c->Merge(c->input(0), c->input(1), &inputs));
// min and max are scalars
ShapeHandle min_max;
TF_RETURN_IF_ERROR(c->WithRank(c->input(2), 0, &min_max));
TF_RETURN_IF_ERROR(c->Merge(min_max, c->input(3), &min_max));
c->set_output(0, inputs);
c->set_output(1, min_max);
c->set_output(2, min_max);
return Status::OK();
})
.Doc(R"doc(
Compute gradients for a FakeQuantWithMinMaxVars operation.
gradients: Backpropagated gradients above the FakeQuantWithMinMaxVars operation.
inputs: Values passed as inputs to the FakeQuantWithMinMaxVars operation.
min, max: Quantization interval, scalar floats.
backprops_wrt_input: Backpropagated gradients w.r.t. inputs:
`gradients * (inputs >= min && inputs <= max)`.
backprop_wrt_min: Backpropagated gradients w.r.t. min parameter:
`sum(gradients * (inputs < min))`.
backprop_wrt_max: Backpropagated gradients w.r.t. max parameter:
`sum(gradients * (inputs > max))`.
)doc");
REGISTER_OP("FakeQuantWithMinMaxVarsPerChannel")
.Input("inputs: float")
.Input("min: float")
.Input("max: float")
.Output("outputs: float")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle input, min, max;
TF_RETURN_IF_ERROR(c->WithRankAtLeast(c->input(0), 1, &input));
TF_RETURN_IF_ERROR(c->WithRank(c->input(1), 1, &min));
TF_RETURN_IF_ERROR(c->WithRank(c->input(2), 1, &max));
DimensionHandle unused;
TF_RETURN_IF_ERROR(c->Merge(c->Dim(input, -1), c->Dim(min, 0), &unused));
TF_RETURN_IF_ERROR(c->Merge(c->Dim(input, -1), c->Dim(max, 0), &unused));
TF_RETURN_IF_ERROR(c->Merge(c->Dim(min, 0), c->Dim(max, 0), &unused));
c->set_output(0, input);
return Status::OK();
})
.Doc(R"doc(
Fake-quantize the 'inputs' tensor of type float and one of the shapes: `[d]`,
`[b, d]` `[b, h, w, d]` via per-channel floats `min` and `max` of shape `[d]`
to 'outputs' tensor of same shape as `inputs`.
[min; max] is the clamping range for the 'inputs' data in the corresponding
depth channel. Op divides this range into 255 steps (total of 256 values), then
replaces each 'inputs' value with the closest of the quantized step values.
This operation has a gradient and thus allows for training `min` and `max` values.
)doc");
REGISTER_OP("FakeQuantWithMinMaxVarsPerChannelGradient")
.Input("gradients: float")
.Input("inputs: float")
.Input("min: float")
.Input("max: float")
.Output("backprops_wrt_input: float")
.Output("backprop_wrt_min: float")
.Output("backprop_wrt_max: float")
.SetShapeFn([](InferenceContext* c) {
ShapeHandle inputs;
TF_RETURN_IF_ERROR(c->WithRankAtLeast(c->input(0), 1, &inputs));
TF_RETURN_IF_ERROR(c->WithRankAtMost(inputs, 4, &inputs));
TF_RETURN_IF_ERROR(c->Merge(inputs, c->input(1), &inputs));
ShapeHandle last_dim = c->Vector(c->Dim(inputs, -1));
ShapeHandle min_max;
TF_RETURN_IF_ERROR(c->WithRank(c->input(2), 1, &min_max));
TF_RETURN_IF_ERROR(c->Merge(min_max, last_dim, &min_max));
TF_RETURN_IF_ERROR(c->Merge(c->input(3), min_max, &min_max));
c->set_output(0, inputs);
c->set_output(1, min_max);
c->set_output(2, min_max);
return Status::OK();
})
.Doc(R"doc(
Compute gradients for a FakeQuantWithMinMaxVarsPerChannel operation.
gradients: Backpropagated gradients above the FakeQuantWithMinMaxVars operation,
shape one of: `[d]`, `[b, d]`, `[b, h, w, d]`.
inputs: Values passed as inputs to the FakeQuantWithMinMaxVars operation, shape
same as `gradients`.
min, max: Quantization interval, floats of shape `[d]`.
backprops_wrt_input: Backpropagated gradients w.r.t. inputs, shape same as
`inputs`:
`gradients * (inputs >= min && inputs <= max)`.
backprop_wrt_min: Backpropagated gradients w.r.t. min parameter, shape `[d]`:
`sum_per_d(gradients * (inputs < min))`.
backprop_wrt_max: Backpropagated gradients w.r.t. max parameter, shape `[d]`:
`sum_per_d(gradients * (inputs > max))`.
)doc");
// Deprecated op registrations:
// The following can be deleted after 10mar2017.
REGISTER_OP("BatchMatrixDiag")
.Input("diagonal: T")
.Output("output: T")
.Attr("T: type")
.Deprecated(14, "Use MatrixDiag");
REGISTER_OP("BatchMatrixSetDiag")
.Input("input: T")
.Input("diagonal: T")
.Output("output: T")
.Attr("T: type")
.Deprecated(14, "Use MatrixSetDiag");
REGISTER_OP("BatchMatrixDiagPart")
.Input("input: T")
.Output("diagonal: T")
.Attr("T: type")
.Deprecated(14, "Use MatrixDiagPart");
REGISTER_OP("BatchMatrixBandPart")
.Input("input: T")
.Input("num_lower: int64")
.Input("num_upper: int64")
.Output("band: T")
.Attr("T: type")
.Deprecated(14, "Use MatrixBandPart");
} // namespace tensorflow
| [
"liuguiyangnwpu@163.com"
] | liuguiyangnwpu@163.com |
c4ac95906827458dfc24f4cb404f88c04ec163ae | 2cf838b54b556987cfc49f42935f8aa7563ea1f4 | /aws-cpp-sdk-fms/include/aws/fms/model/AppsListDataSummary.h | ed13a74da5dde97ea8a71d7970322927704aa0f6 | [
"MIT",
"Apache-2.0",
"JSON"
] | permissive | QPC-database/aws-sdk-cpp | d11e9f0ff6958c64e793c87a49f1e034813dac32 | 9f83105f7e07fe04380232981ab073c247d6fc85 | refs/heads/main | 2023-06-14T17:41:04.817304 | 2021-07-09T20:28:20 | 2021-07-09T20:28:20 | 384,714,703 | 1 | 0 | Apache-2.0 | 2021-07-10T14:16:41 | 2021-07-10T14:16:41 | null | UTF-8 | C++ | false | false | 7,210 | h | /**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#pragma once
#include <aws/fms/FMS_EXPORTS.h>
#include <aws/core/utils/memory/stl/AWSString.h>
#include <aws/core/utils/memory/stl/AWSVector.h>
#include <aws/fms/model/App.h>
#include <utility>
namespace Aws
{
namespace Utils
{
namespace Json
{
class JsonValue;
class JsonView;
} // namespace Json
} // namespace Utils
namespace FMS
{
namespace Model
{
/**
* <p>Details of the Firewall Manager applications list.</p><p><h3>See Also:</h3>
* <a
* href="http://docs.aws.amazon.com/goto/WebAPI/fms-2018-01-01/AppsListDataSummary">AWS
* API Reference</a></p>
*/
class AWS_FMS_API AppsListDataSummary
{
public:
AppsListDataSummary();
AppsListDataSummary(Aws::Utils::Json::JsonView jsonValue);
AppsListDataSummary& operator=(Aws::Utils::Json::JsonView jsonValue);
Aws::Utils::Json::JsonValue Jsonize() const;
/**
* <p>The Amazon Resource Name (ARN) of the applications list.</p>
*/
inline const Aws::String& GetListArn() const{ return m_listArn; }
/**
* <p>The Amazon Resource Name (ARN) of the applications list.</p>
*/
inline bool ListArnHasBeenSet() const { return m_listArnHasBeenSet; }
/**
* <p>The Amazon Resource Name (ARN) of the applications list.</p>
*/
inline void SetListArn(const Aws::String& value) { m_listArnHasBeenSet = true; m_listArn = value; }
/**
* <p>The Amazon Resource Name (ARN) of the applications list.</p>
*/
inline void SetListArn(Aws::String&& value) { m_listArnHasBeenSet = true; m_listArn = std::move(value); }
/**
* <p>The Amazon Resource Name (ARN) of the applications list.</p>
*/
inline void SetListArn(const char* value) { m_listArnHasBeenSet = true; m_listArn.assign(value); }
/**
* <p>The Amazon Resource Name (ARN) of the applications list.</p>
*/
inline AppsListDataSummary& WithListArn(const Aws::String& value) { SetListArn(value); return *this;}
/**
* <p>The Amazon Resource Name (ARN) of the applications list.</p>
*/
inline AppsListDataSummary& WithListArn(Aws::String&& value) { SetListArn(std::move(value)); return *this;}
/**
* <p>The Amazon Resource Name (ARN) of the applications list.</p>
*/
inline AppsListDataSummary& WithListArn(const char* value) { SetListArn(value); return *this;}
/**
* <p>The ID of the applications list.</p>
*/
inline const Aws::String& GetListId() const{ return m_listId; }
/**
* <p>The ID of the applications list.</p>
*/
inline bool ListIdHasBeenSet() const { return m_listIdHasBeenSet; }
/**
* <p>The ID of the applications list.</p>
*/
inline void SetListId(const Aws::String& value) { m_listIdHasBeenSet = true; m_listId = value; }
/**
* <p>The ID of the applications list.</p>
*/
inline void SetListId(Aws::String&& value) { m_listIdHasBeenSet = true; m_listId = std::move(value); }
/**
* <p>The ID of the applications list.</p>
*/
inline void SetListId(const char* value) { m_listIdHasBeenSet = true; m_listId.assign(value); }
/**
* <p>The ID of the applications list.</p>
*/
inline AppsListDataSummary& WithListId(const Aws::String& value) { SetListId(value); return *this;}
/**
* <p>The ID of the applications list.</p>
*/
inline AppsListDataSummary& WithListId(Aws::String&& value) { SetListId(std::move(value)); return *this;}
/**
* <p>The ID of the applications list.</p>
*/
inline AppsListDataSummary& WithListId(const char* value) { SetListId(value); return *this;}
/**
* <p>The name of the applications list.</p>
*/
inline const Aws::String& GetListName() const{ return m_listName; }
/**
* <p>The name of the applications list.</p>
*/
inline bool ListNameHasBeenSet() const { return m_listNameHasBeenSet; }
/**
* <p>The name of the applications list.</p>
*/
inline void SetListName(const Aws::String& value) { m_listNameHasBeenSet = true; m_listName = value; }
/**
* <p>The name of the applications list.</p>
*/
inline void SetListName(Aws::String&& value) { m_listNameHasBeenSet = true; m_listName = std::move(value); }
/**
* <p>The name of the applications list.</p>
*/
inline void SetListName(const char* value) { m_listNameHasBeenSet = true; m_listName.assign(value); }
/**
* <p>The name of the applications list.</p>
*/
inline AppsListDataSummary& WithListName(const Aws::String& value) { SetListName(value); return *this;}
/**
* <p>The name of the applications list.</p>
*/
inline AppsListDataSummary& WithListName(Aws::String&& value) { SetListName(std::move(value)); return *this;}
/**
* <p>The name of the applications list.</p>
*/
inline AppsListDataSummary& WithListName(const char* value) { SetListName(value); return *this;}
/**
* <p>An array of <code>App</code> objects in the Firewall Manager applications
* list.</p>
*/
inline const Aws::Vector<App>& GetAppsList() const{ return m_appsList; }
/**
* <p>An array of <code>App</code> objects in the Firewall Manager applications
* list.</p>
*/
inline bool AppsListHasBeenSet() const { return m_appsListHasBeenSet; }
/**
* <p>An array of <code>App</code> objects in the Firewall Manager applications
* list.</p>
*/
inline void SetAppsList(const Aws::Vector<App>& value) { m_appsListHasBeenSet = true; m_appsList = value; }
/**
* <p>An array of <code>App</code> objects in the Firewall Manager applications
* list.</p>
*/
inline void SetAppsList(Aws::Vector<App>&& value) { m_appsListHasBeenSet = true; m_appsList = std::move(value); }
/**
* <p>An array of <code>App</code> objects in the Firewall Manager applications
* list.</p>
*/
inline AppsListDataSummary& WithAppsList(const Aws::Vector<App>& value) { SetAppsList(value); return *this;}
/**
* <p>An array of <code>App</code> objects in the Firewall Manager applications
* list.</p>
*/
inline AppsListDataSummary& WithAppsList(Aws::Vector<App>&& value) { SetAppsList(std::move(value)); return *this;}
/**
* <p>An array of <code>App</code> objects in the Firewall Manager applications
* list.</p>
*/
inline AppsListDataSummary& AddAppsList(const App& value) { m_appsListHasBeenSet = true; m_appsList.push_back(value); return *this; }
/**
* <p>An array of <code>App</code> objects in the Firewall Manager applications
* list.</p>
*/
inline AppsListDataSummary& AddAppsList(App&& value) { m_appsListHasBeenSet = true; m_appsList.push_back(std::move(value)); return *this; }
private:
Aws::String m_listArn;
bool m_listArnHasBeenSet;
Aws::String m_listId;
bool m_listIdHasBeenSet;
Aws::String m_listName;
bool m_listNameHasBeenSet;
Aws::Vector<App> m_appsList;
bool m_appsListHasBeenSet;
};
} // namespace Model
} // namespace FMS
} // namespace Aws
| [
"aws-sdk-cpp-automation@github.com"
] | aws-sdk-cpp-automation@github.com |
291952021a5b26b655994725cb5ba5b01537dee3 | c45ed46065d8b78dac0dd7df1c95b944f34d1033 | /TC-SRM-548-div1-450/isdkfj.cpp | 172944a6bcbcbc277c79cb02ff40b39edbd8474d | [] | no_license | yzq986/cntt2016-hw1 | ed65a6b7ad3dfe86a4ff01df05b8fc4b7329685e | 12e799467888a0b3c99ae117cce84e8842d92337 | refs/heads/master | 2021-01-17T11:27:32.270012 | 2017-01-26T03:23:22 | 2017-01-26T03:23:22 | 84,036,200 | 0 | 0 | null | 2017-03-06T06:04:12 | 2017-03-06T06:04:12 | null | GB18030 | C++ | false | false | 1,099 | cpp | #include <bits/stdc++.h>
using namespace std;
bool f[2505][55];
int tt[55];
class KingdomAndDice {
public:
double newFairness(vector <int> firstDie, vector <int> secondDie, int X) {
int n=firstDie.size(),m=0,s=0;
vector <int> fd=firstDie,sd=secondDie;
for(int i=0;i<n;++i){
m+=fd[i]==0;
for(int j=0;j<n;++j)s+=fd[i]>sd[j];//求出初始的概率
}
sort(sd.begin(),sd.end());
sd.push_back(X+1);//方便处理
for(int i=0;i<n;++i){
tt[i]=sd[i+1]-sd[i]-1;
for(int j=0;j<n;++j)
if(sd[i]<fd[j]&&fd[j]<sd[i+1])--tt[i];
//求出每个区间可以填的数的个数
}
for(int k=0;k<=m;++k)f[0][k]=1;//初始化
for(int i=0;i<n;++i)
for(int j=n*m;j>=0;--j)
for(int k=m;k>=0;--k)
if(f[j][k])
for(int l=1;l<=tt[i]&&l+k<=m;++l)
f[j+l*(i+1)][k+l]=1;//DP
double ret=1.0*s/(n*n);
int ans=s;
for(int t=0;t<=n*m;++t)
if(f[t][m])
if(abs(n*n-2*(s+t))<abs(n*n-2*ans))ret=1.0*(s+t)/(n*n),ans=s+t;
//用整数判断避免精度误差
return ret;
}
};
//<%:testing-code%>
//Powered by KawigiEdit 2.1.8 (beta) modified by pivanof!
| [
"isdkfj@qq.com"
] | isdkfj@qq.com |
efd41f7e3420e1acee900f02385c93db43b1fc37 | be1122e5f12a2b6cd832169de56de52a2dc7e7e4 | /FADBAD++/EXAMPLES/ExampleFAD.cpp | 18cee429b8ad02eef909ef61f52e09b00c894c5c | [] | no_license | iaakhter/nonLinearSolverThesis | 2a74f1888609f9948d4a2ccc7057ddc74ab4ffb3 | 01ca1a5d1f77580ba555b4b0976eac5bf20e2dd6 | refs/heads/master | 2020-04-08T03:30:35.648027 | 2018-11-24T22:40:59 | 2018-11-24T22:40:59 | 158,978,793 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 910 | cpp | #include "fadiff.h"
#include <iostream>
using namespace std;
F<double> func(const F<double>& x, const F<double>& y)
{
F<double> z=sqrt(x);
return y*z+sin(z);
}
int main()
{
F<double> x,y,f; // Declare variables x,y,f
x=1; // Initialize variable x
x.diff(0,2); // Differentiate with respect to x (index 0 of 2)
y=2; // Initialize variable y
y.diff(1,2); // Differentiate with respect to y (index 1 of 2)
f=func(x,y); // Evaluate function and derivatives
double fval=f.x(); // Value of function
double dfdx=f.d(0); // Value of df/dx (index 0 of 2)
double dfdy=f.d(1); // Value of df/dy (index 1 of 2)
cout << "f(x,y)=" << fval << endl;
cout << "df/dx(x,y)=" << dfdx << endl;
cout << "df/dy(x,y)=" << dfdy << endl;
F<double> exam;
exam = 1.0
cout << "abs of x " << abs(exam) << endl;
return 0;
}
| [
"iaakhter@colby.edu"
] | iaakhter@colby.edu |
dd365ea727fa8c0149906c63d3009afe59ecc7d0 | 98eaa65a594021857379ac7b51b88ed9d2a7198b | /Source/StateMachine/Public/SMStateMachine.h | cf1981f9c6d6cbddcec161bd50e67947bd77a4b2 | [] | no_license | richmondx/StateMachineUE4 | d6dbb74925f3590c8b1ee754f31ff905b3324cef | 48a4bcdbc45f74eb9b44bedba2e4b850929f0900 | refs/heads/master | 2020-03-28T23:55:56.688316 | 2018-06-22T15:54:40 | 2018-06-22T15:54:40 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 611 | h | #pragma once
#include "CoreMinimal.h"
#include "UObject/ScriptInterface.h"
#include "SMState.h"
#include "SMStateMachineInterface.h"
#include "SMStateMachine.generated.h"
// UObject base class
UCLASS(Abstract)
class STATEMACHINE_API USMStateMachine
: public USMState,
public ISMStateMachineInterface
{
GENERATED_BODY()
public:
FName GetName_Implementation() const override { return StateName; }
bool GoToState_Implementation(FName StateName) override;
private:
UPROPERTY()
TMap<FName, TScriptInterface<ISMStateInterface>> States;
UPROPERTY()
TScriptInterface<ISMStateInterface> CurrentState;
}; | [
"dukecg@gmail.com"
] | dukecg@gmail.com |
18a2966b34d2509a6045cd5d6d8f9964b18328dd | 7c10c7007b160bf260cc743131032937684ec74d | /Tooms/Source/Tooms/Tooms.cpp | b9dc62fe82f10feb2ecb8e63df43788bf98e8b05 | [] | no_license | bryanshumway/ToomsProject | d10c96280dcc5e605d0e96ec58842ef724d33e80 | 1475eb153c8345930913319595774fcd60558a76 | refs/heads/master | 2022-05-18T08:23:31.795285 | 2020-03-13T20:33:53 | 2020-03-13T20:33:53 | 222,636,444 | 0 | 2 | null | 2020-03-13T20:33:55 | 2019-11-19T07:36:57 | C++ | UTF-8 | C++ | false | false | 208 | cpp | // Fill out your copyright notice in the Description page of Project Settings.
#include "Tooms.h"
#include "Modules/ModuleManager.h"
IMPLEMENT_PRIMARY_GAME_MODULE( FDefaultGameModuleImpl, Tooms, "Tooms" );
| [
"shumwaybryanm@gmail.com"
] | shumwaybryanm@gmail.com |
8af3e96aabb9cd96f3ab159a7920f550fe3e4305 | 1f4e6bc2ddd3f76c2ad5b1f4d5796c75024b5e50 | /monitor/monitor.ino | 116e0fb3d27b905d9c71881744d0d95570b43453 | [] | no_license | KyrelJerome/LifeDuino | 5402687fea8cc41570f4dc4625db27f764e06f0b | f14b1de5ce4d898b42c89e4cbb3b10988f4eb553 | refs/heads/master | 2023-05-28T17:20:36.225183 | 2021-06-16T15:45:30 | 2021-06-16T15:45:30 | 192,072,769 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,574 | ino | // A basic everyday NeoPixel strip test program.
// NEOPIXEL BEST PRACTICES for most reliable operation:
// - Add 1000 uF CAPACITOR between NeoPixel strip's + and - connections.
// - MINIMIZE WIRING LENGTH between microcontroller board and first pixel.
// - NeoPixel strip's DATA-IN should pass through a 300-500 OHM RESISTOR.
// - AVOID connecting NeoPixels on a LIVE CIRCUIT. If you must, ALWAYS
// connect GROUND (-) first, then +, then data.
// - When using a 3.3V microcontroller with a 5V-powered NeoPixel strip,
// a LOGIC-LEVEL CONVERTER on the data line is STRONGLY RECOMMENDED.
// (Skipping these may work OK on your workbench but can fail in the field)
#include <Adafruit_NeoPixel.h>
#ifdef __AVR__
#include <avr/power.h> // Requir000ed for 16 MHz Adafruit Trinket
#endif
// Which pin on the Arduino is connected to the NeoPixels?
// On a Trinket or Gemma we suggest changing this to 1:
#define LED_PIN 6
// How many NeoPixels are attached to the Arduino?
#define LED_COUNT 32
// Declare our NeoPixel strip object:
Adafruit_NeoPixel strip(LED_COUNT, LED_PIN, NEO_GRB + NEO_KHZ800);
// Argument 1 = Number of pixels in NeoPixel strip
// Argument 2 = Arduino pin number (most are valid)
// Argument 3 = Pixel type flags, add together as needed:
// NEO_KHZ800 800 KHz bitstream (most NeoPixel products w/WS2812 LEDs)
// NEO_KHZ400 400 KHz (classic 'v1' (not v2) FLORA pixels, WS2811 drivers)
// NEO_GRB Pixels are wired for GRB bitstream (most NeoPixel products)
// NEO_RGB Pixels are wired for RGB bitstream (v1 FLORA pixels, not v2)
// NEO_RGBW Pixels are wired for RGBW bitstream (NeoPixel RGBW products)
// setup() function -- runs once at startup --------------------------------
void setup() {
// END of Trinket-specific code.
strip.begin(); // INITIALIZE NeoPixel strip object (REQUIRED)
strip.show(); // Turn OFF all pixels ASAP
strip.setBrightness(100); // Set BRIGHTNESS to about 1/5 (max = 255)
}
// loop() function -- runs repeatedly as long as board is on ---------------
void loop() {
// Fill along the length of the strip in various colors...
colorWipe(strip.Color(255, 255, 255), 10);
strip.show(); // Update strip to match // Red
}
// Some functions of our own for creating animated effects -----------------
// Fill strip pixels one after another with a color. Strip is NOT cleared
// first; anything there will be covered pixel by pixel. Pass in color
// (as a single 'packed' 32-bit value, which you can get by calling
// strip.Color(red, green, blue) as shown in the loop() function above),
// and a delay time (in milliseconds) between pixels.
void colorWipe(uint32_t color, int wait) {
for(int i=0; i<strip.numPixels(); i++) { // For each pixel in strip...
strip.setPixelColor(i, color); // Set pixel's color (in RAM)
}
}
// Theater-marquee-style chasing lights. Pass in a color (32-bit value,
// a la strip.Color(r,g,b) as mentioned above), and a delay time (in ms)
// between frames.
void theaterChase(uint32_t color, int wait) {
for(int a=0; a<10; a++) { // Repeat 10 times...
for(int b=0; b<3; b++) { // 'b' counts from 0 to 2...
strip.clear(); // Set all pixels in RAM to 0 (off)
// 'c' counts up from 'b' to end of strip in steps of 3...
for(int c=b; c<strip.numPixels(); c += 3) {
strip.setPixelColor(c, color); // Set pixel 'c' to value 'color'
}
strip.show(); // Update strip with new contents
delay(wait); // Pause for a moment
}
}
}
| [
"kyrel2007@gmail.com"
] | kyrel2007@gmail.com |
2aeafdfd4f300744b29fd53a59c7da94d174c30d | efe1131a33ee82e7c46b5af4cf200dcae8eb4add | /mfc/SRC/16-BIT/AFXASERT.CPP | 0683917ac15816471e2d67453cab612765dbac53 | [
"BSL-1.0"
] | permissive | ALEHACKsp/dmc | 819398bbb46e8b5a8ef5c344ef2a0f8b4ee8903c | 9478d25a677f70dbe4fc0ed317cc5a5e5050ef8b | refs/heads/master | 2022-12-28T13:36:57.721262 | 2020-10-11T07:47:16 | 2020-10-11T07:47:16 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,050 | cpp | // This is a part of the Microsoft Foundation Classes C++ library.
// Copyright (C) 1992-1993 Microsoft Corporation
// All rights reserved.
//
// This source code is only intended as a supplement to the
// Microsoft Foundation Classes Reference and Microsoft
// QuickHelp and/or WinHelp documentation provided with the library.
// See these sources for detailed information regarding the
// Microsoft Foundation Classes product.
#include "stdafx.h"
#ifdef AFX_DBG1_SEG
#pragma code_seg(AFX_DBG1_SEG)
#endif
// NOTE: in separate module so it can replaced if needed
#ifdef _DEBUG
#undef THIS_FILE
static char BASED_CODE THIS_FILE[] = __FILE__;
#endif
#ifdef _DEBUG
int NEAR afxIgnoreAssertCount = 0; // for testing diagnostics
LONG NEAR afxAssertBusy = -1;
#endif
#pragma optimize("qgel", off) // assembler cannot be globally optimized
extern "C"
void AFXAPI AfxAssertFailedLine(LPCSTR lpszFileName, int nLine)
{
#ifdef _DEBUG
if (afxIgnoreAssertCount > 0)
{
afxIgnoreAssertCount--;
return;
}
#ifdef _WINDOWS
char sz[255];
static char BASED_CODE szTitle[] = "Assertion Failed!";
static char BASED_CODE szMessage[] = "%s: File %s, Line %d";
static char BASED_CODE szUnknown[] = "<unknown application>";
// In case _AfxGetAppDataFails.
if (++afxAssertBusy > 0)
{
// assume the debugger or auxiliary port
wsprintf(sz, szMessage,szUnknown, lpszFileName, nLine);
#ifdef _AFXCTL
// Checking afxTraceEnabled may cause infinite loop
// on faild AfxGetAppData.
AfxOutputDebugString(sz);
#else
if (afxTraceEnabled)
::OutputDebugString(sz);
#endif
afxAssertBusy--;
// break into the debugger (or Dr Watson log)
#ifndef _PORTABLE
_asm { int 3 };
#endif
return;
}
// get app name or NULL if unknown (don't call assert)
#ifndef _AFXDLL
const char* pszAppName = afxCurrentAppName;
#else
const char* pszAppName = _AfxGetAppData()->appCurrentAppName;
#endif
wsprintf(sz, (LPCSTR)szMessage,
(pszAppName == NULL) ? (LPCSTR)szUnknown : (LPCSTR)pszAppName,
lpszFileName,
nLine);
if (afxTraceEnabled)
{
// assume the debugger or auxiliary port
::OutputDebugString(sz);
::OutputDebugString(", ");
::OutputDebugString(szTitle);
::OutputDebugString("\n\r");
}
int nCode = ::MessageBox(_AfxGetSafeOwner(NULL), sz, szTitle,
MB_SYSTEMMODAL | MB_ICONHAND | MB_ABORTRETRYIGNORE);
afxAssertBusy--;
if (nCode == IDIGNORE)
{
return; // ignore
}
else if (nCode == IDRETRY)
{
// break into the debugger (or Dr Watson log)
#ifndef _PORTABLE
_asm { int 3 };
#endif
return; // ignore and continue in debugger to diagnose problem
}
// else fall through and call AfxAbort
#else
static char szMessage[] = "Assertion Failed: file %Fs, line %d\r\n";
fprintf(stderr, szMessage, lpszFileName, nLine);
#endif // _WINDOWS
#else
// parameters not used if non-debug
(void)lpszFileName;
(void)nLine;
#endif // _DEBUG
AfxAbort();
}
#pragma optimize("", on)
| [
"walter@walterbright.com"
] | walter@walterbright.com |
b4f33e5e07d27d8bd83222c99820db9347cf034c | 11e968f2a2ecff4ab8e805489ec19870b395a169 | /fix_sph_density_summation.cpp | 7509ff61fba2adc526d0ddc00bfdf74443b66760 | [] | no_license | astrohome/LIGGGHTS_EX | d85539264014847be10ce313f11cce29e3f6e4f3 | 4f76fea3da1f14ed1feb6342207500ada3cd6c46 | refs/heads/master | 2016-09-05T13:19:19.304401 | 2012-04-02T18:23:05 | 2012-04-02T18:23:05 | 3,408,349 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 4,722 | cpp | /* ----------------------------------------------------------------------
LIGGGHTS - LAMMPS Improved for General Granular and Granular Heat
Transfer Simulations
www.liggghts.com | www.cfdem.com
Christoph Kloss, christoph.kloss@cfdem.com
LIGGGHTS is based on LAMMPS
LAMMPS - Large-scale Atomic/Molecular Massively Parallel Simulator
http://lammps.sandia.gov, Sandia National Laboratories
Steve Plimpton, sjplimp@sandia.gov
Copyright (2003) Sandia Corporation. Under the terms of Contract
DE-AC04-94AL85000 with Sandia Corporation, the U.S. Government retains
certain rights in this software. This software is distributed under
the GNU General Public License.
See the README file in the top-level LAMMPS directory.
------------------------------------------------------------------------- */
/* ----------------------------------------------------------------------
Contributing author for SPH:
Andreas Aigner (CD Lab Particulate Flow Modelling, JKU)
andreas.aigner@jku.at
------------------------------------------------------------------------- */
#include "math.h"
#include "mpi.h"
#include "string.h"
#include "stdlib.h"
#include "fix_sph_density_summation.h"
#include "update.h"
#include "respa.h"
#include "atom.h"
#include "force.h"
#include "modify.h"
#include "pair.h"
#include "comm.h"
#include "neighbor.h"
#include "neigh_list.h"
#include "neigh_request.h"
#include "memory.h"
#include "error.h"
#include "sph_kernels.h"
using namespace LAMMPS_NS;
/* ---------------------------------------------------------------------- */
FixSPHDensitySum::FixSPHDensitySum(LAMMPS *lmp, int narg, char **arg) :
FixSPH(lmp, narg, arg)
{
}
/* ---------------------------------------------------------------------- */
FixSPHDensitySum::~FixSPHDensitySum()
{
}
/* ---------------------------------------------------------------------- */
int FixSPHDensitySum::setmask()
{
int mask = 0;
mask |= POST_INTEGRATE;
mask |= POST_INTEGRATE_RESPA;
return mask;
}
/* ---------------------------------------------------------------------- */
void FixSPHDensitySum::init()
{
FixSPH::init();
}
/* ---------------------------------------------------------------------- */
void FixSPHDensitySum::post_integrate()
{
int i,j,m,ii,jj,inum,jnum,itype,jtype;
double xtmp,ytmp,ztmp,delx,dely,delz,rsq,r,s,W;
int *ilist,*jlist,*numneigh,**firstneigh;
double **x = atom->x;
int *mask = atom->mask;
int *type = atom->type;
double *density = atom->density;
double *mass = atom->mass;
int newton_pair = force->newton_pair;
// reset and add density contribution of self
int nlocal = atom->nlocal;
for (i = 0; i < nlocal; i++) {
// this gets a value for W at self, perform error check
W = SPH_KERNEL_NS::sph_kernel(kernel_id,0.,h,hinv);
if (W < 0.)
{
fprintf(screen,"s = 0, W = %f\n",W);
error->one("Illegal kernel used, W < 0");
}
// add contribution of self
density[i] = mass[type[i]] * W;
}
/*
for (i = 0; i < nlocal; i++)
fprintf(screen,"ts %d, particle %d after self: density %f\n",update->ntimestep,i,density[i]);
*/
// need updated ghost positions and self contributions
comm->forward_comm();
// loop over neighbors of my atoms
inum = list->inum;
ilist = list->ilist;
numneigh = list->numneigh;
firstneigh = list->firstneigh;
for (ii = 0; ii < inum; ii++) {
i = ilist[ii];
if (!(mask[i] & groupbit)) continue;
itype = type[i];
xtmp = x[i][0];
ytmp = x[i][1];
ztmp = x[i][2];
jlist = firstneigh[i];
jnum = numneigh[i];
for (jj = 0; jj < jnum; jj++) {
j = jlist[jj];
if (!(mask[j] & groupbit)) continue;
jtype = type[j];
delx = xtmp - x[j][0];
dely = ytmp - x[j][1];
delz = ztmp - x[j][2];
rsq = delx*delx + dely*dely + delz*delz;
if (rsq >= cutsq[itype][jtype]) continue;
// calculate distance and normalized distance
r = sqrt(rsq);
s = r * hinv;
// this sets a value for W
// error on kernel existence already performed in FixSPH::FixSPH()
W = SPH_KERNEL_NS::sph_kernel(kernel_id,s,h,hinv);
if (W < 0.)
{
fprintf(screen,"s = %f, W = %f\n",s,W);
error->one("Illegal kernel used, W < 0");
}
// add contribution of neighbor
// have a half neigh list, so do it for both if necessary
density[i] += mass[jtype] * W;
if (newton_pair || j < nlocal)
density[j] += mass[itype] * W;
}
}
// density is now correct, send to ghosts
comm->forward_comm();
/*
for (i = 0; i < nlocal; i++)
fprintf(screen,"ts %d, particle %d after neigh: density %f\n",update->ntimestep,i,density[i]);
error->all("end");
*/
}
| [
"izotov.ilya@gmail.com"
] | izotov.ilya@gmail.com |
15f4e8388678f0a45ca774f4c1055099efd25497 | 2299f5337cb3f13ce5af7ca3e36390e881a6a3b6 | /src/oidn/examples/denoise.cpp | 37001f572a84ed1d9fb38857f2732b02a78079d8 | [
"Apache-2.0"
] | permissive | SteveMoody73/windows-deps | 6751814a3e98b8250a17ffdc4e7fb3a769b6bf7a | 9ca39bd0233e98eafd5bdccfa5d4679513d22e82 | refs/heads/master | 2020-12-20T17:38:44.303410 | 2020-02-26T14:14:38 | 2020-02-26T14:14:38 | 236,155,923 | 0 | 0 | null | 2020-01-25T10:34:32 | 2020-01-25T10:34:31 | null | UTF-8 | C++ | false | false | 9,509 | cpp | // ======================================================================== //
// Copyright 2009-2019 Intel Corporation //
// //
// Licensed under the Apache License, Version 2.0 (the "License"); //
// you may not use this file except in compliance with the License. //
// You may obtain a copy of the License at //
// //
// http://www.apache.org/licenses/LICENSE-2.0 //
// //
// Unless required by applicable law or agreed to in writing, software //
// distributed under the License is distributed on an "AS IS" BASIS, //
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. //
// See the License for the specific language governing permissions and //
// limitations under the License. //
// ======================================================================== //
#include <iostream>
#include <cassert>
#include <cmath>
#include <signal.h>
#ifdef VTUNE
#include <ittnotify.h>
#endif
#include <OpenImageDenoise/oidn.hpp>
#include "common/timer.h"
#include "image_io.h"
#include "cli.h"
using namespace oidn;
void printUsage()
{
std::cout << "Intel(R) Open Image Denoise Example" << std::endl;
std::cout << "Usage: denoise [-f RT|RTLightmap]" << std::endl
<< " [-ldr ldr_color.pfm] [-srgb] [-hdr hdr_color.pfm]" << std::endl
<< " [-alb albedo.pfm] [-nrm normal.pfm]" << std::endl
<< " [-o output.pfm] [-ref reference_output.pfm]" << std::endl
<< " [-bench ntimes] [-threads n] [-affinity 0|1] [-maxmem MB] [-verbose 0-3]" << std::endl;
}
void errorCallback(void* userPtr, oidn::Error error, const char* message)
{
throw std::runtime_error(message);
}
volatile bool isCancelled = false;
void signalHandler(int signal)
{
isCancelled = true;
}
bool progressCallback(void* userPtr, double n)
{
if (isCancelled)
return false;
std::cout << "\rDenoising " << int(n * 100.) << "%" << std::flush;
return true;
}
int main(int argc, char* argv[])
{
std::string filterType = "RT";
std::string colorFilename, albedoFilename, normalFilename;
std::string outputFilename, refFilename;
bool hdr = false;
bool srgb = false;
int numBenchmarkRuns = 0;
int numThreads = -1;
int setAffinity = -1;
int maxMemoryMB = -1;
int verbose = -1;
// Parse the arguments
if (argc == 1)
{
printUsage();
return 1;
}
try
{
ArgParser args(argc, argv);
while (args.hasNext())
{
std::string opt = args.getNextOpt();
if (opt == "f" || opt == "filter")
filterType = args.getNextValue();
else if (opt == "ldr")
{
colorFilename = args.getNextValue();
hdr = false;
}
else if (opt == "hdr")
{
colorFilename = args.getNextValue();
hdr = true;
}
else if (opt == "srgb")
srgb = true;
else if (opt == "alb" || opt == "albedo")
albedoFilename = args.getNextValue();
else if (opt == "nrm" || opt == "normal")
normalFilename = args.getNextValue();
else if (opt == "o" || opt == "out" || opt == "output")
outputFilename = args.getNextValue();
else if (opt == "ref" || opt == "reference")
refFilename = args.getNextValue();
else if (opt == "bench" || opt == "benchmark")
numBenchmarkRuns = std::max(args.getNextValueInt(), 0);
else if (opt == "threads")
numThreads = args.getNextValueInt();
else if (opt == "affinity")
setAffinity = args.getNextValueInt();
else if (opt == "maxmem")
maxMemoryMB = args.getNextValueInt();
else if (opt == "verbose")
verbose = args.getNextValueInt();
else if (opt == "h" || opt == "help")
{
printUsage();
return 1;
}
else
throw std::invalid_argument("invalid argument");
}
if (colorFilename.empty())
throw std::runtime_error("no color image specified");
// Load the input image
ImageBuffer color, albedo, normal;
ImageBuffer ref;
std::cout << "Loading input" << std::endl;
color = loadImage(colorFilename);
if (color.getChannels() != 3)
throw std::runtime_error("invalid color image");
if (!albedoFilename.empty())
{
albedo = loadImage(albedoFilename);
if (albedo.getChannels() != 3 || albedo.getSize() != color.getSize())
throw std::runtime_error("invalid albedo image");
}
if (!normalFilename.empty())
{
normal = loadImage(normalFilename);
if (normal.getChannels() != 3 || normal.getSize() != color.getSize())
throw std::runtime_error("invalid normal image");
}
if (!refFilename.empty())
{
ref = loadImage(refFilename);
if (ref.getChannels() != 3 || ref.getSize() != color.getSize())
throw std::runtime_error("invalid reference output image");
}
const int width = color.getWidth();
const int height = color.getHeight();
std::cout << "Resolution: " << width << "x" << height << std::endl;
// Initialize the output image
ImageBuffer output(width, height, 3);
// Initialize the denoising filter
std::cout << "Initializing" << std::endl;
Timer timer;
oidn::DeviceRef device = oidn::newDevice();
const char* errorMessage;
if (device.getError(errorMessage) != oidn::Error::None)
throw std::runtime_error(errorMessage);
device.setErrorFunction(errorCallback);
if (numThreads > 0)
device.set("numThreads", numThreads);
if (setAffinity >= 0)
device.set("setAffinity", bool(setAffinity));
if (verbose >= 0)
device.set("verbose", verbose);
device.commit();
oidn::FilterRef filter = device.newFilter(filterType.c_str());
filter.setImage("color", color.getData(), oidn::Format::Float3, width, height);
if (albedo)
filter.setImage("albedo", albedo.getData(), oidn::Format::Float3, width, height);
if (normal)
filter.setImage("normal", normal.getData(), oidn::Format::Float3, width, height);
filter.setImage("output", output.getData(), oidn::Format::Float3, width, height);
if (hdr)
filter.set("hdr", true);
if (srgb)
filter.set("srgb", true);
if (maxMemoryMB >= 0)
filter.set("maxMemoryMB", maxMemoryMB);
filter.setProgressMonitorFunction(progressCallback);
signal(SIGINT, signalHandler);
filter.commit();
const double initTime = timer.query();
const int versionMajor = device.get<int>("versionMajor");
const int versionMinor = device.get<int>("versionMinor");
const int versionPatch = device.get<int>("versionPatch");
std::cout << " version=" << versionMajor << "." << versionMinor << "." << versionPatch
<< ", filter=" << filterType
<< ", msec=" << (1000. * initTime) << std::endl;
// Denoise the image
//std::cout << "Denoising";
timer.reset();
filter.execute();
const double denoiseTime = timer.query();
std::cout << std::endl << " msec=" << (1000. * denoiseTime) << std::endl;
filter.setProgressMonitorFunction(nullptr);
signal(SIGINT, SIG_DFL);
if (ref)
{
// Verify the output values
std::cout << "Verifying output" << std::endl;
ImageBuffer diff(width, height, 3);
int nerr = 0;
float maxre = 0;
for (size_t i = 0; i < output.getDataSize(); ++i)
{
float expect = std::max(ref[i], 0.f);
const float actual = output[i];
float re;
if (std::abs(expect) < 1e-5 && std::abs(actual) < 1e-5)
re = 0;
else if (expect != 0)
re = std::abs((expect - actual) / expect);
else
re = std::abs(expect - actual);
if (maxre < re) maxre = re;
if (re > 2e-2)
{
//std::cout << "i=" << i << " expect=" << expect << " actual=" << actual << std::endl;
++nerr;
}
diff[i] = std::abs(ref[i] - output[i]);
}
std::cout << " nfloats=" << output.getDataSize() << ", nerr=" << nerr << ", maxre=" << maxre << std::endl;
// Save debug images
std::cout << "Saving debug images" << std::endl;
saveImage("denoise_in.ppm", color);
saveImage("denoise_out.ppm", output);
saveImage("denoise_ref.ppm", ref);
saveImage("denoise_diff.ppm", diff);
}
if (!outputFilename.empty())
{
// Save output image
std::cout << "Saving output" << std::endl;
saveImage(outputFilename, output);
}
if (numBenchmarkRuns > 0)
{
// Benchmark loop
#ifdef VTUNE
__itt_resume();
#endif
std::cout << "Benchmarking: " << "ntimes=" << numBenchmarkRuns << std::endl;
timer.reset();
for (int i = 0; i < numBenchmarkRuns; ++i)
filter.execute();
const double totalTime = timer.query();
std::cout << " sec=" << totalTime << ", msec/image=" << (1000.*totalTime / numBenchmarkRuns) << std::endl;
#ifdef VTUNE
__itt_pause();
#endif
}
}
catch (std::exception& e)
{
std::cout << "Error: " << e.what() << std::endl;
return 1;
}
return 0;
}
| [
"stevemoody@fastmail.com"
] | stevemoody@fastmail.com |
30a966e893ba70d434d738b644f06d746f8efd28 | ee5ac97915ade1fcaa6988458b29e2476b106b16 | /SampleFramework/renderer/src/d3d11/D3D11RendererMesh.h | 25d7352dcc832a09fa6cc49abb5eece1d6142cdb | [
"MIT"
] | permissive | markusbuchholz/PhysXPractice | e28ddb427a2fd89a50c9b670c508e509f29d1d9c | 64db991a6720ab7972acc37f3fe859709cc652fb | refs/heads/master | 2021-05-27T19:06:54.314638 | 2014-08-15T07:06:25 | 2014-08-15T07:06:32 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,753 | h | // This code contains NVIDIA Confidential Information and is disclosed to you
// under a form of NVIDIA software license agreement provided separately to you.
//
// Notice
// NVIDIA Corporation and its licensors retain all intellectual property and
// proprietary rights in and to this software and related documentation and
// any modifications thereto. Any use, reproduction, disclosure, or
// distribution of this software and related documentation without an express
// license agreement from NVIDIA Corporation is strictly prohibited.
//
// ALL NVIDIA DESIGN SPECIFICATIONS, CODE ARE PROVIDED "AS IS.". NVIDIA MAKES
// NO WARRANTIES, EXPRESSED, IMPLIED, STATUTORY, OR OTHERWISE WITH RESPECT TO
// THE MATERIALS, AND EXPRESSLY DISCLAIMS ALL IMPLIED WARRANTIES OF NONINFRINGEMENT,
// MERCHANTABILITY, AND FITNESS FOR A PARTICULAR PURPOSE.
//
// Information and code furnished is believed to be accurate and reliable.
// However, NVIDIA Corporation assumes no responsibility for the consequences of use of such
// information or for any infringement of patents or other rights of third parties that may
// result from its use. No license is granted by implication or otherwise under any patent
// or patent rights of NVIDIA Corporation. Details are subject to change without notice.
// This code supersedes and replaces all information previously supplied.
// NVIDIA Corporation products are not authorized for use as critical
// components in life support devices or systems without express written approval of
// NVIDIA Corporation.
//
// Copyright (c) 2008-2013 NVIDIA Corporation. All rights reserved.
#ifndef D3D11_RENDERER_MESH_H
#define D3D11_RENDERER_MESH_H
#include <RendererConfig.h>
#if defined(RENDERER_ENABLE_DIRECT3D11)
#include <RendererMesh.h>
#include "D3D11Renderer.h"
namespace SampleRenderer
{
class D3D11RendererMaterial;
class D3D11RendererMesh : public RendererMesh
{
friend class D3D11Renderer;
public:
D3D11RendererMesh(D3D11Renderer& renderer, const RendererMeshDesc& desc);
virtual ~D3D11RendererMesh(void);
protected:
virtual void renderIndices(PxU32 numVertices, PxU32 firstIndex, PxU32 numIndices, RendererIndexBuffer::Format indexFormat, RendererMaterial* material) const;
virtual void renderVertices(PxU32 numVertices, RendererMaterial* material) const;
virtual void renderIndicesInstanced(PxU32 numVertices, PxU32 firstIndex, PxU32 numIndices, RendererIndexBuffer::Format indexFormat, RendererMaterial* material) const;
virtual void renderVerticesInstanced(PxU32 numVertices, RendererMaterial* material) const;
D3D11RendererMesh& operator=(const D3D11RendererMesh&) { return *this; }
Renderer& renderer() { return m_renderer; }
private:
void bind(void) const;
void render(RendererMaterial* material) const;
void setTopology(const Primitive& primitive, bool bTessellationEnabled) const;
void setLayout(const RendererMaterial*, bool bInstanced) const;
void setSprites(bool bEnabled) const;
void setNumVerticesAndIndices(PxU32 numIndices, PxU32 numVertices);
ID3D11InputLayout* getInputLayoutForMaterial(const D3D11RendererMaterial*, bool bInstanced) const;
private:
class ScopedMeshRender;
friend class ScopedMeshRender;
typedef std::vector<D3D11_INPUT_ELEMENT_DESC> LayoutVector;
D3D11Renderer& m_renderer;
LayoutVector m_inputDescriptions;
LayoutVector m_instancedInputDescriptions;
PxU64 m_inputHash;
PxU64 m_instancedInputHash;
// This is merely for cleanup, and has no effect on externally visible state
mutable bool m_bPopStates;
std::string m_spriteShaderPath;
};
} // namespace SampleRenderer
#endif // #if defined(RENDERER_ENABLE_DIRECT3D11)
#endif
| [
"jjuiddong@gmail.com"
] | jjuiddong@gmail.com |
fb939ad4dd02c06fc3a3b82b489f8a02114b7cf1 | 76ebeb166b4a488effcfae94537d534eb067e8b5 | /src/sysinfo/vm/dynamic/cpu_usage.cpp | bac8f321e354b83e35127cfb60e95a8d9350dd4c | [
"BSD-2-Clause"
] | permissive | chetui/libvsf | c6e2fcf5d5edb5f0d5435ee0051654b23b81edee | 116cd5334e2921e11eaebd24dfa31dbda64034e6 | refs/heads/master | 2020-04-25T09:17:02.795891 | 2015-05-17T08:52:59 | 2015-05-17T08:52:59 | 22,336,313 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,086 | cpp | #include "sysinfo/vm/dynamic/cpu_usage.h"
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <functional>
#include <string>
#include <memory>
#include "utils/log.h"
#include "framework/exception.h"
using namespace std;
unsigned int CpuUsage::cpu_num_;
constexpr const int CpuUsage::DEFAULT_INTERVAL_MS;
CpuUsage::CpuUsage(): has_data_cnt_(0), interval_ms_(DEFAULT_INTERVAL_MS), callback_func_(new cpu_usage_callback_t)
{
cpu_num_ = static_cast<unsigned int>(sysconf(_SC_NPROCESSORS_CONF));
*callback_func_ = nullptr;
}
CpuUsage::~CpuUsage()
{
stop();
}
CpuUsage *CpuUsage::get_instance()
{
static CpuUsage cpu_usage;
return &cpu_usage;
}
void CpuUsage::set_interval(int interval_ms)
{
interval_ms_ = interval_ms;
}
void CpuUsage::set_callback(cpu_usage_callback_t callback_func)
{
unique_lock<shared_timed_mutex> lock(data_mutex_);
*callback_func_ = callback_func;
}
void CpuUsage::clear_param()
{
interval_ms_ = DEFAULT_INTERVAL_MS;
unique_lock<shared_timed_mutex> lock(data_mutex_);
*callback_func_ = nullptr;;
}
int CpuUsage::get_sys_cpu_usage_without_refresh()
{
while(!has_data())
this_thread::sleep_for(chrono::milliseconds(10));
shared_lock<shared_timed_mutex> lock(data_mutex_);
return static_cast<int>((total_cpu_time_old == 0 || total_cpu_time_delta == 0) ?
0 : (1 - idle_time_delta * 1.0 / total_cpu_time_delta) * 100);
}
int CpuUsage::get_sys_cpu_usage()
{
refresh_twice();
return get_sys_cpu_usage_without_refresh();
}
int CpuUsage::get_thread_cpu_usage_without_refresh(pid_t tid)
{
while(!has_data())
this_thread::sleep_for(chrono::milliseconds(10));
shared_lock<shared_timed_mutex> lock(data_mutex_);
auto iter = thread_cpu_usage_data_.find(tid);
if (iter != thread_cpu_usage_data_.end() && iter->second.valid_)
return iter->second.cpu_usage_;
else
return -1;
}
int CpuUsage::get_thread_cpu_usage(pid_t tid)
{
refresh_twice();
return get_thread_cpu_usage_without_refresh(tid);
}
int CpuUsage::get_process_cpu_usage_without_refresh(pid_t pid)
{
while(!has_data())
this_thread::sleep_for(chrono::milliseconds(10));
shared_lock<shared_timed_mutex> lock(data_mutex_);
auto iter = process_cpu_usage_data_.find(pid);
if (iter != process_cpu_usage_data_.end())
return iter->second;
else
return -1;
}
int CpuUsage::get_process_cpu_usage(pid_t pid)
{
refresh_twice();
return get_process_cpu_usage_without_refresh(pid);
}
int CpuUsage::get_thread_running_on_cpu_without_refresh(pid_t tid)
{
while(!has_data())
this_thread::sleep_for(chrono::milliseconds(10));
shared_lock<shared_timed_mutex> lock(data_mutex_);
auto iter = thread_cpu_usage_data_.find(tid);
if (iter != thread_cpu_usage_data_.end() && iter->second.valid_)
return iter->second.processor_;
else
return -1;
}
int CpuUsage::get_thread_running_on_cpu(pid_t tid)
{
refresh_twice();
return get_thread_running_on_cpu_without_refresh(tid);
}
std::shared_timed_mutex& CpuUsage::get_data_mutex()
{
return data_mutex_;
}
std::atomic<int>& CpuUsage::get_has_data_cnt()
{
return has_data_cnt_;
}
bool CpuUsage::has_data()
{
return has_data_cnt_ >= 2;
}
void CpuUsage::refresh_twice()
{
if(!joinable())
{
refresh();
this_thread::sleep_for(chrono::milliseconds(interval_ms_));
refresh();
}
}
unsigned int CpuUsage::get_total_cpu_time_delta() const
{
return (total_cpu_time_old == 0)?
0: total_cpu_time_delta;
}
void CpuUsage::start_watching(pid_t pid)
{
to_start_watching_.push_back(pid);
}
void CpuUsage::stop_watching(pid_t pid)
{
to_stop_watching_.push_back(pid);
}
void CpuUsage::clear()
{
thread_cpu_usage_data_.clear();
process_cpu_usage_data_.clear();
to_start_watching_.clear();
to_stop_watching_.clear();
total_cpu_time_new = 0;
total_cpu_time_old = 0;
total_cpu_time_delta = 0;
idle_time_old = 0;
idle_time_new = 0;
idle_time_delta = 0;
has_data_cnt_ = 0;
}
void CpuUsage::refresh()
{
unique_lock<shared_timed_mutex> lock(data_mutex_);
refresh_system();
refresh_watching();
refresh_thread();
// LDEBUG << "DDDD: interval_ms_: " << interval_ms_ << endl;
// LDEBUG << "DDD----" << endl;
// for (auto& vm_id : vm_ids_) {
// LDEBUG << "DDD " << vm_id << ">>";
// for (auto& id : vcpu_ids_[vm_id]) {
// LDEBUG << ":" << id;
// }
// LDEBUG << endl;
// }
if (has_data_cnt_ < 2)
++has_data_cnt_;
return;
}
void CpuUsage::refresh_system()
{
unsigned long long user_time;
unsigned long long nice_time;
unsigned long long sys_time;
unsigned long long idle_time;
FILE* fp = fopen(SYS_PROC_STAT, "r");
if (fp == nullptr) {
THROW(FileOpenFailed, "To open file: " + string(SYS_PROC_STAT));
}
fscanf(fp, "%*s %llu %llu %llu %llu", &user_time, &nice_time,
&sys_time, &idle_time);
total_cpu_time_old = total_cpu_time_new;
total_cpu_time_new = user_time + nice_time + sys_time + idle_time;
total_cpu_time_delta = total_cpu_time_new - total_cpu_time_old;
idle_time_old = idle_time_new;
idle_time_new = idle_time;
idle_time_delta = idle_time_new - idle_time_old;
fclose(fp);
}
void CpuUsage::refresh_watching()
{
for (auto pid : to_start_watching_) {
auto ret = process_cpu_usage_data_.insert({pid, {} });
if (!ret.second) { //insert failed
LDEBUG << "cpu usage insert to to_start_watching_ failed on pid:" << pid << ". already existed.";
}
}
to_start_watching_.clear();
for (auto pid : to_stop_watching_) {
auto iter = process_cpu_usage_data_.find(pid);
if (iter != process_cpu_usage_data_.end()) {
process_cpu_usage_data_.erase(iter);
} else {
LDEBUG << "cpu usage erase from to_stop_watching_ failed on pid:" << pid << ". not existed";
}
}
to_stop_watching_.clear();
}
void CpuUsage::refresh_thread()
{
std::unique_ptr<pid_t[]> pids(new pid_t[process_cpu_usage_data_.size() + 1]);
int idx = 0;
for (auto& data : process_cpu_usage_data_) {
pids[idx] = data.first;
++idx;
}
pids[idx] = 0;
PROCTAB* proctab = openproc(READ_PROC_FLAG, pids.get());
if (proctab == nullptr)
{
string pids_str;
for (int i = 0; i < idx -1; ++i)
pids_str += to_string(pids[i]) + " ";
THROW(OpenProcFailed, "To open pids: " + pids_str);
}
proc_t proc_info;
memset(&proc_info, 0, sizeof(proc_info));
proc_t task_info;
memset(&task_info, 0, sizeof(task_info));
// invalid old data
for_each(thread_cpu_usage_data_.begin(), thread_cpu_usage_data_.end(), [](std::pair<const pid_t, ThreadCpuUsageData>& p) { p.second.valid_ = false; });
while (readproc(proctab, &proc_info) != nullptr) {
process_cpu_usage_data_[proc_info.tid] = 0;
int cnt = 0;
while (readtask(proctab, &proc_info, &task_info) != nullptr) {
thread_cpu_usage_data_[task_info.tid].update(&task_info);
thread_cpu_usage_data_[task_info.tid].valid_ = true;
process_cpu_usage_data_[proc_info.tid] += static_cast<int>(thread_cpu_usage_data_[task_info.tid].proctime_new_ - thread_cpu_usage_data_[task_info.tid].proctime_old_);
++cnt;
}
// LDEBUG << "DDD:" << proc_info.tid << ":" << process_cpu_usage_data_[proc_info.tid] << endl;
process_cpu_usage_data_[proc_info.tid] = static_cast<int>((total_cpu_time_old == 0 || total_cpu_time_delta == 0) ?
0 : (static_cast<unsigned int>(process_cpu_usage_data_[proc_info.tid]) / static_cast<unsigned int>(cnt) * 100 * cpu_num_ / total_cpu_time_delta));
}
// erase data of invalid proc
for (auto& p : thread_cpu_usage_data_) {
if (!p.second.valid_) {
p.second.clear_data();
}
}
for (const auto& data : thread_cpu_usage_data_) {
if (*callback_func_) {
(*callback_func_)(data.second.tgid_, data.first, data.second.cpu_usage_);
}
}
closeproc(proctab);
}
void CpuUsage::run()
{
while(!stop_)
{
refresh();
this_thread::sleep_for(chrono::milliseconds(interval_ms_));
}
unique_lock<shared_timed_mutex> lock(data_mutex_);
clear();
}
CpuUsage::ThreadCpuUsageData::ThreadCpuUsageData()
{
}
void CpuUsage::ThreadCpuUsageData::update(const proc_t* task)
{
processor_ = task->processor;
tgid_ = task->tgid;
if(proctime_new_ == 0)
{
proctime_new_ = task->utime + task->stime;
proctime_old_ = proctime_new_;
}
else
{
proctime_old_ = proctime_new_;
proctime_new_ = task->utime + task->stime;
}
auto cpu_usage = CpuUsage::get_instance();
unsigned int sys_cpu = cpu_usage->get_total_cpu_time_delta();
unsigned int proctime_delta = proctime_new_ - proctime_old_;
cpu_usage_ = static_cast<int>((sys_cpu == 0) ?
0 : (proctime_delta * 100 * CpuUsage::cpu_num_
/ sys_cpu));
// LDEBUG << "TTT" << task->tid << ":" << processor_ << ":" << tgid_ << ":" << cpu_usage_ << endl;
// LDEBUG << "sys_cpu:" << sys_cpu << " proctime_delta:" << proctime_delta << " num_cpus:" << CpuUsage::cpu_num_ << endl;
// LDEBUG << "proctime_old_:" << proctime_old_ << " proctime_new_:" << proctime_new_ << " utime:" << task->utime << " stime:" << task->stime << endl;
}
void CpuUsage::ThreadCpuUsageData::clear_data()
{
proctime_new_ = 0;
proctime_old_ = 0;
cpu_usage_ = -1;
processor_ = -1;
tgid_ = -1;
}
std::ostream &operator<<(std::ostream &os, const CpuUsage::ThreadCpuUsageData& data)
{
os << "["
<< data.valid_ << ":"
<< data.tgid_ << ":"
<< data.processor_ << ":"
<< data.cpu_usage_ << ":"
<< data.proctime_new_ << ":"
<< data.proctime_old_ << "]";
return os;
}
| [
"yuxinjiect@gmail.com"
] | yuxinjiect@gmail.com |
abb8d7c799b7bd003d9c9ea341b0c96442b8bd1b | f52c5bd8b1e65483d1e2b258526a9cc5fbaf001c | /dataaccess.cpp | 38cf8d93a6dc97c578b248311058f3955c15484a | [] | no_license | clogwog/drive | 811f65af0883ff1f1a4bf640e995dd3ea383918d | a6a7f3cfa17eae09d4f86192a2c26c06362baa09 | refs/heads/master | 2021-08-19T12:35:08.575267 | 2017-11-26T09:08:04 | 2017-11-26T09:08:04 | 112,069,011 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 990 | cpp | #include "dataaccess.h"
DataAccess::DataAccess(QObject *parent) : QObject(parent)
{
m_ToDoItems = new QQmlObjectListModel<ToDoItem> (this);
//------
ToDoItem* list1 = new ToDoItem(m_ToDoItems);
list1->set_done(true);
list1->set_description("bla bla");
m_ToDoItems->append(list1);
list1 = new ToDoItem(m_ToDoItems);
list1->set_done(false);
list1->set_description("finish drawing");
m_ToDoItems->append(list1);
//-----
m_CurrentTheme = new Theme();
}
void DataAccess::addNewTodo(int index)
{
ToDoItem* newTodo = new ToDoItem(m_ToDoItems);
if ( index < 0 || index > m_ToDoItems->count() - 1 )
m_ToDoItems->append(newTodo);
else
{
m_ToDoItems->insert(index,newTodo);
}
}
void DataAccess::deleteDoneTodos()
{
for( int i = 0 ; i < m_ToDoItems->size();)
{
if (m_ToDoItems->at(i)->get_done() )
m_ToDoItems->remove(m_ToDoItems->at(i));
else
++i;
}
}
| [
"tom@clogwog.net"
] | tom@clogwog.net |
05e72bf24e8e54842d5057cc975d4283cac53eba | 3504923eca519fbf0f37cfbafde3f2b74bcbe33d | /Project 1/Torus.cpp | 2d09ddf417d20762008acdcd7b46ef0a2d08f5a2 | [] | no_license | edualm/LAIG-OpenGL-Le-Bloq | 04c7b284af158bbd94898ec618fbc8f18b2e4008 | a0f801d5316574b3645e2f0889262871c740af63 | refs/heads/master | 2021-01-18T10:03:31.377711 | 2015-01-02T21:50:02 | 2015-01-02T21:50:02 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,659 | cpp | //
// Torus.cpp
// Project 1
//
// Created by Eduardo Almeida on 02/01/15.
// Copyright (c) 2015 Eduardo Almeida. All rights reserved.
//
#include "Torus.h"
void Torus::draw() {
glRotated(90, 1, 0, 0);
unsigned int i, j;
double phi;
double theta;
double ***vertex = (double ***) malloc((_slices + 1) * sizeof(double **));
for (unsigned int i = 0; i < _slices + 1; i++) {
double **loops = (double **) malloc((_loops + 1) * sizeof(double *));
for (unsigned int j = 0; j < _loops + 1; j++) {
double *xyz = (double *) malloc(3 * sizeof(double));
loops[j] = xyz;
}
vertex[i] = loops;
}
double ***textureVertex = (double ***) malloc((_slices + 1) * sizeof(double **));
for (unsigned int i = 0; i < _slices + 1; i++) {
double **loops = (double **) malloc((_loops + 1) * sizeof(double *));
for (unsigned int j = 0; j < _loops + 1; j++) {
double *xyz = (double *) malloc(3 * sizeof(double));
loops[j] = xyz;
}
textureVertex[i] = loops;
}
double ***normalVertex = (double ***) malloc((_slices + 1) * sizeof(double **));
for (unsigned int i = 0; i < _slices + 1; i++) {
double **loops = (double **) malloc((_loops + 1) * sizeof(double *));
for (unsigned int j = 0; j < _loops + 1; j++) {
double *xyz = (double *) malloc(3 * sizeof(double));
loops[j] = xyz;
}
normalVertex[i] = loops;
}
double *p1,*p2,*p3,*p4;
double *v1,*v2,*v3,*v4;
double *n1,*n2,*n3,*n4;
double R = _outer + 0.5 * _inner; //distancia do centro do torus ao centro do tubo <-- needed cause maths
//limites senao da asneira pois o vertex tem de ter espaÁos finitos
if (_slices > 50)
_slices = 50; //slices e o numero de pontos de cada loop
if (_loops > 50)
_loops = 50; //numero de circunferencias a desenhar
//Vertices serao armazenados aqui para uso a seguir
for (i = 0; i <= _slices; i++) {
phi = 2.0 * M_PI * (double)i / (double)_slices; //o angulo vai de 0 a 360
for (j = 0; j <= _loops; j++) {
theta = 2.0 * M_PI * (double)j / (double)_loops; //o angulo vai de 0 a 360
vertex[i][j][0] = (double) (R + _inner*cos(theta))*cos(phi) ;//x
vertex[i][j][1] = (double) _inner * sin(theta);//y
vertex[i][j][2] = (double) (R + _inner*cos(theta))*sin(phi);//z
textureVertex[i][j][1] = (double) ((acos(vertex[i][j][1] / R) / (/*2 **/0.5* M_PI))) ; //texture coord u
textureVertex[i][j][0] = (double) ((acos(vertex[i][j][0] / (R + _inner*cos(theta))) / (/*2 **/ 0.5*M_PI))) ; //texture coord v
double tx = -sin(theta);
double ty = 0;
double tz = cos(theta);
double sx = cos(theta) * (-sin(phi));
double sy = cos(phi);
double sz = sin(theta) * (-sin(phi));
double nx = ty*sz - tz*sy;
double ny = tz*sx - tx*sz;
double nz = tx*sy - ty*sx;
double length = sqrt(nx*nx + ny*ny + nz*nz);
nx /= length;
ny /= length;
nz /= length;
normalVertex[i][j][0] = nx;
normalVertex[i][j][1] = ny;
normalVertex[i][j][2] = nz;
}
}
if (Globals::getInstance().getDrawingSettings()->getSmooth()) {
for (i = 0; i < _slices; i++){
for (j = 0; j < _loops; j++) {
if (j <= _loops) {
p1 = vertex[i][j];
p2 = vertex[i][j+1];
p3 = vertex[i+1][j+1];
p4 = vertex[i+1][j];
v1 = textureVertex[i][j];
v2 = textureVertex[i][j+1];
v3 = textureVertex[i+1][j+1];
v4 = textureVertex[i+1][j];
n1 = normalVertex[i][j];
n2 = normalVertex[i][j+1];
n3 = normalVertex[i+1][j+1];
n4 = normalVertex[i+1][j];
glBegin(GL_QUADS);
{
glNormal3dv(n1); glTexCoord2dv(v1); glVertex3dv(p1);
glNormal3dv(n2); glTexCoord2dv(v2); glVertex3dv(p2);
glNormal3dv(n3); glTexCoord2dv(v3); glVertex3dv(p3);
glNormal3dv(n4); glTexCoord2dv(v4); glVertex3dv(p4);
}
glEnd();
}
}
}
} else {
for (i = 0;i < _slices;i++) {
for (j = 0;j < _loops; j++) {
if (j <= _loops) {
p1 = vertex[i][j];
p2 = vertex[i][j+1];
p3 = vertex[i+1][j+1];
p4 = vertex[i+1][j];
v1 = textureVertex[i][j];
v2 = textureVertex[i][j+1];
v3 = textureVertex[i+1][j+1];
v4 = textureVertex[i+1][j];
glBegin(GL_QUADS);
{
double Nx = (normalVertex[i][j+1][1] - normalVertex[i+1][j+1][1])*(normalVertex[i+1][j+1][2] - normalVertex[i][j][2]) - (normalVertex[i][j+1][2] - normalVertex[i+1][j+1][2])*(normalVertex[i+1][j+1][1] - normalVertex[i][j][1]); // UyVz - UzVy
double Ny = (normalVertex[i][j+1][2] - normalVertex[i+1][j+1][2])*(normalVertex[i+1][j+1][0] - normalVertex[i][j][0]) - (normalVertex[i][j+1][0] - normalVertex[i+1][j+1][0])*(normalVertex[i+1][j+1][2] - normalVertex[i][j][2]); // UzVx - UxVz
double Nz = (normalVertex[i][j+1][0] - normalVertex[i+1][j+1][0])*(normalVertex[i+1][j+1][1] - normalVertex[i][j][1]) - (normalVertex[i][j+1][1] - normalVertex[i+1][j+1][1])*(normalVertex[i+1][j+1][0] - normalVertex[i][j][0]); // UxVy - UyVx
double lenght = sqrt(Nx*Nx + Ny*Ny + Nz+Nz);
Nx = Nx / lenght;
Ny = Ny / lenght;
Nz = Nz / lenght;
glNormal3d(Nx, Ny, Nz);
glTexCoord2dv(v1); glVertex3dv(p1);
glTexCoord2dv(v2); glVertex3dv(p2);
glTexCoord2dv(v3); glVertex3dv(p3);
glTexCoord2dv(v4); glVertex3dv(p4);
}
glEnd();
}
}
}
}
for (unsigned int i = 0; i < _slices + 1; i++) {
for (unsigned int j = 0; j < _loops + 1; j++)
free(vertex[i][j]);
free(vertex[i]);
}
free(vertex);
for (unsigned int i = 0; i < _slices + 1; i++) {
for (unsigned int j = 0; j < _loops + 1; j++)
free(textureVertex[i][j]);
free(textureVertex[i]);
}
free(textureVertex);
for (unsigned int i = 0; i < _slices + 1; i++) {
for (unsigned int j = 0; j < _loops + 1; j++)
free(normalVertex[i][j]);
free(normalVertex[i]);
}
free(normalVertex);
}
| [
"megaedux@me.com"
] | megaedux@me.com |
abb54766efd17dfa1d078a2efce0098423321f70 | 8c74619ca798ca00ad085440e42b2bc679877c96 | /Unit_Test_V1.0/OnDataSent.ino | 3a7d2ccf378682c58538927f8005d166ada4e85e | [] | no_license | FormulaRacingatUCDavis/Telemetry-Transceiver | b2ff4428edbf49537e4c42d59ceb145171cc0c91 | 62f5babb8b5677196c7de8435003c099c8fa3d9f | refs/heads/main | 2023-02-18T20:48:19.336379 | 2021-01-24T00:26:22 | 2021-01-24T00:26:22 | 328,820,404 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 161 | ino | // Callback when data is sent
void OnDataSent(const uint8_t *mac_addr, esp_now_send_status_t status) {
if (status == 0){
sent++;
}
current_buffer--;
}
| [
"ryankim2731@users.noreply.github.com"
] | ryankim2731@users.noreply.github.com |
e70309f96bffa5b4a901a5b173c0429eeacc58a4 | a1809f8abdb7d0d5bbf847b076df207400e7b08a | /Simpsons Hit&Run/game/libs/scrooby/apps/builder/FeData/NamedElements/Descriptions/DrawingElementDescription.h | 554202c37565547572b4fff4e6f4104efb730c0d | [] | no_license | RolphWoggom/shr.tar | 556cca3ff89fff3ff46a77b32a16bebca85acabf | 147796d55e69f490fb001f8cbdb9bf7de9e556ad | refs/heads/master | 2023-07-03T19:15:13.649803 | 2021-08-27T22:24:13 | 2021-08-27T22:24:13 | 400,380,551 | 8 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,707 | h | //===========================================================================
// Copyright (C) 2000 Radical Entertainment Ltd. All rights reserved.
//
// Component: FE Builder Data Structure
//
// Description: This contains the DrawingElementDescription class which represents a
// DrawingElementDescription.
//
// Authors: Ryan Bedard, Eric Tong
//
//===========================================================================
// Recompilation protection flag.
#ifndef __DRAWINGELEMENTDESCRIPTIION_H
#define __DRAWINGELEMENTDESCRIPTIION_H
//===========================================================================
// Nested Includes
//===========================================================================
#include "PageElementDescription.h"
//===========================================================================
// Forward References
//===========================================================================
namespace FeData
{
class Page;
class DrawingElement;
class TokenList;
}
//===========================================================================
// Constants, Typedefs, and Macro Definitions (needed by external clients)
//===========================================================================
//===========================================================================
// Interface Definitions
//===========================================================================
//===========================================================================
//
// Description: This class is used to represent a front-end drawing element.
//
// Constraints: None
//
//===========================================================================
namespace FeData
{
class DrawingElementDescription : public PageElementDescription
{
public:
DrawingElementDescription();
virtual ~DrawingElementDescription();
virtual bool AddToTokenList( TokenList& tokenList );
virtual bool SetFromTokenList( TokenList& tokenList );
virtual DrawingElement* CreateHierarchyElement( Page* page ) = 0;
protected:
private:
DrawingElementDescription(const DrawingElementDescription &right);
const DrawingElementDescription & operator = (const DrawingElementDescription &right);
// Data members
};
}
//===========================================================================
// Inlines
//===========================================================================
#endif // End conditional inclusion
| [
"81568815+RolphWoggom@users.noreply.github.com"
] | 81568815+RolphWoggom@users.noreply.github.com |
cd51d4548ff99100d3c94302da91f6d1d10865a3 | d5f121180b2de616daf4c2557bd1eaf216e3f4d7 | /20190108Pavel/queue.cc | 3e683a8110681e40d03bc5bbceed4e443b6934a4 | [] | no_license | Pavel-Zhan/WangDaoTest | 83d9e6827dc6a6b37a4f0ef0d43d13f5f4d34a4e | 03967fde86c0741a6ce3f207042e4ce94296d8c3 | refs/heads/master | 2020-04-15T16:27:07.480814 | 2019-01-12T12:58:48 | 2019-01-12T12:58:48 | 164,836,862 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,759 | cc | //queue
#include <iostream>
using std::cout;
using std::endl;
class Queue
{
public:
void initQueue();
void push(int x);
void pop();
int front();
int back();
bool empty();
bool full();
Queue();
Queue(int Max_size);
~Queue();
private:
int *_data;
int _top;
int _maxSize;
};
void Queue::initQueue()
{
_top = -1;
_data = new int(_maxSize);
}
void Queue::push(int x)
{
if(_maxSize == _top+1)
{
cout << "It is full!" <<endl;
}
else
{
for(int i=_top;i>=0;i--)
{
_data[i+1] = _data[i];
}
_data[0] = x;
_top += 1;
}
}
void Queue::pop()
{
if(-1 == _top)
{
cout << "There is no element in this fucking Queue!" <<endl;
}
else
{
_top -= 1;
}
}
int Queue::front()
{
if(-1 == _top)
{
cout << "There is no element in this fucking Queue!" << endl;
}
else
{
cout << "The top of this Queue is:"<< _data[_top] <<endl;
return _data[_top];
}
}
int Queue::back()
{
if(-1 == _top)
{
cout << "There is no element in this fucking Queue!" <<endl;
}
else
{
cout << "The rail of the Queue is:"<< _data[0] << endl;
return _data[0];
}
}
bool Queue::empty()
{
return (-1 == _top)?1:0;
}
bool Queue::full()
{
return (_top >= _maxSize)?1:0;
}
Queue::Queue()
{
_maxSize = 10;
initQueue();
}
Queue::Queue(int Max_size)
{
_maxSize = Max_size;
initQueue();
}
Queue::~Queue()
{
delete _data;
}
int main()
{
Queue queue1;
queue1.push(10);
queue1.push(12);
queue1.push(14);
queue1.front();
queue1.pop();
queue1.front();
return 0;
}
| [
"1786447581@qq.com"
] | 1786447581@qq.com |
97e5c0f214eb3cb4b62437356ed35f99d3b1a059 | b22588340d7925b614a735bbbde1b351ad657ffc | /athena/Trigger/TrigAnalysis/TriggerMenuAnalysis/src/HltConfigNtComponent.cxx | cd5a13e8088072dc537a81c25c35abd06d4e9b36 | [] | no_license | rushioda/PIXELVALID_athena | 90befe12042c1249cbb3655dde1428bb9b9a42ce | 22df23187ef85e9c3120122c8375ea0e7d8ea440 | refs/heads/master | 2020-12-14T22:01:15.365949 | 2020-01-19T03:59:35 | 2020-01-19T03:59:35 | 234,836,993 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,583 | cxx | /*
Copyright (C) 2002-2017 CERN for the benefit of the ATLAS collaboration
*/
/*
HltConfigNtComponent.cxx
*/
#include "TriggerMenuAnalysis/HltConfigNtComponent.h"
#include "TrigConfHLTData/HLTChainList.h"
#include "TrigConfHLTData/HLTChain.h"
#include "EventInfo/EventInfo.h"
#include "EventInfo/EventID.h"
#include "boost/foreach.hpp"
using namespace std;
HltConfigNtComponent::HltConfigNtComponent(NtupleAlgorithm* algo,
const NtComponent::NtComponentParameters& params) :
NtComponent::NtupleComponent(algo, params),
m_trigConfigSvc("TrigConf::IHLTConfigSvc/TrigConfigSvc", algo->name()),
m_eventInfoKey("ByteStreamEventInfo"), m_run(0),
m_chainNames(0), m_chainCounters(0) {
}
HltConfigNtComponent::~HltConfigNtComponent() {
}
StatusCode HltConfigNtComponent::setupServices() {
if (NtComponent::NtupleComponent::setupServices().isFailure()) {
(*m_msg) << MSG::DEBUG << "Cannot setup service " << endreq;
return StatusCode::FAILURE;
}
if (m_trigConfigSvc.retrieve().isFailure()) {
(*m_msg) << MSG::DEBUG << "Cannot retrieve TrigConfigSvc" << endreq;
return StatusCode::FAILURE;
}
return StatusCode::SUCCESS;
}
StatusCode HltConfigNtComponent::book() {
map<string, string>::const_iterator p =
m_parameters.containerKeys.find("EventInfo");
if (p != m_parameters.containerKeys.end()) {
m_eventInfoKey = p->second;
} else {
(*m_msg) << MSG::INFO << "No EventInfo key specified, use "
<< m_eventInfoKey << endreq;
}
m_chainNames = new std::vector<std::string>();
m_chainCounters = new std::vector<int>();
m_tree->Branch("Run", &m_run, "Run/I");
m_tree->Branch("ChainNames", "std::vector<std::string>", &m_chainNames);
m_tree->Branch("ChainCounters", "std::vector<int>", &m_chainCounters);
return StatusCode::SUCCESS;
}
StatusCode HltConfigNtComponent::fill() {
clear();
const EventInfo* ei=0;
if ( (*m_evtStore)->retrieve(ei).isFailure()) {
(*m_msg) << MSG::WARNING << "Failed to retrieve EventInfo "
<< endreq;
}
if (ei) {
const EventID *eid = ei->event_ID();
if (eid) m_run = eid->run_number();
}
const TrigConf::HLTChainList* chainlist = m_trigConfigSvc->chainList();
if (chainlist) {
BOOST_FOREACH(TrigConf::HLTChain* chain, *chainlist) {
m_chainNames->push_back( chain->chain_name());
m_chainCounters->push_back( chain->chain_counter());
}
}
return StatusCode::SUCCESS;
}
void HltConfigNtComponent::clear() {
m_run = 0;
if (m_chainNames) m_chainNames->clear();
if (m_chainCounters) m_chainCounters->clear();
}
| [
"rushioda@lxplus754.cern.ch"
] | rushioda@lxplus754.cern.ch |
1f26840e214073678ff2959a68f14d5207fcfae1 | 0f98061e869751707f37b50705d7dc8711ab8d99 | /include/ItemManager.h | b24fe45eb4c025618cd70a2c42f120d2179727a5 | [] | no_license | KonstantinKostadinovHub/Red-Voyage | 75dcb296e7c3b78b8bbd69cb92aa132a46e44aab | 1aeb5d165e40c1bf07ea043cac084e921112a235 | refs/heads/master | 2023-06-27T05:53:02.368260 | 2021-08-06T08:15:00 | 2021-08-06T08:15:00 | 368,647,424 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 250 | h | #pragma once
#include "Player.h"
class ItemManager
{
public:
protected:
friend class LeatherBoots;
static void equipItem(Player* player, ITEM_TYPE type, ITEM item);
friend class Player;
static void applyItemEffect(Player* player, ITEM item);
}; | [
"konstantinkk2000@gmail.com"
] | konstantinkk2000@gmail.com |
7dec11c0b0a70260db58794c45f3d6ded9478c74 | 4633acbf92c19ce3c35e0ff7ee04fed9df115763 | /src/Scene/Model/Map.hpp | 87594caab3753f7bbe22bd2a043d02b91c918357 | [
"MIT"
] | permissive | OrangeJuice7/SDL-OpenGL-Game-Framework | 8ff49c7988bcc06304000b45d38a051ccb1f20e7 | 6c7be198d39f93bb027f535c3b55b75bb26d4c7f | refs/heads/master | 2021-05-19T06:13:16.438467 | 2020-11-22T03:37:34 | 2020-11-22T03:37:34 | 251,561,463 | 2 | 3 | MIT | 2020-10-25T22:20:00 | 2020-03-31T09:46:39 | C++ | UTF-8 | C++ | false | false | 573 | hpp | #ifndef MAP_HPP
#define MAP_HPP
class GameModelManager;
class UiManager;
class Map {
public:
Map();
virtual ~Map();
float getWindVelX() const;
float getWindVelY() const;
float getWindDragCoeff() const;
// Map borders?
void doTick(GameModelManager& model);
void draw(UiManager &uiManager) const;
protected:
float windVelX,
windVelY;
float windDragCoeff; // This is the coeff in Hooke's law for springs (where the springed quantity is velocity)
};
#endif // MAP_HPP
| [
"jontheorange@gmail.com"
] | jontheorange@gmail.com |
e0ab53c2dbf53ede02ba38bba263fe6ab56774dd | eae0f480188b52eb01993dee5eff8cb00d93005d | /agg-2.5/examples/line_patterns_clip.cpp | dfbd3d744707fb6e22c62780f280805f44b19d2f | [
"MIT",
"GPL-2.0-only",
"GPL-2.0-or-later"
] | permissive | jangko/nimAGG | 49a0675b01ab885497ca7e1fa99cc4fa9f9c9e5d | 0566604c1576517ae25b1d5bc430f896d15bd16f | refs/heads/devel | 2021-01-11T09:26:22.349647 | 2019-05-30T10:08:31 | 2019-05-30T10:08:31 | 76,875,061 | 18 | 0 | MIT | 2019-05-30T09:57:22 | 2016-12-19T15:48:12 | Nim | UTF-8 | C++ | false | false | 14,052 | cpp | #include <math.h>
#include <stdio.h>
#include <time.h>
#include "agg_math.h"
#include "agg_rendering_buffer.h"
#include "agg_conv_transform.h"
#include "agg_conv_stroke.h"
#include "agg_conv_clip_polyline.h"
#include "agg_scanline_p.h"
#include "agg_renderer_scanline.h"
#include "agg_rasterizer_outline_aa.h"
#include "agg_rasterizer_scanline_aa.h"
#include "agg_pattern_filters_rgba.h"
#include "agg_renderer_outline_aa.h"
#include "agg_renderer_outline_image.h"
#include "agg_path_storage.h"
#include "agg_pixfmt_rgb.h"
#include "ctrl/agg_slider_ctrl.h"
#include "ctrl/agg_bezier_ctrl.h"
#include "platform/agg_platform_support.h"
enum flip_y_e { flip_y = true };
typedef agg::pixfmt_bgr24 pixfmt;
static agg::int8u brightness_to_alpha[256 * 3] =
{
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 254, 254, 254, 254, 254, 254,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
254, 254, 254, 254, 254, 254, 254, 254, 254, 254, 254, 254, 254, 254, 253, 253,
253, 253, 253, 253, 253, 253, 253, 253, 253, 253, 253, 253, 253, 253, 253, 252,
252, 252, 252, 252, 252, 252, 252, 252, 252, 252, 252, 251, 251, 251, 251, 251,
251, 251, 251, 251, 250, 250, 250, 250, 250, 250, 250, 250, 249, 249, 249, 249,
249, 249, 249, 248, 248, 248, 248, 248, 248, 248, 247, 247, 247, 247, 247, 246,
246, 246, 246, 246, 246, 245, 245, 245, 245, 245, 244, 244, 244, 244, 243, 243,
243, 243, 243, 242, 242, 242, 242, 241, 241, 241, 241, 240, 240, 240, 239, 239,
239, 239, 238, 238, 238, 238, 237, 237, 237, 236, 236, 236, 235, 235, 235, 234,
234, 234, 233, 233, 233, 232, 232, 232, 231, 231, 230, 230, 230, 229, 229, 229,
228, 228, 227, 227, 227, 226, 226, 225, 225, 224, 224, 224, 223, 223, 222, 222,
221, 221, 220, 220, 219, 219, 219, 218, 218, 217, 217, 216, 216, 215, 214, 214,
213, 213, 212, 212, 211, 211, 210, 210, 209, 209, 208, 207, 207, 206, 206, 205,
204, 204, 203, 203, 202, 201, 201, 200, 200, 199, 198, 198, 197, 196, 196, 195,
194, 194, 193, 192, 192, 191, 190, 190, 189, 188, 188, 187, 186, 186, 185, 184,
183, 183, 182, 181, 180, 180, 179, 178, 177, 177, 176, 175, 174, 174, 173, 172,
171, 171, 170, 169, 168, 167, 166, 166, 165, 164, 163, 162, 162, 161, 160, 159,
158, 157, 156, 156, 155, 154, 153, 152, 151, 150, 149, 148, 148, 147, 146, 145,
144, 143, 142, 141, 140, 139, 138, 137, 136, 135, 134, 133, 132, 131, 130, 129,
128, 128, 127, 125, 124, 123, 122, 121, 120, 119, 118, 117, 116, 115, 114, 113,
112, 111, 110, 109, 108, 107, 106, 105, 104, 102, 101, 100, 99, 98, 97, 96,
95, 94, 93, 91, 90, 89, 88, 87, 86, 85, 84, 82, 81, 80, 79, 78,
77, 75, 74, 73, 72, 71, 70, 69, 67, 66, 65, 64, 63, 61, 60, 59,
58, 57, 56, 54, 53, 52, 51, 50, 48, 47, 46, 45, 44, 42, 41, 40,
39, 37, 36, 35, 34, 33, 31, 30, 29, 28, 27, 25, 24, 23, 22, 20,
19, 18, 17, 15, 14, 13, 12, 11, 9, 8, 7, 6, 4, 3, 2, 1
};
class pattern_src_brightness_to_alpha_rgba8
{
public:
pattern_src_brightness_to_alpha_rgba8(agg::rendering_buffer& rb) :
m_rb(&rb), m_pf(*m_rb) {}
unsigned width() const { return m_pf.width(); }
unsigned height() const { return m_pf.height(); }
agg::rgba8 pixel(int x, int y) const
{
agg::rgba8 c = m_pf.pixel(x, y);
c.a = brightness_to_alpha[c.r + c.g + c.b];
return c;
}
private:
agg::rendering_buffer* m_rb;
pixfmt m_pf;
};
class the_application : public agg::platform_support
{
agg::rgba8 m_ctrl_color;
agg::polygon_ctrl<agg::rgba8> m_line1;
agg::slider_ctrl<agg::rgba8> m_scale_x;
agg::slider_ctrl<agg::rgba8> m_start_x;
agg::trans_affine m_scale;
public:
typedef agg::renderer_base<pixfmt> renderer_base;
typedef agg::renderer_scanline_aa_solid<renderer_base> renderer_scanline;
typedef agg::rasterizer_scanline_aa<agg::rasterizer_sl_clip_int_sat> rasterizer_scanline;
typedef agg::scanline_p8 scanline;
the_application(agg::pix_format_e format, bool flip_y) :
agg::platform_support(format, flip_y),
m_ctrl_color(agg::rgba(0, 0.3, 0.5, 0.3)),
m_line1(5),
m_scale_x(5.0, 5.0, 240.0, 12.0, !flip_y),
m_start_x(250.0, 5.0, 495.0, 12.0, !flip_y)
{
m_line1.line_color(m_ctrl_color);
m_line1.xn(0) = 20;
m_line1.yn(0) = 20;
m_line1.xn(1) = 500-20;
m_line1.yn(1) = 500-20;
m_line1.xn(2) = 500-60;
m_line1.yn(2) = 20;
m_line1.xn(3) = 40;
m_line1.yn(3) = 500-40;
m_line1.xn(4) = 100;
m_line1.yn(4) = 300;
m_line1.close(false);
add_ctrl(m_line1);
m_line1.transform(m_scale);
m_scale_x.label("Scale X=%.2f");
m_scale_x.range(0.2, 3.0);
m_scale_x.value(1.0);
add_ctrl(m_scale_x);
m_scale_x.no_transform();
m_start_x.label("Start X=%.2f");
m_start_x.range(0.0, 10.0);
m_start_x.value(0.0);
add_ctrl(m_start_x);
m_start_x.no_transform();
}
template<class Rasterizer, class Renderer>
void draw_polyline(Rasterizer& ras,
Renderer& ren,
const double* polyline,
int num_points)
{
agg::poly_plain_adaptor<double> vs(polyline, num_points, m_line1.close());
agg::conv_transform<agg::poly_plain_adaptor<double> > trans(vs, m_scale);
ras.add_path(trans);
}
virtual void on_draw()
{
pixfmt pf(rbuf_window());
renderer_base ren_base(pf);
ren_base.clear(agg::rgba(0.5, 0.75, 0.85));
renderer_scanline ren(ren_base);
rasterizer_scanline ras;
scanline sl;
ras.clip_box(0, 0, width(), height());
// Pattern source. Must have an interface:
// width() const
// height() const
// pixel(int x, int y) const
// Any agg::renderer_base<> or derived
// is good for the use as a source.
//-----------------------------------
pattern_src_brightness_to_alpha_rgba8 p1(rbuf_img(0));
agg::pattern_filter_bilinear_rgba8 fltr; // Filtering functor
// agg::line_image_pattern is the main container for the patterns. It creates
// a copy of the patterns extended according to the needs of the filter.
// agg::line_image_pattern can operate with arbitrary image width, but if the
// width of the pattern is power of 2, it's better to use the modified
// version agg::line_image_pattern_pow2 because it works about 15-25 percent
// faster than agg::line_image_pattern (because of using simple masking instead
// of expensive '%' operation).
typedef agg::line_image_pattern<agg::pattern_filter_bilinear_rgba8> pattern_type;
typedef agg::renderer_base<pixfmt> base_ren_type;
typedef agg::renderer_outline_image<base_ren_type, pattern_type> renderer_img_type;
typedef agg::rasterizer_outline_aa<renderer_img_type, agg::line_coord_sat> rasterizer_img_type;
typedef agg::renderer_outline_aa<base_ren_type> renderer_line_type;
typedef agg::rasterizer_outline_aa<renderer_line_type, agg::line_coord_sat> rasterizer_line_type;
//-- Create with specifying the source
//pattern_type patt(fltr, src);
//-- Create uninitialized and set the source
pattern_type patt(fltr);
patt.create(p1);
renderer_img_type ren_img(ren_base, patt);
rasterizer_img_type ras_img(ren_img);
//-- create uninitialized and set parameters
agg::line_profile_aa profile;
profile.smoother_width(10.0); //optional
profile.width(8.0); //mandatory!
renderer_line_type ren_line(ren_base, profile);
ren_line.color(agg::rgba8(0,0,127)); //mandatory!
rasterizer_line_type ras_line(ren_line);
ras_line.round_cap(true); //optional
//ras_line.line_join(agg::outline_no_join); //optional
// Calculate the dilation value so that, the line caps were
// drawn correctly.
//---------------
double w2 = 9.0;//p1.height() / 2 + 2;
// Set the clip box a bit bigger than you expect. You need it
// to draw the clipped line caps correctly. The correct result
// is achieved with raster clipping.
//------------------------
ren_img.scale_x(m_scale_x.value());
ren_img.start_x(m_start_x.value());
ren_img.clip_box (50-w2, 50-w2, width()-50+w2, height()-50+w2);
ren_line.clip_box(50-w2, 50-w2, width()-50+w2, height()-50+w2);
// First, draw polyline without raster clipping just to show the idea
//------------------------
draw_polyline(ras_line, ren_line, m_line1.polygon(), m_line1.num_points());
draw_polyline(ras_img, ren_img, m_line1.polygon(), m_line1.num_points());
// Clear the area, almost opaque, but not completely
//------------------------
ren_base.blend_bar(0, 0, (int)width(), (int)height(), agg::rgba(1,1,1), 200);
// Set the raster clip box and then, draw again.
// In reality there shouldn't be two calls above.
// It's done only for demonstration
//------------------------
ren_base.clip_box((int)50, (int)50, (int)width()-50, (int)height()-50);
// This "copy_bar" is also for demonstration only
//------------------------
ren_base.copy_bar(0, 0, (int)width(), (int)height(), agg::rgba(1,1,1));
// Finally draw polyline correctly clipped: We use double clipping,
// first is vector clipping, with extended clip box, second is raster
// clipping with normal clip box.
//------------------------
ren_img.scale_x(m_scale_x.value());
ren_img.start_x(m_start_x.value());
draw_polyline(ras_line, ren_line, m_line1.polygon(), m_line1.num_points());
draw_polyline(ras_img, ren_img, m_line1.polygon(), m_line1.num_points());
// Reset clipping and draw the controls and stuff
ren_base.reset_clipping(true);
m_line1.line_width(1/m_scale.scale());
m_line1.point_radius(5/m_scale.scale());
agg::render_ctrl(ras, sl, ren_base, m_line1);
agg::render_ctrl(ras, sl, ren_base, m_scale_x);
agg::render_ctrl(ras, sl, ren_base, m_start_x);
char buf[256];
agg::gsv_text t;
t.size(10.0);
agg::conv_stroke<agg::gsv_text> pt(t);
pt.width(1.5);
pt.line_cap(agg::round_cap);
const double* p = m_line1.polygon();
sprintf(buf, "Len=%.2f", agg::calc_distance(p[0], p[1], p[2], p[3]) * m_scale.scale());
t.start_point(10.0, 30.0);
t.text(buf);
ras.add_path(pt);
ren.color(agg::rgba(0,0,0));
agg::render_scanlines(ras, sl, ren);
}
virtual void on_key(int x, int y, unsigned key, unsigned flags)
{
if(key == '+' || key == agg::key_kp_plus)
{
m_scale *= agg::trans_affine_translation(-x, -y);
m_scale *= agg::trans_affine_scaling(1.1);
m_scale *= agg::trans_affine_translation(x, y);
force_redraw();
}
if(key == '-' || key == agg::key_kp_minus)
{
m_scale *= agg::trans_affine_translation(-x, -y);
m_scale *= agg::trans_affine_scaling(1/1.1);
m_scale *= agg::trans_affine_translation(x, y);
force_redraw();
}
}
virtual void on_ctrl_change()
{
}
};
int agg_main(int argc, char* argv[])
{
the_application app(agg::pix_format_bgr24, flip_y);
app.caption("AGG Example. Clipping Lines with Image Patterns");
if(!app.load_img(0, "1"))
{
char buf[256];
sprintf(buf, "There must be file 1%s\n", app.img_ext(), app.img_ext());
app.message(buf);
return 1;
}
if(app.init(500, 500, agg::window_resize))
{
return app.run();
}
return 1;
}
| [
"jangko128@gmail.com"
] | jangko128@gmail.com |
445e5ca2dde8308f097c190841862cb5ac855c48 | ce9916dad3eb37e6accc5226e65e2b9fc6d8a027 | /Opening.cpp | 179528949154c314a7f17ec4bafb9b8b0702ec98 | [
"MIT"
] | permissive | aaiijmrtt/CHESS | a0532c97625d67b284def57807cd92da4d3c99c0 | 870174e324c48f8978a14549678bbaecb2b053db | refs/heads/master | 2021-01-10T21:43:31.287735 | 2015-03-04T16:23:33 | 2015-03-04T16:23:33 | 31,666,286 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,149 | cpp | #define MAXMOVES 30
#define MAXINFO 20
#include"Tree.cpp"
typedef struct {
uint32_t moves[MAXMOVES];
int16_t info[MAXINFO];
} opening;
//assumes string length < 4*MAXMOVES
//calls movegenrator: must be freed
opening *algebraicopeningcreator(uint8_t *string) {
opening *_opening=(opening *)malloc(sizeof(opening));
uint8_t _position,__position,i=0,_count;
uint32_t *move;
initializer();
Engine engine;
while(string[i<<2]!='\0') {
_position=__position=0;
_position|=(string[i<<2|0]-'a');
_position|=(string[i<<2|1]-'1')<<3;
__position|=(string[i<<2|2]-'a');
__position|=(string[i<<2|3]-'1')<<3;
engine.piecepopulator();
move=engine.movegenerator(_position,Squares[__position],_count);
if(_count!=1) {
free(move);
free(_opening);
engine.~Engine();
return 0;
}
_opening->moves[i++]=move[0];
engine.movemaker(move[0]);
free(move);
}
for(;i<MAXMOVES;++i)
_opening->moves[i]=0;
for(i=0;i<MAXINFO;++i)
_opening->info[i]=0;
engine.~Engine();
return _opening;
}
//matches '_opening' with '__opening'
uint32_t openingmatcher(opening *_opening,opening *__opening) {
uint32_t match=0,i;
for(i=0;i<MAXMOVES;++i)
match|=_opening->moves[i]^__opening->moves[i];
return match;
}
//adds opening 'string' to book 'filename'
uint32_t filewriter(const char *filename,uint8_t *string) {
FILE *_file=fopen(filename,"rb"),*__file=fopen("temp.dat","wb");
if(!_file||!__file)
return 0;
opening *_opening=algebraicopeningcreator(string),*__opening=(opening *)malloc(sizeof(opening));
uint32_t match=0,_count=0;
while(fread(__opening,sizeof(opening),1,_file)==1) {
match|=!openingmatcher(_opening,__opening);
fwrite(__opening,sizeof(opening),1,__file);
_count++;
}
if(!match) {
fwrite(_opening,sizeof(opening),1,__file);
_count++;
}
fclose(_file);
fclose(__file);
free(_opening);
remove(filename);
rename("temp.dat",filename);
return _count;
}
//returns count of openings read from 'filename'
uint32_t filereader(const char *filename) {
FILE *_file=fopen(filename,"rb");
if(!_file)
return 0;
opening *_opening=(opening *)malloc(sizeof(opening));
uint32_t _count=0;
while(fread(_opening,sizeof(opening),1,_file)==1)
_count++;
fclose(_file);
free(_opening);
return _count;
}
//returns count of openings written to book 'filename'
uint32_t openingswriter(const char *filename) {
FILE *_file=fopen(filename,"r");
if(!_file)
return 0;
opening *_opening=(opening *)malloc(sizeof(opening));
uint8_t string[4*MAXMOVES+1],_count=0;
while(fscanf(_file,"%[^\n]\n",string)!=EOF) {
filewriter("openings.dat",string);
_count++;
}
fclose(_file);
free(_opening);
return _count;
}
opening *scoreopening(opening *_opening,uint32_t time) {
initializer();
Engine engine;
uint32_t i,j;
for(i=0;_opening->moves[i]&&i<MAXMOVES;++i)
engine.movemaker(_opening->moves[i]);
engine.piecepopulator();
Node root(0,0,0,0,_opening->moves[i-1],engine.evaluator(i&1));
Tree tree(&root,&engine);
clock_t _time=clock();
for(j=0;clock()<time+_time;++j)
_opening->info[j]=tree.deepen(tree.root,i&1);
tree.debug_printPrincipal();
engine.~Engine();
tree.~Tree();
return _opening;
}
| [
"aaiijmrtt@gmail.com"
] | aaiijmrtt@gmail.com |
6ab81a76dd3c66bc75e3839422d11b7fb3b0540a | cbe517f620928597d78750c98605bdd4829675cc | /Testing/SequentialFile_modified/functions.h | 82f5131d2bb4b57521abd64175a88804b5a8f585 | [
"MIT"
] | permissive | christianledgard/proyecto-DB2 | 575b1da4b4dc421b2fe8d4bcbdefce37e505baa0 | 35bf25bea5235ce315a012ff89d3db636b834cbc | refs/heads/main | 2022-12-26T00:24:35.149694 | 2020-10-14T04:40:03 | 2020-10-14T04:40:03 | 302,945,016 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,470 | h | #ifndef FUNCTIONS_H
#define FUNCTIONS_H
#include <iostream>
#include <vector>
#include <fstream>
#include "Record.h"
#include "SequentialFile.h"
void shortPrintTeams(std::vector<Team<long> > teams, unsigned long totalOrderedRegisters) {
std::cout << std::setw(4) << "ID" << " | " << std::setw(20) << "Equipo" << " | " << std::setw(4) << "next" << " | "
<< std::setw(4) << "prev" << " | " << std::setw(4) << "pos" << std::endl;
for (int i = 0; i < teams.size(); ++i) {
if (i == totalOrderedRegisters) {
std::cout << "------------------------------------------------" << std::endl;
}
teams[i].shortPrint();
std::cout << std::setw(4) << i << std::endl;
}
}
void shortPrintPlayers(std::vector<Player<long> > players, unsigned long totalOrderedRegisters) {
for (int i = 0; i < players.size(); ++i) {
if (i == totalOrderedRegisters) {
std::cout << "------------------------------------------------" << std::endl;
}
players[i].shortPrint();
std::cout << " | " << std::setw(4) << i << std::endl;
}
}
void printMessage(std::string message) {
std::cout << "\n" << message << std::endl;
}
void searchAndPrintTeams(std::vector<Team<long> > teams, SequentialFile<Team<long> > &teamsSequentialFile) {
for (Team<long> team : teams) {
Team<long> foundTeam = teamsSequentialFile.search(team.ID);
foundTeam.shortPrint();
std::cout << std::endl;
}
}
void searchAndPrintTeam(long ID, SequentialFile<Team<long> > &teamsSequentialFile) {
Team<long> foundTeam = teamsSequentialFile.search(ID);
foundTeam.shortPrint();
std::cout << std::endl;
}
void searchAndPrintTeamsRange(long begin, long end, SequentialFile<Team<long> > &teamsSequentialFile) {
std::vector<Team<long> > searchResult = teamsSequentialFile.searchByRanges(begin, end);
for (Team<long> team : searchResult) {
team.shortPrint();
putchar('\n');
}
}
void deleteAndPrint(long IDtoDelete, SequentialFile<Team<long> > &teamsSequentialFile) {
teamsSequentialFile.deleteRecord(IDtoDelete);
std::vector<Team<long> > teams = teamsSequentialFile.load();
shortPrintTeams(teams, teamsSequentialFile.getTotalOrderedRecords());
}
void writeCSV(std::string filename, std::vector<long> v){
std::ofstream myFile(filename);
for(long i = 0; i < v.size(); ++i)
myFile << v.at(i) << "\n";
myFile.close();
}
#endif | [
"carlos.reategui@utec.edu.pe"
] | carlos.reategui@utec.edu.pe |
f2ca6d392224f1a6cfc90b089be98fde34b7e3c9 | 52f62927bb096e6cbc01bd6e5625a119fb35c1c5 | /databases/CarpetHDF5/CarpetHDF5PluginInfo.h | 2f7502ebe6a923d6d731c893a639ed7727bc40c8 | [] | no_license | HarinarayanKrishnan/VisIt27RC_Trunk | f42f82d1cb2492f6df1c2f5bb05bbb598fce99c3 | 16cdd647ac0ad5abfd66b252d31c8b833142145a | refs/heads/master | 2020-06-03T07:13:46.229264 | 2014-02-26T18:13:38 | 2014-02-26T18:13:38 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,303 | h | /*****************************************************************************
*
* Copyright (c) 2000 - 2013, Lawrence Livermore National Security, LLC
* Produced at the Lawrence Livermore National Laboratory
* LLNL-CODE-442911
* All rights reserved.
*
* This file is part of VisIt. For details, see https://visit.llnl.gov/. The
* full copyright notice is contained in the file COPYRIGHT located at the root
* of the VisIt distribution or at http://www.llnl.gov/visit/copyright.html.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the disclaimer below.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the disclaimer (as noted below) in the
* documentation and/or other materials provided with the distribution.
* - Neither the name of the LLNS/LLNL nor the names of its contributors may
* be used to endorse or promote products derived from this software without
* specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL LAWRENCE LIVERMORE NATIONAL SECURITY,
* LLC, THE U.S. DEPARTMENT OF ENERGY OR CONTRIBUTORS BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
* DAMAGE.
*
*****************************************************************************/
// ****************************************************************************
// CarpetHDF5PluginInfo.h
// ****************************************************************************
#ifndef CARPETHDF5_PLUGIN_INFO_H
#define CARPETHDF5_PLUGIN_INFO_H
#include <DatabasePluginInfo.h>
#include <database_plugin_exports.h>
class avtDatabase;
class avtDatabaseWriter;
// ****************************************************************************
// Class: CarpetHDF5DatabasePluginInfo
//
// Purpose:
// Classes that provide all the information about the CarpetHDF5 plugin.
// Portions are separated into pieces relevant to the appropriate
// components of VisIt.
//
// Programmer: generated by xml2info
// Creation: omitted
//
// Modifications:
//
// ****************************************************************************
class CarpetHDF5GeneralPluginInfo : public virtual GeneralDatabasePluginInfo
{
public:
virtual const char *GetName() const;
virtual const char *GetVersion() const;
virtual const char *GetID() const;
virtual bool EnabledByDefault() const;
virtual bool HasWriter() const;
virtual std::vector<std::string> GetDefaultFilePatterns() const;
virtual bool AreDefaultFilePatternsStrict() const;
virtual bool OpensWholeDirectory() const;
};
class CarpetHDF5CommonPluginInfo : public virtual CommonDatabasePluginInfo, public virtual CarpetHDF5GeneralPluginInfo
{
public:
virtual DatabaseType GetDatabaseType();
virtual avtDatabase *SetupDatabase(const char * const *list,
int nList, int nBlock);
};
class CarpetHDF5MDServerPluginInfo : public virtual MDServerDatabasePluginInfo, public virtual CarpetHDF5CommonPluginInfo
{
public:
// this makes compilers happy... remove if we ever have functions here
virtual void dummy();
};
class CarpetHDF5EnginePluginInfo : public virtual EngineDatabasePluginInfo, public virtual CarpetHDF5CommonPluginInfo
{
public:
virtual avtDatabaseWriter *GetWriter(void);
};
#endif
| [
"brugger@18c085ea-50e0-402c-830e-de6fd14e8384"
] | brugger@18c085ea-50e0-402c-830e-de6fd14e8384 |
5ba0c40d55e85bc3ae53313fcdc854860893eeb1 | 73ee941896043f9b3e2ab40028d24ddd202f695f | /external/chromium_org/components/autofill/content/browser/wallet/wallet_signin_helper.cc | beeb1e7467c75465d734ebb8b77b7805ae5b71b4 | [
"BSD-3-Clause"
] | permissive | CyFI-Lab-Public/RetroScope | d441ea28b33aceeb9888c330a54b033cd7d48b05 | 276b5b03d63f49235db74f2c501057abb9e79d89 | refs/heads/master | 2022-04-08T23:11:44.482107 | 2016-09-22T20:15:43 | 2016-09-22T20:15:43 | 58,890,600 | 5 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 10,002 | cc | // Copyright 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "components/autofill/content/browser/wallet/wallet_signin_helper.h"
#include "base/callback_helpers.h"
#include "base/json/json_reader.h"
#include "base/logging.h"
#include "base/rand_util.h"
#include "base/strings/string_util.h"
#include "base/strings/stringprintf.h"
#include "base/time/time.h"
#include "base/values.h"
#include "components/autofill/content/browser/wallet/wallet_service_url.h"
#include "components/autofill/content/browser/wallet/wallet_signin_helper_delegate.h"
#include "content/public/browser/browser_thread.h"
#include "google_apis/gaia/google_service_auth_error.h"
#include "net/base/escape.h"
#include "net/cookies/canonical_cookie.h"
#include "net/cookies/cookie_monster.h"
#include "net/cookies/cookie_options.h"
#include "net/cookies/cookie_store.h"
#include "net/url_request/url_fetcher.h"
#include "net/url_request/url_request_context.h"
#include "net/url_request/url_request_context_getter.h"
namespace autofill {
namespace wallet {
namespace {
// Toolbar::GetAccountInfo API URL (JSON).
const char kGetAccountInfoUrlFormat[] =
"https://clients1.google.com/tbproxy/getaccountinfo?key=%d&rv=2&requestor=chrome";
const char kWalletCookieName[] = "gdtoken";
// Callback for retrieving Google Wallet cookies. |callback| is passed the
// retrieved cookies and posted back to the UI thread. |cookies| is any Google
// Wallet cookies.
void GetGoogleCookiesCallback(
const base::Callback<void(const std::string&)>& callback,
const net::CookieList& cookies) {
DCHECK(content::BrowserThread::CurrentlyOn(content::BrowserThread::IO));
std::string wallet_cookie;
for (size_t i = 0; i < cookies.size(); ++i) {
if (LowerCaseEqualsASCII(cookies[i].Name(), kWalletCookieName)) {
wallet_cookie = cookies[i].Value();
break;
}
}
content::BrowserThread::PostTask(content::BrowserThread::UI,
FROM_HERE,
base::Bind(callback, wallet_cookie));
}
// Gets Google Wallet cookies. Must be called on the IO thread.
// |request_context_getter| is a getter for the current request context.
// |callback| is called when retrieving cookies is completed.
void GetGoogleCookies(
scoped_refptr<net::URLRequestContextGetter> request_context_getter,
const base::Callback<void(const std::string&)>& callback) {
DCHECK(content::BrowserThread::CurrentlyOn(content::BrowserThread::IO));
net::URLRequestContext* url_request_context =
request_context_getter->GetURLRequestContext();
if (!url_request_context) {
content::BrowserThread::PostTask(content::BrowserThread::UI,
FROM_HERE,
base::Bind(callback, std::string()));
return;
}
net::CookieStore* cookie_store = url_request_context->cookie_store();
if (!cookie_store) {
content::BrowserThread::PostTask(content::BrowserThread::UI,
FROM_HERE,
base::Bind(callback, std::string()));
return;
}
net::CookieMonster* cookie_monster = cookie_store->GetCookieMonster();
if (!cookie_monster) {
content::BrowserThread::PostTask(content::BrowserThread::UI,
FROM_HERE,
base::Bind(callback, std::string()));
return;
}
net::CookieOptions cookie_options;
cookie_options.set_include_httponly();
cookie_monster->GetAllCookiesForURLWithOptionsAsync(
wallet::GetPassiveAuthUrl().GetWithEmptyPath(),
cookie_options,
base::Bind(&GetGoogleCookiesCallback, callback));
}
} // namespace
WalletSigninHelper::WalletSigninHelper(
WalletSigninHelperDelegate* delegate,
net::URLRequestContextGetter* getter)
: delegate_(delegate),
getter_(getter),
state_(IDLE),
weak_ptr_factory_(this) {
DCHECK(delegate_);
}
WalletSigninHelper::~WalletSigninHelper() {
}
void WalletSigninHelper::StartPassiveSignin() {
DCHECK_EQ(IDLE, state_);
DCHECK(!url_fetcher_);
state_ = PASSIVE_EXECUTING_SIGNIN;
username_.clear();
const GURL& url = wallet::GetPassiveAuthUrl();
url_fetcher_.reset(net::URLFetcher::Create(
0, url, net::URLFetcher::GET, this));
url_fetcher_->SetRequestContext(getter_);
url_fetcher_->Start();
}
void WalletSigninHelper::StartUserNameFetch() {
DCHECK_EQ(state_, IDLE);
DCHECK(!url_fetcher_);
state_ = USERNAME_FETCHING_USERINFO;
username_.clear();
StartFetchingUserNameFromSession();
}
void WalletSigninHelper::StartWalletCookieValueFetch() {
scoped_refptr<net::URLRequestContextGetter> request_context(getter_);
if (!request_context.get()) {
ReturnWalletCookieValue(std::string());
return;
}
base::Callback<void(const std::string&)> callback = base::Bind(
&WalletSigninHelper::ReturnWalletCookieValue,
weak_ptr_factory_.GetWeakPtr());
base::Closure task = base::Bind(&GetGoogleCookies, request_context, callback);
content::BrowserThread::PostTask(content::BrowserThread::IO, FROM_HERE, task);
}
std::string WalletSigninHelper::GetGetAccountInfoUrlForTesting() const {
return base::StringPrintf(kGetAccountInfoUrlFormat, 0);
}
void WalletSigninHelper::OnServiceError(const GoogleServiceAuthError& error) {
const State state_with_error = state_;
state_ = IDLE;
url_fetcher_.reset();
switch(state_with_error) {
case IDLE:
NOTREACHED();
break;
case PASSIVE_EXECUTING_SIGNIN: /*FALLTHROUGH*/
case PASSIVE_FETCHING_USERINFO:
delegate_->OnPassiveSigninFailure(error);
break;
case USERNAME_FETCHING_USERINFO:
delegate_->OnUserNameFetchFailure(error);
break;
}
}
void WalletSigninHelper::OnOtherError() {
OnServiceError(GoogleServiceAuthError::AuthErrorNone());
}
void WalletSigninHelper::OnURLFetchComplete(
const net::URLFetcher* fetcher) {
DCHECK_EQ(url_fetcher_.get(), fetcher);
if (!fetcher->GetStatus().is_success() ||
fetcher->GetResponseCode() < 200 ||
fetcher->GetResponseCode() >= 300) {
LOG(ERROR) << "URLFetchFailure: state=" << state_
<< " r=" << fetcher->GetResponseCode()
<< " s=" << fetcher->GetStatus().status()
<< " e=" << fetcher->GetStatus().error();
OnOtherError();
return;
}
switch (state_) {
case USERNAME_FETCHING_USERINFO: /*FALLTHROUGH*/
case PASSIVE_FETCHING_USERINFO:
ProcessGetAccountInfoResponseAndFinish();
break;
case PASSIVE_EXECUTING_SIGNIN:
if (ParseSignInResponse()) {
url_fetcher_.reset();
state_ = PASSIVE_FETCHING_USERINFO;
StartFetchingUserNameFromSession();
}
break;
default:
NOTREACHED() << "unexpected state_=" << state_;
}
}
void WalletSigninHelper::StartFetchingUserNameFromSession() {
const int random_number = static_cast<int>(base::RandUint64() % INT_MAX);
url_fetcher_.reset(
net::URLFetcher::Create(
0,
GURL(base::StringPrintf(kGetAccountInfoUrlFormat, random_number)),
net::URLFetcher::GET,
this));
url_fetcher_->SetRequestContext(getter_);
url_fetcher_->Start(); // This will result in OnURLFetchComplete callback.
}
void WalletSigninHelper::ProcessGetAccountInfoResponseAndFinish() {
std::string email;
if (!ParseGetAccountInfoResponse(url_fetcher_.get(), &email)) {
LOG(ERROR) << "failed to get the user email";
OnOtherError();
return;
}
username_ = email;
const State finishing_state = state_;
state_ = IDLE;
url_fetcher_.reset();
switch(finishing_state) {
case USERNAME_FETCHING_USERINFO:
delegate_->OnUserNameFetchSuccess(username_);
break;
case PASSIVE_FETCHING_USERINFO:
delegate_->OnPassiveSigninSuccess(username_);
break;
default:
NOTREACHED() << "unexpected state_=" << finishing_state;
}
}
bool WalletSigninHelper::ParseSignInResponse() {
if (!url_fetcher_) {
NOTREACHED();
return false;
}
std::string data;
if (!url_fetcher_->GetResponseAsString(&data)) {
DVLOG(1) << "failed to GetResponseAsString";
OnOtherError();
return false;
}
if (!LowerCaseEqualsASCII(data, "yes")) {
OnServiceError(
GoogleServiceAuthError(GoogleServiceAuthError::USER_NOT_SIGNED_UP));
return false;
}
return true;
}
bool WalletSigninHelper::ParseGetAccountInfoResponse(
const net::URLFetcher* fetcher, std::string* email) {
DCHECK(email);
std::string data;
if (!fetcher->GetResponseAsString(&data)) {
DVLOG(1) << "failed to GetResponseAsString";
return false;
}
scoped_ptr<base::Value> value(base::JSONReader::Read(data));
if (!value.get() || value->GetType() != base::Value::TYPE_DICTIONARY) {
DVLOG(1) << "failed to parse JSON response";
return false;
}
DictionaryValue* dict = static_cast<base::DictionaryValue*>(value.get());
base::ListValue* user_info;
if (!dict->GetListWithoutPathExpansion("user_info", &user_info)) {
DVLOG(1) << "no user_info in JSON response";
return false;
}
// |user_info| will contain each signed in user in the cookie jar.
// We only support the first user at the moment. http://crbug.com/259543
// will change that.
base::DictionaryValue* user_info_detail;
if (!user_info->GetDictionary(0, &user_info_detail)) {
DVLOG(1) << "empty list in JSON response";
return false;
}
if (!user_info_detail->GetStringWithoutPathExpansion("email", email)) {
DVLOG(1) << "no email in JSON response";
return false;
}
return !email->empty();
}
void WalletSigninHelper::ReturnWalletCookieValue(
const std::string& cookie_value) {
DCHECK(content::BrowserThread::CurrentlyOn(content::BrowserThread::UI));
delegate_->OnDidFetchWalletCookieValue(cookie_value);
}
} // namespace wallet
} // namespace autofill
| [
"ProjectRetroScope@gmail.com"
] | ProjectRetroScope@gmail.com |
ba1bda9d76ebcf1a753cb47925885ef9f9230226 | d6fcbc713b0e720be2cf96abfca5abfdda33279e | /DragonCore/src/Dragon/Networking/NetworkManager.cpp | 91972f7f44d964ac8f109f86bcda31d80cd11d54 | [] | no_license | dylanwijnen1/DragonEngine | b72ed0f4c95802319862b65999ba769e384a1115 | 9ee3d248882a6c0d309b173e2198b8bb2b4ca784 | refs/heads/master | 2020-05-30T01:32:26.071862 | 2020-03-12T05:03:49 | 2020-03-12T05:03:49 | 189,479,199 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,380 | cpp | #include "NetworkManager.h"
namespace dragon
{
bool NetworkManager::Init()
{
if (enet_initialize() < 0)
{
//ERR("Failed to initialize the network driver.")
return false;
}
return true;
}
bool NetworkManager::StartHost(const eastl::string& host, short port, size_t maxConnections, size_t channels)
{
m_role = NetworkRole::Host;
ENetAddress address;
if (host.empty())
address.host = ENET_HOST_ANY;
else
address.host = ResolveAddress(host);
address.port = port;
m_pHost = enet_host_create(&address, maxConnections, channels, 0, 0);
if (!m_pHost)
{
//ERR("Failed to create host service.");
m_pHost = nullptr;
return false;
}
return true;
}
bool NetworkManager::StartClient(size_t channels)
{
m_role = NetworkRole::Client;
m_pHost = enet_host_create(nullptr, 1, channels, 0, 0);
if (!m_pHost)
{
//ERR("Failed to create host service.");
m_pHost = nullptr;
return false;
}
return true;
}
bool NetworkManager::Connect(const eastl::string& host, short port, size_t timeout)
{
ENetAddress address;
address.host = ResolveAddress(host);
address.port = 1234;
// Initiate the connection, allocating the two channels 0 and 1.
m_pPeer = enet_host_connect(m_pHost, &address, 2, 0);
if (!m_pPeer)
{
//ERR("No available peers for initiating the connection")
return false;
}
// Wait up to [timeout] seconds for the connection attempt to succeed.
ENetEvent ev;
if (enet_host_service(m_pHost, &ev, (enet_uint32)timeout) > 0 && ev.type == ENET_EVENT_TYPE_CONNECT)
{
//puts("Connection to some.server.net:1234 succeeded.");
}
else
{
enet_peer_reset(m_pPeer);
//puts("Connection to some.server.net:1234 failed.");
return false;
}
return true;
}
void NetworkManager::ProcessEvents()
{
// TODO: Transform ENetEvent into NetworkEvent
//struct NetworkEvent
//{
// const char* data;
// unsigned int dataLen;
// //IStream dataStream;
//};
ENetEvent ev;
while (enet_host_service(m_pHost, &ev, 0) > 0)
{
m_callback(ev);
}
}
int NetworkManager::ResolveAddress(const eastl::string& host) const
{
ENetAddress address;
address.host = 0;
enet_address_set_host(&address, host.c_str());
return address.host;
}
}
| [
"DWIJNEN2@art.edu"
] | DWIJNEN2@art.edu |
714c48fb4df5769c8f9c6f51cb60a1c8d3ebd7de | 2f87d0719a1e45bee3ab921682c6abd4d1edcff6 | /11.5.1/Linux/Samples/TestPattern/Config.cpp | 3fb50087cf2465189c35c56cab233c4be307d298 | [] | no_license | LTNGlobal-opensource/bmsdk | 28fdadb9db07916473d07f51ffd0bb3ef02dd883 | 8c7406c2dcd7e7383d69a61cf4c1506835b61570 | refs/heads/master | 2022-10-11T05:04:35.742445 | 2020-06-10T16:16:04 | 2020-06-10T16:16:04 | 116,147,880 | 0 | 2 | null | 2020-06-10T00:10:25 | 2018-01-03T14:46:11 | C++ | UTF-8 | C++ | false | false | 9,316 | cpp | /* -LICENSE-START-
** Copyright (c) 2018 Blackmagic Design
**
** Permission is hereby granted, free of charge, to any person or organization
** obtaining a copy of the software and accompanying documentation covered by
** this license (the "Software") to use, reproduce, display, distribute,
** execute, and transmit the Software, and to prepare derivative works of the
** Software, and to permit third-parties to whom the Software is furnished to
** do so, all subject to the following:
**
** The copyright notices in the Software and this entire statement, including
** the above license grant, this restriction and the following disclaimer,
** must be included in all copies of the Software, in whole or in part, and
** all derivative works of the Software, unless such copies or derivative
** works are solely in the form of machine-executable object code generated by
** a source language processor.
**
** 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, TITLE AND NON-INFRINGEMENT. IN NO EVENT
** SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
** FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
** ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
** DEALINGS IN THE SOFTWARE.
** -LICENSE-END-
*/
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <pthread.h>
#include <unistd.h>
#include "Config.h"
BMDConfig::BMDConfig() :
m_deckLinkIndex(-1),
m_displayModeIndex(-1),
m_audioChannels(2),
m_audioSampleDepth(16),
m_outputFlags(bmdVideoOutputFlagDefault),
m_pixelFormat(bmdFormat8BitYUV),
m_output444(false),
m_deckLinkName(),
m_displayModeName()
{
}
BMDConfig::~BMDConfig()
{
if (m_deckLinkName)
free(m_deckLinkName);
if (m_displayModeName)
free(m_displayModeName);
}
bool BMDConfig::ParseArguments(int argc, char** argv)
{
int ch;
bool displayHelp = false;
while ((ch = getopt(argc, argv, "d:?h3c:s:f:a:m:n:p:t:")) != -1)
{
switch (ch)
{
case 'd':
m_deckLinkIndex = atoi(optarg);
break;
case 'm':
m_displayModeIndex = atoi(optarg);
break;
case 'c':
m_audioChannels = atoi(optarg);
if (m_audioChannels != 2 &&
m_audioChannels != 8 &&
m_audioChannels != 16)
{
fprintf(stderr, "Invalid argument: Audio Channels must be either 2, 8 or 16\n");
return false;
}
break;
case 's':
m_audioSampleDepth = atoi(optarg);
if (m_audioSampleDepth != 16 && m_audioSampleDepth != 32)
{
fprintf(stderr, "Invalid argument: Audio Sample Depth must be either 16 bits or 32 bits\n");
return false;
}
break;
case 'p':
switch(atoi(optarg))
{
case 0: m_pixelFormat = bmdFormat8BitYUV; m_output444 = false; break;
case 1: m_pixelFormat = bmdFormat10BitYUV; m_output444 = false; break;
case 2: m_pixelFormat = bmdFormat10BitRGB; m_output444 = true; break;
default:
fprintf(stderr, "Invalid argument: Pixel format %d is not valid", atoi(optarg));
return false;
}
break;
case '3':
m_outputFlags |= bmdVideoOutputDualStream3D;
break;
case '?':
case 'h':
displayHelp = true;
}
}
if (m_deckLinkIndex < 0)
{
fprintf(stderr, "You must select a device\n");
DisplayUsage(1);
}
if (m_displayModeIndex < 0)
{
fprintf(stderr, "You must select a display mode\n");
DisplayUsage(1);
}
if (displayHelp)
DisplayUsage(0);
// Get device and display mode names
IDeckLink *deckLink = GetDeckLink(m_deckLinkIndex);
if (deckLink != NULL)
{
IDeckLinkDisplayMode *displayMode = GetDeckLinkDisplayMode(deckLink, m_displayModeIndex);
if (displayMode != NULL)
{
displayMode->GetName((const char**)&m_displayModeName);
displayMode->Release();
}
else
{
m_displayModeName = strdup("Invalid");
}
deckLink->GetDisplayName((const char**)&m_deckLinkName);
deckLink->Release();
}
else
{
m_deckLinkName = strdup("Invalid");
}
return true;
}
IDeckLink* BMDConfig::GetDeckLink(int idx)
{
HRESULT result;
IDeckLink* deckLink;
IDeckLinkIterator* deckLinkIterator = CreateDeckLinkIteratorInstance();
int i = idx;
while((result = deckLinkIterator->Next(&deckLink)) == S_OK)
{
if (i == 0)
break;
--i;
deckLink->Release();
}
deckLinkIterator->Release();
if (result != S_OK)
return NULL;
return deckLink;
}
IDeckLinkDisplayMode* BMDConfig::GetDeckLinkDisplayMode(IDeckLink* deckLink, int idx)
{
HRESULT result;
IDeckLinkDisplayMode* displayMode = NULL;
IDeckLinkOutput* deckLinkOutput = NULL;
IDeckLinkDisplayModeIterator* displayModeIterator = NULL;
int i = idx;
result = deckLink->QueryInterface(IID_IDeckLinkOutput, (void**)&deckLinkOutput);
if (result != S_OK)
goto bail;
result = deckLinkOutput->GetDisplayModeIterator(&displayModeIterator);
if (result != S_OK)
goto bail;
while ((result = displayModeIterator->Next(&displayMode)) == S_OK)
{
if (i == 0)
break;
--i;
displayMode->Release();
}
if (result != S_OK)
goto bail;
bail:
if (displayModeIterator)
displayModeIterator->Release();
if (deckLinkOutput)
deckLinkOutput->Release();
return displayMode;
}
void BMDConfig::DisplayUsage(int status)
{
HRESULT result = E_FAIL;
IDeckLinkIterator* deckLinkIterator = CreateDeckLinkIteratorInstance();
IDeckLinkDisplayModeIterator* displayModeIterator = NULL;
IDeckLink* deckLink = NULL;
IDeckLink* deckLinkSelected = NULL;
int deckLinkCount = 0;
char* deckLinkName = NULL;
IDeckLinkOutput* deckLinkOutput = NULL;
IDeckLinkDisplayMode* displayMode;
int displayModeCount = 0;
char* displayModeName;
fprintf(stderr,
"Usage: TestPattern -d <device id> -m <mode id> [OPTIONS]\n"
"\n"
" -d <device id>:\n"
);
// Loop through all available devices
while (deckLinkIterator->Next(&deckLink) == S_OK)
{
char *deckLinkName;
result = deckLink->GetDisplayName((const char**)&deckLinkName);
if (result == S_OK)
{
fprintf(stderr,
" %2d: %s%s\n",
deckLinkCount,
deckLinkName,
deckLinkCount == m_deckLinkIndex ? " (selected)" : ""
);
free(deckLinkName);
}
if (deckLinkCount == m_deckLinkIndex)
deckLinkSelected = deckLink;
else
deckLink->Release();
++deckLinkCount;
}
if (deckLinkCount == 0)
fprintf(stderr, " No DeckLink devices found. Is the driver loaded?\n");
deckLinkName = NULL;
if (deckLinkSelected != NULL)
deckLinkSelected->GetDisplayName((const char**)&deckLinkName);
fprintf(stderr,
" -m <mode id>: (%s)\n",
deckLinkName ? deckLinkName : ""
);
if (deckLinkName != NULL)
free(deckLinkName);
// Loop through all available display modes on the delected DeckLink device
if (deckLinkSelected == NULL)
{
fprintf(stderr, " No DeckLink device selected\n");
goto bail;
}
result = deckLinkSelected->QueryInterface(IID_IDeckLinkOutput, (void**)&deckLinkOutput);
if (result != S_OK)
goto bail;
result = deckLinkOutput->GetDisplayModeIterator(&displayModeIterator);
if (result != S_OK)
goto bail;
while (displayModeIterator->Next(&displayMode) == S_OK)
{
result = displayMode->GetName((const char **)&displayModeName);
if (result == S_OK)
{
BMDTimeValue frameRateDuration;
BMDTimeValue frameRateScale;
displayMode->GetFrameRate(&frameRateDuration, &frameRateScale);
fprintf(stderr,
" %2d: %-20s \t %li x %li \t %g FPS\n",
displayModeCount,
displayModeName,
displayMode->GetWidth(),
displayMode->GetHeight(),
(double)frameRateScale / (double)frameRateDuration
);
free(displayModeName);
}
displayMode->Release();
++displayModeCount;
}
bail:
fprintf(stderr,
" -p <pixelformat>\n"
" 0: 8 bit YUV (4:2:2) (default)\n"
" 1: 10 bit YUV (4:2:2)\n"
" 2: 10 bit RGB (4:4:4)\n"
" -c <channels> Audio Channels (2, 8 or 16 - default is 2)\n"
" -s <depth> Audio Sample Depth (16 or 32 - default is 16)\n"
" -3 Playback Stereoscopic 3D (Requires 3D Hardware support)\n"
"\n"
"Output a test pattern eg:\n"
"\n"
" TestPattern -d 0 -m 2 \n"
);
if (deckLinkIterator != NULL)
deckLinkIterator->Release();
if (displayModeIterator != NULL)
displayModeIterator->Release();
if (deckLinkOutput != NULL)
deckLinkOutput->Release();
if (deckLinkSelected != NULL)
deckLinkSelected->Release();
exit(status);
}
void BMDConfig::DisplayConfiguration()
{
fprintf(stderr, "Capturing with the following configuration:\n"
" - Playback device: %s\n"
" - Video mode: %s %s\n"
" - Pixel format: %s\n"
" - Audio channels: %u\n"
" - Audio sample depth: %u bit \n",
m_deckLinkName,
m_displayModeName,
(m_outputFlags & bmdVideoOutputDualStream3D) ? "3D" : "",
GetPixelFormatName(m_pixelFormat),
m_audioChannels,
m_audioSampleDepth
);
}
const char* BMDConfig::GetPixelFormatName(BMDPixelFormat pixelFormat)
{
switch (pixelFormat)
{
case bmdFormat8BitYUV:
return "8 bit YUV (4:2:2)";
case bmdFormat10BitYUV:
return "10 bit YUV (4:2:2)";
case bmdFormat10BitRGB:
return "10 bit RGB (4:4:4)";
}
return "unknown";
}
| [
"stoth@kernellabs.com"
] | stoth@kernellabs.com |
e843b04e557c9f8c7c72fcf6d5fea1b370eeb4ef | c3583a409960b44b3c876e249953579223094420 | /A/711/main.cpp | c148558a7610b1358d7c1157ad3224d32c58a2e1 | [
"MIT"
] | permissive | ABGEO/ABGEOs_CodeForces_Projects | 3be69fdf64c0dfe19b06208ab7d6ec43e7070dbe | 62bf1dc50d435c1f8d2033577e98cf332373b1f8 | refs/heads/master | 2021-09-24T05:24:21.362648 | 2018-10-03T19:09:48 | 2018-10-03T19:09:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 550 | cpp | #include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
string p[n+5], str;
for (int i(0); i < n; i++)
{
cin >> str;
p[i] = str;
}
for (int i(0); i < n; i++)
{
if ((p[i][0] == 'O' && p[i][1] == 'O') || (p[i][3] == 'O' && p[i][4] == 'O'))
{
if (p[i][0] == 'O' && p[i][1] == 'O')
p[i][0] = p[i][1] = '+';
else if (p[i][3] == 'O' && p[i][4] == 'O')
p[i][3] = p[i][4] = '+';
cout << "YES\n";
for (int k(0); k < n; k++)
cout << p[k] << "\n";
return 0;
}
}
cout << "NO";
return 0;
}
| [
"takalandze2000@mail.ru"
] | takalandze2000@mail.ru |
695636005a183ad73d75277eba6befc082b42153 | 78da87159332b7f053c6bcf88f888ffc6c4dd624 | /10508.cpp | 102324f1922fc527846fdd32089caa6aed15452e | [] | no_license | sudiptobd/UVA-Solving | e2d7bb9b8196a469003dde056b1e596af642cc95 | 403dd3a54e1a8e9af42dcd3d121a64269f9b351a | refs/heads/master | 2021-01-11T20:02:09.401456 | 2017-01-19T12:47:13 | 2017-01-19T12:47:13 | 79,452,726 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,161 | cpp | #include<stdio.h>
#include<iostream>
#include<utility>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#include<string>
#include<algorithm>
#include<queue>
#include<map>
#include<stack>
#include<deque>
#include<vector>
#include<ctype.h>
using namespace std;
#define lli long long int
#define D double
#define gcd(a,b) __gcd(a,b)
#define EPS 1e-9
int sc()
{
int n;
scanf("%d",&n);
return n;
}
D scd()
{
D n;
scanf("%lf",&n);
return n;
}
int main()
{
//freopen("in.txt","r",stdin);
int n,m;
while(scanf("%d %d",&n,&m)==2)
{
getchar();
char ara[n+1][m+1];
gets(ara[0]);
gets(ara[n-1]);
for(int i=1;i<n-1;i++)
{
char take[m+1];
gets(take);
int count=0;
for(int j=0;j<m;j++)
if(ara[0][j]!=take[j])count++;
strcpy(ara[count],take);
//puts(ara[count]);
//printf(" %d\n",count);
}
for(int i=0;i<n;i++)
printf("%s\n",ara[i]);
}
return 0;
}
| [
"sudiptoroy900@gmail.com"
] | sudiptoroy900@gmail.com |
5def6289724aa4b0a2a8710d019c42d97cff0a99 | d99db1a044e84b92c39c6c773030e5998150ccb9 | /Example2/Example2.cpp | af9966622c1e7c32ca07d8f2019fcd3df70984c3 | [] | no_license | komura-athushi/Exercise | 0cbc8c71f1ee7e8e1321554a6e188a2ce1bde31f | aa5053fb8727fc2f2a86a4590eb0e963e0f5d89a | refs/heads/master | 2023-04-27T21:38:48.492509 | 2021-05-15T08:14:59 | 2021-05-15T08:14:59 | 357,433,434 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,893 | cpp | // Example2.cpp : このファイルには 'main' 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <iostream>
using namespace std;
int main()
{
//ここからコードを書く。
//入力された値を受け取る。
int number;
cin >> number;
//入力された数値が偶数か奇数か判断する。
//(例)2で割り切れるかどうか。
//2で割った余りを求める。
int rem = number % 2;
//偶数か奇数かを出力する。
//余りが0だったら。
if (rem == 0)
{
cout << number << "は偶数です。";
}
//余りが1だったら。
else if (rem == 1)
{
cout << number << "は奇数です。";
}
}
// プログラムの実行: Ctrl + F5 または [デバッグ] > [デバッグなしで開始] メニュー
// プログラムのデバッグ: F5 または [デバッグ] > [デバッグの開始] メニュー
// 作業を開始するためのヒント:
// 1. ソリューション エクスプローラー ウィンドウを使用してファイルを追加/管理します
// 2. チーム エクスプローラー ウィンドウを使用してソース管理に接続します
// 3. 出力ウィンドウを使用して、ビルド出力とその他のメッセージを表示します
// 4. エラー一覧ウィンドウを使用してエラーを表示します
// 5. [プロジェクト] > [新しい項目の追加] と移動して新しいコード ファイルを作成するか、[プロジェクト] > [既存の項目の追加] と移動して既存のコード ファイルをプロジェクトに追加します
// 6. 後ほどこのプロジェクトを再び開く場合、[ファイル] > [開く] > [プロジェクト] と移動して .sln ファイルを選択します
| [
"kbc18b09@stu.kawahara.ac.jp"
] | kbc18b09@stu.kawahara.ac.jp |
0ba6a75ac63da31daffe16c4c0fd2456bac90f57 | 47e07186596a6a0b78c02ba71ce01b4cd29a9d7b | /src/laplace_fmm3d/LaplaceFMM3d_main.cpp | 069177e44307a09c34fee29955fa05f697f446fd | [] | no_license | mstmkn67/laplace_bem | 2f19aec0efc91ec46b3658372ee8f8fac20cfa8b | 334148998cf303e255b59e5bce13c9e3042465f5 | refs/heads/master | 2022-12-02T04:53:43.445879 | 2020-08-11T05:42:05 | 2020-08-11T05:42:05 | 286,652,959 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 905 | cpp | //Boundary Element Method and Fast Multipole Method
// for 3 dimensional Laplace equation solver
// Masato MAKINO
#include "../common/udf/gourmain.h"
#include "LaplaceFMM3d.h"
void udfHeaderCheck()
{
string version("1.1"),engine("laplace_fmm3d");
cout << "**************************************************************" << endl;
cout << " " << engine << " " << version << " " << endl;
cout << " Masato MAKINO " << endl;
cout << "**************************************************************" << endl;
cout << endl;
}
void error_massage(){
cout << "usage: laplace_fmm3d -I input_udf [-O output_udf] " << endl;
}
int gourmain(UDFManager* in,UDFManager* out){
udfHeaderCheck();
LaplaceFMM3d* sim=new LaplaceFMM3d(in,out);
sim->run();
delete sim;
return 0;
}
| [
"mstmkn67@yahoo.co.jp"
] | mstmkn67@yahoo.co.jp |
e2147f21604649c9ac57d3c06d2a4e974d753e67 | eb48c29693a3be2df788215f36dcc0ecc08dd961 | /src/wallet/wallet.cpp | 194ada18eac455411fa14dd4815de68dbcf838c8 | [
"MIT"
] | permissive | CREDIT-2-0/TerraCredit | 787b14d7a5366d22827efd03853ac3f1f69fd234 | ebe035cd4eeab006928e931c33db7b025cdea340 | refs/heads/master | 2022-12-08T23:24:52.343819 | 2020-09-08T02:47:20 | 2020-09-08T02:47:20 | 271,811,497 | 4 | 5 | null | null | null | null | UTF-8 | C++ | false | false | 215,024 | cpp | // Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2014 The Bitcoin developers
// Copyright (c) 2014-2015 The Dash developers
// Copyright (c) 2015-2019 The PIVX developers
// Copyright (c) 2019-2020 The TERRACREDIT developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "wallet/wallet.h"
#include "zcredit/accumulators.h"
#include "base58.h"
#include "checkpoints.h"
#include "coincontrol.h"
#include "kernel.h"
#include "masternode-budget.h"
#include "net.h"
#include "primitives/transaction.h"
#include "script/script.h"
#include "script/sign.h"
#include "spork.h"
#include "stakeinput.h"
#include "swifttx.h"
#include "timedata.h"
#include "txdb.h"
#include "util.h"
#include "utilmoneystr.h"
#include "zcreditchain.h"
#include "denomination_functions.h"
#include "libzerocoin/Denominations.h"
#include "zcredit/zcreditwallet.h"
#include "zcredit/zcredittracker.h"
#include "zcredit/deterministicmint.h"
#include <assert.h>
#include <boost/algorithm/string/replace.hpp>
#include <boost/thread.hpp>
#include <boost/filesystem/operations.hpp>
#include <boost/date_time/posix_time/posix_time.hpp>
#include <zcredit/witness.h>
/**
* Settings
*/
CFeeRate payTxFee(DEFAULT_TRANSACTION_FEE);
CAmount maxTxFee = DEFAULT_TRANSACTION_MAXFEE;
unsigned int nTxConfirmTarget = 1;
bool bSpendZeroConfChange = true;
bool bdisableSystemnotifications = false; // Those bubbles can be annoying and slow down the UI when you get lots of trx
bool fSendFreeTransactions = false;
bool fPayAtLeastCustomFee = true;
bool fGlobalUnlockSpendCache = false;
int64_t nStartupTime = GetTime(); //!< Client startup time for use with automint
/**
* Fees smaller than this (in ucredit) are considered zero fee (for transaction creation)
* We are ~100 times smaller then bitcoin now (2015-06-23), set minTxFee 10 times higher
* so it's still 10 times lower comparing to bitcoin.
* Override with -mintxfee
*/
CFeeRate CWallet::minTxFee = CFeeRate(10000);
const uint256 CMerkleTx::ABANDON_HASH(uint256S("0000000000000000000000000000000000000000000000000000000000000001"));
/** @defgroup mapWallet
*
* @{
*/
struct CompareValueOnly {
bool operator()(const std::pair<CAmount, std::pair<const CWalletTx*, unsigned int> >& t1,
const std::pair<CAmount, std::pair<const CWalletTx*, unsigned int> >& t2) const
{
return t1.first < t2.first;
}
};
std::string COutput::ToString() const
{
return strprintf("COutput(%s, %d, %d) [%s]", tx->GetHash().ToString(), i, nDepth, FormatMoney(tx->vout[i].nValue));
}
const CWalletTx* CWallet::GetWalletTx(const uint256& hash) const
{
LOCK(cs_wallet);
std::map<uint256, CWalletTx>::const_iterator it = mapWallet.find(hash);
if (it == mapWallet.end())
return NULL;
return &(it->second);
}
std::vector<CWalletTx> CWallet::getWalletTxs()
{
LOCK(cs_wallet);
std::vector<CWalletTx> result;
result.reserve(mapWallet.size());
for (const auto& entry : mapWallet) {
result.emplace_back(entry.second);
}
return result;
}
PairResult CWallet::getNewAddress(CBitcoinAddress& ret, std::string label){
return getNewAddress(ret, label, AddressBook::AddressBookPurpose::RECEIVE);
}
PairResult CWallet::getNewStakingAddress(CBitcoinAddress& ret, std::string label){
return getNewAddress(ret, label, AddressBook::AddressBookPurpose::COLD_STAKING, CChainParams::Base58Type::STAKING_ADDRESS);
}
PairResult CWallet::getNewAddress(CBitcoinAddress& ret, const std::string addressLabel, const std::string purpose,
const CChainParams::Base58Type addrType)
{
LOCK2(cs_main, cs_wallet);
// Refill keypool if wallet is unlocked
if (!IsLocked())
TopUpKeyPool();
CPubKey newKey;
// Get a key
if (!GetKeyFromPool(newKey)) {
// inform the user to top-up the keypool or unlock the wallet
return PairResult(false, new std::string(
"Keypool ran out, please call keypoolrefill first, or unlock the wallet."));
}
CKeyID keyID = newKey.GetID();
if (!SetAddressBook(keyID, addressLabel, purpose))
throw std::runtime_error("CWallet::getNewAddress() : SetAddressBook failed");
ret = CBitcoinAddress(keyID, addrType);
return PairResult(true);
}
CPubKey CWallet::GenerateNewKey()
{
AssertLockHeld(cs_wallet); // mapKeyMetadata
bool fCompressed = CanSupportFeature(FEATURE_COMPRPUBKEY); // default to compressed public keys if we want 0.6.0 wallets
CKey secret;
secret.MakeNewKey(fCompressed);
// Compressed public keys were introduced in version 0.6.0
if (fCompressed)
SetMinVersion(FEATURE_COMPRPUBKEY);
CPubKey pubkey = secret.GetPubKey();
assert(secret.VerifyPubKey(pubkey));
// Create new metadata
int64_t nCreationTime = GetTime();
mapKeyMetadata[pubkey.GetID()] = CKeyMetadata(nCreationTime);
if (!nTimeFirstKey || nCreationTime < nTimeFirstKey)
nTimeFirstKey = nCreationTime;
if (!AddKeyPubKey(secret, pubkey))
throw std::runtime_error("CWallet::GenerateNewKey() : AddKey failed");
return pubkey;
}
int64_t CWallet::GetKeyCreationTime(CPubKey pubkey)
{
return mapKeyMetadata[pubkey.GetID()].nCreateTime;
}
int64_t CWallet::GetKeyCreationTime(const CBitcoinAddress& address)
{
CKeyID keyID;
if (address.GetKeyID(keyID)) {
CPubKey keyRet;
if (GetPubKey(keyID, keyRet)) {
return GetKeyCreationTime(keyRet);
}
}
return 0;
}
CBitcoinAddress CWallet::GenerateNewAutoMintKey()
{
CBitcoinAddress btcAddress;
CKeyID keyID = GenerateNewKey().GetID();
btcAddress.Set(keyID);
CWalletDB(strWalletFile).WriteAutoConvertKey(btcAddress);
SetAddressBook(keyID, "automint-address", "receive");
setAutoConvertAddresses.emplace(btcAddress);
return btcAddress;
}
bool CWallet::AddKeyPubKey(const CKey& secret, const CPubKey& pubkey)
{
AssertLockHeld(cs_wallet); // mapKeyMetadata
if (!CCryptoKeyStore::AddKeyPubKey(secret, pubkey))
return false;
// check if we need to remove from watch-only
CScript script;
script = GetScriptForDestination(pubkey.GetID());
if (HaveWatchOnly(script))
RemoveWatchOnly(script);
if (!fFileBacked)
return true;
if (!IsCrypted()) {
return CWalletDB(strWalletFile).WriteKey(pubkey, secret.GetPrivKey(), mapKeyMetadata[pubkey.GetID()]);
}
return true;
}
bool CWallet::AddCryptedKey(const CPubKey& vchPubKey,
const std::vector<unsigned char>& vchCryptedSecret)
{
if (!CCryptoKeyStore::AddCryptedKey(vchPubKey, vchCryptedSecret))
return false;
if (!fFileBacked)
return true;
{
LOCK(cs_wallet);
if (pwalletdbEncryption)
return pwalletdbEncryption->WriteCryptedKey(vchPubKey,
vchCryptedSecret,
mapKeyMetadata[vchPubKey.GetID()]);
else
return CWalletDB(strWalletFile).WriteCryptedKey(vchPubKey, vchCryptedSecret, mapKeyMetadata[vchPubKey.GetID()]);
}
return false;
}
bool CWallet::LoadKeyMetadata(const CPubKey& pubkey, const CKeyMetadata& meta)
{
AssertLockHeld(cs_wallet); // mapKeyMetadata
if (meta.nCreateTime && (!nTimeFirstKey || meta.nCreateTime < nTimeFirstKey))
nTimeFirstKey = meta.nCreateTime;
mapKeyMetadata[pubkey.GetID()] = meta;
return true;
}
bool CWallet::LoadCryptedKey(const CPubKey& vchPubKey, const std::vector<unsigned char>& vchCryptedSecret)
{
return CCryptoKeyStore::AddCryptedKey(vchPubKey, vchCryptedSecret);
}
bool CWallet::AddCScript(const CScript& redeemScript)
{
if (!CCryptoKeyStore::AddCScript(redeemScript))
return false;
if (!fFileBacked)
return true;
return CWalletDB(strWalletFile).WriteCScript(Hash160(redeemScript), redeemScript);
}
bool CWallet::LoadCScript(const CScript& redeemScript)
{
/* A sanity check was added in pull #3843 to avoid adding redeemScripts
* that never can be redeemed. However, old wallets may still contain
* these. Do not add them to the wallet and warn. */
if (redeemScript.size() > MAX_SCRIPT_ELEMENT_SIZE) {
std::string strAddr = CBitcoinAddress(CScriptID(redeemScript)).ToString();
LogPrintf("%s: Warning: This wallet contains a redeemScript of size %i which exceeds maximum size %i thus can never be redeemed. Do not use address %s.\n",
__func__, redeemScript.size(), MAX_SCRIPT_ELEMENT_SIZE, strAddr);
return true;
}
return CCryptoKeyStore::AddCScript(redeemScript);
}
bool CWallet::AddWatchOnly(const CScript& dest)
{
if (!CCryptoKeyStore::AddWatchOnly(dest))
return false;
nTimeFirstKey = 1; // No birthday information for watch-only keys.
NotifyWatchonlyChanged(true);
if (!fFileBacked)
return true;
return CWalletDB(strWalletFile).WriteWatchOnly(dest);
}
bool CWallet::RemoveWatchOnly(const CScript& dest)
{
AssertLockHeld(cs_wallet);
if (!CCryptoKeyStore::RemoveWatchOnly(dest))
return false;
if (!HaveWatchOnly())
NotifyWatchonlyChanged(false);
if (fFileBacked)
if (!CWalletDB(strWalletFile).EraseWatchOnly(dest))
return false;
return true;
}
bool CWallet::LoadWatchOnly(const CScript& dest)
{
return CCryptoKeyStore::AddWatchOnly(dest);
}
bool CWallet::AddMultiSig(const CScript& dest)
{
if (!CCryptoKeyStore::AddMultiSig(dest))
return false;
nTimeFirstKey = 1; // No birthday information
NotifyMultiSigChanged(true);
if (!fFileBacked)
return true;
return CWalletDB(strWalletFile).WriteMultiSig(dest);
}
bool CWallet::RemoveMultiSig(const CScript& dest)
{
AssertLockHeld(cs_wallet);
if (!CCryptoKeyStore::RemoveMultiSig(dest))
return false;
if (!HaveMultiSig())
NotifyMultiSigChanged(false);
if (fFileBacked)
if (!CWalletDB(strWalletFile).EraseMultiSig(dest))
return false;
return true;
}
bool CWallet::LoadMultiSig(const CScript& dest)
{
return CCryptoKeyStore::AddMultiSig(dest);
}
bool CWallet::Unlock(const SecureString& strWalletPassphrase, bool anonymizeOnly)
{
CCrypter crypter;
CKeyingMaterial vMasterKey;
{
LOCK(cs_wallet);
for (const MasterKeyMap::value_type& pMasterKey : mapMasterKeys) {
if (!crypter.SetKeyFromPassphrase(strWalletPassphrase, pMasterKey.second.vchSalt, pMasterKey.second.nDeriveIterations, pMasterKey.second.nDerivationMethod))
return false;
if (!crypter.Decrypt(pMasterKey.second.vchCryptedKey, vMasterKey))
continue; // try another master key
if (CCryptoKeyStore::Unlock(vMasterKey)) {
fWalletUnlockAnonymizeOnly = anonymizeOnly;
return true;
}
}
}
return false;
}
bool CWallet::ChangeWalletPassphrase(const SecureString& strOldWalletPassphrase, const SecureString& strNewWalletPassphrase)
{
bool fWasLocked = IsLocked();
SecureString strOldWalletPassphraseFinal = strOldWalletPassphrase;
{
LOCK(cs_wallet);
Lock();
CCrypter crypter;
CKeyingMaterial vMasterKey;
for (MasterKeyMap::value_type& pMasterKey : mapMasterKeys) {
if (!crypter.SetKeyFromPassphrase(strOldWalletPassphraseFinal, pMasterKey.second.vchSalt, pMasterKey.second.nDeriveIterations, pMasterKey.second.nDerivationMethod))
return false;
if (!crypter.Decrypt(pMasterKey.second.vchCryptedKey, vMasterKey))
return false;
if (CCryptoKeyStore::Unlock(vMasterKey)) {
int64_t nStartTime = GetTimeMillis();
crypter.SetKeyFromPassphrase(strNewWalletPassphrase, pMasterKey.second.vchSalt, pMasterKey.second.nDeriveIterations, pMasterKey.second.nDerivationMethod);
pMasterKey.second.nDeriveIterations = pMasterKey.second.nDeriveIterations * (100 / ((double)(GetTimeMillis() - nStartTime)));
nStartTime = GetTimeMillis();
crypter.SetKeyFromPassphrase(strNewWalletPassphrase, pMasterKey.second.vchSalt, pMasterKey.second.nDeriveIterations, pMasterKey.second.nDerivationMethod);
pMasterKey.second.nDeriveIterations = (pMasterKey.second.nDeriveIterations + pMasterKey.second.nDeriveIterations * 100 / ((double)(GetTimeMillis() - nStartTime))) / 2;
if (pMasterKey.second.nDeriveIterations < 25000)
pMasterKey.second.nDeriveIterations = 25000;
LogPrintf("Wallet passphrase changed to an nDeriveIterations of %i\n", pMasterKey.second.nDeriveIterations);
if (!crypter.SetKeyFromPassphrase(strNewWalletPassphrase, pMasterKey.second.vchSalt, pMasterKey.second.nDeriveIterations, pMasterKey.second.nDerivationMethod))
return false;
if (!crypter.Encrypt(vMasterKey, pMasterKey.second.vchCryptedKey))
return false;
CWalletDB(strWalletFile).WriteMasterKey(pMasterKey.first, pMasterKey.second);
if (fWasLocked)
Lock();
return true;
}
}
}
return false;
}
void CWallet::SetBestChain(const CBlockLocator& loc)
{
CWalletDB walletdb(strWalletFile);
walletdb.WriteBestBlock(loc);
}
bool CWallet::SetMinVersion(enum WalletFeature nVersion, CWalletDB* pwalletdbIn, bool fExplicit)
{
LOCK(cs_wallet); // nWalletVersion
if (nWalletVersion >= nVersion)
return true;
// when doing an explicit upgrade, if we pass the max version permitted, upgrade all the way
if (fExplicit && nVersion > nWalletMaxVersion)
nVersion = FEATURE_LATEST;
nWalletVersion = nVersion;
if (nVersion > nWalletMaxVersion)
nWalletMaxVersion = nVersion;
if (fFileBacked) {
CWalletDB* pwalletdb = pwalletdbIn ? pwalletdbIn : new CWalletDB(strWalletFile);
if (nWalletVersion > 40000)
pwalletdb->WriteMinVersion(nWalletVersion);
if (!pwalletdbIn)
delete pwalletdb;
}
return true;
}
bool CWallet::SetMaxVersion(int nVersion)
{
LOCK(cs_wallet); // nWalletVersion, nWalletMaxVersion
// cannot downgrade below current version
if (nWalletVersion > nVersion)
return false;
nWalletMaxVersion = nVersion;
return true;
}
std::set<uint256> CWallet::GetConflicts(const uint256& txid) const
{
std::set<uint256> result;
AssertLockHeld(cs_wallet);
std::map<uint256, CWalletTx>::const_iterator it = mapWallet.find(txid);
if (it == mapWallet.end())
return result;
const CWalletTx& wtx = it->second;
std::pair<TxSpends::const_iterator, TxSpends::const_iterator> range;
for (const CTxIn& txin : wtx.vin) {
if (mapTxSpends.count(txin.prevout) <= 1 || wtx.HasZerocoinSpendInputs())
continue; // No conflict if zero or one spends
range = mapTxSpends.equal_range(txin.prevout);
for (TxSpends::const_iterator it = range.first; it != range.second; ++it)
result.insert(it->second);
}
return result;
}
void CWallet::SyncMetaData(std::pair<TxSpends::iterator, TxSpends::iterator> range)
{
// We want all the wallet transactions in range to have the same metadata as
// the oldest (smallest nOrderPos).
// So: find smallest nOrderPos:
int nMinOrderPos = std::numeric_limits<int>::max();
const CWalletTx* copyFrom = nullptr;
for (TxSpends::iterator it = range.first; it != range.second; ++it) {
const CWalletTx* wtx = &mapWallet.at(it->second);
int n = wtx->nOrderPos;
if (n < nMinOrderPos) {
nMinOrderPos = n;
copyFrom = wtx;
}
}
if (!copyFrom) {
return;
}
// Now copy data from copyFrom to rest:
for (TxSpends::iterator it = range.first; it != range.second; ++it) {
const uint256& hash = it->second;
CWalletTx* copyTo = &mapWallet[hash];
if (copyFrom == copyTo) continue;
assert(copyFrom && "Oldest wallet transaction in range assumed to have been found.");
if (!copyFrom->IsEquivalentTo(*copyTo)) continue;
copyTo->mapValue = copyFrom->mapValue;
copyTo->vOrderForm = copyFrom->vOrderForm;
// fTimeReceivedIsTxTime not copied on purpose
// nTimeReceived not copied on purpose
copyTo->nTimeSmart = copyFrom->nTimeSmart;
copyTo->fFromMe = copyFrom->fFromMe;
copyTo->strFromAccount = copyFrom->strFromAccount;
// nOrderPos not copied on purpose
// cached members not copied on purpose
}
}
/**
* Outpoint is spent if any non-conflicted transaction
* spends it:
*/
bool CWallet::IsSpent(const uint256& hash, unsigned int n) const
{
const COutPoint outpoint(hash, n);
std::pair<TxSpends::const_iterator, TxSpends::const_iterator> range;
range = mapTxSpends.equal_range(outpoint);
for (TxSpends::const_iterator it = range.first; it != range.second; ++it) {
const uint256& wtxid = it->second;
std::map<uint256, CWalletTx>::const_iterator mit = mapWallet.find(wtxid);
if (mit != mapWallet.end()) {
bool fConflicted;
const int nDepth = mit->second.GetDepthAndMempool(fConflicted);
// not in mempool txes can spend coins only if not coinstakes
const bool fConflictedCoinstake = fConflicted && mit->second.IsCoinStake();
if (nDepth > 0 || (nDepth == 0 && !mit->second.isAbandoned() && !fConflictedCoinstake) )
return true; // Spent
}
}
return false;
}
void CWallet::AddToSpends(const COutPoint& outpoint, const uint256& wtxid)
{
mapTxSpends.insert(std::make_pair(outpoint, wtxid));
setLockedCoins.erase(outpoint);
std::pair<TxSpends::iterator, TxSpends::iterator> range;
range = mapTxSpends.equal_range(outpoint);
SyncMetaData(range);
}
void CWallet::AddToSpends(const uint256& wtxid)
{
assert(mapWallet.count(wtxid));
CWalletTx& thisTx = mapWallet[wtxid];
if (thisTx.IsCoinBase()) // Coinbases don't spend anything!
return;
for (const CTxIn& txin : thisTx.vin)
AddToSpends(txin.prevout, wtxid);
}
bool CWallet::GetMasternodeVinAndKeys(CTxIn& txinRet, CPubKey& pubKeyRet, CKey& keyRet, std::string strTxHash, std::string strOutputIndex)
{
// wait for reindex and/or import to finish
if (fImporting || fReindex) return false;
// Find possible candidates (remove delegated)
std::vector<COutput> vPossibleCoins;
AvailableCoins(vPossibleCoins, true, NULL, false, ONLY_10000, false, 1, false, false);
if (vPossibleCoins.empty()) {
LogPrintf("CWallet::GetMasternodeVinAndKeys -- Could not locate any valid masternode vin\n");
return false;
}
if (strTxHash.empty()) // No output specified, select the first one
return GetVinAndKeysFromOutput(vPossibleCoins[0], txinRet, pubKeyRet, keyRet);
// Find specific vin
uint256 txHash = uint256S(strTxHash);
int nOutputIndex;
try {
nOutputIndex = std::stoi(strOutputIndex.c_str());
} catch (const std::exception& e) {
LogPrintf("%s: %s on strOutputIndex\n", __func__, e.what());
return false;
}
for (COutput& out : vPossibleCoins)
if (out.tx->GetHash() == txHash && out.i == nOutputIndex) // found it!
return GetVinAndKeysFromOutput(out, txinRet, pubKeyRet, keyRet);
LogPrintf("CWallet::GetMasternodeVinAndKeys -- Could not locate specified masternode vin\n");
return false;
}
bool CWallet::GetVinAndKeysFromOutput(COutput out, CTxIn& txinRet, CPubKey& pubKeyRet, CKey& keyRet, bool fColdStake)
{
// wait for reindex and/or import to finish
if (fImporting || fReindex) return false;
CScript pubScript;
txinRet = CTxIn(out.tx->GetHash(), out.i);
pubScript = out.tx->vout[out.i].scriptPubKey; // the inputs PubKey
CTxDestination address1;
ExtractDestination(pubScript, address1, fColdStake);
CBitcoinAddress address2(address1);
CKeyID keyID;
if (!address2.GetKeyID(keyID)) {
LogPrintf("CWallet::GetVinAndKeysFromOutput -- Address does not refer to a key\n");
return false;
}
if (!GetKey(keyID, keyRet)) {
LogPrintf("CWallet::GetVinAndKeysFromOutput -- Private key for address is not known\n");
return false;
}
pubKeyRet = keyRet.GetPubKey();
return true;
}
bool CWallet::EncryptWallet(const SecureString& strWalletPassphrase)
{
if (IsCrypted())
return false;
CKeyingMaterial vMasterKey;
vMasterKey.resize(WALLET_CRYPTO_KEY_SIZE);
GetStrongRandBytes(&vMasterKey[0], WALLET_CRYPTO_KEY_SIZE);
CMasterKey kMasterKey;
kMasterKey.vchSalt.resize(WALLET_CRYPTO_SALT_SIZE);
GetStrongRandBytes(&kMasterKey.vchSalt[0], WALLET_CRYPTO_SALT_SIZE);
CCrypter crypter;
int64_t nStartTime = GetTimeMillis();
crypter.SetKeyFromPassphrase(strWalletPassphrase, kMasterKey.vchSalt, 25000, kMasterKey.nDerivationMethod);
kMasterKey.nDeriveIterations = 2500000 / ((double)(GetTimeMillis() - nStartTime));
nStartTime = GetTimeMillis();
crypter.SetKeyFromPassphrase(strWalletPassphrase, kMasterKey.vchSalt, kMasterKey.nDeriveIterations, kMasterKey.nDerivationMethod);
kMasterKey.nDeriveIterations = (kMasterKey.nDeriveIterations + kMasterKey.nDeriveIterations * 100 / ((double)(GetTimeMillis() - nStartTime))) / 2;
if (kMasterKey.nDeriveIterations < 25000)
kMasterKey.nDeriveIterations = 25000;
LogPrintf("Encrypting Wallet with an nDeriveIterations of %i\n", kMasterKey.nDeriveIterations);
if (!crypter.SetKeyFromPassphrase(strWalletPassphrase, kMasterKey.vchSalt, kMasterKey.nDeriveIterations, kMasterKey.nDerivationMethod))
return false;
if (!crypter.Encrypt(vMasterKey, kMasterKey.vchCryptedKey))
return false;
{
LOCK(cs_wallet);
mapMasterKeys[++nMasterKeyMaxID] = kMasterKey;
if (fFileBacked) {
assert(!pwalletdbEncryption);
pwalletdbEncryption = new CWalletDB(strWalletFile);
if (!pwalletdbEncryption->TxnBegin()) {
delete pwalletdbEncryption;
pwalletdbEncryption = NULL;
return false;
}
pwalletdbEncryption->WriteMasterKey(nMasterKeyMaxID, kMasterKey);
}
if (!EncryptKeys(vMasterKey)) {
if (fFileBacked) {
pwalletdbEncryption->TxnAbort();
delete pwalletdbEncryption;
}
// We now probably have half of our keys encrypted in memory, and half not...
// die and let the user reload their unencrypted wallet.
assert(false);
}
// Encryption was introduced in version 0.4.0
SetMinVersion(FEATURE_WALLETCRYPT, pwalletdbEncryption, true);
if (fFileBacked) {
if (!pwalletdbEncryption->TxnCommit()) {
delete pwalletdbEncryption;
// We now have keys encrypted in memory, but not on disk...
// die to avoid confusion and let the user reload their unencrypted wallet.
assert(false);
}
delete pwalletdbEncryption;
pwalletdbEncryption = NULL;
}
Lock();
Unlock(strWalletPassphrase);
NewKeyPool();
Lock();
// Need to completely rewrite the wallet file; if we don't, bdb might keep
// bits of the unencrypted private key in slack space in the database file.
CDB::Rewrite(strWalletFile);
}
NotifyStatusChanged(this);
return true;
}
int64_t CWallet::IncOrderPosNext(CWalletDB* pwalletdb)
{
AssertLockHeld(cs_wallet); // nOrderPosNext
int64_t nRet = nOrderPosNext++;
if (pwalletdb) {
pwalletdb->WriteOrderPosNext(nOrderPosNext);
} else {
CWalletDB(strWalletFile).WriteOrderPosNext(nOrderPosNext);
}
return nRet;
}
void CWallet::MarkDirty()
{
{
LOCK(cs_wallet);
for (PAIRTYPE(const uint256, CWalletTx) & item : mapWallet)
item.second.MarkDirty();
}
}
bool CWallet::AddToWallet(const CWalletTx& wtxIn, bool fFromLoadWallet, CWalletDB* pwalletdb)
{
uint256 hash = wtxIn.GetHash();
if (fFromLoadWallet) {
mapWallet[hash] = wtxIn;
CWalletTx& wtx = mapWallet[hash];
wtx.BindWallet(this);
wtxOrdered.insert(std::make_pair(wtx.nOrderPos, TxPair(&wtx, (CAccountingEntry*)0)));
AddToSpends(hash);
} else {
LOCK(cs_wallet);
// Inserts only if not already there, returns tx inserted or tx found
std::pair<std::map<uint256, CWalletTx>::iterator, bool> ret = mapWallet.insert(std::make_pair(hash, wtxIn));
CWalletTx& wtx = (*ret.first).second;
wtx.BindWallet(this);
bool fInsertedNew = ret.second;
if (fInsertedNew) {
if (!wtx.nTimeReceived)
wtx.nTimeReceived = GetAdjustedTime();
wtx.nOrderPos = IncOrderPosNext(pwalletdb);
wtxOrdered.insert(std::make_pair(wtx.nOrderPos, TxPair(&wtx, (CAccountingEntry*)0)));
wtx.nTimeSmart = ComputeTimeSmart(wtx);
AddToSpends(hash);
for (const CTxIn& txin : wtx.vin) {
if (mapWallet.count(txin.prevout.hash)) {
CWalletTx& prevtx = mapWallet[txin.prevout.hash];
if (prevtx.nIndex == -1 && !prevtx.hashUnset()) {
MarkConflicted(prevtx.hashBlock, wtx.GetHash());
}
}
}
}
bool fUpdated = false;
if (!fInsertedNew) {
// Merge
if (!wtxIn.hashUnset() && wtxIn.hashBlock != wtx.hashBlock) {
wtx.hashBlock = wtxIn.hashBlock;
fUpdated = true;
}
// If no longer abandoned, update
if (wtxIn.hashBlock.IsNull() && wtx.isAbandoned()) {
wtx.hashBlock = wtxIn.hashBlock;
fUpdated = true;
}
if (wtxIn.nIndex != -1 && wtxIn.nIndex != wtx.nIndex) {
wtx.nIndex = wtxIn.nIndex;
fUpdated = true;
}
if (wtxIn.fFromMe && wtxIn.fFromMe != wtx.fFromMe) {
wtx.fFromMe = wtxIn.fFromMe;
fUpdated = true;
}
}
//// debug print
LogPrintf("AddToWallet %s %s%s\n", wtxIn.GetHash().ToString(), (fInsertedNew ? "new" : ""), (fUpdated ? "update" : ""));
// Write to disk
if (fInsertedNew || fUpdated)
if (!wtx.WriteToDisk(pwalletdb))
return false;
// Break debit/credit balance caches:
wtx.MarkDirty();
// Notify UI of new or updated transaction
NotifyTransactionChanged(this, hash, fInsertedNew ? CT_NEW : CT_UPDATED);
// notify an external script when a wallet transaction comes in or is updated
std::string strCmd = GetArg("-walletnotify", "");
if (!strCmd.empty()) {
boost::replace_all(strCmd, "%s", wtxIn.GetHash().GetHex());
boost::thread t(runCommand, strCmd); // thread runs free
}
}
return true;
}
/**
* Add a transaction to the wallet, or update it.
* pblock is optional, but should be provided if the transaction is known to be in a block.
* If fUpdate is true, existing transactions will be updated.
*/
bool CWallet::AddToWalletIfInvolvingMe(const CTransaction& tx, const CBlock* pblock, bool fUpdate)
{
{
AssertLockHeld(cs_wallet);
if (pblock && !tx.HasZerocoinSpendInputs() && !tx.IsCoinBase()) {
for (const CTxIn& txin : tx.vin) {
std::pair<TxSpends::const_iterator, TxSpends::const_iterator> range = mapTxSpends.equal_range(txin.prevout);
while (range.first != range.second) {
if (range.first->second != tx.GetHash()) {
LogPrintf("Transaction %s (in block %s) conflicts with wallet transaction %s (both spend %s:%i)\n", tx.GetHash().ToString(), pblock->GetHash().ToString(), range.first->second.ToString(), range.first->first.hash.ToString(), range.first->first.n);
MarkConflicted(pblock->GetHash(), range.first->second);
}
range.first++;
}
}
}
bool fExisted = mapWallet.count(tx.GetHash()) != 0;
if (fExisted && !fUpdate) return false;
if (fExisted || IsMine(tx) || IsFromMe(tx)) {
CWalletTx wtx(this, tx);
// Get merkle branch if transaction was found in a block
if (pblock)
wtx.SetMerkleBranch(*pblock);
// Do not flush the wallet here for performance reasons
// this is safe, as in case of a crash, we rescan the necessary blocks on startup through our SetBestChain-mechanism
CWalletDB walletdb(strWalletFile, "r+", false);
return AddToWallet(wtx, false, &walletdb);
}
}
return false;
}
bool CWallet::AbandonTransaction(const uint256& hashTx)
{
LOCK2(cs_main, cs_wallet);
CWalletDB walletdb(strWalletFile, "r+");
std::set<uint256> todo;
std::set<uint256> done;
// Can't mark abandoned if confirmed or in mempool
assert(mapWallet.count(hashTx));
CWalletTx& origtx = mapWallet[hashTx];
if (origtx.GetDepthInMainChain() > 0 || origtx.InMempool()) {
return false;
}
todo.insert(hashTx);
while (!todo.empty()) {
uint256 now = *todo.begin();
todo.erase(now);
done.insert(now);
assert(mapWallet.count(now));
CWalletTx& wtx = mapWallet[now];
int currentconfirm = wtx.GetDepthInMainChain();
// If the orig tx was not in block, none of its spends can be
assert(currentconfirm <= 0);
// if (currentconfirm < 0) {Tx and spends are already conflicted, no need to abandon}
if (currentconfirm == 0 && !wtx.isAbandoned()) {
// If the orig tx was not in block/mempool, none of its spends can be in mempool
assert(!wtx.InMempool());
wtx.nIndex = -1;
wtx.setAbandoned();
wtx.MarkDirty();
wtx.WriteToDisk(&walletdb);
NotifyTransactionChanged(this, wtx.GetHash(), CT_UPDATED);
// Iterate over all its outputs, and mark transactions in the wallet that spend them abandoned too
TxSpends::const_iterator iter = mapTxSpends.lower_bound(COutPoint(now, 0));
while (iter != mapTxSpends.end() && iter->first.hash == now) {
if (!done.count(iter->second)) {
todo.insert(iter->second);
}
iter++;
}
// If a transaction changes 'conflicted' state, that changes the balance
// available of the outputs it spends. So force those to be recomputed
for (const CTxIn& txin: wtx.vin)
{
if (mapWallet.count(txin.prevout.hash))
mapWallet[txin.prevout.hash].MarkDirty();
}
}
}
return true;
}
void CWallet::MarkConflicted(const uint256& hashBlock, const uint256& hashTx)
{
LOCK2(cs_main, cs_wallet);
CBlockIndex* pindex;
assert(mapBlockIndex.count(hashBlock));
pindex = mapBlockIndex[hashBlock];
int conflictconfirms = 0;
if (chainActive.Contains(pindex)) {
conflictconfirms = -(chainActive.Height() - pindex->nHeight + 1);
}
assert(conflictconfirms < 0);
// Do not flush the wallet here for performance reasons
CWalletDB walletdb(strWalletFile, "r+", false);
std::set<uint256> todo;
std::set<uint256> done;
todo.insert(hashTx);
while (!todo.empty()) {
uint256 now = *todo.begin();
todo.erase(now);
done.insert(now);
assert(mapWallet.count(now));
CWalletTx& wtx = mapWallet[now];
int currentconfirm = wtx.GetDepthInMainChain();
if (conflictconfirms < currentconfirm) {
// Block is 'more conflicted' than current confirm; update.
// Mark transaction as conflicted with this block.
wtx.nIndex = -1;
wtx.hashBlock = hashBlock;
wtx.MarkDirty();
wtx.WriteToDisk(&walletdb);
// Iterate over all its outputs, and mark transactions in the wallet that spend them conflicted too
TxSpends::const_iterator iter = mapTxSpends.lower_bound(COutPoint(now, 0));
while (iter != mapTxSpends.end() && iter->first.hash == now) {
if (!done.count(iter->second)) {
todo.insert(iter->second);
}
iter++;
}
// If a transaction changes 'conflicted' state, that changes the balance
// available of the outputs it spends. So force those to be recomputed
for (const CTxIn& txin: wtx.vin)
{
if (mapWallet.count(txin.prevout.hash))
mapWallet[txin.prevout.hash].MarkDirty();
}
}
}
}
void CWallet::SyncTransaction(const CTransaction& tx, const CBlock* pblock)
{
LOCK2(cs_main, cs_wallet);
if (!AddToWalletIfInvolvingMe(tx, pblock, true))
return; // Not one of ours
// If a transaction changes 'conflicted' state, that changes the balance
// available of the outputs it spends. So force those to be
// recomputed, also:
for (const CTxIn& txin : tx.vin) {
if (!txin.IsZerocoinSpend() && mapWallet.count(txin.prevout.hash))
mapWallet[txin.prevout.hash].MarkDirty();
}
}
void CWallet::EraseFromWallet(const uint256& hash)
{
if (!fFileBacked)
return;
{
LOCK(cs_wallet);
if (mapWallet.erase(hash))
CWalletDB(strWalletFile).EraseTx(hash);
LogPrintf("%s: Erased wtx %s from wallet\n", __func__, hash.GetHex());
}
return;
}
isminetype CWallet::IsMine(const CTxIn& txin) const
{
{
LOCK(cs_wallet);
std::map<uint256, CWalletTx>::const_iterator mi = mapWallet.find(txin.prevout.hash);
if (mi != mapWallet.end()) {
const CWalletTx& prev = (*mi).second;
if (txin.prevout.n < prev.vout.size())
return IsMine(prev.vout[txin.prevout.n]);
}
}
return ISMINE_NO;
}
bool CWallet::IsUsed(const CBitcoinAddress address) const
{
LOCK(cs_wallet);
CScript scriptPubKey = GetScriptForDestination(address.Get());
if (!::IsMine(*this, scriptPubKey)) {
return false;
}
for (const auto& it : mapWallet) {
const CWalletTx& wtx = it.second;
if (wtx.IsCoinBase()) {
continue;
}
for (const CTxOut& txout : wtx.vout) {
if (txout.scriptPubKey == scriptPubKey)
return true;
}
}
return false;
}
bool CWallet::IsMyZerocoinSpend(const CBigNum& bnSerial) const
{
return zcreditTracker->HasSerial(bnSerial);
}
CAmount CWallet::GetDebit(const CTxIn& txin, const isminefilter& filter) const
{
{
LOCK(cs_wallet);
std::map<uint256, CWalletTx>::const_iterator mi = mapWallet.find(txin.prevout.hash);
if (mi != mapWallet.end()) {
const CWalletTx& prev = (*mi).second;
if (txin.prevout.n < prev.vout.size())
if (IsMine(prev.vout[txin.prevout.n]) & filter)
return prev.vout[txin.prevout.n].nValue;
}
}
return 0;
}
bool CWallet::IsDenominated(const CTxIn& txin) const
{
{
LOCK(cs_wallet);
std::map<uint256, CWalletTx>::const_iterator mi = mapWallet.find(txin.prevout.hash);
if (mi != mapWallet.end()) {
const CWalletTx& prev = (*mi).second;
if (txin.prevout.n < prev.vout.size()) return IsDenominatedAmount(prev.vout[txin.prevout.n].nValue);
}
}
return false;
}
bool CWallet::IsDenominatedAmount(CAmount nInputAmount) const
{
for (CAmount d : obfuScationDenominations)
if (nInputAmount == d)
return true;
return false;
}
bool CWallet::IsChange(const CTxOut& txout) const
{
// TODO: fix handling of 'change' outputs. The assumption is that any
// payment to a script that is ours, but is not in the address book
// is change. That assumption is likely to break when we implement multisignature
// wallets that return change back into a multi-signature-protected address;
// a better way of identifying which outputs are 'the send' and which are
// 'the change' will need to be implemented (maybe extend CWalletTx to remember
// which output, if any, was change).
if (::IsMine(*this, txout.scriptPubKey)) {
CTxDestination address;
if (!ExtractDestination(txout.scriptPubKey, address))
return true;
LOCK(cs_wallet);
if (!mapAddressBook.count(address))
return true;
}
return false;
}
int64_t CWalletTx::GetTxTime() const
{
int64_t n = nTimeSmart;
return n ? n : nTimeReceived;
}
int64_t CWalletTx::GetComputedTxTime() const
{
LOCK(cs_main);
if (ContainsZerocoins()) {
if (IsInMainChain())
return mapBlockIndex.at(hashBlock)->GetBlockTime();
else
return nTimeReceived;
}
return GetTxTime();
}
int CWalletTx::GetRequestCount() const
{
// Returns -1 if it wasn't being tracked
int nRequests = -1;
{
LOCK(pwallet->cs_wallet);
if (IsCoinBase()) {
// Generated block
if (!hashUnset()) {
std::map<uint256, int>::const_iterator mi = pwallet->mapRequestCount.find(hashBlock);
if (mi != pwallet->mapRequestCount.end())
nRequests = (*mi).second;
}
} else {
// Did anyone request this transaction?
std::map<uint256, int>::const_iterator mi = pwallet->mapRequestCount.find(GetHash());
if (mi != pwallet->mapRequestCount.end()) {
nRequests = (*mi).second;
// How about the block it's in?
if (nRequests == 0 && !hashUnset()) {
std::map<uint256, int>::const_iterator mi = pwallet->mapRequestCount.find(hashBlock);
if (mi != pwallet->mapRequestCount.end())
nRequests = (*mi).second;
else
nRequests = 1; // If it's in someone else's block it must have got out
}
}
}
}
return nRequests;
}
//! filter decides which addresses will count towards the debit
CAmount CWalletTx::GetDebit(const isminefilter& filter) const
{
if (vin.empty())
return 0;
CAmount debit = 0;
if (filter & ISMINE_SPENDABLE) {
if (fDebitCached)
debit += nDebitCached;
else {
nDebitCached = pwallet->GetDebit(*this, ISMINE_SPENDABLE);
fDebitCached = true;
debit += nDebitCached;
}
}
if (filter & ISMINE_WATCH_ONLY) {
if (fWatchDebitCached)
debit += nWatchDebitCached;
else {
nWatchDebitCached = pwallet->GetDebit(*this, ISMINE_WATCH_ONLY);
fWatchDebitCached = true;
debit += nWatchDebitCached;
}
}
if (filter & ISMINE_COLD) {
if (fColdDebitCached)
debit += nColdDebitCached;
else {
nColdDebitCached = pwallet->GetDebit(*this, ISMINE_COLD);
fColdDebitCached = true;
debit += nColdDebitCached;
}
}
if (filter & ISMINE_SPENDABLE_DELEGATED) {
if (fDelegatedDebitCached)
debit += nDelegatedDebitCached;
else {
nDelegatedDebitCached = pwallet->GetDebit(*this, ISMINE_SPENDABLE_DELEGATED);
fDelegatedDebitCached = true;
debit += nDelegatedDebitCached;
}
}
return debit;
}
CAmount CWalletTx::GetColdStakingDebit(bool fUseCache) const
{
return UpdateAmount(nColdDebitCached, fColdDebitCached, fUseCache, ISMINE_COLD, false);
}
CAmount CWalletTx::GetStakeDelegationDebit(bool fUseCache) const
{
return UpdateAmount(nDelegatedDebitCached, fDelegatedDebitCached, fUseCache, ISMINE_SPENDABLE_DELEGATED, false);
}
CAmount CWalletTx::GetUnspentCredit(const isminefilter& filter) const
{
// Must wait until coinbase is safely deep enough in the chain before valuing it
if (GetBlocksToMaturity() > 0)
return 0;
CAmount credit = 0;
if (filter & ISMINE_SPENDABLE) {
credit += pwallet->GetCredit(*this, ISMINE_SPENDABLE, true);
}
if (filter & ISMINE_WATCH_ONLY) {
credit += pwallet->GetCredit(*this, ISMINE_WATCH_ONLY, true);
}
if (filter & ISMINE_COLD) {
credit += pwallet->GetCredit(*this, ISMINE_COLD, true);
}
if (filter & ISMINE_SPENDABLE_DELEGATED) {
credit += pwallet->GetCredit(*this, ISMINE_SPENDABLE_DELEGATED, true);
}
return credit;
}
CAmount CWalletTx::GetCredit(const isminefilter& filter) const
{
CAmount credit = 0;
if (filter & ISMINE_SPENDABLE) {
// GetBalance can assume transactions in mapWallet won't change
if (fCreditCached)
credit += nCreditCached;
else {
nCreditCached = pwallet->GetCredit(*this, ISMINE_SPENDABLE, false);
fCreditCached = true;
credit += nCreditCached;
}
}
if (filter & ISMINE_WATCH_ONLY) {
if (fWatchCreditCached)
credit += nWatchCreditCached;
else {
nWatchCreditCached = pwallet->GetCredit(*this, ISMINE_WATCH_ONLY, false);
fWatchCreditCached = true;
credit += nWatchCreditCached;
}
}
if (filter & ISMINE_COLD) {
if (fColdCreditCached)
credit += nColdCreditCached;
else {
nColdCreditCached = pwallet->GetCredit(*this, ISMINE_COLD, false);
fColdCreditCached = true;
credit += nColdCreditCached;
}
}
if (filter & ISMINE_SPENDABLE_DELEGATED) {
if (fDelegatedCreditCached)
credit += nDelegatedCreditCached;
else {
nDelegatedCreditCached = pwallet->GetCredit(*this, ISMINE_SPENDABLE_DELEGATED, false);
fDelegatedCreditCached = true;
credit += nDelegatedCreditCached;
}
}
return credit;
}
CAmount CWalletTx::GetImmatureCredit(bool fUseCache, const isminefilter& filter) const
{
LOCK(cs_main);
if ((IsCoinBase() || IsCoinStake()) && GetBlocksToMaturity() > 0 && IsInMainChain()) {
if (fUseCache && fImmatureCreditCached && filter == ISMINE_SPENDABLE_ALL)
return nImmatureCreditCached;
nImmatureCreditCached = pwallet->GetCredit(*this, filter);
fImmatureCreditCached = true;
return nImmatureCreditCached;
}
return 0;
}
CAmount CWalletTx::GetAvailableCredit(bool fUseCache) const
{
return GetUnspentCredit(ISMINE_SPENDABLE_ALL);
}
CAmount CWalletTx::GetColdStakingCredit(bool fUseCache) const
{
return GetUnspentCredit(ISMINE_COLD);
}
CAmount CWalletTx::GetStakeDelegationCredit(bool fUseCache) const
{
return GetUnspentCredit(ISMINE_SPENDABLE_DELEGATED);
}
CAmount CWalletTx::UpdateAmount(CAmount& amountToUpdate, bool& cacheFlagToUpdate, bool fUseCache, isminetype mimeType, bool fCredit) const
{
if (pwallet == 0)
return 0;
// Must wait until coinbase is safely deep enough in the chain before valuing it
if (IsCoinBase() && GetBlocksToMaturity() > 0)
return 0;
if (fUseCache && cacheFlagToUpdate)
return amountToUpdate;
amountToUpdate = (fCredit) ? GetCredit(mimeType) : GetDebit(mimeType);
cacheFlagToUpdate = true;
return amountToUpdate;
}
// Return sum of unlocked coins
CAmount CWalletTx::GetUnlockedCredit() const
{
if (pwallet == 0)
return 0;
// Must wait until coinbase is safely deep enough in the chain before valuing it
if (IsCoinBase() && GetBlocksToMaturity() > 0)
return 0;
CAmount nCredit = 0;
uint256 hashTx = GetHash();
for (unsigned int i = 0; i < vout.size(); i++) {
const CTxOut& txout = vout[i];
if (pwallet->IsSpent(hashTx, i) || pwallet->IsLockedCoin(hashTx, i)) continue;
if (fMasterNode && vout[i].nValue == Params().MasternodeCollateral()) continue; // do not count MN-like outputs
nCredit += pwallet->GetCredit(txout, ISMINE_SPENDABLE);
if (!MoneyRange(nCredit))
throw std::runtime_error("CWalletTx::GetUnlockedCredit() : value out of range");
}
return nCredit;
}
// Return sum of locked coins
CAmount CWalletTx::GetLockedCredit() const
{
if (pwallet == 0)
return 0;
// Must wait until coinbase is safely deep enough in the chain before valuing it
if (IsCoinBase() && GetBlocksToMaturity() > 0)
return 0;
CAmount nCredit = 0;
uint256 hashTx = GetHash();
for (unsigned int i = 0; i < vout.size(); i++) {
const CTxOut& txout = vout[i];
// Skip spent coins
if (pwallet->IsSpent(hashTx, i)) continue;
// Add delegated coins
nCredit += pwallet->GetCredit(txout, ISMINE_SPENDABLE_DELEGATED);
// Add locked coins
if (pwallet->IsLockedCoin(hashTx, i)) {
nCredit += pwallet->GetCredit(txout, ISMINE_SPENDABLE);
}
// Add masternode collaterals which are handled likc locked coins
else if (fMasterNode && vout[i].nValue == Params().MasternodeCollateral()) {
nCredit += pwallet->GetCredit(txout, ISMINE_SPENDABLE);
}
if (!MoneyRange(nCredit))
throw std::runtime_error("CWalletTx::GetLockedCredit() : value out of range");
}
return nCredit;
}
CAmount CWalletTx::GetImmatureWatchOnlyCredit(const bool& fUseCache) const
{
LOCK(cs_main);
if (IsCoinBase() && GetBlocksToMaturity() > 0 && IsInMainChain()) {
if (fUseCache && fImmatureWatchCreditCached)
return nImmatureWatchCreditCached;
nImmatureWatchCreditCached = pwallet->GetCredit(*this, ISMINE_WATCH_ONLY);
fImmatureWatchCreditCached = true;
return nImmatureWatchCreditCached;
}
return 0;
}
CAmount CWalletTx::GetAvailableWatchOnlyCredit(const bool& fUseCache) const
{
if (pwallet == 0)
return 0;
// Must wait until coinbase is safely deep enough in the chain before valuing it
if (IsCoinBase() && GetBlocksToMaturity() > 0)
return 0;
if (fUseCache && fAvailableWatchCreditCached)
return nAvailableWatchCreditCached;
CAmount nCredit = 0;
for (unsigned int i = 0; i < vout.size(); i++) {
if (!pwallet->IsSpent(GetHash(), i)) {
const CTxOut& txout = vout[i];
nCredit += pwallet->GetCredit(txout, ISMINE_WATCH_ONLY);
if (!MoneyRange(nCredit))
throw std::runtime_error("CWalletTx::GetAvailableCredit() : value out of range");
}
}
nAvailableWatchCreditCached = nCredit;
fAvailableWatchCreditCached = true;
return nCredit;
}
CAmount CWalletTx::GetLockedWatchOnlyCredit() const
{
if (pwallet == 0)
return 0;
// Must wait until coinbase is safely deep enough in the chain before valuing it
if (IsCoinBase() && GetBlocksToMaturity() > 0)
return 0;
CAmount nCredit = 0;
uint256 hashTx = GetHash();
for (unsigned int i = 0; i < vout.size(); i++) {
const CTxOut& txout = vout[i];
// Skip spent coins
if (pwallet->IsSpent(hashTx, i)) continue;
// Add locked coins
if (pwallet->IsLockedCoin(hashTx, i)) {
nCredit += pwallet->GetCredit(txout, ISMINE_WATCH_ONLY);
}
// Add masternode collaterals which are handled likc locked coins
else if (fMasterNode && vout[i].nValue == Params().MasternodeCollateral()) {
nCredit += pwallet->GetCredit(txout, ISMINE_WATCH_ONLY);
}
if (!MoneyRange(nCredit))
throw std::runtime_error("CWalletTx::GetLockedCredit() : value out of range");
}
return nCredit;
}
void CWalletTx::GetAmounts(std::list<COutputEntry>& listReceived,
std::list<COutputEntry>& listSent,
CAmount& nFee,
std::string& strSentAccount,
const isminefilter& filter) const
{
nFee = 0;
listReceived.clear();
listSent.clear();
strSentAccount = strFromAccount;
// Compute fee:
CAmount nDebit = GetDebit(filter);
if (nDebit > 0) // debit>0 means we signed/sent this transaction
{
CAmount nValueOut = GetValueOut();
nFee = nDebit - nValueOut;
}
// Sent/received.
bool hasZerocoinSpends = HasZerocoinSpendInputs();
for (unsigned int i = 0; i < vout.size(); ++i) {
const CTxOut& txout = vout[i];
isminetype fIsMine = pwallet->IsMine(txout);
// Only need to handle txouts if AT LEAST one of these is true:
// 1) they debit from us (sent)
// 2) the output is to us (received)
if (nDebit > 0) {
// Don't report 'change' txouts
if (pwallet->IsChange(txout))
continue;
} else if (!(fIsMine & filter) && !hasZerocoinSpends)
continue;
// In either case, we need to get the destination address
const bool fColdStake = (filter & ISMINE_COLD);
CTxDestination address;
if (txout.IsZerocoinMint()) {
address = CNoDestination();
} else if (!ExtractDestination(txout.scriptPubKey, address, fColdStake)) {
if (!IsCoinStake() && !IsCoinBase()) {
LogPrintf("CWalletTx::GetAmounts: Unknown transaction type found, txid %s\n", this->GetHash().ToString());
}
address = CNoDestination();
}
COutputEntry output = {address, txout.nValue, (int)i};
// If we are debited by the transaction, add the output as a "sent" entry
if (nDebit > 0)
listSent.push_back(output);
// If we are receiving the output, add it as a "received" entry
if (fIsMine & filter)
listReceived.push_back(output);
}
}
void CWalletTx::GetAccountAmounts(const std::string& strAccount, CAmount& nReceived, CAmount& nSent, CAmount& nFee, const isminefilter& filter) const
{
nReceived = nSent = nFee = 0;
CAmount allFee;
std::string strSentAccount;
std::list<COutputEntry> listReceived;
std::list<COutputEntry> listSent;
GetAmounts(listReceived, listSent, allFee, strSentAccount, filter);
if (strAccount == strSentAccount) {
for (const COutputEntry& s : listSent)
nSent += s.amount;
nFee = allFee;
}
{
LOCK(pwallet->cs_wallet);
for (const COutputEntry& r : listReceived) {
if (pwallet->mapAddressBook.count(r.destination)) {
std::map<CTxDestination, AddressBook::CAddressBookData>::const_iterator mi = pwallet->mapAddressBook.find(r.destination);
if (mi != pwallet->mapAddressBook.end() && (*mi).second.name == strAccount)
nReceived += r.amount;
} else if (strAccount.empty()) {
nReceived += r.amount;
}
}
}
}
bool CWalletTx::WriteToDisk(CWalletDB *pwalletdb)
{
if (pwalletdb)
return pwalletdb->WriteTx(GetHash(), *this);
return CWalletDB(pwallet->strWalletFile).WriteTx(GetHash(), *this);
}
/**
* Scan the block chain (starting in pindexStart) for transactions
* from or to us. If fUpdate is true, found transactions that already
* exist in the wallet will be updated.
* @returns -1 if process was cancelled or the number of tx added to the wallet.
*/
int CWallet::ScanForWalletTransactions(CBlockIndex* pindexStart, bool fUpdate, bool fromStartup)
{
int ret = 0;
int64_t nNow = GetTime();
bool fCheckZCREDIT = GetBoolArg("-zapwallettxes", false);
if (fCheckZCREDIT)
zcreditTracker->Init();
CBlockIndex* pindex = pindexStart;
{
LOCK2(cs_main, cs_wallet);
// no need to read and scan block, if block was created before
// our wallet birthday (as adjusted for block time variability)
while (pindex && nTimeFirstKey && (pindex->GetBlockTime() < (nTimeFirstKey - 7200)) && pindex->nHeight <= Params().Zerocoin_StartHeight())
pindex = chainActive.Next(pindex);
ShowProgress(_("Rescanning..."), 0); // show rescan progress in GUI as dialog or on splashscreen, if -rescan on startup
double dProgressStart = Checkpoints::GuessVerificationProgress(pindex, false);
double dProgressTip = Checkpoints::GuessVerificationProgress(chainActive.Tip(), false);
std::set<uint256> setAddedToWallet;
while (pindex) {
if (pindex->nHeight % 100 == 0 && dProgressTip - dProgressStart > 0.0)
ShowProgress(_("Rescanning..."), std::max(1, std::min(99, (int)((Checkpoints::GuessVerificationProgress(pindex, false) - dProgressStart) / (dProgressTip - dProgressStart) * 100))));
if (fromStartup && ShutdownRequested()) {
return -1;
}
CBlock block;
ReadBlockFromDisk(block, pindex);
for (CTransaction& tx : block.vtx) {
if (AddToWalletIfInvolvingMe(tx, &block, fUpdate))
ret++;
}
//If this is a zapwallettx, need to readd zcredit
if (fCheckZCREDIT && pindex->nHeight >= Params().Zerocoin_StartHeight()) {
std::list<CZerocoinMint> listMints;
BlockToZerocoinMintList(block, listMints, true);
CWalletDB walletdb(strWalletFile);
for (auto& m : listMints) {
if (IsMyMint(m.GetValue())) {
LogPrint("zero", "%s: found mint\n", __func__);
pwalletMain->UpdateMint(m.GetValue(), pindex->nHeight, m.GetTxHash(), m.GetDenomination());
// Add the transaction to the wallet
for (auto& tx : block.vtx) {
uint256 txid = tx.GetHash();
if (setAddedToWallet.count(txid) || mapWallet.count(txid))
continue;
if (txid == m.GetTxHash()) {
CWalletTx wtx(pwalletMain, tx);
wtx.nTimeReceived = block.GetBlockTime();
wtx.SetMerkleBranch(block);
pwalletMain->AddToWallet(wtx, false, &walletdb);
setAddedToWallet.insert(txid);
}
}
//Check if the mint was ever spent
int nHeightSpend = 0;
uint256 txidSpend;
CTransaction txSpend;
if (IsSerialInBlockchain(GetSerialHash(m.GetSerialNumber()), nHeightSpend, txidSpend, txSpend)) {
if (setAddedToWallet.count(txidSpend) || mapWallet.count(txidSpend))
continue;
CWalletTx wtx(pwalletMain, txSpend);
CBlockIndex* pindexSpend = chainActive[nHeightSpend];
CBlock blockSpend;
if (ReadBlockFromDisk(blockSpend, pindexSpend))
wtx.SetMerkleBranch(blockSpend);
wtx.nTimeReceived = pindexSpend->nTime;
pwalletMain->AddToWallet(wtx, false, &walletdb);
setAddedToWallet.emplace(txidSpend);
}
}
}
}
pindex = chainActive.Next(pindex);
if (GetTime() >= nNow + 60) {
nNow = GetTime();
LogPrintf("Still rescanning. At block %d. Progress=%f\n", pindex->nHeight, Checkpoints::GuessVerificationProgress(pindex));
}
}
ShowProgress(_("Rescanning..."), 100); // hide progress dialog in GUI
}
return ret;
}
void CWallet::ReacceptWalletTransactions(bool fFirstLoad)
{
LOCK2(cs_main, cs_wallet);
std::map<int64_t, CWalletTx*> mapSorted;
// Sort pending wallet transactions based on their initial wallet insertion order
for (PAIRTYPE(const uint256, CWalletTx)& item: mapWallet) {
const uint256& wtxid = item.first;
CWalletTx& wtx = item.second;
assert(wtx.GetHash() == wtxid);
int nDepth = wtx.GetDepthInMainChain();
if (!wtx.IsCoinBase() && !wtx.IsCoinStake() && nDepth == 0 && !wtx.isAbandoned()) {
mapSorted.insert(std::make_pair(wtx.nOrderPos, &wtx));
}
}
// Try to add wallet transactions to memory pool
for (PAIRTYPE(const int64_t, CWalletTx*)& item: mapSorted)
{
CWalletTx& wtx = *(item.second);
LOCK(mempool.cs);
bool fSuccess = wtx.AcceptToMemoryPool(false);
if (!fSuccess && fFirstLoad && GetTime() - wtx.GetTxTime() > 12*60*60) {
//First load of wallet, failed to accept to mempool, and older than 12 hours... not likely to ever
//make it in to mempool
AbandonTransaction(wtx.GetHash());
}
}
}
bool CWalletTx::InMempool() const
{
LOCK(mempool.cs);
if (mempool.exists(GetHash())) {
return true;
}
return false;
}
void CWalletTx::RelayWalletTransaction(std::string strCommand)
{
LOCK(cs_main);
if (!IsCoinBase() && !IsCoinStake()) {
if (GetDepthInMainChain() == 0 && !isAbandoned()) {
uint256 hash = GetHash();
LogPrintf("Relaying wtx %s\n", hash.ToString());
if (strCommand == "ix") {
mapTxLockReq.insert(std::make_pair(hash, (CTransaction) * this));
CreateNewLock(((CTransaction) * this));
RelayTransactionLockReq((CTransaction) * this, true);
} else {
RelayTransaction((CTransaction) * this);
}
}
}
}
std::set<uint256> CWalletTx::GetConflicts() const
{
std::set<uint256> result;
if (pwallet != NULL) {
uint256 myHash = GetHash();
result = pwallet->GetConflicts(myHash);
result.erase(myHash);
}
return result;
}
void CWallet::ResendWalletTransactions()
{
// Do this infrequently and randomly to avoid giving away
// that these are our transactions.
if (GetTime() < nNextResend)
return;
bool fFirst = (nNextResend == 0);
nNextResend = GetTime() + GetRand(30 * 60);
if (fFirst)
return;
// Only do it if there's been a new block since last time
if (nTimeBestReceived < nLastResend)
return;
nLastResend = GetTime();
// Rebroadcast any of our txes that aren't in a block yet
LogPrintf("ResendWalletTransactions()\n");
{
LOCK(cs_wallet);
// Sort them in chronological order
std::multimap<unsigned int, CWalletTx*> mapSorted;
for (PAIRTYPE(const uint256, CWalletTx) & item : mapWallet) {
CWalletTx& wtx = item.second;
// Don't rebroadcast until it's had plenty of time that
// it should have gotten in already by now.
if (nTimeBestReceived - (int64_t)wtx.nTimeReceived > 5 * 60)
mapSorted.insert(std::make_pair(wtx.nTimeReceived, &wtx));
}
for (PAIRTYPE(const unsigned int, CWalletTx*) & item : mapSorted) {
CWalletTx& wtx = *item.second;
wtx.RelayWalletTransaction();
}
}
}
/** @} */ // end of mapWallet
/** @defgroup Actions
*
* @{
*/
CAmount CWallet::loopTxsBalance(std::function<void(const uint256&, const CWalletTx&, CAmount&)>method) const
{
CAmount nTotal = 0;
{
LOCK2(cs_main, cs_wallet);
for (const auto& it : mapWallet) {
method(it.first, it.second, nTotal);
}
}
return nTotal;
}
CAmount CWallet::GetBalance() const
{
return loopTxsBalance([](const uint256& id, const CWalletTx& pcoin, CAmount& nTotal){
if (pcoin.IsTrusted())
nTotal += pcoin.GetAvailableCredit();
});
}
CAmount CWallet::GetColdStakingBalance() const
{
return loopTxsBalance([](const uint256& id, const CWalletTx& pcoin, CAmount& nTotal) {
if (pcoin.HasP2CSOutputs() && pcoin.IsTrusted())
nTotal += pcoin.GetColdStakingCredit();
});
}
CAmount CWallet::GetStakingBalance(const bool fIncludeColdStaking) const
{
return GetBalance() + (fIncludeColdStaking ? GetColdStakingBalance() : 0);
}
CAmount CWallet::GetDelegatedBalance() const
{
return loopTxsBalance([](const uint256& id, const CWalletTx& pcoin, CAmount& nTotal) {
if (pcoin.HasP2CSOutputs() && pcoin.IsTrusted())
nTotal += pcoin.GetStakeDelegationCredit();
});
}
//std::map<libzerocoin::CoinDenomination, int> mapMintMaturity;
//int nLastMaturityCheck = 0;
CAmount CWallet::GetZerocoinBalance(bool fMatureOnly) const
{
if (fMatureOnly) {
// This code is not removed just for when we back to use zCREDIT in the future, for now it's useless,
// every public coin spend is now spendable without need to have new mints on top.
//if (chainActive.Height() > nLastMaturityCheck)
// mapMintMaturity = GetMintMaturityHeight();
//nLastMaturityCheck = chainActive.Height();
CAmount nBalance = 0;
std::vector<CMintMeta> vMints = zcreditTracker->GetMints(true);
for (auto meta : vMints) {
// Every public coin spend is now spendable, no need to mint new coins on top.
//if (meta.nHeight >= mapMintMaturity.at(meta.denom) || meta.nHeight >= chainActive.Height() || meta.nHeight == 0)
// continue;
nBalance += libzerocoin::ZerocoinDenominationToAmount(meta.denom);
}
return nBalance;
}
return zcreditTracker->GetBalance(false, false);
}
CAmount CWallet::GetImmatureZerocoinBalance() const
{
return GetZerocoinBalance(false) - GetZerocoinBalance(true) - GetUnconfirmedZerocoinBalance();
}
CAmount CWallet::GetUnconfirmedZerocoinBalance() const
{
return zcreditTracker->GetUnconfirmedBalance();
}
CAmount CWallet::GetUnlockedCoins() const
{
if (fLiteMode) return 0;
return loopTxsBalance([](const uint256& id, const CWalletTx& pcoin, CAmount& nTotal) {
if (pcoin.IsTrusted() && pcoin.GetDepthInMainChain() > 0)
nTotal += pcoin.GetUnlockedCredit();
});
}
CAmount CWallet::GetLockedCoins() const
{
if (fLiteMode) return 0;
return loopTxsBalance([](const uint256& id, const CWalletTx& pcoin, CAmount& nTotal) {
if (pcoin.IsTrusted() && pcoin.GetDepthInMainChain() > 0)
nTotal += pcoin.GetLockedCredit();
});
}
// Get a Map pairing the Denominations with the amount of Zerocoin for each Denomination
std::map<libzerocoin::CoinDenomination, CAmount> CWallet::GetMyZerocoinDistribution() const
{
std::map<libzerocoin::CoinDenomination, CAmount> spread;
for (const auto& denom : libzerocoin::zerocoinDenomList)
spread.insert(std::pair<libzerocoin::CoinDenomination, CAmount>(denom, 0));
{
LOCK(cs_wallet);
std::set<CMintMeta> setMints = zcreditTracker->ListMints(true, true, true);
for (auto& mint : setMints)
spread.at(mint.denom)++;
}
return spread;
}
CAmount CWallet::GetUnconfirmedBalance() const
{
return loopTxsBalance([](const uint256& id, const CWalletTx& pcoin, CAmount& nTotal) {
if (!pcoin.IsTrusted() && pcoin.GetDepthInMainChain() == 0 && pcoin.InMempool())
nTotal += pcoin.GetAvailableCredit();
});
}
CAmount CWallet::GetImmatureBalance() const
{
return loopTxsBalance([](const uint256& id, const CWalletTx& pcoin, CAmount& nTotal) {
nTotal += pcoin.GetImmatureCredit(false);
});
}
CAmount CWallet::GetImmatureColdStakingBalance() const
{
return loopTxsBalance([](const uint256& id, const CWalletTx& pcoin, CAmount& nTotal) {
nTotal += pcoin.GetImmatureCredit(false, ISMINE_COLD);
});
}
CAmount CWallet::GetImmatureDelegatedBalance() const
{
return loopTxsBalance([](const uint256& id, const CWalletTx& pcoin, CAmount& nTotal) {
nTotal += pcoin.GetImmatureCredit(false, ISMINE_SPENDABLE_DELEGATED);
});
}
CAmount CWallet::GetWatchOnlyBalance() const
{
return loopTxsBalance([](const uint256& id, const CWalletTx& pcoin, CAmount& nTotal) {
if (pcoin.IsTrusted())
nTotal += pcoin.GetAvailableWatchOnlyCredit();
});
}
CAmount CWallet::GetUnconfirmedWatchOnlyBalance() const
{
return loopTxsBalance([](const uint256& id, const CWalletTx& pcoin, CAmount& nTotal) {
if (!pcoin.IsTrusted() && pcoin.GetDepthInMainChain() == 0 && pcoin.InMempool())
nTotal += pcoin.GetAvailableWatchOnlyCredit();
});
}
CAmount CWallet::GetImmatureWatchOnlyBalance() const
{
return loopTxsBalance([](const uint256& id, const CWalletTx& pcoin, CAmount& nTotal) {
nTotal += pcoin.GetImmatureWatchOnlyCredit();
});
}
CAmount CWallet::GetLockedWatchOnlyBalance() const
{
return loopTxsBalance([](const uint256& id, const CWalletTx& pcoin, CAmount& nTotal) {
if (pcoin.IsTrusted() && pcoin.GetDepthInMainChain() > 0)
nTotal += pcoin.GetLockedWatchOnlyCredit();
});
}
void CWallet::GetAvailableP2CSCoins(std::vector<COutput>& vCoins) const {
vCoins.clear();
{
LOCK2(cs_main, cs_wallet);
for (const auto& it : mapWallet) {
const uint256& wtxid = it.first;
const CWalletTx* pcoin = &it.second;
bool fConflicted;
int nDepth = pcoin->GetDepthAndMempool(fConflicted);
if (fConflicted || nDepth < 0)
continue;
if (pcoin->HasP2CSOutputs()) {
for (int i = 0; i < (int) pcoin->vout.size(); i++) {
const auto &utxo = pcoin->vout[i];
if (IsSpent(wtxid, i))
continue;
if (utxo.scriptPubKey.IsPayToColdStaking()) {
isminetype mine = IsMine(utxo);
bool isMineSpendable = mine & ISMINE_SPENDABLE_DELEGATED;
if (mine & ISMINE_COLD || isMineSpendable)
// Depth is not used, no need waste resources and set it for now.
vCoins.emplace_back(COutput(pcoin, i, 0, isMineSpendable));
}
}
}
}
}
}
/**
* populate vCoins with vector of available COutputs.
*/
void CWallet::AvailableCoins(
std::vector<COutput>& vCoins,
bool fOnlyConfirmed,
const CCoinControl* coinControl,
bool fIncludeZeroValue,
AvailableCoinsType nCoinType,
bool fUseIX,
int nWatchonlyConfig,
bool fIncludeColdStaking,
bool fIncludeDelegated) const
{
vCoins.clear();
const bool fCoinsSelected = (coinControl != nullptr) && coinControl->HasSelected();
// include delegated coins when coinControl is active
if (!fIncludeDelegated && fCoinsSelected)
fIncludeDelegated = true;
{
LOCK2(cs_main, cs_wallet);
for (std::map<uint256, CWalletTx>::const_iterator it = mapWallet.begin(); it != mapWallet.end(); ++it) {
const uint256& wtxid = it->first;
const CWalletTx* pcoin = &(*it).second;
if (!CheckFinalTx(*pcoin))
continue;
if (fOnlyConfirmed && !pcoin->IsTrusted())
continue;
if ((pcoin->IsCoinBase() || pcoin->IsCoinStake()) && pcoin->GetBlocksToMaturity() > 0)
continue;
int nDepth = pcoin->GetDepthInMainChain(false);
// do not use IX for inputs that have less then 6 blockchain confirmations
if (fUseIX && nDepth < 6)
continue;
// We should not consider coins which aren't at least in our mempool
// It's possible for these to be conflicted via ancestors which we may never be able to detect
if (nDepth == 0 && !pcoin->InMempool())
continue;
for (unsigned int i = 0; i < pcoin->vout.size(); i++) {
bool found = false;
if (nCoinType == ONLY_DENOMINATED) {
found = IsDenominatedAmount(pcoin->vout[i].nValue);
} else if (nCoinType == ONLY_NOT10000IFMN) {
found = !(fMasterNode && pcoin->vout[i].nValue == Params().MasternodeCollateral());
} else if (nCoinType == ONLY_NONDENOMINATED_NOT10000IFMN) {
if (IsCollateralAmount(pcoin->vout[i].nValue)) continue; // do not use collateral amounts
found = !IsDenominatedAmount(pcoin->vout[i].nValue);
if (found && fMasterNode) found = pcoin->vout[i].nValue != Params().MasternodeCollateral(); // do not use Hot MN funds
} else if (nCoinType == ONLY_10000) {
found = pcoin->vout[i].nValue == Params().MasternodeCollateral();
} else {
found = true;
}
if (!found) continue;
if (nCoinType == STAKABLE_COINS) {
if (pcoin->vout[i].IsZerocoinMint())
continue;
}
isminetype mine = IsMine(pcoin->vout[i]);
if (IsSpent(wtxid, i))
continue;
if (mine == ISMINE_NO)
continue;
if ((mine == ISMINE_MULTISIG || mine == ISMINE_SPENDABLE) && nWatchonlyConfig == 2)
continue;
if (mine == ISMINE_WATCH_ONLY && nWatchonlyConfig == 1)
continue;
if (IsLockedCoin((*it).first, i) && nCoinType != ONLY_10000)
continue;
if (pcoin->vout[i].nValue <= 0 && !fIncludeZeroValue)
continue;
if (fCoinsSelected && !coinControl->fAllowOtherInputs && !coinControl->IsSelected((*it).first, i))
continue;
// --Skip P2CS outputs
// skip cold coins
if (mine == ISMINE_COLD && (!fIncludeColdStaking || !HasDelegator(pcoin->vout[i]))) continue;
// skip delegated coins
if (mine == ISMINE_SPENDABLE_DELEGATED && !fIncludeDelegated) continue;
// skip auto-delegated coins
if (mine == ISMINE_SPENDABLE_STAKEABLE && !fIncludeColdStaking && !fIncludeDelegated) continue;
bool fIsValid = (
((mine & ISMINE_SPENDABLE) != ISMINE_NO) ||
((mine & (ISMINE_MULTISIG | (fIncludeColdStaking ? ISMINE_COLD : ISMINE_NO) |
(fIncludeDelegated ? ISMINE_SPENDABLE_DELEGATED : ISMINE_NO) )) != ISMINE_NO));
vCoins.emplace_back(COutput(pcoin, i, nDepth, fIsValid));
}
}
}
}
std::map<CBitcoinAddress, std::vector<COutput> > CWallet::AvailableCoinsByAddress(bool fConfirmed, CAmount maxCoinValue)
{
std::vector<COutput> vCoins;
// include cold and delegated coins
AvailableCoins(vCoins, fConfirmed, nullptr, false, ALL_COINS, false, 1, true, true);
std::map<CBitcoinAddress, std::vector<COutput> > mapCoins;
for (COutput out : vCoins) {
if (maxCoinValue > 0 && out.tx->vout[out.i].nValue > maxCoinValue)
continue;
CTxDestination address;
bool fColdStakeAddr = false;
if (!ExtractDestination(out.tx->vout[out.i].scriptPubKey, address, fColdStakeAddr)) {
// if this is a P2CS we don't have the owner key - check if we have the staking key
fColdStakeAddr = true;
if ( !out.tx->vout[out.i].scriptPubKey.IsPayToColdStaking() ||
!ExtractDestination(out.tx->vout[out.i].scriptPubKey, address, fColdStakeAddr) )
continue;
}
mapCoins[CBitcoinAddress(address, fColdStakeAddr ? CChainParams::STAKING_ADDRESS : CChainParams::PUBKEY_ADDRESS)].push_back(out);
}
return mapCoins;
}
static void ApproximateBestSubset(std::vector<std::pair<CAmount, std::pair<const CWalletTx*, unsigned int> > > vValue, const CAmount& nTotalLower, const CAmount& nTargetValue, std::vector<char>& vfBest, CAmount& nBest, int iterations = 1000)
{
std::vector<char> vfIncluded;
vfBest.assign(vValue.size(), true);
nBest = nTotalLower;
FastRandomContext insecure_rand;
for (int nRep = 0; nRep < iterations && nBest != nTargetValue; nRep++) {
vfIncluded.assign(vValue.size(), false);
CAmount nTotal = 0;
bool fReachedTarget = false;
for (int nPass = 0; nPass < 2 && !fReachedTarget; nPass++) {
for (unsigned int i = 0; i < vValue.size(); i++) {
//The solver here uses a randomized algorithm,
//the randomness serves no real security purpose but is just
//needed to prevent degenerate behavior and it is important
//that the rng is fast. We do not use a constant random sequence,
//because there may be some privacy improvement by making
//the selection random.
if (nPass == 0 ? insecure_rand.randbool() : !vfIncluded[i]) {
nTotal += vValue[i].first;
vfIncluded[i] = true;
if (nTotal >= nTargetValue) {
fReachedTarget = true;
if (nTotal < nBest) {
nBest = nTotal;
vfBest = vfIncluded;
}
nTotal -= vValue[i].first;
vfIncluded[i] = false;
}
}
}
}
}
}
// TODO: find appropriate place for this sort function
// move denoms down
bool less_then_denom(const COutput& out1, const COutput& out2)
{
const CWalletTx* pcoin1 = out1.tx;
const CWalletTx* pcoin2 = out2.tx;
bool found1 = false;
bool found2 = false;
for (CAmount d : obfuScationDenominations) // loop through predefined denoms
{
if (pcoin1->vout[out1.i].nValue == d) found1 = true;
if (pcoin2->vout[out2.i].nValue == d) found2 = true;
}
return (!found1 && found2);
}
bool CWallet::SelectStakeCoins(std::list<std::unique_ptr<CStakeInput> >& listInputs, CAmount nTargetAmount,
int blockHeight, bool fPrecompute)
{
LOCK(cs_main);
//Add CREDIT
std::vector<COutput> vCoins;
// include cold, exclude delegated
const bool fIncludeCold = sporkManager.IsSporkActive(SPORK_17_COLDSTAKING_ENFORCEMENT) && GetBoolArg("-coldstaking", true);
AvailableCoins(vCoins, true, NULL, false, STAKABLE_COINS, false, 1, fIncludeCold, false);
CAmount nAmountSelected = 0;
if (GetBoolArg("-creditstake", true) && !fPrecompute) {
for (const COutput &out : vCoins) {
//make sure not to outrun target amount
if (nAmountSelected + out.tx->vout[out.i].nValue > nTargetAmount)
continue;
if (out.tx->vin[0].IsZerocoinSpend() && !out.tx->IsInMainChain())
continue;
if (!out.tx->hashBlock)
continue;
CBlockIndex* utxoBlock = mapBlockIndex.at(out.tx->hashBlock);
//check for maturity (min age/depth)
if (!Params().HasStakeMinAgeOrDepth(blockHeight, GetAdjustedTime(), utxoBlock->nHeight, utxoBlock->GetBlockTime()))
continue;
//add to our stake set
nAmountSelected += out.tx->vout[out.i].nValue;
std::unique_ptr<CCreditStake> input(new CCreditStake());
input->SetInput((CTransaction) *out.tx, out.i);
listInputs.emplace_back(std::move(input));
}
}
/* Disable zCREDIT Staking
//zCREDIT
if ((GetBoolArg("-zcreditstake", true) || fPrecompute) && chainActive.Height() > Params().Zerocoin_Block_V2_Start() && !sporkManager.IsSporkActive(SPORK_16_ZEROCOIN_MAINTENANCE_MODE)) {
//Only update zCREDIT set once per update interval
bool fUpdate = false;
static int64_t nTimeLastUpdate = 0;
if (GetAdjustedTime() - nTimeLastUpdate > nStakeSetUpdateTime) {
fUpdate = true;
nTimeLastUpdate = GetAdjustedTime();
}
std::set<CMintMeta> setMints = zcreditTracker->ListMints(true, true, fUpdate);
for (auto meta : setMints) {
if (meta.hashStake == 0) {
CZerocoinMint mint;
if (GetMint(meta.hashSerial, mint)) {
uint256 hashStake = mint.GetSerialNumber().getuint256();
hashStake = Hash(hashStake.begin(), hashStake.end());
meta.hashStake = hashStake;
zcreditTracker->UpdateState(meta);
}
}
if (meta.nVersion < CZerocoinMint::STAKABLE_VERSION)
continue;
if (meta.nHeight < chainActive.Height() - Params().Zerocoin_RequiredStakeDepth()) {
std::unique_ptr<CZCreditStake> input(new CZCreditStake(meta.denom, meta.hashStake));
std::listInputs.emplace_back(std::move(input));
}
}
}
*/
return true;
}
bool CWallet::MintableCoins()
{
LOCK(cs_main);
CAmount nBalance = GetStakingBalance(GetBoolArg("-coldstaking", true));
CAmount nZcreditBalance = GetZerocoinBalance(false);
int chainHeight = chainActive.Height();
// Regular CREDIT
if (nBalance > 0) {
if (mapArgs.count("-reservebalance") && !ParseMoney(mapArgs["-reservebalance"], nReserveBalance))
return error("%s : invalid reserve balance amount", __func__);
if (nBalance <= nReserveBalance)
return false;
std::vector<COutput> vCoins;
// include cold, exclude delegated
const bool fIncludeCold = sporkManager.IsSporkActive(SPORK_17_COLDSTAKING_ENFORCEMENT) && GetBoolArg("-coldstaking", true);
AvailableCoins(vCoins, true, NULL, false, STAKABLE_COINS, false, 1, fIncludeCold, false);
int64_t time = GetAdjustedTime();
for (const COutput& out : vCoins) {
CBlockIndex* utxoBlock = mapBlockIndex.at(out.tx->hashBlock);
//check for maturity (min age/depth)
if (Params().HasStakeMinAgeOrDepth(chainHeight, time, utxoBlock->nHeight, utxoBlock->nTime))
return true;
}
}
// zCREDIT
if (nZcreditBalance > 0) {
std::set<CMintMeta> setMints = zcreditTracker->ListMints(true, true, true);
for (auto mint : setMints) {
if (mint.nVersion < CZerocoinMint::STAKABLE_VERSION)
continue;
if (mint.nHeight > chainHeight - Params().Zerocoin_RequiredStakeDepth())
continue;
return true;
}
}
return false;
}
bool CWallet::SelectCoinsMinConf(const CAmount& nTargetValue, int nConfMine, int nConfTheirs, std::vector<COutput> vCoins, std::set<std::pair<const CWalletTx*, unsigned int> >& setCoinsRet, CAmount& nValueRet) const
{
setCoinsRet.clear();
nValueRet = 0;
// List of values less than target
std::pair<CAmount, std::pair<const CWalletTx*, unsigned int> > coinLowestLarger;
coinLowestLarger.first = std::numeric_limits<CAmount>::max();
coinLowestLarger.second.first = NULL;
std::vector<std::pair<CAmount, std::pair<const CWalletTx*, unsigned int> > > vValue;
CAmount nTotalLower = 0;
random_shuffle(vCoins.begin(), vCoins.end(), GetRandInt);
// move denoms down on the list
std::sort(vCoins.begin(), vCoins.end(), less_then_denom);
// try to find nondenom first to prevent unneeded spending of mixed coins
for (unsigned int tryDenom = 0; tryDenom < 2; tryDenom++) {
if (fDebug) LogPrint("selectcoins", "tryDenom: %d\n", tryDenom);
vValue.clear();
nTotalLower = 0;
for (const COutput& output : vCoins) {
if (!output.fSpendable)
continue;
const CWalletTx* pcoin = output.tx;
// if (fDebug) LogPrint("selectcoins", "value %s confirms %d\n", FormatMoney(pcoin->vout[output.i].nValue), output.nDepth);
if (output.nDepth < (pcoin->IsFromMe(ISMINE_ALL) ? nConfMine : nConfTheirs))
continue;
int i = output.i;
CAmount n = pcoin->vout[i].nValue;
if (tryDenom == 0 && IsDenominatedAmount(n)) continue; // we don't want denom values on first run
std::pair<CAmount, std::pair<const CWalletTx*, unsigned int> > coin = std::make_pair(n, std::make_pair(pcoin, i));
if (n == nTargetValue) {
setCoinsRet.insert(coin.second);
nValueRet += coin.first;
return true;
} else if (n < nTargetValue + CENT) {
vValue.push_back(coin);
nTotalLower += n;
} else if (n < coinLowestLarger.first) {
coinLowestLarger = coin;
}
}
if (nTotalLower == nTargetValue) {
for (unsigned int i = 0; i < vValue.size(); ++i) {
setCoinsRet.insert(vValue[i].second);
nValueRet += vValue[i].first;
}
return true;
}
if (nTotalLower < nTargetValue) {
if (coinLowestLarger.second.first == NULL) // there is no input larger than nTargetValue
{
if (tryDenom == 0)
// we didn't look at denom yet, let's do it
continue;
else
// we looked at everything possible and didn't find anything, no luck
return false;
}
setCoinsRet.insert(coinLowestLarger.second);
nValueRet += coinLowestLarger.first;
return true;
}
// nTotalLower > nTargetValue
break;
}
// Solve subset sum by stochastic approximation
std::sort(vValue.rbegin(), vValue.rend(), CompareValueOnly());
std::vector<char> vfBest;
CAmount nBest;
ApproximateBestSubset(vValue, nTotalLower, nTargetValue, vfBest, nBest, 1000);
if (nBest != nTargetValue && nTotalLower >= nTargetValue + CENT)
ApproximateBestSubset(vValue, nTotalLower, nTargetValue + CENT, vfBest, nBest, 1000);
// If we have a bigger coin and (either the stochastic approximation didn't find a good solution,
// or the next bigger coin is closer), return the bigger coin
if (coinLowestLarger.second.first &&
((nBest != nTargetValue && nBest < nTargetValue + CENT) || coinLowestLarger.first <= nBest)) {
setCoinsRet.insert(coinLowestLarger.second);
nValueRet += coinLowestLarger.first;
} else {
std::string s = "CWallet::SelectCoinsMinConf best subset: ";
for (unsigned int i = 0; i < vValue.size(); i++) {
if (vfBest[i]) {
setCoinsRet.insert(vValue[i].second);
nValueRet += vValue[i].first;
s += FormatMoney(vValue[i].first) + " ";
}
}
LogPrintf("%s - total %s\n", s, FormatMoney(nBest));
}
return true;
}
bool CWallet::SelectCoins(const CAmount& nTargetValue, std::set<std::pair<const CWalletTx*, unsigned int> >& setCoinsRet, CAmount& nValueRet, const CCoinControl* coinControl, AvailableCoinsType coin_type, bool useIX, bool fIncludeColdStaking, bool fIncludeDelegated) const
{
// Note: this function should never be used for "always free" tx types like dstx
std::vector<COutput> vCoins;
AvailableCoins(vCoins, true, coinControl, false, coin_type, useIX, 1, fIncludeColdStaking, fIncludeDelegated);
// coin control -> return all selected outputs (we want all selected to go into the transaction for sure)
if (coinControl && coinControl->HasSelected()) {
for (const COutput& out : vCoins) {
if (!out.fSpendable)
continue;
nValueRet += out.tx->vout[out.i].nValue;
setCoinsRet.insert(std::make_pair(out.tx, out.i));
}
return (nValueRet >= nTargetValue);
}
return (SelectCoinsMinConf(nTargetValue, 1, 6, vCoins, setCoinsRet, nValueRet) ||
SelectCoinsMinConf(nTargetValue, 1, 1, vCoins, setCoinsRet, nValueRet) ||
(bSpendZeroConfChange && SelectCoinsMinConf(nTargetValue, 0, 1, vCoins, setCoinsRet, nValueRet)));
}
bool CWallet::IsCollateralAmount(CAmount nInputAmount) const
{
return nInputAmount != 0 && nInputAmount % OBFUSCATION_COLLATERAL == 0 && nInputAmount < OBFUSCATION_COLLATERAL * 5 && nInputAmount > OBFUSCATION_COLLATERAL;
}
bool CWallet::GetBudgetSystemCollateralTX(CWalletTx& tx, uint256 hash, bool useIX)
{
// make our change address
CReserveKey reservekey(pwalletMain);
CScript scriptChange;
scriptChange << OP_RETURN << ToByteVector(hash);
CAmount nFeeRet = 0;
std::string strFail = "";
std::vector<std::pair<CScript, CAmount> > vecSend;
vecSend.push_back(std::make_pair(scriptChange, BUDGET_FEE_TX_OLD)); // Old 50 CREDIT collateral
CCoinControl* coinControl = NULL;
bool success = CreateTransaction(vecSend, tx, reservekey, nFeeRet, strFail, coinControl, ALL_COINS, useIX, (CAmount)0);
if (!success) {
LogPrintf("GetBudgetSystemCollateralTX: Error - %s\n", strFail);
return false;
}
return true;
}
bool CWallet::GetBudgetFinalizationCollateralTX(CWalletTx& tx, uint256 hash, bool useIX)
{
// make our change address
CReserveKey reservekey(pwalletMain);
CScript scriptChange;
scriptChange << OP_RETURN << ToByteVector(hash);
CAmount nFeeRet = 0;
std::string strFail = "";
std::vector<std::pair<CScript, CAmount> > vecSend;
vecSend.push_back(std::make_pair(scriptChange, BUDGET_FEE_TX)); // New 5 CREDIT collateral
CCoinControl* coinControl = NULL;
bool success = CreateTransaction(vecSend, tx, reservekey, nFeeRet, strFail, coinControl, ALL_COINS, useIX, (CAmount)0);
if (!success) {
LogPrintf("GetBudgetSystemCollateralTX: Error - %s\n", strFail);
return false;
}
return true;
}
bool CWallet::CreateTransaction(const std::vector<std::pair<CScript, CAmount> >& vecSend,
CWalletTx& wtxNew,
CReserveKey& reservekey,
CAmount& nFeeRet,
std::string& strFailReason,
const CCoinControl* coinControl,
AvailableCoinsType coin_type,
bool useIX,
CAmount nFeePay,
bool fIncludeDelegated)
{
if (useIX && nFeePay < CENT) nFeePay = CENT;
CAmount nValue = 0;
for (const PAIRTYPE(CScript, CAmount) & s : vecSend) {
if (nValue < 0) {
strFailReason = _("Transaction amounts must be positive");
return false;
}
nValue += s.second;
}
if (vecSend.empty() || nValue < 0) {
strFailReason = _("Transaction amounts must be positive");
return false;
}
wtxNew.fTimeReceivedIsTxTime = true;
wtxNew.BindWallet(this);
CMutableTransaction txNew;
{
LOCK2(cs_main, cs_wallet);
{
nFeeRet = 0;
if (nFeePay > 0) nFeeRet = nFeePay;
while (true) {
txNew.vin.clear();
txNew.vout.clear();
wtxNew.fFromMe = true;
CAmount nTotalValue = nValue + nFeeRet;
double dPriority = 0;
// vouts to the payees
if (coinControl && !coinControl->fSplitBlock) {
for (const PAIRTYPE(CScript, CAmount) & s : vecSend) {
CTxOut txout(s.second, s.first);
if (txout.IsDust(::minRelayTxFee)) {
strFailReason = _("Transaction amount too small");
return false;
}
txNew.vout.push_back(txout);
}
} else //UTXO Splitter Transaction
{
int nSplitBlock;
if (coinControl)
nSplitBlock = coinControl->nSplitBlock;
else
nSplitBlock = 1;
for (const PAIRTYPE(CScript, CAmount) & s : vecSend) {
for (int i = 0; i < nSplitBlock; i++) {
if (i == nSplitBlock - 1) {
uint64_t nRemainder = s.second % nSplitBlock;
txNew.vout.push_back(CTxOut((s.second / nSplitBlock) + nRemainder, s.first));
} else
txNew.vout.push_back(CTxOut(s.second / nSplitBlock, s.first));
}
}
}
// Choose coins to use
std::set<std::pair<const CWalletTx*, unsigned int> > setCoins;
CAmount nValueIn = 0;
if (!SelectCoins(nTotalValue, setCoins, nValueIn, coinControl, coin_type, useIX, false, fIncludeDelegated)) {
if (coin_type == ALL_COINS) {
strFailReason = _("Insufficient funds.");
} else if (coin_type == ONLY_NOT10000IFMN) {
strFailReason = _("Unable to locate enough funds for this transaction that are not equal 100000 CREDIT.");
} else if (coin_type == ONLY_NONDENOMINATED_NOT10000IFMN) {
strFailReason = _("Unable to locate enough Obfuscation non-denominated funds for this transaction that are not equal 100000 CREDIT.");
} else {
strFailReason = _("Unable to locate enough Obfuscation denominated funds for this transaction.");
strFailReason += " " + _("Obfuscation uses exact denominated amounts to send funds, you might simply need to anonymize some more coins.");
}
if (useIX) {
strFailReason += " " + _("SwiftX requires inputs with at least 6 confirmations, you might need to wait a few minutes and try again.");
}
return false;
}
for (PAIRTYPE(const CWalletTx*, unsigned int) pcoin : setCoins) {
if(pcoin.first->vout[pcoin.second].scriptPubKey.IsPayToColdStaking())
wtxNew.fStakeDelegationVoided = true;
CAmount nCredit = pcoin.first->vout[pcoin.second].nValue;
//The coin age after the next block (depth+1) is used instead of the current,
//reflecting an assumption the user would accept a bit more delay for
//a chance at a free transaction.
//But mempool inputs might still be in the mempool, so their age stays 0
int age = pcoin.first->GetDepthInMainChain();
assert(age >= 0);
if (age != 0)
age += 1;
dPriority += (double)nCredit * age;
}
CAmount nChange = nValueIn - nValue - nFeeRet;
//over pay for denominated transactions
if (coin_type == ONLY_DENOMINATED) {
nFeeRet += nChange;
nChange = 0;
wtxNew.mapValue["DS"] = "1";
}
if (nChange > 0) {
// Fill a vout to ourself
// TODO: pass in scriptChange instead of reservekey so
// change transaction isn't always pay-to-terracredit-address
CScript scriptChange;
bool combineChange = false;
// coin control: send change to custom address
if (coinControl && !boost::get<CNoDestination>(&coinControl->destChange)) {
scriptChange = GetScriptForDestination(coinControl->destChange);
std::vector<CTxOut>::iterator it = txNew.vout.begin();
while (it != txNew.vout.end()) {
if (scriptChange == it->scriptPubKey) {
it->nValue += nChange;
nChange = 0;
reservekey.ReturnKey();
combineChange = true;
break;
}
++it;
}
}
// no coin control: send change to newly generated address
else {
// Note: We use a new key here to keep it from being obvious which side is the change.
// The drawback is that by not reusing a previous key, the change may be lost if a
// backup is restored, if the backup doesn't have the new private key for the change.
// If we reused the old key, it would be possible to add code to look for and
// rediscover unknown transactions that were written with keys of ours to recover
// post-backup change.
// Reserve a new key pair from key pool
CPubKey vchPubKey;
bool ret;
ret = reservekey.GetReservedKey(vchPubKey);
assert(ret); // should never fail, as we just unlocked
scriptChange = GetScriptForDestination(vchPubKey.GetID());
}
if (!combineChange) {
CTxOut newTxOut(nChange, scriptChange);
// Never create dust outputs; if we would, just
// add the dust to the fee.
if (newTxOut.IsDust(::minRelayTxFee)) {
nFeeRet += nChange;
nChange = 0;
reservekey.ReturnKey();
} else {
// Insert change txn at random position:
std::vector<CTxOut>::iterator position = txNew.vout.begin() + GetRandInt(txNew.vout.size() + 1);
txNew.vout.insert(position, newTxOut);
}
}
} else
reservekey.ReturnKey();
// Fill vin
for (const PAIRTYPE(const CWalletTx*, unsigned int) & coin : setCoins)
txNew.vin.push_back(CTxIn(coin.first->GetHash(), coin.second));
// Sign
int nIn = 0;
for (const PAIRTYPE(const CWalletTx*, unsigned int) & coin : setCoins)
if (!SignSignature(*this, *coin.first, txNew, nIn++)) {
strFailReason = _("Signing transaction failed");
return false;
}
// Embed the constructed transaction data in wtxNew.
*static_cast<CTransaction*>(&wtxNew) = CTransaction(txNew);
// Limit size
unsigned int nBytes = ::GetSerializeSize(*(CTransaction*)&wtxNew, SER_NETWORK, PROTOCOL_VERSION);
if (nBytes >= MAX_STANDARD_TX_SIZE) {
strFailReason = _("Transaction too large");
return false;
}
dPriority = wtxNew.ComputePriority(dPriority, nBytes);
// Can we complete this as a free transaction?
if (fSendFreeTransactions && nBytes <= MAX_FREE_TRANSACTION_CREATE_SIZE) {
// Not enough fee: enough priority?
double dPriorityNeeded = mempool.estimatePriority(nTxConfirmTarget);
// Not enough mempool history to estimate: use hard-coded AllowFree.
if (dPriorityNeeded <= 0 && AllowFree(dPriority))
break;
// Small enough, and priority high enough, to send for free
if (dPriorityNeeded > 0 && dPriority >= dPriorityNeeded)
break;
}
CAmount nFeeNeeded = std::max(nFeePay, GetMinimumFee(nBytes, nTxConfirmTarget, mempool));
// 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.
if (nFeeNeeded < ::minRelayTxFee.GetFee(nBytes)) {
strFailReason = _("Transaction too large for fee policy");
return false;
}
if (nFeeRet >= nFeeNeeded) // Done, enough fee included
break;
// Include more fee and try again.
nFeeRet = nFeeNeeded;
continue;
}
}
}
return true;
}
bool CWallet::CreateTransaction(CScript scriptPubKey, const CAmount& nValue, CWalletTx& wtxNew, CReserveKey& reservekey, CAmount& nFeeRet, std::string& strFailReason, const CCoinControl* coinControl, AvailableCoinsType coin_type, bool useIX, CAmount nFeePay, bool fIncludeDelegated)
{
std::vector<std::pair<CScript, CAmount> > vecSend;
vecSend.push_back(std::make_pair(scriptPubKey, nValue));
return CreateTransaction(vecSend, wtxNew, reservekey, nFeeRet, strFailReason, coinControl, coin_type, useIX, nFeePay, fIncludeDelegated);
}
// ppcoin: create coin stake transaction
bool CWallet::CreateCoinStake(
const CKeyStore& keystore,
const CBlockIndex* pindexPrev,
unsigned int nBits,
int64_t nSearchInterval,
CMutableTransaction& txNew,
int64_t& nTxNewTime
)
{
txNew.vin.clear();
txNew.vout.clear();
// Mark coin stake transaction
CScript scriptEmpty;
scriptEmpty.clear();
txNew.vout.push_back(CTxOut(0, scriptEmpty));
// Choose coins to use
CAmount nBalance = GetStakingBalance();
if (mapArgs.count("-reservebalance") && !ParseMoney(mapArgs["-reservebalance"], nReserveBalance))
return error("CreateCoinStake : invalid reserve balance amount");
if (nBalance > 0 && nBalance <= nReserveBalance)
return false;
// Get the list of stakable inputs
std::list<std::unique_ptr<CStakeInput> > listInputs;
if (!SelectStakeCoins(listInputs, nBalance - nReserveBalance, pindexPrev->nHeight + 1)) {
LogPrintf("CreateCoinStake(): selectStakeCoins failed\n");
return false;
}
if (listInputs.empty()) {
LogPrint("staking", "CreateCoinStake(): listInputs empty\n");
MilliSleep(50000);
return false;
}
if (GetAdjustedTime() - pindexPrev->GetBlockTime() < 60) {
if (Params().NetworkID() == CBaseChainParams::REGTEST) {
MilliSleep(1000);
}
}
CAmount nCredit;
CScript scriptPubKeyKernel;
bool fKernelFound = false;
int nAttempts = 0;
for (std::unique_ptr<CStakeInput>& stakeInput : listInputs) {
nCredit = 0;
// Make sure the wallet is unlocked and shutdown hasn't been requested
if (IsLocked() || ShutdownRequested())
return false;
uint256 hashProofOfStake = 0;
nAttempts++;
//iterates each utxo inside of CheckStakeKernelHash()
if (Stake(pindexPrev, stakeInput.get(), nBits, nTxNewTime, hashProofOfStake)) {
// Found a kernel
LogPrintf("CreateCoinStake : kernel found\n");
nCredit += stakeInput->GetValue();
// Calculate reward
CAmount nReward;
nReward = GetBlockValue(chainActive.Height() + 1);
nCredit += nReward;
// Create the output transaction(s)
std::vector<CTxOut> vout;
if (!stakeInput->CreateTxOuts(this, vout, nCredit)) {
LogPrintf("%s : failed to create output\n", __func__);
continue;
}
txNew.vout.insert(txNew.vout.end(), vout.begin(), vout.end());
CAmount nMinFee = 0;
if (!stakeInput->IsZCREDIT()) {
// Set output amount
int outputs = txNew.vout.size() - 1;
CAmount nRemaining = nCredit - nMinFee;
if (outputs > 1) {
// Split the stake across the outputs
CAmount nShare = nRemaining / outputs;
for (int i = 1; i < outputs; i++) {
// loop through all but the last one.
txNew.vout[i].nValue = nShare;
nRemaining -= nShare;
}
}
// put the remaining on the last output (which all into the first if only one output)
txNew.vout[outputs].nValue += nRemaining;
}
// Limit size
unsigned int nBytes = ::GetSerializeSize(txNew, SER_NETWORK, PROTOCOL_VERSION);
if (nBytes >= DEFAULT_BLOCK_MAX_SIZE / 5)
return error("CreateCoinStake : exceeded coinstake size limit");
//Masternode payment
FillBlockPayee(txNew, nMinFee, true, stakeInput->IsZCREDIT());
{
TRY_LOCK(zcreditTracker->cs_spendcache, fLocked);
if (!fLocked)
continue;
uint256 hashTxOut = txNew.GetHash();
CTxIn in;
if (!stakeInput->CreateTxIn(this, in, hashTxOut)) {
LogPrintf("%s : failed to create TxIn\n", __func__);
txNew.vin.clear();
txNew.vout.clear();
continue;
}
txNew.vin.emplace_back(in);
}
//Mark mints as spent
if (stakeInput->IsZCREDIT()) {
CZCreditStake* z = (CZCreditStake*)stakeInput.get();
if (!z->MarkSpent(this, txNew.GetHash()))
return error("%s: failed to mark mint as used\n", __func__);
}
fKernelFound = true;
break;
}
}
LogPrint("staking", "%s: attempted staking %d times\n", __func__, nAttempts);
if (!fKernelFound)
return false;
// Sign for CREDIT
int nIn = 0;
if (!txNew.vin[0].scriptSig.IsZerocoinSpend()) {
for (CTxIn txIn : txNew.vin) {
const CWalletTx *wtx = GetWalletTx(txIn.prevout.hash);
if (!SignSignature(*this, *wtx, txNew, nIn++, SIGHASH_ALL, true))
return error("CreateCoinStake : failed to sign coinstake");
}
} else {
//Update the mint database with tx hash and height
for (const CTxOut& out : txNew.vout) {
if (!out.IsZerocoinMint())
continue;
libzerocoin::PublicCoin pubcoin(Params().Zerocoin_Params(false));
CValidationState state;
if (!TxOutToPublicCoin(out, pubcoin, state))
return error("%s: extracting pubcoin from txout failed", __func__);
uint256 hashPubcoin = GetPubCoinHash(pubcoin.getValue());
if (!zcreditTracker->HasPubcoinHash(hashPubcoin))
return error("%s: could not find pubcoinhash %s in tracker", __func__, hashPubcoin.GetHex());
CMintMeta meta = zcreditTracker->GetMetaFromPubcoin(hashPubcoin);
meta.txid = txNew.GetHash();
meta.nHeight = chainActive.Height() + 1;
if (!zcreditTracker->UpdateState(meta))
return error("%s: failed to update metadata in tracker", __func__);
}
}
// Successfully generated coinstake
return true;
}
/**
* Call after CreateTransaction unless you want to abort
*/
bool CWallet::CommitTransaction(CWalletTx& wtxNew, CReserveKey& reservekey, std::string strCommand)
{
{
LOCK2(cs_main, cs_wallet);
LogPrintf("CommitTransaction:\n%s", wtxNew.ToString());
{
// This is only to keep the database open to defeat the auto-flush for the
// duration of this scope. This is the only place where this optimization
// maybe makes sense; please don't do it anywhere else.
CWalletDB* pwalletdb = fFileBacked ? new CWalletDB(strWalletFile, "r+") : NULL;
// Take key pair from key pool so it won't be used again
reservekey.KeepKey();
// Add tx to wallet, because if it has change it's also ours,
// otherwise just for transaction history.
AddToWallet(wtxNew, false, pwalletdb);
// Notify that old coins are spent
if (!wtxNew.HasZerocoinSpendInputs()) {
std::set<uint256> updated_hahes;
for (const CTxIn& txin : wtxNew.vin) {
// notify only once
if (updated_hahes.find(txin.prevout.hash) != updated_hahes.end()) continue;
CWalletTx& coin = mapWallet[txin.prevout.hash];
coin.BindWallet(this);
NotifyTransactionChanged(this, txin.prevout.hash, CT_UPDATED);
updated_hahes.insert(txin.prevout.hash);
}
}
if (fFileBacked)
delete pwalletdb;
}
// Track how many getdata requests our transaction gets
mapRequestCount[wtxNew.GetHash()] = 0;
// Broadcast
if (!wtxNew.AcceptToMemoryPool(false)) {
// This must not fail. The transaction has already been signed and recorded.
LogPrintf("CommitTransaction() : Error: Transaction not valid\n");
return false;
}
wtxNew.RelayWalletTransaction(strCommand);
}
return true;
}
bool CWallet::AddAccountingEntry(const CAccountingEntry& acentry, CWalletDB & pwalletdb)
{
if (!pwalletdb.WriteAccountingEntry_Backend(acentry))
return false;
laccentries.push_back(acentry);
CAccountingEntry & entry = laccentries.back();
wtxOrdered.insert(std::make_pair(entry.nOrderPos, TxPair((CWalletTx*)0, &entry)));
return true;
}
CAmount CWallet::GetMinimumFee(unsigned int nTxBytes, unsigned int nConfirmTarget, const CTxMemPool& pool)
{
// payTxFee is user-set "I want to pay this much"
CAmount nFeeNeeded = payTxFee.GetFee(nTxBytes);
// user selected total at least (default=true)
if (fPayAtLeastCustomFee && nFeeNeeded > 0 && nFeeNeeded < payTxFee.GetFeePerK())
nFeeNeeded = payTxFee.GetFeePerK();
// User didn't set: use -txconfirmtarget to estimate...
if (nFeeNeeded == 0)
nFeeNeeded = pool.estimateFee(nConfirmTarget).GetFee(nTxBytes);
// ... unless we don't have enough mempool data, in which case fall
// back to a hard-coded fee
if (nFeeNeeded == 0)
nFeeNeeded = minTxFee.GetFee(nTxBytes);
// prevent user from paying a non-sense fee (like 1 satoshi): 0 < fee < minRelayFee
if (nFeeNeeded < ::minRelayTxFee.GetFee(nTxBytes))
nFeeNeeded = ::minRelayTxFee.GetFee(nTxBytes);
// But always obey the maximum
if (nFeeNeeded > maxTxFee)
nFeeNeeded = maxTxFee;
return nFeeNeeded;
}
DBErrors CWallet::LoadWallet(bool& fFirstRunRet)
{
if (!fFileBacked)
return DB_LOAD_OK;
DBErrors nLoadWalletRet = CWalletDB(strWalletFile, "cr+").LoadWallet(this);
if (nLoadWalletRet == DB_NEED_REWRITE) {
if (CDB::Rewrite(strWalletFile, "\x04pool")) {
LOCK(cs_wallet);
setKeyPool.clear();
// Note: can't top-up keypool here, because wallet is locked.
// User will be prompted to unlock wallet the next operation
// the requires a new key.
}
}
// This wallet is in its first run if all of these are empty
fFirstRunRet = mapKeys.empty() && mapCryptedKeys.empty() && mapMasterKeys.empty() && setWatchOnly.empty() && mapScripts.empty();
if (nLoadWalletRet != DB_LOAD_OK)
return nLoadWalletRet;
uiInterface.LoadWallet(this);
return DB_LOAD_OK;
}
DBErrors CWallet::ZapWalletTx(std::vector<CWalletTx>& vWtx)
{
if (!fFileBacked)
return DB_LOAD_OK;
DBErrors nZapWalletTxRet = CWalletDB(strWalletFile, "cr+").ZapWalletTx(this, vWtx);
if (nZapWalletTxRet == DB_NEED_REWRITE) {
if (CDB::Rewrite(strWalletFile, "\x04pool")) {
LOCK(cs_wallet);
setKeyPool.clear();
// Note: can't top-up keypool here, because wallet is locked.
// User will be prompted to unlock wallet the next operation
// that requires a new key.
}
}
if (nZapWalletTxRet != DB_LOAD_OK)
return nZapWalletTxRet;
return DB_LOAD_OK;
}
CBitcoinAddress CWallet::ParseIntoAddress(const CTxDestination& dest, const std::string& purpose) {
const CChainParams::Base58Type addrType =
AddressBook::IsColdStakingPurpose(purpose) ?
CChainParams::STAKING_ADDRESS : CChainParams::PUBKEY_ADDRESS;
return CBitcoinAddress(dest, addrType);
}
bool CWallet::SetAddressBook(const CTxDestination& address, const std::string& strName, const std::string& strPurpose)
{
bool fUpdated = HasAddressBook(address);
{
LOCK(cs_wallet); // mapAddressBook
mapAddressBook[address].name = strName;
if (!strPurpose.empty()) /* update purpose only if requested */
mapAddressBook[address].purpose = strPurpose;
}
NotifyAddressBookChanged(this, address, strName, ::IsMine(*this, address) != ISMINE_NO,
strPurpose, (fUpdated ? CT_UPDATED : CT_NEW));
if (!fFileBacked)
return false;
std::string addressStr = ParseIntoAddress(address, strPurpose).ToString();
if (!strPurpose.empty() && !CWalletDB(strWalletFile).WritePurpose(addressStr, strPurpose))
return false;
return CWalletDB(strWalletFile).WriteName(addressStr, strName);
}
bool CWallet::DelAddressBook(const CTxDestination& address, const CChainParams::Base58Type addrType)
{
std::string strAddress = CBitcoinAddress(address, addrType).ToString();
std::string purpose = purposeForAddress(address);
{
LOCK(cs_wallet); // mapAddressBook
if (fFileBacked) {
// Delete destdata tuples associated with address
for (const PAIRTYPE(std::string, std::string) & item : mapAddressBook[address].destdata) {
CWalletDB(strWalletFile).EraseDestData(strAddress, item.first);
}
}
mapAddressBook.erase(address);
}
NotifyAddressBookChanged(this, address, "", ::IsMine(*this, address) != ISMINE_NO, purpose, CT_DELETED);
if (!fFileBacked)
return false;
CWalletDB(strWalletFile).ErasePurpose(strAddress);
return CWalletDB(strWalletFile).EraseName(strAddress);
}
std::string CWallet::purposeForAddress(const CTxDestination& address) const
{
{
LOCK(cs_wallet);
auto mi = mapAddressBook.find(address);
if (mi != mapAddressBook.end()) {
return mi->second.purpose;
}
}
return "";
}
bool CWallet::HasAddressBook(const CTxDestination& address) const
{
LOCK(cs_wallet); // mapAddressBook
std::map<CTxDestination, AddressBook::CAddressBookData>::const_iterator mi = mapAddressBook.find(address);
return mi != mapAddressBook.end();
}
bool CWallet::HasDelegator(const CTxOut& out) const
{
CTxDestination delegator;
if (!ExtractDestination(out.scriptPubKey, delegator, false))
return false;
{
LOCK(cs_wallet); // mapAddressBook
std::map<CTxDestination, AddressBook::CAddressBookData>::const_iterator mi = mapAddressBook.find(delegator);
if (mi == mapAddressBook.end())
return false;
return (*mi).second.purpose == "delegator";
}
}
/**
* Mark old keypool keys as used,
* and generate all new keys
*/
bool CWallet::NewKeyPool()
{
{
LOCK(cs_wallet);
CWalletDB walletdb(strWalletFile);
for (int64_t nIndex : setKeyPool)
walletdb.ErasePool(nIndex);
setKeyPool.clear();
if (IsLocked())
return false;
int64_t nKeys = std::max(GetArg("-keypool", 1000), (int64_t)0);
for (int i = 0; i < nKeys; i++) {
int64_t nIndex = i + 1;
walletdb.WritePool(nIndex, CKeyPool(GenerateNewKey()));
setKeyPool.insert(nIndex);
}
LogPrintf("CWallet::NewKeyPool wrote %d new keys\n", nKeys);
}
return true;
}
bool CWallet::TopUpKeyPool(unsigned int kpSize)
{
{
LOCK(cs_wallet);
if (IsLocked())
return false;
CWalletDB walletdb(strWalletFile);
// Top up key pool
unsigned int nTargetSize;
if (kpSize > 0)
nTargetSize = kpSize;
else
nTargetSize = std::max(GetArg("-keypool", 1000), (int64_t)0);
while (setKeyPool.size() < (nTargetSize + 1)) {
int64_t nEnd = 1;
if (!setKeyPool.empty())
nEnd = *(--setKeyPool.end()) + 1;
if (!walletdb.WritePool(nEnd, CKeyPool(GenerateNewKey())))
throw std::runtime_error("TopUpKeyPool() : writing generated key failed");
setKeyPool.insert(nEnd);
LogPrintf("keypool added key %d, size=%u\n", nEnd, setKeyPool.size());
double dProgress = 100.f * nEnd / (nTargetSize + 1);
std::string strMsg = strprintf(_("Loading wallet... (%3.2f %%)"), dProgress);
uiInterface.InitMessage(strMsg);
}
}
return true;
}
void CWallet::ReserveKeyFromKeyPool(int64_t& nIndex, CKeyPool& keypool)
{
nIndex = -1;
keypool.vchPubKey = CPubKey();
{
LOCK(cs_wallet);
if (!IsLocked())
TopUpKeyPool();
// Get the oldest key
if (setKeyPool.empty())
return;
CWalletDB walletdb(strWalletFile);
nIndex = *(setKeyPool.begin());
setKeyPool.erase(setKeyPool.begin());
if (!walletdb.ReadPool(nIndex, keypool))
throw std::runtime_error("ReserveKeyFromKeyPool() : read failed");
if (!HaveKey(keypool.vchPubKey.GetID()))
throw std::runtime_error("ReserveKeyFromKeyPool() : unknown key in key pool");
assert(keypool.vchPubKey.IsValid());
LogPrintf("keypool reserve %d\n", nIndex);
}
}
void CWallet::KeepKey(int64_t nIndex)
{
// Remove from key pool
if (fFileBacked) {
CWalletDB walletdb(strWalletFile);
walletdb.ErasePool(nIndex);
}
LogPrintf("keypool keep %d\n", nIndex);
}
void CWallet::ReturnKey(int64_t nIndex)
{
// Return to key pool
{
LOCK(cs_wallet);
setKeyPool.insert(nIndex);
}
LogPrintf("keypool return %d\n", nIndex);
}
bool CWallet::GetKeyFromPool(CPubKey& result)
{
int64_t nIndex = 0;
CKeyPool keypool;
{
LOCK(cs_wallet);
ReserveKeyFromKeyPool(nIndex, keypool);
if (nIndex == -1) {
if (IsLocked()) return false;
result = GenerateNewKey();
return true;
}
KeepKey(nIndex);
result = keypool.vchPubKey;
}
return true;
}
int64_t CWallet::GetOldestKeyPoolTime()
{
int64_t nIndex = 0;
CKeyPool keypool;
ReserveKeyFromKeyPool(nIndex, keypool);
if (nIndex == -1)
return GetTime();
ReturnKey(nIndex);
return keypool.nTime;
}
std::map<CTxDestination, CAmount> CWallet::GetAddressBalances()
{
std::map<CTxDestination, CAmount> balances;
{
LOCK(cs_wallet);
for (PAIRTYPE(uint256, CWalletTx) walletEntry : mapWallet) {
CWalletTx* pcoin = &walletEntry.second;
if (!IsFinalTx(*pcoin) || !pcoin->IsTrusted())
continue;
if (pcoin->IsCoinBase() && pcoin->GetBlocksToMaturity() > 0)
continue;
bool fConflicted;
int nDepth = pcoin->GetDepthAndMempool(fConflicted);
if (fConflicted)
continue;
if (nDepth < (pcoin->IsFromMe(ISMINE_ALL) ? 0 : 1))
continue;
for (unsigned int i = 0; i < pcoin->vout.size(); i++) {
CTxDestination addr;
if (!IsMine(pcoin->vout[i]))
continue;
if ( !ExtractDestination(pcoin->vout[i].scriptPubKey, addr) &&
!ExtractDestination(pcoin->vout[i].scriptPubKey, addr, true) )
continue;
CAmount n = IsSpent(walletEntry.first, i) ? 0 : pcoin->vout[i].nValue;
if (!balances.count(addr))
balances[addr] = 0;
balances[addr] += n;
}
}
}
return balances;
}
std::set<std::set<CTxDestination> > CWallet::GetAddressGroupings()
{
AssertLockHeld(cs_wallet); // mapWallet
std::set<std::set<CTxDestination> > groupings;
std::set<CTxDestination> grouping;
for (PAIRTYPE(uint256, CWalletTx) walletEntry : mapWallet) {
CWalletTx* pcoin = &walletEntry.second;
if (pcoin->vin.size() > 0) {
bool any_mine = false;
// group all input addresses with each other
for (CTxIn txin : pcoin->vin) {
CTxDestination address;
if (!IsMine(txin)) /* If this input isn't mine, ignore it */
continue;
if (!ExtractDestination(mapWallet[txin.prevout.hash].vout[txin.prevout.n].scriptPubKey, address))
continue;
grouping.insert(address);
any_mine = true;
}
// group change with input addresses
if (any_mine) {
for (CTxOut txout : pcoin->vout)
if (IsChange(txout)) {
CTxDestination txoutAddr;
if (!ExtractDestination(txout.scriptPubKey, txoutAddr))
continue;
grouping.insert(txoutAddr);
}
}
if (grouping.size() > 0) {
groupings.insert(grouping);
grouping.clear();
}
}
// group lone addrs by themselves
for (unsigned int i = 0; i < pcoin->vout.size(); i++)
if (IsMine(pcoin->vout[i])) {
CTxDestination address;
if (!ExtractDestination(pcoin->vout[i].scriptPubKey, address))
continue;
grouping.insert(address);
groupings.insert(grouping);
grouping.clear();
}
}
std::set<std::set<CTxDestination>*> uniqueGroupings; // a set of pointers to groups of addresses
std::map<CTxDestination, std::set<CTxDestination>*> setmap; // map addresses to the unique group containing it
for (std::set<CTxDestination> grouping : groupings) {
// make a set of all the groups hit by this new group
std::set<std::set<CTxDestination>*> hits;
std::map<CTxDestination, std::set<CTxDestination>*>::iterator it;
for (CTxDestination address : grouping)
if ((it = setmap.find(address)) != setmap.end())
hits.insert((*it).second);
// merge all hit groups into a new single group and delete old groups
std::set<CTxDestination>* merged = new std::set<CTxDestination>(grouping);
for (std::set<CTxDestination>* hit : hits) {
merged->insert(hit->begin(), hit->end());
uniqueGroupings.erase(hit);
delete hit;
}
uniqueGroupings.insert(merged);
// update setmap
for (CTxDestination element : *merged)
setmap[element] = merged;
}
std::set<std::set<CTxDestination> > ret;
for (std::set<CTxDestination>* uniqueGrouping : uniqueGroupings) {
ret.insert(*uniqueGrouping);
delete uniqueGrouping;
}
return ret;
}
std::set<CTxDestination> CWallet::GetAccountAddresses(std::string strAccount) const
{
LOCK(cs_wallet);
std::set<CTxDestination> result;
for (const PAIRTYPE(CTxDestination, AddressBook::CAddressBookData) & item : mapAddressBook) {
const CTxDestination& address = item.first;
const std::string& strName = item.second.name;
if (strName == strAccount)
result.insert(address);
}
return result;
}
bool CReserveKey::GetReservedKey(CPubKey& pubkey)
{
if (nIndex == -1) {
CKeyPool keypool;
pwallet->ReserveKeyFromKeyPool(nIndex, keypool);
if (nIndex != -1)
vchPubKey = keypool.vchPubKey;
else {
return false;
}
}
assert(vchPubKey.IsValid());
pubkey = vchPubKey;
return true;
}
void CReserveKey::KeepKey()
{
if (nIndex != -1)
pwallet->KeepKey(nIndex);
nIndex = -1;
vchPubKey = CPubKey();
}
void CReserveKey::ReturnKey()
{
if (nIndex != -1)
pwallet->ReturnKey(nIndex);
nIndex = -1;
vchPubKey = CPubKey();
}
void CWallet::GetAllReserveKeys(std::set<CKeyID>& setAddress) const
{
setAddress.clear();
CWalletDB walletdb(strWalletFile);
LOCK2(cs_main, cs_wallet);
for (const int64_t& id : setKeyPool) {
CKeyPool keypool;
if (!walletdb.ReadPool(id, keypool))
throw std::runtime_error("GetAllReserveKeyHashes() : read failed");
assert(keypool.vchPubKey.IsValid());
CKeyID keyID = keypool.vchPubKey.GetID();
if (!HaveKey(keyID))
throw std::runtime_error("GetAllReserveKeyHashes() : unknown key in key pool");
setAddress.insert(keyID);
}
}
bool CWallet::UpdatedTransaction(const uint256& hashTx)
{
{
LOCK(cs_wallet);
// Only notify UI if this transaction is in this wallet
std::map<uint256, CWalletTx>::const_iterator mi = mapWallet.find(hashTx);
if (mi != mapWallet.end()) {
NotifyTransactionChanged(this, hashTx, CT_UPDATED);
return true;
}
}
return false;
}
void CWallet::LockCoin(const COutPoint& output)
{
AssertLockHeld(cs_wallet); // setLockedCoins
setLockedCoins.insert(output);
}
void CWallet::UnlockCoin(const COutPoint& output)
{
AssertLockHeld(cs_wallet); // setLockedCoins
setLockedCoins.erase(output);
}
void CWallet::UnlockAllCoins()
{
AssertLockHeld(cs_wallet); // setLockedCoins
setLockedCoins.clear();
}
bool CWallet::IsLockedCoin(const uint256& hash, unsigned int n) const
{
AssertLockHeld(cs_wallet); // setLockedCoins
const COutPoint outpt(hash, n);
return (setLockedCoins.count(outpt) > 0);
}
void CWallet::ListLockedCoins(std::vector<COutPoint>& vOutpts)
{
AssertLockHeld(cs_wallet); // setLockedCoins
for (std::set<COutPoint>::iterator it = setLockedCoins.begin();
it != setLockedCoins.end(); it++) {
COutPoint outpt = (*it);
vOutpts.push_back(outpt);
}
}
/** @} */ // end of Actions
class CAffectedKeysVisitor : public boost::static_visitor<void>
{
private:
const CKeyStore& keystore;
std::vector<CKeyID>& vKeys;
public:
CAffectedKeysVisitor(const CKeyStore& keystoreIn, std::vector<CKeyID>& vKeysIn) : keystore(keystoreIn), vKeys(vKeysIn) {}
void Process(const CScript& script)
{
txnouttype type;
std::vector<CTxDestination> vDest;
int nRequired;
if (ExtractDestinations(script, type, vDest, nRequired)) {
for (const CTxDestination& dest : vDest)
boost::apply_visitor(*this, dest);
}
}
void operator()(const CKeyID& keyId)
{
if (keystore.HaveKey(keyId))
vKeys.push_back(keyId);
}
void operator()(const CScriptID& scriptId)
{
CScript script;
if (keystore.GetCScript(scriptId, script))
Process(script);
}
void operator()(const CNoDestination& none) {}
};
void CWallet::GetKeyBirthTimes(std::map<CKeyID, int64_t>& mapKeyBirth) const
{
AssertLockHeld(cs_wallet); // mapKeyMetadata
mapKeyBirth.clear();
// get birth times for keys with metadata
for (std::map<CKeyID, CKeyMetadata>::const_iterator it = mapKeyMetadata.begin(); it != mapKeyMetadata.end(); it++)
if (it->second.nCreateTime)
mapKeyBirth[it->first] = it->second.nCreateTime;
// map in which we'll infer heights of other keys
CBlockIndex* pindexMax = chainActive[std::max(0, chainActive.Height() - 144)]; // the tip can be reorganised; use a 144-block safety margin
std::map<CKeyID, CBlockIndex*> mapKeyFirstBlock;
std::set<CKeyID> setKeys;
GetKeys(setKeys);
for (const CKeyID& keyid : setKeys) {
if (mapKeyBirth.count(keyid) == 0)
mapKeyFirstBlock[keyid] = pindexMax;
}
setKeys.clear();
// if there are no such keys, we're done
if (mapKeyFirstBlock.empty())
return;
// find first block that affects those keys, if there are any left
std::vector<CKeyID> vAffected;
for (std::map<uint256, CWalletTx>::const_iterator it = mapWallet.begin(); it != mapWallet.end(); it++) {
// iterate over all wallet transactions...
const CWalletTx& wtx = (*it).second;
BlockMap::const_iterator blit = mapBlockIndex.find(wtx.hashBlock);
if (blit != mapBlockIndex.end() && chainActive.Contains(blit->second)) {
// ... which are already in a block
int nHeight = blit->second->nHeight;
for (const CTxOut& txout : wtx.vout) {
// iterate over all their outputs
CAffectedKeysVisitor(*this, vAffected).Process(txout.scriptPubKey);
for (const CKeyID& keyid : vAffected) {
// ... and all their affected keys
std::map<CKeyID, CBlockIndex*>::iterator rit = mapKeyFirstBlock.find(keyid);
if (rit != mapKeyFirstBlock.end() && nHeight < rit->second->nHeight)
rit->second = blit->second;
}
vAffected.clear();
}
}
}
// Extract block timestamps for those keys
for (std::map<CKeyID, CBlockIndex*>::const_iterator it = mapKeyFirstBlock.begin(); it != mapKeyFirstBlock.end(); it++)
mapKeyBirth[it->first] = it->second->GetBlockTime() - 7200; // block times can be 2h off
}
unsigned int CWallet::ComputeTimeSmart(const CWalletTx& wtx) const
{
unsigned int nTimeSmart = wtx.nTimeReceived;
if (wtx.hashBlock != 0) {
if (mapBlockIndex.count(wtx.hashBlock)) {
int64_t latestNow = wtx.nTimeReceived;
int64_t latestEntry = 0;
{
// Tolerate times up to the last timestamp in the wallet not more than 5 minutes into the future
int64_t latestTolerated = latestNow + 300;
TxItems txOrdered = wtxOrdered;
for (TxItems::reverse_iterator it = txOrdered.rbegin(); it != txOrdered.rend(); ++it) {
CWalletTx* const pwtx = (*it).second.first;
if (pwtx == &wtx)
continue;
CAccountingEntry* const pacentry = (*it).second.second;
int64_t nSmartTime;
if (pwtx) {
nSmartTime = pwtx->nTimeSmart;
if (!nSmartTime)
nSmartTime = pwtx->nTimeReceived;
} else
nSmartTime = pacentry->nTime;
if (nSmartTime <= latestTolerated) {
latestEntry = nSmartTime;
if (nSmartTime > latestNow)
latestNow = nSmartTime;
break;
}
}
}
int64_t blocktime = mapBlockIndex[wtx.hashBlock]->GetBlockTime();
nTimeSmart = std::max(latestEntry, std::min(blocktime, latestNow));
} else
LogPrintf("AddToWallet() : found %s in block %s not in index\n",
wtx.GetHash().ToString(),
wtx.hashBlock.ToString());
}
return nTimeSmart;
}
bool CWallet::AddDestData(const CTxDestination& dest, const std::string& key, const std::string& value)
{
if (boost::get<CNoDestination>(&dest))
return false;
mapAddressBook[dest].destdata.insert(std::make_pair(key, value));
if (!fFileBacked)
return true;
return CWalletDB(strWalletFile).WriteDestData(CBitcoinAddress(dest).ToString(), key, value);
}
bool CWallet::EraseDestData(const CTxDestination& dest, const std::string& key)
{
if (!mapAddressBook[dest].destdata.erase(key))
return false;
if (!fFileBacked)
return true;
return CWalletDB(strWalletFile).EraseDestData(CBitcoinAddress(dest).ToString(), key);
}
bool CWallet::LoadDestData(const CTxDestination& dest, const std::string& key, const std::string& value)
{
mapAddressBook[dest].destdata.insert(std::make_pair(key, value));
return true;
}
void CWallet::InitAutoConvertAddresses()
{
CWalletDB walletdb(strWalletFile);
walletdb.LoadAutoConvertKeys(setAutoConvertAddresses);
}
void CWallet::AutoZeromintForAddress()
{
std::map<CTxDestination, CAmount> mapBalances = GetAddressBalances();
std::map<CBitcoinAddress, std::vector<COutput> > mapAddressCoins = AvailableCoinsByAddress(true);
for (auto address : setAutoConvertAddresses) {
CTxDestination dest = address.Get();
if (!mapBalances.count(dest) || !mapAddressCoins.count(address))
continue;
CAmount nBalance = mapBalances.at(dest);
if (nBalance <= libzerocoin::ZQ_ONE*COIN)
continue;
CAmount nMintAmount = nBalance;
CAmount nChange = nMintAmount % COIN;
if (nChange == 0)
nChange = (99*CENT);
nMintAmount -= nChange;
CAmount nSelected = 0;
std::unique_ptr<CCoinControl> coinControl(new CCoinControl());
for (auto out : mapAddressCoins.at(address)) {
COutPoint outPoint(out.tx->GetHash(), out.i);
coinControl->Select(outPoint);
nSelected += out.tx->vout[out.i].nValue;
}
CreateAutoMintTransaction(nMintAmount, coinControl.get());
}
}
void CWallet::CreateAutoMintTransaction(const CAmount& nMintAmount, CCoinControl* coinControl)
{
if (nMintAmount > 0){
CWalletTx wtx;
std::vector<CDeterministicMint> vDMints;
LogPrintf("%s: autominting request amount %s\n", __func__, FormatMoney(nMintAmount));
std::string strError = pwalletMain->MintZerocoin(nMintAmount, wtx, vDMints, coinControl);
// Return if something went wrong during minting
if (strError != ""){
LogPrintf("CWallet::AutoZeromint(): auto minting failed with error: %s\n", strError);
return;
}
CAmount nZerocoinBalance = GetZerocoinBalance(false);
CAmount nBalance = GetUnlockedCoins();
CAmount dPercentage = 100 * (double)nZerocoinBalance / (double)(nZerocoinBalance + nBalance);
LogPrintf("CWallet::AutoZeromint() @ block %ld: successfully minted %ld zCREDIT. Current percentage of zCREDIT: %lf%%\n",
chainActive.Tip()->nHeight, nMintAmount, dPercentage);
// Re-adjust startup time to delay next Automint for 5 minutes
nStartupTime = GetAdjustedTime();
}
else {
LogPrintf("CWallet::AutoZeromint(): Nothing minted because either not enough funds available or the requested denomination size (%d) is not yet reached.\n", nPreferredDenom);
}
}
// CWallet::AutoZeromint() gets called with each new incoming block
void CWallet::AutoZeromint()
{
// Don't bother Autominting if Zerocoin Protocol isn't active
if (sporkManager.IsSporkActive(SPORK_16_ZEROCOIN_MAINTENANCE_MODE)) return;
// Wait until blockchain + masternodes are fully synced and wallet is unlocked.
if (IsInitialBlockDownload() || IsLocked()){
// Re-adjust startup time in case syncing needs a long time.
nStartupTime = GetAdjustedTime();
return;
}
// After sync wait even more to reduce load when wallet was just started
int64_t nWaitTime = GetAdjustedTime() - nStartupTime;
if (nWaitTime < AUTOMINT_DELAY){
LogPrint("zero", "CWallet::AutoZeromint(): time since sync-completion or last Automint (%ld sec) < default waiting time (%ld sec). Waiting again...\n", nWaitTime, AUTOMINT_DELAY);
return;
}
// Process Auto Convert Addresses First
if (fEnableAutoConvert)
AutoZeromintForAddress();
if (!fEnableZeromint)
return;
CAmount nZerocoinBalance = GetZerocoinBalance(false); //false includes both pending and mature zerocoins. Need total balance for this so nothing is overminted.
CAmount nBalance = GetUnlockedCoins(); // We only consider unlocked coins, this also excludes masternode-vins
// from being accidentally minted
CAmount nMintAmount = 0;
CAmount nToMintAmount = 0;
// zCREDIT are integers > 0, so we can't mint 10% of 9 CREDIT
if (nBalance < 10){
LogPrint("zero", "CWallet::AutoZeromint(): available balance (%ld) too small for minting zCREDIT\n", nBalance);
return;
}
// Percentage of zCREDIT we already have
double dPercentage = 100 * (double)nZerocoinBalance / (double)(nZerocoinBalance + nBalance);
// Check if minting is actually needed
if(dPercentage >= nZeromintPercentage){
LogPrint("zero", "CWallet::AutoZeromint() @block %ld: percentage of existing zCREDIT (%lf%%) already >= configured percentage (%d%%). No minting needed...\n",
chainActive.Tip()->nHeight, dPercentage, nZeromintPercentage);
return;
}
// zCREDIT amount needed for the target percentage
nToMintAmount = ((nZerocoinBalance + nBalance) * nZeromintPercentage / 100);
// zCREDIT amount missing from target (must be minted)
nToMintAmount = (nToMintAmount - nZerocoinBalance) / COIN;
// Use the biggest denomination smaller than the needed zCREDIT We'll only mint exact denomination to make minting faster.
// Exception: for big amounts use 6666 (6666 = 1*5000 + 1*1000 + 1*500 + 1*100 + 1*50 + 1*10 + 1*5 + 1) to create all
// possible denominations to avoid having 5000 denominations only.
// If a preferred denomination is used (means nPreferredDenom != 0) do nothing until we have enough CREDIT to mint this denomination
if (nPreferredDenom > 0){
if (nToMintAmount >= nPreferredDenom)
nToMintAmount = nPreferredDenom; // Enough coins => mint preferred denomination
else
nToMintAmount = 0; // Not enough coins => do nothing and wait for more coins
}
if (nToMintAmount >= ZQ_6666){
nMintAmount = ZQ_6666;
} else if (nToMintAmount >= libzerocoin::CoinDenomination::ZQ_FIVE_THOUSAND){
nMintAmount = libzerocoin::CoinDenomination::ZQ_FIVE_THOUSAND;
} else if (nToMintAmount >= libzerocoin::CoinDenomination::ZQ_ONE_THOUSAND){
nMintAmount = libzerocoin::CoinDenomination::ZQ_ONE_THOUSAND;
} else if (nToMintAmount >= libzerocoin::CoinDenomination::ZQ_FIVE_HUNDRED){
nMintAmount = libzerocoin::CoinDenomination::ZQ_FIVE_HUNDRED;
} else if (nToMintAmount >= libzerocoin::CoinDenomination::ZQ_ONE_HUNDRED){
nMintAmount = libzerocoin::CoinDenomination::ZQ_ONE_HUNDRED;
} else if (nToMintAmount >= libzerocoin::CoinDenomination::ZQ_FIFTY){
nMintAmount = libzerocoin::CoinDenomination::ZQ_FIFTY;
} else if (nToMintAmount >= libzerocoin::CoinDenomination::ZQ_TEN){
nMintAmount = libzerocoin::CoinDenomination::ZQ_TEN;
} else if (nToMintAmount >= libzerocoin::CoinDenomination::ZQ_FIVE){
nMintAmount = libzerocoin::CoinDenomination::ZQ_FIVE;
} else if (nToMintAmount >= libzerocoin::CoinDenomination::ZQ_ONE){
nMintAmount = libzerocoin::CoinDenomination::ZQ_ONE;
} else {
nMintAmount = 0;
}
CreateAutoMintTransaction(nMintAmount*COIN);
}
void CWallet::AutoCombineDust()
{
LOCK2(cs_main, cs_wallet);
const CBlockIndex* tip = chainActive.Tip();
if (tip->nTime < (GetAdjustedTime() - 300) || IsLocked()) {
return;
}
std::map<CBitcoinAddress, std::vector<COutput> > mapCoinsByAddress = AvailableCoinsByAddress(true, nAutoCombineThreshold * COIN);
//coins are sectioned by address. This combination code only wants to combine inputs that belong to the same address
for (std::map<CBitcoinAddress, std::vector<COutput> >::iterator it = mapCoinsByAddress.begin(); it != mapCoinsByAddress.end(); it++) {
std::vector<COutput> vCoins, vRewardCoins;
bool maxSize = false;
vCoins = it->second;
// We don't want the tx to be refused for being too large
// we use 50 bytes as a base tx size (2 output: 2*34 + overhead: 10 -> 90 to be certain)
unsigned int txSizeEstimate = 90;
//find masternode rewards that need to be combined
CCoinControl* coinControl = new CCoinControl();
CAmount nTotalRewardsValue = 0;
for (const COutput& out : vCoins) {
if (!out.fSpendable)
continue;
//no coins should get this far if they dont have proper maturity, this is double checking
if (out.tx->IsCoinStake() && out.tx->GetDepthInMainChain() < Params().COINBASE_MATURITY() + 1)
continue;
// no p2cs accepted, those coins are "locked"
if (out.tx->vout[out.i].scriptPubKey.IsPayToColdStaking())
continue;
COutPoint outpt(out.tx->GetHash(), out.i);
coinControl->Select(outpt);
vRewardCoins.push_back(out);
nTotalRewardsValue += out.Value();
// Combine to the threshold and not way above
if (nTotalRewardsValue > nAutoCombineThreshold * COIN)
break;
// Around 180 bytes per input. We use 190 to be certain
txSizeEstimate += 190;
if (txSizeEstimate >= MAX_STANDARD_TX_SIZE - 200) {
maxSize = true;
break;
}
}
//if no inputs found then return
if (!coinControl->HasSelected())
continue;
//we cannot combine one coin with itself
if (vRewardCoins.size() <= 1)
continue;
std::vector<std::pair<CScript, CAmount> > vecSend;
CScript scriptPubKey = GetScriptForDestination(it->first.Get());
vecSend.push_back(std::make_pair(scriptPubKey, nTotalRewardsValue));
//Send change to same address
CTxDestination destMyAddress;
if (!ExtractDestination(scriptPubKey, destMyAddress)) {
LogPrintf("AutoCombineDust: failed to extract destination\n");
continue;
}
coinControl->destChange = destMyAddress;
// Create the transaction and commit it to the network
CWalletTx wtx;
CReserveKey keyChange(this); // this change address does not end up being used, because change is returned with coin control switch
std::string strErr;
CAmount nFeeRet = 0;
// 10% safety margin to avoid "Insufficient funds" errors
vecSend[0].second = nTotalRewardsValue - (nTotalRewardsValue / 10);
if (!CreateTransaction(vecSend, wtx, keyChange, nFeeRet, strErr, coinControl, ALL_COINS, false, CAmount(0))) {
LogPrintf("AutoCombineDust createtransaction failed, reason: %s\n", strErr);
continue;
}
//we don't combine below the threshold unless the fees are 0 to avoid paying fees over fees over fees
if (!maxSize && nTotalRewardsValue < nAutoCombineThreshold * COIN && nFeeRet > 0)
continue;
if (!CommitTransaction(wtx, keyChange)) {
LogPrintf("AutoCombineDust transaction commit failed\n");
continue;
}
LogPrintf("AutoCombineDust sent transaction\n");
delete coinControl;
}
}
bool CWallet::MultiSend()
{
LOCK2(cs_main, cs_wallet);
// Stop the old blocks from sending multisends
const CBlockIndex* tip = chainActive.Tip();
int chainTipHeight = tip->nHeight;
if (tip->nTime < (GetAdjustedTime() - 300) || IsLocked()) {
return false;
}
if (chainTipHeight <= nLastMultiSendHeight) {
LogPrintf("Multisend: lastmultisendheight is higher than current best height\n");
return false;
}
std::vector<COutput> vCoins;
AvailableCoins(vCoins);
bool stakeSent = false;
bool mnSent = false;
for (const COutput& out : vCoins) {
//need output with precise confirm count - this is how we identify which is the output to send
if (out.tx->GetDepthInMainChain() != Params().COINBASE_MATURITY() + 1)
continue;
COutPoint outpoint(out.tx->GetHash(), out.i);
bool sendMSonMNReward = fMultiSendMasternodeReward && outpoint.IsMasternodeReward(out.tx);
bool sendMSOnStake = fMultiSendStake && out.tx->IsCoinStake() && !sendMSonMNReward; //output is either mnreward or stake reward, not both
if (!(sendMSOnStake || sendMSonMNReward))
continue;
CTxDestination destMyAddress;
if (!ExtractDestination(out.tx->vout[out.i].scriptPubKey, destMyAddress)) {
LogPrintf("Multisend: failed to extract destination\n");
continue;
}
//Disabled Addresses won't send MultiSend transactions
if (vDisabledAddresses.size() > 0) {
for (unsigned int i = 0; i < vDisabledAddresses.size(); i++) {
if (vDisabledAddresses[i] == CBitcoinAddress(destMyAddress).ToString()) {
LogPrintf("Multisend: disabled address preventing multisend\n");
return false;
}
}
}
// create new coin control, populate it with the selected utxo, create sending vector
CCoinControl cControl;
COutPoint outpt(out.tx->GetHash(), out.i);
cControl.Select(outpt);
cControl.destChange = destMyAddress;
CWalletTx wtx;
CReserveKey keyChange(this); // this change address does not end up being used, because change is returned with coin control switch
CAmount nFeeRet = 0;
std::vector<std::pair<CScript, CAmount> > vecSend;
// loop through multisend vector and add amounts and addresses to the sending vector
const isminefilter filter = ISMINE_SPENDABLE;
CAmount nAmount = 0;
for (unsigned int i = 0; i < vMultiSend.size(); i++) {
// MultiSend vector is a pair of 1)Address as a std::string 2) Percent of stake to send as an int
nAmount = ((out.tx->GetCredit(filter) - out.tx->GetDebit(filter)) * vMultiSend[i].second) / 100;
CBitcoinAddress strAddSend(vMultiSend[i].first);
CScript scriptPubKey;
scriptPubKey = GetScriptForDestination(strAddSend.Get());
vecSend.push_back(std::make_pair(scriptPubKey, nAmount));
}
//get the fee amount
CWalletTx wtxdummy;
std::string strErr;
CreateTransaction(vecSend, wtxdummy, keyChange, nFeeRet, strErr, &cControl, ALL_COINS, false, CAmount(0));
CAmount nLastSendAmount = vecSend[vecSend.size() - 1].second;
if (nLastSendAmount < nFeeRet + 500) {
LogPrintf("%s: fee of %d is too large to insert into last output\n", __func__, nFeeRet + 500);
return false;
}
vecSend[vecSend.size() - 1].second = nLastSendAmount - nFeeRet - 500;
// Create the transaction and commit it to the network
if (!CreateTransaction(vecSend, wtx, keyChange, nFeeRet, strErr, &cControl, ALL_COINS, false, CAmount(0))) {
LogPrintf("MultiSend createtransaction failed\n");
return false;
}
if (!CommitTransaction(wtx, keyChange)) {
LogPrintf("MultiSend transaction commit failed\n");
return false;
} else
fMultiSendNotify = true;
//write nLastMultiSendHeight to DB
CWalletDB walletdb(strWalletFile);
nLastMultiSendHeight = chainActive.Tip()->nHeight;
if (!walletdb.WriteMSettings(fMultiSendStake, fMultiSendMasternodeReward, nLastMultiSendHeight))
LogPrintf("Failed to write MultiSend setting to DB\n");
LogPrintf("MultiSend successfully sent\n");
//set which MultiSend triggered
if (sendMSOnStake)
stakeSent = true;
else
mnSent = true;
//stop iterating if we have sent out all the MultiSend(s)
if ((stakeSent && mnSent) || (stakeSent && !fMultiSendMasternodeReward) || (mnSent && !fMultiSendStake))
return true;
}
return true;
}
CKeyPool::CKeyPool()
{
nTime = GetTime();
}
CKeyPool::CKeyPool(const CPubKey& vchPubKeyIn)
{
nTime = GetTime();
vchPubKey = vchPubKeyIn;
}
CWalletKey::CWalletKey(int64_t nExpires)
{
nTimeCreated = (nExpires ? GetTime() : 0);
nTimeExpires = nExpires;
}
int CMerkleTx::SetMerkleBranch(const CBlock& block)
{
AssertLockHeld(cs_main);
CBlock blockTmp;
// Update the tx's hashBlock
hashBlock = block.GetHash();
// Locate the transaction
for (nIndex = 0; nIndex < (int)block.vtx.size(); nIndex++)
if (block.vtx[nIndex] == *(CTransaction*)this)
break;
if (nIndex == (int)block.vtx.size()) {
nIndex = -1;
LogPrintf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
return 0;
}
// Is the tx in a block that's in the main chain
BlockMap::iterator mi = mapBlockIndex.find(hashBlock);
if (mi == mapBlockIndex.end())
return 0;
const CBlockIndex* pindex = (*mi).second;
if (!pindex || !chainActive.Contains(pindex))
return 0;
return chainActive.Height() - pindex->nHeight + 1;
}
int CMerkleTx::GetDepthInMainChain(const CBlockIndex*& pindexRet, bool enableIX) const
{
if (hashUnset())
return 0;
AssertLockHeld(cs_main);
int nResult;
// Find the block it claims to be in
BlockMap::iterator mi = mapBlockIndex.find(hashBlock);
if (mi == mapBlockIndex.end()) {
nResult = 0;
}
else {
CBlockIndex* pindex = (*mi).second;
if (!pindex || !chainActive.Contains(pindex)) {
nResult = 0;
}
else {
pindexRet = pindex;
nResult = ((nIndex == -1) ? (-1) : 1) * (chainActive.Height() - pindex->nHeight + 1);
}
}
if (enableIX) {
if (nResult < 6) {
int signatures = GetTransactionLockSignatures();
if (signatures >= SWIFTTX_SIGNATURES_REQUIRED) {
return nSwiftTXDepth + nResult;
}
}
}
return nResult;
}
int CMerkleTx::GetBlocksToMaturity() const
{
LOCK(cs_main);
if (!(IsCoinBase() || IsCoinStake()))
return 0;
return std::max(0, (Params().COINBASE_MATURITY() + 1) - GetDepthInMainChain());
}
bool CMerkleTx::AcceptToMemoryPool(bool fLimitFree, bool fRejectInsaneFee, bool ignoreFees)
{
CValidationState state;
bool fAccepted = ::AcceptToMemoryPool(mempool, state, *this, fLimitFree, NULL, fRejectInsaneFee, ignoreFees);
if (!fAccepted)
LogPrintf("%s : %s\n", __func__, state.GetRejectReason());
return fAccepted;
}
int CMerkleTx::GetTransactionLockSignatures() const
{
if (fLargeWorkForkFound || fLargeWorkInvalidChainFound) return -2;
if (!sporkManager.IsSporkActive(SPORK_2_SWIFTTX)) return -3;
if (!fEnableSwiftTX) return -1;
//compile consessus vote
std::map<uint256, CTransactionLock>::iterator i = mapTxLocks.find(GetHash());
if (i != mapTxLocks.end()) {
return (*i).second.CountSignatures();
}
return -1;
}
bool CMerkleTx::IsTransactionLockTimedOut() const
{
if (!fEnableSwiftTX) return 0;
//compile consessus vote
std::map<uint256, CTransactionLock>::iterator i = mapTxLocks.find(GetHash());
if (i != mapTxLocks.end()) {
return GetTime() > (*i).second.nTimeout;
}
return false;
}
// Given a set of inputs, find the public key that contributes the most coins to the input set
CScript GetLargestContributor(std::set<std::pair<const CWalletTx*, unsigned int> >& setCoins)
{
std::map<CScript, CAmount> mapScriptsOut;
for (const std::pair<const CWalletTx*, unsigned int>& coin : setCoins) {
CTxOut out = coin.first->vout[coin.second];
mapScriptsOut[out.scriptPubKey] += out.nValue;
}
CScript scriptLargest;
CAmount nLargestContributor = 0;
for (auto it : mapScriptsOut) {
if (it.second > nLargestContributor) {
scriptLargest = it.first;
nLargestContributor = it.second;
}
}
return scriptLargest;
}
bool CWallet::GetZerocoinKey(const CBigNum& bnSerial, CKey& key)
{
CWalletDB walletdb(strWalletFile);
CZerocoinMint mint;
if (!GetMint(GetSerialHash(bnSerial), mint))
return error("%s: could not find serial %s in walletdb!", __func__, bnSerial.GetHex());
return mint.GetKeyPair(key);
}
bool CWallet::CreateZCREDITOutPut(libzerocoin::CoinDenomination denomination, CTxOut& outMint, CDeterministicMint& dMint)
{
// mint a new coin (create Pedersen Commitment) and extract PublicCoin that is shareable from it
libzerocoin::PrivateCoin coin(Params().Zerocoin_Params(false), denomination, false);
zwalletMain->GenerateDeterministicZCREDIT(denomination, coin, dMint);
libzerocoin::PublicCoin pubCoin = coin.getPublicCoin();
// Validate
if(!pubCoin.validate())
return error("%s: newly created pubcoin is not valid", __func__);
zwalletMain->UpdateCount();
CScript scriptSerializedCoin = CScript() << OP_ZEROCOINMINT << pubCoin.getValue().getvch().size() << pubCoin.getValue().getvch();
outMint = CTxOut(libzerocoin::ZerocoinDenominationToAmount(denomination), scriptSerializedCoin);
return true;
}
bool CWallet::CreateZerocoinMintTransaction(const CAmount nValue, CMutableTransaction& txNew, std::vector<CDeterministicMint>& vDMints, CReserveKey* reservekey, int64_t& nFeeRet, std::string& strFailReason, const CCoinControl* coinControl, const bool isZCSpendChange)
{
if (IsLocked()) {
strFailReason = _("Error: Wallet locked, unable to create transaction!");
LogPrintf("SpendZerocoin() : %s", strFailReason.c_str());
return false;
}
//add multiple mints that will fit the amount requested as closely as possible
CAmount nMintingValue = 0;
CAmount nValueRemaining = 0;
while (true) {
//mint a coin with the closest denomination to what is being requested
nFeeRet = std::max(static_cast<int>(txNew.vout.size()), 1) * Params().Zerocoin_MintFee();
nValueRemaining = nValue - nMintingValue - (isZCSpendChange ? nFeeRet : 0);
// if this is change of a zerocoinspend, then we can't mint all change, at least something must be given as a fee
if (isZCSpendChange && nValueRemaining <= 1 * COIN)
break;
libzerocoin::CoinDenomination denomination = libzerocoin::AmountToClosestDenomination(nValueRemaining, nValueRemaining);
if (denomination == libzerocoin::ZQ_ERROR)
break;
CAmount nValueNewMint = libzerocoin::ZerocoinDenominationToAmount(denomination);
nMintingValue += nValueNewMint;
CTxOut outMint;
CDeterministicMint dMint;
if (!CreateZCREDITOutPut(denomination, outMint, dMint)) {
strFailReason = strprintf("%s: failed to create new zcredit output", __func__);
return error(strFailReason.c_str());
}
txNew.vout.push_back(outMint);
//store as CZerocoinMint for later use
LogPrint("zero", "%s: new mint %s\n", __func__, dMint.ToString());
vDMints.emplace_back(dMint);
}
// calculate fee
CAmount nFee = Params().Zerocoin_MintFee() * txNew.vout.size();
// no ability to select more coins if this is a ZCSpend change mint
CAmount nTotalValue = (isZCSpendChange ? nValue : (nValue + nFee));
// check for a zerocoinspend that mints the change
CAmount nValueIn = 0;
std::set<std::pair<const CWalletTx*, unsigned int> > setCoins;
if (isZCSpendChange) {
nValueIn = nValue;
} else {
// select UTXO's to use
if (!SelectCoins(nTotalValue, setCoins, nValueIn, coinControl)) {
strFailReason = _("Insufficient or insufficient confirmed funds, you might need to wait a few minutes and try again.");
return false;
}
// Fill vin
for (const std::pair<const CWalletTx*, unsigned int>& coin : setCoins)
txNew.vin.push_back(CTxIn(coin.first->GetHash(), coin.second));
}
//any change that is less than 0.0100000 will be ignored and given as an extra fee
//also assume that a zerocoinspend that is minting the change will not have any change that goes to Credit
CAmount nChange = nValueIn - nTotalValue; // Fee already accounted for in nTotalValue
if (nChange > 1 * CENT && !isZCSpendChange) {
// Fill a vout to ourself using the largest contributing address
CScript scriptChange = GetLargestContributor(setCoins);
//add to the transaction
CTxOut outChange(nChange, scriptChange);
txNew.vout.push_back(outChange);
} else {
if (reservekey)
reservekey->ReturnKey();
}
// Sign if these are terracredit outputs - NOTE that zCREDIT outputs are signed later in SoK
if (!isZCSpendChange) {
int nIn = 0;
for (const std::pair<const CWalletTx*, unsigned int>& coin : setCoins) {
if (!SignSignature(*this, *coin.first, txNew, nIn++)) {
strFailReason = _("Signing transaction failed");
return false;
}
}
}
return true;
}
bool CWallet::CheckCoinSpend(libzerocoin::CoinSpend& spend, libzerocoin::Accumulator& accumulator, CZerocoinSpendReceipt& receipt)
{
if (!spend.Verify(accumulator)) {
receipt.SetStatus(_("The transaction did not verify"), ZCREDIT_BAD_SERIALIZATION);
return error("%s : The transaction did not verify", __func__);
}
if (Params().NetworkID() != CBaseChainParams::REGTEST && IsSerialKnown(spend.getCoinSerialNumber())) {
//Tried to spend an already spent zCREDIT
receipt.SetStatus(_("The coin spend has been used"), ZCREDIT_SPENT_USED_ZCREDIT);
uint256 hashSerial = GetSerialHash(spend.getCoinSerialNumber());
if(!zcreditTracker->HasSerialHash(hashSerial))
return error("%s: serialhash %s not found in tracker", __func__, hashSerial.GetHex());
CMintMeta meta = zcreditTracker->Get(hashSerial);
meta.isUsed = true;
if (!zcreditTracker->UpdateState(meta))
LogPrintf("%s: failed to write zerocoinmint\n", __func__);
return false;
}
return true;
}
bool CWallet::MintToTxIn(
CZerocoinMint mint,
const uint256& hashTxOut,
CTxIn& newTxIn,
CZerocoinSpendReceipt& receipt,
libzerocoin::SpendType spendType,
CBlockIndex* pindexCheckpoint,
bool publicCoinSpend)
{
std::map<CBigNum, CZerocoinMint> mapMints;
mapMints.insert(std::make_pair(mint.GetValue(), mint));
std::vector<CTxIn> vin;
if (publicCoinSpend) {
if (MintsToInputVectorPublicSpend(mapMints, hashTxOut, vin, receipt, spendType, pindexCheckpoint)) {
newTxIn = vin[0];
return true;
}
} else {
if (MintsToInputVector(mapMints, hashTxOut, vin, receipt, spendType, pindexCheckpoint)) {
newTxIn = vin[0];
return true;
}
}
return false;
}
bool CWallet::MintsToInputVector(std::map<CBigNum, CZerocoinMint>& mapMintsSelected, const uint256& hashTxOut, std::vector<CTxIn>& vin,
CZerocoinSpendReceipt& receipt, libzerocoin::SpendType spendType, CBlockIndex* pindexCheckpoint)
{
// Default error status if not changed below
receipt.SetStatus(_("Transaction Mint Started"), ZCREDIT_TXMINT_GENERAL);
libzerocoin::ZerocoinParams* paramsAccumulator = Params().Zerocoin_Params(false);
AccumulatorMap mapAccumulators(paramsAccumulator);
int64_t nTimeStart = GetTimeMicros();
int nLockAttempts = 0;
while (nLockAttempts < 100) {
TRY_LOCK(zcreditTracker->cs_spendcache, lockSpendcache);
if (!lockSpendcache) {
fGlobalUnlockSpendCache = true;
MilliSleep(100);
++nLockAttempts;
continue;
}
for (auto &it : mapMintsSelected) {
CZerocoinMint mint = it.second;
CMintMeta meta = zcreditTracker->Get(GetSerialHash(mint.GetSerialNumber()));
CoinWitnessData *coinWitness = zcreditTracker->GetSpendCache(meta.hashStake);
if (!coinWitness->nHeightAccEnd) {
*coinWitness = CoinWitnessData(mint);
coinWitness->SetHeightMintAdded(mint.GetHeight());
}
// Generate the witness for each mint being spent
if (!GenerateAccumulatorWitness(coinWitness, mapAccumulators, pindexCheckpoint)) {
receipt.SetStatus(_("Couldn't generate the accumulator witness"),
ZCREDIT_FAILED_ACCUMULATOR_INITIALIZATION);
return error("%s : %s", __func__, receipt.GetStatusMessage());
}
// Construct the CoinSpend object. This acts like a signature on the transaction.
int64_t nTime1 = GetTimeMicros();
libzerocoin::ZerocoinParams *paramsCoin = Params().Zerocoin_Params(coinWitness->isV1);
libzerocoin::PrivateCoin privateCoin(paramsCoin, coinWitness->denom);
privateCoin.setPublicCoin(*coinWitness->coin);
privateCoin.setRandomness(mint.GetRandomness());
privateCoin.setSerialNumber(mint.GetSerialNumber());
int64_t nTime2 = GetTimeMicros();
LogPrint("bench", " - CoinSpend constructed in %.2fms\n", 0.001 * (nTime2 - nTime1));
//Version 2 zerocoins have a privkey associated with them
uint8_t nVersion = mint.GetVersion();
privateCoin.setVersion(mint.GetVersion());
if (nVersion >= libzerocoin::PrivateCoin::PUBKEY_VERSION) {
CKey key;
if (!mint.GetKeyPair(key))
return error("%s: failed to set zCREDIT privkey mint version=%d", __func__, nVersion);
privateCoin.setPrivKey(key.GetPrivKey());
}
int64_t nTime3 = GetTimeMicros();
LogPrint("bench", " - Signing key set in %.2fms\n", 0.001 * (nTime3 - nTime2));
libzerocoin::Accumulator accumulator = mapAccumulators.GetAccumulator(coinWitness->denom);
uint32_t nChecksum = GetChecksum(accumulator.getValue());
CBigNum bnValue;
if (!GetAccumulatorValueFromChecksum(nChecksum, false, bnValue) || bnValue == 0)
return error("%s: could not find checksum used for spend\n", __func__);
int64_t nTime4 = GetTimeMicros();
LogPrint("bench", " - Accumulator value fetched in %.2fms\n", 0.001 * (nTime4 - nTime3));
try {
libzerocoin::CoinSpend spend(paramsCoin, paramsAccumulator, privateCoin, accumulator, nChecksum,
*coinWitness->pWitness, hashTxOut, spendType);
if (!CheckCoinSpend(spend, accumulator, receipt)) {
receipt.SetStatus(_("CoinSpend: failed check"), ZCREDIT_SPEND_ERROR);
return error("%s : %s", __func__, receipt.GetStatusMessage());
}
vin.emplace_back(CTxIn(spend, coinWitness->denom));
CZerocoinSpend zcSpend(spend.getCoinSerialNumber(), 0, mint.GetValue(), mint.GetDenomination(),
GetChecksum(accumulator.getValue()));
zcSpend.SetMintCount(coinWitness->nMintsAdded);
receipt.AddSpend(zcSpend);
int64_t nTime5 = GetTimeMicros();
LogPrint("bench", " - CoinSpend verified in %.2fms\n", 0.001 * (nTime5 - nTime4));
} catch (const std::exception&) {
receipt.SetStatus(_("CoinSpend: Accumulator witness does not verify"), ZCREDIT_INVALID_WITNESS);
return error("%s : %s", __func__, receipt.GetStatusMessage());
}
}
break;
}
if (nLockAttempts == 100) {
LogPrintf("%s : could not get lock on cs_spendcache\n", __func__);
receipt.SetStatus(_("could not get lock on cs_spendcache"), ZCREDIT_TXMINT_GENERAL);
return false;
}
int64_t nTimeFinished = GetTimeMicros();
LogPrint("bench", " - %s took %.2fms [%.3fms/spend]\n", __func__, 0.001 * (nTimeFinished - nTimeStart), 0.001 * (nTimeFinished - nTimeStart) / mapMintsSelected.size());
receipt.SetStatus(_("Spend Valid"), ZCREDIT_SPEND_OKAY); // Everything okay
return true;
}
bool CWallet::MintsToInputVectorPublicSpend(std::map<CBigNum, CZerocoinMint>& mapMintsSelected, const uint256& hashTxOut, std::vector<CTxIn>& vin,
CZerocoinSpendReceipt& receipt, libzerocoin::SpendType spendType, CBlockIndex* pindexCheckpoint)
{
// Default error status if not changed below
receipt.SetStatus(_("Transaction Mint Started"), ZCREDIT_TXMINT_GENERAL);
// Get the chain tip to determine the active public spend version
int nHeight = 0;
{
LOCK(cs_main);
nHeight = chainActive.Height();
}
if (!nHeight)
return error("%s: Unable to get chain tip height", __func__);
int spendVersion = CurrentPublicCoinSpendVersion();
int nLockAttempts = 0;
while (nLockAttempts < 100) {
TRY_LOCK(zcreditTracker->cs_spendcache, lockSpendcache);
if (!lockSpendcache) {
fGlobalUnlockSpendCache = true;
MilliSleep(100);
++nLockAttempts;
continue;
}
for (auto &it : mapMintsSelected) {
CZerocoinMint mint = it.second;
// Create the simple input and the scriptSig -> Serial + Randomness + Private key signature of both.
// As the mint doesn't have the output index search it..
CTransaction txMint;
uint256 hashBlock;
if (!GetTransaction(mint.GetTxHash(), txMint, hashBlock)) {
receipt.SetStatus(strprintf(_("Unable to find transaction containing mint %s"), mint.GetTxHash().GetHex()), ZCREDIT_TXMINT_GENERAL);
return false;
} else if (mapBlockIndex.count(hashBlock) < 1) {
// check that this mint made it into the blockchain
receipt.SetStatus(_("Mint did not make it into blockchain"), ZCREDIT_TXMINT_GENERAL);
return false;
}
int outputIndex = -1;
for (unsigned long i = 0; i < txMint.vout.size(); ++i) {
CTxOut out = txMint.vout[i];
if (out.scriptPubKey.IsZerocoinMint()){
libzerocoin::PublicCoin pubcoin(Params().Zerocoin_Params(false));
CValidationState state;
if (!TxOutToPublicCoin(out, pubcoin, state))
return error("%s: extracting pubcoin from txout failed", __func__);
if (pubcoin.getValue() == mint.GetValue()){
outputIndex = i;
break;
}
}
}
if (outputIndex == -1) {
receipt.SetStatus(_("Pubcoin not found in mint tx"), ZCREDIT_TXMINT_GENERAL);
return false;
}
mint.SetOutputIndex(outputIndex);
CTxIn in;
if(!ZCREDITModule::createInput(in, mint, hashTxOut, spendVersion)) {
receipt.SetStatus(_("Cannot create public spend input"), ZCREDIT_TXMINT_GENERAL);
return false;
}
vin.emplace_back(in);
receipt.AddSpend(CZerocoinSpend(mint.GetSerialNumber(), 0, mint.GetValue(), mint.GetDenomination(), 0));
}
break;
}
if (nLockAttempts == 100) {
LogPrintf("%s : could not get lock on cs_spendcache\n", __func__);
receipt.SetStatus(_("could not get lock on cs_spendcache"), ZCREDIT_TXMINT_GENERAL);
return false;
}
receipt.SetStatus(_("Spend Valid"), ZCREDIT_SPEND_OKAY); // Everything okay
return true;
}
bool CWallet::CreateZerocoinSpendTransaction(
CAmount nValue,
CWalletTx& wtxNew,
CReserveKey& reserveKey,
CZerocoinSpendReceipt& receipt,
std::vector<CZerocoinMint>& vSelectedMints,
std::vector<CDeterministicMint>& vNewMints,
bool fMintChange,
bool fMinimizeChange,
std::list<std::pair<CBitcoinAddress*,CAmount>> addressesTo,
CBitcoinAddress* changeAddress,
bool isPublicSpend)
{
// Check available funds
int nStatus = ZCREDIT_TRX_FUNDS_PROBLEMS;
if (nValue > GetZerocoinBalance(true)) {
receipt.SetStatus(_("You don't have enough Zerocoins in your wallet"), nStatus);
return false;
}
if (nValue < 1) {
receipt.SetStatus(_("Value is below the smallest available denomination (= 1) of zCREDIT"), nStatus);
return false;
}
// Create transaction
nStatus = ZCREDIT_TRX_CREATE;
// If not already given pre-selected mints, then select mints from the wallet
CWalletDB walletdb(pwalletMain->strWalletFile);
std::set<CMintMeta> setMints;
CAmount nValueSelected = 0;
int nCoinsReturned = 0; // Number of coins returned in change from function below (for debug)
int nNeededSpends = 0; // Number of spends which would be needed if selection failed
const int nMaxSpends = Params().Zerocoin_MaxPublicSpendsPerTransaction(); // Maximum possible spends for one zCREDIT public spend transaction
std::vector<CMintMeta> vMintsToFetch;
if (vSelectedMints.empty()) {
// All of the zCREDIT used in the public coin spend are mature by default (everything is public now.. no need to wait for any accumulation)
setMints = zcreditTracker->ListMints(true, false, true, true); // need to find mints to spend
if(setMints.empty()) {
receipt.SetStatus(_("Failed to find Zerocoins in wallet.dat"), nStatus);
return false;
}
// If the input value is not an int, then we want the selection algorithm to round up to the next highest int
double dValue = static_cast<double>(nValue) / static_cast<double>(COIN);
bool fWholeNumber = floor(dValue) == dValue;
CAmount nValueToSelect = nValue;
if(!fWholeNumber)
nValueToSelect = static_cast<CAmount>(ceil(dValue) * COIN);
// Select the zCREDIT mints to use in this spend
std::map<libzerocoin::CoinDenomination, CAmount> DenomMap = GetMyZerocoinDistribution();
std::list<CMintMeta> listMints(setMints.begin(), setMints.end());
vMintsToFetch = SelectMintsFromList(nValueToSelect, nValueSelected, nMaxSpends, fMinimizeChange,
nCoinsReturned, listMints, DenomMap, nNeededSpends);
for (auto& meta : vMintsToFetch) {
CZerocoinMint mint;
if (!GetMint(meta.hashSerial, mint))
return error("%s: failed to fetch hashSerial %s", __func__, meta.hashSerial.GetHex());
vSelectedMints.emplace_back(mint);
}
} else {
unsigned int mintsCount = 0;
for (const CZerocoinMint& mint : vSelectedMints) {
if (nValueSelected < nValue) {
nValueSelected += ZerocoinDenominationToAmount(mint.GetDenomination());
mintsCount ++;
}
else
break;
}
if (mintsCount < vSelectedMints.size()) {
vSelectedMints.resize(mintsCount);
}
}
int nArchived = 0;
for (CZerocoinMint mint : vSelectedMints) {
// see if this serial has already been spent
int nHeightSpend;
if (IsSerialInBlockchain(mint.GetSerialNumber(), nHeightSpend)) {
receipt.SetStatus(_("Trying to spend an already spent serial #, try again."), nStatus);
uint256 hashSerial = GetSerialHash(mint.GetSerialNumber());
if (!zcreditTracker->HasSerialHash(hashSerial))
return error("%s: tracker does not have serialhash %s", __func__, hashSerial.GetHex());
CMintMeta meta = zcreditTracker->Get(hashSerial);
meta.isUsed = true;
zcreditTracker->UpdateState(meta);
return false;
}
//check that this mint made it into the blockchain
CTransaction txMint;
uint256 hashBlock;
bool fArchive = false;
if (!GetTransaction(mint.GetTxHash(), txMint, hashBlock)) {
receipt.SetStatus(strprintf(_("Unable to find transaction containing mint, txHash: %s"), mint.GetTxHash().GetHex()), nStatus);
fArchive = true;
} else if (mapBlockIndex.count(hashBlock) < 1) {
receipt.SetStatus(_("Mint did not make it into blockchain"), nStatus);
fArchive = true;
}
// archive this mint as an orphan
if (fArchive) {
//walletdb.ArchiveMintOrphan(mint);
//nArchived++;
//todo
}
}
if (nArchived)
return false;
if (vSelectedMints.empty()) {
if(nNeededSpends > 0){
// Too much spends needed, so abuse nStatus to report back the number of needed spends
receipt.SetStatus(_("Too many spends needed"), nStatus, nNeededSpends);
}
else {
receipt.SetStatus(_("Failed to select a zerocoin"), nStatus);
}
return false;
}
if (static_cast<int>(vSelectedMints.size()) > nMaxSpends) {
receipt.SetStatus(_("Failed to find coin set amongst held coins with less than maxNumber of Spends"), nStatus);
return false;
}
// Create change if needed
nStatus = ZCREDIT_TRX_CHANGE;
CMutableTransaction txNew;
wtxNew.BindWallet(this);
{
LOCK2(cs_main, cs_wallet);
{
txNew.vin.clear();
txNew.vout.clear();
CAmount nChange = nValueSelected - nValue;
if (nChange < 0) {
receipt.SetStatus(_("Selected coins value is less than payment target"), nStatus);
return false;
}
if (nChange > 0 && !changeAddress && addressesTo.size() == 0) {
receipt.SetStatus(_("Need destination or change address because change is not exact"), nStatus);
return false;
}
//if there are addresses to send to then use them, if not generate a new address to send to
CBitcoinAddress destinationAddr;
if (addressesTo.size() == 0) {
CPubKey pubkey;
assert(reserveKey.GetReservedKey(pubkey)); // should never fail
destinationAddr = CBitcoinAddress(pubkey.GetID());
addressesTo.push_back(std::make_pair(&destinationAddr, nValue));
}
for (std::pair<CBitcoinAddress*,CAmount> pair : addressesTo){
CScript scriptZerocoinSpend = GetScriptForDestination(pair.first->Get());
//add output to terracredit address to the transaction (the actual primary spend taking place)
// TODO: check value?
CTxOut txOutZerocoinSpend(pair.second, scriptZerocoinSpend);
txNew.vout.push_back(txOutZerocoinSpend);
}
//add change output if we are spending too much (only applies to spending multiple at once)
if (nChange) {
CScript scriptChange;
// Change address
if(changeAddress){
scriptChange = GetScriptForDestination(changeAddress->Get());
} else {
// Reserve a new key pair from key pool
CPubKey vchPubKey;
assert(reserveKey.GetReservedKey(vchPubKey)); // should never fail
scriptChange = GetScriptForDestination(vchPubKey.GetID());
}
//mint change as zerocoins
if (fMintChange) {
CAmount nFeeRet = 0;
std::string strFailReason = "";
if (!CreateZerocoinMintTransaction(nChange, txNew, vNewMints, &reserveKey, nFeeRet, strFailReason, NULL, true)) {
receipt.SetStatus(_("Failed to create mint"), nStatus);
return false;
}
} else {
CTxOut txOutChange(nValueSelected - nValue, scriptChange);
txNew.vout.push_back(txOutChange);
}
}
//hash with only the output info in it to be used in Signature of Knowledge
// and in CoinRandomness Schnorr Signature
uint256 hashTxOut = txNew.GetHash();
CBlockIndex* pindexCheckpoint = nullptr;
std::map<CBigNum, CZerocoinMint> mapSelectedMints;
for (const CZerocoinMint& mint : vSelectedMints)
mapSelectedMints.insert(std::make_pair(mint.GetValue(), mint));
//add all of the mints to the transaction as inputs
std::vector<CTxIn> vin;
if (isPublicSpend) {
if (!MintsToInputVectorPublicSpend(mapSelectedMints, hashTxOut, vin, receipt,
libzerocoin::SpendType::SPEND, pindexCheckpoint))
return false;
} else {
if (!MintsToInputVector(mapSelectedMints, hashTxOut, vin, receipt,
libzerocoin::SpendType::SPEND, pindexCheckpoint))
return false;
}
txNew.vin = vin;
// Limit size
unsigned int nBytes = ::GetSerializeSize(txNew, SER_NETWORK, PROTOCOL_VERSION);
if (nBytes >= MAX_ZEROCOIN_TX_SIZE) {
receipt.SetStatus(_("In rare cases, a spend with 7 coins exceeds our maximum allowable transaction size, please retry spend using 6 or less coins"), ZCREDIT_TX_TOO_LARGE);
return false;
}
//now that all inputs have been added, add full tx hash to zerocoinspend records and write to db
uint256 txHash = txNew.GetHash();
for (CZerocoinSpend spend : receipt.GetSpends()) {
spend.SetTxHash(txHash);
if (!CWalletDB(strWalletFile).WriteZerocoinSpendSerialEntry(spend)) {
receipt.SetStatus(_("Failed to write coin serial number into wallet"), nStatus);
}
}
//turn the finalized transaction into a wallet transaction
wtxNew = CWalletTx(this, txNew);
wtxNew.fFromMe = true;
wtxNew.fTimeReceivedIsTxTime = true;
wtxNew.nTimeReceived = GetAdjustedTime();
}
}
receipt.SetStatus(_("Transaction Created"), ZCREDIT_SPEND_OKAY); // Everything okay
return true;
}
std::string CWallet::ResetMintZerocoin()
{
long updates = 0;
long deletions = 0;
CWalletDB walletdb(pwalletMain->strWalletFile);
std::set<CMintMeta> setMints = zcreditTracker->ListMints(false, false, true);
std::vector<CMintMeta> vMintsToFind(setMints.begin(), setMints.end());
std::vector<CMintMeta> vMintsMissing;
std::vector<CMintMeta> vMintsToUpdate;
// search all of our available data for these mints
FindMints(vMintsToFind, vMintsToUpdate, vMintsMissing);
// Update the meta data of mints that were marked for updating
for (CMintMeta meta : vMintsToUpdate) {
updates++;
zcreditTracker->UpdateState(meta);
}
// Delete any mints that were unable to be located on the blockchain
for (CMintMeta mint : vMintsMissing) {
deletions++;
if (!zcreditTracker->Archive(mint))
LogPrintf("%s: failed to archive mint\n", __func__);
}
NotifyzCREDITReset();
std::string strResult = _("ResetMintZerocoin finished: ") + std::to_string(updates) + _(" mints updated, ") + std::to_string(deletions) + _(" mints deleted\n");
return strResult;
}
std::string CWallet::ResetSpentZerocoin()
{
long removed = 0;
CWalletDB walletdb(pwalletMain->strWalletFile);
std::set<CMintMeta> setMints = zcreditTracker->ListMints(false, false, true);
std::list<CZerocoinSpend> listSpends = walletdb.ListSpentCoins();
std::list<CZerocoinSpend> listUnconfirmedSpends;
for (CZerocoinSpend spend : listSpends) {
CTransaction tx;
uint256 hashBlock = 0;
if (!GetTransaction(spend.GetTxHash(), tx, hashBlock)) {
listUnconfirmedSpends.push_back(spend);
continue;
}
//no confirmations
if (hashBlock == 0)
listUnconfirmedSpends.push_back(spend);
}
for (CZerocoinSpend spend : listUnconfirmedSpends) {
for (CMintMeta meta : setMints) {
if (meta.hashSerial == GetSerialHash(spend.GetSerial())) {
removed++;
meta.isUsed = false;
zcreditTracker->UpdateState(meta);
walletdb.EraseZerocoinSpendSerialEntry(spend.GetSerial());
continue;
}
}
}
NotifyzCREDITReset();
std::string strResult = _("ResetSpentZerocoin finished: ") + std::to_string(removed) + _(" unconfirmed transactions removed\n");
return strResult;
}
bool IsMintInChain(const uint256& hashPubcoin, uint256& txid, int& nHeight)
{
if (!IsPubcoinInBlockchain(hashPubcoin, txid))
return false;
uint256 hashBlock;
CTransaction tx;
if (!GetTransaction(txid, tx, hashBlock))
return false;
if (!mapBlockIndex.count(hashBlock) || !chainActive.Contains(mapBlockIndex.at(hashBlock)))
return false;
nHeight = mapBlockIndex.at(hashBlock)->nHeight;
return true;
}
void CWallet::ReconsiderZerocoins(std::list<CZerocoinMint>& listMintsRestored, std::list<CDeterministicMint>& listDMintsRestored)
{
CWalletDB walletdb(pwalletMain->strWalletFile);
std::list<CZerocoinMint> listMints = walletdb.ListArchivedZerocoins();
std::list<CDeterministicMint> listDMints = walletdb.ListArchivedDeterministicMints();
if (listMints.empty() && listDMints.empty())
return;
for (CZerocoinMint mint : listMints) {
uint256 txid;
int nHeight;
uint256 hashPubcoin = GetPubCoinHash(mint.GetValue());
if (!IsMintInChain(hashPubcoin, txid, nHeight))
continue;
mint.SetTxHash(txid);
mint.SetHeight(nHeight);
mint.SetUsed(IsSerialInBlockchain(mint.GetSerialNumber(), nHeight));
if (!zcreditTracker->UnArchive(hashPubcoin, false)) {
LogPrintf("%s : failed to unarchive mint %s\n", __func__, mint.GetValue().GetHex());
} else {
zcreditTracker->UpdateZerocoinMint(mint);
}
listMintsRestored.emplace_back(mint);
}
for (CDeterministicMint dMint : listDMints) {
uint256 txid;
int nHeight;
if (!IsMintInChain(dMint.GetPubcoinHash(), txid, nHeight))
continue;
dMint.SetTxHash(txid);
dMint.SetHeight(nHeight);
uint256 txidSpend;
dMint.SetUsed(IsSerialInBlockchain(dMint.GetSerialHash(), nHeight, txidSpend));
if (!zcreditTracker->UnArchive(dMint.GetPubcoinHash(), true)) {
LogPrintf("%s : failed to unarchive deterministic mint %s\n", __func__, dMint.GetPubcoinHash().GetHex());
} else {
zcreditTracker->Add(dMint, true);
}
listDMintsRestored.emplace_back(dMint);
}
}
std::string CWallet::GetUniqueWalletBackupName(bool fzcreditAuto) const
{
std::stringstream ssDateTime;
std::string strWalletBackupName = strprintf("%s", DateTimeStrFormat(".%Y-%m-%d-%H-%M", GetTime()));
ssDateTime << strWalletBackupName;
return strprintf("wallet%s.dat%s", fzcreditAuto ? "-autozcreditbackup" : "", DateTimeStrFormat(".%Y-%m-%d-%H-%M", GetTime()));
}
void CWallet::ZCreditBackupWallet()
{
boost::filesystem::path backupDir = GetDataDir() / "backups";
boost::filesystem::path backupPath;
std::string strNewBackupName;
for (int i = 0; i < 10; i++) {
strNewBackupName = strprintf("wallet-autozcreditbackup-%d.dat", i);
backupPath = backupDir / strNewBackupName;
if (boost::filesystem::exists(backupPath)) {
//Keep up to 10 backups
if (i <= 8) {
//If the next file backup exists and is newer, then iterate
boost::filesystem::path nextBackupPath = backupDir / strprintf("wallet-autozcreditbackup-%d.dat", i + 1);
if (boost::filesystem::exists(nextBackupPath)) {
time_t timeThis = boost::filesystem::last_write_time(backupPath);
time_t timeNext = boost::filesystem::last_write_time(nextBackupPath);
if (timeThis > timeNext) {
//The next backup is created before this backup was
//The next backup is the correct path to use
backupPath = nextBackupPath;
break;
}
}
//Iterate to the next filename/number
continue;
}
//reset to 0 because name with 9 already used
strNewBackupName = strprintf("wallet-autozcreditbackup-%d.dat", 0);
backupPath = backupDir / strNewBackupName;
break;
}
//This filename is fresh, break here and backup
break;
}
BackupWallet(*this, backupPath.string());
if(!GetArg("-zcreditbackuppath", "").empty()) {
boost::filesystem::path customPath(GetArg("-zcreditbackuppath", ""));
boost::filesystem::create_directories(customPath);
if(!customPath.has_extension()) {
customPath /= GetUniqueWalletBackupName(true);
}
BackupWallet(*this, customPath, false);
}
}
std::string CWallet::MintZerocoinFromOutPoint(CAmount nValue, CWalletTx& wtxNew, std::vector<CDeterministicMint>& vDMints, const std::vector<COutPoint> vOutpts)
{
CCoinControl* coinControl = new CCoinControl();
for (const COutPoint& outpt : vOutpts) {
coinControl->Select(outpt);
}
if (!coinControl->HasSelected()){
std::string strError = _("Error: No valid utxo!");
LogPrintf("MintZerocoin() : %s", strError.c_str());
return strError;
}
std::string strError = MintZerocoin(nValue, wtxNew, vDMints, coinControl);
delete coinControl;
return strError;
}
std::string CWallet::MintZerocoin(CAmount nValue, CWalletTx& wtxNew, std::vector<CDeterministicMint>& vDMints, const CCoinControl* coinControl)
{
// Check amount
if (nValue <= 0)
return _("Invalid amount");
CAmount nBalance = GetBalance();
if (nValue + Params().Zerocoin_MintFee() > nBalance) {
LogPrintf("%s: balance=%s fee=%s nValue=%s\n", __func__, FormatMoney(nBalance), FormatMoney(Params().Zerocoin_MintFee()), FormatMoney(nValue));
return _("Insufficient funds");
}
CReserveKey reservekey(this);
int64_t nFeeRequired;
if (IsLocked()) {
std::string strError = _("Error: Wallet locked, unable to create transaction!");
LogPrintf("MintZerocoin() : %s", strError.c_str());
return strError;
}
std::string strError;
CMutableTransaction txNew;
if (!CreateZerocoinMintTransaction(nValue, txNew, vDMints, &reservekey, nFeeRequired, strError, coinControl)) {
if (nValue + nFeeRequired > GetBalance())
return strprintf(_("Error: This transaction requires a transaction fee of at least %s because of its amount, complexity, or use of recently received funds!"), FormatMoney(nFeeRequired).c_str());
return strError;
}
wtxNew = CWalletTx(this, txNew);
wtxNew.fFromMe = true;
wtxNew.fTimeReceivedIsTxTime = true;
// Limit size
unsigned int nBytes = ::GetSerializeSize(txNew, SER_NETWORK, PROTOCOL_VERSION);
if (nBytes >= MAX_ZEROCOIN_TX_SIZE) {
return _("Error: The transaction is larger than the maximum allowed transaction size!");
}
//commit the transaction to the network
if (!CommitTransaction(wtxNew, reservekey)) {
return _("Error: The transaction was rejected! This might happen if some of the coins in your wallet were already spent, such as if you used a copy of wallet.dat and coins were spent in the copy but not marked as spent here.");
} else {
//update mints with full transaction hash and then database them
CWalletDB walletdb(pwalletMain->strWalletFile);
for (CDeterministicMint dMint : vDMints) {
dMint.SetTxHash(wtxNew.GetHash());
zcreditTracker->Add(dMint, true);
}
}
//Create a backup of the wallet
if (fBackupMints)
ZCreditBackupWallet();
return "";
}
bool CWallet::SpendZerocoin(
CAmount nAmount,
CWalletTx& wtxNew,
CZerocoinSpendReceipt& receipt,
std::vector<CZerocoinMint>& vMintsSelected,
bool fMintChange,
bool fMinimizeChange,
std::list<std::pair<CBitcoinAddress*,CAmount>> addressesTo,
CBitcoinAddress* changeAddress,
bool isPublicSpend
)
{
// Default: assume something goes wrong. Depending on the problem this gets more specific below
int nStatus = ZCREDIT_SPEND_ERROR;
if (IsLocked()) {
receipt.SetStatus("Error: Wallet locked, unable to create transaction!", ZCREDIT_WALLET_LOCKED);
return false;
}
CReserveKey reserveKey(this);
std::vector<CDeterministicMint> vNewMints;
if (!CreateZerocoinSpendTransaction(
nAmount,
wtxNew,
reserveKey,
receipt,
vMintsSelected,
vNewMints,
fMintChange,
fMinimizeChange,
addressesTo,
changeAddress,
isPublicSpend
)) {
return false;
}
if (fMintChange && fBackupMints)
ZCreditBackupWallet();
CWalletDB walletdb(pwalletMain->strWalletFile);
if (!CommitTransaction(wtxNew, reserveKey)) {
LogPrintf("%s: failed to commit\n", __func__);
nStatus = ZCREDIT_COMMIT_FAILED;
//reset all mints
for (CZerocoinMint mint : vMintsSelected) {
uint256 hashPubcoin = GetPubCoinHash(mint.GetValue());
zcreditTracker->SetPubcoinNotUsed(hashPubcoin);
pwalletMain->NotifyZerocoinChanged(pwalletMain, mint.GetValue().GetHex(), "New", CT_UPDATED);
}
//erase spends
for (CZerocoinSpend spend : receipt.GetSpends()) {
if (!walletdb.EraseZerocoinSpendSerialEntry(spend.GetSerial())) {
receipt.SetStatus("Error: It cannot delete coin serial number in wallet", ZCREDIT_ERASE_SPENDS_FAILED);
}
//Remove from public zerocoinDB
RemoveSerialFromDB(spend.GetSerial());
}
// erase new mints
for (auto& dMint : vNewMints) {
if (!walletdb.EraseDeterministicMint(dMint.GetPubcoinHash())) {
receipt.SetStatus("Error: Unable to cannot delete zerocoin mint in wallet", ZCREDIT_ERASE_NEW_MINTS_FAILED);
}
}
receipt.SetStatus("Error: The transaction was rejected! This might happen if some of the coins in your wallet were already spent, such as if you used a copy of wallet.dat and coins were spent in the copy but not marked as spent here.", nStatus);
return false;
}
//Set spent mints as used
uint256 txidSpend = wtxNew.GetHash();
for (CZerocoinMint mint : vMintsSelected) {
uint256 hashPubcoin = GetPubCoinHash(mint.GetValue());
zcreditTracker->SetPubcoinUsed(hashPubcoin, txidSpend);
CMintMeta metaCheck = zcreditTracker->GetMetaFromPubcoin(hashPubcoin);
if (!metaCheck.isUsed) {
receipt.SetStatus("Error, the mint did not get marked as used", nStatus);
return false;
}
}
// write new Mints to db
for (auto& dMint : vNewMints) {
dMint.SetTxHash(txidSpend);
zcreditTracker->Add(dMint, true);
}
receipt.SetStatus("Spend Successful", ZCREDIT_SPEND_OKAY); // When we reach this point spending zCREDIT was successful
return true;
}
bool CWallet::GetMintFromStakeHash(const uint256& hashStake, CZerocoinMint& mint)
{
CMintMeta meta;
if (!zcreditTracker->GetMetaFromStakeHash(hashStake, meta))
return error("%s: failed to find meta associated with hashStake", __func__);
return GetMint(meta.hashSerial, mint);
}
bool CWallet::GetMint(const uint256& hashSerial, CZerocoinMint& mint)
{
if (!zcreditTracker->HasSerialHash(hashSerial))
return error("%s: serialhash %s is not in tracker", __func__, hashSerial.GetHex());
CWalletDB walletdb(strWalletFile);
CMintMeta meta = zcreditTracker->Get(hashSerial);
if (meta.isDeterministic) {
CDeterministicMint dMint;
if (!walletdb.ReadDeterministicMint(meta.hashPubcoin, dMint))
return error("%s: failed to read deterministic mint", __func__);
if (!zwalletMain->RegenerateMint(dMint, mint))
return error("%s: failed to generate mint", __func__);
return true;
} else if (!walletdb.ReadZerocoinMint(meta.hashPubcoin, mint)) {
return error("%s: failed to read zerocoinmint from database", __func__);
}
return true;
}
bool CWallet::IsMyMint(const CBigNum& bnValue) const
{
if (zcreditTracker->HasPubcoin(bnValue))
return true;
return zwalletMain->IsInMintPool(bnValue);
}
bool CWallet::UpdateMint(const CBigNum& bnValue, const int& nHeight, const uint256& txid, const libzerocoin::CoinDenomination& denom)
{
uint256 hashValue = GetPubCoinHash(bnValue);
CZerocoinMint mint;
if (zcreditTracker->HasPubcoinHash(hashValue)) {
CMintMeta meta = zcreditTracker->GetMetaFromPubcoin(hashValue);
meta.nHeight = nHeight;
meta.txid = txid;
return zcreditTracker->UpdateState(meta);
} else {
//Check if this mint is one that is in our mintpool (a potential future mint from our deterministic generation)
if (zwalletMain->IsInMintPool(bnValue)) {
if (zwalletMain->SetMintSeen(bnValue, nHeight, txid, denom))
return true;
}
}
return false;
}
//! Primarily for the scenario that a mint was confirmed and added to the chain and then that block orphaned
bool CWallet::SetMintUnspent(const CBigNum& bnSerial)
{
uint256 hashSerial = GetSerialHash(bnSerial);
if (!zcreditTracker->HasSerialHash(hashSerial))
return error("%s: did not find mint", __func__);
CMintMeta meta = zcreditTracker->Get(hashSerial);
zcreditTracker->SetPubcoinNotUsed(meta.hashPubcoin);
return true;
}
bool CWallet::DatabaseMint(CDeterministicMint& dMint)
{
CWalletDB walletdb(strWalletFile);
zcreditTracker->Add(dMint, true);
return true;
}
void ThreadPrecomputeSpends()
{
boost::this_thread::interruption_point();
LogPrintf("ThreadPrecomputeSpends started\n");
CWallet* pwallet = pwalletMain;
try {
pwallet->PrecomputeSpends();
boost::this_thread::interruption_point();
} catch (const std::exception& e) {
LogPrintf("ThreadPrecomputeSpends() exception: %s \n", e.what());
} catch (...) {
LogPrintf("ThreadPrecomputeSpends() error \n");
}
LogPrintf("ThreadPrecomputeSpends exiting,\n");
}
void CWallet::PrecomputeSpends()
{
// We don't even need to worry about this code.. no zCREDIT.
/*
LogPrintf("Precomputer started\n");
RenameThread("terracredit-precomputer");
CWalletDB walletdb("precomputes.dat", "cr+");
// Create LRU Cache
std::list<std::pair<uint256, CoinWitnessCacheData> > item_list;
std::map<uint256, std::list<std::pair<uint256, CoinWitnessCacheData> >::iterator> item_map;
// Dirty cache that needs to be written to disk
std::map<uint256, CoinWitnessCacheData> mapDirtyWitnessData;
// Initialize Variables
bool fLoadedPrecomputesFromDB = false;
bool fOnFirstLoad = true;
int64_t nLastCacheCleanUpTime = GetTime();
int64_t nLastCacheWriteDB = nLastCacheCleanUpTime;
int nRequiredStakeDepthBuffer = Params().Zerocoin_RequiredStakeDepth() + 10;
int nAdjustableCacheLength = GetArg("-precomputecachelength", DEFAULT_PRECOMPUTE_LENGTH);
// Force the cache length to be divisible by 10
if (nAdjustableCacheLength % 10)
nAdjustableCacheLength -= nAdjustableCacheLength % 10;
if (nAdjustableCacheLength < MIN_PRECOMPUTE_LENGTH)
nAdjustableCacheLength = MIN_PRECOMPUTE_LENGTH;
if (nAdjustableCacheLength > MAX_PRECOMPUTE_LENGTH)
nAdjustableCacheLength = MAX_PRECOMPUTE_LENGTH;
while (true) {
// Check to see if we need to clear the cache
if (fClearSpendCache) {
fClearSpendCache = false;
item_map.clear();
item_list.clear();
mapDirtyWitnessData.clear();
nLastCacheCleanUpTime = GetTime();
nLastCacheWriteDB = nLastCacheCleanUpTime;
}
// Get the list of zCREDIT inputs
std::list <std::unique_ptr<CStakeInput>> listInputs;
if (!SelectStakeCoins(listInputs, 0, true)) {
MilliSleep(5000);
continue;
}
if (listInputs.empty()) {
MilliSleep(5000);
continue;
}
if (ShutdownRequested())
break;
while (IsLocked())
MilliSleep(5000);
// If we haven't loaded from database yet, load the precomputes from the database
if (!fLoadedPrecomputesFromDB) {
// Load the precomputes into the LRU cache
walletdb.LoadPrecomputes(item_list, item_map);
fLoadedPrecomputesFromDB = true;
LogPrint("precompute", "%s: Loaded precomputes from database. Size of lru cache: %d\n", __func__,
item_map.size());
}
// Do some precomputing of zerocoin spend knowledge proofs
std::set <uint256> setInputHashes;
for (std::unique_ptr <CStakeInput>& stakeInput : listInputs) {
if (ShutdownRequested() || IsLocked())
break;
CoinWitnessCacheData tempDataHolder;
{
TRY_LOCK(zcreditTracker->cs_spendcache, fLocked);
if (!fLocked)
continue;
if (fGlobalUnlockSpendCache) {
break;
}
// When we see a clear spend cache bool set to true, break out of the loop
// All cache data will be cleared at the beginning of the while loop above
if (fClearSpendCache) {
break;
}
uint256 serialHash = stakeInput->GetSerialHash();
setInputHashes.insert(serialHash);
CoinWitnessData* witnessData = zcreditTracker->GetSpendCache(serialHash);
// Initialize nHeightStop so it can be set below
int nHeightStop = 0;
if (witnessData->nHeightAccStart) { // Witness is already valid
nHeightStop = std::min(chainActive.Height() - nRequiredStakeDepthBuffer,
(witnessData->nHeightAccEnd ? witnessData->nHeightAccEnd
: witnessData->nHeightAccStart) +
nAdjustableCacheLength);
} else if (item_map.count(serialHash)) { // Check Database cache
// Get the witness data from the cache
auto it = item_map.find(serialHash);
item_list.splice(item_list.begin(), item_list, it->second);
*witnessData = CoinWitnessData(it->second->second);
// Set the stop height from the variables received from the database cache
nHeightStop = std::min(chainActive.Height() - nRequiredStakeDepthBuffer,
(witnessData->nHeightAccEnd ? witnessData->nHeightAccEnd
: witnessData->nHeightAccStart) +
nAdjustableCacheLength);
LogPrint("precompute", "%s: Got Witness Data from lru cache: %s\n", __func__,
witnessData->ToString());
} else if (mapDirtyWitnessData.count(serialHash) || walletdb.ReadPrecompute(serialHash, tempDataHolder)) {
if (mapDirtyWitnessData.count(serialHash)) {
// Get the witness data from the dirty cache if it exists
*witnessData = CoinWitnessData(mapDirtyWitnessData.at(serialHash));
LogPrint("precompute", "%s: Got Witness Data from mapDirtyWitnessData: %s\n", __func__,
witnessData->ToString());
} else {
// Get the witness data from the database
*witnessData = CoinWitnessData(tempDataHolder);
LogPrint("precompute", "%s: Got Witness Data from precompute database: %s\n", __func__,
witnessData->ToString());
}
// Set the stop height from the variables received from the database cache
nHeightStop = std::min(chainActive.Height() - nRequiredStakeDepthBuffer,
(witnessData->nHeightAccEnd ? witnessData->nHeightAccEnd
: witnessData->nHeightAccStart) +
nAdjustableCacheLength);
// Add the serialHash found into the cache
item_list.push_front(std::make_pair(serialHash, tempDataHolder));
item_map.insert(std::make_pair(serialHash, item_list.begin()));
// We just added a new hash into our LRU cache, so remove it if we also have it in the dirty map
mapDirtyWitnessData.erase(serialHash);
if (item_map.size() > PRECOMPUTE_LRU_CACHE_SIZE) {
auto last_it = item_list.end(); last_it --;
item_map.erase(last_it->first);
CoinWitnessCacheData removedData = item_list.back().second;
mapDirtyWitnessData[serialHash] = removedData;
item_list.pop_back();
}
} else { // This has no cache, so initialize it
CZerocoinMint mint;
if (!GetMintFromStakeHash(serialHash, mint))
continue;
*witnessData = CoinWitnessData(mint);
nHeightStop = std::min(chainActive.Height() - nRequiredStakeDepthBuffer,
mint.GetHeight() + nAdjustableCacheLength);
}
if (nHeightStop - (witnessData->nHeightAccEnd ? witnessData->nHeightAccEnd : witnessData->nHeightAccStart) < 20)
continue;
CBlockIndex* pindexStop = chainActive[nHeightStop];
AccumulatorMap mapAccumulators(Params().Zerocoin_Params(false));
LogPrint("precompute","%s: caching mint %s of denom %d start=%d stop=%d end=%s\n", __func__,
witnessData->coin->getValue().GetHex().substr(0, 6),
ZerocoinDenominationToInt(witnessData->denom),
witnessData->nHeightAccStart, nHeightStop, witnessData->nHeightAccEnd);
if (!GenerateAccumulatorWitness(witnessData, mapAccumulators, pindexStop)) {
LogPrintf("%s: Generate witness failed!\n", __func__);
// If we fail this check, we need to make sure we remove this from the LRU cache
auto it = item_map.find(serialHash);
if (it != item_map.end())
{
item_list.erase(it->second);
item_map.erase(it);
}
mapDirtyWitnessData.erase(serialHash);
walletdb.ErasePrecompute(serialHash);
continue;
}
CoinWitnessCacheData serialData(witnessData);
// If the LRU cache already has a entry for it, update the entry and move it to the front of the list
auto it = item_map.find(serialHash);
if (it != item_map.end()) {
item_list.splice(item_list.begin(), item_list, it->second);
item_list.begin()->second = serialData;
} else {
item_list.push_front(std::make_pair(serialHash, serialData));
item_map.insert(std::make_pair(serialHash, item_list.begin()));
}
// We just added a new hash into our LRU cache, so remove it if we also have it in the dirty map
mapDirtyWitnessData.erase(serialHash);
// Clean up the LRU cache to the max size
while (item_map.size() > PRECOMPUTE_LRU_CACHE_SIZE) {
auto last_it = item_list.end(); last_it --;
item_map.erase(last_it->first);
mapDirtyWitnessData[serialHash] = item_list.back().second;
item_list.pop_back();
}
}
// Sleep for 150ms to allow any potential spend attempt
MilliSleep(150);
}
if (fGlobalUnlockSpendCache) {
fGlobalUnlockSpendCache = false;
}
// On first load, and every 5 minutes clean up our cache with only valid unspent inputs
if (fOnFirstLoad || nLastCacheCleanUpTime < GetTime() - PRECOMPUTE_FLUSH_TIME) {
LogPrint("precompute", "%s: Cleaning up precompute cache\n", __func__);
// We only want to clear the cache if we have calculated new witness data
if (setInputHashes.size()) {
// Get a list of hashes currently in the database
std::set <uint256> databaseHashes;
walletdb.LoadPrecomputes(databaseHashes);
// Remove old cache data
for (auto inputHash : setInputHashes) {
databaseHashes.erase(inputHash);
}
// Erase all old hashes from the database
for (auto hash : databaseHashes) {
auto it = item_map.find(hash);
if (it != item_map.end())
{
item_list.erase(it->second);
item_map.erase(it);
}
mapDirtyWitnessData.erase(hash);
walletdb.ErasePrecompute(hash);
}
nLastCacheCleanUpTime = GetTime();
}
}
// On first load, and every 5 minutes write the cache to database
if (mapDirtyWitnessData.size() > PRECOMPUTE_MAX_DIRTY_CACHE_SIZE || nLastCacheWriteDB < GetTime() - PRECOMPUTE_FLUSH_TIME || ShutdownRequested()) {
// Save all cache data that was dirty back into the database
for (auto item : mapDirtyWitnessData) {
walletdb.WritePrecompute(item.first, item.second);
}
mapDirtyWitnessData.clear();
// Save the LRU cache data into the database
for (auto item : item_list) {
walletdb.WritePrecompute(item.first, item.second);
}
LogPrint("precompute", "%s: Writing precomputes to database. Precomputes size: %d\n", __func__, item_map.size());
nLastCacheWriteDB = GetTime();
}
fOnFirstLoad = false;
if (ShutdownRequested())
break;
LogPrint("precompute", "%s: Finished precompute round...\n\n", __func__);
MilliSleep(5000);
}*/
}
CWallet::CWallet()
{
SetNull();
}
CWallet::CWallet(std::string strWalletFileIn)
{
SetNull();
strWalletFile = strWalletFileIn;
fFileBacked = true;
}
CWallet::~CWallet()
{
delete pwalletdbEncryption;
}
void CWallet::SetNull()
{
nWalletVersion = FEATURE_BASE;
nWalletMaxVersion = FEATURE_BASE;
fFileBacked = false;
nMasterKeyMaxID = 0;
pwalletdbEncryption = NULL;
nOrderPosNext = 0;
nNextResend = 0;
nLastResend = 0;
nTimeFirstKey = 0;
fWalletUnlockAnonymizeOnly = false;
fBackupMints = false;
// Stake Settings
nStakeSplitThreshold = STAKE_SPLIT_THRESHOLD;
nStakeSetUpdateTime = 300; // 5 minutes
//MultiSend
vMultiSend.clear();
fMultiSendStake = false;
fMultiSendMasternodeReward = false;
fMultiSendNotify = false;
strMultiSendChangeAddress = "";
nLastMultiSendHeight = 0;
vDisabledAddresses.clear();
//Auto Combine Dust
fCombineDust = false;
nAutoCombineThreshold = 0;
}
int CWallet::getZeromintPercentage()
{
return nZeromintPercentage;
}
void CWallet::setZWallet(CzCREDITWallet* zwallet)
{
zwalletMain = zwallet;
zcreditTracker = std::unique_ptr<CzCREDITTracker>(new CzCREDITTracker(strWalletFile));
}
CzCREDITWallet* CWallet::getZWallet()
{
return zwalletMain;
}
bool CWallet::isZeromintEnabled()
{
return fEnableZeromint || fEnableAutoConvert;
}
void CWallet::setZCreditAutoBackups(bool fEnabled)
{
fBackupMints = fEnabled;
}
bool CWallet::isMultiSendEnabled()
{
return fMultiSendMasternodeReward || fMultiSendStake;
}
void CWallet::setMultiSendDisabled()
{
fMultiSendMasternodeReward = false;
fMultiSendStake = false;
}
bool CWallet::CanSupportFeature(enum WalletFeature wf)
{
AssertLockHeld(cs_wallet);
return nWalletMaxVersion >= wf;
}
bool CWallet::LoadMinVersion(int nVersion)
{
AssertLockHeld(cs_wallet);
nWalletVersion = nVersion;
nWalletMaxVersion = std::max(nWalletMaxVersion, nVersion);
return true;
}
isminetype CWallet::IsMine(const CTxOut& txout) const
{
return ::IsMine(*this, txout.scriptPubKey);
}
CAmount CWallet::GetCredit(const CTxOut& txout, const isminefilter& filter) const
{
if (!MoneyRange(txout.nValue))
throw std::runtime_error("CWallet::GetCredit() : value out of range");
return ((IsMine(txout) & filter) ? txout.nValue : 0);
}
CAmount CWallet::GetChange(const CTxOut& txout) const
{
if (!MoneyRange(txout.nValue))
throw std::runtime_error("CWallet::GetChange() : value out of range");
return (IsChange(txout) ? txout.nValue : 0);
}
bool CWallet::IsMine(const CTransaction& tx) const
{
for (const CTxOut& txout : tx.vout)
if (IsMine(txout))
return true;
return false;
}
bool CWallet::IsFromMe(const CTransaction& tx) const
{
return (GetDebit(tx, ISMINE_ALL) > 0);
}
CAmount CWallet::GetDebit(const CTransaction& tx, const isminefilter& filter) const
{
CAmount nDebit = 0;
for (const CTxIn& txin : tx.vin) {
nDebit += GetDebit(txin, filter);
if (!MoneyRange(nDebit))
throw std::runtime_error("CWallet::GetDebit() : value out of range");
}
return nDebit;
}
CAmount CWallet::GetCredit(const CTransaction& tx, const isminefilter& filter, const bool fUnspent) const
{
CAmount nCredit = 0;
for (int i = 0; i < tx.vout.size(); i++) {
if (fUnspent && IsSpent(tx.GetHash(), i)) continue;
nCredit += GetCredit(tx.vout[i], filter);
}
if (!MoneyRange(nCredit))
throw std::runtime_error("CWallet::GetCredit() : value out of range");
return nCredit;
}
CAmount CWallet::GetChange(const CTransaction& tx) const
{
CAmount nChange = 0;
for (const CTxOut& txout : tx.vout) {
nChange += GetChange(txout);
if (!MoneyRange(nChange))
throw std::runtime_error("CWallet::GetChange() : value out of range");
}
return nChange;
}
void CWallet::Inventory(const uint256& hash)
{
{
LOCK(cs_wallet);
std::map<uint256, int>::iterator mi = mapRequestCount.find(hash);
if (mi != mapRequestCount.end())
(*mi).second++;
}
}
unsigned int CWallet::GetKeyPoolSize()
{
AssertLockHeld(cs_wallet); // setKeyPool
return setKeyPool.size();
}
int CWallet::GetVersion()
{
LOCK(cs_wallet);
return nWalletVersion;
}
CWalletTx::CWalletTx()
{
Init(NULL);
}
CWalletTx::CWalletTx(const CWallet* pwalletIn)
{
Init(pwalletIn);
}
CWalletTx::CWalletTx(const CWallet* pwalletIn, const CMerkleTx& txIn) : CMerkleTx(txIn)
{
Init(pwalletIn);
}
CWalletTx::CWalletTx(const CWallet* pwalletIn, const CTransaction& txIn) : CMerkleTx(txIn)
{
Init(pwalletIn);
}
void CWalletTx::Init(const CWallet* pwalletIn)
{
pwallet = pwalletIn;
mapValue.clear();
vOrderForm.clear();
fTimeReceivedIsTxTime = false;
nTimeReceived = 0;
nTimeSmart = 0;
fFromMe = false;
strFromAccount.clear();
fDebitCached = false;
fCreditCached = false;
fImmatureCreditCached = false;
fAvailableCreditCached = false;
fAnonymizableCreditCached = false;
fAnonymizedCreditCached = false;
fDenomUnconfCreditCached = false;
fDenomConfCreditCached = false;
fWatchDebitCached = false;
fWatchCreditCached = false;
fImmatureWatchCreditCached = false;
fAvailableWatchCreditCached = false;
fChangeCached = false;
fColdDebitCached = false;
fColdCreditCached = false;
fDelegatedDebitCached = false;
fDelegatedCreditCached = false;
fStakeDelegationVoided = false;
nDebitCached = 0;
nCreditCached = 0;
nImmatureCreditCached = 0;
nAvailableCreditCached = 0;
nAnonymizableCreditCached = 0;
nAnonymizedCreditCached = 0;
nDenomUnconfCreditCached = 0;
nDenomConfCreditCached = 0;
nWatchDebitCached = 0;
nWatchCreditCached = 0;
nAvailableWatchCreditCached = 0;
nImmatureWatchCreditCached = 0;
nColdDebitCached = 0;
nColdCreditCached = 0;
nDelegatedDebitCached = 0;
nDelegatedCreditCached = 0;
nChangeCached = 0;
nOrderPos = -1;
}
bool CWalletTx::IsTrusted() const
{
// Quick answer in most cases
if (!IsFinalTx(*this))
return false;
bool fConflicted;
int nDepth = GetDepthAndMempool(fConflicted);
if (fConflicted) // Don't trust unconfirmed transactions from us unless they are in the mempool.
return false;
if (nDepth >= 1)
return true;
if (nDepth < 0)
return false;
if (!bSpendZeroConfChange || !IsFromMe(ISMINE_ALL)) // using wtx's cached debit
return false;
// Trusted if all inputs are from us and are in the mempool:
for (const CTxIn& txin : vin) {
// Transactions not sent by us: not trusted
const CWalletTx* parent = pwallet->GetWalletTx(txin.prevout.hash);
if (parent == NULL)
return false;
const CTxOut& parentOut = parent->vout[txin.prevout.n];
if (pwallet->IsMine(parentOut) != ISMINE_SPENDABLE)
return false;
}
return true;
}
int CWalletTx::GetDepthAndMempool(bool& fConflicted, bool enableIX) const
{
int ret = GetDepthInMainChain(enableIX);
fConflicted = (ret == 0 && !InMempool()); // not in chain nor in mempool
return ret;
}
bool CWalletTx::IsEquivalentTo(const CWalletTx& _tx) const
{
CMutableTransaction tx1 {*this};
CMutableTransaction tx2 {_tx};
for (auto& txin : tx1.vin) txin.scriptSig = CScript();
for (auto& txin : tx2.vin) txin.scriptSig = CScript();
return CTransaction(tx1) == CTransaction(tx2);
}
void CWalletTx::MarkDirty()
{
fCreditCached = false;
fAvailableCreditCached = false;
fAnonymizableCreditCached = false;
fAnonymizedCreditCached = false;
fDenomUnconfCreditCached = false;
fDenomConfCreditCached = false;
fWatchDebitCached = false;
fWatchCreditCached = false;
fAvailableWatchCreditCached = false;
fImmatureWatchCreditCached = false;
fDebitCached = false;
fChangeCached = false;
fColdDebitCached = false;
fColdCreditCached = false;
fDelegatedDebitCached = false;
fDelegatedCreditCached = false;
}
void CWalletTx::BindWallet(CWallet* pwalletIn)
{
pwallet = pwalletIn;
MarkDirty();
}
bool CWalletTx::HasP2CSInputs() const
{
return GetStakeDelegationDebit(true) > 0 || GetColdStakingDebit(true) > 0;
}
CAmount CWalletTx::GetChange() const
{
if (fChangeCached)
return nChangeCached;
nChangeCached = pwallet->GetChange(*this);
fChangeCached = true;
return nChangeCached;
}
bool CWalletTx::IsFromMe(const isminefilter& filter) const
{
return (GetDebit(filter) > 0);
}
| [
"alonewolf2ksk@gmail.com"
] | alonewolf2ksk@gmail.com |
956b6437c631ef0a0aed49751d6372d7079ec2cf | 7eb5fd0c32c165407de99667fc6b398ff1d4856b | /strangecalc/wrapper/src/TStrangeModelDict.cpp | baf2421aa19140df4f090d7cd275c94a769c962b | [] | no_license | mgovers/thesisRPR | 684d978617b7256bd5e7696132c4ba5f87b18708 | b15ac31f7c851f345389f0f72f6daf06b84521bc | refs/heads/master | 2020-06-23T02:16:47.741459 | 2016-11-28T15:54:30 | 2016-11-28T15:54:30 | 74,672,357 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,474 | cpp | // Do NOT change. Changes will be lost next time file is generated
#define R__DICTIONARY_FILENAME TStrangeModelDict
/*******************************************************************/
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <assert.h>
#define G__DICTIONARY
#include "RConfig.h"
#include "TClass.h"
#include "TDictAttributeMap.h"
#include "TInterpreter.h"
#include "TROOT.h"
#include "TBuffer.h"
#include "TMemberInspector.h"
#include "TInterpreter.h"
#include "TVirtualMutex.h"
#include "TError.h"
#ifndef G__ROOT
#define G__ROOT
#endif
#include "RtypesImp.h"
#include "TIsAProxy.h"
#include "TFileMergeInfo.h"
#include <algorithm>
#include "TCollectionProxyInfo.h"
/*******************************************************************/
#include "TDataMember.h"
// Since CINT ignores the std namespace, we need to do so in this file.
namespace std {} using namespace std;
// Header files passed as explicit arguments
#include "TStrangeModel.h"
// Header files passed via #pragma extra_include
namespace ROOT {
static void *new_TStrangeModel(void *p = 0);
static void delete_TStrangeModel(void *p);
static void deleteArray_TStrangeModel(void *p);
static void destruct_TStrangeModel(void *p);
static void streamer_TStrangeModel(TBuffer &buf, void *obj);
// Function generating the singleton type initializer
static TGenericClassInfo *GenerateInitInstanceLocal(const ::TStrangeModel*)
{
::TStrangeModel *ptr = 0;
static ::TVirtualIsAProxy* isa_proxy = new ::TInstrumentedIsAProxy< ::TStrangeModel >(0);
static ::ROOT::TGenericClassInfo
instance("TStrangeModel", ::TStrangeModel::Class_Version(), "TStrangeModel.h", 37,
typeid(::TStrangeModel), ::ROOT::Internal::DefineBehavior(ptr, ptr),
&::TStrangeModel::Dictionary, isa_proxy, 17,
sizeof(::TStrangeModel) );
instance.SetNew(&new_TStrangeModel);
instance.SetDelete(&delete_TStrangeModel);
instance.SetDeleteArray(&deleteArray_TStrangeModel);
instance.SetDestructor(&destruct_TStrangeModel);
instance.SetStreamerFunc(&streamer_TStrangeModel);
return &instance;
}
TGenericClassInfo *GenerateInitInstance(const ::TStrangeModel*)
{
return GenerateInitInstanceLocal((::TStrangeModel*)0);
}
// Static variable to force the class initialization
static ::ROOT::TGenericClassInfo *_R__UNIQUE_(Init) = GenerateInitInstanceLocal((const ::TStrangeModel*)0x0); R__UseDummy(_R__UNIQUE_(Init));
} // end of namespace ROOT
//______________________________________________________________________________
atomic_TClass_ptr TStrangeModel::fgIsA(0); // static to hold class pointer
//______________________________________________________________________________
const char *TStrangeModel::Class_Name()
{
return "TStrangeModel";
}
//______________________________________________________________________________
const char *TStrangeModel::ImplFileName()
{
return ::ROOT::GenerateInitInstanceLocal((const ::TStrangeModel*)0x0)->GetImplFileName();
}
//______________________________________________________________________________
int TStrangeModel::ImplFileLine()
{
return ::ROOT::GenerateInitInstanceLocal((const ::TStrangeModel*)0x0)->GetImplFileLine();
}
//______________________________________________________________________________
TClass *TStrangeModel::Dictionary()
{
fgIsA = ::ROOT::GenerateInitInstanceLocal((const ::TStrangeModel*)0x0)->GetClass();
return fgIsA;
}
//______________________________________________________________________________
TClass *TStrangeModel::Class()
{
if (!fgIsA.load()) { R__LOCKGUARD2(gInterpreterMutex); fgIsA = ::ROOT::GenerateInitInstanceLocal((const ::TStrangeModel*)0x0)->GetClass(); }
return fgIsA;
}
namespace ROOT {
// Wrappers around operator new
static void *new_TStrangeModel(void *p) {
return p ? new(p) ::TStrangeModel( (TRootIOCtor *)nullptr ) : new ::TStrangeModel( (TRootIOCtor *)nullptr );
}
// Wrapper around operator delete
static void delete_TStrangeModel(void *p) {
delete ((::TStrangeModel*)p);
}
static void deleteArray_TStrangeModel(void *p) {
delete [] ((::TStrangeModel*)p);
}
static void destruct_TStrangeModel(void *p) {
typedef ::TStrangeModel current_t;
((current_t*)p)->~current_t();
}
// Wrapper around a custom streamer member function.
static void streamer_TStrangeModel(TBuffer &buf, void *obj) {
((::TStrangeModel*)obj)->::TStrangeModel::Streamer(buf);
}
} // end of namespace ROOT for class ::TStrangeModel
namespace {
void TriggerDictionaryInitialization_TStrangeModelDict_Impl() {
static const char* headers[] = {
"TStrangeModel.h",
0
};
static const char* includePaths[] = {
"/usr/local/include",
"/usr/include",
"/usr/local/include",
"/home/mgovers/Software/strangecalc/wrapper/src/",
0
};
static const char* fwdDeclCode = R"DICTFWDDCLS(
#line 1 "TStrangeModelDict dictionary forward declarations' payload"
#pragma clang diagnostic ignored "-Wkeyword-compat"
#pragma clang diagnostic ignored "-Wignored-attributes"
#pragma clang diagnostic ignored "-Wreturn-type-c-linkage"
extern int __Cling_Autoloading_Map;
class __attribute__((annotate(R"ATTRDUMP(strangecalc model)ATTRDUMP"))) __attribute__((annotate(R"ATTRDUMP(strangecalc model)ATTRDUMP"))) __attribute__((annotate("$clingAutoload$TStrangeModel.h"))) TStrangeModel;
)DICTFWDDCLS";
static const char* payloadCode = R"DICTPAYLOAD(
#line 1 "TStrangeModelDict dictionary payload"
#ifndef G__VECTOR_HAS_CLASS_ITERATOR
#define G__VECTOR_HAS_CLASS_ITERATOR 1
#endif
#define _BACKWARD_BACKWARD_WARNING_H
#include "TStrangeModel.h"
#undef _BACKWARD_BACKWARD_WARNING_H
)DICTPAYLOAD";
static const char* classesHeaders[]={
"TStrangeModel", payloadCode, "@",
nullptr};
static bool isInitialized = false;
if (!isInitialized) {
TROOT::RegisterModule("TStrangeModelDict",
headers, includePaths, payloadCode, fwdDeclCode,
TriggerDictionaryInitialization_TStrangeModelDict_Impl, {}, classesHeaders);
isInitialized = true;
}
}
static struct DictInit {
DictInit() {
TriggerDictionaryInitialization_TStrangeModelDict_Impl();
}
} __TheDictionaryInitializer;
}
void TriggerDictionaryInitialization_TStrangeModelDict() {
TriggerDictionaryInitialization_TStrangeModelDict_Impl();
}
| [
"martinus.govers@ugent.be"
] | martinus.govers@ugent.be |
c74dead7b434611ad6ebfaa1e396c2c2075efced | 67bf50a3b32b37d95c2601793f2ed69f178de5fc | /Phase1/falcon/PostingsValue.cpp | 5f3d4a1beaa4825d06c3a487c8722e57392a40ac | [] | no_license | rsonkhla/IR-Project | da24beaf6abd1dcfd3063771ae00827ad288b339 | e535a912bac8f4b59a71634e65283ddf35ff9e09 | refs/heads/master | 2020-05-29T17:21:10.874139 | 2012-09-21T00:40:49 | 2012-09-21T00:40:49 | 5,894,947 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 260 | cpp | #include "PostingsValue.h"
PostingValue::PostingValue()
{
m_iDocId = 0;
m_iTermFreq = 0;
}
PostingValue::~PostingValue()
{
}
const bool PostingValue::operator< (PostingValue &pstngVal) const
{
return m_iTermFreq > pstngVal.m_iTermFreq;
} | [
"raman@Peace.(none)"
] | raman@Peace.(none) |
d936400335b3eeb1b341ed0f604955d95b902eff | 7d4faba77af44f30d314cf3a9f7590c33dd2cdff | /VedaSwig/src/Simulation/main.cpp | bef4ef320250d4bbd1260c6bb4ce01ac798a96d4 | [] | no_license | BackupTheBerlios/veda-svn | ece326b3fa36460c3ee9255253baf802b335e7cd | fbc4c608fea9880b0bf418bd4154f205d89b4302 | refs/heads/master | 2020-12-24T17:35:16.139115 | 2006-10-02T09:57:45 | 2006-10-02T09:57:45 | 40,799,946 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,303 | cpp | #include <iostream>
#include <sstream>
#include <string>
#include <tinyxml/tinyxml.h>
#include "Log.hpp"
#include "Geometry/Point.hpp"
#include "Geometry/Polygon.hpp"
#include "Geometry/Grid.hpp"
#include "Packing/OArchive.hpp"
#include "Packing/IArchive.hpp"
#include "Packing/Archive.hpp"
#include "Packing/OXmlArchive.hpp"
#include "Packing/IXmlArchive.hpp"
#include "Physics/Particle.hpp"
#include "Physics/Area.hpp"
using namespace std;
using namespace Geometry;
using namespace Physics;
using namespace Packing;
int main(int argc, char** argv)
{
/* test serialization */
Area<double, double> area;
OArchive coar(cout);
cout<<"Test area archiving"<<endl;
coar.open();
coar & area;
coar.close();
cout<<endl;
area.initTest();
int n = 3, m = 5;
/*
ofstream ofs("test.xml");
OXmlArchive oxml(ofs);
oxml.open();
oxml & nvp("area", area);
oxml & nvp("n", n) & m;
oxml.close();
ofs.close();
*/
Area<double, double> iarea;
/*
ifstream ifs("test.xml");
IXmlArchive ixml(ifs);
ixml.open();
ixml & nvp("area", iarea);
ixml.close();
ifs.close();
*/
coar.open();
coar & nvp("iarea", iarea);
coar.close();
/* polygon out */
Polygon poly;
OXmlArchive oxml2;
oxml2.open();
oxml2 & nvp("poly", poly);
oxml2.close();
return 0;
}
| [
"aduha@24cd95de-1f16-0410-a8f5-8c352942cd3e"
] | aduha@24cd95de-1f16-0410-a8f5-8c352942cd3e |
1362764a333ac7cf6c22ee2d25981c17b087fe8b | 2b770890e4c69c07f61d6770c26ef068f2316d91 | /client/Windows/LICE/dirscan.h | f3a08511de1ec710a3dc474a10c1b7a7f0d97dfc | [
"Apache-2.0"
] | permissive | pain666/RDP | 003ec2a178a6b3f133f52851ec6fffbaf6433311 | 27d2ef7374b05548dc26de2c2dbd6569c88625aa | refs/heads/master | 2020-03-26T09:45:56.956236 | 2018-09-08T16:55:51 | 2018-09-08T16:55:51 | 144,763,641 | 1 | 0 | Apache-2.0 | 2018-09-06T20:41:12 | 2018-08-14T19:28:41 | C | UTF-8 | C++ | false | false | 7,621 | h | /*
WDL - dirscan.h
Copyright (C) 2005 and later Cockos Incorporated
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
Permission is granted to anyone to use this software for any purpose,
including commercial applications, and to alter it and redistribute it
freely, subject to the following restrictions:
1. The origin of this software must not be misrepresented; you must not
claim that you wrote the original software. If you use this software
in a product, an acknowledgment in the product documentation would be
appreciated but is not required.
2. Altered source versions must be plainly marked as such, and must not be
misrepresented as being the original software.
3. This notice may not be removed or altered from any source distribution.
*/
/*
This file provides the interface and implementation for WDL_DirScan, a simple
(and somewhat portable) directory reading class. On non-Win32 systems it wraps
opendir()/readdir()/etc. On Win32, it uses FindFirst*, and supports wildcards as
well.
*/
#ifndef _WDL_DIRSCAN_H_
#define _WDL_DIRSCAN_H_
#include "wdlstring.h"
#ifndef _WIN32
#include <sys/types.h>
#include <sys/stat.h>
#include <dirent.h>
#endif
class WDL_DirScan
{
public:
WDL_DirScan() :
#ifdef _WIN32
m_h(INVALID_HANDLE_VALUE)
#ifndef WDL_NO_SUPPORT_UTF8
, m_wcmode(false)
#endif
#else
m_h(NULL), m_ent(NULL)
#endif
{
}
~WDL_DirScan()
{
Close();
}
int First(const char *dirname
#ifdef _WIN32
, int isExactSpec=0
#endif
) // returns 0 if success
{
WDL_FastString scanstr(dirname);
const int l = scanstr.GetLength();
if (l < 1) return -1;
#ifdef _WIN32
if (!isExactSpec)
{
if (dirname[l-1] == '\\' || dirname[l-1] == '/') scanstr.SetLen(l-1);
m_leading_path = scanstr;
scanstr.Append("\\*");
}
else
{
m_leading_path = scanstr;
// remove trailing wildcards and directory separator from m_leading_path
const char *sp = m_leading_path.Get();
int idx = m_leading_path.GetLength() - 1;
while (idx > 0 && sp[idx] != '/' && sp[idx] != '\\') idx--;
if (idx > 0) m_leading_path.SetLen(idx);
}
#else
if (dirname[l-1] == '\\' || dirname[l-1] == '/') scanstr.SetLen(l-1);
m_leading_path = scanstr;
if (!scanstr.GetLength()) scanstr.Set("/"); // fix for scanning /
#endif
Close();
#ifdef _WIN32
#ifndef WDL_NO_SUPPORT_UTF8
m_h=INVALID_HANDLE_VALUE;
#ifdef WDL_SUPPORT_WIN9X
m_wcmode = GetVersion()< 0x80000000;
#else
m_wcmode = true;
#endif
if (m_wcmode)
{
int reqbuf = MultiByteToWideChar(CP_UTF8,MB_ERR_INVALID_CHARS,scanstr.Get(),-1,NULL,0);
if (reqbuf > 1000)
{
WDL_TypedBuf<WCHAR> tmp;
tmp.Resize(reqbuf+10);
if (MultiByteToWideChar(CP_UTF8,MB_ERR_INVALID_CHARS,scanstr.Get(),-1,tmp.Get(),tmp.GetSize()))
m_h=FindFirstFileW(tmp.Get(),&m_fd);
}
else
{
WCHAR wfilename[1024];
if (MultiByteToWideChar(CP_UTF8,MB_ERR_INVALID_CHARS,scanstr.Get(),-1,wfilename,1024))
m_h=FindFirstFileW(wfilename,&m_fd);
}
}
if (m_h==INVALID_HANDLE_VALUE) m_wcmode=false;
if (m_h==INVALID_HANDLE_VALUE)
#endif
m_h=FindFirstFile(scanstr.Get(),(WIN32_FIND_DATA*)&m_fd);
return (m_h == INVALID_HANDLE_VALUE);
#else
m_ent=0;
m_h=opendir(scanstr.Get());
return !m_h || Next();
#endif
}
int Next() // returns 0 on success
{
#ifdef _WIN32
if (m_h == INVALID_HANDLE_VALUE) return -1;
#ifndef WDL_NO_SUPPORT_UTF8
if (m_wcmode) return !FindNextFileW(m_h,&m_fd);
#endif
return !FindNextFile(m_h,(WIN32_FIND_DATA*)&m_fd);
#else
if (!m_h) return -1;
return !(m_ent=readdir(m_h));
#endif
}
void Close()
{
#ifdef _WIN32
if (m_h != INVALID_HANDLE_VALUE) FindClose(m_h);
m_h=INVALID_HANDLE_VALUE;
#else
if (m_h) closedir(m_h);
m_h=0; m_ent=0;
#endif
}
#ifdef _WIN32
const char *GetCurrentFN()
{
#ifndef WDL_NO_SUPPORT_UTF8
if (m_wcmode)
{
if (!WideCharToMultiByte(CP_UTF8,0,m_fd.cFileName,-1,m_tmpbuf,sizeof(m_tmpbuf),NULL,NULL))
m_tmpbuf[0]=0;
return m_tmpbuf;
}
#endif
return ((WIN32_FIND_DATA *)&m_fd)->cFileName;
}
#else
const char *GetCurrentFN() const { return m_ent?m_ent->d_name : ""; }
#endif
template<class T> void GetCurrentFullFN(T *str)
{
str->Set(m_leading_path.Get());
#ifdef _WIN32
str->Append("\\");
#else
str->Append("/");
#endif
str->Append(GetCurrentFN());
}
int GetCurrentIsDirectory() const
{
#ifdef _WIN32
return !!(m_fd.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY);
#else
#ifndef __APPLE__
// we could enable this on OSX, need to check to make sure realpath(x,NULL) is supported on 10.5+
char tmp[2048];
if (m_ent && m_ent->d_type == DT_LNK)
{
snprintf(tmp,sizeof(tmp),"%s/%s",m_leading_path.Get(),m_ent->d_name);
char *rp = realpath(tmp,NULL);
if (rp)
{
DIR *d = opendir(rp);
free(rp);
if (d) { closedir(d); return 1; }
}
}
else if (m_ent && m_ent->d_type == DT_UNKNOWN)
{
snprintf(tmp,sizeof(tmp),"%s/%s",m_leading_path.Get(),m_ent->d_name);
DIR *d = opendir(tmp);
if (d) { closedir(d); return 1; }
}
#endif
return m_ent && (m_ent->d_type == DT_DIR);
#endif
}
// these are somewhat windows specific calls, eh
#ifdef _WIN32
DWORD GetCurrentFileSize(DWORD *HighWord=NULL) const { if (HighWord) *HighWord = m_fd.nFileSizeHigh; return m_fd.nFileSizeLow; }
void GetCurrentLastWriteTime(FILETIME *ft) const { *ft = m_fd.ftLastWriteTime; }
void GetCurrentLastAccessTime(FILETIME *ft) const { *ft = m_fd.ftLastAccessTime; }
void GetCurrentCreationTime(FILETIME *ft) const { *ft = m_fd.ftCreationTime; }
DWORD GetFileAttributes() const { return m_fd.dwFileAttributes; }
#elif defined(_WDL_SWELL_H_)
// todo: compat for more of these functions
void GetCurrentLastWriteTime(FILETIME *ft)
{
char tmp[2048];
snprintf(tmp,sizeof(tmp),"%s/%s",m_leading_path.Get(),GetCurrentFN());
struct stat64 st={0,};
stat64(tmp,&st);
unsigned long long a=(unsigned long long)st.st_mtime; // seconds since january 1st, 1970
a+=11644473600ull; // 1601->1970
a*=10000000; // seconds to 1/10th microseconds (100 nanoseconds)
ft->dwLowDateTime=a & 0xffffffff;
ft->dwHighDateTime=a>>32;
}
DWORD GetCurrentFileSize(DWORD *HighWord=NULL)
{
char tmp[2048];
snprintf(tmp,sizeof(tmp),"%s/%s",m_leading_path.Get(),GetCurrentFN());
struct stat64 st={0,};
stat64(tmp,&st);
if (HighWord) *HighWord = (DWORD)(st.st_size>>32);
return (DWORD)(st.st_size&0xffffffff);
}
#endif
private:
#ifdef _WIN32
#ifndef WDL_NO_SUPPORT_UTF8
bool m_wcmode;
WIN32_FIND_DATAW m_fd;
char m_tmpbuf[MAX_PATH*5]; // even if each byte gets encoded as 4 utf-8 bytes this should be plenty ;)
#else
WIN32_FIND_DATA m_fd;
#endif
HANDLE m_h;
#else
DIR *m_h;
struct dirent *m_ent;
#endif
WDL_FastString m_leading_path;
} WDL_FIXALIGN;
#endif
| [
"shafx@yandex.ru"
] | shafx@yandex.ru |
ddfb2d4cbcf47fc93d88b5af2c8bf6e9a5f885ef | 6d8c4bc4560bc9b193fd2336eb03494f1bb5c98f | /src/main.cpp | 0a1454f884b19b5fce48869104010c2ebc6878cb | [
"MIT"
] | permissive | Zhaoxian-Wu/zokufu | 64aea2411788dc1a02865196767d85b8d4c3db5e | 6adeb6f6d33c9c33acf7df16ee58c3ec8eb3a5b1 | refs/heads/master | 2022-10-31T06:48:18.656995 | 2017-11-11T04:36:34 | 2017-11-11T04:36:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 82 | cpp | #include <iostream>
#include <fstream>
using namespace std;
int main() {
}
| [
"MrFive9999@qq.com"
] | MrFive9999@qq.com |
855ded953c3b1a60525ee4ebc4032c968ec55c73 | cb19dd63176c30292ec535f21ee89df3ce2b4708 | /examples/updater/main.hpp | 5dd4a5669dd90c35480a10e7ed523b707454c698 | [
"MIT"
] | permissive | ma1co/OpenMemories-Platform | 1a3772dfdf4cc9be4ce7577739f14ba85dd7f141 | 85bcb5454bc68a971b674d3b9e93eeedbf35cf3c | refs/heads/master | 2022-08-28T20:40:04.252707 | 2022-06-09T15:18:48 | 2022-06-09T15:18:48 | 78,056,788 | 20 | 6 | null | null | null | null | UTF-8 | C++ | false | false | 270 | hpp | #pragma once
#include "updater/updaterbody.hpp"
class UpdaterBodyImpl : public Updater::UpdaterBody
{
public:
virtual ~UpdaterBodyImpl() {}
virtual bool Execute(Updater::RingBuffer *buffer, Updater::CallbackInterface *interface);
virtual void Stop() {}
};
| [
"ma1co@users.noreply.github.com"
] | ma1co@users.noreply.github.com |
8e83f61a29f43eac97dc4c3713110568cff60aa8 | 891c20f56f5afa7a26e8fac11e9db5fa9622ea6e | /Basic C++ Concepts/paper/13.cpp | 1456a91cb48cdfa347a8e9cc3e559dfffed384f3 | [] | no_license | muhamdasim/CPP | 9054a5735ea976c2a131849a736cecaa30061d65 | b7a274ca36eba05240a9d83a6b6f758928bf3de5 | refs/heads/master | 2022-11-10T03:04:08.940348 | 2020-07-06T00:29:40 | 2020-07-06T00:29:40 | 229,776,812 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 286 | cpp | #include <iostream>
using namespace std;
void rightangle(int n)
{
for (int i=1 ; i<=n ; i++)
{
for (int j=1 ; j<=i ; j++)
{
if (j==1 || j==i || i==n)
cout <<"*";
else
cout <<" " ;
}
cout <<endl;
}
}
int main()
{
int n;
cin>>n;
rightangle(n);
}s
| [
"47195175+muhamdasim@users.noreply.github.com"
] | 47195175+muhamdasim@users.noreply.github.com |
c14558b75d21bd71890d3b975d7ca08137f3b6e7 | 7d97cd36a83f4a633d3e37ba0649bb06e986eb6d | /MFC42102/MFC42102/MFC42102Doc.h | 2426cb5d90a0e8ecf9fc632d5944c263105f4fe0 | [] | no_license | Ms52527/MA | 53215fb62b8bf083db10b25363fabb4a6d89e9e5 | 6e8d8d0885586e4363b777719600c51e5de15ef0 | refs/heads/master | 2021-02-15T11:23:01.432593 | 2020-07-05T12:33:41 | 2020-07-05T12:33:41 | 244,893,687 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 857 | h |
// MFC42102Doc.h : CMFC42102Doc 类的接口
//
#pragma once
class CMFC42102Doc : public CDocument
{
protected: // 仅从序列化创建
CMFC42102Doc();
DECLARE_DYNCREATE(CMFC42102Doc)
// 特性
public:
// 操作
public:
// 重写
public:
virtual BOOL OnNewDocument();
virtual void Serialize(CArchive& ar);
#ifdef SHARED_HANDLERS
virtual void InitializeSearchContent();
virtual void OnDrawThumbnail(CDC& dc, LPRECT lprcBounds);
#endif // SHARED_HANDLERS
// 实现
public:
virtual ~CMFC42102Doc();
#ifdef _DEBUG
virtual void AssertValid() const;
virtual void Dump(CDumpContext& dc) const;
#endif
protected:
// 生成的消息映射函数
protected:
DECLARE_MESSAGE_MAP()
#ifdef SHARED_HANDLERS
// 用于为搜索处理程序设置搜索内容的 Helper 函数
void SetSearchContent(const CString& value);
#endif // SHARED_HANDLERS
};
| [
"757291022@qq.com"
] | 757291022@qq.com |
87ab2eebc7bf5e87b968422e06c2859d65beb4d1 | 9347654bc003e5bbb1522ffc3d42ef2a05f294ff | /kraskovmi.cpp | 6c07bde67029e1edca2a3c6ffdca07b0ffa3e225 | [
"Apache-2.0"
] | permissive | adityarawal/evolving-complexity | 3cdf21ba1e387b3fd269dd7bf5991488ecffbd96 | 2f79d323a874fd0c9176adda6ed2242ebe6768fd | refs/heads/master | 2020-04-12T08:47:05.271425 | 2015-08-03T19:05:31 | 2015-08-03T19:05:31 | 41,374,231 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 21,885 | cpp | #include "kraskovmi.h"
bool myfunction (double i,double j) { return (i<j); }
bool sort_pred(const std::pair<double,int> &left, const std::pair<double,int> &right) {
return left.first < right.first;
}
double kraskov_mutual_information(int k, const vector<double> &X, const vector<double> &Y) {
//Create a 2D grid for the x, y points
if (X.size() != Y.size()) {
std::cout<<" Error('X and Y must contain the same number of samples')"<<std::endl;
}
int nObs = X.size();
double max_X = 1.0; //Assumption: since sigmoid values always range between 0-1
double min_X = 0.0; //Assumption: since sigmoid values always range between 0-1
//dz = zeros(nObs, nObs);
//dx = zeros(nObs, nObs);
//dy = zeros(nObs, nObs);
//Divide the space into a 2-D square grid of size (k/N)^(1/2)
//Store values/pointers of X/Y values of the random variables
double twoD_blocklen = sqrt((double)(k*10)/nObs);// Can be changed after experimentation to suit the data distribution
int twoD_numblocks = ceil((max_X-min_X)/twoD_blocklen);
twoD_blocklen = (max_X-min_X)/twoD_numblocks; //Update based on the rounded off value of num blocks
vector<vector<vector<double> > > twoD_grid(twoD_numblocks, vector<vector<double> >(twoD_numblocks));//2D grid. For each block, list of points inside the block
std::vector<std::vector<double> > twoD_gridloc(nObs, vector<double> (2)); //For each point, returns the x, y coordinate of the block
int twoDgrid_x_min = 0;
int twoDgrid_x_max = twoD_numblocks-1;
int twoDgrid_y_min = 0;
int twoDgrid_y_max = twoD_numblocks-1;
//vector<vector<double> > points_knn(nObs, vector<double> (2));//x, y coordinate of the k-th nearest neighbor
vector<double> dist_knn(nObs,-1.0);
//Create 1-D grid for x and y variables and compute number of points
//in axis which are strictly less than dist_knn(i) apart from x(i)
// and y(i) respectively
double oneD_slicelen = ((double)50/nObs);// Can be changed after experimentation to suit the data distribution
int oneD_numslice = ceil((max_X-min_X)/oneD_slicelen);
oneD_slicelen = (max_X-min_X)/oneD_numslice; //Update based on the rounded off value of num blocks
vector<vector<double> > oneD_x_grid(oneD_numslice);//1D grid has x locations of the points lying inside each slice of the grid
vector<vector<double> > oneD_y_grid(oneD_numslice);//1D grid has y locations of the points lying inside each slice of the grid
vector<double> oneD_x_gridloc(nObs);//1D x grid slice location for each point
vector<double> oneD_y_gridloc(nObs);//1D y grid slice location for each point
int oneDgrid_x_min = 0;
int oneDgrid_x_max = oneD_numslice-1;
int oneDgrid_y_min = 0;
int oneDgrid_y_max = oneD_numslice-1;
vector <int> nx(nObs);//Number of x points that are strictly nearer to the point of interest than the knn
vector <int> ny(nObs);//Number of y points that are strictly nearer to the point of interest than the knn
clock_t start, end, start1, end1;
for (int i=0; i<nObs; i++) {
//if (X[i] == 1) {
// X[i] = X[i] - 0.0000001; //Subtract small number to make sure last block is seleced
//}
//if (Y[i] == 1){
// Y[i] = Y[i] - 0.0000001; //Subtract small number to make sure last block is selected
//}
//Create 2D grid
int block_x_loc = floor((double)X[i]/twoD_blocklen); //Change ceil to floor for python/c++
int block_y_loc = floor((double)Y[i]/twoD_blocklen); //Change ceil to floor for python/c++
twoD_grid[block_x_loc][block_y_loc].push_back(X[i]);
twoD_grid[block_x_loc][block_y_loc].push_back(Y[i]);
twoD_gridloc[i][0] = block_x_loc;
twoD_gridloc[i][1] = block_y_loc;
//Create 1D grid
int slice_x_loc = floor((double)X[i]/oneD_slicelen); //Change ceil to floor for python/c++
int slice_y_loc = floor((double)Y[i]/oneD_slicelen); //Change ceil to floor for python/c++
oneD_x_grid[slice_x_loc].push_back(X[i]);
oneD_y_grid[slice_y_loc].push_back(Y[i]);
oneD_x_gridloc[i] = slice_x_loc;
oneD_y_gridloc[i] = slice_y_loc;
}
//For each point, find the k-th nearest neighbor by checking nearby grids
for (int i=0; i<nObs; i++) {
bool found_knn = false;
bool found_nn = false;
int ring_num = 0;
int block_x_loc = twoD_gridloc[i][0];
int block_y_loc = twoD_gridloc[i][1];
vector <double> list_nn;
vector <double> list_nndist;
vector <double> temp_list_nn;
vector <double> temp_list_nndist;
vector <double> list_of_blocks;
//Find the distance to the k nearest neighbor
while (found_knn == false) {
//Step 1 - Evaluate current ring blocks and find the nearest point
list_of_blocks = calc_ring_blocks(block_x_loc, block_y_loc, ring_num,
twoDgrid_x_max, twoDgrid_x_min, twoDgrid_y_max, twoDgrid_y_min);
found_nn = twoD_nearest_neighbor(temp_list_nn, temp_list_nndist, list_of_blocks, X[i], Y[i], twoD_grid,k);
if(found_nn){
list_nn.insert(list_nn.end(), temp_list_nn.begin(), temp_list_nn.end());
list_nndist.insert(list_nndist.end(), temp_list_nndist.begin(), temp_list_nndist.end());
}
temp_list_nn.clear();
temp_list_nndist.clear();
//If nearest point found, then validate by going to Step 2.
if ((list_nn.size()/2)>=k) {
//Step 2 - Validate by going to the next ring.
ring_num = ring_num + 1;
list_of_blocks = calc_ring_blocks(block_x_loc, block_y_loc, ring_num,
twoDgrid_x_max, twoDgrid_x_min, twoDgrid_y_max, twoDgrid_y_min);
found_nn = twoD_nearest_neighbor(temp_list_nn, temp_list_nndist, list_of_blocks, X[i], Y[i], twoD_grid,k);
if(found_nn) {
list_nn.insert(list_nn.end(), temp_list_nn.begin(), temp_list_nn.end());
list_nndist.insert(list_nndist.end(), temp_list_nndist.begin(), temp_list_nndist.end());
}
temp_list_nn.clear();
temp_list_nndist.clear();
//Find distance to the kth nearest neighbor
int temp_ind;
double temp_dist;
double large_num = 100.00;
for (int j=0; j<k; j++) {
temp_ind = min_element( list_nndist.begin(), list_nndist.end() ) - list_nndist.begin();
temp_dist = list_nndist[temp_ind];
list_nndist[temp_ind] = large_num;//Replace smallest element with a large number to find the next smallest
}
int ind_kth = temp_ind;//Index of the k nearest neighbor
dist_knn[i] = temp_dist;
////Create a vector of list_nndist indexes
found_knn = true;
//********************OLD APPROACH TO FIND DISTANCE TO K-NN*********************
////Create a vector of list_nndist indexes
//std::vector<int> ind(list_nndist.size());
//for (int j=0; j<ind.size(); j++) {
// ind[j] = j;
//}
////Create a pair of list_nndist and its indexes
//vector<pair<double,int> > nndist_ind_pair(list_nndist.size());
//for (int j=0; j<ind.size(); j++) {
// nndist_ind_pair[j].first = list_nndist[j];
// nndist_ind_pair[j].second = ind[j];
//}
//Sort in ascending order of distance
//std::sort(nndist_ind_pair.begin(), nndist_ind_pair.end(), sort_pred);
//int ind_kth = nndist_ind_pair[k-1].second;//Index of the k nearest neighbor
//points_knn[i][0] = list_nn[ind_kth*2]; //x location of k-th nearest point
//points_knn[i][1] = list_nn[ind_kth*2+1]; //y location of k-th nearest point
//dist_knn[i] = list_nndist[ind_kth];
//********************OLD APPROACH TO FIND DISTANCE TO K-NN*********************
}
//If no point found, then go to the next ring and go back to Step 1
else{
ring_num = ring_num + 1;
}
}
//Find total number of points on x grid which are strictly less than k nearest distance
//apart from the point of interest
nx[i] = total_nearby_points(X[i], oneD_x_grid, dist_knn[i], oneDgrid_x_min, oneDgrid_x_max, oneD_slicelen);
//%Find points on y grid ....
ny[i] = total_nearby_points(Y[i], oneD_y_grid, dist_knn[i], oneDgrid_y_min, oneDgrid_y_max, oneD_slicelen);
}
double mutual_info = 0.0;
double average = 0.0;
for (int i=0; i<nx.size(); i++) {
average = average + digama(nx[i] + 1);
average = average + digama(ny[i] + 1);
}
average = average/nObs;
mutual_info = digama(k) - average + digama(nObs); //psi(k) - sum(psi(nx + 1) + psi(ny + 1)) / nObs + psi(nObs)
//If Mutual information is negative, make it zero
//Mutual Information can be greater than 1
if (mutual_info < 0.0) {
mutual_info = 0.0;
}
return mutual_info;
}
vector<double> calc_ring_blocks(int block_x_loc, int block_y_loc, int ring_num,
int grid_x_max, int grid_x_min, int grid_y_max, int grid_y_min) {
//Returns a vector of x, y coordinate of all the blocks in a specific ring around the
//current block
vector <double> list_of_blocks;
int next_block_x;
int next_block_y;
for (int i=-ring_num; i <=ring_num; i++) {
for (int j=-ring_num; j <=ring_num; j++) {
next_block_x = block_x_loc + i;
next_block_y = block_y_loc + j;
if ((i != -ring_num && i != ring_num) && (j != -ring_num && j != ring_num)
|| next_block_x < grid_x_min || next_block_x > grid_x_max
|| next_block_y < grid_y_min || next_block_y > grid_y_max){
continue;
}
else{
list_of_blocks.push_back(next_block_x);
list_of_blocks.push_back(next_block_y);
}
}
}
return list_of_blocks;
}
bool twoD_nearest_neighbor(vector <double>& list_nn, vector <double>& list_nndist, vector <double> list_of_blocks,
double x, double y, vector<vector<vector<double> > > twoD_grid, int k) {
//compute distance between each sample and its k-th nearest neighbour
//x, y - point of interest
//list_of_blocks - find the shortest distance between point of interest and
//the points residing inside the list_of_blocks
bool found_nn;
int num_blocks = list_of_blocks.size()/2;//List of blocks has the x, y location of the blocks
int block_x_loc;
int block_y_loc;
vector <double> points_in_block;
double dx, dy, dz;
//If the point of interest lies within the list_of_blocks, then exclude the point (not the
//duplicates) while calculating the nearest neighbor
bool flag = false;
for (int i = 0; i<num_blocks; i++) {
block_x_loc = list_of_blocks[i*2];
block_y_loc = list_of_blocks[i*2+1];
points_in_block = twoD_grid[block_x_loc][block_y_loc];
for (int j=0; j<points_in_block.size()/2; j++) {
dx = abs(points_in_block[j*2]-x);
dy = abs(points_in_block[j*2+1]-y);
if (dx == 0 && dy==0 && flag == false) {
flag = true;
continue;
}
else {
if (dx>dy) {
dz = dx;
}
else {
dz = dy;
}
list_nndist.push_back(dz);
list_nn.push_back(points_in_block[j*2]); //Copy x coordinate
list_nn.push_back(points_in_block[j*2+1]);//Copy y coordinate
}
}
}
if (list_nn.empty()) { //No point found
found_nn = false;
}
else { //Some points found
found_nn = true;
}
return found_nn;
}
int total_nearby_points(double x, vector<vector<double> > oneD_grid, double dist_knn, int oneDgrid_min,
int oneDgrid_max, double oneD_slicelen) {
//Find points on x which are STRICTLY LESS than k nearest distance
//apart from the point of interest
int nx=0;
int ring_num = 0;
int init_slice_loc = floor((double)x/oneD_slicelen);
vector <int> list_of_slices(1,init_slice_loc);
bool found_left_side = true;
bool found_right_side = true;
bool flag = false;
int slice_loc;
vector <double> points_in_slice;
double dx;
//No points can be nearer than the duplicate point
if (dist_knn == 0) {
nx = 0;
return nx;
}
while(found_left_side || found_right_side) { //Check to ensure both sides of the point are explored
for (int i=0;i<list_of_slices.size(); i++) {
slice_loc = list_of_slices[i];
points_in_slice = oneD_grid[slice_loc];
for (int j=0; j<points_in_slice.size(); j++) {
dx = abs(points_in_slice[j]-x);
if (dx == 0 && flag == false) {//Ignore the point of interest but consider other duplicate points
flag = true;
continue;
}
if (dx < dist_knn) {
nx = nx + 1;
}
else {
if (slice_loc < init_slice_loc) { //Nothing found on left side
found_left_side = false;
}
else if (slice_loc > init_slice_loc) { //Nothing found on right side
found_right_side = false;
}
else {//For points lying in the same slice as the point of interest
if (points_in_slice[j] < x){
found_left_side=false;
}
else if (points_in_slice[j] > x){
found_right_side = false;
}
else{
cout<< "Error: Duplicate point in total_nearby_points "<<x<<" "<<points_in_slice[j] <<" "<<dx<<" "<<dist_knn <<endl;
}
}
}
}
}
ring_num = ring_num + 1;
list_of_slices.clear();
if (((init_slice_loc-ring_num) >= oneDgrid_min) && found_left_side == true) {
list_of_slices.push_back(init_slice_loc-ring_num);
}
else {
found_left_side = false;
}
if (((init_slice_loc+ring_num) <= oneDgrid_max) && found_right_side == true){
list_of_slices.push_back(init_slice_loc+ring_num);
}
else {
found_right_side = false;
}
}
return nx;
}
double digama ( double x)
//****************************************************************************80
//
// Purpose:
//
// DIGAMA calculates DIGAMMA ( X ) = d ( LOG ( GAMMA ( X ) ) ) / dX
//
// Licensing:
//
// This code is distributed under the GNU LGPL license.
//
// Modified:
//
// 03 June 2013
//
// Author:
//
// Original FORTRAN77 version by Jose Bernardo.
// C++ version by John Burkardt.
//
// Reference:
//
// Jose Bernardo,
// Algorithm AS 103:
// Psi ( Digamma ) Function,
// Applied Statistics,
// Volume 25, Number 3, 1976, pages 315-317.
//
// Parameters:
//
// Input, double X, the argument of the digamma function.
// 0 < X.
//
// Output, int *IFAULT, error flag.
// 0, no error.
// 1, X <= 0.
//
// Output, double DIGAMA, the value of the digamma function at X.
//
{
double euler_mascheroni = 0.57721566490153286060;
double r;
double value;
double x2;
//
// Check the input.
//
if ( x <= 0.0 )
{
value = 0.0;
//*ifault = 1;
return value;
}
//
// Initialize.
//
//*ifault = 0;
x2 = x;
value = 0.0;
//
// Use approximation for small argument.
//
if ( x2 <= 0.00001 )
{
value = - euler_mascheroni - 1.0 / x2;
return value;
}
//
// Reduce to DIGAMA(X + N).
//
while ( x2 < 8.5 )
{
value = value - 1.0 / x2;
x2 = x2 + 1.0;
}
//
// Use Stirling's (actually de Moivre's) expansion.
//
r = 1.0 / x2;
value = value + log ( x2 ) - 0.5 * r;
r = r * r;
value = value
- r * ( 1.0 / 12.0
- r * ( 1.0 / 120.0
- r * 1.0 / 252.0 ) );
return value;
}
double slow_kraskov_mutual_information(int k, const vector<double> &X, const vector<double> &Y) {
if (X.size() != Y.size()) {
std::cout<<" Error('X and Y must contain the same number of samples')"<<std::endl;
}
int nObs = X.size();
vector < vector <double> > dx (nObs, vector <double> (nObs, -1.0));
vector < vector <double> > dy (nObs, vector <double> (nObs, -1.0));
vector < vector <double> > dz (nObs, vector <double> (nObs, -1.0));
vector <int> nx(nObs);//Number of x points that are strictly nearer to the point of interest than the knn
vector <int> ny(nObs);//Number of y points that are strictly nearer to the point of interest than the knn
vector<double> dist_knn(nObs,-1.0);
for (int i = 0; i < nObs; i++) {
for (int j = 0; j < nObs; j++) {
dx[i][j] = abs(X[i]- X[j]);
dy[i][j] = abs(Y[i]- Y[j]);
if (dx[i][j] > dy[i][j]) {
dz[i][j] =dx[i][j];
}
else {
dz[i][j] =dy[i][j];
}
}
}
for (int i = 0; i < nObs; i++) {
vector <double> dxSample = dx[i];
vector <double> dySample = dy[i];
vector <double> dzSample = dz[i];
dxSample.erase(dxSample.begin() + i);
dySample.erase(dySample.begin() + i);
dzSample.erase(dzSample.begin() + i);
int temp_ind;
double temp_dist;
double large_num = 100.00;
for (int j=0; j<k; j++) {
temp_ind = min_element( dzSample.begin(), dzSample.end() ) - dzSample.begin();
temp_dist = dzSample[temp_ind];
dzSample[temp_ind] = large_num;//Replace smallest element with a large number to find the next smallest
}
int ind_kth = temp_ind;//Index of the k nearest neighbor
dist_knn[i] = temp_dist;
bool found_flag = false;
//X-axis
std::sort (dxSample.begin(), dxSample.end(), myfunction);
for (int j=0; j < dxSample.size(); j++) {
if (dxSample[j]<dist_knn[i]) {
nx[i]+= 1;
}
else {
break;
}
}
//Y-axis
std::sort (dySample.begin(), dySample.end(), myfunction);
for (int j=0; j < dySample.size(); j++) {
if (dySample[j]<dist_knn[i]) {
ny[i]+= 1;
}
else {
break;
}
}
}
double mutual_info = 0.0;
double average = 0.0;
for (int i=0; i<nx.size(); i++) {
average = average + digama(nx[i] + 1);
average = average + digama(ny[i] + 1);
}
average = average/nObs;
mutual_info = digama(k) - average + digama(nObs); //psi(k) - sum(psi(nx + 1) + psi(ny + 1)) / nObs + psi(nObs)
//If Mutual information is negative, make it zero
//Mutual Information can be greater than 1
if (mutual_info < 0.0) {
mutual_info = 0.0;
}
return mutual_info;
}
| [
"83.aditya.rawal@gmail.com"
] | 83.aditya.rawal@gmail.com |
328469b3fa47a82f83d44c1892586de54bf06f40 | 8f60eb5560c657c699a13189a9f05ff38d06bad1 | /MotorPesquisa/MotorPesquisa/vetorObjeto.h | 7d4ece605424d5f5741733da26cd1a21e467b2d7 | [] | no_license | l-jhon/C-Plus-Plus | deb2e551e24d495d41859d21cc8bfc6f47d9661a | 8cb368e886c9beed4572109511d2f34ae1ba4283 | refs/heads/master | 2021-05-09T15:49:08.336602 | 2018-06-19T14:49:18 | 2018-06-19T14:49:18 | 119,097,547 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 129 | h | #ifndef VETOROBJETO_H
#define VETOROBJETO_H
class vetorObjeto
{
public:
vetorObjeto();
};
#endif // VETOROBJETO_H
| [
"jhonlucaslife@gmail.com"
] | jhonlucaslife@gmail.com |
869fd5b273bd89b0bb9f5ce9eea40605fc048966 | 81c61dad3c8c4785e8c70915543864686846c5b7 | /BitManipulation/260. Single Number III .cpp | 372321c6dc8ccf5ca12fe66609c9d211e62b2b80 | [] | no_license | csf0429/Leetcode-Solutions | eba3a783a132411b0cd930d310a11535462bbac6 | d31b57f7104c0c55adbdb9b4552b9ace666dcc20 | refs/heads/master | 2021-01-20T13:16:40.698971 | 2017-08-16T10:34:56 | 2017-08-16T10:34:56 | 90,467,401 | 0 | 0 | null | 2017-08-16T10:34:57 | 2017-05-06T14:10:20 | C++ | UTF-8 | C++ | false | false | 720 | cpp | //
// Created by 蔡少凡 on 7/3/17.
//
#include <iostream>
#include <vector>
using namespace std;
class Solution {
public:
vector<int> singleNumber(vector<int>& nums) {
int diff = 0;
for(int i:nums)
diff ^= i;
diff &=(-diff); //get last diff bit
int res1 = 0, res2 = 0;
for(int i : nums){
if((diff & i) == 0)
res1 ^= i;
else
res2 ^= i;
}
return vector<int> {res1,res2};
}
};
int main(){
vector<int> res;
vector<int> nums = {1, 2, 1, 3, 2, 5};
cout << Solution().singleNumber(nums)[0] << endl;
cout << Solution().singleNumber(nums)[1] << endl;
return 0;
} | [
"csf0429@gmail.com"
] | csf0429@gmail.com |
a9fc259db85845b632c0eceaf9b0ff869b5bcb92 | 4d39dcf549f4794b5acb5b5194bb8e996b6ce8db | /system/dev/display/vim-display/vim-audio-utils.h | 3c4751f1f4b50d5bbebce6bf7d20315fbc68abd3 | [
"BSD-3-Clause",
"MIT"
] | permissive | pheragu/zircon | 1ae1d48b86ec25f69eb0c82d0b32d877fe3e26aa | 45e425aabe8a99e671ff49ea4b6b39af765817c2 | refs/heads/master | 2020-03-29T10:22:56.127457 | 2018-10-19T06:00:44 | 2018-10-19T21:58:46 | 149,802,469 | 0 | 0 | null | 2018-09-21T18:28:40 | 2018-09-21T18:28:40 | null | UTF-8 | C++ | false | false | 1,847 | h | // Copyright 2018 The Fuchsia Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#pragma once
#include <ddk/protocol/platform-device.h>
#include <fbl/macros.h>
#include <fbl/ref_counted.h>
#include <fbl/ref_ptr.h>
#include <lib/zx/vmo.h>
#include <zircon/compiler.h>
#include <zircon/types.h>
namespace audio {
namespace vim2 {
class Registers : public fbl::RefCounted<Registers> {
public:
static fbl::RefPtr<Registers> Create(const platform_device_protocol_t* pdev,
uint32_t which_mmio,
zx_status_t* out_res);
DISALLOW_COPY_ASSIGN_AND_MOVE(Registers);
bool valid() const { return base_ != nullptr; }
volatile uint32_t& operator[](uint32_t r) const { return base_[r]; }
void SetBits(uint32_t r, uint32_t bits) const { ModBits(r, bits, bits); }
void ClrBits(uint32_t r, uint32_t bits) const { ModBits(r, bits, 0u); }
void ModBits(uint32_t r, uint32_t mask, uint32_t bits) const {
(*this)[r] = ((*this)[r] & ~mask) | (bits & mask);
}
private:
friend class fbl::RefPtr<Registers>;
Registers() = default;
~Registers();
zx_status_t Map(const platform_device_protocol_t* pdev, uint32_t which_mmio);
io_buffer_t buf_ = {};
volatile uint32_t* base_ = nullptr;
};
class RefCountedVmo : public fbl::RefCounted<RefCountedVmo>{
public:
static fbl::RefPtr<RefCountedVmo> Create(zx::vmo vmo);
DISALLOW_COPY_ASSIGN_AND_MOVE(RefCountedVmo);
const zx::vmo& vmo() { return vmo_; }
private:
friend class fbl::RefPtr<RefCountedVmo>;
explicit RefCountedVmo(zx::vmo vmo) : vmo_(fbl::move(vmo)) { }
~RefCountedVmo() = default;
const zx::vmo vmo_;
};
} // namespace vim2
} // namespace audio
| [
"johngro@google.com"
] | johngro@google.com |
1fc9dbd40281f11cff3d925ef4329147aa81b13f | 4ca2b09fb25a1e30ed02f7f471e675e9621c6b5e | /task_7_sensors/Code/libraries/StepperDriver-master/src/MultiDriver.cpp | eb7b5254a1823a73791056fe6b2587ff6256a0e9 | [
"MIT"
] | permissive | MRSD2018/minebot | c37ca9631d626e746500f04695710c556282c7f6 | 10b36904d292a9f067edaf7cd4cc2aa5d0c9f43f | refs/heads/master | 2021-01-23T17:09:25.776356 | 2018-04-02T16:08:02 | 2018-04-02T16:08:02 | 102,762,889 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,544 | cpp | /*
* Multi-motor group driver
*
* Copyright (C)2017 Laurentiu Badea
*
* This file may be redistributed under the terms of the MIT license.
* A copy of this license has been included with this distribution in the file LICENSE.
*/
#include "MultiDriver.h"
#define FOREACH_MOTOR(action) for (short i=count-1; i >= 0; i--){action;}
/*
* Initialize motor parameters
*/
void MultiDriver::startMove(long steps1, long steps2, long steps3){
long steps[3] = {steps1, steps2, steps3};
/*
* Initialize state for all active motors
*/
FOREACH_MOTOR(
if (steps[i]){
motors[i]->startMove(steps[i]);
event_timers[i] = 0;
} else {
event_timers[i] = -1;
}
);
ready = false;
}
/*
* Trigger next step action
*/
long MultiDriver::nextAction(void){
static unsigned long next_action_time = 0;
long next_action_interval = 0;
microWaitUntil(next_action_time);
// Trigger all the motors that need it (event timer = 0)
FOREACH_MOTOR(
if (event_timers[i] == 0){
event_timers[i] = motors[i]->nextAction();
}
);
// Find the time when the next pulse needs to fire
// this is the smallest non-zero timer value from all active motors
ready = true;
FOREACH_MOTOR(
if (event_timers[i] > 0){
ready = false;
if (event_timers[i] < next_action_interval || next_action_interval == 0){
next_action_interval = event_timers[i];
}
}
);
// Reduce all event timers by the current left time so 0 marks next
FOREACH_MOTOR(
if (event_timers[i] > 0){
event_timers[i] -= next_action_interval;
}
);
next_action_time = micros() + next_action_interval;
return next_action_interval;
}
/*
* Optionally, call this to begin braking to stop early
*/
void MultiDriver::startBrake(void){
FOREACH_MOTOR(
if (event_timers[i] >= 0){
motors[i]->startBrake();
}
)
}
/*
* State querying
*/
bool MultiDriver::isRunning(void){
bool running = false;
FOREACH_MOTOR(
if (motors[i]->getCurrentState() != Motor::STOPPED){
running = true;
break;
}
)
return running;
}
/*
* Move each motor the requested number of steps, in parallel
* positive to move forward, negative to reverse, 0 to remain still
*/
void MultiDriver::move(long steps1, long steps2, long steps3){
unsigned long next_event;
startMove(steps1, steps2, steps3);
while (!ready){
next_event = nextAction();
}
}
#define CALC_STEPS(i, deg) ((motors[i] && deg) ? motors[i]->calcStepsForRotation(deg) : 0)
void MultiDriver::rotate(long deg1, long deg2, long deg3){
move(CALC_STEPS(0, deg1), CALC_STEPS(1, deg2), CALC_STEPS(2, deg3));
}
void MultiDriver::rotate(double deg1, double deg2, double deg3){
move(CALC_STEPS(0, deg1), CALC_STEPS(1, deg2), CALC_STEPS(2, deg3));
}
void MultiDriver::startRotate(long deg1, long deg2, long deg3){
startMove(CALC_STEPS(0, deg1), CALC_STEPS(1, deg2), CALC_STEPS(2, deg3));
}
void MultiDriver::startRotate(double deg1, double deg2, double deg3){
startMove(CALC_STEPS(0, deg1), CALC_STEPS(1, deg2), CALC_STEPS(2, deg3));
}
void MultiDriver::setMicrostep(unsigned microsteps){
FOREACH_MOTOR(motors[i]->setMicrostep(microsteps));
}
void MultiDriver::enable(void){
FOREACH_MOTOR(motors[i]->enable());
}
void MultiDriver::disable(void){
FOREACH_MOTOR(motors[i]->disable());
}
| [
"6893531+GeorgiaC@users.noreply.github.com"
] | 6893531+GeorgiaC@users.noreply.github.com |
c38f21d665fa286dd1675d10b5086d828c412779 | 9e21b7819881da8f916dbd0f3299253424a105a5 | /include/third_party/WebKit/Source/platform/heap/ThreadState.h | d783081d30b28657c7c6ab1cbb5369cd5388df4a | [
"Apache-2.0"
] | permissive | yuske/spitfire | 10cc76bedd72871d5cff1a441b20ed54fb03a926 | e2e6c70d18473cb29b593e393681a28d03a5f1b3 | refs/heads/master | 2021-09-07T10:57:40.679242 | 2018-02-21T22:21:52 | 2018-02-21T22:21:52 | 104,356,972 | 0 | 0 | null | 2017-09-21T14:14:01 | 2017-09-21T14:14:01 | null | UTF-8 | C++ | false | false | 24,913 | h | /*
* Copyright (C) 2013 Google Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef ThreadState_h
#define ThreadState_h
#include <memory>
#include "platform/PlatformExport.h"
#include "platform/heap/BlinkGC.h"
#include "platform/heap/ThreadingTraits.h"
#include "platform/wtf/AddressSanitizer.h"
#include "platform/wtf/Allocator.h"
#include "platform/wtf/Forward.h"
#include "platform/wtf/Functional.h"
#include "platform/wtf/HashMap.h"
#include "platform/wtf/HashSet.h"
#include "platform/wtf/ThreadSpecific.h"
#include "platform/wtf/Threading.h"
#include "platform/wtf/ThreadingPrimitives.h"
#include "public/platform/WebThread.h"
namespace v8 {
class Isolate;
};
namespace blink {
class GarbageCollectedMixinConstructorMarkerBase;
class PersistentNode;
class PersistentRegion;
class ThreadHeap;
class ThreadState;
class Visitor;
template <ThreadAffinity affinity>
class ThreadStateFor;
// Declare that a class has a pre-finalizer. The pre-finalizer is called
// before any object gets swept, so it is safe to touch on-heap objects
// that may be collected in the same GC cycle. If you cannot avoid touching
// on-heap objects in a destructor (which is not allowed), you can consider
// using the pre-finalizer. The only restriction is that the pre-finalizer
// must not resurrect dead objects (e.g., store unmarked objects into
// Members etc). The pre-finalizer is called on the thread that registered
// the pre-finalizer.
//
// Since a pre-finalizer adds pressure on GC performance, you should use it
// only if necessary.
//
// A pre-finalizer is similar to the
// HeapHashMap<WeakMember<Foo>, std::unique_ptr<Disposer>> idiom. The
// difference between this and the idiom is that pre-finalizer function is
// called whenever an object is destructed with this feature. The
// HeapHashMap<WeakMember<Foo>, std::unique_ptr<Disposer>> idiom requires an
// assumption that the HeapHashMap outlives objects pointed by WeakMembers.
// FIXME: Replace all of the
// HeapHashMap<WeakMember<Foo>, std::unique_ptr<Disposer>> idiom usages with the
// pre-finalizer if the replacement won't cause performance regressions.
//
// Usage:
//
// class Foo : GarbageCollected<Foo> {
// USING_PRE_FINALIZER(Foo, dispose);
// private:
// void dispose()
// {
// bar_->...; // It is safe to touch other on-heap objects.
// }
// Member<Bar> bar_;
// };
#define USING_PRE_FINALIZER(Class, preFinalizer) \
public: \
static bool InvokePreFinalizer(void* object) { \
Class* self = reinterpret_cast<Class*>(object); \
if (ThreadHeap::IsHeapObjectAlive(self)) \
return false; \
self->Class::preFinalizer(); \
return true; \
} \
\
private: \
ThreadState::PrefinalizerRegistration<Class> prefinalizer_dummy_ = this; \
using UsingPreFinalizerMacroNeedsTrailingSemiColon = char
class PLATFORM_EXPORT BlinkGCObserver {
public:
// The constructor automatically register this object to ThreadState's
// observer lists. The argument must not be null.
explicit BlinkGCObserver(ThreadState*);
// The destructor automatically unregister this object from ThreadState's
// observer lists.
virtual ~BlinkGCObserver();
virtual void OnCompleteSweepDone() = 0;
private:
// As a ThreadState must live when a BlinkGCObserver lives, holding a raw
// pointer is safe.
ThreadState* thread_state_;
};
class PLATFORM_EXPORT ThreadState {
USING_FAST_MALLOC(ThreadState);
WTF_MAKE_NONCOPYABLE(ThreadState);
public:
// See setGCState() for possible state transitions.
enum GCState {
kNoGCScheduled,
kIdleGCScheduled,
kIncrementalMarkingStartScheduled,
kIncrementalMarkingStepScheduled,
kIncrementalMarkingFinalizeScheduled,
kPreciseGCScheduled,
kFullGCScheduled,
kPageNavigationGCScheduled,
kGCRunning,
kSweeping,
kSweepingAndIdleGCScheduled,
kSweepingAndPreciseGCScheduled,
};
// The NoAllocationScope class is used in debug mode to catch unwanted
// allocations. E.g. allocations during GC.
class NoAllocationScope final {
STACK_ALLOCATED();
public:
explicit NoAllocationScope(ThreadState* state) : state_(state) {
state_->EnterNoAllocationScope();
}
~NoAllocationScope() { state_->LeaveNoAllocationScope(); }
private:
ThreadState* state_;
};
class SweepForbiddenScope final {
STACK_ALLOCATED();
public:
explicit SweepForbiddenScope(ThreadState* state) : state_(state) {
DCHECK(!state_->sweep_forbidden_);
state_->sweep_forbidden_ = true;
}
~SweepForbiddenScope() {
DCHECK(state_->sweep_forbidden_);
state_->sweep_forbidden_ = false;
}
private:
ThreadState* state_;
};
// Used to denote when access to unmarked objects is allowed but we shouldn't
// ressurect it by making new references (e.g. during weak processing and pre
// finalizer).
class ObjectResurrectionForbiddenScope final {
STACK_ALLOCATED();
public:
explicit ObjectResurrectionForbiddenScope(ThreadState* state)
: state_(state) {
state_->EnterObjectResurrectionForbiddenScope();
}
~ObjectResurrectionForbiddenScope() {
state_->LeaveObjectResurrectionForbiddenScope();
}
private:
ThreadState* state_;
};
static void AttachMainThread();
// Associate ThreadState object with the current thread. After this
// call thread can start using the garbage collected heap infrastructure.
// It also has to periodically check for safepoints.
static void AttachCurrentThread();
// Disassociate attached ThreadState from the current thread. The thread
// can no longer use the garbage collected heap after this call.
static void DetachCurrentThread();
static ThreadState* Current() { return **thread_specific_; }
static ThreadState* MainThreadState() {
return reinterpret_cast<ThreadState*>(main_thread_state_storage_);
}
static ThreadState* FromObject(const void*);
bool IsMainThread() const { return this == MainThreadState(); }
bool CheckThread() const { return thread_ == CurrentThread(); }
ThreadHeap& Heap() const { return *heap_; }
ThreadIdentifier ThreadId() const { return thread_; }
// When ThreadState is detaching from non-main thread its
// heap is expected to be empty (because it is going away).
// Perform registered cleanup tasks and garbage collection
// to sweep away any objects that are left on this heap.
// We assert that nothing must remain after this cleanup.
// If assertion does not hold we crash as we are potentially
// in the dangling pointer situation.
void RunTerminationGC();
void PerformIdleGC(double deadline_seconds);
void PerformIdleLazySweep(double deadline_seconds);
void ScheduleIdleGC();
void ScheduleIdleLazySweep();
void SchedulePreciseGC();
void ScheduleV8FollowupGCIfNeeded(BlinkGC::V8GCType);
void SchedulePageNavigationGCIfNeeded(float estimated_removal_ratio);
void SchedulePageNavigationGC();
void ScheduleGCIfNeeded();
void WillStartV8GC(BlinkGC::V8GCType);
void SetGCState(GCState);
GCState GcState() const { return gc_state_; }
bool IsInGC() const { return GcState() == kGCRunning; }
bool IsSweepingInProgress() const {
return GcState() == kSweeping ||
GcState() == kSweepingAndPreciseGCScheduled ||
GcState() == kSweepingAndIdleGCScheduled;
}
// Incremental GC.
void ScheduleIncrementalMarkingStart();
void ScheduleIncrementalMarkingStep();
void ScheduleIncrementalMarkingFinalize();
void IncrementalMarkingStart();
void IncrementalMarkingStep();
void IncrementalMarkingFinalize();
bool IsIncrementalMarkingInProgress() const {
return GcState() == kIncrementalMarkingStartScheduled ||
GcState() == kIncrementalMarkingStepScheduled ||
GcState() == kIncrementalMarkingFinalizeScheduled;
}
// A GC runs in the following sequence.
//
// 1) preGC() is called.
// 2) ThreadHeap::collectGarbage() is called. This marks live objects.
// 3) postGC() is called. This does thread-local weak processing.
// 4) preSweep() is called. This does pre-finalization, eager sweeping and
// heap compaction.
// 4) Lazy sweeping sweeps heaps incrementally. completeSweep() may be called
// to complete the sweeping.
// 5) postSweep() is called.
//
// Notes:
// - The world is stopped between 1) and 3).
// - isInGC() returns true between 1) and 3).
// - isSweepingInProgress() returns true while any sweeping operation is
// running.
void MarkPhasePrologue(BlinkGC::StackState,
BlinkGC::GCType,
BlinkGC::GCReason);
void MarkPhaseVisitRoots();
bool MarkPhaseAdvanceMarking(double deadline_seconds);
void MarkPhaseEpilogue();
void CompleteSweep();
void PreSweep(BlinkGC::GCType);
void PostSweep();
// Support for disallowing allocation. Mainly used for sanity
// checks asserts.
bool IsAllocationAllowed() const { return !no_allocation_count_; }
void EnterNoAllocationScope() { no_allocation_count_++; }
void LeaveNoAllocationScope() { no_allocation_count_--; }
bool IsWrapperTracingForbidden() { return IsMixinInConstruction(); }
bool IsGCForbidden() const {
return gc_forbidden_count_ || IsMixinInConstruction();
}
void EnterGCForbiddenScope() { gc_forbidden_count_++; }
void LeaveGCForbiddenScope() {
DCHECK_GT(gc_forbidden_count_, 0u);
gc_forbidden_count_--;
}
bool IsMixinInConstruction() const { return mixins_being_constructed_count_; }
void EnterMixinConstructionScope() { mixins_being_constructed_count_++; }
void LeaveMixinConstructionScope() {
DCHECK_GT(mixins_being_constructed_count_, 0u);
mixins_being_constructed_count_--;
}
bool SweepForbidden() const { return sweep_forbidden_; }
bool IsObjectResurrectionForbidden() const {
return object_resurrection_forbidden_;
}
void EnterObjectResurrectionForbiddenScope() {
DCHECK(!object_resurrection_forbidden_);
object_resurrection_forbidden_ = true;
}
void LeaveObjectResurrectionForbiddenScope() {
DCHECK(object_resurrection_forbidden_);
object_resurrection_forbidden_ = false;
}
bool WrapperTracingInProgress() const { return wrapper_tracing_in_progress_; }
void SetWrapperTracingInProgress(bool value) {
wrapper_tracing_in_progress_ = value;
}
bool IsIncrementalMarking() const { return incremental_marking_; }
void SetIncrementalMarking(bool value) { incremental_marking_ = value; }
class MainThreadGCForbiddenScope final {
STACK_ALLOCATED();
public:
MainThreadGCForbiddenScope()
: thread_state_(ThreadState::MainThreadState()) {
thread_state_->EnterGCForbiddenScope();
}
~MainThreadGCForbiddenScope() { thread_state_->LeaveGCForbiddenScope(); }
private:
ThreadState* const thread_state_;
};
class GCForbiddenScope final {
STACK_ALLOCATED();
public:
explicit GCForbiddenScope(ThreadState* thread_state)
: thread_state_(thread_state) {
thread_state_->EnterGCForbiddenScope();
}
~GCForbiddenScope() { thread_state_->LeaveGCForbiddenScope(); }
private:
ThreadState* const thread_state_;
};
void FlushHeapDoesNotContainCacheIfNeeded();
// Safepoint related functionality.
//
// When a thread attempts to perform GC it needs to stop all other threads
// that use the heap or at least guarantee that they will not touch any
// heap allocated object until GC is complete.
//
// We say that a thread is at a safepoint if this thread is guaranteed to
// not touch any heap allocated object or any heap related functionality until
// it leaves the safepoint.
//
// Notice that a thread does not have to be paused if it is at safepoint it
// can continue to run and perform tasks that do not require interaction
// with the heap. It will be paused if it attempts to leave the safepoint and
// there is a GC in progress.
//
// Each thread that has ThreadState attached must:
// - periodically check if GC is requested from another thread by calling a
// safePoint() method;
// - use SafePointScope around long running loops that have no safePoint()
// invocation inside, such loops must not touch any heap object;
//
// Check if GC is requested by another thread and pause this thread if this is
// the case. Can only be called when current thread is in a consistent state.
void SafePoint(BlinkGC::StackState);
// Mark current thread as running inside safepoint.
void EnterSafePoint(BlinkGC::StackState, void*);
void LeaveSafePoint();
void RecordStackEnd(intptr_t* end_of_stack) { end_of_stack_ = end_of_stack; }
NO_SANITIZE_ADDRESS void CopyStackUntilSafePointScope();
// A region of PersistentNodes allocated on the given thread.
PersistentRegion* GetPersistentRegion() const {
return persistent_region_.get();
}
// A region of PersistentNodes not owned by any particular thread.
// Visit local thread stack and trace all pointers conservatively.
void VisitStack(Visitor*);
// Visit the asan fake stack frame corresponding to a slot on the
// real machine stack if there is one.
void VisitAsanFakeStackForPointer(Visitor*, Address);
// Visit all persistents allocated on this thread.
void VisitPersistents(Visitor*);
struct GCSnapshotInfo {
STACK_ALLOCATED();
GCSnapshotInfo(size_t num_object_types);
// Map from gcInfoIndex (vector-index) to count/size.
Vector<int> live_count;
Vector<int> dead_count;
Vector<size_t> live_size;
Vector<size_t> dead_size;
};
void RegisterTraceDOMWrappers(
v8::Isolate* isolate,
void (*trace_dom_wrappers)(v8::Isolate*, Visitor*),
void (*invalidate_dead_objects_in_wrappers_marking_deque)(v8::Isolate*),
void (*perform_cleanup)(v8::Isolate*)) {
isolate_ = isolate;
DCHECK(!isolate_ || trace_dom_wrappers);
DCHECK(!isolate_ || invalidate_dead_objects_in_wrappers_marking_deque);
DCHECK(!isolate_ || perform_cleanup);
trace_dom_wrappers_ = trace_dom_wrappers;
invalidate_dead_objects_in_wrappers_marking_deque_ =
invalidate_dead_objects_in_wrappers_marking_deque;
perform_cleanup_ = perform_cleanup;
}
// By entering a gc-forbidden scope, conservative GCs will not
// be allowed while handling an out-of-line allocation request.
// Intended used when constructing subclasses of GC mixins, where
// the object being constructed cannot be safely traced & marked
// fully should a GC be allowed while its subclasses are being
// constructed.
void EnterGCForbiddenScopeIfNeeded(
GarbageCollectedMixinConstructorMarkerBase* gc_mixin_marker) {
DCHECK(CheckThread());
if (!gc_mixin_marker_) {
EnterMixinConstructionScope();
gc_mixin_marker_ = gc_mixin_marker;
}
}
void LeaveGCForbiddenScopeIfNeeded(
GarbageCollectedMixinConstructorMarkerBase* gc_mixin_marker) {
DCHECK(CheckThread());
if (gc_mixin_marker_ == gc_mixin_marker) {
LeaveMixinConstructionScope();
gc_mixin_marker_ = nullptr;
}
}
void AccumulateSweepingTime(double time) {
accumulated_sweeping_time_ += time;
}
void FreePersistentNode(PersistentNode*);
using PersistentClearCallback = void (*)(void*);
void RegisterStaticPersistentNode(PersistentNode*, PersistentClearCallback);
void ReleaseStaticPersistentNodes();
#if defined(LEAK_SANITIZER)
void enterStaticReferenceRegistrationDisabledScope();
void leaveStaticReferenceRegistrationDisabledScope();
#endif
v8::Isolate* GetIsolate() const { return isolate_; }
BlinkGC::StackState GetStackState() const { return stack_state_; }
void CollectGarbage(BlinkGC::StackState, BlinkGC::GCType, BlinkGC::GCReason);
void CollectAllGarbage();
// Register the pre-finalizer for the |self| object. The class T must have
// USING_PRE_FINALIZER().
template <typename T>
class PrefinalizerRegistration final {
public:
PrefinalizerRegistration(T* self) {
static_assert(sizeof(&T::InvokePreFinalizer) > 0,
"USING_PRE_FINALIZER(T) must be defined.");
ThreadState* state =
ThreadStateFor<ThreadingTrait<T>::kAffinity>::GetState();
#if DCHECK_IS_ON()
DCHECK(state->CheckThread());
#endif
DCHECK(!state->SweepForbidden());
DCHECK(!state->ordered_pre_finalizers_.Contains(
PreFinalizer(self, T::InvokePreFinalizer)));
state->ordered_pre_finalizers_.insert(
PreFinalizer(self, T::InvokePreFinalizer));
}
};
static const char* GcReasonString(BlinkGC::GCReason);
// Returns |true| if |object| resides on this thread's heap.
// It is well-defined to call this method on any heap allocated
// reference, provided its associated heap hasn't been detached
// and shut down. Its behavior is undefined for any other pointer
// value.
bool IsOnThreadHeap(const void* object) const {
return &FromObject(object)->Heap() == &Heap();
}
int GcAge() const { return gc_age_; }
private:
template <typename T>
friend class PrefinalizerRegistration;
ThreadState();
~ThreadState();
void ClearSafePointScopeMarker() {
safe_point_stack_copy_.clear();
safe_point_scope_marker_ = nullptr;
}
// shouldScheduleIdleGC and shouldForceConservativeGC
// implement the heuristics that are used to determine when to collect
// garbage.
// If shouldForceConservativeGC returns true, we force the garbage
// collection immediately. Otherwise, if should*GC returns true, we
// record that we should garbage collect the next time we return
// to the event loop. If both return false, we don't need to
// collect garbage at this point.
bool ShouldScheduleIdleGC();
bool ShouldForceConservativeGC();
bool ShouldScheduleIncrementalMarking() const;
// V8 minor or major GC is likely to drop a lot of references to objects
// on Oilpan's heap. We give a chance to schedule a GC.
bool ShouldScheduleV8FollowupGC();
// Page navigation is likely to drop a lot of references to objects
// on Oilpan's heap. We give a chance to schedule a GC.
// estimatedRemovalRatio is the estimated ratio of objects that will be no
// longer necessary due to the navigation.
bool ShouldSchedulePageNavigationGC(float estimated_removal_ratio);
// Internal helpers to handle memory pressure conditions.
// Returns true if memory use is in a near-OOM state
// (aka being under "memory pressure".)
bool ShouldForceMemoryPressureGC();
// Returns true if shouldForceMemoryPressureGC() held and a
// conservative GC was performed to handle the emergency.
bool ForceMemoryPressureGCIfNeeded();
size_t EstimatedLiveSize(size_t current_size, size_t size_at_last_gc);
size_t TotalMemorySize();
double HeapGrowingRate();
double PartitionAllocGrowingRate();
bool JudgeGCThreshold(size_t allocated_object_size_threshold,
size_t total_memory_size_threshold,
double heap_growing_rate_threshold);
void RunScheduledGC(BlinkGC::StackState);
void EagerSweep();
void InvokePreFinalizers();
void ReportMemoryToV8();
friend class SafePointScope;
friend class BlinkGCObserver;
// Adds the given observer to the ThreadState's observer list. This doesn't
// take ownership of the argument. The argument must not be null. The argument
// must not be registered before calling this.
void AddObserver(BlinkGCObserver*);
// Removes the given observer from the ThreadState's observer list. This
// doesn't take ownership of the argument. The argument must not be null.
// The argument must be registered before calling this.
void RemoveObserver(BlinkGCObserver*);
static WTF::ThreadSpecific<ThreadState*>* thread_specific_;
// We can't create a static member of type ThreadState here
// because it will introduce global constructor and destructor.
// We would like to manage lifetime of the ThreadState attached
// to the main thread explicitly instead and still use normal
// constructor and destructor for the ThreadState class.
// For this we reserve static storage for the main ThreadState
// and lazily construct ThreadState in it using placement new.
static uint8_t main_thread_state_storage_[];
std::unique_ptr<ThreadHeap> heap_;
ThreadIdentifier thread_;
std::unique_ptr<PersistentRegion> persistent_region_;
BlinkGC::StackState stack_state_;
intptr_t* start_of_stack_;
intptr_t* end_of_stack_;
void* safe_point_scope_marker_;
Vector<Address> safe_point_stack_copy_;
bool sweep_forbidden_;
size_t no_allocation_count_;
size_t gc_forbidden_count_;
size_t mixins_being_constructed_count_;
double accumulated_sweeping_time_;
bool object_resurrection_forbidden_;
GarbageCollectedMixinConstructorMarkerBase* gc_mixin_marker_;
GCState gc_state_;
using PreFinalizerCallback = bool (*)(void*);
using PreFinalizer = std::pair<void*, PreFinalizerCallback>;
// Pre-finalizers are called in the reverse order in which they are
// registered by the constructors (including constructors of Mixin objects)
// for an object, by processing the ordered_pre_finalizers_ back-to-front.
ListHashSet<PreFinalizer> ordered_pre_finalizers_;
v8::Isolate* isolate_;
void (*trace_dom_wrappers_)(v8::Isolate*, Visitor*);
void (*invalidate_dead_objects_in_wrappers_marking_deque_)(v8::Isolate*);
void (*perform_cleanup_)(v8::Isolate*);
bool wrapper_tracing_in_progress_;
bool incremental_marking_;
#if defined(ADDRESS_SANITIZER)
void* asan_fake_stack_;
#endif
HashSet<BlinkGCObserver*> observers_;
// PersistentNodes that are stored in static references;
// references that either have to be cleared upon the thread
// detaching from Oilpan and shutting down or references we
// have to clear before initiating LSan's leak detection.
HashMap<PersistentNode*, PersistentClearCallback> static_persistents_;
#if defined(LEAK_SANITIZER)
// Count that controls scoped disabling of persistent registration.
size_t disabled_static_persistent_registration_;
#endif
size_t reported_memory_to_v8_;
int gc_age_ = 0;
struct GCData {
BlinkGC::StackState stack_state;
BlinkGC::GCType gc_type;
BlinkGC::GCReason reason;
double marking_time_in_milliseconds;
size_t marked_object_size;
std::unique_ptr<Visitor> visitor;
};
GCData current_gc_data_;
};
template <>
class ThreadStateFor<kMainThreadOnly> {
STATIC_ONLY(ThreadStateFor);
public:
static ThreadState* GetState() {
// This specialization must only be used from the main thread.
DCHECK(ThreadState::Current()->IsMainThread());
return ThreadState::MainThreadState();
}
};
template <>
class ThreadStateFor<kAnyThread> {
STATIC_ONLY(ThreadStateFor);
public:
static ThreadState* GetState() { return ThreadState::Current(); }
};
} // namespace blink
#endif // ThreadState_h
| [
"yuske.dev@gmail.com"
] | yuske.dev@gmail.com |
7d0bdd17eeace07d7bd08e3faa7a5c952380eaf4 | 0eff74b05b60098333ad66cf801bdd93becc9ea4 | /second/download/curl/gumtree/curl_new_log_1518.cpp | 1a4140686e69387ae3ede073b8b371477fe3c01b | [] | no_license | niuxu18/logTracker-old | 97543445ea7e414ed40bdc681239365d33418975 | f2b060f13a0295387fe02187543db124916eb446 | refs/heads/master | 2021-09-13T21:39:37.686481 | 2017-12-11T03:36:34 | 2017-12-11T03:36:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 541 | cpp | fputs(
" When used with -s it makes curl show error message if it fails.\n"
" If this option is used twice, the second will again disable show\n"
" error.\n"
"\n"
" --socks <host[:port]>\n"
" Use the specified SOCKS5 proxy. If the port number is not speci-\n"
" fied, it is assumed at port 1080. (Option added in 7.11.1)\n"
"\n"
" This option overrides any previous use of -x/--proxy, as they\n"
" are mutually exclusive.\n"
"\n"
, stdout); | [
"993273596@qq.com"
] | 993273596@qq.com |
d5f735260243ba5b9d99b082ce34688a66d20fd7 | 76079ac589b21dd52cdb5c92a0ea85b25ef6371a | /GLUtil/include/ncl/gl/WithTrianglation.h | 770991b9ff2c9d9d7cba01ec450ad8b197f37163 | [] | no_license | max3a3/GLUtil | 598bbb8220f3f7a0566023a5eefe9b74b4c6d848 | 68d11cd8a36c1f2114e56b4914ddf11f1c671606 | refs/heads/master | 2023-01-08T21:46:27.711434 | 2020-11-03T21:13:01 | 2020-11-03T21:13:01 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 878 | h | #pragma once
#include <unordered_map>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include "logger.h"
namespace ncl {
namespace gl {
class WithTriangulation {
public:
std::vector<unsigned> triangulate(std::vector<unsigned>& indices, unsigned n) {
using namespace std;
size_t size = indices.size();
std::vector<unsigned> triangulatedIndices;
for (int i = 3; i < size - 2; i++) {
if (i % 2 == 0) {
triangulatedIndices.push_back(i - 3);
triangulatedIndices.push_back(i - 1);
triangulatedIndices.push_back(i - 2);
}
else {
triangulatedIndices.push_back(i - 3);
triangulatedIndices.push_back(i - 2);
triangulatedIndices.push_back(i - 1);
}
}
return triangulatedIndices;
}
private:
ncl::Logger logger = ncl::Logger::get("WithTriangulation");
};
}
} | [
"josiah.ebhomenye@news.co.uk"
] | josiah.ebhomenye@news.co.uk |
a68312ea8b8be3a39a1104366adf3e5842da2f27 | 999899193d12d29f64c0ba17a4e0ef5cf7b269bf | /src/engine/ProduceInfantryCommand.cpp | 78a50951e54853ee11df2e945b53337734cc1613 | [] | no_license | TheWeberino/LoisonTan | ce86fdfddabc0e89dbf23a06573f477b2538a994 | a9f7ff91041d987608619d073f996f975ff89254 | refs/heads/master | 2020-04-03T01:54:36.763353 | 2017-01-05T17:22:06 | 2017-01-05T17:22:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,017 | cpp | #include "ProduceInfantryCommand.h"
#include <iostream>
namespace engine{
ProduceInfantryCommand::ProduceInfantryCommand (int x, int y, state::ElementList* ListOfElements, state::ElementList* ListOfTurn, int playerColor){
this->x=x;
this->y=y;
this->ListOfElements=ListOfElements;
this->ListOfTurn=ListOfTurn;
this->playerColor=playerColor;
}
ProduceInfantryCommand::~ProduceInfantryCommand (){
}
CommandTypeID ProduceInfantryCommand::getCommandTypeID () const{
return engine::PRODUCEINFANTRYCOMMAND;
}
int ProduceInfantryCommand::getX (){
return x;
}
int ProduceInfantryCommand::getY (){
return y;
}
state::ElementList* ProduceInfantryCommand::getListOfElements (){
return ListOfElements;
}
state::ElementList* ProduceInfantryCommand::getListOfTurn (){
return ListOfTurn;
}
int ProduceInfantryCommand::getPlayerColor (){
return playerColor;
}
} | [
"eric.tan@ensea.fr"
] | eric.tan@ensea.fr |
4a417d546b8cef90dbefd3631089d9dcb4d1047e | a4216282142913db22528951979b817dc31971ee | /src/udp.cc | 3ad50746c9cef3b23034256a92c99315bcae14c1 | [] | no_license | ZhuChaozheng/GlobalVisionPosition | 14facf60f115de31813bf2d83f5ef86a9a930964 | c4ade68dbbb6f58be0de212cfc9b21291cdb8950 | refs/heads/main | 2023-03-11T17:15:48.650600 | 2021-02-21T03:20:45 | 2021-02-21T03:20:45 | 308,527,520 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,040 | cc | #include "udp.h"
int udp::udp_init(string ip)
{
/* Setup udp socket */
int sock_fd = socket(AF_INET, SOCK_DGRAM, 0);
if(sock_fd < 0)
{
perror("socket");
exit(1);
}
/* Assign address */
memset(&addr_serv_, 0, sizeof(addr_serv_));
addr_serv_.sin_family = AF_INET;
addr_serv_.sin_addr.s_addr = inet_addr(ip.data());
addr_serv_.sin_port = htons(DEST_PORT);
len_ = sizeof(addr_serv_);
return sock_fd;
}
int udp::send_data(const int sock_fd,
const char* send_buf, const int len)
{
int send_num;
cout << "send_buf: " << sizeof(send_buf) << endl;
send_num = sendto(sock_fd, send_buf,
len, 0, (struct sockaddr *)&addr_serv_, len_);
if(send_num < 0)
{
printf("sss\n");
perror("sendto error:");
exit(1);
}
close(sock_fd);
return 1;
}
void char2float(char &src, vector<float> &float_set)
{
for(int i = 0; i < 200; i = i + 4)
{
char temp[4];
temp[0] = src[i];
temp[1] = src[i + 1];
temp[2] = src[i + 2];
temp[3] = src[i + 3];
float *target = (float*)(&temp);
float_set.push_back(*target);
cout <<"target " << *target << endl;
cout << "i " << i << endl;
}
}
void udp::handle_udp_msg(int fd)
{
char buf[BUFF_LEN]; //buff 1024byte
socklen_t len;
int count;
struct sockaddr_in clent_addr; //clent_addr, record the sender address
while(1)
{
memset(buf, 0, BUFF_LEN);
len = sizeof(clent_addr);
//recvfrom is congestion function, until the data coming
count = recvfrom(fd, buf, BUFF_LEN, 0,
(struct sockaddr*)&clent_addr, &len);
if(count == -1)
{
printf("recieve data fail!\n");
return;
}
float *w;
vector<float> float_set;
char2float(buf, float_set);
cout << float_set.size() << endl;
cout << "print in udp handle" << endl;
// printf("client:%s\n",buf);
// memset(buf, 0, BUFF_LEN);
// sprintf(buf, "I have recieved %d bytes data!\n", count); // reply client
// printf("server:%s\n",buf);
// sendto(fd, buf, BUFF_LEN, 0, (struct sockaddr*)&clent_addr, len); // send message to client
}
}
void udp::udp_server_init()
{
int server_fd, ret;
struct sockaddr_in ser_addr;
server_fd = socket(AF_INET, SOCK_DGRAM, 0); //AF_INET:IPV4;SOCK_DGRAM:UDP
if(server_fd < 0)
{
printf("create socket fail!\n");
return;
}
memset(&ser_addr, 0, sizeof(ser_addr));
ser_addr.sin_family = AF_INET;
ser_addr.sin_addr.s_addr = htonl(INADDR_ANY); //IP
ser_addr.sin_port = htons(SERVER_PORT); //port
ret = bind(server_fd, (struct sockaddr*)&ser_addr, sizeof(ser_addr));
if(ret < 0)
{
printf("socket bind fail!\n");
return;
}
handle_udp_msg(server_fd); // handle message
close(server_fd);
} | [
"beihaixianzhi@163.com"
] | beihaixianzhi@163.com |
770d068bfafd46b9471f18e82e97b51e368d0d73 | af59bdd048dd6f7cb36a82b8aa53fbb707009596 | /torchvision_modified/csrc/cpu/nms_kernel.h | 1fdcaf3d3f98a393f8d4fb5a8651fd6a0cacfa7d | [] | no_license | GreatGameDota/NFL-Impact-Detection | 8b2c44b0e3970a12d603d692befeea05ebc809ab | 493d5bd8ce738815cf49c69b11520e874b68b3a2 | refs/heads/master | 2023-02-08T09:03:14.756184 | 2020-12-28T19:51:27 | 2020-12-28T19:51:27 | 320,885,600 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 255 | h | #pragma once
#include <ATen/ATen.h>
#include "../macros.h"
namespace vision {
namespace ops {
VISION_API at::Tensor nms_cpu(
const at::Tensor& dets,
const at::Tensor& scores,
double iou_threshold);
} // namespace ops
} // namespace vision
| [
"17858650+GreatGameDota@users.noreply.github.com"
] | 17858650+GreatGameDota@users.noreply.github.com |
945206b74928b0238c8f466cf11ace539cb5fafe | ae0ba9edf4616db289204163963eb951d4f7f109 | /src/xsec/transformers/TXFMParser.cpp | 402deecf9e87f891657308774c3f88578add176d | [
"Apache-2.0",
"OpenSSL"
] | permissive | odant/conan-xmlsec | deac7c7b50c09eca7371cb284d8e84c316d0e9ee | 4a3af78f8186102b1278fbd2c0cdf42da7a2dd1b | refs/heads/master | 2022-12-08T14:11:45.094661 | 2020-10-22T12:21:13 | 2020-10-22T12:21:13 | 199,825,387 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,847 | cpp | /**
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
/*
* XSEC
*
* TXFMParser := A transformer used to transform a byte stream to DOM Nodes
*
* Author(s): Berin Lautenbach
*
* $Id: TXFMParser.cpp 1833341 2018-06-11 16:25:41Z scantor $
*
*/
#include <xsec/framework/XSECError.hpp>
#include <xsec/transformers/TXFMParser.hpp>
#include <xsec/transformers/TXFMChain.hpp>
#include <xsec/utils/XSECPlatformUtils.hpp>
#include <xsec/utils/XSECTXFMInputSource.hpp>
#include <xercesc/parsers/XercesDOMParser.hpp>
#include <xercesc/framework/MemBufInputSource.hpp>
#include <xercesc/util/Janitor.hpp>
XERCES_CPP_NAMESPACE_USE
TXFMParser::TXFMParser(DOMDocument * doc) :
TXFMBase(doc),
mp_parsedDoc(NULL) {
};
TXFMParser::~TXFMParser() {
if (mp_parsedDoc != NULL) {
if (mp_nse != NULL) {
delete mp_nse; // Don't bother collapsing
mp_nse = NULL;
}
mp_parsedDoc->release();
}
mp_parsedDoc = NULL;
};
// -----------------------------------------------------------------------
// For expanding name spaces when necessary
// -----------------------------------------------------------------------
bool TXFMParser::nameSpacesExpanded(void) const {
// NOTE : Do not check inputs as this has its own document
return (mp_nse != NULL);
}
void TXFMParser::expandNameSpaces(void) {
if (mp_nse != NULL)
return; // Already done
if (mp_parsedDoc != NULL) {
XSECnew(mp_nse, XSECNameSpaceExpander(mp_parsedDoc));
mp_nse->expandNameSpaces();
}
}
// -----------------------------------------------------------------------
// Worker function
// -----------------------------------------------------------------------
void TXFMParser::setInput(TXFMBase *newInput) {
// This transformer terminates all previous inputs and deletes
// the chain.
input = newInput;
// Create a InputStream
TXFMChain * chain;
XSECnew(chain, TXFMChain(newInput, false));
Janitor<TXFMChain> j_chain(chain);
XSECTXFMInputSource is(chain, false);
// Create a XercesParser and parse!
XercesDOMParser parser;
parser.setDoNamespaces(true);
parser.setLoadExternalDTD(false);
SecurityManager securityManager;
securityManager.setEntityExpansionLimit(XSEC_ENTITY_EXPANSION_LIMIT);
parser.setSecurityManager(&securityManager);
parser.parse(is);
XMLSize_t errorCount = parser.getErrorCount();
if (errorCount > 0)
throw XSECException(XSECException::XSLError, "Errors occurred parsing BYTE STREAM");
mp_parsedDoc = parser.adoptDocument();
// Clean up
keepComments = newInput->getCommentsStatus();
}
// Methods to get tranform output type and input requirement
TXFMBase::ioType TXFMParser::getInputType(void) const {
return TXFMBase::BYTE_STREAM;
}
TXFMBase::ioType TXFMParser::getOutputType(void) const {
return TXFMBase::DOM_NODES;
}
TXFMBase::nodeType TXFMParser::getNodeType(void) const {
return TXFMBase::DOM_NODE_DOCUMENT;
}
// Methods to get output data
unsigned int TXFMParser::readBytes(XMLByte * const toFill, unsigned int maxToFill) {
return 0;
}
DOMDocument *TXFMParser::getDocument() const {
return mp_parsedDoc;
}
| [
""
] | |
241c8c88abfed20b2a71147db669922843d7e099 | 67719dc2ba407d18ab2d0ea7171c8dd3916cee77 | /server/client.h | 0a8aa5cd7e1777aaf327a79080e46b3d10c767af | [] | no_license | Karvajalka/Zgame | a87296c9be44a429dd44fbd8d0a4140e6dbf96e6 | 5e3c43f7117239027c593c35b23a8fae3364d4a3 | refs/heads/master | 2021-01-25T10:22:05.182223 | 2013-05-28T20:15:52 | 2013-05-28T20:15:52 | 1,634,589 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 497 | h | #ifndef CLIENT_H
#define CLIENT_H
#include "subnetwork.h"
#include "dvector.h"
#include <string>
class ClientModule;
class Area;
class Client
{
public:
SubNetworkModule * subNetMod;
ClientModule * clientMod;
dVector position;
std::string clientName;
void processRecieve( std::string recieveBuffer );
void processMove( std::string direction );
void sendView();
Area* area;
void send( std::string message );
Client( )
{
position = dVector( 11, 11 );
}
};
#endif
| [
"anania1.0@gmail.com"
] | anania1.0@gmail.com |
df152e060de800b19c5384155efd7ca3d0fa0106 | b5a11be2703308cd3c2e8ea931b0cf4e171f9298 | /util/GraphMatrix.hpp | aad73633a17b225e00a2088640ab61020ce008cc | [] | no_license | futuristek/algo2.Standford | f61b1a8fddfcf0416135748a904f733334ad2968 | f8cbadba791484f7cac748249e61f0762ef36425 | refs/heads/master | 2021-01-19T14:13:05.480886 | 2019-01-07T03:52:51 | 2019-01-07T03:52:51 | 100,885,507 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 816 | hpp | #ifndef GRAPHMATRIX_HPP
#define GRAPHMATRIX_HPP
#include <vector>
#include <limits>
class GraphMatrix {
public:
GraphMatrix(int n, int m) {
matrix = std::vector<std::vector<int>>(n, std::vector<int>(m));
for (size_t i = 0; i < matrix.size(); i++) {
for (size_t j = 0; j < matrix[i].size(); j++) {
matrix[i][j] = std::numeric_limits<int>::max();
}
}
this->n = n;
this->m = m;
}
void addEdge(int i, int j, int v) {
matrix[i][j] = v;
}
bool isEdge(int i, int j) const {
return (matrix[i][j] == std::numeric_limits<int>::max() ? false : true);
}
int getEdge(int i, int j) const {
return matrix[i][j];
}
int numNodes() const {
return n;
}
int numEdges() const {
return m;
}
private:
std::vector<std::vector<int>> matrix;
int n;
int m;
};
#endif /* GRAPHMATRIX_HPP */
| [
"ginojay@gmail.com"
] | ginojay@gmail.com |
75d2fd4e6767edb05f4764f9711b3c06be8676f0 | ddb6fe59b6b3d5b31b065fa64001ffbe0c2802d7 | /src/wallet/rpcwallet.cpp | 2602c90140b6f2e8b03934a3d2c9644f663b15f2 | [
"MIT"
] | permissive | VirtusPay/virtus | d595dfdd8af5571b07f0356f500f3edb6573e3a9 | 0ec8039945176fc4ac78594d0040bfec0bf30cb9 | refs/heads/master | 2021-04-28T10:44:49.495398 | 2018-04-01T08:28:47 | 2018-04-01T08:28:47 | 122,073,104 | 2 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 123,299 | cpp | // Copyright (c) 2010 Satoshi Nakamoto
// Copyright (c) 2009-2015 The Bitcoin Core developers
// Copyright (c) 2014-2017 The Dash Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "amount.h"
#include "base58.h"
#include "chain.h"
#include "core_io.h"
#include "init.h"
#include "instantx.h"
#include "net.h"
#include "policy/rbf.h"
#include "rpc/server.h"
#include "timedata.h"
#include "util.h"
#include "utilmoneystr.h"
#include "validation.h"
#include "wallet.h"
#include "walletdb.h"
#include "keepass.h"
#include <stdint.h>
#include <boost/assign/list_of.hpp>
#include <univalue.h>
using namespace std;
int64_t nWalletUnlockTime;
static CCriticalSection cs_nWalletUnlockTime;
std::string HelpRequiringPassphrase()
{
return pwalletMain && pwalletMain->IsCrypted()
? "\nRequires wallet passphrase to be set with walletpassphrase call."
: "";
}
bool EnsureWalletIsAvailable(bool avoidException)
{
if (!pwalletMain)
{
if (!avoidException)
throw JSONRPCError(RPC_METHOD_NOT_FOUND, "Method not found (disabled)");
else
return false;
}
return true;
}
void EnsureWalletIsUnlocked()
{
if (pwalletMain->IsLocked())
throw JSONRPCError(RPC_WALLET_UNLOCK_NEEDED, "Error: Please enter the wallet passphrase with walletpassphrase first.");
}
void WalletTxToJSON(const CWalletTx& wtx, UniValue& entry)
{
int confirms = wtx.GetDepthInMainChain(false);
bool fLocked = instantsend.IsLockedInstantSendTransaction(wtx.GetHash());
entry.push_back(Pair("confirmations", confirms));
entry.push_back(Pair("instantlock", fLocked));
if (wtx.IsCoinBase())
entry.push_back(Pair("generated", true));
if (confirms > 0)
{
entry.push_back(Pair("blockhash", wtx.hashBlock.GetHex()));
entry.push_back(Pair("blockindex", wtx.nIndex));
entry.push_back(Pair("blocktime", mapBlockIndex[wtx.hashBlock]->GetBlockTime()));
} else {
entry.push_back(Pair("trusted", wtx.IsTrusted()));
}
uint256 hash = wtx.GetHash();
entry.push_back(Pair("txid", hash.GetHex()));
UniValue conflicts(UniValue::VARR);
BOOST_FOREACH(const uint256& conflict, wtx.GetConflicts())
conflicts.push_back(conflict.GetHex());
entry.push_back(Pair("walletconflicts", conflicts));
entry.push_back(Pair("time", wtx.GetTxTime()));
entry.push_back(Pair("timereceived", (int64_t)wtx.nTimeReceived));
// Add opt-in RBF status
std::string rbfStatus = "no";
if (confirms <= 0) {
LOCK(mempool.cs);
if (!mempool.exists(hash)) {
if (SignalsOptInRBF(wtx)) {
rbfStatus = "yes";
} else {
rbfStatus = "unknown";
}
} else if (IsRBFOptIn(*mempool.mapTx.find(hash), mempool)) {
rbfStatus = "yes";
}
}
entry.push_back(Pair("bip125-replaceable", rbfStatus));
BOOST_FOREACH(const PAIRTYPE(string,string)& item, wtx.mapValue)
entry.push_back(Pair(item.first, item.second));
}
string AccountFromValue(const UniValue& value)
{
string strAccount = value.get_str();
if (strAccount == "*")
throw JSONRPCError(RPC_WALLET_INVALID_ACCOUNT_NAME, "Invalid account name");
return strAccount;
}
UniValue getnewaddress(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() > 1)
throw runtime_error(
"getnewaddress ( \"account\" )\n"
"\nReturns a new Virtus address for receiving payments.\n"
"If 'account' is specified (DEPRECATED), it is added to the address book \n"
"so payments received with the address will be credited to 'account'.\n"
"\nArguments:\n"
"1. \"account\" (string, optional) DEPRECATED. The account name for the address to be linked to. If not provided, the default account \"\" is used. It can also be set to the empty string \"\" to represent the default account. The account does not need to exist, it will be created if there is no account by the given name.\n"
"\nResult:\n"
"\"virtusaddress\" (string) The new virtus address\n"
"\nExamples:\n"
+ HelpExampleCli("getnewaddress", "")
+ HelpExampleRpc("getnewaddress", "")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
// Parse the account first so we don't generate a key if there's an error
string strAccount;
if (params.size() > 0)
strAccount = AccountFromValue(params[0]);
if (!pwalletMain->IsLocked(true))
pwalletMain->TopUpKeyPool();
// Generate a new key that is added to wallet
CPubKey newKey;
if (!pwalletMain->GetKeyFromPool(newKey, false))
throw JSONRPCError(RPC_WALLET_KEYPOOL_RAN_OUT, "Error: Keypool ran out, please call keypoolrefill first");
CKeyID keyID = newKey.GetID();
pwalletMain->SetAddressBook(keyID, strAccount, "receive");
return CBitcoinAddress(keyID).ToString();
}
CBitcoinAddress GetAccountAddress(string strAccount, bool bForceNew=false)
{
CWalletDB walletdb(pwalletMain->strWalletFile);
CAccount account;
walletdb.ReadAccount(strAccount, account);
bool bKeyUsed = false;
// Check if the current key has been used
if (account.vchPubKey.IsValid())
{
CScript scriptPubKey = GetScriptForDestination(account.vchPubKey.GetID());
for (map<uint256, CWalletTx>::iterator it = pwalletMain->mapWallet.begin();
it != pwalletMain->mapWallet.end() && account.vchPubKey.IsValid();
++it)
{
const CWalletTx& wtx = (*it).second;
BOOST_FOREACH(const CTxOut& txout, wtx.vout)
if (txout.scriptPubKey == scriptPubKey)
bKeyUsed = true;
}
}
// Generate a new key
if (!account.vchPubKey.IsValid() || bForceNew || bKeyUsed)
{
if (!pwalletMain->GetKeyFromPool(account.vchPubKey, false))
throw JSONRPCError(RPC_WALLET_KEYPOOL_RAN_OUT, "Error: Keypool ran out, please call keypoolrefill first");
pwalletMain->SetAddressBook(account.vchPubKey.GetID(), strAccount, "receive");
walletdb.WriteAccount(strAccount, account);
}
return CBitcoinAddress(account.vchPubKey.GetID());
}
UniValue getaccountaddress(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() != 1)
throw runtime_error(
"getaccountaddress \"account\"\n"
"\nDEPRECATED. Returns the current Virtus address for receiving payments to this account.\n"
"\nArguments:\n"
"1. \"account\" (string, required) The account name for the address. It can also be set to the empty string \"\" to represent the default account. The account does not need to exist, it will be created and a new address created if there is no account by the given name.\n"
"\nResult:\n"
"\"virtusaddress\" (string) The account virtus address\n"
"\nExamples:\n"
+ HelpExampleCli("getaccountaddress", "")
+ HelpExampleCli("getaccountaddress", "\"\"")
+ HelpExampleCli("getaccountaddress", "\"myaccount\"")
+ HelpExampleRpc("getaccountaddress", "\"myaccount\"")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
// Parse the account first so we don't generate a key if there's an error
string strAccount = AccountFromValue(params[0]);
UniValue ret(UniValue::VSTR);
ret = GetAccountAddress(strAccount).ToString();
return ret;
}
UniValue getrawchangeaddress(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() > 1)
throw runtime_error(
"getrawchangeaddress\n"
"\nReturns a new Virtus address, for receiving change.\n"
"This is for use with raw transactions, NOT normal use.\n"
"\nResult:\n"
"\"address\" (string) The address\n"
"\nExamples:\n"
+ HelpExampleCli("getrawchangeaddress", "")
+ HelpExampleRpc("getrawchangeaddress", "")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
if (!pwalletMain->IsLocked(true))
pwalletMain->TopUpKeyPool();
CReserveKey reservekey(pwalletMain);
CPubKey vchPubKey;
if (!reservekey.GetReservedKey(vchPubKey, true))
throw JSONRPCError(RPC_WALLET_KEYPOOL_RAN_OUT, "Error: Keypool ran out, please call keypoolrefill first");
reservekey.KeepKey();
CKeyID keyID = vchPubKey.GetID();
return CBitcoinAddress(keyID).ToString();
}
UniValue setaccount(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() < 1 || params.size() > 2)
throw runtime_error(
"setaccount \"virtusaddress\" \"account\"\n"
"\nDEPRECATED. Sets the account associated with the given address.\n"
"\nArguments:\n"
"1. \"virtusaddress\" (string, required) The virtus address to be associated with an account.\n"
"2. \"account\" (string, required) The account to assign the address to.\n"
"\nExamples:\n"
+ HelpExampleCli("setaccount", "\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\" \"tabby\"")
+ HelpExampleRpc("setaccount", "\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\", \"tabby\"")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
CBitcoinAddress address(params[0].get_str());
if (!address.IsValid())
throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid Virtus address");
string strAccount;
if (params.size() > 1)
strAccount = AccountFromValue(params[1]);
// Only add the account if the address is yours.
if (IsMine(*pwalletMain, address.Get()))
{
// Detect when changing the account of an address that is the 'unused current key' of another account:
if (pwalletMain->mapAddressBook.count(address.Get()))
{
string strOldAccount = pwalletMain->mapAddressBook[address.Get()].name;
if (address == GetAccountAddress(strOldAccount))
GetAccountAddress(strOldAccount, true);
}
pwalletMain->SetAddressBook(address.Get(), strAccount, "receive");
}
else
throw JSONRPCError(RPC_MISC_ERROR, "setaccount can only be used with own address");
return NullUniValue;
}
UniValue getaccount(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() != 1)
throw runtime_error(
"getaccount \"virtusaddress\"\n"
"\nDEPRECATED. Returns the account associated with the given address.\n"
"\nArguments:\n"
"1. \"virtusaddress\" (string, required) The virtus address for account lookup.\n"
"\nResult:\n"
"\"accountname\" (string) the account address\n"
"\nExamples:\n"
+ HelpExampleCli("getaccount", "\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\"")
+ HelpExampleRpc("getaccount", "\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\"")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
CBitcoinAddress address(params[0].get_str());
if (!address.IsValid())
throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid Virtus address");
string strAccount;
map<CTxDestination, CAddressBookData>::iterator mi = pwalletMain->mapAddressBook.find(address.Get());
if (mi != pwalletMain->mapAddressBook.end() && !(*mi).second.name.empty())
strAccount = (*mi).second.name;
return strAccount;
}
UniValue getaddressesbyaccount(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() != 1)
throw runtime_error(
"getaddressesbyaccount \"account\"\n"
"\nDEPRECATED. Returns the list of addresses for the given account.\n"
"\nArguments:\n"
"1. \"account\" (string, required) The account name.\n"
"\nResult:\n"
"[ (json array of string)\n"
" \"virtusaddress\" (string) a virtus address associated with the given account\n"
" ,...\n"
"]\n"
"\nExamples:\n"
+ HelpExampleCli("getaddressesbyaccount", "\"tabby\"")
+ HelpExampleRpc("getaddressesbyaccount", "\"tabby\"")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
string strAccount = AccountFromValue(params[0]);
// Find all addresses that have the given account
UniValue ret(UniValue::VARR);
BOOST_FOREACH(const PAIRTYPE(CBitcoinAddress, CAddressBookData)& item, pwalletMain->mapAddressBook)
{
const CBitcoinAddress& address = item.first;
const string& strName = item.second.name;
if (strName == strAccount)
ret.push_back(address.ToString());
}
return ret;
}
static void SendMoney(const CTxDestination &address, CAmount nValue, bool fSubtractFeeFromAmount, CWalletTx& wtxNew, bool fUseInstantSend=false, bool fUsePrivateSend=false)
{
CAmount curBalance = pwalletMain->GetBalance();
// Check amount
if (nValue <= 0)
throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid amount");
if (nValue > curBalance)
throw JSONRPCError(RPC_WALLET_INSUFFICIENT_FUNDS, "Insufficient funds");
if (pwalletMain->GetBroadcastTransactions() && !g_connman)
throw JSONRPCError(RPC_CLIENT_P2P_DISABLED, "Error: Peer-to-peer functionality missing or disabled");
// Parse Virtus address
CScript scriptPubKey = GetScriptForDestination(address);
// Create and send the transaction
CReserveKey reservekey(pwalletMain);
CAmount nFeeRequired;
std::string strError;
vector<CRecipient> vecSend;
int nChangePosRet = -1;
CRecipient recipient = {scriptPubKey, nValue, fSubtractFeeFromAmount};
vecSend.push_back(recipient);
if (!pwalletMain->CreateTransaction(vecSend, wtxNew, reservekey, nFeeRequired, nChangePosRet,
strError, NULL, true, fUsePrivateSend ? ONLY_DENOMINATED : ALL_COINS, fUseInstantSend)) {
if (!fSubtractFeeFromAmount && nValue + nFeeRequired > pwalletMain->GetBalance())
strError = strprintf("Error: This transaction requires a transaction fee of at least %s because of its amount, complexity, or use of recently received funds!", FormatMoney(nFeeRequired));
throw JSONRPCError(RPC_WALLET_ERROR, strError);
}
if (!pwalletMain->CommitTransaction(wtxNew, reservekey, g_connman.get(), fUseInstantSend ? NetMsgType::TXLOCKREQUEST : NetMsgType::TX))
throw JSONRPCError(RPC_WALLET_ERROR, "Error: The transaction was rejected! This might happen if some of the coins in your wallet were already spent, such as if you used a copy of wallet.dat and coins were spent in the copy but not marked as spent here.");
}
UniValue sendtoaddress(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() < 2 || params.size() > 7)
throw runtime_error(
"sendtoaddress \"virtusaddress\" amount ( \"comment\" \"comment-to\" subtractfeefromamount use_is use_ps )\n"
"\nSend an amount to a given address.\n"
+ HelpRequiringPassphrase() +
"\nArguments:\n"
"1. \"virtusaddress\" (string, required) The virtus address to send to.\n"
"2. \"amount\" (numeric or string, required) The amount in " + CURRENCY_UNIT + " to send. eg 0.1\n"
"3. \"comment\" (string, optional) A comment used to store what the transaction is for. \n"
" This is not part of the transaction, just kept in your wallet.\n"
"4. \"comment-to\" (string, optional) A comment to store the name of the person or organization \n"
" to which you're sending the transaction. This is not part of the \n"
" transaction, just kept in your wallet.\n"
"5. subtractfeefromamount (boolean, optional, default=false) The fee will be deducted from the amount being sent.\n"
" The recipient will receive less amount of Virtus than you enter in the amount field.\n"
"6. \"use_is\" (bool, optional) Send this transaction as InstantSend (default: false)\n"
"7. \"use_ps\" (bool, optional) Use anonymized funds only (default: false)\n"
"\nResult:\n"
"\"transactionid\" (string) The transaction id.\n"
"\nExamples:\n"
+ HelpExampleCli("sendtoaddress", "\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\" 0.1")
+ HelpExampleCli("sendtoaddress", "\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\" 0.1 \"donation\" \"seans outpost\"")
+ HelpExampleCli("sendtoaddress", "\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\" 0.1 \"\" \"\" true")
+ HelpExampleRpc("sendtoaddress", "\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\", 0.1, \"donation\", \"seans outpost\"")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
CBitcoinAddress address(params[0].get_str());
if (!address.IsValid())
throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid Virtus address");
// Amount
CAmount nAmount = AmountFromValue(params[1]);
if (nAmount <= 0)
throw JSONRPCError(RPC_TYPE_ERROR, "Invalid amount for send");
// Wallet comments
CWalletTx wtx;
if (params.size() > 2 && !params[2].isNull() && !params[2].get_str().empty())
wtx.mapValue["comment"] = params[2].get_str();
if (params.size() > 3 && !params[3].isNull() && !params[3].get_str().empty())
wtx.mapValue["to"] = params[3].get_str();
bool fSubtractFeeFromAmount = false;
if (params.size() > 4)
fSubtractFeeFromAmount = params[4].get_bool();
bool fUseInstantSend = false;
bool fUsePrivateSend = false;
if (params.size() > 5)
fUseInstantSend = params[5].get_bool();
if (params.size() > 6)
fUsePrivateSend = params[6].get_bool();
EnsureWalletIsUnlocked();
SendMoney(address.Get(), nAmount, fSubtractFeeFromAmount, wtx, fUseInstantSend, fUsePrivateSend);
return wtx.GetHash().GetHex();
}
UniValue instantsendtoaddress(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() < 2 || params.size() > 5)
throw runtime_error(
"instantsendtoaddress \"virtusaddress\" amount ( \"comment\" \"comment-to\" subtractfeefromamount )\n"
"\nSend an amount to a given address. The amount is a real and is rounded to the nearest 0.00000001\n"
+ HelpRequiringPassphrase() +
"\nArguments:\n"
"1. \"virtusaddress\" (string, required) The virtus address to send to.\n"
"2. \"amount\" (numeric, required) The amount in btc to send. eg 0.1\n"
"3. \"comment\" (string, optional) A comment used to store what the transaction is for. \n"
" This is not part of the transaction, just kept in your wallet.\n"
"4. \"comment-to\" (string, optional) A comment to store the name of the person or organization \n"
" to which you're sending the transaction. This is not part of the \n"
" transaction, just kept in your wallet.\n"
"5. subtractfeefromamount (boolean, optional, default=false) The fee will be deducted from the amount being sent.\n"
" The recipient will receive less amount of Virtus than you enter in the amount field.\n"
"\nResult:\n"
"\"transactionid\" (string) The transaction id.\n"
"\nExamples:\n"
+ HelpExampleCli("instantsendtoaddress", "\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\" 0.1")
+ HelpExampleCli("instantsendtoaddress", "\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\" 0.1 \"donation\" \"seans outpost\"")
+ HelpExampleCli("instantsendtoaddress", "\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\" 0.1 \"\" \"\" true")
+ HelpExampleRpc("instantsendtoaddress", "\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\", 0.1, \"donation\", \"seans outpost\"")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
CBitcoinAddress address(params[0].get_str());
if (!address.IsValid())
throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid Virtus address");
// Amount
CAmount nAmount = AmountFromValue(params[1]);
if (nAmount <= 0)
throw JSONRPCError(RPC_TYPE_ERROR, "Invalid amount for send");
// Wallet comments
CWalletTx wtx;
if (params.size() > 2 && !params[2].isNull() && !params[2].get_str().empty())
wtx.mapValue["comment"] = params[2].get_str();
if (params.size() > 3 && !params[3].isNull() && !params[3].get_str().empty())
wtx.mapValue["to"] = params[3].get_str();
bool fSubtractFeeFromAmount = false;
if (params.size() > 4)
fSubtractFeeFromAmount = params[4].get_bool();
EnsureWalletIsUnlocked();
SendMoney(address.Get(), nAmount, fSubtractFeeFromAmount, wtx, true);
return wtx.GetHash().GetHex();
}
UniValue listaddressgroupings(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp)
throw runtime_error(
"listaddressgroupings\n"
"\nLists groups of addresses which have had their common ownership\n"
"made public by common use as inputs or as the resulting change\n"
"in past transactions\n"
"\nResult:\n"
"[\n"
" [\n"
" [\n"
" \"virtusaddress\", (string) The virtus address\n"
" amount, (numeric) The amount in " + CURRENCY_UNIT + "\n"
" \"account\" (string, optional) The account (DEPRECATED)\n"
" ]\n"
" ,...\n"
" ]\n"
" ,...\n"
"]\n"
"\nExamples:\n"
+ HelpExampleCli("listaddressgroupings", "")
+ HelpExampleRpc("listaddressgroupings", "")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
UniValue jsonGroupings(UniValue::VARR);
map<CTxDestination, CAmount> balances = pwalletMain->GetAddressBalances();
BOOST_FOREACH(set<CTxDestination> grouping, pwalletMain->GetAddressGroupings())
{
UniValue jsonGrouping(UniValue::VARR);
BOOST_FOREACH(CTxDestination address, grouping)
{
UniValue addressInfo(UniValue::VARR);
addressInfo.push_back(CBitcoinAddress(address).ToString());
addressInfo.push_back(ValueFromAmount(balances[address]));
{
if (pwalletMain->mapAddressBook.find(CBitcoinAddress(address).Get()) != pwalletMain->mapAddressBook.end())
addressInfo.push_back(pwalletMain->mapAddressBook.find(CBitcoinAddress(address).Get())->second.name);
}
jsonGrouping.push_back(addressInfo);
}
jsonGroupings.push_back(jsonGrouping);
}
return jsonGroupings;
}
UniValue signmessage(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() != 2)
throw runtime_error(
"signmessage \"virtusaddress\" \"message\"\n"
"\nSign a message with the private key of an address"
+ HelpRequiringPassphrase() + "\n"
"\nArguments:\n"
"1. \"virtusaddress\" (string, required) The virtus address to use for the private key.\n"
"2. \"message\" (string, required) The message to create a signature of.\n"
"\nResult:\n"
"\"signature\" (string) The signature of the message encoded in base 64\n"
"\nExamples:\n"
"\nUnlock the wallet for 30 seconds\n"
+ HelpExampleCli("walletpassphrase", "\"mypassphrase\" 30") +
"\nCreate the signature\n"
+ HelpExampleCli("signmessage", "\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\" \"my message\"") +
"\nVerify the signature\n"
+ HelpExampleCli("verifymessage", "\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\" \"signature\" \"my message\"") +
"\nAs json rpc\n"
+ HelpExampleRpc("signmessage", "\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\", \"my message\"")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
EnsureWalletIsUnlocked();
string strAddress = params[0].get_str();
string strMessage = params[1].get_str();
CBitcoinAddress addr(strAddress);
if (!addr.IsValid())
throw JSONRPCError(RPC_TYPE_ERROR, "Invalid address");
CKeyID keyID;
if (!addr.GetKeyID(keyID))
throw JSONRPCError(RPC_TYPE_ERROR, "Address does not refer to key");
CKey key;
if (!pwalletMain->GetKey(keyID, key))
throw JSONRPCError(RPC_WALLET_ERROR, "Private key not available");
CHashWriter ss(SER_GETHASH, 0);
ss << strMessageMagic;
ss << strMessage;
vector<unsigned char> vchSig;
if (!key.SignCompact(ss.GetHash(), vchSig))
throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Sign failed");
return EncodeBase64(&vchSig[0], vchSig.size());
}
UniValue getreceivedbyaddress(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() < 1 || params.size() > 3)
throw runtime_error(
"getreceivedbyaddress \"virtusaddress\" ( minconf addlockconf )\n"
"\nReturns the total amount received by the given virtusaddress in transactions with specified minimum number of confirmations.\n"
"\nArguments:\n"
"1. \"virtusaddress\" (string, required) The virtus address for transactions.\n"
"2. minconf (numeric, optional, default=1) Only include transactions confirmed at least this many times.\n"
"3. addlockconf (bool, optional, default=false) Whether to add " + std::to_string(nInstantSendDepth) + " confirmations to transactions locked via InstantSend.\n"
"\nResult:\n"
"amount (numeric) The total amount in " + CURRENCY_UNIT + " received at this address.\n"
"\nExamples:\n"
"\nThe amount from transactions with at least 1 confirmation\n"
+ HelpExampleCli("getreceivedbyaddress", "\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\"") +
"\nThe amount including unconfirmed transactions, zero confirmations\n"
+ HelpExampleCli("getreceivedbyaddress", "\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\" 0") +
"\nThe amount with at least 6 confirmation, very safe\n"
+ HelpExampleCli("getreceivedbyaddress", "\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\" 6") +
"\nAs a json rpc call\n"
+ HelpExampleRpc("getreceivedbyaddress", "\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\", 6")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
// Virtus address
CBitcoinAddress address = CBitcoinAddress(params[0].get_str());
if (!address.IsValid())
throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid Virtus address");
CScript scriptPubKey = GetScriptForDestination(address.Get());
if (!IsMine(*pwalletMain, scriptPubKey))
return ValueFromAmount(0);
// Minimum confirmations
int nMinDepth = 1;
if (params.size() > 1)
nMinDepth = params[1].get_int();
bool fAddLockConf = (params.size() > 2 && params[2].get_bool());
// Tally
CAmount nAmount = 0;
for (map<uint256, CWalletTx>::iterator it = pwalletMain->mapWallet.begin(); it != pwalletMain->mapWallet.end(); ++it)
{
const CWalletTx& wtx = (*it).second;
if (wtx.IsCoinBase() || !CheckFinalTx(wtx))
continue;
BOOST_FOREACH(const CTxOut& txout, wtx.vout)
if (txout.scriptPubKey == scriptPubKey)
if (wtx.GetDepthInMainChain(fAddLockConf) >= nMinDepth)
nAmount += txout.nValue;
}
return ValueFromAmount(nAmount);
}
UniValue getreceivedbyaccount(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() < 1 || params.size() > 3)
throw runtime_error(
"getreceivedbyaccount \"account\" ( minconf addlockconf )\n"
"\nDEPRECATED. Returns the total amount received by addresses with <account> in transactions with specified minimum number of confirmations.\n"
"\nArguments:\n"
"1. \"account\" (string, required) The selected account, may be the default account using \"\".\n"
"2. minconf (numeric, optional, default=1) Only include transactions confirmed at least this many times.\n"
"3. addlockconf (bool, optional, default=false) Whether to add " + std::to_string(nInstantSendDepth) + " confirmations to transactions locked via InstantSend.\n"
"\nResult:\n"
"amount (numeric) The total amount in " + CURRENCY_UNIT + " received for this account.\n"
"\nExamples:\n"
"\nAmount received by the default account with at least 1 confirmation\n"
+ HelpExampleCli("getreceivedbyaccount", "\"\"") +
"\nAmount received at the tabby account including unconfirmed amounts with zero confirmations\n"
+ HelpExampleCli("getreceivedbyaccount", "\"tabby\" 0") +
"\nThe amount with at least 6 confirmation, very safe\n"
+ HelpExampleCli("getreceivedbyaccount", "\"tabby\" 6") +
"\nAs a json rpc call\n"
+ HelpExampleRpc("getreceivedbyaccount", "\"tabby\", 6")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
// Minimum confirmations
int nMinDepth = 1;
if (params.size() > 1)
nMinDepth = params[1].get_int();
bool fAddLockConf = (params.size() > 2 && params[2].get_bool());
// Get the set of pub keys assigned to account
string strAccount = AccountFromValue(params[0]);
set<CTxDestination> setAddress = pwalletMain->GetAccountAddresses(strAccount);
// Tally
CAmount nAmount = 0;
for (map<uint256, CWalletTx>::iterator it = pwalletMain->mapWallet.begin(); it != pwalletMain->mapWallet.end(); ++it)
{
const CWalletTx& wtx = (*it).second;
if (wtx.IsCoinBase() || !CheckFinalTx(wtx))
continue;
BOOST_FOREACH(const CTxOut& txout, wtx.vout)
{
CTxDestination address;
if (ExtractDestination(txout.scriptPubKey, address) && IsMine(*pwalletMain, address) && setAddress.count(address))
if (wtx.GetDepthInMainChain(fAddLockConf) >= nMinDepth)
nAmount += txout.nValue;
}
}
return ValueFromAmount(nAmount);
}
CAmount GetAccountBalance(CWalletDB& walletdb, const string& strAccount, int nMinDepth, const isminefilter& filter, bool fAddLockConf)
{
CAmount nBalance = 0;
// Tally wallet transactions
for (map<uint256, CWalletTx>::iterator it = pwalletMain->mapWallet.begin(); it != pwalletMain->mapWallet.end(); ++it)
{
const CWalletTx& wtx = (*it).second;
if (!CheckFinalTx(wtx) || wtx.GetBlocksToMaturity() > 0 || wtx.GetDepthInMainChain(fAddLockConf) < 0)
continue;
CAmount nReceived, nSent, nFee;
wtx.GetAccountAmounts(strAccount, nReceived, nSent, nFee, filter);
if (nReceived != 0 && wtx.GetDepthInMainChain(fAddLockConf) >= nMinDepth)
nBalance += nReceived;
nBalance -= nSent + nFee;
}
// Tally internal accounting entries
nBalance += walletdb.GetAccountCreditDebit(strAccount);
return nBalance;
}
CAmount GetAccountBalance(const string& strAccount, int nMinDepth, const isminefilter& filter, bool fAddLockConf)
{
CWalletDB walletdb(pwalletMain->strWalletFile);
return GetAccountBalance(walletdb, strAccount, nMinDepth, filter, fAddLockConf);
}
UniValue getbalance(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() > 4)
throw runtime_error(
"getbalance ( \"account\" minconf addlockconf includeWatchonly )\n"
"\nIf account is not specified, returns the server's total available balance.\n"
"If account is specified (DEPRECATED), returns the balance in the account.\n"
"Note that the account \"\" is not the same as leaving the parameter out.\n"
"The server total may be different to the balance in the default \"\" account.\n"
"\nArguments:\n"
"1. \"account\" (string, optional) DEPRECATED. The selected account, or \"*\" for entire wallet. It may be the default account using \"\".\n"
"2. minconf (numeric, optional, default=1) Only include transactions confirmed at least this many times.\n"
"3. addlockconf (bool, optional, default=false) Whether to add " + std::to_string(nInstantSendDepth) + " confirmations to transactions locked via InstantSend.\n"
"4. includeWatchonly (bool, optional, default=false) Also include balance in watchonly addresses (see 'importaddress')\n"
"\nResult:\n"
"amount (numeric) The total amount in " + CURRENCY_UNIT + " received for this account.\n"
"\nExamples:\n"
"\nThe total amount in the wallet\n"
+ HelpExampleCli("getbalance", "") +
"\nThe total amount in the wallet at least 5 blocks confirmed\n"
+ HelpExampleCli("getbalance", "\"*\" 6") +
"\nAs a json rpc call\n"
+ HelpExampleRpc("getbalance", "\"*\", 6")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
if (params.size() == 0)
return ValueFromAmount(pwalletMain->GetBalance());
int nMinDepth = 1;
if (params.size() > 1)
nMinDepth = params[1].get_int();
bool fAddLockConf = (params.size() > 2 && params[2].get_bool());
isminefilter filter = ISMINE_SPENDABLE;
if(params.size() > 3)
if(params[3].get_bool())
filter = filter | ISMINE_WATCH_ONLY;
if (params[0].get_str() == "*") {
// Calculate total balance a different way from GetBalance()
// (GetBalance() sums up all unspent TxOuts)
// getbalance and "getbalance * 1 true" should return the same number
CAmount nBalance = 0;
for (map<uint256, CWalletTx>::iterator it = pwalletMain->mapWallet.begin(); it != pwalletMain->mapWallet.end(); ++it)
{
const CWalletTx& wtx = (*it).second;
if (!CheckFinalTx(wtx) || wtx.GetBlocksToMaturity() > 0 || wtx.GetDepthInMainChain() < 0)
continue;
CAmount allFee;
string strSentAccount;
list<COutputEntry> listReceived;
list<COutputEntry> listSent;
wtx.GetAmounts(listReceived, listSent, allFee, strSentAccount, filter);
if (wtx.GetDepthInMainChain(fAddLockConf) >= nMinDepth)
{
BOOST_FOREACH(const COutputEntry& r, listReceived)
nBalance += r.amount;
}
BOOST_FOREACH(const COutputEntry& s, listSent)
nBalance -= s.amount;
nBalance -= allFee;
}
return ValueFromAmount(nBalance);
}
string strAccount = AccountFromValue(params[0]);
CAmount nBalance = GetAccountBalance(strAccount, nMinDepth, filter, fAddLockConf);
return ValueFromAmount(nBalance);
}
UniValue getunconfirmedbalance(const UniValue ¶ms, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() > 0)
throw runtime_error(
"getunconfirmedbalance\n"
"Returns the server's total unconfirmed balance\n");
LOCK2(cs_main, pwalletMain->cs_wallet);
return ValueFromAmount(pwalletMain->GetUnconfirmedBalance());
}
UniValue movecmd(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() < 3 || params.size() > 5)
throw runtime_error(
"move \"fromaccount\" \"toaccount\" amount ( minconf \"comment\" )\n"
"\nDEPRECATED. Move a specified amount from one account in your wallet to another.\n"
"\nArguments:\n"
"1. \"fromaccount\" (string, required) The name of the account to move funds from. May be the default account using \"\".\n"
"2. \"toaccount\" (string, required) The name of the account to move funds to. May be the default account using \"\".\n"
"3. amount (numeric) Quantity of " + CURRENCY_UNIT + " to move between accounts.\n"
"4. minconf (numeric, optional, default=1) Only use funds with at least this many confirmations.\n"
"5. \"comment\" (string, optional) An optional comment, stored in the wallet only.\n"
"\nResult:\n"
"true|false (boolean) true if successful.\n"
"\nExamples:\n"
"\nMove 0.01 " + CURRENCY_UNIT + " from the default account to the account named tabby\n"
+ HelpExampleCli("move", "\"\" \"tabby\" 0.01") +
"\nMove 0.01 " + CURRENCY_UNIT + " timotei to akiko with a comment and funds have 6 confirmations\n"
+ HelpExampleCli("move", "\"timotei\" \"akiko\" 0.01 6 \"happy birthday!\"") +
"\nAs a json rpc call\n"
+ HelpExampleRpc("move", "\"timotei\", \"akiko\", 0.01, 6, \"happy birthday!\"")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
string strFrom = AccountFromValue(params[0]);
string strTo = AccountFromValue(params[1]);
CAmount nAmount = AmountFromValue(params[2]);
if (nAmount <= 0)
throw JSONRPCError(RPC_TYPE_ERROR, "Invalid amount for send");
if (params.size() > 3)
// unused parameter, used to be nMinDepth, keep type-checking it though
(void)params[3].get_int();
string strComment;
if (params.size() > 4)
strComment = params[4].get_str();
CWalletDB walletdb(pwalletMain->strWalletFile);
if (!walletdb.TxnBegin())
throw JSONRPCError(RPC_DATABASE_ERROR, "database error");
int64_t nNow = GetAdjustedTime();
// Debit
CAccountingEntry debit;
debit.nOrderPos = pwalletMain->IncOrderPosNext(&walletdb);
debit.strAccount = strFrom;
debit.nCreditDebit = -nAmount;
debit.nTime = nNow;
debit.strOtherAccount = strTo;
debit.strComment = strComment;
pwalletMain->AddAccountingEntry(debit, walletdb);
// Credit
CAccountingEntry credit;
credit.nOrderPos = pwalletMain->IncOrderPosNext(&walletdb);
credit.strAccount = strTo;
credit.nCreditDebit = nAmount;
credit.nTime = nNow;
credit.strOtherAccount = strFrom;
credit.strComment = strComment;
pwalletMain->AddAccountingEntry(credit, walletdb);
if (!walletdb.TxnCommit())
throw JSONRPCError(RPC_DATABASE_ERROR, "database error");
return true;
}
UniValue sendfrom(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() < 3 || params.size() > 7)
throw runtime_error(
"sendfrom \"fromaccount\" \"tovirtusaddress\" amount ( minconf addlockconf \"comment\" \"comment-to\" )\n"
"\nDEPRECATED (use sendtoaddress). Sent an amount from an account to a virtus address."
+ HelpRequiringPassphrase() + "\n"
"\nArguments:\n"
"1. \"fromaccount\" (string, required) The name of the account to send funds from. May be the default account using \"\".\n"
"2. \"tovirtusaddress\" (string, required) The virtus address to send funds to.\n"
"3. amount (numeric or string, required) The amount in " + CURRENCY_UNIT + " (transaction fee is added on top).\n"
"4. minconf (numeric, optional, default=1) Only use funds with at least this many confirmations.\n"
"5. addlockconf (bool, optional, default=false) Whether to add " + std::to_string(nInstantSendDepth) + " confirmations to transactions locked via InstantSend.\n"
"6. \"comment\" (string, optional) A comment used to store what the transaction is for. \n"
" This is not part of the transaction, just kept in your wallet.\n"
"7. \"comment-to\" (string, optional) An optional comment to store the name of the person or organization \n"
" to which you're sending the transaction. This is not part of the transaction, \n"
" it is just kept in your wallet.\n"
"\nResult:\n"
"\"transactionid\" (string) The transaction id.\n"
"\nExamples:\n"
"\nSend 0.01 " + CURRENCY_UNIT + " from the default account to the address, must have at least 1 confirmation\n"
+ HelpExampleCli("sendfrom", "\"\" \"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\" 0.01") +
"\nSend 0.01 from the tabby account to the given address, funds must have at least 6 confirmations\n"
+ HelpExampleCli("sendfrom", "\"tabby\" \"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\" 0.01 6 false \"donation\" \"seans outpost\"") +
"\nAs a json rpc call\n"
+ HelpExampleRpc("sendfrom", "\"tabby\", \"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\", 0.01, 6, false, \"donation\", \"seans outpost\"")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
string strAccount = AccountFromValue(params[0]);
CBitcoinAddress address(params[1].get_str());
if (!address.IsValid())
throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid Virtus address");
CAmount nAmount = AmountFromValue(params[2]);
if (nAmount <= 0)
throw JSONRPCError(RPC_TYPE_ERROR, "Invalid amount for send");
int nMinDepth = 1;
if (params.size() > 3)
nMinDepth = params[3].get_int();
bool fAddLockConf = (params.size() > 4 && params[4].get_bool());
CWalletTx wtx;
wtx.strFromAccount = strAccount;
if (params.size() > 5 && !params[5].isNull() && !params[5].get_str().empty())
wtx.mapValue["comment"] = params[5].get_str();
if (params.size() > 6 && !params[6].isNull() && !params[6].get_str().empty())
wtx.mapValue["to"] = params[6].get_str();
EnsureWalletIsUnlocked();
// Check funds
CAmount nBalance = GetAccountBalance(strAccount, nMinDepth, ISMINE_SPENDABLE, fAddLockConf);
if (nAmount > nBalance)
throw JSONRPCError(RPC_WALLET_INSUFFICIENT_FUNDS, "Account has insufficient funds");
SendMoney(address.Get(), nAmount, false, wtx);
return wtx.GetHash().GetHex();
}
UniValue sendmany(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() < 2 || params.size() > 8)
throw runtime_error(
"sendmany \"fromaccount\" {\"address\":amount,...} ( minconf addlockconf \"comment\" [\"address\",...] subtractfeefromamount use_is use_ps )\n"
"\nSend multiple times. Amounts are double-precision floating point numbers."
+ HelpRequiringPassphrase() + "\n"
"\nArguments:\n"
"1. \"fromaccount\" (string, required) DEPRECATED. The account to send the funds from. Should be \"\" for the default account\n"
"2. \"amounts\" (string, required) A json object with addresses and amounts\n"
" {\n"
" \"address\":amount (numeric or string) The virtus address is the key, the numeric amount (can be string) in " + CURRENCY_UNIT + " is the value\n"
" ,...\n"
" }\n"
"3. minconf (numeric, optional, default=1) Only use the balance confirmed at least this many times.\n"
"4. addlockconf (bool, optional, default=false) Whether to add " + std::to_string(nInstantSendDepth) + " confirmations to transactions locked via InstantSend.\n"
"5. \"comment\" (string, optional) A comment\n"
"6. subtractfeefromamount (string, optional) A json array with addresses.\n"
" The fee will be equally deducted from the amount of each selected address.\n"
" Those recipients will receive less virtuss than you enter in their corresponding amount field.\n"
" If no addresses are specified here, the sender pays the fee.\n"
" [\n"
" \"address\" (string) Subtract fee from this address\n"
" ,...\n"
" ]\n"
"7. \"use_is\" (bool, optional) Send this transaction as InstantSend (default: false)\n"
"8. \"use_ps\" (bool, optional) Use anonymized funds only (default: false)\n"
"\nResult:\n"
"\"transactionid\" (string) The transaction id for the send. Only 1 transaction is created regardless of \n"
" the number of addresses.\n"
"\nExamples:\n"
"\nSend two amounts to two different addresses:\n"
+ HelpExampleCli("sendmany", "\"tabby\" \"{\\\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\\\":0.01,\\\"XuQQkwA4FYkq2XERzMY2CiAZhJTEDAbtcg\\\":0.02}\"") +
"\nSend two amounts to two different addresses setting the confirmation and comment:\n"
+ HelpExampleCli("sendmany", "\"tabby\" \"{\\\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\\\":0.01,\\\"XuQQkwA4FYkq2XERzMY2CiAZhJTEDAbtcg\\\":0.02}\" 6 false \"testing\"") +
"\nAs a json rpc call\n"
+ HelpExampleRpc("sendmany", "\"tabby\", \"{\\\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\\\":0.01,\\\"XuQQkwA4FYkq2XERzMY2CiAZhJTEDAbtcg\\\":0.02}\", 6, false, \"testing\"")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
if (pwalletMain->GetBroadcastTransactions() && !g_connman)
throw JSONRPCError(RPC_CLIENT_P2P_DISABLED, "Error: Peer-to-peer functionality missing or disabled");
string strAccount = AccountFromValue(params[0]);
UniValue sendTo = params[1].get_obj();
int nMinDepth = 1;
if (params.size() > 2)
nMinDepth = params[2].get_int();
bool fAddLockConf = (params.size() > 3 && params[3].get_bool());
CWalletTx wtx;
wtx.strFromAccount = strAccount;
if (params.size() > 4 && !params[4].isNull() && !params[4].get_str().empty())
wtx.mapValue["comment"] = params[4].get_str();
UniValue subtractFeeFromAmount(UniValue::VARR);
if (params.size() > 5)
subtractFeeFromAmount = params[5].get_array();
set<CBitcoinAddress> setAddress;
vector<CRecipient> vecSend;
CAmount totalAmount = 0;
vector<string> keys = sendTo.getKeys();
BOOST_FOREACH(const string& name_, keys)
{
CBitcoinAddress address(name_);
if (!address.IsValid())
throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, string("Invalid Virtus address: ")+name_);
if (setAddress.count(address))
throw JSONRPCError(RPC_INVALID_PARAMETER, string("Invalid parameter, duplicated address: ")+name_);
setAddress.insert(address);
CScript scriptPubKey = GetScriptForDestination(address.Get());
CAmount nAmount = AmountFromValue(sendTo[name_]);
if (nAmount <= 0)
throw JSONRPCError(RPC_TYPE_ERROR, "Invalid amount for send");
totalAmount += nAmount;
bool fSubtractFeeFromAmount = false;
for (unsigned int idx = 0; idx < subtractFeeFromAmount.size(); idx++) {
const UniValue& addr = subtractFeeFromAmount[idx];
if (addr.get_str() == name_)
fSubtractFeeFromAmount = true;
}
CRecipient recipient = {scriptPubKey, nAmount, fSubtractFeeFromAmount};
vecSend.push_back(recipient);
}
EnsureWalletIsUnlocked();
// Check funds
CAmount nBalance = GetAccountBalance(strAccount, nMinDepth, ISMINE_SPENDABLE, fAddLockConf);
if (totalAmount > nBalance)
throw JSONRPCError(RPC_WALLET_INSUFFICIENT_FUNDS, "Account has insufficient funds");
// Send
CReserveKey keyChange(pwalletMain);
CAmount nFeeRequired = 0;
int nChangePosRet = -1;
string strFailReason;
bool fUseInstantSend = false;
bool fUsePrivateSend = false;
if (params.size() > 6)
fUseInstantSend = params[6].get_bool();
if (params.size() > 7)
fUsePrivateSend = params[7].get_bool();
bool fCreated = pwalletMain->CreateTransaction(vecSend, wtx, keyChange, nFeeRequired, nChangePosRet, strFailReason,
NULL, true, fUsePrivateSend ? ONLY_DENOMINATED : ALL_COINS, fUseInstantSend);
if (!fCreated)
throw JSONRPCError(RPC_WALLET_INSUFFICIENT_FUNDS, strFailReason);
if (!pwalletMain->CommitTransaction(wtx, keyChange, g_connman.get(), fUseInstantSend ? NetMsgType::TXLOCKREQUEST : NetMsgType::TX))
throw JSONRPCError(RPC_WALLET_ERROR, "Transaction commit failed");
return wtx.GetHash().GetHex();
}
// Defined in rpc/misc.cpp
extern CScript _createmultisig_redeemScript(const UniValue& params);
UniValue addmultisigaddress(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() < 2 || params.size() > 3)
{
string msg = "addmultisigaddress nrequired [\"key\",...] ( \"account\" )\n"
"\nAdd a nrequired-to-sign multisignature address to the wallet.\n"
"Each key is a Virtus address or hex-encoded public key.\n"
"If 'account' is specified (DEPRECATED), assign address to that account.\n"
"\nArguments:\n"
"1. nrequired (numeric, required) The number of required signatures out of the n keys or addresses.\n"
"2. \"keysobject\" (string, required) A json array of virtus addresses or hex-encoded public keys\n"
" [\n"
" \"address\" (string) virtus address or hex-encoded public key\n"
" ...,\n"
" ]\n"
"3. \"account\" (string, optional) DEPRECATED. An account to assign the addresses to.\n"
"\nResult:\n"
"\"virtusaddress\" (string) A virtus address associated with the keys.\n"
"\nExamples:\n"
"\nAdd a multisig address from 2 addresses\n"
+ HelpExampleCli("addmultisigaddress", "2 \"[\\\"Xt4qk9uKvQYAonVGSZNXqxeDmtjaEWgfrs\\\",\\\"XoSoWQkpgLpppPoyyzbUFh1fq2RBvW6UK1\\\"]\"") +
"\nAs json rpc call\n"
+ HelpExampleRpc("addmultisigaddress", "2, \"[\\\"Xt4qk9uKvQYAonVGSZNXqxeDmtjaEWgfrs\\\",\\\"XoSoWQkpgLpppPoyyzbUFh1fq2RBvW6UK1\\\"]\"")
;
throw runtime_error(msg);
}
LOCK2(cs_main, pwalletMain->cs_wallet);
string strAccount;
if (params.size() > 2)
strAccount = AccountFromValue(params[2]);
// Construct using pay-to-script-hash:
CScript inner = _createmultisig_redeemScript(params);
CScriptID innerID(inner);
pwalletMain->AddCScript(inner);
pwalletMain->SetAddressBook(innerID, strAccount, "send");
return CBitcoinAddress(innerID).ToString();
}
struct tallyitem
{
CAmount nAmount;
int nConf;
vector<uint256> txids;
bool fIsWatchonly;
tallyitem()
{
nAmount = 0;
nConf = std::numeric_limits<int>::max();
fIsWatchonly = false;
}
};
UniValue ListReceived(const UniValue& params, bool fByAccounts)
{
// Minimum confirmations
int nMinDepth = 1;
if (params.size() > 0)
nMinDepth = params[0].get_int();
bool fAddLockConf = (params.size() > 1 && params[1].get_bool());
// Whether to include empty accounts
bool fIncludeEmpty = false;
if (params.size() > 2)
fIncludeEmpty = params[2].get_bool();
isminefilter filter = ISMINE_SPENDABLE;
if(params.size() > 3)
if(params[3].get_bool())
filter = filter | ISMINE_WATCH_ONLY;
// Tally
map<CBitcoinAddress, tallyitem> mapTally;
for (map<uint256, CWalletTx>::iterator it = pwalletMain->mapWallet.begin(); it != pwalletMain->mapWallet.end(); ++it)
{
const CWalletTx& wtx = (*it).second;
if (wtx.IsCoinBase() || !CheckFinalTx(wtx))
continue;
int nDepth = wtx.GetDepthInMainChain(fAddLockConf);
if (nDepth < nMinDepth)
continue;
BOOST_FOREACH(const CTxOut& txout, wtx.vout)
{
CTxDestination address;
if (!ExtractDestination(txout.scriptPubKey, address))
continue;
isminefilter mine = IsMine(*pwalletMain, address);
if(!(mine & filter))
continue;
tallyitem& item = mapTally[address];
item.nAmount += txout.nValue;
item.nConf = min(item.nConf, nDepth);
item.txids.push_back(wtx.GetHash());
if (mine & ISMINE_WATCH_ONLY)
item.fIsWatchonly = true;
}
}
// Reply
UniValue ret(UniValue::VARR);
map<string, tallyitem> mapAccountTally;
BOOST_FOREACH(const PAIRTYPE(CBitcoinAddress, CAddressBookData)& item, pwalletMain->mapAddressBook)
{
const CBitcoinAddress& address = item.first;
const string& strAccount = item.second.name;
map<CBitcoinAddress, tallyitem>::iterator it = mapTally.find(address);
if (it == mapTally.end() && !fIncludeEmpty)
continue;
isminefilter mine = IsMine(*pwalletMain, address.Get());
if(!(mine & filter))
continue;
CAmount nAmount = 0;
int nConf = std::numeric_limits<int>::max();
bool fIsWatchonly = false;
if (it != mapTally.end())
{
nAmount = (*it).second.nAmount;
nConf = (*it).second.nConf;
fIsWatchonly = (*it).second.fIsWatchonly;
}
if (fByAccounts)
{
tallyitem& item = mapAccountTally[strAccount];
item.nAmount += nAmount;
item.nConf = min(item.nConf, nConf);
item.fIsWatchonly = fIsWatchonly;
}
else
{
UniValue obj(UniValue::VOBJ);
if(fIsWatchonly)
obj.push_back(Pair("involvesWatchonly", true));
obj.push_back(Pair("address", address.ToString()));
obj.push_back(Pair("account", strAccount));
obj.push_back(Pair("amount", ValueFromAmount(nAmount)));
obj.push_back(Pair("confirmations", (nConf == std::numeric_limits<int>::max() ? 0 : nConf)));
if (!fByAccounts)
obj.push_back(Pair("label", strAccount));
UniValue transactions(UniValue::VARR);
if (it != mapTally.end())
{
BOOST_FOREACH(const uint256& item, (*it).second.txids)
{
transactions.push_back(item.GetHex());
}
}
obj.push_back(Pair("txids", transactions));
ret.push_back(obj);
}
}
if (fByAccounts)
{
for (map<string, tallyitem>::iterator it = mapAccountTally.begin(); it != mapAccountTally.end(); ++it)
{
CAmount nAmount = (*it).second.nAmount;
int nConf = (*it).second.nConf;
UniValue obj(UniValue::VOBJ);
if((*it).second.fIsWatchonly)
obj.push_back(Pair("involvesWatchonly", true));
obj.push_back(Pair("account", (*it).first));
obj.push_back(Pair("amount", ValueFromAmount(nAmount)));
obj.push_back(Pair("confirmations", (nConf == std::numeric_limits<int>::max() ? 0 : nConf)));
ret.push_back(obj);
}
}
return ret;
}
UniValue listreceivedbyaddress(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() > 4)
throw runtime_error(
"listreceivedbyaddress ( minconf addlockconf includeempty includeWatchonly)\n"
"\nList balances by receiving address.\n"
"\nArguments:\n"
"1. minconf (numeric, optional, default=1) The minimum number of confirmations before payments are included.\n"
"2. addlockconf (bool, optional, default=false) Whether to add " + std::to_string(nInstantSendDepth) + " confirmations to transactions locked via InstantSend.\n"
"3. includeempty (bool, optional, default=false) Whether to include addresses that haven't received any payments.\n"
"4. includeWatchonly (bool, optional, default=false) Whether to include watchonly addresses (see 'importaddress').\n"
"\nResult:\n"
"[\n"
" {\n"
" \"involvesWatchonly\" : true, (bool) Only returned if imported addresses were involved in transaction\n"
" \"address\" : \"receivingaddress\", (string) The receiving address\n"
" \"account\" : \"accountname\", (string) DEPRECATED. The account of the receiving address. The default account is \"\".\n"
" \"amount\" : x.xxx, (numeric) The total amount in " + CURRENCY_UNIT + " received by the address\n"
" \"confirmations\" : n (numeric) The number of confirmations of the most recent transaction included.\n"
" If 'addlockconf' is true, the minimum number of confirmations is calculated\n"
" including additional " + std::to_string(nInstantSendDepth) + " confirmations for transactions locked via InstantSend\n"
" \"label\" : \"label\" (string) A comment for the address/transaction, if any\n"
" }\n"
" ,...\n"
"]\n"
"\nExamples:\n"
+ HelpExampleCli("listreceivedbyaddress", "")
+ HelpExampleCli("listreceivedbyaddress", "6 false true")
+ HelpExampleRpc("listreceivedbyaddress", "6, false, true, true")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
return ListReceived(params, false);
}
UniValue listreceivedbyaccount(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() > 4)
throw runtime_error(
"listreceivedbyaccount ( minconf addlockconf includeempty includeWatchonly)\n"
"\nDEPRECATED. List balances by account.\n"
"\nArguments:\n"
"1. minconf (numeric, optional, default=1) The minimum number of confirmations before payments are included.\n"
"2. addlockconf (bool, optional, default=false) Whether to add " + std::to_string(nInstantSendDepth) + " confirmations to transactions locked via InstantSend.\n"
"3. includeempty (bool, optional, default=false) Whether to include accounts that haven't received any payments.\n"
"4. includeWatchonly (bool, optional, default=false) Whether to include watchonly addresses (see 'importaddress').\n"
"\nResult:\n"
"[\n"
" {\n"
" \"involvesWatchonly\" : true, (bool) Only returned if imported addresses were involved in transaction\n"
" \"account\" : \"accountname\", (string) The account name of the receiving account\n"
" \"amount\" : x.xxx, (numeric) The total amount received by addresses with this account\n"
" \"confirmations\" : n (numeric) The number of blockchain confirmations of the most recent transaction included\n"
" \"label\" : \"label\" (string) A comment for the address/transaction, if any\n"
" }\n"
" ,...\n"
"]\n"
"\nExamples:\n"
+ HelpExampleCli("listreceivedbyaccount", "")
+ HelpExampleCli("listreceivedbyaccount", "6 false true")
+ HelpExampleRpc("listreceivedbyaccount", "6, false, true, true")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
return ListReceived(params, true);
}
static void MaybePushAddress(UniValue & entry, const CTxDestination &dest)
{
CBitcoinAddress addr;
if (addr.Set(dest))
entry.push_back(Pair("address", addr.ToString()));
}
void ListTransactions(const CWalletTx& wtx, const string& strAccount, int nMinDepth, bool fLong, UniValue& ret, const isminefilter& filter)
{
CAmount nFee;
string strSentAccount;
list<COutputEntry> listReceived;
list<COutputEntry> listSent;
wtx.GetAmounts(listReceived, listSent, nFee, strSentAccount, filter);
bool fAllAccounts = (strAccount == string("*"));
bool involvesWatchonly = wtx.IsFromMe(ISMINE_WATCH_ONLY);
// Sent
if ((!listSent.empty() || nFee != 0) && (fAllAccounts || strAccount == strSentAccount))
{
BOOST_FOREACH(const COutputEntry& s, listSent)
{
UniValue entry(UniValue::VOBJ);
if(involvesWatchonly || (::IsMine(*pwalletMain, s.destination) & ISMINE_WATCH_ONLY))
entry.push_back(Pair("involvesWatchonly", true));
entry.push_back(Pair("account", strSentAccount));
MaybePushAddress(entry, s.destination);
std::map<std::string, std::string>::const_iterator it = wtx.mapValue.find("DS");
entry.push_back(Pair("category", (it != wtx.mapValue.end() && it->second == "1") ? "privatesend" : "send"));
entry.push_back(Pair("amount", ValueFromAmount(-s.amount)));
if (pwalletMain->mapAddressBook.count(s.destination))
entry.push_back(Pair("label", pwalletMain->mapAddressBook[s.destination].name));
entry.push_back(Pair("vout", s.vout));
entry.push_back(Pair("fee", ValueFromAmount(-nFee)));
if (fLong)
WalletTxToJSON(wtx, entry);
entry.push_back(Pair("abandoned", wtx.isAbandoned()));
ret.push_back(entry);
}
}
// Received
if (listReceived.size() > 0 && wtx.GetDepthInMainChain() >= nMinDepth)
{
BOOST_FOREACH(const COutputEntry& r, listReceived)
{
string account;
if (pwalletMain->mapAddressBook.count(r.destination))
account = pwalletMain->mapAddressBook[r.destination].name;
if (fAllAccounts || (account == strAccount))
{
UniValue entry(UniValue::VOBJ);
if(involvesWatchonly || (::IsMine(*pwalletMain, r.destination) & ISMINE_WATCH_ONLY))
entry.push_back(Pair("involvesWatchonly", true));
entry.push_back(Pair("account", account));
MaybePushAddress(entry, r.destination);
if (wtx.IsCoinBase())
{
if (wtx.GetDepthInMainChain() < 1)
entry.push_back(Pair("category", "orphan"));
else if (wtx.GetBlocksToMaturity() > 0)
entry.push_back(Pair("category", "immature"));
else
entry.push_back(Pair("category", "generate"));
}
else
{
entry.push_back(Pair("category", "receive"));
}
entry.push_back(Pair("amount", ValueFromAmount(r.amount)));
if (pwalletMain->mapAddressBook.count(r.destination))
entry.push_back(Pair("label", account));
entry.push_back(Pair("vout", r.vout));
if (fLong)
WalletTxToJSON(wtx, entry);
ret.push_back(entry);
}
}
}
}
void AcentryToJSON(const CAccountingEntry& acentry, const string& strAccount, UniValue& ret)
{
bool fAllAccounts = (strAccount == string("*"));
if (fAllAccounts || acentry.strAccount == strAccount)
{
UniValue entry(UniValue::VOBJ);
entry.push_back(Pair("account", acentry.strAccount));
entry.push_back(Pair("category", "move"));
entry.push_back(Pair("time", acentry.nTime));
entry.push_back(Pair("amount", ValueFromAmount(acentry.nCreditDebit)));
entry.push_back(Pair("otheraccount", acentry.strOtherAccount));
entry.push_back(Pair("comment", acentry.strComment));
ret.push_back(entry);
}
}
UniValue listtransactions(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() > 4)
throw runtime_error(
"listtransactions ( \"account\" count from includeWatchonly)\n"
"\nReturns up to 'count' most recent transactions skipping the first 'from' transactions for account 'account'.\n"
"\nArguments:\n"
"1. \"account\" (string, optional) DEPRECATED. The account name. Should be \"*\".\n"
"2. count (numeric, optional, default=10) The number of transactions to return\n"
"3. from (numeric, optional, default=0) The number of transactions to skip\n"
"4. includeWatchonly (bool, optional, default=false) Include transactions to watchonly addresses (see 'importaddress')\n"
"\nResult:\n"
"[\n"
" {\n"
" \"account\":\"accountname\", (string) DEPRECATED. The account name associated with the transaction. \n"
" It will be \"\" for the default account.\n"
" \"address\":\"virtusaddress\", (string) The virtus address of the transaction. Not present for \n"
" move transactions (category = move).\n"
" \"category\":\"send|receive|move\", (string) The transaction category. 'move' is a local (off blockchain)\n"
" transaction between accounts, and not associated with an address,\n"
" transaction id or block. 'send' and 'receive' transactions are \n"
" associated with an address, transaction id and block details\n"
" \"amount\": x.xxx, (numeric) The amount in " + CURRENCY_UNIT + ". This is negative for the 'send' category, and for the\n"
" 'move' category for moves outbound. It is positive for the 'receive' category,\n"
" and for the 'move' category for inbound funds.\n"
" \"vout\": n, (numeric) the vout value\n"
" \"fee\": x.xxx, (numeric) The amount of the fee in " + CURRENCY_UNIT + ". This is negative and only available for the \n"
" 'send' category of transactions.\n"
" \"instantlock\" : true|false, (bool) Current transaction lock state. Available for 'send' and 'receive' category of transactions.\n"
" \"confirmations\": n, (numeric) The number of blockchain confirmations for the transaction. Available for 'send' and \n"
" 'receive' category of transactions. Negative confirmations indicate the\n"
" transation conflicts with the block chain\n"
" \"trusted\": xxx (bool) Whether we consider the outputs of this unconfirmed transaction safe to spend.\n"
" \"blockhash\": \"hashvalue\", (string) The block hash containing the transaction. Available for 'send' and 'receive'\n"
" category of transactions.\n"
" \"blockindex\": n, (numeric) The index of the transaction in the block that includes it. Available for 'send' and 'receive'\n"
" category of transactions.\n"
" \"blocktime\": xxx, (numeric) The block time in seconds since epoch (1 Jan 1970 GMT).\n"
" \"txid\": \"transactionid\", (string) The transaction id. Available for 'send' and 'receive' category of transactions.\n"
" \"time\": xxx, (numeric) The transaction time in seconds since epoch (midnight Jan 1 1970 GMT).\n"
" \"timereceived\": xxx, (numeric) The time received in seconds since epoch (midnight Jan 1 1970 GMT). Available \n"
" for 'send' and 'receive' category of transactions.\n"
" \"comment\": \"...\", (string) If a comment is associated with the transaction.\n"
" \"label\": \"label\" (string) A comment for the address/transaction, if any\n"
" \"otheraccount\": \"accountname\", (string) For the 'move' category of transactions, the account the funds came \n"
" from (for receiving funds, positive amounts), or went to (for sending funds,\n"
" negative amounts).\n"
" \"bip125-replaceable\": \"yes|no|unknown\" (string) Whether this transaction could be replaced due to BIP125 (replace-by-fee);\n"
" may be unknown for unconfirmed transactions not in the mempool\n"
" }\n"
"]\n"
"\nExamples:\n"
"\nList the most recent 10 transactions in the systems\n"
+ HelpExampleCli("listtransactions", "") +
"\nList transactions 100 to 120\n"
+ HelpExampleCli("listtransactions", "\"*\" 20 100") +
"\nAs a json rpc call\n"
+ HelpExampleRpc("listtransactions", "\"*\", 20, 100")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
string strAccount = "*";
if (params.size() > 0)
strAccount = params[0].get_str();
int nCount = 10;
if (params.size() > 1)
nCount = params[1].get_int();
int nFrom = 0;
if (params.size() > 2)
nFrom = params[2].get_int();
isminefilter filter = ISMINE_SPENDABLE;
if(params.size() > 3)
if(params[3].get_bool())
filter = filter | ISMINE_WATCH_ONLY;
if (nCount < 0)
throw JSONRPCError(RPC_INVALID_PARAMETER, "Negative count");
if (nFrom < 0)
throw JSONRPCError(RPC_INVALID_PARAMETER, "Negative from");
UniValue ret(UniValue::VARR);
const CWallet::TxItems & txOrdered = pwalletMain->wtxOrdered;
// iterate backwards until we have nCount items to return:
for (CWallet::TxItems::const_reverse_iterator it = txOrdered.rbegin(); it != txOrdered.rend(); ++it)
{
CWalletTx *const pwtx = (*it).second.first;
if (pwtx != 0)
ListTransactions(*pwtx, strAccount, 0, true, ret, filter);
CAccountingEntry *const pacentry = (*it).second.second;
if (pacentry != 0)
AcentryToJSON(*pacentry, strAccount, ret);
if ((int)ret.size() >= (nCount+nFrom)) break;
}
// ret is newest to oldest
if (nFrom > (int)ret.size())
nFrom = ret.size();
if ((nFrom + nCount) > (int)ret.size())
nCount = ret.size() - nFrom;
vector<UniValue> arrTmp = ret.getValues();
vector<UniValue>::iterator first = arrTmp.begin();
std::advance(first, nFrom);
vector<UniValue>::iterator last = arrTmp.begin();
std::advance(last, nFrom+nCount);
if (last != arrTmp.end()) arrTmp.erase(last, arrTmp.end());
if (first != arrTmp.begin()) arrTmp.erase(arrTmp.begin(), first);
std::reverse(arrTmp.begin(), arrTmp.end()); // Return oldest to newest
ret.clear();
ret.setArray();
ret.push_backV(arrTmp);
return ret;
}
UniValue listaccounts(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() > 3)
throw runtime_error(
"listaccounts ( minconf addlockconf includeWatchonly)\n"
"\nDEPRECATED. Returns Object that has account names as keys, account balances as values.\n"
"\nArguments:\n"
"1. minconf (numeric, optional, default=1) Only include transactions with at least this many confirmations\n"
"2. addlockconf (bool, optional, default=false) Whether to add " + std::to_string(nInstantSendDepth) + " confirmations to transactions locked via InstantSend.\n"
"3. includeWatchonly (bool, optional, default=false) Include balances in watchonly addresses (see 'importaddress')\n"
"\nResult:\n"
"{ (json object where keys are account names, and values are numeric balances\n"
" \"account\": x.xxx, (numeric) The property name is the account name, and the value is the total balance for the account.\n"
" ...\n"
"}\n"
"\nExamples:\n"
"\nList account balances where there at least 1 confirmation\n"
+ HelpExampleCli("listaccounts", "") +
"\nList account balances including zero confirmation transactions\n"
+ HelpExampleCli("listaccounts", "0") +
"\nList account balances for 6 or more confirmations\n"
+ HelpExampleCli("listaccounts", "6") +
"\nAs json rpc call\n"
+ HelpExampleRpc("listaccounts", "6")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
int nMinDepth = 1;
if (params.size() > 0)
nMinDepth = params[0].get_int();
bool fAddLockConf = (params.size() > 1 && params[1].get_bool());
isminefilter includeWatchonly = ISMINE_SPENDABLE;
if(params.size() > 2)
if(params[2].get_bool())
includeWatchonly = includeWatchonly | ISMINE_WATCH_ONLY;
map<string, CAmount> mapAccountBalances;
BOOST_FOREACH(const PAIRTYPE(CTxDestination, CAddressBookData)& entry, pwalletMain->mapAddressBook) {
if (IsMine(*pwalletMain, entry.first) & includeWatchonly) // This address belongs to me
mapAccountBalances[entry.second.name] = 0;
}
for (map<uint256, CWalletTx>::iterator it = pwalletMain->mapWallet.begin(); it != pwalletMain->mapWallet.end(); ++it)
{
const CWalletTx& wtx = (*it).second;
CAmount nFee;
string strSentAccount;
list<COutputEntry> listReceived;
list<COutputEntry> listSent;
int nDepth = wtx.GetDepthInMainChain(fAddLockConf);
if (wtx.GetBlocksToMaturity() > 0 || nDepth < 0)
continue;
wtx.GetAmounts(listReceived, listSent, nFee, strSentAccount, includeWatchonly);
mapAccountBalances[strSentAccount] -= nFee;
BOOST_FOREACH(const COutputEntry& s, listSent)
mapAccountBalances[strSentAccount] -= s.amount;
if (nDepth >= nMinDepth)
{
BOOST_FOREACH(const COutputEntry& r, listReceived)
if (pwalletMain->mapAddressBook.count(r.destination))
mapAccountBalances[pwalletMain->mapAddressBook[r.destination].name] += r.amount;
else
mapAccountBalances[""] += r.amount;
}
}
const list<CAccountingEntry> & acentries = pwalletMain->laccentries;
BOOST_FOREACH(const CAccountingEntry& entry, acentries)
mapAccountBalances[entry.strAccount] += entry.nCreditDebit;
UniValue ret(UniValue::VOBJ);
BOOST_FOREACH(const PAIRTYPE(string, CAmount)& accountBalance, mapAccountBalances) {
ret.push_back(Pair(accountBalance.first, ValueFromAmount(accountBalance.second)));
}
return ret;
}
UniValue listsinceblock(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp)
throw runtime_error(
"listsinceblock ( \"blockhash\" target-confirmations includeWatchonly)\n"
"\nGet all transactions in blocks since block [blockhash], or all transactions if omitted\n"
"\nArguments:\n"
"1. \"blockhash\" (string, optional) The block hash to list transactions since\n"
"2. target-confirmations: (numeric, optional) The confirmations required, must be 1 or more\n"
"3. includeWatchonly: (bool, optional, default=false) Include transactions to watchonly addresses (see 'importaddress')"
"\nResult:\n"
"{\n"
" \"transactions\": [\n"
" \"account\":\"accountname\", (string) DEPRECATED. The account name associated with the transaction. Will be \"\" for the default account.\n"
" \"address\":\"virtusaddress\", (string) The virtus address of the transaction. Not present for move transactions (category = move).\n"
" \"category\":\"send|receive\", (string) The transaction category. 'send' has negative amounts, 'receive' has positive amounts.\n"
" \"amount\": x.xxx, (numeric) The amount in " + CURRENCY_UNIT + ". This is negative for the 'send' category, and for the 'move' category for moves \n"
" outbound. It is positive for the 'receive' category, and for the 'move' category for inbound funds.\n"
" \"vout\" : n, (numeric) the vout value\n"
" \"fee\": x.xxx, (numeric) The amount of the fee in " + CURRENCY_UNIT + ". This is negative and only available for the 'send' category of transactions.\n"
" \"instantlock\" : true|false, (bool) Current transaction lock state. Available for 'send' and 'receive' category of transactions.\n"
" \"confirmations\" : n, (numeric) The number of blockchain confirmations for the transaction. Available for 'send' and 'receive' category of transactions.\n"
" \"blockhash\": \"hashvalue\", (string) The block hash containing the transaction. Available for 'send' and 'receive' category of transactions.\n"
" \"blockindex\": n, (numeric) The index of the transaction in the block that includes it. Available for 'send' and 'receive' category of transactions.\n"
" \"blocktime\": xxx, (numeric) The block time in seconds since epoch (1 Jan 1970 GMT).\n"
" \"txid\": \"transactionid\", (string) The transaction id. Available for 'send' and 'receive' category of transactions.\n"
" \"time\": xxx, (numeric) The transaction time in seconds since epoch (Jan 1 1970 GMT).\n"
" \"timereceived\": xxx, (numeric) The time received in seconds since epoch (Jan 1 1970 GMT). Available for 'send' and 'receive' category of transactions.\n"
" \"comment\": \"...\", (string) If a comment is associated with the transaction.\n"
" \"label\" : \"label\" (string) A comment for the address/transaction, if any\n"
" \"to\": \"...\", (string) If a comment to is associated with the transaction.\n"
" ],\n"
" \"lastblock\": \"lastblockhash\" (string) The hash of the last block\n"
"}\n"
"\nExamples:\n"
+ HelpExampleCli("listsinceblock", "")
+ HelpExampleCli("listsinceblock", "\"000000000000000bacf66f7497b7dc45ef753ee9a7d38571037cdb1a57f663ad\" 6")
+ HelpExampleRpc("listsinceblock", "\"000000000000000bacf66f7497b7dc45ef753ee9a7d38571037cdb1a57f663ad\", 6")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
CBlockIndex *pindex = NULL;
int target_confirms = 1;
isminefilter filter = ISMINE_SPENDABLE;
if (params.size() > 0)
{
uint256 blockId;
blockId.SetHex(params[0].get_str());
BlockMap::iterator it = mapBlockIndex.find(blockId);
if (it != mapBlockIndex.end())
pindex = it->second;
else
throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid blockhash");
}
if (params.size() > 1)
{
target_confirms = params[1].get_int();
if (target_confirms < 1)
throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter");
}
if(params.size() > 2)
if(params[2].get_bool())
filter = filter | ISMINE_WATCH_ONLY;
int depth = pindex ? (1 + chainActive.Height() - pindex->nHeight) : -1;
UniValue transactions(UniValue::VARR);
for (map<uint256, CWalletTx>::iterator it = pwalletMain->mapWallet.begin(); it != pwalletMain->mapWallet.end(); it++)
{
CWalletTx tx = (*it).second;
if (depth == -1 || tx.GetDepthInMainChain(false) < depth)
ListTransactions(tx, "*", 0, true, transactions, filter);
}
CBlockIndex *pblockLast = chainActive[chainActive.Height() + 1 - target_confirms];
uint256 lastblock = pblockLast ? pblockLast->GetBlockHash() : uint256();
UniValue ret(UniValue::VOBJ);
ret.push_back(Pair("transactions", transactions));
ret.push_back(Pair("lastblock", lastblock.GetHex()));
return ret;
}
UniValue gettransaction(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() < 1 || params.size() > 2)
throw runtime_error(
"gettransaction \"txid\" ( includeWatchonly )\n"
"\nGet detailed information about in-wallet transaction <txid>\n"
"\nArguments:\n"
"1. \"txid\" (string, required) The transaction id\n"
"2. \"includeWatchonly\" (bool, optional, default=false) Whether to include watchonly addresses in balance calculation and details[]\n"
"\nResult:\n"
"{\n"
" \"amount\" : x.xxx, (numeric) The transaction amount in " + CURRENCY_UNIT + "\n"
" \"instantlock\" : true|false, (bool) Current transaction lock state\n"
" \"confirmations\" : n, (numeric) The number of blockchain confirmations\n"
" \"blockhash\" : \"hash\", (string) The block hash\n"
" \"blockindex\" : xx, (numeric) The index of the transaction in the block that includes it\n"
" \"blocktime\" : ttt, (numeric) The time in seconds since epoch (1 Jan 1970 GMT)\n"
" \"txid\" : \"transactionid\", (string) The transaction id.\n"
" \"time\" : ttt, (numeric) The transaction time in seconds since epoch (1 Jan 1970 GMT)\n"
" \"timereceived\" : ttt, (numeric) The time received in seconds since epoch (1 Jan 1970 GMT)\n"
" \"bip125-replaceable\": \"yes|no|unknown\" (string) Whether this transaction could be replaced due to BIP125 (replace-by-fee);\n"
" may be unknown for unconfirmed transactions not in the mempool\n"
" \"details\" : [\n"
" {\n"
" \"account\" : \"accountname\", (string) DEPRECATED. The account name involved in the transaction, can be \"\" for the default account.\n"
" \"address\" : \"virtusaddress\", (string) The virtus address involved in the transaction\n"
" \"category\" : \"send|receive\", (string) The category, either 'send' or 'receive'\n"
" \"amount\" : x.xxx, (numeric) The amount in " + CURRENCY_UNIT + "\n"
" \"label\" : \"label\", (string) A comment for the address/transaction, if any\n"
" \"vout\" : n, (numeric) the vout value\n"
" }\n"
" ,...\n"
" ],\n"
" \"hex\" : \"data\" (string) Raw data for transaction\n"
"}\n"
"\nExamples:\n"
+ HelpExampleCli("gettransaction", "\"1075db55d416d3ca199f55b6084e2115b9345e16c5cf302fc80e9d5fbf5d48d\"")
+ HelpExampleCli("gettransaction", "\"1075db55d416d3ca199f55b6084e2115b9345e16c5cf302fc80e9d5fbf5d48d\" true")
+ HelpExampleRpc("gettransaction", "\"1075db55d416d3ca199f55b6084e2115b9345e16c5cf302fc80e9d5fbf5d48d\"")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
uint256 hash;
hash.SetHex(params[0].get_str());
isminefilter filter = ISMINE_SPENDABLE;
if(params.size() > 1)
if(params[1].get_bool())
filter = filter | ISMINE_WATCH_ONLY;
UniValue entry(UniValue::VOBJ);
if (!pwalletMain->mapWallet.count(hash))
throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid or non-wallet transaction id");
const CWalletTx& wtx = pwalletMain->mapWallet[hash];
CAmount nCredit = wtx.GetCredit(filter);
CAmount nDebit = wtx.GetDebit(filter);
CAmount nNet = nCredit - nDebit;
CAmount nFee = (wtx.IsFromMe(filter) ? wtx.GetValueOut() - nDebit : 0);
entry.push_back(Pair("amount", ValueFromAmount(nNet - nFee)));
if (wtx.IsFromMe(filter))
entry.push_back(Pair("fee", ValueFromAmount(nFee)));
WalletTxToJSON(wtx, entry);
UniValue details(UniValue::VARR);
ListTransactions(wtx, "*", 0, false, details, filter);
entry.push_back(Pair("details", details));
string strHex = EncodeHexTx(static_cast<CTransaction>(wtx));
entry.push_back(Pair("hex", strHex));
return entry;
}
UniValue abandontransaction(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() != 1)
throw runtime_error(
"abandontransaction \"txid\"\n"
"\nMark in-wallet transaction <txid> as abandoned\n"
"This will mark this transaction and all its in-wallet descendants as abandoned which will allow\n"
"for their inputs to be respent. It can be used to replace \"stuck\" or evicted transactions.\n"
"It only works on transactions which are not included in a block and are not currently in the mempool.\n"
"It has no effect on transactions which are already conflicted or abandoned.\n"
"\nArguments:\n"
"1. \"txid\" (string, required) The transaction id\n"
"\nResult:\n"
"\nExamples:\n"
+ HelpExampleCli("abandontransaction", "\"1075db55d416d3ca199f55b6084e2115b9345e16c5cf302fc80e9d5fbf5d48d\"")
+ HelpExampleRpc("abandontransaction", "\"1075db55d416d3ca199f55b6084e2115b9345e16c5cf302fc80e9d5fbf5d48d\"")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
uint256 hash;
hash.SetHex(params[0].get_str());
if (!pwalletMain->mapWallet.count(hash))
throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid or non-wallet transaction id");
if (!pwalletMain->AbandonTransaction(hash))
throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Transaction not eligible for abandonment");
return NullUniValue;
}
UniValue backupwallet(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() != 1)
throw runtime_error(
"backupwallet \"destination\"\n"
"\nSafely copies wallet.dat to destination, which can be a directory or a path with filename.\n"
"\nArguments:\n"
"1. \"destination\" (string) The destination directory or file\n"
"\nExamples:\n"
+ HelpExampleCli("backupwallet", "\"backup.dat\"")
+ HelpExampleRpc("backupwallet", "\"backup.dat\"")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
string strDest = params[0].get_str();
if (!BackupWallet(*pwalletMain, strDest))
throw JSONRPCError(RPC_WALLET_ERROR, "Error: Wallet backup failed!");
return NullUniValue;
}
UniValue keypoolrefill(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() > 1)
throw runtime_error(
"keypoolrefill ( newsize )\n"
"\nFills the keypool."
+ HelpRequiringPassphrase() + "\n"
"\nArguments\n"
"1. newsize (numeric, optional, default=" + itostr(DEFAULT_KEYPOOL_SIZE) + ") The new keypool size\n"
"\nExamples:\n"
+ HelpExampleCli("keypoolrefill", "")
+ HelpExampleRpc("keypoolrefill", "")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
// 0 is interpreted by TopUpKeyPool() as the default keypool size given by -keypool
unsigned int kpSize = 0;
if (params.size() > 0) {
if (params[0].get_int() < 0)
throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, expected valid size.");
kpSize = (unsigned int)params[0].get_int();
}
EnsureWalletIsUnlocked();
pwalletMain->TopUpKeyPool(kpSize);
if (pwalletMain->GetKeyPoolSize() < (pwalletMain->IsHDEnabled() ? kpSize * 2 : kpSize))
throw JSONRPCError(RPC_WALLET_ERROR, "Error refreshing keypool.");
return NullUniValue;
}
static void LockWallet(CWallet* pWallet)
{
LOCK(cs_nWalletUnlockTime);
nWalletUnlockTime = 0;
pWallet->Lock();
}
UniValue walletpassphrase(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (pwalletMain->IsCrypted() && (fHelp || params.size() < 2 || params.size() > 3))
throw runtime_error(
"walletpassphrase \"passphrase\" timeout ( mixingonly )\n"
"\nStores the wallet decryption key in memory for 'timeout' seconds.\n"
"This is needed prior to performing transactions related to private keys such as sending virtuss\n"
"\nArguments:\n"
"1. \"passphrase\" (string, required) The wallet passphrase\n"
"2. timeout (numeric, required) The time to keep the decryption key in seconds.\n"
"3. mixingonly (boolean, optional, default=false) If is true sending functions are disabled."
"\nNote:\n"
"Issuing the walletpassphrase command while the wallet is already unlocked will set a new unlock\n"
"time that overrides the old one.\n"
"\nExamples:\n"
"\nUnlock the wallet for 60 seconds\n"
+ HelpExampleCli("walletpassphrase", "\"my pass phrase\" 60") +
"\nUnlock the wallet for 60 seconds but allow PrivateSend mixing only\n"
+ HelpExampleCli("walletpassphrase", "\"my pass phrase\" 60 true") +
"\nLock the wallet again (before 60 seconds)\n"
+ HelpExampleCli("walletlock", "") +
"\nAs json rpc call\n"
+ HelpExampleRpc("walletpassphrase", "\"my pass phrase\", 60")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
if (fHelp)
return true;
if (!pwalletMain->IsCrypted())
throw JSONRPCError(RPC_WALLET_WRONG_ENC_STATE, "Error: running with an unencrypted wallet, but walletpassphrase was called.");
// Note that the walletpassphrase is stored in params[0] which is not mlock()ed
SecureString strWalletPass;
strWalletPass.reserve(100);
// TODO: get rid of this .c_str() by implementing SecureString::operator=(std::string)
// Alternately, find a way to make params[0] mlock()'d to begin with.
strWalletPass = params[0].get_str().c_str();
int64_t nSleepTime = params[1].get_int64();
bool fForMixingOnly = false;
if (params.size() >= 3)
fForMixingOnly = params[2].get_bool();
if (fForMixingOnly && !pwalletMain->IsLocked(true) && pwalletMain->IsLocked())
throw JSONRPCError(RPC_WALLET_ALREADY_UNLOCKED, "Error: Wallet is already unlocked for mixing only.");
if (!pwalletMain->IsLocked())
throw JSONRPCError(RPC_WALLET_ALREADY_UNLOCKED, "Error: Wallet is already fully unlocked.");
if (!pwalletMain->Unlock(strWalletPass, fForMixingOnly))
throw JSONRPCError(RPC_WALLET_PASSPHRASE_INCORRECT, "Error: The wallet passphrase entered was incorrect.");
pwalletMain->TopUpKeyPool();
LOCK(cs_nWalletUnlockTime);
nWalletUnlockTime = GetTime() + nSleepTime;
RPCRunLater("lockwallet", boost::bind(LockWallet, pwalletMain), nSleepTime);
return NullUniValue;
}
UniValue walletpassphrasechange(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (pwalletMain->IsCrypted() && (fHelp || params.size() != 2))
throw runtime_error(
"walletpassphrasechange \"oldpassphrase\" \"newpassphrase\"\n"
"\nChanges the wallet passphrase from 'oldpassphrase' to 'newpassphrase'.\n"
"\nArguments:\n"
"1. \"oldpassphrase\" (string) The current passphrase\n"
"2. \"newpassphrase\" (string) The new passphrase\n"
"\nExamples:\n"
+ HelpExampleCli("walletpassphrasechange", "\"old one\" \"new one\"")
+ HelpExampleRpc("walletpassphrasechange", "\"old one\", \"new one\"")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
if (fHelp)
return true;
if (!pwalletMain->IsCrypted())
throw JSONRPCError(RPC_WALLET_WRONG_ENC_STATE, "Error: running with an unencrypted wallet, but walletpassphrasechange was called.");
// TODO: get rid of these .c_str() calls by implementing SecureString::operator=(std::string)
// Alternately, find a way to make params[0] mlock()'d to begin with.
SecureString strOldWalletPass;
strOldWalletPass.reserve(100);
strOldWalletPass = params[0].get_str().c_str();
SecureString strNewWalletPass;
strNewWalletPass.reserve(100);
strNewWalletPass = params[1].get_str().c_str();
if (strOldWalletPass.length() < 1 || strNewWalletPass.length() < 1)
throw runtime_error(
"walletpassphrasechange <oldpassphrase> <newpassphrase>\n"
"Changes the wallet passphrase from <oldpassphrase> to <newpassphrase>.");
if (!pwalletMain->ChangeWalletPassphrase(strOldWalletPass, strNewWalletPass))
throw JSONRPCError(RPC_WALLET_PASSPHRASE_INCORRECT, "Error: The wallet passphrase entered was incorrect.");
return NullUniValue;
}
UniValue walletlock(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (pwalletMain->IsCrypted() && (fHelp || params.size() != 0))
throw runtime_error(
"walletlock\n"
"\nRemoves the wallet encryption key from memory, locking the wallet.\n"
"After calling this method, you will need to call walletpassphrase again\n"
"before being able to call any methods which require the wallet to be unlocked.\n"
"\nExamples:\n"
"\nSet the passphrase for 2 minutes to perform a transaction\n"
+ HelpExampleCli("walletpassphrase", "\"my pass phrase\" 120") +
"\nPerform a send (requires passphrase set)\n"
+ HelpExampleCli("sendtoaddress", "\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\" 1.0") +
"\nClear the passphrase since we are done before 2 minutes is up\n"
+ HelpExampleCli("walletlock", "") +
"\nAs json rpc call\n"
+ HelpExampleRpc("walletlock", "")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
if (fHelp)
return true;
if (!pwalletMain->IsCrypted())
throw JSONRPCError(RPC_WALLET_WRONG_ENC_STATE, "Error: running with an unencrypted wallet, but walletlock was called.");
{
LOCK(cs_nWalletUnlockTime);
pwalletMain->Lock();
nWalletUnlockTime = 0;
}
return NullUniValue;
}
UniValue encryptwallet(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (!pwalletMain->IsCrypted() && (fHelp || params.size() != 1))
throw runtime_error(
"encryptwallet \"passphrase\"\n"
"\nEncrypts the wallet with 'passphrase'. This is for first time encryption.\n"
"After this, any calls that interact with private keys such as sending or signing \n"
"will require the passphrase to be set prior the making these calls.\n"
"Use the walletpassphrase call for this, and then walletlock call.\n"
"If the wallet is already encrypted, use the walletpassphrasechange call.\n"
"Note that this will shutdown the server.\n"
"\nArguments:\n"
"1. \"passphrase\" (string) The pass phrase to encrypt the wallet with. It must be at least 1 character, but should be long.\n"
"\nExamples:\n"
"\nEncrypt you wallet\n"
+ HelpExampleCli("encryptwallet", "\"my pass phrase\"") +
"\nNow set the passphrase to use the wallet, such as for signing or sending virtus\n"
+ HelpExampleCli("walletpassphrase", "\"my pass phrase\"") +
"\nNow we can so something like sign\n"
+ HelpExampleCli("signmessage", "\"virtusaddress\" \"test message\"") +
"\nNow lock the wallet again by removing the passphrase\n"
+ HelpExampleCli("walletlock", "") +
"\nAs a json rpc call\n"
+ HelpExampleRpc("encryptwallet", "\"my pass phrase\"")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
if (fHelp)
return true;
if (pwalletMain->IsCrypted())
throw JSONRPCError(RPC_WALLET_WRONG_ENC_STATE, "Error: running with an encrypted wallet, but encryptwallet was called.");
// TODO: get rid of this .c_str() by implementing SecureString::operator=(std::string)
// Alternately, find a way to make params[0] mlock()'d to begin with.
SecureString strWalletPass;
strWalletPass.reserve(100);
strWalletPass = params[0].get_str().c_str();
if (strWalletPass.length() < 1)
throw runtime_error(
"encryptwallet <passphrase>\n"
"Encrypts the wallet with <passphrase>.");
if (!pwalletMain->EncryptWallet(strWalletPass))
throw JSONRPCError(RPC_WALLET_ENCRYPTION_FAILED, "Error: Failed to encrypt the wallet.");
// BDB seems to have a bad habit of writing old data into
// slack space in .dat files; that is bad if the old data is
// unencrypted private keys. So:
StartShutdown();
return "Wallet encrypted; Virtus Core server stopping, restart to run with encrypted wallet. The keypool has been flushed and a new HD seed was generated (if you are using HD). You need to make a new backup.";
}
UniValue lockunspent(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() < 1 || params.size() > 2)
throw runtime_error(
"lockunspent unlock [{\"txid\":\"txid\",\"vout\":n},...]\n"
"\nUpdates list of temporarily unspendable outputs.\n"
"Temporarily lock (unlock=false) or unlock (unlock=true) specified transaction outputs.\n"
"A locked transaction output will not be chosen by automatic coin selection, when spending virtuss.\n"
"Locks are stored in memory only. Nodes start with zero locked outputs, and the locked output list\n"
"is always cleared (by virtue of process exit) when a node stops or fails.\n"
"Also see the listunspent call\n"
"\nArguments:\n"
"1. unlock (boolean, required) Whether to unlock (true) or lock (false) the specified transactions\n"
"2. \"transactions\" (string, required) A json array of objects. Each object the txid (string) vout (numeric)\n"
" [ (json array of json objects)\n"
" {\n"
" \"txid\":\"id\", (string) The transaction id\n"
" \"vout\": n (numeric) The output number\n"
" }\n"
" ,...\n"
" ]\n"
"\nResult:\n"
"true|false (boolean) Whether the command was successful or not\n"
"\nExamples:\n"
"\nList the unspent transactions\n"
+ HelpExampleCli("listunspent", "") +
"\nLock an unspent transaction\n"
+ HelpExampleCli("lockunspent", "false \"[{\\\"txid\\\":\\\"a08e6907dbbd3d809776dbfc5d82e371b764ed838b5655e72f463568df1aadf0\\\",\\\"vout\\\":1}]\"") +
"\nList the locked transactions\n"
+ HelpExampleCli("listlockunspent", "") +
"\nUnlock the transaction again\n"
+ HelpExampleCli("lockunspent", "true \"[{\\\"txid\\\":\\\"a08e6907dbbd3d809776dbfc5d82e371b764ed838b5655e72f463568df1aadf0\\\",\\\"vout\\\":1}]\"") +
"\nAs a json rpc call\n"
+ HelpExampleRpc("lockunspent", "false, \"[{\\\"txid\\\":\\\"a08e6907dbbd3d809776dbfc5d82e371b764ed838b5655e72f463568df1aadf0\\\",\\\"vout\\\":1}]\"")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
if (params.size() == 1)
RPCTypeCheck(params, boost::assign::list_of(UniValue::VBOOL));
else
RPCTypeCheck(params, boost::assign::list_of(UniValue::VBOOL)(UniValue::VARR));
bool fUnlock = params[0].get_bool();
if (params.size() == 1) {
if (fUnlock)
pwalletMain->UnlockAllCoins();
return true;
}
UniValue outputs = params[1].get_array();
for (unsigned int idx = 0; idx < outputs.size(); idx++) {
const UniValue& output = outputs[idx];
if (!output.isObject())
throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, expected object");
const UniValue& o = output.get_obj();
RPCTypeCheckObj(o, boost::assign::map_list_of("txid", UniValue::VSTR)("vout", UniValue::VNUM));
string txid = find_value(o, "txid").get_str();
if (!IsHex(txid))
throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, expected hex txid");
int nOutput = find_value(o, "vout").get_int();
if (nOutput < 0)
throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, vout must be positive");
COutPoint outpt(uint256S(txid), nOutput);
if (fUnlock)
pwalletMain->UnlockCoin(outpt);
else
pwalletMain->LockCoin(outpt);
}
return true;
}
UniValue listlockunspent(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() > 0)
throw runtime_error(
"listlockunspent\n"
"\nReturns list of temporarily unspendable outputs.\n"
"See the lockunspent call to lock and unlock transactions for spending.\n"
"\nResult:\n"
"[\n"
" {\n"
" \"txid\" : \"transactionid\", (string) The transaction id locked\n"
" \"vout\" : n (numeric) The vout value\n"
" }\n"
" ,...\n"
"]\n"
"\nExamples:\n"
"\nList the unspent transactions\n"
+ HelpExampleCli("listunspent", "") +
"\nLock an unspent transaction\n"
+ HelpExampleCli("lockunspent", "false \"[{\\\"txid\\\":\\\"a08e6907dbbd3d809776dbfc5d82e371b764ed838b5655e72f463568df1aadf0\\\",\\\"vout\\\":1}]\"") +
"\nList the locked transactions\n"
+ HelpExampleCli("listlockunspent", "") +
"\nUnlock the transaction again\n"
+ HelpExampleCli("lockunspent", "true \"[{\\\"txid\\\":\\\"a08e6907dbbd3d809776dbfc5d82e371b764ed838b5655e72f463568df1aadf0\\\",\\\"vout\\\":1}]\"") +
"\nAs a json rpc call\n"
+ HelpExampleRpc("listlockunspent", "")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
vector<COutPoint> vOutpts;
pwalletMain->ListLockedCoins(vOutpts);
UniValue ret(UniValue::VARR);
BOOST_FOREACH(COutPoint &outpt, vOutpts) {
UniValue o(UniValue::VOBJ);
o.push_back(Pair("txid", outpt.hash.GetHex()));
o.push_back(Pair("vout", (int)outpt.n));
ret.push_back(o);
}
return ret;
}
UniValue settxfee(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() < 1 || params.size() > 1)
throw runtime_error(
"settxfee amount\n"
"\nSet the transaction fee per kB. Overwrites the paytxfee parameter.\n"
"\nArguments:\n"
"1. amount (numeric or sting, required) The transaction fee in " + CURRENCY_UNIT + "/kB\n"
"\nResult\n"
"true|false (boolean) Returns true if successful\n"
"\nExamples:\n"
+ HelpExampleCli("settxfee", "0.00001")
+ HelpExampleRpc("settxfee", "0.00001")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
// Amount
CAmount nAmount = AmountFromValue(params[0]);
payTxFee = CFeeRate(nAmount, 1000);
return true;
}
UniValue getwalletinfo(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() != 0)
throw runtime_error(
"getwalletinfo\n"
"Returns an object containing various wallet state info.\n"
"\nResult:\n"
"{\n"
" \"walletversion\": xxxxx, (numeric) the wallet version\n"
" \"balance\": xxxxxxx, (numeric) the total confirmed balance of the wallet in " + CURRENCY_UNIT + "\n"
" \"unconfirmed_balance\": xxx, (numeric) the total unconfirmed balance of the wallet in " + CURRENCY_UNIT + "\n"
" \"immature_balance\": xxxxxx, (numeric) the total immature balance of the wallet in " + CURRENCY_UNIT + "\n"
" \"txcount\": xxxxxxx, (numeric) the total number of transactions in the wallet\n"
" \"keypoololdest\": xxxxxx, (numeric) the timestamp (seconds since GMT epoch) of the oldest pre-generated key in the key pool\n"
" \"keypoolsize\": xxxx, (numeric) how many new keys are pre-generated (only counts external keys)\n"
" \"keypoolsize_hd_internal\": xxxx, (numeric) how many new keys are pre-generated for internal use (used for change outputs, only appears if the wallet is using this feature, otherwise external keys are used)\n"
" \"keys_left\": xxxx, (numeric) how many new keys are left since last automatic backup\n"
" \"unlocked_until\": ttt, (numeric) the timestamp in seconds since epoch (midnight Jan 1 1970 GMT) that the wallet is unlocked for transfers, or 0 if the wallet is locked\n"
" \"paytxfee\": x.xxxx, (numeric) the transaction fee configuration, set in " + CURRENCY_UNIT + "/kB\n"
" \"hdchainid\": \"<hash>\", (string) the ID of the HD chain\n"
" \"hdaccountcount\": xxx, (numeric) how many accounts of the HD chain are in this wallet\n"
" [\n"
" {\n"
" \"hdaccountindex\": xxx, (numeric) the index of the account\n"
" \"hdexternalkeyindex\": xxxx, (numeric) current external childkey index\n"
" \"hdinternalkeyindex\": xxxx, (numeric) current internal childkey index\n"
" }\n"
" ,...\n"
" ]\n"
"}\n"
"\nExamples:\n"
+ HelpExampleCli("getwalletinfo", "")
+ HelpExampleRpc("getwalletinfo", "")
);
LOCK2(cs_main, pwalletMain->cs_wallet);
CHDChain hdChainCurrent;
bool fHDEnabled = pwalletMain->GetHDChain(hdChainCurrent);
UniValue obj(UniValue::VOBJ);
obj.push_back(Pair("walletversion", pwalletMain->GetVersion()));
obj.push_back(Pair("balance", ValueFromAmount(pwalletMain->GetBalance())));
obj.push_back(Pair("unconfirmed_balance", ValueFromAmount(pwalletMain->GetUnconfirmedBalance())));
obj.push_back(Pair("immature_balance", ValueFromAmount(pwalletMain->GetImmatureBalance())));
obj.push_back(Pair("txcount", (int)pwalletMain->mapWallet.size()));
obj.push_back(Pair("keypoololdest", pwalletMain->GetOldestKeyPoolTime()));
obj.push_back(Pair("keypoolsize", (int64_t)pwalletMain->KeypoolCountExternalKeys()));
if (fHDEnabled) {
obj.push_back(Pair("keypoolsize_hd_internal", (int64_t)(pwalletMain->KeypoolCountInternalKeys())));
}
obj.push_back(Pair("keys_left", pwalletMain->nKeysLeftSinceAutoBackup));
if (pwalletMain->IsCrypted())
obj.push_back(Pair("unlocked_until", nWalletUnlockTime));
obj.push_back(Pair("paytxfee", ValueFromAmount(payTxFee.GetFeePerK())));
if (fHDEnabled) {
obj.push_back(Pair("hdchainid", hdChainCurrent.GetID().GetHex()));
obj.push_back(Pair("hdaccountcount", (int64_t)hdChainCurrent.CountAccounts()));
UniValue accounts(UniValue::VARR);
for (size_t i = 0; i < hdChainCurrent.CountAccounts(); ++i)
{
CHDAccount acc;
UniValue account(UniValue::VOBJ);
account.push_back(Pair("hdaccountindex", (int64_t)i));
if(hdChainCurrent.GetAccount(i, acc)) {
account.push_back(Pair("hdexternalkeyindex", (int64_t)acc.nExternalChainCounter));
account.push_back(Pair("hdinternalkeyindex", (int64_t)acc.nInternalChainCounter));
} else {
account.push_back(Pair("error", strprintf("account %d is missing", i)));
}
accounts.push_back(account);
}
obj.push_back(Pair("hdaccounts", accounts));
}
return obj;
}
UniValue keepass(const UniValue& params, bool fHelp) {
string strCommand;
if (params.size() >= 1)
strCommand = params[0].get_str();
if (fHelp ||
(strCommand != "genkey" && strCommand != "init" && strCommand != "setpassphrase"))
throw runtime_error(
"keepass <genkey|init|setpassphrase>\n");
if (strCommand == "genkey")
{
SecureString sResult;
// Generate RSA key
SecureString sKey = CKeePassIntegrator::generateKeePassKey();
sResult = "Generated Key: ";
sResult += sKey;
return sResult.c_str();
}
else if(strCommand == "init")
{
// Generate base64 encoded 256 bit RSA key and associate with KeePassHttp
SecureString sResult;
SecureString sKey;
std::string strId;
keePassInt.rpcAssociate(strId, sKey);
sResult = "Association successful. Id: ";
sResult += strId.c_str();
sResult += " - Key: ";
sResult += sKey.c_str();
return sResult.c_str();
}
else if(strCommand == "setpassphrase")
{
if(params.size() != 2) {
return "setlogin: invalid number of parameters. Requires a passphrase";
}
SecureString sPassphrase = SecureString(params[1].get_str().c_str());
keePassInt.updatePassphrase(sPassphrase);
return "setlogin: Updated credentials.";
}
return "Invalid command";
}
UniValue resendwallettransactions(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() != 0)
throw runtime_error(
"resendwallettransactions\n"
"Immediately re-broadcast unconfirmed wallet transactions to all peers.\n"
"Intended only for testing; the wallet code periodically re-broadcasts\n"
"automatically.\n"
"Returns array of transaction ids that were re-broadcast.\n"
);
if (!g_connman)
throw JSONRPCError(RPC_CLIENT_P2P_DISABLED, "Error: Peer-to-peer functionality missing or disabled");
LOCK2(cs_main, pwalletMain->cs_wallet);
std::vector<uint256> txids = pwalletMain->ResendWalletTransactionsBefore(GetTime(), g_connman.get());
UniValue result(UniValue::VARR);
BOOST_FOREACH(const uint256& txid, txids)
{
result.push_back(txid.ToString());
}
return result;
}
UniValue listunspent(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() > 3)
throw runtime_error(
"listunspent ( minconf maxconf [\"address\",...] )\n"
"\nReturns array of unspent transaction outputs\n"
"with between minconf and maxconf (inclusive) confirmations.\n"
"Optionally filter to only include txouts paid to specified addresses.\n"
"Results are an array of Objects, each of which has:\n"
"{txid, vout, scriptPubKey, amount, confirmations}\n"
"\nArguments:\n"
"1. minconf (numeric, optional, default=1) The minimum confirmations to filter\n"
"2. maxconf (numeric, optional, default=9999999) The maximum confirmations to filter\n"
"3. \"addresses\" (string) A json array of virtus addresses to filter\n"
" [\n"
" \"address\" (string) virtus address\n"
" ,...\n"
" ]\n"
"\nResult\n"
"[ (array of json object)\n"
" {\n"
" \"txid\" : \"txid\", (string) the transaction id \n"
" \"vout\" : n, (numeric) the vout value\n"
" \"address\" : \"address\", (string) the virtus address\n"
" \"account\" : \"account\", (string) DEPRECATED. The associated account, or \"\" for the default account\n"
" \"scriptPubKey\" : \"key\", (string) the script key\n"
" \"amount\" : x.xxx, (numeric) the transaction amount in " + CURRENCY_UNIT + "\n"
" \"confirmations\" : n (numeric) The number of confirmations\n"
" \"ps_rounds\" : n (numeric) The number of PS round\n"
" \"spendable\" : xxx, (bool) Whether we have the private keys to spend this output\n"
" \"solvable\" : xxx (bool) Whether we know how to spend this output, ignoring the lack of keys\n"
" }\n"
" ,...\n"
"]\n"
"\nExamples\n"
+ HelpExampleCli("listunspent", "")
+ HelpExampleCli("listunspent", "6 9999999 \"[\\\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\\\",\\\"XuQQkwA4FYkq2XERzMY2CiAZhJTEDAbtcg\\\"]\"")
+ HelpExampleRpc("listunspent", "6, 9999999 \"[\\\"XwnLY9Tf7Zsef8gMGL2fhWA9ZmMjt4KPwg\\\",\\\"XuQQkwA4FYkq2XERzMY2CiAZhJTEDAbtcg\\\"]\"")
);
RPCTypeCheck(params, boost::assign::list_of(UniValue::VNUM)(UniValue::VNUM)(UniValue::VARR));
int nMinDepth = 1;
if (params.size() > 0)
nMinDepth = params[0].get_int();
int nMaxDepth = 9999999;
if (params.size() > 1)
nMaxDepth = params[1].get_int();
set<CBitcoinAddress> setAddress;
if (params.size() > 2) {
UniValue inputs = params[2].get_array();
for (unsigned int idx = 0; idx < inputs.size(); idx++) {
const UniValue& input = inputs[idx];
CBitcoinAddress address(input.get_str());
if (!address.IsValid())
throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, string("Invalid Virtus address: ")+input.get_str());
if (setAddress.count(address))
throw JSONRPCError(RPC_INVALID_PARAMETER, string("Invalid parameter, duplicated address: ")+input.get_str());
setAddress.insert(address);
}
}
UniValue results(UniValue::VARR);
vector<COutput> vecOutputs;
assert(pwalletMain != NULL);
LOCK2(cs_main, pwalletMain->cs_wallet);
pwalletMain->AvailableCoins(vecOutputs, false, NULL, true);
BOOST_FOREACH(const COutput& out, vecOutputs) {
if (out.nDepth < nMinDepth || out.nDepth > nMaxDepth)
continue;
if (setAddress.size()) {
CTxDestination address;
if (!ExtractDestination(out.tx->vout[out.i].scriptPubKey, address))
continue;
if (!setAddress.count(address))
continue;
}
CAmount nValue = out.tx->vout[out.i].nValue;
const CScript& pk = out.tx->vout[out.i].scriptPubKey;
UniValue entry(UniValue::VOBJ);
entry.push_back(Pair("txid", out.tx->GetHash().GetHex()));
entry.push_back(Pair("vout", out.i));
CTxDestination address;
if (ExtractDestination(out.tx->vout[out.i].scriptPubKey, address)) {
entry.push_back(Pair("address", CBitcoinAddress(address).ToString()));
if (pwalletMain->mapAddressBook.count(address))
entry.push_back(Pair("account", pwalletMain->mapAddressBook[address].name));
}
entry.push_back(Pair("scriptPubKey", HexStr(pk.begin(), pk.end())));
if (pk.IsPayToScriptHash()) {
CTxDestination address;
if (ExtractDestination(pk, address)) {
const CScriptID& hash = boost::get<CScriptID>(address);
CScript redeemScript;
if (pwalletMain->GetCScript(hash, redeemScript))
entry.push_back(Pair("redeemScript", HexStr(redeemScript.begin(), redeemScript.end())));
}
}
entry.push_back(Pair("amount",ValueFromAmount(nValue)));
entry.push_back(Pair("confirmations",out.nDepth));
entry.push_back(Pair("ps_rounds", pwalletMain->GetOutpointPrivateSendRounds(COutPoint(out.tx->GetHash(), out.i))));
entry.push_back(Pair("spendable", out.fSpendable));
entry.push_back(Pair("solvable", out.fSolvable));
results.push_back(entry);
}
return results;
}
UniValue fundrawtransaction(const UniValue& params, bool fHelp)
{
if (!EnsureWalletIsAvailable(fHelp))
return NullUniValue;
if (fHelp || params.size() < 1 || params.size() > 2)
throw runtime_error(
"fundrawtransaction \"hexstring\" includeWatching\n"
"\nAdd inputs to a transaction until it has enough in value to meet its out value.\n"
"This will not modify existing inputs, and will add one change output to the outputs.\n"
"Note that inputs which were signed may need to be resigned after completion since in/outputs have been added.\n"
"The inputs added will not be signed, use signrawtransaction for that.\n"
"Note that all existing inputs must have their previous output transaction be in the wallet.\n"
"Note that all inputs selected must be of standard form and P2SH scripts must be"
"in the wallet using importaddress or addmultisigaddress (to calculate fees).\n"
"You can see whether this is the case by checking the \"solvable\" field in the listunspent output.\n"
"Only pay-to-pubkey, multisig, and P2SH versions thereof are currently supported for watch-only\n"
"\nArguments:\n"
"1. \"hexstring\" (string, required) The hex string of the raw transaction\n"
"2. includeWatching (boolean, optional, default false) Also select inputs which are watch only\n"
"\nResult:\n"
"{\n"
" \"hex\": \"value\", (string) The resulting raw transaction (hex-encoded string)\n"
" \"fee\": n, (numeric) Fee the resulting transaction pays\n"
" \"changepos\": n (numeric) The position of the added change output, or -1\n"
"}\n"
"\"hex\" \n"
"\nExamples:\n"
"\nCreate a transaction with no inputs\n"
+ HelpExampleCli("createrawtransaction", "\"[]\" \"{\\\"myaddress\\\":0.01}\"") +
"\nAdd sufficient unsigned inputs to meet the output value\n"
+ HelpExampleCli("fundrawtransaction", "\"rawtransactionhex\"") +
"\nSign the transaction\n"
+ HelpExampleCli("signrawtransaction", "\"fundedtransactionhex\"") +
"\nSend the transaction\n"
+ HelpExampleCli("sendrawtransaction", "\"signedtransactionhex\"")
);
RPCTypeCheck(params, boost::assign::list_of(UniValue::VSTR)(UniValue::VBOOL));
// parse hex string from parameter
CTransaction origTx;
if (!DecodeHexTx(origTx, params[0].get_str()))
throw JSONRPCError(RPC_DESERIALIZATION_ERROR, "TX decode failed");
if (origTx.vout.size() == 0)
throw JSONRPCError(RPC_INVALID_PARAMETER, "TX must have at least one output");
bool includeWatching = false;
if (params.size() > 1)
includeWatching = params[1].get_bool();
CMutableTransaction tx(origTx);
CAmount nFee;
string strFailReason;
int nChangePos = -1;
if(!pwalletMain->FundTransaction(tx, nFee, nChangePos, strFailReason, includeWatching))
throw JSONRPCError(RPC_INTERNAL_ERROR, strFailReason);
UniValue result(UniValue::VOBJ);
result.push_back(Pair("hex", EncodeHexTx(tx)));
result.push_back(Pair("changepos", nChangePos));
result.push_back(Pair("fee", ValueFromAmount(nFee)));
return result;
}
| [
"virtuspay@gmail.com"
] | virtuspay@gmail.com |
c3bc41ecdaa18017f5ab143475049d51b488e695 | cb80a8562d90eb969272a7ff2cf52c1fa7aeb084 | /inletTest2/0.005/rho | 4eb44b8d9f228ffa4c662ecfeca0055fe51232d4 | [] | no_license | mahoep/inletCFD | eb516145fad17408f018f51e32aa0604871eaa95 | 0df91e3fbfa60d5db9d52739e212ca6d3f0a28b2 | refs/heads/main | 2023-08-30T22:07:41.314690 | 2021-10-14T19:23:51 | 2021-10-14T19:23:51 | 314,657,843 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 320,718 | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: v2006 |
| \\ / A nd | Website: www.openfoam.com |
| \\/ M anipulation | |
\*---------------------------------------------------------------------------*/
FoamFile
{
version 2.0;
format ascii;
class volScalarField;
location "0.005";
object rho;
}
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
dimensions [1 -3 0 0 0 0 0];
internalField nonuniform List<scalar>
38932
(
1.72149
1.72149
1.72166
1.72166
1.72166
1.72167
1.72167
1.72168
1.72169
1.72171
1.72172
1.72174
1.72175
1.72177
1.7218
1.72182
1.72184
1.72187
1.7219
1.72193
1.72196
1.72199
1.72203
1.72206
1.7221
1.72214
1.72218
1.72222
1.72227
1.72231
1.72236
1.7224
1.72245
1.7225
1.72255
1.72261
1.72266
1.72271
1.72277
1.72283
1.72288
1.72294
1.723
1.72306
1.72312
1.72319
1.72325
1.72331
1.72338
1.72344
1.72351
1.72358
1.72364
1.72371
1.72378
1.72385
1.72392
1.72398
1.72405
1.72412
1.72419
1.72426
1.72433
1.7244
1.72447
1.72453
1.7246
1.72467
1.72474
1.7248
1.72487
1.72494
1.725
1.72507
1.72513
1.72519
1.72525
1.72532
1.72538
1.72543
1.72549
1.72555
1.7256
1.72566
1.72571
1.72576
1.72581
1.72586
1.72591
1.72596
1.726
1.72605
1.72609
1.72613
1.72617
1.72621
1.72624
1.72628
1.72631
1.72634
1.72637
1.7264
1.72643
1.72645
1.72648
1.7265
1.72653
1.72655
1.72657
1.72658
1.7266
1.72662
1.72663
1.72665
1.72666
1.72668
1.72669
1.7267
1.72671
1.72672
1.72674
1.72674
1.72675
1.72676
1.72675
1.72672
1.72649
1.72712
1.72251
1.73092
1.70826
1.75621
1.72749
1.72498
1.729
1.72621
1.72597
1.72487
1.72414
1.7252
1.72518
1.72438
1.72422
1.72332
1.72256
1.72339
1.72356
1.72281
1.7226
1.72187
1.72122
1.72189
1.72212
1.72145
1.72121
1.72058
1.71995
1.72054
1.72079
1.72014
1.7199
1.71935
1.7188
1.71929
1.71953
1.71895
1.71873
1.71829
1.7178
1.7182
1.7184
1.71785
1.71766
1.71729
1.71674
1.71711
1.7173
1.71674
1.71654
1.71617
1.71561
1.71597
1.71618
1.71564
1.71544
1.7151
1.71464
1.71494
1.71514
1.71466
1.71449
1.71424
1.71385
1.71406
1.71421
1.71378
1.71365
1.71346
1.71307
1.71325
1.71336
1.71294
1.71284
1.71266
1.71225
1.71242
1.71252
1.71209
1.71199
1.71182
1.7114
1.71156
1.71166
1.71123
1.71114
1.71097
1.71055
1.71071
1.7108
1.71037
1.71028
1.71013
1.70972
1.70986
1.70995
1.70953
1.70945
1.70931
1.7089
1.70903
1.70911
1.7087
1.70862
1.70849
1.70808
1.70821
1.70828
1.70787
1.7078
1.70767
1.70727
1.70739
1.70746
1.70705
1.70698
1.70687
1.70647
1.70657
1.70664
1.70623
1.70617
1.70607
1.70566
1.70576
1.70583
1.70542
1.70536
1.70526
1.70485
1.70495
1.70501
1.7046
1.70454
1.70445
1.70405
1.70414
1.70419
1.70379
1.70374
1.70365
1.70327
1.70335
1.70339
1.70301
1.70296
1.70289
1.70253
1.70259
1.70263
1.70226
1.70222
1.70217
1.70181
1.70186
1.70189
1.70154
1.70151
1.70146
1.70112
1.70117
1.7012
1.70086
1.70084
1.70079
1.70046
1.70051
1.70054
1.70022
1.70019
1.70014
1.69984
1.69989
1.69992
1.69963
1.6996
1.69956
1.69929
1.69933
1.69936
1.6991
1.69908
1.69905
1.69882
1.69885
1.69887
1.69866
1.69865
1.69863
1.69846
1.69848
1.69849
1.69834
1.69834
1.69832
1.69823
1.69824
1.69824
1.6982
1.6982
1.6982
1.69821
1.69821
1.69821
1.69821
1.69822
1.69821
1.69826
1.69826
1.69824
1.69831
1.69833
1.69834
1.69848
1.69846
1.69844
1.6986
1.69863
1.69866
1.69886
1.69882
1.69878
1.69899
1.69903
1.69908
1.69933
1.69928
1.69922
1.6995
1.69955
1.6996
1.69989
1.69985
1.6998
1.70012
1.70017
1.70021
1.70054
1.7005
1.70046
1.70079
1.70083
1.70087
1.70122
1.70118
1.70114
1.70145
1.70148
1.7015
1.70183
1.70182
1.7018
1.70207
1.70207
1.70204
1.70105
1.70163
1.70194
1.70014
1.69872
1.69673
1.69339
1.69522
1.69699
1.69451
1.69309
1.69187
1.69121
1.69186
1.69276
1.69174
1.6913
1.69109
1.69122
1.69115
1.69129
1.69112
1.69119
1.69133
1.69138
1.69122
1.69105
1.69099
1.69121
1.69141
1.69142
1.69117
1.69091
1.69082
1.69114
1.69141
1.6914
1.6911
1.69074
1.69067
1.69108
1.6914
1.69139
1.69108
1.69063
1.6906
1.69108
1.69137
1.69133
1.69109
1.69062
1.69067
1.6911
1.69125
1.69113
1.69108
1.69076
1.69083
1.691
1.69095
1.69069
1.69083
1.69083
1.69073
1.69058
1.69033
1.68991
1.69023
1.69052
1.69019
1.68977
1.68942
1.68887
1.68921
1.6897
1.68908
1.68858
1.68828
1.68769
1.68794
1.68836
1.68765
1.68731
1.68711
1.68655
1.68672
1.68699
1.68639
1.68617
1.68604
1.68557
1.68569
1.68586
1.68541
1.68527
1.68516
1.6848
1.68489
1.68501
1.68463
1.68453
1.68444
1.6841
1.68417
1.68427
1.68391
1.68382
1.68375
1.68342
1.68348
1.68355
1.68322
1.68316
1.68311
1.68282
1.68287
1.68291
1.68264
1.6826
1.68255
1.68229
1.68233
1.68236
1.68208
1.68205
1.68202
1.68174
1.68177
1.68179
1.6815
1.68148
1.68145
1.68116
1.68118
1.6812
1.68093
1.68091
1.68089
1.68066
1.68068
1.68069
1.68049
1.68048
1.68046
1.68031
1.68032
1.68033
1.68024
1.68025
1.68025
1.68027
1.68025
1.68022
1.68021
1.68026
1.68031
1.68013
1.68006
1.68
1.67918
1.67916
1.67917
1.67727
1.67745
1.67768
1.67811
1.67841
1.6785
1.67859
1.67863
1.67868
1.67873
1.6788
1.67888
1.67898
1.67908
1.6792
1.67932
1.6795
1.67971
1.68
1.68016
1.68022
1.68016
1.67982
1.67956
1.67946
1.67925
1.6788
1.67851
1.67835
1.67807
1.6777
1.67726
1.67663
1.67594
1.67532
1.67448
1.67347
1.67458
1.67491
1.67547
1.67605
1.67669
1.67772
1.67737
1.67698
1.67655
1.67635
1.67794
1.678
1.67823
1.67842
1.6786
1.67938
1.6793
1.67922
1.67914
1.67917
1.68008
1.68
1.67998
1.67998
1.67999
1.68047
1.6805
1.68054
1.68061
1.68071
1.68113
1.68103
1.68094
1.68088
1.68083
1.6811
1.68116
1.68123
1.68131
1.68141
1.68158
1.6815
1.68142
1.68135
1.6813
1.68144
1.68149
1.68155
1.68163
1.68169
1.68175
1.6817
1.68163
1.68158
1.68153
1.68159
1.68163
1.68168
1.68173
1.68177
1.68177
1.68174
1.6817
1.68166
1.68163
1.68165
1.68168
1.68171
1.68174
1.68176
1.68175
1.68174
1.68171
1.68169
1.68166
1.68167
1.68169
1.68171
1.68172
1.68173
1.68171
1.68171
1.6817
1.68169
1.68168
1.68168
1.68169
1.68169
1.6817
1.6817
1.68169
1.68168
1.68169
1.68169
1.68168
1.68169
1.68169
1.68168
1.68168
1.68168
1.68167
1.68167
1.68168
1.68168
1.68169
1.68169
1.68168
1.68167
1.68167
1.68167
1.68168
1.68168
1.68168
1.68169
1.6817
1.68171
1.6817
1.68169
1.68169
1.68169
1.6817
1.6817
1.68171
1.68171
1.68172
1.68174
1.68173
1.68172
1.68172
1.68172
1.68173
1.68173
1.68173
1.68174
1.68175
1.68177
1.68176
1.68175
1.68175
1.68175
1.68176
1.68176
1.68176
1.68177
1.68179
1.6818
1.68179
1.68178
1.68177
1.68177
1.68179
1.68179
1.68179
1.6818
1.68181
1.68183
1.68181
1.6818
1.6818
1.6818
1.68181
1.68181
1.68182
1.68183
1.68184
1.68185
1.68184
1.68183
1.68182
1.68182
1.68183
1.68184
1.68184
1.68185
1.68187
1.68188
1.68186
1.68185
1.68185
1.68185
1.68186
1.68186
1.68187
1.68188
1.6819
1.68191
1.6819
1.68188
1.68188
1.68188
1.6819
1.6819
1.6819
1.68192
1.68193
1.68196
1.68194
1.68192
1.68192
1.68192
1.68194
1.68194
1.68195
1.68196
1.68198
1.68201
1.68199
1.68197
1.68197
1.68196
1.68199
1.68199
1.682
1.68201
1.68204
1.68207
1.68204
1.68203
1.68202
1.68202
1.68205
1.68206
1.68206
1.68208
1.6821
1.68214
1.68211
1.6821
1.68209
1.68209
1.68212
1.68213
1.68213
1.68215
1.68218
1.68222
1.68219
1.68217
1.68217
1.68216
1.6822
1.68221
1.68221
1.68223
1.68226
1.6823
1.68228
1.68226
1.68225
1.68225
1.68229
1.68229
1.6823
1.68232
1.68235
1.6824
1.68237
1.68235
1.68234
1.68234
1.68239
1.68239
1.6824
1.68242
1.68245
1.6825
1.68247
1.68245
1.68244
1.68244
1.68248
1.68249
1.6825
1.68252
1.68255
1.6826
1.68257
1.68255
1.68254
1.68253
1.68258
1.68259
1.6826
1.68262
1.68265
1.6827
1.68267
1.68264
1.68263
1.68263
1.68268
1.68268
1.68269
1.68272
1.68275
1.6828
1.68276
1.68274
1.68273
1.68273
1.68277
1.68278
1.68279
1.68281
1.68285
1.6829
1.68286
1.68284
1.68282
1.68282
1.68287
1.68287
1.68288
1.68291
1.68295
1.683
1.68296
1.68293
1.68292
1.68291
1.68296
1.68297
1.68298
1.68301
1.68305
1.6831
1.68305
1.68302
1.68301
1.68301
1.68306
1.68306
1.68307
1.6831
1.68315
1.6832
1.68315
1.68312
1.68311
1.6831
1.68315
1.68316
1.68317
1.6832
1.68325
1.6833
1.68325
1.68322
1.68321
1.68321
1.68326
1.68326
1.68328
1.68331
1.68335
1.68341
1.68336
1.68333
1.68331
1.68331
1.68336
1.68337
1.68338
1.68342
1.68347
1.68352
1.68347
1.68344
1.68342
1.68342
1.68348
1.68348
1.6835
1.68353
1.68358
1.68364
1.68359
1.68356
1.68354
1.68354
1.6836
1.68361
1.68362
1.68366
1.68371
1.68377
1.68372
1.68369
1.68367
1.68367
1.68373
1.68374
1.68375
1.68379
1.68384
1.68391
1.68386
1.68383
1.68381
1.6838
1.68388
1.68389
1.6839
1.68394
1.68399
1.68406
1.68401
1.68398
1.68396
1.68396
1.68403
1.68404
1.68406
1.6841
1.68415
1.68423
1.68418
1.68414
1.68413
1.68412
1.68421
1.68421
1.68423
1.68427
1.68432
1.68441
1.68435
1.68432
1.6843
1.68429
1.68438
1.68439
1.68441
1.68445
1.6845
1.68459
1.68454
1.6845
1.68448
1.68447
1.68456
1.68457
1.68459
1.68463
1.68468
1.68477
1.68471
1.68467
1.68465
1.68465
1.68472
1.68473
1.68475
1.68479
1.68485
1.68493
1.68486
1.68482
1.6848
1.6848
1.68486
1.68486
1.68488
1.68493
1.685
1.68512
1.68504
1.68498
1.68495
1.68495
1.68504
1.68504
1.68509
1.68518
1.68529
1.68541
1.68532
1.68523
1.68516
1.68515
1.68528
1.68529
1.68537
1.68547
1.68554
1.68566
1.6856
1.68551
1.68543
1.6854
1.68552
1.68556
1.68565
1.68573
1.68578
1.6859
1.68585
1.68577
1.68568
1.68564
1.68576
1.68581
1.6859
1.68597
1.68602
1.68613
1.68609
1.68602
1.68594
1.68588
1.686
1.68606
1.68614
1.68621
1.68624
1.68636
1.68632
1.68626
1.68618
1.68611
1.68621
1.6863
1.68637
1.68644
1.68647
1.68658
1.68655
1.68648
1.68641
1.6863
1.6864
1.68652
1.68658
1.68667
1.68669
1.6868
1.68678
1.68669
1.68664
1.68648
1.68657
1.68676
1.68679
1.68689
1.68691
1.68702
1.68701
1.6869
1.68688
1.68667
1.68677
1.687
1.68701
1.68712
1.68713
1.68724
1.68724
1.68712
1.68712
1.68687
1.68697
1.68723
1.68721
1.68736
1.68736
1.68745
1.68745
1.6873
1.68733
1.68706
1.68715
1.68742
1.68737
1.68751
1.68751
1.68758
1.68759
1.68746
1.6875
1.68724
1.68732
1.68759
1.68754
1.68767
1.68766
1.68775
1.68775
1.68763
1.68767
1.6874
1.68748
1.68774
1.68771
1.68783
1.68783
1.68792
1.68791
1.68778
1.68781
1.68756
1.68763
1.68787
1.68786
1.68799
1.68801
1.68811
1.68806
1.68794
1.68792
1.6877
1.68776
1.68797
1.688
1.68812
1.68818
1.68821
1.68816
1.68805
1.68801
1.68782
1.68787
1.68806
1.68811
1.68821
1.68828
1.68835
1.68828
1.68817
1.68811
1.68793
1.68799
1.68817
1.68823
1.68833
1.68839
1.68846
1.68841
1.6883
1.68824
1.68805
1.68812
1.68833
1.68839
1.68851
1.68855
1.68866
1.68861
1.68849
1.68843
1.68821
1.6883
1.68854
1.6886
1.68872
1.68877
1.6889
1.68883
1.68873
1.68866
1.68842
1.68854
1.68879
1.68886
1.68896
1.68903
1.68918
1.68909
1.68899
1.68893
1.68867
1.68882
1.68906
1.68913
1.68922
1.6893
1.68939
1.68933
1.68924
1.68919
1.68896
1.68913
1.68933
1.68939
1.68945
1.6895
1.68964
1.6896
1.68954
1.68948
1.68929
1.68945
1.68964
1.68969
1.68975
1.6898
1.68996
1.68992
1.68986
1.68981
1.68962
1.68979
1.68997
1.69002
1.69009
1.69016
1.6903
1.69024
1.69018
1.69012
1.68997
1.69013
1.69026
1.69032
1.69037
1.69042
1.69055
1.69052
1.69047
1.69042
1.69031
1.69052
1.6906
1.69065
1.69069
1.69072
1.6909
1.69088
1.69084
1.69079
1.69072
1.6909
1.69099
1.69104
1.69108
1.69111
1.69134
1.69129
1.69124
1.69119
1.69111
1.69131
1.69139
1.69143
1.69147
1.69151
1.69168
1.69165
1.69161
1.69157
1.6915
1.69169
1.69176
1.6918
1.69182
1.69183
1.69202
1.69202
1.692
1.69197
1.69192
1.69213
1.69219
1.69222
1.69223
1.69223
1.69247
1.69247
1.69245
1.69242
1.69238
1.69259
1.69265
1.69268
1.69271
1.69275
1.69293
1.69291
1.6929
1.69288
1.69282
1.69305
1.6931
1.69312
1.69314
1.69315
1.69333
1.69334
1.69334
1.69333
1.69327
1.69353
1.69357
1.69358
1.69358
1.69356
1.69382
1.69384
1.69385
1.69385
1.69382
1.69407
1.69411
1.69412
1.69412
1.69414
1.69433
1.69435
1.69437
1.69437
1.69434
1.69458
1.69463
1.69463
1.69462
1.69461
1.69481
1.69486
1.69489
1.6949
1.69487
1.69516
1.69518
1.69516
1.69513
1.69508
1.69542
1.69543
1.69546
1.69547
1.69545
1.69574
1.69576
1.69574
1.69568
1.69561
1.69594
1.69598
1.69602
1.69605
1.69605
1.69633
1.69635
1.69631
1.69624
1.69616
1.69645
1.69655
1.69662
1.69668
1.69669
1.69703
1.69702
1.69696
1.69689
1.69682
1.69703
1.69716
1.69728
1.69735
1.69736
1.69769
1.69767
1.6976
1.69751
1.69742
1.69764
1.69779
1.69792
1.69801
1.69802
1.69839
1.69837
1.69826
1.69812
1.69795
1.69835
1.69849
1.69864
1.69878
1.69884
1.69922
1.69916
1.69901
1.6988
1.69856
1.69902
1.69919
1.69937
1.69953
1.69959
1.69995
1.69989
1.69971
1.69948
1.69924
1.69958
1.69982
1.70006
1.70026
1.70033
1.70071
1.70063
1.70041
1.7001
1.69975
1.70022
1.70048
1.70075
1.70099
1.7011
1.7015
1.70136
1.70108
1.70074
1.70038
1.70069
1.70107
1.70144
1.70175
1.70194
1.7024
1.70218
1.70182
1.70136
1.70085
1.70132
1.70175
1.70218
1.70255
1.70278
1.70315
1.70291
1.7025
1.70201
1.70148
1.70157
1.70221
1.70281
1.70325
1.70351
1.70387
1.70357
1.70308
1.70249
1.70191
1.70188
1.70262
1.7033
1.70387
1.70423
1.70457
1.70414
1.70349
1.70269
1.70188
1.70188
1.70272
1.70359
1.70434
1.70488
1.70519
1.70448
1.70356
1.70252
1.70144
1.70126
1.70224
1.70336
1.70443
1.70534
1.70532
1.7041
1.7028
1.70146
1.70031
1.69883
1.70018
1.70171
1.70328
1.70499
1.70377
1.70169
1.7
1.69872
1.69814
1.69425
1.6958
1.69725
1.69864
1.70001
1.69126
1.69407
1.69386
1.69332
1.69358
1.68893
1.69005
1.69097
1.69129
1.68908
1.68824
1.68907
1.68845
1.68803
1.68865
1.68321
1.68401
1.68504
1.68605
1.68587
1.68195
1.68165
1.68077
1.68056
1.68121
1.67578
1.67526
1.67478
1.6738
1.6666
1.66248
1.66843
1.66966
1.67041
1.67124
1.66735
1.66634
1.66551
1.66466
1.6616
1.65585
1.65984
1.66097
1.66207
1.66333
1.65888
1.6572
1.65575
1.65437
1.64305
1.64008
1.64981
1.65143
1.65293
1.65412
1.65112
1.649
1.64731
1.64558
1.63655
1.63415
1.64184
1.64339
1.64492
1.64595
1.64488
1.64205
1.63962
1.63763
1.62538
1.62552
1.63533
1.63727
1.63952
1.64127
1.64106
1.63823
1.63573
1.63378
1.62413
1.62578
1.63304
1.63482
1.63703
1.63887
1.6391
1.63665
1.63445
1.63277
1.62806
1.62938
1.6324
1.63392
1.63593
1.63763
1.63791
1.63535
1.63283
1.63093
1.62386
1.62442
1.63085
1.63243
1.63496
1.63702
1.63776
1.63559
1.63346
1.63206
1.62858
1.63017
1.63314
1.63462
1.63639
1.63802
1.63877
1.63705
1.63545
1.634
1.63176
1.63286
1.63465
1.63598
1.63735
1.63873
1.63914
1.63784
1.63652
1.63524
1.63364
1.63355
1.63566
1.63692
1.63823
1.63958
1.64005
1.63874
1.63731
1.6361
1.63355
1.63479
1.63677
1.63797
1.63923
1.64055
1.64073
1.63974
1.63873
1.63772
1.63637
1.63741
1.63856
1.63951
1.6405
1.64154
1.64192
1.64098
1.64014
1.63929
1.63834
1.63913
1.6399
1.64064
1.64134
1.64205
1.64276
1.64192
1.64115
1.64042
1.63971
1.6402
1.64089
1.64155
1.6422
1.64296
1.64301
1.64245
1.6419
1.64131
1.64074
1.64111
1.64169
1.64229
1.64292
1.64361
1.64371
1.64316
1.64259
1.64199
1.6411
1.64147
1.64233
1.64294
1.64361
1.64433
1.64447
1.64385
1.64331
1.64277
1.64212
1.64266
1.64321
1.64369
1.64413
1.64459
1.64527
1.64465
1.64411
1.64362
1.6431
1.64348
1.64397
1.64441
1.64485
1.64534
1.64541
1.64504
1.64468
1.64427
1.64379
1.64416
1.64459
1.64501
1.64548
1.64602
1.64602
1.6456
1.64523
1.64485
1.64442
1.64473
1.64511
1.64545
1.64575
1.64606
1.64661
1.64613
1.64571
1.64533
1.64493
1.64515
1.64553
1.64588
1.64621
1.64657
1.64658
1.64631
1.64604
1.64573
1.64536
1.64555
1.64592
1.64626
1.64665
1.64709
1.64702
1.64669
1.64639
1.64608
1.64572
1.64585
1.64622
1.64652
1.64677
1.64701
1.64748
1.64707
1.64671
1.64639
1.64603
1.64615
1.64651
1.64681
1.64708
1.64739
1.64736
1.64714
1.6469
1.64663
1.64629
1.64638
1.64674
1.64705
1.64741
1.6478
1.6477
1.6474
1.64712
1.64683
1.64648
1.64658
1.6469
1.64716
1.6474
1.64767
1.64768
1.64748
1.64726
1.647
1.64667
1.64677
1.6471
1.64738
1.64769
1.64803
1.64791
1.64766
1.64743
1.64717
1.64683
1.64694
1.64725
1.64749
1.64768
1.64785
1.64821
1.64789
1.64759
1.64733
1.64702
1.64707
1.64738
1.64763
1.64784
1.64808
1.64802
1.64785
1.64766
1.64743
1.64712
1.64721
1.64751
1.64776
1.64804
1.64835
1.64822
1.648
1.64779
1.64756
1.64725
1.64732
1.6476
1.64782
1.648
1.64815
1.64847
1.64818
1.64791
1.64767
1.64736
1.64741
1.64771
1.64793
1.64812
1.64834
1.64827
1.64813
1.64796
1.64775
1.64747
1.64753
1.64781
1.64804
1.6483
1.64858
1.64844
1.64824
1.64806
1.64785
1.64758
1.64761
1.64788
1.64808
1.64824
1.64838
1.64867
1.64841
1.64816
1.64794
1.64768
1.64773
1.64798
1.64818
1.64836
1.64854
1.64848
1.64836
1.64821
1.64803
1.6478
1.64783
1.64807
1.64829
1.64851
1.64876
1.64864
1.64846
1.6483
1.64811
1.64788
1.64794
1.64815
1.64833
1.64847
1.64858
1.64886
1.64863
1.64841
1.6482
1.648
1.64807
1.64825
1.64844
1.64859
1.64874
1.6487
1.6486
1.64848
1.6483
1.64815
1.6482
1.64836
1.64856
1.64876
1.64897
1.64887
1.64872
1.64859
1.6484
1.64827
1.64835
1.64845
1.64864
1.64875
1.64884
1.64911
1.64891
1.64874
1.64852
1.64844
1.64851
1.64858
1.64879
1.64889
1.64901
1.649
1.64891
1.64883
1.64865
1.64858
1.64867
1.64872
1.64891
1.64908
1.64926
1.64918
1.64907
1.64896
1.6488
1.64877
1.64886
1.64887
1.64902
1.64911
1.64919
1.64943
1.64927
1.64912
1.64895
1.64895
1.64905
1.64903
1.64918
1.64928
1.64941
1.64938
1.64933
1.64925
1.64911
1.64915
1.64925
1.6492
1.64937
1.64949
1.6496
1.64964
1.64959
1.64949
1.64931
1.64936
1.64947
1.64944
1.64965
1.64982
1.64994
1.65001
1.64987
1.64975
1.64955
1.64956
1.64963
1.64963
1.64985
1.64994
1.65007
1.65012
1.65005
1.64997
1.64974
1.64972
1.64982
1.6499
1.65011
1.65029
1.65048
1.65036
1.65032
1.65022
1.65004
1.64993
1.65005
1.65018
1.65037
1.65055
1.65075
1.65071
1.65058
1.65047
1.65031
1.65018
1.65031
1.65046
1.65059
1.65066
1.65073
1.65114
1.65095
1.65077
1.65063
1.6505
1.65064
1.65077
1.65089
1.65098
1.65108
1.65111
1.65106
1.651
1.6509
1.65076
1.65092
1.65105
1.65118
1.65133
1.65151
1.65146
1.65137
1.6513
1.6512
1.65109
1.65122
1.65133
1.65141
1.65146
1.65149
1.65188
1.65173
1.65159
1.65149
1.65138
1.65152
1.65162
1.65171
1.65177
1.65184
1.65187
1.65185
1.65182
1.65176
1.65166
1.65181
1.65191
1.652
1.65212
1.65225
1.65221
1.65216
1.65212
1.65206
1.652
1.65213
1.65219
1.65223
1.65224
1.65224
1.6526
1.65249
1.65239
1.65232
1.65224
1.65235
1.65244
1.65249
1.65252
1.65255
1.65259
1.6526
1.6526
1.65257
1.65249
1.65267
1.65272
1.65277
1.65285
1.65294
1.65289
1.65288
1.65287
1.65284
1.6528
1.65287
1.65294
1.65296
1.65295
1.65292
1.65324
1.65317
1.65311
1.65308
1.65303
1.65316
1.6532
1.65322
1.65321
1.65315
1.65348
1.65341
1.65336
1.65332
1.65328
1.65337
1.65343
1.65345
1.65344
1.65345
1.65348
1.65352
1.65355
1.65354
1.65351
1.65368
1.65369
1.65371
1.65376
1.6538
1.65375
1.65378
1.6538
1.65379
1.65379
1.65387
1.65388
1.65388
1.65384
1.65378
1.65406
1.65402
1.654
1.65398
1.65394
1.65406
1.65409
1.65408
1.65405
1.65396
1.65425
1.65422
1.6542
1.65419
1.65417
1.65427
1.65428
1.65427
1.65423
1.65421
1.65423
1.65429
1.65434
1.65436
1.65435
1.65447
1.65447
1.65447
1.65449
1.65451
1.65446
1.6545
1.65453
1.65454
1.65453
1.65462
1.65462
1.6546
1.65455
1.65448
1.65474
1.65473
1.65472
1.65472
1.65472
1.65483
1.65482
1.6548
1.65475
1.65465
1.65491
1.6549
1.6549
1.65492
1.65492
1.65502
1.65499
1.65496
1.65491
1.65486
1.65488
1.65495
1.65501
1.65504
1.65505
1.65514
1.65513
1.65512
1.65513
1.65513
1.65507
1.65513
1.65518
1.6552
1.65522
1.65528
1.65526
1.65523
1.65517
1.65509
1.65532
1.65533
1.65533
1.65535
1.65535
1.65546
1.65543
1.6554
1.65534
1.65523
1.65546
1.65547
1.65548
1.6555
1.6555
1.65561
1.65556
1.65552
1.65546
1.65541
1.65541
1.6555
1.65557
1.65561
1.65563
1.65571
1.65569
1.65567
1.65565
1.65562
1.65554
1.65565
1.65573
1.65577
1.6558
1.65589
1.65584
1.6558
1.65577
1.65575
1.65569
1.65575
1.65582
1.65586
1.65591
1.65592
1.65589
1.65585
1.65577
1.65568
1.65588
1.65591
1.65593
1.65596
1.65597
1.65605
1.65603
1.65599
1.65591
1.65579
1.65599
1.65602
1.65606
1.65611
1.65618
1.65618
1.65612
1.65607
1.656
1.65592
1.65591
1.656
1.65608
1.65613
1.65615
1.6562
1.65618
1.65615
1.65613
1.65609
1.656
1.65612
1.65619
1.65624
1.65628
1.65633
1.65628
1.65624
1.65621
1.65618
1.65611
1.65618
1.65624
1.65629
1.65631
1.65632
1.65631
1.65627
1.65619
1.6561
1.65628
1.65632
1.65636
1.65639
1.65642
1.65655
1.65648
1.65642
1.65633
1.6562
1.65637
1.65642
1.65647
1.65652
1.6566
1.65658
1.65651
1.65646
1.65638
1.65629
1.65625
1.65636
1.65645
1.6565
1.65655
1.65654
1.65651
1.65648
1.65645
1.6564
1.6563
1.65642
1.65649
1.65653
1.65655
1.65657
1.65655
1.65652
1.65649
1.65645
1.65637
1.65644
1.65651
1.65656
1.65658
1.65659
1.65656
1.65651
1.65643
1.65633
1.65648
1.65653
1.65657
1.6566
1.65663
1.65661
1.65662
1.65659
1.65651
1.65639
1.65653
1.65658
1.65663
1.65669
1.65678
1.65676
1.6567
1.65664
1.65655
1.65642
1.65655
1.6566
1.65664
1.65669
1.65675
1.65666
1.65664
1.6566
1.65652
1.65644
1.65639
1.65649
1.65658
1.65662
1.65665
1.65665
1.65664
1.65661
1.65658
1.65652
1.65642
1.65655
1.65663
1.65667
1.65673
1.6567
1.65667
1.65664
1.6566
1.65654
1.65645
1.65653
1.6566
1.65665
1.65668
1.65667
1.65663
1.65658
1.65649
1.65639
1.65651
1.65657
1.6566
1.65662
1.65663
1.65667
1.65663
1.6566
1.65652
1.6564
1.6565
1.65655
1.65659
1.65662
1.65662
1.65662
1.6566
1.65656
1.65649
1.65638
1.65647
1.65651
1.65655
1.65658
1.65659
1.65654
1.65653
1.65649
1.65642
1.65635
1.65627
1.65637
1.65645
1.65649
1.6565
1.65647
1.65648
1.65647
1.65644
1.65639
1.65627
1.6564
1.65646
1.65648
1.65645
1.65658
1.65653
1.65648
1.65644
1.65638
1.65626
1.65638
1.65646
1.65651
1.65654
1.6565
1.65647
1.65643
1.65639
1.65634
1.6562
1.65628
1.65635
1.65639
1.6564
1.65632
1.65632
1.65629
1.65621
1.6561
1.65619
1.65624
1.65627
1.65627
1.65625
1.6562
1.65624
1.65623
1.65618
1.65606
1.65614
1.65619
1.65622
1.65624
1.65623
1.65618
1.6562
1.65617
1.65611
1.656
1.65607
1.65611
1.65614
1.65615
1.65614
1.65607
1.65607
1.65605
1.65599
1.65592
1.65581
1.6559
1.65597
1.65599
1.65594
1.65591
1.65594
1.65595
1.65593
1.65588
1.65575
1.65587
1.65591
1.65591
1.65586
1.65587
1.65589
1.65588
1.65585
1.65581
1.65566
1.65575
1.65581
1.65582
1.65578
1.65569
1.65574
1.65574
1.65573
1.6557
1.65553
1.65559
1.65563
1.65564
1.65559
1.65547
1.65554
1.65554
1.65549
1.6554
1.65547
1.65551
1.65551
1.65549
1.65543
1.65537
1.65545
1.65547
1.65544
1.65534
1.65539
1.65543
1.65544
1.65543
1.6554
1.65531
1.65537
1.65538
1.65533
1.65524
1.65527
1.6553
1.65532
1.6553
1.65522
1.65516
1.65522
1.65523
1.65518
1.65509
1.6551
1.65514
1.65515
1.65513
1.65508
1.65493
1.65499
1.655
1.65496
1.6549
1.65474
1.65482
1.65486
1.65484
1.65472
1.65463
1.65474
1.65479
1.65481
1.65478
1.65463
1.65471
1.65472
1.65468
1.65455
1.65453
1.65462
1.65466
1.65467
1.65465
1.65448
1.65455
1.65457
1.65452
1.65438
1.65428
1.65444
1.65449
1.6545
1.65449
1.6543
1.65438
1.65441
1.65437
1.65427
1.65419
1.65428
1.65433
1.65434
1.65432
1.65411
1.65416
1.65418
1.65415
1.65402
1.65389
1.65401
1.65405
1.65401
1.65393
1.65396
1.65398
1.65396
1.6539
1.65379
1.65364
1.65379
1.65386
1.65386
1.65379
1.65378
1.65378
1.65375
1.65367
1.6535
1.65332
1.65355
1.65363
1.65364
1.65359
1.65358
1.65357
1.65354
1.65347
1.65334
1.65317
1.65335
1.65342
1.65342
1.65337
1.65336
1.65335
1.6533
1.65322
1.65301
1.65289
1.65306
1.65313
1.65314
1.65312
1.65292
1.65296
1.65296
1.65288
1.65269
1.65254
1.65276
1.65288
1.65293
1.65294
1.65277
1.65281
1.65279
1.65271
1.65254
1.65235
1.65259
1.6527
1.65275
1.65276
1.65256
1.6526
1.65258
1.65249
1.65228
1.65215
1.65237
1.65247
1.65251
1.65253
1.6523
1.65234
1.65232
1.65222
1.652
1.65182
1.65205
1.65217
1.65224
1.65227
1.652
1.65199
1.65195
1.65182
1.65154
1.65138
1.65165
1.65177
1.65179
1.65177
1.65178
1.65175
1.65168
1.65155
1.65131
1.65113
1.65142
1.65156
1.65162
1.6516
1.65158
1.65154
1.65146
1.6513
1.65099
1.65095
1.65122
1.65134
1.65139
1.65137
1.65135
1.65131
1.65123
1.65108
1.65075
1.6508
1.651
1.65111
1.65115
1.65112
1.65107
1.65104
1.65098
1.65085
1.65061
1.6503
1.65063
1.65078
1.65083
1.65082
1.65075
1.6507
1.65061
1.65044
1.65013
1.6499
1.65022
1.65037
1.65042
1.65045
1.65018
1.65019
1.65014
1.64999
1.64966
1.64945
1.64981
1.65
1.65011
1.65016
1.64995
1.64995
1.64987
1.6497
1.64937
1.64922
1.64956
1.64975
1.64985
1.64991
1.64967
1.64966
1.64958
1.64938
1.64897
1.64891
1.64927
1.64945
1.64955
1.64962
1.64937
1.64936
1.64929
1.64912
1.64877
1.64855
1.64894
1.64913
1.64924
1.64931
1.649
1.64896
1.64889
1.64871
1.64838
1.64808
1.64846
1.64865
1.64872
1.64872
1.64869
1.64863
1.64851
1.64829
1.64792
1.64782
1.64816
1.64836
1.64845
1.64847
1.64842
1.64833
1.64821
1.64798
1.64755
1.64736
1.6478
1.64802
1.64812
1.64816
1.64808
1.64799
1.64786
1.64764
1.64725
1.64695
1.64743
1.64766
1.64777
1.64781
1.64773
1.64763
1.64749
1.64727
1.64683
1.64661
1.64707
1.6473
1.6474
1.64744
1.64737
1.64727
1.64712
1.64689
1.64644
1.6462
1.64662
1.64684
1.64696
1.64703
1.6467
1.64668
1.64658
1.64636
1.64597
1.64567
1.64614
1.64641
1.64658
1.64667
1.64643
1.64639
1.64627
1.64603
1.64564
1.64543
1.64588
1.64613
1.64628
1.64638
1.6461
1.64605
1.64593
1.64567
1.64519
1.64494
1.64546
1.64574
1.6459
1.64601
1.64571
1.64566
1.64553
1.64526
1.64475
1.64462
1.64509
1.64534
1.6455
1.64562
1.64531
1.64525
1.64511
1.64483
1.64429
1.64401
1.64459
1.64489
1.64507
1.6452
1.64488
1.64481
1.64467
1.64439
1.64386
1.64362
1.64418
1.64447
1.64465
1.64478
1.64441
1.64432
1.64417
1.64389
1.64336
1.64312
1.64362
1.64389
1.64401
1.64406
1.64401
1.64389
1.64371
1.6434
1.64288
1.6427
1.64322
1.64352
1.64368
1.64374
1.64367
1.64354
1.64335
1.64304
1.64249
1.64226
1.64283
1.64313
1.64329
1.64337
1.64326
1.64312
1.64293
1.64261
1.64203
1.64182
1.6424
1.6427
1.64286
1.64294
1.64282
1.64268
1.64249
1.64217
1.64156
1.64134
1.64193
1.64224
1.6424
1.64249
1.64236
1.64221
1.642
1.64166
1.64102
1.64075
1.64135
1.64167
1.64185
1.64196
1.64159
1.64153
1.64138
1.64107
1.64049
1.6403
1.64085
1.64119
1.6414
1.64153
1.64125
1.64118
1.641
1.64067
1.64014
1.63977
1.64042
1.64079
1.641
1.64115
1.64083
1.64074
1.64054
1.64018
1.6395
1.63929
1.63997
1.64033
1.64055
1.64071
1.64038
1.64029
1.6401
1.63975
1.63908
1.63894
1.63955
1.63989
1.6401
1.64026
1.63991
1.63981
1.63961
1.63926
1.63858
1.63821
1.63896
1.63935
1.63959
1.63976
1.63935
1.63921
1.639
1.63863
1.63794
1.63771
1.63835
1.6387
1.63887
1.63895
1.63888
1.63873
1.6385
1.63813
1.63748
1.63725
1.63792
1.6383
1.6385
1.63859
1.63849
1.63833
1.6381
1.63772
1.63711
1.63668
1.63742
1.63783
1.63804
1.63815
1.63801
1.63782
1.63757
1.63715
1.63639
1.63616
1.6369
1.6373
1.63752
1.63765
1.63749
1.6373
1.63705
1.63665
1.63589
1.63561
1.63636
1.63675
1.63698
1.63711
1.63694
1.63675
1.63647
1.63603
1.63524
1.63485
1.63564
1.63607
1.63632
1.6365
1.63605
1.63594
1.63572
1.63531
1.63459
1.63424
1.63503
1.63548
1.63577
1.63596
1.63565
1.63554
1.6353
1.63488
1.63419
1.63395
1.63468
1.63511
1.63537
1.63556
1.63521
1.63508
1.63484
1.63441
1.63363
1.63329
1.63411
1.63457
1.63485
1.63506
1.63468
1.63453
1.63428
1.63383
1.63301
1.6327
1.63355
1.63401
1.63429
1.6345
1.6341
1.63395
1.63369
1.63325
1.63243
1.63199
1.63289
1.63339
1.63369
1.6339
1.63344
1.63324
1.63295
1.63245
1.63153
1.63139
1.63216
1.6326
1.63284
1.63296
1.63285
1.63266
1.63236
1.63189
1.63109
1.6308
1.63162
1.6321
1.63238
1.63252
1.63237
1.63215
1.63183
1.63131
1.63045
1.62998
1.63098
1.63152
1.63182
1.63199
1.63181
1.63158
1.63127
1.63077
1.6299
1.62959
1.63049
1.63098
1.63126
1.63143
1.63123
1.63099
1.63067
1.63014
1.62912
1.62894
1.62985
1.63035
1.63064
1.63082
1.63061
1.63038
1.63005
1.6295
1.62847
1.62818
1.62909
1.62961
1.62991
1.63012
1.6296
1.62946
1.62919
1.62867
1.62779
1.62758
1.62841
1.62893
1.62926
1.62947
1.62911
1.62897
1.62866
1.62812
1.62727
1.62675
1.62778
1.62837
1.62871
1.62894
1.62854
1.62836
1.62804
1.62748
1.62654
1.62607
1.62713
1.62772
1.62807
1.62832
1.6279
1.6277
1.62736
1.62679
1.62581
1.6253
1.62642
1.62703
1.62739
1.62766
1.62723
1.627
1.62665
1.62605
1.62493
1.62455
1.6257
1.62633
1.62671
1.62699
1.62649
1.62623
1.62588
1.62528
1.6242
1.62393
1.62491
1.62547
1.62578
1.62595
1.62581
1.62557
1.6252
1.6246
1.62357
1.62332
1.62433
1.62494
1.62528
1.62546
1.62529
1.62503
1.62466
1.62403
1.62299
1.62262
1.62372
1.62434
1.62469
1.62489
1.62466
1.62439
1.62401
1.62338
1.62229
1.6219
1.62302
1.62364
1.62399
1.62422
1.62394
1.62366
1.62328
1.62264
1.62152
1.62103
1.62222
1.62286
1.62323
1.62347
1.62318
1.62288
1.62245
1.62174
1.62048
1.62006
1.62126
1.62192
1.62232
1.62262
1.62201
1.62181
1.62145
1.62079
1.61959
1.61932
1.62045
1.62112
1.62155
1.62183
1.62144
1.62122
1.62082
1.62011
1.61892
1.61859
1.61982
1.62052
1.62095
1.62124
1.62082
1.62058
1.62018
1.61952
1.61843
1.61783
1.61913
1.61984
1.62026
1.62056
1.62008
1.61981
1.61941
1.61869
1.6174
1.61698
1.61831
1.61904
1.61948
1.61979
1.61922
1.61893
1.61852
1.61781
1.61653
1.61608
1.61729
1.618
1.61838
1.61858
1.61837
1.61809
1.61765
1.61691
1.61571
1.61538
1.61658
1.61731
1.61773
1.61795
1.61769
1.61739
1.61695
1.61618
1.61491
1.61448
1.61575
1.61651
1.61694
1.61722
1.61687
1.61653
1.61607
1.61528
1.61389
1.61342
1.61476
1.61555
1.616
1.61634
1.61595
1.61558
1.61507
1.61422
1.61273
1.61191
1.61349
1.61439
1.61492
1.61531
1.61461
1.61432
1.61384
1.613
1.6116
1.61136
1.61274
1.61354
1.61407
1.61441
1.61402
1.61376
1.61328
1.61249
1.61114
1.61075
1.61218
1.61299
1.61348
1.61381
1.61336
1.61308
1.61261
1.61182
1.61041
1.60994
1.61141
1.61224
1.61273
1.61307
1.61254
1.61224
1.61179
1.61098
1.60955
1.60896
1.61049
1.61135
1.61186
1.6122
1.61154
1.61119
1.61071
1.60987
1.60835
1.60776
1.60923
1.61007
1.61053
1.61077
1.61046
1.61013
1.6096
1.60871
1.60727
1.60677
1.60823
1.60915
1.60967
1.60998
1.60961
1.60923
1.60867
1.6077
1.60613
1.60538
1.60709
1.6081
1.60868
1.60908
1.60867
1.60822
1.60761
1.60658
1.60473
1.60445
1.60618
1.60713
1.60771
1.60813
1.60777
1.60735
1.60674
1.6058
1.60404
1.6035
1.60521
1.60616
1.60674
1.60716
1.60642
1.60613
1.60562
1.60474
1.60321
1.60282
1.60435
1.60525
1.60581
1.60615
1.60569
1.60539
1.60484
1.60389
1.60234
1.60162
1.60342
1.60442
1.60499
1.60537
1.60483
1.60448
1.60394
1.60298
1.60141
1.60077
1.60248
1.60346
1.60402
1.60442
1.60379
1.6034
1.60284
1.60182
1.60009
1.59943
1.60121
1.60226
1.60287
1.6033
1.60255
1.6021
1.60149
1.60042
1.59841
1.59785
1.5997
1.60073
1.60131
1.60165
1.60126
1.60085
1.60021
1.59914
1.59731
1.59685
1.59863
1.59971
1.60034
1.60073
1.60032
1.59987
1.59919
1.59803
1.59592
1.59568
1.59757
1.59864
1.59929
1.59974
1.59929
1.59882
1.59812
1.59698
1.59487
1.59431
1.5963
1.59742
1.5981
1.59859
1.59773
1.59738
1.59676
1.59567
1.59382
1.59342
1.59524
1.59633
1.59698
1.59739
1.59687
1.5965
1.59587
1.59476
1.59288
1.59239
1.59427
1.5954
1.59605
1.59647
1.59584
1.59541
1.59477
1.59363
1.5917
1.59083
1.59289
1.59412
1.59483
1.5953
1.5945
1.59399
1.59329
1.59209
1.59006
1.58927
1.59127
1.59245
1.5931
1.59348
1.593
1.59255
1.59185
1.59067
1.58869
1.58775
1.5899
1.59118
1.59191
1.5924
1.59185
1.5913
1.5905
1.58913
1.58673
1.58603
1.58846
1.58981
1.59061
1.59119
1.59065
1.59007
1.58925
1.58792
1.58543
1.58501
1.58726
1.58853
1.58933
1.58992
1.58896
1.58855
1.58785
1.58666
1.58448
1.58402
1.58615
1.58737
1.58811
1.58857
1.588
1.58759
1.58687
1.58563
1.58344
1.58292
1.58509
1.58635
1.58707
1.58754
1.58683
1.58636
1.58565
1.58437
1.58214
1.58149
1.58362
1.58494
1.58569
1.58619
1.58528
1.58472
1.58394
1.58257
1.58018
1.57924
1.58151
1.58288
1.58363
1.58406
1.58341
1.58291
1.58212
1.58075
1.57841
1.57744
1.57981
1.58127
1.5821
1.58268
1.58196
1.58135
1.58041
1.57883
1.57613
1.57461
1.57761
1.5793
1.58033
1.58108
1.57994
1.57935
1.5784
1.57686
1.57418
1.57389
1.57652
1.57796
1.57889
1.57949
1.57894
1.57842
1.57758
1.57622
1.57387
1.57346
1.5758
1.57716
1.57798
1.57851
1.57781
1.57727
1.57647
1.57504
1.57254
1.57181
1.57428
1.57573
1.57658
1.57712
1.57619
1.57558
1.57471
1.57323
1.57066
1.56964
1.57216
1.57362
1.57441
1.57486
1.57411
1.57357
1.57269
1.57109
1.56841
1.56741
1.57009
1.57174
1.57265
1.57327
1.57241
1.57176
1.57078
1.56907
1.56622
1.56456
1.56777
1.56954
1.57062
1.57141
1.57001
1.56938
1.56836
1.56669
1.56371
1.56284
1.56581
1.56753
1.56858
1.56926
1.56852
1.56778
1.56669
1.5649
1.56143
1.56111
1.56426
1.566
1.5671
1.56782
1.567
1.56623
1.56515
1.5635
1.56058
1.5597
1.56266
1.56426
1.56521
1.56575
1.56512
1.56455
1.56361
1.56203
1.55928
1.55844
1.56127
1.56285
1.56376
1.56433
1.56351
1.56292
1.56196
1.56027
1.55747
1.55564
1.55885
1.56066
1.56173
1.56246
1.56088
1.56031
1.55933
1.5576
1.55457
1.55335
1.55649
1.55828
1.5593
1.55994
1.55899
1.5582
1.55711
1.55526
1.55224
1.55036
1.55387
1.55588
1.55709
1.55788
1.55675
1.55572
1.55429
1.5521
1.54769
1.54701
1.55093
1.55296
1.5543
1.55515
1.55436
1.55355
1.5523
1.55045
1.54695
1.54658
1.54997
1.55172
1.55285
1.55362
1.55283
1.55215
1.55103
1.54924
1.54593
1.54468
1.54805
1.5499
1.55107
1.55187
1.55028
1.54969
1.54865
1.54687
1.54355
1.54216
1.54563
1.54755
1.54862
1.54925
1.54822
1.54744
1.54633
1.54445
1.54119
1.53918
1.54276
1.5449
1.54613
1.54689
1.54559
1.54455
1.54307
1.54074
1.53619
1.53504
1.53922
1.54137
1.54275
1.54362
1.54238
1.54151
1.54009
1.53797
1.53354
1.53297
1.53675
1.53888
1.54032
1.54132
1.53969
1.53889
1.53757
1.53546
1.53178
1.52995
1.53411
1.5364
1.5378
1.53864
1.53769
1.53672
1.53532
1.53309
1.52879
1.52868
1.53231
1.53441
1.53575
1.53656
1.53548
1.53455
1.5332
1.53123
1.52758
1.52603
1.52963
1.53162
1.53281
1.5335
1.53198
1.53127
1.53004
1.52791
1.52398
1.52192
1.52582
1.5281
1.52953
1.53055
1.52826
1.52728
1.52583
1.52342
1.5188
1.51483
1.52063
1.52351
1.52528
1.52644
1.52507
1.52355
1.52149
1.51866
1.51267
1.51298
1.51783
1.52016
1.52197
1.52318
1.52206
1.52106
1.51947
1.51727
1.5129
1.51218
1.51648
1.51865
1.52013
1.52121
1.5199
1.519
1.51754
1.5153
1.51092
1.50884
1.51353
1.51586
1.51753
1.51868
1.51635
1.51541
1.51388
1.51165
1.50691
1.50501
1.50974
1.51214
1.51363
1.51455
1.51308
1.51182
1.51013
1.50768
1.50341
1.50002
1.5051
1.50772
1.50939
1.51054
1.50841
1.50712
1.50518
1.50206
1.49536
1.49338
1.50014
1.50288
1.50525
1.50691
1.50464
1.50331
1.50127
1.49886
1.49347
1.49293
1.49791
1.5002
1.50192
1.50299
1.50181
1.50053
1.49859
1.49636
1.49153
1.48869
1.494
1.49649
1.49822
1.49933
1.49706
1.49588
1.49404
1.49107
1.48464
1.48309
1.48863
1.49154
1.49369
1.49541
1.49264
1.49106
1.48898
1.48615
1.48064
1.47628
1.483
1.48627
1.48846
1.49006
1.48841
1.48621
1.48352
1.48001
1.47178
1.47181
1.4786
1.48146
1.48393
1.48584
1.4838
1.48225
1.48014
1.47766
1.47137
1.47029
1.47643
1.47844
1.4809
1.4826
1.47996
1.47857
1.47642
1.47385
1.46745
1.46566
1.47168
1.47405
1.47599
1.47736
1.47496
1.47368
1.47184
1.46944
1.46358
1.46182
1.46684
1.46935
1.47147
1.47335
1.47017
1.46824
1.4659
1.46296
1.45632
1.44847
1.45788
1.46175
1.46448
1.4667
1.46442
1.46138
1.45782
1.4542
1.4437
1.44384
1.4521
1.45513
1.45846
1.46098
1.45831
1.45608
1.45305
1.451
1.44372
1.44245
1.44903
1.45144
1.45398
1.45599
1.45457
1.45195
1.44891
1.44589
1.4368
1.43531
1.44325
1.44586
1.44905
1.45138
1.44849
1.44622
1.44309
1.44071
1.4332
1.42852
1.43745
1.44038
1.44328
1.44571
1.44412
1.44093
1.43739
1.43457
1.42534
1.41984
1.43106
1.43394
1.4378
1.4407
1.43767
1.43491
1.43109
1.42889
1.41974
1.41968
1.42718
1.42938
1.43239
1.43509
1.43353
1.4303
1.42704
1.4248
1.41727
1.40906
1.41867
1.42226
1.42603
1.42915
1.42446
1.42058
1.41564
1.41092
1.39492
1.3949
1.40866
1.41083
1.41677
1.42092
1.41883
1.41465
1.41009
1.40784
1.39842
1.39844
1.40658
1.40936
1.41383
1.41814
1.41513
1.41091
1.40604
1.4034
1.38935
1.38246
1.39751
1.40168
1.40731
1.41205
1.41028
1.40554
1.40006
1.39668
1.38229
1.38413
1.397
1.3995
1.40494
1.40961
1.4096
1.40538
1.40081
1.39898
1.38829
1.3922
1.402
1.40438
1.40799
1.41135
1.41498
1.41185
1.40827
1.40564
1.39576
1.40254
1.4104
1.4127
1.41587
1.41858
1.42232
1.42003
1.41742
1.41517
1.40953
1.41515
1.41956
1.42186
1.42419
1.42615
1.42986
1.42811
1.42604
1.42384
1.42052
1.42546
1.42791
1.42996
1.43194
1.43352
1.43681
1.43523
1.43346
1.43161
1.42972
1.43353
1.43497
1.43658
1.43839
1.43978
1.44243
1.4408
1.4393
1.43814
1.43694
1.43955
1.44066
1.44174
1.44322
1.44439
1.44654
1.44466
1.44357
1.44312
1.44195
1.44409
1.44574
1.44635
1.44657
1.44715
1.44987
1.44971
1.449
1.44808
1.44613
1.44823
1.45052
1.45213
1.45319
1.45306
1.45614
1.45645
1.45578
1.45361
1.45042
1.45067
1.4539
1.45692
1.45801
1.45803
1.45942
1.45908
1.45755
1.45398
1.45112
1.45212
1.45447
1.45826
1.4602
1.46083
1.46223
1.46129
1.45899
1.45526
1.4534
1.45481
1.45624
1.45968
1.46228
1.46353
1.46473
1.46318
1.46037
1.45739
1.45631
1.45786
1.45867
1.46111
1.464
1.46584
1.46687
1.46479
1.46197
1.46005
1.45946
1.46105
1.46146
1.46293
1.46558
1.46784
1.46875
1.46639
1.46401
1.46291
1.46263
1.46417
1.46435
1.46517
1.46722
1.46962
1.47046
1.46812
1.46639
1.46578
1.46566
1.4671
1.46717
1.46764
1.46907
1.47129
1.47214
1.47007
1.4689
1.46854
1.46851
1.46985
1.46987
1.47015
1.47111
1.47301
1.47391
1.47219
1.47138
1.47117
1.47116
1.47242
1.47242
1.4726
1.47329
1.47483
1.47578
1.47439
1.4738
1.47365
1.47365
1.47485
1.47484
1.47498
1.4755
1.47675
1.47773
1.4766
1.47613
1.47601
1.476
1.47713
1.47714
1.47726
1.47768
1.4787
1.47967
1.47875
1.47836
1.47825
1.47823
1.47929
1.47931
1.47943
1.47979
1.48062
1.48155
1.48081
1.48048
1.48036
1.48033
1.48134
1.48138
1.48149
1.48179
1.48246
1.48334
1.48274
1.48247
1.48236
1.48231
1.48325
1.4833
1.48341
1.48366
1.48419
1.48502
1.48454
1.48431
1.48421
1.48416
1.48504
1.48509
1.48519
1.48539
1.48581
1.48657
1.4862
1.48602
1.48593
1.48588
1.48668
1.48673
1.48682
1.48698
1.48731
1.48802
1.48773
1.48758
1.4875
1.48745
1.4882
1.48824
1.48831
1.48844
1.4887
1.48936
1.48913
1.48901
1.48895
1.4889
1.48958
1.48962
1.48968
1.48978
1.48999
1.4906
1.49041
1.49032
1.49027
1.49023
1.49085
1.49088
1.49093
1.49102
1.49119
1.49176
1.4916
1.49152
1.49148
1.49144
1.49201
1.49204
1.49209
1.49216
1.4923
1.49283
1.4927
1.49263
1.49259
1.49256
1.49308
1.49311
1.49315
1.49322
1.49334
1.49384
1.49372
1.49365
1.49362
1.49359
1.49407
1.4941
1.49414
1.4942
1.49432
1.49478
1.49466
1.4946
1.49457
1.49454
1.49499
1.49502
1.49505
1.49512
1.49523
1.49567
1.49555
1.49549
1.49545
1.49542
1.49584
1.49587
1.49591
1.49597
1.49609
1.4965
1.49638
1.49632
1.49628
1.49625
1.49664
1.49667
1.49671
1.49678
1.49689
1.49728
1.49716
1.49709
1.49705
1.49702
1.49738
1.49742
1.49747
1.49754
1.49765
1.49802
1.4979
1.49783
1.49778
1.49774
1.49808
1.49812
1.49818
1.49825
1.49837
1.49871
1.49859
1.49851
1.49846
1.49842
1.49874
1.49879
1.49884
1.49892
1.49905
1.49937
1.49925
1.49916
1.4991
1.49906
1.49937
1.49941
1.49947
1.49956
1.49969
1.49999
1.49986
1.49978
1.49971
1.49966
1.49995
1.5
1.50007
1.50016
1.50029
1.50058
1.50045
1.50035
1.50028
1.50023
1.50051
1.50056
1.50063
1.50073
1.50086
1.50114
1.501
1.5009
1.50083
1.50077
1.50103
1.50109
1.50116
1.50126
1.5014
1.50166
1.50152
1.50142
1.50134
1.50128
1.50152
1.50159
1.50167
1.50177
1.50191
1.50216
1.50201
1.50191
1.50182
1.50176
1.50199
1.50206
1.50214
1.50225
1.50239
1.50262
1.50248
1.50237
1.50228
1.50222
1.50243
1.5025
1.50259
1.5027
1.50285
1.50307
1.50292
1.5028
1.50271
1.50264
1.50285
1.50292
1.50301
1.50313
1.50328
1.50348
1.50333
1.50322
1.50312
1.50305
1.50324
1.50332
1.50341
1.50353
1.50368
1.50388
1.50372
1.5036
1.50351
1.50343
1.50362
1.50369
1.50379
1.50391
1.50406
1.50425
1.50409
1.50397
1.50387
1.50379
1.50397
1.50404
1.50415
1.50427
1.50442
1.5046
1.50444
1.50432
1.50421
1.50414
1.5043
1.50438
1.50448
1.50461
1.50476
1.50493
1.50477
1.50464
1.50454
1.50446
1.50461
1.50469
1.5048
1.50493
1.50508
1.50524
1.50508
1.50495
1.50484
1.50476
1.50491
1.50499
1.5051
1.50523
1.50539
1.50553
1.50537
1.50524
1.50513
1.50505
1.50519
1.50527
1.50538
1.50551
1.50567
1.50581
1.50565
1.50552
1.50541
1.50532
1.50545
1.50554
1.50565
1.50578
1.50594
1.50607
1.50591
1.50577
1.50566
1.50558
1.5057
1.50579
1.5059
1.50603
1.50619
1.50631
1.50615
1.50602
1.50591
1.50582
1.50594
1.50602
1.50614
1.50627
1.50643
1.50654
1.50638
1.50625
1.50614
1.50605
1.50616
1.50625
1.50636
1.50649
1.50665
1.50676
1.5066
1.50647
1.50635
1.50627
1.50637
1.50646
1.50657
1.5067
1.50686
1.50696
1.5068
1.50667
1.50656
1.50647
1.50657
1.50666
1.50677
1.5069
1.50706
1.50716
1.507
1.50687
1.50675
1.50667
1.50676
1.50685
1.50696
1.50709
1.50725
1.50734
1.50718
1.50705
1.50693
1.50685
1.50694
1.50702
1.50713
1.50727
1.50742
1.50751
1.50735
1.50722
1.50711
1.50702
1.50711
1.50719
1.5073
1.50743
1.50759
1.50767
1.50751
1.50738
1.50727
1.50718
1.50726
1.50734
1.50746
1.50759
1.50774
1.50782
1.50766
1.50753
1.50742
1.50734
1.50741
1.50749
1.5076
1.50773
1.50789
1.50796
1.5078
1.50767
1.50756
1.50748
1.50755
1.50763
1.50774
1.50787
1.50803
1.50809
1.50794
1.50781
1.5077
1.50762
1.50769
1.50776
1.50787
1.508
1.50816
1.50822
1.50806
1.50794
1.50783
1.50775
1.50781
1.50789
1.508
1.50813
1.50828
1.50834
1.50819
1.50806
1.50795
1.50788
1.50794
1.50801
1.50812
1.50825
1.5084
1.50846
1.50831
1.50818
1.50807
1.508
1.50806
1.50813
1.50824
1.50836
1.50851
1.50857
1.50842
1.50829
1.50819
1.50811
1.50817
1.50825
1.50835
1.50848
1.50862
1.50868
1.50853
1.5084
1.5083
1.50823
1.50828
1.50836
1.50846
1.50858
1.50873
1.50878
1.50863
1.50851
1.50841
1.50834
1.50839
1.50846
1.50856
1.50869
1.50883
1.50888
1.50874
1.50861
1.50851
1.50844
1.50849
1.50856
1.50866
1.50879
1.50893
1.50898
1.50883
1.50871
1.50861
1.50854
1.50859
1.50866
1.50876
1.50888
1.50902
1.50907
1.50893
1.50881
1.50871
1.50864
1.50869
1.50876
1.50885
1.50897
1.50912
1.50916
1.50902
1.5089
1.5088
1.50873
1.50878
1.50885
1.50895
1.50906
1.50921
1.50925
1.50911
1.50899
1.50889
1.50883
1.50887
1.50894
1.50904
1.50915
1.50929
1.50933
1.50919
1.50908
1.50898
1.50892
1.50896
1.50903
1.50912
1.50924
1.50938
1.50942
1.50928
1.50916
1.50907
1.50901
1.50905
1.50912
1.50921
1.50932
1.50946
1.5095
1.50936
1.50925
1.50916
1.50909
1.50914
1.5092
1.50929
1.50941
1.50954
1.50958
1.50945
1.50933
1.50924
1.50918
1.50922
1.50929
1.50938
1.50949
1.50963
1.50966
1.50953
1.50942
1.50933
1.50927
1.50931
1.50937
1.50946
1.50957
1.50971
1.50975
1.50961
1.5095
1.50941
1.50935
1.5094
1.50946
1.50955
1.50966
1.50979
1.50983
1.50969
1.50958
1.5095
1.50944
1.50948
1.50954
1.50963
1.50974
1.50987
1.50991
1.50978
1.50967
1.50958
1.50952
1.50957
1.50963
1.50971
1.50982
1.50995
1.50999
1.50986
1.50975
1.50967
1.50961
1.50965
1.50971
1.5098
1.50991
1.51004
1.51008
1.50995
1.50984
1.50975
1.5097
1.50974
1.5098
1.50988
1.50999
1.51012
1.51016
1.51003
1.50993
1.50984
1.50978
1.50983
1.50989
1.50997
1.51008
1.51021
1.51025
1.51012
1.51001
1.50993
1.50987
1.50992
1.50998
1.51006
1.51017
1.51029
1.51034
1.51021
1.51011
1.51002
1.50997
1.51001
1.51007
1.51015
1.51026
1.51038
1.51043
1.5103
1.5102
1.51011
1.51006
1.51011
1.51016
1.51025
1.51035
1.51047
1.51052
1.5104
1.51029
1.51021
1.51016
1.51021
1.51026
1.51034
1.51045
1.51057
1.51062
1.51049
1.51039
1.51031
1.51026
1.51031
1.51036
1.51044
1.51055
1.51067
1.51072
1.5106
1.51049
1.51041
1.51036
1.51042
1.51047
1.51055
1.51065
1.51077
1.51082
1.5107
1.5106
1.51052
1.51047
1.51052
1.51058
1.51066
1.51076
1.51088
1.51093
1.51081
1.51071
1.51063
1.51058
1.51064
1.51069
1.51077
1.51087
1.51099
1.51105
1.51093
1.51083
1.51075
1.5107
1.51076
1.51081
1.51089
1.51099
1.51111
1.51117
1.51104
1.51094
1.51087
1.51082
1.51088
1.51093
1.51101
1.51111
1.51123
1.51129
1.51117
1.51107
1.51099
1.51094
1.51101
1.51106
1.51113
1.51123
1.51135
1.51142
1.5113
1.5112
1.51112
1.51107
1.51114
1.51119
1.51127
1.51136
1.51149
1.51155
1.51143
1.51133
1.51126
1.51121
1.51128
1.51133
1.5114
1.5115
1.51162
1.51169
1.51157
1.51147
1.5114
1.51135
1.51142
1.51147
1.51155
1.51165
1.51177
1.51184
1.51172
1.51162
1.51155
1.5115
1.51157
1.51162
1.5117
1.5118
1.51192
1.51199
1.51187
1.51178
1.5117
1.51165
1.51173
1.51178
1.51185
1.51195
1.51207
1.51215
1.51203
1.51193
1.51186
1.51181
1.51189
1.51194
1.51202
1.51211
1.51223
1.51232
1.5122
1.5121
1.51203
1.51198
1.51206
1.51211
1.51219
1.51228
1.5124
1.51249
1.51237
1.51227
1.5122
1.51215
1.51224
1.51229
1.51236
1.51246
1.51258
1.51267
1.51255
1.51245
1.51238
1.51233
1.51242
1.51247
1.51254
1.51264
1.51276
1.51285
1.51273
1.51263
1.51256
1.51252
1.51261
1.51266
1.51273
1.51282
1.51294
1.51304
1.51292
1.51282
1.51275
1.51271
1.51281
1.51285
1.51292
1.51302
1.51314
1.51324
1.51312
1.51302
1.51295
1.5129
1.51301
1.51305
1.51312
1.51322
1.51334
1.51344
1.51332
1.51322
1.51315
1.51311
1.51321
1.51326
1.51333
1.51342
1.51354
1.51365
1.51353
1.51343
1.51336
1.51331
1.51342
1.51347
1.51354
1.51364
1.51376
1.51386
1.51374
1.51365
1.51358
1.51353
1.51364
1.51369
1.51376
1.51385
1.51397
1.51408
1.51396
1.51387
1.5138
1.51375
1.51386
1.51391
1.51398
1.51408
1.51419
1.5143
1.51418
1.51409
1.51402
1.51397
1.51409
1.51414
1.51421
1.5143
1.51442
1.51453
1.51441
1.51432
1.51425
1.5142
1.51432
1.51437
1.51444
1.51453
1.51465
1.51477
1.51465
1.51456
1.51448
1.51444
1.51456
1.5146
1.51468
1.51477
1.51489
1.51501
1.51489
1.51479
1.51472
1.51468
1.5148
1.51485
1.51492
1.51501
1.51513
1.51525
1.51513
1.51504
1.51497
1.51492
1.51505
1.51509
1.51516
1.51526
1.51538
1.5155
1.51538
1.51529
1.51522
1.51517
1.5153
1.51534
1.51541
1.51551
1.51562
1.51575
1.51563
1.51554
1.51547
1.51542
1.51555
1.5156
1.51567
1.51576
1.51588
1.516
1.51589
1.51579
1.51572
1.51568
1.5158
1.51585
1.51592
1.51601
1.51613
1.51626
1.51614
1.51605
1.51598
1.51593
1.51606
1.51611
1.51618
1.51627
1.51639
1.51652
1.5164
1.51631
1.51624
1.51619
1.51632
1.51637
1.51644
1.51653
1.51665
1.51678
1.51666
1.51657
1.5165
1.51645
1.51658
1.51663
1.5167
1.51679
1.51691
1.51703
1.51692
1.51683
1.51675
1.51671
1.51684
1.51689
1.51696
1.51705
1.51717
1.51729
1.51718
1.51708
1.51701
1.51697
1.5171
1.51715
1.51722
1.51731
1.51742
1.51755
1.51744
1.51734
1.51727
1.51723
1.51736
1.5174
1.51747
1.51757
1.51768
1.51781
1.51769
1.5176
1.51753
1.51748
1.51761
1.51766
1.51773
1.51782
1.51794
1.51807
1.51795
1.51786
1.51779
1.51774
1.51787
1.51792
1.51799
1.51808
1.5182
1.51832
1.51821
1.51812
1.51805
1.518
1.51813
1.51818
1.51825
1.51834
1.51845
1.51858
1.51847
1.51838
1.51831
1.51826
1.51839
1.51844
1.51851
1.5186
1.51871
1.51884
1.51872
1.51863
1.51856
1.51852
1.51865
1.51869
1.51876
1.51885
1.51897
1.51909
1.51898
1.51889
1.51882
1.51877
1.5189
1.51895
1.51902
1.51911
1.51922
1.51935
1.51924
1.51915
1.51908
1.51903
1.51916
1.51921
1.51928
1.51937
1.51948
1.51961
1.51949
1.51941
1.51934
1.51929
1.51942
1.51947
1.51954
1.51962
1.51973
1.51986
1.51975
1.51966
1.51959
1.51954
1.51967
1.51972
1.51979
1.51988
1.51999
1.52011
1.52
1.51992
1.51985
1.5198
1.51993
1.51998
1.52005
1.52013
1.52024
1.52037
1.52026
1.52017
1.52011
1.52005
1.52018
1.52023
1.5203
1.52039
1.5205
1.52062
1.52051
1.52043
1.52036
1.52031
1.52044
1.52049
1.52056
1.52064
1.52075
1.52087
1.52077
1.52068
1.52061
1.52056
1.52069
1.52074
1.52081
1.5209
1.521
1.52113
1.52102
1.52094
1.52087
1.52082
1.52095
1.521
1.52107
1.52115
1.52125
1.52138
1.52127
1.52119
1.52112
1.52107
1.5212
1.52125
1.52132
1.5214
1.52151
1.52163
1.52153
1.52144
1.52138
1.52133
1.52145
1.5215
1.52157
1.52165
1.52176
1.52188
1.52178
1.5217
1.52163
1.52158
1.52171
1.52176
1.52182
1.52191
1.52201
1.52213
1.52203
1.52195
1.52188
1.52183
1.52196
1.52201
1.52208
1.52216
1.52226
1.52238
1.52228
1.5222
1.52214
1.52208
1.52221
1.52226
1.52233
1.52241
1.52251
1.52264
1.52254
1.52246
1.52239
1.52234
1.52247
1.52252
1.52258
1.52266
1.52277
1.52289
1.52279
1.52271
1.52264
1.52259
1.52272
1.52277
1.52284
1.52292
1.52302
1.52314
1.52304
1.52296
1.5229
1.52285
1.52298
1.52303
1.52309
1.52317
1.52327
1.5234
1.5233
1.52322
1.52315
1.5231
1.52323
1.52328
1.52335
1.52343
1.52353
1.52365
1.52355
1.52348
1.52341
1.52336
1.52349
1.52354
1.52361
1.52368
1.52378
1.52391
1.52381
1.52373
1.52367
1.52361
1.52375
1.5238
1.52386
1.52394
1.52404
1.52417
1.52407
1.52399
1.52393
1.52387
1.524
1.52406
1.52412
1.5242
1.5243
1.52442
1.52433
1.52425
1.52419
1.52413
1.52427
1.52432
1.52438
1.52446
1.52456
1.52469
1.52459
1.52451
1.52445
1.52439
1.52453
1.52458
1.52465
1.52473
1.52482
1.52495
1.52486
1.52478
1.52471
1.52466
1.52479
1.52485
1.52491
1.52499
1.52508
1.52522
1.52512
1.52505
1.52498
1.52493
1.52506
1.52512
1.52518
1.52526
1.52535
1.52549
1.52539
1.52532
1.52525
1.52519
1.52533
1.52539
1.52545
1.52553
1.52562
1.52576
1.52567
1.52559
1.52552
1.52547
1.52561
1.52566
1.52573
1.52581
1.5259
1.52604
1.52594
1.52587
1.5258
1.52574
1.52589
1.52594
1.52601
1.52608
1.52618
1.52632
1.52622
1.52615
1.52608
1.52603
1.52617
1.52622
1.52629
1.52637
1.52646
1.5266
1.52651
1.52643
1.52637
1.52631
1.52646
1.52651
1.52658
1.52666
1.52675
1.52689
1.5268
1.52672
1.52666
1.5266
1.52675
1.5268
1.52687
1.52695
1.52704
1.52718
1.52709
1.52702
1.52695
1.52689
1.52704
1.5271
1.52717
1.52724
1.52734
1.52748
1.52739
1.52732
1.52725
1.52719
1.52735
1.5274
1.52747
1.52755
1.52764
1.52779
1.5277
1.52762
1.52755
1.5275
1.52765
1.52771
1.52778
1.52785
1.52794
1.5281
1.52801
1.52793
1.52786
1.52781
1.52796
1.52802
1.52809
1.52817
1.52826
1.52841
1.52832
1.52825
1.52818
1.52812
1.52828
1.52834
1.52841
1.52848
1.52857
1.52873
1.52864
1.52857
1.5285
1.52844
1.52861
1.52866
1.52873
1.52881
1.5289
1.52906
1.52897
1.52889
1.52882
1.52877
1.52894
1.52899
1.52906
1.52914
1.52923
1.52939
1.5293
1.52923
1.52916
1.5291
1.52927
1.52933
1.5294
1.52947
1.52956
1.52973
1.52964
1.52956
1.5295
1.52944
1.52961
1.52967
1.52974
1.52982
1.52991
1.53008
1.52999
1.52991
1.52984
1.52978
1.52996
1.53002
1.53009
1.53016
1.53025
1.53043
1.53034
1.53026
1.53019
1.53014
1.53032
1.53037
1.53044
1.53052
1.53061
1.53079
1.5307
1.53062
1.53055
1.53049
1.53068
1.53073
1.5308
1.53088
1.53097
1.53115
1.53106
1.53098
1.53091
1.53086
1.53105
1.5311
1.53117
1.53125
1.53134
1.53152
1.53143
1.53135
1.53128
1.53123
1.53142
1.53148
1.53154
1.53162
1.53171
1.5319
1.53181
1.53173
1.53166
1.5316
1.5318
1.53186
1.53192
1.532
1.53209
1.53228
1.53219
1.53211
1.53204
1.53199
1.53218
1.53224
1.53231
1.53239
1.53248
1.53267
1.53258
1.5325
1.53243
1.53238
1.53257
1.53263
1.5327
1.53278
1.53287
1.53306
1.53297
1.53289
1.53283
1.53277
1.53297
1.53303
1.5331
1.53317
1.53327
1.53346
1.53337
1.53329
1.53323
1.53317
1.53337
1.53343
1.5335
1.53357
1.53367
1.53387
1.53378
1.5337
1.53363
1.53357
1.53378
1.53383
1.5339
1.53398
1.53407
1.53427
1.53418
1.53411
1.53404
1.53398
1.53419
1.53424
1.53431
1.53439
1.53448
1.53469
1.53459
1.53452
1.53445
1.53439
1.5346
1.53466
1.53472
1.5348
1.5349
1.5351
1.53501
1.53493
1.53486
1.5348
1.53501
1.53507
1.53514
1.53522
1.53531
1.53551
1.53542
1.53534
1.53527
1.53522
1.53542
1.53548
1.53555
1.53563
1.53573
1.53592
1.53583
1.53575
1.53568
1.53563
1.53584
1.5359
1.53597
1.53605
1.53614
1.53634
1.53624
1.53616
1.53609
1.53603
1.53624
1.5363
1.53637
1.53645
1.53655
1.53674
1.53665
1.53657
1.5365
1.53644
1.53663
1.53669
1.53677
1.53685
1.53694
1.53713
1.53704
1.53696
1.53689
1.53682
1.53701
1.53707
1.53715
1.53723
1.53733
1.53751
1.53742
1.53734
1.53726
1.5372
1.53736
1.53742
1.5375
1.53759
1.53769
1.53786
1.53776
1.53768
1.5376
1.53753
1.53766
1.53773
1.53781
1.5379
1.538
1.53815
1.53805
1.53796
1.53788
1.5378
1.53786
1.53794
1.53804
1.53813
1.53824
1.53837
1.53826
1.53815
1.53803
1.53792
1.53802
1.53803
1.53803
1.53806
1.53814
1.539
1.53878
1.53826
1.53733
1.53656
1.54207
1.54137
1.54073
1.54053
1.54069
1.54198
1.5423
1.54279
1.54374
1.5455
1.54562
1.5437
1.54283
1.54248
1.54234
1.54235
1.54236
1.54255
1.54321
1.54508
1.54459
1.54284
1.54232
1.54222
1.54224
1.54211
1.54213
1.54224
1.5427
1.54435
1.54416
1.54264
1.54224
1.54217
1.54219
1.54244
1.54235
1.54236
1.5427
1.54408
1.54417
1.54293
1.54267
1.5427
1.54283
1.54327
1.54315
1.54308
1.54327
1.5444
1.54466
1.5436
1.54346
1.54352
1.54361
1.54385
1.54378
1.54374
1.54385
1.54487
1.54502
1.54405
1.54395
1.544
1.54407
1.54427
1.54417
1.54412
1.54419
1.54512
1.54512
1.54423
1.54419
1.54428
1.54444
1.54453
1.54431
1.54418
1.54419
1.54511
1.54467
1.54399
1.54404
1.54422
1.54455
1.54445
1.54386
1.54339
1.54319
1.54394
1.54187
1.5415
1.54184
1.54254
1.5435
1.54099
1.53996
1.53967
1.53994
1.54108
1.55285
1.55453
1.55431
1.55486
1.55641
1.5586
1.56022
1.56116
1.56134
1.56109
1.56098
1.5611
1.56034
1.55928
1.55934
1.55965
1.5598
1.55984
1.55977
1.55976
1.5601
1.56077
1.56138
1.562
1.56259
1.56316
1.5637
1.56421
1.5647
1.56516
1.5656
1.56602
1.56641
1.56678
1.56713
1.56747
1.56778
1.56807
1.56834
1.5686
1.56883
1.56905
1.56925
1.56944
1.56961
1.56976
1.5699
1.57003
1.57014
1.57024
1.57033
1.5704
1.57047
1.57053
1.57058
1.57062
1.57065
1.57068
1.57071
1.57072
1.57074
1.57072
1.5707
1.57067
1.56973
1.56851
1.56698
1.5654
1.56378
1.56214
1.56051
1.55889
1.55729
1.5557
1.55414
1.55259
1.55108
1.54959
1.54813
1.54672
1.54535
1.54403
1.54277
1.54157
1.54043
1.53936
1.53836
1.53743
1.53659
1.53582
1.53513
1.53452
1.534
1.53355
1.53317
1.53285
1.53256
1.53241
1.53236
1.53235
1.53236
1.53238
1.53248
1.5326
1.53275
1.53293
1.53313
1.53335
1.53359
1.53385
1.53411
1.53439
1.53467
1.53496
1.53525
1.53555
1.53585
1.53615
1.53645
1.53676
1.53708
1.53741
1.53775
1.5381
1.53846
1.53885
1.53925
1.53968
1.54012
1.5406
1.54111
1.54164
1.54221
1.54281
1.54345
1.54413
1.54484
1.5456
1.54639
1.54723
1.54811
1.54904
1.55
1.55101
1.55207
1.55316
1.5543
1.55548
1.5567
1.55796
1.55925
1.56058
1.56195
1.56335
1.56478
1.56623
1.56771
1.56922
1.57074
1.57228
1.57384
1.5754
1.57698
1.57856
1.58014
1.58171
1.58329
1.58485
1.5864
1.58794
1.58945
1.59095
1.59242
1.59387
1.59528
1.59667
1.59802
1.59933
1.60061
1.60185
1.60306
1.60422
1.60535
1.60644
1.60749
1.60851
1.60948
1.61043
1.61134
1.61222
1.61307
1.61388
1.61467
1.61544
1.61617
1.61689
1.61758
1.61825
1.6189
1.61954
1.62016
1.62076
1.62135
1.62193
1.62249
1.62305
1.62359
1.62413
1.62466
1.62518
1.6257
1.62621
1.62672
1.62723
1.62773
1.62824
1.62874
1.62925
1.62976
1.63027
1.63078
1.6313
1.63182
1.63235
1.63289
1.63343
1.63398
1.63454
1.63511
1.63568
1.63626
1.63686
1.63746
1.63807
1.63869
1.63932
1.63996
1.6406
1.64126
1.64192
1.64259
1.64327
1.64395
1.64464
1.64534
1.64605
1.64676
1.64748
1.64821
1.64894
1.64968
1.65042
1.65117
1.65193
1.6527
1.65347
1.65425
1.65504
1.65583
1.65664
1.65745
1.65828
1.65911
1.65995
1.66081
1.66168
1.66255
1.66344
1.66435
1.66526
1.66619
1.66713
1.66809
1.66906
1.67004
1.67103
1.67203
1.67305
1.67408
1.67512
1.67616
1.67722
1.67829
1.67937
1.68045
1.68154
1.68263
1.68373
1.68483
1.68593
1.68703
1.68814
1.68924
1.69033
1.69143
1.69251
1.69359
1.69466
1.69572
1.69677
1.6978
1.69882
1.69983
1.70082
1.70179
1.70274
1.70367
1.70458
1.70547
1.70634
1.70718
1.708
1.7088
1.70957
1.71031
1.71103
1.71173
1.71239
1.71303
1.71364
1.71422
1.71478
1.71531
1.71581
1.71629
1.71675
1.71718
1.71758
1.71797
1.71833
1.71867
1.71899
1.7193
1.71959
1.71987
1.72013
1.72039
1.72063
1.72087
1.72109
1.72129
1.7213
1.7213
1.7213
1.72131
1.72131
1.72132
1.72133
1.72133
1.72134
1.72136
1.72137
1.72138
1.7214
1.72141
1.72143
1.72145
1.72147
1.72149
1.72151
1.72153
1.72156
1.72158
1.72161
1.72163
1.72166
1.72169
1.72172
1.72175
1.72178
1.72182
1.72185
1.72188
1.72192
1.72196
1.722
1.72204
1.72208
1.72212
1.72217
1.72221
1.72226
1.72231
1.72235
1.7224
1.72246
1.72251
1.72256
1.72262
1.72267
1.72273
1.72278
1.72284
1.7229
1.72296
1.72302
1.72309
1.72315
1.72321
1.72327
1.72334
1.7234
1.72347
1.72353
1.7236
1.72367
1.72373
1.7238
1.72387
1.72393
1.724
1.72406
1.72413
1.72419
1.72426
1.72432
1.72439
1.72445
1.72451
1.72457
1.72463
1.72469
1.72475
1.72481
1.72486
1.72492
1.72497
1.72502
1.72507
1.72511
1.72516
1.7252
1.72524
1.72528
1.72532
1.72535
1.72538
1.72541
1.72544
1.72546
1.72549
1.72551
1.72552
1.72554
1.72555
1.72557
1.72558
1.72558
1.72559
1.72559
1.7256
1.7256
1.7256
1.7256
1.72561
1.72561
1.72561
1.72561
1.72561
1.72562
1.72562
1.72564
1.72563
1.72587
1.72539
1.72694
1.72472
1.72485
1.72447
1.72359
1.72288
1.72224
1.72159
1.72095
1.72032
1.71971
1.71912
1.71856
1.71801
1.71746
1.71692
1.71638
1.71585
1.71533
1.71484
1.71437
1.71392
1.71348
1.71305
1.71263
1.7122
1.71177
1.71134
1.71091
1.71048
1.71006
1.70963
1.70921
1.7088
1.70838
1.70796
1.70755
1.70714
1.70673
1.70632
1.70591
1.7055
1.70509
1.70468
1.70427
1.70386
1.70346
1.70307
1.70268
1.70231
1.70194
1.70159
1.70124
1.70091
1.70058
1.70027
1.69996
1.69967
1.6994
1.69914
1.6989
1.69869
1.6985
1.69835
1.69824
1.6982
1.6982
1.6982
1.69823
1.69829
1.69841
1.69856
1.69873
1.69892
1.69915
1.69942
1.69972
1.70005
1.70039
1.70073
1.70107
1.70139
1.70173
1.70204
1.70217
1.70168
1.69991
1.69736
1.69491
1.69303
1.69195
1.6914
1.6911
1.69089
1.69074
1.6906
1.69046
1.69035
1.69024
1.69014
1.69008
1.69006
1.69011
1.69026
1.69047
1.69063
1.6906
1.69039
1.69003
1.68948
1.68878
1.68801
1.68727
1.68661
1.68604
1.68554
1.68512
1.68473
1.68436
1.68399
1.68362
1.68328
1.68296
1.68267
1.68239
1.6821
1.68181
1.68151
1.68122
1.68095
1.68072
1.68051
1.68035
1.68024
1.68019
1.68015
1.67992
1.67926
1.67934
1.6794
1.67991
1.6799
1.68012
1.68013
1.68022
1.68019
1.68026
1.68031
1.68045
1.68039
1.68056
1.68062
1.68069
1.68052
1.68038
1.68028
1.68017
1.67995
1.67946
1.67951
1.68001
1.68024
1.68031
1.68007
1.67956
1.67963
1.68015
1.6804
1.68055
1.68045
1.68035
1.68047
1.68061
1.68076
1.68083
1.68069
1.68056
1.68066
1.68078
1.6809
1.68104
1.68099
1.68093
1.68087
1.68081
1.68076
1.68098
1.68102
1.68125
1.68124
1.68151
1.68151
1.68178
1.6818
1.68209
1.68206
1.68236
1.68238
1.68268
1.68268
1.68268
1.68234
1.68204
1.68175
1.6815
1.68127
1.68107
1.68111
1.6813
1.6815
1.68152
1.68133
1.68115
1.6812
1.68137
1.68155
1.68179
1.68175
1.68174
1.68203
1.68234
1.68268
1.6827
1.68235
1.68204
1.68207
1.68238
1.68273
1.68277
1.68243
1.68212
1.68184
1.68161
1.68141
1.68124
1.68108
1.68096
1.68086
1.68076
1.68066
1.68051
1.68023
1.6797
1.67979
1.68033
1.68062
1.68074
1.68044
1.67988
1.67999
1.68055
1.68085
1.681
1.68089
1.68077
1.68087
1.68094
1.68101
1.68106
1.68102
1.68097
1.68107
1.68109
1.68111
1.68117
1.68116
1.68116
1.68111
1.68096
1.68067
1.68011
1.68024
1.68079
1.68107
1.68117
1.68091
1.68039
1.68056
1.68103
1.68126
1.68135
1.68128
1.6812
1.68124
1.68123
1.68124
1.68132
1.68131
1.68131
1.68138
1.68139
1.6814
1.68149
1.6814
1.68133
1.68127
1.68121
1.68116
1.68112
1.68128
1.68147
1.68167
1.68174
1.68153
1.68133
1.68139
1.6816
1.68182
1.68205
1.68198
1.68191
1.68219
1.68249
1.68282
1.68287
1.68255
1.68226
1.68233
1.68262
1.68293
1.68299
1.68269
1.6824
1.68213
1.68189
1.68166
1.68144
1.68151
1.68173
1.68196
1.68203
1.6818
1.68158
1.68165
1.68187
1.68211
1.68235
1.68228
1.6822
1.68247
1.68276
1.68304
1.68309
1.68282
1.68254
1.68261
1.68287
1.68314
1.6834
1.68337
1.68334
1.68331
1.68327
1.68323
1.68319
1.68316
1.68312
1.68309
1.68306
1.68304
1.68301
1.68299
1.68333
1.68337
1.68373
1.68368
1.68404
1.6841
1.68447
1.68442
1.68479
1.68485
1.68525
1.68519
1.68563
1.6857
1.68575
1.68529
1.68489
1.68453
1.68416
1.68378
1.68341
1.68345
1.68383
1.68421
1.68425
1.68387
1.68349
1.68352
1.68391
1.68428
1.68463
1.68461
1.68457
1.68493
1.68533
1.68579
1.68581
1.68535
1.68496
1.68497
1.68535
1.6858
1.68636
1.68636
1.68634
1.6863
1.68624
1.68615
1.68676
1.68687
1.68759
1.68746
1.68823
1.68838
1.68911
1.68901
1.68963
1.68966
1.69
1.69007
1.69032
1.69012
1.6899
1.68991
1.68965
1.68915
1.68847
1.68768
1.68695
1.687
1.68775
1.68852
1.68855
1.68778
1.68703
1.68703
1.68778
1.68854
1.68914
1.68916
1.68917
1.68961
1.68982
1.68972
1.6896
1.68973
1.68957
1.68953
1.68967
1.68952
1.68947
1.68962
1.68949
1.68911
1.68851
1.68775
1.687
1.68633
1.68578
1.68534
1.68497
1.68465
1.68431
1.68394
1.68356
1.68359
1.68396
1.68432
1.68432
1.68398
1.68361
1.68363
1.68398
1.68431
1.68462
1.68464
1.68465
1.68496
1.68532
1.68575
1.6857
1.68529
1.68495
1.68492
1.68525
1.68566
1.68561
1.68522
1.68489
1.6846
1.68429
1.68397
1.68364
1.68365
1.68396
1.68427
1.68425
1.68395
1.68366
1.68367
1.68395
1.68424
1.68453
1.68455
1.68457
1.68487
1.68519
1.68557
1.68554
1.68517
1.68485
1.68483
1.68516
1.68552
1.68597
1.68601
1.68605
1.68611
1.68617
1.68623
1.68629
1.68695
1.6877
1.68846
1.68839
1.68762
1.68688
1.6868
1.68754
1.6883
1.68894
1.68901
1.68906
1.68945
1.68959
1.68944
1.68943
1.68956
1.68942
1.68937
1.68955
1.68947
1.68953
1.68954
1.68932
1.68886
1.6882
1.68744
1.68672
1.68664
1.68733
1.68807
1.68794
1.68723
1.68657
1.6865
1.68712
1.6878
1.68848
1.68864
1.68876
1.68926
1.68952
1.68962
1.68971
1.68949
1.68917
1.68906
1.68945
1.68979
1.68983
1.68937
1.6889
1.6883
1.68765
1.68702
1.68644
1.68594
1.68552
1.68515
1.68482
1.68451
1.68422
1.68394
1.68368
1.68343
1.68317
1.68292
1.68266
1.68241
1.68218
1.68195
1.68174
1.68158
1.6815
1.68147
1.68144
1.68141
1.68133
1.68114
1.68073
1.68083
1.6812
1.68137
1.68138
1.68122
1.68086
1.68081
1.6812
1.68138
1.68148
1.68146
1.68144
1.6815
1.68155
1.6816
1.6817
1.68164
1.68155
1.68159
1.68171
1.68179
1.68186
1.68177
1.68164
1.68151
1.68138
1.68118
1.68071
1.68001
1.68
1.67991
1.67971
1.67904
1.67886
1.67863
1.67827
1.67907
1.67925
1.67978
1.67965
1.67955
1.67889
1.67793
1.67779
1.67873
1.67946
1.68002
1.68006
1.6801
1.68015
1.68037
1.68045
1.68089
1.68085
1.68116
1.68114
1.68132
1.68136
1.68147
1.68142
1.6815
1.68154
1.68157
1.68154
1.6815
1.68145
1.68137
1.68128
1.68114
1.68099
1.68076
1.68051
1.68047
1.68076
1.681
1.68102
1.68078
1.68046
1.68046
1.6808
1.68106
1.68125
1.68121
1.68117
1.68131
1.68141
1.68149
1.68152
1.68145
1.68135
1.68139
1.68149
1.68156
1.6816
1.68157
1.68153
1.68157
1.68159
1.68161
1.68159
1.68161
1.68159
1.68155
1.6816
1.68163
1.68168
1.68165
1.68172
1.68173
1.68178
1.68177
1.68183
1.68183
1.68187
1.68186
1.6819
1.6819
1.68189
1.68187
1.68185
1.68183
1.68181
1.68179
1.68177
1.68174
1.68172
1.6817
1.68168
1.68166
1.68164
1.68163
1.68164
1.68163
1.68164
1.68163
1.68162
1.6816
1.68162
1.68164
1.68165
1.68166
1.68167
1.68166
1.68167
1.68166
1.68167
1.68168
1.68168
1.68168
1.68169
1.68169
1.68169
1.6817
1.68172
1.68174
1.68174
1.68172
1.6817
1.6817
1.68171
1.68173
1.68175
1.68176
1.68177
1.68179
1.68181
1.68182
1.68182
1.6818
1.68178
1.68177
1.68178
1.6818
1.68182
1.68183
1.68185
1.68186
1.68188
1.68189
1.6819
1.68192
1.68193
1.68193
1.68192
1.68186
1.68177
1.68168
1.68182
1.68203
1.68225
1.6823
1.6821
1.6819
1.68197
1.68215
1.68233
1.68253
1.68251
1.68247
1.68271
1.68296
1.6832
1.68322
1.68298
1.68274
1.68276
1.68299
1.68323
1.68322
1.68299
1.68276
1.68253
1.68234
1.68217
1.68202
1.68201
1.68197
1.68196
1.68201
1.68205
1.68206
1.68213
1.6822
1.68219
1.68212
1.68209
1.68206
1.68203
1.68201
1.68198
1.68197
1.68195
1.68193
1.68192
1.68191
1.6819
1.68188
1.68187
1.68185
1.68183
1.68185
1.68186
1.68188
1.68189
1.68191
1.68193
1.68194
1.68196
1.68194
1.68192
1.6819
1.68194
1.68196
1.68198
1.682
1.68202
1.68204
1.68203
1.682
1.68198
1.68196
1.68198
1.682
1.68203
1.68206
1.68208
1.6821
1.68212
1.68215
1.68219
1.68217
1.68214
1.68212
1.68209
1.68205
1.68209
1.68212
1.68215
1.68219
1.68221
1.68223
1.68227
1.68228
1.68237
1.68235
1.68231
1.68227
1.68225
1.68229
1.68234
1.68236
1.6824
1.68245
1.68246
1.68258
1.68255
1.68267
1.68268
1.6828
1.68278
1.6829
1.68291
1.68303
1.683
1.68312
1.68313
1.68325
1.68322
1.68316
1.68311
1.68305
1.683
1.68294
1.68289
1.68284
1.68278
1.68272
1.68267
1.68261
1.68256
1.6825
1.68245
1.68243
1.68239
1.68236
1.68231
1.68227
1.68223
1.68219
1.68216
1.68223
1.68228
1.68232
1.68237
1.68241
1.68246
1.68249
1.68254
1.68251
1.68247
1.68242
1.68252
1.68257
1.6826
1.68265
1.6827
1.68276
1.68273
1.68267
1.68262
1.68257
1.68263
1.68268
1.68273
1.68278
1.68282
1.68287
1.68292
1.68297
1.68294
1.68289
1.68284
1.68278
1.68284
1.68289
1.68294
1.683
1.68303
1.68308
1.68314
1.68319
1.68322
1.68327
1.68334
1.68336
1.68345
1.68347
1.68347
1.68345
1.68369
1.68394
1.68421
1.68419
1.68393
1.6837
1.68369
1.68392
1.68418
1.68447
1.68448
1.6845
1.68481
1.68515
1.68551
1.68551
1.68515
1.6848
1.68479
1.68514
1.68551
1.6855
1.68512
1.68477
1.68444
1.68415
1.6839
1.68367
1.68358
1.68348
1.68344
1.68356
1.68366
1.6837
1.6838
1.68393
1.68389
1.68378
1.68371
1.68366
1.6836
1.68354
1.68349
1.68343
1.68338
1.68333
1.6833
1.68325
1.68321
1.68315
1.6831
1.68305
1.68299
1.68304
1.68309
1.68315
1.68319
1.68326
1.68331
1.68335
1.6834
1.68336
1.6833
1.68325
1.68335
1.68342
1.68346
1.68351
1.68357
1.68362
1.68358
1.68353
1.68347
1.6834
1.68346
1.68351
1.68357
1.68364
1.68369
1.68374
1.68377
1.68383
1.68389
1.68386
1.6838
1.68376
1.6837
1.68363
1.68369
1.68375
1.68382
1.68388
1.68393
1.68396
1.68403
1.68405
1.68419
1.68415
1.68409
1.68402
1.68399
1.68406
1.68413
1.68416
1.68423
1.68431
1.68433
1.68449
1.68446
1.68464
1.68465
1.68483
1.6848
1.68499
1.685
1.6852
1.68517
1.68537
1.68538
1.68559
1.68555
1.68548
1.68538
1.68528
1.68519
1.68509
1.685
1.68491
1.68482
1.68473
1.68464
1.68456
1.68447
1.68439
1.68431
1.68428
1.68421
1.68416
1.68409
1.68402
1.68395
1.68388
1.68381
1.68395
1.68402
1.6841
1.68417
1.68424
1.68432
1.68436
1.68444
1.6844
1.68434
1.68425
1.68443
1.68449
1.68453
1.68461
1.6847
1.68479
1.68476
1.68467
1.68458
1.68451
1.6846
1.68469
1.68479
1.68485
1.68489
1.68497
1.68507
1.68516
1.68512
1.68503
1.68494
1.68488
1.68497
1.68505
1.68513
1.68521
1.68526
1.68535
1.68545
1.68555
1.68558
1.68568
1.68576
1.68578
1.6859
1.68591
1.68591
1.68592
1.68639
1.68693
1.68752
1.6874
1.68686
1.68636
1.68635
1.68682
1.68732
1.68784
1.68797
1.68813
1.68873
1.68927
1.68984
1.68982
1.68914
1.68855
1.68838
1.689
1.68977
1.68974
1.68887
1.68825
1.68774
1.68725
1.68677
1.68632
1.6862
1.686
1.68596
1.68618
1.68638
1.68643
1.68664
1.68688
1.68684
1.68662
1.68654
1.68643
1.68632
1.68621
1.6861
1.68599
1.68589
1.68579
1.68576
1.68566
1.68563
1.68552
1.68541
1.68531
1.68519
1.68536
1.68547
1.68559
1.6857
1.68574
1.68585
1.68587
1.68598
1.68596
1.68593
1.68582
1.68604
1.68607
1.68609
1.68619
1.68631
1.68642
1.6864
1.68629
1.68618
1.68615
1.68627
1.68638
1.6865
1.68651
1.68653
1.68664
1.68666
1.68677
1.68689
1.68687
1.68676
1.68674
1.68663
1.68661
1.68672
1.68683
1.68685
1.68696
1.68698
1.687
1.68708
1.6871
1.68735
1.6873
1.68723
1.68712
1.6871
1.68721
1.68733
1.68735
1.68746
1.68754
1.68757
1.68782
1.68776
1.68798
1.68804
1.68832
1.68823
1.68853
1.6886
1.689
1.68891
1.68935
1.6894
1.6899
1.68988
1.68968
1.68946
1.68918
1.68898
1.68874
1.68858
1.68839
1.68825
1.68811
1.68801
1.68789
1.68779
1.68768
1.68758
1.68756
1.68745
1.68743
1.68731
1.68719
1.68708
1.68706
1.68694
1.68717
1.68729
1.68742
1.68753
1.68754
1.68765
1.68767
1.68777
1.68775
1.68773
1.68764
1.68762
1.68754
1.68771
1.6878
1.68782
1.68785
1.68787
1.68797
1.68808
1.68821
1.68817
1.68805
1.68795
1.68791
1.68801
1.68812
1.68808
1.68798
1.68789
1.6882
1.68825
1.6883
1.68835
1.68852
1.68871
1.68893
1.68889
1.68866
1.68846
1.68841
1.68861
1.68885
1.68912
1.68915
1.68916
1.68943
1.6897
1.68988
1.68997
1.69003
1.69003
1.68992
1.68988
1.68976
1.6896
1.68942
1.68931
1.68946
1.68942
1.6893
1.68925
1.68913
1.689
1.68881
1.68855
1.68834
1.68825
1.68835
1.68845
1.68857
1.68852
1.68842
1.68862
1.68867
1.68879
1.68873
1.68884
1.6889
1.68896
1.68908
1.6892
1.68933
1.68937
1.68951
1.68954
1.68958
1.68962
1.68973
1.68986
1.68999
1.69001
1.69015
1.69015
1.69014
1.69028
1.69032
1.69029
1.69043
1.69052
1.69052
1.69065
1.69065
1.69059
1.69049
1.69035
1.69017
1.68995
1.68973
1.68953
1.68938
1.68929
1.68925
1.68928
1.68935
1.68946
1.68964
1.68992
1.69031
1.69006
1.68963
1.68946
1.6898
1.68966
1.68943
1.68953
1.68965
1.68973
1.68971
1.68997
1.68986
1.69002
1.69041
1.69171
1.69072
1.68997
1.68958
1.68938
1.68931
1.6894
1.68927
1.68926
1.68943
1.68972
1.6893
1.68921
1.68922
1.68947
1.69025
1.69147
1.69064
1.68991
1.69083
1.69201
1.69324
1.69461
1.69326
1.6919
1.69289
1.69435
1.69573
1.69692
1.69581
1.69438
1.69272
1.69104
1.69023
1.6905
1.69172
1.69229
1.69081
1.69114
1.69269
1.69304
1.69139
1.69163
1.69354
1.69438
1.69204
1.69284
1.69562
1.69816
1.69696
1.69598
1.69528
1.69476
1.69424
1.69357
1.69534
1.69607
1.69667
1.69815
1.69754
1.69678
1.69788
1.69861
1.69919
1.69972
1.69875
1.69728
1.69801
1.69888
1.69981
1.70068
1.70005
1.69939
1.70021
1.70068
1.70107
1.70121
1.70098
1.70067
1.70029
1.69986
1.69934
1.69866
1.69775
1.69659
1.69522
1.69373
1.69224
1.69087
1.68981
1.68931
1.68949
1.69025
1.69146
1.69198
1.69069
1.68975
1.69008
1.69111
1.69242
1.69388
1.69345
1.6929
1.69442
1.6959
1.69723
1.69766
1.69639
1.69495
1.69535
1.69673
1.69795
1.69811
1.69695
1.69563
1.69421
1.69279
1.69147
1.69041
1.69071
1.69179
1.69308
1.69331
1.69206
1.69098
1.6912
1.69228
1.69349
1.69476
1.69463
1.69445
1.69582
1.69708
1.69817
1.69816
1.69713
1.69593
1.69599
1.69712
1.69808
1.69885
1.69898
1.69905
1.69904
1.69894
1.69871
1.69833
1.69919
1.69981
1.70026
1.70048
1.70009
1.69952
1.69969
1.70021
1.70055
1.70076
1.70075
1.70061
1.70088
1.70107
1.70119
1.70108
1.70103
1.70093
1.70087
1.70091
1.70089
1.70065
1.70072
1.70073
1.70068
1.70052
1.70022
1.69974
1.6997
1.70014
1.7004
1.7002
1.69999
1.69959
1.6994
1.69976
1.69994
1.69998
1.70028
1.70051
1.70052
1.70047
1.70036
1.70003
1.70016
1.70025
1.69992
1.6998
1.69963
1.69945
1.69987
1.70023
1.70056
1.70084
1.70107
1.70125
1.70136
1.70136
1.70117
1.70064
1.69942
1.69719
1.69421
1.69604
1.69886
1.70037
1.69813
1.70016
1.70151
1.70203
1.70159
1.70213
1.70214
1.70204
1.70216
1.70196
1.70182
1.70167
1.70187
1.70202
1.70205
1.70189
1.7014
1.70054
1.70128
1.70171
1.7019
1.70178
1.70172
1.70153
1.70153
1.7016
1.70159
1.70151
1.70173
1.70192
1.70184
1.70169
1.70149
1.70129
1.70147
1.70163
1.70139
1.70123
1.70105
1.70085
1.70108
1.70128
1.70143
1.70155
1.70165
1.70135
1.70127
1.70098
1.70103
1.7007
1.70067
1.70035
1.70037
1.70003
1.70003
1.69972
1.69971
1.69942
1.69944
1.69945
1.69971
1.7
1.7003
1.70061
1.7009
1.70118
1.70104
1.70078
1.7005
1.70034
1.7006
1.70085
1.70063
1.70038
1.70013
1.69987
1.70006
1.70021
1.69993
1.69966
1.69941
1.69931
1.69955
1.6998
1.69963
1.69939
1.69917
1.69899
1.69919
1.69941
1.69964
1.69988
1.70013
1.70036
1.70058
1.70078
1.70097
1.70113
1.70126
1.70137
1.70142
1.70142
1.70124
1.70119
1.7011
1.70081
1.70093
1.70102
1.70075
1.70063
1.70049
1.70034
1.70068
1.70098
1.70084
1.70067
1.70048
1.70015
1.70034
1.70052
1.70017
1.69998
1.69978
1.69938
1.69959
1.69978
1.69997
1.70014
1.70029
1.70044
1.70008
1.69992
1.69975
1.69932
1.69951
1.69969
1.69925
1.69905
1.69885
1.69864
1.69912
1.69956
1.69937
1.69916
1.69895
1.69849
1.6987
1.69891
1.69842
1.69821
1.698
1.69779
1.69828
1.69874
1.69917
1.69957
1.69994
1.70028
1.70006
1.69983
1.6996
1.69928
1.69951
1.69973
1.69936
1.69914
1.69893
1.69873
1.69907
1.69937
1.69916
1.69895
1.69876
1.6985
1.69868
1.69886
1.69854
1.69837
1.69821
1.69788
1.69803
1.69818
1.69836
1.69855
1.69875
1.69896
1.69853
1.69833
1.69814
1.6977
1.69788
1.69807
1.69759
1.6974
1.69723
1.69708
1.69753
1.69796
1.6978
1.69766
1.69753
1.69714
1.69726
1.69739
1.69695
1.69684
1.69674
1.6963
1.69639
1.69649
1.69661
1.69674
1.6969
1.69708
1.69727
1.69747
1.69768
1.6979
1.69812
1.69833
1.69855
1.69877
1.69898
1.69919
1.69937
1.69952
1.69961
1.6996
1.69946
1.69915
1.69865
1.69795
1.69706
1.69601
1.69484
1.69363
1.69245
1.69138
1.69152
1.69259
1.69373
1.69382
1.69269
1.69162
1.69169
1.69278
1.69389
1.69495
1.69494
1.6949
1.696
1.69697
1.69777
1.69752
1.69683
1.69597
1.69597
1.69666
1.69721
1.69682
1.6964
1.69582
1.6945
1.69497
1.69416
1.69388
1.6931
1.69268
1.692
1.69151
1.69095
1.691
1.69154
1.69211
1.69201
1.69169
1.69149
1.69103
1.69085
1.69057
1.69056
1.69087
1.69107
1.69112
1.69121
1.69124
1.69112
1.69109
1.69093
1.69076
1.69063
1.69047
1.69051
1.69063
1.69061
1.69046
1.69031
1.6903
1.69045
1.69061
1.69076
1.69077
1.69077
1.69093
1.69109
1.69125
1.69124
1.6914
1.69138
1.69137
1.69147
1.69151
1.69176
1.69205
1.69237
1.69227
1.69266
1.69271
1.69328
1.69388
1.69438
1.69446
1.694
1.69393
1.69343
1.69329
1.69287
1.693
1.69269
1.69266
1.69243
1.69231
1.69213
1.69206
1.6918
1.6917
1.69154
1.69156
1.69171
1.69188
1.69184
1.69204
1.69207
1.69219
1.69234
1.6925
1.69253
1.69237
1.69221
1.69222
1.69205
1.69207
1.6919
1.69173
1.69157
1.69158
1.69141
1.69142
1.69125
1.69109
1.69093
1.69093
1.69109
1.69126
1.69127
1.6911
1.69093
1.69076
1.6906
1.69045
1.69029
1.69028
1.69013
1.69012
1.68998
1.68983
1.6897
1.68967
1.68981
1.68996
1.68994
1.68979
1.68965
1.68962
1.68948
1.68945
1.68929
1.68915
1.68902
1.68896
1.68909
1.68924
1.68942
1.68956
1.68959
1.68974
1.68976
1.68991
1.68989
1.68986
1.68971
1.68968
1.68953
1.6894
1.68983
1.69
1.69003
1.69005
1.69007
1.69009
1.69011
1.69027
1.69028
1.69043
1.69044
1.6906
1.6906
1.69059
1.69043
1.69042
1.69025
1.69024
1.69041
1.69059
1.69059
1.69076
1.69076
1.69076
1.69076
1.69094
1.69111
1.69128
1.69129
1.69111
1.69094
1.69094
1.69112
1.6913
1.69149
1.69148
1.69146
1.69145
1.69144
1.69161
1.69159
1.69177
1.69175
1.69192
1.69194
1.69197
1.69178
1.69181
1.69163
1.69165
1.69183
1.69202
1.69199
1.69218
1.69215
1.69212
1.6921
1.69227
1.69224
1.69242
1.69239
1.69256
1.69273
1.6927
1.69267
1.69283
1.69275
1.69297
1.69305
1.69315
1.69299
1.69303
1.69286
1.6929
1.69307
1.69324
1.69319
1.69337
1.69333
1.69333
1.69332
1.69361
1.69364
1.69336
1.69347
1.69364
1.69379
1.69365
1.69399
1.69395
1.69421
1.69453
1.69483
1.69411
1.69502
1.69502
1.69542
1.69551
1.69565
1.69491
1.69529
1.69485
1.69428
1.69455
1.69422
1.69427
1.69395
1.69409
1.69397
1.69401
1.69385
1.69369
1.69353
1.69357
1.69341
1.69346
1.69328
1.69311
1.69294
1.69276
1.69259
1.69262
1.69245
1.69248
1.6923
1.69233
1.69251
1.6927
1.69266
1.69284
1.6928
1.69298
1.69316
1.69333
1.69339
1.69321
1.69303
1.69307
1.69289
1.69294
1.69274
1.69255
1.69237
1.6924
1.69221
1.69224
1.69204
1.69186
1.69166
1.69167
1.69188
1.69207
1.69227
1.69247
1.69244
1.69263
1.69259
1.69279
1.69284
1.69289
1.69267
1.69272
1.69251
1.6923
1.6921
1.6919
1.69169
1.69151
1.69131
1.69112
1.69094
1.69094
1.69076
1.69076
1.69058
1.6904
1.69022
1.69021
1.6904
1.69058
1.69075
1.69094
1.69095
1.69113
1.69113
1.69132
1.69133
1.69134
1.69113
1.69113
1.69093
1.69075
1.69057
1.6904
1.69019
1.69041
1.69056
1.69074
1.69092
1.69112
1.69135
1.69134
1.69157
1.69155
1.69153
1.69152
1.69172
1.69192
1.69212
1.69215
1.69194
1.69174
1.69176
1.69196
1.69217
1.69239
1.69236
1.69233
1.69255
1.69276
1.69298
1.69293
1.69314
1.69309
1.69304
1.69299
1.69318
1.69313
1.69332
1.69326
1.69345
1.69363
1.69357
1.69351
1.69368
1.69363
1.6938
1.69374
1.6939
1.69407
1.69422
1.69417
1.69433
1.69424
1.69437
1.69447
1.69453
1.69437
1.69444
1.69429
1.69413
1.69396
1.69403
1.69386
1.69392
1.69375
1.69382
1.694
1.69418
1.6941
1.69427
1.6942
1.69436
1.69452
1.69467
1.69459
1.69474
1.69469
1.69461
1.69458
1.69478
1.69478
1.69484
1.69499
1.69502
1.6948
1.69505
1.69517
1.69504
1.69489
1.69496
1.69482
1.69491
1.69476
1.6946
1.69444
1.69452
1.69435
1.69444
1.69426
1.69408
1.69389
1.6937
1.69351
1.69358
1.69338
1.69344
1.69324
1.6933
1.69351
1.69372
1.69365
1.69385
1.69377
1.69397
1.69416
1.69435
1.69445
1.69425
1.69405
1.69414
1.69393
1.69401
1.69379
1.69358
1.69336
1.69342
1.6932
1.69326
1.69303
1.69281
1.69258
1.69262
1.69285
1.69308
1.69313
1.6929
1.69265
1.69242
1.6922
1.69198
1.69178
1.69179
1.6916
1.69163
1.69181
1.69201
1.692
1.69221
1.69223
1.69246
1.69244
1.69269
1.69295
1.69318
1.69323
1.69301
1.69273
1.69308
1.69328
1.69352
1.69347
1.69342
1.69337
1.69331
1.69355
1.69348
1.69372
1.69365
1.69387
1.69395
1.69403
1.69379
1.69386
1.69361
1.69367
1.69393
1.6942
1.69411
1.69436
1.69427
1.69418
1.6941
1.69431
1.69422
1.69444
1.69435
1.69455
1.69474
1.69464
1.69453
1.69471
1.69462
1.69479
1.69469
1.69485
1.69501
1.69515
1.69506
1.69519
1.6951
1.69523
1.69532
1.69542
1.69529
1.6954
1.69526
1.69511
1.69495
1.69506
1.69489
1.69501
1.69482
1.69494
1.69513
1.69531
1.69518
1.69535
1.69522
1.69538
1.69552
1.69566
1.69554
1.69566
1.69554
1.69544
1.69537
1.69531
1.69525
1.69531
1.69508
1.6953
1.69546
1.69539
1.69483
1.69558
1.69565
1.69566
1.6955
1.69539
1.69547
1.69557
1.6957
1.69575
1.69566
1.69556
1.69565
1.69575
1.69585
1.69592
1.69581
1.69582
1.69596
1.69536
1.69574
1.69593
1.69596
1.69574
1.69545
1.69611
1.69608
1.69587
1.69593
1.69523
1.6961
1.69603
1.6959
1.69517
1.69606
1.69604
1.69594
1.69587
1.69598
1.69603
1.69608
1.69616
1.69612
1.69608
1.69602
1.69595
1.69586
1.69577
1.69589
1.69578
1.69592
1.69579
1.69566
1.69551
1.69564
1.69548
1.69564
1.69546
1.69526
1.69506
1.69486
1.69465
1.69476
1.69455
1.69465
1.69441
1.69451
1.69475
1.69499
1.69487
1.6951
1.69497
1.69519
1.6954
1.69559
1.69574
1.69554
1.69532
1.69546
1.69522
1.69535
1.69511
1.69486
1.69461
1.69471
1.69445
1.69455
1.69429
1.694
1.69373
1.69378
1.69408
1.69439
1.69464
1.69491
1.69481
1.69508
1.69497
1.69523
1.69536
1.6955
1.69519
1.69533
1.695
1.69473
1.69451
1.69564
1.69582
1.69604
1.6959
1.69576
1.69562
1.69549
1.69574
1.69559
1.69583
1.69568
1.6959
1.69611
1.69595
1.69578
1.69596
1.69581
1.69596
1.6958
1.69594
1.69611
1.69628
1.69613
1.69631
1.69613
1.69631
1.6965
1.69667
1.69647
1.69662
1.69642
1.69624
1.69607
1.69618
1.69603
1.69613
1.69599
1.69607
1.69621
1.69636
1.69628
1.69645
1.69635
1.69654
1.69664
1.69672
1.69653
1.6966
1.69643
1.69628
1.69614
1.6962
1.69623
1.69626
1.69638
1.69636
1.69633
1.69647
1.6965
1.6965
1.69649
1.69637
1.69627
1.69619
1.69616
1.69632
1.69567
1.69603
1.69618
1.69625
1.69607
1.6953
1.69613
1.69628
1.69623
1.69619
1.69617
1.69626
1.69623
1.69622
1.69628
1.69633
1.69636
1.69646
1.69642
1.69635
1.69626
1.69623
1.69629
1.69646
1.69522
1.69601
1.69628
1.69621
1.69618
1.6962
1.69641
1.69498
1.6959
1.69612
1.69604
1.6961
1.69622
1.69634
1.69643
1.69652
1.69658
1.69663
1.69665
1.69665
1.69663
1.69681
1.69678
1.69698
1.69693
1.69686
1.69675
1.69696
1.69682
1.69704
1.69688
1.69669
1.6965
1.69629
1.69606
1.69623
1.69599
1.69615
1.69589
1.69603
1.69632
1.6966
1.69641
1.69666
1.69647
1.69669
1.6969
1.69711
1.69734
1.69712
1.69689
1.69711
1.69686
1.69705
1.69679
1.69649
1.69618
1.69633
1.69668
1.69699
1.69726
1.69747
1.69725
1.69754
1.69732
1.69759
1.69736
1.69759
1.69779
1.69753
1.69729
1.69744
1.69719
1.69731
1.69708
1.69718
1.69723
1.69725
1.69701
1.69701
1.69683
1.69681
1.69699
1.6972
1.69724
1.69749
1.69751
1.69748
1.6974
1.69765
1.69756
1.69783
1.69769
1.69797
1.69812
1.69824
1.69795
1.69802
1.69771
1.69774
1.69774
1.6977
1.69745
1.69737
1.69713
1.69695
1.69678
1.69672
1.69663
1.69653
1.69664
1.69677
1.69687
1.69704
1.69691
1.69676
1.69658
1.69649
1.69641
1.69627
1.6961
1.69596
1.69594
1.69614
1.69632
1.69638
1.69616
1.69592
1.6959
1.69618
1.69644
1.69669
1.6969
1.6971
1.69725
1.69747
1.69762
1.69787
1.69798
1.69802
1.69805
1.69835
1.69832
1.69864
1.69855
1.69843
1.69826
1.69807
1.69785
1.69812
1.69784
1.69814
1.69775
1.6984
1.69881
1.69898
1.69865
1.69835
1.69858
1.69876
1.6989
1.69925
1.6991
1.6989
1.69931
1.69945
1.69963
1.69981
1.69939
1.69901
1.69906
1.69869
1.69869
1.69834
1.6983
1.69819
1.698
1.69771
1.69753
1.69729
1.69704
1.69727
1.6975
1.69777
1.69802
1.69829
1.69849
1.69863
1.69899
1.69906
1.69948
1.69946
1.69987
1.69992
1.69986
1.69941
1.69925
1.69884
1.69864
1.69832
1.69795
1.6977
1.69725
1.69713
1.69694
1.6968
1.69652
1.69621
1.69588
1.69584
1.69622
1.69658
1.69671
1.69629
1.69583
1.69535
1.69547
1.69555
1.69562
1.69566
1.69574
1.69593
1.69626
1.69473
1.69541
1.6957
1.69558
1.69543
1.69531
1.69577
1.69414
1.69483
1.69498
1.69487
1.69506
1.69534
1.69523
1.69489
1.6946
1.69434
1.6947
1.69507
1.69493
1.69451
1.69412
1.69377
1.69388
1.69445
1.69511
1.69361
1.69394
1.69395
1.69311
1.6933
1.69345
1.69317
1.69341
1.69382
1.69425
1.6947
1.69524
1.69576
1.6963
1.6968
1.69689
1.69744
1.69763
1.6982
1.69865
1.699
1.69943
1.6997
1.70018
1.70033
1.70045
1.70031
1.70034
1.70006
1.69999
1.70108
1.70113
1.70079
1.70174
1.70157
1.70076
1.70033
1.69987
1.69942
1.69901
1.69848
1.69783
1.69707
1.69701
1.69632
1.69633
1.69571
1.69559
1.69542
1.69625
1.69615
1.69713
1.69804
1.6988
1.69917
1.69987
1.70044
1.70076
1.70187
1.70136
1.69967
1.69946
1.69845
1.69825
1.69718
1.69602
1.69483
1.69518
1.69424
1.69459
1.69487
1.69511
1.69451
1.69392
1.69345
1.69295
1.69354
1.69422
1.69383
1.69311
1.69245
1.69188
1.69244
1.69297
1.69259
1.69231
1.69331
1.69195
1.69178
1.69161
1.69071
1.69145
1.69199
1.69142
1.691
1.69049
1.69083
1.69
1.69102
1.69205
1.69261
1.69404
1.69407
1.69536
1.69486
1.69591
1.69512
1.69638
1.69617
1.69623
1.69649
1.69558
1.69618
1.696
1.69591
1.69599
1.69497
1.69483
1.69437
1.69511
1.69324
1.69295
1.69194
1.69061
1.68892
1.68894
1.6895
1.6902
1.69006
1.69031
1.69072
1.6912
1.69182
1.69254
1.69334
1.69273
1.69372
1.69307
1.69432
1.69569
1.69714
1.69691
1.69875
1.69953
1.70084
1.69649
1.69691
1.69337
1.69447
1.6952
1.69362
1.69258
1.69111
1.68911
1.69222
1.68714
1.6845
1.68725
1.68934
1.69096
1.69215
1.69092
1.69194
1.69095
1.69186
1.6911
1.69014
1.68903
1.68987
1.68853
1.6896
1.68795
1.6869
1.68609
1.68769
1.68704
1.68835
1.68946
1.69044
1.6899
1.68948
1.68917
1.68817
1.6885
1.68891
1.68783
1.68745
1.68716
1.6869
1.68786
1.68893
1.68827
1.68754
1.68737
1.68635
1.6858
1.68586
1.68603
1.68623
1.68656
1.68512
1.68552
1.68377
1.68423
1.68491
1.68586
1.68322
1.68253
1.68206
1.68178
1.68168
1.68349
1.68336
1.68486
1.68475
1.68334
1.68182
1.68171
1.67992
1.6797
1.67958
1.6796
1.67977
1.68012
1.68037
1.67603
1.67633
1.67662
1.67688
1.6741
1.67342
1.67273
1.67201
1.66832
1.66934
1.67036
1.67136
1.6723
1.67473
1.67719
1.6776
1.67802
1.6785
1.68019
1.68052
1.68198
1.68336
1.68468
1.68468
1.68458
1.686
1.68645
1.68546
1.68421
1.68385
1.68354
1.68344
1.6822
1.68237
1.68217
1.68363
1.68335
1.68579
1.6866
1.68886
1.6879
1.69056
1.69071
1.68998
1.68773
1.68634
1.68552
1.6826
1.6826
1.68179
1.68187
1.68125
1.68089
1.67947
1.67897
1.67739
1.67676
1.67605
1.67543
1.67326
1.67409
1.67497
1.67581
1.67661
1.67805
1.67867
1.67982
1.67971
1.67952
1.67958
1.67742
1.67724
1.67613
1.67522
1.67424
1.67327
1.67221
1.6711
1.6699
1.66865
1.66737
1.66602
1.66466
1.66085
1.66264
1.66432
1.66598
1.66355
1.66141
1.65919
1.65716
1.65285
1.65039
1.64799
1.64498
1.64425
1.64167
1.64199
1.63991
1.64078
1.63893
1.64044
1.6391
1.64091
1.64006
1.63988
1.64129
1.64064
1.64211
1.64164
1.64175
1.64301
1.64281
1.64288
1.64387
1.6437
1.64372
1.64456
1.6444
1.64525
1.64514
1.64524
1.64595
1.64591
1.64597
1.64655
1.64652
1.64655
1.64706
1.64702
1.64703
1.64747
1.64743
1.64743
1.64781
1.64777
1.64775
1.64808
1.64805
1.64801
1.648
1.64827
1.64823
1.64818
1.64843
1.64838
1.64832
1.64856
1.64851
1.64845
1.64866
1.64862
1.64855
1.64875
1.64871
1.64865
1.64883
1.6488
1.64874
1.64891
1.64888
1.64883
1.64899
1.64898
1.64894
1.64908
1.64909
1.64906
1.64919
1.64923
1.64922
1.64932
1.6494
1.64939
1.64946
1.64984
1.64969
1.64962
1.64987
1.65012
1.65034
1.65034
1.6504
1.65057
1.65069
1.65087
1.65098
1.65102
1.65117
1.65132
1.65138
1.65151
1.65168
1.65175
1.65187
1.65204
1.65212
1.65221
1.65239
1.65247
1.65254
1.65272
1.6528
1.65286
1.65304
1.65311
1.65318
1.65337
1.65342
1.6536
1.65366
1.65368
1.65387
1.65393
1.65395
1.65414
1.65414
1.65432
1.65437
1.65436
1.65454
1.6546
1.6546
1.6548
1.65477
1.65494
1.655
1.65496
1.65513
1.65519
1.65517
1.65535
1.65531
1.65546
1.6555
1.65546
1.65564
1.65558
1.65572
1.65576
1.6557
1.65588
1.65581
1.65595
1.65598
1.65591
1.65608
1.656
1.65613
1.65617
1.6561
1.65627
1.65617
1.6563
1.65631
1.65622
1.65637
1.65626
1.65637
1.65638
1.65629
1.65644
1.65634
1.65648
1.65635
1.65644
1.65643
1.65633
1.65647
1.65634
1.65643
1.65642
1.65632
1.65643
1.65631
1.65642
1.65627
1.65633
1.65631
1.6562
1.65631
1.65618
1.65628
1.65612
1.65617
1.65613
1.656
1.65609
1.65596
1.65603
1.65587
1.65589
1.65583
1.6557
1.65577
1.65562
1.65568
1.6555
1.6555
1.65542
1.6553
1.65536
1.65521
1.65525
1.65508
1.6551
1.6549
1.65487
1.65475
1.65461
1.65464
1.65448
1.6545
1.65432
1.65432
1.65413
1.65408
1.65395
1.6538
1.6538
1.65363
1.65361
1.65343
1.6534
1.6532
1.65311
1.65294
1.6528
1.65279
1.65262
1.65258
1.65239
1.65233
1.65212
1.652
1.6518
1.65166
1.65163
1.65147
1.65141
1.65122
1.65115
1.65093
1.65084
1.65061
1.65045
1.65021
1.65005
1.64999
1.64981
1.64971
1.64951
1.64941
1.64919
1.64901
1.64875
1.6486
1.64851
1.64833
1.64821
1.64801
1.64786
1.64765
1.6475
1.64728
1.64705
1.64676
1.6466
1.64649
1.6463
1.64615
1.64593
1.64577
1.64554
1.64536
1.64513
1.64494
1.64471
1.64444
1.64412
1.64395
1.64381
1.6436
1.64343
1.6432
1.643
1.64276
1.64255
1.64229
1.642
1.64165
1.64148
1.64131
1.6411
1.6409
1.64067
1.64045
1.64021
1.63997
1.63973
1.6394
1.63903
1.63886
1.63867
1.63845
1.63823
1.63798
1.63772
1.63747
1.63719
1.63693
1.63655
1.63614
1.63596
1.63575
1.63553
1.63529
1.63503
1.63475
1.63448
1.63418
1.63391
1.6335
1.63305
1.63286
1.63261
1.63237
1.63208
1.63182
1.63151
1.63123
1.6309
1.63061
1.63018
1.62969
1.62948
1.6292
1.62894
1.62863
1.62835
1.62799
1.62771
1.62733
1.62706
1.62658
1.62606
1.62587
1.62557
1.62532
1.62499
1.62469
1.62431
1.62399
1.62357
1.62325
1.62271
1.62213
1.62192
1.62157
1.62131
1.62093
1.62061
1.62018
1.61986
1.61932
1.61869
1.61844
1.61806
1.61775
1.61731
1.61694
1.61644
1.61608
1.61544
1.61477
1.61457
1.61417
1.61391
1.61348
1.61313
1.61264
1.61227
1.61164
1.61088
1.6106
1.6101
1.60977
1.60922
1.60889
1.6083
1.60798
1.6073
1.60656
1.6063
1.60582
1.60548
1.60495
1.60453
1.6039
1.60347
1.60268
1.6018
1.6015
1.60089
1.60055
1.5999
1.59954
1.59875
1.59789
1.5976
1.59702
1.59662
1.59596
1.59552
1.59463
1.59364
1.59329
1.59256
1.59217
1.59138
1.59103
1.5901
1.58915
1.58884
1.58816
1.58772
1.58694
1.58643
1.58539
1.5842
1.58376
1.58283
1.58242
1.58131
1.58022
1.57997
1.57919
1.5788
1.57795
1.57745
1.5763
1.57499
1.57448
1.5734
1.57291
1.57161
1.57024
1.56988
1.56878
1.56845
1.56723
1.56597
1.56554
1.56447
1.56393
1.56259
1.56102
1.56048
1.55914
1.55866
1.55706
1.55548
1.55519
1.5539
1.5535
1.55205
1.55041
1.54983
1.54833
1.54773
1.54586
1.54385
1.5435
1.54167
1.53996
1.53956
1.53797
1.53755
1.53571
1.53359
1.53304
1.53082
1.52844
1.5281
1.5257
1.52368
1.52349
1.52163
1.52128
1.51905
1.51659
1.51621
1.51353
1.51084
1.51054
1.50768
1.50519
1.50506
1.50238
1.49965
1.49936
1.49622
1.49315
1.49309
1.48962
1.48673
1.48695
1.48378
1.4809
1.47795
1.47801
1.47442
1.47085
1.47099
1.46638
1.46291
1.45976
1.46055
1.4565
1.45323
1.44997
1.45099
1.44649
1.44308
1.43969
1.44119
1.43613
1.43207
1.42784
1.42401
1.42699
1.42176
1.41928
1.41667
1.41484
1.41412
1.41389
1.41501
1.41822
1.42149
1.42471
1.42815
1.43158
1.43509
1.43833
1.44115
1.44391
1.44574
1.44813
1.44847
1.45071
1.45356
1.45667
1.45904
1.46084
1.46248
1.46409
1.46563
1.46708
1.46845
1.46975
1.471
1.47218
1.47331
1.47438
1.47539
1.47635
1.47727
1.47814
1.47897
1.47978
1.48055
1.4813
1.48202
1.48273
1.48342
1.48411
1.48477
1.48543
1.48606
1.4867
1.48732
1.48793
1.48852
1.48911
1.48968
1.49025
1.4908
1.49134
1.49187
1.49239
1.4929
1.49339
1.49387
1.49435
1.4948
1.49525
1.49569
1.49611
1.49653
1.49693
1.49732
1.49771
1.49808
1.49844
1.49879
1.49914
1.49947
1.49979
1.50011
1.50042
1.50071
1.501
1.50129
1.50156
1.50183
1.50209
1.50234
1.50258
1.50282
1.50305
1.50327
1.50349
1.5037
1.50391
1.50411
1.5043
1.50449
1.50467
1.50485
1.50502
1.50519
1.50535
1.50551
1.50566
1.50581
1.50595
1.50609
1.50623
1.50636
1.50649
1.50661
1.50673
1.50685
1.50696
1.50707
1.50718
1.50728
1.50738
1.50748
1.50757
1.50766
1.50775
1.50783
1.50792
1.508
1.50807
1.50815
1.50822
1.50829
1.50836
1.50842
1.50849
1.50855
1.50861
1.50867
1.50873
1.50879
1.50884
1.5089
1.50895
1.509
1.50906
1.50911
1.50916
1.50921
1.50925
1.5093
1.50935
1.50939
1.50943
1.50948
1.50952
1.50957
1.50961
1.50965
1.50969
1.50973
1.50977
1.50981
1.50985
1.50989
1.50993
1.50997
1.51001
1.51005
1.51009
1.51013
1.51016
1.51021
1.51024
1.51029
1.51032
1.51037
1.51041
1.51046
1.51049
1.51054
1.51057
1.51062
1.51066
1.51071
1.51075
1.5108
1.51084
1.51089
1.51094
1.51099
1.51104
1.5111
1.51114
1.5112
1.51125
1.51132
1.51137
1.51143
1.51148
1.51155
1.51161
1.51167
1.51173
1.5118
1.51187
1.51194
1.51201
1.51208
1.51215
1.51223
1.51231
1.51238
1.51246
1.51255
1.51263
1.51271
1.5128
1.51289
1.51298
1.51307
1.51316
1.51326
1.51335
1.51345
1.51355
1.51365
1.51375
1.51386
1.51396
1.51407
1.51417
1.51429
1.51439
1.51451
1.51462
1.51474
1.51485
1.51497
1.51508
1.5152
1.51532
1.51544
1.51556
1.51569
1.51581
1.51594
1.51606
1.51619
1.51632
1.51645
1.51657
1.5167
1.51683
1.51696
1.51709
1.51722
1.51735
1.51748
1.51761
1.51774
1.51786
1.51799
1.51812
1.51825
1.51838
1.51851
1.51863
1.51876
1.51889
1.51902
1.51914
1.51927
1.5194
1.51953
1.51965
1.51978
1.51991
1.52004
1.52016
1.52029
1.52041
1.52054
1.52066
1.52079
1.52091
1.52104
1.52116
1.52129
1.52141
1.52154
1.52166
1.52179
1.52191
1.52204
1.52216
1.52229
1.52241
1.52254
1.52266
1.52279
1.52291
1.52304
1.52316
1.52329
1.52341
1.52354
1.52366
1.52379
1.52391
1.52404
1.52417
1.5243
1.52442
1.52455
1.52468
1.52481
1.52494
1.52507
1.5252
1.52534
1.52547
1.5256
1.52573
1.52587
1.52601
1.52615
1.52628
1.52642
1.52656
1.52671
1.52685
1.52699
1.52713
1.52728
1.52743
1.52758
1.52773
1.52788
1.52803
1.52819
1.52834
1.5285
1.52865
1.52882
1.52897
1.52914
1.5293
1.52947
1.52963
1.52981
1.52997
1.53015
1.53032
1.5305
1.53067
1.53085
1.53103
1.53121
1.53139
1.53158
1.53176
1.53195
1.53214
1.53233
1.53252
1.53272
1.53291
1.53311
1.5333
1.53351
1.5337
1.53391
1.53411
1.53431
1.53452
1.53472
1.53493
1.53514
1.53534
1.53555
1.53575
1.53597
1.53617
1.53639
1.53658
1.5368
1.53699
1.5372
1.53738
1.53758
1.53775
1.53794
1.5381
1.53826
1.5384
1.53851
1.53858
1.53849
1.53909
1.54051
1.5418
1.54214
1.54225
1.54214
1.54205
1.5422
1.54252
1.54297
1.54338
1.5437
1.54396
1.54421
1.54447
1.54472
1.54495
1.5451
1.54522
1.54482
1.54279
1.54528
1.54647
1.54855
1.54793
1.55067
1.55075
1.55247
1.55298
1.55439
1.5534
1.55267
1.55132
1.54967
1.54792
1.54635
1.54598
1.54716
1.54662
1.54564
1.54525
1.54606
1.54705
1.54782
1.54849
1.54974
1.54904
1.5501
1.54799
1.5477
1.54656
1.54558
1.54488
1.54453
1.5451
1.54474
1.54421
1.5439
1.54435
1.54504
1.54554
1.54588
1.54677
1.54866
1.54743
1.54657
1.54588
1.54585
1.5448
1.54401
1.54358
1.54323
1.54366
1.54308
1.54264
1.54226
1.54273
1.54342
1.54381
1.54424
1.54498
1.54663
1.54572
1.54485
1.54427
1.54441
1.5433
1.54254
1.54207
1.54208
1.54253
1.54251
1.54202
1.54179
1.54232
1.54284
1.54315
1.54316
1.54401
1.54532
1.5447
1.54417
1.54352
1.54349
1.54261
1.54207
1.54147
1.54086
1.54116
1.54068
1.53971
1.53934
1.5402
1.54108
1.54151
1.54198
1.54264
1.54412
1.54335
1.5425
1.54189
1.54188
1.54086
1.54002
1.5392
1.53907
1.53977
1.53963
1.53893
1.53878
1.53944
1.54018
1.54042
1.54057
1.54133
1.54285
1.54221
1.54134
1.54091
1.54096
1.54005
1.53928
1.53861
1.53843
1.53909
1.5389
1.53826
1.53806
1.53871
1.53939
1.53965
1.53978
1.54048
1.54188
1.54131
1.54049
1.54007
1.54011
1.53925
1.53851
1.53788
1.53768
1.53831
1.5381
1.53748
1.53728
1.5379
1.53857
1.53883
1.53897
1.53964
1.54098
1.54043
1.53965
1.53922
1.53925
1.53842
1.53769
1.53707
1.53687
1.53749
1.53727
1.53665
1.53645
1.53707
1.53772
1.53799
1.53814
1.53879
1.54009
1.53954
1.5388
1.53836
1.53839
1.53757
1.53686
1.53624
1.53604
1.53665
1.53644
1.53582
1.53562
1.53624
1.53688
1.53714
1.53729
1.53793
1.53921
1.53866
1.53794
1.5375
1.53753
1.53673
1.53602
1.5354
1.53521
1.53582
1.53561
1.53499
1.5348
1.53541
1.53604
1.5363
1.53645
1.53707
1.53834
1.53779
1.53708
1.53666
1.53669
1.5359
1.5352
1.53458
1.53439
1.535
1.53479
1.53418
1.53399
1.5346
1.53522
1.53548
1.53562
1.53624
1.53748
1.53695
1.53625
1.53583
1.53586
1.53508
1.53439
1.53378
1.53359
1.5342
1.53399
1.53339
1.5332
1.5338
1.53443
1.53468
1.53481
1.53542
1.53665
1.53612
1.53543
1.53502
1.53505
1.53429
1.5336
1.533
1.53281
1.53342
1.53322
1.53261
1.53243
1.53304
1.53365
1.5339
1.53403
1.53462
1.53583
1.53532
1.53464
1.53424
1.53427
1.53352
1.53284
1.53224
1.53206
1.53266
1.53247
1.53187
1.53169
1.53229
1.5329
1.53314
1.53327
1.53385
1.53505
1.53455
1.53387
1.53348
1.53352
1.53277
1.5321
1.5315
1.53133
1.53193
1.53174
1.53115
1.53098
1.53157
1.53218
1.53241
1.53253
1.53311
1.53429
1.53381
1.53313
1.53276
1.53279
1.53206
1.53139
1.53079
1.53063
1.53122
1.53105
1.53045
1.53029
1.53088
1.53148
1.53171
1.53182
1.5324
1.53356
1.53309
1.53241
1.53205
1.53209
1.53137
1.53071
1.53011
1.52995
1.53054
1.53037
1.52978
1.52962
1.53022
1.53081
1.53103
1.53114
1.53171
1.53285
1.5324
1.53173
1.53138
1.53142
1.5307
1.53005
1.52945
1.5293
1.52989
1.52973
1.52913
1.52898
1.52957
1.53017
1.53038
1.53048
1.53104
1.53217
1.53174
1.53107
1.53073
1.53077
1.53006
1.52941
1.52882
1.52867
1.52926
1.5291
1.52851
1.52837
1.52896
1.52955
1.52975
1.52985
1.53041
1.53152
1.5311
1.53043
1.5301
1.53014
1.52944
1.5288
1.52821
1.52807
1.52865
1.5285
1.52791
1.52777
1.52836
1.52895
1.52914
1.52924
1.52979
1.53089
1.53048
1.52982
1.5295
1.52954
1.52885
1.52821
1.52762
1.52748
1.52807
1.52792
1.52733
1.5272
1.52779
1.52837
1.52856
1.52865
1.5292
1.53029
1.52989
1.52923
1.52892
1.52896
1.52828
1.52764
1.52705
1.52692
1.5275
1.52736
1.52677
1.52664
1.52723
1.52781
1.528
1.52808
1.52863
1.52971
1.52932
1.52866
1.52835
1.5284
1.52772
1.52709
1.5265
1.52637
1.52696
1.52682
1.52623
1.5261
1.52669
1.52727
1.52745
1.52753
1.52807
1.52915
1.52877
1.52811
1.52781
1.52786
1.52719
1.52655
1.52596
1.52583
1.52642
1.52629
1.5257
1.52557
1.52617
1.52674
1.52692
1.527
1.52754
1.5286
1.52823
1.52757
1.52728
1.52733
1.52666
1.52603
1.52544
1.52531
1.52591
1.52577
1.52518
1.52506
1.52565
1.52623
1.5264
1.52648
1.52702
1.52807
1.52771
1.52705
1.52677
1.52682
1.52615
1.52552
1.52492
1.5248
1.5254
1.52527
1.52467
1.52455
1.52515
1.52573
1.5259
1.52597
1.5265
1.52755
1.52719
1.52654
1.52626
1.52631
1.52565
1.52502
1.52442
1.5243
1.5249
1.52477
1.52417
1.52405
1.52465
1.52523
1.5254
1.52547
1.526
1.52705
1.52669
1.52604
1.52576
1.52581
1.52515
1.52452
1.52392
1.5238
1.5244
1.52427
1.52367
1.52356
1.52415
1.52473
1.5249
1.52497
1.5255
1.52655
1.52619
1.52554
1.52526
1.52532
1.52466
1.52403
1.52343
1.52331
1.52391
1.52378
1.52318
1.52306
1.52366
1.52424
1.52441
1.52448
1.52501
1.52605
1.5257
1.52505
1.52477
1.52483
1.52417
1.52354
1.52293
1.52281
1.52342
1.52329
1.52269
1.52257
1.52317
1.52375
1.52392
1.52399
1.52452
1.52556
1.5252
1.52455
1.52428
1.52433
1.52368
1.52304
1.52244
1.52232
1.52292
1.5228
1.52219
1.52207
1.52268
1.52326
1.52343
1.5235
1.52403
1.52507
1.52471
1.52406
1.52379
1.52384
1.52319
1.52255
1.52195
1.52183
1.52243
1.52231
1.5217
1.52158
1.52219
1.52277
1.52294
1.52301
1.52353
1.52457
1.52421
1.52357
1.52329
1.52334
1.52269
1.52206
1.52145
1.52133
1.52194
1.52181
1.5212
1.52108
1.52169
1.52227
1.52244
1.52251
1.52304
1.52407
1.52372
1.52307
1.5228
1.52284
1.52219
1.52156
1.52095
1.52083
1.52144
1.52131
1.5207
1.52058
1.52119
1.52177
1.52194
1.52201
1.52254
1.52357
1.52321
1.52257
1.52229
1.52234
1.52169
1.52106
1.52045
1.52033
1.52093
1.52081
1.5202
1.52007
1.52068
1.52126
1.52144
1.52151
1.52203
1.52307
1.52271
1.52206
1.52179
1.52183
1.52118
1.52055
1.51994
1.51982
1.52043
1.5203
1.51969
1.51957
1.52017
1.52075
1.52093
1.521
1.52152
1.52256
1.52219
1.52155
1.52128
1.52132
1.52067
1.52004
1.51943
1.51931
1.51992
1.51979
1.51918
1.51906
1.51966
1.52024
1.52042
1.52049
1.52101
1.52204
1.52168
1.52103
1.52076
1.5208
1.52016
1.51953
1.51892
1.5188
1.5194
1.51927
1.51867
1.51854
1.51914
1.51972
1.5199
1.51997
1.52049
1.52152
1.52116
1.52052
1.52024
1.52028
1.51964
1.51901
1.51841
1.51828
1.51888
1.51876
1.51815
1.51802
1.51863
1.5192
1.51938
1.51946
1.51997
1.521
1.52064
1.52
1.51972
1.51976
1.51912
1.5185
1.51789
1.51777
1.51837
1.51824
1.51763
1.51751
1.51811
1.51868
1.51886
1.51894
1.51945
1.52048
1.52012
1.51947
1.5192
1.51924
1.5186
1.51798
1.51737
1.51725
1.51785
1.51772
1.51712
1.51699
1.51759
1.51816
1.51834
1.51842
1.51894
1.51997
1.51961
1.51895
1.51869
1.51872
1.51809
1.51746
1.51686
1.51673
1.51733
1.51721
1.5166
1.51648
1.51708
1.51765
1.51783
1.5179
1.51842
1.51946
1.5191
1.51844
1.51818
1.51822
1.51758
1.51695
1.51635
1.51623
1.51683
1.51671
1.5161
1.51598
1.51658
1.51716
1.51733
1.5174
1.51792
1.51896
1.5186
1.51794
1.51768
1.51772
1.51708
1.51646
1.51586
1.51574
1.51633
1.51622
1.51562
1.5155
1.5161
1.51668
1.51684
1.51691
1.51743
1.51847
1.51812
1.51745
1.5172
1.51724
1.5166
1.51598
1.51538
1.51527
1.51586
1.51575
1.51515
1.51504
1.51563
1.51621
1.51637
1.51644
1.51696
1.518
1.51766
1.51699
1.51674
1.51678
1.51614
1.51553
1.51493
1.51482
1.51541
1.51531
1.51471
1.5146
1.51519
1.51577
1.51592
1.51599
1.51651
1.51754
1.51722
1.51654
1.5163
1.51635
1.51571
1.51509
1.51449
1.51439
1.51498
1.51488
1.51428
1.51418
1.51477
1.51536
1.5155
1.51556
1.51608
1.51711
1.51681
1.51612
1.51588
1.51594
1.51529
1.51468
1.51408
1.51398
1.51457
1.51448
1.51388
1.51379
1.51438
1.51497
1.5151
1.51516
1.51568
1.51671
1.51643
1.51572
1.51549
1.51556
1.51491
1.51429
1.51369
1.5136
1.51419
1.51411
1.51351
1.51342
1.51401
1.5146
1.51472
1.51478
1.5153
1.51634
1.51607
1.51536
1.51513
1.5152
1.51455
1.51393
1.51333
1.51325
1.51384
1.51376
1.51316
1.51308
1.51368
1.51427
1.51438
1.51443
1.51496
1.51599
1.51574
1.51501
1.5148
1.51488
1.51422
1.5136
1.513
1.51292
1.51351
1.51344
1.51284
1.51276
1.51336
1.51396
1.51406
1.5141
1.51464
1.51567
1.51544
1.5147
1.51449
1.51458
1.51392
1.51329
1.51269
1.51262
1.51321
1.51315
1.51254
1.51247
1.51308
1.51368
1.51377
1.51381
1.51434
1.51538
1.51516
1.51442
1.51421
1.51431
1.51364
1.51301
1.5124
1.51234
1.51294
1.51288
1.51227
1.51221
1.51281
1.51342
1.51351
1.51354
1.51408
1.51511
1.51491
1.51416
1.51396
1.51406
1.51339
1.51275
1.51214
1.51208
1.51269
1.51263
1.51202
1.51197
1.51258
1.51319
1.51327
1.51329
1.51384
1.51488
1.51469
1.51392
1.51373
1.51384
1.51316
1.51252
1.51191
1.51185
1.51246
1.51241
1.5118
1.51174
1.51236
1.51297
1.51305
1.51307
1.51362
1.51467
1.5145
1.51372
1.51353
1.51364
1.51296
1.51231
1.51169
1.51164
1.51226
1.51221
1.51159
1.51154
1.51216
1.51278
1.51286
1.51287
1.51343
1.51448
1.51432
1.51353
1.51335
1.51346
1.51277
1.51211
1.51149
1.51144
1.51207
1.51202
1.51139
1.51135
1.51198
1.51261
1.51268
1.51269
1.51325
1.51431
1.51417
1.51336
1.51318
1.51331
1.5126
1.51194
1.5113
1.51126
1.5119
1.51186
1.51122
1.51118
1.51182
1.51245
1.51252
1.51253
1.51309
1.51417
1.51403
1.51321
1.51303
1.51316
1.51245
1.51177
1.51113
1.5111
1.51174
1.5117
1.51105
1.51102
1.51166
1.51231
1.51238
1.51237
1.51295
1.51404
1.51391
1.51308
1.5129
1.51303
1.51231
1.51162
1.51097
1.51094
1.51159
1.51155
1.5109
1.51086
1.51152
1.51217
1.51224
1.51224
1.51282
1.51391
1.51379
1.51295
1.51277
1.51291
1.51218
1.51148
1.51082
1.51079
1.51145
1.51141
1.51074
1.51071
1.51138
1.51205
1.51211
1.5121
1.5127
1.5138
1.51369
1.51283
1.51265
1.51279
1.51205
1.51134
1.51067
1.51064
1.51131
1.51128
1.5106
1.51056
1.51124
1.51192
1.51199
1.51198
1.51258
1.5137
1.51359
1.51272
1.51254
1.51269
1.51193
1.51121
1.51052
1.51049
1.51118
1.51114
1.51045
1.51042
1.51111
1.5118
1.51187
1.51186
1.51247
1.5136
1.5135
1.51261
1.51243
1.51258
1.51181
1.51107
1.51038
1.51034
1.51104
1.51101
1.5103
1.51026
1.51097
1.51168
1.51175
1.51174
1.51237
1.51351
1.5134
1.51251
1.51232
1.51247
1.51169
1.51094
1.51022
1.51019
1.5109
1.51087
1.51015
1.51011
1.51083
1.51156
1.51163
1.51162
1.51226
1.51341
1.51331
1.5124
1.51221
1.51236
1.51157
1.5108
1.51007
1.51003
1.51076
1.51073
1.50998
1.50994
1.51069
1.51143
1.5115
1.51149
1.51214
1.51332
1.51322
1.51229
1.51209
1.51225
1.51143
1.51065
1.5099
1.50986
1.51061
1.51057
1.50981
1.50977
1.51053
1.51129
1.51136
1.51135
1.51202
1.51322
1.51311
1.51217
1.51197
1.51212
1.51129
1.51049
1.50972
1.50967
1.51044
1.5104
1.50962
1.50957
1.51035
1.51113
1.51121
1.5112
1.51189
1.51311
1.51299
1.51203
1.51183
1.51198
1.51113
1.51031
1.50952
1.50947
1.51026
1.51022
1.50942
1.50936
1.51017
1.51097
1.51105
1.51105
1.51175
1.51298
1.51286
1.51189
1.51167
1.51183
1.51096
1.51012
1.50931
1.50925
1.51007
1.51002
1.50919
1.50914
1.50996
1.51078
1.51087
1.51087
1.51159
1.51285
1.5127
1.51173
1.51151
1.51166
1.51077
1.50991
1.50907
1.50901
1.50985
1.50979
1.50895
1.50888
1.50973
1.51057
1.51067
1.51068
1.51141
1.51269
1.51253
1.51154
1.51131
1.51147
1.51056
1.50967
1.50881
1.50874
1.5096
1.50954
1.50866
1.50859
1.50946
1.51033
1.51044
1.51045
1.5112
1.51252
1.51233
1.51133
1.51109
1.51123
1.51031
1.5094
1.50851
1.50842
1.50931
1.50924
1.50834
1.50825
1.50916
1.51005
1.51017
1.51019
1.51095
1.5123
1.51209
1.51108
1.51082
1.51096
1.51002
1.50908
1.50816
1.50807
1.50899
1.50891
1.50797
1.50787
1.50881
1.50972
1.50986
1.50988
1.51067
1.51205
1.51181
1.51079
1.51052
1.51065
1.50969
1.50872
1.50777
1.50766
1.50861
1.50852
1.50755
1.50744
1.50841
1.50935
1.5095
1.50954
1.51034
1.51175
1.51149
1.51045
1.51017
1.5103
1.50931
1.50831
1.50732
1.5072
1.50819
1.50808
1.50708
1.50695
1.50796
1.50893
1.5091
1.50914
1.50996
1.51141
1.51112
1.51007
1.50977
1.50989
1.50888
1.50784
1.50682
1.50668
1.50771
1.50759
1.50654
1.5064
1.50745
1.50845
1.50864
1.50869
1.50953
1.51102
1.5107
1.50963
1.50932
1.50943
1.50839
1.50732
1.50625
1.50609
1.50716
1.50703
1.50594
1.50578
1.50687
1.50791
1.50812
1.50818
1.50905
1.51057
1.51021
1.50913
1.5088
1.50891
1.50784
1.50673
1.50561
1.50544
1.50656
1.5064
1.50526
1.50508
1.50623
1.5073
1.50753
1.50761
1.5085
1.51005
1.50966
1.50857
1.50822
1.50832
1.50722
1.50606
1.50489
1.5047
1.50587
1.5057
1.5045
1.50429
1.5055
1.50662
1.50688
1.50696
1.50788
1.50947
1.50904
1.50794
1.50756
1.50765
1.50653
1.50532
1.50408
1.50387
1.50511
1.50492
1.50365
1.50342
1.5047
1.50586
1.50613
1.50624
1.50718
1.50881
1.50833
1.50723
1.50682
1.5069
1.50574
1.50449
1.50318
1.50294
1.50425
1.50404
1.50269
1.50244
1.5038
1.505
1.5053
1.50543
1.50639
1.50806
1.50753
1.50643
1.50599
1.50605
1.50487
1.50357
1.50218
1.50191
1.50331
1.50307
1.50164
1.50136
1.5028
1.50405
1.50438
1.50452
1.50551
1.50722
1.50663
1.50552
1.50505
1.50509
1.50389
1.50254
1.50107
1.50077
1.50225
1.50199
1.50046
1.50015
1.50169
1.50298
1.50334
1.50351
1.50452
1.50626
1.50561
1.50451
1.504
1.50403
1.5028
1.5014
1.49983
1.4995
1.50108
1.50079
1.49917
1.49883
1.50046
1.50179
1.50219
1.50239
1.50341
1.50518
1.50447
1.50338
1.50282
1.50283
1.50158
1.50014
1.49847
1.49811
1.49979
1.49946
1.49774
1.49736
1.49909
1.50046
1.5009
1.50113
1.50216
1.50397
1.50318
1.50211
1.50149
1.50148
1.50021
1.49875
1.49698
1.49658
1.49835
1.49799
1.49617
1.49576
1.49758
1.49896
1.49945
1.49972
1.50075
1.50259
1.50172
1.50068
1.5
1.49995
1.49867
1.49719
1.49533
1.49489
1.49675
1.49633
1.49445
1.49399
1.49588
1.49726
1.49781
1.49813
1.49916
1.50104
1.50007
1.49906
1.49829
1.4982
1.49692
1.49543
1.49352
1.49303
1.49494
1.49447
1.49254
1.49203
1.49395
1.49533
1.49594
1.49632
1.49735
1.49928
1.49819
1.49719
1.49636
1.4962
1.49491
1.49345
1.49152
1.49098
1.49289
1.49235
1.49043
1.48986
1.49175
1.49311
1.4938
1.49425
1.49529
1.49727
1.49605
1.49506
1.49416
1.49391
1.49261
1.49117
1.48928
1.48867
1.49053
1.4899
1.48805
1.4874
1.48922
1.49056
1.49133
1.49187
1.49293
1.49498
1.49361
1.49261
1.49164
1.49129
1.48997
1.48854
1.48674
1.48605
1.48781
1.48708
1.48533
1.48459
1.48629
1.48761
1.48849
1.48913
1.49023
1.49237
1.49083
1.4898
1.48874
1.48828
1.48691
1.4855
1.48381
1.48301
1.48465
1.48379
1.48217
1.48129
1.48288
1.48422
1.48521
1.48597
1.48713
1.48939
1.48765
1.48659
1.48542
1.48484
1.48339
1.48196
1.48038
1.47942
1.48097
1.47997
1.47842
1.47737
1.4789
1.48029
1.48142
1.48232
1.48356
1.48598
1.48401
1.48291
1.48159
1.48086
1.47931
1.47782
1.47627
1.47512
1.47667
1.4755
1.47393
1.47269
1.47426
1.47575
1.47704
1.4781
1.47945
1.48204
1.47985
1.47866
1.47718
1.47631
1.4746
1.473
1.4714
1.47005
1.47167
1.4703
1.46865
1.46717
1.46885
1.47046
1.47195
1.47321
1.47472
1.47759
1.47499
1.47374
1.47205
1.47094
1.46904
1.46734
1.46562
1.464
1.46576
1.46409
1.46232
1.46042
1.4622
1.46387
1.46577
1.4674
1.46907
1.47225
1.46901
1.46777
1.46562
1.464
1.46184
1.46
1.45802
1.45513
1.45751
1.45494
1.45224
1.45022
1.45254
1.45488
1.45729
1.45954
1.46156
1.46543
1.46144
1.45973
1.45725
1.45522
1.45262
1.45074
1.44934
1.44734
1.44888
1.44684
1.44531
1.44267
1.44432
1.44614
1.44853
1.45055
1.45274
1.45731
1.45304
1.45074
1.44835
1.44613
1.44374
1.44173
1.43994
1.43681
1.43882
1.4358
1.43352
1.43039
1.43298
1.43584
1.43838
1.4411
1.44379
1.44876
1.44413
1.4412
1.43911
1.43648
1.43334
1.43025
1.42734
1.42457
1.42773
1.42499
1.4215
1.41888
1.42298
1.4273
1.42882
1.43096
1.4345
1.44041
1.43911
1.43326
1.43213
1.43204
1.42737
1.42265
1.41818
1.41845
1.42296
1.42374
1.41922
1.42111
1.42549
1.42994
1.42826
1.42756
1.43282
1.44001
1.441
1.43289
1.4348
1.436
1.43205
1.42783
1.42356
1.426
1.43015
1.43375
1.43026
1.4339
1.43089
1.4349
1.43883
1.44346
1.44751
1.44527
1.44884
1.45278
1.45487
1.45125
1.45375
1.45011
1.44592
1.44148
1.43765
1.44027
1.43696
1.44018
1.43726
1.43429
1.43866
1.44406
1.44859
1.44046
1.44412
1.44654
1.44286
1.44572
1.44381
1.44788
1.45419
1.45331
1.45576
1.4607
1.46016
1.45726
1.46032
1.45837
1.45652
1.45485
1.45821
1.4599
1.4616
1.46512
1.46362
1.46202
1.4659
1.46443
1.46795
1.47188
1.47319
1.46953
1.47107
1.46742
1.46881
1.47224
1.47725
1.47672
1.4747
1.47797
1.47681
1.47577
1.47502
1.47857
1.48216
1.48156
1.48457
1.48536
1.48838
1.48757
1.4908
1.49022
1.49352
1.49684
1.49649
1.49956
1.5026
1.50251
1.5053
1.50816
1.50793
1.51065
1.5135
1.51354
1.5162
1.51887
1.51898
1.5212
1.52352
1.52353
1.52588
1.52586
1.52811
1.52822
1.53049
1.53051
1.53067
1.53289
1.53519
1.53545
1.53735
1.53726
1.53724
1.53509
1.53281
1.5327
1.535
1.53726
1.53915
1.53912
1.53915
1.53926
1.53943
1.54136
1.54159
1.54339
1.54539
1.54566
1.54749
1.54937
1.54958
1.55138
1.55174
1.55326
1.55486
1.55506
1.55671
1.55694
1.55847
1.56008
1.56027
1.56187
1.56223
1.56362
1.56505
1.56533
1.56675
1.56703
1.56828
1.56961
1.56976
1.57112
1.57139
1.57267
1.57401
1.57427
1.57564
1.57597
1.57716
1.57831
1.57856
1.57962
1.57984
1.58094
1.58117
1.58223
1.58337
1.58358
1.58479
1.58509
1.58613
1.58589
1.58689
1.58716
1.58745
1.58843
1.58867
1.58965
1.58991
1.59082
1.59177
1.59199
1.59295
1.59314
1.59414
1.59439
1.59528
1.59508
1.59593
1.59615
1.59639
1.59723
1.59745
1.59829
1.59854
1.59933
1.60015
1.60037
1.60119
1.60137
1.60223
1.60246
1.60324
1.60304
1.60379
1.60402
1.60428
1.60503
1.60528
1.60598
1.60618
1.6069
1.60712
1.60779
1.6085
1.6087
1.60941
1.6096
1.6103
1.61047
1.6112
1.61142
1.61206
1.61187
1.61168
1.611
1.6108
1.6101
1.60989
1.60919
1.60897
1.60829
1.6076
1.60739
1.60669
1.60647
1.60575
1.6055
1.60477
1.60452
1.60425
1.60359
1.60284
1.60202
1.6018
1.60097
1.60071
1.5999
1.59911
1.59886
1.59805
1.59781
1.59699
1.59675
1.5965
1.59575
1.59489
1.59393
1.59372
1.59274
1.59249
1.59154
1.59061
1.59036
1.5894
1.58912
1.58815
1.58786
1.58754
1.58666
1.58566
1.58454
1.58429
1.58314
1.58204
1.58178
1.58069
1.58043
1.57939
1.57918
1.5781
1.57691
1.57665
1.57535
1.57506
1.57375
1.57244
1.57219
1.57092
1.57075
1.56947
1.56811
1.56788
1.56647
1.56614
1.56474
1.56333
1.56302
1.5616
1.56142
1.55995
1.55834
1.55815
1.55651
1.55627
1.55465
1.55302
1.55276
1.55113
1.55095
1.54924
1.54734
1.54714
1.54518
1.54326
1.54307
1.54117
1.54099
1.54289
1.54472
1.54494
1.5468
1.54875
1.54911
1.55086
1.55143
1.55213
1.55247
1.55415
1.55442
1.55604
1.55753
1.55786
1.55951
1.55982
1.56134
1.56188
1.56237
1.5627
1.56413
1.56444
1.56581
1.56554
1.5675
1.56484
1.56422
1.56373
1.5636
1.56281
1.56162
1.55853
1.55893
1.55586
1.55525
1.5545
1.55378
1.55795
1.55723
1.55617
1.55088
1.55116
1.54737
1.54457
1.54265
1.5408
1.54061
1.54019
1.53706
1.53479
1.53257
1.53054
1.52834
1.52594
1.52595
1.52348
1.52123
1.52132
1.51897
1.5163
1.51637
1.51355
1.5109
1.51119
1.50851
1.50559
1.50579
1.50277
1.4999
1.50034
1.49739
1.49415
1.49469
1.49139
1.49198
1.4892
1.48621
1.48289
1.47936
1.48015
1.48359
1.48704
1.48758
1.48404
1.48104
1.48253
1.48332
1.47907
1.48923
1.48474
1.489
1.49367
1.48994
1.49301
1.49546
1.49496
1.49831
1.49801
1.50079
1.50369
1.50348
1.50297
1.50579
1.50897
1.50888
1.5115
1.51384
1.50902
1.5087
1.50573
1.51017
1.51163
1.5012
1.49983
1.49919
1.50491
1.4949
1.49664
1.50559
1.50421
1.49484
1.48584
1.48153
1.48428
1.47371
1.46833
1.46642
1.46344
1.46609
1.46881
1.46216
1.47346
1.45874
1.45394
1.45033
1.46187
1.47653
1.46685
1.46829
1.45192
1.44992
1.4638
1.44854
1.44757
1.46238
1.44913
1.44946
1.46237
1.45399
1.45786
1.46648
1.46187
1.46553
1.47377
1.46942
1.47238
1.47974
1.47571
1.47793
1.48422
1.48073
1.48245
1.48789
1.48496
1.48634
1.49112
1.48856
1.48973
1.49405
1.49175
1.49273
1.49669
1.49456
1.49538
1.49903
1.49704
1.49771
1.50112
1.49923
1.49977
1.50298
1.50114
1.50158
1.50463
1.50284
1.50318
1.5061
1.50434
1.5046
1.50741
1.50568
1.50586
1.50858
1.50687
1.50698
1.50962
1.50792
1.50798
1.51054
1.50885
1.50889
1.51136
1.50966
1.50967
1.51208
1.51039
1.51037
1.51272
1.51102
1.51099
1.51328
1.51159
1.51153
1.51378
1.51208
1.512
1.5142
1.51251
1.51241
1.51457
1.51289
1.51277
1.51489
1.51321
1.51307
1.51516
1.51349
1.51334
1.51539
1.51373
1.51357
1.51558
1.51392
1.51376
1.51573
1.51408
1.51392
1.51586
1.51421
1.51405
1.51597
1.51433
1.51417
1.51606
1.51444
1.51427
1.51614
1.51454
1.51436
1.5162
1.51462
1.51444
1.51626
1.5147
1.51452
1.51632
1.51477
1.51459
1.51637
1.51485
1.51467
1.51643
1.51493
1.51476
1.5165
1.51501
1.51485
1.51658
1.51511
1.51495
1.51666
1.51521
1.51506
1.51675
1.51532
1.51518
1.51686
1.51545
1.51532
1.51699
1.5156
1.51549
1.51714
1.51578
1.51567
1.51731
1.51597
1.51588
1.51751
1.5162
1.51612
1.51773
1.51645
1.51638
1.51798
1.51673
1.51667
1.51827
1.51704
1.51699
1.51858
1.51738
1.51734
1.51893
1.51775
1.51772
1.51931
1.51815
1.51813
1.51971
1.51858
1.51856
1.52014
1.51903
1.51902
1.52059
1.5195
1.5195
1.52105
1.51998
1.51999
1.52153
1.52048
1.52049
1.52202
1.52099
1.52099
1.52253
1.5215
1.52151
1.52304
1.52202
1.52203
1.52355
1.52254
1.52255
1.52407
1.52306
1.52306
1.52458
1.52358
1.52358
1.5251
1.52409
1.52409
1.52561
1.5246
1.52459
1.52611
1.5251
1.52509
1.52662
1.5256
1.52559
1.52712
1.5261
1.52608
1.52761
1.5266
1.52658
1.52811
1.52709
1.52708
1.52862
1.5276
1.52758
1.52912
1.5281
1.52808
1.52964
1.52862
1.5286
1.53016
1.52914
1.52912
1.5307
1.52968
1.52967
1.53125
1.53023
1.53022
1.53182
1.5308
1.5308
1.53241
1.53139
1.5314
1.53302
1.532
1.53202
1.53366
1.53264
1.53266
1.53432
1.5333
1.53333
1.53501
1.53399
1.53403
1.53573
1.53471
1.53476
1.53648
1.53546
1.53551
1.53726
1.53623
1.53629
1.53806
1.53704
1.5371
1.5389
1.53787
1.53794
1.53976
1.53872
1.5388
1.54065
1.5396
1.53968
1.54157
1.5405
1.54058
1.54252
1.54141
1.5415
1.54347
1.54234
1.54242
1.54448
1.54329
1.54339
1.5455
1.54429
1.54446
1.54667
1.54547
1.54577
1.54806
1.54685
1.54713
1.54963
1.54827
1.54882
1.55194
1.55054
1.55205
1.55516
1.55399
1.55565
1.55518
1.55366
1.55684
1.55642
1.55664
1.55747
1.55545
1.55416
1.55207
1.5536
1.55471
1.55641
1.55806
1.5586
1.55717
1.55562
1.55642
1.55787
1.55917
1.55979
1.55856
1.55716
1.55785
1.55921
1.56039
1.561
1.55986
1.55851
1.55713
1.55646
1.55574
1.55496
1.55409
1.55311
1.55188
1.55029
1.54862
1.55021
1.5489
1.54739
1.5463
1.54773
1.54895
1.55016
1.55147
1.55255
1.55124
1.55002
1.54886
1.54783
1.54663
1.54524
1.54423
1.54559
1.54458
1.54325
1.54231
1.5436
1.54473
1.54571
1.54675
1.54776
1.54671
1.54571
1.54659
1.54761
1.54867
1.54979
1.55096
1.55219
1.5535
1.55434
1.55303
1.5518
1.55256
1.5538
1.5551
1.55579
1.55449
1.55325
1.55207
1.55137
1.55062
1.54949
1.54841
1.54738
1.54811
1.54915
1.55024
1.55093
1.54983
1.54878
1.5494
1.55046
1.55156
1.5527
1.55389
1.55513
1.55643
1.55777
1.55914
1.56047
1.5616
1.56217
1.56106
1.55972
1.56028
1.56162
1.56272
1.56324
1.56214
1.56081
1.5613
1.56264
1.56373
1.5642
1.56312
1.56177
1.56222
1.56357
1.56465
1.56507
1.56399
1.56263
1.56125
1.56084
1.5604
1.55993
1.55944
1.55892
1.55836
1.55702
1.55573
1.55449
1.55504
1.55629
1.55758
1.5581
1.55681
1.55556
1.55435
1.55384
1.55329
1.55214
1.55103
1.54997
1.55049
1.55157
1.55268
1.55318
1.55206
1.55097
1.55142
1.55251
1.55365
1.55482
1.55604
1.55729
1.55859
1.55905
1.55775
1.55648
1.5569
1.55817
1.55948
1.55989
1.55856
1.55728
1.55604
1.55567
1.55526
1.55408
1.55293
1.55183
1.5522
1.55332
1.55447
1.55484
1.55367
1.55254
1.55284
1.55399
1.55517
1.55639
1.55764
1.55893
1.56026
1.56163
1.56303
1.56439
1.56547
1.56585
1.56477
1.56339
1.56374
1.56512
1.5662
1.56654
1.56545
1.56406
1.56437
1.56576
1.56685
1.56715
1.56605
1.56464
1.5649
1.56632
1.56742
1.56767
1.56657
1.56514
1.56368
1.56345
1.5632
1.56293
1.56264
1.56233
1.56199
1.56061
1.55927
1.55797
1.55827
1.55959
1.56094
1.56124
1.55988
1.55855
1.55726
1.55699
1.5567
1.55547
1.55428
1.55312
1.55337
1.55454
1.55575
1.556
1.55478
1.55359
1.55378
1.55499
1.55623
1.5575
1.55881
1.56015
1.56152
1.56178
1.56039
1.55904
1.55925
1.56061
1.56202
1.56223
1.56082
1.55944
1.55808
1.55791
1.55772
1.55643
1.55517
1.55395
1.5541
1.55534
1.55661
1.55677
1.55548
1.55422
1.55432
1.5556
1.5569
1.55824
1.5596
1.561
1.56243
1.56389
1.56536
1.5668
1.56791
1.56812
1.56701
1.56556
1.56575
1.5672
1.56832
1.5685
1.56738
1.56591
1.56606
1.56753
1.56866
1.56881
1.56768
1.5662
1.56632
1.5678
1.56895
1.56907
1.56792
1.56642
1.56487
1.56478
1.56467
1.56454
1.5644
1.56425
1.56408
1.56261
1.56116
1.55975
1.55989
1.56131
1.56277
1.56291
1.56144
1.56
1.55859
1.55849
1.55837
1.55702
1.5557
1.55441
1.55447
1.55578
1.55712
1.5572
1.55585
1.55452
1.55455
1.5559
1.55727
1.55867
1.5601
1.56156
1.56304
1.56315
1.56166
1.56019
1.56026
1.56174
1.56325
1.56334
1.56182
1.56032
1.55885
1.5588
1.55874
1.55733
1.55593
1.55457
1.55458
1.55596
1.55737
1.5574
1.55597
1.55457
1.55456
1.55598
1.55742
1.55888
1.56037
1.56188
1.56341
1.56496
1.56651
1.56802
1.56917
1.56927
1.56811
1.5666
1.56667
1.56818
1.56935
1.56942
1.56825
1.56673
1.56678
1.5683
1.56948
1.56953
1.56835
1.56682
1.56686
1.56839
1.56957
1.56961
1.56842
1.56688
1.56528
1.56526
1.56523
1.56519
1.56515
1.56509
1.56503
1.56347
1.56193
1.56041
1.56044
1.56197
1.56353
1.56357
1.56201
1.56046
1.55894
1.55893
1.55891
1.55743
1.55597
1.55454
1.55451
1.55596
1.55743
1.55743
1.55594
1.55448
1.55444
1.55592
1.55742
1.55894
1.56048
1.56203
1.56361
1.56363
1.56205
1.56049
1.5605
1.56207
1.56366
1.56367
1.56208
1.5605
1.55893
1.55894
1.55894
1.55741
1.5559
1.5544
1.55436
1.55587
1.5574
1.55738
1.55584
1.55432
1.55428
1.55581
1.55736
1.55892
1.5605
1.56209
1.56369
1.5653
1.56691
1.56845
1.56964
1.56966
1.56847
1.56693
1.56694
1.56849
1.56968
1.56971
1.56851
1.56697
1.56699
1.56854
1.56974
1.56977
1.56856
1.56701
1.567
1.56855
1.56977
1.56539
1.56538
1.56537
1.56535
1.56533
1.56531
1.5637
1.56209
1.5605
1.56049
1.56209
1.56371
1.56372
1.5621
1.56049
1.55889
1.5589
1.55891
1.55734
1.55579
1.55425
1.55422
1.55576
1.55733
1.55731
1.55574
1.55419
1.55417
1.55573
1.5573
1.55889
1.56049
1.5621
1.56373
1.56374
1.56211
1.56049
1.5605
1.56212
1.56376
1.55889
1.55889
1.55729
1.55571
1.55415
1.55414
1.55571
1.55729
1.5526
1.55261
1.55263
1.55266
1.55269
1.55273
1.55278
1.55283
1.55288
1.55293
1.55298
1.55304
1.55308
1.55313
1.55317
1.5532
1.55322
1.55323
1.55323
1.55322
1.55319
1.55315
1.55308
1.553
1.5529
1.55277
1.55262
1.55244
1.55223
1.552
1.55174
1.55144
1.55112
1.55076
1.55036
1.54993
1.54945
1.54894
1.54838
1.54777
1.54711
1.5464
1.54561
1.54474
1.54378
1.54267
1.54139
1.54051
1.54177
1.54091
1.53966
1.53884
1.54008
1.54114
1.54199
1.54286
1.54382
1.54293
1.54208
1.54126
1.54034
1.53928
1.53805
1.53729
1.53851
1.53778
1.53656
1.53587
1.53707
1.53811
1.53882
1.53956
1.54048
1.53973
1.53902
1.53982
1.54055
1.5413
1.54209
1.54292
1.54378
1.54467
1.54545
1.54454
1.54367
1.54436
1.54524
1.54616
1.54681
1.54588
1.54499
1.54414
1.54352
1.54284
1.54204
1.54128
1.54054
1.5412
1.54194
1.54271
1.54333
1.54254
1.54179
1.54107
1.54049
1.53984
1.53912
1.53833
1.53743
1.5364
1.5352
1.53455
1.53575
1.53512
1.53393
1.53334
1.53452
1.53554
1.53614
1.53677
1.53766
1.53703
1.53641
1.53582
1.53495
1.53394
1.53276
1.53221
1.53338
1.53283
1.53166
1.53113
1.53229
1.53329
1.53383
1.53438
1.53525
1.53469
1.53414
1.53489
1.53544
1.53601
1.53659
1.53719
1.53781
1.53845
1.53916
1.53851
1.53788
1.53851
1.53914
1.5398
1.54038
1.53971
1.53907
1.53845
1.53789
1.53728
1.53669
1.53612
1.53556
1.53615
1.53672
1.5373
1.53784
1.53726
1.53668
1.53716
1.53773
1.53833
1.53894
1.53957
1.54022
1.5409
1.5416
1.54233
1.54309
1.54388
1.54471
1.54557
1.54647
1.5474
1.54795
1.54701
1.5461
1.54658
1.5475
1.54846
1.54892
1.54795
1.54702
1.54613
1.5457
1.54523
1.54439
1.54359
1.54282
1.54326
1.54404
1.54486
1.54527
1.54445
1.54366
1.54401
1.54481
1.54565
1.54652
1.54742
1.54836
1.54934
1.54973
1.54874
1.54778
1.54811
1.54907
1.55008
1.55039
1.54937
1.54839
1.54745
1.54718
1.54687
1.54599
1.54514
1.54432
1.54459
1.54542
1.54628
1.54654
1.54567
1.54482
1.54401
1.54379
1.54354
1.54324
1.5429
1.54251
1.54208
1.54137
1.54068
1.54002
1.54042
1.54109
1.54179
1.54216
1.54146
1.54077
1.54012
1.53977
1.53938
1.53876
1.53816
1.53757
1.53794
1.53853
1.53914
1.53948
1.53886
1.53826
1.53853
1.53914
1.53977
1.54041
1.54108
1.54178
1.54249
1.54278
1.54205
1.54135
1.54157
1.54229
1.54303
1.54323
1.54248
1.54176
1.54106
1.54088
1.54067
1.54001
1.53938
1.53876
1.53895
1.53957
1.54022
1.54038
1.53973
1.5391
1.53848
1.53834
1.53816
1.53794
1.53767
1.53736
1.537
1.53659
1.53613
1.5356
1.53501
1.53435
1.53361
1.53276
1.53177
1.53061
1.5301
1.53125
1.53074
1.5296
1.52909
1.53023
1.53121
1.53172
1.53224
1.53308
1.53256
1.53204
1.53153
1.5307
1.52973
1.52859
1.52809
1.52922
1.52872
1.52759
1.52708
1.52821
1.52918
1.52969
1.53019
1.53102
1.53052
1.53001
1.53074
1.53125
1.53175
1.53226
1.53278
1.5333
1.53382
1.53448
1.53395
1.53343
1.534
1.53453
1.53506
1.53558
1.53504
1.53451
1.53399
1.53348
1.53291
1.5324
1.53189
1.53138
1.53195
1.53246
1.53297
1.53347
1.53296
1.53246
1.53196
1.53146
1.53088
1.53024
1.52951
1.52867
1.5277
1.52657
1.52606
1.52719
1.52669
1.52555
1.52504
1.52618
1.52717
1.52767
1.52817
1.529
1.52851
1.52801
1.52753
1.52667
1.52568
1.52453
1.52403
1.52519
1.5247
1.52353
1.52305
1.52423
1.52525
1.52572
1.52619
1.52705
1.52658
1.52613
1.52692
1.52736
1.52781
1.52828
1.52876
1.52924
1.52974
1.53039
1.5299
1.52942
1.53
1.53048
1.53096
1.53148
1.531
1.53053
1.53008
1.52954
1.52895
1.52849
1.52804
1.52762
1.52825
1.52866
1.52909
1.52964
1.52922
1.52883
1.52935
1.52973
1.53013
1.53056
1.531
1.53146
1.53193
1.53241
1.53291
1.53341
1.53392
1.53444
1.53496
1.53549
1.53604
1.53644
1.53589
1.53536
1.5357
1.53624
1.5368
1.5371
1.53654
1.536
1.53547
1.53517
1.53483
1.53431
1.5338
1.5333
1.53364
1.53414
1.53465
1.53495
1.53444
1.53394
1.5342
1.53469
1.5352
1.53572
1.53625
1.5368
1.53736
1.53758
1.53701
1.53646
1.53663
1.53719
1.53775
1.53789
1.53732
1.53677
1.53623
1.5361
1.53593
1.53541
1.5349
1.53442
1.5346
1.53508
1.53558
1.53571
1.53522
1.53474
1.53429
1.53414
1.53395
1.53372
1.53346
1.53316
1.53281
1.53233
1.53187
1.53142
1.53179
1.53223
1.53268
1.53299
1.53255
1.53212
1.53172
1.53137
1.53099
1.53058
1.53019
1.52983
1.53026
1.53061
1.53098
1.53134
1.53098
1.53066
1.53102
1.53132
1.53166
1.53202
1.53241
1.53283
1.53327
1.5335
1.53307
1.53267
1.5329
1.53328
1.5337
1.53387
1.53347
1.53309
1.53275
1.53254
1.5323
1.53195
1.53163
1.53134
1.53164
1.53191
1.53221
1.53243
1.53215
1.5319
1.53168
1.5314
1.53108
1.53074
1.53036
1.52995
1.5295
1.529
1.52846
1.52787
1.52722
1.5265
1.5257
1.52481
1.52377
1.52258
1.52213
1.52333
1.52291
1.5217
1.52129
1.52252
1.5236
1.52398
1.52438
1.52529
1.52491
1.52455
1.52421
1.52325
1.52215
1.5209
1.52054
1.52182
1.52151
1.52021
1.51992
1.52123
1.52238
1.52264
1.52293
1.52391
1.52364
1.52341
1.52433
1.52455
1.5248
1.52508
1.52539
1.52574
1.52611
1.52684
1.52649
1.52617
1.52687
1.52717
1.52751
1.52812
1.52781
1.52752
1.52727
1.5266
1.52587
1.52561
1.52538
1.52519
1.52598
1.52615
1.52636
1.52706
1.52687
1.52672
1.52659
1.52584
1.52502
1.52415
1.5232
1.52216
1.52099
1.51965
1.51941
1.52077
1.52058
1.5192
1.51902
1.52042
1.52165
1.52179
1.52196
1.52302
1.52287
1.52275
1.52264
1.52153
1.52029
1.51887
1.51874
1.52018
1.52009
1.51863
1.51854
1.52002
1.52131
1.52136
1.52144
1.52258
1.52253
1.5225
1.5236
1.52361
1.52363
1.52367
1.52375
1.52386
1.52399
1.52489
1.52477
1.52468
1.52556
1.52562
1.52572
1.52648
1.52641
1.52639
1.52639
1.52554
1.52463
1.52461
1.52461
1.52461
1.52555
1.52554
1.52553
1.5264
1.52641
1.52645
1.5273
1.52724
1.5272
1.52718
1.52717
1.52717
1.5272
1.52729
1.5274
1.52753
1.5277
1.5279
1.52812
1.52839
1.52868
1.52919
1.52892
1.52868
1.52919
1.52941
1.52967
1.5301
1.52987
1.52967
1.5295
1.52901
1.52847
1.5283
1.52815
1.52804
1.52862
1.52873
1.52885
1.52937
1.52925
1.52916
1.52969
1.52973
1.52984
1.52996
1.5301
1.53028
1.5305
1.53086
1.53067
1.53051
1.53088
1.53102
1.53119
1.53149
1.53134
1.53122
1.53111
1.53076
1.53038
1.53027
1.5302
1.53019
1.53067
1.53065
1.53067
1.53106
1.53107
1.5311
1.53113
1.5307
1.53022
1.5297
1.52914
1.52855
1.52794
1.52789
1.52788
1.5279
1.52858
1.52855
1.52854
1.52915
1.52918
1.52921
1.52927
1.52861
1.52792
1.52796
1.52802
1.5281
1.52886
1.52876
1.52867
1.52935
1.52946
1.52958
1.53026
1.53012
1.52999
1.52989
1.5298
1.52975
1.52972
1.53025
1.53029
1.53037
1.5309
1.5308
1.53073
1.53119
1.53128
1.5314
1.53154
1.53102
1.53047
1.53059
1.53074
1.5309
1.5315
1.53132
1.53116
1.53169
1.53187
1.53207
1.53228
1.5317
1.53108
1.53042
1.52972
1.52898
1.52821
1.52738
1.52651
1.52559
1.52462
1.52359
1.52249
1.52128
1.51996
1.51846
1.5184
1.51992
1.51988
1.51835
1.5183
1.51986
1.52123
1.52124
1.52126
1.52248
1.52248
1.52249
1.5225
1.52123
1.51984
1.51826
1.51822
1.51982
1.5198
1.51819
1.51814
1.51978
1.52122
1.52123
1.52123
1.52253
1.52254
1.52255
1.52381
1.52378
1.52373
1.52369
1.52365
1.52362
1.5236
1.52465
1.52469
1.52474
1.52578
1.52571
1.52564
1.52658
1.52667
1.52676
1.52686
1.52586
1.5248
1.52486
1.52493
1.525
1.52611
1.52603
1.52594
1.52696
1.52707
1.52718
1.52728
1.5262
1.52505
1.52383
1.52256
1.52121
1.51975
1.5181
1.51803
1.51971
1.51966
1.51796
1.51787
1.51959
1.52112
1.52117
1.5212
1.52257
1.52256
1.52254
1.52249
1.52105
1.5195
1.51776
1.51762
1.51938
1.51923
1.51744
1.51723
1.51905
1.52068
1.52084
1.52096
1.52243
1.52234
1.52221
1.52367
1.52376
1.52382
1.52386
1.52388
1.52387
1.52385
1.52509
1.52512
1.52515
1.52636
1.52632
1.52627
1.52738
1.52748
1.52754
1.5276
1.5264
1.52516
1.52515
1.52512
1.52507
1.52641
1.52643
1.52643
1.52764
1.52768
1.5277
1.52894
1.52888
1.52883
1.52876
1.52867
1.52856
1.52844
1.52832
1.52819
1.52806
1.52794
1.52781
1.52769
1.52758
1.52747
1.52832
1.52844
1.52858
1.52942
1.52926
1.52912
1.52987
1.53004
1.53021
1.53039
1.52958
1.52872
1.52886
1.52901
1.52916
1.53009
1.52992
1.52974
1.53058
1.53077
1.53097
1.5318
1.53159
1.53137
1.53117
1.53097
1.53077
1.53059
1.53127
1.53147
1.53168
1.53235
1.53212
1.5319
1.5325
1.53274
1.53299
1.53324
1.53259
1.5319
1.53213
1.53236
1.53259
1.53334
1.53309
1.53284
1.53351
1.53378
1.53405
1.53433
1.5336
1.53283
1.53202
1.53116
1.53026
1.52931
1.52946
1.5296
1.52973
1.53075
1.53059
1.53043
1.53135
1.53154
1.53173
1.5319
1.5309
1.52986
1.52997
1.53006
1.53013
1.53129
1.53117
1.53104
1.53207
1.53223
1.53238
1.53343
1.53325
1.53306
1.53286
1.53266
1.53245
1.53223
1.53307
1.53331
1.53354
1.53438
1.53412
1.53386
1.53461
1.53489
1.53518
1.53546
1.53464
1.53377
1.534
1.53422
1.53443
1.53539
1.53514
1.53489
1.53574
1.53602
1.5363
1.53716
1.53685
1.53654
1.53623
1.53593
1.53562
1.53532
1.53502
1.53472
1.53443
1.53414
1.53386
1.53358
1.53332
1.53307
1.53283
1.5326
1.53239
1.53219
1.53202
1.53186
1.53173
1.53162
1.53154
1.5315
1.53146
1.53143
1.53144
1.53152
1.53163
1.53177
1.53193
1.53213
1.53237
1.53263
1.53293
1.53326
1.53362
1.534
1.53442
1.53486
1.53533
1.53582
1.53633
1.53686
1.53742
1.53799
1.53859
1.53921
1.53984
1.54051
1.54119
1.5419
1.54264
1.5434
1.5442
1.54502
1.54587
1.54676
1.54769
1.54864
1.54964
1.55067
1.55092
1.54987
1.54886
1.54905
1.55007
1.55114
1.55132
1.55024
1.5492
1.5482
1.54806
1.54789
1.54695
1.54605
1.54518
1.5453
1.54619
1.54711
1.54723
1.5463
1.5454
1.54546
1.54637
1.54732
1.54831
1.54933
1.55039
1.55148
1.55162
1.55051
1.54943
1.5495
1.5506
1.55173
1.55181
1.55066
1.54955
1.54848
1.54844
1.54839
1.54739
1.54642
1.54549
1.54549
1.54644
1.54742
1.54744
1.54644
1.54547
1.54455
1.54458
1.54459
1.54458
1.54453
1.54445
1.54434
1.54353
1.54276
1.54201
1.54208
1.54284
1.54363
1.5437
1.5429
1.54212
1.54138
1.54135
1.54129
1.5406
1.53993
1.53928
1.53932
1.53997
1.54065
1.54067
1.53999
1.53933
1.53931
1.53997
1.54066
1.54138
1.54213
1.54292
1.54373
1.54373
1.54291
1.54211
1.54206
1.54287
1.54371
1.54366
1.5428
1.54199
1.5412
1.54129
1.54135
1.54062
1.53992
1.53925
1.53918
1.53985
1.54055
1.54046
1.53975
1.53907
1.53894
1.53962
1.54034
1.54109
1.54188
1.54271
1.54358
1.54448
1.54543
1.54641
1.54743
1.54848
1.54958
1.55071
1.55188
1.55192
1.55073
1.54958
1.54957
1.55074
1.55195
1.55196
1.55073
1.54954
1.54839
1.54844
1.54847
1.54739
1.54636
1.54536
1.54527
1.54629
1.54734
1.54727
1.5462
1.54517
1.54505
1.5461
1.54719
1.54832
1.54949
1.5507
1.55195
1.55193
1.55066
1.54943
1.54936
1.55061
1.5519
1.55186
1.55055
1.54928
1.54805
1.54815
1.54824
1.54709
1.54598
1.54491
1.54476
1.54585
1.54698
1.54686
1.54571
1.54461
1.54355
1.54372
1.54389
1.54404
1.54418
1.5443
1.5444
1.54348
1.5426
1.54176
1.54162
1.54247
1.54336
1.54323
1.54232
1.54146
1.54064
1.54081
1.54096
1.5402
1.53948
1.53879
1.53863
1.53931
1.54004
1.53986
1.53913
1.53844
1.53824
1.53893
1.53967
1.54045
1.54128
1.54215
1.54307
1.54291
1.54198
1.54109
1.54089
1.54179
1.54273
1.54255
1.54159
1.54068
1.53983
1.54004
1.54025
1.53946
1.53872
1.53803
1.53781
1.5385
1.53925
1.53903
1.53828
1.53758
1.53694
1.53717
1.53739
1.5376
1.5378
1.53798
1.53815
1.5383
1.53843
1.53854
1.53862
1.53867
1.5387
1.5387
1.53866
1.53806
1.53748
1.53693
1.53696
1.53751
1.53809
1.53809
1.53752
1.53696
1.53644
1.53643
1.5364
1.53589
1.5354
1.53494
1.535
1.53545
1.53593
1.53594
1.53547
1.53503
1.53504
1.53547
1.53593
1.53642
1.53694
1.53749
1.53807
1.53801
1.53743
1.53689
1.53681
1.53735
1.53793
1.53782
1.53725
1.53671
1.53621
1.5363
1.53637
1.53589
1.53544
1.53503
1.535
1.53539
1.53583
1.53575
1.53533
1.53494
1.5346
1.53463
1.53465
1.53465
1.53463
1.53458
1.53451
1.53411
1.53374
1.5334
1.53351
1.53384
1.5342
1.53426
1.53391
1.53361
1.53333
1.53322
1.53309
1.53281
1.53256
1.53235
1.53253
1.53273
1.53296
1.53309
1.53288
1.5327
1.53285
1.533
1.53319
1.53342
1.53368
1.53397
1.53429
1.53431
1.534
1.53373
1.53376
1.53402
1.53431
1.53429
1.53402
1.53378
1.53358
1.53354
1.53349
1.53328
1.53311
1.53297
1.53308
1.5332
1.53336
1.53341
1.53328
1.53316
1.53323
1.53333
1.53345
1.5336
1.53378
1.534
1.53425
1.53454
1.53487
1.53524
1.53565
1.5361
1.53659
1.53712
1.53769
1.53754
1.53698
1.53646
1.5363
1.53682
1.53738
1.5372
1.53664
1.53614
1.53568
1.53583
1.53597
1.53554
1.53514
1.53479
1.53469
1.53503
1.53541
1.53527
1.5349
1.53458
1.53446
1.53477
1.53511
1.53551
1.53596
1.53645
1.537
1.5368
1.53626
1.53577
1.53558
1.53605
1.53658
1.53636
1.53584
1.53538
1.53497
1.53516
1.53534
1.53496
1.53462
1.53434
1.5342
1.53447
1.53479
1.53462
1.53431
1.53406
1.53385
1.53397
1.53409
1.5342
1.53431
1.5344
1.53448
1.53421
1.53397
1.53377
1.53375
1.53393
1.53414
1.53407
1.53387
1.53371
1.53358
1.5336
1.53361
1.53347
1.53336
1.5333
1.53337
1.53339
1.53347
1.53346
1.53342
1.53343
1.53347
1.53345
1.53346
1.53353
1.53366
1.53381
1.53399
1.53389
1.53373
1.53359
1.53351
1.53364
1.53379
1.53368
1.53353
1.53343
1.53341
1.53345
1.53348
1.53345
1.53346
1.53349
1.53349
1.53346
1.53344
1.53342
1.53345
1.53348
1.53347
1.53341
1.53339
1.53336
1.53337
1.53342
1.53356
1.53372
1.53391
1.53415
1.53444
1.53479
1.53518
1.53563
1.53614
1.53672
1.53735
1.53805
1.5388
1.53961
1.54047
1.54139
1.54236
1.54338
1.54445
1.54557
1.54673
1.54794
1.54919
1.55048
1.55181
1.55175
1.55041
1.5491
1.549
1.55033
1.55169
1.55162
1.55024
1.5489
1.54759
1.54771
1.54783
1.5466
1.54542
1.54428
1.54412
1.54527
1.54647
1.54633
1.54512
1.54395
1.54379
1.54497
1.5462
1.54748
1.5488
1.55016
1.55156
1.55149
1.55007
1.5487
1.5486
1.54999
1.55142
1.55136
1.54992
1.54851
1.54715
1.54725
1.54736
1.54607
1.54482
1.54363
1.54348
1.54469
1.54595
1.54583
1.54456
1.54334
1.54218
1.54233
1.54249
1.54266
1.54284
1.54302
1.5432
1.54216
1.54118
1.54025
1.54004
1.54097
1.54197
1.54178
1.54077
1.53983
1.53894
1.53916
1.53938
1.53857
1.53782
1.53712
1.53689
1.53759
1.53834
1.53812
1.53736
1.53667
1.53645
1.53714
1.5379
1.53873
1.53962
1.54057
1.54159
1.54141
1.54039
1.53942
1.53924
1.54021
1.54124
1.54108
1.54004
1.53907
1.53816
1.53834
1.53853
1.5377
1.53694
1.53624
1.53605
1.53674
1.5375
1.53732
1.53656
1.53586
1.5357
1.53639
1.53716
1.538
1.53891
1.53989
1.54093
1.54204
1.54321
1.54444
1.54572
1.54705
1.54843
1.54984
1.5513
1.55124
1.54978
1.54835
1.54829
1.54972
1.55119
1.55115
1.54967
1.54823
1.54683
1.54689
1.54697
1.54563
1.54434
1.5431
1.543
1.54424
1.54554
1.54547
1.54417
1.54292
1.54285
1.54411
1.54542
1.54678
1.54819
1.54963
1.55112
1.55109
1.54961
1.54816
1.54814
1.54959
1.55108
1.54673
1.54675
1.54538
1.54406
1.5428
1.54278
1.54404
1.54536
1.54158
1.5416
1.54165
1.54172
1.54181
1.54192
1.5408
1.53975
1.53877
1.53864
1.53963
1.54069
1.54059
1.53953
1.53854
1.53762
1.53773
1.53785
1.53701
1.53624
1.53555
1.53542
1.53611
1.53688
1.53677
1.53601
1.53532
1.53523
1.53592
1.53669
1.53754
1.53846
1.53945
1.54052
1.54047
1.5394
1.5384
1.53837
1.53937
1.54044
1.53745
1.53748
1.53663
1.53587
1.53518
1.53514
1.53583
1.5366
1.53454
1.53457
1.53462
1.5347
1.53481
1.53493
1.53508
1.53525
1.53543
1.53563
1.53584
1.53605
1.53627
1.53649
1.53593
1.53542
1.53498
1.53479
1.53522
1.53571
1.5355
1.53502
1.53459
1.53422
1.53441
1.5346
1.53426
1.53398
1.53376
1.5336
1.53382
1.53408
1.5339
1.53365
1.53344
1.53328
1.53348
1.53373
1.53403
1.5344
1.53482
1.53529
1.53509
1.53462
1.53421
1.53403
1.53443
1.5349
1.53471
1.53425
1.53386
1.53353
1.53369
1.53385
1.53356
1.53332
1.53311
1.53297
1.53316
1.5334
1.53324
1.533
1.53284
1.53279
1.53289
1.533
1.53312
1.53327
1.53343
1.53357
1.53342
1.53332
1.5333
1.53323
1.53323
1.53328
1.53317
1.53315
1.53316
1.53317
1.53325
1.53331
1.53334
1.53337
1.53345
1.53343
1.53333
1.53327
1.53321
1.53329
1.5334
1.53337
1.53325
1.53315
1.53309
1.53307
1.53306
1.53306
1.53297
1.53297
1.53299
1.53289
1.53288
1.53287
1.53279
1.5328
1.53281
1.53288
1.53294
1.53301
1.53309
1.5332
1.53334
1.53331
1.53316
1.53304
1.53299
1.53312
1.53328
1.53325
1.53308
1.53294
1.53282
1.53274
1.53271
1.5327
1.5327
1.53274
1.53286
1.5331
1.53338
1.5337
1.53409
1.53454
1.5344
1.53394
1.53356
1.53344
1.53382
1.53427
1.53417
1.53372
1.53334
1.53302
1.53312
1.53324
1.53297
1.53274
1.53264
1.53256
1.53264
1.53284
1.53273
1.53255
1.53249
1.53243
1.53249
1.53265
1.53294
1.53326
1.53364
1.53409
1.53404
1.53359
1.53321
1.53318
1.53356
1.53401
1.53286
1.53289
1.5326
1.53245
1.53239
1.53237
1.53242
1.53258
1.53236
1.53239
1.53243
1.53248
1.53254
1.53262
1.53262
1.53263
1.53267
1.53262
1.53256
1.53255
1.53249
1.53249
1.53257
1.53268
1.53272
1.53277
1.53289
1.53304
1.53322
1.5332
1.53301
1.53285
1.53282
1.53298
1.53317
1.53315
1.53296
1.53279
1.53264
1.53253
1.53244
1.53243
1.53239
1.53241
1.5325
1.53248
1.53239
1.53237
1.53261
1.53262
1.53277
1.53294
1.53314
1.53313
1.53293
1.53276
1.53336
1.53336
1.53337
1.53339
1.5334
1.53342
1.53344
1.53346
1.53349
1.53351
1.53352
1.53354
1.53355
1.53356
1.53356
1.53355
1.53354
1.53352
1.5335
1.53346
1.53339
1.53331
1.5332
1.53309
1.53297
1.53285
1.53272
1.53256
1.53237
1.53217
1.53202
1.5319
1.53179
1.53207
1.53213
1.53224
1.53244
1.53235
1.53233
1.53235
1.53207
1.53177
1.53178
1.53182
1.53185
1.53219
1.53214
1.5321
1.53239
1.53243
1.5325
1.5328
1.5327
1.53264
1.5326
1.53257
1.53256
1.53261
1.53278
1.53277
1.53279
1.53299
1.53295
1.53294
1.53309
1.53312
1.53315
1.5332
1.53302
1.53283
1.53287
1.53296
1.53307
1.53332
1.53319
1.53309
1.53329
1.53341
1.53355
1.53372
1.53347
1.53321
1.53292
1.53261
1.53228
1.53192
1.53202
1.53215
1.5323
1.53271
1.53254
1.5324
1.53275
1.53291
1.53309
1.53329
1.53289
1.53247
1.53266
1.53287
1.5331
1.53357
1.53332
1.5331
1.53351
1.53375
1.534
1.53441
1.53414
1.53389
1.53365
1.53344
1.53324
1.53307
1.53337
1.53356
1.53377
1.53407
1.53385
1.53365
1.53391
1.53412
1.53435
1.5346
1.53431
1.53399
1.53424
1.5345
1.53478
1.53513
1.53484
1.53456
1.53486
1.53515
1.53544
1.53574
1.53543
1.53514
1.53486
1.5346
1.53436
1.53414
1.53394
1.53376
1.5336
1.53347
1.53337
1.53329
1.53326
1.53322
1.53334
1.53337
1.53343
1.53354
1.53346
1.53343
1.53349
1.53355
1.53365
1.53377
1.53365
1.53352
1.53364
1.53378
1.53395
1.53413
1.53395
1.53379
1.53392
1.53409
1.53428
1.53442
1.53422
1.53404
1.53388
1.53374
1.53363
1.53355
1.53359
1.5337
1.53382
1.53389
1.53375
1.53363
1.53366
1.53379
1.53395
1.53412
1.53406
1.53397
1.53415
1.53434
1.53455
1.53466
1.53444
1.53424
1.53432
1.53453
1.53476
1.535
1.5349
1.53478
1.53465
1.5345
1.53433
1.53414
1.53435
1.53459
1.53484
1.53505
1.53479
1.53455
1.53473
1.53497
1.53524
1.53552
1.53532
1.5351
1.53539
1.53569
1.536
1.53624
1.53592
1.53561
1.53582
1.53613
1.53646
1.53665
1.53632
1.536
1.5357
1.53541
1.53514
1.53488
1.53503
1.53529
1.53557
1.5357
1.53542
1.53515
1.53526
1.53554
1.53582
1.53612
1.536
1.53586
1.53617
1.53649
1.53682
1.53697
1.53663
1.53631
1.53644
1.53676
1.53711
1.53746
1.53733
1.53717
1.537
1.5368
1.53658
1.53633
1.53606
1.53576
1.53543
1.53507
1.53469
1.53427
1.53382
1.53334
1.5336
1.53387
1.53415
1.53467
1.53438
1.53409
1.53455
1.53485
1.53516
1.53548
1.53497
1.53443
1.53473
1.53504
1.53535
1.53594
1.53561
1.53529
1.53581
1.53614
1.53649
1.537
1.53664
1.53629
1.53595
1.53561
1.53529
1.53498
1.53538
1.5357
1.53604
1.53642
1.53608
1.53575
1.53609
1.53643
1.53678
1.53715
1.53678
1.53638
1.53673
1.5371
1.53747
1.53791
1.53752
1.53715
1.53752
1.53791
1.53831
1.53872
1.53831
1.53786
1.53737
1.53684
1.53627
1.53566
1.53599
1.53631
1.53664
1.53731
1.53696
1.53661
1.5372
1.53756
1.53793
1.53831
1.53766
1.53697
1.5373
1.53764
1.53798
1.53875
1.53838
1.53802
1.53869
1.53908
1.53948
1.54016
1.53973
1.53932
1.53891
1.53852
1.53812
1.53774
1.53825
1.53865
1.53906
1.53956
1.53913
1.53872
1.53915
1.53958
1.54003
1.54048
1.54
1.53948
1.53991
1.54035
1.5408
1.54139
1.54091
1.54045
1.54096
1.54144
1.54194
1.54245
1.54193
1.54142
1.54093
1.54045
1.53999
1.53954
1.5391
1.53868
1.53827
1.53787
1.53748
1.53711
1.53674
1.53639
1.53667
1.53703
1.5374
1.53767
1.53729
1.53693
1.53715
1.53752
1.53791
1.5383
1.53806
1.53779
1.53818
1.53859
1.53901
1.53931
1.53888
1.53846
1.53872
1.53914
1.53958
1.53982
1.53937
1.53894
1.53852
1.53812
1.53773
1.53736
1.53754
1.53791
1.53831
1.53847
1.53807
1.53769
1.53783
1.53821
1.53861
1.53903
1.53888
1.53871
1.53914
1.53958
1.54003
1.54022
1.53976
1.53931
1.53946
1.53991
1.54038
1.54087
1.5407
1.54051
1.54029
1.54004
1.53976
1.53945
1.5399
1.54036
1.54084
1.54119
1.5407
1.54022
1.54051
1.541
1.54151
1.54203
1.5417
1.54133
1.54184
1.54237
1.54292
1.54334
1.54278
1.54223
1.54258
1.54315
1.54373
1.54409
1.54348
1.54289
1.54233
1.54179
1.54127
1.54077
1.541
1.54151
1.54205
1.54227
1.54172
1.5412
1.54138
1.54191
1.54246
1.54304
1.54284
1.5426
1.54318
1.54378
1.5444
1.54469
1.54404
1.54343
1.54365
1.54428
1.54494
1.54516
1.54449
1.54384
1.54322
1.54263
1.54207
1.54153
1.54101
1.54052
1.54004
1.53959
1.53915
1.53873
1.53833
1.53795
1.53758
1.53722
1.53688
1.53655
1.53623
1.53593
1.53564
1.53536
1.5351
1.53484
1.53461
1.53439
1.53418
1.534
1.53383
1.53368
1.5337
1.53385
1.53403
1.53406
1.53387
1.5337
1.5337
1.53388
1.53409
1.5343
1.53427
1.53423
1.53444
1.53467
1.53492
1.53498
1.53473
1.53449
1.53453
1.53478
1.53504
1.53508
1.53482
1.53457
1.53433
1.5341
1.53389
1.5337
1.53369
1.53389
1.53411
1.53412
1.53389
1.53368
1.53367
1.53389
1.53412
1.53437
1.53436
1.53435
1.53459
1.53485
1.53512
1.53515
1.53488
1.53461
1.53463
1.5349
1.53518
1.53546
1.53543
1.5354
1.53535
1.5353
1.53524
1.53518
1.53545
1.53573
1.53602
1.5361
1.5358
1.53552
1.53558
1.53587
1.53617
1.53648
1.53641
1.53633
1.53665
1.53698
1.53732
1.5374
1.53706
1.53673
1.5368
1.53713
1.53747
1.53753
1.53719
1.53686
1.53654
1.53623
1.53593
1.53564
1.53568
1.53597
1.53628
1.53632
1.53601
1.53572
1.53575
1.53605
1.53635
1.53666
1.53663
1.53659
1.53691
1.53724
1.53758
1.53762
1.53728
1.53695
1.53698
1.53731
1.53765
1.53768
1.53734
1.53701
1.53669
1.53638
1.53607
1.53578
1.53548
1.5352
1.53492
1.53464
1.53438
1.53413
1.53388
1.53365
1.53364
1.53388
1.53413
1.53412
1.53387
1.53363
1.53362
1.53386
1.53412
1.53439
1.53439
1.53438
1.53465
1.53493
1.53521
1.53523
1.53494
1.53466
1.53466
1.53495
1.53524
1.53524
1.53495
1.53467
1.53439
1.53412
1.53386
1.53361
1.5336
1.53385
1.53412
1.53412
1.53385
1.5336
1.53439
1.53439
1.53467
1.53496
1.53525
1.53525
1.53496
1.53467
1.53555
1.53554
1.53554
1.53553
1.53552
1.5355
1.5358
1.5361
1.5364
1.53642
1.53611
1.53581
1.53583
1.53613
1.53643
1.53674
1.53673
1.53671
1.53703
1.53736
1.5377
1.53771
1.53738
1.53705
1.53706
1.53739
1.53773
1.53774
1.5374
1.53707
1.53675
1.53644
1.53614
1.53584
1.53584
1.53614
1.53645
1.53645
1.53615
1.53584
1.53676
1.53676
1.53708
1.5374
1.53774
1.53774
1.53741
1.53708
1.5381
1.53809
1.53809
1.53808
1.53807
1.53805
1.53803
1.53801
1.53798
1.53794
1.53789
1.53783
1.53776
1.53767
1.53805
1.53843
1.53884
1.53892
1.53852
1.53813
1.5382
1.53859
1.53899
1.53942
1.53934
1.53926
1.53969
1.54015
1.54063
1.54073
1.54025
1.53979
1.53986
1.54032
1.54081
1.54088
1.54039
1.53992
1.53948
1.53905
1.53865
1.53826
1.53831
1.5387
1.5391
1.53914
1.53873
1.53835
1.53838
1.53876
1.53917
1.53959
1.53956
1.53953
1.53997
1.54044
1.54093
1.54098
1.54048
1.54001
1.54004
1.54051
1.54101
1.54154
1.5415
1.54145
1.54139
1.54132
1.54124
1.54113
1.54166
1.5422
1.54278
1.54291
1.54232
1.54177
1.54186
1.54242
1.54301
1.54363
1.54352
1.54338
1.54401
1.54467
1.54536
1.54553
1.54483
1.54416
1.54428
1.54497
1.54568
1.54582
1.54509
1.54439
1.54373
1.5431
1.5425
1.54193
1.542
1.54257
1.54318
1.54324
1.54263
1.54205
1.54209
1.54267
1.54329
1.54394
1.54388
1.54381
1.54449
1.54519
1.54593
1.54603
1.54528
1.54456
1.54463
1.54535
1.54611
1.54618
1.54541
1.54468
1.54399
1.54333
1.54271
1.54212
1.54157
1.54104
1.54054
1.54007
1.53962
1.53919
1.53879
1.5384
1.53842
1.53881
1.53921
1.53922
1.53882
1.53844
1.53845
1.53883
1.53923
1.53966
1.53965
1.53964
1.54009
1.54056
1.54106
1.54108
1.54057
1.5401
1.54011
1.54058
1.54109
1.5411
1.54059
1.54012
1.53967
1.53924
1.53884
1.53845
1.53846
1.53884
1.53925
1.53925
1.53885
1.53846
1.53967
1.53967
1.54012
1.5406
1.5411
1.5411
1.5406
1.54012
1.54164
1.54164
1.54163
1.54162
1.54161
1.54159
1.54215
1.54274
1.54337
1.5434
1.54276
1.54217
1.54218
1.54278
1.54342
1.54409
1.54406
1.54403
1.54473
1.54547
1.54624
1.54629
1.54551
1.54477
1.54479
1.54554
1.54633
1.54636
1.54557
1.54482
1.5441
1.54343
1.5428
1.5422
1.5422
1.5428
1.54344
1.54345
1.54281
1.54221
1.54412
1.54412
1.54483
1.54558
1.54638
1.54639
1.54559
1.54484
1.54723
1.54721
1.54719
1.54716
1.54711
1.54706
1.54699
1.54691
1.54682
1.54671
1.54658
1.54644
1.54627
1.54608
1.54587
1.54563
1.54536
1.54505
1.54472
1.54434
1.54393
1.54348
1.54299
1.54246
1.54188
1.54126
1.54059
1.53988
1.53912
1.53832
1.53747
1.53658
1.53563
1.53464
1.5336
1.53252
1.53139
1.53019
1.52897
1.52769
1.52636
1.52498
1.52355
1.52206
1.52049
1.51883
1.51698
1.51668
1.51856
1.51825
1.51634
1.51593
1.51789
1.51967
1.51999
1.52026
1.52187
1.52163
1.52136
1.52104
1.5193
1.51747
1.51547
1.51494
1.517
1.51645
1.51434
1.51366
1.51583
1.51784
1.51839
1.51887
1.52067
1.52024
1.51976
1.52161
1.52203
1.52239
1.52271
1.52298
1.52321
1.5234
1.52487
1.52472
1.52454
1.52605
1.52619
1.52629
1.52766
1.5276
1.52751
1.5274
1.52589
1.52432
1.52406
1.52376
1.52342
1.52517
1.52545
1.52569
1.52726
1.52708
1.52688
1.52664
1.52486
1.52303
1.52114
1.51921
1.51721
1.51514
1.51289
1.51203
1.51436
1.51349
1.51106
1.50997
1.51252
1.51487
1.51574
1.51652
1.5186
1.51791
1.51716
1.51633
1.51391
1.51143
1.50876
1.50741
1.51023
1.50889
1.5059
1.50421
1.50742
1.51041
1.51169
1.51285
1.51541
1.51441
1.51333
1.51618
1.51708
1.51791
1.51868
1.51939
1.52003
1.52062
1.52259
1.5221
1.52157
1.52369
1.52412
1.52451
1.52638
1.52608
1.52576
1.52542
1.52323
1.52098
1.52035
1.51968
1.51896
1.52167
1.52221
1.52274
1.52505
1.52468
1.5243
1.52682
1.52706
1.5273
1.52754
1.52777
1.52799
1.52819
1.52837
1.52853
1.52867
1.52878
1.52886
1.52893
1.52896
1.52898
1.53025
1.53028
1.53029
1.5316
1.53154
1.53146
1.53265
1.53277
1.53286
1.53295
1.53164
1.53028
1.53025
1.5302
1.53013
1.53168
1.53168
1.53167
1.53303
1.53311
1.53317
1.53461
1.53448
1.53435
1.53421
1.53407
1.53393
1.53377
1.53485
1.53504
1.53524
1.53635
1.53611
1.53587
1.53685
1.53713
1.53741
1.53769
1.53658
1.53543
1.53561
1.5358
1.53598
1.53731
1.53706
1.53682
1.53798
1.53827
1.53857
1.53889
1.53756
1.53617
1.53473
1.53323
1.53167
1.53005
1.52995
1.52984
1.52971
1.53159
1.53162
1.53165
1.53328
1.53334
1.53339
1.53346
1.53157
1.52959
1.52947
1.52935
1.52924
1.53153
1.53154
1.53155
1.53355
1.53367
1.5338
1.53593
1.53568
1.53547
1.53529
1.53513
1.53499
1.53486
1.53637
1.53658
1.5368
1.5384
1.5381
1.53782
1.53921
1.53956
1.53993
1.54033
1.53872
1.53705
1.53732
1.53762
1.53796
1.5399
1.53946
1.53908
1.54075
1.54122
1.54174
1.54231
1.54038
1.53836
1.53622
1.53397
1.53161
1.52914
1.5266
1.52392
1.52113
1.51822
1.51523
1.51216
1.50901
1.50579
1.50232
1.50023
1.50399
1.50204
1.4979
1.49537
1.49997
1.50423
1.5059
1.5075
1.51092
1.50963
1.50831
1.50689
1.50247
1.4978
1.49267
1.48965
1.49531
1.49188
1.48562
1.47974
1.48736
1.49508
1.49734
1.50031
1.50507
1.50278
1.50205
1.50837
1.50845
1.50952
1.51104
1.51222
1.51324
1.51425
1.51747
1.51672
1.51594
1.51942
1.52004
1.52058
1.52356
1.52316
1.52271
1.52254
1.5187
1.51501
1.51395
1.51374
1.51398
1.51896
1.51862
1.51845
1.52267
1.52295
1.52325
1.52395
1.51933
1.5144
1.50874
1.50226
1.49471
1.48596
1.47595
1.47532
1.48619
1.48699
1.4761
1.47719
1.48815
1.49748
1.49585
1.49517
1.50283
1.50343
1.50537
1.50833
1.5007
1.49181
1.4813
1.48759
1.49691
1.50266
1.49428
1.48471
1.49346
1.50173
1.509
1.51543
1.50997
1.50503
1.51209
1.51641
1.52118
1.52637
1.52214
1.5183
1.51495
1.51222
1.51026
1.50924
1.51498
1.51631
1.51823
1.52358
1.52168
1.52026
1.52504
1.5265
1.52837
1.53062
1.52596
1.52078
1.52382
1.52728
1.53108
1.53535
1.53191
1.52876
1.53322
1.53612
1.53928
1.54289
1.53997
1.53727
1.53483
1.53268
1.53085
1.52936
1.5282
1.52731
1.52674
1.52644
1.5262
1.52606
1.52612
1.52637
1.52904
1.52911
1.52928
1.53216
1.53191
1.53175
1.53422
1.53452
1.53491
1.53541
1.53253
1.52948
1.52982
1.53034
1.53109
1.53456
1.5337
1.53303
1.53604
1.53682
1.53776
1.54073
1.53972
1.53885
1.53812
1.5375
1.53699
1.53657
1.53881
1.53934
1.53995
1.54225
1.54155
1.54093
1.54294
1.54364
1.54441
1.54527
1.54304
1.54066
1.54148
1.54242
1.54349
1.54606
1.54494
1.54393
1.54623
1.54729
1.54846
1.54974
1.54732
1.54471
1.54191
1.53889
1.53562
1.53206
1.5333
1.53481
1.5366
1.54018
1.53842
1.5369
1.54021
1.54174
1.54346
1.54539
1.54217
1.53866
1.54097
1.5435
1.54623
1.54931
1.54676
1.54437
1.54749
1.54976
1.55218
1.55484
1.55255
1.55038
1.54836
1.54649
1.54479
1.54326
1.54609
1.54761
1.54928
1.55188
1.55022
1.54871
1.55114
1.55265
1.55428
1.55603
1.55365
1.5511
1.55306
1.55514
1.55733
1.55965
1.55755
1.55555
1.55787
1.5598
1.56182
1.56391
1.56183
1.55961
1.55724
1.55471
1.552
1.5491
1.54598
1.54263
1.53901
1.53511
1.53086
1.52624
1.52118
1.51563
1.50946
1.50246
1.51152
1.52004
1.51553
1.52433
1.52095
1.51425
1.51399
1.51959
1.51912
1.51626
1.51626
1.51363
1.51391
1.51905
1.51914
1.52147
1.52315
1.51898
1.52342
1.5234
1.52574
1.52829
1.52847
1.53064
1.53198
1.52787
1.52719
1.52545
1.52747
1.52786
1.52354
1.52004
1.53589
1.53144
1.53192
1.53645
1.53641
1.53459
1.53247
1.53668
1.54045
1.54314
1.53614
1.54347
1.54342
1.54232
1.54405
1.54729
1.54691
1.5499
1.55042
1.55092
1.544
1.54503
1.5377
1.5298
1.5325
1.54001
1.54242
1.53553
1.52805
1.53172
1.52462
1.51718
1.52232
1.52886
1.5352
1.53854
1.53285
1.52704
1.53142
1.53662
1.54176
1.54679
1.54406
1.54127
1.53844
1.54473
1.54704
1.5525
1.55062
1.54872
1.54654
1.55302
1.55186
1.55815
1.5574
1.55672
1.56275
1.56252
1.56796
1.56798
1.56644
1.56706
1.56979
1.57029
1.57094
1.57065
1.56932
1.56899
1.56754
1.56707
1.56817
1.57154
1.57191
1.57324
1.5735
1.57478
1.57596
1.57633
1.57761
1.57792
1.57907
1.57928
1.57688
1.57648
1.57455
1.57385
1.57325
1.57287
1.57589
1.57935
1.57474
1.57365
1.57251
1.56892
1.5733
1.57328
1.57339
1.56825
1.56859
1.56328
1.56387
1.569
1.57373
1.57353
1.57806
1.57808
1.57814
1.57825
1.57859
1.58291
1.58333
1.5826
1.58326
1.58369
1.58233
1.58257
1.58287
1.58399
1.58516
1.58546
1.58652
1.58662
1.58715
1.58821
1.58857
1.58884
1.58979
1.59009
1.59105
1.5913
1.59222
1.59311
1.59346
1.59448
1.59472
1.59566
1.59584
1.5962
1.59709
1.59738
1.59757
1.59836
1.59861
1.5994
1.59965
1.60044
1.6002
1.60111
1.59942
1.59897
1.59907
1.59818
1.59748
1.59713
1.59726
1.59521
1.59322
1.59373
1.592
1.59126
1.59071
1.59067
1.58954
1.58876
1.58832
1.59025
1.59267
1.59251
1.59374
1.58908
1.58815
1.58761
1.5859
1.58542
1.5843
1.59209
1.59158
1.58756
1.5872
1.59116
1.59075
1.5869
1.58272
1.58253
1.58236
1.58634
1.58661
1.59037
1.59003
1.58975
1.58614
1.58225
1.58221
1.57812
1.57829
1.57406
1.56946
1.56442
1.55894
1.56003
1.55462
1.55614
1.55766
1.55924
1.55442
1.54935
1.55167
1.55636
1.56087
1.56252
1.55831
1.55395
1.54945
1.54485
1.54018
1.53549
1.53928
1.54353
1.5478
1.55061
1.5467
1.54281
1.54611
1.54968
1.55329
1.55691
1.55451
1.55203
1.55619
1.56025
1.56419
1.56585
1.56216
1.55837
1.5605
1.56404
1.5675
1.57089
1.56944
1.568
1.56657
1.56517
1.56382
1.56253
1.56129
1.56609
1.5651
1.56993
1.57442
1.57857
1.58239
1.58225
1.58596
1.58601
1.58955
1.58943
1.58939
1.586
1.58613
1.58265
1.57888
1.57483
1.57055
1.5714
1.56711
1.56816
1.56928
1.57319
1.57227
1.57614
1.57541
1.57925
1.58291
1.58636
1.58956
1.58943
1.59254
1.59257
1.59268
1.59287
1.59313
1.59346
1.59384
1.59428
1.59476
1.59524
1.59574
1.59637
1.59962
1.60024
1.60007
1.60072
1.60234
1.60279
1.60344
1.60346
1.60266
1.60241
1.60155
1.60119
1.60162
1.60392
1.60469
1.60502
1.60525
1.60597
1.60623
1.60696
1.60717
1.60785
1.60807
1.60877
1.60947
1.60966
1.61034
1.6106
1.61131
1.6115
1.61218
1.61229
1.61248
1.61269
1.61292
1.61353
1.61374
1.61431
1.61448
1.61509
1.61528
1.61589
1.61651
1.61673
1.61735
1.61756
1.61814
1.61832
1.61893
1.61913
1.61968
1.6195
1.62002
1.62022
1.62043
1.62095
1.62115
1.62166
1.62181
1.62236
1.62255
1.62306
1.62359
1.6238
1.62431
1.62451
1.625
1.62518
1.62564
1.62578
1.62628
1.62644
1.62691
1.62738
1.62754
1.628
1.62818
1.62862
1.62879
1.62922
1.62937
1.62982
1.63001
1.63043
1.63086
1.63106
1.63147
1.63166
1.63206
1.63223
1.63263
1.63277
1.63319
1.63336
1.63375
1.63416
1.63433
1.6347
1.63488
1.63524
1.6354
1.63575
1.63588
1.63626
1.63642
1.63677
1.63715
1.63732
1.63768
1.63784
1.63818
1.63833
1.63866
1.63878
1.63912
1.63927
1.63959
1.63992
1.64007
1.64038
1.64053
1.64083
1.64097
1.64126
1.64139
1.6417
1.64186
1.64215
1.64245
1.64261
1.6429
1.64306
1.64334
1.64348
1.64375
1.64387
1.64417
1.64431
1.64457
1.64486
1.645
1.64526
1.64541
1.64566
1.6458
1.64604
1.64618
1.64641
1.64652
1.64678
1.64692
1.64714
1.64701
1.64688
1.64664
1.64651
1.64628
1.64614
1.6459
1.64575
1.64551
1.64535
1.64511
1.64498
1.64472
1.64445
1.64431
1.64403
1.64389
1.6436
1.64345
1.64318
1.64303
1.64274
1.64259
1.6423
1.64201
1.64185
1.64156
1.64141
1.64112
1.64097
1.64068
1.64053
1.64023
1.6401
1.63979
1.63946
1.63933
1.63899
1.63885
1.63851
1.63836
1.63802
1.63786
1.6375
1.63733
1.63698
1.63663
1.63646
1.63611
1.63595
1.6356
1.63543
1.63507
1.63489
1.63453
1.63438
1.63401
1.6336
1.63345
1.63303
1.63286
1.63245
1.63226
1.63187
1.63169
1.63128
1.6311
1.63068
1.63026
1.63007
1.62964
1.62946
1.62904
1.62886
1.62843
1.62825
1.62783
1.62768
1.62723
1.62676
1.6266
1.62612
1.62595
1.62547
1.62528
1.6248
1.62461
1.6241
1.62389
1.62339
1.62288
1.62269
1.62218
1.62199
1.62147
1.62127
1.62075
1.62054
1.62031
1.61985
1.61932
1.61873
1.61853
1.61794
1.61771
1.61711
1.61688
1.6163
1.6157
1.6155
1.61491
1.6147
1.61411
1.61389
1.6133
1.61307
1.61368
1.6143
1.61449
1.6151
1.61529
1.6159
1.61609
1.61668
1.61727
1.61748
1.61802
1.61832
1.61894
1.61914
1.61974
1.61963
1.62003
1.62061
1.62087
1.62106
1.6216
1.6218
1.62233
1.6225
1.62301
1.62319
1.6237
1.62422
1.6244
1.62487
1.62511
1.62561
1.62577
1.62623
1.62644
1.62693
1.62709
1.6276
1.62753
1.62786
1.62807
1.62855
1.62869
1.62914
1.62929
1.62972
1.62989
1.63034
1.6305
1.63093
1.63135
1.63154
1.63186
1.63209
1.63249
1.63268
1.63304
1.63328
1.63371
1.63387
1.63428
1.63415
1.63446
1.63469
1.6351
1.63525
1.63564
1.6358
1.63617
1.6363
1.63666
1.63682
1.63718
1.63756
1.63771
1.63803
1.63822
1.63859
1.63872
1.63901
1.63919
1.63954
1.63968
1.64002
1.6399
1.64018
1.64037
1.64072
1.64083
1.64114
1.64127
1.64158
1.6417
1.64202
1.64215
1.64247
1.64275
1.6429
1.64312
1.64332
1.6436
1.64375
1.64399
1.64419
1.64449
1.64461
1.6449
1.64475
1.645
1.6452
1.64549
1.6456
1.64587
1.646
1.64627
1.64637
1.64662
1.64674
1.64698
1.6471
1.64724
1.64738
1.64753
1.64775
1.64789
1.6481
1.64822
1.64842
1.64852
1.64874
1.64888
1.64906
1.64895
1.64913
1.64926
1.64939
1.64957
1.6497
1.64986
1.64997
1.65016
1.65031
1.65047
1.65065
1.65079
1.65095
1.65109
1.65123
1.65136
1.65149
1.65159
1.65175
1.65187
1.652
1.65214
1.65227
1.65239
1.65251
1.65262
1.65272
1.65285
1.65298
1.65308
1.65319
1.65331
1.65341
1.65353
1.65361
1.65371
1.65382
1.65395
1.65401
1.65409
1.65421
1.65427
1.65438
1.65444
1.65453
1.65461
1.65474
1.65478
1.65467
1.65457
1.6545
1.65439
1.65433
1.65422
1.65416
1.65406
1.65399
1.6539
1.6538
1.65371
1.6536
1.6535
1.65338
1.65329
1.65319
1.65307
1.65297
1.65285
1.65274
1.65261
1.6525
1.65238
1.65227
1.65216
1.65203
1.65189
1.65178
1.65164
1.65152
1.65137
1.65124
1.6511
1.65097
1.65081
1.65068
1.65052
1.65035
1.65021
1.65004
1.64991
1.64974
1.64961
1.64944
1.64931
1.64917
1.64902
1.64883
1.64863
1.64851
1.64831
1.64819
1.64797
1.64784
1.64762
1.64748
1.64734
1.64757
1.64773
1.64798
1.64807
1.64828
1.64842
1.64864
1.64874
1.64896
1.64881
1.64899
1.64924
1.64941
1.64949
1.64967
1.64979
1.65
1.65009
1.65027
1.65039
1.65059
1.65075
1.65085
1.651
1.65115
1.65129
1.65139
1.65154
1.65169
1.65186
1.65194
1.6521
1.65193
1.65207
1.65225
1.65242
1.6525
1.65262
1.65274
1.6529
1.65297
1.65309
1.6532
1.65331
1.6534
1.65349
1.6536
1.65372
1.65382
1.65389
1.65401
1.6538
1.65393
1.6541
1.65423
1.65429
1.65436
1.65447
1.65457
1.65463
1.65473
1.65484
1.65496
1.655
1.65511
1.65514
1.65523
1.65528
1.65539
1.6554
1.65544
1.65553
1.65555
1.65563
1.65566
1.65578
1.65577
1.65579
1.65587
1.65588
1.65595
1.65596
1.65606
1.65603
1.65602
1.6561
1.65608
1.65615
1.65614
1.65624
1.65619
1.65617
1.65624
1.65622
1.65628
1.65626
1.65634
1.65628
1.65625
1.6563
1.65628
1.65636
1.65628
1.65624
1.65619
1.65622
1.65619
1.6562
1.65623
1.65618
1.6562
1.65614
1.65615
1.65609
1.65611
1.65613
1.65605
1.65607
1.656
1.65601
1.65595
1.65595
1.65595
1.65589
1.65589
1.65581
1.65579
1.65572
1.6557
1.65568
1.65559
1.65557
1.65548
1.65546
1.65538
1.65534
1.65531
1.65522
1.65518
1.65509
1.65504
1.65494
1.65489
1.65479
1.65469
1.65476
1.65487
1.6549
1.65498
1.65505
1.65517
1.65522
1.65527
1.65535
1.65517
1.65523
1.65538
1.65546
1.6555
1.65552
1.65562
1.65569
1.65572
1.65573
1.65578
1.65585
1.65585
1.65588
1.65593
1.65574
1.65577
1.65591
1.65597
1.65599
1.65598
1.65605
1.65607
1.65603
1.65606
1.6561
1.65617
1.65616
1.65615
1.6562
1.65606
1.65603
1.65614
1.65616
1.65615
1.65619
1.65624
1.65629
1.65624
1.65627
1.65624
1.6563
1.65622
1.65619
1.65615
1.65619
1.65616
1.6562
1.65616
1.6561
1.65612
1.65616
1.65612
1.65611
1.65615
1.65612
1.65614
1.65617
1.6562
1.65617
1.65623
1.65614
1.65608
1.65609
1.65604
1.65609
1.65599
1.65598
1.65592
1.65592
1.65592
1.65587
1.65591
1.6558
1.65572
1.65572
1.65566
1.6557
1.65558
1.65559
1.65559
1.65565
1.65567
1.65573
1.6558
1.65579
1.65586
1.65586
1.65585
1.65593
1.65596
1.65602
1.65601
1.65607
1.65611
1.65608
1.65613
1.6561
1.65606
1.65601
1.65605
1.65605
1.656
1.65595
1.65599
1.65591
1.6558
1.6559
1.65587
1.6558
1.65572
1.65574
1.65572
1.65565
1.65559
1.65562
1.65555
1.65552
1.6555
1.65549
1.65543
1.65545
1.65533
1.65525
1.65521
1.65515
1.65515
1.65501
1.65506
1.65499
1.65496
1.65496
1.65481
1.65487
1.65492
1.65497
1.65505
1.65509
1.65517
1.65521
1.65529
1.65536
1.65537
1.65544
1.65546
1.6554
1.65533
1.65532
1.65531
1.65524
1.65513
1.65517
1.65518
1.65498
1.65509
1.65498
1.65485
1.65478
1.65473
1.65467
1.6546
1.65458
1.65443
1.65437
1.65435
1.65421
1.65413
1.65405
1.65398
1.65394
1.65379
1.65389
1.65383
1.65374
1.65368
1.65353
1.65345
1.65332
1.65326
1.65316
1.653
1.65294
1.65284
1.6527
1.65265
1.65254
1.65239
1.65235
1.65221
1.65208
1.65204
1.65187
1.65173
1.6517
1.65153
1.65141
1.65141
1.65121
1.65111
1.65111
1.65085
1.65088
1.65063
1.65062
1.65048
1.6505
1.65016
1.65018
1.65
1.64959
1.64954
1.64949
1.64954
1.6494
1.64938
1.64957
1.64975
1.64969
1.64966
1.64984
1.64984
1.64993
1.6501
1.64991
1.65037
1.65058
1.65031
1.6505
1.65023
1.64999
1.6498
1.64962
1.64944
1.64928
1.64928
1.64935
1.64919
1.6492
1.64941
1.64949
1.64929
1.64911
1.64913
1.64923
1.64904
1.64907
1.64931
1.64954
1.64945
1.64936
1.64958
1.64968
1.64978
1.64989
1.64964
1.6494
1.64917
1.64896
1.649
1.64911
1.64889
1.64893
1.64919
1.64929
1.64903
1.64879
1.64883
1.64894
1.64868
1.64872
1.64902
1.64931
1.64921
1.64911
1.64939
1.64949
1.6496
1.64991
1.64979
1.64967
1.64956
1.64945
1.64935
1.64925
1.6495
1.64961
1.6497
1.64998
1.64988
1.64975
1.65001
1.65014
1.65026
1.6504
1.65012
1.64984
1.64996
1.65008
1.65021
1.65053
1.65039
1.65025
1.65055
1.65069
1.65084
1.65098
1.65067
1.65035
1.65004
1.64972
1.64942
1.64911
1.64882
1.64855
1.64858
1.64867
1.64836
1.64841
1.64874
1.64879
1.64843
1.64853
1.64818
1.6482
1.64828
1.64789
1.6479
1.64797
1.64753
1.64754
1.64759
1.6471
1.64709
1.64714
1.64658
1.64657
1.64661
1.64594
1.64597
1.64608
1.64535
1.64544
1.64463
1.64473
1.64555
1.6457
1.64483
1.64391
1.64404
1.64418
1.64303
1.64334
1.64446
1.64551
1.6452
1.64499
1.6459
1.64616
1.6465
1.64694
1.64594
1.64488
1.64377
1.64258
1.64305
1.64167
1.64238
1.64335
1.64197
1.64332
1.64204
1.64389
1.64287
1.64516
1.64454
1.64733
1.64733
1.6505
1.65131
1.65449
1.65618
1.659
1.6614
1.66353
1.66543
1.66759
1.66906
1.67039
1.67161
1.67006
1.66867
1.66716
1.66542
1.66708
1.66864
1.6674
1.66579
1.66392
1.66197
1.65977
1.65731
1.65617
1.65347
1.65288
1.65015
1.65014
1.6476
1.6481
1.64593
1.64676
1.64494
1.646
1.64457
1.64573
1.64462
1.64371
1.64493
1.64428
1.64541
1.64608
1.64689
1.64579
1.64682
1.64801
1.64703
1.6485
1.64761
1.64937
1.64871
1.65072
1.65034
1.65262
1.65263
1.655
1.65542
1.65781
1.65862
1.66083
1.66284
1.66471
1.66631
1.66545
1.66381
1.66198
1.65998
1.65936
1.65724
1.65692
1.65481
1.65482
1.65278
1.65307
1.65121
1.65175
1.65008
1.65079
1.64935
1.65017
1.64895
1.64785
1.64882
1.64791
1.64713
1.64648
1.64747
1.64811
1.64886
1.64973
1.65069
1.64984
1.65097
1.65218
1.6515
1.6529
1.65232
1.65389
1.65346
1.6552
1.65493
1.65677
1.65678
1.65867
1.65892
1.6608
1.66128
1.66307
1.66475
1.66633
1.66706
1.66791
1.6689
1.67004
1.67132
1.67274
1.67383
1.67466
1.67495
1.67726
1.67758
1.67909
1.67992
1.67977
1.67613
1.67534
1.67494
1.67367
1.67255
1.67132
1.67238
1.67295
1.67304
1.67157
1.67028
1.66928
1.67041
1.67106
1.67372
1.67563
1.67679
1.67329
1.67199
1.67129
1.6698
1.66847
1.66769
1.66886
1.66963
1.66998
1.66845
1.66712
1.66574
1.6642
1.66253
1.66212
1.66048
1.66027
1.65858
1.65858
1.65688
1.65707
1.65549
1.65581
1.65434
1.65484
1.65346
1.65409
1.65285
1.65172
1.65247
1.65147
1.65057
1.64976
1.64904
1.64841
1.64788
1.64743
1.64706
1.64677
1.64654
1.64635
1.6462
1.64694
1.64679
1.64667
1.64734
1.64725
1.64718
1.64778
1.6477
1.64763
1.64816
1.64809
1.64802
1.64848
1.64841
1.64833
1.64875
1.64867
1.64859
1.64898
1.64889
1.64926
1.64915
1.64907
1.64899
1.6489
1.6492
1.64931
1.64939
1.64975
1.64965
1.64953
1.64985
1.64998
1.6501
1.65023
1.64986
1.6495
1.64963
1.64976
1.64937
1.64948
1.64907
1.64918
1.64929
1.64885
1.64895
1.64906
1.64858
1.64868
1.6488
1.64825
1.64836
1.64849
1.64788
1.64801
1.64816
1.64747
1.64766
1.64787
1.64712
1.64734
1.6476
1.64792
1.6483
1.6491
1.64872
1.64839
1.64811
1.64884
1.64859
1.64836
1.64903
1.64881
1.64864
1.64925
1.64908
1.64893
1.64948
1.64933
1.64919
1.64969
1.64954
1.64941
1.64987
1.64973
1.6496
1.65002
1.64989
1.65028
1.65014
1.65001
1.65038
1.65053
1.65068
1.65108
1.65091
1.65074
1.6506
1.65045
1.65031
1.65017
1.65049
1.65065
1.6508
1.65114
1.65097
1.65081
1.65114
1.65132
1.65151
1.65169
1.65131
1.65096
1.65112
1.65129
1.65148
1.65188
1.65168
1.65148
1.65188
1.65208
1.65229
1.65249
1.65209
1.65167
1.65126
1.65085
1.65043
1.65058
1.65016
1.65031
1.65047
1.65001
1.65017
1.65034
1.64984
1.65
1.65019
1.64964
1.64984
1.65006
1.64945
1.64968
1.64994
1.64927
1.64956
1.64988
1.64914
1.64949
1.64989
1.65064
1.65024
1.65095
1.65057
1.65024
1.6509
1.65059
1.65031
1.6509
1.65064
1.65041
1.65098
1.65074
1.65053
1.65103
1.65081
1.65065
1.65113
1.65094
1.65075
1.65119
1.65101
1.65143
1.65187
1.65208
1.65163
1.65186
1.6514
1.65161
1.65182
1.65131
1.65155
1.6518
1.65125
1.65151
1.65178
1.65123
1.65151
1.65181
1.65119
1.65151
1.65188
1.65125
1.65163
1.65206
1.65136
1.65183
1.65109
1.65035
1.64956
1.64875
1.64928
1.64989
1.65059
1.65141
1.65072
1.6501
1.65089
1.65149
1.65215
1.65291
1.65217
1.65138
1.65225
1.6532
1.65423
1.65355
1.6547
1.65589
1.65536
1.65667
1.65623
1.65764
1.65733
1.6588
1.65865
1.66018
1.66017
1.66173
1.66188
1.66345
1.66377
1.66525
1.66657
1.66773
1.66856
1.6709
1.67305
1.67473
1.6713
1.66975
1.6689
1.66746
1.66618
1.66488
1.66457
1.66321
1.66306
1.66166
1.66165
1.66025
1.66038
1.65902
1.65927
1.65797
1.65832
1.6571
1.65753
1.6564
1.6553
1.65587
1.65486
1.6539
1.653
1.65371
1.65457
1.65547
1.65603
1.65518
1.65438
1.65362
1.65291
1.65224
1.65163
1.65237
1.65296
1.65359
1.65424
1.65363
1.65306
1.65254
1.65319
1.65272
1.65229
1.65292
1.65252
1.65215
1.65274
1.6524
1.65209
1.65265
1.65235
1.65207
1.65259
1.65232
1.65207
1.65255
1.65231
1.65208
1.65254
1.65231
1.65274
1.65252
1.6523
1.65271
1.65293
1.65317
1.6534
1.65298
1.65322
1.65277
1.65302
1.65329
1.65281
1.65309
1.65338
1.65287
1.65318
1.6535
1.65296
1.65331
1.65367
1.65311
1.65351
1.65393
1.65335
1.65381
1.65431
1.6537
1.65426
1.65484
1.65547
1.65489
1.65428
1.655
1.65576
1.65656
1.65707
1.65631
1.65558
1.65613
1.65682
1.65754
1.65799
1.6573
1.65664
1.65601
1.65541
1.65484
1.6554
1.65488
1.65439
1.65494
1.65449
1.65407
1.6546
1.65421
1.65384
1.65435
1.65401
1.65368
1.65417
1.65386
1.65357
1.65402
1.65374
1.65348
1.65391
1.65365
1.65407
1.65382
1.65357
1.65334
1.65311
1.65289
1.65267
1.65246
1.65226
1.65206
1.65187
1.65167
1.65147
1.65131
1.65116
1.651
1.65084
1.65069
1.65055
1.65041
1.65028
1.65015
1.65003
1.64991
1.6498
1.6497
1.64962
1.64954
1.64948
1.64967
1.64973
1.64982
1.65003
1.64992
1.64986
1.65005
1.65011
1.65026
1.65038
1.65015
1.64992
1.65003
1.65015
1.65028
1.65053
1.6504
1.65027
1.65051
1.65065
1.65079
1.65105
1.6509
1.65075
1.65061
1.65048
1.65034
1.65025
1.65047
1.65071
1.65065
1.65055
1.6507
1.6509
1.65115
1.65141
1.65111
1.65124
1.65105
1.65099
1.65057
1.65086
1.65084
1.65089
1.65119
1.65115
1.65145
1.65136
1.65136
1.65162
1.65164
1.65165
1.65189
1.65188
1.65195
1.65219
1.65225
1.65229
1.65251
1.6525
1.65256
1.65274
1.6528
1.65285
1.65301
1.65305
1.65314
1.65329
1.65339
1.65352
1.65357
1.65366
1.65377
1.65371
1.65364
1.65369
1.65351
1.65335
1.65317
1.6532
1.6533
1.65303
1.65293
1.65299
1.65292
1.65267
1.65276
1.65303
1.65265
1.65245
1.65252
1.65236
1.65209
1.65216
1.65242
1.65207
1.65186
1.65197
1.65192
1.6516
1.65177
1.6522
1.65181
1.6515
1.65166
1.6512
1.6512
1.65139
1.65201
1.65147
1.65177
1.65244
1.65195
1.65243
1.65182
1.65141
1.65112
1.65086
1.651
1.65116
1.65133
1.65159
1.65142
1.65124
1.65154
1.65167
1.65185
1.65204
1.65176
1.6515
1.6512
1.65094
1.65067
1.65041
1.65054
1.65069
1.65083
1.65112
1.65097
1.65082
1.6511
1.65126
1.65142
1.65158
1.65127
1.65098
1.65115
1.65131
1.65148
1.65181
1.65162
1.65145
1.65176
1.65194
1.65213
1.65246
1.65227
1.65208
1.6519
1.65172
1.65154
1.65137
1.65167
1.65184
1.65202
1.65231
1.65213
1.65196
1.65224
1.65242
1.6526
1.65279
1.6525
1.6522
1.65239
1.65258
1.65278
1.65309
1.65289
1.65269
1.65299
1.65319
1.65339
1.65369
1.65348
1.65328
1.65308
1.65287
1.65273
1.65247
1.65233
1.65208
1.65182
1.65232
1.65275
1.6524
1.65266
1.65299
1.65274
1.65302
1.65342
1.65321
1.65334
1.65355
1.65377
1.65397
1.65422
1.65406
1.65382
1.65352
1.65393
1.65442
1.65416
1.65435
1.65471
1.65452
1.65473
1.65447
1.65417
1.65389
1.6536
1.65329
1.65297
1.65265
1.65232
1.65199
1.65165
1.65183
1.65203
1.65223
1.65258
1.65238
1.65218
1.65252
1.65272
1.65292
1.65313
1.65278
1.65242
1.65263
1.65284
1.65305
1.65342
1.6532
1.65299
1.65334
1.65356
1.65378
1.65413
1.65391
1.65369
1.65347
1.65326
1.65305
1.65285
1.65317
1.65338
1.65359
1.65391
1.6537
1.65349
1.65381
1.65401
1.65423
1.65444
1.65413
1.6538
1.65402
1.65424
1.65447
1.6548
1.65457
1.65435
1.65467
1.65489
1.65512
1.65536
1.65503
1.6547
1.65436
1.65401
1.65364
1.65327
1.6535
1.65373
1.65397
1.65435
1.65411
1.65387
1.65424
1.65448
1.65472
1.65497
1.6546
1.65421
1.65447
1.65473
1.65433
1.6546
1.65418
1.65446
1.65476
1.65432
1.65463
1.65495
1.65449
1.65483
1.65519
1.65471
1.6551
1.65551
1.65501
1.65545
1.65592
1.65541
1.65592
1.65645
1.65594
1.65652
1.65713
1.65776
1.65842
1.65882
1.65819
1.65759
1.657
1.65746
1.65692
1.65641
1.65687
1.65639
1.65594
1.6564
1.65598
1.65558
1.65603
1.65565
1.65529
1.65573
1.65539
1.65507
1.65549
1.65518
1.65489
1.65529
1.65501
1.6554
1.65512
1.65486
1.65523
1.65549
1.65577
1.65613
1.65586
1.65559
1.65533
1.65508
1.65483
1.65459
1.65494
1.65518
1.65542
1.65576
1.65551
1.65527
1.65559
1.65584
1.65609
1.65633
1.65602
1.65568
1.65594
1.65621
1.65648
1.6568
1.65654
1.65627
1.65657
1.65683
1.65706
1.65732
1.65709
1.65681
1.6566
1.65639
1.65615
1.65591
1.65567
1.65543
1.6552
1.65497
1.65475
1.65453
1.65431
1.6541
1.65439
1.6546
1.65482
1.65507
1.6549
1.65465
1.65497
1.65517
1.65556
1.65517
1.65539
1.65559
1.65533
1.65504
1.65526
1.65549
1.65572
1.65599
1.65579
1.65553
1.65586
1.65605
1.65647
1.65605
1.65632
1.6565
1.65626
1.65595
1.65619
1.65642
1.65667
1.65698
1.65676
1.65648
1.65681
1.65699
1.65747
1.657
1.65729
1.65746
1.65716
1.65688
1.65706
1.6573
1.65784
1.65768
1.65786
1.65763
1.65735
1.65708
1.65677
1.65642
1.65606
1.65568
1.65598
1.65559
1.6559
1.65622
1.65581
1.65615
1.6565
1.65609
1.65646
1.65685
1.65643
1.65684
1.65727
1.65685
1.65731
1.6578
1.65737
1.65789
1.65843
1.65802
1.65861
1.6592
1.65956
1.65899
1.65935
1.65882
1.6583
1.65869
1.6582
1.65773
1.65813
1.65768
1.65726
1.65766
1.65726
1.65687
1.65727
1.6569
1.65655
1.65694
1.65661
1.65629
1.65666
1.65635
1.65672
1.65704
1.65734
1.65702
1.65732
1.65698
1.65731
1.65765
1.65728
1.65764
1.65801
1.65764
1.65804
1.65844
1.65807
1.6585
1.65894
1.65858
1.65905
1.65952
1.65918
1.6597
1.6602
1.65989
1.66044
1.66015
1.65981
1.65946
1.65909
1.6587
1.65829
1.65785
1.65739
1.65691
1.6564
1.65737
1.6569
1.65795
1.65901
1.65866
1.6598
1.65953
1.66072
1.66054
1.66177
1.66169
1.66294
1.66298
1.66422
1.66437
1.66558
1.6658
1.66689
1.66772
1.66816
1.66677
1.6664
1.66536
1.66523
1.66412
1.66408
1.66294
1.66299
1.66187
1.66199
1.66091
1.66111
1.66007
1.66034
1.65935
1.65835
1.65874
1.65782
1.65825
1.65912
1.66
1.65968
1.66061
1.66154
1.66132
1.6623
1.66213
1.6631
1.66302
1.66399
1.66412
1.66542
1.66516
1.66611
1.66634
1.6676
1.66727
1.66918
1.67129
1.67299
1.67006
1.66854
1.66648
1.6664
1.66486
1.66519
1.66406
1.66399
1.66466
1.66358
1.66323
1.66249
1.66256
1.66171
1.66087
1.66112
1.6603
1.65947
1.65866
1.65905
1.65982
1.6606
1.66137
1.66211
1.66191
1.66269
1.66363
1.66341
1.66473
1.66343
1.66347
1.66268
1.66245
1.66162
1.66088
1.66015
1.65942
1.65978
1.66046
1.66113
1.6614
1.66077
1.66011
1.66043
1.66105
1.66163
1.66211
1.66204
1.66183
1.66257
1.66278
1.66386
1.66291
1.66295
1.66194
1.66131
1.66073
1.66097
1.6614
1.66221
1.66223
1.66123
1.66069
1.66086
1.66167
1.66162
1.66073
1.66047
1.66001
1.66028
1.65984
1.65939
1.6597
1.65927
1.65885
1.65919
1.65879
1.65839
1.65873
1.65836
1.658
1.65833
1.65799
1.65764
1.65797
1.65765
1.65793
1.65762
1.65734
1.65762
1.65789
1.65815
1.65841
1.65823
1.65858
1.65832
1.65864
1.65895
1.65868
1.65905
1.6594
1.65911
1.65949
1.65985
1.65959
1.65997
1.66034
1.66011
1.66048
1.66122
1.6612
1.66084
1.66091
1.66019
1.66009
1.65977
1.66002
1.66062
1.66058
1.65995
1.65916
1.65892
1.6592
1.65976
1.6597
1.65912
1.65901
1.65831
1.65813
1.65786
1.65822
1.65836
1.65953
1.65835
1.65795
1.65772
1.65726
1.65856
1.65949
1.65912
1.65854
1.65754
1.65711
1.65751
1.65661
1.6562
1.65667
1.65575
1.65533
1.65577
1.65499
1.65459
1.65399
1.65349
1.65327
1.65421
1.6551
1.65427
1.65357
1.65297
1.6525
1.65207
1.6519
1.65163
1.6534
1.65479
1.6538
1.65454
1.65609
1.65517
1.65606
1.65765
1.65681
1.65765
1.65933
1.65855
1.65942
1.66116
1.66042
1.66131
1.66051
1.66145
1.66068
1.65967
1.6592
1.65843
1.65884
1.66036
1.66093
1.66047
1.66107
1.66252
1.66127
1.66235
1.66169
1.66335
1.66198
1.66318
1.66269
1.66445
1.66311
1.66431
1.66424
1.66596
1.66499
1.66498
1.6667
1.66627
1.66666
1.66644
1.66459
1.66804
1.66835
1.67024
1.67218
1.6691
1.66862
1.66889
1.66642
1.67196
1.66839
1.66869
1.66649
1.66667
1.66851
1.66858
1.67179
1.67516
1.67595
1.67753
1.67472
1.67513
1.67746
1.67844
1.68173
1.68314
1.68657
1.68809
1.69078
1.69307
1.69479
1.69614
1.69717
1.69797
1.69859
1.69907
1.69882
1.69839
1.69804
1.69839
1.69783
1.69758
1.69696
1.69709
1.69607
1.69609
1.69469
1.6928
1.69917
1.69865
1.698
1.69794
1.6986
1.69915
1.69904
1.69888
1.69868
1.69809
1.6983
1.69848
1.69781
1.69763
1.69743
1.69667
1.69686
1.69702
1.69713
1.69719
1.69618
1.69491
1.69335
1.69357
1.69498
1.69615
1.69608
1.69596
1.69581
1.69485
1.69494
1.69498
1.69371
1.69378
1.69378
1.69262
1.6925
1.69228
1.69193
1.69145
1.68928
1.68702
1.68527
1.68291
1.67978
1.6827
1.68487
1.68641
1.68824
1.69013
1.69072
1.69112
1.69138
1.6901
1.68969
1.6891
1.68749
1.68827
1.68881
1.68755
1.68689
1.68598
1.68473
1.68301
1.68064
1.67907
1.68148
1.68026
1.678
1.67722
1.67471
1.67182
1.67188
1.66921
1.6665
1.66461
1.66414
1.66577
1.66514
1.66621
1.66344
1.66386
1.66186
1.66179
1.66251
1.66314
1.66523
1.66745
1.66972
1.67012
1.66815
1.66621
1.66437
1.66262
1.66098
1.65945
1.65801
1.6567
1.65558
1.65388
1.65324
1.65315
1.65283
1.65246
1.65386
1.65468
1.6538
1.65415
1.65389
1.65393
1.65334
1.65388
1.65393
1.65388
1.65395
1.65397
1.65405
1.65415
1.65422
1.65429
1.65438
1.65442
1.65449
1.65457
1.65465
1.65471
1.65475
1.65475
1.65469
1.65459
1.65447
1.65451
1.65456
1.65434
1.6543
1.65433
1.65422
1.65406
1.65411
1.65416
1.65413
1.65447
1.65447
1.65472
1.6551
1.65483
1.65467
1.65445
1.65485
1.65469
1.65509
1.65505
1.65513
1.65551
1.6555
1.65527
1.65525
1.65541
1.6555
1.65548
1.65545
1.65557
1.65544
1.65557
1.65573
1.65577
1.65553
1.65582
1.6558
1.65569
1.65568
1.65552
1.65543
1.65557
1.65521
1.65555
1.65571
1.65576
1.65547
1.65637
1.65609
1.65586
1.6559
1.65587
1.65585
1.65603
1.6561
1.65607
1.65598
1.65602
1.65586
1.65592
1.6561
1.6558
1.656
1.65614
1.656
1.65583
1.65601
1.65584
1.65589
1.65609
1.65577
1.65599
1.65596
1.65571
1.65585
1.656
1.65616
1.65651
1.65619
1.65595
1.6557
1.65589
1.65592
1.65587
1.65573
1.65581
1.65602
1.65596
1.65564
1.6557
1.65589
1.65542
1.65567
1.65566
1.65554
1.65541
1.65533
1.65559
1.65546
1.65511
1.6552
1.65537
1.65524
1.65504
1.65544
1.65518
1.65469
1.65459
1.655
1.65495
1.6548
1.65453
1.65454
1.65462
1.65424
1.65415
1.65428
1.65387
1.65382
1.6541
1.65356
1.65318
1.65362
1.6534
1.65347
1.65302
1.65307
1.65304
1.65267
1.65253
1.65276
1.65253
1.65213
1.65213
1.65229
1.65232
1.65229
1.65161
1.65138
1.65182
1.65167
1.65131
1.65086
1.65078
1.6503
1.65018
1.65016
1.64969
1.64958
1.64983
1.64957
1.64912
1.64907
1.64868
1.64929
1.64967
1.65007
1.65035
1.65059
1.65082
1.65119
1.65141
1.65065
1.65038
1.64955
1.64926
1.64894
1.64816
1.64728
1.64777
1.64821
1.64824
1.64759
1.64743
1.64723
1.64681
1.64677
1.64654
1.64613
1.64595
1.6461
1.64575
1.64531
1.64523
1.64531
1.64565
1.64585
1.64629
1.64622
1.64714
1.64473
1.64434
1.64476
1.64446
1.64381
1.64309
1.64295
1.64222
1.64205
1.64187
1.64131
1.64114
1.64137
1.641
1.64048
1.6404
1.64051
1.64003
1.63954
1.63896
1.63906
1.63812
1.63799
1.63712
1.63697
1.637
1.63654
1.63607
1.63593
1.63598
1.6355
1.63504
1.63484
1.63489
1.63548
1.636
1.6344
1.63392
1.6343
1.63381
1.63287
1.6319
1.63171
1.63073
1.63049
1.63014
1.6295
1.62927
1.62946
1.62896
1.62837
1.62823
1.62829
1.62792
1.62889
1.62966
1.63027
1.63108
1.63148
1.63208
1.63263
1.63338
1.63224
1.63172
1.62995
1.6294
1.62886
1.62715
1.62519
1.62558
1.62621
1.62638
1.62505
1.62482
1.62364
1.62345
1.62286
1.62227
1.62202
1.62209
1.62143
1.62081
1.62059
1.62155
1.6225
1.62036
1.61969
1.62
1.61912
1.61787
1.61658
1.61627
1.6164
1.61571
1.615
1.61465
1.6141
1.61348
1.61283
1.61255
1.61211
1.61071
1.61042
1.6088
1.60848
1.6085
1.60767
1.60697
1.60652
1.60664
1.60576
1.605
1.60467
1.60613
1.60773
1.60791
1.60868
1.60996
1.61147
1.61175
1.61242
1.61298
1.61315
1.61334
1.61432
1.61558
1.61594
1.61699
1.61754
1.6187
1.61746
1.61674
1.6144
1.61362
1.61376
1.61607
1.61844
1.61906
1.62126
1.62188
1.62395
1.62457
1.62651
1.6283
1.62768
1.62589
1.62525
1.62333
1.62268
1.62064
1.62
1.61784
1.6155
1.61302
1.61056
1.60986
1.60707
1.60407
1.60109
1.60407
1.60494
1.60339
1.60645
1.60587
1.60285
1.60231
1.59913
1.59861
1.60174
1.60466
1.60526
1.60799
1.60862
1.60925
1.61183
1.61245
1.6149
1.6172
1.61654
1.61426
1.6136
1.61119
1.61055
1.60991
1.60737
1.60676
1.60406
1.60117
1.59808
1.59756
1.60063
1.60349
1.60296
1.60012
1.59709
1.59666
1.59966
1.60247
1.60512
1.60562
1.60617
1.6087
1.60929
1.61168
1.61231
1.61295
1.61521
1.61587
1.618
1.61867
1.61934
1.62136
1.62202
1.62393
1.62459
1.62639
1.62704
1.62874
1.62938
1.63
1.63059
1.63113
1.63279
1.63335
1.6349
1.63546
1.63691
1.63745
1.63799
1.6384
1.63852
1.63756
1.63647
1.63636
1.63938
1.64058
1.64102
1.64136
1.6419
1.64243
1.64278
1.64313
1.64363
1.64411
1.64312
1.64273
1.64143
1.64386
1.64339
1.64224
1.64178
1.64291
1.64241
1.64127
1.64008
1.63882
1.63827
1.63954
1.63899
1.63771
1.63635
1.63577
1.63433
1.63374
1.63222
1.63161
1.63099
1.63252
1.63313
1.63458
1.63518
1.63655
1.63714
1.63842
1.63785
1.6391
1.63965
1.6402
1.64075
1.64189
1.64137
1.64248
1.64299
1.64349
1.64398
1.64446
1.64492
1.64538
1.64637
1.64681
1.64772
1.64856
1.64815
1.64729
1.64686
1.64592
1.64546
1.64641
1.64732
1.64774
1.64858
1.64896
1.64933
1.64968
1.65001
1.65071
1.65103
1.65166
1.65196
1.65252
1.65282
1.65325
1.65341
1.65382
1.65409
1.65421
1.65436
1.65447
1.65473
1.65478
1.65419
1.65405
1.65358
1.65443
1.65481
1.6549
1.65525
1.65532
1.65558
1.65547
1.65578
1.6559
1.65561
1.65546
1.65578
1.65609
1.65626
1.6559
1.65601
1.65562
1.65566
1.65523
1.65522
1.65475
1.6543
1.65386
1.65372
1.65419
1.65469
1.65521
1.65574
1.6557
1.65621
1.65611
1.6566
1.65644
1.65691
1.65668
1.65644
1.65684
1.65714
1.65766
1.65729
1.6569
1.65649
1.65688
1.65735
1.65781
1.65822
1.65859
1.658
1.65744
1.6577
1.65713
1.65733
1.65676
1.65689
1.6563
1.65637
1.65577
1.6552
1.65463
1.65409
1.65356
1.65305
1.65283
1.65226
1.65201
1.65138
1.6511
1.6504
1.65007
1.64974
1.6505
1.6508
1.65151
1.65176
1.65242
1.65262
1.65324
1.6534
1.65397
1.65457
1.65449
1.65386
1.65373
1.65308
1.6529
1.65221
1.65198
1.65125
1.65098
1.6502
1.6494
1.64905
1.6482
1.64781
1.6469
1.64597
1.645
1.64452
1.64552
1.64648
1.64604
1.64506
1.64404
1.64356
1.64459
1.64559
1.64513
1.64411
1.64306
1.64197
1.64083
1.64029
1.63974
1.63853
1.63727
1.63596
1.63535
1.63397
1.63335
1.63189
1.63035
1.62971
1.62809
1.62744
1.62573
1.62507
1.62326
1.62259
1.62069
1.62002
1.62193
1.62374
1.6244
1.62612
1.62678
1.62841
1.62906
1.63061
1.63125
1.63272
1.63209
1.63146
1.62997
1.62933
1.62776
1.62712
1.62547
1.62483
1.62309
1.62127
1.61936
1.61734
1.61669
1.61456
1.61393
1.61333
1.61108
1.61051
1.60814
1.60762
1.60998
1.61221
1.61275
1.61488
1.61546
1.61606
1.61809
1.61871
1.62063
1.62246
1.6242
1.62587
1.62649
1.62808
1.6287
1.63021
1.63083
1.63228
1.63289
1.63351
1.63413
1.63474
1.63608
1.63668
1.63795
1.63918
1.64035
1.6409
1.64144
1.64255
1.64362
1.64465
1.64417
1.64311
1.64202
1.64149
1.6426
1.64367
1.64472
1.64519
1.64566
1.64612
1.64656
1.64699
1.64741
1.64831
1.64869
1.64954
1.64988
1.65068
1.65147
1.65174
1.65249
1.65271
1.65342
1.65359
1.65428
1.6544
1.65506
1.65513
1.65517
1.65579
1.65641
1.65706
1.65699
1.65762
1.65749
1.65811
1.65793
1.65855
1.65829
1.65892
1.65919
1.65941
1.65876
1.65892
1.65826
1.65837
1.65771
1.65776
1.65709
1.65643
1.65577
1.65573
1.65641
1.65709
1.65777
1.65846
1.65843
1.65912
1.65904
1.65972
1.65959
1.66027
1.66009
1.65986
1.65957
1.65923
1.65883
1.65838
1.65788
1.65733
1.65675
1.65613
1.65655
1.65585
1.65625
1.65532
1.65495
1.65462
1.65455
1.65405
1.65408
1.65395
1.6538
1.65429
1.65483
1.65418
1.6548
1.65535
1.65605
1.65698
1.65811
1.6593
1.6582
1.65726
1.65646
1.65584
1.65679
1.65768
1.65708
1.65782
1.65723
1.65788
1.65847
1.65914
1.65851
1.65922
1.6585
1.65925
1.65842
1.65749
1.65832
1.65928
1.66035
1.66125
1.66022
1.65928
1.66011
1.66104
1.66202
1.66268
1.66174
1.66084
1.66
1.66064
1.65986
1.66042
1.65969
1.65901
1.65949
1.66018
1.66091
1.66167
1.6612
1.66201
1.66146
1.66234
1.66324
1.66372
1.66285
1.66328
1.66247
1.66285
1.66208
1.66132
1.6606
1.6599
1.66025
1.66095
1.66167
1.66196
1.66124
1.66054
1.66078
1.66148
1.66219
1.66292
1.66269
1.66241
1.66318
1.66396
1.66365
1.66446
1.66412
1.66499
1.66462
1.66418
1.66366
1.66305
1.66234
1.66149
1.66051
1.65938
1.66074
1.66217
1.66369
1.66528
1.66696
1.66868
1.67043
1.67066
1.6691
1.66756
1.66602
1.66455
1.66314
1.66179
1.6627
1.66396
1.66527
1.66588
1.66465
1.66347
1.66413
1.66523
1.66639
1.66756
1.66715
1.66664
1.66804
1.66944
1.67085
1.67099
1.6697
1.66842
1.66873
1.66991
1.67109
1.67225
1.67226
1.67225
1.67223
1.67218
1.67211
1.67201
1.67418
1.6744
1.67662
1.67849
1.67929
1.68095
1.68201
1.68326
1.68459
1.68559
1.68634
1.68521
1.68441
1.68337
1.68228
1.68334
1.68417
1.68483
1.68583
1.6869
1.68803
1.68919
1.69037
1.69153
1.69266
1.69373
1.69472
1.69564
1.69646
1.6972
1.69787
1.69846
1.69823
1.698
1.69778
1.69717
1.6974
1.69763
1.69697
1.69675
1.69652
1.6963
1.69695
1.69755
1.69733
1.69712
1.69691
1.69632
1.69652
1.69673
1.69609
1.69589
1.69571
1.69506
1.69523
1.69542
1.69561
1.69582
1.69603
1.69625
1.69545
1.69526
1.69507
1.69427
1.69443
1.69458
1.69365
1.69354
1.69343
1.6933
1.69411
1.69488
1.69471
1.69454
1.69439
1.69369
1.69382
1.69396
1.69318
1.69307
1.69297
1.69288
1.69358
1.69425
1.69491
1.69554
1.69614
1.69672
1.69654
1.69637
1.69623
1.69569
1.69582
1.69597
1.69538
1.69525
1.69514
1.69504
1.69559
1.69611
1.696
1.69592
1.69585
1.69538
1.69543
1.6955
1.69497
1.69493
1.6949
1.69439
1.69441
1.69444
1.69448
1.69456
1.69465
1.69477
1.69413
1.69403
1.69396
1.69336
1.69341
1.69348
1.69282
1.69277
1.69274
1.69272
1.69333
1.69391
1.69389
1.69387
1.69386
1.69333
1.69331
1.69331
1.69273
1.69275
1.69279
1.69224
1.69218
1.69214
1.69211
1.6921
1.69211
1.69214
1.69218
1.69223
1.6923
1.69238
1.69246
1.69254
1.69261
1.69266
1.69161
1.69164
1.69163
1.69069
1.69064
1.69054
1.68945
1.68963
1.68975
1.68983
1.69072
1.6916
1.69156
1.69152
1.69149
1.69073
1.69073
1.69072
1.68988
1.68993
1.68996
1.6892
1.68913
1.68904
1.68894
1.6888
1.68862
1.68837
1.68732
1.68763
1.68787
1.68697
1.68668
1.68631
1.68535
1.68576
1.68609
1.68636
1.6872
1.68806
1.68821
1.68833
1.68845
1.6877
1.68755
1.68739
1.6866
1.6868
1.68698
1.68715
1.68785
1.68855
1.68927
1.69
1.69073
1.69146
1.69145
1.69145
1.69146
1.69082
1.69078
1.69075
1.69005
1.6901
1.69017
1.69025
1.69087
1.69149
1.69154
1.69161
1.69169
1.69114
1.69103
1.69094
1.69035
1.69046
1.69059
1.69004
1.68989
1.68976
1.68964
1.68953
1.68944
1.68935
1.68866
1.68878
1.6889
1.68828
1.68813
1.68799
1.68733
1.6875
1.68767
1.68786
1.68844
1.68903
1.68918
1.68934
1.68951
1.68898
1.68879
1.68861
1.68805
1.68825
1.68847
1.68797
1.68774
1.68751
1.6873
1.68709
1.68688
1.68668
1.68649
1.68628
1.68607
1.68583
1.68557
1.68526
1.68489
1.68444
1.68389
1.68321
1.68237
1.68133
1.68005
1.67928
1.67783
1.67613
1.67574
1.67401
1.67386
1.67541
1.6768
1.67728
1.67861
1.67976
1.68049
1.6815
1.68234
1.68155
1.68073
1.68003
1.67911
1.67803
1.67752
1.67639
1.67512
1.67372
1.6736
1.67486
1.67602
1.67569
1.67463
1.67348
1.67336
1.67441
1.67539
1.6763
1.67666
1.67707
1.67801
1.67853
1.6794
1.68017
1.68082
1.6815
1.68223
1.68303
1.6836
1.68407
1.68447
1.68372
1.6833
1.68281
1.68208
1.68258
1.68302
1.6834
1.68408
1.6848
1.6851
1.68536
1.68561
1.68497
1.6847
1.6844
1.68375
1.68406
1.68436
1.68378
1.68346
1.68313
1.68277
1.68237
1.68192
1.68141
1.68084
1.68023
1.67958
1.67884
1.67833
1.67754
1.67712
1.67787
1.67855
1.67904
1.67967
1.68024
1.6808
1.68131
1.68176
1.6812
1.68074
1.68023
1.67972
1.67916
1.6787
1.67811
1.67746
1.67674
1.67597
1.67512
1.67421
1.67324
1.67222
1.67116
1.67007
1.66898
1.66789
1.66681
1.66573
1.66468
1.66515
1.66615
1.66715
1.66743
1.66649
1.66555
1.66588
1.66677
1.66765
1.66855
1.66838
1.66816
1.66917
1.6702
1.6712
1.67122
1.67029
1.66933
1.66946
1.67035
1.67122
1.67121
1.67038
1.66955
1.66869
1.66784
1.66699
1.66614
1.6653
1.66555
1.66476
1.66498
1.66421
1.66344
1.66366
1.6644
1.66515
1.66529
1.66456
1.66383
1.6631
1.66238
1.66167
1.66096
1.6611
1.66041
1.6605
1.65981
1.65985
1.65916
1.65916
1.65845
1.65775
1.65705
1.65636
1.65566
1.65497
1.65485
1.65414
1.65397
1.65323
1.65302
1.65225
1.65199
1.65119
1.65037
1.65004
1.64919
1.64881
1.64791
1.64751
1.64843
1.64933
1.64969
1.65056
1.65088
1.65171
1.65252
1.65278
1.65356
1.65378
1.65453
1.6547
1.65543
1.65556
1.65627
1.65699
1.65689
1.65616
1.65602
1.65528
1.65509
1.65433
1.65411
1.65332
1.65305
1.65223
1.6514
1.65107
1.65021
1.64985
1.64894
1.64802
1.64708
1.64664
1.6476
1.64854
1.64813
1.64717
1.6462
1.64574
1.64673
1.64771
1.64867
1.64907
1.64947
1.65037
1.65073
1.6516
1.65193
1.65276
1.65246
1.65213
1.65126
1.6509
1.64999
1.64961
1.65053
1.65144
1.65179
1.65267
1.653
1.6533
1.65359
1.65386
1.65466
1.65489
1.65566
1.65585
1.65661
1.65676
1.6575
1.65761
1.6577
1.65841
1.65912
1.65984
1.65986
1.66057
1.66055
1.66126
1.6612
1.66191
1.66181
1.66252
1.66261
1.66267
1.66196
1.66199
1.66128
1.66126
1.66055
1.6605
1.65978
1.65906
1.65834
1.65823
1.65897
1.6597
1.66043
1.66115
1.66122
1.66194
1.66198
1.66269
1.66269
1.6634
1.66338
1.66332
1.66323
1.66395
1.66467
1.66539
1.66546
1.66475
1.66404
1.66409
1.66479
1.6655
1.66551
1.66481
1.66411
1.6641
1.66339
1.66336
1.66265
1.66259
1.66187
1.66178
1.66106
1.66032
1.65959
1.65885
1.6581
1.65736
1.65719
1.65643
1.65623
1.65545
1.65521
1.6544
1.65413
1.65384
1.65468
1.65496
1.65577
1.65601
1.6568
1.65701
1.65778
1.65795
1.65871
1.65945
1.6593
1.65854
1.65836
1.65758
1.65737
1.65657
1.65633
1.65551
1.65524
1.65439
1.65354
1.65322
1.65234
1.65199
1.65108
1.65015
1.64921
1.64825
1.64728
1.64628
1.64527
1.64423
1.64317
1.64208
1.64096
1.6398
1.63861
1.63737
1.63678
1.63548
1.63488
1.63427
1.6356
1.63619
1.63746
1.63803
1.63924
1.64042
1.64155
1.64266
1.64215
1.64103
1.63987
1.63868
1.63812
1.63688
1.63631
1.63501
1.63367
1.63307
1.63167
1.63107
1.6296
1.62901
1.62747
1.62688
1.62527
1.62359
1.62184
1.62001
1.61941
1.61748
1.61691
1.61637
1.61434
1.61384
1.61172
1.60949
1.60714
1.60466
1.60204
1.59925
1.59629
1.59598
1.5989
1.60166
1.60134
1.59862
1.59574
1.59558
1.59841
1.60109
1.60364
1.60392
1.60426
1.60672
1.60905
1.61127
1.61087
1.60867
1.60635
1.60605
1.60834
1.61052
1.61261
1.61297
1.61338
1.6154
1.61586
1.61779
1.6183
1.61884
1.62068
1.62125
1.623
1.62469
1.62631
1.62787
1.62843
1.62992
1.63049
1.63192
1.63249
1.63386
1.63443
1.63574
1.63518
1.63464
1.6333
1.63275
1.63136
1.63082
1.62937
1.62884
1.62733
1.62576
1.62413
1.62244
1.62191
1.62014
1.61964
1.61917
1.61732
1.6169
1.61498
1.6146
1.61651
1.61834
1.61874
1.6205
1.62094
1.62141
1.62311
1.62361
1.62524
1.62681
1.62632
1.62474
1.62428
1.62264
1.6222
1.62179
1.6201
1.61973
1.61798
1.61616
1.61427
1.61229
1.61023
1.60806
1.6058
1.60341
1.60091
1.59827
1.59549
1.59547
1.59259
1.59272
1.58976
1.5866
1.58326
1.57978
1.58043
1.5769
1.57772
1.57417
1.57045
1.57167
1.5752
1.57858
1.57949
1.57627
1.57291
1.57418
1.57736
1.58044
1.5834
1.58259
1.58182
1.5811
1.58433
1.58376
1.58692
1.58999
1.5903
1.58739
1.58789
1.58493
1.58557
1.58626
1.58901
1.58843
1.59117
1.59072
1.59341
1.59311
1.5929
1.59565
1.59552
1.59819
1.5982
1.60079
1.60073
1.60073
1.59824
1.59837
1.59581
1.596
1.59851
1.6009
1.60078
1.6031
1.6031
1.60315
1.60325
1.6056
1.60784
1.60997
1.60977
1.60766
1.60546
1.60537
1.60754
1.60961
1.60949
1.60745
1.60532
1.60532
1.60315
1.60325
1.60102
1.59869
1.59628
1.59378
1.59418
1.59165
1.59216
1.58962
1.58698
1.58424
1.5814
1.57847
1.57545
1.57233
1.56914
1.56588
1.56256
1.55921
1.55585
1.5525
1.5492
1.55209
1.55516
1.55828
1.56059
1.55767
1.5548
1.55734
1.56004
1.56278
1.56555
1.56353
1.56142
1.56456
1.56767
1.57074
1.57231
1.56941
1.56648
1.56833
1.5711
1.57384
1.57532
1.57272
1.5701
1.56748
1.56486
1.56227
1.55973
1.56197
1.56438
1.56683
1.56871
1.56637
1.56408
1.56606
1.56825
1.57048
1.57273
1.57106
1.56931
1.5718
1.57429
1.57676
1.57814
1.57579
1.57343
1.57498
1.57723
1.57948
1.5817
1.58047
1.5792
1.57789
1.57655
1.57517
1.57376
1.57671
1.57959
1.58238
1.58337
1.5807
1.57797
1.57921
1.58181
1.58435
1.58683
1.58596
1.58509
1.58772
1.59026
1.5927
1.59327
1.59091
1.58848
1.58924
1.59158
1.59385
1.59444
1.59226
1.59001
1.5877
1.58533
1.58291
1.58042
1.58161
1.58398
1.5863
1.58725
1.58503
1.58277
1.5839
1.58606
1.58818
1.59027
1.58942
1.58857
1.59078
1.59294
1.59504
1.59564
1.59362
1.59155
1.59231
1.5943
1.59624
1.59813
1.5976
1.59707
1.59655
1.59604
1.59555
1.59507
1.59461
1.59697
1.59661
1.59894
1.60118
1.60336
1.60545
1.60536
1.6074
1.60741
1.60941
1.60936
1.60935
1.60743
1.60749
1.60553
1.6035
1.60141
1.59923
1.59954
1.59735
1.59775
1.59817
1.60022
1.59987
1.60193
1.60166
1.60369
1.60565
1.60756
1.6094
1.60936
1.61116
1.61119
1.61125
1.61133
1.61145
1.6116
1.61179
1.61202
1.61398
1.61586
1.61766
1.61737
1.61558
1.61373
1.61351
1.61535
1.61711
1.61881
1.61909
1.6194
1.62107
1.62142
1.62304
1.62342
1.62384
1.62541
1.62585
1.62738
1.62784
1.62833
1.6298
1.6303
1.63171
1.63222
1.63359
1.6341
1.63542
1.63594
1.63647
1.63701
1.63756
1.63879
1.63933
1.6405
1.64164
1.64113
1.63997
1.63945
1.63825
1.63772
1.6372
1.63843
1.63894
1.64012
1.64063
1.64177
1.64226
1.64275
1.64325
1.64374
1.6448
1.64583
1.64684
1.6464
1.64537
1.64432
1.64384
1.64491
1.64595
1.64697
1.6474
1.64783
1.6488
1.64976
1.6507
1.65032
1.64936
1.64839
1.64797
1.64896
1.64993
1.64953
1.64855
1.64755
1.64654
1.6455
1.64444
1.64336
1.64289
1.64398
1.64505
1.6446
1.64352
1.64241
1.64128
1.6408
1.63963
1.63914
1.63793
1.63669
1.63619
1.63491
1.63441
1.63308
1.63259
1.63122
1.63074
1.62931
1.62885
1.63028
1.63166
1.63212
1.63346
1.63393
1.63523
1.6357
1.63696
1.63744
1.63866
1.63819
1.63772
1.63649
1.63603
1.63477
1.63431
1.63301
1.63257
1.63122
1.62984
1.62841
1.62694
1.62652
1.625
1.62461
1.62424
1.62268
1.62235
1.62075
1.62045
1.62204
1.62357
1.6239
1.62539
1.62575
1.62612
1.62759
1.62799
1.62942
1.6308
1.63214
1.63344
1.63387
1.63514
1.63558
1.63682
1.63727
1.63847
1.63892
1.63938
1.63985
1.64032
1.64147
1.64194
1.64306
1.64415
1.64522
1.64566
1.6461
1.64712
1.64813
1.64912
1.64871
1.64771
1.64669
1.64626
1.64729
1.64829
1.64787
1.64686
1.64583
1.64477
1.6437
1.6426
1.64214
1.64101
1.64055
1.6401
1.64124
1.64169
1.6428
1.64325
1.64433
1.64539
1.64642
1.64744
1.647
1.64599
1.64495
1.64389
1.64344
1.64235
1.64191
1.64079
1.63964
1.6392
1.63803
1.63758
1.63638
1.63595
1.63471
1.63429
1.63303
1.63173
1.63039
1.62901
1.62862
1.62721
1.62684
1.62649
1.62506
1.62474
1.62327
1.62175
1.62019
1.61856
1.61688
1.61514
1.61333
1.61318
1.61496
1.61668
1.6165
1.61482
1.61307
1.61297
1.61469
1.61635
1.61795
1.61814
1.61834
1.61994
1.62149
1.62298
1.62271
1.62124
1.61971
1.61951
1.62101
1.62246
1.62223
1.62079
1.61932
1.61779
1.61622
1.61459
1.61291
1.61286
1.61116
1.61117
1.60945
1.60765
1.60581
1.6039
1.60413
1.60221
1.60251
1.60059
1.5986
1.59905
1.60097
1.60283
1.60316
1.60136
1.59951
1.59997
1.60176
1.6035
1.60519
1.60491
1.60463
1.60438
1.60618
1.60599
1.60778
1.60951
1.60961
1.60792
1.60808
1.60638
1.6066
1.60683
1.60843
1.60825
1.60984
1.60972
1.61131
1.61125
1.61121
1.61283
1.61284
1.61445
1.61451
1.61611
1.61601
1.61593
1.6144
1.61438
1.61284
1.61286
1.61436
1.61582
1.61587
1.61732
1.61741
1.61752
1.61765
1.61915
1.6206
1.62201
1.6218
1.62042
1.61899
1.61885
1.62025
1.62161
1.62143
1.6201
1.61873
1.61862
1.61724
1.61717
1.61579
1.61437
1.6129
1.61139
1.61149
1.60998
1.61013
1.60862
1.60707
1.60548
1.60385
1.60216
1.60043
1.59866
1.59684
1.59497
1.59305
1.5911
1.5891
1.58706
1.58499
1.58289
1.58076
1.57862
1.57646
1.57431
1.57216
1.57003
1.56793
1.56587
1.56386
1.56191
1.56003
1.55823
1.55653
1.55491
1.5534
1.552
1.55069
1.54949
1.54838
1.54737
1.54645
1.5456
1.54483
1.54413
1.54349
1.5429
1.54235
1.54185
1.54139
1.54095
1.54054
1.54015
1.53978
1.53942
1.53908
1.53875
1.53842
1.5381
1.53778
1.53867
1.53902
1.53938
1.54029
1.5399
1.53951
1.5403
1.54072
1.54116
1.54161
1.54071
1.53975
1.54013
1.54052
1.54093
1.54202
1.54157
1.54113
1.54207
1.54256
1.54306
1.54404
1.54349
1.54297
1.54246
1.54197
1.5415
1.54104
1.54174
1.54223
1.54273
1.54345
1.54291
1.54239
1.54299
1.54354
1.54412
1.54471
1.54401
1.54326
1.54381
1.54438
1.54497
1.54584
1.5452
1.5446
1.54533
1.54598
1.54665
1.54735
1.5465
1.54559
1.54462
1.54359
1.5425
1.54136
1.5418
1.54227
1.54277
1.54409
1.54353
1.54301
1.54414
1.54472
1.54534
1.54599
1.54468
1.5433
1.54387
1.54448
1.54514
1.54671
1.54599
1.54531
1.54668
1.54741
1.54819
1.54958
1.54875
1.54796
1.54722
1.54652
1.54585
1.54522
1.54624
1.54692
1.54763
1.54868
1.54792
1.54719
1.54809
1.54886
1.54966
1.5505
1.54948
1.54838
1.54917
1.55001
1.55089
1.55212
1.5512
1.55031
1.55138
1.55231
1.55327
1.55435
1.55335
1.55238
1.55146
1.55058
1.54974
1.54893
1.54815
1.54741
1.5467
1.54602
1.54537
1.54474
1.54413
1.54355
1.54407
1.54468
1.54531
1.54584
1.54518
1.54455
1.54498
1.54564
1.54633
1.54705
1.54653
1.54597
1.54666
1.54737
1.54812
1.54878
1.548
1.54725
1.54779
1.54857
1.54938
1.54994
1.5491
1.54829
1.54752
1.54677
1.54606
1.54538
1.54573
1.54644
1.54718
1.54755
1.54679
1.54606
1.54635
1.5471
1.54788
1.5487
1.54834
1.54795
1.54875
1.54959
1.55046
1.55093
1.55003
1.54917
1.54955
1.55044
1.55136
1.55232
1.55186
1.55136
1.55082
1.55023
1.54959
1.5489
1.54971
1.55055
1.55144
1.55224
1.55132
1.55044
1.55111
1.55202
1.55298
1.55397
1.55319
1.55236
1.55332
1.55432
1.55536
1.5563
1.55523
1.55419
1.555
1.55607
1.55718
1.55799
1.55685
1.55575
1.55469
1.55367
1.55268
1.55173
1.55231
1.55329
1.5543
1.55489
1.55384
1.55284
1.55332
1.55436
1.55543
1.55654
1.55597
1.55536
1.55645
1.55758
1.55874
1.55944
1.55825
1.55709
1.55768
1.55887
1.56009
1.56134
1.56067
1.55995
1.55917
1.55833
1.55742
1.55645
1.5554
1.55429
1.55309
1.55182
1.55046
1.54901
1.54748
1.54585
1.54662
1.54746
1.54836
1.55016
1.5492
1.54831
1.5499
1.55084
1.55185
1.55292
1.55118
1.54934
1.5504
1.55154
1.55278
1.55472
1.55347
1.55229
1.55405
1.55526
1.55655
1.55825
1.55695
1.55571
1.55454
1.55343
1.55238
1.55139
1.5528
1.55383
1.55491
1.55631
1.55518
1.55411
1.55535
1.55645
1.55761
1.55881
1.55748
1.55606
1.55726
1.55852
1.55984
1.56133
1.55999
1.55871
1.56006
1.56137
1.56272
1.56412
1.56272
1.56122
1.55962
1.5579
1.55606
1.5541
1.55552
1.55702
1.55862
1.56057
1.55899
1.55749
1.55933
1.56082
1.56239
1.56402
1.56222
1.56029
1.56205
1.56387
1.56576
1.56755
1.56572
1.56394
1.5657
1.56744
1.56923
1.57081
1.56906
1.56736
1.5657
1.56409
1.56254
1.56105
1.56265
1.56414
1.56569
1.56718
1.56564
1.56416
1.56556
1.56705
1.56857
1.57013
1.56875
1.56728
1.56891
1.57058
1.57229
1.57369
1.57201
1.57036
1.57173
1.57335
1.575
1.57623
1.57461
1.57301
1.57143
1.56988
1.56836
1.56687
1.56543
1.56402
1.56265
1.56133
1.56005
1.55882
1.55764
1.5565
1.55757
1.55874
1.55996
1.56102
1.55978
1.55858
1.55951
1.56074
1.56201
1.56331
1.5623
1.56121
1.56251
1.56385
1.56523
1.56637
1.56497
1.56362
1.56464
1.56602
1.56742
1.56841
1.56699
1.5656
1.56425
1.56292
1.56164
1.56038
1.56119
1.56247
1.56378
1.56457
1.56324
1.56194
1.56263
1.56395
1.5653
1.56669
1.56593
1.56512
1.5665
1.5679
1.56933
1.57019
1.56874
1.56732
1.56809
1.56953
1.57098
1.57246
1.57165
1.57079
1.56986
1.56886
1.56779
1.56665
1.5681
1.56959
1.5711
1.57225
1.57074
1.56925
1.57032
1.57181
1.57333
1.57486
1.57379
1.57265
1.57421
1.5758
1.5774
1.5785
1.57691
1.57534
1.5764
1.57796
1.57953
1.5805
1.57895
1.5774
1.57586
1.57433
1.57282
1.57133
1.57226
1.57376
1.57527
1.57616
1.57464
1.57314
1.57395
1.57546
1.57698
1.5785
1.57768
1.5768
1.57833
1.57988
1.58142
1.58228
1.58075
1.57921
1.58003
1.58156
1.58309
1.58385
1.58233
1.5808
1.57927
1.57775
1.57622
1.57471
1.57321
1.57172
1.57026
1.56881
1.56738
1.56599
1.56461
1.56327
1.56196
1.56068
1.55944
1.55823
1.55706
1.55592
1.55482
1.55376
1.55274
1.55176
1.55081
1.5499
1.54902
1.54818
1.54738
1.54661
1.54684
1.54763
1.54845
1.54869
1.54785
1.54704
1.54722
1.54805
1.54891
1.54981
1.54957
1.54931
1.55021
1.55114
1.55211
1.55244
1.55144
1.55049
1.55074
1.55172
1.55273
1.55299
1.55196
1.55097
1.55001
1.5491
1.54822
1.54738
1.54752
1.54838
1.54927
1.54942
1.54851
1.54764
1.54775
1.54863
1.54954
1.5505
1.55036
1.5502
1.55117
1.55218
1.55323
1.55344
1.55237
1.55135
1.5515
1.55254
1.55362
1.55475
1.55455
1.55432
1.55407
1.55378
1.55347
1.55312
1.55417
1.55526
1.55638
1.55679
1.55565
1.55454
1.55487
1.556
1.55717
1.55837
1.55797
1.55754
1.55873
1.55996
1.56123
1.56173
1.56045
1.55919
1.55961
1.56089
1.56219
1.56261
1.56129
1.55999
1.55874
1.55751
1.55633
1.55518
1.55545
1.55662
1.55782
1.5581
1.55688
1.55569
1.55591
1.55711
1.55834
1.55962
1.55935
1.55906
1.56034
1.56165
1.56299
1.56333
1.56198
1.56065
1.56092
1.56227
1.56364
1.56391
1.56252
1.56117
1.55984
1.55856
1.55731
1.55609
1.55492
1.55379
1.55269
1.55164
1.55063
1.54966
1.54873
1.54784
1.54791
1.54881
1.54975
1.54983
1.54888
1.54798
1.54803
1.54894
1.54989
1.55089
1.55082
1.55073
1.55175
1.55282
1.55392
1.55404
1.55293
1.55185
1.55193
1.55301
1.55414
1.55421
1.55308
1.55199
1.55095
1.54994
1.54898
1.54806
1.54809
1.54901
1.54998
1.54999
1.54903
1.54811
1.551
1.55098
1.55203
1.55312
1.55426
1.55429
1.55315
1.55206
1.55546
1.55543
1.55538
1.5553
1.5552
1.55507
1.55626
1.55748
1.55874
1.5589
1.55763
1.55639
1.55651
1.55775
1.55903
1.56035
1.56021
1.56004
1.56138
1.56274
1.56414
1.56434
1.56293
1.56155
1.5617
1.56308
1.5645
1.56462
1.5632
1.56181
1.56045
1.55913
1.55784
1.55659
1.55665
1.5579
1.5592
1.55923
1.55794
1.55668
1.56056
1.56052
1.56189
1.56328
1.5647
1.56475
1.56333
1.56193
1.56621
1.56616
1.56607
1.56594
1.56577
1.56556
1.56532
1.56504
1.56472
1.56437
1.56397
1.56353
1.56306
1.56253
1.56386
1.56522
1.56661
1.56719
1.56579
1.56441
1.5649
1.5663
1.56773
1.56917
1.56863
1.56803
1.56947
1.57093
1.57241
1.57305
1.57155
1.57008
1.57064
1.57213
1.57363
1.57416
1.57265
1.57115
1.56967
1.56821
1.56677
1.56536
1.56577
1.5672
1.56865
1.56905
1.56758
1.56614
1.56647
1.56793
1.5694
1.5709
1.57054
1.57013
1.57162
1.57313
1.57465
1.57509
1.57356
1.57204
1.57242
1.57395
1.57549
1.57704
1.57663
1.57618
1.57569
1.57514
1.57455
1.57391
1.57542
1.57693
1.57846
1.57912
1.57759
1.57607
1.57667
1.5782
1.57974
1.58127
1.58066
1.57999
1.58152
1.58304
1.58456
1.58523
1.58371
1.58219
1.5828
1.58433
1.58584
1.58641
1.5849
1.58337
1.58184
1.5803
1.57876
1.57722
1.57773
1.57927
1.58081
1.58128
1.57973
1.57818
1.57859
1.58014
1.5817
1.58324
1.58282
1.58236
1.58389
1.58542
1.58693
1.5874
1.58589
1.58436
1.58478
1.58631
1.58783
1.5882
1.58669
1.58516
1.58362
1.58207
1.58051
1.57895
1.57739
1.57583
1.57429
1.57275
1.57123
1.56972
1.56823
1.56676
1.56702
1.56849
1.56999
1.57022
1.56872
1.56723
1.56741
1.5689
1.57041
1.57194
1.57175
1.57151
1.57304
1.57458
1.57614
1.5764
1.57484
1.57328
1.57349
1.57504
1.57661
1.57677
1.5752
1.57364
1.57209
1.57056
1.56904
1.56754
1.56764
1.56914
1.57066
1.57072
1.56919
1.56769
1.57226
1.5722
1.57375
1.57531
1.57688
1.57695
1.57537
1.57381
1.57853
1.57846
1.57835
1.57818
1.57796
1.5777
1.57926
1.58083
1.58239
1.58266
1.5811
1.57953
1.57975
1.58132
1.58289
1.58445
1.58422
1.58394
1.58549
1.58702
1.58853
1.58882
1.5873
1.58577
1.586
1.58753
1.58905
1.58923
1.58771
1.58618
1.58463
1.58306
1.5815
1.57992
1.58004
1.58161
1.58318
1.58325
1.58168
1.5801
1.58482
1.58475
1.5863
1.58783
1.58935
1.58942
1.5879
1.58637
1.59092
1.59084
1.59072
1.59054
1.59031
1.59003
1.5897
1.58932
1.5889
1.58843
1.58791
1.58735
1.58673
1.58608
1.58537
1.58462
1.58381
1.58296
1.58206
1.5811
1.58008
1.57901
1.57787
1.57666
1.57538
1.57403
1.57259
1.57106
1.56943
1.5677
1.56969
1.57171
1.57375
1.57526
1.5733
1.57135
1.57291
1.5748
1.57669
1.5786
1.57724
1.57581
1.57788
1.57994
1.582
1.58318
1.58121
1.57923
1.58051
1.58242
1.58432
1.58541
1.58358
1.58174
1.5799
1.57805
1.57621
1.57439
1.57578
1.57756
1.57934
1.58056
1.57883
1.5771
1.57834
1.58003
1.58172
1.58341
1.5823
1.58113
1.58291
1.58469
1.58646
1.58747
1.58575
1.58403
1.58509
1.58677
1.58843
1.59008
1.58916
1.58821
1.58723
1.5862
1.58514
1.58403
1.58605
1.58804
1.58999
1.59086
1.58898
1.58707
1.58806
1.5899
1.59171
1.59349
1.59271
1.59191
1.59379
1.59563
1.59743
1.59803
1.59629
1.59452
1.59523
1.59694
1.59861
1.59919
1.59758
1.59593
1.59425
1.59253
1.59079
1.58902
1.58994
1.59165
1.59334
1.59412
1.59249
1.59084
1.5917
1.5933
1.59488
1.59643
1.59572
1.59499
1.59662
1.59821
1.59977
1.60034
1.59883
1.59729
1.59795
1.59944
1.6009
1.60146
1.60004
1.5986
1.59712
1.59562
1.59409
1.59254
1.59096
1.58936
1.58774
1.58611
1.58447
1.58282
1.58117
1.57952
1.58063
1.58225
1.58387
1.58486
1.58327
1.58168
1.58267
1.58424
1.5858
1.58736
1.58644
1.58548
1.58708
1.58867
1.59025
1.59111
1.58957
1.58801
1.5889
1.59042
1.59193
1.59271
1.59124
1.58974
1.58823
1.5867
1.58516
1.58361
1.5845
1.58603
1.58755
1.58836
1.58686
1.58534
1.58613
1.58763
1.58912
1.59059
1.58985
1.58906
1.59055
1.59202
1.59347
1.59419
1.59276
1.59131
1.59204
1.59347
1.59488
1.59625
1.59559
1.59489
1.59417
1.59341
1.59262
1.59181
1.59334
1.59485
1.59634
1.59704
1.59559
1.59412
1.59487
1.59631
1.59772
1.5991
1.59846
1.5978
1.59923
1.60064
1.60201
1.60255
1.60122
1.59985
1.60046
1.60179
1.60308
1.60361
1.60234
1.60105
1.59973
1.59838
1.597
1.5956
1.59629
1.59767
1.59902
1.59963
1.59831
1.59696
1.59761
1.59893
1.60022
1.60149
1.60092
1.60033
1.60162
1.60289
1.60412
1.60462
1.60341
1.60218
1.60272
1.60393
1.6051
1.60625
1.60579
1.60532
1.60484
1.60435
1.60386
1.60335
1.60285
1.60233
1.60182
1.6013
1.60077
1.60025
1.59972
1.59919
1.6009
1.60257
1.6042
1.60456
1.60299
1.60137
1.60185
1.60341
1.60493
1.60641
1.60609
1.60578
1.60733
1.60883
1.61029
1.61047
1.60905
1.60759
1.60786
1.60927
1.61065
1.61085
1.60951
1.60814
1.60674
1.6053
1.60383
1.60232
1.60279
1.60425
1.60568
1.60606
1.60467
1.60326
1.60373
1.6051
1.60644
1.60775
1.6074
1.60707
1.60843
1.60975
1.61105
1.61127
1.61001
1.60872
1.60902
1.61027
1.61149
1.61268
1.6125
1.61232
1.61215
1.61199
1.61185
1.61172
1.6116
1.61302
1.61295
1.61438
1.61577
1.61712
1.61844
1.61852
1.61983
1.61996
1.62126
1.62111
1.62097
1.61972
1.61963
1.61837
1.61709
1.61577
1.61441
1.61446
1.6131
1.6132
1.6133
1.61458
1.61451
1.6158
1.61577
1.61706
1.61832
1.61954
1.62074
1.62085
1.62204
1.62219
1.62236
1.62253
1.62273
1.62293
1.62314
1.62337
1.62362
1.62388
1.62415
1.62443
1.62584
1.62616
1.62754
1.62789
1.62825
1.62961
1.62999
1.63132
1.63262
1.63388
1.6351
1.63552
1.63672
1.63715
1.63832
1.63876
1.6399
1.64034
1.64146
1.64102
1.64057
1.63946
1.63902
1.63789
1.63745
1.63629
1.63587
1.63469
1.63347
1.63222
1.63093
1.63055
1.62924
1.62888
1.62853
1.62721
1.62689
1.62554
1.62525
1.62658
1.62787
1.6282
1.62947
1.62982
1.63018
1.63145
1.63183
1.63307
1.63428
1.63388
1.63268
1.6323
1.63108
1.63071
1.63036
1.62913
1.6288
1.62756
1.62628
1.62497
1.6247
1.626
1.62726
1.62697
1.62573
1.62445
1.62421
1.62547
1.62669
1.62788
1.62817
1.62848
1.62968
1.63001
1.63119
1.63155
1.63192
1.6331
1.63349
1.63464
1.63505
1.63546
1.63661
1.63703
1.63815
1.63859
1.63969
1.64013
1.64121
1.64166
1.64211
1.64255
1.643
1.64406
1.64451
1.64555
1.64656
1.64612
1.6451
1.64466
1.64362
1.64317
1.64272
1.64375
1.64421
1.64522
1.64567
1.64666
1.64711
1.64756
1.648
1.64843
1.64885
1.64927
1.64968
1.65009
1.65049
1.65088
1.65126
1.65163
1.65254
1.65288
1.65377
1.65409
1.65494
1.65579
1.65607
1.65688
1.65713
1.65793
1.65815
1.65893
1.65912
1.65988
1.66005
1.6602
1.66094
1.66167
1.66239
1.6625
1.66321
1.6633
1.664
1.66406
1.66476
1.6648
1.66549
1.66545
1.66539
1.6647
1.66461
1.66392
1.66381
1.66311
1.66298
1.66226
1.66153
1.6608
1.66064
1.66138
1.66211
1.66283
1.66354
1.66369
1.66438
1.66451
1.66519
1.6653
1.66597
1.66606
1.66613
1.66617
1.6662
1.6662
1.66617
1.66611
1.66603
1.66591
1.66576
1.66653
1.66636
1.66717
1.66798
1.6681
1.66732
1.66742
1.66667
1.66676
1.66683
1.66755
1.6675
1.66823
1.66818
1.66892
1.66887
1.6688
1.66961
1.6704
1.67118
1.67114
1.6704
1.66964
1.66966
1.67039
1.6711
1.67179
1.67186
1.67194
1.67201
1.67207
1.67213
1.67218
1.67313
1.67403
1.67487
1.67464
1.67385
1.67301
1.6729
1.67368
1.67443
1.67514
1.67539
1.67566
1.6764
1.67708
1.67771
1.67734
1.67674
1.67609
1.6758
1.67643
1.67701
1.67672
1.67615
1.67554
1.67491
1.67423
1.67352
1.67278
1.67267
1.67338
1.67405
1.67388
1.67324
1.67256
1.67246
1.6731
1.67373
1.67433
1.6745
1.6747
1.67531
1.67589
1.67645
1.6762
1.67566
1.6751
1.6749
1.67545
1.67598
1.67649
1.67672
1.67697
1.67725
1.67756
1.67791
1.67829
1.67882
1.67925
1.67975
1.68022
1.68069
1.68112
1.68162
1.68217
1.68255
1.6829
1.68324
1.68273
1.68238
1.68202
1.68152
1.6819
1.68226
1.68262
1.68307
1.68356
1.68408
1.68464
1.68522
1.68584
1.68607
1.68629
1.68652
1.68597
1.68573
1.68548
1.68491
1.68518
1.68545
1.68573
1.68623
1.68675
1.68699
1.68723
1.68749
1.68703
1.68675
1.68649
1.68601
1.68629
1.68658
1.68616
1.68585
1.68555
1.68525
1.68496
1.68467
1.68438
1.68388
1.68419
1.68449
1.68406
1.68373
1.6834
1.68296
1.68331
1.68365
1.68399
1.68438
1.6848
1.68512
1.68544
1.68576
1.68539
1.68505
1.68471
1.68433
1.68468
1.68504
1.68472
1.68435
1.68398
1.68362
1.68327
1.68291
1.68256
1.6822
1.68183
1.68145
1.68106
1.68065
1.68022
1.67978
1.67932
1.67893
1.67843
1.67808
1.67857
1.67904
1.67939
1.67983
1.68026
1.68064
1.68104
1.68143
1.68106
1.68067
1.68032
1.67991
1.67948
1.67916
1.67871
1.67825
1.67776
1.67748
1.67796
1.67842
1.67816
1.6777
1.67722
1.67699
1.67747
1.67793
1.67838
1.67862
1.67887
1.67931
1.67959
1.68002
1.68043
1.68073
1.68113
1.68145
1.68181
1.68218
1.68255
1.68292
1.6826
1.68222
1.68184
1.68152
1.68191
1.68231
1.6827
1.68298
1.68329
1.68366
1.68404
1.68442
1.68415
1.68375
1.68336
1.68309
1.68349
1.6839
1.68368
1.68326
1.68285
1.68245
1.68204
1.68164
1.68124
1.68084
1.68057
1.68016
1.67974
1.67949
1.67906
1.67883
1.67927
1.6797
1.67992
1.68034
1.68076
1.68098
1.6814
1.68181
1.6816
1.68118
1.68098
1.68056
1.68013
1.67994
1.67951
1.67907
1.67863
1.67818
1.67772
1.67726
1.67678
1.67629
1.67579
1.67526
1.67472
1.67416
1.67358
1.67298
1.67235
1.67171
1.67104
1.67036
1.66966
1.66895
1.66896
1.66826
1.66827
1.66757
1.66687
1.66689
1.66758
1.66825
1.66892
1.66895
1.66962
1.66965
1.67032
1.67098
1.67091
1.67027
1.67021
1.66957
1.66952
1.66888
1.66822
1.66756
1.66688
1.66685
1.66752
1.66817
1.66811
1.66746
1.6668
1.66673
1.66738
1.66803
1.66866
1.66874
1.66882
1.66945
1.67007
1.67015
1.67076
1.67084
1.67145
1.67154
1.67162
1.67225
1.67285
1.67344
1.67331
1.67274
1.67215
1.67204
1.67262
1.67318
1.67373
1.67387
1.67401
1.67456
1.67509
1.6756
1.67544
1.67493
1.67441
1.67426
1.67478
1.67529
1.67515
1.67464
1.67413
1.6736
1.67306
1.67251
1.67194
1.67136
1.67126
1.67067
1.67057
1.66998
1.66937
1.66927
1.66988
1.67047
1.67104
1.67115
1.67172
1.67183
1.67239
1.67294
1.67282
1.67228
1.67216
1.67161
1.67148
1.67092
1.67035
1.66976
1.66917
1.66855
1.66793
1.66729
1.66664
1.66653
1.66587
1.66574
1.66507
1.66493
1.66424
1.66408
1.66338
1.66266
1.66194
1.6612
1.66046
1.6597
1.65949
1.65872
1.65849
1.65769
1.65743
1.65662
1.65633
1.65549
1.65463
1.65431
1.65343
1.65308
1.65218
1.65181
1.65273
1.65363
1.65398
1.65485
1.65518
1.65603
1.65686
1.65716
1.65797
1.65824
1.65903
1.65927
1.66004
1.66026
1.66101
1.66175
1.66154
1.6608
1.66057
1.6598
1.65955
1.65877
1.65849
1.65768
1.65738
1.65655
1.65571
1.65538
1.65451
1.65415
1.65326
1.65236
1.65143
1.65104
1.65197
1.65289
1.6525
1.65158
1.65064
1.65024
1.65118
1.6521
1.65301
1.6534
1.65378
1.65466
1.65503
1.65588
1.65623
1.65706
1.65672
1.65636
1.65552
1.65515
1.65428
1.65389
1.65476
1.6556
1.65599
1.65682
1.65719
1.65754
1.65787
1.65819
1.65898
1.65928
1.66005
1.66032
1.66107
1.66132
1.66205
1.66228
1.66248
1.66319
1.6639
1.66458
1.66476
1.66544
1.6656
1.66626
1.6664
1.66705
1.66718
1.66781
1.66768
1.66754
1.66691
1.66674
1.6661
1.66592
1.66526
1.66506
1.66439
1.6637
1.66299
1.66277
1.66348
1.66417
1.66484
1.66551
1.66572
1.66637
1.66656
1.6672
1.66738
1.66799
1.66816
1.6683
1.66844
1.66905
1.66964
1.67022
1.67009
1.66951
1.66891
1.66876
1.66936
1.66994
1.66978
1.66919
1.6686
1.66842
1.66782
1.66762
1.667
1.66679
1.66615
1.66592
1.66527
1.66461
1.66393
1.66324
1.66253
1.66181
1.66155
1.66081
1.66052
1.65976
1.65945
1.65867
1.65834
1.65799
1.65878
1.65913
1.65989
1.66022
1.66096
1.66127
1.66199
1.66227
1.66298
1.66367
1.6634
1.6627
1.6624
1.66169
1.66137
1.66064
1.6603
1.65955
1.65918
1.65841
1.65762
1.65724
1.65643
1.65603
1.6552
1.65435
1.65349
1.6526
1.65169
1.65077
1.64982
1.6494
1.65035
1.65127
1.65084
1.64992
1.64897
1.64853
1.64948
1.65041
1.65131
1.65175
1.65218
1.65307
1.65394
1.65478
1.65435
1.6535
1.65264
1.6522
1.65306
1.65391
1.65345
1.65261
1.65174
1.65086
1.64996
1.64903
1.64808
1.64763
1.64858
1.6495
1.64904
1.64812
1.64717
1.64621
1.64575
1.64476
1.6443
1.6433
1.64227
1.64182
1.64077
1.64032
1.63925
1.63881
1.63772
1.6373
1.63619
1.63577
1.63687
1.63795
1.63838
1.63943
1.63988
1.64092
1.64137
1.64239
1.64284
1.64384
1.64338
1.64291
1.64193
1.64147
1.64046
1.64001
1.63899
1.63855
1.63752
1.63645
1.63536
1.63424
1.63385
1.63272
1.63234
1.63198
1.63084
1.6305
1.62935
1.62904
1.63017
1.63127
1.63162
1.63272
1.63309
1.63347
1.63456
1.63496
1.63604
1.63709
1.63812
1.63912
1.63956
1.64055
1.64101
1.64198
1.64245
1.6434
1.64388
1.64435
1.64482
1.64528
1.64624
1.64671
1.64765
1.64857
1.64946
1.64994
1.6504
1.65128
1.65214
1.65298
1.65251
1.65167
1.65081
1.65033
1.65119
1.65202
1.65283
1.65332
1.6538
1.65427
1.65473
1.65518
1.65561
1.65642
1.65684
1.65763
1.65803
1.6588
1.65955
1.65993
1.66067
1.66103
1.66175
1.66209
1.66278
1.6631
1.66378
1.66408
1.66435
1.66502
1.66567
1.6663
1.66655
1.66717
1.66741
1.66801
1.66823
1.66882
1.66902
1.6696
1.66941
1.6692
1.66861
1.66838
1.66778
1.66754
1.66692
1.66666
1.66603
1.66539
1.66474
1.66445
1.6651
1.66574
1.66637
1.66698
1.66727
1.66787
1.66814
1.66873
1.66897
1.66955
1.66977
1.66998
1.67017
1.67035
1.67051
1.67066
1.6708
1.67135
1.6719
1.67203
1.67257
1.6727
1.67323
1.67335
1.67348
1.674
1.67451
1.67501
1.67489
1.67438
1.67387
1.67375
1.67426
1.67476
1.67464
1.67413
1.67362
1.6731
1.67297
1.67244
1.6723
1.67176
1.67122
1.67107
1.67162
1.67216
1.67269
1.67283
1.67336
1.67349
1.67401
1.67452
1.67439
1.67388
1.67374
1.67322
1.67307
1.67254
1.672
1.67146
1.67091
1.67073
1.67129
1.67183
1.67165
1.6711
1.67054
1.67034
1.6709
1.67146
1.67201
1.6722
1.67237
1.67291
1.67344
1.67359
1.67412
1.67426
1.67477
1.6749
1.67502
1.67514
1.67526
1.67538
1.67551
1.67564
1.67578
1.67594
1.6761
1.67659
1.67707
1.67753
1.67737
1.6769
1.67642
1.67627
1.67675
1.67722
1.67768
1.67783
1.67799
1.67845
1.67889
1.67934
1.67919
1.67874
1.67828
1.67814
1.6786
1.67906
1.67894
1.67848
1.67801
1.67755
1.67708
1.67661
1.67613
1.676
1.67648
1.67695
1.67684
1.67636
1.67587
1.67575
1.67624
1.67673
1.67721
1.67731
1.67743
1.6779
1.67836
1.67883
1.67874
1.67826
1.67779
1.67769
1.67817
1.67865
1.67913
1.67921
1.6793
1.6794
1.67951
1.67964
1.67978
1.68022
1.68038
1.68081
1.68125
1.68141
1.68184
1.68202
1.68222
1.68264
1.68306
1.68349
1.68332
1.68288
1.68245
1.68228
1.68272
1.68317
1.68305
1.68259
1.68214
1.68169
1.68156
1.68111
1.68066
1.68053
1.68008
1.67996
1.68042
1.68088
1.68099
1.68144
1.68191
1.68201
1.68247
1.68294
1.68285
1.68237
1.68229
1.68182
1.68135
1.68127
1.68079
1.68033
1.67986
1.67977
1.68024
1.68072
1.68065
1.68017
1.67969
1.67962
1.6801
1.68059
1.68109
1.68114
1.6812
1.68168
1.68174
1.68223
1.68272
1.68278
1.68326
1.68333
1.68341
1.68351
1.68363
1.68377
1.68393
1.68411
1.68432
1.68456
1.68481
1.6851
1.68541
1.68574
1.6861
1.68648
1.68688
1.68731
1.68775
1.68822
1.68869
1.68919
1.68969
1.69021
1.69073
1.69125
1.69178
1.69231
1.69284
1.69336
1.69388
1.69438
1.69488
1.69535
1.6958
1.69623
1.69665
1.69704
1.69741
1.69775
1.69806
1.69834
1.69859
1.6988
1.69897
1.6991
1.69918
1.69921
1.6992
1.69916
1.69894
1.69898
1.6988
1.69875
1.69858
1.69863
1.69848
1.69844
1.69832
1.69836
1.6983
1.69826
1.69824
1.69827
1.6983
1.69833
1.69839
1.6985
1.69865
1.69882
1.699
1.69898
1.6988
1.69864
1.69857
1.69873
1.69891
1.69879
1.69862
1.69847
1.69834
1.69843
1.69848
1.69838
1.69832
1.69829
1.69825
1.69828
1.69833
1.69825
1.69821
1.69818
1.69817
1.69825
1.69829
1.69829
1.69827
1.69823
1.69823
1.69827
1.69832
1.69828
1.69839
1.69844
1.69859
1.69855
1.69874
1.69878
1.699
1.69895
1.69919
1.69924
1.69928
1.69903
1.69882
1.69862
1.69847
1.69835
1.69829
1.69829
1.69835
1.69847
1.69845
1.69833
1.69825
1.69819
1.69828
1.69841
1.69858
1.69862
1.69863
1.69883
1.69905
1.69929
1.69928
1.69904
1.69881
1.69878
1.699
1.69926
1.69921
1.69895
1.69872
1.69851
1.69834
1.6982
1.69811
1.69807
1.69808
1.6981
1.69813
1.69821
1.69833
1.69847
1.69863
1.69843
1.69829
1.69816
1.69795
1.69807
1.6982
1.69793
1.69781
1.69771
1.69764
1.69786
1.69805
1.69799
1.69795
1.69794
1.69777
1.69778
1.69781
1.6976
1.69758
1.69757
1.69735
1.69735
1.69736
1.69739
1.69744
1.69753
1.69763
1.69731
1.69721
1.69715
1.69684
1.69688
1.69695
1.69657
1.69653
1.69649
1.69648
1.69681
1.69711
1.69709
1.69708
1.69711
1.69685
1.6968
1.6968
1.69647
1.6965
1.69657
1.69668
1.69694
1.69718
1.6974
1.6976
1.69778
1.69794
1.69799
1.6981
1.69824
1.69812
1.69797
1.69785
1.69769
1.69782
1.69798
1.69818
1.69832
1.69843
1.69864
1.69888
1.69914
1.69905
1.69878
1.69854
1.69841
1.69867
1.69895
1.69883
1.69854
1.69827
1.69803
1.69782
1.69764
1.6975
1.6973
1.69745
1.69764
1.69744
1.69724
1.69707
1.69682
1.697
1.69722
1.69747
1.69767
1.69786
1.69811
1.69839
1.69869
1.69853
1.69822
1.69794
1.69774
1.69804
1.69836
1.6987
1.69886
1.699
1.69913
1.69925
1.69934
1.69942
1.69948
1.69953
1.69955
1.69955
1.69954
1.6995
1.69945
1.69973
1.69978
1.70007
1.70002
1.70032
1.70037
1.70069
1.70064
1.70096
1.70102
1.70136
1.7013
1.70165
1.70171
1.70176
1.70141
1.70106
1.70073
1.70041
1.70011
1.69981
1.69983
1.70013
1.70044
1.70045
1.70013
1.69983
1.69981
1.70012
1.70044
1.70077
1.70077
1.70076
1.7011
1.70144
1.7018
1.70183
1.70146
1.70111
1.70111
1.70147
1.70184
1.70222
1.7022
1.70217
1.70213
1.70207
1.70201
1.70238
1.70245
1.70283
1.70276
1.70315
1.70322
1.70362
1.70354
1.70394
1.70402
1.70443
1.70435
1.70476
1.70483
1.7049
1.70449
1.70409
1.70368
1.70328
1.70289
1.7025
1.70255
1.70294
1.70333
1.70337
1.70297
1.70258
1.7026
1.703
1.7034
1.7038
1.70377
1.70373
1.70414
1.70455
1.70496
1.705
1.70459
1.70418
1.70421
1.70462
1.70504
1.70506
1.70465
1.70423
1.70382
1.70341
1.70301
1.70261
1.70222
1.70183
1.70146
1.7011
1.70075
1.70041
1.70009
1.69978
1.69972
1.70004
1.70037
1.70031
1.69998
1.69965
1.69956
1.6999
1.70024
1.7006
1.70066
1.70071
1.70107
1.70144
1.70182
1.70179
1.7014
1.70103
1.70097
1.70135
1.70174
1.70169
1.70129
1.7009
1.70052
1.70015
1.6998
1.69946
1.69934
1.69969
1.70005
1.69993
1.69956
1.6992
1.69905
1.69942
1.6998
1.7002
1.70032
1.70043
1.70081
1.70121
1.70162
1.70153
1.70112
1.70071
1.7006
1.70102
1.70144
1.70187
1.70195
1.70203
1.70209
1.70214
1.70218
1.7022
1.7026
1.703
1.70341
1.7034
1.70299
1.70258
1.70255
1.70296
1.70338
1.7038
1.70382
1.70383
1.70424
1.70466
1.70508
1.70508
1.70466
1.70424
1.70423
1.70465
1.70508
1.70507
1.70464
1.70421
1.70378
1.70335
1.70293
1.70251
1.70245
1.70288
1.70331
1.70325
1.70282
1.70238
1.7023
1.70274
1.70319
1.70363
1.70369
1.70374
1.70418
1.70461
1.70505
1.70502
1.70458
1.70413
1.70408
1.70453
1.70497
1.70492
1.70447
1.70402
1.70356
1.70311
1.70266
1.70221
1.70177
1.70133
1.7009
1.70048
1.70006
1.69966
1.69927
1.69889
1.69852
1.69817
1.69784
1.69753
1.69725
1.69699
1.69676
1.69656
1.6964
1.69627
1.69619
1.69614
1.69612
1.69613
1.69615
1.69618
1.69577
1.69575
1.69574
1.69533
1.69532
1.69533
1.69487
1.69488
1.6949
1.69496
1.69536
1.69575
1.69578
1.69586
1.69596
1.69563
1.69551
1.69542
1.69504
1.69515
1.69529
1.69494
1.69477
1.69464
1.69454
1.69447
1.69442
1.69439
1.69391
1.69396
1.69403
1.69357
1.69348
1.69341
1.69291
1.693
1.69311
1.69325
1.69369
1.69412
1.69424
1.69439
1.69457
1.6942
1.694
1.69383
1.69341
1.6936
1.69382
1.69407
1.69443
1.69479
1.69513
1.69547
1.69579
1.6961
1.69628
1.69649
1.69674
1.69647
1.69621
1.69599
1.69568
1.69592
1.6962
1.6965
1.69676
1.69701
1.69731
1.69763
1.69797
1.69776
1.69741
1.69707
1.69682
1.69717
1.69754
1.6973
1.69692
1.69656
1.69622
1.69591
1.69562
1.69536
1.69503
1.69531
1.69561
1.6953
1.69499
1.69469
1.69435
1.69466
1.69499
1.69535
1.69565
1.69594
1.69629
1.69666
1.69705
1.6968
1.6964
1.69601
1.69573
1.69612
1.69653
1.69627
1.69584
1.69543
1.69504
1.69467
1.69432
1.694
1.69371
1.69344
1.6932
1.69299
1.69281
1.69265
1.69252
1.69241
1.6919
1.69203
1.69218
1.69172
1.69154
1.69139
1.69088
1.69106
1.69125
1.69147
1.69192
1.69236
1.69256
1.69279
1.69305
1.69266
1.69239
1.69214
1.69172
1.69198
1.69228
1.69189
1.69158
1.6913
1.69103
1.6908
1.69058
1.69038
1.68989
1.69011
1.69034
1.6899
1.68964
1.68941
1.68893
1.68919
1.68947
1.68976
1.69018
1.6906
1.69088
1.69119
1.69152
1.69114
1.6908
1.69048
1.69008
1.69042
1.69078
1.69116
1.69151
1.69187
1.69223
1.6926
1.69297
1.69334
1.69365
1.69399
1.69435
1.69402
1.69365
1.6933
1.69294
1.69331
1.6937
1.69411
1.69442
1.69473
1.69514
1.69556
1.69599
1.69572
1.69527
1.69484
1.69453
1.69498
1.69544
1.69516
1.69469
1.69423
1.69379
1.69337
1.69297
1.69259
1.69224
1.69264
1.69305
1.69273
1.69231
1.6919
1.69156
1.69198
1.69242
1.69288
1.69318
1.69348
1.69393
1.6944
1.69488
1.6946
1.69411
1.69364
1.69335
1.69383
1.69433
1.69483
1.6951
1.69537
1.69564
1.69591
1.69618
1.69644
1.69671
1.69696
1.69721
1.69746
1.69769
1.69792
1.69813
1.69833
1.69871
1.6991
1.6995
1.69933
1.69892
1.69852
1.69832
1.69873
1.69915
1.69958
1.69975
1.69991
1.70034
1.70077
1.70121
1.70108
1.70063
1.70019
1.70003
1.70048
1.70093
1.70078
1.70031
1.69985
1.6994
1.69896
1.69852
1.6981
1.69788
1.69831
1.69875
1.69854
1.69809
1.69765
1.6974
1.69786
1.69832
1.69879
1.69901
1.69921
1.69967
1.70014
1.70061
1.70044
1.69995
1.69948
1.69927
1.69976
1.70025
1.70075
1.70093
1.70109
1.70125
1.7014
1.70153
1.70166
1.70211
1.70256
1.70302
1.70292
1.70246
1.70199
1.70186
1.70234
1.70281
1.70328
1.70339
1.70348
1.70394
1.7044
1.70486
1.70478
1.70432
1.70385
1.70375
1.70423
1.7047
1.7046
1.70412
1.70364
1.70316
1.70268
1.7022
1.70173
1.70158
1.70206
1.70255
1.7024
1.70191
1.70142
1.70125
1.70174
1.70225
1.70275
1.7029
1.70304
1.70352
1.70401
1.70449
1.70437
1.70388
1.70339
1.70325
1.70374
1.70424
1.7041
1.7036
1.70309
1.70259
1.70208
1.70157
1.70107
1.70056
1.70006
1.69956
1.69907
1.69858
1.69809
1.69762
1.69716
1.69691
1.69738
1.69786
1.69762
1.69713
1.69665
1.69639
1.69688
1.69738
1.69789
1.69812
1.69835
1.69885
1.69935
1.69986
1.69965
1.69914
1.69863
1.6984
1.69892
1.69943
1.69922
1.69869
1.69817
1.69765
1.69713
1.69663
1.69613
1.69587
1.69637
1.69689
1.69664
1.69612
1.6956
1.69535
1.69587
1.6964
1.69693
1.69717
1.69741
1.69793
1.69846
1.69899
1.69877
1.69823
1.6977
1.69746
1.698
1.69854
1.69908
1.69931
1.69953
1.69974
1.69996
1.70016
1.70037
1.70088
1.70139
1.7019
1.70172
1.7012
1.70068
1.70048
1.701
1.70153
1.70205
1.70224
1.70242
1.70293
1.70344
1.70395
1.70378
1.70327
1.70275
1.70257
1.70309
1.70361
1.70343
1.70291
1.70239
1.70186
1.70133
1.7008
1.70027
1.70006
1.70059
1.70113
1.70092
1.70038
1.69984
1.69962
1.70017
1.70071
1.70125
1.70146
1.70166
1.70219
1.70272
1.70325
1.70306
1.70252
1.70199
1.70179
1.70232
1.70286
1.70339
1.70359
1.70377
1.70396
1.70413
1.7043
1.70445
1.7046
1.70474
1.70486
1.70497
1.70508
1.70517
1.70525
1.70532
1.70537
1.70542
1.70546
1.70548
1.7055
1.70551
1.7055
1.70549
1.70548
1.70545
1.70541
1.70537
1.70531
1.70524
1.70517
1.70558
1.70565
1.70606
1.70599
1.7064
1.70647
1.70688
1.70681
1.70722
1.7073
1.70771
1.70763
1.70805
1.70812
1.70819
1.70777
1.70736
1.70695
1.70654
1.70613
1.70572
1.70578
1.70619
1.7066
1.70665
1.70624
1.70582
1.70586
1.70627
1.70669
1.7071
1.70706
1.70701
1.70742
1.70783
1.70824
1.70829
1.70788
1.70747
1.70751
1.70792
1.70833
1.70875
1.7087
1.70865
1.7086
1.70854
1.70846
1.70888
1.70895
1.70937
1.7093
1.70972
1.70979
1.71021
1.71014
1.71056
1.71063
1.71105
1.71099
1.71142
1.71147
1.71152
1.7111
1.71068
1.71026
1.70985
1.70943
1.70901
1.70907
1.70948
1.7099
1.70995
1.70953
1.70912
1.70916
1.70958
1.70999
1.71041
1.71036
1.71031
1.71073
1.71115
1.71157
1.71161
1.7112
1.71078
1.71082
1.71124
1.71166
1.71171
1.71129
1.71087
1.71045
1.71003
1.70962
1.7092
1.70879
1.70837
1.70796
1.70755
1.70713
1.70672
1.70631
1.70589
1.70591
1.70633
1.70675
1.70677
1.70635
1.70593
1.70593
1.70635
1.70678
1.7072
1.70718
1.70716
1.70758
1.70799
1.70841
1.70844
1.70802
1.7076
1.70762
1.70804
1.70846
1.70848
1.70806
1.70763
1.70721
1.70678
1.70636
1.70593
1.70592
1.70635
1.70678
1.70677
1.70633
1.7059
1.70587
1.70631
1.70675
1.70719
1.7072
1.70721
1.70764
1.70807
1.7085
1.7085
1.70807
1.70764
1.70763
1.70807
1.7085
1.70894
1.70894
1.70893
1.70891
1.70888
1.70886
1.70882
1.70924
1.70966
1.71007
1.71011
1.70969
1.70927
1.70931
1.70973
1.71015
1.71057
1.71053
1.71049
1.71091
1.71133
1.71175
1.7118
1.71137
1.71095
1.71099
1.71142
1.71184
1.71189
1.71146
1.71103
1.71061
1.71018
1.70976
1.70933
1.70935
1.70978
1.71021
1.71023
1.7098
1.70937
1.70938
1.70981
1.71025
1.71068
1.71066
1.71064
1.71107
1.7115
1.71193
1.71197
1.71153
1.7111
1.71112
1.71156
1.712
1.71244
1.7124
1.71236
1.71232
1.71227
1.71223
1.71218
1.71213
1.71208
1.71204
1.71199
1.71195
1.7119
1.71184
1.71227
1.71232
1.71275
1.7127
1.71313
1.71319
1.71363
1.71357
1.71401
1.71408
1.71454
1.71447
1.71495
1.71502
1.71507
1.71459
1.71413
1.71368
1.71323
1.7128
1.71237
1.71242
1.71284
1.71328
1.71333
1.71289
1.71246
1.71251
1.71294
1.71337
1.71382
1.71377
1.71372
1.71418
1.71464
1.71511
1.71516
1.71469
1.71422
1.71427
1.71474
1.71521
1.71569
1.71564
1.7156
1.71555
1.7155
1.71544
1.71595
1.716
1.71651
1.71646
1.71699
1.71703
1.71756
1.71752
1.71807
1.7181
1.71865
1.71862
1.71918
1.71921
1.71925
1.71868
1.71813
1.71759
1.71707
1.71655
1.71605
1.71609
1.71659
1.71711
1.71715
1.71664
1.71614
1.71618
1.71668
1.7172
1.71772
1.71767
1.71763
1.71817
1.71872
1.71928
1.71932
1.71876
1.71821
1.71825
1.7188
1.71936
1.71941
1.71885
1.7183
1.71777
1.71725
1.71674
1.71623
1.71574
1.71526
1.71479
1.71433
1.71387
1.71343
1.71299
1.71256
1.71261
1.71304
1.71348
1.71353
1.71309
1.71266
1.71271
1.71314
1.71359
1.71404
1.71398
1.71393
1.71438
1.71484
1.71532
1.71537
1.7149
1.71444
1.71449
1.71496
1.71543
1.71549
1.71502
1.71455
1.71409
1.71364
1.7132
1.71276
1.7128
1.71324
1.71369
1.71374
1.71329
1.71284
1.71288
1.71333
1.71379
1.71424
1.7142
1.71415
1.71461
1.71507
1.71555
1.71561
1.71513
1.71466
1.71471
1.71518
1.71566
1.71614
1.71609
1.71603
1.71597
1.71591
1.71586
1.7158
1.71629
1.71679
1.7173
1.71736
1.71685
1.71635
1.71641
1.7169
1.71741
1.71793
1.71788
1.71782
1.71835
1.7189
1.71945
1.7195
1.71895
1.71841
1.71846
1.719
1.71955
1.7196
1.71905
1.71852
1.71799
1.71747
1.71696
1.71646
1.71652
1.71702
1.71753
1.71759
1.71708
1.71658
1.71663
1.71713
1.71764
1.71815
1.7181
1.71805
1.71857
1.71911
1.71965
1.7197
1.71916
1.71862
1.71868
1.71921
1.71975
1.71979
1.71926
1.71873
1.71821
1.71769
1.71718
1.71669
1.71619
1.71571
1.71523
1.71475
1.71429
1.71382
1.71337
1.71292
1.71247
1.71202
1.71158
1.71114
1.7107
1.71026
1.70982
1.70938
1.70894
1.70849
1.70805
1.70761
1.70717
1.70672
1.70627
1.70582
1.70577
1.70623
1.70668
1.70663
1.70617
1.70571
1.70564
1.7061
1.70657
1.70703
1.70709
1.70713
1.70758
1.70803
1.70848
1.70845
1.708
1.70754
1.70749
1.70795
1.70841
1.70836
1.7079
1.70743
1.70696
1.7065
1.70602
1.70555
1.70546
1.70593
1.70641
1.70632
1.70583
1.70535
1.70523
1.70572
1.70621
1.70669
1.7068
1.70689
1.70736
1.70783
1.7083
1.70823
1.70775
1.70727
1.70718
1.70766
1.70814
1.70862
1.7087
1.70877
1.70882
1.70887
1.7089
1.70892
1.70937
1.70981
1.71026
1.71025
1.7098
1.70935
1.70932
1.70978
1.71023
1.71069
1.7107
1.7107
1.71115
1.71159
1.71204
1.71205
1.7116
1.71115
1.71114
1.7116
1.71205
1.71204
1.71158
1.71112
1.71066
1.7102
1.70974
1.70928
1.70923
1.7097
1.71016
1.71011
1.70964
1.70917
1.7091
1.70957
1.71005
1.71053
1.71058
1.71063
1.71109
1.71156
1.71202
1.712
1.71152
1.71105
1.711
1.71148
1.71195
1.7119
1.71142
1.71094
1.71046
1.70998
1.70949
1.70901
1.70853
1.70804
1.70756
1.70707
1.70658
1.70609
1.70559
1.7051
1.70496
1.70546
1.70596
1.70582
1.70531
1.70481
1.70465
1.70516
1.70567
1.70618
1.70632
1.70646
1.70695
1.70745
1.70794
1.70782
1.70732
1.70682
1.70668
1.70718
1.70769
1.70755
1.70704
1.70653
1.70602
1.70551
1.70499
1.70448
1.7043
1.70482
1.70534
1.70516
1.70464
1.70411
1.70392
1.70445
1.70498
1.7055
1.70568
1.70585
1.70637
1.70688
1.70739
1.70723
1.70672
1.7062
1.70602
1.70654
1.70706
1.70758
1.70775
1.7079
1.70805
1.70819
1.70831
1.70843
1.70892
1.7094
1.70989
1.70979
1.7093
1.70881
1.70869
1.70918
1.70968
1.71018
1.71028
1.71038
1.71086
1.71135
1.71184
1.71176
1.71127
1.71078
1.71068
1.71118
1.71168
1.71158
1.71107
1.71057
1.71006
1.70956
1.70906
1.70855
1.70841
1.70892
1.70943
1.70929
1.70878
1.70826
1.7081
1.70862
1.70914
1.70966
1.7098
1.70994
1.71045
1.71096
1.71147
1.71135
1.71083
1.71032
1.71018
1.7107
1.71122
1.71175
1.71187
1.71198
1.71208
1.71218
1.71226
1.71233
1.71239
1.71243
1.71247
1.71249
1.71251
1.71251
1.7125
1.71249
1.71294
1.7134
1.71386
1.71388
1.71342
1.71296
1.71297
1.71344
1.7139
1.71438
1.71435
1.71432
1.71479
1.71527
1.71575
1.71579
1.7153
1.71483
1.71485
1.71533
1.71582
1.71584
1.71535
1.71487
1.71439
1.71391
1.71344
1.71297
1.71296
1.71344
1.71391
1.7139
1.71342
1.71294
1.71291
1.7134
1.71388
1.71437
1.71439
1.71439
1.71488
1.71537
1.71586
1.71587
1.71537
1.71488
1.71487
1.71536
1.71586
1.71637
1.71637
1.71636
1.71634
1.71631
1.71628
1.71624
1.71673
1.71723
1.71774
1.71778
1.71728
1.71677
1.71681
1.71731
1.71782
1.71833
1.7183
1.71825
1.71877
1.7193
1.71984
1.71988
1.71934
1.71882
1.71885
1.71938
1.71991
1.71995
1.71941
1.71889
1.71837
1.71785
1.71734
1.71684
1.71686
1.71737
1.71788
1.71789
1.71738
1.71687
1.71688
1.71739
1.7179
1.71842
1.71841
1.71839
1.71891
1.71944
1.71997
1.71999
1.71946
1.71893
1.71895
1.71947
1.72001
1.72002
1.71948
1.71895
1.71843
1.71791
1.71739
1.71687
1.71636
1.71585
1.71535
1.71485
1.71435
1.71385
1.71336
1.71287
1.71282
1.71331
1.71381
1.71376
1.71326
1.71276
1.71268
1.71319
1.71369
1.71421
1.71426
1.71431
1.71481
1.71532
1.71583
1.7158
1.71528
1.71477
1.71472
1.71524
1.71576
1.7157
1.71518
1.71466
1.71414
1.71362
1.71311
1.71259
1.7125
1.71301
1.71353
1.71344
1.71291
1.71239
1.71227
1.7128
1.71333
1.71387
1.71397
1.71406
1.71458
1.71511
1.71564
1.71557
1.71503
1.7145
1.71441
1.71495
1.71549
1.71603
1.71611
1.71617
1.71623
1.71628
1.71632
1.71634
1.71686
1.71738
1.7179
1.71788
1.71736
1.71684
1.7168
1.71733
1.71786
1.71839
1.71841
1.71842
1.71895
1.71948
1.72002
1.72001
1.71947
1.71894
1.71892
1.71946
1.72
1.71998
1.71943
1.7189
1.71836
1.71782
1.71729
1.71676
1.71671
1.71724
1.71778
1.71773
1.71719
1.71665
1.71658
1.71712
1.71767
1.71822
1.71827
1.71832
1.71886
1.7194
1.71995
1.71991
1.71937
1.71882
1.71877
1.71932
1.71987
1.71982
1.71927
1.71871
1.71816
1.7176
1.71705
1.7165
1.71595
1.7154
1.71485
1.71431
1.71376
1.71322
1.71268
1.71215
1.71161
1.71108
1.71056
1.71003
1.7095
1.70898
1.70846
1.70793
1.70741
1.70689
1.70636
1.70584
1.70531
1.70479
1.70426
1.70372
1.70319
1.70266
1.70212
1.70158
1.70104
1.70049
1.69995
1.6994
1.69886
1.69831
1.69777
1.69723
1.69669
1.69615
1.69562
1.69509
1.69457
1.69406
1.69355
1.69306
1.69258
1.69212
1.69167
1.69123
1.69082
1.69042
1.69005
1.68969
1.68936
1.68905
1.68875
1.68848
1.68803
1.68833
1.68864
1.68825
1.68792
1.68761
1.6872
1.68753
1.68788
1.68824
1.6886
1.68897
1.68932
1.68969
1.69008
1.68975
1.68935
1.68896
1.68862
1.68902
1.68943
1.68913
1.6887
1.68829
1.6879
1.68752
1.68716
1.68681
1.68645
1.68681
1.68719
1.68687
1.68648
1.6861
1.68578
1.68617
1.68658
1.687
1.68728
1.68758
1.68798
1.68841
1.68885
1.68858
1.68813
1.6877
1.68743
1.68788
1.68834
1.68881
1.68905
1.6893
1.68958
1.68987
1.69017
1.69049
1.69092
1.69136
1.69182
1.69154
1.69107
1.69061
1.69032
1.69078
1.69126
1.69175
1.69202
1.6923
1.69279
1.69329
1.6938
1.69354
1.69302
1.69252
1.69226
1.69277
1.6933
1.69306
1.69253
1.69201
1.6915
1.691
1.69051
1.69004
1.68977
1.69026
1.69075
1.69052
1.69002
1.68953
1.6893
1.68979
1.6903
1.69082
1.69103
1.69126
1.69178
1.6923
1.69283
1.69262
1.69208
1.69156
1.69135
1.69188
1.69242
1.69223
1.69169
1.69115
1.69063
1.6901
1.68959
1.68908
1.68859
1.68811
1.68764
1.68718
1.68674
1.68631
1.68589
1.68549
1.68522
1.68563
1.68606
1.68584
1.6854
1.68497
1.68475
1.68519
1.68564
1.6861
1.68629
1.6865
1.68695
1.68742
1.6879
1.68771
1.68722
1.68675
1.68657
1.68705
1.68754
1.68739
1.68689
1.6864
1.68593
1.68546
1.685
1.68455
1.68438
1.68483
1.6853
1.68516
1.68469
1.68422
1.68409
1.68457
1.68505
1.68554
1.68565
1.68578
1.68626
1.68676
1.68726
1.68715
1.68664
1.68614
1.68604
1.68655
1.68706
1.68758
1.68767
1.68778
1.6879
1.68804
1.68821
1.68839
1.68889
1.6894
1.68992
1.68975
1.68923
1.68871
1.68856
1.68907
1.6896
1.69013
1.69028
1.69044
1.69098
1.69152
1.69206
1.6919
1.69136
1.69082
1.69067
1.69121
1.69176
1.69163
1.69108
1.69054
1.69
1.68947
1.68894
1.68842
1.6883
1.68882
1.68935
1.68925
1.68872
1.68819
1.68811
1.68864
1.68917
1.68971
1.68979
1.68989
1.69043
1.69097
1.69151
1.69141
1.69087
1.69033
1.69025
1.69079
1.69133
1.69187
1.69196
1.69206
1.69217
1.6923
1.69245
1.6926
1.69278
1.69296
1.69316
1.69337
1.69359
1.69383
1.69407
1.69432
1.69484
1.69537
1.69591
1.69568
1.69513
1.6946
1.69436
1.6949
1.69545
1.69599
1.69622
1.69645
1.697
1.69754
1.69809
1.69787
1.69732
1.69677
1.69654
1.69709
1.69765
1.69743
1.69688
1.69633
1.69577
1.69522
1.69468
1.69413
1.69391
1.69446
1.69501
1.69481
1.69425
1.69371
1.69351
1.69406
1.69461
1.69516
1.69536
1.69556
1.69611
1.69667
1.69722
1.69702
1.69647
1.69591
1.69572
1.69627
1.69682
1.69738
1.69757
1.69778
1.69798
1.6982
1.69842
1.69864
1.69918
1.69973
1.70028
1.70006
1.69952
1.69897
1.69875
1.6993
1.69985
1.7004
1.70061
1.70082
1.70137
1.70191
1.70245
1.70224
1.7017
1.70116
1.70095
1.70149
1.70203
1.70182
1.70128
1.70074
1.70019
1.69964
1.69909
1.69854
1.69833
1.69888
1.69943
1.69923
1.69868
1.69813
1.69793
1.69848
1.69903
1.69958
1.69978
1.69998
1.70053
1.70107
1.70162
1.70141
1.70087
1.70032
1.70012
1.70067
1.70121
1.70101
1.70047
1.69993
1.69938
1.69884
1.69829
1.69774
1.69719
1.69664
1.69609
1.69553
1.69498
1.69443
1.69387
1.69332
1.69315
1.6937
1.69425
1.69409
1.69354
1.69299
1.69285
1.6934
1.69395
1.6945
1.69465
1.69481
1.69536
1.69591
1.69646
1.69629
1.69575
1.6952
1.69504
1.69559
1.69614
1.69599
1.69545
1.69491
1.69436
1.69381
1.69327
1.69272
1.6926
1.69315
1.69369
1.69359
1.69304
1.6925
1.69241
1.69295
1.69349
1.69403
1.69413
1.69424
1.69478
1.69532
1.69586
1.69574
1.6952
1.69466
1.69456
1.6951
1.69563
1.69615
1.69627
1.6964
1.69653
1.69668
1.69684
1.69701
1.69756
1.69811
1.69865
1.69847
1.69793
1.69739
1.69723
1.69777
1.69831
1.69884
1.69902
1.6992
1.69974
1.70028
1.70082
1.70063
1.70009
1.69956
1.69938
1.69992
1.70045
1.70028
1.69975
1.69921
1.69868
1.69815
1.69761
1.69707
1.69693
1.69747
1.698
1.69786
1.69733
1.6968
1.69668
1.69721
1.69773
1.69825
1.69838
1.69853
1.69906
1.69959
1.70011
1.69996
1.69943
1.69891
1.69877
1.69929
1.69981
1.69967
1.69916
1.69864
1.69813
1.69761
1.69709
1.69657
1.69605
1.69553
1.695
1.69447
1.69394
1.69341
1.69287
1.69234
1.6918
1.69126
1.69072
1.69018
1.68964
1.68911
1.68857
1.68804
1.68751
1.68699
1.68647
1.68596
1.68545
1.68495
1.68446
1.68398
1.68389
1.68438
1.68488
1.68481
1.68431
1.68382
1.68376
1.68426
1.68477
1.68528
1.68532
1.68538
1.68589
1.68641
1.68693
1.68688
1.68636
1.68584
1.6858
1.68633
1.68685
1.68684
1.68631
1.68578
1.68526
1.68474
1.68422
1.68371
1.68321
1.68317
1.68267
1.68218
1.68213
1.68163
1.68159
1.6821
1.68261
1.68264
1.68315
1.68366
1.68368
1.6842
1.68472
1.68471
1.68418
1.68418
1.68365
1.68313
1.68311
1.68259
1.68207
1.68156
1.68105
1.68054
1.68004
1.67955
1.67906
1.67857
1.67808
1.67759
1.67711
1.67662
1.67613
1.67564
1.67552
1.67602
1.67651
1.6764
1.6759
1.6754
1.67528
1.67579
1.67629
1.6768
1.6769
1.67701
1.6775
1.67799
1.67849
1.67841
1.6779
1.6774
1.67731
1.67781
1.67833
1.67824
1.67772
1.6772
1.67669
1.67617
1.67566
1.67515
1.67463
1.67449
1.67396
1.6738
1.67327
1.67274
1.67255
1.67309
1.67363
1.67416
1.67433
1.67486
1.67501
1.67553
1.67605
1.67591
1.67539
1.67523
1.6747
1.67452
1.67398
1.67344
1.67289
1.67235
1.6718
1.67125
1.67069
1.67012
1.66989
1.66931
1.66905
1.66847
1.66819
1.66759
1.66729
1.66668
1.66606
1.66543
1.66479
1.66413
1.66347
1.66313
1.66245
1.66209
1.66138
1.661
1.66029
1.65988
1.65915
1.6584
1.65798
1.65721
1.65677
1.65598
1.65554
1.65632
1.65709
1.65754
1.6583
1.65873
1.65947
1.66019
1.6606
1.66131
1.66171
1.66239
1.66277
1.66344
1.6638
1.66446
1.6651
1.66475
1.6641
1.66373
1.66307
1.66267
1.662
1.66158
1.66089
1.66045
1.65975
1.65903
1.65858
1.65784
1.65738
1.65663
1.65586
1.65508
1.6546
1.65539
1.65615
1.65566
1.6549
1.65412
1.65363
1.6544
1.65516
1.65591
1.65641
1.6569
1.65763
1.65811
1.65883
1.6593
1.66
1.65953
1.65905
1.65835
1.65785
1.65714
1.65663
1.65735
1.65805
1.65856
1.65924
1.65974
1.66022
1.66069
1.66114
1.66182
1.66226
1.66292
1.66333
1.66398
1.66438
1.66501
1.66538
1.66573
1.66635
1.66697
1.66757
1.66789
1.66848
1.66878
1.66936
1.66963
1.67021
1.67045
1.67102
1.67077
1.67051
1.66994
1.66965
1.66907
1.66876
1.66817
1.66783
1.66723
1.66662
1.66601
1.66564
1.66626
1.66687
1.66748
1.66808
1.66843
1.66902
1.66935
1.66993
1.67023
1.6708
1.67108
1.67134
1.67158
1.67213
1.67268
1.67323
1.67301
1.67246
1.6719
1.67165
1.67221
1.67277
1.67252
1.67195
1.67138
1.67109
1.67051
1.6702
1.66961
1.66927
1.66868
1.66831
1.66771
1.6671
1.66649
1.66588
1.66525
1.66462
1.66421
1.66357
1.66314
1.66249
1.66204
1.66137
1.6609
1.66042
1.66109
1.66157
1.66223
1.66269
1.66334
1.66379
1.66442
1.66485
1.66547
1.66609
1.66567
1.66505
1.66461
1.66398
1.66352
1.66287
1.66239
1.66174
1.66125
1.66059
1.65992
1.65941
1.65874
1.65822
1.65753
1.65683
1.65612
1.6554
1.65465
1.6539
1.65313
1.65233
1.65153
1.6507
1.64985
1.64898
1.64809
1.64718
1.6467
1.64577
1.64529
1.64482
1.64573
1.64622
1.64712
1.64761
1.64849
1.64936
1.6502
1.65102
1.65052
1.6497
1.64886
1.648
1.6475
1.64663
1.64614
1.64525
1.64434
1.64385
1.64293
1.64246
1.64152
1.64105
1.6401
1.63964
1.63868
1.63768
1.63667
1.63563
1.63522
1.63417
1.63378
1.6334
1.63235
1.632
1.63093
1.62985
1.62873
1.62759
1.62642
1.62522
1.62399
1.62377
1.62498
1.62616
1.62592
1.62476
1.62357
1.62339
1.62455
1.62568
1.62679
1.62705
1.62731
1.62844
1.62953
1.6306
1.63028
1.62923
1.62815
1.62788
1.62894
1.62997
1.63099
1.63131
1.63165
1.63267
1.63303
1.63405
1.63443
1.63482
1.63584
1.63625
1.63726
1.63824
1.63919
1.64013
1.64059
1.64151
1.64198
1.64289
1.64337
1.64427
1.64476
1.64564
1.64514
1.64464
1.64378
1.64329
1.64241
1.64193
1.64104
1.64057
1.63967
1.63875
1.6378
1.63683
1.63642
1.63544
1.63504
1.63465
1.63367
1.6333
1.63232
1.63198
1.63294
1.63389
1.63426
1.6352
1.6356
1.636
1.63695
1.63737
1.63831
1.63922
1.63877
1.63787
1.63744
1.63653
1.63612
1.63572
1.63482
1.63444
1.63352
1.63259
1.63164
1.63067
1.62967
1.62866
1.62762
1.62655
1.62546
1.62435
1.62321
1.62305
1.62191
1.62178
1.62064
1.61947
1.61828
1.61706
1.61706
1.61583
1.61588
1.61467
1.61342
1.61355
1.61476
1.61595
1.61602
1.61487
1.6137
1.61385
1.61499
1.61611
1.6172
1.61715
1.6171
1.61707
1.61824
1.61825
1.61942
1.62055
1.62048
1.61937
1.61934
1.61824
1.61825
1.61827
1.61932
1.61932
1.62038
1.62042
1.62149
1.62157
1.62167
1.62276
1.6229
1.62399
1.62416
1.62525
1.62506
1.62487
1.62383
1.62368
1.62264
1.62252
1.62354
1.62454
1.6247
1.6257
1.6259
1.6261
1.62632
1.62736
1.62839
1.62938
1.62911
1.62813
1.62713
1.6269
1.62788
1.62884
1.62858
1.62764
1.62668
1.62648
1.62552
1.62535
1.62439
1.62342
1.62243
1.62141
1.62135
1.62035
1.62033
1.61933
1.61831
1.61727
1.61621
1.61512
1.61401
1.61288
1.61172
1.61054
1.60933
1.60809
1.60683
1.60553
1.6042
1.60467
1.60596
1.60721
1.6076
1.60638
1.60513
1.60559
1.60681
1.60799
1.60915
1.60879
1.60844
1.60964
1.61082
1.61197
1.61221
1.6111
1.60996
1.61028
1.61139
1.61247
1.61272
1.61167
1.6106
1.6095
1.60838
1.60723
1.60605
1.6065
1.60764
1.60876
1.60914
1.60805
1.60694
1.60737
1.60845
1.60952
1.61055
1.61021
1.60986
1.61092
1.61197
1.61298
1.61325
1.61226
1.61124
1.61156
1.61255
1.61351
1.61445
1.61421
1.61398
1.61375
1.61352
1.6133
1.61309
1.61419
1.61526
1.61631
1.61643
1.61541
1.61437
1.61456
1.61557
1.61656
1.61753
1.61743
1.61735
1.61836
1.61935
1.62032
1.62032
1.61938
1.61841
1.61848
1.61942
1.62033
1.62036
1.61947
1.61856
1.61764
1.6167
1.61573
1.61475
1.61495
1.61591
1.61684
1.61699
1.61608
1.61516
1.61536
1.61626
1.61714
1.618
1.61788
1.61775
1.61865
1.61953
1.62039
1.62044
1.6196
1.61875
1.61885
1.61967
1.62049
1.62054
1.61976
1.61895
1.61813
1.6173
1.61645
1.61557
1.61468
1.61377
1.61283
1.61187
1.61089
1.60988
1.60885
1.60778
1.60669
1.60557
1.60442
1.60324
1.60203
1.60079
1.59952
1.59822
1.59689
1.59553
1.59414
1.59273
1.5913
1.58984
1.58837
1.58688
1.58757
1.58906
1.59052
1.59116
1.5897
1.58823
1.58883
1.5903
1.59175
1.59317
1.59259
1.59196
1.59338
1.59478
1.59615
1.59673
1.59538
1.594
1.59457
1.59594
1.59728
1.59779
1.59646
1.5951
1.59371
1.5923
1.59086
1.58939
1.58991
1.59137
1.5928
1.59326
1.59183
1.59038
1.5908
1.59225
1.59368
1.59508
1.59467
1.59421
1.59559
1.59694
1.59826
1.5987
1.59738
1.59604
1.59645
1.59778
1.59909
1.60036
1.59997
1.59955
1.59909
1.59859
1.59806
1.59749
1.5988
1.60008
1.60133
1.60185
1.60062
1.59935
1.59987
1.60112
1.60233
1.60352
1.60305
1.60255
1.60374
1.6049
1.60602
1.60646
1.60535
1.60422
1.60467
1.60578
1.60687
1.60726
1.60619
1.60509
1.60396
1.60279
1.60159
1.60036
1.60081
1.60203
1.60321
1.6036
1.60243
1.60122
1.60159
1.60279
1.60395
1.60508
1.60474
1.60436
1.60548
1.60657
1.60762
1.60795
1.60692
1.60585
1.60618
1.60723
1.60826
1.60854
1.60752
1.60647
1.60539
1.60427
1.60312
1.60193
1.6007
1.59944
1.59814
1.59681
1.59544
1.59405
1.59262
1.59117
1.5915
1.59295
1.59437
1.59465
1.59323
1.59178
1.59201
1.59346
1.59488
1.59626
1.59604
1.59576
1.59712
1.59845
1.59974
1.60001
1.59872
1.59739
1.59762
1.59894
1.60022
1.60039
1.59911
1.59779
1.59644
1.59506
1.59364
1.59219
1.59232
1.59376
1.59518
1.59525
1.59383
1.59239
1.59663
1.59656
1.59791
1.59923
1.60051
1.60058
1.5993
1.59798
1.60182
1.60175
1.60164
1.60147
1.60126
1.601
1.60222
1.6034
1.60455
1.60479
1.60365
1.60247
1.60268
1.60386
1.60499
1.60609
1.6059
1.60566
1.60674
1.60778
1.60878
1.60899
1.60799
1.60696
1.60715
1.60818
1.60917
1.6093
1.60832
1.6073
1.60624
1.60515
1.60401
1.60285
1.60296
1.60413
1.60525
1.60532
1.60419
1.60302
1.60641
1.60635
1.6074
1.60842
1.6094
1.60946
1.60848
1.60746
1.6104
1.61035
1.61025
1.61012
1.60995
1.60975
1.60952
1.60925
1.60896
1.60864
1.60829
1.60792
1.60753
1.60712
1.60819
1.60923
1.61024
1.61058
1.60959
1.60858
1.60895
1.60994
1.61091
1.61185
1.61154
1.61122
1.61218
1.61311
1.61402
1.61427
1.61339
1.61248
1.61276
1.61365
1.61452
1.61475
1.6139
1.61303
1.61214
1.61122
1.61027
1.6093
1.60963
1.61058
1.61151
1.61179
1.61087
1.60993
1.61021
1.61114
1.61204
1.61291
1.61268
1.61242
1.61329
1.61414
1.61497
1.61518
1.61437
1.61354
1.61376
1.61458
1.61537
1.61615
1.61597
1.61578
1.61557
1.61536
1.61514
1.61491
1.61578
1.61663
1.61746
1.61761
1.61681
1.61598
1.61618
1.61699
1.61777
1.61854
1.6184
1.61827
1.61906
1.61984
1.62061
1.62068
1.61993
1.61918
1.61929
1.62002
1.62075
1.62082
1.62012
1.6194
1.61867
1.61792
1.61716
1.61638
1.61656
1.61732
1.61807
1.61821
1.61748
1.61673
1.6169
1.61763
1.61834
1.61904
1.61892
1.6188
1.61951
1.62021
1.62089
1.62096
1.62029
1.61961
1.61971
1.62038
1.62103
1.62109
1.62046
1.61981
1.61914
1.61846
1.61776
1.61704
1.61631
1.61555
1.61477
1.61396
1.61313
1.61227
1.61138
1.61046
1.61069
1.61159
1.61247
1.61265
1.61178
1.61088
1.61104
1.61193
1.61279
1.61363
1.61349
1.61332
1.61414
1.61493
1.6157
1.61584
1.61508
1.6143
1.61443
1.61521
1.61596
1.61605
1.6153
1.61453
1.61374
1.61291
1.61206
1.61117
1.61126
1.61214
1.61299
1.61304
1.61219
1.61131
1.61386
1.61381
1.61461
1.61537
1.61611
1.61615
1.61541
1.61465
1.61687
1.61683
1.61677
1.61669
1.61658
1.61645
1.61718
1.61788
1.61857
1.61867
1.61799
1.61729
1.61739
1.61808
1.61875
1.6194
1.61932
1.61924
1.61989
1.62053
1.62115
1.62121
1.62059
1.61997
1.62003
1.62065
1.62125
1.62129
1.62069
1.62008
1.61946
1.61881
1.61815
1.61747
1.61753
1.6182
1.61886
1.61889
1.61824
1.61756
1.61953
1.6195
1.62012
1.62073
1.62132
1.62134
1.62075
1.62014
1.62192
1.6219
1.62188
1.62184
1.62181
1.62176
1.62172
1.62167
1.62161
1.62156
1.62151
1.62145
1.6214
1.62136
1.62132
1.62128
1.62126
1.62124
1.62123
1.62123
1.62125
1.62127
1.6213
1.62227
1.62234
1.62331
1.62426
1.62519
1.6261
1.62628
1.6272
1.62741
1.62833
1.6281
1.62788
1.627
1.6268
1.62593
1.62504
1.62413
1.62321
1.62312
1.6222
1.62215
1.62212
1.62298
1.62305
1.62392
1.62402
1.6249
1.62577
1.62662
1.62746
1.62766
1.6285
1.62874
1.62898
1.62924
1.6295
1.62978
1.63006
1.63036
1.63132
1.63225
1.63317
1.63282
1.63192
1.631
1.6307
1.6316
1.63248
1.63335
1.6337
1.63406
1.63494
1.63533
1.6362
1.6366
1.63702
1.6379
1.63833
1.6392
1.63965
1.64011
1.64098
1.64145
1.64231
1.6428
1.64365
1.64415
1.64498
1.64549
1.646
1.6465
1.647
1.64785
1.64836
1.64919
1.65
1.64948
1.64868
1.64816
1.64734
1.64683
1.64632
1.64712
1.64764
1.64844
1.64896
1.64975
1.65027
1.6508
1.65132
1.65183
1.65262
1.65338
1.65414
1.65361
1.65286
1.6521
1.65157
1.65234
1.65308
1.65381
1.65435
1.65487
1.6556
1.6563
1.657
1.65646
1.65577
1.65506
1.65452
1.65523
1.65592
1.65537
1.65468
1.65398
1.65327
1.65254
1.6518
1.65105
1.65051
1.65126
1.652
1.65145
1.65072
1.64998
1.64922
1.64868
1.64791
1.64738
1.6466
1.6458
1.64529
1.64448
1.64398
1.64315
1.64266
1.64183
1.64135
1.64051
1.64005
1.64088
1.64169
1.64217
1.64298
1.64347
1.64427
1.64478
1.64556
1.64608
1.64686
1.64633
1.6458
1.64504
1.64453
1.64376
1.64326
1.64248
1.64199
1.64121
1.64041
1.63959
1.63875
1.63831
1.63747
1.63705
1.63663
1.6358
1.6354
1.63456
1.63419
1.63502
1.63583
1.63623
1.63703
1.63745
1.63788
1.63869
1.63914
1.63995
1.64074
1.64151
1.64227
1.64276
1.64351
1.64402
1.64476
1.64528
1.64602
1.64655
1.64708
1.64761
1.64815
1.6489
1.64944
1.65018
1.6509
1.65161
1.65217
1.65272
1.65343
1.65412
1.65481
1.65425
1.65356
1.65287
1.65231
1.653
1.65368
1.65311
1.65244
1.65175
1.65106
1.65035
1.64963
1.64908
1.64836
1.64782
1.64728
1.64799
1.64854
1.64924
1.6498
1.6505
1.65119
1.65187
1.65254
1.65197
1.65131
1.65063
1.64994
1.64938
1.64869
1.64814
1.64745
1.64674
1.6462
1.64549
1.64496
1.64424
1.64373
1.64301
1.64251
1.64178
1.64103
1.64027
1.63949
1.63904
1.63825
1.63782
1.6374
1.63662
1.63622
1.63544
1.63464
1.63383
1.633
1.63215
1.63129
1.6304
1.63012
1.63099
1.63183
1.63153
1.63069
1.62985
1.62958
1.63041
1.63123
1.63202
1.63234
1.63267
1.63348
1.63428
1.63506
1.63469
1.63392
1.63314
1.63281
1.63358
1.63433
1.63398
1.63324
1.63249
1.63172
1.63094
1.63014
1.62933
1.62909
1.62828
1.62807
1.62727
1.62646
1.62563
1.62478
1.62467
1.62383
1.62376
1.62293
1.62209
1.62207
1.62289
1.62369
1.62364
1.62286
1.62207
1.62207
1.62284
1.62359
1.62434
1.62441
1.62448
1.62457
1.62537
1.62549
1.6263
1.6271
1.62693
1.62616
1.62602
1.62526
1.62516
1.62507
1.6258
1.6259
1.62664
1.62678
1.62752
1.62769
1.62788
1.62864
1.62886
1.62963
1.62988
1.63066
1.6304
1.63014
1.6294
1.62917
1.62844
1.62825
1.62896
1.62967
1.6299
1.63061
1.63087
1.63114
1.63143
1.63218
1.63291
1.63364
1.63331
1.6326
1.63188
1.63159
1.6323
1.63299
1.63269
1.63201
1.63131
1.63105
1.63037
1.63013
1.62945
1.62876
1.62807
1.62736
1.62721
1.62651
1.62639
1.6257
1.625
1.62428
1.62356
1.62283
1.62208
1.6221
1.62282
1.62353
1.62352
1.62282
1.62212
1.62215
1.62283
1.62351
1.62417
1.6242
1.62424
1.62493
1.62561
1.62628
1.62618
1.62553
1.62487
1.62482
1.62546
1.6261
1.62602
1.6254
1.62478
1.62414
1.6235
1.62285
1.62218
1.62222
1.62286
1.6235
1.6235
1.62288
1.62225
1.62229
1.62291
1.62351
1.62411
1.62411
1.62413
1.62474
1.62535
1.62596
1.6259
1.62531
1.62472
1.62469
1.62527
1.62585
1.62641
1.62648
1.62655
1.62663
1.62672
1.62683
1.62694
1.62707
1.62774
1.6279
1.62858
1.62925
1.62991
1.63056
1.6308
1.63146
1.63173
1.63239
1.63211
1.63185
1.63121
1.63097
1.63034
1.6297
1.62906
1.6284
1.62824
1.6276
1.62746
1.62734
1.62796
1.62809
1.62871
1.62888
1.62951
1.63013
1.63075
1.63136
1.6316
1.63222
1.63248
1.63276
1.63305
1.63336
1.63368
1.63401
1.63435
1.6347
1.63507
1.63544
1.63583
1.63658
1.63699
1.63773
1.63816
1.6386
1.63935
1.63981
1.64056
1.6413
1.64202
1.64273
1.64323
1.64393
1.64445
1.64515
1.64567
1.64637
1.64691
1.6476
1.64705
1.64652
1.64584
1.64531
1.64463
1.64411
1.64343
1.64293
1.64224
1.64154
1.64082
1.64009
1.63964
1.63891
1.63847
1.63804
1.63732
1.63691
1.63618
1.63579
1.63651
1.63721
1.63762
1.63832
1.63875
1.63919
1.6399
1.64036
1.64106
1.64175
1.64128
1.64059
1.64013
1.63945
1.63901
1.63858
1.6379
1.63749
1.63681
1.63612
1.63542
1.63505
1.63574
1.63642
1.63604
1.63537
1.63469
1.63435
1.63502
1.63567
1.63632
1.6367
1.63709
1.63775
1.63816
1.63882
1.63925
1.63969
1.64035
1.64081
1.64148
1.64195
1.64244
1.64311
1.64361
1.64428
1.64479
1.64546
1.64598
1.64665
1.64719
1.64773
1.64828
1.64883
1.64951
1.65007
1.65074
1.65141
1.65084
1.65018
1.64962
1.64895
1.6484
1.64785
1.64851
1.64906
1.64972
1.65028
1.65093
1.6515
1.65207
1.65264
1.65321
1.65378
1.65435
1.65492
1.65548
1.65604
1.6566
1.65715
1.65769
1.65836
1.65889
1.65956
1.66008
1.66074
1.66139
1.6619
1.66254
1.66304
1.66367
1.66415
1.66478
1.66523
1.66586
1.66629
1.66671
1.66732
1.66792
1.66853
1.66891
1.66951
1.66986
1.67045
1.67078
1.67137
1.67167
1.67224
1.67195
1.67164
1.67104
1.6707
1.67011
1.66974
1.66913
1.66874
1.66813
1.66752
1.66691
1.66648
1.66709
1.66771
1.66833
1.66894
1.66935
1.66996
1.67034
1.67095
1.6713
1.67191
1.67223
1.67254
1.67282
1.67309
1.67334
1.67357
1.67378
1.67433
1.67488
1.67506
1.67561
1.67577
1.67631
1.67644
1.67657
1.67709
1.67762
1.67815
1.67804
1.67751
1.67697
1.67684
1.67739
1.67793
1.67848
1.67858
1.67868
1.67876
1.67884
1.67891
1.67898
1.67948
1.67999
1.6805
1.68045
1.67993
1.67942
1.67936
1.67988
1.6804
1.68093
1.68097
1.68101
1.68152
1.68205
1.68257
1.68255
1.68202
1.68149
1.68146
1.682
1.68254
1.68252
1.68197
1.68142
1.68088
1.68035
1.67982
1.67929
1.67921
1.67975
1.68029
1.68023
1.67967
1.67913
1.67903
1.67959
1.68015
1.68071
1.68078
1.68084
1.68138
1.68194
1.68249
1.68246
1.6819
1.68134
1.68128
1.68185
1.68242
1.68299
1.68303
1.68305
1.68307
1.68308
1.68309
1.6831
1.68363
1.68364
1.68417
1.6847
1.6847
1.68524
1.68524
1.68524
1.68577
1.6863
1.68683
1.68683
1.6863
1.68577
1.68577
1.68631
1.68685
1.68738
1.68737
1.68737
1.68737
1.68738
1.68741
1.68745
1.68798
1.68852
1.68905
1.68902
1.68848
1.68794
1.68792
1.68845
1.68899
1.68953
1.68955
1.68959
1.69013
1.69067
1.6912
1.69116
1.69063
1.69009
1.69006
1.6906
1.69113
1.69111
1.69058
1.69005
1.68951
1.68898
1.68844
1.68791
1.6879
1.68844
1.68898
1.68898
1.68844
1.68791
1.68792
1.68846
1.68899
1.68953
1.68951
1.68951
1.69004
1.69057
1.6911
1.6911
1.69057
1.69005
1.69006
1.69058
1.6911
1.69112
1.6906
1.69007
1.68955
1.68901
1.68848
1.68794
1.6874
1.68686
1.68632
1.68578
1.68524
1.68525
1.68471
1.68417
1.68417
1.68363
1.68363
1.68418
1.68473
1.68472
1.68527
1.68581
1.6858
1.68634
1.68688
1.68691
1.68636
1.68638
1.68583
1.68528
1.68529
1.68473
1.68418
1.68362
1.68361
1.68417
1.68473
1.68472
1.68416
1.68359
1.68357
1.68414
1.68471
1.68528
1.68529
1.68529
1.68585
1.68584
1.6864
1.68695
1.68693
1.68747
1.68745
1.68743
1.68797
1.6885
1.68904
1.68906
1.68853
1.68799
1.68802
1.68856
1.68909
1.68962
1.68959
1.68957
1.69009
1.69062
1.69113
1.69115
1.69064
1.69012
1.69014
1.69066
1.69117
1.69119
1.69068
1.69017
1.68964
1.68911
1.68858
1.68804
1.6875
1.68751
1.68696
1.68641
1.68642
1.68586
1.68585
1.68642
1.68698
1.68697
1.68753
1.68808
1.68806
1.6886
1.68914
1.68915
1.68862
1.68863
1.68808
1.68753
1.68753
1.68697
1.68641
1.68584
1.68527
1.68469
1.68411
1.68353
1.68295
1.68237
1.68179
1.68121
1.68064
1.68006
1.67949
1.67893
1.67837
1.67781
1.67725
1.6767
1.67615
1.67599
1.67543
1.67525
1.67469
1.67413
1.6739
1.67447
1.67504
1.67561
1.67581
1.67637
1.67655
1.67711
1.67767
1.67752
1.67694
1.67677
1.67619
1.67598
1.6754
1.67482
1.67424
1.67366
1.6734
1.67399
1.67458
1.67432
1.67372
1.67313
1.67283
1.67343
1.67404
1.67465
1.67491
1.67517
1.67576
1.67636
1.67657
1.67716
1.67735
1.67794
1.67809
1.67824
1.67881
1.67938
1.67996
1.67985
1.67926
1.67868
1.67853
1.67912
1.67972
1.68032
1.68044
1.68054
1.68113
1.68172
1.6823
1.68222
1.68163
1.68103
1.68092
1.68153
1.68213
1.68202
1.68141
1.68079
1.68018
1.67957
1.67896
1.67836
1.67776
1.67757
1.67696
1.67674
1.67613
1.67552
1.67526
1.67588
1.6765
1.67712
1.67736
1.67798
1.67818
1.67879
1.67941
1.67923
1.6786
1.67839
1.67776
1.67751
1.67687
1.67624
1.67561
1.67498
1.67436
1.67374
1.67312
1.67251
1.67218
1.67156
1.6712
1.67058
1.67019
1.66956
1.66915
1.66852
1.66789
1.66727
1.66665
1.66603
1.6654
1.66494
1.66431
1.66382
1.66318
1.66268
1.66204
1.66152
1.66087
1.66022
1.65968
1.65903
1.65849
1.65782
1.65727
1.65794
1.65859
1.65914
1.6598
1.66034
1.66099
1.66163
1.66216
1.6628
1.66332
1.66395
1.66445
1.66508
1.66556
1.66619
1.66682
1.66635
1.66571
1.66522
1.66459
1.66408
1.66344
1.66292
1.66227
1.66174
1.66109
1.66045
1.6599
1.65925
1.65869
1.65804
1.65738
1.65671
1.65615
1.65682
1.65747
1.6569
1.65625
1.65559
1.65502
1.65568
1.65633
1.65699
1.65756
1.65813
1.65878
1.65934
1.65999
1.66054
1.66119
1.66064
1.66008
1.65943
1.65886
1.65821
1.65764
1.65829
1.65895
1.65951
1.66017
1.66073
1.66129
1.66184
1.66238
1.66303
1.66356
1.6642
1.66472
1.66536
1.66586
1.6665
1.66698
1.66745
1.66808
1.66871
1.66935
1.66978
1.67041
1.67081
1.67145
1.67182
1.67245
1.6728
1.67342
1.67308
1.67272
1.67208
1.6717
1.67105
1.67064
1.66999
1.66956
1.6689
1.66826
1.66762
1.66714
1.66779
1.66845
1.6691
1.66977
1.67021
1.67087
1.67129
1.67195
1.67235
1.673
1.67337
1.67372
1.67405
1.67468
1.67532
1.67596
1.67566
1.67501
1.67436
1.67402
1.67468
1.67534
1.675
1.67433
1.67366
1.67329
1.67262
1.67222
1.67154
1.67111
1.67044
1.66999
1.66931
1.66864
1.66797
1.66731
1.66666
1.66601
1.6655
1.66485
1.66433
1.66368
1.66314
1.66249
1.66194
1.66139
1.66205
1.6626
1.66326
1.6638
1.66446
1.66499
1.66565
1.66616
1.66682
1.66748
1.66699
1.66631
1.6658
1.66513
1.6646
1.66392
1.66338
1.66271
1.66216
1.66149
1.66083
1.66027
1.6596
1.65904
1.65838
1.65772
1.65706
1.65641
1.65576
1.6551
1.65444
1.65387
1.65453
1.65518
1.65461
1.65395
1.6533
1.65272
1.65338
1.65403
1.65468
1.65526
1.65584
1.65649
1.65714
1.6578
1.65723
1.65657
1.65591
1.65534
1.656
1.65666
1.65609
1.65543
1.65477
1.65411
1.65346
1.65281
1.65215
1.65159
1.65224
1.65289
1.65232
1.65167
1.65102
1.65037
1.64981
1.64916
1.64862
1.64797
1.64731
1.64678
1.64612
1.6456
1.64494
1.64443
1.64377
1.64328
1.64262
1.64214
1.64279
1.64344
1.64393
1.64458
1.64508
1.64573
1.64625
1.6469
1.64743
1.64808
1.64754
1.64702
1.64638
1.64586
1.64522
1.64472
1.64408
1.6436
1.64296
1.64232
1.64167
1.64101
1.64056
1.63991
1.63947
1.63905
1.6384
1.63799
1.63735
1.63696
1.6376
1.63823
1.63863
1.63927
1.63969
1.64012
1.64076
1.64121
1.64185
1.64249
1.64312
1.64376
1.64423
1.64487
1.64536
1.646
1.6465
1.64714
1.64766
1.64819
1.64872
1.64927
1.64991
1.65046
1.65111
1.65176
1.65242
1.65298
1.65354
1.6542
1.65486
1.65552
1.65496
1.65429
1.65363
1.65307
1.65374
1.6544
1.65508
1.65563
1.65619
1.65676
1.65733
1.6579
1.65847
1.65913
1.6597
1.66037
1.66093
1.66161
1.66229
1.66284
1.66352
1.66406
1.66474
1.66528
1.66596
1.66648
1.66716
1.66767
1.66816
1.66884
1.66952
1.67022
1.67067
1.67136
1.6718
1.67249
1.6729
1.67358
1.67396
1.67464
1.67427
1.67388
1.67318
1.67276
1.67206
1.67162
1.67091
1.67045
1.66975
1.66905
1.66835
1.66786
1.66856
1.66927
1.66998
1.6707
1.67117
1.67188
1.67233
1.67304
1.67347
1.67418
1.67458
1.67496
1.67533
1.67568
1.67601
1.67631
1.6766
1.67725
1.67791
1.67816
1.6788
1.67902
1.67966
1.67985
1.68003
1.68065
1.68127
1.68189
1.68175
1.68112
1.68048
1.6803
1.68094
1.68158
1.6814
1.68075
1.6801
1.67945
1.67922
1.67856
1.6783
1.67764
1.67697
1.67667
1.67735
1.67802
1.6787
1.67897
1.67963
1.67988
1.68053
1.68119
1.68096
1.6803
1.68005
1.67937
1.67909
1.6784
1.67772
1.67704
1.67635
1.67602
1.67671
1.6774
1.67706
1.67636
1.67566
1.67528
1.67599
1.6767
1.67741
1.67776
1.67809
1.67879
1.67948
1.67977
1.68045
1.68072
1.68139
1.68163
1.68184
1.68204
1.68222
1.68237
1.68251
1.68263
1.68273
1.68282
1.68289
1.68348
1.68407
1.68465
1.6846
1.68401
1.68342
1.68334
1.68394
1.68454
1.68513
1.68519
1.68524
1.68582
1.68639
1.68696
1.68693
1.68636
1.68578
1.68572
1.68631
1.68688
1.68682
1.68624
1.68565
1.68506
1.68446
1.68385
1.68324
1.68313
1.68375
1.68436
1.68424
1.68362
1.683
1.68285
1.68348
1.68411
1.68473
1.68486
1.68496
1.68557
1.68616
1.68675
1.68665
1.68606
1.68546
1.68534
1.68595
1.68654
1.68713
1.68724
1.68733
1.6874
1.68745
1.68749
1.68752
1.68807
1.68808
1.68863
1.68917
1.68916
1.68969
1.68968
1.68967
1.69019
1.6907
1.69121
1.69122
1.69072
1.6902
1.69021
1.69073
1.69123
1.69173
1.69172
1.69171
1.69169
1.69168
1.69166
1.69164
1.69163
1.69162
1.69162
1.69162
1.69164
1.69166
1.6917
1.69174
1.69228
1.69281
1.69334
1.69328
1.69276
1.69223
1.69219
1.69271
1.69324
1.69376
1.69381
1.69387
1.69439
1.69492
1.69544
1.69536
1.69485
1.69433
1.69427
1.69479
1.6953
1.69524
1.69473
1.69423
1.69372
1.6932
1.69268
1.69216
1.69214
1.69266
1.69318
1.69316
1.69265
1.69214
1.69214
1.69264
1.69315
1.69365
1.69366
1.69368
1.69419
1.69469
1.69519
1.69515
1.69466
1.69416
1.69414
1.69463
1.69512
1.69561
1.69564
1.69569
1.69574
1.6958
1.69587
1.69596
1.69647
1.69699
1.6975
1.6974
1.69689
1.69639
1.69631
1.69681
1.69731
1.69781
1.69791
1.69801
1.69852
1.69903
1.69954
1.69943
1.69892
1.69841
1.69831
1.69881
1.69932
1.69922
1.69872
1.69822
1.69773
1.69723
1.69674
1.69624
1.69618
1.69667
1.69716
1.6971
1.69662
1.69613
1.69609
1.69657
1.69705
1.69753
1.69759
1.69765
1.69814
1.69863
1.69913
1.69904
1.69856
1.69807
1.69801
1.69849
1.69897
1.69891
1.69843
1.69795
1.69748
1.697
1.69653
1.69605
1.69558
1.6951
1.69461
1.69413
1.69364
1.69314
1.69264
1.69214
1.69215
1.69265
1.69314
1.69315
1.69266
1.69216
1.69218
1.69267
1.69316
1.69364
1.69363
1.69363
1.69412
1.6946
1.69508
1.69506
1.69459
1.69412
1.69411
1.69459
1.69505
1.69505
1.69458
1.69411
1.69364
1.69316
1.69268
1.69219
1.6922
1.69269
1.69317
1.69318
1.6927
1.69222
1.69222
1.69271
1.69318
1.69365
1.69365
1.69365
1.69412
1.69458
1.69504
1.69503
1.69458
1.69412
1.69411
1.69457
1.69503
1.69548
1.69549
1.6955
1.69551
1.69552
1.69553
1.69555
1.69602
1.69649
1.69696
1.69693
1.69646
1.696
1.69598
1.69644
1.6969
1.69736
1.69739
1.69743
1.6979
1.69837
1.69885
1.6988
1.69833
1.69786
1.69782
1.69829
1.69876
1.69872
1.69825
1.69779
1.69733
1.69688
1.69642
1.69596
1.69595
1.6964
1.69686
1.69684
1.69639
1.69594
1.69593
1.69638
1.69682
1.69727
1.69729
1.69731
1.69777
1.69822
1.69869
1.69866
1.6982
1.69774
1.69772
1.69818
1.69863
1.6991
1.69912
1.69915
1.69919
1.69923
1.69928
1.69933
1.69939
1.69946
1.69954
1.69962
1.69972
1.69982
1.69993
1.70006
1.70019
1.70033
1.70048
1.70064
1.70081
1.70098
1.70117
1.70136
1.70155
1.70175
1.70195
1.70216
1.70237
1.70257
1.70278
1.70299
1.70352
1.70406
1.70459
1.70439
1.70386
1.70332
1.70311
1.70365
1.70419
1.70472
1.70492
1.70512
1.70565
1.70618
1.70671
1.70652
1.70599
1.70545
1.70526
1.70579
1.70632
1.70613
1.70559
1.70505
1.70452
1.70398
1.70344
1.70291
1.7027
1.70324
1.70378
1.70357
1.70303
1.70249
1.70229
1.70283
1.70337
1.70391
1.70411
1.70431
1.70485
1.70539
1.70593
1.70573
1.70519
1.70465
1.70445
1.70499
1.70553
1.70607
1.70627
1.70647
1.70666
1.70686
1.70705
1.70723
1.70776
1.70829
1.70881
1.70864
1.70811
1.70758
1.70739
1.70793
1.70846
1.709
1.70917
1.70934
1.70987
1.7104
1.71094
1.71079
1.71025
1.70971
1.70954
1.71008
1.71063
1.71046
1.70991
1.70937
1.70882
1.70828
1.70774
1.7072
1.70701
1.70755
1.70809
1.7079
1.70736
1.70681
1.70662
1.70716
1.70772
1.70827
1.70845
1.70864
1.70919
1.70974
1.71029
1.71012
1.70956
1.70901
1.70883
1.70939
1.70995
1.70978
1.70921
1.70864
1.70808
1.70753
1.70697
1.70642
1.70587
1.70533
1.70479
1.70425
1.70371
1.70317
1.70263
1.70209
1.70189
1.70243
1.70297
1.70278
1.70224
1.7017
1.70152
1.70205
1.70259
1.70313
1.70331
1.70351
1.70405
1.70459
1.70513
1.70494
1.7044
1.70385
1.70366
1.70421
1.70475
1.70457
1.70402
1.70348
1.70294
1.70241
1.70187
1.70134
1.70117
1.7017
1.70223
1.70206
1.70154
1.70101
1.70085
1.70138
1.70191
1.70244
1.7026
1.70277
1.7033
1.70384
1.70439
1.70422
1.70367
1.70313
1.70297
1.70351
1.70405
1.7046
1.70476
1.70494
1.70511
1.7053
1.70549
1.70568
1.70623
1.70678
1.70734
1.70715
1.70659
1.70604
1.70585
1.70641
1.70697
1.70753
1.70771
1.7079
1.70846
1.70903
1.7096
1.70943
1.70885
1.70828
1.7081
1.70868
1.70926
1.70909
1.7085
1.70793
1.70735
1.70679
1.70622
1.70567
1.70549
1.70605
1.70661
1.70644
1.70588
1.70532
1.70515
1.70571
1.70628
1.70685
1.70701
1.70718
1.70775
1.70833
1.70892
1.70876
1.70817
1.70759
1.70743
1.70801
1.7086
1.7092
1.70935
1.70951
1.70967
1.70984
1.71001
1.71018
1.71035
1.71052
1.71069
1.71085
1.71102
1.71117
1.71133
1.71147
1.71201
1.71255
1.7131
1.71297
1.71242
1.71187
1.71172
1.71228
1.71283
1.71339
1.71352
1.71365
1.7142
1.71475
1.7153
1.7152
1.71464
1.71408
1.71396
1.71452
1.71509
1.71497
1.7144
1.71383
1.71326
1.71269
1.71213
1.71157
1.71141
1.71198
1.71255
1.7124
1.71182
1.71125
1.71109
1.71167
1.71225
1.71283
1.71298
1.71312
1.71369
1.71427
1.71485
1.71472
1.71414
1.71356
1.71341
1.714
1.71459
1.71518
1.71531
1.71543
1.71554
1.71565
1.71576
1.71586
1.71641
1.71697
1.71753
1.71745
1.71689
1.71632
1.71622
1.71679
1.71736
1.71793
1.71801
1.71809
1.71865
1.71921
1.71977
1.71971
1.71914
1.71858
1.7185
1.71907
1.71964
1.71957
1.71899
1.71842
1.71784
1.71727
1.71669
1.71612
1.71601
1.71659
1.71717
1.71707
1.71648
1.7159
1.71578
1.71637
1.71696
1.71756
1.71766
1.71775
1.71833
1.71891
1.71949
1.71941
1.71883
1.71824
1.71815
1.71874
1.71933
1.71924
1.71865
1.71805
1.71745
1.71685
1.71626
1.71566
1.71506
1.71446
1.71386
1.71327
1.71268
1.71209
1.71151
1.71093
1.71076
1.71135
1.71194
1.71178
1.71118
1.71059
1.71043
1.71103
1.71162
1.71223
1.71238
1.71253
1.71313
1.71373
1.71433
1.71419
1.71359
1.71298
1.71284
1.71345
1.71406
1.71392
1.71331
1.71269
1.71208
1.71147
1.71087
1.71027
1.71011
1.71071
1.71132
1.71117
1.71056
1.70995
1.7098
1.71041
1.71103
1.71165
1.71179
1.71193
1.71255
1.71317
1.71379
1.71366
1.71303
1.71241
1.71227
1.7129
1.71353
1.71416
1.71429
1.71441
1.71454
1.71467
1.7148
1.71493
1.71553
1.71614
1.71674
1.71663
1.71602
1.71541
1.71529
1.7159
1.71652
1.71713
1.71724
1.71735
1.71795
1.71855
1.71915
1.71906
1.71845
1.71785
1.71774
1.71836
1.71897
1.71887
1.71826
1.71764
1.71702
1.7164
1.71578
1.71516
1.71504
1.71566
1.71629
1.71618
1.71555
1.71492
1.7148
1.71543
1.71606
1.7167
1.7168
1.71691
1.71754
1.71816
1.71878
1.71868
1.71806
1.71743
1.71733
1.71796
1.71859
1.71849
1.71786
1.71723
1.71659
1.71595
1.71532
1.71468
1.71404
1.71341
1.71277
1.71214
1.71151
1.71089
1.71027
1.70966
1.70905
1.70845
1.70786
1.70727
1.70669
1.70612
1.70555
1.70499
1.70444
1.70389
1.70335
1.70281
1.70228
1.70175
1.70123
1.70071
1.70057
1.70109
1.70161
1.70148
1.70096
1.70045
1.70033
1.70084
1.70135
1.70187
1.702
1.70214
1.70267
1.7032
1.70374
1.7036
1.70306
1.70253
1.7024
1.70293
1.70347
1.70334
1.70281
1.70228
1.70176
1.70124
1.70073
1.70022
1.70012
1.70062
1.70113
1.70104
1.70053
1.70003
1.69995
1.70045
1.70095
1.70146
1.70155
1.70165
1.70217
1.7027
1.70323
1.70312
1.70259
1.70207
1.70197
1.70249
1.70303
1.70356
1.70366
1.70377
1.70389
1.70401
1.70415
1.70429
1.70484
1.7054
1.70597
1.70583
1.70526
1.7047
1.70457
1.70512
1.70569
1.70627
1.7064
1.70654
1.70712
1.70771
1.70831
1.70817
1.70757
1.70698
1.70685
1.70744
1.70804
1.70791
1.70731
1.70672
1.70614
1.70556
1.705
1.70444
1.70432
1.70488
1.70545
1.70534
1.70477
1.70421
1.70411
1.70467
1.70523
1.70581
1.70591
1.70602
1.7066
1.7072
1.7078
1.70769
1.70709
1.70649
1.70639
1.70698
1.70758
1.70749
1.70689
1.7063
1.70571
1.70514
1.70458
1.70402
1.70347
1.70294
1.70241
1.70189
1.70137
1.70087
1.70037
1.69988
1.69981
1.7003
1.7008
1.70073
1.70024
1.69976
1.69971
1.70019
1.70068
1.70118
1.70124
1.7013
1.70181
1.70233
1.70286
1.70278
1.70226
1.70174
1.70168
1.7022
1.70272
1.70267
1.70214
1.70163
1.70113
1.70063
1.70014
1.69966
1.69962
1.7001
1.70059
1.70055
1.70007
1.69959
1.69956
1.70004
1.70052
1.70101
1.70104
1.70108
1.70158
1.7021
1.70262
1.70258
1.70206
1.70155
1.70151
1.70202
1.70254
1.70307
1.7031
1.70315
1.7032
1.70325
1.70332
1.70339
1.70394
1.70449
1.70506
1.70498
1.70442
1.70386
1.7038
1.70435
1.70491
1.70548
1.70555
1.70563
1.70621
1.7068
1.7074
1.70733
1.70672
1.70613
1.70606
1.70665
1.70725
1.70719
1.70659
1.706
1.70542
1.70485
1.70429
1.70374
1.70369
1.70424
1.7048
1.70475
1.70419
1.70364
1.70361
1.70416
1.70471
1.70528
1.70532
1.70537
1.70595
1.70654
1.70714
1.70709
1.70649
1.7059
1.70586
1.70645
1.70705
1.70765
1.7077
1.70774
1.7078
1.70786
1.70793
1.70801
1.7081
1.70819
1.70829
1.7084
1.70852
1.70864
1.70877
1.70891
1.70952
1.71013
1.71075
1.71062
1.71
1.70938
1.70926
1.70987
1.7105
1.71113
1.71125
1.71138
1.71201
1.71265
1.71328
1.71316
1.71252
1.71189
1.71177
1.71241
1.71305
1.71294
1.7123
1.71165
1.71102
1.71038
1.70975
1.70913
1.70902
1.70964
1.71027
1.71016
1.70953
1.70891
1.70881
1.70943
1.71007
1.7107
1.7108
1.71091
1.71155
1.71219
1.71284
1.71274
1.71209
1.71144
1.71135
1.71199
1.71264
1.7133
1.71339
1.71349
1.71359
1.7137
1.71381
1.71392
1.71456
1.7152
1.71584
1.71574
1.7151
1.71445
1.71434
1.71499
1.71564
1.71628
1.71638
1.71649
1.71713
1.71776
1.7184
1.71831
1.71767
1.71703
1.71693
1.71757
1.71822
1.71813
1.71748
1.71684
1.71619
1.71554
1.71489
1.71424
1.71414
1.71479
1.71544
1.71535
1.71469
1.71404
1.71395
1.7146
1.71526
1.71592
1.716
1.71609
1.71674
1.71739
1.71804
1.71795
1.71731
1.71666
1.71657
1.71722
1.71787
1.71779
1.71714
1.71649
1.71583
1.71518
1.71452
1.71386
1.71321
1.71255
1.7119
1.71126
1.71061
1.70997
1.70934
1.70872
1.70863
1.70926
1.70989
1.70981
1.70918
1.70855
1.70848
1.70911
1.70974
1.71038
1.71045
1.71053
1.71117
1.71182
1.71247
1.71239
1.71174
1.71109
1.71102
1.71167
1.71232
1.71226
1.7116
1.71096
1.71031
1.70967
1.70904
1.70842
1.70836
1.70899
1.70962
1.70957
1.70894
1.70831
1.70827
1.70889
1.70952
1.71016
1.7102
1.71025
1.7109
1.71155
1.7122
1.71214
1.71149
1.71085
1.7108
1.71145
1.7121
1.71275
1.7128
1.71285
1.71291
1.71298
1.71305
1.71313
1.71378
1.71444
1.7151
1.71502
1.71436
1.7137
1.71363
1.71429
1.71495
1.71561
1.71568
1.71575
1.71641
1.71706
1.71772
1.71764
1.71699
1.71634
1.71626
1.71692
1.71757
1.71751
1.71685
1.7162
1.71554
1.71488
1.71422
1.71357
1.71351
1.71416
1.71482
1.71476
1.71411
1.71345
1.7134
1.71406
1.71471
1.71537
1.71542
1.71548
1.71614
1.71679
1.71744
1.71738
1.71673
1.71608
1.71602
1.71668
1.71733
1.71798
1.71803
1.71809
1.71816
1.71822
1.71829
1.71837
1.71844
1.71852
1.7186
1.71868
1.71877
1.71885
1.71894
1.71903
1.71912
1.71921
1.7193
1.71939
1.71948
1.71957
1.71966
1.71975
1.71983
1.71992
1.71999
1.72007
1.72014
1.72021
1.72027
1.72033
1.72038
1.72042
1.72046
1.72049
1.72052
1.72054
1.72055
1.72055
1.72055
1.72054
1.72053
1.72051
1.72048
1.72045
1.72042
1.72038
1.72034
1.7203
1.72025
1.72021
1.72016
1.72011
1.72007
1.72002
1.71998
1.71994
1.7199
1.71986
1.71983
1.7198
1.71977
1.72037
1.72039
1.72101
1.72099
1.72162
1.72163
1.72227
1.72228
1.72295
1.72292
1.72357
1.72368
1.72456
1.72422
1.72446
1.72371
1.72299
1.72231
1.72166
1.72104
1.72042
1.72045
1.72106
1.72168
1.72171
1.72109
1.72049
1.72052
1.72112
1.72174
1.72236
1.72234
1.72232
1.72296
1.72362
1.7243
1.72434
1.72366
1.72299
1.723
1.72366
1.72432
1.72499
1.72501
1.72498
1.72521
1.72482
1.72582
1.72498
1.72433
1.72367
1.72302
1.72239
1.72177
1.72116
1.72056
1.7206
1.72119
1.7218
1.72183
1.72123
1.72064
1.72068
1.72127
1.72186
1.72246
1.72244
1.72241
1.72304
1.72368
1.72433
1.72434
1.72369
1.72306
1.72308
1.72371
1.72435
1.72436
1.72372
1.7231
1.72249
1.72189
1.72131
1.72073
1.72077
1.72134
1.72193
1.72196
1.72138
1.72081
1.72085
1.72142
1.72199
1.72258
1.72255
1.72252
1.72312
1.72374
1.72437
1.72438
1.72376
1.72315
1.72317
1.72378
1.72439
1.72501
1.725
1.725
1.72499
1.72499
1.72499
1.72498
1.72501
1.7244
1.72379
1.72319
1.72261
1.72203
1.72146
1.72089
1.72093
1.72149
1.72206
1.72209
1.72152
1.72097
1.721
1.72155
1.72211
1.72268
1.72266
1.72263
1.72321
1.72381
1.72441
1.72442
1.72382
1.72323
1.72325
1.72384
1.72443
1.72444
1.72385
1.72327
1.7227
1.72213
1.72158
1.72103
1.72105
1.7216
1.72215
1.72217
1.72162
1.72107
1.72109
1.72163
1.72218
1.72273
1.72273
1.72271
1.72328
1.72385
1.72444
1.72444
1.72386
1.72329
1.72329
1.72386
1.72444
1.72501
1.72501
1.72502
1.72502
1.72502
1.72502
1.72502
1.725
1.72443
1.72386
1.7233
1.72274
1.72219
1.72164
1.72109
1.7211
1.72164
1.72219
1.72218
1.72164
1.72109
1.72108
1.72163
1.72217
1.72272
1.72273
1.72274
1.72329
1.72386
1.72442
1.72441
1.72385
1.72329
1.72328
1.72383
1.7244
1.72438
1.72382
1.72326
1.72271
1.72216
1.72161
1.72106
1.72104
1.72159
1.72214
1.72211
1.72156
1.72101
1.72098
1.72153
1.72208
1.72263
1.72266
1.72269
1.72324
1.7238
1.72436
1.72433
1.72377
1.72322
1.72319
1.72374
1.72431
1.72486
1.72489
1.72491
1.72493
1.72495
1.72497
1.72499
1.72483
1.72427
1.72371
1.72315
1.7226
1.72204
1.72149
1.72093
1.72089
1.72144
1.722
1.72196
1.7214
1.72083
1.72078
1.72134
1.72191
1.72247
1.72252
1.72256
1.72312
1.72368
1.72424
1.7242
1.72364
1.72308
1.72303
1.7236
1.72416
1.72412
1.72355
1.72298
1.72242
1.72185
1.72128
1.72071
1.72065
1.72122
1.72179
1.72173
1.72115
1.72058
1.7205
1.72108
1.72166
1.72224
1.7223
1.72236
1.72293
1.7235
1.72407
1.72402
1.72345
1.72288
1.72282
1.72339
1.72397
1.72453
1.72458
1.72463
1.72467
1.72472
1.72475
1.72479
1.72448
1.72392
1.72334
1.72276
1.72218
1.7216
1.72101
1.72042
1.72034
1.72094
1.72152
1.72145
1.72086
1.72026
1.72018
1.72078
1.72138
1.72197
1.72204
1.72211
1.72269
1.72328
1.72386
1.7238
1.72322
1.72263
1.72256
1.72315
1.72374
1.72368
1.72309
1.72249
1.7219
1.7213
1.7207
1.72009
1.72001
1.72062
1.72122
1.72114
1.72053
1.71992
1.71983
1.72045
1.72106
1.72167
1.72175
1.72182
1.72242
1.72302
1.72362
1.72355
1.72295
1.72235
1.72228
1.72289
1.72349
1.72408
1.72414
1.7242
1.72426
1.72432
1.72437
1.72443
1.72401
1.72342
1.72282
1.72221
1.7216
1.72098
1.72037
1.71975
1.71966
1.72028
1.72091
1.72083
1.7202
1.71957
1.71949
1.72012
1.72075
1.72137
1.72145
1.72152
1.72213
1.72275
1.72336
1.72329
1.72268
1.72206
1.72199
1.72261
1.72322
1.72315
1.72254
1.72192
1.72129
1.72067
1.72004
1.71941
1.71932
1.71996
1.72059
1.72051
1.71988
1.71924
1.71916
1.7198
1.72044
1.72107
1.72114
1.72122
1.72184
1.72246
1.72308
1.72302
1.72239
1.72177
1.7217
1.72232
1.72295
1.72356
1.72362
1.72369
1.72375
1.72382
1.72389
1.72395
1.72349
1.72288
1.72226
1.72163
1.721
1.72037
1.71973
1.71909
1.71901
1.71966
1.72029
1.72022
1.71958
1.71894
1.71887
1.71952
1.72015
1.72079
1.72086
1.72093
1.72156
1.72219
1.72281
1.72274
1.72212
1.72149
1.72142
1.72205
1.72268
1.72261
1.72198
1.72135
1.72072
1.72009
1.71945
1.71881
1.71874
1.71938
1.72002
1.71996
1.71932
1.71868
1.71862
1.71926
1.7199
1.72053
1.72059
1.72066
1.72129
1.72192
1.72254
1.72248
1.72185
1.72122
1.72116
1.72179
1.72242
1.72302
1.72309
1.72316
1.72322
1.72329
1.72335
1.72342
1.72296
1.72235
1.72173
1.7211
1.72047
1.71984
1.71921
1.71857
1.71792
1.71727
1.71662
1.71597
1.71532
1.71466
1.71401
1.71336
1.7127
1.71205
1.71141
1.71076
1.71012
1.70949
1.70886
1.70823
1.70762
1.70701
1.70642
1.70583
1.70525
1.70468
1.70413
1.70358
1.70304
1.70251
1.70199
1.70149
1.70099
1.7005
1.70001
1.69954
1.69907
1.69861
1.69815
1.6977
1.69725
1.69681
1.69636
1.69592
1.69547
1.69502
1.69457
1.69411
1.69365
1.69318
1.69271
1.69222
1.69173
1.69124
1.69073
1.69022
1.6897
1.68969
1.68916
1.68862
1.6886
1.68805
1.68802
1.68857
1.68911
1.68914
1.68968
1.6902
1.69021
1.69073
1.69123
1.69122
1.69072
1.69069
1.69017
1.68965
1.68961
1.68907
1.68852
1.68796
1.6879
1.68846
1.68901
1.68893
1.68838
1.68781
1.68771
1.68828
1.68884
1.68939
1.68948
1.68955
1.69008
1.69013
1.69065
1.69116
1.6912
1.6917
1.69172
1.69173
1.69222
1.6927
1.69317
1.69316
1.69269
1.69221
1.69219
1.69267
1.69314
1.69361
1.69363
1.69364
1.6941
1.69456
1.69501
1.69499
1.69454
1.69409
1.69407
1.69452
1.69497
1.69495
1.69449
1.69404
1.69358
1.69311
1.69263
1.69215
1.69166
1.69161
1.69111
1.6906
1.69054
1.69001
1.68993
1.69046
1.69097
1.69105
1.69156
1.69205
1.69211
1.69259
1.69307
1.69302
1.69254
1.69247
1.69198
1.69148
1.6914
1.69088
1.69036
1.68983
1.68929
1.68873
1.68817
1.68759
1.68701
1.68641
1.68581
1.6852
1.68458
1.68395
1.68332
1.68268
1.68249
1.68314
1.68378
1.68358
1.68294
1.68228
1.68205
1.68271
1.68337
1.68402
1.68423
1.68441
1.68504
1.68566
1.68627
1.6861
1.68548
1.68486
1.68466
1.68529
1.68591
1.68571
1.68508
1.68444
1.68379
1.68313
1.68247
1.6818
1.68113
1.68085
1.68017
1.67986
1.67916
1.67846
1.67812
1.67883
1.67954
1.67919
1.67848
1.67776
1.67705
1.67633
1.67561
1.67489
1.67449
1.67376
1.67333
1.67261
1.67216
1.67143
1.67096
1.67022
1.6695
1.66878
1.66806
1.66735
1.66665
1.66614
1.66544
1.66491
1.66421
1.66367
1.66297
1.66242
1.66173
1.66105
1.66049
1.65981
1.65924
1.65857
1.658
1.65868
1.65936
1.65993
1.66062
1.66117
1.66187
1.66257
1.66312
1.66383
1.66437
1.66508
1.66561
1.66632
1.66684
1.66756
1.66828
1.66777
1.66704
1.66652
1.6658
1.66527
1.66454
1.66401
1.66329
1.66274
1.66202
1.66132
1.66076
1.66006
1.6595
1.65881
1.65812
1.65743
1.65687
1.65756
1.65825
1.6577
1.657
1.65631
1.65576
1.65645
1.65715
1.65785
1.6584
1.65895
1.65966
1.66021
1.66092
1.66147
1.66219
1.66165
1.6611
1.66038
1.65983
1.65911
1.65857
1.65929
1.66002
1.66056
1.6613
1.66184
1.66238
1.66292
1.66346
1.6642
1.66473
1.66547
1.666
1.66674
1.66726
1.668
1.6685
1.669
1.66974
1.67048
1.67122
1.67169
1.67244
1.67289
1.67363
1.67406
1.6748
1.67521
1.67594
1.67553
1.67511
1.67437
1.67393
1.67318
1.67272
1.67197
1.6715
1.67074
1.66999
1.66924
1.66874
1.66949
1.67025
1.67101
1.67177
1.67225
1.67301
1.67348
1.67423
1.67468
1.67543
1.67585
1.67627
1.67666
1.67739
1.67811
1.67884
1.67846
1.67773
1.677
1.67659
1.67733
1.67807
1.67766
1.67692
1.67617
1.67574
1.67499
1.67454
1.67377
1.67331
1.67254
1.67206
1.67129
1.67052
1.66975
1.66899
1.66823
1.66748
1.66696
1.66621
1.66569
1.66494
1.6644
1.66366
1.66312
1.66258
1.66334
1.66387
1.66463
1.66516
1.66592
1.66644
1.6672
1.66772
1.66848
1.66925
1.66874
1.66797
1.66745
1.66668
1.66616
1.66539
1.66486
1.6641
1.66357
1.6628
1.66205
1.66152
1.66077
1.66023
1.65949
1.65876
1.65803
1.65731
1.6566
1.6559
1.65521
1.65453
1.65385
1.65318
1.65252
1.65186
1.65121
1.65056
1.65002
1.64937
1.64883
1.6483
1.64895
1.64948
1.65013
1.65067
1.65132
1.65198
1.65264
1.65331
1.65277
1.6521
1.65144
1.65078
1.65025
1.6496
1.64908
1.64843
1.64779
1.64728
1.64664
1.64614
1.64551
1.64503
1.64439
1.64392
1.64329
1.64266
1.64203
1.6414
1.64095
1.64032
1.6399
1.63949
1.63886
1.63847
1.63785
1.63722
1.63659
1.63596
1.63532
1.63467
1.63402
1.6337
1.63434
1.63498
1.63465
1.63403
1.6334
1.63311
1.63373
1.63434
1.63495
1.63527
1.63561
1.63623
1.63686
1.63747
1.63712
1.6365
1.63589
1.63556
1.63617
1.63678
1.63738
1.63773
1.63809
1.6387
1.63909
1.63971
1.64011
1.64052
1.64115
1.64158
1.64221
1.64284
1.64347
1.6441
1.64456
1.64519
1.64566
1.6463
1.64678
1.64743
1.64792
1.64857
1.64808
1.64759
1.64694
1.64647
1.64583
1.64537
1.64473
1.64429
1.64366
1.64303
1.6424
1.64177
1.64135
1.64073
1.64032
1.63993
1.63932
1.63895
1.63834
1.63799
1.63859
1.6392
1.63956
1.64017
1.64055
1.64094
1.64156
1.64198
1.6426
1.64323
1.64281
1.64219
1.64179
1.64117
1.64079
1.64043
1.63981
1.63947
1.63886
1.63825
1.63765
1.63705
1.63645
1.63585
1.63525
1.63465
1.63405
1.63344
1.63283
1.63257
1.63197
1.63174
1.63114
1.63054
1.62994
1.62933
1.62916
1.62856
1.62842
1.62783
1.62724
1.62714
1.62772
1.6283
1.62819
1.62762
1.62705
1.62698
1.62753
1.62808
1.62863
1.62875
1.62887
1.62901
1.62959
1.62976
1.63035
1.63094
1.63075
1.63017
1.63001
1.62944
1.6293
1.62918
1.62973
1.62986
1.63041
1.63057
1.63113
1.63132
1.63152
1.6321
1.63233
1.63292
1.63317
1.63377
1.6335
1.63326
1.63268
1.63246
1.63189
1.6317
1.63226
1.63282
1.63303
1.6336
1.63384
1.63409
1.63436
1.63495
1.63555
1.63614
1.63585
1.63526
1.63468
1.63442
1.635
1.63558
1.63533
1.63475
1.63418
1.63395
1.63339
1.63319
1.63263
1.63207
1.63152
1.63097
1.63082
1.63027
1.63015
1.62961
1.62908
1.62854
1.628
1.62746
1.62691
1.62636
1.62581
1.62524
1.62468
1.6241
1.62352
1.62293
1.62233
1.62236
1.62295
1.62353
1.62354
1.62297
1.6224
1.62242
1.62299
1.62355
1.62411
1.6241
1.6241
1.62467
1.62522
1.62577
1.62574
1.6252
1.62466
1.62465
1.62519
1.62572
1.62571
1.62518
1.62465
1.62411
1.62357
1.62301
1.62245
1.62247
1.62303
1.62358
1.62359
1.62304
1.62248
1.62412
1.62412
1.62465
1.62518
1.6257
1.6257
1.62518
1.62465
1.62621
1.62622
1.62623
1.62625
1.62628
1.62631
1.62685
1.62739
1.62792
1.62786
1.62733
1.62681
1.62677
1.62729
1.62781
1.62832
1.62838
1.62845
1.62898
1.62951
1.63004
1.62995
1.62943
1.6289
1.62884
1.62936
1.62987
1.62982
1.62931
1.62879
1.62828
1.62777
1.62726
1.62674
1.62673
1.62724
1.62775
1.62774
1.62723
1.62672
1.62824
1.62826
1.62876
1.62927
1.62978
1.62976
1.62926
1.62875
1.63027
1.63029
1.63033
1.63039
1.63047
1.63057
1.63068
1.63122
1.63136
1.63191
1.63246
1.63301
1.63357
1.63375
1.63432
1.63452
1.6351
1.63489
1.6347
1.63413
1.63396
1.63341
1.63286
1.63231
1.63176
1.63163
1.6311
1.631
1.63091
1.63144
1.63153
1.63206
1.63217
1.63272
1.63327
1.63382
1.63438
1.63453
1.63509
1.63527
1.63546
1.63567
1.63591
1.63617
1.63644
1.63674
1.63733
1.63793
1.63854
1.63823
1.63763
1.63704
1.63676
1.63735
1.63795
1.63855
1.63884
1.63914
1.63976
1.64008
1.6407
1.64105
1.64141
1.64204
1.64242
1.64305
1.64345
1.64386
1.6445
1.64493
1.64557
1.64601
1.64666
1.64712
1.64777
1.64825
1.64873
1.64923
1.64973
1.65039
1.65091
1.65158
1.65225
1.65173
1.65106
1.65055
1.64989
1.64939
1.64891
1.64957
1.65006
1.65073
1.65123
1.65191
1.65241
1.65293
1.65345
1.65399
1.65467
1.65536
1.65607
1.65554
1.65483
1.65414
1.65362
1.65431
1.65502
1.65573
1.65625
1.65678
1.6575
1.65823
1.65896
1.65844
1.6577
1.65697
1.65645
1.65719
1.65793
1.65742
1.65668
1.65595
1.65522
1.65451
1.6538
1.6531
1.6526
1.6533
1.654
1.65351
1.65281
1.65211
1.65141
1.65093
1.65025
1.64978
1.6491
1.64844
1.64798
1.64732
1.64687
1.64622
1.64579
1.64514
1.64473
1.64408
1.64368
1.64433
1.64498
1.64537
1.64603
1.64644
1.64711
1.64753
1.6482
1.64865
1.64932
1.64888
1.64845
1.64778
1.64736
1.64669
1.64629
1.64563
1.64525
1.64459
1.64394
1.6433
1.64267
1.6423
1.64167
1.64132
1.641
1.64037
1.64006
1.63945
1.63916
1.63978
1.6404
1.64069
1.64132
1.64163
1.64195
1.64259
1.64294
1.64358
1.64423
1.64489
1.64555
1.64591
1.64659
1.64697
1.64765
1.64804
1.64873
1.64914
1.64957
1.65001
1.65046
1.65116
1.65162
1.65233
1.65304
1.65375
1.65423
1.65472
1.65545
1.65618
1.65692
1.65644
1.65569
1.65496
1.65448
1.65522
1.65596
1.6555
1.65475
1.65402
1.65329
1.65257
1.65186
1.6514
1.6507
1.65026
1.64984
1.65054
1.65096
1.65168
1.65212
1.65284
1.65356
1.6543
1.65505
1.65461
1.65386
1.65312
1.6524
1.65197
1.65125
1.65084
1.65013
1.64942
1.64903
1.64833
1.64795
1.64727
1.6469
1.64622
1.64588
1.64521
1.64454
1.64388
1.64323
1.6429
1.64226
1.64195
1.64166
1.64103
1.64076
1.64013
1.63951
1.63889
1.63828
1.63768
1.63709
1.6365
1.63626
1.63685
1.63744
1.63722
1.63662
1.63604
1.63584
1.63643
1.63702
1.63761
1.63782
1.63804
1.63865
1.63926
1.63988
1.63966
1.63904
1.63842
1.63822
1.63883
1.63945
1.63927
1.63865
1.63804
1.63744
1.63684
1.63625
1.63567
1.63552
1.63494
1.63482
1.63425
1.6337
1.63315
1.6326
1.63251
1.63197
1.6319
1.63137
1.63085
1.63081
1.63133
1.63186
1.63183
1.63131
1.63079
1.63236
1.63239
1.63244
1.63297
1.63305
1.6336
1.63415
1.63407
1.63352
1.63347
1.63293
1.6329
1.63344
1.63399
1.63402
1.63458
1.63463
1.63471
1.63528
1.63539
1.63596
1.6361
1.63668
1.63655
1.63644
1.63586
1.63578
1.6352
1.63515
1.63572
1.63631
1.63636
1.63696
1.63704
1.63715
1.63728
1.63788
1.6385
1.63912
1.63898
1.63836
1.63775
1.63764
1.63825
1.63887
1.63879
1.63817
1.63756
1.6375
1.6369
1.63687
1.63628
1.63569
1.63512
1.63455
1.63747
1.63808
1.63811
1.63873
1.6387
1.63933
1.63936
1.63942
1.6395
1.63961
1.63974
1.6399
1.64008
1.64029
1.64051
1.64115
1.64139
1.64204
1.64231
1.6426
1.64325
1.64356
1.64421
1.64488
1.64555
1.64623
1.64656
1.64725
1.64759
1.64829
1.64865
1.64935
1.64973
1.65045
1.65007
1.64971
1.64899
1.64865
1.64795
1.64762
1.64692
1.64662
1.64593
1.64525
1.64457
1.64391
1.64362
1.64296
1.64269
1.64244
1.64179
1.64157
1.64092
1.64072
1.64136
1.64202
1.64222
1.64288
1.6431
1.64335
1.64402
1.64428
1.64496
1.64564
1.64538
1.64469
1.64445
1.64377
1.64355
1.64335
1.64268
1.6425
1.64184
1.64119
1.64054
1.64038
1.64103
1.64168
1.64155
1.64089
1.64025
1.64014
1.64078
1.64144
1.6421
1.64221
1.64234
1.64301
1.64317
1.64385
1.64402
1.64423
1.64491
1.64513
1.64582
1.64607
1.64633
1.64703
1.64732
1.64802
1.64833
1.64904
1.64936
1.65008
1.65043
1.65079
1.65117
1.65156
1.65229
1.6527
1.65344
1.65418
1.65377
1.65303
1.65263
1.65189
1.65152
1.65116
1.65189
1.65225
1.653
1.65338
1.65413
1.65452
1.65493
1.65536
1.6558
1.65625
1.65671
1.65719
1.65768
1.65817
1.65868
1.65919
1.65971
1.66046
1.66099
1.66175
1.66227
1.66304
1.66381
1.66434
1.66511
1.66563
1.66641
1.66693
1.66771
1.66823
1.66901
1.66952
1.67002
1.67079
1.67157
1.67235
1.67283
1.6736
1.67407
1.67484
1.6753
1.67605
1.67649
1.67724
1.67681
1.67636
1.6756
1.67514
1.67437
1.6739
1.67312
1.67264
1.67186
1.67108
1.67029
1.66979
1.67058
1.67136
1.67215
1.67293
1.67342
1.6742
1.67468
1.67545
1.67591
1.67667
1.67712
1.67756
1.67799
1.6784
1.6788
1.67918
1.67955
1.6799
1.68024
1.68056
1.68124
1.68153
1.68221
1.68288
1.68261
1.68193
1.68163
1.68094
1.68061
1.68026
1.68097
1.68131
1.682
1.68231
1.68299
1.68328
1.68354
1.6842
1.68484
1.68548
1.68523
1.68459
1.68394
1.68366
1.68432
1.68497
1.68561
1.68587
1.6861
1.68632
1.68652
1.68671
1.68687
1.68746
1.68804
1.68861
1.68846
1.68789
1.6873
1.68713
1.68772
1.6883
1.68887
1.68903
1.68916
1.68971
1.69025
1.69078
1.69065
1.69012
1.68958
1.68943
1.68998
1.69052
1.69036
1.68982
1.68926
1.68869
1.68812
1.68753
1.68693
1.68672
1.68733
1.68792
1.6877
1.6871
1.68649
1.68624
1.68686
1.68747
1.68806
1.68829
1.6885
1.68907
1.68964
1.69019
1.69
1.68944
1.68887
1.68865
1.68923
1.6898
1.69036
1.69055
1.69073
1.6909
1.69104
1.69118
1.69129
1.6918
1.6919
1.69239
1.69288
1.69295
1.69343
1.69349
1.69354
1.694
1.69446
1.69491
1.69487
1.69442
1.69396
1.6939
1.69436
1.69482
1.69528
1.69533
1.69536
1.69539
1.69542
1.69544
1.69546
1.6959
1.69635
1.69679
1.69677
1.69633
1.69589
1.69587
1.69631
1.69676
1.6972
1.69722
1.69724
1.69769
1.69814
1.69859
1.69857
1.69812
1.69767
1.69765
1.6981
1.69856
1.69854
1.69808
1.69763
1.69718
1.69673
1.69629
1.69584
1.69581
1.69626
1.69671
1.69668
1.69623
1.69578
1.69573
1.69619
1.69664
1.6971
1.69713
1.69716
1.69761
1.69806
1.69852
1.6985
1.69804
1.69758
1.69756
1.69802
1.69848
1.69846
1.69799
1.69752
1.69706
1.6966
1.69614
1.69569
1.69523
1.69477
1.6943
1.69383
1.69336
1.69328
1.69279
1.6923
1.6922
1.69169
1.69156
1.69207
1.69258
1.69269
1.69318
1.69367
1.69376
1.69423
1.6947
1.69462
1.69414
1.69405
1.69356
1.69307
1.69295
1.69245
1.69194
1.69142
1.69127
1.69179
1.69231
1.69215
1.69163
1.69109
1.69091
1.69145
1.69198
1.69251
1.69267
1.69282
1.69333
1.69345
1.69394
1.69443
1.69453
1.69501
1.69509
1.69516
1.69563
1.69609
1.69656
1.6965
1.69603
1.69556
1.69549
1.69596
1.69644
1.69692
1.69697
1.69702
1.69749
1.69796
1.69843
1.6984
1.69792
1.69745
1.6974
1.69788
1.69837
1.69833
1.69784
1.69735
1.69686
1.69637
1.69589
1.69541
1.69492
1.69482
1.69432
1.69383
1.6937
1.69319
1.69304
1.69356
1.69407
1.6942
1.69471
1.69521
1.69531
1.69581
1.6963
1.69622
1.69571
1.69561
1.6951
1.69459
1.69446
1.69393
1.69341
1.69288
1.69234
1.6918
1.69126
1.6907
1.69015
1.68958
1.689
1.68842
1.68782
1.68721
1.6866
1.68597
1.68533
1.68469
1.68403
1.68336
1.68269
1.68236
1.68167
1.68132
1.68062
1.6799
1.67953
1.68025
1.68096
1.68167
1.68202
1.68271
1.68305
1.68372
1.68439
1.68407
1.68339
1.68305
1.68236
1.682
1.68129
1.68058
1.67986
1.67913
1.67873
1.67946
1.68019
1.67978
1.67905
1.67831
1.67787
1.67862
1.67936
1.6801
1.68051
1.68091
1.68162
1.68232
1.6827
1.68338
1.68373
1.6844
1.68473
1.68504
1.68569
1.68632
1.68694
1.68666
1.68603
1.68538
1.68506
1.68572
1.68636
1.68699
1.68728
1.68756
1.68816
1.68876
1.68934
1.68909
1.6885
1.68789
1.68761
1.68822
1.68883
1.68855
1.68794
1.68731
1.68668
1.68604
1.68539
1.68473
1.68406
1.68371
1.68302
1.68264
1.68194
1.68123
1.68082
1.68154
1.68225
1.68296
1.68334
1.68402
1.68438
1.68505
1.68571
1.68537
1.6847
1.68434
1.68365
1.68327
1.68256
1.68185
1.68113
1.68041
1.67967
1.67893
1.67819
1.67743
1.67698
1.67622
1.67575
1.67498
1.6745
1.67372
1.67323
1.67244
1.67165
1.67086
1.67007
1.66928
1.6685
1.66798
1.6672
1.66668
1.66589
1.66537
1.66459
1.66407
1.66329
1.66251
1.66199
1.66123
1.66071
1.65994
1.65943
1.6602
1.66097
1.66148
1.66226
1.66277
1.66355
1.66434
1.66486
1.66565
1.66616
1.66695
1.66747
1.66826
1.66877
1.66957
1.67036
1.66985
1.66906
1.66855
1.66775
1.66724
1.66644
1.66593
1.66514
1.66463
1.66383
1.66304
1.66254
1.66175
1.66125
1.66047
1.6597
1.65893
1.65844
1.6592
1.65998
1.65949
1.65872
1.65795
1.65748
1.65824
1.65902
1.6598
1.66028
1.66076
1.66155
1.66204
1.66283
1.66333
1.66413
1.66363
1.66314
1.66234
1.66186
1.66106
1.66059
1.66139
1.66219
1.66266
1.66346
1.66394
1.66443
1.66493
1.66543
1.66623
1.66673
1.66754
1.66804
1.66885
1.66935
1.67015
1.67065
1.67115
1.67195
1.67274
1.67353
1.67402
1.6748
1.67528
1.67605
1.67652
1.67729
1.67774
1.67849
1.67805
1.67759
1.67683
1.67636
1.67558
1.67511
1.67432
1.67384
1.67304
1.67225
1.67145
1.67095
1.67175
1.67255
1.67206
1.67126
1.67045
1.66965
1.66915
1.66834
1.66784
1.66704
1.66654
1.66573
1.66524
1.66475
1.66556
1.66605
1.66686
1.66735
1.66816
1.66865
1.66946
1.66996
1.67077
1.67157
1.67109
1.67028
1.66979
1.66897
1.66849
1.66767
1.66719
1.66638
1.6659
1.66508
1.66427
1.6638
1.66299
1.66253
1.66172
1.66092
1.66013
1.65934
1.65856
1.65778
1.65701
1.65656
1.65733
1.6581
1.65766
1.65689
1.65612
1.6557
1.65646
1.65724
1.65802
1.65845
1.65889
1.65968
1.66047
1.66127
1.66083
1.66003
1.65924
1.65881
1.6596
1.6604
1.65999
1.65919
1.6584
1.65761
1.65683
1.65605
1.65528
1.65489
1.65566
1.65643
1.65605
1.65527
1.65451
1.65375
1.65339
1.65264
1.65229
1.65155
1.65081
1.65049
1.64976
1.64945
1.64873
1.64845
1.64774
1.64747
1.64676
1.64652
1.64723
1.64794
1.64818
1.6489
1.64917
1.6499
1.65018
1.65092
1.65122
1.65197
1.65166
1.65137
1.65063
1.65037
1.64963
1.64939
1.64866
1.64844
1.64772
1.647
1.6463
1.6456
1.6454
1.64471
1.64453
1.64438
1.64369
1.64356
1.64288
1.64277
1.64345
1.64413
1.64424
1.64493
1.64507
1.64522
1.64592
1.6461
1.6468
1.64752
1.64824
1.64896
1.64916
1.6499
1.65012
1.65086
1.65111
1.65186
1.65212
1.65241
1.65272
1.65304
1.6538
1.65415
1.65491
1.65568
1.65646
1.65683
1.65721
1.658
1.65879
1.65959
1.65921
1.65841
1.65762
1.65725
1.65804
1.65884
1.65965
1.66002
1.6604
1.6608
1.66121
1.66164
1.66208
1.66289
1.66334
1.66415
1.66461
1.66543
1.66625
1.66672
1.66754
1.66801
1.66883
1.66931
1.67013
1.6706
1.67142
1.6719
1.67238
1.67287
1.67335
1.67415
1.67463
1.67542
1.67589
1.67667
1.67713
1.6779
1.67835
1.6788
1.67924
1.67998
1.68072
1.68144
1.68102
1.68029
1.67955
1.67911
1.67986
1.6806
1.68017
1.67942
1.67866
1.67821
1.67744
1.67698
1.6762
1.67573
1.67494
1.67446
1.67367
1.67319
1.67399
1.67479
1.67526
1.67605
1.67652
1.6773
1.67776
1.67853
1.67897
1.67973
1.6793
1.67886
1.67808
1.67763
1.67684
1.67639
1.67559
1.67513
1.67432
1.67352
1.67271
1.67223
1.67305
1.67386
1.67467
1.67549
1.67594
1.67674
1.67718
1.67798
1.67842
1.6792
1.67963
1.68006
1.68049
1.68091
1.68134
1.68175
1.68216
1.68288
1.68358
1.68396
1.68465
1.68502
1.68569
1.68603
1.68636
1.687
1.68764
1.68827
1.68797
1.68733
1.68668
1.68635
1.68701
1.68766
1.68734
1.68668
1.68601
1.68533
1.68497
1.68428
1.6839
1.68319
1.68247
1.68207
1.68279
1.68351
1.68423
1.6846
1.6853
1.68566
1.68634
1.68701
1.68668
1.68599
1.68564
1.68493
1.68457
1.68384
1.68312
1.68239
1.68166
1.68124
1.68198
1.68272
1.68233
1.68157
1.68082
1.6804
1.68116
1.68193
1.68269
1.68307
1.68346
1.68419
1.68492
1.68528
1.68599
1.68634
1.68703
1.68736
1.68768
1.68799
1.6883
1.6886
1.68889
1.68916
1.68943
1.68968
1.68992
1.69049
1.69105
1.69161
1.6914
1.69083
1.69026
1.69002
1.6906
1.69118
1.69175
1.69196
1.69216
1.6927
1.69324
1.69378
1.69362
1.69307
1.69252
1.69232
1.69289
1.69345
1.69327
1.69269
1.69212
1.69153
1.69095
1.69036
1.68976
1.6895
1.69011
1.69071
1.69046
1.68984
1.68922
1.68894
1.68957
1.6902
1.69083
1.69107
1.69131
1.6919
1.69249
1.69308
1.69289
1.69228
1.69168
1.69145
1.69207
1.69269
1.6933
1.69349
1.69367
1.69384
1.69401
1.69417
1.69432
1.69485
1.69498
1.6955
1.69603
1.69613
1.69664
1.69672
1.69679
1.69729
1.69779
1.69829
1.69824
1.69773
1.69722
1.69715
1.69767
1.69819
1.69814
1.6976
1.69708
1.69655
1.69646
1.69592
1.69539
1.69526
1.69472
1.69457
1.69513
1.69569
1.69581
1.69636
1.6969
1.69699
1.69753
1.69808
1.69801
1.69746
1.69737
1.69681
1.69625
1.69614
1.69556
1.69499
1.69442
1.69426
1.69484
1.69543
1.69529
1.69469
1.69409
1.69392
1.69453
1.69515
1.69577
1.69589
1.69602
1.69661
1.69671
1.69729
1.69786
1.69794
1.69851
1.69857
1.69862
1.69867
1.69872
1.69876
1.6988
1.69883
1.69886
1.69889
1.69891
1.69893
1.69895
1.69897
1.69899
1.699
1.69902
1.69903
1.69905
1.69952
1.69999
1.70048
1.70046
1.69998
1.6995
1.69949
1.69996
1.70044
1.70093
1.70095
1.70097
1.70146
1.70197
1.70249
1.70247
1.70195
1.70145
1.70143
1.70194
1.70246
1.70245
1.70193
1.70142
1.70092
1.70043
1.69995
1.69947
1.69946
1.69994
1.70042
1.70041
1.69992
1.69944
1.69943
1.69991
1.7004
1.7009
1.70091
1.70091
1.70142
1.70193
1.70245
1.70245
1.70192
1.70141
1.70141
1.70193
1.70245
1.70298
1.70298
1.70298
1.70298
1.70299
1.703
1.70302
1.70355
1.7041
1.70466
1.70464
1.70408
1.70354
1.70353
1.70407
1.70463
1.7052
1.70521
1.70523
1.7058
1.70639
1.70699
1.70697
1.70637
1.70579
1.70577
1.70636
1.70695
1.70695
1.70635
1.70577
1.70519
1.70462
1.70407
1.70352
1.70352
1.70406
1.70462
1.70462
1.70407
1.70352
1.70352
1.70407
1.70463
1.7052
1.70519
1.70519
1.70577
1.70635
1.70694
1.70695
1.70635
1.70577
1.70578
1.70636
1.70696
1.70697
1.70638
1.70579
1.70521
1.70465
1.70408
1.70353
1.70299
1.70245
1.70193
1.70141
1.7009
1.7004
1.6999
1.69942
1.6994
1.69989
1.70039
1.70038
1.69988
1.69938
1.69936
1.69986
1.70037
1.70089
1.70089
1.7009
1.70141
1.70193
1.70246
1.70247
1.70194
1.70141
1.70141
1.70194
1.70248
1.70249
1.70195
1.70141
1.70088
1.70036
1.69985
1.69934
1.69931
1.69983
1.70035
1.70033
1.6998
1.69928
1.69925
1.69978
1.70032
1.70086
1.70087
1.70088
1.70141
1.70195
1.7025
1.70251
1.70196
1.70141
1.70141
1.70196
1.70252
1.70309
1.70307
1.70305
1.70304
1.70302
1.70301
1.703
1.70354
1.7041
1.70466
1.70468
1.70412
1.70356
1.70358
1.70414
1.7047
1.70528
1.70525
1.70523
1.70581
1.7064
1.70699
1.70701
1.70642
1.70583
1.70586
1.70645
1.70704
1.70708
1.70648
1.70589
1.70531
1.70473
1.70416
1.70359
1.70362
1.70418
1.70476
1.70479
1.70421
1.70364
1.70366
1.70424
1.70482
1.70541
1.70537
1.70534
1.70592
1.70651
1.70711
1.70715
1.70655
1.70596
1.706
1.7066
1.7072
1.7078
1.70776
1.70772
1.70768
1.70764
1.70762
1.70759
1.70757
1.70756
1.70755
1.70755
1.70755
1.70756
1.70757
1.70759
1.70821
1.70883
1.70945
1.70943
1.7088
1.70818
1.70817
1.70879
1.70941
1.71004
1.71006
1.71009
1.71073
1.71137
1.71202
1.71199
1.71134
1.7107
1.71068
1.71132
1.71196
1.71194
1.7113
1.71066
1.71003
1.7094
1.70878
1.70816
1.70816
1.70877
1.70939
1.7094
1.70877
1.70816
1.70817
1.70878
1.7094
1.71003
1.71002
1.71002
1.71066
1.71129
1.71193
1.71192
1.71129
1.71065
1.71066
1.71129
1.71192
1.71256
1.71256
1.71257
1.71259
1.71261
1.71263
1.71267
1.71332
1.71397
1.71462
1.71459
1.71393
1.71328
1.71326
1.7139
1.71455
1.7152
1.71524
1.71528
1.71593
1.71658
1.71723
1.71718
1.71653
1.71589
1.71585
1.7165
1.71714
1.7171
1.71646
1.71582
1.71517
1.71453
1.71388
1.71323
1.71322
1.71386
1.7145
1.71449
1.71385
1.7132
1.7132
1.71384
1.71448
1.71511
1.71513
1.71515
1.71579
1.71643
1.71707
1.71704
1.71641
1.71577
1.71575
1.71638
1.71702
1.717
1.71637
1.71574
1.7151
1.71447
1.71383
1.7132
1.71256
1.71193
1.71129
1.71066
1.71004
1.70941
1.70879
1.70818
1.7082
1.70881
1.70943
1.70945
1.70883
1.70822
1.70825
1.70886
1.70948
1.7101
1.71007
1.71005
1.71068
1.71131
1.71194
1.71195
1.71132
1.7107
1.71072
1.71135
1.71197
1.712
1.71137
1.71075
1.71013
1.70951
1.7089
1.70828
1.70832
1.70893
1.70955
1.70959
1.70898
1.70836
1.70841
1.70902
1.70964
1.71025
1.71021
1.71017
1.71079
1.71141
1.71203
1.71206
1.71144
1.71083
1.71087
1.71149
1.7121
1.71272
1.71268
1.71265
1.71262
1.7126
1.71258
1.71257
1.7132
1.71383
1.71447
1.71447
1.71384
1.71321
1.71322
1.71385
1.71448
1.7151
1.7151
1.7151
1.71573
1.71635
1.71698
1.71697
1.71635
1.71572
1.71572
1.71634
1.71696
1.71695
1.71634
1.71573
1.71511
1.71449
1.71387
1.71324
1.71327
1.71389
1.71451
1.71453
1.71391
1.7133
1.71333
1.71394
1.71455
1.71516
1.71514
1.71512
1.71574
1.71635
1.71695
1.71696
1.71635
1.71575
1.71577
1.71637
1.71696
1.71697
1.71638
1.71579
1.71519
1.71459
1.71398
1.71337
1.71276
1.71215
1.71153
1.71092
1.7103
1.70969
1.70907
1.70846
1.70785
1.70724
1.70664
1.70604
1.70545
1.70485
1.70427
1.70369
1.70311
1.70254
1.70197
1.70141
1.70085
1.7003
1.69975
1.69921
1.69917
1.69972
1.70028
1.70026
1.69969
1.69913
1.69908
1.69965
1.70023
1.70081
1.70083
1.70084
1.70141
1.70198
1.70255
1.70256
1.70198
1.7014
1.7014
1.70198
1.70257
1.70259
1.70199
1.70139
1.70079
1.7002
1.69961
1.69903
1.69845
1.69838
1.69779
1.69719
1.6971
1.6965
1.69638
1.697
1.69762
1.6977
1.69831
1.69892
1.69898
1.69957
1.70017
1.70014
1.69953
1.69949
1.69886
1.69824
1.69817
1.69753
1.6969
1.69627
1.69563
1.695
1.69437
1.69374
1.69311
1.69248
1.69184
1.69121
1.69057
1.68993
1.68929
1.68864
1.68834
1.689
1.68966
1.68938
1.68871
1.68804
1.68772
1.68841
1.6891
1.68978
1.69005
1.69031
1.69097
1.69162
1.69226
1.69205
1.69138
1.69072
1.69047
1.69115
1.69183
1.6916
1.69091
1.69021
1.68951
1.68881
1.68811
1.68741
1.6867
1.68637
1.68565
1.6853
1.68456
1.68382
1.68344
1.6842
1.68495
1.6857
1.68603
1.68677
1.68709
1.68781
1.68852
1.68823
1.6875
1.6872
1.68645
1.68613
1.68536
1.6846
1.68383
1.68307
1.6823
1.68153
1.68075
1.67998
1.67956
1.67877
1.67834
1.67754
1.67711
1.6763
1.67586
1.67504
1.67422
1.6734
1.67258
1.67176
1.67094
1.67048
1.66965
1.66919
1.66836
1.6679
1.66707
1.66662
1.66579
1.66497
1.66452
1.6637
1.66327
1.66245
1.66202
1.66284
1.66366
1.66409
1.66491
1.66535
1.66618
1.66701
1.66745
1.66828
1.66873
1.66956
1.67001
1.67084
1.6713
1.67212
1.67295
1.6725
1.67167
1.67123
1.67039
1.66995
1.66911
1.66868
1.66784
1.66741
1.66658
1.66574
1.66532
1.66449
1.66408
1.66325
1.66243
1.66161
1.66121
1.66203
1.66285
1.66247
1.66165
1.66083
1.66046
1.66128
1.66211
1.66294
1.6633
1.66368
1.66452
1.66491
1.66575
1.66616
1.667
1.6666
1.66621
1.66536
1.66499
1.66414
1.66378
1.66463
1.66548
1.66584
1.66669
1.66706
1.66745
1.66784
1.66826
1.6691
1.66952
1.67037
1.67079
1.67163
1.67206
1.6729
1.67333
1.67377
1.6746
1.67543
1.67625
1.67668
1.67749
1.67791
1.67872
1.67914
1.67993
1.68034
1.68113
1.68073
1.68034
1.67953
1.67913
1.67831
1.67791
1.67708
1.67667
1.67584
1.675
1.67417
1.67374
1.67458
1.67543
1.67627
1.67712
1.67751
1.67835
1.67874
1.67957
1.67995
1.68077
1.68114
1.68152
1.68191
1.68269
1.68347
1.68425
1.68391
1.68311
1.68232
1.68195
1.68276
1.68357
1.68323
1.68241
1.68159
1.68123
1.6804
1.68003
1.67919
1.67882
1.67797
1.6776
1.67674
1.67588
1.67503
1.67418
1.67333
1.67248
1.67206
1.67121
1.67081
1.66995
1.66955
1.66869
1.6683
1.66792
1.66879
1.66916
1.67003
1.67041
1.67127
1.67166
1.67252
1.67292
1.67378
1.67464
1.67426
1.67339
1.67301
1.67214
1.67177
1.6709
1.67053
1.66966
1.6693
1.66843
1.66756
1.66721
1.66634
1.66601
1.66514
1.66429
1.66344
1.6626
1.66176
1.66093
1.66011
1.6593
1.65849
1.65769
1.6569
1.65612
1.65534
1.65457
1.65424
1.65347
1.65317
1.65288
1.65364
1.65393
1.6547
1.65501
1.65579
1.65657
1.65736
1.65816
1.65785
1.65705
1.65626
1.65548
1.65519
1.65441
1.65414
1.65337
1.65261
1.65236
1.65161
1.65139
1.65064
1.65044
1.6497
1.64952
1.64879
1.64806
1.64734
1.64663
1.64647
1.64577
1.64563
1.64553
1.64483
1.64474
1.64405
1.64337
1.64269
1.64202
1.64136
1.6407
1.64006
1.64
1.64065
1.6413
1.64127
1.64061
1.63997
1.64193
1.64196
1.64263
1.64331
1.644
1.64396
1.64328
1.6426
1.64466
1.64469
1.64539
1.64544
1.64615
1.64623
1.64634
1.64705
1.64719
1.6479
1.64863
1.64936
1.6501
1.65026
1.65101
1.65118
1.65194
1.65214
1.6529
1.65313
1.65389
1.65367
1.65347
1.6527
1.65252
1.65176
1.6516
1.65085
1.65072
1.64997
1.64923
1.6485
1.64777
1.64766
1.64694
1.64686
1.64681
1.64609
1.64606
1.64536
1.64678
1.64749
1.64753
1.64758
1.64831
1.64839
1.64912
1.64986
1.64978
1.64904
1.64898
1.64825
1.64822
1.64895
1.64969
1.64972
1.65047
1.65052
1.65061
1.65136
1.65147
1.65223
1.65236
1.65313
1.65329
1.65406
1.65424
1.65444
1.65467
1.65492
1.6557
1.65597
1.65676
1.65756
1.65729
1.65649
1.65624
1.65545
1.65523
1.65502
1.65581
1.65602
1.65681
1.65704
1.65785
1.6581
1.65837
1.65866
1.65897
1.65978
1.6606
1.66143
1.66112
1.66029
1.65947
1.65918
1.66
1.66083
1.66167
1.66196
1.66227
1.66311
1.66396
1.66482
1.66452
1.66366
1.6628
1.66252
1.66337
1.66423
1.66397
1.66311
1.66225
1.6614
1.66056
1.65973
1.65891
1.65866
1.65948
1.66031
1.66009
1.65926
1.65843
1.65762
1.65742
1.65661
1.65643
1.65563
1.65484
1.65468
1.6539
1.65377
1.65299
1.65288
1.65212
1.65203
1.65128
1.65122
1.65198
1.65274
1.6528
1.65357
1.65366
1.65444
1.65455
1.65534
1.65547
1.65627
1.65613
1.65602
1.65522
1.65514
1.65435
1.6543
1.65352
1.65348
1.65271
1.65195
1.65119
1.65044
1.65426
1.65505
1.65508
1.65588
1.65594
1.65674
1.65683
1.65694
1.65707
1.65723
1.65805
1.65823
1.65905
1.65988
1.66073
1.66093
1.66115
1.662
1.66286
1.66373
1.66351
1.66264
1.66178
1.66158
1.66244
1.66331
1.66313
1.66226
1.6614
1.66054
1.6597
1.65887
1.65871
1.65789
1.65775
1.65764
1.65846
1.65858
1.65941
1.65954
1.66039
1.66124
1.6621
1.66298
1.66285
1.66197
1.66111
1.66025
1.66014
1.6593
1.65921
1.65838
1.65756
1.6575
1.65668
1.65665
1.65585
1.65747
1.65829
1.65832
1.65916
1.65912
1.65997
1.66
1.66006
1.66091
1.661
1.66186
1.66274
1.66266
1.66178
1.66172
1.66086
1.66082
1.66169
1.66257
1.6626
1.66349
1.66355
1.66363
1.66373
1.66386
1.66402
1.66419
1.66439
1.66461
1.66485
1.66511
1.66539
1.66569
1.66656
1.66688
1.66775
1.66808
1.66896
1.66985
1.67018
1.67107
1.67142
1.6723
1.67265
1.67354
1.67389
1.67477
1.67513
1.6755
1.67637
1.67724
1.67812
1.67847
1.67933
1.67968
1.68054
1.68088
1.68173
1.68206
1.6829
1.68257
1.68226
1.6814
1.68107
1.6802
1.67988
1.67899
1.67867
1.67778
1.67689
1.67601
1.67566
1.67655
1.67745
1.67835
1.67926
1.67956
1.68046
1.68076
1.68165
1.68195
1.68283
1.68312
1.68343
1.68374
1.68405
1.68437
1.6847
1.68503
1.68581
1.68659
1.68689
1.68765
1.68794
1.68869
1.68897
1.68924
1.68995
1.69067
1.69138
1.69115
1.69042
1.6897
1.68944
1.69018
1.69093
1.69167
1.69188
1.69209
1.6923
1.69251
1.69271
1.69291
1.69356
1.6942
1.69485
1.6947
1.69404
1.69337
1.69318
1.69386
1.69454
1.69522
1.69536
1.6955
1.69615
1.69679
1.69744
1.69735
1.69669
1.69602
1.6959
1.69658
1.69726
1.69716
1.69647
1.69577
1.69508
1.69438
1.69369
1.69299
1.6928
1.69351
1.69423
1.69407
1.69334
1.69261
1.69242
1.69316
1.69391
1.69465
1.6948
1.69494
1.69565
1.69636
1.69707
1.69698
1.69625
1.69552
1.6954
1.69614
1.69689
1.69763
1.6977
1.69778
1.69786
1.69794
1.69801
1.69809
1.69874
1.6988
1.69944
1.70008
1.70011
1.70074
1.70076
1.70078
1.70138
1.70199
1.7026
1.70261
1.70199
1.70137
1.70136
1.70199
1.70262
1.70325
1.70323
1.70321
1.70319
1.70317
1.70315
1.70313
1.70371
1.7043
1.70489
1.70493
1.70433
1.70374
1.70377
1.70437
1.70497
1.70558
1.70553
1.70549
1.70609
1.70669
1.7073
1.70735
1.70674
1.70613
1.70618
1.70679
1.70741
1.70747
1.70685
1.70624
1.70562
1.70501
1.7044
1.70379
1.70382
1.70444
1.70505
1.7051
1.70447
1.70385
1.70388
1.70451
1.70514
1.70577
1.70572
1.70567
1.70629
1.70691
1.70753
1.70759
1.70697
1.70635
1.7064
1.70703
1.70766
1.70773
1.7071
1.70646
1.70583
1.70519
1.70455
1.70391
1.70327
1.70263
1.70199
1.70135
1.70071
1.70069
1.70004
1.69939
1.69934
1.69868
1.69861
1.69929
1.69997
1.70001
1.70067
1.70133
1.70134
1.702
1.70265
1.70266
1.702
1.702
1.70132
1.70065
1.70063
1.69994
1.69924
1.69855
1.69849
1.6992
1.6999
1.69987
1.69915
1.69843
1.69837
1.6991
1.69984
1.70057
1.70059
1.70061
1.70131
1.70132
1.702
1.70269
1.70267
1.70334
1.70332
1.7033
1.70394
1.70459
1.70524
1.70529
1.70463
1.70398
1.70401
1.70468
1.70534
1.706
1.70594
1.70588
1.70652
1.70716
1.7078
1.70787
1.70723
1.70659
1.70665
1.7073
1.70795
1.70802
1.70737
1.70672
1.70606
1.70539
1.70472
1.70405
1.70337
1.70339
1.7027
1.70201
1.70201
1.7013
1.70129
1.70202
1.70274
1.70272
1.70342
1.70412
1.70408
1.70476
1.70544
1.7055
1.70481
1.70486
1.70416
1.70345
1.70348
1.70276
1.70203
1.70129
1.70055
1.69981
1.69906
1.69831
1.69755
1.69679
1.69604
1.69528
1.69452
1.69375
1.69299
1.69223
1.69147
1.6907
1.68994
1.68918
1.68842
1.68815
1.68737
1.68708
1.68629
1.68549
1.68518
1.68599
1.6868
1.68761
1.68788
1.68867
1.68892
1.6897
1.69048
1.69026
1.68947
1.68924
1.68842
1.68818
1.68735
1.68653
1.6857
1.68487
1.68457
1.68541
1.68625
1.68599
1.68513
1.68428
1.68399
1.68486
1.68573
1.68661
1.68685
1.6871
1.68794
1.68879
1.68901
1.68984
1.69005
1.69086
1.69106
1.69126
1.69204
1.69282
1.6936
1.69345
1.69265
1.69186
1.69168
1.69249
1.6933
1.69411
1.69424
1.69438
1.69516
1.69593
1.69671
1.69662
1.69583
1.69504
1.69492
1.69573
1.69654
1.69646
1.69564
1.69481
1.69399
1.69316
1.69233
1.6915
1.69067
1.69048
1.68963
1.68943
1.68857
1.68771
1.68748
1.68836
1.68924
1.69012
1.6903
1.69116
1.69133
1.69217
1.69302
1.69289
1.69202
1.69188
1.691
1.69085
1.68995
1.68906
1.68816
1.68727
1.68638
1.68549
1.6846
1.68371
1.68344
1.68255
1.68227
1.68137
1.68109
1.68017
1.67989
1.67897
1.67805
1.67714
1.67623
1.67533
1.67443
1.6741
1.6732
1.67287
1.67197
1.67165
1.67075
1.67044
1.66954
1.66864
1.66834
1.66744
1.66715
1.66627
1.66599
1.66688
1.66778
1.66805
1.66895
1.66924
1.67014
1.67106
1.67135
1.67227
1.67256
1.67348
1.67378
1.6747
1.675
1.67592
1.67684
1.67655
1.67562
1.67533
1.6744
1.67412
1.67319
1.67292
1.67199
1.67172
1.67079
1.66987
1.66961
1.66869
1.66845
1.66753
1.66663
1.66573
1.6655
1.66639
1.6673
1.66709
1.66618
1.66528
1.66509
1.66599
1.66691
1.66783
1.66802
1.66822
1.66915
1.66937
1.67031
1.67054
1.67148
1.67125
1.67104
1.67009
1.6699
1.66895
1.66877
1.66972
1.67068
1.67085
1.67182
1.672
1.67221
1.67243
1.67267
1.67361
1.67386
1.67481
1.67507
1.67601
1.67627
1.67722
1.67748
1.67776
1.67869
1.67963
1.68057
1.68082
1.68176
1.68201
1.68293
1.68318
1.6841
1.68434
1.68524
1.68501
1.68479
1.68386
1.68363
1.68269
1.68246
1.68151
1.68128
1.68033
1.67937
1.67842
1.67817
1.67913
1.6801
1.68107
1.68204
1.68225
1.68322
1.68342
1.68438
1.68458
1.68553
1.68573
1.68593
1.68615
1.68706
1.68797
1.68888
1.68871
1.68778
1.68686
1.68666
1.6876
1.68854
1.68839
1.68743
1.68648
1.68631
1.68534
1.68516
1.68419
1.68401
1.68302
1.68284
1.68185
1.68086
1.67988
1.6789
1.67793
1.67697
1.67674
1.67577
1.67554
1.67457
1.67435
1.67338
1.67317
1.67298
1.67396
1.67415
1.67513
1.67533
1.67631
1.67652
1.6775
1.67771
1.67869
1.67968
1.67949
1.67849
1.6783
1.6773
1.67712
1.67612
1.67595
1.67495
1.67478
1.67379
1.6728
1.67264
1.67165
1.67151
1.67053
1.66957
1.66861
1.66767
1.66674
1.66582
1.66491
1.66476
1.66567
1.66659
1.66647
1.66554
1.66463
1.66453
1.66544
1.66637
1.6673
1.6674
1.66753
1.66847
1.66943
1.6704
1.67029
1.66931
1.66835
1.66825
1.66922
1.67019
1.67012
1.66914
1.66818
1.66723
1.66629
1.66536
1.66445
1.66439
1.66531
1.66624
1.66621
1.66528
1.66436
1.66346
1.66715
1.66718
1.66813
1.6691
1.67007
1.67005
1.66907
1.6681
1.67104
1.67107
1.67111
1.67118
1.67127
1.67138
1.67237
1.6725
1.67349
1.67363
1.67464
1.67565
1.67579
1.67681
1.67696
1.67797
1.67813
1.67915
1.67931
1.68032
1.68049
1.68067
1.68167
1.68267
1.68368
1.68384
1.68484
1.685
1.68599
1.68614
1.68712
1.68727
1.68824
1.68811
1.68798
1.68698
1.68685
1.68584
1.68571
1.68469
1.68456
1.68353
1.68252
1.6815
1.68134
1.68237
1.6834
1.68443
1.68547
1.68559
1.68661
1.68673
1.68775
1.68786
1.68887
1.68897
1.68909
1.68921
1.68934
1.68948
1.68963
1.68979
1.6907
1.69161
1.69174
1.69264
1.69276
1.69363
1.69375
1.69386
1.69471
1.69555
1.69638
1.69631
1.69546
1.69461
1.69451
1.69538
1.69625
1.69618
1.6953
1.69442
1.69353
1.69343
1.69252
1.69241
1.69148
1.69056
1.69043
1.69137
1.6923
1.69324
1.69333
1.69425
1.69433
1.69523
1.69613
1.69607
1.69516
1.6951
1.69417
1.6941
1.69316
1.69221
1.69125
1.6903
1.69018
1.69115
1.69212
1.69203
1.69105
1.69007
1.68997
1.69096
1.69195
1.69294
1.69301
1.69308
1.69404
1.69499
1.69504
1.69598
1.69602
1.69694
1.69698
1.69702
1.69706
1.69711
1.69716
1.69722
1.69728
1.69734
1.69741
1.69748
1.69825
1.69901
1.69978
1.69975
1.69897
1.69819
1.69814
1.69894
1.69973
1.70051
1.70052
1.70054
1.70129
1.70204
1.70278
1.7028
1.70205
1.70129
1.70129
1.70206
1.70283
1.70285
1.70208
1.70129
1.7005
1.69971
1.6989
1.69809
1.69805
1.69887
1.69969
1.69967
1.69884
1.698
1.69797
1.69882
1.69966
1.70049
1.7005
1.7005
1.7013
1.7021
1.70288
1.70291
1.70212
1.70131
1.70132
1.70214
1.70294
1.70374
1.7037
1.70366
1.70362
1.70358
1.70355
1.70351
1.70424
1.7042
1.70491
1.70561
1.70555
1.70624
1.70618
1.70612
1.70678
1.70745
1.7081
1.70818
1.70752
1.70685
1.70692
1.7076
1.70826
1.70892
1.70883
1.70875
1.70867
1.70859
1.70851
1.70843
1.70836
1.70828
1.70821
1.70815
1.70808
1.70802
1.70796
1.7079
1.70852
1.70913
1.70974
1.7098
1.70919
1.70857
1.70863
1.70925
1.70986
1.71048
1.71042
1.71036
1.71097
1.71158
1.7122
1.71225
1.71164
1.71103
1.71109
1.7117
1.71231
1.71237
1.71176
1.71115
1.71054
1.70993
1.70931
1.7087
1.70877
1.70938
1.71
1.71007
1.70945
1.70884
1.70891
1.70953
1.71015
1.71076
1.71069
1.71061
1.71122
1.71183
1.71243
1.7125
1.7119
1.71129
1.71137
1.71197
1.71257
1.71317
1.7131
1.71303
1.71297
1.71291
1.71286
1.71281
1.71341
1.71402
1.71462
1.71466
1.71406
1.71346
1.71351
1.71411
1.7147
1.71529
1.71525
1.71522
1.71581
1.7164
1.71699
1.71701
1.71643
1.71584
1.71588
1.71645
1.71703
1.71705
1.71648
1.71591
1.71533
1.71475
1.71416
1.71357
1.71363
1.71422
1.7148
1.71485
1.71427
1.71369
1.71375
1.71434
1.71491
1.71548
1.71543
1.71538
1.71595
1.71652
1.71708
1.71711
1.71656
1.716
1.71604
1.7166
1.71714
1.71718
1.71664
1.71609
1.71553
1.71497
1.7144
1.71382
1.71324
1.71265
1.71205
1.71145
1.71084
1.71023
1.70961
1.70898
1.70906
1.70969
1.71031
1.71039
1.70977
1.70914
1.70922
1.70985
1.71047
1.71109
1.711
1.71092
1.71153
1.71213
1.71273
1.71281
1.71221
1.71161
1.7117
1.7123
1.71289
1.71297
1.71238
1.71178
1.71118
1.71056
1.70994
1.70931
1.70939
1.71002
1.71065
1.71074
1.71011
1.70948
1.70957
1.7102
1.71083
1.71145
1.71136
1.71127
1.71187
1.71247
1.71306
1.71315
1.71256
1.71196
1.71205
1.71265
1.71323
1.71381
1.71372
1.71364
1.71355
1.71347
1.71339
1.71331
1.71389
1.71447
1.71503
1.7151
1.71454
1.71397
1.71404
1.71461
1.71517
1.71571
1.71565
1.71559
1.71614
1.71668
1.71722
1.71726
1.71673
1.7162
1.71625
1.71678
1.7173
1.71735
1.71683
1.71631
1.71578
1.71524
1.71468
1.71412
1.7142
1.71476
1.71531
1.71538
1.71484
1.71428
1.71437
1.71492
1.71545
1.71598
1.71591
1.71584
1.71637
1.71689
1.7174
1.71744
1.71694
1.71643
1.7165
1.717
1.71749
1.71754
1.71706
1.71656
1.71605
1.71553
1.715
1.71445
1.71389
1.71332
1.71274
1.71215
1.71154
1.71092
1.71029
1.70965
1.709
1.70834
1.70767
1.70699
1.70631
1.70637
1.70567
1.70496
1.70501
1.70428
1.70433
1.70506
1.70579
1.70573
1.70644
1.70714
1.70707
1.70775
1.70843
1.70851
1.70783
1.70791
1.70722
1.70651
1.70658
1.70586
1.70512
1.70437
1.70442
1.70518
1.70592
1.70598
1.70523
1.70447
1.70452
1.70529
1.70605
1.70679
1.70672
1.70665
1.70737
1.70729
1.70799
1.70868
1.7086
1.70927
1.70918
1.70909
1.70974
1.71039
1.71102
1.71111
1.71048
1.70984
1.70993
1.71057
1.71121
1.71183
1.71173
1.71164
1.71224
1.71283
1.71341
1.71351
1.71293
1.71234
1.71243
1.71302
1.7136
1.71369
1.71312
1.71253
1.71192
1.7113
1.71067
1.71002
1.70936
1.70945
1.70877
1.70808
1.70816
1.70745
1.70752
1.70824
1.70894
1.70885
1.70954
1.7102
1.71011
1.71076
1.7114
1.71149
1.71086
1.71095
1.7103
1.70963
1.70972
1.70903
1.70832
1.7076
1.70687
1.70612
1.70535
1.70457
1.70378
1.70298
1.70216
1.70133
1.7005
1.69965
1.69879
1.69793
1.6979
1.69878
1.69964
1.69964
1.69876
1.69787
1.69785
1.69875
1.69964
1.70052
1.70051
1.7005
1.70135
1.70219
1.70301
1.70305
1.70222
1.70137
1.70139
1.70224
1.70309
1.70313
1.70228
1.70141
1.70053
1.69964
1.69874
1.69783
1.69691
1.69688
1.69594
1.6959
1.69494
1.69398
1.69392
1.6949
1.69587
1.69584
1.69486
1.69388
1.69288
1.69188
1.69088
1.68987
1.68979
1.68877
1.68868
1.68764
1.68755
1.68651
1.68642
1.68537
1.68432
1.68327
1.68223
1.6812
1.68017
1.68003
1.679
1.67886
1.67783
1.6777
1.67667
1.67655
1.67552
1.6745
1.67439
1.67338
1.67327
1.67227
1.67218
1.67319
1.67421
1.67429
1.67532
1.67541
1.67645
1.67749
1.67759
1.67864
1.67874
1.67979
1.6799
1.68095
1.68107
1.68211
1.68316
1.68306
1.682
1.6819
1.68084
1.68075
1.67969
1.6796
1.67854
1.67846
1.67741
1.67636
1.67629
1.67525
1.67519
1.67415
1.67313
1.67211
1.67207
1.67308
1.67411
1.67409
1.67306
1.67204
1.67513
1.67515
1.6762
1.67623
1.67729
1.67734
1.6784
1.67835
1.67832
1.67725
1.67723
1.67617
1.6783
1.67937
1.67939
1.67942
1.67947
1.67953
1.6806
1.68067
1.68174
1.68182
1.68289
1.68297
1.68404
1.68412
1.68421
1.68527
1.68633
1.68739
1.68747
1.68852
1.68859
1.68963
1.68971
1.69073
1.6908
1.69182
1.69176
1.6917
1.69067
1.69061
1.68957
1.68951
1.68845
1.68839
1.68732
1.68625
1.68518
1.68511
1.68618
1.68726
1.68833
1.68941
1.68945
1.69052
1.69056
1.69161
1.69166
1.69269
1.69273
1.69278
1.69283
1.69383
1.69483
1.69582
1.6958
1.6948
1.69379
1.69376
1.69477
1.69578
1.69577
1.69475
1.69373
1.6937
1.69266
1.69263
1.69157
1.69154
1.69048
1.69044
1.68936
1.68828
1.6872
1.68612
1.68504
1.68396
1.6839
1.68282
1.68276
1.68168
1.68162
1.68054
1.6805
1.68047
1.68156
1.68158
1.68267
1.68271
1.6838
1.68385
1.68493
1.68498
1.68607
1.68716
1.68712
1.68603
1.68599
1.68489
1.68486
1.68377
1.68375
1.68265
1.68264
1.68154
1.68045
1.68373
1.68483
1.68484
1.68595
1.68596
1.68706
1.68709
1.68818
1.68821
1.68824
1.68933
1.69041
1.69149
1.69151
1.69258
1.6926
1.69366
1.69368
1.69472
1.69473
1.69576
1.69575
1.69574
1.6947
1.69469
1.69364
1.69363
1.69256
1.69255
1.69147
1.69039
1.6893
1.68928
1.69037
1.69145
1.69253
1.69361
1.69361
1.69467
1.69468
1.69573
1.69573
1.69676
1.69676
1.69677
1.69677
1.69677
1.69678
1.69679
1.6968
1.69682
1.69683
1.69686
1.6978
1.69781
1.69873
1.69965
1.69965
1.69873
1.69873
1.69779
1.69778
1.69777
1.69873
1.69873
1.69967
1.69966
1.70058
1.70056
1.70055
1.70143
1.70231
1.70317
1.70321
1.70234
1.70146
1.70148
1.70237
1.70325
1.70411
1.70406
1.70401
1.70397
1.70392
1.70387
1.70383
1.70463
1.70541
1.70618
1.70625
1.70547
1.70468
1.70473
1.70553
1.70632
1.70709
1.70701
1.70694
1.70768
1.70841
1.70911
1.7092
1.70849
1.70776
1.70784
1.70857
1.70929
1.70937
1.70865
1.70791
1.70716
1.70638
1.70559
1.70479
1.70484
1.70566
1.70645
1.70652
1.70572
1.7049
1.70495
1.70578
1.70658
1.70737
1.7073
1.70723
1.70799
1.70873
1.70945
1.70953
1.70881
1.70806
1.70814
1.70888
1.70961
1.71032
1.71024
1.71015
1.71007
1.70998
1.7099
1.70981
1.71048
1.71039
1.71105
1.71168
1.71159
1.71221
1.71211
1.71202
1.71262
1.71321
1.71378
1.71387
1.7133
1.71272
1.71281
1.7134
1.71397
1.71452
1.71443
1.71434
1.71425
1.71416
1.71407
1.71398
1.71454
1.71508
1.71561
1.71568
1.71516
1.71462
1.71471
1.71524
1.71576
1.71627
1.71619
1.71612
1.71663
1.71712
1.7176
1.71765
1.71718
1.71669
1.71676
1.71724
1.7177
1.71775
1.7173
1.71682
1.71634
1.71584
1.71532
1.71479
1.71488
1.71541
1.71592
1.71599
1.71549
1.71497
1.71505
1.71557
1.71607
1.71655
1.71648
1.71641
1.71689
1.71736
1.71781
1.71786
1.71742
1.71696
1.71702
1.71748
1.71791
1.71797
1.71753
1.71709
1.71662
1.71614
1.71565
1.71514
1.7146
1.71406
1.71349
1.7129
1.7123
1.7124
1.71178
1.71114
1.71123
1.71057
1.71066
1.71132
1.71196
1.71187
1.71249
1.71309
1.713
1.71358
1.71415
1.71423
1.71367
1.71376
1.71318
1.71258
1.71267
1.71205
1.71141
1.71075
1.71084
1.7115
1.71214
1.71222
1.71158
1.71092
1.711
1.71167
1.71231
1.71292
1.71284
1.71276
1.71335
1.71327
1.71385
1.7144
1.71432
1.71486
1.71478
1.71469
1.71522
1.71573
1.71622
1.71629
1.71581
1.7153
1.71538
1.71588
1.71636
1.71683
1.71676
1.71669
1.71715
1.71759
1.71802
1.71807
1.71765
1.71721
1.71727
1.7177
1.71812
1.71816
1.71776
1.71733
1.71689
1.71643
1.71596
1.71546
1.71494
1.71502
1.71449
1.71393
1.71401
1.71344
1.71352
1.71409
1.71464
1.71457
1.7151
1.71561
1.71554
1.71603
1.7165
1.71657
1.7161
1.71617
1.71568
1.71517
1.71524
1.71472
1.71417
1.7136
1.713
1.71239
1.71175
1.71108
1.7104
1.70969
1.70896
1.70821
1.70744
1.70664
1.70583
1.705
1.70416
1.70329
1.70241
1.70151
1.7006
1.70062
1.69968
1.69969
1.69874
1.69777
1.69777
1.69875
1.69971
1.70066
1.70064
1.70156
1.70154
1.70244
1.70333
1.70337
1.70248
1.70251
1.70159
1.70162
1.70068
1.69972
1.69875
1.69777
1.69777
1.69876
1.69974
1.69975
1.69877
1.69777
1.69778
1.69878
1.69977
1.70074
1.70072
1.7007
1.70164
1.70257
1.70254
1.70345
1.70341
1.70429
1.70425
1.7042
1.70506
1.70589
1.70671
1.70676
1.70595
1.70511
1.70515
1.706
1.70682
1.70762
1.70756
1.7075
1.70828
1.70903
1.70976
1.70983
1.7091
1.70834
1.7084
1.70916
1.7099
1.70996
1.70922
1.70846
1.70768
1.70687
1.70605
1.7052
1.70433
1.70437
1.70348
1.70351
1.7026
1.70167
1.70169
1.70263
1.70355
1.70444
1.70441
1.70528
1.70524
1.70609
1.70692
1.70697
1.70614
1.70618
1.70532
1.70536
1.70447
1.70357
1.70265
1.70171
1.70075
1.69978
1.69879
1.69778
1.69779
1.69676
1.69676
1.69572
1.69572
1.69467
1.69466
1.6936
1.69252
1.69144
1.69035
1.68926
1.68816
1.68815
1.68705
1.68704
1.68593
1.68814
1.68924
1.68925
1.69034
1.69143
1.69143
1.69034
1.69251
1.69252
1.69359
1.69466
1.69572
1.69572
1.69677
1.69676
1.69779
1.69779
1.6988
1.6988
1.69979
1.6998
1.69981
1.69881
1.69882
1.6978
1.6978
1.69677
1.69677
1.69572
1.69466
1.69359
1.6978
1.69882
1.69882
1.69982
1.69982
1.7008
1.70079
1.70078
1.70077
1.70173
1.70267
1.7036
1.70362
1.70269
1.70175
1.70176
1.70271
1.70364
1.70365
1.70272
1.70177
1.70178
1.70081
1.70081
1.69983
1.70178
1.70274
1.70273
1.70366
1.70367
1.70458
1.70457
1.70456
1.70455
1.70453
1.7045
1.70539
1.70625
1.70622
1.70705
1.70701
1.70783
1.70778
1.70773
1.70852
1.70928
1.71002
1.71007
1.70933
1.70857
1.70862
1.70938
1.71012
1.71017
1.70942
1.70866
1.70787
1.7079
1.70709
1.70712
1.70628
1.70541
1.70543
1.7063
1.70714
1.70796
1.70793
1.70873
1.70869
1.70946
1.71021
1.71024
1.7095
1.70952
1.70875
1.70877
1.70798
1.70716
1.70632
1.70545
1.70546
1.70633
1.70717
1.70718
1.70634
1.70547
1.708
1.70799
1.70879
1.70956
1.70954
1.71029
1.71027
1.71099
1.71096
1.71092
1.71088
1.71084
1.71079
1.71073
1.71067
1.71061
1.71054
1.71047
1.71116
1.71182
1.71246
1.71254
1.7119
1.71123
1.7113
1.71196
1.7126
1.71322
1.71315
1.71308
1.71367
1.71424
1.71479
1.71486
1.71431
1.71374
1.71381
1.71438
1.71492
1.71498
1.71444
1.71387
1.71328
1.71267
1.71203
1.71136
1.71142
1.71209
1.71273
1.71278
1.71214
1.71148
1.71153
1.7122
1.71283
1.71345
1.7134
1.71334
1.71393
1.7145
1.71504
1.71509
1.71455
1.71399
1.71404
1.7146
1.71513
1.71564
1.7156
1.71555
1.7155
1.71544
1.71538
1.71531
1.71581
1.71575
1.71623
1.71669
1.71663
1.71708
1.71702
1.71696
1.71739
1.71781
1.71821
1.71826
1.71786
1.71745
1.7175
1.71791
1.7183
1.71834
1.71796
1.71756
1.71713
1.71719
1.71675
1.71629
1.71635
1.71588
1.71594
1.71641
1.71686
1.71681
1.71724
1.71765
1.7176
1.718
1.71838
1.71842
1.71804
1.71808
1.7177
1.71729
1.71733
1.71691
1.71646
1.71599
1.71604
1.71651
1.71695
1.71699
1.71655
1.71609
1.71613
1.71659
1.71703
1.71745
1.71741
1.71737
1.71778
1.71774
1.71812
1.71849
1.71845
1.71881
1.71878
1.71874
1.71871
1.71867
1.71863
1.7186
1.71856
1.71851
1.71847
1.71843
1.71838
1.71834
1.71829
1.71825
1.7182
1.71815
1.71811
1.71806
1.71802
1.71798
1.71793
1.71789
1.71785
1.71781
1.71778
1.71774
1.71771
1.71768
1.71766
1.71763
1.71761
1.71759
1.71758
1.71757
1.71756
1.71755
1.71755
1.71755
1.71756
1.71757
1.71758
1.7176
1.71762
1.71765
1.71767
1.71771
1.71774
1.71778
1.71783
1.71787
1.71851
1.71915
1.71979
1.71973
1.7191
1.71847
1.71842
1.71905
1.71968
1.72031
1.72036
1.72042
1.72104
1.72167
1.72229
1.72223
1.72161
1.72099
1.72093
1.72155
1.72217
1.72211
1.7215
1.72088
1.72026
1.71964
1.71901
1.71838
1.71834
1.71897
1.71959
1.71955
1.71893
1.7183
1.71827
1.71889
1.71951
1.72012
1.72016
1.72021
1.72083
1.72144
1.72205
1.722
1.72139
1.72078
1.72073
1.72134
1.72194
1.72253
1.72259
1.72265
1.72271
1.72277
1.72283
1.7229
1.72247
1.72189
1.72129
1.72069
1.72008
1.71947
1.71886
1.71824
1.71822
1.71883
1.71944
1.71941
1.71881
1.7182
1.71818
1.71878
1.71938
1.71997
1.72001
1.72004
1.72064
1.72124
1.72184
1.72179
1.7212
1.7206
1.72056
1.72115
1.72174
1.72169
1.72111
1.72053
1.71994
1.71936
1.71876
1.71816
1.71815
1.71875
1.71933
1.71931
1.71873
1.71815
1.71814
1.71872
1.7193
1.71987
1.71989
1.71992
1.72049
1.72107
1.72164
1.7216
1.72103
1.72046
1.72043
1.721
1.72156
1.7221
1.72215
1.7222
1.72225
1.72231
1.72236
1.72241
1.72205
1.72151
1.72096
1.72041
1.71985
1.71928
1.71871
1.71814
1.71814
1.71871
1.71927
1.71926
1.71871
1.71815
1.71815
1.71871
1.71926
1.7198
1.71981
1.71983
1.72038
1.72093
1.72148
1.72144
1.7209
1.72036
1.72034
1.72087
1.7214
1.72137
1.72085
1.72032
1.71979
1.71925
1.71871
1.71817
1.71818
1.71872
1.71925
1.71926
1.71873
1.7182
1.71822
1.71874
1.71926
1.71977
1.71977
1.71978
1.7203
1.72082
1.72133
1.7213
1.7208
1.72029
1.72028
1.72078
1.72127
1.72176
1.72179
1.72183
1.72187
1.72192
1.72196
1.72201
1.72172
1.72125
1.72076
1.72026
1.71977
1.71927
1.71876
1.71824
1.71826
1.71877
1.71927
1.71928
1.71879
1.71829
1.71832
1.71881
1.7193
1.71977
1.71977
1.71977
1.72026
1.72074
1.72122
1.72119
1.72072
1.72025
1.72024
1.72071
1.72117
1.72115
1.7207
1.72024
1.71978
1.71931
1.71883
1.71835
1.71838
1.71886
1.71932
1.71934
1.71888
1.71841
1.71845
1.71891
1.71936
1.7198
1.71979
1.71978
1.72024
1.72069
1.72113
1.72111
1.72067
1.72024
1.72024
1.72067
1.72109
1.7215
1.72153
1.72156
1.72159
1.72162
1.72165
1.72168
1.72147
1.72107
1.72066
1.72024
1.71981
1.71938
1.71894
1.71848
1.71852
1.71896
1.7194
1.71942
1.71899
1.71856
1.71859
1.71902
1.71944
1.71985
1.71983
1.71982
1.72024
1.72065
1.72106
1.72104
1.72065
1.72024
1.72025
1.72064
1.72103
1.72101
1.72064
1.72025
1.71986
1.71946
1.71905
1.71863
1.71867
1.71908
1.71948
1.71951
1.71911
1.71871
1.71875
1.71914
1.71953
1.7199
1.71989
1.71987
1.72026
1.72063
1.721
1.72099
1.72063
1.72026
1.72027
1.72063
1.72098
1.72132
1.72133
1.72136
1.72138
1.7214
1.72142
1.72145
1.7213
1.72097
1.72062
1.72027
1.71992
1.71955
1.71917
1.71879
1.71882
1.7192
1.71957
1.7196
1.71923
1.71886
1.7189
1.71926
1.71962
1.71996
1.71995
1.71993
1.72028
1.72062
1.72096
1.72095
1.72062
1.72029
1.72029
1.72062
1.72094
1.72093
1.72062
1.7203
1.71997
1.71964
1.71929
1.71893
1.71896
1.71932
1.71966
1.71968
1.71934
1.719
1.71903
1.71937
1.7197
1.72001
1.72
1.71999
1.72031
1.72062
1.72092
1.72092
1.72062
1.72031
1.72032
1.72062
1.72091
1.72119
1.7212
1.72121
1.72123
1.72125
1.72126
1.72128
1.72118
1.7209
1.72062
1.72033
1.72003
1.71972
1.71939
1.71906
1.71909
1.71942
1.71973
1.71975
1.71944
1.71912
1.71914
1.71946
1.71977
1.72006
1.72005
1.72004
1.72033
1.72062
1.7209
1.72089
1.72062
1.72034
1.72034
1.72062
1.72089
1.72088
1.72062
1.72035
1.72007
1.71978
1.71948
1.71917
1.71883
1.71886
1.71852
1.71816
1.71819
1.71781
1.71784
1.71822
1.71857
1.71855
1.71889
1.71921
1.71919
1.7195
1.7198
1.71981
1.71952
1.71953
1.71923
1.71891
1.71893
1.71859
1.71824
1.71787
1.71748
1.71706
1.71663
1.71617
1.71568
1.71517
1.71464
1.71408
1.71349
1.71288
1.71224
1.71158
1.71161
1.71228
1.71292
1.71295
1.71231
1.71165
1.71168
1.71234
1.71298
1.71359
1.71356
1.71353
1.71412
1.71468
1.71521
1.71524
1.71471
1.71415
1.71418
1.71474
1.71527
1.71529
1.71476
1.7142
1.71361
1.713
1.71236
1.7117
1.71101
1.71102
1.7103
1.71031
1.70957
1.7088
1.71103
1.71172
1.71171
1.71238
1.71302
1.71303
1.71239
1.71364
1.71363
1.71421
1.71477
1.7153
1.71531
1.71478
1.71422
1.71581
1.7158
1.71579
1.71577
1.71575
1.71572
1.7162
1.71666
1.71709
1.71712
1.71669
1.71623
1.71625
1.71671
1.71714
1.71755
1.71753
1.71751
1.7179
1.71826
1.71861
1.71863
1.71828
1.71792
1.71793
1.7183
1.71865
1.71866
1.71831
1.71795
1.71756
1.71716
1.71673
1.71627
1.71628
1.71674
1.71717
1.71717
1.71674
1.71629
1.71758
1.71757
1.71796
1.71832
1.71866
1.71867
1.71833
1.71796
1.71899
1.71899
1.71898
1.71897
1.71896
1.71894
1.71926
1.71924
1.71954
1.71983
1.71982
1.7201
1.72009
1.72008
1.72035
1.72062
1.72088
1.72087
1.72062
1.72036
1.72036
1.72062
1.72087
1.72111
1.72112
1.72112
1.72113
1.72114
1.72115
1.72116
1.7211
1.72087
1.72062
1.72037
1.7201
1.72011
1.71984
1.71956
1.71957
1.71927
1.71928
1.71957
1.71985
1.71985
1.72011
1.72037
1.72037
1.72062
1.72087
1.72086
1.72062
1.72062
1.72038
1.72012
1.72012
1.71986
1.71958
1.71929
1.71929
1.71959
1.71986
1.71986
1.71959
1.7193
1.72013
1.72013
1.72038
1.72038
1.72063
1.72086
1.72086
1.72109
1.7211
1.7211
1.72109
1.72109
1.72087
1.72063
1.72063
1.72038
1.72087
1.72109
1.64085
1.61481
1.61825
1.62283
1.62314
1.62435
1.62347
1.62707
1.62589
1.63068
1.63315
1.64226
1.64401
1.64684
1.64856
1.64771
1.65043
1.65146
1.65276
1.6526
1.65324
1.65444
1.65488
1.65587
1.65594
1.65568
1.65603
1.65576
1.65568
1.65535
1.65507
1.65532
1.65337
1.6532
1.65295
1.65349
1.65264
1.6523
1.65209
1.65292
1.67326
1.67142
1.65813
1.65925
1.65979
1.5983
1.58431
1.58355
1.58151
1.58124
1.58013
1.57976
1.58084
1.58102
1.58154
1.58028
1.57886
1.45735
1.46991
1.47283
1.4927
1.54636
1.54807
1.55391
1.68704
1.69636
1.69568
1.69564
1.69425
1.69392
1.69294
1.72317
1.72729
1.726
1.72633
1.72623
1.72623
1.72622
1.72621
1.7262
1.7262
1.72619
1.72618
1.72618
1.72617
1.72616
1.72616
1.72615
1.72614
1.72612
1.72611
1.7261
1.72608
1.72607
1.72605
1.72603
1.72601
1.72599
1.72596
1.72593
1.72591
1.72587
1.72584
1.72581
1.72577
1.72573
1.72569
1.72565
1.72561
1.72556
1.72552
1.72547
1.72542
1.72537
1.72532
1.72526
1.72521
1.72515
1.72509
1.72503
1.72497
1.72491
1.72485
1.72479
1.72473
1.72466
1.7246
1.72453
1.72447
1.7244
1.72433
1.72427
1.7242
1.72413
1.72407
1.724
1.72393
1.72387
1.7238
1.72373
1.72367
1.7236
1.72354
1.72347
1.72341
1.72334
1.72328
1.72322
1.72315
1.72309
1.72303
1.72297
1.72291
1.72286
1.7228
1.72274
1.72269
1.72263
1.72258
1.72253
1.72248
1.72243
1.72238
1.72233
1.72229
1.72224
1.7222
1.72216
1.72211
1.72207
1.72204
1.722
1.72196
1.72193
1.72189
1.72186
1.72183
1.7218
1.72177
1.72174
1.72171
1.72169
1.72167
1.72164
1.72162
1.7216
1.72159
1.72157
1.72155
1.72154
1.72153
1.72152
1.72151
1.7215
1.7215
1.7215
)
;
boundaryField
{
bottomEmptyFaces
{
type empty;
}
topEmptyFaces
{
type empty;
}
inlet
{
type calculated;
value nonuniform List<scalar>
130
(
1.72171
1.72172
1.72172
1.72173
1.72174
1.72175
1.72176
1.72178
1.72179
1.72181
1.72183
1.72186
1.72188
1.72191
1.72193
1.72196
1.722
1.72203
1.72206
1.7221
1.72214
1.72218
1.72222
1.72226
1.7223
1.72235
1.7224
1.72245
1.7225
1.72255
1.7226
1.72265
1.72271
1.72276
1.72282
1.72288
1.72294
1.723
1.72306
1.72312
1.72318
1.72325
1.72331
1.72338
1.72344
1.72351
1.72358
1.72365
1.72371
1.72378
1.72385
1.72392
1.72399
1.72406
1.72413
1.7242
1.72427
1.72434
1.72441
1.72448
1.72455
1.72462
1.72469
1.72476
1.72483
1.72489
1.72496
1.72503
1.72509
1.72516
1.72522
1.72529
1.72535
1.72541
1.72547
1.72553
1.72559
1.72565
1.7257
1.72576
1.72581
1.72587
1.72592
1.72597
1.72602
1.72606
1.72611
1.72615
1.7262
1.72624
1.72628
1.72632
1.72636
1.72639
1.72643
1.72646
1.72649
1.72653
1.72656
1.72658
1.72661
1.72664
1.72666
1.72669
1.72671
1.72673
1.72675
1.72677
1.72679
1.72681
1.72683
1.72684
1.72686
1.72687
1.72689
1.7269
1.72691
1.72693
1.72694
1.72695
1.72695
1.72694
1.72693
1.7268
1.72676
1.72564
1.72171
1.73451
1.72454
1.7266
)
;
}
outlet
{
type calculated;
value nonuniform List<scalar>
64
(
1.57266
1.57266
1.57266
1.57265
1.57263
1.57262
1.57259
1.57257
1.57253
1.57249
1.57244
1.57238
1.57231
1.57223
1.57213
1.57202
1.5719
1.57176
1.5716
1.57143
1.57124
1.57103
1.5708
1.57055
1.57027
1.56998
1.56967
1.56933
1.56898
1.56859
1.56819
1.56776
1.56731
1.56683
1.56632
1.56578
1.56522
1.56462
1.56398
1.56331
1.56259
1.56184
1.56105
1.56039
1.55982
1.55921
1.55862
1.5577
1.55813
1.55725
1.55665
1.55604
1.55547
1.55492
1.55428
1.55359
1.55299
1.55259
1.55196
1.55204
1.55196
1.55208
1.55227
1.57266
)
;
}
walls
{
type calculated;
value nonuniform List<scalar>
1343
(
1.50616
1.50627
1.50637
1.50647
1.50657
1.50667
1.50676
1.50685
1.50694
1.50702
1.50711
1.50718
1.50726
1.50734
1.50741
1.50748
1.50755
1.50762
1.50769
1.50775
1.50781
1.50788
1.50794
1.508
1.50806
1.50811
1.50817
1.50823
1.50828
1.50834
1.50839
1.50844
1.50849
1.50854
1.50859
1.50864
1.50869
1.50873
1.50878
1.50883
1.50887
1.50892
1.50896
1.50901
1.50905
1.50909
1.50914
1.50918
1.50922
1.50927
1.50931
1.50935
1.5094
1.50944
1.50948
1.50952
1.50957
1.50961
1.50965
1.5097
1.50974
1.50978
1.50983
1.50987
1.50992
1.50997
1.51001
1.51006
1.51011
1.51016
1.51021
1.51026
1.51031
1.51036
1.51042
1.51047
1.51052
1.51058
1.51064
1.5107
1.51076
1.51082
1.51088
1.51094
1.51101
1.51107
1.51114
1.51121
1.51128
1.51135
1.51142
1.5115
1.51157
1.51165
1.51173
1.51181
1.51189
1.51198
1.51206
1.51215
1.51224
1.51233
1.51242
1.51252
1.51261
1.51271
1.51281
1.5129
1.51301
1.51311
1.51321
1.51331
1.51342
1.51353
1.51364
1.51375
1.51386
1.51397
1.51409
1.5142
1.51432
1.51444
1.51456
1.51468
1.5148
1.51492
1.51505
1.51517
1.5153
1.51542
1.51555
1.51568
1.5158
1.51593
1.51606
1.51619
1.51632
1.51645
1.51658
1.51671
1.51684
1.51697
1.5171
1.51723
1.51736
1.51748
1.51761
1.51774
1.51787
1.518
1.51813
1.51826
1.51839
1.51852
1.51865
1.51877
1.5189
1.51903
1.51916
1.51929
1.51942
1.51954
1.51967
1.5198
1.51993
1.52005
1.52018
1.52031
1.52044
1.52056
1.52069
1.52082
1.52095
1.52107
1.5212
1.52133
1.52145
1.52158
1.52171
1.52183
1.52196
1.52208
1.52221
1.52234
1.52247
1.52259
1.52272
1.52285
1.52298
1.5231
1.52323
1.52336
1.52349
1.52361
1.52375
1.52387
1.524
1.52413
1.52427
1.52439
1.52453
1.52466
1.52479
1.52493
1.52506
1.52519
1.52533
1.52547
1.52561
1.52574
1.52589
1.52603
1.52617
1.52631
1.52646
1.5266
1.52675
1.52689
1.52704
1.52719
1.52735
1.5275
1.52765
1.52781
1.52796
1.52812
1.52828
1.52844
1.52861
1.52877
1.52894
1.5291
1.52927
1.52944
1.52961
1.52978
1.52996
1.53014
1.53032
1.53049
1.53068
1.53086
1.53105
1.53123
1.53142
1.5316
1.5318
1.53199
1.53218
1.53238
1.53257
1.53277
1.53297
1.53317
1.53337
1.53357
1.53378
1.53398
1.53419
1.53439
1.5346
1.5348
1.53501
1.53522
1.53542
1.53563
1.53584
1.53603
1.53624
1.53644
1.53663
1.53682
1.53701
1.5372
1.53736
1.53753
1.53766
1.5378
1.53786
1.53792
1.53802
1.53656
1.54207
1.5455
1.54562
1.54508
1.54459
1.54435
1.54416
1.54408
1.54417
1.5444
1.54466
1.54487
1.54502
1.54512
1.54512
1.54511
1.54467
1.54394
1.54187
1.54108
1.64102
1.64134
1.64075
1.6403
1.64049
1.64683
1.64695
1.64838
1.64855
1.64877
1.64755
1.64782
1.64725
1.64736
1.64792
1.64808
1.64362
1.64386
1.64401
1.64429
1.64462
1.64475
1.64494
1.64519
1.64203
1.64226
1.64336
1.64288
1.64312
1.64249
1.6427
1.64156
1.64182
1.6462
1.64543
1.64564
1.64567
1.64597
1.64644
1.64661
1.65453
1.65472
1.65462
1.65337
1.652
1.65224
1.65213
1.65235
1.65267
1.65249
1.6528
1.65303
1.65287
1.65328
1.65316
1.65417
1.65406
1.65379
1.65368
1.65351
1.65394
1.65387
1.65427
1.65447
1.65435
1.65618
1.65605
1.65631
1.65633
1.65628
1.65618
1.6562
1.65615
1.65678
1.65661
1.65659
1.65662
1.65668
1.65663
1.65667
1.65662
1.65667
1.65666
1.6567
1.65673
1.65665
1.65665
1.65675
1.65676
1.6566
1.65655
1.65658
1.65654
1.65655
1.65658
1.65657
1.65655
1.65663
1.65659
1.65642
1.65632
1.6555
1.65546
1.65561
1.65571
1.65563
1.65502
1.65522
1.65514
1.65505
1.65492
1.65483
1.65535
1.65528
1.65591
1.65589
1.6558
1.65597
1.65592
1.65402
1.65379
1.65389
1.65289
1.65182
1.652
1.65215
1.65228
1.65235
1.65254
1.65254
1.65269
1.65334
1.65332
1.65301
1.65317
1.6535
1.65364
1.65522
1.65531
1.65559
1.65543
1.65547
1.6554
1.65537
1.65614
1.65618
1.6565
1.65654
1.65658
1.65645
1.6564
1.65625
1.65632
1.65623
1.6562
1.65569
1.65578
1.65587
1.65586
1.65607
1.65591
1.65594
1.65493
1.65453
1.65455
1.65463
1.65472
1.65419
1.65427
1.65428
1.65438
1.65508
1.65516
1.65013
1.6503
1.6499
1.64945
1.64966
1.65075
1.65095
1.65154
1.65131
1.65138
1.65099
1.65113
1.65061
1.6508
1.64891
1.64897
1.64922
1.64937
1.65654
1.65647
1.6565
1.59431
1.59592
1.59685
1.59487
1.59568
1.59841
1.59943
1.60009
1.60077
1.60141
1.60162
1.60234
1.59731
1.59785
1.64348
1.64416
1.64379
1.64515
1.64555
1.64536
1.64442
1.64493
1.64473
1.64615
1.64638
1.64629
1.53619
1.53354
1.53504
1.53297
1.64683
1.64648
1.52995
1.64658
1.64677
1.64667
1.53178
1.64572
1.64603
1.64585
1.52192
1.51092
1.51218
1.51267
1.51483
1.5188
1.5129
1.51298
1.52758
1.52868
1.52879
1.52398
1.52603
1.64725
1.64758
1.64741
1.64736
1.64732
1.64753
1.64747
1.64788
1.64827
1.50341
1.64807
1.648
1.64794
1.6482
1.64815
1.49536
1.50002
1.64773
1.64768
1.64761
1.64783
1.6478
1.64707
1.64702
1.64694
1.64721
1.64712
1.49153
1.48464
1.48869
1.49338
1.49293
1.49347
1.47178
1.47137
1.47181
1.46182
1.47029
1.46745
1.46358
1.46566
1.48309
1.47628
1.48064
1.50884
1.50501
1.50691
1.57613
1.57744
1.57461
1.57389
1.57418
1.64008
1.54769
1.54695
1.64305
1.54701
1.65585
1.55564
1.56058
1.55928
1.5597
1.55747
1.55844
1.55036
1.55224
1.55335
1.55457
1.57066
1.56841
1.56964
1.56456
1.56111
1.56143
1.56284
1.56371
1.56622
1.56741
1.57181
1.57254
1.57346
1.57387
1.63017
1.62858
1.63176
1.63364
1.63286
1.63834
1.64147
1.6411
1.58501
1.6402
1.63971
1.63913
1.64111
1.64074
1.63479
1.63355
1.63355
1.63741
1.63637
1.62938
1.62806
1.62552
1.62538
1.62578
1.62413
1.62442
1.62386
1.63415
1.63655
1.59006
1.59083
1.5917
1.58673
1.58775
1.58543
1.58603
1.58869
1.58927
1.58018
1.58149
1.58214
1.58292
1.58344
1.58402
1.58448
1.57841
1.57924
1.59239
1.59288
1.59342
1.59382
1.54468
1.53918
1.54119
1.54216
1.54355
1.54593
1.54658
1.6616
1.66248
1.6666
1.68195
1.68824
1.68587
1.69126
1.68908
1.70377
1.70001
1.70499
1.70534
1.70532
1.70519
1.70457
1.70488
1.70423
1.70351
1.70387
1.70315
1.7024
1.70278
1.70194
1.7015
1.70071
1.7011
1.70033
1.69995
1.64212
1.6431
1.64266
1.69922
1.69959
1.69884
1.69839
1.69802
1.69736
1.69769
1.69703
1.69669
1.69633
1.69574
1.69605
1.69545
1.69516
1.69487
1.69434
1.69458
1.4368
1.43531
1.42534
1.42852
1.4332
1.41727
1.40906
1.41984
1.41968
1.41974
1.39492
1.39842
1.3949
1.39844
1.38935
1.38246
1.38229
1.38413
1.38829
1.3922
1.39576
1.40254
1.40953
1.41515
1.42052
1.42546
1.42972
1.43353
1.43694
1.43955
1.44195
1.4437
1.44847
1.45632
1.44384
1.44245
1.44372
1.69407
1.69382
1.69353
1.44409
1.44613
1.44823
1.45042
1.45067
1.45112
1.45212
1.4534
1.45481
1.45631
1.45786
1.45946
1.46105
1.46263
1.46417
1.46566
1.4671
1.46851
1.46985
1.47116
1.47242
1.47365
1.47485
1.476
1.69327
1.69282
1.69305
1.47713
1.69259
1.47823
1.69238
1.47929
1.48033
1.48134
1.48231
1.48325
1.48416
1.69213
1.69192
1.69169
1.69131
1.6915
1.69111
1.6909
1.69072
1.69052
1.69031
1.68997
1.69013
1.48504
1.48588
1.68979
1.48668
1.68962
1.48745
1.4882
1.4889
1.48958
1.49023
1.49085
1.49144
1.49201
1.49256
1.49308
1.49359
1.49407
1.49454
1.49499
1.49542
1.49584
1.49625
1.49664
1.49702
1.49738
1.49774
1.49808
1.49842
1.49874
1.49906
1.49937
1.49966
1.49995
1.50023
1.50051
1.50077
1.50103
1.50128
1.50152
1.50176
1.50199
1.50222
1.50243
1.50264
1.50285
1.50305
1.50324
1.50343
1.50362
1.50379
1.50397
1.50414
1.5043
1.50446
1.50461
1.50476
1.50491
1.50505
1.50519
1.50532
1.50545
1.50558
1.5057
1.50582
1.50594
1.50605
1.64877
1.64947
1.64905
1.64895
1.64886
1.64925
1.64915
1.64936
1.64956
1.64963
1.65005
1.64993
1.64982
1.64972
1.65018
1.6505
1.65031
1.65064
1.65092
1.65076
1.65109
1.65138
1.65122
1.65152
1.65181
1.65166
1.64851
1.64844
1.64835
1.64867
1.64858
1.68945
1.68929
1.68913
1.68882
1.68896
1.68867
1.68854
1.68842
1.6883
1.68821
1.68812
1.68805
1.68793
1.68799
1.68787
1.68776
1.68782
1.6877
1.68763
1.68756
1.68748
1.6874
1.68732
1.68724
1.68706
1.68715
1.68697
1.68687
1.68677
1.68667
1.68657
1.68648
1.6864
1.6863
1.68621
1.68611
1.686
1.68588
1.68576
1.68564
1.68552
1.6854
1.68528
1.68515
1.68504
1.68495
1.68486
1.6848
1.68472
1.68465
1.68456
1.68447
1.68438
1.68429
1.68421
1.68412
1.68403
1.68396
1.68388
1.6838
1.68373
1.68367
1.6836
1.68354
1.68348
1.68342
1.68336
1.68331
1.68326
1.68321
1.68315
1.6831
1.68306
1.68301
1.68296
1.68291
1.68287
1.68282
1.68277
1.68273
1.68268
1.68263
1.68258
1.68253
1.68248
1.68244
1.68239
1.68234
1.68229
1.68225
1.6822
1.68216
1.68212
1.68209
1.68205
1.68202
1.68199
1.68196
1.68194
1.68192
1.6819
1.68188
1.68186
1.68185
1.68183
1.68182
1.68181
1.6818
1.68179
1.68177
1.68176
1.68175
1.68173
1.68172
1.6817
1.68169
1.68168
1.68167
1.68167
1.68168
1.68169
1.6817
1.68171
1.68173
1.68175
1.68176
1.68177
1.68177
1.68175
1.68169
1.68158
1.68141
1.68113
1.68071
1.68008
1.67917
1.67794
1.67458
1.67635
1.62229
1.62262
1.62455
1.62493
1.6253
1.62581
1.6242
1.62357
1.62393
1.62299
1.62332
1.62847
1.62894
1.62818
1.62758
1.62779
1.6299
1.62998
1.63153
1.63109
1.63139
1.63045
1.6308
1.62912
1.62959
1.62607
1.62654
1.62675
1.62727
1.60994
1.61041
1.61075
1.61114
1.61653
1.61698
1.6174
1.61783
1.61843
1.61859
1.61892
1.61273
1.61342
1.61491
1.61538
1.61389
1.61448
1.61191
1.61136
1.6116
1.61571
1.61608
1.60613
1.60677
1.60404
1.60445
1.6035
1.60282
1.60321
1.60473
1.60538
1.60835
1.60896
1.60955
1.60727
1.60776
1.62048
1.62103
1.62006
1.61932
1.61959
1.62152
1.6219
1.63639
1.63668
1.63199
1.63243
1.6327
1.63301
1.63329
1.63363
1.63395
1.63419
1.63524
1.63561
1.63485
1.63424
1.63459
1.63589
1.63616
1.63821
1.63858
1.63894
1.63908
1.63794
1.63748
1.63771
1.63711
1.63725
1.63929
1.6395
1.63977
1.64014
1.55285
1.67347
1.72749
1.72487
1.72414
1.72332
1.72256
1.72187
1.72122
1.72058
1.71995
1.71935
1.7188
1.71829
1.7178
1.71729
1.71674
1.71617
1.71561
1.7151
1.71464
1.71424
1.71385
1.71346
1.71307
1.71266
1.71225
1.71182
1.7114
1.71097
1.71055
1.71013
1.70972
1.70931
1.7089
1.70849
1.70808
1.70767
1.70727
1.70687
1.70647
1.70607
1.70566
1.70526
1.70485
1.70445
1.70405
1.70365
1.70327
1.70289
1.70253
1.70217
1.70181
1.70146
1.70112
1.70079
1.70046
1.70014
1.69984
1.69956
1.69929
1.69905
1.69882
1.69863
1.69846
1.69832
1.69823
1.6982
1.69821
1.69821
1.69826
1.69834
1.69848
1.69866
1.69886
1.69908
1.69933
1.6996
1.69989
1.70021
1.70054
1.70087
1.70122
1.7015
1.70183
1.70204
1.70105
1.69673
1.69339
1.69187
1.69121
1.69109
1.69122
1.69133
1.69138
1.69141
1.69142
1.69141
1.6914
1.6914
1.69139
1.69137
1.69133
1.69125
1.69113
1.69095
1.69069
1.69033
1.68991
1.68942
1.68887
1.68828
1.68769
1.68711
1.68655
1.68604
1.68557
1.68516
1.6848
1.68444
1.6841
1.68375
1.68342
1.68311
1.68282
1.68255
1.68229
1.68202
1.68174
1.68145
1.68116
1.68089
1.68066
1.68046
1.68031
1.68025
1.68027
1.68031
1.68013
1.67917
1.67727
1.75621
1.67726
1.6777
1.67807
1.67835
1.67851
1.6788
1.67925
1.67946
1.67956
1.67982
1.68016
1.68022
1.68016
1.68
1.67971
1.6795
1.67932
1.6792
1.67908
1.67898
1.67888
1.6788
1.67873
1.67868
1.67863
1.67859
1.6785
1.67841
1.67811
1.67347
1.67448
1.67532
1.67594
1.67663
1.67727
1.67745
1.67768
)
;
}
symmetryLine
{
type symmetryPlane;
}
}
// ************************************************************************* //
| [
"mhoeper3234@gmail.com"
] | mhoeper3234@gmail.com | |
d0f1afba132510798b998e248e72c5715549407e | 193a66bee070ed11b6c795a9d40502d4c502667b | /codeforces/1598B.cpp | 1416d47c63d4ac023d16f334efb719d114580b7d | [] | no_license | 1tygoime/a | d3603b0f9dc043f3249b2574af060ed487193ac2 | a5ca1c8193959e8619adebf3430d35b652f5d399 | refs/heads/main | 2023-08-11T09:53:13.925780 | 2021-10-11T16:28:49 | 2021-10-11T16:28:49 | 416,415,399 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,592 | cpp | #include<bits/stdc++.h>
using namespace std;
const int N = 1005;
bool a[N][N];
void orz_HuuDuc(){
int n;
cin >> n;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= 5; j++){
cin >> a[i][j];
}
bool f = false;
// for(int i = 1; i <= n; i++)
// for(int j = 1; j <= 5; j++)
// cout << a[i][j] << " \n"[j == 5];
for(int day1 = 1; day1 <= 5; day1++)
for(int day2 = day1 + 1; day2 <= 5; day2++){
vector<int> d1, d2, inter;
for(int i = 1; i <= n; i++){
if(a[i][day1] == true && a[i][day2] == true)
inter.push_back(i);
else if(a[i][day1] == true)
d1.push_back(i);
else if(a[i][day2] == true)
d2.push_back(i);
}
if(d1.size() == 0 && d2.size() == 0 && inter.size() == 0)
continue;
//if(inter % 2) continue;
int ok1 = d1.size(), ok2 = d2.size(), ok3 = inter.size();
// cout << ok1 << " " << ok2 << endl;
//assign that ok1 < ok2
if(ok1 > ok2)
swap(ok1, ok2);
if(ok3 < ok2 - ok1)
continue;
ok3 -= ok2 - ok1;
ok1 = ok2;
if(ok3 % 2) continue;
ok1 += ok3 / 2;
ok2 += ok3 / 2;
// cout << "Day 1 = " << day1 << endl << "Day 2= " << day2 << endl << "ok1 " << ok1 << endl <<"ok2" << ok2 << endl;
if(ok1 == ok2 && ok1 == n / 2){
f = true;
// cout << "YES\n";
// return;
}
}
cout << (f ? "YES\n" : "NO\n");
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int t;
cin >> t;
while(t--)
orz_HuuDuc();
return 0;
}
| [
"73065691+letuano5@users.noreply.github.com"
] | 73065691+letuano5@users.noreply.github.com |
e140358845a2aea0189c9452d4136143afdf871a | 57429e4655dce2f0028eab189ea750fa3a74ba91 | /src/main.cpp | 97c68c1e24b70e47c313ca11f2d428435ecbb1f9 | [] | no_license | Decommissioned/Scener | 64d7afb14995e5e3d113757d6d78a1e6e5b50afe | 4351dfeadd3b53e25d4467e5dc67e54fbe0ccefc | refs/heads/master | 2021-01-10T18:00:45.774141 | 2015-06-11T05:43:06 | 2015-06-11T05:43:06 | 36,996,880 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,613 | cpp | #include "configuration.h"
#include "input.h"
#include "loader.h"
#include "renderer.h"
#include <SDL2/SDL.h>
#include <GL/glew.h>
#include <glm/glm.hpp>
#include <glm/gtc/constants.hpp>
#include <iostream>
#include <cassert>
#include <thread>
#define ncase break; case /* no fall-through case */
void HandleError(const string& msg, ErrorCriticality criticality)
{
std::cerr << msg << std::endl;
if (criticality != ErrorCriticality::LOW)
{
throw std::runtime_error(msg);
}
}
//////////////////////////////////////////////////////////////////////////
static bool quit = false;
static MouseServer mouse;
static KeyboardServer keyboard;
void handleControls(Camera& camera)
{
static MouseClient mc = mouse.CreateClient();
static KeyboardClient kc = keyboard.CreateClient();
static float rotation = 0.0f;
static float pitch = 0.0f;
static float velocity = 0.0f;
static bool air = false;
const float speed = 0.1f;
const float sensitivity = 0.005f;
const float dt = 1.0f / 60.0f;
const float gravity = 20.81f;
const float jump = 5.0f;
float cx = glm::sin(rotation);
float cz = glm::cos(rotation);
float cy = glm::tan(pitch);
// Movement handling
if (kc.Pressed('w'))
{
camera.eye.z += speed * cz;
camera.eye.x += speed * cx;
}
if (kc.Pressed('s'))
{
camera.eye.z -= speed * cz;
camera.eye.x -= speed * cx;
}
if (kc.Pressed('a'))
{
camera.eye.x += speed * cz;
camera.eye.z -= speed * cx;
}
if (kc.Pressed('d'))
{
camera.eye.x -= speed * cz;
camera.eye.z += speed * cx;
}
// Quit on escape
if (kc.Pressed(SDLK_ESCAPE))
{
quit = true;
}
if (kc[SDLK_SPACE] == InputState::DOWN && !air)
{
velocity = jump;
}
if (camera.eye.y > 0.0f)
{
velocity -= gravity * dt;
}
camera.eye.y += velocity * dt;
air = camera.eye.y > 0.0f;
if (camera.eye.y < 0.0f)
{
camera.eye.y = 0.0f;
}
rotation -= mc.Dx() * sensitivity;
pitch -= mc.Dy() * sensitivity;
if (pitch > glm::half_pi<float>() - 0.05f) pitch = glm::half_pi<float>() - 0.05f;
if (pitch < -glm::half_pi<float>() + 0.05f) pitch = -glm::half_pi<float>() + 0.05f;
camera.lookAt = camera.eye + vec3(cx, cy, cz);
}
void worker_render(SDL_Window* window, Scene& scene)
{
auto context = SDL_GL_CreateContext(window);
assert(context != nullptr);
glewExperimental = OPENGL_EXTENSIONS;
assert(glewInit() == GLEW_OK);
Renderer renderer("../meshes", "../textures", "../programs");
// Trap mouse cursor only after loading the assets
SDL_ShowCursor(0);
SDL_SetRelativeMouseMode(SDL_TRUE);
while (!quit)
{
auto now = std::chrono::system_clock::now();
keyboard.Update();
handleControls(scene.camera);
mouse.Update();
renderer.Draw(scene);
SDL_GL_SwapWindow(window);
auto delta = std::chrono::system_clock::now() - now;
auto duration = std::chrono::duration_cast<std::chrono::microseconds>(delta);
std::this_thread::sleep_for(std::chrono::microseconds(16667) - duration);
}
SDL_GL_DeleteContext(context);
}
void initialize_SDL()
{
assert(SDL_InitSubSystem(SDL_INIT_VIDEO) == 0);
SDL_GL_SetAttribute(SDL_GL_CONTEXT_MAJOR_VERSION, OPENGL_MAJOR_VERSION);
SDL_GL_SetAttribute(SDL_GL_CONTEXT_MINOR_VERSION, OPENGL_MINOR_VERSION);
SDL_GL_SetAttribute(SDL_GL_RED_SIZE, 8);
SDL_GL_SetAttribute(SDL_GL_GREEN_SIZE, 8);
SDL_GL_SetAttribute(SDL_GL_BLUE_SIZE, 8);
SDL_GL_SetAttribute(SDL_GL_DEPTH_SIZE, 16);
SDL_GL_SetAttribute(SDL_GL_DOUBLEBUFFER, 1);
// Enable vsync
}
int main(int argc, char**argv)
{
if (argc < 2)
{
std::cout << "No scene file provided to the renderer" << std::endl;
return 0;
}
initialize_SDL();
Scene scene = LoadScene(argv[1]);
SDL_Event event;
SDL_Window* window = SDL_CreateWindow(scene.window.title.c_str(), 50, 50, scene.window.width, scene.window.height, SDL_WINDOW_OPENGL);
assert(window != nullptr);
std::thread worker(worker_render, window, scene);
while (SDL_WaitEvent(&event) && !quit)
{
switch (event.type)
{
ncase SDL_QUIT : quit = true;
ncase SDL_MOUSEMOTION : mouse.Move(event.motion.xrel, event.motion.yrel);
ncase SDL_MOUSEBUTTONDOWN : mouse.PressButton(event.button.button);
ncase SDL_MOUSEBUTTONUP : mouse.ReleaseButton(event.button.button);
ncase SDL_MOUSEWHEEL : mouse.Wheel(event.wheel.y);
ncase SDL_KEYDOWN : if (!event.key.repeat) keyboard.PressButton(event.key.keysym.sym);
ncase SDL_KEYUP : keyboard.ReleaseButton(event.key.keysym.sym);
}
}
worker.join();
SDL_DestroyWindow(window);
SDL_QuitSubSystem(SDL_INIT_VIDEO);
return 0;
} | [
"christian.k.gomes@live.com"
] | christian.k.gomes@live.com |
2ecc5ef6e5fe95ce0508c65af889a9e43fe2ac32 | ed834f2ae7bb94b105252a02221b39ba6b8253dd | /firmware/uart.cpp | d70d301bf31fa7c34fc0634783f9b82864435dd5 | [] | no_license | koson/wideband | 4e92417fe7fbcc6c7523909690c390255aa0e622 | 136524cb2e2e359567b0f52f662e801884d6f3a1 | refs/heads/master | 2023-02-05T21:20:05.922605 | 2020-12-22T11:08:28 | 2020-12-22T11:08:28 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,112 | cpp | #include "ch.h"
#include "hal.h"
#include "chprintf.h"
#include "lambda_conversion.h"
#include "sampling.h"
#include "uart.h"
static const UARTConfig uartCfg =
{
.txend1_cb = nullptr,
.txend2_cb = nullptr,
.rxend_cb = nullptr,
.rxchar_cb = nullptr,
.rxerr_cb = nullptr,
.timeout_cb = nullptr,
.timeout = 0,
.speed = 115200,
.cr1 = 0,
.cr2 = 0,
.cr3 = 0,
};
static char printBuffer[200];
static THD_WORKING_AREA(waUartThread, 256);
static void UartThread(void*)
{
while(true)
{
float lambda = GetLambda();
int lambdaIntPart = lambda;
int lambdaThousandths = (lambda - lambdaIntPart) * 1000;
size_t writeCount = chsnprintf(printBuffer, 200, "%d.%03d\t%d\t%d\r\n", lambdaIntPart, lambdaThousandths, (int)GetSensorInternalResistance(), (int)(GetPumpNominalCurrent() * 1000));
uartStartSend(&UARTD1, writeCount, printBuffer);
chThdSleepMilliseconds(20);
}
}
void InitUart()
{
uartStart(&UARTD1, &uartCfg);
chThdCreateStatic(waUartThread, sizeof(waUartThread), NORMALPRIO, UartThread, nullptr);
}
| [
"makenne@microsoft.com"
] | makenne@microsoft.com |
d87f4f77efa340c3b01183435caead8de5c48cc6 | 776a3a17511602988bfe718c220e9b212dc07439 | /HDU/6265/15801093_AC_296ms_9420kB.cpp | ad1eda07082b4b9954ab0d694165942f774544ec | [] | no_license | DcmTruman/my_acm_training | bc1675d1de0c689bde9f62d8e15b3d885ca6b984 | c54643ca395ad4be3dc4b640504a0fdc62f70b1c | refs/heads/master | 2020-05-16T06:19:17.356731 | 2019-04-22T18:01:46 | 2019-04-22T18:01:46 | 182,840,197 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 975 | cpp | #include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int MAXN=1<<20;
long long a[24],p[24],inv[24];
long long num[MAXN+10];
const long long mod=998244353;
long long qPow(long long x,long long s){
long long ans=1;
while(s){
if(s&1) ans=ans*x%mod;
x=x*x%mod;
s>>=1;
}
return ans;
}
int lowbit(int x){
return x&(-x);
}
long long getInv(long long x){
if(x==1) return 1;
return (mod-mod/x)*getInv(mod%x)%mod;
}
int main()
{
int T,m,total;
long long n,ans;
scanf("%d",&T);
while(T--){
scanf("%d",&m);
n=1;
for(int i=0;i<m;i++){
scanf("%lld %lld",&a[i],&p[i]);
n=(n*qPow(a[i],p[i]))%mod;
inv[i]=getInv(a[i]);
}
num[0]=n; ans=n;
total=(1<<m);
for(int x=1;x<total;x++){
for(int j=0;j<m;j++){
if((x>>j)&1){
num[x]=num[x-lowbit(x)]*p[j]%mod;
num[x]=num[x]*(a[j]-1)%mod;
num[x]=num[x]*inv[j]%mod;
ans=(ans+num[x])%mod;
break;
}
}
}
printf("%lld\n",ans);
}
return 0;
}
| [
"695897983@qq.com"
] | 695897983@qq.com |
5e22dd134e834dfa99b345be3603e3571f1a8f0b | 8669f8887f00b4b31c052803352ab00108fe1499 | /1463.cpp | 1e8aa3e7c49aab5a92a3851616be9ac84bd287e3 | [] | no_license | abc7468/Algorithms | 230aec670aba38dc3f5cf27e036acea1abaffe6d | 1091f6f5b2050a1d41489c25bdd97d96148dbba4 | refs/heads/master | 2021-07-07T00:14:16.593646 | 2020-10-16T15:50:44 | 2020-10-16T15:50:44 | 196,413,018 | 0 | 0 | null | 2020-10-16T15:50:46 | 2019-07-11T14:43:03 | C++ | UTF-8 | C++ | false | false | 332 | cpp | #include<iostream>
using namespace std;
int temp[1000000];
int main() {
int N;
int min;
int max;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> temp[i];
if (i == 0) {
min = temp[i];
max = temp[i];
}
if (temp[i] > max) max = temp[i];
if (temp[i] < min) min = temp[i];
}
cout << min << " " << max << "\n";
}
| [
"abc7468@naver.com"
] | abc7468@naver.com |
a4c46891a6db0fe7fc6fa62f05e20ad91691ae4b | b5ee95b7a9b37d9d845e6b22def5ea78b8dd2ed3 | /clutseg/include/clutseg/check.h | ef236a0d434f3324f716a31740c67d14d6e19ed2 | [] | no_license | Ahmah2009/clutter-segmentation | 4f4493b644ef0b248c5929e61c229dcd82d015f0 | abc10efa8bcf5c8b4b70a8770381794a087d6242 | refs/heads/master | 2020-12-28T21:27:54.609892 | 2011-08-17T14:34:11 | 2011-08-17T14:34:11 | 24,736,101 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 437 | h | /*
* Author: Julius Adorf
*/
#ifndef _CHECK_H_
#define _CHECK_H_
#include <boost/filesystem.hpp>
#include <cv.h>
namespace clutseg {
/** \brief Assertion. Causes a runtime error in case the path does not exist. */
void assert_path_exists(const boost::filesystem::path & path);
/** \brief Assertion. Causes a runtime error in case the image is empty. */
void assert_valid_image(const cv::Mat & img);
}
#endif
| [
"jeadorf@gmail.com"
] | jeadorf@gmail.com |
f4aab2c5dad4a91789792d19a802505802b7bfe7 | 23bed760e1fde1a1e4dbca640c876f5d9dee13ea | /frac_to_parts.cpp | 130c509732de97a8246b186d0958321925c89089 | [] | no_license | sajalch/Competitive-Problem-Solutions | 12a13c4ac07f3087d8f78dd4d5401a711f1ec062 | a01dcf05019f87cf4d7e4126b85ea4ec86b13ea3 | refs/heads/master | 2022-07-11T18:35:42.571857 | 2020-05-12T05:21:30 | 2020-05-12T05:21:30 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 316 | cpp | #include<bits/stdc++.h>
using namespace std;
int main()
{
ostringstream ss;
float a,b;
cin>>a>>b;
a=a/b;
// cout<<a;
ss<<a;
string s=ss.str();
int i=0;
while(s[i]!='.')
{
i++;
}
cout<<s.substr(0,i)<<endl;
cout<<s.substr(i+1,s.length()-1);
return 0;
}
| [
"sajalchakraborty7@gmail.com"
] | sajalchakraborty7@gmail.com |
7864d40fd531e18735df30ba676dd2f8c80988f0 | 5659228a7480d0708161fe3c3fd8e9d9cce2f586 | /isaac/components/PnjHealth.hh | b9b05874b78f3bc12fa6618a5d28368366df440c | [] | no_license | cesarl/2dGameExperiments | 4fa74e42bd690dadffa2f15aa9cbdc793bfa33e7 | d8865e58ce162419bc161c654b519f276c1f99a5 | refs/heads/master | 2021-01-22T06:03:27.749423 | 2014-01-16T09:50:29 | 2014-01-16T09:50:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 317 | hh | #ifndef __PNJ_HEALTH_HH__
# define __PNJ_HEALTH_HH__
#include "Health.hh"
class PnjHealth : public Health
{
public:
PnjHealth(Entity *entity);
virtual ~PnjHealth();
virtual void impactDamage(Entity *e);
// virtual void serialize(std::ofstream *file);
};
#endif // __PNJ_HEALTH_HH__
| [
"cesar.leblic@gmail.com"
] | cesar.leblic@gmail.com |
9d0ed50fc363ea7c8aa75d602a25c8ba3239c703 | 4cbf15c4a5ab006c081ade42abdabcebc7df8708 | /Google/codejam2016/LastWord/LastWord.cpp | 27036adbb99a9deb715a3cfe71b167ab58000201 | [] | no_license | MiichaelD/c_cpp | 85e2829ad1f0d56edcf43db34305503f2528d2d4 | e26876b9c5a394cabc324b28dcad54016dc2e36f | refs/heads/master | 2022-02-08T12:30:15.339033 | 2022-01-20T00:14:38 | 2022-01-20T00:14:38 | 53,229,953 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,104 | cpp | /**
Name: 1A. A) LastWords.cpp
Problem: On the game show The Last Word, the host begins a round by showing the contestant a
string S of uppercase English letters. The contestant has a whiteboard which is initially blank.
The host will then present the contestant with the letters of S, one by one, in the order in
which they appear in S. When the host presents the first letter, the contestant writes it on the
whiteboard; this counts as the first word in the game (even though it is only one letter long).
After that, each time the host presents a letter, the contestant must write it at the beginning
or the end of the word on the whiteboard before the host moves on to the next letter (or to the
end of the game, if there are no more letters).
For example, for S = CAB, after writing the word C on the whiteboard, the contestant could make
one of the following four sets of choices:
put the A before C to form AC, then put the B before AC to form BAC
put the A before C to form AC, then put the B after AC to form ACB
put the A after C to form CA, then put the B before CA to form BCA
put the A after C to form CA, then put the B after CA to form CAB
The word is called the last word when the contestant finishes writing all of the letters from S,
under the given rules. The contestant wins the game if their last word is the last of an
alphabetically sorted list of all of the possible last words that could have been produced. For
the example above, the winning last word is CAB (which happens to be the same as the original word).
For a game with S = JAM, the winning last word is MJA.
You are the next contestant on this show, and the host has just showed you the string S. What's
the winning last word that you should produce?
Input: The first line of the input gives the number of test cases, T. T test cases follow.
Each consists of one line with a string S.
Output: For each test case, output one line containing Case #x: y, where x is the test case
number (starting from 1) and y is the winning last word, as described in the statement.
Limits: 1 ≤ T ≤ 100.
Small: 1 ≤ length of S ≤ 15.
Big: 1 ≤ length of S ≤ 1000.
Sample:
Input:
7
CAB
JAM
CODE
ABAAB
CABCBBABC
ABCABCABC
ZXCASDQWE
Output:
Case #1: CAB
Case #2: MJA
Case #3: OCDE
Case #4: BBAAA
Case #5: CCCABBBAB
Case #6: CCCBAABAB
Case #7: ZXCASDQWE
*/
#include <string>
#include <iostream>
#include <deque>
using namespace std;
int main(){
int N;
string S;
cin >> N;
for (int k = 1; k <= N ; ++k){
cin >> S;
deque<char> deque;
for(int i = 0 ; i < S.length(); ++i){
char c = S[i];
if (deque.empty()){
deque.push_back(c);
} else {
if ( c < deque.front()){
deque.push_back(c);
} else {
deque.push_front(c);
}
}
}
cout << "Case #"<< k << ": ";
for (char c : deque){
cout << c;
}
cout << endl;
}
return 0;
}
| [
"michael.duarte@hotmail.com"
] | michael.duarte@hotmail.com |
67a942f47b4e9a6ecdb84a9603e4b48c5830cc3e | 191460258090bcabe392785948025887696ccd1b | /src/xenia/cpu/test/test_extract.cc | 7b90c97f7e305f28c2cae52896928965d0c075fc | [] | no_license | DrChat/xenia | 1b81ab13298229cb568c1385774f47792a802767 | 0dc06a7e6fedaa4dd7bbe4e3c34bc288a58f6c49 | refs/heads/master | 2020-04-05T18:29:57.710202 | 2015-05-20T05:31:37 | 2015-05-20T05:31:37 | 34,922,300 | 5 | 5 | null | 2015-05-01T20:21:14 | 2015-05-01T20:21:14 | null | UTF-8 | C++ | false | false | 5,110 | cc | /**
******************************************************************************
* Xenia : Xbox 360 Emulator Research Project *
******************************************************************************
* Copyright 2014 Ben Vanik. All rights reserved. *
* Released under the BSD license - see LICENSE in the root for more details. *
******************************************************************************
*/
#include "xenia/cpu/test/util.h"
#include <cfloat>
using namespace xe;
using namespace xe::cpu;
using namespace xe::cpu::hir;
using namespace xe::cpu::test;
using xe::cpu::frontend::PPCContext;
TEST_CASE("EXTRACT_INT8", "[instr]") {
TestFunction test([](HIRBuilder& b) {
StoreGPR(b, 3, b.ZeroExtend(b.Extract(LoadVR(b, 4),
b.Truncate(LoadGPR(b, 4), INT8_TYPE),
INT8_TYPE),
INT64_TYPE));
b.Return();
});
for (int i = 0; i < 16; ++i) {
test.Run([i](PPCContext* ctx) {
ctx->r[4] = i;
ctx->v[4] = vec128b(0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13,
14, 15);
},
[i](PPCContext* ctx) {
auto result = ctx->r[3];
REQUIRE(result == i);
});
}
}
TEST_CASE("EXTRACT_INT8_CONSTANT", "[instr]") {
for (int i = 0; i < 16; ++i) {
TestFunction(
[i](HIRBuilder& b) {
StoreGPR(b, 3,
b.ZeroExtend(b.Extract(LoadVR(b, 4),
b.LoadConstant(int8_t(i)), INT8_TYPE),
INT64_TYPE));
b.Return();
}).Run([i](PPCContext* ctx) {
ctx->r[4] = i;
ctx->v[4] = vec128b(0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12,
13, 14, 15);
},
[i](PPCContext* ctx) {
auto result = ctx->r[3];
REQUIRE(result == i);
});
}
}
TEST_CASE("EXTRACT_INT16", "[instr]") {
TestFunction test([](HIRBuilder& b) {
StoreGPR(b, 3, b.ZeroExtend(b.Extract(LoadVR(b, 4),
b.Truncate(LoadGPR(b, 4), INT8_TYPE),
INT16_TYPE),
INT64_TYPE));
b.Return();
});
for (int i = 0; i < 8; ++i) {
test.Run([i](PPCContext* ctx) {
ctx->r[4] = i;
ctx->v[4] = vec128s(0x0000, 0x1001, 0x2002, 0x3003, 0x4004,
0x5005, 0x6006, 0x7007);
},
[i](PPCContext* ctx) {
auto result = ctx->r[3];
REQUIRE(result == (i | (i << 12)));
});
}
}
TEST_CASE("EXTRACT_INT16_CONSTANT", "[instr]") {
for (int i = 0; i < 8; ++i) {
TestFunction([i](HIRBuilder& b) {
StoreGPR(b, 3,
b.ZeroExtend(b.Extract(LoadVR(b, 4),
b.LoadConstant(int8_t(i)),
INT16_TYPE),
INT64_TYPE));
b.Return();
}).Run([i](PPCContext* ctx) {
ctx->r[4] = i;
ctx->v[4] = vec128s(0, 1, 2, 3, 4, 5, 6, 7);
},
[i](PPCContext* ctx) {
auto result = ctx->r[3];
REQUIRE(result == i);
});
}
}
TEST_CASE("EXTRACT_INT32", "[instr]") {
TestFunction test([](HIRBuilder& b) {
StoreGPR(b, 3, b.ZeroExtend(b.Extract(LoadVR(b, 4),
b.Truncate(LoadGPR(b, 4), INT8_TYPE),
INT32_TYPE),
INT64_TYPE));
b.Return();
});
for (int i = 0; i < 4; ++i) {
test.Run([i](PPCContext* ctx) {
ctx->r[4] = i;
ctx->v[4] = vec128i(0, 1, 2, 3);
},
[i](PPCContext* ctx) {
auto result = ctx->r[3];
REQUIRE(result == i);
});
}
}
TEST_CASE("EXTRACT_INT32_CONSTANT", "[instr]") {
for (int i = 0; i < 4; ++i) {
TestFunction([i](HIRBuilder& b) {
StoreGPR(b, 3,
b.ZeroExtend(b.Extract(LoadVR(b, 4),
b.LoadConstant(int8_t(i)),
INT32_TYPE),
INT64_TYPE));
b.Return();
}).Run([i](PPCContext* ctx) {
ctx->r[4] = i;
ctx->v[4] = vec128i(0, 1, 2, 3);
},
[i](PPCContext* ctx) {
auto result = ctx->r[3];
REQUIRE(result == i);
});
}
}
| [
"ben.vanik@gmail.com"
] | ben.vanik@gmail.com |
8c0964897ba5c2cd757c620b670548631f8c7812 | 4dbb45758447dcfa13c0be21e4749d62588aab70 | /iOS/Libraries/libil2cpp/include/debugger/id-bank.h | a5a1879669c65c53a8126486d4065446a87f6dd3 | [
"MIT"
] | permissive | mopsicus/unity-share-plugin-ios-android | 6dd6ccd2fa05c73f0bf5e480a6f2baecb7e7a710 | 3ee99aef36034a1e4d7b156172953f9b4dfa696f | refs/heads/master | 2020-12-25T14:38:03.861759 | 2016-07-19T10:06:04 | 2016-07-19T10:06:04 | 63,676,983 | 12 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,226 | h | #pragma once
#include "common.h"
struct Il2CppClass;
struct Il2CppObject;
struct Il2CppDomain;
struct Il2CppAssembly;
struct Il2CppImage;
namespace il2cpp
{
namespace debugger
{
enum IdType
{
// Note: kIdTypeObject is used only internally, it should never
// be sent to the client 'cause it is invalid.
kIdTypeObject = -1,
kIdTypeAssembly = 0,
kIdTypeModule = 1,
kIdTypeType = 2,
kIdTypeMethod = 3,
kIdTypeField = 4,
kIdTypeDomain = 5,
kIdTypeProperty = 6,
kIdTypeCount
};
struct Id
{
IdType type;
int32_t id;
};
Id AssemblyId(const Il2CppAssembly *assembly);
Id ModuleId(const Il2CppImage *image);
Id TypeId(const Il2CppClass *type);
Id DomainId(const Il2CppDomain *domain);
Id ObjectId(const Il2CppObject *object);
Id MethodId(const MethodInfo *method);
Id FieldId(const FieldInfo *field);
Id PropertyId(const PropertyInfo *prop);
Il2CppClass *TypeFromId(Id &id);
Il2CppClass *TypeFromId(int32_t id);
Il2CppObject *ObjectFromId(Id &id);
Il2CppDomain *DomainFromId(Id &id);
Il2CppAssembly *AssemblyFromId(Id &id);
MethodInfo *MethodFromId(Id &id);
FieldInfo *FieldFromId(Id &id);
PropertyInfo *PropertyFromId(Id &id);
Il2CppImage *ModuleFromId(Id &id);
} /* namespace debugger */
} /* namespace il2cpp */
| [
"lii@rstgames.com"
] | lii@rstgames.com |
9784b6fb7fb448d4ed1d6518c06f6b086c1f3184 | d1ca534c28a1e50d52584778720776d70dffaf5d | /HoG.cpp | 923146fe10b573ecc4031a71768acc3fc3b71b1a | [] | no_license | ldfaiztt/skier-recognition | 9713347c4cab4e299759a400f5955fa0b6e3058d | 2b80577ba6ead2eaea0b0305e0f7bf73bf4e1e5b | refs/heads/master | 2021-01-18T07:40:25.001374 | 2014-01-27T20:23:59 | 2014-01-27T20:23:59 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,363 | cpp | #include <mex.h>
#include <cstdlib>
#include <cmath>
#include <vector>
using namespace std;
void HoG(double *pixels, double *params, int *img_size, double *dth_des, unsigned int grayscale){
const float pi = 3.1415926536;
int nb_bins = (int) params[0];
double cwidth = params[1];
int block_size = (int) params[2];
int orient = (int) params[3];
double clip_val = params[4];
int img_width = img_size[1];
int img_height = img_size[0];
int hist1= 2+ceil(-0.5 + img_height/cwidth);
int hist2= 2+ceil(-0.5 + img_width/cwidth);
double bin_size = (1+(orient==1))*pi/nb_bins;
float dx[3], dy[3], grad_or, grad_mag, temp_mag;
float Xc, Yc, Oc, block_norm;
int x1, x2, y1, y2, bin1, bin2;
int des_indx = 0;
vector<vector<vector<double> > > h(hist1, vector<vector<double> > (hist2, vector<double> (nb_bins, 0.0) ) );
vector<vector<vector<double> > > block(block_size, vector<vector<double> > (block_size, vector<double> (nb_bins, 0.0) ) );
//Calculate gradients (zero padding)
for(unsigned int y=0; y<img_height; y++) {
for(unsigned int x=0; x<img_width; x++) {
if (grayscale == 1){
if(x==0) dx[0] = pixels[y +(x+1)*img_height];
else{
if (x==img_width-1) dx[0] = -pixels[y + (x-1)*img_height];
else dx[0] = pixels[y+(x+1)*img_height] - pixels[y + (x-1)*img_height];
}
if(y==0) dy[0] = -pixels[y+1+x*img_height];
else{
if (y==img_height-1) dy[0] = pixels[y-1+x*img_height];
else dy[0] = -pixels[y+1+x*img_height] + pixels[y-1+x*img_height];
}
}
else{
if(x==0){
dx[0] = pixels[y +(x+1)*img_height];
dx[1] = pixels[y +(x+1)*img_height + img_height*img_width];
dx[2] = pixels[y +(x+1)*img_height + 2*img_height*img_width];
}
else{
if (x==img_width-1){
dx[0] = -pixels[y + (x-1)*img_height];
dx[1] = -pixels[y + (x-1)*img_height + img_height*img_width];
dx[2] = -pixels[y + (x-1)*img_height + 2*img_height*img_width];
}
else{
dx[0] = pixels[y+(x+1)*img_height] - pixels[y + (x-1)*img_height];
dx[1] = pixels[y+(x+1)*img_height + img_height*img_width] - pixels[y + (x-1)*img_height + img_height*img_width];
dx[2] = pixels[y+(x+1)*img_height + 2*img_height*img_width] - pixels[y + (x-1)*img_height + 2*img_height*img_width];
}
}
if(y==0){
dy[0] = -pixels[y+1+x*img_height];
dy[1] = -pixels[y+1+x*img_height + img_height*img_width];
dy[2] = -pixels[y+1+x*img_height + 2*img_height*img_width];
}
else{
if (y==img_height-1){
dy[0] = pixels[y-1+x*img_height];
dy[1] = pixels[y-1+x*img_height + img_height*img_width];
dy[2] = pixels[y-1+x*img_height + 2*img_height*img_width];
}
else{
dy[0] = -pixels[y+1+x*img_height] + pixels[y-1+x*img_height];
dy[1] = -pixels[y+1+x*img_height + img_height*img_width] + pixels[y-1+x*img_height + img_height*img_width];
dy[2] = -pixels[y+1+x*img_height + 2*img_height*img_width] + pixels[y-1+x*img_height + 2*img_height*img_width];
}
}
}
grad_mag = sqrt(dx[0]*dx[0] + dy[0]*dy[0]);
grad_or= atan2(dy[0], dx[0]);
if (grayscale == 0){
temp_mag = grad_mag;
for (unsigned int cli=1;cli<3;++cli){
temp_mag= sqrt(dx[cli]*dx[cli] + dy[cli]*dy[cli]);
if (temp_mag>grad_mag){
grad_mag=temp_mag;
grad_or= atan2(dy[cli], dx[cli]);
}
}
}
if (grad_or<0) grad_or+=pi + (orient==1) * pi;
// trilinear interpolation
bin1 = (int)floor(0.5 + grad_or/bin_size) - 1;
bin2 = bin1 + 1;
x1 = (int)floor(0.5+ x/cwidth);
x2 = x1+1;
y1 = (int)floor(0.5+ y/cwidth);
y2 = y1 + 1;
Xc = (x1+1-1.5)*cwidth + 0.5;
Yc = (y1+1-1.5)*cwidth + 0.5;
Oc = (bin1+1+1-1.5)*bin_size;
if (bin2==nb_bins){
bin2=0;
}
if (bin1<0){
bin1=nb_bins-1;
}
h[y1][x1][bin1]= h[y1][x1][bin1]+grad_mag*(1-((x+1-Xc)/cwidth))*(1-((y+1-Yc)/cwidth))*(1-((grad_or-Oc)/bin_size));
h[y1][x1][bin2]= h[y1][x1][bin2]+grad_mag*(1-((x+1-Xc)/cwidth))*(1-((y+1-Yc)/cwidth))*(((grad_or-Oc)/bin_size));
h[y2][x1][bin1]= h[y2][x1][bin1]+grad_mag*(1-((x+1-Xc)/cwidth))*(((y+1-Yc)/cwidth))*(1-((grad_or-Oc)/bin_size));
h[y2][x1][bin2]= h[y2][x1][bin2]+grad_mag*(1-((x+1-Xc)/cwidth))*(((y+1-Yc)/cwidth))*(((grad_or-Oc)/bin_size));
h[y1][x2][bin1]= h[y1][x2][bin1]+grad_mag*(((x+1-Xc)/cwidth))*(1-((y+1-Yc)/cwidth))*(1-((grad_or-Oc)/bin_size));
h[y1][x2][bin2]= h[y1][x2][bin2]+grad_mag*(((x+1-Xc)/cwidth))*(1-((y+1-Yc)/cwidth))*(((grad_or-Oc)/bin_size));
h[y2][x2][bin1]= h[y2][x2][bin1]+grad_mag*(((x+1-Xc)/cwidth))*(((y+1-Yc)/cwidth))*(1-((grad_or-Oc)/bin_size));
h[y2][x2][bin2]= h[y2][x2][bin2]+grad_mag*(((x+1-Xc)/cwidth))*(((y+1-Yc)/cwidth))*(((grad_or-Oc)/bin_size));
}
}
//Block normalization
for(unsigned int x=1; x<hist2-block_size; x++){
for (unsigned int y=1; y<hist1-block_size; y++){
block_norm=0;
for (unsigned int i=0; i<block_size; i++){
for(unsigned int j=0; j<block_size; j++){
for(unsigned int k=0; k<nb_bins; k++){
block_norm+=h[y+i][x+j][k]*h[y+i][x+j][k];
}
}
}
block_norm=sqrt(block_norm);
for (unsigned int i=0; i<block_size; i++){
for(unsigned int j=0; j<block_size; j++){
for(unsigned int k=0; k<nb_bins; k++){
if (block_norm>0){
block[i][j][k]=h[y+i][x+j][k]/block_norm;
if (block[i][j][k]>clip_val) block[i][j][k]=clip_val;
}
}
}
}
block_norm=0;
for (unsigned int i=0; i<block_size; i++){
for(unsigned int j=0; j<block_size; j++){
for(unsigned int k=0; k<nb_bins; k++){
block_norm+=block[i][j][k]*block[i][j][k];
}
}
}
block_norm=sqrt(block_norm);
for (unsigned int i=0; i<block_size; i++){
for(unsigned int j=0; j<block_size; j++){
for(unsigned int k=0; k<nb_bins; k++){
if (block_norm>0) dth_des[des_indx]=block[i][j][k]/block_norm;
else dth_des[des_indx]=0.0;
des_indx++;
}
}
}
}
}
}
void mexFunction(int nlhs, mxArray *plhs[], int nrhs, const mxArray *prhs[]) {
double *pixels, *dth_des, *params;
int nb_bins, block_size;
int img_size[2];
unsigned int grayscale = 1;
if (nlhs>1) mexErrMsgTxt("Too many output arguments");
if (nrhs==0) mexErrMsgTxt("No Image -> No HoG");
pixels = (double*) mxGetPr(prhs[0]);
img_size[0] = mxGetM(prhs[0]);
img_size[1] = mxGetN(prhs[0]);
if (mxGetNumberOfDimensions(prhs[0])==3){
img_size[1] /= 3;
grayscale = 0;
}
if (nrhs>1){
params = mxGetPr(prhs[1]);
if (params[0]<=0) mexErrMsgTxt("Number of orientation bins must be positive");
if (params[1]<=0) mexErrMsgTxt("Cell size must be positive");
if (params[2]<=0) mexErrMsgTxt("Block size must be positive");
}
else {
params = new double[5];
params[0]=9;
params[1]=8;
params[2]=2;
params[3]=0;
params[4]=0.2;
}
nb_bins = (int) params[0];
block_size = (int) params[2];
int hist1= 2+ceil(-0.5 + img_size[0]/params[1]);
int hist2= 2+ceil(-0.5 + img_size[1]/params[1]);
plhs[0] = mxCreateDoubleMatrix((hist1-2-(block_size-1))*(hist2-2-(block_size-1))*nb_bins*block_size*block_size, 1, mxREAL);
dth_des = mxGetPr(plhs[0]);
HoG(pixels, params, img_size, dth_des, grayscale);
if (nrhs==1) delete[] params;
}
| [
"tomov90@gmail.com"
] | tomov90@gmail.com |
cacbf449cfa71978aa0cecadb5a08825d6764f3a | c599ac98af47c682085157f3f11f35dec5b1ff29 | /Temp/il2cppOutput/il2cppOutput/Il2CppCompilerCalculateTypeValuesTable.cpp | 93d82a88562ea5caac3778edd7e8c13ae7714cf0 | [
"MIT"
] | permissive | angelicabr97/Emergency-Broadcast- | 224820c03ba9d953a845145fe14d6a7f648622a4 | edafae6b21db0026a9502dbc7ba63b815bd06dbd | refs/heads/master | 2020-05-04T13:04:14.310231 | 2019-04-08T16:50:52 | 2019-04-08T16:50:52 | 179,146,557 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 324,228 | cpp | #include "il2cpp-config.h"
#ifndef _MSC_VER
# include <alloca.h>
#else
# include <malloc.h>
#endif
#include <cstring>
#include <string.h>
#include <stdio.h>
#include <cmath>
#include <limits>
#include <assert.h>
#include "il2cpp-class-internals.h"
#include "codegen/il2cpp-codegen.h"
extern const int32_t g_FieldOffsetTable5[3];
extern const int32_t g_FieldOffsetTable11[3];
extern const int32_t g_FieldOffsetTable12[1];
extern const int32_t g_FieldOffsetTable14[3];
extern const int32_t g_FieldOffsetTable15[3];
extern const int32_t g_FieldOffsetTable16[1];
extern const int32_t g_FieldOffsetTable17[3];
extern const int32_t g_FieldOffsetTable18[3];
extern const int32_t g_FieldOffsetTable19[1];
extern const int32_t g_FieldOffsetTable20[3];
extern const int32_t g_FieldOffsetTable21[3];
extern const int32_t g_FieldOffsetTable26[10];
extern const int32_t g_FieldOffsetTable27[4];
extern const int32_t g_FieldOffsetTable30[8];
extern const int32_t g_FieldOffsetTable31[14];
extern const int32_t g_FieldOffsetTable32[9];
extern const int32_t g_FieldOffsetTable33[3];
extern const int32_t g_FieldOffsetTable34[2];
extern const int32_t g_FieldOffsetTable36[2];
extern const int32_t g_FieldOffsetTable37[2];
extern const int32_t g_FieldOffsetTable38[9];
extern const int32_t g_FieldOffsetTable39[1];
extern const int32_t g_FieldOffsetTable41[2];
extern const int32_t g_FieldOffsetTable42[3];
extern const int32_t g_FieldOffsetTable43[1];
extern const int32_t g_FieldOffsetTable44[4];
extern const int32_t g_FieldOffsetTable51[8];
extern const int32_t g_FieldOffsetTable57[11];
extern const int32_t g_FieldOffsetTable59[1];
extern const int32_t g_FieldOffsetTable60[1];
extern const int32_t g_FieldOffsetTable63[2];
extern const int32_t g_FieldOffsetTable64[9];
extern const int32_t g_FieldOffsetTable65[7];
extern const int32_t g_FieldOffsetTable67[1];
extern const int32_t g_FieldOffsetTable69[1];
extern const int32_t g_FieldOffsetTable72[2];
extern const int32_t g_FieldOffsetTable74[2];
extern const int32_t g_FieldOffsetTable75[1];
extern const int32_t g_FieldOffsetTable77[1];
extern const int32_t g_FieldOffsetTable78[5];
extern const int32_t g_FieldOffsetTable79[1];
extern const int32_t g_FieldOffsetTable80[1];
extern const int32_t g_FieldOffsetTable83[3];
extern const int32_t g_FieldOffsetTable84[4];
extern const int32_t g_FieldOffsetTable85[1];
extern const int32_t g_FieldOffsetTable86[2];
extern const int32_t g_FieldOffsetTable89[1];
extern const int32_t g_FieldOffsetTable94[4];
extern const int32_t g_FieldOffsetTable95[5];
extern const int32_t g_FieldOffsetTable96[4];
extern const int32_t g_FieldOffsetTable97[3];
extern const int32_t g_FieldOffsetTable98[1];
extern const int32_t g_FieldOffsetTable99[2];
extern const int32_t g_FieldOffsetTable100[1];
extern const int32_t g_FieldOffsetTable101[22];
extern const int32_t g_FieldOffsetTable102[7];
extern const int32_t g_FieldOffsetTable103[13];
extern const int32_t g_FieldOffsetTable104[8];
extern const int32_t g_FieldOffsetTable105[2];
extern const int32_t g_FieldOffsetTable106[5];
extern const int32_t g_FieldOffsetTable107[6];
extern const int32_t g_FieldOffsetTable108[4];
extern const int32_t g_FieldOffsetTable109[22];
extern const int32_t g_FieldOffsetTable112[7];
extern const int32_t g_FieldOffsetTable114[4];
extern const int32_t g_FieldOffsetTable115[4];
extern const int32_t g_FieldOffsetTable116[2];
extern const int32_t g_FieldOffsetTable119[1];
extern const int32_t g_FieldOffsetTable120[4];
extern const int32_t g_FieldOffsetTable121[13];
extern const int32_t g_FieldOffsetTable123[9];
extern const int32_t g_FieldOffsetTable124[5];
extern const int32_t g_FieldOffsetTable125[4];
extern const int32_t g_FieldOffsetTable127[4];
extern const int32_t g_FieldOffsetTable128[4];
extern const int32_t g_FieldOffsetTable129[13];
extern const int32_t g_FieldOffsetTable131[12];
extern const int32_t g_FieldOffsetTable132[2];
extern const int32_t g_FieldOffsetTable133[17];
extern const int32_t g_FieldOffsetTable134[7];
extern const int32_t g_FieldOffsetTable135[15];
extern const int32_t g_FieldOffsetTable136[21];
extern const int32_t g_FieldOffsetTable138[1];
extern const int32_t g_FieldOffsetTable139[3];
extern const int32_t g_FieldOffsetTable140[1];
extern const int32_t g_FieldOffsetTable141[3];
extern const int32_t g_FieldOffsetTable145[2];
extern const int32_t g_FieldOffsetTable146[4];
extern const int32_t g_FieldOffsetTable147[6];
extern const int32_t g_FieldOffsetTable148[3];
extern const int32_t g_FieldOffsetTable149[13];
extern const int32_t g_FieldOffsetTable152[2];
extern const int32_t g_FieldOffsetTable153[2];
extern const int32_t g_FieldOffsetTable157[1];
extern const int32_t g_FieldOffsetTable160[2];
extern const int32_t g_FieldOffsetTable161[16];
extern const int32_t g_FieldOffsetTable162[1];
extern const int32_t g_FieldOffsetTable163[4];
extern const int32_t g_FieldOffsetTable164[1];
extern const int32_t g_FieldOffsetTable165[1];
extern const int32_t g_FieldOffsetTable167[1];
extern const int32_t g_FieldOffsetTable174[2];
extern const int32_t g_FieldOffsetTable175[5];
extern const int32_t g_FieldOffsetTable176[4];
extern const int32_t g_FieldOffsetTable177[2];
extern const int32_t g_FieldOffsetTable178[1];
extern const int32_t g_FieldOffsetTable179[5];
extern const int32_t g_FieldOffsetTable180[5];
extern const int32_t g_FieldOffsetTable181[1];
extern const int32_t g_FieldOffsetTable182[1];
extern const int32_t g_FieldOffsetTable185[3];
extern const int32_t g_FieldOffsetTable186[4];
extern const int32_t g_FieldOffsetTable187[3];
extern const int32_t g_FieldOffsetTable188[3];
extern const int32_t g_FieldOffsetTable189[1];
extern const int32_t g_FieldOffsetTable191[3];
extern const int32_t g_FieldOffsetTable192[2];
extern const int32_t g_FieldOffsetTable193[14];
extern const int32_t g_FieldOffsetTable194[2];
extern const int32_t g_FieldOffsetTable195[1];
extern const int32_t g_FieldOffsetTable196[4];
extern const int32_t g_FieldOffsetTable197[8];
extern const int32_t g_FieldOffsetTable198[1];
extern const int32_t g_FieldOffsetTable199[1];
extern const int32_t g_FieldOffsetTable200[1];
extern const int32_t g_FieldOffsetTable206[6];
extern const int32_t g_FieldOffsetTable207[3];
extern const int32_t g_FieldOffsetTable208[6];
extern const int32_t g_FieldOffsetTable209[2];
extern const int32_t g_FieldOffsetTable210[4];
extern const int32_t g_FieldOffsetTable211[9];
extern const int32_t g_FieldOffsetTable212[5];
extern const int32_t g_FieldOffsetTable213[3];
extern const int32_t g_FieldOffsetTable214[4];
extern const int32_t g_FieldOffsetTable215[4];
extern const int32_t g_FieldOffsetTable217[3];
extern const int32_t g_FieldOffsetTable218[6];
extern const int32_t g_FieldOffsetTable219[1];
extern const int32_t g_FieldOffsetTable220[1];
extern const int32_t g_FieldOffsetTable221[4];
extern const int32_t g_FieldOffsetTable222[3];
extern const int32_t g_FieldOffsetTable224[1];
extern const int32_t g_FieldOffsetTable225[8];
extern const int32_t g_FieldOffsetTable226[3];
extern const int32_t g_FieldOffsetTable227[4];
extern const int32_t g_FieldOffsetTable231[8];
extern const int32_t g_FieldOffsetTable232[10];
extern const int32_t g_FieldOffsetTable233[40];
extern const int32_t g_FieldOffsetTable234[6];
extern const int32_t g_FieldOffsetTable235[58];
extern const int32_t g_FieldOffsetTable236[11];
extern const int32_t g_FieldOffsetTable237[3];
extern const int32_t g_FieldOffsetTable238[1];
extern const int32_t g_FieldOffsetTable239[7];
extern const int32_t g_FieldOffsetTable240[39];
extern const int32_t g_FieldOffsetTable241[18];
extern const int32_t g_FieldOffsetTable242[11];
extern const int32_t g_FieldOffsetTable243[9];
extern const int32_t g_FieldOffsetTable244[5];
extern const int32_t g_FieldOffsetTable245[31];
extern const int32_t g_FieldOffsetTable247[6];
extern const int32_t g_FieldOffsetTable248[7];
extern const int32_t g_FieldOffsetTable250[2];
extern const int32_t g_FieldOffsetTable254[4];
extern const int32_t g_FieldOffsetTable255[15];
extern const int32_t g_FieldOffsetTable256[4];
extern const int32_t g_FieldOffsetTable257[7];
extern const int32_t g_FieldOffsetTable258[2];
extern const int32_t g_FieldOffsetTable259[8];
extern const int32_t g_FieldOffsetTable260[7];
extern const int32_t g_FieldOffsetTable261[14];
extern const int32_t g_FieldOffsetTable264[8];
extern const int32_t g_FieldOffsetTable265[4];
extern const int32_t g_FieldOffsetTable267[10];
extern const int32_t g_FieldOffsetTable268[6];
extern const int32_t g_FieldOffsetTable269[2];
extern const int32_t g_FieldOffsetTable270[25];
extern const int32_t g_FieldOffsetTable271[6];
extern const int32_t g_FieldOffsetTable272[8];
extern const int32_t g_FieldOffsetTable274[2];
extern const int32_t g_FieldOffsetTable275[4];
extern const int32_t g_FieldOffsetTable276[1];
extern const int32_t g_FieldOffsetTable278[6];
extern const int32_t g_FieldOffsetTable279[13];
extern const int32_t g_FieldOffsetTable281[10];
extern const int32_t g_FieldOffsetTable282[3];
extern const int32_t g_FieldOffsetTable283[1];
extern const int32_t g_FieldOffsetTable285[1];
extern const int32_t g_FieldOffsetTable286[2];
extern const int32_t g_FieldOffsetTable288[2];
extern const int32_t g_FieldOffsetTable289[2];
extern const int32_t g_FieldOffsetTable291[8];
extern const int32_t g_FieldOffsetTable292[5];
extern const int32_t g_FieldOffsetTable293[2];
extern const int32_t g_FieldOffsetTable294[6];
extern const int32_t g_FieldOffsetTable295[4];
extern const int32_t g_FieldOffsetTable296[38];
extern const int32_t g_FieldOffsetTable297[5];
extern const int32_t g_FieldOffsetTable298[11];
extern const int32_t g_FieldOffsetTable300[1];
extern const int32_t g_FieldOffsetTable302[18];
extern const int32_t g_FieldOffsetTable303[2];
extern const int32_t g_FieldOffsetTable305[5];
extern const int32_t g_FieldOffsetTable306[4];
extern const int32_t g_FieldOffsetTable307[2];
extern const int32_t g_FieldOffsetTable309[14];
extern const int32_t g_FieldOffsetTable310[3];
extern const int32_t g_FieldOffsetTable311[2];
extern const int32_t g_FieldOffsetTable312[1];
extern const int32_t g_FieldOffsetTable313[1];
extern const int32_t g_FieldOffsetTable314[27];
extern const int32_t g_FieldOffsetTable315[2];
extern const int32_t g_FieldOffsetTable316[21];
extern const int32_t g_FieldOffsetTable317[1];
extern const int32_t g_FieldOffsetTable318[8];
extern const int32_t g_FieldOffsetTable319[1];
extern const int32_t g_FieldOffsetTable320[226];
extern const int32_t g_FieldOffsetTable321[19];
extern const int32_t g_FieldOffsetTable322[4];
extern const int32_t g_FieldOffsetTable323[10];
extern const int32_t g_FieldOffsetTable324[3];
extern const int32_t g_FieldOffsetTable325[6];
extern const int32_t g_FieldOffsetTable326[30];
extern const int32_t g_FieldOffsetTable327[26];
extern const int32_t g_FieldOffsetTable328[9];
extern const int32_t g_FieldOffsetTable330[10];
extern const int32_t g_FieldOffsetTable332[1];
extern const int32_t g_FieldOffsetTable333[1];
extern const int32_t g_FieldOffsetTable334[1];
extern const int32_t g_FieldOffsetTable335[1];
extern const int32_t g_FieldOffsetTable336[1];
extern const int32_t g_FieldOffsetTable337[1];
extern const int32_t g_FieldOffsetTable338[1];
extern const int32_t g_FieldOffsetTable339[1];
extern const int32_t g_FieldOffsetTable340[1];
extern const int32_t g_FieldOffsetTable341[15];
extern const int32_t g_FieldOffsetTable342[6];
extern const int32_t g_FieldOffsetTable343[1];
extern const int32_t g_FieldOffsetTable344[1];
extern const int32_t g_FieldOffsetTable345[1];
extern const int32_t g_FieldOffsetTable346[1];
extern const int32_t g_FieldOffsetTable348[21];
extern const int32_t g_FieldOffsetTable349[6];
extern const int32_t g_FieldOffsetTable350[2];
extern const int32_t g_FieldOffsetTable351[3];
extern const int32_t g_FieldOffsetTable352[2];
extern const int32_t g_FieldOffsetTable353[2];
extern const int32_t g_FieldOffsetTable354[5];
extern const int32_t g_FieldOffsetTable355[1];
extern const int32_t g_FieldOffsetTable357[20];
extern const int32_t g_FieldOffsetTable359[4];
extern const int32_t g_FieldOffsetTable360[3];
extern const int32_t g_FieldOffsetTable361[5];
extern const int32_t g_FieldOffsetTable362[10];
extern const int32_t g_FieldOffsetTable363[25];
extern const int32_t g_FieldOffsetTable365[15];
extern const int32_t g_FieldOffsetTable367[1];
extern const int32_t g_FieldOffsetTable368[10];
extern const int32_t g_FieldOffsetTable369[8];
extern const int32_t g_FieldOffsetTable370[2];
extern const int32_t g_FieldOffsetTable371[5];
extern const int32_t g_FieldOffsetTable374[5];
extern const int32_t g_FieldOffsetTable375[3];
extern const int32_t g_FieldOffsetTable376[3];
extern const int32_t g_FieldOffsetTable377[5];
extern const int32_t g_FieldOffsetTable378[7];
extern const int32_t g_FieldOffsetTable379[5];
extern const int32_t g_FieldOffsetTable383[12];
extern const int32_t g_FieldOffsetTable384[7];
extern const int32_t g_FieldOffsetTable385[1];
extern const int32_t g_FieldOffsetTable386[2];
extern const int32_t g_FieldOffsetTable387[6];
extern const int32_t g_FieldOffsetTable388[6];
extern const int32_t g_FieldOffsetTable389[9];
extern const int32_t g_FieldOffsetTable391[3];
extern const int32_t g_FieldOffsetTable392[5];
extern const int32_t g_FieldOffsetTable396[32];
extern const int32_t g_FieldOffsetTable397[1];
extern const int32_t g_FieldOffsetTable399[1];
extern const int32_t g_FieldOffsetTable400[5];
extern const int32_t g_FieldOffsetTable401[21];
extern const int32_t g_FieldOffsetTable402[13];
extern const int32_t g_FieldOffsetTable403[3];
extern const int32_t g_FieldOffsetTable404[2];
extern const int32_t g_FieldOffsetTable405[3];
extern const int32_t g_FieldOffsetTable406[4];
extern const int32_t g_FieldOffsetTable408[1];
extern const int32_t g_FieldOffsetTable409[21];
extern const int32_t g_FieldOffsetTable410[2];
extern const int32_t g_FieldOffsetTable411[2];
extern const int32_t g_FieldOffsetTable413[2];
extern const int32_t g_FieldOffsetTable414[1];
extern const int32_t g_FieldOffsetTable415[1];
extern const int32_t g_FieldOffsetTable417[4];
extern const int32_t g_FieldOffsetTable419[4];
extern const int32_t g_FieldOffsetTable420[5];
extern const int32_t g_FieldOffsetTable422[2];
extern const int32_t g_FieldOffsetTable425[6];
extern const int32_t g_FieldOffsetTable426[5];
extern const int32_t g_FieldOffsetTable427[1];
extern const int32_t g_FieldOffsetTable428[4];
extern const int32_t g_FieldOffsetTable429[1];
extern const int32_t g_FieldOffsetTable430[4];
extern const int32_t g_FieldOffsetTable431[1];
extern const int32_t g_FieldOffsetTable432[1];
extern const int32_t g_FieldOffsetTable434[1];
extern const int32_t g_FieldOffsetTable435[5];
extern const int32_t g_FieldOffsetTable436[1];
extern const int32_t g_FieldOffsetTable437[2];
extern const int32_t g_FieldOffsetTable438[1];
extern const int32_t g_FieldOffsetTable440[4];
extern const int32_t g_FieldOffsetTable441[1];
extern const int32_t g_FieldOffsetTable442[2];
extern const int32_t g_FieldOffsetTable443[1];
extern const int32_t g_FieldOffsetTable444[36];
extern const int32_t g_FieldOffsetTable470[1];
extern const int32_t g_FieldOffsetTable471[2];
extern const int32_t g_FieldOffsetTable473[1];
extern const int32_t g_FieldOffsetTable477[1];
extern const int32_t g_FieldOffsetTable479[1];
extern const int32_t g_FieldOffsetTable480[1];
extern const int32_t g_FieldOffsetTable481[5];
extern const int32_t g_FieldOffsetTable482[3];
extern const int32_t g_FieldOffsetTable483[1];
extern const int32_t g_FieldOffsetTable484[3];
extern const int32_t g_FieldOffsetTable485[2];
extern const int32_t g_FieldOffsetTable487[2];
extern const int32_t g_FieldOffsetTable495[3];
extern const int32_t g_FieldOffsetTable496[14];
extern const int32_t g_FieldOffsetTable497[1];
extern const int32_t g_FieldOffsetTable498[2];
extern const int32_t g_FieldOffsetTable500[1];
extern const int32_t g_FieldOffsetTable502[3];
extern const int32_t g_FieldOffsetTable512[5];
extern const int32_t g_FieldOffsetTable513[2];
extern const int32_t g_FieldOffsetTable514[2];
extern const int32_t g_FieldOffsetTable515[3];
extern const int32_t g_FieldOffsetTable518[8];
extern const int32_t g_FieldOffsetTable520[2];
extern const int32_t g_FieldOffsetTable521[1];
extern const int32_t g_FieldOffsetTable522[6];
extern const int32_t g_FieldOffsetTable523[5];
extern const int32_t g_FieldOffsetTable524[3];
extern const int32_t g_FieldOffsetTable525[3];
extern const int32_t g_FieldOffsetTable526[15];
extern const int32_t g_FieldOffsetTable527[1];
extern const int32_t g_FieldOffsetTable528[2];
extern const int32_t g_FieldOffsetTable529[4];
extern const int32_t g_FieldOffsetTable530[3];
extern const int32_t g_FieldOffsetTable531[2];
extern const int32_t g_FieldOffsetTable532[1];
extern const int32_t g_FieldOffsetTable534[1];
extern const int32_t g_FieldOffsetTable535[2];
extern const int32_t g_FieldOffsetTable536[8];
extern const int32_t g_FieldOffsetTable537[3];
extern const int32_t g_FieldOffsetTable539[1];
extern const int32_t g_FieldOffsetTable540[1];
extern const int32_t g_FieldOffsetTable541[4];
extern const int32_t g_FieldOffsetTable551[2];
extern const int32_t g_FieldOffsetTable552[1];
extern const int32_t g_FieldOffsetTable553[12];
extern const int32_t g_FieldOffsetTable554[1];
extern const int32_t g_FieldOffsetTable555[6];
extern const int32_t g_FieldOffsetTable556[3];
extern const int32_t g_FieldOffsetTable557[16];
extern const int32_t g_FieldOffsetTable558[2];
extern const int32_t g_FieldOffsetTable559[12];
extern const int32_t g_FieldOffsetTable560[5];
extern const int32_t g_FieldOffsetTable564[4];
extern const int32_t g_FieldOffsetTable565[14];
extern const int32_t g_FieldOffsetTable567[1];
extern const int32_t g_FieldOffsetTable568[2];
extern const int32_t g_FieldOffsetTable569[2];
extern const int32_t g_FieldOffsetTable570[3];
extern const int32_t g_FieldOffsetTable571[2];
extern const int32_t g_FieldOffsetTable572[6];
extern const int32_t g_FieldOffsetTable574[7];
extern const int32_t g_FieldOffsetTable576[1];
extern const int32_t g_FieldOffsetTable577[8];
extern const int32_t g_FieldOffsetTable578[5];
extern const int32_t g_FieldOffsetTable580[1];
extern const int32_t g_FieldOffsetTable581[2];
extern const int32_t g_FieldOffsetTable582[1];
extern const int32_t g_FieldOffsetTable583[1];
extern const int32_t g_FieldOffsetTable587[7];
extern const int32_t g_FieldOffsetTable588[1];
extern const int32_t g_FieldOffsetTable589[1];
extern const int32_t g_FieldOffsetTable590[9];
extern const int32_t g_FieldOffsetTable591[13];
extern const int32_t g_FieldOffsetTable592[10];
extern const int32_t g_FieldOffsetTable593[7];
extern const int32_t g_FieldOffsetTable594[5];
extern const int32_t g_FieldOffsetTable597[8];
extern const int32_t g_FieldOffsetTable598[5];
extern const int32_t g_FieldOffsetTable599[1];
extern const int32_t g_FieldOffsetTable602[2];
extern const int32_t g_FieldOffsetTable603[5];
extern const int32_t g_FieldOffsetTable604[2];
extern const int32_t g_FieldOffsetTable605[2];
extern const int32_t g_FieldOffsetTable606[3];
extern const int32_t g_FieldOffsetTable607[3];
extern const int32_t g_FieldOffsetTable608[3];
extern const int32_t g_FieldOffsetTable609[3];
extern const int32_t g_FieldOffsetTable610[4];
extern const int32_t g_FieldOffsetTable611[24];
extern const int32_t g_FieldOffsetTable612[9];
extern const int32_t g_FieldOffsetTable613[11];
extern const int32_t g_FieldOffsetTable614[5];
extern const int32_t g_FieldOffsetTable615[7];
extern const int32_t g_FieldOffsetTable616[2];
extern const int32_t g_FieldOffsetTable618[12];
extern const int32_t g_FieldOffsetTable619[6];
extern const int32_t g_FieldOffsetTable620[1];
extern const int32_t g_FieldOffsetTable621[2];
extern const int32_t g_FieldOffsetTable622[1];
extern const int32_t g_FieldOffsetTable623[2];
extern const int32_t g_FieldOffsetTable624[1];
extern const int32_t g_FieldOffsetTable625[14];
extern const int32_t g_FieldOffsetTable626[2];
extern const int32_t g_FieldOffsetTable627[3];
extern const int32_t g_FieldOffsetTable628[4];
extern const int32_t g_FieldOffsetTable629[3];
extern const int32_t g_FieldOffsetTable638[3];
extern const int32_t g_FieldOffsetTable640[9];
extern const int32_t g_FieldOffsetTable641[4];
extern const int32_t g_FieldOffsetTable642[1];
extern const int32_t g_FieldOffsetTable643[1];
extern const int32_t g_FieldOffsetTable644[1];
extern const int32_t g_FieldOffsetTable645[1];
extern const int32_t g_FieldOffsetTable646[5];
extern const int32_t g_FieldOffsetTable647[13];
extern const int32_t g_FieldOffsetTable653[6];
extern const int32_t g_FieldOffsetTable655[3];
extern const int32_t g_FieldOffsetTable657[5];
extern const int32_t g_FieldOffsetTable658[1];
extern const int32_t g_FieldOffsetTable659[3];
extern const int32_t g_FieldOffsetTable660[2];
extern const int32_t g_FieldOffsetTable661[2];
extern const int32_t g_FieldOffsetTable662[10];
extern const int32_t g_FieldOffsetTable663[5];
extern const int32_t g_FieldOffsetTable664[7];
extern const int32_t g_FieldOffsetTable665[2];
extern const int32_t g_FieldOffsetTable669[2];
extern const int32_t g_FieldOffsetTable670[6];
extern const int32_t g_FieldOffsetTable671[3];
extern const int32_t g_FieldOffsetTable674[5];
extern const int32_t g_FieldOffsetTable675[9];
extern const int32_t g_FieldOffsetTable676[2];
extern const int32_t g_FieldOffsetTable677[13];
extern const int32_t g_FieldOffsetTable680[7];
extern const int32_t g_FieldOffsetTable681[8];
extern const int32_t g_FieldOffsetTable682[1];
extern const int32_t g_FieldOffsetTable683[1];
extern const int32_t g_FieldOffsetTable684[5];
extern const int32_t g_FieldOffsetTable689[2];
extern const int32_t g_FieldOffsetTable690[2];
extern const int32_t g_FieldOffsetTable691[4];
extern const int32_t g_FieldOffsetTable694[3];
extern const int32_t g_FieldOffsetTable695[1];
extern const int32_t g_FieldOffsetTable696[3];
extern const int32_t g_FieldOffsetTable698[6];
extern const int32_t g_FieldOffsetTable699[6];
extern const int32_t g_FieldOffsetTable700[1];
extern const int32_t g_FieldOffsetTable702[7];
extern const int32_t g_FieldOffsetTable704[5];
extern const int32_t g_FieldOffsetTable705[2];
extern const int32_t g_FieldOffsetTable707[7];
extern const int32_t g_FieldOffsetTable708[2];
extern const int32_t g_FieldOffsetTable709[2];
extern const int32_t g_FieldOffsetTable710[2];
extern const int32_t g_FieldOffsetTable711[8];
extern const int32_t g_FieldOffsetTable715[15];
extern const int32_t g_FieldOffsetTable716[2];
extern const int32_t g_FieldOffsetTable718[5];
extern const int32_t g_FieldOffsetTable719[1];
extern const int32_t g_FieldOffsetTable720[1];
extern const int32_t g_FieldOffsetTable722[5];
extern const int32_t g_FieldOffsetTable724[14];
extern const int32_t g_FieldOffsetTable726[14];
extern const int32_t g_FieldOffsetTable727[2];
extern const int32_t g_FieldOffsetTable728[4];
extern const int32_t g_FieldOffsetTable731[10];
extern const int32_t g_FieldOffsetTable732[1];
extern const int32_t g_FieldOffsetTable735[6];
extern const int32_t g_FieldOffsetTable739[10];
extern const int32_t g_FieldOffsetTable740[1];
extern const int32_t g_FieldOffsetTable741[1];
extern const int32_t g_FieldOffsetTable742[17];
extern const int32_t g_FieldOffsetTable743[1];
extern const int32_t g_FieldOffsetTable744[1];
extern const int32_t g_FieldOffsetTable745[4];
extern const int32_t g_FieldOffsetTable746[3];
extern const int32_t g_FieldOffsetTable747[2];
extern const int32_t g_FieldOffsetTable750[3];
extern const int32_t g_FieldOffsetTable753[4];
extern const int32_t g_FieldOffsetTable754[5];
extern const int32_t g_FieldOffsetTable755[7];
extern const int32_t g_FieldOffsetTable761[1];
extern const int32_t g_FieldOffsetTable762[4];
extern const int32_t g_FieldOffsetTable763[1];
extern const int32_t g_FieldOffsetTable764[3];
extern const int32_t g_FieldOffsetTable765[9];
extern const int32_t g_FieldOffsetTable766[2];
extern const int32_t g_FieldOffsetTable767[8];
extern const int32_t g_FieldOffsetTable768[3];
extern const int32_t g_FieldOffsetTable769[5];
extern const int32_t g_FieldOffsetTable770[5];
extern const int32_t g_FieldOffsetTable771[3];
extern const int32_t g_FieldOffsetTable774[2];
extern const int32_t g_FieldOffsetTable777[3];
extern const int32_t g_FieldOffsetTable779[2];
extern const int32_t g_FieldOffsetTable780[1];
extern const int32_t g_FieldOffsetTable781[3];
extern const int32_t g_FieldOffsetTable784[3];
extern const int32_t g_FieldOffsetTable786[4];
extern const int32_t g_FieldOffsetTable787[1];
extern const int32_t g_FieldOffsetTable788[3];
extern const int32_t g_FieldOffsetTable789[28];
extern const int32_t g_FieldOffsetTable790[1];
extern const int32_t g_FieldOffsetTable792[5];
extern const int32_t g_FieldOffsetTable793[2];
extern const int32_t g_FieldOffsetTable794[3];
extern const int32_t g_FieldOffsetTable795[3];
extern const int32_t g_FieldOffsetTable796[1];
extern const int32_t g_FieldOffsetTable797[1];
extern const int32_t g_FieldOffsetTable798[2];
extern const int32_t g_FieldOffsetTable799[2];
extern const int32_t g_FieldOffsetTable800[2];
extern const int32_t g_FieldOffsetTable801[1];
extern const int32_t g_FieldOffsetTable802[3];
extern const int32_t g_FieldOffsetTable804[3];
extern const int32_t g_FieldOffsetTable810[9];
extern const int32_t g_FieldOffsetTable811[1];
extern const int32_t g_FieldOffsetTable813[52];
extern const int32_t g_FieldOffsetTable817[11];
extern const int32_t g_FieldOffsetTable819[7];
extern const int32_t g_FieldOffsetTable821[2];
extern const int32_t g_FieldOffsetTable822[4];
extern const int32_t g_FieldOffsetTable824[1];
extern const int32_t g_FieldOffsetTable826[21];
extern const int32_t g_FieldOffsetTable828[22];
extern const int32_t g_FieldOffsetTable830[1];
extern const int32_t g_FieldOffsetTable831[2];
extern const int32_t g_FieldOffsetTable832[1];
extern const int32_t g_FieldOffsetTable833[1];
extern const int32_t g_FieldOffsetTable835[1];
extern const int32_t g_FieldOffsetTable837[17];
extern const int32_t g_FieldOffsetTable838[2];
extern const int32_t g_FieldOffsetTable840[3];
extern const int32_t g_FieldOffsetTable841[5];
extern const int32_t g_FieldOffsetTable843[2];
extern const int32_t g_FieldOffsetTable844[1];
extern const int32_t g_FieldOffsetTable845[15];
extern const int32_t g_FieldOffsetTable846[5];
extern const int32_t g_FieldOffsetTable847[4];
extern const int32_t g_FieldOffsetTable848[4];
extern const int32_t g_FieldOffsetTable850[8];
extern const int32_t g_FieldOffsetTable851[2];
extern const int32_t g_FieldOffsetTable852[1];
extern const int32_t g_FieldOffsetTable853[7];
extern const int32_t g_FieldOffsetTable854[1];
extern const int32_t g_FieldOffsetTable855[1];
extern const int32_t g_FieldOffsetTable856[1];
extern const int32_t g_FieldOffsetTable857[11];
extern const int32_t g_FieldOffsetTable862[2];
extern const int32_t g_FieldOffsetTable863[24];
extern const int32_t g_FieldOffsetTable864[1];
extern const int32_t g_FieldOffsetTable868[1];
extern const int32_t g_FieldOffsetTable870[15];
extern const int32_t g_FieldOffsetTable871[3];
extern const int32_t g_FieldOffsetTable875[1];
extern const int32_t g_FieldOffsetTable876[1];
extern const int32_t g_FieldOffsetTable877[7];
extern const int32_t g_FieldOffsetTable878[5];
extern const int32_t g_FieldOffsetTable881[1];
extern const int32_t g_FieldOffsetTable883[3];
extern const int32_t g_FieldOffsetTable884[1];
extern const int32_t g_FieldOffsetTable885[7];
extern const int32_t g_FieldOffsetTable886[3];
extern const int32_t g_FieldOffsetTable887[2];
extern const int32_t g_FieldOffsetTable888[1];
extern const int32_t g_FieldOffsetTable889[2];
extern const int32_t g_FieldOffsetTable890[1];
extern const int32_t g_FieldOffsetTable894[1];
extern const int32_t g_FieldOffsetTable895[1];
extern const int32_t g_FieldOffsetTable896[26];
extern const int32_t g_FieldOffsetTable897[14];
extern const int32_t g_FieldOffsetTable898[2];
extern const int32_t g_FieldOffsetTable899[3];
extern const int32_t g_FieldOffsetTable900[1];
extern const int32_t g_FieldOffsetTable901[1];
extern const int32_t g_FieldOffsetTable902[8];
extern const int32_t g_FieldOffsetTable903[1];
extern const int32_t g_FieldOffsetTable905[1];
extern const int32_t g_FieldOffsetTable906[1];
extern const int32_t g_FieldOffsetTable908[4];
extern const int32_t g_FieldOffsetTable909[2];
extern const int32_t g_FieldOffsetTable910[1];
extern const int32_t g_FieldOffsetTable911[7];
extern const int32_t g_FieldOffsetTable912[3];
extern const int32_t g_FieldOffsetTable915[4];
extern const int32_t g_FieldOffsetTable916[3];
extern const int32_t g_FieldOffsetTable917[8];
extern const int32_t g_FieldOffsetTable918[19];
extern const int32_t g_FieldOffsetTable919[1];
extern const int32_t g_FieldOffsetTable920[3];
extern const int32_t g_FieldOffsetTable922[2];
extern const int32_t g_FieldOffsetTable923[3];
extern const int32_t g_FieldOffsetTable924[5];
extern const int32_t g_FieldOffsetTable925[5];
extern const int32_t g_FieldOffsetTable926[2];
extern const int32_t g_FieldOffsetTable946[53];
extern const int32_t g_FieldOffsetTable972[4];
extern const int32_t g_FieldOffsetTable973[4];
extern const int32_t g_FieldOffsetTable974[2];
extern const int32_t g_FieldOffsetTable976[7];
extern const int32_t g_FieldOffsetTable980[3];
extern const int32_t g_FieldOffsetTable984[2];
extern const int32_t g_FieldOffsetTable985[4];
extern const int32_t g_FieldOffsetTable986[5];
extern const int32_t g_FieldOffsetTable988[1];
extern const int32_t g_FieldOffsetTable990[6];
extern const int32_t g_FieldOffsetTable992[5];
extern const int32_t g_FieldOffsetTable993[4];
extern const int32_t g_FieldOffsetTable995[4];
extern const int32_t g_FieldOffsetTable996[4];
extern const int32_t g_FieldOffsetTable997[2];
extern const int32_t g_FieldOffsetTable998[13];
extern const int32_t g_FieldOffsetTable1000[2];
extern const int32_t g_FieldOffsetTable1001[17];
extern const int32_t g_FieldOffsetTable1002[7];
extern const int32_t g_FieldOffsetTable1003[15];
extern const int32_t g_FieldOffsetTable1004[26];
extern const int32_t g_FieldOffsetTable1006[1];
extern const int32_t g_FieldOffsetTable1007[5];
extern const int32_t g_FieldOffsetTable1008[8];
extern const int32_t g_FieldOffsetTable1009[11];
extern const int32_t g_FieldOffsetTable1010[3];
extern const int32_t g_FieldOffsetTable1011[3];
extern const int32_t g_FieldOffsetTable1012[1];
extern const int32_t g_FieldOffsetTable1013[4];
extern const int32_t g_FieldOffsetTable1014[2];
extern const int32_t g_FieldOffsetTable1015[2];
extern const int32_t g_FieldOffsetTable1016[1];
extern const int32_t g_FieldOffsetTable1017[2];
extern const int32_t g_FieldOffsetTable1018[2];
extern const int32_t g_FieldOffsetTable1019[5];
extern const int32_t g_FieldOffsetTable1020[11];
extern const int32_t g_FieldOffsetTable1021[1];
extern const int32_t g_FieldOffsetTable1022[1];
extern const int32_t g_FieldOffsetTable1023[8];
extern const int32_t g_FieldOffsetTable1024[1];
extern const int32_t g_FieldOffsetTable1025[4];
extern const int32_t g_FieldOffsetTable1026[3];
extern const int32_t g_FieldOffsetTable1027[3];
extern const int32_t g_FieldOffsetTable1028[25];
extern const int32_t g_FieldOffsetTable1029[2];
extern const int32_t g_FieldOffsetTable1030[8];
extern const int32_t g_FieldOffsetTable1031[21];
extern const int32_t g_FieldOffsetTable1032[2];
extern const int32_t g_FieldOffsetTable1034[2];
extern const int32_t g_FieldOffsetTable1036[6];
extern const int32_t g_FieldOffsetTable1037[2];
extern const int32_t g_FieldOffsetTable1038[5];
extern const int32_t g_FieldOffsetTable1039[30];
extern const int32_t g_FieldOffsetTable1040[6];
extern const int32_t g_FieldOffsetTable1041[4];
extern const int32_t g_FieldOffsetTable1042[4];
extern const int32_t g_FieldOffsetTable1043[4];
extern const int32_t g_FieldOffsetTable1044[3];
extern const int32_t g_FieldOffsetTable1045[9];
extern const int32_t g_FieldOffsetTable1046[7];
extern const int32_t g_FieldOffsetTable1047[3];
extern const int32_t g_FieldOffsetTable1048[3];
extern const int32_t g_FieldOffsetTable1049[3];
extern const int32_t g_FieldOffsetTable1050[3];
extern const int32_t g_FieldOffsetTable1051[5];
extern const int32_t g_FieldOffsetTable1053[2];
extern const int32_t g_FieldOffsetTable1054[4];
extern const int32_t g_FieldOffsetTable1055[3];
extern const int32_t g_FieldOffsetTable1056[8];
extern const int32_t g_FieldOffsetTable1057[15];
extern const int32_t g_FieldOffsetTable1058[12];
extern const int32_t g_FieldOffsetTable1059[2];
extern const int32_t g_FieldOffsetTable1060[4];
extern const int32_t g_FieldOffsetTable1061[1];
extern const int32_t g_FieldOffsetTable1062[8];
extern const int32_t g_FieldOffsetTable1063[4];
extern const int32_t g_FieldOffsetTable1064[6];
extern const int32_t g_FieldOffsetTable1065[4];
extern const int32_t g_FieldOffsetTable1066[12];
extern const int32_t g_FieldOffsetTable1067[2];
extern const int32_t g_FieldOffsetTable1069[1];
extern const int32_t g_FieldOffsetTable1070[1];
extern const int32_t g_FieldOffsetTable1072[1];
extern const int32_t g_FieldOffsetTable1073[2];
extern const int32_t g_FieldOffsetTable1074[1];
extern const int32_t g_FieldOffsetTable1075[4];
extern const int32_t g_FieldOffsetTable1077[2];
extern const int32_t g_FieldOffsetTable1083[15];
extern const int32_t g_FieldOffsetTable1095[1];
extern const int32_t g_FieldOffsetTable1096[7];
extern const int32_t g_FieldOffsetTable1097[4];
extern const int32_t g_FieldOffsetTable1098[4];
extern const int32_t g_FieldOffsetTable1099[3];
extern const int32_t g_FieldOffsetTable1100[3];
extern const int32_t g_FieldOffsetTable1101[3];
extern const int32_t g_FieldOffsetTable1102[4];
extern const int32_t g_FieldOffsetTable1103[3];
extern const int32_t g_FieldOffsetTable1104[4];
extern const int32_t g_FieldOffsetTable1105[10];
extern const int32_t g_FieldOffsetTable1106[2];
extern const int32_t g_FieldOffsetTable1107[2];
extern const int32_t g_FieldOffsetTable1108[1];
extern const int32_t g_FieldOffsetTable1109[2];
extern const int32_t g_FieldOffsetTable1110[1];
extern const int32_t g_FieldOffsetTable1111[4];
extern const int32_t g_FieldOffsetTable1113[2];
extern const int32_t g_FieldOffsetTable1114[3];
extern const int32_t g_FieldOffsetTable1115[8];
extern const int32_t g_FieldOffsetTable1119[4];
extern const int32_t g_FieldOffsetTable1120[5];
extern const int32_t g_FieldOffsetTable1121[32];
extern const int32_t g_FieldOffsetTable1123[9];
extern const int32_t g_FieldOffsetTable1126[11];
extern const int32_t g_FieldOffsetTable1129[2];
extern const int32_t g_FieldOffsetTable1130[24];
extern const int32_t g_FieldOffsetTable1133[12];
extern const int32_t g_FieldOffsetTable1134[5];
extern const int32_t g_FieldOffsetTable1137[3];
extern const int32_t g_FieldOffsetTable1138[11];
extern const int32_t g_FieldOffsetTable1139[10];
extern const int32_t g_FieldOffsetTable1140[2];
extern const int32_t g_FieldOffsetTable1141[5];
extern const int32_t g_FieldOffsetTable1142[5];
extern const int32_t g_FieldOffsetTable1143[5];
extern const int32_t g_FieldOffsetTable1144[6];
extern const int32_t g_FieldOffsetTable1145[5];
extern const int32_t g_FieldOffsetTable1146[3];
extern const int32_t g_FieldOffsetTable1147[9];
extern const int32_t g_FieldOffsetTable1148[1];
extern const int32_t g_FieldOffsetTable1149[11];
extern const int32_t g_FieldOffsetTable1150[6];
extern const int32_t g_FieldOffsetTable1151[13];
extern const int32_t g_FieldOffsetTable1153[1];
extern const int32_t g_FieldOffsetTable1155[1];
extern const int32_t g_FieldOffsetTable1156[15];
extern const int32_t g_FieldOffsetTable1157[4];
extern const int32_t g_FieldOffsetTable1158[1];
extern const int32_t g_FieldOffsetTable1159[1];
extern const int32_t g_FieldOffsetTable1160[8];
extern const int32_t g_FieldOffsetTable1161[2];
extern const int32_t g_FieldOffsetTable1162[24];
extern const int32_t g_FieldOffsetTable1163[3];
extern const int32_t g_FieldOffsetTable1164[1];
extern const int32_t g_FieldOffsetTable1165[1];
extern const int32_t g_FieldOffsetTable1166[1];
extern const int32_t g_FieldOffsetTable1167[16];
extern const int32_t g_FieldOffsetTable1168[5];
extern const int32_t g_FieldOffsetTable1169[11];
extern const int32_t g_FieldOffsetTable1170[7];
extern const int32_t g_FieldOffsetTable1171[4];
extern const int32_t g_FieldOffsetTable1172[4];
extern const int32_t g_FieldOffsetTable1173[6];
extern const int32_t g_FieldOffsetTable1174[5];
extern const int32_t g_FieldOffsetTable1175[4];
extern const int32_t g_FieldOffsetTable1176[15];
extern const int32_t g_FieldOffsetTable1177[7];
extern const int32_t g_FieldOffsetTable1178[3];
extern const int32_t g_FieldOffsetTable1179[3];
extern const int32_t g_FieldOffsetTable1180[2];
extern const int32_t g_FieldOffsetTable1181[2];
extern const int32_t g_FieldOffsetTable1182[1];
extern const int32_t g_FieldOffsetTable1183[3];
extern const int32_t g_FieldOffsetTable1184[1];
extern const int32_t g_FieldOffsetTable1185[3];
extern const int32_t g_FieldOffsetTable1186[2];
extern const int32_t g_FieldOffsetTable1187[5];
extern const int32_t g_FieldOffsetTable1188[2];
extern const int32_t g_FieldOffsetTable1189[2];
extern const int32_t g_FieldOffsetTable1190[9];
extern const int32_t g_FieldOffsetTable1191[10];
extern const int32_t g_FieldOffsetTable1192[26];
extern const int32_t g_FieldOffsetTable1193[6];
extern const int32_t g_FieldOffsetTable1194[11];
extern const int32_t g_FieldOffsetTable1197[3];
extern const int32_t g_FieldOffsetTable1198[2];
extern const int32_t g_FieldOffsetTable1199[2];
extern const int32_t g_FieldOffsetTable1200[3];
extern const int32_t g_FieldOffsetTable1201[146];
extern const int32_t g_FieldOffsetTable1205[4];
extern const int32_t g_FieldOffsetTable1206[1];
extern const int32_t g_FieldOffsetTable1207[1];
extern const int32_t g_FieldOffsetTable1208[2];
extern const int32_t g_FieldOffsetTable1209[1];
extern const int32_t g_FieldOffsetTable1210[3];
extern const int32_t g_FieldOffsetTable1211[16];
extern const int32_t g_FieldOffsetTable1212[2];
extern const int32_t g_FieldOffsetTable1213[7];
extern const int32_t g_FieldOffsetTable1214[4];
extern const int32_t g_FieldOffsetTable1215[3];
extern const int32_t g_FieldOffsetTable1216[1];
extern const int32_t g_FieldOffsetTable1217[2];
extern const int32_t g_FieldOffsetTable1219[6];
extern const int32_t g_FieldOffsetTable1220[7];
extern const int32_t g_FieldOffsetTable1223[1];
extern const int32_t g_FieldOffsetTable1225[1];
extern const int32_t g_FieldOffsetTable1226[2];
extern const int32_t g_FieldOffsetTable1227[1];
extern const int32_t g_FieldOffsetTable1229[3];
extern const int32_t g_FieldOffsetTable1231[3];
extern const int32_t g_FieldOffsetTable1232[2];
extern const int32_t g_FieldOffsetTable1234[2];
extern const int32_t g_FieldOffsetTable1235[1];
extern const int32_t g_FieldOffsetTable1236[2];
extern const int32_t g_FieldOffsetTable1237[2];
extern const int32_t g_FieldOffsetTable1238[6];
extern const int32_t g_FieldOffsetTable1239[6];
extern const int32_t g_FieldOffsetTable1242[33];
extern const int32_t g_FieldOffsetTable1243[3];
extern const int32_t g_FieldOffsetTable1245[6];
extern const int32_t g_FieldOffsetTable1246[4];
extern const int32_t g_FieldOffsetTable1247[6];
extern const int32_t g_FieldOffsetTable1248[5];
extern const int32_t g_FieldOffsetTable1251[3];
extern const int32_t g_FieldOffsetTable1258[1];
extern const int32_t g_FieldOffsetTable1259[12];
extern const int32_t g_FieldOffsetTable1260[14];
extern const int32_t g_FieldOffsetTable1261[2];
extern const int32_t g_FieldOffsetTable1262[4];
extern const int32_t g_FieldOffsetTable1263[1];
extern const int32_t g_FieldOffsetTable1266[3];
extern const int32_t g_FieldOffsetTable1267[8];
extern const int32_t g_FieldOffsetTable1270[14];
extern const int32_t g_FieldOffsetTable1277[12];
extern const int32_t g_FieldOffsetTable1284[3];
extern const int32_t g_FieldOffsetTable1286[2];
extern const int32_t g_FieldOffsetTable1290[2];
extern const int32_t g_FieldOffsetTable1300[2];
extern const int32_t g_FieldOffsetTable1301[1];
extern const int32_t g_FieldOffsetTable1302[1];
extern const int32_t g_FieldOffsetTable1303[1];
extern const int32_t g_FieldOffsetTable1304[5];
extern const int32_t g_FieldOffsetTable1305[3];
extern const int32_t g_FieldOffsetTable1306[1];
extern const int32_t g_FieldOffsetTable1307[4];
extern const int32_t g_FieldOffsetTable1309[3];
extern const int32_t g_FieldOffsetTable1314[5];
extern const int32_t g_FieldOffsetTable1315[2];
extern const int32_t g_FieldOffsetTable1316[1];
extern const int32_t g_FieldOffsetTable1317[1];
extern const int32_t g_FieldOffsetTable1320[7];
extern const int32_t g_FieldOffsetTable1321[1];
extern const int32_t g_FieldOffsetTable1322[6];
extern const int32_t g_FieldOffsetTable1325[4];
extern const int32_t g_FieldOffsetTable1326[2];
extern const int32_t g_FieldOffsetTable1328[3];
extern const int32_t g_FieldOffsetTable1330[3];
extern const int32_t g_FieldOffsetTable1331[2];
extern const int32_t g_FieldOffsetTable1332[3];
extern const int32_t g_FieldOffsetTable1336[1];
extern const int32_t g_FieldOffsetTable1339[3];
extern const int32_t g_FieldOffsetTable1340[3];
extern const int32_t g_FieldOffsetTable1341[35];
extern const int32_t g_FieldOffsetTable1342[6];
extern const int32_t g_FieldOffsetTable1343[1];
extern const int32_t g_FieldOffsetTable1344[2];
extern const int32_t g_FieldOffsetTable1346[1];
extern const int32_t g_FieldOffsetTable1347[2];
extern const int32_t g_FieldOffsetTable1348[3];
extern const int32_t g_FieldOffsetTable1349[4];
extern const int32_t g_FieldOffsetTable1351[2];
extern const int32_t g_FieldOffsetTable1355[4];
extern const int32_t g_FieldOffsetTable1356[5];
extern const int32_t g_FieldOffsetTable1358[1];
extern const int32_t g_FieldOffsetTable1360[3];
extern const int32_t g_FieldOffsetTable1361[2];
extern const int32_t g_FieldOffsetTable1363[4];
extern const int32_t g_FieldOffsetTable1367[1];
extern const int32_t g_FieldOffsetTable1368[4];
extern const int32_t g_FieldOffsetTable1372[2];
extern const int32_t g_FieldOffsetTable1376[1];
extern const int32_t g_FieldOffsetTable1380[3];
extern const int32_t g_FieldOffsetTable1387[1];
extern const int32_t g_FieldOffsetTable1389[4];
extern const int32_t g_FieldOffsetTable1390[4];
extern const int32_t g_FieldOffsetTable1391[6];
extern const int32_t g_FieldOffsetTable1392[5];
extern const int32_t g_FieldOffsetTable1393[6];
extern const int32_t g_FieldOffsetTable1394[4];
extern const int32_t g_FieldOffsetTable1395[4];
extern const int32_t g_FieldOffsetTable1396[5];
extern const int32_t g_FieldOffsetTable1397[52];
extern const int32_t g_FieldOffsetTable1398[8];
extern const int32_t g_FieldOffsetTable1399[29];
extern const int32_t g_FieldOffsetTable1400[4];
extern const int32_t g_FieldOffsetTable1401[11];
extern const int32_t g_FieldOffsetTable1402[4];
extern const int32_t g_FieldOffsetTable1403[5];
extern const int32_t g_FieldOffsetTable1404[4];
extern const int32_t g_FieldOffsetTable1405[9];
extern const int32_t g_FieldOffsetTable1406[138];
extern const int32_t g_FieldOffsetTable1407[3];
extern const int32_t g_FieldOffsetTable1408[15];
extern const int32_t g_FieldOffsetTable1409[10];
extern const int32_t g_FieldOffsetTable1410[6];
extern const int32_t g_FieldOffsetTable1411[9];
extern const int32_t g_FieldOffsetTable1412[5];
extern const int32_t g_FieldOffsetTable1413[26];
extern const int32_t g_FieldOffsetTable1415[24];
extern const int32_t g_FieldOffsetTable1416[7];
extern const int32_t g_FieldOffsetTable1417[4];
extern const int32_t g_FieldOffsetTable1418[9];
extern const int32_t g_FieldOffsetTable1421[6];
extern const int32_t g_FieldOffsetTable1422[4];
extern const int32_t g_FieldOffsetTable1423[5];
extern const int32_t g_FieldOffsetTable1424[6];
extern const int32_t g_FieldOffsetTable1425[4];
extern const int32_t g_FieldOffsetTable1426[4];
extern const int32_t g_FieldOffsetTable1427[14];
extern const int32_t g_FieldOffsetTable1429[327];
extern const int32_t g_FieldOffsetTable1430[1];
extern const int32_t g_FieldOffsetTable1432[18];
extern const int32_t g_FieldOffsetTable1433[15];
extern const int32_t g_FieldOffsetTable1434[5];
extern const int32_t g_FieldOffsetTable1435[1];
extern const int32_t g_FieldOffsetTable1436[3];
extern const int32_t g_FieldOffsetTable1438[3];
extern const int32_t g_FieldOffsetTable1441[5];
extern const int32_t g_FieldOffsetTable1442[2];
extern const int32_t g_FieldOffsetTable1444[2];
extern const int32_t g_FieldOffsetTable1571[5];
extern const int32_t g_FieldOffsetTable1572[5];
extern const int32_t g_FieldOffsetTable1574[3];
extern const int32_t g_FieldOffsetTable1576[1];
extern const int32_t g_FieldOffsetTable1577[1];
extern const int32_t g_FieldOffsetTable1578[1];
extern const int32_t g_FieldOffsetTable1579[2];
extern const int32_t g_FieldOffsetTable1580[2];
extern const int32_t g_FieldOffsetTable1582[1];
extern const int32_t g_FieldOffsetTable1583[2];
extern const int32_t g_FieldOffsetTable1584[2];
extern const int32_t g_FieldOffsetTable1585[4];
extern const int32_t g_FieldOffsetTable1586[2];
extern const int32_t g_FieldOffsetTable1587[3];
extern const int32_t g_FieldOffsetTable1588[1];
extern const int32_t g_FieldOffsetTable1589[2];
extern const int32_t g_FieldOffsetTable1591[3];
extern const int32_t g_FieldOffsetTable1592[1];
extern const int32_t g_FieldOffsetTable1594[1];
extern const int32_t g_FieldOffsetTable1601[1];
extern const int32_t g_FieldOffsetTable1602[27];
extern const int32_t g_FieldOffsetTable1603[1];
extern const int32_t g_FieldOffsetTable1605[5];
extern const int32_t g_FieldOffsetTable1614[12];
extern const int32_t g_FieldOffsetTable1616[12];
extern const int32_t g_FieldOffsetTable1617[1];
extern const int32_t g_FieldOffsetTable1618[1];
extern const int32_t g_FieldOffsetTable1619[1];
extern const int32_t g_FieldOffsetTable1620[10];
extern const int32_t g_FieldOffsetTable1621[4];
extern const int32_t g_FieldOffsetTable1622[8];
extern const int32_t g_FieldOffsetTable1623[6];
extern const int32_t g_FieldOffsetTable1625[1];
extern const int32_t g_FieldOffsetTable1626[1];
extern const int32_t g_FieldOffsetTable1627[1];
extern const int32_t g_FieldOffsetTable1628[1];
extern const int32_t g_FieldOffsetTable1629[1];
extern const int32_t g_FieldOffsetTable1630[1];
extern const int32_t g_FieldOffsetTable1631[4];
extern const int32_t g_FieldOffsetTable1632[5];
extern const int32_t g_FieldOffsetTable1633[1];
extern const int32_t g_FieldOffsetTable1634[4];
extern const int32_t g_FieldOffsetTable1635[4];
extern const int32_t g_FieldOffsetTable1637[1];
extern const int32_t g_FieldOffsetTable1639[1];
extern const int32_t g_FieldOffsetTable1641[1];
extern const int32_t g_FieldOffsetTable1643[1];
extern const int32_t g_FieldOffsetTable1645[1];
extern const int32_t g_FieldOffsetTable1647[3];
extern const int32_t g_FieldOffsetTable1648[3];
extern const int32_t g_FieldOffsetTable1649[12];
extern const int32_t g_FieldOffsetTable1650[9];
extern const int32_t g_FieldOffsetTable1653[1];
extern const int32_t g_FieldOffsetTable1654[2];
extern const int32_t g_FieldOffsetTable1656[1];
extern const int32_t g_FieldOffsetTable1657[1];
extern const int32_t g_FieldOffsetTable1661[1];
extern const int32_t g_FieldOffsetTable1662[1];
extern const int32_t g_FieldOffsetTable1680[1];
extern const int32_t g_FieldOffsetTable1685[1];
extern const int32_t g_FieldOffsetTable1686[2];
extern const int32_t g_FieldOffsetTable1690[6];
extern const int32_t g_FieldOffsetTable1692[2];
extern const int32_t g_FieldOffsetTable1693[3];
extern const int32_t g_FieldOffsetTable1694[2];
extern const int32_t g_FieldOffsetTable1695[3];
extern const int32_t g_FieldOffsetTable1696[1];
extern const int32_t g_FieldOffsetTable1697[1];
extern const int32_t g_FieldOffsetTable1698[1];
extern const int32_t g_FieldOffsetTable1699[1];
extern const int32_t g_FieldOffsetTable1703[3];
extern const int32_t g_FieldOffsetTable1704[2];
extern const int32_t g_FieldOffsetTable1706[5];
extern const int32_t g_FieldOffsetTable1707[1];
extern const int32_t g_FieldOffsetTable1708[1];
extern const int32_t g_FieldOffsetTable1709[1];
extern const int32_t g_FieldOffsetTable1710[3];
extern const int32_t g_FieldOffsetTable1713[3];
extern const int32_t g_FieldOffsetTable1714[1];
extern const int32_t g_FieldOffsetTable1715[1];
extern const int32_t g_FieldOffsetTable1716[1];
extern const int32_t g_FieldOffsetTable1719[2];
extern const int32_t g_FieldOffsetTable1720[14];
extern const int32_t g_FieldOffsetTable1721[3];
extern const int32_t g_FieldOffsetTable1722[5];
extern const int32_t g_FieldOffsetTable1723[1];
extern const int32_t g_FieldOffsetTable1724[3];
extern const int32_t g_FieldOffsetTable1725[3];
extern const int32_t g_FieldOffsetTable1728[2];
extern const int32_t g_FieldOffsetTable1729[1];
extern const int32_t g_FieldOffsetTable1730[5];
extern const int32_t g_FieldOffsetTable1731[1];
extern const int32_t g_FieldOffsetTable1735[2];
extern const int32_t g_FieldOffsetTable1736[1];
extern const int32_t g_FieldOffsetTable1737[3];
extern const int32_t g_FieldOffsetTable1738[2];
extern const int32_t g_FieldOffsetTable1739[26];
extern const int32_t g_FieldOffsetTable1741[1];
extern const int32_t g_FieldOffsetTable1742[5];
extern const int32_t g_FieldOffsetTable1743[3];
extern const int32_t g_FieldOffsetTable1746[2];
extern const int32_t g_FieldOffsetTable1747[5];
extern const int32_t g_FieldOffsetTable1750[3];
extern const int32_t g_FieldOffsetTable1752[3];
extern const int32_t g_FieldOffsetTable1755[5];
extern const int32_t g_FieldOffsetTable1756[5];
extern const int32_t g_FieldOffsetTable1757[18];
extern const int32_t g_FieldOffsetTable1758[11];
extern const int32_t g_FieldOffsetTable1759[10];
extern const int32_t g_FieldOffsetTable1760[3];
extern const int32_t g_FieldOffsetTable1761[3];
extern const int32_t g_FieldOffsetTable1763[2];
extern const int32_t g_FieldOffsetTable1764[4];
extern const int32_t g_FieldOffsetTable1765[11];
extern const int32_t g_FieldOffsetTable1766[2];
extern const int32_t g_FieldOffsetTable1772[1];
extern const int32_t g_FieldOffsetTable1773[1];
extern const int32_t g_FieldOffsetTable1774[2];
extern const int32_t g_FieldOffsetTable1775[2];
extern const int32_t g_FieldOffsetTable1776[2];
extern const int32_t g_FieldOffsetTable1777[2];
extern const int32_t g_FieldOffsetTable1778[1];
extern const int32_t g_FieldOffsetTable1779[2];
extern const int32_t g_FieldOffsetTable1780[2];
extern const int32_t g_FieldOffsetTable1781[2];
extern const int32_t g_FieldOffsetTable1782[7];
extern const int32_t g_FieldOffsetTable1783[2];
extern const int32_t g_FieldOffsetTable1784[9];
extern const int32_t g_FieldOffsetTable1785[8];
extern const int32_t g_FieldOffsetTable1787[2];
extern const int32_t g_FieldOffsetTable1788[1];
extern const int32_t g_FieldOffsetTable1790[5];
extern const int32_t g_FieldOffsetTable1791[5];
extern const int32_t g_FieldOffsetTable1792[3];
extern const int32_t g_FieldOffsetTable1794[4];
extern const int32_t g_FieldOffsetTable1795[11];
extern const int32_t g_FieldOffsetTable1798[4];
extern const int32_t g_FieldOffsetTable1799[2];
extern const int32_t g_FieldOffsetTable1800[2];
extern const int32_t g_FieldOffsetTable1801[1];
extern const int32_t g_FieldOffsetTable1802[2];
extern const int32_t g_FieldOffsetTable1803[9];
extern const int32_t g_FieldOffsetTable1804[1];
extern const int32_t g_FieldOffsetTable1805[1];
extern const int32_t g_FieldOffsetTable1806[1];
extern const int32_t g_FieldOffsetTable1807[8];
extern const int32_t g_FieldOffsetTable1810[1];
extern const int32_t g_FieldOffsetTable1812[2];
extern const int32_t g_FieldOffsetTable1816[1];
extern const int32_t g_FieldOffsetTable1817[2];
extern const int32_t g_FieldOffsetTable1819[4];
extern const int32_t g_FieldOffsetTable1820[7];
extern const int32_t g_FieldOffsetTable1821[5];
extern const int32_t g_FieldOffsetTable1822[7];
extern const int32_t g_FieldOffsetTable1823[7];
extern const int32_t g_FieldOffsetTable1824[1];
extern const int32_t g_FieldOffsetTable1825[3];
extern const int32_t g_FieldOffsetTable1826[5];
extern const int32_t g_FieldOffsetTable1827[5];
extern const int32_t g_FieldOffsetTable1828[7];
extern const int32_t g_FieldOffsetTable1829[6];
extern const int32_t g_FieldOffsetTable1830[10];
extern const int32_t g_FieldOffsetTable1833[6];
extern const int32_t g_FieldOffsetTable1838[3];
extern const int32_t g_FieldOffsetTable1839[4];
extern const int32_t g_FieldOffsetTable1840[2];
extern const int32_t g_FieldOffsetTable1842[2];
extern const int32_t g_FieldOffsetTable1844[4];
extern const int32_t g_FieldOffsetTable1845[33];
extern const int32_t g_FieldOffsetTable1846[9];
extern const int32_t g_FieldOffsetTable1847[12];
extern const int32_t g_FieldOffsetTable1850[7];
extern const int32_t g_FieldOffsetTable1851[4];
extern const int32_t g_FieldOffsetTable1853[2];
extern const int32_t g_FieldOffsetTable1854[15];
extern const int32_t g_FieldOffsetTable1855[4];
extern const int32_t g_FieldOffsetTable1856[3];
extern const int32_t g_FieldOffsetTable1857[5];
extern const int32_t g_FieldOffsetTable1858[27];
extern const int32_t g_FieldOffsetTable1860[2];
extern const int32_t g_FieldOffsetTable1861[15];
extern const int32_t g_FieldOffsetTable1862[1];
extern const int32_t g_FieldOffsetTable1863[8];
extern const int32_t g_FieldOffsetTable1865[11];
extern const int32_t g_FieldOffsetTable1866[17];
extern const int32_t g_FieldOffsetTable1867[12];
extern const int32_t g_FieldOffsetTable1870[16];
extern const int32_t g_FieldOffsetTable1871[3];
extern const int32_t g_FieldOffsetTable1876[15];
extern const int32_t g_FieldOffsetTable1877[11];
extern const int32_t g_FieldOffsetTable1880[1];
extern const int32_t g_FieldOffsetTable1881[6];
extern const int32_t g_FieldOffsetTable1885[7];
extern const int32_t g_FieldOffsetTable1886[7];
extern const int32_t g_FieldOffsetTable1887[4];
extern const int32_t g_FieldOffsetTable1888[6];
extern const int32_t g_FieldOffsetTable1896[5];
extern const int32_t g_FieldOffsetTable1897[1];
extern const int32_t g_FieldOffsetTable1900[4];
extern const int32_t g_FieldOffsetTable1901[1];
extern const int32_t g_FieldOffsetTable1904[3];
extern const int32_t g_FieldOffsetTable1907[1];
extern const int32_t g_FieldOffsetTable1908[1];
extern const int32_t g_FieldOffsetTable1911[5];
extern const int32_t g_FieldOffsetTable1912[1];
extern const int32_t g_FieldOffsetTable1914[3];
extern const int32_t g_FieldOffsetTable1916[2];
extern const int32_t g_FieldOffsetTable1918[1];
extern const int32_t g_FieldOffsetTable1919[1];
extern const int32_t g_FieldOffsetTable1922[3];
extern const int32_t g_FieldOffsetTable1941[12];
extern const int32_t g_FieldOffsetTable1942[2];
extern const int32_t g_FieldOffsetTable1944[2];
extern const int32_t g_FieldOffsetTable1945[18];
extern const int32_t g_FieldOffsetTable1946[36];
extern const int32_t g_FieldOffsetTable1948[6];
extern const int32_t g_FieldOffsetTable1949[10];
extern const int32_t g_FieldOffsetTable1950[1];
extern const int32_t g_FieldOffsetTable1952[2];
extern const int32_t g_FieldOffsetTable1953[1];
extern const int32_t g_FieldOffsetTable1954[1];
extern const int32_t g_FieldOffsetTable1955[21];
extern const int32_t g_FieldOffsetTable1956[4];
extern const int32_t g_FieldOffsetTable1957[5];
extern const int32_t g_FieldOffsetTable1959[6];
extern const int32_t g_FieldOffsetTable1960[6];
extern const int32_t g_FieldOffsetTable1961[2];
extern const int32_t g_FieldOffsetTable1962[1];
extern const int32_t g_FieldOffsetTable1963[2];
extern const int32_t g_FieldOffsetTable1964[14];
extern const int32_t g_FieldOffsetTable1965[3];
extern const int32_t g_FieldOffsetTable1966[4];
extern const int32_t g_FieldOffsetTable1968[1];
extern const int32_t g_FieldOffsetTable1969[7];
extern const int32_t g_FieldOffsetTable1971[6];
extern const int32_t g_FieldOffsetTable1972[4];
extern const int32_t g_FieldOffsetTable1974[5];
extern const int32_t g_FieldOffsetTable1976[2];
extern const int32_t g_FieldOffsetTable1977[6];
extern const int32_t g_FieldOffsetTable1978[8];
extern const int32_t g_FieldOffsetTable1979[1];
extern const int32_t g_FieldOffsetTable1981[6];
extern const int32_t g_FieldOffsetTable1982[7];
extern const int32_t g_FieldOffsetTable1984[7];
extern const int32_t g_FieldOffsetTable1985[6];
extern const int32_t g_FieldOffsetTable1986[9];
extern const int32_t g_FieldOffsetTable1987[7];
extern const int32_t g_FieldOffsetTable1988[14];
extern const int32_t g_FieldOffsetTable1989[4];
extern const int32_t g_FieldOffsetTable1990[2];
extern const int32_t g_FieldOffsetTable1991[1];
extern const int32_t g_FieldOffsetTable1993[2];
extern const int32_t g_FieldOffsetTable1994[5];
extern const int32_t g_FieldOffsetTable1995[12];
extern const int32_t g_FieldOffsetTable1996[3];
extern const int32_t g_FieldOffsetTable1997[17];
extern const int32_t g_FieldOffsetTable1998[8];
extern const int32_t g_FieldOffsetTable1999[5];
extern const int32_t g_FieldOffsetTable2000[3];
extern const int32_t g_FieldOffsetTable2004[20];
extern const int32_t g_FieldOffsetTable2005[5];
extern const int32_t g_FieldOffsetTable2006[6];
extern const int32_t g_FieldOffsetTable2007[3];
extern const int32_t g_FieldOffsetTable2008[3];
extern const int32_t g_FieldOffsetTable2009[5];
extern const int32_t g_FieldOffsetTable2010[5];
extern const int32_t g_FieldOffsetTable2011[5];
extern const int32_t g_FieldOffsetTable2012[49];
extern const int32_t g_FieldOffsetTable2013[11];
extern const int32_t g_FieldOffsetTable2014[4];
extern const int32_t g_FieldOffsetTable2015[7];
extern const int32_t g_FieldOffsetTable2016[4];
extern const int32_t g_FieldOffsetTable2020[3];
extern const int32_t g_FieldOffsetTable2021[6];
extern const int32_t g_FieldOffsetTable2022[8];
extern const int32_t g_FieldOffsetTable2023[5];
extern const int32_t g_FieldOffsetTable2025[9];
extern const int32_t g_FieldOffsetTable2028[5];
extern const int32_t g_FieldOffsetTable2029[6];
extern const int32_t g_FieldOffsetTable2030[2];
extern const int32_t g_FieldOffsetTable2031[9];
extern const int32_t g_FieldOffsetTable2032[37];
extern const int32_t g_FieldOffsetTable2033[4];
extern const int32_t g_FieldOffsetTable2034[4];
extern const int32_t g_FieldOffsetTable2036[11];
extern const int32_t g_FieldOffsetTable2037[5];
extern const int32_t g_FieldOffsetTable2039[3];
extern const int32_t g_FieldOffsetTable2040[5];
extern const int32_t g_FieldOffsetTable2041[14];
extern const int32_t g_FieldOffsetTable2042[5];
extern const int32_t g_FieldOffsetTable2043[5];
extern const int32_t g_FieldOffsetTable2045[15];
extern const int32_t g_FieldOffsetTable2046[5];
extern const int32_t g_FieldOffsetTable2048[3];
extern const int32_t g_FieldOffsetTable2049[3];
extern const int32_t g_FieldOffsetTable2050[1];
extern const int32_t g_FieldOffsetTable2051[10];
extern const int32_t g_FieldOffsetTable2052[7];
extern const int32_t g_FieldOffsetTable2053[5];
extern const int32_t g_FieldOffsetTable2054[3];
extern const int32_t g_FieldOffsetTable2056[4];
extern const int32_t g_FieldOffsetTable2057[2];
extern const int32_t g_FieldOffsetTable2061[2];
extern const int32_t g_FieldOffsetTable2062[5];
extern const int32_t g_FieldOffsetTable2063[6];
extern const int32_t g_FieldOffsetTable2064[14];
extern const int32_t g_FieldOffsetTable2065[4];
extern const int32_t g_FieldOffsetTable2066[4];
extern const int32_t g_FieldOffsetTable2067[6];
extern const int32_t g_FieldOffsetTable2068[4];
extern const int32_t g_FieldOffsetTable2069[4];
extern const int32_t g_FieldOffsetTable2070[6];
extern const int32_t g_FieldOffsetTable2071[5];
extern const int32_t g_FieldOffsetTable2072[3];
extern const int32_t g_FieldOffsetTable2073[4];
extern const int32_t g_FieldOffsetTable2075[5];
extern const int32_t g_FieldOffsetTable2081[8];
extern const int32_t g_FieldOffsetTable2082[8];
extern const int32_t g_FieldOffsetTable2083[4];
extern const int32_t g_FieldOffsetTable2084[9];
extern const int32_t g_FieldOffsetTable2085[8];
extern const int32_t g_FieldOffsetTable2088[2];
extern const int32_t g_FieldOffsetTable2089[2];
extern const int32_t g_FieldOffsetTable2090[4];
extern const int32_t g_FieldOffsetTable2091[7];
extern const int32_t g_FieldOffsetTable2098[12];
extern const int32_t g_FieldOffsetTable2101[1];
extern const int32_t g_FieldOffsetTable2106[4];
extern const int32_t g_FieldOffsetTable2107[1];
extern const int32_t g_FieldOffsetTable2110[3];
extern const int32_t g_FieldOffsetTable2111[1];
extern const int32_t g_FieldOffsetTable2112[1];
extern const int32_t g_FieldOffsetTable2113[4];
extern const int32_t g_FieldOffsetTable2114[1];
extern const int32_t g_FieldOffsetTable2115[1];
extern const int32_t g_FieldOffsetTable2121[4];
extern const int32_t g_FieldOffsetTable2122[3];
extern const int32_t g_FieldOffsetTable2124[4];
extern const int32_t g_FieldOffsetTable2125[4];
extern const int32_t g_FieldOffsetTable2126[1];
extern const int32_t g_FieldOffsetTable2127[5];
extern const int32_t g_FieldOffsetTable2128[9];
extern const int32_t g_FieldOffsetTable2129[4];
extern const int32_t g_FieldOffsetTable2130[6];
extern const int32_t g_FieldOffsetTable2131[3];
extern const int32_t g_FieldOffsetTable2132[5];
extern const int32_t g_FieldOffsetTable2133[2];
extern const int32_t g_FieldOffsetTable2134[5];
extern const int32_t g_FieldOffsetTable2135[2];
extern const int32_t g_FieldOffsetTable2136[2];
extern const int32_t g_FieldOffsetTable2137[10];
extern const int32_t g_FieldOffsetTable2138[4];
extern const int32_t g_FieldOffsetTable2139[6];
extern const int32_t g_FieldOffsetTable2140[3];
extern const int32_t g_FieldOffsetTable2141[4];
extern const int32_t g_FieldOffsetTable2142[3];
extern const int32_t g_FieldOffsetTable2143[2];
extern const int32_t g_FieldOffsetTable2144[3];
extern const int32_t g_FieldOffsetTable2146[2];
extern const int32_t g_FieldOffsetTable2147[2];
extern const int32_t g_FieldOffsetTable2148[2];
extern const int32_t g_FieldOffsetTable2149[4];
extern const int32_t g_FieldOffsetTable2150[3];
extern const int32_t g_FieldOffsetTable2151[2];
extern const int32_t g_FieldOffsetTable2152[4];
extern const int32_t g_FieldOffsetTable2153[2];
extern const int32_t g_FieldOffsetTable2154[6];
extern const int32_t g_FieldOffsetTable2155[8];
extern const int32_t g_FieldOffsetTable2156[1];
extern const int32_t g_FieldOffsetTable2157[21];
extern const int32_t g_FieldOffsetTable2158[5];
extern const int32_t g_FieldOffsetTable2159[2];
extern const int32_t g_FieldOffsetTable2160[7];
extern const int32_t g_FieldOffsetTable2161[4];
extern const int32_t g_FieldOffsetTable2162[3];
extern const int32_t g_FieldOffsetTable2163[2];
extern const int32_t g_FieldOffsetTable2164[2];
extern const int32_t g_FieldOffsetTable2165[2];
extern const int32_t g_FieldOffsetTable2166[2];
extern const int32_t g_FieldOffsetTable2167[1];
extern const int32_t g_FieldOffsetTable2168[2];
extern const int32_t g_FieldOffsetTable2169[2];
extern const int32_t g_FieldOffsetTable2170[1];
extern const int32_t g_FieldOffsetTable2171[2];
extern const int32_t g_FieldOffsetTable2172[3];
extern const int32_t g_FieldOffsetTable2173[3];
extern const int32_t g_FieldOffsetTable2174[3];
extern const int32_t g_FieldOffsetTable2175[3];
extern const int32_t g_FieldOffsetTable2176[2];
extern const int32_t g_FieldOffsetTable2178[2];
extern const int32_t g_FieldOffsetTable2179[2];
extern const int32_t g_FieldOffsetTable2180[7];
extern const int32_t g_FieldOffsetTable2181[1];
extern const int32_t g_FieldOffsetTable2182[1];
extern const int32_t g_FieldOffsetTable2183[13];
extern const int32_t g_FieldOffsetTable2184[3];
extern const int32_t g_FieldOffsetTable2185[2];
extern const int32_t g_FieldOffsetTable2186[2];
extern const int32_t g_FieldOffsetTable2187[6];
extern const int32_t g_FieldOffsetTable2188[2];
extern const int32_t g_FieldOffsetTable2190[1];
extern const int32_t g_FieldOffsetTable2191[3];
extern const int32_t g_FieldOffsetTable2192[6];
extern const int32_t g_FieldOffsetTable2193[4];
extern const int32_t g_FieldOffsetTable2194[2];
extern const int32_t g_FieldOffsetTable2195[7];
extern const int32_t g_FieldOffsetTable2196[4];
extern const int32_t g_FieldOffsetTable2197[8];
extern const int32_t g_FieldOffsetTable2198[5];
extern const int32_t g_FieldOffsetTable2199[4];
extern const int32_t g_FieldOffsetTable2201[1];
extern const int32_t g_FieldOffsetTable2202[54];
extern const int32_t g_FieldOffsetTable2246[5];
extern const int32_t g_FieldOffsetTable2247[52];
extern const int32_t g_FieldOffsetTable2248[6];
extern const int32_t g_FieldOffsetTable2249[8];
extern const int32_t g_FieldOffsetTable2250[13];
extern const int32_t g_FieldOffsetTable2251[4];
extern const int32_t g_FieldOffsetTable2253[4];
extern const int32_t g_FieldOffsetTable2254[6];
extern const int32_t g_FieldOffsetTable2255[7];
extern const int32_t g_FieldOffsetTable2256[5];
extern const int32_t g_FieldOffsetTable2257[1];
extern const int32_t g_FieldOffsetTable2258[1];
extern const int32_t g_FieldOffsetTable2259[2];
extern const int32_t g_FieldOffsetTable2260[2];
extern const int32_t g_FieldOffsetTable2261[3];
extern const int32_t g_FieldOffsetTable2262[3];
extern const int32_t g_FieldOffsetTable2263[3];
extern const int32_t g_FieldOffsetTable2264[3];
extern const int32_t g_FieldOffsetTable2265[4];
extern const int32_t g_FieldOffsetTable2266[1];
extern const int32_t g_FieldOffsetTable2267[8];
extern const int32_t g_FieldOffsetTable2268[6];
extern const int32_t g_FieldOffsetTable2269[1];
extern const int32_t g_FieldOffsetTable2270[2];
extern const int32_t g_FieldOffsetTable2271[3];
extern const int32_t g_FieldOffsetTable2272[2];
extern const int32_t g_FieldOffsetTable2273[3];
extern const int32_t g_FieldOffsetTable2274[2];
extern const int32_t g_FieldOffsetTable2275[1];
extern const int32_t g_FieldOffsetTable2276[5];
extern const int32_t g_FieldOffsetTable2277[1];
extern const int32_t g_FieldOffsetTable2278[2];
extern const int32_t g_FieldOffsetTable2279[1];
extern const int32_t g_FieldOffsetTable2280[2];
extern const int32_t g_FieldOffsetTable2281[5];
extern const int32_t g_FieldOffsetTable2282[4];
extern const int32_t g_FieldOffsetTable2283[6];
extern const int32_t g_FieldOffsetTable2284[2];
extern const int32_t g_FieldOffsetTable2285[7];
extern const int32_t g_FieldOffsetTable2287[5];
extern const int32_t g_FieldOffsetTable2288[1];
extern const int32_t g_FieldOffsetTable2289[1];
extern const int32_t g_FieldOffsetTable2290[4];
extern const int32_t g_FieldOffsetTable2291[5];
extern const int32_t g_FieldOffsetTable2292[10];
extern const int32_t g_FieldOffsetTable2293[9];
extern const int32_t g_FieldOffsetTable2294[2];
extern const int32_t g_FieldOffsetTable2295[6];
extern const int32_t g_FieldOffsetTable2296[4];
extern const int32_t g_FieldOffsetTable2297[5];
extern const int32_t g_FieldOffsetTable2298[3];
extern const int32_t g_FieldOffsetTable2299[12];
extern const int32_t g_FieldOffsetTable2300[3];
extern const int32_t g_FieldOffsetTable2301[3];
extern const int32_t g_FieldOffsetTable2302[2];
extern const int32_t* g_FieldOffsetTable[2303] =
{
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable5,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable11,
g_FieldOffsetTable12,
NULL,
g_FieldOffsetTable14,
g_FieldOffsetTable15,
g_FieldOffsetTable16,
g_FieldOffsetTable17,
g_FieldOffsetTable18,
g_FieldOffsetTable19,
g_FieldOffsetTable20,
g_FieldOffsetTable21,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable26,
g_FieldOffsetTable27,
NULL,
NULL,
g_FieldOffsetTable30,
g_FieldOffsetTable31,
g_FieldOffsetTable32,
g_FieldOffsetTable33,
g_FieldOffsetTable34,
NULL,
g_FieldOffsetTable36,
g_FieldOffsetTable37,
g_FieldOffsetTable38,
g_FieldOffsetTable39,
NULL,
g_FieldOffsetTable41,
g_FieldOffsetTable42,
g_FieldOffsetTable43,
g_FieldOffsetTable44,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable51,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable57,
NULL,
g_FieldOffsetTable59,
g_FieldOffsetTable60,
NULL,
NULL,
g_FieldOffsetTable63,
g_FieldOffsetTable64,
g_FieldOffsetTable65,
NULL,
g_FieldOffsetTable67,
NULL,
g_FieldOffsetTable69,
NULL,
NULL,
g_FieldOffsetTable72,
NULL,
g_FieldOffsetTable74,
g_FieldOffsetTable75,
NULL,
g_FieldOffsetTable77,
g_FieldOffsetTable78,
g_FieldOffsetTable79,
g_FieldOffsetTable80,
NULL,
NULL,
g_FieldOffsetTable83,
g_FieldOffsetTable84,
g_FieldOffsetTable85,
g_FieldOffsetTable86,
NULL,
NULL,
g_FieldOffsetTable89,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable94,
g_FieldOffsetTable95,
g_FieldOffsetTable96,
g_FieldOffsetTable97,
g_FieldOffsetTable98,
g_FieldOffsetTable99,
g_FieldOffsetTable100,
g_FieldOffsetTable101,
g_FieldOffsetTable102,
g_FieldOffsetTable103,
g_FieldOffsetTable104,
g_FieldOffsetTable105,
g_FieldOffsetTable106,
g_FieldOffsetTable107,
g_FieldOffsetTable108,
g_FieldOffsetTable109,
NULL,
NULL,
g_FieldOffsetTable112,
NULL,
g_FieldOffsetTable114,
g_FieldOffsetTable115,
g_FieldOffsetTable116,
NULL,
NULL,
g_FieldOffsetTable119,
g_FieldOffsetTable120,
g_FieldOffsetTable121,
NULL,
g_FieldOffsetTable123,
g_FieldOffsetTable124,
g_FieldOffsetTable125,
NULL,
g_FieldOffsetTable127,
g_FieldOffsetTable128,
g_FieldOffsetTable129,
NULL,
g_FieldOffsetTable131,
g_FieldOffsetTable132,
g_FieldOffsetTable133,
g_FieldOffsetTable134,
g_FieldOffsetTable135,
g_FieldOffsetTable136,
NULL,
g_FieldOffsetTable138,
g_FieldOffsetTable139,
g_FieldOffsetTable140,
g_FieldOffsetTable141,
NULL,
NULL,
NULL,
g_FieldOffsetTable145,
g_FieldOffsetTable146,
g_FieldOffsetTable147,
g_FieldOffsetTable148,
g_FieldOffsetTable149,
NULL,
NULL,
g_FieldOffsetTable152,
g_FieldOffsetTable153,
NULL,
NULL,
NULL,
g_FieldOffsetTable157,
NULL,
NULL,
g_FieldOffsetTable160,
g_FieldOffsetTable161,
g_FieldOffsetTable162,
g_FieldOffsetTable163,
g_FieldOffsetTable164,
g_FieldOffsetTable165,
NULL,
g_FieldOffsetTable167,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable174,
g_FieldOffsetTable175,
g_FieldOffsetTable176,
g_FieldOffsetTable177,
g_FieldOffsetTable178,
g_FieldOffsetTable179,
g_FieldOffsetTable180,
g_FieldOffsetTable181,
g_FieldOffsetTable182,
NULL,
NULL,
g_FieldOffsetTable185,
g_FieldOffsetTable186,
g_FieldOffsetTable187,
g_FieldOffsetTable188,
g_FieldOffsetTable189,
NULL,
g_FieldOffsetTable191,
g_FieldOffsetTable192,
g_FieldOffsetTable193,
g_FieldOffsetTable194,
g_FieldOffsetTable195,
g_FieldOffsetTable196,
g_FieldOffsetTable197,
g_FieldOffsetTable198,
g_FieldOffsetTable199,
g_FieldOffsetTable200,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable206,
g_FieldOffsetTable207,
g_FieldOffsetTable208,
g_FieldOffsetTable209,
g_FieldOffsetTable210,
g_FieldOffsetTable211,
g_FieldOffsetTable212,
g_FieldOffsetTable213,
g_FieldOffsetTable214,
g_FieldOffsetTable215,
NULL,
g_FieldOffsetTable217,
g_FieldOffsetTable218,
g_FieldOffsetTable219,
g_FieldOffsetTable220,
g_FieldOffsetTable221,
g_FieldOffsetTable222,
NULL,
g_FieldOffsetTable224,
g_FieldOffsetTable225,
g_FieldOffsetTable226,
g_FieldOffsetTable227,
NULL,
NULL,
NULL,
g_FieldOffsetTable231,
g_FieldOffsetTable232,
g_FieldOffsetTable233,
g_FieldOffsetTable234,
g_FieldOffsetTable235,
g_FieldOffsetTable236,
g_FieldOffsetTable237,
g_FieldOffsetTable238,
g_FieldOffsetTable239,
g_FieldOffsetTable240,
g_FieldOffsetTable241,
g_FieldOffsetTable242,
g_FieldOffsetTable243,
g_FieldOffsetTable244,
g_FieldOffsetTable245,
NULL,
g_FieldOffsetTable247,
g_FieldOffsetTable248,
NULL,
g_FieldOffsetTable250,
NULL,
NULL,
NULL,
g_FieldOffsetTable254,
g_FieldOffsetTable255,
g_FieldOffsetTable256,
g_FieldOffsetTable257,
g_FieldOffsetTable258,
g_FieldOffsetTable259,
g_FieldOffsetTable260,
g_FieldOffsetTable261,
NULL,
NULL,
g_FieldOffsetTable264,
g_FieldOffsetTable265,
NULL,
g_FieldOffsetTable267,
g_FieldOffsetTable268,
g_FieldOffsetTable269,
g_FieldOffsetTable270,
g_FieldOffsetTable271,
g_FieldOffsetTable272,
NULL,
g_FieldOffsetTable274,
g_FieldOffsetTable275,
g_FieldOffsetTable276,
NULL,
g_FieldOffsetTable278,
g_FieldOffsetTable279,
NULL,
g_FieldOffsetTable281,
g_FieldOffsetTable282,
g_FieldOffsetTable283,
NULL,
g_FieldOffsetTable285,
g_FieldOffsetTable286,
NULL,
g_FieldOffsetTable288,
g_FieldOffsetTable289,
NULL,
g_FieldOffsetTable291,
g_FieldOffsetTable292,
g_FieldOffsetTable293,
g_FieldOffsetTable294,
g_FieldOffsetTable295,
g_FieldOffsetTable296,
g_FieldOffsetTable297,
g_FieldOffsetTable298,
NULL,
g_FieldOffsetTable300,
NULL,
g_FieldOffsetTable302,
g_FieldOffsetTable303,
NULL,
g_FieldOffsetTable305,
g_FieldOffsetTable306,
g_FieldOffsetTable307,
NULL,
g_FieldOffsetTable309,
g_FieldOffsetTable310,
g_FieldOffsetTable311,
g_FieldOffsetTable312,
g_FieldOffsetTable313,
g_FieldOffsetTable314,
g_FieldOffsetTable315,
g_FieldOffsetTable316,
g_FieldOffsetTable317,
g_FieldOffsetTable318,
g_FieldOffsetTable319,
g_FieldOffsetTable320,
g_FieldOffsetTable321,
g_FieldOffsetTable322,
g_FieldOffsetTable323,
g_FieldOffsetTable324,
g_FieldOffsetTable325,
g_FieldOffsetTable326,
g_FieldOffsetTable327,
g_FieldOffsetTable328,
NULL,
g_FieldOffsetTable330,
NULL,
g_FieldOffsetTable332,
g_FieldOffsetTable333,
g_FieldOffsetTable334,
g_FieldOffsetTable335,
g_FieldOffsetTable336,
g_FieldOffsetTable337,
g_FieldOffsetTable338,
g_FieldOffsetTable339,
g_FieldOffsetTable340,
g_FieldOffsetTable341,
g_FieldOffsetTable342,
g_FieldOffsetTable343,
g_FieldOffsetTable344,
g_FieldOffsetTable345,
g_FieldOffsetTable346,
NULL,
g_FieldOffsetTable348,
g_FieldOffsetTable349,
g_FieldOffsetTable350,
g_FieldOffsetTable351,
g_FieldOffsetTable352,
g_FieldOffsetTable353,
g_FieldOffsetTable354,
g_FieldOffsetTable355,
NULL,
g_FieldOffsetTable357,
NULL,
g_FieldOffsetTable359,
g_FieldOffsetTable360,
g_FieldOffsetTable361,
g_FieldOffsetTable362,
g_FieldOffsetTable363,
NULL,
g_FieldOffsetTable365,
NULL,
g_FieldOffsetTable367,
g_FieldOffsetTable368,
g_FieldOffsetTable369,
g_FieldOffsetTable370,
g_FieldOffsetTable371,
NULL,
NULL,
g_FieldOffsetTable374,
g_FieldOffsetTable375,
g_FieldOffsetTable376,
g_FieldOffsetTable377,
g_FieldOffsetTable378,
g_FieldOffsetTable379,
NULL,
NULL,
NULL,
g_FieldOffsetTable383,
g_FieldOffsetTable384,
g_FieldOffsetTable385,
g_FieldOffsetTable386,
g_FieldOffsetTable387,
g_FieldOffsetTable388,
g_FieldOffsetTable389,
NULL,
g_FieldOffsetTable391,
g_FieldOffsetTable392,
NULL,
NULL,
NULL,
g_FieldOffsetTable396,
g_FieldOffsetTable397,
NULL,
g_FieldOffsetTable399,
g_FieldOffsetTable400,
g_FieldOffsetTable401,
g_FieldOffsetTable402,
g_FieldOffsetTable403,
g_FieldOffsetTable404,
g_FieldOffsetTable405,
g_FieldOffsetTable406,
NULL,
g_FieldOffsetTable408,
g_FieldOffsetTable409,
g_FieldOffsetTable410,
g_FieldOffsetTable411,
NULL,
g_FieldOffsetTable413,
g_FieldOffsetTable414,
g_FieldOffsetTable415,
NULL,
g_FieldOffsetTable417,
NULL,
g_FieldOffsetTable419,
g_FieldOffsetTable420,
NULL,
g_FieldOffsetTable422,
NULL,
NULL,
g_FieldOffsetTable425,
g_FieldOffsetTable426,
g_FieldOffsetTable427,
g_FieldOffsetTable428,
g_FieldOffsetTable429,
g_FieldOffsetTable430,
g_FieldOffsetTable431,
g_FieldOffsetTable432,
NULL,
g_FieldOffsetTable434,
g_FieldOffsetTable435,
g_FieldOffsetTable436,
g_FieldOffsetTable437,
g_FieldOffsetTable438,
NULL,
g_FieldOffsetTable440,
g_FieldOffsetTable441,
g_FieldOffsetTable442,
g_FieldOffsetTable443,
g_FieldOffsetTable444,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable470,
g_FieldOffsetTable471,
NULL,
g_FieldOffsetTable473,
NULL,
NULL,
NULL,
g_FieldOffsetTable477,
NULL,
g_FieldOffsetTable479,
g_FieldOffsetTable480,
g_FieldOffsetTable481,
g_FieldOffsetTable482,
g_FieldOffsetTable483,
g_FieldOffsetTable484,
g_FieldOffsetTable485,
NULL,
g_FieldOffsetTable487,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable495,
g_FieldOffsetTable496,
g_FieldOffsetTable497,
g_FieldOffsetTable498,
NULL,
g_FieldOffsetTable500,
NULL,
g_FieldOffsetTable502,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable512,
g_FieldOffsetTable513,
g_FieldOffsetTable514,
g_FieldOffsetTable515,
NULL,
NULL,
g_FieldOffsetTable518,
NULL,
g_FieldOffsetTable520,
g_FieldOffsetTable521,
g_FieldOffsetTable522,
g_FieldOffsetTable523,
g_FieldOffsetTable524,
g_FieldOffsetTable525,
g_FieldOffsetTable526,
g_FieldOffsetTable527,
g_FieldOffsetTable528,
g_FieldOffsetTable529,
g_FieldOffsetTable530,
g_FieldOffsetTable531,
g_FieldOffsetTable532,
NULL,
g_FieldOffsetTable534,
g_FieldOffsetTable535,
g_FieldOffsetTable536,
g_FieldOffsetTable537,
NULL,
g_FieldOffsetTable539,
g_FieldOffsetTable540,
g_FieldOffsetTable541,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable551,
g_FieldOffsetTable552,
g_FieldOffsetTable553,
g_FieldOffsetTable554,
g_FieldOffsetTable555,
g_FieldOffsetTable556,
g_FieldOffsetTable557,
g_FieldOffsetTable558,
g_FieldOffsetTable559,
g_FieldOffsetTable560,
NULL,
NULL,
NULL,
g_FieldOffsetTable564,
g_FieldOffsetTable565,
NULL,
g_FieldOffsetTable567,
g_FieldOffsetTable568,
g_FieldOffsetTable569,
g_FieldOffsetTable570,
g_FieldOffsetTable571,
g_FieldOffsetTable572,
NULL,
g_FieldOffsetTable574,
NULL,
g_FieldOffsetTable576,
g_FieldOffsetTable577,
g_FieldOffsetTable578,
NULL,
g_FieldOffsetTable580,
g_FieldOffsetTable581,
g_FieldOffsetTable582,
g_FieldOffsetTable583,
NULL,
NULL,
NULL,
g_FieldOffsetTable587,
g_FieldOffsetTable588,
g_FieldOffsetTable589,
g_FieldOffsetTable590,
g_FieldOffsetTable591,
g_FieldOffsetTable592,
g_FieldOffsetTable593,
g_FieldOffsetTable594,
NULL,
NULL,
g_FieldOffsetTable597,
g_FieldOffsetTable598,
g_FieldOffsetTable599,
NULL,
NULL,
g_FieldOffsetTable602,
g_FieldOffsetTable603,
g_FieldOffsetTable604,
g_FieldOffsetTable605,
g_FieldOffsetTable606,
g_FieldOffsetTable607,
g_FieldOffsetTable608,
g_FieldOffsetTable609,
g_FieldOffsetTable610,
g_FieldOffsetTable611,
g_FieldOffsetTable612,
g_FieldOffsetTable613,
g_FieldOffsetTable614,
g_FieldOffsetTable615,
g_FieldOffsetTable616,
NULL,
g_FieldOffsetTable618,
g_FieldOffsetTable619,
g_FieldOffsetTable620,
g_FieldOffsetTable621,
g_FieldOffsetTable622,
g_FieldOffsetTable623,
g_FieldOffsetTable624,
g_FieldOffsetTable625,
g_FieldOffsetTable626,
g_FieldOffsetTable627,
g_FieldOffsetTable628,
g_FieldOffsetTable629,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable638,
NULL,
g_FieldOffsetTable640,
g_FieldOffsetTable641,
g_FieldOffsetTable642,
g_FieldOffsetTable643,
g_FieldOffsetTable644,
g_FieldOffsetTable645,
g_FieldOffsetTable646,
g_FieldOffsetTable647,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable653,
NULL,
g_FieldOffsetTable655,
NULL,
g_FieldOffsetTable657,
g_FieldOffsetTable658,
g_FieldOffsetTable659,
g_FieldOffsetTable660,
g_FieldOffsetTable661,
g_FieldOffsetTable662,
g_FieldOffsetTable663,
g_FieldOffsetTable664,
g_FieldOffsetTable665,
NULL,
NULL,
NULL,
g_FieldOffsetTable669,
g_FieldOffsetTable670,
g_FieldOffsetTable671,
NULL,
NULL,
g_FieldOffsetTable674,
g_FieldOffsetTable675,
g_FieldOffsetTable676,
g_FieldOffsetTable677,
NULL,
NULL,
g_FieldOffsetTable680,
g_FieldOffsetTable681,
g_FieldOffsetTable682,
g_FieldOffsetTable683,
g_FieldOffsetTable684,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable689,
g_FieldOffsetTable690,
g_FieldOffsetTable691,
NULL,
NULL,
g_FieldOffsetTable694,
g_FieldOffsetTable695,
g_FieldOffsetTable696,
NULL,
g_FieldOffsetTable698,
g_FieldOffsetTable699,
g_FieldOffsetTable700,
NULL,
g_FieldOffsetTable702,
NULL,
g_FieldOffsetTable704,
g_FieldOffsetTable705,
NULL,
g_FieldOffsetTable707,
g_FieldOffsetTable708,
g_FieldOffsetTable709,
g_FieldOffsetTable710,
g_FieldOffsetTable711,
NULL,
NULL,
NULL,
g_FieldOffsetTable715,
g_FieldOffsetTable716,
NULL,
g_FieldOffsetTable718,
g_FieldOffsetTable719,
g_FieldOffsetTable720,
NULL,
g_FieldOffsetTable722,
NULL,
g_FieldOffsetTable724,
NULL,
g_FieldOffsetTable726,
g_FieldOffsetTable727,
g_FieldOffsetTable728,
NULL,
NULL,
g_FieldOffsetTable731,
g_FieldOffsetTable732,
NULL,
NULL,
g_FieldOffsetTable735,
NULL,
NULL,
NULL,
g_FieldOffsetTable739,
g_FieldOffsetTable740,
g_FieldOffsetTable741,
g_FieldOffsetTable742,
g_FieldOffsetTable743,
g_FieldOffsetTable744,
g_FieldOffsetTable745,
g_FieldOffsetTable746,
g_FieldOffsetTable747,
NULL,
NULL,
g_FieldOffsetTable750,
NULL,
NULL,
g_FieldOffsetTable753,
g_FieldOffsetTable754,
g_FieldOffsetTable755,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable761,
g_FieldOffsetTable762,
g_FieldOffsetTable763,
g_FieldOffsetTable764,
g_FieldOffsetTable765,
g_FieldOffsetTable766,
g_FieldOffsetTable767,
g_FieldOffsetTable768,
g_FieldOffsetTable769,
g_FieldOffsetTable770,
g_FieldOffsetTable771,
NULL,
NULL,
g_FieldOffsetTable774,
NULL,
NULL,
g_FieldOffsetTable777,
NULL,
g_FieldOffsetTable779,
g_FieldOffsetTable780,
g_FieldOffsetTable781,
NULL,
NULL,
g_FieldOffsetTable784,
NULL,
g_FieldOffsetTable786,
g_FieldOffsetTable787,
g_FieldOffsetTable788,
g_FieldOffsetTable789,
g_FieldOffsetTable790,
NULL,
g_FieldOffsetTable792,
g_FieldOffsetTable793,
g_FieldOffsetTable794,
g_FieldOffsetTable795,
g_FieldOffsetTable796,
g_FieldOffsetTable797,
g_FieldOffsetTable798,
g_FieldOffsetTable799,
g_FieldOffsetTable800,
g_FieldOffsetTable801,
g_FieldOffsetTable802,
NULL,
g_FieldOffsetTable804,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable810,
g_FieldOffsetTable811,
NULL,
g_FieldOffsetTable813,
NULL,
NULL,
NULL,
g_FieldOffsetTable817,
NULL,
g_FieldOffsetTable819,
NULL,
g_FieldOffsetTable821,
g_FieldOffsetTable822,
NULL,
g_FieldOffsetTable824,
NULL,
g_FieldOffsetTable826,
NULL,
g_FieldOffsetTable828,
NULL,
g_FieldOffsetTable830,
g_FieldOffsetTable831,
g_FieldOffsetTable832,
g_FieldOffsetTable833,
NULL,
g_FieldOffsetTable835,
NULL,
g_FieldOffsetTable837,
g_FieldOffsetTable838,
NULL,
g_FieldOffsetTable840,
g_FieldOffsetTable841,
NULL,
g_FieldOffsetTable843,
g_FieldOffsetTable844,
g_FieldOffsetTable845,
g_FieldOffsetTable846,
g_FieldOffsetTable847,
g_FieldOffsetTable848,
NULL,
g_FieldOffsetTable850,
g_FieldOffsetTable851,
g_FieldOffsetTable852,
g_FieldOffsetTable853,
g_FieldOffsetTable854,
g_FieldOffsetTable855,
g_FieldOffsetTable856,
g_FieldOffsetTable857,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable862,
g_FieldOffsetTable863,
g_FieldOffsetTable864,
NULL,
NULL,
NULL,
g_FieldOffsetTable868,
NULL,
g_FieldOffsetTable870,
g_FieldOffsetTable871,
NULL,
NULL,
NULL,
g_FieldOffsetTable875,
g_FieldOffsetTable876,
g_FieldOffsetTable877,
g_FieldOffsetTable878,
NULL,
NULL,
g_FieldOffsetTable881,
NULL,
g_FieldOffsetTable883,
g_FieldOffsetTable884,
g_FieldOffsetTable885,
g_FieldOffsetTable886,
g_FieldOffsetTable887,
g_FieldOffsetTable888,
g_FieldOffsetTable889,
g_FieldOffsetTable890,
NULL,
NULL,
NULL,
g_FieldOffsetTable894,
g_FieldOffsetTable895,
g_FieldOffsetTable896,
g_FieldOffsetTable897,
g_FieldOffsetTable898,
g_FieldOffsetTable899,
g_FieldOffsetTable900,
g_FieldOffsetTable901,
g_FieldOffsetTable902,
g_FieldOffsetTable903,
NULL,
g_FieldOffsetTable905,
g_FieldOffsetTable906,
NULL,
g_FieldOffsetTable908,
g_FieldOffsetTable909,
g_FieldOffsetTable910,
g_FieldOffsetTable911,
g_FieldOffsetTable912,
NULL,
NULL,
g_FieldOffsetTable915,
g_FieldOffsetTable916,
g_FieldOffsetTable917,
g_FieldOffsetTable918,
g_FieldOffsetTable919,
g_FieldOffsetTable920,
NULL,
g_FieldOffsetTable922,
g_FieldOffsetTable923,
g_FieldOffsetTable924,
g_FieldOffsetTable925,
g_FieldOffsetTable926,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable946,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable972,
g_FieldOffsetTable973,
g_FieldOffsetTable974,
NULL,
g_FieldOffsetTable976,
NULL,
NULL,
NULL,
g_FieldOffsetTable980,
NULL,
NULL,
NULL,
g_FieldOffsetTable984,
g_FieldOffsetTable985,
g_FieldOffsetTable986,
NULL,
g_FieldOffsetTable988,
NULL,
g_FieldOffsetTable990,
NULL,
g_FieldOffsetTable992,
g_FieldOffsetTable993,
NULL,
g_FieldOffsetTable995,
g_FieldOffsetTable996,
g_FieldOffsetTable997,
g_FieldOffsetTable998,
NULL,
g_FieldOffsetTable1000,
g_FieldOffsetTable1001,
g_FieldOffsetTable1002,
g_FieldOffsetTable1003,
g_FieldOffsetTable1004,
NULL,
g_FieldOffsetTable1006,
g_FieldOffsetTable1007,
g_FieldOffsetTable1008,
g_FieldOffsetTable1009,
g_FieldOffsetTable1010,
g_FieldOffsetTable1011,
g_FieldOffsetTable1012,
g_FieldOffsetTable1013,
g_FieldOffsetTable1014,
g_FieldOffsetTable1015,
g_FieldOffsetTable1016,
g_FieldOffsetTable1017,
g_FieldOffsetTable1018,
g_FieldOffsetTable1019,
g_FieldOffsetTable1020,
g_FieldOffsetTable1021,
g_FieldOffsetTable1022,
g_FieldOffsetTable1023,
g_FieldOffsetTable1024,
g_FieldOffsetTable1025,
g_FieldOffsetTable1026,
g_FieldOffsetTable1027,
g_FieldOffsetTable1028,
g_FieldOffsetTable1029,
g_FieldOffsetTable1030,
g_FieldOffsetTable1031,
g_FieldOffsetTable1032,
NULL,
g_FieldOffsetTable1034,
NULL,
g_FieldOffsetTable1036,
g_FieldOffsetTable1037,
g_FieldOffsetTable1038,
g_FieldOffsetTable1039,
g_FieldOffsetTable1040,
g_FieldOffsetTable1041,
g_FieldOffsetTable1042,
g_FieldOffsetTable1043,
g_FieldOffsetTable1044,
g_FieldOffsetTable1045,
g_FieldOffsetTable1046,
g_FieldOffsetTable1047,
g_FieldOffsetTable1048,
g_FieldOffsetTable1049,
g_FieldOffsetTable1050,
g_FieldOffsetTable1051,
NULL,
g_FieldOffsetTable1053,
g_FieldOffsetTable1054,
g_FieldOffsetTable1055,
g_FieldOffsetTable1056,
g_FieldOffsetTable1057,
g_FieldOffsetTable1058,
g_FieldOffsetTable1059,
g_FieldOffsetTable1060,
g_FieldOffsetTable1061,
g_FieldOffsetTable1062,
g_FieldOffsetTable1063,
g_FieldOffsetTable1064,
g_FieldOffsetTable1065,
g_FieldOffsetTable1066,
g_FieldOffsetTable1067,
NULL,
g_FieldOffsetTable1069,
g_FieldOffsetTable1070,
NULL,
g_FieldOffsetTable1072,
g_FieldOffsetTable1073,
g_FieldOffsetTable1074,
g_FieldOffsetTable1075,
NULL,
g_FieldOffsetTable1077,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable1083,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable1095,
g_FieldOffsetTable1096,
g_FieldOffsetTable1097,
g_FieldOffsetTable1098,
g_FieldOffsetTable1099,
g_FieldOffsetTable1100,
g_FieldOffsetTable1101,
g_FieldOffsetTable1102,
g_FieldOffsetTable1103,
g_FieldOffsetTable1104,
g_FieldOffsetTable1105,
g_FieldOffsetTable1106,
g_FieldOffsetTable1107,
g_FieldOffsetTable1108,
g_FieldOffsetTable1109,
g_FieldOffsetTable1110,
g_FieldOffsetTable1111,
NULL,
g_FieldOffsetTable1113,
g_FieldOffsetTable1114,
g_FieldOffsetTable1115,
NULL,
NULL,
NULL,
g_FieldOffsetTable1119,
g_FieldOffsetTable1120,
g_FieldOffsetTable1121,
NULL,
g_FieldOffsetTable1123,
NULL,
NULL,
g_FieldOffsetTable1126,
NULL,
NULL,
g_FieldOffsetTable1129,
g_FieldOffsetTable1130,
NULL,
NULL,
g_FieldOffsetTable1133,
g_FieldOffsetTable1134,
NULL,
NULL,
g_FieldOffsetTable1137,
g_FieldOffsetTable1138,
g_FieldOffsetTable1139,
g_FieldOffsetTable1140,
g_FieldOffsetTable1141,
g_FieldOffsetTable1142,
g_FieldOffsetTable1143,
g_FieldOffsetTable1144,
g_FieldOffsetTable1145,
g_FieldOffsetTable1146,
g_FieldOffsetTable1147,
g_FieldOffsetTable1148,
g_FieldOffsetTable1149,
g_FieldOffsetTable1150,
g_FieldOffsetTable1151,
NULL,
g_FieldOffsetTable1153,
NULL,
g_FieldOffsetTable1155,
g_FieldOffsetTable1156,
g_FieldOffsetTable1157,
g_FieldOffsetTable1158,
g_FieldOffsetTable1159,
g_FieldOffsetTable1160,
g_FieldOffsetTable1161,
g_FieldOffsetTable1162,
g_FieldOffsetTable1163,
g_FieldOffsetTable1164,
g_FieldOffsetTable1165,
g_FieldOffsetTable1166,
g_FieldOffsetTable1167,
g_FieldOffsetTable1168,
g_FieldOffsetTable1169,
g_FieldOffsetTable1170,
g_FieldOffsetTable1171,
g_FieldOffsetTable1172,
g_FieldOffsetTable1173,
g_FieldOffsetTable1174,
g_FieldOffsetTable1175,
g_FieldOffsetTable1176,
g_FieldOffsetTable1177,
g_FieldOffsetTable1178,
g_FieldOffsetTable1179,
g_FieldOffsetTable1180,
g_FieldOffsetTable1181,
g_FieldOffsetTable1182,
g_FieldOffsetTable1183,
g_FieldOffsetTable1184,
g_FieldOffsetTable1185,
g_FieldOffsetTable1186,
g_FieldOffsetTable1187,
g_FieldOffsetTable1188,
g_FieldOffsetTable1189,
g_FieldOffsetTable1190,
g_FieldOffsetTable1191,
g_FieldOffsetTable1192,
g_FieldOffsetTable1193,
g_FieldOffsetTable1194,
NULL,
NULL,
g_FieldOffsetTable1197,
g_FieldOffsetTable1198,
g_FieldOffsetTable1199,
g_FieldOffsetTable1200,
g_FieldOffsetTable1201,
NULL,
NULL,
NULL,
g_FieldOffsetTable1205,
g_FieldOffsetTable1206,
g_FieldOffsetTable1207,
g_FieldOffsetTable1208,
g_FieldOffsetTable1209,
g_FieldOffsetTable1210,
g_FieldOffsetTable1211,
g_FieldOffsetTable1212,
g_FieldOffsetTable1213,
g_FieldOffsetTable1214,
g_FieldOffsetTable1215,
g_FieldOffsetTable1216,
g_FieldOffsetTable1217,
NULL,
g_FieldOffsetTable1219,
g_FieldOffsetTable1220,
NULL,
NULL,
g_FieldOffsetTable1223,
NULL,
g_FieldOffsetTable1225,
g_FieldOffsetTable1226,
g_FieldOffsetTable1227,
NULL,
g_FieldOffsetTable1229,
NULL,
g_FieldOffsetTable1231,
g_FieldOffsetTable1232,
NULL,
g_FieldOffsetTable1234,
g_FieldOffsetTable1235,
g_FieldOffsetTable1236,
g_FieldOffsetTable1237,
g_FieldOffsetTable1238,
g_FieldOffsetTable1239,
NULL,
NULL,
g_FieldOffsetTable1242,
g_FieldOffsetTable1243,
NULL,
g_FieldOffsetTable1245,
g_FieldOffsetTable1246,
g_FieldOffsetTable1247,
g_FieldOffsetTable1248,
NULL,
NULL,
g_FieldOffsetTable1251,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable1258,
g_FieldOffsetTable1259,
g_FieldOffsetTable1260,
g_FieldOffsetTable1261,
g_FieldOffsetTable1262,
g_FieldOffsetTable1263,
NULL,
NULL,
g_FieldOffsetTable1266,
g_FieldOffsetTable1267,
NULL,
NULL,
g_FieldOffsetTable1270,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable1277,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable1284,
NULL,
g_FieldOffsetTable1286,
NULL,
NULL,
NULL,
g_FieldOffsetTable1290,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable1300,
g_FieldOffsetTable1301,
g_FieldOffsetTable1302,
g_FieldOffsetTable1303,
g_FieldOffsetTable1304,
g_FieldOffsetTable1305,
g_FieldOffsetTable1306,
g_FieldOffsetTable1307,
NULL,
g_FieldOffsetTable1309,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable1314,
g_FieldOffsetTable1315,
g_FieldOffsetTable1316,
g_FieldOffsetTable1317,
NULL,
NULL,
g_FieldOffsetTable1320,
g_FieldOffsetTable1321,
g_FieldOffsetTable1322,
NULL,
NULL,
g_FieldOffsetTable1325,
g_FieldOffsetTable1326,
NULL,
g_FieldOffsetTable1328,
NULL,
g_FieldOffsetTable1330,
g_FieldOffsetTable1331,
g_FieldOffsetTable1332,
NULL,
NULL,
NULL,
g_FieldOffsetTable1336,
NULL,
NULL,
g_FieldOffsetTable1339,
g_FieldOffsetTable1340,
g_FieldOffsetTable1341,
g_FieldOffsetTable1342,
g_FieldOffsetTable1343,
g_FieldOffsetTable1344,
NULL,
g_FieldOffsetTable1346,
g_FieldOffsetTable1347,
g_FieldOffsetTable1348,
g_FieldOffsetTable1349,
NULL,
g_FieldOffsetTable1351,
NULL,
NULL,
NULL,
g_FieldOffsetTable1355,
g_FieldOffsetTable1356,
NULL,
g_FieldOffsetTable1358,
NULL,
g_FieldOffsetTable1360,
g_FieldOffsetTable1361,
NULL,
g_FieldOffsetTable1363,
NULL,
NULL,
NULL,
g_FieldOffsetTable1367,
g_FieldOffsetTable1368,
NULL,
NULL,
NULL,
g_FieldOffsetTable1372,
NULL,
NULL,
NULL,
g_FieldOffsetTable1376,
NULL,
NULL,
NULL,
g_FieldOffsetTable1380,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable1387,
NULL,
g_FieldOffsetTable1389,
g_FieldOffsetTable1390,
g_FieldOffsetTable1391,
g_FieldOffsetTable1392,
g_FieldOffsetTable1393,
g_FieldOffsetTable1394,
g_FieldOffsetTable1395,
g_FieldOffsetTable1396,
g_FieldOffsetTable1397,
g_FieldOffsetTable1398,
g_FieldOffsetTable1399,
g_FieldOffsetTable1400,
g_FieldOffsetTable1401,
g_FieldOffsetTable1402,
g_FieldOffsetTable1403,
g_FieldOffsetTable1404,
g_FieldOffsetTable1405,
g_FieldOffsetTable1406,
g_FieldOffsetTable1407,
g_FieldOffsetTable1408,
g_FieldOffsetTable1409,
g_FieldOffsetTable1410,
g_FieldOffsetTable1411,
g_FieldOffsetTable1412,
g_FieldOffsetTable1413,
NULL,
g_FieldOffsetTable1415,
g_FieldOffsetTable1416,
g_FieldOffsetTable1417,
g_FieldOffsetTable1418,
NULL,
NULL,
g_FieldOffsetTable1421,
g_FieldOffsetTable1422,
g_FieldOffsetTable1423,
g_FieldOffsetTable1424,
g_FieldOffsetTable1425,
g_FieldOffsetTable1426,
g_FieldOffsetTable1427,
NULL,
g_FieldOffsetTable1429,
g_FieldOffsetTable1430,
NULL,
g_FieldOffsetTable1432,
g_FieldOffsetTable1433,
g_FieldOffsetTable1434,
g_FieldOffsetTable1435,
g_FieldOffsetTable1436,
NULL,
g_FieldOffsetTable1438,
NULL,
NULL,
g_FieldOffsetTable1441,
g_FieldOffsetTable1442,
NULL,
g_FieldOffsetTable1444,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable1571,
g_FieldOffsetTable1572,
NULL,
g_FieldOffsetTable1574,
NULL,
g_FieldOffsetTable1576,
g_FieldOffsetTable1577,
g_FieldOffsetTable1578,
g_FieldOffsetTable1579,
g_FieldOffsetTable1580,
NULL,
g_FieldOffsetTable1582,
g_FieldOffsetTable1583,
g_FieldOffsetTable1584,
g_FieldOffsetTable1585,
g_FieldOffsetTable1586,
g_FieldOffsetTable1587,
g_FieldOffsetTable1588,
g_FieldOffsetTable1589,
NULL,
g_FieldOffsetTable1591,
g_FieldOffsetTable1592,
NULL,
g_FieldOffsetTable1594,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable1601,
g_FieldOffsetTable1602,
g_FieldOffsetTable1603,
NULL,
g_FieldOffsetTable1605,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable1614,
NULL,
g_FieldOffsetTable1616,
g_FieldOffsetTable1617,
g_FieldOffsetTable1618,
g_FieldOffsetTable1619,
g_FieldOffsetTable1620,
g_FieldOffsetTable1621,
g_FieldOffsetTable1622,
g_FieldOffsetTable1623,
NULL,
g_FieldOffsetTable1625,
g_FieldOffsetTable1626,
g_FieldOffsetTable1627,
g_FieldOffsetTable1628,
g_FieldOffsetTable1629,
g_FieldOffsetTable1630,
g_FieldOffsetTable1631,
g_FieldOffsetTable1632,
g_FieldOffsetTable1633,
g_FieldOffsetTable1634,
g_FieldOffsetTable1635,
NULL,
g_FieldOffsetTable1637,
NULL,
g_FieldOffsetTable1639,
NULL,
g_FieldOffsetTable1641,
NULL,
g_FieldOffsetTable1643,
NULL,
g_FieldOffsetTable1645,
NULL,
g_FieldOffsetTable1647,
g_FieldOffsetTable1648,
g_FieldOffsetTable1649,
g_FieldOffsetTable1650,
NULL,
NULL,
g_FieldOffsetTable1653,
g_FieldOffsetTable1654,
NULL,
g_FieldOffsetTable1656,
g_FieldOffsetTable1657,
NULL,
NULL,
NULL,
g_FieldOffsetTable1661,
g_FieldOffsetTable1662,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable1680,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable1685,
g_FieldOffsetTable1686,
NULL,
NULL,
NULL,
g_FieldOffsetTable1690,
NULL,
g_FieldOffsetTable1692,
g_FieldOffsetTable1693,
g_FieldOffsetTable1694,
g_FieldOffsetTable1695,
g_FieldOffsetTable1696,
g_FieldOffsetTable1697,
g_FieldOffsetTable1698,
g_FieldOffsetTable1699,
NULL,
NULL,
NULL,
g_FieldOffsetTable1703,
g_FieldOffsetTable1704,
NULL,
g_FieldOffsetTable1706,
g_FieldOffsetTable1707,
g_FieldOffsetTable1708,
g_FieldOffsetTable1709,
g_FieldOffsetTable1710,
NULL,
NULL,
g_FieldOffsetTable1713,
g_FieldOffsetTable1714,
g_FieldOffsetTable1715,
g_FieldOffsetTable1716,
NULL,
NULL,
g_FieldOffsetTable1719,
g_FieldOffsetTable1720,
g_FieldOffsetTable1721,
g_FieldOffsetTable1722,
g_FieldOffsetTable1723,
g_FieldOffsetTable1724,
g_FieldOffsetTable1725,
NULL,
NULL,
g_FieldOffsetTable1728,
g_FieldOffsetTable1729,
g_FieldOffsetTable1730,
g_FieldOffsetTable1731,
NULL,
NULL,
NULL,
g_FieldOffsetTable1735,
g_FieldOffsetTable1736,
g_FieldOffsetTable1737,
g_FieldOffsetTable1738,
g_FieldOffsetTable1739,
NULL,
g_FieldOffsetTable1741,
g_FieldOffsetTable1742,
g_FieldOffsetTable1743,
NULL,
NULL,
g_FieldOffsetTable1746,
g_FieldOffsetTable1747,
NULL,
NULL,
g_FieldOffsetTable1750,
NULL,
g_FieldOffsetTable1752,
NULL,
NULL,
g_FieldOffsetTable1755,
g_FieldOffsetTable1756,
g_FieldOffsetTable1757,
g_FieldOffsetTable1758,
g_FieldOffsetTable1759,
g_FieldOffsetTable1760,
g_FieldOffsetTable1761,
NULL,
g_FieldOffsetTable1763,
g_FieldOffsetTable1764,
g_FieldOffsetTable1765,
g_FieldOffsetTable1766,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable1772,
g_FieldOffsetTable1773,
g_FieldOffsetTable1774,
g_FieldOffsetTable1775,
g_FieldOffsetTable1776,
g_FieldOffsetTable1777,
g_FieldOffsetTable1778,
g_FieldOffsetTable1779,
g_FieldOffsetTable1780,
g_FieldOffsetTable1781,
g_FieldOffsetTable1782,
g_FieldOffsetTable1783,
g_FieldOffsetTable1784,
g_FieldOffsetTable1785,
NULL,
g_FieldOffsetTable1787,
g_FieldOffsetTable1788,
NULL,
g_FieldOffsetTable1790,
g_FieldOffsetTable1791,
g_FieldOffsetTable1792,
NULL,
g_FieldOffsetTable1794,
g_FieldOffsetTable1795,
NULL,
NULL,
g_FieldOffsetTable1798,
g_FieldOffsetTable1799,
g_FieldOffsetTable1800,
g_FieldOffsetTable1801,
g_FieldOffsetTable1802,
g_FieldOffsetTable1803,
g_FieldOffsetTable1804,
g_FieldOffsetTable1805,
g_FieldOffsetTable1806,
g_FieldOffsetTable1807,
NULL,
NULL,
g_FieldOffsetTable1810,
NULL,
g_FieldOffsetTable1812,
NULL,
NULL,
NULL,
g_FieldOffsetTable1816,
g_FieldOffsetTable1817,
NULL,
g_FieldOffsetTable1819,
g_FieldOffsetTable1820,
g_FieldOffsetTable1821,
g_FieldOffsetTable1822,
g_FieldOffsetTable1823,
g_FieldOffsetTable1824,
g_FieldOffsetTable1825,
g_FieldOffsetTable1826,
g_FieldOffsetTable1827,
g_FieldOffsetTable1828,
g_FieldOffsetTable1829,
g_FieldOffsetTable1830,
NULL,
NULL,
g_FieldOffsetTable1833,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable1838,
g_FieldOffsetTable1839,
g_FieldOffsetTable1840,
NULL,
g_FieldOffsetTable1842,
NULL,
g_FieldOffsetTable1844,
g_FieldOffsetTable1845,
g_FieldOffsetTable1846,
g_FieldOffsetTable1847,
NULL,
NULL,
g_FieldOffsetTable1850,
g_FieldOffsetTable1851,
NULL,
g_FieldOffsetTable1853,
g_FieldOffsetTable1854,
g_FieldOffsetTable1855,
g_FieldOffsetTable1856,
g_FieldOffsetTable1857,
g_FieldOffsetTable1858,
NULL,
g_FieldOffsetTable1860,
g_FieldOffsetTable1861,
g_FieldOffsetTable1862,
g_FieldOffsetTable1863,
NULL,
g_FieldOffsetTable1865,
g_FieldOffsetTable1866,
g_FieldOffsetTable1867,
NULL,
NULL,
g_FieldOffsetTable1870,
g_FieldOffsetTable1871,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable1876,
g_FieldOffsetTable1877,
NULL,
NULL,
g_FieldOffsetTable1880,
g_FieldOffsetTable1881,
NULL,
NULL,
NULL,
g_FieldOffsetTable1885,
g_FieldOffsetTable1886,
g_FieldOffsetTable1887,
g_FieldOffsetTable1888,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable1896,
g_FieldOffsetTable1897,
NULL,
NULL,
g_FieldOffsetTable1900,
g_FieldOffsetTable1901,
NULL,
NULL,
g_FieldOffsetTable1904,
NULL,
NULL,
g_FieldOffsetTable1907,
g_FieldOffsetTable1908,
NULL,
NULL,
g_FieldOffsetTable1911,
g_FieldOffsetTable1912,
NULL,
g_FieldOffsetTable1914,
NULL,
g_FieldOffsetTable1916,
NULL,
g_FieldOffsetTable1918,
g_FieldOffsetTable1919,
NULL,
NULL,
g_FieldOffsetTable1922,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable1941,
g_FieldOffsetTable1942,
NULL,
g_FieldOffsetTable1944,
g_FieldOffsetTable1945,
g_FieldOffsetTable1946,
NULL,
g_FieldOffsetTable1948,
g_FieldOffsetTable1949,
g_FieldOffsetTable1950,
NULL,
g_FieldOffsetTable1952,
g_FieldOffsetTable1953,
g_FieldOffsetTable1954,
g_FieldOffsetTable1955,
g_FieldOffsetTable1956,
g_FieldOffsetTable1957,
NULL,
g_FieldOffsetTable1959,
g_FieldOffsetTable1960,
g_FieldOffsetTable1961,
g_FieldOffsetTable1962,
g_FieldOffsetTable1963,
g_FieldOffsetTable1964,
g_FieldOffsetTable1965,
g_FieldOffsetTable1966,
NULL,
g_FieldOffsetTable1968,
g_FieldOffsetTable1969,
NULL,
g_FieldOffsetTable1971,
g_FieldOffsetTable1972,
NULL,
g_FieldOffsetTable1974,
NULL,
g_FieldOffsetTable1976,
g_FieldOffsetTable1977,
g_FieldOffsetTable1978,
g_FieldOffsetTable1979,
NULL,
g_FieldOffsetTable1981,
g_FieldOffsetTable1982,
NULL,
g_FieldOffsetTable1984,
g_FieldOffsetTable1985,
g_FieldOffsetTable1986,
g_FieldOffsetTable1987,
g_FieldOffsetTable1988,
g_FieldOffsetTable1989,
g_FieldOffsetTable1990,
g_FieldOffsetTable1991,
NULL,
g_FieldOffsetTable1993,
g_FieldOffsetTable1994,
g_FieldOffsetTable1995,
g_FieldOffsetTable1996,
g_FieldOffsetTable1997,
g_FieldOffsetTable1998,
g_FieldOffsetTable1999,
g_FieldOffsetTable2000,
NULL,
NULL,
NULL,
g_FieldOffsetTable2004,
g_FieldOffsetTable2005,
g_FieldOffsetTable2006,
g_FieldOffsetTable2007,
g_FieldOffsetTable2008,
g_FieldOffsetTable2009,
g_FieldOffsetTable2010,
g_FieldOffsetTable2011,
g_FieldOffsetTable2012,
g_FieldOffsetTable2013,
g_FieldOffsetTable2014,
g_FieldOffsetTable2015,
g_FieldOffsetTable2016,
NULL,
NULL,
NULL,
g_FieldOffsetTable2020,
g_FieldOffsetTable2021,
g_FieldOffsetTable2022,
g_FieldOffsetTable2023,
NULL,
g_FieldOffsetTable2025,
NULL,
NULL,
g_FieldOffsetTable2028,
g_FieldOffsetTable2029,
g_FieldOffsetTable2030,
g_FieldOffsetTable2031,
g_FieldOffsetTable2032,
g_FieldOffsetTable2033,
g_FieldOffsetTable2034,
NULL,
g_FieldOffsetTable2036,
g_FieldOffsetTable2037,
NULL,
g_FieldOffsetTable2039,
g_FieldOffsetTable2040,
g_FieldOffsetTable2041,
g_FieldOffsetTable2042,
g_FieldOffsetTable2043,
NULL,
g_FieldOffsetTable2045,
g_FieldOffsetTable2046,
NULL,
g_FieldOffsetTable2048,
g_FieldOffsetTable2049,
g_FieldOffsetTable2050,
g_FieldOffsetTable2051,
g_FieldOffsetTable2052,
g_FieldOffsetTable2053,
g_FieldOffsetTable2054,
NULL,
g_FieldOffsetTable2056,
g_FieldOffsetTable2057,
NULL,
NULL,
NULL,
g_FieldOffsetTable2061,
g_FieldOffsetTable2062,
g_FieldOffsetTable2063,
g_FieldOffsetTable2064,
g_FieldOffsetTable2065,
g_FieldOffsetTable2066,
g_FieldOffsetTable2067,
g_FieldOffsetTable2068,
g_FieldOffsetTable2069,
g_FieldOffsetTable2070,
g_FieldOffsetTable2071,
g_FieldOffsetTable2072,
g_FieldOffsetTable2073,
NULL,
g_FieldOffsetTable2075,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable2081,
g_FieldOffsetTable2082,
g_FieldOffsetTable2083,
g_FieldOffsetTable2084,
g_FieldOffsetTable2085,
NULL,
NULL,
g_FieldOffsetTable2088,
g_FieldOffsetTable2089,
g_FieldOffsetTable2090,
g_FieldOffsetTable2091,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable2098,
NULL,
NULL,
g_FieldOffsetTable2101,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable2106,
g_FieldOffsetTable2107,
NULL,
NULL,
g_FieldOffsetTable2110,
g_FieldOffsetTable2111,
g_FieldOffsetTable2112,
g_FieldOffsetTable2113,
g_FieldOffsetTable2114,
g_FieldOffsetTable2115,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable2121,
g_FieldOffsetTable2122,
NULL,
g_FieldOffsetTable2124,
g_FieldOffsetTable2125,
g_FieldOffsetTable2126,
g_FieldOffsetTable2127,
g_FieldOffsetTable2128,
g_FieldOffsetTable2129,
g_FieldOffsetTable2130,
g_FieldOffsetTable2131,
g_FieldOffsetTable2132,
g_FieldOffsetTable2133,
g_FieldOffsetTable2134,
g_FieldOffsetTable2135,
g_FieldOffsetTable2136,
g_FieldOffsetTable2137,
g_FieldOffsetTable2138,
g_FieldOffsetTable2139,
g_FieldOffsetTable2140,
g_FieldOffsetTable2141,
g_FieldOffsetTable2142,
g_FieldOffsetTable2143,
g_FieldOffsetTable2144,
NULL,
g_FieldOffsetTable2146,
g_FieldOffsetTable2147,
g_FieldOffsetTable2148,
g_FieldOffsetTable2149,
g_FieldOffsetTable2150,
g_FieldOffsetTable2151,
g_FieldOffsetTable2152,
g_FieldOffsetTable2153,
g_FieldOffsetTable2154,
g_FieldOffsetTable2155,
g_FieldOffsetTable2156,
g_FieldOffsetTable2157,
g_FieldOffsetTable2158,
g_FieldOffsetTable2159,
g_FieldOffsetTable2160,
g_FieldOffsetTable2161,
g_FieldOffsetTable2162,
g_FieldOffsetTable2163,
g_FieldOffsetTable2164,
g_FieldOffsetTable2165,
g_FieldOffsetTable2166,
g_FieldOffsetTable2167,
g_FieldOffsetTable2168,
g_FieldOffsetTable2169,
g_FieldOffsetTable2170,
g_FieldOffsetTable2171,
g_FieldOffsetTable2172,
g_FieldOffsetTable2173,
g_FieldOffsetTable2174,
g_FieldOffsetTable2175,
g_FieldOffsetTable2176,
NULL,
g_FieldOffsetTable2178,
g_FieldOffsetTable2179,
g_FieldOffsetTable2180,
g_FieldOffsetTable2181,
g_FieldOffsetTable2182,
g_FieldOffsetTable2183,
g_FieldOffsetTable2184,
g_FieldOffsetTable2185,
g_FieldOffsetTable2186,
g_FieldOffsetTable2187,
g_FieldOffsetTable2188,
NULL,
g_FieldOffsetTable2190,
g_FieldOffsetTable2191,
g_FieldOffsetTable2192,
g_FieldOffsetTable2193,
g_FieldOffsetTable2194,
g_FieldOffsetTable2195,
g_FieldOffsetTable2196,
g_FieldOffsetTable2197,
g_FieldOffsetTable2198,
g_FieldOffsetTable2199,
NULL,
g_FieldOffsetTable2201,
g_FieldOffsetTable2202,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
g_FieldOffsetTable2246,
g_FieldOffsetTable2247,
g_FieldOffsetTable2248,
g_FieldOffsetTable2249,
g_FieldOffsetTable2250,
g_FieldOffsetTable2251,
NULL,
g_FieldOffsetTable2253,
g_FieldOffsetTable2254,
g_FieldOffsetTable2255,
g_FieldOffsetTable2256,
g_FieldOffsetTable2257,
g_FieldOffsetTable2258,
g_FieldOffsetTable2259,
g_FieldOffsetTable2260,
g_FieldOffsetTable2261,
g_FieldOffsetTable2262,
g_FieldOffsetTable2263,
g_FieldOffsetTable2264,
g_FieldOffsetTable2265,
g_FieldOffsetTable2266,
g_FieldOffsetTable2267,
g_FieldOffsetTable2268,
g_FieldOffsetTable2269,
g_FieldOffsetTable2270,
g_FieldOffsetTable2271,
g_FieldOffsetTable2272,
g_FieldOffsetTable2273,
g_FieldOffsetTable2274,
g_FieldOffsetTable2275,
g_FieldOffsetTable2276,
g_FieldOffsetTable2277,
g_FieldOffsetTable2278,
g_FieldOffsetTable2279,
g_FieldOffsetTable2280,
g_FieldOffsetTable2281,
g_FieldOffsetTable2282,
g_FieldOffsetTable2283,
g_FieldOffsetTable2284,
g_FieldOffsetTable2285,
NULL,
g_FieldOffsetTable2287,
g_FieldOffsetTable2288,
g_FieldOffsetTable2289,
g_FieldOffsetTable2290,
g_FieldOffsetTable2291,
g_FieldOffsetTable2292,
g_FieldOffsetTable2293,
g_FieldOffsetTable2294,
g_FieldOffsetTable2295,
g_FieldOffsetTable2296,
g_FieldOffsetTable2297,
g_FieldOffsetTable2298,
g_FieldOffsetTable2299,
g_FieldOffsetTable2300,
g_FieldOffsetTable2301,
g_FieldOffsetTable2302,
};
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize0;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize3;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize4;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize5;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize6;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize7;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize8;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize9;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize10;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize11;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize12;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize13;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize14;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize15;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize16;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize17;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize18;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize19;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize20;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize21;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize22;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize23;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize24;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize25;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize26;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize27;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize28;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize29;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize30;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize31;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize32;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize33;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize34;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize35;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize36;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize37;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize38;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize39;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize40;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize41;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize42;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize43;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize44;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize45;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize46;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize47;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize48;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize49;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize50;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize51;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize52;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize53;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize54;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize55;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize56;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize57;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize58;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize59;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize60;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize61;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize62;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize63;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize64;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize65;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize66;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize67;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize68;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize69;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize70;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize71;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize72;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize73;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize74;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize75;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize76;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize77;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize78;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize79;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize80;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize81;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize82;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize83;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize84;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize85;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize86;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize87;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize88;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize89;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize90;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize91;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize92;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize93;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize94;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize95;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize96;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize97;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize98;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize99;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize100;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize101;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize102;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize103;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize104;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize105;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize106;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize107;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize108;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize109;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize110;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize111;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize112;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize113;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize114;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize115;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize116;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize117;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize118;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize119;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize120;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize121;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize122;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize123;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize124;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize125;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize126;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize127;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize128;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize129;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize130;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize131;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize132;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize133;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize134;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize135;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize136;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize137;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize138;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize139;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize140;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize141;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize142;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize143;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize144;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize145;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize146;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize147;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize148;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize149;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize150;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize151;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize152;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize153;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize154;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize155;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize156;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize157;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize158;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize159;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize160;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize161;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize162;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize163;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize164;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize165;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize166;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize167;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize168;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize169;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize170;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize171;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize172;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize173;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize174;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize175;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize176;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize177;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize178;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize179;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize180;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize181;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize182;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize183;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize184;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize185;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize186;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize187;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize188;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize189;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize190;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize191;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize192;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize193;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize194;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize195;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize196;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize197;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize198;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize199;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize200;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize201;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize202;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize203;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize204;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize205;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize206;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize207;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize208;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize209;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize210;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize211;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize212;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize213;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize214;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize215;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize216;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize217;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize218;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize219;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize220;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize221;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize222;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize223;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize224;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize225;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize226;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize227;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize228;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize229;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize230;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize231;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize232;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize233;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize234;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize235;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize236;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize237;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize238;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize239;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize240;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize241;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize242;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize243;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize244;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize245;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize246;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize247;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize248;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize249;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize250;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize251;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize252;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize253;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize254;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize255;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize256;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize257;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize258;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize259;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize260;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize261;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize262;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize263;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize264;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize265;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize266;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize267;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize268;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize269;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize270;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize271;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize272;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize273;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize274;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize275;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize276;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize277;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize278;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize279;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize280;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize281;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize282;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize283;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize284;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize285;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize286;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize287;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize288;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize289;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize290;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize291;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize292;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize293;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize294;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize295;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize296;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize297;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize298;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize299;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize300;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize301;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize302;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize303;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize304;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize305;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize306;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize307;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize308;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize309;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize310;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize311;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize312;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize313;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize314;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize315;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize316;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize317;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize318;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize319;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize320;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize321;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize322;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize323;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize324;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize325;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize326;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize327;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize328;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize329;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize330;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize331;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize332;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize333;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize334;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize335;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize336;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize337;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize338;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize339;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize340;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize341;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize342;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize343;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize344;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize345;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize346;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize347;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize348;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize349;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize350;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize351;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize352;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize353;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize354;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize355;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize356;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize357;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize358;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize359;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize360;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize361;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize362;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize363;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize364;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize365;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize366;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize367;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize368;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize369;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize370;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize371;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize372;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize373;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize374;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize375;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize376;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize377;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize378;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize379;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize380;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize381;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize382;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize383;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize384;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize385;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize386;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize387;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize388;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize389;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize390;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize391;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize392;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize393;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize394;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize395;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize396;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize397;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize398;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize399;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize400;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize401;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize402;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize403;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize404;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize405;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize406;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize407;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize408;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize409;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize410;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize411;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize412;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize413;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize414;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize415;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize416;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize417;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize418;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize419;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize420;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize421;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize422;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize423;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize424;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize425;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize426;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize427;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize428;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize429;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize430;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize431;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize432;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize433;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize434;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize435;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize436;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize437;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize438;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize439;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize440;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize441;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize442;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize443;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize444;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize445;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize446;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize447;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize448;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize449;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize450;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize451;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize452;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize453;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize454;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize455;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize456;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize457;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize458;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize459;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize460;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize461;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize462;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize463;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize464;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize465;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize466;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize467;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize468;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize469;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize470;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize471;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize472;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize473;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize474;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize475;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize476;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize477;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize478;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize479;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize480;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize481;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize482;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize483;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize484;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize485;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize486;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize487;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize488;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize489;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize490;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize491;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize492;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize493;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize494;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize495;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize496;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize497;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize498;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize499;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize500;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize501;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize502;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize503;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize504;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize505;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize506;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize507;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize508;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize509;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize510;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize511;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize512;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize513;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize514;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize515;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize516;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize517;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize518;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize519;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize520;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize521;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize522;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize523;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize524;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize525;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize526;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize527;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize528;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize529;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize530;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize531;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize532;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize533;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize534;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize535;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize536;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize537;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize538;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize539;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize540;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize541;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize542;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize543;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize544;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize545;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize546;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize547;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize548;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize549;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize550;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize551;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize552;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize553;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize554;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize555;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize556;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize557;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize558;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize559;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize560;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize561;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize562;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize563;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize564;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize565;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize566;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize567;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize568;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize569;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize570;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize571;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize572;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize573;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize574;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize575;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize576;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize577;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize578;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize579;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize580;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize581;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize582;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize583;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize584;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize585;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize586;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize587;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize588;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize589;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize590;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize591;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize592;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize593;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize594;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize595;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize596;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize597;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize598;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize599;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize600;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize601;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize602;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize603;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize604;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize605;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize606;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize607;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize608;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize609;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize610;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize611;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize612;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize613;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize614;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize615;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize616;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize617;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize618;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize619;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize620;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize621;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize622;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize623;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize624;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize625;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize626;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize627;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize628;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize629;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize630;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize631;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize632;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize633;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize634;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize635;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize636;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize637;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize638;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize639;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize640;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize641;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize642;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize643;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize644;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize645;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize646;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize647;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize648;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize649;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize650;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize651;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize652;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize653;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize654;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize655;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize656;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize657;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize658;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize659;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize660;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize661;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize662;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize663;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize664;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize665;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize666;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize667;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize668;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize669;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize670;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize671;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize672;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize673;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize674;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize675;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize676;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize677;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize678;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize679;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize680;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize681;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize682;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize683;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize684;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize685;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize686;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize687;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize688;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize689;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize690;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize691;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize692;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize693;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize694;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize695;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize696;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize697;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize698;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize699;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize700;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize701;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize702;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize703;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize704;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize705;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize706;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize707;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize708;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize709;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize710;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize711;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize712;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize713;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize714;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize715;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize716;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize717;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize718;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize719;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize720;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize721;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize722;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize723;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize724;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize725;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize726;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize727;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize728;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize729;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize730;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize731;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize732;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize733;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize734;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize735;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize736;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize737;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize738;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize739;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize740;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize741;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize742;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize743;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize744;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize745;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize746;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize747;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize748;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize749;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize750;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize751;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize752;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize753;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize754;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize755;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize756;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize757;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize758;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize759;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize760;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize761;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize762;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize763;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize764;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize765;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize766;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize767;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize768;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize769;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize770;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize771;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize772;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize773;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize774;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize775;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize776;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize777;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize778;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize779;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize780;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize781;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize782;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize783;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize784;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize785;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize786;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize787;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize788;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize789;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize790;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize791;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize792;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize793;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize794;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize795;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize796;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize797;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize798;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize799;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize800;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize801;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize802;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize803;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize804;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize805;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize806;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize807;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize808;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize809;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize810;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize811;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize812;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize813;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize814;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize815;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize816;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize817;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize818;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize819;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize820;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize821;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize822;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize823;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize824;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize825;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize826;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize827;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize828;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize829;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize830;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize831;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize832;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize833;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize834;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize835;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize836;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize837;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize838;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize839;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize840;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize841;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize842;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize843;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize844;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize845;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize846;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize847;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize848;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize849;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize850;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize851;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize852;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize853;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize854;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize855;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize856;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize857;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize858;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize859;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize860;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize861;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize862;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize863;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize864;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize865;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize866;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize867;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize868;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize869;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize870;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize871;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize872;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize873;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize874;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize875;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize876;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize877;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize878;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize879;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize880;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize881;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize882;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize883;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize884;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize885;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize886;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize887;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize888;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize889;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize890;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize891;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize892;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize893;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize894;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize895;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize896;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize897;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize898;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize899;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize900;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize901;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize902;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize903;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize904;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize905;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize906;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize907;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize908;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize909;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize910;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize911;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize912;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize913;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize914;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize915;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize916;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize917;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize918;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize919;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize920;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize921;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize922;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize923;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize924;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize925;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize926;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize927;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize928;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize929;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize930;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize931;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize932;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize933;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize934;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize935;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize936;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize937;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize938;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize939;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize940;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize941;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize942;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize943;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize944;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize945;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize946;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize947;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize948;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize949;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize950;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize951;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize952;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize953;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize954;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize955;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize956;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize957;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize958;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize959;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize960;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize961;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize962;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize963;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize964;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize965;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize966;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize967;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize968;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize969;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize970;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize971;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize972;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize973;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize974;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize975;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize976;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize977;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize978;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize979;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize980;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize981;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize982;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize983;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize984;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize985;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize986;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize987;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize988;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize989;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize990;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize991;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize992;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize993;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize994;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize995;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize996;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize997;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize998;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize999;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1000;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1001;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1002;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1003;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1004;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1005;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1006;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1007;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1008;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1009;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1010;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1011;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1012;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1013;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1014;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1015;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1016;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1017;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1018;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1019;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1020;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1021;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1022;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1023;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1024;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1025;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1026;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1027;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1028;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1029;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1030;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1031;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1032;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1033;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1034;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1035;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1036;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1037;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1038;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1039;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1040;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1041;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1042;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1043;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1044;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1045;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1046;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1047;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1048;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1049;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1050;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1051;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1052;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1053;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1054;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1055;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1056;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1057;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1058;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1059;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1060;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1061;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1062;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1063;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1064;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1065;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1066;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1067;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1068;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1069;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1070;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1071;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1072;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1073;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1074;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1075;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1076;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1077;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1078;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1079;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1080;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1081;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1082;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1083;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1084;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1085;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1086;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1087;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1088;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1089;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1090;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1091;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1092;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1093;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1094;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1095;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1096;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1097;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1098;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1099;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1100;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1101;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1102;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1103;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1104;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1105;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1106;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1107;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1108;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1109;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1110;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1111;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1112;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1113;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1114;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1115;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1116;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1117;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1118;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1119;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1120;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1121;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1122;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1123;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1124;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1125;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1126;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1127;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1128;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1129;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1130;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1131;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1132;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1133;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1134;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1135;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1136;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1137;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1138;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1139;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1140;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1141;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1142;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1143;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1144;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1145;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1146;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1147;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1148;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1149;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1150;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1151;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1152;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1153;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1154;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1155;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1156;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1157;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1158;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1159;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1160;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1161;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1162;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1163;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1164;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1165;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1166;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1167;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1168;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1169;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1170;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1171;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1172;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1173;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1174;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1175;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1176;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1177;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1178;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1179;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1180;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1181;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1182;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1183;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1184;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1185;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1186;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1187;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1188;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1189;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1190;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1191;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1192;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1193;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1194;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1195;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1196;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1197;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1198;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1199;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1200;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1201;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1202;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1203;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1204;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1205;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1206;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1207;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1208;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1209;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1210;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1211;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1212;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1213;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1214;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1215;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1216;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1217;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1218;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1219;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1220;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1221;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1222;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1223;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1224;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1225;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1226;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1227;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1228;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1229;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1230;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1231;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1232;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1233;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1234;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1235;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1236;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1237;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1238;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1239;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1240;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1241;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1242;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1243;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1244;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1245;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1246;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1247;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1248;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1249;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1250;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1251;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1252;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1253;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1254;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1255;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1256;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1257;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1258;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1259;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1260;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1261;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1262;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1263;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1264;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1265;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1266;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1267;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1268;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1269;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1270;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1271;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1272;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1273;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1274;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1275;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1276;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1277;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1278;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1279;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1280;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1281;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1282;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1283;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1284;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1285;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1286;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1287;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1288;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1289;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1290;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1291;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1292;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1293;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1294;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1295;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1296;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1297;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1298;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1299;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1300;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1301;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1302;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1303;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1304;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1305;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1306;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1307;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1308;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1309;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1310;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1311;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1312;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1313;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1314;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1315;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1316;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1317;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1318;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1319;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1320;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1321;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1322;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1323;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1324;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1325;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1326;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1327;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1328;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1329;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1330;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1331;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1332;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1333;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1334;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1335;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1336;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1337;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1338;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1339;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1340;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1341;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1342;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1343;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1344;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1345;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1346;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1347;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1348;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1349;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1350;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1351;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1352;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1353;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1354;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1355;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1356;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1357;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1358;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1359;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1360;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1361;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1362;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1363;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1364;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1365;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1366;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1367;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1368;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1369;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1370;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1371;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1372;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1373;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1374;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1375;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1376;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1377;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1378;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1379;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1380;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1381;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1382;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1383;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1384;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1385;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1386;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1387;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1388;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1389;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1390;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1391;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1392;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1393;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1394;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1395;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1396;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1397;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1398;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1399;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1400;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1401;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1402;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1403;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1404;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1405;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1406;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1407;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1408;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1409;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1410;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1411;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1412;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1413;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1414;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1415;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1416;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1417;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1418;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1419;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1420;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1421;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1422;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1423;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1424;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1425;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1426;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1427;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1428;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1429;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1430;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1431;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1432;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1433;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1434;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1435;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1436;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1437;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1438;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1439;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1440;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1441;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1442;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1443;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1444;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1445;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1446;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1447;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1448;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1449;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1450;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1451;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1452;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1453;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1454;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1455;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1456;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1457;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1458;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1459;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1460;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1461;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1462;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1463;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1464;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1465;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1466;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1467;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1468;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1469;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1470;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1471;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1472;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1473;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1474;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1475;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1476;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1477;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1478;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1479;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1480;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1481;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1482;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1483;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1484;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1485;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1486;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1487;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1488;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1489;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1490;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1491;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1492;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1493;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1494;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1495;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1496;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1497;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1498;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1499;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1500;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1501;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1502;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1503;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1504;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1505;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1506;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1507;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1508;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1509;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1510;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1511;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1512;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1513;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1514;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1515;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1516;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1517;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1518;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1519;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1520;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1521;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1522;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1523;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1524;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1525;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1526;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1527;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1528;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1529;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1530;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1531;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1532;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1533;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1534;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1535;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1536;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1537;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1538;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1539;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1540;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1541;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1542;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1543;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1544;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1545;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1546;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1547;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1548;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1549;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1550;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1551;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1552;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1553;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1554;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1555;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1556;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1557;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1558;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1559;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1560;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1561;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1562;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1563;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1564;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1565;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1566;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1567;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1568;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1569;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1570;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1571;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1572;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1573;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1574;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1575;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1576;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1577;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1578;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1579;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1580;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1581;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1582;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1583;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1584;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1585;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1586;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1587;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1588;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1589;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1590;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1591;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1592;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1593;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1594;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1595;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1596;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1597;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1598;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1599;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1600;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1601;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1602;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1603;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1604;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1605;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1606;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1607;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1608;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1609;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1610;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1611;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1612;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1613;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1614;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1615;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1616;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1617;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1618;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1619;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1620;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1621;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1622;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1623;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1624;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1625;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1626;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1627;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1628;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1629;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1630;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1631;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1632;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1633;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1634;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1635;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1636;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1637;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1638;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1639;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1640;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1641;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1642;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1643;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1644;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1645;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1646;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1647;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1648;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1649;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1650;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1651;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1652;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1653;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1654;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1655;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1656;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1657;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1658;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1659;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1660;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1661;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1662;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1663;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1664;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1665;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1666;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1667;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1668;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1669;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1670;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1671;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1672;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1673;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1674;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1675;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1676;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1677;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1678;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1679;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1680;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1681;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1682;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1683;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1684;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1685;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1686;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1687;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1688;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1689;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1690;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1691;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1692;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1693;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1694;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1695;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1696;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1697;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1698;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1699;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1700;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1701;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1702;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1703;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1704;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1705;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1706;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1707;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1708;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1709;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1710;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1711;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1712;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1713;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1714;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1715;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1716;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1717;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1718;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1719;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1720;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1721;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1722;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1723;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1724;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1725;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1726;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1727;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1728;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1729;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1730;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1731;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1732;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1733;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1734;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1735;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1736;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1737;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1738;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1739;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1740;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1741;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1742;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1743;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1744;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1745;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1746;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1747;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1748;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1749;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1750;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1751;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1752;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1753;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1754;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1755;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1756;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1757;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1758;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1759;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1760;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1761;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1762;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1763;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1764;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1765;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1766;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1767;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1768;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1769;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1770;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1771;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1772;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1773;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1774;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1775;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1776;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1777;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1778;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1779;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1780;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1781;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1782;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1783;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1784;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1785;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1786;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1787;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1788;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1789;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1790;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1791;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1792;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1793;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1794;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1795;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1796;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1797;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1798;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1799;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1800;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1801;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1802;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1803;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1804;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1805;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1806;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1807;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1808;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1809;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1810;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1811;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1812;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1813;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1814;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1815;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1816;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1817;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1818;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1819;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1820;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1821;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1822;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1823;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1824;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1825;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1826;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1827;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1828;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1829;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1830;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1831;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1832;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1833;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1834;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1835;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1836;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1837;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1838;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1839;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1840;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1841;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1842;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1843;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1844;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1845;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1846;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1847;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1848;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1849;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1850;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1851;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1852;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1853;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1854;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1855;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1856;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1857;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1858;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1859;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1860;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1861;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1862;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1863;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1864;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1865;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1866;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1867;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1868;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1869;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1870;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1871;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1872;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1873;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1874;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1875;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1876;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1877;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1878;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1879;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1880;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1881;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1882;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1883;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1884;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1885;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1886;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1887;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1888;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1889;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1890;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1891;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1892;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1893;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1894;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1895;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1896;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1897;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1898;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1899;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1900;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1901;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1902;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1903;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1904;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1905;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1906;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1907;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1908;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1909;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1910;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1911;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1912;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1913;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1914;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1915;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1916;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1917;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1918;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1919;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1920;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1921;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1922;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1923;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1924;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1925;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1926;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1927;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1928;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1929;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1930;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1931;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1932;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1933;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1934;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1935;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1936;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1937;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1938;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1939;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1940;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1941;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1942;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1943;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1944;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1945;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1946;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1947;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1948;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1949;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1950;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1951;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1952;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1953;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1954;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1955;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1956;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1957;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1958;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1959;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1960;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1961;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1962;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1963;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1964;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1965;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1966;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1967;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1968;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1969;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1970;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1971;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1972;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1973;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1974;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1975;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1976;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1977;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1978;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1979;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1980;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1981;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1982;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1983;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1984;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1985;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1986;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1987;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1988;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1989;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1990;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1991;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1992;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1993;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1994;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1995;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1996;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1997;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1998;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize1999;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2000;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2001;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2002;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2003;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2004;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2005;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2006;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2007;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2008;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2009;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2010;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2011;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2012;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2013;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2014;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2015;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2016;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2017;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2018;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2019;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2020;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2021;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2022;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2023;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2024;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2025;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2026;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2027;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2028;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2029;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2030;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2031;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2032;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2033;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2034;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2035;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2036;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2037;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2038;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2039;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2040;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2041;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2042;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2043;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2044;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2045;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2046;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2047;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2048;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2049;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2050;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2051;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2052;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2053;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2054;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2055;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2056;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2057;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2058;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2059;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2060;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2061;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2062;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2063;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2064;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2065;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2066;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2067;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2068;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2069;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2070;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2071;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2072;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2073;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2074;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2075;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2076;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2077;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2078;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2079;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2080;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2081;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2082;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2083;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2084;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2085;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2086;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2087;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2088;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2089;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2090;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2091;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2092;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2093;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2094;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2095;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2096;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2097;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2098;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2099;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2100;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2101;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2102;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2103;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2104;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2105;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2106;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2107;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2108;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2109;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2110;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2111;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2112;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2113;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2114;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2115;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2116;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2117;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2118;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2119;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2120;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2121;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2122;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2123;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2124;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2125;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2126;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2127;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2128;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2129;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2130;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2131;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2132;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2133;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2134;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2135;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2136;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2137;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2138;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2139;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2140;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2141;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2142;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2143;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2144;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2145;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2146;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2147;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2148;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2149;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2150;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2151;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2152;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2153;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2154;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2155;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2156;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2157;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2158;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2159;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2160;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2161;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2162;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2163;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2164;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2165;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2166;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2167;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2168;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2169;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2170;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2171;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2172;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2173;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2174;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2175;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2176;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2177;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2178;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2179;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2180;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2181;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2182;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2183;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2184;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2185;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2186;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2187;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2188;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2189;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2190;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2191;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2192;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2193;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2194;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2195;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2196;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2197;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2198;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2199;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2200;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2201;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2202;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2203;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2204;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2205;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2206;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2207;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2208;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2209;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2210;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2211;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2212;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2213;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2214;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2215;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2216;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2217;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2218;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2219;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2220;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2221;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2222;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2223;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2224;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2225;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2226;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2227;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2228;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2229;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2230;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2231;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2232;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2233;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2234;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2235;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2236;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2237;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2238;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2239;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2240;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2241;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2242;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2243;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2244;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2245;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2246;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2247;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2248;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2249;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2250;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2251;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2252;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2253;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2254;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2255;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2256;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2257;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2258;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2259;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2260;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2261;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2262;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2263;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2264;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2265;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2266;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2267;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2268;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2269;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2270;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2271;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2272;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2273;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2274;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2275;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2276;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2277;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2278;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2279;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2280;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2281;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2282;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2283;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2284;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2285;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2286;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2287;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2288;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2289;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2290;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2291;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2292;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2293;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2294;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2295;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2296;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2297;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2298;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2299;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2300;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2301;
extern const Il2CppTypeDefinitionSizes g_typeDefinitionSize2302;
extern const Il2CppTypeDefinitionSizes* g_Il2CppTypeDefinitionSizesTable[2303] =
{
(&g_typeDefinitionSize0),
(&g_typeDefinitionSize1),
(&g_typeDefinitionSize2),
(&g_typeDefinitionSize3),
(&g_typeDefinitionSize4),
(&g_typeDefinitionSize5),
(&g_typeDefinitionSize6),
(&g_typeDefinitionSize7),
(&g_typeDefinitionSize8),
(&g_typeDefinitionSize9),
(&g_typeDefinitionSize10),
(&g_typeDefinitionSize11),
(&g_typeDefinitionSize12),
(&g_typeDefinitionSize13),
(&g_typeDefinitionSize14),
(&g_typeDefinitionSize15),
(&g_typeDefinitionSize16),
(&g_typeDefinitionSize17),
(&g_typeDefinitionSize18),
(&g_typeDefinitionSize19),
(&g_typeDefinitionSize20),
(&g_typeDefinitionSize21),
(&g_typeDefinitionSize22),
(&g_typeDefinitionSize23),
(&g_typeDefinitionSize24),
(&g_typeDefinitionSize25),
(&g_typeDefinitionSize26),
(&g_typeDefinitionSize27),
(&g_typeDefinitionSize28),
(&g_typeDefinitionSize29),
(&g_typeDefinitionSize30),
(&g_typeDefinitionSize31),
(&g_typeDefinitionSize32),
(&g_typeDefinitionSize33),
(&g_typeDefinitionSize34),
(&g_typeDefinitionSize35),
(&g_typeDefinitionSize36),
(&g_typeDefinitionSize37),
(&g_typeDefinitionSize38),
(&g_typeDefinitionSize39),
(&g_typeDefinitionSize40),
(&g_typeDefinitionSize41),
(&g_typeDefinitionSize42),
(&g_typeDefinitionSize43),
(&g_typeDefinitionSize44),
(&g_typeDefinitionSize45),
(&g_typeDefinitionSize46),
(&g_typeDefinitionSize47),
(&g_typeDefinitionSize48),
(&g_typeDefinitionSize49),
(&g_typeDefinitionSize50),
(&g_typeDefinitionSize51),
(&g_typeDefinitionSize52),
(&g_typeDefinitionSize53),
(&g_typeDefinitionSize54),
(&g_typeDefinitionSize55),
(&g_typeDefinitionSize56),
(&g_typeDefinitionSize57),
(&g_typeDefinitionSize58),
(&g_typeDefinitionSize59),
(&g_typeDefinitionSize60),
(&g_typeDefinitionSize61),
(&g_typeDefinitionSize62),
(&g_typeDefinitionSize63),
(&g_typeDefinitionSize64),
(&g_typeDefinitionSize65),
(&g_typeDefinitionSize66),
(&g_typeDefinitionSize67),
(&g_typeDefinitionSize68),
(&g_typeDefinitionSize69),
(&g_typeDefinitionSize70),
(&g_typeDefinitionSize71),
(&g_typeDefinitionSize72),
(&g_typeDefinitionSize73),
(&g_typeDefinitionSize74),
(&g_typeDefinitionSize75),
(&g_typeDefinitionSize76),
(&g_typeDefinitionSize77),
(&g_typeDefinitionSize78),
(&g_typeDefinitionSize79),
(&g_typeDefinitionSize80),
(&g_typeDefinitionSize81),
(&g_typeDefinitionSize82),
(&g_typeDefinitionSize83),
(&g_typeDefinitionSize84),
(&g_typeDefinitionSize85),
(&g_typeDefinitionSize86),
(&g_typeDefinitionSize87),
(&g_typeDefinitionSize88),
(&g_typeDefinitionSize89),
(&g_typeDefinitionSize90),
(&g_typeDefinitionSize91),
(&g_typeDefinitionSize92),
(&g_typeDefinitionSize93),
(&g_typeDefinitionSize94),
(&g_typeDefinitionSize95),
(&g_typeDefinitionSize96),
(&g_typeDefinitionSize97),
(&g_typeDefinitionSize98),
(&g_typeDefinitionSize99),
(&g_typeDefinitionSize100),
(&g_typeDefinitionSize101),
(&g_typeDefinitionSize102),
(&g_typeDefinitionSize103),
(&g_typeDefinitionSize104),
(&g_typeDefinitionSize105),
(&g_typeDefinitionSize106),
(&g_typeDefinitionSize107),
(&g_typeDefinitionSize108),
(&g_typeDefinitionSize109),
(&g_typeDefinitionSize110),
(&g_typeDefinitionSize111),
(&g_typeDefinitionSize112),
(&g_typeDefinitionSize113),
(&g_typeDefinitionSize114),
(&g_typeDefinitionSize115),
(&g_typeDefinitionSize116),
(&g_typeDefinitionSize117),
(&g_typeDefinitionSize118),
(&g_typeDefinitionSize119),
(&g_typeDefinitionSize120),
(&g_typeDefinitionSize121),
(&g_typeDefinitionSize122),
(&g_typeDefinitionSize123),
(&g_typeDefinitionSize124),
(&g_typeDefinitionSize125),
(&g_typeDefinitionSize126),
(&g_typeDefinitionSize127),
(&g_typeDefinitionSize128),
(&g_typeDefinitionSize129),
(&g_typeDefinitionSize130),
(&g_typeDefinitionSize131),
(&g_typeDefinitionSize132),
(&g_typeDefinitionSize133),
(&g_typeDefinitionSize134),
(&g_typeDefinitionSize135),
(&g_typeDefinitionSize136),
(&g_typeDefinitionSize137),
(&g_typeDefinitionSize138),
(&g_typeDefinitionSize139),
(&g_typeDefinitionSize140),
(&g_typeDefinitionSize141),
(&g_typeDefinitionSize142),
(&g_typeDefinitionSize143),
(&g_typeDefinitionSize144),
(&g_typeDefinitionSize145),
(&g_typeDefinitionSize146),
(&g_typeDefinitionSize147),
(&g_typeDefinitionSize148),
(&g_typeDefinitionSize149),
(&g_typeDefinitionSize150),
(&g_typeDefinitionSize151),
(&g_typeDefinitionSize152),
(&g_typeDefinitionSize153),
(&g_typeDefinitionSize154),
(&g_typeDefinitionSize155),
(&g_typeDefinitionSize156),
(&g_typeDefinitionSize157),
(&g_typeDefinitionSize158),
(&g_typeDefinitionSize159),
(&g_typeDefinitionSize160),
(&g_typeDefinitionSize161),
(&g_typeDefinitionSize162),
(&g_typeDefinitionSize163),
(&g_typeDefinitionSize164),
(&g_typeDefinitionSize165),
(&g_typeDefinitionSize166),
(&g_typeDefinitionSize167),
(&g_typeDefinitionSize168),
(&g_typeDefinitionSize169),
(&g_typeDefinitionSize170),
(&g_typeDefinitionSize171),
(&g_typeDefinitionSize172),
(&g_typeDefinitionSize173),
(&g_typeDefinitionSize174),
(&g_typeDefinitionSize175),
(&g_typeDefinitionSize176),
(&g_typeDefinitionSize177),
(&g_typeDefinitionSize178),
(&g_typeDefinitionSize179),
(&g_typeDefinitionSize180),
(&g_typeDefinitionSize181),
(&g_typeDefinitionSize182),
(&g_typeDefinitionSize183),
(&g_typeDefinitionSize184),
(&g_typeDefinitionSize185),
(&g_typeDefinitionSize186),
(&g_typeDefinitionSize187),
(&g_typeDefinitionSize188),
(&g_typeDefinitionSize189),
(&g_typeDefinitionSize190),
(&g_typeDefinitionSize191),
(&g_typeDefinitionSize192),
(&g_typeDefinitionSize193),
(&g_typeDefinitionSize194),
(&g_typeDefinitionSize195),
(&g_typeDefinitionSize196),
(&g_typeDefinitionSize197),
(&g_typeDefinitionSize198),
(&g_typeDefinitionSize199),
(&g_typeDefinitionSize200),
(&g_typeDefinitionSize201),
(&g_typeDefinitionSize202),
(&g_typeDefinitionSize203),
(&g_typeDefinitionSize204),
(&g_typeDefinitionSize205),
(&g_typeDefinitionSize206),
(&g_typeDefinitionSize207),
(&g_typeDefinitionSize208),
(&g_typeDefinitionSize209),
(&g_typeDefinitionSize210),
(&g_typeDefinitionSize211),
(&g_typeDefinitionSize212),
(&g_typeDefinitionSize213),
(&g_typeDefinitionSize214),
(&g_typeDefinitionSize215),
(&g_typeDefinitionSize216),
(&g_typeDefinitionSize217),
(&g_typeDefinitionSize218),
(&g_typeDefinitionSize219),
(&g_typeDefinitionSize220),
(&g_typeDefinitionSize221),
(&g_typeDefinitionSize222),
(&g_typeDefinitionSize223),
(&g_typeDefinitionSize224),
(&g_typeDefinitionSize225),
(&g_typeDefinitionSize226),
(&g_typeDefinitionSize227),
(&g_typeDefinitionSize228),
(&g_typeDefinitionSize229),
(&g_typeDefinitionSize230),
(&g_typeDefinitionSize231),
(&g_typeDefinitionSize232),
(&g_typeDefinitionSize233),
(&g_typeDefinitionSize234),
(&g_typeDefinitionSize235),
(&g_typeDefinitionSize236),
(&g_typeDefinitionSize237),
(&g_typeDefinitionSize238),
(&g_typeDefinitionSize239),
(&g_typeDefinitionSize240),
(&g_typeDefinitionSize241),
(&g_typeDefinitionSize242),
(&g_typeDefinitionSize243),
(&g_typeDefinitionSize244),
(&g_typeDefinitionSize245),
(&g_typeDefinitionSize246),
(&g_typeDefinitionSize247),
(&g_typeDefinitionSize248),
(&g_typeDefinitionSize249),
(&g_typeDefinitionSize250),
(&g_typeDefinitionSize251),
(&g_typeDefinitionSize252),
(&g_typeDefinitionSize253),
(&g_typeDefinitionSize254),
(&g_typeDefinitionSize255),
(&g_typeDefinitionSize256),
(&g_typeDefinitionSize257),
(&g_typeDefinitionSize258),
(&g_typeDefinitionSize259),
(&g_typeDefinitionSize260),
(&g_typeDefinitionSize261),
(&g_typeDefinitionSize262),
(&g_typeDefinitionSize263),
(&g_typeDefinitionSize264),
(&g_typeDefinitionSize265),
(&g_typeDefinitionSize266),
(&g_typeDefinitionSize267),
(&g_typeDefinitionSize268),
(&g_typeDefinitionSize269),
(&g_typeDefinitionSize270),
(&g_typeDefinitionSize271),
(&g_typeDefinitionSize272),
(&g_typeDefinitionSize273),
(&g_typeDefinitionSize274),
(&g_typeDefinitionSize275),
(&g_typeDefinitionSize276),
(&g_typeDefinitionSize277),
(&g_typeDefinitionSize278),
(&g_typeDefinitionSize279),
(&g_typeDefinitionSize280),
(&g_typeDefinitionSize281),
(&g_typeDefinitionSize282),
(&g_typeDefinitionSize283),
(&g_typeDefinitionSize284),
(&g_typeDefinitionSize285),
(&g_typeDefinitionSize286),
(&g_typeDefinitionSize287),
(&g_typeDefinitionSize288),
(&g_typeDefinitionSize289),
(&g_typeDefinitionSize290),
(&g_typeDefinitionSize291),
(&g_typeDefinitionSize292),
(&g_typeDefinitionSize293),
(&g_typeDefinitionSize294),
(&g_typeDefinitionSize295),
(&g_typeDefinitionSize296),
(&g_typeDefinitionSize297),
(&g_typeDefinitionSize298),
(&g_typeDefinitionSize299),
(&g_typeDefinitionSize300),
(&g_typeDefinitionSize301),
(&g_typeDefinitionSize302),
(&g_typeDefinitionSize303),
(&g_typeDefinitionSize304),
(&g_typeDefinitionSize305),
(&g_typeDefinitionSize306),
(&g_typeDefinitionSize307),
(&g_typeDefinitionSize308),
(&g_typeDefinitionSize309),
(&g_typeDefinitionSize310),
(&g_typeDefinitionSize311),
(&g_typeDefinitionSize312),
(&g_typeDefinitionSize313),
(&g_typeDefinitionSize314),
(&g_typeDefinitionSize315),
(&g_typeDefinitionSize316),
(&g_typeDefinitionSize317),
(&g_typeDefinitionSize318),
(&g_typeDefinitionSize319),
(&g_typeDefinitionSize320),
(&g_typeDefinitionSize321),
(&g_typeDefinitionSize322),
(&g_typeDefinitionSize323),
(&g_typeDefinitionSize324),
(&g_typeDefinitionSize325),
(&g_typeDefinitionSize326),
(&g_typeDefinitionSize327),
(&g_typeDefinitionSize328),
(&g_typeDefinitionSize329),
(&g_typeDefinitionSize330),
(&g_typeDefinitionSize331),
(&g_typeDefinitionSize332),
(&g_typeDefinitionSize333),
(&g_typeDefinitionSize334),
(&g_typeDefinitionSize335),
(&g_typeDefinitionSize336),
(&g_typeDefinitionSize337),
(&g_typeDefinitionSize338),
(&g_typeDefinitionSize339),
(&g_typeDefinitionSize340),
(&g_typeDefinitionSize341),
(&g_typeDefinitionSize342),
(&g_typeDefinitionSize343),
(&g_typeDefinitionSize344),
(&g_typeDefinitionSize345),
(&g_typeDefinitionSize346),
(&g_typeDefinitionSize347),
(&g_typeDefinitionSize348),
(&g_typeDefinitionSize349),
(&g_typeDefinitionSize350),
(&g_typeDefinitionSize351),
(&g_typeDefinitionSize352),
(&g_typeDefinitionSize353),
(&g_typeDefinitionSize354),
(&g_typeDefinitionSize355),
(&g_typeDefinitionSize356),
(&g_typeDefinitionSize357),
(&g_typeDefinitionSize358),
(&g_typeDefinitionSize359),
(&g_typeDefinitionSize360),
(&g_typeDefinitionSize361),
(&g_typeDefinitionSize362),
(&g_typeDefinitionSize363),
(&g_typeDefinitionSize364),
(&g_typeDefinitionSize365),
(&g_typeDefinitionSize366),
(&g_typeDefinitionSize367),
(&g_typeDefinitionSize368),
(&g_typeDefinitionSize369),
(&g_typeDefinitionSize370),
(&g_typeDefinitionSize371),
(&g_typeDefinitionSize372),
(&g_typeDefinitionSize373),
(&g_typeDefinitionSize374),
(&g_typeDefinitionSize375),
(&g_typeDefinitionSize376),
(&g_typeDefinitionSize377),
(&g_typeDefinitionSize378),
(&g_typeDefinitionSize379),
(&g_typeDefinitionSize380),
(&g_typeDefinitionSize381),
(&g_typeDefinitionSize382),
(&g_typeDefinitionSize383),
(&g_typeDefinitionSize384),
(&g_typeDefinitionSize385),
(&g_typeDefinitionSize386),
(&g_typeDefinitionSize387),
(&g_typeDefinitionSize388),
(&g_typeDefinitionSize389),
(&g_typeDefinitionSize390),
(&g_typeDefinitionSize391),
(&g_typeDefinitionSize392),
(&g_typeDefinitionSize393),
(&g_typeDefinitionSize394),
(&g_typeDefinitionSize395),
(&g_typeDefinitionSize396),
(&g_typeDefinitionSize397),
(&g_typeDefinitionSize398),
(&g_typeDefinitionSize399),
(&g_typeDefinitionSize400),
(&g_typeDefinitionSize401),
(&g_typeDefinitionSize402),
(&g_typeDefinitionSize403),
(&g_typeDefinitionSize404),
(&g_typeDefinitionSize405),
(&g_typeDefinitionSize406),
(&g_typeDefinitionSize407),
(&g_typeDefinitionSize408),
(&g_typeDefinitionSize409),
(&g_typeDefinitionSize410),
(&g_typeDefinitionSize411),
(&g_typeDefinitionSize412),
(&g_typeDefinitionSize413),
(&g_typeDefinitionSize414),
(&g_typeDefinitionSize415),
(&g_typeDefinitionSize416),
(&g_typeDefinitionSize417),
(&g_typeDefinitionSize418),
(&g_typeDefinitionSize419),
(&g_typeDefinitionSize420),
(&g_typeDefinitionSize421),
(&g_typeDefinitionSize422),
(&g_typeDefinitionSize423),
(&g_typeDefinitionSize424),
(&g_typeDefinitionSize425),
(&g_typeDefinitionSize426),
(&g_typeDefinitionSize427),
(&g_typeDefinitionSize428),
(&g_typeDefinitionSize429),
(&g_typeDefinitionSize430),
(&g_typeDefinitionSize431),
(&g_typeDefinitionSize432),
(&g_typeDefinitionSize433),
(&g_typeDefinitionSize434),
(&g_typeDefinitionSize435),
(&g_typeDefinitionSize436),
(&g_typeDefinitionSize437),
(&g_typeDefinitionSize438),
(&g_typeDefinitionSize439),
(&g_typeDefinitionSize440),
(&g_typeDefinitionSize441),
(&g_typeDefinitionSize442),
(&g_typeDefinitionSize443),
(&g_typeDefinitionSize444),
(&g_typeDefinitionSize445),
(&g_typeDefinitionSize446),
(&g_typeDefinitionSize447),
(&g_typeDefinitionSize448),
(&g_typeDefinitionSize449),
(&g_typeDefinitionSize450),
(&g_typeDefinitionSize451),
(&g_typeDefinitionSize452),
(&g_typeDefinitionSize453),
(&g_typeDefinitionSize454),
(&g_typeDefinitionSize455),
(&g_typeDefinitionSize456),
(&g_typeDefinitionSize457),
(&g_typeDefinitionSize458),
(&g_typeDefinitionSize459),
(&g_typeDefinitionSize460),
(&g_typeDefinitionSize461),
(&g_typeDefinitionSize462),
(&g_typeDefinitionSize463),
(&g_typeDefinitionSize464),
(&g_typeDefinitionSize465),
(&g_typeDefinitionSize466),
(&g_typeDefinitionSize467),
(&g_typeDefinitionSize468),
(&g_typeDefinitionSize469),
(&g_typeDefinitionSize470),
(&g_typeDefinitionSize471),
(&g_typeDefinitionSize472),
(&g_typeDefinitionSize473),
(&g_typeDefinitionSize474),
(&g_typeDefinitionSize475),
(&g_typeDefinitionSize476),
(&g_typeDefinitionSize477),
(&g_typeDefinitionSize478),
(&g_typeDefinitionSize479),
(&g_typeDefinitionSize480),
(&g_typeDefinitionSize481),
(&g_typeDefinitionSize482),
(&g_typeDefinitionSize483),
(&g_typeDefinitionSize484),
(&g_typeDefinitionSize485),
(&g_typeDefinitionSize486),
(&g_typeDefinitionSize487),
(&g_typeDefinitionSize488),
(&g_typeDefinitionSize489),
(&g_typeDefinitionSize490),
(&g_typeDefinitionSize491),
(&g_typeDefinitionSize492),
(&g_typeDefinitionSize493),
(&g_typeDefinitionSize494),
(&g_typeDefinitionSize495),
(&g_typeDefinitionSize496),
(&g_typeDefinitionSize497),
(&g_typeDefinitionSize498),
(&g_typeDefinitionSize499),
(&g_typeDefinitionSize500),
(&g_typeDefinitionSize501),
(&g_typeDefinitionSize502),
(&g_typeDefinitionSize503),
(&g_typeDefinitionSize504),
(&g_typeDefinitionSize505),
(&g_typeDefinitionSize506),
(&g_typeDefinitionSize507),
(&g_typeDefinitionSize508),
(&g_typeDefinitionSize509),
(&g_typeDefinitionSize510),
(&g_typeDefinitionSize511),
(&g_typeDefinitionSize512),
(&g_typeDefinitionSize513),
(&g_typeDefinitionSize514),
(&g_typeDefinitionSize515),
(&g_typeDefinitionSize516),
(&g_typeDefinitionSize517),
(&g_typeDefinitionSize518),
(&g_typeDefinitionSize519),
(&g_typeDefinitionSize520),
(&g_typeDefinitionSize521),
(&g_typeDefinitionSize522),
(&g_typeDefinitionSize523),
(&g_typeDefinitionSize524),
(&g_typeDefinitionSize525),
(&g_typeDefinitionSize526),
(&g_typeDefinitionSize527),
(&g_typeDefinitionSize528),
(&g_typeDefinitionSize529),
(&g_typeDefinitionSize530),
(&g_typeDefinitionSize531),
(&g_typeDefinitionSize532),
(&g_typeDefinitionSize533),
(&g_typeDefinitionSize534),
(&g_typeDefinitionSize535),
(&g_typeDefinitionSize536),
(&g_typeDefinitionSize537),
(&g_typeDefinitionSize538),
(&g_typeDefinitionSize539),
(&g_typeDefinitionSize540),
(&g_typeDefinitionSize541),
(&g_typeDefinitionSize542),
(&g_typeDefinitionSize543),
(&g_typeDefinitionSize544),
(&g_typeDefinitionSize545),
(&g_typeDefinitionSize546),
(&g_typeDefinitionSize547),
(&g_typeDefinitionSize548),
(&g_typeDefinitionSize549),
(&g_typeDefinitionSize550),
(&g_typeDefinitionSize551),
(&g_typeDefinitionSize552),
(&g_typeDefinitionSize553),
(&g_typeDefinitionSize554),
(&g_typeDefinitionSize555),
(&g_typeDefinitionSize556),
(&g_typeDefinitionSize557),
(&g_typeDefinitionSize558),
(&g_typeDefinitionSize559),
(&g_typeDefinitionSize560),
(&g_typeDefinitionSize561),
(&g_typeDefinitionSize562),
(&g_typeDefinitionSize563),
(&g_typeDefinitionSize564),
(&g_typeDefinitionSize565),
(&g_typeDefinitionSize566),
(&g_typeDefinitionSize567),
(&g_typeDefinitionSize568),
(&g_typeDefinitionSize569),
(&g_typeDefinitionSize570),
(&g_typeDefinitionSize571),
(&g_typeDefinitionSize572),
(&g_typeDefinitionSize573),
(&g_typeDefinitionSize574),
(&g_typeDefinitionSize575),
(&g_typeDefinitionSize576),
(&g_typeDefinitionSize577),
(&g_typeDefinitionSize578),
(&g_typeDefinitionSize579),
(&g_typeDefinitionSize580),
(&g_typeDefinitionSize581),
(&g_typeDefinitionSize582),
(&g_typeDefinitionSize583),
(&g_typeDefinitionSize584),
(&g_typeDefinitionSize585),
(&g_typeDefinitionSize586),
(&g_typeDefinitionSize587),
(&g_typeDefinitionSize588),
(&g_typeDefinitionSize589),
(&g_typeDefinitionSize590),
(&g_typeDefinitionSize591),
(&g_typeDefinitionSize592),
(&g_typeDefinitionSize593),
(&g_typeDefinitionSize594),
(&g_typeDefinitionSize595),
(&g_typeDefinitionSize596),
(&g_typeDefinitionSize597),
(&g_typeDefinitionSize598),
(&g_typeDefinitionSize599),
(&g_typeDefinitionSize600),
(&g_typeDefinitionSize601),
(&g_typeDefinitionSize602),
(&g_typeDefinitionSize603),
(&g_typeDefinitionSize604),
(&g_typeDefinitionSize605),
(&g_typeDefinitionSize606),
(&g_typeDefinitionSize607),
(&g_typeDefinitionSize608),
(&g_typeDefinitionSize609),
(&g_typeDefinitionSize610),
(&g_typeDefinitionSize611),
(&g_typeDefinitionSize612),
(&g_typeDefinitionSize613),
(&g_typeDefinitionSize614),
(&g_typeDefinitionSize615),
(&g_typeDefinitionSize616),
(&g_typeDefinitionSize617),
(&g_typeDefinitionSize618),
(&g_typeDefinitionSize619),
(&g_typeDefinitionSize620),
(&g_typeDefinitionSize621),
(&g_typeDefinitionSize622),
(&g_typeDefinitionSize623),
(&g_typeDefinitionSize624),
(&g_typeDefinitionSize625),
(&g_typeDefinitionSize626),
(&g_typeDefinitionSize627),
(&g_typeDefinitionSize628),
(&g_typeDefinitionSize629),
(&g_typeDefinitionSize630),
(&g_typeDefinitionSize631),
(&g_typeDefinitionSize632),
(&g_typeDefinitionSize633),
(&g_typeDefinitionSize634),
(&g_typeDefinitionSize635),
(&g_typeDefinitionSize636),
(&g_typeDefinitionSize637),
(&g_typeDefinitionSize638),
(&g_typeDefinitionSize639),
(&g_typeDefinitionSize640),
(&g_typeDefinitionSize641),
(&g_typeDefinitionSize642),
(&g_typeDefinitionSize643),
(&g_typeDefinitionSize644),
(&g_typeDefinitionSize645),
(&g_typeDefinitionSize646),
(&g_typeDefinitionSize647),
(&g_typeDefinitionSize648),
(&g_typeDefinitionSize649),
(&g_typeDefinitionSize650),
(&g_typeDefinitionSize651),
(&g_typeDefinitionSize652),
(&g_typeDefinitionSize653),
(&g_typeDefinitionSize654),
(&g_typeDefinitionSize655),
(&g_typeDefinitionSize656),
(&g_typeDefinitionSize657),
(&g_typeDefinitionSize658),
(&g_typeDefinitionSize659),
(&g_typeDefinitionSize660),
(&g_typeDefinitionSize661),
(&g_typeDefinitionSize662),
(&g_typeDefinitionSize663),
(&g_typeDefinitionSize664),
(&g_typeDefinitionSize665),
(&g_typeDefinitionSize666),
(&g_typeDefinitionSize667),
(&g_typeDefinitionSize668),
(&g_typeDefinitionSize669),
(&g_typeDefinitionSize670),
(&g_typeDefinitionSize671),
(&g_typeDefinitionSize672),
(&g_typeDefinitionSize673),
(&g_typeDefinitionSize674),
(&g_typeDefinitionSize675),
(&g_typeDefinitionSize676),
(&g_typeDefinitionSize677),
(&g_typeDefinitionSize678),
(&g_typeDefinitionSize679),
(&g_typeDefinitionSize680),
(&g_typeDefinitionSize681),
(&g_typeDefinitionSize682),
(&g_typeDefinitionSize683),
(&g_typeDefinitionSize684),
(&g_typeDefinitionSize685),
(&g_typeDefinitionSize686),
(&g_typeDefinitionSize687),
(&g_typeDefinitionSize688),
(&g_typeDefinitionSize689),
(&g_typeDefinitionSize690),
(&g_typeDefinitionSize691),
(&g_typeDefinitionSize692),
(&g_typeDefinitionSize693),
(&g_typeDefinitionSize694),
(&g_typeDefinitionSize695),
(&g_typeDefinitionSize696),
(&g_typeDefinitionSize697),
(&g_typeDefinitionSize698),
(&g_typeDefinitionSize699),
(&g_typeDefinitionSize700),
(&g_typeDefinitionSize701),
(&g_typeDefinitionSize702),
(&g_typeDefinitionSize703),
(&g_typeDefinitionSize704),
(&g_typeDefinitionSize705),
(&g_typeDefinitionSize706),
(&g_typeDefinitionSize707),
(&g_typeDefinitionSize708),
(&g_typeDefinitionSize709),
(&g_typeDefinitionSize710),
(&g_typeDefinitionSize711),
(&g_typeDefinitionSize712),
(&g_typeDefinitionSize713),
(&g_typeDefinitionSize714),
(&g_typeDefinitionSize715),
(&g_typeDefinitionSize716),
(&g_typeDefinitionSize717),
(&g_typeDefinitionSize718),
(&g_typeDefinitionSize719),
(&g_typeDefinitionSize720),
(&g_typeDefinitionSize721),
(&g_typeDefinitionSize722),
(&g_typeDefinitionSize723),
(&g_typeDefinitionSize724),
(&g_typeDefinitionSize725),
(&g_typeDefinitionSize726),
(&g_typeDefinitionSize727),
(&g_typeDefinitionSize728),
(&g_typeDefinitionSize729),
(&g_typeDefinitionSize730),
(&g_typeDefinitionSize731),
(&g_typeDefinitionSize732),
(&g_typeDefinitionSize733),
(&g_typeDefinitionSize734),
(&g_typeDefinitionSize735),
(&g_typeDefinitionSize736),
(&g_typeDefinitionSize737),
(&g_typeDefinitionSize738),
(&g_typeDefinitionSize739),
(&g_typeDefinitionSize740),
(&g_typeDefinitionSize741),
(&g_typeDefinitionSize742),
(&g_typeDefinitionSize743),
(&g_typeDefinitionSize744),
(&g_typeDefinitionSize745),
(&g_typeDefinitionSize746),
(&g_typeDefinitionSize747),
(&g_typeDefinitionSize748),
(&g_typeDefinitionSize749),
(&g_typeDefinitionSize750),
(&g_typeDefinitionSize751),
(&g_typeDefinitionSize752),
(&g_typeDefinitionSize753),
(&g_typeDefinitionSize754),
(&g_typeDefinitionSize755),
(&g_typeDefinitionSize756),
(&g_typeDefinitionSize757),
(&g_typeDefinitionSize758),
(&g_typeDefinitionSize759),
(&g_typeDefinitionSize760),
(&g_typeDefinitionSize761),
(&g_typeDefinitionSize762),
(&g_typeDefinitionSize763),
(&g_typeDefinitionSize764),
(&g_typeDefinitionSize765),
(&g_typeDefinitionSize766),
(&g_typeDefinitionSize767),
(&g_typeDefinitionSize768),
(&g_typeDefinitionSize769),
(&g_typeDefinitionSize770),
(&g_typeDefinitionSize771),
(&g_typeDefinitionSize772),
(&g_typeDefinitionSize773),
(&g_typeDefinitionSize774),
(&g_typeDefinitionSize775),
(&g_typeDefinitionSize776),
(&g_typeDefinitionSize777),
(&g_typeDefinitionSize778),
(&g_typeDefinitionSize779),
(&g_typeDefinitionSize780),
(&g_typeDefinitionSize781),
(&g_typeDefinitionSize782),
(&g_typeDefinitionSize783),
(&g_typeDefinitionSize784),
(&g_typeDefinitionSize785),
(&g_typeDefinitionSize786),
(&g_typeDefinitionSize787),
(&g_typeDefinitionSize788),
(&g_typeDefinitionSize789),
(&g_typeDefinitionSize790),
(&g_typeDefinitionSize791),
(&g_typeDefinitionSize792),
(&g_typeDefinitionSize793),
(&g_typeDefinitionSize794),
(&g_typeDefinitionSize795),
(&g_typeDefinitionSize796),
(&g_typeDefinitionSize797),
(&g_typeDefinitionSize798),
(&g_typeDefinitionSize799),
(&g_typeDefinitionSize800),
(&g_typeDefinitionSize801),
(&g_typeDefinitionSize802),
(&g_typeDefinitionSize803),
(&g_typeDefinitionSize804),
(&g_typeDefinitionSize805),
(&g_typeDefinitionSize806),
(&g_typeDefinitionSize807),
(&g_typeDefinitionSize808),
(&g_typeDefinitionSize809),
(&g_typeDefinitionSize810),
(&g_typeDefinitionSize811),
(&g_typeDefinitionSize812),
(&g_typeDefinitionSize813),
(&g_typeDefinitionSize814),
(&g_typeDefinitionSize815),
(&g_typeDefinitionSize816),
(&g_typeDefinitionSize817),
(&g_typeDefinitionSize818),
(&g_typeDefinitionSize819),
(&g_typeDefinitionSize820),
(&g_typeDefinitionSize821),
(&g_typeDefinitionSize822),
(&g_typeDefinitionSize823),
(&g_typeDefinitionSize824),
(&g_typeDefinitionSize825),
(&g_typeDefinitionSize826),
(&g_typeDefinitionSize827),
(&g_typeDefinitionSize828),
(&g_typeDefinitionSize829),
(&g_typeDefinitionSize830),
(&g_typeDefinitionSize831),
(&g_typeDefinitionSize832),
(&g_typeDefinitionSize833),
(&g_typeDefinitionSize834),
(&g_typeDefinitionSize835),
(&g_typeDefinitionSize836),
(&g_typeDefinitionSize837),
(&g_typeDefinitionSize838),
(&g_typeDefinitionSize839),
(&g_typeDefinitionSize840),
(&g_typeDefinitionSize841),
(&g_typeDefinitionSize842),
(&g_typeDefinitionSize843),
(&g_typeDefinitionSize844),
(&g_typeDefinitionSize845),
(&g_typeDefinitionSize846),
(&g_typeDefinitionSize847),
(&g_typeDefinitionSize848),
(&g_typeDefinitionSize849),
(&g_typeDefinitionSize850),
(&g_typeDefinitionSize851),
(&g_typeDefinitionSize852),
(&g_typeDefinitionSize853),
(&g_typeDefinitionSize854),
(&g_typeDefinitionSize855),
(&g_typeDefinitionSize856),
(&g_typeDefinitionSize857),
(&g_typeDefinitionSize858),
(&g_typeDefinitionSize859),
(&g_typeDefinitionSize860),
(&g_typeDefinitionSize861),
(&g_typeDefinitionSize862),
(&g_typeDefinitionSize863),
(&g_typeDefinitionSize864),
(&g_typeDefinitionSize865),
(&g_typeDefinitionSize866),
(&g_typeDefinitionSize867),
(&g_typeDefinitionSize868),
(&g_typeDefinitionSize869),
(&g_typeDefinitionSize870),
(&g_typeDefinitionSize871),
(&g_typeDefinitionSize872),
(&g_typeDefinitionSize873),
(&g_typeDefinitionSize874),
(&g_typeDefinitionSize875),
(&g_typeDefinitionSize876),
(&g_typeDefinitionSize877),
(&g_typeDefinitionSize878),
(&g_typeDefinitionSize879),
(&g_typeDefinitionSize880),
(&g_typeDefinitionSize881),
(&g_typeDefinitionSize882),
(&g_typeDefinitionSize883),
(&g_typeDefinitionSize884),
(&g_typeDefinitionSize885),
(&g_typeDefinitionSize886),
(&g_typeDefinitionSize887),
(&g_typeDefinitionSize888),
(&g_typeDefinitionSize889),
(&g_typeDefinitionSize890),
(&g_typeDefinitionSize891),
(&g_typeDefinitionSize892),
(&g_typeDefinitionSize893),
(&g_typeDefinitionSize894),
(&g_typeDefinitionSize895),
(&g_typeDefinitionSize896),
(&g_typeDefinitionSize897),
(&g_typeDefinitionSize898),
(&g_typeDefinitionSize899),
(&g_typeDefinitionSize900),
(&g_typeDefinitionSize901),
(&g_typeDefinitionSize902),
(&g_typeDefinitionSize903),
(&g_typeDefinitionSize904),
(&g_typeDefinitionSize905),
(&g_typeDefinitionSize906),
(&g_typeDefinitionSize907),
(&g_typeDefinitionSize908),
(&g_typeDefinitionSize909),
(&g_typeDefinitionSize910),
(&g_typeDefinitionSize911),
(&g_typeDefinitionSize912),
(&g_typeDefinitionSize913),
(&g_typeDefinitionSize914),
(&g_typeDefinitionSize915),
(&g_typeDefinitionSize916),
(&g_typeDefinitionSize917),
(&g_typeDefinitionSize918),
(&g_typeDefinitionSize919),
(&g_typeDefinitionSize920),
(&g_typeDefinitionSize921),
(&g_typeDefinitionSize922),
(&g_typeDefinitionSize923),
(&g_typeDefinitionSize924),
(&g_typeDefinitionSize925),
(&g_typeDefinitionSize926),
(&g_typeDefinitionSize927),
(&g_typeDefinitionSize928),
(&g_typeDefinitionSize929),
(&g_typeDefinitionSize930),
(&g_typeDefinitionSize931),
(&g_typeDefinitionSize932),
(&g_typeDefinitionSize933),
(&g_typeDefinitionSize934),
(&g_typeDefinitionSize935),
(&g_typeDefinitionSize936),
(&g_typeDefinitionSize937),
(&g_typeDefinitionSize938),
(&g_typeDefinitionSize939),
(&g_typeDefinitionSize940),
(&g_typeDefinitionSize941),
(&g_typeDefinitionSize942),
(&g_typeDefinitionSize943),
(&g_typeDefinitionSize944),
(&g_typeDefinitionSize945),
(&g_typeDefinitionSize946),
(&g_typeDefinitionSize947),
(&g_typeDefinitionSize948),
(&g_typeDefinitionSize949),
(&g_typeDefinitionSize950),
(&g_typeDefinitionSize951),
(&g_typeDefinitionSize952),
(&g_typeDefinitionSize953),
(&g_typeDefinitionSize954),
(&g_typeDefinitionSize955),
(&g_typeDefinitionSize956),
(&g_typeDefinitionSize957),
(&g_typeDefinitionSize958),
(&g_typeDefinitionSize959),
(&g_typeDefinitionSize960),
(&g_typeDefinitionSize961),
(&g_typeDefinitionSize962),
(&g_typeDefinitionSize963),
(&g_typeDefinitionSize964),
(&g_typeDefinitionSize965),
(&g_typeDefinitionSize966),
(&g_typeDefinitionSize967),
(&g_typeDefinitionSize968),
(&g_typeDefinitionSize969),
(&g_typeDefinitionSize970),
(&g_typeDefinitionSize971),
(&g_typeDefinitionSize972),
(&g_typeDefinitionSize973),
(&g_typeDefinitionSize974),
(&g_typeDefinitionSize975),
(&g_typeDefinitionSize976),
(&g_typeDefinitionSize977),
(&g_typeDefinitionSize978),
(&g_typeDefinitionSize979),
(&g_typeDefinitionSize980),
(&g_typeDefinitionSize981),
(&g_typeDefinitionSize982),
(&g_typeDefinitionSize983),
(&g_typeDefinitionSize984),
(&g_typeDefinitionSize985),
(&g_typeDefinitionSize986),
(&g_typeDefinitionSize987),
(&g_typeDefinitionSize988),
(&g_typeDefinitionSize989),
(&g_typeDefinitionSize990),
(&g_typeDefinitionSize991),
(&g_typeDefinitionSize992),
(&g_typeDefinitionSize993),
(&g_typeDefinitionSize994),
(&g_typeDefinitionSize995),
(&g_typeDefinitionSize996),
(&g_typeDefinitionSize997),
(&g_typeDefinitionSize998),
(&g_typeDefinitionSize999),
(&g_typeDefinitionSize1000),
(&g_typeDefinitionSize1001),
(&g_typeDefinitionSize1002),
(&g_typeDefinitionSize1003),
(&g_typeDefinitionSize1004),
(&g_typeDefinitionSize1005),
(&g_typeDefinitionSize1006),
(&g_typeDefinitionSize1007),
(&g_typeDefinitionSize1008),
(&g_typeDefinitionSize1009),
(&g_typeDefinitionSize1010),
(&g_typeDefinitionSize1011),
(&g_typeDefinitionSize1012),
(&g_typeDefinitionSize1013),
(&g_typeDefinitionSize1014),
(&g_typeDefinitionSize1015),
(&g_typeDefinitionSize1016),
(&g_typeDefinitionSize1017),
(&g_typeDefinitionSize1018),
(&g_typeDefinitionSize1019),
(&g_typeDefinitionSize1020),
(&g_typeDefinitionSize1021),
(&g_typeDefinitionSize1022),
(&g_typeDefinitionSize1023),
(&g_typeDefinitionSize1024),
(&g_typeDefinitionSize1025),
(&g_typeDefinitionSize1026),
(&g_typeDefinitionSize1027),
(&g_typeDefinitionSize1028),
(&g_typeDefinitionSize1029),
(&g_typeDefinitionSize1030),
(&g_typeDefinitionSize1031),
(&g_typeDefinitionSize1032),
(&g_typeDefinitionSize1033),
(&g_typeDefinitionSize1034),
(&g_typeDefinitionSize1035),
(&g_typeDefinitionSize1036),
(&g_typeDefinitionSize1037),
(&g_typeDefinitionSize1038),
(&g_typeDefinitionSize1039),
(&g_typeDefinitionSize1040),
(&g_typeDefinitionSize1041),
(&g_typeDefinitionSize1042),
(&g_typeDefinitionSize1043),
(&g_typeDefinitionSize1044),
(&g_typeDefinitionSize1045),
(&g_typeDefinitionSize1046),
(&g_typeDefinitionSize1047),
(&g_typeDefinitionSize1048),
(&g_typeDefinitionSize1049),
(&g_typeDefinitionSize1050),
(&g_typeDefinitionSize1051),
(&g_typeDefinitionSize1052),
(&g_typeDefinitionSize1053),
(&g_typeDefinitionSize1054),
(&g_typeDefinitionSize1055),
(&g_typeDefinitionSize1056),
(&g_typeDefinitionSize1057),
(&g_typeDefinitionSize1058),
(&g_typeDefinitionSize1059),
(&g_typeDefinitionSize1060),
(&g_typeDefinitionSize1061),
(&g_typeDefinitionSize1062),
(&g_typeDefinitionSize1063),
(&g_typeDefinitionSize1064),
(&g_typeDefinitionSize1065),
(&g_typeDefinitionSize1066),
(&g_typeDefinitionSize1067),
(&g_typeDefinitionSize1068),
(&g_typeDefinitionSize1069),
(&g_typeDefinitionSize1070),
(&g_typeDefinitionSize1071),
(&g_typeDefinitionSize1072),
(&g_typeDefinitionSize1073),
(&g_typeDefinitionSize1074),
(&g_typeDefinitionSize1075),
(&g_typeDefinitionSize1076),
(&g_typeDefinitionSize1077),
(&g_typeDefinitionSize1078),
(&g_typeDefinitionSize1079),
(&g_typeDefinitionSize1080),
(&g_typeDefinitionSize1081),
(&g_typeDefinitionSize1082),
(&g_typeDefinitionSize1083),
(&g_typeDefinitionSize1084),
(&g_typeDefinitionSize1085),
(&g_typeDefinitionSize1086),
(&g_typeDefinitionSize1087),
(&g_typeDefinitionSize1088),
(&g_typeDefinitionSize1089),
(&g_typeDefinitionSize1090),
(&g_typeDefinitionSize1091),
(&g_typeDefinitionSize1092),
(&g_typeDefinitionSize1093),
(&g_typeDefinitionSize1094),
(&g_typeDefinitionSize1095),
(&g_typeDefinitionSize1096),
(&g_typeDefinitionSize1097),
(&g_typeDefinitionSize1098),
(&g_typeDefinitionSize1099),
(&g_typeDefinitionSize1100),
(&g_typeDefinitionSize1101),
(&g_typeDefinitionSize1102),
(&g_typeDefinitionSize1103),
(&g_typeDefinitionSize1104),
(&g_typeDefinitionSize1105),
(&g_typeDefinitionSize1106),
(&g_typeDefinitionSize1107),
(&g_typeDefinitionSize1108),
(&g_typeDefinitionSize1109),
(&g_typeDefinitionSize1110),
(&g_typeDefinitionSize1111),
(&g_typeDefinitionSize1112),
(&g_typeDefinitionSize1113),
(&g_typeDefinitionSize1114),
(&g_typeDefinitionSize1115),
(&g_typeDefinitionSize1116),
(&g_typeDefinitionSize1117),
(&g_typeDefinitionSize1118),
(&g_typeDefinitionSize1119),
(&g_typeDefinitionSize1120),
(&g_typeDefinitionSize1121),
(&g_typeDefinitionSize1122),
(&g_typeDefinitionSize1123),
(&g_typeDefinitionSize1124),
(&g_typeDefinitionSize1125),
(&g_typeDefinitionSize1126),
(&g_typeDefinitionSize1127),
(&g_typeDefinitionSize1128),
(&g_typeDefinitionSize1129),
(&g_typeDefinitionSize1130),
(&g_typeDefinitionSize1131),
(&g_typeDefinitionSize1132),
(&g_typeDefinitionSize1133),
(&g_typeDefinitionSize1134),
(&g_typeDefinitionSize1135),
(&g_typeDefinitionSize1136),
(&g_typeDefinitionSize1137),
(&g_typeDefinitionSize1138),
(&g_typeDefinitionSize1139),
(&g_typeDefinitionSize1140),
(&g_typeDefinitionSize1141),
(&g_typeDefinitionSize1142),
(&g_typeDefinitionSize1143),
(&g_typeDefinitionSize1144),
(&g_typeDefinitionSize1145),
(&g_typeDefinitionSize1146),
(&g_typeDefinitionSize1147),
(&g_typeDefinitionSize1148),
(&g_typeDefinitionSize1149),
(&g_typeDefinitionSize1150),
(&g_typeDefinitionSize1151),
(&g_typeDefinitionSize1152),
(&g_typeDefinitionSize1153),
(&g_typeDefinitionSize1154),
(&g_typeDefinitionSize1155),
(&g_typeDefinitionSize1156),
(&g_typeDefinitionSize1157),
(&g_typeDefinitionSize1158),
(&g_typeDefinitionSize1159),
(&g_typeDefinitionSize1160),
(&g_typeDefinitionSize1161),
(&g_typeDefinitionSize1162),
(&g_typeDefinitionSize1163),
(&g_typeDefinitionSize1164),
(&g_typeDefinitionSize1165),
(&g_typeDefinitionSize1166),
(&g_typeDefinitionSize1167),
(&g_typeDefinitionSize1168),
(&g_typeDefinitionSize1169),
(&g_typeDefinitionSize1170),
(&g_typeDefinitionSize1171),
(&g_typeDefinitionSize1172),
(&g_typeDefinitionSize1173),
(&g_typeDefinitionSize1174),
(&g_typeDefinitionSize1175),
(&g_typeDefinitionSize1176),
(&g_typeDefinitionSize1177),
(&g_typeDefinitionSize1178),
(&g_typeDefinitionSize1179),
(&g_typeDefinitionSize1180),
(&g_typeDefinitionSize1181),
(&g_typeDefinitionSize1182),
(&g_typeDefinitionSize1183),
(&g_typeDefinitionSize1184),
(&g_typeDefinitionSize1185),
(&g_typeDefinitionSize1186),
(&g_typeDefinitionSize1187),
(&g_typeDefinitionSize1188),
(&g_typeDefinitionSize1189),
(&g_typeDefinitionSize1190),
(&g_typeDefinitionSize1191),
(&g_typeDefinitionSize1192),
(&g_typeDefinitionSize1193),
(&g_typeDefinitionSize1194),
(&g_typeDefinitionSize1195),
(&g_typeDefinitionSize1196),
(&g_typeDefinitionSize1197),
(&g_typeDefinitionSize1198),
(&g_typeDefinitionSize1199),
(&g_typeDefinitionSize1200),
(&g_typeDefinitionSize1201),
(&g_typeDefinitionSize1202),
(&g_typeDefinitionSize1203),
(&g_typeDefinitionSize1204),
(&g_typeDefinitionSize1205),
(&g_typeDefinitionSize1206),
(&g_typeDefinitionSize1207),
(&g_typeDefinitionSize1208),
(&g_typeDefinitionSize1209),
(&g_typeDefinitionSize1210),
(&g_typeDefinitionSize1211),
(&g_typeDefinitionSize1212),
(&g_typeDefinitionSize1213),
(&g_typeDefinitionSize1214),
(&g_typeDefinitionSize1215),
(&g_typeDefinitionSize1216),
(&g_typeDefinitionSize1217),
(&g_typeDefinitionSize1218),
(&g_typeDefinitionSize1219),
(&g_typeDefinitionSize1220),
(&g_typeDefinitionSize1221),
(&g_typeDefinitionSize1222),
(&g_typeDefinitionSize1223),
(&g_typeDefinitionSize1224),
(&g_typeDefinitionSize1225),
(&g_typeDefinitionSize1226),
(&g_typeDefinitionSize1227),
(&g_typeDefinitionSize1228),
(&g_typeDefinitionSize1229),
(&g_typeDefinitionSize1230),
(&g_typeDefinitionSize1231),
(&g_typeDefinitionSize1232),
(&g_typeDefinitionSize1233),
(&g_typeDefinitionSize1234),
(&g_typeDefinitionSize1235),
(&g_typeDefinitionSize1236),
(&g_typeDefinitionSize1237),
(&g_typeDefinitionSize1238),
(&g_typeDefinitionSize1239),
(&g_typeDefinitionSize1240),
(&g_typeDefinitionSize1241),
(&g_typeDefinitionSize1242),
(&g_typeDefinitionSize1243),
(&g_typeDefinitionSize1244),
(&g_typeDefinitionSize1245),
(&g_typeDefinitionSize1246),
(&g_typeDefinitionSize1247),
(&g_typeDefinitionSize1248),
(&g_typeDefinitionSize1249),
(&g_typeDefinitionSize1250),
(&g_typeDefinitionSize1251),
(&g_typeDefinitionSize1252),
(&g_typeDefinitionSize1253),
(&g_typeDefinitionSize1254),
(&g_typeDefinitionSize1255),
(&g_typeDefinitionSize1256),
(&g_typeDefinitionSize1257),
(&g_typeDefinitionSize1258),
(&g_typeDefinitionSize1259),
(&g_typeDefinitionSize1260),
(&g_typeDefinitionSize1261),
(&g_typeDefinitionSize1262),
(&g_typeDefinitionSize1263),
(&g_typeDefinitionSize1264),
(&g_typeDefinitionSize1265),
(&g_typeDefinitionSize1266),
(&g_typeDefinitionSize1267),
(&g_typeDefinitionSize1268),
(&g_typeDefinitionSize1269),
(&g_typeDefinitionSize1270),
(&g_typeDefinitionSize1271),
(&g_typeDefinitionSize1272),
(&g_typeDefinitionSize1273),
(&g_typeDefinitionSize1274),
(&g_typeDefinitionSize1275),
(&g_typeDefinitionSize1276),
(&g_typeDefinitionSize1277),
(&g_typeDefinitionSize1278),
(&g_typeDefinitionSize1279),
(&g_typeDefinitionSize1280),
(&g_typeDefinitionSize1281),
(&g_typeDefinitionSize1282),
(&g_typeDefinitionSize1283),
(&g_typeDefinitionSize1284),
(&g_typeDefinitionSize1285),
(&g_typeDefinitionSize1286),
(&g_typeDefinitionSize1287),
(&g_typeDefinitionSize1288),
(&g_typeDefinitionSize1289),
(&g_typeDefinitionSize1290),
(&g_typeDefinitionSize1291),
(&g_typeDefinitionSize1292),
(&g_typeDefinitionSize1293),
(&g_typeDefinitionSize1294),
(&g_typeDefinitionSize1295),
(&g_typeDefinitionSize1296),
(&g_typeDefinitionSize1297),
(&g_typeDefinitionSize1298),
(&g_typeDefinitionSize1299),
(&g_typeDefinitionSize1300),
(&g_typeDefinitionSize1301),
(&g_typeDefinitionSize1302),
(&g_typeDefinitionSize1303),
(&g_typeDefinitionSize1304),
(&g_typeDefinitionSize1305),
(&g_typeDefinitionSize1306),
(&g_typeDefinitionSize1307),
(&g_typeDefinitionSize1308),
(&g_typeDefinitionSize1309),
(&g_typeDefinitionSize1310),
(&g_typeDefinitionSize1311),
(&g_typeDefinitionSize1312),
(&g_typeDefinitionSize1313),
(&g_typeDefinitionSize1314),
(&g_typeDefinitionSize1315),
(&g_typeDefinitionSize1316),
(&g_typeDefinitionSize1317),
(&g_typeDefinitionSize1318),
(&g_typeDefinitionSize1319),
(&g_typeDefinitionSize1320),
(&g_typeDefinitionSize1321),
(&g_typeDefinitionSize1322),
(&g_typeDefinitionSize1323),
(&g_typeDefinitionSize1324),
(&g_typeDefinitionSize1325),
(&g_typeDefinitionSize1326),
(&g_typeDefinitionSize1327),
(&g_typeDefinitionSize1328),
(&g_typeDefinitionSize1329),
(&g_typeDefinitionSize1330),
(&g_typeDefinitionSize1331),
(&g_typeDefinitionSize1332),
(&g_typeDefinitionSize1333),
(&g_typeDefinitionSize1334),
(&g_typeDefinitionSize1335),
(&g_typeDefinitionSize1336),
(&g_typeDefinitionSize1337),
(&g_typeDefinitionSize1338),
(&g_typeDefinitionSize1339),
(&g_typeDefinitionSize1340),
(&g_typeDefinitionSize1341),
(&g_typeDefinitionSize1342),
(&g_typeDefinitionSize1343),
(&g_typeDefinitionSize1344),
(&g_typeDefinitionSize1345),
(&g_typeDefinitionSize1346),
(&g_typeDefinitionSize1347),
(&g_typeDefinitionSize1348),
(&g_typeDefinitionSize1349),
(&g_typeDefinitionSize1350),
(&g_typeDefinitionSize1351),
(&g_typeDefinitionSize1352),
(&g_typeDefinitionSize1353),
(&g_typeDefinitionSize1354),
(&g_typeDefinitionSize1355),
(&g_typeDefinitionSize1356),
(&g_typeDefinitionSize1357),
(&g_typeDefinitionSize1358),
(&g_typeDefinitionSize1359),
(&g_typeDefinitionSize1360),
(&g_typeDefinitionSize1361),
(&g_typeDefinitionSize1362),
(&g_typeDefinitionSize1363),
(&g_typeDefinitionSize1364),
(&g_typeDefinitionSize1365),
(&g_typeDefinitionSize1366),
(&g_typeDefinitionSize1367),
(&g_typeDefinitionSize1368),
(&g_typeDefinitionSize1369),
(&g_typeDefinitionSize1370),
(&g_typeDefinitionSize1371),
(&g_typeDefinitionSize1372),
(&g_typeDefinitionSize1373),
(&g_typeDefinitionSize1374),
(&g_typeDefinitionSize1375),
(&g_typeDefinitionSize1376),
(&g_typeDefinitionSize1377),
(&g_typeDefinitionSize1378),
(&g_typeDefinitionSize1379),
(&g_typeDefinitionSize1380),
(&g_typeDefinitionSize1381),
(&g_typeDefinitionSize1382),
(&g_typeDefinitionSize1383),
(&g_typeDefinitionSize1384),
(&g_typeDefinitionSize1385),
(&g_typeDefinitionSize1386),
(&g_typeDefinitionSize1387),
(&g_typeDefinitionSize1388),
(&g_typeDefinitionSize1389),
(&g_typeDefinitionSize1390),
(&g_typeDefinitionSize1391),
(&g_typeDefinitionSize1392),
(&g_typeDefinitionSize1393),
(&g_typeDefinitionSize1394),
(&g_typeDefinitionSize1395),
(&g_typeDefinitionSize1396),
(&g_typeDefinitionSize1397),
(&g_typeDefinitionSize1398),
(&g_typeDefinitionSize1399),
(&g_typeDefinitionSize1400),
(&g_typeDefinitionSize1401),
(&g_typeDefinitionSize1402),
(&g_typeDefinitionSize1403),
(&g_typeDefinitionSize1404),
(&g_typeDefinitionSize1405),
(&g_typeDefinitionSize1406),
(&g_typeDefinitionSize1407),
(&g_typeDefinitionSize1408),
(&g_typeDefinitionSize1409),
(&g_typeDefinitionSize1410),
(&g_typeDefinitionSize1411),
(&g_typeDefinitionSize1412),
(&g_typeDefinitionSize1413),
(&g_typeDefinitionSize1414),
(&g_typeDefinitionSize1415),
(&g_typeDefinitionSize1416),
(&g_typeDefinitionSize1417),
(&g_typeDefinitionSize1418),
(&g_typeDefinitionSize1419),
(&g_typeDefinitionSize1420),
(&g_typeDefinitionSize1421),
(&g_typeDefinitionSize1422),
(&g_typeDefinitionSize1423),
(&g_typeDefinitionSize1424),
(&g_typeDefinitionSize1425),
(&g_typeDefinitionSize1426),
(&g_typeDefinitionSize1427),
(&g_typeDefinitionSize1428),
(&g_typeDefinitionSize1429),
(&g_typeDefinitionSize1430),
(&g_typeDefinitionSize1431),
(&g_typeDefinitionSize1432),
(&g_typeDefinitionSize1433),
(&g_typeDefinitionSize1434),
(&g_typeDefinitionSize1435),
(&g_typeDefinitionSize1436),
(&g_typeDefinitionSize1437),
(&g_typeDefinitionSize1438),
(&g_typeDefinitionSize1439),
(&g_typeDefinitionSize1440),
(&g_typeDefinitionSize1441),
(&g_typeDefinitionSize1442),
(&g_typeDefinitionSize1443),
(&g_typeDefinitionSize1444),
(&g_typeDefinitionSize1445),
(&g_typeDefinitionSize1446),
(&g_typeDefinitionSize1447),
(&g_typeDefinitionSize1448),
(&g_typeDefinitionSize1449),
(&g_typeDefinitionSize1450),
(&g_typeDefinitionSize1451),
(&g_typeDefinitionSize1452),
(&g_typeDefinitionSize1453),
(&g_typeDefinitionSize1454),
(&g_typeDefinitionSize1455),
(&g_typeDefinitionSize1456),
(&g_typeDefinitionSize1457),
(&g_typeDefinitionSize1458),
(&g_typeDefinitionSize1459),
(&g_typeDefinitionSize1460),
(&g_typeDefinitionSize1461),
(&g_typeDefinitionSize1462),
(&g_typeDefinitionSize1463),
(&g_typeDefinitionSize1464),
(&g_typeDefinitionSize1465),
(&g_typeDefinitionSize1466),
(&g_typeDefinitionSize1467),
(&g_typeDefinitionSize1468),
(&g_typeDefinitionSize1469),
(&g_typeDefinitionSize1470),
(&g_typeDefinitionSize1471),
(&g_typeDefinitionSize1472),
(&g_typeDefinitionSize1473),
(&g_typeDefinitionSize1474),
(&g_typeDefinitionSize1475),
(&g_typeDefinitionSize1476),
(&g_typeDefinitionSize1477),
(&g_typeDefinitionSize1478),
(&g_typeDefinitionSize1479),
(&g_typeDefinitionSize1480),
(&g_typeDefinitionSize1481),
(&g_typeDefinitionSize1482),
(&g_typeDefinitionSize1483),
(&g_typeDefinitionSize1484),
(&g_typeDefinitionSize1485),
(&g_typeDefinitionSize1486),
(&g_typeDefinitionSize1487),
(&g_typeDefinitionSize1488),
(&g_typeDefinitionSize1489),
(&g_typeDefinitionSize1490),
(&g_typeDefinitionSize1491),
(&g_typeDefinitionSize1492),
(&g_typeDefinitionSize1493),
(&g_typeDefinitionSize1494),
(&g_typeDefinitionSize1495),
(&g_typeDefinitionSize1496),
(&g_typeDefinitionSize1497),
(&g_typeDefinitionSize1498),
(&g_typeDefinitionSize1499),
(&g_typeDefinitionSize1500),
(&g_typeDefinitionSize1501),
(&g_typeDefinitionSize1502),
(&g_typeDefinitionSize1503),
(&g_typeDefinitionSize1504),
(&g_typeDefinitionSize1505),
(&g_typeDefinitionSize1506),
(&g_typeDefinitionSize1507),
(&g_typeDefinitionSize1508),
(&g_typeDefinitionSize1509),
(&g_typeDefinitionSize1510),
(&g_typeDefinitionSize1511),
(&g_typeDefinitionSize1512),
(&g_typeDefinitionSize1513),
(&g_typeDefinitionSize1514),
(&g_typeDefinitionSize1515),
(&g_typeDefinitionSize1516),
(&g_typeDefinitionSize1517),
(&g_typeDefinitionSize1518),
(&g_typeDefinitionSize1519),
(&g_typeDefinitionSize1520),
(&g_typeDefinitionSize1521),
(&g_typeDefinitionSize1522),
(&g_typeDefinitionSize1523),
(&g_typeDefinitionSize1524),
(&g_typeDefinitionSize1525),
(&g_typeDefinitionSize1526),
(&g_typeDefinitionSize1527),
(&g_typeDefinitionSize1528),
(&g_typeDefinitionSize1529),
(&g_typeDefinitionSize1530),
(&g_typeDefinitionSize1531),
(&g_typeDefinitionSize1532),
(&g_typeDefinitionSize1533),
(&g_typeDefinitionSize1534),
(&g_typeDefinitionSize1535),
(&g_typeDefinitionSize1536),
(&g_typeDefinitionSize1537),
(&g_typeDefinitionSize1538),
(&g_typeDefinitionSize1539),
(&g_typeDefinitionSize1540),
(&g_typeDefinitionSize1541),
(&g_typeDefinitionSize1542),
(&g_typeDefinitionSize1543),
(&g_typeDefinitionSize1544),
(&g_typeDefinitionSize1545),
(&g_typeDefinitionSize1546),
(&g_typeDefinitionSize1547),
(&g_typeDefinitionSize1548),
(&g_typeDefinitionSize1549),
(&g_typeDefinitionSize1550),
(&g_typeDefinitionSize1551),
(&g_typeDefinitionSize1552),
(&g_typeDefinitionSize1553),
(&g_typeDefinitionSize1554),
(&g_typeDefinitionSize1555),
(&g_typeDefinitionSize1556),
(&g_typeDefinitionSize1557),
(&g_typeDefinitionSize1558),
(&g_typeDefinitionSize1559),
(&g_typeDefinitionSize1560),
(&g_typeDefinitionSize1561),
(&g_typeDefinitionSize1562),
(&g_typeDefinitionSize1563),
(&g_typeDefinitionSize1564),
(&g_typeDefinitionSize1565),
(&g_typeDefinitionSize1566),
(&g_typeDefinitionSize1567),
(&g_typeDefinitionSize1568),
(&g_typeDefinitionSize1569),
(&g_typeDefinitionSize1570),
(&g_typeDefinitionSize1571),
(&g_typeDefinitionSize1572),
(&g_typeDefinitionSize1573),
(&g_typeDefinitionSize1574),
(&g_typeDefinitionSize1575),
(&g_typeDefinitionSize1576),
(&g_typeDefinitionSize1577),
(&g_typeDefinitionSize1578),
(&g_typeDefinitionSize1579),
(&g_typeDefinitionSize1580),
(&g_typeDefinitionSize1581),
(&g_typeDefinitionSize1582),
(&g_typeDefinitionSize1583),
(&g_typeDefinitionSize1584),
(&g_typeDefinitionSize1585),
(&g_typeDefinitionSize1586),
(&g_typeDefinitionSize1587),
(&g_typeDefinitionSize1588),
(&g_typeDefinitionSize1589),
(&g_typeDefinitionSize1590),
(&g_typeDefinitionSize1591),
(&g_typeDefinitionSize1592),
(&g_typeDefinitionSize1593),
(&g_typeDefinitionSize1594),
(&g_typeDefinitionSize1595),
(&g_typeDefinitionSize1596),
(&g_typeDefinitionSize1597),
(&g_typeDefinitionSize1598),
(&g_typeDefinitionSize1599),
(&g_typeDefinitionSize1600),
(&g_typeDefinitionSize1601),
(&g_typeDefinitionSize1602),
(&g_typeDefinitionSize1603),
(&g_typeDefinitionSize1604),
(&g_typeDefinitionSize1605),
(&g_typeDefinitionSize1606),
(&g_typeDefinitionSize1607),
(&g_typeDefinitionSize1608),
(&g_typeDefinitionSize1609),
(&g_typeDefinitionSize1610),
(&g_typeDefinitionSize1611),
(&g_typeDefinitionSize1612),
(&g_typeDefinitionSize1613),
(&g_typeDefinitionSize1614),
(&g_typeDefinitionSize1615),
(&g_typeDefinitionSize1616),
(&g_typeDefinitionSize1617),
(&g_typeDefinitionSize1618),
(&g_typeDefinitionSize1619),
(&g_typeDefinitionSize1620),
(&g_typeDefinitionSize1621),
(&g_typeDefinitionSize1622),
(&g_typeDefinitionSize1623),
(&g_typeDefinitionSize1624),
(&g_typeDefinitionSize1625),
(&g_typeDefinitionSize1626),
(&g_typeDefinitionSize1627),
(&g_typeDefinitionSize1628),
(&g_typeDefinitionSize1629),
(&g_typeDefinitionSize1630),
(&g_typeDefinitionSize1631),
(&g_typeDefinitionSize1632),
(&g_typeDefinitionSize1633),
(&g_typeDefinitionSize1634),
(&g_typeDefinitionSize1635),
(&g_typeDefinitionSize1636),
(&g_typeDefinitionSize1637),
(&g_typeDefinitionSize1638),
(&g_typeDefinitionSize1639),
(&g_typeDefinitionSize1640),
(&g_typeDefinitionSize1641),
(&g_typeDefinitionSize1642),
(&g_typeDefinitionSize1643),
(&g_typeDefinitionSize1644),
(&g_typeDefinitionSize1645),
(&g_typeDefinitionSize1646),
(&g_typeDefinitionSize1647),
(&g_typeDefinitionSize1648),
(&g_typeDefinitionSize1649),
(&g_typeDefinitionSize1650),
(&g_typeDefinitionSize1651),
(&g_typeDefinitionSize1652),
(&g_typeDefinitionSize1653),
(&g_typeDefinitionSize1654),
(&g_typeDefinitionSize1655),
(&g_typeDefinitionSize1656),
(&g_typeDefinitionSize1657),
(&g_typeDefinitionSize1658),
(&g_typeDefinitionSize1659),
(&g_typeDefinitionSize1660),
(&g_typeDefinitionSize1661),
(&g_typeDefinitionSize1662),
(&g_typeDefinitionSize1663),
(&g_typeDefinitionSize1664),
(&g_typeDefinitionSize1665),
(&g_typeDefinitionSize1666),
(&g_typeDefinitionSize1667),
(&g_typeDefinitionSize1668),
(&g_typeDefinitionSize1669),
(&g_typeDefinitionSize1670),
(&g_typeDefinitionSize1671),
(&g_typeDefinitionSize1672),
(&g_typeDefinitionSize1673),
(&g_typeDefinitionSize1674),
(&g_typeDefinitionSize1675),
(&g_typeDefinitionSize1676),
(&g_typeDefinitionSize1677),
(&g_typeDefinitionSize1678),
(&g_typeDefinitionSize1679),
(&g_typeDefinitionSize1680),
(&g_typeDefinitionSize1681),
(&g_typeDefinitionSize1682),
(&g_typeDefinitionSize1683),
(&g_typeDefinitionSize1684),
(&g_typeDefinitionSize1685),
(&g_typeDefinitionSize1686),
(&g_typeDefinitionSize1687),
(&g_typeDefinitionSize1688),
(&g_typeDefinitionSize1689),
(&g_typeDefinitionSize1690),
(&g_typeDefinitionSize1691),
(&g_typeDefinitionSize1692),
(&g_typeDefinitionSize1693),
(&g_typeDefinitionSize1694),
(&g_typeDefinitionSize1695),
(&g_typeDefinitionSize1696),
(&g_typeDefinitionSize1697),
(&g_typeDefinitionSize1698),
(&g_typeDefinitionSize1699),
(&g_typeDefinitionSize1700),
(&g_typeDefinitionSize1701),
(&g_typeDefinitionSize1702),
(&g_typeDefinitionSize1703),
(&g_typeDefinitionSize1704),
(&g_typeDefinitionSize1705),
(&g_typeDefinitionSize1706),
(&g_typeDefinitionSize1707),
(&g_typeDefinitionSize1708),
(&g_typeDefinitionSize1709),
(&g_typeDefinitionSize1710),
(&g_typeDefinitionSize1711),
(&g_typeDefinitionSize1712),
(&g_typeDefinitionSize1713),
(&g_typeDefinitionSize1714),
(&g_typeDefinitionSize1715),
(&g_typeDefinitionSize1716),
(&g_typeDefinitionSize1717),
(&g_typeDefinitionSize1718),
(&g_typeDefinitionSize1719),
(&g_typeDefinitionSize1720),
(&g_typeDefinitionSize1721),
(&g_typeDefinitionSize1722),
(&g_typeDefinitionSize1723),
(&g_typeDefinitionSize1724),
(&g_typeDefinitionSize1725),
(&g_typeDefinitionSize1726),
(&g_typeDefinitionSize1727),
(&g_typeDefinitionSize1728),
(&g_typeDefinitionSize1729),
(&g_typeDefinitionSize1730),
(&g_typeDefinitionSize1731),
(&g_typeDefinitionSize1732),
(&g_typeDefinitionSize1733),
(&g_typeDefinitionSize1734),
(&g_typeDefinitionSize1735),
(&g_typeDefinitionSize1736),
(&g_typeDefinitionSize1737),
(&g_typeDefinitionSize1738),
(&g_typeDefinitionSize1739),
(&g_typeDefinitionSize1740),
(&g_typeDefinitionSize1741),
(&g_typeDefinitionSize1742),
(&g_typeDefinitionSize1743),
(&g_typeDefinitionSize1744),
(&g_typeDefinitionSize1745),
(&g_typeDefinitionSize1746),
(&g_typeDefinitionSize1747),
(&g_typeDefinitionSize1748),
(&g_typeDefinitionSize1749),
(&g_typeDefinitionSize1750),
(&g_typeDefinitionSize1751),
(&g_typeDefinitionSize1752),
(&g_typeDefinitionSize1753),
(&g_typeDefinitionSize1754),
(&g_typeDefinitionSize1755),
(&g_typeDefinitionSize1756),
(&g_typeDefinitionSize1757),
(&g_typeDefinitionSize1758),
(&g_typeDefinitionSize1759),
(&g_typeDefinitionSize1760),
(&g_typeDefinitionSize1761),
(&g_typeDefinitionSize1762),
(&g_typeDefinitionSize1763),
(&g_typeDefinitionSize1764),
(&g_typeDefinitionSize1765),
(&g_typeDefinitionSize1766),
(&g_typeDefinitionSize1767),
(&g_typeDefinitionSize1768),
(&g_typeDefinitionSize1769),
(&g_typeDefinitionSize1770),
(&g_typeDefinitionSize1771),
(&g_typeDefinitionSize1772),
(&g_typeDefinitionSize1773),
(&g_typeDefinitionSize1774),
(&g_typeDefinitionSize1775),
(&g_typeDefinitionSize1776),
(&g_typeDefinitionSize1777),
(&g_typeDefinitionSize1778),
(&g_typeDefinitionSize1779),
(&g_typeDefinitionSize1780),
(&g_typeDefinitionSize1781),
(&g_typeDefinitionSize1782),
(&g_typeDefinitionSize1783),
(&g_typeDefinitionSize1784),
(&g_typeDefinitionSize1785),
(&g_typeDefinitionSize1786),
(&g_typeDefinitionSize1787),
(&g_typeDefinitionSize1788),
(&g_typeDefinitionSize1789),
(&g_typeDefinitionSize1790),
(&g_typeDefinitionSize1791),
(&g_typeDefinitionSize1792),
(&g_typeDefinitionSize1793),
(&g_typeDefinitionSize1794),
(&g_typeDefinitionSize1795),
(&g_typeDefinitionSize1796),
(&g_typeDefinitionSize1797),
(&g_typeDefinitionSize1798),
(&g_typeDefinitionSize1799),
(&g_typeDefinitionSize1800),
(&g_typeDefinitionSize1801),
(&g_typeDefinitionSize1802),
(&g_typeDefinitionSize1803),
(&g_typeDefinitionSize1804),
(&g_typeDefinitionSize1805),
(&g_typeDefinitionSize1806),
(&g_typeDefinitionSize1807),
(&g_typeDefinitionSize1808),
(&g_typeDefinitionSize1809),
(&g_typeDefinitionSize1810),
(&g_typeDefinitionSize1811),
(&g_typeDefinitionSize1812),
(&g_typeDefinitionSize1813),
(&g_typeDefinitionSize1814),
(&g_typeDefinitionSize1815),
(&g_typeDefinitionSize1816),
(&g_typeDefinitionSize1817),
(&g_typeDefinitionSize1818),
(&g_typeDefinitionSize1819),
(&g_typeDefinitionSize1820),
(&g_typeDefinitionSize1821),
(&g_typeDefinitionSize1822),
(&g_typeDefinitionSize1823),
(&g_typeDefinitionSize1824),
(&g_typeDefinitionSize1825),
(&g_typeDefinitionSize1826),
(&g_typeDefinitionSize1827),
(&g_typeDefinitionSize1828),
(&g_typeDefinitionSize1829),
(&g_typeDefinitionSize1830),
(&g_typeDefinitionSize1831),
(&g_typeDefinitionSize1832),
(&g_typeDefinitionSize1833),
(&g_typeDefinitionSize1834),
(&g_typeDefinitionSize1835),
(&g_typeDefinitionSize1836),
(&g_typeDefinitionSize1837),
(&g_typeDefinitionSize1838),
(&g_typeDefinitionSize1839),
(&g_typeDefinitionSize1840),
(&g_typeDefinitionSize1841),
(&g_typeDefinitionSize1842),
(&g_typeDefinitionSize1843),
(&g_typeDefinitionSize1844),
(&g_typeDefinitionSize1845),
(&g_typeDefinitionSize1846),
(&g_typeDefinitionSize1847),
(&g_typeDefinitionSize1848),
(&g_typeDefinitionSize1849),
(&g_typeDefinitionSize1850),
(&g_typeDefinitionSize1851),
(&g_typeDefinitionSize1852),
(&g_typeDefinitionSize1853),
(&g_typeDefinitionSize1854),
(&g_typeDefinitionSize1855),
(&g_typeDefinitionSize1856),
(&g_typeDefinitionSize1857),
(&g_typeDefinitionSize1858),
(&g_typeDefinitionSize1859),
(&g_typeDefinitionSize1860),
(&g_typeDefinitionSize1861),
(&g_typeDefinitionSize1862),
(&g_typeDefinitionSize1863),
(&g_typeDefinitionSize1864),
(&g_typeDefinitionSize1865),
(&g_typeDefinitionSize1866),
(&g_typeDefinitionSize1867),
(&g_typeDefinitionSize1868),
(&g_typeDefinitionSize1869),
(&g_typeDefinitionSize1870),
(&g_typeDefinitionSize1871),
(&g_typeDefinitionSize1872),
(&g_typeDefinitionSize1873),
(&g_typeDefinitionSize1874),
(&g_typeDefinitionSize1875),
(&g_typeDefinitionSize1876),
(&g_typeDefinitionSize1877),
(&g_typeDefinitionSize1878),
(&g_typeDefinitionSize1879),
(&g_typeDefinitionSize1880),
(&g_typeDefinitionSize1881),
(&g_typeDefinitionSize1882),
(&g_typeDefinitionSize1883),
(&g_typeDefinitionSize1884),
(&g_typeDefinitionSize1885),
(&g_typeDefinitionSize1886),
(&g_typeDefinitionSize1887),
(&g_typeDefinitionSize1888),
(&g_typeDefinitionSize1889),
(&g_typeDefinitionSize1890),
(&g_typeDefinitionSize1891),
(&g_typeDefinitionSize1892),
(&g_typeDefinitionSize1893),
(&g_typeDefinitionSize1894),
(&g_typeDefinitionSize1895),
(&g_typeDefinitionSize1896),
(&g_typeDefinitionSize1897),
(&g_typeDefinitionSize1898),
(&g_typeDefinitionSize1899),
(&g_typeDefinitionSize1900),
(&g_typeDefinitionSize1901),
(&g_typeDefinitionSize1902),
(&g_typeDefinitionSize1903),
(&g_typeDefinitionSize1904),
(&g_typeDefinitionSize1905),
(&g_typeDefinitionSize1906),
(&g_typeDefinitionSize1907),
(&g_typeDefinitionSize1908),
(&g_typeDefinitionSize1909),
(&g_typeDefinitionSize1910),
(&g_typeDefinitionSize1911),
(&g_typeDefinitionSize1912),
(&g_typeDefinitionSize1913),
(&g_typeDefinitionSize1914),
(&g_typeDefinitionSize1915),
(&g_typeDefinitionSize1916),
(&g_typeDefinitionSize1917),
(&g_typeDefinitionSize1918),
(&g_typeDefinitionSize1919),
(&g_typeDefinitionSize1920),
(&g_typeDefinitionSize1921),
(&g_typeDefinitionSize1922),
(&g_typeDefinitionSize1923),
(&g_typeDefinitionSize1924),
(&g_typeDefinitionSize1925),
(&g_typeDefinitionSize1926),
(&g_typeDefinitionSize1927),
(&g_typeDefinitionSize1928),
(&g_typeDefinitionSize1929),
(&g_typeDefinitionSize1930),
(&g_typeDefinitionSize1931),
(&g_typeDefinitionSize1932),
(&g_typeDefinitionSize1933),
(&g_typeDefinitionSize1934),
(&g_typeDefinitionSize1935),
(&g_typeDefinitionSize1936),
(&g_typeDefinitionSize1937),
(&g_typeDefinitionSize1938),
(&g_typeDefinitionSize1939),
(&g_typeDefinitionSize1940),
(&g_typeDefinitionSize1941),
(&g_typeDefinitionSize1942),
(&g_typeDefinitionSize1943),
(&g_typeDefinitionSize1944),
(&g_typeDefinitionSize1945),
(&g_typeDefinitionSize1946),
(&g_typeDefinitionSize1947),
(&g_typeDefinitionSize1948),
(&g_typeDefinitionSize1949),
(&g_typeDefinitionSize1950),
(&g_typeDefinitionSize1951),
(&g_typeDefinitionSize1952),
(&g_typeDefinitionSize1953),
(&g_typeDefinitionSize1954),
(&g_typeDefinitionSize1955),
(&g_typeDefinitionSize1956),
(&g_typeDefinitionSize1957),
(&g_typeDefinitionSize1958),
(&g_typeDefinitionSize1959),
(&g_typeDefinitionSize1960),
(&g_typeDefinitionSize1961),
(&g_typeDefinitionSize1962),
(&g_typeDefinitionSize1963),
(&g_typeDefinitionSize1964),
(&g_typeDefinitionSize1965),
(&g_typeDefinitionSize1966),
(&g_typeDefinitionSize1967),
(&g_typeDefinitionSize1968),
(&g_typeDefinitionSize1969),
(&g_typeDefinitionSize1970),
(&g_typeDefinitionSize1971),
(&g_typeDefinitionSize1972),
(&g_typeDefinitionSize1973),
(&g_typeDefinitionSize1974),
(&g_typeDefinitionSize1975),
(&g_typeDefinitionSize1976),
(&g_typeDefinitionSize1977),
(&g_typeDefinitionSize1978),
(&g_typeDefinitionSize1979),
(&g_typeDefinitionSize1980),
(&g_typeDefinitionSize1981),
(&g_typeDefinitionSize1982),
(&g_typeDefinitionSize1983),
(&g_typeDefinitionSize1984),
(&g_typeDefinitionSize1985),
(&g_typeDefinitionSize1986),
(&g_typeDefinitionSize1987),
(&g_typeDefinitionSize1988),
(&g_typeDefinitionSize1989),
(&g_typeDefinitionSize1990),
(&g_typeDefinitionSize1991),
(&g_typeDefinitionSize1992),
(&g_typeDefinitionSize1993),
(&g_typeDefinitionSize1994),
(&g_typeDefinitionSize1995),
(&g_typeDefinitionSize1996),
(&g_typeDefinitionSize1997),
(&g_typeDefinitionSize1998),
(&g_typeDefinitionSize1999),
(&g_typeDefinitionSize2000),
(&g_typeDefinitionSize2001),
(&g_typeDefinitionSize2002),
(&g_typeDefinitionSize2003),
(&g_typeDefinitionSize2004),
(&g_typeDefinitionSize2005),
(&g_typeDefinitionSize2006),
(&g_typeDefinitionSize2007),
(&g_typeDefinitionSize2008),
(&g_typeDefinitionSize2009),
(&g_typeDefinitionSize2010),
(&g_typeDefinitionSize2011),
(&g_typeDefinitionSize2012),
(&g_typeDefinitionSize2013),
(&g_typeDefinitionSize2014),
(&g_typeDefinitionSize2015),
(&g_typeDefinitionSize2016),
(&g_typeDefinitionSize2017),
(&g_typeDefinitionSize2018),
(&g_typeDefinitionSize2019),
(&g_typeDefinitionSize2020),
(&g_typeDefinitionSize2021),
(&g_typeDefinitionSize2022),
(&g_typeDefinitionSize2023),
(&g_typeDefinitionSize2024),
(&g_typeDefinitionSize2025),
(&g_typeDefinitionSize2026),
(&g_typeDefinitionSize2027),
(&g_typeDefinitionSize2028),
(&g_typeDefinitionSize2029),
(&g_typeDefinitionSize2030),
(&g_typeDefinitionSize2031),
(&g_typeDefinitionSize2032),
(&g_typeDefinitionSize2033),
(&g_typeDefinitionSize2034),
(&g_typeDefinitionSize2035),
(&g_typeDefinitionSize2036),
(&g_typeDefinitionSize2037),
(&g_typeDefinitionSize2038),
(&g_typeDefinitionSize2039),
(&g_typeDefinitionSize2040),
(&g_typeDefinitionSize2041),
(&g_typeDefinitionSize2042),
(&g_typeDefinitionSize2043),
(&g_typeDefinitionSize2044),
(&g_typeDefinitionSize2045),
(&g_typeDefinitionSize2046),
(&g_typeDefinitionSize2047),
(&g_typeDefinitionSize2048),
(&g_typeDefinitionSize2049),
(&g_typeDefinitionSize2050),
(&g_typeDefinitionSize2051),
(&g_typeDefinitionSize2052),
(&g_typeDefinitionSize2053),
(&g_typeDefinitionSize2054),
(&g_typeDefinitionSize2055),
(&g_typeDefinitionSize2056),
(&g_typeDefinitionSize2057),
(&g_typeDefinitionSize2058),
(&g_typeDefinitionSize2059),
(&g_typeDefinitionSize2060),
(&g_typeDefinitionSize2061),
(&g_typeDefinitionSize2062),
(&g_typeDefinitionSize2063),
(&g_typeDefinitionSize2064),
(&g_typeDefinitionSize2065),
(&g_typeDefinitionSize2066),
(&g_typeDefinitionSize2067),
(&g_typeDefinitionSize2068),
(&g_typeDefinitionSize2069),
(&g_typeDefinitionSize2070),
(&g_typeDefinitionSize2071),
(&g_typeDefinitionSize2072),
(&g_typeDefinitionSize2073),
(&g_typeDefinitionSize2074),
(&g_typeDefinitionSize2075),
(&g_typeDefinitionSize2076),
(&g_typeDefinitionSize2077),
(&g_typeDefinitionSize2078),
(&g_typeDefinitionSize2079),
(&g_typeDefinitionSize2080),
(&g_typeDefinitionSize2081),
(&g_typeDefinitionSize2082),
(&g_typeDefinitionSize2083),
(&g_typeDefinitionSize2084),
(&g_typeDefinitionSize2085),
(&g_typeDefinitionSize2086),
(&g_typeDefinitionSize2087),
(&g_typeDefinitionSize2088),
(&g_typeDefinitionSize2089),
(&g_typeDefinitionSize2090),
(&g_typeDefinitionSize2091),
(&g_typeDefinitionSize2092),
(&g_typeDefinitionSize2093),
(&g_typeDefinitionSize2094),
(&g_typeDefinitionSize2095),
(&g_typeDefinitionSize2096),
(&g_typeDefinitionSize2097),
(&g_typeDefinitionSize2098),
(&g_typeDefinitionSize2099),
(&g_typeDefinitionSize2100),
(&g_typeDefinitionSize2101),
(&g_typeDefinitionSize2102),
(&g_typeDefinitionSize2103),
(&g_typeDefinitionSize2104),
(&g_typeDefinitionSize2105),
(&g_typeDefinitionSize2106),
(&g_typeDefinitionSize2107),
(&g_typeDefinitionSize2108),
(&g_typeDefinitionSize2109),
(&g_typeDefinitionSize2110),
(&g_typeDefinitionSize2111),
(&g_typeDefinitionSize2112),
(&g_typeDefinitionSize2113),
(&g_typeDefinitionSize2114),
(&g_typeDefinitionSize2115),
(&g_typeDefinitionSize2116),
(&g_typeDefinitionSize2117),
(&g_typeDefinitionSize2118),
(&g_typeDefinitionSize2119),
(&g_typeDefinitionSize2120),
(&g_typeDefinitionSize2121),
(&g_typeDefinitionSize2122),
(&g_typeDefinitionSize2123),
(&g_typeDefinitionSize2124),
(&g_typeDefinitionSize2125),
(&g_typeDefinitionSize2126),
(&g_typeDefinitionSize2127),
(&g_typeDefinitionSize2128),
(&g_typeDefinitionSize2129),
(&g_typeDefinitionSize2130),
(&g_typeDefinitionSize2131),
(&g_typeDefinitionSize2132),
(&g_typeDefinitionSize2133),
(&g_typeDefinitionSize2134),
(&g_typeDefinitionSize2135),
(&g_typeDefinitionSize2136),
(&g_typeDefinitionSize2137),
(&g_typeDefinitionSize2138),
(&g_typeDefinitionSize2139),
(&g_typeDefinitionSize2140),
(&g_typeDefinitionSize2141),
(&g_typeDefinitionSize2142),
(&g_typeDefinitionSize2143),
(&g_typeDefinitionSize2144),
(&g_typeDefinitionSize2145),
(&g_typeDefinitionSize2146),
(&g_typeDefinitionSize2147),
(&g_typeDefinitionSize2148),
(&g_typeDefinitionSize2149),
(&g_typeDefinitionSize2150),
(&g_typeDefinitionSize2151),
(&g_typeDefinitionSize2152),
(&g_typeDefinitionSize2153),
(&g_typeDefinitionSize2154),
(&g_typeDefinitionSize2155),
(&g_typeDefinitionSize2156),
(&g_typeDefinitionSize2157),
(&g_typeDefinitionSize2158),
(&g_typeDefinitionSize2159),
(&g_typeDefinitionSize2160),
(&g_typeDefinitionSize2161),
(&g_typeDefinitionSize2162),
(&g_typeDefinitionSize2163),
(&g_typeDefinitionSize2164),
(&g_typeDefinitionSize2165),
(&g_typeDefinitionSize2166),
(&g_typeDefinitionSize2167),
(&g_typeDefinitionSize2168),
(&g_typeDefinitionSize2169),
(&g_typeDefinitionSize2170),
(&g_typeDefinitionSize2171),
(&g_typeDefinitionSize2172),
(&g_typeDefinitionSize2173),
(&g_typeDefinitionSize2174),
(&g_typeDefinitionSize2175),
(&g_typeDefinitionSize2176),
(&g_typeDefinitionSize2177),
(&g_typeDefinitionSize2178),
(&g_typeDefinitionSize2179),
(&g_typeDefinitionSize2180),
(&g_typeDefinitionSize2181),
(&g_typeDefinitionSize2182),
(&g_typeDefinitionSize2183),
(&g_typeDefinitionSize2184),
(&g_typeDefinitionSize2185),
(&g_typeDefinitionSize2186),
(&g_typeDefinitionSize2187),
(&g_typeDefinitionSize2188),
(&g_typeDefinitionSize2189),
(&g_typeDefinitionSize2190),
(&g_typeDefinitionSize2191),
(&g_typeDefinitionSize2192),
(&g_typeDefinitionSize2193),
(&g_typeDefinitionSize2194),
(&g_typeDefinitionSize2195),
(&g_typeDefinitionSize2196),
(&g_typeDefinitionSize2197),
(&g_typeDefinitionSize2198),
(&g_typeDefinitionSize2199),
(&g_typeDefinitionSize2200),
(&g_typeDefinitionSize2201),
(&g_typeDefinitionSize2202),
(&g_typeDefinitionSize2203),
(&g_typeDefinitionSize2204),
(&g_typeDefinitionSize2205),
(&g_typeDefinitionSize2206),
(&g_typeDefinitionSize2207),
(&g_typeDefinitionSize2208),
(&g_typeDefinitionSize2209),
(&g_typeDefinitionSize2210),
(&g_typeDefinitionSize2211),
(&g_typeDefinitionSize2212),
(&g_typeDefinitionSize2213),
(&g_typeDefinitionSize2214),
(&g_typeDefinitionSize2215),
(&g_typeDefinitionSize2216),
(&g_typeDefinitionSize2217),
(&g_typeDefinitionSize2218),
(&g_typeDefinitionSize2219),
(&g_typeDefinitionSize2220),
(&g_typeDefinitionSize2221),
(&g_typeDefinitionSize2222),
(&g_typeDefinitionSize2223),
(&g_typeDefinitionSize2224),
(&g_typeDefinitionSize2225),
(&g_typeDefinitionSize2226),
(&g_typeDefinitionSize2227),
(&g_typeDefinitionSize2228),
(&g_typeDefinitionSize2229),
(&g_typeDefinitionSize2230),
(&g_typeDefinitionSize2231),
(&g_typeDefinitionSize2232),
(&g_typeDefinitionSize2233),
(&g_typeDefinitionSize2234),
(&g_typeDefinitionSize2235),
(&g_typeDefinitionSize2236),
(&g_typeDefinitionSize2237),
(&g_typeDefinitionSize2238),
(&g_typeDefinitionSize2239),
(&g_typeDefinitionSize2240),
(&g_typeDefinitionSize2241),
(&g_typeDefinitionSize2242),
(&g_typeDefinitionSize2243),
(&g_typeDefinitionSize2244),
(&g_typeDefinitionSize2245),
(&g_typeDefinitionSize2246),
(&g_typeDefinitionSize2247),
(&g_typeDefinitionSize2248),
(&g_typeDefinitionSize2249),
(&g_typeDefinitionSize2250),
(&g_typeDefinitionSize2251),
(&g_typeDefinitionSize2252),
(&g_typeDefinitionSize2253),
(&g_typeDefinitionSize2254),
(&g_typeDefinitionSize2255),
(&g_typeDefinitionSize2256),
(&g_typeDefinitionSize2257),
(&g_typeDefinitionSize2258),
(&g_typeDefinitionSize2259),
(&g_typeDefinitionSize2260),
(&g_typeDefinitionSize2261),
(&g_typeDefinitionSize2262),
(&g_typeDefinitionSize2263),
(&g_typeDefinitionSize2264),
(&g_typeDefinitionSize2265),
(&g_typeDefinitionSize2266),
(&g_typeDefinitionSize2267),
(&g_typeDefinitionSize2268),
(&g_typeDefinitionSize2269),
(&g_typeDefinitionSize2270),
(&g_typeDefinitionSize2271),
(&g_typeDefinitionSize2272),
(&g_typeDefinitionSize2273),
(&g_typeDefinitionSize2274),
(&g_typeDefinitionSize2275),
(&g_typeDefinitionSize2276),
(&g_typeDefinitionSize2277),
(&g_typeDefinitionSize2278),
(&g_typeDefinitionSize2279),
(&g_typeDefinitionSize2280),
(&g_typeDefinitionSize2281),
(&g_typeDefinitionSize2282),
(&g_typeDefinitionSize2283),
(&g_typeDefinitionSize2284),
(&g_typeDefinitionSize2285),
(&g_typeDefinitionSize2286),
(&g_typeDefinitionSize2287),
(&g_typeDefinitionSize2288),
(&g_typeDefinitionSize2289),
(&g_typeDefinitionSize2290),
(&g_typeDefinitionSize2291),
(&g_typeDefinitionSize2292),
(&g_typeDefinitionSize2293),
(&g_typeDefinitionSize2294),
(&g_typeDefinitionSize2295),
(&g_typeDefinitionSize2296),
(&g_typeDefinitionSize2297),
(&g_typeDefinitionSize2298),
(&g_typeDefinitionSize2299),
(&g_typeDefinitionSize2300),
(&g_typeDefinitionSize2301),
(&g_typeDefinitionSize2302),
};
| [
"spencerbernstein09@gmail.com"
] | spencerbernstein09@gmail.com |
78c1f99389720ee562178326873c253518a0e484 | 077cba29964f4cd1406ef786dae990f8b932260b | /src/obsoleted/random_forest.h | 6d48ae0bfe2ef61ed06c933f167c4b18ca210441 | [] | no_license | congweitao/clushc | 9a8fadb8cb1ae885325077dc3fe72435cc1e3dca | 02e421fb28ad1328c5b64e58478246563538be63 | refs/heads/master | 2021-01-13T13:16:38.404840 | 2018-07-21T04:08:17 | 2018-07-21T04:08:17 | 72,695,821 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,288 | h | #pragma once
#ifndef _DECISION_TREE_H_
#define _DECISION_TREE_H_
#include <string>
#include <vector>
#include <set>
#include <ctime>
#include <algorithm>
#include <cmath>
using namespace std;
//the data structure for a tuple
struct TupleData
{
vector<int> A;
char label;
};
struct TreeNode
{
int attrNum;
int attr;
char label;
};
struct DecisionTree
{
TreeNode node;
vector<DecisionTree*> childs;
};
void init(char * trainname, char * testname);
int read_data(vector<TupleData> &data, const char* fileName);
int string_to_int(string s);
void sub_init();
void calculate_arrt_num();
void calculate_attributes();
void random_select_data(vector<TupleData> &data, vector<TupleData> &subdata);
double compute_entropy(double p, double s);
int create_classifier(DecisionTree *&p, const vector<TupleData> &samples, vector<int> &attributes);
int best_gain_arrt(const vector<TupleData> &samples, vector<int> &attributes);
bool all_the_same(const vector<TupleData> &samples, char ch);
char majority_class(const vector<TupleData> &samples);
void random_select_attr(vector<int> &data, vector<int> &subdata);
char test_classifier(DecisionTree *p, TupleData d);
void test_data();
void free_classifier(DecisionTree *p);
void free_arrt_num();
void show_result();
#endif //_RANDOM_FOREST_H_
| [
"congweitao@github.com"
] | congweitao@github.com |
f7771f7f76b8245c8e496d3489c129cd8cbbe1bc | 4e8548ed98d96146297393e623cb38fbcc77371b | /writeengine/server/we_msg2.cpp | e7d308e2231869e303e0aec2465b9dd504b19c4a | [] | no_license | hans511002/erydb_rep | 9d5a0be919e5d026e921c7fbe000dc70dc7d7ab6 | a2c391b3c36745cb690ce33a22d8794371493ef2 | refs/heads/master | 2021-01-15T12:02:01.093382 | 2018-08-09T10:57:26 | 2018-08-09T10:57:26 | 99,639,427 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,117 | cpp | /* Copyright (C) 2014 EryDB, Inc.
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; version 2 of
the License.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
MA 02110-1301, USA. */
/*******************************************************************************
* $Id$
*
*******************************************************************************/
#include <unistd.h>
#include "bytestream.h"
using namespace messageqcpp;
#include "we_messages.h"
#include "we_message_handlers.h"
namespace WriteEngine
{
ByteStream::byte doMsg2(ByteStream& bs, std::string err)
{
return 0;
}
}
| [
"hans511002@sohu.com"
] | hans511002@sohu.com |
1abf159141e952ff827be0ae1428e709f7aaad9b | bb7549fe79697803e350ebde2e1211303fc62d04 | /src/screen/screen.cpp | 21cb7e15f5c4f2940ebccae9c8d4dbf6ff9cd0b8 | [
"Apache-2.0"
] | permissive | yijiesun/mobilenet-ssd-embd | bba46b6414e2a6937f9b6ee0948ddffc82e67991 | d4ac02c6590885d424ac51390509ce699d4f76a9 | refs/heads/master | 2020-09-11T02:50:28.076886 | 2019-12-03T07:25:34 | 2019-12-03T07:25:34 | 221,917,017 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,002 | cpp | #include "screen.h"
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <iostream>
#include <iomanip>
using namespace std;
using namespace cv;
#define CLIP( a, b,c) ( (a)=(a)<(b)?(b):((a)>(c)?(c):(a)) )
SCREEN::SCREEN()
{
draw_box_max_cnt = 100;
fb = -1;
ret = -1;
pfb = NULL;
}
SCREEN::~SCREEN()
{
}
void SCREEN::uninit()
{
unsigned int i;
munmap(pfb, finfo.smem_len);
free(pfb);
}
int SCREEN::init(char *dev,int wid,int hgt)
{
img_width = wid;
img_hgt = hgt;
strncpy(dev_name,dev,200);
fb = open(dev_name, O_RDWR);
if (fb < 0)
{
perror("open");
return -1;
}
printf("open %s success \n", dev_name);
ret = ioctl(fb, FBIOGET_FSCREENINFO, &finfo);
if (ret < 0)
{
perror("ioctl");
return -1;
}
ret = ioctl(fb, FBIOGET_VSCREENINFO, &vinfo);
if (ret < 0)
{
perror("ioctl");
return -1;
}
pfb = (unsigned int *)malloc(finfo.smem_len);
pfb = (unsigned int *)mmap(NULL, finfo.smem_len, PROT_READ | PROT_WRITE, MAP_SHARED, fb, 0);
printf("smem_len: %ld", finfo.smem_len);
if (NULL == pfb)
{
perror("mmap");
return -1;
}
printf("pfb :0x%x \n", *pfb);
std::cout << "height: " << vinfo.yres << "weight: "<< vinfo.xres << std::endl;
std::cout << "xres_virtual: " << vinfo.xres_virtual << "yres_virtual: "<< vinfo.yres_virtual << std::endl;
}
void SCREEN::show_bgr_mat_at_screen(Mat &in,int pos_x,int pos_y)
{
uint32_t color = 0;
for (int h=0; h < in.rows; h++){
for(int w=0;w <in.cols; w++){
color = (0xff000000) | ((in.data[h*in.cols*3+w*3+2] << 16) & 0x00ff0000) | ((in.data[h*in.cols*3+w*3+1] << 8) & 0x0000ff00) | ((in.data[h*in.cols*3+w*3]&0x000000ff));
*(pfb+(h+pos_y)*vinfo.xres_virtual+w+pos_x) = color;
}
}
}
void SCREEN::draw_line(unsigned int *buf, int x0,int y0,int x1,int y1)
{
uint32_t color = 0xffff0000;
for (int h=y0; h <= y1; h++){
for(int w=x0;w <=x1; w++){
*(buf+h*vinfo.xres_virtual+w) = color;
}
}
}
void SCREEN::refresh_draw_box(unsigned int *buf,unsigned int pos_x,unsigned int pos_y)
{
for (vector<draw_box>::iterator it = v_draw.begin(); it != v_draw.end();)
{
int lux = it->lu.x + pos_x;
int luy = it->lu.y+pos_y;
int rdx = it->rd.x + pos_x;
int rdy = it->rd.y+pos_y;
CLIP(lux,pos_x+2,pos_x+img_width-2);
CLIP(luy,pos_y+2,pos_y+img_hgt-2);
CLIP(rdx,pos_x+2,pos_x+img_width-2);
CLIP(rdy,pos_y+2,pos_y+img_hgt-2);
draw_line(buf,lux,luy,rdx,luy); //lu-ru
draw_line(buf,rdx,luy,rdx,rdy);//ru-rd
draw_line(buf,lux,rdy,rdx,rdy);//ld-rd
draw_line(buf,lux,luy,lux,rdy);//lu-ld
it++;
}
} | [
"sunyijie520@126.com"
] | sunyijie520@126.com |
5cd3b467ac106218f67c2bec63c277604cef7d11 | 3d8fb7f95da19ad26970954fe04a9331d22d9119 | /lib/VM/VTable.cpp | 244158021490837ba5052401e837054d0f805dc1 | [
"MIT"
] | permissive | Huxpro/hermes | 0d680e1d23dd0fa0d23f05634daea1a105e0b7bb | 2a689c6850d597d2fcac2b5d6f2b08ac498255d0 | refs/heads/master | 2023-07-09T07:48:13.603597 | 2021-05-11T08:10:53 | 2021-05-11T08:14:59 | 264,000,586 | 1 | 0 | MIT | 2020-05-14T18:59:31 | 2020-05-14T18:59:30 | null | UTF-8 | C++ | false | false | 1,473 | cpp | /*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
#include "hermes/VM/VTable.h"
#include "hermes/VM/GCCell.h"
namespace hermes {
namespace vm {
std::string VTable::HeapSnapshotMetadata::nameForNode(GCCell *cell, GC *gc)
const {
std::string name;
if (name_) {
name = name_(cell, gc);
}
if (!name.empty()) {
return name;
}
return defaultNameForNode(cell);
}
std::string VTable::HeapSnapshotMetadata::defaultNameForNode(
GCCell *cell) const {
return cellKindStr(cell->getKind());
}
void VTable::HeapSnapshotMetadata::addEdges(
GCCell *cell,
GC *gc,
HeapSnapshot &snap) const {
if (addEdges_) {
addEdges_(cell, gc, snap);
}
}
void VTable::HeapSnapshotMetadata::addNodes(
GCCell *cell,
GC *gc,
HeapSnapshot &snap) const {
if (addNodes_) {
addNodes_(cell, gc, snap);
}
}
void VTable::HeapSnapshotMetadata::addLocations(
GCCell *cell,
GC *gc,
HeapSnapshot &snap) const {
if (addLocations_) {
addLocations_(cell, gc, snap);
}
}
llvh::raw_ostream &operator<<(llvh::raw_ostream &os, const VTable &vt) {
return os << "VTable: {\n\tsize: " << vt.size
<< ", finalize: " << reinterpret_cast<void *>(vt.finalize_)
<< ", markWeak: " << reinterpret_cast<void *>(vt.markWeak_) << "}";
}
} // namespace vm
} // namespace hermes
| [
"facebook-github-bot@users.noreply.github.com"
] | facebook-github-bot@users.noreply.github.com |
41df06bff12f7c51d5078f1d3b5fa2f9b4e05535 | 6edbc29a6f534ee4369d0aac86ca2758ce9e8f04 | /src/arch/mips/linux/process.cc | adfbfd3f649702d1e8d29d6538d20176c7971712 | [
"BSD-3-Clause",
"LicenseRef-scancode-proprietary-license",
"LGPL-2.0-or-later",
"MIT"
] | permissive | mszortul/gem-fi | 3871af1fdcea0165d3fc82c870ffe8b429dd08f2 | c692c040b70ed1094233c9502afb820f4b384098 | refs/heads/master | 2022-12-25T05:37:53.926188 | 2019-11-20T06:09:17 | 2019-11-20T06:09:17 | 222,862,565 | 0 | 1 | BSD-3-Clause | 2022-12-10T12:48:47 | 2019-11-20T06:01:09 | C++ | UTF-8 | C++ | false | false | 24,348 | cc | /*
* Copyright (c) 2005 The Regents of The University of Michigan
* Copyright (c) 2007 MIPS Technologies, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met: redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer;
* redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution;
* neither the name of the copyright holders nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* Authors: Gabe Black
* Korey Sewell
*/
#include "arch/mips/linux/process.hh"
#include "arch/mips/isa_traits.hh"
#include "arch/mips/linux/linux.hh"
#include "base/loader/object_file.hh"
#include "base/trace.hh"
#include "cpu/thread_context.hh"
#include "debug/SyscallVerbose.hh"
#include "kern/linux/linux.hh"
#include "sim/eventq.hh"
#include "sim/process.hh"
#include "sim/syscall_desc.hh"
#include "sim/syscall_emul.hh"
#include "sim/system.hh"
using namespace std;
using namespace MipsISA;
namespace
{
class MipsLinuxObjectFileLoader : public Process::Loader
{
public:
Process *
load(ProcessParams *params, ObjectFile *obj_file) override
{
if (obj_file->getArch() != ObjectFile::Mips)
return nullptr;
auto opsys = obj_file->getOpSys();
if (opsys == ObjectFile::UnknownOpSys) {
warn("Unknown operating system; assuming Linux.");
opsys = ObjectFile::Linux;
}
if (opsys != ObjectFile::Linux)
return nullptr;
return new MipsLinuxProcess(params, obj_file);
}
};
MipsLinuxObjectFileLoader loader;
} // anonymous namespace
/// Target uname() handler.
static SyscallReturn
unameFunc(SyscallDesc *desc, int callnum, ThreadContext *tc)
{
int index = 0;
auto process = tc->getProcessPtr();
TypedBufferArg<Linux::utsname> name(process->getSyscallArg(tc, index));
strcpy(name->sysname, "Linux");
strcpy(name->nodename,"sim.gem5.org");
strcpy(name->release, process->release.c_str());
strcpy(name->version, "#1 Mon Aug 18 11:32:15 EDT 2003");
strcpy(name->machine, "mips");
name.copyOut(tc->getVirtProxy());
return 0;
}
/// Target sys_getsysyinfo() handler. Even though this call is
/// borrowed from Tru64, the subcases that get used appear to be
/// different in practice from those used by Tru64 processes.
static SyscallReturn
sys_getsysinfoFunc(SyscallDesc *desc, int callnum, ThreadContext *tc)
{
int index = 0;
auto process = tc->getProcessPtr();
unsigned op = process->getSyscallArg(tc, index);
unsigned bufPtr = process->getSyscallArg(tc, index);
// unsigned nbytes = process->getSyscallArg(tc, index);
switch (op) {
case 45:
{
// GSI_IEEE_FP_CONTROL
TypedBufferArg<uint64_t> fpcr(bufPtr);
// I don't think this exactly matches the HW FPCR
*fpcr = 0;
fpcr.copyOut(tc->getVirtProxy());
return 0;
}
default:
cerr << "sys_getsysinfo: unknown op " << op << endl;
abort();
break;
}
return 1;
}
/// Target sys_setsysinfo() handler.
static SyscallReturn
sys_setsysinfoFunc(SyscallDesc *desc, int callnum, ThreadContext *tc)
{
int index = 0;
auto process = tc->getProcessPtr();
unsigned op = process->getSyscallArg(tc, index);
Addr bufPtr = process->getSyscallArg(tc, index);
// unsigned nbytes = process->getSyscallArg(tc, index);
switch (op) {
case 14:
{
// SSI_IEEE_FP_CONTROL
TypedBufferArg<uint64_t> fpcr(bufPtr);
// I don't think this exactly matches the HW FPCR
fpcr.copyIn(tc->getVirtProxy());
DPRINTFR(SyscallVerbose, "sys_setsysinfo(SSI_IEEE_FP_CONTROL): "
" setting FPCR to 0x%x\n", letoh(*(uint64_t*)fpcr));
return 0;
}
default:
cerr << "sys_setsysinfo: unknown op " << op << endl;
abort();
break;
}
return 1;
}
static SyscallReturn
setThreadAreaFunc(SyscallDesc *desc, int callnum, ThreadContext *tc)
{
int index = 0;
auto process = tc->getProcessPtr();
Addr addr = process->getSyscallArg(tc, index);
tc->setMiscRegNoEffect(MISCREG_TP_VALUE, addr);
return 0;
}
SyscallDesc MipsLinuxProcess::syscallDescs[] = {
/* 0 */ SyscallDesc("syscall", unimplementedFunc),
/* 1 */ SyscallDesc("exit", exitFunc),
/* 2 */ SyscallDesc("fork", unimplementedFunc),
/* 3 */ SyscallDesc("read", readFunc<MipsLinux>),
/* 4 */ SyscallDesc("write", writeFunc<MipsLinux>),
/* 5 */ SyscallDesc("open", openFunc<MipsLinux>),
/* 6 */ SyscallDesc("close", closeFunc),
/* 7 */ SyscallDesc("waitpid", unimplementedFunc),
/* 8 */ SyscallDesc("creat", unimplementedFunc),
/* 9 */ SyscallDesc("link", unimplementedFunc),
/* 10 */ SyscallDesc("unlink", unlinkFunc),
/* 11 */ SyscallDesc("execve", unimplementedFunc),
/* 12 */ SyscallDesc("chdir", unimplementedFunc),
/* 13 */ SyscallDesc("time", unimplementedFunc),
/* 14 */ SyscallDesc("mknod", unimplementedFunc),
/* 15 */ SyscallDesc("chmod", chmodFunc<MipsLinux>),
/* 16 */ SyscallDesc("lchown", chownFunc),
/* 17 */ SyscallDesc("break", brkFunc),
/* 18 */ SyscallDesc("unused#18", unimplementedFunc),
/* 19 */ SyscallDesc("lseek", lseekFunc),
/* 20 */ SyscallDesc("getpid", getpidFunc),
/* 21 */ SyscallDesc("mount", unimplementedFunc),
/* 22 */ SyscallDesc("umount", unimplementedFunc),
/* 23 */ SyscallDesc("setuid", setuidFunc),
/* 24 */ SyscallDesc("getuid", getuidFunc),
/* 25 */ SyscallDesc("stime", unimplementedFunc),
/* 26 */ SyscallDesc("ptrace", unimplementedFunc),
/* 27 */ SyscallDesc("alarm", unimplementedFunc),
/* 28 */ SyscallDesc("unused#28", unimplementedFunc),
/* 29 */ SyscallDesc("pause", unimplementedFunc),
/* 30 */ SyscallDesc("utime", unimplementedFunc),
/* 31 */ SyscallDesc("stty", unimplementedFunc),
/* 32 */ SyscallDesc("gtty", unimplementedFunc),
/* 33 */ SyscallDesc("access", unimplementedFunc),
/* 34 */ SyscallDesc("nice", unimplementedFunc),
/* 35 */ SyscallDesc("ftime", unimplementedFunc),
/* 36 */ SyscallDesc("sync", unimplementedFunc),
/* 37 */ SyscallDesc("kill", unimplementedFunc),
/* 38 */ SyscallDesc("rename", unimplementedFunc),
/* 39 */ SyscallDesc("mkdir", mkdirFunc),
/* 40 */ SyscallDesc("rmdir", unimplementedFunc),
/* 41 */ SyscallDesc("dup", unimplementedFunc),
/* 42 */ SyscallDesc("pipe", pipePseudoFunc),
/* 43 */ SyscallDesc("times", unimplementedFunc),
/* 44 */ SyscallDesc("prof", unimplementedFunc),
/* 45 */ SyscallDesc("brk", brkFunc),
/* 46 */ SyscallDesc("setgid", unimplementedFunc),
/* 47 */ SyscallDesc("getgid", getgidFunc),
/* 48 */ SyscallDesc("signal", ignoreFunc),
/* 49 */ SyscallDesc("geteuid", geteuidFunc),
/* 50 */ SyscallDesc("getegid", getegidFunc),
/* 51 */ SyscallDesc("acct", unimplementedFunc),
/* 52 */ SyscallDesc("umount2", unimplementedFunc),
/* 53 */ SyscallDesc("lock", unimplementedFunc),
/* 54 */ SyscallDesc("ioctl", ioctlFunc<MipsLinux>),
/* 55 */ SyscallDesc("fcntl", fcntlFunc),
/* 56 */ SyscallDesc("mpx", unimplementedFunc),
/* 57 */ SyscallDesc("setpgid", unimplementedFunc),
/* 58 */ SyscallDesc("ulimit", unimplementedFunc),
/* 59 */ SyscallDesc("unused#59", unimplementedFunc),
/* 60 */ SyscallDesc("umask", umaskFunc),
/* 61 */ SyscallDesc("chroot", unimplementedFunc),
/* 62 */ SyscallDesc("ustat", unimplementedFunc),
/* 63 */ SyscallDesc("dup2", unimplementedFunc),
/* 64 */ SyscallDesc("getppid", getpagesizeFunc),
/* 65 */ SyscallDesc("getpgrp", unimplementedFunc),
/* 66 */ SyscallDesc("setsid", unimplementedFunc),
/* 67 */ SyscallDesc("sigaction",unimplementedFunc),
/* 68 */ SyscallDesc("sgetmask", unimplementedFunc),
/* 69 */ SyscallDesc("ssetmask", unimplementedFunc),
/* 70 */ SyscallDesc("setreuid", unimplementedFunc),
/* 71 */ SyscallDesc("setregid", unimplementedFunc),
/* 72 */ SyscallDesc("sigsuspend", unimplementedFunc),
/* 73 */ SyscallDesc("sigpending", unimplementedFunc),
/* 74 */ SyscallDesc("sethostname", ignoreFunc),
/* 75 */ SyscallDesc("setrlimit", unimplementedFunc),
/* 76 */ SyscallDesc("getrlimit", unimplementedFunc),
/* 77 */ SyscallDesc("getrusage", getrusageFunc<MipsLinux>),
/* 78 */ SyscallDesc("gettimeofday", unimplementedFunc),
/* 79 */ SyscallDesc("settimeofday", unimplementedFunc),
/* 80 */ SyscallDesc("getgroups", unimplementedFunc),
/* 81 */ SyscallDesc("setgroups", unimplementedFunc),
/* 82 */ SyscallDesc("reserved#82", unimplementedFunc),
/* 83 */ SyscallDesc("symlink", unimplementedFunc),
/* 84 */ SyscallDesc("unused#84", unimplementedFunc),
/* 85 */ SyscallDesc("readlink", readlinkFunc),
/* 86 */ SyscallDesc("uselib", unimplementedFunc),
/* 87 */ SyscallDesc("swapon", gethostnameFunc),
/* 88 */ SyscallDesc("reboot", unimplementedFunc),
/* 89 */ SyscallDesc("readdir", unimplementedFunc),
/* 90 */ SyscallDesc("mmap", mmapFunc<MipsLinux>),
/* 91 */ SyscallDesc("munmap",munmapFunc),
/* 92 */ SyscallDesc("truncate", truncateFunc),
/* 93 */ SyscallDesc("ftruncate", ftruncateFunc),
/* 94 */ SyscallDesc("fchmod", fchmodFunc<MipsLinux>),
/* 95 */ SyscallDesc("fchown", fchownFunc),
/* 96 */ SyscallDesc("getpriority", unimplementedFunc),
/* 97 */ SyscallDesc("setpriority", unimplementedFunc),
/* 98 */ SyscallDesc("profil", unimplementedFunc),
/* 99 */ SyscallDesc("statfs", unimplementedFunc),
/* 100 */ SyscallDesc("fstatfs", unimplementedFunc),
/* 101 */ SyscallDesc("ioperm", unimplementedFunc),
/* 102 */ SyscallDesc("socketcall", unimplementedFunc),
/* 103 */ SyscallDesc("syslog", unimplementedFunc),
/* 104 */ SyscallDesc("setitimer", unimplementedFunc),
/* 105 */ SyscallDesc("getitimer", unimplementedFunc),
/* 106 */ SyscallDesc("stat", statFunc<MipsLinux>),
/* 107 */ SyscallDesc("lstat", unimplementedFunc),
/* 108 */ SyscallDesc("fstat", fstatFunc<MipsLinux>),
/* 109 */ SyscallDesc("unused#109", unimplementedFunc),
/* 110 */ SyscallDesc("iopl", unimplementedFunc),
/* 111 */ SyscallDesc("vhangup", unimplementedFunc),
/* 112 */ SyscallDesc("idle", ignoreFunc),
/* 113 */ SyscallDesc("vm86", unimplementedFunc),
/* 114 */ SyscallDesc("wait4", unimplementedFunc),
/* 115 */ SyscallDesc("swapoff", unimplementedFunc),
/* 116 */ SyscallDesc("sysinfo", sysinfoFunc<MipsLinux>),
/* 117 */ SyscallDesc("ipc", unimplementedFunc),
/* 118 */ SyscallDesc("fsync", unimplementedFunc),
/* 119 */ SyscallDesc("sigreturn", unimplementedFunc),
/* 120 */ SyscallDesc("clone", unimplementedFunc),
/* 121 */ SyscallDesc("setdomainname", unimplementedFunc),
/* 122 */ SyscallDesc("uname", unameFunc),
/* 123 */ SyscallDesc("modify_ldt", unimplementedFunc),
/* 124 */ SyscallDesc("adjtimex", unimplementedFunc),
/* 125 */ SyscallDesc("mprotect", ignoreFunc),
/* 126 */ SyscallDesc("sigprocmask", unimplementedFunc),
/* 127 */ SyscallDesc("create_module", unimplementedFunc),
/* 128 */ SyscallDesc("init_module", unimplementedFunc),
/* 129 */ SyscallDesc("delete_module", unimplementedFunc),
/* 130 */ SyscallDesc("get_kernel_syms", unimplementedFunc),
/* 131 */ SyscallDesc("quotactl", unimplementedFunc),
/* 132 */ SyscallDesc("getpgid", unimplementedFunc),
/* 133 */ SyscallDesc("fchdir", unimplementedFunc),
/* 134 */ SyscallDesc("bdflush", unimplementedFunc),
/* 135 */ SyscallDesc("sysfs", unimplementedFunc),
/* 136 */ SyscallDesc("personality", unimplementedFunc),
/* 137 */ SyscallDesc("afs_syscall", unimplementedFunc),
/* 138 */ SyscallDesc("setfsuid", unimplementedFunc),
/* 139 */ SyscallDesc("setfsgid", unimplementedFunc),
/* 140 */ SyscallDesc("llseek", unimplementedFunc),
/* 141 */ SyscallDesc("getdents", unimplementedFunc),
/* 142 */ SyscallDesc("newselect", unimplementedFunc),
/* 143 */ SyscallDesc("flock", unimplementedFunc),
/* 144 */ SyscallDesc("msync", unimplementedFunc),
/* 145 */ SyscallDesc("readv", unimplementedFunc),
/* 146 */ SyscallDesc("writev", writevFunc<MipsLinux>),
/* 147 */ SyscallDesc("cacheflush", unimplementedFunc),
/* 148 */ SyscallDesc("cachectl", unimplementedFunc),
/* 149 */ SyscallDesc("sysmips", unimplementedFunc),
/* 150 */ SyscallDesc("unused#150", unimplementedFunc),
/* 151 */ SyscallDesc("getsid", unimplementedFunc),
/* 152 */ SyscallDesc("fdatasync", unimplementedFunc),
/* 153 */ SyscallDesc("sysctl", ignoreFunc),
/* 154 */ SyscallDesc("mlock", unimplementedFunc),
/* 155 */ SyscallDesc("munlock", unimplementedFunc),
/* 156 */ SyscallDesc("mlockall", unimplementedFunc),
/* 157 */ SyscallDesc("munlockall", unimplementedFunc),
/* 158 */ SyscallDesc("sched_setparam", unimplementedFunc),
/* 159 */ SyscallDesc("sched_getparam", unimplementedFunc),
/* 160 */ SyscallDesc("sched_setscheduler", unimplementedFunc),
/* 161 */ SyscallDesc("sched_getscheduler", unimplementedFunc),
/* 162 */ SyscallDesc("sched_yield", unimplementedFunc),
/* 163 */ SyscallDesc("sched_get_prioritymax", unimplementedFunc),
/* 164 */ SyscallDesc("sched_get_priority_min", unimplementedFunc),
/* 165 */ SyscallDesc("sched_rr_get_interval", unimplementedFunc),
/* 166 */ SyscallDesc("nanosleep", unimplementedFunc),
/* 167 */ SyscallDesc("mremap", mremapFunc<MipsLinux>),
/* 168 */ SyscallDesc("accept", unimplementedFunc),
/* 169 */ SyscallDesc("bind", unimplementedFunc),
/* 170 */ SyscallDesc("connect", unimplementedFunc),
/* 171 */ SyscallDesc("getpeername", unimplementedFunc),
/* 172 */ SyscallDesc("getsockname", unimplementedFunc),
/* 173 */ SyscallDesc("getsockopt", unimplementedFunc),
/* 174 */ SyscallDesc("listen", unimplementedFunc),
/* 175 */ SyscallDesc("recv", unimplementedFunc),
/* 176 */ SyscallDesc("recvmsg", unimplementedFunc),
/* 177 */ SyscallDesc("send", unimplementedFunc),
/* 178 */ SyscallDesc("sendmsg", ignoreFunc),
/* 179 */ SyscallDesc("sendto", unimplementedFunc),
/* 180 */ SyscallDesc("setsockopt", unimplementedFunc),
/* 181 */ SyscallDesc("shutdown", unimplementedFunc),
/* 182 */ SyscallDesc("unknown #182", unimplementedFunc),
/* 183 */ SyscallDesc("socket", ignoreFunc),
/* 184 */ SyscallDesc("socketpair", unimplementedFunc),
/* 185 */ SyscallDesc("setresuid", unimplementedFunc),
/* 186 */ SyscallDesc("getresuid", unimplementedFunc),
/* 187 */ SyscallDesc("query_module", unimplementedFunc),
/* 188 */ SyscallDesc("poll", unimplementedFunc),
/* 189 */ SyscallDesc("nfsservctl", unimplementedFunc),
/* 190 */ SyscallDesc("setresgid", unimplementedFunc),
/* 191 */ SyscallDesc("getresgid", unimplementedFunc),
/* 192 */ SyscallDesc("prctl", unimplementedFunc),
/* 193 */ SyscallDesc("rt_sigreturn", unimplementedFunc),
/* 194 */ SyscallDesc("rt_sigaction", unimplementedFunc),
/* 195 */ SyscallDesc("rt_sigprocmask", unimplementedFunc),
/* 196 */ SyscallDesc("rt_sigpending", unimplementedFunc),
/* 197 */ SyscallDesc("rt_sigtimedwait", unimplementedFunc),
/* 198 */ SyscallDesc("rt_sigqueueinfo", ignoreFunc),
/* 199 */ SyscallDesc("rt_sigsuspend", unimplementedFunc),
/* 200 */ SyscallDesc("pread64", unimplementedFunc),
/* 201 */ SyscallDesc("pwrite64", unimplementedFunc),
/* 202 */ SyscallDesc("chown", unimplementedFunc),
/* 203 */ SyscallDesc("getcwd", getcwdFunc),
/* 204 */ SyscallDesc("capget", unimplementedFunc),
/* 205 */ SyscallDesc("capset", unimplementedFunc),
/* 206 */ SyscallDesc("sigalstack", unimplementedFunc),
/* 207 */ SyscallDesc("sendfile", unimplementedFunc),
/* 208 */ SyscallDesc("getpmsg", unimplementedFunc),
/* 209 */ SyscallDesc("putpmsg", unimplementedFunc),
/* 210 */ SyscallDesc("mmap2", unimplementedFunc),
/* 211 */ SyscallDesc("truncate64", unimplementedFunc),
/* 212 */ SyscallDesc("ftruncate64", unimplementedFunc),
/* 213 */ SyscallDesc("stat64", unimplementedFunc),
/* 214 */ SyscallDesc("lstat64", lstat64Func<MipsLinux>),
/* 215 */ SyscallDesc("fstat64", fstat64Func<MipsLinux>),
/* 216 */ SyscallDesc("pivot_root", unimplementedFunc),
/* 217 */ SyscallDesc("mincore", unimplementedFunc),
/* 218 */ SyscallDesc("madvise", unimplementedFunc),
/* 219 */ SyscallDesc("getdents64", unimplementedFunc),
/* 220 */ SyscallDesc("fcntl64", fcntl64Func),
/* 221 */ SyscallDesc("reserved#221", unimplementedFunc),
/* 222 */ SyscallDesc("gettid", unimplementedFunc),
/* 223 */ SyscallDesc("readahead", unimplementedFunc),
/* 224 */ SyscallDesc("setxattr", unimplementedFunc),
/* 225 */ SyscallDesc("lsetxattr", unimplementedFunc),
/* 226 */ SyscallDesc("fsetxattr", unimplementedFunc),
/* 227 */ SyscallDesc("getxattr", unimplementedFunc),
/* 228 */ SyscallDesc("lgetxattr", unimplementedFunc),
/* 229 */ SyscallDesc("fgetxattr", unimplementedFunc),
/* 230 */ SyscallDesc("listxattr", unimplementedFunc),
/* 231 */ SyscallDesc("llistxattr", unimplementedFunc),
/* 232 */ SyscallDesc("flistxattr", unimplementedFunc),
/* 233 */ SyscallDesc("removexattr", unimplementedFunc),
/* 234 */ SyscallDesc("lremovexattr", unimplementedFunc),
/* 235 */ SyscallDesc("fremovexattr", ignoreFunc),
/* 236 */ SyscallDesc("tkill", unimplementedFunc),
/* 237 */ SyscallDesc("sendfile64", unimplementedFunc),
/* 238 */ SyscallDesc("futex", unimplementedFunc),
/* 239 */ SyscallDesc("sched_setaffinity", unimplementedFunc),
/* 240 */ SyscallDesc("sched_getaffinity", unimplementedFunc),
/* 241 */ SyscallDesc("io_setup", unimplementedFunc),
/* 242 */ SyscallDesc("io_destroy", unimplementedFunc),
/* 243 */ SyscallDesc("io_getevents", unimplementedFunc),
/* 244 */ SyscallDesc("io_submit", unimplementedFunc),
/* 245 */ SyscallDesc("io_cancel", unimplementedFunc),
/* 246 */ SyscallDesc("exit_group", exitFunc),
/* 247 */ SyscallDesc("lookup_dcookie", unimplementedFunc),
/* 248 */ SyscallDesc("epoll_create", unimplementedFunc),
/* 249 */ SyscallDesc("epoll_ctl", unimplementedFunc),
/* 250 */ SyscallDesc("epoll_wait", unimplementedFunc),
/* 251 */ SyscallDesc("remap_file_pages", unimplementedFunc),
/* 252 */ SyscallDesc("set_tid_address", unimplementedFunc),
/* 253 */ SyscallDesc("restart_syscall", unimplementedFunc),
/* 254 */ SyscallDesc("fadvise64", unimplementedFunc),
/* 255 */ SyscallDesc("statfs64", unimplementedFunc),
/* 256 */ SyscallDesc("fstafs64", unimplementedFunc),
/* 257 */ SyscallDesc("timer_create", sys_getsysinfoFunc),
/* 258 */ SyscallDesc("timer_settime", sys_setsysinfoFunc),
/* 259 */ SyscallDesc("timer_gettime", unimplementedFunc),
/* 260 */ SyscallDesc("timer_getoverrun", unimplementedFunc),
/* 261 */ SyscallDesc("timer_delete", unimplementedFunc),
/* 262 */ SyscallDesc("clock_settime", unimplementedFunc),
/* 263 */ SyscallDesc("clock_gettime", unimplementedFunc),
/* 264 */ SyscallDesc("clock_getres", unimplementedFunc),
/* 265 */ SyscallDesc("clock_nanosleep", unimplementedFunc),
/* 266 */ SyscallDesc("tgkill", unimplementedFunc),
/* 267 */ SyscallDesc("utimes", unimplementedFunc),
/* 268 */ SyscallDesc("mbind", unimplementedFunc),
/* 269 */ SyscallDesc("get_mempolicy", unimplementedFunc),
/* 270 */ SyscallDesc("set_mempolicy", unimplementedFunc),
/* 271 */ SyscallDesc("mq_open", unimplementedFunc),
/* 272 */ SyscallDesc("mq_unlink", unimplementedFunc),
/* 273 */ SyscallDesc("mq_timedsend", unimplementedFunc),
/* 274 */ SyscallDesc("mq_timedreceive", unimplementedFunc),
/* 275 */ SyscallDesc("mq_notify", unimplementedFunc),
/* 276 */ SyscallDesc("mq_getsetattr", unimplementedFunc),
/* 277 */ SyscallDesc("vserver", unimplementedFunc),
/* 278 */ SyscallDesc("waitid", unimplementedFunc),
/* 279 */ SyscallDesc("unknown #279", unimplementedFunc),
/* 280 */ SyscallDesc("add_key", unimplementedFunc),
/* 281 */ SyscallDesc("request_key", unimplementedFunc),
/* 282 */ SyscallDesc("keyctl", unimplementedFunc),
/* 283 */ SyscallDesc("set_thread_area", setThreadAreaFunc),
/* 284 */ SyscallDesc("inotify_init", unimplementedFunc),
/* 285 */ SyscallDesc("inotify_add_watch", unimplementedFunc),
/* 286 */ SyscallDesc("inotify_rm_watch", unimplementedFunc),
/* 287 */ SyscallDesc("migrate_pages", unimplementedFunc),
/* 288 */ SyscallDesc("openat", unimplementedFunc),
/* 289 */ SyscallDesc("mkdirat", unimplementedFunc),
/* 290 */ SyscallDesc("mknodat", unimplementedFunc),
/* 291 */ SyscallDesc("fchownat", unimplementedFunc),
/* 292 */ SyscallDesc("futimesat", unimplementedFunc),
/* 293 */ SyscallDesc("fstatat64", unimplementedFunc),
/* 294 */ SyscallDesc("unlinkat", unimplementedFunc),
/* 295 */ SyscallDesc("renameat", unimplementedFunc),
/* 296 */ SyscallDesc("linkat", unimplementedFunc),
/* 297 */ SyscallDesc("symlinkat", unimplementedFunc),
/* 298 */ SyscallDesc("readlinkat", unimplementedFunc),
/* 299 */ SyscallDesc("fchmodat", unimplementedFunc),
/* 300 */ SyscallDesc("faccessat", unimplementedFunc),
/* 301 */ SyscallDesc("pselect6", unimplementedFunc),
/* 302 */ SyscallDesc("ppoll", unimplementedFunc),
/* 303 */ SyscallDesc("unshare", unimplementedFunc),
/* 304 */ SyscallDesc("splice", unimplementedFunc),
/* 305 */ SyscallDesc("sync_file_range", unimplementedFunc),
/* 306 */ SyscallDesc("tee", unimplementedFunc),
/* 307 */ SyscallDesc("vmsplice", unimplementedFunc),
/* 308 */ SyscallDesc("move_pages", unimplementedFunc),
/* 309 */ SyscallDesc("set_robust_list", unimplementedFunc),
/* 310 */ SyscallDesc("get_robust_list", unimplementedFunc),
/* 311 */ SyscallDesc("kexec_load", unimplementedFunc),
/* 312 */ SyscallDesc("getcpu", unimplementedFunc),
/* 313 */ SyscallDesc("epoll_pwait", unimplementedFunc),
/* 314 */ SyscallDesc("ioprio_set", unimplementedFunc),
/* 315 */ SyscallDesc("ioprio_get", unimplementedFunc),
/* 316 */ SyscallDesc("utimensat", unimplementedFunc),
/* 317 */ SyscallDesc("signalfd", unimplementedFunc),
/* 318 */ SyscallDesc("timerfd", unimplementedFunc),
/* 319 */ SyscallDesc("eventfd", unimplementedFunc)
};
MipsLinuxProcess::MipsLinuxProcess(ProcessParams * params,
ObjectFile *objFile)
: MipsProcess(params, objFile),
Num_Syscall_Descs(sizeof(syscallDescs) / sizeof(SyscallDesc))
{ }
SyscallDesc*
MipsLinuxProcess::getDesc(int callnum)
{
//MIPS32 syscalls are in the range of 4000 - 4999
int m5_sys_idx = callnum - 4000;
if (m5_sys_idx < 0 || m5_sys_idx >= Num_Syscall_Descs)
return NULL;
return &syscallDescs[m5_sys_idx];
}
| [
"mustafazortul@gmail.com"
] | mustafazortul@gmail.com |
3b64c8d52eec3a0020d42dfc6ffc73dc6e9942af | f9a3b7f4718240b0b357faa4d85d657c148edc59 | /convert-font/fonts/node_modules/mapnik-vector-tile/src/vector_tile_projection.ipp | d35768226a29bf62dda808ac86966b8a730976fe | [
"MIT"
] | permissive | WindJSTeam/mapbox-font-tool | d8c462675c760797df45afa3c254c95dba55f376 | ac5ea675631bcee31e5602a48c4f81263cbec2e4 | refs/heads/master | 2020-08-27T20:35:06.202683 | 2019-10-25T09:09:00 | 2019-10-25T09:09:00 | 217,482,833 | 0 | 0 | MIT | 2019-10-25T08:00:53 | 2019-10-25T08:00:52 | null | UTF-8 | C++ | false | false | 1,848 | ipp | // mapnik-vector-tile
#include "vector_tile_config.hpp"
// mapnik
#include <mapnik/box2d.hpp>
#include <mapnik/well_known_srs.hpp>
// std
#include <cmath>
#include <cstdint>
#ifndef M_PI
#define M_PI 3.141592653589793238462643
#endif
namespace mapnik
{
namespace vector_tile_impl
{
MAPNIK_VECTOR_INLINE void spherical_mercator::from_pixels(double shift, double & x, double & y)
{
double b = shift/2.0;
x = (x - b)/(shift/360.0);
double g = (y - b)/-(shift/(2 * M_PI));
y = R2D * (2.0 * std::atan(std::exp(g)) - M_PI_by2);
}
MAPNIK_VECTOR_INLINE void spherical_mercator::xyz(std::uint64_t x,
std::uint64_t y,
std::uint64_t z,
double & minx,
double & miny,
double & maxx,
double & maxy)
{
minx = x * tile_size_;
miny = (y + 1.0) * tile_size_;
maxx = (x + 1.0) * tile_size_;
maxy = y * tile_size_;
double shift = std::pow(2.0,z) * tile_size_;
from_pixels(shift,minx,miny);
from_pixels(shift,maxx,maxy);
lonlat2merc(&minx,&miny,1);
lonlat2merc(&maxx,&maxy,1);
}
MAPNIK_VECTOR_INLINE mapnik::box2d<double> merc_extent(std::uint32_t tile_size,
std::uint64_t x,
std::uint64_t y,
std::uint64_t z)
{
spherical_mercator merc(tile_size);
double minx,miny,maxx,maxy;
merc.xyz(x, y, z, minx, miny, maxx, maxy);
return mapnik::box2d<double>(minx,miny,maxx,maxy);
}
} // end vector_tile_impl ns
} // end mapnik ns
| [
"tanbm.hut@gmail.com"
] | tanbm.hut@gmail.com |
ab23dded4e4163786ac715e71d9e42b6a2cc05ab | 328472841867209fff5e98767fcc69f18827dc94 | /trash/workspace/rtsp/rtps.cpp | 7636b9d12a97fdc92dd6442610e7eb8ffdafbf50 | [] | no_license | hyz/dotfiles | a59ca1befdf1581f9dddd7af52806ac5af605c4e | 5e9e26ae6bc26cf7f5d3f79587751ccb42edc368 | refs/heads/master | 2023-05-27T18:14:39.292339 | 2023-05-21T06:48:33 | 2023-05-21T06:48:33 | 296,289 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 23,333 | cpp | // #include <sys/types.h> #include <signal.h>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <boost/static_assert.hpp>
#include <boost/scope_exit.hpp>
#include <boost/algorithm/string.hpp>
#include <boost/regex.hpp>
#include <boost/filesystem/path.hpp>
#include <boost/filesystem/fstream.hpp>
#include <boost/archive/iterators/binary_from_base64.hpp>
#include <boost/archive/iterators/base64_from_binary.hpp>
#include <boost/archive/iterators/transform_width.hpp>
#include <boost/signals2/signal.hpp>
//#include <boost/asio.hpp>
#include <boost/asio/io_service.hpp>
#include <boost/asio/ip/tcp.hpp>
#include <boost/asio/ip/udp.hpp>
#include <boost/asio/streambuf.hpp>
#include <boost/asio/write.hpp>
#include <boost/asio/read.hpp>
#include <boost/asio/read_until.hpp>
#include <boost/asio/placeholders.hpp>
#include <boost/asio/signal_set.hpp>
template <typename... As> void err_exit_(int lin_, char const* fmt, As... a)
{
fprintf(stderr, fmt, lin_, a...);
exit(127);
}
template <typename... As> void err_msg_(int lin_, char const* fmt, As... a) {
fprintf(stderr, fmt, lin_, a...);
fprintf(stderr, "\n");
}
#define ERR_EXIT(...) err_exit_(__LINE__, "%d: " __VA_ARGS__)
#define ERR_MSG(...) err_msg_(__LINE__, "%d: " __VA_ARGS__)
#define DBG_MSG(...) err_msg_(__LINE__, "%d: " __VA_ARGS__)
template <typename I1, typename I2>
void base64dec(I1 beg, I1 end, I2 out_it)
{
while (end != beg && *(end-1) == '=')
--end;
using namespace boost::archive::iterators;
using Iter = transform_width<binary_from_base64<I1>,8,6>;
std::copy(Iter(beg), Iter(end), out_it);
//return boost::algorithm::trim_right_copy_if( std::string(Iter(beg), Iter(end)), [](char c) { return c == '\0'; });
}
template <typename I1, typename I2>
void base64enc(I1 beg, I1 end, I2 out_it) {
using namespace boost::archive::iterators;
using Iter = base64_from_binary<transform_width<I1,6,8>>;
std::copy(Iter(beg), Iter(end), out_it);
}
template <typename Int,int> struct Ntoh_;
template <typename Int> struct Ntoh_<Int,4> { static Int cast(Int val) { return ntohl(val); } };
template <typename Int> struct Ntoh_<Int,2> { static Int cast(Int val) { return ntohs(val); } };
//template <typename Int> struct Ntoh_<Int,1> { static Int cast(Int val) { return (val); } };
template <typename Int> Int Ntoh(uint8_t* data,uint8_t* end)
{
if (end-data < sizeof(Int))
ERR_EXIT("Ntoh");
Int val;
memcpy(&val, data, sizeof(Int));
return Ntoh_<Int,sizeof(Int)>::cast(val);
}
namespace ip = boost::asio::ip;
static char* xsfmt(char xs[],unsigned siz, uint8_t*data,uint8_t*end)
{
int len=std::min(16,int(end-data));
for (int j=0, i=0; j < (int)siz && i < len; ++i)
j += snprintf(&xs[j],siz-j, ((i>1&&i%2==0)?" %02x":"%02x"), (int)data[i]);
return xs;
}
struct rtp_header
{
BOOST_STATIC_ASSERT(__BYTE_ORDER == __LITTLE_ENDIAN);
uint8_t cc:4; // CSRC count
uint8_t x:1; // header extension flag
uint8_t p:1; // padding flag
uint8_t version:2; // protocol version
uint8_t pt:7; // payload type
uint8_t m:1; // marker bit
uint16_t seq; // sequence number, network order
uint32_t timestamp; // timestamp, network order
uint32_t ssrc; // synchronization source, network order
uint32_t csrc[1]; // optional CSRC list
static rtp_header* cast(uint8_t* data, uint8_t* end) {
if (data + sizeof(rtp_header)-4 > end)
return nullptr;
rtp_header* h = reinterpret_cast<rtp_header*>(data);
if (data + h->length() > end)
return nullptr;
h->seq = ntohs(h->seq);
h->timestamp = ntohl(h->timestamp);
h->ssrc = ntohl(h->ssrc);
for (unsigned i=0; i < h->cc; ++i)
h->csrc[i] = ntohl(h->csrc[i]);
return h;
}
unsigned length() const { return sizeof(rtp_header)-4 + 4*this->cc; }
void print(uint8_t* data, uint8_t* end) {
char xs[128] = {};
printf("%4u:%u: version %d p %d x %d cc %d pt %d seq %d: %s\n"
, int(end-data), this->length()
, this->version, this->p, this->x, this->cc, this->pt, this->seq
, xsfmt(xs,sizeof(xs), data,end));
}
};
struct nal_unit_header
{
uint8_t type:5;
uint8_t nri:2;
uint8_t f:1;
static nal_unit_header* cast(uint8_t* data, uint8_t* end) {
if (data+1 > end)
return nullptr;
return reinterpret_cast<nal_unit_header*>(data);
}
unsigned length() const { return 1; }
void print(uint8_t* data, uint8_t* end) {
char xs[128] = {};
printf("%4u:%u: f %d nri %d type %d: %s\n"
, int(end-data), this->length()
, this->f, this->nri, this->type
, xsfmt(xs,sizeof(xs), data,end));
}
};
struct fu_header
{
uint8_t type:5;
uint8_t r:1;
uint8_t e:1;
uint8_t s:1;
static fu_header* cast(uint8_t* data, uint8_t* end) {
if (data + 1 > end)
return nullptr;
return reinterpret_cast<fu_header*>(data);
}
unsigned length() const { return 1; }
void print(uint8_t* data, uint8_t* end) {
char const* se = "";
if (this->s)
se = "\t:FU-A START";
else if (this->e)
se = "\t:FU-A END";
else if (this->s && this->e)
se = "\t:FU-A START&END";
char xs[128] = {};
printf("%4u:%u: s %d e %d type %d: %s%s\n"
, int(end-data), this->length()
, this->s, this->e, this->type
, xsfmt(xs,sizeof(xs), data,end), se);
}
};
struct nal_unit_sink : boost::noncopyable
{
//struct Fclose { void operator()(FILE* fp) const { if(fp)fclose(fp); } };
// std::string sps_, pps_;
FILE* dump_fp_; //std::unique_ptr<FILE,decltype(&fclose)> fp_;
explicit nal_unit_sink(FILE* fp=0) : dump_fp_(fp) {}
~nal_unit_sink() {
if (dump_fp_)
fclose(dump_fp_);
}
void sprop_parameter_sets(std::string const& sps, std::string const& pps)
{
//sps_ = std::move(sps); pps_ = std::move(pps);
std::vector<int> buf( std::max(sps.size(),pps.size())/sizeof(int)+1 );
uint8_t* begin = reinterpret_cast<uint8_t*>( &buf[0] );
memcpy(begin, sps.data(), sps.length());
write(begin, begin+sps.length());
memcpy(begin, pps.data(), pps.length());
write(begin, begin+pps.length());
}
void write(uint8_t* data, uint8_t* end) const
{
output_helper out(dump_fp_);
nal_unit_header* h1 = nal_unit_header::cast(data, end);
if (!h1)
return;
h1->print(data,end);
switch (h1->type) {
case 24: // STAP-A
data += 1; //h1->length();
while (end-data >= 2) {
uint16_t len = Ntoh<uint16_t>(data,end);
data += 2;
if (len > end - data)
break;
if (nal_unit_header* h2 = nal_unit_header::cast(data,data+len)) {
h2->print(data,data+len);
out.put(data, data+len);
data += len; //
}
}
break;
case 28: // FU-A
data += 1; //h1->length();
if (fu_header* h2 = fu_header::cast(data,end)) {
h2->print(data,end);
fu_header fuh = *h2;
if (fuh.s) {
nal_unit_header* h = nal_unit_header::cast(data,end);
h->nri = h1->nri;
h->f = h1->f;
h->print(data,end);
}
out.put(fuh.s, data + !fuh.s, end);
}
break;
default:
if (h1->type < 24) {
out.put(data, end);
} else {
ERR_MSG("nal-unit-type %d", h1->type);
}
break;
}
}
struct output_helper
{
FILE* fp_;
uint8_t* opos_;
uint8_t* oend_;
uint8_t* ohead_;
output_helper(FILE* fp, uint8_t* b=0, uint8_t* e=0) {
fp_ = fp;
ohead_ = opos_ = b;
oend_ = e;
}
~output_helper() {
;
}
unsigned avails() const { return unsigned(oend_ - opos_); }
void put(bool start_bytes, uint8_t const* data, uint8_t const* end)
{
uint8_t start_bytes4[4] = {0,0,0,1};
if (fp_) {
if (start_bytes)
fwrite(&start_bytes4, sizeof(start_bytes4), 1, fp_);
fwrite(data, end-data, 1, fp_);
}
if (avails() < 4u*start_bytes + (end - data)) {
ERR_MSG("size %u<%u", avails(), 4u*start_bytes + (end - data));
return;
}
if (start_bytes) {
std::copy(&start_bytes4[0], &start_bytes4[4], opos_);
opos_ += 4;
}
std::copy(data, end, opos_);
opos_ += (end - data);
}
void put(uint8_t const* data, uint8_t const* end) { return put(1, data, end); }
};
};
#include <sys/mman.h>
struct h264_filemmap
{
typedef std::pair<uint8_t*,uint8_t*> range;
uint8_t *begin_, *end_;
h264_filemmap(int fd) {
struct stat st; // fd = open(fn, O_RDONLY);
fstat(fd, &st); // printf("Size: %d\n", (int)st.st_size);
begin_ = (uint8_t*)mmap(NULL, st.st_size, PROT_READ, MAP_SHARED, fd, 0);
end_ = begin_ + st.st_size;
assert(begin_[0]=='\0'&& begin_[1]=='\0'&& begin_[2]=='\0'&& begin_[3]==1);
}
//~h264_filemmap() { close(fd); }
range begin() const { return find_(begin_); }
range next(range const& prev) const { return find_(prev.second); }
range find_(uint8_t* e) const {
uint8_t* b = e;
if (e+4 < end_) {
uint8_t dx[] = {0, 0, 0, 1};
b = e + 4;
e = std::search(b, end_, &dx[0], &dx[4]);
}
return std::make_pair(b,e);
}
};
struct h264file_printer : boost::noncopyable
{
nal_unit_sink nalu_;
h264_filemmap h264f_;
h264file_printer(int fd, FILE* dumpfd) : nalu_(dumpfd), h264f_(fd)
{}
int setup(int, char*[])
{
for (auto p = h264f_.begin(); p.first < p.second; p = h264f_.next(p)) {
nalu_.write(p.first, p.second);
}
return 0;
}
};
template <typename Derived>
struct rtsp_connection
{
typedef rtsp_connection<Derived> This;
//BOOST_STATIC_ASSERT(std::is_base_of<This, Derived>::value);
ip::tcp::socket tcpsock_;
ip::tcp::endpoint endpoint_;
std::string path_;
std::string session_;
boost::asio::streambuf request_;
boost::asio::streambuf response_;
int cseq_ = 1;
rtsp_connection(boost::asio::io_service& io_s, ip::tcp::endpoint ep, std::string path)
: tcpsock_(io_s), endpoint_(ep), path_(path)
{}
struct Options {
void operator()(Derived* d) const { d->on_success(*this); }
};
struct Describe {
void operator()(Derived* d) const { d->on_success(*this); }
};
struct Setup {
void operator()(Derived* d) const { d->on_success(*this); }
};
struct Play {
void operator()(Derived* d) const { d->on_success(*this); }
};
struct Teardown {
void operator()(Derived* d) const { d->on_success(*this); }
};
struct Connect {};
void connect()
{
auto handler = [this](boost::system::error_code ec) {
if (ec) {
derived()->on_error(ec, Connect{});
} else {
derived()->on_success(Connect{});
}
};
tcpsock_.async_connect( endpoint_, handler );
}
void options()
{
{
std::ostream outs(&request_);
outs << "OPTIONS " << path_ << " RTSP/1.0\r\n"
<< "CSeq: " << cseq_++ << "\r\n"
<< "\r\n";
}
boost::asio::async_write(tcpsock_, request_, Action_helper<Options>{derived()} );
}
void describe()
{
{
std::ostream outs(&request_);
outs << "DESCRIBE " << path_ << " RTSP/1.0\r\n"
<< "CSeq: " << cseq_++ << "\r\n"
<< "Accept: application/sdp\r\n"
<< "\r\n";
}
boost::asio::async_write(tcpsock_, request_, Action_helper<Describe>{derived()} );
}
void setup(std::string streamid, std::string transport)
{
{
std::ostream outs(&request_);
outs << "SETUP " << path_ <<"/"<< streamid << " RTSP/1.0\r\n"
<< "CSeq: " << cseq_++ << "\r\n"
<< "Transport: "<< transport << "\r\n"
<< "Range: 0.00-\r\n"
<< "\r\n";
}
boost::asio::async_write(tcpsock_, request_, Action_helper<Setup>{derived()} );
}
void play()
{
{
std::ostream outs(&request_);
outs << "PLAY " << path_ << " RTSP/1.0\r\n"
<< "CSeq: " << cseq_++ << "\r\n"
<< "Session: " << session_ << "\r\n"
<< "\r\n";
}
boost::asio::async_write(tcpsock_, request_, Action_helper<Play>{derived()} );
}
void teardown()
{
{
std::ostream outs(&request_);
outs << "TEARDOWN " << path_ << " RTSP/1.0\r\n"
<< "CSeq: " << cseq_++ << "\r\n"
<< "Session: " << session_ << "\r\n"
<< "\r\n";
}
boost::asio::async_write(tcpsock_, request_, Action_helper<Teardown>{derived()} );
// sync-write ?
}
private:
Derived* derived() { return static_cast<Derived*>(this); }
template <typename Action>
struct Action_helper
{
void operator()(boost::system::error_code ec, size_t) const {
auto* derived = derived_;
if (ec) {
derived->on_error(ec, Action{});
} else {
derived->response_.consume(derived->response_.size());
boost::asio::async_read_until(derived->tcpsock_, derived->response_, "\r\n\r\n"
, [derived](boost::system::error_code ec, size_t){
if (ec) {
derived->on_error(ec, Action{});
} else {
// "RTSP/1.0 200 OK"; // TODO
Action fn;
fn(derived);
}
});
}
}
Derived* derived_; // Action_helper(Derived* d) : Action{d} {}
};
};
struct rtph264_client : boost::noncopyable
{
typedef rtph264_client This;
rtph264_client(boost::asio::io_service& io_s
, ip::tcp::endpoint remote_endpoint , std::string remote_path
, FILE* dump_fp)
: rtsp_client_(this, io_s, remote_endpoint, remote_path)
, nalu_(dump_fp) //(outfile, sps, pps)
, udpsock_(io_s, ip::udp::endpoint(ip::udp::v4(), local_port()))
{}
int setup(int, char*[]) {
rtsp_client_.connect();
return 0;
}
void teardown() {
rtsp_client_.teardown();
boost::asio::io_service& io_s = udpsock_.get_io_service();
rtsp_client_.sig_teardown.connect(boost::bind(&boost::asio::io_service::stop, &io_s));
}
private: // rtsp communication
struct rtsp_client : rtsp_connection<rtsp_client>, boost::noncopyable
{
rtph264_client* thiz;
rtsp_client(rtph264_client* ptr, boost::asio::io_service& io_s, ip::tcp::endpoint remote_endpoint, std::string remote_path)
: rtsp_connection(io_s, remote_endpoint, remote_path)
{ thiz = ptr; }
void on_success(Connect) {
options();
}
void on_success(Options) {
describe();
}
void on_success(Describe)
{
std::string sps, pps, streamid;
std::istream ins(&response_);
std::string line;
bool v = 0;
while (std::getline(ins, line)) {
if (boost::starts_with(line, "m=")) {
v = boost::starts_with(line, "m=video");
} else if (v) {
if (boost::starts_with(line, "a=fmtp:")) {
boost::smatch m;
boost::regex re("sprop-parameter-sets=([^=,]+)=*,([^=,;]+)");
if (boost::regex_search(line, m, re)) {
base64dec(m[1].first, m[1].second, std::back_inserter(sps));
base64dec(m[2].first, m[2].second, std::back_inserter(pps));
}
} else if (boost::starts_with(line, "a=control:")) {
boost::smatch m;
boost::regex re("streamid=[0-9]+");
if (boost::regex_search(line, m, re)) {
streamid.assign( m[0].first, m[0].second );
}
}
}
}
thiz->nalu_.sprop_parameter_sets(sps, pps);
char transport[128];
snprintf(transport,sizeof(transport)
, "RTP/AVP;unicast;client_port=%d-%d", thiz->local_port(),thiz->local_port(+1));
setup(streamid, transport);
}
void on_success(Setup)
{
std::istream ins(&response_);
std::string line;
while (std::getline(ins, line)) {
if (boost::starts_with(line, "Session:")) {
boost::smatch m;
boost::regex re("Session:[[:space:]]*([^[:space:]]+)");
if (boost::regex_search(line, m, re)) {
session_.assign(m[1].first, m[1].second);
}
}
}
thiz->handle_receive_from(boost::system::error_code(), 0);
play();
}
void on_success(Play) {
}
void on_success(Teardown) {
sig_teardown(); // kill(getpid(), SIGQUIT);
DBG_MSG("Teardown");
}
template <typename A> void on_success(A) { DBG_MSG("success:A"); }
template <typename A>
void on_error(boost::system::error_code ec, A) {
ERR_MSG("error");
// TODO : deadline_timer reconnect
}
boost::signals2::signal<void()> sig_teardown;
};
rtsp_client rtsp_client_;
nal_unit_sink nalu_;
private:
static int local_port(int p=0) { return 3395+p; } // TODO
void handle_receive_from(const boost::system::error_code& ec, size_t bytes_recvd)
{
if (!ec && bytes_recvd > 0) {
rtp_header* h = rtp_header::cast(bufptr(), bufptr()+bytes_recvd);
if (!h)
ERR_EXIT("rtp_header::cast");
h->print(bufptr(), bufptr()+bytes_recvd); //bufptr += h->length();
nalu_.write(bufptr()+h->length(), bufptr()+bytes_recvd);
}
using namespace boost::asio;
udpsock_.async_receive_from(
boost::asio::buffer(bufptr(), BufSiz), peer_endpoint_,
boost::bind(&This::handle_receive_from, this, placeholders::error, placeholders::bytes_transferred));
}
ip::udp::socket udpsock_;
ip::udp::endpoint peer_endpoint_;
//boost::filesystem::path dir_; int dg_idx_ = 0;
//std::aligned_storage<1024*64,alignof(int)>::type data_;
uint8_t* bufptr() const { return reinterpret_cast<uint8_t*>(&const_cast<This*>(this)->buf_); }
enum { BufSiz = 1024*64 };
int buf_[BufSiz/sizeof(int)+1];
};
//#include <boost/type_erasure/member.hpp>
//BOOST_TYPE_ERASURE_MEMBER((setup_fn), setup, 2)
// BOOST_TYPE_ERASURE_MEMBER((setup_fn), ~, 0)
//boost::type_erasure::any<setup_fn<int(int,char*[])>, boost::type_erasure::_self&> ;
struct Main : boost::asio::io_service, boost::noncopyable
{
struct Args {
Args(int ac, char* av[]) {
if (ac <= 2) {
if (ac==2 && !(dump_fp = fopen(av[1], "rb")))
ERR_EXIT("file %s: fail", av[1]);
} else if (ac > 3) {
endp = ip::tcp::endpoint(ip::address::from_string(av[1]),atoi(av[2]));
path = av[3];
if (ac > 4 && !(dump_fp = fopen(av[4], "wb")))
ERR_EXIT("file %s: fail", av[2]);
} else {
ERR_EXIT("Usage: %s ...", av[0]);
}
}
ip::tcp::endpoint endp;
std::string path;
FILE* dump_fp = 0;
};
Main(int ac, char* av[]) : signals_(*this)
{
Args args(ac, av);
if (ac <= 2) {
auto* obj = new (&objmem_) h264file_printer(0, args.dump_fp);
dtor_ = [obj]() { obj->~h264file_printer(); };
setup_ = [obj](int ac,char*av[]) { obj->setup(ac,av); };
} else {
auto* obj = new (&objmem_) rtph264_client(*this, args.endp, args.path, args.dump_fp);
dtor_ = [obj]() { obj->~rtph264_client(); };
setup_ = [obj](int ac,char*av[]) { obj->setup(ac,av); };
signals_.add(SIGINT);
signals_.add(SIGTERM); // (SIGQUIT);
signals_.async_wait( [obj](boost::system::error_code, int){ obj->teardown(); } );
}
// auto* obj = reinterpret_cast<T*>(&objmem_);
}
~Main() { dtor_(); }
int run(int ac, char* av[])
{
setup_(ac, av);
return boost::asio::io_service::run();
}
private:
boost::asio::signal_set signals_;
std::function<void(int,char*[])> setup_;
std::function<void()> dtor_;
static int objmem_[sizeof(rtph264_client)/sizeof(int)+1];
};
int Main::objmem_[sizeof(rtph264_client)/sizeof(int)+1] = {};
int main(int argc, char* argv[])
{
//BOOST_SCOPE_EXIT(void){ printf("\n"); }BOOST_SCOPE_EXIT_END
try {
Main s(argc, argv);
s.run(argc, argv);
} catch (std::exception& e) {
std::cerr << "Exception: " << e.what() << "\n";
}
return 0;
}
// http://stackoverflow.com/questions/6394874/fetching-the-dimensions-of-a-h264video-stream?lq=1
//width = ((pic_width_in_mbs_minus1 +1)*16) - frame_crop_left_offset*2 - frame_crop_right_offset*2;
//height= ((2 - frame_mbs_only_flag)* (pic_height_in_map_units_minus1 +1) * 16) - (frame_crop_top_offset * 2) - (frame_crop_bottom_offset * 2);
| [
"jiyong.wu@gmail.com"
] | jiyong.wu@gmail.com |
7d182e5d1a3ff0da51a2158a3c0e843289f49762 | efe2b4dedbc6bab31ffe88c271daa5463f8649f6 | /tags/libtorrent-0_13_1/src/pe_crypto.cpp | d9298e98930cc9bcfee73417ba5911a7eda1cf27 | [] | no_license | svn2github/libtorrent | 867c84f0c271cdc255c3e268c17db75d46010dde | 8cfe21e253d8b90086bb0b15c6c881795bf12ea1 | refs/heads/master | 2020-03-30T03:50:32.931129 | 2015-01-07T23:21:54 | 2015-01-07T23:21:54 | 17,344,601 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 4,902 | cpp | /*
Copyright (c) 2007, Un Shyam & Arvid Norberg
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in
the documentation and/or other materials provided with the distribution.
* Neither the name of the author nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef TORRENT_DISABLE_ENCRYPTION
#include <algorithm>
#include <openssl/dh.h>
#include <openssl/engine.h>
#include "libtorrent/pe_crypto.hpp"
#include "libtorrent/assert.hpp"
namespace libtorrent
{
// Set the prime P and the generator, generate local public key
DH_key_exchange::DH_key_exchange()
{
m_DH = DH_new();
if (m_DH == 0) throw std::bad_alloc();
m_DH->p = BN_bin2bn(m_dh_prime, sizeof(m_dh_prime), NULL);
m_DH->g = BN_bin2bn(m_dh_generator, sizeof(m_dh_generator), NULL);
if (m_DH->p == 0 || m_DH->g == 0)
{
DH_free(m_DH);
throw std::bad_alloc();
}
m_DH->length = 160l;
TORRENT_ASSERT(sizeof(m_dh_prime) == DH_size(m_DH));
if (DH_generate_key(m_DH) == 0 || m_DH->pub_key == 0)
{
DH_free(m_DH);
throw std::bad_alloc();
}
// DH can generate key sizes that are smaller than the size of
// P with exponentially decreasing probability, in which case
// the msb's of m_dh_local_key need to be zeroed
// appropriately.
int key_size = get_local_key_size();
int len_dh = sizeof(m_dh_prime); // must equal DH_size(m_DH)
if (key_size != len_dh)
{
TORRENT_ASSERT(key_size > 0 && key_size < len_dh);
int pad_zero_size = len_dh - key_size;
std::fill(m_dh_local_key, m_dh_local_key + pad_zero_size, 0);
BN_bn2bin(m_DH->pub_key, (unsigned char*)m_dh_local_key + pad_zero_size);
}
else
BN_bn2bin(m_DH->pub_key, (unsigned char*)m_dh_local_key); // TODO Check return value
}
DH_key_exchange::~DH_key_exchange()
{
TORRENT_ASSERT(m_DH);
DH_free(m_DH);
}
char const* DH_key_exchange::get_local_key() const
{
return m_dh_local_key;
}
// compute shared secret given remote public key
void DH_key_exchange::compute_secret(char const* remote_pubkey)
{
TORRENT_ASSERT(remote_pubkey);
BIGNUM* bn_remote_pubkey = BN_bin2bn ((unsigned char*)remote_pubkey, 96, NULL);
if (bn_remote_pubkey == 0) throw std::bad_alloc();
char dh_secret[96];
int secret_size = DH_compute_key((unsigned char*)dh_secret
, bn_remote_pubkey, m_DH);
if (secret_size < 0 || secret_size > 96) throw std::bad_alloc();
if (secret_size != 96)
{
TORRENT_ASSERT(secret_size < 96 && secret_size > 0);
std::fill(m_dh_secret, m_dh_secret + 96 - secret_size, 0);
}
std::copy(dh_secret, dh_secret + secret_size, m_dh_secret + 96 - secret_size);
BN_free(bn_remote_pubkey);
}
char const* DH_key_exchange::get_secret() const
{
return m_dh_secret;
}
const unsigned char DH_key_exchange::m_dh_prime[96] = {
0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xC9, 0x0F, 0xDA, 0xA2,
0x21, 0x68, 0xC2, 0x34, 0xC4, 0xC6, 0x62, 0x8B, 0x80, 0xDC, 0x1C, 0xD1,
0x29, 0x02, 0x4E, 0x08, 0x8A, 0x67, 0xCC, 0x74, 0x02, 0x0B, 0xBE, 0xA6,
0x3B, 0x13, 0x9B, 0x22, 0x51, 0x4A, 0x08, 0x79, 0x8E, 0x34, 0x04, 0xDD,
0xEF, 0x95, 0x19, 0xB3, 0xCD, 0x3A, 0x43, 0x1B, 0x30, 0x2B, 0x0A, 0x6D,
0xF2, 0x5F, 0x14, 0x37, 0x4F, 0xE1, 0x35, 0x6D, 0x6D, 0x51, 0xC2, 0x45,
0xE4, 0x85, 0xB5, 0x76, 0x62, 0x5E, 0x7E, 0xC6, 0xF4, 0x4C, 0x42, 0xE9,
0xA6, 0x3A, 0x36, 0x21, 0x00, 0x00, 0x00, 0x00, 0x00, 0x09, 0x05, 0x63
};
const unsigned char DH_key_exchange::m_dh_generator[1] = { 2 };
} // namespace libtorrent
#endif // #ifndef TORRENT_DISABLE_ENCRYPTION
| [
"arvidn@f43f7eb3-cfe1-5f9d-1b5f-e45aa6702bda"
] | arvidn@f43f7eb3-cfe1-5f9d-1b5f-e45aa6702bda |
8f109ed16da38985c6f45199d32f7a55f04da084 | 5ec26549d5b015dad74d69bd1c1b86539b37bc13 | /include/aul/memory/Memory_mapped_allocator.hpp | 9c8f57d41fa9c994c8af30d3b86983b4918ac5c7 | [] | no_license | Avereniect/AUL | 53347e964984af874cd949c7b9339aa626bb778c | 4acde9fc7c7145c8c6d869ad3480baa88f74d34a | refs/heads/master | 2023-04-11T07:59:17.114821 | 2023-04-07T19:11:46 | 2023-04-07T19:11:46 | 194,426,858 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,818 | hpp | //
// Created by avereniect on 2/23/22.
//
#ifndef AUL_MEMORY_MAPPED_ALLOCATOR_HPP
#define AUL_MEMORY_MAPPED_ALLOCATOR_HPP
#ifndef __linux__
static_assert(false, "OS not supported");
#endif
#include <sys/mman.h>
#include <cstdint>
namespace aul {
template<class T>
class Memory_mapped_allocator {
public:
//=================================================
// Type aliases
//=================================================
using value_type = T;
using pointer = T*;
using const_pointer = const T*;
using void_pointer = void*;
using const_void_pointer = const void*;
using size_type = std::size_t;
using difference_type = std::ptrdiff_t;
//=================================================
// -ctors
//=================================================
Memory_mapped_allocator();
~Memory_mapped_allocator() {
if (ptr) {
munmap(ptr, allocation_size);
}
}
//=================================================
// Assignment operators
//=================================================
//=================================================
// Allocation methods
//=================================================
//=================================================
// Object creation methods
//=================================================
//=================================================
// Instance members
//=================================================
private:
int file_descriptor = -1;
size_type allocation_size = 0;
pointer ptr;
};
}
#endif //AUL_MEMORY_MAPPED_ALLOCATOR_HPP
| [
"Avereniect@gmail.com"
] | Avereniect@gmail.com |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.