{"size":7119,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["BSD-2-Clause"],"max_stars_count":2.0,"content":"\/\/----------------------------------------------------------------------------\n\/\/\n\/\/ TSDuck - The MPEG Transport Stream Toolkit\n\/\/ Copyright (c) 2005-2020, Thierry Lelegard\n\/\/ All rights reserved.\n\/\/\n\/\/ Redistribution and use in source and binary forms, with or without\n\/\/ modification, are permitted provided that the following conditions are met:\n\/\/\n\/\/ 1. Redistributions of source code must retain the above copyright notice,\n\/\/ this list of conditions and the following disclaimer.\n\/\/ 2. Redistributions in binary form must reproduce the above copyright\n\/\/ notice, this list of conditions and the following disclaimer in the\n\/\/ documentation and\/or other materials provided with the distribution.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n\/\/ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\/\/ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\/\/ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n\/\/ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n\/\/ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n\/\/ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n\/\/ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n\/\/ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF\n\/\/ THE POSSIBILITY OF SUCH DAMAGE.\n\/\/\n\/\/----------------------------------------------------------------------------\n\n#include \"tsStreamEventDescriptor.h\"\n#include \"tsDescriptor.h\"\n#include \"tsTablesDisplay.h\"\n#include \"tsTablesFactory.h\"\n#include \"tsxmlElement.h\"\nTSDUCK_SOURCE;\n\n#define MY_XML_NAME u\"stream_event_descriptor\"\n#define MY_DID ts::DID_STREAM_EVENT\n#define MY_STD ts::STD_MPEG\n\nTS_XML_DESCRIPTOR_FACTORY(ts::StreamEventDescriptor, MY_XML_NAME);\nTS_ID_DESCRIPTOR_FACTORY(ts::StreamEventDescriptor, ts::EDID::Standard(MY_DID));\nTS_FACTORY_REGISTER(ts::StreamEventDescriptor::DisplayDescriptor, ts::EDID::Standard(MY_DID));\n\n\n\/\/----------------------------------------------------------------------------\n\/\/ Constructors\n\/\/----------------------------------------------------------------------------\n\nts::StreamEventDescriptor::StreamEventDescriptor(uint16_t id, uint64_t npt) :\n AbstractDescriptor(MY_DID, MY_XML_NAME, MY_STD, 0),\n event_id(id),\n event_NPT(npt),\n private_data()\n{\n _is_valid = true;\n}\n\nts::StreamEventDescriptor::StreamEventDescriptor(DuckContext& duck, const Descriptor& desc) :\n StreamEventDescriptor()\n{\n deserialize(duck, desc);\n}\n\n\n\/\/----------------------------------------------------------------------------\n\/\/ Serialization\n\/\/----------------------------------------------------------------------------\n\nvoid ts::StreamEventDescriptor::serialize(DuckContext& duck, Descriptor& desc) const\n{\n ByteBlockPtr bbp(serializeStart());\n bbp->appendUInt16(event_id);\n bbp->appendUInt64(TS_UCONST64(0xFFFFFFFE00000000) | event_NPT);\n bbp->append(private_data);\n serializeEnd(desc, bbp);\n}\n\n\n\/\/----------------------------------------------------------------------------\n\/\/ Deserialization\n\/\/----------------------------------------------------------------------------\n\nvoid ts::StreamEventDescriptor::deserialize(DuckContext& duck, const Descriptor& desc)\n{\n _is_valid = desc.isValid() && desc.tag() == _tag && desc.payloadSize() >= 10;\n\n if (_is_valid) {\n const uint8_t* data = desc.payload();\n size_t size = desc.payloadSize();\n event_id = GetUInt16(data);\n event_NPT = GetUInt64(data + 2) & TS_UCONST64(0x00000001FFFFFFFF);\n private_data.copy (data + 10, size - 10);\n }\n}\n\n\n\/\/----------------------------------------------------------------------------\n\/\/ Check if all bytes in private part are ASCII characters.\n\/\/----------------------------------------------------------------------------\n\nbool ts::StreamEventDescriptor::asciiPrivate() const\n{\n bool ascii = !private_data.empty();\n for (size_t i = 0; ascii && i < private_data.size(); ++i) {\n ascii = private_data[i] >= 0x20 && private_data[i] < 0x80;\n }\n return ascii;\n}\n\n\n\/\/----------------------------------------------------------------------------\n\/\/ Static method to display a descriptor.\n\/\/----------------------------------------------------------------------------\n\nvoid ts::StreamEventDescriptor::DisplayDescriptor(TablesDisplay& display, DID did, const uint8_t* data, size_t size, int indent, TID tid, PDS pds)\n{\n std::ostream& strm(display.duck().out());\n\n if (size >= 10) {\n const std::string margin(indent, ' ');\n\n \/\/ Extract common part\n const uint16_t id = GetUInt16(data);\n const uint64_t npt = GetUInt64(data + 2) & TS_UCONST64(0x00000001FFFFFFFF);\n data += 10; size -= 10;\n\n strm << margin << UString::Format(u\"Event id: 0x%X (%d), NPT: 0x%09X (%d)\", {id, id, npt, npt}) << std::endl;\n\n \/\/ Private part.\n if (size > 0) {\n strm << margin << \"Private data:\" << std::endl\n << UString::Dump(data, size, UString::HEXA | UString::ASCII | UString::OFFSET, indent);\n data += size; size = 0;\n }\n }\n\n display.displayExtraData(data, size, indent);\n}\n\n\n\/\/----------------------------------------------------------------------------\n\/\/ XML serialization\n\/\/----------------------------------------------------------------------------\n\nvoid ts::StreamEventDescriptor::buildXML(DuckContext& duck, xml::Element* root) const\n{\n root->setIntAttribute(u\"event_id\", event_id, true);\n root->setIntAttribute(u\"event_NPT\", event_NPT, true);\n if (!private_data.empty()) {\n if (asciiPrivate()) {\n root->addElement(u\"private_text\")->addText(UString::FromUTF8(reinterpret_cast(private_data.data()), private_data.size()));\n }\n else {\n root->addElement(u\"private_data\")->addHexaText(private_data);\n }\n }\n}\n\n\n\/\/----------------------------------------------------------------------------\n\/\/ XML deserialization\n\/\/----------------------------------------------------------------------------\n\nvoid ts::StreamEventDescriptor::fromXML(DuckContext& duck, const xml::Element* element)\n{\n UString text;\n\n _is_valid =\n checkXMLName(element) &&\n element->getIntAttribute(event_id, u\"event_id\", true, 0, 0x0000, 0xFFFF) &&\n element->getIntAttribute(event_NPT, u\"event_NPT\", true, 0, 0, TS_UCONST64(0x00000001FFFFFFFF)) &&\n element->getHexaTextChild(private_data, u\"private_data\", false, 0, MAX_DESCRIPTOR_SIZE - 10) &&\n element->getTextChild(text, u\"private_text\", false, false, UString(), 0, MAX_DESCRIPTOR_SIZE - 10);\n\n if (_is_valid && !text.empty()) {\n if (private_data.empty()) {\n private_data.appendUTF8(text);\n }\n else {\n element->report().error(u\"In <%s> at line %d, and are mutually exclusive\", {element->name(), element->lineNumber()});\n }\n }\n}\n","avg_line_length":38.4810810811,"max_line_length":159,"alphanum_fraction":0.5673549656,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":1783,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":13.0,"content":"#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#define MAXN 500\n\nusing namespace std;\n\nint visited[ MAXN + 1 ], par[ MAXN + 1 ], flow[ MAXN + 1 ][ MAXN + 1 ], cap[ MAXN + 1 ][ MAXN + 1 ];\n\nbool bfs( int s, int t ) {\n memset( par, 0, sizeof( par ) );\n memset( visited, 0, sizeof( visited ) );\n queue< int > Q;\n Q.push( s );\n visited[ s ] = true;\n par[ s ] = -1;\n while( !Q.empty() ) {\n int u = Q.front();\n Q.pop();\n for( int i = 0; i < MAXN; i++ ) {\n if( !visited[ i ] && cap[ u ][ i ] - flow[ u ][ i ] > 0 ) {\n visited[ i ] = true;\n par[ i ] = u;\n Q.push( i );\n }\n }\n }\n return visited[ t ];\n}\n\nint maxflow( int s, int t ) {\n int ans = 0;\n while( bfs( s, t ) ) {\n int aug = 250;\n for( int i = t; i != s; i = par[ i ] ) {\n aug = min( aug, cap[ par[ i ] ][ i ] - flow[ par[ i ] ][ i ] );\n }\n ans += aug;\n for( int i = t; i != s; i = par[ i ] ) {\n flow[ par[ i ] ][ i ] += aug;\n flow[ i ][ par[ i ] ] -= aug;\n }\n }\n return ans;\n}\n\nint main( void ) {\n int N, x, y;\n scanf(\"%d\\n\", &N );\n for( int i = 1; i <= N; i++ ) {\n int y;\n for( int j = 1; j <= N; j++ ) cap[ i ][ j + 205 ] = 1;\n cap[ i ][ i + 205 ] = 0;\n int enterNumber;\n std::string line;\n getline(std::cin, line);\n std::istringstream iss(line);\n while (iss >> enterNumber)\n {\n cap[ i ][ enterNumber + 1 + 205 ] = 0;\n }\n }\n for( int i = 0; i < 205; i++ ) {\n cap[ 420 ][ i ] = 1;\n cap[ i + 205 ][ 421 ] = 1;\n }\n printf(\"%d\\n\", N - maxflow( 420, 421 ) );\n memset( flow, 0, sizeof( flow ) );\n memset( cap, 0, sizeof( cap ) );\n return 0;\n}\n","avg_line_length":23.1558441558,"max_line_length":100,"alphanum_fraction":0.4391475042,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":2606,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":28.0,"content":"\/* TEMPLATE GENERATED TESTCASE FILE\r\nFilename: CWE590_Free_Memory_Not_on_Heap__delete_int_static_41.cpp\r\nLabel Definition File: CWE590_Free_Memory_Not_on_Heap__delete.nonpointer.label.xml\r\nTemplate File: sources-sink-41.tmpl.cpp\r\n*\/\r\n\/*\r\n * @description\r\n * CWE: 590 Free Memory Not on Heap\r\n * BadSource: static Data buffer is declared static on the stack\r\n * GoodSource: Allocate memory on the heap\r\n * Sink:\r\n * BadSink : Print then free data\r\n * Flow Variant: 41 Data flow: data passed as an argument from one function to another in the same source file\r\n *\r\n * *\/\r\n\r\n#include \"std_testcase.h\"\r\n\r\n#include \r\n\r\nnamespace CWE590_Free_Memory_Not_on_Heap__delete_int_static_41\r\n{\r\n\r\n#ifndef OMITBAD\r\n\r\nvoid badSink(int * data)\r\n{\r\n printIntLine(*data);\r\n \/* POTENTIAL FLAW: Possibly deallocating memory allocated on the stack *\/\r\n delete data;\r\n}\r\n\r\nvoid bad()\r\n{\r\n int * data;\r\n data = NULL; \/* Initialize data *\/\r\n {\r\n \/* FLAW: data is allocated on the stack and deallocated in the BadSink *\/\r\n static int dataBuffer;\r\n dataBuffer = 5;\r\n data = &dataBuffer;\r\n }\r\n badSink(data);\r\n}\r\n\r\n#endif \/* OMITBAD *\/\r\n\r\n#ifndef OMITGOOD\r\n\r\nvoid goodG2BSink(int * data)\r\n{\r\n printIntLine(*data);\r\n \/* POTENTIAL FLAW: Possibly deallocating memory allocated on the stack *\/\r\n delete data;\r\n}\r\n\r\n\/* goodG2B uses the GoodSource with the BadSink *\/\r\nstatic void goodG2B()\r\n{\r\n int * data;\r\n data = NULL; \/* Initialize data *\/\r\n {\r\n \/* FIX: data is allocated on the heap and deallocated in the BadSink *\/\r\n int * dataBuffer = new int;\r\n *dataBuffer = 5;\r\n data = dataBuffer;\r\n }\r\n goodG2BSink(data);\r\n}\r\n\r\nvoid good()\r\n{\r\n goodG2B();\r\n}\r\n\r\n#endif \/* OMITGOOD *\/\r\n\r\n} \/* close namespace *\/\r\n\r\n\/* Below is the main(). It is only used when building this testcase on\r\n its own for testing or for building a binary to use in testing binary\r\n analysis tools. It is not used when compiling all the testcases as one\r\n application, which is how source code analysis tools are tested. *\/\r\n\r\n#ifdef INCLUDEMAIN\r\n\r\nusing namespace CWE590_Free_Memory_Not_on_Heap__delete_int_static_41; \/* so that we can use good and bad easily *\/\r\n\r\nint main(int argc, char * argv[])\r\n{\r\n \/* seed randomness *\/\r\n srand( (unsigned)time(NULL) );\r\n#ifndef OMITGOOD\r\n printLine(\"Calling good()...\");\r\n good();\r\n printLine(\"Finished good()\");\r\n#endif \/* OMITGOOD *\/\r\n#ifndef OMITBAD\r\n printLine(\"Calling bad()...\");\r\n bad();\r\n printLine(\"Finished bad()\");\r\n#endif \/* OMITBAD *\/\r\n return 0;\r\n}\r\n\r\n#endif\r\n","avg_line_length":24.3551401869,"max_line_length":115,"alphanum_fraction":0.6508058327,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":3055,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["BSD-3-Clause"],"max_stars_count":null,"content":"\/**\n * @file arrays_example1.cpp\n * @brief arrays create example\n * @author Sarah Keating\n *\n * \n *\/\n\n#include \n#include \n\n\nusing namespace std;\nLIBSBML_CPP_NAMESPACE_USE\n\nint\nmain (int argc, char* argv[])\n{\n SBMLNamespaces sbmlns(3,1,\"arrays\",1);\n\n \/\/ create the document\n\n SBMLDocument *document = new SBMLDocument(&sbmlns);\n\n \/\/ set the required attribute to true\n ArraysSBMLDocumentPlugin * docPlug = \n static_cast(document->getPlugin(\"arrays\"));\n docPlug->setRequired(true);\n\n\n \/\/ create the Model\n\n Model* model=document->createModel();\n\n \/\/ create the parameters\n\n Parameter * p = model->createParameter();\n p->setId(\"n\");\n p->setConstant(true);\n p->setValue(10);\n\n \/\/ second parameter\n p = model->createParameter();\n p->setId(\"x\");\n p->setConstant(false);\n\n\n \/\/ create the Dimensions via the Plugin\n ArraysSBasePlugin * arraysPlug = \n static_cast(p->getPlugin(\"arrays\"));\n Dimension * dim = arraysPlug->createDimension();\n dim->setDim(0);\n dim->setSize(\"n\");\n\n \/\/ third parameter\n p = model->createParameter();\n p->setId(\"y\");\n p->setConstant(true);\n p->setValue(2.3);\n\n\n\n \/\/ create the initialAssignment\n InitialAssignment *ia = model->createInitialAssignment();\n ia->setSymbol(\"x\");\n\n ASTNode * math = new ASTNode(AST_LINEAR_ALGEBRA_VECTOR_CONSTRUCTOR);\n \n ASTNode * ci1 = new ASTNode(AST_NAME);\n ci1->setName(\"y\");\n \n ASTNode * ci2 = new ASTNode(AST_INTEGER);\n ci2->setValue(2);\n\n ASTNode * c1 = new ASTNode(AST_FUNCTION_COS);\n ASTNode * c11 = new ASTNode(AST_INTEGER);\n c11->setValue(5);\n c1->addChild(c11);\n\n math->addChild(ci1);\n math->addChild(ci2);\n math->addChild(c1);\n math->setClass(\"ss\");\n ia->setMath(math);\n\n writeSBML(document,\"arrays_example2.xml\");\n \n delete document;\n\n return 0;\n}\n","avg_line_length":27.2767857143,"max_line_length":79,"alphanum_fraction":0.6664484452,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":4241,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":20.0,"content":"\/*\n\tmpg123clr: MPEG Audio Decoder library Common Language Runtime version.\n\n\tcopyright 2009-2011 by Malcolm Boczek - free software under the terms of the LGPL 2.1\n\tmpg123clr.dll is a derivative work of libmpg123 - all original mpg123 licensing terms apply.\n\n\tAll rights to this work freely assigned to the mpg123 project.\n*\/\n\/*\n\tlibmpg123: MPEG Audio Decoder library\n\n\tcopyright 1995-2011 by the mpg123 project - free software under the terms of the LGPL 2.1\n\tsee COPYING and AUTHORS files in distribution or http:\/\/mpg123.org\n\n*\/\n\/*\n\t1.8.1.0\t04-Aug-09\tInitial release.\n\t1.9.0.0 24-Sep-09\tFunction names harmonized with libmpg123 (mb)\n\t1.9.0.0 01-Oct-09\tTechnical cleanup - subst nullptr for NULL (mb)\n\t1.13.0.0 13-Jan-11\trelease match - added strlen (mb)\n*\/\n\n#include \"StdAfx.h\"\n#include \"string.h\"\n\n\/\/ Constructor for overlaid instance (instanced)\nmpg123clr::mpg123str::mpg123str(void)\n{\n\tinstanced = true;\n\tsb = new ::mpg123_string;\n\tmpg123_init_string();\n\n}\n\n\/\/ Constructor for mpg123_string handle instance (referenced)\nmpg123clr::mpg123str::mpg123str(mpg123_string* sb)\n{\n\tinstanced = false;\n\tthis->sb = sb;\n}\n\nmpg123clr::mpg123str::mpg123str(const char* str)\n{\n\tinstanced = true;\n\tsb = new ::mpg123_string;\n\tmpg123_init_string();\n\n\t::mpg123_set_string(sb, str);\n}\n\n\/\/ Destructor cleans up all resources\nmpg123clr::mpg123str::~mpg123str(void)\n{\n\t\/\/ clean up code to release managed resources\n\t\/\/ ...\n\n\t\/\/ call Finalizer to clean up unmanaged resources\n\tthis->!mpg123str();\n}\n\n\/\/ Finalizer cleans up unmanaged resources\nmpg123clr::mpg123str::!mpg123str(void)\n{\n\tif (instanced && (sb != nullptr)) mpg123_free_string();\n}\n\nint mpg123clr::mpg123str::mpg123_add_string(String ^ s)\n{\n\treturn mpg123_add_substring(s, 0, s->Length);\n}\n\nint mpg123clr::mpg123str::mpg123_add_substring(String ^ s, int from, int count)\n{\n\t\/\/ convert CLR string to CLI string\n\tusing namespace Runtime::InteropServices;\n\tconst char* chars = (const char*)(Marshal::StringToHGlobalAnsi(s->Substring(from, count))).ToPointer();\n\n\t\/\/ add mpg123_string info\n\tint ret = ::mpg123_add_string(sb, chars);\n\n\t\/\/ free temporary memory\n\tMarshal::FreeHGlobal(IntPtr((void*)chars));\n\n\treturn ret;\n}\n\nint mpg123clr::mpg123str::mpg123_copy_string(mpg123str^ to)\n{\n\treturn ::mpg123_copy_string(sb, to->sb);\n}\n\nvoid mpg123clr::mpg123str::mpg123_free_string()\n{\n\t::mpg123_free_string(sb);\n}\n\nint mpg123clr::mpg123str::mpg123_grow_string(int newSize)\n{\n\treturn ::mpg123_grow_string(sb, newSize);\n}\n\nint mpg123clr::mpg123str::mpg123_resize_string(int newSize)\n{\n\treturn ::mpg123_resize_string(sb, newSize);\n}\n\nvoid mpg123clr::mpg123str::mpg123_init_string()\n{\n\t::mpg123_init_string(sb);\n}\n\nint mpg123clr::mpg123str::mpg123_set_string(String ^ s)\n{\n\treturn mpg123_set_substring(s, 0, s->Length);\n}\n\nint mpg123clr::mpg123str::mpg123_set_substring(String ^ s, int from, int count)\n{\n\t\/\/ convert CLR string to CLI string\n\tusing namespace Runtime::InteropServices;\n\tconst char* chars = (const char*)(Marshal::StringToHGlobalAnsi(s->Substring(from, count))).ToPointer();\n\n\t\/\/ set mpg123_string info\n\tint ret = ::mpg123_set_string(sb, chars);\n\n\t\/\/ free temporary memory\n\tMarshal::FreeHGlobal(IntPtr((void*)chars));\n\n\treturn ret;\n}\n\nlong long mpg123clr::mpg123str::mpg123_strlen(bool utf8)\n{\n\t\/\/ TODO: determine use for utf8 vs ansi\n\treturn ::mpg123_strlen(sb, utf8);\n}\n\nint mpg123clr::mpg123str::Fill::get()\n{\n\t\/\/ WARN 4267 - clr limited to 32bit-length-size strings by PtrToStringAnsi\n\treturn (int)sb->fill;\n}\n\nint mpg123clr::mpg123str::Size::get()\n{\n\t\/\/ WARN 4267 - clr limited to 32bit-length-size strings by PtrToStringAnsi\n\treturn (int)sb->size;\n}\n\nString^ mpg123clr::mpg123str::Text::get()\n{\n\tif (sb->fill == 0) return gcnew String(\"\");\n\n\t\/\/ WARN 4267 - clr limited to 32bit-length-size strings by PtrToStringAnsi\n\treturn Marshal::PtrToStringAnsi((IntPtr)sb->p, (int)strnlen(sb->p, sb->fill));\n}\n\nmpg123clr::mpg123str::text_encoding mpg123clr::mpg123str::mpg123_enc_from_id3(unsigned char id3_enc_byte)\n{\n\treturn (mpg123clr::mpg123str::text_encoding) ::mpg123_enc_from_id3(id3_enc_byte);\n}\n\nint mpg123clr::mpg123str::mpg123_store_utf8(text_encoding enc, const unsigned char *source, size_t source_size)\n{\n\treturn ::mpg123_store_utf8(sb, (mpg123_text_encoding)enc, source, source_size);\n}\n","avg_line_length":25.3952095808,"max_line_length":111,"alphanum_fraction":0.7425135581,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":9316,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":8.0,"content":"\/\/\n\/\/ ast.cpp\n\/\/\n\/\/ Created by Edmund Kapusniak on 28\/09\/2019.\n\/\/ Copyright \u00a9 2019 Edmund Kapusniak.\n\/\/\n\/\/ Licensed under the MIT License. See LICENSE file in the project root for\n\/\/ full license information.\n\/\/\n\n#include \"ast.h\"\n#include \"..\/common\/escape_string.h\"\n\nnamespace kf\n{\n\n#ifdef _MSC_VER\n#define INIT( x )\n#else\n#define INIT( x ) [ x ] =\n#endif\n\nconst char* const AST_NODE_NAME[] =\n{\n INIT( AST_NONE ) \"NONE\",\n\n INIT( AST_EXPR_LENGTH ) \"EXPR_LENGTH\",\n INIT( AST_EXPR_NEG ) \"EXPR_NEG\",\n INIT( AST_EXPR_POS ) \"EXPR_POS\",\n INIT( AST_EXPR_BITNOT ) \"EXPR_BITNOT\",\n INIT( AST_EXPR_MUL ) \"EXPR_MUL\",\n INIT( AST_EXPR_DIV ) \"EXPR_DIV\",\n INIT( AST_EXPR_INTDIV ) \"EXPR_INTDIV\",\n INIT( AST_EXPR_MOD ) \"EXPR_MOD\",\n INIT( AST_EXPR_ADD ) \"EXPR_ADD\",\n INIT( AST_EXPR_SUB ) \"EXPR_SUB\",\n INIT( AST_EXPR_CONCAT ) \"EXPR_CONCAT\",\n INIT( AST_EXPR_LSHIFT ) \"EXPR_LSHIFT\",\n INIT( AST_EXPR_RSHIFT ) \"EXPR_RSHIFT\",\n INIT( AST_EXPR_ASHIFT ) \"EXPR_ASHIFT\",\n INIT( AST_EXPR_BITAND ) \"EXPR_BITAND\",\n INIT( AST_EXPR_BITXOR ) \"EXPR_BITXOR\",\n INIT( AST_EXPR_BITOR ) \"EXPR_BITOR\",\n\n INIT( AST_EXPR_PAREN ) \"EXPR_PAREN\",\n\n INIT( AST_EXPR_NULL ) \"EXPR_NULL\",\n INIT( AST_EXPR_FALSE ) \"EXPR_FALSE\",\n INIT( AST_EXPR_TRUE ) \"EXPR_TRUE\",\n INIT( AST_EXPR_NUMBER ) \"EXPR_NUMBER\",\n INIT( AST_EXPR_STRING ) \"EXPR_STRING\",\n\n INIT( AST_EXPR_COMPARE ) \"EXPR_COMPARE\",\n INIT( AST_OP_EQ ) \"OP_EQ\",\n INIT( AST_OP_NE ) \"OP_NE\",\n INIT( AST_OP_LT ) \"OP_LT\",\n INIT( AST_OP_LE ) \"OP_LE\",\n INIT( AST_OP_GT ) \"OP_GT\",\n INIT( AST_OP_GE ) \"OP_GE\",\n INIT( AST_OP_IS ) \"OP_IS\",\n INIT( AST_OP_IS_NOT ) \"OP_IS_NOT\",\n\n INIT( AST_EXPR_NOT ) \"EXPR_NOT\",\n INIT( AST_EXPR_AND ) \"EXPR_AND\",\n INIT( AST_EXPR_OR ) \"EXPR_OR\",\n INIT( AST_EXPR_IF ) \"EXPR_IF\",\n INIT( AST_EXPR_ELIF ) \"EXPR_ELIF\",\n\n INIT( AST_EXPR_KEY ) \"EXPR_KEY\",\n INIT( AST_EXPR_INDEX ) \"EXPR_INDEX\",\n INIT( AST_EXPR_CALL ) \"EXPR_CALL\",\n INIT( AST_EXPR_UNPACK ) \"EXPR_UNPACK\",\n INIT( AST_EXPR_ARRAY ) \"EXPR_ARRAY\",\n INIT( AST_EXPR_TABLE ) \"EXPR_TABLE\",\n INIT( AST_TABLE_KEY ) \"TABLE_KEY\",\n\n INIT( AST_EXPR_YIELD ) \"RVAL_YIELD\",\n INIT( AST_EXPR_YIELD_FOR ) \"RVAL_YIELD_FOR\",\n\n INIT( AST_DECL_VAR ) \"DECL_VAR\",\n INIT( AST_DECL_DEF ) \"DECL_DEF\",\n INIT( AST_RVAL_ASSIGN ) \"RVAL_ASSIGN\",\n INIT( AST_RVAL_OP_ASSIGN ) \"RVAL_OP_ASSIGN\",\n INIT( AST_NAME_LIST ) \"NAME_LIST\",\n INIT( AST_LVAL_LIST ) \"LVAL_LIST\",\n INIT( AST_RVAL_LIST ) \"RVAL_LIST\",\n\n INIT( AST_FUNCTION ) \"FUNCTION\",\n INIT( AST_PARAMETERS ) \"PARAMETERS\",\n INIT( AST_VARARG_PARAM ) \"VARARG_PARAM\",\n\n INIT( AST_BLOCK ) \"BLOCK\",\n\n INIT( AST_STMT_IF ) \"STMT_IF\",\n INIT( AST_STMT_ELIF ) \"STMT_ELIF\",\n INIT( AST_STMT_FOR_STEP ) \"STMT_FOR_STEP\",\n INIT( AST_STMT_FOR_EACH ) \"STMT_FOR_EACH\",\n INIT( AST_STMT_WHILE ) \"STMT_WHILE\",\n INIT( AST_STMT_REPEAT ) \"STMT_REPEAT\",\n INIT( AST_STMT_BREAK ) \"STMT_BREAK\",\n INIT( AST_STMT_CONTINUE ) \"STMT_CONTINUE\",\n INIT( AST_STMT_RETURN ) \"STMT_RETURN\",\n INIT( AST_STMT_THROW ) \"STMT_THROW\",\n\n INIT( AST_DEF_FUNCTION ) \"DEF_FUNCTION\",\n INIT( AST_DEF_OBJECT ) \"DEF_OBJECT\",\n INIT( AST_OBJECT_PROTOTYPE ) \"OBJECT_PROTOTYPE\",\n INIT( AST_OBJECT_KEY ) \"OBJECT_KEY\",\n\n INIT( AST_NAME ) \"EXPR_NAME\",\n INIT( AST_OBJKEY_DECL ) \"OBJKEY_DECL\",\n INIT( AST_LOCAL_DECL ) \"LOCAL_DECL\",\n INIT( AST_LOCAL_NAME ) \"LOCAL_NAME\",\n INIT( AST_SUPER_NAME ) \"SUPER_NAME\",\n INIT( AST_OUTENV_NAME ) \"OUTENV_NAME\",\n INIT( AST_GLOBAL_NAME ) \"GLOBAL_NAME\",\n};\n\nast_script::ast_script()\n{\n}\n\nast_script::~ast_script()\n{\n}\n\nast_function* ast_script::new_function( srcloc sloc, ast_function* outer )\n{\n functions.append( std::make_unique< ast_function >( sloc, this, outer, (unsigned)functions.size() ) );\n return functions.back().get();\n}\n\nvoid ast_script::debug_print() const\n{\n for ( const auto& function : functions )\n {\n function->debug_print();\n }\n}\n\nast_function::ast_function( srcloc sloc, ast_script* script, ast_function* outer, unsigned index )\n : sloc( sloc )\n , script( script )\n , outer( outer )\n , index( index )\n , parameter_count( 0 )\n , implicit_self( false )\n , is_generator( false )\n , is_top_level( false )\n , is_varargs( false )\n{\n}\n\nast_function::~ast_function()\n{\n}\n\nvoid ast_function::fixup_nodes()\n{\n \/\/ Calculate next sibling pointers.\n unsigned last_index = 0;\n for ( unsigned index = 0; index < nodes.size(); ++index )\n {\n if ( index )\n {\n \/\/ Link last child node to its parent.\n nodes[ last_index ].next_index = index;\n\n \/\/ Remember if last index so we can move backwards in vector.\n if ( nodes[ last_index ].leaf )\n {\n nodes[ index ].prev_leaf = true;\n }\n }\n last_index = index;\n\n \/\/ Find oldest descendant.\n unsigned node_index = index;\n unsigned child_index = nodes[ node_index ].child_index;\n while ( child_index != node_index )\n {\n node_index = child_index;\n child_index = nodes[ node_index ].child_index;\n }\n\n \/\/ Previous node is the node before the oldest descendant.\n if ( child_index )\n {\n unsigned prev_index = child_index - 1;\n if ( nodes[ child_index ].prev_leaf )\n {\n prev_index -= 1;\n }\n nodes[ prev_index ].next_index = index;\n }\n\n \/\/ Skip leaf data.\n if ( nodes[ index ].leaf )\n {\n ++index;\n }\n }\n}\n\nstatic void debug_print_tree( const std::vector< ast_node >& nodes, unsigned index, int indent )\n{\n const ast_node& n = nodes.at( index );\n\n printf( \"%*s[%4u]%s\", indent, \"\", n.sloc, AST_NODE_NAME[ n.kind ] );\n if ( n.leaf == AST_LEAF_STRING )\n {\n const ast_leaf_string& l = n.leaf_string();\n std::string s = escape_string( std::string_view( l.text, l.size ), 45 );\n printf( \" STRING %s\\n\", s.c_str() );\n }\n else if ( n.leaf == AST_LEAF_NUMBER )\n {\n const ast_leaf_number& l = n.leaf_number();\n printf( \" NUMBER %f\\n\", l.n );\n }\n else if ( n.leaf == AST_LEAF_FUNCTION )\n {\n const ast_leaf_function& l = n.leaf_function();\n printf( \" FUNCTION %p %s\\n\", l.function, l.function->name.c_str() );\n }\n else if ( n.leaf == AST_LEAF_INDEX )\n {\n const ast_leaf_index& l = n.leaf_index();\n if ( l.index != AST_INVALID_INDEX )\n printf( \" INDEX %u\\n\", l.index );\n else\n printf( \" INVALID INDEX\\n\" );\n }\n else if ( n.leaf == AST_LEAF_OUTENV )\n {\n const ast_leaf_outenv& l = n.leaf_outenv();\n printf( \" OUTENV %u SLOT %u\\n\", l.outenv_index, l.outenv_slot );\n }\n else\n {\n printf( \"\\n\" );\n }\n\n for ( unsigned c = n.child_index; c < index; c = nodes[ c ].next_index )\n {\n debug_print_tree( nodes, c, indent + 2 );\n }\n}\n\nvoid ast_function::debug_print() const\n{\n printf( \"FUNCTION %p %s\\n\", this, name.c_str() );\n if ( outer )\n printf( \" OUTER %p %s\\n\", outer, outer->name.c_str() );\n printf( \" %u PARAMETERS\\n\", parameter_count );\n if ( implicit_self )\n printf( \" IMPLICIT_SELF\\n\" );\n if ( is_generator )\n printf( \" GENERATOR\\n\" );\n if ( is_top_level )\n printf( \" TOP_LEVEL\\n\" );\n if ( is_varargs )\n printf( \" VARARGS\\n\" );\n\n printf( \" OUTENV:\\n\" );\n for ( size_t i = 0; i < outenvs.size(); ++i )\n {\n const ast_outenv& outenv = outenvs[ i ];\n printf\n (\n \" %zu : %s %u\\n\", i,\n outenv.outer_outenv ? \"OUTENV\" : \"VARENV\",\n outenv.outer_index\n );\n }\n\n printf( \" LOCALS:\\n\" );\n for ( size_t i = 0; i < locals.size(); ++i )\n {\n const ast_local& local = locals[ i ];\n printf( \" %zu : %.*s\", i, (int)local.name.size(), local.name.data() );\n if ( local.varenv_index != AST_INVALID_INDEX )\n printf( \" VARENV %u[ %u ]\", local.varenv_index, local.varenv_slot );\n if ( local.kind == LOCAL_PARAM )\n printf( \" PARAM\" );\n if ( local.kind == LOCAL_PARAM_SELF )\n printf( \" PARAM_SELF\" );\n if ( local.kind == LOCAL_PARAM_VARARG )\n printf( \" PARAM_VARARG\" );\n if ( local.kind == LOCAL_FOR_EACH )\n printf( \" FOR_EACH\" );\n if ( local.kind == LOCAL_FOR_STEP )\n printf( \" FOR_STEP\" );\n if ( local.kind == LOCAL_TEMPORARY )\n printf( \" TEMPORARY\" );\n printf( \"\\n\" );\n }\n\n debug_print_tree( nodes, nodes.size() - 1, 2 );\n}\n\n}\n\n","avg_line_length":30.6447368421,"max_line_length":106,"alphanum_fraction":0.5517389438,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":75998,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["Apache-2.0"],"max_stars_count":null,"content":"#include \"llvm\/ADT\/STLExtras.h\"\n#include \"swift\/SIL\/SILDeclRef.h\"\n#include \n#include \n\nusing namespace swift;\nusing namespace ide;\nusing namespace api;\n\nnamespace fs = llvm::sys::fs;\nnamespace path = llvm::sys::path;\n\nnamespace {\nstatic StringRef getAttrName(DeclAttrKind Kind) {\n switch (Kind) {\n#define DECL_ATTR(NAME, CLASS, ...) \\\n case DAK_##CLASS: \\\n return DeclAttribute::isDeclModifier(DAK_##CLASS) ? #NAME : \"@\"#NAME;\n#include \"swift\/AST\/Attr.def\"\n case DAK_Count:\n llvm_unreachable(\"unrecognized attribute kind.\");\n }\n llvm_unreachable(\"covered switch\");\n}\n} \/\/ End of anonymous namespace.\n\nstruct swift::ide::api::SDKNodeInitInfo {\n SDKContext &Ctx;\n DeclKind DKind;\n AccessorKind AccKind;\n\n#define KEY_STRING(X, Y) StringRef X;\n#include \"swift\/IDE\/DigesterEnums.def\"\n#define KEY_BOOL(X, Y) bool X = false;\n#include \"swift\/IDE\/DigesterEnums.def\"\n#define KEY_UINT(X, Y) Optional X;\n#include \"swift\/IDE\/DigesterEnums.def\"\n#define KEY_STRING_ARR(X, Y) std::vector X;\n#include \"swift\/IDE\/DigesterEnums.def\"\n\n ReferenceOwnership ReferenceOwnership = ReferenceOwnership::Strong;\n std::vector DeclAttrs;\n std::vector TypeAttrs;\n\n SDKNodeInitInfo(SDKContext &Ctx) : Ctx(Ctx) {}\n SDKNodeInitInfo(SDKContext &Ctx, Decl *D);\n SDKNodeInitInfo(SDKContext &Ctx, ValueDecl *VD);\n SDKNodeInitInfo(SDKContext &Ctx, OperatorDecl *D);\n SDKNodeInitInfo(SDKContext &Ctx, ProtocolConformance *Conform);\n SDKNodeInitInfo(SDKContext &Ctx, Type Ty, TypeInitInfo Info = TypeInitInfo());\n SDKNode* createSDKNode(SDKNodeKind Kind);\n};\n\nSDKContext::SDKContext(CheckerOptions Opts): Diags(SourceMgr), Opts(Opts) {\n#define ADD(NAME) BreakingAttrs.push_back({DeclAttrKind::DAK_##NAME, \\\n getAttrName(DeclAttrKind::DAK_##NAME)});\n \/\/ Add attributes that both break ABI and API.\n ADD(Final)\n if (checkingABI()) {\n \/\/ Add ABI-breaking-specific attributes.\n ADD(ObjC)\n ADD(FixedLayout)\n ADD(Frozen)\n ADD(Dynamic)\n }\n#undef ADD\n}\n\nvoid SDKNodeRoot::registerDescendant(SDKNode *D) {\n \/\/ Operator doesn't have usr\n if (isa(D))\n return;\n if (auto DD = dyn_cast(D)) {\n assert(!DD->getUsr().empty());\n DescendantDeclTable[DD->getUsr()].insert(DD);\n }\n}\n\nSDKNode::SDKNode(SDKNodeInitInfo Info, SDKNodeKind Kind): Ctx(Info.Ctx),\n Name(Info.Name), PrintedName(Info.PrintedName), TheKind(unsigned(Kind)) {}\n\nSDKNodeRoot::SDKNodeRoot(SDKNodeInitInfo Info): SDKNode(Info, SDKNodeKind::Root),\n ToolArgs(Info.ToolArgs),\n JsonFormatVer(Info.JsonFormatVer.hasValue() ? *Info.JsonFormatVer : DIGESTER_JSON_DEFAULT_VERSION) {}\n\nSDKNodeDecl::SDKNodeDecl(SDKNodeInitInfo Info, SDKNodeKind Kind)\n : SDKNode(Info, Kind), DKind(Info.DKind), Usr(Info.Usr),\n Location(Info.Location), ModuleName(Info.ModuleName),\n DeclAttributes(Info.DeclAttrs), IsImplicit(Info.IsImplicit),\n IsStatic(Info.IsStatic), IsDeprecated(Info.IsDeprecated),\n IsProtocolReq(Info.IsProtocolReq),\n IsOverriding(Info.IsOverriding),\n IsOpen(Info.IsOpen),\n IsInternal(Info.IsInternal), IsABIPlaceholder(Info.IsABIPlaceholder),\n ReferenceOwnership(uint8_t(Info.ReferenceOwnership)),\n GenericSig(Info.GenericSig), FixedBinaryOrder(Info.FixedBinaryOrder),\n introVersions({Info.IntromacOS, Info.IntroiOS, Info.IntrotvOS,\n Info.IntrowatchOS, Info.Introswift}){}\n\nSDKNodeType::SDKNodeType(SDKNodeInitInfo Info, SDKNodeKind Kind):\n SDKNode(Info, Kind), TypeAttributes(Info.TypeAttrs),\n HasDefaultArg(Info.HasDefaultArg),\n ParamValueOwnership(Info.ParamValueOwnership) {}\n\nSDKNodeTypeNominal::SDKNodeTypeNominal(SDKNodeInitInfo Info):\n SDKNodeType(Info, SDKNodeKind::TypeNominal), USR(Info.Usr) {}\n\nSDKNodeTypeFunc::SDKNodeTypeFunc(SDKNodeInitInfo Info):\n SDKNodeType(Info, SDKNodeKind::TypeFunc) {}\n\nSDKNodeTypeAlias::SDKNodeTypeAlias(SDKNodeInitInfo Info):\n SDKNodeType(Info, SDKNodeKind::TypeAlias) {}\n\nSDKNodeDeclType::SDKNodeDeclType(SDKNodeInitInfo Info):\n SDKNodeDecl(Info, SDKNodeKind::DeclType), SuperclassUsr(Info.SuperclassUsr),\n SuperclassNames(Info.SuperclassNames),\n EnumRawTypeName(Info.EnumRawTypeName), IsExternal(Info.IsExternal) {}\n\nSDKNodeConformance::SDKNodeConformance(SDKNodeInitInfo Info):\n SDKNode(Info, SDKNodeKind::Conformance),\n Usr(Info.Usr), IsABIPlaceholder(Info.IsABIPlaceholder) {}\n\nSDKNodeTypeWitness::SDKNodeTypeWitness(SDKNodeInitInfo Info):\n SDKNode(Info, SDKNodeKind::TypeWitness) {}\n\nSDKNodeDeclOperator::SDKNodeDeclOperator(SDKNodeInitInfo Info):\n SDKNodeDecl(Info, SDKNodeKind::DeclOperator) {}\n\nSDKNodeDeclTypeAlias::SDKNodeDeclTypeAlias(SDKNodeInitInfo Info):\n SDKNodeDecl(Info, SDKNodeKind::DeclTypeAlias) {}\n\nSDKNodeDeclVar::SDKNodeDeclVar(SDKNodeInitInfo Info): \n SDKNodeDecl(Info, SDKNodeKind::DeclVar), IsLet(Info.IsLet),\n HasStorage(Info.HasStorage) {}\n\nSDKNodeDeclAbstractFunc::SDKNodeDeclAbstractFunc(SDKNodeInitInfo Info,\n SDKNodeKind Kind): SDKNodeDecl(Info, Kind), IsThrowing(Info.IsThrowing),\n ReqNewWitnessTableEntry(Info.ReqNewWitnessTableEntry),\n SelfIndex(Info.SelfIndex) {}\n\nSDKNodeDeclFunction::SDKNodeDeclFunction(SDKNodeInitInfo Info):\n SDKNodeDeclAbstractFunc(Info, SDKNodeKind::DeclFunction),\n FuncSelfKind(Info.FuncSelfKind) {}\n\nSDKNodeDeclConstructor::SDKNodeDeclConstructor(SDKNodeInitInfo Info):\n SDKNodeDeclAbstractFunc(Info, SDKNodeKind::DeclConstructor) {}\n\nSDKNodeDeclAccessor::SDKNodeDeclAccessor(SDKNodeInitInfo Info):\n SDKNodeDeclAbstractFunc(Info, SDKNodeKind::DeclAccessor),\n AccKind(Info.AccKind) {}\n\nSDKNodeDeclAssociatedType::SDKNodeDeclAssociatedType(SDKNodeInitInfo Info):\n SDKNodeDecl(Info, SDKNodeKind::DeclAssociatedType) {};\n\nSDKNodeDeclSubscript::SDKNodeDeclSubscript(SDKNodeInitInfo Info):\n SDKNodeDeclAbstractFunc(Info, SDKNodeKind::DeclSubscript),\n HasStorage(Info.HasStorage) {}\n\nStringRef SDKNodeDecl::getHeaderName() const {\n if (Location.empty())\n return StringRef();\n return llvm::sys::path::filename(Location.split(\":\").first);\n}\n\nstatic SDKNodeDeclAccessor *getAccessorInternal(ArrayRef Accessors,\n AccessorKind Kind) {\n for (auto *AC: Accessors) {\n if (cast(AC)->getAccessorKind() == Kind) {\n return cast(AC);\n }\n }\n return nullptr;\n}\n\nSDKNodeDeclAccessor *SDKNodeDeclVar::getAccessor(AccessorKind Kind) const {\n return getAccessorInternal(Accessors, Kind);\n}\n\nSDKNodeDeclAccessor *SDKNodeDeclSubscript::getAccessor(AccessorKind Kind) const {\n return getAccessorInternal(Accessors, Kind);\n}\n\nSDKNodeType *SDKNodeDeclVar::getType() const {\n return cast(childAt(0));\n}\n\nNodePtr UpdatedNodesMap::findUpdateCounterpart(const SDKNode *Node) const {\n assert(Node->isAnnotatedAs(NodeAnnotation::Updated) && \"Not update operation.\");\n auto FoundPair = std::find_if(MapImpl.begin(), MapImpl.end(),\n [&](std::pair Pair) {\n return Pair.second == Node || Pair.first == Node;\n });\n assert(FoundPair != MapImpl.end() && \"Cannot find update counterpart.\");\n return Node == FoundPair->first ? FoundPair->second : FoundPair->first;\n}\n\n#define NODE_KIND_RANGE(ID, FIRST, LAST) \\\nbool SDKNode##ID::classof(const SDKNode *N) { \\\n return N->getKind() >= SDKNodeKind::FIRST && \\\n N->getKind() <= SDKNodeKind::LAST; \\\n}\n#include \"swift\/IDE\/DigesterEnums.def\"\n\nunsigned SDKNode::getChildIndex(const SDKNode* Child) const {\n auto It = std::find(Children.begin(), Children.end(), Child);\n assert(It != Children.end() && \"cannot find the child\");\n return It - Children.begin();\n}\n\nSDKNode* SDKNode::getOnlyChild() const {\n assert(Children.size() == 1 && \"more that one child.\");\n return *Children.begin();\n}\n\nSDKNodeRoot *SDKNode::getRootNode() const {\n for (auto *Root = const_cast(this); ; Root = Root->getParent()) {\n if (auto Result = dyn_cast(Root))\n return Result;\n }\n llvm_unreachable(\"Unhandled SDKNodeKind in switch.\");\n}\n\nvoid SDKNode::addChild(SDKNode *Child) {\n Child->Parent = this;\n Children.push_back(Child);\n if (auto *Root = dyn_cast(this)) {\n struct DeclCollector: public SDKNodeVisitor {\n SDKNodeRoot &Root;\n DeclCollector(SDKNodeRoot &Root): Root(Root) {}\n void visit(NodePtr Node) override {\n Root.registerDescendant(Node);\n }\n } Collector(*Root);\n SDKNode::preorderVisit(Child, Collector);\n }\n}\n\nNodePtr SDKNode::childAt(unsigned I) const {\n assert(I < getChildrenCount());\n return getChildren()[I];\n}\n\nvoid SDKNode::removeChild(NodePtr C) {\n Children.erase(std::find(Children.begin(), Children.end(), C));\n}\n\nvoid SDKNode::annotate(NodeAnnotation Anno, StringRef Comment) {\n assert(!Comment.empty());\n if(isAnnotatedAs(Anno))\n return;\n annotate(Anno);\n AnnotateComments[Anno] = Comment;\n}\n\nvoid SDKNode::removeAnnotate(NodeAnnotation Anno) {\n assert(isAnnotatedAs(Anno));\n Annotations.erase(Anno);\n AnnotateComments.erase(Anno);\n assert(!isAnnotatedAs(Anno));\n assert(AnnotateComments.count(Anno) == 0);\n}\n\nStringRef SDKNode::getAnnotateComment(NodeAnnotation Anno) const {\n return AnnotateComments.find(Anno)->second;\n}\n\nArrayRef SDKNode::\ngetAnnotations(std::vector &Scratch) const {\n for (auto Ann : Annotations)\n Scratch.push_back(Ann);\n return llvm::makeArrayRef(Scratch);\n}\n\nbool SDKNode::isAnnotatedAs(NodeAnnotation Anno) const {\n return Annotations.find(Anno) != Annotations.end();;\n}\n\nvoid SDKNode::preorderVisit(NodePtr Root, SDKNodeVisitor &Visitor) {\n Visitor.visit(Root);\n Visitor.Ancestors.push_back(Root);\n for (auto Child : Root->Children)\n preorderVisit(Child, Visitor);\n Visitor.Ancestors.pop_back();\n}\n\nvoid SDKNode::postorderVisit(NodePtr Root, SDKNodeVisitor &Visitor) {\n Visitor.Ancestors.push_back(Root);\n for (auto Child : Root->Children)\n postorderVisit(Child, Visitor);\n Visitor.Ancestors.pop_back();\n Visitor.visit(Root);\n}\n\nSDKNodeVectorViewer::VectorIt\nSDKNodeVectorViewer::getNext(VectorIt Start) {\n for (auto It = Start; It != Collection.end(); ++ It)\n if (Selector(*It))\n return It;\n return Collection.end();\n}\n\nSDKNodeVectorViewer::ViewerIterator&\nSDKNodeVectorViewer::ViewerIterator::operator++() {\n P = Viewer.getNext(P + 1);\n return *this;\n}\n\nSDKNodeVectorViewer::ViewerIterator SDKNodeVectorViewer::begin() {\n return ViewerIterator(*this, getNext(Collection.begin()));\n}\n\nSDKNodeVectorViewer::ViewerIterator SDKNodeVectorViewer::end() {\n return ViewerIterator(*this, Collection.end());\n}\n\nKnownTypeKind SDKNodeType::getTypeKind() const {\n#define KNOWN_TYPE(NAME) if (getName() == #NAME) return KnownTypeKind::NAME;\n#include \"swift\/IDE\/DigesterEnums.def\"\n return KnownTypeKind::Unknown;\n}\n\nArrayRef SDKNodeType::getTypeAttributes() const {\n return llvm::makeArrayRef(TypeAttributes.data(), TypeAttributes.size());\n}\n\nvoid SDKNodeType::addTypeAttribute(TypeAttrKind AttrKind) {\n TypeAttributes.push_back(AttrKind);\n}\n\nbool SDKNodeType::hasTypeAttribute(TypeAttrKind DAKind) const {\n return std::find(TypeAttributes.begin(), TypeAttributes.end(), DAKind) !=\n TypeAttributes.end();\n}\n\nStringRef SDKNodeType::getParamValueOwnership() const {\n return ParamValueOwnership.empty() ? \"Default\" : ParamValueOwnership;\n}\n\nStringRef SDKNodeType::getTypeRoleDescription() const {\n assert(isTopLevelType());\n auto P = getParent();\n switch(P->getKind()) {\n case SDKNodeKind::Root:\n case SDKNodeKind::TypeNominal:\n case SDKNodeKind::TypeFunc:\n case SDKNodeKind::TypeAlias:\n case SDKNodeKind::DeclType:\n case SDKNodeKind::DeclOperator:\n case SDKNodeKind::Conformance:\n llvm_unreachable(\"Type Parent is wrong\");\n case SDKNodeKind::DeclFunction:\n case SDKNodeKind::DeclConstructor:\n case SDKNodeKind::DeclAccessor:\n case SDKNodeKind::DeclSubscript:\n return SDKNodeDeclAbstractFunc::getTypeRoleDescription(Ctx,\n P->getChildIndex(this));\n case SDKNodeKind::DeclVar:\n return \"declared\";\n case SDKNodeKind::DeclTypeAlias:\n return \"underlying\";\n case SDKNodeKind::DeclAssociatedType:\n return \"default\";\n case SDKNodeKind::TypeWitness:\n return \"type witness type\";\n }\n}\n\nSDKNode *SDKNodeRoot::getInstance(SDKContext &Ctx) {\n SDKNodeInitInfo Info(Ctx);\n Info.Name = Ctx.buffer(\"TopLevel\");\n Info.PrintedName = Ctx.buffer(\"TopLevel\");\n Info.ToolArgs = Ctx.getOpts().ToolArgs;\n Info.JsonFormatVer = DIGESTER_JSON_VERSION;\n return Info.createSDKNode(SDKNodeKind::Root);\n}\n\nStringRef SDKNodeDecl::getScreenInfo() const {\n auto ModuleName = getModuleName();\n auto HeaderName = getHeaderName();\n auto &Ctx = getSDKContext();\n llvm::SmallString<64> SS;\n llvm::raw_svector_ostream OS(SS);\n if (Ctx.getOpts().PrintModule)\n OS << ModuleName;\n if (!HeaderName.empty())\n OS << \"(\" << HeaderName << \")\";\n if (!OS.str().empty())\n OS << \": \";\n bool IsExtension = false;\n if (auto *TD = dyn_cast(this)) {\n IsExtension = TD->isExternal();\n }\n if (IsExtension)\n OS << \"Extension\";\n else\n OS << getDeclKind();\n OS << \" \" << getFullyQualifiedName();\n return Ctx.buffer(OS.str());\n}\n\nvoid SDKNodeDecl::printFullyQualifiedName(llvm::raw_ostream &OS) const {\n if (auto *ACC = dyn_cast(this)) {\n ACC->getStorage()->printFullyQualifiedName(OS);\n OS << \".\" << getPrintedName();\n return;\n }\n std::vector Parent;\n for (auto *P = getParent(); isa(P); P = P->getParent())\n Parent.push_back(P);\n for (auto It = Parent.rbegin(); It != Parent.rend(); ++ It)\n OS << (*It)->getPrintedName() << \".\";\n OS << getPrintedName();\n}\n\nStringRef SDKNodeDecl::getFullyQualifiedName() const {\n llvm::SmallString<32> Buffer;\n llvm::raw_svector_ostream OS(Buffer);\n printFullyQualifiedName(OS);\n return getSDKContext().buffer(OS.str());\n}\n\nbool SDKNodeDecl::isNonOptionalProtocolRequirement() const {\n return isProtocolRequirement() && !hasDeclAttribute(DAK_Optional);\n}\n\nbool SDKNodeDecl::hasDeclAttribute(DeclAttrKind DAKind) const {\n return std::find(DeclAttributes.begin(), DeclAttributes.end(), DAKind) !=\n DeclAttributes.end();\n}\n\nArrayRef SDKNodeDecl::getDeclAttributes() const {\n return llvm::makeArrayRef(DeclAttributes.data(), DeclAttributes.size());\n}\n\nbool SDKNodeDecl::hasAttributeChange(const SDKNodeDecl &Another) const {\n std::set Left(getDeclAttributes().begin(),\n getDeclAttributes().end());\n std::set Right(Another.getDeclAttributes().begin(),\n Another.getDeclAttributes().end());\n return Left != Right;\n}\n\nbool SDKNodeType::hasAttributeChange(const SDKNodeType &Another) const {\n std::set Left(getTypeAttributes().begin(),\n getTypeAttributes().end());\n std::set Right(Another.getTypeAttributes().begin(),\n Another.getTypeAttributes().end());\n return Left != Right;\n}\n\nSDKNodeDecl *SDKNodeType::getClosestParentDecl() const {\n auto *Result = getParent();\n for (; !isa(Result); Result = Result->getParent());\n return Result->getAs();\n}\n\nvoid SDKNodeDeclType::addConformance(SDKNode *Conf) {\n cast(Conf)->TypeDecl = this;\n Conformances.push_back(Conf);\n}\n\nvoid SDKNodeDeclSubscript::addAccessor(SDKNode *AC) {\n cast(AC)->Owner = this;\n Accessors.push_back(AC);\n}\n\nvoid SDKNodeDeclVar::addAccessor(SDKNode *AC) {\n cast(AC)->Owner = this;\n Accessors.push_back(AC);\n}\n\nSDKNodeType *SDKNodeTypeWitness::getUnderlyingType() const {\n return getOnlyChild()->getAs();\n}\n\nStringRef SDKNodeTypeWitness::getWitnessedTypeName() const {\n return Ctx.buffer((llvm::Twine(getParent()->getAs()->\n getName()) + \".\" + getName()).str());\n}\n\nOptional SDKNodeDeclType::getSuperclass() const {\n if (SuperclassUsr.empty())\n return None;\n auto Descendants = getRootNode()->getDescendantsByUsr(SuperclassUsr);\n if (!Descendants.empty()) {\n return Descendants.front()->getAs();\n }\n return None;\n}\n\n\/\/\/ Finding the node through all children, including the inheritted ones,\n\/\/\/ whose printed name matches with the given name.\nOptional\nSDKNodeDeclType::lookupChildByPrintedName(StringRef Name) const {\n for (auto C : getChildren()) {\n if (C->getPrintedName() == Name)\n return C->getAs();\n }\n \/\/ Finding from the inheritance chain.\n if (auto Super = getSuperclass()) {\n return (*Super)->lookupChildByPrintedName(Name);\n }\n return None;\n}\n\nSDKNodeType *SDKNodeDeclType::getRawValueType() const {\n if (isConformingTo(KnownProtocolKind::RawRepresentable)) {\n if (auto RV = lookupChildByPrintedName(\"rawValue\")) {\n return (*(*RV)->getChildBegin())->getAs();\n }\n }\n return nullptr;\n}\n\nbool SDKNodeDeclType::isConformingTo(swift::ide::api::KnownProtocolKind Kind) const {\n switch (Kind) {\n#define KNOWN_PROTOCOL(NAME) \\\n case KnownProtocolKind::NAME: \\\n return std::find_if(Conformances.begin(), Conformances.end(), \\\n [](SDKNode *Conf) { return Conf->getName() == #NAME; }) != \\\n Conformances.end();\n#include \"swift\/IDE\/DigesterEnums.def\"\n }\n llvm_unreachable(\"covered switch\");\n}\n\nStringRef SDKNodeDeclAbstractFunc::getTypeRoleDescription(SDKContext &Ctx,\n unsigned Index) {\n if (Index == 0) {\n return Ctx.buffer(\"return\");\n } else {\n llvm::SmallString<4> Buffer;\n Buffer += \"parameter \";\n Buffer += std::to_string(Index - 1);\n return Ctx.buffer(Buffer.str());\n }\n}\n\n#define NODE_KIND(X, NAME) \\\n bool SDKNode##X::classof(const SDKNode *N) { \\\n return N->getKind() == SDKNodeKind::X; \\\n }\n#include \"swift\/IDE\/DigesterEnums.def\"\n\nstatic Optional parseKeyKind(StringRef Content) {\n return llvm::StringSwitch>(Content)\n#define KEY(NAME) .Case(#NAME, KeyKind::KK_##NAME)\n#include \"swift\/IDE\/DigesterEnums.def\"\n .Default(None);\n}\n\nstatic StringRef getKeyContent(SDKContext &Ctx, KeyKind Kind) {\n switch (Kind) {\n#define KEY(NAME) case KeyKind::KK_##NAME: return Ctx.buffer(#NAME);\n#include \"swift\/IDE\/DigesterEnums.def\"\n }\n llvm_unreachable(\"Unhandled KeyKind in switch.\");\n}\n\nSDKNode* SDKNode::constructSDKNode(SDKContext &Ctx,\n llvm::yaml::MappingNode *Node) {\n static auto GetScalarString = [&](llvm::yaml::Node *N) -> StringRef {\n auto WithQuote = cast(N)->getRawValue();\n return WithQuote.substr(1, WithQuote.size() - 2);\n };\n\n static auto getAsInt = [&](llvm::yaml::Node *N) -> int {\n return std::stoi(cast(N)->getRawValue());\n };\n static auto getAsBool = [&](llvm::yaml::Node *N) -> bool {\n auto txt = cast(N)->getRawValue();\n assert(txt.startswith(\"false\") || txt.startswith(\"true\"));\n return txt.startswith(\"true\");\n };\n SDKNodeKind Kind;\n SDKNodeInitInfo Info(Ctx);\n NodeVector Children;\n NodeVector Conformances;\n NodeVector Accessors;\n\n for (auto &Pair : *Node) {\n auto keyString = GetScalarString(Pair.getKey()); \n if (auto keyKind = parseKeyKind(keyString)) {\n switch(*keyKind) {\n case KeyKind::KK_kind:\n if (auto parsedKind = parseSDKNodeKind(GetScalarString(Pair.getValue()))) {\n Kind = *parsedKind;\n } else {\n Ctx.diagnose(Pair.getValue(), diag::sdk_node_unrecognized_node_kind,\n GetScalarString(Pair.getValue()));\n }\n break;\n#define KEY_UINT(X, Y) \\\n case KeyKind::KK_##Y: Info.X = getAsInt(Pair.getValue()); break;\n#include \"swift\/IDE\/DigesterEnums.def\"\n#define KEY_STRING(X, Y) \\\n case KeyKind::KK_##Y: Info.X = GetScalarString(Pair.getValue()); break;\n#include \"swift\/IDE\/DigesterEnums.def\"\n#define KEY_BOOL(X, Y) case KeyKind::KK_##Y: Info.X = getAsBool(Pair.getValue()); break;\n#include \"swift\/IDE\/DigesterEnums.def\"\n case KeyKind::KK_children:\n for (auto &Mapping : *cast(Pair.getValue())) {\n Children.push_back(constructSDKNode(Ctx,\n cast(&Mapping)));\n }\n break;\n case KeyKind::KK_conformances:\n for (auto &Mapping : *cast(Pair.getValue())) {\n Conformances.push_back(constructSDKNode(Ctx,\n cast(&Mapping)));\n }\n break;\n#define KEY_STRING_ARR(X, Y) \\\n case KeyKind::KK_##Y: \\\n assert(Info.X.empty()); \\\n for (auto &Name : *cast(Pair.getValue())) { \\\n Info.X.push_back(GetScalarString(&Name)); \\\n } \\\n break;\n#include \"swift\/IDE\/DigesterEnums.def\"\n case KeyKind::KK_ownership:\n Info.ReferenceOwnership =\n swift::ReferenceOwnership(getAsInt(Pair.getValue()));\n assert(Info.ReferenceOwnership != swift::ReferenceOwnership::Strong &&\n \"Strong is implied.\");\n break;\n\n case KeyKind::KK_typeAttributes: {\n auto *Seq = cast(Pair.getValue());\n std::transform(Seq->begin(), Seq->end(),\n std::back_inserter(Info.TypeAttrs),\n [&](llvm::yaml::Node &N) {\n auto Result = llvm::StringSwitch(GetScalarString(&N))\n #define TYPE_ATTR(X) .Case(#X, TypeAttrKind::TAK_##X)\n #include \"swift\/AST\/Attr.def\"\n .Default(TypeAttrKind::TAK_Count);\n if (Result == TAK_Count)\n Ctx.diagnose(&N, diag::sdk_node_unrecognized_type_attr_kind,\n GetScalarString(&N));\n return Result;\n });\n break;\n }\n case KeyKind::KK_declAttributes: {\n auto *Seq = cast(Pair.getValue());\n std::transform(Seq->begin(), Seq->end(), std::back_inserter(Info.DeclAttrs),\n [&](llvm::yaml::Node &N) {\n auto Result = llvm::StringSwitch(GetScalarString(&N))\n #define DECL_ATTR(_, NAME, ...) .Case(#NAME, DeclAttrKind::DAK_##NAME)\n #include \"swift\/AST\/Attr.def\"\n .Default(DeclAttrKind::DAK_Count);\n if (Result == DAK_Count)\n Ctx.diagnose(&N, diag::sdk_node_unrecognized_decl_attr_kind,\n GetScalarString(&N));\n return Result;\n });\n break;\n }\n case KeyKind::KK_accessors: {\n for (auto &Mapping : *cast(Pair.getValue())) {\n Accessors.push_back(constructSDKNode(Ctx,\n cast(&Mapping)));\n }\n break;\n }\n case KeyKind::KK_accessorKind: {\n AccessorKind unknownKind = (AccessorKind)((uint8_t)(AccessorKind::Last) + 1);\n Info.AccKind = llvm::StringSwitch(\n GetScalarString(Pair.getValue()))\n#define ACCESSOR(ID)\n#define SINGLETON_ACCESSOR(ID, KEYWORD) .Case(#KEYWORD, AccessorKind::ID)\n#include \"swift\/AST\/AccessorKinds.def\"\n .Default(unknownKind);\n if (Info.AccKind == unknownKind) {\n Ctx.diagnose(Pair.getValue(), diag::sdk_node_unrecognized_accessor_kind,\n GetScalarString(Pair.getValue()));\n }\n break;\n }\n case KeyKind::KK_declKind: {\n auto dKind = llvm::StringSwitch>(\n GetScalarString(Pair.getValue()))\n #define DECL(X, PARENT) .Case(#X, DeclKind::X)\n #include \"swift\/AST\/DeclNodes.def\"\n .Default(None);\n if (dKind)\n Info.DKind = *dKind;\n else\n Ctx.diagnose(Pair.getValue(), diag::sdk_node_unrecognized_decl_kind,\n GetScalarString(Pair.getValue()));\n break;\n }\n }\n }\n else {\n Ctx.diagnose(Pair.getKey(), diag::sdk_node_unrecognized_key,\n keyString);\n Pair.skip();\n }\n };\n SDKNode *Result = Info.createSDKNode(Kind);\n for (auto C : Children) {\n Result->addChild(C);\n }\n for (auto *Conf: Conformances) {\n cast(Result)->addConformance(Conf);\n }\n for (auto *Acc: Accessors) {\n if (auto *SD = dyn_cast(Result)) {\n SD->addAccessor(Acc);\n } else if (auto *VD = dyn_cast(Result)) {\n VD->addAccessor(Acc);\n }\n }\n return Result;\n}\n\nbool SDKNode::hasSameChildren(const SDKNode &Other) const {\n if (Children.size() != Other.Children.size())\n return false;\n for (unsigned I = 0; I < Children.size(); ++ I) {\n if (*Children[I] != *Other.Children[I])\n return false;\n }\n return true;\n}\n\nvoid swift::ide::api::nodeSetDifference(ArrayRef Left,\n ArrayRef Right,\n NodeVector &LeftMinusRight,\n NodeVector &RightMinusLeft) {\n llvm::SmallPtrSet LeftToRemove;\n llvm::SmallPtrSet RightToRemove;\n for (auto LC: Left) {\n for (auto RC: Right) {\n if (!RightToRemove.count(RC) && *LC == *RC) {\n LeftToRemove.insert(LC);\n RightToRemove.insert(RC);\n break;\n }\n }\n }\n std::for_each(Left.begin(), Left.end(), [&] (SDKNode *N) {\n if (!LeftToRemove.count(N))\n LeftMinusRight.push_back(N);\n });\n std::for_each(Right.begin(), Right.end(), [&] (SDKNode *N) {\n if (!RightToRemove.count(N))\n RightMinusLeft.push_back(N);\n });\n}\n\n\nstatic bool hasSameContents(ArrayRef Left,\n ArrayRef Right) {\n NodeVector LeftMinusRight, RightMinusLeft;\n nodeSetDifference(Left, Right, LeftMinusRight, RightMinusLeft);\n return LeftMinusRight.empty() && RightMinusLeft.empty();\n}\n\nstatic bool hasSameParameterFlags(const SDKNodeType *Left, const SDKNodeType *Right) {\n if (Left->hasDefaultArgument() != Right->hasDefaultArgument())\n return false;\n if (Left->getParamValueOwnership() != Right->getParamValueOwnership())\n return false;\n\n return true;\n}\n\nstatic bool isSDKNodeEqual(SDKContext &Ctx, const SDKNode &L, const SDKNode &R) {\n auto *LeftAlias = dyn_cast(&L);\n auto *RightAlias = dyn_cast(&R);\n if (LeftAlias || RightAlias) {\n auto Left = L.getAs();\n auto Right = R.getAs();\n\n \/\/ First compare the parameter attributes.\n if (!hasSameParameterFlags(Left, Right))\n return false;\n\n \/\/ Comparing the underlying types if any of the inputs are alias.\n Left = LeftAlias ? LeftAlias->getUnderlyingType() : Left;\n Right = RightAlias ? RightAlias->getUnderlyingType() : Right;\n return *Left == *Right;\n }\n\n if (L.getKind() != R.getKind())\n return false;\n\n switch(L.getKind()) {\n case SDKNodeKind::TypeAlias:\n llvm_unreachable(\"Should be handled above.\");\n case SDKNodeKind::TypeNominal:\n case SDKNodeKind::TypeFunc: {\n auto Left = L.getAs();\n auto Right = R.getAs();\n if (Left->hasAttributeChange(*Right))\n return false;\n if (!hasSameParameterFlags(Left, Right))\n return false;\n if (Left->getPrintedName() == Right->getPrintedName())\n return true;\n if (Ctx.checkingABI()) {\n \/\/ For abi checking where we don't have sugar types at all, the printed\n \/\/ name difference is enough to indicate these two types differ.\n return false;\n } else {\n return Left->getName() == Right->getName() &&\n Left->hasSameChildren(*Right);\n }\n }\n\n case SDKNodeKind::DeclFunction: {\n auto Left = L.getAs();\n auto Right = R.getAs();\n if (Left->getSelfAccessKind() != Right->getSelfAccessKind())\n return false;\n LLVM_FALLTHROUGH;\n }\n case SDKNodeKind::DeclConstructor: {\n auto Left = L.getAs();\n auto Right = R.getAs();\n if (Left->isThrowing() ^ Right->isThrowing())\n return false;\n if (Left->reqNewWitnessTableEntry() != Right->reqNewWitnessTableEntry())\n return false;\n LLVM_FALLTHROUGH;\n }\n case SDKNodeKind::DeclAccessor: {\n if (auto *LA = dyn_cast(&L)) {\n if (auto *RA = dyn_cast(&R)) {\n if (LA->getAccessorKind() != RA->getAccessorKind())\n return false;\n }\n }\n LLVM_FALLTHROUGH;\n }\n case SDKNodeKind::DeclVar: {\n if (auto *LV = dyn_cast(&L)) {\n if (auto *RV = dyn_cast(&R)) {\n if (Ctx.checkingABI()) {\n if (LV->hasStorage() != RV->hasStorage())\n return false;\n }\n if (!hasSameContents(LV->getAllAccessors(), RV->getAllAccessors()))\n return false;\n }\n }\n LLVM_FALLTHROUGH;\n }\n case SDKNodeKind::DeclType: {\n auto *Left = dyn_cast(&L);\n auto *Right = dyn_cast(&R);\n if (Left && Right) {\n if (!hasSameContents(Left->getConformances(), Right->getConformances())) {\n return false;\n }\n if (Left->getSuperClassName() != Right->getSuperClassName()) {\n return false;\n }\n if (Left->getDeclKind() != Right->getDeclKind()) {\n return false;\n }\n }\n LLVM_FALLTHROUGH;\n }\n case SDKNodeKind::DeclAssociatedType:\n case SDKNodeKind::DeclSubscript: {\n if (auto *Left = dyn_cast(&L)) {\n if (auto *Right = dyn_cast(&R)) {\n if (!hasSameContents(Left->getAllAccessors(), Right->getAllAccessors()))\n return false;\n }\n }\n LLVM_FALLTHROUGH;\n }\n case SDKNodeKind::DeclOperator:\n case SDKNodeKind::DeclTypeAlias: {\n auto Left = L.getAs();\n auto Right = R.getAs();\n if (Left->isStatic() ^ Right->isStatic())\n return false;\n if (Left->getReferenceOwnership() != Right->getReferenceOwnership())\n return false;\n if (Left->hasAttributeChange(*Right))\n return false;\n if (Left->getGenericSignature() != Right->getGenericSignature())\n return false;\n if (Left->isOpen() != Right->isOpen())\n return false;\n if (Left->isInternal() != Right->isInternal())\n return false;\n if (Left->hasFixedBinaryOrder() != Right->hasFixedBinaryOrder())\n return false;\n if (Left->hasFixedBinaryOrder()) {\n if (Left->getFixedBinaryOrder() != Right->getFixedBinaryOrder())\n return false;\n }\n LLVM_FALLTHROUGH;\n }\n case SDKNodeKind::Conformance:\n case SDKNodeKind::TypeWitness:\n case SDKNodeKind::Root: {\n return L.getPrintedName() == R.getPrintedName() &&\n L.hasSameChildren(R);\n }\n }\n\n llvm_unreachable(\"Unhandled SDKNodeKind in switch.\");\n}\n\nbool SDKContext::isEqual(const SDKNode &Left, const SDKNode &Right) {\n return isSDKNodeEqual(*this, Left, Right);\n}\n\nAccessLevel SDKContext::getAccessLevel(const ValueDecl *VD) const {\n return checkingABI() ? VD->getEffectiveAccess() : VD->getFormalAccess();\n}\n\nbool SDKNode::operator==(const SDKNode &Other) const {\n return Ctx.isEqual(*this, Other);\n}\n\n\/\/ The pretty printer of a tree of SDKNode\nclass SDKNodeDumpVisitor : public SDKNodeVisitor {\n void dumpSpace(int Num) {\n while (Num != 0) {\n llvm::outs() << \"\\t\";\n Num --;\n }\n }\n void visit(NodePtr Node) override {\n dumpSpace(depth());\n llvm::outs() << \"[\" << Node->getKind() << \"]\" << Node->getName() << \"\\n\";\n }\npublic:\n SDKNodeDumpVisitor() {};\n};\n\nstatic StringRef getPrintedName(SDKContext &Ctx, Type Ty,\n bool IsImplicitlyUnwrappedOptional = false) {\n std::string S;\n llvm::raw_string_ostream OS(S);\n PrintOptions PO;\n PO.SkipAttributes = true;\n if (IsImplicitlyUnwrappedOptional)\n PO.PrintOptionalAsImplicitlyUnwrapped = true;\n\n Ty.print(OS, PO);\n return Ctx.buffer(OS.str());\n}\n\nstatic StringRef getTypeName(SDKContext &Ctx, Type Ty,\n bool IsImplicitlyUnwrappedOptional) {\n if (Ty->getKind() == TypeKind::Paren) {\n return Ctx.buffer(\"Paren\");\n }\n if (Ty->isVoid()) {\n return Ctx.buffer(\"Void\");\n }\n if (auto *NAT = dyn_cast(Ty.getPointer())) {\n return NAT->getDecl()->getNameStr();\n }\n if (Ty->getAnyNominal()) {\n if (IsImplicitlyUnwrappedOptional) {\n assert(Ty->getOptionalObjectType());\n return StringRef(\"ImplicitlyUnwrappedOptional\");\n }\n return Ty->getAnyNominal()->getNameStr();\n }\n#define TYPE(id, parent) \\\n if (Ty->getKind() == TypeKind::id) { \\\n return Ctx.buffer(#id); \\\n }\n#include \"swift\/AST\/TypeNodes.def\"\n llvm_unreachable(\"Unhandled type name.\");\n}\n\nstatic StringRef calculateUsr(SDKContext &Ctx, ValueDecl *VD) {\n llvm::SmallString<64> SS;\n llvm::raw_svector_ostream OS(SS);\n if (!ide::printDeclUSR(VD, OS)) {\n return Ctx.buffer(SS.str());\n }\n return StringRef();\n}\n\nstatic StringRef calculateLocation(SDKContext &SDKCtx, Decl *D) {\n if (SDKCtx.getOpts().AvoidLocation)\n return StringRef();\n auto &Ctx = D->getASTContext();\n auto &Importer = static_cast(*Ctx.getClangModuleLoader());\n\n clang::SourceManager &SM = Importer.getClangPreprocessor().getSourceManager();\n if (ClangNode CN = D->getClangNode()) {\n clang::SourceLocation Loc = CN.getLocation();\n Loc = SM.getFileLoc(Loc);\n if (Loc.isValid())\n return SDKCtx.buffer(Loc.printToString(SM));\n }\n\n return StringRef();\n}\n\nstatic bool isFunctionTypeNoEscape(Type Ty) {\n if (auto *AFT = Ty->getAs()) {\n return AFT->getExtInfo().isNoEscape();\n }\n return false;\n}\n\nstatic StringRef getSimpleName(ValueDecl *VD) {\n if (VD->hasName()) {\n auto name = VD->getBaseName();\n switch (name.getKind()) {\n case DeclBaseName::Kind::Subscript:\n return \"subscript\";\n case DeclBaseName::Kind::Constructor:\n return \"init\";\n case DeclBaseName::Kind::Destructor:\n return \"deinit\";\n case DeclBaseName::Kind::Normal:\n return llvm::StringSwitch(name.getIdentifier().str())\n .Case(\"subscript\", \"`subscript`\")\n .Case(\"init\", \"`init`\")\n .Case(\"deinit\", \"`deinit`\")\n .Default(name.getIdentifier().str());\n }\n }\n if (auto *AD = dyn_cast(VD)) {\n switch(AD->getAccessorKind()) {\n#define ACCESSOR(ID) \\\ncase AccessorKind::ID: return #ID;\n#include \"swift\/AST\/AccessorKinds.def\"\n }\n }\n return \"_\";\n}\n\nstatic StringRef getPrintedName(SDKContext &Ctx, ValueDecl *VD) {\n if (isa(VD) || isa(VD)) {\n llvm::SmallString<32> Result;\n Result.append(getSimpleName(VD));\n Result.append(\"(\");\n for (auto Arg : VD->getFullName().getArgumentNames()) {\n Result.append(Arg.empty() ? \"_\" : Arg.str());\n Result.append(\":\");\n }\n Result.append(\")\");\n return Ctx.buffer(Result.str());\n }\n return getSimpleName(VD);\n}\n\nstatic bool isFuncThrowing(ValueDecl *VD) {\n if (auto AF = dyn_cast(VD)) {\n return AF->hasThrows();\n }\n return false;\n}\n\nstatic Optional getSelfIndex(ValueDecl *VD) {\n if (auto AF = dyn_cast(VD)) {\n if (AF->isImportAsInstanceMember())\n return AF->getSelfIndex();\n }\n return None;\n}\n\nstatic ReferenceOwnership getReferenceOwnership(ValueDecl *VD) {\n if (auto OA = VD->getAttrs().getAttribute()) {\n return OA->get();\n }\n return ReferenceOwnership::Strong;\n}\n\n\/\/ Get a requirement with all types canonicalized.\nRequirement getCanonicalRequirement(Requirement &Req) {\n auto kind = Req.getKind();\n if (kind == RequirementKind::Layout) {\n return Requirement(kind, Req.getFirstType()->getCanonicalType(),\n Req.getLayoutConstraint());\n } else {\n return Requirement(kind, Req.getFirstType()->getCanonicalType(),\n Req.getSecondType()->getCanonicalType());\n }\n}\n\nstatic\nStringRef printGenericSignature(SDKContext &Ctx, ArrayRef AllReqs) {\n llvm::SmallString<32> Result;\n llvm::raw_svector_ostream OS(Result);\n if (AllReqs.empty())\n return StringRef();\n OS << \"<\";\n bool First = true;\n PrintOptions Opts = PrintOptions::printInterface();\n \/\/ We should always print fully qualified type names here\n Opts.FullyQualifiedTypes = true;\n for (auto Req: AllReqs) {\n if (!First) {\n OS << \", \";\n } else {\n First = false;\n }\n if (Ctx.checkingABI())\n getCanonicalRequirement(Req).print(OS, Opts);\n else\n Req.print(OS, Opts);\n }\n OS << \">\";\n return Ctx.buffer(OS.str());\n}\n\nstatic StringRef printGenericSignature(SDKContext &Ctx, Decl *D) {\n llvm::SmallString<32> Result;\n llvm::raw_svector_ostream OS(Result);\n if (auto *PD = dyn_cast(D)) {\n return printGenericSignature(Ctx, PD->getRequirementSignature());\n }\n\n if (auto *GC = D->getAsGenericContext()) {\n if (auto *Sig = GC->getGenericSignature()) {\n if (Ctx.checkingABI())\n Sig->getCanonicalSignature()->print(OS);\n else\n Sig->print(OS);\n return Ctx.buffer(OS.str());\n }\n }\n return StringRef();\n}\n\nstatic\nStringRef printGenericSignature(SDKContext &Ctx, ProtocolConformance *Conf) {\n return printGenericSignature(Ctx, Conf->getConditionalRequirements());\n}\n\nstatic Optional getSimilarMemberCount(NominalTypeDecl *NTD,\n ValueDecl *VD,\n llvm::function_ref Check) {\n if (!Check(VD))\n return None;\n auto Members = NTD->getMembers();\n auto End = std::find(Members.begin(), Members.end(), VD);\n assert(End != Members.end());\n return std::count_if(Members.begin(), End, Check);\n}\n\nOptional SDKContext::getFixedBinaryOrder(ValueDecl *VD) const {\n \/\/ We don't need fixed binary order when checking API stability.\n if (!checkingABI())\n return None;\n auto *NTD = dyn_cast_or_null(VD->getDeclContext()->\n getAsDecl());\n\n if (!NTD || isa(NTD) || NTD->isResilient())\n return None;\n\n \/\/ The relative order of stored properties matters for non-resilient type.\n auto isStored = [](Decl *M) {\n if (auto *STD = dyn_cast(M)) {\n return STD->hasStorage() && !STD->isStatic();\n }\n return false;\n };\n\n switch (NTD->getKind()) {\n case DeclKind::Enum: {\n return getSimilarMemberCount(NTD, VD, [](Decl *M) {\n return isa(M);\n });\n }\n case DeclKind::Class:\n case DeclKind::Struct: {\n return getSimilarMemberCount(NTD, VD, isStored);\n }\n default:\n llvm_unreachable(\"bad nominal type kind.\");\n }\n}\n\n\/\/ check for if it has @available(macOS 9999, iOS 9999, tvOS 9999, watchOS 9999, *)\nstatic bool isABIPlaceHolder(Decl *D) {\n llvm::SmallSet Platforms;\n for (auto *ATT: D->getAttrs()) {\n if (auto *AVA = dyn_cast(ATT)) {\n if (AVA->Platform != PlatformKind::none && AVA->Introduced &&\n AVA->Introduced->getMajor() == 9999) {\n Platforms.insert(AVA->Platform);\n }\n }\n }\n return Platforms.size() == 4;\n}\n\nstatic bool isABIPlaceholderRecursive(Decl *D) {\n for (auto *CD = D; CD; CD = CD->getDeclContext()->getAsDecl()) {\n if (isABIPlaceHolder(CD))\n return true;\n }\n return false;\n}\n\nStringRef SDKContext::getPlatformIntroVersion(Decl *D, PlatformKind Kind) {\n if (!D)\n return StringRef();\n for (auto *ATT: D->getAttrs()) {\n if (auto *AVA = dyn_cast(ATT)) {\n if (AVA->Platform == Kind && AVA->Introduced) {\n return buffer(AVA->Introduced->getAsString());\n }\n }\n }\n return getPlatformIntroVersion(D->getDeclContext()->getAsDecl(), Kind);\n}\n\nStringRef SDKContext::getLanguageIntroVersion(Decl *D) {\n if (!D)\n return StringRef();\n for (auto *ATT: D->getAttrs()) {\n if (auto *AVA = dyn_cast(ATT)) {\n if (AVA->isLanguageVersionSpecific() && AVA->Introduced) {\n return buffer(AVA->Introduced->getAsString());\n }\n }\n }\n return getLanguageIntroVersion(D->getDeclContext()->getAsDecl());\n}\n\nSDKNodeInitInfo::SDKNodeInitInfo(SDKContext &Ctx, Type Ty, TypeInitInfo Info) :\n Ctx(Ctx), Name(getTypeName(Ctx, Ty, Info.IsImplicitlyUnwrappedOptional)),\n PrintedName(getPrintedName(Ctx, Ty, Info.IsImplicitlyUnwrappedOptional)),\n ParamValueOwnership(Info.ValueOwnership),\n HasDefaultArg(Info.hasDefaultArgument) {\n if (isFunctionTypeNoEscape(Ty))\n TypeAttrs.push_back(TypeAttrKind::TAK_noescape);\n \/\/ If this is a nominal type, get its Usr.\n if (auto *ND = Ty->getAnyNominal()) {\n Usr = calculateUsr(Ctx, ND);\n }\n}\n\nSDKNodeInitInfo::SDKNodeInitInfo(SDKContext &Ctx, Decl *D):\n Ctx(Ctx), DKind(D->getKind()),\n Location(calculateLocation(Ctx, D)),\n ModuleName(D->getModuleContext()->getName().str()),\n GenericSig(printGenericSignature(Ctx, D)),\n IntromacOS(Ctx.getPlatformIntroVersion(D, PlatformKind::OSX)),\n IntroiOS(Ctx.getPlatformIntroVersion(D, PlatformKind::iOS)),\n IntrotvOS(Ctx.getPlatformIntroVersion(D, PlatformKind::tvOS)),\n IntrowatchOS(Ctx.getPlatformIntroVersion(D, PlatformKind::watchOS)),\n Introswift(Ctx.getLanguageIntroVersion(D)),\n IsImplicit(D->isImplicit()),\n IsDeprecated(D->getAttrs().getDeprecated(D->getASTContext())),\n IsABIPlaceholder(isABIPlaceholderRecursive(D)) {\n\n \/\/ Force some attributes that are lazily computed.\n \/\/ FIXME: we should use these AST predicates directly instead of looking at\n \/\/ the attributes rdar:\/\/50217247.\n if (auto *VD = dyn_cast(D)) {\n (void) VD->isObjC();\n (void) VD->isFinal();\n (void) VD->isDynamic();\n }\n\n \/\/ Capture all attributes.\n auto AllAttrs = D->getAttrs();\n std::transform(AllAttrs.begin(), AllAttrs.end(), std::back_inserter(DeclAttrs),\n [](DeclAttribute *attr) { return attr->getKind(); });\n}\n\nSDKNodeInitInfo::SDKNodeInitInfo(SDKContext &Ctx, OperatorDecl *OD):\n SDKNodeInitInfo(Ctx, cast(OD)) {\n Name = OD->getName().str();\n PrintedName = OD->getName().str();\n}\n\n\nSDKNodeInitInfo::SDKNodeInitInfo(SDKContext &Ctx, ProtocolConformance *Conform):\n SDKNodeInitInfo(Ctx, Conform->getProtocol()) {\n \/\/ The conformance can be conditional. The generic signature keeps track of\n \/\/ the requirements.\n GenericSig = printGenericSignature(Ctx, Conform);\n \/\/ Whether this conformance is ABI placeholder depends on the decl context\n \/\/ of this conformance.\n IsABIPlaceholder = isABIPlaceholderRecursive(Conform->getDeclContext()->\n getAsDecl());\n}\n\nstatic bool isProtocolRequirement(ValueDecl *VD) {\n if (isa(VD->getDeclContext()) && VD->isProtocolRequirement())\n return true;\n \/\/ If the VD is an accessor of the property declaration that is a protocol\n \/\/ requirement, we consider this accessor as a protocol requirement too.\n if (auto *AD = dyn_cast(VD)) {\n if (auto *ST = AD->getStorage()) {\n return isProtocolRequirement(ST);\n }\n }\n return false;\n}\n\nstatic bool requireWitnessTableEntry(ValueDecl *VD) {\n if (auto *FD = dyn_cast(VD)) {\n return SILDeclRef::requiresNewWitnessTableEntry(FD);\n }\n return false;\n}\n\nSDKNodeInitInfo::SDKNodeInitInfo(SDKContext &Ctx, ValueDecl *VD)\n : SDKNodeInitInfo(Ctx, cast(VD)) {\n Name = getSimpleName(VD);\n PrintedName = getPrintedName(Ctx, VD);\n Usr = calculateUsr(Ctx, VD);\n IsThrowing = isFuncThrowing(VD);\n IsStatic = VD->isStatic();\n IsOverriding = VD->getOverriddenDecl();\n IsProtocolReq = isProtocolRequirement(VD);\n IsOpen = Ctx.getAccessLevel(VD) == AccessLevel::Open;\n IsInternal = Ctx.getAccessLevel(VD) < AccessLevel::Public;\n SelfIndex = getSelfIndex(VD);\n FixedBinaryOrder = Ctx.getFixedBinaryOrder(VD);\n ReferenceOwnership = getReferenceOwnership(VD);\n ReqNewWitnessTableEntry = IsProtocolReq && requireWitnessTableEntry(VD);\n\n \/\/ Calculate usr for its super class.\n if (auto *CD = dyn_cast_or_null(VD)) {\n if (auto *Super = CD->getSuperclassDecl()) {\n SuperclassUsr = calculateUsr(Ctx, Super);\n for (auto T = CD->getSuperclass(); T; T = T->getSuperclass()) {\n SuperclassNames.push_back(getPrintedName(Ctx, T->getCanonicalType()));\n }\n }\n }\n\n if (auto *FD = dyn_cast(VD)) {\n switch(FD->getSelfAccessKind()) {\n case SelfAccessKind::Mutating:\n FuncSelfKind = \"Mutating\";\n break;\n case SelfAccessKind::Consuming:\n \/\/ FIXME: Stay consistent with earlier digests that had underscores here.\n FuncSelfKind = \"__Consuming\";\n break;\n case SelfAccessKind::NonMutating:\n FuncSelfKind = \"NonMutating\";\n break;\n }\n }\n\n \/\/ Get enum raw type name if this is an enum.\n if (auto *ED = dyn_cast(VD)) {\n if (auto RT = ED->getRawType()) {\n if (auto *D = RT->getNominalOrBoundGenericNominal()) {\n EnumRawTypeName = D->getName().str();\n }\n }\n }\n if (auto *VAD = dyn_cast(VD)) {\n IsLet = VAD->isLet();\n }\n if (auto *VAR = dyn_cast(VD)) {\n HasStorage = VAR->hasStorage();\n }\n if (auto *ACC = dyn_cast(VD)) {\n AccKind = ACC->getAccessorKind();\n }\n}\n\nSDKNode *SDKNodeInitInfo::createSDKNode(SDKNodeKind Kind) {\n switch(Kind) {\n#define NODE_KIND(X, NAME) \\\ncase SDKNodeKind::X: \\\n return static_cast(new (Ctx.allocator().Allocate()) \\\n SDKNode##X(*this)); \\\n break;\n#include \"swift\/IDE\/DigesterEnums.def\"\n }\n llvm_unreachable(\"covered switch\");\n}\n\n\/\/ Recursively construct a node that represents a type, for instance,\n\/\/ representing the return value type of a function decl.\nSDKNode *swift::ide::api::\nSwiftDeclCollector::constructTypeNode(Type T, TypeInitInfo Info) {\n if (Ctx.checkingABI()) {\n T = T->getCanonicalType();\n \/\/ If the type is a opaque result type (some Type) and we're in the ABI mode,\n \/\/ we should substitute the opaque result type to its underlying type.\n \/\/ Notice this only works if the opaque result type is from an inlinable\n \/\/ function where the function body is present in the swift module file, thus\n \/\/ allowing us to know the concrete type.\n if (auto OTA = T->getAs()) {\n if (auto *D = OTA->getDecl()) {\n if (auto SubMap = D->getUnderlyingTypeSubstitutions()) {\n T = Type(D->getUnderlyingInterfaceType()).\n subst(*SubMap)->getCanonicalType();\n }\n }\n }\n }\n\n if (auto NAT = dyn_cast(T.getPointer())) {\n SDKNode* Root = SDKNodeInitInfo(Ctx, T, Info).createSDKNode(SDKNodeKind::TypeAlias);\n Root->addChild(constructTypeNode(NAT->getSinglyDesugaredType()));\n return Root;\n }\n\n if (auto Fun = T->getAs()) {\n SDKNode* Root = SDKNodeInitInfo(Ctx, T, Info).createSDKNode(SDKNodeKind::TypeFunc);\n\n \/\/ Still, return type first\n Root->addChild(constructTypeNode(Fun->getResult()));\n\n auto Input = AnyFunctionType::composeInput(Fun->getASTContext(),\n Fun->getParams(),\n \/*canonicalVararg=*\/false);\n Root->addChild(constructTypeNode(Input));\n return Root;\n }\n\n SDKNode* Root = SDKNodeInitInfo(Ctx, T, Info).createSDKNode(SDKNodeKind::TypeNominal);\n\n \/\/ Keep paren type as a stand-alone level.\n if (auto *PT = dyn_cast(T.getPointer())) {\n Root->addChild(constructTypeNode(PT->getSinglyDesugaredType()));\n return Root;\n }\n\n \/\/ Handle the case where Type has sub-types.\n if (auto BGT = T->getAs()) {\n for (auto Arg : BGT->getGenericArgs()) {\n Root->addChild(constructTypeNode(Arg));\n }\n } else if (auto Tup = T->getAs()) {\n for (auto Elt : Tup->getElementTypes())\n Root->addChild(constructTypeNode(Elt));\n } else if (auto MTT = T->getAs()) {\n Root->addChild(constructTypeNode(MTT->getInstanceType()));\n } else if (auto ATT = T->getAs()) {\n for (auto Pro : ATT->getConformsTo()) {\n Root->addChild(constructTypeNode(Pro->getDeclaredType()));\n }\n }\n return Root;\n}\n\nstd::vector swift::ide::api::\nSwiftDeclCollector::createParameterNodes(ParameterList *PL) {\n std::vector Result;\n for (auto param: *PL) {\n TypeInitInfo Info;\n Info.IsImplicitlyUnwrappedOptional = param->isImplicitlyUnwrappedOptional();\n Info.hasDefaultArgument = param->getDefaultArgumentKind() !=\n DefaultArgumentKind::None;\n switch (param->getValueOwnership()) {\n#define CASE(KIND) case ValueOwnership::KIND: Info.ValueOwnership = #KIND; break;\n CASE(Owned)\n CASE(InOut)\n CASE(Shared)\n case ValueOwnership::Default: break;\n#undef CASE\n }\n Result.push_back(constructTypeNode(param->getInterfaceType(), Info));\n }\n return Result;\n}\n\n\/\/ Construct a node for a function decl. The first child of the function decl\n\/\/ is guaranteed to be the return value type of this function.\n\/\/ We sometimes skip the first parameter because it can be metatype of dynamic\n\/\/ this if the function is a member function.\nSDKNode *swift::ide::api::\nSwiftDeclCollector::constructFunctionNode(FuncDecl* FD,\n SDKNodeKind Kind) {\n auto Func = SDKNodeInitInfo(Ctx, FD).createSDKNode(Kind);\n TypeInitInfo Info;\n Info.IsImplicitlyUnwrappedOptional = FD->isImplicitlyUnwrappedOptional();\n Func->addChild(constructTypeNode(FD->getResultInterfaceType(), Info));\n for (auto *Node : createParameterNodes(FD->getParameters()))\n Func->addChild(Node);\n return Func;\n}\n\nSDKNode* swift::ide::api::\nSwiftDeclCollector::constructInitNode(ConstructorDecl *CD) {\n auto Func = SDKNodeInitInfo(Ctx, CD).createSDKNode(SDKNodeKind::DeclConstructor);\n Func->addChild(constructTypeNode(CD->getResultInterfaceType()));\n for (auto *Node : createParameterNodes(CD->getParameters()))\n Func->addChild(Node);\n return Func;\n}\n\nbool swift::ide::api::\nSDKContext::shouldIgnore(Decl *D, const Decl* Parent) const {\n \/\/ Exclude all clang nodes if we're comparing Swift decls specifically.\n if (Opts.SwiftOnly && isFromClang(D)) {\n return true;\n }\n if (auto *ACC = dyn_cast(D)) {\n \/\/ Only include accessors if they are part of var and subscript decl.\n if (!isa(Parent)) {\n return true;\n }\n \/\/ Only include getter\/setter if we are checking source compatibility.\n if (!checkingABI()) {\n switch (ACC->getAccessorKind()) {\n case AccessorKind::Get:\n case AccessorKind::Set:\n break;\n default:\n return true;\n }\n }\n }\n if (checkingABI()) {\n if (auto *VD = dyn_cast(D)) {\n \/\/ Private vars with fixed binary orders can have ABI-impact, so we should\n \/\/ whitelist them if we're checking ABI.\n if (getFixedBinaryOrder(VD).hasValue())\n return false;\n \/\/ Typealias should have no impact on ABI.\n if (isa(VD))\n return true;\n }\n } else {\n if (D->isPrivateStdlibDecl(false))\n return true;\n if (AvailableAttr::isUnavailable(D))\n return true;\n }\n if (auto VD = dyn_cast(D)) {\n switch (getAccessLevel(VD)) {\n case AccessLevel::Internal:\n case AccessLevel::Private:\n case AccessLevel::FilePrivate:\n return true;\n case AccessLevel::Public:\n case AccessLevel::Open:\n break;\n }\n }\n\n if (auto *ClangD = D->getClangDecl()) {\n if (isa(ClangD))\n return true;\n if (isa(ClangD))\n return true;\n if (ClangD->hasAttr())\n return true;\n\n \/\/ If this decl is a synthesized member from a conformed clang protocol, we\n \/\/ should ignore this member to reduce redundancy.\n if (Parent &&\n !isa(Parent) &&\n isa(ClangD->getDeclContext()))\n return true;\n }\n return false;\n}\n\nSDKNode *swift::ide::api::\nSwiftDeclCollector::constructTypeDeclNode(NominalTypeDecl *NTD) {\n auto TypeNode = SDKNodeInitInfo(Ctx, NTD).createSDKNode(SDKNodeKind::DeclType);\n addConformancesToTypeDecl(cast(TypeNode), NTD);\n addMembersToRoot(TypeNode, NTD);\n for (auto Ext : NTD->getExtensions()) {\n HandledExtensions.insert(Ext);\n addMembersToRoot(TypeNode, Ext);\n }\n return TypeNode;\n}\n\n\/\/\/ Create a node for stand-alone extensions. In the sdk dump, we don't have\n\/\/\/ a specific node for extension. Members in extensions are inlined to the\n\/\/\/ extended types. If the extended types are from a different module, we have to\n\/\/\/ synthesize this type node to include those extension members, since these\n\/\/\/ extension members are legit members of the module.\nSDKNode *swift::ide::api::\nSwiftDeclCollector::constructExternalExtensionNode(NominalTypeDecl *NTD,\n ArrayRef AllExts) {\n SDKNodeInitInfo initInfo(Ctx, NTD);\n initInfo.IsExternal = true;\n auto *TypeNode = initInfo.createSDKNode(SDKNodeKind::DeclType);\n addConformancesToTypeDecl(cast(TypeNode), NTD);\n\n bool anyConformancesAdded = false;\n \/\/ The members of the extensions are the only members of this synthesized type.\n for (auto *Ext: AllExts) {\n HandledExtensions.insert(Ext);\n addMembersToRoot(TypeNode, Ext);\n\n \/\/ Keep track if we've declared any conformances in this extension.\n \/\/ FIXME: This is too conservative. We only _really_ care if this extension\n \/\/ declares a conformance to any public protocols outside the module\n \/\/ where the extended type originated. Eventually this should be\n \/\/ updated to filter extensions that declare conformances to internal\n \/\/ protocols that either don't inherit from any protocols or only\n \/\/ inherit from other internal protocols. It should also consider\n \/\/ conditional conformances with internal requirements that are still\n \/\/ part of the ABI.\n if (!Ext->getInherited().empty())\n anyConformancesAdded = true;\n }\n\n \/\/ If none of the extensions added any public members or conformances, don't\n \/\/ synthesize the type node.\n if (TypeNode->getChildrenCount() == 0 && !anyConformancesAdded)\n return nullptr;\n\n return TypeNode;\n}\n\nSDKNode *swift::ide::api::\nSwiftDeclCollector::constructVarNode(ValueDecl *VD) {\n auto Var = cast(SDKNodeInitInfo(Ctx, VD).createSDKNode(SDKNodeKind::DeclVar));\n TypeInitInfo Info;\n Info.IsImplicitlyUnwrappedOptional = VD->isImplicitlyUnwrappedOptional();\n Var->addChild(constructTypeNode(VD->getInterfaceType(), Info));\n if (auto VAD = dyn_cast(VD)) {\n for(auto *AC: VAD->getAllAccessors()) {\n if (!Ctx.shouldIgnore(AC, VAD)) {\n Var->addAccessor(constructFunctionNode(AC, SDKNodeKind::DeclAccessor));\n }\n }\n }\n return Var;\n}\n\nSDKNode *swift::ide::api::\nSwiftDeclCollector::constructTypeAliasNode(TypeAliasDecl *TAD) {\n auto Alias = SDKNodeInitInfo(Ctx, TAD).createSDKNode(SDKNodeKind::DeclTypeAlias);\n Alias->addChild(constructTypeNode(TAD->getUnderlyingTypeLoc().getType()));\n return Alias;\n}\n\nSDKNode *swift::ide::api::\nSwiftDeclCollector::constructAssociatedTypeNode(AssociatedTypeDecl *ATD) {\n auto Asso = SDKNodeInitInfo(Ctx, ATD).\n createSDKNode(SDKNodeKind::DeclAssociatedType);\n if (auto DT = ATD->getDefaultDefinitionType()) {\n Asso->addChild(constructTypeNode(DT));\n }\n return Asso;\n}\n\nSDKNode *swift::ide::api::\nSwiftDeclCollector::constructSubscriptDeclNode(SubscriptDecl *SD) {\n auto *Subs = cast(SDKNodeInitInfo(Ctx, SD).\n createSDKNode(SDKNodeKind::DeclSubscript));\n Subs->addChild(constructTypeNode(SD->getElementInterfaceType()));\n for (auto *Node: createParameterNodes(SD->getIndices())) {\n Subs->addChild(Node);\n }\n for(auto *AC: SD->getAllAccessors()) {\n if (!Ctx.shouldIgnore(AC, SD)) {\n Subs->addAccessor(constructFunctionNode(AC, SDKNodeKind::DeclAccessor));\n }\n }\n return Subs;\n}\n\nvoid swift::ide::api::\nSwiftDeclCollector::addMembersToRoot(SDKNode *Root, IterableDeclContext *Context) {\n for (auto *Member : Context->getMembers()) {\n if (Ctx.shouldIgnore(Member, Context->getDecl()))\n continue;\n if (auto Func = dyn_cast(Member)) {\n Root->addChild(constructFunctionNode(Func, SDKNodeKind::DeclFunction));\n } else if (auto CD = dyn_cast(Member)) {\n Root->addChild(constructInitNode(CD));\n } else if (auto VD = dyn_cast(Member)) {\n Root->addChild(constructVarNode(VD));\n } else if (auto TAD = dyn_cast(Member)) {\n Root->addChild(constructTypeAliasNode(TAD));\n } else if (auto EED = dyn_cast(Member)) {\n Root->addChild(constructVarNode(EED));\n } else if (auto NTD = dyn_cast(Member)) {\n Root->addChild(constructTypeDeclNode(NTD));\n } else if (auto ATD = dyn_cast(Member)) {\n Root->addChild(constructAssociatedTypeNode(ATD));\n } else if (auto SD = dyn_cast(Member)) {\n Root->addChild(constructSubscriptDeclNode(SD));\n } else if (isa(Member)) {\n \/\/ All containing variables should have been handled.\n } else if (isa(Member)) {\n \/\/ deinit has no impact.\n } else if (isa(Member)) {\n \/\/ avoid adding MissingMemberDecl\n } else {\n llvm_unreachable(\"unhandled member decl kind.\");\n }\n }\n}\n\nSDKNode *swift::ide::api::\nSwiftDeclCollector::constructTypeWitnessNode(AssociatedTypeDecl *Assoc,\n Type Ty) {\n auto *Witness = SDKNodeInitInfo(Ctx, Assoc).createSDKNode(SDKNodeKind::TypeWitness);\n Witness->addChild(constructTypeNode(Ty));\n return Witness;\n}\n\nSDKNode *swift::ide::api::\nSwiftDeclCollector::constructConformanceNode(ProtocolConformance *Conform) {\n if (Ctx.checkingABI())\n Conform = Conform->getCanonicalConformance();\n auto ConfNode = cast(SDKNodeInitInfo(Ctx,\n Conform).createSDKNode(SDKNodeKind::Conformance));\n Conform->forEachTypeWitness(\n [&](AssociatedTypeDecl *assoc, Type ty, TypeDecl *typeDecl) -> bool {\n ConfNode->addChild(constructTypeWitnessNode(assoc, ty));\n return false;\n });\n return ConfNode;\n}\n\nvoid swift::ide::api::\nSwiftDeclCollector::addConformancesToTypeDecl(SDKNodeDeclType *Root,\n NominalTypeDecl *NTD) {\n \/\/ Avoid adding the same conformance twice.\n SmallPtrSet Seen;\n for (auto &Conf: NTD->getAllConformances()) {\n if (!Ctx.shouldIgnore(Conf->getProtocol()) && !Seen.count(Conf))\n Root->addConformance(constructConformanceNode(Conf));\n Seen.insert(Conf);\n }\n}\n\nvoid SwiftDeclCollector::printTopLevelNames() {\n for (auto &Node : RootNode->getChildren()) {\n llvm::outs() << Node->getKind() << \": \" << Node->getName() << '\\n';\n }\n}\n\nvoid SwiftDeclCollector::lookupVisibleDecls(ArrayRef Modules) {\n for (auto M: Modules) {\n llvm::SmallVector Decls;\n M->getDisplayDecls(Decls);\n for (auto D : Decls) {\n if (Ctx.shouldIgnore(D))\n continue;\n if (KnownDecls.count(D))\n continue;\n KnownDecls.insert(D);\n if (auto VD = dyn_cast(D))\n foundDecl(VD, DeclVisibilityKind::DynamicLookup,\n DynamicLookupInfo::AnyObject);\n else\n processDecl(D);\n }\n }\n\n \/\/ Now sort the macros before processing so that we can have deterministic\n \/\/ output.\n llvm::array_pod_sort(ClangMacros.begin(), ClangMacros.end(),\n [](ValueDecl * const *lhs,\n ValueDecl * const *rhs) -> int {\n return (*lhs)->getBaseName().userFacingName().compare(\n (*rhs)->getBaseName().userFacingName());\n });\n\n for (auto *VD : ClangMacros)\n processValueDecl(VD);\n\n \/\/ Collect extensions to types from other modules and synthesize type nodes\n \/\/ for them.\n llvm::MapVector> ExtensionMap;\n for (auto *D: KnownDecls) {\n if (auto *Ext = dyn_cast(D)) {\n if (HandledExtensions.find(Ext) == HandledExtensions.end()) {\n auto *NTD = Ext->getExtendedNominal();\n \/\/ Check if the extension is from other modules.\n if (!llvm::is_contained(Modules, NTD->getModuleContext())) {\n ExtensionMap[NTD].push_back(Ext);\n }\n }\n }\n }\n for (auto Pair: ExtensionMap) {\n if (auto child = constructExternalExtensionNode(Pair.first, Pair.second))\n RootNode->addChild(child);\n }\n}\n\nSDKNode *SwiftDeclCollector::constructOperatorDeclNode(OperatorDecl *OD) {\n return SDKNodeInitInfo(Ctx, OD).createSDKNode(SDKNodeKind::DeclOperator);\n}\n\nvoid SwiftDeclCollector::processDecl(Decl *D) {\n assert(!isa(D));\n if (auto *OD = dyn_cast(D)) {\n RootNode->addChild(constructOperatorDeclNode(OD));\n }\n}\n\nvoid SwiftDeclCollector::processValueDecl(ValueDecl *VD) {\n if (auto FD = dyn_cast(VD)) {\n RootNode->addChild(constructFunctionNode(FD, SDKNodeKind::DeclFunction));\n } else if (auto NTD = dyn_cast(VD)) {\n RootNode->addChild(constructTypeDeclNode(NTD));\n } else if (auto VAD = dyn_cast(VD)) {\n RootNode->addChild(constructVarNode(VAD));\n } else if (auto TAD = dyn_cast(VD)) {\n RootNode->addChild(constructTypeAliasNode(TAD));\n } else {\n llvm_unreachable(\"unhandled value decl\");\n }\n}\n\nvoid SwiftDeclCollector::foundDecl(ValueDecl *VD, DeclVisibilityKind Reason,\n DynamicLookupInfo) {\n if (VD->getClangMacro()) {\n \/\/ Collect macros, we will sort them afterwards.\n ClangMacros.push_back(VD);\n return;\n }\n\n processValueDecl(VD);\n}\n\nvoid SDKNode::output(json::Output &out, KeyKind Key, bool Value) {\n if (Value)\n out.mapRequired(getKeyContent(Ctx, Key).data(), Value);\n}\n\nvoid SDKNode::output(json::Output &out, KeyKind Key, StringRef Value) {\n if (!Value.empty())\n out.mapRequired(getKeyContent(Ctx, Key).data(), Value);\n}\n\nvoid SDKNode::jsonize(json::Output &out) {\n auto Kind = getKind();\n out.mapRequired(getKeyContent(Ctx, KeyKind::KK_kind).data(), Kind);\n output(out, KeyKind::KK_name, Name);\n output(out, KeyKind::KK_printedName, PrintedName);\n out.mapOptional(getKeyContent(Ctx, KeyKind::KK_children).data(), Children);\n}\n\nvoid SDKNodeRoot::jsonize(json::Output &out) {\n SDKNode::jsonize(out);\n out.mapRequired(getKeyContent(Ctx, KeyKind::KK_json_format_version).data(), JsonFormatVer);\n if (!Ctx.getOpts().AvoidToolArgs)\n out.mapOptional(getKeyContent(Ctx, KeyKind::KK_tool_arguments).data(), ToolArgs);\n}\n\nvoid SDKNodeConformance::jsonize(json::Output &out) {\n SDKNode::jsonize(out);\n output(out, KeyKind::KK_usr, Usr);\n output(out, KeyKind::KK_isABIPlaceholder, IsABIPlaceholder);\n}\n\nvoid SDKNodeDecl::jsonize(json::Output &out) {\n SDKNode::jsonize(out);\n out.mapRequired(getKeyContent(Ctx, KeyKind::KK_declKind).data(), DKind);\n output(out, KeyKind::KK_usr, Usr);\n output(out, KeyKind::KK_location, Location);\n output(out, KeyKind::KK_moduleName, ModuleName);\n output(out, KeyKind::KK_genericSig, GenericSig);\n output(out, KeyKind::KK_static, IsStatic);\n output(out, KeyKind::KK_deprecated,IsDeprecated);\n output(out, KeyKind::KK_protocolReq, IsProtocolReq);\n output(out, KeyKind::KK_overriding, IsOverriding);\n output(out, KeyKind::KK_implicit, IsImplicit);\n output(out, KeyKind::KK_isOpen, IsOpen);\n output(out, KeyKind::KK_isInternal, IsInternal);\n output(out, KeyKind::KK_isABIPlaceholder, IsABIPlaceholder);\n output(out, KeyKind::KK_intro_Macosx, introVersions.macos);\n output(out, KeyKind::KK_intro_iOS, introVersions.ios);\n output(out, KeyKind::KK_intro_tvOS, introVersions.tvos);\n output(out, KeyKind::KK_intro_watchOS, introVersions.watchos);\n output(out, KeyKind::KK_intro_swift, introVersions.swift);\n out.mapOptional(getKeyContent(Ctx, KeyKind::KK_declAttributes).data(), DeclAttributes);\n out.mapOptional(getKeyContent(Ctx, KeyKind::KK_fixedbinaryorder).data(), FixedBinaryOrder);\n \/\/ Strong reference is implied, no need for serialization.\n if (getReferenceOwnership() != ReferenceOwnership::Strong) {\n uint8_t Raw = uint8_t(getReferenceOwnership());\n out.mapRequired(getKeyContent(Ctx, KeyKind::KK_ownership).data(), Raw);\n }\n}\n\nvoid SDKNodeDeclAbstractFunc::jsonize(json::Output &out) {\n SDKNodeDecl::jsonize(out);\n output(out, KeyKind::KK_throwing, IsThrowing);\n output(out, KeyKind::KK_reqNewWitnessTableEntry, ReqNewWitnessTableEntry);\n out.mapOptional(getKeyContent(Ctx, KeyKind::KK_selfIndex).data(), SelfIndex);\n}\n\nvoid SDKNodeDeclFunction::jsonize(json::Output &out) {\n SDKNodeDeclAbstractFunc::jsonize(out);\n output(out, KeyKind::KK_funcSelfKind, FuncSelfKind);\n}\n\nvoid SDKNodeDeclType::jsonize(json::Output &out) {\n SDKNodeDecl::jsonize(out);\n output(out, KeyKind::KK_superclassUsr, SuperclassUsr);\n output(out, KeyKind::KK_enumRawTypeName, EnumRawTypeName);\n output(out, KeyKind::KK_isExternal, IsExternal);\n out.mapOptional(getKeyContent(Ctx, KeyKind::KK_superclassNames).data(), SuperclassNames);\n out.mapOptional(getKeyContent(Ctx, KeyKind::KK_conformances).data(), Conformances);\n}\n\nvoid SDKNodeType::jsonize(json::Output &out) {\n SDKNode::jsonize(out);\n out.mapOptional(getKeyContent(Ctx, KeyKind::KK_typeAttributes).data(), TypeAttributes);\n output(out, KeyKind::KK_hasDefaultArg, HasDefaultArg);\n output(out, KeyKind::KK_paramValueOwnership, ParamValueOwnership);\n}\n\nvoid SDKNodeTypeNominal::jsonize(json::Output &out) {\n SDKNodeType::jsonize(out);\n output(out, KeyKind::KK_usr, USR);\n}\n\nvoid SDKNodeDeclSubscript::jsonize(json::Output &out) {\n SDKNodeDeclAbstractFunc::jsonize(out);\n output(out, KeyKind::KK_hasStorage, HasStorage);\n out.mapOptional(getKeyContent(Ctx, KeyKind::KK_accessors).data(), Accessors);\n}\n\nvoid SDKNodeDeclVar::jsonize(json::Output &out) {\n SDKNodeDecl::jsonize(out);\n output(out, KeyKind::KK_isLet, IsLet);\n output(out, KeyKind::KK_hasStorage, HasStorage);\n out.mapOptional(getKeyContent(Ctx, KeyKind::KK_accessors).data(), Accessors);\n}\n\nvoid SDKNodeDeclAccessor::jsonize(json::Output &out) {\n SDKNodeDeclAbstractFunc::jsonize(out);\n out.mapRequired(getKeyContent(Ctx, KeyKind::KK_accessorKind).data(), AccKind);\n}\n\n\nnamespace swift {\nnamespace json {\n\/\/ In the namespace of swift::json, we define several functions so that the\n\/\/ JSON serializer will know how to interpret and dump types defined in this\n\/\/ file.\ntemplate<>\nstruct ScalarEnumerationTraits {\n static void enumeration(Output &out, TypeAttrKind &value) {\n#define TYPE_ATTR(X) out.enumCase(value, #X, TypeAttrKind::TAK_##X);\n#include \"swift\/AST\/Attr.def\"\n }\n};\n\ntemplate<>\nstruct ScalarEnumerationTraits {\n static void enumeration(Output &out, DeclAttrKind &value) {\n#define DECL_ATTR(_, Name, ...) out.enumCase(value, #Name, DeclAttrKind::DAK_##Name);\n#include \"swift\/AST\/Attr.def\"\n }\n};\n\ntemplate<>\nstruct ScalarEnumerationTraits {\n static void enumeration(Output &out, DeclKind &value) {\n#define DECL(X, PARENT) out.enumCase(value, #X, DeclKind::X);\n#include \"swift\/AST\/DeclNodes.def\"\n }\n};\n\ntemplate<>\nstruct ScalarEnumerationTraits {\n static void enumeration(Output &out, AccessorKind &value) {\n#define ACCESSOR(ID)\n#define SINGLETON_ACCESSOR(ID, KEYWORD) \\\n out.enumCase(value, #KEYWORD, AccessorKind::ID);\n#include \"swift\/AST\/AccessorKinds.def\"\n }\n};\n\ntemplate<>\nstruct ObjectTraits {\n static void mapping(Output &out, SDKNode *&value) {\n value->jsonize(out);\n }\n};\n\ntemplate<>\nstruct ArrayTraits> {\n static size_t size(Output &out, ArrayRef &seq) {\n return seq.size();\n }\n static SDKNode *&element(Output &, ArrayRef &seq,\n size_t index) {\n return const_cast(seq[index]);\n }\n};\n\ntemplate<>\nstruct ArrayTraits> {\n static size_t size(Output &out, ArrayRef &seq) {\n return seq.size();\n }\n static TypeAttrKind& element(Output &, ArrayRef &seq,\n size_t index) {\n return const_cast(seq[index]);\n }\n};\n\ntemplate<>\nstruct ArrayTraits> {\n static size_t size(Output &out, ArrayRef &seq) {\n return seq.size();\n }\n static DeclAttrKind& element(Output &, ArrayRef &seq,\n size_t index) {\n return const_cast(seq[index]);\n }\n};\ntemplate<>\nstruct ArrayTraits> {\n static size_t size(Output &out, ArrayRef &seq) {\n return seq.size();\n }\n static StringRef& element(Output &, ArrayRef &seq,\n size_t index) {\n return const_cast(seq[index]);\n }\n};\n} \/\/ namespace json\n} \/\/ namespace swift\n\nnamespace {\/\/ Anonymous namespace.\n\/\/ Deserialize an SDKNode tree.\nstd::pair, SDKNode*>\nstatic parseJsonEmit(SDKContext &Ctx, StringRef FileName) {\n namespace yaml = llvm::yaml;\n\n \/\/ Load the input file.\n llvm::ErrorOr> FileBufOrErr =\n vfs::getFileOrSTDIN(*Ctx.getSourceMgr().getFileSystem(), FileName);\n if (!FileBufOrErr) {\n llvm_unreachable(\"Failed to read JSON file\");\n }\n StringRef Buffer = FileBufOrErr->get()->getBuffer();\n yaml::Stream Stream(llvm::MemoryBufferRef(Buffer, FileName),\n Ctx.getSourceMgr().getLLVMSourceMgr());\n SDKNode *Result = nullptr;\n for (auto DI = Stream.begin(); DI != Stream.end(); ++ DI) {\n assert(DI != Stream.end() && \"Failed to read a document\");\n yaml::Node *N = DI->getRoot();\n assert(N && \"Failed to find a root\");\n Result = SDKNode::constructSDKNode(Ctx, cast(N));\n }\n return {std::move(FileBufOrErr.get()), Result};\n}\n} \/\/ End of anonymous namespace\n\n\/\/ Construct all roots vector from a given file where a forest was\n\/\/ previously dumped.\nvoid SwiftDeclCollector::deSerialize(StringRef Filename) {\n auto Pair = parseJsonEmit(Ctx, Filename);\n OwnedBuffers.push_back(std::move(Pair.first));\n RootNode = std::move(Pair.second);\n}\n\n\/\/ Serialize the content of all roots to a given file using JSON format.\nvoid SwiftDeclCollector::serialize(StringRef Filename, SDKNode *Root) {\n std::error_code EC;\n llvm::raw_fd_ostream fs(Filename, EC, llvm::sys::fs::F_None);\n json::Output yout(fs);\n yout << Root;\n}\n\n\/\/ Serialize the content of all roots to a given file using JSON format.\nvoid SwiftDeclCollector::serialize(StringRef Filename) {\n SwiftDeclCollector::serialize(Filename, RootNode);\n}\n\nSDKNodeRoot *\nswift::ide::api::getEmptySDKNodeRoot(SDKContext &SDKCtx) {\n SwiftDeclCollector Collector(SDKCtx);\n return Collector.getSDKRoot();\n}\n\nSDKNodeRoot*\nswift::ide::api::getSDKNodeRoot(SDKContext &SDKCtx,\n const CompilerInvocation &InitInvok,\n const llvm::StringSet<> &ModuleNames) {\n CheckerOptions Opts = SDKCtx.getOpts();\n CompilerInvocation Invocation(InitInvok);\n\n CompilerInstance &CI = SDKCtx.newCompilerInstance();\n \/\/ Display diagnostics to stderr.\n PrintingDiagnosticConsumer PrintDiags(llvm::errs());\n if (llvm::errs().has_colors())\n PrintDiags.forceColors();\n CI.addDiagnosticConsumer(&PrintDiags);\n if (CI.setup(Invocation)) {\n llvm::errs() << \"Failed to setup the compiler instance\\n\";\n return nullptr;\n }\n\n auto &Ctx = CI.getASTContext();\n\n\n \/\/ Load standard library so that Clang importer can use it.\n auto *Stdlib = Ctx.getStdlibModule(\/*loadIfAbsent=*\/true);\n if (!Stdlib) {\n llvm::errs() << \"Failed to load Swift stdlib\\n\";\n return nullptr;\n }\n\n std::vector Modules;\n for (auto &Entry : ModuleNames) {\n StringRef Name = Entry.getKey();\n if (Opts.Verbose)\n llvm::errs() << \"Loading module: \" << Name << \"...\\n\";\n auto *M = Ctx.getModuleByName(Name);\n if (!M || M->failedToLoad() || Ctx.Diags.hadAnyError()) {\n llvm::errs() << \"Failed to load module: \" << Name << '\\n';\n if (Opts.AbortOnModuleLoadFailure)\n return nullptr;\n } else {\n Modules.push_back(M);\n }\n }\n if (Opts.Verbose)\n llvm::errs() << \"Scanning symbols...\\n\";\n\n SwiftDeclCollector Collector(SDKCtx);\n Collector.lookupVisibleDecls(Modules);\n return Collector.getSDKRoot();\n}\n\nvoid swift::ide::api::dumpSDKRoot(SDKNodeRoot *Root, StringRef OutputFile) {\n assert(Root);\n auto Opts = Root->getSDKContext().getOpts();\n if (Opts.Verbose)\n llvm::errs() << \"Dumping SDK...\\n\";\n SwiftDeclCollector::serialize(OutputFile, Root);\n if (Opts.Verbose)\n llvm::errs() << \"Dumped to \"<< OutputFile << \"\\n\";\n}\n\nint swift::ide::api::dumpSDKContent(const CompilerInvocation &InitInvok,\n const llvm::StringSet<> &ModuleNames,\n StringRef OutputFile, CheckerOptions Opts) {\n SDKContext SDKCtx(Opts);\n SDKNodeRoot *Root = getSDKNodeRoot(SDKCtx, InitInvok, ModuleNames);\n if (!Root)\n return 1;\n dumpSDKRoot(Root, OutputFile);\n return 0;\n}\n\nint swift::ide::api::deserializeSDKDump(StringRef dumpPath, StringRef OutputPath,\n CheckerOptions Opts) {\n std::error_code EC;\n llvm::raw_fd_ostream FS(OutputPath, EC, llvm::sys::fs::F_None);\n if (!fs::exists(dumpPath)) {\n llvm::errs() << dumpPath << \" does not exist\\n\";\n return 1;\n }\n PrintingDiagnosticConsumer PDC;\n SDKContext Ctx(Opts);\n Ctx.getDiags().addConsumer(PDC);\n\n SwiftDeclCollector Collector(Ctx);\n Collector.deSerialize(dumpPath);\n Collector.serialize(OutputPath);\n return 0;\n}\n\nint swift::ide::api::findDeclUsr(StringRef dumpPath, CheckerOptions Opts) {\n std::error_code EC;\n if (!fs::exists(dumpPath)) {\n llvm::errs() << dumpPath << \" does not exist\\n\";\n return 1;\n }\n PrintingDiagnosticConsumer PDC;\n SDKContext Ctx(Opts);\n Ctx.getDiags().addConsumer(PDC);\n\n SwiftDeclCollector Collector(Ctx);\n Collector.deSerialize(dumpPath);\n struct FinderByLocation: SDKNodeVisitor {\n StringRef Location;\n FinderByLocation(StringRef Location): Location(Location) {}\n void visit(SDKNode* Node) override {\n if (auto *D = dyn_cast(Node)) {\n if (D->getLocation().find(Location) != StringRef::npos &&\n !D->getUsr().empty()) {\n llvm::outs() << D->getFullyQualifiedName() << \": \" << D->getUsr() << \"\\n\";\n }\n }\n }\n };\n if (!Opts.LocationFilter.empty()) {\n FinderByLocation Finder(Opts.LocationFilter);\n Collector.visitAllRoots(Finder);\n }\n return 0;\n}\n","avg_line_length":34.575978162,"max_line_length":103,"alphanum_fraction":0.6673070344,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":2311,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":3.0,"content":"#include \"c4\/format.hpp\"\n\n#ifdef __clang__\n# pragma clang diagnostic push\n# pragma clang diagnostic ignored \"-Wformat-nonliteral\"\n#elif defined(__GNUC__)\n# pragma GCC diagnostic push\n# pragma GCC diagnostic ignored \"-Wformat-nonliteral\"\n#endif\n\nnamespace c4 {\n\nsize_t sprintf(substr buf, const char *fmt, ...)\n{\n va_list args;\n va_start(args, fmt);\n\n \/* vsnprintf() returns number of characters written if successful or\n * negative value if an error occurred. If the resulting string gets\n * truncated due to buf_size limit, returns the total number of\n * characters (not including the terminating null-byte) which would have\n * been written, if the limit was not imposed.\n *\n * @see http:\/\/en.cppreference.com\/w\/cpp\/io\/c\/vfprintf\n *\/\n int inum = ::vsnprintf(buf.str, buf.len, fmt, args);\n\n \/* if the retval is negative, maybe there's a formatting error so it's\n * impossible to know the length of the needed string.\n *\n * So return a huge value to try to cause a mess to let the client know\n * early. *\/\n size_t snum = inum >= 0 ? (size_t)inum : (size_t)-1;\n\n va_end(args);\n\n return snum;\n}\n\n\nsize_t to_chars(substr buf, fmt::const_raw_wrapper r)\n{\n void * vptr = buf.str;\n size_t space = buf.len;\n auto ptr = (decltype(buf.str)) std::align(r.alignment, r.len, vptr, space);\n if(ptr == nullptr)\n {\n \/\/ if it was not possible to align, return a conservative estimate\n \/\/ of the required space\n return r.alignment + r.len;\n }\n C4_CHECK(ptr >= buf.begin() && ptr <= buf.end());\n size_t sz = static_cast(ptr - buf.str) + r.len;\n if(sz <= buf.len)\n {\n memcpy(ptr, r.buf, r.len);\n }\n return sz;\n}\n\n\nsize_t from_chars(csubstr buf, fmt::raw_wrapper *r)\n{\n void * vptr = (void*)buf.str;\n size_t space = buf.len;\n auto ptr = (decltype(buf.str)) std::align(r->alignment, r->len, vptr, space);\n C4_CHECK(ptr != nullptr);\n C4_CHECK(ptr >= buf.begin() && ptr <= buf.end());\n \/\/size_t dim = (ptr - buf.str) + r->len;\n memcpy(r->buf, ptr, r->len);\n size_t sz = static_cast(ptr - buf.str) + r->len;\n return sz;\n}\n\n\n} \/\/ namespace c4\n\n#ifdef __clang__\n# pragma clang diagnostic pop\n#elif defined(__GNUC__)\n# pragma GCC diagnostic pop\n#endif\n","avg_line_length":27.843373494,"max_line_length":81,"alphanum_fraction":0.6391172653,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":48402,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":null,"content":"\/\/ Copyright (c) 2018-2019 The Gold BCR Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \n\n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n\nnamespace {\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Checksum \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\n\/\/ This section implements a checksum algorithm for descriptors with the\n\/\/ following properties:\n\/\/ * Mistakes in a descriptor string are measured in \"symbol errors\". The higher\n\/\/ the number of symbol errors, the harder it is to detect:\n\/\/ * An error substituting a character from 0123456789()[],'\/*abcdefgh@:$%{} for\n\/\/ another in that set always counts as 1 symbol error.\n\/\/ * Note that hex encoded keys are covered by these characters. Xprvs and\n\/\/ xpubs use other characters too, but already have their own checksum\n\/\/ mechanism.\n\/\/ * Function names like \"multi()\" use other characters, but mistakes in\n\/\/ these would generally result in an unparsable descriptor.\n\/\/ * A case error always counts as 1 symbol error.\n\/\/ * Any other 1 character substitution error counts as 1 or 2 symbol errors.\n\/\/ * Any 1 symbol error is always detected.\n\/\/ * Any 2 or 3 symbol error in a descriptor of up to 49154 characters is always detected.\n\/\/ * Any 4 symbol error in a descriptor of up to 507 characters is always detected.\n\/\/ * Any 5 symbol error in a descriptor of up to 77 characters is always detected.\n\/\/ * Is optimized to minimize the chance a 5 symbol error in a descriptor up to 387 characters is undetected\n\/\/ * Random errors have a chance of 1 in 2**40 of being undetected.\n\/\/\n\/\/ These properties are achieved by expanding every group of 3 (non checksum) characters into\n\/\/ 4 GF(32) symbols, over which a cyclic code is defined.\n\n\/*\n * Interprets c as 8 groups of 5 bits which are the coefficients of a degree 8 polynomial over GF(32),\n * multiplies that polynomial by x, computes its remainder modulo a generator, and adds the constant term val.\n *\n * This generator is G(x) = x^8 + {30}x^7 + {23}x^6 + {15}x^5 + {14}x^4 + {10}x^3 + {6}x^2 + {12}x + {9}.\n * It is chosen to define an cyclic error detecting code which is selected by:\n * - Starting from all BCH codes over GF(32) of degree 8 and below, which by construction guarantee detecting\n * 3 errors in windows up to 19000 symbols.\n * - Taking all those generators, and for degree 7 ones, extend them to degree 8 by adding all degree-1 factors.\n * - Selecting just the set of generators that guarantee detecting 4 errors in a window of length 512.\n * - Selecting one of those with best worst-case behavior for 5 errors in windows of length up to 512.\n *\n * The generator and the constants to implement it can be verified using this Sage code:\n * B = GF(2) # Binary field\n * BP. = B[] # Polynomials over the binary field\n * F_mod = b**5 + b**3 + 1\n * F. = GF(32, modulus=F_mod, repr='int') # GF(32) definition\n * FP. = F[] # Polynomials over GF(32)\n * E_mod = x**3 + x + F.fetch_int(8)\n * E. = F.extension(E_mod) # Extension field definition\n * alpha = e**2743 # Choice of an element in extension field\n * for p in divisors(E.order() - 1): # Verify alpha has order 32767.\n * assert((alpha**p == 1) == (p % 32767 == 0))\n * G = lcm([(alpha**i).minpoly() for i in [1056,1057,1058]] + [x + 1])\n * print(G) # Print out the generator\n * for i in [1,2,4,8,16]: # Print out {1,2,4,8,16}*(G mod x^8), packed in hex integers.\n * v = 0\n * for coef in reversed((F.fetch_int(i)*(G % x**8)).coefficients(sparse=True)):\n * v = v*32 + coef.integer_representation()\n * print(\"0x%x\" % v)\n *\/\nuint64_t PolyMod(uint64_t c, int val)\n{\n uint8_t c0 = c >> 35;\n c = ((c & 0x7ffffffff) << 5) ^ val;\n if (c0 & 1) c ^= 0xf5dee51989;\n if (c0 & 2) c ^= 0xa9fdca3312;\n if (c0 & 4) c ^= 0x1bab10e32d;\n if (c0 & 8) c ^= 0x3706b1677a;\n if (c0 & 16) c ^= 0x644d626ffd;\n return c;\n}\n\nstd::string DescriptorChecksum(const Span& span)\n{\n \/** A character set designed such that:\n * - The most common 'unprotected' descriptor characters (hex, keypaths) are in the first group of 32.\n * - Case errors cause an offset that's a multiple of 32.\n * - As many alphabetic characters are in the same group (while following the above restrictions).\n *\n * If p(x) gives the position of a character c in this character set, every group of 3 characters\n * (a,b,c) is encoded as the 4 symbols (p(a) & 31, p(b) & 31, p(c) & 31, (p(a) \/ 32) + 3 * (p(b) \/ 32) + 9 * (p(c) \/ 32).\n * This means that changes that only affect the lower 5 bits of the position, or only the higher 2 bits, will just\n * affect a single symbol.\n *\n * As a result, within-group-of-32 errors count as 1 symbol, as do cross-group errors that don't affect\n * the position within the groups.\n *\/\n static std::string INPUT_CHARSET =\n \"0123456789()[],'\/*abcdefgh@:$%{}\"\n \"IJKLMNOPQRSTUVWXYZ&+-.;<=>?!^_|~\"\n \"ijklmnopqrstuvwxyzABCDEFGH`#\\\"\\\\ \";\n\n \/** The character set for the checksum itself (same as bech32). *\/\n static std::string CHECKSUM_CHARSET = \"qpzry9x8gf2tvdw0s3jn54khce6mua7l\";\n\n uint64_t c = 1;\n int cls = 0;\n int clscount = 0;\n for (auto ch : span) {\n auto pos = INPUT_CHARSET.find(ch);\n if (pos == std::string::npos) return \"\";\n c = PolyMod(c, pos & 31); \/\/ Emit a symbol for the position inside the group, for every character.\n cls = cls * 3 + (pos >> 5); \/\/ Accumulate the group numbers\n if (++clscount == 3) {\n \/\/ Emit an extra symbol representing the group numbers, for every 3 characters.\n c = PolyMod(c, cls);\n cls = 0;\n clscount = 0;\n }\n }\n if (clscount > 0) c = PolyMod(c, cls);\n for (int j = 0; j < 8; ++j) c = PolyMod(c, 0); \/\/ Shift further to determine the checksum.\n c ^= 1; \/\/ Prevent appending zeroes from not affecting the checksum.\n\n std::string ret(8, ' ');\n for (int j = 0; j < 8; ++j) ret[j] = CHECKSUM_CHARSET[(c >> (5 * (7 - j))) & 31];\n return ret;\n}\n\nstd::string AddChecksum(const std::string& str) { return str + \"#\" + DescriptorChecksum(MakeSpan(str)); }\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Internal representation \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\ntypedef std::vector KeyPath;\n\n\/** Interface for public key objects in descriptors. *\/\nstruct PubkeyProvider\n{\nprotected:\n \/\/! Index of this key expression in the descriptor\n \/\/! E.g. If this PubkeyProvider is key1 in multi(2, key1, key2, key3), then m_expr_index = 0\n uint32_t m_expr_index;\n\npublic:\n PubkeyProvider(uint32_t exp_index) : m_expr_index(exp_index) {}\n\n virtual ~PubkeyProvider() = default;\n\n \/** Derive a public key.\n * read_cache is the cache to read keys from (if not nullptr)\n * write_cache is the cache to write keys to (if not nullptr)\n * Caches are not exclusive but this is not tested. Currently we use them exclusively\n *\/\n virtual bool GetPubKey(int pos, const SigningProvider& arg, CPubKey& key, KeyOriginInfo& info, const DescriptorCache* read_cache = nullptr, DescriptorCache* write_cache = nullptr) = 0;\n\n \/** Whether this represent multiple public keys at different positions. *\/\n virtual bool IsRange() const = 0;\n\n \/** Get the size of the generated public key(s) in bytes (33 or 65). *\/\n virtual size_t GetSize() const = 0;\n\n \/** Get the descriptor string form. *\/\n virtual std::string ToString() const = 0;\n\n \/** Get the descriptor string form including private data (if available in arg). *\/\n virtual bool ToPrivateString(const SigningProvider& arg, std::string& out) const = 0;\n\n \/** Derive a private key, if private data is available in arg. *\/\n virtual bool GetPrivKey(int pos, const SigningProvider& arg, CKey& key) const = 0;\n};\n\nclass OriginPubkeyProvider final : public PubkeyProvider\n{\n KeyOriginInfo m_origin;\n std::unique_ptr m_provider;\n\n std::string OriginString() const\n {\n return HexStr(std::begin(m_origin.fingerprint), std::end(m_origin.fingerprint)) + FormatHDKeypath(m_origin.path);\n }\n\npublic:\n OriginPubkeyProvider(uint32_t exp_index, KeyOriginInfo info, std::unique_ptr provider) : PubkeyProvider(exp_index), m_origin(std::move(info)), m_provider(std::move(provider)) {}\n bool GetPubKey(int pos, const SigningProvider& arg, CPubKey& key, KeyOriginInfo& info, const DescriptorCache* read_cache = nullptr, DescriptorCache* write_cache = nullptr) override\n {\n if (!m_provider->GetPubKey(pos, arg, key, info, read_cache, write_cache)) return false;\n std::copy(std::begin(m_origin.fingerprint), std::end(m_origin.fingerprint), info.fingerprint);\n info.path.insert(info.path.begin(), m_origin.path.begin(), m_origin.path.end());\n return true;\n }\n bool IsRange() const override { return m_provider->IsRange(); }\n size_t GetSize() const override { return m_provider->GetSize(); }\n std::string ToString() const override { return \"[\" + OriginString() + \"]\" + m_provider->ToString(); }\n bool ToPrivateString(const SigningProvider& arg, std::string& ret) const override\n {\n std::string sub;\n if (!m_provider->ToPrivateString(arg, sub)) return false;\n ret = \"[\" + OriginString() + \"]\" + std::move(sub);\n return true;\n }\n bool GetPrivKey(int pos, const SigningProvider& arg, CKey& key) const override\n {\n return m_provider->GetPrivKey(pos, arg, key);\n }\n};\n\n\/** An object representing a parsed constant public key in a descriptor. *\/\nclass ConstPubkeyProvider final : public PubkeyProvider\n{\n CPubKey m_pubkey;\n\npublic:\n ConstPubkeyProvider(uint32_t exp_index, const CPubKey& pubkey) : PubkeyProvider(exp_index), m_pubkey(pubkey) {}\n bool GetPubKey(int pos, const SigningProvider& arg, CPubKey& key, KeyOriginInfo& info, const DescriptorCache* read_cache = nullptr, DescriptorCache* write_cache = nullptr) override\n {\n key = m_pubkey;\n info.path.clear();\n CKeyID keyid = m_pubkey.GetID();\n std::copy(keyid.begin(), keyid.begin() + sizeof(info.fingerprint), info.fingerprint);\n return true;\n }\n bool IsRange() const override { return false; }\n size_t GetSize() const override { return m_pubkey.size(); }\n std::string ToString() const override { return HexStr(m_pubkey.begin(), m_pubkey.end()); }\n bool ToPrivateString(const SigningProvider& arg, std::string& ret) const override\n {\n CKey key;\n if (!arg.GetKey(m_pubkey.GetID(), key)) return false;\n ret = EncodeSecret(key);\n return true;\n }\n bool GetPrivKey(int pos, const SigningProvider& arg, CKey& key) const override\n {\n return arg.GetKey(m_pubkey.GetID(), key);\n }\n};\n\nenum class DeriveType {\n NO,\n UNHARDENED,\n HARDENED,\n};\n\n\/** An object representing a parsed extended public key in a descriptor. *\/\nclass BIP32PubkeyProvider final : public PubkeyProvider\n{\n \/\/ Root xpub, path, and final derivation step type being used, if any\n CExtPubKey m_root_extkey;\n KeyPath m_path;\n DeriveType m_derive;\n \/\/ Cache of the parent of the final derived pubkeys.\n \/\/ Primarily useful for situations when no read_cache is provided\n CExtPubKey m_cached_xpub;\n\n bool GetExtKey(const SigningProvider& arg, CExtKey& ret) const\n {\n CKey key;\n if (!arg.GetKey(m_root_extkey.pubkey.GetID(), key)) return false;\n ret.nDepth = m_root_extkey.nDepth;\n std::copy(m_root_extkey.vchFingerprint, m_root_extkey.vchFingerprint + sizeof(ret.vchFingerprint), ret.vchFingerprint);\n ret.nChild = m_root_extkey.nChild;\n ret.chaincode = m_root_extkey.chaincode;\n ret.key = key;\n return true;\n }\n\n \/\/ Derives the last xprv\n bool GetDerivedExtKey(const SigningProvider& arg, CExtKey& xprv) const\n {\n if (!GetExtKey(arg, xprv)) return false;\n for (auto entry : m_path) {\n xprv.Derive(xprv, entry);\n }\n return true;\n }\n\n bool IsHardened() const\n {\n if (m_derive == DeriveType::HARDENED) return true;\n for (auto entry : m_path) {\n if (entry >> 31) return true;\n }\n return false;\n }\n\npublic:\n BIP32PubkeyProvider(uint32_t exp_index, const CExtPubKey& extkey, KeyPath path, DeriveType derive) : PubkeyProvider(exp_index), m_root_extkey(extkey), m_path(std::move(path)), m_derive(derive) {}\n bool IsRange() const override { return m_derive != DeriveType::NO; }\n size_t GetSize() const override { return 33; }\n bool GetPubKey(int pos, const SigningProvider& arg, CPubKey& key_out, KeyOriginInfo& final_info_out, const DescriptorCache* read_cache = nullptr, DescriptorCache* write_cache = nullptr) override\n {\n \/\/ Info of parent of the to be derived pubkey\n KeyOriginInfo parent_info;\n CKeyID keyid = m_root_extkey.pubkey.GetID();\n std::copy(keyid.begin(), keyid.begin() + sizeof(parent_info.fingerprint), parent_info.fingerprint);\n parent_info.path = m_path;\n\n \/\/ Info of the derived key itself which is copied out upon successful completion\n KeyOriginInfo final_info_out_tmp = parent_info;\n if (m_derive == DeriveType::UNHARDENED) final_info_out_tmp.path.push_back((uint32_t)pos);\n if (m_derive == DeriveType::HARDENED) final_info_out_tmp.path.push_back(((uint32_t)pos) | 0x80000000L);\n\n \/\/ Derive keys or fetch them from cache\n CExtPubKey final_extkey = m_root_extkey;\n CExtPubKey parent_extkey = m_root_extkey;\n bool der = true;\n if (read_cache) {\n if (!read_cache->GetCachedDerivedExtPubKey(m_expr_index, pos, final_extkey)) {\n if (m_derive == DeriveType::HARDENED) return false;\n \/\/ Try to get the derivation parent\n if (!read_cache->GetCachedParentExtPubKey(m_expr_index, parent_extkey)) return false;\n final_extkey = parent_extkey;\n if (m_derive == DeriveType::UNHARDENED) der = parent_extkey.Derive(final_extkey, pos);\n }\n } else if (m_cached_xpub.pubkey.IsValid() && m_derive != DeriveType::HARDENED) {\n parent_extkey = final_extkey = m_cached_xpub;\n if (m_derive == DeriveType::UNHARDENED) der = parent_extkey.Derive(final_extkey, pos);\n } else if (IsHardened()) {\n CExtKey xprv;\n if (!GetDerivedExtKey(arg, xprv)) return false;\n parent_extkey = xprv.Neuter();\n if (m_derive == DeriveType::UNHARDENED) der = xprv.Derive(xprv, pos);\n if (m_derive == DeriveType::HARDENED) der = xprv.Derive(xprv, pos | 0x80000000UL);\n final_extkey = xprv.Neuter();\n } else {\n for (auto entry : m_path) {\n der = parent_extkey.Derive(parent_extkey, entry);\n assert(der);\n }\n final_extkey = parent_extkey;\n if (m_derive == DeriveType::UNHARDENED) der = parent_extkey.Derive(final_extkey, pos);\n assert(m_derive != DeriveType::HARDENED);\n }\n assert(der);\n\n final_info_out = final_info_out_tmp;\n key_out = final_extkey.pubkey;\n\n \/\/ We rely on the consumer to check that m_derive isn't HARDENED as above\n \/\/ But we can't have already cached something in case we read something from the cache\n \/\/ and parent_extkey isn't actually the parent.\n if (!m_cached_xpub.pubkey.IsValid()) m_cached_xpub = parent_extkey;\n\n if (write_cache) {\n \/\/ Only cache parent if there is any unhardened derivation\n if (m_derive != DeriveType::HARDENED) {\n write_cache->CacheParentExtPubKey(m_expr_index, parent_extkey);\n } else if (final_info_out.path.size() > 0) {\n write_cache->CacheDerivedExtPubKey(m_expr_index, pos, final_extkey);\n }\n }\n\n return true;\n }\n std::string ToString() const override\n {\n std::string ret = EncodeExtPubKey(m_root_extkey) + FormatHDKeypath(m_path);\n if (IsRange()) {\n ret += \"\/*\";\n if (m_derive == DeriveType::HARDENED) ret += '\\'';\n }\n return ret;\n }\n bool ToPrivateString(const SigningProvider& arg, std::string& out) const override\n {\n CExtKey key;\n if (!GetExtKey(arg, key)) return false;\n out = EncodeExtKey(key) + FormatHDKeypath(m_path);\n if (IsRange()) {\n out += \"\/*\";\n if (m_derive == DeriveType::HARDENED) out += '\\'';\n }\n return true;\n }\n bool GetPrivKey(int pos, const SigningProvider& arg, CKey& key) const override\n {\n CExtKey extkey;\n if (!GetDerivedExtKey(arg, extkey)) return false;\n if (m_derive == DeriveType::UNHARDENED) extkey.Derive(extkey, pos);\n if (m_derive == DeriveType::HARDENED) extkey.Derive(extkey, pos | 0x80000000UL);\n key = extkey.key;\n return true;\n }\n};\n\n\/** Base class for all Descriptor implementations. *\/\nclass DescriptorImpl : public Descriptor\n{\n \/\/! Public key arguments for this descriptor (size 1 for PK, PKH, WPKH; any size for Multisig).\n const std::vector> m_pubkey_args;\n \/\/! The string name of the descriptor function.\n const std::string m_name;\n\nprotected:\n \/\/! The sub-descriptor argument (nullptr for everything but SH and WSH).\n \/\/! In doc\/descriptors.m this is referred to as SCRIPT expressions sh(SCRIPT)\n \/\/! and wsh(SCRIPT), and distinct from KEY expressions and ADDR expressions.\n const std::unique_ptr m_subdescriptor_arg;\n\n \/\/! Return a serialization of anything except pubkey and script arguments, to be prepended to those.\n virtual std::string ToStringExtra() const { return \"\"; }\n\n \/** A helper function to construct the scripts for this descriptor.\n *\n * This function is invoked once for every CScript produced by evaluating\n * m_subdescriptor_arg, or just once in case m_subdescriptor_arg is nullptr.\n\n * @param pubkeys The evaluations of the m_pubkey_args field.\n * @param script The evaluation of m_subdescriptor_arg (or nullptr when m_subdescriptor_arg is nullptr).\n * @param out A FlatSigningProvider to put scripts or public keys in that are necessary to the solver.\n * The script arguments to this function are automatically added, as is the origin info of the provided pubkeys.\n * @return A vector with scriptPubKeys for this descriptor.\n *\/\n virtual std::vector MakeScripts(const std::vector& pubkeys, const CScript* script, FlatSigningProvider& out) const = 0;\n\npublic:\n DescriptorImpl(std::vector> pubkeys, std::unique_ptr script, const std::string& name) : m_pubkey_args(std::move(pubkeys)), m_name(name), m_subdescriptor_arg(std::move(script)) {}\n\n bool IsSolvable() const override\n {\n if (m_subdescriptor_arg) {\n if (!m_subdescriptor_arg->IsSolvable()) return false;\n }\n return true;\n }\n\n bool IsRange() const final\n {\n for (const auto& pubkey : m_pubkey_args) {\n if (pubkey->IsRange()) return true;\n }\n if (m_subdescriptor_arg) {\n if (m_subdescriptor_arg->IsRange()) return true;\n }\n return false;\n }\n\n bool ToStringHelper(const SigningProvider* arg, std::string& out, bool priv) const\n {\n std::string extra = ToStringExtra();\n size_t pos = extra.size() > 0 ? 1 : 0;\n std::string ret = m_name + \"(\" + extra;\n for (const auto& pubkey : m_pubkey_args) {\n if (pos++) ret += \",\";\n std::string tmp;\n if (priv) {\n if (!pubkey->ToPrivateString(*arg, tmp)) return false;\n } else {\n tmp = pubkey->ToString();\n }\n ret += std::move(tmp);\n }\n if (m_subdescriptor_arg) {\n if (pos++) ret += \",\";\n std::string tmp;\n if (!m_subdescriptor_arg->ToStringHelper(arg, tmp, priv)) return false;\n ret += std::move(tmp);\n }\n out = std::move(ret) + \")\";\n return true;\n }\n\n std::string ToString() const final\n {\n std::string ret;\n ToStringHelper(nullptr, ret, false);\n return AddChecksum(ret);\n }\n\n bool ToPrivateString(const SigningProvider& arg, std::string& out) const override final\n {\n bool ret = ToStringHelper(&arg, out, true);\n out = AddChecksum(out);\n return ret;\n }\n\n bool ExpandHelper(int pos, const SigningProvider& arg, const DescriptorCache* read_cache, std::vector& output_scripts, FlatSigningProvider& out, DescriptorCache* write_cache) const\n {\n std::vector> entries;\n entries.reserve(m_pubkey_args.size());\n\n \/\/ Construct temporary data in `entries` and `subscripts`, to avoid producing output in case of failure.\n for (const auto& p : m_pubkey_args) {\n entries.emplace_back();\n if (!p->GetPubKey(pos, arg, entries.back().first, entries.back().second, read_cache, write_cache)) return false;\n }\n std::vector subscripts;\n if (m_subdescriptor_arg) {\n FlatSigningProvider subprovider;\n if (!m_subdescriptor_arg->ExpandHelper(pos, arg, read_cache, subscripts, subprovider, write_cache)) return false;\n out = Merge(out, subprovider);\n }\n\n std::vector pubkeys;\n pubkeys.reserve(entries.size());\n for (auto& entry : entries) {\n pubkeys.push_back(entry.first);\n out.origins.emplace(entry.first.GetID(), std::make_pair(CPubKey(entry.first), std::move(entry.second)));\n }\n if (m_subdescriptor_arg) {\n for (const auto& subscript : subscripts) {\n out.scripts.emplace(CScriptID(subscript), subscript);\n std::vector addscripts = MakeScripts(pubkeys, &subscript, out);\n for (auto& addscript : addscripts) {\n output_scripts.push_back(std::move(addscript));\n }\n }\n } else {\n output_scripts = MakeScripts(pubkeys, nullptr, out);\n }\n return true;\n }\n\n bool Expand(int pos, const SigningProvider& provider, std::vector& output_scripts, FlatSigningProvider& out, DescriptorCache* write_cache = nullptr) const final\n {\n return ExpandHelper(pos, provider, nullptr, output_scripts, out, write_cache);\n }\n\n bool ExpandFromCache(int pos, const DescriptorCache& read_cache, std::vector& output_scripts, FlatSigningProvider& out) const final\n {\n return ExpandHelper(pos, DUMMY_SIGNING_PROVIDER, &read_cache, output_scripts, out, nullptr);\n }\n\n void ExpandPrivate(int pos, const SigningProvider& provider, FlatSigningProvider& out) const final\n {\n for (const auto& p : m_pubkey_args) {\n CKey key;\n if (!p->GetPrivKey(pos, provider, key)) continue;\n out.keys.emplace(key.GetPubKey().GetID(), key);\n }\n if (m_subdescriptor_arg) {\n FlatSigningProvider subprovider;\n m_subdescriptor_arg->ExpandPrivate(pos, provider, subprovider);\n out = Merge(out, subprovider);\n }\n }\n\n Optional GetOutputType() const override { return nullopt; }\n};\n\n\/** A parsed addr(A) descriptor. *\/\nclass AddressDescriptor final : public DescriptorImpl\n{\n const CTxDestination m_destination;\nprotected:\n std::string ToStringExtra() const override { return EncodeDestination(m_destination); }\n std::vector MakeScripts(const std::vector&, const CScript*, FlatSigningProvider&) const override { return Vector(GetScriptForDestination(m_destination)); }\npublic:\n AddressDescriptor(CTxDestination destination) : DescriptorImpl({}, {}, \"addr\"), m_destination(std::move(destination)) {}\n bool IsSolvable() const final { return false; }\n\n Optional GetOutputType() const override\n {\n switch (m_destination.which()) {\n case 1 \/* PKHash *\/:\n case 2 \/* ScriptHash *\/: return OutputType::LEGACY;\n case 3 \/* WitnessV0ScriptHash *\/:\n case 4 \/* WitnessV0KeyHash *\/:\n case 5 \/* WitnessUnknown *\/: return OutputType::BECH32;\n case 0 \/* CNoDestination *\/:\n default: return nullopt;\n }\n }\n};\n\n\/** A parsed raw(H) descriptor. *\/\nclass RawDescriptor final : public DescriptorImpl\n{\n const CScript m_script;\nprotected:\n std::string ToStringExtra() const override { return HexStr(m_script.begin(), m_script.end()); }\n std::vector MakeScripts(const std::vector&, const CScript*, FlatSigningProvider&) const override { return Vector(m_script); }\npublic:\n RawDescriptor(CScript script) : DescriptorImpl({}, {}, \"raw\"), m_script(std::move(script)) {}\n bool IsSolvable() const final { return false; }\n\n Optional GetOutputType() const override\n {\n CTxDestination dest;\n ExtractDestination(m_script, dest);\n switch (dest.which()) {\n case 1 \/* PKHash *\/:\n case 2 \/* ScriptHash *\/: return OutputType::LEGACY;\n case 3 \/* WitnessV0ScriptHash *\/:\n case 4 \/* WitnessV0KeyHash *\/:\n case 5 \/* WitnessUnknown *\/: return OutputType::BECH32;\n case 0 \/* CNoDestination *\/:\n default: return nullopt;\n }\n }\n};\n\n\/** A parsed pk(P) descriptor. *\/\nclass PKDescriptor final : public DescriptorImpl\n{\nprotected:\n std::vector MakeScripts(const std::vector& keys, const CScript*, FlatSigningProvider&) const override { return Vector(GetScriptForRawPubKey(keys[0])); }\npublic:\n PKDescriptor(std::unique_ptr prov) : DescriptorImpl(Vector(std::move(prov)), {}, \"pk\") {}\n};\n\n\/** A parsed pkh(P) descriptor. *\/\nclass PKHDescriptor final : public DescriptorImpl\n{\nprotected:\n std::vector MakeScripts(const std::vector& keys, const CScript*, FlatSigningProvider& out) const override\n {\n CKeyID id = keys[0].GetID();\n out.pubkeys.emplace(id, keys[0]);\n return Vector(GetScriptForDestination(PKHash(id)));\n }\npublic:\n PKHDescriptor(std::unique_ptr prov) : DescriptorImpl(Vector(std::move(prov)), {}, \"pkh\") {}\n Optional GetOutputType() const override { return OutputType::LEGACY; }\n};\n\n\/** A parsed wpkh(P) descriptor. *\/\nclass WPKHDescriptor final : public DescriptorImpl\n{\nprotected:\n std::vector MakeScripts(const std::vector& keys, const CScript*, FlatSigningProvider& out) const override\n {\n CKeyID id = keys[0].GetID();\n out.pubkeys.emplace(id, keys[0]);\n return Vector(GetScriptForDestination(WitnessV0KeyHash(id)));\n }\npublic:\n WPKHDescriptor(std::unique_ptr prov) : DescriptorImpl(Vector(std::move(prov)), {}, \"wpkh\") {}\n Optional GetOutputType() const override { return OutputType::BECH32; }\n};\n\n\/** A parsed combo(P) descriptor. *\/\nclass ComboDescriptor final : public DescriptorImpl\n{\nprotected:\n std::vector MakeScripts(const std::vector& keys, const CScript*, FlatSigningProvider& out) const override\n {\n std::vector ret;\n CKeyID id = keys[0].GetID();\n out.pubkeys.emplace(id, keys[0]);\n ret.emplace_back(GetScriptForRawPubKey(keys[0])); \/\/ P2PK\n ret.emplace_back(GetScriptForDestination(PKHash(id))); \/\/ P2PKH\n if (keys[0].IsCompressed()) {\n CScript p2wpkh = GetScriptForDestination(WitnessV0KeyHash(id));\n out.scripts.emplace(CScriptID(p2wpkh), p2wpkh);\n ret.emplace_back(p2wpkh);\n ret.emplace_back(GetScriptForDestination(ScriptHash(p2wpkh))); \/\/ P2SH-P2WPKH\n }\n return ret;\n }\npublic:\n ComboDescriptor(std::unique_ptr prov) : DescriptorImpl(Vector(std::move(prov)), {}, \"combo\") {}\n};\n\n\/** A parsed multi(...) or sortedmulti(...) descriptor *\/\nclass MultisigDescriptor final : public DescriptorImpl\n{\n const int m_threshold;\n const bool m_sorted;\nprotected:\n std::string ToStringExtra() const override { return strprintf(\"%i\", m_threshold); }\n std::vector MakeScripts(const std::vector& keys, const CScript*, FlatSigningProvider&) const override {\n if (m_sorted) {\n std::vector sorted_keys(keys);\n std::sort(sorted_keys.begin(), sorted_keys.end());\n return Vector(GetScriptForMultisig(m_threshold, sorted_keys));\n }\n return Vector(GetScriptForMultisig(m_threshold, keys));\n }\npublic:\n MultisigDescriptor(int threshold, std::vector> providers, bool sorted = false) : DescriptorImpl(std::move(providers), {}, sorted ? \"sortedmulti\" : \"multi\"), m_threshold(threshold), m_sorted(sorted) {}\n};\n\n\/** A parsed sh(...) descriptor. *\/\nclass SHDescriptor final : public DescriptorImpl\n{\nprotected:\n std::vector MakeScripts(const std::vector&, const CScript* script, FlatSigningProvider&) const override { return Vector(GetScriptForDestination(ScriptHash(*script))); }\npublic:\n SHDescriptor(std::unique_ptr desc) : DescriptorImpl({}, std::move(desc), \"sh\") {}\n\n Optional GetOutputType() const override\n {\n assert(m_subdescriptor_arg);\n if (m_subdescriptor_arg->GetOutputType() == OutputType::BECH32) return OutputType::P2SH_SEGWIT;\n return OutputType::LEGACY;\n }\n};\n\n\/** A parsed wsh(...) descriptor. *\/\nclass WSHDescriptor final : public DescriptorImpl\n{\nprotected:\n std::vector MakeScripts(const std::vector&, const CScript* script, FlatSigningProvider&) const override { return Vector(GetScriptForDestination(WitnessV0ScriptHash(*script))); }\npublic:\n WSHDescriptor(std::unique_ptr desc) : DescriptorImpl({}, std::move(desc), \"wsh\") {}\n Optional GetOutputType() const override { return OutputType::BECH32; }\n};\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/ Parser \/\/\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nenum class ParseScriptContext {\n TOP,\n P2SH,\n P2WSH,\n};\n\n\/** Parse a key path, being passed a split list of elements (the first element is ignored). *\/\nNODISCARD bool ParseKeyPath(const std::vector>& split, KeyPath& out, std::string& error)\n{\n for (size_t i = 1; i < split.size(); ++i) {\n Span elem = split[i];\n bool hardened = false;\n if (elem.size() > 0 && (elem[elem.size() - 1] == '\\'' || elem[elem.size() - 1] == 'h')) {\n elem = elem.first(elem.size() - 1);\n hardened = true;\n }\n uint32_t p;\n if (!ParseUInt32(std::string(elem.begin(), elem.end()), &p)) {\n error = strprintf(\"Key path value '%s' is not a valid uint32\", std::string(elem.begin(), elem.end()));\n return false;\n } else if (p > 0x7FFFFFFFUL) {\n error = strprintf(\"Key path value %u is out of range\", p);\n return false;\n }\n out.push_back(p | (((uint32_t)hardened) << 31));\n }\n return true;\n}\n\n\/** Parse a public key that excludes origin information. *\/\nstd::unique_ptr ParsePubkeyInner(uint32_t key_exp_index, const Span& sp, bool permit_uncompressed, FlatSigningProvider& out, std::string& error)\n{\n using namespace spanparsing;\n\n auto split = Split(sp, '\/');\n std::string str(split[0].begin(), split[0].end());\n if (str.size() == 0) {\n error = \"No key provided\";\n return nullptr;\n }\n if (split.size() == 1) {\n if (IsHex(str)) {\n std::vector data = ParseHex(str);\n CPubKey pubkey(data);\n if (pubkey.IsFullyValid()) {\n if (permit_uncompressed || pubkey.IsCompressed()) {\n return MakeUnique(key_exp_index, pubkey);\n } else {\n error = \"Uncompressed keys are not allowed\";\n return nullptr;\n }\n }\n error = strprintf(\"Pubkey '%s' is invalid\", str);\n return nullptr;\n }\n CKey key = DecodeSecret(str);\n if (key.IsValid()) {\n if (permit_uncompressed || key.IsCompressed()) {\n CPubKey pubkey = key.GetPubKey();\n out.keys.emplace(pubkey.GetID(), key);\n return MakeUnique(key_exp_index, pubkey);\n } else {\n error = \"Uncompressed keys are not allowed\";\n return nullptr;\n }\n }\n }\n CExtKey extkey = DecodeExtKey(str);\n CExtPubKey extpubkey = DecodeExtPubKey(str);\n if (!extkey.key.IsValid() && !extpubkey.pubkey.IsValid()) {\n error = strprintf(\"key '%s' is not valid\", str);\n return nullptr;\n }\n KeyPath path;\n DeriveType type = DeriveType::NO;\n if (split.back() == MakeSpan(\"*\").first(1)) {\n split.pop_back();\n type = DeriveType::UNHARDENED;\n } else if (split.back() == MakeSpan(\"*'\").first(2) || split.back() == MakeSpan(\"*h\").first(2)) {\n split.pop_back();\n type = DeriveType::HARDENED;\n }\n if (!ParseKeyPath(split, path, error)) return nullptr;\n if (extkey.key.IsValid()) {\n extpubkey = extkey.Neuter();\n out.keys.emplace(extpubkey.pubkey.GetID(), extkey.key);\n }\n return MakeUnique(key_exp_index, extpubkey, std::move(path), type);\n}\n\n\/** Parse a public key including origin information (if enabled). *\/\nstd::unique_ptr ParsePubkey(uint32_t key_exp_index, const Span& sp, bool permit_uncompressed, FlatSigningProvider& out, std::string& error)\n{\n using namespace spanparsing;\n\n auto origin_split = Split(sp, ']');\n if (origin_split.size() > 2) {\n error = \"Multiple ']' characters found for a single pubkey\";\n return nullptr;\n }\n if (origin_split.size() == 1) return ParsePubkeyInner(key_exp_index, origin_split[0], permit_uncompressed, out, error);\n if (origin_split[0].size() < 1 || origin_split[0][0] != '[') {\n error = strprintf(\"Key origin start '[ character expected but not found, got '%c' instead\", origin_split[0][0]);\n return nullptr;\n }\n auto slash_split = Split(origin_split[0].subspan(1), '\/');\n if (slash_split[0].size() != 8) {\n error = strprintf(\"Fingerprint is not 4 bytes (%u characters instead of 8 characters)\", slash_split[0].size());\n return nullptr;\n }\n std::string fpr_hex = std::string(slash_split[0].begin(), slash_split[0].end());\n if (!IsHex(fpr_hex)) {\n error = strprintf(\"Fingerprint '%s' is not hex\", fpr_hex);\n return nullptr;\n }\n auto fpr_bytes = ParseHex(fpr_hex);\n KeyOriginInfo info;\n static_assert(sizeof(info.fingerprint) == 4, \"Fingerprint must be 4 bytes\");\n assert(fpr_bytes.size() == 4);\n std::copy(fpr_bytes.begin(), fpr_bytes.end(), info.fingerprint);\n if (!ParseKeyPath(slash_split, info.path, error)) return nullptr;\n auto provider = ParsePubkeyInner(key_exp_index, origin_split[1], permit_uncompressed, out, error);\n if (!provider) return nullptr;\n return MakeUnique(key_exp_index, std::move(info), std::move(provider));\n}\n\n\/** Parse a script in a particular context. *\/\nstd::unique_ptr ParseScript(uint32_t key_exp_index, Span& sp, ParseScriptContext ctx, FlatSigningProvider& out, std::string& error)\n{\n using namespace spanparsing;\n\n auto expr = Expr(sp);\n bool sorted_multi = false;\n if (Func(\"pk\", expr)) {\n auto pubkey = ParsePubkey(key_exp_index, expr, ctx != ParseScriptContext::P2WSH, out, error);\n if (!pubkey) return nullptr;\n return MakeUnique(std::move(pubkey));\n }\n if (Func(\"pkh\", expr)) {\n auto pubkey = ParsePubkey(key_exp_index, expr, ctx != ParseScriptContext::P2WSH, out, error);\n if (!pubkey) return nullptr;\n return MakeUnique(std::move(pubkey));\n }\n if (ctx == ParseScriptContext::TOP && Func(\"combo\", expr)) {\n auto pubkey = ParsePubkey(key_exp_index, expr, true, out, error);\n if (!pubkey) return nullptr;\n return MakeUnique(std::move(pubkey));\n } else if (ctx != ParseScriptContext::TOP && Func(\"combo\", expr)) {\n error = \"Cannot have combo in non-top level\";\n return nullptr;\n }\n if ((sorted_multi = Func(\"sortedmulti\", expr)) || Func(\"multi\", expr)) {\n auto threshold = Expr(expr);\n uint32_t thres;\n std::vector> providers;\n if (!ParseUInt32(std::string(threshold.begin(), threshold.end()), &thres)) {\n error = strprintf(\"Multi threshold '%s' is not valid\", std::string(threshold.begin(), threshold.end()));\n return nullptr;\n }\n size_t script_size = 0;\n while (expr.size()) {\n if (!Const(\",\", expr)) {\n error = strprintf(\"Multi: expected ',', got '%c'\", expr[0]);\n return nullptr;\n }\n auto arg = Expr(expr);\n auto pk = ParsePubkey(key_exp_index, arg, ctx != ParseScriptContext::P2WSH, out, error);\n if (!pk) return nullptr;\n script_size += pk->GetSize() + 1;\n providers.emplace_back(std::move(pk));\n key_exp_index++;\n }\n if (providers.size() < 1 || providers.size() > 16) {\n error = strprintf(\"Cannot have %u keys in multisig; must have between 1 and 16 keys, inclusive\", providers.size());\n return nullptr;\n } else if (thres < 1) {\n error = strprintf(\"Multisig threshold cannot be %d, must be at least 1\", thres);\n return nullptr;\n } else if (thres > providers.size()) {\n error = strprintf(\"Multisig threshold cannot be larger than the number of keys; threshold is %d but only %u keys specified\", thres, providers.size());\n return nullptr;\n }\n if (ctx == ParseScriptContext::TOP) {\n if (providers.size() > 3) {\n error = strprintf(\"Cannot have %u pubkeys in bare multisig; only at most 3 pubkeys\", providers.size());\n return nullptr;\n }\n }\n if (ctx == ParseScriptContext::P2SH) {\n if (script_size + 3 > MAX_SCRIPT_ELEMENT_SIZE) {\n error = strprintf(\"P2SH script is too large, %d bytes is larger than %d bytes\", script_size + 3, MAX_SCRIPT_ELEMENT_SIZE);\n return nullptr;\n }\n }\n return MakeUnique(thres, std::move(providers), sorted_multi);\n }\n if (ctx != ParseScriptContext::P2WSH && Func(\"wpkh\", expr)) {\n auto pubkey = ParsePubkey(key_exp_index, expr, false, out, error);\n if (!pubkey) return nullptr;\n return MakeUnique(std::move(pubkey));\n } else if (ctx == ParseScriptContext::P2WSH && Func(\"wpkh\", expr)) {\n error = \"Cannot have wpkh within wsh\";\n return nullptr;\n }\n if (ctx == ParseScriptContext::TOP && Func(\"sh\", expr)) {\n auto desc = ParseScript(key_exp_index, expr, ParseScriptContext::P2SH, out, error);\n if (!desc || expr.size()) return nullptr;\n return MakeUnique(std::move(desc));\n } else if (ctx != ParseScriptContext::TOP && Func(\"sh\", expr)) {\n error = \"Cannot have sh in non-top level\";\n return nullptr;\n }\n if (ctx != ParseScriptContext::P2WSH && Func(\"wsh\", expr)) {\n auto desc = ParseScript(key_exp_index, expr, ParseScriptContext::P2WSH, out, error);\n if (!desc || expr.size()) return nullptr;\n return MakeUnique(std::move(desc));\n } else if (ctx == ParseScriptContext::P2WSH && Func(\"wsh\", expr)) {\n error = \"Cannot have wsh within wsh\";\n return nullptr;\n }\n if (ctx == ParseScriptContext::TOP && Func(\"addr\", expr)) {\n CTxDestination dest = DecodeDestination(std::string(expr.begin(), expr.end()));\n if (!IsValidDestination(dest)) {\n error = \"Address is not valid\";\n return nullptr;\n }\n return MakeUnique(std::move(dest));\n }\n if (ctx == ParseScriptContext::TOP && Func(\"raw\", expr)) {\n std::string str(expr.begin(), expr.end());\n if (!IsHex(str)) {\n error = \"Raw script is not hex\";\n return nullptr;\n }\n auto bytes = ParseHex(str);\n return MakeUnique(CScript(bytes.begin(), bytes.end()));\n }\n if (ctx == ParseScriptContext::P2SH) {\n error = \"A function is needed within P2SH\";\n return nullptr;\n } else if (ctx == ParseScriptContext::P2WSH) {\n error = \"A function is needed within P2WSH\";\n return nullptr;\n }\n error = strprintf(\"%s is not a valid descriptor function\", std::string(expr.begin(), expr.end()));\n return nullptr;\n}\n\nstd::unique_ptr InferPubkey(const CPubKey& pubkey, ParseScriptContext, const SigningProvider& provider)\n{\n std::unique_ptr key_provider = MakeUnique(0, pubkey);\n KeyOriginInfo info;\n if (provider.GetKeyOrigin(pubkey.GetID(), info)) {\n return MakeUnique(0, std::move(info), std::move(key_provider));\n }\n return key_provider;\n}\n\nstd::unique_ptr InferScript(const CScript& script, ParseScriptContext ctx, const SigningProvider& provider)\n{\n std::vector> data;\n txnouttype txntype = Solver(script, data);\n\n if (txntype == TX_PUBKEY) {\n CPubKey pubkey(data[0].begin(), data[0].end());\n if (pubkey.IsValid()) {\n return MakeUnique(InferPubkey(pubkey, ctx, provider));\n }\n }\n if (txntype == TX_PUBKEYHASH) {\n uint160 hash(data[0]);\n CKeyID keyid(hash);\n CPubKey pubkey;\n if (provider.GetPubKey(keyid, pubkey)) {\n return MakeUnique(InferPubkey(pubkey, ctx, provider));\n }\n }\n if (txntype == TX_WITNESS_V0_KEYHASH && ctx != ParseScriptContext::P2WSH) {\n uint160 hash(data[0]);\n CKeyID keyid(hash);\n CPubKey pubkey;\n if (provider.GetPubKey(keyid, pubkey)) {\n return MakeUnique(InferPubkey(pubkey, ctx, provider));\n }\n }\n if (txntype == TX_MULTISIG) {\n std::vector> providers;\n for (size_t i = 1; i + 1 < data.size(); ++i) {\n CPubKey pubkey(data[i].begin(), data[i].end());\n providers.push_back(InferPubkey(pubkey, ctx, provider));\n }\n return MakeUnique((int)data[0][0], std::move(providers));\n }\n if (txntype == TX_SCRIPTHASH && ctx == ParseScriptContext::TOP) {\n uint160 hash(data[0]);\n CScriptID scriptid(hash);\n CScript subscript;\n if (provider.GetCScript(scriptid, subscript)) {\n auto sub = InferScript(subscript, ParseScriptContext::P2SH, provider);\n if (sub) return MakeUnique(std::move(sub));\n }\n }\n if (txntype == TX_WITNESS_V0_SCRIPTHASH && ctx != ParseScriptContext::P2WSH) {\n CScriptID scriptid;\n CRIPEMD160().Write(data[0].data(), data[0].size()).Finalize(scriptid.begin());\n CScript subscript;\n if (provider.GetCScript(scriptid, subscript)) {\n auto sub = InferScript(subscript, ParseScriptContext::P2WSH, provider);\n if (sub) return MakeUnique(std::move(sub));\n }\n }\n\n CTxDestination dest;\n if (ExtractDestination(script, dest)) {\n if (GetScriptForDestination(dest) == script) {\n return MakeUnique(std::move(dest));\n }\n }\n\n return MakeUnique(script);\n}\n\n\n} \/\/ namespace\n\n\/** Check a descriptor checksum, and update desc to be the checksum-less part. *\/\nbool CheckChecksum(Span& sp, bool require_checksum, std::string& error, std::string* out_checksum = nullptr)\n{\n using namespace spanparsing;\n\n auto check_split = Split(sp, '#');\n if (check_split.size() > 2) {\n error = \"Multiple '#' symbols\";\n return false;\n }\n if (check_split.size() == 1 && require_checksum){\n error = \"Missing checksum\";\n return false;\n }\n if (check_split.size() == 2) {\n if (check_split[1].size() != 8) {\n error = strprintf(\"Expected 8 character checksum, not %u characters\", check_split[1].size());\n return false;\n }\n }\n auto checksum = DescriptorChecksum(check_split[0]);\n if (checksum.empty()) {\n error = \"Invalid characters in payload\";\n return false;\n }\n if (check_split.size() == 2) {\n if (!std::equal(checksum.begin(), checksum.end(), check_split[1].begin())) {\n error = strprintf(\"Provided checksum '%s' does not match computed checksum '%s'\", std::string(check_split[1].begin(), check_split[1].end()), checksum);\n return false;\n }\n }\n if (out_checksum) *out_checksum = std::move(checksum);\n sp = check_split[0];\n return true;\n}\n\nstd::unique_ptr Parse(const std::string& descriptor, FlatSigningProvider& out, std::string& error, bool require_checksum)\n{\n Span sp(descriptor.data(), descriptor.size());\n if (!CheckChecksum(sp, require_checksum, error)) return nullptr;\n auto ret = ParseScript(0, sp, ParseScriptContext::TOP, out, error);\n if (sp.size() == 0 && ret) return std::unique_ptr(std::move(ret));\n return nullptr;\n}\n\nstd::string GetDescriptorChecksum(const std::string& descriptor)\n{\n std::string ret;\n std::string error;\n Span sp(descriptor.data(), descriptor.size());\n if (!CheckChecksum(sp, false, error, &ret)) return \"\";\n return ret;\n}\n\nstd::unique_ptr InferDescriptor(const CScript& script, const SigningProvider& provider)\n{\n return InferScript(script, ParseScriptContext::TOP, provider);\n}\n\nvoid DescriptorCache::CacheParentExtPubKey(uint32_t key_exp_pos, const CExtPubKey& xpub)\n{\n m_parent_xpubs[key_exp_pos] = xpub;\n}\n\nvoid DescriptorCache::CacheDerivedExtPubKey(uint32_t key_exp_pos, uint32_t der_index, const CExtPubKey& xpub)\n{\n auto& xpubs = m_derived_xpubs[key_exp_pos];\n xpubs[der_index] = xpub;\n}\n\nbool DescriptorCache::GetCachedParentExtPubKey(uint32_t key_exp_pos, CExtPubKey& xpub) const\n{\n const auto& it = m_parent_xpubs.find(key_exp_pos);\n if (it == m_parent_xpubs.end()) return false;\n xpub = it->second;\n return true;\n}\n\nbool DescriptorCache::GetCachedDerivedExtPubKey(uint32_t key_exp_pos, uint32_t der_index, CExtPubKey& xpub) const\n{\n const auto& key_exp_it = m_derived_xpubs.find(key_exp_pos);\n if (key_exp_it == m_derived_xpubs.end()) return false;\n const auto& der_it = key_exp_it->second.find(der_index);\n if (der_it == key_exp_it->second.end()) return false;\n xpub = der_it->second;\n return true;\n}\n\nconst ExtPubKeyMap DescriptorCache::GetCachedParentExtPubKeys() const\n{\n return m_parent_xpubs;\n}\n\nconst std::unordered_map DescriptorCache::GetCachedDerivedExtPubKeys() const\n{\n return m_derived_xpubs;\n}\n","avg_line_length":42.4578947368,"max_line_length":236,"alphanum_fraction":0.6338374447,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":717,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":null,"content":"#include \n\nusing namespace std;\n\nint main(int argc, char const *argv[])\n{\n\n system(\"cls\");\n\nfor (int i = 5; i <= 100; i = i + 5)\n{\n cout << i << endl;\n\n for (int j = 1; j <= 5; j++)\n {\n cout << j << endl;\n\n for (int k = 1; k <= 3; k++)\n {\n cout << k << endl;\n\n if (i == 25){\n break;\n }\n }\n\n if( i == 25){\n break;\n }\n \n }\n \n if( i == 25){\n break;\n }\n}\n\nint i = 5;\nwhile (i <= 100)\n{\n cout << i << endl;\n i = i + 5;\n\nint j = 0;\nwhile (j <= 5)\n{\n if (i == 25){\n break;\n }\n j++;\n}\n\n\n if(i == 25)\n {\n break;\n }\n}\n\n\n return 0;\n}\n","avg_line_length":11.380952381,"max_line_length":39,"alphanum_fraction":0.3179916318,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":5721,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["Apache-2.0"],"max_stars_count":null,"content":"#include \n\n#ifndef INCLUDED___ASSET__flixel_fonts_nokiafc22_ttf\n#include <__ASSET__flixel_fonts_nokiafc22_ttf.h>\n#endif\n#ifndef INCLUDED_haxe_Resource\n#include \n#endif\n#ifndef INCLUDED_haxe_io_Bytes\n#include \n#endif\n#ifndef INCLUDED_lime_text_Font\n#include \n#endif\n\nHX_DEFINE_STACK_FRAME(_hx_pos_b3ea4ee380faf667_307_new,\"__ASSET__flixel_fonts_nokiafc22_ttf\",\"new\",0x22f03f2a,\"__ASSET__flixel_fonts_nokiafc22_ttf.new\",\"lime\/_internal\/macros\/AssetsMacro.hx\",307,0xc651f030)\nHX_LOCAL_STACK_FRAME(_hx_pos_52fc57ab4b28397c_382_boot,\"__ASSET__flixel_fonts_nokiafc22_ttf\",\"boot\",0x67600628,\"__ASSET__flixel_fonts_nokiafc22_ttf.boot\",\"ManifestResources.hx\",382,0xf77aa668)\n\nvoid __ASSET__flixel_fonts_nokiafc22_ttf_obj::__construct(){\n \tHX_STACKFRAME(&_hx_pos_b3ea4ee380faf667_307_new)\nHXLINE( 308)\t\tsuper::__construct(null());\nHXLINE( 310)\t\tthis->_hx___fromBytes(::haxe::Resource_obj::getBytes(::__ASSET__flixel_fonts_nokiafc22_ttf_obj::resourceName));\n \t}\n\nDynamic __ASSET__flixel_fonts_nokiafc22_ttf_obj::__CreateEmpty() { return new __ASSET__flixel_fonts_nokiafc22_ttf_obj; }\n\nvoid *__ASSET__flixel_fonts_nokiafc22_ttf_obj::_hx_vtable = 0;\n\nDynamic __ASSET__flixel_fonts_nokiafc22_ttf_obj::__Create(::hx::DynamicArray inArgs)\n{\n\t::hx::ObjectPtr< __ASSET__flixel_fonts_nokiafc22_ttf_obj > _hx_result = new __ASSET__flixel_fonts_nokiafc22_ttf_obj();\n\t_hx_result->__construct();\n\treturn _hx_result;\n}\n\nbool __ASSET__flixel_fonts_nokiafc22_ttf_obj::_hx_isInstanceOf(int inClassId) {\n\tif (inClassId<=(int)0x40cee131) {\n\t\treturn inClassId==(int)0x00000001 || inClassId==(int)0x40cee131;\n\t} else {\n\t\treturn inClassId==(int)0x453c2778;\n\t}\n}\n\n::String __ASSET__flixel_fonts_nokiafc22_ttf_obj::resourceName;\n\n\n::hx::ObjectPtr< __ASSET__flixel_fonts_nokiafc22_ttf_obj > __ASSET__flixel_fonts_nokiafc22_ttf_obj::__new() {\n\t::hx::ObjectPtr< __ASSET__flixel_fonts_nokiafc22_ttf_obj > __this = new __ASSET__flixel_fonts_nokiafc22_ttf_obj();\n\t__this->__construct();\n\treturn __this;\n}\n\n::hx::ObjectPtr< __ASSET__flixel_fonts_nokiafc22_ttf_obj > __ASSET__flixel_fonts_nokiafc22_ttf_obj::__alloc(::hx::Ctx *_hx_ctx) {\n\t__ASSET__flixel_fonts_nokiafc22_ttf_obj *__this = (__ASSET__flixel_fonts_nokiafc22_ttf_obj*)(::hx::Ctx::alloc(_hx_ctx, sizeof(__ASSET__flixel_fonts_nokiafc22_ttf_obj), true, \"__ASSET__flixel_fonts_nokiafc22_ttf\"));\n\t*(void **)__this = __ASSET__flixel_fonts_nokiafc22_ttf_obj::_hx_vtable;\n\t__this->__construct();\n\treturn __this;\n}\n\n__ASSET__flixel_fonts_nokiafc22_ttf_obj::__ASSET__flixel_fonts_nokiafc22_ttf_obj()\n{\n}\n\nbool __ASSET__flixel_fonts_nokiafc22_ttf_obj::__GetStatic(const ::String &inName, Dynamic &outValue, ::hx::PropertyAccess inCallProp)\n{\n\tswitch(inName.length) {\n\tcase 12:\n\t\tif (HX_FIELD_EQ(inName,\"resourceName\") ) { outValue = ( resourceName ); return true; }\n\t}\n\treturn false;\n}\n\nbool __ASSET__flixel_fonts_nokiafc22_ttf_obj::__SetStatic(const ::String &inName,Dynamic &ioValue,::hx::PropertyAccess inCallProp)\n{\n\tswitch(inName.length) {\n\tcase 12:\n\t\tif (HX_FIELD_EQ(inName,\"resourceName\") ) { resourceName=ioValue.Cast< ::String >(); return true; }\n\t}\n\treturn false;\n}\n\n#ifdef HXCPP_SCRIPTABLE\nstatic ::hx::StorageInfo *__ASSET__flixel_fonts_nokiafc22_ttf_obj_sMemberStorageInfo = 0;\nstatic ::hx::StaticInfo __ASSET__flixel_fonts_nokiafc22_ttf_obj_sStaticStorageInfo[] = {\n\t{::hx::fsString,(void *) &__ASSET__flixel_fonts_nokiafc22_ttf_obj::resourceName,HX_(\"resourceName\",39,7a,62,90)},\n\t{ ::hx::fsUnknown, 0, null()}\n};\n#endif\n\nstatic void __ASSET__flixel_fonts_nokiafc22_ttf_obj_sMarkStatics(HX_MARK_PARAMS) {\n\tHX_MARK_MEMBER_NAME(__ASSET__flixel_fonts_nokiafc22_ttf_obj::resourceName,\"resourceName\");\n};\n\n#ifdef HXCPP_VISIT_ALLOCS\nstatic void __ASSET__flixel_fonts_nokiafc22_ttf_obj_sVisitStatics(HX_VISIT_PARAMS) {\n\tHX_VISIT_MEMBER_NAME(__ASSET__flixel_fonts_nokiafc22_ttf_obj::resourceName,\"resourceName\");\n};\n\n#endif\n\n::hx::Class __ASSET__flixel_fonts_nokiafc22_ttf_obj::__mClass;\n\nstatic ::String __ASSET__flixel_fonts_nokiafc22_ttf_obj_sStaticFields[] = {\n\tHX_(\"resourceName\",39,7a,62,90),\n\t::String(null())\n};\n\nvoid __ASSET__flixel_fonts_nokiafc22_ttf_obj::__register()\n{\n\t__ASSET__flixel_fonts_nokiafc22_ttf_obj _hx_dummy;\n\t__ASSET__flixel_fonts_nokiafc22_ttf_obj::_hx_vtable = *(void **)&_hx_dummy;\n\t::hx::Static(__mClass) = new ::hx::Class_obj();\n\t__mClass->mName = HX_(\"__ASSET__flixel_fonts_nokiafc22_ttf\",38,22,8b,84);\n\t__mClass->mSuper = &super::__SGetClass();\n\t__mClass->mConstructEmpty = &__CreateEmpty;\n\t__mClass->mConstructArgs = &__Create;\n\t__mClass->mGetStaticField = &__ASSET__flixel_fonts_nokiafc22_ttf_obj::__GetStatic;\n\t__mClass->mSetStaticField = &__ASSET__flixel_fonts_nokiafc22_ttf_obj::__SetStatic;\n\t__mClass->mMarkFunc = __ASSET__flixel_fonts_nokiafc22_ttf_obj_sMarkStatics;\n\t__mClass->mStatics = ::hx::Class_obj::dupFunctions(__ASSET__flixel_fonts_nokiafc22_ttf_obj_sStaticFields);\n\t__mClass->mMembers = ::hx::Class_obj::dupFunctions(0 \/* sMemberFields *\/);\n\t__mClass->mCanCast = ::hx::TCanCast< __ASSET__flixel_fonts_nokiafc22_ttf_obj >;\n#ifdef HXCPP_VISIT_ALLOCS\n\t__mClass->mVisitFunc = __ASSET__flixel_fonts_nokiafc22_ttf_obj_sVisitStatics;\n#endif\n#ifdef HXCPP_SCRIPTABLE\n\t__mClass->mMemberStorageInfo = __ASSET__flixel_fonts_nokiafc22_ttf_obj_sMemberStorageInfo;\n#endif\n#ifdef HXCPP_SCRIPTABLE\n\t__mClass->mStaticStorageInfo = __ASSET__flixel_fonts_nokiafc22_ttf_obj_sStaticStorageInfo;\n#endif\n\t::hx::_hx_RegisterClass(__mClass->mName, __mClass);\n}\n\nvoid __ASSET__flixel_fonts_nokiafc22_ttf_obj::__boot()\n{\n{\n \tHX_STACKFRAME(&_hx_pos_52fc57ab4b28397c_382_boot)\nHXDLIN( 382)\t\tresourceName = HX_(\"LIME_font___ASSET__flixel_fonts_nokiafc22_ttf\",32,8e,cf,38);\n \t}\n}\n\n","avg_line_length":40.006993007,"max_line_length":215,"alphanum_fraction":0.8140185282,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":305,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":21.0,"content":"#include \n#include \n\nint main() {\n const std::string str = \"test0159\";\n std::regex re;\n re = std::regex(\"^[a-z]+[0-9]+$\",\n std::regex_constants::extended\n | std::regex_constants::nosubs);\n return std::regex_search(str, re) ? 0 : -1;\n}\n\n","avg_line_length":23.4615384615,"max_line_length":56,"alphanum_fraction":0.5213114754,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":464,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":2.0,"content":"#include \"..\/..\/template.hpp\"\n\npi MinAndMaxAmountToBuyAllCandies(vi candies, int k) {\n sort(candies);\n int n = candies.size(), mini = 0, maxi = 0;\n for(int i = 0, j = n - 1; i <= j; i += 1, j -= k) {\n mini += candies[i];\n }\n for(int i = 0, j = n - 1; i <= j; i += k, j -= 1) {\n maxi += candies[j];\n }\n return {mini, maxi};\n}\n\nint main() { TimeMeasure _;\n cout << MinAndMaxAmountToBuyAllCandies({3,2,1,4}, 2) << '\\n'; \/\/ 3 7\n}\n","avg_line_length":25.7777777778,"max_line_length":72,"alphanum_fraction":0.5,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":2846,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":83.0,"content":"\/*********************************************************\\\n * File: DrawHelpers.cpp *\n *\n * Copyright (C) 2002-2013 The PixelLight Team (http:\/\/www.pixellight.org\/)\n *\n * This file is part of PixelLight.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy of this software\n * and associated documentation files (the \"Software\"), to deal in the Software without\n * restriction, including without limitation the rights to use, copy, modify, merge, publish,\n * distribute, sublicense, and\/or sell copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all copies or\n * substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING\n * BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\n * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\\*********************************************************\/\n\n\n\/\/[-------------------------------------------------------]\n\/\/[ Includes ]\n\/\/[-------------------------------------------------------]\n#include \"PLRenderer\/Renderer\/DrawHelpers.h\"\n\n\n\/\/[-------------------------------------------------------]\n\/\/[ Namespace ]\n\/\/[-------------------------------------------------------]\nnamespace PLRenderer {\n\n\n\/\/[-------------------------------------------------------]\n\/\/[ Protected functions ]\n\/\/[-------------------------------------------------------]\n\/**\n* @brief\n* Constructor\n*\/\nDrawHelpers::DrawHelpers()\n{\n}\n\n\/**\n* @brief\n* Destructor\n*\/\nDrawHelpers::~DrawHelpers()\n{\n}\n\n\n\/\/[-------------------------------------------------------]\n\/\/[ Private functions ]\n\/\/[-------------------------------------------------------]\n\/**\n* @brief\n* Copy constructor\n*\/\nDrawHelpers::DrawHelpers(const DrawHelpers &cSource)\n{\n\t\/\/ No implementation because the copy constructor is never used\n}\n\n\/**\n* @brief\n* Copy operator\n*\/\nDrawHelpers &DrawHelpers::operator =(const DrawHelpers &cSource)\n{\n\t\/\/ No implementation because the copy operator is never used\n\treturn *this;\n}\n\n\n\/\/[-------------------------------------------------------]\n\/\/[ Namespace ]\n\/\/[-------------------------------------------------------]\n} \/\/ PLRenderer\n","avg_line_length":33.880952381,"max_line_length":97,"alphanum_fraction":0.4820801124,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":226,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":1.0,"content":"\/\/ Copyright 1998-2017 Epic Games, Inc. All Rights Reserved.\n\n#include \"TP_2DSideScroller.h\"\n#include \"Modules\/ModuleManager.h\"\n\nIMPLEMENT_PRIMARY_GAME_MODULE( FDefaultGameModuleImpl, TP_2DSideScroller, \"TP_2DSideScroller\" );\n","avg_line_length":32.2857142857,"max_line_length":96,"alphanum_fraction":0.814159292,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":7565,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["BSD-3-Clause"],"max_stars_count":3.0,"content":"\/*\n * Copyright (c) 2011. Philipp Wagner .\n * Released to public domain under terms of the BSD Simplified license.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * * Neither the name of the organization nor the names of its contributors\n * may be used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * See \n *\/\n\n#include \"opencv2\/core.hpp\"\n#include \"opencv2\/contrib.hpp\"\n#include \"opencv2\/highgui.hpp\"\n\n#include \n#include \n#include \n\nusing namespace cv;\nusing namespace std;\n\nstatic Mat norm_0_255(InputArray _src) {\n Mat src = _src.getMat();\n \/\/ Create and return normalized image:\n Mat dst;\n switch(src.channels()) {\n case 1:\n cv::normalize(_src, dst, 0, 255, NORM_MINMAX, CV_8UC1);\n break;\n case 3:\n cv::normalize(_src, dst, 0, 255, NORM_MINMAX, CV_8UC3);\n break;\n default:\n src.copyTo(dst);\n break;\n }\n return dst;\n}\n\nstatic void read_csv(const string& filename, vector& images, vector& labels, char separator = ';') {\n std::ifstream file(filename.c_str(), ifstream::in);\n if (!file) {\n string error_message = \"No valid input file was given, please check the given filename.\";\n CV_Error(CV_StsBadArg, error_message);\n }\n string line, path, classlabel;\n while (getline(file, line)) {\n stringstream liness(line);\n getline(liness, path, separator);\n getline(liness, classlabel);\n if(!path.empty() && !classlabel.empty()) {\n images.push_back(imread(path, 0));\n labels.push_back(atoi(classlabel.c_str()));\n }\n }\n}\n\nint main(int argc, const char *argv[]) {\n \/\/ Check for valid command line arguments, print usage\n \/\/ if no arguments were given.\n if (argc < 2) {\n cout << \"usage: \" << argv[0] << \" \" << endl;\n exit(1);\n }\n string output_folder = \".\";\n if (argc == 3) {\n output_folder = string(argv[2]);\n }\n \/\/ Get the path to your CSV.\n string fn_csv = string(argv[1]);\n \/\/ These vectors hold the images and corresponding labels.\n vector images;\n vector labels;\n \/\/ Read in the data. This can fail if no valid\n \/\/ input filename is given.\n try {\n read_csv(fn_csv, images, labels);\n } catch (cv::Exception& e) {\n cerr << \"Error opening file \\\"\" << fn_csv << \"\\\". Reason: \" << e.msg << endl;\n \/\/ nothing more we can do\n exit(1);\n }\n \/\/ Quit if there are not enough images for this demo.\n if(images.size() <= 1) {\n string error_message = \"This demo needs at least 2 images to work. Please add more images to your data set!\";\n CV_Error(CV_StsError, error_message);\n }\n \/\/ Get the height from the first image. We'll need this\n \/\/ later in code to reshape the images to their original\n \/\/ size:\n int height = images[0].rows;\n \/\/ The following lines simply get the last images from\n \/\/ your dataset and remove it from the vector. This is\n \/\/ done, so that the training data (which we learn the\n \/\/ cv::FaceRecognizer on) and the test data we test\n \/\/ the model with, do not overlap.\n Mat testSample = images[images.size() - 1];\n int testLabel = labels[labels.size() - 1];\n images.pop_back();\n labels.pop_back();\n \/\/ The following lines create an Eigenfaces model for\n \/\/ face recognition and train it with the images and\n \/\/ labels read from the given CSV file.\n \/\/ This here is a full PCA, if you just want to keep\n \/\/ 10 principal components (read Eigenfaces), then call\n \/\/ the factory method like this:\n \/\/\n \/\/ cv::createEigenFaceRecognizer(10);\n \/\/\n \/\/ If you want to create a FaceRecognizer with a\n \/\/ confidence threshold (e.g. 123.0), call it with:\n \/\/\n \/\/ cv::createEigenFaceRecognizer(10, 123.0);\n \/\/\n \/\/ If you want to use _all_ Eigenfaces and have a threshold,\n \/\/ then call the method like this:\n \/\/\n \/\/ cv::createEigenFaceRecognizer(0, 123.0);\n \/\/\n Ptr model = createEigenFaceRecognizer();\n model->train(images, labels);\n \/\/ The following line predicts the label of a given\n \/\/ test image:\n int predictedLabel = model->predict(testSample);\n \/\/\n \/\/ To get the confidence of a prediction call the model with:\n \/\/\n \/\/ int predictedLabel = -1;\n \/\/ double confidence = 0.0;\n \/\/ model->predict(testSample, predictedLabel, confidence);\n \/\/\n string result_message = format(\"Predicted class = %d \/ Actual class = %d.\", predictedLabel, testLabel);\n cout << result_message << endl;\n \/\/ Here is how to get the eigenvalues of this Eigenfaces model:\n Mat eigenvalues = model->getMat(\"eigenvalues\");\n \/\/ And we can do the same to display the Eigenvectors (read Eigenfaces):\n Mat W = model->getMat(\"eigenvectors\");\n \/\/ Get the sample mean from the training data\n Mat mean = model->getMat(\"mean\");\n \/\/ Display or save:\n if(argc == 2) {\n imshow(\"mean\", norm_0_255(mean.reshape(1, images[0].rows)));\n } else {\n imwrite(format(\"%s\/mean.png\", output_folder.c_str()), norm_0_255(mean.reshape(1, images[0].rows)));\n }\n \/\/ Display or save the Eigenfaces:\n for (int i = 0; i < min(10, W.cols); i++) {\n string msg = format(\"Eigenvalue #%d = %.5f\", i, eigenvalues.at(i));\n cout << msg << endl;\n \/\/ get eigenvector #i\n Mat ev = W.col(i).clone();\n \/\/ Reshape to original size & normalize to [0...255] for imshow.\n Mat grayscale = norm_0_255(ev.reshape(1, height));\n \/\/ Show the image & apply a Jet colormap for better sensing.\n Mat cgrayscale;\n applyColorMap(grayscale, cgrayscale, COLORMAP_JET);\n \/\/ Display or save:\n if(argc == 2) {\n imshow(format(\"eigenface_%d\", i), cgrayscale);\n } else {\n imwrite(format(\"%s\/eigenface_%d.png\", output_folder.c_str(), i), norm_0_255(cgrayscale));\n }\n }\n\n \/\/ Display or save the image reconstruction at some predefined steps:\n for(int num_components = min(W.cols, 10); num_components < min(W.cols, 300); num_components+=15) {\n \/\/ slice the eigenvectors from the model\n Mat evs = Mat(W, Range::all(), Range(0, num_components));\n Mat projection = subspaceProject(evs, mean, images[0].reshape(1,1));\n Mat reconstruction = subspaceReconstruct(evs, mean, projection);\n \/\/ Normalize the result:\n reconstruction = norm_0_255(reconstruction.reshape(1, images[0].rows));\n \/\/ Display or save:\n if(argc == 2) {\n imshow(format(\"eigenface_reconstruction_%d\", num_components), reconstruction);\n } else {\n imwrite(format(\"%s\/eigenface_reconstruction_%d.png\", output_folder.c_str(), num_components), reconstruction);\n }\n }\n \/\/ Display if we are not writing to an output folder:\n if(argc == 2) {\n waitKey(0);\n }\n return 0;\n}\n","avg_line_length":38.9948453608,"max_line_length":121,"alphanum_fraction":0.6329147389,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":1159,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["BSD-2-Clause"],"max_stars_count":26.0,"content":"#include \"m1UndoRedo.h\"\n#include \"Core\/Application.h\"\n#include \"Modules\/m1Input.h\"\n\n#include \"Tools\/Command.h\"\n\n#include \"Tools\/System\/Logger.h\"\n\nm1UndoRedo::m1UndoRedo() : Module(\"UndoRedo\", true)\n{\n}\n\nvoid m1UndoRedo::AddCommand(Command* command)\n{\n\tif (iterator != commands.size() - 1 && iterator != -1)\n\t{\n\t\tfor (int i = iterator + 1; i < commands.size(); ++i)\n\t\t{\n\t\t\tdelete commands[i];\n\t\t}\n\t\tcommands.erase(commands.begin() + iterator + 1, commands.end());\n\t}\n\n\tcommands.push_back(command);\n\n\titerator = commands.size() - 1;\n}\n\nUpdateStatus m1UndoRedo::Update()\n{\n\tif (App->input->IsKeyPressed(SDL_SCANCODE_LCTRL) && App->input->IsKeyDown(SDL_SCANCODE_Z) && iterator >= 0 &&\n\t\titerator < commands.size())\n\t{\n\t\tcommands[iterator]->Undo();\n\t\titerator += iterator > 0 ? -1 : 1;\n\t}\n\tif (App->input->IsKeyPressed(SDL_SCANCODE_LCTRL) && App->input->IsKeyDown(SDL_SCANCODE_Y) && iterator >= 0 && iterator < commands.size())\n\t{\n\t\tcommands[iterator]->Redo();\n\t\titerator += iterator < commands.size() - 1 ? 1 : -1;\n\t}\n\n\treturn UpdateStatus::UPDATE_CONTINUE;\n}\n\nbool m1UndoRedo::CleanUp()\n{\n\tfor (auto& command : commands)\n\t{\n\t\tdelete command;\n\t}\n\n\treturn true;\n}\n","avg_line_length":21.0727272727,"max_line_length":138,"alphanum_fraction":0.6635030198,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":1984,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["Apache-2.0"],"max_stars_count":2.0,"content":"\ufeff\/*\n* Copyright 2010-2017 Amazon.com, Inc. or its affiliates. All Rights Reserved.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\").\n* You may not use this file except in compliance with the License.\n* A copy of the License is located at\n*\n* http:\/\/aws.amazon.com\/apache2.0\n*\n* or in the \"license\" file accompanying this file. This file is distributed\n* on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either\n* express or implied. See the License for the specific language governing\n* permissions and limitations under the License.\n*\/\n\n#include \n#include \n#include \n#include \n\n#include \n\nusing namespace Aws::Utils::Xml;\nusing namespace Aws::Utils;\n\nnamespace Aws\n{\nnamespace SES\n{\nnamespace Model\n{\n\nConfigurationSet::ConfigurationSet() : \n m_nameHasBeenSet(false)\n{\n}\n\nConfigurationSet::ConfigurationSet(const XmlNode& xmlNode) : \n m_nameHasBeenSet(false)\n{\n *this = xmlNode;\n}\n\nConfigurationSet& ConfigurationSet::operator =(const XmlNode& xmlNode)\n{\n XmlNode resultNode = xmlNode;\n\n if(!resultNode.IsNull())\n {\n XmlNode nameNode = resultNode.FirstChild(\"Name\");\n if(!nameNode.IsNull())\n {\n m_name = StringUtils::Trim(nameNode.GetText().c_str());\n m_nameHasBeenSet = true;\n }\n }\n\n return *this;\n}\n\nvoid ConfigurationSet::OutputToStream(Aws::OStream& oStream, const char* location, unsigned index, const char* locationValue) const\n{\n if(m_nameHasBeenSet)\n {\n oStream << location << index << locationValue << \".Name=\" << StringUtils::URLEncode(m_name.c_str()) << \"&\";\n }\n\n}\n\nvoid ConfigurationSet::OutputToStream(Aws::OStream& oStream, const char* location) const\n{\n if(m_nameHasBeenSet)\n {\n oStream << location << \".Name=\" << StringUtils::URLEncode(m_name.c_str()) << \"&\";\n }\n}\n\n} \/\/ namespace Model\n} \/\/ namespace SES\n} \/\/ namespace Aws\n","avg_line_length":24.4938271605,"max_line_length":131,"alphanum_fraction":0.7116935484,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":23230,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":1.0,"content":"\/* -----------------------------------------------------------------------\n * GGPO.net (http:\/\/ggpo.net) - Copyright 2009 GroundStorm Studios, LLC.\n *\n * Use of this software is governed by the MIT license that can be found\n * in the LICENSE file.\n *\/\n\n#include \"types.h\"\n#include \"udp_proto.h\"\n#include \"bitvector.h\"\n\nstatic const int UDP_HEADER_SIZE = 28; \/* Size of IP + UDP headers *\/\nstatic const int NUM_SYNC_PACKETS = 5;\nstatic const int SYNC_RETRY_INTERVAL = 2000;\nstatic const int SYNC_FIRST_RETRY_INTERVAL = 500;\nstatic const int RUNNING_RETRY_INTERVAL = 200;\nstatic const int KEEP_ALIVE_INTERVAL = 200;\nstatic const int QUALITY_REPORT_INTERVAL = 1000;\nstatic const int NETWORK_STATS_INTERVAL = 1000;\nstatic const int UDP_SHUTDOWN_TIMER = 5000;\nstatic const int MAX_SEQ_DISTANCE = (1 << 15);\n\nUdpProtocol::UdpProtocol() :\n _local_frame_advantage(0),\n _remote_frame_advantage(0),\n _queue(-1),\n _magic_number(0),\n _remote_magic_number(0),\n _packets_sent(0),\n _bytes_sent(0),\n _stats_start_time(0),\n _last_send_time(0),\n _shutdown_timeout(0),\n _disconnect_timeout(0),\n _disconnect_notify_start(0),\n _disconnect_notify_sent(false),\n _disconnect_event_sent(false),\n _connected(false),\n _next_send_seq(0),\n _next_recv_seq(0),\n _udp(NULL)\n{\n _last_sent_input.init(-1, NULL, 1);\n _last_received_input.init(-1, NULL, 1);\n _last_acked_input.init(-1, NULL, 1);\n\n memset(&_state, 0, sizeof _state);\n memset(_peer_connect_status, 0, sizeof(_peer_connect_status));\n for (int i = 0; i < ARRAY_SIZE(_peer_connect_status); i++) {\n _peer_connect_status[i].last_frame = -1;\n }\n memset(&_peer_addr, 0, sizeof _peer_addr);\n _oo_packet.msg = NULL;\n\n _send_latency = Platform::GetConfigInt(\"ggpo.network.delay\");\n _oop_percent = Platform::GetConfigInt(\"ggpo.oop.percent\");\n}\n\nUdpProtocol::~UdpProtocol()\n{\n ClearSendQueue();\n}\n\nvoid\nUdpProtocol::Init(Udp *udp,\n Poll &poll,\n int queue,\n char *ip,\n u_short port,\n UdpMsg::connect_status *status)\n{ \n _udp = udp;\n _queue = queue;\n _local_connect_status = status;\n\n _peer_addr.sin_family = AF_INET;\n _peer_addr.sin_port = htons(port);\n inet_pton(AF_INET, ip, &_peer_addr.sin_addr.s_addr);\n\n do {\n _magic_number = (uint16)rand();\n } while (_magic_number == 0);\n poll.RegisterLoop(this);\n}\n\nvoid\nUdpProtocol::SendInput(GameInput &input)\n{\n if (_udp) {\n if (_current_state == Running) {\n \/*\n * Check to see if this is a good time to adjust for the rift...\n *\/\n _timesync.advance_frame(input, _local_frame_advantage, _remote_frame_advantage);\n\n \/*\n * Save this input packet\n *\n * XXX: This queue may fill up for spectators who do not ack input packets in a timely\n * manner. When this happens, we can either resize the queue (ug) or disconnect them\n * (better, but still ug). For the meantime, make this queue really big to decrease\n * the odds of this happening...\n *\/\n _pending_output.push(input);\n }\n SendPendingOutput();\n } \n}\n\nvoid\nUdpProtocol::SendPendingOutput()\n{\n UdpMsg *msg = new UdpMsg(UdpMsg::Input);\n int i, j, offset = 0;\n uint8 *bits;\n GameInput last;\n\n if (_pending_output.size()) {\n last = _last_acked_input;\n bits = msg->u.input.bits;\n\n msg->u.input.start_frame = _pending_output.front().frame;\n msg->u.input.input_size = (uint8)_pending_output.front().size;\n\n ASSERT(last.frame == -1 || last.frame + 1 == msg->u.input.start_frame);\n for (j = 0; j < _pending_output.size(); j++) {\n GameInput ¤t = _pending_output.item(j);\n if (memcmp(current.bits, last.bits, current.size) != 0) {\n ASSERT((GAMEINPUT_MAX_BYTES * GAMEINPUT_MAX_PLAYERS * 8) < (1 << BITVECTOR_NIBBLE_SIZE));\n for (i = 0; i < current.size * 8; i++) {\n ASSERT(i < (1 << BITVECTOR_NIBBLE_SIZE));\n if (current.value(i) != last.value(i)) {\n BitVector_SetBit(msg->u.input.bits, &offset);\n (current.value(i) ? BitVector_SetBit : BitVector_ClearBit)(bits, &offset);\n BitVector_WriteNibblet(bits, i, &offset);\n }\n }\n }\n BitVector_ClearBit(msg->u.input.bits, &offset);\n last = _last_sent_input = current;\n }\n } else {\n msg->u.input.start_frame = 0;\n msg->u.input.input_size = 0;\n }\n msg->u.input.ack_frame = _last_received_input.frame;\n msg->u.input.num_bits = (uint16)offset;\n\n msg->u.input.disconnect_requested = _current_state == Disconnected;\n if (_local_connect_status) {\n memcpy(msg->u.input.peer_connect_status, _local_connect_status, sizeof(UdpMsg::connect_status) * UDP_MSG_MAX_PLAYERS);\n } else {\n memset(msg->u.input.peer_connect_status, 0, sizeof(UdpMsg::connect_status) * UDP_MSG_MAX_PLAYERS);\n }\n\n ASSERT(offset < MAX_COMPRESSED_BITS);\n\n SendMsg(msg);\n}\n\nvoid\nUdpProtocol::SendInputAck()\n{\n UdpMsg *msg = new UdpMsg(UdpMsg::InputAck);\n msg->u.input_ack.ack_frame = _last_received_input.frame;\n SendMsg(msg);\n}\n\nbool\nUdpProtocol::GetEvent(UdpProtocol::Event &e)\n{\n if (_event_queue.size() == 0) {\n return false;\n }\n e = _event_queue.front();\n _event_queue.pop();\n return true;\n}\n\n\nbool\nUdpProtocol::OnLoopPoll(void *cookie)\n{\n if (!_udp) {\n return true;\n }\n\n unsigned int now = Platform::GetCurrentTimeMS();\n unsigned int next_interval;\n\n PumpSendQueue();\n switch (_current_state) {\n case Syncing:\n next_interval = (_state.sync.roundtrips_remaining == NUM_SYNC_PACKETS) ? SYNC_FIRST_RETRY_INTERVAL : SYNC_RETRY_INTERVAL;\n if (_last_send_time && _last_send_time + next_interval < now) {\n Log(\"No luck syncing after %d ms... Re-queueing sync packet.\\n\", next_interval);\n SendSyncRequest();\n }\n break;\n\n case Running:\n \/\/ xxx: rig all this up with a timer wrapper\n if (!_state.running.last_input_packet_recv_time || _state.running.last_input_packet_recv_time + RUNNING_RETRY_INTERVAL < now) {\n Log(\"Haven't exchanged packets in a while (last received:%d last sent:%d). Resending.\\n\", _last_received_input.frame, _last_sent_input.frame);\n SendPendingOutput();\n _state.running.last_input_packet_recv_time = now;\n }\n\n if (!_state.running.last_quality_report_time || _state.running.last_quality_report_time + QUALITY_REPORT_INTERVAL < now) {\n UdpMsg *msg = new UdpMsg(UdpMsg::QualityReport);\n msg->u.quality_report.ping = Platform::GetCurrentTimeMS();\n msg->u.quality_report.frame_advantage = (uint8)_local_frame_advantage;\n SendMsg(msg);\n _state.running.last_quality_report_time = now;\n }\n\n if (!_state.running.last_network_stats_interval || _state.running.last_network_stats_interval + NETWORK_STATS_INTERVAL < now) {\n UpdateNetworkStats();\n _state.running.last_network_stats_interval = now;\n }\n\n if (_last_send_time && _last_send_time + KEEP_ALIVE_INTERVAL < now) {\n Log(\"Sending keep alive packet\\n\");\n SendMsg(new UdpMsg(UdpMsg::KeepAlive));\n }\n\n if (_disconnect_timeout && _disconnect_notify_start && \n !_disconnect_notify_sent && (_last_recv_time + _disconnect_notify_start < now)) {\n Log(\"Endpoint has stopped receiving packets for %d ms. Sending notification.\\n\", _disconnect_notify_start);\n Event e(Event::NetworkInterrupted);\n e.u.network_interrupted.disconnect_timeout = _disconnect_timeout - _disconnect_notify_start;\n QueueEvent(e);\n _disconnect_notify_sent = true;\n }\n\n if (_disconnect_timeout && (_last_recv_time + _disconnect_timeout < now)) {\n if (!_disconnect_event_sent) {\n Log(\"Endpoint has stopped receiving packets for %d ms. Disconnecting.\\n\", _disconnect_timeout);\n QueueEvent(Event(Event::Disconnected));\n _disconnect_event_sent = true;\n }\n }\n break;\n\n case Disconnected:\n if (_shutdown_timeout < now) {\n Log(\"Shutting down udp connection.\\n\");\n _udp = NULL;\n _shutdown_timeout = 0;\n }\n\n }\n\n\n return true;\n}\n\nvoid\nUdpProtocol::Disconnect()\n{\n _current_state = Disconnected;\n _shutdown_timeout = Platform::GetCurrentTimeMS() + UDP_SHUTDOWN_TIMER;\n}\n\nvoid\nUdpProtocol::SendSyncRequest()\n{\n _state.sync.random = rand() & 0xFFFF;\n UdpMsg *msg = new UdpMsg(UdpMsg::SyncRequest);\n msg->u.sync_request.random_request = _state.sync.random;\n SendMsg(msg);\n}\n\nvoid\nUdpProtocol::SendMsg(UdpMsg *msg)\n{\n LogMsg(\"send\", msg);\n\n _packets_sent++;\n _last_send_time = Platform::GetCurrentTimeMS();\n _bytes_sent += msg->PacketSize();\n\n msg->hdr.magic = _magic_number;\n msg->hdr.sequence_number = _next_send_seq++;\n\n _send_queue.push(QueueEntry(Platform::GetCurrentTimeMS(), _peer_addr, msg));\n PumpSendQueue();\n}\n\nbool\nUdpProtocol::HandlesMsg(sockaddr_in &from,\n UdpMsg *msg)\n{\n if (!_udp) {\n return false;\n }\n return _peer_addr.sin_addr.s_addr == from.sin_addr.s_addr &&\n _peer_addr.sin_port == from.sin_port;\n}\n\nvoid\nUdpProtocol::OnMsg(UdpMsg *msg, int len)\n{\n bool handled = false;\n typedef bool (UdpProtocol::*DispatchFn)(UdpMsg *msg, int len);\n static const DispatchFn table[] = {\n &UdpProtocol::OnInvalid, \/* Invalid *\/\n &UdpProtocol::OnSyncRequest, \/* SyncRequest *\/\n &UdpProtocol::OnSyncReply, \/* SyncReply *\/\n &UdpProtocol::OnInput, \/* Input *\/\n &UdpProtocol::OnQualityReport, \/* QualityReport *\/\n &UdpProtocol::OnQualityReply, \/* QualityReply *\/\n &UdpProtocol::OnKeepAlive, \/* KeepAlive *\/\n &UdpProtocol::OnInputAck, \/* InputAck *\/\n };\n\n \/\/ filter out messages that don't match what we expect\n uint16 seq = msg->hdr.sequence_number;\n if (msg->hdr.type != UdpMsg::SyncRequest &&\n msg->hdr.type != UdpMsg::SyncReply) {\n if (msg->hdr.magic != _remote_magic_number) {\n LogMsg(\"recv rejecting\", msg);\n return;\n }\n\n \/\/ filter out out-of-order packets\n uint16 skipped = (uint16)((int)seq - (int)_next_recv_seq);\n \/\/ Log(\"checking sequence number -> next - seq : %d - %d = %d\\n\", seq, _next_recv_seq, skipped);\n if (skipped > MAX_SEQ_DISTANCE) {\n Log(\"dropping out of order packet (seq: %d, last seq:%d)\\n\", seq, _next_recv_seq);\n return;\n }\n }\n\n _next_recv_seq = seq;\n LogMsg(\"recv\", msg);\n if (msg->hdr.type >= ARRAY_SIZE(table)) {\n OnInvalid(msg, len);\n } else {\n handled = (this->*(table[msg->hdr.type]))(msg, len);\n }\n if (handled) {\n _last_recv_time = Platform::GetCurrentTimeMS();\n if (_disconnect_notify_sent && _current_state == Running) {\n QueueEvent(Event(Event::NetworkResumed)); \n _disconnect_notify_sent = false;\n }\n }\n}\n\nvoid\nUdpProtocol::UpdateNetworkStats(void)\n{\n int now = Platform::GetCurrentTimeMS();\n\n if (_stats_start_time == 0) {\n _stats_start_time = now;\n }\n\n int total_bytes_sent = _bytes_sent + (UDP_HEADER_SIZE * _packets_sent);\n float seconds = (float)((now - _stats_start_time) \/ 1000.0);\n float Bps = total_bytes_sent \/ seconds;\n float udp_overhead = (float)(100.0 * (UDP_HEADER_SIZE * _packets_sent) \/ _bytes_sent);\n\n _kbps_sent = int(Bps \/ 1024);\n\n Log(\"Network Stats -- Bandwidth: %.2f KBps Packets Sent: %5d (%.2f pps) \"\n \"KB Sent: %.2f UDP Overhead: %.2f %%.\\n\",\n _kbps_sent, \n _packets_sent,\n (float)_packets_sent * 1000 \/ (now - _stats_start_time),\n total_bytes_sent \/ 1024.0,\n udp_overhead);\n}\n\n\nvoid\nUdpProtocol::QueueEvent(const UdpProtocol::Event &evt)\n{\n LogEvent(\"Queuing event\", evt);\n _event_queue.push(evt);\n}\n\nvoid\nUdpProtocol::Synchronize()\n{\n if (_udp) {\n _current_state = Syncing;\n _state.sync.roundtrips_remaining = NUM_SYNC_PACKETS;\n SendSyncRequest();\n }\n}\n\nbool\nUdpProtocol::GetPeerConnectStatus(int id, int *frame)\n{\n *frame = _peer_connect_status[id].last_frame;\n return !_peer_connect_status[id].disconnected;\n}\n\nvoid\nUdpProtocol::Log(const char *fmt, ...)\n{\n char buf[1024];\n size_t offset;\n va_list args;\n\n sprintf_s(buf, ARRAY_SIZE(buf), \"udpproto%d | \", _queue);\n offset = strlen(buf);\n va_start(args, fmt);\n vsnprintf(buf + offset, ARRAY_SIZE(buf) - offset - 1, fmt, args);\n buf[ARRAY_SIZE(buf)-1] = '\\0';\n ::Log(buf);\n va_end(args);\n}\n\nvoid\nUdpProtocol::LogMsg(const char *prefix, UdpMsg *msg)\n{\n switch (msg->hdr.type) {\n case UdpMsg::SyncRequest:\n Log(\"%s sync-request (%d).\\n\", prefix,\n msg->u.sync_request.random_request);\n break;\n case UdpMsg::SyncReply:\n Log(\"%s sync-reply (%d).\\n\", prefix,\n msg->u.sync_reply.random_reply);\n break;\n case UdpMsg::QualityReport:\n Log(\"%s quality report.\\n\", prefix);\n break;\n case UdpMsg::QualityReply:\n Log(\"%s quality reply.\\n\", prefix);\n break;\n case UdpMsg::KeepAlive:\n Log(\"%s keep alive.\\n\", prefix);\n break;\n case UdpMsg::Input:\n Log(\"%s game-compressed-input %d (+ %d bits).\\n\", prefix, msg->u.input.start_frame, msg->u.input.num_bits);\n break;\n case UdpMsg::InputAck:\n Log(\"%s input ack.\\n\", prefix);\n break;\n default:\n ASSERT(FALSE && \"Unknown UdpMsg type.\");\n }\n}\n\nvoid\nUdpProtocol::LogEvent(const char *prefix, const UdpProtocol::Event &evt)\n{\n switch (evt.type) {\n case UdpProtocol::Event::Synchronzied:\n Log(\"%s (event: Synchronzied).\\n\", prefix);\n break;\n }\n}\n\nbool\nUdpProtocol::OnInvalid(UdpMsg *msg, int len)\n{\n ASSERT(FALSE && \"Invalid msg in UdpProtocol\");\n return false;\n}\n\nbool\nUdpProtocol::OnSyncRequest(UdpMsg *msg, int len)\n{\n if (_remote_magic_number != 0 && msg->hdr.magic != _remote_magic_number) {\n Log(\"Ignoring sync request from unknown endpoint (%d != %d).\\n\", \n msg->hdr.magic, _remote_magic_number);\n return false;\n }\n UdpMsg *reply = new UdpMsg(UdpMsg::SyncReply);\n reply->u.sync_reply.random_reply = msg->u.sync_request.random_request;\n SendMsg(reply);\n return true;\n}\n\nbool\nUdpProtocol::OnSyncReply(UdpMsg *msg, int len)\n{\n if (_current_state != Syncing) {\n Log(\"Ignoring SyncReply while not synching.\\n\");\n return msg->hdr.magic == _remote_magic_number;\n }\n\n if (msg->u.sync_reply.random_reply != _state.sync.random) {\n Log(\"sync reply %d != %d. Keep looking...\\n\",\n msg->u.sync_reply.random_reply, _state.sync.random);\n return false;\n }\n\n if (!_connected) {\n QueueEvent(Event(Event::Connected));\n _connected = true;\n }\n\n Log(\"Checking sync state (%d round trips remaining).\\n\", _state.sync.roundtrips_remaining);\n if (--_state.sync.roundtrips_remaining == 0) {\n Log(\"Synchronized!\\n\");\n QueueEvent(UdpProtocol::Event(UdpProtocol::Event::Synchronzied));\n _current_state = Running;\n _last_received_input.frame = -1;\n _remote_magic_number = msg->hdr.magic;\n } else {\n UdpProtocol::Event evt(UdpProtocol::Event::Synchronizing);\n evt.u.synchronizing.total = NUM_SYNC_PACKETS;\n evt.u.synchronizing.count = NUM_SYNC_PACKETS - _state.sync.roundtrips_remaining;\n QueueEvent(evt);\n SendSyncRequest();\n }\n return true;\n}\n\nbool\nUdpProtocol::OnInput(UdpMsg *msg, int len)\n{\n \/*\n * If a disconnect is requested, go ahead and disconnect now.\n *\/\n bool disconnect_requested = msg->u.input.disconnect_requested;\n if (disconnect_requested) {\n if (_current_state != Disconnected && !_disconnect_event_sent) {\n Log(\"Disconnecting endpoint on remote request.\\n\");\n QueueEvent(Event(Event::Disconnected));\n _disconnect_event_sent = true;\n }\n } else {\n \/*\n * Update the peer connection status if this peer is still considered to be part\n * of the network.\n *\/\n UdpMsg::connect_status* remote_status = msg->u.input.peer_connect_status;\n for (int i = 0; i < ARRAY_SIZE(_peer_connect_status); i++) {\n ASSERT(remote_status[i].last_frame >= _peer_connect_status[i].last_frame);\n _peer_connect_status[i].disconnected = _peer_connect_status[i].disconnected || remote_status[i].disconnected;\n _peer_connect_status[i].last_frame = MAX(_peer_connect_status[i].last_frame, remote_status[i].last_frame);\n }\n }\n\n \/*\n * Decompress the input.\n *\/\n int last_received_frame_number = _last_received_input.frame;\n if (msg->u.input.num_bits) {\n int offset = 0;\n uint8 *bits = (uint8 *)msg->u.input.bits;\n int numBits = msg->u.input.num_bits;\n int currentFrame = msg->u.input.start_frame;\n\n _last_received_input.size = msg->u.input.input_size;\n if (_last_received_input.frame < 0) {\n _last_received_input.frame = msg->u.input.start_frame - 1;\n }\n while (offset < numBits) {\n \/*\n * Keep walking through the frames (parsing bits) until we reach\n * the inputs for the frame right after the one we're on.\n *\/\n ASSERT(currentFrame <= (_last_received_input.frame + 1));\n bool useInputs = currentFrame == _last_received_input.frame + 1;\n\n while (BitVector_ReadBit(bits, &offset)) {\n int on = BitVector_ReadBit(bits, &offset);\n int button = BitVector_ReadNibblet(bits, &offset);\n if (useInputs) {\n if (on) {\n _last_received_input.set(button);\n } else {\n _last_received_input.clear(button);\n }\n }\n }\n ASSERT(offset <= numBits);\n\n \/*\n * Now if we want to use these inputs, go ahead and send them to\n * the emulator.\n *\/\n if (useInputs) {\n \/*\n * Move forward 1 frame in the stream.\n *\/\n char desc[1024];\n ASSERT(currentFrame == _last_received_input.frame + 1);\n _last_received_input.frame = currentFrame;\n\n \/*\n * Send the event to the emualtor\n *\/\n UdpProtocol::Event evt(UdpProtocol::Event::Input);\n evt.u.input.input = _last_received_input;\n\n _last_received_input.desc(desc, ARRAY_SIZE(desc));\n\n _state.running.last_input_packet_recv_time = Platform::GetCurrentTimeMS();\n\n Log(\"Sending frame %d to emu queue %d (%s).\\n\", _last_received_input.frame, _queue, desc);\n QueueEvent(evt);\n\n } else {\n Log(\"Skipping past frame:(%d) current is %d.\\n\", currentFrame, _last_received_input.frame);\n }\n\n \/*\n * Move forward 1 frame in the input stream.\n *\/\n currentFrame++;\n }\n }\n ASSERT(_last_received_input.frame >= last_received_frame_number);\n\n \/*\n * Get rid of our buffered input\n *\/\n while (_pending_output.size() && _pending_output.front().frame < msg->u.input.ack_frame) {\n Log(\"Throwing away pending output frame %d\\n\", _pending_output.front().frame);\n _last_acked_input = _pending_output.front();\n _pending_output.pop();\n }\n return true;\n}\n\n\nbool\nUdpProtocol::OnInputAck(UdpMsg *msg, int len)\n{\n \/*\n * Get rid of our buffered input\n *\/\n while (_pending_output.size() && _pending_output.front().frame < msg->u.input_ack.ack_frame) {\n Log(\"Throwing away pending output frame %d\\n\", _pending_output.front().frame);\n _last_acked_input = _pending_output.front();\n _pending_output.pop();\n }\n return true;\n}\n\nbool\nUdpProtocol::OnQualityReport(UdpMsg *msg, int len)\n{\n \/\/ send a reply so the other side can compute the round trip transmit time.\n UdpMsg *reply = new UdpMsg(UdpMsg::QualityReply);\n reply->u.quality_reply.pong = msg->u.quality_report.ping;\n SendMsg(reply);\n\n _remote_frame_advantage = msg->u.quality_report.frame_advantage;\n return true;\n}\n\nbool\nUdpProtocol::OnQualityReply(UdpMsg *msg, int len)\n{\n _round_trip_time = Platform::GetCurrentTimeMS() - msg->u.quality_reply.pong;\n return true;\n}\n\nbool\nUdpProtocol::OnKeepAlive(UdpMsg *msg, int len)\n{\n return true;\n}\n\nvoid\nUdpProtocol::GetNetworkStats(struct GGPONetworkStats *s)\n{\n s->network.ping = _round_trip_time;\n s->network.send_queue_len = _pending_output.size();\n s->network.kbps_sent = _kbps_sent;\n s->timesync.remote_frames_behind = _remote_frame_advantage;\n s->timesync.local_frames_behind = _local_frame_advantage;\n}\n\nvoid\nUdpProtocol::SetLocalFrameNumber(int localFrame)\n{\n \/*\n * Estimate which frame the other guy is one by looking at the\n * last frame they gave us plus some delta for the one-way packet\n * trip time.\n *\/\n int remoteFrame = _last_received_input.frame + (_round_trip_time * 60 \/ 1000);\n\n \/*\n * Our frame advantage is how many frames *behind* the other guy\n * we are. Counter-intuative, I know. It's an advantage because\n * it means they'll have to predict more often and our moves will\n * pop more frequenetly.\n *\/\n _local_frame_advantage = remoteFrame - localFrame;\n}\n\nint\nUdpProtocol::RecommendFrameDelay()\n{\n \/\/ XXX: require idle input should be a configuration parameter\n return _timesync.recommend_frame_wait_duration(false);\n}\n\n\nvoid\nUdpProtocol::SetDisconnectTimeout(int timeout)\n{\n _disconnect_timeout = timeout;\n}\n\nvoid\nUdpProtocol::SetDisconnectNotifyStart(int timeout)\n{\n _disconnect_notify_start = timeout;\n}\n\nvoid\nUdpProtocol::PumpSendQueue()\n{\n while (!_send_queue.empty()) {\n QueueEntry &entry = _send_queue.front();\n\n if (_send_latency) {\n \/\/ should really come up with a gaussian distributation based on the configured\n \/\/ value, but this will do for now.\n int jitter = (_send_latency * 2 \/ 3) + ((rand() % _send_latency) \/ 3);\n if (Platform::GetCurrentTimeMS() < _send_queue.front().queue_time + jitter) {\n break;\n }\n }\n if (_oop_percent && !_oo_packet.msg && ((rand() % 100) < _oop_percent)) {\n int delay = rand() % (_send_latency * 10 + 1000);\n Log(\"creating rogue oop (seq: %d delay: %d)\\n\", entry.msg->hdr.sequence_number, delay);\n _oo_packet.send_time = Platform::GetCurrentTimeMS() + delay;\n _oo_packet.msg = entry.msg;\n _oo_packet.dest_addr = entry.dest_addr;\n } else {\n ASSERT(entry.dest_addr.sin_addr.s_addr);\n\n _udp->SendTo((char *)entry.msg, entry.msg->PacketSize(), 0,\n (struct sockaddr *)&entry.dest_addr, sizeof entry.dest_addr);\n\n delete entry.msg;\n }\n _send_queue.pop();\n }\n if (_oo_packet.msg && _oo_packet.send_time < Platform::GetCurrentTimeMS()) {\n Log(\"sending rogue oop!\");\n _udp->SendTo((char *)_oo_packet.msg, _oo_packet.msg->PacketSize(), 0,\n (struct sockaddr *)&_oo_packet.dest_addr, sizeof _oo_packet.dest_addr);\n\n delete _oo_packet.msg;\n _oo_packet.msg = NULL;\n }\n}\n\nvoid\nUdpProtocol::ClearSendQueue()\n{\n while (!_send_queue.empty()) {\n delete _send_queue.front().msg;\n _send_queue.pop();\n }\n}\n","avg_line_length":30.4855643045,"max_line_length":153,"alphanum_fraction":0.6402927249,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":2412,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":null,"content":"#include \"XMLParser.h\"\n\n#include \n\nXMLParser::XMLParser()\n{\n callback = NULL;\n reset();\n}\n\nvoid (*XMLParser::getCallback())(void*, bool, char*, char*, char*)\n{\n return callback;\n}\nvoid XMLParser::setCallback(void (*function)(void*, bool, char*, char*, char*), void* data)\n{\n context = data;\n callback = function;\n}\n\nvoid XMLParser::reset()\n{\n fInAttribute = false;\n fInValue = false;\n fTagClosed = false;\n\n memset(tag, 0, MAX_STRING_LEN);\n memset(attribute, 0, MAX_STRING_LEN);\n memset(value, 0, MAX_STRING_LEN);\n memset(tmp, 0, MAX_STRING_LEN);\n}\n\nvoid XMLParser::addChar(char ch, char* str)\n{\n if (strlen(str) < MAX_STRING_LEN-1)\n {\n str[strlen(str)] = ch;\n }\n}\n\nvoid XMLParser::parse(char in)\n{\n if (callback == NULL)\n {\n return;\n }\n\n switch (in)\n {\n case '<': \/\/ Tag starting\n memset(tmp, 0, strlen(tmp));\n break;\n\n case ' ':\n if (strlen(tag) == 0)\n {\n \/\/ Save tag name\n strcpy(tag, tmp);\n callback(context, false, tag, (char *)\"\", (char *)\"\");\n }\n\n if (fInValue)\n {\n addChar(in, tmp);\n }\n else\n {\n fInAttribute = true;\n memset(tmp, 0, strlen(tmp));\n }\n break;\n\n case '\/':\n if (fInValue)\n {\n addChar(in, tmp);\n }\n else\n {\n fTagClosed = true;\n }\n break;\n\n case '>': \/\/ Tag ending\n if (strlen(tag) == 0)\n {\n strcpy(tag, tmp);\n }\n callback(context, fTagClosed, tag, (char *)\"\", (char *)\"\");\n reset();\n break;\n\n case '=':\n if (fInValue)\n {\n addChar(in, tmp);\n }\n else if (fInAttribute)\n {\n strcpy(attribute, tmp);\n memset(tmp, 0, strlen(tmp));\n fInAttribute = false;\n }\n break;\n\n case '\"':\n if (fInValue)\n {\n strcpy(value, tmp);\n memset(tmp, 0, strlen(tmp));\n fInValue = false;\n\n \/\/ Process tag, attribute, value\n callback(context, false, tag, attribute, value);\n }\n else\n {\n fInValue = true;\n }\n break;\n\n case 10:\n \/\/ New line, reset\n reset();\n break;\n\n default:\n addChar(in, tmp);\n }\n\n}\n\n\n","avg_line_length":18.0,"max_line_length":91,"alphanum_fraction":0.4585406302,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":4326,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":1.0,"content":"#include \n\n#include \n\n#include \n\n#include \n#include \n\nnamespace Shipyard\n{;\n\nvoid WriteVertexFormatShaderFile()\n{\n FileHandler vertexFormatShaderFile;\n vertexFormatShaderFile.Open(\"shaders\\\\vertexformats\\\\vertexformats.hlsl\", FileHandlerOpenFlag(FileHandlerOpenFlag::FileHandlerOpenFlag_Write | FileHandlerOpenFlag::FileHandlerOpenFlag_Create));\n\n if (!vertexFormatShaderFile.IsOpen())\n {\n return;\n }\n\n StringA content;\n content += \"\/**\\n* AUTO-GENERATED FILE\\n**\/\\n\";\n content += \"#ifndef SHADER_VERTEX_FORMATS_HLSL\\n\";\n content += \"#define SHADER_VERTEX_FORMATS_HLSL\\n\\n\";\n\n content += \"#ifndef VERTEX_FORMAT_TYPE\\n\";\n content += \"#define VERTEX_FORMAT_TYPE 0\\n\";\n content += \"#endif \/\/ #ifndef VERTEX_FORMAT_TYPE\\n\\n\";\n\n content += \"#\";\n\n for (shipUint16 i = 0; i < shipUint16(VertexFormatType::VertexFormatType_Count); i++)\n {\n VertexFormatType vertexFormatType = VertexFormatType(i);\n\n content += StringFormat(\"if VERTEX_FORMAT_TYPE == %d\\n\\n\", i);\n\n content += GetShaderVertexInputForVertexFormat(vertexFormatType);\n\n if (VertexFormatTypeContainsColor(vertexFormatType))\n {\n content += \"#define VERTEX_FORMAT_HAS_COLOR\\n\";\n }\n\n if (VertexFormatTypeContainsUV(vertexFormatType))\n {\n content += \"#define VERTEX_FORMAT_HAS_TEXCOORDS\\n\";\n }\n\n if (VertexFormatTypeContainsNormals(vertexFormatType))\n {\n content += \"#define VERTEX_FORMAT_HAS_NORMALS\\n\";\n }\n\n if (VertexFormatTypeContainsTangents(vertexFormatType))\n {\n content += \"#define VERTEX_FORMAT_HAS_TANGENTS\\n\";\n }\n\n content += \"\\n\";\n\n shipBool isLast = (i == shipUint16(VertexFormatType::VertexFormatType_Count) - 1);\n if (!isLast)\n {\n content += \"#el\";\n }\n }\n\n content += \"#else\\n\\n\";\n\n content += \"struct vs_input\\n\";\n content += \"{\\n\";\n content += \" float4 position : POSITION;\\n\";\n content += \"};\\n\\n\";\n\n content += \"#endif\\n\\n\";\n\n content += \"#endif \/\/ #ifndef SHADER_VERTEX_FORMATS_HLSL\";\n\n constexpr shipUint32 startingPosition = 0;\n constexpr shipBool flush = true;\n vertexFormatShaderFile.WriteChars(startingPosition, content.GetBuffer(), content.Size(), flush);\n}\n\nStringA GetShaderVertexInputForVertexFormat(VertexFormatType vertexFormatType)\n{\n StringA shaderVertexInput;\n\n shaderVertexInput += \"struct vs_input\\n\";\n shaderVertexInput += \"{\\n\";\n\n VertexFormat* vertexFormat = nullptr;\n GetVertexFormat(vertexFormatType, vertexFormat);\n SHIP_ASSERT(vertexFormat != nullptr);\n\n shipUint32 numInputLayouts = vertexFormat->GetNumInputLayouts();\n const InputLayout* inputLayouts = vertexFormat->GetInputLayouts();\n\n for (shipUint32 j = 0; j < numInputLayouts; j++)\n {\n const InputLayout& inputLayout = inputLayouts[j];\n\n BaseFormatType shaderInputBaseFormatType = GetBaseFormatType(inputLayout.m_Format);\n shipUint32 shaderInputNumComponents = GetFormatNumComponents(inputLayout.m_Format);\n\n const shipChar* shaderInputBaseFormatTypeName = GetBaseFormatTypeName(shaderInputBaseFormatType);\n\n const shipChar* shaderInputType = StringFormat(\"%s%d\", shaderInputBaseFormatTypeName, shaderInputNumComponents);\n\n const shipChar* shaderInputName = GetVertexShaderInputName(inputLayout.m_SemanticName);\n if (inputLayout.m_SemanticIndex > 0)\n {\n shaderInputName = StringFormat(\"%s%d\", shaderInputName, inputLayout.m_SemanticIndex);\n }\n\n const shipChar* semanticName = GetVertexSemanticName(inputLayout.m_SemanticName);\n if (inputLayout.m_SemanticIndex > 0)\n {\n semanticName = StringFormat(\"%s%d\", semanticName, inputLayout.m_SemanticIndex);\n }\n\n shaderVertexInput += \" \";\n shaderVertexInput += shaderInputType;\n shaderVertexInput += \" \";\n shaderVertexInput += shaderInputName;\n shaderVertexInput += \" : \";\n shaderVertexInput += semanticName;\n shaderVertexInput += \";\\n\";\n }\n\n shaderVertexInput += \"};\\n\\n\";\n\n return shaderVertexInput;\n}\n\n}","avg_line_length":31.347826087,"max_line_length":197,"alphanum_fraction":0.674988442,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":1529,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["Apache-2.0"],"max_stars_count":8.0,"content":"#include \n#include \n\nusing namespace iris;\n\ntemplate \nvoid test_vabs(T(*func)(T)) {\n T v, result;\n\n \/\/ All positive\n for(size_t i = 0; i < T::length; i++) {\n v.template at(i) = i;\n }\n result = func(v);\n for(size_t i = 0; i < T::length; i++) {\n assert(result.template at(i) == static_cast(i));\n }\n\n \/\/ All negative\n for(size_t i = 0; i < T::length; i++) {\n v.template at(i) = -static_cast(i);\n }\n result = func(v);\n for(size_t i = 0; i < T::length; i++) {\n assert(result.template at(i) == static_cast(i));\n }\n\n for(size_t i = 0; i < T::length; i++) {\n v.template at(i) = std::numeric_limits::min();\n }\n result = func(v);\n for(size_t i = 0; i < T::length; i++) {\n if(std::numeric_limits::is_signed) {\n assert(result.template at(i) == std::numeric_limits::min());\n } else {\n assert(result.template at(i) == -1);\n }\n }\n}\n\nint main() {\n test_vabs(vabs_s8);\n test_vabs(vabs_s16);\n test_vabs(vabs_s32);\n\n test_vabs(vabs_f32);\n\n test_vabs(vabsq_s8);\n test_vabs(vabsq_s16);\n test_vabs(vabsq_s32);\n\n test_vabs(vabsq_f32);\n}\n","avg_line_length":28.3148148148,"max_line_length":122,"alphanum_fraction":0.5951602354,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":56666,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":null,"content":"\/* Generated code for Python source for module 'django.db.models.functions'\n * created by Nuitka version 0.5.28.2\n *\n * This code is in part copyright 2017 Kay Hayen.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \"nuitka\/prelude.h\"\n\n#include \"__helpers.h\"\n\n\/* The _module_django$db$models$functions is a Python object pointer of module type. *\/\n\n\/* Note: For full compatibility with CPython, every module variable access\n * needs to go through it except for cases where the module cannot possibly\n * have changed in the mean time.\n *\/\n\nPyObject *module_django$db$models$functions;\nPyDictObject *moduledict_django$db$models$functions;\n\n\/* The module constants used, if any. *\/\nextern PyObject *const_str_plain_ExtractMinute;\nextern PyObject *const_str_plain_Trunc;\nextern PyObject *const_str_plain_environ;\nextern PyObject *const_str_plain_TruncDate;\nextern PyObject *const_tuple_e264d9df221704bac1b8813696d55517_tuple;\nextern PyObject *const_str_plain_ModuleSpec;\nextern PyObject *const_str_plain___spec__;\nextern PyObject *const_str_plain___package__;\nextern PyObject *const_str_plain_ConcatPair;\nstatic PyObject *const_str_digest_fe19ab428a9952bfcba7a98da752b153;\nextern PyObject *const_str_plain___all__;\nextern PyObject *const_int_pos_1;\nextern PyObject *const_str_plain_ExtractYear;\nextern PyObject *const_str_plain_TruncMinute;\nextern PyObject *const_str_plain_Substr;\nextern PyObject *const_str_plain___file__;\nextern PyObject *const_str_plain_Upper;\nextern PyObject *const_str_plain_ExtractSecond;\nextern PyObject *const_tuple_9aafdb4681f02593d1d6ac7779e00e9d_tuple;\nextern PyObject *const_str_plain_Greatest;\nextern PyObject *const_str_plain_Coalesce;\nextern PyObject *const_str_plain_Lower;\nextern PyObject *const_str_plain_path;\nstatic PyObject *const_tuple_ae54af5000b7d151d08db7b05d852532_tuple;\nextern PyObject *const_str_plain_Now;\nextern PyObject *const_str_plain_Extract;\nextern PyObject *const_str_plain_ExtractDay;\nstatic PyObject *const_str_digest_80646b51abf2eb839e622666027e3d26;\nextern PyObject *const_str_plain_TruncYear;\nextern PyObject *const_str_plain_Cast;\nstatic PyObject *const_str_digest_d4825e9eae920f54e180fef58beae80c;\nstatic PyObject *const_tuple_f37e9448a2e04decb7f95c5d37fa2ec4_tuple;\nextern PyObject *const_str_plain_TruncDay;\nextern PyObject *const_str_plain_NUITKA_PACKAGE_django;\nextern PyObject *const_str_plain_TruncHour;\nextern PyObject *const_str_plain_Concat;\nstatic PyObject *const_tuple_a57d7a35df18217b92792bce665af9a6_tuple;\nextern PyObject *const_str_plain_TruncSecond;\nextern PyObject *const_str_plain_TruncMonth;\nstatic PyObject *const_list_6be8e1a18107e0f2e8d82c61e79fe2e7_list;\nextern PyObject *const_str_plain_NUITKA_PACKAGE_django_db_models;\nextern PyObject *const_str_digest_5bfaf90dbd407b4fc29090c8f6415242;\nstatic PyObject *const_str_digest_41a75782b67d10db27aeaed25e51e404;\nextern PyObject *const_str_plain_ExtractWeek;\nextern PyObject *const_str_plain_ExtractHour;\nextern PyObject *const_str_plain___path__;\nextern PyObject *const_tuple_c15243b3ba68498da186d5d65ae367ca_tuple;\nextern PyObject *const_tuple_empty;\nextern PyObject *const_str_plain_get;\nextern PyObject *const_str_plain_base;\nextern PyObject *const_str_plain_NUITKA_PACKAGE_django_db;\nextern PyObject *const_str_plain_ExtractWeekDay;\nextern PyObject *const_str_plain_datetime;\nextern PyObject *const_str_plain_TruncTime;\nstatic PyObject *const_str_digest_8f6c0325827ce7275904d2bbc39c7bde;\nextern PyObject *const_str_plain___loader__;\nextern PyObject *const_str_plain_join;\nextern PyObject *const_str_digest_4e7e693e251a89f57ec4f0dd4f537b0c;\nstatic PyObject *const_str_plain_functions;\nextern PyObject *const_str_plain_dirname;\nextern PyObject *const_str_plain_Length;\nextern PyObject *const_str_plain_ExtractMonth;\nextern PyObject *const_str_plain___doc__;\nextern PyObject *const_str_plain___cached__;\nextern PyObject *const_str_plain_Least;\nstatic PyObject *module_filename_obj;\n\nstatic bool constants_created = false;\n\nstatic void createModuleConstants( void )\n{\n const_str_digest_fe19ab428a9952bfcba7a98da752b153 = UNSTREAM_STRING( &constant_bin[ 950214 ], 38, 0 );\n const_tuple_ae54af5000b7d151d08db7b05d852532_tuple = PyTuple_New( 18 );\n PyTuple_SET_ITEM( const_tuple_ae54af5000b7d151d08db7b05d852532_tuple, 0, const_str_plain_Extract ); Py_INCREF( const_str_plain_Extract );\n PyTuple_SET_ITEM( const_tuple_ae54af5000b7d151d08db7b05d852532_tuple, 1, const_str_plain_ExtractDay ); Py_INCREF( const_str_plain_ExtractDay );\n PyTuple_SET_ITEM( const_tuple_ae54af5000b7d151d08db7b05d852532_tuple, 2, const_str_plain_ExtractHour ); Py_INCREF( const_str_plain_ExtractHour );\n PyTuple_SET_ITEM( const_tuple_ae54af5000b7d151d08db7b05d852532_tuple, 3, const_str_plain_ExtractMinute ); Py_INCREF( const_str_plain_ExtractMinute );\n PyTuple_SET_ITEM( const_tuple_ae54af5000b7d151d08db7b05d852532_tuple, 4, const_str_plain_ExtractMonth ); Py_INCREF( const_str_plain_ExtractMonth );\n PyTuple_SET_ITEM( const_tuple_ae54af5000b7d151d08db7b05d852532_tuple, 5, const_str_plain_ExtractSecond ); Py_INCREF( const_str_plain_ExtractSecond );\n PyTuple_SET_ITEM( const_tuple_ae54af5000b7d151d08db7b05d852532_tuple, 6, const_str_plain_ExtractWeek ); Py_INCREF( const_str_plain_ExtractWeek );\n PyTuple_SET_ITEM( const_tuple_ae54af5000b7d151d08db7b05d852532_tuple, 7, const_str_plain_ExtractWeekDay ); Py_INCREF( const_str_plain_ExtractWeekDay );\n PyTuple_SET_ITEM( const_tuple_ae54af5000b7d151d08db7b05d852532_tuple, 8, const_str_plain_ExtractYear ); Py_INCREF( const_str_plain_ExtractYear );\n PyTuple_SET_ITEM( const_tuple_ae54af5000b7d151d08db7b05d852532_tuple, 9, const_str_plain_Trunc ); Py_INCREF( const_str_plain_Trunc );\n PyTuple_SET_ITEM( const_tuple_ae54af5000b7d151d08db7b05d852532_tuple, 10, const_str_plain_TruncDate ); Py_INCREF( const_str_plain_TruncDate );\n PyTuple_SET_ITEM( const_tuple_ae54af5000b7d151d08db7b05d852532_tuple, 11, const_str_plain_TruncDay ); Py_INCREF( const_str_plain_TruncDay );\n PyTuple_SET_ITEM( const_tuple_ae54af5000b7d151d08db7b05d852532_tuple, 12, const_str_plain_TruncHour ); Py_INCREF( const_str_plain_TruncHour );\n PyTuple_SET_ITEM( const_tuple_ae54af5000b7d151d08db7b05d852532_tuple, 13, const_str_plain_TruncMinute ); Py_INCREF( const_str_plain_TruncMinute );\n PyTuple_SET_ITEM( const_tuple_ae54af5000b7d151d08db7b05d852532_tuple, 14, const_str_plain_TruncMonth ); Py_INCREF( const_str_plain_TruncMonth );\n PyTuple_SET_ITEM( const_tuple_ae54af5000b7d151d08db7b05d852532_tuple, 15, const_str_plain_TruncSecond ); Py_INCREF( const_str_plain_TruncSecond );\n PyTuple_SET_ITEM( const_tuple_ae54af5000b7d151d08db7b05d852532_tuple, 16, const_str_plain_TruncTime ); Py_INCREF( const_str_plain_TruncTime );\n PyTuple_SET_ITEM( const_tuple_ae54af5000b7d151d08db7b05d852532_tuple, 17, const_str_plain_TruncYear ); Py_INCREF( const_str_plain_TruncYear );\n const_str_digest_80646b51abf2eb839e622666027e3d26 = UNSTREAM_STRING( &constant_bin[ 950252 ], 35, 0 );\n const_str_digest_d4825e9eae920f54e180fef58beae80c = UNSTREAM_STRING( &constant_bin[ 950224 ], 16, 0 );\n const_tuple_f37e9448a2e04decb7f95c5d37fa2ec4_tuple = PyTuple_New( 2 );\n const_str_digest_41a75782b67d10db27aeaed25e51e404 = UNSTREAM_STRING( &constant_bin[ 950287 ], 41, 1 );\n PyTuple_SET_ITEM( const_tuple_f37e9448a2e04decb7f95c5d37fa2ec4_tuple, 0, const_str_digest_41a75782b67d10db27aeaed25e51e404 ); Py_INCREF( const_str_digest_41a75782b67d10db27aeaed25e51e404 );\n PyTuple_SET_ITEM( const_tuple_f37e9448a2e04decb7f95c5d37fa2ec4_tuple, 1, const_str_digest_5bfaf90dbd407b4fc29090c8f6415242 ); Py_INCREF( const_str_digest_5bfaf90dbd407b4fc29090c8f6415242 );\n const_tuple_a57d7a35df18217b92792bce665af9a6_tuple = PyTuple_New( 11 );\n PyTuple_SET_ITEM( const_tuple_a57d7a35df18217b92792bce665af9a6_tuple, 0, const_str_plain_Cast ); Py_INCREF( const_str_plain_Cast );\n PyTuple_SET_ITEM( const_tuple_a57d7a35df18217b92792bce665af9a6_tuple, 1, const_str_plain_Coalesce ); Py_INCREF( const_str_plain_Coalesce );\n PyTuple_SET_ITEM( const_tuple_a57d7a35df18217b92792bce665af9a6_tuple, 2, const_str_plain_Concat ); Py_INCREF( const_str_plain_Concat );\n PyTuple_SET_ITEM( const_tuple_a57d7a35df18217b92792bce665af9a6_tuple, 3, const_str_plain_ConcatPair ); Py_INCREF( const_str_plain_ConcatPair );\n PyTuple_SET_ITEM( const_tuple_a57d7a35df18217b92792bce665af9a6_tuple, 4, const_str_plain_Greatest ); Py_INCREF( const_str_plain_Greatest );\n PyTuple_SET_ITEM( const_tuple_a57d7a35df18217b92792bce665af9a6_tuple, 5, const_str_plain_Least ); Py_INCREF( const_str_plain_Least );\n PyTuple_SET_ITEM( const_tuple_a57d7a35df18217b92792bce665af9a6_tuple, 6, const_str_plain_Length ); Py_INCREF( const_str_plain_Length );\n PyTuple_SET_ITEM( const_tuple_a57d7a35df18217b92792bce665af9a6_tuple, 7, const_str_plain_Lower ); Py_INCREF( const_str_plain_Lower );\n PyTuple_SET_ITEM( const_tuple_a57d7a35df18217b92792bce665af9a6_tuple, 8, const_str_plain_Now ); Py_INCREF( const_str_plain_Now );\n PyTuple_SET_ITEM( const_tuple_a57d7a35df18217b92792bce665af9a6_tuple, 9, const_str_plain_Substr ); Py_INCREF( const_str_plain_Substr );\n PyTuple_SET_ITEM( const_tuple_a57d7a35df18217b92792bce665af9a6_tuple, 10, const_str_plain_Upper ); Py_INCREF( const_str_plain_Upper );\n const_list_6be8e1a18107e0f2e8d82c61e79fe2e7_list = PyMarshal_ReadObjectFromString( (char *)&constant_bin[ 950328 ], 312 );\n const_str_digest_8f6c0325827ce7275904d2bbc39c7bde = UNSTREAM_STRING( &constant_bin[ 950221 ], 19, 0 );\n const_str_plain_functions = UNSTREAM_STRING( &constant_bin[ 21991 ], 9, 1 );\n\n constants_created = true;\n}\n\n#ifndef __NUITKA_NO_ASSERT__\nvoid checkModuleConstants_django$db$models$functions( void )\n{\n \/\/ The module may not have been used at all.\n if (constants_created == false) return;\n\n\n}\n#endif\n\n\/\/ The module code objects.\nstatic PyCodeObject *codeobj_61b49fd0c6a37a70ca165f42c98db6a8;\n\nstatic void createModuleCodeObjects(void)\n{\n module_filename_obj = MAKE_RELATIVE_PATH( const_str_digest_fe19ab428a9952bfcba7a98da752b153 );\n codeobj_61b49fd0c6a37a70ca165f42c98db6a8 = MAKE_CODEOBJ( module_filename_obj, const_str_digest_80646b51abf2eb839e622666027e3d26, 1, const_tuple_empty, 0, 0, CO_NOFREE );\n}\n\n\/\/ The module function declarations.\n\n\n\/\/ The module function definitions.\n\n\n\n#if PYTHON_VERSION >= 300\nstatic struct PyModuleDef mdef_django$db$models$functions =\n{\n PyModuleDef_HEAD_INIT,\n \"django.db.models.functions\", \/* m_name *\/\n NULL, \/* m_doc *\/\n -1, \/* m_size *\/\n NULL, \/* m_methods *\/\n NULL, \/* m_reload *\/\n NULL, \/* m_traverse *\/\n NULL, \/* m_clear *\/\n NULL, \/* m_free *\/\n };\n#endif\n\n#if PYTHON_VERSION >= 300\nextern PyObject *metapath_based_loader;\n#endif\n#if PYTHON_VERSION >= 330\nextern PyObject *const_str_plain___loader__;\n#endif\n\nextern void _initCompiledCellType();\nextern void _initCompiledGeneratorType();\nextern void _initCompiledFunctionType();\nextern void _initCompiledMethodType();\nextern void _initCompiledFrameType();\n#if PYTHON_VERSION >= 350\nextern void _initCompiledCoroutineTypes();\n#endif\n#if PYTHON_VERSION >= 360\nextern void _initCompiledAsyncgenTypes();\n#endif\n\n\/\/ The exported interface to CPython. On import of the module, this function\n\/\/ gets called. It has to have an exact function name, in cases it's a shared\n\/\/ library export. This is hidden behind the MOD_INIT_DECL.\n\nMOD_INIT_DECL( django$db$models$functions )\n{\n#if defined(_NUITKA_EXE) || PYTHON_VERSION >= 300\n static bool _init_done = false;\n\n \/\/ Modules might be imported repeatedly, which is to be ignored.\n if ( _init_done )\n {\n return MOD_RETURN_VALUE( module_django$db$models$functions );\n }\n else\n {\n _init_done = true;\n }\n#endif\n\n#ifdef _NUITKA_MODULE\n \/\/ In case of a stand alone extension module, need to call initialization\n \/\/ the init here because that's the first and only time we are going to get\n \/\/ called here.\n\n \/\/ Initialize the constant values used.\n _initBuiltinModule();\n createGlobalConstants();\n\n \/* Initialize the compiled types of Nuitka. *\/\n _initCompiledCellType();\n _initCompiledGeneratorType();\n _initCompiledFunctionType();\n _initCompiledMethodType();\n _initCompiledFrameType();\n#if PYTHON_VERSION >= 350\n _initCompiledCoroutineTypes();\n#endif\n#if PYTHON_VERSION >= 360\n _initCompiledAsyncgenTypes();\n#endif\n\n#if PYTHON_VERSION < 300\n _initSlotCompare();\n#endif\n#if PYTHON_VERSION >= 270\n _initSlotIternext();\n#endif\n\n patchBuiltinModule();\n patchTypeComparison();\n\n \/\/ Enable meta path based loader if not already done.\n setupMetaPathBasedLoader();\n\n#if PYTHON_VERSION >= 300\n patchInspectModule();\n#endif\n\n#endif\n\n \/* The constants only used by this module are created now. *\/\n#ifdef _NUITKA_TRACE\n puts(\"django.db.models.functions: Calling createModuleConstants().\");\n#endif\n createModuleConstants();\n\n \/* The code objects used by this module are created now. *\/\n#ifdef _NUITKA_TRACE\n puts(\"django.db.models.functions: Calling createModuleCodeObjects().\");\n#endif\n createModuleCodeObjects();\n\n \/\/ puts( \"in initdjango$db$models$functions\" );\n\n \/\/ Create the module object first. There are no methods initially, all are\n \/\/ added dynamically in actual code only. Also no \"__doc__\" is initially\n \/\/ set at this time, as it could not contain NUL characters this way, they\n \/\/ are instead set in early module code. No \"self\" for modules, we have no\n \/\/ use for it.\n#if PYTHON_VERSION < 300\n module_django$db$models$functions = Py_InitModule4(\n \"django.db.models.functions\", \/\/ Module Name\n NULL, \/\/ No methods initially, all are added\n \/\/ dynamically in actual module code only.\n NULL, \/\/ No __doc__ is initially set, as it could\n \/\/ not contain NUL this way, added early in\n \/\/ actual code.\n NULL, \/\/ No self for modules, we don't use it.\n PYTHON_API_VERSION\n );\n#else\n module_django$db$models$functions = PyModule_Create( &mdef_django$db$models$functions );\n#endif\n\n moduledict_django$db$models$functions = MODULE_DICT( module_django$db$models$functions );\n\n CHECK_OBJECT( module_django$db$models$functions );\n\n\/\/ Seems to work for Python2.7 out of the box, but for Python3, the module\n\/\/ doesn't automatically enter \"sys.modules\", so do it manually.\n#if PYTHON_VERSION >= 300\n {\n int r = PyObject_SetItem( PySys_GetObject( (char *)\"modules\" ), const_str_digest_4e7e693e251a89f57ec4f0dd4f537b0c, module_django$db$models$functions );\n\n assert( r != -1 );\n }\n#endif\n\n \/\/ For deep importing of a module we need to have \"__builtins__\", so we set\n \/\/ it ourselves in the same way than CPython does. Note: This must be done\n \/\/ before the frame object is allocated, or else it may fail.\n\n if ( GET_STRING_DICT_VALUE( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain___builtins__ ) == NULL )\n {\n PyObject *value = (PyObject *)builtin_module;\n\n \/\/ Check if main module, not a dict then but the module itself.\n#if !defined(_NUITKA_EXE) || !0\n value = PyModule_GetDict( value );\n#endif\n\n UPDATE_STRING_DICT0( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain___builtins__, value );\n }\n\n#if PYTHON_VERSION >= 330\n UPDATE_STRING_DICT0( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain___loader__, metapath_based_loader );\n#endif\n\n \/\/ Temp variables if any\n PyObject *tmp_import_from_1__module = NULL;\n PyObject *tmp_import_from_2__module = NULL;\n PyObject *exception_type = NULL;\n PyObject *exception_value = NULL;\n PyTracebackObject *exception_tb = NULL;\n NUITKA_MAY_BE_UNUSED int exception_lineno = 0;\n PyObject *exception_keeper_type_1;\n PyObject *exception_keeper_value_1;\n PyTracebackObject *exception_keeper_tb_1;\n NUITKA_MAY_BE_UNUSED int exception_keeper_lineno_1;\n PyObject *exception_keeper_type_2;\n PyObject *exception_keeper_value_2;\n PyTracebackObject *exception_keeper_tb_2;\n NUITKA_MAY_BE_UNUSED int exception_keeper_lineno_2;\n PyObject *tmp_args_element_name_1;\n PyObject *tmp_args_element_name_2;\n PyObject *tmp_args_element_name_3;\n PyObject *tmp_args_element_name_4;\n PyObject *tmp_args_element_name_5;\n PyObject *tmp_args_element_name_6;\n PyObject *tmp_args_element_name_7;\n PyObject *tmp_args_element_name_8;\n PyObject *tmp_args_element_name_9;\n PyObject *tmp_assign_source_1;\n PyObject *tmp_assign_source_2;\n PyObject *tmp_assign_source_3;\n PyObject *tmp_assign_source_4;\n PyObject *tmp_assign_source_5;\n PyObject *tmp_assign_source_6;\n PyObject *tmp_assign_source_7;\n PyObject *tmp_assign_source_8;\n PyObject *tmp_assign_source_9;\n PyObject *tmp_assign_source_10;\n PyObject *tmp_assign_source_11;\n PyObject *tmp_assign_source_12;\n PyObject *tmp_assign_source_13;\n PyObject *tmp_assign_source_14;\n PyObject *tmp_assign_source_15;\n PyObject *tmp_assign_source_16;\n PyObject *tmp_assign_source_17;\n PyObject *tmp_assign_source_18;\n PyObject *tmp_assign_source_19;\n PyObject *tmp_assign_source_20;\n PyObject *tmp_assign_source_21;\n PyObject *tmp_assign_source_22;\n PyObject *tmp_assign_source_23;\n PyObject *tmp_assign_source_24;\n PyObject *tmp_assign_source_25;\n PyObject *tmp_assign_source_26;\n PyObject *tmp_assign_source_27;\n PyObject *tmp_assign_source_28;\n PyObject *tmp_assign_source_29;\n PyObject *tmp_assign_source_30;\n PyObject *tmp_assign_source_31;\n PyObject *tmp_assign_source_32;\n PyObject *tmp_assign_source_33;\n PyObject *tmp_assign_source_34;\n PyObject *tmp_assign_source_35;\n PyObject *tmp_assign_source_36;\n PyObject *tmp_assign_source_37;\n PyObject *tmp_assign_source_38;\n PyObject *tmp_assign_source_39;\n PyObject *tmp_called_instance_1;\n PyObject *tmp_called_instance_2;\n PyObject *tmp_called_instance_3;\n PyObject *tmp_called_instance_4;\n PyObject *tmp_called_name_1;\n PyObject *tmp_called_name_2;\n PyObject *tmp_called_name_3;\n PyObject *tmp_called_name_4;\n PyObject *tmp_called_name_5;\n PyObject *tmp_fromlist_name_1;\n PyObject *tmp_fromlist_name_2;\n PyObject *tmp_globals_name_1;\n PyObject *tmp_globals_name_2;\n PyObject *tmp_import_name_from_1;\n PyObject *tmp_import_name_from_2;\n PyObject *tmp_import_name_from_3;\n PyObject *tmp_import_name_from_4;\n PyObject *tmp_import_name_from_5;\n PyObject *tmp_import_name_from_6;\n PyObject *tmp_import_name_from_7;\n PyObject *tmp_import_name_from_8;\n PyObject *tmp_import_name_from_9;\n PyObject *tmp_import_name_from_10;\n PyObject *tmp_import_name_from_11;\n PyObject *tmp_import_name_from_12;\n PyObject *tmp_import_name_from_13;\n PyObject *tmp_import_name_from_14;\n PyObject *tmp_import_name_from_15;\n PyObject *tmp_import_name_from_16;\n PyObject *tmp_import_name_from_17;\n PyObject *tmp_import_name_from_18;\n PyObject *tmp_import_name_from_19;\n PyObject *tmp_import_name_from_20;\n PyObject *tmp_import_name_from_21;\n PyObject *tmp_import_name_from_22;\n PyObject *tmp_import_name_from_23;\n PyObject *tmp_import_name_from_24;\n PyObject *tmp_import_name_from_25;\n PyObject *tmp_import_name_from_26;\n PyObject *tmp_import_name_from_27;\n PyObject *tmp_import_name_from_28;\n PyObject *tmp_import_name_from_29;\n PyObject *tmp_level_name_1;\n PyObject *tmp_level_name_2;\n PyObject *tmp_list_element_1;\n PyObject *tmp_locals_name_1;\n PyObject *tmp_locals_name_2;\n PyObject *tmp_name_name_1;\n PyObject *tmp_name_name_2;\n PyObject *tmp_source_name_1;\n PyObject *tmp_source_name_2;\n PyObject *tmp_source_name_3;\n PyObject *tmp_source_name_4;\n struct Nuitka_FrameObject *frame_61b49fd0c6a37a70ca165f42c98db6a8;\n\n NUITKA_MAY_BE_UNUSED char const *type_description_1 = NULL;\n\n \/\/ Module code.\n tmp_assign_source_1 = Py_None;\n UPDATE_STRING_DICT0( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain___doc__, tmp_assign_source_1 );\n tmp_assign_source_2 = module_filename_obj;\n UPDATE_STRING_DICT0( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain___file__, tmp_assign_source_2 );\n \/\/ Frame without reuse.\n frame_61b49fd0c6a37a70ca165f42c98db6a8 = MAKE_MODULE_FRAME( codeobj_61b49fd0c6a37a70ca165f42c98db6a8, module_django$db$models$functions );\n\n \/\/ Push the new frame as the currently active one, and we should be exclusively\n \/\/ owning it.\n pushFrameStack( frame_61b49fd0c6a37a70ca165f42c98db6a8 );\n assert( Py_REFCNT( frame_61b49fd0c6a37a70ca165f42c98db6a8 ) == 2 );\n\n \/\/ Framed code:\n tmp_assign_source_3 = PyList_New( 5 );\n frame_61b49fd0c6a37a70ca165f42c98db6a8->m_frame.f_lineno = 1;\n {\n PyObject *module = PyImport_ImportModule(\"os\");\n if (likely( module != NULL ))\n {\n tmp_source_name_1 = PyObject_GetAttr( module, const_str_plain_path );\n }\n else\n {\n tmp_source_name_1 = NULL;\n }\n }\n\n if ( tmp_source_name_1 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n Py_DECREF( tmp_assign_source_3 );\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n tmp_called_name_1 = LOOKUP_ATTRIBUTE( tmp_source_name_1, const_str_plain_dirname );\n if ( tmp_called_name_1 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n Py_DECREF( tmp_assign_source_3 );\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n tmp_args_element_name_1 = module_filename_obj;\n frame_61b49fd0c6a37a70ca165f42c98db6a8->m_frame.f_lineno = 1;\n {\n PyObject *call_args[] = { tmp_args_element_name_1 };\n tmp_list_element_1 = CALL_FUNCTION_WITH_ARGS1( tmp_called_name_1, call_args );\n }\n\n Py_DECREF( tmp_called_name_1 );\n if ( tmp_list_element_1 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n Py_DECREF( tmp_assign_source_3 );\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n PyList_SET_ITEM( tmp_assign_source_3, 0, tmp_list_element_1 );\n frame_61b49fd0c6a37a70ca165f42c98db6a8->m_frame.f_lineno = 1;\n {\n PyObject *module = PyImport_ImportModule(\"os\");\n if (likely( module != NULL ))\n {\n tmp_source_name_2 = PyObject_GetAttr( module, const_str_plain_path );\n }\n else\n {\n tmp_source_name_2 = NULL;\n }\n }\n\n if ( tmp_source_name_2 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n Py_DECREF( tmp_assign_source_3 );\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n tmp_called_name_2 = LOOKUP_ATTRIBUTE( tmp_source_name_2, const_str_plain_join );\n if ( tmp_called_name_2 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n Py_DECREF( tmp_assign_source_3 );\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n frame_61b49fd0c6a37a70ca165f42c98db6a8->m_frame.f_lineno = 1;\n {\n PyObject *module = PyImport_ImportModule(\"os\");\n if (likely( module != NULL ))\n {\n tmp_called_instance_1 = PyObject_GetAttr( module, const_str_plain_environ );\n }\n else\n {\n tmp_called_instance_1 = NULL;\n }\n }\n\n if ( tmp_called_instance_1 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n Py_DECREF( tmp_assign_source_3 );\n Py_DECREF( tmp_called_name_2 );\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n frame_61b49fd0c6a37a70ca165f42c98db6a8->m_frame.f_lineno = 1;\n tmp_args_element_name_2 = CALL_METHOD_WITH_ARGS2( tmp_called_instance_1, const_str_plain_get, &PyTuple_GET_ITEM( const_tuple_c15243b3ba68498da186d5d65ae367ca_tuple, 0 ) );\n\n if ( tmp_args_element_name_2 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n Py_DECREF( tmp_assign_source_3 );\n Py_DECREF( tmp_called_name_2 );\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n tmp_args_element_name_3 = const_str_digest_8f6c0325827ce7275904d2bbc39c7bde;\n frame_61b49fd0c6a37a70ca165f42c98db6a8->m_frame.f_lineno = 1;\n {\n PyObject *call_args[] = { tmp_args_element_name_2, tmp_args_element_name_3 };\n tmp_list_element_1 = CALL_FUNCTION_WITH_ARGS2( tmp_called_name_2, call_args );\n }\n\n Py_DECREF( tmp_called_name_2 );\n Py_DECREF( tmp_args_element_name_2 );\n if ( tmp_list_element_1 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n Py_DECREF( tmp_assign_source_3 );\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n PyList_SET_ITEM( tmp_assign_source_3, 1, tmp_list_element_1 );\n frame_61b49fd0c6a37a70ca165f42c98db6a8->m_frame.f_lineno = 1;\n {\n PyObject *module = PyImport_ImportModule(\"os\");\n if (likely( module != NULL ))\n {\n tmp_source_name_3 = PyObject_GetAttr( module, const_str_plain_path );\n }\n else\n {\n tmp_source_name_3 = NULL;\n }\n }\n\n if ( tmp_source_name_3 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n Py_DECREF( tmp_assign_source_3 );\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n tmp_called_name_3 = LOOKUP_ATTRIBUTE( tmp_source_name_3, const_str_plain_join );\n if ( tmp_called_name_3 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n Py_DECREF( tmp_assign_source_3 );\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n frame_61b49fd0c6a37a70ca165f42c98db6a8->m_frame.f_lineno = 1;\n {\n PyObject *module = PyImport_ImportModule(\"os\");\n if (likely( module != NULL ))\n {\n tmp_called_instance_2 = PyObject_GetAttr( module, const_str_plain_environ );\n }\n else\n {\n tmp_called_instance_2 = NULL;\n }\n }\n\n if ( tmp_called_instance_2 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n Py_DECREF( tmp_assign_source_3 );\n Py_DECREF( tmp_called_name_3 );\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n frame_61b49fd0c6a37a70ca165f42c98db6a8->m_frame.f_lineno = 1;\n tmp_args_element_name_4 = CALL_METHOD_WITH_ARGS2( tmp_called_instance_2, const_str_plain_get, &PyTuple_GET_ITEM( const_tuple_9aafdb4681f02593d1d6ac7779e00e9d_tuple, 0 ) );\n\n if ( tmp_args_element_name_4 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n Py_DECREF( tmp_assign_source_3 );\n Py_DECREF( tmp_called_name_3 );\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n tmp_args_element_name_5 = const_str_digest_d4825e9eae920f54e180fef58beae80c;\n frame_61b49fd0c6a37a70ca165f42c98db6a8->m_frame.f_lineno = 1;\n {\n PyObject *call_args[] = { tmp_args_element_name_4, tmp_args_element_name_5 };\n tmp_list_element_1 = CALL_FUNCTION_WITH_ARGS2( tmp_called_name_3, call_args );\n }\n\n Py_DECREF( tmp_called_name_3 );\n Py_DECREF( tmp_args_element_name_4 );\n if ( tmp_list_element_1 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n Py_DECREF( tmp_assign_source_3 );\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n PyList_SET_ITEM( tmp_assign_source_3, 2, tmp_list_element_1 );\n frame_61b49fd0c6a37a70ca165f42c98db6a8->m_frame.f_lineno = 1;\n {\n PyObject *module = PyImport_ImportModule(\"os\");\n if (likely( module != NULL ))\n {\n tmp_source_name_4 = PyObject_GetAttr( module, const_str_plain_path );\n }\n else\n {\n tmp_source_name_4 = NULL;\n }\n }\n\n if ( tmp_source_name_4 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n Py_DECREF( tmp_assign_source_3 );\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n tmp_called_name_4 = LOOKUP_ATTRIBUTE( tmp_source_name_4, const_str_plain_join );\n if ( tmp_called_name_4 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n Py_DECREF( tmp_assign_source_3 );\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n frame_61b49fd0c6a37a70ca165f42c98db6a8->m_frame.f_lineno = 1;\n {\n PyObject *module = PyImport_ImportModule(\"os\");\n if (likely( module != NULL ))\n {\n tmp_called_instance_3 = PyObject_GetAttr( module, const_str_plain_environ );\n }\n else\n {\n tmp_called_instance_3 = NULL;\n }\n }\n\n if ( tmp_called_instance_3 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n Py_DECREF( tmp_assign_source_3 );\n Py_DECREF( tmp_called_name_4 );\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n frame_61b49fd0c6a37a70ca165f42c98db6a8->m_frame.f_lineno = 1;\n tmp_args_element_name_6 = CALL_METHOD_WITH_ARGS2( tmp_called_instance_3, const_str_plain_get, &PyTuple_GET_ITEM( const_tuple_e264d9df221704bac1b8813696d55517_tuple, 0 ) );\n\n if ( tmp_args_element_name_6 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n Py_DECREF( tmp_assign_source_3 );\n Py_DECREF( tmp_called_name_4 );\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n tmp_args_element_name_7 = const_str_plain_functions;\n frame_61b49fd0c6a37a70ca165f42c98db6a8->m_frame.f_lineno = 1;\n {\n PyObject *call_args[] = { tmp_args_element_name_6, tmp_args_element_name_7 };\n tmp_list_element_1 = CALL_FUNCTION_WITH_ARGS2( tmp_called_name_4, call_args );\n }\n\n Py_DECREF( tmp_called_name_4 );\n Py_DECREF( tmp_args_element_name_6 );\n if ( tmp_list_element_1 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n Py_DECREF( tmp_assign_source_3 );\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n PyList_SET_ITEM( tmp_assign_source_3, 3, tmp_list_element_1 );\n frame_61b49fd0c6a37a70ca165f42c98db6a8->m_frame.f_lineno = 1;\n {\n PyObject *module = PyImport_ImportModule(\"os\");\n if (likely( module != NULL ))\n {\n tmp_called_instance_4 = PyObject_GetAttr( module, const_str_plain_environ );\n }\n else\n {\n tmp_called_instance_4 = NULL;\n }\n }\n\n if ( tmp_called_instance_4 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n Py_DECREF( tmp_assign_source_3 );\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n frame_61b49fd0c6a37a70ca165f42c98db6a8->m_frame.f_lineno = 1;\n tmp_list_element_1 = CALL_METHOD_WITH_ARGS2( tmp_called_instance_4, const_str_plain_get, &PyTuple_GET_ITEM( const_tuple_f37e9448a2e04decb7f95c5d37fa2ec4_tuple, 0 ) );\n\n if ( tmp_list_element_1 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n Py_DECREF( tmp_assign_source_3 );\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n PyList_SET_ITEM( tmp_assign_source_3, 4, tmp_list_element_1 );\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain___path__, tmp_assign_source_3 );\n tmp_assign_source_4 = metapath_based_loader;\n UPDATE_STRING_DICT0( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain___loader__, tmp_assign_source_4 );\n frame_61b49fd0c6a37a70ca165f42c98db6a8->m_frame.f_lineno = 1;\n {\n PyObject *module = PyImport_ImportModule(\"importlib._bootstrap\");\n if (likely( module != NULL ))\n {\n tmp_called_name_5 = PyObject_GetAttr( module, const_str_plain_ModuleSpec );\n }\n else\n {\n tmp_called_name_5 = NULL;\n }\n }\n\n if ( tmp_called_name_5 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n tmp_args_element_name_8 = const_str_digest_4e7e693e251a89f57ec4f0dd4f537b0c;\n tmp_args_element_name_9 = metapath_based_loader;\n frame_61b49fd0c6a37a70ca165f42c98db6a8->m_frame.f_lineno = 1;\n {\n PyObject *call_args[] = { tmp_args_element_name_8, tmp_args_element_name_9 };\n tmp_assign_source_5 = CALL_FUNCTION_WITH_ARGS2( tmp_called_name_5, call_args );\n }\n\n if ( tmp_assign_source_5 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain___spec__, tmp_assign_source_5 );\n tmp_assign_source_6 = Py_None;\n UPDATE_STRING_DICT0( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain___cached__, tmp_assign_source_6 );\n tmp_assign_source_7 = const_str_digest_4e7e693e251a89f57ec4f0dd4f537b0c;\n UPDATE_STRING_DICT0( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain___package__, tmp_assign_source_7 );\n tmp_name_name_1 = const_str_plain_base;\n tmp_globals_name_1 = (PyObject *)moduledict_django$db$models$functions;\n tmp_locals_name_1 = Py_None;\n tmp_fromlist_name_1 = const_tuple_a57d7a35df18217b92792bce665af9a6_tuple;\n tmp_level_name_1 = const_int_pos_1;\n frame_61b49fd0c6a37a70ca165f42c98db6a8->m_frame.f_lineno = 1;\n tmp_assign_source_8 = IMPORT_MODULE5( tmp_name_name_1, tmp_globals_name_1, tmp_locals_name_1, tmp_fromlist_name_1, tmp_level_name_1 );\n if ( tmp_assign_source_8 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 1;\n\n goto frame_exception_exit_1;\n }\n assert( tmp_import_from_1__module == NULL );\n tmp_import_from_1__module = tmp_assign_source_8;\n\n \/\/ Tried code:\n tmp_import_name_from_1 = tmp_import_from_1__module;\n\n CHECK_OBJECT( tmp_import_name_from_1 );\n tmp_assign_source_9 = IMPORT_NAME( tmp_import_name_from_1, const_str_plain_Cast );\n if ( tmp_assign_source_9 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 1;\n\n goto try_except_handler_1;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_Cast, tmp_assign_source_9 );\n tmp_import_name_from_2 = tmp_import_from_1__module;\n\n CHECK_OBJECT( tmp_import_name_from_2 );\n tmp_assign_source_10 = IMPORT_NAME( tmp_import_name_from_2, const_str_plain_Coalesce );\n if ( tmp_assign_source_10 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 1;\n\n goto try_except_handler_1;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_Coalesce, tmp_assign_source_10 );\n tmp_import_name_from_3 = tmp_import_from_1__module;\n\n CHECK_OBJECT( tmp_import_name_from_3 );\n tmp_assign_source_11 = IMPORT_NAME( tmp_import_name_from_3, const_str_plain_Concat );\n if ( tmp_assign_source_11 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 1;\n\n goto try_except_handler_1;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_Concat, tmp_assign_source_11 );\n tmp_import_name_from_4 = tmp_import_from_1__module;\n\n CHECK_OBJECT( tmp_import_name_from_4 );\n tmp_assign_source_12 = IMPORT_NAME( tmp_import_name_from_4, const_str_plain_ConcatPair );\n if ( tmp_assign_source_12 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 1;\n\n goto try_except_handler_1;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_ConcatPair, tmp_assign_source_12 );\n tmp_import_name_from_5 = tmp_import_from_1__module;\n\n CHECK_OBJECT( tmp_import_name_from_5 );\n tmp_assign_source_13 = IMPORT_NAME( tmp_import_name_from_5, const_str_plain_Greatest );\n if ( tmp_assign_source_13 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 1;\n\n goto try_except_handler_1;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_Greatest, tmp_assign_source_13 );\n tmp_import_name_from_6 = tmp_import_from_1__module;\n\n CHECK_OBJECT( tmp_import_name_from_6 );\n tmp_assign_source_14 = IMPORT_NAME( tmp_import_name_from_6, const_str_plain_Least );\n if ( tmp_assign_source_14 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 1;\n\n goto try_except_handler_1;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_Least, tmp_assign_source_14 );\n tmp_import_name_from_7 = tmp_import_from_1__module;\n\n CHECK_OBJECT( tmp_import_name_from_7 );\n tmp_assign_source_15 = IMPORT_NAME( tmp_import_name_from_7, const_str_plain_Length );\n if ( tmp_assign_source_15 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 1;\n\n goto try_except_handler_1;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_Length, tmp_assign_source_15 );\n tmp_import_name_from_8 = tmp_import_from_1__module;\n\n CHECK_OBJECT( tmp_import_name_from_8 );\n tmp_assign_source_16 = IMPORT_NAME( tmp_import_name_from_8, const_str_plain_Lower );\n if ( tmp_assign_source_16 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 1;\n\n goto try_except_handler_1;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_Lower, tmp_assign_source_16 );\n tmp_import_name_from_9 = tmp_import_from_1__module;\n\n CHECK_OBJECT( tmp_import_name_from_9 );\n tmp_assign_source_17 = IMPORT_NAME( tmp_import_name_from_9, const_str_plain_Now );\n if ( tmp_assign_source_17 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 1;\n\n goto try_except_handler_1;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_Now, tmp_assign_source_17 );\n tmp_import_name_from_10 = tmp_import_from_1__module;\n\n CHECK_OBJECT( tmp_import_name_from_10 );\n tmp_assign_source_18 = IMPORT_NAME( tmp_import_name_from_10, const_str_plain_Substr );\n if ( tmp_assign_source_18 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 1;\n\n goto try_except_handler_1;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_Substr, tmp_assign_source_18 );\n tmp_import_name_from_11 = tmp_import_from_1__module;\n\n CHECK_OBJECT( tmp_import_name_from_11 );\n tmp_assign_source_19 = IMPORT_NAME( tmp_import_name_from_11, const_str_plain_Upper );\n if ( tmp_assign_source_19 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 1;\n\n goto try_except_handler_1;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_Upper, tmp_assign_source_19 );\n goto try_end_1;\n \/\/ Exception handler code:\n try_except_handler_1:;\n exception_keeper_type_1 = exception_type;\n exception_keeper_value_1 = exception_value;\n exception_keeper_tb_1 = exception_tb;\n exception_keeper_lineno_1 = exception_lineno;\n exception_type = NULL;\n exception_value = NULL;\n exception_tb = NULL;\n exception_lineno = 0;\n\n Py_XDECREF( tmp_import_from_1__module );\n tmp_import_from_1__module = NULL;\n\n \/\/ Re-raise.\n exception_type = exception_keeper_type_1;\n exception_value = exception_keeper_value_1;\n exception_tb = exception_keeper_tb_1;\n exception_lineno = exception_keeper_lineno_1;\n\n goto frame_exception_exit_1;\n \/\/ End of try:\n try_end_1:;\n Py_XDECREF( tmp_import_from_1__module );\n tmp_import_from_1__module = NULL;\n\n tmp_name_name_2 = const_str_plain_datetime;\n tmp_globals_name_2 = (PyObject *)moduledict_django$db$models$functions;\n tmp_locals_name_2 = Py_None;\n tmp_fromlist_name_2 = const_tuple_ae54af5000b7d151d08db7b05d852532_tuple;\n tmp_level_name_2 = const_int_pos_1;\n frame_61b49fd0c6a37a70ca165f42c98db6a8->m_frame.f_lineno = 5;\n tmp_assign_source_20 = IMPORT_MODULE5( tmp_name_name_2, tmp_globals_name_2, tmp_locals_name_2, tmp_fromlist_name_2, tmp_level_name_2 );\n if ( tmp_assign_source_20 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 5;\n\n goto frame_exception_exit_1;\n }\n assert( tmp_import_from_2__module == NULL );\n tmp_import_from_2__module = tmp_assign_source_20;\n\n \/\/ Tried code:\n tmp_import_name_from_12 = tmp_import_from_2__module;\n\n CHECK_OBJECT( tmp_import_name_from_12 );\n tmp_assign_source_21 = IMPORT_NAME( tmp_import_name_from_12, const_str_plain_Extract );\n if ( tmp_assign_source_21 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 5;\n\n goto try_except_handler_2;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_Extract, tmp_assign_source_21 );\n tmp_import_name_from_13 = tmp_import_from_2__module;\n\n CHECK_OBJECT( tmp_import_name_from_13 );\n tmp_assign_source_22 = IMPORT_NAME( tmp_import_name_from_13, const_str_plain_ExtractDay );\n if ( tmp_assign_source_22 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 5;\n\n goto try_except_handler_2;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_ExtractDay, tmp_assign_source_22 );\n tmp_import_name_from_14 = tmp_import_from_2__module;\n\n CHECK_OBJECT( tmp_import_name_from_14 );\n tmp_assign_source_23 = IMPORT_NAME( tmp_import_name_from_14, const_str_plain_ExtractHour );\n if ( tmp_assign_source_23 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 5;\n\n goto try_except_handler_2;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_ExtractHour, tmp_assign_source_23 );\n tmp_import_name_from_15 = tmp_import_from_2__module;\n\n CHECK_OBJECT( tmp_import_name_from_15 );\n tmp_assign_source_24 = IMPORT_NAME( tmp_import_name_from_15, const_str_plain_ExtractMinute );\n if ( tmp_assign_source_24 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 5;\n\n goto try_except_handler_2;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_ExtractMinute, tmp_assign_source_24 );\n tmp_import_name_from_16 = tmp_import_from_2__module;\n\n CHECK_OBJECT( tmp_import_name_from_16 );\n tmp_assign_source_25 = IMPORT_NAME( tmp_import_name_from_16, const_str_plain_ExtractMonth );\n if ( tmp_assign_source_25 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 5;\n\n goto try_except_handler_2;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_ExtractMonth, tmp_assign_source_25 );\n tmp_import_name_from_17 = tmp_import_from_2__module;\n\n CHECK_OBJECT( tmp_import_name_from_17 );\n tmp_assign_source_26 = IMPORT_NAME( tmp_import_name_from_17, const_str_plain_ExtractSecond );\n if ( tmp_assign_source_26 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 5;\n\n goto try_except_handler_2;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_ExtractSecond, tmp_assign_source_26 );\n tmp_import_name_from_18 = tmp_import_from_2__module;\n\n CHECK_OBJECT( tmp_import_name_from_18 );\n tmp_assign_source_27 = IMPORT_NAME( tmp_import_name_from_18, const_str_plain_ExtractWeek );\n if ( tmp_assign_source_27 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 5;\n\n goto try_except_handler_2;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_ExtractWeek, tmp_assign_source_27 );\n tmp_import_name_from_19 = tmp_import_from_2__module;\n\n CHECK_OBJECT( tmp_import_name_from_19 );\n tmp_assign_source_28 = IMPORT_NAME( tmp_import_name_from_19, const_str_plain_ExtractWeekDay );\n if ( tmp_assign_source_28 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 5;\n\n goto try_except_handler_2;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_ExtractWeekDay, tmp_assign_source_28 );\n tmp_import_name_from_20 = tmp_import_from_2__module;\n\n CHECK_OBJECT( tmp_import_name_from_20 );\n tmp_assign_source_29 = IMPORT_NAME( tmp_import_name_from_20, const_str_plain_ExtractYear );\n if ( tmp_assign_source_29 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 5;\n\n goto try_except_handler_2;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_ExtractYear, tmp_assign_source_29 );\n tmp_import_name_from_21 = tmp_import_from_2__module;\n\n CHECK_OBJECT( tmp_import_name_from_21 );\n tmp_assign_source_30 = IMPORT_NAME( tmp_import_name_from_21, const_str_plain_Trunc );\n if ( tmp_assign_source_30 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 5;\n\n goto try_except_handler_2;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_Trunc, tmp_assign_source_30 );\n tmp_import_name_from_22 = tmp_import_from_2__module;\n\n CHECK_OBJECT( tmp_import_name_from_22 );\n tmp_assign_source_31 = IMPORT_NAME( tmp_import_name_from_22, const_str_plain_TruncDate );\n if ( tmp_assign_source_31 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 5;\n\n goto try_except_handler_2;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_TruncDate, tmp_assign_source_31 );\n tmp_import_name_from_23 = tmp_import_from_2__module;\n\n CHECK_OBJECT( tmp_import_name_from_23 );\n tmp_assign_source_32 = IMPORT_NAME( tmp_import_name_from_23, const_str_plain_TruncDay );\n if ( tmp_assign_source_32 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 5;\n\n goto try_except_handler_2;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_TruncDay, tmp_assign_source_32 );\n tmp_import_name_from_24 = tmp_import_from_2__module;\n\n CHECK_OBJECT( tmp_import_name_from_24 );\n tmp_assign_source_33 = IMPORT_NAME( tmp_import_name_from_24, const_str_plain_TruncHour );\n if ( tmp_assign_source_33 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 5;\n\n goto try_except_handler_2;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_TruncHour, tmp_assign_source_33 );\n tmp_import_name_from_25 = tmp_import_from_2__module;\n\n CHECK_OBJECT( tmp_import_name_from_25 );\n tmp_assign_source_34 = IMPORT_NAME( tmp_import_name_from_25, const_str_plain_TruncMinute );\n if ( tmp_assign_source_34 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 5;\n\n goto try_except_handler_2;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_TruncMinute, tmp_assign_source_34 );\n tmp_import_name_from_26 = tmp_import_from_2__module;\n\n CHECK_OBJECT( tmp_import_name_from_26 );\n tmp_assign_source_35 = IMPORT_NAME( tmp_import_name_from_26, const_str_plain_TruncMonth );\n if ( tmp_assign_source_35 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 5;\n\n goto try_except_handler_2;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_TruncMonth, tmp_assign_source_35 );\n tmp_import_name_from_27 = tmp_import_from_2__module;\n\n CHECK_OBJECT( tmp_import_name_from_27 );\n tmp_assign_source_36 = IMPORT_NAME( tmp_import_name_from_27, const_str_plain_TruncSecond );\n if ( tmp_assign_source_36 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 5;\n\n goto try_except_handler_2;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_TruncSecond, tmp_assign_source_36 );\n tmp_import_name_from_28 = tmp_import_from_2__module;\n\n CHECK_OBJECT( tmp_import_name_from_28 );\n tmp_assign_source_37 = IMPORT_NAME( tmp_import_name_from_28, const_str_plain_TruncTime );\n if ( tmp_assign_source_37 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 5;\n\n goto try_except_handler_2;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_TruncTime, tmp_assign_source_37 );\n tmp_import_name_from_29 = tmp_import_from_2__module;\n\n CHECK_OBJECT( tmp_import_name_from_29 );\n tmp_assign_source_38 = IMPORT_NAME( tmp_import_name_from_29, const_str_plain_TruncYear );\n if ( tmp_assign_source_38 == NULL )\n {\n assert( ERROR_OCCURRED() );\n\n FETCH_ERROR_OCCURRED( &exception_type, &exception_value, &exception_tb );\n\n\n exception_lineno = 5;\n\n goto try_except_handler_2;\n }\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain_TruncYear, tmp_assign_source_38 );\n goto try_end_2;\n \/\/ Exception handler code:\n try_except_handler_2:;\n exception_keeper_type_2 = exception_type;\n exception_keeper_value_2 = exception_value;\n exception_keeper_tb_2 = exception_tb;\n exception_keeper_lineno_2 = exception_lineno;\n exception_type = NULL;\n exception_value = NULL;\n exception_tb = NULL;\n exception_lineno = 0;\n\n Py_XDECREF( tmp_import_from_2__module );\n tmp_import_from_2__module = NULL;\n\n \/\/ Re-raise.\n exception_type = exception_keeper_type_2;\n exception_value = exception_keeper_value_2;\n exception_tb = exception_keeper_tb_2;\n exception_lineno = exception_keeper_lineno_2;\n\n goto frame_exception_exit_1;\n \/\/ End of try:\n try_end_2:;\n\n \/\/ Restore frame exception if necessary.\n#if 0\n RESTORE_FRAME_EXCEPTION( frame_61b49fd0c6a37a70ca165f42c98db6a8 );\n#endif\n popFrameStack();\n\n assertFrameObject( frame_61b49fd0c6a37a70ca165f42c98db6a8 );\n\n goto frame_no_exception_1;\n frame_exception_exit_1:;\n#if 0\n RESTORE_FRAME_EXCEPTION( frame_61b49fd0c6a37a70ca165f42c98db6a8 );\n#endif\n\n if ( exception_tb == NULL )\n {\n exception_tb = MAKE_TRACEBACK( frame_61b49fd0c6a37a70ca165f42c98db6a8, exception_lineno );\n }\n else if ( exception_tb->tb_frame != &frame_61b49fd0c6a37a70ca165f42c98db6a8->m_frame )\n {\n exception_tb = ADD_TRACEBACK( exception_tb, frame_61b49fd0c6a37a70ca165f42c98db6a8, exception_lineno );\n }\n\n \/\/ Put the previous frame back on top.\n popFrameStack();\n\n \/\/ Return the error.\n goto module_exception_exit;\n frame_no_exception_1:;\n Py_XDECREF( tmp_import_from_2__module );\n tmp_import_from_2__module = NULL;\n\n tmp_assign_source_39 = LIST_COPY( const_list_6be8e1a18107e0f2e8d82c61e79fe2e7_list );\n UPDATE_STRING_DICT1( moduledict_django$db$models$functions, (Nuitka_StringObject *)const_str_plain___all__, tmp_assign_source_39 );\n\n return MOD_RETURN_VALUE( module_django$db$models$functions );\n module_exception_exit:\n RESTORE_ERROR_OCCURRED( exception_type, exception_value, exception_tb );\n return MOD_RETURN_VALUE( NULL );\n}\n","avg_line_length":37.5023163468,"max_line_length":193,"alphanum_fraction":0.7437087495,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":1101,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":6.0,"content":"\/* Copyright (C) 2010-2019, The Regents of The University of Michigan.\n All rights reserved.\n\n This software was developed as part of the The Vulcan project in the Intelligent Robotics Lab\n under the direction of Benjamin Kuipers, kuipers@umich.edu. Use of this code is governed by an\n MIT-style License that can be found at \"https:\/\/github.com\/h2ssh\/Vulcan\".\n*\/\n\n\n\/**\n* \\file map_optimizer.cpp\n* \\author Collin Johnson\n*\n* Definition of create_map_optimizer factory.\n*\/\n\n#include \n#include \n#include \n#include \n\nnamespace vulcan\n{\nnamespace hssh\n{\n\nstd::unique_ptr create_map_optimizer(const std::string& type, const map_optimizer_params_t& params)\n{\n if(type == LEV_MAR_OPTIMIZER_TYPE)\n {\n return std::unique_ptr(new LevMarOptimizer(params.levMarParams));\n }\n else\n {\n std::cerr<<\"ERROR:Unknown MapOptimizer type: \"<();\n}\n\n}\n}\n","avg_line_length":25.0227272727,"max_line_length":113,"alphanum_fraction":0.7284287012,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":4150,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["BSD-3-Clause"],"max_stars_count":1.0,"content":"\/****************************************************************************\n *\n * Copyright (c) 2015 Vijay Venkatraman. All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n *\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in\n * the documentation and\/or other materials provided with the\n * distribution.\n * 3. Neither the name PX4 nor the names of its contributors may be\n * used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS\n * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE\n * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,\n * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS\n * OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED\n * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\n ****************************************************************************\/\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n\n#include \n#include \n#include \n\n#include \n\n#include \n#include \"px4muorb.h\"\n\n\/\/#define SHMEM_DEBUG\nvoid update_to_shmem(param_t param, union param_value_u value);\nint update_from_shmem(param_t param, union param_value_u *value);\nvoid update_index_from_shmem(void);\nuint64_t update_from_shmem_prev_time = 0, update_from_shmem_current_time = 0;\nextern unsigned char *adsp_changed_index;\n\nstruct param_wbuf_s {\n\tunion param_value_u val;\n\tparam_t param;\n\tbool unsaved;\n};\n\n\/*update value and param's change bit in shared memory*\/\nvoid update_to_shmem(param_t param, union param_value_u value)\n{\n\tif (px4muorb_param_update_to_shmem(param, (unsigned char *) &value, sizeof(value))) {\n\t\tPX4_ERR(\"krait update param %u failed\", param);\n\t}\n}\n\nvoid update_index_from_shmem(void)\n{\n\tif (!adsp_changed_index) {\n\t\tPX4_ERR(\"%s no param buffer\", __FUNCTION__);\n\t\treturn;\n\t}\n\n\tpx4muorb_param_update_index_from_shmem(adsp_changed_index, PARAM_BUFFER_SIZE);\n}\n\nstatic void update_value_from_shmem(param_t param, union param_value_u *value)\n{\n\tif (px4muorb_param_update_value_from_shmem(param, (unsigned char *) value, sizeof(union param_value_u))) {\n\t\tPX4_ERR(\"%s get param failed\", __FUNCTION__);\n\t}\n}\n\nint update_from_shmem(param_t param, union param_value_u *value)\n{\n\tunsigned int byte_changed, bit_changed;\n\tunsigned int retval = 0;\n\n\tif (!adsp_changed_index) {\n\t\tPX4_ERR(\"%s no param buffer\", __FUNCTION__);\n\t\treturn 0;\n\t}\n\n\tupdate_from_shmem_current_time = hrt_absolute_time();\n\n\tif ((update_from_shmem_current_time - update_from_shmem_prev_time)\n\t > 1000000) { \/\/update every 1 second\n\t\tupdate_from_shmem_prev_time = update_from_shmem_current_time;\n\t\tupdate_index_from_shmem();\n\t}\n\n\tbyte_changed = param \/ 8;\n\tbit_changed = 1 << param % 8;\n\n\tif (adsp_changed_index[byte_changed] & bit_changed) {\n\t\tupdate_value_from_shmem(param, value);\n\t\tadsp_changed_index[byte_changed] &= ~bit_changed; \/\/clear the bit\n\t\tretval = 1;\n\t}\n\n\t\/\/else {PX4_INFO(\"no change to param %s\", param_name(param));}\n\n\tPX4_DEBUG(\"%s %d bit on adsp index[%d]\",\n\t\t (retval) ? \"cleared\" : \"unchanged\", bit_changed, byte_changed);\n\n\treturn retval;\n}\n","avg_line_length":32.421875,"max_line_length":107,"alphanum_fraction":0.7277108434,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":78625,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":null,"content":"\/*\n * MRustC - Rust Compiler\n * - By John Hodge (Mutabah\/thePowersGang)\n *\n * expand\/mod.cpp\n * - Expand pass core code\n *\/\n#include \n#include \n#include \n#include \n#include \n#include \"..\/macro_rules\/macro_rules.hpp\"\n#include \"..\/parse\/common.hpp\" \/\/ For reparse from macros\n#include \n#include \/\/ For macro lookup\n#include \"cfg.hpp\"\n#include \"common.hpp\"\n#include \"..\/resolve\/common.hpp\"\n#include \"proc_macro.hpp\"\n#include \"..\/parse\/ttstream.hpp\"\n\n#define MAX_MACRO_RECURSION 200\n\nDecoratorDef* g_decorators_list = nullptr;\nMacroDef* g_macros_list = nullptr;\n::std::map< RcString, ::std::unique_ptr > g_decorators;\n::std::map< RcString, ::std::unique_ptr > g_macros;\n\nvoid Expand_Attrs(const ::AST::AttributeList& attrs, AttrStage stage, ::std::function f);\nvoid Expand_Mod(::AST::Crate& crate, LList modstack, ::AST::AbsolutePath modpath, ::AST::Module& mod, unsigned int first_item = 0);\nvoid Expand_Expr(::AST::Crate& crate, LList modstack, ::AST::ExprNodeP& node);\nvoid Expand_Expr(::AST::Crate& crate, LList modstack, AST::Expr& node);\nvoid Expand_Expr(::AST::Crate& crate, LList modstack, ::std::shared_ptr& node);\nvoid Expand_Path(::AST::Crate& crate, LList modstack, ::AST::Module& mod, ::AST::Path& p);\n\nvoid Register_Synext_Decorator(::std::string name, ::std::unique_ptr handler) {\n g_decorators.insert(::std::make_pair( RcString::new_interned(name), mv$(handler) )); \n}\nvoid Register_Synext_Macro(::std::string name, ::std::unique_ptr handler) {\n g_macros.insert(::std::make_pair( RcString::new_interned(name), mv$(handler) ));\n}\nvoid Register_Synext_Decorator_Static(DecoratorDef* def) {\n def->prev = g_decorators_list;\n g_decorators_list = def;\n}\nvoid Register_Synext_Macro_Static(MacroDef* def) {\n def->prev = g_macros_list;\n g_macros_list = def;\n}\n\nvoid Expand_Init()\n{\n \/\/ TODO: Initialise all macros here.\n void Expand_init_assert(); Expand_init_assert();\n void Expand_init_std_prelude(); Expand_init_std_prelude();\n void Expand_init_panic(); Expand_init_panic();\n\n \/\/ Fill macro\/decorator map from init list\n while(g_decorators_list)\n {\n g_decorators.insert(::std::make_pair( RcString::new_interned(g_decorators_list->name), mv$(g_decorators_list->def) ));\n g_decorators_list = g_decorators_list->prev;\n }\n while(g_macros_list)\n {\n g_macros.insert(::std::make_pair(RcString::new_interned(g_macros_list->name), mv$(g_macros_list->def)));\n g_macros_list = g_macros_list->prev;\n }\n}\n\nvoid ExpandDecorator::unexpected(const Span& sp, const AST::Attribute& mi, const char* loc_str) const\n{\n WARNING(sp, W0000, \"Unexpected attribute \" << mi.name() << \" on \" << loc_str);\n}\n\n\nExpandProcMacro* Expand_FindProcMacro(const RcString& name)\n{\n auto it = g_macros.find(name);\n if(it == g_macros.end())\n return nullptr;\n else\n return it->second.get();\n}\n\nvoid Expand_Attr(const Span& sp, const ::AST::Attribute& a, AttrStage stage, ::std::function f)\n{\n bool found = false;\n for( auto& d : g_decorators ) {\n if( a.name() == d.first ) {\n DEBUG(\"#[\" << d.first << \"] \" << (int)d.second->stage() << \"-\" << (int)stage);\n if( d.second->stage() == stage ) {\n f(sp, *d.second, a);\n \/\/ TODO: Early return?\n \/\/ TODO: Annotate the attribute as having been handled\n }\n found = true;\n }\n }\n if( !found ) {\n \/\/ TODO: Create no-op handlers for a whole heap of attributes\n \/\/ - There's a LOT\n \/\/WARNING(sp, W0000, \"Unknown attribute #[\" << a.name() << \"]\");\n }\n}\nvoid Expand_Attrs(const ::AST::AttributeList& attrs, AttrStage stage, ::std::function f)\n{\n for( auto& a : attrs.m_items )\n {\n Expand_Attr(a.span(), a, stage, f);\n }\n}\nvoid Expand_Attrs_CfgAttr(AST::AttributeList& attrs)\n{\n for(auto it = attrs.m_items.begin(); it != attrs.m_items.end(); )\n {\n auto& a = *it;\n if( a.name() == \"cfg_attr\" ) {\n if( check_cfg(a.span(), a.items().at(0)) ) {\n auto inner_attr = mv$(a.items().at(1));\n a = mv$(inner_attr);\n ++ it;\n }\n else {\n it = attrs.m_items.erase(it);\n }\n }\n else {\n ++ it;\n }\n }\n}\nvoid Expand_Attrs(const ::AST::AttributeList& attrs, AttrStage stage, ::AST::Crate& crate, const ::AST::AbsolutePath& path, ::AST::Module& mod, ::AST::Item& item)\n{\n Expand_Attrs(attrs, stage, [&](const auto& sp, const auto& d, const auto& a){\n if(!item.is_None()) {\n \/\/ TODO: Pass attributes _after_ this attribute\n d.handle(sp, a, crate, path, mod, slice(&a, &attrs.m_items.back() - &a + 1), item);\n }\n });\n}\nvoid Expand_Attrs(const ::AST::AttributeList& attrs, AttrStage stage, ::AST::Crate& crate, const ::AST::AbsolutePath& path, ::AST::Trait& trait, ::AST::Item& item)\n{\n Expand_Attrs(attrs, stage, [&](const auto& sp, const auto& d, const auto& a){\n if(!item.is_None()) {\n \/\/ TODO: Pass attributes _after_ this attribute\n d.handle(sp, a, crate, path, trait, slice(&a, &attrs.m_items.back() - &a + 1), item);\n }\n });\n}\nvoid Expand_Attrs(const ::AST::AttributeList& attrs, AttrStage stage, ::AST::Crate& crate, ::AST::Impl& impl, const RcString& name, ::AST::Item& item)\n{\n Expand_Attrs(attrs, stage, [&](const auto& sp, const auto& d, const auto& a){\n if(!item.is_None()) {\n \/\/ TODO: Pass attributes _after_ this attribute\n d.handle(sp, a, crate, impl, name, slice(&a, &attrs.m_items.back() - &a + 1), item);\n }\n });\n}\nvoid Expand_Attrs(const ::AST::AttributeList& attrs, AttrStage stage, ::AST::Crate& crate, ::AST::Module& mod, ::AST::ImplDef& impl)\n{\n Expand_Attrs(attrs, stage, [&](const auto& sp, const auto& d, const auto& a){ d.handle(sp, a, crate, mod, impl); });\n}\n\nMacroRef Expand_LookupMacro(const Span& mi_span, const ::AST::Crate& crate, LList modstack, const AST::Path& path)\n{\n ASSERT_BUG(mi_span, path.size() > 0, \"Path should have nodes: \" << path);\n\n if( path.is_trivial() )\n {\n const auto& name = path.as_trivial();\n \/\/ 1. Search compiler-provided proc macros\n if(auto* pm = Expand_FindProcMacro(name))\n {\n DEBUG(\"Found builtin\");\n return MacroRef(pm);\n }\n\n \/\/ Iterate up the module tree, using the first located macro\n for(const auto* ll = &modstack; ll; ll = ll->m_prev)\n {\n const auto& mac_mod = *ll->m_item;\n DEBUG(\"Searching in \" << mac_mod.path());\n for( const auto& mr : reverse(mac_mod.macros()) )\n {\n if( mr.name == name )\n {\n DEBUG(mac_mod.path() << \"::\" << mr.name << \" - Defined\");\n return MacroRef(&*mr.data);\n }\n }\n\n \/\/ Find the last macro of this name (allows later #[macro_use] definitions to override)\n MacroRef rv;\n for( const auto& mri : mac_mod.macro_imports_res() )\n {\n \/\/DEBUG(\"- \" << mri.name);\n if( mri.name == name )\n {\n DEBUG(\"?::\" << mri.name << \" - Imported\");\n\n rv = mri.data.clone();\n }\n }\n if( !rv.is_None() )\n {\n return rv;\n }\n }\n if( path.m_class.is_Local() )\n {\n DEBUG(\"Local path not resolved?\");\n return MacroRef();\n }\n }\n\n \/\/ HACK: If the crate name is empty, look up builtins\n if( path.is_absolute() && path.m_class.as_Absolute().crate == \"\" && path.nodes().size() == 1 )\n {\n const auto& name = path.nodes()[0].name();\n if(auto* pm = Expand_FindProcMacro(name))\n {\n return MacroRef(pm);\n }\n }\n\n \/\/ Resolve the path, following use statements (if required)\n \/\/ - Only mr_ptr matters, as proc_mac is about builtins\n auto rv = Resolve_Lookup_Macro(mi_span, crate, modstack.m_item->path(), path, \/*out_path=*\/nullptr);\n TU_MATCH_HDRA( (rv), { )\n TU_ARMA(None, _e)\n return MacroRef();\n TU_ARMA(InternalMacro, pm)\n return pm;\n TU_ARMA(ProcMacro, pm)\n return pm;\n TU_ARMA(MacroRules, p)\n return p;\n }\n return MacroRef();\n}\n\n::std::unique_ptr Expand_Macro_Inner(\n const ::AST::Crate& crate, LList modstack, ::AST::Module& mod,\n Span mi_span, const AST::Path& path, const RcString& input_ident, TokenTree& input_tt\n )\n{\n if( !path.is_valid() ) {\n return ::std::unique_ptr();\n }\n\n TRACE_FUNCTION_F(\"Searching for macro \" << path);\n\n \/\/ Find the macro\n auto mac = Expand_LookupMacro(mi_span, crate, modstack, path);\n if( mac.is_MacroRules() )\n {\n \/\/ TODO: If `mr_ptr` is tagged with #[rustc_builtin_macro], look for a matching entry in `g_macros`\n }\n\n TU_MATCH_HDRA( (mac), {)\n TU_ARMA(None, e) {\n ERROR(mi_span, E0000, \"Unknown macro \" << path);\n }\n TU_ARMA(ExternalProcMacro, proc_mac) {\n ::std::vector mac_path;\n mac_path.push_back(proc_mac->path.m_crate_name);\n mac_path.insert(mac_path.end(), proc_mac->path.m_components.begin(), proc_mac->path.m_components.end());\n return ProcMacro_Invoke(mi_span, crate, mac_path, input_tt);\n }\n TU_ARMA(BuiltinProcMacro, proc_mac) {\n auto e = input_ident == \"\"\n ? proc_mac->expand(mi_span, crate, input_tt, mod)\n : proc_mac->expand_ident(mi_span, crate, input_ident, input_tt, mod)\n ;\n return e;\n }\n TU_ARMA(MacroRules, mr_ptr) {\n if( input_ident != \"\" )\n ERROR(mi_span, E0000, \"macro_rules! macros can't take an ident\");\n\n DEBUG(\"Invoking macro_rules \" << path << \" \" << mr_ptr);\n auto e = Macro_InvokeRules(path.is_trivial() ? path.as_trivial().c_str() : FMT(path).c_str(), *mr_ptr, mi_span, mv$(input_tt), crate, mod);\n input_tt = TokenTree();\n return e;\n }\n }\n throw \"\";\n}\n::std::unique_ptr Expand_Macro(\n const ::AST::Crate& crate, LList modstack, ::AST::Module& mod,\n Span mi_span, const AST::Path& name, const RcString& input_ident, TokenTree& input_tt\n )\n{\n auto rv = Expand_Macro_Inner(crate, modstack, mod, mi_span, name, input_ident, input_tt);\n assert(rv);\n rv->parse_state().crate = &crate;\n rv->parse_state().module = &mod;\n return rv;\n}\n::std::unique_ptr Expand_Macro(const ::AST::Crate& crate, LList modstack, ::AST::Module& mod, ::AST::MacroInvocation& mi)\n{\n return Expand_Macro(crate, modstack, mod, mi.span(), mi.path(), mi.input_ident(), mi.input_tt());\n}\n\nvoid Expand_Pattern(::AST::Crate& crate, LList modstack, ::AST::Module& mod, ::AST::Pattern& pat, bool is_refutable)\n{\n TU_MATCH(::AST::Pattern::Data, (pat.data()), (e),\n (MaybeBind,\n ),\n (Macro,\n const auto span = e.inv->span();\n\n auto tt = Expand_Macro(crate, modstack, mod, *e.inv);\n if( ! tt ) {\n ERROR(span, E0000, \"Macro in pattern didn't expand to anything\");\n }\n auto& lex = *tt;\n auto newpat = Parse_Pattern(lex);\n if( LOOK_AHEAD(lex) != TOK_EOF ) {\n ERROR(span, E0000, \"Trailing tokens in macro expansion\");\n }\n\n if( pat.binding().is_valid() ) {\n if( newpat.binding().is_valid() )\n ERROR(span, E0000, \"Macro expansion provided a binding, but one already present\");\n newpat.binding() = mv$(pat.binding());\n }\n\n pat = mv$(newpat);\n Expand_Pattern(crate, modstack, mod, pat, is_refutable);\n ),\n (Any,\n ),\n (Box,\n Expand_Pattern(crate, modstack, mod, *e.sub, is_refutable);\n ),\n (Ref,\n Expand_Pattern(crate, modstack, mod, *e.sub, is_refutable);\n ),\n (Value,\n \/\/Expand_Expr(crate, modstack, e.start);\n \/\/Expand_Expr(crate, modstack, e.end);\n ),\n (Tuple,\n for(auto& sp : e.start)\n Expand_Pattern(crate, modstack, mod, sp, is_refutable);\n for(auto& sp : e.end)\n Expand_Pattern(crate, modstack, mod, sp, is_refutable);\n ),\n (StructTuple,\n for(auto& sp : e.tup_pat.start)\n Expand_Pattern(crate, modstack, mod, sp, is_refutable);\n for(auto& sp : e.tup_pat.end)\n Expand_Pattern(crate, modstack, mod, sp, is_refutable);\n ),\n (Struct,\n for(auto& sp : e.sub_patterns)\n Expand_Pattern(crate, modstack, mod, sp.second, is_refutable);\n ),\n (Slice,\n for(auto& sp : e.sub_pats)\n Expand_Pattern(crate, modstack, mod, sp, is_refutable);\n ),\n (SplitSlice,\n for(auto& sp : e.leading)\n Expand_Pattern(crate, modstack, mod, sp, is_refutable);\n for(auto& sp : e.trailing)\n Expand_Pattern(crate, modstack, mod, sp, is_refutable);\n ),\n (Or,\n for(auto& sp : e)\n Expand_Pattern(crate, modstack, mod, sp, is_refutable);\n )\n )\n}\n\nvoid Expand_Type(::AST::Crate& crate, LList modstack, ::AST::Module& mod, ::TypeRef& ty)\n{\n TU_MATCH_HDRA( (ty.m_data), {)\n TU_ARMA(None, e) {\n }\n TU_ARMA(Any, e) {\n }\n TU_ARMA(Unit, e) {\n }\n TU_ARMA(Bang, e) {\n }\n TU_ARMA(Macro, e) {\n auto tt = Expand_Macro(crate, modstack, mod, *e.inv);\n if(!tt)\n ERROR(e.inv->span(), E0000, \"Macro invocation didn't yeild any data\");\n auto new_ty = Parse_Type(*tt);\n if( tt->lookahead(0) != TOK_EOF )\n ERROR(e.inv->span(), E0000, \"Extra tokens after parsed type\");\n ty = mv$(new_ty);\n\n Expand_Type(crate, modstack, mod, ty);\n }\n TU_ARMA(Primitive, e) {\n }\n TU_ARMA(Function, e) {\n Type_Function& tf = e.info;\n Expand_Type(crate, modstack, mod, *tf.m_rettype);\n for(auto& st : tf.m_arg_types)\n Expand_Type(crate, modstack, mod, st);\n }\n TU_ARMA(Tuple, e) {\n for(auto& st : e.inner_types)\n Expand_Type(crate, modstack, mod, st);\n }\n TU_ARMA(Borrow, e) {\n Expand_Type(crate, modstack, mod, *e.inner);\n }\n TU_ARMA(Pointer, e) {\n Expand_Type(crate, modstack, mod, *e.inner);\n }\n TU_ARMA(Array, e) {\n Expand_Type(crate, modstack, mod, *e.inner);\n if( e.size ) {\n Expand_Expr(crate, modstack, e.size);\n }\n }\n TU_ARMA(Generic, e) {\n }\n TU_ARMA(Path, e) {\n Expand_Path(crate, modstack, mod, *e);\n }\n TU_ARMA(TraitObject, e) {\n for(auto& p : e.traits)\n {\n \/\/ TODO: p.hrbs? Not needed until types are in those\n Expand_Path(crate, modstack, mod, *p.path);\n }\n }\n TU_ARMA(ErasedType, e) {\n for(auto& p : e.traits)\n {\n \/\/ TODO: p.hrbs?\n Expand_Path(crate, modstack, mod, *p.path);\n }\n }\n }\n}\nvoid Expand_PathParams(::AST::Crate& crate, LList modstack, ::AST::Module& mod, ::AST::PathParams& params)\n{\n for(auto& e : params.m_entries)\n {\n TU_MATCH_HDRA( (e), {)\n TU_ARMA(Null, _) {\n }\n TU_ARMA(Lifetime, _) {\n }\n TU_ARMA(Type, typ) {\n Expand_Type(crate, modstack, mod, typ);\n }\n TU_ARMA(Value, node) {\n Expand_Expr(crate, modstack, node);\n }\n TU_ARMA(AssociatedTyEqual, aty) {\n Expand_Type(crate, modstack, mod, aty.second);\n }\n TU_ARMA(AssociatedTyBound, aty) {\n Expand_Path(crate, modstack, mod, aty.second);\n }\n }\n }\n}\nvoid Expand_Path(::AST::Crate& crate, LList modstack, ::AST::Module& mod, ::AST::Path& p)\n{\n auto expand_nodes = [&](::std::vector<::AST::PathNode>& nodes) {\n for(auto& node : nodes)\n {\n Expand_PathParams(crate, modstack, mod, node.args());\n }\n };\n\n TU_MATCH_HDRA( (p.m_class), {)\n TU_ARMA(Invalid, pe) {\n }\n TU_ARMA(Local, pe) {\n }\n TU_ARMA(Relative, pe) {\n expand_nodes(pe.nodes);\n }\n TU_ARMA(Self, pe) {\n expand_nodes(pe.nodes);\n }\n TU_ARMA(Super, pe) {\n expand_nodes(pe.nodes);\n }\n TU_ARMA(Absolute, pe) {\n expand_nodes(pe.nodes);\n }\n TU_ARMA(UFCS, pe) {\n Expand_Type(crate, modstack, mod, *pe.type);\n if( pe.trait ) {\n Expand_Path(crate, modstack, mod, *pe.trait);\n }\n expand_nodes(pe.nodes);\n }\n }\n}\n\nstruct CExpandExpr:\n public ::AST::NodeVisitor\n{\n ::AST::Crate& crate;\n LList modstack;\n ::AST::ExprNodeP replacement;\n\n \/\/ Stack of `try { ... }` blocks (the string is the loop label for the desugaring)\n ::std::vector m_try_stack;\n unsigned m_try_index = 0;\n\n AST::ExprNode_Block* current_block = nullptr;\n\n CExpandExpr(::AST::Crate& crate, LList ms):\n crate(crate),\n modstack(ms)\n {\n }\n\n ::AST::Module& cur_mod() {\n return *const_cast< ::AST::Module*>(modstack.m_item);\n }\n\n void visit(::AST::ExprNodeP& cnode) {\n if(cnode.get())\n {\n auto attrs = mv$(cnode->attrs());\n Expand_Attrs_CfgAttr(attrs);\n Expand_Attrs(attrs, AttrStage::Pre, [&](const auto& sp, const auto& d, const auto& a){ d.handle(sp, a, this->crate, cnode); });\n if(cnode.get())\n cnode->attrs() = mv$(attrs);\n }\n if(cnode.get())\n {\n cnode->visit(*this);\n \/\/ If the node was a macro, and it was consumed, reset it\n if( auto* n_mac = dynamic_cast(cnode.get()) )\n {\n if( !n_mac->m_path.is_valid() )\n cnode.reset();\n }\n if( this->replacement ) {\n cnode = mv$(this->replacement);\n }\n }\n\n if(cnode.get())\n Expand_Attrs(cnode->attrs(), AttrStage::Post, [&](const auto& sp, const auto& d, const auto& a){ d.handle(sp, a, this->crate, cnode); });\n assert( ! this->replacement );\n }\n void visit_nodelete(const ::AST::ExprNode& parent, ::AST::ExprNodeP& cnode) {\n if( cnode.get() != nullptr )\n {\n this->visit(cnode);\n if(cnode.get() == nullptr)\n ERROR(parent.span(), E0000, \"#[cfg] not allowed in this position\");\n }\n assert( ! this->replacement );\n }\n void visit_vector(::std::vector< ::AST::ExprNodeP >& cnodes) {\n for( auto it = cnodes.begin(); it != cnodes.end(); ) {\n assert( it->get() );\n this->visit(*it);\n if( it->get() == nullptr ) {\n it = cnodes.erase( it );\n }\n else {\n ++ it;\n }\n }\n }\n\n ::AST::ExprNodeP visit_macro(::AST::ExprNode_Macro& node, ::std::vector< ::AST::ExprNodeP>* nodes_out)\n {\n TRACE_FUNCTION_F(node.m_path << \"!\");\n if( !node.m_path.is_valid() ) {\n return ::AST::ExprNodeP();\n }\n\n ::AST::ExprNodeP rv;\n auto& mod = this->cur_mod();\n auto ttl = Expand_Macro( crate, modstack, mod, node.span(), node.m_path, node.m_ident, node.m_tokens );\n if( !ttl.get() )\n {\n \/\/ No expansion\n }\n else\n {\n while( ttl->lookahead(0) != TOK_EOF )\n {\n SET_MODULE( (*ttl), mod );\n\n \/\/ Reparse as expression \/ item\n bool add_silence_if_end = false;\n ::std::shared_ptr< AST::Module> tmp_local_mod;\n auto& local_mod_ptr = (this->current_block ? this->current_block->m_local_mod : tmp_local_mod);\n DEBUG(\"-- Parsing as expression line\");\n auto newexpr = Parse_ExprBlockLine_WithItems(*ttl, local_mod_ptr, add_silence_if_end);\n\n if( tmp_local_mod )\n TODO(node.span(), \"Handle edge case where a macro expansion outside of a _Block creates an item\");\n\n if( newexpr )\n {\n if( nodes_out ) {\n nodes_out->push_back( mv$(newexpr) );\n }\n else {\n assert( !rv );\n rv = mv$(newexpr);\n }\n }\n else\n {\n \/\/ Expansion line just added a new item\n }\n\n if( ttl->lookahead(0) != TOK_EOF )\n {\n if( !nodes_out ) {\n ERROR(node.span(), E0000, \"Unused tokens at the end of macro expansion - \" << ttl->getToken());\n }\n }\n }\n }\n\n if( !nodes_out && !rv )\n {\n ERROR(node.span(), E0000, \"Macro didn't expand to anything\");\n }\n\n node.m_path = AST::Path();\n return mv$(rv);\n }\n\n void visit(::AST::ExprNode_Macro& node) override\n {\n TRACE_FUNCTION_F(\"ExprNode_Macro - name = \" << node.m_path);\n if( !node.m_path.is_valid() ) {\n return ;\n }\n\n replacement = this->visit_macro(node, nullptr);\n\n if( this->replacement )\n {\n DEBUG(\"--- Visiting new node\");\n auto n = mv$(this->replacement);\n this->visit(n);\n if( n )\n {\n assert( !this->replacement );\n this->replacement = mv$(n);\n }\n }\n }\n\n void visit(::AST::ExprNode_Block& node) override {\n unsigned int mod_item_count = 0;\n\n auto prev_modstack = this->modstack;\n if( node.m_local_mod ) {\n this->modstack = LList(&prev_modstack, node.m_local_mod.get());\n }\n\n \/\/ TODO: macro_rules! invocations within the expression list influence this.\n \/\/ > Solution: Defer creation of the local module until during expand.\n if( node.m_local_mod ) {\n Expand_Mod(crate, modstack, node.m_local_mod->path(), *node.m_local_mod);\n mod_item_count = node.m_local_mod->m_items.size();\n }\n\n auto saved = this->current_block;\n this->current_block = &node;\n\n for( auto it = node.m_nodes.begin(); it != node.m_nodes.end(); )\n {\n assert( it->get() );\n\n if( auto* node_mac = dynamic_cast<::AST::ExprNode_Macro*>(it->get()) )\n {\n auto attrs = std::move( (*it)->attrs() );\n Expand_Attrs_CfgAttr( attrs );\n Expand_Attrs(attrs, AttrStage::Pre, [&](const auto& sp, const auto& d, const auto& a){ d.handle(sp, a, this->crate, *it); });\n if( !it->get() ) {\n it = node.m_nodes.erase( it );\n continue ;\n }\n (*it)->attrs() = std::move(attrs);\n\n assert(it->get() == node_mac);\n\n ::std::vector< ::AST::ExprNodeP> new_nodes;\n this->visit_macro(*node_mac, &new_nodes);\n\n it = node.m_nodes.erase(it);\n it = node.m_nodes.insert(it, ::std::make_move_iterator(new_nodes.begin()), ::std::make_move_iterator(new_nodes.end()));\n \/\/ NOTE: Doesn't advance the iterator above, we want to re-visit the new node\n }\n else\n {\n this->visit(*it);\n if( it->get() == nullptr ) {\n it = node.m_nodes.erase( it );\n }\n else {\n ++ it;\n }\n }\n }\n\n this->current_block = saved;\n\n \/\/ HACK! Run Expand_Mod twice on local modules.\n if( node.m_local_mod ) {\n Expand_Mod(crate, modstack, node.m_local_mod->path(), *node.m_local_mod, mod_item_count);\n }\n\n this->modstack = mv$(prev_modstack);\n }\n void visit(::AST::ExprNode_Try& node) override {\n \/\/ Desugar into\n \/\/ ```\n \/\/ loop '#tryNNN {\n \/\/ break '#tryNNN { ... }\n \/\/ }\n \/\/ ```\n \/\/ NOTE: MIR lowering and HIR typecheck need to know to skip these (OR resolve should handle naming all loop blocks)\n m_try_stack.push_back(RcString::new_interned(FMT(\"#try\" << m_try_index++)));\n this->visit_nodelete(node, node.m_inner);\n auto loop_name = mv$(m_try_stack.back());\n m_try_stack.pop_back();\n\n auto core_crate = crate.m_ext_cratename_core;\n AST::ExprNodeP ok_node;\n if(TARGETVER_MOST_1_39)\n {\n auto path_Ok = ::AST::Path(core_crate, {::AST::PathNode(\"result\"), ::AST::PathNode(\"Result\"), ::AST::PathNode(\"Ok\")});\n ok_node = ::AST::ExprNodeP(new ::AST::ExprNode_CallPath( mv$(path_Ok), ::make_vec1(mv$(node.m_inner)) ));\n }\n else\n {\n auto path_Try = ::AST::Path(core_crate, {::AST::PathNode(\"ops\"), ::AST::PathNode(\"Try\")});\n auto path_Try_from_output = ::AST::Path::new_ufcs_trait(::TypeRef(node.span()), path_Try, { ::AST::PathNode(\"from_output\") });\n ok_node = ::AST::ExprNodeP(new ::AST::ExprNode_CallPath( mv$(path_Try_from_output), ::make_vec1(mv$(node.m_inner)) ));\n }\n auto break_node = AST::ExprNodeP(new AST::ExprNode_Flow(AST::ExprNode_Flow::BREAK, loop_name, mv$(ok_node)));\n this->replacement = AST::ExprNodeP(new AST::ExprNode_Loop(loop_name, mv$(break_node)));\n }\n void visit(::AST::ExprNode_Asm& node) override {\n for(auto& v : node.m_output)\n this->visit_nodelete(node, v.value);\n for(auto& v : node.m_input)\n this->visit_nodelete(node, v.value);\n }\n void visit(::AST::ExprNode_Asm2& node) override {\n for(auto& v : node.m_params)\n {\n TU_MATCH_HDRA((v), {)\n TU_ARMA(Const, e) {\n this->visit_nodelete(node, e);\n }\n TU_ARMA(Sym, e) {\n Expand_Path(crate, modstack, this->cur_mod(), e);\n }\n TU_ARMA(RegSingle, e) {\n this->visit_nodelete(node, e.val);\n }\n TU_ARMA(Reg, e) {\n this->visit_nodelete(node, e.val_in);\n this->visit_nodelete(node, e.val_out);\n }\n }\n }\n }\n void visit(::AST::ExprNode_Flow& node) override {\n this->visit_nodelete(node, node.m_value);\n }\n void visit(::AST::ExprNode_LetBinding& node) override {\n Expand_Type(crate, modstack, this->cur_mod(), node.m_type);\n Expand_Pattern(crate, modstack, this->cur_mod(), node.m_pat, false);\n this->visit_nodelete(node, node.m_value);\n }\n void visit(::AST::ExprNode_Assign& node) override {\n this->visit_nodelete(node, node.m_slot);\n this->visit_nodelete(node, node.m_value);\n }\n void visit(::AST::ExprNode_CallPath& node) override {\n Expand_Path(crate, modstack, this->cur_mod(), node.m_path);\n this->visit_vector(node.m_args);\n }\n void visit(::AST::ExprNode_CallMethod& node) override {\n Expand_PathParams(crate, modstack, this->cur_mod(), node.m_method.args());\n this->visit_nodelete(node, node.m_val);\n this->visit_vector(node.m_args);\n }\n void visit(::AST::ExprNode_CallObject& node) override {\n this->visit_nodelete(node, node.m_val);\n this->visit_vector(node.m_args);\n }\n void visit(::AST::ExprNode_Loop& node) override {\n this->visit_nodelete(node, node.m_cond);\n this->visit_nodelete(node, node.m_code);\n Expand_Pattern(crate, modstack, this->cur_mod(), node.m_pattern, (node.m_type == ::AST::ExprNode_Loop::WHILELET));\n if(node.m_type == ::AST::ExprNode_Loop::FOR)\n {\n auto core_crate = crate.m_ext_cratename_core;\n auto path_Some = ::AST::Path(core_crate, {::AST::PathNode(\"option\"), ::AST::PathNode(\"Option\"), ::AST::PathNode(\"Some\")});\n auto path_None = ::AST::Path(core_crate, {::AST::PathNode(\"option\"), ::AST::PathNode(\"Option\"), ::AST::PathNode(\"None\")});\n auto path_IntoIterator = ::AST::Path(core_crate, {::AST::PathNode(\"iter\"), ::AST::PathNode(\"IntoIterator\")});\n auto path_Iterator = ::AST::Path(core_crate, {::AST::PathNode(\"iter\"), ::AST::PathNode(\"Iterator\")});\n \/\/ Desugar into:\n \/\/ {\n \/\/ match <_ as ::iter::IntoIterator>::into_iter(`m_cond`) {\n \/\/ mut it => {\n \/\/ `m_label`: loop {\n \/\/ match ::iter::Iterator::next(&mut it) {\n \/\/ Some(`m_pattern`) => `m_code`,\n \/\/ None => break `m_label`,\n \/\/ }\n \/\/ }\n \/\/ }\n \/\/ }\n ::std::vector< ::AST::ExprNode_Match_Arm> arms;\n \/\/ - `Some(pattern ) => code`\n arms.push_back( ::AST::ExprNode_Match_Arm(\n ::make_vec1( ::AST::Pattern(::AST::Pattern::TagNamedTuple(), node.span(), path_Some, ::make_vec1( mv$(node.m_pattern) ) ) ),\n nullptr,\n mv$(node.m_code)\n ) );\n \/\/ - `None => break label`\n arms.push_back( ::AST::ExprNode_Match_Arm(\n ::make_vec1( ::AST::Pattern(::AST::Pattern::TagValue(), node.span(), ::AST::Pattern::Value::make_Named(path_None)) ),\n nullptr,\n ::AST::ExprNodeP(new ::AST::ExprNode_Flow(::AST::ExprNode_Flow::BREAK, node.m_label, nullptr))\n ) );\n\n replacement.reset(new ::AST::ExprNode_Match(\n ::AST::ExprNodeP(new ::AST::ExprNode_CallPath(\n ::AST::Path::new_ufcs_trait( ::TypeRef(node.span()), path_IntoIterator, { ::AST::PathNode(\"into_iter\") } ),\n ::make_vec1( mv$(node.m_cond) )\n )),\n ::make_vec1(::AST::ExprNode_Match_Arm(\n ::make_vec1( ::AST::Pattern(::AST::Pattern::TagBind(), node.span(), \"it\") ),\n nullptr,\n ::AST::ExprNodeP(new ::AST::ExprNode_Loop(\n node.m_label,\n ::AST::ExprNodeP(new ::AST::ExprNode_Match(\n ::AST::ExprNodeP(new ::AST::ExprNode_CallPath(\n ::AST::Path::new_ufcs_trait( ::TypeRef(node.span()), path_Iterator, { ::AST::PathNode(\"next\") } ),\n ::make_vec1( ::AST::ExprNodeP(new ::AST::ExprNode_UniOp(\n ::AST::ExprNode_UniOp::REFMUT,\n ::AST::ExprNodeP(new ::AST::ExprNode_NamedValue( ::AST::Path(\"it\") ))\n )) )\n )),\n mv$(arms)\n ))\n )) )\n )\n ) );\n }\n }\n void visit(::AST::ExprNode_Match& node) override {\n this->visit_nodelete(node, node.m_val);\n for(auto& arm : node.m_arms)\n {\n Expand_Attrs_CfgAttr( arm.m_attrs );\n Expand_Attrs(arm.m_attrs, AttrStage::Pre , [&](const auto& sp, const auto& d, const auto& a){ d.handle(sp, a, crate, arm); });\n if( arm.m_patterns.size() == 0 )\n continue ;\n for(auto& pat : arm.m_patterns) {\n Expand_Pattern(crate, modstack, this->cur_mod(), pat, true);\n }\n this->visit_nodelete(node, arm.m_cond);\n this->visit_nodelete(node, arm.m_code);\n Expand_Attrs(arm.m_attrs, AttrStage::Post, [&](const auto& sp, const auto& d, const auto& a){ d.handle(sp, a, crate, arm); });\n }\n \/\/ Prune deleted arms\n for(auto it = node.m_arms.begin(); it != node.m_arms.end(); ) {\n if( it->m_patterns.size() == 0 )\n it = node.m_arms.erase(it);\n else\n ++ it;\n }\n }\n void visit(::AST::ExprNode_If& node) override {\n this->visit_nodelete(node, node.m_cond);\n this->visit_nodelete(node, node.m_true);\n this->visit_nodelete(node, node.m_false);\n }\n void visit(::AST::ExprNode_IfLet& node) override {\n for(auto& pat : node.m_patterns)\n Expand_Pattern(crate, modstack, this->cur_mod(), pat, true);\n this->visit_nodelete(node, node.m_value);\n this->visit_nodelete(node, node.m_true);\n this->visit_nodelete(node, node.m_false);\n }\n void visit(::AST::ExprNode_Integer& node) override { }\n void visit(::AST::ExprNode_Float& node) override { }\n void visit(::AST::ExprNode_Bool& node) override { }\n void visit(::AST::ExprNode_String& node) override { }\n void visit(::AST::ExprNode_ByteString& node) override { }\n void visit(::AST::ExprNode_Closure& node) override {\n for(auto& arg : node.m_args) {\n Expand_Pattern(crate, modstack, this->cur_mod(), arg.first, false);\n Expand_Type(crate, modstack, this->cur_mod(), arg.second);\n }\n Expand_Type(crate, modstack, this->cur_mod(), node.m_return);\n this->visit_nodelete(node, node.m_code);\n }\n void visit(::AST::ExprNode_StructLiteral& node) override {\n this->visit_nodelete(node, node.m_base_value);\n for(auto& val : node.m_values)\n {\n Expand_Attrs_CfgAttr(val.attrs);\n Expand_Attrs(val.attrs, AttrStage::Pre , [&](const auto& sp, const auto& d, const auto& a){ d.handle(sp, a, crate, val); });\n if( !val.value )\n continue ;\n this->visit_nodelete(node, val.value);\n Expand_Attrs(val.attrs, AttrStage::Post, [&](const auto& sp, const auto& d, const auto& a){ d.handle(sp, a, crate, val); });\n }\n for(auto it = node.m_values.begin(); it != node.m_values.end(); )\n {\n if( it->value )\n ++it;\n else\n it = node.m_values.erase(it);\n }\n }\n void visit(::AST::ExprNode_Array& node) override {\n this->visit_nodelete(node, node.m_size);\n this->visit_vector(node.m_values);\n }\n void visit(::AST::ExprNode_Tuple& node) override {\n this->visit_vector(node.m_values);\n }\n void visit(::AST::ExprNode_NamedValue& node) override {\n Expand_Path(crate, modstack, this->cur_mod(), node.m_path);\n }\n void visit(::AST::ExprNode_Field& node) override {\n this->visit_nodelete(node, node.m_obj);\n }\n void visit(::AST::ExprNode_Index& node) override {\n this->visit_nodelete(node, node.m_obj);\n this->visit_nodelete(node, node.m_idx);\n }\n void visit(::AST::ExprNode_Deref& node) override {\n this->visit_nodelete(node, node.m_value);\n }\n void visit(::AST::ExprNode_Cast& node) override {\n this->visit_nodelete(node, node.m_value);\n Expand_Type(crate, modstack, this->cur_mod(), node.m_type);\n }\n void visit(::AST::ExprNode_TypeAnnotation& node) override {\n this->visit_nodelete(node, node.m_value);\n Expand_Type(crate, modstack, this->cur_mod(), node.m_type);\n }\n void visit(::AST::ExprNode_BinOp& node) override {\n this->visit_nodelete(node, node.m_left);\n this->visit_nodelete(node, node.m_right);\n\n switch(node.m_type)\n {\n case ::AST::ExprNode_BinOp::RANGE: {\n \/\/ NOTE: Not language items pre 1.39\n auto core_crate = crate.m_ext_cratename_core;\n auto path_Range = ::AST::Path(core_crate, {::AST::PathNode(\"ops\"), ::AST::PathNode(\"Range\") });\n auto path_RangeFrom = ::AST::Path(core_crate, {::AST::PathNode(\"ops\"), ::AST::PathNode(\"RangeFrom\") });\n auto path_RangeTo = ::AST::Path(core_crate, {::AST::PathNode(\"ops\"), ::AST::PathNode(\"RangeTo\") });\n auto path_RangeFull = ::AST::Path(core_crate, {::AST::PathNode(\"ops\"), ::AST::PathNode(\"RangeFull\") });\n\n ::AST::ExprNode_StructLiteral::t_values values;\n if( node.m_left && node.m_right )\n {\n values.push_back({ {}, \"start\", mv$(node.m_left ) });\n values.push_back({ {}, \"end\" , mv$(node.m_right) });\n replacement.reset( new ::AST::ExprNode_StructLiteral(mv$(path_Range), nullptr, mv$(values)) );\n }\n else if( node.m_left )\n {\n values.push_back({ {}, \"start\", mv$(node.m_left ) });\n replacement.reset( new ::AST::ExprNode_StructLiteral(mv$(path_RangeFrom), nullptr, mv$(values)) );\n }\n else if( node.m_right )\n {\n values.push_back({ {}, \"end\" , mv$(node.m_right) });\n replacement.reset( new ::AST::ExprNode_StructLiteral(mv$(path_RangeTo), nullptr, mv$(values)) );\n }\n else\n {\n replacement.reset( new ::AST::ExprNode_StructLiteral(mv$(path_RangeFull), nullptr, mv$(values)) );\n }\n replacement->set_span( node.span() );\n break; }\n case ::AST::ExprNode_BinOp::RANGE_INC: {\n \/\/ NOTE: Not language items pre 1.54\n auto core_crate = crate.m_ext_cratename_core;\n auto path_None = ::AST::Path(core_crate, { ::AST::PathNode(\"option\"), ::AST::PathNode(\"Option\"), ::AST::PathNode(\"None\") });\n auto path_RangeInclusive_NonEmpty = ::AST::Path(core_crate, { ::AST::PathNode(\"ops\"), ::AST::PathNode(\"RangeInclusive\") });\n auto path_RangeToInclusive = ::AST::Path(core_crate, { ::AST::PathNode(\"ops\"), ::AST::PathNode(\"RangeToInclusive\") });\n\n if( node.m_left )\n {\n ::AST::ExprNode_StructLiteral::t_values values;\n values.push_back({ {}, \"start\", mv$(node.m_left) });\n values.push_back({ {}, \"end\" , mv$(node.m_right) });\n if( gTargetVersion >= TargetVersion::Rustc1_29 )\n values.push_back({ {}, \"is_empty\", ::AST::ExprNodeP(new ::AST::ExprNode_NamedValue(mv$(path_None))) });\n replacement.reset( new ::AST::ExprNode_StructLiteral(mv$(path_RangeInclusive_NonEmpty), nullptr, mv$(values)) );\n }\n else\n {\n ::AST::ExprNode_StructLiteral::t_values values;\n values.push_back({ {}, \"end\", mv$(node.m_right) });\n replacement.reset( new ::AST::ExprNode_StructLiteral(mv$(path_RangeToInclusive), nullptr, mv$(values)) );\n }\n replacement->set_span( node.span() );\n break; }\n default:\n break;\n }\n }\n void visit(::AST::ExprNode_UniOp& node) override {\n this->visit_nodelete(node, node.m_value);\n \/\/ - Desugar question mark operator before resolve so it can create names\n if( node.m_type == ::AST::ExprNode_UniOp::QMARK ) {\n auto core_crate = crate.m_ext_cratename_core;\n \n \/\/ TODO: Find a way of creating bindings during HIR lower instead (so lang items are available)\n\n \/\/auto it = crate.m_lang_items.find(\"try\");\n \/\/ASSERT_BUG(node.span(), it != crate.m_lang_items.end(), \"Can't find the `try` lang item\");\n \/\/auto path_Try = it->second;\n auto path_Try = ::AST::Path(core_crate, {::AST::PathNode(\"ops\"), ::AST::PathNode(\"Try\")});\n if(TARGETVER_MOST_1_39)\n {\n auto path_Ok = ::AST::Path(core_crate, {::AST::PathNode(\"result\"), ::AST::PathNode(\"Result\"), ::AST::PathNode(\"Ok\")});\n auto path_Err = ::AST::Path(core_crate, {::AST::PathNode(\"result\"), ::AST::PathNode(\"Result\"), ::AST::PathNode(\"Err\")});\n auto path_From = ::AST::Path(core_crate, {::AST::PathNode(\"convert\"), ::AST::PathNode(\"From\")});\n path_From.nodes().back().args().m_entries.push_back( ::TypeRef(node.span()) );\n\n auto path_Try_into_result = ::AST::Path::new_ufcs_trait(::TypeRef(node.span()), path_Try, { ::AST::PathNode(\"into_result\") });\n auto path_Try_from_error = ::AST::Path::new_ufcs_trait(::TypeRef(node.span()), path_Try, { ::AST::PathNode(\"from_error\") });\n\n \/\/ Desugars into\n \/\/ ```\n \/\/ match `Try::into_result(m_value)` {\n \/\/ Ok(v) => v,\n \/\/ Err(e) => return Try::from_error(From::from(e)),\n \/\/ }\n \/\/ ```\n\n ::std::vector< ::AST::ExprNode_Match_Arm> arms;\n \/\/ `Ok(v) => v,`\n arms.push_back(::AST::ExprNode_Match_Arm(\n ::make_vec1( ::AST::Pattern(::AST::Pattern::TagNamedTuple(), node.span(), path_Ok, ::make_vec1( ::AST::Pattern(::AST::Pattern::TagBind(), node.span(), \"v\") )) ),\n nullptr,\n ::AST::ExprNodeP( new ::AST::ExprNode_NamedValue( ::AST::Path(\"v\") ) )\n ));\n \/\/ `Err(e) => return Try::from_error(From::from(e)),`\n arms.push_back(::AST::ExprNode_Match_Arm(\n ::make_vec1( ::AST::Pattern(::AST::Pattern::TagNamedTuple(), node.span(), path_Err, ::make_vec1( ::AST::Pattern(::AST::Pattern::TagBind(), node.span(), \"e\") )) ),\n nullptr,\n ::AST::ExprNodeP(new ::AST::ExprNode_Flow(\n (m_try_stack.empty() ? ::AST::ExprNode_Flow::RETURN : ::AST::ExprNode_Flow::BREAK), \/\/ NOTE: uses `break 'tryblock` instead of return if in a try block.\n (m_try_stack.empty() ? RcString(\"\") : m_try_stack.back()),\n ::AST::ExprNodeP(new ::AST::ExprNode_CallPath(\n ::AST::Path(path_Try_from_error),\n ::make_vec1(\n ::AST::ExprNodeP(new ::AST::ExprNode_CallPath(\n ::AST::Path::new_ufcs_trait(::TypeRef(node.span()), mv$(path_From), { ::AST::PathNode(\"from\") }),\n ::make_vec1( ::AST::ExprNodeP( new ::AST::ExprNode_NamedValue( ::AST::Path(\"e\") ) ) )\n ))\n )\n ))\n ))\n ));\n\n replacement.reset(new ::AST::ExprNode_Match(\n ::AST::ExprNodeP(new AST::ExprNode_CallPath(\n mv$(path_Try_into_result),\n ::make_vec1( mv$(node.m_value) )\n )),\n mv$(arms)\n ));\n }\n else \/\/ 1.54+ - TryV2\n {\n auto path_Try_branch = ::AST::Path::new_ufcs_trait(::TypeRef(node.span()), path_Try, { ::AST::PathNode(\"branch\") });\n \/\/ Not a lang item\n auto path_ControlFlow_Continue = ::AST::Path(core_crate, {::AST::PathNode(\"ops\"), ::AST::PathNode(\"ControlFlow\"), ::AST::PathNode(\"Continue\")});\n auto path_ControlFlow_Break = ::AST::Path(core_crate, {::AST::PathNode(\"ops\"), ::AST::PathNode(\"ControlFlow\"), ::AST::PathNode(\"Break\" )});\n auto path_FromResidual_from_residual = ::AST::Path(core_crate, {::AST::PathNode(\"ops\"), ::AST::PathNode(\"FromResidual\"), ::AST::PathNode(\"from_residual\")});\n\n ::std::vector< ::AST::ExprNode_Match_Arm> arms;\n \/\/ `Continue(v) => v,`\n arms.push_back(::AST::ExprNode_Match_Arm(\n ::make_vec1( ::AST::Pattern(::AST::Pattern::TagNamedTuple(), node.span(), path_ControlFlow_Continue, ::make_vec1( ::AST::Pattern(::AST::Pattern::TagBind(), node.span(), \"v\") )) ),\n nullptr,\n ::AST::ExprNodeP( new ::AST::ExprNode_NamedValue( ::AST::Path(\"v\") ) )\n ));\n \/\/ `Break(r) => return R::from_residual(r),`\n arms.push_back(::AST::ExprNode_Match_Arm(\n ::make_vec1( ::AST::Pattern(::AST::Pattern::TagNamedTuple(), node.span(), path_ControlFlow_Break, ::make_vec1( ::AST::Pattern(::AST::Pattern::TagBind(), node.span(), \"e\") )) ),\n nullptr,\n ::AST::ExprNodeP(new ::AST::ExprNode_Flow(\n (m_try_stack.empty() ? ::AST::ExprNode_Flow::RETURN : ::AST::ExprNode_Flow::BREAK), \/\/ NOTE: uses `break 'tryblock` instead of return if in a try block.\n (m_try_stack.empty() ? RcString(\"\") : m_try_stack.back()),\n ::AST::ExprNodeP(new ::AST::ExprNode_CallPath(\n ::AST::Path(path_FromResidual_from_residual),\n ::make_vec1(::AST::ExprNodeP( new ::AST::ExprNode_NamedValue( ::AST::Path(\"e\") ) ))\n ))\n ))\n ));\n\n replacement.reset(new ::AST::ExprNode_Match(\n ::AST::ExprNodeP(new AST::ExprNode_CallPath(\n mv$(path_Try_branch),\n ::make_vec1( mv$(node.m_value) )\n )),\n mv$(arms)\n ));\n }\n }\n }\n};\n\nvoid Expand_Expr(::AST::Crate& crate, LList modstack, ::AST::ExprNodeP& node)\n{\n TRACE_FUNCTION_F(\"unique_ptr\");\n auto visitor = CExpandExpr(crate, modstack);\n visitor.visit(node);\n}\nvoid Expand_Expr(::AST::Crate& crate, LList modstack, ::std::shared_ptr& node)\n{\n TRACE_FUNCTION_F(\"shared_ptr\");\n auto visitor = CExpandExpr(crate, modstack);\n node->visit(visitor);\n if( visitor.replacement ) {\n node.reset( visitor.replacement.release() );\n }\n}\nvoid Expand_Expr(::AST::Crate& crate, LList modstack, AST::Expr& node)\n{\n TRACE_FUNCTION_F(\"AST::Expr\");\n auto visitor = CExpandExpr(crate, modstack);\n node.visit_nodes(visitor);\n if( visitor.replacement ) {\n node = AST::Expr( mv$(visitor.replacement) );\n }\n}\n\nvoid Expand_GenericParams(::AST::Crate& crate, LList modstack, ::AST::Module& mod, ::AST::GenericParams& params)\n{\n for(auto& param_def : params.m_params)\n {\n TU_MATCH_HDRA( (param_def), {)\n TU_ARMA(None, e) {\n \/\/ Ignore\n }\n TU_ARMA(Lifetime, e) {\n }\n TU_ARMA(Type, ty_def) {\n Expand_Type(crate, modstack, mod, ty_def.get_default());\n }\n TU_ARMA(Value, val_def) {\n Expand_Type(crate, modstack, mod, val_def.type());\n }\n }\n }\n for(auto& bound : params.m_bounds)\n {\n TU_MATCHA( (bound), (be),\n (None,\n ),\n (Lifetime,\n ),\n (TypeLifetime,\n Expand_Type(crate, modstack, mod, be.type);\n ),\n (IsTrait,\n Expand_Type(crate, modstack, mod, be.type);\n Expand_Path(crate, modstack, mod, be.trait);\n ),\n (MaybeTrait,\n Expand_Type(crate, modstack, mod, be.type);\n Expand_Path(crate, modstack, mod, be.trait);\n ),\n (NotTrait,\n Expand_Type(crate, modstack, mod, be.type);\n Expand_Path(crate, modstack, mod, be.trait);\n ),\n (Equality,\n Expand_Type(crate, modstack, mod, be.type);\n Expand_Type(crate, modstack, mod, be.replacement);\n )\n )\n }\n}\n\nvoid Expand_BareExpr(const ::AST::Crate& crate, const AST::Module& mod, ::AST::ExprNodeP& node)\n{\n Expand_Expr(const_cast< ::AST::Crate&>(crate), LList(nullptr, &mod), node);\n}\n\nvoid Expand_Impl(::AST::Crate& crate, LList modstack, ::AST::Path modpath, ::AST::Module& mod, ::AST::Impl& impl)\n{\n TRACE_FUNCTION_F(impl.def());\n Expand_Attrs_CfgAttr(impl.def().attrs());\n Expand_Attrs(impl.def().attrs(), AttrStage::Pre, crate, mod, impl.def());\n if( impl.def().type().is_wildcard() ) {\n DEBUG(\"Deleted\");\n return ;\n }\n Expand_GenericParams(crate, modstack, mod, impl.def().params());\n\n Expand_Type(crate, modstack, mod, impl.def().type());\n Expand_Path(crate, modstack, mod, impl.def().trait().ent);\n\n DEBUG(\"> Items\");\n for( unsigned int idx = 0; idx < impl.items().size(); idx ++ )\n {\n auto& i = impl.items()[idx];\n DEBUG(\" - \" << i.name << \" :: \" << i.attrs);\n\n \/\/ TODO: Make a path from the impl definition? Requires having the impl def resolved to be correct\n \/\/ - Does it? the namespace is essentially the same. There may be issues with wherever the path is used though\n \/\/ TODO: UFCS path, or different method\n AST::AbsolutePath path(\"\", {\"\", i.name});\n\n auto attrs = mv$(i.attrs);\n Expand_Attrs_CfgAttr(attrs);\n Expand_Attrs(attrs, AttrStage::Pre, crate, impl, i.name, *i.data);\n\n TU_MATCH_HDRA( (*i.data), {)\n default:\n BUG(Span(), \"Unknown item type in impl block - \" << i.data->tag_str());\n TU_ARMA(None, e) {\n }\n TU_ARMA(MacroInv, e) {\n if( e.path().is_valid() )\n {\n TRACE_FUNCTION_F(\"Macro invoke \" << e.path());\n \/\/ Move out of the module to avoid invalidation if a new macro invocation is added\n auto mi_owned = mv$(e);\n\n auto ttl = Expand_Macro(crate, modstack, mod, mi_owned);\n\n if( ttl.get() )\n {\n \/\/ Re-parse tt\n while( ttl->lookahead(0) != TOK_EOF )\n {\n Parse_Impl_Item(*ttl, impl);\n }\n \/\/ - Any new macro invocations ends up at the end of the list and handled\n }\n \/\/ Move back in (using the index, as the old pointr may be invalid)\n impl.items()[idx].data->as_MacroInv() = mv$(mi_owned);\n }\n }\n TU_ARMA(Function, e) {\n TRACE_FUNCTION_F(\"fn \" << i.name);\n for(auto& arg : e.args()) {\n Expand_Pattern(crate, modstack, mod, arg.first, false);\n Expand_Type(crate, modstack, mod, arg.second);\n }\n Expand_Type(crate, modstack, mod, e.rettype());\n Expand_Expr(crate, modstack, e.code());\n }\n TU_ARMA(Static, e) {\n TRACE_FUNCTION_F(\"static \" << i.name);\n Expand_Expr(crate, modstack, e.value());\n Expand_Type(crate, modstack, mod, e.type());\n }\n TU_ARMA(Type, e) {\n TRACE_FUNCTION_F(\"type \" << i.name);\n Expand_Type(crate, modstack, mod, e.type());\n }\n }\n\n \/\/ Run post-expansion decorators and restore attributes\n {\n auto& i = impl.items()[idx];\n Expand_Attrs(attrs, AttrStage::Post, crate, impl, i.name, *i.data);\n \/\/ TODO: How would this be populated? It got moved out?\n if( i.attrs.m_items.size() == 0 )\n i.attrs = mv$(attrs);\n }\n }\n\n Expand_Attrs(impl.def().attrs(), AttrStage::Post, crate, mod, impl.def());\n}\nvoid Expand_ImplDef(::AST::Crate& crate, LList modstack, ::AST::Path modpath, ::AST::Module& mod, ::AST::ImplDef& impl_def)\n{\n Expand_Attrs_CfgAttr(impl_def.attrs());\n Expand_Attrs(impl_def.attrs(), AttrStage::Pre, crate, mod, impl_def);\n if( impl_def.type().is_wildcard() ) {\n DEBUG(\"Deleted\");\n return ;\n }\n Expand_GenericParams(crate, modstack, mod, impl_def.params());\n\n Expand_Type(crate, modstack, mod, impl_def.type());\n \/\/Expand_Type(crate, modstack, mod, impl_def.trait());\n\n Expand_Attrs(impl_def.attrs(), AttrStage::Post, crate, mod, impl_def);\n}\n\nvoid Expand_Mod(::AST::Crate& crate, LList modstack, ::AST::AbsolutePath modpath, ::AST::Module& mod, unsigned int first_item)\n{\n TRACE_FUNCTION_F(\"modpath = \" << modpath << \", first_item=\" << first_item);\n\n \/\/ TODO: Pre-parse all macro_rules invocations into items?\n\n for( const auto& mi: mod.macro_imports_res() )\n DEBUG(\"- Imports '\" << mi.name << \"'\");\n \/\/ Import all macros from parent module.\n if( first_item == 0 )\n {\n for( const auto& mi: mod.macro_imports_res() )\n DEBUG(\"- Imports '\" << mi.name << \"'\");\n if( modstack.m_prev )\n {\n for(const auto& mac : modstack.m_prev->m_item->m_macro_imports)\n {\n mod.m_macro_imports.push_back(mac);\n }\n }\n for( const auto& mi: mod.m_macro_imports )\n DEBUG(\"- Imports '\" << mi.path << \"'\");\n }\n\n \/\/ Insert prelude if: Enabled for this module, present for the crate, and this module is not an anon\n if( crate.m_prelude_path != AST::Path() )\n {\n if( mod.m_insert_prelude && ! mod.is_anon() ) {\n DEBUG(\"> Adding custom prelude \" << crate.m_prelude_path);\n mod.add_item(Span(), false, \"\", ::AST::UseItem { Span(), ::make_vec1(::AST::UseItem::Ent { Span(), crate.m_prelude_path, \"\" }) }, {});\n }\n else {\n DEBUG(\"> Not inserting custom prelude (anon or disabled)\");\n }\n }\n\n \/\/ Stack to prevent macro recursion\n \/\/ - Items are popped if the item address matches\n std::vector*> macro_recursion_stack;\n\n DEBUG(\"Items\");\n for( unsigned int idx = first_item; idx < mod.m_items.size(); idx ++ )\n {\n auto& i = *mod.m_items[idx];\n\n \/\/ If this is the pop point for this entry, then pop\n \/\/ - Note, can be `nullptr`, but that indicates that the macro invocation was the end\n while( !macro_recursion_stack.empty() && macro_recursion_stack.back() == &i ) {\n macro_recursion_stack.pop_back();\n DEBUG(\"End macro recursion guard\");\n }\n\n DEBUG(\"- \" << modpath << \"::\" << i.name << \" (\" << ::AST::Item::tag_to_str(i.data.tag()) << \") :: \" << i.attrs);\n auto path = modpath + i.name;\n\n if(const auto* mi = i.data.opt_MacroInv() )\n {\n if( mi->path().is_trivial() && mi->path().as_trivial() == \"macro_rules\" ) {\n i.is_pub = true;\n DEBUG(\"macro_rules made pub\");\n }\n }\n\n auto attrs = mv$(i.attrs);\n Expand_Attrs_CfgAttr(attrs);\n Expand_Attrs(attrs, AttrStage::Pre, crate, path, mod, i.data);\n\n \/\/ Do modules without moving the definition (so the module path is always valid)\n if( i.data.is_Module() )\n {\n auto& e = i.data.as_Module();\n LList sub_modstack(&modstack, &e);\n Expand_Mod(crate, sub_modstack, path, e);\n Expand_Attrs(attrs, AttrStage::Post, crate, path, mod, i.data);\n i.attrs = mv$(attrs);\n continue ;\n }\n\n auto dat = mv$(i.data);\n\n TU_MATCH_HDRA( (dat), {)\n TU_ARMA(None, e) {\n \/\/ Skip: nothing\n }\n TU_ARMA(MacroInv, e) {\n \/\/ Move out of the module to avoid invalidation if a new macro invocation is added\n\n if( macro_recursion_stack.size() > MAX_MACRO_RECURSION ) {\n ERROR(i.span, E0000, \"Exceeded macro recusion limit of \" << MAX_MACRO_RECURSION);\n }\n auto mi_owned = mv$(e);\n\n TRACE_FUNCTION_F(\"Macro invoke \" << mi_owned.path());\n\n auto ttl = Expand_Macro(crate, modstack, mod, mi_owned);\n assert( mi_owned.path().is_valid() );\n\n if( ttl.get() )\n {\n \/\/ Re-parse tt\n \/\/ TODO: All new items should be placed just after this?\n assert(ttl.get());\n DEBUG(\"-- Parsing as mod items\");\n \/\/ Move the item list out\n auto old_items = std::move(mod.m_items);\n \/\/ Parse module items\n Parse_ModRoot_Items(*ttl, mod);\n auto new_item_count = mod.m_items.size();\n \/\/ Then insert the newly created items\n old_items.insert(old_items.begin() + idx + 1, std::make_move_iterator(mod.m_items.begin()), std::make_move_iterator(mod.m_items.end()));\n \/\/ and move the (updated) item list back in\n mod.m_items = std::move(old_items);\n\n auto next_non_macro_item = idx + 1 + new_item_count;\n macro_recursion_stack.push_back(next_non_macro_item == mod.m_items.size() ? nullptr : &*mod.m_items[next_non_macro_item]);\n }\n dat.as_MacroInv() = mv$(mi_owned);\n }\n TU_ARMA(Macro, e) {\n mod.add_macro(i.is_pub, i.name, mv$(e));\n }\n TU_ARMA(Use, e) {\n \/\/ Determine if the `use` refers to a macro, and import into the current scope\n for(const auto& ue : e.entries)\n {\n \/\/ Get module ref, if it's to a HIR module then grab the macro\n if(ue.name != \"\")\n {\n DEBUG(\"Use \" << ue.path);\n\n auto m = Resolve_Lookup_Macro(ue.sp, crate, mod.path(), ue.path, \/*out_path=*\/nullptr);\n TU_MATCH_HDRA( (m), { )\n TU_ARMA(None, e) {\n \/\/ Not found? Ignore.\n }\n TU_ARMA(InternalMacro, e) {\n \/\/ Ignore builtins, they're always available.\n }\n TU_ARMA(ProcMacro, pm) {\n auto mi = AST::Module::MacroImport{ false, ue.name, pm->path.m_components, nullptr };\n mi.path.insert(mi.path.begin(), pm->path.m_crate_name);\n mod.m_macro_imports.push_back(mv$(mi));\n\n mod.add_macro_import(ue.sp, ue.name, pm);\n }\n TU_ARMA(MacroRules, mr) {\n mod.add_macro_import(ue.sp, ue.name, mr);\n }\n }\n }\n }\n }\n TU_ARMA(ExternBlock, e) {\n \/\/ TODO: Run expand on inner items?\n \/\/ HACK: Just convert inner items into outer items\n auto items = mv$( e.items() );\n for(auto& i2 : items)\n {\n mod.m_items.push_back( box$(i2) );\n }\n }\n TU_ARMA(Impl, e) {\n Expand_Impl(crate, modstack, modpath, mod, e);\n if( e.def().type().is_wildcard() ) {\n dat = AST::Item();\n }\n }\n TU_ARMA(NegImpl, e) {\n Expand_ImplDef(crate, modstack, modpath, mod, e);\n if( e.type().is_wildcard() ) {\n dat = AST::Item();\n }\n }\n TU_ARMA(Module, e) {\n throw \"\";\n }\n TU_ARMA(Crate, e) {\n if( e.name != \"\" )\n {\n \/\/ Can't recurse into an `extern crate`\n if(crate.m_extern_crates.count(e.name) == 0)\n {\n e.name = crate.load_extern_crate( i.span, e.name );\n }\n \/\/ Crates imported in root are added to the implicit list\n if( modpath.nodes.empty() )\n {\n AST::g_implicit_crates.insert( std::make_pair(i.name, e.name) );\n }\n }\n else {\n if( modpath.nodes.empty() )\n {\n AST::g_implicit_crates.insert( std::make_pair(i.name, \"\") );\n }\n }\n }\n\n TU_ARMA(Struct, e) {\n Expand_GenericParams(crate, modstack, mod, e.params());\n TU_MATCH_HDRA( (e.m_data), {)\n TU_ARMA(Unit, sd) {\n }\n TU_ARMA(Struct, sd) {\n for(auto it = sd.ents.begin(); it != sd.ents.end(); ) {\n auto& si = *it;\n Expand_Attrs_CfgAttr(si.m_attrs);\n Expand_Attrs(si.m_attrs, AttrStage::Pre, [&](const auto& sp, const auto& d, const auto& a){ d.handle(sp, a, crate, si); });\n Expand_Type(crate, modstack, mod, si.m_type);\n Expand_Attrs(si.m_attrs, AttrStage::Post, [&](const auto& sp, const auto& d, const auto& a){ d.handle(sp, a, crate, si); });\n\n if( si.m_name == \"\" )\n it = sd.ents.erase(it);\n else\n ++it;\n }\n }\n TU_ARMA(Tuple, sd) {\n for(auto it = sd.ents.begin(); it != sd.ents.end(); ) {\n auto& si = *it;\n Expand_Attrs_CfgAttr(si.m_attrs);\n Expand_Attrs(si.m_attrs, AttrStage::Pre, [&](const auto& sp, const auto& d, const auto& a){ d.handle(sp, a, crate, si); });\n Expand_Type(crate, modstack, mod, si.m_type);\n Expand_Attrs(si.m_attrs, AttrStage::Post, [&](const auto& sp, const auto& d, const auto& a){ d.handle(sp, a, crate, si); });\n\n if( ! si.m_type.is_valid() )\n it = sd.ents.erase(it);\n else\n ++it;\n }\n }\n }\n }\n TU_ARMA(Enum, e) {\n Expand_GenericParams(crate, modstack, mod, e.params());\n for(auto& var : e.variants()) {\n Expand_Attrs_CfgAttr(var.m_attrs);\n Expand_Attrs(var.m_attrs, AttrStage::Pre, [&](const auto& sp, const auto& d, const auto& a){ d.handle(sp, a, crate, var); });\n TU_MATCH(::AST::EnumVariantData, (var.m_data), (e),\n (Value,\n Expand_Expr(crate, modstack, e.m_value);\n ),\n (Tuple,\n for(auto& ty : e.m_sub_types) {\n Expand_Type(crate, modstack, mod, ty);\n }\n ),\n (Struct,\n for(auto it = e.m_fields.begin(); it != e.m_fields.end(); ) {\n auto& si = *it;\n Expand_Attrs_CfgAttr(si.m_attrs);\n Expand_Attrs(si.m_attrs, AttrStage::Pre, [&](const auto& sp, const auto& d, const auto& a){ d.handle(sp, a, crate, si); });\n Expand_Type(crate, modstack, mod, si.m_type);\n Expand_Attrs(si.m_attrs, AttrStage::Post, [&](const auto& sp, const auto& d, const auto& a){ d.handle(sp, a, crate, si); });\n\n if( si.m_name == \"\" )\n it = e.m_fields.erase(it);\n else\n ++it;\n }\n )\n )\n Expand_Attrs(var.m_attrs, AttrStage::Post, [&](const auto& sp, const auto& d, const auto& a){ d.handle(sp, a, crate, var); });\n }\n \/\/ Handle cfg on variants (kinda hacky)\n for(auto it = e.variants().begin(); it != e.variants().end(); ) {\n if( it->m_name == \"\" ) {\n it = e.variants().erase(it);\n }\n else {\n ++ it;\n }\n }\n }\n TU_ARMA(Union, e) {\n Expand_GenericParams(crate, modstack, mod, e.m_params);\n for(auto it = e.m_variants.begin(); it != e.m_variants.end(); )\n {\n auto& si = *it;\n Expand_Attrs_CfgAttr(si.m_attrs);\n Expand_Attrs(si.m_attrs, AttrStage::Pre, [&](const auto& sp, const auto& d, const auto& a){ d.handle(sp, a, crate, si); });\n Expand_Type(crate, modstack, mod, si.m_type);\n Expand_Attrs(si.m_attrs, AttrStage::Post, [&](const auto& sp, const auto& d, const auto& a){ d.handle(sp, a, crate, si); });\n\n if( si.m_name == \"\" )\n it = e.m_variants.erase(it);\n else\n ++it;\n }\n }\n TU_ARMA(Trait, e) {\n Expand_GenericParams(crate, modstack, mod, e.params());\n for(auto& p : e.supertraits())\n Expand_Path(crate, modstack, mod, *p.ent.path);\n auto& trait_items = e.items();\n for(size_t idx = 0; idx < trait_items.size(); idx ++)\n {\n auto& ti = trait_items[idx];\n DEBUG(\" - \" << ti.name << \" \" << ti.data.tag_str());\n auto attrs = mv$(ti.attrs);\n auto ti_path = path + ti.name;\n Expand_Attrs_CfgAttr(attrs);\n Expand_Attrs(attrs, AttrStage::Pre, crate, ti_path, e, ti.data);\n\n TU_MATCH_HDRA( (ti.data), {)\n default:\n BUG(Span(), \"Unknown item type in trait block - \" << ti.data.tag_str());\n TU_ARMA(None, e) {}\n TU_ARMA(MacroInv, e) {\n if( e.path().is_valid() )\n {\n TRACE_FUNCTION_F(\"Macro invoke \" << e.path());\n \/\/ Move out of the module to avoid invalidation if a new macro invocation is added\n auto mi_owned = mv$(e);\n\n auto ttl = Expand_Macro(crate, modstack, mod, mi_owned);\n\n if( ttl.get() )\n {\n \/\/ Re-parse tt\n size_t insert_pos = idx+1;\n while( ttl->lookahead(0) != TOK_EOF )\n {\n auto i = Parse_Trait_Item(*ttl);\n trait_items.insert( trait_items.begin() + insert_pos, mv$(i) );\n insert_pos ++;\n }\n \/\/ - Any new macro invocations ends up at the end of the list and handled\n }\n \/\/ Move back in (using the index, as the old pointer may be invalid)\n trait_items[idx].data.as_MacroInv() = mv$(mi_owned);\n }\n }\n TU_ARMA(Function, e) {\n Expand_GenericParams(crate, modstack, mod, e.params());\n for(auto& arg : e.args()) {\n Expand_Pattern(crate, modstack, mod, arg.first, false);\n Expand_Type(crate, modstack, mod, arg.second);\n }\n Expand_Type(crate, modstack, mod, e.rettype());\n Expand_Expr(crate, modstack, e.code());\n }\n TU_ARMA(Static, e) {\n Expand_Expr(crate, modstack, e.value());\n Expand_Type(crate, modstack, mod, e.type());\n }\n TU_ARMA(Type, e) {\n Expand_Type(crate, modstack, mod, e.type());\n }\n }\n\n {\n auto& ti = trait_items[idx];\n\n Expand_Attrs(attrs, AttrStage::Post, crate, ti_path, e, ti.data);\n if( ti.attrs.m_items.size() == 0 )\n ti.attrs = mv$(attrs);\n }\n }\n }\n TU_ARMA(Type, e) {\n Expand_Type(crate, modstack, mod, e.type());\n }\n\n TU_ARMA(Function, e) {\n Expand_GenericParams(crate, modstack, mod, e.params());\n for(auto& arg : e.args()) {\n Expand_Pattern(crate, modstack, mod, arg.first, false);\n Expand_Type(crate, modstack, mod, arg.second);\n }\n Expand_Type(crate, modstack, mod, e.rettype());\n Expand_Expr(crate, modstack, e.code());\n }\n TU_ARMA(Static, e) {\n Expand_Expr(crate, modstack, e.value());\n Expand_Type(crate, modstack, mod, e.type());\n }\n TU_ARMA(TraitAlias, e) {\n for(auto& p : e.traits)\n Expand_Path(crate, modstack, mod, *p.ent.path);\n }\n }\n Expand_Attrs(attrs, AttrStage::Post, crate, path, mod, dat);\n\n {\n\n auto& i = *mod.m_items[idx];\n if( i.data.tag() == ::AST::Item::TAGDEAD ) {\n i.data = mv$(dat);\n }\n \/\/ TODO: When would this _not_ be empty?\n if( i.attrs.m_items.size() == 0 )\n i.attrs = mv$(attrs);\n }\n }\n\n \/\/ IGNORE m_anon_modules, handled as part of expressions\n\n \/\/for( const auto& mi: mod.macro_imports_res() )\n \/\/ DEBUG(\"- Imports '\" << mi.name << \"'\");\n}\nvoid Expand_Mod_IndexAnon(::AST::Crate& crate, ::AST::Module& mod)\n{\n TRACE_FUNCTION_F(\"mod=\" << mod.path());\n\n for(auto& i : mod.m_items)\n {\n DEBUG(\"- \" << i->data.tag_str() << \" '\" << i->name << \"'\");\n if(auto* e = i->data.opt_Module())\n {\n Expand_Mod_IndexAnon(crate, *e);\n\n \/\/ TODO: Also ensure that all #[macro_export] macros end up in parent\n }\n }\n\n for( auto& mp : mod.anon_mods() )\n {\n if( mp.unique() ) {\n DEBUG(\"- \" << mp->path() << \" dropped due to node destruction\");\n mp.reset();\n }\n else {\n Expand_Mod_IndexAnon(crate, *mp);\n }\n }\n}\n\n\n\/\/\n\/\/ Expand all `cfg` attributes... mostly to find #[macro_export]\n\/\/\nvoid Expand_Mod_Early(::AST::Crate& crate, ::AST::Module& mod, std::vector>>& new_root_items)\n{\n for(auto& i : mod.m_items)\n {\n if(const auto* mi = i->data.opt_MacroInv() )\n {\n if( mi->path().is_trivial() && mi->path().as_trivial() == \"macro_rules\" ) {\n i->is_pub = true;\n DEBUG(\"macro_rules made pub\");\n }\n }\n\n Expand_Attrs_CfgAttr(i->attrs);\n bool is_macro_export = false;\n bool cfg_failed = false;\n for(auto& a : i->attrs.m_items)\n {\n if( a.name() == \"cfg\" ) {\n if( !check_cfg(i->span, a) ) {\n cfg_failed = true;\n }\n }\n else if( a.name() == \"macro_export\" ) {\n is_macro_export = true;\n }\n else {\n }\n }\n if( cfg_failed ) {\n i->data = ::AST::Item::make_None({});\n }\n else if( is_macro_export ) {\n if( i->data.is_MacroInv() && i->data.as_MacroInv().path().is_trivial() && i->data.as_MacroInv().path().as_trivial() == \"macro_rules\" )\n {\n const auto& mac_inv = i->data.as_MacroInv();\n DEBUG(\"macro_rules marked with #[macro_export] moved to the crate root - \" << mac_inv.input_ident());\n new_root_items.push_back(box$(*i));\n i->data = AST::Item();\n\n#if 0\n TTStream lex(i->span, ParseState(crate.m_edition), mac_inv.input_tt());\n auto mac = Parse_MacroRules(lex);\n const auto* mac_ptr = &*mac;\n crate.m_root_module.add_macro(true, mac_inv.input_ident(), std::move(mac));\n crate.m_exported_macros[mac_inv.input_ident()] = mac_ptr;\n#else\n#endif\n }\n else if( i->data.is_Macro() )\n {\n \/\/ TODO: `#[macro_export] macro foo { ... }` DOESN'T move the item to the root\n \/\/ - Instead, it should add an alias? Or just tag for export\n i->data.as_Macro()->m_exported = true;\n }\n else\n {\n ERROR(i->span, E0000, \"#[macro_export] on non-macro_rules - \" << i->data.tag_str());\n }\n }\n else if( i->data.is_Module() ) {\n Expand_Mod_Early(crate, i->data.as_Module(), new_root_items);\n }\n else {\n }\n }\n}\n\nvoid Expand(::AST::Crate& crate)\n{\n for(const auto& e : g_decorators)\n {\n DEBUG(\"Decorator: \" << e.first);\n }\n for(const auto& e : g_macros)\n {\n DEBUG(\"Macro: \" << e.first);\n }\n\n auto modstack = LList(nullptr, &crate.m_root_module);\n\n\n \/\/ 1. Crate attributes\n Expand_Attrs_CfgAttr(crate.m_attrs);\n Expand_Attrs(crate.m_attrs, AttrStage::Pre, [&](const auto& sp, const auto& d, const auto& a){ d.handle(sp, a, crate); });\n\n std::vector>> new_root_items;\n Expand_Mod_Early(crate, crate.m_root_module, new_root_items);\n crate.m_root_module.m_items.insert( crate.m_root_module.m_items.begin(),\n std::make_move_iterator(new_root_items.begin()), std::make_move_iterator(new_root_items.end()) );\n\n \/\/ Insert magic for libstd\/libcore\n \/\/ NOTE: The actual crates are loaded in \"LoadCrates\" using magic in AST::Crate::load_externs\n RcString std_crate_shortname;\n RcString std_crate_name;\n switch( crate.m_load_std )\n {\n case ::AST::Crate::LOAD_STD:\n std_crate_shortname = \"std\";\n std_crate_name = crate.m_ext_cratename_std;\n break;\n case ::AST::Crate::LOAD_CORE:\n std_crate_shortname = \"core\";\n std_crate_name = crate.m_ext_cratename_core;\n break;\n case ::AST::Crate::LOAD_NONE:\n break;\n }\n if(std_crate_shortname != \"\")\n {\n ASSERT_BUG(Span(), std_crate_name != \"\", \"`\" << std_crate_shortname << \"` not loaded?\");\n if( crate.m_prelude_path == AST::Path() )\n {\n crate.m_prelude_path = AST::Path(std_crate_name, {AST::PathNode(\"prelude\"), AST::PathNode(\"v1\")});\n }\n AST::AttributeList attrs;\n AST::AttributeName name;\n name.elems.push_back(\"macro_use\");\n attrs.push_back( AST::Attribute(Span(), mv$(name), {}) );\n crate.m_root_module.m_items.insert(\n crate.m_root_module.m_items.begin(),\n box$( AST::Named(Span(), mv$(attrs), false, std_crate_shortname, AST::Item::make_Crate({std_crate_name}) ) )\n );\n }\n\n \/\/ 2. Module attributes\n for( auto& a : crate.m_attrs.m_items )\n {\n for( auto& d : g_decorators ) {\n if( a.name() == d.first && d.second->stage() == AttrStage::Pre ) {\n \/\/d.second->handle(a, crate, ::AST::Path(), crate.m_root_module, crate.m_root_module);\n }\n }\n }\n\n \/\/ 3. Module tree\n Expand_Mod(crate, modstack, ::AST::AbsolutePath(), crate.m_root_module);\n\n \/\/Expand_Attrs(crate.m_attrs, AttrStage::Post, [&](const auto& sp, const auto& d, const auto& a){ d.handle(sp, a, crate); });\n\n \/\/ Post-process\n Expand_Mod_IndexAnon(crate, crate.m_root_module);\n\n \/\/ Extract exported macros\n\n {\n auto& exported_macros = crate.m_exported_macros;\n\n ::std::vector< ::AST::Module*> mods;\n mods.push_back( &crate.m_root_module );\n do\n {\n auto& mod = *mods.back();\n mods.pop_back();\n\n for( \/*const*\/ auto& mac : mod.macros() ) {\n if( mac.data->m_exported ) {\n auto res = exported_macros.insert( ::std::make_pair(mac.name, &*mac.data) );\n if( res.second )\n DEBUG(\"- Define \" << mac.name << \"!\");\n }\n else {\n DEBUG(\"- Non-exported \" << mac.name << \"!\");\n }\n }\n\n for(auto& i : mod.m_items) {\n if( i->data.is_Module() )\n mods.push_back( &i->data.as_Module() );\n }\n } while( mods.size() > 0 );\n\n \/\/ - Exported macros imported by the root (is this needed?)\n for( auto& mac : crate.m_root_module.macro_imports_res() )\n {\n if( mac.data.is_MacroRules() && mac.data.as_MacroRules()->m_exported && mac.name != \"\" ) {\n auto v = ::std::make_pair( mac.name, mac.data.as_MacroRules() );\n auto it = exported_macros.find(mac.name);\n if( it == exported_macros.end() )\n {\n auto res = exported_macros.insert( mv$(v) );\n DEBUG(\"- Import \" << mac.name << \"! (from \\\"\" << res.first->second->m_source_crate << \"\\\")\");\n }\n else if( v.second->m_rules.empty() ) {\n \/\/ Skip\n }\n else {\n DEBUG(\"- Replace \" << mac.name << \"! (from \\\"\" << it->second->m_source_crate << \"\\\") with one from \\\"\" << v.second->m_source_crate << \"\\\"\");\n it->second = mv$( v.second );\n }\n }\n }\n \/\/ - Re-exported macros (ignore proc macros for now?)\n for( const auto& mac : crate.m_root_module.m_macro_imports )\n {\n if( mac.is_pub )\n {\n if( !mac.macro_ptr ) {\n continue ;\n }\n auto v = ::std::make_pair( mac.name, mac.macro_ptr );\n\n auto it = exported_macros.find(mac.name);\n if( it == exported_macros.end() )\n {\n auto res = exported_macros.insert( mv$(v) );\n DEBUG(\"- Import \" << mac.name << \"! (from \\\"\" << res.first->second->m_source_crate << \"\\\")\");\n }\n else if( v.second->m_rules.empty() ) {\n \/\/ Skip\n }\n else {\n DEBUG(\"- Replace \" << mac.name << \"! (from \\\"\" << it->second->m_source_crate << \"\\\") with one from \\\"\" << v.second->m_source_crate << \"\\\"\");\n it->second = mv$( v.second );\n }\n }\n }\n }\n}\n\n\n","avg_line_length":39.9720386375,"max_line_length":199,"alphanum_fraction":0.5164896661,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":18895,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":4.0,"content":"\/\/ Copyright (c) 2012-2015 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"rpc\/server.h\"\n#include \"rpc\/client.h\"\n\n#include \"base58.h\"\n#include \"netbase.h\"\n\n#include \"test\/test_ruxcrypto.h\"\n\n#include \n#include \n#include \n\n#include \n\nUniValue CallRPC(std::string args)\n{\n std::vector vArgs;\n boost::split(vArgs, args, boost::is_any_of(\" \\t\"));\n std::string strMethod = vArgs[0];\n vArgs.erase(vArgs.begin());\n JSONRPCRequest request;\n request.strMethod = strMethod;\n request.params = RPCConvertValues(strMethod, vArgs);\n request.fHelp = false;\n BOOST_CHECK(tableRPC[strMethod]);\n rpcfn_type method = tableRPC[strMethod]->actor;\n try {\n UniValue result = (*method)(request);\n return result;\n }\n catch (const UniValue& objError) {\n throw std::runtime_error(find_value(objError, \"message\").get_str());\n }\n}\n\n\nBOOST_FIXTURE_TEST_SUITE(rpc_tests, TestingSetup)\n\nBOOST_AUTO_TEST_CASE(rpc_rawparams)\n{\n \/\/ Test raw transaction API argument handling\n UniValue r;\n\n BOOST_CHECK_THROW(CallRPC(\"getrawtransaction\"), std::runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"getrawtransaction not_hex\"), std::runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"getrawtransaction a3b807410df0b60fcb9736768df5823938b2f838694939ba45f3c0a1bff150ed not_int\"), std::runtime_error);\n\n BOOST_CHECK_THROW(CallRPC(\"createrawtransaction\"), std::runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"createrawtransaction null null\"), std::runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"createrawtransaction not_array\"), std::runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"createrawtransaction [] []\"), std::runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"createrawtransaction {} {}\"), std::runtime_error);\n BOOST_CHECK_NO_THROW(CallRPC(\"createrawtransaction [] {}\"));\n BOOST_CHECK_THROW(CallRPC(\"createrawtransaction [] {} extra\"), std::runtime_error);\n\n BOOST_CHECK_THROW(CallRPC(\"decoderawtransaction\"), std::runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"decoderawtransaction null\"), std::runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"decoderawtransaction DEADBEEF\"), std::runtime_error);\n std::string rawtx = \"0100000001a15d57094aa7a21a28cb20b59aab8fc7d1149a3bdbcddba9c622e4f5f6a99ece010000006c493046022100f93bb0e7d8db7bd46e40132d1f8242026e045f03a0efe71bbb8e3f475e970d790221009337cd7f1f929f00cc6ff01f03729b069a7c21b59b1736ddfee5db5946c5da8c0121033b9b137ee87d5a812d6f506efdd37f0affa7ffc310711c06c7f3e097c9447c52ffffffff0100e1f505000000001976a9140389035a9225b3839e2bbf32d826a1e222031fd888ac00000000\";\n BOOST_CHECK_NO_THROW(r = CallRPC(std::string(\"decoderawtransaction \")+rawtx));\n BOOST_CHECK_EQUAL(find_value(r.get_obj(), \"size\").get_int(), 193);\n BOOST_CHECK_EQUAL(find_value(r.get_obj(), \"version\").get_int(), 1);\n BOOST_CHECK_EQUAL(find_value(r.get_obj(), \"locktime\").get_int(), 0);\n BOOST_CHECK_THROW(r = CallRPC(std::string(\"decoderawtransaction \")+rawtx+\" extra\"), std::runtime_error);\n\n BOOST_CHECK_THROW(CallRPC(\"signrawtransaction\"), std::runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"signrawtransaction null\"), std::runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"signrawtransaction ff00\"), std::runtime_error);\n BOOST_CHECK_NO_THROW(CallRPC(std::string(\"signrawtransaction \")+rawtx));\n BOOST_CHECK_NO_THROW(CallRPC(std::string(\"signrawtransaction \")+rawtx+\" null null NONE|ANYONECANPAY\"));\n BOOST_CHECK_NO_THROW(CallRPC(std::string(\"signrawtransaction \")+rawtx+\" [] [] NONE|ANYONECANPAY\"));\n BOOST_CHECK_THROW(CallRPC(std::string(\"signrawtransaction \")+rawtx+\" null null badenum\"), std::runtime_error);\n\n \/\/ Only check failure cases for sendrawtransaction, there's no network to send to...\n BOOST_CHECK_THROW(CallRPC(\"sendrawtransaction\"), std::runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"sendrawtransaction null\"), std::runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"sendrawtransaction DEADBEEF\"), std::runtime_error);\n BOOST_CHECK_THROW(CallRPC(std::string(\"sendrawtransaction \")+rawtx+\" extra\"), std::runtime_error);\n}\n\nBOOST_AUTO_TEST_CASE(rpc_togglenetwork)\n{\n UniValue r;\n\n r = CallRPC(\"getnetworkinfo\");\n bool netState = find_value(r.get_obj(), \"networkactive\").get_bool();\n BOOST_CHECK_EQUAL(netState, true);\n\n BOOST_CHECK_NO_THROW(CallRPC(\"setnetworkactive false\"));\n r = CallRPC(\"getnetworkinfo\");\n int numConnection = find_value(r.get_obj(), \"connections\").get_int();\n BOOST_CHECK_EQUAL(numConnection, 0);\n\n netState = find_value(r.get_obj(), \"networkactive\").get_bool();\n BOOST_CHECK_EQUAL(netState, false);\n\n BOOST_CHECK_NO_THROW(CallRPC(\"setnetworkactive true\"));\n r = CallRPC(\"getnetworkinfo\");\n netState = find_value(r.get_obj(), \"networkactive\").get_bool();\n BOOST_CHECK_EQUAL(netState, true);\n}\n\nBOOST_AUTO_TEST_CASE(rpc_rawsign)\n{\n UniValue r;\n \/\/ input is a 1-of-2 multisig (so is output):\n std::string prevout =\n \"[{\\\"txid\\\":\\\"b4cc287e58f87cdae59417329f710f3ecd75a4ee1d2872b7248f50977c8493f3\\\",\"\n \"\\\"vout\\\":1,\\\"scriptPubKey\\\":\\\"a914b10c9df5f7edf436c697f02f1efdba4cf399615187\\\",\"\n \"\\\"redeemScript\\\":\\\"512103debedc17b3df2badbcdd86d5feb4562b86fe182e5998abd8bcd4f122c6155b1b21027e940bb73ab8732bfdf7f9216ecefca5b94d6df834e77e108f68e66f126044c052ae\\\"}]\";\n r = CallRPC(std::string(\"createrawtransaction \")+prevout+\" \"+\n \"{\\\"7iYoULd4BAqRsRt1UbD5qqna88JvKRU3SL\\\":11}\");\n std::string notsigned = r.get_str();\n std::string privkey1 = \"\\\"XEwTRsCX3CiWSQf8YmKMTeb84KyTbibkUv9mDTZHQ5MwuKG2ZzES\\\"\";\n std::string privkey2 = \"\\\"XDmZ7LjGd94Q81eUBjb2h6uV5Y14s7fmeXWEGYabfBJP8RVpprBu\\\"\";\n r = CallRPC(std::string(\"signrawtransaction \")+notsigned+\" \"+prevout+\" \"+\"[]\");\n BOOST_CHECK(find_value(r.get_obj(), \"complete\").get_bool() == false);\n r = CallRPC(std::string(\"signrawtransaction \")+notsigned+\" \"+prevout+\" \"+\"[\"+privkey1+\",\"+privkey2+\"]\");\n BOOST_CHECK(find_value(r.get_obj(), \"complete\").get_bool() == true);\n}\n\nBOOST_AUTO_TEST_CASE(rpc_createraw_op_return)\n{\n BOOST_CHECK_NO_THROW(CallRPC(\"createrawtransaction [{\\\"txid\\\":\\\"a3b807410df0b60fcb9736768df5823938b2f838694939ba45f3c0a1bff150ed\\\",\\\"vout\\\":0}] {\\\"data\\\":\\\"68656c6c6f776f726c64\\\"}\"));\n\n \/\/ Allow more than one data transaction output\n BOOST_CHECK_NO_THROW(CallRPC(\"createrawtransaction [{\\\"txid\\\":\\\"a3b807410df0b60fcb9736768df5823938b2f838694939ba45f3c0a1bff150ed\\\",\\\"vout\\\":0}] {\\\"data\\\":\\\"68656c6c6f776f726c64\\\",\\\"data\\\":\\\"68656c6c6f776f726c64\\\"}\"));\n\n \/\/ Key not \"data\" (bad address)\n BOOST_CHECK_THROW(CallRPC(\"createrawtransaction [{\\\"txid\\\":\\\"a3b807410df0b60fcb9736768df5823938b2f838694939ba45f3c0a1bff150ed\\\",\\\"vout\\\":0}] {\\\"somedata\\\":\\\"68656c6c6f776f726c64\\\"}\"), std::runtime_error);\n\n \/\/ Bad hex encoding of data output\n BOOST_CHECK_THROW(CallRPC(\"createrawtransaction [{\\\"txid\\\":\\\"a3b807410df0b60fcb9736768df5823938b2f838694939ba45f3c0a1bff150ed\\\",\\\"vout\\\":0}] {\\\"data\\\":\\\"12345\\\"}\"), std::runtime_error);\n BOOST_CHECK_THROW(CallRPC(\"createrawtransaction [{\\\"txid\\\":\\\"a3b807410df0b60fcb9736768df5823938b2f838694939ba45f3c0a1bff150ed\\\",\\\"vout\\\":0}] {\\\"data\\\":\\\"12345g\\\"}\"), std::runtime_error);\n\n \/\/ Data 81 bytes long\n BOOST_CHECK_NO_THROW(CallRPC(\"createrawtransaction [{\\\"txid\\\":\\\"a3b807410df0b60fcb9736768df5823938b2f838694939ba45f3c0a1bff150ed\\\",\\\"vout\\\":0}] {\\\"data\\\":\\\"010203040506070809101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081\\\"}\"));\n}\n\nBOOST_AUTO_TEST_CASE(rpc_format_monetary_values)\n{\n BOOST_CHECK(ValueFromAmount(0LL).write() == \"0.00000000\");\n BOOST_CHECK(ValueFromAmount(1LL).write() == \"0.00000001\");\n BOOST_CHECK(ValueFromAmount(17622195LL).write() == \"0.17622195\");\n BOOST_CHECK(ValueFromAmount(50000000LL).write() == \"0.50000000\");\n BOOST_CHECK(ValueFromAmount(89898989LL).write() == \"0.89898989\");\n BOOST_CHECK(ValueFromAmount(100000000LL).write() == \"1.00000000\");\n BOOST_CHECK(ValueFromAmount(2099999999999990LL).write() == \"20999999.99999990\");\n BOOST_CHECK(ValueFromAmount(2099999999999999LL).write() == \"20999999.99999999\");\n\n BOOST_CHECK_EQUAL(ValueFromAmount(0).write(), \"0.00000000\");\n BOOST_CHECK_EQUAL(ValueFromAmount((COIN\/10000)*123456789).write(), \"12345.67890000\");\n BOOST_CHECK_EQUAL(ValueFromAmount(-COIN).write(), \"-1.00000000\");\n BOOST_CHECK_EQUAL(ValueFromAmount(-COIN\/10).write(), \"-0.10000000\");\n\n BOOST_CHECK_EQUAL(ValueFromAmount(COIN*100000000).write(), \"100000000.00000000\");\n BOOST_CHECK_EQUAL(ValueFromAmount(COIN*10000000).write(), \"10000000.00000000\");\n BOOST_CHECK_EQUAL(ValueFromAmount(COIN*1000000).write(), \"1000000.00000000\");\n BOOST_CHECK_EQUAL(ValueFromAmount(COIN*100000).write(), \"100000.00000000\");\n BOOST_CHECK_EQUAL(ValueFromAmount(COIN*10000).write(), \"10000.00000000\");\n BOOST_CHECK_EQUAL(ValueFromAmount(COIN*1000).write(), \"1000.00000000\");\n BOOST_CHECK_EQUAL(ValueFromAmount(COIN*100).write(), \"100.00000000\");\n BOOST_CHECK_EQUAL(ValueFromAmount(COIN*10).write(), \"10.00000000\");\n BOOST_CHECK_EQUAL(ValueFromAmount(COIN).write(), \"1.00000000\");\n BOOST_CHECK_EQUAL(ValueFromAmount(COIN\/10).write(), \"0.10000000\");\n BOOST_CHECK_EQUAL(ValueFromAmount(COIN\/100).write(), \"0.01000000\");\n BOOST_CHECK_EQUAL(ValueFromAmount(COIN\/1000).write(), \"0.00100000\");\n BOOST_CHECK_EQUAL(ValueFromAmount(COIN\/10000).write(), \"0.00010000\");\n BOOST_CHECK_EQUAL(ValueFromAmount(COIN\/100000).write(), \"0.00001000\");\n BOOST_CHECK_EQUAL(ValueFromAmount(COIN\/1000000).write(), \"0.00000100\");\n BOOST_CHECK_EQUAL(ValueFromAmount(COIN\/10000000).write(), \"0.00000010\");\n BOOST_CHECK_EQUAL(ValueFromAmount(COIN\/100000000).write(), \"0.00000001\");\n}\n\nstatic UniValue ValueFromString(const std::string &str)\n{\n UniValue value;\n BOOST_CHECK(value.setNumStr(str));\n return value;\n}\n\nBOOST_AUTO_TEST_CASE(rpc_parse_monetary_values)\n{\n BOOST_CHECK_THROW(AmountFromValue(ValueFromString(\"-0.00000001\")), UniValue);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0\")), 0LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0.00000000\")), 0LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0.00000001\")), 1LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0.17622195\")), 17622195LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0.5\")), 50000000LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0.50000000\")), 50000000LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0.89898989\")), 89898989LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"1.00000000\")), 100000000LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"20999999.9999999\")), 2099999999999990LL);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"20999999.99999999\")), 2099999999999999LL);\n\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"1e-8\")), COIN\/100000000);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0.1e-7\")), COIN\/100000000);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0.01e-6\")), COIN\/100000000);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0.0000000000000000000000000000000000000000000000000000000000000000000000000001e+68\")), COIN\/100000000);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"10000000000000000000000000000000000000000000000000000000000000000e-64\")), COIN);\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0.000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000e64\")), COIN);\n\n BOOST_CHECK_THROW(AmountFromValue(ValueFromString(\"1e-9\")), UniValue); \/\/should fail\n BOOST_CHECK_THROW(AmountFromValue(ValueFromString(\"0.000000019\")), UniValue); \/\/should fail\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0.00000001000000\")), 1LL); \/\/should pass, cut trailing 0\n BOOST_CHECK_THROW(AmountFromValue(ValueFromString(\"19e-9\")), UniValue); \/\/should fail\n BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString(\"0.19e-6\")), 19); \/\/should pass, leading 0 is present\n\n BOOST_CHECK_THROW(AmountFromValue(ValueFromString(\"92233720368.54775808\")), UniValue); \/\/overflow error\n BOOST_CHECK_THROW(AmountFromValue(ValueFromString(\"1e+11\")), UniValue); \/\/overflow error\n BOOST_CHECK_THROW(AmountFromValue(ValueFromString(\"1e11\")), UniValue); \/\/overflow error signless\n BOOST_CHECK_THROW(AmountFromValue(ValueFromString(\"93e+9\")), UniValue); \/\/overflow error\n}\n\nBOOST_AUTO_TEST_CASE(json_parse_errors)\n{\n \/\/ Valid\n BOOST_CHECK_EQUAL(ParseNonRFCJSONValue(\"1.0\").get_real(), 1.0);\n \/\/ Valid, with leading or trailing whitespace\n BOOST_CHECK_EQUAL(ParseNonRFCJSONValue(\" 1.0\").get_real(), 1.0);\n BOOST_CHECK_EQUAL(ParseNonRFCJSONValue(\"1.0 \").get_real(), 1.0);\n\n BOOST_CHECK_THROW(AmountFromValue(ParseNonRFCJSONValue(\".19e-6\")), std::runtime_error); \/\/should fail, missing leading 0, therefore invalid JSON\n BOOST_CHECK_EQUAL(AmountFromValue(ParseNonRFCJSONValue(\"0.00000000000000000000000000000000000001e+30 \")), 1);\n \/\/ Invalid, initial garbage\n BOOST_CHECK_THROW(ParseNonRFCJSONValue(\"[1.0\"), std::runtime_error);\n BOOST_CHECK_THROW(ParseNonRFCJSONValue(\"a1.0\"), std::runtime_error);\n \/\/ Invalid, trailing garbage\n BOOST_CHECK_THROW(ParseNonRFCJSONValue(\"1.0sds\"), std::runtime_error);\n BOOST_CHECK_THROW(ParseNonRFCJSONValue(\"1.0]\"), std::runtime_error);\n \/\/ BTC addresses should fail parsing\n BOOST_CHECK_THROW(ParseNonRFCJSONValue(\"175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W\"), std::runtime_error);\n BOOST_CHECK_THROW(ParseNonRFCJSONValue(\"3J98t1WpEZ73CNmQviecrnyiWrnqRhWNL\"), std::runtime_error);\n}\n\nBOOST_AUTO_TEST_CASE(rpc_ban)\n{\n BOOST_CHECK_NO_THROW(CallRPC(std::string(\"clearbanned\")));\n\n UniValue r;\n BOOST_CHECK_NO_THROW(r = CallRPC(std::string(\"setban 127.0.0.0 add\")));\n BOOST_CHECK_THROW(r = CallRPC(std::string(\"setban 127.0.0.0:8334\")), std::runtime_error); \/\/portnumber for setban not allowed\n BOOST_CHECK_NO_THROW(r = CallRPC(std::string(\"listbanned\")));\n UniValue ar = r.get_array();\n UniValue o1 = ar[0].get_obj();\n UniValue adr = find_value(o1, \"address\");\n BOOST_CHECK_EQUAL(adr.get_str(), \"127.0.0.0\/32\");\n BOOST_CHECK_NO_THROW(CallRPC(std::string(\"setban 127.0.0.0 remove\")));\n BOOST_CHECK_NO_THROW(r = CallRPC(std::string(\"listbanned\")));\n ar = r.get_array();\n BOOST_CHECK_EQUAL(ar.size(), 0);\n\n BOOST_CHECK_NO_THROW(r = CallRPC(std::string(\"setban 127.0.0.0\/24 add 1607731200 true\")));\n BOOST_CHECK_NO_THROW(r = CallRPC(std::string(\"listbanned\")));\n ar = r.get_array();\n o1 = ar[0].get_obj();\n adr = find_value(o1, \"address\");\n UniValue banned_until = find_value(o1, \"banned_until\");\n BOOST_CHECK_EQUAL(adr.get_str(), \"127.0.0.0\/24\");\n BOOST_CHECK_EQUAL(banned_until.get_int64(), 1607731200); \/\/ absolute time check\n\n BOOST_CHECK_NO_THROW(CallRPC(std::string(\"clearbanned\")));\n\n BOOST_CHECK_NO_THROW(r = CallRPC(std::string(\"setban 127.0.0.0\/24 add 200\")));\n BOOST_CHECK_NO_THROW(r = CallRPC(std::string(\"listbanned\")));\n ar = r.get_array();\n o1 = ar[0].get_obj();\n adr = find_value(o1, \"address\");\n banned_until = find_value(o1, \"banned_until\");\n BOOST_CHECK_EQUAL(adr.get_str(), \"127.0.0.0\/24\");\n int64_t now = GetTime();\n BOOST_CHECK(banned_until.get_int64() > now);\n BOOST_CHECK(banned_until.get_int64()-now <= 200);\n\n \/\/ must throw an exception because 127.0.0.1 is in already banned suubnet range\n BOOST_CHECK_THROW(r = CallRPC(std::string(\"setban 127.0.0.1 add\")), std::runtime_error);\n\n BOOST_CHECK_NO_THROW(CallRPC(std::string(\"setban 127.0.0.0\/24 remove\")));\n BOOST_CHECK_NO_THROW(r = CallRPC(std::string(\"listbanned\")));\n ar = r.get_array();\n BOOST_CHECK_EQUAL(ar.size(), 0);\n\n BOOST_CHECK_NO_THROW(r = CallRPC(std::string(\"setban 127.0.0.0\/255.255.0.0 add\")));\n BOOST_CHECK_THROW(r = CallRPC(std::string(\"setban 127.0.1.1 add\")), std::runtime_error);\n\n BOOST_CHECK_NO_THROW(CallRPC(std::string(\"clearbanned\")));\n BOOST_CHECK_NO_THROW(r = CallRPC(std::string(\"listbanned\")));\n ar = r.get_array();\n BOOST_CHECK_EQUAL(ar.size(), 0);\n\n\n BOOST_CHECK_THROW(r = CallRPC(std::string(\"setban test add\")), std::runtime_error); \/\/invalid IP\n\n \/\/IPv6 tests\n BOOST_CHECK_NO_THROW(r = CallRPC(std::string(\"setban FE80:0000:0000:0000:0202:B3FF:FE1E:8329 add\")));\n BOOST_CHECK_NO_THROW(r = CallRPC(std::string(\"listbanned\")));\n ar = r.get_array();\n o1 = ar[0].get_obj();\n adr = find_value(o1, \"address\");\n BOOST_CHECK_EQUAL(adr.get_str(), \"fe80::202:b3ff:fe1e:8329\/128\");\n\n BOOST_CHECK_NO_THROW(CallRPC(std::string(\"clearbanned\")));\n BOOST_CHECK_NO_THROW(r = CallRPC(std::string(\"setban 2001:db8::\/ffff:fffc:0:0:0:0:0:0 add\")));\n BOOST_CHECK_NO_THROW(r = CallRPC(std::string(\"listbanned\")));\n ar = r.get_array();\n o1 = ar[0].get_obj();\n adr = find_value(o1, \"address\");\n BOOST_CHECK_EQUAL(adr.get_str(), \"2001:db8::\/30\");\n\n BOOST_CHECK_NO_THROW(CallRPC(std::string(\"clearbanned\")));\n BOOST_CHECK_NO_THROW(r = CallRPC(std::string(\"setban 2001:4d48:ac57:400:cacf:e9ff:fe1d:9c63\/128 add\")));\n BOOST_CHECK_NO_THROW(r = CallRPC(std::string(\"listbanned\")));\n ar = r.get_array();\n o1 = ar[0].get_obj();\n adr = find_value(o1, \"address\");\n BOOST_CHECK_EQUAL(adr.get_str(), \"2001:4d48:ac57:400:cacf:e9ff:fe1d:9c63\/128\");\n}\n\n#if ENABLE_MINER\nBOOST_AUTO_TEST_CASE(rpc_convert_values_generatetoaddress)\n{\n UniValue result;\n\n BOOST_CHECK_NO_THROW(result = RPCConvertValues(\"generatetoaddress\", boost::assign::list_of(\"101\")(\"yhq7ifNCtTKEpY4Yu5XPCcztQco6Fh6JsZ\")));\n BOOST_CHECK_EQUAL(result[0].get_int(), 101);\n BOOST_CHECK_EQUAL(result[1].get_str(), \"yhq7ifNCtTKEpY4Yu5XPCcztQco6Fh6JsZ\");\n\n BOOST_CHECK_NO_THROW(result = RPCConvertValues(\"generatetoaddress\", boost::assign::list_of(\"101\")(\"yTretFTpoi3oQ3maZk5QadGaDWPiKnmDBc\")));\n BOOST_CHECK_EQUAL(result[0].get_int(), 101);\n BOOST_CHECK_EQUAL(result[1].get_str(), \"yTretFTpoi3oQ3maZk5QadGaDWPiKnmDBc\");\n\n BOOST_CHECK_NO_THROW(result = RPCConvertValues(\"generatetoaddress\", boost::assign::list_of(\"1\")(\"yNbNZyCiTYSFtDwEXt7jChV7tZVYX862ua\")(\"9\")));\n BOOST_CHECK_EQUAL(result[0].get_int(), 1);\n BOOST_CHECK_EQUAL(result[1].get_str(), \"yNbNZyCiTYSFtDwEXt7jChV7tZVYX862ua\");\n BOOST_CHECK_EQUAL(result[2].get_int(), 9);\n\n BOOST_CHECK_NO_THROW(result = RPCConvertValues(\"generatetoaddress\", boost::assign::list_of(\"1\")(\"yTG8jLL3MvteKXgbEcHyaN7JvTPCejQpSh\")(\"9\")));\n BOOST_CHECK_EQUAL(result[0].get_int(), 1);\n BOOST_CHECK_EQUAL(result[1].get_str(), \"yTG8jLL3MvteKXgbEcHyaN7JvTPCejQpSh\");\n BOOST_CHECK_EQUAL(result[2].get_int(), 9);\n}\n#endif \/\/ ENABLE_MINER\n\nBOOST_AUTO_TEST_SUITE_END()\n","avg_line_length":54.1404011461,"max_line_length":413,"alphanum_fraction":0.7463879333,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":4200,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["Intel"],"max_stars_count":38.0,"content":"#include \"StdAfx.h\"\n#include \"BSCyclicBlendTransitionGenerator_1.h\"\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n\nstatic const hkInternalClassEnumItem CurrentBlendModeEnumItems[] =\n{\n {-1, \"MODE_INACTIVE\"},\n {0, \"MODE_DEFAULT\"},\n {1, \"MODE_FROZEN\"},\n {2, \"MODE_BLENDING\"},\n {3, \"MODE_WAITINGFORBLENDING\"},\n};\n\nstatic const hkInternalClassEnum BSCyclicBlendTransitionGeneratorClass_Enums[] = {\n {\"CurrentBlendMode\", CurrentBlendModeEnumItems, _countof(CurrentBlendModeEnumItems), HK_NULL, 0 },\n};\nconst hkClassEnum* CurrentBlendModeEnum = reinterpret_cast(&BSCyclicBlendTransitionGeneratorClass_Enums[0]);\nextern const hkClassEnum* BlendCurveEnum;\n\nstatic const hkInternalClassMember BSCyclicBlendTransitionGeneratorClass_Members[] =\n{\n { \"pBlenderGenerator\",&hkbGeneratorClass,HK_NULL,hkClassMember::TYPE_POINTER,hkClassMember::TYPE_STRUCT,0,hkClassMember::ALIGN_16,HK_OFFSET_OF(BSCyclicBlendTransitionGenerator,m_pBlenderGenerator) \/*48*\/,HK_NULL},\n { \"EventToFreezeBlendValue\",&hkbEventPropertyClass,HK_NULL,hkClassMember::TYPE_STRUCT,hkClassMember::TYPE_VOID,0,hkClassMember::FLAGS_NONE,HK_OFFSET_OF(BSCyclicBlendTransitionGenerator,m_EventToFreezeBlendValue) \/*52*\/,HK_NULL},\n { \"EventToCrossBlend\",&hkbEventPropertyClass,HK_NULL,hkClassMember::TYPE_STRUCT,hkClassMember::TYPE_VOID,0,hkClassMember::FLAGS_NONE,HK_OFFSET_OF(BSCyclicBlendTransitionGenerator,m_EventToCrossBlend) \/*60*\/,HK_NULL},\n { \"fBlendParameter\",HK_NULL,HK_NULL,hkClassMember::TYPE_REAL,hkClassMember::TYPE_VOID,0,hkClassMember::FLAGS_NONE,HK_OFFSET_OF(BSCyclicBlendTransitionGenerator,m_fBlendParameter) \/*68*\/,HK_NULL},\n { \"fTransitionDuration\",HK_NULL,HK_NULL,hkClassMember::TYPE_REAL,hkClassMember::TYPE_VOID,0,hkClassMember::FLAGS_NONE,HK_OFFSET_OF(BSCyclicBlendTransitionGenerator,m_fTransitionDuration) \/*72*\/,HK_NULL},\n { \"eBlendCurve\",HK_NULL,BlendCurveEnum,hkClassMember::TYPE_ENUM,hkClassMember::TYPE_INT8,0,hkClassMember::FLAGS_NONE,HK_OFFSET_OF(BSCyclicBlendTransitionGenerator,m_eBlendCurve) \/*76*\/,HK_NULL},\n { \"pTransitionBlenderGenerator\",HK_NULL,HK_NULL,hkClassMember::TYPE_POINTER,hkClassMember::TYPE_VOID,0,hkClassMember::ALIGN_16 | hkClassMember::SERIALIZE_IGNORED,HK_OFFSET_OF(BSCyclicBlendTransitionGenerator,m_pTransitionBlenderGenerator) \/*80*\/,HK_NULL},\n { \"pTransitionEffect\",HK_NULL,HK_NULL,hkClassMember::TYPE_POINTER,hkClassMember::TYPE_VOID,0,hkClassMember::ALIGN_16 | hkClassMember::SERIALIZE_IGNORED,HK_OFFSET_OF(BSCyclicBlendTransitionGenerator,m_pTransitionEffect) \/*96*\/,HK_NULL},\n { \"currentMode\",HK_NULL,HK_NULL,hkClassMember::TYPE_ENUM,hkClassMember::TYPE_INT8,0,hkClassMember::SERIALIZE_IGNORED,HK_OFFSET_OF(BSCyclicBlendTransitionGenerator,m_currentMode) \/*100*\/,HK_NULL},\n};\n\n\/\/ Signature: 5119eb06\nextern const hkClass hkbGeneratorClass;\nextern const hkClass BSCyclicBlendTransitionGeneratorClass;\nconst hkClass BSCyclicBlendTransitionGeneratorClass(\n \"BSCyclicBlendTransitionGenerator\",\n &hkbGeneratorClass, \/\/ parent\n sizeof(BSCyclicBlendTransitionGenerator),\n HK_NULL, 0, \/\/ interfaces\n reinterpret_cast(BSCyclicBlendTransitionGeneratorClass_Enums), HK_COUNT_OF(BSCyclicBlendTransitionGeneratorClass_Enums),\n reinterpret_cast(BSCyclicBlendTransitionGeneratorClass_Members), HK_COUNT_OF(BSCyclicBlendTransitionGeneratorClass_Members),\n HK_NULL, \/\/ defaults\n HK_NULL, \/\/ attributes\n 0, \/\/ flags\n 1 \/\/ version\n );\nHK_REFLECTION_DEFINE_VIRTUAL(BSCyclicBlendTransitionGenerator, BSCyclicBlendTransitionGenerator);\n\n","avg_line_length":66.6666666667,"max_line_length":258,"alphanum_fraction":0.8307142857,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":4492,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":4.0,"content":"\/*\n * Copyright (C) 2007 Tommi Maekitalo\n * \n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n * \n * As a special exception, you may use this file as part of a free\n * software library without restriction. Specifically, if other files\n * instantiate templates or use macros or inline functions from this\n * file, or you compile this file and link it with other files to\n * produce an executable, this file does not by itself cause the\n * resulting executable to be covered by the GNU General Public\n * License. This exception does not however invalidate any other\n * reasons why the executable file might be covered by the GNU Library\n * General Public License.\n * \n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n * \n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n *\/\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nlog_define(\"cxxtools.pipestream\")\n\nnamespace cxxtools\n{\nnamespace posix\n{\n Pipestreambuf::Pipestreambuf(unsigned bufsize_)\n : bufsize(bufsize_),\n ibuffer(0),\n obuffer(0)\n { }\n\n Pipestreambuf::~Pipestreambuf()\n {\n log_debug(\"Pipestreambuf::~Pipestreambuf()\");\n\n try\n {\n closeReadFd();\n }\n catch (const std::exception& e)\n {\n log_debug(\"ignore exception in closing read pipe: \" << e.what());\n }\n\n try\n {\n closeWriteFd();\n }\n catch (const std::exception& e)\n {\n log_debug(\"ignore exception in closing write pipe: \" << e.what());\n }\n\n delete [] ibuffer;\n delete [] obuffer;\n }\n\n std::streambuf::int_type Pipestreambuf::overflow(std::streambuf::int_type ch)\n {\n log_debug(\"overflow(\" << ch << ')');\n\n if (pptr() != pbase())\n {\n log_debug(\"write \" << (pptr() - pbase()) << \" bytes to fd \" << getWriteFd());\n ssize_t ret = ::write(getWriteFd(), pbase(), pptr() - pbase());\n\n if(ret < 0)\n throw SystemError(errno, \"write\");\n\n if (ret == 0)\n return traits_type::eof();\n else\n {\n log_debug(ret << \" bytes written to fd \" << getWriteFd());\n if (static_cast(ret) < bufsize)\n std::memmove(obuffer, obuffer + ret, bufsize - ret);\n setp(obuffer, obuffer + bufsize);\n pbump(bufsize - ret);\n }\n }\n else\n {\n log_debug(\"initialize outputbuffer\");\n if (obuffer == 0)\n {\n log_debug(\"allocate \" << bufsize << \" bytes output buffer\");\n obuffer = new char[bufsize];\n }\n\n setp(obuffer, obuffer + bufsize);\n }\n\n if (ch != traits_type::eof())\n {\n *pptr() = traits_type::to_char_type(ch);\n pbump(1);\n }\n\n return 0;\n }\n\n std::streambuf::int_type Pipestreambuf::underflow()\n {\n log_debug(\"underflow()\");\n\n if (ibuffer == 0)\n {\n log_debug(\"allocate \" << bufsize << \" bytes input buffer\");\n ibuffer = new char[bufsize];\n }\n\n log_debug(\"read from fd \" << getReadFd());\n int ret = ::read(getReadFd(), ibuffer, bufsize);\n log_debug(\"read returned \" << ret);\n\n if(ret < 0)\n throw SystemError(errno, \"read\");\n\n if (ret == 0)\n return traits_type::eof();\n\n log_debug(ret << \" bytes read\");\n setg(ibuffer, ibuffer, ibuffer + ret);\n\n return *gptr();\n }\n\n int Pipestreambuf::sync()\n {\n log_debug(\"sync()\");\n if (pptr() != pbase())\n {\n char* p = pbase();\n while (p < pptr())\n {\n log_debug(\"write \" << (pptr() - p) << \" bytes to fd \" << getWriteFd());\n ssize_t ret = ::write(getWriteFd(), p, pptr() - p);\n\n if(ret < 0)\n throw SystemError(errno, \"write\");\n\n if (ret == 0)\n return traits_type::eof();\n\n log_debug(ret << \" bytes written to fd \" << getWriteFd());\n p += ret;\n }\n setp(obuffer, obuffer + bufsize);\n }\n return 0;\n }\n\n}\n}\n","avg_line_length":25.816091954,"max_line_length":83,"alphanum_fraction":0.6119768477,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":986,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":170.0,"content":"#include\n#include\n\n#define sd(x) scanf(\"%d\",&x);\n#define sd2(x,y) scanf(\"%d %d\",&x,&y);\n#define sd3(x,y,z) scanf(\"%d %d %d\",&x,&y,&z);\n#define sull(x) scanf(\"%ull\",&x);\n#define print(x) printf(\"%d\\n\",x);\n#define print2(x,y) printf(\"%d %d\\n\",x,y);\n#define print3(x,y,z) printf(\"%d %d %d\\n\",x,y,z);\n#define printull(x) printf(\"%ull\\n\",x);\n#define max(x,y) ((x) > (y))? (x):(y);\n\nint main(){\n\tint m, p, y, n, type, charge, res, p_temp, interest, i, j;\n\tdouble rate;\n\tsd(m);\n\twhile(m--){\n\t\tsd(p);\n\t\tsd(y);\n\t\tsd(n);\n\t\tres = 0;\n\t\tfor(i = 0; i < n; i++){\n\t\t\tscanf(\"%d %lf %d\",&type, &rate, &charge);\t\n\t\t\tp_temp = p, interest = 0;\n\t\t\tif(type == 0){\n\t\t\t\tfor(j = 0; j < y; j++){\n\t\t\t\t\tinterest += (p_temp * rate);\n\t\t\t\t\tp_temp -= charge;\n\t\t\t\t}\n\t\t\t\tres = max(res, p_temp + interest);\n\t\t\t}\n\t\t\telse{\n\t\t\t\tfor(j = 0; j < y; j++){\n\t\t\t\t\tinterest = p_temp * rate;\n\t\t\t\t\tp_temp = p_temp + interest - charge;\n\t\t\t\t}\n\t\t\t\tres = max(res, p_temp);\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",res);\n\t}\n\treturn 0;\n}\n","avg_line_length":21.9111111111,"max_line_length":59,"alphanum_fraction":0.5070993915,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":7465,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":2.0,"content":"\/\/--------------------------------------------------------------------------------------\r\n\/\/ SimpleTriangleUWP.cpp\r\n\/\/\r\n\/\/ Advanced Technology Group (ATG)\r\n\/\/ Copyright (C) Microsoft Corporation. All rights reserved.\r\n\/\/--------------------------------------------------------------------------------------\r\n\r\n#include \"pch.h\"\r\n#include \"SimpleTriangleUWP.h\"\r\n\r\n#include \"ATGColors.h\"\r\n#include \"ReadData.h\"\r\n\r\nextern void ExitSample();\r\n\r\nusing namespace DirectX;\r\n\r\nusing Microsoft::WRL::ComPtr;\r\n\r\nnamespace\r\n{\r\n struct Vertex\r\n {\r\n XMFLOAT4 position;\r\n XMFLOAT4 color;\r\n };\r\n}\r\n\r\nSample::Sample()\r\n{\r\n \/\/ Use gamma-correct rendering.\r\n m_deviceResources = std::make_unique(\r\n DXGI_FORMAT_B8G8R8A8_UNORM_SRGB,\r\n DXGI_FORMAT_D24_UNORM_S8_UINT,\r\n 2,\r\n D3D_FEATURE_LEVEL_9_3,\r\n DX::DeviceResources::c_AllowTearing\r\n );\r\n m_deviceResources->RegisterDeviceNotify(this);\r\n}\r\n\r\n\/\/ Initialize the Direct3D resources required to run.\r\nvoid Sample::Initialize(IUnknown* window, int width, int height, DXGI_MODE_ROTATION rotation)\r\n{\r\n m_gamePad = std::make_unique();\r\n\r\n m_keyboard = std::make_unique();\r\n m_keyboard->SetWindow(reinterpret_cast(window));\r\n\r\n m_deviceResources->SetWindow(window, width, height, rotation);\r\n\r\n m_deviceResources->CreateDeviceResources(); \t\r\n CreateDeviceDependentResources();\r\n\r\n m_deviceResources->CreateWindowSizeDependentResources();\r\n CreateWindowSizeDependentResources();\r\n}\r\n\r\n#pragma region Frame Update\r\n\/\/ Executes basic render loop.\r\nvoid Sample::Tick()\r\n{\r\n m_timer.Tick([&]()\r\n {\r\n Update(m_timer);\r\n });\r\n\r\n Render();\r\n}\r\n\r\n\/\/ Updates the world.\r\nvoid Sample::Update(DX::StepTimer const&)\r\n{\r\n PIXBeginEvent(PIX_COLOR_DEFAULT, L\"Update\");\r\n\r\n auto pad = m_gamePad->GetState(0);\r\n if (pad.IsConnected())\r\n {\r\n if (pad.IsViewPressed())\r\n {\r\n ExitSample();\r\n }\r\n }\r\n\r\n auto kb = m_keyboard->GetState();\r\n if (kb.Escape)\r\n {\r\n ExitSample();\r\n }\r\n\r\n PIXEndEvent();\r\n}\r\n#pragma endregion\r\n\r\n#pragma region Frame Render\r\n\/\/ Draws the scene.\r\nvoid Sample::Render()\r\n{\r\n \/\/ Don't try to render anything before the first Update.\r\n if (m_timer.GetFrameCount() == 0)\r\n {\r\n return;\r\n }\r\n\r\n Clear();\r\n\r\n auto context = m_deviceResources->GetD3DDeviceContext();\r\n PIXBeginEvent(context, PIX_COLOR_DEFAULT, L\"Render\");\r\n\r\n \/\/ Set input assembler state.\r\n context->IASetInputLayout(m_spInputLayout.Get());\r\n\r\n UINT strides = sizeof(Vertex);\r\n UINT offsets = 0;\r\n context->IASetPrimitiveTopology(D3D11_PRIMITIVE_TOPOLOGY_TRIANGLELIST);\r\n context->IASetVertexBuffers(0, 1, m_spVertexBuffer.GetAddressOf(), &strides, &offsets);\r\n\r\n \/\/ Set shaders.\r\n context->VSSetShader(m_spVertexShader.Get(), nullptr, 0);\r\n context->GSSetShader(nullptr, nullptr, 0);\r\n context->PSSetShader(m_spPixelShader.Get(), nullptr, 0);\r\n\r\n \/\/ Draw triangle.\r\n context->Draw(3, 0);\r\n\r\n PIXEndEvent(context);\r\n\r\n \/\/ Show the new frame.\r\n PIXBeginEvent(PIX_COLOR_DEFAULT, L\"Present\");\r\n m_deviceResources->Present();\r\n PIXEndEvent();\r\n}\r\n\r\n\/\/ Helper method to clear the back buffers.\r\nvoid Sample::Clear()\r\n{\r\n auto context = m_deviceResources->GetD3DDeviceContext();\r\n PIXBeginEvent(context, PIX_COLOR_DEFAULT, L\"Clear\");\r\n\r\n \/\/ Clear the views.\r\n auto renderTarget = m_deviceResources->GetRenderTargetView();\r\n auto depthStencil = m_deviceResources->GetDepthStencilView();\r\n\r\n \/\/ Use linear clear color for gamma-correct rendering.\r\n context->ClearRenderTargetView(renderTarget, ATG::ColorsLinear::Background);\r\n\r\n context->ClearDepthStencilView(depthStencil, D3D11_CLEAR_DEPTH | D3D11_CLEAR_STENCIL, 1.0f, 0);\r\n\r\n context->OMSetRenderTargets(1, &renderTarget, depthStencil);\r\n\r\n \/\/ Set the viewport.\r\n auto viewport = m_deviceResources->GetScreenViewport();\r\n context->RSSetViewports(1, &viewport);\r\n\r\n PIXEndEvent(context);\r\n}\r\n#pragma endregion\r\n\r\n#pragma region Message Handlers\r\n\/\/ Message handlers\r\nvoid Sample::OnActivated()\r\n{\r\n}\r\n\r\nvoid Sample::OnDeactivated()\r\n{\r\n}\r\n\r\nvoid Sample::OnSuspending()\r\n{\r\n auto context = m_deviceResources->GetD3DDeviceContext();\r\n context->ClearState();\r\n\r\n m_deviceResources->Trim();\r\n}\r\n\r\nvoid Sample::OnResuming()\r\n{\r\n m_timer.ResetElapsedTime();\r\n}\r\n\r\nvoid Sample::OnWindowSizeChanged(int width, int height, DXGI_MODE_ROTATION rotation)\r\n{\r\n if (!m_deviceResources->WindowSizeChanged(width, height, rotation))\r\n return;\r\n\r\n CreateWindowSizeDependentResources();\r\n}\r\n\r\nvoid Sample::ValidateDevice()\r\n{\r\n m_deviceResources->ValidateDevice();\r\n}\r\n\r\n\/\/ Properties\r\nvoid Sample::GetDefaultSize(int& width, int& height) const\r\n{\r\n width = 1280;\r\n height = 720;\r\n}\r\n#pragma endregion\r\n\r\n#pragma region Direct3D Resources\r\n\/\/ These are the resources that depend on the device.\r\nvoid Sample::CreateDeviceDependentResources()\r\n{\r\n auto device = m_deviceResources->GetD3DDevice();\r\n\r\n \/\/ Load and create shaders.\r\n auto vertexShaderBlob = DX::ReadData(L\"VertexShader.cso\");\r\n\r\n DX::ThrowIfFailed(\r\n device->CreateVertexShader(vertexShaderBlob.data(), vertexShaderBlob.size(),\r\n nullptr, m_spVertexShader.ReleaseAndGetAddressOf()));\r\n\r\n auto pixelShaderBlob = DX::ReadData(L\"PixelShader.cso\");\r\n\r\n DX::ThrowIfFailed(\r\n device->CreatePixelShader(pixelShaderBlob.data(), pixelShaderBlob.size(),\r\n nullptr, m_spPixelShader.ReleaseAndGetAddressOf()));\r\n\r\n \/\/ Create input layout.\r\n static const D3D11_INPUT_ELEMENT_DESC s_inputElementDesc[2] =\r\n {\r\n { \"SV_Position\", 0, DXGI_FORMAT_R32G32B32A32_FLOAT, 0, 0, D3D11_INPUT_PER_VERTEX_DATA, 0 },\r\n { \"COLOR\", 0, DXGI_FORMAT_R32G32B32A32_FLOAT, 0, 16, D3D11_INPUT_PER_VERTEX_DATA , 0 },\r\n };\r\n\r\n DX::ThrowIfFailed(\r\n device->CreateInputLayout(s_inputElementDesc, _countof(s_inputElementDesc),\r\n vertexShaderBlob.data(), vertexShaderBlob.size(),\r\n m_spInputLayout.ReleaseAndGetAddressOf()));\r\n\r\n \/\/ Create vertex buffer.\r\n static const Vertex s_vertexData[3] =\r\n {\r\n { { 0.0f, 0.5f, 0.5f, 1.0f },{ 1.0f, 0.0f, 0.0f, 1.0f } }, \/\/ Top \/ Red\r\n { { 0.5f, -0.5f, 0.5f, 1.0f },{ 0.0f, 1.0f, 0.0f, 1.0f } }, \/\/ Right \/ Green\r\n { { -0.5f, -0.5f, 0.5f, 1.0f },{ 0.0f, 0.0f, 1.0f, 1.0f } } \/\/ Left \/ Blue\r\n };\r\n\r\n D3D11_SUBRESOURCE_DATA initialData = {};\r\n initialData.pSysMem = s_vertexData;\r\n\r\n D3D11_BUFFER_DESC bufferDesc = {};\r\n bufferDesc.ByteWidth = sizeof(s_vertexData);\r\n bufferDesc.Usage = D3D11_USAGE_IMMUTABLE;\r\n bufferDesc.BindFlags = D3D11_BIND_VERTEX_BUFFER;\r\n bufferDesc.StructureByteStride = sizeof(Vertex);\r\n\r\n DX::ThrowIfFailed(\r\n device->CreateBuffer(&bufferDesc, &initialData,\r\n m_spVertexBuffer.ReleaseAndGetAddressOf()));\r\n}\r\n\r\n\/\/ Allocate all memory resources that change on a window SizeChanged event.\r\nvoid Sample::CreateWindowSizeDependentResources()\r\n{\r\n}\r\n\r\nvoid Sample::OnDeviceLost()\r\n{\r\n m_spInputLayout.Reset();\r\n m_spVertexBuffer.Reset();\r\n m_spVertexShader.Reset();\r\n m_spPixelShader.Reset();\r\n}\r\n\r\nvoid Sample::OnDeviceRestored()\r\n{\r\n CreateDeviceDependentResources();\r\n\r\n CreateWindowSizeDependentResources();\r\n}\r\n#pragma endregion\r\n","avg_line_length":27.0471014493,"max_line_length":102,"alphanum_fraction":0.6468854655,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":3894,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["BSD-3-Clause"],"max_stars_count":64.0,"content":"\/*\n * Copyright (C) 2008, Morgan Quigley and Willow Garage, Inc.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * * Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and\/or other materials provided with the distribution.\n * * Neither the names of Stanford University or Willow Garage, Inc. nor the names of its\n * contributors may be used to endorse or promote products derived from\n * this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n *\/\n\n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n\n#include \n\n#include \"for_use_GPU.h\"\n#include \"load_model.hpp\"\n#include \"detect.hpp\"\n#include \"GPU_init.hpp\"\n\n#include \"common.hpp\"\n\nstruct timeval tv_memcpy_start, tv_memcpy_end;\nfloat time_memcpy;\nstruct timeval tv_kernel_start, tv_kernel_end;\nfloat time_kernel;\n\nint device_num;\n\nvoid dpm_ttic_gpu_init_cuda(const std::string& cubin_path)\n{\n\tdpm_ttic_gpu_init_cuda_with_cubin(cubin_path.c_str());\n}\n\nvoid dpm_ttic_gpu_cleanup_cuda()\n{\n\tdpm_ttic_gpu_clean_cuda();\n\t\/\/free_model(MO);\n}\n\nDPMTTICGPU::DPMTTICGPU(const char *com_csv, const char *root_csv, const char *part_csv)\n{\n\tconstexpr double RATIO = 1;\n\tmodel_ = dpm_ttic_gpu_load_model(RATIO, com_csv, root_csv, part_csv);\n}\n\nDPMTTICGPU::~DPMTTICGPU()\n{\n\tdpm_ttic_gpu_free_model(model_);\n}\n\nstatic FLOAT *init_accumulated_score(IplImage *image, size_t& accumulated_size)\n{\n\tsize_t num = image->height * image->width;\n\taccumulated_size = num * sizeof(FLOAT);\n\n\tFLOAT *scores = (FLOAT *)calloc(num, sizeof(FLOAT));\n\tfor(size_t i = 0; i < num; i++)\n\t\tscores[i] = -100.0;\n\n\treturn scores;\n}\n\nDPMTTICResult DPMTTICGPU::detect_objects(IplImage *image, const DPMTTICParam& param)\n{\n\tmodel_->MI->interval = param.lambda;\n\tmodel_->MI->sbin = param.num_cells;\n\n\tint detected_objects;\n\tFLOAT *ac_score = init_accumulated_score(image, gpu_size_A_SCORE);\n\tRESULT *objects = dpm_ttic_gpu_car_detection(image, model_, param.threshold,\n\t\t\t\t\t\t &detected_objects, ac_score,\n\t\t\t\t\t\t param.overlap);\n\tfree(ac_score);\n\n\tDPMTTICResult result;\n\tresult.num = objects->num;\n\tfor (int i = 0; i < objects->num; ++i) {\n\t\tresult.type.push_back(objects->type[i]);\n\t}\n\n\tfor (int i = 0; i < objects->num; ++i) {\n\t\tint base = i * 4;\n\t\tint *data = &(objects->OR_point[base]);\n\n\t\tresult.corner_points.push_back(data[0]);\n\t\tresult.corner_points.push_back(data[1]);\n\t\tresult.corner_points.push_back(data[2] - data[0]);\n\t\tresult.corner_points.push_back(data[3] - data[1]);\n\t\tresult.score.push_back(objects->score[i]);\n\t}\n\n\tfree(objects->point);\n\tfree(objects->type);\n\tfree(objects->scale);\n\tfree(objects->score);\n\tfree(objects->IM);\n\treturn result;\n}\n","avg_line_length":31.4032258065,"max_line_length":91,"alphanum_fraction":0.7408834104,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":2066,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["BSD-3-Clause"],"max_stars_count":null,"content":"\/*\n * @Date: 2021-04-27 08:38:21\n * @Author: Mengsen Wang\n * @LastEditors: Mengsen Wang\n * @LastEditTime: 2021-04-27 09:09:24\n *\/\n\n#include \n#include \n\nstruct TreeNode {\n int val;\n TreeNode *left;\n TreeNode *right;\n TreeNode() : val(0), left(nullptr), right(nullptr) {}\n TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}\n TreeNode(int x, TreeNode *left, TreeNode *right)\n : val(x), left(left), right(right) {}\n};\n\nint range_sum_bst_dfs(TreeNode *root, int low, int high) {\n if (root == nullptr) return 0;\n if (root->val >= low && root->val <= high)\n return root->val + range_sum_bst_dfs(root->left, low, high) +\n range_sum_bst_dfs(root->right, low, high);\n else if (root->val < low)\n return range_sum_bst_dfs(root->right, low, high);\n else\n return range_sum_bst_dfs(root->left, low, high);\n}\n\nint range_sum_bst_bfs(TreeNode *root, int low, int high) {\n int val = 0;\n std::queue q({root});\n while (!q.empty()) {\n TreeNode *node = q.front();\n q.pop();\n if (node == nullptr) continue;\n if (node->val > high) {\n q.push(node->left);\n } else if (node->val < low) {\n q.push(node->right);\n } else {\n val += node->val;\n q.push(node->left);\n q.push(node->right);\n }\n }\n return val;\n}\n\nint main() {\n {\n TreeNode *root = new TreeNode{\n 10,\n new TreeNode{5, new TreeNode{3, nullptr, nullptr},\n new TreeNode{7, nullptr, nullptr}},\n new TreeNode{15, nullptr, new TreeNode{18, nullptr, nullptr}}};\n int low = 7, high = 15;\n assert(range_sum_bst_dfs(root, low, high) == 32);\n }\n {\n TreeNode *root = new TreeNode{\n 10,\n new TreeNode{\n 5, new TreeNode{3, new TreeNode{3, nullptr, nullptr}, nullptr},\n new TreeNode{7, new TreeNode{6, nullptr, nullptr}, nullptr}},\n new TreeNode{15, new TreeNode{13, nullptr, nullptr},\n new TreeNode{18, nullptr, nullptr}}};\n int low = 6, high = 10;\n assert(range_sum_bst_bfs(root, low, high) == 23);\n }\n}\n","avg_line_length":27.9189189189,"max_line_length":75,"alphanum_fraction":0.5895450145,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":5740,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":null,"content":"\/\/ Copyright (c) 2011-2016 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"test_bitcoin.h\"\n\n#include \"chainparams.h\"\n#include \"consensus\/consensus.h\"\n#include \"consensus\/validation.h\"\n#include \"crypto\/sha256.h\"\n#include \"fs.h\"\n#include \"key.h\"\n#include \"validation.h\"\n#include \"miner.h\"\n#include \"net_processing.h\"\n#include \"pubkey.h\"\n#include \"random.h\"\n#include \"txdb.h\"\n#include \"txmempool.h\"\n#include \"ui_interface.h\"\n#include \"rpc\/server.h\"\n#include \"rpc\/register.h\"\n#include \"script\/sigcache.h\"\n\n#include \n\nvoid CConnmanTest::AddNode(CNode& node)\n{\n LOCK(g_connman->cs_vNodes);\n g_connman->vNodes.push_back(&node);\n}\n\nvoid CConnmanTest::ClearNodes()\n{\n LOCK(g_connman->cs_vNodes);\n g_connman->vNodes.clear();\n}\n\nuint256 insecure_rand_seed = GetRandHash();\nFastRandomContext insecure_rand_ctx(insecure_rand_seed);\n\nextern bool fPrintToConsole;\nextern void noui_connect();\n\nBasicTestingSetup::BasicTestingSetup(const std::string& chainName)\n{\n SHA256AutoDetect();\n RandomInit();\n ECC_Start();\n SetupEnvironment();\n SetupNetworking();\n InitSignatureCache();\n InitScriptExecutionCache();\n fPrintToDebugLog = false; \/\/ don't want to write to debug.log file\n fCheckBlockIndex = true;\n SelectParams(chainName);\n noui_connect();\n}\n\nBasicTestingSetup::~BasicTestingSetup()\n{\n ECC_Stop();\n}\n\nTestingSetup::TestingSetup(const std::string& chainName) : BasicTestingSetup(chainName)\n{\n const CChainParams& chainparams = Params();\n \/\/ Ideally we'd move all the RPC tests to the functional testing framework\n \/\/ instead of unit tests, but for now we need these here.\n\n RegisterAllCoreRPCCommands(tableRPC);\n ClearDatadirCache();\n pathTemp = fs::temp_directory_path() \/ strprintf(\"test_zzboltcoin_%lu_%i\", (unsigned long)GetTime(), (int)(InsecureRandRange(100000)));\n fs::create_directories(pathTemp);\n gArgs.ForceSetArg(\"-datadir\", pathTemp.string());\n\n \/\/ Note that because we don't bother running a scheduler thread here,\n \/\/ callbacks via CValidationInterface are unreliable, but that's OK,\n \/\/ our unit tests aren't testing multiple parts of the code at once.\n GetMainSignals().RegisterBackgroundSignalScheduler(scheduler);\n\n mempool.setSanityCheck(1.0);\n pblocktree = new CBlockTreeDB(1 << 20, true);\n pcoinsdbview = new CCoinsViewDB(1 << 23, true);\n pcoinsTip = new CCoinsViewCache(pcoinsdbview);\n if (!LoadGenesisBlock(chainparams)) {\n throw std::runtime_error(\"LoadGenesisBlock failed.\");\n }\n {\n CValidationState state;\n if (!ActivateBestChain(state, chainparams)) {\n throw std::runtime_error(\"ActivateBestChain failed.\");\n }\n }\n nScriptCheckThreads = 3;\n for (int i=0; i < nScriptCheckThreads-1; i++)\n threadGroup.create_thread(&ThreadScriptCheck);\n g_connman = std::unique_ptr(new CConnman(0x1337, 0x1337)); \/\/ Deterministic randomness for tests.\n connman = g_connman.get();\n peerLogic.reset(new PeerLogicValidation(connman, scheduler));\n}\n\nTestingSetup::~TestingSetup()\n{\n threadGroup.interrupt_all();\n threadGroup.join_all();\n GetMainSignals().FlushBackgroundCallbacks();\n GetMainSignals().UnregisterBackgroundSignalScheduler();\n g_connman.reset();\n peerLogic.reset();\n UnloadBlockIndex();\n delete pcoinsTip;\n delete pcoinsdbview;\n delete pblocktree;\n fs::remove_all(pathTemp);\n}\n\nTestChain100Setup::TestChain100Setup() : TestingSetup(CBaseChainParams::REGTEST)\n{\n \/\/ Generate a 100-block chain:\n coinbaseKey.MakeNewKey(true);\n CScript scriptPubKey = CScript() << ToByteVector(coinbaseKey.GetPubKey()) << OP_CHECKSIG;\n for (int i = 0; i < COINBASE_MATURITY; i++)\n {\n std::vector noTxns;\n CBlock b = CreateAndProcessBlock(noTxns, scriptPubKey);\n coinbaseTxns.push_back(*b.vtx[0]);\n }\n}\n\n\/\/\n\/\/ Create a new block with just given transactions, coinbase paying to\n\/\/ scriptPubKey, and try to add it to the current chain.\n\/\/\nCBlock\nTestChain100Setup::CreateAndProcessBlock(const std::vector& txns, const CScript& scriptPubKey)\n{\n const CChainParams& chainparams = Params();\n std::unique_ptr pblocktemplate = BlockAssembler(chainparams).CreateNewBlock(scriptPubKey);\n CBlock& block = pblocktemplate->block;\n\n \/\/ Replace mempool-selected txns with just coinbase plus passed-in txns:\n block.vtx.resize(1);\n for (const CMutableTransaction& tx : txns)\n block.vtx.push_back(MakeTransactionRef(tx));\n \/\/ IncrementExtraNonce creates a valid coinbase and merkleRoot\n unsigned int extraNonce = 0;\n IncrementExtraNonce(&block, chainActive.Tip(), extraNonce);\n\n while (!CheckProofOfWork(block.GetPoWHash(), block.nBits, chainparams.GetConsensus())) ++block.nNonce;\n\n std::shared_ptr shared_pblock = std::make_shared(block);\n ProcessNewBlock(chainparams, shared_pblock, true, nullptr);\n\n CBlock result = block;\n return result;\n}\n\nTestChain100Setup::~TestChain100Setup()\n{\n}\n\n\nCTxMemPoolEntry TestMemPoolEntryHelper::FromTx(const CMutableTransaction &tx) {\n CTransaction txn(tx);\n return FromTx(txn);\n}\n\nCTxMemPoolEntry TestMemPoolEntryHelper::FromTx(const CTransaction &txn) {\n return CTxMemPoolEntry(MakeTransactionRef(txn), nFee, nTime, nHeight,\n spendsCoinbase, sigOpCost, lp);\n}\n","avg_line_length":33.1791907514,"max_line_length":143,"alphanum_fraction":0.6945993031,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":2370,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":1.0,"content":"\/*\n * compare_gmi.cpp\n * compare_gmi \n *\n * Created by Wan, Yinan, on 07\/22\/11.\n * \n *\/\n\n#include \n\n#include \"compare_gmi.h\"\n#include \"v3d_message.h\" \n#include \"..\/..\/..\/v3d_main\/basic_c_fun\/basic_surf_objs.h\"\n#include \"fcompare.h\"\n#include \n#include \nusing namespace std;\n\n\n\/\/Q_EXPORT_PLUGIN2 ( PluginName, ClassName )\n\/\/The value of PluginName should correspond to the TARGET specified in the plugin's project file.\nQ_EXPORT_PLUGIN2(compare_gmi, Compare_gmiPlugin);\n\n\n\/\/plugin funcs\nconst QString title = \"compare_feature\";\n\nQStringList Compare_gmiPlugin::menulist() const\n{\n return QStringList();\n\t\/\/<\\ta string indicates the full path of a dll (for a plugin) to be launched.\"<\\t\\tcompare_gmi\"<\\t\\t\\tastring indicating the linker file that specifies the library of swc files to perform comparison\"<\\t\\t\\tname for output result file\"<\\t\\t\\tpar1: a number indicates the query id in the input lib.\\tpar2: the number of subjects you want to pick up\"<\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nusing namespace Aws;\nusing namespace Aws::Auth;\nusing namespace Aws::Client;\nusing namespace Aws::ApiGatewayV2;\nusing namespace Aws::ApiGatewayV2::Model;\nusing namespace Aws::Http;\nusing namespace Aws::Utils::Json;\n\nstatic const char* SERVICE_NAME = \"apigateway\";\nstatic const char* ALLOCATION_TAG = \"ApiGatewayV2Client\";\n\n\nApiGatewayV2Client::ApiGatewayV2Client(const Client::ClientConfiguration& clientConfiguration) :\n BASECLASS(clientConfiguration,\n Aws::MakeShared(ALLOCATION_TAG, Aws::MakeShared(ALLOCATION_TAG),\n SERVICE_NAME, clientConfiguration.region),\n Aws::MakeShared(ALLOCATION_TAG)),\n m_executor(clientConfiguration.executor)\n{\n init(clientConfiguration);\n}\n\nApiGatewayV2Client::ApiGatewayV2Client(const AWSCredentials& credentials, const Client::ClientConfiguration& clientConfiguration) :\n BASECLASS(clientConfiguration,\n Aws::MakeShared(ALLOCATION_TAG, Aws::MakeShared(ALLOCATION_TAG, credentials),\n SERVICE_NAME, clientConfiguration.region),\n Aws::MakeShared(ALLOCATION_TAG)),\n m_executor(clientConfiguration.executor)\n{\n init(clientConfiguration);\n}\n\nApiGatewayV2Client::ApiGatewayV2Client(const std::shared_ptr& credentialsProvider,\n const Client::ClientConfiguration& clientConfiguration) :\n BASECLASS(clientConfiguration,\n Aws::MakeShared(ALLOCATION_TAG, credentialsProvider,\n SERVICE_NAME, clientConfiguration.region),\n Aws::MakeShared(ALLOCATION_TAG)),\n m_executor(clientConfiguration.executor)\n{\n init(clientConfiguration);\n}\n\nApiGatewayV2Client::~ApiGatewayV2Client()\n{\n}\n\nvoid ApiGatewayV2Client::init(const ClientConfiguration& config)\n{\n m_configScheme = SchemeMapper::ToString(config.scheme);\n if (config.endpointOverride.empty())\n {\n m_uri = m_configScheme + \":\/\/\" + ApiGatewayV2Endpoint::ForRegion(config.region, config.useDualStack);\n }\n else\n {\n OverrideEndpoint(config.endpointOverride);\n }\n}\n\nvoid ApiGatewayV2Client::OverrideEndpoint(const Aws::String& endpoint)\n{\n if (endpoint.compare(0, 7, \"http:\/\/\") == 0 || endpoint.compare(0, 8, \"https:\/\/\") == 0)\n {\n m_uri = endpoint;\n }\n else\n {\n m_uri = m_configScheme + \":\/\/\" + endpoint;\n }\n}\nCreateApiOutcome ApiGatewayV2Client::CreateApi(const CreateApiRequest& request) const\n{\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_POST, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return CreateApiOutcome(CreateApiResult(outcome.GetResult()));\n }\n else\n {\n return CreateApiOutcome(outcome.GetError());\n }\n}\n\nCreateApiOutcomeCallable ApiGatewayV2Client::CreateApiCallable(const CreateApiRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< CreateApiOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->CreateApi(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::CreateApiAsync(const CreateApiRequest& request, const CreateApiResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->CreateApiAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::CreateApiAsyncHelper(const CreateApiRequest& request, const CreateApiResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, CreateApi(request), context);\n}\n\nCreateApiMappingOutcome ApiGatewayV2Client::CreateApiMapping(const CreateApiMappingRequest& request) const\n{\n if (!request.DomainNameHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"CreateApiMapping\", \"Required field: DomainName, is not set\");\n return CreateApiMappingOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [DomainName]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/domainnames\/\";\n ss << request.GetDomainName();\n ss << \"\/apimappings\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_POST, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return CreateApiMappingOutcome(CreateApiMappingResult(outcome.GetResult()));\n }\n else\n {\n return CreateApiMappingOutcome(outcome.GetError());\n }\n}\n\nCreateApiMappingOutcomeCallable ApiGatewayV2Client::CreateApiMappingCallable(const CreateApiMappingRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< CreateApiMappingOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->CreateApiMapping(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::CreateApiMappingAsync(const CreateApiMappingRequest& request, const CreateApiMappingResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->CreateApiMappingAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::CreateApiMappingAsyncHelper(const CreateApiMappingRequest& request, const CreateApiMappingResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, CreateApiMapping(request), context);\n}\n\nCreateAuthorizerOutcome ApiGatewayV2Client::CreateAuthorizer(const CreateAuthorizerRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"CreateAuthorizer\", \"Required field: ApiId, is not set\");\n return CreateAuthorizerOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/authorizers\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_POST, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return CreateAuthorizerOutcome(CreateAuthorizerResult(outcome.GetResult()));\n }\n else\n {\n return CreateAuthorizerOutcome(outcome.GetError());\n }\n}\n\nCreateAuthorizerOutcomeCallable ApiGatewayV2Client::CreateAuthorizerCallable(const CreateAuthorizerRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< CreateAuthorizerOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->CreateAuthorizer(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::CreateAuthorizerAsync(const CreateAuthorizerRequest& request, const CreateAuthorizerResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->CreateAuthorizerAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::CreateAuthorizerAsyncHelper(const CreateAuthorizerRequest& request, const CreateAuthorizerResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, CreateAuthorizer(request), context);\n}\n\nCreateDeploymentOutcome ApiGatewayV2Client::CreateDeployment(const CreateDeploymentRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"CreateDeployment\", \"Required field: ApiId, is not set\");\n return CreateDeploymentOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/deployments\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_POST, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return CreateDeploymentOutcome(CreateDeploymentResult(outcome.GetResult()));\n }\n else\n {\n return CreateDeploymentOutcome(outcome.GetError());\n }\n}\n\nCreateDeploymentOutcomeCallable ApiGatewayV2Client::CreateDeploymentCallable(const CreateDeploymentRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< CreateDeploymentOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->CreateDeployment(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::CreateDeploymentAsync(const CreateDeploymentRequest& request, const CreateDeploymentResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->CreateDeploymentAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::CreateDeploymentAsyncHelper(const CreateDeploymentRequest& request, const CreateDeploymentResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, CreateDeployment(request), context);\n}\n\nCreateDomainNameOutcome ApiGatewayV2Client::CreateDomainName(const CreateDomainNameRequest& request) const\n{\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/domainnames\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_POST, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return CreateDomainNameOutcome(CreateDomainNameResult(outcome.GetResult()));\n }\n else\n {\n return CreateDomainNameOutcome(outcome.GetError());\n }\n}\n\nCreateDomainNameOutcomeCallable ApiGatewayV2Client::CreateDomainNameCallable(const CreateDomainNameRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< CreateDomainNameOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->CreateDomainName(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::CreateDomainNameAsync(const CreateDomainNameRequest& request, const CreateDomainNameResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->CreateDomainNameAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::CreateDomainNameAsyncHelper(const CreateDomainNameRequest& request, const CreateDomainNameResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, CreateDomainName(request), context);\n}\n\nCreateIntegrationOutcome ApiGatewayV2Client::CreateIntegration(const CreateIntegrationRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"CreateIntegration\", \"Required field: ApiId, is not set\");\n return CreateIntegrationOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/integrations\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_POST, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return CreateIntegrationOutcome(CreateIntegrationResult(outcome.GetResult()));\n }\n else\n {\n return CreateIntegrationOutcome(outcome.GetError());\n }\n}\n\nCreateIntegrationOutcomeCallable ApiGatewayV2Client::CreateIntegrationCallable(const CreateIntegrationRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< CreateIntegrationOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->CreateIntegration(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::CreateIntegrationAsync(const CreateIntegrationRequest& request, const CreateIntegrationResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->CreateIntegrationAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::CreateIntegrationAsyncHelper(const CreateIntegrationRequest& request, const CreateIntegrationResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, CreateIntegration(request), context);\n}\n\nCreateIntegrationResponseOutcome ApiGatewayV2Client::CreateIntegrationResponse(const CreateIntegrationResponseRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"CreateIntegrationResponse\", \"Required field: ApiId, is not set\");\n return CreateIntegrationResponseOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.IntegrationIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"CreateIntegrationResponse\", \"Required field: IntegrationId, is not set\");\n return CreateIntegrationResponseOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [IntegrationId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/integrations\/\";\n ss << request.GetIntegrationId();\n ss << \"\/integrationresponses\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_POST, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return CreateIntegrationResponseOutcome(CreateIntegrationResponseResult(outcome.GetResult()));\n }\n else\n {\n return CreateIntegrationResponseOutcome(outcome.GetError());\n }\n}\n\nCreateIntegrationResponseOutcomeCallable ApiGatewayV2Client::CreateIntegrationResponseCallable(const CreateIntegrationResponseRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< CreateIntegrationResponseOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->CreateIntegrationResponse(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::CreateIntegrationResponseAsync(const CreateIntegrationResponseRequest& request, const CreateIntegrationResponseResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->CreateIntegrationResponseAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::CreateIntegrationResponseAsyncHelper(const CreateIntegrationResponseRequest& request, const CreateIntegrationResponseResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, CreateIntegrationResponse(request), context);\n}\n\nCreateModelOutcome ApiGatewayV2Client::CreateModel(const CreateModelRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"CreateModel\", \"Required field: ApiId, is not set\");\n return CreateModelOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/models\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_POST, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return CreateModelOutcome(CreateModelResult(outcome.GetResult()));\n }\n else\n {\n return CreateModelOutcome(outcome.GetError());\n }\n}\n\nCreateModelOutcomeCallable ApiGatewayV2Client::CreateModelCallable(const CreateModelRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< CreateModelOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->CreateModel(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::CreateModelAsync(const CreateModelRequest& request, const CreateModelResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->CreateModelAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::CreateModelAsyncHelper(const CreateModelRequest& request, const CreateModelResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, CreateModel(request), context);\n}\n\nCreateRouteOutcome ApiGatewayV2Client::CreateRoute(const CreateRouteRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"CreateRoute\", \"Required field: ApiId, is not set\");\n return CreateRouteOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/routes\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_POST, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return CreateRouteOutcome(CreateRouteResult(outcome.GetResult()));\n }\n else\n {\n return CreateRouteOutcome(outcome.GetError());\n }\n}\n\nCreateRouteOutcomeCallable ApiGatewayV2Client::CreateRouteCallable(const CreateRouteRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< CreateRouteOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->CreateRoute(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::CreateRouteAsync(const CreateRouteRequest& request, const CreateRouteResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->CreateRouteAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::CreateRouteAsyncHelper(const CreateRouteRequest& request, const CreateRouteResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, CreateRoute(request), context);\n}\n\nCreateRouteResponseOutcome ApiGatewayV2Client::CreateRouteResponse(const CreateRouteResponseRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"CreateRouteResponse\", \"Required field: ApiId, is not set\");\n return CreateRouteResponseOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.RouteIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"CreateRouteResponse\", \"Required field: RouteId, is not set\");\n return CreateRouteResponseOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [RouteId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/routes\/\";\n ss << request.GetRouteId();\n ss << \"\/routeresponses\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_POST, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return CreateRouteResponseOutcome(CreateRouteResponseResult(outcome.GetResult()));\n }\n else\n {\n return CreateRouteResponseOutcome(outcome.GetError());\n }\n}\n\nCreateRouteResponseOutcomeCallable ApiGatewayV2Client::CreateRouteResponseCallable(const CreateRouteResponseRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< CreateRouteResponseOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->CreateRouteResponse(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::CreateRouteResponseAsync(const CreateRouteResponseRequest& request, const CreateRouteResponseResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->CreateRouteResponseAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::CreateRouteResponseAsyncHelper(const CreateRouteResponseRequest& request, const CreateRouteResponseResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, CreateRouteResponse(request), context);\n}\n\nCreateStageOutcome ApiGatewayV2Client::CreateStage(const CreateStageRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"CreateStage\", \"Required field: ApiId, is not set\");\n return CreateStageOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/stages\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_POST, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return CreateStageOutcome(CreateStageResult(outcome.GetResult()));\n }\n else\n {\n return CreateStageOutcome(outcome.GetError());\n }\n}\n\nCreateStageOutcomeCallable ApiGatewayV2Client::CreateStageCallable(const CreateStageRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< CreateStageOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->CreateStage(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::CreateStageAsync(const CreateStageRequest& request, const CreateStageResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->CreateStageAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::CreateStageAsyncHelper(const CreateStageRequest& request, const CreateStageResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, CreateStage(request), context);\n}\n\nDeleteApiOutcome ApiGatewayV2Client::DeleteApi(const DeleteApiRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"DeleteApi\", \"Required field: ApiId, is not set\");\n return DeleteApiOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_DELETE, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return DeleteApiOutcome(NoResult());\n }\n else\n {\n return DeleteApiOutcome(outcome.GetError());\n }\n}\n\nDeleteApiOutcomeCallable ApiGatewayV2Client::DeleteApiCallable(const DeleteApiRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< DeleteApiOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->DeleteApi(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::DeleteApiAsync(const DeleteApiRequest& request, const DeleteApiResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->DeleteApiAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::DeleteApiAsyncHelper(const DeleteApiRequest& request, const DeleteApiResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, DeleteApi(request), context);\n}\n\nDeleteApiMappingOutcome ApiGatewayV2Client::DeleteApiMapping(const DeleteApiMappingRequest& request) const\n{\n if (!request.ApiMappingIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"DeleteApiMapping\", \"Required field: ApiMappingId, is not set\");\n return DeleteApiMappingOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiMappingId]\", false));\n }\n if (!request.DomainNameHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"DeleteApiMapping\", \"Required field: DomainName, is not set\");\n return DeleteApiMappingOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [DomainName]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/domainnames\/\";\n ss << request.GetDomainName();\n ss << \"\/apimappings\/\";\n ss << request.GetApiMappingId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_DELETE, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return DeleteApiMappingOutcome(NoResult());\n }\n else\n {\n return DeleteApiMappingOutcome(outcome.GetError());\n }\n}\n\nDeleteApiMappingOutcomeCallable ApiGatewayV2Client::DeleteApiMappingCallable(const DeleteApiMappingRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< DeleteApiMappingOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->DeleteApiMapping(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::DeleteApiMappingAsync(const DeleteApiMappingRequest& request, const DeleteApiMappingResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->DeleteApiMappingAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::DeleteApiMappingAsyncHelper(const DeleteApiMappingRequest& request, const DeleteApiMappingResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, DeleteApiMapping(request), context);\n}\n\nDeleteAuthorizerOutcome ApiGatewayV2Client::DeleteAuthorizer(const DeleteAuthorizerRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"DeleteAuthorizer\", \"Required field: ApiId, is not set\");\n return DeleteAuthorizerOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.AuthorizerIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"DeleteAuthorizer\", \"Required field: AuthorizerId, is not set\");\n return DeleteAuthorizerOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [AuthorizerId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/authorizers\/\";\n ss << request.GetAuthorizerId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_DELETE, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return DeleteAuthorizerOutcome(NoResult());\n }\n else\n {\n return DeleteAuthorizerOutcome(outcome.GetError());\n }\n}\n\nDeleteAuthorizerOutcomeCallable ApiGatewayV2Client::DeleteAuthorizerCallable(const DeleteAuthorizerRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< DeleteAuthorizerOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->DeleteAuthorizer(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::DeleteAuthorizerAsync(const DeleteAuthorizerRequest& request, const DeleteAuthorizerResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->DeleteAuthorizerAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::DeleteAuthorizerAsyncHelper(const DeleteAuthorizerRequest& request, const DeleteAuthorizerResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, DeleteAuthorizer(request), context);\n}\n\nDeleteDeploymentOutcome ApiGatewayV2Client::DeleteDeployment(const DeleteDeploymentRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"DeleteDeployment\", \"Required field: ApiId, is not set\");\n return DeleteDeploymentOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.DeploymentIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"DeleteDeployment\", \"Required field: DeploymentId, is not set\");\n return DeleteDeploymentOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [DeploymentId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/deployments\/\";\n ss << request.GetDeploymentId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_DELETE, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return DeleteDeploymentOutcome(NoResult());\n }\n else\n {\n return DeleteDeploymentOutcome(outcome.GetError());\n }\n}\n\nDeleteDeploymentOutcomeCallable ApiGatewayV2Client::DeleteDeploymentCallable(const DeleteDeploymentRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< DeleteDeploymentOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->DeleteDeployment(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::DeleteDeploymentAsync(const DeleteDeploymentRequest& request, const DeleteDeploymentResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->DeleteDeploymentAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::DeleteDeploymentAsyncHelper(const DeleteDeploymentRequest& request, const DeleteDeploymentResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, DeleteDeployment(request), context);\n}\n\nDeleteDomainNameOutcome ApiGatewayV2Client::DeleteDomainName(const DeleteDomainNameRequest& request) const\n{\n if (!request.DomainNameHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"DeleteDomainName\", \"Required field: DomainName, is not set\");\n return DeleteDomainNameOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [DomainName]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/domainnames\/\";\n ss << request.GetDomainName();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_DELETE, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return DeleteDomainNameOutcome(NoResult());\n }\n else\n {\n return DeleteDomainNameOutcome(outcome.GetError());\n }\n}\n\nDeleteDomainNameOutcomeCallable ApiGatewayV2Client::DeleteDomainNameCallable(const DeleteDomainNameRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< DeleteDomainNameOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->DeleteDomainName(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::DeleteDomainNameAsync(const DeleteDomainNameRequest& request, const DeleteDomainNameResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->DeleteDomainNameAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::DeleteDomainNameAsyncHelper(const DeleteDomainNameRequest& request, const DeleteDomainNameResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, DeleteDomainName(request), context);\n}\n\nDeleteIntegrationOutcome ApiGatewayV2Client::DeleteIntegration(const DeleteIntegrationRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"DeleteIntegration\", \"Required field: ApiId, is not set\");\n return DeleteIntegrationOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.IntegrationIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"DeleteIntegration\", \"Required field: IntegrationId, is not set\");\n return DeleteIntegrationOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [IntegrationId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/integrations\/\";\n ss << request.GetIntegrationId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_DELETE, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return DeleteIntegrationOutcome(NoResult());\n }\n else\n {\n return DeleteIntegrationOutcome(outcome.GetError());\n }\n}\n\nDeleteIntegrationOutcomeCallable ApiGatewayV2Client::DeleteIntegrationCallable(const DeleteIntegrationRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< DeleteIntegrationOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->DeleteIntegration(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::DeleteIntegrationAsync(const DeleteIntegrationRequest& request, const DeleteIntegrationResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->DeleteIntegrationAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::DeleteIntegrationAsyncHelper(const DeleteIntegrationRequest& request, const DeleteIntegrationResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, DeleteIntegration(request), context);\n}\n\nDeleteIntegrationResponseOutcome ApiGatewayV2Client::DeleteIntegrationResponse(const DeleteIntegrationResponseRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"DeleteIntegrationResponse\", \"Required field: ApiId, is not set\");\n return DeleteIntegrationResponseOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.IntegrationIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"DeleteIntegrationResponse\", \"Required field: IntegrationId, is not set\");\n return DeleteIntegrationResponseOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [IntegrationId]\", false));\n }\n if (!request.IntegrationResponseIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"DeleteIntegrationResponse\", \"Required field: IntegrationResponseId, is not set\");\n return DeleteIntegrationResponseOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [IntegrationResponseId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/integrations\/\";\n ss << request.GetIntegrationId();\n ss << \"\/integrationresponses\/\";\n ss << request.GetIntegrationResponseId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_DELETE, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return DeleteIntegrationResponseOutcome(NoResult());\n }\n else\n {\n return DeleteIntegrationResponseOutcome(outcome.GetError());\n }\n}\n\nDeleteIntegrationResponseOutcomeCallable ApiGatewayV2Client::DeleteIntegrationResponseCallable(const DeleteIntegrationResponseRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< DeleteIntegrationResponseOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->DeleteIntegrationResponse(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::DeleteIntegrationResponseAsync(const DeleteIntegrationResponseRequest& request, const DeleteIntegrationResponseResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->DeleteIntegrationResponseAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::DeleteIntegrationResponseAsyncHelper(const DeleteIntegrationResponseRequest& request, const DeleteIntegrationResponseResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, DeleteIntegrationResponse(request), context);\n}\n\nDeleteModelOutcome ApiGatewayV2Client::DeleteModel(const DeleteModelRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"DeleteModel\", \"Required field: ApiId, is not set\");\n return DeleteModelOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.ModelIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"DeleteModel\", \"Required field: ModelId, is not set\");\n return DeleteModelOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ModelId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/models\/\";\n ss << request.GetModelId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_DELETE, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return DeleteModelOutcome(NoResult());\n }\n else\n {\n return DeleteModelOutcome(outcome.GetError());\n }\n}\n\nDeleteModelOutcomeCallable ApiGatewayV2Client::DeleteModelCallable(const DeleteModelRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< DeleteModelOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->DeleteModel(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::DeleteModelAsync(const DeleteModelRequest& request, const DeleteModelResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->DeleteModelAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::DeleteModelAsyncHelper(const DeleteModelRequest& request, const DeleteModelResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, DeleteModel(request), context);\n}\n\nDeleteRouteOutcome ApiGatewayV2Client::DeleteRoute(const DeleteRouteRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"DeleteRoute\", \"Required field: ApiId, is not set\");\n return DeleteRouteOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.RouteIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"DeleteRoute\", \"Required field: RouteId, is not set\");\n return DeleteRouteOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [RouteId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/routes\/\";\n ss << request.GetRouteId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_DELETE, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return DeleteRouteOutcome(NoResult());\n }\n else\n {\n return DeleteRouteOutcome(outcome.GetError());\n }\n}\n\nDeleteRouteOutcomeCallable ApiGatewayV2Client::DeleteRouteCallable(const DeleteRouteRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< DeleteRouteOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->DeleteRoute(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::DeleteRouteAsync(const DeleteRouteRequest& request, const DeleteRouteResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->DeleteRouteAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::DeleteRouteAsyncHelper(const DeleteRouteRequest& request, const DeleteRouteResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, DeleteRoute(request), context);\n}\n\nDeleteRouteResponseOutcome ApiGatewayV2Client::DeleteRouteResponse(const DeleteRouteResponseRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"DeleteRouteResponse\", \"Required field: ApiId, is not set\");\n return DeleteRouteResponseOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.RouteIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"DeleteRouteResponse\", \"Required field: RouteId, is not set\");\n return DeleteRouteResponseOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [RouteId]\", false));\n }\n if (!request.RouteResponseIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"DeleteRouteResponse\", \"Required field: RouteResponseId, is not set\");\n return DeleteRouteResponseOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [RouteResponseId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/routes\/\";\n ss << request.GetRouteId();\n ss << \"\/routeresponses\/\";\n ss << request.GetRouteResponseId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_DELETE, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return DeleteRouteResponseOutcome(NoResult());\n }\n else\n {\n return DeleteRouteResponseOutcome(outcome.GetError());\n }\n}\n\nDeleteRouteResponseOutcomeCallable ApiGatewayV2Client::DeleteRouteResponseCallable(const DeleteRouteResponseRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< DeleteRouteResponseOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->DeleteRouteResponse(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::DeleteRouteResponseAsync(const DeleteRouteResponseRequest& request, const DeleteRouteResponseResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->DeleteRouteResponseAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::DeleteRouteResponseAsyncHelper(const DeleteRouteResponseRequest& request, const DeleteRouteResponseResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, DeleteRouteResponse(request), context);\n}\n\nDeleteStageOutcome ApiGatewayV2Client::DeleteStage(const DeleteStageRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"DeleteStage\", \"Required field: ApiId, is not set\");\n return DeleteStageOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.StageNameHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"DeleteStage\", \"Required field: StageName, is not set\");\n return DeleteStageOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [StageName]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/stages\/\";\n ss << request.GetStageName();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_DELETE, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return DeleteStageOutcome(NoResult());\n }\n else\n {\n return DeleteStageOutcome(outcome.GetError());\n }\n}\n\nDeleteStageOutcomeCallable ApiGatewayV2Client::DeleteStageCallable(const DeleteStageRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< DeleteStageOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->DeleteStage(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::DeleteStageAsync(const DeleteStageRequest& request, const DeleteStageResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->DeleteStageAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::DeleteStageAsyncHelper(const DeleteStageRequest& request, const DeleteStageResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, DeleteStage(request), context);\n}\n\nGetApiOutcome ApiGatewayV2Client::GetApi(const GetApiRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetApi\", \"Required field: ApiId, is not set\");\n return GetApiOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetApiOutcome(GetApiResult(outcome.GetResult()));\n }\n else\n {\n return GetApiOutcome(outcome.GetError());\n }\n}\n\nGetApiOutcomeCallable ApiGatewayV2Client::GetApiCallable(const GetApiRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetApiOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetApi(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetApiAsync(const GetApiRequest& request, const GetApiResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetApiAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetApiAsyncHelper(const GetApiRequest& request, const GetApiResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetApi(request), context);\n}\n\nGetApiMappingOutcome ApiGatewayV2Client::GetApiMapping(const GetApiMappingRequest& request) const\n{\n if (!request.ApiMappingIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetApiMapping\", \"Required field: ApiMappingId, is not set\");\n return GetApiMappingOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiMappingId]\", false));\n }\n if (!request.DomainNameHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetApiMapping\", \"Required field: DomainName, is not set\");\n return GetApiMappingOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [DomainName]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/domainnames\/\";\n ss << request.GetDomainName();\n ss << \"\/apimappings\/\";\n ss << request.GetApiMappingId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetApiMappingOutcome(GetApiMappingResult(outcome.GetResult()));\n }\n else\n {\n return GetApiMappingOutcome(outcome.GetError());\n }\n}\n\nGetApiMappingOutcomeCallable ApiGatewayV2Client::GetApiMappingCallable(const GetApiMappingRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetApiMappingOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetApiMapping(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetApiMappingAsync(const GetApiMappingRequest& request, const GetApiMappingResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetApiMappingAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetApiMappingAsyncHelper(const GetApiMappingRequest& request, const GetApiMappingResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetApiMapping(request), context);\n}\n\nGetApiMappingsOutcome ApiGatewayV2Client::GetApiMappings(const GetApiMappingsRequest& request) const\n{\n if (!request.DomainNameHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetApiMappings\", \"Required field: DomainName, is not set\");\n return GetApiMappingsOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [DomainName]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/domainnames\/\";\n ss << request.GetDomainName();\n ss << \"\/apimappings\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetApiMappingsOutcome(GetApiMappingsResult(outcome.GetResult()));\n }\n else\n {\n return GetApiMappingsOutcome(outcome.GetError());\n }\n}\n\nGetApiMappingsOutcomeCallable ApiGatewayV2Client::GetApiMappingsCallable(const GetApiMappingsRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetApiMappingsOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetApiMappings(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetApiMappingsAsync(const GetApiMappingsRequest& request, const GetApiMappingsResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetApiMappingsAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetApiMappingsAsyncHelper(const GetApiMappingsRequest& request, const GetApiMappingsResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetApiMappings(request), context);\n}\n\nGetApisOutcome ApiGatewayV2Client::GetApis(const GetApisRequest& request) const\n{\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetApisOutcome(GetApisResult(outcome.GetResult()));\n }\n else\n {\n return GetApisOutcome(outcome.GetError());\n }\n}\n\nGetApisOutcomeCallable ApiGatewayV2Client::GetApisCallable(const GetApisRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetApisOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetApis(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetApisAsync(const GetApisRequest& request, const GetApisResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetApisAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetApisAsyncHelper(const GetApisRequest& request, const GetApisResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetApis(request), context);\n}\n\nGetAuthorizerOutcome ApiGatewayV2Client::GetAuthorizer(const GetAuthorizerRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetAuthorizer\", \"Required field: ApiId, is not set\");\n return GetAuthorizerOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.AuthorizerIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetAuthorizer\", \"Required field: AuthorizerId, is not set\");\n return GetAuthorizerOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [AuthorizerId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/authorizers\/\";\n ss << request.GetAuthorizerId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetAuthorizerOutcome(GetAuthorizerResult(outcome.GetResult()));\n }\n else\n {\n return GetAuthorizerOutcome(outcome.GetError());\n }\n}\n\nGetAuthorizerOutcomeCallable ApiGatewayV2Client::GetAuthorizerCallable(const GetAuthorizerRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetAuthorizerOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetAuthorizer(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetAuthorizerAsync(const GetAuthorizerRequest& request, const GetAuthorizerResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetAuthorizerAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetAuthorizerAsyncHelper(const GetAuthorizerRequest& request, const GetAuthorizerResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetAuthorizer(request), context);\n}\n\nGetAuthorizersOutcome ApiGatewayV2Client::GetAuthorizers(const GetAuthorizersRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetAuthorizers\", \"Required field: ApiId, is not set\");\n return GetAuthorizersOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/authorizers\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetAuthorizersOutcome(GetAuthorizersResult(outcome.GetResult()));\n }\n else\n {\n return GetAuthorizersOutcome(outcome.GetError());\n }\n}\n\nGetAuthorizersOutcomeCallable ApiGatewayV2Client::GetAuthorizersCallable(const GetAuthorizersRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetAuthorizersOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetAuthorizers(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetAuthorizersAsync(const GetAuthorizersRequest& request, const GetAuthorizersResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetAuthorizersAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetAuthorizersAsyncHelper(const GetAuthorizersRequest& request, const GetAuthorizersResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetAuthorizers(request), context);\n}\n\nGetDeploymentOutcome ApiGatewayV2Client::GetDeployment(const GetDeploymentRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetDeployment\", \"Required field: ApiId, is not set\");\n return GetDeploymentOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.DeploymentIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetDeployment\", \"Required field: DeploymentId, is not set\");\n return GetDeploymentOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [DeploymentId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/deployments\/\";\n ss << request.GetDeploymentId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetDeploymentOutcome(GetDeploymentResult(outcome.GetResult()));\n }\n else\n {\n return GetDeploymentOutcome(outcome.GetError());\n }\n}\n\nGetDeploymentOutcomeCallable ApiGatewayV2Client::GetDeploymentCallable(const GetDeploymentRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetDeploymentOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetDeployment(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetDeploymentAsync(const GetDeploymentRequest& request, const GetDeploymentResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetDeploymentAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetDeploymentAsyncHelper(const GetDeploymentRequest& request, const GetDeploymentResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetDeployment(request), context);\n}\n\nGetDeploymentsOutcome ApiGatewayV2Client::GetDeployments(const GetDeploymentsRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetDeployments\", \"Required field: ApiId, is not set\");\n return GetDeploymentsOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/deployments\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetDeploymentsOutcome(GetDeploymentsResult(outcome.GetResult()));\n }\n else\n {\n return GetDeploymentsOutcome(outcome.GetError());\n }\n}\n\nGetDeploymentsOutcomeCallable ApiGatewayV2Client::GetDeploymentsCallable(const GetDeploymentsRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetDeploymentsOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetDeployments(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetDeploymentsAsync(const GetDeploymentsRequest& request, const GetDeploymentsResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetDeploymentsAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetDeploymentsAsyncHelper(const GetDeploymentsRequest& request, const GetDeploymentsResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetDeployments(request), context);\n}\n\nGetDomainNameOutcome ApiGatewayV2Client::GetDomainName(const GetDomainNameRequest& request) const\n{\n if (!request.DomainNameHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetDomainName\", \"Required field: DomainName, is not set\");\n return GetDomainNameOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [DomainName]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/domainnames\/\";\n ss << request.GetDomainName();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetDomainNameOutcome(GetDomainNameResult(outcome.GetResult()));\n }\n else\n {\n return GetDomainNameOutcome(outcome.GetError());\n }\n}\n\nGetDomainNameOutcomeCallable ApiGatewayV2Client::GetDomainNameCallable(const GetDomainNameRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetDomainNameOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetDomainName(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetDomainNameAsync(const GetDomainNameRequest& request, const GetDomainNameResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetDomainNameAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetDomainNameAsyncHelper(const GetDomainNameRequest& request, const GetDomainNameResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetDomainName(request), context);\n}\n\nGetDomainNamesOutcome ApiGatewayV2Client::GetDomainNames(const GetDomainNamesRequest& request) const\n{\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/domainnames\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetDomainNamesOutcome(GetDomainNamesResult(outcome.GetResult()));\n }\n else\n {\n return GetDomainNamesOutcome(outcome.GetError());\n }\n}\n\nGetDomainNamesOutcomeCallable ApiGatewayV2Client::GetDomainNamesCallable(const GetDomainNamesRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetDomainNamesOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetDomainNames(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetDomainNamesAsync(const GetDomainNamesRequest& request, const GetDomainNamesResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetDomainNamesAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetDomainNamesAsyncHelper(const GetDomainNamesRequest& request, const GetDomainNamesResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetDomainNames(request), context);\n}\n\nGetIntegrationOutcome ApiGatewayV2Client::GetIntegration(const GetIntegrationRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetIntegration\", \"Required field: ApiId, is not set\");\n return GetIntegrationOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.IntegrationIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetIntegration\", \"Required field: IntegrationId, is not set\");\n return GetIntegrationOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [IntegrationId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/integrations\/\";\n ss << request.GetIntegrationId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetIntegrationOutcome(GetIntegrationResult(outcome.GetResult()));\n }\n else\n {\n return GetIntegrationOutcome(outcome.GetError());\n }\n}\n\nGetIntegrationOutcomeCallable ApiGatewayV2Client::GetIntegrationCallable(const GetIntegrationRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetIntegrationOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetIntegration(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetIntegrationAsync(const GetIntegrationRequest& request, const GetIntegrationResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetIntegrationAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetIntegrationAsyncHelper(const GetIntegrationRequest& request, const GetIntegrationResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetIntegration(request), context);\n}\n\nGetIntegrationResponseOutcome ApiGatewayV2Client::GetIntegrationResponse(const GetIntegrationResponseRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetIntegrationResponse\", \"Required field: ApiId, is not set\");\n return GetIntegrationResponseOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.IntegrationIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetIntegrationResponse\", \"Required field: IntegrationId, is not set\");\n return GetIntegrationResponseOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [IntegrationId]\", false));\n }\n if (!request.IntegrationResponseIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetIntegrationResponse\", \"Required field: IntegrationResponseId, is not set\");\n return GetIntegrationResponseOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [IntegrationResponseId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/integrations\/\";\n ss << request.GetIntegrationId();\n ss << \"\/integrationresponses\/\";\n ss << request.GetIntegrationResponseId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetIntegrationResponseOutcome(GetIntegrationResponseResult(outcome.GetResult()));\n }\n else\n {\n return GetIntegrationResponseOutcome(outcome.GetError());\n }\n}\n\nGetIntegrationResponseOutcomeCallable ApiGatewayV2Client::GetIntegrationResponseCallable(const GetIntegrationResponseRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetIntegrationResponseOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetIntegrationResponse(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetIntegrationResponseAsync(const GetIntegrationResponseRequest& request, const GetIntegrationResponseResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetIntegrationResponseAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetIntegrationResponseAsyncHelper(const GetIntegrationResponseRequest& request, const GetIntegrationResponseResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetIntegrationResponse(request), context);\n}\n\nGetIntegrationResponsesOutcome ApiGatewayV2Client::GetIntegrationResponses(const GetIntegrationResponsesRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetIntegrationResponses\", \"Required field: ApiId, is not set\");\n return GetIntegrationResponsesOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.IntegrationIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetIntegrationResponses\", \"Required field: IntegrationId, is not set\");\n return GetIntegrationResponsesOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [IntegrationId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/integrations\/\";\n ss << request.GetIntegrationId();\n ss << \"\/integrationresponses\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetIntegrationResponsesOutcome(GetIntegrationResponsesResult(outcome.GetResult()));\n }\n else\n {\n return GetIntegrationResponsesOutcome(outcome.GetError());\n }\n}\n\nGetIntegrationResponsesOutcomeCallable ApiGatewayV2Client::GetIntegrationResponsesCallable(const GetIntegrationResponsesRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetIntegrationResponsesOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetIntegrationResponses(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetIntegrationResponsesAsync(const GetIntegrationResponsesRequest& request, const GetIntegrationResponsesResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetIntegrationResponsesAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetIntegrationResponsesAsyncHelper(const GetIntegrationResponsesRequest& request, const GetIntegrationResponsesResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetIntegrationResponses(request), context);\n}\n\nGetIntegrationsOutcome ApiGatewayV2Client::GetIntegrations(const GetIntegrationsRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetIntegrations\", \"Required field: ApiId, is not set\");\n return GetIntegrationsOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/integrations\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetIntegrationsOutcome(GetIntegrationsResult(outcome.GetResult()));\n }\n else\n {\n return GetIntegrationsOutcome(outcome.GetError());\n }\n}\n\nGetIntegrationsOutcomeCallable ApiGatewayV2Client::GetIntegrationsCallable(const GetIntegrationsRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetIntegrationsOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetIntegrations(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetIntegrationsAsync(const GetIntegrationsRequest& request, const GetIntegrationsResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetIntegrationsAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetIntegrationsAsyncHelper(const GetIntegrationsRequest& request, const GetIntegrationsResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetIntegrations(request), context);\n}\n\nGetModelOutcome ApiGatewayV2Client::GetModel(const GetModelRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetModel\", \"Required field: ApiId, is not set\");\n return GetModelOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.ModelIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetModel\", \"Required field: ModelId, is not set\");\n return GetModelOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ModelId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/models\/\";\n ss << request.GetModelId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetModelOutcome(GetModelResult(outcome.GetResult()));\n }\n else\n {\n return GetModelOutcome(outcome.GetError());\n }\n}\n\nGetModelOutcomeCallable ApiGatewayV2Client::GetModelCallable(const GetModelRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetModelOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetModel(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetModelAsync(const GetModelRequest& request, const GetModelResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetModelAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetModelAsyncHelper(const GetModelRequest& request, const GetModelResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetModel(request), context);\n}\n\nGetModelTemplateOutcome ApiGatewayV2Client::GetModelTemplate(const GetModelTemplateRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetModelTemplate\", \"Required field: ApiId, is not set\");\n return GetModelTemplateOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.ModelIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetModelTemplate\", \"Required field: ModelId, is not set\");\n return GetModelTemplateOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ModelId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/models\/\";\n ss << request.GetModelId();\n ss << \"\/template\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetModelTemplateOutcome(GetModelTemplateResult(outcome.GetResult()));\n }\n else\n {\n return GetModelTemplateOutcome(outcome.GetError());\n }\n}\n\nGetModelTemplateOutcomeCallable ApiGatewayV2Client::GetModelTemplateCallable(const GetModelTemplateRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetModelTemplateOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetModelTemplate(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetModelTemplateAsync(const GetModelTemplateRequest& request, const GetModelTemplateResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetModelTemplateAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetModelTemplateAsyncHelper(const GetModelTemplateRequest& request, const GetModelTemplateResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetModelTemplate(request), context);\n}\n\nGetModelsOutcome ApiGatewayV2Client::GetModels(const GetModelsRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetModels\", \"Required field: ApiId, is not set\");\n return GetModelsOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/models\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetModelsOutcome(GetModelsResult(outcome.GetResult()));\n }\n else\n {\n return GetModelsOutcome(outcome.GetError());\n }\n}\n\nGetModelsOutcomeCallable ApiGatewayV2Client::GetModelsCallable(const GetModelsRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetModelsOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetModels(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetModelsAsync(const GetModelsRequest& request, const GetModelsResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetModelsAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetModelsAsyncHelper(const GetModelsRequest& request, const GetModelsResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetModels(request), context);\n}\n\nGetRouteOutcome ApiGatewayV2Client::GetRoute(const GetRouteRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetRoute\", \"Required field: ApiId, is not set\");\n return GetRouteOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.RouteIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetRoute\", \"Required field: RouteId, is not set\");\n return GetRouteOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [RouteId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/routes\/\";\n ss << request.GetRouteId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetRouteOutcome(GetRouteResult(outcome.GetResult()));\n }\n else\n {\n return GetRouteOutcome(outcome.GetError());\n }\n}\n\nGetRouteOutcomeCallable ApiGatewayV2Client::GetRouteCallable(const GetRouteRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetRouteOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetRoute(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetRouteAsync(const GetRouteRequest& request, const GetRouteResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetRouteAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetRouteAsyncHelper(const GetRouteRequest& request, const GetRouteResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetRoute(request), context);\n}\n\nGetRouteResponseOutcome ApiGatewayV2Client::GetRouteResponse(const GetRouteResponseRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetRouteResponse\", \"Required field: ApiId, is not set\");\n return GetRouteResponseOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.RouteIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetRouteResponse\", \"Required field: RouteId, is not set\");\n return GetRouteResponseOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [RouteId]\", false));\n }\n if (!request.RouteResponseIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetRouteResponse\", \"Required field: RouteResponseId, is not set\");\n return GetRouteResponseOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [RouteResponseId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/routes\/\";\n ss << request.GetRouteId();\n ss << \"\/routeresponses\/\";\n ss << request.GetRouteResponseId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetRouteResponseOutcome(GetRouteResponseResult(outcome.GetResult()));\n }\n else\n {\n return GetRouteResponseOutcome(outcome.GetError());\n }\n}\n\nGetRouteResponseOutcomeCallable ApiGatewayV2Client::GetRouteResponseCallable(const GetRouteResponseRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetRouteResponseOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetRouteResponse(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetRouteResponseAsync(const GetRouteResponseRequest& request, const GetRouteResponseResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetRouteResponseAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetRouteResponseAsyncHelper(const GetRouteResponseRequest& request, const GetRouteResponseResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetRouteResponse(request), context);\n}\n\nGetRouteResponsesOutcome ApiGatewayV2Client::GetRouteResponses(const GetRouteResponsesRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetRouteResponses\", \"Required field: ApiId, is not set\");\n return GetRouteResponsesOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.RouteIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetRouteResponses\", \"Required field: RouteId, is not set\");\n return GetRouteResponsesOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [RouteId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/routes\/\";\n ss << request.GetRouteId();\n ss << \"\/routeresponses\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetRouteResponsesOutcome(GetRouteResponsesResult(outcome.GetResult()));\n }\n else\n {\n return GetRouteResponsesOutcome(outcome.GetError());\n }\n}\n\nGetRouteResponsesOutcomeCallable ApiGatewayV2Client::GetRouteResponsesCallable(const GetRouteResponsesRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetRouteResponsesOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetRouteResponses(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetRouteResponsesAsync(const GetRouteResponsesRequest& request, const GetRouteResponsesResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetRouteResponsesAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetRouteResponsesAsyncHelper(const GetRouteResponsesRequest& request, const GetRouteResponsesResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetRouteResponses(request), context);\n}\n\nGetRoutesOutcome ApiGatewayV2Client::GetRoutes(const GetRoutesRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetRoutes\", \"Required field: ApiId, is not set\");\n return GetRoutesOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/routes\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetRoutesOutcome(GetRoutesResult(outcome.GetResult()));\n }\n else\n {\n return GetRoutesOutcome(outcome.GetError());\n }\n}\n\nGetRoutesOutcomeCallable ApiGatewayV2Client::GetRoutesCallable(const GetRoutesRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetRoutesOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetRoutes(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetRoutesAsync(const GetRoutesRequest& request, const GetRoutesResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetRoutesAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetRoutesAsyncHelper(const GetRoutesRequest& request, const GetRoutesResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetRoutes(request), context);\n}\n\nGetStageOutcome ApiGatewayV2Client::GetStage(const GetStageRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetStage\", \"Required field: ApiId, is not set\");\n return GetStageOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.StageNameHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetStage\", \"Required field: StageName, is not set\");\n return GetStageOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [StageName]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/stages\/\";\n ss << request.GetStageName();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetStageOutcome(GetStageResult(outcome.GetResult()));\n }\n else\n {\n return GetStageOutcome(outcome.GetError());\n }\n}\n\nGetStageOutcomeCallable ApiGatewayV2Client::GetStageCallable(const GetStageRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetStageOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetStage(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetStageAsync(const GetStageRequest& request, const GetStageResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetStageAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetStageAsyncHelper(const GetStageRequest& request, const GetStageResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetStage(request), context);\n}\n\nGetStagesOutcome ApiGatewayV2Client::GetStages(const GetStagesRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"GetStages\", \"Required field: ApiId, is not set\");\n return GetStagesOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/stages\";\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_GET, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return GetStagesOutcome(GetStagesResult(outcome.GetResult()));\n }\n else\n {\n return GetStagesOutcome(outcome.GetError());\n }\n}\n\nGetStagesOutcomeCallable ApiGatewayV2Client::GetStagesCallable(const GetStagesRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< GetStagesOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->GetStages(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::GetStagesAsync(const GetStagesRequest& request, const GetStagesResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->GetStagesAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::GetStagesAsyncHelper(const GetStagesRequest& request, const GetStagesResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, GetStages(request), context);\n}\n\nUpdateApiOutcome ApiGatewayV2Client::UpdateApi(const UpdateApiRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"UpdateApi\", \"Required field: ApiId, is not set\");\n return UpdateApiOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_PATCH, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return UpdateApiOutcome(UpdateApiResult(outcome.GetResult()));\n }\n else\n {\n return UpdateApiOutcome(outcome.GetError());\n }\n}\n\nUpdateApiOutcomeCallable ApiGatewayV2Client::UpdateApiCallable(const UpdateApiRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< UpdateApiOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->UpdateApi(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::UpdateApiAsync(const UpdateApiRequest& request, const UpdateApiResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->UpdateApiAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::UpdateApiAsyncHelper(const UpdateApiRequest& request, const UpdateApiResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, UpdateApi(request), context);\n}\n\nUpdateApiMappingOutcome ApiGatewayV2Client::UpdateApiMapping(const UpdateApiMappingRequest& request) const\n{\n if (!request.ApiMappingIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"UpdateApiMapping\", \"Required field: ApiMappingId, is not set\");\n return UpdateApiMappingOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiMappingId]\", false));\n }\n if (!request.DomainNameHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"UpdateApiMapping\", \"Required field: DomainName, is not set\");\n return UpdateApiMappingOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [DomainName]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/domainnames\/\";\n ss << request.GetDomainName();\n ss << \"\/apimappings\/\";\n ss << request.GetApiMappingId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_PATCH, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return UpdateApiMappingOutcome(UpdateApiMappingResult(outcome.GetResult()));\n }\n else\n {\n return UpdateApiMappingOutcome(outcome.GetError());\n }\n}\n\nUpdateApiMappingOutcomeCallable ApiGatewayV2Client::UpdateApiMappingCallable(const UpdateApiMappingRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< UpdateApiMappingOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->UpdateApiMapping(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::UpdateApiMappingAsync(const UpdateApiMappingRequest& request, const UpdateApiMappingResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->UpdateApiMappingAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::UpdateApiMappingAsyncHelper(const UpdateApiMappingRequest& request, const UpdateApiMappingResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, UpdateApiMapping(request), context);\n}\n\nUpdateAuthorizerOutcome ApiGatewayV2Client::UpdateAuthorizer(const UpdateAuthorizerRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"UpdateAuthorizer\", \"Required field: ApiId, is not set\");\n return UpdateAuthorizerOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.AuthorizerIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"UpdateAuthorizer\", \"Required field: AuthorizerId, is not set\");\n return UpdateAuthorizerOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [AuthorizerId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/authorizers\/\";\n ss << request.GetAuthorizerId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_PATCH, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return UpdateAuthorizerOutcome(UpdateAuthorizerResult(outcome.GetResult()));\n }\n else\n {\n return UpdateAuthorizerOutcome(outcome.GetError());\n }\n}\n\nUpdateAuthorizerOutcomeCallable ApiGatewayV2Client::UpdateAuthorizerCallable(const UpdateAuthorizerRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< UpdateAuthorizerOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->UpdateAuthorizer(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::UpdateAuthorizerAsync(const UpdateAuthorizerRequest& request, const UpdateAuthorizerResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->UpdateAuthorizerAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::UpdateAuthorizerAsyncHelper(const UpdateAuthorizerRequest& request, const UpdateAuthorizerResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, UpdateAuthorizer(request), context);\n}\n\nUpdateDeploymentOutcome ApiGatewayV2Client::UpdateDeployment(const UpdateDeploymentRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"UpdateDeployment\", \"Required field: ApiId, is not set\");\n return UpdateDeploymentOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.DeploymentIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"UpdateDeployment\", \"Required field: DeploymentId, is not set\");\n return UpdateDeploymentOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [DeploymentId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/deployments\/\";\n ss << request.GetDeploymentId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_PATCH, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return UpdateDeploymentOutcome(UpdateDeploymentResult(outcome.GetResult()));\n }\n else\n {\n return UpdateDeploymentOutcome(outcome.GetError());\n }\n}\n\nUpdateDeploymentOutcomeCallable ApiGatewayV2Client::UpdateDeploymentCallable(const UpdateDeploymentRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< UpdateDeploymentOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->UpdateDeployment(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::UpdateDeploymentAsync(const UpdateDeploymentRequest& request, const UpdateDeploymentResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->UpdateDeploymentAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::UpdateDeploymentAsyncHelper(const UpdateDeploymentRequest& request, const UpdateDeploymentResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, UpdateDeployment(request), context);\n}\n\nUpdateDomainNameOutcome ApiGatewayV2Client::UpdateDomainName(const UpdateDomainNameRequest& request) const\n{\n if (!request.DomainNameHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"UpdateDomainName\", \"Required field: DomainName, is not set\");\n return UpdateDomainNameOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [DomainName]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/domainnames\/\";\n ss << request.GetDomainName();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_PATCH, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return UpdateDomainNameOutcome(UpdateDomainNameResult(outcome.GetResult()));\n }\n else\n {\n return UpdateDomainNameOutcome(outcome.GetError());\n }\n}\n\nUpdateDomainNameOutcomeCallable ApiGatewayV2Client::UpdateDomainNameCallable(const UpdateDomainNameRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< UpdateDomainNameOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->UpdateDomainName(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::UpdateDomainNameAsync(const UpdateDomainNameRequest& request, const UpdateDomainNameResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->UpdateDomainNameAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::UpdateDomainNameAsyncHelper(const UpdateDomainNameRequest& request, const UpdateDomainNameResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, UpdateDomainName(request), context);\n}\n\nUpdateIntegrationOutcome ApiGatewayV2Client::UpdateIntegration(const UpdateIntegrationRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"UpdateIntegration\", \"Required field: ApiId, is not set\");\n return UpdateIntegrationOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.IntegrationIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"UpdateIntegration\", \"Required field: IntegrationId, is not set\");\n return UpdateIntegrationOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [IntegrationId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/integrations\/\";\n ss << request.GetIntegrationId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_PATCH, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return UpdateIntegrationOutcome(UpdateIntegrationResult(outcome.GetResult()));\n }\n else\n {\n return UpdateIntegrationOutcome(outcome.GetError());\n }\n}\n\nUpdateIntegrationOutcomeCallable ApiGatewayV2Client::UpdateIntegrationCallable(const UpdateIntegrationRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< UpdateIntegrationOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->UpdateIntegration(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::UpdateIntegrationAsync(const UpdateIntegrationRequest& request, const UpdateIntegrationResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->UpdateIntegrationAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::UpdateIntegrationAsyncHelper(const UpdateIntegrationRequest& request, const UpdateIntegrationResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, UpdateIntegration(request), context);\n}\n\nUpdateIntegrationResponseOutcome ApiGatewayV2Client::UpdateIntegrationResponse(const UpdateIntegrationResponseRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"UpdateIntegrationResponse\", \"Required field: ApiId, is not set\");\n return UpdateIntegrationResponseOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.IntegrationIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"UpdateIntegrationResponse\", \"Required field: IntegrationId, is not set\");\n return UpdateIntegrationResponseOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [IntegrationId]\", false));\n }\n if (!request.IntegrationResponseIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"UpdateIntegrationResponse\", \"Required field: IntegrationResponseId, is not set\");\n return UpdateIntegrationResponseOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [IntegrationResponseId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/integrations\/\";\n ss << request.GetIntegrationId();\n ss << \"\/integrationresponses\/\";\n ss << request.GetIntegrationResponseId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_PATCH, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return UpdateIntegrationResponseOutcome(UpdateIntegrationResponseResult(outcome.GetResult()));\n }\n else\n {\n return UpdateIntegrationResponseOutcome(outcome.GetError());\n }\n}\n\nUpdateIntegrationResponseOutcomeCallable ApiGatewayV2Client::UpdateIntegrationResponseCallable(const UpdateIntegrationResponseRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< UpdateIntegrationResponseOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->UpdateIntegrationResponse(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::UpdateIntegrationResponseAsync(const UpdateIntegrationResponseRequest& request, const UpdateIntegrationResponseResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->UpdateIntegrationResponseAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::UpdateIntegrationResponseAsyncHelper(const UpdateIntegrationResponseRequest& request, const UpdateIntegrationResponseResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, UpdateIntegrationResponse(request), context);\n}\n\nUpdateModelOutcome ApiGatewayV2Client::UpdateModel(const UpdateModelRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"UpdateModel\", \"Required field: ApiId, is not set\");\n return UpdateModelOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.ModelIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"UpdateModel\", \"Required field: ModelId, is not set\");\n return UpdateModelOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ModelId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/models\/\";\n ss << request.GetModelId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_PATCH, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return UpdateModelOutcome(UpdateModelResult(outcome.GetResult()));\n }\n else\n {\n return UpdateModelOutcome(outcome.GetError());\n }\n}\n\nUpdateModelOutcomeCallable ApiGatewayV2Client::UpdateModelCallable(const UpdateModelRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< UpdateModelOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->UpdateModel(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::UpdateModelAsync(const UpdateModelRequest& request, const UpdateModelResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->UpdateModelAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::UpdateModelAsyncHelper(const UpdateModelRequest& request, const UpdateModelResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, UpdateModel(request), context);\n}\n\nUpdateRouteOutcome ApiGatewayV2Client::UpdateRoute(const UpdateRouteRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"UpdateRoute\", \"Required field: ApiId, is not set\");\n return UpdateRouteOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.RouteIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"UpdateRoute\", \"Required field: RouteId, is not set\");\n return UpdateRouteOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [RouteId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/routes\/\";\n ss << request.GetRouteId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_PATCH, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return UpdateRouteOutcome(UpdateRouteResult(outcome.GetResult()));\n }\n else\n {\n return UpdateRouteOutcome(outcome.GetError());\n }\n}\n\nUpdateRouteOutcomeCallable ApiGatewayV2Client::UpdateRouteCallable(const UpdateRouteRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< UpdateRouteOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->UpdateRoute(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::UpdateRouteAsync(const UpdateRouteRequest& request, const UpdateRouteResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->UpdateRouteAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::UpdateRouteAsyncHelper(const UpdateRouteRequest& request, const UpdateRouteResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, UpdateRoute(request), context);\n}\n\nUpdateRouteResponseOutcome ApiGatewayV2Client::UpdateRouteResponse(const UpdateRouteResponseRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"UpdateRouteResponse\", \"Required field: ApiId, is not set\");\n return UpdateRouteResponseOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.RouteIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"UpdateRouteResponse\", \"Required field: RouteId, is not set\");\n return UpdateRouteResponseOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [RouteId]\", false));\n }\n if (!request.RouteResponseIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"UpdateRouteResponse\", \"Required field: RouteResponseId, is not set\");\n return UpdateRouteResponseOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [RouteResponseId]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/routes\/\";\n ss << request.GetRouteId();\n ss << \"\/routeresponses\/\";\n ss << request.GetRouteResponseId();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_PATCH, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return UpdateRouteResponseOutcome(UpdateRouteResponseResult(outcome.GetResult()));\n }\n else\n {\n return UpdateRouteResponseOutcome(outcome.GetError());\n }\n}\n\nUpdateRouteResponseOutcomeCallable ApiGatewayV2Client::UpdateRouteResponseCallable(const UpdateRouteResponseRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< UpdateRouteResponseOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->UpdateRouteResponse(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::UpdateRouteResponseAsync(const UpdateRouteResponseRequest& request, const UpdateRouteResponseResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->UpdateRouteResponseAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::UpdateRouteResponseAsyncHelper(const UpdateRouteResponseRequest& request, const UpdateRouteResponseResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, UpdateRouteResponse(request), context);\n}\n\nUpdateStageOutcome ApiGatewayV2Client::UpdateStage(const UpdateStageRequest& request) const\n{\n if (!request.ApiIdHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"UpdateStage\", \"Required field: ApiId, is not set\");\n return UpdateStageOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [ApiId]\", false));\n }\n if (!request.StageNameHasBeenSet())\n {\n AWS_LOGSTREAM_ERROR(\"UpdateStage\", \"Required field: StageName, is not set\");\n return UpdateStageOutcome(Aws::Client::AWSError(ApiGatewayV2Errors::MISSING_PARAMETER, \"MISSING_PARAMETER\", \"Missing required field [StageName]\", false));\n }\n Aws::Http::URI uri = m_uri;\n Aws::StringStream ss;\n ss << \"\/v2\/apis\/\";\n ss << request.GetApiId();\n ss << \"\/stages\/\";\n ss << request.GetStageName();\n uri.SetPath(uri.GetPath() + ss.str());\n JsonOutcome outcome = MakeRequest(uri, request, HttpMethod::HTTP_PATCH, Aws::Auth::SIGV4_SIGNER);\n if(outcome.IsSuccess())\n {\n return UpdateStageOutcome(UpdateStageResult(outcome.GetResult()));\n }\n else\n {\n return UpdateStageOutcome(outcome.GetError());\n }\n}\n\nUpdateStageOutcomeCallable ApiGatewayV2Client::UpdateStageCallable(const UpdateStageRequest& request) const\n{\n auto task = Aws::MakeShared< std::packaged_task< UpdateStageOutcome() > >(ALLOCATION_TAG, [this, request](){ return this->UpdateStage(request); } );\n auto packagedFunction = [task]() { (*task)(); };\n m_executor->Submit(packagedFunction);\n return task->get_future();\n}\n\nvoid ApiGatewayV2Client::UpdateStageAsync(const UpdateStageRequest& request, const UpdateStageResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n m_executor->Submit( [this, request, handler, context](){ this->UpdateStageAsyncHelper( request, handler, context ); } );\n}\n\nvoid ApiGatewayV2Client::UpdateStageAsyncHelper(const UpdateStageRequest& request, const UpdateStageResponseReceivedHandler& handler, const std::shared_ptr& context) const\n{\n handler(this, request, UpdateStage(request), context);\n}\n\n","avg_line_length":45.9245768948,"max_line_length":252,"alphanum_fraction":0.7652836416,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":1458,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":null,"content":"\/\/add include statements\n#include\n#include \"dna.h\"\n\nusing std::cout; \nusing std::cin; \nusing std::string;\n\/\/add function(s) code here\n\n\nstring dna;\n\n\/\/ Content\ndouble get_gc_content(const string& dna)\n{\n int c_count = 0; \n int g_count = 0;\n double sum_count;\n double gc_content; \n\n for (int i = 0; dna[i] != '\\0'; i++)\n {\n if (dna[i] == 'c' || dna[i] == 'C')\n {\n c_count = c_count + 1;\n }\n else if (dna[i] == 'g' || dna[i] == 'G')\n {\n g_count = g_count + 1;\n }\n\n }\n sum_count = c_count + g_count;\n gc_content = sum_count \/ dna.length();\n\n return gc_content;\n}\n\n\/\/ Reverse\nstring reverse_string(string dna)\n{\n int copier = dna.length();\n string new_dna;\n \n for(int i = copier-1; i >= 0; i--)\n new_dna.push_back(dna[i]);\n\n return new_dna;\n}\n\n\/\/ Compliment\nstring get_dna_complement(string dna)\n{\n char ch1 = 'A';\n char ch2 = 'T';\n char ch3 = 'C';\n char ch4 = 'G';\n \n string dna_copy = dna;\n\n for (int i = 0; dna_copy[i]; ++i) \n {\n if (dna_copy[i] == ch1){\n dna_copy[i] = ch2;\n } \n else if (dna_copy[i] == ch2){\n dna_copy[i] = ch1;\n }\n else if (dna_copy[i] == ch3){\n dna_copy[i] = ch4;\n } \n else if (dna_copy[i] == ch4){\n dna_copy[i] = ch3;\n }\n }\n\n string out_put = reverse_string(dna_copy);\n \n return out_put;\n}\n","avg_line_length":18.0,"max_line_length":48,"alphanum_fraction":0.5048010974,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":11042,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["BSD-3-Clause-LBNL"],"max_stars_count":9.0,"content":"\/*\n * This software, which is provided in confidence, was prepared by employees of\n * Pacific Northwest National Labratory operated by Battelle Memorial Institute.\n * Battelle has certain unperfected rights in the software which should not be\n * copied or otherwise disseminated outside your organization without the\n * express written authorization from Battelle. All rights to the software are\n * reserved by Battelle. Battelle makes no warranty, express or implied, and\n * assumes no liability or responsibility for the use of this software.\n *\/\n\n\/*! \n * \\file input_OM_fixed.cpp\n * \\ingroup Objects\n * \\brief The InputOMFixed class source file.\n * \\author Sonny Kim\n *\/\n\n#include \"util\/base\/include\/definitions.h\"\n#include \n#include \n#include \"functions\/include\/input_OM_fixed.h\"\n#include \"functions\/include\/function_utils.h\"\n#include \"util\/base\/include\/xml_helper.h\"\n#include \"containers\/include\/scenario.h\"\n#include \"util\/base\/include\/model_time.h\"\n\nusing namespace std;\nusing namespace xercesc;\n\nextern Scenario* scenario;\n\n\/\/ static initialize.\nconst string InputOMFixed::XML_REPORTING_NAME = \"input-OM-fixed\";\n\n\/*! \\brief Get the XML node name in static form for comparison when parsing XML.\n*\n* This public function accesses the private constant string, XML_NAME. This way\n* the tag is always consistent for both read-in and output and can be easily\n* changed. The \"==\" operator that is used when parsing, required this second\n* function to return static.\n* \\note A function cannot be static and virtual.\n* \\author Josh Lurz, \n* \\return The constant XML_NAME as a static.\n*\/\nconst string& InputOMFixed::getXMLNameStatic() {\n const static string XML_NAME = \"input-OM-fixed\";\n return XML_NAME;\n}\n\n\/*! \\brief Get the XML name for reporting to XML file.\n*\n* This public function accesses the private constant string, XML_NAME. This way\n* the tag is always consistent for reporting outputs and can be easily\n* changed.\n* \\author Sonny Kim\n* \\return The constant XML_NAME.\n*\/\nconst string& InputOMFixed::getXMLReportingName() const{\n return XML_REPORTING_NAME;\n}\n\n\/\/! Constructor\nInputOMFixed::InputOMFixed()\n: mAdjustedCosts( scenario->getModeltime()->getmaxper() ),\n mAdjustedCoefficients( scenario->getModeltime()->getmaxper() ){\n}\n\n\/\/! Clone the input.\nInputOMFixed* InputOMFixed::clone() const {\n return new InputOMFixed( *this );\n}\n\nbool InputOMFixed::isSameType( const string& aType ) const {\n return aType == getXMLNameStatic();\n}\n\nvoid InputOMFixed::copyParam( const IInput* aInput,\n const int aPeriod )\n{\n aInput->copyParamsInto( *this, aPeriod );\n}\n\nvoid InputOMFixed::copyParamsInto( InputOMFixed& aInput,\n const int aPeriod ) const\n{\n \/\/ Copy the coefficients forward. This is done to adjust for technical\n \/\/ change which already occurred.\n assert( aPeriod > 0 );\n aInput.mAdjustedCoefficients[ aPeriod ] = mAdjustedCoefficients[ aPeriod - 1 ];\n}\n\nvoid InputOMFixed::XMLParse( const xercesc::DOMNode* node ) {\n \/\/ TODO: Replace this with the restructured XMLParse.\n \/\/ Make sure we were passed a valid node.\n assert( node );\n\n \/\/ get the name attribute.\n mName = XMLHelper::getAttr( node, \"name\" );\n\n \/\/ get all child nodes.\n const DOMNodeList* nodeList = node->getChildNodes();\n\n \/\/ loop through the child nodes.\n for( unsigned int i = 0; i < nodeList->getLength(); i++ ){\n const DOMNode* curr = nodeList->item( i );\n if( curr->getNodeType() == DOMNode::TEXT_NODE ){\n continue;\n }\n\n const string nodeName = XMLHelper::safeTranscode( curr->getNodeName() );\n if ( nodeName == \"OM-fixed\" ) {\n mOMFixed = XMLHelper::getValue( curr );\n }\n \/\/ TODO: Create capacity factor for technology and use that instead.\n else if( nodeName == \"capacity-factor\" ){\n mCapacityFactor = XMLHelper::getValue( curr );\n }\n else if( nodeName == \"tech-change\" ){\n mTechChange = XMLHelper::getValue( curr );\n }\n else {\n ILogger& mainLog = ILogger::getLogger( \"main_log\" );\n mainLog.setLevel( ILogger::WARNING );\n mainLog << \"Unrecognized text string: \" << nodeName << \" found while parsing \"\n << getXMLNameStatic() << \".\" << endl;\n }\n }\n}\n\nvoid InputOMFixed::toInputXML( ostream& aOut,\n Tabs* aTabs ) const\n{\n XMLWriteOpeningTag( getXMLNameStatic(), aOut, aTabs, mName );\n XMLWriteElement( mOMFixed, \"OM-fixed\", aOut, aTabs );\n XMLWriteElement( mCapacityFactor, \"capacity-factor\", aOut, aTabs );\n XMLWriteElementCheckDefault( mTechChange, \"tech-change\", aOut, aTabs, Value( 0 ) );\n XMLWriteClosingTag( getXMLNameStatic(), aOut, aTabs );\n}\n\nvoid InputOMFixed::toDebugXML( const int aPeriod,\n ostream& aOut,\n Tabs* aTabs ) const\n{\n XMLWriteOpeningTag ( getXMLNameStatic(), aOut, aTabs, mName );\n XMLWriteElement( mLevelizedOMFixedCost, \"levelized-OM-fixed\", aOut, aTabs );\n XMLWriteElement( mOMFixed, \"OM-fixed\", aOut, aTabs );\n XMLWriteElement( mCapacityFactor, \"capacity-factor\", aOut, aTabs );\n XMLWriteElement( mTechChange, \"tech-change\", aOut, aTabs );\n XMLWriteElement( mAdjustedCosts[ aPeriod ], \"adjusted-cost\", aOut, aTabs );\n XMLWriteElement( mAdjustedCoefficients[ aPeriod ], \"adjusted-coef\", aOut, aTabs );\n XMLWriteClosingTag( getXMLNameStatic(), aOut, aTabs );\n}\n\nvoid InputOMFixed::completeInit( const string& aRegionName,\n const string& aSectorName,\n const string& aSubsectorName,\n const string& aTechName,\n DependencyFinder* aDependencyFinder,\n const IInfo* aTechInfo )\n{ \n \/\/ completeInit() is called for each technology for each period\n \/\/ so levelized O&M fixed cost calculation is done here.\n\n mLevelizedOMFixedCost = calcLevelizedOMFixedCost();\n\n \/\/ Initialize the adjusted costs in all periods to the base calculate\n \/\/ levelized OM_fixed cost.\n \/\/ These costs may be adjusted by the Technology, for instance for capture\n \/\/ penalties.\n mAdjustedCosts.assign( mAdjustedCosts.size(), mLevelizedOMFixedCost );\n}\n\n\/** Calculate the levelizd fixed O&M cost.\n *\n * \\param void \n * \\return Levelized fixed O&M cost.\n * \\author Sonny Kim\n *\/\ndouble InputOMFixed::calcLevelizedOMFixedCost( void ) const\n{\n \/\/ TODO: Use technology's capacity factor.\n \/\/ TODO: Use Value class for units conversion.\n double levelizedOMFixedCost = mOMFixed \n\t\/ ( FunctionUtils::HOURS_PER_YEAR() * mCapacityFactor * FunctionUtils::GJ_PER_KWH() );\n\n return levelizedOMFixedCost; \/\/ 1975$\/GJ\n}\n\nvoid InputOMFixed::initCalc( const string& aRegionName,\n const string& aSectorName,\n const bool aIsNewInvestmentPeriod,\n const bool aIsTrade,\n const int aPeriod )\n{\n \/\/ Initialize the current coefficient to 1 if it has not \n \/\/ been initialized through copyParam. It may be adjusted\n \/\/ later when coefficients are copied forward.\n mAdjustedCoefficients[ aPeriod ] = 1;\n}\n\ndouble InputOMFixed::getPrice( const string& aRegionName,\n const int aPeriod ) const\n{\n assert( mAdjustedCosts[ aPeriod ].isInited() );\n return mAdjustedCosts[ aPeriod ];\n}\n\nvoid InputOMFixed::setPrice( const string& aRegionName,\n const double aPrice,\n const int aPeriod ) \n{\n mAdjustedCosts[ aPeriod ] = aPrice;\n}\n\ndouble InputOMFixed::getPhysicalDemand( const int aPeriod ) const {\n return 0;\n}\n\nvoid InputOMFixed::setPhysicalDemand( double aPhysicalDemand,\n const string& aRegionName,\n const int aPeriod )\n{\n \/\/ Does not add to the marketplace.\n}\n\ndouble InputOMFixed::getCO2EmissionsCoefficient( const string& aGHGName,\n const int aPeriod ) const\n{\n \/\/ Capital cost inputs cannot have emissions coefficients.\n return 0;\n}\n\ndouble InputOMFixed::getCoefficient( const int aPeriod ) const {\n assert( mAdjustedCoefficients[ aPeriod ].isInited() );\n return mAdjustedCoefficients[ aPeriod ];\n}\n\nvoid InputOMFixed::setCoefficient( const double aCoefficient,\n const int aPeriod )\n{\n mAdjustedCoefficients[ aPeriod ] = aCoefficient;\n}\n\nvoid InputOMFixed::tabulateFixedQuantity( const string& aRegionName,\n const double aFixedOutput,\n const bool aIsInvestmentPeriod,\n const int aPeriod )\n{\n}\n\nvoid InputOMFixed::scaleCalibrationQuantity( const double aScaleFactor ){\n \/\/ Capital cost inputs are not calibrated.\n}\n\ndouble InputOMFixed::getCalibrationQuantity( const int aPeriod ) const\n{\n \/\/ Capital cost inputs are not calibrated.\n return -1;\n}\n\nbool InputOMFixed::hasTypeFlag( const int aTypeFlag ) const {\n return ( ( aTypeFlag & ~( IInput::OM_FIXED ) ) == 0 );\n}\n\ndouble InputOMFixed::getIncomeElasticity() const {\n return 0;\n}\n\ndouble InputOMFixed::getPriceElasticity() const {\n return 0;\n}\n\ndouble InputOMFixed::getTechChange( const int aPeriod ) const\n{\n return mTechChange;\n}\n\nvoid InputOMFixed::doInterpolations( const int aYear, const int aPreviousYear,\n const int aNextYear, const IInput* aPreviousInput,\n const IInput* aNextInput )\n{\n const InputOMFixed* prevOMInput = static_cast( aPreviousInput );\n const InputOMFixed* nextOMInput = static_cast( aNextInput );\n \n \/*!\n * \\pre We are given a valid InputOMFixed for the previous input.\n *\/\n assert( prevOMInput );\n \n \/*!\n * \\pre We are given a valid InputOMFixed for the next input.\n *\/\n assert( nextOMInput );\n \n \/\/ tech change is just copied from the next input\n mTechChange = nextOMInput->mTechChange;\n \n \/\/ interpolate the costs\n mOMFixed = util::linearInterpolateY( aYear, aPreviousYear, aNextYear,\n prevOMInput->mOMFixed, nextOMInput->mOMFixed );\n mLevelizedOMFixedCost = util::linearInterpolateY( aYear, aPreviousYear, aNextYear,\n prevOMInput->mLevelizedOMFixedCost,\n nextOMInput->mLevelizedOMFixedCost );\n \n \/\/ interpolate capacity factor\n mCapacityFactor = util::linearInterpolateY( aYear, aPreviousYear, aNextYear,\n prevOMInput->mCapacityFactor, nextOMInput->mCapacityFactor );\n}\n","avg_line_length":35.7346278317,"max_line_length":109,"alphanum_fraction":0.6472559319,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":19744,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":1.0,"content":"\/\/ Copyright (c) 2018 The Bitcoin Core developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\nnamespace {\n\nvoid CheckUnparsable(const std::string& prv, const std::string& pub)\n{\n FlatSigningProvider keys_priv, keys_pub;\n auto parse_priv = Parse(prv, keys_priv);\n auto parse_pub = Parse(pub, keys_pub);\n BOOST_CHECK(!parse_priv);\n BOOST_CHECK(!parse_pub);\n}\n\nconstexpr int DEFAULT = 0;\nconstexpr int RANGE = 1; \/\/ Expected to be ranged descriptor\nconstexpr int HARDENED = 2; \/\/ Derivation needs access to private keys\nconstexpr int UNSOLVABLE = 4; \/\/ This descriptor is not expected to be solvable\nconstexpr int SIGNABLE = 8; \/\/ We can sign with this descriptor (this is not true when actual BIP32 derivation is used, as that's not integrated in our signing code)\n\nstd::string MaybeUseHInsteadOfApostrophy(std::string ret)\n{\n if (InsecureRandBool()) {\n while (true) {\n auto it = ret.find(\"'\");\n if (it != std::string::npos) {\n ret[it] = 'h';\n } else {\n break;\n }\n }\n }\n return ret;\n}\n\nvoid Check(const std::string& prv, const std::string& pub, int flags, const std::vector>& scripts)\n{\n FlatSigningProvider keys_priv, keys_pub;\n\n \/\/ Check that parsing succeeds.\n auto parse_priv = Parse(MaybeUseHInsteadOfApostrophy(prv), keys_priv);\n auto parse_pub = Parse(MaybeUseHInsteadOfApostrophy(pub), keys_pub);\n BOOST_CHECK(parse_priv);\n BOOST_CHECK(parse_pub);\n\n \/\/ Check private keys are extracted from the private version but not the public one.\n BOOST_CHECK(keys_priv.keys.size());\n BOOST_CHECK(!keys_pub.keys.size());\n\n \/\/ Check that both versions serialize back to the public version.\n std::string pub1 = parse_priv->ToString();\n std::string pub2 = parse_priv->ToString();\n BOOST_CHECK_EQUAL(pub, pub1);\n BOOST_CHECK_EQUAL(pub, pub2);\n\n \/\/ Check that both can be serialized with private key back to the private version, but not without private key.\n std::string prv1, prv2;\n BOOST_CHECK(parse_priv->ToPrivateString(keys_priv, prv1));\n BOOST_CHECK_EQUAL(prv, prv1);\n BOOST_CHECK(!parse_priv->ToPrivateString(keys_pub, prv1));\n BOOST_CHECK(parse_pub->ToPrivateString(keys_priv, prv1));\n BOOST_CHECK_EQUAL(prv, prv1);\n BOOST_CHECK(!parse_pub->ToPrivateString(keys_pub, prv1));\n\n \/\/ Check whether IsRange on both returns the expected result\n BOOST_CHECK_EQUAL(parse_pub->IsRange(), (flags & RANGE) != 0);\n BOOST_CHECK_EQUAL(parse_priv->IsRange(), (flags & RANGE) != 0);\n\n\n \/\/ Is not ranged descriptor, only a single result is expected.\n if (!(flags & RANGE)) assert(scripts.size() == 1);\n\n size_t max = (flags & RANGE) ? scripts.size() : 3;\n for (size_t i = 0; i < max; ++i) {\n const auto& ref = scripts[(flags & RANGE) ? i : 0];\n for (int t = 0; t < 2; ++t) {\n FlatSigningProvider key_provider = (flags & HARDENED) ? keys_priv : keys_pub;\n FlatSigningProvider script_provider;\n std::vector spks;\n BOOST_CHECK((t ? parse_priv : parse_pub)->Expand(i, key_provider, spks, script_provider));\n BOOST_CHECK_EQUAL(spks.size(), ref.size());\n for (size_t n = 0; n < spks.size(); ++n) {\n BOOST_CHECK_EQUAL(ref[n], HexStr(spks[n].begin(), spks[n].end()));\n BOOST_CHECK_EQUAL(IsSolvable(Merge(key_provider, script_provider), spks[n]), (flags & UNSOLVABLE) == 0);\n\n if (flags & SIGNABLE) {\n CMutableTransaction spend;\n spend.vin.resize(1);\n spend.vout.resize(1);\n BOOST_CHECK_MESSAGE(SignSignature(Merge(keys_priv, script_provider), spks[n], spend, 0, 1, SIGHASH_ALL), prv);\n }\n }\n\n }\n }\n}\n\n}\n\nBOOST_FIXTURE_TEST_SUITE(descriptor_tests, BasicTestingSetup)\n\nBOOST_AUTO_TEST_CASE(descriptor_test)\n{\n \/\/ Basic single-key compressed\n Check(\"combo(L4rK1yDtCWekvXuE6oXD9jCYfFNV2cWRpVuPLBcCU2z8TrisoyY1)\", \"combo(03a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd)\", SIGNABLE, {{\"2103a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bdac\",\"76a9149a1c78a507689f6f54b847ad1cef1e614ee23f1e88ac\",\"00149a1c78a507689f6f54b847ad1cef1e614ee23f1e\",\"a91484ab21b1b2fd065d4504ff693d832434b6108d7b87\"}});\n Check(\"pk(L4rK1yDtCWekvXuE6oXD9jCYfFNV2cWRpVuPLBcCU2z8TrisoyY1)\", \"pk(03a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd)\", SIGNABLE, {{\"2103a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bdac\"}});\n Check(\"pkh(L4rK1yDtCWekvXuE6oXD9jCYfFNV2cWRpVuPLBcCU2z8TrisoyY1)\", \"pkh(03a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd)\", SIGNABLE, {{\"76a9149a1c78a507689f6f54b847ad1cef1e614ee23f1e88ac\"}});\n Check(\"wpkh(L4rK1yDtCWekvXuE6oXD9jCYfFNV2cWRpVuPLBcCU2z8TrisoyY1)\", \"wpkh(03a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd)\", SIGNABLE, {{\"00149a1c78a507689f6f54b847ad1cef1e614ee23f1e\"}});\n Check(\"sh(wpkh(L4rK1yDtCWekvXuE6oXD9jCYfFNV2cWRpVuPLBcCU2z8TrisoyY1))\", \"sh(wpkh(03a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd))\", SIGNABLE, {{\"a91484ab21b1b2fd065d4504ff693d832434b6108d7b87\"}});\n\n \/\/ Basic single-key uncompressed\n Check(\"combo(5KYZdUEo39z3FPrtuX2QbbwGnNP5zTd7yyr2SC1j299sBCnWjss)\", \"combo(04a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd5b8dec5235a0fa8722476c7709c02559e3aa73aa03918ba2d492eea75abea235)\", SIGNABLE, {{\"4104a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd5b8dec5235a0fa8722476c7709c02559e3aa73aa03918ba2d492eea75abea235ac\",\"76a914b5bd079c4d57cc7fc28ecf8213a6b791625b818388ac\"}});\n Check(\"pk(5KYZdUEo39z3FPrtuX2QbbwGnNP5zTd7yyr2SC1j299sBCnWjss)\", \"pk(04a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd5b8dec5235a0fa8722476c7709c02559e3aa73aa03918ba2d492eea75abea235)\", SIGNABLE, {{\"4104a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd5b8dec5235a0fa8722476c7709c02559e3aa73aa03918ba2d492eea75abea235ac\"}});\n Check(\"pkh(5KYZdUEo39z3FPrtuX2QbbwGnNP5zTd7yyr2SC1j299sBCnWjss)\", \"pkh(04a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd5b8dec5235a0fa8722476c7709c02559e3aa73aa03918ba2d492eea75abea235)\", SIGNABLE, {{\"76a914b5bd079c4d57cc7fc28ecf8213a6b791625b818388ac\"}});\n CheckUnparsable(\"wpkh(5KYZdUEo39z3FPrtuX2QbbwGnNP5zTd7yyr2SC1j299sBCnWjss)\", \"wpkh(04a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd5b8dec5235a0fa8722476c7709c02559e3aa73aa03918ba2d492eea75abea235)\"); \/\/ No uncompressed keys in witness\n CheckUnparsable(\"wsh(pk(5KYZdUEo39z3FPrtuX2QbbwGnNP5zTd7yyr2SC1j299sBCnWjss))\", \"wsh(pk(04a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd5b8dec5235a0fa8722476c7709c02559e3aa73aa03918ba2d492eea75abea235))\"); \/\/ No uncompressed keys in witness\n CheckUnparsable(\"sh(wpkh(5KYZdUEo39z3FPrtuX2QbbwGnNP5zTd7yyr2SC1j299sBCnWjss))\", \"sh(wpkh(04a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd5b8dec5235a0fa8722476c7709c02559e3aa73aa03918ba2d492eea75abea235))\"); \/\/ No uncompressed keys in witness\n\n \/\/ Some unconventional single-key constructions\n Check(\"sh(pk(L4rK1yDtCWekvXuE6oXD9jCYfFNV2cWRpVuPLBcCU2z8TrisoyY1))\", \"sh(pk(03a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd))\", SIGNABLE, {{\"a9141857af51a5e516552b3086430fd8ce55f7c1a52487\"}});\n Check(\"sh(pkh(L4rK1yDtCWekvXuE6oXD9jCYfFNV2cWRpVuPLBcCU2z8TrisoyY1))\", \"sh(pkh(03a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd))\", SIGNABLE, {{\"a9141a31ad23bf49c247dd531a623c2ef57da3c400c587\"}});\n Check(\"wsh(pk(L4rK1yDtCWekvXuE6oXD9jCYfFNV2cWRpVuPLBcCU2z8TrisoyY1))\", \"wsh(pk(03a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd))\", SIGNABLE, {{\"00202e271faa2325c199d25d22e1ead982e45b64eeb4f31e73dbdf41bd4b5fec23fa\"}});\n Check(\"wsh(pkh(L4rK1yDtCWekvXuE6oXD9jCYfFNV2cWRpVuPLBcCU2z8TrisoyY1))\", \"wsh(pkh(03a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd))\", SIGNABLE, {{\"0020338e023079b91c58571b20e602d7805fb808c22473cbc391a41b1bd3a192e75b\"}});\n Check(\"sh(wsh(pk(L4rK1yDtCWekvXuE6oXD9jCYfFNV2cWRpVuPLBcCU2z8TrisoyY1)))\", \"sh(wsh(pk(03a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd)))\", SIGNABLE, {{\"a91472d0c5a3bfad8c3e7bd5303a72b94240e80b6f1787\"}});\n Check(\"sh(wsh(pkh(L4rK1yDtCWekvXuE6oXD9jCYfFNV2cWRpVuPLBcCU2z8TrisoyY1)))\", \"sh(wsh(pkh(03a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd)))\", SIGNABLE, {{\"a914b61b92e2ca21bac1e72a3ab859a742982bea960a87\"}});\n\n \/\/ Versions with BIP32 derivations\n Check(\"combo(xprvA1RpRA33e1JQ7ifknakTFpgNXPmW2YvmhqLQYMmrj4xJXXWYpDPS3xz7iAxn8L39njGVyuoseXzU6rcxFLJ8HFsTjSyQbLYnMpCqE2VbFWc)\", \"combo(xpub6ERApfZwUNrhLCkDtcHTcxd75RbzS1ed54G1LkBUHQVHQKqhMkhgbmJbZRkrgZw4koxb5JaHWkY4ALHY2grBGRjaDMzQLcgJvLJuZZvRcEL)\", SIGNABLE, {{\"2102d2b36900396c9282fa14628566582f206a5dd0bcc8d5e892611806cafb0301f0ac\",\"76a91431a507b815593dfc51ffc7245ae7e5aee304246e88ac\",\"001431a507b815593dfc51ffc7245ae7e5aee304246e\",\"a9142aafb926eb247cb18240a7f4c07983ad1f37922687\"}});\n Check(\"pk(xprv9uPDJpEQgRQfDcW7BkF7eTya6RPxXeJCqCJGHuCJ4GiRVLzkTXBAJMu2qaMWPrS7AANYqdq6vcBcBUdJCVVFceUvJFjaPdGZ2y9WACViL4L\/0)\", \"pk(xpub68NZiKmJWnxxS6aaHmn81bvJeTESw724CRDs6HbuccFQN9Ku14VQrADWgqbhhTHBaohPX4CjNLf9fq9MYo6oDaPPLPxSb7gwQN3ih19Zm4Y\/0)\", DEFAULT, {{\"210379e45b3cf75f9c5f9befd8e9506fb962f6a9d185ac87001ec44a8d3df8d4a9e3ac\"}});\n Check(\"pkh(xprv9s21ZrQH143K31xYSDQpPDxsXRTUcvj2iNHm5NUtrGiGG5e2DtALGdso3pGz6ssrdK4PFmM8NSpSBHNqPqm55Qn3LqFtT2emdEXVYsCzC2U\/2147483647'\/0)\", \"pkh(xpub661MyMwAqRbcFW31YEwpkMuc5THy2PSt5bDMsktWQcFF8syAmRUapSCGu8ED9W6oDMSgv6Zz8idoc4a6mr8BDzTJY47LJhkJ8UB7WEGuduB\/2147483647'\/0)\", HARDENED, {{\"76a914ebdc90806a9c4356c1c88e42216611e1cb4c1c1788ac\"}});\n Check(\"wpkh(xprv9vHkqa6EV4sPZHYqZznhT2NPtPCjKuDKGY38FBWLvgaDx45zo9WQRUT3dKYnjwih2yJD9mkrocEZXo1ex8G81dwSM1fwqWpWkeS3v86pgKt\/1\/2\/*)\", \"wpkh(xpub69H7F5d8KSRgmmdJg2KhpAK8SR3DjMwAdkxj3ZuxV27CprR9LgpeyGmXUbC6wb7ERfvrnKZjXoUmmDznezpbZb7ap6r1D3tgFxHmwMkQTPH\/1\/2\/*)\", RANGE, {{\"0014326b2249e3a25d5dc60935f044ee835d090ba859\"},{\"0014af0bd98abc2f2cae66e36896a39ffe2d32984fb7\"},{\"00141fa798efd1cbf95cebf912c031b8a4a6e9fb9f27\"}});\n Check(\"sh(wpkh(xprv9s21ZrQH143K3QTDL4LXw2F7HEK3wJUD2nW2nRk4stbPy6cq3jPPqjiChkVvvNKmPGJxWUtg6LnF5kejMRNNU3TGtRBeJgk33yuGBxrMPHi\/10\/20\/30\/40\/*'))\", \"sh(wpkh(xpub661MyMwAqRbcFtXgS5sYJABqqG9YLmC4Q1Rdap9gSE8NqtwybGhePY2gZ29ESFjqJoCu1Rupje8YtGqsefD265TMg7usUDFdp6W1EGMcet8\/10\/20\/30\/40\/*'))\", RANGE | HARDENED, {{\"a9149a4d9901d6af519b2a23d4a2f51650fcba87ce7b87\"},{\"a914bed59fc0024fae941d6e20a3b44a109ae740129287\"},{\"a9148483aa1116eb9c05c482a72bada4b1db24af654387\"}});\n Check(\"combo(xprvA2JDeKCSNNZky6uBCviVfJSKyQ1mDYahRjijr5idH2WwLsEd4Hsb2Tyh8RfQMuPh7f7RtyzTtdrbdqqsunu5Mm3wDvUAKRHSC34sJ7in334\/*)\", \"combo(xpub6FHa3pjLCk84BayeJxFW2SP4XRrFd1JYnxeLeU8EqN3vDfZmbqBqaGJAyiLjTAwm6ZLRQUMv1ZACTj37sR62cfN7fe5JnJ7dh8zL4fiyLHV\/*)\", RANGE, {{\"2102df12b7035bdac8e3bab862a3a83d06ea6b17b6753d52edecba9be46f5d09e076ac\",\"76a914f90e3178ca25f2c808dc76624032d352fdbdfaf288ac\",\"0014f90e3178ca25f2c808dc76624032d352fdbdfaf2\",\"a91408f3ea8c68d4a7585bf9e8bda226723f70e445f087\"},{\"21032869a233c9adff9a994e4966e5b821fd5bac066da6c3112488dc52383b4a98ecac\",\"76a914a8409d1b6dfb1ed2a3e8aa5e0ef2ff26b15b75b788ac\",\"0014a8409d1b6dfb1ed2a3e8aa5e0ef2ff26b15b75b7\",\"a91473e39884cb71ae4e5ac9739e9225026c99763e6687\"}});\n CheckUnparsable(\"pkh(xprv9s21ZrQH143K31xYSDQpPDxsXRTUcvj2iNHm5NUtrGiGG5e2DtALGdso3pGz6ssrdK4PFmM8NSpSBHNqPqm55Qn3LqFtT2emdEXVYsCzC2U\/2147483648)\", \"pkh(xpub661MyMwAqRbcFW31YEwpkMuc5THy2PSt5bDMsktWQcFF8syAmRUapSCGu8ED9W6oDMSgv6Zz8idoc4a6mr8BDzTJY47LJhkJ8UB7WEGuduB\/2147483648)\"); \/\/ BIP 32 path element overflow\n\n \/\/ Multisig constructions\n Check(\"multi(1,L4rK1yDtCWekvXuE6oXD9jCYfFNV2cWRpVuPLBcCU2z8TrisoyY1,5KYZdUEo39z3FPrtuX2QbbwGnNP5zTd7yyr2SC1j299sBCnWjss)\", \"multi(1,03a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd,04a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd5b8dec5235a0fa8722476c7709c02559e3aa73aa03918ba2d492eea75abea235)\", SIGNABLE, {{\"512103a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd4104a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd5b8dec5235a0fa8722476c7709c02559e3aa73aa03918ba2d492eea75abea23552ae\"}});\n Check(\"sh(multi(2,xprvA1RpRA33e1JQ7ifknakTFpgNXPmW2YvmhqLQYMmrj4xJXXWYpDPS3xz7iAxn8L39njGVyuoseXzU6rcxFLJ8HFsTjSyQbLYnMpCqE2VbFWc,xprv9uPDJpEQgRQfDcW7BkF7eTya6RPxXeJCqCJGHuCJ4GiRVLzkTXBAJMu2qaMWPrS7AANYqdq6vcBcBUdJCVVFceUvJFjaPdGZ2y9WACViL4L\/0))\", \"sh(multi(2,xpub6ERApfZwUNrhLCkDtcHTcxd75RbzS1ed54G1LkBUHQVHQKqhMkhgbmJbZRkrgZw4koxb5JaHWkY4ALHY2grBGRjaDMzQLcgJvLJuZZvRcEL,xpub68NZiKmJWnxxS6aaHmn81bvJeTESw724CRDs6HbuccFQN9Ku14VQrADWgqbhhTHBaohPX4CjNLf9fq9MYo6oDaPPLPxSb7gwQN3ih19Zm4Y\/0))\", DEFAULT, {{\"a91445a9a622a8b0a1269944be477640eedc447bbd8487\"}});\n Check(\"wsh(multi(2,xprv9s21ZrQH143K31xYSDQpPDxsXRTUcvj2iNHm5NUtrGiGG5e2DtALGdso3pGz6ssrdK4PFmM8NSpSBHNqPqm55Qn3LqFtT2emdEXVYsCzC2U\/2147483647'\/0,xprv9vHkqa6EV4sPZHYqZznhT2NPtPCjKuDKGY38FBWLvgaDx45zo9WQRUT3dKYnjwih2yJD9mkrocEZXo1ex8G81dwSM1fwqWpWkeS3v86pgKt\/1\/2\/*,xprv9s21ZrQH143K3QTDL4LXw2F7HEK3wJUD2nW2nRk4stbPy6cq3jPPqjiChkVvvNKmPGJxWUtg6LnF5kejMRNNU3TGtRBeJgk33yuGBxrMPHi\/10\/20\/30\/40\/*'))\", \"wsh(multi(2,xpub661MyMwAqRbcFW31YEwpkMuc5THy2PSt5bDMsktWQcFF8syAmRUapSCGu8ED9W6oDMSgv6Zz8idoc4a6mr8BDzTJY47LJhkJ8UB7WEGuduB\/2147483647'\/0,xpub69H7F5d8KSRgmmdJg2KhpAK8SR3DjMwAdkxj3ZuxV27CprR9LgpeyGmXUbC6wb7ERfvrnKZjXoUmmDznezpbZb7ap6r1D3tgFxHmwMkQTPH\/1\/2\/*,xpub661MyMwAqRbcFtXgS5sYJABqqG9YLmC4Q1Rdap9gSE8NqtwybGhePY2gZ29ESFjqJoCu1Rupje8YtGqsefD265TMg7usUDFdp6W1EGMcet8\/10\/20\/30\/40\/*'))\", HARDENED | RANGE, {{\"0020b92623201f3bb7c3771d45b2ad1d0351ea8fbf8cfe0a0e570264e1075fa1948f\"},{\"002036a08bbe4923af41cf4316817c93b8d37e2f635dd25cfff06bd50df6ae7ea203\"},{\"0020a96e7ab4607ca6b261bfe3245ffda9c746b28d3f59e83d34820ec0e2b36c139c\"}});\n Check(\"sh(wsh(multi(16,KzoAz5CanayRKex3fSLQ2BwJpN7U52gZvxMyk78nDMHuqrUxuSJy,KwGNz6YCCQtYvFzMtrC6D3tKTKdBBboMrLTsjr2NYVBwapCkn7Mr,KxogYhiNfwxuswvXV66eFyKcCpm7dZ7TqHVqujHAVUjJxyivxQ9X,L2BUNduTSyZwZjwNHynQTF14mv2uz2NRq5n5sYWTb4FkkmqgEE9f,L1okJGHGn1kFjdXHKxXjwVVtmCMR2JA5QsbKCSpSb7ReQjezKeoD,KxDCNSST75HFPaW5QKpzHtAyaCQC7p9Vo3FYfi2u4dXD1vgMiboK,L5edQjFtnkcf5UWURn6UuuoFrabgDQUHdheKCziwN42aLwS3KizU,KzF8UWFcEC7BYTq8Go1xVimMkDmyNYVmXV5PV7RuDicvAocoPB8i,L3nHUboKG2w4VSJ5jYZ5CBM97oeK6YuKvfZxrefdShECcjEYKMWZ,KyjHo36dWkYhimKmVVmQTq3gERv3pnqA4xFCpvUgbGDJad7eS8WE,KwsfyHKRUTZPQtysN7M3tZ4GXTnuov5XRgjdF2XCG8faAPmFruRF,KzCUbGhN9LJhdeFfL9zQgTJMjqxdBKEekRGZX24hXdgCNCijkkap,KzgpMBwwsDLwkaC5UrmBgCYaBD2WgZ7PBoGYXR8KT7gCA9UTN5a3,KyBXTPy4T7YG4q9tcAM3LkvfRpD1ybHMvcJ2ehaWXaSqeGUxEdkP,KzJDe9iwJRPtKP2F2AoN6zBgzS7uiuAwhWCfGdNeYJ3PC1HNJ8M8,L1xbHrxynrqLKkoYc4qtoQPx6uy5qYXR5ZDYVYBSRmCV5piU3JG9)))\",\"sh(wsh(multi(16,03669b8afcec803a0d323e9a17f3ea8e68e8abe5a278020a929adbec52421adbd0,0260b2003c386519fc9eadf2b5cf124dd8eea4c4e68d5e154050a9346ea98ce600,0362a74e399c39ed5593852a30147f2959b56bb827dfa3e60e464b02ccf87dc5e8,0261345b53de74a4d721ef877c255429961b7e43714171ac06168d7e08c542a8b8,02da72e8b46901a65d4374fe6315538d8f368557dda3a1dcf9ea903f3afe7314c8,0318c82dd0b53fd3a932d16e0ba9e278fcc937c582d5781be626ff16e201f72286,0297ccef1ef99f9d73dec9ad37476ddb232f1238aff877af19e72ba04493361009,02e502cfd5c3f972fe9a3e2a18827820638f96b6f347e54d63deb839011fd5765d,03e687710f0e3ebe81c1037074da939d409c0025f17eb86adb9427d28f0f7ae0e9,02c04d3a5274952acdbc76987f3184b346a483d43be40874624b29e3692c1df5af,02ed06e0f418b5b43a7ec01d1d7d27290fa15f75771cb69b642a51471c29c84acd,036d46073cbb9ffee90473f3da429abc8de7f8751199da44485682a989a4bebb24,02f5d1ff7c9029a80a4e36b9a5497027ef7f3e73384a4a94fbfe7c4e9164eec8bc,02e41deffd1b7cce11cde209a781adcffdabd1b91c0ba0375857a2bfd9302419f3,02d76625f7956a7fc505ab02556c23ee72d832f1bac391bcd2d3abce5710a13d06,0399eb0a5487515802dc14544cf10b3666623762fbed2ec38a3975716e2c29c232)))\", SIGNABLE, {{\"a9147fc63e13dc25e8a95a3cee3d9a714ac3afd96f1e87\"}});\n CheckUnparsable(\"sh(multi(16,KzoAz5CanayRKex3fSLQ2BwJpN7U52gZvxMyk78nDMHuqrUxuSJy,KwGNz6YCCQtYvFzMtrC6D3tKTKdBBboMrLTsjr2NYVBwapCkn7Mr,KxogYhiNfwxuswvXV66eFyKcCpm7dZ7TqHVqujHAVUjJxyivxQ9X,L2BUNduTSyZwZjwNHynQTF14mv2uz2NRq5n5sYWTb4FkkmqgEE9f,L1okJGHGn1kFjdXHKxXjwVVtmCMR2JA5QsbKCSpSb7ReQjezKeoD,KxDCNSST75HFPaW5QKpzHtAyaCQC7p9Vo3FYfi2u4dXD1vgMiboK,L5edQjFtnkcf5UWURn6UuuoFrabgDQUHdheKCziwN42aLwS3KizU,KzF8UWFcEC7BYTq8Go1xVimMkDmyNYVmXV5PV7RuDicvAocoPB8i,L3nHUboKG2w4VSJ5jYZ5CBM97oeK6YuKvfZxrefdShECcjEYKMWZ,KyjHo36dWkYhimKmVVmQTq3gERv3pnqA4xFCpvUgbGDJad7eS8WE,KwsfyHKRUTZPQtysN7M3tZ4GXTnuov5XRgjdF2XCG8faAPmFruRF,KzCUbGhN9LJhdeFfL9zQgTJMjqxdBKEekRGZX24hXdgCNCijkkap,KzgpMBwwsDLwkaC5UrmBgCYaBD2WgZ7PBoGYXR8KT7gCA9UTN5a3,KyBXTPy4T7YG4q9tcAM3LkvfRpD1ybHMvcJ2ehaWXaSqeGUxEdkP,KzJDe9iwJRPtKP2F2AoN6zBgzS7uiuAwhWCfGdNeYJ3PC1HNJ8M8,L1xbHrxynrqLKkoYc4qtoQPx6uy5qYXR5ZDYVYBSRmCV5piU3JG9))\",\"sh(multi(16,03669b8afcec803a0d323e9a17f3ea8e68e8abe5a278020a929adbec52421adbd0,0260b2003c386519fc9eadf2b5cf124dd8eea4c4e68d5e154050a9346ea98ce600,0362a74e399c39ed5593852a30147f2959b56bb827dfa3e60e464b02ccf87dc5e8,0261345b53de74a4d721ef877c255429961b7e43714171ac06168d7e08c542a8b8,02da72e8b46901a65d4374fe6315538d8f368557dda3a1dcf9ea903f3afe7314c8,0318c82dd0b53fd3a932d16e0ba9e278fcc937c582d5781be626ff16e201f72286,0297ccef1ef99f9d73dec9ad37476ddb232f1238aff877af19e72ba04493361009,02e502cfd5c3f972fe9a3e2a18827820638f96b6f347e54d63deb839011fd5765d,03e687710f0e3ebe81c1037074da939d409c0025f17eb86adb9427d28f0f7ae0e9,02c04d3a5274952acdbc76987f3184b346a483d43be40874624b29e3692c1df5af,02ed06e0f418b5b43a7ec01d1d7d27290fa15f75771cb69b642a51471c29c84acd,036d46073cbb9ffee90473f3da429abc8de7f8751199da44485682a989a4bebb24,02f5d1ff7c9029a80a4e36b9a5497027ef7f3e73384a4a94fbfe7c4e9164eec8bc,02e41deffd1b7cce11cde209a781adcffdabd1b91c0ba0375857a2bfd9302419f3,02d76625f7956a7fc505ab02556c23ee72d832f1bac391bcd2d3abce5710a13d06,0399eb0a5487515802dc14544cf10b3666623762fbed2ec38a3975716e2c29c232))\"); \/\/ P2SH does not fit 16 compressed pubkeys in a redeemscript\n\n \/\/ Check for invalid nesting of structures\n CheckUnparsable(\"sh(L4rK1yDtCWekvXuE6oXD9jCYfFNV2cWRpVuPLBcCU2z8TrisoyY1)\", \"sh(03a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd)\"); \/\/ P2SH needs a script, not a key\n CheckUnparsable(\"sh(combo(L4rK1yDtCWekvXuE6oXD9jCYfFNV2cWRpVuPLBcCU2z8TrisoyY1))\", \"sh(combo(03a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd))\"); \/\/ Old must be top level\n CheckUnparsable(\"wsh(L4rK1yDtCWekvXuE6oXD9jCYfFNV2cWRpVuPLBcCU2z8TrisoyY1)\", \"wsh(03a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd)\"); \/\/ P2WSH needs a script, not a key\n CheckUnparsable(\"wsh(wpkh(L4rK1yDtCWekvXuE6oXD9jCYfFNV2cWRpVuPLBcCU2z8TrisoyY1))\", \"wsh(wpkh(03a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd))\"); \/\/ Cannot embed witness inside witness\n CheckUnparsable(\"wsh(sh(pk(L4rK1yDtCWekvXuE6oXD9jCYfFNV2cWRpVuPLBcCU2z8TrisoyY1)))\", \"wsh(sh(pk(03a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd)))\"); \/\/ Cannot embed P2SH inside P2WSH\n CheckUnparsable(\"sh(sh(pk(L4rK1yDtCWekvXuE6oXD9jCYfFNV2cWRpVuPLBcCU2z8TrisoyY1)))\", \"sh(sh(pk(03a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd)))\"); \/\/ Cannot embed P2SH inside P2SH\n CheckUnparsable(\"wsh(wsh(pk(L4rK1yDtCWekvXuE6oXD9jCYfFNV2cWRpVuPLBcCU2z8TrisoyY1)))\", \"wsh(wsh(pk(03a34b99f22c790c4e36b2b3c2c35a36db06226e41c692fc82b8b56ac1c540c5bd)))\"); \/\/ Cannot embed P2WSH inside P2WSH\n}\n\nBOOST_AUTO_TEST_SUITE_END()\n","avg_line_length":120.3902439024,"max_line_length":2037,"alphanum_fraction":0.8554497569,"low_alphanum":false,"long_lines":true,"lexable":true} {"size":28426,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":1.0,"content":"\/\/ Copyright (c) 2019 The OPALCOIN developers\n\/\/ Distributed under the MIT software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"qt\/opalcoin\/send.h\"\n#include \"qt\/opalcoin\/forms\/ui_send.h\"\n#include \"qt\/opalcoin\/addnewcontactdialog.h\"\n#include \"qt\/opalcoin\/qtutils.h\"\n#include \"qt\/opalcoin\/sendchangeaddressdialog.h\"\n#include \"qt\/opalcoin\/optionbutton.h\"\n#include \"qt\/opalcoin\/sendconfirmdialog.h\"\n#include \"qt\/opalcoin\/myaddressrow.h\"\n#include \"qt\/opalcoin\/guitransactionsutils.h\"\n#include \"clientmodel.h\"\n#include \"optionsmodel.h\"\n#include \"addresstablemodel.h\"\n#include \"coincontrol.h\"\n#include \"script\/standard.h\"\n#include \"zauop\/deterministicmint.h\"\n#include \"openuridialog.h\"\n#include \"zauopcontroldialog.h\"\n\nSendWidget::SendWidget(OPALCOINGUI* parent) :\n PWidget(parent),\n ui(new Ui::send),\n coinIcon(new QPushButton()),\n btnContacts(new QPushButton())\n{\n ui->setupUi(this);\n\n this->setStyleSheet(parent->styleSheet());\n\n \/* Containers *\/\n setCssProperty(ui->left, \"container\");\n ui->left->setContentsMargins(0,20,0,20);\n setCssProperty(ui->right, \"container-right\");\n ui->right->setContentsMargins(20,10,20,20);\n\n \/* Light Font *\/\n QFont fontLight;\n fontLight.setWeight(QFont::Light);\n\n \/* Title *\/\n ui->labelTitle->setText(tr(\"Send\"));\n setCssProperty(ui->labelTitle, \"text-title-screen\");\n ui->labelTitle->setFont(fontLight);\n\n \/* Button Group *\/\n ui->pushLeft->setText(\"AUOP\");\n setCssProperty(ui->pushLeft, \"btn-check-left\");\n ui->pushLeft->setChecked(true);\n ui->pushRight->setText(\"zAUOP\");\n setCssProperty(ui->pushRight, \"btn-check-right\");\n ui->pushRight->setVisible(false);\n ui->pushLeft->setVisible(false);\n\n \/* Subtitle *\/\n ui->labelSubtitle1->setText(tr(\"You can transfer public coins (AUOP)\"));\n setCssProperty(ui->labelSubtitle1, \"text-subtitle\");\n\n ui->labelSubtitle2->setText(tr(\"Select coin type to spend\"));\n ui->labelSubtitle2->setVisible(false);\n setCssProperty(ui->labelSubtitle2, \"text-subtitle\");\n\n \/* Address *\/\n ui->labelSubtitleAddress->setText(tr(\"Enter a OPALCOIN address or contact label\"));\n setCssProperty(ui->labelSubtitleAddress, \"text-title\");\n\n\n \/* Amount *\/\n ui->labelSubtitleAmount->setText(tr(\"Amount\"));\n setCssProperty(ui->labelSubtitleAmount, \"text-title\");\n\n \/* Buttons *\/\n ui->pushButtonFee->setText(tr(\"Customize fee\"));\n setCssBtnSecondary(ui->pushButtonFee);\n\n ui->pushButtonClear->setText(tr(\"Clear all\"));\n setCssProperty(ui->pushButtonClear, \"btn-secundary-clear\");\n\n ui->pushButtonAddRecipient->setText(tr(\"Add recipient\"));\n setCssProperty(ui->pushButtonAddRecipient, \"btn-secundary-add\");\n\n setCssBtnPrimary(ui->pushButtonSave);\n ui->pushButtonReset->setText(tr(\"Reset to default\"));\n setCssBtnSecondary(ui->pushButtonReset);\n\n \/\/ Coin control\n ui->btnCoinControl->setTitleClassAndText(\"btn-title-grey\", \"Coin Control\");\n ui->btnCoinControl->setSubTitleClassAndText(\"text-subtitle\", \"Select the source of the coins.\");\n\n \/\/ Change address option\n ui->btnChangeAddress->setTitleClassAndText(\"btn-title-grey\", \"Change Address\");\n ui->btnChangeAddress->setSubTitleClassAndText(\"text-subtitle\", \"Customize the change address.\");\n\n \/\/ Uri\n ui->btnUri->setTitleClassAndText(\"btn-title-grey\", \"Open URI\");\n ui->btnUri->setSubTitleClassAndText(\"text-subtitle\", \"Parse a payment request.\");\n\n connect(ui->pushButtonFee, SIGNAL(clicked()), this, SLOT(onChangeCustomFeeClicked()));\n connect(ui->btnCoinControl, SIGNAL(clicked()), this, SLOT(onCoinControlClicked()));\n connect(ui->btnChangeAddress, SIGNAL(clicked()), this, SLOT(onChangeAddressClicked()));\n connect(ui->btnUri, SIGNAL(clicked()), this, SLOT(onOpenUriClicked()));\n connect(ui->pushButtonReset, &QPushButton::clicked, [this](){ onResetCustomOptions(true); });\n\n setCssProperty(ui->coinWidget, \"container-coin-type\");\n setCssProperty(ui->labelLine, \"container-divider\");\n\n\n \/\/ Total Send\n ui->labelTitleTotalSend->setText(tr(\"Total to send\"));\n setCssProperty(ui->labelTitleTotalSend, \"text-title\");\n\n ui->labelAmountSend->setText(\"0.00 AUOP\");\n setCssProperty(ui->labelAmountSend, \"text-body1\");\n\n \/\/ Total Remaining\n setCssProperty(ui->labelTitleTotalRemaining, \"text-title\");\n\n setCssProperty(ui->labelAmountRemaining, \"text-body1\");\n\n \/\/ Icon Send\n ui->stackedWidget->addWidget(coinIcon);\n coinIcon->show();\n coinIcon->raise();\n\n setCssProperty(coinIcon, \"coin-icon-auop\");\n\n QSize BUTTON_SIZE = QSize(24, 24);\n coinIcon->setMinimumSize(BUTTON_SIZE);\n coinIcon->setMaximumSize(BUTTON_SIZE);\n\n int posX = 0;\n int posY = 20;\n coinIcon->move(posX, posY);\n\n \/\/ Entry\n addEntry();\n\n \/\/ Connect\n connect(ui->pushLeft, &QPushButton::clicked, [this](){onAUOPSelected(true);});\n connect(ui->pushRight, &QPushButton::clicked, [this](){onAUOPSelected(false);});\n connect(ui->pushButtonSave, SIGNAL(clicked()), this, SLOT(onSendClicked()));\n connect(ui->pushButtonAddRecipient, SIGNAL(clicked()), this, SLOT(onAddEntryClicked()));\n connect(ui->pushButtonClear, SIGNAL(clicked()), this, SLOT(clearAll()));\n}\n\nvoid SendWidget::refreshView(){\n QString btnText;\n if(ui->pushLeft->isChecked()){\n btnText = tr(\"Send AUOP\");\n ui->pushButtonAddRecipient->setVisible(true);\n }else{\n btnText = tr(\"Send zAUOP\");\n ui->pushButtonAddRecipient->setVisible(false);\n }\n ui->pushButtonSave->setText(btnText);\n\n refreshAmounts();\n}\n\nvoid SendWidget::refreshAmounts() {\n\n CAmount total = 0;\n QMutableListIterator it(entries);\n while (it.hasNext()) {\n SendMultiRow* entry = it.next();\n CAmount amount = entry->getAmountValue();\n if (amount > 0)\n total += amount;\n }\n\n bool isZauop = ui->pushRight->isChecked();\n nDisplayUnit = walletModel->getOptionsModel()->getDisplayUnit();\n\n ui->labelAmountSend->setText(GUIUtil::formatBalance(total, nDisplayUnit, isZauop));\n\n CAmount totalAmount = 0;\n if (CoinControlDialog::coinControl->HasSelected()){\n \/\/ Set remaining balance to the sum of the coinControl selected inputs\n totalAmount = walletModel->getBalance(CoinControlDialog::coinControl) - total;\n ui->labelTitleTotalRemaining->setText(tr(\"Total remaining from the selected UTXO\"));\n } else {\n \/\/ Wallet's balance\n totalAmount = (isZauop ? walletModel->getZerocoinBalance() : walletModel->getBalance()) - total;\n ui->labelTitleTotalRemaining->setText(tr(\"Total remaining\"));\n }\n ui->labelAmountRemaining->setText(\n GUIUtil::formatBalance(\n totalAmount,\n nDisplayUnit,\n isZauop\n )\n );\n}\n\nvoid SendWidget::loadClientModel(){\n if (clientModel) {\n connect(clientModel, &ClientModel::numBlocksChanged, [this](){\n if (customFeeDialog) customFeeDialog->updateFee();\n });\n }\n}\n\nvoid SendWidget::loadWalletModel() {\n if (walletModel && walletModel->getOptionsModel()) {\n \/\/ display unit\n nDisplayUnit = walletModel->getOptionsModel()->getDisplayUnit();\n\n for(SendMultiRow *entry : entries){\n if(entry){\n entry->setWalletModel(walletModel);\n }\n }\n\n \/\/ Refresh view\n refreshView();\n\n \/\/ TODO: This only happen when the coin control features are modified in other screen, check before do this if the wallet has another screen modifying it.\n \/\/ Coin Control\n \/\/connect(model->getOptionsModel(), SIGNAL(coinControlFeaturesChanged(bool)), this, SLOT(coinControlFeatureChanged(bool)));\n \/\/ui->frameCoinControl->setVisible(model->getOptionsModel()->getCoinControlFeatures());\n \/\/coinControlUpdateLabels();\n }\n}\n\nvoid SendWidget::clearAll(){\n onResetCustomOptions(false);\n if(customFeeDialog) customFeeDialog->clear();\n ui->pushButtonFee->setText(tr(\"Customize Fee\"));\n if(walletModel) walletModel->setWalletDefaultFee();\n clearEntries();\n refreshAmounts();\n}\n\nvoid SendWidget::onResetCustomOptions(bool fRefreshAmounts){\n CoinControlDialog::coinControl->SetNull();\n ui->btnChangeAddress->setActive(false);\n ui->btnCoinControl->setActive(false);\n if (fRefreshAmounts) {\n refreshAmounts();\n }\n}\n\nvoid SendWidget::clearEntries(){\n int num = entries.length();\n for (int i = 0; i < num; ++i) {\n ui->scrollAreaWidgetContents->layout()->takeAt(0)->widget()->deleteLater();\n }\n entries.clear();\n\n addEntry();\n}\n\nvoid SendWidget::addEntry(){\n if(entries.isEmpty()){\n createEntry();\n } else {\n if (entries.length() == 1) {\n SendMultiRow *entry = entries.at(0);\n entry->hideLabels();\n entry->setNumber(1);\n }else if(entries.length() == MAX_SEND_POPUP_ENTRIES){\n inform(tr(\"Maximum amount of outputs reached\"));\n return;\n }\n\n SendMultiRow *sendMultiRow = createEntry();\n sendMultiRow->setNumber(entries.length());\n sendMultiRow->hideLabels();\n }\n}\n\nSendMultiRow* SendWidget::createEntry(){\n SendMultiRow *sendMultiRow = new SendMultiRow(this);\n if(this->walletModel) sendMultiRow->setWalletModel(this->walletModel);\n entries.append(sendMultiRow);\n ui->scrollAreaWidgetContents->layout()->addWidget(sendMultiRow);\n connect(sendMultiRow, &SendMultiRow::onContactsClicked, this, &SendWidget::onContactsClicked);\n connect(sendMultiRow, &SendMultiRow::onMenuClicked, this, &SendWidget::onMenuClicked);\n connect(sendMultiRow, &SendMultiRow::onValueChanged, this, &SendWidget::onValueChanged);\n return sendMultiRow;\n}\n\nvoid SendWidget::onAddEntryClicked(){\n \/\/ Check prev valid entries before add a new one.\n for (SendMultiRow* entry : entries){\n if(!entry || !entry->validate()) {\n inform(tr(\"Invalid entry, previous entries must be valid before add a new one\"));\n return;\n }\n }\n addEntry();\n}\n\nvoid SendWidget::resizeEvent(QResizeEvent *event){\n resizeMenu();\n QWidget::resizeEvent(event);\n}\n\n\nvoid SendWidget::onSendClicked(){\n\n if (!walletModel || !walletModel->getOptionsModel())\n return;\n\n QList recipients;\n\n for (SendMultiRow* entry : entries){\n \/\/ TODO: Check UTXO splitter here..\n \/\/ Validate send..\n if(entry && entry->validate()) {\n recipients.append(entry->getValue());\n }else{\n inform(tr(\"Invalid entry\"));\n return;\n }\n }\n\n if (recipients.isEmpty()) {\n inform(tr(\"No set recipients\"));\n return;\n }\n\n bool sendAUOP = ui->pushLeft->isChecked();\n\n \/\/ request unlock only if was locked or unlocked for mixing:\n \/\/ this way we let users unlock by walletpassphrase or by menu\n \/\/ and make many transactions while unlocking through this dialog\n \/\/ will call relock\n if(!GUIUtil::requestUnlock(walletModel, sendAUOP ? AskPassphraseDialog::Context::Send_AUOP : AskPassphraseDialog::Context::Send_zAUOP, true)){\n \/\/ Unlock wallet was cancelled\n inform(tr(\"Cannot send, wallet locked\"));\n return;\n }\n\n if((sendAUOP) ? send(recipients) : sendZauop(recipients)) {\n updateEntryLabels(recipients);\n }\n}\n\nbool SendWidget::send(QList recipients){\n \/\/ prepare transaction for getting txFee earlier\n WalletModelTransaction currentTransaction(recipients);\n WalletModel::SendCoinsReturn prepareStatus;\n\n prepareStatus = walletModel->prepareTransaction(currentTransaction, CoinControlDialog::coinControl);\n\n \/\/ process prepareStatus and on error generate message shown to user\n GuiTransactionsUtils::ProcessSendCoinsReturn(\n this,\n prepareStatus,\n walletModel,\n BitcoinUnits::formatWithUnit(walletModel->getOptionsModel()->getDisplayUnit(),\n currentTransaction.getTransactionFee()),\n true\n );\n\n if (prepareStatus.status != WalletModel::OK) {\n inform(tr(\"Cannot create transaction.\"));\n return false;\n }\n\n showHideOp(true);\n QString warningStr = QString();\n if (currentTransaction.getTransaction()->fStakeDelegationVoided)\n warningStr = tr(\"WARNING:\\nTransaction spends a cold-stake delegation, voiding it.\\n\"\n \"These coins will no longer be cold-staked.\");\n TxDetailDialog* dialog = new TxDetailDialog(window, true, warningStr);\n dialog->setDisplayUnit(walletModel->getOptionsModel()->getDisplayUnit());\n dialog->setData(walletModel, currentTransaction);\n dialog->adjustSize();\n openDialogWithOpaqueBackgroundY(dialog, window, 3, 5);\n\n if(dialog->isConfirm()){\n \/\/ now send the prepared transaction\n WalletModel::SendCoinsReturn sendStatus = dialog->getStatus();\n \/\/ process sendStatus and on error generate message shown to user\n GuiTransactionsUtils::ProcessSendCoinsReturn(\n this,\n sendStatus,\n walletModel\n );\n\n if (sendStatus.status == WalletModel::OK) {\n clearAll();\n inform(tr(\"Transaction sent\"));\n dialog->deleteLater();\n return true;\n }\n }\n\n dialog->deleteLater();\n return false;\n}\n\nbool SendWidget::sendZauop(QList recipients){\n if (!walletModel || !walletModel->getOptionsModel())\n return false;\n\n if(sporkManager.IsSporkActive(SPORK_16_ZEROCOIN_MAINTENANCE_MODE)) {\n emit message(tr(\"Spend Zerocoin\"), tr(\"zAUOP is currently undergoing maintenance.\"), CClientUIInterface::MSG_ERROR);\n return false;\n }\n\n std::list> outputs;\n CAmount total = 0;\n for (SendCoinsRecipient rec : recipients){\n total += rec.amount;\n outputs.push_back(std::pair(new CBitcoinAddress(rec.address.toStdString()),rec.amount));\n }\n\n \/\/ use mints from zAUOP selector if applicable\n std::vector vMintsToFetch;\n std::vector vMintsSelected;\n if (!ZAUOPControlDialog::setSelectedMints.empty()) {\n vMintsToFetch = ZAUOPControlDialog::GetSelectedMints();\n\n for (auto& meta : vMintsToFetch) {\n CZerocoinMint mint;\n if (!walletModel->getMint(meta.hashSerial, mint)){\n inform(tr(\"Coin control mint not found\"));\n return false;\n }\n vMintsSelected.emplace_back(mint);\n }\n }\n\n QString sendBody = outputs.size() == 1 ?\n tr(\"Sending %1 to address %2\\n\")\n .arg(BitcoinUnits::formatWithUnit(walletModel->getOptionsModel()->getDisplayUnit(), total, false, BitcoinUnits::separatorAlways))\n .arg(recipients.first().address)\n :\n tr(\"Sending %1 to addresses:\\n%2\")\n .arg(BitcoinUnits::formatWithUnit(walletModel->getOptionsModel()->getDisplayUnit(), total, false, BitcoinUnits::separatorAlways))\n .arg(recipientsToString(recipients));\n\n bool ret = false;\n emit message(\n tr(\"Spend Zerocoin\"),\n sendBody,\n CClientUIInterface::MSG_INFORMATION | CClientUIInterface::BTN_MASK | CClientUIInterface::MODAL,\n &ret);\n\n if(!ret) return false;\n\n CZerocoinSpendReceipt receipt;\n\n std::string changeAddress = \"\";\n if(!boost::get(&CoinControlDialog::coinControl->destChange)){\n changeAddress = CBitcoinAddress(CoinControlDialog::coinControl->destChange).ToString();\n }else{\n changeAddress = walletModel->getAddressTableModel()->getAddressToShow().toStdString();\n }\n\n if (walletModel->sendZauop(\n vMintsSelected,\n true,\n true,\n receipt,\n outputs,\n changeAddress\n )\n ) {\n inform(tr(\"zAUOP transaction sent!\"));\n ZAUOPControlDialog::setSelectedMints.clear();\n clearAll();\n return true;\n } else {\n QString body;\n if (receipt.GetStatus() == ZAUOP_SPEND_V1_SEC_LEVEL) {\n body = tr(\"Version 1 zAUOP require a security level of 100 to successfully spend.\");\n } else {\n int nNeededSpends = receipt.GetNeededSpends(); \/\/ Number of spends we would need for this transaction\n const int nMaxSpends = Params().Zerocoin_MaxSpendsPerTransaction(); \/\/ Maximum possible spends for one zAUOP transaction\n if (nNeededSpends > nMaxSpends) {\n body = tr(\"Too much inputs (\") + QString::number(nNeededSpends, 10) +\n tr(\") needed.\\nMaximum allowed: \") + QString::number(nMaxSpends, 10);\n body += tr(\n \"\\nEither mint higher denominations (so fewer inputs are needed) or reduce the amount to spend.\");\n } else {\n body = QString::fromStdString(receipt.GetStatusMessage());\n }\n }\n emit message(\"zAUOP transaction failed\", body, CClientUIInterface::MSG_ERROR);\n return false;\n }\n}\n\nQString SendWidget::recipientsToString(QList recipients){\n QString s = \"\";\n for (SendCoinsRecipient rec : recipients){\n s += rec.address + \" -> \" + BitcoinUnits::formatWithUnit(walletModel->getOptionsModel()->getDisplayUnit(), rec.amount, false, BitcoinUnits::separatorAlways) + \"\\n\";\n }\n return s;\n}\n\nvoid SendWidget::updateEntryLabels(QList recipients){\n for (SendCoinsRecipient rec : recipients){\n QString label = rec.label;\n if(!label.isNull()) {\n QString labelOld = walletModel->getAddressTableModel()->labelForAddress(rec.address);\n if(label.compare(labelOld) != 0) {\n CTxDestination dest = CBitcoinAddress(rec.address.toStdString()).Get();\n if (!walletModel->updateAddressBookLabels(dest, label.toStdString(),\n this->walletModel->isMine(dest) ? \"receive\" : \"send\")) {\n \/\/ Label update failed\n emit message(\"\", tr(\"Address label update failed for address: %1\").arg(rec.address), CClientUIInterface::MSG_ERROR);\n return;\n }\n }\n }\n\n }\n}\n\n\nvoid SendWidget::onChangeAddressClicked(){\n showHideOp(true);\n SendChangeAddressDialog* dialog = new SendChangeAddressDialog(window);\n if(!boost::get(&CoinControlDialog::coinControl->destChange)){\n dialog->setAddress(QString::fromStdString(CBitcoinAddress(CoinControlDialog::coinControl->destChange).ToString()));\n }\n if(openDialogWithOpaqueBackgroundY(dialog, window, 3, 5)) {\n if(dialog->selected) {\n QString ret;\n if (dialog->getAddress(walletModel, &ret)) {\n CoinControlDialog::coinControl->destChange = CBitcoinAddress(ret.toStdString()).Get();\n ui->btnChangeAddress->setActive(true);\n }else{\n inform(tr(\"Invalid change address\"));\n ui->btnChangeAddress->setActive(false);\n }\n }\n }\n dialog->deleteLater();\n}\n\nvoid SendWidget::onOpenUriClicked(){\n showHideOp(true);\n OpenURIDialog *dlg = new OpenURIDialog(window);\n if (openDialogWithOpaqueBackgroundY(dlg, window, 3, 5)) {\n\n SendCoinsRecipient rcp;\n if (!GUIUtil::parseBitcoinURI(dlg->getURI(), &rcp)) {\n inform(tr(\"Invalid URI\"));\n return;\n }\n if (!walletModel->validateAddress(rcp.address)) {\n inform(tr(\"Invalid address in URI\"));\n return;\n }\n\n int listSize = entries.size();\n if (listSize == 1) {\n SendMultiRow *entry = entries[0];\n entry->setAddressAndLabelOrDescription(rcp.address, rcp.message);\n entry->setAmount(BitcoinUnits::format(nDisplayUnit, rcp.amount, false));\n } else {\n \/\/ Use the last one if it's invalid or add a new one\n SendMultiRow *entry = entries[listSize - 1];\n if (!entry->validate()) {\n addEntry();\n entry = entries[listSize];\n }\n entry->setAddressAndLabelOrDescription(rcp.address, rcp.message);\n entry->setAmount(BitcoinUnits::format(nDisplayUnit, rcp.amount, false));\n }\n emit receivedURI(dlg->getURI());\n }\n dlg->deleteLater();\n}\n\nvoid SendWidget::onChangeCustomFeeClicked(){\n showHideOp(true);\n if (!customFeeDialog) {\n customFeeDialog = new SendCustomFeeDialog(window);\n customFeeDialog->setWalletModel(walletModel);\n }\n if (openDialogWithOpaqueBackgroundY(customFeeDialog, window, 3, 5)){\n ui->pushButtonFee->setText(tr(\"Custom Fee %1\").arg(BitcoinUnits::formatWithUnit(nDisplayUnit, customFeeDialog->getFeeRate().GetFeePerK()) + \"\/kB\"));\n isCustomFeeSelected = true;\n walletModel->setWalletDefaultFee(customFeeDialog->getFeeRate().GetFeePerK());\n } else {\n ui->pushButtonFee->setText(tr(\"Customize Fee\"));\n isCustomFeeSelected = false;\n walletModel->setWalletDefaultFee();\n }\n}\n\nvoid SendWidget::onCoinControlClicked(){\n if(isAUOP){\n if (walletModel->getBalance() > 0) {\n if (!coinControlDialog) {\n coinControlDialog = new CoinControlDialog();\n coinControlDialog->setModel(walletModel);\n } else {\n coinControlDialog->refreshDialog();\n }\n coinControlDialog->exec();\n ui->btnCoinControl->setActive(CoinControlDialog::coinControl->HasSelected());\n refreshAmounts();\n } else {\n inform(tr(\"You don't have any AUOP to select.\"));\n }\n }else{\n if (walletModel->getZerocoinBalance() > 0) {\n ZAUOPControlDialog *zAUOPControl = new ZAUOPControlDialog(this);\n zAUOPControl->setModel(walletModel);\n zAUOPControl->exec();\n ui->btnCoinControl->setActive(!ZAUOPControlDialog::setSelectedMints.empty());\n zAUOPControl->deleteLater();\n } else {\n inform(tr(\"You don't have any zAUOP in your balance to select.\"));\n }\n }\n}\n\nvoid SendWidget::onValueChanged() {\n refreshAmounts();\n}\n\nvoid SendWidget::onAUOPSelected(bool _isAUOP){\n isAUOP = _isAUOP;\n setCssProperty(coinIcon, _isAUOP ? \"coin-icon-auop\" : \"coin-icon-zauop\");\n refreshView();\n updateStyle(coinIcon);\n}\n\nvoid SendWidget::onContactsClicked(SendMultiRow* entry){\n focusedEntry = entry;\n if(menu && menu->isVisible()){\n menu->hide();\n }\n\n int contactsSize = walletModel->getAddressTableModel()->sizeSend();\n if(contactsSize == 0) {\n inform(tr(\"No contacts available, you can go to the contacts screen and add some there!\"));\n return;\n }\n\n int height = (contactsSize <= 2) ? entry->getEditHeight() * ( 2 * (contactsSize + 1 )) : entry->getEditHeight() * 4;\n int width = entry->getEditWidth();\n\n if(!menuContacts){\n menuContacts = new ContactsDropdown(\n width,\n height,\n this\n );\n menuContacts->setWalletModel(walletModel, AddressTableModel::Send);\n connect(menuContacts, &ContactsDropdown::contactSelected, [this](QString address, QString label){\n if(focusedEntry){\n focusedEntry->setLabel(label);\n focusedEntry->setAddress(address);\n }\n });\n\n }\n\n if(menuContacts->isVisible()){\n menuContacts->hide();\n return;\n }\n\n menuContacts->resizeList(width, height);\n menuContacts->setStyleSheet(this->styleSheet());\n menuContacts->adjustSize();\n\n QPoint pos;\n if (entries.size() > 1){\n pos = entry->pos();\n pos.setY((pos.y() + (focusedEntry->getEditHeight() - 12) * 4));\n } else {\n pos = focusedEntry->getEditLineRect().bottomLeft();\n pos.setY((pos.y() + (focusedEntry->getEditHeight() - 12) * 3));\n }\n pos.setX(pos.x() + 20);\n menuContacts->move(pos);\n menuContacts->show();\n}\n\nvoid SendWidget::onMenuClicked(SendMultiRow* entry){\n focusedEntry = entry;\n if(menuContacts && menuContacts->isVisible()){\n menuContacts->hide();\n }\n QPoint pos = entry->pos();\n pos.setX(pos.x() + (entry->width() - entry->getMenuBtnWidth()));\n pos.setY(pos.y() + entry->height() + (entry->getMenuBtnWidth()));\n\n if(!this->menu){\n this->menu = new TooltipMenu(window, this);\n this->menu->setCopyBtnVisible(false);\n this->menu->setEditBtnText(tr(\"Save contact\"));\n this->menu->setMinimumSize(this->menu->width() + 30,this->menu->height());\n connect(this->menu, &TooltipMenu::message, this, &AddressesWidget::message);\n connect(this->menu, SIGNAL(onEditClicked()), this, SLOT(onContactMultiClicked()));\n connect(this->menu, SIGNAL(onDeleteClicked()), this, SLOT(onDeleteClicked()));\n }else {\n this->menu->hide();\n }\n menu->move(pos);\n menu->show();\n}\n\nvoid SendWidget::onContactMultiClicked(){\n if(focusedEntry) {\n QString address = focusedEntry->getAddress();\n if (address.isEmpty()) {\n inform(tr(\"Address field is empty\"));\n return;\n }\n if (!walletModel->validateAddress(address)) {\n inform(tr(\"Invalid address\"));\n return;\n }\n CBitcoinAddress auopAdd = CBitcoinAddress(address.toStdString());\n if (walletModel->isMine(auopAdd)) {\n inform(tr(\"Cannot store your own address as contact\"));\n return;\n }\n\n showHideOp(true);\n AddNewContactDialog *dialog = new AddNewContactDialog(window);\n QString label = walletModel->getAddressTableModel()->labelForAddress(address);\n if (!label.isNull()){\n dialog->setTexts(tr(\"Update Contact\"), \"Edit label for the selected address:\\n%1\");\n dialog->setData(address, label);\n } else {\n dialog->setTexts(tr(\"Create New Contact\"), \"Save label for the selected address:\\n%1\");\n dialog->setData(address, \"\");\n }\n openDialogWithOpaqueBackgroundY(dialog, window, 3, 5);\n if (dialog->res) {\n if (label == dialog->getLabel()) {\n return;\n }\n if (walletModel->updateAddressBookLabels(auopAdd.Get(), dialog->getLabel().toStdString(), \"send\")) {\n inform(tr(\"New Contact Stored\"));\n } else {\n inform(tr(\"Error Storing Contact\"));\n }\n }\n dialog->deleteLater();\n }\n\n}\n\nvoid SendWidget::onDeleteClicked(){\n if (focusedEntry) {\n focusedEntry->hide();\n focusedEntry->deleteLater();\n int entryNumber = focusedEntry->getNumber();\n\n \/\/ remove selected entry and update row number for the others\n QMutableListIterator it(entries);\n while (it.hasNext()) {\n SendMultiRow* entry = it.next();\n if (focusedEntry == entry){\n it.remove();\n } else if (focusedEntry && entry->getNumber() > entryNumber){\n entry->setNumber(entry->getNumber() - 1);\n }\n }\n\n if (entries.size() == 1) {\n SendMultiRow* sendMultiRow = QMutableListIterator(entries).next();\n sendMultiRow->setNumber(entries.length());\n sendMultiRow->showLabels();\n }\n\n focusedEntry = nullptr;\n\n \/\/ Update total amounts\n refreshAmounts();\n }\n}\n\nvoid SendWidget::resizeMenu(){\n if(menuContacts && menuContacts->isVisible() && focusedEntry){\n int width = focusedEntry->getEditWidth();\n menuContacts->resizeList(width, menuContacts->height());\n menuContacts->resize(width, menuContacts->height());\n QPoint pos = focusedEntry->getEditLineRect().bottomLeft();\n pos.setX(pos.x() + 20);\n pos.setY(pos.y() + ((focusedEntry->getEditHeight() - 12) * 3));\n menuContacts->move(pos);\n }\n}\n\nvoid SendWidget::changeTheme(bool isLightTheme, QString& theme){\n if (coinControlDialog) coinControlDialog->setStyleSheet(theme);\n}\n\nSendWidget::~SendWidget(){\n delete ui;\n}\n","avg_line_length":35.576971214,"max_line_length":172,"alphanum_fraction":0.6319918385,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":407,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["Unlicense"],"max_stars_count":127.0,"content":"#define PROBLEM \"https:\/\/yukicoder.me\/problems\/no\/1254\"\n\n#include \"..\/..\/template\/template.cpp\"\n\n#include \"..\/..\/graph\/others\/namori-graph.hpp\"\n\nint main() {\n int N;\n cin >> N;\n NamoriGraph< int > g(N);\n g.read(N);\n g.build();\n vector< int > ans;\n for(auto &e : g.loop_edges) {\n ans.emplace_back(e.idx + 1);\n }\n sort(begin(ans), end(ans));\n cout << ans.size() << \"\\n\";\n cout << ans << \"\\n\";\n}\n","avg_line_length":19.380952381,"max_line_length":55,"alphanum_fraction":0.5724815725,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":6196,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["NRL"],"max_stars_count":null,"content":"\/* ============================================================================\n * Copyright (c) 2009-2016 BlueQuartz Software, LLC\n *\n * Redistribution and use in source and binary forms, with or without modification,\n * are permitted provided that the following conditions are met:\n *\n * Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * Redistributions in binary form must reproduce the above copyright notice, this\n * list of conditions and the following disclaimer in the documentation and\/or\n * other materials provided with the distribution.\n *\n * Neither the name of BlueQuartz Software, the US Air Force, nor the names of its\n * contributors may be used to endorse or promote products derived from this software\n * without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE\n * USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * The code contained herein was partially funded by the followig contracts:\n * United States Air Force Prime Contract FA8650-07-D-5800\n * United States Air Force Prime Contract FA8650-10-D-5210\n * United States Prime Contract Navy N00173-07-C-2068\n *\n * ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ *\/\n#include \"TupleTableWidget.h\"\n\n#include \n\n#include \"TupleTableItemDelegate.h\"\n\n\/\/ -----------------------------------------------------------------------------\n\/\/\n\/\/ -----------------------------------------------------------------------------\nTupleTableWidget::TupleTableWidget(QWidget* parent)\n: QWidget(parent)\n{\n setupUi(this);\n\n setupGui();\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/\n\/\/ -----------------------------------------------------------------------------\nTupleTableWidget::~TupleTableWidget() = default;\n\n\/\/ -----------------------------------------------------------------------------\n\/\/\n\/\/ -----------------------------------------------------------------------------\nbool TupleTableWidget::didUseEdit()\n{\n return m_UserEdited;\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/\n\/\/ -----------------------------------------------------------------------------\nvoid TupleTableWidget::setupGui()\n{\n \/\/ Set the item delegate so that we can only enter 'double' values into the table\n TupleTableItemDelegate* dlg = new TupleTableItemDelegate(tupleTable);\n tupleTable->setItemDelegate(dlg);\n\n tupleTable->horizontalHeader()->setSectionResizeMode(QHeaderView::ResizeToContents);\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/\n\/\/ -----------------------------------------------------------------------------\nstd::vector TupleTableWidget::getData()\n{\n int cCount = tupleTable->columnCount();\n std::vector data(cCount, 0);\n\n for(int col = 0; col < cCount; col++)\n {\n QTableWidgetItem* item = tupleTable->item(0, col);\n if(nullptr == item)\n {\n return std::vector();\n }\n data[col] = item->data(Qt::DisplayRole).toInt();\n }\n\n return data;\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/\n\/\/ -----------------------------------------------------------------------------\nvoid TupleTableWidget::addTupleDimensions(std::vector tupleDims)\n{\n if(!m_UserEdited)\n {\n for(int i = 0; i < tupleDims.size(); i++)\n {\n addColumn(tupleDims[i]);\n }\n }\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/\n\/\/ -----------------------------------------------------------------------------\nvoid TupleTableWidget::clearTupleDimensions()\n{\n m_UserEdited = false;\n while(tupleTable->columnCount() > 0)\n {\n tupleTable->removeColumn(0);\n if(tupleTable->columnCount() == 0)\n {\n tupleTable->removeRow(0);\n }\n }\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/\n\/\/ -----------------------------------------------------------------------------\nvoid TupleTableWidget::addColumn(int value)\n{\n int col = tupleTable->columnCount();\n\n \/\/ If we are adding the first column, add the first row too.\n if(col <= 0)\n {\n tupleTable->insertRow(0);\n }\n\n tupleTable->insertColumn(col);\n\n QTableWidgetItem* item = new QTableWidgetItem(QString::number(value));\n tupleTable->setItem(0, col, item);\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/\n\/\/ -----------------------------------------------------------------------------\nvoid TupleTableWidget::on_addTupleBtn_clicked()\n{\n addColumn(1);\n m_UserEdited = true;\n\n Q_EMIT tupleDimsChanged(getData());\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/\n\/\/ -----------------------------------------------------------------------------\nvoid TupleTableWidget::on_deleteTupleBtn_clicked()\n{\n int currentColumn = tupleTable->currentColumn();\n\n if(currentColumn >= 0)\n {\n tupleTable->removeColumn(tupleTable->currentColumn());\n }\n\n if(tupleTable->columnCount() == 0)\n {\n tupleTable->removeRow(0);\n m_UserEdited = false;\n }\n\n Q_EMIT tupleDimsChanged(getData());\n}\n\n\/\/ -----------------------------------------------------------------------------\n\/\/\n\/\/ -----------------------------------------------------------------------------\nvoid TupleTableWidget::on_tupleTable_itemChanged(QTableWidgetItem* item)\n{\n Q_EMIT tupleDimsChanged(getData());\n}\n","avg_line_length":33.311827957,"max_line_length":86,"alphanum_fraction":0.4975790833,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":2860,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["BSL-1.0"],"max_stars_count":null,"content":"\/\/ Copyright (c) 2017 Ajai V George\n\/\/\n\/\/ SPDX-License-Identifier: BSL-1.0\n\/\/ Distributed under the Boost Software License, Version 1.0. (See accompadjacent_finding\n\/\/ file LICENSE_1_0.txt or copy at http:\/\/www.boost.org\/LICENSE_1_0.txt)\n\n#include \n#include \n#include \n\n#include \n\n#include \n#include \n#include \n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n#define SIZE 64\n\nstruct pred\n{\n template \n bool operator()(const T& prev, const T& curr) const\n {\n return curr < prev;\n }\n};\n\ntemplate \nvoid initialize(hpx::partitioned_vector& xvalues)\n{\n T init_array[SIZE] = {1, 2, 3, 4, 5, 1, 2, 3, 1, 5, 2, 3, 4, 2, 3, 2, 1, 2,\n 3, 4, 5, 6, 5, 6, 1, 2, 3, 4, 2, 1, 2, 3, 3, 5, 4, 3, 2, 1, 1, 2, 3, 4,\n 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 7, 6, 5, 7, 5, 4, 2, 3, 4, 5, 2};\n for (int i = 0; i < SIZE; i++)\n {\n xvalues.set_value(i, init_array[i]);\n }\n}\n\ntemplate \nvoid test_adjacent_find(ExPolicy&& policy, hpx::partitioned_vector& xvalues)\n{\n auto result =\n hpx::parallel::adjacent_find(policy, xvalues.begin(), xvalues.end());\n HPX_TEST_EQ(std::distance(xvalues.begin(), result), 31);\n\n result = hpx::parallel::adjacent_find(\n policy, xvalues.begin(), xvalues.end(), pred());\n HPX_TEST_EQ(std::distance(xvalues.begin(), result), 4);\n}\n\ntemplate \nvoid test_adjacent_find_async(\n ExPolicy&& policy, hpx::partitioned_vector& xvalues)\n{\n auto result =\n hpx::parallel::adjacent_find(policy, xvalues.begin(), xvalues.end())\n .get();\n HPX_TEST_EQ(std::distance(xvalues.begin(), result), 31);\n\n result = hpx::parallel::adjacent_find(\n policy, xvalues.begin(), xvalues.end(), pred())\n .get();\n HPX_TEST_EQ(std::distance(xvalues.begin(), result), 4);\n}\n\ntemplate \nvoid adjacent_find_tests(std::vector& localities)\n{\n hpx::partitioned_vector xvalues(\n SIZE, T(0), hpx::container_layout(localities));\n initialize(xvalues);\n\n test_adjacent_find(hpx::parallel::execution::seq, xvalues);\n test_adjacent_find(hpx::parallel::execution::par, xvalues);\n test_adjacent_find_async(\n hpx::parallel::execution::seq(hpx::parallel::execution::task), xvalues);\n test_adjacent_find_async(\n hpx::parallel::execution::par(hpx::parallel::execution::task), xvalues);\n}\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\nint main()\n{\n std::vector localities = hpx::find_all_localities();\n adjacent_find_tests(localities);\n return hpx::util::report_errors();\n}\n","avg_line_length":31.7777777778,"max_line_length":90,"alphanum_fraction":0.6164335664,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":2274,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["CC-BY-4.0","MIT"],"max_stars_count":14.0,"content":"\/\/ This example creates a secondary thread that implements\n\/\/ the methods of CAnimateCtrl. The procedure of the thread\n\/\/ is MyClipThreadProc and the thread was created with the\n\/\/ code AfxBeginThread( MyClipThreadProc, (LPVOID) pParentWnd).\n\/\/ The example code creates and initializes an animation control,\n\/\/ then proceeds to pump messages from the queue until one the \n\/\/ private messages WM_STOPCLIP, WM_PLAYCLIP, WM_SHOWFIRSTFRAME or \n\/\/ WM_SHOWLASTFRAME is received. The appropriate action is done for\n\/\/ these messages. The thread ends when the WM_STOPCLIP is received.\n\/\/ NOTE: the thread parameter, pParam, is a pointer to a CWnd object\n\/\/ that will be the parent of the animation control. \n\n#define WM_STOPCLIP WM_USER+1\n#define WM_PLAYCLIP WM_USER+2\n#define WM_SHOWFIRSTFRAME WM_USER+3\n#define WM_SHOWLASTFRAME WM_USER+4\n\nUINT MyClipThreadProc(LPVOID pParam)\n{\n \/\/ NOTE: pParentWnd is the parent window of the animation control.\n CWnd* pParentWnd = (CWnd*) pParam;\n CAnimateCtrl cAnimCtrl;\n\n \/\/ Create the animation control.\n if (!cAnimCtrl.Create(WS_CHILD|WS_VISIBLE|ACS_CENTER, \n CRect(10,10,100,100), pParentWnd, 1))\n {\n return false;\n }\n\n \/\/ Open the AVI file.\n if (!cAnimCtrl.Open(_T(\"MyAvi.avi\")))\n {\n return false;\n }\n\n \/\/ Pump message from the queue until the stop play message is received.\n MSG msg;\n while (GetMessage(&msg, NULL, 0, 0) && (msg.message != WM_STOPCLIP))\n {\n switch (msg.message)\n {\n \/\/ Start playing from the first frame to the last, \n \/\/ continuously repeating.\n case WM_PLAYCLIP:\n if (!cAnimCtrl.Play(0, (UINT)-1, (UINT)-1))\n return false;\n break;\n \n \/\/ Show the first frame.\n case WM_SHOWFIRSTFRAME:\n if (!cAnimCtrl.Seek(0))\n return false;\n cAnimCtrl.RedrawWindow();\n break;\n\n \/\/ Show the last frame.\n case WM_SHOWLASTFRAME:\n if (!cAnimCtrl.Seek((UINT)-1))\n return false;\n cAnimCtrl.RedrawWindow();\n break;\n }\n\n TranslateMessage(&msg);\n DispatchMessage(&msg);\n }\n\n cAnimCtrl.Stop();\n cAnimCtrl.Close();\n\n return true;\n}","avg_line_length":31.1506849315,"max_line_length":74,"alphanum_fraction":0.6350043975,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":4595,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["BSD-3-Clause"],"max_stars_count":null,"content":"#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"default_config.h\"\n#include \"execute.h\"\n\n#include \n\n\/\/ =====================================================================\n\/\/ =====================================================================\n\n\nint main(int argc, char *argv[]) {\n std::cout << \"Running User Code...\" << std::endl;\n\n std::string hw_id = \"\";\n std::string rcsid = \"\";\n int subnum = -1;\n std::string time_of_submission = \"\";\n std::string docker_name = \"\";\n \/\/If test_case_to_run isn't passed in as a parameter, all testcases are run.\n int test_case_to_run = -1;\n \/\/ Check command line arguments\n if (argc >= 5) {\n hw_id = argv[1];\n rcsid = argv[2];\n subnum = atoi(argv[3]);\n time_of_submission = argv[4];\n if (argc >= 6){\n test_case_to_run = atoi(argv[5]);\n }\n if(argc >= 7){\n docker_name = argv[6];\n std::cout << \"TESTCASE: \" << test_case_to_run << \"! THE DOCKER NAME THAT WAS PASSED IN: \" << docker_name << std::endl;\n }\n }\n else if (argc != 1) {\n std::cerr << \"INCORRECT ARGUMENTS TO RUNNER\" << std::endl;\n return 1;\n } \n\n \/\/ LOAD HW CONFIGURATION JSON\n nlohmann::json config_json = LoadAndProcessConfigJSON(rcsid);\n\n \/\/ nlohmann::json grading_parameters = config_json.value(\"grading_parameters\",nlohmann::json::object());\n \/\/ int AUTO_POINTS = grading_parameters.value(\"AUTO_POINTS\",0);\n \/\/ int EXTRA_CREDIT_POINTS = grading_parameters.value(\"EXTRA_CREDIT_POINTS\",0);\n \/\/ int TA_POINTS = grading_parameters.value(\"TA_POINTS\",0);\n \/\/ int TOTAL_POINTS = grading_parameters.value(\"TOTAL_POINTS\",AUTO_POINTS+TA_POINTS);\n\n \/\/ necessary since the untrusted user does not have a home directory\n setenv(\"DYNAMORIO_CONFIGDIR\", \".\", 1);\n\n system(\"find . -type f -exec ls -sh {} +\");\n\n \/\/ Run each test case and create output files\n std::vector required_capabilities = stringOrArrayOfStrings(config_json, \"required_capabilities\");\n \n bool windowed = false;\n if (std::find(required_capabilities.begin(), required_capabilities.end(), \"windowed\") != required_capabilities.end()){\n windowed = true;\n }\n\n nlohmann::json::iterator tc = config_json.find(\"testcases\");\n assert (tc != config_json.end());\n\n if(test_case_to_run != -1){\n \/\/testcases begin counting at 1 and end at tc->size()\n assert (test_case_to_run <= tc->size());\n }else{\n std::cout << \"Running all testcases in a single run.\" << std::endl;\n }\n\n for (unsigned int i = 1; i <= tc->size(); i++) {\n\n TestCase my_testcase(config_json,i-1,docker_name);\n\n if (my_testcase.isFileCheck() || my_testcase.isCompilation()){\n continue;\n }\n\n if(test_case_to_run != -1 && test_case_to_run != i){\n continue;\n }\n\n std::cout << \"========================================================\" << std::endl;\n std::cout << \"TEST #\" << i << std::endl;\n\n std::vector commands = my_testcase.getCommands();\n\n std::vector actions = mapOrArrayOfMaps((*tc)[i-1],\"actions\");\n std::vector dispatcher_actions = mapOrArrayOfMaps((*tc)[i-1],\"dispatcher_actions\");\n\n assert (commands.size() > 0);\n\n std::cout << \"TITLE \" << my_testcase.getTitle() << std::endl;\n \n for (int x = 0; x < commands.size(); x++) {\n std::cout << \"COMMAND \" << commands[x] << std::endl;\n\n assert (commands[x] != \"MISSING COMMAND\");\n assert (commands[x] != \"\");\n \n std::string which = \"\";\n if (commands.size() > 1) {\n which = \"_\" + std::to_string(x);\n }\n \n \n std::string logfile = \"execute_logfile.txt\";\n \/\/ run the command, capturing STDOUT & STDERR\n int exit_no = execute(commands[x]\n +\n \" 1>\" + \"STDOUT\" + which + \".txt\" +\n \" 2>\" + \"STDERR\" + which + \".txt\",\n actions,\n dispatcher_actions,\n logfile,\n my_testcase.get_test_case_limits(),\n config_json.value(\"resource_limits\",nlohmann::json()),\n config_json,\n windowed); \n }\n std::cout << \"========================================================\" << std::endl;\n std::cout << \"FINISHED TEST #\" << i << std::endl;\n }\n return 0;\n}\n\n\/\/ =====================================================================\n\/\/ =====================================================================\n","avg_line_length":33.7867647059,"max_line_length":124,"alphanum_fraction":0.533405876,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":379,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":2.0,"content":"#include\nusing namespace std;\nint main(){\n\tfreopen(\"in.in\" , \"r\" , stdin);\n\tint k ;\n\tstring s;\n\tcin >> k >> s;\n\tlong long sum = 0;\n\tfor(int i = 0 ;i < s.size() ;i ++)\n\t\tsum += (s[i] - '0');\n\tsort(s.begin() , s.end() );\n\tint cnt = 0;\n\tint idx = 0;\n\twhile(sum < k && idx < s.size() ){\n\t\tsum = sum + 9 - (s[idx] - '0');\n\t\tidx ++;\n\t\tcnt ++;\n\t}\n\tcout << cnt << endl;\n}\n","avg_line_length":18.0476190476,"max_line_length":35,"alphanum_fraction":0.4749340369,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":31623,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":null,"content":"\/\/ Copyright (c) 2011-2014 The Bitcoin developers\n\/\/ Copyright (c) 2014-2015 The Dash developers\n\/\/Copyright (c) 2015-2020 The PIVX developers\n\/\/Copyright (c) 2020 The emrals developers\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"guiutil.h\"\n\n#include \"bitcoinaddressvalidator.h\"\n#include \"bitcoinunits.h\"\n#include \"qvalidatedlineedit.h\"\n#include \"walletmodel.h\"\n\n#include \"init.h\"\n#include \"main.h\"\n#include \"primitives\/transaction.h\"\n#include \"protocol.h\"\n#include \"script\/script.h\"\n#include \"script\/standard.h\"\n#include \"util.h\"\n\n#ifdef WIN32\n#ifdef _WIN32_WINNT\n#undef _WIN32_WINNT\n#endif\n#define _WIN32_WINNT 0x0501\n#ifdef _WIN32_IE\n#undef _WIN32_IE\n#endif\n#define _WIN32_IE 0x0501\n#define WIN32_LEAN_AND_MEAN 1\n#ifndef NOMINMAX\n#define NOMINMAX\n#endif\n#include \"shellapi.h\"\n#include \"shlobj.h\"\n#include \"shlwapi.h\"\n#endif\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \/\/ for Qt::mightBeRichText\n#include \n#include \n#include \n\n\n#if BOOST_FILESYSTEM_VERSION >= 3\nstatic fs::detail::utf8_codecvt_facet utf8;\n#endif\n\n#if defined(Q_OS_MAC)\nextern double NSAppKitVersionNumber;\n#if !defined(NSAppKitVersionNumber10_8)\n#define NSAppKitVersionNumber10_8 1187\n#endif\n#if !defined(NSAppKitVersionNumber10_9)\n#define NSAppKitVersionNumber10_9 1265\n#endif\n#endif\n\n#define URI_SCHEME \"emrals\"\n\n#if defined(Q_OS_MAC)\n#pragma GCC diagnostic push\n#pragma GCC diagnostic ignored \"-Wdeprecated-declarations\"\n\n#include \n#include \n\nvoid ForceActivation();\n#endif\n\nnamespace GUIUtil\n{\nQString dateTimeStr(const QDateTime& date)\n{\n return date.date().toString(Qt::SystemLocaleShortDate) + QString(\" \") + date.toString(\"hh:mm\");\n}\n\nQString dateTimeStrWithSeconds(const QDateTime& date)\n{\n return date.date().toString(Qt::SystemLocaleShortDate) + QString(\" \") + date.toString(\"hh:mm:ss\");\n}\n\nQString dateTimeStr(qint64 nTime)\n{\n return dateTimeStr(QDateTime::fromTime_t((qint32)nTime));\n}\n\nQFont bitcoinAddressFont()\n{\n QFont font(\"Monospace\");\n font.setStyleHint(QFont::Monospace);\n return font;\n}\n\n\/**\n * Parse a string into a number of base monetary units and\n * return validity.\n * @note Must return 0 if !valid.\n *\/\nCAmount parseValue(const QString& text, int displayUnit, bool* valid_out)\n{\n CAmount val = 0;\n bool valid = BitcoinUnits::parse(displayUnit, text, &val);\n if (valid) {\n if (val < 0 || val > BitcoinUnits::maxMoney())\n valid = false;\n }\n if (valid_out)\n *valid_out = valid;\n return valid ? val : 0;\n}\n\nQString formatBalance(CAmount amount, int nDisplayUnit)\n{\n return (amount == 0) ? (\"0.00 \" + BitcoinUnits::name(nDisplayUnit)) : BitcoinUnits::floorHtmlWithUnit(nDisplayUnit, amount, false, BitcoinUnits::separatorAlways, true);\n}\n\nvoid setupAddressWidget(QValidatedLineEdit* widget, QWidget* parent)\n{\n parent->setFocusProxy(widget);\n\n widget->setFont(bitcoinAddressFont());\n \/\/ We don't want translators to use own addresses in translations\n \/\/ and this is the only place, where this address is supplied.\n widget->setPlaceholderText(QObject::tr(\"Enter Emrals address (e.g. %1)\").arg(\"M6tGR83SQbie1SW72hjcWJvFfip5krte2Z\"));\n widget->setValidator(new BitcoinAddressEntryValidator(parent));\n widget->setCheckValidator(new BitcoinAddressCheckValidator(parent));\n}\n\nvoid setupAmountWidget(QLineEdit* widget, QWidget* parent)\n{\n QRegularExpression rx(\"^(\\\\d{0,8})((\\\\.|,)\\\\d{1,8})?$\");\n QValidator *validator = new QRegularExpressionValidator(rx, widget);\n widget->setValidator(validator);\n}\n\nvoid updateWidgetTextAndCursorPosition(QLineEdit* widget, const QString& str)\n{\n const int cpos = widget->cursorPosition();\n widget->setText(str);\n if (cpos > str.size()) return;\n widget->setCursorPosition(cpos);\n}\n\nbool parseBitcoinURI(const QUrl& uri, SendCoinsRecipient* out)\n{\n \/\/ return if URI is not valid or is no emrals: URI\n if (!uri.isValid() || uri.scheme() != QString(URI_SCHEME))\n return false;\n\n SendCoinsRecipient rv;\n rv.address = uri.path();\n \/\/ Trim any following forward slash which may have been added by the OS\n if (rv.address.endsWith(\"\/\")) {\n rv.address.truncate(rv.address.length() - 1);\n }\n rv.amount = 0;\n\n QUrlQuery uriQuery(uri);\n QList > items = uriQuery.queryItems();\n for (QList >::iterator i = items.begin(); i != items.end(); i++)\n {\n bool fShouldReturnFalse = false;\n if (i->first.startsWith(\"req-\")) {\n i->first.remove(0, 4);\n fShouldReturnFalse = true;\n }\n\n if (i->first == \"label\") {\n rv.label = i->second;\n fShouldReturnFalse = false;\n }\n if (i->first == \"message\") {\n rv.message = i->second;\n fShouldReturnFalse = false;\n } else if (i->first == \"amount\") {\n if (!i->second.isEmpty()) {\n if (!BitcoinUnits::parse(BitcoinUnits::EMRALS, i->second, &rv.amount)) {\n return false;\n }\n }\n fShouldReturnFalse = false;\n }\n\n if (fShouldReturnFalse)\n return false;\n }\n if (out) {\n *out = rv;\n }\n return true;\n}\n\nbool parseBitcoinURI(QString uri, SendCoinsRecipient* out)\n{\n \/\/ Convert emrals:\/\/ to emrals:\n \/\/\n \/\/ Cannot handle this later, because emrals:\/\/ will cause Qt to see the part after \/\/ as host,\n \/\/ which will lower-case it (and thus invalidate the address).\n if (uri.startsWith(URI_SCHEME \":\/\/\", Qt::CaseInsensitive)) {\n uri.replace(0, std::strlen(URI_SCHEME) + 3, URI_SCHEME \":\");\n }\n QUrl uriInstance(uri);\n return parseBitcoinURI(uriInstance, out);\n}\n\nQString formatBitcoinURI(const SendCoinsRecipient& info)\n{\n QString ret = QString(URI_SCHEME \":%1\").arg(info.address);\n int paramCount = 0;\n\n if (info.amount) {\n ret += QString(\"?amount=%1\").arg(BitcoinUnits::format(BitcoinUnits::EMRALS, info.amount, false, BitcoinUnits::separatorNever));\n paramCount++;\n }\n\n if (!info.label.isEmpty()) {\n QString lbl(QUrl::toPercentEncoding(info.label));\n ret += QString(\"%1label=%2\").arg(paramCount == 0 ? \"?\" : \"&\").arg(lbl);\n paramCount++;\n }\n\n if (!info.message.isEmpty()) {\n QString msg(QUrl::toPercentEncoding(info.message));\n ret += QString(\"%1message=%2\").arg(paramCount == 0 ? \"?\" : \"&\").arg(msg);\n paramCount++;\n }\n\n return ret;\n}\n\nbool isDust(const QString& address, const CAmount& amount)\n{\n CTxDestination dest = DecodeDestination(address.toStdString());\n CScript script = GetScriptForDestination(dest);\n CTxOut txOut(amount, script);\n return txOut.IsDust(::minRelayTxFee);\n}\n\nQString HtmlEscape(const QString& str, bool fMultiLine)\n{\n QString escaped = str.toHtmlEscaped();\n escaped = escaped.replace(\" \", \" \");\n if (fMultiLine) {\n escaped = escaped.replace(\"\\n\", \"
\\n\");\n }\n return escaped;\n}\n\nQString HtmlEscape(const std::string& str, bool fMultiLine)\n{\n return HtmlEscape(QString::fromStdString(str), fMultiLine);\n}\n\nvoid copyEntryData(QAbstractItemView* view, int column, int role)\n{\n if (!view || !view->selectionModel())\n return;\n QModelIndexList selection = view->selectionModel()->selectedRows(column);\n\n if (!selection.isEmpty()) {\n \/\/ Copy first item\n setClipboard(selection.at(0).data(role).toString());\n }\n}\n\nQString getEntryData(QAbstractItemView *view, int column, int role)\n{\n if (!view || !view->selectionModel())\n return QString();\n QModelIndexList selection = view->selectionModel()->selectedRows(column);\n\n if (!selection.isEmpty()) {\n \/\/ Return first item\n return (selection.at(0).data(role).toString());\n }\n return QString();\n}\n\nQString getSaveFileName(QWidget* parent, const QString& caption, const QString& dir, const QString& filter, QString* selectedSuffixOut)\n{\n QString selectedFilter;\n QString myDir;\n if (dir.isEmpty()) \/\/ Default to user documents location\n {\n myDir = QStandardPaths::writableLocation(QStandardPaths::DocumentsLocation);\n }\n else\n {\n myDir = dir;\n }\n \/* Directly convert path to native OS path separators *\/\n QString result = QDir::toNativeSeparators(QFileDialog::getSaveFileName(parent, caption, myDir, filter, &selectedFilter));\n\n \/* Extract first suffix from filter pattern \"Description (*.foo)\" or \"Description (*.foo *.bar ...) *\/\n QRegExp filter_re(\".* \\\\(\\\\*\\\\.(.*)[ \\\\)]\");\n QString selectedSuffix;\n if (filter_re.exactMatch(selectedFilter)) {\n selectedSuffix = filter_re.cap(1);\n }\n\n \/* Add suffix if needed *\/\n QFileInfo info(result);\n if (!result.isEmpty()) {\n if (info.suffix().isEmpty() && !selectedSuffix.isEmpty()) {\n \/* No suffix specified, add selected suffix *\/\n if (!result.endsWith(\".\"))\n result.append(\".\");\n result.append(selectedSuffix);\n }\n }\n\n \/* Return selected suffix if asked to *\/\n if (selectedSuffixOut) {\n *selectedSuffixOut = selectedSuffix;\n }\n return result;\n}\n\nQString getOpenFileName(QWidget* parent, const QString& caption, const QString& dir, const QString& filter, QString* selectedSuffixOut)\n{\n QString selectedFilter;\n QString myDir;\n if (dir.isEmpty()) \/\/ Default to user documents location\n {\n myDir = QStandardPaths::writableLocation(QStandardPaths::DocumentsLocation);\n }\n else\n {\n myDir = dir;\n }\n \/* Directly convert path to native OS path separators *\/\n QString result = QDir::toNativeSeparators(QFileDialog::getOpenFileName(parent, caption, myDir, filter, &selectedFilter));\n\n if (selectedSuffixOut) {\n \/* Extract first suffix from filter pattern \"Description (*.foo)\" or \"Description (*.foo *.bar ...) *\/\n QRegExp filter_re(\".* \\\\(\\\\*\\\\.(.*)[ \\\\)]\");\n QString selectedSuffix;\n if (filter_re.exactMatch(selectedFilter)) {\n selectedSuffix = filter_re.cap(1);\n }\n *selectedSuffixOut = selectedSuffix;\n }\n return result;\n}\n\nQt::ConnectionType blockingGUIThreadConnection()\n{\n if (QThread::currentThread() != qApp->thread()) {\n return Qt::BlockingQueuedConnection;\n } else {\n return Qt::DirectConnection;\n }\n}\n\nbool checkPoint(const QPoint& p, const QWidget* w)\n{\n QWidget* atW = QApplication::widgetAt(w->mapToGlobal(p));\n if (!atW) return false;\n return atW->topLevelWidget() == w;\n}\n\nbool isObscured(QWidget* w)\n{\n return !(checkPoint(QPoint(0, 0), w) && checkPoint(QPoint(w->width() - 1, 0), w) && checkPoint(QPoint(0, w->height() - 1), w) && checkPoint(QPoint(w->width() - 1, w->height() - 1), w) && checkPoint(QPoint(w->width() \/ 2, w->height() \/ 2), w));\n}\n\nvoid bringToFront(QWidget* w)\n{\n#ifdef Q_OS_MAC\n ForceActivation();\n#endif\n\n if (w) {\n \/\/ activateWindow() (sometimes) helps with keyboard focus on Windows\n if (w->isMinimized()) {\n w->showNormal();\n } else {\n w->show();\n }\n w->activateWindow();\n w->raise();\n }\n}\n\n\/* Open file with the associated application *\/\nbool openFile(fs::path path, bool isTextFile)\n{\n bool ret = false;\n if (fs::exists(path)) {\n ret = QDesktopServices::openUrl(QUrl::fromLocalFile(boostPathToQString(path)));\n#ifdef Q_OS_MAC\n \/\/ Workaround for macOS-specific behavior; see btc@15409.\n if (isTextFile && !ret) {\n ret = QProcess::startDetached(\"\/usr\/bin\/open\", QStringList{\"-t\", boostPathToQString(path)});\n }\n#endif\n }\n return ret;\n}\n\nbool openDebugLogfile()\n{\n return openFile(GetDataDir() \/ \"debug.log\", true);\n}\n\nbool openConfigfile()\n{\n return openFile(GetConfigFile(), true);\n}\n\nbool openMNConfigfile()\n{\n return openFile(GetMasternodeConfigFile(), true);\n}\n\nbool showBackups()\n{\n return openFile(GetDataDir() \/ \"backups\", false);\n}\n\nvoid SubstituteFonts(const QString& language)\n{\n#if defined(Q_OS_MAC)\n\/\/ Background:\n\/\/ OSX's default font changed in 10.9 and QT is unable to find it with its\n\/\/ usual fallback methods when building against the 10.7 sdk or lower.\n\/\/ The 10.8 SDK added a function to let it find the correct fallback font.\n\/\/ If this fallback is not properly loaded, some characters may fail to\n\/\/ render correctly.\n\/\/\n\/\/ The same thing happened with 10.10. .Helvetica Neue DeskInterface is now default.\n\/\/\n\/\/ Solution: If building with the 10.7 SDK or lower and the user's platform\n\/\/ is 10.9 or higher at runtime, substitute the correct font. This needs to\n\/\/ happen before the QApplication is created.\n#if defined(MAC_OS_X_VERSION_MAX_ALLOWED) && MAC_OS_X_VERSION_MAX_ALLOWED < MAC_OS_X_VERSION_10_8\n if (floor(NSAppKitVersionNumber) > NSAppKitVersionNumber10_8) {\n if (floor(NSAppKitVersionNumber) <= NSAppKitVersionNumber10_9)\n \/* On a 10.9 - 10.9.x system *\/\n QFont::insertSubstitution(\".Lucida Grande UI\", \"Lucida Grande\");\n else {\n \/* 10.10 or later system *\/\n if (language == \"zh_CN\" || language == \"zh_TW\" || language == \"zh_HK\") \/\/ traditional or simplified Chinese\n QFont::insertSubstitution(\".Helvetica Neue DeskInterface\", \"Heiti SC\");\n else if (language == \"ja\") \/\/ Japanesee\n QFont::insertSubstitution(\".Helvetica Neue DeskInterface\", \"Songti SC\");\n else\n QFont::insertSubstitution(\".Helvetica Neue DeskInterface\", \"Lucida Grande\");\n }\n }\n#endif\n#endif\n}\n\nToolTipToRichTextFilter::ToolTipToRichTextFilter(int size_threshold, QObject* parent) : QObject(parent),\n size_threshold(size_threshold)\n{\n}\n\nbool ToolTipToRichTextFilter::eventFilter(QObject* obj, QEvent* evt)\n{\n if (evt->type() == QEvent::ToolTipChange) {\n QWidget* widget = static_cast(obj);\n QString tooltip = widget->toolTip();\n if (tooltip.size() > size_threshold && !tooltip.startsWith(\" if it's not rich text\n if (!Qt::mightBeRichText(tooltip))\n tooltip = HtmlEscape(tooltip, true);\n \/\/ Envelop with <\/qt> to make sure Qt detects every tooltip as rich text\n \/\/ and style='white-space:pre' to preserve line composition\n tooltip = \"\" + tooltip + \"<\/qt>\";\n widget->setToolTip(tooltip);\n return true;\n }\n }\n return QObject::eventFilter(obj, evt);\n}\n\nvoid TableViewLastColumnResizingFixer::connectViewHeadersSignals()\n{\n connect(tableView->horizontalHeader(), &QHeaderView::sectionResized, this, &TableViewLastColumnResizingFixer::on_sectionResized);\n connect(tableView->horizontalHeader(), &QHeaderView::geometriesChanged, this, &TableViewLastColumnResizingFixer::on_geometriesChanged);\n}\n\n\/\/ We need to disconnect these while handling the resize events, otherwise we can enter infinite loops.\nvoid TableViewLastColumnResizingFixer::disconnectViewHeadersSignals()\n{\n disconnect(tableView->horizontalHeader(), &QHeaderView::sectionResized, this, &TableViewLastColumnResizingFixer::on_sectionResized);\n disconnect(tableView->horizontalHeader(), &QHeaderView::geometriesChanged, this, &TableViewLastColumnResizingFixer::on_geometriesChanged);\n}\n\n\/\/ Setup the resize mode, handles compatibility for Qt5 and below as the method signatures changed.\n\/\/ Refactored here for readability.\nvoid TableViewLastColumnResizingFixer::setViewHeaderResizeMode(int logicalIndex, QHeaderView::ResizeMode resizeMode)\n{\n tableView->horizontalHeader()->setSectionResizeMode(logicalIndex, resizeMode);\n}\n\nvoid TableViewLastColumnResizingFixer::resizeColumn(int nColumnIndex, int width)\n{\n tableView->setColumnWidth(nColumnIndex, width);\n tableView->horizontalHeader()->resizeSection(nColumnIndex, width);\n}\n\nint TableViewLastColumnResizingFixer::getColumnsWidth()\n{\n int nColumnsWidthSum = 0;\n for (int i = 0; i < columnCount; i++) {\n nColumnsWidthSum += tableView->horizontalHeader()->sectionSize(i);\n }\n return nColumnsWidthSum;\n}\n\nint TableViewLastColumnResizingFixer::getAvailableWidthForColumn(int column)\n{\n int nResult = lastColumnMinimumWidth;\n int nTableWidth = tableView->horizontalHeader()->width();\n\n if (nTableWidth > 0) {\n int nOtherColsWidth = getColumnsWidth() - tableView->horizontalHeader()->sectionSize(column);\n nResult = std::max(nResult, nTableWidth - nOtherColsWidth);\n }\n\n return nResult;\n}\n\n\/\/ Make sure we don't make the columns wider than the tables viewport width.\nvoid TableViewLastColumnResizingFixer::adjustTableColumnsWidth()\n{\n disconnectViewHeadersSignals();\n resizeColumn(lastColumnIndex, getAvailableWidthForColumn(lastColumnIndex));\n connectViewHeadersSignals();\n\n int nTableWidth = tableView->horizontalHeader()->width();\n int nColsWidth = getColumnsWidth();\n if (nColsWidth > nTableWidth) {\n resizeColumn(secondToLastColumnIndex, getAvailableWidthForColumn(secondToLastColumnIndex));\n }\n}\n\n\/\/ Make column use all the space available, useful during window resizing.\nvoid TableViewLastColumnResizingFixer::stretchColumnWidth(int column)\n{\n disconnectViewHeadersSignals();\n resizeColumn(column, getAvailableWidthForColumn(column));\n connectViewHeadersSignals();\n}\n\n\/\/ When a section is resized this is a slot-proxy for ajustAmountColumnWidth().\nvoid TableViewLastColumnResizingFixer::on_sectionResized(int logicalIndex, int oldSize, int newSize)\n{\n adjustTableColumnsWidth();\n int remainingWidth = getAvailableWidthForColumn(logicalIndex);\n if (newSize > remainingWidth) {\n resizeColumn(logicalIndex, remainingWidth);\n }\n}\n\n\/\/ When the tabless geometry is ready, we manually perform the stretch of the \"Message\" column,\n\/\/ as the \"Stretch\" resize mode does not allow for interactive resizing.\nvoid TableViewLastColumnResizingFixer::on_geometriesChanged()\n{\n if ((getColumnsWidth() - this->tableView->horizontalHeader()->width()) != 0) {\n disconnectViewHeadersSignals();\n resizeColumn(secondToLastColumnIndex, getAvailableWidthForColumn(secondToLastColumnIndex));\n connectViewHeadersSignals();\n }\n}\n\n\/**\n * Initializes all internal variables and prepares the\n * the resize modes of the last 2 columns of the table and\n *\/\nTableViewLastColumnResizingFixer::TableViewLastColumnResizingFixer(QTableView* table, int lastColMinimumWidth, int allColsMinimumWidth) : tableView(table),\n lastColumnMinimumWidth(lastColMinimumWidth),\n allColumnsMinimumWidth(allColsMinimumWidth)\n{\n columnCount = tableView->horizontalHeader()->count();\n lastColumnIndex = columnCount - 1;\n secondToLastColumnIndex = columnCount - 2;\n tableView->horizontalHeader()->setMinimumSectionSize(allColumnsMinimumWidth);\n setViewHeaderResizeMode(secondToLastColumnIndex, QHeaderView::Interactive);\n setViewHeaderResizeMode(lastColumnIndex, QHeaderView::Interactive);\n}\n\n\/**\n * Class constructor.\n * @param[in] seconds Number of seconds to convert to a DHMS string\n *\/\nDHMSTableWidgetItem::DHMSTableWidgetItem(const int64_t seconds) : QTableWidgetItem(),\n value(seconds)\n{\n this->setText(QString::fromStdString(DurationToDHMS(seconds)));\n}\n\n\/**\n * Comparator overload to ensure that the \"DHMS\"-type durations as used in\n * the \"active-since\" list in the masternode tab are sorted by the elapsed\n * duration (versus the string value being sorted).\n * @param[in] item Right hand side of the less than operator\n *\/\nbool DHMSTableWidgetItem::operator<(QTableWidgetItem const& item) const\n{\n DHMSTableWidgetItem const* rhs =\n dynamic_cast(&item);\n\n if (!rhs)\n return QTableWidgetItem::operator<(item);\n\n return value < rhs->value;\n}\n\n#ifdef WIN32\nfs::path static StartupShortcutPath()\n{\n return GetSpecialFolderPath(CSIDL_STARTUP) \/ \"emrals.lnk\";\n}\n\nbool GetStartOnSystemStartup()\n{\n \/\/ check for emrals.lnk\n return fs::exists(StartupShortcutPath());\n}\n\nbool SetStartOnSystemStartup(bool fAutoStart)\n{\n \/\/ If the shortcut exists already, remove it for updating\n fs::remove(StartupShortcutPath());\n\n if (fAutoStart) {\n CoInitialize(NULL);\n\n \/\/ Get a pointer to the IShellLink interface.\n IShellLink* psl = NULL;\n HRESULT hres = CoCreateInstance(CLSID_ShellLink, NULL,\n CLSCTX_INPROC_SERVER, IID_IShellLink,\n reinterpret_cast(&psl));\n\n if (SUCCEEDED(hres)) {\n \/\/ Get the current executable path\n TCHAR pszExePath[MAX_PATH];\n GetModuleFileName(NULL, pszExePath, sizeof(pszExePath));\n\n TCHAR pszArgs[5] = TEXT(\"-min\");\n\n \/\/ Set the path to the shortcut target\n psl->SetPath(pszExePath);\n PathRemoveFileSpec(pszExePath);\n psl->SetWorkingDirectory(pszExePath);\n psl->SetShowCmd(SW_SHOWMINNOACTIVE);\n psl->SetArguments(pszArgs);\n\n \/\/ Query IShellLink for the IPersistFile interface for\n \/\/ saving the shortcut in persistent storage.\n IPersistFile* ppf = NULL;\n hres = psl->QueryInterface(IID_IPersistFile,\n reinterpret_cast(&ppf));\n if (SUCCEEDED(hres)) {\n WCHAR pwsz[MAX_PATH];\n \/\/ Ensure that the string is ANSI.\n MultiByteToWideChar(CP_ACP, 0, StartupShortcutPath().string().c_str(), -1, pwsz, MAX_PATH);\n \/\/ Save the link by calling IPersistFile::Save.\n hres = ppf->Save(pwsz, TRUE);\n ppf->Release();\n psl->Release();\n CoUninitialize();\n return true;\n }\n psl->Release();\n }\n CoUninitialize();\n return false;\n }\n return true;\n}\n\n#elif defined(Q_OS_LINUX)\n\n\/\/ Follow the Desktop Application Autostart Spec:\n\/\/ http:\/\/standards.freedesktop.org\/autostart-spec\/autostart-spec-latest.html\n\nfs::path static GetAutostartDir()\n{\n char* pszConfigHome = getenv(\"XDG_CONFIG_HOME\");\n if (pszConfigHome) return fs::path(pszConfigHome) \/ \"autostart\";\n char* pszHome = getenv(\"HOME\");\n if (pszHome) return fs::path(pszHome) \/ \".config\" \/ \"autostart\";\n return fs::path();\n}\n\nfs::path static GetAutostartFilePath()\n{\n return GetAutostartDir() \/ \"emrals.desktop\";\n}\n\nbool GetStartOnSystemStartup()\n{\n fs::ifstream optionFile(GetAutostartFilePath());\n if (!optionFile.good())\n return false;\n \/\/ Scan through file for \"Hidden=true\":\n std::string line;\n while (!optionFile.eof()) {\n getline(optionFile, line);\n if (line.find(\"Hidden\") != std::string::npos &&\n line.find(\"true\") != std::string::npos)\n return false;\n }\n optionFile.close();\n\n return true;\n}\n\nbool SetStartOnSystemStartup(bool fAutoStart)\n{\n if (!fAutoStart)\n fs::remove(GetAutostartFilePath());\n else {\n char pszExePath[MAX_PATH + 1];\n memset(pszExePath, 0, sizeof(pszExePath));\n if (readlink(\"\/proc\/self\/exe\", pszExePath, sizeof(pszExePath) - 1) == -1)\n return false;\n\n fs::create_directories(GetAutostartDir());\n\n fs::ofstream optionFile(GetAutostartFilePath(), std::ios_base::out | std::ios_base::trunc);\n if (!optionFile.good())\n return false;\n \/\/ Write a emrals.desktop file to the autostart directory:\n optionFile << \"[Desktop Entry]\\n\";\n optionFile << \"Type=Application\\n\";\n optionFile << \"Name=Emrals\\n\";\n optionFile << \"Exec=\" << pszExePath << \" -min\\n\";\n optionFile << \"Terminal=false\\n\";\n optionFile << \"Hidden=false\\n\";\n optionFile.close();\n }\n return true;\n}\n\n\n#elif defined(Q_OS_MAC)\n\/\/ based on: https:\/\/github.com\/Mozketo\/LaunchAtLoginController\/blob\/master\/LaunchAtLoginController.m\n\nLSSharedFileListItemRef findStartupItemInList(LSSharedFileListRef list, CFURLRef findUrl);\nLSSharedFileListItemRef findStartupItemInList(LSSharedFileListRef list, CFURLRef findUrl)\n{\n \/\/ loop through the list of startup items and try to find the emrals app\n CFArrayRef listSnapshot = LSSharedFileListCopySnapshot(list, NULL);\n for (int i = 0; i < CFArrayGetCount(listSnapshot); i++) {\n LSSharedFileListItemRef item = (LSSharedFileListItemRef)CFArrayGetValueAtIndex(listSnapshot, i);\n UInt32 resolutionFlags = kLSSharedFileListNoUserInteraction | kLSSharedFileListDoNotMountVolumes;\n CFURLRef currentItemURL = NULL;\n\n#if defined(MAC_OS_X_VERSION_MAX_ALLOWED) && MAC_OS_X_VERSION_MAX_ALLOWED >= 10100\n if (&LSSharedFileListItemCopyResolvedURL)\n currentItemURL = LSSharedFileListItemCopyResolvedURL(item, resolutionFlags, NULL);\n#if defined(MAC_OS_X_VERSION_MIN_REQUIRED) && MAC_OS_X_VERSION_MIN_REQUIRED < 10100\n else\n LSSharedFileListItemResolve(item, resolutionFlags, ¤tItemURL, NULL);\n#endif\n#else\n LSSharedFileListItemResolve(item, resolutionFlags, ¤tItemURL, NULL);\n#endif\n\n if (currentItemURL && CFEqual(currentItemURL, findUrl)) {\n \/\/ found\n CFRelease(currentItemURL);\n return item;\n }\n if (currentItemURL) {\n CFRelease(currentItemURL);\n }\n }\n return NULL;\n}\n\nbool GetStartOnSystemStartup()\n{\n CFURLRef bitcoinAppUrl = CFBundleCopyBundleURL(CFBundleGetMainBundle());\n LSSharedFileListRef loginItems = LSSharedFileListCreate(NULL, kLSSharedFileListSessionLoginItems, NULL);\n LSSharedFileListItemRef foundItem = findStartupItemInList(loginItems, bitcoinAppUrl);\n return !!foundItem; \/\/ return boolified object\n}\n\nbool SetStartOnSystemStartup(bool fAutoStart)\n{\n CFURLRef bitcoinAppUrl = CFBundleCopyBundleURL(CFBundleGetMainBundle());\n LSSharedFileListRef loginItems = LSSharedFileListCreate(NULL, kLSSharedFileListSessionLoginItems, NULL);\n LSSharedFileListItemRef foundItem = findStartupItemInList(loginItems, bitcoinAppUrl);\n\n if (fAutoStart && !foundItem) {\n \/\/ add emrals app to startup item list\n LSSharedFileListInsertItemURL(loginItems, kLSSharedFileListItemBeforeFirst, NULL, NULL, bitcoinAppUrl, NULL, NULL);\n } else if (!fAutoStart && foundItem) {\n \/\/ remove item\n LSSharedFileListItemRemove(loginItems, foundItem);\n }\n return true;\n}\n#pragma GCC diagnostic pop\n#else\n\nbool GetStartOnSystemStartup()\n{\n return false;\n}\nbool SetStartOnSystemStartup(bool fAutoStart) { return false; }\n\n#endif\n\nvoid saveWindowGeometry(const QString& strSetting, QWidget* parent)\n{\n QSettings settings;\n settings.setValue(strSetting + \"Pos\", parent->pos());\n settings.setValue(strSetting + \"Size\", parent->size());\n}\n\nvoid restoreWindowGeometry(const QString& strSetting, const QSize& defaultSize, QWidget* parent)\n{\n QSettings settings;\n QPoint pos = settings.value(strSetting + \"Pos\").toPoint();\n QSize size = settings.value(strSetting + \"Size\", defaultSize).toSize();\n\n if (!pos.x() && !pos.y()) {\n QRect screen = QApplication::desktop()->screenGeometry();\n pos.setX((screen.width() - size.width()) \/ 2);\n pos.setY((screen.height() - size.height()) \/ 2);\n }\n\n parent->resize(size);\n parent->move(pos);\n}\n\n\/\/ Check whether a theme is not build-in\nbool isExternal(QString theme)\n{\n if (theme.isEmpty())\n return false;\n\n return (theme.operator!=(\"default\") && theme.operator!=(\"default-dark\"));\n}\n\n\/\/ Open CSS when configured\nQString loadStyleSheet()\n{\n QString styleSheet;\n QSettings settings;\n QString cssName;\n QString theme = settings.value(\"theme\", \"\").toString();\n\n if (isExternal(theme)) {\n \/\/ External CSS\n settings.setValue(\"fCSSexternal\", true);\n fs::path pathAddr = GetDataDir() \/ \"themes\/\";\n cssName = pathAddr.string().c_str() + theme + \"\/css\/theme.css\";\n } else {\n \/\/ Build-in CSS\n settings.setValue(\"fCSSexternal\", false);\n if (!theme.isEmpty()) {\n cssName = QString(\":\/css\/\") + theme;\n } else {\n cssName = QString(\":\/css\/default\");\n settings.setValue(\"theme\", \"default\");\n }\n }\n\n QFile qFile(cssName);\n if (qFile.open(QFile::ReadOnly)) {\n styleSheet = QLatin1String(qFile.readAll());\n }\n\n return styleSheet;\n}\n\nvoid setClipboard(const QString& str)\n{\n QApplication::clipboard()->setText(str, QClipboard::Clipboard);\n QApplication::clipboard()->setText(str, QClipboard::Selection);\n}\n\n#if BOOST_FILESYSTEM_VERSION >= 3\nfs::path qstringToBoostPath(const QString& path)\n{\n return fs::path(path.toStdString(), utf8);\n}\n\nQString boostPathToQString(const fs::path& path)\n{\n return QString::fromStdString(path.string(utf8));\n}\n#else\n#warning Conversion between boost path and QString can use invalid character encoding with boost_filesystem v2 and older\nfs::path qstringToBoostPath(const QString& path)\n{\n return fs::path(path.toStdString());\n}\n\nQString boostPathToQString(const fs::path& path)\n{\n return QString::fromStdString(path.string());\n}\n#endif\n\nQString formatDurationStr(int secs)\n{\n QStringList strList;\n int days = secs \/ 86400;\n int hours = (secs % 86400) \/ 3600;\n int mins = (secs % 3600) \/ 60;\n int seconds = secs % 60;\n\n if (days)\n strList.append(QString(QObject::tr(\"%1 d\")).arg(days));\n if (hours)\n strList.append(QString(QObject::tr(\"%1 h\")).arg(hours));\n if (mins)\n strList.append(QString(QObject::tr(\"%1 m\")).arg(mins));\n if (seconds || (!days && !hours && !mins))\n strList.append(QString(QObject::tr(\"%1 s\")).arg(seconds));\n\n return strList.join(\" \");\n}\n\nQString formatServicesStr(quint64 mask)\n{\n QStringList strList;\n\n \/\/ Just scan the last 8 bits for now.\n for (int i = 0; i < 8; i++) {\n uint64_t check = 1 << i;\n if (mask & check) {\n switch (check) {\n case NODE_NETWORK:\n strList.append(QObject::tr(\"NETWORK\"));\n break;\n case NODE_BLOOM:\n case NODE_BLOOM_WITHOUT_MN:\n strList.append(QObject::tr(\"BLOOM\"));\n break;\n default:\n strList.append(QString(\"%1[%2]\").arg(QObject::tr(\"UNKNOWN\")).arg(check));\n }\n }\n }\n\n if (strList.size())\n return strList.join(\" & \");\n else\n return QObject::tr(\"None\");\n}\n\nQString formatPingTime(double dPingTime)\n{\n return dPingTime == 0 ? QObject::tr(\"N\/A\") : QString(QObject::tr(\"%1 ms\")).arg(QString::number((int)(dPingTime * 1000), 10));\n}\n\nQString formatTimeOffset(int64_t nTimeOffset)\n{\n return QString(QObject::tr(\"%1 s\")).arg(QString::number((int)nTimeOffset, 10));\n}\n\n} \/\/ namespace GUIUtil\n","avg_line_length":32.2683673469,"max_line_length":247,"alphanum_fraction":0.6630933182,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":15904,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":7018.0,"content":"\/* Tencent is pleased to support the open source community by making Hippy available.\n * Copyright (C) 2018 THL A29 Limited, a Tencent company. All rights reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \n#include \n\nTEST(HippyTest, flex_direction_column_no_height) {\n const HPNodeRef root = HPNodeNew();\n HPNodeStyleSetWidth(root, 100);\n\n const HPNodeRef root_child0 = HPNodeNew();\n HPNodeStyleSetHeight(root_child0, 10);\n HPNodeInsertChild(root, root_child0, 0);\n\n const HPNodeRef root_child1 = HPNodeNew();\n HPNodeStyleSetHeight(root_child1, 10);\n HPNodeInsertChild(root, root_child1, 1);\n\n const HPNodeRef root_child2 = HPNodeNew();\n HPNodeStyleSetHeight(root_child2, 10);\n HPNodeInsertChild(root, root_child2, 2);\n HPNodeDoLayout(root, VALUE_UNDEFINED, VALUE_UNDEFINED);\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root));\n ASSERT_FLOAT_EQ(30, HPNodeLayoutGetHeight(root));\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root_child0));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root_child0));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root_child0));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetHeight(root_child0));\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root_child1));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetTop(root_child1));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root_child1));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetHeight(root_child1));\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root_child2));\n ASSERT_FLOAT_EQ(20, HPNodeLayoutGetTop(root_child2));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root_child2));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetHeight(root_child2));\n\n HPNodeDoLayout(root, VALUE_UNDEFINED, VALUE_UNDEFINED, DirectionRTL);\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root));\n ASSERT_FLOAT_EQ(30, HPNodeLayoutGetHeight(root));\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root_child0));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root_child0));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root_child0));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetHeight(root_child0));\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root_child1));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetTop(root_child1));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root_child1));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetHeight(root_child1));\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root_child2));\n ASSERT_FLOAT_EQ(20, HPNodeLayoutGetTop(root_child2));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root_child2));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetHeight(root_child2));\n\n HPNodeFreeRecursive(root);\n}\n\nTEST(HippyTest, flex_direction_row_no_width) {\n const HPNodeRef root = HPNodeNew();\n HPNodeStyleSetFlexDirection(root, FLexDirectionRow);\n HPNodeStyleSetHeight(root, 100);\n\n const HPNodeRef root_child0 = HPNodeNew();\n HPNodeStyleSetWidth(root_child0, 10);\n HPNodeInsertChild(root, root_child0, 0);\n\n const HPNodeRef root_child1 = HPNodeNew();\n HPNodeStyleSetWidth(root_child1, 10);\n HPNodeInsertChild(root, root_child1, 1);\n\n const HPNodeRef root_child2 = HPNodeNew();\n HPNodeStyleSetWidth(root_child2, 10);\n HPNodeInsertChild(root, root_child2, 2);\n HPNodeDoLayout(root, VALUE_UNDEFINED, VALUE_UNDEFINED);\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root));\n ASSERT_FLOAT_EQ(30, HPNodeLayoutGetWidth(root));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root));\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root_child0));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root_child0));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetWidth(root_child0));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root_child0));\n\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetLeft(root_child1));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root_child1));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetWidth(root_child1));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root_child1));\n\n ASSERT_FLOAT_EQ(20, HPNodeLayoutGetLeft(root_child2));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root_child2));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetWidth(root_child2));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root_child2));\n\n HPNodeDoLayout(root, VALUE_UNDEFINED, VALUE_UNDEFINED, DirectionRTL);\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root));\n ASSERT_FLOAT_EQ(30, HPNodeLayoutGetWidth(root));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root));\n\n ASSERT_FLOAT_EQ(20, HPNodeLayoutGetLeft(root_child0));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root_child0));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetWidth(root_child0));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root_child0));\n\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetLeft(root_child1));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root_child1));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetWidth(root_child1));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root_child1));\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root_child2));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root_child2));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetWidth(root_child2));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root_child2));\n\n HPNodeFreeRecursive(root);\n}\n\nTEST(HippyTest, flex_direction_column) {\n const HPNodeRef root = HPNodeNew();\n HPNodeStyleSetWidth(root, 100);\n HPNodeStyleSetHeight(root, 100);\n\n const HPNodeRef root_child0 = HPNodeNew();\n HPNodeStyleSetHeight(root_child0, 10);\n HPNodeInsertChild(root, root_child0, 0);\n\n const HPNodeRef root_child1 = HPNodeNew();\n HPNodeStyleSetHeight(root_child1, 10);\n HPNodeInsertChild(root, root_child1, 1);\n\n const HPNodeRef root_child2 = HPNodeNew();\n HPNodeStyleSetHeight(root_child2, 10);\n HPNodeInsertChild(root, root_child2, 2);\n HPNodeDoLayout(root, VALUE_UNDEFINED, VALUE_UNDEFINED);\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root));\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root_child0));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root_child0));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root_child0));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetHeight(root_child0));\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root_child1));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetTop(root_child1));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root_child1));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetHeight(root_child1));\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root_child2));\n ASSERT_FLOAT_EQ(20, HPNodeLayoutGetTop(root_child2));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root_child2));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetHeight(root_child2));\n\n HPNodeDoLayout(root, VALUE_UNDEFINED, VALUE_UNDEFINED, DirectionRTL);\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root));\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root_child0));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root_child0));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root_child0));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetHeight(root_child0));\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root_child1));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetTop(root_child1));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root_child1));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetHeight(root_child1));\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root_child2));\n ASSERT_FLOAT_EQ(20, HPNodeLayoutGetTop(root_child2));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root_child2));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetHeight(root_child2));\n\n HPNodeFreeRecursive(root);\n}\n\nTEST(HippyTest, flex_direction_row) {\n const HPNodeRef root = HPNodeNew();\n HPNodeStyleSetFlexDirection(root, FLexDirectionRow);\n HPNodeStyleSetWidth(root, 100);\n HPNodeStyleSetHeight(root, 100);\n\n const HPNodeRef root_child0 = HPNodeNew();\n HPNodeStyleSetWidth(root_child0, 10);\n HPNodeInsertChild(root, root_child0, 0);\n\n const HPNodeRef root_child1 = HPNodeNew();\n HPNodeStyleSetWidth(root_child1, 10);\n HPNodeInsertChild(root, root_child1, 1);\n\n const HPNodeRef root_child2 = HPNodeNew();\n HPNodeStyleSetWidth(root_child2, 10);\n HPNodeInsertChild(root, root_child2, 2);\n HPNodeDoLayout(root, VALUE_UNDEFINED, VALUE_UNDEFINED);\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root));\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root_child0));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root_child0));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetWidth(root_child0));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root_child0));\n\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetLeft(root_child1));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root_child1));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetWidth(root_child1));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root_child1));\n\n ASSERT_FLOAT_EQ(20, HPNodeLayoutGetLeft(root_child2));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root_child2));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetWidth(root_child2));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root_child2));\n\n HPNodeDoLayout(root, VALUE_UNDEFINED, VALUE_UNDEFINED, DirectionRTL);\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root));\n\n ASSERT_FLOAT_EQ(90, HPNodeLayoutGetLeft(root_child0));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root_child0));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetWidth(root_child0));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root_child0));\n\n ASSERT_FLOAT_EQ(80, HPNodeLayoutGetLeft(root_child1));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root_child1));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetWidth(root_child1));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root_child1));\n\n ASSERT_FLOAT_EQ(70, HPNodeLayoutGetLeft(root_child2));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root_child2));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetWidth(root_child2));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root_child2));\n\n HPNodeFreeRecursive(root);\n}\n\nTEST(HippyTest, flex_direction_column_reverse) {\n const HPNodeRef root = HPNodeNew();\n HPNodeStyleSetFlexDirection(root, FLexDirectionColumnReverse);\n HPNodeStyleSetWidth(root, 100);\n HPNodeStyleSetHeight(root, 100);\n\n const HPNodeRef root_child0 = HPNodeNew();\n HPNodeStyleSetHeight(root_child0, 10);\n HPNodeInsertChild(root, root_child0, 0);\n\n const HPNodeRef root_child1 = HPNodeNew();\n HPNodeStyleSetHeight(root_child1, 10);\n HPNodeInsertChild(root, root_child1, 1);\n\n const HPNodeRef root_child2 = HPNodeNew();\n HPNodeStyleSetHeight(root_child2, 10);\n HPNodeInsertChild(root, root_child2, 2);\n HPNodeDoLayout(root, VALUE_UNDEFINED, VALUE_UNDEFINED);\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root));\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root_child0));\n ASSERT_FLOAT_EQ(90, HPNodeLayoutGetTop(root_child0));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root_child0));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetHeight(root_child0));\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root_child1));\n ASSERT_FLOAT_EQ(80, HPNodeLayoutGetTop(root_child1));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root_child1));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetHeight(root_child1));\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root_child2));\n ASSERT_FLOAT_EQ(70, HPNodeLayoutGetTop(root_child2));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root_child2));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetHeight(root_child2));\n\n HPNodeDoLayout(root, VALUE_UNDEFINED, VALUE_UNDEFINED, DirectionRTL);\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root));\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root_child0));\n ASSERT_FLOAT_EQ(90, HPNodeLayoutGetTop(root_child0));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root_child0));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetHeight(root_child0));\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root_child1));\n ASSERT_FLOAT_EQ(80, HPNodeLayoutGetTop(root_child1));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root_child1));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetHeight(root_child1));\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root_child2));\n ASSERT_FLOAT_EQ(70, HPNodeLayoutGetTop(root_child2));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root_child2));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetHeight(root_child2));\n\n HPNodeFreeRecursive(root);\n}\n\nTEST(HippyTest, flex_direction_row_reverse) {\n const HPNodeRef root = HPNodeNew();\n HPNodeStyleSetFlexDirection(root, FLexDirectionRowReverse);\n HPNodeStyleSetWidth(root, 100);\n HPNodeStyleSetHeight(root, 100);\n\n const HPNodeRef root_child0 = HPNodeNew();\n HPNodeStyleSetWidth(root_child0, 10);\n HPNodeInsertChild(root, root_child0, 0);\n\n const HPNodeRef root_child1 = HPNodeNew();\n HPNodeStyleSetWidth(root_child1, 10);\n HPNodeInsertChild(root, root_child1, 1);\n\n const HPNodeRef root_child2 = HPNodeNew();\n HPNodeStyleSetWidth(root_child2, 10);\n HPNodeInsertChild(root, root_child2, 2);\n HPNodeDoLayout(root, VALUE_UNDEFINED, VALUE_UNDEFINED);\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root));\n\n ASSERT_FLOAT_EQ(90, HPNodeLayoutGetLeft(root_child0));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root_child0));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetWidth(root_child0));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root_child0));\n\n ASSERT_FLOAT_EQ(80, HPNodeLayoutGetLeft(root_child1));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root_child1));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetWidth(root_child1));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root_child1));\n\n ASSERT_FLOAT_EQ(70, HPNodeLayoutGetLeft(root_child2));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root_child2));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetWidth(root_child2));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root_child2));\n\n HPNodeDoLayout(root, VALUE_UNDEFINED, VALUE_UNDEFINED, DirectionRTL);\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetWidth(root));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root));\n\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetLeft(root_child0));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root_child0));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetWidth(root_child0));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root_child0));\n\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetLeft(root_child1));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root_child1));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetWidth(root_child1));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root_child1));\n\n ASSERT_FLOAT_EQ(20, HPNodeLayoutGetLeft(root_child2));\n ASSERT_FLOAT_EQ(0, HPNodeLayoutGetTop(root_child2));\n ASSERT_FLOAT_EQ(10, HPNodeLayoutGetWidth(root_child2));\n ASSERT_FLOAT_EQ(100, HPNodeLayoutGetHeight(root_child2));\n\n HPNodeFreeRecursive(root);\n}\n","avg_line_length":39.8596491228,"max_line_length":85,"alphanum_fraction":0.8036343058,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":11891,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":2122.0,"content":"\/\/ Copyright (c) 2018 Microsoft Corporation\n\/\/ Licensed under the MIT license.\n\/\/ Author: Paul Koch \n\n#include \"precompiled_header_test.hpp\"\n\n#include \"ebm_native.h\"\n#include \"ebm_native_test.hpp\"\n#include \"RandomStreamTest.hpp\"\n\nstatic const TestPriority k_filePriority = TestPriority::SuggestGraphBounds;\n\n\/\/ TODO : re-formulate these tests after we reach agreement on how the graph bounds are suposed to work\n\nTEST_CASE(\"SuggestGraphBounds, 0 cuts, min -inf, max nan\") {\n FloatEbmType lowGraphBound;\n FloatEbmType highGraphBound;\n\n constexpr IntEbmType countCuts = 0;\n constexpr FloatEbmType minValue = -std::numeric_limits::infinity();\n constexpr FloatEbmType lowestCut = -1;\n constexpr FloatEbmType highestCut = -1;\n constexpr FloatEbmType maxValue = std::numeric_limits::quiet_NaN();\n\n SuggestGraphBounds(\n countCuts,\n lowestCut,\n highestCut,\n minValue,\n maxValue,\n &lowGraphBound,\n &highGraphBound\n );\n\n CHECK(-std::numeric_limits::infinity() == lowGraphBound);\n CHECK(-std::numeric_limits::infinity() == highGraphBound);\n}\n\nTEST_CASE(\"SuggestGraphBounds, 0 cuts, min nan, max inf\") {\n FloatEbmType lowGraphBound;\n FloatEbmType highGraphBound;\n\n constexpr IntEbmType countCuts = 0;\n constexpr FloatEbmType minValue = std::numeric_limits::quiet_NaN();\n constexpr FloatEbmType lowestCut = -1;\n constexpr FloatEbmType highestCut = -1;\n constexpr FloatEbmType maxValue = std::numeric_limits::infinity();\n\n SuggestGraphBounds(\n countCuts,\n lowestCut,\n highestCut,\n minValue,\n maxValue,\n &lowGraphBound,\n &highGraphBound\n );\n\n CHECK(std::numeric_limits::infinity() == lowGraphBound);\n CHECK(std::numeric_limits::infinity() == highGraphBound);\n}\n\nTEST_CASE(\"SuggestGraphBounds, 0 cuts, min 7, max 99\") {\n FloatEbmType lowGraphBound;\n FloatEbmType highGraphBound;\n\n constexpr IntEbmType countCuts = 0;\n constexpr FloatEbmType minValue = 7;\n constexpr FloatEbmType lowestCut = -1;\n constexpr FloatEbmType highestCut = -1;\n constexpr FloatEbmType maxValue = 99;\n\n SuggestGraphBounds(\n countCuts,\n lowestCut,\n highestCut,\n minValue,\n maxValue,\n &lowGraphBound,\n &highGraphBound\n );\n\n CHECK(7 == lowGraphBound);\n CHECK(99 == highGraphBound);\n}\n\nTEST_CASE(\"SuggestGraphBounds, all 6\") {\n FloatEbmType lowGraphBound;\n FloatEbmType highGraphBound;\n\n constexpr IntEbmType countCuts = 1;\n constexpr FloatEbmType minValue = 6;\n constexpr FloatEbmType lowestCut = 6;\n constexpr FloatEbmType highestCut = 6;\n constexpr FloatEbmType maxValue = 6;\n\n SuggestGraphBounds(\n countCuts,\n lowestCut,\n highestCut,\n minValue,\n maxValue,\n &lowGraphBound,\n &highGraphBound\n );\n\n CHECK(6 == lowGraphBound);\n CHECK(6 == highGraphBound);\n}\n\nTEST_CASE(\"SuggestGraphBounds, progression\") {\n FloatEbmType lowGraphBound;\n FloatEbmType highGraphBound;\n\n constexpr IntEbmType countCuts = 1;\n constexpr FloatEbmType minValue = 6;\n constexpr FloatEbmType lowestCut = 7;\n constexpr FloatEbmType highestCut = 7;\n constexpr FloatEbmType maxValue = 8;\n\n SuggestGraphBounds(\n countCuts,\n lowestCut,\n highestCut,\n minValue,\n maxValue,\n &lowGraphBound,\n &highGraphBound\n );\n\n CHECK(6 == lowGraphBound);\n CHECK(8 == highGraphBound);\n}\n\nTEST_CASE(\"SuggestGraphBounds, 1 cuts, mismatched low high\") {\n FloatEbmType lowGraphBound;\n FloatEbmType highGraphBound;\n\n constexpr IntEbmType countCuts = 1;\n constexpr FloatEbmType minValue = -1;\n constexpr FloatEbmType lowestCut = -2;\n constexpr FloatEbmType highestCut = -2;\n constexpr FloatEbmType maxValue = 1;\n\n SuggestGraphBounds(\n countCuts,\n lowestCut,\n highestCut,\n minValue,\n maxValue,\n &lowGraphBound,\n &highGraphBound\n );\n\n CHECK(lowGraphBound < -2);\n CHECK(1 == highGraphBound);\n}\n\nTEST_CASE(\"SuggestGraphBounds, 1 cuts, mismatched low high\") {\n FloatEbmType lowGraphBound;\n FloatEbmType highGraphBound;\n\n constexpr IntEbmType countCuts = 1;\n constexpr FloatEbmType minValue = -2;\n constexpr FloatEbmType lowestCut = 0;\n constexpr FloatEbmType highestCut = 0;\n constexpr FloatEbmType maxValue = -1;\n\n SuggestGraphBounds(\n countCuts,\n lowestCut,\n highestCut,\n minValue,\n maxValue,\n &lowGraphBound,\n &highGraphBound\n );\n\n CHECK(-2 == lowGraphBound);\n CHECK(0 < highGraphBound);\n}\n\nTEST_CASE(\"SuggestGraphBounds, 1 cuts, out of range high\") {\n FloatEbmType lowGraphBound;\n FloatEbmType highGraphBound;\n\n constexpr IntEbmType countCuts = 1;\n constexpr FloatEbmType minValue = 1;\n constexpr FloatEbmType lowestCut = 0;\n constexpr FloatEbmType highestCut = 0;\n constexpr FloatEbmType maxValue = 2;\n\n SuggestGraphBounds(\n countCuts,\n lowestCut,\n highestCut,\n minValue,\n maxValue,\n &lowGraphBound,\n &highGraphBound\n );\n\n CHECK(lowGraphBound < 0);\n CHECK(2 == highGraphBound);\n}\n\nTEST_CASE(\"SuggestGraphBounds, 1 cuts, min -inf\") {\n FloatEbmType lowGraphBound;\n FloatEbmType highGraphBound;\n\n constexpr IntEbmType countCuts = 1;\n constexpr FloatEbmType minValue = -std::numeric_limits::infinity();\n constexpr FloatEbmType lowestCut = std::numeric_limits::lowest() + FloatEbmType { 1e300 };\n constexpr FloatEbmType highestCut = std::numeric_limits::lowest() + FloatEbmType { 1e300 };\n constexpr FloatEbmType maxValue = std::numeric_limits::lowest() + FloatEbmType { 1.5e300 };\n\n SuggestGraphBounds(\n countCuts,\n lowestCut,\n highestCut,\n minValue,\n maxValue,\n &lowGraphBound,\n &highGraphBound\n );\n\n CHECK(minValue == lowGraphBound);\n CHECK(maxValue == highGraphBound);\n}\n\nTEST_CASE(\"SuggestGraphBounds, 1 cuts, max +inf\") {\n FloatEbmType lowGraphBound;\n FloatEbmType highGraphBound;\n\n constexpr IntEbmType countCuts = 1;\n constexpr FloatEbmType minValue = std::numeric_limits::max() - 1.5e300;\n constexpr FloatEbmType lowestCut = std::numeric_limits::max() - 1e300;\n constexpr FloatEbmType highestCut = std::numeric_limits::max() - 1e300;\n constexpr FloatEbmType maxValue = std::numeric_limits::infinity();\n\n SuggestGraphBounds(\n countCuts,\n lowestCut,\n highestCut,\n minValue,\n maxValue,\n &lowGraphBound,\n &highGraphBound\n );\n\n CHECK(minValue == lowGraphBound);\n CHECK(maxValue == highGraphBound);\n}\n\nTEST_CASE(\"SuggestGraphBounds, 1 cuts, overflow diff\") {\n FloatEbmType lowGraphBound;\n FloatEbmType highGraphBound;\n\n constexpr IntEbmType countCuts = 1;\n constexpr FloatEbmType minValue = 0;\n constexpr FloatEbmType lowestCut = std::numeric_limits::lowest() + 1e300;\n constexpr FloatEbmType highestCut = lowestCut;\n constexpr FloatEbmType maxValue = std::numeric_limits::max() - 1e300;\n\n SuggestGraphBounds(\n countCuts,\n lowestCut,\n highestCut,\n minValue,\n maxValue,\n &lowGraphBound,\n &highGraphBound\n );\n\n CHECK(-std::numeric_limits::infinity() == lowGraphBound);\n CHECK(maxValue == highGraphBound);\n}\n\nTEST_CASE(\"SuggestGraphBounds, 1 cuts, min longest\") {\n FloatEbmType lowGraphBound;\n FloatEbmType highGraphBound;\n\n constexpr IntEbmType countCuts = 1;\n constexpr FloatEbmType minValue = 98;\n constexpr FloatEbmType lowestCut = 100;\n constexpr FloatEbmType highestCut = 100;\n constexpr FloatEbmType maxValue = 101;\n\n SuggestGraphBounds(\n countCuts,\n lowestCut,\n highestCut,\n minValue,\n maxValue,\n &lowGraphBound,\n &highGraphBound\n );\n\n CHECK(98 == lowGraphBound);\n CHECK(101 == highGraphBound);\n}\n\nTEST_CASE(\"SuggestGraphBounds, 1 cuts, max longest\") {\n FloatEbmType lowGraphBound;\n FloatEbmType highGraphBound;\n\n constexpr IntEbmType countCuts = 1;\n constexpr FloatEbmType minValue = 99;\n constexpr FloatEbmType lowestCut = 100;\n constexpr FloatEbmType highestCut = 100;\n constexpr FloatEbmType maxValue = 102;\n\n SuggestGraphBounds(\n countCuts,\n lowestCut,\n highestCut,\n minValue,\n maxValue,\n &lowGraphBound,\n &highGraphBound\n );\n\n CHECK(99 == lowGraphBound);\n CHECK(102 == highGraphBound);\n}\n\nTEST_CASE(\"SuggestGraphBounds, 1 cuts, overflow high\") {\n FloatEbmType lowGraphBound;\n FloatEbmType highGraphBound;\n\n constexpr IntEbmType countCuts = 1;\n constexpr FloatEbmType minValue = std::numeric_limits::max() - 1e307;\n constexpr FloatEbmType lowestCut = std::numeric_limits::max() - 1e306;\n constexpr FloatEbmType highestCut = std::numeric_limits::max() - 1e306;\n constexpr FloatEbmType maxValue = std::numeric_limits::max() - 1e307;\n\n SuggestGraphBounds(\n countCuts,\n lowestCut,\n highestCut,\n minValue,\n maxValue,\n &lowGraphBound,\n &highGraphBound\n );\n\n CHECK(minValue == lowGraphBound);\n CHECK(std::numeric_limits::infinity() == highGraphBound);\n}\n\nTEST_CASE(\"SuggestGraphBounds, 1 cuts, overflow low\") {\n FloatEbmType lowGraphBound;\n FloatEbmType highGraphBound;\n\n constexpr IntEbmType countCuts = 1;\n constexpr FloatEbmType minValue = std::numeric_limits::lowest() + 1e307;\n constexpr FloatEbmType lowestCut = std::numeric_limits::lowest() + 1e306;\n constexpr FloatEbmType highestCut = std::numeric_limits::lowest() + 1e306;\n constexpr FloatEbmType maxValue = std::numeric_limits::lowest() + 1e307;\n\n SuggestGraphBounds(\n countCuts,\n lowestCut,\n highestCut,\n minValue,\n maxValue,\n &lowGraphBound,\n &highGraphBound\n );\n\n CHECK(-std::numeric_limits::infinity() == lowGraphBound);\n CHECK(maxValue == highGraphBound);\n}\n\nTEST_CASE(\"SuggestGraphBounds, 2 cuts\") {\n FloatEbmType lowGraphBound;\n FloatEbmType highGraphBound;\n\n constexpr IntEbmType countCuts = 2;\n constexpr FloatEbmType minValue = 5;\n constexpr FloatEbmType lowestCut = 6;\n constexpr FloatEbmType highestCut = 7;\n constexpr FloatEbmType maxValue = 8;\n\n SuggestGraphBounds(\n countCuts,\n lowestCut,\n highestCut,\n minValue,\n maxValue,\n &lowGraphBound,\n &highGraphBound\n );\n\n CHECK(5 == lowGraphBound);\n CHECK(8 == highGraphBound);\n}\n\nTEST_CASE(\"SuggestGraphBounds, 4 cuts\") {\n FloatEbmType lowGraphBound;\n FloatEbmType highGraphBound;\n\n constexpr IntEbmType countCuts = 4;\n constexpr FloatEbmType minValue = 5;\n constexpr FloatEbmType lowestCut = 6;\n constexpr FloatEbmType highestCut = 7;\n constexpr FloatEbmType maxValue = 8;\n\n SuggestGraphBounds(\n countCuts,\n lowestCut,\n highestCut,\n minValue,\n maxValue,\n &lowGraphBound,\n &highGraphBound\n );\n\n CHECK_APPROX(lowGraphBound, 5);\n CHECK_APPROX(highGraphBound, 8);\n}\n\nTEST_CASE(\"SuggestGraphBounds, 2 cuts, overflow diff\") {\n FloatEbmType lowGraphBound;\n FloatEbmType highGraphBound;\n\n constexpr IntEbmType countCuts = 2;\n constexpr FloatEbmType minValue = -1;\n constexpr FloatEbmType lowestCut = std::numeric_limits::lowest();\n constexpr FloatEbmType highestCut = std::numeric_limits::max();\n constexpr FloatEbmType maxValue = 1;\n\n SuggestGraphBounds(\n countCuts,\n lowestCut,\n highestCut,\n minValue,\n maxValue,\n &lowGraphBound,\n &highGraphBound\n );\n\n CHECK(-std::numeric_limits::infinity() == lowGraphBound);\n CHECK(std::numeric_limits::infinity() == highGraphBound);\n}\n\n","avg_line_length":26.6017897092,"max_line_length":108,"alphanum_fraction":0.70423009,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":19351,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["BSD-2-Clause"],"max_stars_count":2.0,"content":"\/*\n* (C) 2016 Philipp Weber\n* (C) 2016 Daniel Neus\n*\n* Botan is released under the Simplified BSD License (see license.txt)\n*\/\n\n#include \"tests.h\"\n\n#if defined(BOTAN_HAS_ECIES)\n #include \n #include \n#endif\n\nnamespace Botan_Tests {\n\nnamespace {\n\n#if defined(BOTAN_HAS_ECIES) && defined(BOTAN_HAS_AES) && defined(BOTAN_HAS_MODE_CBC)\n\nusing Flags = Botan::ECIES_Flags;\n\nBotan::PointGFp::Compression_Type get_compression_type(const std::string& format)\n {\n if(format == \"uncompressed\")\n {\n return Botan::PointGFp::UNCOMPRESSED;\n }\n else if(format == \"compressed\")\n {\n return Botan::PointGFp::COMPRESSED;\n }\n else if(format == \"hybrid\")\n {\n return Botan::PointGFp::HYBRID;\n }\n throw Botan::Invalid_Argument(\"invalid compression format\");\n }\n\nFlags ecies_flags(bool cofactor_mode, bool old_cofactor_mode, bool check_mode, bool single_hash_mode)\n {\n return (cofactor_mode ? Flags::COFACTOR_MODE : Flags::NONE)\n | (single_hash_mode ? Flags::SINGLE_HASH_MODE : Flags::NONE)\n | (old_cofactor_mode ? Flags::OLD_COFACTOR_MODE : Flags::NONE)\n | (check_mode ? Flags::CHECK_MODE : Flags::NONE);\n }\n\nvoid check_encrypt_decrypt(Test::Result& result, const Botan::ECDH_PrivateKey& private_key,\n const Botan::ECDH_PrivateKey& other_private_key,\n const Botan::ECIES_System_Params& ecies_params,\n const Botan::InitializationVector& iv, const std::string& label,\n const std::vector& plaintext, const std::vector& ciphertext)\n {\n try\n {\n Botan::ECIES_Encryptor ecies_enc(private_key, ecies_params, Test::rng());\n ecies_enc.set_other_key(other_private_key.public_point());\n Botan::ECIES_Decryptor ecies_dec(other_private_key, ecies_params, Test::rng());\n if(!iv.bits_of().empty())\n {\n ecies_enc.set_initialization_vector(iv);\n ecies_dec.set_initialization_vector(iv);\n }\n if(!label.empty())\n {\n ecies_enc.set_label(label);\n ecies_dec.set_label(label);\n }\n\n const std::vector encrypted = ecies_enc.encrypt(plaintext, Test::rng());\n if(!ciphertext.empty())\n {\n result.test_eq(\"encrypted data\", encrypted, ciphertext);\n }\n const Botan::secure_vector decrypted = ecies_dec.decrypt(encrypted);\n result.test_eq(\"decrypted data equals plaintext\", decrypted, plaintext);\n\n std::vector invalid_encrypted = encrypted;\n uint8_t& last_byte = invalid_encrypted[invalid_encrypted.size() - 1];\n last_byte = ~last_byte;\n result.test_throws(\"throw on invalid ciphertext\", [&ecies_dec, &invalid_encrypted]\n {\n ecies_dec.decrypt(invalid_encrypted);\n });\n }\n catch(Botan::Lookup_Error& e)\n {\n result.test_note(std::string(\"Test not executed: \") + e.what());\n }\n }\n\nvoid check_encrypt_decrypt(Test::Result& result, const Botan::ECDH_PrivateKey& private_key,\n const Botan::ECDH_PrivateKey& other_private_key,\n const Botan::ECIES_System_Params& ecies_params, size_t iv_length = 0)\n {\n const std::vector plaintext { 1, 2, 3 };\n check_encrypt_decrypt(result, private_key, other_private_key, ecies_params, std::vector(iv_length, 0), \"\",\n plaintext, std::vector());\n }\n\n#if defined(BOTAN_HAS_KDF1_18033) && defined(BOTAN_HAS_SHA1)\n\nclass ECIES_ISO_Tests final : public Text_Based_Test\n {\n public:\n ECIES_ISO_Tests() : Text_Based_Test(\n \"pubkey\/ecies-18033.vec\",\n \"format,p,a,b,mu,nu,gx,gy,hx,hy,x,r,C0,K\") {}\n\n Test::Result run_one_test(const std::string& \/*header*\/, const VarMap& vars) override\n {\n Test::Result result(\"ECIES-ISO\");\n\n \/\/ get test vectors defined by ISO 18033\n const Botan::PointGFp::Compression_Type compression_type = get_compression_type(vars.get_req_str(\"format\"));\n const Botan::BigInt p = vars.get_req_bn(\"p\");\n const Botan::BigInt a = vars.get_req_bn(\"a\");\n const Botan::BigInt b = vars.get_req_bn(\"b\");\n const Botan::BigInt mu = vars.get_req_bn(\"mu\"); \/\/ order\n const Botan::BigInt nu = vars.get_req_bn(\"nu\"); \/\/ cofactor\n const Botan::BigInt gx = vars.get_req_bn(\"gx\"); \/\/ base point x\n const Botan::BigInt gy = vars.get_req_bn(\"gy\"); \/\/ base point y\n const Botan::BigInt hx = vars.get_req_bn(\"hx\"); \/\/ x of public point of bob\n const Botan::BigInt hy = vars.get_req_bn(\"hy\"); \/\/ y of public point of bob\n const Botan::BigInt x = vars.get_req_bn(\"x\"); \/\/ private key of bob\n const Botan::BigInt r = vars.get_req_bn(\"r\"); \/\/ (ephemeral) private key of alice\n const std::vector c0 = vars.get_req_bin(\"C0\"); \/\/ expected encoded (ephemeral) public key\n const std::vector k = vars.get_req_bin(\"K\"); \/\/ expected derived secret\n\n const Botan::EC_Group domain(p, a, b, gx, gy, mu, nu);\n\n \/\/ keys of bob\n const Botan::ECDH_PrivateKey other_private_key(Test::rng(), domain, x);\n const Botan::PointGFp other_public_key_point = domain.point(hx, hy);\n const Botan::ECDH_PublicKey other_public_key(domain, other_public_key_point);\n\n \/\/ (ephemeral) keys of alice\n const Botan::ECDH_PrivateKey eph_private_key(Test::rng(), domain, r);\n const Botan::PointGFp eph_public_key_point = eph_private_key.public_point();\n const std::vector eph_public_key_bin = eph_public_key_point.encode(compression_type);\n result.test_eq(\"encoded (ephemeral) public key\", eph_public_key_bin, c0);\n\n \/\/ test secret derivation: ISO 18033 test vectors use KDF1 from ISO 18033\n \/\/ no cofactor-\/oldcofactor-\/singlehash-\/check-mode and 128 byte secret length\n Botan::ECIES_KA_Params ka_params(eph_private_key.domain(), \"KDF1-18033(SHA-1)\", 128, compression_type, Flags::NONE);\n const Botan::ECIES_KA_Operation ka(eph_private_key, ka_params, true, Test::rng());\n const Botan::SymmetricKey secret_key = ka.derive_secret(eph_public_key_bin, other_public_key_point);\n result.test_eq(\"derived secret key\", secret_key.bits_of(), k);\n\n \/\/ test encryption \/ decryption\n\n for(auto comp_type : { Botan::PointGFp::UNCOMPRESSED, Botan::PointGFp::COMPRESSED, Botan::PointGFp::HYBRID })\n {\n for(bool cofactor_mode : { true, false })\n {\n for(bool single_hash_mode : { true, false })\n {\n for(bool old_cofactor_mode : { true, false })\n {\n for(bool check_mode : { true, false })\n {\n Flags flags = ecies_flags(cofactor_mode, old_cofactor_mode, check_mode, single_hash_mode);\n\n if(size_t(cofactor_mode) + size_t(check_mode) + size_t(old_cofactor_mode) > 1)\n {\n auto onThrow = [&]()\n {\n Botan::ECIES_System_Params(eph_private_key.domain(),\n \"KDF2(SHA-1)\", \"AES-256\/CBC\", 32, \"HMAC(SHA-1)\", 20,\n comp_type, flags);\n };\n result.test_throws(\"throw on invalid ECIES_Flags\", onThrow);\n continue;\n }\n\n Botan::ECIES_System_Params ecies_params(eph_private_key.domain(), \"KDF2(SHA-1)\", \"AES-256\/CBC\",\n 32, \"HMAC(SHA-1)\", 20, comp_type, flags);\n check_encrypt_decrypt(result, eph_private_key, other_private_key, ecies_params, 16);\n }\n }\n }\n }\n }\n\n return result;\n }\n };\n\nBOTAN_REGISTER_TEST(\"pubkey\", \"ecies_iso\", ECIES_ISO_Tests);\n\n#endif\n\nclass ECIES_Tests final : public Text_Based_Test\n {\n public:\n ECIES_Tests()\n : Text_Based_Test(\n \"pubkey\/ecies.vec\",\n \"Curve,PrivateKey,OtherPrivateKey,Kdf,Dem,DemKeyLen,Mac,MacKeyLen,Format,\"\n \"CofactorMode,OldCofactorMode,CheckMode,SingleHashMode,Label,Plaintext,Ciphertext\",\n \"Iv\") {}\n\n Test::Result run_one_test(const std::string& \/*header*\/, const VarMap& vars) override\n {\n Test::Result result(\"ECIES\");\n\n const std::string curve = vars.get_req_str(\"Curve\");\n const Botan::BigInt private_key_value = vars.get_req_bn(\"PrivateKey\");\n const Botan::BigInt other_private_key_value = vars.get_req_bn(\"OtherPrivateKey\");\n const std::string kdf = vars.get_req_str(\"Kdf\");\n const std::string dem = vars.get_req_str(\"Dem\");\n const size_t dem_key_len = vars.get_req_sz(\"DemKeyLen\");\n const std::vector iv = vars.get_opt_bin(\"Iv\");\n const std::string mac = vars.get_req_str(\"Mac\");\n const size_t mac_key_len = vars.get_req_sz(\"MacKeyLen\");\n const Botan::PointGFp::Compression_Type compression_type = get_compression_type(vars.get_req_str(\"Format\"));\n const bool cofactor_mode = vars.get_req_sz(\"CofactorMode\") != 0;\n const bool old_cofactor_mode = vars.get_req_sz(\"OldCofactorMode\") != 0;\n const bool check_mode = vars.get_req_sz(\"CheckMode\") != 0;\n const bool single_hash_mode = vars.get_req_sz(\"SingleHashMode\") != 0;\n const std::string label = vars.get_req_str(\"Label\");\n const std::vector plaintext = vars.get_req_bin(\"Plaintext\");\n const std::vector ciphertext = vars.get_req_bin(\"Ciphertext\");\n\n const Flags flags = ecies_flags(cofactor_mode, old_cofactor_mode, check_mode, single_hash_mode);\n const Botan::EC_Group domain(curve);\n const Botan::ECDH_PrivateKey private_key(Test::rng(), domain, private_key_value);\n const Botan::ECDH_PrivateKey other_private_key(Test::rng(), domain, other_private_key_value);\n\n const Botan::ECIES_System_Params ecies_params(private_key.domain(), kdf, dem, dem_key_len, mac, mac_key_len,\n compression_type, flags);\n check_encrypt_decrypt(result, private_key, other_private_key, ecies_params, iv, label, plaintext, ciphertext);\n\n return result;\n }\n\n };\n\nBOTAN_REGISTER_TEST(\"pubkey\", \"ecies\", ECIES_Tests);\n\n#if defined(BOTAN_HAS_KDF1_18033) && defined(BOTAN_HAS_HMAC) && defined(BOTAN_HAS_AES) && defined(BOTAN_HAS_SHA2_64)\n\nTest::Result test_other_key_not_set()\n {\n Test::Result result(\"ECIES other key not set\");\n\n const Flags flags = ecies_flags(false, false, false, true);\n const Botan::EC_Group domain(\"secp521r1\");\n const Botan::BigInt private_key_value(\"405029866705438137604064977397053031159826489755682166267763407\"\n \"5002761777100287880684822948852132235484464537021197213998300006\"\n \"547176718172344447619746779823\");\n\n const Botan::ECDH_PrivateKey private_key(Test::rng(), domain, private_key_value);\n const Botan::ECIES_System_Params ecies_params(private_key.domain(), \"KDF1-18033(SHA-512)\", \"AES-256\/CBC\", 32,\n \"HMAC(SHA-512)\", 20, Botan::PointGFp::Compression_Type::COMPRESSED,\n flags);\n\n Botan::ECIES_Encryptor ecies_enc(private_key, ecies_params, Test::rng());\n\n result.test_throws(\"encrypt not possible without setting other public key\", [ &ecies_enc ]()\n {\n ecies_enc.encrypt(std::vector(8), Test::rng());\n });\n\n return result;\n }\n\nTest::Result test_kdf_not_found()\n {\n Test::Result result(\"ECIES kdf not found\");\n\n const Flags flags = ecies_flags(false, false, false, true);\n const Botan::EC_Group domain(\"secp521r1\");\n const Botan::BigInt private_key_value(\"405029866705438137604064977397053031159826489755682166267763407\"\n \"5002761777100287880684822948852132235484464537021197213998300006\"\n \"547176718172344447619746779823\");\n\n const Botan::ECDH_PrivateKey private_key(Test::rng(), domain, private_key_value);\n const Botan::ECIES_System_Params ecies_params(private_key.domain(), \"KDF-XYZ(SHA-512)\", \"AES-256\/CBC\", 32,\n \"HMAC(SHA-512)\", 20, Botan::PointGFp::Compression_Type::COMPRESSED,\n flags);\n\n result.test_throws(\"kdf not found\", [&]()\n {\n Botan::ECIES_Encryptor ecies_enc(private_key, ecies_params, Test::rng());\n ecies_enc.encrypt(std::vector(8), Test::rng());\n });\n\n return result;\n }\n\nTest::Result test_mac_not_found()\n {\n Test::Result result(\"ECIES mac not found\");\n\n const Flags flags = ecies_flags(false, false, false, true);\n const Botan::EC_Group domain(\"secp521r1\");\n const Botan::BigInt private_key_value(\"405029866705438137604064977397053031159826489755682166267763407\"\n \"5002761777100287880684822948852132235484464537021197213998300006\"\n \"547176718172344447619746779823\");\n\n const Botan::ECDH_PrivateKey private_key(Test::rng(), domain, private_key_value);\n const Botan::ECIES_System_Params ecies_params(private_key.domain(), \"KDF1-18033(SHA-512)\", \"AES-256\/CBC\", 32,\n \"XYZMAC(SHA-512)\", 20, Botan::PointGFp::Compression_Type::COMPRESSED,\n flags);\n\n result.test_throws(\"mac not found\", [&]()\n {\n Botan::ECIES_Encryptor ecies_enc(private_key, ecies_params, Test::rng());\n ecies_enc.encrypt(std::vector(8), Test::rng());\n });\n\n return result;\n }\n\nTest::Result test_cipher_not_found()\n {\n Test::Result result(\"ECIES cipher not found\");\n\n const Flags flags = ecies_flags(false, false, false, true);\n const Botan::EC_Group domain(\"secp521r1\");\n const Botan::BigInt private_key_value(\"405029866705438137604064977397053031159826489755682166267763407\"\n \"5002761777100287880684822948852132235484464537021197213998300006\"\n \"547176718172344447619746779823\");\n\n const Botan::ECDH_PrivateKey private_key(Test::rng(), domain, private_key_value);\n const Botan::ECIES_System_Params ecies_params(private_key.domain(), \"KDF1-18033(SHA-512)\", \"AES-XYZ-256\/CBC\", 32,\n \"HMAC(SHA-512)\", 20, Botan::PointGFp::Compression_Type::COMPRESSED,\n flags);\n\n result.test_throws(\"cipher not found\", [&]()\n {\n Botan::ECIES_Encryptor ecies_enc(private_key, ecies_params, Test::rng());\n ecies_enc.encrypt(std::vector(8), Test::rng());\n });\n\n return result;\n }\n\nTest::Result test_system_params_short_ctor()\n {\n Test::Result result(\"ECIES short system params ctor\");\n\n const Botan::EC_Group domain(\"secp521r1\");\n const Botan::BigInt private_key_value(\"405029866705438137604064977397053031159826489755682166267763407\"\n \"5002761777100287880684822948852132235484464537021197213998300006\"\n \"547176718172344447619746779823\");\n\n const Botan::BigInt other_private_key_value(\"2294226772740614508941417891614236736606752960073669253551166842\"\n \"5866095315090327914760325168219669828915074071456176066304457448\"\n \"25404691681749451640151380153\");\n\n const Botan::ECDH_PrivateKey private_key(Test::rng(), domain, private_key_value);\n const Botan::ECDH_PrivateKey other_private_key(Test::rng(), domain, other_private_key_value);\n\n const Botan::ECIES_System_Params ecies_params(private_key.domain(), \"KDF1-18033(SHA-512)\", \"AES-256\/CBC\", 32,\n \"HMAC(SHA-512)\", 16);\n\n const Botan::InitializationVector iv(\"FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF\");\n const std::string label = \"Test\";\n\n const std::vector plaintext = Botan::hex_decode(\"000102030405060708090A0B0C0D0E0F\");\n\n \/\/ generated with botan\n const std::vector ciphertext = Botan::hex_decode(\"0401519EAA0489FF9D51E98E4C22349463E2001CD06F8CE47D81D4007A\"\n \"79ACF98E92C814686477CEA666EFC277DC84E15FC95E38AFF8E16D478A\"\n \"44CD5C5F1517F8B1F300000591317F261C3D04A7207F01EAE3EC70F2360\"\n \"0F82C53CC0B85BE7AC9F6CE79EF2AB416E5934D61BA9D346385D7545C57F\"\n \"77C7EA7C58E18C70CBFB0A24AE1B9943EC5A8D0657522CCDF30BA95674D81\"\n \"B397635D215178CD13BD9504AE957A9888F4128FFC0F0D3F1CEC646AEC8CE\"\n \"3F2463D233B22A7A12B679F4C06501F584D4DEFF6D26592A8D873398BD892\"\n \"B477B3468813C053DA43C4F3D49009F7A12D6EF7\");\n\n check_encrypt_decrypt(result, private_key, other_private_key, ecies_params, iv, label, plaintext, ciphertext);\n\n return result;\n }\n\nTest::Result test_ciphertext_too_short()\n {\n Test::Result result(\"ECIES ciphertext too short\");\n\n const Botan::EC_Group domain(\"secp521r1\");\n const Botan::BigInt private_key_value(\"405029866705438137604064977397053031159826489755682166267763407\"\n \"5002761777100287880684822948852132235484464537021197213998300006\"\n \"547176718172344447619746779823\");\n\n const Botan::BigInt other_private_key_value(\"2294226772740614508941417891614236736606752960073669253551166842\"\n \"5866095315090327914760325168219669828915074071456176066304457448\"\n \"25404691681749451640151380153\");\n\n const Botan::ECDH_PrivateKey private_key(Test::rng(), domain, private_key_value);\n const Botan::ECDH_PrivateKey other_private_key(Test::rng(), domain, other_private_key_value);\n\n const Botan::ECIES_System_Params ecies_params(private_key.domain(), \"KDF1-18033(SHA-512)\", \"AES-256\/CBC\", 32,\n \"HMAC(SHA-512)\", 16);\n\n Botan::ECIES_Decryptor ecies_dec(other_private_key, ecies_params, Test::rng());\n\n result.test_throws(\"ciphertext too short\", [ &ecies_dec ]()\n {\n ecies_dec.decrypt(Botan::hex_decode(\"0401519EAA0489FF9D51E98E4C22349A\"));\n });\n\n return result;\n }\n\nclass ECIES_Unit_Tests final : public Test\n {\n public:\n std::vector run() override\n {\n std::vector results;\n\n std::vector> fns =\n {\n test_other_key_not_set,\n test_kdf_not_found,\n test_mac_not_found,\n test_cipher_not_found,\n test_system_params_short_ctor,\n test_ciphertext_too_short\n };\n\n for(size_t i = 0; i != fns.size(); ++i)\n {\n try\n {\n results.emplace_back(fns[ i ]());\n }\n catch(std::exception& e)\n {\n results.emplace_back(Test::Result::Failure(\"ECIES unit tests \" + std::to_string(i), e.what()));\n }\n }\n\n return results;\n }\n };\n\nBOTAN_REGISTER_TEST(\"pubkey\", \"ecies_unit\", ECIES_Unit_Tests);\n\n#endif\n\n#endif\n\n}\n\n}\n","avg_line_length":43.0022222222,"max_line_length":125,"alphanum_fraction":0.6389850654,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":3447,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":1.0,"content":"\/\/ Copyright 1998-2016 Epic Games, Inc. All Rights Reserved.\n\n#include \"UnrealEd.h\"\n\n\/\/ FPreviewScene derived helpers for rendering\n#include \"ThumbnailHelpers.h\"\n\n#include \"Particles\/ParticleSystem.h\"\n#include \"EngineModule.h\"\n#include \"RendererInterface.h\"\n#include \"CanvasTypes.h\"\n\nUParticleSystemThumbnailRenderer::UParticleSystemThumbnailRenderer(const FObjectInitializer& ObjectInitializer)\n\t: Super(ObjectInitializer)\n{\n\t\/\/ Structure to hold one-time initialization\n\tstruct FConstructorStatics\n\t{\n\t\tConstructorHelpers::FObjectFinder PSysThumbnail_NoImage;\n\t\tConstructorHelpers::FObjectFinder PSysThumbnail_OOD;\n\t\tFConstructorStatics()\n\t\t\t: PSysThumbnail_NoImage(TEXT(\"\/Engine\/EditorMaterials\/ParticleSystems\/PSysThumbnail_NoImage\"))\n\t\t\t, PSysThumbnail_OOD(TEXT(\"\/Engine\/EditorMaterials\/ParticleSystems\/PSysThumbnail_OOD\"))\n\t\t{\n\t\t}\n\t};\n\tstatic FConstructorStatics ConstructorStatics;\n\n\tNoImage = ConstructorStatics.PSysThumbnail_NoImage.Object;\n\tOutOfDate = ConstructorStatics.PSysThumbnail_OOD.Object;\n\tThumbnailScene = nullptr;\n}\n\nvoid UParticleSystemThumbnailRenderer::GetThumbnailSize(UObject* Object, float Zoom, uint32& OutWidth, uint32& OutHeight) const\n{\n\t\/\/ Particle system thumbnails will be 1024x1024 at 100%.\n\tUParticleSystem* PSys = Cast(Object);\n\tif (PSys != nullptr)\n\t{\n\t\tif ((PSys->bUseRealtimeThumbnail) ||\n\t\t\t(PSys->ThumbnailImage) || \n\t\t\t(NoImage))\n\t\t{\n\t\t\tOutWidth = FMath::TruncToInt(1024 * Zoom);\n\t\t\tOutHeight = FMath::TruncToInt(1024 * Zoom);\n\t\t}\n\t\telse\n\t\t{\n\t\t\t\/\/ Nothing valid to display\n\t\t\tOutWidth = OutHeight = 0;\n\t\t}\n\t}\n\telse\n\t{\n\t\tOutWidth = OutHeight = 0;\n\t}\n}\n\nvoid UParticleSystemThumbnailRenderer::Draw(UObject* Object, int32 X, int32 Y, uint32 Width, uint32 Height, FRenderTarget* RenderTarget,FCanvas* Canvas)\n{\n\tif (GUnrealEd->GetThumbnailManager())\n\t{\n\t\tUParticleSystem* ParticleSystem = Cast(Object);\n\t\tif (ParticleSystem != nullptr)\n\t\t{\n\t\t\tif ( ParticleSystem->bUseRealtimeThumbnail )\n\t\t\t{\n\t\t\t\tif ( ThumbnailScene == nullptr )\n\t\t\t\t{\n\t\t\t\t\tThumbnailScene = new FParticleSystemThumbnailScene();\n\t\t\t\t}\n\n\t\t\t\tThumbnailScene->SetParticleSystem(ParticleSystem);\n\t\t\t\tFSceneViewFamilyContext ViewFamily( FSceneViewFamily::ConstructionValues( RenderTarget, ThumbnailScene->GetScene(), FEngineShowFlags(ESFIM_Game))\n\t\t\t\t\t.SetWorldTimes(FApp::GetCurrentTime() - GStartTime, FApp::GetDeltaTime(), FApp::GetCurrentTime() - GStartTime));\n\t\t\t\n\t\t\t\tViewFamily.EngineShowFlags.DisableAdvancedFeatures();\n\t\t\t\tViewFamily.EngineShowFlags.MotionBlur = 0;\n\n\t\t\t\tThumbnailScene->GetView(&ViewFamily, X, Y, Width, Height);\n\t\t\t\tGetRendererModule().BeginRenderingViewFamily(Canvas,&ViewFamily);\n\t\t\t\tThumbnailScene->SetParticleSystem(nullptr);\n\t\t\t}\n\t\t\telse if (ParticleSystem->ThumbnailImage)\n\t\t\t{\n\t\t\t\tCanvas->DrawTile(X,Y,Width,Height,0.f,0.f,1.f,1.f,FLinearColor::White,\n\t\t\t\t\tParticleSystem->ThumbnailImage->Resource,false);\n\t\t\t\tif (ParticleSystem->ThumbnailImageOutOfDate == true)\n\t\t\t\t{\n\t\t\t\t\tCanvas->DrawTile(X,Y,Width\/2,Height\/2,0.f,0.f,1.f,1.f,FLinearColor::White,\n\t\t\t\t\t\tOutOfDate->Resource,true);\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (NoImage)\n\t\t\t{\n\t\t\t\t\/\/ Use the texture interface to draw\n\t\t\t\tCanvas->DrawTile(X,Y,Width,Height,0.f,0.f,1.f,1.f,FLinearColor::White,\n\t\t\t\t\tNoImage->Resource,false);\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid UParticleSystemThumbnailRenderer::BeginDestroy()\n{\n\tif ( ThumbnailScene != nullptr )\n\t{\n\t\tdelete ThumbnailScene;\n\t\tThumbnailScene = nullptr;\n\t}\n\n\tSuper::BeginDestroy();\n}\n","avg_line_length":30.2368421053,"max_line_length":152,"alphanum_fraction":0.7435451117,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":3586,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["blessing"],"max_stars_count":1.0,"content":"\/**********************************************************************\n * Copyright (c) 2008-2016, Alliance for Sustainable Energy.\n * All rights reserved.\n *\n * This library is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with this library; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n **********************************************************************\/\n\n#include \"..\/ForwardTranslator.hpp\"\n#include \"..\/..\/model\/Model.hpp\"\n#include \"..\/..\/model\/CoilHeatingElectric.hpp\"\n#include \"..\/..\/model\/CoilHeatingElectric_Impl.hpp\"\n#include \"..\/..\/model\/Schedule.hpp\"\n#include \"..\/..\/model\/Schedule_Impl.hpp\"\n#include \"..\/..\/model\/Node.hpp\"\n#include \"..\/..\/model\/Node_Impl.hpp\"\n#include \n#include \"..\/..\/utilities\/idd\/IddEnums.hpp\"\n#include \n#include \n\nusing namespace openstudio::model;\n\nusing namespace std;\n\nnamespace openstudio {\n\nnamespace energyplus {\n\nboost::optional ForwardTranslator::translateCoilHeatingElectric( CoilHeatingElectric & modelObject )\n{\n boost::optional s;\n boost::optional value;\n\n IdfObject idfObject(IddObjectType::Coil_Heating_Electric);\n\n m_idfObjects.push_back(idfObject);\n\n \/\/ Name\n\n s = modelObject.name();\n if( s )\n {\n idfObject.setName(*s);\n }\n\n \/\/ AvailabilityScheduleName\n\n if( boost::optional schedule = modelObject.availabilitySchedule() )\n {\n if( boost::optional _schedule = translateAndMapModelObject(schedule.get()) )\n {\n idfObject.setString(Coil_Heating_ElectricFields::AvailabilityScheduleName,_schedule->name().get());\n }\n }\n\n \/\/ Efficiency\n\n if( (value = modelObject.efficiency()) )\n {\n idfObject.setDouble(Coil_Heating_ElectricFields::Efficiency,value.get());\n }\n\n \/\/ Nominal Capacity \n \n if( modelObject.isNominalCapacityAutosized() )\n {\n idfObject.setString(Coil_Heating_ElectricFields::NominalCapacity,\"Autosize\");\n }\n else if( (value = modelObject.nominalCapacity()) )\n {\n idfObject.setDouble(Coil_Heating_ElectricFields::NominalCapacity,value.get());\n }\n\n \/\/ Air Inlet Node Name\n \n if( boost::optional mo = modelObject.inletModelObject() )\n {\n if( boost::optional node = mo->optionalCast() )\n {\n idfObject.setString(Coil_Heating_ElectricFields::AirInletNodeName,node->name().get());\n }\n }\n\n \/\/ Air Outlet Node Name\n \n if( boost::optional mo = modelObject.outletModelObject() )\n {\n if( boost::optional node = mo->optionalCast() )\n {\n idfObject.setString(Coil_Heating_ElectricFields::AirOutletNodeName,node->name().get());\n }\n }\n\n \/\/ Temperature Setpoint Node Name \n \n if( boost::optional node = modelObject.temperatureSetpointNode() )\n {\n idfObject.setString(Coil_Heating_ElectricFields::TemperatureSetpointNodeName,node->name().get());\n }\n\n return idfObject;\n}\n\n} \/\/ energyplus\n\n} \/\/ openstudio\n\n","avg_line_length":29.8833333333,"max_line_length":111,"alphanum_fraction":0.6907417736,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":96050,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":8.0,"content":"\/\/ Copyright (c) 2009-2010 Satoshi Nakamoto\n\/\/ Copyright (c) 2009-2014 The Bitcoin developers\n\/\/ Copyright (c) 2014 The Potcoin developers\n\/\/ Distributed under the MIT\/X11 software license, see the accompanying\n\/\/ file COPYING or http:\/\/www.opensource.org\/licenses\/mit-license.php.\n\n#include \"wallet.h\"\n#include \"walletdb.h\"\n#include \"crypter.h\"\n#include \"ui_interface.h\"\n#include \"base58.h\"\n#include \"kernel.h\"\n#include \"coincontrol.h\"\n#include \n\nusing namespace std;\n\n\nbool bSpendZeroConfChange = true;\n\ntypedef vector valtype;\n\n\/\/ we split the coinstake output in two to avoid concentrating\n\/\/ too many coins in one output. currently almost always split.\nunsigned int nStakeSplitAge = 10 * 24 * 60 * 60;; \/\/ 10 days\nint64 nStakeCombineThreshold = 250 * COIN;\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ mapWallet\n\/\/\n\nstruct CompareValueOnly\n{\n bool operator()(const pair >& t1,\n const pair >& t2) const\n {\n return t1.first < t2.first;\n }\n};\n\nCPubKey CWallet::GenerateNewKey()\n{\n bool fCompressed = CanSupportFeature(FEATURE_COMPRPUBKEY); \/\/ default to compressed public keys if we want 0.6.0 wallets\n\n RandAddSeedPerfmon();\n CKey secret;\n secret.MakeNewKey(fCompressed);\n\n \/\/ Compressed public keys were introduced in version 0.6.0\n if (fCompressed)\n SetMinVersion(FEATURE_COMPRPUBKEY);\n\n CPubKey pubkey = secret.GetPubKey();\n if (!AddKeyPubKey(secret, pubkey))\n throw std::runtime_error(\"CWallet::GenerateNewKey() : AddKey failed\");\n return pubkey;\n}\n\nbool CWallet::AddKeyPubKey(const CKey& secret, const CPubKey &pubkey)\n{\n if (!CCryptoKeyStore::AddKeyPubKey(secret, pubkey))\n return false;\n if (!fFileBacked)\n return true;\n if (!IsCrypted()) {\n return CWalletDB(strWalletFile).WriteKey(pubkey, secret.GetPrivKey());\n }\n return true;\n}\n\nbool CWallet::AddCryptedKey(const CPubKey &vchPubKey, const vector &vchCryptedSecret)\n{\n if (!CCryptoKeyStore::AddCryptedKey(vchPubKey, vchCryptedSecret))\n return false;\n if (!fFileBacked)\n return true;\n {\n LOCK(cs_wallet);\n if (pwalletdbEncryption)\n return pwalletdbEncryption->WriteCryptedKey(vchPubKey, vchCryptedSecret);\n else\n return CWalletDB(strWalletFile).WriteCryptedKey(vchPubKey, vchCryptedSecret);\n }\n return false;\n}\n\nbool CWallet::LoadCryptedKey(const CPubKey &vchPubKey, const std::vector &vchCryptedSecret)\n{\n return CCryptoKeyStore::AddCryptedKey(vchPubKey, vchCryptedSecret);\n}\n\nbool CWallet::AddCScript(const CScript& redeemScript)\n{\n if (!CCryptoKeyStore::AddCScript(redeemScript))\n return false;\n if (!fFileBacked)\n return true;\n return CWalletDB(strWalletFile).WriteCScript(Hash160(redeemScript), redeemScript);\n}\n\n\/\/ ppcoin\n\/\/ optional setting to unlock wallet for staking only\n\/\/ serves to disable the trivial sendmoney when OS account compromised\n\/\/ provides no real security\nbool fWalletUnlockStakingOnly = false;\n\nbool CWallet::Unlock(const SecureString& strWalletPassphrase)\n{\n if (!IsLocked())\n return false;\n\n CCrypter crypter;\n CKeyingMaterial vMasterKey;\n\n {\n LOCK(cs_wallet);\n BOOST_FOREACH(const MasterKeyMap::value_type& pMasterKey, mapMasterKeys)\n {\n if(!crypter.SetKeyFromPassphrase(strWalletPassphrase, pMasterKey.second.vchSalt, pMasterKey.second.nDeriveIterations, pMasterKey.second.nDerivationMethod))\n return false;\n if (!crypter.Decrypt(pMasterKey.second.vchCryptedKey, vMasterKey))\n return false;\n if (CCryptoKeyStore::Unlock(vMasterKey))\n return true;\n }\n }\n return false;\n}\n\nbool CWallet::ChangeWalletPassphrase(const SecureString& strOldWalletPassphrase, const SecureString& strNewWalletPassphrase)\n{\n bool fWasLocked = IsLocked();\n\n {\n LOCK(cs_wallet);\n Lock();\n\n CCrypter crypter;\n CKeyingMaterial vMasterKey;\n BOOST_FOREACH(MasterKeyMap::value_type& pMasterKey, mapMasterKeys)\n {\n if(!crypter.SetKeyFromPassphrase(strOldWalletPassphrase, pMasterKey.second.vchSalt, pMasterKey.second.nDeriveIterations, pMasterKey.second.nDerivationMethod))\n return false;\n if (!crypter.Decrypt(pMasterKey.second.vchCryptedKey, vMasterKey))\n return false;\n if (CCryptoKeyStore::Unlock(vMasterKey))\n {\n int64 nStartTime = GetTimeMillis();\n crypter.SetKeyFromPassphrase(strNewWalletPassphrase, pMasterKey.second.vchSalt, pMasterKey.second.nDeriveIterations, pMasterKey.second.nDerivationMethod);\n pMasterKey.second.nDeriveIterations = pMasterKey.second.nDeriveIterations * (100 \/ ((double)(GetTimeMillis() - nStartTime)));\n\n nStartTime = GetTimeMillis();\n crypter.SetKeyFromPassphrase(strNewWalletPassphrase, pMasterKey.second.vchSalt, pMasterKey.second.nDeriveIterations, pMasterKey.second.nDerivationMethod);\n pMasterKey.second.nDeriveIterations = (pMasterKey.second.nDeriveIterations + pMasterKey.second.nDeriveIterations * 100 \/ ((double)(GetTimeMillis() - nStartTime))) \/ 2;\n\n if (pMasterKey.second.nDeriveIterations < 25000)\n pMasterKey.second.nDeriveIterations = 25000;\n\n printf(\"Wallet passphrase changed to an nDeriveIterations of %i\\n\", pMasterKey.second.nDeriveIterations);\n\n if (!crypter.SetKeyFromPassphrase(strNewWalletPassphrase, pMasterKey.second.vchSalt, pMasterKey.second.nDeriveIterations, pMasterKey.second.nDerivationMethod))\n return false;\n if (!crypter.Encrypt(vMasterKey, pMasterKey.second.vchCryptedKey))\n return false;\n CWalletDB(strWalletFile).WriteMasterKey(pMasterKey.first, pMasterKey.second);\n if (fWasLocked)\n Lock();\n return true;\n }\n }\n }\n\n return false;\n}\n\nvoid CWallet::SetBestChain(const CBlockLocator& loc)\n{\n CWalletDB walletdb(strWalletFile);\n walletdb.WriteBestBlock(loc);\n}\n\n\/\/ This class implements an addrIncoming entry that causes pre-0.4\n\/\/ clients to crash on startup if reading a private-key-encrypted wallet.\nclass CCorruptAddress\n{\npublic:\n IMPLEMENT_SERIALIZE\n (\n if (nType & SER_DISK)\n READWRITE(nVersion);\n )\n};\n\nbool CWallet::SetMinVersion(enum WalletFeature nVersion, CWalletDB* pwalletdbIn, bool fExplicit)\n{\n if (nWalletVersion >= nVersion)\n return true;\n\n \/\/ when doing an explicit upgrade, if we pass the max version permitted, upgrade all the way\n if (fExplicit && nVersion > nWalletMaxVersion)\n nVersion = FEATURE_LATEST;\n\n nWalletVersion = nVersion;\n\n if (nVersion > nWalletMaxVersion)\n nWalletMaxVersion = nVersion;\n\n if (fFileBacked)\n {\n CWalletDB* pwalletdb = pwalletdbIn ? pwalletdbIn : new CWalletDB(strWalletFile);\n if (nWalletVersion >= 40000)\n {\n \/\/ Versions prior to 0.4.0 did not support the \"minversion\" record.\n \/\/ Use a CCorruptAddress to make them crash instead.\n CCorruptAddress corruptAddress;\n pwalletdb->WriteSetting(\"addrIncoming\", corruptAddress);\n }\n if (nWalletVersion > 40000)\n pwalletdb->WriteMinVersion(nWalletVersion);\n if (!pwalletdbIn)\n delete pwalletdb;\n }\n\n return true;\n}\n\nbool CWallet::SetMaxVersion(int nVersion)\n{\n \/\/ cannot downgrade below current version\n if (nWalletVersion > nVersion)\n return false;\n\n nWalletMaxVersion = nVersion;\n\n return true;\n}\n\nbool CWallet::EncryptWallet(const SecureString& strWalletPassphrase)\n{\n if (IsCrypted())\n return false;\n\n CKeyingMaterial vMasterKey;\n RandAddSeedPerfmon();\n\n vMasterKey.resize(WALLET_CRYPTO_KEY_SIZE);\n RAND_bytes(&vMasterKey[0], WALLET_CRYPTO_KEY_SIZE);\n\n CMasterKey kMasterKey;\n\n RandAddSeedPerfmon();\n kMasterKey.vchSalt.resize(WALLET_CRYPTO_SALT_SIZE);\n RAND_bytes(&kMasterKey.vchSalt[0], WALLET_CRYPTO_SALT_SIZE);\n\n CCrypter crypter;\n int64 nStartTime = GetTimeMillis();\n crypter.SetKeyFromPassphrase(strWalletPassphrase, kMasterKey.vchSalt, 25000, kMasterKey.nDerivationMethod);\n kMasterKey.nDeriveIterations = 2500000 \/ ((double)(GetTimeMillis() - nStartTime));\n\n nStartTime = GetTimeMillis();\n crypter.SetKeyFromPassphrase(strWalletPassphrase, kMasterKey.vchSalt, kMasterKey.nDeriveIterations, kMasterKey.nDerivationMethod);\n kMasterKey.nDeriveIterations = (kMasterKey.nDeriveIterations + kMasterKey.nDeriveIterations * 100 \/ ((double)(GetTimeMillis() - nStartTime))) \/ 2;\n\n if (kMasterKey.nDeriveIterations < 25000)\n kMasterKey.nDeriveIterations = 25000;\n\n printf(\"Encrypting Wallet with an nDeriveIterations of %i\\n\", kMasterKey.nDeriveIterations);\n\n if (!crypter.SetKeyFromPassphrase(strWalletPassphrase, kMasterKey.vchSalt, kMasterKey.nDeriveIterations, kMasterKey.nDerivationMethod))\n return false;\n if (!crypter.Encrypt(vMasterKey, kMasterKey.vchCryptedKey))\n return false;\n\n {\n LOCK(cs_wallet);\n mapMasterKeys[++nMasterKeyMaxID] = kMasterKey;\n if (fFileBacked)\n {\n pwalletdbEncryption = new CWalletDB(strWalletFile);\n if (!pwalletdbEncryption->TxnBegin())\n return false;\n pwalletdbEncryption->WriteMasterKey(nMasterKeyMaxID, kMasterKey);\n }\n\n if (!EncryptKeys(vMasterKey))\n {\n if (fFileBacked)\n pwalletdbEncryption->TxnAbort();\n exit(1); \/\/We now probably have half of our keys encrypted in memory, and half not...die and let the user reload their unencrypted wallet.\n }\n\n \/\/ Encryption was introduced in version 0.4.0\n SetMinVersion(FEATURE_WALLETCRYPT, pwalletdbEncryption, true);\n\n if (fFileBacked)\n {\n if (!pwalletdbEncryption->TxnCommit())\n exit(1); \/\/We now have keys encrypted in memory, but no on disk...die to avoid confusion and let the user reload their unencrypted wallet.\n\n delete pwalletdbEncryption;\n pwalletdbEncryption = NULL;\n }\n\n Lock();\n Unlock(strWalletPassphrase);\n NewKeyPool();\n Lock();\n\n \/\/ Need to completely rewrite the wallet file; if we don't, bdb might keep\n \/\/ bits of the unencrypted private key in slack space in the database file.\n CDB::Rewrite(strWalletFile);\n\n }\n NotifyStatusChanged(this);\n\n return true;\n}\n\nint64 CWallet::IncOrderPosNext(CWalletDB *pwalletdb)\n{\n int64 nRet = nOrderPosNext++;\n if (pwalletdb) {\n pwalletdb->WriteOrderPosNext(nOrderPosNext);\n } else {\n CWalletDB(strWalletFile).WriteOrderPosNext(nOrderPosNext);\n }\n return nRet;\n}\n\nCWallet::TxItems CWallet::OrderedTxItems(std::list& acentries, std::string strAccount)\n{\n CWalletDB walletdb(strWalletFile);\n\n \/\/ First: get all CWalletTx and CAccountingEntry into a sorted-by-order multimap.\n TxItems txOrdered;\n\n \/\/ Note: maintaining indices in the database of (account,time) --> txid and (account, time) --> acentry\n \/\/ would make this much faster for applications that do this a lot.\n for (map::iterator it = mapWallet.begin(); it != mapWallet.end(); ++it)\n {\n CWalletTx* wtx = &((*it).second);\n txOrdered.insert(make_pair(wtx->nOrderPos, TxPair(wtx, (CAccountingEntry*)0)));\n }\n acentries.clear();\n walletdb.ListAccountCreditDebit(strAccount, acentries);\n BOOST_FOREACH(CAccountingEntry& entry, acentries)\n {\n txOrdered.insert(make_pair(entry.nOrderPos, TxPair((CWalletTx*)0, &entry)));\n }\n\n return txOrdered;\n}\n\nvoid CWallet::WalletUpdateSpent(const CTransaction &tx)\n{\n \/\/ Anytime a signature is successfully verified, it's proof the outpoint is spent.\n \/\/ Update the wallet spent flag if it doesn't know due to wallet.dat being\n \/\/ restored from backup or the user making copies of wallet.dat.\n {\n LOCK(cs_wallet);\n BOOST_FOREACH(const CTxIn& txin, tx.vin)\n {\n map::iterator mi = mapWallet.find(txin.prevout.hash);\n if (mi != mapWallet.end())\n {\n CWalletTx& wtx = (*mi).second;\n if (txin.prevout.n >= wtx.vout.size())\n printf(\"WalletUpdateSpent: bad wtx %s\\n\", wtx.GetHash().ToString().c_str());\n else if (!wtx.IsSpent(txin.prevout.n) && IsMine(wtx.vout[txin.prevout.n]))\n {\n printf(\"WalletUpdateSpent found spent coin %s UNIFY %s\\n\", FormatMoney(wtx.GetCredit()).c_str(), wtx.GetHash().ToString().c_str());\n wtx.MarkSpent(txin.prevout.n);\n wtx.WriteToDisk();\n NotifyTransactionChanged(this, txin.prevout.hash, CT_UPDATED);\n }\n }\n }\n }\n}\n\nvoid CWallet::MarkDirty()\n{\n {\n LOCK(cs_wallet);\n BOOST_FOREACH(PAIRTYPE(const uint256, CWalletTx)& item, mapWallet)\n item.second.MarkDirty();\n }\n}\n\nbool CWallet::AddToWallet(const CWalletTx& wtxIn)\n{\n uint256 hash = wtxIn.GetHash();\n {\n LOCK(cs_wallet);\n \/\/ Inserts only if not already there, returns tx inserted or tx found\n pair::iterator, bool> ret = mapWallet.insert(make_pair(hash, wtxIn));\n CWalletTx& wtx = (*ret.first).second;\n wtx.BindWallet(this);\n bool fInsertedNew = ret.second;\n if (fInsertedNew)\n {\n wtx.nTimeReceived = GetAdjustedTime();\n wtx.nOrderPos = IncOrderPosNext();\n\n wtx.nTimeSmart = wtx.nTimeReceived;\n if (wtxIn.hashBlock != 0)\n {\n if (mapBlockIndex.count(wtxIn.hashBlock))\n {\n unsigned int latestNow = wtx.nTimeReceived;\n unsigned int latestEntry = 0;\n {\n \/\/ Tolerate times up to the last timestamp in the wallet not more than 5 minutes into the future\n int64 latestTolerated = latestNow + 300;\n std::list acentries;\n TxItems txOrdered = OrderedTxItems(acentries);\n for (TxItems::reverse_iterator it = txOrdered.rbegin(); it != txOrdered.rend(); ++it)\n {\n CWalletTx *const pwtx = (*it).second.first;\n if (pwtx == &wtx)\n continue;\n CAccountingEntry *const pacentry = (*it).second.second;\n int64 nSmartTime;\n if (pwtx)\n {\n nSmartTime = pwtx->nTimeSmart;\n if (!nSmartTime)\n nSmartTime = pwtx->nTimeReceived;\n }\n else\n nSmartTime = pacentry->nTime;\n if (nSmartTime <= latestTolerated)\n {\n latestEntry = nSmartTime;\n if (nSmartTime > latestNow)\n latestNow = nSmartTime;\n break;\n }\n }\n }\n\n unsigned int& blocktime = mapBlockIndex[wtxIn.hashBlock]->nTime;\n wtx.nTimeSmart = std::max(latestEntry, std::min(blocktime, latestNow));\n \/\/ PoS: for old transactions, set the nTime to block time\n if (wtx.nTime == 0)\n wtx.nTime = blocktime;\n }\n else\n printf(\"AddToWallet() : found %s in block %s not in index\\n\",\n wtxIn.GetHash().ToString().c_str(),\n wtxIn.hashBlock.ToString().c_str());\n }\n }\n\n bool fUpdated = false;\n if (!fInsertedNew)\n {\n \/\/ Merge\n if (wtxIn.hashBlock != 0 && wtxIn.hashBlock != wtx.hashBlock)\n {\n wtx.hashBlock = wtxIn.hashBlock;\n fUpdated = true;\n }\n if (wtxIn.nIndex != -1 && (wtxIn.vMerkleBranch != wtx.vMerkleBranch || wtxIn.nIndex != wtx.nIndex))\n {\n wtx.vMerkleBranch = wtxIn.vMerkleBranch;\n wtx.nIndex = wtxIn.nIndex;\n fUpdated = true;\n }\n if (wtxIn.fFromMe && wtxIn.fFromMe != wtx.fFromMe)\n {\n wtx.fFromMe = wtxIn.fFromMe;\n fUpdated = true;\n }\n fUpdated |= wtx.UpdateSpent(wtxIn.vfSpent);\n }\n\n \/\/\/\/ debug print\n printf(\"AddToWallet %s %s%s\\n\", wtxIn.GetHash().ToString().c_str(), (fInsertedNew ? \"new\" : \"\"), (fUpdated ? \"update\" : \"\"));\n\n \/\/ Write to disk\n if (fInsertedNew || fUpdated)\n if (!wtx.WriteToDisk())\n return false;\n#ifndef QT_GUI\n \/\/ If default receiving address gets used, replace it with a new one\n if (vchDefaultKey.IsValid()) {\n CScript scriptDefaultKey;\n scriptDefaultKey.SetDestination(vchDefaultKey.GetID());\n BOOST_FOREACH(const CTxOut& txout, wtx.vout)\n {\n if (txout.scriptPubKey == scriptDefaultKey)\n {\n CPubKey newDefaultKey;\n if (GetKeyFromPool(newDefaultKey, false))\n {\n SetDefaultKey(newDefaultKey);\n SetAddressBookName(vchDefaultKey.GetID(), \"\");\n }\n }\n }\n }\n#endif\n \/\/ since AddToWallet is called directly for self-originating transactions, check for consumption of own coins\n WalletUpdateSpent(wtx);\n\n \/\/ Notify UI of new or updated transaction\n NotifyTransactionChanged(this, hash, fInsertedNew ? CT_NEW : CT_UPDATED);\n\n \/\/ notify an external script when a wallet transaction comes in or is updated\n std::string strCmd = GetArg(\"-walletnotify\", \"\");\n\n if ( !strCmd.empty())\n {\n boost::replace_all(strCmd, \"%s\", wtxIn.GetHash().GetHex());\n boost::thread t(runCommand, strCmd); \/\/ thread runs free\n }\n\n \/\/ notify an external script when a coinstake transaction is created\n strCmd = GetArg(\"-stakenotify\", \"\");\n\n if ( !strCmd.empty() && wtxIn.IsCoinStake())\n {\n boost::replace_all(strCmd, \"%s\", wtxIn.GetHash().GetHex());\n boost::thread t(runCommand, strCmd); \/\/ thread runs free\n }\n }\n return true;\n}\n\n\/\/ Add a transaction to the wallet, or update it.\n\/\/ pblock is optional, but should be provided if the transaction is known to be in a block.\n\/\/ If fUpdate is true, existing transactions will be updated.\nbool CWallet::AddToWalletIfInvolvingMe(const uint256 &hash, const CTransaction& tx, const CBlock* pblock, bool fUpdate, bool fFindBlock)\n{\n {\n LOCK(cs_wallet);\n bool fExisted = mapWallet.count(hash);\n if (fExisted && !fUpdate) return false;\n if (fExisted || IsMine(tx) || IsFromMe(tx))\n {\n CWalletTx wtx(this,tx);\n \/\/ Get merkle branch if transaction was found in a block\n if (pblock)\n wtx.SetMerkleBranch(pblock);\n return AddToWallet(wtx);\n }\n else\n WalletUpdateSpent(tx);\n }\n return false;\n}\n\nbool CWallet::EraseFromWallet(uint256 hash)\n{\n if (!fFileBacked)\n return false;\n {\n LOCK(cs_wallet);\n if (mapWallet.erase(hash))\n CWalletDB(strWalletFile).EraseTx(hash);\n }\n return true;\n}\n\n\nbool CWallet::IsMine(const CTxIn &txin) const\n{\n {\n LOCK(cs_wallet);\n map::const_iterator mi = mapWallet.find(txin.prevout.hash);\n if (mi != mapWallet.end())\n {\n const CWalletTx& prev = (*mi).second;\n if (txin.prevout.n < prev.vout.size())\n if (IsMine(prev.vout[txin.prevout.n]))\n return true;\n }\n }\n return false;\n}\n\nint64 CWallet::GetDebit(const CTxIn &txin) const\n{\n {\n LOCK(cs_wallet);\n map::const_iterator mi = mapWallet.find(txin.prevout.hash);\n if (mi != mapWallet.end())\n {\n const CWalletTx& prev = (*mi).second;\n if (txin.prevout.n < prev.vout.size())\n if (IsMine(prev.vout[txin.prevout.n]))\n return prev.vout[txin.prevout.n].nValue;\n }\n }\n return 0;\n}\n\nbool CWallet::IsChange(const CTxOut& txout) const\n{\n CTxDestination address;\n\n \/\/ TODO: fix handling of 'change' outputs. The assumption is that any\n \/\/ payment to a TX_PUBKEYHASH that is mine but isn't in the address book\n \/\/ is change. That assumption is likely to break when we implement multisignature\n \/\/ wallets that return change back into a multi-signature-protected address;\n \/\/ a better way of identifying which outputs are 'the send' and which are\n \/\/ 'the change' will need to be implemented (maybe extend CWalletTx to remember\n \/\/ which output, if any, was change).\n \n if (ExtractDestination(txout.scriptPubKey, address) && ::IsMine(*this, address))\n {\n LOCK(cs_wallet);\n if (!mapAddressBook.count(address))\n return true;\n }\n return false;\n}\n\nint64 CWalletTx::GetTxTime() const\n{\n int64 n = nTimeSmart;\n return n ? n : nTimeReceived;\n}\n\nint CWalletTx::GetRequestCount() const\n{\n \/\/ Returns -1 if it wasn't being tracked\n int nRequests = -1;\n {\n LOCK(pwallet->cs_wallet);\n if (IsCoinBase() || IsCoinStake())\n {\n \/\/ Generated block\n if (hashBlock != 0)\n {\n map::const_iterator mi = pwallet->mapRequestCount.find(hashBlock);\n if (mi != pwallet->mapRequestCount.end())\n nRequests = (*mi).second;\n }\n }\n else\n {\n \/\/ Did anyone request this transaction?\n map::const_iterator mi = pwallet->mapRequestCount.find(GetHash());\n if (mi != pwallet->mapRequestCount.end())\n {\n nRequests = (*mi).second;\n\n \/\/ How about the block it's in?\n if (nRequests == 0 && hashBlock != 0)\n {\n map::const_iterator mi = pwallet->mapRequestCount.find(hashBlock);\n if (mi != pwallet->mapRequestCount.end())\n nRequests = (*mi).second;\n else\n nRequests = 1; \/\/ If it's in someone else's block it must have got out\n }\n }\n }\n }\n return nRequests;\n}\n\nvoid CWalletTx::GetAmounts(list >& listReceived,\n list >& listSent, int64& nFee, string& strSentAccount) const\n{\n nFee = 0;\n listReceived.clear();\n listSent.clear();\n strSentAccount = strFromAccount;\n\n \/\/ Compute fee:\n int64 nDebit = GetDebit();\n if (nDebit > 0) \/\/ debit>0 means we signed\/sent this transaction\n {\n int64 nValueOut = GetValueOut();\n nFee = nDebit - nValueOut;\n }\n\n \/\/ Sent\/received.\n BOOST_FOREACH(const CTxOut& txout, vout)\n {\n \/\/ ppcoin: Skip special stake out\n if (txout.scriptPubKey.empty())\n continue;\n\n bool fIsMine;\n \/\/ Only need to handle txouts if AT LEAST one of these is true:\n \/\/ 1) they debit from us (sent)\n \/\/ 2) the output is to us (received)\n if (nDebit > 0)\n {\n \/\/ Don't report 'change' txouts\n if (pwallet->IsChange(txout))\n continue;\n fIsMine = pwallet->IsMine(txout);\n }\n else if (!(fIsMine = pwallet->IsMine(txout)))\n continue;\n\n \/\/ In either case, we need to get the destination address\n CTxDestination address;\n if (!ExtractDestination(txout.scriptPubKey, address))\n {\n printf(\"CWalletTx::GetAmounts: Unknown transaction type found, txid %s\\n\",\n this->GetHash().ToString().c_str());\n address = CNoDestination();\n }\n\n \/\/ If we are debited by the transaction, add the output as a \"sent\" entry\n if (nDebit > 0)\n listSent.push_back(make_pair(address, txout.nValue));\n\n \/\/ If we are receiving the output, add it as a \"received\" entry\n if (fIsMine)\n listReceived.push_back(make_pair(address, txout.nValue));\n }\n\n}\n\nvoid CWalletTx::GetAccountAmounts(const string& strAccount, int64& nReceived,\n int64& nSent, int64& nFee) const\n{\n nReceived = nSent = nFee = 0;\n\n int64 allFee;\n string strSentAccount;\n list > listReceived;\n list > listSent;\n GetAmounts(listReceived, listSent, allFee, strSentAccount);\n\n if (strAccount == strSentAccount)\n {\n BOOST_FOREACH(const PAIRTYPE(CTxDestination,int64)& s, listSent)\n nSent += s.second;\n nFee = allFee;\n }\n {\n LOCK(pwallet->cs_wallet);\n BOOST_FOREACH(const PAIRTYPE(CTxDestination,int64)& r, listReceived)\n {\n if (pwallet->mapAddressBook.count(r.first))\n {\n map::const_iterator mi = pwallet->mapAddressBook.find(r.first);\n if (mi != pwallet->mapAddressBook.end() && (*mi).second == strAccount)\n nReceived += r.second;\n }\n else if (strAccount.empty())\n {\n nReceived += r.second;\n }\n }\n }\n}\n\nvoid CWalletTx::AddSupportingTransactions()\n{\n vtxPrev.clear();\n\n const int COPY_DEPTH = 3;\n if (SetMerkleBranch() < COPY_DEPTH)\n {\n vector vWorkQueue;\n BOOST_FOREACH(const CTxIn& txin, vin)\n vWorkQueue.push_back(txin.prevout.hash);\n\n {\n LOCK(pwallet->cs_wallet);\n map mapWalletPrev;\n set setAlreadyDone;\n for (unsigned int i = 0; i < vWorkQueue.size(); i++)\n {\n uint256 hash = vWorkQueue[i];\n if (setAlreadyDone.count(hash))\n continue;\n setAlreadyDone.insert(hash);\n\n CMerkleTx tx;\n map::const_iterator mi = pwallet->mapWallet.find(hash);\n if (mi != pwallet->mapWallet.end())\n {\n tx = (*mi).second;\n BOOST_FOREACH(const CMerkleTx& txWalletPrev, (*mi).second.vtxPrev)\n mapWalletPrev[txWalletPrev.GetHash()] = &txWalletPrev;\n }\n else if (mapWalletPrev.count(hash))\n {\n tx = *mapWalletPrev[hash];\n }\n else\n {\n continue;\n }\n\n int nDepth = tx.SetMerkleBranch();\n vtxPrev.push_back(tx);\n\n if (nDepth < COPY_DEPTH)\n {\n BOOST_FOREACH(const CTxIn& txin, tx.vin)\n vWorkQueue.push_back(txin.prevout.hash);\n }\n }\n }\n }\n\n reverse(vtxPrev.begin(), vtxPrev.end());\n}\n\nbool CWalletTx::WriteToDisk()\n{\n return CWalletDB(pwallet->strWalletFile).WriteTx(GetHash(), *this);\n}\n\n\/\/ Scan the block chain (starting in pindexStart) for transactions\n\/\/ from or to us. If fUpdate is true, found transactions that already\n\/\/ exist in the wallet will be updated.\nint CWallet::ScanForWalletTransactions(CBlockIndex* pindexStart, bool fUpdate)\n{\n int ret = 0;\n\n CBlockIndex* pindex = pindexStart;\n {\n LOCK(cs_wallet);\n while (pindex)\n {\n CBlock block;\n block.ReadFromDisk(pindex);\n BOOST_FOREACH(CTransaction& tx, block.vtx)\n {\n if (AddToWalletIfInvolvingMe(tx.GetHash(), tx, &block, fUpdate))\n ret++;\n }\n pindex = pindex->pnext;\n }\n }\n return ret;\n}\n\nvoid CWallet::ReacceptWalletTransactions()\n{\n bool fRepeat = true;\n while (fRepeat)\n {\n LOCK(cs_wallet);\n fRepeat = false;\n bool fMissing = false;\n BOOST_FOREACH(PAIRTYPE(const uint256, CWalletTx)& item, mapWallet)\n {\n CWalletTx& wtx = item.second;\n if ((wtx.IsCoinBase() && wtx.IsSpent(0)) || (wtx.IsCoinStake() && wtx.IsSpent(1)))\n continue;\n\n CCoins coins;\n bool fUpdated = false;\n bool fFound = pcoinsTip->GetCoins(wtx.GetHash(), coins);\n if (fFound || wtx.GetDepthInMainChain() > 0)\n {\n \/\/ Update fSpent if a tx got spent somewhere else by a copy of wallet.dat\n for (unsigned int i = 0; i < wtx.vout.size(); i++)\n {\n if (wtx.IsSpent(i))\n continue;\n if ((i >= coins.vout.size() || coins.vout[i].IsNull()) && IsMine(wtx.vout[i]))\n {\n wtx.MarkSpent(i);\n fUpdated = true;\n fMissing = true;\n }\n }\n if (fUpdated)\n {\n printf(\"ReacceptWalletTransactions found spent coin %s UNIFY %s\\n\", FormatMoney(wtx.GetCredit()).c_str(), wtx.GetHash().ToString().c_str());\n wtx.MarkDirty();\n wtx.WriteToDisk();\n }\n }\n else\n {\n \/\/ Re-accept any txes of ours that aren't already in a block\n if (!wtx.IsCoinBase() && !wtx.IsCoinStake())\n wtx.AcceptWalletTransaction(false);\n }\n }\n if (fMissing)\n {\n \/\/ TODO: optimize this to scan just part of the block chain?\n if (ScanForWalletTransactions(pindexGenesisBlock))\n fRepeat = true; \/\/ Found missing transactions: re-do re-accept.\n }\n }\n}\n\nvoid CWalletTx::RelayWalletTransaction()\n{\n BOOST_FOREACH(const CMerkleTx& tx, vtxPrev)\n {\n \/\/ Important: versions of bitcoin before 0.8.6 had a bug that inserted\n \/\/ empty transactions into the vtxPrev, which will cause the node to be\n \/\/ banned when retransmitted, hence the check for !tx.vin.empty()\n if (!tx.IsCoinBase() && !tx.IsCoinStake() && !tx.vin.empty())\n if (tx.GetDepthInMainChain() == 0)\n RelayTransaction((CTransaction)tx, tx.GetHash());\n }\n if (!IsCoinBase() && !IsCoinStake())\n {\n if (GetDepthInMainChain() == 0) {\n uint256 hash = GetHash();\n printf(\"Relaying wtx %s\\n\", hash.ToString().c_str());\n RelayTransaction((CTransaction)*this, hash);\n }\n }\n}\n\nvoid CWallet::ResendWalletTransactions()\n{\n \/\/ Do this infrequently and randomly to avoid giving away\n \/\/ that these are our transactions.\n static int64 nNextTime;\n if (GetTime() < nNextTime)\n return;\n bool fFirst = (nNextTime == 0);\n nNextTime = GetTime() + GetRand(30 * 60);\n if (fFirst)\n return;\n\n \/\/ Only do it if there's been a new block since last time\n static int64 nLastTime;\n if (nTimeBestReceived < nLastTime)\n return;\n nLastTime = GetTime();\n\n \/\/ Rebroadcast any of our txes that aren't in a block yet\n printf(\"ResendWalletTransactions()\\n\");\n {\n LOCK(cs_wallet);\n \/\/ Sort them in chronological order\n multimap mapSorted;\n BOOST_FOREACH(PAIRTYPE(const uint256, CWalletTx)& item, mapWallet)\n {\n CWalletTx& wtx = item.second;\n \/\/ Don't rebroadcast until it's had plenty of time that\n \/\/ it should have gotten in already by now.\n if (nTimeBestReceived - (int64)wtx.nTimeReceived > 5 * 60)\n mapSorted.insert(make_pair(wtx.nTimeReceived, &wtx));\n }\n BOOST_FOREACH(PAIRTYPE(const unsigned int, CWalletTx*)& item, mapSorted)\n {\n CWalletTx& wtx = *item.second;\n wtx.RelayWalletTransaction();\n }\n }\n}\n\n\n\n\n\n\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\/\/\n\/\/ Actions\n\/\/\nconst std::string& CWallet::GetAccountName(const CScript& scriptPubKey) const\n{\n CTxDestination address;\n if (ExtractDestination(scriptPubKey, address)) {\n map::const_iterator mi = mapAddressBook.find(address);\n if (mi != mapAddressBook.end()) {\n return (*mi).second;\n }\n }\n \/\/ A scriptPubKey that doesn't have an entry in the address book is\n \/\/ associated with the default account (\"\").\n const static std::string DEFAULT_ACCOUNT_NAME;\n return DEFAULT_ACCOUNT_NAME;\n}\n\nint64 CWallet::GetLegacyBalance(int minDepth, const std::string* account) const\n{\n int64 balance = 0;\n LOCK(cs_wallet);\n for (map::const_iterator it = mapWallet.begin(); it != mapWallet.end(); ++it)\n {\n const CWalletTx& wtx = (*it).second;\n const int depth = wtx.GetDepthInMainChain();\n if (depth < 0 || !wtx.IsConfirmed() || wtx.GetBlocksToMaturity() > 0) {\n continue;\n }\n\n \/\/ Loop through tx outputs and add incoming payments. For outgoing txs,\n \/\/ treat change outputs specially, as part of the amount debited.\n int64 debit = wtx.GetDebit();\n\tcout << \">>>HOOK: fromAccount = \" << wtx.strFromAccount << endl;\n\tcout << wtx.ToString() << endl;\n const bool outgoing = debit > 0;\n\tif(outgoing)\n\t{\n\t const CTxIn& in = *(wtx.vin.begin());\n\t cout << \">>>HOOK: fromAccount = \" << GetAccountName(in.scriptSig) << endl;\n\t}\n\tfor (vector::const_iterator it = wtx.vout.begin(); it != wtx.vout.end(); ++it)\n\t{\n\t const CTxOut& out = (*it);\n\t CTxDestination address;\n\t bool extract = ExtractDestination(out.scriptPubKey, address);\n\t bool isMine = ::IsMine(*this, out.scriptPubKey);\n\t string accountName = GetAccountName(out.scriptPubKey);\n\t cout << \">>>HOOK: scriptPubKey = \" << out.scriptPubKey.ToString() << endl;\n\t cout << \">>>HOOK: accountName = \" << accountName << endl;\n\t cout << \">>>HOOK: isMine = \" << isMine<< endl;\n\t cout << \">>>HOOK: outgoing = \" << outgoing << \", extract = \" << extract << endl;\n\t cout << \">>> HOOK: out.nValue = \" << out.nValue << endl;\n if (outgoing && IsChange(out)) {\n debit -= out.nValue;\n\t\tcout << \">>> HOOK: debit = \" << debit << endl;\n } else if (IsMine(out) && depth >= minDepth && (!account || *account == GetAccountName(out.scriptPubKey))) {\n balance += out.nValue;\n } else {\n\t\tcout << \">>>HOOK: EngEng!!!\" << endl;\n\t }\n }\n\n \/\/ For outgoing txs, subtract amount debited.\n if (outgoing && (!account || *account == wtx.strFromAccount)) {\n balance -= debit;\n }\n\tcout << \">>>HOOK: balance = \" << balance << endl;\n }\n\n if (account) {\n balance += CWalletDB(strWalletFile).GetAccountCreditDebit(*account);\n }\n cout << \">>>HOOK: legacy_balance = \" << balance << endl;\n return balance;\n}\n\nint64 CWallet::GetBalance() const\n{\n int64 nTotal = 0;\n {\n LOCK(cs_wallet);\n for (map::const_iterator it = mapWallet.begin(); it != mapWallet.end(); ++it)\n {\n const CWalletTx* pcoin = &(*it).second;\n if (pcoin->IsConfirmed())\n nTotal += pcoin->GetAvailableCredit();\n }\n }\n\n return nTotal;\n}\n\nint64 CWallet::GetUnconfirmedBalance() const\n{\n int64 nTotal = 0;\n {\n LOCK(cs_wallet);\n for (map::const_iterator it = mapWallet.begin(); it != mapWallet.end(); ++it)\n {\n const CWalletTx* pcoin = &(*it).second;\n if (!pcoin->IsFinal() || !pcoin->IsConfirmed())\n nTotal += pcoin->GetAvailableCredit();\n }\n }\n return nTotal;\n}\n\nint64 CWallet::GetImmatureBalance() const\n{\n int64 nTotal = 0;\n {\n LOCK(cs_wallet);\n for (map::const_iterator it = mapWallet.begin(); it != mapWallet.end(); ++it)\n {\n const CWalletTx* pcoin = &(*it).second;\n nTotal += pcoin->GetImmatureCredit();\n }\n }\n return nTotal;\n}\n\n\/\/ populate vCoins with vector of spendable COutputs\nvoid CWallet::AvailableCoins(vector& vCoins, bool fOnlyConfirmed, const CCoinControl *coinControl) const\n{\n vCoins.clear();\n\n {\n LOCK(cs_wallet);\n for (map::const_iterator it = mapWallet.begin(); it != mapWallet.end(); ++it)\n {\n const CWalletTx* pcoin = &(*it).second;\n\n if (!pcoin->IsFinal())\n continue;\n\n if (fOnlyConfirmed && !pcoin->IsConfirmed())\n continue;\n\n if ((pcoin->IsCoinBase() || pcoin->IsCoinStake()) && pcoin->GetBlocksToMaturity() > 0)\n continue;\n\n int nDepth = pcoin->GetDepthInMainChain();\n if (nDepth < 0)\n continue;\n\n for (unsigned int i = 0; i < pcoin->vout.size(); i++) {\n if (!(pcoin->IsSpent(i)) && IsMine(pcoin->vout[i]) &&\n !IsLockedCoin((*it).first, i) && pcoin->vout[i].nValue >= nMinimumInputValue &&\n (!coinControl || !coinControl->HasSelected() || coinControl->IsSelected((*it).first, i))) \n vCoins.push_back(COutput(pcoin, i, nDepth));\n }\n }\n }\n}\n\nvoid CWallet::AvailableCoinsMinConf(vector& vCoins, int nConf) const\n{\n vCoins.clear();\n\n {\n LOCK(cs_wallet);\n for (map::const_iterator it = mapWallet.begin(); it != mapWallet.end(); ++it)\n {\n const CWalletTx* pcoin = &(*it).second;\n\n if (!pcoin->IsFinal())\n continue;\n\n if(pcoin->GetDepthInMainChain() < nConf)\n continue;\n\n for (unsigned int i = 0; i < pcoin->vout.size(); i++)\n if (!(pcoin->IsSpent(i)) && IsMine(pcoin->vout[i]) &&\n !IsLockedCoin((*it).first, i) && pcoin->vout[i].nValue >= nMinimumInputValue)\n vCoins.push_back(COutput(pcoin, i, pcoin->GetDepthInMainChain()));\n }\n }\n}\n\nstatic void ApproximateBestSubset(vector > >vValue, int64 nTotalLower, int64 nTargetValue,\n vector& vfBest, int64& nBest, int iterations = 1000)\n{\n vector vfIncluded;\n\n vfBest.assign(vValue.size(), true);\n nBest = nTotalLower;\n\n seed_insecure_rand();\n\n for (int nRep = 0; nRep < iterations && nBest != nTargetValue; nRep++)\n {\n vfIncluded.assign(vValue.size(), false);\n int64 nTotal = 0;\n bool fReachedTarget = false;\n for (int nPass = 0; nPass < 2 && !fReachedTarget; nPass++)\n {\n for (unsigned int i = 0; i < vValue.size(); i++)\n {\n \/\/The solver here uses a randomized algorithm,\n \/\/the randomness serves no real security purpose but is just\n \/\/needed to prevent degenerate behavior and it is important\n \/\/that the rng fast. We do not use a constant random sequence,\n \/\/because there may be some privacy improvement by making\n \/\/the selection random.\n if (nPass == 0 ? insecure_rand()&1 : !vfIncluded[i])\n {\n nTotal += vValue[i].first;\n vfIncluded[i] = true;\n if (nTotal >= nTargetValue)\n {\n fReachedTarget = true;\n if (nTotal < nBest)\n {\n nBest = nTotal;\n vfBest = vfIncluded;\n }\n nTotal -= vValue[i].first;\n vfIncluded[i] = false;\n }\n }\n }\n }\n }\n}\n\n\/\/ ppcoin: total coins staked (non-spendable until maturity)\nint64 CWallet::GetStake() const\n{\n int64 nTotal = 0;\n LOCK(cs_wallet);\n for (map::const_iterator it = mapWallet.begin(); it != mapWallet.end(); ++it)\n {\n const CWalletTx* pcoin = &(*it).second;\n if (pcoin->IsCoinStake() && pcoin->GetBlocksToMaturity() > 0 && pcoin->GetDepthInMainChain() > 0)\n nTotal += CWallet::GetCredit(*pcoin);\n }\n return nTotal;\n}\n\nbool CWallet::SelectCoinsMinConf(int64 nTargetValue, int nConfMine, int nConfTheirs, vector vCoins,\n set >& setCoinsRet, int64& nValueRet) const\n{\n setCoinsRet.clear();\n nValueRet = 0;\n\n \/\/ List of values less than target\n pair > coinLowestLarger;\n coinLowestLarger.first = std::numeric_limits::max();\n coinLowestLarger.second.first = NULL;\n vector > > vValue;\n int64 nTotalLower = 0;\n\n random_shuffle(vCoins.begin(), vCoins.end(), GetRandInt);\n\n BOOST_FOREACH(COutput output, vCoins)\n {\n const CWalletTx *pcoin = output.tx;\n\n if (output.nDepth < (pcoin->IsFromMe() ? nConfMine : nConfTheirs))\n continue;\n\n int i = output.i;\n int64 n = pcoin->vout[i].nValue;\n\n pair > coin = make_pair(n,make_pair(pcoin, i));\n\n if (n == nTargetValue)\n {\n setCoinsRet.insert(coin.second);\n nValueRet += coin.first;\n return true;\n }\n else if (n < nTargetValue + CENT)\n {\n vValue.push_back(coin);\n nTotalLower += n;\n }\n else if (n < coinLowestLarger.first)\n {\n coinLowestLarger = coin;\n }\n }\n\n if (nTotalLower == nTargetValue)\n {\n for (unsigned int i = 0; i < vValue.size(); ++i)\n {\n setCoinsRet.insert(vValue[i].second);\n nValueRet += vValue[i].first;\n }\n return true;\n }\n\n if (nTotalLower < nTargetValue)\n {\n if (coinLowestLarger.second.first == NULL)\n return false;\n setCoinsRet.insert(coinLowestLarger.second);\n nValueRet += coinLowestLarger.first;\n return true;\n }\n\n \/\/ Solve subset sum by stochastic approximation\n sort(vValue.rbegin(), vValue.rend(), CompareValueOnly());\n vector vfBest;\n int64 nBest;\n\n ApproximateBestSubset(vValue, nTotalLower, nTargetValue, vfBest, nBest, 1000);\n if (nBest != nTargetValue && nTotalLower >= nTargetValue + CENT)\n ApproximateBestSubset(vValue, nTotalLower, nTargetValue + CENT, vfBest, nBest, 1000);\n\n \/\/ If we have a bigger coin and (either the stochastic approximation didn't find a good solution,\n \/\/ or the next bigger coin is closer), return the bigger coin\n if (coinLowestLarger.second.first &&\n ((nBest != nTargetValue && nBest < nTargetValue + CENT) || coinLowestLarger.first <= nBest))\n {\n setCoinsRet.insert(coinLowestLarger.second);\n nValueRet += coinLowestLarger.first;\n }\n else {\n for (unsigned int i = 0; i < vValue.size(); i++)\n if (vfBest[i])\n {\n setCoinsRet.insert(vValue[i].second);\n nValueRet += vValue[i].first;\n }\n\n \/\/\/\/ debug print\n printf(\"SelectCoins() best subset: \");\n for (unsigned int i = 0; i < vValue.size(); i++)\n if (vfBest[i])\n printf(\"%s \", FormatMoney(vValue[i].first).c_str());\n printf(\"total %s\\n\", FormatMoney(nBest).c_str());\n }\n\n return true;\n}\n\nbool CWallet::SelectCoins(int64 nTargetValue, set >& setCoinsRet, int64& nValueRet, const CCoinControl* coinControl) const\n{\n vector vCoins;\n AvailableCoins(vCoins, true, coinControl);\n \n \/\/ coin control -> return all selected outputs (we want all selected to go into the transaction for sure)\n if (coinControl && coinControl->HasSelected())\n {\n BOOST_FOREACH(const COutput& out, vCoins)\n {\n nValueRet += out.tx->vout[out.i].nValue;\n setCoinsRet.insert(make_pair(out.tx, out.i));\n }\n return (nValueRet >= nTargetValue);\n }\n\n return (SelectCoinsMinConf(nTargetValue, 1, 6, vCoins, setCoinsRet, nValueRet) ||\n SelectCoinsMinConf(nTargetValue, 1, 1, vCoins, setCoinsRet, nValueRet) ||\n (bSpendZeroConfChange && SelectCoinsMinConf(nTargetValue, 0, 1, vCoins, setCoinsRet, nValueRet)));\n}\n\n\/\/ ppcoin: Select some coins without random shuffle or best subset approximation\nbool CWallet::SelectCoinsSimple(int64 nTargetValue, unsigned int nSpendTime, int nMinConf, set >& setCoinsRet, int64& nValueRet) const\n{\n vector vCoins;\n AvailableCoinsMinConf(vCoins, nMinConf);\n\n setCoinsRet.clear();\n nValueRet = 0;\n\n BOOST_FOREACH(COutput output, vCoins)\n {\n const CWalletTx *pcoin = output.tx;\n int i = output.i;\n\n \/\/ Stop if we've chosen enough inputs\n if (nValueRet >= nTargetValue)\n break;\n\n int64 n = pcoin->vout[i].nValue;\n\n pair > coin = make_pair(n,make_pair(pcoin, i));\n\n if (n >= nTargetValue)\n {\n \/\/ If input value is greater or equal to target then simply insert\n \/\/ it into the current subset and exit\n setCoinsRet.insert(coin.second);\n nValueRet += coin.first;\n break;\n }\n else if (n < nTargetValue + CENT)\n {\n setCoinsRet.insert(coin.second);\n nValueRet += coin.first;\n }\n }\n\n return true;\n}\n\nbool CWallet::CreateTransaction(const vector >& vecSend,\n CWalletTx& wtxNew, CReserveKey& reservekey, int64& nFeeRet, std::string& strFailReason, const CCoinControl* coinControl)\n{\n int64 nValue = 0;\n BOOST_FOREACH (const PAIRTYPE(CScript, int64)& s, vecSend)\n {\n if (nValue < 0)\n {\n strFailReason = _(\"Transaction amounts must be positive\");\n return false;\n }\n nValue += s.second;\n }\n if (vecSend.empty() || nValue < 0)\n {\n strFailReason = _(\"Transaction amounts must be positive\");\n return false;\n }\n\n \/\/ Transactions in PoW phase should have the old version.\n if (pindexBest->nHeight < LAST_POW_BLOCK)\n wtxNew.nVersion = POW_TX_VERSION;\n\n wtxNew.BindWallet(this);\n\n {\n LOCK2(cs_main, cs_wallet);\n {\n nFeeRet = nTransactionFee;\n loop\n {\n wtxNew.vin.clear();\n wtxNew.vout.clear();\n wtxNew.fFromMe = true;\n\n int64 nTotalValue = nValue + nFeeRet;\n double dPriority = 0;\n \/\/ vouts to the payees\n BOOST_FOREACH (const PAIRTYPE(CScript, int64)& s, vecSend)\n {\n CTxOut txout(s.second, s.first);\n if (txout.IsDust())\n {\n strFailReason = _(\"Transaction amount too small\");\n return false;\n }\n wtxNew.vout.push_back(txout);\n }\n\n \/\/ Choose coins to use\n set > setCoins;\n int64 nValueIn = 0;\n if (!SelectCoins(nTotalValue, setCoins, nValueIn, coinControl))\n {\n strFailReason = _(\"Insufficient funds\");\n return false;\n }\n BOOST_FOREACH(PAIRTYPE(const CWalletTx*, unsigned int) pcoin, setCoins)\n {\n int64 nCredit = pcoin.first->vout[pcoin.second].nValue;\n \/\/The priority after the next block (depth+1) is used instead of the current,\n \/\/reflecting an assumption the user would accept a bit more delay for\n \/\/a chance at a free transaction.\n dPriority += (double)nCredit * (pcoin.first->GetDepthInMainChain()+1);\n }\n\n int64 nChange = nValueIn - nValue - nFeeRet;\n \/\/ if sub-cent change is required, the fee must be raised to at least nMinTxFee\n \/\/ or until nChange becomes zero\n \/\/ NOTE: this depends on the exact behaviour of GetMinFee\n if (nFeeRet < CTransaction::nMinTxFee && nChange > 0 && nChange < CENT)\n {\n int64 nMoveToFee = min(nChange, CTransaction::nMinTxFee - nFeeRet);\n nChange -= nMoveToFee;\n nFeeRet += nMoveToFee;\n }\n\n if (nChange > 0)\n {\n \/\/ Fill a vout to ourself\n \/\/ TODO: pass in scriptChange instead of reservekey so\n \/\/ change transaction isn't always pay-to-bitcoin-address\n CScript scriptChange;\n \n \/\/ coin control: send change to custom address\n if (coinControl && !boost::get(&coinControl->destChange))\n scriptChange.SetDestination(coinControl->destChange);\n \n \/\/ no coin control: send change to newly generated address\n else\n {\n \/\/ Note: We use a new key here to keep it from being obvious which side is the change.\n \/\/ The drawback is that by not reusing a previous key, the change may be lost if a\n \/\/ backup is restored, if the backup doesn't have the new private key for the change.\n \/\/ If we reused the old key, it would be possible to add code to look for and\n \/\/ rediscover unknown transactions that were written with keys of ours to recover\n \/\/ post-backup change.\n\n \/\/ Reserve a new key pair from key pool\n CPubKey vchPubKey;\n assert(reservekey.GetReservedKey(vchPubKey)); \/\/ should never fail, as we just unlocked\n\n scriptChange.SetDestination(vchPubKey.GetID());\n }\n\n CTxOut newTxOut(nChange, scriptChange);\n\n \/\/ Never create dust outputs; if we would, just\n \/\/ add the dust to the fee.\n if (newTxOut.IsDust())\n {\n nFeeRet += nChange;\n reservekey.ReturnKey();\n }\n else\n {\n \/\/ Insert change txn at random position:\n vector::iterator position = wtxNew.vout.begin()+GetRandInt(wtxNew.vout.size()+1);\n wtxNew.vout.insert(position, newTxOut);\n }\n }\n else\n reservekey.ReturnKey();\n\n \/\/ Fill vin\n BOOST_FOREACH(const PAIRTYPE(const CWalletTx*,unsigned int)& coin, setCoins)\n wtxNew.vin.push_back(CTxIn(coin.first->GetHash(),coin.second));\n\n \/\/ Sign\n int nIn = 0;\n BOOST_FOREACH(const PAIRTYPE(const CWalletTx*,unsigned int)& coin, setCoins)\n if (!SignSignature(*this, *coin.first, wtxNew, nIn++))\n {\n strFailReason = _(\"Signing transaction failed\");\n return false;\n }\n\n \/\/ Limit size\n unsigned int nBytes = ::GetSerializeSize(*(CTransaction*)&wtxNew, SER_NETWORK, PROTOCOL_VERSION);\n if (nBytes >= MAX_STANDARD_TX_SIZE)\n {\n strFailReason = _(\"Transaction too large\");\n return false;\n }\n dPriority \/= nBytes;\n\n \/\/ Check that enough fee is included\n int64 nPayFee = nTransactionFee * (1 + (int64)nBytes \/ 1000);\n bool fAllowFree = CTransaction::AllowFree(dPriority);\n int64 nMinFee = wtxNew.GetMinFee(1, fAllowFree, GMF_SEND);\n if (nFeeRet < max(nPayFee, nMinFee))\n {\n nFeeRet = max(nPayFee, nMinFee);\n continue;\n }\n\n \/\/ Fill vtxPrev by copying from previous transactions vtxPrev\n wtxNew.AddSupportingTransactions();\n wtxNew.fTimeReceivedIsTxTime = true;\n\n break;\n }\n }\n }\n return true;\n}\n\nbool CWallet::CreateTransaction(CScript scriptPubKey, int64 nValue,\n CWalletTx& wtxNew, CReserveKey& reservekey, int64& nFeeRet, std::string& strFailReason, const CCoinControl* coinControl)\n{\n vector< pair > vecSend;\n vecSend.push_back(make_pair(scriptPubKey, nValue));\n return CreateTransaction(vecSend, wtxNew, reservekey, nFeeRet, strFailReason, coinControl);\n}\n\nbool CWallet::GetStakeWeight(const CKeyStore& keystore, uint64& nAverageWeight, uint64& nTotalWeight)\n{\n \/\/ Choose coins to use\n int64 nBalance = GetBalance();\n\n if (nBalance <= nReserveBalance)\n return false;\n\n vector vwtxPrev;\n\n set > setCoins;\n int64 nValueIn = 0;\n\n if (!SelectCoinsSimple(nBalance - nReserveBalance, GetTime(), COINBASE_MATURITY + 20, setCoins, nValueIn))\n return false;\n\n if (setCoins.empty())\n return false;\n\n nAverageWeight = nTotalWeight = 0;\n uint64 nWeightCount = 0;\n\n BOOST_FOREACH(PAIRTYPE(const CWalletTx*, unsigned int) pcoin, setCoins)\n {\n CTransaction tx;\n uint256 hashBlock = 0;\n {\n LOCK2(cs_main, cs_wallet);\n if (!GetTransaction(pcoin.first->GetHash(), tx, hashBlock, true))\n continue;\n if (!mapBlockIndex.count(hashBlock))\n continue;\n }\n\n \/\/ Deal with transaction timestmap\n unsigned int nTimeTx = tx.nTime ? tx.nTime : mapBlockIndex[hashBlock]->nTime;\n\n int64 nTimeWeight = GetCoinAgeWeight((int64)nTimeTx, (int64)GetTime());\n CBigNum bnCoinDayWeight = CBigNum(pcoin.first->vout[pcoin.second].nValue) * nTimeWeight \/ COIN \/ (24 * 60 * 60);\n\n \/\/ Weight is greater than zero\n if (nTimeWeight > 0)\n {\n nTotalWeight += bnCoinDayWeight.getuint64();\n nWeightCount++;\n }\n }\n\n if (nWeightCount > 0)\n nAverageWeight = nTotalWeight \/ nWeightCount;\n\n return true;\n}\n\nbool CWallet::CreateCoinStake(const CKeyStore& keystore, unsigned int nBits, int64 nSearchInterval, int64 nFees, CTransaction& txNew, CKey& key)\n{\n CBlockIndex* pindexPrev = pindexBest;\n CBigNum bnTargetPerCoinDay;\n bnTargetPerCoinDay.SetCompact(nBits);\n\n txNew.vin.clear();\n txNew.vout.clear();\n\n \/\/ Mark coin stake transaction\n CScript scriptEmpty;\n scriptEmpty.clear();\n txNew.vout.push_back(CTxOut(0, scriptEmpty));\n\n \/\/ Choose coins to use\n int64 nBalance = GetBalance();\n\n if (nBalance <= nReserveBalance)\n return false;\n\n vector vwtxPrev;\n\n set > setCoins;\n int64 nValueIn = 0;\n\n \/\/ Select coins with suitable depth\n if (!SelectCoinsSimple(nBalance - nReserveBalance, txNew.nTime, COINBASE_MATURITY + 20, setCoins, nValueIn))\n return false;\n\n if (setCoins.empty())\n return false;\n\n int64 nCredit = 0;\n CScript scriptPubKeyKernel;\n BOOST_FOREACH(PAIRTYPE(const CWalletTx*, unsigned int) pcoin, setCoins)\n {\n boost::this_thread::interruption_point();\n\n CTransaction tx;\n uint256 hashBlock = 0;\n {\n LOCK2(cs_main, cs_wallet);\n if (!GetTransaction(pcoin.first->GetHash(), tx, hashBlock, true))\n continue;\n }\n\n \/\/ Read block header\n if (!mapBlockIndex.count(hashBlock))\n continue;\n\n CBlock block;\n {\n LOCK2(cs_main, cs_wallet);\n if (!block.ReadFromDisk(mapBlockIndex[hashBlock]))\n continue;\n }\n\n static int nMaxStakeSearchInterval = 60;\n if (block.GetBlockTime() + nStakeMinAge > txNew.nTime - nMaxStakeSearchInterval)\n continue; \/\/ only count coins meeting min age requirement\n\n bool fKernelFound = false;\n for (unsigned int n=0; nGetHash(), pcoin.second);\n if (CheckStakeKernelHash(nBits, block, prevoutStake.n, *pcoin.first, prevoutStake, txNew.nTime - n, hashProofOfStake, targetProofOfStake, fDebug))\n {\n \/\/ Found a kernel\n if (fDebug && GetBoolArg(\"-printcoinstake\"))\n printf(\"CreateCoinStake : kernel found\\n\");\n vector vSolutions;\n txnouttype whichType;\n CScript scriptPubKeyOut;\n scriptPubKeyKernel = pcoin.first->vout[pcoin.second].scriptPubKey;\n if (!Solver(scriptPubKeyKernel, whichType, vSolutions))\n {\n if (fDebug && GetBoolArg(\"-printcoinstake\"))\n printf(\"CreateCoinStake : failed to parse kernel\\n\");\n break;\n }\n if (fDebug && GetBoolArg(\"-printcoinstake\"))\n printf(\"CreateCoinStake : parsed kernel type=%d\\n\", whichType);\n if (whichType != TX_PUBKEY && whichType != TX_PUBKEYHASH)\n {\n if (fDebug && GetBoolArg(\"-printcoinstake\"))\n printf(\"CreateCoinStake : no support for kernel type=%d\\n\", whichType);\n break; \/\/ only support pay to public key and pay to address\n }\n if (whichType == TX_PUBKEYHASH) \/\/ pay to address type\n {\n \/\/ convert to pay to public key type\n if (!keystore.GetKey(uint160(vSolutions[0]), key))\n {\n if (fDebug && GetBoolArg(\"-printcoinstake\"))\n printf(\"CreateCoinStake : failed to get key for kernel type=%d\\n\", whichType);\n break; \/\/ unable to find corresponding public key\n }\n scriptPubKeyOut << key.GetPubKey() << OP_CHECKSIG;\n }\n if (whichType == TX_PUBKEY)\n {\n valtype& vchPubKey = vSolutions[0];\n if (!keystore.GetKey(Hash160(vchPubKey), key))\n {\n if (fDebug && GetBoolArg(\"-printcoinstake\"))\n printf(\"CreateCoinStake : failed to get key for kernel type=%d\\n\", whichType);\n break; \/\/ unable to find corresponding public key\n }\n if (key.GetPubKey() != vchPubKey)\n {\n if (fDebug && GetBoolArg(\"-printcoinstake\"))\n printf(\"CreateCoinStake : invalid key for kernel type=%d\\n\", whichType);\n break; \/\/ keys mismatch\n }\n scriptPubKeyOut = scriptPubKeyKernel;\n }\n\n txNew.nTime -= n;\n txNew.vin.push_back(CTxIn(pcoin.first->GetHash(), pcoin.second));\n nCredit += pcoin.first->vout[pcoin.second].nValue;\n vwtxPrev.push_back(pcoin.first);\n txNew.vout.push_back(CTxOut(0, scriptPubKeyOut));\n\n if (GetCoinAgeWeight(block.GetBlockTime(), (int64)txNew.nTime) < nStakeSplitAge && nCredit >= nStakeCombineThreshold)\n txNew.vout.push_back(CTxOut(0, scriptPubKeyOut)); \/\/split stake\n if (fDebug && GetBoolArg(\"-printcoinstake\"))\n printf(\"CreateCoinStake : added kernel type=%d\\n\", whichType);\n fKernelFound = true;\n break;\n }\n }\n\n if (fKernelFound)\n break; \/\/ if kernel is found stop searching\n }\n\n if (nCredit == 0 || nCredit > nBalance - nReserveBalance)\n return false;\n\n BOOST_FOREACH(PAIRTYPE(const CWalletTx*, unsigned int) pcoin, setCoins)\n {\n \/\/ Attempt to add more inputs\n \/\/ Only add coins of the same key\/address as kernel\n if (txNew.vout.size() == 2 && ((pcoin.first->vout[pcoin.second].scriptPubKey == scriptPubKeyKernel || pcoin.first->vout[pcoin.second].scriptPubKey == txNew.vout[1].scriptPubKey))\n && pcoin.first->GetHash() != txNew.vin[0].prevout.hash)\n {\n \/\/ Stop adding more inputs if already too many inputs\n if (txNew.vin.size() >= 100)\n break;\n \/\/ Stop adding more inputs if value is already pretty significant\n if (nCredit >= nStakeCombineThreshold)\n break;\n \/\/ Stop adding inputs if reached reserve limit\n if (nCredit + pcoin.first->vout[pcoin.second].nValue > nBalance - nReserveBalance)\n break;\n \/\/ Do not add additional significant input\n if (pcoin.first->vout[pcoin.second].nValue >= nStakeCombineThreshold)\n continue;\n\n CTransaction tx;\n uint256 hashBlock = 0;\n {\n LOCK2(cs_main, cs_wallet);\n if (!GetTransaction(pcoin.first->GetHash(), tx, hashBlock, true))\n continue;\n if (!mapBlockIndex.count(hashBlock))\n continue;\n }\n\n \/\/ Deal with transaction timestmap\n unsigned int nTimeTx = tx.nTime ? tx.nTime : mapBlockIndex[hashBlock]->nTime;\n\n \/\/ Do not add input that is still too young\n if (!GetCoinAgeWeight((int64)nTimeTx, (int64)txNew.nTime))\n continue;\n\n txNew.vin.push_back(CTxIn(pcoin.first->GetHash(), pcoin.second));\n nCredit += pcoin.first->vout[pcoin.second].nValue;\n vwtxPrev.push_back(pcoin.first);\n }\n }\n\n \/\/ Calculate coin age reward\n {\n uint64 nCoinAge;\n if (!txNew.GetCoinAge(nCoinAge))\n return error(\"CreateCoinStake : failed to calculate coin age\");\n\n int64 nReward = GetProofOfStakeReward(nCoinAge, nFees);\n if (nReward <= 0)\n return false;\n\n nCredit += nReward;\n }\n\n \/\/ Set output amount\n if (txNew.vout.size() == 3)\n {\n txNew.vout[1].nValue = (nCredit \/ 2 \/ CENT) * CENT;\n txNew.vout[2].nValue = nCredit - txNew.vout[1].nValue;\n }\n else\n txNew.vout[1].nValue = nCredit;\n\n \/\/ Sign\n int nIn = 0;\n BOOST_FOREACH(const CWalletTx* pcoin, vwtxPrev)\n {\n if (!SignSignature(*this, *pcoin, txNew, nIn++))\n return error(\"CreateCoinStake : failed to sign coinstake\");\n }\n\n \/\/ Limit size\n unsigned int nBytes = ::GetSerializeSize(txNew, SER_NETWORK, PROTOCOL_VERSION);\n if (nBytes >= MAX_BLOCK_SIZE_GEN\/5)\n return error(\"CreateCoinStake : exceeded coinstake size limit\");\n\n \/\/ Successfully generated coinstake\n return true;\n}\n\n\n\/\/ Call after CreateTransaction unless you want to abort\nbool CWallet::CommitTransaction(CWalletTx& wtxNew, CReserveKey& reservekey)\n{\n {\n LOCK2(cs_main, cs_wallet);\n printf(\"CommitTransaction:\\n%s\", wtxNew.ToString().c_str());\n {\n \/\/ This is only to keep the database open to defeat the auto-flush for the\n \/\/ duration of this scope. This is the only place where this optimization\n \/\/ maybe makes sense; please don't do it anywhere else.\n CWalletDB* pwalletdb = fFileBacked ? new CWalletDB(strWalletFile,\"r\") : NULL;\n\n \/\/ Take key pair from key pool so it won't be used again\n reservekey.KeepKey();\n\n \/\/ Add tx to wallet, because if it has change it's also ours,\n \/\/ otherwise just for transaction history.\n AddToWallet(wtxNew);\n\n \/\/ Mark old coins as spent\n set setCoins;\n BOOST_FOREACH(const CTxIn& txin, wtxNew.vin)\n {\n CWalletTx &coin = mapWallet[txin.prevout.hash];\n coin.BindWallet(this);\n coin.MarkSpent(txin.prevout.n);\n coin.WriteToDisk();\n NotifyTransactionChanged(this, coin.GetHash(), CT_UPDATED);\n }\n\n if (fFileBacked)\n delete pwalletdb;\n }\n\n \/\/ Track how many getdata requests our transaction gets\n mapRequestCount[wtxNew.GetHash()] = 0;\n\n \/\/ Broadcast\n if (!wtxNew.AcceptToMemoryPool(true, false))\n {\n \/\/ This must not fail. The transaction has already been signed and recorded.\n printf(\"CommitTransaction() : Error: Transaction not valid\");\n return false;\n }\n wtxNew.RelayWalletTransaction();\n }\n return true;\n}\n\n\n\n\nstring CWallet::SendMoney(CScript scriptPubKey, int64 nValue, CWalletTx& wtxNew, bool fAskFee)\n{\n CReserveKey reservekey(this);\n int64 nFeeRequired;\n\n string strError;\n if (IsLocked())\n {\n strError = _(\"Error: Wallet locked, unable to create transaction!\");\n printf(\"SendMoney() : %s\", strError.c_str());\n return strError;\n }\n if (fWalletUnlockStakingOnly)\n {\n strError = _(\"Error: Wallet unlocked for staking only, unable to create transaction.\");\n printf(\"SendMoney() : %s\", strError.c_str());\n return strError;\n }\n if (!CreateTransaction(scriptPubKey, nValue, wtxNew, reservekey, nFeeRequired, strError))\n {\n if (nValue + nFeeRequired > GetBalance())\n 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).c_str());\n printf(\"SendMoney() : %s\\n\", strError.c_str());\n return strError;\n }\n\n if (fAskFee && !uiInterface.ThreadSafeAskFee(nFeeRequired))\n return \"ABORTED\";\n\n if (!CommitTransaction(wtxNew, reservekey))\n 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.\");\n\n return \"\";\n}\n\n\n\nstring CWallet::SendMoneyToDestination(const CTxDestination& address, int64 nValue, CWalletTx& wtxNew, bool fAskFee)\n{\n \/\/ Check amount\n if (nValue <= 0)\n return _(\"Invalid amount\");\n if (nValue + nTransactionFee > GetBalance())\n return _(\"Insufficient funds\");\n\n \/\/ Parse Bitcoin address\n CScript scriptPubKey;\n scriptPubKey.SetDestination(address);\n\n return SendMoney(scriptPubKey, nValue, wtxNew, fAskFee);\n}\n\nDBErrors CWallet::LoadWallet(bool& fFirstRunRet)\n{\n if (!fFileBacked)\n return DB_LOAD_OK;\n fFirstRunRet = false;\n DBErrors nLoadWalletRet = CWalletDB(strWalletFile,\"cr+\").LoadWallet(this);\n if (nLoadWalletRet == DB_NEED_REWRITE)\n {\n if (CDB::Rewrite(strWalletFile, \"\\x04pool\"))\n {\n setKeyPool.clear();\n \/\/ Note: can't top-up keypool here, because wallet is locked.\n \/\/ User will be prompted to unlock wallet the next operation\n \/\/ the requires a new key.\n }\n }\n\n if (nLoadWalletRet != DB_LOAD_OK)\n return nLoadWalletRet;\n fFirstRunRet = !vchDefaultKey.IsValid();\n return DB_LOAD_OK;\n}\n\n\nbool CWallet::SetAddressBookName(const CTxDestination& address, const string& strName)\n{\n std::map::iterator mi = mapAddressBook.find(address);\n mapAddressBook[address] = strName;\n NotifyAddressBookChanged(this, address, strName, ::IsMine(*this, address), (mi == mapAddressBook.end()) ? CT_NEW : CT_UPDATED);\n if (!fFileBacked)\n return false;\n return CWalletDB(strWalletFile).WriteName(CBitcoinAddress(address).ToString(), strName);\n}\n\nbool CWallet::DelAddressBookName(const CTxDestination& address)\n{\n mapAddressBook.erase(address);\n NotifyAddressBookChanged(this, address, \"\", ::IsMine(*this, address), CT_DELETED);\n if (!fFileBacked)\n return false;\n return CWalletDB(strWalletFile).EraseName(CBitcoinAddress(address).ToString());\n}\n\n\nvoid CWallet::PrintWallet(const CBlock& block)\n{\n {\n LOCK(cs_wallet);\n if (block.IsProofOfWork() && mapWallet.count(block.vtx[0].GetHash()))\n {\n CWalletTx& wtx = mapWallet[block.vtx[0].GetHash()];\n printf(\" mine: %d %d %\"PRI64d\"\", wtx.GetDepthInMainChain(), wtx.GetBlocksToMaturity(), wtx.GetCredit());\n }\n else if (block.IsProofOfStake() && mapWallet.count(block.vtx[1].GetHash()))\n {\n CWalletTx& wtx = mapWallet[block.vtx[1].GetHash()];\n printf(\" stake: %d %d %\"PRI64d\"\", wtx.GetDepthInMainChain(), wtx.GetBlocksToMaturity(), wtx.GetCredit());\n }\n }\n printf(\"\\n\");\n}\n\nbool CWallet::GetTransaction(const uint256 &hashTx, CWalletTx& wtx)\n{\n {\n LOCK(cs_wallet);\n map::iterator mi = mapWallet.find(hashTx);\n if (mi != mapWallet.end())\n {\n wtx = (*mi).second;\n return true;\n }\n }\n return false;\n}\n\n\/\/ a blatant copy of the same function in main.cpp\nbool CWallet::GetTransaction(const uint256 &hash, CTransaction &txOut, uint256 &hashBlock, bool fAllowSlow)\n{\n CBlockIndex *pindexSlow = NULL;\n {\n LOCK(cs_main);\n {\n LOCK(mempool.cs);\n if (mempool.exists(hash))\n {\n txOut = mempool.lookup(hash);\n return true;\n }\n }\n\n if (fTxIndex) {\n CDiskTxPos postx;\n if (pblocktree->ReadTxIndex(hash, postx)) {\n CAutoFile file(OpenBlockFile(postx, true), SER_DISK, CLIENT_VERSION);\n CBlockHeader header;\n try {\n file >> header;\n fseek(file, postx.nTxOffset, SEEK_CUR);\n file >> txOut;\n } catch (std::exception &e) {\n return error(\"%s() : deserialize or I\/O error\", __PRETTY_FUNCTION__);\n }\n hashBlock = header.GetHash();\n if (txOut.GetHash() != hash)\n return error(\"%s() : txid mismatch\", __PRETTY_FUNCTION__);\n return true;\n }\n }\n\n if (fAllowSlow) { \/\/ use coin database to locate block that contains transaction, and scan it\n int nHeight = -1;\n {\n CCoinsViewCache &view = *pcoinsTip;\n CCoins coins;\n if (view.GetCoins(hash, coins))\n nHeight = coins.nHeight;\n }\n if (nHeight > 0)\n pindexSlow = FindBlockByHeight(nHeight);\n }\n }\n\n if (pindexSlow) {\n CBlock block;\n if (block.ReadFromDisk(pindexSlow)) {\n BOOST_FOREACH(const CTransaction &tx, block.vtx) {\n if (tx.GetHash() == hash) {\n txOut = tx;\n hashBlock = pindexSlow->GetBlockHash();\n return true;\n }\n }\n }\n }\n\n return false;\n}\n\nbool CWallet::SetDefaultKey(const CPubKey &vchPubKey)\n{\n if (fFileBacked)\n {\n if (!CWalletDB(strWalletFile).WriteDefaultKey(vchPubKey))\n return false;\n }\n vchDefaultKey = vchPubKey;\n return true;\n}\n\nbool GetWalletFile(CWallet* pwallet, string &strWalletFileOut)\n{\n if (!pwallet->fFileBacked)\n return false;\n strWalletFileOut = pwallet->strWalletFile;\n return true;\n}\n\n\/\/\n\/\/ Mark old keypool keys as used,\n\/\/ and generate all new keys\n\/\/\nbool CWallet::NewKeyPool()\n{\n {\n LOCK(cs_wallet);\n CWalletDB walletdb(strWalletFile);\n BOOST_FOREACH(int64 nIndex, setKeyPool)\n walletdb.ErasePool(nIndex);\n setKeyPool.clear();\n\n if (IsLocked())\n return false;\n\n int64 nKeys = max(GetArg(\"-keypool\", 100), (int64)0);\n for (int i = 0; i < nKeys; i++)\n {\n int64 nIndex = i+1;\n walletdb.WritePool(nIndex, CKeyPool(GenerateNewKey()));\n setKeyPool.insert(nIndex);\n }\n printf(\"CWallet::NewKeyPool wrote %\"PRI64d\" new keys\\n\", nKeys);\n }\n return true;\n}\n\nbool CWallet::TopUpKeyPool()\n{\n {\n LOCK(cs_wallet);\n\n if (IsLocked())\n return false;\n\n CWalletDB walletdb(strWalletFile);\n\n \/\/ Top up key pool\n unsigned int nTargetSize = max(GetArg(\"-keypool\", 100), 0LL);\n while (setKeyPool.size() < (nTargetSize + 1))\n {\n int64 nEnd = 1;\n if (!setKeyPool.empty())\n nEnd = *(--setKeyPool.end()) + 1;\n if (!walletdb.WritePool(nEnd, CKeyPool(GenerateNewKey())))\n throw runtime_error(\"TopUpKeyPool() : writing generated key failed\");\n setKeyPool.insert(nEnd);\n printf(\"keypool added key %\"PRI64d\", size=%\"PRIszu\"\\n\", nEnd, setKeyPool.size());\n }\n }\n return true;\n}\n\nvoid CWallet::ReserveKeyFromKeyPool(int64& nIndex, CKeyPool& keypool)\n{\n nIndex = -1;\n keypool.vchPubKey = CPubKey();\n {\n LOCK(cs_wallet);\n\n if (!IsLocked())\n TopUpKeyPool();\n\n \/\/ Get the oldest key\n if(setKeyPool.empty())\n return;\n\n CWalletDB walletdb(strWalletFile);\n\n nIndex = *(setKeyPool.begin());\n setKeyPool.erase(setKeyPool.begin());\n if (!walletdb.ReadPool(nIndex, keypool))\n throw runtime_error(\"ReserveKeyFromKeyPool() : read failed\");\n if (!HaveKey(keypool.vchPubKey.GetID()))\n throw runtime_error(\"ReserveKeyFromKeyPool() : unknown key in key pool\");\n assert(keypool.vchPubKey.IsValid());\n printf(\"keypool reserve %\"PRI64d\"\\n\", nIndex);\n }\n}\n\nint64 CWallet::AddReserveKey(const CKeyPool& keypool)\n{\n {\n LOCK2(cs_main, cs_wallet);\n CWalletDB walletdb(strWalletFile);\n\n int64 nIndex = 1 + *(--setKeyPool.end());\n if (!walletdb.WritePool(nIndex, keypool))\n throw runtime_error(\"AddReserveKey() : writing added key failed\");\n setKeyPool.insert(nIndex);\n return nIndex;\n }\n return -1;\n}\n\nvoid CWallet::KeepKey(int64 nIndex)\n{\n \/\/ Remove from key pool\n if (fFileBacked)\n {\n CWalletDB walletdb(strWalletFile);\n walletdb.ErasePool(nIndex);\n }\n printf(\"keypool keep %\"PRI64d\"\\n\", nIndex);\n}\n\nvoid CWallet::ReturnKey(int64 nIndex)\n{\n \/\/ Return to key pool\n {\n LOCK(cs_wallet);\n setKeyPool.insert(nIndex);\n }\n printf(\"keypool return %\"PRI64d\"\\n\", nIndex);\n}\n\nbool CWallet::GetKeyFromPool(CPubKey& result, bool fAllowReuse)\n{\n int64 nIndex = 0;\n CKeyPool keypool;\n {\n LOCK(cs_wallet);\n ReserveKeyFromKeyPool(nIndex, keypool);\n if (nIndex == -1)\n {\n if (fAllowReuse && vchDefaultKey.IsValid())\n {\n result = vchDefaultKey;\n return true;\n }\n if (IsLocked()) return false;\n result = GenerateNewKey();\n return true;\n }\n KeepKey(nIndex);\n result = keypool.vchPubKey;\n }\n return true;\n}\n\nint64 CWallet::GetOldestKeyPoolTime()\n{\n int64 nIndex = 0;\n CKeyPool keypool;\n ReserveKeyFromKeyPool(nIndex, keypool);\n if (nIndex == -1)\n return GetTime();\n ReturnKey(nIndex);\n return keypool.nTime;\n}\n\nstd::map CWallet::GetAddressBalances()\n{\n map balances;\n\n {\n LOCK(cs_wallet);\n BOOST_FOREACH(PAIRTYPE(uint256, CWalletTx) walletEntry, mapWallet)\n {\n CWalletTx *pcoin = &walletEntry.second;\n\n if (!pcoin->IsFinal() || !pcoin->IsConfirmed())\n continue;\n\n if ((pcoin->IsCoinBase() || pcoin->IsCoinStake()) && pcoin->GetBlocksToMaturity() > 0)\n continue;\n\n int nDepth = pcoin->GetDepthInMainChain();\n if (nDepth < (pcoin->IsFromMe() ? 0 : 1))\n continue;\n\n for (unsigned int i = 0; i < pcoin->vout.size(); i++)\n {\n CTxDestination addr;\n if (!IsMine(pcoin->vout[i]))\n continue;\n if(!ExtractDestination(pcoin->vout[i].scriptPubKey, addr))\n continue;\n\n int64 n = pcoin->IsSpent(i) ? 0 : pcoin->vout[i].nValue;\n\n if (!balances.count(addr))\n balances[addr] = 0;\n balances[addr] += n;\n }\n }\n }\n\n return balances;\n}\n\nset< set > CWallet::GetAddressGroupings()\n{\n set< set > groupings;\n set grouping;\n\n BOOST_FOREACH(PAIRTYPE(uint256, CWalletTx) walletEntry, mapWallet)\n {\n CWalletTx *pcoin = &walletEntry.second;\n\n if (pcoin->vin.size() > 0)\n {\n bool any_mine = false;\n \/\/ group all input addresses with each other\n BOOST_FOREACH(CTxIn txin, pcoin->vin)\n {\n CTxDestination address;\n if(!IsMine(txin)) \/* If this input isn't mine, ignore it *\/\n continue;\n if(!ExtractDestination(mapWallet[txin.prevout.hash].vout[txin.prevout.n].scriptPubKey, address))\n continue;\n grouping.insert(address);\n any_mine = true;\n }\n\n \/\/ group change with input addresses\n if (any_mine)\n {\n BOOST_FOREACH(CTxOut txout, pcoin->vout)\n if (IsChange(txout))\n {\n CTxDestination txoutAddr;\n if(!ExtractDestination(txout.scriptPubKey, txoutAddr))\n continue;\n grouping.insert(txoutAddr);\n }\n }\n if (grouping.size() > 0)\n {\n groupings.insert(grouping);\n grouping.clear();\n }\n }\n\n \/\/ group lone addrs by themselves\n for (unsigned int i = 0; i < pcoin->vout.size(); i++)\n if (IsMine(pcoin->vout[i]))\n {\n CTxDestination address;\n if(!ExtractDestination(pcoin->vout[i].scriptPubKey, address))\n continue;\n grouping.insert(address);\n groupings.insert(grouping);\n grouping.clear();\n }\n }\n\n set< set* > uniqueGroupings; \/\/ a set of pointers to groups of addresses\n map< CTxDestination, set* > setmap; \/\/ map addresses to the unique group containing it\n BOOST_FOREACH(set grouping, groupings)\n {\n \/\/ make a set of all the groups hit by this new group\n set< set* > hits;\n map< CTxDestination, set* >::iterator it;\n BOOST_FOREACH(CTxDestination address, grouping)\n if ((it = setmap.find(address)) != setmap.end())\n hits.insert((*it).second);\n\n \/\/ merge all hit groups into a new single group and delete old groups\n set* merged = new set(grouping);\n BOOST_FOREACH(set* hit, hits)\n {\n merged->insert(hit->begin(), hit->end());\n uniqueGroupings.erase(hit);\n delete hit;\n }\n uniqueGroupings.insert(merged);\n\n \/\/ update setmap\n BOOST_FOREACH(CTxDestination element, *merged)\n setmap[element] = merged;\n }\n\n set< set > ret;\n BOOST_FOREACH(set* uniqueGrouping, uniqueGroupings)\n {\n ret.insert(*uniqueGrouping);\n delete uniqueGrouping;\n }\n\n return ret;\n}\n\n\/\/ ppcoin: disable transaction (only for coinstake)\nvoid CWallet::DisableTransaction(const CTransaction &tx)\n{\n if (!tx.IsCoinStake() || !IsFromMe(tx))\n return; \/\/ only disconnecting coinstake requires marking input unspent\n\n LOCK(cs_wallet);\n BOOST_FOREACH(const CTxIn& txin, tx.vin)\n {\n map::iterator mi = mapWallet.find(txin.prevout.hash);\n if (mi != mapWallet.end())\n {\n CWalletTx& prev = (*mi).second;\n if (txin.prevout.n < prev.vout.size() && IsMine(prev.vout[txin.prevout.n]))\n {\n prev.MarkUnspent(txin.prevout.n);\n prev.WriteToDisk();\n }\n }\n }\n}\n\nbool CReserveKey::GetReservedKey(CPubKey& pubkey)\n{\n if (nIndex == -1)\n {\n CKeyPool keypool;\n pwallet->ReserveKeyFromKeyPool(nIndex, keypool);\n if (nIndex != -1)\n vchPubKey = keypool.vchPubKey;\n else {\n if (pwallet->vchDefaultKey.IsValid()) {\n printf(\"CReserveKey::GetReservedKey(): Warning: Using default key instead of a new key, top up your keypool!\");\n vchPubKey = pwallet->vchDefaultKey;\n } else\n return false;\n }\n }\n assert(vchPubKey.IsValid());\n pubkey = vchPubKey;\n return true;\n}\n\nvoid CReserveKey::KeepKey()\n{\n if (nIndex != -1)\n pwallet->KeepKey(nIndex);\n nIndex = -1;\n vchPubKey = CPubKey();\n}\n\nvoid CReserveKey::ReturnKey()\n{\n if (nIndex != -1)\n pwallet->ReturnKey(nIndex);\n nIndex = -1;\n vchPubKey = CPubKey();\n}\n\nvoid CWallet::GetAllReserveKeys(set& setAddress)\n{\n setAddress.clear();\n\n CWalletDB walletdb(strWalletFile);\n\n LOCK2(cs_main, cs_wallet);\n BOOST_FOREACH(const int64& id, setKeyPool)\n {\n CKeyPool keypool;\n if (!walletdb.ReadPool(id, keypool))\n throw runtime_error(\"GetAllReserveKeyHashes() : read failed\");\n assert(keypool.vchPubKey.IsValid());\n CKeyID keyID = keypool.vchPubKey.GetID();\n if (!HaveKey(keyID))\n throw runtime_error(\"GetAllReserveKeyHashes() : unknown key in key pool\");\n setAddress.insert(keyID);\n }\n}\n\nvoid CWallet::UpdatedTransaction(const uint256 &hashTx, bool fDeleted)\n{\n {\n LOCK(cs_wallet);\n \/\/ Only notify UI if this transaction is in this wallet\n map::const_iterator mi = mapWallet.find(hashTx);\n if (mi != mapWallet.end())\n NotifyTransactionChanged(this, hashTx, CT_UPDATED);\n else if (fDeleted)\n NotifyTransactionChanged(this, hashTx, CT_DELETED);\n }\n}\n\nvoid CWallet::LockCoin(COutPoint& output)\n{\n setLockedCoins.insert(output);\n}\n\nvoid CWallet::UnlockCoin(COutPoint& output)\n{\n setLockedCoins.erase(output);\n}\n\nvoid CWallet::UnlockAllCoins()\n{\n setLockedCoins.clear();\n}\n\nbool CWallet::IsLockedCoin(uint256 hash, unsigned int n) const\n{\n COutPoint outpt(hash, n);\n\n return (setLockedCoins.count(outpt) > 0);\n}\n\nvoid CWallet::ListLockedCoins(std::vector& vOutpts)\n{\n for (std::set::iterator it = setLockedCoins.begin();\n it != setLockedCoins.end(); it++) {\n COutPoint outpt = (*it);\n vOutpts.push_back(outpt);\n }\n}\n\n\/**\n * ihook98 2018-02-08\n*\/\n\/\/ populate vCoins with vector of spendable COutputs by address\nvoid CWallet::AvailableCoinsByAddress(const CTxDestination &fromAddress, vector& vCoins, bool fOnlyConfirmed, const CCoinControl *coinControl) const\n{\n vCoins.clear();\n\n {\n LOCK(cs_wallet);\n for (map::const_iterator it = mapWallet.begin(); it != mapWallet.end(); ++it)\n {\n const CWalletTx* pcoin = &(*it).second;\n\n if (!pcoin->IsFinal())\n continue;\n\n if (fOnlyConfirmed && !pcoin->IsConfirmed())\n continue;\n\n if ((pcoin->IsCoinBase() || pcoin->IsCoinStake()) && pcoin->GetBlocksToMaturity() > 0)\n continue;\n\n int nDepth = pcoin->GetDepthInMainChain();\n if (nDepth < 0)\n continue;\n\n for (unsigned int i = 0; i < pcoin->vout.size(); i++) {\n CTxDestination addr;\n if(ExtractDestination(pcoin->vout[i].scriptPubKey, addr))\n {\n if(addr == fromAddress)\n {\n if (!(pcoin->IsSpent(i)) && \n IsMine(pcoin->vout[i]) &&\n !IsLockedCoin((*it).first, i) && \n pcoin->vout[i].nValue >= nMinimumInputValue &&\n (!coinControl || !coinControl->HasSelected() || coinControl->IsSelected((*it).first, i))) \n vCoins.push_back(COutput(pcoin, i, nDepth));\n }\n }\n }\n }\n }\n}\n\nbool CWallet::SelectCoinsFromAddress(const CTxDestination &fromAddress, int64 nTargetValue, set >& setCoinsRet, int64& nValueRet, const CCoinControl* coinControl) const\n{\n vector vCoins;\n AvailableCoinsByAddress(fromAddress, vCoins, true, coinControl);\n \n \/\/ coin control -> return all selected outputs (we want all selected to go into the transaction for sure)\n if (coinControl && coinControl->HasSelected())\n {\n BOOST_FOREACH(const COutput& out, vCoins)\n {\n nValueRet += out.tx->vout[out.i].nValue;\n setCoinsRet.insert(make_pair(out.tx, out.i));\n }\n return (nValueRet >= nTargetValue);\n }\n\n return (SelectCoinsMinConf(nTargetValue, 1, 6, vCoins, setCoinsRet, nValueRet) ||\n SelectCoinsMinConf(nTargetValue, 1, 1, vCoins, setCoinsRet, nValueRet) ||\n (bSpendZeroConfChange && SelectCoinsMinConf(nTargetValue, 0, 1, vCoins, setCoinsRet, nValueRet)));\n}\n\nbool CWallet::CreateTransaction(const CTxDestination &fromAddress, CScript scriptPubKey, int64 nValue2,\n CWalletTx& wtxNew, CReserveKey& reservekey, int64& nFeeRet, std::string& strFailReason, const CCoinControl* coinControl)\n{\n vector< pair > vecSend;\n vecSend.push_back(make_pair(scriptPubKey, nValue2));\n int64 nValue = 0;\n BOOST_FOREACH (const PAIRTYPE(CScript, int64)& s, vecSend)\n {\n if (nValue < 0)\n {\n strFailReason = _(\"Transaction amounts must be positive\");\n return false;\n }\n nValue += s.second;\n }\n if (vecSend.empty() || nValue < 0)\n {\n strFailReason = _(\"Transaction amounts must be positive\");\n return false;\n }\n\n \/\/ Transactions in PoW phase should have the old version.\n if (pindexBest->nHeight < LAST_POW_BLOCK)\n wtxNew.nVersion = POW_TX_VERSION;\n\n wtxNew.BindWallet(this);\n\n {\n LOCK2(cs_main, cs_wallet);\n {\n nFeeRet = nTransactionFee;\n loop\n {\n wtxNew.vin.clear();\n wtxNew.vout.clear();\n wtxNew.fFromMe = true;\n\n int64 nTotalValue = nValue + nFeeRet;\n double dPriority = 0;\n \/\/ vouts to the payees\n BOOST_FOREACH (const PAIRTYPE(CScript, int64)& s, vecSend)\n {\n CTxOut txout(s.second, s.first);\n if (txout.IsDust())\n {\n strFailReason = _(\"Transaction amount too small\");\n return false;\n }\n wtxNew.vout.push_back(txout);\n }\n\n \/\/ Choose coins to use\n set > setCoins;\n int64 nValueIn = 0;\n if (!SelectCoinsFromAddress(fromAddress, nTotalValue, setCoins, nValueIn, coinControl))\n {\n strFailReason = _(\"Insufficient funds\");\n return false;\n }\n BOOST_FOREACH(PAIRTYPE(const CWalletTx*, unsigned int) pcoin, setCoins)\n {\n int64 nCredit = pcoin.first->vout[pcoin.second].nValue;\n \/\/The priority after the next block (depth+1) is used instead of the current,\n \/\/reflecting an assumption the user would accept a bit more delay for\n \/\/a chance at a free transaction.\n dPriority += (double)nCredit * (pcoin.first->GetDepthInMainChain()+1);\n }\n\n int64 nChange = nValueIn - nValue - nFeeRet;\n \/\/ if sub-cent change is required, the fee must be raised to at least nMinTxFee\n \/\/ or until nChange becomes zero\n \/\/ NOTE: this depends on the exact behaviour of GetMinFee\n if (nFeeRet < CTransaction::nMinTxFee && nChange > 0 && nChange < CENT)\n {\n int64 nMoveToFee = min(nChange, CTransaction::nMinTxFee - nFeeRet);\n nChange -= nMoveToFee;\n nFeeRet += nMoveToFee;\n }\n\n if (nChange > 0)\n {\n \/\/ Fill a vout to ourself\n \/\/ TODO: pass in scriptChange instead of reservekey so\n \/\/ change transaction isn't always pay-to-bitcoin-address\n CScript scriptChange;\n \n scriptChange.SetDestination(fromAddress);\n CTxOut newTxOut(nChange, scriptChange);\n\n \/\/ Never create dust outputs; if we would, just\n \/\/ add the dust to the fee.\n if (newTxOut.IsDust())\n {\n nFeeRet += nChange;\n reservekey.ReturnKey();\n }\n else\n {\n \/\/ Insert change txn at random position:\n vector::iterator position = wtxNew.vout.begin()+GetRandInt(wtxNew.vout.size()+1);\n wtxNew.vout.insert(position, newTxOut);\n }\n }\n else\n reservekey.ReturnKey();\n\n \/\/ Fill vin\n BOOST_FOREACH(const PAIRTYPE(const CWalletTx*,unsigned int)& coin, setCoins)\n wtxNew.vin.push_back(CTxIn(coin.first->GetHash(),coin.second));\n\n \/\/ Sign\n int nIn = 0;\n BOOST_FOREACH(const PAIRTYPE(const CWalletTx*,unsigned int)& coin, setCoins)\n if (!SignSignature(*this, *coin.first, wtxNew, nIn++))\n {\n strFailReason = _(\"Signing transaction failed\");\n return false;\n }\n\n \/\/ Limit size\n unsigned int nBytes = ::GetSerializeSize(*(CTransaction*)&wtxNew, SER_NETWORK, PROTOCOL_VERSION);\n if (nBytes >= MAX_STANDARD_TX_SIZE)\n {\n strFailReason = _(\"Transaction too large\");\n return false;\n }\n dPriority \/= nBytes;\n\n \/\/ Check that enough fee is included\n int64 nPayFee = nTransactionFee * (1 + (int64)nBytes \/ 1000);\n bool fAllowFree = CTransaction::AllowFree(dPriority);\n int64 nMinFee = wtxNew.GetMinFee(1, fAllowFree, GMF_SEND);\n if (nFeeRet < max(nPayFee, nMinFee))\n {\n nFeeRet = max(nPayFee, nMinFee);\n continue;\n }\n\n \/\/ Fill vtxPrev by copying from previous transactions vtxPrev\n wtxNew.AddSupportingTransactions();\n wtxNew.fTimeReceivedIsTxTime = true;\n\n break;\n }\n }\n }\n return true;\n}\n\nstring CWallet::SendMoneyFromAddress(const CTxDestination &fromAddress, CScript scriptPubKey, int64 nValue, CWalletTx& wtxNew, bool fAskFee)\n{\n CReserveKey reservekey(this);\n int64 nFeeRequired;\n\n string strError;\n if (IsLocked())\n {\n strError = _(\"Error: Wallet locked, unable to create transaction!\");\n printf(\"SendMoney() : %s\", strError.c_str());\n return strError;\n }\n if (fWalletUnlockStakingOnly)\n {\n strError = _(\"Error: Wallet unlocked for staking only, unable to create transaction.\");\n printf(\"SendMoney() : %s\", strError.c_str());\n return strError;\n }\n if (!CreateTransaction(fromAddress, scriptPubKey, nValue, wtxNew, reservekey, nFeeRequired, strError))\n {\n if (nValue + nFeeRequired > GetAddressBalance(fromAddress))\n 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).c_str());\n printf(\"SendMoney() : %s\\n\", strError.c_str());\n return strError;\n }\n\n if (fAskFee && !uiInterface.ThreadSafeAskFee(nFeeRequired))\n return \"ABORTED\";\n\n if (!CommitTransaction(wtxNew, reservekey))\n 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.\");\n\n return \"\";\n}\n\nint64 CWallet::GetAddressBalance(const CTxDestination &address)\n{\n int64 nBalance = 0;\n {\n map balances = GetAddressBalances();\n map::iterator mi = balances.find(address);\n if(mi != balances.end()){\n nBalance = (*mi).second;\n }\n }\n return nBalance;\n}\n\nstring CWallet::SendMoneyFromAddressToDestination(const CTxDestination &fromAddress, const CTxDestination &toAddress, int64 nValue, CWalletTx& wtxNew, bool fAskFee)\n{\n \/\/ Check amount\n if (nValue <= 0)\n return _(\"Invalid amount\");\n if (nValue + nTransactionFee > GetAddressBalance(fromAddress))\n return _(\"Insufficient funds\");\n\n \/\/ Parse Bitcoin address\n CScript scriptPubKey;\n scriptPubKey.SetDestination(toAddress);\n\n return SendMoneyFromAddress(fromAddress, scriptPubKey, nValue, wtxNew, fAskFee);\n}","avg_line_length":34.7629388346,"max_line_length":235,"alphanum_fraction":0.5686309214,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":1876,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["Apache-2.0"],"max_stars_count":1.0,"content":"\ufeff\/**\n * Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.\n * SPDX-License-Identifier: Apache-2.0.\n *\/\n\n#include \n#include \n#include \n#include \n#include \n\n#include \n\nusing namespace Aws::DocDB::Model;\nusing namespace Aws::Utils::Xml;\nusing namespace Aws::Utils::Logging;\nusing namespace Aws::Utils;\nusing namespace Aws;\n\nModifyDBClusterSnapshotAttributeResult::ModifyDBClusterSnapshotAttributeResult()\n{\n}\n\nModifyDBClusterSnapshotAttributeResult::ModifyDBClusterSnapshotAttributeResult(const Aws::AmazonWebServiceResult& result)\n{\n *this = result;\n}\n\nModifyDBClusterSnapshotAttributeResult& ModifyDBClusterSnapshotAttributeResult::operator =(const Aws::AmazonWebServiceResult& result)\n{\n const XmlDocument& xmlDocument = result.GetPayload();\n XmlNode rootNode = xmlDocument.GetRootElement();\n XmlNode resultNode = rootNode;\n if (!rootNode.IsNull() && (rootNode.GetName() != \"ModifyDBClusterSnapshotAttributeResult\"))\n {\n resultNode = rootNode.FirstChild(\"ModifyDBClusterSnapshotAttributeResult\");\n }\n\n if(!resultNode.IsNull())\n {\n XmlNode dBClusterSnapshotAttributesResultNode = resultNode.FirstChild(\"DBClusterSnapshotAttributesResult\");\n if(!dBClusterSnapshotAttributesResultNode.IsNull())\n {\n m_dBClusterSnapshotAttributesResult = dBClusterSnapshotAttributesResultNode;\n }\n }\n\n if (!rootNode.IsNull()) {\n XmlNode responseMetadataNode = rootNode.FirstChild(\"ResponseMetadata\");\n m_responseMetadata = responseMetadataNode;\n AWS_LOGSTREAM_DEBUG(\"Aws::DocDB::Model::ModifyDBClusterSnapshotAttributeResult\", \"x-amzn-request-id: \" << m_responseMetadata.GetRequestId() );\n }\n return *this;\n}\n","avg_line_length":34.1090909091,"max_line_length":146,"alphanum_fraction":0.7830490405,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":4162,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["Unlicense"],"max_stars_count":15.0,"content":"\/\/=================================================================================================\n\/*!\n\/\/ \\file src\/mathtest\/smatdmatadd\/UCaUHa.cpp\n\/\/ \\brief Source file for the UCaUHa sparse matrix\/dense matrix addition math test\n\/\/\n\/\/ Copyright (C) 2012-2019 Klaus Iglberger - All Rights Reserved\n\/\/\n\/\/ This file is part of the Blaze library. You can redistribute it and\/or modify it under\n\/\/ the terms of the New (Revised) BSD License. Redistribution and use in source and binary\n\/\/ forms, with or without modification, are permitted provided that the following conditions\n\/\/ are met:\n\/\/\n\/\/ 1. Redistributions of source code must retain the above copyright notice, this list of\n\/\/ conditions and the following disclaimer.\n\/\/ 2. Redistributions in binary form must reproduce the above copyright notice, this list\n\/\/ of conditions and the following disclaimer in the documentation and\/or other materials\n\/\/ provided with the distribution.\n\/\/ 3. Neither the names of the Blaze development group nor the names of its contributors\n\/\/ may be used to endorse or promote products derived from this software without specific\n\/\/ prior written permission.\n\/\/\n\/\/ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY\n\/\/ EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES\n\/\/ OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT\n\/\/ SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,\n\/\/ INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED\n\/\/ TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR\n\/\/ BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n\/\/ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN\n\/\/ ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH\n\/\/ DAMAGE.\n*\/\n\/\/=================================================================================================\n\n\n\/\/*************************************************************************************************\n\/\/ Includes\n\/\/*************************************************************************************************\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#ifdef BLAZE_USE_HPX_THREADS\n# include \n#endif\n\n\n\/\/=================================================================================================\n\/\/\n\/\/ MAIN FUNCTION\n\/\/\n\/\/=================================================================================================\n\n\/\/*************************************************************************************************\nint main()\n{\n std::cout << \" Running 'UCaUHa'...\" << std::endl;\n\n using blazetest::mathtest::TypeA;\n\n try\n {\n \/\/ Matrix type definitions\n using UCa = blaze::UpperMatrix< blaze::CompressedMatrix >;\n using UHa = blaze::UpperMatrix< blaze::HybridMatrix >;\n\n \/\/ Creator type definitions\n using CUCa = blazetest::Creator;\n using CUHa = blazetest::Creator;\n\n \/\/ Running tests with small matrices\n for( size_t i=0UL; i<=6UL; ++i ) {\n for( size_t j=0UL; j<=UCa::maxNonZeros( i ); ++j ) {\n RUN_SMATDMATADD_OPERATION_TEST( CUCa( i, j ), CUHa( i ) );\n }\n }\n\n \/\/ Running tests with large matrices\n RUN_SMATDMATADD_OPERATION_TEST( CUCa( 67UL, 7UL ), CUHa( 67UL ) );\n RUN_SMATDMATADD_OPERATION_TEST( CUCa( 128UL, 16UL ), CUHa( 128UL ) );\n }\n catch( std::exception& ex ) {\n std::cerr << \"\\n\\n ERROR DETECTED during sparse matrix\/dense matrix addition:\\n\"\n << ex.what() << \"\\n\";\n return EXIT_FAILURE;\n }\n\n return EXIT_SUCCESS;\n}\n\/\/*************************************************************************************************\n","avg_line_length":42.9072164948,"max_line_length":99,"alphanum_fraction":0.5696780394,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":1049,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":10.0,"content":"\/\/ ARKSurvivalEvolved (329.9) SDK\n\n#ifdef _MSC_VER\n\t#pragma pack(push, 0x8)\n#endif\n\n#include \"ARKSurvivalEvolved_WoodHarvestComponent_parameters.hpp\"\n\nnamespace sdk\n{\n\/\/---------------------------------------------------------------------------\n\/\/Functions\n\/\/---------------------------------------------------------------------------\n\n\/\/ Function WoodHarvestComponent.WoodHarvestComponent_C.ExecuteUbergraph_WoodHarvestComponent\n\/\/ ()\n\/\/ Parameters:\n\/\/ int EntryPoint (Parm, ZeroConstructor, IsPlainOldData)\n\nvoid UWoodHarvestComponent_C::ExecuteUbergraph_WoodHarvestComponent(int EntryPoint)\n{\n\tstatic auto fn = UObject::FindObject(\"Function WoodHarvestComponent.WoodHarvestComponent_C.ExecuteUbergraph_WoodHarvestComponent\");\n\n\tUWoodHarvestComponent_C_ExecuteUbergraph_WoodHarvestComponent_Params params;\n\tparams.EntryPoint = EntryPoint;\n\n\tauto flags = fn->FunctionFlags;\n\n\tUObject::ProcessEvent(fn, ¶ms);\n\n\tfn->FunctionFlags = flags;\n}\n\n\n}\n\n#ifdef _MSC_VER\n\t#pragma pack(pop)\n#endif\n","avg_line_length":26.225,"max_line_length":143,"alphanum_fraction":0.6558627264,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":3375,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["Apache-2.0"],"max_stars_count":329.0,"content":"\/*\nCopyright(c) 2002-2019 Anatoliy Kuznetsov(anatoliy_kuznetsov at yahoo.com)\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n\nFor more information please visit: http:\/\/bitmagic.io\n*\/\n\n\/** \\example svsample07.cpp\n Example of how to use bm::str_sparse_vector<> - succinct container for\n sorted bit-transposed collection of integers\n\n \\sa bm::sparse_vector\n \\sa bm::sparse_vector_scanner<>::lower_bound\n*\/\n\n\/*! \\file svsample07.cpp\n \\brief Example: sparse_vector<> lower bound search\n*\/\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"bm.h\"\n#include \"bmsparsevec.h\"\n#include \"bmsparsevec_algo.h\"\n#include \"bmundef.h\" \/* clear the pre-proc defines from BM *\/\n\nusing namespace std;\n\ntypedef bm::sparse_vector > sparse_vector_u32;\n\n\/\/ generate collection of strings from integers and shuffle it\n\/\/\nstatic\nvoid generate_set(vector& vec)\n{\n const unsigned max_coll = 50000;\n \n vec.resize(0);\n for (unsigned i = 10; i < max_coll; i += rand() % 3)\n {\n vec.emplace_back(i);\n } \/\/ for i\n \n \/\/ shuffle the data set\n \/\/\n std::random_device rd;\n std::mt19937 g(rd());\n std::shuffle(vec.begin(), vec.end(), g);\n}\n\n\/\/ insertion sort takes data from unsorted vector places it into sparse vector\n\/\/ maintaining correct sorted order (for fast search)\n\/\/\nstatic\nvoid insertion_sort(sparse_vector_u32& sv, const vector& vec)\n{\n \/\/ scanner object is re-used throught the processing\n \/\/\n bm::sparse_vector_scanner scanner;\n sparse_vector_u32::size_type pos;\n\n for (const unsigned u : vec)\n {\n bool found = scanner.bfind(sv, u, pos);\n (void)found; \/\/ just to silence the unused variable warning\n \n sv.insert(pos, u);\n \n } \/\/ for u\n}\n\n\nint main(void)\n{\n try\n {\n sparse_vector_u32 sv;\n vector vec;\n generate_set(vec);\n \n insertion_sort(sv, vec);\n \n sv.optimize(); \/\/ mmemory optimization after active editing\n \n \/\/ validate the results to match STL sort\n std::sort(vec.begin(), vec.end());\n {\n vector::const_iterator vit = vec.begin();\n sparse_vector_u32::const_iterator it = sv.begin();\n sparse_vector_u32::const_iterator it_end = sv.end();\n for (; it != it_end; ++it, ++vit)\n {\n unsigned u = *it;\n if (*vit != u)\n {\n cerr << \"Mismatch at:\" << u << \"!=\" << *vit << endl;\n return 1;\n }\n } \/\/ for\n }\n cout << \"Sort validation Ok.\" << endl;\n }\n catch(std::exception& ex)\n {\n std::cerr << ex.what() << std::endl;\n return 1;\n }\n\n return 0;\n}\n","avg_line_length":26.3671875,"max_line_length":78,"alphanum_fraction":0.6251851852,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":55229,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":null,"content":"\/\/ Copyright 2019 David Conran\n\n#include \n#include \"ir_Amcor.h\"\n#include \"ir_Argo.h\"\n#include \"ir_Daikin.h\"\n#include \"ir_Electra.h\"\n#include \"ir_Fujitsu.h\"\n#include \"ir_Goodweather.h\"\n#include \"ir_Gree.h\"\n#include \"ir_Haier.h\"\n#include \"ir_Hitachi.h\"\n#include \"ir_Kelvinator.h\"\n#include \"ir_Midea.h\"\n#include \"ir_Mitsubishi.h\"\n#include \"ir_MitsubishiHeavy.h\"\n#include \"ir_Neoclima.h\"\n#include \"ir_Panasonic.h\"\n#include \"ir_Samsung.h\"\n#include \"ir_Sharp.h\"\n#include \"ir_Tcl.h\"\n#include \"ir_Teco.h\"\n#include \"ir_Toshiba.h\"\n#include \"ir_Trotec.h\"\n#include \"ir_Vestel.h\"\n#include \"ir_Whirlpool.h\"\n#include \"IRac.h\"\n#include \"IRrecv.h\"\n#include \"IRrecv_test.h\"\n#include \"IRremoteESP8266.h\"\n#include \"IRsend.h\"\n#include \"IRsend_test.h\"\n#include \"gtest\/gtest.h\"\n\n\/\/ Tests for IRac class.\n\nTEST(TestIRac, Amcor) {\n IRAmcorAc ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Mode: 5 (AUTO), Fan: 3 (High), Temp: 19C, Max: Off\";\n\n ac.begin();\n irac.amcor(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kAuto, \/\/ Mode\n 19, \/\/ Celsius\n stdAc::fanspeed_t::kHigh); \/\/ Fan speed\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(AMCOR, ac._irsend.capture.decode_type);\n ASSERT_EQ(kAmcorBits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Argo) {\n IRArgoAC ac(0);\n IRac irac(0);\n\n ac.begin();\n irac.argo(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kHeat, \/\/ Mode\n 21, \/\/ Celsius\n stdAc::fanspeed_t::kHigh, \/\/ Fan speed\n stdAc::swingv_t::kOff, \/\/ Veritcal swing\n false, \/\/ Turbo\n -1); \/\/ Sleep\n EXPECT_TRUE(ac.getPower());\n EXPECT_EQ(kArgoHeat, ac.getMode());\n EXPECT_EQ(21, ac.getTemp());\n EXPECT_EQ(kArgoFlapAuto, ac.getFlap());\n EXPECT_FALSE(ac.getMax()); \/\/ Turbo\n EXPECT_FALSE(ac.getNight()); \/\/ Sleep\n}\n\nTEST(TestIRac, Coolix) {\n IRCoolixAC ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Mode: 3 (HEAT), Fan: 1 (MAX), Temp: 21C, Zone Follow: Off, \"\n \"Sensor Temp: Ignored\";\n\n ac.begin();\n irac.coolix(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kHeat, \/\/ Mode\n 21, \/\/ Celsius\n stdAc::fanspeed_t::kHigh, \/\/ Fan speed\n stdAc::swingv_t::kOff, \/\/ Veritcal swing\n stdAc::swingh_t::kOff, \/\/ Horizontal swing\n false, \/\/ Turbo\n false, \/\/ Light\n false, \/\/ Clean\n -1); \/\/ Sleep\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(COOLIX, ac._irsend.capture.decode_type);\n ASSERT_EQ(kCoolixBits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n \/\/ Confirm we are sending with a repeat of 1. i.e. two messages.\n EXPECT_EQ(\n \"f38000d50\" \/\/ 38kHz Frequency and 50% duty-cycle.\n \/\/ Start of message #1 (i.e. Repeat '0')\n \/\/ Header\n \"m4480s4480\"\n \/\/ Data\n \"m560s1680m560s560m560s1680m560s1680m560s560m560s560m560s1680m560s560\"\n \"m560s560m560s1680m560s560m560s560m560s1680m560s1680m560s560m560s1680\"\n \"m560s560m560s560m560s1680m560s1680m560s1680m560s1680m560s1680m560s1680\"\n \"m560s1680m560s1680m560s560m560s560m560s560m560s560m560s560m560s560\"\n \"m560s560m560s1680m560s1680m560s560m560s1680m560s1680m560s560m560s560\"\n \"m560s1680m560s560m560s560m560s1680m560s560m560s560m560s1680m560s1680\"\n \/\/ Footer\n \"m560s5040\"\n \/\/ End of message #1 (i.e. Repeat '0')\n \/\/ Start of message #2 (i.e. Repeat '1')\n \/\/ Header\n \"m4480s4480\"\n \/\/ Data\n \"m560s1680m560s560m560s1680m560s1680m560s560m560s560m560s1680m560s560\"\n \"m560s560m560s1680m560s560m560s560m560s1680m560s1680m560s560m560s1680\"\n \"m560s560m560s560m560s1680m560s1680m560s1680m560s1680m560s1680m560s1680\"\n \"m560s1680m560s1680m560s560m560s560m560s560m560s560m560s560m560s560\"\n \"m560s560m560s1680m560s1680m560s560m560s1680m560s1680m560s560m560s560\"\n \"m560s1680m560s560m560s560m560s1680m560s560m560s560m560s1680m560s1680\"\n \/\/ Footer\n \"m560s105040\",\n \/\/ End of message #2 (i.e. Repeat '1')\n \/\/ Note: the two messages (#1 & #2) are identical.\n ac._irsend.outputStr());\n}\n\nTEST(TestIRac, Daikin) {\n IRDaikinESP ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Mode: 3 (COOL), Temp: 19C, Fan: 5 (High), Powerful: Off, \"\n \"Quiet: Off, Sensor: Off, Mold: On, Comfort: Off, \"\n \"Swing (Horizontal): Off, Swing (Vertical): Off, \"\n \"Current Time: 00:00, Current Day: (UNKNOWN), On Time: Off, \"\n \"Off Time: Off, Weekly Timer: On\";\n\n ac.begin();\n irac.daikin(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kCool, \/\/ Mode\n 19, \/\/ Celsius\n stdAc::fanspeed_t::kMax, \/\/ Fan speed\n stdAc::swingv_t::kOff, \/\/ Veritcal swing\n stdAc::swingh_t::kOff, \/\/ Horizontal swing\n false, \/\/ Quiet\n false, \/\/ Turbo\n true, \/\/ Filter\n true); \/\/ Clean\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(DAIKIN, ac._irsend.capture.decode_type);\n ASSERT_EQ(kDaikinBits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Daikin128) {\n IRDaikin128 ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power Toggle: On, Mode: 8 (HEAT), Temp: 27C, Fan: 9 (Quiet), \"\n \"Powerful: Off, Quiet: On, Swing (V): On, Sleep: On, \"\n \"Econo: Off, Clock: 21:57, On Timer: Off, On Time: 00:00, \"\n \"Off Timer: Off, Off Time: 00:00, Light Toggle: 8 (Wall)\";\n\n ac.begin();\n irac.daikin128(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kHeat, \/\/ Mode\n 27, \/\/ Celsius\n stdAc::fanspeed_t::kMin, \/\/ Fan speed\n stdAc::swingv_t::kAuto, \/\/ Veritcal swing\n true, \/\/ Quiet\n false, \/\/ Turbo\n true, \/\/ Light\n false, \/\/ Econo\n 18 * 60, \/\/ Sleep\n 21 * 60 + 57); \/\/ Clock\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(DAIKIN128, ac._irsend.capture.decode_type);\n ASSERT_EQ(kDaikin128Bits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Daikin160) {\n IRDaikin160 ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Mode: 2 (DRY), Temp: 23C, Fan: 1 (Low), \"\n \"Vent Position (V): 3 (Middle)\";\n\n ac.begin();\n irac.daikin160(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kDry, \/\/ Mode\n 23, \/\/ Celsius\n stdAc::fanspeed_t::kMin, \/\/ Fan speed\n stdAc::swingv_t::kMiddle); \/\/ Veritcal swing\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(DAIKIN160, ac._irsend.capture.decode_type);\n ASSERT_EQ(kDaikin160Bits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Daikin176) {\n IRDaikin176 ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Mode: 7 (COOL), Temp: 26C, Fan: 1 (Low), Swing (H): 5 (Auto)\";\n\n ac.begin();\n irac.daikin176(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kCool, \/\/ Mode\n 26, \/\/ Celsius\n stdAc::fanspeed_t::kLow, \/\/ Fan speed\n stdAc::swingh_t::kAuto); \/\/ Horizontal swing\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(DAIKIN176, ac._irsend.capture.decode_type);\n ASSERT_EQ(kDaikin176Bits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Daikin2) {\n IRDaikin2 ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Mode: 3 (COOL), Temp: 19C, Fan: 1 (Low), \"\n \"Swing (V): 14 (Auto), Swing (H): 0, Clock: 00:00, On Time: Off, \"\n \"Off Time: Off, Sleep Time: Off, Beep: 1 (Quiet), Light: 1 (Bright), \"\n \"Mold: On, Clean: Off, Fresh Air: Off, Eye: Off, Eye Auto: Off, \"\n \"Quiet: Off, Powerful: Off, Purify: On, Econo: Off\";\n\n ac.begin();\n irac.daikin2(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kCool, \/\/ Mode\n 19, \/\/ Celsius\n stdAc::fanspeed_t::kLow, \/\/ Fan speed\n stdAc::swingv_t::kOff, \/\/ Veritcal swing\n stdAc::swingh_t::kOff, \/\/ Horizontal swing\n false, \/\/ Quiet\n false, \/\/ Turbo\n true, \/\/ Light\n false, \/\/ Econo\n true, \/\/ Filter\n true, \/\/ Clean (aka Mold)\n -1, \/\/ Sleep time\n -1); \/\/ Current time\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(DAIKIN2, ac._irsend.capture.decode_type);\n ASSERT_EQ(kDaikin2Bits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Daikin216) {\n IRDaikin216 ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Mode: 4 (HEAT), Temp: 31C, Fan: 11 (Quiet), \"\n \"Swing (Horizontal): On, Swing (Vertical): On, Quiet: On, Powerful: Off\";\n\n ac.begin();\n irac.daikin216(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kHeat, \/\/ Mode\n 31, \/\/ Celsius\n stdAc::fanspeed_t::kMedium, \/\/ Fan speed\n stdAc::swingv_t::kAuto, \/\/ Veritcal swing\n stdAc::swingh_t::kLeft, \/\/ Horizontal swing\n true, \/\/ Quiet\n false); \/\/ Turbo (Powerful)\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(DAIKIN216, ac._irsend.capture.decode_type);\n ASSERT_EQ(kDaikin216Bits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Electra) {\n IRElectraAc ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Mode: 6 (FAN), Temp: 26C, Fan: 1 (High), \"\n \"Swing(V): On, Swing(H): On\";\n\n ac.begin();\n irac.electra(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kFan, \/\/ Mode\n 26, \/\/ Celsius\n stdAc::fanspeed_t::kHigh, \/\/ Fan speed\n stdAc::swingv_t::kAuto, \/\/ Veritcal swing\n stdAc::swingh_t::kLeft); \/\/ Horizontal swing\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(ELECTRA_AC, ac._irsend.capture.decode_type);\n ASSERT_EQ(kElectraAcBits, ac._irsend.capture.bits);\n ac.setRaw(ac._irsend.capture.state);\n ASSERT_EQ(expected, ac.toString());\n}\n\nTEST(TestIRac, Fujitsu) {\n IRFujitsuAC ac(0);\n IRac irac(0);\n IRrecv capture(0);\n std::string ardb1_expected =\n \"Model: 2 (ARDB1), Power: On, Mode: 1 (COOL), Temp: 19C, \"\n \"Fan: 2 (Medium), Command: N\/A\";\n std::string arrah2e_expected =\n \"Model: 1 (ARRAH2E), Power: On, Mode: 1 (COOL), Temp: 19C, \"\n \"Fan: 2 (Medium), Swing: Off, Command: N\/A\";\n\n ac.begin();\n irac.fujitsu(&ac,\n ARDB1, \/\/ Model\n true, \/\/ Power\n stdAc::opmode_t::kCool, \/\/ Mode\n 19, \/\/ Celsius\n stdAc::fanspeed_t::kMedium, \/\/ Fan speed\n stdAc::swingv_t::kOff, \/\/ Veritcal swing\n stdAc::swingh_t::kOff, \/\/ Horizontal swing\n false, \/\/ Quiet\n false, \/\/ Turbo (Powerful)\n false); \/\/ Econo\n ASSERT_EQ(ardb1_expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(FUJITSU_AC, ac._irsend.capture.decode_type);\n ASSERT_EQ(kFujitsuAcBits - 8, ac._irsend.capture.bits);\n ASSERT_EQ(ardb1_expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n\n ac._irsend.reset();\n irac.fujitsu(&ac,\n ARRAH2E, \/\/ Model\n true, \/\/ Power\n stdAc::opmode_t::kCool, \/\/ Mode\n 19, \/\/ Celsius\n stdAc::fanspeed_t::kMedium, \/\/ Fan speed\n stdAc::swingv_t::kOff, \/\/ Veritcal swing\n stdAc::swingh_t::kOff, \/\/ Horizontal swing\n false, \/\/ Quiet\n false, \/\/ Turbo (Powerful)\n false); \/\/ Econo\n ASSERT_EQ(arrah2e_expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(FUJITSU_AC, ac._irsend.capture.decode_type);\n ASSERT_EQ(kFujitsuAcBits, ac._irsend.capture.bits);\n ASSERT_EQ(arrah2e_expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Goodweather) {\n IRGoodweatherAc ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Mode: 1 (COOL), Temp: 19C, Fan: 2 (Medium), Turbo: Toggle, \"\n \"Light: Toggle, Sleep: Toggle, Swing: 1 (Slow), Command: 0 (Power)\";\n\n ac.begin();\n irac.goodweather(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kCool, \/\/ Mode\n 19, \/\/ Celsius\n stdAc::fanspeed_t::kMedium, \/\/ Fan speed\n stdAc::swingv_t::kHigh, \/\/ Veritcal swing\n true, \/\/ Turbo\n true, \/\/ Light\n 8 * 60 + 0); \/\/ Sleep time\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(GOODWEATHER, ac._irsend.capture.decode_type);\n ASSERT_EQ(kGoodweatherBits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Gree) {\n IRGreeAC ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Model: 1 (YAW1F), Power: On, Mode: 1 (COOL), Temp: 22C, \"\n \"Fan: 2 (Medium), Turbo: Off, IFeel: Off, WiFi: Off, XFan: On, \"\n \"Light: On, Sleep: On, Swing Vertical Mode: Manual, \"\n \"Swing Vertical Pos: 3, Timer: Off\";\n\n ac.begin();\n irac.gree(&ac,\n gree_ac_remote_model_t::YAW1F, \/\/ Model\n true, \/\/ Power\n stdAc::opmode_t::kCool, \/\/ Mode\n 22, \/\/ Celsius\n stdAc::fanspeed_t::kMedium, \/\/ Fan speed\n stdAc::swingv_t::kHigh, \/\/ Veritcal swing\n false, \/\/ Turbo\n true, \/\/ Light\n true, \/\/ Clean (aka Mold\/XFan)\n 8 * 60 + 0); \/\/ Sleep time\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(GREE, ac._irsend.capture.decode_type);\n ASSERT_EQ(kGreeBits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Haier) {\n IRHaierAC ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Command: 1 (On), Mode: 1 (COOL), Temp: 24C, Fan: 2 (Medium), \"\n \"Swing: 1 (Up), Sleep: On, Health: On, Current Time: 13:45, \"\n \"On Timer: Off, Off Timer: Off\";\n\n ac.begin();\n irac.haier(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kCool, \/\/ Mode\n 24, \/\/ Celsius\n stdAc::fanspeed_t::kMedium, \/\/ Fan speed\n stdAc::swingv_t::kHigh, \/\/ Veritcal swing\n true, \/\/ Filter\n 8 * 60 + 0, \/\/ Sleep time\n 13 * 60 + 45); \/\/ Clock\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(HAIER_AC, ac._irsend.capture.decode_type);\n ASSERT_EQ(kHaierACBits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\n\nTEST(TestIRac, HaierYrwo2) {\n IRHaierACYRW02 ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Button: 5 (Power), Mode: 2 (COOL), Temp: 23C, \"\n \"Fan: 4 (Medium), Turbo: 1 (High), Swing: 1 (Top), Sleep: On, Health: On\";\n\n ac.begin();\n irac.haierYrwo2(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kCool, \/\/ Mode\n 23, \/\/ Celsius\n stdAc::fanspeed_t::kMedium, \/\/ Fan speed\n stdAc::swingv_t::kHigh, \/\/ Veritcal swing\n true, \/\/ Turbo\n true, \/\/ Filter\n 8 * 60 + 0); \/\/ Sleep time\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(HAIER_AC_YRW02, ac._irsend.capture.decode_type);\n ASSERT_EQ(kHaierACYRW02Bits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Hitachi) {\n IRHitachiAc ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Mode: 2 (AUTO), Temp: 22C, Fan: 3 (Medium), \"\n \"Swing (Vertical): Off, Swing (Horizontal): On\";\n\n ac.begin();\n irac.hitachi(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kAuto, \/\/ Mode\n 22, \/\/ Celsius\n stdAc::fanspeed_t::kMedium, \/\/ Fan speed\n stdAc::swingv_t::kOff, \/\/ Veritcal swing\n stdAc::swingh_t::kAuto); \/\/ Horizontal swing\n\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(HITACHI_AC, ac._irsend.capture.decode_type);\n ASSERT_EQ(kHitachiAcBits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Kelvinator) {\n IRKelvinatorAC ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Mode: 1 (COOL), Temp: 19C, Fan: 3 (Medium), Turbo: Off, \"\n \"Quiet: Off, XFan: On, IonFilter: On, Light: On, \"\n \"Swing (Horizontal): Off, Swing (Vertical): Off\";\n\n ac.begin();\n irac.kelvinator(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kCool, \/\/ Mode\n 19, \/\/ Celsius\n stdAc::fanspeed_t::kMedium, \/\/ Fan speed\n stdAc::swingv_t::kOff, \/\/ Veritcal swing\n stdAc::swingh_t::kOff, \/\/ Horizontal swing\n false, \/\/ Quiet\n false, \/\/ Turbo\n true, \/\/ Light\n true, \/\/ Filter\n true); \/\/ Clean\n\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(KELVINATOR, ac._irsend.capture.decode_type);\n ASSERT_EQ(kKelvinatorBits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Midea) {\n IRMideaAC ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Mode: 1 (DRY), Celsius: On, Temp: 27C\/80F, Fan: 2 (Medium), \"\n \"Sleep: On, Swing(V) Toggle: Off\";\n\n ac.begin();\n irac.midea(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kDry, \/\/ Mode\n true, \/\/ Celsius\n 27, \/\/ Degrees\n stdAc::fanspeed_t::kMedium, \/\/ Fan speed\n stdAc::swingv_t::kOff, \/\/ Swing (V)\n 8 * 60 + 0); \/\/ Sleep time\n\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(MIDEA, ac._irsend.capture.decode_type);\n ASSERT_EQ(kMideaBits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Mitsubishi) {\n IRMitsubishiAC ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Mode: 24 (COOL), Temp: 20C, Fan: 2 (Medium), Vane: AUTO, \"\n \"Wide Vane: 3, Time: 14:30, On timer: 00:00, Off timer: 00:00, Timer: -\";\n\n ac.begin();\n irac.mitsubishi(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kCool, \/\/ Mode\n 20, \/\/ Celsius\n stdAc::fanspeed_t::kMedium, \/\/ Fan speed\n stdAc::swingv_t::kOff, \/\/ Veritcal swing\n stdAc::swingh_t::kOff, \/\/ Horizontal swing\n false, \/\/ Silent\n 14 * 60 + 35); \/\/ Clock\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(MITSUBISHI_AC, ac._irsend.capture.decode_type);\n ASSERT_EQ(kMitsubishiACBits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, MitsubishiHeavy88) {\n IRMitsubishiHeavy88Ac ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Mode: 1 (COOL), Temp: 21C, Fan: 3 (Medium), \"\n \"Swing (V): 16 (Auto), Swing (H): 0 (Off), Turbo: Off, Econo: Off, \"\n \"3D: Off, Clean: On\";\n\n ac.begin();\n irac.mitsubishiHeavy88(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kCool, \/\/ Mode\n 21, \/\/ Celsius\n stdAc::fanspeed_t::kMedium, \/\/ Fan speed\n stdAc::swingv_t::kAuto, \/\/ Veritcal swing\n stdAc::swingh_t::kOff, \/\/ Horizontal swing\n false, \/\/ Turbo\n false, \/\/ Econo\n true); \/\/ Clean\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(MITSUBISHI_HEAVY_88, ac._irsend.capture.decode_type);\n ASSERT_EQ(kMitsubishiHeavy88Bits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, MitsubishiHeavy152) {\n IRMitsubishiHeavy152Ac ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Mode: 1 (COOL), Temp: 20C, Fan: 6 (Econo), \"\n \"Swing (V): 6 (Off), Swing (H): 0 (Auto), Silent: On, Turbo: Off, \"\n \"Econo: On, Night: On, Filter: On, 3D: Off, Clean: Off\";\n\n ac.begin();\n irac.mitsubishiHeavy152(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kCool, \/\/ Mode\n 20, \/\/ Celsius\n stdAc::fanspeed_t::kLow, \/\/ Fan speed\n stdAc::swingv_t::kOff, \/\/ Veritcal swing\n stdAc::swingh_t::kAuto, \/\/ Horizontal swing\n true, \/\/ Silent\n false, \/\/ Turbo\n true, \/\/ Econo\n true, \/\/ Filter\n false, \/\/ Clean\n 8 * 60); \/\/ Sleep\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(MITSUBISHI_HEAVY_152, ac._irsend.capture.decode_type);\n ASSERT_EQ(kMitsubishiHeavy152Bits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Neoclima) {\n IRNeoclimaAc ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Mode: 1 (COOL), Temp: 20C, Fan: 3 (Low), \"\n \"Swing(V): Off, Swing(H): On, Sleep: On, Turbo: Off, Hold: Off, Ion: On, \"\n \"Eye: Off, Light: On, Follow: Off, 8C Heat: Off, Fresh: Off, \"\n \"Button: 0 (Power)\";\n\n ac.begin();\n irac.neoclima(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kCool, \/\/ Mode\n 20, \/\/ Celsius\n stdAc::fanspeed_t::kLow, \/\/ Fan speed\n stdAc::swingv_t::kOff, \/\/ Veritcal swing\n stdAc::swingh_t::kAuto, \/\/ Horizontal swing\n false, \/\/ Turbo\n true, \/\/ Light\n true, \/\/ Filter\n 8 * 60); \/\/ Sleep\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(decode_type_t::NEOCLIMA, ac._irsend.capture.decode_type);\n ASSERT_EQ(kNeoclimaBits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Panasonic) {\n IRPanasonicAc ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected_nke[] =\n \"Model: 2 (NKE), Power: On, Mode: 4 (HEAT), Temp: 28C, Fan: 2 (Medium), \"\n \"Swing (Vertical): 15 (AUTO), Swing (Horizontal): 6 (Middle), Quiet: On, \"\n \"Powerful: Off, Clock: 19:17, On Timer: Off, Off Timer: Off\";\n\n ac.begin();\n irac.panasonic(&ac,\n kPanasonicNke, \/\/ Model\n true, \/\/ Power\n stdAc::opmode_t::kHeat, \/\/ Mode\n 28, \/\/ Celsius\n stdAc::fanspeed_t::kMedium, \/\/ Fan speed\n stdAc::swingv_t::kAuto, \/\/ Veritcal swing\n stdAc::swingh_t::kLeft, \/\/ Horizontal swing\n true, \/\/ Quiet\n false, \/\/ Turbo\n 19 * 60 + 17); \/\/ Clock\n ASSERT_EQ(expected_nke, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(PANASONIC_AC, ac._irsend.capture.decode_type);\n ASSERT_EQ(kPanasonicAcBits, ac._irsend.capture.bits);\n ASSERT_EQ(expected_nke, IRAcUtils::resultAcToString(&ac._irsend.capture));\n\n char expected_dke[] =\n \"Model: 3 (DKE), Power: On, Mode: 3 (COOL), Temp: 18C, Fan: 4 (High), \"\n \"Swing (Vertical): 1 (Full Up), Swing (Horizontal): 6 (Middle), \"\n \"Quiet: Off, Powerful: On, Clock: 19:17, On Timer: Off, Off Timer: Off\";\n ac._irsend.reset();\n irac.panasonic(&ac,\n kPanasonicDke, \/\/ Model\n true, \/\/ Power\n stdAc::opmode_t::kCool, \/\/ Mode\n 18, \/\/ Celsius\n stdAc::fanspeed_t::kMax, \/\/ Fan speed\n stdAc::swingv_t::kHigh, \/\/ Veritcal swing\n stdAc::swingh_t::kMiddle, \/\/ Horizontal swing\n false, \/\/ Quiet\n true, \/\/ Turbo\n 19 * 60 + 17); \/\/ Clock\n ASSERT_EQ(expected_dke, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(PANASONIC_AC, ac._irsend.capture.decode_type);\n ASSERT_EQ(kPanasonicAcBits, ac._irsend.capture.bits);\n ASSERT_EQ(expected_dke, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Samsung) {\n IRSamsungAc ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Mode: 0 (AUTO), Temp: 28C, Fan: 6 (Auto), Swing: On, \"\n \"Beep: On, Clean: On, Quiet: On, Powerful: Off\";\n\n ac.begin();\n irac.samsung(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kAuto, \/\/ Mode\n 28, \/\/ Celsius\n stdAc::fanspeed_t::kMedium, \/\/ Fan speed\n stdAc::swingv_t::kAuto, \/\/ Veritcal swing\n true, \/\/ Quiet\n false, \/\/ Turbo\n true, \/\/ Clean\n true, \/\/ Beep\n false); \/\/ with dopower Off\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(SAMSUNG_AC, ac._irsend.capture.decode_type);\n ASSERT_EQ(kSamsungAcBits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n\n ac._irsend.reset();\n irac.samsung(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kAuto, \/\/ Mode\n 28, \/\/ Celsius\n stdAc::fanspeed_t::kMedium, \/\/ Fan speed\n stdAc::swingv_t::kAuto, \/\/ Veritcal swing\n true, \/\/ Quiet\n false, \/\/ Turbo\n true, \/\/ Clean\n true, \/\/ Beep\n true); \/\/ with dopower On\n ASSERT_EQ(expected, ac.toString()); \/\/ Class should be in the desired mode.\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(SAMSUNG_AC, ac._irsend.capture.decode_type);\n ASSERT_EQ(kSamsungAcExtendedBits, ac._irsend.capture.bits);\n \/\/ However, we expect a plain \"on\" state as it should be sent before the\n \/\/ desired state.\n char expected_on[] =\n \"Power: On, Mode: 1 (COOL), Temp: 24C, Fan: 0 (Auto), Swing: Off, \"\n \"Beep: Off, Clean: Off, Quiet: Off, Powerful: Off\";\n ASSERT_EQ(expected_on, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Sharp) {\n IRSharpAc ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Mode: 2 (COOL), Temp: 28C, Fan: 3 (Medium)\";\n\n ac.begin();\n irac.sharp(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kCool, \/\/ Mode\n 28, \/\/ Celsius\n stdAc::fanspeed_t::kMedium); \/\/ Fan speed\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(SHARP_AC, ac._irsend.capture.decode_type);\n ASSERT_EQ(kSharpAcBits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Tcl112) {\n IRTcl112Ac ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Mode: 3 (COOL), Temp: 20C, Fan: 3 (Medium), Econo: On, \"\n \"Health: On, Light: On, Turbo: Off, Swing (H): On, Swing (V): Off\";\n\n ac.begin();\n irac.tcl112(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kCool, \/\/ Mode\n 20, \/\/ Celsius\n stdAc::fanspeed_t::kMedium, \/\/ Fan speed\n stdAc::swingv_t::kOff, \/\/ Veritcal swing\n stdAc::swingh_t::kAuto, \/\/ Horizontal swing\n false, \/\/ Turbo\n true, \/\/ Light\n true, \/\/ Econo\n true); \/\/ Filter (aka. Health)\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(TCL112AC, ac._irsend.capture.decode_type);\n ASSERT_EQ(kTcl112AcBits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Teco) {\n IRTecoAc ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Mode: 0 (AUTO), Temp: 21C, Fan: 2 (Medium), Sleep: On, \"\n \"Swing: On, Light: On, Humid: Off, Save: Off\";\n\n ac.begin();\n irac.teco(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kAuto, \/\/ Mode\n 21, \/\/ Celsius\n stdAc::fanspeed_t::kMedium, \/\/ Fan speed\n stdAc::swingv_t::kAuto, \/\/ Veritcal swing\n true, \/\/ Light\n 8 * 60 + 30); \/\/ Sleep\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(TECO, ac._irsend.capture.decode_type);\n ASSERT_EQ(kTecoBits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Toshiba) {\n IRToshibaAC ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] = \"Power: On, Mode: 2 (DRY), Temp: 29C, Fan: 2 (UNKNOWN)\";\n\n ac.begin();\n irac.toshiba(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kDry, \/\/ Mode\n 29, \/\/ Celsius\n stdAc::fanspeed_t::kLow); \/\/ Fan speed\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(TOSHIBA_AC, ac._irsend.capture.decode_type);\n ASSERT_EQ(kToshibaACBits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Trotec) {\n IRTrotecESP ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Mode: 1 (COOL), Temp: 18C, Fan: 3 (High), Sleep: On\";\n\n ac.begin();\n irac.trotec(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kCool, \/\/ Mode\n 18, \/\/ Celsius\n stdAc::fanspeed_t::kHigh, \/\/ Fan speed\n 8 * 60 + 17); \/\/ Sleep\n EXPECT_TRUE(ac.getPower());\n EXPECT_EQ(kTrotecCool, ac.getMode());\n EXPECT_EQ(18, ac.getTemp());\n EXPECT_EQ(kTrotecFanHigh, ac.getSpeed());\n EXPECT_TRUE(ac.getSleep());\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(TROTEC, ac._irsend.capture.decode_type);\n ASSERT_EQ(kTrotecBits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, Vestel) {\n IRVestelAc ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Power: On, Mode: 0 (AUTO), Temp: 22C, Fan: 5 (Low), Sleep: On, \"\n \"Turbo: Off, Ion: On, Swing: On\";\n\n ac.begin();\n irac.vestel(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kAuto, \/\/ Mode\n 22, \/\/ Celsius\n stdAc::fanspeed_t::kLow, \/\/ Fan speed\n stdAc::swingv_t::kHigh, \/\/ Veritcal swing\n false, \/\/ Turbo\n true, \/\/ Filter\n 8 * 60 + 0); \/\/ Sleep time\n \/\/ 13 * 60 + 45); \/\/ Clock\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(VESTEL_AC, ac._irsend.capture.decode_type);\n ASSERT_EQ(kVestelAcBits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n\n ac._irsend.reset();\n char expected_clocks[] =\n \"Time: 13:45, Timer: Off, On Timer: Off, Off Timer: Off\";\n\n ac.begin();\n irac.vestel(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kAuto, \/\/ Mode\n 22, \/\/ Celsius\n stdAc::fanspeed_t::kLow, \/\/ Fan speed\n stdAc::swingv_t::kHigh, \/\/ Veritcal swing\n false, \/\/ Turbo\n true, \/\/ Filter\n 8 * 60 + 0, \/\/ Sleep time\n 13 * 60 + 45, \/\/ Clock\n false); \/\/ Don't send the normal message.\n \/\/ Just for testing purposes.\n ASSERT_EQ(expected_clocks, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(VESTEL_AC, ac._irsend.capture.decode_type);\n ASSERT_EQ(kVestelAcBits, ac._irsend.capture.bits);\n ASSERT_EQ(expected_clocks, IRAcUtils::resultAcToString(&ac._irsend.capture));\n\n \/\/ Now check it sends both messages during normal operation when the\n \/\/ clock is set.\n ac._irsend.reset();\n ac.begin();\n irac.vestel(&ac,\n true, \/\/ Power\n stdAc::opmode_t::kAuto, \/\/ Mode\n 22, \/\/ Celsius\n stdAc::fanspeed_t::kLow, \/\/ Fan speed\n stdAc::swingv_t::kHigh, \/\/ Veritcal swing\n false, \/\/ Turbo\n true, \/\/ Filter\n 8 * 60 + 0, \/\/ Sleep time\n 13 * 60 + 45); \/\/ Clock\n\n EXPECT_EQ(\n \"f38000d50\"\n \"m3110s9066\"\n \"m520s1535m520s480m520s480m520s480m520s480m520s480m520s480m520s480\"\n \"m520s480m520s1535m520s480m520s480m520s480m520s480m520s480m520s480\"\n \"m520s1535m520s1535m520s1535m520s1535m520s480m520s1535m520s480m520s1535\"\n \"m520s1535m520s1535m520s480m520s480m520s480m520s480m520s480m520s480\"\n \"m520s480m520s480m520s480m520s480m520s480m520s1535m520s1535m520s480\"\n \"m520s1535m520s480m520s1535m520s480m520s480m520s480m520s480m520s480\"\n \"m520s480m520s480m520s1535m520s480m520s1535m520s1535m520s1535m520s1535\"\n \"m520s100000\"\n \"m3110s9066\"\n \"m520s1535m520s480m520s480m520s480m520s480m520s480m520s480m520s480\"\n \"m520s480m520s1535m520s480m520s480m520s480m520s1535m520s1535m520s480\"\n \"m520s1535m520s1535m520s1535m520s1535m520s480m520s480m520s480m520s480\"\n \"m520s480m520s480m520s480m520s480m520s480m520s480m520s480m520s480\"\n \"m520s480m520s480m520s480m520s480m520s1535m520s480m520s1535m520s1535\"\n \"m520s480m520s480m520s480m520s480m520s1535m520s480m520s1535m520s1535\"\n \"m520s480m520s1535m520s480m520s480m520s480m520s480m520s480m520s480\"\n \"m520s100000\", ac._irsend.outputStr());\n}\n\n\nTEST(TestIRac, Whirlpool) {\n IRWhirlpoolAc ac(0);\n IRac irac(0);\n IRrecv capture(0);\n char expected[] =\n \"Model: 1 (DG11J13A), Power toggle: On, Mode: 1 (AUTO), Temp: 21C, \"\n \"Fan: 3 (Low), Swing: On, Light: On, Clock: 23:58, On Timer: Off, \"\n \"Off Timer: Off, Sleep: On, Super: Off, Command: 1 (POWER)\";\n\n ac.begin();\n irac.whirlpool(&ac,\n DG11J13A,\n true, \/\/ Power\n stdAc::opmode_t::kAuto, \/\/ Mode\n 21, \/\/ Celsius\n stdAc::fanspeed_t::kMedium, \/\/ Fan speed\n stdAc::swingv_t::kAuto, \/\/ Veritcal swing\n false, \/\/ Turbo\n true, \/\/ Light\n 8 * 60 + 30, \/\/ Sleep\n 23 * 60 + 58); \/\/ Clock\n ASSERT_EQ(expected, ac.toString());\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(WHIRLPOOL_AC, ac._irsend.capture.decode_type);\n ASSERT_EQ(kWhirlpoolAcBits, ac._irsend.capture.bits);\n ASSERT_EQ(expected, IRAcUtils::resultAcToString(&ac._irsend.capture));\n}\n\nTEST(TestIRac, cmpStates) {\n stdAc::state_t a, b;\n a.protocol = decode_type_t::COOLIX;\n a.model = -1;\n a.power = true;\n a.celsius = true;\n a.degrees = 25;\n a.mode = stdAc::opmode_t::kAuto;\n a.fanspeed = stdAc::fanspeed_t::kAuto;\n a.swingh = stdAc::swingh_t::kOff;\n a.swingv = stdAc::swingv_t::kOff;\n a.quiet = false;\n a.turbo = false;\n a.light = false;\n a.econo = false;\n a.beep = false;\n a.filter = false;\n a.clean = false;\n a.quiet = false;\n a.sleep = -1;\n a.clock = -1;\n\n ASSERT_FALSE(IRac::cmpStates(a, a));\n ASSERT_TRUE(IRac::cmpStates(a, b));\n\n b = a;\n ASSERT_FALSE(IRac::cmpStates(a, b));\n\n \/\/ Check we don't compare the clock.\n b.clock = 1234;\n ASSERT_FALSE(IRac::cmpStates(a, b));\n\n \/\/ Now make them different.\n b.power = false;\n ASSERT_TRUE(IRac::cmpStates(a, b));\n}\n\nTEST(TestIRac, handleToggles) {\n stdAc::state_t desired, prev, result;\n desired.protocol = decode_type_t::COOLIX;\n desired.model = -1;\n desired.power = true;\n desired.celsius = true;\n desired.degrees = 25;\n desired.mode = stdAc::opmode_t::kAuto;\n desired.fanspeed = stdAc::fanspeed_t::kAuto;\n desired.swingh = stdAc::swingh_t::kOff;\n desired.swingv = stdAc::swingv_t::kOff;\n desired.quiet = false;\n desired.turbo = false;\n desired.light = false;\n desired.econo = false;\n desired.beep = false;\n desired.filter = false;\n desired.clean = false;\n desired.quiet = false;\n desired.sleep = -1;\n desired.clock = -1;\n\n \/\/ The states should be the same as we gave no previous state.\n EXPECT_FALSE(IRac::cmpStates(desired, IRac::handleToggles(desired)));\n \/\/ The states should be the same as we gave no settings that changed.\n prev = desired;\n EXPECT_FALSE(IRac::cmpStates(desired, IRac::handleToggles(desired, &prev)));\n \/\/ Change something that isn't a toggle.\n desired.degrees = 26;\n ASSERT_TRUE(IRac::cmpStates(desired, prev));\n \/\/ Still shouldn't change.\n EXPECT_FALSE(IRac::cmpStates(desired, IRac::handleToggles(desired, &prev)));\n prev.turbo = true; \/\/ This requires a toggle.\n result = IRac::handleToggles(desired, &prev);\n EXPECT_TRUE(IRac::cmpStates(desired, result));\n EXPECT_TRUE(result.turbo);\n desired.turbo = true; \/\/ As the desired setting hasn't changed from previous\n \/\/ the result should not have turbo set, as it is\n \/\/ a toggle setting.\n result = IRac::handleToggles(desired, &prev);\n EXPECT_TRUE(IRac::cmpStates(desired, result));\n EXPECT_FALSE(result.turbo);\n\n \/\/ Go back to the same states.\n prev = desired;\n ASSERT_FALSE(IRac::cmpStates(desired, prev));\n \/\/ Test swing, as it is more complicated.\n result = IRac::handleToggles(desired, &prev);\n EXPECT_EQ(stdAc::swingv_t::kOff, result.swingv);\n desired.swingv = stdAc::swingv_t::kAuto;\n result = IRac::handleToggles(desired, &prev);\n EXPECT_NE(stdAc::swingv_t::kOff, result.swingv);\n\n prev = desired; \/\/ Pretend it was sent and time has passed.\n ASSERT_FALSE(IRac::cmpStates(desired, prev));\n ASSERT_NE(stdAc::swingv_t::kOff, desired.swingv);\n\n \/\/ User changes setting but it's still an \"on\" setting, as this device\n \/\/ only has a binary on\/off for swingv. Nothing should change.\n desired.swingv = stdAc::swingv_t::kHigh;\n result = IRac::handleToggles(desired, &prev);\n ASSERT_EQ(stdAc::swingv_t::kOff, result.swingv); \/\/ i.e No toggle.\n\n prev = desired; \/\/ Pretend it was sent and time has passed.\n \/\/ User changes setting to off. i.e. It is no longer on, so it should toggle.\n desired.swingv = stdAc::swingv_t::kOff;\n result = IRac::handleToggles(desired, &prev);\n ASSERT_NE(stdAc::swingv_t::kOff, result.swingv); \/\/ i.e A toggle.\n}\n\nTEST(TestIRac, strToBool) {\n EXPECT_TRUE(IRac::strToBool(\"ON\"));\n EXPECT_TRUE(IRac::strToBool(\"1\"));\n EXPECT_TRUE(IRac::strToBool(\"TRUE\"));\n EXPECT_TRUE(IRac::strToBool(\"YES\"));\n EXPECT_FALSE(IRac::strToBool(\"OFF\"));\n EXPECT_FALSE(IRac::strToBool(\"0\"));\n EXPECT_FALSE(IRac::strToBool(\"FALSE\"));\n EXPECT_FALSE(IRac::strToBool(\"NO\"));\n EXPECT_FALSE(IRac::strToBool(\"FOOBAR\"));\n EXPECT_TRUE(IRac::strToBool(\"FOOBAR\", true));\n}\n\nTEST(TestIRac, strToOpmode) {\n EXPECT_EQ(stdAc::opmode_t::kAuto, IRac::strToOpmode(\"AUTO\"));\n EXPECT_EQ(stdAc::opmode_t::kCool, IRac::strToOpmode(\"COOL\"));\n EXPECT_EQ(stdAc::opmode_t::kHeat, IRac::strToOpmode(\"HEAT\"));\n EXPECT_EQ(stdAc::opmode_t::kDry, IRac::strToOpmode(\"DRY\"));\n EXPECT_EQ(stdAc::opmode_t::kFan, IRac::strToOpmode(\"FAN\"));\n EXPECT_EQ(stdAc::opmode_t::kFan, IRac::strToOpmode(\"FAN_ONLY\"));\n EXPECT_EQ(stdAc::opmode_t::kAuto, IRac::strToOpmode(\"FOOBAR\"));\n EXPECT_EQ(stdAc::opmode_t::kOff, IRac::strToOpmode(\"OFF\"));\n EXPECT_EQ(stdAc::opmode_t::kOff, IRac::strToOpmode(\"FOOBAR\",\n stdAc::opmode_t::kOff));\n}\n\nTEST(TestIRac, strToFanspeed) {\n EXPECT_EQ(stdAc::fanspeed_t::kAuto, IRac::strToFanspeed(\"AUTO\"));\n EXPECT_EQ(stdAc::fanspeed_t::kMin, IRac::strToFanspeed(\"MIN\"));\n EXPECT_EQ(stdAc::fanspeed_t::kLow, IRac::strToFanspeed(\"LOW\"));\n EXPECT_EQ(stdAc::fanspeed_t::kMedium, IRac::strToFanspeed(\"MEDIUM\"));\n EXPECT_EQ(stdAc::fanspeed_t::kHigh, IRac::strToFanspeed(\"HIGH\"));\n EXPECT_EQ(stdAc::fanspeed_t::kMax, IRac::strToFanspeed(\"MAX\"));\n EXPECT_EQ(stdAc::fanspeed_t::kAuto, IRac::strToFanspeed(\"FOOBAR\"));\n EXPECT_EQ(stdAc::fanspeed_t::kMin,\n IRac::strToFanspeed(\"FOOBAR\", stdAc::fanspeed_t::kMin));\n}\n\nTEST(TestIRac, strToSwingV) {\n EXPECT_EQ(stdAc::swingv_t::kAuto, IRac::strToSwingV(\"AUTO\"));\n EXPECT_EQ(stdAc::swingv_t::kLowest, IRac::strToSwingV(\"LOWEST\"));\n EXPECT_EQ(stdAc::swingv_t::kLow, IRac::strToSwingV(\"LOW\"));\n EXPECT_EQ(stdAc::swingv_t::kMiddle, IRac::strToSwingV(\"MIDDLE\"));\n EXPECT_EQ(stdAc::swingv_t::kHigh, IRac::strToSwingV(\"HIGH\"));\n EXPECT_EQ(stdAc::swingv_t::kHighest, IRac::strToSwingV(\"HIGHEST\"));\n EXPECT_EQ(stdAc::swingv_t::kOff, IRac::strToSwingV(\"OFF\"));\n EXPECT_EQ(stdAc::swingv_t::kOff, IRac::strToSwingV(\"FOOBAR\"));\n EXPECT_EQ(stdAc::swingv_t::kAuto,\n IRac::strToSwingV(\"FOOBAR\", stdAc::swingv_t::kAuto));\n}\n\nTEST(TestIRac, strToSwingH) {\n EXPECT_EQ(stdAc::swingh_t::kAuto, IRac::strToSwingH(\"AUTO\"));\n EXPECT_EQ(stdAc::swingh_t::kLeftMax, IRac::strToSwingH(\"MAX LEFT\"));\n EXPECT_EQ(stdAc::swingh_t::kLeft, IRac::strToSwingH(\"LEFT\"));\n EXPECT_EQ(stdAc::swingh_t::kMiddle, IRac::strToSwingH(\"CENTRE\"));\n EXPECT_EQ(stdAc::swingh_t::kRight, IRac::strToSwingH(\"RIGHT\"));\n EXPECT_EQ(stdAc::swingh_t::kRightMax, IRac::strToSwingH(\"RIGHTMAX\"));\n EXPECT_EQ(stdAc::swingh_t::kOff, IRac::strToSwingH(\"OFF\"));\n EXPECT_EQ(stdAc::swingh_t::kOff, IRac::strToSwingH(\"FOOBAR\"));\n EXPECT_EQ(stdAc::swingh_t::kAuto,\n IRac::strToSwingH(\"FOOBAR\", stdAc::swingh_t::kAuto));\n}\n\nTEST(TestIRac, strToModel) {\n EXPECT_EQ(panasonic_ac_remote_model_t::kPanasonicLke,\n IRac::strToModel(\"LKE\"));\n EXPECT_EQ(panasonic_ac_remote_model_t::kPanasonicLke,\n IRac::strToModel(\"PANASONICLKE\"));\n EXPECT_EQ(fujitsu_ac_remote_model_t::ARRAH2E,\n IRac::strToModel(\"ARRAH2E\"));\n EXPECT_EQ(whirlpool_ac_remote_model_t::DG11J13A,\n IRac::strToModel(\"DG11J13A\"));\n EXPECT_EQ(1, IRac::strToModel(\"1\"));\n EXPECT_EQ(10, IRac::strToModel(\"10\"));\n EXPECT_EQ(-1, IRac::strToModel(\"0\"));\n EXPECT_EQ(-1, IRac::strToModel(\"FOOBAR\"));\n EXPECT_EQ(0, IRac::strToModel(\"FOOBAR\", 0));\n}\n\nTEST(TestIRac, boolToString) {\n EXPECT_EQ(\"on\", IRac::boolToString(true));\n EXPECT_EQ(\"off\", IRac::boolToString(false));\n}\n\nTEST(TestIRac, opmodeToString) {\n EXPECT_EQ(\"off\", IRac::opmodeToString(stdAc::opmode_t::kOff));\n EXPECT_EQ(\"auto\", IRac::opmodeToString(stdAc::opmode_t::kAuto));\n EXPECT_EQ(\"cool\", IRac::opmodeToString(stdAc::opmode_t::kCool));\n EXPECT_EQ(\"unknown\", IRac::opmodeToString((stdAc::opmode_t)500));\n}\n\nTEST(TestIRac, fanspeedToString) {\n EXPECT_EQ(\"low\", IRac::fanspeedToString(stdAc::fanspeed_t::kLow));\n EXPECT_EQ(\"auto\", IRac::fanspeedToString(stdAc::fanspeed_t::kAuto));\n EXPECT_EQ(\"unknown\", IRac::fanspeedToString((stdAc::fanspeed_t)500));\n}\n\nTEST(TestIRac, swingvToString) {\n EXPECT_EQ(\"off\", IRac::swingvToString(stdAc::swingv_t::kOff));\n EXPECT_EQ(\"low\", IRac::swingvToString(stdAc::swingv_t::kLow));\n EXPECT_EQ(\"auto\", IRac::swingvToString(stdAc::swingv_t::kAuto));\n EXPECT_EQ(\"unknown\", IRac::swingvToString((stdAc::swingv_t)500));\n}\n\nTEST(TestIRac, swinghToString) {\n EXPECT_EQ(\"off\", IRac::swinghToString(stdAc::swingh_t::kOff));\n EXPECT_EQ(\"left\", IRac::swinghToString(stdAc::swingh_t::kLeft));\n EXPECT_EQ(\"auto\", IRac::swinghToString(stdAc::swingh_t::kAuto));\n EXPECT_EQ(\"wide\", IRac::swinghToString(stdAc::swingh_t::kWide));\n EXPECT_EQ(\"unknown\", IRac::swinghToString((stdAc::swingh_t)500));\n}\n\n\/\/ Check that we keep the previous state info if the message is a special\n\/\/ state-less command.\nTEST(TestIRac, CoolixDecodeToState) {\n stdAc::state_t prev;\n prev.mode = stdAc::opmode_t::kHeat;\n prev.power = true;\n prev.celsius = true;\n prev.degrees = 20;\n prev.fanspeed = stdAc::fanspeed_t::kLow;\n\n IRsendTest irsend(0);\n IRrecv irrecv(0);\n irsend.begin();\n irsend.sendCOOLIX(kCoolixOff); \/\/ Special state-less \"off\" message.\n irsend.makeDecodeResult();\n ASSERT_TRUE(irrecv.decode(&irsend.capture));\n stdAc::state_t result;\n ASSERT_TRUE(IRAcUtils::decodeToState(&irsend.capture, &result, &prev));\n ASSERT_EQ(decode_type_t::COOLIX, result.protocol);\n ASSERT_FALSE(result.power);\n ASSERT_EQ(stdAc::opmode_t::kHeat, result.mode);\n ASSERT_TRUE(result.celsius);\n ASSERT_EQ(20, result.degrees);\n ASSERT_EQ(stdAc::fanspeed_t::kLow, result.fanspeed);\n}\n\n\/\/ Check light on\/off functionality in Coolix common a\/c handling.\nTEST(TestIRac, Issue821) {\n stdAc::state_t prev;\n stdAc::state_t next;\n stdAc::state_t result;\n \/\/ state info from:\n \/\/ https:\/\/github.com\/crankyoldgit\/IRremoteESP8266\/issues\/821#issuecomment-513708970\n prev.protocol = decode_type_t::COOLIX;\n prev.model = -1;\n prev.power = true;\n prev.mode = stdAc::opmode_t::kAuto;\n prev.degrees = 24;\n prev.celsius = true;\n prev.fanspeed = stdAc::fanspeed_t::kAuto;\n prev.swingv = stdAc::swingv_t::kOff;\n prev.swingh = stdAc::swingh_t::kOff;\n prev.quiet = false;\n prev.turbo = false;\n prev.econo = false;\n prev.light = false;\n prev.filter = false;\n prev.clean = false;\n prev.beep = false;\n\n next = prev;\n next.light = true;\n\n IRac irac(0);\n IRrecv capture(0);\n IRCoolixAC ac(0);\n\n ac.begin();\n result = irac.handleToggles(next, &prev);\n ASSERT_TRUE(result.light);\n irac.sendAc(next, &prev);\n ASSERT_TRUE(next.light);\n irac.coolix(&ac,\n result.power, \/\/ Power\n result.mode, \/\/ Mode\n result.degrees, \/\/ Celsius\n result.fanspeed, \/\/ Fan speed\n result.swingv, \/\/ Veritcal swing\n result.swingh, \/\/ Horizontal swing\n result.turbo, \/\/ Turbo\n result.light, \/\/ Light\n result.clean, \/\/ Clean\n -1); \/\/ Sleep\n ac._irsend.makeDecodeResult();\n EXPECT_TRUE(capture.decode(&ac._irsend.capture));\n ASSERT_EQ(COOLIX, ac._irsend.capture.decode_type);\n ASSERT_EQ(kCoolixBits, ac._irsend.capture.bits);\n ASSERT_EQ(\"Power: On, Led: Toggle\",\n IRAcUtils::resultAcToString(&ac._irsend.capture));\n EXPECT_EQ(\n \"f38000d50m\"\n \"4480s4480\"\n \"m560s1680m560s560m560s1680m560s1680m560s560m560s1680m560s560m560s1680\"\n \"m560s560m560s1680m560s560m560s560m560s1680m560s560m560s1680m560s560\"\n \"m560s1680m560s1680m560s1680m560s1680m560s560m560s1680m560s560m560s1680\"\n \"m560s560m560s560m560s560m560s560m560s1680m560s560m560s1680m560s560\"\n \"m560s1680m560s560m560s1680m560s560m560s560m560s1680m560s560m560s1680\"\n \"m560s560m560s1680m560s560m560s1680m560s1680m560s560m560s1680m560s560\"\n \"m560s5040\"\n \"m4480s4480\"\n \"m560s1680m560s560m560s1680m560s1680m560s560m560s1680m560s560m560s1680\"\n \"m560s560m560s1680m560s560m560s560m560s1680m560s560m560s1680m560s560\"\n \"m560s1680m560s1680m560s1680m560s1680m560s560m560s1680m560s560m560s1680\"\n \"m560s560m560s560m560s560m560s560m560s1680m560s560m560s1680m560s560\"\n \"m560s1680m560s560m560s1680m560s560m560s560m560s1680m560s560m560s1680\"\n \"m560s560m560s1680m560s560m560s1680m560s1680m560s560m560s1680m560s560\"\n \"m560s105040\"\n \"m4480s4480\"\n \"m560s1680m560s560m560s1680m560s1680m560s560m560s560m560s1680m560s560\"\n \"m560s560m560s1680m560s560m560s560m560s1680m560s1680m560s560m560s1680\"\n \"m560s560m560s560m560s560m560s1680m560s1680m560s1680m560s1680m560s1680\"\n \"m560s1680m560s1680m560s1680m560s560m560s560m560s560m560s560m560s560\"\n \"m560s560m560s1680m560s560m560s560m560s1680m560s560m560s560m560s560\"\n \"m560s1680m560s560m560s1680m560s1680m560s560m560s1680m560s1680m560s1680\"\n \"m560s5040\"\n \"m4480s4480\"\n \"m560s1680m560s560m560s1680m560s1680m560s560m560s560m560s1680m560s560\"\n \"m560s560m560s1680m560s560m560s560m560s1680m560s1680m560s560m560s1680\"\n \"m560s560m560s560m560s560m560s1680m560s1680m560s1680m560s1680m560s1680\"\n \"m560s1680m560s1680m560s1680m560s560m560s560m560s560m560s560m560s560\"\n \"m560s560m560s1680m560s560m560s560m560s1680m560s560m560s560m560s560\"\n \"m560s1680m560s560m560s1680m560s1680m560s560m560s1680m560s1680m560s1680\"\n \"m560s105040\",\n ac._irsend.outputStr());\n}\n","avg_line_length":40.4608058608,"max_line_length":86,"alphanum_fraction":0.5774864654,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":338,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":null,"content":"#include \"src\/countUniqueWords.h\"\n\nint main(int argc, char **argv) {\n errors(argc);\n std::ifstream file(argv[1]);\n std::multiset names;\n\n errorOpenFile(file);\n parsFile(file, names);\n errorNameSize(std::distance(names.begin(), names.end()));\n createFile(argv[1], names);\n file.close();\n return 0;\n}","avg_line_length":24.1428571429,"max_line_length":61,"alphanum_fraction":0.6390532544,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":7764,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["BSD-3-Clause"],"max_stars_count":30.0,"content":"\n\n#include \"toonz\/txshzeraryfxcolumn.h\"\n#include \"toonz\/tcolumnfx.h\"\n#include \"toonz\/toonzscene.h\"\n#include \"toonz\/txshcell.h\"\n#include \"toonz\/txsheet.h\"\n#include \"toonz\/fxdag.h\"\n#include \"toonz\/txshzeraryfxlevel.h\"\n#include \"toonz\/preferences.h\"\n\n#include \"tstream.h\"\n\n\/\/=============================================================================\n\/\/ TXshZeraryFxColumn\n\nTXshZeraryFxColumn::TXshZeraryFxColumn(int frameCount)\n : m_zeraryColumnFx(new TZeraryColumnFx())\n , m_zeraryFxLevel(new TXshZeraryFxLevel())\n , m_iconVisible(false) {\n m_zeraryColumnFx->addRef();\n m_zeraryColumnFx->setColumn(this);\n m_zeraryFxLevel->addRef();\n m_zeraryFxLevel->setColumn(this);\n if (frameCount <= 0) return;\n for (int i = 0; i < frameCount; i++)\n setCell(i, TXshCell(m_zeraryFxLevel, TFrameId(1)));\n}\n\n\/\/-----------------------------------------------------------------------------\n\nTXshZeraryFxColumn::TXshZeraryFxColumn(const TXshZeraryFxColumn &src)\n : m_zeraryColumnFx(new TZeraryColumnFx())\n , m_zeraryFxLevel(new TXshZeraryFxLevel())\n , m_iconVisible(false) {\n m_zeraryColumnFx->addRef();\n m_zeraryColumnFx->setColumn(this);\n m_zeraryFxLevel->addRef();\n m_zeraryFxLevel->setColumn(this);\n m_first = src.m_first;\n int i;\n for (i = 0; i < (int)src.m_cells.size(); i++) {\n if (Preferences::instance()->isImplicitHoldEnabled() &&\n src.m_cells[i].getFrameId().isEmptyFrame())\n m_cells.push_back(TXshCell(0, src.m_cells[i].getFrameId()));\n else\n m_cells.push_back(TXshCell(m_zeraryFxLevel, src.m_cells[i].getFrameId()));\n }\n assert((int)src.m_cells.size() == (int)m_cells.size());\n TFx *fx = src.getZeraryColumnFx()->getZeraryFx();\n if (fx) {\n std::wstring fxName = fx->getName();\n fx = fx->clone(false);\n fx->setName(fxName);\n m_zeraryColumnFx->setZeraryFx(fx);\n }\n}\n\n\/\/-----------------------------------------------------------------------------\n\nTXshZeraryFxColumn::~TXshZeraryFxColumn() {\n m_zeraryColumnFx->setColumn(0);\n m_zeraryColumnFx->release();\n m_zeraryFxLevel->release();\n}\n\n\/\/-----------------------------------------------------------------------------\n\nTXshColumn::ColumnType TXshZeraryFxColumn::getColumnType() const {\n return eZeraryFxType;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nbool TXshZeraryFxColumn::canSetCell(const TXshCell &cell) const {\n return cell.isEmpty() || cell.m_level->getZeraryFxLevel() != 0;\n}\n\n\/\/-----------------------------------------------------------------------------\n\nTXshColumn *TXshZeraryFxColumn::clone() const {\n return new TXshZeraryFxColumn(*this);\n}\n\n\/\/-----------------------------------------------------------------------------\n\nTFx *TXshZeraryFxColumn::getFx() const { return m_zeraryColumnFx; }\n\n\/\/-----------------------------------------------------------------------------\n\nbool TXshZeraryFxColumn::setCell(int row, const TXshCell &cell) {\n if (cell.isEmpty()) return false;\n TXshCell newCell = cell;\n \/\/ Sto settando delle celle in una colonna nuova, devo settare anche\n \/\/ l'effetto.\n if (isEmpty() && getZeraryColumnFx()->getZeraryFx() == 0) {\n newCell = TXshCell(m_zeraryFxLevel, cell.getFrameId());\n TXshZeraryFxLevel *fxLevel = cell.m_level->getZeraryFxLevel();\n TXshZeraryFxColumn *fxColumn = fxLevel->getColumn();\n m_zeraryColumnFx->setZeraryFx(fxColumn->getZeraryColumnFx()->getZeraryFx());\n }\n\n return TXshCellColumn::setCell(row, newCell);\n}\n\n\/\/-----------------------------------------------------------------------------\n\nbool TXshZeraryFxColumn::setCells(int row, int rowCount,\n const TXshCell cells[]) {\n std::vector newCells;\n bool isEmptyColumn = isEmpty() && getZeraryColumnFx()->getZeraryFx() == 0;\n int i;\n for (i = 0; i < rowCount; i++) {\n if (isEmptyColumn) {\n if (Preferences::instance()->isImplicitHoldEnabled() &&\n cells[i].getFrameId().isEmptyFrame())\n newCells.push_back(TXshCell(0, cells[i].getFrameId()));\n else\n newCells.push_back(TXshCell(m_zeraryFxLevel, cells[i].getFrameId()));\n } else\n newCells.push_back(cells[i]);\n }\n \/\/ Sto settando delle celle in una colonna nuova, devo settare anche\n \/\/ l'effetto.\n if (isEmptyColumn) {\n i = 0;\n while (i < rowCount && cells[i].isEmpty()) i++;\n if (i >= rowCount) return false;\n TXshZeraryFxLevel *fxLevel =\n dynamic_cast(cells[i].m_level.getPointer());\n TXshZeraryFxColumn *fxColumn = fxLevel->getColumn();\n m_zeraryColumnFx->setZeraryFx(fxColumn->getZeraryColumnFx()->getZeraryFx());\n }\n return TXshCellColumn::setCells(row, rowCount, &newCells[0]);\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid TXshZeraryFxColumn::loadData(TIStream &is) {\n TPersist *p = 0;\n is >> p;\n if (!p) return;\n\n TZeraryColumnFx *fx = dynamic_cast(p);\n fx->addRef();\n if (m_zeraryColumnFx) {\n m_zeraryColumnFx->setColumn(0);\n m_zeraryColumnFx->release();\n }\n m_zeraryColumnFx = fx;\n m_zeraryColumnFx->setColumn(this);\n\n int r0, r1;\n bool touched = false;\n TXshCell cell(m_zeraryFxLevel, TFrameId(1));\n std::string tagName;\n while (is.matchTag(tagName)) {\n if (tagName == \"status\") {\n int status;\n is >> status;\n setStatusWord(status);\n } else if (tagName == \"cells\") {\n while (is.matchTag(tagName)) {\n if (tagName == \"cell\") {\n if (!touched) {\n touched = true;\n if (getRange(r0, r1)) removeCells(r0, r1 - r0 + 1);\n }\n int r, n;\n is >> r >> n;\n if (is.getTagAttribute(\"stopframe\") == \"yes\")\n cell.m_frameId = TFrameId::STOP_FRAME;\n else\n cell.m_frameId = 1;\n for (int i = 0; i < n; i++) setCell(r++, cell);\n } else\n throw TException(\"expected \");\n is.closeChild();\n }\n } else if (loadCellMarks(tagName, is)) {\n \/\/ do nothing\n } else\n throw TException(\"expected or \");\n is.closeChild();\n }\n}\n\n\/\/-----------------------------------------------------------------------------\n\nvoid TXshZeraryFxColumn::saveData(TOStream &os) {\n os << m_zeraryColumnFx;\n os.child(\"status\") << getStatusWord();\n int r0, r1;\n if (getRange(r0, r1)) {\n os.openChild(\"cells\");\n for (int r = r0; r <= r1; r++) {\n TXshCell cell = getCell(r, false);\n if (cell.isEmpty()) continue;\n int fnum = cell.m_frameId.getNumber();\n if (fnum > 1) fnum = 1; \/\/ Should always be 1 unless it's stopframe\n int n = 1;\n\n if (r < r1) {\n TXshCell cell2 = getCell(r + 1, false);\n if (!cell2.isEmpty()) {\n int fnum2 = cell2.m_frameId.getNumber();\n if (fnum2 > 1) fnum2 = 1; \/\/ Should always be 1 unless it's stopframe\n if (fnum == fnum2) {\n n++;\n for (;;) {\n if (r + n > r1) break;\n cell2 = getCell(r + n, false);\n if (cell2.isEmpty()) break;\n fnum2 = cell2.m_frameId.getNumber();\n if (fnum2 > 1)\n fnum2 = 1; \/\/ Should always be 1 unless it's stopframe\n if (fnum != fnum2) break;\n n++;\n }\n }\n }\n }\n std::map attr;\n if (cell.m_frameId.isStopFrame()) attr[\"stopframe\"] = \"yes\";\n os.openChild(\"cell\", attr);\n os << r << n;\n os.closeChild();\n r += n - 1;\n }\n os.closeChild();\n }\n \/\/ cell marks\n saveCellMarks(os);\n}\n\n\/\/-----------------------------------------------------------------------------\n\nPERSIST_IDENTIFIER(TXshZeraryFxColumn, \"zeraryFxColumn\")\n","avg_line_length":32.4853556485,"max_line_length":80,"alphanum_fraction":0.5414734673,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":134,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["BSD-3-Clause"],"max_stars_count":null,"content":"\n#include \"VMStack.hpp\"\n\nvm_stack_t::vm_stack_t() {}\n\nvm_stack_t::~vm_stack_t()\n{\n\tfor( auto & val : m_vec ) {\n\t\tVAR_DREF( val );\n\t}\n}","avg_line_length":12.1818181818,"max_line_length":28,"alphanum_fraction":0.6194029851,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":5490,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["Apache-2.0"],"max_stars_count":3.0,"content":"\/*\n * Copyright 2016 Facebook, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#ifndef __STDC_FORMAT_MACROS\n#define __STDC_FORMAT_MACROS 1\n#endif\n\n#include \n#include \n\n#include \n\n#include \n\n#include \n#include \n\n#include \n\nusing namespace folly;\nusing namespace folly::detail;\n\n\/\/ The defaults were generated by a separate program that requires the\n\/\/ NTL (Number Theory Library) from http:\/\/www.shoup.net\/ntl\/\n\/\/\n\/\/ Briefly: randomly generate a polynomial of degree D, test for\n\/\/ irreducibility, repeat until you find an irreducible polynomial\n\/\/ (roughly 1\/D of all polynomials of degree D are irreducible, so\n\/\/ this will succeed in D\/2 tries on average; D is small (64..128) so\n\/\/ this simple method works well)\n\/\/\n\/\/ DO NOT REPLACE THE POLYNOMIALS USED, EVER, as that would change the value\n\/\/ of every single fingerprint in existence.\nDEFINE_int64(poly64, 0xbf3736b51869e9b7,\n \"Generate 64-bit tables using this polynomial\");\nDEFINE_int64(poly96_m, 0x51555cb0aa8d39c3,\n \"Generate 96-bit tables using this polynomial \"\n \"(most significant 64 bits)\");\nDEFINE_int32(poly96_l, 0xb679ec37,\n \"Generate 96-bit tables using this polynomial \"\n \"(least significant 32 bits)\");\nDEFINE_int64(poly128_m, 0xc91bff9b8768b51b,\n \"Generate 128-bit tables using this polynomial \"\n \"(most significant 64 bits)\");\nDEFINE_int64(poly128_l, 0x8c5d5853bd77b0d3,\n \"Generate 128-bit tables using this polynomial \"\n \"(least significant 64 bits)\");\nDEFINE_string(install_dir, \".\",\n \"Direectory to place output files in\");\nDEFINE_string(fbcode_dir, \"\", \"fbcode directory (ignored)\");\n\nnamespace {\n\ntemplate \nvoid computeTables(FILE* file, const FingerprintPolynomial& poly) {\n uint64_t table[8][256][FingerprintPolynomial::size()];\n \/\/ table[i][q] is Q(X) * X^(k+8*i) mod P(X),\n \/\/ where k is the number of bits in the fingerprint (and deg(P)) and\n \/\/ Q(X) = q7*X^7 + q6*X^6 + ... + q1*X + q0 is a degree-7 polyonomial\n \/\/ whose coefficients are the bits of q.\n for (int x = 0; x < 256; x++) {\n FingerprintPolynomial t;\n t.setHigh8Bits(x);\n for (int i = 0; i < 8; i++) {\n t.mulXkmod(8, poly);\n t.write(&(table[i][x][0]));\n }\n }\n\n \/\/ Write the actual polynomial used; this isn't needed during fast\n \/\/ fingerprint calculation, but it's useful for reference and unittesting.\n uint64_t poly_val[FingerprintPolynomial::size()];\n poly.write(poly_val);\n CHECK_ERR(fprintf(file,\n \"template <>\\n\"\n \"const uint64_t FingerprintTable<%d>::poly[%d] = {\",\n DEG+1, FingerprintPolynomial::size()));\n for (int j = 0; j < FingerprintPolynomial::size(); j++) {\n CHECK_ERR(fprintf(file, \"%s%\" PRIu64 \"LU\", j ? \", \" : \"\", poly_val[j]));\n }\n CHECK_ERR(fprintf(file, \"};\\n\\n\"));\n\n \/\/ Write the tables.\n CHECK_ERR(fprintf(file,\n \"template <>\\n\"\n \"const uint64_t FingerprintTable<%d>::table[8][256][%d] = {\\n\",\n DEG+1, FingerprintPolynomial::size()));\n for (int i = 0; i < 8; i++) {\n CHECK_ERR(fprintf(file,\n \" \/\/ Table %d\"\n \"\\n\"\n \" {\\n\", i));\n for (int x = 0; x < 256; x++) {\n CHECK_ERR(fprintf(file, \" {\"));\n for (int j = 0; j < FingerprintPolynomial::size(); j++) {\n CHECK_ERR(fprintf(\n file, \"%s%\" PRIu64 \"LU\", (j ? \", \" : \"\"), table[i][x][j]));\n }\n CHECK_ERR(fprintf(file, \"},\\n\"));\n }\n CHECK_ERR(fprintf(file, \" },\\n\"));\n }\n CHECK_ERR(fprintf(file, \"\\n};\\n\\n\"));\n}\n\n} \/\/ namespace\n\nint main(int argc, char *argv[]) {\n gflags::ParseCommandLineFlags(&argc, &argv, true);\n google::InitGoogleLogging(argv[0]);\n\n std::string name = folly::format(\"{}\/{}\", FLAGS_install_dir,\n \"FingerprintTables.cpp\").str();\n FILE* file = fopen(name.c_str(), \"w\");\n PCHECK(file);\n\n CHECK_ERR(fprintf(file,\n \"\/**\\n\"\n \" * Fingerprint tables for 64-, 96-, and 128-bit Rabin fingerprints.\\n\"\n \" *\\n\"\n \" * AUTOMATICALLY GENERATED. DO NOT EDIT.\\n\"\n \" *\/\\n\"\n \"\\n\"\n \"#include \\n\"\n \"\\n\"\n \"namespace folly {\\n\"\n \"namespace detail {\\n\"\n \"\\n\"));\n\n FingerprintPolynomial<63> poly64((const uint64_t*)&FLAGS_poly64);\n computeTables(file, poly64);\n\n uint64_t poly96_val[2];\n poly96_val[0] = (uint64_t)FLAGS_poly96_m;\n poly96_val[1] = (uint64_t)FLAGS_poly96_l << 32;\n FingerprintPolynomial<95> poly96(poly96_val);\n computeTables(file, poly96);\n\n uint64_t poly128_val[2];\n poly128_val[0] = (uint64_t)FLAGS_poly128_m;\n poly128_val[1] = (uint64_t)FLAGS_poly128_l;\n FingerprintPolynomial<127> poly128(poly128_val);\n computeTables(file, poly128);\n\n CHECK_ERR(fprintf(file,\n \"} \/\/ namespace detail\\n\"\n \"} \/\/ namespace folly\\n\"));\n CHECK_ERR(fclose(file));\n\n return 0;\n}\n","avg_line_length":33.2727272727,"max_line_length":77,"alphanum_fraction":0.6453551913,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":914,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":null,"content":"#include \n#include \n#include \n#include \n#include \n\n\nvoid DetectingCycles(std::vector const &line)\n{\n \/\/TODO\n}\n\nint main(int argc, char *argv[])\n{\n if (argc != 2) {\n std::cerr << \"usage: .\/detecting_cycles \" << std::endl;\n return -1;\n }\n\n std::ifstream file(argv[1]); \/\/get filename and open\n if (file.is_open()) {\n std::string line;\n\n while (std::getline(file, line)) { \/\/read line by line\n std::vector v;\n std::stringstream ss(line);\n std::string tmp;\n \/\/token -> convert -> push back\n while (std::getline(ss, tmp, ' ')) {\n v.push_back(atoi(tmp.c_str()));\n }\n DetectingCycles(v);\n }\n } else {\n std::cerr << \"could not open file: \" << argv[1] << std::endl;\n return -1;\n }\n return 0;\n}\n","avg_line_length":22.85,"max_line_length":73,"alphanum_fraction":0.5142231947,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":2035,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT"],"max_stars_count":null,"content":"#include\r\nusing namespace std;\r\n\r\nclass Node\r\n{\r\n\tprivate:\r\n\t\tint val;\r\n\t\tNode *nextNode;\r\n\t\r\n\tpublic:\r\n\t\tvoid setVal(int v)\r\n\t\t{\r\n\t\t\tval = v;\r\n\t\t}\r\n\t\tint getVal()\r\n\t\t{\r\n\t\t\treturn val;\r\n\t\t}\r\n\t\t\r\n\t\tvoid setNextNode(Node *next)\r\n\t\t{\r\n\t\t\tnextNode = next;\r\n\t\t}\r\n\t\tNode* getNextNode()\r\n\t\t{\r\n\t\t\treturn nextNode;\r\n\t\t}\r\n\t\t\r\n};\r\n\r\nclass LList\r\n{\r\n\tprivate:\r\n\t\tNode *head;\r\n\t\tNode *last;\r\n\t\tNode *current;\r\n\t\tint size;\r\n\t\r\n\tpublic:\r\n\t\t\r\n\t\tLList()\r\n\t\t{\r\n\t\t\thead = new Node();\r\n\t\t\tcurrent = head;\r\n\t\t\tlast = head;\r\n\t\t\tsize = 0;\r\n\t\t}\r\n\t\t\r\n\t\tvoid addToEndOfList(int v)\r\n\t\t{\r\n\t\t\t\/\/create a new node object\r\n\t\t\tNode *temp = new Node();\r\n\t\t\ttemp->setVal(v);\r\n\t\t\ttemp->setNextNode(NULL);\r\n\t\t\t\r\n\t\t\t\/\/attach it to the list\r\n\t\t\tlast->setNextNode(temp);\r\n\t\t\tlast = temp;\r\n\t\t\tsize++;\r\n\t\t}\r\n\t\t\r\n\t\tvoid addNodeToCurrent(int v)\r\n\t\t{\r\n\t\t\tNode *tempNode = new Node();\r\n\t\t\ttempNode->setVal(v);\r\n\t\t\t\r\n\t\t\ttempNode->setNextNode(current->getNextNode()); \r\n\t\t\tcurrent->setNextNode(tempNode);\r\n\t\t\tcurrent = tempNode;\r\n\t\t\t\r\n\t\t\tsize++;\r\n\t\t\t\/\/List is empty - remember our head node is a dummy\r\n\t\t\t\/\/if it is inserted somewhere in the middle of list\r\n\t\t\t\/\/current is at the end of the list\r\n\t\t}\r\n\t\t\r\n\t\tvoid printList()\r\n\t\t{\r\n\t\t\tNode *TCurrent = head->getNextNode();\r\n\t\t\tfor(int i=0; igetVal()<<\" \";\r\n\t\t\t\tTCurrent = TCurrent->getNextNode();\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\tvoid moveCurrentToLast()\r\n\t\t{\r\n\t\t\tif(size!=0)\r\n\t\t\t{\r\n\t\t\t\twhile(current->getNextNode() != NULL)\r\n\t\t\t\t{\r\n\t\t\t\t\tcurrent = current->getNextNode();\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\tvoid moveCurrentToFirst()\r\n\t\t{\r\n\t\t\tif(size!=0)\r\n\t\t\t{\r\n\t\t\t\tcurrent = head->getNextNode();\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\tvoid moveCurrentToHead()\r\n\t\t{\r\n\t\t\tcurrent = head;\r\n\t\t}\r\n};\r\n\r\nint main()\r\n{\r\n\tLList myList;\r\n\tmyList.addToEndOfList(10);\r\n\tmyList.addToEndOfList(20);\r\n\tmyList.addToEndOfList(30);\r\n\tmyList.addToEndOfList(40);\r\n\tmyList.addToEndOfList(50);\r\n\t\r\n\tmyList.addNodeToCurrent(5);\r\n\tmyList.addNodeToCurrent(8);\r\n\t\r\n\tmyList.moveCurrentToHead();\r\n\tmyList.addNodeToCurrent(4);\r\n\t\r\n\tmyList.printList();\r\n\t\r\n}","avg_line_length":15.7751937984,"max_line_length":55,"alphanum_fraction":0.5626535627,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":1352,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["BSD-3-Clause"],"max_stars_count":null,"content":"\/*\n * Copyright 2016 Facebook, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http:\/\/www.apache.org\/licenses\/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\/\n\n#include \n\nnamespace thpp {\n\nnamespace detail {\n\nCudaIOBufAllocator::CudaIOBufAllocator(folly::IOBuf&& iob)\n : iob_(std::move(iob)) { }\n\ncudaError_t CudaIOBufAllocator::malloc(\n THCState* state, void** ptr, long size) {\n LOG(FATAL) << \"CudaIOBufAllocator::malloc should never be called\";\n return cudaSuccess; \/\/ not reached\n}\n\ncudaError_t CudaIOBufAllocator::realloc(\n THCState* state, void** ptr, long oldSize, long newSize) {\n LOG(FATAL) << \"CudaIOBufAllocator::realloc should never be called\";\n return cudaSuccess; \/\/ not reached\n}\n\ncudaError_t CudaIOBufAllocator::free(THCState* stat, void* ptr) {\n CHECK_EQ(ptr, iob_.writableData());\n delete this;\n return cudaSuccess;\n}\n\n} \/\/ namespace detail\n\n} \/\/ namespaces\n","avg_line_length":28.7659574468,"max_line_length":75,"alphanum_fraction":0.7270710059,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":1401,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["Apache-2.0"],"max_stars_count":305.0,"content":"\/\/===----------------------------------------------------------------------===\/\/\n\/\/\n\/\/ Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.\n\/\/ See https:\/\/llvm.org\/LICENSE.txt for license information.\n\/\/ SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\n\/\/\n\/\/===----------------------------------------------------------------------===\/\/\n\n\/\/ \n\n\/\/ template <> class codecvt\n\n\/\/ result out(stateT& state,\n\/\/ const internT* from, const internT* from_end, const internT*& from_next,\n\/\/ externT* to, externT* to_end, externT*& to_next) const;\n\n\/\/ UNSUPPORTED: c++03, c++11, c++14, c++17\n\n\/\/ C++20 codecvt specializations for char8_t are not yet implemented:\n\/\/ UNSUPPORTED: libc++\n\n#include \n#include \n\nint main(int, char**) {\n using F = std::codecvt;\n const F& f = std::use_facet(std::locale::classic());\n F::intern_type from[9] = {'s', 'o', 'm', 'e', ' ', 't', 'e', 'x', 't'};\n F::extern_type to[9] = {0};\n std::mbstate_t mbs = {};\n const F::intern_type* from_next = nullptr;\n F::extern_type* to_next = nullptr;\n F::result r = f.out(mbs, from, from + 9, from_next, to, to + 9, to_next);\n assert(r == F::ok);\n assert(from_next - from == 9);\n assert(to_next - to == 9);\n for (unsigned i = 0; i < 9; ++i)\n assert(to[i] == from[i]);\n return 0;\n}\n","avg_line_length":34.1707317073,"max_line_length":86,"alphanum_fraction":0.5553176303,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":458,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["BSD-3-Clause"],"max_stars_count":1.0,"content":"\/**\n * Copyright 2017 Jacques Florence\n * All rights reserved.\n * See License.txt file\n *\n *\/\n\n\n\n#include \"squareMaxTempEstimator.h\"\n\n#include \n#include \n\nusing namespace RlScheduler;\n\nSquareMaxTempEstimator::SquareMaxTempEstimator() :\n\tproc(Scheduler::System::getInstance()->getProc())\n{\n}\n\ndouble SquareMaxTempEstimator::getMaximumTemperature()\n{\n\tconst double temp = proc->getTemperature();\n\treturn temp*temp;\n}\n","avg_line_length":16.962962963,"max_line_length":54,"alphanum_fraction":0.7489082969,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":31599,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["Naumen","Condor-1.1","MS-PL"],"max_stars_count":1.0,"content":"\/*\n * ***** BEGIN GPL LICENSE BLOCK *****\n *\n * This program is free software; you can redistribute it and\/or\n * modify it under the terms of the GNU General Public License\n * as published by the Free Software Foundation; either version 2\n * of the License, or (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.\n *\n * The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.\n * All rights reserved.\n *\n * The Original Code is: all of this file.\n *\n * Contributor(s): none yet.\n *\n * ***** END GPL LICENSE BLOCK *****\n * Camera in the gameengine. Cameras are also used for views.\n *\/\n\n\/** \\file gameengine\/Ketsji\/KX_Camera.cpp\n * \\ingroup ketsji\n *\/\n\n#include \"KX_Camera.h\"\n\n#include \"GPU_glew.h\"\n#include \"GPU_matrix.h\"\n#include \"GPU_viewport.h\"\n\n#include \"KX_Globals.h\"\n#include \"KX_PyMath.h\"\n#include \"RAS_ICanvas.h\"\n\nKX_Camera::KX_Camera(void *sgReplicationInfo,\n SG_Callbacks callbacks,\n const RAS_CameraData &camdata,\n bool frustum_culling,\n bool delete_node)\n : KX_GameObject(sgReplicationInfo, callbacks),\n m_camdata(camdata),\n m_gpuViewport(nullptr), \/\/ eevee\n m_dirty(true),\n m_normalized(false),\n m_frustum_culling(frustum_culling),\n m_set_projection_matrix(false),\n m_delete_node(delete_node),\n m_lodDistanceFactor(1.0f),\n m_showDebugCameraFrustum(false)\n{\n \/\/ setting a name would be nice...\n m_name = \"cam\";\n m_projection_matrix.setIdentity();\n m_modelview_matrix.setIdentity();\n}\n\nKX_Camera::~KX_Camera()\n{\n RemoveGPUViewport();\n if (m_delete_node && m_pSGNode) {\n \/\/ for shadow camera, avoids memleak\n delete m_pSGNode;\n m_pSGNode = nullptr;\n }\n}\n\nGPUViewport *KX_Camera::GetGPUViewport()\n{\n if (!m_gpuViewport) {\n m_gpuViewport = GPU_viewport_create();\n }\n return m_gpuViewport;\n}\n\nvoid KX_Camera::RemoveGPUViewport()\n{\n if (m_gpuViewport && m_gpuViewport != GetScene()->GetCurrentGPUViewport()) {\n GPU_viewport_free(m_gpuViewport);\n m_gpuViewport = nullptr;\n }\n}\n\nCValue *KX_Camera::GetReplica()\n{\n KX_Camera *replica = new KX_Camera(*this);\n\n \/\/ this will copy properties and so on...\n replica->ProcessReplica();\n\n return replica;\n}\n\nvoid KX_Camera::ProcessReplica()\n{\n KX_GameObject::ProcessReplica();\n \/\/ replicated camera are always registered in the scene\n m_delete_node = false;\n}\n\nMT_Transform KX_Camera::GetWorldToCamera() const\n{\n MT_Transform camtrans;\n camtrans.invert(MT_Transform(NodeGetWorldPosition(), NodeGetWorldOrientation()));\n\n return camtrans;\n}\n\nMT_Transform KX_Camera::GetCameraToWorld() const\n{\n return MT_Transform(NodeGetWorldPosition(), NodeGetWorldOrientation());\n}\n\n\/**\n * Sets the projection matrix that is used by the rasterizer.\n *\/\nvoid KX_Camera::SetProjectionMatrix(const MT_Matrix4x4 &mat)\n{\n m_projection_matrix = mat;\n m_dirty = true;\n m_set_projection_matrix = true;\n}\n\n\/**\n * Sets the modelview matrix that is used by the rasterizer.\n *\/\nvoid KX_Camera::SetModelviewMatrix(const MT_Matrix4x4 &mat)\n{\n m_modelview_matrix = mat;\n m_dirty = true;\n}\n\n\/**\n * Gets the projection matrix that is used by the rasterizer.\n *\/\nconst MT_Matrix4x4 &KX_Camera::GetProjectionMatrix() const\n{\n return m_projection_matrix;\n}\n\n\/**\n * Gets the modelview matrix that is used by the rasterizer.\n *\/\nconst MT_Matrix4x4 &KX_Camera::GetModelviewMatrix() const\n{\n return m_modelview_matrix;\n}\n\nbool KX_Camera::hasValidProjectionMatrix() const\n{\n return m_set_projection_matrix;\n}\n\nvoid KX_Camera::InvalidateProjectionMatrix(bool valid)\n{\n m_set_projection_matrix = valid;\n}\n\n\/**\n * These getters retrieve the clip data and the focal length\n *\/\nfloat KX_Camera::GetLens() const\n{\n return m_camdata.m_lens;\n}\n\nfloat KX_Camera::GetScale() const\n{\n return m_camdata.m_scale;\n}\n\n\/**\n * Gets the horizontal size of the sensor - for camera matching.\n *\/\nfloat KX_Camera::GetSensorWidth() const\n{\n return m_camdata.m_sensor_x;\n}\n\n\/**\n * Gets the vertical size of the sensor - for camera matching.\n *\/\nfloat KX_Camera::GetSensorHeight() const\n{\n return m_camdata.m_sensor_y;\n}\n\/** Gets the mode FOV is calculating from sensor dimensions *\/\nshort KX_Camera::GetSensorFit() const\n{\n return m_camdata.m_sensor_fit;\n}\n\n\/**\n * Gets the horizontal shift of the sensor - for camera matching.\n *\/\nfloat KX_Camera::GetShiftHorizontal() const\n{\n return m_camdata.m_shift_x;\n}\n\n\/**\n * Gets the vertical shift of the sensor - for camera matching.\n *\/\nfloat KX_Camera::GetShiftVertical() const\n{\n return m_camdata.m_shift_y;\n}\n\nfloat KX_Camera::GetCameraNear() const\n{\n return m_camdata.m_clipstart;\n}\n\nfloat KX_Camera::GetCameraFar() const\n{\n return m_camdata.m_clipend;\n}\n\nfloat KX_Camera::GetFocalLength() const\n{\n return m_camdata.m_focallength;\n}\n\nRAS_CameraData *KX_Camera::GetCameraData()\n{\n return &m_camdata;\n}\n\nvoid KX_Camera::SetShowCameraFrustum(bool show)\n{\n m_showDebugCameraFrustum = show;\n}\n\nbool KX_Camera::GetShowCameraFrustum() const\n{\n return m_showDebugCameraFrustum;\n}\n\nfloat KX_Camera::GetLodDistanceFactor() const\n{\n return m_lodDistanceFactor;\n}\n\nvoid KX_Camera::SetLodDistanceFactor(float lodfactor)\n{\n m_lodDistanceFactor = lodfactor;\n}\n\nvoid KX_Camera::ExtractFrustum()\n{\n if (m_dirty) {\n m_frustum = SG_Frustum(m_projection_matrix * m_modelview_matrix);\n m_dirty = false;\n }\n}\n\nconst SG_Frustum &KX_Camera::GetFrustum()\n{\n ExtractFrustum();\n return m_frustum;\n}\n\nbool KX_Camera::GetFrustumCulling() const\n{\n return m_frustum_culling;\n}\n\nvoid KX_Camera::EnableViewport(bool viewport)\n{\n InvalidateProjectionMatrix(false); \/\/ We need to reset projection matrix\n m_camdata.m_viewport = viewport;\n}\n\nvoid KX_Camera::SetViewport(int left, int bottom, int right, int top)\n{\n m_camdata.m_viewportleft = left;\n m_camdata.m_viewportbottom = bottom;\n m_camdata.m_viewportright = right;\n m_camdata.m_viewporttop = top;\n}\n\nbool KX_Camera::GetViewport() const\n{\n return m_camdata.m_viewport;\n}\n\nint KX_Camera::GetViewportLeft() const\n{\n return m_camdata.m_viewportleft;\n}\n\nint KX_Camera::GetViewportBottom() const\n{\n return m_camdata.m_viewportbottom;\n}\n\nint KX_Camera::GetViewportRight() const\n{\n return m_camdata.m_viewportright;\n}\n\nint KX_Camera::GetViewportTop() const\n{\n return m_camdata.m_viewporttop;\n}\n\n#ifdef WITH_PYTHON\n\/\/----------------------------------------------------------------------------\n\/\/ Python\n\nPyMethodDef KX_Camera::Methods[] = {\n KX_PYMETHODTABLE(KX_Camera, sphereInsideFrustum),\n KX_PYMETHODTABLE_O(KX_Camera, boxInsideFrustum),\n KX_PYMETHODTABLE_O(KX_Camera, pointInsideFrustum),\n KX_PYMETHODTABLE_NOARGS(KX_Camera, getCameraToWorld),\n KX_PYMETHODTABLE_NOARGS(KX_Camera, getWorldToCamera),\n KX_PYMETHODTABLE(KX_Camera, setViewport),\n KX_PYMETHODTABLE_NOARGS(KX_Camera, setOnTop),\n KX_PYMETHODTABLE_O(KX_Camera, getScreenPosition),\n KX_PYMETHODTABLE(KX_Camera, getScreenVect),\n KX_PYMETHODTABLE(KX_Camera, getScreenRay),\n {nullptr, nullptr} \/\/ Sentinel\n};\n\nPyAttributeDef KX_Camera::Attributes[] = {\n\n KX_PYATTRIBUTE_BOOL_RW(\"frustum_culling\", KX_Camera, m_frustum_culling),\n KX_PYATTRIBUTE_RW_FUNCTION(\n \"perspective\", KX_Camera, pyattr_get_perspective, pyattr_set_perspective),\n\n KX_PYATTRIBUTE_RW_FUNCTION(\"lens\", KX_Camera, pyattr_get_lens, pyattr_set_lens),\n KX_PYATTRIBUTE_RW_FUNCTION(\"fov\", KX_Camera, pyattr_get_fov, pyattr_set_fov),\n KX_PYATTRIBUTE_RW_FUNCTION(\n \"ortho_scale\", KX_Camera, pyattr_get_ortho_scale, pyattr_set_ortho_scale),\n KX_PYATTRIBUTE_RW_FUNCTION(\"near\", KX_Camera, pyattr_get_near, pyattr_set_near),\n KX_PYATTRIBUTE_RW_FUNCTION(\"far\", KX_Camera, pyattr_get_far, pyattr_set_far),\n KX_PYATTRIBUTE_RW_FUNCTION(\"shift_x\", KX_Camera, pyattr_get_shift_x, pyattr_set_shift_x),\n KX_PYATTRIBUTE_RW_FUNCTION(\"shift_y\", KX_Camera, pyattr_get_shift_y, pyattr_set_shift_y),\n KX_PYATTRIBUTE_FLOAT_RW(\"lodDistanceFactor\", 0.0f, FLT_MAX, KX_Camera, m_lodDistanceFactor),\n\n KX_PYATTRIBUTE_RW_FUNCTION(\n \"useViewport\", KX_Camera, pyattr_get_use_viewport, pyattr_set_use_viewport),\n\n KX_PYATTRIBUTE_RW_FUNCTION(\"projection_matrix\",\n KX_Camera,\n pyattr_get_projection_matrix,\n pyattr_set_projection_matrix),\n KX_PYATTRIBUTE_RO_FUNCTION(\"modelview_matrix\", KX_Camera, pyattr_get_modelview_matrix),\n KX_PYATTRIBUTE_RO_FUNCTION(\"camera_to_world\", KX_Camera, pyattr_get_camera_to_world),\n KX_PYATTRIBUTE_RO_FUNCTION(\"world_to_camera\", KX_Camera, pyattr_get_world_to_camera),\n\n \/* Grrr, functions for constants? *\/\n KX_PYATTRIBUTE_RO_FUNCTION(\"INSIDE\", KX_Camera, pyattr_get_INSIDE),\n KX_PYATTRIBUTE_RO_FUNCTION(\"OUTSIDE\", KX_Camera, pyattr_get_OUTSIDE),\n KX_PYATTRIBUTE_RO_FUNCTION(\"INTERSECT\", KX_Camera, pyattr_get_INTERSECT),\n\n KX_PYATTRIBUTE_NULL \/\/ Sentinel\n};\n\nPyTypeObject KX_Camera::Type = {PyVarObject_HEAD_INIT(nullptr, 0) \"KX_Camera\",\n sizeof(PyObjectPlus_Proxy),\n 0,\n py_base_dealloc,\n 0,\n 0,\n 0,\n 0,\n py_base_repr,\n 0,\n &KX_GameObject::Sequence,\n &KX_GameObject::Mapping,\n 0,\n 0,\n 0,\n nullptr,\n nullptr,\n 0,\n Py_TPFLAGS_DEFAULT | Py_TPFLAGS_BASETYPE,\n 0,\n 0,\n 0,\n 0,\n 0,\n 0,\n 0,\n Methods,\n 0,\n 0,\n &KX_GameObject::Type,\n 0,\n 0,\n 0,\n 0,\n 0,\n 0,\n py_base_new};\n\nKX_PYMETHODDEF_DOC_VARARGS(KX_Camera,\n sphereInsideFrustum,\n \"sphereInsideFrustum(center, radius) -> Integer\\n\"\n \"\\treturns INSIDE, OUTSIDE or INTERSECT if the given sphere is\\n\"\n \"\\tinside\/outside\/intersects this camera's viewing frustum.\\n\\n\"\n \"\\tcenter = the center of the sphere (in world coordinates.)\\n\"\n \"\\tradius = the radius of the sphere\\n\\n\"\n \"\\tExample:\\n\"\n \"\\timport bge.logic\\n\\n\"\n \"\\tco = bge.logic.getCurrentController()\\n\"\n \"\\tcam = co.GetOwner()\\n\\n\"\n \"\\t# A sphere of radius 4.0 located at [x, y, z] = [1.0, 1.0, 1.0]\\n\"\n \"\\tif (cam.sphereInsideFrustum([1.0, 1.0, 1.0], 4) != cam.OUTSIDE):\\n\"\n \"\\t\\t# Sphere is inside frustum !\\n\"\n \"\\t\\t# Do something useful !\\n\"\n \"\\telse:\\n\"\n \"\\t\\t# Sphere is outside frustum\\n\")\n{\n PyObject *pycenter;\n float radius;\n if (PyArg_ParseTuple(args, \"Of:sphereInsideFrustum\", &pycenter, &radius)) {\n MT_Vector3 center;\n if (PyVecTo(pycenter, center)) {\n return PyLong_FromLong(GetFrustum().SphereInsideFrustum(center, radius)); \/* new ref *\/\n }\n }\n\n PyErr_SetString(PyExc_TypeError,\n \"camera.sphereInsideFrustum(center, radius): KX_Camera, expected arguments: \"\n \"(center, radius)\");\n\n return nullptr;\n}\n\nKX_PYMETHODDEF_DOC_O(\n KX_Camera,\n boxInsideFrustum,\n \"boxInsideFrustum(box) -> Integer\\n\"\n \"\\treturns INSIDE, OUTSIDE or INTERSECT if the given box is\\n\"\n \"\\tinside\/outside\/intersects this camera's viewing frustum.\\n\\n\"\n \"\\tbox = a list of the eight (8) corners of the box (in world coordinates.)\\n\\n\"\n \"\\tExample:\\n\"\n \"\\timport bge.logic\\n\\n\"\n \"\\tco = bge.logic.getCurrentController()\\n\"\n \"\\tcam = co.GetOwner()\\n\\n\"\n \"\\tbox = []\\n\"\n \"\\tbox.append([-1.0, -1.0, -1.0])\\n\"\n \"\\tbox.append([-1.0, -1.0, 1.0])\\n\"\n \"\\tbox.append([-1.0, 1.0, -1.0])\\n\"\n \"\\tbox.append([-1.0, 1.0, 1.0])\\n\"\n \"\\tbox.append([ 1.0, -1.0, -1.0])\\n\"\n \"\\tbox.append([ 1.0, -1.0, 1.0])\\n\"\n \"\\tbox.append([ 1.0, 1.0, -1.0])\\n\"\n \"\\tbox.append([ 1.0, 1.0, 1.0])\\n\\n\"\n \"\\tif (cam.boxInsideFrustum(box) != cam.OUTSIDE):\\n\"\n \"\\t\\t# Box is inside\/intersects frustum !\\n\"\n \"\\t\\t# Do something useful !\\n\"\n \"\\telse:\\n\"\n \"\\t\\t# Box is outside the frustum !\\n\")\n{\n unsigned int num_points = PySequence_Size(value);\n if (num_points != 8) {\n PyErr_Format(PyExc_TypeError,\n \"camera.boxInsideFrustum(box): KX_Camera, expected eight (8) points, got %d\",\n num_points);\n return nullptr;\n }\n\n std::array box;\n for (unsigned int p = 0; p < 8; p++) {\n PyObject *item = PySequence_GetItem(value, p); \/* new ref *\/\n bool error = !PyVecTo(item, box[p]);\n Py_DECREF(item);\n if (error)\n return nullptr;\n }\n\n return PyLong_FromLong(GetFrustum().BoxInsideFrustum(box)); \/* new ref *\/\n}\n\nKX_PYMETHODDEF_DOC_O(KX_Camera,\n pointInsideFrustum,\n \"pointInsideFrustum(point) -> Bool\\n\"\n \"\\treturns 1 if the given point is inside this camera's viewing frustum.\\n\\n\"\n \"\\tpoint = The point to test (in world coordinates.)\\n\\n\"\n \"\\tExample:\\n\"\n \"\\timport bge.logic\\n\\n\"\n \"\\tco = bge.logic.getCurrentController()\\n\"\n \"\\tcam = co.GetOwner()\\n\\n\"\n \"\\t# Test point [0.0, 0.0, 0.0]\"\n \"\\tif (cam.pointInsideFrustum([0.0, 0.0, 0.0])):\\n\"\n \"\\t\\t# Point is inside frustum !\\n\"\n \"\\t\\t# Do something useful !\\n\"\n \"\\telse:\\n\"\n \"\\t\\t# Box is outside the frustum !\\n\")\n{\n MT_Vector3 point;\n if (PyVecTo(value, point)) {\n return PyLong_FromLong(GetFrustum().PointInsideFrustum(point)); \/* new ref *\/\n }\n\n PyErr_SetString(PyExc_TypeError,\n \"camera.pointInsideFrustum(point): KX_Camera, expected point argument.\");\n return nullptr;\n}\n\nKX_PYMETHODDEF_DOC_NOARGS(KX_Camera,\n getCameraToWorld,\n \"getCameraToWorld() -> Matrix4x4\\n\"\n \"\\treturns the camera to world transformation matrix, as a list of four \"\n \"lists of four values.\\n\\n\"\n \"\\tie: [[1.0, 0.0, 0.0, 0.0], [0.0, 1.0, 0.0, 0.0], [0.0, 0.0, 1.0, \"\n \"0.0], [0.0, 0.0, 0.0, 1.0]])\\n\")\n{\n return PyObjectFrom(MT_Matrix4x4(GetCameraToWorld())); \/* new ref *\/\n}\n\nKX_PYMETHODDEF_DOC_NOARGS(KX_Camera,\n getWorldToCamera,\n \"getWorldToCamera() -> Matrix4x4\\n\"\n \"\\treturns the world to camera transformation matrix, as a list of four \"\n \"lists of four values.\\n\\n\"\n \"\\tie: [[1.0, 0.0, 0.0, 0.0], [0.0, 1.0, 0.0, 0.0], [0.0, 0.0, 1.0, \"\n \"0.0], [0.0, 0.0, 0.0, 1.0]])\\n\")\n{\n return PyObjectFrom(MT_Matrix4x4(GetWorldToCamera())); \/* new ref *\/\n}\n\nKX_PYMETHODDEF_DOC_VARARGS(KX_Camera,\n setViewport,\n \"setViewport(left, bottom, right, top)\\n\"\n \"Sets this camera's viewport\\n\")\n{\n int left, bottom, right, top;\n if (!PyArg_ParseTuple(args, \"iiii:setViewport\", &left, &bottom, &right, &top))\n return nullptr;\n\n SetViewport(left, bottom, right, top);\n Py_RETURN_NONE;\n}\n\nKX_PYMETHODDEF_DOC_NOARGS(KX_Camera,\n setOnTop,\n \"setOnTop()\\n\"\n \"Sets this camera's viewport on top\\n\")\n{\n GetScene()->SetCameraOnTop(this);\n Py_RETURN_NONE;\n}\n\nPyObject *KX_Camera::pyattr_get_perspective(PyObjectPlus *self_v,\n const KX_PYATTRIBUTE_DEF *attrdef)\n{\n KX_Camera *self = static_cast(self_v);\n return PyBool_FromLong(self->m_camdata.m_perspective);\n}\n\nint KX_Camera::pyattr_set_perspective(PyObjectPlus *self_v,\n const KX_PYATTRIBUTE_DEF *attrdef,\n PyObject *value)\n{\n KX_Camera *self = static_cast(self_v);\n int param = PyObject_IsTrue(value);\n if (param == -1) {\n PyErr_SetString(PyExc_AttributeError,\n \"camera.perspective = bool: KX_Camera, expected True\/False or 0\/1\");\n return PY_SET_ATTR_FAIL;\n }\n\n self->m_camdata.m_perspective = param;\n self->InvalidateProjectionMatrix();\n return PY_SET_ATTR_SUCCESS;\n}\n\nPyObject *KX_Camera::pyattr_get_lens(PyObjectPlus *self_v, const KX_PYATTRIBUTE_DEF *attrdef)\n{\n KX_Camera *self = static_cast(self_v);\n return PyFloat_FromDouble(self->m_camdata.m_lens);\n}\n\nint KX_Camera::pyattr_set_lens(PyObjectPlus *self_v,\n const KX_PYATTRIBUTE_DEF *attrdef,\n PyObject *value)\n{\n KX_Camera *self = static_cast(self_v);\n float param = PyFloat_AsDouble(value);\n if (param == -1) {\n PyErr_SetString(PyExc_AttributeError,\n \"camera.lens = float: KX_Camera, expected a float greater than zero\");\n return PY_SET_ATTR_FAIL;\n }\n\n self->m_camdata.m_lens = param;\n self->m_set_projection_matrix = false;\n return PY_SET_ATTR_SUCCESS;\n}\n\nPyObject *KX_Camera::pyattr_get_fov(PyObjectPlus *self_v, const KX_PYATTRIBUTE_DEF *attrdef)\n{\n KX_Camera *self = static_cast(self_v);\n\n float lens = self->m_camdata.m_lens;\n float width = self->m_camdata.m_sensor_x;\n float fov = 2.0f * atanf(0.5f * width \/ lens);\n\n return PyFloat_FromDouble(fov * MT_DEGS_PER_RAD);\n}\n\nint KX_Camera::pyattr_set_fov(PyObjectPlus *self_v,\n const KX_PYATTRIBUTE_DEF *attrdef,\n PyObject *value)\n{\n KX_Camera *self = static_cast(self_v);\n float fov = PyFloat_AsDouble(value);\n if (fov <= 0.0f) {\n PyErr_SetString(PyExc_AttributeError,\n \"camera.fov = float: KX_Camera, expected a float greater than zero\");\n return PY_SET_ATTR_FAIL;\n }\n\n fov *= MT_RADS_PER_DEG;\n float width = self->m_camdata.m_sensor_x;\n float lens = width \/ (2.0f * tanf(0.5f * fov));\n\n self->m_camdata.m_lens = lens;\n self->m_set_projection_matrix = false;\n return PY_SET_ATTR_SUCCESS;\n}\n\nPyObject *KX_Camera::pyattr_get_ortho_scale(PyObjectPlus *self_v,\n const KX_PYATTRIBUTE_DEF *attrdef)\n{\n KX_Camera *self = static_cast(self_v);\n return PyFloat_FromDouble(self->m_camdata.m_scale);\n}\n\nint KX_Camera::pyattr_set_ortho_scale(PyObjectPlus *self_v,\n const KX_PYATTRIBUTE_DEF *attrdef,\n PyObject *value)\n{\n KX_Camera *self = static_cast(self_v);\n float param = PyFloat_AsDouble(value);\n if (param == -1) {\n PyErr_SetString(PyExc_AttributeError,\n \"camera.ortho_scale = float: KX_Camera, expected a float greater than zero\");\n return PY_SET_ATTR_FAIL;\n }\n\n self->m_camdata.m_scale = param;\n self->m_set_projection_matrix = false;\n return PY_SET_ATTR_SUCCESS;\n}\n\nPyObject *KX_Camera::pyattr_get_near(PyObjectPlus *self_v, const KX_PYATTRIBUTE_DEF *attrdef)\n{\n KX_Camera *self = static_cast(self_v);\n return PyFloat_FromDouble(self->m_camdata.m_clipstart);\n}\n\nint KX_Camera::pyattr_set_near(PyObjectPlus *self_v,\n const KX_PYATTRIBUTE_DEF *attrdef,\n PyObject *value)\n{\n KX_Camera *self = static_cast(self_v);\n float param = PyFloat_AsDouble(value);\n if (param == -1) {\n PyErr_SetString(PyExc_AttributeError,\n \"camera.near = float: KX_Camera, expected a float greater than zero\");\n return PY_SET_ATTR_FAIL;\n }\n\n self->m_camdata.m_clipstart = param;\n self->m_set_projection_matrix = false;\n return PY_SET_ATTR_SUCCESS;\n}\n\nPyObject *KX_Camera::pyattr_get_far(PyObjectPlus *self_v, const KX_PYATTRIBUTE_DEF *attrdef)\n{\n KX_Camera *self = static_cast(self_v);\n return PyFloat_FromDouble(self->m_camdata.m_clipend);\n}\n\nint KX_Camera::pyattr_set_far(PyObjectPlus *self_v,\n const KX_PYATTRIBUTE_DEF *attrdef,\n PyObject *value)\n{\n KX_Camera *self = static_cast(self_v);\n float param = PyFloat_AsDouble(value);\n if (param == -1) {\n PyErr_SetString(PyExc_AttributeError,\n \"camera.far = float: KX_Camera, expected a float greater than zero\");\n return PY_SET_ATTR_FAIL;\n }\n\n self->m_camdata.m_clipend = param;\n self->m_set_projection_matrix = false;\n return PY_SET_ATTR_SUCCESS;\n}\n\nPyObject *KX_Camera::pyattr_get_shift_x(PyObjectPlus *self_v, const KX_PYATTRIBUTE_DEF *attrdef)\n{\n KX_Camera *self = static_cast(self_v);\n return PyFloat_FromDouble(self->m_camdata.m_shift_x);\n}\n\nint KX_Camera::pyattr_set_shift_x(PyObjectPlus *self_v,\n const KX_PYATTRIBUTE_DEF *attrdef,\n PyObject *value)\n{\n KX_Camera *self = static_cast(self_v);\n float param = PyFloat_AsDouble(value);\n if (param == -1) {\n PyErr_SetString(PyExc_AttributeError,\n \"camera.shift_x = float: KX_Camera, expected a float greater than zero\");\n return PY_SET_ATTR_FAIL;\n }\n\n self->m_camdata.m_shift_x = param;\n self->m_set_projection_matrix = false;\n return PY_SET_ATTR_SUCCESS;\n}\n\nPyObject *KX_Camera::pyattr_get_shift_y(PyObjectPlus *self_v, const KX_PYATTRIBUTE_DEF *attrdef)\n{\n KX_Camera *self = static_cast(self_v);\n return PyFloat_FromDouble(self->m_camdata.m_shift_y);\n}\n\nint KX_Camera::pyattr_set_shift_y(PyObjectPlus *self_v,\n const KX_PYATTRIBUTE_DEF *attrdef,\n PyObject *value)\n{\n KX_Camera *self = static_cast(self_v);\n float param = PyFloat_AsDouble(value);\n if (param == -1) {\n PyErr_SetString(PyExc_AttributeError,\n \"camera.shift_y = float: KX_Camera, expected a float greater than zero\");\n return PY_SET_ATTR_FAIL;\n }\n\n self->m_camdata.m_shift_y = param;\n self->m_set_projection_matrix = false;\n return PY_SET_ATTR_SUCCESS;\n}\n\nPyObject *KX_Camera::pyattr_get_use_viewport(PyObjectPlus *self_v,\n const KX_PYATTRIBUTE_DEF *attrdef)\n{\n KX_Camera *self = static_cast(self_v);\n return PyBool_FromLong(self->GetViewport());\n}\n\nint KX_Camera::pyattr_set_use_viewport(PyObjectPlus *self_v,\n const KX_PYATTRIBUTE_DEF *attrdef,\n PyObject *value)\n{\n KX_Camera *self = static_cast(self_v);\n int param = PyObject_IsTrue(value);\n if (param == -1) {\n PyErr_SetString(PyExc_AttributeError,\n \"camera.useViewport = bool: KX_Camera, expected True or False\");\n return PY_SET_ATTR_FAIL;\n }\n self->EnableViewport((bool)param);\n return PY_SET_ATTR_SUCCESS;\n}\n\nPyObject *KX_Camera::pyattr_get_projection_matrix(PyObjectPlus *self_v,\n const KX_PYATTRIBUTE_DEF *attrdef)\n{\n KX_Camera *self = static_cast(self_v);\n return PyObjectFrom(self->GetProjectionMatrix());\n}\n\nint KX_Camera::pyattr_set_projection_matrix(PyObjectPlus *self_v,\n const KX_PYATTRIBUTE_DEF *attrdef,\n PyObject *value)\n{\n KX_Camera *self = static_cast(self_v);\n MT_Matrix4x4 mat;\n if (!PyMatTo(value, mat))\n return PY_SET_ATTR_FAIL;\n\n self->SetProjectionMatrix(mat);\n return PY_SET_ATTR_SUCCESS;\n}\n\nPyObject *KX_Camera::pyattr_get_modelview_matrix(PyObjectPlus *self_v,\n const KX_PYATTRIBUTE_DEF *attrdef)\n{\n KX_Camera *self = static_cast(self_v);\n return PyObjectFrom(MT_Matrix4x4(self->GetWorldToCamera()));\n}\n\nPyObject *KX_Camera::pyattr_get_camera_to_world(PyObjectPlus *self_v,\n const KX_PYATTRIBUTE_DEF *attrdef)\n{\n KX_Camera *self = static_cast(self_v);\n return PyObjectFrom(MT_Matrix4x4(self->GetCameraToWorld()));\n}\n\nPyObject *KX_Camera::pyattr_get_world_to_camera(PyObjectPlus *self_v,\n const KX_PYATTRIBUTE_DEF *attrdef)\n{\n KX_Camera *self = static_cast(self_v);\n return PyObjectFrom(MT_Matrix4x4(self->GetWorldToCamera()));\n}\n\nPyObject *KX_Camera::pyattr_get_INSIDE(PyObjectPlus *self_v, const KX_PYATTRIBUTE_DEF *attrdef)\n{\n return PyLong_FromLong(INSIDE);\n}\nPyObject *KX_Camera::pyattr_get_OUTSIDE(PyObjectPlus *self_v, const KX_PYATTRIBUTE_DEF *attrdef)\n{\n return PyLong_FromLong(OUTSIDE);\n}\nPyObject *KX_Camera::pyattr_get_INTERSECT(PyObjectPlus *self_v, const KX_PYATTRIBUTE_DEF *attrdef)\n{\n return PyLong_FromLong(INTERSECT);\n}\n\nbool ConvertPythonToCamera(KX_Scene *scene,\n PyObject *value,\n KX_Camera **object,\n bool py_none_ok,\n const char *error_prefix)\n{\n if (value == nullptr) {\n PyErr_Format(PyExc_TypeError, \"%s, python pointer nullptr, should never happen\", error_prefix);\n *object = nullptr;\n return false;\n }\n\n if (value == Py_None) {\n *object = nullptr;\n\n if (py_none_ok) {\n return true;\n }\n else {\n PyErr_Format(PyExc_TypeError,\n \"%s, expected KX_Camera or a KX_Camera name, None is invalid\",\n error_prefix);\n return false;\n }\n }\n\n if (PyUnicode_Check(value)) {\n std::string value_str = _PyUnicode_AsString(value);\n *object = scene->GetCameraList()->FindValue(value_str);\n\n if (*object) {\n return true;\n }\n else {\n PyErr_Format(PyExc_ValueError,\n \"%s, requested name \\\"%s\\\" did not match any KX_Camera in this scene\",\n error_prefix,\n _PyUnicode_AsString(value));\n return false;\n }\n }\n\n if (PyObject_TypeCheck(value, &KX_Camera::Type)) {\n *object = static_cast BGE_PROXY_REF(value);\n\n \/* sets the error *\/\n if (*object == nullptr) {\n PyErr_Format(PyExc_SystemError, \"%s, \" BGE_PROXY_ERROR_MSG, error_prefix);\n return false;\n }\n\n return true;\n }\n\n *object = nullptr;\n\n if (py_none_ok) {\n PyErr_Format(PyExc_TypeError, \"%s, expect a KX_Camera, a string or None\", error_prefix);\n }\n else {\n PyErr_Format(PyExc_TypeError, \"%s, expect a KX_Camera or a string\", error_prefix);\n }\n\n return false;\n}\n\nKX_PYMETHODDEF_DOC_O(KX_Camera, getScreenPosition, \"getScreenPosition()\\n\")\n\n{\n MT_Vector3 vect;\n KX_GameObject *obj = nullptr;\n\n if (!PyVecTo(value, vect)) {\n PyErr_Clear();\n\n if (ConvertPythonToGameObject(GetScene()->GetLogicManager(), value, &obj, false, \"\")) {\n PyErr_Clear();\n vect = MT_Vector3(obj->NodeGetWorldPosition());\n }\n else {\n PyErr_SetString(PyExc_TypeError,\n \"Error in getScreenPosition. Expected a Vector3 or a KX_GameObject or a \"\n \"string for a name of a KX_GameObject\");\n return nullptr;\n }\n }\n\n GLint viewport[4];\n GLfloat vec[3];\n GLfloat win[3];\n GLfloat modelmatrix[4][4];\n GLfloat projmatrix[4][4];\n\n MT_Matrix4x4 m_modelmatrix = MT_Matrix4x4(GetWorldToCamera());\n MT_Matrix4x4 m_projmatrix = this->GetProjectionMatrix();\n\n vect.getValue(vec);\n m_modelmatrix.getValue((float *)modelmatrix);\n m_projmatrix.getValue((float *)projmatrix);\n\n KX_GetActiveEngine()->GetCanvas()->GetViewportArea().Pack(viewport);\n\n GPU_matrix_project(vec, modelmatrix, projmatrix, viewport, win);\n\n vect[0] = (win[0] - viewport[0]) \/ viewport[2];\n vect[1] = (win[1] - viewport[1]) \/ viewport[3];\n\n vect[1] = 1.0f - vect[1]; \/\/ to follow Blender window coordinate system (Top-Down)\n\n PyObject *ret = PyTuple_New(2);\n if (ret) {\n PyTuple_SET_ITEM(ret, 0, PyFloat_FromDouble(vect[0]));\n PyTuple_SET_ITEM(ret, 1, PyFloat_FromDouble(vect[1]));\n return ret;\n }\n\n return nullptr;\n}\n\nKX_PYMETHODDEF_DOC_VARARGS(KX_Camera, getScreenVect, \"getScreenVect()\\n\")\n{\n double x, y;\n if (!PyArg_ParseTuple(args, \"dd:getScreenVect\", &x, &y))\n return nullptr;\n\n y = 1.0 - y; \/\/ to follow Blender window coordinate system (Top-Down)\n\n GLint viewport[4];\n GLfloat vec[3];\n GLfloat win[3];\n GLfloat modelmatrix[4][4];\n GLfloat projmatrix[4][4];\n\n MT_Matrix4x4 m_modelmatrix = MT_Matrix4x4(GetWorldToCamera());\n MT_Matrix4x4 m_projmatrix = this->GetProjectionMatrix();\n\n m_modelmatrix.getValue((float *)modelmatrix);\n m_projmatrix.getValue((float *)projmatrix);\n\n KX_GetActiveEngine()->GetCanvas()->GetViewportArea().Pack(viewport);\n\n vec[0] = x * viewport[2];\n vec[1] = y * viewport[3];\n\n vec[0] += viewport[0];\n vec[1] += viewport[1];\n\n vec[2] = 0.f;\n\n GPU_matrix_unproject(vec, modelmatrix, projmatrix, viewport, win);\n\n MT_Vector3 campos = NodeGetWorldPosition();\n MT_Vector3 screenpos(win[0], win[1], win[2]);\n MT_Vector3 vect = campos - screenpos;\n vect.normalize();\n return PyObjectFrom(vect);\n}\n\nKX_PYMETHODDEF_DOC_VARARGS(KX_Camera, getScreenRay, \"getScreenRay()\\n\")\n{\n MT_Vector3 vect;\n double x, y, dist;\n char *propName = nullptr;\n\n if (!PyArg_ParseTuple(args, \"ddd|s:getScreenRay\", &x, &y, &dist, &propName))\n return nullptr;\n\n PyObject *argValue = PyTuple_New(2);\n PyTuple_SET_ITEM(argValue, 0, PyFloat_FromDouble(x));\n PyTuple_SET_ITEM(argValue, 1, PyFloat_FromDouble(y));\n\n if (!PyVecTo(PygetScreenVect(argValue), vect)) {\n Py_DECREF(argValue);\n PyErr_SetString(PyExc_TypeError,\n \"Error in getScreenRay. Invalid 2D coordinate. \"\n \"Expected a normalized 2D screen coordinate, \"\n \"a distance and an optional property argument\");\n return nullptr;\n }\n Py_DECREF(argValue);\n\n dist = -dist;\n vect += NodeGetWorldPosition();\n\n argValue = (propName ? PyTuple_New(3) : PyTuple_New(2));\n if (argValue) {\n PyTuple_SET_ITEM(argValue, 0, PyObjectFrom(vect));\n PyTuple_SET_ITEM(argValue, 1, PyFloat_FromDouble(dist));\n if (propName)\n PyTuple_SET_ITEM(argValue, 2, PyUnicode_FromString(propName));\n\n PyObject *ret = this->PyrayCastTo(argValue, nullptr);\n Py_DECREF(argValue);\n return ret;\n }\n\n return nullptr;\n}\n#endif\n","avg_line_length":30.8282926829,"max_line_length":99,"alphanum_fraction":0.6303680496,"low_alphanum":false,"long_lines":false,"lexable":true} {"size":10784,"ext":"cpp","lang":"C++","max_stars_repo_licenses":["MIT-0","Apache-2.0","CC-BY-4.0","MIT"],"max_stars_count":3.0,"content":"\/\/ STL includes\n#include \n#include \n#include \n\n\/\/ QT includes\n#include \n\n\/\/ blackborder includes\n#include \n\n\/\/ grabber includes\n#include \"grabber\/V4L2Grabber.h\"\n\n\/\/ flatbuf includes\n#include \n\n\/\/ hyperion-v4l2 includes\n#include \"ScreenshotHandler.h\"\n\n#include \"HyperionConfig.h\"\n#include \n\n\/\/ ssdp discover\n#include \n\nusing namespace commandline;\n\nint main(int argc, char** argv)\n{\n\tLogger *log = Logger::getInstance(\"V4L2GRABBER\");\n\tLogger::setLogLevel(Logger::WARNING);\n\n\tstd::cout\n\t\t<< \"hyperion-v4l2:\" << std::endl\n\t\t<< \"\\tVersion : \" << HYPERION_VERSION << \" (\" << HYPERION_BUILD_ID << \")\" << std::endl\n\t\t<< \"\\tbuild time: \" << __DATE__ << \" \" << __TIME__ << std::endl;\n\n\tQCoreApplication app(argc, argv);\n\n\t\/\/ force the locale\n\tsetlocale(LC_ALL, \"C\");\n\tQLocale::setDefault(QLocale::c());\n\n\t\/\/ register the image type to use in signals\n\tqRegisterMetaType>(\"Image\");\n\n\ttry\n\t{\n\t\t\/\/ create the option parser and initialize all parameters\n\t\tParser parser(\"V4L capture application for Hyperion. Will automatically search a Hyperion server if -a option isn't used. Please note that if you have more than one server running it's more or less random which one will be used.\");\n\n\t\tOption & argDevice = parser.add