Datasets:

Reset23

/

the-stack-v2-blamed-sample

like 0

b281897270808d154a40740de3f208a689201616

cc1701cadaa3b0e138e30740f98d48264e2010bd

/ui/base/clipboard/test/test_clipboard.h

a70a0f755f38e58c6a61a3ccfc95bd1a78f2840f

permissive

dbuskariol-org/chromium

35d3d7a441009c6f8961227f1f7f7d4823a4207e

e91a999f13a0bda0aff594961762668196c4d22a

refs/heads/master

BSD-3-Clause

UTF-8

C++

h

// Copyright 2014 The Chromium Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. #ifndef UI_BASE_CLIPBOARD_TEST_TEST_CLIPBOARD_H_ #define UI_BASE_CLIPBOARD_TEST_TEST_CLIPBOARD_H_ #include <stddef.h> #include <stdint.h> #include <string> #include <vector> #include "base/containers/flat_map.h" #include "base/macros.h" #include "third_party/skia/include/core/SkBitmap.h" #include "ui/base/clipboard/clipboard.h" namespace ui { // Platform-neutral ui::Clipboard mock used for tests. class TestClipboard : public Clipboard { public: TestClipboard(); ~TestClipboard() override; // Creates and associates a TestClipboard with the current thread. When no // longer needed, the returned clipboard must be freed by calling // Clipboard::DestroyClipboardForCurrentThread() on the same thread. static TestClipboard* CreateForCurrentThread(); // Sets the time to be returned by GetLastModifiedTime(); void SetLastModifiedTime(const base::Time& time); // Clipboard overrides. void OnPreShutdown() override; uint64_t GetSequenceNumber(ClipboardBuffer buffer) const override; bool IsFormatAvailable(const ClipboardFormatType& format, ClipboardBuffer buffer) const override; void Clear(ClipboardBuffer buffer) override; void ReadAvailableTypes(ClipboardBuffer buffer, std::vector<base::string16>* types) const override; std::vector<base::string16> ReadAvailablePlatformSpecificFormatNames( ClipboardBuffer buffer) const override; void ReadText(ClipboardBuffer buffer, base::string16* result) const override; void ReadAsciiText(ClipboardBuffer buffer, std::string* result) const override; void ReadHTML(ClipboardBuffer buffer, base::string16* markup, std::string* src_url, uint32_t* fragment_start, uint32_t* fragment_end) const override; void ReadRTF(ClipboardBuffer buffer, std::string* result) const override; void ReadImage(ClipboardBuffer buffer, ReadImageCallback callback) const override; void ReadCustomData(ClipboardBuffer buffer, const base::string16& type, base::string16* result) const override; void ReadBookmark(base::string16* title, std::string* url) const override; void ReadData(const ClipboardFormatType& format, std::string* result) const override; base::Time GetLastModifiedTime() const override; void ClearLastModifiedTime() override; void WritePortableRepresentations(ClipboardBuffer buffer, const ObjectMap& objects) override; void WritePlatformRepresentations( ClipboardBuffer buffer, std::vector<Clipboard::PlatformRepresentation> platform_representations) override; void WriteText(const char* text_data, size_t text_len) override; void WriteHTML(const char* markup_data, size_t markup_len, const char* url_data, size_t url_len) override; void WriteRTF(const char* rtf_data, size_t data_len) override; void WriteBookmark(const char* title_data, size_t title_len, const char* url_data, size_t url_len) override; void WriteWebSmartPaste() override; void WriteBitmap(const SkBitmap& bitmap) override; void WriteData(const ClipboardFormatType& format, const char* data_data, size_t data_len) override; private: struct DataStore { DataStore(); DataStore(const DataStore& other); ~DataStore(); void Clear(); uint64_t sequence_number; base::flat_map<ClipboardFormatType, std::string> data; std::string url_title; std::string html_src_url; SkBitmap image; }; // The non-const versions increment the sequence number as a side effect. const DataStore& GetStore(ClipboardBuffer buffer) const; const DataStore& GetDefaultStore() const; DataStore& GetStore(ClipboardBuffer buffer); DataStore& GetDefaultStore(); ClipboardBuffer default_store_buffer_; mutable base::flat_map<ClipboardBuffer, DataStore> stores_; base::Time last_modified_time_; DISALLOW_COPY_AND_ASSIGN(TestClipboard); }; } // namespace ui #endif // UI_BASE_CLIPBOARD_TEST_TEST_CLIPBOARD_H_

commit-bot@chromium.org

9384681a8ebcae72126edc49a2f1a1bd6af8758e

e132d5b086464fe0651223df74f06ff16dfbdcff

/example/doc/http_examples.hpp

4cd879ae33d50860d75cdddada4cbb427748f006

permissive

shibing/beast

fa1de3a19ecd1bf55120b92e4ebdf9cf99894f24

c495f946c92c1175d30e1e8e60d412c3a30025b4

refs/heads/develop

UTF-8

C++

hpp

// // Copyright (c) 2016-2017 Vinnie Falco (vinnie dot falco at gmail dot com) // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // // Official repository: https://github.com/boostorg/beast // #include <boost/beast.hpp> #include <iostream> /* This file contains the functions and classes found in the documentation They are compiled and run as part of the unit tests, so you can copy the code and use it in your own projects as a starting point for building a network application. */ // The documentation assumes the boost::beast::http namespace namespace boost { namespace beast { namespace http { //------------------------------------------------------------------------------ // // Example: Expect 100-continue // //------------------------------------------------------------------------------ //[example_http_send_expect_100_continue /** Send a request with Expect: 100-continue This function will send a request with the Expect: 100-continue field by first sending the header, then waiting for a successful response from the server before continuing to send the body. If a non-successful server response is received, the function returns immediately. @param stream The remote HTTP server stream. @param buffer The buffer used for reading. @param req The request to send. This function modifies the object: the Expect header field is inserted into the message if it does not already exist, and set to "100-continue". @param ec Set to the error, if any occurred. */ template< class SyncStream, class DynamicBuffer, class Body, class Allocator> void send_expect_100_continue( SyncStream& stream, DynamicBuffer& buffer, request<Body, basic_fields<Allocator>>& req, error_code& ec) { static_assert(is_sync_stream<SyncStream>::value, "SyncStream requirements not met"); static_assert(is_dynamic_buffer<DynamicBuffer>::value, "DynamicBuffer requirements not met"); // Insert or replace the Expect field req.set(field::expect, "100-continue"); // Create the serializer request_serializer<Body, basic_fields<Allocator>> sr{req}; // Send just the header write_header(stream, sr, ec); if(ec) return; // Read the response from the server. // A robust client could set a timeout here. { response<string_body> res; read(stream, buffer, res, ec); if(ec) return; if(res.result() != status::continue_) { // The server indicated that it will not // accept the request, so skip sending the body. return; } } // Server is OK with the request, send the body write(stream, sr, ec); } //] //[example_http_receive_expect_100_continue /** Receive a request, handling Expect: 100-continue if present. This function will read a request from the specified stream. If the request contains the Expect: 100-continue field, a status response will be delivered. @param stream The remote HTTP client stream. @param buffer The buffer used for reading. @param ec Set to the error, if any occurred. */ template< class SyncStream, class DynamicBuffer> void receive_expect_100_continue( SyncStream& stream, DynamicBuffer& buffer, error_code& ec) { static_assert(is_sync_stream<SyncStream>::value, "SyncStream requirements not met"); static_assert(is_dynamic_buffer<DynamicBuffer>::value, "DynamicBuffer requirements not met"); // Declare a parser for a request with a string body request_parser<string_body> parser; // Read the header read_header(stream, buffer, parser, ec); if(ec) return; // Check for the Expect field value if(parser.get()[field::expect] == "100-continue") { // send 100 response response<empty_body> res; res.version = 11; res.result(status::continue_); res.set(field::server, "test"); write(stream, res, ec); if(ec) return; } // Read the rest of the message. // // We use parser.base() to return a basic_parser&, to avoid an // ambiguous function error (from boost::asio::read). Another // solution is to qualify the call, e.g. `beast::http::read` // read(stream, buffer, parser.base(), ec); } //] //------------------------------------------------------------------------------ // // Example: Send Child Process Output // //------------------------------------------------------------------------------ //[example_http_send_cgi_response /** Send the output of a child process as an HTTP response. The output of the child process comes from a @b SyncReadStream. Data will be sent continuously as it is produced, without the requirement that the entire process output is buffered before being sent. The response will use the chunked transfer encoding. @param input A stream to read the child process output from. @param output A stream to write the HTTP response to. @param ec Set to the error, if any occurred. */ template< class SyncReadStream, class SyncWriteStream> void send_cgi_response( SyncReadStream& input, SyncWriteStream& output, error_code& ec) { static_assert(is_sync_read_stream<SyncReadStream>::value, "SyncReadStream requirements not met"); static_assert(is_sync_write_stream<SyncWriteStream>::value, "SyncWriteStream requirements not met"); using boost::asio::buffer_cast; using boost::asio::buffer_size; // Set up the response. We use the buffer_body type, // allowing serialization to use manually provided buffers. response<buffer_body> res; res.result(status::ok); res.version = 11; res.set(field::server, "Beast"); res.set(field::transfer_encoding, "chunked"); // No data yet, but we set more = true to indicate // that it might be coming later. Otherwise the // serializer::is_done would return true right after // sending the header. res.body.data = nullptr; res.body.more = true; // Create the serializer. response_serializer<buffer_body, fields> sr{res}; // Send the header immediately. write_header(output, sr, ec); if(ec) return; // Alternate between reading from the child process // and sending all the process output until there // is no more output. do { // Read a buffer from the child process char buffer[2048]; auto bytes_transferred = input.read_some( boost::asio::buffer(buffer, sizeof(buffer)), ec); if(ec == boost::asio::error::eof) { ec = {}; // `nullptr` indicates there is no buffer res.body.data = nullptr; // `false` means no more data is coming res.body.more = false; } else { if(ec) return; // Point to our buffer with the bytes that // we received, and indicate that there may // be some more data coming res.body.data = buffer; res.body.size = bytes_transferred; res.body.more = true; } // Write everything in the body buffer write(output, sr, ec); // This error is returned by body_buffer during // serialization when it is done sending the data // provided and needs another buffer. if(ec == error::need_buffer) { ec = {}; continue; } if(ec) return; } while(! sr.is_done()); } //] //-------------------------------------------------------------------------- // // Example: HEAD Request // //-------------------------------------------------------------------------- //[example_http_do_head_response /** Handle a HEAD request for a resource. */ template< class SyncStream, class DynamicBuffer > void do_server_head( SyncStream& stream, DynamicBuffer& buffer, error_code& ec) { static_assert(is_sync_stream<SyncStream>::value, "SyncStream requirements not met"); static_assert(is_dynamic_buffer<DynamicBuffer>::value, "DynamicBuffer requirments not met"); // We deliver this payload for all GET requests static std::string const payload = "Hello, world!"; // Read the request request<string_body> req; read(stream, buffer, req, ec); if(ec) return; // Set up the response, starting with the common fields response<string_body> res; res.version = 11; res.set(field::server, "test"); // Now handle request-specific fields switch(req.method()) { case verb::head: case verb::get: { // A HEAD request is handled by delivering the same // set of headers that would be sent for a GET request, // including the Content-Length, except for the body. res.result(status::ok); res.set(field::content_length, payload.size()); // For GET requests, we include the body if(req.method() == verb::get) { // We deliver the same payload for GET requests // regardless of the target. A real server might // deliver a file based on the target. res.body = payload; } break; } default: { // We return responses indicating an error if // we do not recognize the request method. res.result(status::bad_request); res.set(field::content_type, "text/plain"); res.body = "Invalid request-method '" + req.method_string().to_string() + "'"; res.prepare_payload(); break; } } // Send the response write(stream, res, ec); if(ec) return; } //] //[example_http_do_head_request /** Send a HEAD request for a resource. This function submits a HEAD request for the specified resource and returns the response. @param res The response. This is an output parameter. @param stream The synchronous stream to use. @param buffer The buffer to use. @param target The request target. @param ec Set to the error, if any occurred. @throws std::invalid_argument if target is empty. */ template< class SyncStream, class DynamicBuffer > response<empty_body> do_head_request( SyncStream& stream, DynamicBuffer& buffer, string_view target, error_code& ec) { // Do some type checking to be a good citizen static_assert(is_sync_stream<SyncStream>::value, "SyncStream requirements not met"); static_assert(is_dynamic_buffer<DynamicBuffer>::value, "DynamicBuffer requirments not met"); // The interfaces we are using are low level and do not // perform any checking of arguments; so we do it here. if(target.empty()) throw std::invalid_argument("target may not be empty"); // Build the HEAD request for the target request<empty_body> req; req.version = 11; req.method(verb::head); req.target(target); req.set(field::user_agent, "test"); // A client MUST send a Host header field in all HTTP/1.1 request messages. // https://tools.ietf.org/html/rfc7230#section-5.4 req.set(field::host, "localhost"); // Now send it write(stream, req, ec); if(ec) return {}; // Create a parser to read the response. // Responses to HEAD requests MUST NOT include // a body, so we use the `empty_body` type and // only attempt to read the header. parser<false, empty_body> p; read_header(stream, buffer, p, ec); if(ec) return {}; // Transfer ownership of the response to the caller. return p.release(); } //] //------------------------------------------------------------------------------ // // Example: HTTP Relay // //------------------------------------------------------------------------------ //[example_http_relay /** Relay an HTTP message. This function efficiently relays an HTTP message from a downstream client to an upstream server, or from an upstream server to a downstream client. After the message header is read from the input, a user provided transformation function is invoked which may change the contents of the header before forwarding to the output. This may be used to adjust fields such as Server, or proxy fields. @param output The stream to write to. @param input The stream to read from. @param buffer The buffer to use for the input. @param transform The header transformation to apply. The function will be called with this signature: @code template<class Body> void transform(message< isRequest, Body, Fields>&, // The message to transform error_code&); // Set to the error, if any @endcode @param ec Set to the error if any occurred. @tparam isRequest `true` to relay a request. @tparam Fields The type of fields to use for the message. */ template< bool isRequest, class SyncWriteStream, class SyncReadStream, class DynamicBuffer, class Transform> void relay( SyncWriteStream& output, SyncReadStream& input, DynamicBuffer& buffer, error_code& ec, Transform&& transform) { static_assert(is_sync_write_stream<SyncWriteStream>::value, "SyncWriteStream requirements not met"); static_assert(is_sync_read_stream<SyncReadStream>::value, "SyncReadStream requirements not met"); // A small buffer for relaying the body piece by piece char buf[2048]; // Create a parser with a buffer body to read from the input. parser<isRequest, buffer_body> p; // Create a serializer from the message contained in the parser. serializer<isRequest, buffer_body, fields> sr{p.get()}; // Read just the header from the input read_header(input, buffer, p, ec); if(ec) return; // Apply the caller's header tranformation transform(p.get(), ec); if(ec) return; // Send the transformed message to the output write_header(output, sr, ec); if(ec) return; // Loop over the input and transfer it to the output do { if(! p.is_done()) { // Set up the body for writing into our small buffer p.get().body.data = buf; p.get().body.size = sizeof(buf); // Read as much as we can read(input, buffer, p, ec); // This error is returned when buffer_body uses up the buffer if(ec == error::need_buffer) ec = {}; if(ec) return; // Set up the body for reading. // This is how much was parsed: p.get().body.size = sizeof(buf) - p.get().body.size; p.get().body.data = buf; p.get().body.more = ! p.is_done(); } else { p.get().body.data = nullptr; p.get().body.size = 0; } // Write everything in the buffer (which might be empty) write(output, sr, ec); // This error is returned when buffer_body uses up the buffer if(ec == error::need_buffer) ec = {}; if(ec) return; } while(! p.is_done() && ! sr.is_done()); } //] //------------------------------------------------------------------------------ // // Example: Serialize to std::ostream // //------------------------------------------------------------------------------ //[example_http_write_ostream // The detail namespace means "not public" namespace detail { // This helper is needed for C++11. // When invoked with a buffer sequence, writes the buffers `to the std::ostream`. template<class Serializer> class write_ostream_helper { Serializer& sr_; std::ostream& os_; public: write_ostream_helper(Serializer& sr, std::ostream& os) : sr_(sr) , os_(os) { } // This function is called by the serializer template<class ConstBufferSequence> void operator()(error_code& ec, ConstBufferSequence const& buffers) const { // These asio functions are needed to access a buffer's contents using boost::asio::buffer_cast; using boost::asio::buffer_size; // Error codes must be cleared on success ec = {}; // Keep a running total of how much we wrote std::size_t bytes_transferred = 0; // Loop over the buffer sequence for(auto it = buffers.begin(); it != buffers.end(); ++ it) { // This is the next buffer in the sequence boost::asio::const_buffer const buffer = *it; // Write it to the std::ostream os_.write( buffer_cast<char const*>(buffer), buffer_size(buffer)); // If the std::ostream fails, convert it to an error code if(os_.fail()) { ec = make_error_code(errc::io_error); return; } // Adjust our running total bytes_transferred += buffer_size(buffer); } // Inform the serializer of the amount we consumed sr_.consume(bytes_transferred); } }; } // detail /** Write a message to a `std::ostream`. This function writes the serialized representation of the HTTP/1 message to the sream. @param os The `std::ostream` to write to. @param msg The message to serialize. @param ec Set to the error, if any occurred. */ template< bool isRequest, class Body, class Fields> void write_ostream( std::ostream& os, message<isRequest, Body, Fields>& msg, error_code& ec) { // Create the serializer instance serializer<isRequest, Body, Fields> sr{msg}; // This lambda is used as the "visit" function detail::write_ostream_helper<decltype(sr)> lambda{sr, os}; do { // In C++14 we could use a generic lambda but since we want // to require only C++11, the lambda is written out by hand. // This function call retrieves the next serialized buffers. sr.next(ec, lambda); if(ec) return; } while(! sr.is_done()); } //] //------------------------------------------------------------------------------ // // Example: Parse from std::istream // //------------------------------------------------------------------------------ //[example_http_read_istream /** Read a message from a `std::istream`. This function attempts to parse a complete HTTP/1 message from the stream. @param is The `std::istream` to read from. @param buffer The buffer to use. @param msg The message to store the result. @param ec Set to the error, if any occurred. */ template< class Allocator, bool isRequest, class Body> void read_istream( std::istream& is, basic_flat_buffer<Allocator>& buffer, message<isRequest, Body, fields>& msg, error_code& ec) { // Create the message parser // // Arguments passed to the parser's constructor are // forwarded to the message constructor. Here, we use // a move construction in case the caller has constructed // their message in a non-default way. // parser<isRequest, Body> p{std::move(msg)}; do { // Extract whatever characters are presently available in the istream if(is.rdbuf()->in_avail() > 0) { // Get a mutable buffer sequence for writing auto const mb = buffer.prepare( static_cast<std::size_t>(is.rdbuf()->in_avail())); // Now get everything we can from the istream buffer.commit(static_cast<std::size_t>(is.readsome( boost::asio::buffer_cast<char*>(mb), boost::asio::buffer_size(mb)))); } else if(buffer.size() == 0) { // Our buffer is empty and we need more characters, // see if we've reached the end of file on the istream if(! is.eof()) { // Get a mutable buffer sequence for writing auto const mb = buffer.prepare(1024); // Try to get more from the istream. This might block. is.read( boost::asio::buffer_cast<char*>(mb), boost::asio::buffer_size(mb)); // If an error occurs on the istream then return it to the caller. if(is.fail() && ! is.eof()) { // We'll just re-use io_error since std::istream has no error_code interface. ec = make_error_code(errc::io_error); return; } // Commit the characters we got to the buffer. buffer.commit(static_cast<std::size_t>(is.gcount())); } else { // Inform the parser that we've reached the end of the istream. p.put_eof(ec); if(ec) return; break; } } // Write the data to the parser auto const bytes_used = p.put(buffer.data(), ec); // This error means that the parser needs additional octets. if(ec == error::need_more) ec = {}; if(ec) return; // Consume the buffer octets that were actually parsed. buffer.consume(bytes_used); } while(! p.is_done()); // Transfer ownership of the message container in the parser to the caller. msg = p.release(); } //] //------------------------------------------------------------------------------ // // Example: Deferred Body Type // //------------------------------------------------------------------------------ //[example_http_defer_body /** Handle a form POST request, choosing a body type depending on the Content-Type. This reads a request from the input stream. If the method is POST, and the Content-Type is "application/x-www-form-urlencoded " or "multipart/form-data", a `string_body` is used to receive and store the message body. Otherwise, a `dynamic_body` is used to store the message body. After the request is received, the handler will be invoked with the request. @param stream The stream to read from. @param buffer The buffer to use for reading. @param handler The handler to invoke when the request is complete. The handler must be invokable with this signature: @code template<class Body> void handler(request<Body>&& req); @endcode @throws system_error Thrown on failure. */ template< class SyncReadStream, class DynamicBuffer, class Handler> void do_form_request( SyncReadStream& stream, DynamicBuffer& buffer, Handler&& handler) { // Start with an empty_body parser request_parser<empty_body> req0; // Read just the header. Otherwise, the empty_body // would generate an error if body octets were received. read_header(stream, buffer, req0); // Choose a body depending on the method verb switch(req0.get().method()) { case verb::post: { // If this is not a form upload then use a string_body if( req0.get()[field::content_type] != "application/x-www-form-urlencoded" && req0.get()[field::content_type] != "multipart/form-data") goto do_dynamic_body; // Commit to string_body as the body type. // As long as there are no body octets in the parser // we are constructing from, no exception is thrown. request_parser<string_body> req{std::move(req0)}; // Finish reading the message read(stream, buffer, req); // Call the handler. It can take ownership // if desired, since we are calling release() handler(req.release()); break; } do_dynamic_body: default: { // Commit to dynamic_body as the body type. // As long as there are no body octets in the parser // we are constructing from, no exception is thrown. request_parser<dynamic_body> req{std::move(req0)}; // Finish reading the message read(stream, buffer, req); // Call the handler. It can take ownership // if desired, since we are calling release() handler(req.release()); break; } } } //] //------------------------------------------------------------------------------ // // Example: Custom Parser // //------------------------------------------------------------------------------ //[example_http_custom_parser template<bool isRequest> class custom_parser : public basic_parser<isRequest, custom_parser<isRequest>> { private: // The friend declaration is needed, // otherwise the callbacks must be made public. friend class basic_parser<isRequest, custom_parser>; /// Called after receiving the request-line (isRequest == true). void on_request_impl( verb method, // The method verb, verb::unknown if no match string_view method_str, // The method as a string string_view target, // The request-target int version, // The HTTP-version error_code& ec); // The error returned to the caller, if any /// Called after receiving the start-line (isRequest == false). void on_response_impl( int code, // The status-code string_view reason, // The obsolete reason-phrase int version, // The HTTP-version error_code& ec); // The error returned to the caller, if any /// Called after receiving a header field. void on_field_impl( field f, // The known-field enumeration constant string_view name, // The field name string. string_view value, // The field value error_code& ec); // The error returned to the caller, if any /// Called after the complete header is received. void on_header_impl( error_code& ec); // The error returned to the caller, if any /// Called just before processing the body, if a body exists. void on_body_init_impl( boost::optional< std::uint64_t> const& content_length, // Content length if known, else `boost::none` error_code& ec); // The error returned to the caller, if any /// Called for each piece of the body, if a body exists. //! //! This is used when there is no chunked transfer coding. //! //! The function returns the number of bytes consumed from the //! input buffer. Any input octets not consumed will be will be //! presented on subsequent calls. //! std::size_t on_body_impl( string_view s, // A portion of the body error_code& ec); // The error returned to the caller, if any /// Called for each chunk header. void on_chunk_header_impl( std::uint64_t size, // The size of the upcoming chunk, // or zero for the last chunk string_view extension, // The chunk extensions (may be empty) error_code& ec); // The error returned to the caller, if any /// Called to deliver the chunk body. //! //! This is used when there is a chunked transfer coding. The //! implementation will automatically remove the encoding before //! calling this function. //! //! The function returns the number of bytes consumed from the //! input buffer. Any input octets not consumed will be will be //! presented on subsequent calls. //! std::size_t on_chunk_body_impl( std::uint64_t remain, // The number of bytes remaining in the chunk, // including what is being passed here. // or zero for the last chunk string_view body, // The next piece of the chunk body error_code& ec); // The error returned to the caller, if any /// Called when the complete message is parsed. void on_finish_impl(error_code& ec); public: custom_parser() = default; }; //] // Definitions are not part of the docs but necessary to link template<bool isRequest> void custom_parser<isRequest>:: on_request_impl(verb method, string_view method_str, string_view path, int version, error_code& ec) { boost::ignore_unused(method, method_str, path, version); ec = {}; } template<bool isRequest> void custom_parser<isRequest>:: on_response_impl( int status, string_view reason, int version, error_code& ec) { boost::ignore_unused(status, reason, version); ec = {}; } template<bool isRequest> void custom_parser<isRequest>:: on_field_impl( field f, string_view name, string_view value, error_code& ec) { boost::ignore_unused(f, name, value); ec = {}; } template<bool isRequest> void custom_parser<isRequest>:: on_header_impl(error_code& ec) { ec = {}; } template<bool isRequest> void custom_parser<isRequest>:: on_body_init_impl( boost::optional<std::uint64_t> const& content_length, error_code& ec) { boost::ignore_unused(content_length); ec = {}; } template<bool isRequest> std::size_t custom_parser<isRequest>:: on_body_impl(string_view body, error_code& ec) { boost::ignore_unused(body); ec = {}; return body.size(); } template<bool isRequest> void custom_parser<isRequest>:: on_chunk_header_impl( std::uint64_t size, string_view extension, error_code& ec) { boost::ignore_unused(size, extension); ec = {}; } template<bool isRequest> std::size_t custom_parser<isRequest>:: on_chunk_body_impl( std::uint64_t remain, string_view body, error_code& ec) { boost::ignore_unused(remain); ec = {}; return body.size(); } template<bool isRequest> void custom_parser<isRequest>:: on_finish_impl(error_code& ec) { ec = {}; } //------------------------------------------------------------------------------ // // Example: Incremental Read // //------------------------------------------------------------------------------ //[example_incremental_read /* This function reads a message using a fixed size buffer to hold portions of the body, and prints the body contents to a `std::ostream`. */ template< bool isRequest, class SyncReadStream, class DynamicBuffer> void read_and_print_body( std::ostream& os, SyncReadStream& stream, DynamicBuffer& buffer, error_code& ec) { parser<isRequest, buffer_body> p; read_header(stream, buffer, p, ec); if(ec) return; while(! p.is_done()) { char buf[512]; p.get().body.data = buf; p.get().body.size = sizeof(buf); read(stream, buffer, p, ec); if(ec == error::need_buffer) ec.assign(0, ec.category()); if(ec) return; os.write(buf, sizeof(buf) - p.get().body.size); } } //] //------------------------------------------------------------------------------ // // Example: Expect 100-continue // //------------------------------------------------------------------------------ //[example_chunk_parsing /** Read a message with a chunked body and print the chunks and extensions */ template< bool isRequest, class SyncReadStream, class DynamicBuffer> void print_chunked_body( std::ostream& os, SyncReadStream& stream, DynamicBuffer& buffer, error_code& ec) { // Declare the parser with an empty body since // we plan on capturing the chunks ourselves. parser<isRequest, empty_body> p; // First read the complete header read_header(stream, buffer, p, ec); if(ec) return; // This container will hold the extensions for each chunk chunk_extensions ce; // This string will hold the body of each chunk std::string chunk; // Declare our chunk header callback This is invoked // after each chunk header and also after the last chunk. auto header_cb = [&](std::uint64_t size, // Size of the chunk, or zero for the last chunk string_view extensions, // The raw chunk-extensions string. Already validated. error_code& ev) // We can set this to indicate an error { // Parse the chunk extensions so we can access them easily ce.parse(extensions, ev); if(ev) return; // See if the chunk is too big if(size > (std::numeric_limits<std::size_t>::max)()) { ev = error::body_limit; return; } // Make sure we have enough storage, and // reset the container for the upcoming chunk chunk.reserve(static_cast<std::size_t>(size)); chunk.clear(); }; // Set the callback. The function requires a non-const reference so we // use a local variable, since temporaries can only bind to const refs. p.on_chunk_header(header_cb); // Declare the chunk body callback. This is called one or // more times for each piece of a chunk body. auto body_cb = [&](std::uint64_t remain, // The number of bytes left in this chunk string_view body, // A buffer holding chunk body data error_code& ec) // We can set this to indicate an error { // If this is the last piece of the chunk body, // set the error so that the call to `read` returns // and we can process the chunk. if(remain == body.size()) ec = error::end_of_chunk; // Append this piece to our container chunk.append(body.data(), body.size()); // The return value informs the parser of how much of the body we // consumed. We will indicate that we consumed everything passed in. return body.size(); }; p.on_chunk_body(body_cb); while(! p.is_done()) { // Read as much as we can. When we reach the end of the chunk, the chunk // body callback will make the read return with the end_of_chunk error. read(stream, buffer, p, ec); if(! ec) continue; else if(ec != error::end_of_chunk) return; else ec.assign(0, ec.category()); // We got a whole chunk, print the extensions: for(auto const& extension : ce) { os << "Extension: " << extension.first; if(! extension.second.empty()) os << " = " << extension.second << std::endl; else os << std::endl; } // Now print the chunk body os << "Chunk Body: " << chunk << std::endl; } // Get a reference to the parsed message, this is for convenience auto const& msg = p.get(); // Check each field promised in the "Trailer" header and output it for(auto const& name : token_list{msg[field::trailer]}) { // Find the trailer field auto it = msg.find(name); if(it == msg.end()) { // Oops! They promised the field but failed to deliver it os << "Missing Trailer: " << name << std::endl; continue; } os << it->name() << ": " << it->value() << std::endl; } } //] } // http } // beast } // boost

vinnie.falco@gmail.com

9729e5a80760f3f40e261335d0b7bfd9e430af9b

b42ff57503362bd3771b2509335a5bfcec05c452

/utils/customwidgets/customtablemodel/datapointitemmodel.cpp

7e12aef6ae7566a66c561cf0aeb0c2b8ccd5cca6

no_license

yinzhi009/lib

fbda036d06e6cfb35dffa9fb36316f13b6a206b0

db96f6164db7858fa10b7b5bff2410641eca9932

refs/heads/master

UTF-8

C++

cpp

#include <QStringList> #include <QSize> #include <QColor> #include "datapointitemmodel.h" DataPointItemModel::DataPointItemModel(QObject *parent) : QAbstractTableModel(parent) , m_headerDatas() , m_datas() { } int DataPointItemModel::rowCount(const QModelIndex &parent) const { Q_UNUSED(parent); return m_datas.size(); } int DataPointItemModel::columnCount(const QModelIndex &parent) const { Q_UNUSED(parent); if (m_headerDatas.isEmpty()) { return 0; } return m_headerDatas.size(); } QVariant DataPointItemModel::data(const QModelIndex &index, int role) const { if (!index.isValid()) { return QVariant(); } if (role == Qt::TextAlignmentRole) { return int(Qt::AlignHCenter| Qt::AlignVCenter); } if (Qt::TextColorRole == role) { if (index.row() < m_datas.size() && index.column() < m_datas[index.row()].size()) { return QVariant(m_datas[index.row()].at(index.column()).getTextColor()); } return QVariant(); } if (role == Qt::DisplayRole) { if (index.row() < m_datas.size() && index.column() < m_datas[index.row()].size()) { return m_datas[index.row()].at(index.column()).data(); } } return QVariant(); } QVariant DataPointItemModel::headerData(int section, Qt::Orientation orientation, int role) const { // 横向标题 if (orientation == Qt::Horizontal && role == Qt::DisplayRole && section < m_headerDatas.count()) { return m_headerDatas.at(section); } return QAbstractTableModel::headerData(section, orientation, role); } bool DataPointItemModel::setData(const QModelIndex &index, const QVariant &value, int role) { if (!index.isValid() || role != Qt::EditRole) { return QAbstractTableModel::setData(index, value, role); } int row = index.row(); int col = index.column(); if (row >= m_datas.size() || col >= m_datas[row].size()) { return false; } DataPointItem &item = m_datas[row][col]; item.setShowText(value.toString()); emit dataChanged(index, index); return true; } Qt::ItemFlags DataPointItemModel::flags(const QModelIndex &index) const { Qt::ItemFlags flags = QAbstractItemModel::flags(index); if (index.isValid()) { flags |= Qt::ItemIsEditable; } return flags; } void DataPointItemModel::setHeader(const QStringList &header) { if (header.isEmpty() || m_headerDatas == header) { return; } // 当表格头变化时，意味着在执行新的案例，重置所有信息 beginResetModel(); m_datas.clear(); m_headerDatas = header; endResetModel(); } void DataPointItemModel::addData(const DataPointItem &data) { int rowIndex = rowCount(QModelIndex()); beginInsertRows(QModelIndex(), rowIndex, rowIndex); if (m_datas.isEmpty()) { addNewLine(data); } else { QList<DataPointItem> &lineDatas = m_datas.last(); if (lineDatas.size() == m_headerDatas.size()) { // new line addNewLine(data); } else { lineDatas << data; } } endInsertRows(); } void DataPointItemModel::clearDatas() { beginResetModel(); m_headerDatas.clear(); m_datas.clear(); endResetModel(); } void DataPointItemModel::refresh() { beginResetModel(); endResetModel(); } void DataPointItemModel::writeMemory(bool isFirstTime) { for (int i = 0; i < m_datas.size(); i++) { for (int j = 0; j < m_datas[i].size(); j++) { m_datas[i][j].writeMemory(isFirstTime); } } // 写完后刷新一下界面 refresh(); } void DataPointItemModel::addNewLine(const DataPointItem &data) { QList<DataPointItem> lineDatas; lineDatas << data; m_datas << lineDatas; }

yinzhiran@swjtu-richusn.com

480d6cfd33f155868d85e247fc54ad7141a15edc

9a728b6c31bfd6963712d38b30a6963fd7c531a8

/OrgXueBang/Classes/CoreHelper/Message/MsgParam.hpp

273e9911263fac7a20df327070c85a8615e2c5f0

no_license

daxingyou/MRK-OrgXueBang

5fba171f759ccae2f1e28b4f4364df7d088fe5d2

09f10f3fd22c3791d0c9ec84c2042a36a7a8f22d

refs/heads/master

UTF-8

C++

hpp

// // MsgParam.hpp // OrgXueBang-mobile // // Created by liuwei on 2019/1/8. // #ifndef MsgParam_hpp #define MsgParam_hpp #include <stdio.h> #include <string> using namespace std; #include "cocos2d.h" class MsgParam { private: enum eRES{ RES_OK = 0,//消息 RES_ERROR, }; public: MsgParam(); ~MsgParam(); MsgParam(string errTip); bool getIsResOK(); string getErrorTip(); void setErrorTip(string errTip); void setRefData(cocos2d::Ref* data); cocos2d::Ref* getRefData(); void setVecTemp(vector<string>* vecStr); vector<string> getVecTemp(); private: eRES resFlag;//返回结果 string errorTip;//错误提示 vector<string>* vecStrTemp; cocos2d::Ref* _data;//扩展用 int _type;//扩展用 }; #endif /* MsgParam_hpp */

autsck@163.com

ec6638730f6368f85bfaef8cb895edcd78f1e02b

9228d266b854a8767b2c3dd9f51a6cc07a9daf5e

/Source/Lutefisk3D/2D/Drawable2D.cpp

9758ce2b0dd619b2bf62df7bcda9da0ff5f72761

permissive

Lutefisk3D/lutefisk3d

9dfed84ab853134846ab9acf3c2fae419ec102f3

d2132b82003427511df0167f613905191b006eb5

refs/heads/master

NOASSERTION

C++

UTF-8

C++

cpp

// // Copyright (c) 2008-2016 the Urho3D project. // // Permission is hereby granted, free of charge, to any person obtaining a copy // of this software and associated documentation files (the "Software"), to deal // in the Software without restriction, including without limitation the rights // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell // copies of the Software, and to permit persons to whom the Software is // furnished to do so, subject to the following conditions: // // The above copyright notice and this permission notice shall be included in // all copies or substantial portions of the Software. // // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN // THE SOFTWARE. // #include "Drawable2D.h" #include "Renderer2D.h" #include "Lutefisk3D/Core/Context.h" #include "Lutefisk3D/Graphics/Camera.h" #include "Lutefisk3D/Graphics/Material.h" #include "Lutefisk3D/Graphics/Texture2D.h" #include "Lutefisk3D/Scene/Scene.h" #include "Lutefisk3D/Container/HandleManager.h" namespace Urho3D { const float PIXEL_SIZE = 0.01f; Drawable2D::Drawable2D(Context* context) : Drawable(context, DRAWABLE_GEOMETRY2D), layer_(0), orderInLayer_(0), sourceBatchesDirty_(true) { } Drawable2D::~Drawable2D() { if (renderer_) renderer_->RemoveDrawable(this); } void Drawable2D::RegisterObject(Context* context) { URHO3D_ACCESSOR_ATTRIBUTE("Layer", GetLayer, SetLayer, int, 0, AM_DEFAULT); URHO3D_ACCESSOR_ATTRIBUTE("Order in Layer", GetOrderInLayer, SetOrderInLayer, int, 0, AM_DEFAULT); URHO3D_ATTRIBUTE("View Mask", int, viewMask_, DEFAULT_VIEWMASK, AM_DEFAULT); } /// Handle enabled/disabled state change. void Drawable2D::OnSetEnabled() { bool enabled = IsEnabledEffective(); if (enabled && renderer_) renderer_->AddDrawable(this); else if (!enabled && renderer_) renderer_->RemoveDrawable(this); } /// Set layer. void Drawable2D::SetLayer(int layer) { if (layer == layer_) return; layer_ = layer; OnDrawOrderChanged(); MarkNetworkUpdate(); } /// Set order in layer. void Drawable2D::SetOrderInLayer(int orderInLayer) { if (orderInLayer == orderInLayer_) return; orderInLayer_ = orderInLayer; OnDrawOrderChanged(); MarkNetworkUpdate(); } /// Return all source batches (called by Renderer2D). const std::vector<SourceBatch2D>& Drawable2D::GetSourceBatches() { if (sourceBatchesDirty_) UpdateSourceBatches(); return sourceBatch_; } /// Handle scene being assigned. void Drawable2D::OnSceneSet(Scene* scene) { // Do not call Drawable::OnSceneSet(node), as 2D drawable components should not be added to the octree // but are instead rendered through Renderer2D if (scene) { renderer_ = scene->GetOrCreateComponent<Renderer2D>(); if (IsEnabledEffective()) renderer_->AddDrawable(this); } else { if (renderer_) renderer_->RemoveDrawable(this); } } /// Handle node transform being dirtied. void Drawable2D::OnMarkedDirty(Node* node) { Drawable::OnMarkedDirty(node); sourceBatchesDirty_ = true; } }

nemerle5@gmail.com

1ef55f89eb8f6afbc6aa90d377f33e305737e033

f5deac52f73fffbdcebaadb24fabbb1c33a6a808

/src/stable/queue.cpp

3fb993c3307393581c4afe49347f54bd64dcc562

permissive

zippy/libbu

d92557f8ece66c70e8ba37768194b2d6aad8bd89

6c79102419f9e79d25751fefc155f746496f4b50

refs/heads/master

UTF-8

C++

cpp

/* * Copyright (C) 2007-2013 Xagasoft, All rights reserved. * * This file is part of the libbu++ library and is released under the * terms of the license contained in the file LICENSE. */ #include "bu/queue.h"

mike@xagasoft.com

ff2bc2760f6a38329c29c8103fd9ac79b6d2a8e9

b13299265bb464aa42a73ba16ab02de672328337

/include/lemviewer.h

851e5b135bcf37936c872b4d93f4dc8cbc7234bd

no_license

jamie124/DCPU-Developer

65f98b33bb9420f1597bd0d2ff166924df9848db

83e5e952872a054a44badc188d9a91390eaccc4c

refs/heads/master

UTF-8

C++

h

#ifndef _LEMVIEWER_H #define _LEMVIEWER_H #include <QGLWidget> #include "constants.h" #include "emulator.h" #include <QMutex> const int CHAR_WIDTH = 4; const int CHAR_HEIGHT = 8; const int COLUMNS = 32; const int ROWS = 12; const int WIDTH = COLUMNS * CHAR_WIDTH; const int HEIGHT = ROWS * CHAR_HEIGHT; // Size of pixel, scaled up to create 0x10c look const int PIXEL_WIDTH = 3; const int PIXEL_HEIGHT = 3; const int REAL_WIDTH = WIDTH * PIXEL_WIDTH; const int REAL_HEIGHT = HEIGHT * PIXEL_HEIGHT; const word_t defaultPalette[] = { 0x000, 0x00a, 0x0a0, 0x0aa, 0xa00, 0xa0a, 0xa50, 0xaaa, 0x555, 0x55f, 0x5f5, 0x5ff, 0xf55, 0xf5f, 0xff5, 0xfff }; const word_t defaultFont[] = { 0xb79e, 0x388e, 0x722c, 0x75f4, 0x19bb, 0x7f8f, 0x85f9, 0xb158, 0x242e, 0x2400, 0x082a, 0x0800, 0x0008, 0x0000, 0x0808, 0x0808, 0x00ff, 0x0000, 0x00f8, 0x0808, 0x08f8, 0x0000, 0x080f, 0x0000, 0x000f, 0x0808, 0x00ff, 0x0808, 0x08f8, 0x0808, 0x08ff, 0x0000, 0x080f, 0x0808, 0x08ff, 0x0808, 0x6633, 0x99cc, 0x9933, 0x66cc, 0xfef8, 0xe080, 0x7f1f, 0x0701, 0x0107, 0x1f7f, 0x80e0, 0xf8fe, 0x5500, 0xaa00, 0x55aa, 0x55aa, 0xffaa, 0xff55, 0x0f0f, 0x0f0f, 0xf0f0, 0xf0f0, 0x0000, 0xffff, 0xffff, 0x0000, 0xffff, 0xffff, 0x0000, 0x0000, 0x005f, 0x0000, 0x0300, 0x0300, 0x3e14, 0x3e00, 0x266b, 0x3200, 0x611c, 0x4300, 0x3629, 0x7650, 0x0002, 0x0100, 0x1c22, 0x4100, 0x4122, 0x1c00, 0x1408, 0x1400, 0x081c, 0x0800, 0x4020, 0x0000, 0x0808, 0x0800, 0x0040, 0x0000, 0x601c, 0x0300, 0x3e49, 0x3e00, 0x427f, 0x4000, 0x6259, 0x4600, 0x2249, 0x3600, 0x0f08, 0x7f00, 0x2745, 0x3900, 0x3e49, 0x3200, 0x6119, 0x0700, 0x3649, 0x3600, 0x2649, 0x3e00, 0x0024, 0x0000, 0x4024, 0x0000, 0x0814, 0x2200, 0x1414, 0x1400, 0x2214, 0x0800, 0x0259, 0x0600, 0x3e59, 0x5e00, 0x7e09, 0x7e00, 0x7f49, 0x3600, 0x3e41, 0x2200, 0x7f41, 0x3e00, 0x7f49, 0x4100, 0x7f09, 0x0100, 0x3e41, 0x7a00, 0x7f08, 0x7f00, 0x417f, 0x4100, 0x2040, 0x3f00, 0x7f08, 0x7700, 0x7f40, 0x4000, 0x7f06, 0x7f00, 0x7f01, 0x7e00, 0x3e41, 0x3e00, 0x7f09, 0x0600, 0x3e61, 0x7e00, 0x7f09, 0x7600, 0x2649, 0x3200, 0x017f, 0x0100, 0x3f40, 0x7f00, 0x1f60, 0x1f00, 0x7f30, 0x7f00, 0x7708, 0x7700, 0x0778, 0x0700, 0x7149, 0x4700, 0x007f, 0x4100, 0x031c, 0x6000, 0x417f, 0x0000, 0x0201, 0x0200, 0x8080, 0x8000, 0x0001, 0x0200, 0x2454, 0x7800, 0x7f44, 0x3800, 0x3844, 0x2800, 0x3844, 0x7f00, 0x3854, 0x5800, 0x087e, 0x0900, 0x4854, 0x3c00, 0x7f04, 0x7800, 0x047d, 0x0000, 0x2040, 0x3d00, 0x7f10, 0x6c00, 0x017f, 0x0000, 0x7c18, 0x7c00, 0x7c04, 0x7800, 0x3844, 0x3800, 0x7c14, 0x0800, 0x0814, 0x7c00, 0x7c04, 0x0800, 0x4854, 0x2400, 0x043e, 0x4400, 0x3c40, 0x7c00, 0x1c60, 0x1c00, 0x7c30, 0x7c00, 0x6c10, 0x6c00, 0x4c50, 0x3c00, 0x6454, 0x4c00, 0x0836, 0x4100, 0x0077, 0x0000, 0x4136, 0x0800, 0x0201, 0x0201, 0x0205, 0x0200 }; class LemViewer : public QGLWidget { Q_OBJECT public: LemViewer(Emulator *emu, QWidget *parent = 0); ~LemViewer(); void queueChar(int c, int r); void drawScreen(); void drawChar(int c, int r); void drawLoop(); void updateChar(word_t key); word_t getColour(word_t value); void setScreenAddress(long ramAddress); public slots: void animate(); protected: void paintEvent(QPaintEvent *event); private: int elapsed; Emulator *emulator; long screenAddress; word_map memory; word_t videoBuffer[WIDTH][HEIGHT]; //QMap<int, QMap<int, int>> videoBuffer; QMap<int, QMap<int, bool> > cellQueue; bool initialised; }; #endif

jtwhitwell124@gmail.com

cbdd3f7ecbae16e656be58fa203e562f100b8da3

8e97a71b84848e9c91d7675ee118a48b3e324c05

/04.Matrices/Matrices.cpp

d88317a234bac40cc81de33bc202cb6668959bb8

no_license

AndreyPootMay/coursecpp

c1b2bc8cdfa59667c785916efb8e08c34cbc60bd

e9f4ae515947fc70828ebb8e943b74da72073194

refs/heads/master

UTF-8

C++

cpp

/* * Matrices.cpp * * Copyright 2019 andrey <andrey@andrey-HP-Notebook> * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, * MA 02110-1301, USA. * * */ #include <iostream> #include <stdio.h> #define SIZE 100 using namespace std; int main(int argc, char **argv) { int m[SIZE][SIZE], column=0, row=0, index_row=0, index_column=0; cout<<"Ingresa el número de las columnas"<<endl; cin>>column; cout<<"Ingrese el número de las filas"<<endl; cin>>row; for(index_row = 0;index_row < row; index_row++) { for (index_column = 0; index_column < column; index_column++) { cout<<"Escribe las calificaciones para ["<<index_row+1<<"]"<<"["<<index_column+1<<"]"<<endl; cin>>m[index_row][index_column]; } } cout<<"\n\tLas calificaciones almacenadas en la matriz son: "<<endl; cout<<"\n\n"; for(index_row = 0;index_row < row; index_row++) { cout<<"\n\t"; for (index_column = 0; index_column < column; index_column++) { cout<<m[index_row][index_column]<<" "; } } getchar(); return 0; }

spocker312@gmail.com

808a7ad56d9c087106f046347335501e38768e5b

5c345604f15646bd48ada2cd34f4577b0d15ca93

/simulator/main.cpp

126a51ec40488eac5e221ab7d37b7d91b95d0a19

no_license

dtbinh/gengar

9327b623bf79e6370459abd9d7d95af3a7818c0c

440ffff4cce9324bb2bf77e0246ec17f7213a4a7

refs/heads/master

UTF-8

C++

cpp

#include "Simulator.h" int main(int argc, char* argv[]){ Simulator simulator; simulator.set_number_nodes(3); //1000 uS - 1 ms simulator.set_network_latency(7000, 200); //10 bytes/uS - 10Mbps simulator.set_network_bandwidth(10, 3); //100 bytes/uS - 100Mbps simulator.set_disk_read_bandwidth(100, 10); //30 bytes/uS - 30Mbps simulator.set_disk_write_bandwidth(30, 5); //various other parameters simulator.start(); }

nave.mvn@gmail.com

baa6c32874bb073b915da51c9a0733dc4de80dc6

3b0cfb2c8a71f1142bca53004866306477348f2a

/linklist.h

d264896de7d64750f712ac0e3b79deb55d20abbc

no_license

BaiJiazm/LinkListVisualizer

51963e8bfa598faf1280f50c1ff30ccb440def45

d6ea13b96a374392510d77f099106ca53c861753

refs/heads/master

UTF-8

C++

h

#ifndef LINKLIST_H #define LINKLIST_H #include <QWidget> #include <QFile> #include <QTextBrowser> #include <QGraphicsScene> #include <QGraphicsView> #include <QGraphicsItem> #include <QIntValidator> #include "uidefine.h" #include "lnode.h" namespace Ui { class LinkList; } class LinkList : public QWidget { Q_OBJECT public: explicit LinkList(QWidget *parent = 0); //构造函数 ~LinkList(); //析构函数 private slots: void on_pushButtonInit_clicked(); //槽函数：点击创建 void on_pushButtonClear_clicked(); //槽函数：点击清空 void on_pushButtonInsert_clicked(); //槽函数：点击插入 void on_pushButtonRandomInsert5_clicked(); //随机插入五个节点到链表末尾 void on_pushButtonDelete_clicked(); //槽函数：点击删除 void on_pushButtonLocate_clicked(); //槽函数：点击查找 void on_horizontalSlider_valueChanged(int value); //调整演示的速度快慢 protected: Ui::LinkList *ui; //UI指针 QGraphicsScene *scene; //视图场景指针 QGraphicsTextItem *headLabel; //链表符号指针 MyArrowItem *headArrow; //符号箭头指针 LNode *head; //头结点指针 int countNode; //节点个数计数（不包括头结点） int sleepTime; //演示延时时间（ms） void initTextBrowser(); //初始设置文本显示区 void initUI(); //初始UI控件 void initSceneView(); //初始化视图框架 void adjustController(); //操作之后调整右侧输入和显示控件 QPoint getLNodePos(int nodeNumber); //计算节点的Scene坐标 void addLNodeGraphicsItem(LNode *pl, QPoint coord); //添加节点的GraphicsItem void adjustLNodeArrow(LNode *pLNode, int nodeNumber); //调整节点的箭头 void adjustLNodePos(LNode *pLNode, QPoint coord); //调整节点Scene坐标 void setLinkListNormalBrush(); //设置链表所有节点显示模式 void initLinkList(); //创建链表初始化 void insertLNode(int pos, QString elem); //插入节点到链表 void deleteLNode(int pos, QString &elem); //删除链表节点 bool locateLNode(int &pos,QString elem); //查找链表节点 void destroySelf(); //释放申请的内存空间 private: //静态常数据，类似于宏 const static QBrush normalBursh, visitedBrush, markBrush; const static QFont headLabelFont, dataFont; const static QIntValidator dataValidator; }; #endif // LINKLIST_H

1481977509@qq.com

832d4782d9e0ba61ec036f452162714dcbacc0ed

efdc794bc1152d9e702ea03e32142cf4ff1031cd

/third_party/pdfium/xfa/fxbarcode/cbc_upca.h

bf90b922b5053e8e39d6792001ac4141cedc6b44

permissive

taggun/node-pdfium

c3c7c85fd4a280993aa0ce99dcb2f41ce8d592dc

1990bc55e39f700434841e35078cecaa347b1e36

refs/heads/master

BSD-2-Clause

C++

UTF-8

C++

h

// Copyright 2016 PDFium Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. // Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com #ifndef XFA_FXBARCODE_CBC_UPCA_H_ #define XFA_FXBARCODE_CBC_UPCA_H_ #include "core/fxcrt/fx_string.h" #include "core/fxcrt/fx_system.h" #include "core/fxge/fx_dib.h" #include "xfa/fxbarcode/cbc_onecode.h" class CBC_UPCA : public CBC_OneCode { public: CBC_UPCA(); ~CBC_UPCA() override; // CBC_CodeBase bool Encode(const CFX_WideStringC& contents, bool isDevice, int32_t& e) override; bool RenderDevice(CFX_RenderDevice* device, const CFX_Matrix* matrix, int32_t& e) override; bool RenderBitmap(CFX_DIBitmap*& pOutBitmap, int32_t& e) override; BC_TYPE GetType() override; private: CFX_WideString Preprocess(const CFX_WideStringC& contents); CFX_WideString m_renderContents; }; #endif // XFA_FXBARCODE_CBC_UPCA_H_

michael.arthur@ikegps.com

3a5f7a7fa8f4d15af8942ac12ad285181425a240

69438cb3c613ff2674f1ad90d3e7c895d55c3d6a

/dji_sdk/protocol/src/dji_protocol_base.cpp

1e1c3d6e716057d0f774c2a112aa9c222c5995dc

no_license

robomasterhkust/RMAerial

a9e982ad80d0336b2e22e1afef31f9d11514bde8

d3f1c568b489fa016f89c91322d5f50a13896839

refs/heads/master

UTF-8

C++

cpp

/** @file dji_protocol_base.cpp * @version 3.4 * @date Dec 2017 * * @brief * Abstract protocol implementation for DJI OSDK * * @Copyright (c) 2017 DJI * * Permission is hereby granted, free of charge, to any person obtaining a copy * of this software and associated documentation files (the "Software"), to deal * in the Software without restriction, including without limitation the rights * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell * copies of the Software, and to permit persons to whom the Software is * furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included in * all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE * SOFTWARE. * */ #include "dji_protocol_base.hpp" using namespace DJI; using namespace DJI::OSDK; ProtocolBase::ProtocolBase() : reuse_buffer(true) , is_large_data_protocol(false) , BUFFER_SIZE(1024) { } ProtocolBase::~ProtocolBase() { if (this->deviceDriver) delete this->deviceDriver; if (this->threadHandle) delete this->threadHandle; } //! Step 0: Call this in a loop. RecvContainer* ProtocolBase::receive() { //! Create a local container that will be used for storing data lower down in //! the stack p_recvContainer->recvInfo.cmd_id = 0xFF; //! Run the readPoll see if we got a frame readPoll(); //! When we receive a true, return a copy of container to the caller: this is //! the 'receive' interface return p_recvContainer; } //! Step 1 bool ProtocolBase::readPoll() { //! Bool to check if the protocol parser has finished a full frame bool isFrame = false; //! Step 1: Check if the buffer has been consumed if (buf_read_pos >= read_len) { this->buf_read_pos = 0; this->read_len = deviceDriver->readall(this->buf, BUFFER_SIZE); } #ifdef API_BUFFER_DATA onceRead = read_len; totalRead += onceRead; #endif // API_BUFFER_DATA //! Step 2: //! For large data protocol, store the value and only verify the header //! For small data protocol, Go through the buffer and return when you //! see a full frame. buf_read_pos will maintain state about how much //! buffer data we have already read if (is_large_data_protocol && this->read_len == BUFFER_SIZE) { memcpy(p_filter->recvBuf + (p_filter->recvIndex), this->buf, sizeof(uint8_t) * BUFFER_SIZE); p_filter->recvIndex += BUFFER_SIZE; this->buf_read_pos = BUFFER_SIZE; } else { for (this->buf_read_pos; this->buf_read_pos < this->read_len; this->buf_read_pos++) { isFrame = byteHandler(buf[this->buf_read_pos]); if (isFrame) { return isFrame; } } } //! Step 3: If we don't find a full frame by this time, return false. //! The receive function calls readPoll in a loop, so if it returns false //! it'll just be called again return isFrame; } //! Step 2 bool ProtocolBase::byteHandler(const uint8_t in_data) { p_filter->reuseCount = 0; p_filter->reuseIndex = MAX_RECV_LEN; //! Bool to check if the protocol parser has finished a full frame bool isFrame = streamHandler(in_data); /*! @note Just think a command as below * * [123456HHD1234567===HHHH------------------] --- is buf un-used part * * if after recv full of above, but crc failed, we throw all data? * NO! * Just throw ONE BYTE, we move like below * * [123456HH------------------D1234567===HHHH] * * Use the buffer high part to re-loop, try to find a new command * * if new cmd also fail, and buf like below * * [56HHD1234567----------------------===HHHH] * * throw one byte, buf looks like * * [6HHD123-----------------------4567===HHHH] * * the command tail part move to buffer right * */ if (reuse_buffer) { if (p_filter->reuseCount != 0) { while (p_filter->reuseIndex < MAX_RECV_LEN) { /*! @note because reuse_index maybe re-located, so reuse_index must * be * always point to un-used index * re-loop the buffered data * */ isFrame = streamHandler(p_filter->recvBuf[p_filter->reuseIndex++]); } p_filter->reuseCount = 0; } } return isFrame; } //! Step 3 bool ProtocolBase::streamHandler(uint8_t in_data) { storeData(in_data); //! Bool to check if the protocol parser has finished a full frame bool isFrame = checkStream(); return isFrame; } //! Step 4 //! @note push data to filter buffer. //! SDKFilter is just a buffer. void ProtocolBase::storeData(uint8_t in_data) { if (p_filter->recvIndex < MAX_RECV_LEN) { p_filter->recvBuf[p_filter->recvIndex] = in_data; p_filter->recvIndex++; } else { memset(p_filter->recvBuf, 0, p_filter->recvIndex); p_filter->recvIndex = 0; } } void ProtocolBase::prepareDataStream() { uint32_t bytes_to_move = HEADER_LEN - 1; uint32_t index_of_move = p_filter->recvIndex - bytes_to_move; memmove(p_filter->recvBuf, p_filter->recvBuf + index_of_move, bytes_to_move); memset(p_filter->recvBuf + bytes_to_move, 0, index_of_move); p_filter->recvIndex = bytes_to_move; } void ProtocolBase::shiftDataStream() { if (p_filter->recvIndex) { p_filter->recvIndex--; if (p_filter->recvIndex) { memmove(p_filter->recvBuf, p_filter->recvBuf + 1, p_filter->recvIndex); } } } // this function will move the data part to buffer end, // head part will move left // // 1. there no re-use data // |------------------------------------------| <= cache // ^ // reuse_index // [12345678][ data Part ]--------------------| 1. p_filter // [12345678]---------------------[ data Part ] 2. move data to end // [2345678]----------------------[ data Part ] 3. forward head // [2345678]------------[ data need to re-use ] 4. final mem layout // // 2. already has re-use data // |---------------------------------[rev data] <= cache // ^ // reuse_index, the data already used // [12345678][ data Part ]-----------[rev data] 1. p_filter // [12345678]-----------[ data Part ][rev data] 2. move data to end // [2345678]------------[ data Part ][rev data] 3. forward head // [2345678]------------[ data need to re-use ] 4. final mem layout // // the re-use data will loop later void ProtocolBase::reuseDataStream() { uint8_t* p_buf = p_filter->recvBuf; uint16_t bytes_to_move = p_filter->recvIndex - HEADER_LEN; uint8_t* p_src = p_buf + HEADER_LEN; uint16_t n_dest_index = p_filter->reuseIndex - bytes_to_move; uint8_t* p_dest = p_buf + n_dest_index; memmove(p_dest, p_src, bytes_to_move); p_filter->recvIndex = HEADER_LEN; shiftDataStream(); p_filter->reuseIndex = n_dest_index; p_filter->reuseCount++; } HardDriver* ProtocolBase::getDriver() const { return this->deviceDriver; } ThreadAbstract* ProtocolBase::getThreadHandle() const { return this->threadHandle; } void ProtocolBase::setDriver(HardDriver* hardDriver_ptr) { this->deviceDriver = hardDriver_ptr; } void ProtocolBase::setThreadHandle(ThreadAbstract* threadAbstract_ptr) { this->threadHandle = threadAbstract_ptr; } void ProtocolBase::setHeaderLength(uint8_t length) { HEADER_LEN = length; } void ProtocolBase::setMaxRecvLength(int length) { MAX_RECV_LEN = length; } int ProtocolBase::getBufReadPos() { return buf_read_pos; } int ProtocolBase::getReadLen() { return read_len; } RecvContainer* ProtocolBase::getReceivedFrame() { return p_recvContainer; }

yzhangdk@ust.hk

0526cff308ca3155340801a648e6e5f8f0fbd244

785463ea0d81e1ab888a858e31ab8cf8b24e4ce6

/src/shared/datalib/io/string.hpp

12e929459bca0a0f8307df9d90d9d06ec184aef4

permissive

GTAResources/modloader

475853390165290d0b5f37f239f3e6b15f36195a

18f85c2766d4e052a452c7b1d8f5860a6daac24b

refs/heads/master

MIT

MacCentralEurope

C++

hpp

/* * Copyright (C) 2014 Denilson das MercÍs Amorim (aka LINK/2012) * Licensed under the Boost Software License v1.0 (http://opensource.org/licenses/BSL-1.0) * */ #pragma once #include <datalib/data_info/string.hpp> #include <string>

dma_2012@hotmail.com

2c8e1571c08d4cb27a476c6c12fc689257a7ac89

c67cbd22f9bc3c465fd763fdf87172f2c8ec77d4

/Desktop/Please Work/build/Android/Preview/app/src/main/include/Fuse.Android.TextRend-b6e4a886.h

c861548e3f48b2af5777465b0f4fb3f1d5ab63a7

no_license

AzazelMoreno/Soteria-project

7c58896d6bf5a9ad919bde6ddc2a30f4a07fa0d4

04fdb71065941176867fb9007ecf38bbf851ad47

refs/heads/master

UTF-8

C++

h

// This file was generated based on C:/Users/rudy0/AppData/Local/Fusetools/Packages/Fuse.Android.TextRenderer/1.8.1/TextRenderer.uno. // WARNING: Changes might be lost if you edit this file directly. #pragma once #include <Uno.Object.h> #include <Uno.Recti.h> namespace g{namespace Fuse{namespace Android{struct StaticLayout;}}} namespace g{namespace Fuse{namespace Android{struct TextRenderer;}}} namespace g{namespace Fuse{namespace Android{struct TextRenderer__BackgroundRender;}}} namespace g{namespace Uno{namespace Graphics{struct Texture2D;}}} namespace g{ namespace Fuse{ namespace Android{ // private sealed class TextRenderer.BackgroundRender :282 // { uType* TextRenderer__BackgroundRender_typeof(); void TextRenderer__BackgroundRender__ctor__fn(TextRenderer__BackgroundRender* __this, ::g::Fuse::Android::TextRenderer* textRenderer, uint64_t* textureVersion, ::g::Fuse::Android::StaticLayout* layout, ::g::Uno::Recti* pixelBounds); void TextRenderer__BackgroundRender__DoneCallback_fn(TextRenderer__BackgroundRender* __this); void TextRenderer__BackgroundRender__New1_fn(::g::Fuse::Android::TextRenderer* textRenderer, uint64_t* textureVersion, ::g::Fuse::Android::StaticLayout* layout, ::g::Uno::Recti* pixelBounds, TextRenderer__BackgroundRender** __retval); void TextRenderer__BackgroundRender__UpdateTextureAsync_fn(TextRenderer__BackgroundRender* __this); struct TextRenderer__BackgroundRender : uObject { uStrong< ::g::Fuse::Android::TextRenderer*> _textRenderer; uint64_t _textureVersion; uStrong< ::g::Fuse::Android::StaticLayout*> _layout; ::g::Uno::Recti _pixelBounds; uStrong< ::g::Uno::Graphics::Texture2D*> _result; void ctor_(::g::Fuse::Android::TextRenderer* textRenderer, uint64_t textureVersion, ::g::Fuse::Android::StaticLayout* layout, ::g::Uno::Recti pixelBounds); void DoneCallback(); void UpdateTextureAsync(); static TextRenderer__BackgroundRender* New1(::g::Fuse::Android::TextRenderer* textRenderer, uint64_t textureVersion, ::g::Fuse::Android::StaticLayout* layout, ::g::Uno::Recti pixelBounds); }; // } }}} // ::g::Fuse::Android

rudy0604594@gmail.com

4c77e1da3e9e85add1f524b0e0252ea9224f9fd9

d1e81fa4e8a54b5d5e0e4f85adb79971a8d3b4dd

/TFTTest/TftTest1/UTFT.cpp

5854898716af44b286f7a598c26aa16e0cbbacfa

no_license

SimonBlasen/Arduino

8fd753d7c5075765a52b7d2b54e78a69c77886d9

623ecd8869231549871795730fa2c96452493d17

refs/heads/master

UTF-8

C++

cpp

/* UTFT.cpp - Arduino/chipKit library support for Color TFT LCD Boards Copyright (C)2010-2014 Henning Karlsen. All right reserved This library is the continuation of my ITDB02_Graph, ITDB02_Graph16 and RGB_GLCD libraries for Arduino and chipKit. As the number of supported display modules and controllers started to increase I felt it was time to make a single, universal library as it will be much easier to maintain in the future. Basic functionality of this library was origianlly based on the demo-code provided by ITead studio (for the ITDB02 modules) and NKC Electronics (for the RGB GLCD module/shield). This library supports a number of 8bit, 16bit and serial graphic displays, and will work with both Arduino and chipKit boards. For a full list of tested display modules and controllers, see the document UTFT_Supported_display_modules_&_controllers.pdf. When using 8bit and 16bit display modules there are some requirements you must adhere to. These requirements can be found in the document UTFT_Requirements.pdf. There are no special requirements when using serdial displays. You can always find the latest version of the library at http://electronics.henningkarlsen.com/ http://www.buydisplay.com If you make any modifications or improvements to the code, I would appreciate that you share the code with me so that I might include it in the next release. I can be contacted through http://electronics.henningkarlsen.com/contact.php. This library is free software; you can redistribute it and/or modify it under the terms of the CC BY-NC-SA 3.0 license. Please see the included documents for further information. Commercial use of this library requires you to buy a license that will allow commercial use. This includes using the library, modified or not, as a tool to sell products. The license applies to all part of the library including the examples and tools supplied with the library. */ #include "UTFT.h" #include <pins_arduino.h> // Include hardware-specific functions for the correct MCU #if defined(__AVR__) #include <avr/pgmspace.h> #include "hardware/avr/HW_AVR.h" #if defined(__AVR_ATmega1280__) || defined(__AVR_ATmega2560__) #include "hardware/avr/HW_ATmega1280.h" #elif defined(__AVR_ATmega328P__) #include "hardware/avr/HW_ATmega328P.h" #elif defined(__AVR_ATmega32U4__) #include "hardware/avr/HW_ATmega32U4.h" #elif defined(__AVR_ATmega168__) #error "ATmega168 MCUs are not supported because they have too little flash memory!" #elif defined(__AVR_ATmega1284P__) #include "hardware/avr/HW_ATmega1284P.h" #else #error "Unsupported AVR MCU!" #endif #elif defined(__PIC32MX__) #include "hardware/pic32/HW_PIC32.h" #if defined(__32MX320F128H__) #pragma message("Compiling for chipKIT UNO32 (PIC32MX320F128H)") #include "hardware/pic32/HW_PIC32MX320F128H.h" #elif defined(__32MX340F512H__) #pragma message("Compiling for chipKIT uC32 (PIC32MX340F512H)") #include "hardware/pic32/HW_PIC32MX340F512H.h" #elif defined(__32MX795F512L__) #pragma message("Compiling for chipKIT MAX32 (PIC32MX795F512L)") #include "hardware/pic32/HW_PIC32MX795F512L.h" #else #error "Unsupported PIC32 MCU!" #endif #elif defined(__arm__) #include "hardware/arm/HW_ARM.h" #if defined(__SAM3X8E__) #pragma message("Compiling for Arduino Due (AT91SAM3X8E)...") #include "hardware/arm/HW_SAM3X8E.h" #elif defined(__MK20DX128__) || defined(__MK20DX256__) #pragma message("Compiling for Teensy 3.x (MK20DX128VLH7 / MK20DX256VLH7)...") #include "hardware/arm/HW_MX20DX256.h" #else #error "Unsupported ARM MCU!" #endif #endif #include "memorysaver.h" UTFT::UTFT() { } UTFT::UTFT(byte model, int RS, int WR, int CS, int RST, int SER) { word dsx[] = {239, 239, 239, 239, 239, 239, 175, 175, 239, 127, 127, 239, 271, 479, 239, 239, 239, 0, 0, 239, 479, 319, 239, 175, 127, 239, 239, 319, 319, 799, 127, 127, 239, 239, 319, 319, 319, 319, 127}; word dsy[] = {319, 399, 319, 319, 319, 319, 219, 219, 399, 159, 127, 319, 479, 799, 319, 319, 319, 0, 0, 319, 799, 479, 319, 219, 159, 319, 319, 479, 479, 479, 159, 159, 319, 319, 479, 239, 239, 239, 159}; byte dtm[] = {16, 16, 16, 8, 8, 16, 8, SERIAL_4PIN, 16, SERIAL_5PIN, SERIAL_5PIN, 16, 16, 16, 8, 16, LATCHED_16, 0, 0, 8, 16, 16, 16, 8, SERIAL_5PIN, SERIAL_5PIN, SERIAL_4PIN, 16, 16, 16, SERIAL_5PIN, SERIAL_5PIN, 8, 16, 16, 16, SERIAL_5PIN, SERIAL_4PIN, SERIAL_5PIN}; disp_x_size = dsx[model]; disp_y_size = dsy[model]; display_transfer_mode = dtm[model]; display_model = model; __p1 = RS; __p2 = WR; __p3 = CS; __p4 = RST; __p5 = SER; if (display_transfer_mode == SERIAL_4PIN) { display_transfer_mode=1; display_serial_mode=SERIAL_4PIN; } if (display_transfer_mode == SERIAL_5PIN) { display_transfer_mode=1; display_serial_mode=SERIAL_5PIN; } if (display_transfer_mode!=1) { _set_direction_registers(display_transfer_mode); P_RS = portOutputRegister(digitalPinToPort(RS)); B_RS = digitalPinToBitMask(RS); P_WR = portOutputRegister(digitalPinToPort(WR)); B_WR = digitalPinToBitMask(WR); P_CS = portOutputRegister(digitalPinToPort(CS)); B_CS = digitalPinToBitMask(CS); P_RST = portOutputRegister(digitalPinToPort(RST)); B_RST = digitalPinToBitMask(RST); if (display_transfer_mode==LATCHED_16) { P_ALE = portOutputRegister(digitalPinToPort(SER)); B_ALE = digitalPinToBitMask(SER); cbi(P_ALE, B_ALE); pinMode(8,OUTPUT); digitalWrite(8, LOW); } } else { P_SDA = portOutputRegister(digitalPinToPort(RS)); B_SDA = digitalPinToBitMask(RS); P_SCL = portOutputRegister(digitalPinToPort(WR)); B_SCL = digitalPinToBitMask(WR); P_CS = portOutputRegister(digitalPinToPort(CS)); B_CS = digitalPinToBitMask(CS); if (RST != NOTINUSE) { P_RST = portOutputRegister(digitalPinToPort(RST)); B_RST = digitalPinToBitMask(RST); } if (display_serial_mode!=SERIAL_4PIN) { P_RS = portOutputRegister(digitalPinToPort(SER)); B_RS = digitalPinToBitMask(SER); } } } void UTFT::LCD_Write_COM(char VL) { if (display_transfer_mode!=1) { cbi(P_RS, B_RS); LCD_Writ_Bus(0x00,VL,display_transfer_mode); } else LCD_Writ_Bus(0x00,VL,display_transfer_mode); } void UTFT::LCD_Write_DATA(char VH,char VL) { if (display_transfer_mode!=1) { if(display_transfer_mode==16) {sbi(P_RS, B_RS); LCD_Writ_Bus(VH,VL,display_transfer_mode); } else if(display_transfer_mode==8) {sbi(P_RS, B_RS); LCD_Writ_Bus(0x00,VH,display_transfer_mode); LCD_Writ_Bus(0x00,VL,display_transfer_mode); } } else { LCD_Writ_Bus(0x01,VH,display_transfer_mode); LCD_Writ_Bus(0x01,VL,display_transfer_mode); } } void UTFT::LCD_Write_DATA(char VL) { if (display_transfer_mode!=1) { sbi(P_RS, B_RS); LCD_Writ_Bus(0x00,VL,display_transfer_mode); } else LCD_Writ_Bus(0x01,VL,display_transfer_mode); } void UTFT::LCD_Write_COM_DATA(char com1,int dat1) { LCD_Write_COM(com1); LCD_Write_DATA(dat1>>8,dat1); } void UTFT::InitLCD(byte orientation) { orient=orientation; _hw_special_init(); pinMode(__p1,OUTPUT); pinMode(__p2,OUTPUT); pinMode(__p3,OUTPUT); if (__p4 != NOTINUSE) pinMode(__p4,OUTPUT); if ((display_transfer_mode==LATCHED_16) or ((display_transfer_mode==1) and (display_serial_mode==SERIAL_5PIN))) pinMode(__p5,OUTPUT); if (display_transfer_mode!=1) _set_direction_registers(display_transfer_mode); sbi(P_RST, B_RST); delay(5); cbi(P_RST, B_RST); delay(15); sbi(P_RST, B_RST); delay(15); cbi(P_CS, B_CS); switch(display_model) { /*#ifndef DISABLE_HX8347A #include "tft_drivers/hx8347a/initlcd.h" #endif #ifndef DISABLE_ILI9327 #include "tft_drivers/ili9327/initlcd.h" #endif #ifndef DISABLE_SSD1289 #include "tft_drivers/ssd1289/initlcd.h" #endif #ifndef DISABLE_ILI9325C #include "tft_drivers/ili9325c/initlcd.h" #endif #ifndef DISABLE_ILI9325D #include "tft_drivers/ili9325d/default/initlcd.h" #endif #ifndef DISABLE_ILI9325D_ALT #include "tft_drivers/ili9325d/alt/initlcd.h" #endif #ifndef DISABLE_HX8340B_8 #include "tft_drivers/hx8340b/8/initlcd.h" #endif #ifndef DISABLE_HX8340B_S #include "tft_drivers/hx8340b/s/initlcd.h" #endif #ifndef DISABLE_ST7735 #include "tft_drivers/st7735/std/initlcd.h" #endif #ifndef DISABLE_ST7735_ALT #include "tft_drivers/st7735/alt/initlcd.h" #endif #ifndef DISABLE_PCF8833 #include "tft_drivers/pcf8833/initlcd.h" #endif #ifndef DISABLE_S1D19122 #include "tft_drivers/s1d19122/initlcd.h" #endif #ifndef DISABLE_HX8352A #include "tft_drivers/hx8352a/initlcd.h" #endif*/ #ifndef DISABLE_SSD1963_480 #include "tft_drivers/ssd1963/480/initlcd.h" #endif #ifndef DISABLE_SSD1963_800 #include "tft_drivers/ssd1963/800/initlcd.h" #endif #ifndef DISABLE_SSD1963_800_ALT #include "tft_drivers/ssd1963/800alt/initlcd.h" #endif /*#ifndef DISABLE_S6D1121 #include "tft_drivers/s6d1121/initlcd.h" #endif #ifndef DISABLE_ILI9481 #include "tft_drivers/ili9481/initlcd.h" #endif #ifndef DISABLE_S6D0164 #include "tft_drivers/s6d0164/initlcd.h" #endif #ifndef DISABLE_ST7735S #include "tft_drivers/st7735s/initlcd.h" #endif*/ #ifndef DISABLE_ILI9341_S4P #include "tft_drivers/ili9341/s4p/initlcd.h" #endif #ifndef DISABLE_ILI9341_S5P #include "tft_drivers/ili9341/s5p/initlcd.h" #endif /*#ifndef DISABLE_R61581 #include "tft_drivers/r61581/initlcd.h" #endif #ifndef DISABLE_ILI9486 #include "tft_drivers/ili9486/initlcd.h" #endif #ifndef DISABLE_CPLD #include "tft_drivers/cpld/initlcd.h" #endif #ifndef DISABLE_HX8353C #include "tft_drivers/hx8353c/initlcd.h" #endif*/ #ifndef DISABLE_ILI9341_8 #include "tft_drivers/ili9341/8B/initlcd.h" #endif #ifndef DISABLE_ILI9341_16 #include "tft_drivers/ili9341/16B/initlcd.h" #endif #ifndef DISABLE_ILI9488_16 #include "tft_drivers/ili9488/16B/initlcd.h" #endif #ifndef DISABLE_ILI9342_16 #include "tft_drivers/ili9342/16B/initlcd.h" #endif #ifndef DISABLE_ILI9342_S4P #include "tft_drivers/ili9342/s4p/initlcd.h" #endif #ifndef DISABLE_ILI9342_S5P #include "tft_drivers/ili9342/s5p/initlcd.h" #endif #ifndef DISABLE_ILI9163_S5P #include "tft_drivers/ili9163/s5p/initlcd.h" #endif } sbi (P_CS, B_CS); setColor(255, 255, 255); setBackColor(0, 0, 0); cfont.font=0; _transparent = false; } void UTFT::setXY(word x1, word y1, word x2, word y2) { if (orient==LANDSCAPE) { swap(word, x1, y1); swap(word, x2, y2) y1=disp_y_size-y1; y2=disp_y_size-y2; swap(word, y1, y2) } switch(display_model) { /*#ifndef DISABLE_HX8347A #include "tft_drivers/hx8347a/setxy.h" #endif #ifndef DISABLE_HX8352A #include "tft_drivers/hx8352a/setxy.h" #endif #ifndef DISABLE_ILI9327 #include "tft_drivers/ili9327/setxy.h" #endif #ifndef DISABLE_SSD1289 #include "tft_drivers/ssd1289/setxy.h" #endif #ifndef DISABLE_ILI9325C #include "tft_drivers/ili9325c/setxy.h" #endif #ifndef DISABLE_ILI9325D #include "tft_drivers/ili9325d/default/setxy.h" #endif #ifndef DISABLE_ILI9325D_ALT #include "tft_drivers/ili9325d/alt/setxy.h" #endif #ifndef DISABLE_HX8340B_8 #include "tft_drivers/hx8340b/8/setxy.h" #endif #ifndef DISABLE_HX8340B_S #include "tft_drivers/hx8340b/s/setxy.h" #endif #ifndef DISABLE_ST7735 #include "tft_drivers/st7735/std/setxy.h" #endif #ifndef DISABLE_ST7735_ALT #include "tft_drivers/st7735/alt/setxy.h" #endif #ifndef DISABLE_S1D19122 #include "tft_drivers/s1d19122/setxy.h" #endif*/ #ifndef DISABLE_PCF8833 #include "tft_drivers/pcf8833/setxy.h" #endif #ifndef DISABLE_SSD1963_480 #include "tft_drivers/ssd1963/480/setxy.h" #endif #ifndef DISABLE_SSD1963_800 #include "tft_drivers/ssd1963/800/setxy.h" #endif #ifndef DISABLE_SSD1963_800_ALT #include "tft_drivers/ssd1963/800alt/setxy.h" #endif #ifndef DISABLE_S6D1121 #include "tft_drivers/s6d1121/setxy.h" #endif #ifndef DISABLE_ILI9481 #include "tft_drivers/ili9481/setxy.h" #endif #ifndef DISABLE_S6D0164 #include "tft_drivers/s6d0164/setxy.h" #endif #ifndef DISABLE_ST7735S #include "tft_drivers/st7735s/setxy.h" #endif #ifndef DISABLE_ILI9341_S4P #include "tft_drivers/ili9341/s4p/setxy.h" #endif #ifndef DISABLE_ILI9341_S5P #include "tft_drivers/ili9341/s5p/setxy.h" #endif #ifndef DISABLE_R61581 #include "tft_drivers/r61581/setxy.h" #endif #ifndef DISABLE_ILI9486 #include "tft_drivers/ili9486/setxy.h" #endif #ifndef DISABLE_CPLD #include "tft_drivers/cpld/setxy.h" #endif #ifndef DISABLE_HX8353C #include "tft_drivers/hx8353c/setxy.h" #endif #ifndef DISABLE_ILI9341_8 #include "tft_drivers/ili9341/8B/setxy.h" #endif #ifndef DISABLE_ILI9341_16 #include "tft_drivers/ili9341/16B/setxy.h" #endif #ifndef DISABLE_ILI9488_16 #include "tft_drivers/ili9488/16B/setxy.h" #endif #ifndef DISABLE_ILI9342_16 #include "tft_drivers/ili9342/16B/setxy.h" #endif #ifndef DISABLE_ILI9342_S4P #include "tft_drivers/ili9342/s4p/setxy.h" #endif #ifndef DISABLE_ILI9342_S5P #include "tft_drivers/ili9342/s5p/setxy.h" #endif #ifndef DISABLE_ILI9163_S5P #include "tft_drivers/ili9163/s5p/setxy.h" #endif } } void UTFT::clrXY() { if (orient==PORTRAIT) setXY(0,0,disp_x_size,disp_y_size); else setXY(0,0,disp_y_size,disp_x_size); } void UTFT::drawRect(int x1, int y1, int x2, int y2) { if (x1>x2) { swap(int, x1, x2); } if (y1>y2) { swap(int, y1, y2); } drawHLine(x1, y1, x2-x1); drawHLine(x1, y2, x2-x1); drawVLine(x1, y1, y2-y1); drawVLine(x2, y1, y2-y1); } void UTFT::drawRoundRect(int x1, int y1, int x2, int y2) { if (x1>x2) { swap(int, x1, x2); } if (y1>y2) { swap(int, y1, y2); } if ((x2-x1)>4 && (y2-y1)>4) { drawPixel(x1+1,y1+1); drawPixel(x2-1,y1+1); drawPixel(x1+1,y2-1); drawPixel(x2-1,y2-1); drawHLine(x1+2, y1, x2-x1-4); drawHLine(x1+2, y2, x2-x1-4); drawVLine(x1, y1+2, y2-y1-4); drawVLine(x2, y1+2, y2-y1-4); } } void UTFT::fillRect(int x1, int y1, int x2, int y2) { if (x1>x2) { swap(int, x1, x2); } if (y1>y2) { swap(int, y1, y2); } if (display_transfer_mode==16) { cbi(P_CS, B_CS); setXY(x1, y1, x2, y2); sbi(P_RS, B_RS); _fast_fill_16(fch,fcl,((long(x2-x1)+1)*(long(y2-y1)+1))); sbi(P_CS, B_CS); } else if ((display_transfer_mode==8) and (fch==fcl)) { cbi(P_CS, B_CS); setXY(x1, y1, x2, y2); sbi(P_RS, B_RS); _fast_fill_8(fch,((long(x2-x1)+1)*(long(y2-y1)+1))); sbi(P_CS, B_CS); } else { if (orient==PORTRAIT) { for (int i=0; i<((y2-y1)/2)+1; i++) { drawHLine(x1, y1+i, x2-x1); drawHLine(x1, y2-i, x2-x1); } } else { for (int i=0; i<((x2-x1)/2)+1; i++) { drawVLine(x1+i, y1, y2-y1); drawVLine(x2-i, y1, y2-y1); } } } } void UTFT::fillRoundRect(int x1, int y1, int x2, int y2) { if (x1>x2) { swap(int, x1, x2); } if (y1>y2) { swap(int, y1, y2); } if ((x2-x1)>4 && (y2-y1)>4) { for (int i=0; i<((y2-y1)/2)+1; i++) { switch(i) { case 0: drawHLine(x1+2, y1+i, x2-x1-4); drawHLine(x1+2, y2-i, x2-x1-4); break; case 1: drawHLine(x1+1, y1+i, x2-x1-2); drawHLine(x1+1, y2-i, x2-x1-2); break; default: drawHLine(x1, y1+i, x2-x1); drawHLine(x1, y2-i, x2-x1); } } } } void UTFT::drawCircle(int x, int y, int radius) { int f = 1 - radius; int ddF_x = 1; int ddF_y = -2 * radius; int x1 = 0; int y1 = radius; cbi(P_CS, B_CS); setXY(x, y + radius, x, y + radius); LCD_Write_DATA(fch,fcl); setXY(x, y - radius, x, y - radius); LCD_Write_DATA(fch,fcl); setXY(x + radius, y, x + radius, y); LCD_Write_DATA(fch,fcl); setXY(x - radius, y, x - radius, y); LCD_Write_DATA(fch,fcl); while(x1 < y1) { if(f >= 0) { y1--; ddF_y += 2; f += ddF_y; } x1++; ddF_x += 2; f += ddF_x; setXY(x + x1, y + y1, x + x1, y + y1); LCD_Write_DATA(fch,fcl); setXY(x - x1, y + y1, x - x1, y + y1); LCD_Write_DATA(fch,fcl); setXY(x + x1, y - y1, x + x1, y - y1); LCD_Write_DATA(fch,fcl); setXY(x - x1, y - y1, x - x1, y - y1); LCD_Write_DATA(fch,fcl); setXY(x + y1, y + x1, x + y1, y + x1); LCD_Write_DATA(fch,fcl); setXY(x - y1, y + x1, x - y1, y + x1); LCD_Write_DATA(fch,fcl); setXY(x + y1, y - x1, x + y1, y - x1); LCD_Write_DATA(fch,fcl); setXY(x - y1, y - x1, x - y1, y - x1); LCD_Write_DATA(fch,fcl); } sbi(P_CS, B_CS); clrXY(); } void UTFT::fillCircle(int x, int y, int radius) { for(int y1=-radius; y1<=0; y1++) for(int x1=-radius; x1<=0; x1++) if(x1*x1+y1*y1 <= radius*radius) { drawHLine(x+x1, y+y1, 2*(-x1)); drawHLine(x+x1, y-y1, 2*(-x1)); break; } } void UTFT::clrScr() { long i; cbi(P_CS, B_CS); clrXY(); if (display_transfer_mode!=1) sbi(P_RS, B_RS); if (display_transfer_mode==16) _fast_fill_16(0,0,((disp_x_size+1)*(disp_y_size+1))); else if (display_transfer_mode==8) _fast_fill_8(0,((disp_x_size+1)*(disp_y_size+1))); else { for (i=0; i<((disp_x_size+1)*(disp_y_size+1)); i++) { if (display_transfer_mode!=1) LCD_Writ_Bus(0,0,display_transfer_mode); else { LCD_Writ_Bus(1,0,display_transfer_mode); LCD_Writ_Bus(1,0,display_transfer_mode); } } } sbi(P_CS, B_CS); } void UTFT::fillScr(byte r, byte g, byte b) { word color = ((r&248)<<8 | (g&252)<<3 | (b&248)>>3); fillScr(color); } void UTFT::fillScr(word color) { long i; char ch, cl; ch=byte(color>>8); cl=byte(color & 0xFF); cbi(P_CS, B_CS); clrXY(); if (display_transfer_mode!=1) sbi(P_RS, B_RS); if (display_transfer_mode==16) _fast_fill_16(ch,cl,((disp_x_size+1)*(disp_y_size+1))); else if ((display_transfer_mode==8) and (ch==cl)) _fast_fill_8(ch,((disp_x_size+1)*(disp_y_size+1))); else { for (i=0; i<((disp_x_size+1)*(disp_y_size+1)); i++) { if (display_transfer_mode!=1) { if(display_transfer_mode==16) { LCD_Writ_Bus(ch,cl,display_transfer_mode); } else { LCD_Writ_Bus(0x00,ch,display_transfer_mode); LCD_Writ_Bus(0x00,cl,display_transfer_mode); } } else { LCD_Writ_Bus(1,ch,display_transfer_mode); LCD_Writ_Bus(1,cl,display_transfer_mode); } } } sbi(P_CS, B_CS); } void UTFT::setColor(byte r, byte g, byte b) { fch=((r&248)|g>>5); fcl=((g&28)<<3|b>>3); // fch=((r&0x1f<<3)|(g&0x3f>>3)); // fcl=((g&0x3f)<<5|(b&0x1f)); } void UTFT::setColor(word color) { fch=byte(color>>8); fcl=byte(color & 0xFF); } word UTFT::getColor() { return (fch<<8) | fcl; } void UTFT::setBackColor(byte r, byte g, byte b) { bch=((r&248)|g>>5); bcl=((g&28)<<3|b>>3); _transparent=false; } void UTFT::setBackColor(uint32_t color) { if (color==VGA_TRANSPARENT) _transparent=true; else { bch=byte(color>>8); bcl=byte(color & 0xFF); _transparent=false; } } word UTFT::getBackColor() { return (bch<<8) | bcl; } void UTFT::setPixel(word color) { LCD_Write_DATA((color>>8),(color&0xFF)); // rrrrrggggggbbbbb } void UTFT::drawPixel(int x, int y) { cbi(P_CS, B_CS); setXY(x, y, x, y); setPixel((fch<<8)|fcl); sbi(P_CS, B_CS); clrXY(); } void UTFT::drawLine(int x1, int y1, int x2, int y2) { if (y1==y2) drawHLine(x1, y1, x2-x1); else if (x1==x2) drawVLine(x1, y1, y2-y1); else { unsigned int dx = (x2 > x1 ? x2 - x1 : x1 - x2); short xstep = x2 > x1 ? 1 : -1; unsigned int dy = (y2 > y1 ? y2 - y1 : y1 - y2); short ystep = y2 > y1 ? 1 : -1; int col = x1, row = y1; cbi(P_CS, B_CS); if (dx < dy) { int t = - (dy >> 1); while (true) { setXY (col, row, col, row); LCD_Write_DATA (fch, fcl); if (row == y2) return; row += ystep; t += dx; if (t >= 0) { col += xstep; t -= dy; } } } else { int t = - (dx >> 1); while (true) { setXY (col, row, col, row); LCD_Write_DATA (fch, fcl); if (col == x2) return; col += xstep; t += dy; if (t >= 0) { row += ystep; t -= dx; } } } sbi(P_CS, B_CS); } clrXY(); } void UTFT::drawHLine(int x, int y, int l) { if (l<0) { l = -l; x -= l; } cbi(P_CS, B_CS); setXY(x, y, x+l, y); if (display_transfer_mode == 16) { sbi(P_RS, B_RS); _fast_fill_16(fch,fcl,l); } else if ((display_transfer_mode==8) and (fch==fcl)) { sbi(P_RS, B_RS); _fast_fill_8(fch,l); } else { for (int i=0; i<l+1; i++) { LCD_Write_DATA(fch, fcl); } } sbi(P_CS, B_CS); clrXY(); } void UTFT::drawVLine(int x, int y, int l) { if (l<0) { l = -l; y -= l; } cbi(P_CS, B_CS); setXY(x, y, x, y+l); if (display_transfer_mode == 16) { sbi(P_RS, B_RS); _fast_fill_16(fch,fcl,l); } else if ((display_transfer_mode==8) and (fch==fcl)) { sbi(P_RS, B_RS); _fast_fill_8(fch,l); } else { for (int i=0; i<l+1; i++) { LCD_Write_DATA(fch, fcl); } } sbi(P_CS, B_CS); clrXY(); } void UTFT::printChar(byte c, int x, int y) { byte i,ch; word j; word temp; cbi(P_CS, B_CS); if (!_transparent) { if (orient==PORTRAIT) { setXY(x,y,x+cfont.x_size-1,y+cfont.y_size-1); temp=((c-cfont.offset)*((cfont.x_size/8)*cfont.y_size))+4; for(j=0;j<((cfont.x_size/8)*cfont.y_size);j++) { ch=pgm_read_byte(&cfont.font[temp]); for(i=0;i<8;i++) { if((ch&(1<<(7-i)))!=0) { setPixel((fch<<8)|fcl); } else { setPixel((bch<<8)|bcl); } } temp++; } } else { temp=((c-cfont.offset)*((cfont.x_size/8)*cfont.y_size))+4; for(j=0;j<((cfont.x_size/8)*cfont.y_size);j+=(cfont.x_size/8)) { setXY(x,y+(j/(cfont.x_size/8)),x+cfont.x_size-1,y+(j/(cfont.x_size/8))); for (int zz=(cfont.x_size/8)-1; zz>=0; zz--) { ch=pgm_read_byte(&cfont.font[temp+zz]); for(i=0;i<8;i++) { if((ch&(1<<i))!=0) { setPixel((fch<<8)|fcl); } else { setPixel((bch<<8)|bcl); } } } temp+=(cfont.x_size/8); } } } else { temp=((c-cfont.offset)*((cfont.x_size/8)*cfont.y_size))+4; for(j=0;j<cfont.y_size;j++) { for (int zz=0; zz<(cfont.x_size/8); zz++) { ch=pgm_read_byte(&cfont.font[temp+zz]); for(i=0;i<8;i++) { setXY(x+i+(zz*8),y+j,x+i+(zz*8)+1,y+j+1); if((ch&(1<<(7-i)))!=0) { setPixel((fch<<8)|fcl); } } } temp+=(cfont.x_size/8); } } sbi(P_CS, B_CS); clrXY(); } void UTFT::rotateChar(byte c, int x, int y, int pos, int deg) { byte i,j,ch; word temp; int newx,newy; double radian; radian=deg*0.0175; cbi(P_CS, B_CS); temp=((c-cfont.offset)*((cfont.x_size/8)*cfont.y_size))+4; for(j=0;j<cfont.y_size;j++) { for (int zz=0; zz<(cfont.x_size/8); zz++) { ch=pgm_read_byte(&cfont.font[temp+zz]); for(i=0;i<8;i++) { newx=x+(((i+(zz*8)+(pos*cfont.x_size))*cos(radian))-((j)*sin(radian))); newy=y+(((j)*cos(radian))+((i+(zz*8)+(pos*cfont.x_size))*sin(radian))); setXY(newx,newy,newx+1,newy+1); if((ch&(1<<(7-i)))!=0) { setPixel((fch<<8)|fcl); } else { if (!_transparent) setPixel((bch<<8)|bcl); } } } temp+=(cfont.x_size/8); } sbi(P_CS, B_CS); clrXY(); } void UTFT::print(char *st, int x, int y, int deg) { int stl, i; stl = strlen(st); if (orient==PORTRAIT) { if (x==RIGHT) x=(disp_x_size+1)-(stl*cfont.x_size); if (x==CENTER) x=((disp_x_size+1)-(stl*cfont.x_size))/2; } else { if (x==RIGHT) x=(disp_y_size+1)-(stl*cfont.x_size); if (x==CENTER) x=((disp_y_size+1)-(stl*cfont.x_size))/2; } for (i=0; i<stl; i++) if (deg==0) printChar(*st++, x + (i*(cfont.x_size)), y); else rotateChar(*st++, x, y, i, deg); } void UTFT::print(String st, int x, int y, int deg) { char buf[st.length()+1]; st.toCharArray(buf, st.length()+1); print(buf, x, y, deg); } void UTFT::printNumI(long num, int x, int y, int length, char filler) { char buf[25]; char st[27]; boolean neg=false; int c=0, f=0; if (num==0) { if (length!=0) { for (c=0; c<(length-1); c++) st[c]=filler; st[c]=48; st[c+1]=0; } else { st[0]=48; st[1]=0; } } else { if (num<0) { neg=true; num=-num; } while (num>0) { buf[c]=48+(num % 10); c++; num=(num-(num % 10))/10; } buf[c]=0; if (neg) { st[0]=45; } if (length>(c+neg)) { for (int i=0; i<(length-c-neg); i++) { st[i+neg]=filler; f++; } } for (int i=0; i<c; i++) { st[i+neg+f]=buf[c-i-1]; } st[c+neg+f]=0; } print(st,x,y); } void UTFT::printNumF(double num, byte dec, int x, int y, char divider, int length, char filler) { char st[27]; boolean neg=false; if (dec<1) dec=1; else if (dec>5) dec=5; if (num<0) neg = true; _convert_float(st, num, length, dec); if (divider != '.') { for (int i=0; i<sizeof(st); i++) if (st[i]=='.') st[i]=divider; } if (filler != ' ') { if (neg) { st[0]='-'; for (int i=1; i<sizeof(st); i++) if ((st[i]==' ') || (st[i]=='-')) st[i]=filler; } else { for (int i=0; i<sizeof(st); i++) if (st[i]==' ') st[i]=filler; } } print(st,x,y); } void UTFT::setFont(uint8_t* font) { cfont.font=font; cfont.x_size=font[0];//fontbyte(0); cfont.y_size=font[1];//fontbyte(1); cfont.offset=font[2];//fontbyte(2); cfont.numchars=font[3];//fontbyte(3); } uint8_t* UTFT::getFont() { return cfont.font; } uint8_t UTFT::getFontXsize() { return cfont.x_size; } uint8_t UTFT::getFontYsize() { return cfont.y_size; } /*void UTFT::drawBitmap(int x, int y, int sx, int sy, bitmapdatatype data, int scale) { unsigned int col; int tx, ty, tc, tsx, tsy; if (scale==1) { if (orient==PORTRAIT) { cbi(P_CS, B_CS); setXY(x, y, x+sx-1, y+sy-1); for (tc=0; tc<(sx*sy); tc++) { col=pgm_read_word(&data[tc]); LCD_Write_DATA(col>>8,col & 0xff); } sbi(P_CS, B_CS); } else { cbi(P_CS, B_CS); for (ty=0; ty<sy; ty++) { setXY(x, y+ty, x+sx-1, y+ty); for (tx=sx-1; tx>=0; tx--) { col=pgm_read_word(&data[(ty*sx)+tx]); LCD_Write_DATA(col>>8,col & 0xff); } } sbi(P_CS, B_CS); } } else { if (orient==PORTRAIT) { cbi(P_CS, B_CS); for (ty=0; ty<sy; ty++) { setXY(x, y+(ty*scale), x+((sx*scale)-1), y+(ty*scale)+scale); for (tsy=0; tsy<scale; tsy++) for (tx=0; tx<sx; tx++) { col=pgm_read_word(&data[(ty*sx)+tx]); for (tsx=0; tsx<scale; tsx++) LCD_Write_DATA(col>>8,col & 0xff); } } sbi(P_CS, B_CS); } else { cbi(P_CS, B_CS); for (ty=0; ty<sy; ty++) { for (tsy=0; tsy<scale; tsy++) { setXY(x, y+(ty*scale)+tsy, x+((sx*scale)-1), y+(ty*scale)+tsy); for (tx=sx-1; tx>=0; tx--) { col=pgm_read_word(&data[(ty*sx)+tx]); for (tsx=0; tsx<scale; tsx++) LCD_Write_DATA(col>>8,col & 0xff); } } } sbi(P_CS, B_CS); } } clrXY(); } void UTFT::drawBitmap(int x, int y, int sx, int sy, bitmapdatatype data, int deg, int rox, int roy) { unsigned int col; int tx, ty, newx, newy; double radian; radian=deg*0.0175; if (deg==0) drawBitmap(x, y, sx, sy, data); else { cbi(P_CS, B_CS); for (ty=0; ty<sy; ty++) for (tx=0; tx<sx; tx++) { col=pgm_read_word(&data[(ty*sx)+tx]); newx=x+rox+(((tx-rox)*cos(radian))-((ty-roy)*sin(radian))); newy=y+roy+(((ty-roy)*cos(radian))+((tx-rox)*sin(radian))); setXY(newx, newy, newx, newy); LCD_Write_DATA(col>>8,col & 0xff); } sbi(P_CS, B_CS); } clrXY(); }*/ void UTFT::lcdOff() { cbi(P_CS, B_CS); switch (display_model) { case PCF8833: LCD_Write_COM(0x28); break; case CPLD: LCD_Write_COM_DATA(0x01,0x0000); LCD_Write_COM(0x0F); break; } sbi(P_CS, B_CS); } void UTFT::lcdOn() { cbi(P_CS, B_CS); switch (display_model) { case PCF8833: LCD_Write_COM(0x29); break; case CPLD: LCD_Write_COM_DATA(0x01,0x0010); LCD_Write_COM(0x0F); break; } sbi(P_CS, B_CS); } void UTFT::setContrast(char c) { cbi(P_CS, B_CS); switch (display_model) { case PCF8833: if (c>64) c=64; LCD_Write_COM(0x25); LCD_Write_DATA(c); break; } sbi(P_CS, B_CS); } int UTFT::getDisplayXSize() { if (orient==PORTRAIT) return disp_x_size+1; else return disp_y_size+1; } int UTFT::getDisplayYSize() { if (orient==PORTRAIT) return disp_y_size+1; else return disp_x_size+1; } void UTFT::setBrightness(byte br) { cbi(P_CS, B_CS); switch (display_model) { case CPLD: if (br>16) br=16; LCD_Write_COM_DATA(0x01,br); LCD_Write_COM(0x0F); break; } sbi(P_CS, B_CS); } void UTFT::setDisplayPage(byte page) { cbi(P_CS, B_CS); switch (display_model) { case CPLD: if (page>7) page=7; LCD_Write_COM_DATA(0x04,page); LCD_Write_COM(0x0F); break; } sbi(P_CS, B_CS); } void UTFT::setWritePage(byte page) { cbi(P_CS, B_CS); switch (display_model) { case CPLD: if (page>7) page=7; LCD_Write_COM_DATA(0x05,page); LCD_Write_COM(0x0F); break; } sbi(P_CS, B_CS); }

simon.yzf@t-online.de

23954c1c24f15ada36612a853322eb931c591ae0

8174a4304d797cc68210ab115659ba20d7090e76

/aws-cpp-sdk-ecs/source/model/CreateTaskSetRequest.cpp

6a75da2f534eb91bb235046d3992c0b9c784a963

permissive

Lectem/aws-sdk-cpp

0f167407ec05d59486b080f998c611891dce943e

24deb4bc44d05c890712f8cd2e5b24eb379f3ecd

refs/heads/master

Apache-2.0

UTF-8

C++

cpp

/* * Copyright 2010-2017 Amazon.com, Inc. or its affiliates. All Rights Reserved. * * Licensed under the Apache License, Version 2.0 (the "License"). * You may not use this file except in compliance with the License. * A copy of the License is located at * * http://aws.amazon.com/apache2.0 * * or in the "license" file accompanying this file. This file is distributed * on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either * express or implied. See the License for the specific language governing * permissions and limitations under the License. */ #include <aws/ecs/model/CreateTaskSetRequest.h> #include <aws/core/utils/json/JsonSerializer.h> #include <utility> using namespace Aws::ECS::Model; using namespace Aws::Utils::Json; using namespace Aws::Utils; CreateTaskSetRequest::CreateTaskSetRequest() : m_serviceHasBeenSet(false), m_clusterHasBeenSet(false), m_externalIdHasBeenSet(false), m_taskDefinitionHasBeenSet(false), m_networkConfigurationHasBeenSet(false), m_loadBalancersHasBeenSet(false), m_serviceRegistriesHasBeenSet(false), m_launchType(LaunchType::NOT_SET), m_launchTypeHasBeenSet(false), m_capacityProviderStrategyHasBeenSet(false), m_platformVersionHasBeenSet(false), m_scaleHasBeenSet(false), m_clientTokenHasBeenSet(false) { } Aws::String CreateTaskSetRequest::SerializePayload() const { JsonValue payload; if(m_serviceHasBeenSet) { payload.WithString("service", m_service); } if(m_clusterHasBeenSet) { payload.WithString("cluster", m_cluster); } if(m_externalIdHasBeenSet) { payload.WithString("externalId", m_externalId); } if(m_taskDefinitionHasBeenSet) { payload.WithString("taskDefinition", m_taskDefinition); } if(m_networkConfigurationHasBeenSet) { payload.WithObject("networkConfiguration", m_networkConfiguration.Jsonize()); } if(m_loadBalancersHasBeenSet) { Array<JsonValue> loadBalancersJsonList(m_loadBalancers.size()); for(unsigned loadBalancersIndex = 0; loadBalancersIndex < loadBalancersJsonList.GetLength(); ++loadBalancersIndex) { loadBalancersJsonList[loadBalancersIndex].AsObject(m_loadBalancers[loadBalancersIndex].Jsonize()); } payload.WithArray("loadBalancers", std::move(loadBalancersJsonList)); } if(m_serviceRegistriesHasBeenSet) { Array<JsonValue> serviceRegistriesJsonList(m_serviceRegistries.size()); for(unsigned serviceRegistriesIndex = 0; serviceRegistriesIndex < serviceRegistriesJsonList.GetLength(); ++serviceRegistriesIndex) { serviceRegistriesJsonList[serviceRegistriesIndex].AsObject(m_serviceRegistries[serviceRegistriesIndex].Jsonize()); } payload.WithArray("serviceRegistries", std::move(serviceRegistriesJsonList)); } if(m_launchTypeHasBeenSet) { payload.WithString("launchType", LaunchTypeMapper::GetNameForLaunchType(m_launchType)); } if(m_capacityProviderStrategyHasBeenSet) { Array<JsonValue> capacityProviderStrategyJsonList(m_capacityProviderStrategy.size()); for(unsigned capacityProviderStrategyIndex = 0; capacityProviderStrategyIndex < capacityProviderStrategyJsonList.GetLength(); ++capacityProviderStrategyIndex) { capacityProviderStrategyJsonList[capacityProviderStrategyIndex].AsObject(m_capacityProviderStrategy[capacityProviderStrategyIndex].Jsonize()); } payload.WithArray("capacityProviderStrategy", std::move(capacityProviderStrategyJsonList)); } if(m_platformVersionHasBeenSet) { payload.WithString("platformVersion", m_platformVersion); } if(m_scaleHasBeenSet) { payload.WithObject("scale", m_scale.Jsonize()); } if(m_clientTokenHasBeenSet) { payload.WithString("clientToken", m_clientToken); } return payload.View().WriteReadable(); } Aws::Http::HeaderValueCollection CreateTaskSetRequest::GetRequestSpecificHeaders() const { Aws::Http::HeaderValueCollection headers; headers.insert(Aws::Http::HeaderValuePair("X-Amz-Target", "AmazonEC2ContainerServiceV20141113.CreateTaskSet")); return headers; }

aws-sdk-cpp-automation@github.com

ab3c863f848fddf30ded3dd8e6c2521774d1b90f

08b8cf38e1936e8cec27f84af0d3727321cec9c4

/data/crawl/git/new_hunk_3239.cpp

33bd9aecc10e9b66914bf7b8f635c4f6490ded0a

no_license

ccdxc/logSurvey

eaf28e9c2d6307140b17986d5c05106d1fd8e943

6b80226e1667c1e0760ab39160893ee19b0e9fb1

refs/heads/master

UTF-8

C++

cpp

if (!do_for_each_entry_in_dir(dir, 0, nonmatching_ref_fn, &data)) return 1; error("'%s' exists; cannot create '%s'", data.conflicting_refname, refname); return 0; }

993273596@qq.com

1232df632be499c32864483513f48d9acee57fca

26b8271160e90d84ba0931ecc4707e69cf24749e

/Math/Power Of Two Integers.cpp

a0ffff786389f89dc358b687522e4d9a0e6d6d7f

no_license

ThePoliteWolf/InteviewBit-Slolution

4eddf7a934c12bf4ef1499d6dc8fe21e5c74c3ae

d963f08cb33f3702fdf3c8cef62987416099a6c8

refs/heads/master

UTF-8

C++

cpp

/* Given a positive integer which fits in a 32 bit signed integer, find if it can be expressed as A^P where P > 1 and A > 0. A and P both should be integers. Example Input : 4 Output : True as 2^2 = 4. */ int Solution::isPower(int n) { if (n <= 1) return 1; int x; for ( x=2; x<=sqrt(n); x++) { double p = x; while (p <= n) { p *= x; if (p == n) return 1; } } return 0; }

noreply@github.com

a43f9f1dfb76961c6f5f3af11fd259bfd4d34983

fc987ace8516d4d5dfcb5444ed7cb905008c6147

/third_party/WebKit/Source/wtf/HashTraits.h

68a18dd753fc4f94dcb94c71587b54a8c6724d89

permissive

nfschina/nfs-browser

3c366cedbdbe995739717d9f61e451bcf7b565ce

b6670ba13beb8ab57003f3ba2c755dc368de3967

refs/heads/master

BSD-3-Clause

UTF-8

C++

h

/* * Copyright (C) 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All rights * reserved. * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Library General Public * License as published by the Free Software Foundation; either * version 2 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Library General Public License for more details. * * You should have received a copy of the GNU Library General Public License * along with this library; see the file COPYING.LIB. If not, write to * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, * Boston, MA 02110-1301, USA. * */ #ifndef WTF_HashTraits_h #define WTF_HashTraits_h #include "wtf/Forward.h" #include "wtf/HashFunctions.h" #include "wtf/HashTableDeletedValueType.h" #include "wtf/StdLibExtras.h" #include "wtf/TypeTraits.h" #include <limits> #include <memory> #include <string.h> // For memset. #include <type_traits> #include <utility> namespace WTF { template <bool isInteger, typename T> struct GenericHashTraitsBase; template <typename T> struct HashTraits; enum ShouldWeakPointersBeMarkedStrongly { WeakPointersActStrong, WeakPointersActWeak }; template <typename T> struct GenericHashTraitsBase<false, T> { // The emptyValueIsZero flag is used to optimize allocation of empty hash // tables with zeroed memory. static const bool emptyValueIsZero = false; // The hasIsEmptyValueFunction flag allows the hash table to automatically // generate code to check for the empty value when it can be done with the // equality operator, but allows custom functions for cases like String that // need them. static const bool hasIsEmptyValueFunction = false; // The starting table size. Can be overridden when we know beforehand that a // hash table will have at least N entries. #if defined(MEMORY_SANITIZER_INITIAL_SIZE) static const unsigned minimumTableSize = 1; #else static const unsigned minimumTableSize = 8; #endif // When a hash table backing store is traced, its elements will be // traced if their class type has a trace method. However, weak-referenced // elements should not be traced then, but handled by the weak processing // phase that follows. template <typename U = void> struct IsTraceableInCollection { static const bool value = IsTraceable<T>::value && !IsWeak<T>::value; }; // The NeedsToForbidGCOnMove flag is used to make the hash table move // operations safe when GC is enabled: if a move constructor invokes // an allocation triggering the GC then it should be invoked within GC // forbidden scope. template <typename U = void> struct NeedsToForbidGCOnMove { // TODO(yutak): Consider using of std:::is_trivially_move_constructible // when it is accessible. static const bool value = !std::is_pod<T>::value; }; static const WeakHandlingFlag weakHandlingFlag = IsWeak<T>::value ? WeakHandlingInCollections : NoWeakHandlingInCollections; }; // Default integer traits disallow both 0 and -1 as keys (max value instead of // -1 for unsigned). template <typename T> struct GenericHashTraitsBase<true, T> : GenericHashTraitsBase<false, T> { static const bool emptyValueIsZero = true; static void constructDeletedValue(T& slot, bool) { slot = static_cast<T>(-1); } static bool isDeletedValue(T value) { return value == static_cast<T>(-1); } }; template <typename T> struct GenericHashTraits : GenericHashTraitsBase<std::is_integral<T>::value, T> { typedef T TraitType; typedef T EmptyValueType; static T emptyValue() { return T(); } // Type for functions that do not take ownership, such as contains. typedef const T& PeekInType; typedef T* IteratorGetType; typedef const T* IteratorConstGetType; typedef T& IteratorReferenceType; typedef const T& IteratorConstReferenceType; static IteratorReferenceType getToReferenceConversion(IteratorGetType x) { return *x; } static IteratorConstReferenceType getToReferenceConstConversion( IteratorConstGetType x) { return *x; } template <typename IncomingValueType> static void store(IncomingValueType&& value, T& storage) { storage = std::forward<IncomingValueType>(value); } // Type for return value of functions that do not transfer ownership, such // as get. // FIXME: We could change this type to const T& for better performance if we // figured out a way to handle the return value from emptyValue, which is a // temporary. typedef T PeekOutType; static const T& peek(const T& value) { return value; } }; template <typename T> struct HashTraits : GenericHashTraits<T> {}; template <typename T> struct FloatHashTraits : GenericHashTraits<T> { static T emptyValue() { return std::numeric_limits<T>::infinity(); } static void constructDeletedValue(T& slot, bool) { slot = -std::numeric_limits<T>::infinity(); } static bool isDeletedValue(T value) { return value == -std::numeric_limits<T>::infinity(); } }; template <> struct HashTraits<float> : FloatHashTraits<float> {}; template <> struct HashTraits<double> : FloatHashTraits<double> {}; // Default unsigned traits disallow both 0 and max as keys -- use these traits // to allow zero and disallow max - 1. template <typename T> struct UnsignedWithZeroKeyHashTraits : GenericHashTraits<T> { static const bool emptyValueIsZero = false; static T emptyValue() { return std::numeric_limits<T>::max(); } static void constructDeletedValue(T& slot, bool) { slot = std::numeric_limits<T>::max() - 1; } static bool isDeletedValue(T value) { return value == std::numeric_limits<T>::max() - 1; } }; template <typename P> struct HashTraits<P*> : GenericHashTraits<P*> { static const bool emptyValueIsZero = true; static void constructDeletedValue(P*& slot, bool) { slot = reinterpret_cast<P*>(-1); } static bool isDeletedValue(P* value) { return value == reinterpret_cast<P*>(-1); } }; template <typename T> struct SimpleClassHashTraits : GenericHashTraits<T> { static const bool emptyValueIsZero = true; template <typename U = void> struct NeedsToForbidGCOnMove { static const bool value = false; }; static void constructDeletedValue(T& slot, bool) { new (NotNull, &slot) T(HashTableDeletedValue); } static bool isDeletedValue(const T& value) { return value.isHashTableDeletedValue(); } }; template <typename P> struct HashTraits<RefPtr<P>> : SimpleClassHashTraits<RefPtr<P>> { typedef std::nullptr_t EmptyValueType; static EmptyValueType emptyValue() { return nullptr; } static const bool hasIsEmptyValueFunction = true; static bool isEmptyValue(const RefPtr<P>& value) { return !value; } typedef RefPtrValuePeeker<P> PeekInType; typedef RefPtr<P>* IteratorGetType; typedef const RefPtr<P>* IteratorConstGetType; typedef RefPtr<P>& IteratorReferenceType; typedef const RefPtr<P>& IteratorConstReferenceType; static IteratorReferenceType getToReferenceConversion(IteratorGetType x) { return *x; } static IteratorConstReferenceType getToReferenceConstConversion( IteratorConstGetType x) { return *x; } static void store(PassRefPtr<P> value, RefPtr<P>& storage) { storage = value; } typedef P* PeekOutType; static PeekOutType peek(const RefPtr<P>& value) { return value.get(); } static PeekOutType peek(std::nullptr_t) { return 0; } }; template <typename T> struct HashTraits<RawPtr<T>> : HashTraits<T*> {}; template <typename T> struct HashTraits<std::unique_ptr<T>> : SimpleClassHashTraits<std::unique_ptr<T>> { using EmptyValueType = std::nullptr_t; static EmptyValueType emptyValue() { return nullptr; } static const bool hasIsEmptyValueFunction = true; static bool isEmptyValue(const std::unique_ptr<T>& value) { return !value; } using PeekInType = T*; static void store(std::unique_ptr<T>&& value, std::unique_ptr<T>& storage) { storage = std::move(value); } using PeekOutType = T*; static PeekOutType peek(const std::unique_ptr<T>& value) { return value.get(); } static PeekOutType peek(std::nullptr_t) { return nullptr; } static void constructDeletedValue(std::unique_ptr<T>& slot, bool) { // Dirty trick: implant an invalid pointer to unique_ptr. Destructor isn't // called for deleted buckets, so this is okay. new (NotNull, &slot) std::unique_ptr<T>(reinterpret_cast<T*>(1u)); } static bool isDeletedValue(const std::unique_ptr<T>& value) { return value.get() == reinterpret_cast<T*>(1u); } }; template <> struct HashTraits<String> : SimpleClassHashTraits<String> { static const bool hasIsEmptyValueFunction = true; static bool isEmptyValue(const String&); }; // This struct template is an implementation detail of the // isHashTraitsEmptyValue function, which selects either the emptyValue function // or the isEmptyValue function to check for empty values. template <typename Traits, bool hasEmptyValueFunction> struct HashTraitsEmptyValueChecker; template <typename Traits> struct HashTraitsEmptyValueChecker<Traits, true> { template <typename T> static bool isEmptyValue(const T& value) { return Traits::isEmptyValue(value); } }; template <typename Traits> struct HashTraitsEmptyValueChecker<Traits, false> { template <typename T> static bool isEmptyValue(const T& value) { return value == Traits::emptyValue(); } }; template <typename Traits, typename T> inline bool isHashTraitsEmptyValue(const T& value) { return HashTraitsEmptyValueChecker< Traits, Traits::hasIsEmptyValueFunction>::isEmptyValue(value); } template <typename FirstTraitsArg, typename SecondTraitsArg> struct PairHashTraits : GenericHashTraits<std::pair<typename FirstTraitsArg::TraitType, typename SecondTraitsArg::TraitType>> { typedef FirstTraitsArg FirstTraits; typedef SecondTraitsArg SecondTraits; typedef std::pair<typename FirstTraits::TraitType, typename SecondTraits::TraitType> TraitType; typedef std::pair<typename FirstTraits::EmptyValueType, typename SecondTraits::EmptyValueType> EmptyValueType; static const bool emptyValueIsZero = FirstTraits::emptyValueIsZero && SecondTraits::emptyValueIsZero; static EmptyValueType emptyValue() { return std::make_pair(FirstTraits::emptyValue(), SecondTraits::emptyValue()); } static const bool hasIsEmptyValueFunction = FirstTraits::hasIsEmptyValueFunction || SecondTraits::hasIsEmptyValueFunction; static bool isEmptyValue(const TraitType& value) { return isHashTraitsEmptyValue<FirstTraits>(value.first) && isHashTraitsEmptyValue<SecondTraits>(value.second); } static const unsigned minimumTableSize = FirstTraits::minimumTableSize; static void constructDeletedValue(TraitType& slot, bool zeroValue) { FirstTraits::constructDeletedValue(slot.first, zeroValue); // For GC collections the memory for the backing is zeroed when it is // allocated, and the constructors may take advantage of that, // especially if a GC occurs during insertion of an entry into the // table. This slot is being marked deleted, but If the slot is reused // at a later point, the same assumptions around memory zeroing must // hold as they did at the initial allocation. Therefore we zero the // value part of the slot here for GC collections. if (zeroValue) memset(reinterpret_cast<void*>(&slot.second), 0, sizeof(slot.second)); } static bool isDeletedValue(const TraitType& value) { return FirstTraits::isDeletedValue(value.first); } }; template <typename First, typename Second> struct HashTraits<std::pair<First, Second>> : public PairHashTraits<HashTraits<First>, HashTraits<Second>> {}; template <typename KeyTypeArg, typename ValueTypeArg> struct KeyValuePair { typedef KeyTypeArg KeyType; template <typename IncomingKeyType, typename IncomingValueType> KeyValuePair(IncomingKeyType&& key, IncomingValueType&& value) : key(std::forward<IncomingKeyType>(key)), value(std::forward<IncomingValueType>(value)) {} template <typename OtherKeyType, typename OtherValueType> KeyValuePair(KeyValuePair<OtherKeyType, OtherValueType>&& other) : key(std::move(other.key)), value(std::move(other.value)) {} KeyTypeArg key; ValueTypeArg value; }; template <typename KeyTraitsArg, typename ValueTraitsArg> struct KeyValuePairHashTraits : GenericHashTraits<KeyValuePair<typename KeyTraitsArg::TraitType, typename ValueTraitsArg::TraitType>> { typedef KeyTraitsArg KeyTraits; typedef ValueTraitsArg ValueTraits; typedef KeyValuePair<typename KeyTraits::TraitType, typename ValueTraits::TraitType> TraitType; typedef KeyValuePair<typename KeyTraits::EmptyValueType, typename ValueTraits::EmptyValueType> EmptyValueType; static const bool emptyValueIsZero = KeyTraits::emptyValueIsZero && ValueTraits::emptyValueIsZero; static EmptyValueType emptyValue() { return KeyValuePair<typename KeyTraits::EmptyValueType, typename ValueTraits::EmptyValueType>( KeyTraits::emptyValue(), ValueTraits::emptyValue()); } template <typename U = void> struct IsTraceableInCollection { static const bool value = IsTraceableInCollectionTrait<KeyTraits>::value || IsTraceableInCollectionTrait<ValueTraits>::value; }; template <typename U = void> struct NeedsToForbidGCOnMove { static const bool value = KeyTraits::template NeedsToForbidGCOnMove<>::value || ValueTraits::template NeedsToForbidGCOnMove<>::value; }; static const WeakHandlingFlag weakHandlingFlag = (KeyTraits::weakHandlingFlag == WeakHandlingInCollections || ValueTraits::weakHandlingFlag == WeakHandlingInCollections) ? WeakHandlingInCollections : NoWeakHandlingInCollections; static const unsigned minimumTableSize = KeyTraits::minimumTableSize; static void constructDeletedValue(TraitType& slot, bool zeroValue) { KeyTraits::constructDeletedValue(slot.key, zeroValue); // See similar code in this file for why we need to do this. if (zeroValue) memset(reinterpret_cast<void*>(&slot.value), 0, sizeof(slot.value)); } static bool isDeletedValue(const TraitType& value) { return KeyTraits::isDeletedValue(value.key); } }; template <typename Key, typename Value> struct HashTraits<KeyValuePair<Key, Value>> : public KeyValuePairHashTraits<HashTraits<Key>, HashTraits<Value>> {}; template <typename T> struct NullableHashTraits : public HashTraits<T> { static const bool emptyValueIsZero = false; static T emptyValue() { return reinterpret_cast<T>(1); } }; // This is for tracing inside collections that have special support for weak // pointers. The trait has a trace method which returns true if there are weak // pointers to things that have not (yet) been marked live. Returning true // indicates that the entry in the collection may yet be removed by weak // handling. Default implementation for non-weak types is to use the regular // non-weak TraceTrait. Default implementation for types with weakness is to // call traceInCollection on the type's trait. template <WeakHandlingFlag weakHandlingFlag, ShouldWeakPointersBeMarkedStrongly strongify, typename T, typename Traits> struct TraceInCollectionTrait; } // namespace WTF using WTF::HashTraits; using WTF::PairHashTraits; using WTF::NullableHashTraits; using WTF::SimpleClassHashTraits; #endif // WTF_HashTraits_h

hukun@cpu-os.ac.cn

5eaa82ce63143cb09a2f39bc8e401555ddb86d15

6bbfdd55b3a686be682d31f9b3595ae7dee3afde

/lab10/ncat-base.cpp

8202d4ace11e7cd5e5fafd1c6434d293c654b6ae

permissive

NoizuHika/SOP

1c76805354d713c49f05561c348de61291cb4b35

2ecfde6fba607f161a8e03ae353e36ea39c847e5

refs/heads/main

UTF-8

C++

cpp

#include <sys/socket.h> #include <unistd.h> #include <string> #include <string.h> #include <netinet/ip.h> #include <arpa/inet.h> #include <endian.h> #include <iostream> #include <stdio.h> auto main (int argc, char* argv[]) -> int{ auto ip = argv[1]; auto port = static_cast<uint16_t>(std::stoi(argv[2])); sockaddr_in addr; memset(&addr,0 , sizeof(addr)); addr.sin_family = AF_INET; addr.sin_port = htobe16(port); inet_pton(addr.sin_family, ip, &addr.sin_addr); auto sock = socket(AF_INET,SOCK_STREAM,0); if(bind(sock, reinterpret_cast<sockaddr*> (&addr), sizeof(addr)) == -1){ perror("test"); shutdown(sock, SHUT_RDWR); close(sock); return 1; } listen(sock,0); { auto client = accept(sock, nullptr, nullptr); std::cout<< client << std::endl; char buffer[1024]; while(true){ memset(&buffer,0 , sizeof(buffer)); auto s = read(client, buffer, sizeof(buffer)); std::cout<<buffer<<"\n"; if(s <= 1){ break; } } shutdown(client, SHUT_RDWR); close(client); } shutdown(sock, SHUT_RDWR); close(sock); return 0; }

noreply@github.com

1b7c5570cb4d07358f7e055ee1c24acb65fc0c76

5dbefd69106e7573148e6f9926e4168e387c31c5

/SMB-172.2/Tetris/Source.cpp

d1d2e559449c3c7e954dd48f80bee7846a8e7b91

no_license

Dakosia/Cpp

0a74cbea2b4b5d22fc8c1bc768fbd52b6ee4f39c

85435da7f35b707c66b5c107f6a95f8f153d513c

refs/heads/master

UTF-8

C++

cpp

#include <iostream> #include <Windows.h> #include <conio.h> #include <stdlib.h> using namespace std; struct Point { short x, y; }; struct Figure { Point body[4]; byte size; int type; }; struct Ground { bool filled[10][10]; int groundHeight; int size; }; struct Wall { Point gates[20]; short size; }; void draw(Point & p, char sign) { COORD position = { p.x, p.y }; SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), position); cout << sign; } void drawEverything(Figure & f, Wall & w, Ground & g) { for (byte i = 0; i < f.size; ++i) { draw(f.body[i], '#'); } for (short i = 0; i < w.size; ++i) { draw(w.gates[i], '|'); } } void init(Figure & f, Wall & w, Ground & g) { f.body[0].x = 2; f.body[0].y = 1; f.body[1].x = 2; f.body[1].y = 2; f.body[2].x = 2; f.body[2].y = 3; f.body[3].x = 2; f.body[3].y = 4; f.size = 4; f.type = 1; g.body = new Point[20]; g.size = 0; w.size = 20; for (int i = 0; i < 10; ++i) { w.gates[i].x = 1; w.gates[i].y = i; w.gates[i + 10].x = 10; w.gates[i + 10].y = i; } } void move(Figure & f, int dx) { for (byte i = 0; i < f.size; ++i) { f.body[i].x += dx; ++f.body[i].y; } } void rotate(Figure & f) { switch (f.type) { case 1: f.body[0].x--; f.body[0].y++; f.body[2].x++; f.body[2].y--; f.body[3].x += 2; f.body[3].y -= 2; break; default: break; } } void landing() { } void game() { Figure figure; Wall wall; Ground ground; bool isActive = true; init(figure, wall, ground); while (isActive) { system("cls"); drawEverything(figure, wall, ground); int dx = 0; if (_kbhit()) { dx = 0; char action = _getch(); switch (action) { case 'a': dx = -1; break; case 'd': dx = 1; break; case 'w': rotate(figure); break; case 's': break; default: break; } } move(figure, dx); Sleep(1000); } delete[] ground.body; } int main() { game(); return 0; }

dana.kerey@gmail.com

0aa1d3951899cbb155a4af6b93fa57cdb8f6c65d

670af94f93e7c7ef680dcc63b770a9bb7bf5071b

/libs/misc/linearinterpolator.cpp

6d14cd573843e4f7e250add61f2e37aa5663c36d

no_license

Leon-Zhang/prepost-gui

ef2e570bed88bd3232253cfd99e89b3eadfc661f

bff4db57df6a282f6e76e3942dbb02d66fbb5d9e

refs/heads/master

UTF-8

C++

cpp

#include "linearinterpolator.h" LinearInterpolator1D1::LinearInterpolator1D1() : Interpolator1D1() { m_value0 = 0; m_value1 = 0; } LinearInterpolator1D1::LinearInterpolator1D1(double v0, double v1) : Interpolator1D1() { m_value0 = v0; m_value1 = v1; } void LinearInterpolator1D1::setValues(double v0, double v1) { m_value0 = v0; m_value1 = v1; } double LinearInterpolator1D1::interpolate(double t) const { return t * m_value1 + (1 - t) * m_value0; } LinearInterpolator2D1::LinearInterpolator2D1() : Interpolator2D1() { } LinearInterpolator2D1::LinearInterpolator2D1(const QVector2D& v0, const QVector2D& v1) { m_value0 = v0; m_value1 = v1; } void LinearInterpolator2D1::setValues(const QVector2D& v0, const QVector2D& v1) { m_value0 = v0; m_value1 = v1; } QVector2D LinearInterpolator2D1::interpolate(double t) const { return t * m_value1 + (1 - t) * m_value0; } Interpolator2D1* LinearInterpolator2D1::copy() const { return new LinearInterpolator2D1(m_value0, m_value1); }

kinoue@2cc7cdd0-1db9-4218-aa4a-1d8dad43e0f0

a6ebd2ab83a2c332caa680bd465a9d6bc900341d

b8888cb2fe3ae912c89a3fa7fd804bd3b818593e

/Parser/parser.h

457fd7bc7c3caf3dabc98768eab85fa8f3b0491f

no_license

utec-cs-aed-2021-1/proyecto-de-curso-runtime-terror

fd96bd65ecaa0008f170f781502bf1d07dc70ede

38a1994b4e3f52ca1c9c228c2f81a11dc9a69d34

refs/heads/main

UTF-8

C++

h

#ifndef PROYECTO_DE_CURSO_RUNTIME_TERROR_PARSER_H #define PROYECTO_DE_CURSO_RUNTIME_TERROR_PARSER_H #include "json.hpp" #include "graph.h" #include <fstream> #include <utility> #include <sstream> #include <cmath> using json = nlohmann::json; class Parser{ private: json* data; string dir; public: Parser(){data = nullptr;} Parser(string dir_){data = nullptr; dir = std::move(dir_);} void clear(); // Clears parser saved atributes void readJSON(); // Parses JSON file and saves data into class NOTE: each derived class has its own readJSON method template<typename TV, typename TE> void GraphMake(Graph<TV,TE> &tempGraph); // Adds the parsed data into the specified undirected graph void set_dir(string dir_){dir = std::move(dir_);} }; void Parser::readJSON() { if(dir.empty()) return; std::ifstream i(dir); //lee el json auto temp = json::parse(i); //convierte el archivo json a data = new json; *data = temp; i.close(); } void Parser::clear() { data = nullptr; } template<typename TV, typename TE> void Parser::GraphMake(Graph<TV ,TE> &tempGraph) { if(data == nullptr) return; json temp; double dist; for(auto & i : *data) { tempGraph.insertVertex(i["Airport ID"],i); } for(auto & i : *data) { for(int j = 0; j < i["destinations"].size(); ++j) { temp = tempGraph.getDataById(i["destinations"][j]); dist = sqrt(pow( convert_to<TE>(temp["Longitude"].template get<string>()) - convert_to<TE>(i["Longitude"].template get<string>()),2) + pow( convert_to<TE>(temp["Latitude"].template get<string>()) - convert_to<TE>(i["Latitude"].template get<string>()),2)); tempGraph.createEdge(i["Airport ID"], i["destinations"][j], dist); } } } #endif //PROYECTO_DE_CURSO_RUNTIME_TERROR_PARSER_H

55152988+Dom0530@users.noreply.github.com

bedd6b0597395d00f57558d719997af8cb55958f

6c7cd2aecd2f055a34396cd555c3539d6bf521f1

/sm_kinematics/src/Transformation.cpp

1876fb255d4f7261f685e742d17a5c1e1a9e9a0b

no_license

tsandy/Schweizer-Messer

4dc3b100bd51eee78cdf9827db0143072dd7e5d3

77ba4c6c5668526f8dc8696375d44f5a85db0208

refs/heads/master

UTF-8

C++

cpp

#include <sm/kinematics/Transformation.hpp> #include <sm/kinematics/quaternion_algebra.hpp> #include <sm/kinematics/rotations.hpp> #include <sm/random.hpp> #include <sm/kinematics/UncertainHomogeneousPoint.hpp> #include <sm/kinematics/UncertainTransformation.hpp> #include <sm/kinematics/transformations.hpp> namespace sm { namespace kinematics { Transformation::Transformation() : _q_a_b(quatIdentity()), _t_a_b_a(0.0, 0.0, 0.0) { } Transformation::Transformation(Eigen::Matrix4d const & T_a_b) : _q_a_b( r2quat(T_a_b.topLeftCorner<3,3>()) ), _t_a_b_a( T_a_b.topRightCorner<3,1>() ) { } Transformation::Transformation(const Eigen::Vector4d & q_a_b, const Eigen::Vector3d t_a_b_a) : _q_a_b(q_a_b), _t_a_b_a(t_a_b_a) { _q_a_b.normalize(); } Transformation::~Transformation(){} /// @return the rotation matrix Eigen::Matrix3d Transformation::C() const { return quat2r(_q_a_b); } /// @return the translation vector const Eigen::Vector3d & Transformation::t() const { return _t_a_b_a; } const Eigen::Vector4d & Transformation::q() const { return _q_a_b; } Eigen::Matrix4d Transformation::T() const { Eigen::Matrix4d T_a_b; // \todo...make this do less copying. T_a_b.topLeftCorner<3,3>() = quat2r(_q_a_b); T_a_b.topRightCorner<3,1>() = _t_a_b_a; T_a_b.bottomLeftCorner<1,3>().setZero(); T_a_b(3,3) = 1.0; return T_a_b; } Eigen::Matrix<double, 3,4> Transformation::T3x4() const { Eigen::Matrix<double, 3, 4> T3x4; // \todo...make this do less copying. T3x4.topLeftCorner<3,3>() = quat2r(_q_a_b); T3x4.topRightCorner<3,1>() = _t_a_b_a; return T3x4; } Transformation Transformation::inverse() const { // \todo Make this do less copying. return Transformation(quatInv(_q_a_b), quatRotate(quatInv(_q_a_b),-_t_a_b_a)); } void Transformation::checkTransformationIsValid( void ) const { // \todo. } Transformation Transformation::operator*(const Transformation & rhs) const { return Transformation(qplus(_q_a_b,rhs._q_a_b), quatRotate(_q_a_b,rhs._t_a_b_a) + _t_a_b_a); } Eigen::Vector3d Transformation::operator*(const Eigen::Vector3d & rhs) const { return quatRotate(_q_a_b, rhs) + _t_a_b_a; } Eigen::Vector4d Transformation::operator*(const Eigen::Vector4d & rhs) const { Eigen::Vector4d rval; rval.head<3>() = quatRotate(_q_a_b, rhs.head<3>()) + rhs[3] * _t_a_b_a; rval[3] = rhs[3]; return rval; } HomogeneousPoint Transformation::operator*(const HomogeneousPoint & rhs) const { Eigen::Vector4d rval = rhs.toHomogeneous(); rval.head<3>() = (quatRotate(_q_a_b, rhs.toHomogeneous().head<3>()) + rval[3] * _t_a_b_a).eval(); return HomogeneousPoint(rval); } void Transformation::setRandom() { _q_a_b = quatRandom(); _t_a_b_a = (Eigen::Vector3d::Random().array() - 0.5) * 100.0; } bool Transformation::isBinaryEqual(const Transformation & rhs) const { return _q_a_b == rhs._q_a_b && _t_a_b_a == rhs._t_a_b_a; } /// \brief The update step for this transformation from a minimal update. void Transformation::oplus(const Eigen::Matrix<double,6,1> & dt) { _q_a_b = updateQuat( _q_a_b, dt.tail<3>() ); _t_a_b_a += dt.head<3>(); } Eigen::Matrix<double,6,6> Transformation::S() const { Eigen::Matrix<double,6,6> S; S.setIdentity(); S.topRightCorner<3,3>() = -crossMx(_t_a_b_a); return S; } void Transformation::setIdentity() { _q_a_b = quatIdentity(); _t_a_b_a.setZero(); } /// \brief Set this to a random transformation. void Transformation::setRandom( double translationMaxMeters, double rotationMaxRadians) { // Create a random unit-length axis. Eigen::Vector3d axis = Eigen::Vector3d::Random().array() - 0.5; // Create a random rotation angle in radians. double angle = sm::random::randLU(0.0, rotationMaxRadians); // Now a random axis/angle.cp axis.array() *= angle/axis.norm(); Eigen::Vector3d t; t.setRandom(); t.array() -= 0.5; t.array() *= sm::random::randLU(0.0, translationMaxMeters)/t.norm(); _q_a_b = axisAngle2quat(axis); _t_a_b_a = t; } UncertainTransformation Transformation::operator*(const UncertainTransformation & UT_b_c) const { const Transformation & T_a_b = *this; const Transformation & T_b_c = UT_b_c; Transformation T_a_c = T_a_b * T_b_c; UncertainTransformation::covariance_t T_a_b_boxtimes = boxTimes(T_a_b.T()); UncertainTransformation::covariance_t U_a_c = T_a_b_boxtimes * UT_b_c.U() * T_a_b_boxtimes.transpose(); return UncertainTransformation(T_a_c, U_a_c); } UncertainHomogeneousPoint Transformation::operator*(const UncertainHomogeneousPoint & p_1) const { const Transformation & T_0_1 = *this; Eigen::Vector4d p_0 = T_0_1 * p_1.toHomogeneous(); Eigen::Matrix4d T01 = T_0_1.T(); UncertainHomogeneousPoint::covariance_t U = T01 * p_1.U4() * T01.transpose(); return UncertainHomogeneousPoint(p_0,U); } /// \brief rotate a point (do not translate) Eigen::Vector3d Transformation::rotate(const Eigen::Vector3d & p) const { return quatRotate(_q_a_b, p); } /// \brief rotate a point (do not translate) Eigen::Vector4d Transformation::rotate(const Eigen::Vector4d & p) const { Eigen::Vector4d rval = p; rval.head<3>() = quatRotate(_q_a_b, rval.head<3>()); return rval; } UncertainVector3 Transformation::rotate(const UncertainVector3 & p) const { Eigen::Vector3d mean = rotate(p.mean()); Eigen::Matrix3d R = C(); Eigen::Matrix3d P = R * p.covariance() * R.transpose(); return UncertainVector3(mean, P); } } // namespace kinematics } // namespace sm

paul.furgale@gmail.com

d55b6eacb4ce537ffa0a602ccdf7627f9cb28155

e7006ef73d6ce0be377f81009ce82ca736ed7ef9

/unit_tests/TestElementQueue.cpp

ce1c90919ed018c44d12e2a1150d65654c0b3321

no_license

mitikkak/KayakLogger

4ba509ad2944938e379bfbf6bf69070a0834d19c

4a85f59ef9be6515e4a15dbb9a6f849055cf95c5

refs/heads/master

UTF-8

C++

cpp

#include <gtest/gtest.h> #include <fstream> using namespace std; #include "ElementQueue.h" class TestElementQueue : public ::testing::Test { public: TestElementQueue() {} void SetUp() { } void TearDown() { } }; TEST_F(TestElementQueue, construct) { ElementQueue q; }

mikko.tikkakoski@gmail.com

72828656f3c9d835dcdb0d1bef030bce081904c8

a3f61587f7e27a0ba0a6e774243ba976a28f5111

/entities/Background.h

cf154eeea5e84b09ccb6d730af45059c4539496f

no_license

Swordelf2/mg2

164e93a10d3914d8d1081f382db69d36b332e8e4

52ec89ce9c3249c81278c17ad07eb067eaf0071d

refs/heads/master

UTF-8

C++

h

#ifndef ENTITIES_BACKGROUND_H #define ENTITIES_BACKGROUND_H #include "../graphics/Entity.h" class Background : public Entity { public: Background(Mesh *mesh = nullptr, Shader *shader = nullptr, Texture *texture = nullptr); virtual ~Background() = default; void Draw() const; }; #endif

swordelf@mail.ru

158f3030f4e51f760a3292b4cb462527f8a28246

ad107e8812705a73bf9fd30174cbb925b2cfabf5

/Kehu/News.h

26832914c031ec5782a16f3d9c8d361b23010512

no_license

gongxijun/Ad-Client

51f71e14d8270d127d8197a0a16ca1b330109719

c86537dcf25f93921994c4707135081cca9b5a62

refs/heads/master

GB18030

C++

h

#pragma once #include "explorer1.h" #ifdef _WIN32_WCE #error "Windows CE 不支持 CDHtmlDialog。" #endif extern CImage Resour; extern struct usr ower; // News 对话框 class News : public CDHtmlDialog { DECLARE_DYNCREATE(News) public: News(CWnd* pParent = NULL); // 标准构造函数 virtual ~News(); //重写 HRESULT OnButtonOK(IHTMLElement *pElement); HRESULT OnButtonCancel(IHTMLElement *pElement); // 对话框数据 //enum { IDD = IDD_DIALOG3, IDH = IDR_HTML_NEWS }; // enum { IDD = IDD_DIALOG3, IDH = 0 }; protected: virtual void DoDataExchange(CDataExchange* pDX); // DDX/DDV 支持 virtual BOOL OnInitDialog(); DECLARE_MESSAGE_MAP() DECLARE_DHTML_EVENT_MAP() public: afx_msg void OnBnClickedOk(); afx_msg void OnBnClickedCancel(); afx_msg void GotoUrl(LPCTSTR pszUrl); afx_msg void OnDestroy(); afx_msg void OnClose(); };

xijun.gong@qunar.com

43abfd7e26c1ae865400d0924ee2e50b743e5b03

0eff74b05b60098333ad66cf801bdd93becc9ea4

/second/download/squid/gumtree/squid_patch_hunk_226.cpp

c62049a1d12bf5b4bc0ecfe4887b63ddbf106f06

no_license

niuxu18/logTracker-old

97543445ea7e414ed40bdc681239365d33418975

f2b060f13a0295387fe02187543db124916eb446

refs/heads/master

UTF-8

C++

cpp

/**** PUBLIC FUNCTIONS ****/ /* * start a TCP connection to the peer host on port 113 */ void -Ident::Start(IpAddress &me, IpAddress &my_peer, IDCB * callback, void *data) +Ident::Start(const Comm::ConnectionPointer &conn, IDCB * callback, void *data) { IdentStateData *state; - int fd; char key1[IDENT_KEY_SZ]; char key2[IDENT_KEY_SZ]; char key[IDENT_KEY_SZ]; - char ntoabuf[MAX_IPSTRLEN]; - me.ToURL(key1, IDENT_KEY_SZ); - my_peer.ToURL(key2, IDENT_KEY_SZ); + conn->local.ToURL(key1, IDENT_KEY_SZ); + conn->remote.ToURL(key2, IDENT_KEY_SZ); snprintf(key, IDENT_KEY_SZ, "%s,%s", key1, key2); if (!ident_hash) { Init(); } if ((state = (IdentStateData *)hash_lookup(ident_hash, key)) != NULL) { ClientAdd(state, callback, data); return; } - IpAddress addr = me; - addr.SetPort(0); // NP: use random port for secure outbound to IDENT_PORT - - fd = comm_open_listener(SOCK_STREAM, - IPPROTO_TCP, - addr, - COMM_NONBLOCKING, - "ident"); - - if (fd == COMM_ERROR) { - /* Failed to get a local socket */ - callback(NULL, data); - return; - } - CBDATA_INIT_TYPE(IdentStateData); state = cbdataAlloc(IdentStateData); state->hash.key = xstrdup(key); - state->fd = fd; - state->me = me; - state->my_peer = my_peer; + + // copy the conn details. We dont want the original FD to be re-used by IDENT. + state->conn = conn->copyDetails(); + // NP: use random port for secure outbound to IDENT_PORT + state->conn->local.SetPort(0); + state->conn->remote.SetPort(IDENT_PORT); + + // build our query from the original connection details + state->queryMsg.init(); + state->queryMsg.Printf("%d, %d\r\n", conn->remote.GetPort(), conn->local.GetPort()); + ClientAdd(state, callback, data); hash_join(ident_hash, &state->hash); - comm_add_close_handler(fd, Ident::Close, state); - commSetTimeout(fd, Ident::TheConfig.timeout, Ident::Timeout, state); - state->my_peer.NtoA(ntoabuf,MAX_IPSTRLEN); - commConnectStart(fd, ntoabuf, IDENT_PORT, Ident::ConnectDone, state); + + AsyncCall::Pointer call = commCbCall(30,3, "Ident::ConnectDone", CommConnectCbPtrFun(Ident::ConnectDone, state)); + AsyncJob::Start(new Comm::ConnOpener(state->conn, call, Ident::TheConfig.timeout)); } void Ident::Init(void) { if (ident_hash) {

993273596@qq.com

b4d0120da0bc869691692d0bb26876d0ff0995bf

90e02ef236ec48414dcdb5bd08665c865605f984

/src/cisst-saw/sawTrajectories/include/sawTrajectories/osaTrajectory.h

8cb23c2f0b8f4d37ab48e3a23ee07f8097863e12

no_license

NicholasDascanio/dvrk_moveit

3033ccda21d140a5feda0a7a42585c94784a1f13

4d23fa74f3663551791b958f96203f4196b1d765

refs/heads/master

UTF-8

C++

h

/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */ /* ex: set filetype=cpp softtabstop=4 shiftwidth=4 tabstop=4 cindent expandtab: */ /* $Id: osaTrajectory.h 4202 2013-05-17 15:39:06Z adeguet1 $ Author(s): Simon Leonard Created on: 2012 (C) Copyright 2012-2014 Johns Hopkins University (JHU), All Rights Reserved. --- begin cisst license - do not edit --- This software is provided "as is" under an open source license, with no warranty. The complete license can be found in license.txt and http://www.cisst.org/cisst/license.txt. --- end cisst license --- */ #ifndef _osaTrajectory_h #define _osaTrajectory_h #include <cisstRobot/robFunction.h> #include <cisstRobot/robManipulator.h> #include <cisstVector/vctFrame4x4.h> #include <cisstVector/vctDynamicVectorTypes.h> #include <list> #include <sawTrajectories/sawTrajectoriesExport.h> class CISST_EXPORT osaTrajectory : public robManipulator{ public: enum Errno { ESUCCESS, EPENDING, EEXPIRED, EEMPTY, EUNSUPPORTED, ETRANSITION, EINVALID }; private: double currenttime; vctDynamicVector<double> q; robFunction* function; enum Space{ R3, RN, SO3, SE3 }; // segment base class class Segment{ private: osaTrajectory::Space inspace; osaTrajectory::Space outspace; protected: double duration; public: Segment( osaTrajectory::Space is, osaTrajectory::Space os ) : inspace( is ), outspace( os ), duration( -1.0 ){} virtual ~Segment() {} virtual osaTrajectory::Space InputSpace() const { return inspace; } virtual osaTrajectory::Space OutputSpace() const { return outspace; } }; std::list< osaTrajectory::Segment* > segments; osaTrajectory::Errno LoadNextSegment(); // Inverse kinematics segment class IKSegment : public Segment { private: vctFrame4x4<double> Rtstart; /**< start Cartesian position */ vctFrame4x4<double> Rtfinal; /**< final Carteisan position */ double v; /**< linear velocity */ double w; /**< angular velocity */ public: IKSegment( const vctFrame4x4<double>& Rts, const vctFrame4x4<double>& Rtf, double v, double w); //! Get segment start position (Cartesian pos 4x4 matrix) vctFrame4x4<double> StateStart() const { return Rtstart; } //! Get segment final position (Cartesian pos 4x4 matrix) vctFrame4x4<double> StateFinal() const { return Rtfinal; } //! Get segment linear velocity double VelocityLinear() const { return v; } //! Get segment angular velocity double VelocityAngular() const { return w; } }; // IK segment // ZC: NOT USED ? // Forward kinematics segment class FKSegment : public Segment { private: vctDynamicVector<double> qstart; vctDynamicVector<double> qfinal; public: FKSegment( const vctDynamicVector<double>& qs, const vctDynamicVector<double>& qf, double ) : Segment( osaTrajectory::SE3, osaTrajectory::RN ), qstart( qs ), qfinal( qf ){} //! Get segment start position (joint space ??? ZC) vctDynamicVector<double> StateStart() const { return qstart; } //! Get segment final position (joint space ??? ZC) vctDynamicVector<double> StateFinal() const { return qfinal; } }; // FK segment // Joint segment class RnSegment : public Segment { private: vctDynamicVector<double> qstart; /**< start joint position */ vctDynamicVector<double> qfinal; /**< final joint position */ vctDoubleVec vel; /**< joint velocity */ public: RnSegment( const vctDynamicVector<double>& qs, const vctDynamicVector<double>& qf, double ); //! Get segment start position (joint space ??? ZC) vctDynamicVector<double> StateStart() const { return qstart; } //! Get segment final position (joint space ??? ZC) vctDynamicVector<double> StateFinal() const { return qfinal; } //! Get segment linear velocity vctDoubleVec VelocityJoint() const { return vel; } }; // Joint segment double GetTime() const { return currenttime; } void SetTime( double t ){ currenttime = t; } osaTrajectory::Errno PostProcess(); public: osaTrajectory( const std::string& robotfilename, const vctFrame4x4<double>& Rtw0, const vctDynamicVector<double>& qinit ); /** * @brief Insert inverse kinematic segment * * @param Rt2 * @param vmax * @param wmax * @return osaTrajectory::Errno Error number */ osaTrajectory::Errno InsertIK( const vctFrame4x4<double>& Rt2, double vmax, double wmax ); osaTrajectory::Errno Insert( const vctFrame4x4<double>& Rt2, double dt ); osaTrajectory::Errno Evaluate( double t, vctFrame4x4<double>& Rt, vctDynamicVector<double>& q ); friend std::ostream& operator<<( std::ostream& os, const osaTrajectory::Errno& e ){ switch( e ){ case osaTrajectory::ESUCCESS: os << "SUCCESS"; break; case osaTrajectory::EPENDING: os << "EPENDING"; break; case osaTrajectory::EEXPIRED: os << "EEXPIRED"; break; case osaTrajectory::EEMPTY: os << "EEMPTY"; break; case osaTrajectory::EUNSUPPORTED: os << "EUNSUPPORTED"; break; case osaTrajectory::ETRANSITION: os << "ETRANSITION"; break; case osaTrajectory::EINVALID: os << "EINVALID"; break; } return os; } }; #endif // _osaTrajectory_h

nicholas.dascanio95@gmail.com

16797e4979a0f00c0f5408ba087dd3da9615e2ee

446641d5115aaa8371a767e7e0e0597797568e33

/Quarter 3/Week 5/closingthefarm.cpp

a811cf8531272c1710d89f581bee2d89071e997d

permissive

nwatx/CS3-Independent-Study

b4faa3442507121eef32e233bfacd8a549b85acc

16b91d4e0503d10d825ae800c46ea9233cd5e066

refs/heads/master

UTF-8

C++

cpp

#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> // Common file #include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update using namespace __gnu_pbds; using namespace std; #pragma GCC optimize("O3") #pragma GCC optimization ("unroll-loops") #pragma region using ll = long long; using db = long double; // or double, if TL is tight using str = string; // yay python! using pi = pair<int,int>; using pl = pair<ll,ll>; using pd = pair<db,db>; using vi = vector<int>; using vb = vector<bool>; using vl = vector<ll>; using vd = vector<db>; using vs = vector<str>; using vpi = vector<pi>; using vpl = vector<pl>; using vpd = vector<pd>; #define tcT template<class T #define tcTU tcT, class U // ^ lol this makes everything look weird but I'll try it tcT> using V = vector<T>; tcT, size_t SZ> using AR = array<T,SZ>; tcT> using PR = pair<T,T>; // pairs #define mp make_pair #define f first #define s second // vectors // oops size(x), rbegin(x), rend(x) need C++17 #define sz(x) (int)x.size() #define bg(x) x.begin() #define en(x) x.end() #define all(x) bg(x), end(x) #define rall(x) x.rbegin(), x.rend() #define sor(x) sort(all(x)) #define rsz resize #define ins insert #define ft front() #define bk back() #define pb push_back #define eb emplace_back #define pf push_front #define lb lower_bound #define ub upper_bound tcT> int lwb(V<T>& a, const T& b) { return int(lb(all(a),b)-bg(a)); } // loops #define FOR(i,a,b) for (int i = (a); i < (b); ++i) #define F0R(i,a) FOR(i,0,a) #define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i) #define R0F(i,a) ROF(i,0,a) #define trav(a,x) for (auto& a: x) const int MOD = 1e9+7; // 998244353; const ll INF = 1e18; // not too close to LLONG_MAX const char nl = '\n'; const db PI = acos((db)-1); const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1}; // for every grid problem!! mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>; template<class T> using ost = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; //order statistic tree! // bitwise ops // also see https://gcc.gnu.org/onlinedocs/gcc/Other-Builtins.html constexpr int pct(int x) { return __builtin_popcount(x); } // # of bits set constexpr int bits(int x) { // assert(x >= 0); // make C++11 compatible until USACO updates ... return x == 0 ? 0 : 31-__builtin_clz(x); } // floor(log2(x)) constexpr int p2(int x) { return 1<<x; } constexpr int msk2(int x) { return p2(x)-1; } ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down tcT> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } // set a = min(a,b) tcT> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } tcTU> T fstTrue(T lo, T hi, U f) { hi ++; assert(lo <= hi); // assuming f is increasing while (lo < hi) { // find first index such that f is true T mid = lo+(hi-lo)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; } tcTU> T lstTrue(T lo, T hi, U f) { lo --; assert(lo <= hi); // assuming f is decreasing while (lo < hi) { // find first index such that f is true T mid = lo+(hi-lo+1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; } tcT> void remDup(vector<T>& v) { // sort and remove duplicates sort(all(v)); v.erase(unique(all(v)),end(v)); } tcTU> void erase(T& t, const U& u) { // don't erase auto it = t.find(u); assert(it != end(t)); t.erase(it); } // element that doesn't exist from (multi)set // INPUT #define tcTUU tcT, class ...U tcT> void re(complex<T>& c); tcTU> void re(pair<T,U>& p); tcT> void re(V<T>& v); tcT, size_t SZ> void re(AR<T,SZ>& a); tcT> void re(T& x) { cin >> x; } void re(double& d) { str t; re(t); d = stod(t); } void re(long double& d) { str t; re(t); d = stold(t); } tcTUU> void re(T& t, U&... u) { re(t); re(u...); } tcT> void re(complex<T>& c) { T a,b; re(a,b); c = {a,b}; } tcTU> void re(pair<T,U>& p) { re(p.f,p.s); } tcT> void re(V<T>& x) { trav(a,x) re(a); } tcT, size_t SZ> void re(AR<T,SZ>& x) { trav(a,x) re(a); } tcT> void rv(int n, V<T>& x) { x.rsz(n); re(x); } // TO_STRING #define ts to_string str ts(char c) { return str(1,c); } str ts(const char* s) { return (str)s; } str ts(str s) { return s; } str ts(bool b) { // #ifdef LOCAL // return b ? "true" : "false"; // #else return ts((int)b); // #endif } tcT> str ts(complex<T> c) { stringstream ss; ss << c; return ss.str(); } str ts(V<bool> v) { str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]); res += "}"; return res; } template<size_t SZ> str ts(bitset<SZ> b) { str res = ""; F0R(i,SZ) res += char('0'+b[i]); return res; } tcTU> str ts(pair<T,U> p); tcT> str ts(T v) { // containers with begin(), end() #ifdef LOCAL bool fst = 1; str res = "{"; for (const auto& x: v) { if (!fst) res += ", "; fst = 0; res += ts(x); } res += "}"; return res; #else bool fst = 1; str res = ""; for (const auto& x: v) { if (!fst) res += " "; fst = 0; res += ts(x); } return res; #endif } tcTU> str ts(pair<T,U> p) { #ifdef LOCAL return "("+ts(p.f)+", "+ts(p.s)+")"; #else return ts(p.f)+" "+ts(p.s); #endif } // OUTPUT tcT> void pr(T x) { cout << ts(x); } tcTUU> void pr(const T& t, const U&... u) { pr(t); pr(u...); } void ps() { pr("\n"); } // print w/ spaces tcTUU> void ps(const T& t, const U&... u) { pr(t); if (sizeof...(u)) pr(" "); ps(u...); } // DEBUG void DBG() { cerr << "]" << endl; } tcTUU> void DBG(const T& t, const U&... u) { cerr << ts(t); if (sizeof...(u)) cerr << ", "; DBG(u...); } #ifdef LOCAL // compile with -DLOCAL, chk -> fake assert #define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__) #define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \ << __FUNCTION__ << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0); #else #define dbg(...) 0 #define chk(...) 0 #endif void setPrec() { cout << fixed << setprecision(15); } void unsyncIO() { cin.tie(0)->sync_with_stdio(0); } // FILE I/O void setIn(str s) { freopen(s.c_str(),"r",stdin); } void setOut(str s) { freopen(s.c_str(),"w",stdout); } void setIO(str s = "") { unsyncIO(); setPrec(); // cin.exceptions(cin.failbit); // throws exception when do smth illegal // ex. try to read letter into int if (sz(s)) setIn(s+".in"), setOut(s+".out"); // for USACO } #pragma endregion const int MX = 2e5+1; // make sure to intialize ALL GLOBAL VARS between tcs! struct UF { vi e; UF(int n) : e(n, -1) {} bool sameSet(int a, int b) { return find(a) == find(b); } int size(int x) { return -e[find(x)]; } int find(int x) { return e[x] < 0 ? x : e[x] = find(e[x]); } bool join(int a, int b) { a = find(a), b = find(b); if (a == b) return false; if (e[a] > e[b]) swap(a, b); e[a] += e[b]; e[b] = a; return true; } }; int N, M; bool A[MX]; bool vis[MX]; vi adj[MX]; int main() { // clock_t start = clock(); setIO("closing"); re(N, M); UF uf(N); F0R(i, M) { int a, b; re(a, b); a--; b--; adj[a].pb(b); adj[b].pb(a); } vi order(N); F0R(i, N) { int a; re(a); a--; order[i] = a; } R0F(i, N) { vis[i] = true; trav(e, adj[i]) { if(vis[i] && vis[e]) uf.join(i, e); } uf.size(order[i]) == N-i ? pr("YES\n"): pr("NO\n"); } // cerr << "Total Time: " << (double)(clock() - start)/ CLOCKS_PER_SEC; } /* stuff you should look for * int overflow, array bounds * special cases (n=1?) * do smth instead of nothing and stay organized * WRITE STUFF DOWN * DON'T GET STUCK ON ONE APPROACH */

43394822+nwatx@users.noreply.github.com

64c67f62a3830198cd4c84fe84ba26cd8ce3dd6d

49d669ee077b5701563edf35de26f60cfa6e090c

/Android/app/src/main/cpp/native-lib.cpp

193ebff7c1606a32827a44a1e921ff0eec9926e7

permissive

sevenfortune/ZLMediaKit

767c0de7c67414ee04ee765db82bde6a5620d3e3

54b2cd008947e108e737432e7319a3acac309991

refs/heads/master

UTF-8

C++

cpp

#include <jni.h> #include <string> #include "Util/logger.h" #include "Thread/semaphore.h" #include "Common/config.h" #include "Player/MediaPlayer.h" #include "Extension/Frame.h" using namespace std; using namespace toolkit; using namespace mediakit; #define JNI_API(retType,funName,...) extern "C" JNIEXPORT retType Java_com_zlmediakit_jni_ZLMediaKit_##funName(JNIEnv* env, jclass cls,##__VA_ARGS__) #define MediaPlayerCallBackSign "com/zlmediakit/jni/ZLMediaKit$MediaPlayerCallBack" #define MediaFrameSign "com/zlmediakit/jni/ZLMediaKit$MediaFrame" string stringFromJstring(JNIEnv *env,jstring jstr){ if(!env || !jstr){ WarnL << "invalid args"; return ""; } const char *field_char = env->GetStringUTFChars(jstr, 0); string ret(field_char,env->GetStringUTFLength(jstr)); env->ReleaseStringUTFChars(jstr, field_char); return ret; } string stringFromJbytes(JNIEnv *env,jbyteArray jbytes){ if(!env || !jbytes){ WarnL << "invalid args"; return ""; } jbyte *bytes = env->GetByteArrayElements(jbytes, 0); string ret((char *)bytes,env->GetArrayLength(jbytes)); env->ReleaseByteArrayElements(jbytes,bytes,0); return ret; } string stringFieldFromJava(JNIEnv *env, jobject jdata,jfieldID jid){ if(!env || !jdata || !jid){ WarnL << "invalid args"; return ""; } jstring field_str = (jstring)env->GetObjectField(jdata,jid); auto ret = stringFromJstring(env,field_str); env->DeleteLocalRef(field_str); return ret; } string bytesFieldFromJava(JNIEnv *env, jobject jdata,jfieldID jid){ if(!env || !jdata || !jid){ WarnL << "invalid args"; return ""; } jbyteArray jbufArray = (jbyteArray)env->GetObjectField(jdata, jid); string ret = stringFromJbytes(env,jbufArray); env->DeleteLocalRef(jbufArray); return ret; } jstring jstringFromString(JNIEnv* env, const char* pat) { return (jstring)env->NewStringUTF(pat); } jbyteArray jbyteArrayFromString(JNIEnv* env, const char* pat,int len = 0){ if(len <= 0){ len = strlen(pat); } jbyteArray jarray = env->NewByteArray(len); env->SetByteArrayRegion(jarray, 0, len, (jbyte *)(pat)); return jarray; } jobject makeJavaFrame(JNIEnv* env,const Frame::Ptr &frame){ static jclass jclass_obj = (jclass)env->NewGlobalRef(env->FindClass(MediaFrameSign)); static jmethodID jmethodID_init = env->GetMethodID(jclass_obj, "<init>", "()V"); static jfieldID jfieldID_dts = env->GetFieldID(jclass_obj,"dts","I"); static jfieldID jfieldID_pts = env->GetFieldID(jclass_obj,"pts","I"); static jfieldID jfieldID_prefixSize = env->GetFieldID(jclass_obj,"prefixSize","I"); static jfieldID jfieldID_keyFrame = env->GetFieldID(jclass_obj,"keyFrame","Z"); static jfieldID jfieldID_data = env->GetFieldID(jclass_obj,"data","[B"); static jfieldID jfieldID_trackType = env->GetFieldID(jclass_obj,"trackType","I"); static jfieldID jfieldID_codecId = env->GetFieldID(jclass_obj,"codecId","I"); if(!frame){ return nullptr; } jobject ret = env->NewObject(jclass_obj, jmethodID_init); env->SetIntField(ret,jfieldID_dts,frame->dts()); env->SetIntField(ret,jfieldID_pts,frame->pts()); env->SetIntField(ret,jfieldID_prefixSize,frame->prefixSize()); env->SetBooleanField(ret,jfieldID_keyFrame,frame->keyFrame()); env->SetObjectField(ret,jfieldID_data,jbyteArrayFromString(env,frame->data(),frame->size())); env->SetIntField(ret,jfieldID_trackType,frame->getTrackType()); env->SetIntField(ret,jfieldID_codecId,frame->getCodecId()); return ret; } static JavaVM *s_jvm = nullptr; template <typename FUN> void doInJavaThread(FUN &&fun){ JNIEnv *env; int status = s_jvm->GetEnv((void **) &env, JNI_VERSION_1_6); if (status != JNI_OK) { if (s_jvm->AttachCurrentThread(&env, NULL) != JNI_OK) { return; } } fun(env); if (status != JNI_OK) { //Detach线程 s_jvm->DetachCurrentThread(); } } #define emitEvent(delegate,method,argFmt,...) \ { \ doInJavaThread([&](JNIEnv* env) { \ static jclass cls = env->GetObjectClass(delegate); \ static jmethodID jmid = env->GetMethodID(cls, method, argFmt); \ jobject localRef = env->NewLocalRef(delegate); \ if(localRef){ \ env->CallVoidMethod(localRef, jmid, ##__VA_ARGS__); \ }else{ \ WarnL << "弱引用已经释放:" << method << " " << argFmt; \ }\ }); \ } /* * 加载动态库 */ JNIEXPORT jint JNICALL JNI_OnLoad(JavaVM* vm, void* reserved) { //设置日志 s_jvm = vm; Logger::Instance().add(std::make_shared<ConsoleChannel>()); Logger::Instance().setWriter(std::make_shared<AsyncLogWriter>()); InfoL; return JNI_VERSION_1_6; } static pthread_t s_tread_id = 0; /* * 卸载动态库 */ JNIEXPORT void JNICALL JNI_OnUnload(JavaVM* vm, void* reserved){ InfoL; if(s_tread_id){ pthread_kill(s_tread_id,SIGINT); } } extern int start_main(int argc,char *argv[]); JNI_API(jboolean,startDemo,jstring ini_dir){ string sd_path = stringFromJstring(env,ini_dir); string ini_file = sd_path + "/zlmediakit.ini"; //可以在sd卡根目录下放置ssl证书以便支持https服务器，证书支持p12或pem格式 string pem_file = sd_path + "/zlmediakit.pem"; DebugL << "sd_path:" << sd_path; DebugL << "ini file:" << ini_file; static thread s_th([sd_path,ini_file,pem_file](){ s_tread_id = pthread_self(); try { //http根目录修改默认路径 mINI::Instance()[Http::kRootPath] = mINI::Instance()[Hls::kFilePath] = sd_path + "/httpRoot"; //mp4录制点播根目录修改默认路径 mINI::Instance()[Record::kFilePath] = mINI::Instance()[Hls::kFilePath] = sd_path + "/httpRoot"; //hls根目录修改默认路径 mINI::Instance()[Hls::kFilePath] = mINI::Instance()[Hls::kFilePath] = sd_path + "/httpRoot"; //替换默认端口号(在配置文件未生成时有效) mINI::Instance()["http.port"] = 8080; mINI::Instance()["http.sslport"] = 8443; mINI::Instance()["rtsp.port"] = 8554; mINI::Instance()["rtsp.sslport"] = 8332; for(auto &pr : mINI::Instance()){ //替换hook默认地址 replace(pr.second,"https://127.0.0.1/","http://127.0.0.1:8080/"); } //默认打开hook mINI::Instance()["hook.enable"] = 0; //默认打开http api调试 mINI::Instance()["api.apiDebug"] = 1; int argc = 5; const char *argv[] = {"","-c",ini_file.data(),"-s",pem_file.data()}; start_main(argc,(char **)argv); }catch (std::exception &ex){ WarnL << ex.what(); } }); static onceToken s_token([]{ s_th.detach(); }); return true; }; JNI_API(jlong,createMediaPlayer,jstring url,jobject callback){ static auto loadFrameClass = makeJavaFrame(env,nullptr); MediaPlayer::Ptr *ret = new MediaPlayer::Ptr(new MediaPlayer()); MediaPlayer::Ptr &player = *ret; weak_ptr<MediaPlayer> weakPlayer = player; jobject globalWeakRef = env->NewWeakGlobalRef(callback); player->setOnPlayResult([weakPlayer,globalWeakRef](const SockException &ex) { auto strongPlayer = weakPlayer.lock(); if (!strongPlayer) { return; } emitEvent((jobject)globalWeakRef,"onPlayResult","(ILjava/lang/String;)V",(jint)ex.getErrCode(),env->NewStringUTF(ex.what())); if(ex){ return; } auto viedoTrack = strongPlayer->getTrack(TrackVideo); if (viedoTrack) { viedoTrack->addDelegate(std::make_shared<FrameWriterInterfaceHelper>([globalWeakRef](const Frame::Ptr &frame) { emitEvent((jobject)globalWeakRef,"onData","(L" MediaFrameSign ";)V",makeJavaFrame(env,frame)); })); } auto audioTrack = strongPlayer->getTrack(TrackAudio); if (audioTrack) { audioTrack->addDelegate(std::make_shared<FrameWriterInterfaceHelper>([globalWeakRef](const Frame::Ptr &frame) { emitEvent((jobject)globalWeakRef,"onData","(L" MediaFrameSign ";)V",makeJavaFrame(env,frame)); })); } }); player->setOnShutdown([globalWeakRef,weakPlayer](const SockException &ex) { auto strongPlayer = weakPlayer.lock(); if (!strongPlayer) { return; } emitEvent((jobject)globalWeakRef,"onShutdown","(ILjava/lang/String;)V",(jint)ex.getErrCode(),env->NewStringUTF(ex.what())); }); (*player)[Client::kRtpType] = Rtsp::RTP_TCP; player->play(stringFromJstring(env,url)); return (jlong)(ret); } JNI_API(void,releaseMediaPlayer,jlong ptr){ MediaPlayer::Ptr *player = (MediaPlayer::Ptr *)ptr; delete player; }

771730766@qq.com

1c6b435463be46cbf043325fc2ced8bfd7e76d6a

d9e197288fea7783119b8adf81dd34e2619d9fb4

/src/hydro/srcterms/shearing_box.cpp

073f66c22b314cbfe3902c9037b807a30b687d9b

permissive

ziyanxu/athena-pp_xu

a2204bb216ac2e91e3075c96bdfaaff41b5e81bd

fce21992cc107aa553e83dd76b8d03ae90e990c7

refs/heads/master

UTF-8

C++

cpp

//====================================================================================== // Athena++ astrophysical MHD code // Copyright(C) 2014 James M. Stone <jmstone@princeton.edu> and other code contributors // Licensed under the 3-clause BSD License, see LICENSE file for details //====================================================================================== //! \file shearing_box.cpp //! \brief Adds source terms due to local shearing box approximation //====================================================================================== // C headers // C++ headers // Athena++ headers #include "../../athena.hpp" #include "../../athena_arrays.hpp" #include "../../coordinates/coordinates.hpp" #include "../../mesh/mesh.hpp" #include "../hydro.hpp" #include "hydro_srcterms.hpp" //-------------------------------------------------------------------------------------- //! \fn void HydroSourceTerms::ShearingBoxSourceTerms(const Real dt, //! const AthenaArray<Real> *flux, const AthenaArray<Real> &prim, //! AthenaArray<Real> &cons) //! \brief Shearing Box source terms //! //! We add shearing box source term via operator splitting method. The source terms are //! added after the fluxes are computed in each step of the integration (in //! FluxDivergence) to give predictions of the conservative variables for either the //! next step or the final update. void HydroSourceTerms::ShearingBoxSourceTerms(const Real dt, const AthenaArray<Real> *flux, const AthenaArray<Real> &prim, AthenaArray<Real> &cons) { MeshBlock *pmb = pmy_hydro_->pmy_block; // 1) Tidal force: // dM1/dt = 2q\rho\Omega^2 x // dE /dt = 2q\Omega^2 (\rho v_x) x // 2) Coriolis forces: // dM1/dt = 2\Omega(\rho v_y) // dM2/dt = -2\Omega(\rho v_x) if (ShBoxCoord_== 1) { for (int k=pmb->ks; k<=pmb->ke; ++k) { for (int j=pmb->js; j<=pmb->je; ++j) { #pragma omp simd for (int i=pmb->is; i<=pmb->ie; ++i) { Real den = prim(IDN,k,j,i); Real qO2 = qshear_*SQR(Omega_0_); Real mom1 = den*prim(IVX,k,j,i); Real xc = pmb->pcoord->x1v(i); cons(IM1,k,j,i) += 2.0*dt*(Omega_0_*(den*prim(IVY,k,j,i))+qO2*den*xc); cons(IM2,k,j,i) -= 2.0*dt*Omega_0_*mom1; if (NON_BAROTROPIC_EOS) { Real phic = qO2*SQR(xc); Real phil = qO2*SQR(pmb->pcoord->x1f(i)); Real phir = qO2*SQR(pmb->pcoord->x1f(i+1)); cons(IEN,k,j,i) += dt*(flux[X1DIR](IDN,k,j,i)*(phic-phil)+ flux[X1DIR](IDN,k,j,i+1)*(phir-phic)) /pmb->pcoord->dx1f(i); } } } } } else { // ShBoxCoord_== 2 int ks = pmb->ks; for (int j=pmb->js; j<=pmb->je; ++j) { #pragma omp simd for (int i=pmb->is; i<=pmb->ie; ++i) { Real den = prim(IDN,ks,j,i); Real qO2 = qshear_*SQR(Omega_0_); Real mom1 = den*prim(IVX,ks,j,i); Real xc = pmb->pcoord->x1v(i); cons(IM1,ks,j,i) += 2.0*dt*(Omega_0_*(den*prim(IVZ,ks,j,i))+qO2*den*xc); cons(IM3,ks,j,i) -= 2.0*dt*Omega_0_*mom1; if (NON_BAROTROPIC_EOS) { Real phic = qO2*SQR(xc); Real phil = qO2*SQR(pmb->pcoord->x1f(i)); Real phir = qO2*SQR(pmb->pcoord->x1f(i+1)); cons(IEN,ks,j,i) += dt*(flux[X1DIR](IDN,ks,j,i)*(phic-phil)+ flux[X1DIR](IDN,ks,j,i+1)*(phir-phic)) /pmb->pcoord->dx1f(i); } } } } return; }

phhuang10@gmail.com

195d4096ed752df9751a2da11de07435167aafa9

927fad9a4b5b170d681eda830ab92e37c6722ee7

/Classes/Game/GameScene1Obj1.h

6cf569919534a5cc4d35630e02a65d54277eb91f

no_license

the-last-language/Last-Language-2014

71af13da9a677af2c66fb8229a94196feb10d704

7c6911f9c53eed6cbd1e4dd1e9f48adaec95746a

refs/heads/master

UTF-8

C++

h

#ifndef __GameScene1Obj1_SCENE_H__ #define __GameScene1Obj1_SCENE_H__ #include "cocos2d.h" class GameScene1Obj1 : public cocos2d::Layer { public: // there's no 'id' in cpp, so we recommend returning the class instance pointer static cocos2d::Scene* createScene(); // Here's a difference. Method 'init' in cocos2d-x returns bool, instead of returning 'id' in cocos2d-iphone virtual bool init(); // a selector callback void menuCloseCallback(cocos2d::Ref* pSender); void initCancel(); // implement the "static create()" method manually CREATE_FUNC(GameScene1Obj1); }; #endif // __MenuScene_SCENE_H__

kimsh3933@gmail.com

53a23e4a780c74f9366fed6734a238e495f68749

4c1d7aee068d08bcfc1267d4501d32609e902301

/arc086_a.cc

45b205e1506283e7ee235856ff95e9c70f33ec11

permissive

mnrn/xxx-coder

9e7ba7cb9328203135134c889783e69df7f3b597

2db331c57f15fbd36fbb61a5526afc07af010727

refs/heads/master

UTF-8

C++

cc

// #define _GLIBCXX_DEBUG #include <bits/stdc++.h> #define FOR(i, a, b) for (int i = (a); i < int(b); ++i) #define RFOR(i, a, b) for (int i = (b)-1; i >= int(a); --i) #define REP(i, n) FOR(i, 0, n) #define REP1(i, n) FOR(i, 1, int(n) + 1) #define RREP(i, n) RFOR(i, 0, n) #define RREP1(i, n) RFOR(i, 1, int(n) + 1) #define ALL(c) begin(c), end(c) int _ = ( #ifndef LOCAL std::cin.tie(nullptr), std::ios::sync_with_stdio(false), #endif std::cout.precision(10), std::cout.setf(std::ios::fixed)); using ll = long long; using ull = unsigned long long; using ld = long double; template <typename T> using vec = std::vector<T>; using namespace std; int main() { ll K, N; cin >> N >> K; vec<ll> A(N); REP(i, N) cin >> A[i]; vec<ll> C(200'000, 0); REP(i, N) C[A[i]]++; C.erase(remove_if(ALL(C), [](ll c) { return c == 0; }), end(C)); ll k = C.size(); if (k <= K) { cout << 0 << endl; return 0; } sort(ALL(C)); ll res = 0; for (const auto e : C) { res += e; if (--k <= K) { break; } } cout << res << endl; return 0; }

paper.airplane01@gmail.com

851d1cd3018f2728ac8512691695bf6aba70d875

b4052809a4a08eb9ddc4551b6fc34ef61b90a24c

/frameworks/vtk.framework/Headers/vtkBitArray.h

ce00d7248f8ba6eb9c473051814a70053667abe0

no_license

9gel/hellopcl

548687167b0b17bd393b55f37e99d05207971a9e

19c39b39ad169c0a79b42cd72232d51b419f4f3d

refs/heads/master

UTF-8

C++

h

/*========================================================================= Program: Visualization Toolkit Module: vtkBitArray.h Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen All rights reserved. See Copyright.txt or http://www.kitware.com/Copyright.htm for details. This software is distributed WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the above copyright notice for more information. =========================================================================*/ // .NAME vtkBitArray - dynamic, self-adjusting array of bits // .SECTION Description // vtkBitArray is an array of bits (0/1 data value). The array is packed // so that each byte stores eight bits. vtkBitArray provides methods // for insertion and retrieval of bits, and will automatically resize // itself to hold new data. #ifndef __vtkBitArray_h #define __vtkBitArray_h #include "vtkCommonCoreModule.h" // For export macro #include "vtkDataArray.h" class vtkBitArrayLookup; class VTKCOMMONCORE_EXPORT vtkBitArray : public vtkDataArray { public: static vtkBitArray *New(); vtkTypeMacro(vtkBitArray,vtkDataArray); void PrintSelf(ostream& os, vtkIndent indent); // Description: // Allocate memory for this array. Delete old storage only if necessary. // Note that ext is no longer used. int Allocate(vtkIdType sz, vtkIdType ext=1000); // Description: // Release storage and reset array to initial state. void Initialize(); // satisfy vtkDataArray API int GetDataType() {return VTK_BIT;}; int GetDataTypeSize() { return 0; } // Description: // Set the number of n-tuples in the array. void SetNumberOfTuples(vtkIdType number); // Description: // Set the tuple at the ith location using the jth tuple in the source array. // This method assumes that the two arrays have the same type // and structure. Note that range checking and memory allocation is not // performed; use in conjunction with SetNumberOfTuples() to allocate space. virtual void SetTuple(vtkIdType i, vtkIdType j, vtkAbstractArray* source); // Description: // Insert the jth tuple in the source array, at ith location in this array. // Note that memory allocation is performed as necessary to hold the data. virtual void InsertTuple(vtkIdType i, vtkIdType j, vtkAbstractArray* source); // Description: // Insert the jth tuple in the source array, at the end in this array. // Note that memory allocation is performed as necessary to hold the data. // Returns the location at which the data was inserted. virtual vtkIdType InsertNextTuple(vtkIdType j, vtkAbstractArray* source); // Description: // Get a pointer to a tuple at the ith location. This is a dangerous method // (it is not thread safe since a pointer is returned). double *GetTuple(vtkIdType i); // Description: // Copy the tuple value into a user-provided array. void GetTuple(vtkIdType i, double * tuple); // Description: // Set the tuple value at the ith location in the array. void SetTuple(vtkIdType i, const float * tuple); void SetTuple(vtkIdType i, const double * tuple); // Description: // Insert (memory allocation performed) the tuple into the ith location // in the array. void InsertTuple(vtkIdType i, const float * tuple); void InsertTuple(vtkIdType i, const double * tuple); // Description: // Insert (memory allocation performed) the tuple onto the end of the array. vtkIdType InsertNextTuple(const float * tuple); vtkIdType InsertNextTuple(const double * tuple); // Description: // These methods remove tuples from the data array. They shift data and // resize array, so the data array is still valid after this operation. Note, // this operation is fairly slow. virtual void RemoveTuple(vtkIdType id); virtual void RemoveFirstTuple(); virtual void RemoveLastTuple(); // Description: // Set the data component at the ith tuple and jth component location. // Note that i is less then NumberOfTuples and j is less then // NumberOfComponents. Make sure enough memory has been allocated (use // SetNumberOfTuples() and SetNumberOfComponents()). void SetComponent(vtkIdType i, int j, double c); // Description: // Free any unneeded memory. void Squeeze(); // Description: // Resize the array while conserving the data. virtual int Resize(vtkIdType numTuples); // Description: // Get the data at a particular index. int GetValue(vtkIdType id); // Description: // Fast method based setting of values without memory checks. First // use SetNumberOfValues then use SetValue to actually set them. // Specify the number of values for this object to hold. Does an // allocation as well as setting the MaxId ivar. Used in conjunction with // SetValue() method for fast insertion. void SetNumberOfValues(vtkIdType number); // Description: // Set the data at a particular index. Does not do range checking. Make sure // you use the method SetNumberOfValues() before inserting data. void SetValue(vtkIdType id, int value); // Description: // Insets values and checks to make sure there is enough memory void InsertValue(vtkIdType id, int i); // Description: // Set a value in the array from a variant. void SetVariantValue(vtkIdType idx, vtkVariant value); vtkIdType InsertNextValue(int i); // Description: // Insert the data component at ith tuple and jth component location. // Note that memory allocation is performed as necessary to hold the data. virtual void InsertComponent(vtkIdType i, int j, double c); // Description: // Direct manipulation of the underlying data. unsigned char *GetPointer(vtkIdType id) {return this->Array + id/8;} // Description: // Get the address of a particular data index. Make sure data is allocated // for the number of items requested. Set MaxId according to the number of // data values requested. unsigned char *WritePointer(vtkIdType id, vtkIdType number); void* WriteVoidPointer(vtkIdType id, vtkIdType number) { return this->WritePointer(id, number); } void *GetVoidPointer(vtkIdType id) { return static_cast<void *>(this->GetPointer(id)); } // Description: // Deep copy of another bit array. void DeepCopy(vtkDataArray *da); void DeepCopy(vtkAbstractArray* aa) { this->Superclass::DeepCopy(aa); } // Description: // This method lets the user specify data to be held by the array. The // array argument is a pointer to the data. size is the size of // the array supplied by the user. Set save to 1 to keep the class // from deleting the array when it cleans up or reallocates memory. // The class uses the actual array provided; it does not copy the data // from the suppled array. If save 0, the array must have been allocated // with new[] not malloc. void SetArray(unsigned char* array, vtkIdType size, int save); void SetVoidArray(void *array, vtkIdType size, int save) { this->SetArray(static_cast<unsigned char *>(array), size, save); } // Description: // Returns a new vtkBitArrayIterator instance. vtkArrayIterator* NewIterator(); // Description: // Return the indices where a specific value appears. virtual vtkIdType LookupValue(vtkVariant value); virtual void LookupValue(vtkVariant value, vtkIdList* ids); vtkIdType LookupValue(int value); void LookupValue(int value, vtkIdList* ids); // Description: // Tell the array explicitly that the data has changed. // This is only necessary to call when you modify the array contents // without using the array's API (i.e. you retrieve a pointer to the // data and modify the array contents). You need to call this so that // the fast lookup will know to rebuild itself. Otherwise, the lookup // functions will give incorrect results. virtual void DataChanged(); // Description: // Delete the associated fast lookup data structure on this array, // if it exists. The lookup will be rebuilt on the next call to a lookup // function. virtual void ClearLookup(); protected: vtkBitArray(vtkIdType numComp=1); ~vtkBitArray(); unsigned char *Array; // pointer to data unsigned char *ResizeAndExtend(vtkIdType sz); // function to resize data int TupleSize; //used for data conversion double *Tuple; int SaveUserArray; private: // hide superclass' DeepCopy() from the user and the compiler void DeepCopy(vtkDataArray &da) {this->vtkDataArray::DeepCopy(&da);} private: vtkBitArray(const vtkBitArray&); // Not implemented. void operator=(const vtkBitArray&); // Not implemented. //BTX vtkBitArrayLookup* Lookup; void UpdateLookup(); //ETX }; inline void vtkBitArray::SetNumberOfValues(vtkIdType number) { this->Allocate(number); this->MaxId = number - 1; this->DataChanged(); } inline void vtkBitArray::SetValue(vtkIdType id, int value) { if (value) { this->Array[id/8] = static_cast<unsigned char>( this->Array[id/8] | (0x80 >> id%8)); } else { this->Array[id/8] = static_cast<unsigned char>( this->Array[id/8] & (~(0x80 >> id%8))); } this->DataChanged(); } inline void vtkBitArray::InsertValue(vtkIdType id, int i) { if ( id >= this->Size ) { this->ResizeAndExtend(id+1); } if (i) { this->Array[id/8] = static_cast<unsigned char>( this->Array[id/8] | (0x80 >> id%8)); } else { this->Array[id/8] = static_cast<unsigned char>( this->Array[id/8] & (~(0x80 >> id%8))); } if ( id > this->MaxId ) { this->MaxId = id; } this->DataChanged(); } inline void vtkBitArray::SetVariantValue(vtkIdType id, vtkVariant value) { this->SetValue(id, value.ToInt()); } inline vtkIdType vtkBitArray::InsertNextValue(int i) { this->InsertValue (++this->MaxId,i); this->DataChanged(); return this->MaxId; } inline void vtkBitArray::Squeeze() {this->ResizeAndExtend (this->MaxId+1);} #endif

nigel@vannevartech.com

90085b5de867470001ca4003626492aa79e5ee17

70c1fdc0a0206e7e869635efa222518d502f29f5

/tree/subordinates.cpp

b4a04491a23e6d93904bfad2c4fba0d877c56b64

no_license

AndyLi23/cses

6f87fa82017f2b1396c9ea1641b7dad85122d85f

4c0ccf82b89b144b6badb29ac15f4c1633fbc159

refs/heads/master

UTF-8

C++

cpp

#include <bits/stdc++.h> using namespace std; #define FOR(i, n) for(int (i) = 0 ; (i) < (n); ++(i)) #define FOR2(i, a, b) for(int (i) = (a); (i) < (b); ++(i)) #define FOR2R(i, b, a) for(int (i) = (b); (i) >= (a); --(i)) #define ll long long #define pb push_back int N, dp[200005], temp; vector<int> adj[200005]; int dfs(int src) { int sum = 0; for(auto c : adj[src]) { sum += dfs(c); } dp[src] = sum; return sum + 1; } int main() { ios::sync_with_stdio(0); cin.tie(0); //use cin >> and cout << //run local: g++ -std=c++11 -O2 -Wall task.cpp -o a cin >> N; FOR(i, N-1) { cin >> temp; adj[temp].push_back(i+2); } dfs(1); FOR2(i, 1, N+1) { cout << dp[i] << " "; } }

andyliqy@gmail.com

3e160237969fb0f9af72ac627bacd4c29e7a8098

58fbf85bc2dda72606c01cd2cd191bc0bc9fa7c2

/Source/Army/Public/Operation/ArmyFacsimileOperation.h

74a6195d2383a32da86c213fac53536bbf7f0f73

no_license

myl2232/ArmyEngineSimulation

497d2affb2786af9aa0a0295cf98cc4377b87ca4

353f3ec93cb352d49ce95825bb2ffdcc678119cf

refs/heads/master

UTF-8

C++

h

#pragma once #include "ArmyOperation.h" class FArmyFacsimileOperation : public FArmyOperation { public: FArmyFacsimileOperation(EModelType InBelongModel); virtual ~FArmyFacsimileOperation() {} //~ Begin IArmyDrawHelper Interface virtual void DrawHUD(class UArmyEditorViewportClient* InViewPortClient, FViewport* ViewPort, const FSceneView* View, FCanvas* Canvas) override; virtual void BeginOperation(XRArgument InArg /* = XRArgument() */) override; virtual void EndOperation() override; virtual void Tick() override; virtual bool InputKey(class UArmyEditorViewportClient* InViewPortClient, class FViewport* InViewPort, FKey Key, EInputEvent Event) override; void ShowInputScaleWindow(); /** 设置比例尺 */ void SetFacsimileScale(int32 InScale); private: int32 CurrentState; FVector2D FacsimileStartPos; FVector2D FacsimileEndPos; TSharedPtr<class SArmyEditableNumberBox> ENB_ScaleValue; };

153101862@qq.com

943e8c302a43a8030047d7f7c3e2006477bcda7a

f51b3b7f6a5110a704d5bd4e7920fc675a75f2bd

/src/lang/builtins/transforms/tile.cpp

e27d08d28f82a9ee5393867bf9f56f8e96f46bd0

permissive

v-dobrev/occa

6857905566e39334d47ff2efa6a8e5be9a085cde

58e47f5ccf0d87f5b91e6851b2d74a9456c46b2c

refs/heads/master

MIT

UTF-8

C++

cpp

/* The MIT License (MIT) * * Copyright (c) 2014-2018 David Medina and Tim Warburton * * Permission is hereby granted, free of charge, to any person obtaining a copy * of this software and associated documentation files (the "Software"), to deal * in the Software without restriction, including without limitation the rights * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell * copies of the Software, and to permit persons to whom the Software is * furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included in all * copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE */ #include <occa/lang/exprNode.hpp> #include <occa/lang/mode/oklForStatement.hpp> #include <occa/lang/variable.hpp> #include <occa/lang/builtins/types.hpp> #include <occa/lang/builtins/transforms/tile.hpp> #include <occa/lang/builtins/transforms/replacer.hpp> namespace occa { namespace lang { namespace transforms { tile::tile() { validStatementTypes = statementType::for_; } statement_t* tile::transformStatement(statement_t &smnt) { forStatement &forSmnt = (forStatement&) smnt; attributeTokenMap::iterator it = forSmnt.attributes.find("tile"); if (it == forSmnt.attributes.end()) { return &smnt; } attributeToken_t &attr = it->second; exprNode &tileSize = *(attr.args[0].expr); okl::oklForStatement oklForSmnt(forSmnt, "@tile"); if (!oklForSmnt.isValid()) { return NULL; } // Create the block and inner-block for-loops forStatement &blockForSmnt = *(new forStatement(forSmnt.up, forSmnt.source)); forStatement &innerForSmnt = *(new forStatement(&blockForSmnt, forSmnt.source)); blockForSmnt.add(innerForSmnt); // Rename the block interator variable_t &iter = *(oklForSmnt.iterator); variable_t &blockIter = iter.clone(); blockIter.name() = "_occa_tiled_" + iter.name(); blockForSmnt.scope.add(blockIter); setupNewForStatements(attr, oklForSmnt, blockIter, blockForSmnt, innerForSmnt); setupBlockForStatement(oklForSmnt, tileSize, blockIter, blockForSmnt, innerForSmnt); setupInnerForStatement(oklForSmnt, tileSize, blockIter, blockForSmnt, innerForSmnt); setupCheckStatement(attr, oklForSmnt, blockIter, blockForSmnt, innerForSmnt); return &blockForSmnt; } void tile::setupNewForStatements(attributeToken_t &attr, okl::oklForStatement &oklForSmnt, variable_t &blockIter, forStatement &blockForSmnt, forStatement &innerForSmnt) { // Add @tile attributes const int attrArgCount = (int) attr.args.size(); if (attrArgCount > 1) { attributeTokenMap &blockAttrs = attr.args[1].attributes; blockForSmnt.attributes.insert(blockAttrs.begin(), blockAttrs.end()); if (attrArgCount > 2) { attributeTokenMap &innerAttrs = attr.args[2].attributes; innerForSmnt.attributes.insert(innerAttrs.begin(), innerAttrs.end()); } } // Remove @tile to prevent recursive updates innerForSmnt.attributes.erase("tile"); forStatement &forSmnt = oklForSmnt.forSmnt; innerForSmnt.swap(forSmnt); // Setup initial statements blockForSmnt.setLoopStatements(forSmnt.init, forSmnt.check, NULL); innerForSmnt.setLoopStatements(NULL, NULL, forSmnt.update); forSmnt.setLoopStatements(NULL, NULL, NULL); // Replace instances of x with _occa_tiled_x replaceVariables(*blockForSmnt.init, *oklForSmnt.iterator, blockIter); replaceVariables(*blockForSmnt.check, *oklForSmnt.iterator, blockIter); } void tile::setupBlockForStatement(okl::oklForStatement &oklForSmnt, exprNode &tileSize, variable_t &blockIter, forStatement &blockForSmnt, forStatement &innerForSmnt) { /* for (x = START; x < END; x += INC) -> for (xTile = START; xTile < END; NULL ) -> for (xTile = START; xTile < END; xTile += (TILE * (INC))) */ exprNode &updateExpr = *(((expressionStatement*) innerForSmnt.update)->expr); opType_t opType = ((exprOpNode&) updateExpr).opType(); token_t *updateToken =updateExpr.startNode()->token; exprNode *updateSizeExpr = &tileSize; const binaryOperator_t *updateOp = &op::addEq; if (opType & (operatorType::leftDecrement | operatorType::rightDecrement)) { updateOp = &op::subEq; } else if (opType & (operatorType::addEq | operatorType::subEq)) { // INC exprNode *updateSize = ((binaryOpNode&) updateExpr).rightValue; // (INC) parenthesesNode updateInParen(updateToken, *updateSize); // TILE * (INC) binaryOpNode mult(updateToken, op::mult, tileSize, updateInParen); // (TILE * (INC)) updateSizeExpr = new parenthesesNode(updateToken, mult); if (opType & operatorType::subEq) { updateOp = &op::subEq; } } // VAR += (TILE * (INC)) variableNode varNode(updateToken, blockIter); exprNode *newUpdateExpr = new binaryOpNode(updateToken, *updateOp, varNode, *updateSizeExpr); if (updateSizeExpr != &tileSize) { // Delete (TILE * (INC)) if it was created delete updateSizeExpr; } blockForSmnt.update = new expressionStatement(&blockForSmnt, *newUpdateExpr, false); } void tile::setupInnerForStatement(okl::oklForStatement &oklForSmnt, exprNode &tileSize, variable_t &blockIter, forStatement &blockForSmnt, forStatement &innerForSmnt) { /* for (x = START; x < END; x += INC) -> for (NULL; NULL; x += INC) -> for (x = xTile; x < (xTile + TILE); x += INC) */ // Init variables variableDeclaration &decl = (((declarationStatement*) blockForSmnt.init) ->declarations[0]); token_t *initToken = decl.variable->source; variableNode iterNode(initToken, *oklForSmnt.iterator); variableNode blockIterNode(initToken, blockIter); // Check variables binaryOpNode &checkExpr = ((binaryOpNode&) *(((expressionStatement*) blockForSmnt.check)->expr)); token_t *checkToken = checkExpr.startNode()->token; // Update variables const operator_t &updateOp = ( ((binaryOpNode&) *(((expressionStatement*) blockForSmnt.update)->expr) ).op); const bool addUpdate = (updateOp.opType & operatorType::addEq); // Create init innerForSmnt.init = new declarationStatement(&innerForSmnt, initToken); variableDeclarationVector &decls = ( ((declarationStatement*) innerForSmnt.init) ->declarations ); decls.push_back( variableDeclaration(*oklForSmnt.iterator, *(blockIterNode.clone())) ); // Create check binaryOpNode checkValueNode(checkToken, addUpdate ? op::add : op::sub, blockIterNode, tileSize); parenthesesNode checkInParen(checkToken, checkValueNode); const bool varInLeft = oklForSmnt.checkValueOnRight; binaryOpNode &newCheckNode = *( new binaryOpNode( checkToken, (const binaryOperator_t&) checkExpr.op, varInLeft ? (exprNode&) iterNode : (exprNode&) checkInParen, varInLeft ? (exprNode&) checkInParen : (exprNode&) iterNode )); innerForSmnt.check = new expressionStatement(&innerForSmnt, newCheckNode); } void tile::setupCheckStatement(attributeToken_t &attr, okl::oklForStatement &oklForSmnt, variable_t &blockIter, forStatement &blockForSmnt, forStatement &innerForSmnt) { attributeArgMap::iterator it = attr.kwargs.find("check"); bool check = true; if (it != attr.kwargs.end()) { check = (bool) it->second.expr->evaluate(); } if (!check) { return; } // Check variables binaryOpNode &checkExpr = ((binaryOpNode&) *(((expressionStatement*) blockForSmnt.check)->expr)); token_t *checkToken = checkExpr.startNode()->token; const bool varInLeft = oklForSmnt.checkValueOnRight; // Make ifStatement ifStatement &ifSmnt = *(new ifStatement(&innerForSmnt, checkToken)); innerForSmnt.swap(ifSmnt); innerForSmnt.scope.swap(ifSmnt.scope); innerForSmnt.add(ifSmnt); // Get global check token_t *iterToken = (varInLeft ? checkExpr.leftValue->token : checkExpr.rightValue->token); variableNode iterNode(iterToken, *oklForSmnt.iterator); binaryOpNode &newCheckNode = *( new binaryOpNode( checkExpr.token, (const binaryOperator_t&) checkExpr.op, varInLeft ? (exprNode&) iterNode : *(checkExpr.leftValue), varInLeft ? (exprNode&) *(checkExpr.rightValue) : (exprNode&) iterNode )); ifSmnt.setCondition(new expressionStatement(&ifSmnt, newCheckNode, false)); } bool applyTileTransforms(statement_t &smnt) { tile tileTransform; return tileTransform.apply(smnt); } } } }

dmed256@gmail.com

3756483958082d4efd2166a5d8f991a257f009b3

eda637eabeb69c5ab1118421b53240ead191917c

/sds알고리즘 특강/5일차/조약돌 꺼내기(sol).cpp

c463dee108cec2e17f2dd7e85323282c943db4c8

no_license

seungchulee/baekjoon

bce7cf5d4e354c744fbe8a7168e4c50f60bfb358

520f33dc48035a2348b42215a9cebf5bfa06524b

refs/heads/master

UTF-8

C++

cpp

#include <stdio.h> int gaesu[51]; int main(void) { int M, K; scanf("%d", &M); int who = 0; for (int i = 0; i < M; i++) { scanf("%d", &gaesu[i]); who += gaesu[i]; } scanf("%d", &K); if (M == 1 || K==1) printf("1.0"); else { double whonum = 0.0; for (int i = 0; i < M; i++) { int k = K; int ja = gaesu[i]; int mo = who; if (gaesu[i] < K) continue; double num = (double)ja / (double)mo; while (k>1) { ja -= 1; mo -= 1; k--; num *= (double)ja / (double)mo; } // printf("!%.15lf\n", num); whonum += num; } printf("%.15lf", whonum); } }

noreply@github.com

2430b1ec358eb5b946d7ac14b066074c7491392d

0c4bd1b977cc714a8a6b2839f51c4247ecfd32b1

/C++/miniNN/util.h

b0b6484b5f1b014ca43160112e7720641e56a53f

no_license

ishine/neuralLOGIC

281d498b40159308815cee6327e6cf79c9426b16

3eb3b9980e7f7a7d87a77ef40b1794fb5137c459

refs/heads/master

UTF-8

C++

h

#ifndef UTIL_H_ #define UTIL_H_ #include <sstream> #include <iostream> #include <vector> void usage(void **argtable, const char *progname) { FILE *fp = stdout; fprintf(fp, "Usage: %s ", progname); arg_print_syntaxv(fp, argtable, "\n"); arg_print_glossary(fp, argtable, " %-50s %s\n"); } template<class T> std::string vectorToString(const std::vector<T>& v) { std::stringstream ss; for (size_t i = 0; i < v.size(); ++i) { if (i > 0) { ss << " "; } ss << v[i]; } return ss.str(); } template<class T> inline std::string to_string(const T& t) { std::stringstream ss; ss << t; return ss.str(); } void progress(const size_t iter, const size_t corpus_size, const size_t speed, const bool force = false) { const size_t true_iter = iter % corpus_size; if (true_iter > 0 && true_iter % speed == 0) { std::cerr << "."; std::cerr.flush(); } if ((true_iter > 0 && true_iter % (50 * speed) == 0) != (force)) { std::cerr << "[" << iter % corpus_size << "]" << std::endl; std::cerr.flush(); } } template<class T> void printVector(const std::vector<T>& v, const double threshold=0.5, const bool verbose=false) { for (size_t i = 0; i < v.size(); ++i) { if (i > 0) { std::cout << " "; } std::cout << (v.at(i) > threshold); if (verbose) std::cout << " (" << v.at(i) << ")"; } std::cout << std::endl; } #endif /* UTIL_H_ */

the.new.horizon@outlook.com

44570cedd0643e15645a3b7e31ad353e807bb66a

441036d7bf7b6b17bb478dd8194df27a9ac3dc42

/lib/int128.h

4a3508e5f72af0243bf29380e0f7cec4b535fe4a

permissive

zjl410091917/int128

d2415cb42003f4a85c1b9b96dc6c23082c88e3c2

c11df72e0cc735acb462b13d12d8bcad7aa9ebfb

refs/heads/main

UTF-8

C++

h

// Protocol Buffers - Google's data interchange format // Copyright 2008 Google Inc. All rights reserved. // https://developers.google.com/protocol-buffers/ // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are // met: // // * Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // * Redistributions in binary form must reproduce the above // copyright notice, this list of conditions and the following disclaimer // in the documentation and/or other materials provided with the // distribution. // * Neither the name of Google Inc. nor the names of its // contributors may be used to endorse or promote products derived from // this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. #ifndef GOOGLE_PROTOBUF_STUBS_INT128_H_ #define GOOGLE_PROTOBUF_STUBS_INT128_H_ #include <iosfwd> #include <cstdint> #include <string> typedef int8_t int8; typedef int16_t int16; typedef int32_t int32; typedef int64_t int64; typedef uint8_t uint8; typedef uint16_t uint16; typedef uint32_t uint32; typedef uint64_t uint64; struct uint128_pod; // An unsigned 128-bit integer type. Thread-compatible. class uint128 { public: uint128(); // Sets to 0, but don't trust on this behavior. uint128(uint64 top, uint64 bottom); #ifndef SWIG uint128(int bottom); uint128(uint32 bottom); // Top 96 bits = 0 #endif uint128(uint64 bottom); // hi_ = 0 uint128(const uint128_pod &val); // Trivial copy constructor, assignment operator and destructor. void Initialize(uint64 top, uint64 bottom); std::string toString(); // Arithmetic operators. uint128 &operator+=(const uint128 &b); uint128 &operator-=(const uint128 &b); uint128 &operator*=(const uint128 &b); // Long division/modulo for uint128. uint128 &operator/=(const uint128 &b); uint128 &operator%=(const uint128 &b); uint128 operator++(int); uint128 operator--(int); uint128 &operator<<=(int); uint128 &operator>>=(int); uint128 &operator&=(const uint128 &b); uint128 &operator|=(const uint128 &b); uint128 &operator^=(const uint128 &b); uint128 &operator++(); uint128 &operator--(); friend uint64 Uint128Low64(const uint128 &v); friend uint64 Uint128High64(const uint128 &v); // We add "std::" to avoid including all of port.h. friend std::ostream &operator<<(std::ostream &o, const uint128 &b); private: static void DivModImpl(uint128 dividend, uint128 divisor, uint128 *quotient_ret, uint128 *remainder_ret); // Little-endian memory order optimizations can benefit from // having lo_ first, hi_ last. // See util/endian/endian.h and Load128/Store128 for storing a uint128. uint64 lo_; uint64 hi_; // Not implemented, just declared for catching automatic type conversions. uint128(uint8); uint128(uint16); uint128(float v); uint128(double v); }; // This is a POD form of uint128 which can be used for static variables which // need to be operated on as uint128. struct uint128_pod { // Note: The ordering of fields is different than 'class uint128' but the // same as its 2-arg constructor. This enables more obvious initialization // of static instances, which is the primary reason for this struct in the // first place. This does not seem to defeat any optimizations wrt // operations involving this struct. uint64 hi; uint64 lo; }; extern const uint128_pod kuint128max; // allow uint128 to be logged extern std::ostream &operator<<(std::ostream &o, const uint128 &b); // Methods to access low and high pieces of 128-bit value. // Defined externally from uint128 to facilitate conversion // to native 128-bit types when compilers support them. inline uint64 Uint128Low64(const uint128 &v) { return v.lo_; } inline uint64 Uint128High64(const uint128 &v) { return v.hi_; } // TODO: perhaps it would be nice to have int128, a signed 128-bit type? // -------------------------------------------------------------------------- // Implementation details follow // -------------------------------------------------------------------------- inline bool operator==(const uint128 &lhs, const uint128 &rhs) { return (Uint128Low64(lhs) == Uint128Low64(rhs) && Uint128High64(lhs) == Uint128High64(rhs)); } inline bool operator!=(const uint128 &lhs, const uint128 &rhs) { return !(lhs == rhs); } inline uint128::uint128() : lo_(0), hi_(0) {} inline uint128::uint128(uint64 top, uint64 bottom) : lo_(bottom), hi_(top) { } inline uint128::uint128(const uint128_pod &v) : lo_(v.lo), hi_(v.hi) {} inline uint128::uint128(uint64 bottom) : lo_(bottom), hi_(0) {} #ifndef SWIG inline uint128::uint128(uint32 bottom) : lo_(bottom), hi_(0) { } inline uint128::uint128(int bottom) : lo_(bottom), hi_(static_cast<int64>((bottom < 0) ? -1 : 0)) {} #endif inline void uint128::Initialize(uint64 top, uint64 bottom) { hi_ = top; lo_ = bottom; } // Comparison operators. #define CMP128(op) \ inline bool operator op(const uint128 &lhs, const uint128 &rhs) \ { \ return (Uint128High64(lhs) == Uint128High64(rhs)) ? (Uint128Low64(lhs) op Uint128Low64(rhs)) : (Uint128High64(lhs) op Uint128High64(rhs)); \ } CMP128(<) CMP128(>) CMP128(>=) CMP128(<=) #undef CMP128 // Unary operators inline uint128 operator-(const uint128 &val) { const uint64 hi_flip = ~Uint128High64(val); const uint64 lo_flip = ~Uint128Low64(val); const uint64 lo_add = lo_flip + 1; if (lo_add < lo_flip) { return uint128(hi_flip + 1, lo_add); } return uint128(hi_flip, lo_add); } inline bool operator!(const uint128 &val) { return !Uint128High64(val) && !Uint128Low64(val); } // Logical operators. inline uint128 operator~(const uint128 &val) { return uint128(~Uint128High64(val), ~Uint128Low64(val)); } #define LOGIC128(op) \ inline uint128 operator op(const uint128 &lhs, const uint128 &rhs) \ { \ return uint128(Uint128High64(lhs) op Uint128High64(rhs), \ Uint128Low64(lhs) op Uint128Low64(rhs)); \ } LOGIC128(|) LOGIC128(&) LOGIC128(^) #undef LOGIC128 #define LOGICASSIGN128(op) \ inline uint128 &uint128::operator op(const uint128 &other) \ { \ hi_ op other.hi_; \ lo_ op other.lo_; \ return *this; \ } LOGICASSIGN128(|=) LOGICASSIGN128(&=) LOGICASSIGN128(^=) #undef LOGICASSIGN128 // Shift operators. inline uint128 operator<<(const uint128 &val, int amount) { // uint64 shifts of >= 64 are undefined, so we will need some special-casing. if (amount < 64) { if (amount == 0) { return val; } uint64 new_hi = (Uint128High64(val) << amount) | (Uint128Low64(val) >> (64 - amount)); uint64 new_lo = Uint128Low64(val) << amount; return uint128(new_hi, new_lo); } else if (amount < 128) { return uint128(Uint128Low64(val) << (amount - 64), 0); } else { return uint128(0, 0); } } inline uint128 operator>>(const uint128 &val, int amount) { // uint64 shifts of >= 64 are undefined, so we will need some special-casing. if (amount < 64) { if (amount == 0) { return val; } uint64 new_hi = Uint128High64(val) >> amount; uint64 new_lo = (Uint128Low64(val) >> amount) | (Uint128High64(val) << (64 - amount)); return uint128(new_hi, new_lo); } else if (amount < 128) { return uint128(0, Uint128High64(val) >> (amount - 64)); } else { return uint128(0, 0); } } inline uint128 &uint128::operator<<=(int amount) { // uint64 shifts of >= 64 are undefined, so we will need some special-casing. if (amount < 64) { if (amount != 0) { hi_ = (hi_ << amount) | (lo_ >> (64 - amount)); lo_ = lo_ << amount; } } else if (amount < 128) { hi_ = lo_ << (amount - 64); lo_ = 0; } else { hi_ = 0; lo_ = 0; } return *this; } inline uint128 &uint128::operator>>=(int amount) { // uint64 shifts of >= 64 are undefined, so we will need some special-casing. if (amount < 64) { if (amount != 0) { lo_ = (lo_ >> amount) | (hi_ << (64 - amount)); hi_ = hi_ >> amount; } } else if (amount < 128) { lo_ = hi_ >> (amount - 64); hi_ = 0; } else { lo_ = 0; hi_ = 0; } return *this; } inline uint128 operator+(const uint128 &lhs, const uint128 &rhs) { return uint128(lhs) += rhs; } inline uint128 operator-(const uint128 &lhs, const uint128 &rhs) { return uint128(lhs) -= rhs; } inline uint128 operator*(const uint128 &lhs, const uint128 &rhs) { return uint128(lhs) *= rhs; } inline uint128 operator/(const uint128 &lhs, const uint128 &rhs) { return uint128(lhs) /= rhs; } inline uint128 operator%(const uint128 &lhs, const uint128 &rhs) { return uint128(lhs) %= rhs; } inline uint128 &uint128::operator+=(const uint128 &b) { hi_ += b.hi_; uint64 lolo = lo_ + b.lo_; if (lolo < lo_) ++hi_; lo_ = lolo; return *this; } inline uint128 &uint128::operator-=(const uint128 &b) { hi_ -= b.hi_; if (b.lo_ > lo_) --hi_; lo_ -= b.lo_; return *this; } inline uint128 &uint128::operator*=(const uint128 &b) { uint64 a96 = hi_ >> 32; uint64 a64 = hi_ & 0xffffffffu; uint64 a32 = lo_ >> 32; uint64 a00 = lo_ & 0xffffffffu; uint64 b96 = b.hi_ >> 32; uint64 b64 = b.hi_ & 0xffffffffu; uint64 b32 = b.lo_ >> 32; uint64 b00 = b.lo_ & 0xffffffffu; // multiply [a96 .. a00] x [b96 .. b00] // terms higher than c96 disappear off the high side // terms c96 and c64 are safe to ignore carry bit uint64 c96 = a96 * b00 + a64 * b32 + a32 * b64 + a00 * b96; uint64 c64 = a64 * b00 + a32 * b32 + a00 * b64; this->hi_ = (c96 << 32) + c64; this->lo_ = 0; // add terms after this one at a time to capture carry *this += uint128(a32 * b00) << 32; *this += uint128(a00 * b32) << 32; *this += a00 * b00; return *this; } inline uint128 uint128::operator++(int) { uint128 tmp(*this); *this += 1; return tmp; } inline uint128 uint128::operator--(int) { uint128 tmp(*this); *this -= 1; return tmp; } inline uint128 &uint128::operator++() { *this += 1; return *this; } inline uint128 &uint128::operator--() { *this -= 1; return *this; } #endif // GOOGLE_PROTOBUF_STUBS_INT128_H_

jinlong.zhang@centurygame.com

ae87739c045ea0c8bc03b31469eb4d63ff4fb84a

c2b161ce52e127f7036882f0ffa523f520dc1c87

/programs/agents/agent-2-0.cpp

20f8987344433330692e870d7ac0f279127a0ab7

no_license

dmosher42/cosmos-core

9991e7268044fa3b139716a48e3bf3c707ea3422

625d1de84eded5ff69b2870a9cbf57c1a6476f89

refs/heads/master

UTF-8

C++

cpp

/******************************************************************** * Copyright (C) 2015 by Interstel Technologies, Inc. * and Hawaii Space Flight Laboratory. * * This file is part of the COSMOS/core that is the central * module for COSMOS. For more information on COSMOS go to * <http://cosmos-project.com> * * The COSMOS/core software is licenced under the * GNU Lesser General Public License (LGPL) version 3 licence. * * You should have received a copy of the * GNU Lesser General Public License * If not, go to <http://www.gnu.org/licenses/> * * COSMOS/core is free software: you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public License * as published by the Free Software Foundation, either version 3 of * the License, or (at your option) any later version. * * COSMOS/core is distributed in the hope that it will be useful, but * WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * Refer to the "licences" folder for further information on the * condititons and terms to use this software. ********************************************************************/ /*! \file agent.cpp * \brief Agent control program source */ //! \ingroup general //! \defgroup agent_client Agent control program //! This program allows communication with any of the Agents on the local network. //! With it you can: //! - list available Agents //! - acquire the request list of specific Agents //! - command specific Agents //! - monitor Agent traffic #include "support/configCosmos.h" #include <stdlib.h> #include "agent/agentclass.h" #include "support/jsonlib.h" #include "physics/physicslib.h" #include "support/datalib.h" #include "sys/stat.h" #include "limits.h" #include <iostream> const int REQUEST_WAIT_TIME = 2; const int SERVER_WAIT_TIME = 6; string output; string node_name = ""; string agent_name = ""; int main(int argc, char *argv[]) { int nbytes; beatstruc cbeat; Agent *agent; // dont' print debug messages //agent->debug_level = 0; agent = new Agent(); if (agent->cinfo == nullptr) { fprintf(agent->get_debug_fd(), "%16.10f %s Failed to start Agent %s on Node %s Dated %s : %s\n",currentmjd(), mjd2iso8601(currentmjd()).c_str(), agent->getAgent().c_str(), agent->getNode().c_str(), utc2iso8601(data_ctime(argv[0])).c_str(), cosmos_error_string(NODE_ERROR_NODE).c_str()); exit(NODE_ERROR_NODE); } // check command line arguments switch (argc) { case 1: { printf("Usage: agent [ list | dump [soh, beat, ###] | node_name agent_name \"request [ arguments ]\" ]\n"); exit(1); } break; case 2: case 3: case 4: case 5: // agent dump request if (!strcmp(argv[1],"dump")) { double lmjd = 0., dmjd; string channel; Agent::AgentMessage message_type; Agent::messstruc message; int i; locstruc loc; // JIMNOTE: this block will never be entered switch(argc) { case 5: agent_name = argv[4]; case 4: node_name = argv[3]; case 3: channel = argv[2]; if (channel == "soh") { message_type = Agent::AgentMessage::SOH; } else if (channel == "beat") { message_type = Agent::AgentMessage::BEAT; } else if (channel == "request") { message_type = Agent::AgentMessage::REQUEST; } else if (channel == "response") { message_type = Agent::AgentMessage::RESPONSE; } else { message_type = (Agent::AgentMessage)atoi(channel.c_str()); } break; case 2: channel.clear(); message_type = Agent::AgentMessage::ALL; break; } while (1) { int32_t iretn; if ((iretn=agent->readring(message, message_type, 1., Agent::Where::TAIL)) > 0) { Agent::AgentMessage message_type_read = (Agent::AgentMessage)iretn; // Skip if either not Agent::AgentMessage::ALL, or not desired AGENT_MESSAGE if (!channel.empty() && message_type != message_type_read) { continue; } if (!node_name.empty() && node_name != message.meta.beat.node) { continue; } if (!agent_name.empty() && agent_name != message.meta.beat.proc) { continue; } switch (message_type_read) { case Agent::AgentMessage::SOH: printf("[SOH]"); break; case Agent::AgentMessage::BEAT: printf("[BEAT]"); break; case Agent::AgentMessage::REQUEST: printf("[REQUEST]"); break; case Agent::AgentMessage::RESPONSE: printf("[RESPONSE]"); break; default: printf("[%d]",message_type_read); break; } printf("%.15g:[%s:%s][%s:%u](%lu:%lu:%zu)\n",message.meta.beat.utc, message.meta.beat.node, message.meta.beat.proc, message.meta.beat.addr, message.meta.beat.port, message.jdata.size(), message.adata.size(), message.bdata.size()); printf("%s\n",message.jdata.c_str()); if (message_type_read < Agent::AgentMessage::BINARY) { if (!channel.empty()) { printf("%s\n",message.adata.c_str()); } } if ((channel=="info") && message_type_read == Agent::AgentMessage::TRACK) { if (agent->cinfo->node.loc.utc > 0.) { if (lmjd > 0.) dmjd = 86400.*(agent->cinfo->node.loc.utc-lmjd); else dmjd = 0.; loc.pos.icrf.s = agent->cinfo->node.loc.pos.icrf.s; loc.pos.utc = agent->cinfo->node.loc.utc; pos_eci(&loc); printf("%16.15g %6.4g %s %8.3f %8.3f %8.3f %5.1f %5.1f %5.1f\n",agent->cinfo->node.loc.utc,dmjd,agent->cinfo->node.name,DEGOF(loc.pos.geod.s.lon),DEGOF(loc.pos.geod.s.lat),loc.pos.geod.s.h,agent->cinfo->node.phys.powgen,agent->cinfo->node.phys.powuse,agent->cinfo->node.phys.battlev); lmjd = agent->cinfo->node.loc.utc; } } if ((channel=="imu") && message_type_read == Agent::AgentMessage::IMU) { for (i=0; i<agent->cinfo->devspec.imu_cnt; i++) { if (agent->cinfo->agent[0].beat.utc > 0.) { if (lmjd > 0.) dmjd = 86400.*(agent->cinfo->agent[0].beat.utc-lmjd); else dmjd = 0.; printf("%.15g %.4g\n",loc.utc,dmjd); lmjd = agent->cinfo->agent[0].beat.utc; } } } } fflush(stdout); } //end infinite while loop break; } else if (!strcmp(argv[1],"list")) { size_t agent_count = 0; ElapsedTime et; agent->post(Agent::AgentMessage::REQUEST, "heartbeat"); COSMOS_SLEEP(.5); do { if (agent->agent_list.size() > agent_count) { for (size_t i=agent_count; i<agent->agent_list.size(); ++i) { beatstruc cbeat = agent->agent_list[i]; // NS1 //agent->send_request(cbeat,(char *)"getvalue {\"agent_pid\"}", output, REQUEST_WAIT_TIME); // NS2 -- works! agent->send_request(cbeat, "get_value {\"agent[0].pid\"}", output, REQUEST_WAIT_TIME); printf("[%lu] %.15g %s %s %s %hu %u\n",i,cbeat.utc,cbeat.node,cbeat.proc,cbeat.addr,cbeat.port,cbeat.bsz); printf("\t%s\n",output.c_str()); fflush(stdout); } agent_count = agent->agent_list.size(); } COSMOS_SLEEP(.1); } while (et.split() < SERVER_WAIT_TIME); exit(0); break; } else if (!strcmp(argv[1],"list_json")) { size_t agent_count = 0; ElapsedTime et; agent->post(Agent::AgentMessage::REQUEST, "heartbeat"); COSMOS_SLEEP(.1); printf("{\"agent_list\":["); do { if (agent->agent_list.size() > agent_count) { for (size_t i=agent_count; i<agent->agent_list.size(); ++i) { beatstruc cbeat = agent->agent_list[i]; // NS1 //agent->send_request(cbeat,(char *)"getvalue {\"agent_pid\"}", output, REQUEST_WAIT_TIME); // NS2 -- works! agent->send_request(cbeat, "get_value {\"agent[0].pid\"}", output, REQUEST_WAIT_TIME); if(i>0) printf(","); printf("{\"agent_proc\": \"%s\", ", cbeat.proc); printf("\"agent_utc\": %.15g, ", cbeat.utc); printf("\"agent_node\": \"%s\", ", cbeat.node); printf("\"agent_addr\": \"%s\", ", cbeat.addr); printf("\"agent_port\": %hu, ", cbeat.port); printf("\"agent_bsz\": %u, ", cbeat.bsz); // HANDLE RESPONSE OUTPUT FORMAT size_t status_pos; if((status_pos= output.find("[OK]") )!= string::npos){ if(output.at(0) == '{'){ if(status_pos - 1 >= 0 && output.at(status_pos - 1) == '}'){ printf("\"output\": %s,", output.substr(0, status_pos).c_str()); } else { printf("\"output\": %s,", output.c_str()); } } else { printf("\"output\": \"%s\",", output.substr(status_pos ).c_str()); } printf("\"status\": \"OK\"}"); } else if((status_pos = output.find("[NOK]") )!= string::npos){ printf("\"status\": \"NOK\"}"); } else { printf("\"output\": %s }", output.c_str()); } fflush(stdout); } fflush(stdout); agent_count = agent->agent_list.size(); } COSMOS_SLEEP(.1); } while (et.split() < SERVER_WAIT_TIME); printf("]}\n"); exit(0); break; } default: if (!strcmp(argv[1],"dump")) { double lmjd = 0., dmjd; string channel; Agent::AgentMessage message_type; Agent::messstruc message; string header; int i; locstruc loc; if(argc == 3) { channel = argv[2]; if (channel == "soh") { message_type = Agent::AgentMessage::SOH; } else { if (channel == "beat") { message_type = Agent::AgentMessage::BEAT; } else { message_type = (Agent::AgentMessage)atoi(channel.c_str()); } } } else { channel.clear(); message_type = Agent::AgentMessage::ALL; } while (1) { int32_t iretn; if ((iretn=agent->readring(message, Agent::AgentMessage::ALL, 1., Agent::Where::TAIL)) > 0) { Agent::AgentMessage message_type_read = (Agent::AgentMessage)iretn; // Skip if either not Agent::AgentMessage::ALL, or not desired AGENT_MESSAGE if (!channel.empty() && message_type != message_type_read) { continue; } header.resize(message.meta.jlength); if (message_type_read < Agent::AgentMessage::BINARY) { // NS1 memcpy(&header[0], message.adata.data(), message.meta.jlength); json_clear_cosmosstruc(JSON_STRUCT_NODE, agent->cinfo); json_clear_cosmosstruc(JSON_STRUCT_DEVICE, agent->cinfo); json_parse(message.adata.c_str(), agent->cinfo); // NS2 } else { memcpy(&header[0], message.bdata.data(), message.meta.jlength); } switch (message_type_read) { case Agent::AgentMessage::SOH: printf("[SOH]"); break; case Agent::AgentMessage::BEAT: printf("[BEAT]"); break; case Agent::AgentMessage::REQUEST: printf("[REQUEST]"); break; case Agent::AgentMessage::RESPONSE: printf("[RESPONSE]"); break; default: printf("[%d]",message_type_read); break; } printf("[%d] %.15g %s %s %s %hu %u\n",i,message.meta.beat.utc,message.meta.beat.node,message.meta.beat.proc,message.meta.beat.addr,message.meta.beat.port,message.meta.beat.bsz); if (message_type_read < Agent::AgentMessage::BINARY && !channel.empty()) { printf("%s\n",message.adata.c_str()); } if ((channel=="info") && message_type_read == Agent::AgentMessage::TRACK) { if (agent->cinfo->node.loc.utc > 0.) { if (lmjd > 0.) dmjd = 86400.*(agent->cinfo->node.loc.utc-lmjd); else dmjd = 0.; loc.pos.icrf.s = agent->cinfo->node.loc.pos.icrf.s; loc.pos.utc = agent->cinfo->node.loc.utc; pos_eci(&loc); printf("%16.15g %6.4g %s %8.3f %8.3f %8.3f %5.1f %5.1f %5.1f\n",agent->cinfo->node.loc.utc,dmjd,agent->cinfo->node.name,DEGOF(loc.pos.geod.s.lon),DEGOF(loc.pos.geod.s.lat),loc.pos.geod.s.h,agent->cinfo->node.phys.powgen,agent->cinfo->node.phys.powuse,agent->cinfo->node.phys.battlev); lmjd = agent->cinfo->node.loc.utc; } } if ((channel=="imu") && message_type_read == Agent::AgentMessage::IMU) { for (i=0; i<agent->cinfo->devspec.imu_cnt; i++) { if (agent->cinfo->agent[0].beat.utc > 0.) { if (lmjd > 0.) dmjd = 86400.*(agent->cinfo->agent[0].beat.utc-lmjd); else dmjd = 0.; printf("%.15g %.4g\n",loc.utc,dmjd); lmjd = agent->cinfo->agent[0].beat.utc; } } } } fflush(stdout); } //end infinite while loop } else { // cbeat = agent->find_agent(argv[1], argv[2], SERVER_WAIT_TIME); // if (cbeat.exists) if ((nbytes = agent->get_agent(argv[1], argv[2], SERVER_WAIT_TIME, cbeat)) > 0) { if(argc == 3) { nbytes = agent->send_request(cbeat, "help", std::ref(output), REQUEST_WAIT_TIME); printf("%s [%d]\n", output.c_str(), nbytes); } else { string request; request = argv[3]; for (size_t i=0; i<(size_t)argc-4; ++i) { request += " "; request += argv[i+4]; } nbytes = agent->send_request(cbeat,request.c_str(), output, REQUEST_WAIT_TIME); // printf("%s [%d]\n", output.c_str(), nbytes); // printf("{\"request_output\": %s, \"bytes\": %d }\n", output.c_str(), nbytes); // HANDLE RESPONSE OUTPUT FORMAT printf("{"); size_t status_pos; if((status_pos= output.find("[OK]") )!= string::npos){ if(output.at(0) == '{'){ if(status_pos - 1 >= 0 && output.at(status_pos - 1) == '}'){ printf("\"output\": %s,", output.substr(0, status_pos).c_str()); } else { printf("\"output\": %s,", output.c_str()); } } else { printf("\"output\": \"%s\",", output.substr(0,status_pos ).c_str()); } printf("\"status\": \"OK\"}\n"); } else if((status_pos = output.find("[NOK]") )!= string::npos){ printf("\"status\": \"NOK\"}\n"); } else { printf("\"output\": %s }\n", output.c_str()); } } } else { if (!nbytes){ fprintf(stderr,"node-agent pair [%s:%s] not found\n",argv[1],argv[2]); printf("{\"error\": \"node-agent pair [%s:%s] not found\" }\n",argv[1],argv[2]); } else printf("Error: %d\n", nbytes); } } } }

jim_lewis@hotmail.com

df0e75c34d981106db95b88c53ab048107aa75b8

ae9ff784b524610de9abebea61a59df1152c3aad

/CH07/01.cpp

21b70cf02fa821555814d24060c2081ca1ec4015

no_license

headmastersquall/Cpp

489ea7757d9b0a64b929fece3b1152121f69cdc8

daca75461ca00bb9f5af7550554e32d024d335d8

refs/heads/master

UTF-8

C++

cpp

/* * 01. Larges/Smallest Array Values * * Fill an array with user input, then show the smallest and largest values. */ #include <iostream> #include <string> using namespace std; int intPrompt(string prompt); void findAndShowSmallLarge(int [], int); int main() { const int NUMBER_COUNT = 10; const string PROMPT = "Enter a number: "; int numbers[NUMBER_COUNT]; for (int i = 0; i < NUMBER_COUNT; i++) { numbers[i] = intPrompt(PROMPT); } findAndShowSmallLarge(numbers, NUMBER_COUNT); return 0; } int intPrompt(const string prompt) { int value; cout << prompt; cin >> value; return value; } void findAndShowSmallLarge(int nums[], const int size) { int smallest = nums[0]; int largest = nums[0]; for (int i = 0; i < size; i++) { smallest = nums[i] < smallest ? nums[i] : smallest; largest = nums[i] > largest ? nums[i] : largest; } cout << "The largest number is: " << largest << endl; cout << "The smallest number is: " << smallest << endl; }

headmastersquall@hushmail.com

c91917191a0b92de284c3d2b7114944fb2e28560

5b8cb5332a9768161d2208ece834dba57431c63c

/SDL Game 2 - Master - Handout/ModuleTextures.cpp

1a216ced77c34a0f6500ec6f1827e556d45a7282

no_license

lowysole/master_exercises

c88befb21be4265970d254ee517be83d18d13720

5eb8dbc78b56b944530ad747bad1fbec4e3a346d

refs/heads/master

UTF-8

C++

cpp

#include "Globals.h" #include "Application.h" #include "ModuleRender.h" #include "ModuleTextures.h" #include "SDL/include/SDL.h" #include "SDL_image/include/SDL_image.h" #pragma comment( lib, "SDL_image/libx86/SDL2_image.lib" ) using namespace std; ModuleTextures::ModuleTextures() { } // Destructor ModuleTextures::~ModuleTextures() { IMG_Quit(); } // Called before render is available bool ModuleTextures::Init() { LOG("Init Image library"); bool ret = true; // load support for the PNG image format int flags = IMG_INIT_PNG; int init = IMG_Init(flags); if((init & flags) != flags) { LOG("Could not initialize Image lib. IMG_Init: %s", IMG_GetError()); ret = false; } return ret; } // Called before quitting bool ModuleTextures::CleanUp() { LOG("Freeing textures and Image library"); for(list<SDL_Texture*>::iterator it = textures.begin(); it != textures.end(); ++it) SDL_DestroyTexture(*it); textures.clear(); return true; } // Load new texture from file path SDL_Texture* const ModuleTextures::Load(const char* path) { SDL_Texture* texture = nullptr; SDL_Surface* surface = IMG_Load(path); if(surface == nullptr) { LOG("Could not load surface with path: %s. IMG_Load: %s", path, IMG_GetError()); } else { texture = SDL_CreateTextureFromSurface(App->renderer->renderer, surface); if(texture == nullptr) { LOG("Unable to create texture from surface! SDL Error: %s\n", SDL_GetError()); } else { textures.push_back(texture); } SDL_FreeSurface(surface); } return texture; } // Free texture from memory void ModuleTextures::Unload(SDL_Texture* texture) { for(list<SDL_Texture*>::iterator it = textures.begin(); it != textures.end(); ++it) { if(*it == texture) { SDL_DestroyTexture(*it); textures.erase(it); break; } } }

lowy.sole@gmail.com

9fa549d7c479e9418d7f48cb50f14396236411bc

c91ba4e746dc5b8f2dface963b4096dd721070fd

/cloudphoto/src/model/MoveFacePhotosRequest.cc

ab2ba117f0126dd59750145ec9bc9a204beed98f

permissive

IthacaDream/aliyun-openapi-cpp-sdk

fa9120604ca3af4fc48a5f9bf70ff10542103c3a

31a064d1568f59e0731485a1b0452cfd5d767e42

refs/heads/master

UTF-8

C++

cc

/* * Copyright 2009-2017 Alibaba Cloud All rights reserved. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ #include <alibabacloud/cloudphoto/model/MoveFacePhotosRequest.h> using namespace AlibabaCloud::CloudPhoto; using namespace AlibabaCloud::CloudPhoto::Model; MoveFacePhotosRequest::MoveFacePhotosRequest() : CloudPhotoRequest("MoveFacePhotos") {} MoveFacePhotosRequest::~MoveFacePhotosRequest() {} std::string MoveFacePhotosRequest::getLibraryId()const { return libraryId_; } void MoveFacePhotosRequest::setLibraryId(const std::string& libraryId) { libraryId_ = libraryId; setParameter("LibraryId", libraryId); } long MoveFacePhotosRequest::getTargetFaceId()const { return targetFaceId_; } void MoveFacePhotosRequest::setTargetFaceId(long targetFaceId) { targetFaceId_ = targetFaceId; setParameter("TargetFaceId", std::to_string(targetFaceId)); } std::vector<long> MoveFacePhotosRequest::getPhotoId()const { return photoId_; } void MoveFacePhotosRequest::setPhotoId(const std::vector<long>& photoId) { photoId_ = photoId; for(int i = 0; i!= photoId.size(); i++) setParameter("PhotoId."+ std::to_string(i), std::to_string(photoId.at(i))); } std::string MoveFacePhotosRequest::getStoreName()const { return storeName_; } void MoveFacePhotosRequest::setStoreName(const std::string& storeName) { storeName_ = storeName; setParameter("StoreName", storeName); } long MoveFacePhotosRequest::getSourceFaceId()const { return sourceFaceId_; } void MoveFacePhotosRequest::setSourceFaceId(long sourceFaceId) { sourceFaceId_ = sourceFaceId; setParameter("SourceFaceId", std::to_string(sourceFaceId)); }

haowei.yao@alibaba-inc.com

bc81c1cb857cd26b214a85033c6f9f7779b90f5e

adbc6eb4bdd5da47b4d35dd023d0a2e0505ed4e7

/src/ClassifiedObject.hh

e04382f5bf5e8cae0ce325bc74ade308b3aeab1d

permissive

michaeljones/alembic-fs

b57c10eed89fbff9ff22b30daf3cac4d97773dc8

765b51774e40b0a5656e9f59338539f5b11f3e4b

refs/heads/master

UTF-8

C++

hh

#ifndef ALEMBICFS_CLASSIFIEDOBJECT_HH #define ALEMBICFS_CLASSIFIEDOBJECT_HH #include "Types.hh" #include <Alembic/AbcCoreAbstract/All.h> #include <Alembic/AbcCoreHDF5/All.h> #include <Alembic/AbcGeom/All.h> class ClassifiedObject { public: enum Classification { kObject = 0, kProperties, kProperty }; public: ClassifiedObject( Alembic::AbcGeom::IObject _iObj, Classification _classification ) : iObj( _iObj ), classification( _classification ) {} ClassifiedObject( Alembic::AbcGeom::IObject _iObj, Classification _classification, PathSegments& _remainder ) : iObj( _iObj ), classification( _classification ), remainder( _remainder ) {} Alembic::AbcGeom::IObject iObj; Classification classification; PathSegments remainder; }; #endif // ALEMBICFS_CLASSIFIEDOBJECT_HH

m.pricejones@gmail.com

b2b484e3bede98c6b02a736b176f588ab9e87d89

9384a0dc5c52d3bf8a3307c1c5710acd103276f9

/GeeksForGeeks/RandomQuestions/headToTailOrdering2.cpp

efb1115167d670cc6734413c4dc3d91cc3352234

no_license

codeboy47/Competitive-Programming

c80deab0dc66b55de083a7faaab92f90577665fa

b1a8f3a5d3170f256d970e3103315e56fe4c3e45

refs/heads/master

UTF-8

C++

cpp

#include <iostream> #include <list> #include <string.h> #include <queue> #include <unordered_map> using namespace std; template<typename T> class graph{ public : int vertices; unordered_map<T, vector<T> > hash; graph() { } graph(int v){ vertices = v; } void addEdge(T u, T v){ hash[u].push_back(v); vertices = hash.size(); } bool dfsHelper(T src, unordered_map<T,bool> &visited, int count, int n){ visited[src] = true; //cout<<src<<" "; if(count == n){ return true; } if(hash.count(src) != 0){ for(int i = 0; i < hash[src].size(); i++){ //cout<<hash[src][i]<<" "; if(!visited[hash[src][i]]){ if(dfsHelper(hash[src][i],visited,count+1,n)){ return true; } } } } /* OR for(auto it = hash[src].begin(); it != hash[src].end(); it++){ if(!visited[*it]){ dfsHelper(*it,visited); } }*/ visited[src] = false; return false; } void dfs(int n){ unordered_map<T,bool> visited; for(auto it = hash.begin(); it != hash.end(); it++){ visited[it->first] = false; } bool ans, flag = false; for(auto it = hash.begin(); it != hash.end(); it++){ //cout<<it->first<<" "; if(!visited[it->first]){ ans = dfsHelper(it->first,visited,1,n); } if(ans){ cout<<"Head to tail ordering is possible."<<endl; flag = true; break; } } if(!flag){ cout<<"Head to tail ordering is not possible."<<endl; } } // Kahn’s algorithm for Topological Sorting // it uses bfs technique i.e. queue void topologicalSort(){ if(hash.size() == 0){ cout<<"Head to tail ordering is not possible."; return; } unordered_map<T,int> inDegree; for(auto it = hash.begin(); it != hash.end(); it++){ inDegree[it->first] = 0; } for(auto i = hash.begin(); i != hash.end(); i++){ for(auto it = hash[i->first].begin(); it != hash[i->first].end(); it++){ inDegree[*it]++; } } queue<T> q; for(auto it = hash.begin(); it != hash.end(); it++){ if(inDegree[it->first] == 0){ q.push(it->first); } } while(!q.empty()){ T front = q.front(); q.pop(); for(auto it = hash[front].begin(); it != hash[front].end(); it++){ inDegree[*it]--; if(inDegree[*it] == 0){ q.push(*it); } } } bool flag = true; for(auto it = hash.begin(); it != hash.end(); it++){ if(inDegree[it->first] != 0){ flag = false; cout<<"Head to tail ordering is not possible."; break; } } if(flag == true){ cout<<"Head to tail ordering is possible."; } } void gclear(){ for(auto it = hash.begin(); it != hash.end(); it++){ hash[it->first].clear(); } hash.clear(); } }; int main(){ vector<string> v; int t; cin>>t; while(t--){ int V; cin>>V; for(int i = 0; i < V; i++){ string s; cin>>s; v.push_back(s); } graph<string> g; for(int i = 0; i < V; i++){ int end = v[i].length(); for(int j = 0; j < V; j++){ if(i != j && v[i][end-1] == v[j][0]){ g.addEdge(v[i],v[j]); } } } g.dfs(V); //g.topologicalSort(); g.gclear(); v.clear(); } return 0; }

noreply@github.com

e0cca8c74151c83264b9e69513bd03e1107b82b2

a995091ae322b16728a5be9f1c551e413f57cfa9

/logdevice/server/locallogstore/RocksDBListener.h

0c365752aabad8fad4fb90b91fdad728488e5dae

permissive

ethio123/LogDevice

3fb387058eedee05c52fffd9b05384a093b3dd4a

f5083568dd295fb750ed39d2a336a22486bd106c

refs/heads/master

NOASSERTION

UTF-8

C++

h

/** * Copyright (c) 2017-present, Facebook, Inc. and its affiliates. * All rights reserved. * * This source code is licensed under the BSD-style license found in the * LICENSE file in the root directory of this source tree. */ #pragma once #include <queue> #include <folly/ThreadLocal.h> #include <rocksdb/listener.h> #include <rocksdb/version.h> #include "logdevice/common/configuration/Configuration.h" #include "logdevice/common/configuration/UpdateableConfig.h" #include "logdevice/common/stats/PerShardHistograms.h" #include "logdevice/common/stats/Stats.h" namespace facebook { namespace logdevice { /** * RocksDBListener gets notified by rocksdb about flushes and compactions. * We use it to collect stats about table files. * RocksDBTablePropertiesCollector collects: * - the histogram of the amount of data each log has in table file, * - the amount of data for each backlog duration in each table file; this * is used by RocksDBLocalLogStore to estimate the amount of space a * compaction can reclaim. * Note that rocksdb allows registering multiple listeners, and RocksDBListener * is not the only one used by logdevice. */ class RocksDBListener : public rocksdb::EventListener { public: RocksDBListener(StatsHolder* stats, size_t shard) : stats_(stats), shard_(shard) {} void OnFlushCompleted(rocksdb::DB* db, const rocksdb::FlushJobInfo& flush_job_info) override; void OnCompactionCompleted(rocksdb::DB* db, const rocksdb::CompactionJobInfo& ci) override; void OnTableFileCreated(const rocksdb::TableFileCreationInfo& info) override; private: StatsHolder* stats_; const size_t shard_; // TableFileCreationInfo is passed from OnTableFileCreated() callback to // flush and compaction callbacks through this queue. This is based on // the following assumptions: // - all file creation callbacks corresponding to a flush/compaction job // are called before the flush/compaction callback, // - they are called on the same thread, // - jobs on the same thread don't interleave. folly::ThreadLocal<std::queue<rocksdb::TableFileCreationInfo>> recently_created_files_; static bool isDataCF(const std::string& cf_name); void onJobCompleted(const std::string& cf_name, const std::vector<std::string>& paths, PerShardHistograms::size_histogram_t& file_size_hist, PerShardHistograms::size_histogram_t& log_run_length_hist); }; class RocksDBTablePropertiesCollector : public rocksdb::TablePropertiesCollector { public: // Backlog duration -> total size of records. using RetentionSizeMap = std::map<std::chrono::seconds, uint64_t>; explicit RocksDBTablePropertiesCollector( std::shared_ptr<Configuration> config, StatsHolder* stats) : config_(config), stats_(stats) {} rocksdb::Status AddUserKey(const rocksdb::Slice& key, const rocksdb::Slice& value, rocksdb::EntryType type, rocksdb::SequenceNumber seq, uint64_t file_size) override; rocksdb::Status Finish(rocksdb::UserCollectedProperties* properties) override; rocksdb::UserCollectedProperties GetReadableProperties() const override; const char* Name() const override; // Parses properties of the form "ld.bytes_with_retention.86400s" => "12345" // and adds them to the given map. static void extractRetentionSizeMap( const std::map<std::string, std::string>& table_properties, RetentionSizeMap& inout_map); private: enum class DataKind { PAYLOAD = 0, RECORD_HEADER, CSI, INDEX, OTHER, MAX, }; using DataKindNamesEnumMap = EnumMap<DataKind, std::string, DataKind::MAX>; friend class EnumMap<DataKind, std::string, DataKind::MAX>; std::shared_ptr<Configuration> config_; StatsHolder* stats_; logid_t current_log_ = LOGID_INVALID; uint64_t current_size_ = 0; SizeHistogram log_size_histogram_; RetentionSizeMap backlog_sizes_; // Approximate number of bytes used for various types of data. std::array<size_t, (int)DataKind::MAX> data_size_per_kind_{}; static DataKindNamesEnumMap& dataKindNames(); void flushCurrentLog(); }; class RocksDBTablePropertiesCollectorFactory : public rocksdb::TablePropertiesCollectorFactory { public: explicit RocksDBTablePropertiesCollectorFactory( std::shared_ptr<UpdateableConfig> updateable_config, StatsHolder* stats) : updateable_config_(updateable_config), stats_(stats) {} #if defined(ROCKSDB_MAJOR) && \ (ROCKSDB_MAJOR > 4 || (ROCKSDB_MAJOR == 4 && ROCKSDB_MINOR >= 2)) rocksdb::TablePropertiesCollector* CreateTablePropertiesCollector( rocksdb::TablePropertiesCollectorFactory::Context context) override; #else rocksdb::TablePropertiesCollector* CreateTablePropertiesCollector() override; #endif const char* Name() const override; private: std::shared_ptr<UpdateableConfig> updateable_config_; StatsHolder* stats_; }; }} // namespace facebook::logdevice

facebook-github-bot@users.noreply.github.com

cdb77d8c28d7d331df68198b9eb38074fb8ba231

7de672dbbcc1b993ec061473c20a46f963e351b2

/SDK/PUBG_P_MotoDrive_Rock_Front_BP_classes.hpp

1b77c6628647dc3131612231591fa983f30b18a3

no_license

mdbrelo/PUBG-SDK

71a15c680f589770b2d879bfd5d0a6ebc0b6481b

9628997ee0f007055e298ca55908c36317f18b36

refs/heads/master

UTF-8

C++

hpp

#pragma once // PlayerUnknown's Battlegrounds (2.6.30.2) SDK #ifdef _MSC_VER #pragma pack(push, 0x8) #endif namespace Classes { //--------------------------------------------------------------------------- //Classes //--------------------------------------------------------------------------- // BlueprintGeneratedClass P_MotoDrive_Rock_Front_BP.P_MotoDrive_Rock_Front_BP_C // 0x0008 (0x0400 - 0x03F8) class AP_MotoDrive_Rock_Front_BP_C : public ATslParticle { public: struct FPointerToUberGraphFrame UberGraphFrame; // 0x03F8(0x0008) (CPF_ZeroConstructor, CPF_Transient, CPF_DuplicateTransient) static UClass* StaticClass() { static auto ptr = UObject::FindClass("BlueprintGeneratedClass P_MotoDrive_Rock_Front_BP.P_MotoDrive_Rock_Front_BP_C"); return ptr; } void UserConstructionScript(); void OnParameterUpdated(); void ExecuteUbergraph_P_MotoDrive_Rock_Front_BP(int EntryPoint); }; } #ifdef _MSC_VER #pragma pack(pop) #endif

pubgsdk@gmail.com

74be4cb2f298829ec207b8264951c1f63a1307fa

4c8255fbb4ffb92c3c82bf88b1d30e89a75881de

/etc/examples/mojo/echo_server/poll.h

f8ca15e6eaea8b0c233033c447fb6d13de5f7f62

no_license

Xardas2000/mojo-echo

6802b2709a87e09bf3403a0d46d4f33e8e94719e

7a728e3914c58de97ad0722e86af56f44b11d8bf

refs/heads/master

UTF-8

C++

h

#include <vector> #include "engine.h" class PollEngine : public Engine { public: explicit PollEngine(int port); ~PollEngine() override; void run() override; private: void acceptNewConnections(); void manageConnections(); private: std::vector<Client> m_Clients; };

alek.kuznetsov@corp.mail.ru

c68120fda696c1343baef63a65808aaea147b7a1

6343becde6901e0fcf3a791e719b9d2a08966be8

/include/rive/generated/animation/state_machine_base.hpp

b58972a9b47bff7c6869dfb6b7f30fe7f70b7f51

permissive

xiu810/rive-cpp

1bfd591eed9c80ec27a984d8b805ddb88754ee17

bfb16907447239687ef6dee918eda9b87beffb6e

refs/heads/master

UTF-8

C++

hpp

#ifndef _RIVE_STATE_MACHINE_BASE_HPP_ #define _RIVE_STATE_MACHINE_BASE_HPP_ #include "rive/animation/animation.hpp" namespace rive { class StateMachineBase : public Animation { protected: typedef Animation Super; public: static const uint16_t typeKey = 53; /// Helper to quickly determine if a core object extends another without /// RTTI at runtime. bool isTypeOf(uint16_t typeKey) const override { switch (typeKey) { case StateMachineBase::typeKey: case AnimationBase::typeKey: return true; default: return false; } } uint16_t coreType() const override { return typeKey; } Core* clone() const override; protected: }; } // namespace rive #endif

luigi-rosso@users.noreply.github.com

b8a9d98531015e6b2351f81edea9df16a92cdd83

82fa4a7b90407b8b5c3910ece93fa9779c3dfd67

/sycl/include/CL/sycl/ONEAPI/atomic_enums.hpp

9a18e3b1732507958eb936ca3b411fa11b8a78ba

permissive

kbsmith-intel/llvm

2fd46d1c1af55578e27d384e9213eb20e93a6656

d1556e41db47010ef795ad851439d5d7dbbe4ee5

refs/heads/sycl

UTF-8

C++

hpp

//==--------------- atomic_enums.hpp - SYCL_ONEAPI_extended_atomics enums --==// // // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. // See https://llvm.org/LICENSE.txt for license information. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception // //===----------------------------------------------------------------------===// #pragma once #include <CL/__spirv/spirv_ops.hpp> #include <CL/sycl/access/access.hpp> #include <CL/sycl/detail/defines.hpp> #include <CL/sycl/detail/helpers.hpp> #ifndef __SYCL_DEVICE_ONLY__ #include <atomic> #endif #include <type_traits> __SYCL_INLINE_NAMESPACE(cl) { namespace sycl { namespace ONEAPI { enum class memory_order : int { relaxed = 0, acquire = 1, __consume_unsupported = 2, // helps optimizer when mapping to std::memory_order release = 3, acq_rel = 4, seq_cst = 5 }; __SYCL_INLINE_CONSTEXPR memory_order memory_order_relaxed = memory_order::relaxed; __SYCL_INLINE_CONSTEXPR memory_order memory_order_acquire = memory_order::acquire; __SYCL_INLINE_CONSTEXPR memory_order memory_order_release = memory_order::release; __SYCL_INLINE_CONSTEXPR memory_order memory_order_acq_rel = memory_order::acq_rel; __SYCL_INLINE_CONSTEXPR memory_order memory_order_seq_cst = memory_order::seq_cst; enum class memory_scope : int { work_item = 0, sub_group = 1, work_group = 2, device = 3, system = 4 }; __SYCL_INLINE_CONSTEXPR memory_scope memory_scope_work_item = memory_scope::work_item; __SYCL_INLINE_CONSTEXPR memory_scope memory_scope_sub_group = memory_scope::sub_group; __SYCL_INLINE_CONSTEXPR memory_scope memory_scope_work_group = memory_scope::work_group; __SYCL_INLINE_CONSTEXPR memory_scope memory_scope_device = memory_scope::device; __SYCL_INLINE_CONSTEXPR memory_scope memory_scope_system = memory_scope::system; #ifndef __SYCL_DEVICE_ONLY__ namespace detail { static inline constexpr std::memory_order getStdMemoryOrder(::cl::sycl::ONEAPI::memory_order order) { switch (order) { case memory_order::relaxed: return std::memory_order_relaxed; case memory_order::__consume_unsupported: return std::memory_order_consume; case memory_order::acquire: return std::memory_order_acquire; case memory_order::release: return std::memory_order_release; case memory_order::acq_rel: return std::memory_order_acq_rel; case memory_order::seq_cst: return std::memory_order_seq_cst; } } } // namespace detail #endif // __SYCL_DEVICE_ONLY__ } // namespace ONEAPI } // namespace sycl } // __SYCL_INLINE_NAMESPACE(cl)

noreply@github.com

4d3606d3b0a9c4edd7e3fb5e8f40035a1c8efae8

6a9cd5f5202eaa17c7e5704561d652cdefcf4650

/week4/box2.cpp

e08ae61ac5142fd6238c5acddb42c73776f341c7

no_license

ppipee/ProblemSolving

eb8e9a5e0cbdb5a9731f6d3dc90bf343fe3b041d

edb1a939608b954e0a32a29d3a061abe049d4f40

refs/heads/master

UTF-8

C++

cpp

#include <iostream> #include <string> using namespace std; bool end_path = false; bool find_out = false; // bool find_start = false; int r, c; void printMap(char **map) { for (int i = 0; i < r; i++) { for (int j = 0; j < c; j++) cout << map[i][j]; cout << endl; } cout << endl; } int move(char **map, int UL0, int UL1, int UR0, int UR1, int DL0, int DL1, int DR0, int DR1) { //UR,UL,DR,DL // cout << "from: " << UL0 << UL1 << " " << UR0 << UR1 << endl; // cout << " " << DL0 << DL1 << " " << DR0 << DR1 << endl; printMap(map); //check end if (DL0 + 1 == r && DR0 + 1 == r) { find_out = true; // cout << "find" << endl; return 0; } if (find_out) return 0; // down if (DL0 + 1 < r) { if (map[DL0 + 1][DL1] == '.' && map[DR0 + 1][DR1] == '.') // || map[DR0 + 1][DL1] == 'X')) || (map[DL0 + 1][DL1] == '.' || (map[DL0 + 1][DL1] == 'X') && (map[DR0 + 1][DL1] == '.'))) { // cout << " down\n"; int tmp_UL0 = UL0, tmp_UL1 = UL1; int tmp_UR0 = UR0, tmp_UR1 = UR1; int tmp_DL0 = DL0, tmp_DL1 = DL1; int tmp_DR0 = DR0, tmp_DR1 = DR1; tmp_UL0 += 1, tmp_UR0 += 1; tmp_DL0 += 1, tmp_DR0 += 1; map[tmp_DL0][tmp_DL1] = 'X', map[tmp_DR0][tmp_DR1] = 'X'; move(map, tmp_UL0, tmp_UL1, tmp_UR0, tmp_UR1, tmp_DL0, tmp_DL1, tmp_DR0, tmp_DR1); } } // left if (UL1 - 1 >= 0) { if (map[UL0][UL1 - 1] == '.' && map[DL0][DL1 - 1] == '.') { // cout << " left\n"; int tmp_UL0 = UL0, tmp_UL1 = UL1; int tmp_UR0 = UR0, tmp_UR1 = UR1; int tmp_DL0 = DL0, tmp_DL1 = DL1; int tmp_DR0 = DR0, tmp_DR1 = DR1; tmp_UL1 -= 1, tmp_UR1 -= 1; tmp_DL1 -= 1, tmp_DR1 -= 1; map[tmp_UL0][tmp_UL1] = 'X', map[tmp_DL0][tmp_DL1] = 'X'; move(map, tmp_UL0, tmp_UL1, tmp_UR0, tmp_UR1, tmp_DL0, tmp_DL1, tmp_DR0, tmp_DR1); } } // right if (UR1 + 1 < c) { if (map[UR0][UR1 + 1] == '.' && map[DR0][DR1 + 1] == '.') { // cout << " right\n"; int tmp_UL0 = UL0, tmp_UL1 = UL1; int tmp_UR0 = UR0, tmp_UR1 = UR1; int tmp_DL0 = DL0, tmp_DL1 = DL1; int tmp_DR0 = DR0, tmp_DR1 = DR1; tmp_UL1 += 1, tmp_UR1 += 1; tmp_DL1 += 1, tmp_DR1 += 1; map[tmp_UR0][tmp_UR1] = 'X', map[tmp_DR0][tmp_DR1] = 'X'; move(map, tmp_UL0, tmp_UL1, tmp_UR0, tmp_UR1, tmp_DL0, tmp_DL1, tmp_DR0, tmp_DR1); } } // up if (UL0 - 1 >= 0) { if (map[UL0 - 1][UL1] == '.' && map[UR0 - 1][UR1] == '.') { // cout << " up\n"; int tmp_UL0 = UL0, tmp_UL1 = UL1; int tmp_UR0 = UR0, tmp_UR1 = UR1; int tmp_DL0 = DL0, tmp_DL1 = DL1; int tmp_DR0 = DR0, tmp_DR1 = DR1; tmp_UL0 -= 1, tmp_UR0 -= 1; tmp_DL0 -= 1, tmp_DR0 -= 1; map[tmp_UL0][tmp_UL1] = 'X', map[tmp_UR0][tmp_UR1] = 'X'; move(map, tmp_UL0, tmp_UL1, tmp_UR0, tmp_UR1, tmp_DL0, tmp_DL1, tmp_DR0, tmp_DR1); } } // cout << "endway\n"; return 0; } void start(char **map) { bool find_start = true; while (find_start) { for (int i = 0; i < c - 1; i++) { if (map[0][i] == '.' && map[0][i + 1] == '.' && map[1][i] == '.' && map[1][i + 1] == '.') { int UL[2] = {0, 0}, UR[2] = {0, 1}; int DL[2] = {1, 0}, DR[2] = {1, 1}; find_start = true; UL[1] += i, UR[1] += i; DL[1] += i, DR[1] += i; map[0][i] = 'X', map[0][i + 1] = 'X'; map[1][i] = 'X', map[1][i + 1] = 'X'; int UL0 = UL[0], UL1 = UL[1]; int UR0 = UR[0], UR1 = UR[1]; int DL0 = DL[0], DL1 = DL[1]; int DR0 = DR[0], DR1 = DR[1]; // cout << "start: " << UL0 << UL1 << " " << UR0 << UR1 << endl; // cout << " " << DL0 << DL1 << " " << DR0 << DR1 << endl; move(map, UL0, UL1, UR0, UR1, DL0, DL1, DR0, DR1); } } find_start = false; } } int main() { cin >> r >> c; char *map[r]; //create map for (int i = 0; i < r; i++) map[i] = new char[10]; for (int i = 0; i < r; i++) cin >> map[i]; //start //00 01 10 11 //checkstart start(map); // printMap(map); if (find_out) cout << "yes\n"; else cout << "no\n"; }

kittapon.ku.ac.th

711c780f35f237eee2917da383cb918eb1e68631

6b757dfef2b648f31eb21342c65d6d5a5630434a

/testFirst/01背包算法.cpp

6e0e23a458987a72c252d4e50fb1a28e3a96433c

no_license

QkqBeer/C-

4cd51c2058acd20433aaafd5ef4947aa9cb593cd

df1025582f099579a0dbbc00ce21f2f25708a5bb

refs/heads/master

GB18030

C++

cpp

#include <iostream> #include <vector> #include <algorithm> using namespace std; /* 01背包算法和部分背包算法的区别 01背包算法：每件物品或被带走，或被留下，每件东西只能拿一次 部分背包算法：可以只带走某个物品的一部分，不必做出0-1选择。 */ int solution(vector<int> weight, vector<int> capacity, int size, int n) { /* weight : 权重 capacity : 体积 size : 包的最大容量 n : 多少个商品 */ vector<vector<int>> data(n + 1, vector<int>(size + 1, 0)); cout << data.size() << endl; for (int i = 1; i <= n; i++) { for (int j = 1; j <= size; j++) { if (capacity[i - 1] > j) //放不下 { data[i][j] = data[i - 1][j]; } else { data[i][j] = max(data[i - 1][j - capacity[i - 1]] + weight[i - 1], data[i - 1][j]); } } } return data[n][size]; } int main01() { vector<int> weight = { 2,3,4,5 }; vector<int> capacity = { 3,4,5,6 }; int size = 8; int n = 4; cout << solution(weight, capacity, size, n); return 0; }

614129067@qq.com

d6d8ea8ba2229379c43810bba588a484093d230f

3cfa229d1d57ce69e0e83bc99c3ca1d005ae38ad

/sphere/source/engine/rendersort.hpp

b2f1626e291d656fabc7612197302bd237a7fde9

no_license

chadaustin/sphere

33fc2fe65acf2eb56e35ade3619643faaced7021

0d74cfb268c16d07ebb7cb2540b7b0697c2a127a

refs/heads/master

UTF-8

C++

hpp

#ifndef RENDER_SORT_HPP #define RENDER_SORT_HPP #include <vector> #include "video.hpp" class CRenderSort { public: void AddObject(int draw_x, int draw_y, int sort_y, int draw_w, int draw_h, bool is_angled, double angle, IMAGE image, RGBA mask); void DrawObjects(); private: struct Object { int draw_x; int draw_y; int sort_y; int draw_w; int draw_h; bool is_angled; double angle; IMAGE image; RGBA mask; }; private: std::vector<Object> m_objects; }; #endif

tunginobi@c0eb2ce6-7f40-480a-a1e0-6c4aea08c2c2

357c5029ad7b79184c6d6cb8a9c09fae00ba9b8d

053d5e673a0b3da2eddb556fbac9b50042afe75a

/repeated-string.cpp

046ddb194ca4375efd536e8a4cc88cb9211bb32b

no_license

powe0101/hackerrank

e990f1e48a29e471db4695d0e081d6ea0b6797e7

c76700ee4825487e03353a19fceca119bbba4857

refs/heads/master

UTF-8

C++

cpp

//https://www.hackerrank.com/challenges/repeated-string //Created by G(powe0101@naver.com) #include <map> #include <set> #include <list> #include <cmath> #include <ctime> #include <deque> #include <queue> #include <stack> #include <string> #include <bitset> #include <cstdio> #include <limits> #include <vector> #include <climits> #include <cstring> #include <cstdlib> #include <fstream> #include <numeric> #include <sstream> #include <iostream> #include <algorithm> #include <unordered_map> using namespace std; long checkAstring(string s); int main(){ string s; cin >> s; long n; cin >> n; long count = checkAstring(s); long result = count * (n / s.size()); for(unsigned i =0; i < n%s.size(); ++i) if(s[i] == 'a') result += 1; cout << result << endl; return 0; } long checkAstring(string s){ long result = 0; string::iterator seek = s.begin(); string::iterator end = s.end(); for(; seek != end; ++seek) if(*seek == 'a') result += 1; return result; }

powe0101@naver.com

08c80e25b5ff3846ae0b42db155dea631acb8001

1c0ec16578f2951f64442f1577b83a4c78194924

/cpp/OpenGL/09_Tetris/Grid.h

2fca64854af177fcfb316c096ff29865e9db996b

no_license

sdraeger/lnc

5e8381325caf01667597a0e3ed6d5e9b2df22dc8

dc5762d58449b1b5a98c914fd41bd300190dc2c4

refs/heads/master

UTF-8

C++

h

#pragma once #include <memory> #include <vector> #include <string> #include "Renderer.h" #include "Vec2.h" class Grid { public: Grid(std::shared_ptr<Renderer> renderer); void render(const std::array<Vec2i,4>& tetrominoPos, const Vec3& currentColor, const std::array<Vec2i,4>& nextTetrominoPos, const Vec3& nextColor, const std::array<Vec2i,4>& targerTetrominoPos, float time) const; void clear(); void setPixel(size_t x, size_t y, int8_t val); int8_t getPixel(size_t x, size_t y) const; std::string toString() const; uint32_t getWidth() const {return width;} uint32_t getHeight() const {return height;} std::shared_ptr<Renderer> getRenderer() const {return renderer;} private: uint32_t width; uint32_t height; std::shared_ptr<Renderer> renderer; std::vector<int8_t> data; size_t gridIndex(size_t x, size_t y) const; };

jens.krueger@uni-due.de

0702d878c403f11e0458643d021bf57a173bb627

cbba3f1e70472d928e71ad39c4fc38a1a9cc1c66

/Baekjoon/15686.치킨 배달.cpp

60f16ce4ccaf61249dde58e9be4905cb04310830

no_license

giraffeJ/baekjoon

0a02ffcc0228477859acad8cdf5dee3ba3d725af

dbbf11f7dd8d61520f63ec5b4ed3f3087be3c981

refs/heads/master

UTF-8

C++

cpp

#include<stdio.h> int n, m, h, c, res=2100000000; int min(int a, int b) { return a < b ? a : b; } struct co { int x; int y; }; co home[110], chicken[15]; int map[60][60], distance[15][110], index[60][60], q[3][100001], chosen[15]; void get_input() { scanf("%d %d", &n, &m); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { scanf("%d", &map[i][j]); if (map[i][j] == 1) { home[++h] = { i, j }; index[i][j] = h; } if (map[i][j] == 2) { chicken[++c] = { i, j }; index[i][j] = c; } } } } int dx[5] = { 0, -1, 0, 1, 0 }; int dy[5] = { 0, 0, 1, 0, -1 }; void bfs(int ind) { int dis[60][60], ch[60][60] = { {0,} } , r, f, x, y, nx, ny; r = f = 0; q[0][++r] = chicken[ind].x; q[1][r] = chicken[ind].y; dis[chicken[ind].x][chicken[ind].y] = 0; while (r > f) { x = q[0][++f]; y = q[1][f]; for (int i = 1; i <= 4; i++) { nx = x + dx[i]; ny = y + dy[i]; if (ch[nx][ny] == 1 || nx==0 || nx==n+1 || ny==0 || ny==n+1) continue; q[0][++r] = nx; q[1][r] = ny; dis[nx][ny] = dis[x][y] + 1; ch[nx][ny] = 1; } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (map[i][j] == 1) { distance[ind][index[i][j]] = dis[i][j]; } } } } void get_distance() { for (int i = 1; i <= c; i++) { bfs(i); } } int calc_chicken_distance() { int sum = 0; for (int i = 1; i <= h; i++) { int min_ = 99999; for (int j = 1; j <= c; j++) { if (chosen[j] == 0) continue; min_ = min(min_, distance[j][i]); } sum += min_; } return sum; } void choose_chicken(int pos, int num) { if (pos == c + 1) { res = min(res, calc_chicken_distance()); return; } choose_chicken(pos + 1, num); if (num == m) return; chosen[pos] = 1; choose_chicken(pos + 1, num + 1); chosen[pos] = 0; } int main() { get_input(); get_distance(); choose_chicken(1, 0); printf("%d\n", res); }

35956557+giraffeJ@users.noreply.github.com

08c09fca57a5549c6b8c009be956c62c91147c43

a90b23d93d65174248fb5b53356543e646e901c8

/build/contracts/identity/identity.wast.hpp

2d967e58e4566aa63c703332d0c28d484a5b5e79

permissive

bcchain2020/BCChain

eb6a91af670e766912a403c49a2573f791d5544a

6947212d12571c536225d3440e4985f5b2093cbc

refs/heads/master

UTF-8

C++

hpp

const char* const identity_wast = R"=====( (module (type $FUNCSIG$vijj (func (param i32 i64 i64))) (type $FUNCSIG$vijji (func (param i32 i64 i64 i32))) (type $FUNCSIG$vijjji (func (param i32 i64 i64 i64 i32))) (type $FUNCSIG$v (func)) (type $FUNCSIG$j (func (result i64))) (type $FUNCSIG$vjj (func (param i64 i64))) (type $FUNCSIG$vii (func (param i32 i32))) (type $FUNCSIG$i (func (result i32))) (type $FUNCSIG$iii (func (param i32 i32) (result i32))) (type $FUNCSIG$iiii (func (param i32 i32 i32) (result i32))) (type $FUNCSIG$vj (func (param i64))) (type $FUNCSIG$ijjjj (func (param i64 i64 i64 i64) (result i32))) (type $FUNCSIG$vi (func (param i32))) (type $FUNCSIG$ijjjjii (func (param i64 i64 i64 i64 i32 i32) (result i32))) (type $FUNCSIG$vijii (func (param i32 i64 i32 i32))) (type $FUNCSIG$ijjjiij (func (param i64 i64 i64 i32 i32 i64) (result i32))) (type $FUNCSIG$ijjj (func (param i64 i64 i64) (result i32))) (type $FUNCSIG$ijjjiii (func (param i64 i64 i64 i32 i32 i32) (result i32))) (import "env" "abort" (func $abort)) (import "env" "action_data_size" (func $action_data_size (result i32))) (import "env" "bcio_assert" (func $bcio_assert (param i32 i32))) (import "env" "current_receiver" (func $current_receiver (result i64))) (import "env" "current_time" (func $current_time (result i64))) (import "env" "db_end_i64" (func $db_end_i64 (param i64 i64 i64) (result i32))) (import "env" "db_find_i64" (func $db_find_i64 (param i64 i64 i64 i64) (result i32))) (import "env" "db_get_i64" (func $db_get_i64 (param i32 i32 i32) (result i32))) (import "env" "db_idx256_find_primary" (func $db_idx256_find_primary (param i64 i64 i64 i32 i32 i64) (result i32))) (import "env" "db_idx256_lowerbound" (func $db_idx256_lowerbound (param i64 i64 i64 i32 i32 i32) (result i32))) (import "env" "db_idx256_next" (func $db_idx256_next (param i32 i32) (result i32))) (import "env" "db_idx256_remove" (func $db_idx256_remove (param i32))) (import "env" "db_idx256_store" (func $db_idx256_store (param i64 i64 i64 i64 i32 i32) (result i32))) (import "env" "db_idx256_update" (func $db_idx256_update (param i32 i64 i32 i32))) (import "env" "db_lowerbound_i64" (func $db_lowerbound_i64 (param i64 i64 i64 i64) (result i32))) (import "env" "db_next_i64" (func $db_next_i64 (param i32 i32) (result i32))) (import "env" "db_previous_i64" (func $db_previous_i64 (param i32 i32) (result i32))) (import "env" "db_remove_i64" (func $db_remove_i64 (param i32))) (import "env" "db_store_i64" (func $db_store_i64 (param i64 i64 i64 i64 i32 i32) (result i32))) (import "env" "db_update_i64" (func $db_update_i64 (param i32 i64 i32 i32))) (import "env" "get_active_producers" (func $get_active_producers (param i32 i32) (result i32))) (import "env" "memcpy" (func $memcpy (param i32 i32 i32) (result i32))) (import "env" "memmove" (func $memmove (param i32 i32 i32) (result i32))) (import "env" "memset" (func $memset (param i32 i32 i32) (result i32))) (import "env" "read_action_data" (func $read_action_data (param i32 i32) (result i32))) (import "env" "require_auth" (func $require_auth (param i64))) (import "env" "require_auth2" (func $require_auth2 (param i64 i64))) (import "env" "require_recipient" (func $require_recipient (param i64))) (table 4 4 anyfunc) (elem (i32.const 0) $__wasm_nullptr $_ZN8identity8contract6createEyy $_ZN8identity8contract8settrustEyyh $_ZN8identity8contract8certpropEyyyRKNSt3__16vectorINS_9certvalueENS1_9allocatorIS3_EEEE) (memory $0 1) (data (i32.const 4) "PN\00\00") (data (i32.const 16) "onerror\00") (data (i32.const 32) "bcio\00") (data (i32.const 48) "onerror action\'s are only valid from the \"bcio\" system account\00") (data (i32.const 112) "read\00") (data (i32.const 128) "object passed to iterator_to is not in multi_index\00") (data (i32.const 192) "cannot pass end iterator to erase\00") (data (i32.const 240) "cannot increment end iterator\00") (data (i32.const 272) "object passed to erase is not in multi_index\00") (data (i32.const 320) "cannot erase objects in table of another contract\00") (data (i32.const 384) "attempt to remove object that was not in multi_index\00") (data (i32.const 448) "cannot create objects in table of another contract\00") (data (i32.const 512) "write\00") (data (i32.const 528) "error reading iterator\00") (data (i32.const 560) "get\00") (data (i32.const 576) "identity does not exist\00") (data (i32.const 608) "certrow::type should be not longer than 32 bytes\00") (data (i32.const 672) "unexpected error in fixed_key constructor\00") (data (i32.const 720) "cannot pass end iterator to modify\00") (data (i32.const 768) "next primary key in table is at autoincrement limit\00") (data (i32.const 832) "owner\00") (data (i32.const 848) "data size doesn\'t match account_name size\00") (data (i32.const 896) "object passed to modify is not in multi_index\00") (data (i32.const 944) "cannot modify objects in table of another contract\00") (data (i32.const 1008) "updater cannot change primary key when modifying an object\00") (data (i32.const 1072) "cannot decrement end iterator when the table is empty\00") (data (i32.const 1136) "cannot decrement iterator at beginning of table\00") (data (i32.const 1184) "identity already exists\00") (data (i32.const 1216) "identity=0 is not allowed\00") (data (i32.const 1248) "object passed to iterator_to is not in multi_index\00") (data (i32.const 9712) "malloc_from_freed was designed to only be called after _heap was completely allocated\00") (export "memory" (memory $0)) (export "now" (func $now)) (export "_ZeqRK11checksum256S1_" (func $_ZeqRK11checksum256S1_)) (export "_ZeqRK11checksum160S1_" (func $_ZeqRK11checksum160S1_)) (export "_ZneRK11checksum160S1_" (func $_ZneRK11checksum160S1_)) (export "_ZN4bcio12require_authERKNS_16permission_levelE" (func $_ZN4bcio12require_authERKNS_16permission_levelE)) (export "apply" (func $apply)) (export "_ZN8identity13identity_base10is_trustedEy" (func $_ZN8identity13identity_base10is_trustedEy)) (export "_ZN8identity13identity_base13is_trusted_byEyy" (func $_ZN8identity13identity_base13is_trusted_byEyy)) (export "memcmp" (func $memcmp)) (export "malloc" (func $malloc)) (export "free" (func $free)) (func $now (result i32) (i32.wrap/i64 (i64.div_u (call $current_time) (i64.const 1000000) ) ) ) (func $_ZeqRK11checksum256S1_ (param $0 i32) (param $1 i32) (result i32) (i32.eqz (call $memcmp (get_local $0) (get_local $1) (i32.const 32) ) ) ) (func $_ZeqRK11checksum160S1_ (param $0 i32) (param $1 i32) (result i32) (i32.eqz (call $memcmp (get_local $0) (get_local $1) (i32.const 32) ) ) ) (func $_ZneRK11checksum160S1_ (param $0 i32) (param $1 i32) (result i32) (i32.ne (call $memcmp (get_local $0) (get_local $1) (i32.const 32) ) (i32.const 0) ) ) (func $_ZN4bcio12require_authERKNS_16permission_levelE (param $0 i32) (call $require_auth2 (i64.load (get_local $0) ) (i64.load offset=8 (get_local $0) ) ) ) (func $apply (param $0 i64) (param $1 i64) (param $2 i64) (local $3 i32) (local $4 i32) (local $5 i64) (local $6 i64) (local $7 i64) (local $8 i64) (local $9 i32) (i32.store offset=4 (i32.const 0) (tee_local $9 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 64) ) ) ) (set_local $6 (i64.const 0) ) (set_local $5 (i64.const 59) ) (set_local $4 (i32.const 16) ) (set_local $7 (i64.const 0) ) (loop $label$0 (block $label$1 (block $label$2 (block $label$3 (block $label$4 (block $label$5 (br_if $label$5 (i64.gt_u (get_local $6) (i64.const 6) ) ) (br_if $label$4 (i32.gt_u (i32.and (i32.add (tee_local $3 (i32.load8_s (get_local $4) ) ) (i32.const -97) ) (i32.const 255) ) (i32.const 25) ) ) (set_local $3 (i32.add (get_local $3) (i32.const 165) ) ) (br $label$3) ) (set_local $8 (i64.const 0) ) (br_if $label$2 (i64.le_u (get_local $6) (i64.const 11) ) ) (br $label$1) ) (set_local $3 (select (i32.add (get_local $3) (i32.const 208) ) (i32.const 0) (i32.lt_u (i32.and (i32.add (get_local $3) (i32.const -49) ) (i32.const 255) ) (i32.const 5) ) ) ) ) (set_local $8 (i64.shr_s (i64.shl (i64.extend_u/i32 (get_local $3) ) (i64.const 56) ) (i64.const 56) ) ) ) (set_local $8 (i64.shl (i64.and (get_local $8) (i64.const 31) ) (i64.and (get_local $5) (i64.const 4294967295) ) ) ) ) (set_local $4 (i32.add (get_local $4) (i32.const 1) ) ) (set_local $6 (i64.add (get_local $6) (i64.const 1) ) ) (set_local $7 (i64.or (get_local $8) (get_local $7) ) ) (br_if $label$0 (i64.ne (tee_local $5 (i64.add (get_local $5) (i64.const -5) ) ) (i64.const -6) ) ) ) (block $label$6 (br_if $label$6 (i64.ne (get_local $7) (get_local $2) ) ) (set_local $6 (i64.const 0) ) (set_local $5 (i64.const 59) ) (set_local $4 (i32.const 32) ) (set_local $7 (i64.const 0) ) (loop $label$7 (block $label$8 (block $label$9 (block $label$10 (block $label$11 (block $label$12 (br_if $label$12 (i64.gt_u (get_local $6) (i64.const 3) ) ) (br_if $label$11 (i32.gt_u (i32.and (i32.add (tee_local $3 (i32.load8_s (get_local $4) ) ) (i32.const -97) ) (i32.const 255) ) (i32.const 25) ) ) (set_local $3 (i32.add (get_local $3) (i32.const 165) ) ) (br $label$10) ) (set_local $8 (i64.const 0) ) (br_if $label$9 (i64.le_u (get_local $6) (i64.const 11) ) ) (br $label$8) ) (set_local $3 (select (i32.add (get_local $3) (i32.const 208) ) (i32.const 0) (i32.lt_u (i32.and (i32.add (get_local $3) (i32.const -49) ) (i32.const 255) ) (i32.const 5) ) ) ) ) (set_local $8 (i64.shr_s (i64.shl (i64.extend_u/i32 (get_local $3) ) (i64.const 56) ) (i64.const 56) ) ) ) (set_local $8 (i64.shl (i64.and (get_local $8) (i64.const 31) ) (i64.and (get_local $5) (i64.const 4294967295) ) ) ) ) (set_local $4 (i32.add (get_local $4) (i32.const 1) ) ) (set_local $6 (i64.add (get_local $6) (i64.const 1) ) ) (set_local $7 (i64.or (get_local $8) (get_local $7) ) ) (br_if $label$7 (i64.ne (tee_local $5 (i64.add (get_local $5) (i64.const -5) ) ) (i64.const -6) ) ) ) (call $bcio_assert (i64.eq (get_local $7) (get_local $1) ) (i32.const 48) ) ) (block $label$13 (block $label$14 (br_if $label$14 (i64.eq (get_local $1) (get_local $0) ) ) (set_local $6 (i64.const 0) ) (set_local $5 (i64.const 59) ) (set_local $4 (i32.const 16) ) (set_local $7 (i64.const 0) ) (loop $label$15 (block $label$16 (block $label$17 (block $label$18 (block $label$19 (block $label$20 (br_if $label$20 (i64.gt_u (get_local $6) (i64.const 6) ) ) (br_if $label$19 (i32.gt_u (i32.and (i32.add (tee_local $3 (i32.load8_s (get_local $4) ) ) (i32.const -97) ) (i32.const 255) ) (i32.const 25) ) ) (set_local $3 (i32.add (get_local $3) (i32.const 165) ) ) (br $label$18) ) (set_local $8 (i64.const 0) ) (br_if $label$17 (i64.le_u (get_local $6) (i64.const 11) ) ) (br $label$16) ) (set_local $3 (select (i32.add (get_local $3) (i32.const 208) ) (i32.const 0) (i32.lt_u (i32.and (i32.add (get_local $3) (i32.const -49) ) (i32.const 255) ) (i32.const 5) ) ) ) ) (set_local $8 (i64.shr_s (i64.shl (i64.extend_u/i32 (get_local $3) ) (i64.const 56) ) (i64.const 56) ) ) ) (set_local $8 (i64.shl (i64.and (get_local $8) (i64.const 31) ) (i64.and (get_local $5) (i64.const 4294967295) ) ) ) ) (set_local $4 (i32.add (get_local $4) (i32.const 1) ) ) (set_local $6 (i64.add (get_local $6) (i64.const 1) ) ) (set_local $7 (i64.or (get_local $8) (get_local $7) ) ) (br_if $label$15 (i64.ne (tee_local $5 (i64.add (get_local $5) (i64.const -5) ) ) (i64.const -6) ) ) ) (br_if $label$13 (i64.ne (get_local $7) (get_local $2) ) ) ) (i64.store offset=56 (get_local $9) (get_local $0) ) (block $label$21 (block $label$22 (br_if $label$22 (i64.eq (get_local $2) (i64.const -4417015375481274368) ) ) (br_if $label$21 (i64.eq (get_local $2) (i64.const 4805229608200830976) ) ) (br_if $label$13 (i64.ne (get_local $2) (i64.const 5031766152489992192) ) ) (i32.store offset=52 (get_local $9) (i32.const 0) ) (i32.store offset=48 (get_local $9) (i32.const 1) ) (i64.store offset=8 align=4 (get_local $9) (i64.load offset=48 (get_local $9) ) ) (drop (call $_ZN4bcio14execute_actionIN8identity8contractES2_JyyEEEbPT_MT0_FvDpT1_E (i32.add (get_local $9) (i32.const 56) ) (i32.add (get_local $9) (i32.const 8) ) ) ) (br $label$13) ) (i32.store offset=36 (get_local $9) (i32.const 0) ) (i32.store offset=32 (get_local $9) (i32.const 2) ) (i64.store offset=24 align=4 (get_local $9) (i64.load offset=32 (get_local $9) ) ) (drop (call $_ZN4bcio14execute_actionIN8identity8contractES2_JyyhEEEbPT_MT0_FvDpT1_E (i32.add (get_local $9) (i32.const 56) ) (i32.add (get_local $9) (i32.const 24) ) ) ) (br $label$13) ) (i32.store offset=44 (get_local $9) (i32.const 0) ) (i32.store offset=40 (get_local $9) (i32.const 3) ) (i64.store offset=16 align=4 (get_local $9) (i64.load offset=40 (get_local $9) ) ) (drop (call $_ZN4bcio14execute_actionIN8identity8contractES2_JyyyRKNSt3__16vectorINS1_9certvalueENS3_9allocatorIS5_EEEEEEEbPT_MT0_FvDpT1_E (i32.add (get_local $9) (i32.const 56) ) (i32.add (get_local $9) (i32.const 16) ) ) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $9) (i32.const 64) ) ) ) (func $_ZN8identity8contract6createEyy (type $FUNCSIG$vijj) (param $0 i32) (param $1 i64) (param $2 i64) (local $3 i32) (local $4 i64) (local $5 i32) (local $6 i32) (local $7 i32) (i32.store offset=4 (i32.const 0) (tee_local $7 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 80) ) ) ) (i64.store offset=72 (get_local $7) (get_local $1) ) (i64.store offset=64 (get_local $7) (get_local $2) ) (call $require_auth (get_local $1) ) (set_local $6 (i32.const 0) ) (i32.store (i32.add (get_local $7) (i32.const 56) ) (i32.const 0) ) (i64.store offset=40 (get_local $7) (i64.const -1) ) (i64.store offset=48 (get_local $7) (i64.const 0) ) (i64.store offset=24 (get_local $7) (tee_local $4 (i64.load (get_local $0) ) ) ) (i64.store offset=32 (get_local $7) (get_local $4) ) (block $label$0 (block $label$1 (br_if $label$1 (i32.lt_s (tee_local $0 (call $db_find_i64 (get_local $4) (get_local $4) (i64.const 8238557613797670912) (get_local $2) ) ) (i32.const 0) ) ) (call $bcio_assert (i32.eq (i32.load offset=16 (call $_ZNK4bcio11multi_indexILy8238557613797670912EN8identity8identrowEJEE31load_object_by_primary_iteratorEl (i32.add (get_local $7) (i32.const 24) ) (get_local $0) ) ) (i32.add (get_local $7) (i32.const 24) ) ) (i32.const 128) ) (set_local $1 (i64.load offset=72 (get_local $7) ) ) (set_local $2 (i64.load offset=64 (get_local $7) ) ) (br $label$0) ) (set_local $6 (i32.const 1) ) ) (call $bcio_assert (get_local $6) (i32.const 1184) ) (call $bcio_assert (i64.ne (get_local $2) (i64.const 0) ) (i32.const 1216) ) (i32.store offset=20 (get_local $7) (i32.add (get_local $7) (i32.const 72) ) ) (i32.store offset=16 (get_local $7) (i32.add (get_local $7) (i32.const 64) ) ) (call $_ZN4bcio11multi_indexILy8238557613797670912EN8identity8identrowEJEE7emplaceIZNS1_8contract6createEyyEUlRS2_E_EENS3_14const_iteratorEyOT_ (i32.add (get_local $7) (i32.const 8) ) (i32.add (get_local $7) (i32.const 24) ) (get_local $1) (i32.add (get_local $7) (i32.const 16) ) ) (block $label$2 (br_if $label$2 (i32.eqz (tee_local $3 (i32.load offset=48 (get_local $7) ) ) ) ) (block $label$3 (block $label$4 (br_if $label$4 (i32.eq (tee_local $6 (i32.load (tee_local $5 (i32.add (get_local $7) (i32.const 52) ) ) ) ) (get_local $3) ) ) (loop $label$5 (set_local $0 (i32.load (tee_local $6 (i32.add (get_local $6) (i32.const -24) ) ) ) ) (i32.store (get_local $6) (i32.const 0) ) (block $label$6 (br_if $label$6 (i32.eqz (get_local $0) ) ) (call $_ZdlPv (get_local $0) ) ) (br_if $label$5 (i32.ne (get_local $3) (get_local $6) ) ) ) (set_local $6 (i32.load (i32.add (get_local $7) (i32.const 48) ) ) ) (br $label$3) ) (set_local $6 (get_local $3) ) ) (i32.store (get_local $5) (get_local $3) ) (call $_ZdlPv (get_local $6) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $7) (i32.const 80) ) ) ) (func $_ZN4bcio14execute_actionIN8identity8contractES2_JyyEEEbPT_MT0_FvDpT1_E (param $0 i32) (param $1 i32) (result i32) (local $2 i32) (local $3 i64) (local $4 i64) (local $5 i32) (local $6 i32) (local $7 i32) (local $8 i32) (set_local $8 (tee_local $6 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 16) ) ) ) (i32.store offset=4 (i32.const 0) (get_local $6) ) (set_local $2 (i32.load offset=4 (get_local $1) ) ) (set_local $7 (i32.load (get_local $1) ) ) (block $label$0 (block $label$1 (block $label$2 (block $label$3 (br_if $label$3 (i32.eqz (tee_local $1 (call $action_data_size) ) ) ) (br_if $label$2 (i32.lt_u (get_local $1) (i32.const 513) ) ) (set_local $6 (call $malloc (get_local $1) ) ) (br $label$1) ) (set_local $6 (i32.const 0) ) (br $label$0) ) (i32.store offset=4 (i32.const 0) (tee_local $6 (i32.sub (get_local $6) (i32.and (i32.add (get_local $1) (i32.const 15) ) (i32.const -16) ) ) ) ) ) (drop (call $read_action_data (get_local $6) (get_local $1) ) ) ) (i64.store offset=8 (get_local $8) (i64.const 0) ) (i64.store (get_local $8) (i64.const 0) ) (call $bcio_assert (i32.gt_u (get_local $1) (i32.const 7) ) (i32.const 112) ) (drop (call $memcpy (get_local $8) (get_local $6) (i32.const 8) ) ) (call $bcio_assert (i32.ne (i32.and (get_local $1) (i32.const -8) ) (i32.const 8) ) (i32.const 112) ) (drop (call $memcpy (tee_local $5 (i32.add (get_local $8) (i32.const 8) ) ) (i32.add (get_local $6) (i32.const 8) ) (i32.const 8) ) ) (block $label$4 (br_if $label$4 (i32.lt_u (get_local $1) (i32.const 513) ) ) (call $free (get_local $6) ) ) (set_local $1 (i32.add (get_local $0) (i32.shr_s (get_local $2) (i32.const 1) ) ) ) (set_local $4 (i64.load (get_local $5) ) ) (set_local $3 (i64.load (get_local $8) ) ) (block $label$5 (br_if $label$5 (i32.eqz (i32.and (get_local $2) (i32.const 1) ) ) ) (set_local $7 (i32.load (i32.add (i32.load (get_local $1) ) (get_local $7) ) ) ) ) (call_indirect (type $FUNCSIG$vijj) (get_local $1) (get_local $3) (get_local $4) (get_local $7) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $8) (i32.const 16) ) ) (i32.const 1) ) (func $_ZN8identity8contract8certpropEyyyRKNSt3__16vectorINS_9certvalueENS1_9allocatorIS3_EEEE (type $FUNCSIG$vijjji) (param $0 i32) (param $1 i64) (param $2 i64) (param $3 i64) (param $4 i32) (local $5 i32) (local $6 i64) (local $7 i32) (local $8 i32) (local $9 i32) (local $10 i32) (local $11 i32) (local $12 i32) (local $13 i32) (local $14 i32) (local $15 i64) (local $16 i32) (i32.store offset=4 (i32.const 0) (tee_local $16 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 176) ) ) ) (i64.store offset=160 (get_local $16) (get_local $2) ) (i64.store offset=152 (get_local $16) (get_local $3) ) (call $require_auth (get_local $2) ) (block $label$0 (br_if $label$0 (i64.eq (get_local $2) (get_local $1) ) ) (call $require_auth (get_local $1) ) ) (i32.store (i32.add (i32.add (get_local $16) (i32.const 112) ) (i32.const 32) ) (i32.const 0) ) (i64.store offset=128 (get_local $16) (i64.const -1) ) (i64.store offset=136 (get_local $16) (i64.const 0) ) (i64.store offset=112 (get_local $16) (tee_local $2 (i64.load (get_local $0) ) ) ) (i64.store offset=120 (get_local $16) (get_local $2) ) (set_local $7 (i32.const 0) ) (block $label$1 (br_if $label$1 (i32.lt_s (tee_local $14 (call $db_find_i64 (get_local $2) (get_local $2) (i64.const 8238557613797670912) (get_local $3) ) ) (i32.const 0) ) ) (call $bcio_assert (i32.eq (i32.load offset=16 (call $_ZNK4bcio11multi_indexILy8238557613797670912EN8identity8identrowEJEE31load_object_by_primary_iteratorEl (i32.add (get_local $16) (i32.const 112) ) (get_local $14) ) ) (i32.add (get_local $16) (i32.const 112) ) ) (i32.const 128) ) (set_local $7 (i32.const 1) ) ) (call $bcio_assert (get_local $7) (i32.const 576) ) (i64.store offset=88 (get_local $16) (i64.const -1) ) (i32.store offset=96 (get_local $16) (i32.const 0) ) (set_local $2 (i64.load offset=152 (get_local $16) ) ) (i64.store offset=72 (get_local $16) (i64.load (get_local $0) ) ) (i64.store offset=80 (get_local $16) (get_local $2) ) (i32.store (i32.add (i32.add (get_local $16) (i32.const 72) ) (i32.const 28) ) (i32.const 0) ) (i32.store (i32.add (i32.add (get_local $16) (i32.const 72) ) (i32.const 32) ) (i32.const 0) ) (i32.store8 offset=108 (get_local $16) (i32.const 0) ) (i32.store8 offset=71 (get_local $16) (call $_ZN8identity13identity_base10is_trustedEy (get_local $0) (i64.load offset=160 (get_local $16) ) ) ) (block $label$2 (br_if $label$2 (i32.eq (tee_local $14 (i32.load (get_local $4) ) ) (tee_local $5 (i32.load offset=4 (get_local $4) ) ) ) ) (set_local $10 (i32.add (get_local $16) (i32.const 24) ) ) (set_local $11 (i32.add (get_local $16) (i32.const 16) ) ) (set_local $12 (i32.add (get_local $16) (i32.const 32) ) ) (set_local $13 (i32.add (get_local $16) (i32.const 28) ) ) (set_local $9 (i32.add (get_local $16) (i32.const 12) ) ) (loop $label$3 (i32.store offset=64 (get_local $16) (i32.add (get_local $16) (i32.const 72) ) ) (block $label$4 (block $label$5 (block $label$6 (block $label$7 (block $label$8 (block $label$9 (br_if $label$9 (i32.eqz (i32.load8_u offset=44 (get_local $14) ) ) ) (br_if $label$8 (i32.and (tee_local $4 (i32.load8_u offset=8 (get_local $14) ) ) (i32.const 1) ) ) (set_local $4 (i32.shr_u (get_local $4) (i32.const 1) ) ) (br $label$7) ) (set_local $2 (i64.load (get_local $14) ) ) (set_local $3 (i64.load8_u offset=71 (get_local $16) ) ) (set_local $1 (i64.load offset=160 (get_local $16) ) ) (call $bcio_assert (i32.const 1) (i32.const 672) ) (i64.store (get_local $10) (get_local $1) ) (i64.store (get_local $11) (i64.const 0) ) (i64.store offset=8 (get_local $16) (get_local $2) ) (i64.store (get_local $16) (get_local $3) ) (call $_ZNK4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE5indexILy4590200209379688448ES9_Ly0ELb0EE11lower_boundERKS8_ (i32.add (get_local $16) (i32.const 56) ) (i32.add (get_local $16) (i32.const 64) ) (get_local $16) ) (block $label$10 (br_if $label$10 (i32.eqz (tee_local $4 (i32.load offset=60 (get_local $16) ) ) ) ) (br_if $label$10 (i64.ne (i64.load offset=8 (get_local $4) ) (i64.load (get_local $14) ) ) ) (br_if $label$10 (i64.ne (i64.load offset=16 (get_local $4) ) (i64.load8_u offset=71 (get_local $16) ) ) ) (br_if $label$10 (i64.ne (i64.load offset=24 (get_local $4) ) (i64.load offset=160 (get_local $16) ) ) ) (i64.store (get_local $16) (tee_local $2 (i64.load offset=56 (get_local $16) ) ) ) (call $bcio_assert (i32.ne (tee_local $4 (i32.wrap/i64 (i64.shr_u (get_local $2) (i64.const 32) ) ) ) (i32.const 0) ) (i32.const 192) ) (drop (call $_ZN4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE5indexILy4590200209379688448ES9_Ly0ELb0EE14const_iteratorppEv (get_local $16) ) ) (call $_ZN4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE5eraseERKS2_ (i32.load offset=64 (get_local $16) ) (get_local $4) ) ) (set_local $2 (i64.load (get_local $14) ) ) (set_local $4 (i32.load8_u offset=71 (get_local $16) ) ) (set_local $3 (i64.load offset=160 (get_local $16) ) ) (call $bcio_assert (i32.const 1) (i32.const 672) ) (i64.store (get_local $10) (get_local $3) ) (i64.store (get_local $11) (i64.const 0) ) (i64.store offset=8 (get_local $16) (get_local $2) ) (i64.store (get_local $16) (i64.and (i64.extend_u/i32 (i32.xor (get_local $4) (i32.const 1) ) ) (i64.const 255) ) ) (call $_ZNK4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE5indexILy4590200209379688448ES9_Ly0ELb0EE11lower_boundERKS8_ (i32.add (get_local $16) (i32.const 168) ) (i32.add (get_local $16) (i32.const 64) ) (get_local $16) ) (i64.store offset=56 (get_local $16) (tee_local $2 (i64.load offset=168 (get_local $16) ) ) ) (block $label$11 (br_if $label$11 (i32.eqz (tee_local $4 (i32.wrap/i64 (i64.shr_u (get_local $2) (i64.const 32) ) ) ) ) ) (br_if $label$11 (i64.ne (i64.load offset=8 (get_local $4) ) (i64.load (get_local $14) ) ) ) (br_if $label$11 (i64.ne (i64.load offset=16 (get_local $4) ) (i64.xor (i64.load8_u offset=71 (get_local $16) ) (i64.const 1) ) ) ) (br_if $label$11 (i64.ne (i64.load offset=24 (get_local $4) ) (i64.load offset=160 (get_local $16) ) ) ) (i64.store (get_local $16) (get_local $2) ) (call $bcio_assert (i32.const 1) (i32.const 192) ) (drop (call $_ZN4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE5indexILy4590200209379688448ES9_Ly0ELb0EE14const_iteratorppEv (get_local $16) ) ) (call $_ZN4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE5eraseERKS2_ (i32.load offset=64 (get_local $16) ) (get_local $4) ) ) (set_local $6 (i64.load (get_local $14) ) ) (set_local $2 (i64.const 0) ) (set_local $1 (i64.const 59) ) (set_local $4 (i32.const 832) ) (set_local $15 (i64.const 0) ) (loop $label$12 (block $label$13 (block $label$14 (block $label$15 (block $label$16 (block $label$17 (br_if $label$17 (i64.gt_u (get_local $2) (i64.const 4) ) ) (br_if $label$16 (i32.gt_u (i32.and (i32.add (tee_local $7 (i32.load8_s (get_local $4) ) ) (i32.const -97) ) (i32.const 255) ) (i32.const 25) ) ) (set_local $7 (i32.add (get_local $7) (i32.const 165) ) ) (br $label$15) ) (set_local $3 (i64.const 0) ) (br_if $label$14 (i64.le_u (get_local $2) (i64.const 11) ) ) (br $label$13) ) (set_local $7 (select (i32.add (get_local $7) (i32.const 208) ) (i32.const 0) (i32.lt_u (i32.and (i32.add (get_local $7) (i32.const -49) ) (i32.const 255) ) (i32.const 5) ) ) ) ) (set_local $3 (i64.shr_s (i64.shl (i64.extend_u/i32 (get_local $7) ) (i64.const 56) ) (i64.const 56) ) ) ) (set_local $3 (i64.shl (i64.and (get_local $3) (i64.const 31) ) (i64.and (get_local $1) (i64.const 4294967295) ) ) ) ) (set_local $4 (i32.add (get_local $4) (i32.const 1) ) ) (set_local $2 (i64.add (get_local $2) (i64.const 1) ) ) (set_local $15 (i64.or (get_local $3) (get_local $15) ) ) (br_if $label$12 (i64.ne (tee_local $1 (i64.add (get_local $1) (i64.const -5) ) ) (i64.const -6) ) ) ) (br_if $label$4 (i64.ne (get_local $6) (get_local $15) ) ) (call $bcio_assert (i32.eq (i32.sub (i32.load (i32.add (get_local $14) (i32.const 24) ) ) (i32.load offset=20 (get_local $14) ) ) (i32.const 8) ) (i32.const 848) ) (br_if $label$4 (i64.ne (i64.load offset=160 (get_local $16) ) (tee_local $2 (i64.load (i32.load offset=20 (get_local $14) ) ) ) ) ) (i64.store (i32.add (get_local $16) (i32.const 8) ) (get_local $2) ) (i64.store (get_local $11) (i64.const -1) ) (i64.store (get_local $10) (i64.const 0) ) (i32.store (get_local $12) (i32.const 0) ) (i64.store (get_local $16) (tee_local $3 (i64.load (get_local $0) ) ) ) (block $label$18 (br_if $label$18 (i32.lt_s (tee_local $4 (call $db_find_i64 (get_local $3) (get_local $2) (i64.const 3607749778735104000) (i64.const 3607749778735104000) ) ) (i32.const 0) ) ) (call $bcio_assert (i32.eq (i32.load offset=8 (tee_local $4 (call $_ZNK4bcio11multi_indexILy3607749778735104000ENS_9singletonILy3607749778735104000EyE3rowEJEE31load_object_by_primary_iteratorEl (get_local $16) (get_local $4) ) ) ) (get_local $16) ) (i32.const 128) ) (call $bcio_assert (i32.const 1) (i32.const 192) ) (call $bcio_assert (i32.const 1) (i32.const 240) ) (block $label$19 (br_if $label$19 (i32.lt_s (tee_local $7 (call $db_next_i64 (i32.load offset=12 (get_local $4) ) (i32.add (get_local $16) (i32.const 168) ) ) ) (i32.const 0) ) ) (drop (call $_ZNK4bcio11multi_indexILy3607749778735104000ENS_9singletonILy3607749778735104000EyE3rowEJEE31load_object_by_primary_iteratorEl (get_local $16) (get_local $7) ) ) ) (call $_ZN4bcio11multi_indexILy3607749778735104000ENS_9singletonILy3607749778735104000EyE3rowEJEE5eraseERKS3_ (get_local $16) (get_local $4) ) ) (br_if $label$4 (i32.eqz (tee_local $8 (i32.load (get_local $10) ) ) ) ) (br_if $label$6 (i32.eq (tee_local $4 (i32.load (get_local $13) ) ) (get_local $8) ) ) (loop $label$20 (set_local $7 (i32.load (tee_local $4 (i32.add (get_local $4) (i32.const -24) ) ) ) ) (i32.store (get_local $4) (i32.const 0) ) (block $label$21 (br_if $label$21 (i32.eqz (get_local $7) ) ) (call $_ZdlPv (get_local $7) ) ) (br_if $label$20 (i32.ne (get_local $8) (get_local $4) ) ) ) (set_local $4 (i32.load (get_local $10) ) ) (br $label$5) ) (set_local $4 (i32.load (i32.add (get_local $14) (i32.const 12) ) ) ) ) (call $bcio_assert (i32.lt_u (get_local $4) (i32.const 33) ) (i32.const 608) ) (set_local $2 (i64.load (get_local $14) ) ) (set_local $3 (i64.load8_u offset=71 (get_local $16) ) ) (set_local $1 (i64.load offset=160 (get_local $16) ) ) (call $bcio_assert (i32.const 1) (i32.const 672) ) (i64.store (get_local $10) (get_local $1) ) (i64.store (get_local $11) (i64.const 0) ) (i64.store offset=8 (get_local $16) (get_local $2) ) (i64.store (get_local $16) (get_local $3) ) (call $_ZNK4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE5indexILy4590200209379688448ES9_Ly0ELb0EE11lower_boundERKS8_ (i32.add (get_local $16) (i32.const 168) ) (i32.add (get_local $16) (i32.const 64) ) (get_local $16) ) (block $label$22 (block $label$23 (br_if $label$23 (i32.eqz (tee_local $4 (i32.load offset=172 (get_local $16) ) ) ) ) (br_if $label$23 (i64.ne (i64.load offset=8 (get_local $4) ) (i64.load (get_local $14) ) ) ) (br_if $label$23 (i64.ne (i64.load offset=16 (get_local $4) ) (i64.load8_u offset=71 (get_local $16) ) ) ) (br_if $label$23 (i64.ne (i64.load offset=24 (get_local $4) ) (i64.load offset=160 (get_local $16) ) ) ) (set_local $4 (i32.load offset=172 (get_local $16) ) ) (i32.store (get_local $16) (get_local $14) ) (call $bcio_assert (i32.ne (get_local $4) (i32.const 0) ) (i32.const 720) ) (call $_ZN4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE6modifyIZNS1_8contract8certpropEyyyRKNSt3__16vectorINS1_9certvalueENSE_9allocatorISG_EEEEEUlRS2_E_EEvRKS2_yOT_ (i32.load offset=64 (get_local $16) ) (get_local $4) (i64.const 0) (get_local $16) ) (br $label$22) ) (block $label$24 (br_if $label$24 (i64.ne (tee_local $2 (i64.load (tee_local $4 (i32.add (i32.add (get_local $16) (i32.const 72) ) (i32.const 16) ) ) ) ) (i64.const -1) ) ) (set_local $2 (i64.const 0) ) (block $label$25 (br_if $label$25 (i32.lt_s (tee_local $7 (call $db_lowerbound_i64 (i64.load offset=72 (get_local $16) ) (i64.load (i32.add (i32.add (get_local $16) (i32.const 72) ) (i32.const 8) ) ) (i64.const 4805230851241541632) (i64.const 0) ) ) (i32.const 0) ) ) (drop (call $_ZNK4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE31load_object_by_primary_iteratorEl (i32.add (get_local $16) (i32.const 72) ) (get_local $7) ) ) (i32.store offset=4 (get_local $16) (i32.const 0) ) (i32.store (get_local $16) (i32.add (get_local $16) (i32.const 72) ) ) (set_local $2 (select (i64.const -2) (i64.add (tee_local $2 (i64.load (i32.load offset=4 (call $_ZN4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE14const_iteratormmEv (get_local $16) ) ) ) ) (i64.const 1) ) (i64.gt_u (get_local $2) (i64.const -3) ) ) ) ) (i64.store (get_local $4) (get_local $2) ) ) (call $bcio_assert (i64.lt_u (get_local $2) (i64.const -2) ) (i32.const 768) ) (i64.store offset=56 (get_local $16) (i64.load (get_local $4) ) ) (set_local $2 (i64.load (get_local $0) ) ) (i32.store offset=4 (get_local $16) (get_local $14) ) (i32.store (i32.add (get_local $16) (i32.const 8) ) (i32.add (get_local $16) (i32.const 71) ) ) (i32.store (get_local $9) (i32.add (get_local $16) (i32.const 160) ) ) (i32.store (get_local $16) (i32.add (get_local $16) (i32.const 56) ) ) (call $_ZN4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE7emplaceIZNS1_8contract8certpropEyyyRKNSt3__16vectorINS1_9certvalueENSE_9allocatorISG_EEEEEUlRS2_E0_EENSB_14const_iteratorEyOT_ (i32.add (get_local $16) (i32.const 48) ) (i32.add (get_local $16) (i32.const 72) ) (get_local $2) (get_local $16) ) ) (set_local $2 (i64.load (get_local $14) ) ) (set_local $4 (i32.load8_u offset=71 (get_local $16) ) ) (set_local $3 (i64.load offset=160 (get_local $16) ) ) (call $bcio_assert (i32.const 1) (i32.const 672) ) (i64.store (get_local $10) (get_local $3) ) (i64.store (get_local $11) (i64.const 0) ) (i64.store offset=8 (get_local $16) (get_local $2) ) (i64.store (get_local $16) (i64.and (i64.extend_u/i32 (i32.xor (get_local $4) (i32.const 1) ) ) (i64.const 255) ) ) (call $_ZNK4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE5indexILy4590200209379688448ES9_Ly0ELb0EE11lower_boundERKS8_ (i32.add (get_local $16) (i32.const 56) ) (i32.add (get_local $16) (i32.const 64) ) (get_local $16) ) (block $label$26 (br_if $label$26 (i32.eqz (tee_local $4 (i32.load offset=60 (get_local $16) ) ) ) ) (br_if $label$26 (i64.ne (i64.load offset=8 (get_local $4) ) (i64.load (get_local $14) ) ) ) (br_if $label$26 (i64.ne (i64.load offset=16 (get_local $4) ) (i64.xor (i64.load8_u offset=71 (get_local $16) ) (i64.const 1) ) ) ) (br_if $label$26 (i64.ne (i64.load offset=24 (get_local $4) ) (i64.load offset=160 (get_local $16) ) ) ) (i64.store (get_local $16) (tee_local $2 (i64.load offset=56 (get_local $16) ) ) ) (call $bcio_assert (i32.ne (tee_local $4 (i32.wrap/i64 (i64.shr_u (get_local $2) (i64.const 32) ) ) ) (i32.const 0) ) (i32.const 192) ) (drop (call $_ZN4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE5indexILy4590200209379688448ES9_Ly0ELb0EE14const_iteratorppEv (get_local $16) ) ) (call $_ZN4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE5eraseERKS2_ (i32.load offset=64 (get_local $16) ) (get_local $4) ) ) (set_local $6 (i64.load (get_local $14) ) ) (set_local $2 (i64.const 0) ) (set_local $1 (i64.const 59) ) (set_local $4 (i32.const 832) ) (set_local $15 (i64.const 0) ) (loop $label$27 (block $label$28 (block $label$29 (block $label$30 (block $label$31 (block $label$32 (br_if $label$32 (i64.gt_u (get_local $2) (i64.const 4) ) ) (br_if $label$31 (i32.gt_u (i32.and (i32.add (tee_local $7 (i32.load8_s (get_local $4) ) ) (i32.const -97) ) (i32.const 255) ) (i32.const 25) ) ) (set_local $7 (i32.add (get_local $7) (i32.const 165) ) ) (br $label$30) ) (set_local $3 (i64.const 0) ) (br_if $label$29 (i64.le_u (get_local $2) (i64.const 11) ) ) (br $label$28) ) (set_local $7 (select (i32.add (get_local $7) (i32.const 208) ) (i32.const 0) (i32.lt_u (i32.and (i32.add (get_local $7) (i32.const -49) ) (i32.const 255) ) (i32.const 5) ) ) ) ) (set_local $3 (i64.shr_s (i64.shl (i64.extend_u/i32 (get_local $7) ) (i64.const 56) ) (i64.const 56) ) ) ) (set_local $3 (i64.shl (i64.and (get_local $3) (i64.const 31) ) (i64.and (get_local $1) (i64.const 4294967295) ) ) ) ) (set_local $4 (i32.add (get_local $4) (i32.const 1) ) ) (set_local $2 (i64.add (get_local $2) (i64.const 1) ) ) (set_local $15 (i64.or (get_local $3) (get_local $15) ) ) (br_if $label$27 (i64.ne (tee_local $1 (i64.add (get_local $1) (i64.const -5) ) ) (i64.const -6) ) ) ) (br_if $label$4 (i64.ne (get_local $6) (get_local $15) ) ) (call $bcio_assert (i32.eq (i32.sub (i32.load (i32.add (get_local $14) (i32.const 24) ) ) (i32.load offset=20 (get_local $14) ) ) (i32.const 8) ) (i32.const 848) ) (br_if $label$4 (i64.ne (i64.load offset=160 (get_local $16) ) (tee_local $2 (i64.load (i32.load offset=20 (get_local $14) ) ) ) ) ) (i64.store (i32.add (get_local $16) (i32.const 8) ) (get_local $2) ) (i64.store (get_local $11) (i64.const -1) ) (i64.store (get_local $10) (i64.const 0) ) (i32.store (get_local $12) (i32.const 0) ) (i64.store (get_local $16) (i64.load (get_local $0) ) ) (call $_ZN4bcio9singletonILy3607749778735104000EyE3setERKyy (get_local $16) (i32.add (get_local $16) (i32.const 152) ) (get_local $2) ) (br_if $label$4 (i32.eqz (tee_local $8 (i32.load (get_local $10) ) ) ) ) (block $label$33 (block $label$34 (br_if $label$34 (i32.eq (tee_local $4 (i32.load (get_local $13) ) ) (get_local $8) ) ) (loop $label$35 (set_local $7 (i32.load (tee_local $4 (i32.add (get_local $4) (i32.const -24) ) ) ) ) (i32.store (get_local $4) (i32.const 0) ) (block $label$36 (br_if $label$36 (i32.eqz (get_local $7) ) ) (call $_ZdlPv (get_local $7) ) ) (br_if $label$35 (i32.ne (get_local $8) (get_local $4) ) ) ) (set_local $4 (i32.load (get_local $10) ) ) (br $label$33) ) (set_local $4 (get_local $8) ) ) (i32.store (get_local $13) (get_local $8) ) (call $_ZdlPv (get_local $4) ) (br $label$4) ) (set_local $4 (get_local $8) ) ) (i32.store (get_local $13) (get_local $8) ) (call $_ZdlPv (get_local $4) ) ) (br_if $label$3 (i32.ne (tee_local $14 (i32.add (get_local $14) (i32.const 48) ) ) (get_local $5) ) ) ) ) (block $label$37 (br_if $label$37 (i32.eqz (tee_local $10 (i32.load offset=96 (get_local $16) ) ) ) ) (block $label$38 (block $label$39 (br_if $label$39 (i32.eq (tee_local $7 (i32.load (tee_local $8 (i32.add (get_local $16) (i32.const 100) ) ) ) ) (get_local $10) ) ) (loop $label$40 (set_local $4 (i32.load (tee_local $7 (i32.add (get_local $7) (i32.const -24) ) ) ) ) (i32.store (get_local $7) (i32.const 0) ) (block $label$41 (br_if $label$41 (i32.eqz (get_local $4) ) ) (block $label$42 (br_if $label$42 (i32.eqz (tee_local $14 (i32.load offset=48 (get_local $4) ) ) ) ) (i32.store (i32.add (get_local $4) (i32.const 52) ) (get_local $14) ) (call $_ZdlPv (get_local $14) ) ) (block $label$43 (br_if $label$43 (i32.eqz (i32.and (i32.load8_u offset=36 (get_local $4) ) (i32.const 1) ) ) ) (call $_ZdlPv (i32.load (i32.add (get_local $4) (i32.const 44) ) ) ) ) (call $_ZdlPv (get_local $4) ) ) (br_if $label$40 (i32.ne (get_local $10) (get_local $7) ) ) ) (set_local $4 (i32.load (i32.add (get_local $16) (i32.const 96) ) ) ) (br $label$38) ) (set_local $4 (get_local $10) ) ) (i32.store (get_local $8) (get_local $10) ) (call $_ZdlPv (get_local $4) ) ) (block $label$44 (br_if $label$44 (i32.eqz (tee_local $14 (i32.load offset=136 (get_local $16) ) ) ) ) (block $label$45 (block $label$46 (br_if $label$46 (i32.eq (tee_local $4 (i32.load (tee_local $10 (i32.add (get_local $16) (i32.const 140) ) ) ) ) (get_local $14) ) ) (loop $label$47 (set_local $7 (i32.load (tee_local $4 (i32.add (get_local $4) (i32.const -24) ) ) ) ) (i32.store (get_local $4) (i32.const 0) ) (block $label$48 (br_if $label$48 (i32.eqz (get_local $7) ) ) (call $_ZdlPv (get_local $7) ) ) (br_if $label$47 (i32.ne (get_local $14) (get_local $4) ) ) ) (set_local $4 (i32.load (i32.add (get_local $16) (i32.const 136) ) ) ) (br $label$45) ) (set_local $4 (get_local $14) ) ) (i32.store (get_local $10) (get_local $14) ) (call $_ZdlPv (get_local $4) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $16) (i32.const 176) ) ) ) (func $_ZN4bcio14execute_actionIN8identity8contractES2_JyyyRKNSt3__16vectorINS1_9certvalueENS3_9allocatorIS5_EEEEEEEbPT_MT0_FvDpT1_E (param $0 i32) (param $1 i32) (result i32) (local $2 i32) (local $3 i32) (local $4 i32) (local $5 i32) (i32.store offset=4 (i32.const 0) (tee_local $3 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 80) ) ) ) (i32.store offset=60 (tee_local $5 (get_local $3) ) (get_local $0) ) (i32.store offset=48 (get_local $5) (i32.load (get_local $1) ) ) (i32.store offset=52 (get_local $5) (i32.load offset=4 (get_local $1) ) ) (set_local $1 (i32.const 0) ) (block $label$0 (br_if $label$0 (i32.eqz (tee_local $0 (call $action_data_size) ) ) ) (block $label$1 (block $label$2 (br_if $label$2 (i32.lt_u (get_local $0) (i32.const 513) ) ) (set_local $1 (call $malloc (get_local $0) ) ) (br $label$1) ) (i32.store offset=4 (i32.const 0) (tee_local $1 (i32.sub (get_local $3) (i32.and (i32.add (get_local $0) (i32.const 15) ) (i32.const -16) ) ) ) ) ) (drop (call $read_action_data (get_local $1) (get_local $0) ) ) ) (i32.store (i32.add (get_local $5) (i32.const 40) ) (i32.const 0) ) (i64.store offset=16 (get_local $5) (i64.const 0) ) (i64.store offset=8 (get_local $5) (i64.const 0) ) (i64.store offset=24 (get_local $5) (i64.const 0) ) (i64.store offset=32 (get_local $5) (i64.const 0) ) (i32.store offset=64 (get_local $5) (get_local $1) ) (i32.store offset=72 (get_local $5) (tee_local $3 (i32.add (get_local $1) (get_local $0) ) ) ) (call $bcio_assert (i32.gt_u (get_local $0) (i32.const 7) ) (i32.const 112) ) (drop (call $memcpy (i32.add (get_local $5) (i32.const 8) ) (get_local $1) (i32.const 8) ) ) (call $bcio_assert (i32.gt_u (i32.sub (get_local $3) (tee_local $2 (i32.add (get_local $1) (i32.const 8) ) ) ) (i32.const 7) ) (i32.const 112) ) (drop (call $memcpy (i32.add (i32.add (get_local $5) (i32.const 8) ) (i32.const 8) ) (get_local $2) (i32.const 8) ) ) (call $bcio_assert (i32.gt_u (i32.sub (get_local $3) (tee_local $2 (i32.add (get_local $1) (i32.const 16) ) ) ) (i32.const 7) ) (i32.const 112) ) (drop (call $memcpy (i32.add (i32.add (get_local $5) (i32.const 8) ) (i32.const 16) ) (get_local $2) (i32.const 8) ) ) (i32.store offset=68 (get_local $5) (i32.add (get_local $1) (i32.const 24) ) ) (drop (call $_ZN4bciorsINS_10datastreamIPKcEEN8identity9certvalueEEERT_S8_RNSt3__16vectorIT0_NS9_9allocatorISB_EEEE (i32.add (get_local $5) (i32.const 64) ) (i32.add (i32.add (get_local $5) (i32.const 8) ) (i32.const 24) ) ) ) (block $label$3 (br_if $label$3 (i32.lt_u (get_local $0) (i32.const 513) ) ) (call $free (get_local $1) ) ) (i32.store offset=68 (get_local $5) (i32.add (get_local $5) (i32.const 48) ) ) (i32.store offset=64 (get_local $5) (i32.add (get_local $5) (i32.const 60) ) ) (call $_ZN5boost4mp116detail16tuple_apply_implIRZN4bcio14execute_actionIN8identity8contractES6_JyyyRKNSt3__16vectorINS5_9certvalueENS7_9allocatorIS9_EEEEEEEbPT_MT0_FvDpT1_EEUlDpT_E_RNS7_5tupleIJyyySC_EEEJLj0ELj1ELj2ELj3EEEEDTclclsr3stdE7forwardISF_Efp_Espclsr3stdE3getIXT1_EEclsr3stdE7forwardISH_Efp0_EEEEOSF_OSH_NS0_16integer_sequenceIjJXspT1_EEEE (i32.add (get_local $5) (i32.const 64) ) (i32.add (get_local $5) (i32.const 8) ) ) (block $label$4 (br_if $label$4 (i32.eqz (tee_local $2 (i32.load offset=32 (get_local $5) ) ) ) ) (block $label$5 (block $label$6 (br_if $label$6 (i32.eq (tee_local $1 (i32.load (tee_local $4 (i32.add (get_local $5) (i32.const 36) ) ) ) ) (get_local $2) ) ) (set_local $3 (i32.sub (i32.const 0) (get_local $2) ) ) (set_local $1 (i32.add (get_local $1) (i32.const -40) ) ) (loop $label$7 (block $label$8 (br_if $label$8 (i32.eqz (i32.and (i32.load8_u (i32.add (get_local $1) (i32.const 24) ) ) (i32.const 1) ) ) ) (call $_ZdlPv (i32.load (i32.add (get_local $1) (i32.const 32) ) ) ) ) (block $label$9 (br_if $label$9 (i32.eqz (tee_local $0 (i32.load (i32.add (get_local $1) (i32.const 12) ) ) ) ) ) (i32.store (i32.add (get_local $1) (i32.const 16) ) (get_local $0) ) (call $_ZdlPv (get_local $0) ) ) (block $label$10 (br_if $label$10 (i32.eqz (i32.and (i32.load8_u (get_local $1) ) (i32.const 1) ) ) ) (call $_ZdlPv (i32.load (i32.add (get_local $1) (i32.const 8) ) ) ) ) (br_if $label$7 (i32.ne (i32.add (tee_local $1 (i32.add (get_local $1) (i32.const -48) ) ) (get_local $3) ) (i32.const -40) ) ) ) (set_local $1 (i32.load (i32.add (get_local $5) (i32.const 32) ) ) ) (br $label$5) ) (set_local $1 (get_local $2) ) ) (i32.store (get_local $4) (get_local $2) ) (call $_ZdlPv (get_local $1) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $5) (i32.const 80) ) ) (i32.const 1) ) (func $_ZN8identity8contract8settrustEyyh (type $FUNCSIG$vijji) (param $0 i32) (param $1 i64) (param $2 i64) (param $3 i32) (local $4 i32) (local $5 i64) (local $6 i32) (local $7 i32) (i32.store offset=4 (i32.const 0) (tee_local $7 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 64) ) ) ) (i64.store offset=48 (get_local $7) (get_local $2) ) (call $require_auth (get_local $1) ) (call $require_recipient (get_local $2) ) (i32.store (i32.add (get_local $7) (i32.const 40) ) (i32.const 0) ) (i64.store offset=16 (get_local $7) (get_local $1) ) (i64.store offset=24 (get_local $7) (i64.const -1) ) (i64.store offset=32 (get_local $7) (i64.const 0) ) (i64.store offset=8 (get_local $7) (tee_local $5 (i64.load (get_local $0) ) ) ) (block $label$0 (block $label$1 (block $label$2 (block $label$3 (br_if $label$3 (i32.le_s (tee_local $0 (call $db_find_i64 (get_local $5) (get_local $1) (i64.const -3605821445256511488) (get_local $2) ) ) (i32.const -1) ) ) (call $bcio_assert (i32.eq (i32.load offset=8 (tee_local $0 (call $_ZNK4bcio11multi_indexILy14840922628453040128EN8identity8trustrowEJEE31load_object_by_primary_iteratorEl (i32.add (get_local $7) (i32.const 8) ) (get_local $0) ) ) ) (i32.add (get_local $7) (i32.const 8) ) ) (i32.const 128) ) (br_if $label$2 (get_local $3) ) (call $bcio_assert (i32.const 1) (i32.const 192) ) (call $bcio_assert (i32.const 1) (i32.const 240) ) (block $label$4 (br_if $label$4 (i32.lt_s (tee_local $3 (call $db_next_i64 (i32.load offset=12 (get_local $0) ) (i32.add (get_local $7) (i32.const 56) ) ) ) (i32.const 0) ) ) (drop (call $_ZNK4bcio11multi_indexILy14840922628453040128EN8identity8trustrowEJEE31load_object_by_primary_iteratorEl (i32.add (get_local $7) (i32.const 8) ) (get_local $3) ) ) ) (call $_ZN4bcio11multi_indexILy14840922628453040128EN8identity8trustrowEJEE5eraseERKS2_ (i32.add (get_local $7) (i32.const 8) ) (get_local $0) ) (br_if $label$1 (tee_local $4 (i32.load offset=32 (get_local $7) ) ) ) (br $label$0) ) (br_if $label$2 (i32.eqz (get_local $3) ) ) (i32.store (get_local $7) (i32.add (get_local $7) (i32.const 48) ) ) (call $_ZN4bcio11multi_indexILy14840922628453040128EN8identity8trustrowEJEE7emplaceIZNS1_8contract8settrustEyyhEUlRS2_E_EENS3_14const_iteratorEyOT_ (i32.add (get_local $7) (i32.const 56) ) (i32.add (get_local $7) (i32.const 8) ) (get_local $1) (get_local $7) ) ) (br_if $label$0 (i32.eqz (tee_local $4 (i32.load offset=32 (get_local $7) ) ) ) ) ) (block $label$5 (block $label$6 (br_if $label$6 (i32.eq (tee_local $3 (i32.load (tee_local $6 (i32.add (get_local $7) (i32.const 36) ) ) ) ) (get_local $4) ) ) (loop $label$7 (set_local $0 (i32.load (tee_local $3 (i32.add (get_local $3) (i32.const -24) ) ) ) ) (i32.store (get_local $3) (i32.const 0) ) (block $label$8 (br_if $label$8 (i32.eqz (get_local $0) ) ) (call $_ZdlPv (get_local $0) ) ) (br_if $label$7 (i32.ne (get_local $4) (get_local $3) ) ) ) (set_local $3 (i32.load (i32.add (get_local $7) (i32.const 32) ) ) ) (br $label$5) ) (set_local $3 (get_local $4) ) ) (i32.store (get_local $6) (get_local $4) ) (call $_ZdlPv (get_local $3) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $7) (i32.const 64) ) ) ) (func $_ZN4bcio14execute_actionIN8identity8contractES2_JyyhEEEbPT_MT0_FvDpT1_E (param $0 i32) (param $1 i32) (result i32) (local $2 i32) (local $3 i64) (local $4 i64) (local $5 i32) (local $6 i32) (local $7 i32) (local $8 i32) (local $9 i32) (set_local $8 (tee_local $9 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 32) ) ) ) (i32.store offset=4 (i32.const 0) (get_local $9) ) (set_local $2 (i32.load offset=4 (get_local $1) ) ) (set_local $7 (i32.load (get_local $1) ) ) (set_local $6 (i32.const 0) ) (block $label$0 (br_if $label$0 (i32.eqz (tee_local $1 (call $action_data_size) ) ) ) (block $label$1 (block $label$2 (br_if $label$2 (i32.lt_u (get_local $1) (i32.const 513) ) ) (set_local $6 (call $malloc (get_local $1) ) ) (br $label$1) ) (i32.store offset=4 (i32.const 0) (tee_local $6 (i32.sub (get_local $9) (i32.and (i32.add (get_local $1) (i32.const 15) ) (i32.const -16) ) ) ) ) ) (drop (call $read_action_data (get_local $6) (get_local $1) ) ) ) (i64.store offset=16 (get_local $8) (i64.const 0) ) (i64.store offset=8 (get_local $8) (i64.const 0) ) (i32.store8 offset=24 (get_local $8) (i32.const 0) ) (call $bcio_assert (i32.gt_u (get_local $1) (i32.const 7) ) (i32.const 112) ) (drop (call $memcpy (i32.add (get_local $8) (i32.const 8) ) (get_local $6) (i32.const 8) ) ) (call $bcio_assert (i32.ne (i32.and (get_local $1) (i32.const -8) ) (i32.const 8) ) (i32.const 112) ) (drop (call $memcpy (tee_local $9 (i32.add (i32.add (get_local $8) (i32.const 8) ) (i32.const 8) ) ) (i32.add (get_local $6) (i32.const 8) ) (i32.const 8) ) ) (call $bcio_assert (i32.ne (get_local $1) (i32.const 16) ) (i32.const 112) ) (drop (call $memcpy (tee_local $5 (i32.add (i32.add (get_local $8) (i32.const 8) ) (i32.const 16) ) ) (i32.add (get_local $6) (i32.const 16) ) (i32.const 1) ) ) (block $label$3 (br_if $label$3 (i32.lt_u (get_local $1) (i32.const 513) ) ) (call $free (get_local $6) ) ) (set_local $1 (i32.add (get_local $0) (i32.shr_s (get_local $2) (i32.const 1) ) ) ) (set_local $6 (i32.load8_u (get_local $5) ) ) (set_local $4 (i64.load (get_local $9) ) ) (set_local $3 (i64.load offset=8 (get_local $8) ) ) (block $label$4 (br_if $label$4 (i32.eqz (i32.and (get_local $2) (i32.const 1) ) ) ) (set_local $7 (i32.load (i32.add (i32.load (get_local $1) ) (get_local $7) ) ) ) ) (call_indirect (type $FUNCSIG$vijji) (get_local $1) (get_local $3) (get_local $4) (i32.and (get_local $6) (i32.const 255) ) (get_local $7) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $8) (i32.const 32) ) ) (i32.const 1) ) (func $_ZNK4bcio11multi_indexILy14840922628453040128EN8identity8trustrowEJEE31load_object_by_primary_iteratorEl (param $0 i32) (param $1 i32) (result i32) (local $2 i32) (local $3 i32) (local $4 i32) (local $5 i64) (local $6 i32) (local $7 i32) (local $8 i32) (local $9 i32) (set_local $8 (tee_local $9 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 32) ) ) ) (i32.store offset=4 (i32.const 0) (get_local $9) ) (block $label$0 (br_if $label$0 (i32.eq (tee_local $7 (i32.load (i32.add (get_local $0) (i32.const 28) ) ) ) (tee_local $2 (i32.load offset=24 (get_local $0) ) ) ) ) (set_local $3 (i32.sub (i32.const 0) (get_local $2) ) ) (set_local $6 (i32.add (get_local $7) (i32.const -24) ) ) (loop $label$1 (br_if $label$0 (i32.eq (i32.load (i32.add (get_local $6) (i32.const 16) ) ) (get_local $1) ) ) (set_local $7 (get_local $6) ) (set_local $6 (tee_local $4 (i32.add (get_local $6) (i32.const -24) ) ) ) (br_if $label$1 (i32.ne (i32.add (get_local $4) (get_local $3) ) (i32.const -24) ) ) ) ) (block $label$2 (block $label$3 (br_if $label$3 (i32.eq (get_local $7) (get_local $2) ) ) (set_local $6 (i32.load (i32.add (get_local $7) (i32.const -24) ) ) ) (br $label$2) ) (call $bcio_assert (i32.xor (i32.shr_u (tee_local $4 (call $db_get_i64 (get_local $1) (i32.const 0) (i32.const 0) ) ) (i32.const 31) ) (i32.const 1) ) (i32.const 528) ) (block $label$4 (block $label$5 (br_if $label$5 (i32.le_u (get_local $4) (i32.const 512) ) ) (drop (call $db_get_i64 (get_local $1) (tee_local $7 (call $malloc (get_local $4) ) ) (get_local $4) ) ) (call $free (get_local $7) ) (br $label$4) ) (i32.store offset=4 (i32.const 0) (tee_local $7 (i32.sub (get_local $9) (i32.and (i32.add (get_local $4) (i32.const 15) ) (i32.const -16) ) ) ) ) (drop (call $db_get_i64 (get_local $1) (get_local $7) (get_local $4) ) ) ) (i32.store offset=8 (tee_local $6 (call $_Znwj (i32.const 24) ) ) (get_local $0) ) (call $bcio_assert (i32.gt_u (get_local $4) (i32.const 7) ) (i32.const 112) ) (drop (call $memcpy (get_local $6) (get_local $7) (i32.const 8) ) ) (i32.store offset=12 (get_local $6) (get_local $1) ) (i32.store offset=24 (get_local $8) (get_local $6) ) (i64.store offset=16 (get_local $8) (tee_local $5 (i64.load (get_local $6) ) ) ) (i32.store offset=12 (get_local $8) (tee_local $7 (i32.load offset=12 (get_local $6) ) ) ) (block $label$6 (block $label$7 (br_if $label$7 (i32.ge_u (tee_local $4 (i32.load (tee_local $1 (i32.add (get_local $0) (i32.const 28) ) ) ) ) (i32.load (i32.add (get_local $0) (i32.const 32) ) ) ) ) (i64.store offset=8 (get_local $4) (get_local $5) ) (i32.store offset=16 (get_local $4) (get_local $7) ) (i32.store offset=24 (get_local $8) (i32.const 0) ) (i32.store (get_local $4) (get_local $6) ) (i32.store (get_local $1) (i32.add (get_local $4) (i32.const 24) ) ) (br $label$6) ) (call $_ZNSt3__16vectorIN4bcio11multi_indexILy14840922628453040128EN8identity8trustrowEJEE8item_ptrENS_9allocatorIS6_EEE24__emplace_back_slow_pathIJNS_10unique_ptrINS5_4itemENS_14default_deleteISC_EEEERyRlEEEvDpOT_ (i32.add (get_local $0) (i32.const 24) ) (i32.add (get_local $8) (i32.const 24) ) (i32.add (get_local $8) (i32.const 16) ) (i32.add (get_local $8) (i32.const 12) ) ) ) (set_local $4 (i32.load offset=24 (get_local $8) ) ) (i32.store offset=24 (get_local $8) (i32.const 0) ) (br_if $label$2 (i32.eqz (get_local $4) ) ) (call $_ZdlPv (get_local $4) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $8) (i32.const 32) ) ) (get_local $6) ) (func $_ZN4bcio11multi_indexILy14840922628453040128EN8identity8trustrowEJEE7emplaceIZNS1_8contract8settrustEyyhEUlRS2_E_EENS3_14const_iteratorEyOT_ (param $0 i32) (param $1 i32) (param $2 i64) (param $3 i32) (local $4 i32) (local $5 i64) (local $6 i32) (local $7 i32) (local $8 i32) (i32.store offset=4 (i32.const 0) (tee_local $8 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 32) ) ) ) (call $bcio_assert (i64.eq (i64.load (get_local $1) ) (call $current_receiver) ) (i32.const 448) ) (i32.store offset=8 (tee_local $4 (call $_Znwj (i32.const 24) ) ) (get_local $1) ) (i64.store (get_local $4) (i64.load (i32.load (get_local $3) ) ) ) (call $bcio_assert (i32.const 1) (i32.const 512) ) (drop (call $memcpy (i32.add (get_local $8) (i32.const 16) ) (get_local $4) (i32.const 8) ) ) (i32.store offset=12 (get_local $4) (call $db_store_i64 (i64.load offset=8 (get_local $1) ) (i64.const -3605821445256511488) (get_local $2) (tee_local $5 (i64.load (get_local $4) ) ) (i32.add (get_local $8) (i32.const 16) ) (i32.const 8) ) ) (block $label$0 (br_if $label$0 (i64.lt_u (get_local $5) (i64.load offset=16 (get_local $1) ) ) ) (i64.store (i32.add (get_local $1) (i32.const 16) ) (select (i64.const -2) (i64.add (get_local $5) (i64.const 1) ) (i64.gt_u (get_local $5) (i64.const -3) ) ) ) ) (i32.store offset=8 (get_local $8) (get_local $4) ) (i64.store offset=16 (get_local $8) (tee_local $5 (i64.load (get_local $4) ) ) ) (i32.store offset=4 (get_local $8) (tee_local $6 (i32.load offset=12 (get_local $4) ) ) ) (block $label$1 (block $label$2 (br_if $label$2 (i32.ge_u (tee_local $3 (i32.load (tee_local $7 (i32.add (get_local $1) (i32.const 28) ) ) ) ) (i32.load (i32.add (get_local $1) (i32.const 32) ) ) ) ) (i64.store offset=8 (get_local $3) (get_local $5) ) (i32.store offset=16 (get_local $3) (get_local $6) ) (i32.store offset=8 (get_local $8) (i32.const 0) ) (i32.store (get_local $3) (get_local $4) ) (i32.store (get_local $7) (i32.add (get_local $3) (i32.const 24) ) ) (br $label$1) ) (call $_ZNSt3__16vectorIN4bcio11multi_indexILy14840922628453040128EN8identity8trustrowEJEE8item_ptrENS_9allocatorIS6_EEE24__emplace_back_slow_pathIJNS_10unique_ptrINS5_4itemENS_14default_deleteISC_EEEERyRlEEEvDpOT_ (i32.add (get_local $1) (i32.const 24) ) (i32.add (get_local $8) (i32.const 8) ) (i32.add (get_local $8) (i32.const 16) ) (i32.add (get_local $8) (i32.const 4) ) ) ) (i32.store offset=4 (get_local $0) (get_local $4) ) (i32.store (get_local $0) (get_local $1) ) (set_local $4 (i32.load offset=8 (get_local $8) ) ) (i32.store offset=8 (get_local $8) (i32.const 0) ) (block $label$3 (br_if $label$3 (i32.eqz (get_local $4) ) ) (call $_ZdlPv (get_local $4) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $8) (i32.const 32) ) ) ) (func $_ZN4bcio11multi_indexILy14840922628453040128EN8identity8trustrowEJEE5eraseERKS2_ (param $0 i32) (param $1 i32) (local $2 i64) (local $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (local $7 i32) (local $8 i32) (call $bcio_assert (i32.eq (i32.load offset=8 (get_local $1) ) (get_local $0) ) (i32.const 272) ) (call $bcio_assert (i64.eq (i64.load (get_local $0) ) (call $current_receiver) ) (i32.const 320) ) (block $label$0 (br_if $label$0 (i32.eq (tee_local $7 (i32.load (tee_local $5 (i32.add (get_local $0) (i32.const 28) ) ) ) ) (tee_local $3 (i32.load offset=24 (get_local $0) ) ) ) ) (set_local $2 (i64.load (get_local $1) ) ) (set_local $6 (i32.sub (i32.const 0) (get_local $3) ) ) (set_local $8 (i32.add (get_local $7) (i32.const -24) ) ) (loop $label$1 (br_if $label$0 (i64.eq (i64.load (i32.load (get_local $8) ) ) (get_local $2) ) ) (set_local $7 (get_local $8) ) (set_local $8 (tee_local $4 (i32.add (get_local $8) (i32.const -24) ) ) ) (br_if $label$1 (i32.ne (i32.add (get_local $4) (get_local $6) ) (i32.const -24) ) ) ) ) (call $bcio_assert (i32.ne (get_local $7) (get_local $3) ) (i32.const 384) ) (set_local $8 (i32.add (get_local $7) (i32.const -24) ) ) (block $label$2 (block $label$3 (br_if $label$3 (i32.eq (get_local $7) (tee_local $4 (i32.load (get_local $5) ) ) ) ) (set_local $3 (i32.sub (i32.const 0) (get_local $4) ) ) (set_local $7 (get_local $8) ) (loop $label$4 (set_local $6 (i32.load (tee_local $8 (i32.add (get_local $7) (i32.const 24) ) ) ) ) (i32.store (get_local $8) (i32.const 0) ) (set_local $4 (i32.load (get_local $7) ) ) (i32.store (get_local $7) (get_local $6) ) (block $label$5 (br_if $label$5 (i32.eqz (get_local $4) ) ) (call $_ZdlPv (get_local $4) ) ) (i32.store (i32.add (get_local $7) (i32.const 16) ) (i32.load (i32.add (get_local $7) (i32.const 40) ) ) ) (i64.store (i32.add (get_local $7) (i32.const 8) ) (i64.load (i32.add (get_local $7) (i32.const 32) ) ) ) (set_local $7 (get_local $8) ) (br_if $label$4 (i32.ne (i32.add (get_local $8) (get_local $3) ) (i32.const -24) ) ) ) (br_if $label$2 (i32.eq (tee_local $7 (i32.load (i32.add (get_local $0) (i32.const 28) ) ) ) (get_local $8) ) ) ) (loop $label$6 (set_local $4 (i32.load (tee_local $7 (i32.add (get_local $7) (i32.const -24) ) ) ) ) (i32.store (get_local $7) (i32.const 0) ) (block $label$7 (br_if $label$7 (i32.eqz (get_local $4) ) ) (call $_ZdlPv (get_local $4) ) ) (br_if $label$6 (i32.ne (get_local $8) (get_local $7) ) ) ) ) (i32.store (i32.add (get_local $0) (i32.const 28) ) (get_local $8) ) (call $db_remove_i64 (i32.load offset=12 (get_local $1) ) ) ) (func $_ZNSt3__16vectorIN4bcio11multi_indexILy14840922628453040128EN8identity8trustrowEJEE8item_ptrENS_9allocatorIS6_EEE24__emplace_back_slow_pathIJNS_10unique_ptrINS5_4itemENS_14default_deleteISC_EEEERyRlEEEvDpOT_ (param $0 i32) (param $1 i32) (param $2 i32) (param $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (local $7 i32) (block $label$0 (block $label$1 (br_if $label$1 (i32.ge_u (tee_local $5 (i32.add (tee_local $4 (i32.div_s (i32.sub (i32.load offset=4 (get_local $0) ) (tee_local $6 (i32.load (get_local $0) ) ) ) (i32.const 24) ) ) (i32.const 1) ) ) (i32.const 178956971) ) ) (set_local $7 (i32.const 178956970) ) (block $label$2 (block $label$3 (br_if $label$3 (i32.gt_u (tee_local $6 (i32.div_s (i32.sub (i32.load offset=8 (get_local $0) ) (get_local $6) ) (i32.const 24) ) ) (i32.const 89478484) ) ) (br_if $label$2 (i32.eqz (tee_local $7 (select (get_local $5) (tee_local $7 (i32.shl (get_local $6) (i32.const 1) ) ) (i32.lt_u (get_local $7) (get_local $5) ) ) ) ) ) ) (set_local $6 (call $_Znwj (i32.mul (get_local $7) (i32.const 24) ) ) ) (br $label$0) ) (set_local $7 (i32.const 0) ) (set_local $6 (i32.const 0) ) (br $label$0) ) (call $_ZNKSt3__120__vector_base_commonILb1EE20__throw_length_errorEv (get_local $0) ) (unreachable) ) (set_local $5 (i32.load (get_local $1) ) ) (i32.store (get_local $1) (i32.const 0) ) (i32.store (tee_local $1 (i32.add (get_local $6) (i32.mul (get_local $4) (i32.const 24) ) ) ) (get_local $5) ) (i64.store offset=8 (get_local $1) (i64.load (get_local $2) ) ) (i32.store offset=16 (get_local $1) (i32.load (get_local $3) ) ) (set_local $4 (i32.add (get_local $6) (i32.mul (get_local $7) (i32.const 24) ) ) ) (set_local $5 (i32.add (get_local $1) (i32.const 24) ) ) (block $label$4 (block $label$5 (br_if $label$5 (i32.eq (tee_local $6 (i32.load (i32.add (get_local $0) (i32.const 4) ) ) ) (tee_local $7 (i32.load (get_local $0) ) ) ) ) (loop $label$6 (set_local $3 (i32.load (tee_local $2 (i32.add (get_local $6) (i32.const -24) ) ) ) ) (i32.store (get_local $2) (i32.const 0) ) (i32.store (i32.add (get_local $1) (i32.const -24) ) (get_local $3) ) (i32.store (i32.add (get_local $1) (i32.const -8) ) (i32.load (i32.add (get_local $6) (i32.const -8) ) ) ) (i32.store (i32.add (get_local $1) (i32.const -12) ) (i32.load (i32.add (get_local $6) (i32.const -12) ) ) ) (i32.store (i32.add (get_local $1) (i32.const -16) ) (i32.load (i32.add (get_local $6) (i32.const -16) ) ) ) (set_local $1 (i32.add (get_local $1) (i32.const -24) ) ) (set_local $6 (get_local $2) ) (br_if $label$6 (i32.ne (get_local $7) (get_local $2) ) ) ) (set_local $7 (i32.load (i32.add (get_local $0) (i32.const 4) ) ) ) (set_local $6 (i32.load (get_local $0) ) ) (br $label$4) ) (set_local $6 (get_local $7) ) ) (i32.store (get_local $0) (get_local $1) ) (i32.store (i32.add (get_local $0) (i32.const 4) ) (get_local $5) ) (i32.store (i32.add (get_local $0) (i32.const 8) ) (get_local $4) ) (block $label$7 (br_if $label$7 (i32.eq (get_local $7) (get_local $6) ) ) (loop $label$8 (set_local $1 (i32.load (tee_local $7 (i32.add (get_local $7) (i32.const -24) ) ) ) ) (i32.store (get_local $7) (i32.const 0) ) (block $label$9 (br_if $label$9 (i32.eqz (get_local $1) ) ) (call $_ZdlPv (get_local $1) ) ) (br_if $label$8 (i32.ne (get_local $6) (get_local $7) ) ) ) ) (block $label$10 (br_if $label$10 (i32.eqz (get_local $6) ) ) (call $_ZdlPv (get_local $6) ) ) ) (func $_ZN4bciorsINS_10datastreamIPKcEEN8identity9certvalueEEERT_S8_RNSt3__16vectorIT0_NS9_9allocatorISB_EEEE (param $0 i32) (param $1 i32) (result i32) (local $2 i32) (local $3 i32) (local $4 i32) (local $5 i32) (local $6 i64) (local $7 i32) (set_local $5 (i32.load offset=4 (get_local $0) ) ) (set_local $4 (i32.const 0) ) (set_local $6 (i64.const 0) ) (set_local $2 (i32.add (get_local $0) (i32.const 8) ) ) (set_local $3 (i32.add (get_local $0) (i32.const 4) ) ) (loop $label$0 (call $bcio_assert (i32.lt_u (get_local $5) (i32.load (get_local $2) ) ) (i32.const 560) ) (set_local $7 (i32.load8_u (tee_local $5 (i32.load (get_local $3) ) ) ) ) (i32.store (get_local $3) (tee_local $5 (i32.add (get_local $5) (i32.const 1) ) ) ) (set_local $6 (i64.or (i64.extend_u/i32 (i32.shl (i32.and (get_local $7) (i32.const 127) ) (tee_local $4 (i32.and (get_local $4) (i32.const 255) ) ) ) ) (get_local $6) ) ) (set_local $4 (i32.add (get_local $4) (i32.const 7) ) ) (br_if $label$0 (i32.shr_u (get_local $7) (i32.const 7) ) ) ) (call $_ZNSt3__16vectorIN8identity9certvalueENS_9allocatorIS2_EEE6resizeEj (get_local $1) (i32.wrap/i64 (get_local $6) ) ) (block $label$1 (br_if $label$1 (i32.eq (tee_local $7 (i32.load (get_local $1) ) ) (tee_local $3 (i32.load offset=4 (get_local $1) ) ) ) ) (set_local $4 (i32.add (get_local $0) (i32.const 4) ) ) (loop $label$2 (call $bcio_assert (i32.gt_u (i32.sub (i32.load (i32.add (get_local $0) (i32.const 8) ) ) (i32.load (get_local $4) ) ) (i32.const 7) ) (i32.const 112) ) (drop (call $memcpy (get_local $7) (i32.load (get_local $4) ) (i32.const 8) ) ) (i32.store (get_local $4) (i32.add (i32.load (get_local $4) ) (i32.const 8) ) ) (call $bcio_assert (i32.ne (i32.load offset=8 (tee_local $5 (call $_ZN4bciorsINS_10datastreamIPKcEEEERT_S6_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEE (call $_ZN4bciorsINS_10datastreamIPKcEEEERT_S6_RNSt3__16vectorIcNS7_9allocatorIcEEEE (call $_ZN4bciorsINS_10datastreamIPKcEEEERT_S6_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEE (get_local $0) (i32.add (get_local $7) (i32.const 8) ) ) (i32.add (get_local $7) (i32.const 20) ) ) (i32.add (get_local $7) (i32.const 32) ) ) ) ) (i32.load offset=4 (get_local $5) ) ) (i32.const 112) ) (drop (call $memcpy (i32.add (get_local $7) (i32.const 44) ) (i32.load offset=4 (get_local $5) ) (i32.const 1) ) ) (i32.store offset=4 (get_local $5) (i32.add (i32.load offset=4 (get_local $5) ) (i32.const 1) ) ) (br_if $label$2 (i32.ne (tee_local $7 (i32.add (get_local $7) (i32.const 48) ) ) (get_local $3) ) ) ) ) (get_local $0) ) (func $_ZN5boost4mp116detail16tuple_apply_implIRZN4bcio14execute_actionIN8identity8contractES6_JyyyRKNSt3__16vectorINS5_9certvalueENS7_9allocatorIS9_EEEEEEEbPT_MT0_FvDpT1_EEUlDpT_E_RNS7_5tupleIJyyySC_EEEJLj0ELj1ELj2ELj3EEEEDTclclsr3stdE7forwardISF_Efp_Espclsr3stdE3getIXT1_EEclsr3stdE7forwardISH_Efp0_EEEEOSF_OSH_NS0_16integer_sequenceIjJXspT1_EEEE (param $0 i32) (param $1 i32) (local $2 i64) (local $3 i64) (local $4 i64) (local $5 i32) (local $6 i32) (local $7 i32) (i32.store offset=4 (i32.const 0) (tee_local $7 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 16) ) ) ) (i64.store (get_local $7) (i64.const 0) ) (i32.store offset=8 (get_local $7) (i32.const 0) ) (set_local $6 (i32.div_s (tee_local $5 (i32.sub (i32.load (i32.add (get_local $1) (i32.const 28) ) ) (i32.load offset=24 (get_local $1) ) ) ) (i32.const 48) ) ) (set_local $4 (i64.load offset=16 (get_local $1) ) ) (set_local $3 (i64.load offset=8 (get_local $1) ) ) (set_local $2 (i64.load (get_local $1) ) ) (block $label$0 (block $label$1 (br_if $label$1 (i32.eqz (get_local $5) ) ) (br_if $label$0 (i32.ge_u (get_local $6) (i32.const 89478486) ) ) (i32.store (i32.add (get_local $7) (i32.const 8) ) (i32.add (tee_local $5 (call $_Znwj (get_local $5) ) ) (i32.mul (get_local $6) (i32.const 48) ) ) ) (i32.store (get_local $7) (get_local $5) ) (i32.store offset=4 (get_local $7) (get_local $5) ) (call $_ZNSt3__16vectorIN8identity9certvalueENS_9allocatorIS2_EEE18__construct_at_endIPS2_EENS_9enable_ifIXsr21__is_forward_iteratorIT_EE5valueEvE4typeES9_S9_j (get_local $7) (i32.load (i32.add (get_local $1) (i32.const 24) ) ) (i32.load (i32.add (get_local $1) (i32.const 28) ) ) (get_local $6) ) ) (set_local $0 (i32.add (i32.load (i32.load (get_local $0) ) ) (i32.shr_s (tee_local $6 (i32.load offset=4 (tee_local $1 (i32.load offset=4 (get_local $0) ) ) ) ) (i32.const 1) ) ) ) (set_local $1 (i32.load (get_local $1) ) ) (block $label$2 (br_if $label$2 (i32.eqz (i32.and (get_local $6) (i32.const 1) ) ) ) (set_local $1 (i32.load (i32.add (i32.load (get_local $0) ) (get_local $1) ) ) ) ) (call_indirect (type $FUNCSIG$vijjji) (get_local $0) (get_local $2) (get_local $3) (get_local $4) (get_local $7) (get_local $1) ) (block $label$3 (br_if $label$3 (i32.eqz (tee_local $5 (i32.load (get_local $7) ) ) ) ) (block $label$4 (block $label$5 (br_if $label$5 (i32.eq (tee_local $1 (i32.load offset=4 (get_local $7) ) ) (get_local $5) ) ) (set_local $6 (i32.sub (i32.const 0) (get_local $5) ) ) (set_local $1 (i32.add (get_local $1) (i32.const -40) ) ) (loop $label$6 (block $label$7 (br_if $label$7 (i32.eqz (i32.and (i32.load8_u (i32.add (get_local $1) (i32.const 24) ) ) (i32.const 1) ) ) ) (call $_ZdlPv (i32.load (i32.add (get_local $1) (i32.const 32) ) ) ) ) (block $label$8 (br_if $label$8 (i32.eqz (tee_local $0 (i32.load (i32.add (get_local $1) (i32.const 12) ) ) ) ) ) (i32.store (i32.add (get_local $1) (i32.const 16) ) (get_local $0) ) (call $_ZdlPv (get_local $0) ) ) (block $label$9 (br_if $label$9 (i32.eqz (i32.and (i32.load8_u (get_local $1) ) (i32.const 1) ) ) ) (call $_ZdlPv (i32.load (i32.add (get_local $1) (i32.const 8) ) ) ) ) (br_if $label$6 (i32.ne (i32.add (tee_local $1 (i32.add (get_local $1) (i32.const -48) ) ) (get_local $6) ) (i32.const -40) ) ) ) (set_local $1 (i32.load (get_local $7) ) ) (br $label$4) ) (set_local $1 (get_local $5) ) ) (i32.store offset=4 (get_local $7) (get_local $5) ) (call $_ZdlPv (get_local $1) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $7) (i32.const 16) ) ) (return) ) (call $_ZNKSt3__120__vector_base_commonILb1EE20__throw_length_errorEv (get_local $7) ) (unreachable) ) (func $_ZNSt3__16vectorIN8identity9certvalueENS_9allocatorIS2_EEE18__construct_at_endIPS2_EENS_9enable_ifIXsr21__is_forward_iteratorIT_EE5valueEvE4typeES9_S9_j (param $0 i32) (param $1 i32) (param $2 i32) (param $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (local $7 i32) (local $8 i32) (local $9 i32) (local $10 i32) (block $label$0 (block $label$1 (br_if $label$1 (i32.eq (get_local $1) (get_local $2) ) ) (set_local $10 (i32.add (get_local $1) (i32.const 44) ) ) (set_local $4 (i32.sub (i32.const 0) (get_local $2) ) ) (set_local $1 (i32.load (tee_local $7 (i32.add (get_local $0) (i32.const 4) ) ) ) ) (loop $label$2 (i64.store (get_local $1) (i64.load (i32.add (get_local $10) (i32.const -44) ) ) ) (drop (call $_ZNSt3__112basic_stringIcNS_11char_traitsIcEENS_9allocatorIcEEEC2ERKS5_ (i32.add (get_local $1) (i32.const 8) ) (i32.add (get_local $10) (i32.const -36) ) ) ) (i64.store offset=20 align=4 (get_local $1) (i64.const 0) ) (i32.store (tee_local $8 (i32.add (get_local $1) (i32.const 28) ) ) (i32.const 0) ) (block $label$3 (br_if $label$3 (i32.eqz (tee_local $2 (i32.sub (i32.load (tee_local $6 (i32.add (get_local $10) (i32.const -20) ) ) ) (i32.load (tee_local $9 (i32.add (get_local $10) (i32.const -24) ) ) ) ) ) ) ) (set_local $5 (i32.add (get_local $1) (i32.const 20) ) ) (br_if $label$0 (i32.le_s (get_local $2) (i32.const -1) ) ) (i32.store (get_local $5) (tee_local $0 (call $_Znwj (get_local $2) ) ) ) (i32.store (get_local $8) (i32.add (get_local $0) (get_local $2) ) ) (i32.store (tee_local $2 (i32.add (get_local $1) (i32.const 24) ) ) (get_local $0) ) (br_if $label$3 (i32.lt_s (tee_local $8 (i32.sub (i32.load (get_local $6) ) (tee_local $6 (i32.load (get_local $9) ) ) ) ) (i32.const 1) ) ) (drop (call $memcpy (get_local $0) (get_local $6) (get_local $8) ) ) (i32.store (get_local $2) (i32.add (i32.load (get_local $2) ) (get_local $8) ) ) ) (drop (call $_ZNSt3__112basic_stringIcNS_11char_traitsIcEENS_9allocatorIcEEEC2ERKS5_ (i32.add (get_local $1) (i32.const 32) ) (i32.add (get_local $10) (i32.const -12) ) ) ) (i32.store8 offset=44 (get_local $1) (i32.load8_u (get_local $10) ) ) (i32.store (get_local $7) (tee_local $1 (i32.add (i32.load (get_local $7) ) (i32.const 48) ) ) ) (br_if $label$2 (i32.ne (i32.add (tee_local $10 (i32.add (get_local $10) (i32.const 48) ) ) (get_local $4) ) (i32.const 44) ) ) ) ) (return) ) (call $_ZNKSt3__120__vector_base_commonILb1EE20__throw_length_errorEv (get_local $5) ) (unreachable) ) (func $_ZNSt3__16vectorIN8identity9certvalueENS_9allocatorIS2_EEE6resizeEj (param $0 i32) (param $1 i32) (local $2 i32) (local $3 i32) (local $4 i32) (local $5 i32) (block $label$0 (br_if $label$0 (i32.ge_u (tee_local $5 (i32.div_s (i32.sub (tee_local $2 (i32.load offset=4 (get_local $0) ) ) (tee_local $4 (i32.load (get_local $0) ) ) ) (i32.const 48) ) ) (get_local $1) ) ) (call $_ZNSt3__16vectorIN8identity9certvalueENS_9allocatorIS2_EEE8__appendEj (get_local $0) (i32.sub (get_local $1) (get_local $5) ) ) (return) ) (block $label$1 (br_if $label$1 (i32.le_u (get_local $5) (get_local $1) ) ) (block $label$2 (br_if $label$2 (i32.eq (get_local $2) (tee_local $3 (i32.add (get_local $4) (tee_local $1 (i32.mul (get_local $1) (i32.const 48) ) ) ) ) ) ) (set_local $4 (i32.sub (i32.sub (i32.const 0) (get_local $4) ) (get_local $1) ) ) (set_local $1 (i32.add (get_local $2) (i32.const -40) ) ) (loop $label$3 (block $label$4 (br_if $label$4 (i32.eqz (i32.and (i32.load8_u (i32.add (get_local $1) (i32.const 24) ) ) (i32.const 1) ) ) ) (call $_ZdlPv (i32.load (i32.add (get_local $1) (i32.const 32) ) ) ) ) (block $label$5 (br_if $label$5 (i32.eqz (tee_local $5 (i32.load (i32.add (get_local $1) (i32.const 12) ) ) ) ) ) (i32.store (i32.add (get_local $1) (i32.const 16) ) (get_local $5) ) (call $_ZdlPv (get_local $5) ) ) (block $label$6 (br_if $label$6 (i32.eqz (i32.and (i32.load8_u (get_local $1) ) (i32.const 1) ) ) ) (call $_ZdlPv (i32.load (i32.add (get_local $1) (i32.const 8) ) ) ) ) (br_if $label$3 (i32.ne (i32.add (tee_local $1 (i32.add (get_local $1) (i32.const -48) ) ) (get_local $4) ) (i32.const -40) ) ) ) ) (i32.store (i32.add (get_local $0) (i32.const 4) ) (get_local $3) ) ) ) (func $_ZN4bciorsINS_10datastreamIPKcEEEERT_S6_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEE (param $0 i32) (param $1 i32) (result i32) (local $2 i32) (local $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (local $7 i32) (i32.store offset=4 (i32.const 0) (tee_local $7 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 32) ) ) ) (i32.store offset=24 (get_local $7) (i32.const 0) ) (i64.store offset=16 (get_local $7) (i64.const 0) ) (drop (call $_ZN4bciorsINS_10datastreamIPKcEEEERT_S6_RNSt3__16vectorIcNS7_9allocatorIcEEEE (get_local $0) (i32.add (get_local $7) (i32.const 16) ) ) ) (block $label$0 (block $label$1 (block $label$2 (block $label$3 (block $label$4 (block $label$5 (block $label$6 (block $label$7 (block $label$8 (br_if $label$8 (i32.ne (tee_local $5 (i32.load offset=20 (get_local $7) ) ) (tee_local $4 (i32.load offset=16 (get_local $7) ) ) ) ) (br_if $label$7 (i32.and (i32.load8_u (get_local $1) ) (i32.const 1) ) ) (i32.store16 (get_local $1) (i32.const 0) ) (set_local $4 (i32.add (get_local $1) (i32.const 8) ) ) (br $label$6) ) (i32.store (i32.add (get_local $7) (i32.const 8) ) (i32.const 0) ) (i64.store (get_local $7) (i64.const 0) ) (br_if $label$0 (i32.ge_u (tee_local $2 (i32.sub (get_local $5) (get_local $4) ) ) (i32.const -16) ) ) (br_if $label$5 (i32.ge_u (get_local $2) (i32.const 11) ) ) (i32.store8 (get_local $7) (i32.shl (get_local $2) (i32.const 1) ) ) (set_local $6 (i32.or (get_local $7) (i32.const 1) ) ) (br_if $label$4 (get_local $2) ) (br $label$3) ) (i32.store8 (i32.load offset=8 (get_local $1) ) (i32.const 0) ) (i32.store offset=4 (get_local $1) (i32.const 0) ) (set_local $4 (i32.add (get_local $1) (i32.const 8) ) ) ) (call $_ZNSt3__112basic_stringIcNS_11char_traitsIcEENS_9allocatorIcEEE7reserveEj (get_local $1) (i32.const 0) ) (i32.store (get_local $4) (i32.const 0) ) (i64.store align=4 (get_local $1) (i64.const 0) ) (br_if $label$2 (tee_local $4 (i32.load offset=16 (get_local $7) ) ) ) (br $label$1) ) (set_local $6 (call $_Znwj (tee_local $5 (i32.and (i32.add (get_local $2) (i32.const 16) ) (i32.const -16) ) ) ) ) (i32.store (get_local $7) (i32.or (get_local $5) (i32.const 1) ) ) (i32.store offset=8 (get_local $7) (get_local $6) ) (i32.store offset=4 (get_local $7) (get_local $2) ) ) (set_local $3 (get_local $2) ) (set_local $5 (get_local $6) ) (loop $label$9 (i32.store8 (get_local $5) (i32.load8_u (get_local $4) ) ) (set_local $5 (i32.add (get_local $5) (i32.const 1) ) ) (set_local $4 (i32.add (get_local $4) (i32.const 1) ) ) (br_if $label$9 (tee_local $3 (i32.add (get_local $3) (i32.const -1) ) ) ) ) (set_local $6 (i32.add (get_local $6) (get_local $2) ) ) ) (i32.store8 (get_local $6) (i32.const 0) ) (block $label$10 (block $label$11 (br_if $label$11 (i32.and (i32.load8_u (get_local $1) ) (i32.const 1) ) ) (i32.store16 (get_local $1) (i32.const 0) ) (br $label$10) ) (i32.store8 (i32.load offset=8 (get_local $1) ) (i32.const 0) ) (i32.store offset=4 (get_local $1) (i32.const 0) ) ) (call $_ZNSt3__112basic_stringIcNS_11char_traitsIcEENS_9allocatorIcEEE7reserveEj (get_local $1) (i32.const 0) ) (i32.store (i32.add (get_local $1) (i32.const 8) ) (i32.load (i32.add (get_local $7) (i32.const 8) ) ) ) (i64.store align=4 (get_local $1) (i64.load (get_local $7) ) ) (br_if $label$1 (i32.eqz (tee_local $4 (i32.load offset=16 (get_local $7) ) ) ) ) ) (i32.store offset=20 (get_local $7) (get_local $4) ) (call $_ZdlPv (get_local $4) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $7) (i32.const 32) ) ) (return (get_local $0) ) ) (call $_ZNKSt3__121__basic_string_commonILb1EE20__throw_length_errorEv (get_local $7) ) (unreachable) ) (func $_ZN4bciorsINS_10datastreamIPKcEEEERT_S6_RNSt3__16vectorIcNS7_9allocatorIcEEEE (param $0 i32) (param $1 i32) (result i32) (local $2 i32) (local $3 i32) (local $4 i32) (local $5 i32) (local $6 i64) (local $7 i32) (set_local $5 (i32.load offset=4 (get_local $0) ) ) (set_local $7 (i32.const 0) ) (set_local $6 (i64.const 0) ) (set_local $2 (i32.add (get_local $0) (i32.const 8) ) ) (set_local $3 (i32.add (get_local $0) (i32.const 4) ) ) (loop $label$0 (call $bcio_assert (i32.lt_u (get_local $5) (i32.load (get_local $2) ) ) (i32.const 560) ) (set_local $4 (i32.load8_u (tee_local $5 (i32.load (get_local $3) ) ) ) ) (i32.store (get_local $3) (tee_local $5 (i32.add (get_local $5) (i32.const 1) ) ) ) (set_local $6 (i64.or (i64.extend_u/i32 (i32.shl (i32.and (get_local $4) (i32.const 127) ) (tee_local $7 (i32.and (get_local $7) (i32.const 255) ) ) ) ) (get_local $6) ) ) (set_local $7 (i32.add (get_local $7) (i32.const 7) ) ) (br_if $label$0 (i32.shr_u (get_local $4) (i32.const 7) ) ) ) (block $label$1 (block $label$2 (br_if $label$2 (i32.le_u (tee_local $3 (i32.wrap/i64 (get_local $6) ) ) (tee_local $2 (i32.sub (tee_local $7 (i32.load offset=4 (get_local $1) ) ) (tee_local $4 (i32.load (get_local $1) ) ) ) ) ) ) (call $_ZNSt3__16vectorIcNS_9allocatorIcEEE8__appendEj (get_local $1) (i32.sub (get_local $3) (get_local $2) ) ) (set_local $5 (i32.load (i32.add (get_local $0) (i32.const 4) ) ) ) (set_local $7 (i32.load (i32.add (get_local $1) (i32.const 4) ) ) ) (set_local $4 (i32.load (get_local $1) ) ) (br $label$1) ) (br_if $label$1 (i32.ge_u (get_local $3) (get_local $2) ) ) (i32.store (i32.add (get_local $1) (i32.const 4) ) (tee_local $7 (i32.add (get_local $4) (get_local $3) ) ) ) ) (call $bcio_assert (i32.ge_u (i32.sub (i32.load (i32.add (get_local $0) (i32.const 8) ) ) (get_local $5) ) (tee_local $5 (i32.sub (get_local $7) (get_local $4) ) ) ) (i32.const 112) ) (drop (call $memcpy (get_local $4) (i32.load (tee_local $7 (i32.add (get_local $0) (i32.const 4) ) ) ) (get_local $5) ) ) (i32.store (get_local $7) (i32.add (i32.load (get_local $7) ) (get_local $5) ) ) (get_local $0) ) (func $_ZNSt3__16vectorIcNS_9allocatorIcEEE8__appendEj (param $0 i32) (param $1 i32) (local $2 i32) (local $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (block $label$0 (block $label$1 (block $label$2 (block $label$3 (block $label$4 (br_if $label$4 (i32.ge_u (i32.sub (tee_local $2 (i32.load offset=8 (get_local $0) ) ) (tee_local $6 (i32.load offset=4 (get_local $0) ) ) ) (get_local $1) ) ) (br_if $label$2 (i32.le_s (tee_local $4 (i32.add (tee_local $3 (i32.sub (get_local $6) (tee_local $5 (i32.load (get_local $0) ) ) ) ) (get_local $1) ) ) (i32.const -1) ) ) (set_local $6 (i32.const 2147483647) ) (block $label$5 (br_if $label$5 (i32.gt_u (tee_local $2 (i32.sub (get_local $2) (get_local $5) ) ) (i32.const 1073741822) ) ) (br_if $label$3 (i32.eqz (tee_local $6 (select (get_local $4) (tee_local $6 (i32.shl (get_local $2) (i32.const 1) ) ) (i32.lt_u (get_local $6) (get_local $4) ) ) ) ) ) ) (set_local $2 (call $_Znwj (get_local $6) ) ) (br $label$1) ) (set_local $0 (i32.add (get_local $0) (i32.const 4) ) ) (loop $label$6 (i32.store8 (get_local $6) (i32.const 0) ) (i32.store (get_local $0) (tee_local $6 (i32.add (i32.load (get_local $0) ) (i32.const 1) ) ) ) (br_if $label$6 (tee_local $1 (i32.add (get_local $1) (i32.const -1) ) ) ) (br $label$0) ) ) (set_local $6 (i32.const 0) ) (set_local $2 (i32.const 0) ) (br $label$1) ) (call $_ZNKSt3__120__vector_base_commonILb1EE20__throw_length_errorEv (get_local $0) ) (unreachable) ) (set_local $4 (i32.add (get_local $2) (get_local $6) ) ) (set_local $6 (tee_local $5 (i32.add (get_local $2) (get_local $3) ) ) ) (loop $label$7 (i32.store8 (get_local $6) (i32.const 0) ) (set_local $6 (i32.add (get_local $6) (i32.const 1) ) ) (br_if $label$7 (tee_local $1 (i32.add (get_local $1) (i32.const -1) ) ) ) ) (set_local $5 (i32.sub (get_local $5) (tee_local $2 (i32.sub (i32.load (tee_local $3 (i32.add (get_local $0) (i32.const 4) ) ) ) (tee_local $1 (i32.load (get_local $0) ) ) ) ) ) ) (block $label$8 (br_if $label$8 (i32.lt_s (get_local $2) (i32.const 1) ) ) (drop (call $memcpy (get_local $5) (get_local $1) (get_local $2) ) ) (set_local $1 (i32.load (get_local $0) ) ) ) (i32.store (get_local $0) (get_local $5) ) (i32.store (get_local $3) (get_local $6) ) (i32.store (i32.add (get_local $0) (i32.const 8) ) (get_local $4) ) (br_if $label$0 (i32.eqz (get_local $1) ) ) (call $_ZdlPv (get_local $1) ) (return) ) ) (func $_ZNSt3__16vectorIN8identity9certvalueENS_9allocatorIS2_EEE8__appendEj (param $0 i32) (param $1 i32) (local $2 i32) (local $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (local $7 i32) (local $8 i32) (local $9 i32) (block $label$0 (block $label$1 (block $label$2 (block $label$3 (block $label$4 (br_if $label$4 (i32.ge_u (i32.div_s (i32.sub (tee_local $9 (i32.load offset=8 (get_local $0) ) ) (tee_local $8 (i32.load offset=4 (get_local $0) ) ) ) (i32.const 48) ) (get_local $1) ) ) (br_if $label$2 (i32.ge_u (tee_local $5 (i32.add (tee_local $4 (i32.div_s (i32.sub (get_local $8) (tee_local $7 (i32.load (get_local $0) ) ) ) (i32.const 48) ) ) (get_local $1) ) ) (i32.const 89478486) ) ) (set_local $8 (i32.const 89478485) ) (block $label$5 (br_if $label$5 (i32.gt_u (tee_local $9 (i32.div_s (i32.sub (get_local $9) (get_local $7) ) (i32.const 48) ) ) (i32.const 44739241) ) ) (br_if $label$3 (i32.eqz (tee_local $8 (select (get_local $5) (tee_local $8 (i32.shl (get_local $9) (i32.const 1) ) ) (i32.lt_u (get_local $8) (get_local $5) ) ) ) ) ) ) (set_local $9 (call $_Znwj (i32.mul (get_local $8) (i32.const 48) ) ) ) (br $label$1) ) (set_local $9 (i32.add (get_local $0) (i32.const 4) ) ) (loop $label$6 (i64.store offset=8 align=4 (tee_local $8 (call $memset (get_local $8) (i32.const 0) (i32.const 48) ) ) (i64.const 0) ) (i64.store align=4 (i32.add (get_local $8) (i32.const 16) ) (i64.const 0) ) (i64.store align=4 (i32.add (get_local $8) (i32.const 24) ) (i64.const 0) ) (i64.store offset=32 align=4 (get_local $8) (i64.const 0) ) (i32.store (i32.add (get_local $8) (i32.const 40) ) (i32.const 0) ) (i32.store8 offset=44 (get_local $8) (i32.const 1) ) (i32.store (get_local $9) (tee_local $8 (i32.add (i32.load (get_local $9) ) (i32.const 48) ) ) ) (br_if $label$6 (tee_local $1 (i32.add (get_local $1) (i32.const -1) ) ) ) (br $label$0) ) ) (set_local $8 (i32.const 0) ) (set_local $9 (i32.const 0) ) (br $label$1) ) (call $_ZNKSt3__120__vector_base_commonILb1EE20__throw_length_errorEv (get_local $0) ) (unreachable) ) (set_local $2 (i32.add (get_local $9) (i32.mul (get_local $8) (i32.const 48) ) ) ) (set_local $7 (tee_local $9 (i32.add (get_local $9) (i32.mul (get_local $4) (i32.const 48) ) ) ) ) (loop $label$7 (i64.store offset=8 align=4 (tee_local $8 (call $memset (get_local $7) (i32.const 0) (i32.const 48) ) ) (i64.const 0) ) (i64.store align=4 (i32.add (get_local $8) (i32.const 16) ) (i64.const 0) ) (i64.store align=4 (i32.add (get_local $8) (i32.const 24) ) (i64.const 0) ) (i64.store offset=32 align=4 (get_local $8) (i64.const 0) ) (i32.store (i32.add (get_local $8) (i32.const 40) ) (i32.const 0) ) (i32.store8 offset=44 (get_local $8) (i32.const 1) ) (set_local $7 (i32.add (get_local $8) (i32.const 48) ) ) (br_if $label$7 (tee_local $1 (i32.add (get_local $1) (i32.const -1) ) ) ) ) (block $label$8 (block $label$9 (br_if $label$9 (i32.eq (tee_local $1 (i32.load (i32.add (get_local $0) (i32.const 4) ) ) ) (tee_local $8 (i32.load (get_local $0) ) ) ) ) (set_local $3 (i32.sub (i32.const 0) (get_local $8) ) ) (set_local $8 (i32.add (get_local $1) (i32.const -24) ) ) (loop $label$10 (i64.store (i32.add (get_local $9) (i32.const -48) ) (i64.load (i32.add (get_local $8) (i32.const -24) ) ) ) (i64.store align=4 (i32.add (get_local $9) (i32.const -36) ) (i64.load align=4 (tee_local $1 (i32.add (get_local $8) (i32.const -12) ) ) ) ) (i32.store (i32.add (get_local $9) (i32.const -40) ) (i32.load (tee_local $4 (i32.add (get_local $8) (i32.const -16) ) ) ) ) (i32.store (get_local $4) (i32.const 0) ) (i32.store (get_local $1) (i32.const 0) ) (i32.store (i32.add (get_local $8) (i32.const -8) ) (i32.const 0) ) (i32.store (tee_local $1 (i32.add (get_local $9) (i32.const -28) ) ) (i32.const 0) ) (i32.store (tee_local $4 (i32.add (get_local $9) (i32.const -24) ) ) (i32.const 0) ) (i32.store (tee_local $5 (i32.add (get_local $9) (i32.const -20) ) ) (i32.const 0) ) (i32.store (get_local $1) (i32.load (tee_local $6 (i32.add (get_local $8) (i32.const -4) ) ) ) ) (i32.store (get_local $4) (i32.load (get_local $8) ) ) (i32.store (get_local $5) (i32.load (tee_local $1 (i32.add (get_local $8) (i32.const 4) ) ) ) ) (i32.store (get_local $1) (i32.const 0) ) (i64.store align=4 (get_local $6) (i64.const 0) ) (i32.store (i32.add (get_local $9) (i32.const -8) ) (i32.load (tee_local $1 (i32.add (get_local $8) (i32.const 16) ) ) ) ) (i64.store align=4 (i32.add (get_local $9) (i32.const -16) ) (i64.load align=4 (tee_local $4 (i32.add (get_local $8) (i32.const 8) ) ) ) ) (i32.store (get_local $4) (i32.const 0) ) (i32.store (i32.add (get_local $8) (i32.const 12) ) (i32.const 0) ) (i32.store (get_local $1) (i32.const 0) ) (i32.store8 (i32.add (get_local $9) (i32.const -4) ) (i32.load8_u (i32.add (get_local $8) (i32.const 20) ) ) ) (set_local $9 (i32.add (get_local $9) (i32.const -48) ) ) (br_if $label$10 (i32.ne (i32.add (tee_local $8 (i32.add (get_local $8) (i32.const -48) ) ) (get_local $3) ) (i32.const -24) ) ) ) (set_local $8 (i32.load (i32.add (get_local $0) (i32.const 4) ) ) ) (set_local $4 (i32.load (get_local $0) ) ) (br $label$8) ) (set_local $4 (get_local $8) ) ) (i32.store (get_local $0) (get_local $9) ) (i32.store (i32.add (get_local $0) (i32.const 4) ) (get_local $7) ) (i32.store (i32.add (get_local $0) (i32.const 8) ) (get_local $2) ) (block $label$11 (br_if $label$11 (i32.eq (get_local $8) (get_local $4) ) ) (set_local $1 (i32.sub (i32.const 0) (get_local $4) ) ) (set_local $8 (i32.add (get_local $8) (i32.const -40) ) ) (loop $label$12 (block $label$13 (br_if $label$13 (i32.eqz (i32.and (i32.load8_u (i32.add (get_local $8) (i32.const 24) ) ) (i32.const 1) ) ) ) (call $_ZdlPv (i32.load (i32.add (get_local $8) (i32.const 32) ) ) ) ) (block $label$14 (br_if $label$14 (i32.eqz (tee_local $9 (i32.load (i32.add (get_local $8) (i32.const 12) ) ) ) ) ) (i32.store (i32.add (get_local $8) (i32.const 16) ) (get_local $9) ) (call $_ZdlPv (get_local $9) ) ) (block $label$15 (br_if $label$15 (i32.eqz (i32.and (i32.load8_u (get_local $8) ) (i32.const 1) ) ) ) (call $_ZdlPv (i32.load (i32.add (get_local $8) (i32.const 8) ) ) ) ) (br_if $label$12 (i32.ne (i32.add (tee_local $8 (i32.add (get_local $8) (i32.const -48) ) ) (get_local $1) ) (i32.const -40) ) ) ) ) (br_if $label$0 (i32.eqz (get_local $4) ) ) (call $_ZdlPv (get_local $4) ) ) ) (func $_ZNK4bcio11multi_indexILy8238557613797670912EN8identity8identrowEJEE31load_object_by_primary_iteratorEl (param $0 i32) (param $1 i32) (result i32) (local $2 i32) (local $3 i32) (local $4 i32) (local $5 i64) (local $6 i32) (local $7 i32) (local $8 i32) (local $9 i32) (set_local $8 (tee_local $9 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 32) ) ) ) (i32.store offset=4 (i32.const 0) (get_local $9) ) (block $label$0 (br_if $label$0 (i32.eq (tee_local $7 (i32.load (i32.add (get_local $0) (i32.const 28) ) ) ) (tee_local $2 (i32.load offset=24 (get_local $0) ) ) ) ) (set_local $3 (i32.sub (i32.const 0) (get_local $2) ) ) (set_local $6 (i32.add (get_local $7) (i32.const -24) ) ) (loop $label$1 (br_if $label$0 (i32.eq (i32.load (i32.add (get_local $6) (i32.const 16) ) ) (get_local $1) ) ) (set_local $7 (get_local $6) ) (set_local $6 (tee_local $4 (i32.add (get_local $6) (i32.const -24) ) ) ) (br_if $label$1 (i32.ne (i32.add (get_local $4) (get_local $3) ) (i32.const -24) ) ) ) ) (block $label$2 (block $label$3 (br_if $label$3 (i32.eq (get_local $7) (get_local $2) ) ) (set_local $6 (i32.load (i32.add (get_local $7) (i32.const -24) ) ) ) (br $label$2) ) (call $bcio_assert (i32.xor (i32.shr_u (tee_local $4 (call $db_get_i64 (get_local $1) (i32.const 0) (i32.const 0) ) ) (i32.const 31) ) (i32.const 1) ) (i32.const 528) ) (block $label$4 (block $label$5 (br_if $label$5 (i32.le_u (get_local $4) (i32.const 512) ) ) (drop (call $db_get_i64 (get_local $1) (tee_local $7 (call $malloc (get_local $4) ) ) (get_local $4) ) ) (call $free (get_local $7) ) (br $label$4) ) (i32.store offset=4 (i32.const 0) (tee_local $7 (i32.sub (get_local $9) (i32.and (i32.add (get_local $4) (i32.const 15) ) (i32.const -16) ) ) ) ) (drop (call $db_get_i64 (get_local $1) (get_local $7) (get_local $4) ) ) ) (i32.store offset=16 (tee_local $6 (call $_Znwj (i32.const 32) ) ) (get_local $0) ) (call $bcio_assert (i32.gt_u (get_local $4) (i32.const 7) ) (i32.const 112) ) (drop (call $memcpy (get_local $6) (get_local $7) (i32.const 8) ) ) (call $bcio_assert (i32.ne (i32.and (get_local $4) (i32.const -8) ) (i32.const 8) ) (i32.const 112) ) (drop (call $memcpy (i32.add (get_local $6) (i32.const 8) ) (i32.add (get_local $7) (i32.const 8) ) (i32.const 8) ) ) (i32.store offset=20 (get_local $6) (get_local $1) ) (i32.store offset=24 (get_local $8) (get_local $6) ) (i64.store offset=16 (get_local $8) (tee_local $5 (i64.load (get_local $6) ) ) ) (i32.store offset=12 (get_local $8) (tee_local $7 (i32.load offset=20 (get_local $6) ) ) ) (block $label$6 (block $label$7 (br_if $label$7 (i32.ge_u (tee_local $4 (i32.load (tee_local $1 (i32.add (get_local $0) (i32.const 28) ) ) ) ) (i32.load (i32.add (get_local $0) (i32.const 32) ) ) ) ) (i64.store offset=8 (get_local $4) (get_local $5) ) (i32.store offset=16 (get_local $4) (get_local $7) ) (i32.store offset=24 (get_local $8) (i32.const 0) ) (i32.store (get_local $4) (get_local $6) ) (i32.store (get_local $1) (i32.add (get_local $4) (i32.const 24) ) ) (br $label$6) ) (call $_ZNSt3__16vectorIN4bcio11multi_indexILy8238557613797670912EN8identity8identrowEJEE8item_ptrENS_9allocatorIS6_EEE24__emplace_back_slow_pathIJNS_10unique_ptrINS5_4itemENS_14default_deleteISC_EEEERyRlEEEvDpOT_ (i32.add (get_local $0) (i32.const 24) ) (i32.add (get_local $8) (i32.const 24) ) (i32.add (get_local $8) (i32.const 16) ) (i32.add (get_local $8) (i32.const 12) ) ) ) (set_local $4 (i32.load offset=24 (get_local $8) ) ) (i32.store offset=24 (get_local $8) (i32.const 0) ) (br_if $label$2 (i32.eqz (get_local $4) ) ) (call $_ZdlPv (get_local $4) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $8) (i32.const 32) ) ) (get_local $6) ) (func $_ZNK4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE5indexILy4590200209379688448ES9_Ly0ELb0EE11lower_boundERKS8_ (param $0 i32) (param $1 i32) (param $2 i32) (local $3 i32) (local $4 i32) (local $5 i64) (local $6 i32) (local $7 i32) (local $8 i32) (local $9 i32) (local $10 i32) (i32.store offset=4 (i32.const 0) (tee_local $10 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 48) ) ) ) (i64.store offset=40 (get_local $10) (i64.const 0) ) (i64.store (i32.add (get_local $10) (i32.const 24) ) (i64.load (i32.add (get_local $2) (i32.const 24) ) ) ) (i64.store (i32.add (get_local $10) (i32.const 16) ) (i64.load (i32.add (get_local $2) (i32.const 16) ) ) ) (i64.store offset=8 (get_local $10) (i64.load (i32.add (get_local $2) (i32.const 8) ) ) ) (i64.store (get_local $10) (i64.load (get_local $2) ) ) (set_local $2 (i32.const 0) ) (block $label$0 (br_if $label$0 (i32.lt_s (tee_local $3 (call $db_idx256_lowerbound (i64.load (tee_local $8 (i32.load (get_local $1) ) ) ) (i64.load offset=8 (get_local $8) ) (i64.const 4805230851241541632) (get_local $10) (i32.const 2) (i32.add (get_local $10) (i32.const 40) ) ) ) (i32.const 0) ) ) (set_local $5 (i64.load offset=40 (get_local $10) ) ) (block $label$1 (br_if $label$1 (i32.eq (tee_local $9 (i32.load (i32.add (tee_local $4 (i32.load (get_local $1) ) ) (i32.const 28) ) ) ) (tee_local $6 (i32.load offset=24 (get_local $4) ) ) ) ) (set_local $2 (i32.add (get_local $9) (i32.const -24) ) ) (set_local $7 (i32.sub (i32.const 0) (get_local $6) ) ) (loop $label$2 (br_if $label$1 (i64.eq (i64.load (i32.load (get_local $2) ) ) (get_local $5) ) ) (set_local $9 (get_local $2) ) (set_local $2 (tee_local $8 (i32.add (get_local $2) (i32.const -24) ) ) ) (br_if $label$2 (i32.ne (i32.add (get_local $8) (get_local $7) ) (i32.const -24) ) ) ) ) (block $label$3 (block $label$4 (br_if $label$4 (i32.eq (get_local $9) (get_local $6) ) ) (call $bcio_assert (i32.eq (i32.load offset=60 (tee_local $2 (i32.load (i32.add (get_local $9) (i32.const -24) ) ) ) ) (get_local $4) ) (i32.const 128) ) (br $label$3) ) (set_local $2 (i32.const 0) ) (br_if $label$3 (i32.lt_s (tee_local $8 (call $db_find_i64 (i64.load (get_local $4) ) (i64.load offset=8 (get_local $4) ) (i64.const 4805230851241541632) (get_local $5) ) ) (i32.const 0) ) ) (call $bcio_assert (i32.eq (i32.load offset=60 (tee_local $2 (call $_ZNK4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE31load_object_by_primary_iteratorEl (get_local $4) (get_local $8) ) ) ) (get_local $4) ) (i32.const 128) ) ) (i32.store offset=68 (get_local $2) (get_local $3) ) ) (i32.store offset=4 (get_local $0) (get_local $2) ) (i32.store (get_local $0) (get_local $1) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $10) (i32.const 48) ) ) ) (func $_ZN4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE6modifyIZNS1_8contract8certpropEyyyRKNSt3__16vectorINS1_9certvalueENSE_9allocatorISG_EEEEEUlRS2_E_EEvRKS2_yOT_ (param $0 i32) (param $1 i32) (param $2 i64) (param $3 i32) (local $4 i32) (local $5 i64) (local $6 i32) (local $7 i32) (local $8 i64) (local $9 i32) (local $10 i64) (local $11 i32) (i32.store offset=4 (i32.const 0) (tee_local $9 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 96) ) ) ) (i64.store offset=80 (tee_local $11 (get_local $9) ) (get_local $2) ) (call $bcio_assert (i32.eq (i32.load offset=60 (get_local $1) ) (get_local $0) ) (i32.const 896) ) (call $bcio_assert (i64.eq (i64.load (get_local $0) ) (call $current_receiver) ) (i32.const 944) ) (set_local $8 (i64.load offset=16 (get_local $1) ) ) (set_local $10 (i64.load offset=8 (get_local $1) ) ) (set_local $5 (i64.load offset=24 (get_local $1) ) ) (call $bcio_assert (i32.const 1) (i32.const 672) ) (i64.store (i32.add (i32.add (get_local $11) (i32.const 48) ) (i32.const 24) ) (get_local $5) ) (i64.store offset=64 (get_local $11) (i64.const 0) ) (i64.store offset=56 (get_local $11) (get_local $10) ) (i64.store offset=48 (get_local $11) (get_local $8) ) (i32.store8 offset=32 (get_local $1) (i32.load8_u offset=44 (i32.load (get_local $3) ) ) ) (i64.store offset=40 (get_local $11) (tee_local $10 (i64.load (get_local $1) ) ) ) (drop (call $_ZNSt3__112basic_stringIcNS_11char_traitsIcEENS_9allocatorIcEEEaSERKS5_ (tee_local $6 (i32.add (get_local $1) (i32.const 36) ) ) (i32.add (i32.load (get_local $3) ) (i32.const 8) ) ) ) (block $label$0 (br_if $label$0 (i32.eq (tee_local $4 (i32.add (get_local $1) (i32.const 48) ) ) (tee_local $7 (i32.add (tee_local $3 (i32.load (get_local $3) ) ) (i32.const 20) ) ) ) ) (call $_ZNSt3__16vectorIcNS_9allocatorIcEEE6assignIPcEENS_9enable_ifIXaasr21__is_forward_iteratorIT_EE5valuesr16is_constructibleIcNS_15iterator_traitsIS7_E9referenceEEE5valueEvE4typeES7_S7_ (get_local $4) (i32.load (get_local $7) ) (i32.load (i32.add (get_local $3) (i32.const 24) ) ) ) ) (call $bcio_assert (i64.eq (get_local $10) (i64.load (get_local $1) ) ) (i32.const 1008) ) (set_local $3 (i32.add (tee_local $6 (select (i32.load (i32.add (get_local $1) (i32.const 40) ) ) (i32.shr_u (tee_local $3 (i32.load8_u (get_local $6) ) ) (i32.const 1) ) (i32.and (get_local $3) (i32.const 1) ) ) ) (i32.const 33) ) ) (set_local $8 (i64.extend_u/i32 (get_local $6) ) ) (loop $label$1 (set_local $3 (i32.add (get_local $3) (i32.const 1) ) ) (br_if $label$1 (i64.ne (tee_local $8 (i64.shr_u (get_local $8) (i64.const 7) ) ) (i64.const 0) ) ) ) (set_local $3 (i32.add (tee_local $6 (i32.sub (i32.load (i32.add (get_local $1) (i32.const 52) ) ) (i32.load (i32.add (get_local $1) (i32.const 48) ) ) ) ) (get_local $3) ) ) (set_local $8 (i64.extend_u/i32 (get_local $6) ) ) (loop $label$2 (set_local $3 (i32.add (get_local $3) (i32.const 1) ) ) (br_if $label$2 (i64.ne (tee_local $8 (i64.shr_u (get_local $8) (i64.const 7) ) ) (i64.const 0) ) ) ) (block $label$3 (block $label$4 (br_if $label$4 (i32.lt_u (get_local $3) (i32.const 513) ) ) (set_local $9 (call $malloc (get_local $3) ) ) (br $label$3) ) (i32.store offset=4 (i32.const 0) (tee_local $9 (i32.sub (get_local $9) (i32.and (i32.add (get_local $3) (i32.const 15) ) (i32.const -16) ) ) ) ) ) (i32.store offset=28 (get_local $11) (get_local $9) ) (i32.store offset=24 (get_local $11) (get_local $9) ) (i32.store offset=32 (get_local $11) (i32.add (get_local $9) (get_local $3) ) ) (drop (call $_ZN8identitylsIN4bcio10datastreamIPcEEEERT_S6_RKNS_7certrowE (i32.add (get_local $11) (i32.const 24) ) (get_local $1) ) ) (call $db_update_i64 (i32.load offset=64 (get_local $1) ) (get_local $2) (get_local $9) (get_local $3) ) (block $label$5 (br_if $label$5 (i32.lt_u (get_local $3) (i32.const 513) ) ) (call $free (get_local $9) ) (set_local $10 (i64.load offset=40 (get_local $11) ) ) ) (block $label$6 (br_if $label$6 (i64.lt_u (get_local $10) (i64.load offset=16 (get_local $0) ) ) ) (i64.store (i32.add (get_local $0) (i32.const 16) ) (select (i64.const -2) (i64.add (get_local $10) (i64.const 1) ) (i64.gt_u (get_local $10) (i64.const -3) ) ) ) ) (i32.store offset=4 (get_local $11) (get_local $1) ) (i32.store offset=12 (get_local $11) (get_local $1) ) (i32.store (get_local $11) (get_local $0) ) (i32.store offset=8 (get_local $11) (i32.add (get_local $11) (i32.const 48) ) ) (i32.store offset=16 (get_local $11) (i32.add (get_local $11) (i32.const 40) ) ) (i32.store offset=20 (get_local $11) (i32.add (get_local $11) (i32.const 80) ) ) (i32.store offset=88 (get_local $11) (get_local $11) ) (call $_ZNK5boost4hana6detail7on_eachIPZN4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS3_10indexed_byILy4590200209379688448ENS_11multi_index13const_mem_funIS6_NS3_9fixed_keyILj32EEEXadL_ZNKS6_7get_keyEvEEEEEEEE6modifyIZNS5_8contract8certpropEyyyRKNSt3__16vectorINS5_9certvalueENSH_9allocatorISJ_EEEEEUlRS6_E_EEvRKS6_yOT_EUlRST_E_EclIJRNS0_5tupleIJNS0_9type_implINSE_5indexILy4590200209379688448ESC_Ly0ELb0EEEE1_ENS11_INS12_ILy4590200209379688448ESC_Ly0ELb1EEEE1_EEEEEEEvDpOT_ (i32.add (get_local $11) (i32.const 88) ) (i32.add (get_local $0) (i32.const 36) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $11) (i32.const 96) ) ) ) (func $_ZNK4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE31load_object_by_primary_iteratorEl (param $0 i32) (param $1 i32) (result i32) (local $2 i32) (local $3 i32) (local $4 i32) (local $5 i64) (local $6 i32) (local $7 i32) (local $8 i32) (local $9 i32) (set_local $8 (tee_local $9 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 48) ) ) ) (i32.store offset=4 (i32.const 0) (get_local $9) ) (block $label$0 (br_if $label$0 (i32.eq (tee_local $7 (i32.load (i32.add (get_local $0) (i32.const 28) ) ) ) (tee_local $2 (i32.load offset=24 (get_local $0) ) ) ) ) (set_local $3 (i32.sub (i32.const 0) (get_local $2) ) ) (set_local $6 (i32.add (get_local $7) (i32.const -24) ) ) (loop $label$1 (br_if $label$0 (i32.eq (i32.load (i32.add (get_local $6) (i32.const 16) ) ) (get_local $1) ) ) (set_local $7 (get_local $6) ) (set_local $6 (tee_local $4 (i32.add (get_local $6) (i32.const -24) ) ) ) (br_if $label$1 (i32.ne (i32.add (get_local $4) (get_local $3) ) (i32.const -24) ) ) ) ) (block $label$2 (block $label$3 (br_if $label$3 (i32.eq (get_local $7) (get_local $2) ) ) (set_local $6 (i32.load (i32.add (get_local $7) (i32.const -24) ) ) ) (br $label$2) ) (call $bcio_assert (i32.xor (i32.shr_u (tee_local $6 (call $db_get_i64 (get_local $1) (i32.const 0) (i32.const 0) ) ) (i32.const 31) ) (i32.const 1) ) (i32.const 528) ) (block $label$4 (block $label$5 (br_if $label$5 (i32.lt_u (get_local $6) (i32.const 513) ) ) (set_local $4 (call $malloc (get_local $6) ) ) (br $label$4) ) (i32.store offset=4 (i32.const 0) (tee_local $4 (i32.sub (get_local $9) (i32.and (i32.add (get_local $6) (i32.const 15) ) (i32.const -16) ) ) ) ) ) (drop (call $db_get_i64 (get_local $1) (get_local $4) (get_local $6) ) ) (i32.store offset=36 (get_local $8) (get_local $4) ) (i32.store offset=32 (get_local $8) (get_local $4) ) (i32.store offset=40 (get_local $8) (i32.add (get_local $4) (get_local $6) ) ) (block $label$6 (br_if $label$6 (i32.lt_u (get_local $6) (i32.const 513) ) ) (call $free (get_local $4) ) ) (i32.store8 offset=32 (tee_local $6 (call $_Znwj (i32.const 72) ) ) (i32.const 0) ) (i64.store offset=36 align=4 (get_local $6) (i64.const 0) ) (i64.store offset=44 align=4 (get_local $6) (i64.const 0) ) (i64.store offset=52 align=4 (get_local $6) (i64.const 0) ) (i32.store offset=60 (get_local $6) (get_local $0) ) (drop (call $_ZN8identityrsIN4bcio10datastreamIPKcEEEERT_S7_RNS_7certrowE (i32.add (get_local $8) (i32.const 32) ) (get_local $6) ) ) (i32.store offset=68 (get_local $6) (i32.const -1) ) (i32.store offset=64 (get_local $6) (get_local $1) ) (i32.store offset=24 (get_local $8) (get_local $6) ) (i64.store offset=16 (get_local $8) (tee_local $5 (i64.load (get_local $6) ) ) ) (i32.store offset=12 (get_local $8) (tee_local $7 (i32.load offset=64 (get_local $6) ) ) ) (block $label$7 (block $label$8 (br_if $label$8 (i32.ge_u (tee_local $4 (i32.load (tee_local $1 (i32.add (get_local $0) (i32.const 28) ) ) ) ) (i32.load (i32.add (get_local $0) (i32.const 32) ) ) ) ) (i64.store offset=8 (get_local $4) (get_local $5) ) (i32.store offset=16 (get_local $4) (get_local $7) ) (i32.store offset=24 (get_local $8) (i32.const 0) ) (i32.store (get_local $4) (get_local $6) ) (i32.store (get_local $1) (i32.add (get_local $4) (i32.const 24) ) ) (br $label$7) ) (call $_ZNSt3__16vectorIN4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS1_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS4_NS1_9fixed_keyILj32EEEXadL_ZNKS4_7get_keyEvEEEEEEEE8item_ptrENS_9allocatorISE_EEE24__emplace_back_slow_pathIJNS_10unique_ptrINSD_4itemENS_14default_deleteISK_EEEERyRlEEEvDpOT_ (i32.add (get_local $0) (i32.const 24) ) (i32.add (get_local $8) (i32.const 24) ) (i32.add (get_local $8) (i32.const 16) ) (i32.add (get_local $8) (i32.const 12) ) ) ) (set_local $4 (i32.load offset=24 (get_local $8) ) ) (i32.store offset=24 (get_local $8) (i32.const 0) ) (br_if $label$2 (i32.eqz (get_local $4) ) ) (block $label$9 (br_if $label$9 (i32.eqz (tee_local $7 (i32.load offset=48 (get_local $4) ) ) ) ) (i32.store (i32.add (get_local $4) (i32.const 52) ) (get_local $7) ) (call $_ZdlPv (get_local $7) ) ) (block $label$10 (br_if $label$10 (i32.eqz (i32.and (i32.load8_u offset=36 (get_local $4) ) (i32.const 1) ) ) ) (call $_ZdlPv (i32.load (i32.add (get_local $4) (i32.const 44) ) ) ) ) (call $_ZdlPv (get_local $4) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $8) (i32.const 48) ) ) (get_local $6) ) (func $_ZN4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE14const_iteratormmEv (param $0 i32) (result i32) (local $1 i32) (local $2 i32) (i32.store offset=4 (i32.const 0) (tee_local $2 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 16) ) ) ) (block $label$0 (block $label$1 (br_if $label$1 (i32.eqz (tee_local $1 (i32.load offset=4 (get_local $0) ) ) ) ) (call $bcio_assert (i32.xor (i32.shr_u (tee_local $1 (call $db_previous_i64 (i32.load offset=64 (get_local $1) ) (i32.add (get_local $2) (i32.const 8) ) ) ) (i32.const 31) ) (i32.const 1) ) (i32.const 1136) ) (br $label$0) ) (call $bcio_assert (i32.ne (tee_local $1 (call $db_end_i64 (i64.load (tee_local $1 (i32.load (get_local $0) ) ) ) (i64.load offset=8 (get_local $1) ) (i64.const 4805230851241541632) ) ) (i32.const -1) ) (i32.const 1072) ) (call $bcio_assert (i32.xor (i32.shr_u (tee_local $1 (call $db_previous_i64 (get_local $1) (i32.add (get_local $2) (i32.const 8) ) ) ) (i32.const 31) ) (i32.const 1) ) (i32.const 1072) ) ) (i32.store (i32.add (get_local $0) (i32.const 4) ) (call $_ZNK4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE31load_object_by_primary_iteratorEl (i32.load (get_local $0) ) (get_local $1) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $2) (i32.const 16) ) ) (get_local $0) ) (func $_ZN4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE7emplaceIZNS1_8contract8certpropEyyyRKNSt3__16vectorINS1_9certvalueENSE_9allocatorISG_EEEEEUlRS2_E0_EENSB_14const_iteratorEyOT_ (param $0 i32) (param $1 i32) (param $2 i64) (param $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (local $7 i32) (i32.store offset=4 (i32.const 0) (tee_local $7 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 48) ) ) ) (i64.store offset=40 (get_local $7) (get_local $2) ) (call $bcio_assert (i64.eq (i64.load (get_local $1) ) (call $current_receiver) ) (i32.const 448) ) (i32.store offset=20 (get_local $7) (get_local $3) ) (i32.store offset=16 (get_local $7) (get_local $1) ) (i32.store offset=24 (get_local $7) (i32.add (get_local $7) (i32.const 40) ) ) (i32.store8 offset=32 (tee_local $3 (call $_Znwj (i32.const 72) ) ) (i32.const 0) ) (i64.store offset=36 align=4 (get_local $3) (i64.const 0) ) (i64.store offset=44 align=4 (get_local $3) (i64.const 0) ) (i64.store offset=52 align=4 (get_local $3) (i64.const 0) ) (i32.store offset=60 (get_local $3) (get_local $1) ) (call $_ZZN4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE7emplaceIZNS1_8contract8certpropEyyyRKNSt3__16vectorINS1_9certvalueENSE_9allocatorISG_EEEEEUlRS2_E0_EENSB_14const_iteratorEyOT_ENKUlRSP_E_clINSB_4itemEEEDaSR_ (i32.add (get_local $7) (i32.const 16) ) (get_local $3) ) (i32.store offset=32 (get_local $7) (get_local $3) ) (i64.store offset=16 (get_local $7) (tee_local $2 (i64.load (get_local $3) ) ) ) (i32.store offset=12 (get_local $7) (tee_local $4 (i32.load offset=64 (get_local $3) ) ) ) (block $label$0 (block $label$1 (br_if $label$1 (i32.ge_u (tee_local $5 (i32.load (tee_local $6 (i32.add (get_local $1) (i32.const 28) ) ) ) ) (i32.load (i32.add (get_local $1) (i32.const 32) ) ) ) ) (i64.store offset=8 (get_local $5) (get_local $2) ) (i32.store offset=16 (get_local $5) (get_local $4) ) (i32.store offset=32 (get_local $7) (i32.const 0) ) (i32.store (get_local $5) (get_local $3) ) (i32.store (get_local $6) (i32.add (get_local $5) (i32.const 24) ) ) (br $label$0) ) (call $_ZNSt3__16vectorIN4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS1_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS4_NS1_9fixed_keyILj32EEEXadL_ZNKS4_7get_keyEvEEEEEEEE8item_ptrENS_9allocatorISE_EEE24__emplace_back_slow_pathIJNS_10unique_ptrINSD_4itemENS_14default_deleteISK_EEEERyRlEEEvDpOT_ (i32.add (get_local $1) (i32.const 24) ) (i32.add (get_local $7) (i32.const 32) ) (i32.add (get_local $7) (i32.const 16) ) (i32.add (get_local $7) (i32.const 12) ) ) ) (i32.store offset=4 (get_local $0) (get_local $3) ) (i32.store (get_local $0) (get_local $1) ) (set_local $3 (i32.load offset=32 (get_local $7) ) ) (i32.store offset=32 (get_local $7) (i32.const 0) ) (block $label$2 (br_if $label$2 (i32.eqz (get_local $3) ) ) (block $label$3 (br_if $label$3 (i32.eqz (tee_local $1 (i32.load offset=48 (get_local $3) ) ) ) ) (i32.store (i32.add (get_local $3) (i32.const 52) ) (get_local $1) ) (call $_ZdlPv (get_local $1) ) ) (block $label$4 (br_if $label$4 (i32.eqz (i32.and (i32.load8_u offset=36 (get_local $3) ) (i32.const 1) ) ) ) (call $_ZdlPv (i32.load (i32.add (get_local $3) (i32.const 44) ) ) ) ) (call $_ZdlPv (get_local $3) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $7) (i32.const 48) ) ) ) (func $_ZN4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE5indexILy4590200209379688448ES9_Ly0ELb0EE14const_iteratorppEv (param $0 i32) (result i32) (local $1 i32) (local $2 i32) (local $3 i64) (local $4 i32) (local $5 i32) (local $6 i32) (local $7 i32) (local $8 i32) (local $9 i32) (i32.store offset=4 (i32.const 0) (tee_local $9 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 32) ) ) ) (set_local $7 (i32.const 0) ) (call $bcio_assert (i32.ne (i32.load offset=4 (get_local $0) ) (i32.const 0) ) (i32.const 240) ) (block $label$0 (br_if $label$0 (i32.ne (tee_local $6 (i32.load offset=68 (tee_local $8 (i32.load offset=4 (get_local $0) ) ) ) ) (i32.const -1) ) ) (i64.store (i32.add (get_local $9) (i32.const 24) ) (i64.const 0) ) (i64.store (i32.add (get_local $9) (i32.const 16) ) (i64.const 0) ) (i64.store offset=8 (get_local $9) (i64.const 0) ) (i64.store (get_local $9) (i64.const 0) ) (set_local $6 (call $db_idx256_find_primary (i64.load (tee_local $6 (i32.load (i32.load (get_local $0) ) ) ) ) (i64.load offset=8 (get_local $6) ) (i64.const 4805230851241541632) (get_local $9) (i32.const 2) (i64.load (get_local $8) ) ) ) (i32.store offset=68 (i32.load (i32.add (get_local $0) (i32.const 4) ) ) (get_local $6) ) ) (i64.store (get_local $9) (i64.const 0) ) (block $label$1 (br_if $label$1 (i32.lt_s (tee_local $1 (call $db_idx256_next (get_local $6) (get_local $9) ) ) (i32.const 0) ) ) (set_local $3 (i64.load (get_local $9) ) ) (block $label$2 (br_if $label$2 (i32.eq (tee_local $8 (i32.load (i32.add (tee_local $2 (i32.load (i32.load (get_local $0) ) ) ) (i32.const 28) ) ) ) (tee_local $4 (i32.load offset=24 (get_local $2) ) ) ) ) (set_local $7 (i32.add (get_local $8) (i32.const -24) ) ) (set_local $5 (i32.sub (i32.const 0) (get_local $4) ) ) (loop $label$3 (br_if $label$2 (i64.eq (i64.load (i32.load (get_local $7) ) ) (get_local $3) ) ) (set_local $8 (get_local $7) ) (set_local $7 (tee_local $6 (i32.add (get_local $7) (i32.const -24) ) ) ) (br_if $label$3 (i32.ne (i32.add (get_local $6) (get_local $5) ) (i32.const -24) ) ) ) ) (block $label$4 (block $label$5 (br_if $label$5 (i32.eq (get_local $8) (get_local $4) ) ) (call $bcio_assert (i32.eq (i32.load offset=60 (tee_local $7 (i32.load (i32.add (get_local $8) (i32.const -24) ) ) ) ) (get_local $2) ) (i32.const 128) ) (br $label$4) ) (call $bcio_assert (i32.eq (i32.load offset=60 (tee_local $7 (call $_ZNK4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE31load_object_by_primary_iteratorEl (get_local $2) (call $db_find_i64 (i64.load (get_local $2) ) (i64.load offset=8 (get_local $2) ) (i64.const 4805230851241541632) (get_local $3) ) ) ) ) (get_local $2) ) (i32.const 128) ) ) (i32.store offset=68 (get_local $7) (get_local $1) ) ) (i32.store (i32.add (get_local $0) (i32.const 4) ) (get_local $7) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $9) (i32.const 32) ) ) (get_local $0) ) (func $_ZN4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE5eraseERKS2_ (param $0 i32) (param $1 i32) (local $2 i64) (local $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (local $7 i32) (local $8 i32) (local $9 i32) (i32.store offset=4 (i32.const 0) (tee_local $9 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 32) ) ) ) (call $bcio_assert (i32.eq (i32.load offset=60 (get_local $1) ) (get_local $0) ) (i32.const 272) ) (call $bcio_assert (i64.eq (i64.load (get_local $0) ) (call $current_receiver) ) (i32.const 320) ) (block $label$0 (br_if $label$0 (i32.eq (tee_local $7 (i32.load (tee_local $5 (i32.add (get_local $0) (i32.const 28) ) ) ) ) (tee_local $3 (i32.load offset=24 (get_local $0) ) ) ) ) (set_local $2 (i64.load (get_local $1) ) ) (set_local $6 (i32.sub (i32.const 0) (get_local $3) ) ) (set_local $4 (i32.add (get_local $7) (i32.const -24) ) ) (loop $label$1 (br_if $label$0 (i64.eq (i64.load (i32.load (get_local $4) ) ) (get_local $2) ) ) (set_local $7 (get_local $4) ) (set_local $4 (tee_local $8 (i32.add (get_local $4) (i32.const -24) ) ) ) (br_if $label$1 (i32.ne (i32.add (get_local $8) (get_local $6) ) (i32.const -24) ) ) ) ) (call $bcio_assert (i32.ne (get_local $7) (get_local $3) ) (i32.const 384) ) (set_local $8 (i32.add (get_local $7) (i32.const -24) ) ) (block $label$2 (block $label$3 (br_if $label$3 (i32.eq (get_local $7) (tee_local $4 (i32.load (get_local $5) ) ) ) ) (set_local $3 (i32.sub (i32.const 0) (get_local $4) ) ) (set_local $7 (get_local $8) ) (loop $label$4 (set_local $6 (i32.load (tee_local $8 (i32.add (get_local $7) (i32.const 24) ) ) ) ) (i32.store (get_local $8) (i32.const 0) ) (set_local $4 (i32.load (get_local $7) ) ) (i32.store (get_local $7) (get_local $6) ) (block $label$5 (br_if $label$5 (i32.eqz (get_local $4) ) ) (block $label$6 (br_if $label$6 (i32.eqz (tee_local $6 (i32.load offset=48 (get_local $4) ) ) ) ) (i32.store (i32.add (get_local $4) (i32.const 52) ) (get_local $6) ) (call $_ZdlPv (get_local $6) ) ) (block $label$7 (br_if $label$7 (i32.eqz (i32.and (i32.load8_u offset=36 (get_local $4) ) (i32.const 1) ) ) ) (call $_ZdlPv (i32.load (i32.add (get_local $4) (i32.const 44) ) ) ) ) (call $_ZdlPv (get_local $4) ) ) (i32.store (i32.add (get_local $7) (i32.const 16) ) (i32.load (i32.add (get_local $7) (i32.const 40) ) ) ) (i64.store (i32.add (get_local $7) (i32.const 8) ) (i64.load (i32.add (get_local $7) (i32.const 32) ) ) ) (set_local $7 (get_local $8) ) (br_if $label$4 (i32.ne (i32.add (get_local $8) (get_local $3) ) (i32.const -24) ) ) ) (br_if $label$2 (i32.eq (tee_local $7 (i32.load (i32.add (get_local $0) (i32.const 28) ) ) ) (get_local $8) ) ) ) (loop $label$8 (set_local $4 (i32.load (tee_local $7 (i32.add (get_local $7) (i32.const -24) ) ) ) ) (i32.store (get_local $7) (i32.const 0) ) (block $label$9 (br_if $label$9 (i32.eqz (get_local $4) ) ) (block $label$10 (br_if $label$10 (i32.eqz (tee_local $6 (i32.load offset=48 (get_local $4) ) ) ) ) (i32.store (i32.add (get_local $4) (i32.const 52) ) (get_local $6) ) (call $_ZdlPv (get_local $6) ) ) (block $label$11 (br_if $label$11 (i32.eqz (i32.and (i32.load8_u offset=36 (get_local $4) ) (i32.const 1) ) ) ) (call $_ZdlPv (i32.load (i32.add (get_local $4) (i32.const 44) ) ) ) ) (call $_ZdlPv (get_local $4) ) ) (br_if $label$8 (i32.ne (get_local $8) (get_local $7) ) ) ) ) (i32.store (i32.add (get_local $0) (i32.const 28) ) (get_local $8) ) (call $db_remove_i64 (i32.load offset=64 (get_local $1) ) ) (block $label$12 (block $label$13 (br_if $label$13 (i32.gt_s (tee_local $7 (i32.load offset=68 (get_local $1) ) ) (i32.const -1) ) ) (i64.store (i32.add (get_local $9) (i32.const 24) ) (i64.const 0) ) (i64.store (i32.add (get_local $9) (i32.const 16) ) (i64.const 0) ) (i64.store offset=8 (get_local $9) (i64.const 0) ) (i64.store (get_local $9) (i64.const 0) ) (br_if $label$12 (i32.lt_s (tee_local $7 (call $db_idx256_find_primary (i64.load (get_local $0) ) (i64.load offset=8 (get_local $0) ) (i64.const 4805230851241541632) (get_local $9) (i32.const 2) (i64.load (get_local $1) ) ) ) (i32.const 0) ) ) ) (call $db_idx256_remove (get_local $7) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $9) (i32.const 32) ) ) ) (func $_ZN4bcio9singletonILy3607749778735104000EyE3setERKyy (param $0 i32) (param $1 i32) (param $2 i64) (local $3 i32) (local $4 i32) (i32.store offset=4 (i32.const 0) (tee_local $4 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 16) ) ) ) (block $label$0 (block $label$1 (block $label$2 (block $label$3 (br_if $label$3 (i32.eq (tee_local $3 (i32.load (i32.add (get_local $0) (i32.const 28) ) ) ) (i32.load offset=24 (get_local $0) ) ) ) (call $bcio_assert (i32.eq (i32.load offset=8 (tee_local $3 (i32.load (i32.add (get_local $3) (i32.const -24) ) ) ) ) (get_local $0) ) (i32.const 128) ) (br_if $label$2 (get_local $3) ) (br $label$1) ) (br_if $label$1 (i32.lt_s (tee_local $3 (call $db_find_i64 (i64.load (get_local $0) ) (i64.load offset=8 (get_local $0) ) (i64.const 3607749778735104000) (i64.const 3607749778735104000) ) ) (i32.const 0) ) ) (call $bcio_assert (i32.eq (i32.load offset=8 (tee_local $3 (call $_ZNK4bcio11multi_indexILy3607749778735104000ENS_9singletonILy3607749778735104000EyE3rowEJEE31load_object_by_primary_iteratorEl (get_local $0) (get_local $3) ) ) ) (get_local $0) ) (i32.const 128) ) ) (i32.store (get_local $4) (get_local $1) ) (call $bcio_assert (i32.const 1) (i32.const 720) ) (call $_ZN4bcio11multi_indexILy3607749778735104000ENS_9singletonILy3607749778735104000EyE3rowEJEE6modifyIZNS2_3setERKyyEUlRS3_E_EEvRKS3_yOT_ (get_local $0) (get_local $3) (get_local $2) (get_local $4) ) (br $label$0) ) (i32.store offset=8 (get_local $4) (get_local $1) ) (call $_ZN4bcio11multi_indexILy3607749778735104000ENS_9singletonILy3607749778735104000EyE3rowEJEE7emplaceIZNS2_3setERKyyEUlRS3_E0_EENS4_14const_iteratorEyOT_ (get_local $4) (get_local $0) (get_local $2) (i32.add (get_local $4) (i32.const 8) ) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $4) (i32.const 16) ) ) ) (func $_ZNK4bcio11multi_indexILy3607749778735104000ENS_9singletonILy3607749778735104000EyE3rowEJEE31load_object_by_primary_iteratorEl (param $0 i32) (param $1 i32) (result i32) (local $2 i32) (local $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (local $7 i32) (local $8 i32) (set_local $7 (tee_local $8 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 32) ) ) ) (i32.store offset=4 (i32.const 0) (get_local $8) ) (block $label$0 (br_if $label$0 (i32.eq (tee_local $6 (i32.load (i32.add (get_local $0) (i32.const 28) ) ) ) (tee_local $2 (i32.load offset=24 (get_local $0) ) ) ) ) (set_local $3 (i32.sub (i32.const 0) (get_local $2) ) ) (set_local $5 (i32.add (get_local $6) (i32.const -24) ) ) (loop $label$1 (br_if $label$0 (i32.eq (i32.load (i32.add (get_local $5) (i32.const 16) ) ) (get_local $1) ) ) (set_local $6 (get_local $5) ) (set_local $5 (tee_local $4 (i32.add (get_local $5) (i32.const -24) ) ) ) (br_if $label$1 (i32.ne (i32.add (get_local $4) (get_local $3) ) (i32.const -24) ) ) ) ) (block $label$2 (block $label$3 (br_if $label$3 (i32.eq (get_local $6) (get_local $2) ) ) (set_local $5 (i32.load (i32.add (get_local $6) (i32.const -24) ) ) ) (br $label$2) ) (call $bcio_assert (i32.xor (i32.shr_u (tee_local $4 (call $db_get_i64 (get_local $1) (i32.const 0) (i32.const 0) ) ) (i32.const 31) ) (i32.const 1) ) (i32.const 528) ) (block $label$4 (block $label$5 (br_if $label$5 (i32.le_u (get_local $4) (i32.const 512) ) ) (drop (call $db_get_i64 (get_local $1) (tee_local $6 (call $malloc (get_local $4) ) ) (get_local $4) ) ) (call $free (get_local $6) ) (br $label$4) ) (i32.store offset=4 (i32.const 0) (tee_local $6 (i32.sub (get_local $8) (i32.and (i32.add (get_local $4) (i32.const 15) ) (i32.const -16) ) ) ) ) (drop (call $db_get_i64 (get_local $1) (get_local $6) (get_local $4) ) ) ) (i32.store offset=8 (tee_local $5 (call $_Znwj (i32.const 24) ) ) (get_local $0) ) (call $bcio_assert (i32.gt_u (get_local $4) (i32.const 7) ) (i32.const 112) ) (drop (call $memcpy (get_local $5) (get_local $6) (i32.const 8) ) ) (i32.store offset=12 (get_local $5) (get_local $1) ) (i32.store offset=24 (get_local $7) (get_local $5) ) (i64.store offset=16 (get_local $7) (i64.const 3607749778735104000) ) (i32.store offset=12 (get_local $7) (tee_local $6 (i32.load offset=12 (get_local $5) ) ) ) (block $label$6 (block $label$7 (br_if $label$7 (i32.ge_u (tee_local $4 (i32.load (tee_local $1 (i32.add (get_local $0) (i32.const 28) ) ) ) ) (i32.load (i32.add (get_local $0) (i32.const 32) ) ) ) ) (i64.store offset=8 (get_local $4) (i64.const 3607749778735104000) ) (i32.store offset=16 (get_local $4) (get_local $6) ) (i32.store offset=24 (get_local $7) (i32.const 0) ) (i32.store (get_local $4) (get_local $5) ) (i32.store (get_local $1) (i32.add (get_local $4) (i32.const 24) ) ) (br $label$6) ) (call $_ZNSt3__16vectorIN4bcio11multi_indexILy3607749778735104000ENS1_9singletonILy3607749778735104000EyE3rowEJEE8item_ptrENS_9allocatorIS7_EEE24__emplace_back_slow_pathIJNS_10unique_ptrINS6_4itemENS_14default_deleteISD_EEEERyRlEEEvDpOT_ (i32.add (get_local $0) (i32.const 24) ) (i32.add (get_local $7) (i32.const 24) ) (i32.add (get_local $7) (i32.const 16) ) (i32.add (get_local $7) (i32.const 12) ) ) ) (set_local $4 (i32.load offset=24 (get_local $7) ) ) (i32.store offset=24 (get_local $7) (i32.const 0) ) (br_if $label$2 (i32.eqz (get_local $4) ) ) (call $_ZdlPv (get_local $4) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $7) (i32.const 32) ) ) (get_local $5) ) (func $_ZN4bcio11multi_indexILy3607749778735104000ENS_9singletonILy3607749778735104000EyE3rowEJEE5eraseERKS3_ (param $0 i32) (param $1 i32) (local $2 i32) (local $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (call $bcio_assert (i32.eq (i32.load offset=8 (get_local $1) ) (get_local $0) ) (i32.const 272) ) (call $bcio_assert (i64.eq (i64.load (get_local $0) ) (call $current_receiver) ) (i32.const 320) ) (call $bcio_assert (i32.ne (tee_local $5 (i32.load (tee_local $6 (i32.add (get_local $0) (i32.const 28) ) ) ) ) (i32.load offset=24 (get_local $0) ) ) (i32.const 384) ) (set_local $4 (i32.add (get_local $5) (i32.const -24) ) ) (block $label$0 (block $label$1 (block $label$2 (br_if $label$2 (i32.eq (get_local $5) (tee_local $6 (i32.load (get_local $6) ) ) ) ) (set_local $2 (i32.sub (i32.const 0) (get_local $6) ) ) (loop $label$3 (set_local $3 (i32.load (tee_local $6 (i32.add (get_local $4) (i32.const 24) ) ) ) ) (i32.store (get_local $6) (i32.const 0) ) (set_local $5 (i32.load (get_local $4) ) ) (i32.store (get_local $4) (get_local $3) ) (block $label$4 (br_if $label$4 (i32.eqz (get_local $5) ) ) (call $_ZdlPv (get_local $5) ) ) (i32.store (i32.add (get_local $4) (i32.const 16) ) (i32.load (i32.add (get_local $4) (i32.const 40) ) ) ) (i64.store (i32.add (get_local $4) (i32.const 8) ) (i64.load (i32.add (get_local $4) (i32.const 32) ) ) ) (set_local $4 (get_local $6) ) (br_if $label$3 (i32.ne (i32.add (get_local $6) (get_local $2) ) (i32.const -24) ) ) ) (br_if $label$1 (i32.ne (tee_local $5 (i32.load (i32.add (get_local $0) (i32.const 28) ) ) ) (get_local $6) ) ) (br $label$0) ) (set_local $6 (get_local $4) ) ) (loop $label$5 (set_local $4 (i32.load (tee_local $5 (i32.add (get_local $5) (i32.const -24) ) ) ) ) (i32.store (get_local $5) (i32.const 0) ) (block $label$6 (br_if $label$6 (i32.eqz (get_local $4) ) ) (call $_ZdlPv (get_local $4) ) ) (br_if $label$5 (i32.ne (get_local $6) (get_local $5) ) ) ) ) (i32.store (i32.add (get_local $0) (i32.const 28) ) (get_local $6) ) (call $db_remove_i64 (i32.load offset=12 (get_local $1) ) ) ) (func $_ZNSt3__16vectorIN4bcio11multi_indexILy3607749778735104000ENS1_9singletonILy3607749778735104000EyE3rowEJEE8item_ptrENS_9allocatorIS7_EEE24__emplace_back_slow_pathIJNS_10unique_ptrINS6_4itemENS_14default_deleteISD_EEEERyRlEEEvDpOT_ (param $0 i32) (param $1 i32) (param $2 i32) (param $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (local $7 i32) (block $label$0 (block $label$1 (br_if $label$1 (i32.ge_u (tee_local $5 (i32.add (tee_local $4 (i32.div_s (i32.sub (i32.load offset=4 (get_local $0) ) (tee_local $6 (i32.load (get_local $0) ) ) ) (i32.const 24) ) ) (i32.const 1) ) ) (i32.const 178956971) ) ) (set_local $7 (i32.const 178956970) ) (block $label$2 (block $label$3 (br_if $label$3 (i32.gt_u (tee_local $6 (i32.div_s (i32.sub (i32.load offset=8 (get_local $0) ) (get_local $6) ) (i32.const 24) ) ) (i32.const 89478484) ) ) (br_if $label$2 (i32.eqz (tee_local $7 (select (get_local $5) (tee_local $7 (i32.shl (get_local $6) (i32.const 1) ) ) (i32.lt_u (get_local $7) (get_local $5) ) ) ) ) ) ) (set_local $6 (call $_Znwj (i32.mul (get_local $7) (i32.const 24) ) ) ) (br $label$0) ) (set_local $7 (i32.const 0) ) (set_local $6 (i32.const 0) ) (br $label$0) ) (call $_ZNKSt3__120__vector_base_commonILb1EE20__throw_length_errorEv (get_local $0) ) (unreachable) ) (set_local $5 (i32.load (get_local $1) ) ) (i32.store (get_local $1) (i32.const 0) ) (i32.store (tee_local $1 (i32.add (get_local $6) (i32.mul (get_local $4) (i32.const 24) ) ) ) (get_local $5) ) (i64.store offset=8 (get_local $1) (i64.load (get_local $2) ) ) (i32.store offset=16 (get_local $1) (i32.load (get_local $3) ) ) (set_local $4 (i32.add (get_local $6) (i32.mul (get_local $7) (i32.const 24) ) ) ) (set_local $5 (i32.add (get_local $1) (i32.const 24) ) ) (block $label$4 (block $label$5 (br_if $label$5 (i32.eq (tee_local $6 (i32.load (i32.add (get_local $0) (i32.const 4) ) ) ) (tee_local $7 (i32.load (get_local $0) ) ) ) ) (loop $label$6 (set_local $3 (i32.load (tee_local $2 (i32.add (get_local $6) (i32.const -24) ) ) ) ) (i32.store (get_local $2) (i32.const 0) ) (i32.store (i32.add (get_local $1) (i32.const -24) ) (get_local $3) ) (i32.store (i32.add (get_local $1) (i32.const -8) ) (i32.load (i32.add (get_local $6) (i32.const -8) ) ) ) (i32.store (i32.add (get_local $1) (i32.const -12) ) (i32.load (i32.add (get_local $6) (i32.const -12) ) ) ) (i32.store (i32.add (get_local $1) (i32.const -16) ) (i32.load (i32.add (get_local $6) (i32.const -16) ) ) ) (set_local $1 (i32.add (get_local $1) (i32.const -24) ) ) (set_local $6 (get_local $2) ) (br_if $label$6 (i32.ne (get_local $7) (get_local $2) ) ) ) (set_local $7 (i32.load (i32.add (get_local $0) (i32.const 4) ) ) ) (set_local $6 (i32.load (get_local $0) ) ) (br $label$4) ) (set_local $6 (get_local $7) ) ) (i32.store (get_local $0) (get_local $1) ) (i32.store (i32.add (get_local $0) (i32.const 4) ) (get_local $5) ) (i32.store (i32.add (get_local $0) (i32.const 8) ) (get_local $4) ) (block $label$7 (br_if $label$7 (i32.eq (get_local $7) (get_local $6) ) ) (loop $label$8 (set_local $1 (i32.load (tee_local $7 (i32.add (get_local $7) (i32.const -24) ) ) ) ) (i32.store (get_local $7) (i32.const 0) ) (block $label$9 (br_if $label$9 (i32.eqz (get_local $1) ) ) (call $_ZdlPv (get_local $1) ) ) (br_if $label$8 (i32.ne (get_local $6) (get_local $7) ) ) ) ) (block $label$10 (br_if $label$10 (i32.eqz (get_local $6) ) ) (call $_ZdlPv (get_local $6) ) ) ) (func $_ZN4bcio11multi_indexILy3607749778735104000ENS_9singletonILy3607749778735104000EyE3rowEJEE6modifyIZNS2_3setERKyyEUlRS3_E_EEvRKS3_yOT_ (param $0 i32) (param $1 i32) (param $2 i64) (param $3 i32) (local $4 i32) (i32.store offset=4 (i32.const 0) (tee_local $4 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 16) ) ) ) (call $bcio_assert (i32.eq (i32.load offset=8 (get_local $1) ) (get_local $0) ) (i32.const 896) ) (call $bcio_assert (i64.eq (i64.load (get_local $0) ) (call $current_receiver) ) (i32.const 944) ) (i64.store (get_local $1) (i64.load (i32.load (get_local $3) ) ) ) (call $bcio_assert (i32.const 1) (i32.const 1008) ) (call $bcio_assert (i32.const 1) (i32.const 512) ) (drop (call $memcpy (get_local $4) (get_local $1) (i32.const 8) ) ) (call $db_update_i64 (i32.load offset=12 (get_local $1) ) (get_local $2) (get_local $4) (i32.const 8) ) (block $label$0 (br_if $label$0 (i64.gt_u (i64.load offset=16 (get_local $0) ) (i64.const 3607749778735104000) ) ) (i64.store (i32.add (get_local $0) (i32.const 16) ) (i64.const 3607749778735104001) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $4) (i32.const 16) ) ) ) (func $_ZN4bcio11multi_indexILy3607749778735104000ENS_9singletonILy3607749778735104000EyE3rowEJEE7emplaceIZNS2_3setERKyyEUlRS3_E0_EENS4_14const_iteratorEyOT_ (param $0 i32) (param $1 i32) (param $2 i64) (param $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (local $7 i32) (i32.store offset=4 (i32.const 0) (tee_local $7 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 32) ) ) ) (call $bcio_assert (i64.eq (i64.load (get_local $1) ) (call $current_receiver) ) (i32.const 448) ) (i32.store offset=8 (tee_local $4 (call $_Znwj (i32.const 24) ) ) (get_local $1) ) (i64.store (get_local $4) (i64.load (i32.load (get_local $3) ) ) ) (call $bcio_assert (i32.const 1) (i32.const 512) ) (drop (call $memcpy (i32.add (get_local $7) (i32.const 16) ) (get_local $4) (i32.const 8) ) ) (i32.store offset=12 (get_local $4) (call $db_store_i64 (i64.load offset=8 (get_local $1) ) (i64.const 3607749778735104000) (get_local $2) (i64.const 3607749778735104000) (i32.add (get_local $7) (i32.const 16) ) (i32.const 8) ) ) (block $label$0 (br_if $label$0 (i64.gt_u (i64.load offset=16 (get_local $1) ) (i64.const 3607749778735104000) ) ) (i64.store (i32.add (get_local $1) (i32.const 16) ) (i64.const 3607749778735104001) ) ) (i32.store offset=8 (get_local $7) (get_local $4) ) (i64.store offset=16 (get_local $7) (i64.const 3607749778735104000) ) (i32.store offset=4 (get_local $7) (tee_local $5 (i32.load offset=12 (get_local $4) ) ) ) (block $label$1 (block $label$2 (br_if $label$2 (i32.ge_u (tee_local $3 (i32.load (tee_local $6 (i32.add (get_local $1) (i32.const 28) ) ) ) ) (i32.load (i32.add (get_local $1) (i32.const 32) ) ) ) ) (i64.store offset=8 (get_local $3) (i64.const 3607749778735104000) ) (i32.store offset=16 (get_local $3) (get_local $5) ) (i32.store offset=8 (get_local $7) (i32.const 0) ) (i32.store (get_local $3) (get_local $4) ) (i32.store (get_local $6) (i32.add (get_local $3) (i32.const 24) ) ) (br $label$1) ) (call $_ZNSt3__16vectorIN4bcio11multi_indexILy3607749778735104000ENS1_9singletonILy3607749778735104000EyE3rowEJEE8item_ptrENS_9allocatorIS7_EEE24__emplace_back_slow_pathIJNS_10unique_ptrINS6_4itemENS_14default_deleteISD_EEEERyRlEEEvDpOT_ (i32.add (get_local $1) (i32.const 24) ) (i32.add (get_local $7) (i32.const 8) ) (i32.add (get_local $7) (i32.const 16) ) (i32.add (get_local $7) (i32.const 4) ) ) ) (i32.store offset=4 (get_local $0) (get_local $4) ) (i32.store (get_local $0) (get_local $1) ) (set_local $1 (i32.load offset=8 (get_local $7) ) ) (i32.store offset=8 (get_local $7) (i32.const 0) ) (block $label$3 (br_if $label$3 (i32.eqz (get_local $1) ) ) (call $_ZdlPv (get_local $1) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $7) (i32.const 32) ) ) ) (func $_ZZN4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS2_NS_9fixed_keyILj32EEEXadL_ZNKS2_7get_keyEvEEEEEEEE7emplaceIZNS1_8contract8certpropEyyyRKNSt3__16vectorINS1_9certvalueENSE_9allocatorISG_EEEEEUlRS2_E0_EENSB_14const_iteratorEyOT_ENKUlRSP_E_clINSB_4itemEEEDaSR_ (param $0 i32) (param $1 i32) (local $2 i32) (local $3 i32) (local $4 i32) (local $5 i32) (local $6 i64) (local $7 i64) (local $8 i64) (local $9 i64) (local $10 i64) (local $11 i64) (local $12 i32) (local $13 i32) (local $14 i32) (set_local $14 (tee_local $13 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 48) ) ) ) (i32.store offset=4 (i32.const 0) (get_local $13) ) (i64.store (get_local $1) (i64.load (i32.load (tee_local $12 (i32.load offset=4 (get_local $0) ) ) ) ) ) (i64.store offset=8 (get_local $1) (i64.load (i32.load offset=4 (get_local $12) ) ) ) (set_local $2 (i32.load (get_local $0) ) ) (i64.store offset=16 (get_local $1) (i64.load8_u (i32.load offset=8 (get_local $12) ) ) ) (i64.store offset=24 (get_local $1) (i64.load (i32.load offset=12 (get_local $12) ) ) ) (i32.store8 offset=32 (get_local $1) (i32.load8_u offset=44 (i32.load offset=4 (get_local $12) ) ) ) (drop (call $_ZNSt3__112basic_stringIcNS_11char_traitsIcEENS_9allocatorIcEEEaSERKS5_ (tee_local $4 (i32.add (get_local $1) (i32.const 36) ) ) (i32.add (i32.load offset=4 (get_local $12) ) (i32.const 8) ) ) ) (block $label$0 (br_if $label$0 (i32.eq (tee_local $3 (i32.add (get_local $1) (i32.const 48) ) ) (tee_local $5 (i32.add (tee_local $12 (i32.load offset=4 (get_local $12) ) ) (i32.const 20) ) ) ) ) (call $_ZNSt3__16vectorIcNS_9allocatorIcEEE6assignIPcEENS_9enable_ifIXaasr21__is_forward_iteratorIT_EE5valuesr16is_constructibleIcNS_15iterator_traitsIS7_E9referenceEEE5valueEvE4typeES7_S7_ (get_local $3) (i32.load (get_local $5) ) (i32.load (i32.add (get_local $12) (i32.const 24) ) ) ) ) (set_local $12 (i32.add (tee_local $4 (select (i32.load (i32.add (get_local $1) (i32.const 40) ) ) (i32.shr_u (tee_local $12 (i32.load8_u (get_local $4) ) ) (i32.const 1) ) (i32.and (get_local $12) (i32.const 1) ) ) ) (i32.const 33) ) ) (set_local $11 (i64.extend_u/i32 (get_local $4) ) ) (loop $label$1 (set_local $12 (i32.add (get_local $12) (i32.const 1) ) ) (br_if $label$1 (i64.ne (tee_local $11 (i64.shr_u (get_local $11) (i64.const 7) ) ) (i64.const 0) ) ) ) (set_local $12 (i32.add (tee_local $4 (i32.sub (i32.load (i32.add (get_local $1) (i32.const 52) ) ) (i32.load (i32.add (get_local $1) (i32.const 48) ) ) ) ) (get_local $12) ) ) (set_local $11 (i64.extend_u/i32 (get_local $4) ) ) (loop $label$2 (set_local $12 (i32.add (get_local $12) (i32.const 1) ) ) (br_if $label$2 (i64.ne (tee_local $11 (i64.shr_u (get_local $11) (i64.const 7) ) ) (i64.const 0) ) ) ) (block $label$3 (block $label$4 (br_if $label$4 (i32.lt_u (get_local $12) (i32.const 513) ) ) (set_local $13 (call $malloc (get_local $12) ) ) (br $label$3) ) (i32.store offset=4 (i32.const 0) (tee_local $13 (i32.sub (get_local $13) (i32.and (i32.add (get_local $12) (i32.const 15) ) (i32.const -16) ) ) ) ) ) (i32.store offset=4 (get_local $14) (get_local $13) ) (i32.store (get_local $14) (get_local $13) ) (i32.store offset=8 (get_local $14) (i32.add (get_local $13) (get_local $12) ) ) (drop (call $_ZN8identitylsIN4bcio10datastreamIPcEEEERT_S6_RKNS_7certrowE (get_local $14) (get_local $1) ) ) (i32.store offset=64 (get_local $1) (call $db_store_i64 (i64.load offset=8 (get_local $2) ) (i64.const 4805230851241541632) (i64.load (i32.load offset=8 (get_local $0) ) ) (tee_local $11 (i64.load (get_local $1) ) ) (get_local $13) (get_local $12) ) ) (block $label$5 (br_if $label$5 (i32.lt_u (get_local $12) (i32.const 513) ) ) (call $free (get_local $13) ) ) (block $label$6 (br_if $label$6 (i64.lt_u (get_local $11) (i64.load offset=16 (get_local $2) ) ) ) (i64.store (i32.add (get_local $2) (i32.const 16) ) (select (i64.const -2) (i64.add (get_local $11) (i64.const 1) ) (i64.gt_u (get_local $11) (i64.const -3) ) ) ) ) (set_local $11 (i64.load (i32.add (get_local $2) (i32.const 8) ) ) ) (set_local $6 (i64.load (i32.load (i32.add (get_local $0) (i32.const 8) ) ) ) ) (set_local $7 (i64.load (get_local $1) ) ) (set_local $8 (i64.load (i32.add (get_local $1) (i32.const 16) ) ) ) (set_local $9 (i64.load (i32.add (get_local $1) (i32.const 8) ) ) ) (set_local $10 (i64.load (i32.add (get_local $1) (i32.const 24) ) ) ) (call $bcio_assert (i32.const 1) (i32.const 672) ) (i64.store (i32.add (i32.add (get_local $14) (i32.const 16) ) (i32.const 24) ) (get_local $10) ) (i64.store offset=32 (get_local $14) (i64.const 0) ) (i64.store offset=24 (get_local $14) (get_local $9) ) (i64.store offset=16 (get_local $14) (get_local $8) ) (i32.store offset=68 (get_local $1) (call $db_idx256_store (get_local $11) (i64.const 4805230851241541632) (get_local $6) (get_local $7) (i32.add (get_local $14) (i32.const 16) ) (i32.const 2) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $14) (i32.const 48) ) ) ) (func $_ZNSt3__16vectorIN4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS1_10indexed_byILy4590200209379688448EN5boost11multi_index13const_mem_funIS4_NS1_9fixed_keyILj32EEEXadL_ZNKS4_7get_keyEvEEEEEEEE8item_ptrENS_9allocatorISE_EEE24__emplace_back_slow_pathIJNS_10unique_ptrINSD_4itemENS_14default_deleteISK_EEEERyRlEEEvDpOT_ (param $0 i32) (param $1 i32) (param $2 i32) (param $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (local $7 i32) (block $label$0 (block $label$1 (br_if $label$1 (i32.ge_u (tee_local $5 (i32.add (tee_local $4 (i32.div_s (i32.sub (i32.load offset=4 (get_local $0) ) (tee_local $6 (i32.load (get_local $0) ) ) ) (i32.const 24) ) ) (i32.const 1) ) ) (i32.const 178956971) ) ) (set_local $7 (i32.const 178956970) ) (block $label$2 (block $label$3 (br_if $label$3 (i32.gt_u (tee_local $6 (i32.div_s (i32.sub (i32.load offset=8 (get_local $0) ) (get_local $6) ) (i32.const 24) ) ) (i32.const 89478484) ) ) (br_if $label$2 (i32.eqz (tee_local $7 (select (get_local $5) (tee_local $7 (i32.shl (get_local $6) (i32.const 1) ) ) (i32.lt_u (get_local $7) (get_local $5) ) ) ) ) ) ) (set_local $6 (call $_Znwj (i32.mul (get_local $7) (i32.const 24) ) ) ) (br $label$0) ) (set_local $7 (i32.const 0) ) (set_local $6 (i32.const 0) ) (br $label$0) ) (call $_ZNKSt3__120__vector_base_commonILb1EE20__throw_length_errorEv (get_local $0) ) (unreachable) ) (set_local $5 (i32.load (get_local $1) ) ) (i32.store (get_local $1) (i32.const 0) ) (i32.store (tee_local $1 (i32.add (get_local $6) (i32.mul (get_local $4) (i32.const 24) ) ) ) (get_local $5) ) (i64.store offset=8 (get_local $1) (i64.load (get_local $2) ) ) (i32.store offset=16 (get_local $1) (i32.load (get_local $3) ) ) (set_local $4 (i32.add (get_local $6) (i32.mul (get_local $7) (i32.const 24) ) ) ) (set_local $5 (i32.add (get_local $1) (i32.const 24) ) ) (block $label$4 (block $label$5 (br_if $label$5 (i32.eq (tee_local $6 (i32.load (i32.add (get_local $0) (i32.const 4) ) ) ) (tee_local $7 (i32.load (get_local $0) ) ) ) ) (loop $label$6 (set_local $3 (i32.load (tee_local $2 (i32.add (get_local $6) (i32.const -24) ) ) ) ) (i32.store (get_local $2) (i32.const 0) ) (i32.store (i32.add (get_local $1) (i32.const -24) ) (get_local $3) ) (i32.store (i32.add (get_local $1) (i32.const -8) ) (i32.load (i32.add (get_local $6) (i32.const -8) ) ) ) (i32.store (i32.add (get_local $1) (i32.const -12) ) (i32.load (i32.add (get_local $6) (i32.const -12) ) ) ) (i32.store (i32.add (get_local $1) (i32.const -16) ) (i32.load (i32.add (get_local $6) (i32.const -16) ) ) ) (set_local $1 (i32.add (get_local $1) (i32.const -24) ) ) (set_local $6 (get_local $2) ) (br_if $label$6 (i32.ne (get_local $7) (get_local $2) ) ) ) (set_local $7 (i32.load (i32.add (get_local $0) (i32.const 4) ) ) ) (set_local $2 (i32.load (get_local $0) ) ) (br $label$4) ) (set_local $2 (get_local $7) ) ) (i32.store (get_local $0) (get_local $1) ) (i32.store (i32.add (get_local $0) (i32.const 4) ) (get_local $5) ) (i32.store (i32.add (get_local $0) (i32.const 8) ) (get_local $4) ) (block $label$7 (br_if $label$7 (i32.eq (get_local $7) (get_local $2) ) ) (loop $label$8 (set_local $1 (i32.load (tee_local $7 (i32.add (get_local $7) (i32.const -24) ) ) ) ) (i32.store (get_local $7) (i32.const 0) ) (block $label$9 (br_if $label$9 (i32.eqz (get_local $1) ) ) (block $label$10 (br_if $label$10 (i32.eqz (tee_local $6 (i32.load offset=48 (get_local $1) ) ) ) ) (i32.store (i32.add (get_local $1) (i32.const 52) ) (get_local $6) ) (call $_ZdlPv (get_local $6) ) ) (block $label$11 (br_if $label$11 (i32.eqz (i32.and (i32.load8_u offset=36 (get_local $1) ) (i32.const 1) ) ) ) (call $_ZdlPv (i32.load (i32.add (get_local $1) (i32.const 44) ) ) ) ) (call $_ZdlPv (get_local $1) ) ) (br_if $label$8 (i32.ne (get_local $2) (get_local $7) ) ) ) ) (block $label$12 (br_if $label$12 (i32.eqz (get_local $2) ) ) (call $_ZdlPv (get_local $2) ) ) ) (func $_ZNSt3__16vectorIcNS_9allocatorIcEEE6assignIPcEENS_9enable_ifIXaasr21__is_forward_iteratorIT_EE5valuesr16is_constructibleIcNS_15iterator_traitsIS7_E9referenceEEE5valueEvE4typeES7_S7_ (param $0 i32) (param $1 i32) (param $2 i32) (local $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (local $7 i32) (block $label$0 (block $label$1 (block $label$2 (block $label$3 (br_if $label$3 (i32.le_u (tee_local $3 (i32.sub (get_local $2) (get_local $1) ) ) (i32.sub (tee_local $7 (i32.load offset=8 (get_local $0) ) ) (tee_local $4 (i32.load (get_local $0) ) ) ) ) ) (block $label$4 (br_if $label$4 (i32.eqz (get_local $4) ) ) (i32.store offset=4 (get_local $0) (get_local $4) ) (call $_ZdlPv (get_local $4) ) (set_local $7 (i32.const 0) ) (i32.store (i32.add (get_local $0) (i32.const 8) ) (i32.const 0) ) (i64.store align=4 (get_local $0) (i64.const 0) ) ) (br_if $label$0 (i32.le_s (get_local $3) (i32.const -1) ) ) (set_local $2 (i32.const 2147483647) ) (block $label$5 (br_if $label$5 (i32.gt_u (get_local $7) (i32.const 1073741822) ) ) (set_local $2 (select (get_local $3) (tee_local $4 (i32.shl (get_local $7) (i32.const 1) ) ) (i32.lt_u (get_local $4) (get_local $3) ) ) ) ) (i32.store (get_local $0) (tee_local $4 (call $_Znwj (get_local $2) ) ) ) (i32.store offset=4 (get_local $0) (get_local $4) ) (i32.store (i32.add (get_local $0) (i32.const 8) ) (i32.add (get_local $4) (get_local $2) ) ) (drop (call $memcpy (get_local $4) (get_local $1) (get_local $3) ) ) (set_local $1 (i32.add (get_local $0) (i32.const 4) ) ) (set_local $0 (i32.add (i32.load offset=4 (get_local $0) ) (get_local $3) ) ) (br $label$2) ) (block $label$6 (br_if $label$6 (i32.eqz (tee_local $6 (i32.sub (tee_local $5 (select (i32.add (get_local $1) (tee_local $7 (i32.sub (i32.load offset=4 (get_local $0) ) (get_local $4) ) ) ) (get_local $2) (i32.gt_u (get_local $3) (get_local $7) ) ) ) (get_local $1) ) ) ) ) (drop (call $memmove (get_local $4) (get_local $1) (get_local $6) ) ) ) (set_local $1 (i32.add (get_local $0) (i32.const 4) ) ) (block $label$7 (br_if $label$7 (i32.le_u (get_local $3) (get_local $7) ) ) (br_if $label$1 (i32.lt_s (tee_local $0 (i32.sub (get_local $2) (get_local $5) ) ) (i32.const 1) ) ) (drop (call $memcpy (i32.load (get_local $1) ) (get_local $5) (get_local $0) ) ) (set_local $0 (i32.add (i32.load (get_local $1) ) (get_local $0) ) ) (br $label$2) ) (set_local $0 (i32.add (get_local $4) (get_local $6) ) ) ) (i32.store (get_local $1) (get_local $0) ) ) (return) ) (call $_ZNKSt3__120__vector_base_commonILb1EE20__throw_length_errorEv (get_local $0) ) (unreachable) ) (func $_ZN8identitylsIN4bcio10datastreamIPcEEEERT_S6_RKNS_7certrowE (param $0 i32) (param $1 i32) (result i32) (local $2 i32) (call $bcio_assert (i32.gt_s (i32.sub (i32.load offset=8 (get_local $0) ) (i32.load offset=4 (get_local $0) ) ) (i32.const 7) ) (i32.const 512) ) (drop (call $memcpy (i32.load offset=4 (get_local $0) ) (i32.add (get_local $1) (i32.const 8) ) (i32.const 8) ) ) (i32.store offset=4 (get_local $0) (tee_local $2 (i32.add (i32.load offset=4 (get_local $0) ) (i32.const 8) ) ) ) (call $bcio_assert (i32.gt_s (i32.sub (i32.load offset=8 (get_local $0) ) (get_local $2) ) (i32.const 7) ) (i32.const 512) ) (drop (call $memcpy (i32.load offset=4 (get_local $0) ) (i32.add (get_local $1) (i32.const 16) ) (i32.const 8) ) ) (i32.store offset=4 (get_local $0) (tee_local $2 (i32.add (i32.load offset=4 (get_local $0) ) (i32.const 8) ) ) ) (call $bcio_assert (i32.gt_s (i32.sub (i32.load offset=8 (get_local $0) ) (get_local $2) ) (i32.const 7) ) (i32.const 512) ) (drop (call $memcpy (i32.load offset=4 (get_local $0) ) (i32.add (get_local $1) (i32.const 24) ) (i32.const 8) ) ) (i32.store offset=4 (get_local $0) (tee_local $2 (i32.add (i32.load offset=4 (get_local $0) ) (i32.const 8) ) ) ) (call $bcio_assert (i32.gt_s (i32.sub (i32.load offset=8 (get_local $0) ) (get_local $2) ) (i32.const 0) ) (i32.const 512) ) (drop (call $memcpy (i32.load offset=4 (get_local $0) ) (i32.add (get_local $1) (i32.const 32) ) (i32.const 1) ) ) (i32.store offset=4 (get_local $0) (i32.add (i32.load offset=4 (get_local $0) ) (i32.const 1) ) ) (call $bcio_assert (i32.gt_s (i32.sub (i32.load offset=8 (tee_local $0 (call $_ZN4bciolsINS_10datastreamIPcEEEERT_S5_RKNSt3__16vectorIcNS6_9allocatorIcEEEE (call $_ZN4bciolsINS_10datastreamIPcEEEERT_S5_RKNSt3__112basic_stringIcNS6_11char_traitsIcEENS6_9allocatorIcEEEE (get_local $0) (i32.add (get_local $1) (i32.const 36) ) ) (i32.add (get_local $1) (i32.const 48) ) ) ) ) (i32.load offset=4 (get_local $0) ) ) (i32.const 7) ) (i32.const 512) ) (drop (call $memcpy (i32.load offset=4 (get_local $0) ) (get_local $1) (i32.const 8) ) ) (i32.store offset=4 (get_local $0) (i32.add (i32.load offset=4 (get_local $0) ) (i32.const 8) ) ) (get_local $0) ) (func $_ZN4bciolsINS_10datastreamIPcEEEERT_S5_RKNSt3__112basic_stringIcNS6_11char_traitsIcEENS6_9allocatorIcEEEE (param $0 i32) (param $1 i32) (result i32) (local $2 i32) (local $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (local $7 i64) (local $8 i32) (i32.store offset=4 (i32.const 0) (tee_local $8 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 16) ) ) ) (set_local $7 (i64.extend_u/i32 (select (i32.load offset=4 (get_local $1) ) (i32.shr_u (tee_local $5 (i32.load8_u (get_local $1) ) ) (i32.const 1) ) (i32.and (get_local $5) (i32.const 1) ) ) ) ) (set_local $6 (i32.load offset=4 (get_local $0) ) ) (set_local $4 (i32.add (get_local $0) (i32.const 8) ) ) (set_local $5 (i32.add (get_local $0) (i32.const 4) ) ) (loop $label$0 (set_local $2 (i32.wrap/i64 (get_local $7) ) ) (i32.store8 offset=15 (get_local $8) (i32.or (i32.shl (tee_local $3 (i64.ne (tee_local $7 (i64.shr_u (get_local $7) (i64.const 7) ) ) (i64.const 0) ) ) (i32.const 7) ) (i32.and (get_local $2) (i32.const 127) ) ) ) (call $bcio_assert (i32.gt_s (i32.sub (i32.load (get_local $4) ) (get_local $6) ) (i32.const 0) ) (i32.const 512) ) (drop (call $memcpy (i32.load (get_local $5) ) (i32.add (get_local $8) (i32.const 15) ) (i32.const 1) ) ) (i32.store (get_local $5) (tee_local $6 (i32.add (i32.load (get_local $5) ) (i32.const 1) ) ) ) (br_if $label$0 (get_local $3) ) ) (block $label$1 (br_if $label$1 (i32.eqz (tee_local $5 (select (i32.load (i32.add (get_local $1) (i32.const 4) ) ) (i32.shr_u (tee_local $5 (i32.load8_u (get_local $1) ) ) (i32.const 1) ) (tee_local $2 (i32.and (get_local $5) (i32.const 1) ) ) ) ) ) ) (set_local $3 (i32.load offset=8 (get_local $1) ) ) (call $bcio_assert (i32.ge_s (i32.sub (i32.load (i32.add (get_local $0) (i32.const 8) ) ) (get_local $6) ) (get_local $5) ) (i32.const 512) ) (drop (call $memcpy (i32.load (tee_local $6 (i32.add (get_local $0) (i32.const 4) ) ) ) (select (get_local $3) (i32.add (get_local $1) (i32.const 1) ) (get_local $2) ) (get_local $5) ) ) (i32.store (get_local $6) (i32.add (i32.load (get_local $6) ) (get_local $5) ) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $8) (i32.const 16) ) ) (get_local $0) ) (func $_ZN4bciolsINS_10datastreamIPcEEEERT_S5_RKNSt3__16vectorIcNS6_9allocatorIcEEEE (param $0 i32) (param $1 i32) (result i32) (local $2 i32) (local $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (local $7 i64) (local $8 i32) (i32.store offset=4 (i32.const 0) (tee_local $8 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 16) ) ) ) (set_local $7 (i64.extend_u/i32 (i32.sub (i32.load offset=4 (get_local $1) ) (i32.load (get_local $1) ) ) ) ) (set_local $6 (i32.load offset=4 (get_local $0) ) ) (set_local $4 (i32.add (get_local $0) (i32.const 8) ) ) (set_local $5 (i32.add (get_local $0) (i32.const 4) ) ) (loop $label$0 (set_local $2 (i32.wrap/i64 (get_local $7) ) ) (i32.store8 offset=15 (get_local $8) (i32.or (i32.shl (tee_local $3 (i64.ne (tee_local $7 (i64.shr_u (get_local $7) (i64.const 7) ) ) (i64.const 0) ) ) (i32.const 7) ) (i32.and (get_local $2) (i32.const 127) ) ) ) (call $bcio_assert (i32.gt_s (i32.sub (i32.load (get_local $4) ) (get_local $6) ) (i32.const 0) ) (i32.const 512) ) (drop (call $memcpy (i32.load (get_local $5) ) (i32.add (get_local $8) (i32.const 15) ) (i32.const 1) ) ) (i32.store (get_local $5) (tee_local $6 (i32.add (i32.load (get_local $5) ) (i32.const 1) ) ) ) (br_if $label$0 (get_local $3) ) ) (call $bcio_assert (i32.ge_s (i32.sub (i32.load (i32.add (get_local $0) (i32.const 8) ) ) (get_local $6) ) (tee_local $5 (i32.sub (i32.load (i32.add (get_local $1) (i32.const 4) ) ) (tee_local $2 (i32.load (get_local $1) ) ) ) ) ) (i32.const 512) ) (drop (call $memcpy (i32.load (tee_local $6 (i32.add (get_local $0) (i32.const 4) ) ) ) (get_local $2) (get_local $5) ) ) (i32.store (get_local $6) (i32.add (i32.load (get_local $6) ) (get_local $5) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $8) (i32.const 16) ) ) (get_local $0) ) (func $_ZN8identityrsIN4bcio10datastreamIPKcEEEERT_S7_RNS_7certrowE (param $0 i32) (param $1 i32) (result i32) (local $2 i32) (call $bcio_assert (i32.gt_u (i32.sub (i32.load offset=8 (get_local $0) ) (i32.load offset=4 (get_local $0) ) ) (i32.const 7) ) (i32.const 112) ) (drop (call $memcpy (i32.add (get_local $1) (i32.const 8) ) (i32.load offset=4 (get_local $0) ) (i32.const 8) ) ) (i32.store offset=4 (get_local $0) (tee_local $2 (i32.add (i32.load offset=4 (get_local $0) ) (i32.const 8) ) ) ) (call $bcio_assert (i32.gt_u (i32.sub (i32.load offset=8 (get_local $0) ) (get_local $2) ) (i32.const 7) ) (i32.const 112) ) (drop (call $memcpy (i32.add (get_local $1) (i32.const 16) ) (i32.load offset=4 (get_local $0) ) (i32.const 8) ) ) (i32.store offset=4 (get_local $0) (tee_local $2 (i32.add (i32.load offset=4 (get_local $0) ) (i32.const 8) ) ) ) (call $bcio_assert (i32.gt_u (i32.sub (i32.load offset=8 (get_local $0) ) (get_local $2) ) (i32.const 7) ) (i32.const 112) ) (drop (call $memcpy (i32.add (get_local $1) (i32.const 24) ) (i32.load offset=4 (get_local $0) ) (i32.const 8) ) ) (i32.store offset=4 (get_local $0) (tee_local $2 (i32.add (i32.load offset=4 (get_local $0) ) (i32.const 8) ) ) ) (call $bcio_assert (i32.ne (i32.load offset=8 (get_local $0) ) (get_local $2) ) (i32.const 112) ) (drop (call $memcpy (i32.add (get_local $1) (i32.const 32) ) (i32.load offset=4 (get_local $0) ) (i32.const 1) ) ) (i32.store offset=4 (get_local $0) (i32.add (i32.load offset=4 (get_local $0) ) (i32.const 1) ) ) (call $bcio_assert (i32.gt_u (i32.sub (i32.load offset=8 (tee_local $0 (call $_ZN4bciorsINS_10datastreamIPKcEEEERT_S6_RNSt3__16vectorIcNS7_9allocatorIcEEEE (call $_ZN4bciorsINS_10datastreamIPKcEEEERT_S6_RNSt3__112basic_stringIcNS7_11char_traitsIcEENS7_9allocatorIcEEEE (get_local $0) (i32.add (get_local $1) (i32.const 36) ) ) (i32.add (get_local $1) (i32.const 48) ) ) ) ) (i32.load offset=4 (get_local $0) ) ) (i32.const 7) ) (i32.const 112) ) (drop (call $memcpy (get_local $1) (i32.load offset=4 (get_local $0) ) (i32.const 8) ) ) (i32.store offset=4 (get_local $0) (i32.add (i32.load offset=4 (get_local $0) ) (i32.const 8) ) ) (get_local $0) ) (func $_ZNK5boost4hana6detail7on_eachIPZN4bcio11multi_indexILy4805230851241541632EN8identity7certrowEJNS3_10indexed_byILy4590200209379688448ENS_11multi_index13const_mem_funIS6_NS3_9fixed_keyILj32EEEXadL_ZNKS6_7get_keyEvEEEEEEEE6modifyIZNS5_8contract8certpropEyyyRKNSt3__16vectorINS5_9certvalueENSH_9allocatorISJ_EEEEEUlRS6_E_EEvRKS6_yOT_EUlRST_E_EclIJRNS0_5tupleIJNS0_9type_implINSE_5indexILy4590200209379688448ESC_Ly0ELb0EEEE1_ENS11_INS12_ILy4590200209379688448ESC_Ly0ELb1EEEE1_EEEEEEEvDpOT_ (param $0 i32) (param $1 i32) (local $2 i32) (local $3 i32) (local $4 i64) (local $5 i64) (local $6 i64) (local $7 i32) (i32.store offset=4 (i32.const 0) (tee_local $7 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 64) ) ) ) (set_local $2 (i32.load (tee_local $0 (i32.load (get_local $0) ) ) ) ) (set_local $4 (i64.load offset=16 (tee_local $3 (i32.load offset=4 (get_local $0) ) ) ) ) (set_local $5 (i64.load offset=8 (get_local $3) ) ) (set_local $6 (i64.load offset=24 (get_local $3) ) ) (call $bcio_assert (i32.const 1) (i32.const 672) ) (i64.store (i32.add (get_local $7) (i32.const 56) ) (get_local $6) ) (i64.store offset=48 (get_local $7) (i64.const 0) ) (i64.store offset=40 (get_local $7) (get_local $5) ) (i64.store offset=32 (get_local $7) (get_local $4) ) (block $label$0 (br_if $label$0 (i32.eqz (call $memcmp (i32.load offset=8 (get_local $0) ) (i32.add (get_local $7) (i32.const 32) ) (i32.const 32) ) ) ) (block $label$1 (br_if $label$1 (i32.gt_s (tee_local $3 (i32.load offset=68 (i32.load offset=12 (get_local $0) ) ) ) (i32.const -1) ) ) (i64.store (i32.add (get_local $7) (i32.const 24) ) (i64.const 0) ) (i64.store (i32.add (get_local $7) (i32.const 16) ) (i64.const 0) ) (i64.store offset=8 (get_local $7) (i64.const 0) ) (i64.store (get_local $7) (i64.const 0) ) (set_local $3 (call $db_idx256_find_primary (i64.load (get_local $2) ) (i64.load offset=8 (get_local $2) ) (i64.const 4805230851241541632) (get_local $7) (i32.const 2) (i64.load (i32.load offset=16 (get_local $0) ) ) ) ) (i32.store offset=68 (i32.load (i32.add (get_local $0) (i32.const 12) ) ) (get_local $3) ) ) (call $db_idx256_update (get_local $3) (i64.load (i32.load offset=20 (get_local $0) ) ) (i32.add (get_local $7) (i32.const 32) ) (i32.const 2) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $7) (i32.const 64) ) ) ) (func $_ZNSt3__16vectorIN4bcio11multi_indexILy8238557613797670912EN8identity8identrowEJEE8item_ptrENS_9allocatorIS6_EEE24__emplace_back_slow_pathIJNS_10unique_ptrINS5_4itemENS_14default_deleteISC_EEEERyRlEEEvDpOT_ (param $0 i32) (param $1 i32) (param $2 i32) (param $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (local $7 i32) (block $label$0 (block $label$1 (br_if $label$1 (i32.ge_u (tee_local $5 (i32.add (tee_local $4 (i32.div_s (i32.sub (i32.load offset=4 (get_local $0) ) (tee_local $6 (i32.load (get_local $0) ) ) ) (i32.const 24) ) ) (i32.const 1) ) ) (i32.const 178956971) ) ) (set_local $7 (i32.const 178956970) ) (block $label$2 (block $label$3 (br_if $label$3 (i32.gt_u (tee_local $6 (i32.div_s (i32.sub (i32.load offset=8 (get_local $0) ) (get_local $6) ) (i32.const 24) ) ) (i32.const 89478484) ) ) (br_if $label$2 (i32.eqz (tee_local $7 (select (get_local $5) (tee_local $7 (i32.shl (get_local $6) (i32.const 1) ) ) (i32.lt_u (get_local $7) (get_local $5) ) ) ) ) ) ) (set_local $6 (call $_Znwj (i32.mul (get_local $7) (i32.const 24) ) ) ) (br $label$0) ) (set_local $7 (i32.const 0) ) (set_local $6 (i32.const 0) ) (br $label$0) ) (call $_ZNKSt3__120__vector_base_commonILb1EE20__throw_length_errorEv (get_local $0) ) (unreachable) ) (set_local $5 (i32.load (get_local $1) ) ) (i32.store (get_local $1) (i32.const 0) ) (i32.store (tee_local $1 (i32.add (get_local $6) (i32.mul (get_local $4) (i32.const 24) ) ) ) (get_local $5) ) (i64.store offset=8 (get_local $1) (i64.load (get_local $2) ) ) (i32.store offset=16 (get_local $1) (i32.load (get_local $3) ) ) (set_local $4 (i32.add (get_local $6) (i32.mul (get_local $7) (i32.const 24) ) ) ) (set_local $5 (i32.add (get_local $1) (i32.const 24) ) ) (block $label$4 (block $label$5 (br_if $label$5 (i32.eq (tee_local $6 (i32.load (i32.add (get_local $0) (i32.const 4) ) ) ) (tee_local $7 (i32.load (get_local $0) ) ) ) ) (loop $label$6 (set_local $3 (i32.load (tee_local $2 (i32.add (get_local $6) (i32.const -24) ) ) ) ) (i32.store (get_local $2) (i32.const 0) ) (i32.store (i32.add (get_local $1) (i32.const -24) ) (get_local $3) ) (i32.store (i32.add (get_local $1) (i32.const -8) ) (i32.load (i32.add (get_local $6) (i32.const -8) ) ) ) (i32.store (i32.add (get_local $1) (i32.const -12) ) (i32.load (i32.add (get_local $6) (i32.const -12) ) ) ) (i32.store (i32.add (get_local $1) (i32.const -16) ) (i32.load (i32.add (get_local $6) (i32.const -16) ) ) ) (set_local $1 (i32.add (get_local $1) (i32.const -24) ) ) (set_local $6 (get_local $2) ) (br_if $label$6 (i32.ne (get_local $7) (get_local $2) ) ) ) (set_local $7 (i32.load (i32.add (get_local $0) (i32.const 4) ) ) ) (set_local $6 (i32.load (get_local $0) ) ) (br $label$4) ) (set_local $6 (get_local $7) ) ) (i32.store (get_local $0) (get_local $1) ) (i32.store (i32.add (get_local $0) (i32.const 4) ) (get_local $5) ) (i32.store (i32.add (get_local $0) (i32.const 8) ) (get_local $4) ) (block $label$7 (br_if $label$7 (i32.eq (get_local $7) (get_local $6) ) ) (loop $label$8 (set_local $1 (i32.load (tee_local $7 (i32.add (get_local $7) (i32.const -24) ) ) ) ) (i32.store (get_local $7) (i32.const 0) ) (block $label$9 (br_if $label$9 (i32.eqz (get_local $1) ) ) (call $_ZdlPv (get_local $1) ) ) (br_if $label$8 (i32.ne (get_local $6) (get_local $7) ) ) ) ) (block $label$10 (br_if $label$10 (i32.eqz (get_local $6) ) ) (call $_ZdlPv (get_local $6) ) ) ) (func $_ZN4bcio11multi_indexILy8238557613797670912EN8identity8identrowEJEE7emplaceIZNS1_8contract6createEyyEUlRS2_E_EENS3_14const_iteratorEyOT_ (param $0 i32) (param $1 i32) (param $2 i64) (param $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (local $7 i32) (i32.store offset=4 (i32.const 0) (tee_local $7 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 48) ) ) ) (i64.store offset=40 (get_local $7) (get_local $2) ) (call $bcio_assert (i64.eq (i64.load (get_local $1) ) (call $current_receiver) ) (i32.const 448) ) (i32.store offset=20 (get_local $7) (get_local $3) ) (i32.store offset=16 (get_local $7) (get_local $1) ) (i32.store offset=24 (get_local $7) (i32.add (get_local $7) (i32.const 40) ) ) (drop (call $_ZN4bcio11multi_indexILy8238557613797670912EN8identity8identrowEJEE4itemC2IZNS3_7emplaceIZNS1_8contract6createEyyEUlRS2_E_EENS3_14const_iteratorEyOT_EUlRSB_E_EEPKS3_SC_ (tee_local $3 (call $_Znwj (i32.const 32) ) ) (get_local $1) (i32.add (get_local $7) (i32.const 16) ) ) ) (i32.store offset=32 (get_local $7) (get_local $3) ) (i64.store offset=16 (get_local $7) (tee_local $2 (i64.load (get_local $3) ) ) ) (i32.store offset=12 (get_local $7) (tee_local $4 (i32.load offset=20 (get_local $3) ) ) ) (block $label$0 (block $label$1 (br_if $label$1 (i32.ge_u (tee_local $5 (i32.load (tee_local $6 (i32.add (get_local $1) (i32.const 28) ) ) ) ) (i32.load (i32.add (get_local $1) (i32.const 32) ) ) ) ) (i64.store offset=8 (get_local $5) (get_local $2) ) (i32.store offset=16 (get_local $5) (get_local $4) ) (i32.store offset=32 (get_local $7) (i32.const 0) ) (i32.store (get_local $5) (get_local $3) ) (i32.store (get_local $6) (i32.add (get_local $5) (i32.const 24) ) ) (br $label$0) ) (call $_ZNSt3__16vectorIN4bcio11multi_indexILy8238557613797670912EN8identity8identrowEJEE8item_ptrENS_9allocatorIS6_EEE24__emplace_back_slow_pathIJNS_10unique_ptrINS5_4itemENS_14default_deleteISC_EEEERyRlEEEvDpOT_ (i32.add (get_local $1) (i32.const 24) ) (i32.add (get_local $7) (i32.const 32) ) (i32.add (get_local $7) (i32.const 16) ) (i32.add (get_local $7) (i32.const 12) ) ) ) (i32.store offset=4 (get_local $0) (get_local $3) ) (i32.store (get_local $0) (get_local $1) ) (set_local $1 (i32.load offset=32 (get_local $7) ) ) (i32.store offset=32 (get_local $7) (i32.const 0) ) (block $label$2 (br_if $label$2 (i32.eqz (get_local $1) ) ) (call $_ZdlPv (get_local $1) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $7) (i32.const 48) ) ) ) (func $_ZN4bcio11multi_indexILy8238557613797670912EN8identity8identrowEJEE4itemC2IZNS3_7emplaceIZNS1_8contract6createEyyEUlRS2_E_EENS3_14const_iteratorEyOT_EUlRSB_E_EEPKS3_SC_ (param $0 i32) (param $1 i32) (param $2 i32) (result i32) (local $3 i64) (local $4 i32) (i32.store offset=4 (i32.const 0) (tee_local $4 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 16) ) ) ) (i32.store offset=16 (get_local $0) (get_local $1) ) (i64.store (get_local $0) (i64.load (i32.load (tee_local $1 (i32.load offset=4 (get_local $2) ) ) ) ) ) (i64.store offset=8 (get_local $0) (i64.load (i32.load offset=4 (get_local $1) ) ) ) (set_local $1 (i32.load (get_local $2) ) ) (call $bcio_assert (i32.const 1) (i32.const 512) ) (drop (call $memcpy (get_local $4) (get_local $0) (i32.const 8) ) ) (call $bcio_assert (i32.const 1) (i32.const 512) ) (drop (call $memcpy (i32.or (get_local $4) (i32.const 8) ) (i32.add (get_local $0) (i32.const 8) ) (i32.const 8) ) ) (i32.store offset=20 (get_local $0) (call $db_store_i64 (i64.load offset=8 (get_local $1) ) (i64.const 8238557613797670912) (i64.load (i32.load offset=8 (get_local $2) ) ) (tee_local $3 (i64.load (get_local $0) ) ) (get_local $4) (i32.const 16) ) ) (block $label$0 (br_if $label$0 (i64.lt_u (get_local $3) (i64.load offset=16 (get_local $1) ) ) ) (i64.store (i32.add (get_local $1) (i32.const 16) ) (select (i64.const -2) (i64.add (get_local $3) (i64.const 1) ) (i64.gt_u (get_local $3) (i64.const -3) ) ) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $4) (i32.const 16) ) ) (get_local $0) ) (func $_ZN8identity13identity_base10is_trustedEy (param $0 i32) (param $1 i64) (result i32) (local $2 i32) (local $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (i32.store offset=4 (i32.const 0) (tee_local $6 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 176) ) ) ) (block $label$0 (block $label$1 (br_if $label$1 (i32.eqz (tee_local $2 (i32.shr_u (call $get_active_producers (get_local $6) (i32.const 168) ) (i32.const 3) ) ) ) ) (set_local $4 (i32.const 0) ) (set_local $3 (get_local $6) ) (loop $label$2 (set_local $5 (i32.const 1) ) (br_if $label$0 (i64.eq (i64.load (get_local $3) ) (get_local $1) ) ) (set_local $3 (i32.add (get_local $3) (i32.const 8) ) ) (br_if $label$2 (i32.lt_u (tee_local $4 (i32.add (get_local $4) (i32.const 1) ) ) (get_local $2) ) ) ) (set_local $4 (i32.const 0) ) (set_local $3 (get_local $6) ) (loop $label$3 (set_local $5 (i32.const 1) ) (br_if $label$0 (call $_ZN8identity13identity_base13is_trusted_byEyy (get_local $0) (get_local $1) (i64.load (get_local $3) ) ) ) (set_local $3 (i32.add (get_local $3) (i32.const 8) ) ) (br_if $label$3 (i32.lt_u (tee_local $4 (i32.add (get_local $4) (i32.const 1) ) ) (get_local $2) ) ) ) ) (set_local $5 (i32.const 0) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $6) (i32.const 176) ) ) (get_local $5) ) (func $_ZN8identity13identity_base13is_trusted_byEyy (param $0 i32) (param $1 i64) (param $2 i64) (result i32) (local $3 i32) (local $4 i32) (local $5 i64) (local $6 i32) (local $7 i32) (local $8 i32) (i32.store offset=4 (i32.const 0) (tee_local $8 (i32.sub (i32.load offset=4 (i32.const 0) ) (i32.const 48) ) ) ) (set_local $7 (i32.const 0) ) (i32.store (i32.add (get_local $8) (i32.const 40) ) (i32.const 0) ) (i64.store offset=24 (get_local $8) (i64.const -1) ) (i64.store offset=32 (get_local $8) (i64.const 0) ) (i64.store offset=8 (get_local $8) (tee_local $5 (i64.load (get_local $0) ) ) ) (i64.store offset=16 (get_local $8) (get_local $2) ) (block $label$0 (br_if $label$0 (i32.lt_s (tee_local $0 (call $db_find_i64 (get_local $5) (get_local $2) (i64.const -3605821445256511488) (get_local $1) ) ) (i32.const 0) ) ) (call $bcio_assert (i32.eq (i32.load offset=8 (call $_ZNK4bcio11multi_indexILy14840922628453040128EN8identity8trustrowEJEE31load_object_by_primary_iteratorEl (i32.add (get_local $8) (i32.const 8) ) (get_local $0) ) ) (i32.add (get_local $8) (i32.const 8) ) ) (i32.const 1248) ) (set_local $7 (i32.const 1) ) (br_if $label$0 (i32.eqz (tee_local $3 (i32.load offset=32 (get_local $8) ) ) ) ) (block $label$1 (block $label$2 (br_if $label$2 (i32.eq (tee_local $0 (i32.load (tee_local $6 (i32.add (get_local $8) (i32.const 36) ) ) ) ) (get_local $3) ) ) (loop $label$3 (set_local $4 (i32.load (tee_local $0 (i32.add (get_local $0) (i32.const -24) ) ) ) ) (i32.store (get_local $0) (i32.const 0) ) (block $label$4 (br_if $label$4 (i32.eqz (get_local $4) ) ) (call $_ZdlPv (get_local $4) ) ) (br_if $label$3 (i32.ne (get_local $3) (get_local $0) ) ) ) (set_local $0 (i32.load (i32.add (get_local $8) (i32.const 32) ) ) ) (br $label$1) ) (set_local $0 (get_local $3) ) ) (i32.store (get_local $6) (get_local $3) ) (call $_ZdlPv (get_local $0) ) ) (i32.store offset=4 (i32.const 0) (i32.add (get_local $8) (i32.const 48) ) ) (get_local $7) ) (func $_Znwj (param $0 i32) (result i32) (local $1 i32) (local $2 i32) (block $label$0 (br_if $label$0 (tee_local $0 (call $malloc (tee_local $1 (select (get_local $0) (i32.const 1) (get_local $0) ) ) ) ) ) (loop $label$1 (set_local $0 (i32.const 0) ) (br_if $label$0 (i32.eqz (tee_local $2 (i32.load offset=1300 (i32.const 0) ) ) ) ) (call_indirect (type $FUNCSIG$v) (get_local $2) ) (br_if $label$1 (i32.eqz (tee_local $0 (call $malloc (get_local $1) ) ) ) ) ) ) (get_local $0) ) (func $_ZdlPv (param $0 i32) (block $label$0 (br_if $label$0 (i32.eqz (get_local $0) ) ) (call $free (get_local $0) ) ) ) (func $_ZNKSt3__121__basic_string_commonILb1EE20__throw_length_errorEv (param $0 i32) (call $abort) (unreachable) ) (func $_ZNSt3__112basic_stringIcNS_11char_traitsIcEENS_9allocatorIcEEEaSERKS5_ (param $0 i32) (param $1 i32) (result i32) (local $2 i32) (local $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (block $label$0 (block $label$1 (block $label$2 (block $label$3 (br_if $label$3 (i32.eq (get_local $0) (get_local $1) ) ) (set_local $2 (select (i32.load offset=4 (get_local $1) ) (i32.shr_u (tee_local $2 (i32.load8_u (get_local $1) ) ) (i32.const 1) ) (tee_local $4 (i32.and (get_local $2) (i32.const 1) ) ) ) ) (set_local $5 (i32.add (get_local $1) (i32.const 1) ) ) (set_local $6 (i32.load offset=8 (get_local $1) ) ) (set_local $1 (i32.const 10) ) (block $label$4 (br_if $label$4 (i32.eqz (i32.and (tee_local $3 (i32.load8_u (get_local $0) ) ) (i32.const 1) ) ) ) (set_local $1 (i32.add (i32.and (tee_local $3 (i32.load (get_local $0) ) ) (i32.const -2) ) (i32.const -1) ) ) ) (set_local $5 (select (get_local $6) (get_local $5) (get_local $4) ) ) (set_local $4 (i32.and (get_local $3) (i32.const 1) ) ) (block $label$5 (block $label$6 (block $label$7 (br_if $label$7 (i32.le_u (get_local $2) (get_local $1) ) ) (br_if $label$6 (get_local $4) ) (set_local $3 (i32.shr_u (i32.and (get_local $3) (i32.const 254) ) (i32.const 1) ) ) (br $label$5) ) (br_if $label$2 (get_local $4) ) (set_local $1 (i32.add (get_local $0) (i32.const 1) ) ) (br_if $label$1 (get_local $2) ) (br $label$0) ) (set_local $3 (i32.load offset=4 (get_local $0) ) ) ) (call $_ZNSt3__112basic_stringIcNS_11char_traitsIcEENS_9allocatorIcEEE21__grow_by_and_replaceEjjjjjjPKc (get_local $0) (get_local $1) (i32.sub (get_local $2) (get_local $1) ) (get_local $3) (i32.const 0) (get_local $3) (get_local $2) (get_local $5) ) ) (return (get_local $0) ) ) (set_local $1 (i32.load offset=8 (get_local $0) ) ) (br_if $label$0 (i32.eqz (get_local $2) ) ) ) (drop (call $memmove (get_local $1) (get_local $5) (get_local $2) ) ) ) (i32.store8 (i32.add (get_local $1) (get_local $2) ) (i32.const 0) ) (block $label$8 (br_if $label$8 (i32.and (i32.load8_u (get_local $0) ) (i32.const 1) ) ) (i32.store8 (get_local $0) (i32.shl (get_local $2) (i32.const 1) ) ) (return (get_local $0) ) ) (i32.store offset=4 (get_local $0) (get_local $2) ) (get_local $0) ) (func $_ZNSt3__112basic_stringIcNS_11char_traitsIcEENS_9allocatorIcEEE21__grow_by_and_replaceEjjjjjjPKc (param $0 i32) (param $1 i32) (param $2 i32) (param $3 i32) (param $4 i32) (param $5 i32) (param $6 i32) (param $7 i32) (local $8 i32) (local $9 i32) (local $10 i32) (block $label$0 (br_if $label$0 (i32.lt_u (i32.sub (i32.const -18) (get_local $1) ) (get_local $2) ) ) (block $label$1 (block $label$2 (br_if $label$2 (i32.and (i32.load8_u (get_local $0) ) (i32.const 1) ) ) (set_local $9 (i32.add (get_local $0) (i32.const 1) ) ) (br $label$1) ) (set_local $9 (i32.load offset=8 (get_local $0) ) ) ) (set_local $10 (i32.const -17) ) (block $label$3 (br_if $label$3 (i32.gt_u (get_local $1) (i32.const 2147483622) ) ) (set_local $10 (i32.const 11) ) (br_if $label$3 (i32.lt_u (tee_local $2 (select (tee_local $8 (i32.shl (get_local $1) (i32.const 1) ) ) (tee_local $2 (i32.add (get_local $2) (get_local $1) ) ) (i32.lt_u (get_local $2) (get_local $8) ) ) ) (i32.const 11) ) ) (set_local $10 (i32.and (i32.add (get_local $2) (i32.const 16) ) (i32.const -16) ) ) ) (set_local $2 (call $_Znwj (get_local $10) ) ) (block $label$4 (br_if $label$4 (i32.eqz (get_local $4) ) ) (drop (call $memcpy (get_local $2) (get_local $9) (get_local $4) ) ) ) (block $label$5 (br_if $label$5 (i32.eqz (get_local $6) ) ) (drop (call $memcpy (i32.add (get_local $2) (get_local $4) ) (get_local $7) (get_local $6) ) ) ) (block $label$6 (br_if $label$6 (i32.eqz (tee_local $7 (i32.sub (tee_local $3 (i32.sub (get_local $3) (get_local $5) ) ) (get_local $4) ) ) ) ) (drop (call $memcpy (i32.add (i32.add (get_local $2) (get_local $4) ) (get_local $6) ) (i32.add (i32.add (get_local $9) (get_local $4) ) (get_local $5) ) (get_local $7) ) ) ) (block $label$7 (br_if $label$7 (i32.eq (get_local $1) (i32.const 10) ) ) (call $_ZdlPv (get_local $9) ) ) (i32.store offset=8 (get_local $0) (get_local $2) ) (i32.store (get_local $0) (i32.or (get_local $10) (i32.const 1) ) ) (i32.store offset=4 (get_local $0) (tee_local $4 (i32.add (get_local $3) (get_local $6) ) ) ) (i32.store8 (i32.add (get_local $2) (get_local $4) ) (i32.const 0) ) (return) ) (call $abort) (unreachable) ) (func $_ZNSt3__112basic_stringIcNS_11char_traitsIcEENS_9allocatorIcEEE7reserveEj (param $0 i32) (param $1 i32) (local $2 i32) (local $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (local $7 i32) (block $label$0 (br_if $label$0 (i32.ge_u (get_local $1) (i32.const -16) ) ) (set_local $2 (i32.const 10) ) (block $label$1 (br_if $label$1 (i32.eqz (i32.and (tee_local $5 (i32.load8_u (get_local $0) ) ) (i32.const 1) ) ) ) (set_local $2 (i32.add (i32.and (tee_local $5 (i32.load (get_local $0) ) ) (i32.const -2) ) (i32.const -1) ) ) ) (block $label$2 (block $label$3 (br_if $label$3 (i32.and (get_local $5) (i32.const 1) ) ) (set_local $3 (i32.shr_u (i32.and (get_local $5) (i32.const 254) ) (i32.const 1) ) ) (br $label$2) ) (set_local $3 (i32.load offset=4 (get_local $0) ) ) ) (set_local $4 (i32.const 10) ) (block $label$4 (br_if $label$4 (i32.lt_u (tee_local $1 (select (get_local $3) (get_local $1) (i32.gt_u (get_local $3) (get_local $1) ) ) ) (i32.const 11) ) ) (set_local $4 (i32.add (i32.and (i32.add (get_local $1) (i32.const 16) ) (i32.const -16) ) (i32.const -1) ) ) ) (block $label$5 (br_if $label$5 (i32.eq (get_local $4) (get_local $2) ) ) (block $label$6 (block $label$7 (br_if $label$7 (i32.ne (get_local $4) (i32.const 10) ) ) (set_local $6 (i32.const 1) ) (set_local $1 (i32.add (get_local $0) (i32.const 1) ) ) (set_local $2 (i32.load offset=8 (get_local $0) ) ) (set_local $7 (i32.const 0) ) (br $label$6) ) (set_local $1 (call $_Znwj (i32.add (get_local $4) (i32.const 1) ) ) ) (block $label$8 (br_if $label$8 (i32.gt_u (get_local $4) (get_local $2) ) ) (br_if $label$5 (i32.eqz (get_local $1) ) ) ) (block $label$9 (br_if $label$9 (i32.and (tee_local $5 (i32.load8_u (get_local $0) ) ) (i32.const 1) ) ) (set_local $7 (i32.const 1) ) (set_local $2 (i32.add (get_local $0) (i32.const 1) ) ) (set_local $6 (i32.const 0) ) (br $label$6) ) (set_local $2 (i32.load offset=8 (get_local $0) ) ) (set_local $6 (i32.const 1) ) (set_local $7 (i32.const 1) ) ) (block $label$10 (block $label$11 (br_if $label$11 (i32.and (get_local $5) (i32.const 1) ) ) (set_local $5 (i32.shr_u (i32.and (get_local $5) (i32.const 254) ) (i32.const 1) ) ) (br $label$10) ) (set_local $5 (i32.load offset=4 (get_local $0) ) ) ) (block $label$12 (br_if $label$12 (i32.eqz (tee_local $5 (i32.add (get_local $5) (i32.const 1) ) ) ) ) (drop (call $memcpy (get_local $1) (get_local $2) (get_local $5) ) ) ) (block $label$13 (br_if $label$13 (i32.eqz (get_local $6) ) ) (call $_ZdlPv (get_local $2) ) ) (block $label$14 (br_if $label$14 (i32.eqz (get_local $7) ) ) (i32.store offset=4 (get_local $0) (get_local $3) ) (i32.store offset=8 (get_local $0) (get_local $1) ) (i32.store (get_local $0) (i32.or (i32.add (get_local $4) (i32.const 1) ) (i32.const 1) ) ) (return) ) (i32.store8 (get_local $0) (i32.shl (get_local $3) (i32.const 1) ) ) ) (return) ) (call $abort) (unreachable) ) (func $_ZNKSt3__120__vector_base_commonILb1EE20__throw_length_errorEv (param $0 i32) (call $abort) (unreachable) ) (func $_ZNSt3__112basic_stringIcNS_11char_traitsIcEENS_9allocatorIcEEEC2ERKS5_ (param $0 i32) (param $1 i32) (result i32) (local $2 i32) (local $3 i32) (local $4 i32) (i64.store align=4 (get_local $0) (i64.const 0) ) (i32.store (tee_local $3 (i32.add (get_local $0) (i32.const 8) ) ) (i32.const 0) ) (block $label$0 (br_if $label$0 (i32.and (i32.load8_u (get_local $1) ) (i32.const 1) ) ) (i64.store align=4 (get_local $0) (i64.load align=4 (get_local $1) ) ) (i32.store (get_local $3) (i32.load (i32.add (get_local $1) (i32.const 8) ) ) ) (return (get_local $0) ) ) (block $label$1 (br_if $label$1 (i32.ge_u (tee_local $3 (i32.load offset=4 (get_local $1) ) ) (i32.const -16) ) ) (set_local $2 (i32.load offset=8 (get_local $1) ) ) (block $label$2 (block $label$3 (block $label$4 (br_if $label$4 (i32.ge_u (get_local $3) (i32.const 11) ) ) (i32.store8 (get_local $0) (i32.shl (get_local $3) (i32.const 1) ) ) (set_local $1 (i32.add (get_local $0) (i32.const 1) ) ) (br_if $label$3 (get_local $3) ) (br $label$2) ) (set_local $1 (call $_Znwj (tee_local $4 (i32.and (i32.add (get_local $3) (i32.const 16) ) (i32.const -16) ) ) ) ) (i32.store (get_local $0) (i32.or (get_local $4) (i32.const 1) ) ) (i32.store offset=8 (get_local $0) (get_local $1) ) (i32.store offset=4 (get_local $0) (get_local $3) ) ) (drop (call $memcpy (get_local $1) (get_local $2) (get_local $3) ) ) ) (i32.store8 (i32.add (get_local $1) (get_local $3) ) (i32.const 0) ) (return (get_local $0) ) ) (call $abort) (unreachable) ) (func $memcmp (param $0 i32) (param $1 i32) (param $2 i32) (result i32) (local $3 i32) (local $4 i32) (local $5 i32) (set_local $5 (i32.const 0) ) (block $label$0 (br_if $label$0 (i32.eqz (get_local $2) ) ) (block $label$1 (loop $label$2 (br_if $label$1 (i32.ne (tee_local $3 (i32.load8_u (get_local $0) ) ) (tee_local $4 (i32.load8_u (get_local $1) ) ) ) ) (set_local $1 (i32.add (get_local $1) (i32.const 1) ) ) (set_local $0 (i32.add (get_local $0) (i32.const 1) ) ) (br_if $label$2 (tee_local $2 (i32.add (get_local $2) (i32.const -1) ) ) ) (br $label$0) ) ) (set_local $5 (i32.sub (get_local $3) (get_local $4) ) ) ) (get_local $5) ) (func $malloc (param $0 i32) (result i32) (call $_ZN4bcio14memory_manager6mallocEm (i32.const 1304) (get_local $0) ) ) (func $_ZN4bcio14memory_manager6mallocEm (param $0 i32) (param $1 i32) (result i32) (local $2 i32) (local $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (local $7 i32) (local $8 i32) (local $9 i32) (local $10 i32) (local $11 i32) (local $12 i32) (local $13 i32) (block $label$0 (br_if $label$0 (i32.eqz (get_local $1) ) ) (block $label$1 (br_if $label$1 (tee_local $13 (i32.load offset=8384 (get_local $0) ) ) ) (set_local $13 (i32.const 16) ) (i32.store (i32.add (get_local $0) (i32.const 8384) ) (i32.const 16) ) ) (set_local $2 (select (i32.sub (i32.add (get_local $1) (i32.const 8) ) (tee_local $2 (i32.and (i32.add (get_local $1) (i32.const 4) ) (i32.const 7) ) ) ) (get_local $1) (get_local $2) ) ) (block $label$2 (block $label$3 (block $label$4 (br_if $label$4 (i32.ge_u (tee_local $10 (i32.load offset=8388 (get_local $0) ) ) (get_local $13) ) ) (set_local $1 (i32.add (i32.add (get_local $0) (i32.mul (get_local $10) (i32.const 12) ) ) (i32.const 8192) ) ) (block $label$5 (br_if $label$5 (get_local $10) ) (br_if $label$5 (i32.load (tee_local $13 (i32.add (get_local $0) (i32.const 8196) ) ) ) ) (i32.store (get_local $1) (i32.const 8192) ) (i32.store (get_local $13) (get_local $0) ) ) (set_local $10 (i32.add (get_local $2) (i32.const 4) ) ) (loop $label$6 (block $label$7 (br_if $label$7 (i32.gt_u (i32.add (tee_local $13 (i32.load offset=8 (get_local $1) ) ) (get_local $10) ) (i32.load (get_local $1) ) ) ) (i32.store (tee_local $13 (i32.add (i32.load offset=4 (get_local $1) ) (get_local $13) ) ) (i32.or (i32.and (i32.load (get_local $13) ) (i32.const -2147483648) ) (get_local $2) ) ) (i32.store (tee_local $1 (i32.add (get_local $1) (i32.const 8) ) ) (i32.add (i32.load (get_local $1) ) (get_local $10) ) ) (i32.store (get_local $13) (i32.or (i32.load (get_local $13) ) (i32.const -2147483648) ) ) (br_if $label$3 (tee_local $1 (i32.add (get_local $13) (i32.const 4) ) ) ) ) (br_if $label$6 (tee_local $1 (call $_ZN4bcio14memory_manager16next_active_heapEv (get_local $0) ) ) ) ) ) (set_local $4 (i32.sub (i32.const 2147483644) (get_local $2) ) ) (set_local $11 (i32.add (get_local $0) (i32.const 8392) ) ) (set_local $12 (i32.add (get_local $0) (i32.const 8384) ) ) (set_local $13 (tee_local $3 (i32.load offset=8392 (get_local $0) ) ) ) (loop $label$8 (call $bcio_assert (i32.eq (i32.load (i32.add (tee_local $1 (i32.add (get_local $0) (i32.mul (get_local $13) (i32.const 12) ) ) ) (i32.const 8200) ) ) (i32.load (tee_local $5 (i32.add (get_local $1) (i32.const 8192) ) ) ) ) (i32.const 9712) ) (set_local $13 (i32.add (tee_local $6 (i32.load (i32.add (get_local $1) (i32.const 8196) ) ) ) (i32.const 4) ) ) (loop $label$9 (set_local $7 (i32.add (get_local $6) (i32.load (get_local $5) ) ) ) (set_local $1 (i32.and (tee_local $9 (i32.load (tee_local $8 (i32.add (get_local $13) (i32.const -4) ) ) ) ) (i32.const 2147483647) ) ) (block $label$10 (br_if $label$10 (i32.lt_s (get_local $9) (i32.const 0) ) ) (block $label$11 (br_if $label$11 (i32.ge_u (get_local $1) (get_local $2) ) ) (loop $label$12 (br_if $label$11 (i32.ge_u (tee_local $10 (i32.add (get_local $13) (get_local $1) ) ) (get_local $7) ) ) (br_if $label$11 (i32.lt_s (tee_local $10 (i32.load (get_local $10) ) ) (i32.const 0) ) ) (br_if $label$12 (i32.lt_u (tee_local $1 (i32.add (i32.add (get_local $1) (i32.and (get_local $10) (i32.const 2147483647) ) ) (i32.const 4) ) ) (get_local $2) ) ) ) ) (i32.store (get_local $8) (i32.or (select (get_local $1) (get_local $2) (i32.lt_u (get_local $1) (get_local $2) ) ) (i32.and (get_local $9) (i32.const -2147483648) ) ) ) (block $label$13 (br_if $label$13 (i32.le_u (get_local $1) (get_local $2) ) ) (i32.store (i32.add (get_local $13) (get_local $2) ) (i32.and (i32.add (get_local $4) (get_local $1) ) (i32.const 2147483647) ) ) ) (br_if $label$2 (i32.ge_u (get_local $1) (get_local $2) ) ) ) (br_if $label$9 (i32.lt_u (tee_local $13 (i32.add (i32.add (get_local $13) (get_local $1) ) (i32.const 4) ) ) (get_local $7) ) ) ) (set_local $1 (i32.const 0) ) (i32.store (get_local $11) (tee_local $13 (select (i32.const 0) (tee_local $13 (i32.add (i32.load (get_local $11) ) (i32.const 1) ) ) (i32.eq (get_local $13) (i32.load (get_local $12) ) ) ) ) ) (br_if $label$8 (i32.ne (get_local $13) (get_local $3) ) ) ) ) (return (get_local $1) ) ) (i32.store (get_local $8) (i32.or (i32.load (get_local $8) ) (i32.const -2147483648) ) ) (return (get_local $13) ) ) (i32.const 0) ) (func $_ZN4bcio14memory_manager16next_active_heapEv (param $0 i32) (result i32) (local $1 i32) (local $2 i32) (local $3 i32) (local $4 i32) (local $5 i32) (local $6 i32) (local $7 i32) (local $8 i32) (set_local $1 (i32.load offset=8388 (get_local $0) ) ) (block $label$0 (block $label$1 (br_if $label$1 (i32.eqz (i32.load8_u offset=9798 (i32.const 0) ) ) ) (set_local $7 (i32.load offset=9800 (i32.const 0) ) ) (br $label$0) ) (set_local $7 (current_memory) ) (i32.store8 offset=9798 (i32.const 0) (i32.const 1) ) (i32.store offset=9800 (i32.const 0) (tee_local $7 (i32.shl (get_local $7) (i32.const 16) ) ) ) ) (set_local $3 (get_local $7) ) (block $label$2 (block $label$3 (block $label$4 (block $label$5 (br_if $label$5 (i32.le_u (tee_local $2 (i32.shr_u (i32.add (get_local $7) (i32.const 65535) ) (i32.const 16) ) ) (tee_local $8 (current_memory) ) ) ) (drop (grow_memory (i32.sub (get_local $2) (get_local $8) ) ) ) (set_local $8 (i32.const 0) ) (br_if $label$4 (i32.ne (get_local $2) (current_memory) ) ) (set_local $3 (i32.load offset=9800 (i32.const 0) ) ) ) (set_local $8 (i32.const 0) ) (i32.store offset=9800 (i32.const 0) (get_local $3) ) (br_if $label$4 (i32.lt_s (get_local $7) (i32.const 0) ) ) (set_local $2 (i32.add (get_local $0) (i32.mul (get_local $1) (i32.const 12) ) ) ) (set_local $7 (i32.sub (i32.sub (i32.add (get_local $7) (select (i32.const 65536) (i32.const 131072) (tee_local $6 (i32.lt_u (tee_local $8 (i32.and (get_local $7) (i32.const 65535) ) ) (i32.const 64513) ) ) ) ) (select (get_local $8) (i32.and (get_local $7) (i32.const 131071) ) (get_local $6) ) ) (get_local $7) ) ) (block $label$6 (br_if $label$6 (i32.load8_u offset=9798 (i32.const 0) ) ) (set_local $3 (current_memory) ) (i32.store8 offset=9798 (i32.const 0) (i32.const 1) ) (i32.store offset=9800 (i32.const 0) (tee_local $3 (i32.shl (get_local $3) (i32.const 16) ) ) ) ) (set_local $2 (i32.add (get_local $2) (i32.const 8192) ) ) (br_if $label$3 (i32.lt_s (get_local $7) (i32.const 0) ) ) (set_local $6 (get_local $3) ) (block $label$7 (br_if $label$7 (i32.le_u (tee_local $8 (i32.shr_u (i32.add (i32.add (tee_local $5 (i32.and (i32.add (get_local $7) (i32.const 7) ) (i32.const -8) ) ) (get_local $3) ) (i32.const 65535) ) (i32.const 16) ) ) (tee_local $4 (current_memory) ) ) ) (drop (grow_memory (i32.sub (get_local $8) (get_local $4) ) ) ) (br_if $label$3 (i32.ne (get_local $8) (current_memory) ) ) (set_local $6 (i32.load offset=9800 (i32.const 0) ) ) ) (i32.store offset=9800 (i32.const 0) (i32.add (get_local $6) (get_local $5) ) ) (br_if $label$3 (i32.eq (get_local $3) (i32.const -1) ) ) (br_if $label$2 (i32.eq (i32.add (tee_local $6 (i32.load (i32.add (tee_local $1 (i32.add (get_local $0) (i32.mul (get_local $1) (i32.const 12) ) ) ) (i32.const 8196) ) ) ) (tee_local $8 (i32.load (get_local $2) ) ) ) (get_local $3) ) ) (block $label$8 (br_if $label$8 (i32.eq (get_local $8) (tee_local $1 (i32.load (tee_local $5 (i32.add (get_local $1) (i32.const 8200) ) ) ) ) ) ) (i32.store (tee_local $6 (i32.add (get_local $6) (get_local $1) ) ) (i32.or (i32.and (i32.load (get_local $6) ) (i32.const -2147483648) ) (i32.add (i32.sub (i32.const -4) (get_local $1) ) (get_local $8) ) ) ) (i32.store (get_local $5) (i32.load (get_local $2) ) ) (i32.store (get_local $6) (i32.and (i32.load (get_local $6) ) (i32.const 2147483647) ) ) ) (i32.store (tee_local $2 (i32.add (get_local $0) (i32.const 8388) ) ) (tee_local $2 (i32.add (i32.load (get_local $2) ) (i32.const 1) ) ) ) (i32.store (i32.add (tee_local $0 (i32.add (get_local $0) (i32.mul (get_local $2) (i32.const 12) ) ) ) (i32.const 8196) ) (get_local $3) ) (i32.store (tee_local $8 (i32.add (get_local $0) (i32.const 8192) ) ) (get_local $7) ) ) (return (get_local $8) ) ) (block $label$9 (br_if $label$9 (i32.eq (tee_local $8 (i32.load (get_local $2) ) ) (tee_local $7 (i32.load (tee_local $1 (i32.add (tee_local $3 (i32.add (get_local $0) (i32.mul (get_local $1) (i32.const 12) ) ) ) (i32.const 8200) ) ) ) ) ) ) (i32.store (tee_local $3 (i32.add (i32.load (i32.add (get_local $3) (i32.const 8196) ) ) (get_local $7) ) ) (i32.or (i32.and (i32.load (get_local $3) ) (i32.const -2147483648) ) (i32.add (i32.sub (i32.const -4) (get_local $7) ) (get_local $8) ) ) ) (i32.store (get_local $1) (i32.load (get_local $2) ) ) (i32.store (get_local $3) (i32.and (i32.load (get_local $3) ) (i32.const 2147483647) ) ) ) (i32.store offset=8384 (get_local $0) (tee_local $3 (i32.add (i32.load (tee_local $7 (i32.add (get_local $0) (i32.const 8388) ) ) ) (i32.const 1) ) ) ) (i32.store (get_local $7) (get_local $3) ) (return (i32.const 0) ) ) (i32.store (get_local $2) (i32.add (get_local $8) (get_local $7) ) ) (get_local $2) ) (func $free (param $0 i32) (local $1 i32) (local $2 i32) (local $3 i32) (block $label$0 (block $label$1 (br_if $label$1 (i32.eqz (get_local $0) ) ) (br_if $label$1 (i32.lt_s (tee_local $2 (i32.load offset=9688 (i32.const 0) ) ) (i32.const 1) ) ) (set_local $3 (i32.const 9496) ) (set_local $1 (i32.add (i32.mul (get_local $2) (i32.const 12) ) (i32.const 9496) ) ) (loop $label$2 (br_if $label$1 (i32.eqz (tee_local $2 (i32.load (i32.add (get_local $3) (i32.const 4) ) ) ) ) ) (block $label$3 (br_if $label$3 (i32.gt_u (i32.add (get_local $2) (i32.const 4) ) (get_local $0) ) ) (br_if $label$0 (i32.gt_u (i32.add (get_local $2) (i32.load (get_local $3) ) ) (get_local $0) ) ) ) (br_if $label$2 (i32.lt_u (tee_local $3 (i32.add (get_local $3) (i32.const 12) ) ) (get_local $1) ) ) ) ) (return) ) (i32.store (tee_local $3 (i32.add (get_local $0) (i32.const -4) ) ) (i32.and (i32.load (get_local $3) ) (i32.const 2147483647) ) ) ) (func $__wasm_nullptr (type $FUNCSIG$v) (unreachable) ) ) )=====";

jay_yan726@outlook.com

1407992f26e832cce2b36a3c856d0e07f0ca92aa

3f3a42f429f8bcd769644148b24c3b0e6e2589ed

/GameProject/GameEngine/EngineCore/Math/Vector.h

730023c58975c1418d629e7c939e606767c91359

no_license

DanielNeander/my-3d-engine

d10ad3e57a205f6148357f47467b550c7e0e0f33

7f0babbfdf0b719ea4b114a89997d3e52bcb2b6c

refs/heads/master

UTF-8

C++

h

#pragma once #ifndef __MATH_VECTOR_H__ #define __MATH_VECTOR_H__ //#include <Core/SysCommon.h> #include "Math.h" #include "Enginecore/Heap.h" /* =============================================================================== Vector classes =============================================================================== */ #define VECTOR_EPSILON 0.001f class idPolar3; class noQuat; class noVec2 { public: float x,y; noVec2(); explicit noVec2( const float x, const float y ); explicit noVec2( const float x); void Set( const float x, const float y); void Zero( void ); float operator[]( int index ) const; float& operator[]( int index ); noVec2 operator-() const; float operator*( const noVec2& a ) const; noVec2 operator*( const float a ) const; noVec2 operator/( const float a ) const; noVec2 operator+( const noVec2& a ) const; noVec2 operator-( const noVec2& a ) const; noVec2& operator+=( const noVec2& a); noVec2& operator-=( const noVec2& a); noVec2& operator/=( const noVec2& a); noVec2& operator/=( const float a); noVec2& operator*=( const float a); friend noVec2 operator*( const float a, const noVec2 b ); bool Compare( const noVec2& a ) const; bool Compare( const noVec2& a, const float epsilon ) const; bool operator==( const noVec2& a ) const; bool operator!=( const noVec2& a ) const; float Length( void ) const; float LengthFast( void ) const; float LengthSqr( void ) const; float Normalize( void ); float NormalizeFast( void ); noVec2& Truncate( float length ); void Clamp( const noVec2& min, const noVec2& max ); void Snap( void ); void SnapInt( void ); //returns the vector that is perpendicular to this one. noVec2 Perp()const; int GetDimension( void ) const; const float * ToFloatPtr( void ) const; float * ToFloatPtr( void ); const char * ToString( int precision = 2 ) const; void Lerp( const noVec2 &v1, const noVec2 &v2, const float l ); int Sign(const noVec2& v2) const; int IsNearlyZero(FLOAT Tolerance=KINDA_SMALL_NUMBER) const; }; extern noVec2 vec2_origin; #define vec2_zero vec2_origin NO_INLINE noVec2::noVec2( void ) {} NO_INLINE noVec2::noVec2( const float x, const float y) { this->x = x; this->y = y; } NO_INLINE noVec2::noVec2( const float _x ) :x(_x), y(_x) { } NO_INLINE void noVec2::Set( const float x, const float y ) { this->x = x; this->y = y; } NO_INLINE void noVec2::Zero( void ) { x = y = 0.0f; } NO_INLINE float noVec2::operator[]( int index ) const { return (&x)[index]; } NO_INLINE float& noVec2::operator[]( int index ) { return (&x)[index]; } NO_INLINE noVec2 noVec2::operator-() const { return noVec2(-x, -y); } NO_INLINE float noVec2::operator*( const noVec2& a ) const { return x * a.x + y * a.y; } NO_INLINE noVec2 noVec2::operator*( const float a ) const { return noVec2( x * a, y * a); } NO_INLINE noVec2 operator*( const float a, const noVec2 b ) { return noVec2( b.x * a, b.y * a); } NO_INLINE noVec2 noVec2::operator/( const float a ) const { float inva = 1.0f / a; return noVec2( x * inva, y * inva ); } NO_INLINE noVec2 noVec2::operator+( const noVec2& a ) const { return noVec2( x + a.x, y + a.y ); } NO_INLINE noVec2 noVec2::operator-( const noVec2& a ) const { return noVec2( x - a.x, y - a.y ); } NO_INLINE int noVec2::IsNearlyZero(FLOAT Tolerance) const { return noMath::Fabs(x)<Tolerance && noMath::Fabs(y)<Tolerance; } NO_INLINE noVec2& noVec2::operator+=( const noVec2& a ) { x += a.x; y += a.y; return *this; } NO_INLINE noVec2& noVec2::operator-=( const noVec2& a ) { x -= a.x; y -= a.y; return *this; } NO_INLINE noVec2& noVec2::operator/=( const noVec2& a ) { x /= a.x; y /= a.y; return *this; } NO_INLINE noVec2& noVec2::operator/=( const float a ) { float inva = 1.0f / a; x *= inva; y *= inva; return *this; } NO_INLINE noVec2& noVec2::operator*=( const float a ) { x *= a; y *= a; return *this; } NO_INLINE bool noVec2::Compare( const noVec2& a ) const { return ( x == a.x) && ( y == a.y); } NO_INLINE bool noVec2::Compare( const noVec2& a, const float epsilon ) const { if ( noMath::Fabs( x - a.x ) > epsilon ) { return false; } if ( noMath::Fabs( y - a.y ) > epsilon ) { return false; } return true; } NO_INLINE bool noVec2::operator==( const noVec2& a ) const { return Compare( a ); } NO_INLINE bool noVec2::operator!=( const noVec2& a ) const { return !Compare( a ); } NO_INLINE float noVec2::Length( void ) const { return ( float )noMath::Sqrt( x * x + y * y ); } NO_INLINE float noVec2::LengthFast( void ) const { return 0.f; } NO_INLINE float noVec2::LengthSqr( void ) const { return ( x * x + y * y ); } NO_INLINE float noVec2::Normalize( void ) { float sqrLen, invLen; sqrLen = x * x + y * y; invLen = noMath::InvSqrt( sqrLen ); x *= invLen; y *= invLen; return invLen * sqrLen; } NO_INLINE float noVec2::NormalizeFast( void ) { return 0.f; } NO_INLINE noVec2& noVec2::Truncate( float length ) { float len2; float ilen; if ( !length ) { Zero(); } else { len2 = LengthSqr(); if ( len2 > length * length ) { ilen = length * noMath::InvSqrt( len2 ); x *= ilen; y *= ilen; } } return *this; } NO_INLINE noVec2 noVec2::Perp() const { return noVec2(-y, x); } NO_INLINE void noVec2::Clamp( const noVec2& min, const noVec2& max ) { if ( x < min.x ) { x = min.x; } else if ( x > max.x ) { x = max.x; } if ( y < min.y ) { y = min.y; } else if ( y > max.y ) { y = max.y; } } NO_INLINE void noVec2::Snap( void ) { x = floor( x + 0.5f ); y = floor( y + 0.5f ); } NO_INLINE void noVec2::SnapInt( void ) { x = float( int( x ) ); y = float( int( y ) ); } NO_INLINE int noVec2::GetDimension( void ) const { return 2; } NO_INLINE const float * noVec2::ToFloatPtr( void ) const { return &x; } NO_INLINE float * noVec2::ToFloatPtr( void ) { return &x; } //------------------------ Sign ------------------------------------------ // // returns positive if v2 is clockwise of this vector, // minus if anticlockwise (Y axis pointing down, X axis to right) //------------------------------------------------------------------------ enum {clockwise = 1, anticlockwise = -1}; NO_INLINE int noVec2::Sign(const noVec2& v2)const { if (y*v2.x > x*v2.y) { return anticlockwise; } else { return clockwise; } } class noVec3 { public: float x,y,z; noVec3( void ); explicit noVec3( const float x, const float y, const float z ); explicit noVec3( const float x); void Set( const float x, const float y, const float z ); void Zero( void ); float operator[]( const int index ) const; float & operator[]( const int index ); noVec3 operator-() const; noVec3 & operator=( const noVec3 &a ); // required because of a msvc 6 & 7 bug float operator*( const noVec3 &a ) const; noVec3 operator*( const float a ) const; noVec3 operator/( const float a ) const; noVec3 operator+( const noVec3 &a ) const; noVec3 operator-( const noVec3 &a ) const; noVec3 & operator+=( const noVec3 &a ); noVec3 & operator-=( const noVec3 &a ); noVec3 & operator/=( const noVec3 &a ); noVec3 & operator/=( const float a ); noVec3 & operator*=( const float a ); bool operator<(const noVec3& vIn) const; friend noVec3 operator*( const float a, const noVec3 b ); bool Compare( const noVec3 &a ) const; // exact compare, no epsilon bool Compare( const noVec3 &a, const float epsilon ) const; // compare with epsilon bool operator==( const noVec3 &a ) const; // exact compare, no epsilon bool operator!=( const noVec3 &a ) const; // exact compare, no epsilon bool FixDegenerateNormal( void ); // fix degenerate axial cases bool FixDenormals( void ); // change tiny numbers to zero noVec3 Cross( const noVec3 &a ) const; noVec3 & Cross( const noVec3 &a, const noVec3 &b ); float Length( void ) const; float LengthSqr( void ) const; float LengthFast( void ) const; float Normalize( void ); // returns length float NormalizeFast( void ); // returns length noVec3 & Truncate( float length ); // cap length void Clamp( const noVec3 &min, const noVec3 &max ); void Snap( void ); // snap to closest integer value void SnapInt( void ); // snap towards integer (floor) void Lerp( const noVec3 &v1, const noVec3 &v2, const float l ); void SLerp( const noVec3 &v1, const noVec3 &v2, const float l ); int GetDimension( void ) const; noMat3 ToMat3( void ) const; float ToYaw( void ) const; float ToPitch( void ) const; noAngles ToAngles( void ) const; idPolar3 ToPolar( void ) const; const noVec2 & ToVec2( void ) const; noVec2 & ToVec2( void ); const float * ToFloatPtr( void ) const; float * ToFloatPtr( void ); float Distance(const noVec3& vIn) const; float DistanceSqr(const noVec3& vIn) const; void Max(const noVec3 &other ); void Min(const noVec3 &other ); FLOAT GetMax() const { return ::Max(::Max(x,y),z); } FLOAT GetAbsMax() const { return ::Max(::Max(abs(x),abs(y)),abs(z)); } FLOAT GetMin() const { return ::Min(::Min(x,y),z); } noQuat getRotationTo(const noVec3& dest, const noVec3& fallbackAxis = noVec3(0.0f, 0.0f, 0.0f)) const; int Sign(const noVec3& v2)const; noVec3 Perp() const; noVec3 NormalizeCopy(void) const; /** Calculates a reflection vector to the plane with the given normal . @remarks NB assumes 'this' is pointing AWAY FROM the plane, invert if it is not. */ inline noVec3 Reflect(const noVec3& normal) const { return noVec3( *this - ( 2 * (*this) * (normal) * normal ) ); } const noVec3 Multiply(const noVec3& vIn) const; noVec3 Perpendicular(void) const; noVec3 SafeNormal2D(FLOAT Tolerance=1e-8) const; noVec3 SafeNormal(FLOAT Tolerance=1e-8) const; int IsNearlyZero(FLOAT Tolerance=KINDA_SMALL_NUMBER) const; void ProjectSelfOntoSphere( const float radius ); bool ProjectAlongPlane( const noVec3 &normal, const float epsilon, const float overBounce ); void ProjectOntoPlane( const noVec3 &normal, const float overBounce ); void OrthogonalBasis( noVec3 &left, noVec3 &up ) const; void NormalVectors( noVec3 &left, noVec3 &down ) const; const char *ToString( int precision = 2) const; }; extern noVec3 vec3_origin; extern noVec3 vec3_origin; #define vec3_zero vec3_origin NO_INLINE noVec3::noVec3( void ) {} NO_INLINE noVec3::noVec3( const float x, const float y, const float z) { this->x = x; this->y = y; this->z = z; } NO_INLINE noVec3::noVec3( const float _x ) :x(_x), y(_x), z(_x) { } NO_INLINE void noVec3::Set( const float x, const float y, const float z ) { this->x = x; this->y = y; this->z = z; } NO_INLINE void noVec3::Zero( void ) { x = y = z = 0.0f; } NO_INLINE float noVec3::operator[]( int index ) const { return (&x)[index]; } NO_INLINE float& noVec3::operator[]( int index ) { return (&x)[index]; } NO_INLINE noVec3 & noVec3::operator=( const noVec3 &a ) { x = a.x; y = a.y; z = a.z; return *this; } NO_INLINE noVec3 noVec3::operator-() const { return noVec3(-x, -y, -z); } NO_INLINE float noVec3::operator*( const noVec3& a ) const { return x * a.x + y * a.y + z * a.z; } NO_INLINE noVec3 noVec3::operator*( const float a ) const { return noVec3( x * a, y * a, z * a ); } NO_INLINE noVec3 noVec3::operator/( const float a ) const { float inva = 1.0f / a; return noVec3( x * inva, y * inva, z * inva ); } NO_INLINE noVec3 noVec3::operator+( const noVec3& a ) const { return noVec3( x + a.x, y + a.y, z + a.z ); } NO_INLINE noVec3 operator*( const float a, const noVec3 b ) { return noVec3( b.x * a, b.y * a, b.z * a); } NO_INLINE noVec3 noVec3::operator-( const noVec3& a ) const { return noVec3( x - a.x, y - a.y, z - a.z ); } NO_INLINE noVec3& noVec3::operator+=( const noVec3& a ) { x += a.x; y += a.y; z += a.z; return *this; } NO_INLINE noVec3& noVec3::operator-=( const noVec3& a ) { x -= a.x; y -= a.y; z -= a.z; return *this; } NO_INLINE noVec3& noVec3::operator/=( const noVec3& a ) { x /= a.x; y /= a.y; z /= a.z; return *this; } NO_INLINE noVec3& noVec3::operator/=( const float a ) { float inva = 1.0f / a; x *= inva; y *= inva; z *= inva; return *this; } NO_INLINE noVec3& noVec3::operator*=( const float a ) { x *= a; y *= a; z *= a; return *this; } NO_INLINE bool noVec3::operator<(const noVec3& vIn) const { if (x == vIn.x) { if (y == vIn.y) return z < vIn.z; else return y < vIn.y; } else return x < vIn.x; } NO_INLINE bool noVec3::Compare( const noVec3& a ) const { return ( x == a.x) && ( y == a.y) && ( z == a.z ); } NO_INLINE bool noVec3::Compare( const noVec3& a, const float epsilon ) const { if ( noMath::Fabs( x - a.x ) > epsilon ) { return false; } if ( noMath::Fabs( y - a.y ) > epsilon ) { return false; } if ( noMath::Fabs( z - a.z ) > epsilon ) { return false; } return true; } NO_INLINE bool noVec3::operator==( const noVec3& a ) const { return Compare( a ); } NO_INLINE bool noVec3::operator!=( const noVec3& a ) const { return !Compare( a ); } NO_INLINE float noVec3::Length( void ) const { return ( float )noMath::Sqrt( x * x + y * y + z * z ); } NO_INLINE float noVec3::LengthFast( void ) const { return 0.f; } NO_INLINE float noVec3::LengthSqr( void ) const { return ( x * x + y * y + z * z ); } NO_INLINE float noVec3::DistanceSqr( const noVec3& vIn ) const { return ((*this - vIn).LengthSqr()); } NO_INLINE float noVec3::Distance( const noVec3& vIn ) const { return ((*this - vIn).Length()); } NO_INLINE float noVec3::Normalize( void ) { float sqrLen, invLen; sqrLen = x * x + y * y + z * z; invLen = noMath::InvSqrt( sqrLen ); x *= invLen; y *= invLen; z *= invLen; return invLen * sqrLen; } NO_INLINE float noVec3::NormalizeFast( void ) { return 0.f; } NO_INLINE noVec3 noVec3::SafeNormal(FLOAT Tolerance) const { const float SquareSum = x*x + y*y + z*z; // Not sure if it's safe to add tolerance in there. Might introduce too many errors if( SquareSum == 1.f ) { return *this; } else if( SquareSum < Tolerance ) { return noVec3(0.f); } const FLOAT Scale = noMath::InvSqrt(SquareSum); return noVec3(x*Scale, y*Scale, z*Scale); } NO_INLINE noVec3 noVec3::SafeNormal2D(FLOAT Tolerance) const { const FLOAT SquareSum = x*x + y*y; // Not sure if it's safe to add tolerance in there. Might introduce too many errors if( SquareSum == 1.f ) { if( z == 0.f ) { return *this; } else { return noVec3(x, y, 0.f); } } else if( SquareSum < Tolerance ) { return noVec3(0.f); } const FLOAT Scale = noMath::InvSqrt(SquareSum); return noVec3(x*Scale, y*Scale, 0.f); } NO_INLINE noVec3& noVec3::Truncate( float length ) { float len2; float ilen; if ( !length ) { Zero(); } else { len2 = LengthSqr(); if ( len2 > length * length ) { ilen = length * noMath::InvSqrt( len2 ); x *= ilen; y *= ilen; z *= ilen; } } return *this; } NO_INLINE void noVec3::Clamp( const noVec3& min, const noVec3& max ) { if ( x < min.x ) { x = min.x; } else if ( x > max.x ) { x = max.x; } if ( y < min.y ) { y = min.y; } else if ( y > max.y ) { y = max.y; } if ( z < min.z ) { z = min.z; } else if ( z > max.z ) { z = max.z; } } NO_INLINE void noVec3::Snap( void ) { x = floor( x + 0.5f ); y = floor( y + 0.5f ); z = floor( z + 0.5f ); } NO_INLINE void noVec3::SnapInt( void ) { x = float( int( x ) ); y = float( int( y ) ); z = float( int( z ) ); } NO_INLINE int noVec3::GetDimension( void ) const { return 3; } NO_INLINE const noVec2 & noVec3::ToVec2( void ) const { return *reinterpret_cast<const noVec2 *>(this); } NO_INLINE noVec2 & noVec3::ToVec2( void ) { return *reinterpret_cast<noVec2 *>(this); } NO_INLINE const float * noVec3::ToFloatPtr( void ) const { return &x; } NO_INLINE float * noVec3::ToFloatPtr( void ) { return &x; } NO_INLINE void noVec3::Min(const noVec3 &other ) { x = __min(x,other.x); y = __min(y,other.y); z = __min(z,other.z); } NO_INLINE void noVec3::Max(const noVec3 &other ) { x = __max(x,other.x); y = __max(y,other.y); z = __max(z,other.z); } NO_INLINE int noVec3::Sign(const noVec3& v2)const { if (z*v2.x > x*v2.z) { return anticlockwise; } else { return clockwise; } } NO_INLINE noVec3 noVec3::Perp() const { return noVec3(-z, y, x); } NO_INLINE noVec3 noVec3::NormalizeCopy(void) const { noVec3 ret = *this; ret.Normalize(); return ret; } NO_INLINE const noVec3 noVec3::Multiply(const noVec3& vIn) const { return noVec3(x * vIn.x, y * vIn.y, z * vIn.z); } NO_INLINE int noVec3::IsNearlyZero( FLOAT Tolerance/*=KINDA_SMALL_NUMBER*/ ) const { return noMath::Fabs(x) < Tolerance && noMath::Fabs(y) < Tolerance && noMath::Fabs(z) < Tolerance; } NO_INLINE void noVec3::NormalVectors( noVec3 &left, noVec3 &down ) const { float d; d = x * x + y * y; if ( !d ) { left[0] = 1; left[1] = 0; left[2] = 0; } else { d = noMath::InvSqrt( d ); left[0] = -y * d; left[1] = x * d; left[2] = 0; } down = left.Cross( *this ); } NO_INLINE void noVec3::OrthogonalBasis( noVec3 &left, noVec3 &up ) const { float l, s; if ( noMath::Fabs( z ) > 0.7f ) { l = y * y + z * z; s = noMath::InvSqrt( l ); up[0] = 0; up[1] = z * s; up[2] = -y * s; left[0] = l * s; left[1] = -x * up[2]; left[2] = x * up[1]; } else { l = x * x + y * y; s = noMath::InvSqrt( l ); left[0] = -y * s; left[1] = x * s; left[2] = 0; up[0] = -z * left[1]; up[1] = z * left[0]; up[2] = l * s; } } NO_INLINE void noVec3::ProjectOntoPlane( const noVec3 &normal, const float overBounce ) { float backoff; backoff = *this * normal; if ( overBounce != 1.0 ) { if ( backoff < 0 ) { backoff *= overBounce; } else { backoff /= overBounce; } } *this -= backoff * normal; } NO_INLINE bool noVec3::ProjectAlongPlane( const noVec3 &normal, const float epsilon, const float overBounce ) { noVec3 cross; float len; cross = this->Cross( normal ).Cross( (*this) ); // normalize so a fixed epsilon can be used cross.Normalize(); len = normal * cross; if ( noMath::Fabs( len ) < epsilon ) { return false; } cross *= overBounce * ( normal * (*this) ) / len; (*this) -= cross; return true; } /** Generates a vector perpendicular to this vector (eg an 'up' vector). @remarks This method will return a vector which is perpendicular to this vector. There are an infinite number of possibilities but this method will guarantee to generate one of them. If you need more control you should use the Quaternion class. */ NO_INLINE noVec3 noVec3::Perpendicular(void) const { static const Real fSquareZero = (Real)(1e-06 * 1e-06); noVec3 perp = this->Cross( noVec3(1.f, 0.f, 0.f) ); // Check length if( perp.LengthSqr() < fSquareZero ) { /* This vector is the Y axis multiplied by a scalar, so we have to use another axis. */ perp = this->Cross( noVec3(0.f, 1.0f, 0.f) ); } perp.Normalize(); return perp; } class noVec4 { public: noVec4() {} noVec4(float x, float y, float z, float w); noVec4(const noVec3& v, float w); NO_INLINE void Set(float x, float y, float z, float w=0); NO_INLINE void SetAll( float x ); NO_INLINE void SetAll3( float x ); NO_INLINE void SetZero4( void ); float operator[]( const int index ) const; float & operator[]( const int index ); noVec4 operator-() const; noVec4 & operator=( const noVec4 &a ); // required because of a msvc 6 & 7 bug float operator*( const noVec4 &a ) const; noVec4 operator*( const float a ) const; noVec4 operator/( const float a ) const; noVec4 operator+( const noVec4 &a ) const; noVec4 operator-( const noVec4 &a ) const; noVec4 & operator+=( const noVec4 &a ); noVec4 & operator-=( const noVec4 &a ); noVec4 & operator/=( const noVec4 &a ); noVec4 & operator/=( const float a ); noVec4 & operator*=( const float a ); friend noVec4 operator*( const float a, const noVec4 b ); bool Compare( const noVec4 &a, const float epsilon ) const; float Normalize(); float Length( void ) const; int GetDimension( void ) const; const noVec2 & ToVec2( void ) const; noVec2 & ToVec2( void ); const noVec3 & ToVec3( void ) const; noVec3 & ToVec3( void ); const float * ToFloatPtr( void ) const; float * ToFloatPtr( void ); const noVec4 Multiply(const noVec4& vIn) const; void Min(const noVec4 &other ); void Max(const noVec4 &other ); //NO_ALIGN16( float x ); float x ; float y,z,w; }; extern noVec4 vec4_origin; #define vec4_zero vec4_origin NO_INLINE noVec4::noVec4( float x, float y, float z, float w ) { Set(x, y, z, w); } NO_INLINE noVec4::noVec4( const noVec3& v, float _w ) { x = v.x; y = v.y; z = v.z; w = _w; } NO_INLINE void noVec4::Set( float x, float y, float z, float w/*=0*/ ) { this->x = x; this->y = y; this->z = z; this->w = w; } NO_INLINE void noVec4::SetAll( float a ) { x = y = z = w = a; } NO_INLINE void noVec4::SetAll3( float a ) { x = y = z = a; } NO_INLINE void noVec4::SetZero4( void ) { x = y = z = w = 0.f; } NO_INLINE float noVec4::operator[]( const int index ) const { return (&x)[ index ]; } NO_INLINE float & noVec4::operator[]( const int index ) { return (&x)[ index ]; } NO_INLINE noVec4 & noVec4::operator=( const noVec4 &a ) { x = a.x; y = a.y; z = a.z; w = a.w; return *this; } ID_INLINE bool noVec4::Compare( const noVec4 &a, const float epsilon ) const { if ( noMath::Fabs( x - a.x ) > epsilon ) { return false; } if ( noMath::Fabs( y - a.y ) > epsilon ) { return false; } if ( noMath::Fabs( z - a.z ) > epsilon ) { return false; } if ( noMath::Fabs( w - a.w ) > epsilon ) { return false; } return true; } NO_INLINE noVec4 noVec4::operator-() const { return noVec4(-x, -y, -z, -w); } NO_INLINE float noVec4::operator*( const noVec4 &a ) const { return (x * a.x) + (y * a.y) + (z * a.z) + ( w * a.w); } NO_INLINE noVec4 noVec4::operator*( const float a ) const { return noVec4(x * a, y * a, z * a, w * a); } NO_INLINE noVec4 noVec4::operator/( const float a ) const { return noVec4(x / a, y / a, z / a, w / a); } NO_INLINE noVec4 noVec4::operator+( const noVec4 &a ) const { return noVec4(x + a.x, y + a.y, z + a.z, w + a.w); } NO_INLINE noVec4 noVec4::operator-( const noVec4 &a ) const { return noVec4(x - a.x, y - a.y, z - a.z, w - a.w); } NO_INLINE noVec4 & noVec4::operator+=( const noVec4 &a ) { x += a.x; y += a.y; z += a.z; w += a.w; return *this; } NO_INLINE noVec4 & noVec4::operator-=( const noVec4 &a ) { x -= a.x; y -= a.y; z -= a.z; w -= a.w; return *this; } NO_INLINE noVec4 & noVec4::operator/=( const noVec4 &a ) { x /= a.x; y /= a.y; z /= a.z; w /= a.w; return *this; } NO_INLINE noVec4 & noVec4::operator/=( const float a ) { x /= a; y /= a; z /= a; w /= a; return *this; } NO_INLINE noVec4 & noVec4::operator*=( const float a ) { x *= a; y *= a; z *= a; w *= a; return *this; } NO_INLINE noVec4 operator*( const float a, const noVec4 b ) { return noVec4( b.x * a, b.y * a, b.z * a, b.w * a ); } NO_INLINE const noVec4 noVec4::Multiply(const noVec4& vIn) const { return noVec4(x * vIn.x, y * vIn.y, z * vIn.z, w * vIn.w); } ID_INLINE const noVec2 &noVec4::ToVec2( void ) const { return *reinterpret_cast<const noVec2 *>(this); } ID_INLINE noVec2 &noVec4::ToVec2( void ) { return *reinterpret_cast<noVec2 *>(this); } ID_INLINE const noVec3 &noVec4::ToVec3( void ) const { return *reinterpret_cast<const noVec3 *>(this); } ID_INLINE noVec3 &noVec4::ToVec3( void ) { return *reinterpret_cast<noVec3 *>(this); } NO_INLINE const float * noVec4::ToFloatPtr( void ) const { return &x; } NO_INLINE float * noVec4::ToFloatPtr( void ) { return &x; } NO_INLINE float noVec4::Length( void ) const { return ( float )noMath::Sqrt( x * x + y * y + z * z + w * w); } NO_INLINE bool noVec3::FixDegenerateNormal( void ) { if ( x == 0.0f ) { if ( y == 0.0f ) { if ( z > 0.0f ) { if ( z != 1.0f ) { z = 1.0f; return true; } } else { if ( z != -1.0f ) { z = -1.0f; return true; } } return false; } else if ( z == 0.0f ) { if ( y > 0.0f ) { if ( y != 1.0f ) { y = 1.0f; return true; } } else { if ( y != -1.0f ) { y = -1.0f; return true; } } return false; } } else if ( y == 0.0f ) { if ( z == 0.0f ) { if ( x > 0.0f ) { if ( x != 1.0f ) { x = 1.0f; return true; } } else { if ( x != -1.0f ) { x = -1.0f; return true; } } return false; } } if ( noMath::Fabs( x ) == 1.0f ) { if ( y != 0.0f || z != 0.0f ) { y = z = 0.0f; return true; } return false; } else if ( noMath::Fabs( y ) == 1.0f ) { if ( x != 0.0f || z != 0.0f ) { x = z = 0.0f; return true; } return false; } else if ( noMath::Fabs( z ) == 1.0f ) { if ( x != 0.0f || y != 0.0f ) { x = y = 0.0f; return true; } return false; } return false; } NO_INLINE bool noVec3::FixDenormals( void ) { bool denormal = false; if ( fabs( x ) < 1e-30f ) { x = 0.0f; denormal = true; } if ( fabs( y ) < 1e-30f ) { y = 0.0f; denormal = true; } if ( fabs( z ) < 1e-30f ) { z = 0.0f; denormal = true; } return denormal; } NO_INLINE noVec3 noVec3::Cross( const noVec3 &a ) const { return noVec3( y * a.z - z * a.y, z * a.x - x * a.z, x * a.y - y * a.x ); } NO_INLINE noVec3 & noVec3::Cross( const noVec3 &a, const noVec3 &b ) { x = a.y * b.z - a.z * b.y; y = a.z * b.x - a.x * b.z; z = a.x * b.y - a.y * b.x; return *this; } NO_INLINE float noVec4::Normalize( void ) { float sqrLen, invLen; sqrLen = x * x + y * y + z * z + w * w; invLen = noMath::InvSqrt( sqrLen ); x *= invLen; y *= invLen; z *= invLen; w *= invLen; return invLen * sqrLen; } NO_INLINE void noVec4::Min(const noVec4 &other ) { x = __min(x,other.x); y = __min(y,other.y); z = __min(z,other.z); w = __min(w,other.w); } NO_INLINE void noVec4::Max(const noVec4 &other ) { x = __max(x,other.x); y = __max(y,other.y); z = __max(z,other.z); w = __max(w,other.w); } //=============================================================== // // idVec5 - 5D vector // //=============================================================== class idVec5 { public: float x; float y; float z; float s; float t; idVec5( void ); explicit idVec5( const noVec3 &xyz, const noVec2 &st ); explicit idVec5( const float x, const float y, const float z, const float s, const float t ); float operator[]( int index ) const; float & operator[]( int index ); idVec5 & operator=( const noVec3 &a ); int GetDimension( void ) const; const noVec3 & ToVec3( void ) const; noVec3 & ToVec3( void ); const float * ToFloatPtr( void ) const; float * ToFloatPtr( void ); const char * ToString( int precision = 2 ) const; void Lerp( const idVec5 &v1, const idVec5 &v2, const float l ); }; extern idVec5 vec5_origin; #define vec5_zero vec5_origin ID_INLINE idVec5::idVec5( void ) { } ID_INLINE idVec5::idVec5( const noVec3 &xyz, const noVec2 &st ) { x = xyz.x; y = xyz.y; z = xyz.z; s = st[0]; t = st[1]; } ID_INLINE idVec5::idVec5( const float x, const float y, const float z, const float s, const float t ) { this->x = x; this->y = y; this->z = z; this->s = s; this->t = t; } ID_INLINE float idVec5::operator[]( int index ) const { return ( &x )[ index ]; } ID_INLINE float& idVec5::operator[]( int index ) { return ( &x )[ index ]; } ID_INLINE idVec5 &idVec5::operator=( const noVec3 &a ) { x = a.x; y = a.y; z = a.z; s = t = 0; return *this; } ID_INLINE int idVec5::GetDimension( void ) const { return 5; } ID_INLINE const noVec3 &idVec5::ToVec3( void ) const { return *reinterpret_cast<const noVec3 *>(this); } ID_INLINE noVec3 &idVec5::ToVec3( void ) { return *reinterpret_cast<noVec3 *>(this); } ID_INLINE const float *idVec5::ToFloatPtr( void ) const { return &x; } ID_INLINE float *idVec5::ToFloatPtr( void ) { return &x; } //=============================================================== // // idVec6 - 6D vector // //=============================================================== class idVec6 { public: idVec6( void ); explicit idVec6( const float *a ); explicit idVec6( const float a1, const float a2, const float a3, const float a4, const float a5, const float a6 ); void Set( const float a1, const float a2, const float a3, const float a4, const float a5, const float a6 ); void Zero( void ); float operator[]( const int index ) const; float & operator[]( const int index ); idVec6 operator-() const; idVec6 operator*( const float a ) const; idVec6 operator/( const float a ) const; float operator*( const idVec6 &a ) const; idVec6 operator-( const idVec6 &a ) const; idVec6 operator+( const idVec6 &a ) const; idVec6 & operator*=( const float a ); idVec6 & operator/=( const float a ); idVec6 & operator+=( const idVec6 &a ); idVec6 & operator-=( const idVec6 &a ); friend idVec6 operator*( const float a, const idVec6 b ); bool Compare( const idVec6 &a ) const; // exact compare, no epsilon bool Compare( const idVec6 &a, const float epsilon ) const; // compare with epsilon bool operator==( const idVec6 &a ) const; // exact compare, no epsilon bool operator!=( const idVec6 &a ) const; // exact compare, no epsilon float Length( void ) const; float LengthSqr( void ) const; float Normalize( void ); // returns length float NormalizeFast( void ); // returns length int GetDimension( void ) const; const noVec3 & SubVec3( int index ) const; noVec3 & SubVec3( int index ); const float * ToFloatPtr( void ) const; float * ToFloatPtr( void ); const char * ToString( int precision = 2 ) const; private: float p[6]; }; extern idVec6 vec6_origin; #define vec6_zero vec6_origin extern idVec6 vec6_infinity; ID_INLINE idVec6::idVec6( void ) { } ID_INLINE idVec6::idVec6( const float *a ) { memcpy( p, a, 6 * sizeof( float ) ); } ID_INLINE idVec6::idVec6( const float a1, const float a2, const float a3, const float a4, const float a5, const float a6 ) { p[0] = a1; p[1] = a2; p[2] = a3; p[3] = a4; p[4] = a5; p[5] = a6; } ID_INLINE idVec6 idVec6::operator-() const { return idVec6( -p[0], -p[1], -p[2], -p[3], -p[4], -p[5] ); } ID_INLINE float idVec6::operator[]( const int index ) const { return p[index]; } ID_INLINE float &idVec6::operator[]( const int index ) { return p[index]; } ID_INLINE idVec6 idVec6::operator*( const float a ) const { return idVec6( p[0]*a, p[1]*a, p[2]*a, p[3]*a, p[4]*a, p[5]*a ); } ID_INLINE float idVec6::operator*( const idVec6 &a ) const { return p[0] * a[0] + p[1] * a[1] + p[2] * a[2] + p[3] * a[3] + p[4] * a[4] + p[5] * a[5]; } ID_INLINE idVec6 idVec6::operator/( const float a ) const { float inva; assert( a != 0.0f ); inva = 1.0f / a; return idVec6( p[0]*inva, p[1]*inva, p[2]*inva, p[3]*inva, p[4]*inva, p[5]*inva ); } ID_INLINE idVec6 idVec6::operator+( const idVec6 &a ) const { return idVec6( p[0] + a[0], p[1] + a[1], p[2] + a[2], p[3] + a[3], p[4] + a[4], p[5] + a[5] ); } ID_INLINE idVec6 idVec6::operator-( const idVec6 &a ) const { return idVec6( p[0] - a[0], p[1] - a[1], p[2] - a[2], p[3] - a[3], p[4] - a[4], p[5] - a[5] ); } ID_INLINE idVec6 &idVec6::operator*=( const float a ) { p[0] *= a; p[1] *= a; p[2] *= a; p[3] *= a; p[4] *= a; p[5] *= a; return *this; } ID_INLINE idVec6 &idVec6::operator/=( const float a ) { float inva; assert( a != 0.0f ); inva = 1.0f / a; p[0] *= inva; p[1] *= inva; p[2] *= inva; p[3] *= inva; p[4] *= inva; p[5] *= inva; return *this; } ID_INLINE idVec6 &idVec6::operator+=( const idVec6 &a ) { p[0] += a[0]; p[1] += a[1]; p[2] += a[2]; p[3] += a[3]; p[4] += a[4]; p[5] += a[5]; return *this; } ID_INLINE idVec6 &idVec6::operator-=( const idVec6 &a ) { p[0] -= a[0]; p[1] -= a[1]; p[2] -= a[2]; p[3] -= a[3]; p[4] -= a[4]; p[5] -= a[5]; return *this; } ID_INLINE idVec6 operator*( const float a, const idVec6 b ) { return b * a; } ID_INLINE bool idVec6::Compare( const idVec6 &a ) const { return ( ( p[0] == a[0] ) && ( p[1] == a[1] ) && ( p[2] == a[2] ) && ( p[3] == a[3] ) && ( p[4] == a[4] ) && ( p[5] == a[5] ) ); } ID_INLINE bool idVec6::Compare( const idVec6 &a, const float epsilon ) const { if ( noMath::Fabs( p[0] - a[0] ) > epsilon ) { return false; } if ( noMath::Fabs( p[1] - a[1] ) > epsilon ) { return false; } if ( noMath::Fabs( p[2] - a[2] ) > epsilon ) { return false; } if ( noMath::Fabs( p[3] - a[3] ) > epsilon ) { return false; } if ( noMath::Fabs( p[4] - a[4] ) > epsilon ) { return false; } if ( noMath::Fabs( p[5] - a[5] ) > epsilon ) { return false; } return true; } ID_INLINE bool idVec6::operator==( const idVec6 &a ) const { return Compare( a ); } ID_INLINE bool idVec6::operator!=( const idVec6 &a ) const { return !Compare( a ); } ID_INLINE void idVec6::Set( const float a1, const float a2, const float a3, const float a4, const float a5, const float a6 ) { p[0] = a1; p[1] = a2; p[2] = a3; p[3] = a4; p[4] = a5; p[5] = a6; } ID_INLINE void idVec6::Zero( void ) { p[0] = p[1] = p[2] = p[3] = p[4] = p[5] = 0.0f; } ID_INLINE float idVec6::Length( void ) const { return ( float )noMath::Sqrt( p[0] * p[0] + p[1] * p[1] + p[2] * p[2] + p[3] * p[3] + p[4] * p[4] + p[5] * p[5] ); } ID_INLINE float idVec6::LengthSqr( void ) const { return ( p[0] * p[0] + p[1] * p[1] + p[2] * p[2] + p[3] * p[3] + p[4] * p[4] + p[5] * p[5] ); } ID_INLINE float idVec6::Normalize( void ) { float sqrLength, invLength; sqrLength = p[0] * p[0] + p[1] * p[1] + p[2] * p[2] + p[3] * p[3] + p[4] * p[4] + p[5] * p[5]; invLength = noMath::InvSqrt( sqrLength ); p[0] *= invLength; p[1] *= invLength; p[2] *= invLength; p[3] *= invLength; p[4] *= invLength; p[5] *= invLength; return invLength * sqrLength; } ID_INLINE float idVec6::NormalizeFast( void ) { float sqrLength, invLength; sqrLength = p[0] * p[0] + p[1] * p[1] + p[2] * p[2] + p[3] * p[3] + p[4] * p[4] + p[5] * p[5]; invLength = noMath::RSqrt( sqrLength ); p[0] *= invLength; p[1] *= invLength; p[2] *= invLength; p[3] *= invLength; p[4] *= invLength; p[5] *= invLength; return invLength * sqrLength; } ID_INLINE int idVec6::GetDimension( void ) const { return 6; } ID_INLINE const noVec3 &idVec6::SubVec3( int index ) const { return *reinterpret_cast<const noVec3 *>(p + index * 3); } ID_INLINE noVec3 &idVec6::SubVec3( int index ) { return *reinterpret_cast<noVec3 *>(p + index * 3); } ID_INLINE const float *idVec6::ToFloatPtr( void ) const { return p; } ID_INLINE float *idVec6::ToFloatPtr( void ) { return p; } //=============================================================== // // idVecX - arbitrary sized vector // // The vector lives on 16 byte aligned and 16 byte padded memory. // // NOTE: due to the temporary memory pool idVecX cannot be used by multiple threads // //=============================================================== #define VECX_MAX_TEMP 1024 #define VECX_QUAD( x ) ( ( ( ( x ) + 3 ) & ~3 ) * sizeof( float ) ) #define VECX_CLEAREND() int s = size; while( s < ( ( s + 3) & ~3 ) ) { p[s++] = 0.0f; } #define VECX_ALLOCA( n ) ( (float *) _alloca16( VECX_QUAD( n ) ) ) #define VECX_SIMD class idVecX { friend class idMatX; public: idVecX( void ); explicit idVecX( int length ); explicit idVecX( int length, float *data ); ~idVecX( void ); float operator[]( const int index ) const; float & operator[]( const int index ); idVecX operator-() const; idVecX & operator=( const idVecX &a ); idVecX operator*( const float a ) const; idVecX operator/( const float a ) const; float operator*( const idVecX &a ) const; idVecX operator-( const idVecX &a ) const; idVecX operator+( const idVecX &a ) const; idVecX & operator*=( const float a ); idVecX & operator/=( const float a ); idVecX & operator+=( const idVecX &a ); idVecX & operator-=( const idVecX &a ); friend idVecX operator*( const float a, const idVecX b ); bool Compare( const idVecX &a ) const; // exact compare, no epsilon bool Compare( const idVecX &a, const float epsilon ) const; // compare with epsilon bool operator==( const idVecX &a ) const; // exact compare, no epsilon bool operator!=( const idVecX &a ) const; // exact compare, no epsilon void SetSize( int size ); void ChangeSize( int size, bool makeZero = false ); int GetSize( void ) const { return size; } void SetData( int length, float *data ); void Zero( void ); void Zero( int length ); void Random( int seed, float l = 0.0f, float u = 1.0f ); void Random( int length, int seed, float l = 0.0f, float u = 1.0f ); void Negate( void ); void Clamp( float min, float max ); idVecX & SwapElements( int e1, int e2 ); float Length( void ) const; float LengthSqr( void ) const; idVecX Normalize( void ) const; float NormalizeSelf( void ); int GetDimension( void ) const; const noVec3 & SubVec3( int index ) const; noVec3 & SubVec3( int index ); const idVec6 & SubVec6( int index ) const; idVec6 & SubVec6( int index ); const float * ToFloatPtr( void ) const; float * ToFloatPtr( void ); const char * ToString( int precision = 2 ) const; private: int size; // size of the vector int alloced; // if -1 p points to data set with SetData float * p; // memory the vector is stored static float temp[VECX_MAX_TEMP+4]; // used to store intermediate results static float * tempPtr; // pointer to 16 byte aligned temporary memory static int tempIndex; // index into memory pool, wraps around private: void SetTempSize( int size ); }; ID_INLINE idVecX::idVecX( void ) { size = alloced = 0; p = NULL; } ID_INLINE idVecX::idVecX( int length ) { size = alloced = 0; p = NULL; SetSize( length ); } ID_INLINE idVecX::idVecX( int length, float *data ) { size = alloced = 0; p = NULL; SetData( length, data ); } ID_INLINE idVecX::~idVecX( void ) { // if not temp memory if ( p && ( p < idVecX::tempPtr || p >= idVecX::tempPtr + VECX_MAX_TEMP ) && alloced != -1 ) { Mem_Free16( p ); } } ID_INLINE float idVecX::operator[]( const int index ) const { assert( index >= 0 && index < size ); return p[index]; } ID_INLINE float &idVecX::operator[]( const int index ) { assert( index >= 0 && index < size ); return p[index]; } ID_INLINE idVecX idVecX::operator-() const { int i; idVecX m; m.SetTempSize( size ); for ( i = 0; i < size; i++ ) { m.p[i] = -p[i]; } return m; } ID_INLINE idVecX &idVecX::operator=( const idVecX &a ) { SetSize( a.size ); #ifdef VECX_SIMD SIMDProcessor->Copy16( p, a.p, a.size ); #else memcpy( p, a.p, a.size * sizeof( float ) ); #endif idVecX::tempIndex = 0; return *this; } ID_INLINE idVecX idVecX::operator+( const idVecX &a ) const { idVecX m; assert( size == a.size ); m.SetTempSize( size ); #ifdef VECX_SIMD SIMDProcessor->Add16( m.p, p, a.p, size ); #else int i; for ( i = 0; i < size; i++ ) { m.p[i] = p[i] + a.p[i]; } #endif return m; } ID_INLINE idVecX idVecX::operator-( const idVecX &a ) const { idVecX m; assert( size == a.size ); m.SetTempSize( size ); #ifdef VECX_SIMD SIMDProcessor->Sub16( m.p, p, a.p, size ); #else int i; for ( i = 0; i < size; i++ ) { m.p[i] = p[i] - a.p[i]; } #endif return m; } ID_INLINE idVecX &idVecX::operator+=( const idVecX &a ) { assert( size == a.size ); #ifdef VECX_SIMD SIMDProcessor->AddAssign16( p, a.p, size ); #else int i; for ( i = 0; i < size; i++ ) { p[i] += a.p[i]; } #endif idVecX::tempIndex = 0; return *this; } ID_INLINE idVecX &idVecX::operator-=( const idVecX &a ) { assert( size == a.size ); #ifdef VECX_SIMD SIMDProcessor->SubAssign16( p, a.p, size ); #else int i; for ( i = 0; i < size; i++ ) { p[i] -= a.p[i]; } #endif idVecX::tempIndex = 0; return *this; } ID_INLINE idVecX idVecX::operator*( const float a ) const { idVecX m; m.SetTempSize( size ); #ifdef VECX_SIMD SIMDProcessor->Mul16( m.p, p, a, size ); #else int i; for ( i = 0; i < size; i++ ) { m.p[i] = p[i] * a; } #endif return m; } ID_INLINE idVecX &idVecX::operator*=( const float a ) { #ifdef VECX_SIMD SIMDProcessor->MulAssign16( p, a, size ); #else int i; for ( i = 0; i < size; i++ ) { p[i] *= a; } #endif return *this; } ID_INLINE idVecX idVecX::operator/( const float a ) const { assert( a != 0.0f ); return (*this) * ( 1.0f / a ); } ID_INLINE idVecX &idVecX::operator/=( const float a ) { assert( a != 0.0f ); (*this) *= ( 1.0f / a ); return *this; } ID_INLINE idVecX operator*( const float a, const idVecX b ) { return b * a; } ID_INLINE float idVecX::operator*( const idVecX &a ) const { int i; float sum = 0.0f; assert( size == a.size ); for ( i = 0; i < size; i++ ) { sum += p[i] * a.p[i]; } return sum; } ID_INLINE bool idVecX::Compare( const idVecX &a ) const { int i; assert( size == a.size ); for ( i = 0; i < size; i++ ) { if ( p[i] != a.p[i] ) { return false; } } return true; } ID_INLINE bool idVecX::Compare( const idVecX &a, const float epsilon ) const { int i; assert( size == a.size ); for ( i = 0; i < size; i++ ) { if ( noMath::Fabs( p[i] - a.p[i] ) > epsilon ) { return false; } } return true; } ID_INLINE bool idVecX::operator==( const idVecX &a ) const { return Compare( a ); } ID_INLINE bool idVecX::operator!=( const idVecX &a ) const { return !Compare( a ); } ID_INLINE void idVecX::SetSize( int newSize ) { int alloc = ( newSize + 3 ) & ~3; if ( alloc > alloced && alloced != -1 ) { if ( p ) { Mem_Free16( p ); } p = (float *) Mem_Alloc16( alloc * sizeof( float ) ); alloced = alloc; } size = newSize; VECX_CLEAREND(); } ID_INLINE void idVecX::ChangeSize( int newSize, bool makeZero ) { int alloc = ( newSize + 3 ) & ~3; if ( alloc > alloced && alloced != -1 ) { float *oldVec = p; p = (float *) Mem_Alloc16( alloc * sizeof( float ) ); alloced = alloc; if ( oldVec ) { for ( int i = 0; i < size; i++ ) { p[i] = oldVec[i]; } Mem_Free16( oldVec ); } if ( makeZero ) { // zero any new elements for ( int i = size; i < newSize; i++ ) { p[i] = 0.0f; } } } size = newSize; VECX_CLEAREND(); } ID_INLINE void idVecX::SetTempSize( int newSize ) { size = newSize; alloced = ( newSize + 3 ) & ~3; assert( alloced < VECX_MAX_TEMP ); if ( idVecX::tempIndex + alloced > VECX_MAX_TEMP ) { idVecX::tempIndex = 0; } p = idVecX::tempPtr + idVecX::tempIndex; idVecX::tempIndex += alloced; VECX_CLEAREND(); } ID_INLINE void idVecX::SetData( int length, float *data ) { if ( p && ( p < idVecX::tempPtr || p >= idVecX::tempPtr + VECX_MAX_TEMP ) && alloced != -1 ) { Mem_Free16( p ); } assert( ( ( (int) data ) & 15 ) == 0 ); // data must be 16 byte aligned p = data; size = length; alloced = -1; VECX_CLEAREND(); } ID_INLINE void idVecX::Zero( void ) { #ifdef VECX_SIMD SIMDProcessor->Zero16( p, size ); #else memset( p, 0, size * sizeof( float ) ); #endif } ID_INLINE void idVecX::Zero( int length ) { SetSize( length ); #ifdef VECX_SIMD SIMDProcessor->Zero16( p, length ); #else memset( p, 0, size * sizeof( float ) ); #endif } ID_INLINE void idVecX::Random( int seed, float l, float u ) { int i; float c; idRandom rnd( seed ); c = u - l; for ( i = 0; i < size; i++ ) { p[i] = l + rnd.RandomFloat() * c; } } ID_INLINE void idVecX::Random( int length, int seed, float l, float u ) { int i; float c; idRandom rnd( seed ); SetSize( length ); c = u - l; for ( i = 0; i < size; i++ ) { p[i] = l + rnd.RandomFloat() * c; } } ID_INLINE void idVecX::Negate( void ) { #ifdef VECX_SIMD SIMDProcessor->Negate16( p, size ); #else int i; for ( i = 0; i < size; i++ ) { p[i] = -p[i]; } #endif } ID_INLINE void idVecX::Clamp( float min, float max ) { int i; for ( i = 0; i < size; i++ ) { if ( p[i] < min ) { p[i] = min; } else if ( p[i] > max ) { p[i] = max; } } } ID_INLINE idVecX &idVecX::SwapElements( int e1, int e2 ) { float tmp; tmp = p[e1]; p[e1] = p[e2]; p[e2] = tmp; return *this; } ID_INLINE float idVecX::Length( void ) const { int i; float sum = 0.0f; for ( i = 0; i < size; i++ ) { sum += p[i] * p[i]; } return noMath::Sqrt( sum ); } ID_INLINE float idVecX::LengthSqr( void ) const { int i; float sum = 0.0f; for ( i = 0; i < size; i++ ) { sum += p[i] * p[i]; } return sum; } ID_INLINE idVecX idVecX::Normalize( void ) const { int i; idVecX m; float invSqrt, sum = 0.0f; m.SetTempSize( size ); for ( i = 0; i < size; i++ ) { sum += p[i] * p[i]; } invSqrt = noMath::InvSqrt( sum ); for ( i = 0; i < size; i++ ) { m.p[i] = p[i] * invSqrt; } return m; } ID_INLINE float idVecX::NormalizeSelf( void ) { float invSqrt, sum = 0.0f; int i; for ( i = 0; i < size; i++ ) { sum += p[i] * p[i]; } invSqrt = noMath::InvSqrt( sum ); for ( i = 0; i < size; i++ ) { p[i] *= invSqrt; } return invSqrt * sum; } ID_INLINE int idVecX::GetDimension( void ) const { return size; } ID_INLINE noVec3 &idVecX::SubVec3( int index ) { assert( index >= 0 && index * 3 + 3 <= size ); return *reinterpret_cast<noVec3 *>(p + index * 3); } ID_INLINE const noVec3 &idVecX::SubVec3( int index ) const { assert( index >= 0 && index * 3 + 3 <= size ); return *reinterpret_cast<const noVec3 *>(p + index * 3); } ID_INLINE idVec6 &idVecX::SubVec6( int index ) { assert( index >= 0 && index * 6 + 6 <= size ); return *reinterpret_cast<idVec6 *>(p + index * 6); } ID_INLINE const idVec6 &idVecX::SubVec6( int index ) const { assert( index >= 0 && index * 6 + 6 <= size ); return *reinterpret_cast<const idVec6 *>(p + index * 6); } ID_INLINE const float *idVecX::ToFloatPtr( void ) const { return p; } ID_INLINE float *idVecX::ToFloatPtr( void ) { return p; } //=============================================================== // // idPolar3 // //=============================================================== class idPolar3 { public: float radius, theta, phi; idPolar3( void ); explicit idPolar3( const float radius, const float theta, const float phi ); void Set( const float radius, const float theta, const float phi ); float operator[]( const int index ) const; float & operator[]( const int index ); idPolar3 operator-() const; idPolar3 & operator=( const idPolar3 &a ); noVec3 ToVec3( void ) const; }; ID_INLINE idPolar3::idPolar3( void ) { } ID_INLINE idPolar3::idPolar3( const float radius, const float theta, const float phi ) { assert( radius > 0 ); this->radius = radius; this->theta = theta; this->phi = phi; } ID_INLINE void idPolar3::Set( const float radius, const float theta, const float phi ) { assert( radius > 0 ); this->radius = radius; this->theta = theta; this->phi = phi; } ID_INLINE float idPolar3::operator[]( const int index ) const { return ( &radius )[ index ]; } ID_INLINE float &idPolar3::operator[]( const int index ) { return ( &radius )[ index ]; } ID_INLINE idPolar3 idPolar3::operator-() const { return idPolar3( radius, -theta, -phi ); } ID_INLINE idPolar3 &idPolar3::operator=( const idPolar3 &a ) { radius = a.radius; theta = a.theta; phi = a.phi; return *this; } ID_INLINE noVec3 idPolar3::ToVec3( void ) const { float sp, cp, st, ct; noMath::SinCos( phi, sp, cp ); noMath::SinCos( theta, st, ct ); return noVec3( cp * radius * ct, cp * radius * st, radius * sp ); } /* =============================================================================== Old 3D vector macros, should no longer be used. =============================================================================== */ #define DotProduct( a, b) ((a)[0]*(b)[0]+(a)[1]*(b)[1]+(a)[2]*(b)[2]) #define VectorSubtract2( a, b, c ) ((c)[0]=(a)[0]-(b)[0],(c)[1]=(a)[1]-(b)[1],(c)[2]=(a)[2]-(b)[2]) #define VectorAdd( a, b, c ) ((c)[0]=(a)[0]+(b)[0],(c)[1]=(a)[1]+(b)[1],(c)[2]=(a)[2]+(b)[2]) #define VectorScale( v, s, o ) ((o)[0]=(v)[0]*(s),(o)[1]=(v)[1]*(s),(o)[2]=(v)[2]*(s)) #define VectorMA( v, s, b, o ) ((o)[0]=(v)[0]+(b)[0]*(s),(o)[1]=(v)[1]+(b)[1]*(s),(o)[2]=(v)[2]+(b)[2]*(s)) #define VectorCopy( a, b ) ((b)[0]=(a)[0],(b)[1]=(a)[1],(b)[2]=(a)[2]) #endif /* !__MATH_VECTOR_H__ */

Sangyong79@gmail.com

dce6d7e2509b3145458c5ad456b48d5f38a13d40

92e7a96c196e563b70f78db321680d830af80a53

/InstitutionalTrading/Client/CltServerMgr/ServerAddrForm.cpp

889be0cdbf6a9a93b00dbe21a608a3d47ce1df06

no_license

alexfordc/zq

513723341132dd2b01f5ca3debb567b2fd31c033

a0b05b7416fe68784e072da477e8c869097584e2

refs/heads/master

UTF-8

C++

cpp

#include "StdAfx.h" #include "ServerAddrForm.h"

w.z.y2006@163.com

81fb61c0989ba1e5f0cff1f71d3d229ae59497eb

4a61888ed98a9a042a00a26e76c010c2f73526e0

/lib/dg_cli.cc

51a5961a6420c5c41b3c78a87663a6c270de26bb

no_license

nani0119/UNP

b37484363a1d23021b53befe1db36e5c3b51fa8a

c26db4f64728a5a89a6cddcfbb6e08dae2da9e0e

refs/heads/master

UTF-8

C++

cc

#include "unp.h" namespace unp { void dg_cli(FILE *fp, int sockfd, const SA *pservaddr, socklen_t servlen) { int n; socklen_t len; char sendline[MAXLINE], recvline[MAXLINE + 1]; struct sockaddr* preply_addr; preply_addr =(struct sockaddr*) malloc(servlen); while (Fgets(sendline, MAXLINE, fp) != NULL) { if(Sendto(sockfd, sendline, strlen(sendline), 0, pservaddr, servlen) < 0) { err_quit("exit"); } len = servlen; n = Recvfrom(sockfd, recvline, MAXLINE, 0, preply_addr, &len); if(preply_addr->sa_family == AF_LOCAL) { if(memcmp(pservaddr, preply_addr, len) != 0) { printf("replay from %s (ignored)\n", Sock_ntop(preply_addr, len)); continue; } } else if(len != servlen || memcmp(pservaddr, preply_addr, len) != 0) { printf("replay from %s (ignored)\n", Sock_ntop(preply_addr, len)); continue; } recvline[n] = 0; /* null terminate */ Fputs(recvline, stdout); } // can not reach free(preply_addr); } }

zhaorj@neusoft.com

edb3e68003ce31df23926b19162cb23a72b0f1d7

2e765d9338314f35d15c1e1e00ae085c1eac37c6

/백준실/geometry/boj1358.cpp

59074c3e417f48539693c2bb9d2fe36d494a29c7

no_license

chanmin4/BOJ-open-code-list

497874a104174e89ffc24ce566810c4e4c991841

211a548caba25006bbced2441d97a1c42650d81c

refs/heads/main

UTF-8

C++

cpp

#include<iostream> #include<string> #include<algorithm> #include<vector> #include<queue> #include<stack> #include<cmath> #include<stdio.h> #include<cstring> #include<cstdio> #include<cstring> #include<set> #include<map> #include<list> #include<unordered_set> #include<time.h> #define fup(i,a,b,c) for(int i=a;i<=b;i+=c) using namespace std; typedef long long ll; typedef long double ld; typedef long long int lli; typedef pair<ll, ll>P; typedef pair<ld, ld>dP; ll MOD = 1e6; ll n, t, m, k; int max_level; ll w, h, x, y, p; ll ccw(ll x1, ll y1, ll x2, ll y2) { return x1 * y2 - x2 * y1; } bool checkin(ll p1, ll p2) { if (ccw(w, 0, p1 - x, p2 - y) >= 0 && ccw(w, 0, p1 - x, p2 - (y + h)) <= 0) { if (x <= p1 && p1 <= x + w)return true; else if (((pow(p1 - x, 2) + pow(p2 - (y + (h / 2) * 1ll), 2) <= pow((h / 2) * 1ll, 2)) && p1 <= x) || (pow(p1 - (x + w), 2) + pow(p2 - (y + (h / 2) * 1ll), 2) <= pow((h / 2) * 1ll, 2)) && x + w <= p1)return true; else return false; } else return false; } int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); cin >> w >> h >> x >> y >> p; int result = 0; for (int i = 0; i < p; i++) { ll a, b; cin >> a >> b; if (checkin(a, b))result++; } cout << result << endl; }

chanmin4@naver.com

c66dafda3bf4263ded9063e519f4256b03f25826

60b680c69898d0f1a7f982c5ac68095adfb56113

/Sem_2/Lab_3/Task 2/src/screen/GameScreen.cpp

f69fd6b84e09d8bc5ee9ee2dba774d633a2982ff

no_license

borgishmorg/bfu

ba2feb8c1179771c0cae7b0d1b76896b75be5003

426f41ae5b7f7e31491ba7aa5b8c3ae25505fefc

refs/heads/master

UTF-8

C++

cpp

#include "GameScreen.hpp" using BattleRoyale::GameScreen; GameScreen::GameScreen(Map & map): Screen(HEIGHT, WIDTH), mapElement_(map, 0, 0), playerElement_(PLAYER_ELEMENT_HPOS, PLAYER_ELEMENT_WPOS), messageElement_(MESSAGE_ELEMENT_HPOS, MESSAGE_ELEMENT_WPOS){ addElement(mapElement_); addElement(playerElement_); addElement(messageElement_); } GameScreen::~GameScreen(){}; void GameScreen::focusAtPlayer(std::shared_ptr<Player> player){ mapElement_.focusAtPlayer(player); playerElement_.focusAtPlayer(player); } void GameScreen::drawMessage(std::string message){ messageElement_.showMessage(message); draw(); } const unsigned int GameScreen::HEIGHT = 24; const unsigned int GameScreen::WIDTH = 80; const unsigned int GameScreen::MAP_ELEMENT_HPOS = 0; const unsigned int GameScreen::MAP_ELEMENT_WPOS = 0; const unsigned int GameScreen::PLAYER_ELEMENT_HPOS = 0; const unsigned int GameScreen::PLAYER_ELEMENT_WPOS = 24; const unsigned int GameScreen::MESSAGE_ELEMENT_HPOS = 12; const unsigned int GameScreen::MESSAGE_ELEMENT_WPOS = 24;

alexsemenov1610@gmail.com

1b24c31d5ee3bac78b60aaa805e1d51c3b8ab61a

6f7355a9cebf80857d12165f5159695c5aa2d6a5

/set_measurement_unit.h

ea047722c4c1fd90d7340ad0220ebbb6642e9cfd

no_license

fengzhimiwu/my_popwil

814e48059833860682373732fe6178b7fd5acddd

fcaa859d6d4356d458d2d7b77d99616634541a3f

refs/heads/master

UTF-8

C++

h

#ifndef SET_MEASUREMENT_UNIT_H #define SET_MEASUREMENT_UNIT_H #include <QDialog> #include <QTableWidget> namespace Ui { class set_measurement_unit; } class set_measurement_unit : public QDialog { Q_OBJECT public: explicit set_measurement_unit(QWidget *parent = 0); ~set_measurement_unit(); private: Ui::set_measurement_unit *ui; QTableWidget *change_unit; }; #endif // SET_MEASUREMENT_UNIT_H

591495195@qq.com

f07cbe87f92fe94281d2956c9b268ae7abaadcf1

8dc84558f0058d90dfc4955e905dab1b22d12c08

/chrome/browser/safe_browsing/incident_reporting/last_download_finder.cc

66d0c89897bd203a0b5f995d6d497cdf322253f5

permissive

meniossin/src

42a95cc6c4a9c71d43d62bc4311224ca1fd61e03

44f73f7e76119e5ab415d4593ac66485e65d700a

refs/heads/master

BSD-3-Clause

UTF-8

C++

cc

// Copyright 2014 The Chromium Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. #include "chrome/browser/safe_browsing/incident_reporting/last_download_finder.h" #include <stddef.h> #include <stdint.h> #include <algorithm> #include <functional> #include <utility> #include "base/bind.h" #include "base/macros.h" #include "base/memory/ptr_util.h" #include "base/strings/string_util.h" #include "base/strings/utf_string_conversions.h" #include "build/build_config.h" #include "chrome/browser/browser_process.h" #include "chrome/browser/chrome_notification_types.h" #include "chrome/browser/history/history_service_factory.h" #include "chrome/browser/profiles/profile_manager.h" #include "chrome/browser/safe_browsing/incident_reporting/incident_reporting_service.h" #include "chrome/common/pref_names.h" #include "chrome/common/safe_browsing/download_protection_util.h" #include "chrome/common/safe_browsing/file_type_policies.h" #include "components/history/core/browser/download_constants.h" #include "components/history/core/browser/history_service.h" #include "components/language/core/common/locale_util.h" #include "components/prefs/pref_service.h" #include "components/safe_browsing/proto/csd.pb.h" #include "content/public/browser/notification_details.h" #include "content/public/browser/notification_service.h" #include "content/public/browser/notification_source.h" #include "crypto/sha2.h" #include "extensions/buildflags/buildflags.h" namespace safe_browsing { namespace { // The following functions are overloaded for the two object types that // represent the metadata for a download: history::DownloadRow and // ClientIncidentReport_DownloadDetails. These are used by the template // functions that follow. // Returns the end time of a download represented by a DownloadRow. int64_t GetEndTime(const history::DownloadRow& row) { return row.end_time.ToJavaTime(); } // Returns the end time of a download represented by a DownloadDetails. int64_t GetEndTime(const ClientIncidentReport_DownloadDetails& details) { return details.download_time_msec(); } bool IsBinaryDownloadForCurrentOS( ClientDownloadRequest::DownloadType download_type) { // Whenever a new DownloadType is introduced, the following set of conditions // should also be updated so that the IsBinaryDownloadForCurrentOS() will // return true for that DownloadType as appropriate. static_assert(ClientDownloadRequest::DownloadType_MAX == ClientDownloadRequest::SAMPLED_UNSUPPORTED_FILE, "Update logic below"); // Platform-specific types are relevant only for their own platforms. #if defined(OS_MACOSX) if (download_type == ClientDownloadRequest::MAC_EXECUTABLE || download_type == ClientDownloadRequest::INVALID_MAC_ARCHIVE) return true; #elif defined(OS_ANDROID) if (download_type == ClientDownloadRequest::ANDROID_APK) return true; #endif // Extensions are supported where enabled. #if BUILDFLAG(ENABLE_EXTENSIONS) if (download_type == ClientDownloadRequest::CHROME_EXTENSION) return true; #endif if (download_type == ClientDownloadRequest::ZIPPED_EXECUTABLE || download_type == ClientDownloadRequest::ZIPPED_ARCHIVE || download_type == ClientDownloadRequest::INVALID_ZIP || download_type == ClientDownloadRequest::ARCHIVE || download_type == ClientDownloadRequest::PPAPI_SAVE_REQUEST) { return true; } // The default return value of download_protection_util::GetDownloadType is // ClientDownloadRequest::WIN_EXECUTABLE. return download_type == ClientDownloadRequest::WIN_EXECUTABLE; } // Returns true if a download represented by a DownloadRow is a binary file for // the current OS. bool IsBinaryDownload(const history::DownloadRow& row) { // TODO(grt): Peek into archives to see if they contain binaries; // http://crbug.com/386915. FileTypePolicies* policies = FileTypePolicies::GetInstance(); return (policies->IsCheckedBinaryFile(row.target_path) && !policies->IsArchiveFile(row.target_path) && IsBinaryDownloadForCurrentOS( download_protection_util::GetDownloadType(row.target_path))); } // Returns true if a download represented by a DownloadRow is not a binary file. bool IsNonBinaryDownload(const history::DownloadRow& row) { return !FileTypePolicies::GetInstance()->IsCheckedBinaryFile( row.target_path); } // Returns true if a download represented by a DownloadDetails is binary file // for the current OS. bool IsBinaryDownload(const ClientIncidentReport_DownloadDetails& details) { // DownloadDetails are only generated for binary downloads. return IsBinaryDownloadForCurrentOS(details.download().download_type()); } // Returns true if a download represented by a DownloadRow has been opened. bool HasBeenOpened(const history::DownloadRow& row) { return row.opened; } // Returns true if a download represented by a DownloadDetails has been opened. bool HasBeenOpened(const ClientIncidentReport_DownloadDetails& details) { return details.has_open_time_msec() && details.open_time_msec(); } // Returns true if |first| is more recent than |second|, preferring opened over // non-opened for downloads that completed at the same time (extraordinarily // unlikely). Only files that look like some kind of executable are considered. template <class A, class B> bool IsMoreInterestingBinaryThan(const A& first, const B& second) { if (GetEndTime(first) < GetEndTime(second) || !IsBinaryDownload(first)) return false; return (GetEndTime(first) != GetEndTime(second) || (HasBeenOpened(first) && !HasBeenOpened(second))); } // Returns true if |first| is more recent than |second|, preferring opened over // non-opened for downloads that completed at the same time (extraordinarily // unlikely). Only files that do not look like an executable are considered. bool IsMoreInterestingNonBinaryThan(const history::DownloadRow& first, const history::DownloadRow& second) { if (GetEndTime(first) < GetEndTime(second) || !IsNonBinaryDownload(first)) return false; return (GetEndTime(first) != GetEndTime(second) || (HasBeenOpened(first) && !HasBeenOpened(second))); } // Returns a pointer to the most interesting completed download in |downloads|. const history::DownloadRow* FindMostInteresting( const std::vector<history::DownloadRow>& downloads, bool is_binary) { const history::DownloadRow* most_recent_row = nullptr; for (const auto& row : downloads) { // Ignore incomplete downloads. if (row.state != history::DownloadState::COMPLETE) continue; if (!most_recent_row || (is_binary ? IsMoreInterestingBinaryThan(row, *most_recent_row) : IsMoreInterestingNonBinaryThan(row, *most_recent_row))) { most_recent_row = &row; } } return most_recent_row; } // Returns true if |candidate| is more interesting than whichever of |details| // or |best_row| is present. template <class D> bool IsMostInterestingBinary( const D& candidate, const ClientIncidentReport_DownloadDetails* details, const history::DownloadRow& best_row) { return details ? IsMoreInterestingBinaryThan(candidate, *details) : IsMoreInterestingBinaryThan(candidate, best_row); } // Populates the |details| protobuf with information pertaining to |download|. void PopulateDetailsFromRow(const history::DownloadRow& download, ClientIncidentReport_DownloadDetails* details) { ClientDownloadRequest* download_request = details->mutable_download(); download_request->set_url(download.url_chain.back().spec()); // digests is a required field, so force it to exist. // TODO(grt): Include digests in reports; http://crbug.com/389123. ignore_result(download_request->mutable_digests()); download_request->set_length(download.received_bytes); for (size_t i = 0; i < download.url_chain.size(); ++i) { const GURL& url = download.url_chain[i]; ClientDownloadRequest_Resource* resource = download_request->add_resources(); resource->set_url(url.spec()); if (i != download.url_chain.size() - 1) { // An intermediate redirect. resource->set_type(ClientDownloadRequest::DOWNLOAD_REDIRECT); } else { // The final download URL. resource->set_type(ClientDownloadRequest::DOWNLOAD_URL); if (!download.referrer_url.is_empty()) resource->set_referrer(download.referrer_url.spec()); } } download_request->set_file_basename( download.target_path.BaseName().AsUTF8Unsafe()); download_request->set_download_type( download_protection_util::GetDownloadType(download.target_path)); std::string pref_locale = g_browser_process->local_state()->GetString(prefs::kApplicationLocale); language::ConvertToActualUILocale(&pref_locale); download_request->set_locale(pref_locale); details->set_download_time_msec(download.end_time.ToJavaTime()); // Opened time is unknown for now, so use the download time if the file was // opened in Chrome. if (download.opened) details->set_open_time_msec(download.end_time.ToJavaTime()); } // Populates the |details| protobuf with information pertaining to the // (non-binary) |download|. void PopulateNonBinaryDetailsFromRow( const history::DownloadRow& download, ClientIncidentReport_NonBinaryDownloadDetails* details) { details->set_file_type( base::FilePath(FileTypePolicies::GetFileExtension(download.target_path)) .AsUTF8Unsafe()); details->set_length(download.received_bytes); if (download.url_chain.back().has_host()) details->set_host(download.url_chain.back().host()); details->set_url_spec_sha256( crypto::SHA256HashString(download.url_chain.back().spec())); } } // namespace LastDownloadFinder::~LastDownloadFinder() { } // static std::unique_ptr<LastDownloadFinder> LastDownloadFinder::Create( const DownloadDetailsGetter& download_details_getter, const LastDownloadCallback& callback) { std::unique_ptr<LastDownloadFinder> finder( base::WrapUnique(new LastDownloadFinder( download_details_getter, g_browser_process->profile_manager()->GetLoadedProfiles(), callback))); // Return NULL if there is no work to do. if (finder->profile_states_.empty()) return std::unique_ptr<LastDownloadFinder>(); return finder; } LastDownloadFinder::LastDownloadFinder() : history_service_observer_(this), weak_ptr_factory_(this) { } LastDownloadFinder::LastDownloadFinder( const DownloadDetailsGetter& download_details_getter, const std::vector<Profile*>& profiles, const LastDownloadCallback& callback) : download_details_getter_(download_details_getter), callback_(callback), history_service_observer_(this), weak_ptr_factory_(this) { // Observe profile lifecycle events so that the finder can begin or abandon // the search in profiles while it is running. notification_registrar_.Add(this, chrome::NOTIFICATION_PROFILE_ADDED, content::NotificationService::AllSources()); notification_registrar_.Add(this, chrome::NOTIFICATION_PROFILE_DESTROYED, content::NotificationService::AllSources()); // Begin the search for all given profiles. for (auto* profile : profiles) SearchInProfile(profile); } void LastDownloadFinder::SearchInProfile(Profile* profile) { // Do not look in OTR profiles or in profiles that do not participate in // safe browsing extended reporting. if (!IncidentReportingService::IsEnabledForProfile(profile)) return; // Exit early if already processing this profile. This could happen if, for // example, NOTIFICATION_PROFILE_ADDED arrives after construction while // waiting for OnHistoryServiceLoaded. if (profile_states_.count(profile)) return; // Initiate a metadata search. profile_states_[profile] = WAITING_FOR_METADATA; download_details_getter_.Run(profile, base::Bind(&LastDownloadFinder::OnMetadataQuery, weak_ptr_factory_.GetWeakPtr(), profile)); } void LastDownloadFinder::OnMetadataQuery( Profile* profile, std::unique_ptr<ClientIncidentReport_DownloadDetails> details) { auto iter = profile_states_.find(profile); // Early-exit if the search for this profile was abandoned. if (iter == profile_states_.end()) return; if (details) { if (IsMostInterestingBinary(*details, details_.get(), most_recent_binary_row_)) { details_ = std::move(details); most_recent_binary_row_.end_time = base::Time(); } iter->second = WAITING_FOR_NON_BINARY_HISTORY; } else { iter->second = WAITING_FOR_HISTORY; } // Initiate a history search history::HistoryService* history_service = HistoryServiceFactory::GetForProfile(profile, ServiceAccessType::IMPLICIT_ACCESS); // No history service is returned for profiles that do not save history. if (!history_service) { RemoveProfileAndReportIfDone(iter); return; } if (history_service->BackendLoaded()) { history_service->QueryDownloads( base::Bind(&LastDownloadFinder::OnDownloadQuery, weak_ptr_factory_.GetWeakPtr(), profile)); } else { // else wait until history is loaded. history_service_observer_.Add(history_service); } } void LastDownloadFinder::AbandonSearchInProfile(Profile* profile) { // |profile| may not be present in the set of profiles. auto iter = profile_states_.find(profile); if (iter != profile_states_.end()) RemoveProfileAndReportIfDone(iter); } void LastDownloadFinder::OnDownloadQuery( Profile* profile, std::unique_ptr<std::vector<history::DownloadRow>> downloads) { // Early-exit if the history search for this profile was abandoned. auto iter = profile_states_.find(profile); if (iter == profile_states_.end()) return; // Don't overwrite the download from metadata if it came from this profile. if (iter->second == WAITING_FOR_HISTORY) { // Find the most recent from this profile and use it if it's better than // anything else found so far. const history::DownloadRow* profile_best_binary = FindMostInteresting(*downloads, true); if (profile_best_binary && IsMostInterestingBinary(*profile_best_binary, details_.get(), most_recent_binary_row_)) { details_.reset(); most_recent_binary_row_ = *profile_best_binary; } } const history::DownloadRow* profile_best_non_binary = FindMostInteresting(*downloads, false); if (profile_best_non_binary && IsMoreInterestingNonBinaryThan(*profile_best_non_binary, most_recent_non_binary_row_)) { most_recent_non_binary_row_ = *profile_best_non_binary; } RemoveProfileAndReportIfDone(iter); } void LastDownloadFinder::RemoveProfileAndReportIfDone( std::map<Profile*, ProfileWaitState>::iterator iter) { DCHECK(iter != profile_states_.end()); profile_states_.erase(iter); // Finish processing if all results are in. if (profile_states_.empty()) ReportResults(); // Do not touch this LastDownloadFinder after reporting results. } void LastDownloadFinder::ReportResults() { DCHECK(profile_states_.empty()); std::unique_ptr<ClientIncidentReport_DownloadDetails> binary_details = nullptr; std::unique_ptr<ClientIncidentReport_NonBinaryDownloadDetails> non_binary_details = nullptr; if (details_) { binary_details.reset(new ClientIncidentReport_DownloadDetails(*details_)); } else if (!most_recent_binary_row_.end_time.is_null()) { binary_details.reset(new ClientIncidentReport_DownloadDetails()); PopulateDetailsFromRow(most_recent_binary_row_, binary_details.get()); } if (!most_recent_non_binary_row_.end_time.is_null()) { non_binary_details.reset( new ClientIncidentReport_NonBinaryDownloadDetails()); PopulateNonBinaryDetailsFromRow(most_recent_non_binary_row_, non_binary_details.get()); } callback_.Run(std::move(binary_details), std::move(non_binary_details)); // Do not touch this LastDownloadFinder after running the callback, since it // may have been deleted. } void LastDownloadFinder::Observe(int type, const content::NotificationSource& source, const content::NotificationDetails& details) { switch (type) { case chrome::NOTIFICATION_PROFILE_ADDED: SearchInProfile(content::Source<Profile>(source).ptr()); break; case chrome::NOTIFICATION_PROFILE_DESTROYED: AbandonSearchInProfile(content::Source<Profile>(source).ptr()); break; default: break; } } void LastDownloadFinder::OnHistoryServiceLoaded( history::HistoryService* history_service) { for (const auto& pair : profile_states_) { history::HistoryService* hs = HistoryServiceFactory::GetForProfileIfExists( pair.first, ServiceAccessType::EXPLICIT_ACCESS); if (hs == history_service) { // Start the query in the history service if the finder was waiting for // the service to load. if (pair.second == WAITING_FOR_HISTORY || pair.second == WAITING_FOR_NON_BINARY_HISTORY) { history_service->QueryDownloads( base::Bind(&LastDownloadFinder::OnDownloadQuery, weak_ptr_factory_.GetWeakPtr(), pair.first)); } return; } } } void LastDownloadFinder::HistoryServiceBeingDeleted( history::HistoryService* history_service) { history_service_observer_.Remove(history_service); } } // namespace safe_browsing

arnaud@geometry.ee

f9276e392fa53fed672c5d0f1ebc352bc8159c4b

600df3590cce1fe49b9a96e9ca5b5242884a2a70

/third_party/skia/src/effects/SkPaintImageFilter.cpp

0a0e4e92edf972b03c167acc8da5c43ed5f723a6

permissive

metux/chromium-suckless

efd087ba4f4070a6caac5bfbfb0f7a4e2f3c438a

72a05af97787001756bae2511b7985e61498c965

refs/heads/orig

BSD-3-Clause

UTF-8

C++

cpp

/* * Copyright 2016 Google Inc. * * Use of this source code is governed by a BSD-style license that can be * found in the LICENSE file. */ #include "SkPaintImageFilter.h" #include "SkCanvas.h" #include "SkReadBuffer.h" #include "SkSpecialImage.h" #include "SkSpecialSurface.h" #include "SkWriteBuffer.h" sk_sp<SkImageFilter> SkPaintImageFilter::Make(const SkPaint& paint, const CropRect* cropRect) { return sk_sp<SkImageFilter>(new SkPaintImageFilter(paint, cropRect)); } SkPaintImageFilter::SkPaintImageFilter(const SkPaint& paint, const CropRect* cropRect) : INHERITED(nullptr, 0, cropRect) , fPaint(paint) { } sk_sp<SkFlattenable> SkPaintImageFilter::CreateProc(SkReadBuffer& buffer) { SK_IMAGEFILTER_UNFLATTEN_COMMON(common, 0); SkPaint paint; buffer.readPaint(&paint); return SkPaintImageFilter::Make(paint, &common.cropRect()); } void SkPaintImageFilter::flatten(SkWriteBuffer& buffer) const { this->INHERITED::flatten(buffer); buffer.writePaint(fPaint); } sk_sp<SkSpecialImage> SkPaintImageFilter::onFilterImage(SkSpecialImage* source, const Context& ctx, SkIPoint* offset) const { SkIRect bounds; const SkIRect srcBounds = SkIRect::MakeWH(source->width(), source->height()); if (!this->applyCropRect(ctx, srcBounds, &bounds)) { return nullptr; } sk_sp<SkSpecialSurface> surf(source->makeSurface(ctx.outputProperties(), bounds.size())); if (!surf) { return nullptr; } SkCanvas* canvas = surf->getCanvas(); SkASSERT(canvas); canvas->clear(0x0); SkMatrix matrix(ctx.ctm()); matrix.postTranslate(SkIntToScalar(-bounds.left()), SkIntToScalar(-bounds.top())); SkRect rect = SkRect::MakeIWH(bounds.width(), bounds.height()); SkMatrix inverse; if (matrix.invert(&inverse)) { inverse.mapRect(&rect); } canvas->setMatrix(matrix); canvas->drawRect(rect, fPaint); offset->fX = bounds.fLeft; offset->fY = bounds.fTop; return surf->makeImageSnapshot(); } bool SkPaintImageFilter::affectsTransparentBlack() const { return true; } #ifndef SK_IGNORE_TO_STRING void SkPaintImageFilter::toString(SkString* str) const { str->appendf("SkPaintImageFilter: ("); fPaint.toString(str); str->append(")"); } #endif

enrico.weigelt@gr13.net

54f54820ba62c040f9cb8d161804e7a0c2a424b3

3dca132fe1adbb7316aee2030a6ae6fa0cc696aa

/hw1/src/DFA.cpp

8692dfb4fcb2dc6e9e3878501b11cbd919118777

permissive

leesk0502/compiler-homework

ebfe74d42f8d89cadc5da41615b388b1feae47f4

395cf718698f1bc24838d2a986655e7778d6546e

refs/heads/master

UTF-8

C++

cpp

#include "DFA.h" using namespace std; void DFA::buildNfaToDfa(vector<NfaData> table) { for(int i=0; i<table.size(); i++){ bool is_end = epsilonClosure(table, table[i], table[i].my_state); if( table[i].value == "e" && find( closure[table[i].my_state].begin(), closure[table[i].my_state].end(), table[i] ) == closure[table[i].my_state].end() ){ closure[table[i].my_state].push_back(table[i]); } } cout << endl << "<epsilon closure>" << endl; for(int i=0; i<state_size; i++){ cout << i << " -> {"; for(int j=0; j<closure[i].size(); j++){ cout << closure[i][j].next_state << ", "; } cout << "} " << endl; } closerToTable(table); } bool DFA::test(string test) { int next_num = dfa_state_nums[start_state]; for(int i=0; i<test.length(); i++){ int lang_index = lang.find(test[i]); if( lang_index == -1 ){ cout << "The charater " << test[i] << " is not allow" << endl; return false; } if( dfa_table[next_num][lang_index] == -1 ) return false; next_num = dfa_table[next_num][lang_index]; } // Check final state int idx = -1; for(int k=0; k<state_size; k++){ if( next_num == dfa_state_nums[k] ) idx = k; } for(int k=0; k<closure[idx].size(); k++){ if( closure[idx][k].next_state == final_state ){ return true; } } return false; } int DFA::findNfaData(vector<NfaData> table, int my_state, string value) { for(int i=0; i<table.size(); i++){ if( table[i].my_state == my_state && table[i].value == value ){ return i; } } return -1; } bool DFA::epsilonClosure(vector<NfaData> table, NfaData curState, int my_state) { if( curState.value != "e" || curState.next_state == final_state) return true; for(int i=0; i<table.size(); i++){ if( table[i].my_state == curState.next_state ){ if( table[i].value == "e" ){ bool is_end = epsilonClosure(table, table[i], my_state); if( is_end && find( closure[curState.my_state].begin(), closure[curState.my_state].end(), table[i] ) == closure[curState.my_state].end() ){ closure[my_state].push_back(table[i]); } } else{ return true; } } } return false; } void DFA::closerToTable(vector<NfaData> table) { int dfa_state_size = 0; // Only closure have more than one, can be dfa state for(int i=0, j=0; i<state_size; i++){ dfa_state_nums[i] = -1; if( closure[i].size() > 0 ){ dfa_state_size++; dfa_state_nums[i] = j++; } } //int dfa_table[dfa_state_size][lang.length()]; // initialize dfa_table with -1, -1 means empty set for(int i=0; i<dfa_state_size; i++){ vector<int> temp; for(int j=0; j<lang.length(); j++){ temp.push_back(-1); } dfa_table.push_back(temp); } for(int i=0; i<dfa_state_size; i++){ for(int j=0; j<lang.length(); j++){ string value(1, lang[j]); int idx = -1; for(int k=0; k<state_size; k++){ if( i == dfa_state_nums[k] ) idx = k; } if( idx == -1 ) continue; for(int k=0; k<closure[idx].size(); k++){ // If nfa state in closure have same with value, // dfa_table of i, j has next dfa state. int d = findNfaData(table, closure[idx][k].next_state, value); if( d != -1 ){ dfa_table[i][j] = dfa_state_nums[ table[d].next_state ]; } } } } cout << endl << "<DFA Table>" << endl; for(int i=0; i<dfa_state_size; i++){ cout << i << " | "; for(int j=0; j<lang.length(); j++){ cout << dfa_table[i][j] << " "; } cout << endl; } }

leesk0502@gmail.com

2c50b9660909344c0f3495d522ce9acfca846773

04b1abce39ba6c07bc3a9f57ce372041056a11c1

/myGame/myGame/Object.h

65b0354fe183a41020e9de3f1383c2b5f32bacd3

no_license

890popbox/collision_test

a6e56d7f6e3649ae2e6e6c39570a769590eb3e6f

ea37bdafb7306af854363624ff883d61a91eb76f

refs/heads/master

UTF-8

C++

h

#ifndef GAME_OBJECT #define GAME_OBJECT #include "../Engine/Graphics/Sprite.h" #include "../Engine/Physics/Rigidbody.h" #include "../Engine/Math/Rect.h" class Object { public: Object(); Object(Sprite _sprite); void setGravity(int x); void Update(); void Render(); void EndRender(); void straightenOb(); void flap(); //Accessors Sprite& GetSprite(); Rigidbody& GetRB(); private: Sprite sprite; Rigidbody rb; Rect boundingRect; float objectForce; float maxRot; float minRot; float straightSpot; }; #endif

890popbox@users.noreply.github.com

c56f1bd87e840a7d5fb8b931f2240d86049565db

10aea50c07ae8a95f8409762520e8e51b11cd2ed

/Applications/HexEditor/main.cpp

5f70b92b0bf8d578fa0e35469982120b124bf9e5

permissive

Tristochi/serenity

ad199c5ac4eecc1a59c853155a5cef8b5032a2fe

d9385d7d6252dbd0f5882a43d4a6b328fce0daf0

refs/heads/master

UTF-8

C++

cpp

#include "HexEditorWidget.h" #include <LibDraw/PNGLoader.h> #include <stdio.h> int main(int argc, char** argv) { if (pledge("stdio shared_buffer unix rpath cpath wpath fattr", nullptr) < 0) { perror("pledge"); return 1; } GApplication app(argc, argv); if (pledge("stdio shared_buffer rpath cpath wpath", nullptr) < 0) { perror("pledge"); return 1; } auto window = GWindow::construct(); window->set_title("Hex Editor"); window->set_rect(20, 200, 640, 400); auto hex_editor_widget = HexEditorWidget::construct(); window->set_main_widget(hex_editor_widget); window->on_close_request = [&]() -> GWindow::CloseRequestDecision { if (hex_editor_widget->request_close()) return GWindow::CloseRequestDecision::Close; return GWindow::CloseRequestDecision::StayOpen; }; window->show(); window->set_icon(load_png("/res/icons/16x16/app-hexeditor.png")); if (argc >= 2) hex_editor_widget->open_file(argv[1]); return app.exec(); }

awesomekling@gmail.com

468aaed7255022f01b1f200cbb7f72a6473c6748

651cbae33f34feeb9b45931910c1ba83cb48ba69

/SP3_Framework/App/Source/Scene2D/Bullets2D.cpp

be8f800c1cf9a5f5e22dab7bacce746263ce0c8f

no_license

beatsmoon/SP3

0fa605a1fa16794a0f6eeb8a8d20185021cb3507

2abc6c9d3609544dda9888569f8714ee67d3ffa4

refs/heads/master

C++

UTF-8

C++

cpp

#include "Bullets2D.h" #include <iostream> using namespace std; // Include GLEW #include <GL/glew.h> // Include ImageLoader #include "System\ImageLoader.h" // Include the Map2D as we will use it to check the player's movements and actions #include "Map2D.h" #include "Entity2DFactory.h" CBullets2D::CBullets2D() : cMap2D(NULL) , cSettings(NULL) , isActive(false) { transform = glm::mat4(1.0f); // make sure to initialize matrix to identity matrix first // Initialise vecIndex i32vec2Index = glm::i32vec2(0); // Initialise vecNumMicroSteps i32vec2NumMicroSteps = glm::i32vec2(0); // Initialise vec2UVCoordinate vec2UVCoordinate = glm::vec2(0.0f); } CBullets2D::~CBullets2D() { // We won't delete this since it was created elsewhere cMap2D = NULL; glDeleteVertexArrays(1, &VAO); glDeleteBuffers(1, &VBO); glDeleteBuffers(1, &EBO); } bool CBullets2D::Init(void) { // Get the handler to the CSettings instance cSettings = CSettings::GetInstance(); // Get the handler to the CMap2D instance cMap2D = CMap2D::GetInstance(); // set up vertex data (and buffer(s)) and configure vertex attributes float vertices[] = { // positions // texture coords (cSettings->TILE_WIDTH / 2.0f), (cSettings->TILE_HEIGHT / 2.0f), 0.0f, 1.0f, 1.0f, // top right (cSettings->TILE_WIDTH / 2.0f), -(cSettings->TILE_HEIGHT / 2.0f), 0.0f, 1.0f, 0.0f, // bottom right -(cSettings->TILE_WIDTH / 2.0f), -(cSettings->TILE_HEIGHT / 2.0f), 0.0f, 0.0f, 0.0f, // bottom left -(cSettings->TILE_WIDTH / 2.0f), (cSettings->TILE_HEIGHT / 2.0f), 0.0f, 0.0f, 1.0f // top left }; unsigned int indices[] = { 0, 1, 3, // first triangle 1, 2, 3 // second triangle }; glGenVertexArrays(1, &VAO); glGenBuffers(1, &VBO); glGenBuffers(1, &EBO); glBindVertexArray(VAO); glBindBuffer(GL_ARRAY_BUFFER, VBO); glBufferData(GL_ARRAY_BUFFER, sizeof(vertices), vertices, GL_STATIC_DRAW); glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, EBO); glBufferData(GL_ELEMENT_ARRAY_BUFFER, sizeof(indices), indices, GL_STATIC_DRAW); // position attribute glVertexAttribPointer(0, 3, GL_FLOAT, GL_FALSE, 5 * sizeof(float), (void*)0); glEnableVertexAttribArray(0); // texture coord attribute glVertexAttribPointer(1, 2, GL_FLOAT, GL_FALSE, 5 * sizeof(float), (void*)(3 * sizeof(float))); glEnableVertexAttribArray(1); // Load the player texture if (LoadTexture("Images/shooting_bullets.tga", iTextureID) == false) { std::cout << "Failed to load bullets sprite texture" << std::endl; return false; } isActive = true; } void CBullets2D::Update(const double dElapsedTime) { if (cAnimatedSprites.isFacingRight == true) { const int iOldIndex = i32vec2Index.x; // moving bullet right i32vec2NumMicroSteps.x += 3; if (i32vec2NumMicroSteps.x >= cSettings->NUM_STEPS_PER_TILE_XAXIS) { i32vec2NumMicroSteps.x = 0; i32vec2Index.x++; } // Constraint the Bullet's position within the screen boundary Constraint(RIGHT); // checking if bullet is near obsticle if (FindFeasiblePosition(iOldIndex, RIGHT) == true) { i32vec2Index.x = NULL; i32vec2Index.y = NULL; isActive = false; } } else { //cout << "VK_LEFT is called" << endl; const int iOldIndex = i32vec2Index.x; // moving player left i32vec2NumMicroSteps.x -= 3; if (i32vec2NumMicroSteps.x < 0) { i32vec2NumMicroSteps.x = (int)(cSettings->NUM_STEPS_PER_TILE_XAXIS) - 1; i32vec2Index.x--; } // Constraint the player's position within the screen boundary Constraint(LEFT); // FindFeasiblePosition if (FindFeasiblePosition(iOldIndex, LEFT) == true) { i32vec2Index.x = NULL; i32vec2Index.y = NULL; isActive = false; } } std::vector<CEntity2D*> it = CEntity2DFactory::GetInstance()->FindAllEntity(CEntity2D::TYPE::ENEMY); for (std::vector<CEntity2D*>::iterator itt = it.begin(); itt != it.end(); ++itt) { CEnemy2D* go = static_cast<CEnemy2D*>((CEntity2D*)*itt); if (i32vec2Index.x == go->Geti32vec2Index().x && i32vec2Index.y == go->Geti32vec2Index().y) { CPlayer2D* c = CPlayer2D::GetInstance(); int s = c->GetScore(); c->SetScore(s += 20); //isActive = 0; go->SetIsActive(0); } } vec2UVCoordinate.x = cSettings->ConvertIndexToUVSpace(cSettings->x, i32vec2Index.x, false, i32vec2NumMicroSteps.x * cSettings->MICRO_STEP_XAXIS); vec2UVCoordinate.y = cSettings->ConvertIndexToUVSpace(cSettings->y, i32vec2Index.y, false, i32vec2NumMicroSteps.y * cSettings->MICRO_STEP_YAXIS); } void CBullets2D::PreRender(void) { // bind textures on corresponding texture units glActiveTexture(GL_TEXTURE0); // Activate blending mode glEnable(GL_BLEND); glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA); // Activate the shader cShader->use(); } void CBullets2D::Render(void) { //cout << i32vec2Index.x << " " << i32vec2Index.y << endl; //cout << vec2UVCoordinate.x << endl; // get matrix's uniform location and set matrix if (isActive != false) { unsigned int transformLoc = glGetUniformLocation(cShader->ID, "transform"); glUniformMatrix4fv(transformLoc, 1, GL_FALSE, glm::value_ptr(transform)); transform = glm::mat4(1.0f); // make sure to initialize matrix to identity matrix first transform = glm::translate(transform, glm::vec3(vec2UVCoordinate.x, vec2UVCoordinate.y, 0.0f)); // Update the shaders with the latest transform glUniformMatrix4fv(transformLoc, 1, GL_FALSE, glm::value_ptr(transform)); // Get the texture to be rendered glBindTexture(GL_TEXTURE_2D, iTextureID); glBindVertexArray(VAO); // Render the tile glDrawElements(GL_TRIANGLES, 6, GL_UNSIGNED_INT, 0); glBindVertexArray(0); } //unsigned int transformLoc = glGetUniformLocation(cShader->ID, "transform"); //glUniformMatrix4fv(transformLoc, 1, GL_FALSE, glm::value_ptr(transform)); //transform = glm::mat4(1.0f); // make sure to initialize matrix to identity matrix first //transform = glm::translate(transform, glm::vec3(vec2UVCoordinate.x, // vec2UVCoordinate.y, // 0.0f)); //// Update the shaders with the latest transform //glUniformMatrix4fv(transformLoc, 1, GL_FALSE, glm::value_ptr(transform)); //// Get the texture to be rendered //glBindTexture(GL_TEXTURE_2D, iTextureID); //glBindVertexArray(VAO); //// Render the tile //glDrawElements(GL_TRIANGLES, 6, GL_UNSIGNED_INT, 0); //glBindVertexArray(0); } bool CBullets2D::LoadTexture(const char* filename, GLuint& iTextureID) { // Variables used in loading the texture int width, height, nrChannels; // texture 1 // --------- glGenTextures(1, &iTextureID); glBindTexture(GL_TEXTURE_2D, iTextureID); // set the texture wrapping parameters glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT); glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT); // set texture filtering parameters glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR); glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR); CImageLoader* cImageLoader = CImageLoader::GetInstance(); unsigned char* data = cImageLoader->Load(filename, width, height, nrChannels, true); if (data) { if (nrChannels == 3) glTexImage2D(GL_TEXTURE_2D, 0, GL_RGB, width, height, 0, GL_RGB, GL_UNSIGNED_BYTE, data); else if (nrChannels == 4) glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA, width, height, 0, GL_RGBA, GL_UNSIGNED_BYTE, data); // Generate mipmaps glGenerateMipmap(GL_TEXTURE_2D); } else { return false; } // Free up the memory of the file data read in free(data); return true; } void CBullets2D::Constraint(BULLETDIRECTION eDirection) { if (eDirection == LEFT) { if (i32vec2Index.x < 0) { i32vec2Index.x = 0; i32vec2NumMicroSteps.x = 0; i32vec2Index.x = NULL; i32vec2Index.y = NULL; isActive = false; } } else { if (i32vec2Index.x >= ((int)(cSettings->NUM_TILES_XAXIS)) - 1) { i32vec2Index.x = ((int)(cSettings->NUM_TILES_XAXIS)) - 1; i32vec2NumMicroSteps.x = 0; i32vec2Index.x = NULL; i32vec2Index.y = NULL; isActive = false; } } } void CBullets2D::InteractWithMap(void) { } bool CBullets2D::FindFeasiblePosition(const int iOldIndex, BULLETDIRECTION eDirection) { bool state = false; if (eDirection == LEFT) { // If the player within the screen boundary, then check further if ((i32vec2NumMicroSteps.x != 0) && (i32vec2Index.x >= 0)) { // Check if this new position is not accessible, then go back to old position if (cMap2D->GetMapInfo(i32vec2Index.y, i32vec2Index.x) == 1) // 1 is wall in map.csv if thrs are many diff kind of wall a range of number is more suitable { // Snap to the previous index i32vec2Index.x = iOldIndex; // Reset the i32vec2NumMicroSteps.x so that the player is aligned to the column i32vec2NumMicroSteps.x = 0; state = true; } // If the new position is between 2 rows, then check the other row as well if (i32vec2NumMicroSteps.y != 0) { // If the new position is not feasible, then go back to the old position if (cMap2D->GetMapInfo(i32vec2Index.y + 1, i32vec2Index.x) == 1) { // Snap to the previous index i32vec2Index.x = iOldIndex; // Reset the i32vec2NumMicroSteps.x so that the player is aligned to the column i32vec2NumMicroSteps.x = 0; state = true; } } } } else if (eDirection == RIGHT) { // If the player within the screen boundary, then check further if ((i32vec2NumMicroSteps.x != 0) && (i32vec2Index.x < ((int)cSettings->NUM_TILES_XAXIS) - 1)) { // Check if this new position is not accessible, then go back to old position if (cMap2D->GetMapInfo(i32vec2Index.y, i32vec2Index.x + 1) == 1) { // Snap to the previous index i32vec2Index.x = iOldIndex; // Reset the i32vec2NumMicroSteps.x so that the player is aligned to the column i32vec2NumMicroSteps.x = 0; state = true; } // If the new position is between 2 rows, then check the other row as well if (i32vec2NumMicroSteps.y != 0) { // If the new position is not feasible, then go back to the old position if (cMap2D->GetMapInfo(i32vec2Index.y + 1, i32vec2Index.x + 1) == 1) { // Snap to the previous index i32vec2Index.x = iOldIndex; // Reset the i32vec2NumMicroSteps.x so that the player is aligned to the column i32vec2NumMicroSteps.x = 0; state = true; } } } } return state; } bool CBullets2D::ShootBullets(BULLETDIRECTION edirection) { isActive = true; if (edirection == RIGHT) { const int iOldIndex = i32vec2Index.x; // moving bullet right i32vec2NumMicroSteps.x++; if (i32vec2NumMicroSteps.x >= cSettings->NUM_STEPS_PER_TILE_XAXIS) { i32vec2NumMicroSteps.x = 0; i32vec2Index.x++; } // Constraint the Bullet's position within the screen boundary Constraint(RIGHT); // checking if bullet is near obsticle if (FindFeasiblePosition(iOldIndex, RIGHT) == true) { isActive = false; } } else { //cout << "VK_LEFT is called" << endl; const int iOldIndex = i32vec2Index.x; // moving player left i32vec2NumMicroSteps.x--; if (i32vec2NumMicroSteps.x < 0) { i32vec2NumMicroSteps.x = (int)(cSettings->NUM_STEPS_PER_TILE_XAXIS) - 1; i32vec2Index.x--; } // Constraint the player's position within the screen boundary Constraint(LEFT); // FindFeasiblePosition if (FindFeasiblePosition(iOldIndex, RIGHT) == true) { isActive = false; } } return true; }

54053886+beatsmoon@users.noreply.github.com

c8116e8b2e9c51e845d09766118ea703a369a7b0

e39a0354db4013d2a8aec4a4565cfb5f6443ae8f

/UVa/UVa10935 - Throwing cards away I.cpp

0bb5baf19a150a0fb02ad482b886840bda97e377

no_license

YimingPan/UVa-Solution

8afd41673ff3aeebcedbfbf379247af5e2a6eca4

92862dcfc49baed97ea72f4467f12f8d588a9010

refs/heads/master

GB18030

C++

cpp

#include <cstdio> #include <queue> using namespace std; int main() { int n; //n表示总卡片数 while(scanf("%d",&n), n) { queue<int> q; //开始时队列必须为空，故每次重建一个 for(int i=1;i<=n;i++) q.push(i); printf("Discarded cards:"); for(int k=0;k<n-1;k++) //k表示丢弃的张数 { if(k == n-2) printf(" %d",q.front()); //输出格式校正 else printf(" %d,",q.front()); q.pop(); //丢弃第一张牌，第二章牌成为队首元素 q.push(q.front()); //第二张牌入队 q.pop(); } printf("\nRemaining card: %d\n",q.front()); } return 0; }

yimingp@andrew.cmu.edu

b53d9d04eaa562aaef6123d0b5276177fe7b6447

b4b1152994445bcc67d022f28b87f6e962d01f34

/lab2/Code/function.h

cc25ae48fc64d84e5c6a7fff8d54f3ddcac7ce23

no_license

rookielxy/compiler-2018-fall

45c13cb583ab526c30c99778ad25d32b8147b614

5f400baab81c29d9f87bf43b4873d8f2d9267a20

refs/heads/master

UTF-8

C++

h

#ifndef __FUNCTION__ #define __FUNCTION__ #include "type.h" #include "common.h" class Function { string name; Type ret; vector<Symbol> args; bool def; int line_no; public: Function() = default; Function(const Function &func) = default; ~Function() = default; Function& operator=(const Function &func) = default; Function(AstNode *funDec, const Type &type, bool def); string getName() const { return name; } bool isDef() const { return def; } bool operator==(const Function &func); int getLineNo() const { return line_no; } vector<Symbol> getArgs() const { return args; } vector<Type> getArgsType() const; string getArgsName() const; Type getRetType() const { return ret; } }; #endif

ryelovespython@gmail.com

4c1c4aac6be56c95836546f6f40ae7142da141ba

ca13b19679add6020a9b456bbd1b31bd58156f4f

/main.cc

72dccdb846528dfbe384852d43f2d6f326e19ebb

no_license

Lunderberg/lua-bindings

08f6527ce48b15315977c3ebfb3a0c732f1f86af

59de6723ccbab999724f097a6cdf020fdaacdc94

refs/heads/master

UTF-8

C++

cc

#include <iostream> #include <string> #include <tuple> #include "lua-bindings/LuaState.hh" int main(){ Lua::LuaState L; L.LoadSafeLibs(); L.LoadString("a = {'one', 'two', 'three'} " "for i,v in ipairs(a) do " " print(i,v) " "end "); L.LoadString("print(os.time())"); return 0; }

eldritch.cheese@gmail.com

b4e880a507dbc2b1383dd552f69458ed362325c0

dc25b23f8132469fd95cee14189672cebc06aa56

/vendor/mediatek/proprietary/hardware/audio/common/V2/include/AudioMTKVolumeInterface.h

4eb9cbe1b612587b3c2623f9a0f2c4074279e621

no_license

nofearnohappy/alps_mm

b407d3ab2ea9fa0a36d09333a2af480b42cfe65c

9907611f8c2298fe4a45767df91276ec3118dd27

refs/heads/master