blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 3 264 | content_id stringlengths 40 40 | detected_licenses listlengths 0 85 | license_type stringclasses 2
values | repo_name stringlengths 5 140 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringclasses 905
values | visit_date timestamp[us]date 2015-08-09 11:21:18 2023-09-06 10:45:07 | revision_date timestamp[us]date 1997-09-14 05:04:47 2023-09-17 19:19:19 | committer_date timestamp[us]date 1997-09-14 05:04:47 2023-09-06 06:22:19 | github_id int64 3.89k 681M ⌀ | star_events_count int64 0 209k | fork_events_count int64 0 110k | gha_license_id stringclasses 22
values | gha_event_created_at timestamp[us]date 2012-06-07 00:51:45 2023-09-14 21:58:39 ⌀ | gha_created_at timestamp[us]date 2008-03-27 23:40:48 2023-08-21 23:17:38 ⌀ | gha_language stringclasses 141
values | src_encoding stringclasses 34
values | language stringclasses 1
value | is_vendor bool 1
class | is_generated bool 2
classes | length_bytes int64 3 10.4M | extension stringclasses 115
values | content stringlengths 3 10.4M | authors listlengths 1 1 | author_id stringlengths 0 158 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
677f9dcebfe1cba248ee514e1f185a2f96d787eb | db3018e97021f323b47f2197a9f8fc15b0b02e4f | /demo/c++/c++ primer/has_ptr_v2.cpp | eae5cca446fca628b68bc7d3fc53d7fcd9e44fe4 | [] | no_license | dokey4444/busybox | a9c506c8c743c8260e0785247d8098dcf8250bff | f335e91abfef00776cdac9405498d254f6182cc6 | refs/heads/master | 2021-01-17T02:13:51.827287 | 2019-01-10T10:01:30 | 2019-01-10T10:01:30 | 81,063,978 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,114 | cpp | /*
// =====================================================================================
//
// Filename: has_ptr.cpp
//
// Description: 使用引用计数的方式实现智能指针，智能指针无需手动销毁
//
// Version: 1.0
// Created: 10/10/2012 10:10:45 AM
// Revision: none
// Compiler: g++
//
// Author: Elwin.Gao (elwin), elwin.gao4444@gmail.com
// Company:
//
// =====================================================================================
*/
#include <cstdlib>
#include <iostream>
/*
// =====================================================================================
// Class: U_Ptr
// Description:
// =====================================================================================
*/
class U_Ptr {
public:
// ==================== LIFECYCLE =======================================
U_Ptr(int *p) : ip(p), use(1) {} // constructor
~U_Ptr() { delete ip; }
private:
// ==================== DATA MEMBERS =======================================
friend class Has_Ptr; // 友元不需要提前声明，可以直接使用名字
int *ip;
size_t use;
}; // ----- end of class U_Ptr -----
/*
// =====================================================================================
// Class: Has_Ptr
// Description: 通过U_Ptr类的辅助，实现智能指针
// =====================================================================================
*/
class Has_Ptr {
public:
// ==================== LIFECYCLE =======================================
Has_Ptr(int *p, int i) : ptr(new U_Ptr(p)), val(i) {} // constructor
Has_Ptr(const Has_Ptr &orig) :
ptr(orig.ptr), val(orig.val) { ++ptr->use; }
~Has_Ptr() { if (--ptr->use == 0) delete ptr; }
// ==================== ACCESSORS =======================================
int *get_ptr() const { return ptr->ip; }
int get_int() const { return val; }
void set_ptr(int *p) { ptr->ip = p; }
void set_int(int i) { val = i; }
int get_ptr_val() const { return *ptr->ip; }
void set_ptr_val(int i) { *ptr->ip = i; }
size_t get_use() { return ptr->use; }; // 查看引用计数器
// ==================== OPERATORS =======================================
Has_Ptr& operator=(const Has_Ptr&);
private:
// ==================== DATA MEMBERS =======================================
U_Ptr *ptr;
int val;
}; // ----- end of class Has_Ptr -----
Has_Ptr& Has_Ptr::operator=(const Has_Ptr &rhs)
{
++rhs.ptr->use;
if (--ptr->use == 0) delete ptr; // 左值需要酌情释放
ptr = rhs.ptr;
val = rhs.val;
return *this;
} // ----- end of function operator= -----
/*
// === FUNCTION ======================================================================
// Name: main
// Description: test driver
// =====================================================================================
*/
int main(int argc, char *argv[])
{
int *p = new int(42);
Has_Ptr obj(p, 10); // obj自己的val为10，指针指向的空间为42
std::cout << obj.get_int() << ',' << obj.get_ptr_val() << ',' << obj.get_use() << std::endl;
std::cout << std::endl;
Has_Ptr obj2(obj); // obj2复制obj
std::cout << obj.get_int() << ',' << obj.get_ptr_val() << ',' << obj.get_use() << std::endl;
std::cout << obj2.get_int() << ',' << obj2.get_ptr_val() << ',' << obj2.get_use() << std::endl;
std::cout << std::endl;
Has_Ptr obj3 = obj; // obj3复制obj
std::cout << obj.get_int() << ',' << obj.get_ptr_val() << ',' << obj.get_use() << std::endl;
std::cout << obj2.get_int() << ',' << obj2.get_ptr_val() << ',' << obj2.get_use() << std::endl;
std::cout << obj3.get_int() << ',' << obj3.get_ptr_val() << ',' << obj3.get_use() << std::endl;
std::cout << std::endl;
/* 下面这段代码将导致p所指向的地址重复释放 */
Has_Ptr obj4(p, 4); // obj自己的val为10，指针指向的空间为42
std::cout << obj4.get_int() << ',' << obj4.get_ptr_val() << ',' << obj4.get_use() << std::endl;
std::cout << std::endl;
return EXIT_SUCCESS;
} // ---------- end of function main ----------
| [
"elwin.gao4444@gmail.com"
] | elwin.gao4444@gmail.com |
0684a4382ed05407cd35e2e22544a0ed202d0310 | 4151e90c729b043e530111ada1d9a50f4fe7da65 | /dialoghistogramequalization.cpp | ddcf0f553cd6d97a9c266683fc9b025f3af620c7 | [] | no_license | andrew-k-21-12/aioi3 | d7c5593fa711434b6a2e0c4a0fe10de88d780398 | 84491001171b19a586d59e97b30462e33e69566d | refs/heads/master | 2020-04-05T23:45:28.115055 | 2016-06-13T22:55:57 | 2016-06-13T22:55:57 | 61,093,089 | 0 | 0 | null | 2016-06-14T05:02:02 | 2016-06-14T05:02:02 | null | UTF-8 | C++ | false | false | 590 | cpp | #include "dialoghistogramequalization.h"
#include "ui_dialoghistogramequalization.h"
DialogHistogramEqualization::DialogHistogramEqualization(QWidget *parent) :
QDialog(parent),
ui(new Ui::DialogHistogramEqualization)
{
ui->setupUi(this);
}
DialogHistogramEqualization::~DialogHistogramEqualization()
{
delete ui;
}
int DialogHistogramEqualization::getEqualizationType()
{
if (ui->radioButton->isChecked())
return 1;
else if (ui->radioButton_2->isChecked())
return 2;
else if (ui->radioButton_3->isChecked())
return 3;
return 0;
}
| [
"kazark@list.ru"
] | kazark@list.ru |
62bd50b5608f7312ef06132b6b7cf6ea89c3c8b0 | 16da213ad5292094c1feb294996b298b269d39cb | /src/Tests/Calibration/CalibrationTest.h | 337d9127bccf9878c87e3ab2a5c4d59cd33b94af | [
"MIT"
] | permissive | ReneHerthel/ConveyorBelt | 05f6cfcf5cabd7107f67c8f23280cf1f1fb22a96 | 285ae6c0ad018bcf4a231e94221e9d4eb22f6f44 | refs/heads/master | 2021-01-23T03:37:46.620223 | 2017-06-29T08:22:42 | 2017-06-29T08:22:42 | 86,105,333 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 397 | h | //
// Created by Silt on 23.04.2017.
//
#ifndef SE2_CAL_TEST_H
#define SE2_CAL_TEST_H
#include "../TestFramework/TestCase.h"
#include "../TestFramework/TestFramework.h"
#include <iostream>
class CalibrationTest : public TestCase {
public:
CalibrationTest(int id, std::string brief): TestCase(id, brief){};
protected:
TEST(Calibrate);
TEST_CASE_METHODS
};
#endif //SE2_CAL_TEST_H
| [
"sebastian.brueckner@haw-hamburg.de"
] | sebastian.brueckner@haw-hamburg.de |
7a2b995ac19ed6bd2a154decb496ca9f9bf88908 | 22cbba11cad8b4af9b5dc240919468284a16cd77 | /EFNoc/EFNocDataStructures/CommunicationGraph.h | 628b1a7b8920e24a8d0ffc77d0a7bb707b284c60 | [] | no_license | YanivFais/EFNoC | c7348a15edd3dbbe2387765f50c6cc46acaa1e01 | 1af862b492e7c03c1414318f1c798a8cbf12781b | refs/heads/master | 2022-04-13T10:12:11.126511 | 2020-04-12T06:15:43 | 2020-04-12T06:15:43 | 254,613,249 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,005 | h | #pragma once
#include "EFNocGraph.h"
#include <ostream>
#include <string>
class CommunicationGraph : public EFNocGraph
{
public:
CommunicationGraph (void);
void SetReverseEdgesOffset(int reverseEdgeOffset);
// serialize and de-serialize
bool InitFromFiles (const char * commGraphFileName);
bool WriteToFiles (const char * commGraphFileName) const;
bool WriteOmnetNetwork(std::ostream& os, const std::string& name, const std::string& pkgName) const;
void WriteOmnetNetworkParams(int slots, const std::string& pkgName) const;
void SetName(const std::string& n) { name = n; }
const std::string& GetName() const { return name; }
void RenameVertices(const map<int,int>& v2mcsl);
void ComputeWireLength();
protected:
bool ReadCommunicationGraphFile (const char * commGraphFileName);
bool WriteCommunicationGraphFile (const char * commGraphFileName) const;
void computeAllNodesDiatances(int ** adjMatrix);
int ** allocateAdjancyMatrix();
int mReverseEdgeOffset;
std::string name;
};
| [
"YanivFais@users.noreply.github.com"
] | YanivFais@users.noreply.github.com |
629f28420b738be7612ba9f5683ddaf6c65ce447 | a480dcee2b8c2852fe10b545dd45053e918a689a | /fboss/agent/hw/sai/api/SaiAttribute.h | f7acdeb6ada4aba34f1c04db87c0af641a8b9445 | [
"BSD-3-Clause",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | phshaikh/fboss | c6951c3ed535cbbfc2b4851e77a798174746781f | 05e6ed1e9d62bf7db45a770886b1761e046c1722 | refs/heads/master | 2020-03-23T22:48:35.116337 | 2020-03-21T01:44:12 | 2020-03-21T02:04:20 | 142,198,903 | 1 | 0 | null | 2018-07-24T18:39:16 | 2018-07-24T18:39:15 | null | UTF-8 | C++ | false | false | 15,919 | h | /*
* Copyright (c) 2004-present, Facebook, Inc.
* 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. An additional grant
* of patent rights can be found in the PATENTS file in the same directory.
*
*/
#pragma once
#include "fboss/agent/hw/sai/api/AddressUtil.h"
#include "fboss/agent/hw/sai/api/Traits.h"
#include <folly/IPAddress.h>
#include <folly/MacAddress.h>
#include <folly/logging/xlog.h>
#include <boost/functional/hash.hpp>
#include <fmt/ranges.h>
#include <type_traits>
#include <utility>
#include <vector>
extern "C" {
#include <sai.h>
}
/*
* The SaiAttribute template class facilitates pleasant and safe interaction
* with the ubiquitous sai_attribute_t.
*
* Consider, as an example, interacting with port admin state and port speed.
* Suppose we would like to read, then set the admin state, and just read the
* speed.
* The C-style code will look like:
*
* sai_attribute_t state_attr;
* state_attr.id = SAI_PORT_ATTR_ADMIN_STATE;
* port_api->get_port_attribute(port_handle, 1, &state_attr);
* bool admin_state = state_attr.value.booldata;
* state_attr.value.booldata = true;
* port_api->set_port_attribute(port_handle, &state_attr);
* sai_attribute_t speed_attr;
* speed_attr.id = SAI_PORT_ATTR_SPEED;
* port_api->get_port_attribute(port_handle, 1, &speed_attr);
* uint32_t speed = speed_attr.value.u32;
*
* this has a few flaws:
* 1) The author must keep track of the return types associated with various
* attributes. e.g., does admin state come back as a bool or enum, what
* is the size of speed, etc..
* 2) It is possible to simply type the wrong union member and accidentally
* extract an invalid member.
* 3) There's a bit of boiler plate to "type"
*
* With this library, the interaction looks like this:
* // Defined once, ahead of time:
* using PortAttrAdminState = SaiAttribute<sai_port_attr_t,
* SAI_PORT_ATTR_ADMIN_STATE, bool>;
* using PortAttrSpeed = SaiAttribute<sai_port_attr_t,
* SAI_PORT_ATTR_SPEED, uint32_t>;
* // the actual code:
* PortAttrAdminState state_attr;
* auto admin_state = port_api.get_attribute(state_attr, port_handle);
* PortAttrAdminState state_attr2(true);
* port_api.set_attribute(state_attr2, port_handle);
* PortAttrSpeed speed_attr;
* auto speed = port_api.get_attribute(speed_attr, port_handle);
*
* This no longer requires knowing anything about the internals of the
* sai_attribute_t.value union, nor matching the types in the SAI spec
* against its fields.
*
* The above example is the "easy" case where the data is a primitive.
* Some of the union data types are structs, lists, or arrays. To model those
* with a similar style class, we keep track of separate ValueType and DataType.
* DataType represents the type of the underlying data inside the union, and
* ValueType represents the "nicer" wrapped type a user would interact with.
* For example, DataType = sai_mac_t, ValueType = folly::MacAddress.
* This simply makes the ctor and value() a bit more complicated:
* they need to fill out the ValueType from the DataType or vice-versa.
* For now, the ValueType may be copied into the SaiAttribute, but we could
* easily adopt a different ownership model.
*
* SaiAttribute depends on two categories of helper template functions: _extract
* and _fill.
*
* The _extract functions return a reference into the SAI union. They
* use SFINAE to compile only the proper function for a given DataType and
* ValueType. e.g., if DataType is uint16_t, the only one that survives
* instantiation is the specialization that accessess value.u16.
*
* The _fill functions are used when ValueType != DataType to fill out the
* contents of the union from the user-friendly type or vice-versa.
*/
namespace {
/*
* There are a few corner cases that make _extract a bit tricky:
* 1) some of the union data types are identical. For example, sai_ip4_t and
* sai_uint32_t are uint32_t. This makes specialization based just on the
* SAI data type for the attribute impossible in those cases. We handle
* this by using a different ValueType and a slightly more complicated set
* of conditions for enable_if.
* 2) sai_pointer_t is void *. This is currently only used by switch api
* for setting up callback functions, so we plan to provide a special direct
* interface for that, for now, rather than using this generic mechanism.
*/
#define DEFINE_extract(_type, _field) \
template <typename AttrT> \
typename std::enable_if< \
std::is_same<typename AttrT::ExtractSelectionType, _type>::value, \
typename AttrT::DataType>::type& \
_extract(sai_attribute_t& sai_attribute) { \
return sai_attribute.value._field; \
} \
template <typename AttrT> \
const typename std::enable_if< \
std::is_same<typename AttrT::ExtractSelectionType, _type>::value, \
typename AttrT::DataType>::type& \
_extract(const sai_attribute_t& sai_attribute) { \
return sai_attribute.value._field; \
}
using facebook::fboss::SaiObjectIdT;
DEFINE_extract(bool, booldata);
DEFINE_extract(char[32], chardata);
DEFINE_extract(sai_uint8_t, u8);
DEFINE_extract(sai_uint16_t, u16);
DEFINE_extract(sai_uint32_t, u32);
DEFINE_extract(sai_uint64_t, u64);
DEFINE_extract(sai_int8_t, s8);
DEFINE_extract(sai_int16_t, s16);
DEFINE_extract(sai_int32_t, s32);
DEFINE_extract(sai_int64_t, s64);
DEFINE_extract(folly::MacAddress, mac);
DEFINE_extract(folly::IPAddressV4, ip4);
DEFINE_extract(folly::IPAddressV6, ip6);
DEFINE_extract(folly::IPAddress, ipaddr);
DEFINE_extract(folly::CIDRNetwork, ipprefix);
DEFINE_extract(SaiObjectIdT, oid);
DEFINE_extract(std::vector<sai_object_id_t>, objlist);
DEFINE_extract(std::vector<sai_uint8_t>, u8list);
DEFINE_extract(std::vector<sai_uint16_t>, u16list);
DEFINE_extract(std::vector<sai_uint32_t>, u32list);
DEFINE_extract(std::vector<sai_int8_t>, s8list);
DEFINE_extract(std::vector<sai_int16_t>, s16list);
DEFINE_extract(std::vector<sai_int32_t>, s32list);
// TODO:
DEFINE_extract(sai_u32_range_t, u32range);
DEFINE_extract(sai_s32_range_t, s32range);
DEFINE_extract(sai_vlan_list_t, vlanlist);
DEFINE_extract(sai_qos_map_list_t, qosmap);
DEFINE_extract(sai_map_list_t, maplist);
DEFINE_extract(sai_acl_field_data_t, aclfield);
DEFINE_extract(sai_acl_action_data_t, aclaction);
DEFINE_extract(sai_acl_capability_t, aclcapability);
DEFINE_extract(sai_acl_resource_list_t, aclresource);
DEFINE_extract(sai_tlv_list_t, tlvlist);
DEFINE_extract(sai_segment_list_t, segmentlist);
DEFINE_extract(sai_ip_address_list_t, ipaddrlist);
template <typename SrcT, typename DstT>
typename std::enable_if<std::is_same<SrcT, DstT>::value>::type _fill(
const SrcT& src,
DstT& dst) {}
template <typename SrcT, typename DstT>
typename std::enable_if<
!std::is_same<SrcT, DstT>::value &&
std::is_convertible<SrcT, DstT>::value>::type
_fill(const SrcT& src, DstT& dst) {
dst = src;
}
void _fill(const folly::IPAddress& src, sai_ip_address_t& dst) {
dst = facebook::fboss::toSaiIpAddress(src);
}
void _fill(const sai_ip_address_t& src, folly::IPAddress& dst) {
dst = facebook::fboss::fromSaiIpAddress(src);
}
void _fill(const folly::IPAddressV4& src, sai_ip4_t& dst) {
dst = facebook::fboss::toSaiIpAddress(src).addr.ip4;
}
void _fill(const sai_ip4_t& src, folly::IPAddressV4& dst) {
dst = facebook::fboss::fromSaiIpAddress(src);
}
void _fill(const folly::MacAddress& src, sai_mac_t& dst) {
facebook::fboss::toSaiMacAddress(src, dst);
}
void _fill(const sai_mac_t& src, folly::MacAddress& dst) {
dst = facebook::fboss::fromSaiMacAddress(src);
}
template <typename SaiListT, typename T>
void _fill(std::vector<T>& src, SaiListT& dst) {
static_assert(
std::is_same<decltype(dst.list), T*>::value,
"pointer in sai list doesn't match vector type");
dst.count = src.size();
dst.list = src.data();
}
template <typename SaiListT, typename T>
void _fill(const SaiListT& src, std::vector<T>& dst) {
static_assert(
std::is_same<decltype(src.list), T*>::value,
"pointer in sai list doesn't match vector type");
dst.resize(src.count);
std::copy(src.list, src.list + src.count, std::begin(dst));
}
template <typename SrcT, typename DstT>
void _realloc(const SrcT& src, DstT& dst) {
XLOG(FATAL) << "Unexpected call to fully generic _realloc";
}
template <typename SaiListT, typename T>
void _realloc(const SaiListT& src, std::vector<T>& dst) {
static_assert(
std::is_same<decltype(src.list), T*>::value,
"pointer in sai list doesn't match vector type");
auto tmpAddr = dst.data();
dst.resize(src.count);
}
} // namespace
namespace facebook::fboss {
template <
typename AttrEnumT,
AttrEnumT AttrEnum,
typename DataT,
typename Enable = void>
class SaiAttribute;
template <typename AttrEnumT, AttrEnumT AttrEnum, typename DataT>
class SaiAttribute<
AttrEnumT,
AttrEnum,
DataT,
typename std::enable_if<!IsSaiTypeWrapper<DataT>::value>::type> {
public:
using DataType = typename DuplicateTypeFixer<DataT>::value;
using ValueType = DataType;
using ExtractSelectionType = DataT;
static constexpr AttrEnumT Id = AttrEnum;
SaiAttribute() {
saiAttr_.id = Id;
}
/* implicit */ SaiAttribute(const ValueType& value) : SaiAttribute() {
data() = value;
}
/* implicit */ SaiAttribute(ValueType&& value) : SaiAttribute() {
data() = std::move(value);
}
const ValueType& value() {
return data();
}
ValueType value() const {
return data();
}
sai_attribute_t* saiAttr() {
return &saiAttr_;
}
const sai_attribute_t* saiAttr() const {
return &saiAttr_;
}
// TODO(borisb): once we deprecate the old create() from SaiApi, we
// can delete this
std::vector<sai_attribute_t> saiAttrs() const {
return {saiAttr_};
}
void realloc() {
XLOG(FATAL) << "Unexpected realloc on SaiAttribute with primitive DataT";
}
bool operator==(const SaiAttribute& other) const {
return other.value() == value();
}
bool operator!=(const SaiAttribute& other) const {
return !(*this == other);
}
bool operator<(const SaiAttribute& other) const {
return value() < other.value();
}
private:
DataType& data() {
return _extract<SaiAttribute>(saiAttr_);
}
const DataType& data() const {
return _extract<SaiAttribute>(saiAttr_);
}
sai_attribute_t saiAttr_{};
};
template <typename AttrEnumT, AttrEnumT AttrEnum, typename DataT>
class SaiAttribute<
AttrEnumT,
AttrEnum,
DataT,
typename std::enable_if<IsSaiTypeWrapper<DataT>::value>::type> {
public:
using DataType = typename WrappedSaiType<DataT>::value;
using ValueType = DataT;
using ExtractSelectionType = DataT;
static constexpr AttrEnumT Id = AttrEnum;
SaiAttribute() {
saiAttr_.id = Id;
}
/* value_ may be (and in fact almost certainly is) some complicated
* heap stored type like std::vector, std::string, etc... For this
* reason, we need to implement a deep copying copy ctor and copy
* assignment operator, so that destruction of the implicit copy
* source doesn't invalidate the copy target.
*
* e.g.:
* std::vector<uint32_t> v;
* v.resize(10);
* FooAttribute a2;
* {
* FooAttribute a1(v);
* a2 = a1;
* }
* a2.value() // uh-oh
*/
SaiAttribute(const SaiAttribute& other) {
// NOTE: use copy assignment to implement copy ctor
*this = other;
}
SaiAttribute(SaiAttribute&& other) {
*this = std::move(other);
}
SaiAttribute& operator=(const SaiAttribute& other) {
saiAttr_.id = other.saiAttr_.id;
setValue(other.value());
return *this;
}
SaiAttribute& operator=(SaiAttribute&& other) {
saiAttr_.id = other.saiAttr_.id;
setValue(std::move(other).value());
return *this;
}
/*
* Constructors that take a value type. Important for cases where
* the value type must be initialized before a call to api.getAttribute()
* e.g.
* std::vector<uint32_t> v;
* v.resize(10);
* VecAttr a(v);
* api.getAttribute(a); // uses v as storage for sai get_attribute call
*/
/* implicit */ SaiAttribute(const ValueType& value) : SaiAttribute() {
setValue(value);
}
/* implicit */ SaiAttribute(ValueType&& value) : SaiAttribute() {
setValue(std::move(value));
}
const ValueType& value() {
_fill(data(), value_);
return value_;
}
ValueType value() const {
ValueType v;
_fill(data(), v);
return v;
}
/*
* Value based Attributes will often require caller allocation. For
* example, we need to allocate an array for "list" attributes.
* However, in some get cases, we need to make an initial get call
* with an unallocated input, then do the actual allocation based on
* what the Adapter puts in the sai_attribute_t. In those cases, the Api
* class will call realloc() to trigger that reallocation.
*/
void realloc() {
_realloc(data(), value_);
_fill(value_, data());
}
sai_attribute_t* saiAttr() {
return &saiAttr_;
}
const sai_attribute_t* saiAttr() const {
return &saiAttr_;
}
// TODO(borisb): once we deprecate the old create() from SaiApi, we
// can delete this
std::vector<sai_attribute_t> saiAttrs() const {
return {saiAttr_};
}
bool operator==(const SaiAttribute& other) const {
return other.value() == value();
}
bool operator!=(const SaiAttribute& other) const {
return !(*this == other);
}
bool operator<(const SaiAttribute& other) const {
return value() < other.value();
}
private:
void setValue(const ValueType& value) {
value_ = value;
_fill(value_, data());
}
void setValue(ValueType&& value) {
value_ = std::move(value);
_fill(value_, data());
}
DataType& data() {
return _extract<SaiAttribute>(saiAttr_);
}
const DataType& data() const {
return _extract<SaiAttribute>(saiAttr_);
}
sai_attribute_t saiAttr_{};
ValueType value_{};
};
// implement trait that detects SaiAttribute
template <typename AttrEnumT, AttrEnumT AttrEnum, typename DataT>
struct IsSaiAttribute<SaiAttribute<AttrEnumT, AttrEnum, DataT, void>>
: public std::true_type {};
template <typename AttrT>
struct AttributeName {
// N.B., we can't just use static_assert(false, msg) because the
// compiler will trip the assert at declaration if it doesn't depend on the
// type parameter
static_assert(
sizeof(AttrT) == -1,
"In order to format a SaiAttribute, you must specialize "
"AttributeName<AttrT>. Consider using the SAI_ATTRIBUTE_NAME "
"macro below if you are adding an attribute to a SaiApi.");
using value = void;
};
#define SAI_ATTRIBUTE_NAME(Obj, Attribute) \
template <> \
struct AttributeName<Sai##Obj##Traits::Attributes::Attribute> { \
static const inline std::string value = #Attribute; \
};
} // namespace facebook::fboss
namespace std {
template <typename AttrEnumT, AttrEnumT AttrEnum, typename DataT>
struct hash<facebook::fboss::SaiAttribute<AttrEnumT, AttrEnum, DataT, void>> {
size_t operator()(
const facebook::fboss::SaiAttribute<AttrEnumT, AttrEnum, DataT, void>&
attr) const {
size_t seed = 0;
boost::hash_combine(seed, attr.value());
return seed;
}
};
} // namespace std
| [
"facebook-github-bot@users.noreply.github.com"
] | facebook-github-bot@users.noreply.github.com |
2b261288364fd7c7b8bcf2602ae3d5d73e46d717 | 30bdd8ab897e056f0fb2f9937dcf2f608c1fd06a | /contest/1542577789.cpp | 8d8ecacc6d36896df9811223ea9d231de028b759 | [] | no_license | thegamer1907/Code_Analysis | 0a2bb97a9fb5faf01d983c223d9715eb419b7519 | 48079e399321b585efc8a2c6a84c25e2e7a22a61 | refs/heads/master | 2020-05-27T01:20:55.921937 | 2019-11-20T11:15:11 | 2019-11-20T11:15:11 | 188,403,594 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 4,464 | cpp | /*#include<cmath>
#include<cstdio>
#include<cstdlib>
using namespace std ;
#define For( i , _begin , _end ) \
for( int i = (_begin) , i##end = (_end) ; i <= (i##end) ; ++i )
#define Lop( i , _begin , _end ) \
for( int i = (_begin) , i##end = (_end) ; i >= (i##end) ; --i )
#define Rep( i , _begin , _add ) \
for( int i = (_begin) ; i ; i = (_add) )
#define FOR( i , _begin , _end ) \
for( register int i = (_begin) , i##end = (_end) ; i <= (i##end) ; ++i )
#define LOP( i , _begin , _end ) \
for( register int i = (_begin) , i##end = (_end) ; i >= (i##end) ; --i )
#define REP( i , _begin , _add ) \
for( register int i = (_begin) ; i ; i = (_add) )
template < typename type >
inline type max( const type& x , const type& y ) { return x > y ? x : y ; }
template < typename type >
inline type min( const type& x , const type& y ) { return x < y ? x : y ; }
template < typename type >
inline bool chkmax( type& x , const type& y ) {
return x >= y ? false : ( x = y , true ) ;
}
template < typename type >
inline bool chkmin( type& x , const type& y ) {
return x <= y ? false : ( x = y , true ) ;
}
template < typename type >
inline type scanf( type& in ) {
in = 0 ; char ch = getchar() ; type f = 1 ;
for( ;ch> '9'||ch< '0';ch = getchar() )if( ch == '-' )f = -1 ;
for( ;ch>='0'&&ch<='9';ch = getchar() )in = in * 10 + ch - '0' ;
return in *= f ;
}
int h ;
int m ;
int s ;
int t1 ;
int t2 ;
int cnt ;
int bel[30] ;
double at[3] ;
inline void error() {
puts( "NO" ) ; exit( 0 ) ;
}
inline int get( int x ) {
if( x > 12 )x -= 12 ;
if( !x )x = 12 ;
return x ;
}
inline int chk( int x ) {
if( x == 12 )x = 0 ;
FOR( i , 0 , 2 ) if( at[i] - x > 0.0 && at[i] - x < 1.0 )
return 1 ;
FOR( i , 0 , 2 ) if( at[i] - x == 0.0 )
return -1 ;
return 0 ;
}
int main() {
scanf( "%d%d%d%d%d" , &h , &m , &s , &t1 , &t2 ) ;
at[0] = 0.5 * ( m + s != 0 ) + h ;
at[1] = m / 5.0 ;
at[2] = s / 5.0 ;
if( at[0] - 12.0 > 0.0 )at[0] -= 12.0 ;
int start = 0 ;
FOR( i , 1 , 12 ) if( chk( i ) == 1 )
{ start = get( i + 1 ) ; break ; }
int begin = start ;
do {
++cnt ;
while( !chk( start ) )bel[start] = cnt , start = get( start + 1 ) ;
if( chk( start ) != -1 )bel[start] = cnt ;
start = get( start + 1 ) ;
} while( begin != start ) ;
puts( bel[t1] == bel[t2] ? "YES" : "NO" ) ;
return 0 ;
}*/
#include<cstdio>
#define For( i , _begin , _end ) \
for( int i = (_begin) , i##end = (_end) ; i <= (i##end) ; ++i )
#define Lop( i , _begin , _end ) \
for( int i = (_begin) , i##end = (_end) ; i >= (i##end) ; --i )
#define Rep( i , _begin , _add ) \
for( int i = (_begin) ; i ; i = (_add) )
#define FOR( i , _begin , _end ) \
for( register int i = (_begin) , i##end = (_end) ; i <= (i##end) ; ++i )
#define LOP( i , _begin , _end ) \
for( register int i = (_begin) , i##end = (_end) ; i >= (i##end) ; --i )
#define REP( i , _begin , _add ) \
for( register int i = (_begin) ; i ; i = (_add) )
template < typename type >
inline type max( const type& x , const type& y ) { return x > y ? x : y ; }
template < typename type >
inline type min( const type& x , const type& y ) { return x < y ? x : y ; }
template < typename type >
inline bool chkmax( type& x , const type& y ) {
return x >= y ? false : ( x = y , true ) ;
}
template < typename type >
inline bool chkmin( type& x , const type& y ) {
return x <= y ? false : ( x = y , true ) ;
}
template < typename type >
inline type scanf( type& in ) {
in = 0 ; char ch = getchar() ; type f = 1 ;
for( ;ch> '9'||ch< '0';ch = getchar() )if( ch == '-' )f = -1 ;
for( ;ch>='0'&&ch<='9';ch = getchar() )in = in * 10 + ch - '0' ;
return in *= f ;
}
static const int maxn = 1e5 + 19 ;
int n ;
int k ;
int full ;
int ai[maxn][5] ;
int bi[maxn] ;
bool V[maxn] ;
inline bool chk() {
For( i , 1 , n )
FOR( j , 0 , full )
if( V[j] && ( ( bi[i] | j ) == full ) )return true ;
return false ;
}
int main() {
scanf( n ) ;scanf( k ) ;
For( i , 1 , n ) FOR( j , 1 , k )
bi[i] |= !scanf( ai[i][j] ) << j - 1 ;
V[0] = true ;
FOR( i , 1 , n ) V[ bi[i] ] = true ;
full = ( 1 << k ) - 1 ;
if( chk() )puts( "YES" ) ;
else puts( "NO" ) ;
return 0 ;
} | [
"harshitagar1907@gmail.com"
] | harshitagar1907@gmail.com |
1ddefef48305b7aefabf77330691a96cc407fd2b | 2e66f52d1d00907b78be6991c53c2baaedf7bec0 | /ZombieGame/Gun.h | c8e3f86c1ca0fca33b3055757deee0de8685eaf8 | [] | no_license | royel21/RCWorks | 4f4156edd4125688a5ce3287bcaf3f9cb4cfa43a | bd62227f1e9f0a5684b5e1734b8af4872ee4bcb8 | refs/heads/master | 2020-06-29T02:17:47.727937 | 2019-08-05T03:40:53 | 2019-08-05T03:40:53 | 200,409,025 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 929 | h | #pragma once
#include <PlutusEngine/all.h>
#include <string>
#include <vector>
#include <glm.hpp>
#include "PLayer.h"
#include "Bullet.h"
class Gun
{
private:
std::string _gunName;
PlutusEngine::GLTexture _texture;
glm::vec2 _position;
int _width, _height;
int _fireRate;
float _spread; // Accuracy
float _bulletSpeed;
int _bulletDamage;
int _bulletForShot; // How many bullets are fire at a time
float _frameCount;
public:
Gun(
std::string gunName,
const glm::vec2 position,
int fireRate,
int bulletsPerShot,
int bulletDamage,
float spread,
float bulletSpeed,
std::string imgName
);
~Gun();
void draw(PlutusEngine::SpriteBatch& spbatch);
void update(
bool isMDown,
const glm::vec2& position,
const glm::vec2& direction,
std::vector<Bullet>& bullets,
float deltaTime
);
private:
void fire(const glm::vec2& position, const glm::vec2& direction, std::vector<Bullet>& bullets);
};
| [
"royelconsoro@hotmail.com"
] | royelconsoro@hotmail.com |
cf5d5188a4e49c8946c0e61d83818e1ffe2cda1c | 162b9cb953038b59c9c39bc1c57894014f7532ca | /src/state.hpp | e6520b883d05657026994049a4482358efd7dd81 | [
"MIT"
] | permissive | guidanoli/hangman | 533ecd5f8d1cb46b88de20c309249a555f69a6e2 | 4b41aa88fea613e04527783813a1bb362508b50d | refs/heads/master | 2022-11-18T01:31:26.400380 | 2020-07-21T17:46:55 | 2020-07-21T17:46:55 | 281,395,646 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 561 | hpp | #ifndef HANGMAN_STATE_H
#define HANGMAN_STATE_H
#include <string>
#include <set>
namespace hangman
{
enum class GuessResult
{
CORRECT,
INCORRECT,
DUPLICATE
};
class State
{
private:
std::string m_word;
std::set<char> m_correct_guesses;
std::set<char> m_incorrect_guesses;
public:
State(std::string word);
std::set<char> const& getCorrectGuesses() const;
std::set<char> const& getIncorrectGuesses() const;
std::string getGuessedWord(char unknown = '_') const;
bool guessedWord() const;
GuessResult guess(char c);
};
}
#endif | [
"guidanoli@hotmail.com"
] | guidanoli@hotmail.com |
ed04ff2c22f9e2d0f6f11288596f9b2d4441dea0 | aaa134f8715fe8f1c34bdc81e79b9a9af049af45 | /Effluvium_UE4/Source/Effluvium_UE4/Effluvium_UE4Character.cpp | 0764d20c83875d1bd4cc8a6a5afd96130db84c77 | [
"MIT"
] | permissive | robertjdoig/effluvium | 5752f824836b8ad5ea913fadb3b7f9ad272b6a95 | 16244072a114c2c394fde329490f05493ade1d37 | refs/heads/master | 2021-01-13T01:18:07.744616 | 2017-05-05T09:56:23 | 2017-05-05T09:56:23 | 81,444,623 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 10,917 | cpp | // Copyright 1998-2016 Epic Games, Inc. All Rights Reserved.
#include "Effluvium_UE4.h"
#include "Effluvium_UE4Character.h"
#include "Effluvium_UE4Projectile.h"
#include "Animation/AnimInstance.h"
#include "GameFramework/InputSettings.h"
#include "Kismet/HeadMountedDisplayFunctionLibrary.h"
#include "MotionControllerComponent.h"
DEFINE_LOG_CATEGORY_STATIC(LogFPChar, Warning, All);
//////////////////////////////////////////////////////////////////////////
// AEffluvium_UE4Character
AEffluvium_UE4Character::AEffluvium_UE4Character()
{
// Set size for collision capsule
GetCapsuleComponent()->InitCapsuleSize(55.f, 96.0f);
// set our turn rates for input
BaseTurnRate = 45.f;
BaseLookUpRate = 45.f;
// Create a CameraComponent
FirstPersonCameraComponent = CreateDefaultSubobject<UCameraComponent>(TEXT("FirstPersonCamera"));
FirstPersonCameraComponent->SetupAttachment(GetCapsuleComponent());
FirstPersonCameraComponent->RelativeLocation = FVector(-39.56f, 1.75f, 64.f); // Position the camera
FirstPersonCameraComponent->bUsePawnControlRotation = true;
// Create a mesh component that will be used when being viewed from a '1st person' view (when controlling this pawn)
Mesh1P = CreateDefaultSubobject<USkeletalMeshComponent>(TEXT("CharacterMesh1P"));
Mesh1P->SetOnlyOwnerSee(true);
Mesh1P->SetupAttachment(FirstPersonCameraComponent);
Mesh1P->bCastDynamicShadow = false;
Mesh1P->CastShadow = false;
Mesh1P->RelativeRotation = FRotator(1.9f, -19.19f, 5.2f);
Mesh1P->RelativeLocation = FVector(-0.5f, -4.4f, -155.7f);
// Create a gun mesh component
FP_Gun = CreateDefaultSubobject<USkeletalMeshComponent>(TEXT("FP_Gun"));
FP_Gun->SetOnlyOwnerSee(true); // only the owning player will see this mesh
FP_Gun->bCastDynamicShadow = false;
FP_Gun->CastShadow = false;
// FP_Gun->SetupAttachment(Mesh1P, TEXT("GripPoint"));
FP_Gun->SetupAttachment(RootComponent);
FP_MuzzleLocation = CreateDefaultSubobject<USceneComponent>(TEXT("MuzzleLocation"));
FP_MuzzleLocation->SetupAttachment(FP_Gun);
FP_MuzzleLocation->SetRelativeLocation(FVector(0.2f, 48.4f, -10.6f));
// Default offset from the character location for projectiles to spawn
GunOffset = FVector(100.0f, 0.0f, 10.0f);
// Note: The ProjectileClass and the skeletal mesh/anim blueprints for Mesh1P, FP_Gun, and VR_Gun
// are set in the derived blueprint asset named MyCharacter to avoid direct content references in C++.
// Create VR Controllers.
R_MotionController = CreateDefaultSubobject<UMotionControllerComponent>(TEXT("R_MotionController"));
R_MotionController->Hand = EControllerHand::Right;
R_MotionController->SetupAttachment(RootComponent);
L_MotionController = CreateDefaultSubobject<UMotionControllerComponent>(TEXT("L_MotionController"));
L_MotionController->SetupAttachment(RootComponent);
// Create a gun and attach it to the right-hand VR controller.
// Create a gun mesh component
VR_Gun = CreateDefaultSubobject<USkeletalMeshComponent>(TEXT("VR_Gun"));
VR_Gun->SetOnlyOwnerSee(true); // only the owning player will see this mesh
VR_Gun->bCastDynamicShadow = false;
VR_Gun->CastShadow = false;
VR_Gun->SetupAttachment(R_MotionController);
VR_Gun->SetRelativeRotation(FRotator(0.0f, -90.0f, 0.0f));
VR_MuzzleLocation = CreateDefaultSubobject<USceneComponent>(TEXT("VR_MuzzleLocation"));
VR_MuzzleLocation->SetupAttachment(VR_Gun);
VR_MuzzleLocation->SetRelativeLocation(FVector(0.000004, 53.999992, 10.000000));
VR_MuzzleLocation->SetRelativeRotation(FRotator(0.0f, 90.0f, 0.0f)); // Counteract the rotation of the VR gun model.
// Uncomment the following line to turn motion controllers on by default:
//bUsingMotionControllers = true;
}
void AEffluvium_UE4Character::BeginPlay()
{
// Call the base class
Super::BeginPlay();
//Attach gun mesh component to Skeleton, doing it here because the skeleton is not yet created in the constructor
FP_Gun->AttachToComponent(Mesh1P, FAttachmentTransformRules(EAttachmentRule::SnapToTarget, true), TEXT("GripPoint"));
// Show or hide the two versions of the gun based on whether or not we're using motion controllers.
if (bUsingMotionControllers)
{
VR_Gun->SetHiddenInGame(false, true);
Mesh1P->SetHiddenInGame(true, true);
}
else
{
VR_Gun->SetHiddenInGame(true, true);
Mesh1P->SetHiddenInGame(false, true);
}
}
//////////////////////////////////////////////////////////////////////////
// Input
void AEffluvium_UE4Character::SetupPlayerInputComponent(class UInputComponent* PlayerInputComponent)
{
// set up gameplay key bindings
check(PlayerInputComponent);
PlayerInputComponent->BindAction("Jump", IE_Pressed, this, &ACharacter::Jump);
PlayerInputComponent->BindAction("Jump", IE_Released, this, &ACharacter::StopJumping);
//InputComponent->BindTouch(EInputEvent::IE_Pressed, this, &AEffluvium_UE4Character::TouchStarted);
if (EnableTouchscreenMovement(PlayerInputComponent) == false)
{
PlayerInputComponent->BindAction("Fire", IE_Pressed, this, &AEffluvium_UE4Character::OnFire);
}
PlayerInputComponent->BindAction("ResetVR", IE_Pressed, this, &AEffluvium_UE4Character::OnResetVR);
PlayerInputComponent->BindAxis("MoveForward", this, &AEffluvium_UE4Character::MoveForward);
PlayerInputComponent->BindAxis("MoveRight", this, &AEffluvium_UE4Character::MoveRight);
// We have 2 versions of the rotation bindings to handle different kinds of devices differently
// "turn" handles devices that provide an absolute delta, such as a mouse.
// "turnrate" is for devices that we choose to treat as a rate of change, such as an analog joystick
PlayerInputComponent->BindAxis("Turn", this, &APawn::AddControllerYawInput);
PlayerInputComponent->BindAxis("TurnRate", this, &AEffluvium_UE4Character::TurnAtRate);
PlayerInputComponent->BindAxis("LookUp", this, &APawn::AddControllerPitchInput);
PlayerInputComponent->BindAxis("LookUpRate", this, &AEffluvium_UE4Character::LookUpAtRate);
}
void AEffluvium_UE4Character::OnFire()
{
// try and fire a projectile
if (ProjectileClass != NULL)
{
UWorld* const World = GetWorld();
if (World != NULL)
{
if (bUsingMotionControllers)
{
const FRotator SpawnRotation = VR_MuzzleLocation->GetComponentRotation();
const FVector SpawnLocation = VR_MuzzleLocation->GetComponentLocation();
World->SpawnActor<AEffluvium_UE4Projectile>(ProjectileClass, SpawnLocation, SpawnRotation);
}
else
{
const FRotator SpawnRotation = GetControlRotation();
// MuzzleOffset is in camera space, so transform it to world space before offsetting from the character location to find the final muzzle position
const FVector SpawnLocation = ((FP_MuzzleLocation != nullptr) ? FP_MuzzleLocation->GetComponentLocation() : GetActorLocation()) + SpawnRotation.RotateVector(GunOffset);
//Set Spawn Collision Handling Override
FActorSpawnParameters ActorSpawnParams;
ActorSpawnParams.SpawnCollisionHandlingOverride = ESpawnActorCollisionHandlingMethod::AdjustIfPossibleButDontSpawnIfColliding;
// spawn the projectile at the muzzle
World->SpawnActor<AEffluvium_UE4Projectile>(ProjectileClass, SpawnLocation, SpawnRotation, ActorSpawnParams);
}
}
}
// try and play the sound if specified
if (FireSound != NULL)
{
UGameplayStatics::PlaySoundAtLocation(this, FireSound, GetActorLocation());
}
// try and play a firing animation if specified
if (FireAnimation != NULL)
{
// Get the animation object for the arms mesh
UAnimInstance* AnimInstance = Mesh1P->GetAnimInstance();
if (AnimInstance != NULL)
{
AnimInstance->Montage_Play(FireAnimation, 1.f);
}
}
}
void AEffluvium_UE4Character::OnResetVR()
{
UHeadMountedDisplayFunctionLibrary::ResetOrientationAndPosition();
}
void AEffluvium_UE4Character::BeginTouch(const ETouchIndex::Type FingerIndex, const FVector Location)
{
if (TouchItem.bIsPressed == true)
{
return;
}
TouchItem.bIsPressed = true;
TouchItem.FingerIndex = FingerIndex;
TouchItem.Location = Location;
TouchItem.bMoved = false;
}
void AEffluvium_UE4Character::EndTouch(const ETouchIndex::Type FingerIndex, const FVector Location)
{
if (TouchItem.bIsPressed == false)
{
return;
}
if ((FingerIndex == TouchItem.FingerIndex) && (TouchItem.bMoved == false))
{
OnFire();
}
TouchItem.bIsPressed = false;
}
//Commenting this section out to be consistent with FPS BP template.
//This allows the user to turn without using the right virtual joystick
//void AEffluvium_UE4Character::TouchUpdate(const ETouchIndex::Type FingerIndex, const FVector Location)
//{
// if ((TouchItem.bIsPressed == true) && (TouchItem.FingerIndex == FingerIndex))
// {
// if (TouchItem.bIsPressed)
// {
// if (GetWorld() != nullptr)
// {
// UGameViewportClient* ViewportClient = GetWorld()->GetGameViewport();
// if (ViewportClient != nullptr)
// {
// FVector MoveDelta = Location - TouchItem.Location;
// FVector2D ScreenSize;
// ViewportClient->GetViewportSize(ScreenSize);
// FVector2D ScaledDelta = FVector2D(MoveDelta.X, MoveDelta.Y) / ScreenSize;
// if (FMath::Abs(ScaledDelta.X) >= 4.0 / ScreenSize.X)
// {
// TouchItem.bMoved = true;
// float Value = ScaledDelta.X * BaseTurnRate;
// AddControllerYawInput(Value);
// }
// if (FMath::Abs(ScaledDelta.Y) >= 4.0 / ScreenSize.Y)
// {
// TouchItem.bMoved = true;
// float Value = ScaledDelta.Y * BaseTurnRate;
// AddControllerPitchInput(Value);
// }
// TouchItem.Location = Location;
// }
// TouchItem.Location = Location;
// }
// }
// }
//}
void AEffluvium_UE4Character::MoveForward(float Value)
{
if (Value != 0.0f)
{
// add movement in that direction
AddMovementInput(GetActorForwardVector(), Value);
}
}
void AEffluvium_UE4Character::MoveRight(float Value)
{
if (Value != 0.0f)
{
// add movement in that direction
AddMovementInput(GetActorRightVector(), Value);
}
}
void AEffluvium_UE4Character::TurnAtRate(float Rate)
{
// calculate delta for this frame from the rate information
AddControllerYawInput(Rate * BaseTurnRate * GetWorld()->GetDeltaSeconds());
}
void AEffluvium_UE4Character::LookUpAtRate(float Rate)
{
// calculate delta for this frame from the rate information
AddControllerPitchInput(Rate * BaseLookUpRate * GetWorld()->GetDeltaSeconds());
}
bool AEffluvium_UE4Character::EnableTouchscreenMovement(class UInputComponent* PlayerInputComponent)
{
bool bResult = false;
if (FPlatformMisc::GetUseVirtualJoysticks() || GetDefault<UInputSettings>()->bUseMouseForTouch)
{
bResult = true;
PlayerInputComponent->BindTouch(EInputEvent::IE_Pressed, this, &AEffluvium_UE4Character::BeginTouch);
PlayerInputComponent->BindTouch(EInputEvent::IE_Released, this, &AEffluvium_UE4Character::EndTouch);
//Commenting this out to be more consistent with FPS BP template.
//PlayerInputComponent->BindTouch(EInputEvent::IE_Repeat, this, &AEffluvium_UE4Character::TouchUpdate);
}
return bResult;
}
| [
"robertjdoig@hotmail.co.uk"
] | robertjdoig@hotmail.co.uk |
76eb998974bd63f1b8ac251a03b6a6419287a9a7 | ee238d4109a15e5f80a81fb6abf2629e9d9c5c6e | /lib/BasisRecursion/HyperCubicShape.cpp | 11b0bd4b2be638d1cc2f7b28d6f79d2547569484 | [] | no_license | rngantner/WaveBlocksND | 1059c05cd2b11fbfa27d9122ca942f7fe7533fae | 664896a731058cd7bb1f028e3f2b92043b87950b | refs/heads/master | 2021-01-17T21:59:29.722832 | 2012-10-04T15:55:37 | 2012-10-04T15:55:37 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,778 | cpp | #include <Eigen/Core>
//#include "boost/python.hpp"
#include "HyperCubicShape.h"
#include "convenienceFunctions.h"
#include <boost/python.hpp>
#include <boost/python/suite/indexing/map_indexing_suite.hpp>
//
// boost::python stuff
//
#ifdef PYTHONMODULE
using namespace boost::python;
BOOST_PYTHON_MODULE(HyperCubicShape) {
// class_<Lima >("Lima")
// .def(map_indexing_suite<Lima >() );
// class_<LimaInv >("LimaInv")
// .def(map_indexing_suite<LimaInv >() );
// need init call here, or bp will assume a default constructor exists!
class_<HyperCubicShape<PyIndexIterator> >("HyperCubicShape",init<size_t,boost::python::tuple,boost::python::dict,boost::python::dict>())
//.def(init<>()) // default constructor
//.def(init<HyperCubicShape>()) // copy constructor
.def(init<size_t,tuple,boost::python::dict,boost::python::dict>()) // see above!
.def("contains", &HyperCubicShape<PyIndexIterator>::contains_py)
.def("get_neighbours", &HyperCubicShape<PyIndexIterator>::get_neighbours)
//.def("get_index_iterator_chain", &HyperCubicShape::get_index_iterator_chain)
.def("__iter__",iterator<HyperCubicShape<PyIndexIterator> >())
;
}
#else // no python module (PYTHONMODULE not defined)
#include <iostream>
#include <vector>
#include <string>
int main(int argc, const char *argv[])
{
Py_Initialize();
std::cout << "creating tuple" << std::endl;
// create variables
boost::python::tuple limtuple = boost::python::make_tuple(2,3); // 0,1 in each dim
std::cout << "tuple created" << std::endl;
//std::cout << limtuple[0] << std::endl;
boost::python::list indices;
//Eigen::VectorXi a,b,c,d;
boost::python::tuple a,b,c,d,e,f;
std::cout << "creating indices" << std::endl;
//a << 0,0; indices.append(a);
a = boost::python::make_tuple(0,0); indices.append(a);
b = boost::python::make_tuple(1,0); indices.append(b);
c = boost::python::make_tuple(0,1); indices.append(c);
d = boost::python::make_tuple(1,1); indices.append(d);
e = boost::python::make_tuple(0,2); indices.append(e);
f = boost::python::make_tuple(1,2); indices.append(f);
std::cout << "created indices" << std::endl;
// example dicts
std::cout << "creating lima, lima_inv dicts" << std::endl;
boost::python::dict lima,lima_inv;
lima[a] = 0; lima_inv[0] = a;
lima[b] = 1; lima_inv[1] = b;
lima[c] = 2; lima_inv[2] = c;
lima[d] = 3; lima_inv[3] = d;
lima[e] = 3; lima_inv[3] = e;
lima[f] = 3; lima_inv[3] = f;
std::cout << "created lima, lima_inv dicts" << std::endl;
std::cout << "instantiating HCS" << std::endl;
HyperCubicShape<EigIndexIterator> hc(2,limtuple,lima,lima_inv);
std::cout << "getting neighbours of 1,1" << std::endl;
Eigen::VectorXi vec(2);
vec << 1,1;
std::vector<std::pair<size_t,Eigen::VectorXi> > n;
std::cout << "vec size: " << vec.size() << std::endl;
try {
n = hc.get_neighbours(vec,"all",0);
} catch (...) {
PyObject *ptype, *pvalue, *ptraceback;
PyErr_Fetch(&ptype, &pvalue, &ptraceback);
std::string error = boost::python::extract<std::string>(pvalue);
std::cout << "ERROR: " << error << std::endl;
}
for (size_t i=0; i < n.size(); i++)
std::cout << "i: " << i << " n.T= " << n[i].second.transpose() << std::endl;
std::cout << "getting HCS iterator" << std::endl;
//HyperCubicShape<EigIndexIterator>::iterator it; // doesn't work- no default constructor (TODO?)
HyperCubicShape<EigIndexIterator>::iterator it = hc.get_index_iterator_chain(1);
std::cout << "got HCS iterator" << std::endl;
for (it = hc.begin(); it != hc.end(); it++)
std::cout << "index: " << (*it).transpose() << std::endl;
return 0;
}
#endif
| [
"rngantner@gmail.com"
] | rngantner@gmail.com |
a4398a90ddb5241cc94bf0a2a46dc709d5f0e2fa | fa8d6d7d2c30de360c4f0bbcaa59167fcd582a03 | /THACO/thaco_ouija.cpp | 2d47528a35700e97b4cfb5b9628aba0c1b747d23 | [] | no_license | JodsintZ/roadtotoi | 0a699b5cbafa577696d0d20b3f7c977914c6b751 | e336227d34392af379632cb40d449727539976d5 | refs/heads/master | 2023-07-16T12:23:06.194672 | 2021-08-31T11:35:16 | 2021-08-31T11:35:16 | 212,324,761 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 335 | cpp | #include <bits/stdc++.h>
#define long long long
#define pii pair<int,int>
#define x first
#define y second
#define tii tuple<int,int,int>
using namespace std;
const int M = 1e9+7;
int n, m, ta, tb;
int main() {
scanf("%d %d", &n, &m);
for(int i = 0; i < m; i++) {
scanf("%d %d", &ta, &tb);
}
return 0;
} | [
"jodsint@gmail.com"
] | jodsint@gmail.com |
7ff4e777d4b7f59e3b080e4ecfe7e59b08b2fb9f | 91a882547e393d4c4946a6c2c99186b5f72122dd | /Source/XPSP1/NT/drivers/storage/volsnap/vss/server/modules/coord/src/lovelace.cxx | 681466732ced88f245ab3f9b672cf1baba6b711e | [] | no_license | IAmAnubhavSaini/cryptoAlgorithm-nt5src | 94f9b46f101b983954ac6e453d0cf8d02aa76fc7 | d9e1cdeec650b9d6d3ce63f9f0abe50dabfaf9e2 | refs/heads/master | 2023-09-02T10:14:14.795579 | 2021-11-20T13:47:06 | 2021-11-20T13:47:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 23,697 | cxx | /*++
Copyright (c) 1999 Microsoft Corporation
Module Name:
Lovelace.cxx
Abstract:
Definition of CVssQueuedVolume
Adi Oltean [aoltean] 10/20/1999
TBD:
Add comments.
Revision History:
Name Date Comments
aoltean 10/20/1999 Created
--*/
#include "stdafx.hxx"
#include "resource.h"
#include "vssmsg.h"
#include "vs_inc.hxx"
#include "vs_idl.hxx"
#include "svc.hxx"
#include "worker.hxx"
#include "ichannel.hxx"
#include "lovelace.hxx"
#include "ntddsnap.h"
////////////////////////////////////////////////////////////////////////
// Standard foo for file name aliasing. This code block must be after
// all includes of VSS header files.
//
#ifdef VSS_FILE_ALIAS
#undef VSS_FILE_ALIAS
#endif
#define VSS_FILE_ALIAS "CORLOVLC"
//
////////////////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////////////////////////////
// CVssQueuedVolume - constructors, destructors and initialization methods
CVssQueuedVolume::CVssQueuedVolume():
m_hBeginReleaseWritesEvent(NULL),
m_hFinishHoldWritesEvent(NULL),
m_InstanceID(GUID_NULL),
m_ulNumberOfVolumesToFlush(0),
m_usSecondsToHoldFileSystemsTimeout(nFileSystemsLovelaceTimeout),
m_usSecondsToHoldIrpsTimeout(nHoldingIRPsLovelaceTimeout),
m_pwszVolumeName(NULL),
m_pwszVolumeDisplayName(NULL),
m_bFlushSucceeded(false),
m_bReleaseSucceeded(false),
m_hrFlush(S_OK),
m_hrRelease(S_OK),
m_hrOnRun(S_OK)
{
}
CVssQueuedVolume::~CVssQueuedVolume()
{
// Wait for the worker thread to finish, if running.
// WARNING: FinalReleaseWorkerThreadObject uses virtual methods!
// Virtual methods in classes derived from CVssQueuedVolume are now inaccessible!
FinalReleaseWorkerThreadObject();
// Release the attached strings.
::VssFreeString(m_pwszVolumeName);
::VssFreeString(m_pwszVolumeDisplayName);
}
HRESULT CVssQueuedVolume::Initialize(
IN LPWSTR pwszVolumeName,
IN LPWSTR pwszVolumeDisplayName
)
/*++
Routine description:
Initialize a Queued volume object.
Return codes:
E_OUTOFMEMORY
--*/
{
CVssFunctionTracer ft(VSSDBG_COORD, L"CVssQueuedVolume::Initialize");
try
{
// Copy with the trailing "\\".
::VssSafeDuplicateStr(ft, m_pwszVolumeName, pwszVolumeName);
// Copy the volume displayed name
::VssSafeDuplicateStr(ft, m_pwszVolumeDisplayName, pwszVolumeDisplayName);
}
VSS_STANDARD_CATCH(ft)
return ft.hr;
}
/////////////////////////////////////////////////////////////////////////////
// CVssQueuedVolume - thread-related methods
void CVssQueuedVolume::SetParameters(
IN HANDLE hBeginReleaseWritesEvent,
IN HANDLE hFinishHoldWritesEvent,
IN VSS_ID InstanceID,
IN ULONG ulNumberOfVolumesToFlush
)
{
m_hBeginReleaseWritesEvent = hBeginReleaseWritesEvent;
m_hFinishHoldWritesEvent = hFinishHoldWritesEvent;
m_InstanceID = InstanceID;
m_ulNumberOfVolumesToFlush = ulNumberOfVolumesToFlush;
}
bool CVssQueuedVolume::OnInit()
{
CVssFunctionTracer ft( VSSDBG_COORD, L"CVssQueuedVolume::OnInit" );
return (m_hBeginReleaseWritesEvent != NULL)
&& (m_hFinishHoldWritesEvent != NULL)
&& (m_InstanceID != GUID_NULL)
&& (m_ulNumberOfVolumesToFlush != 0)
&& (m_usSecondsToHoldFileSystemsTimeout != 0)
&& (m_usSecondsToHoldIrpsTimeout != 0);
}
void CVssQueuedVolume::OnRun()
{
CVssFunctionTracer ft( VSSDBG_COORD, L"CVssQueuedVolume::OnRun" );
try
{
// Open the IOCTL channel
// Eliminate the trailing backslash
// Throw on error
BS_ASSERT(::wcslen(m_pwszVolumeName) == nLengthOfVolMgmtVolumeName);
m_objIChannel.Open(ft, m_pwszVolumeName, true, true);
// Hold writes
OnHoldWrites();
// Signal the thread set that the writes are now hold...
if (!::SetEvent(m_hFinishHoldWritesEvent))
ft.TranslateGenericError(VSSDBG_COORD, HRESULT_FROM_WIN32(GetLastError()),
L"SetEvent(%p)", m_hFinishHoldWritesEvent );
m_hFinishHoldWritesEvent = NULL;
// Wait for the "Release Writes" event
if (::WaitForSingleObject( m_hBeginReleaseWritesEvent, nHoldingIRPsVssTimeout * 1000 ) == WAIT_FAILED)
ft.TranslateGenericError(VSSDBG_COORD, HRESULT_FROM_WIN32(GetLastError()),
L"WaitForSingleObject(%p,%d) == WAIT_FAILED",
m_hFinishHoldWritesEvent, nHoldingIRPsVssTimeout * 1000 );
// Release writes.
OnReleaseWrites();
}
VSS_STANDARD_CATCH(ft);
m_hrOnRun = ft.hr;
}
void CVssQueuedVolume::OnFinish()
{
CVssFunctionTracer ft( VSSDBG_COORD, L"CVssQueuedVolume::OnFinish" );
m_hBeginReleaseWritesEvent = NULL; // released by the ThreadSet
m_hFinishHoldWritesEvent = NULL; // released by the ThreadSet
m_InstanceID = GUID_NULL;
m_ulNumberOfVolumesToFlush = 0;
m_usSecondsToHoldFileSystemsTimeout = 0;
m_usSecondsToHoldIrpsTimeout = 0;
// Mark thread state as finished
MarkAsFinished();
};
void CVssQueuedVolume::OnTerminate()
{
CVssFunctionTracer ft( VSSDBG_COORD, L"CVssQueuedVolume::OnTerminate" );
}
void CVssQueuedVolume::OnHoldWrites()
{
CVssFunctionTracer ft( VSSDBG_COORD, L"CVssQueuedVolume::OnHoldWrites" );
try
{
BS_ASSERT(m_bFlushSucceeded == false);
m_bFlushSucceeded = false;
// pack the IOCTL [in] arguments
m_objIChannel.Pack(ft, m_InstanceID);
m_objIChannel.Pack(ft, m_ulNumberOfVolumesToFlush);
m_objIChannel.Pack(ft, m_usSecondsToHoldFileSystemsTimeout);
m_objIChannel.Pack(ft, m_usSecondsToHoldIrpsTimeout);
// send the IOCTL
m_objIChannel.Call(ft, IOCTL_VOLSNAP_FLUSH_AND_HOLD_WRITES);
BS_ASSERT(ft.hr == S_OK);
m_bFlushSucceeded = true;
}
VSS_STANDARD_CATCH(ft)
m_hrFlush = ft.hr;
};
void CVssQueuedVolume::OnReleaseWrites()
{
CVssFunctionTracer ft( VSSDBG_COORD, L"CVssQueuedVolume::OnReleaseWrites" );
try
{
BS_ASSERT(m_bReleaseSucceeded == false);
m_bReleaseSucceeded = false;
// If the Flush IOCTL was succeeded
if (IsFlushSucceeded()) {
// then send the Release IOCTL.
m_objIChannel.Call(ft, IOCTL_VOLSNAP_RELEASE_WRITES);
BS_ASSERT(ft.hr == S_OK);
m_bReleaseSucceeded = true;
}
}
VSS_STANDARD_CATCH(ft)
m_hrRelease = ft.hr;
};
/////////////////////////////////////////////////////////////////////////////
// CVssQueuedVolumesList
CVssQueuedVolumesList::CVssQueuedVolumesList():
m_eState(VSS_TS_INITIALIZING),
m_hBeginReleaseWritesEvent(NULL)
{}
CVssQueuedVolumesList::~CVssQueuedVolumesList()
{
CVssFunctionTracer ft( VSSDBG_COORD, L"CVssQueuedVolumesList::~CVssQueuedVolumesList" );
try
{
// Remove all volumes from the map
Reset();
// Release the internal synchronization objects
if (m_hBeginReleaseWritesEvent)
::CloseHandle(m_hBeginReleaseWritesEvent);
}
VSS_STANDARD_CATCH(ft)
};
HRESULT CVssQueuedVolumesList::AddVolume(
WCHAR* pwszVolumeName,
WCHAR* pwszVolumeDisplayName
)
/*++
Routine description:
Adds a volume to the volume list.
Error codes returned:
E_UNEXPECTED
- The thread state is incorrect. No logging is done - programming error.
VSS_E_OBJECT_ALREADY_EXISTS
- The volume was already added to the snapshot set.
VSS_E_MAXIMUM_NUMBER_OF_VOLUMES_REACHED
- The maximum number of volumes was reached.
E_OUTOFMEMORY
[Initialize() failures]
E_OUTOFMEMORY
--*/
{
CVssFunctionTracer ft( VSSDBG_COORD, L"CVssQueuedVolumesList::AddVolume" );
try
{
// Assert parameters
BS_ASSERT(pwszVolumeName && pwszVolumeName[0]);
BS_ASSERT(pwszVolumeDisplayName && pwszVolumeDisplayName[0]);
// Make sure the volume list object is initialized
if (m_eState != VSS_TS_INITIALIZING) {
BS_ASSERT(false);
ft.Throw( VSSDBG_COORD, E_UNEXPECTED, L"Bad state %d.", m_eState);
}
// Find if the volume was already added
if (m_VolumesMap.Lookup(pwszVolumeName))
ft.Throw( VSSDBG_COORD, VSS_E_OBJECT_ALREADY_EXISTS, L"Volume already added");
// Check if the maximum number of objects was reached
if (m_VolumesMap.GetSize() >= MAXIMUM_WAIT_OBJECTS)
ft.Throw( VSSDBG_COORD, VSS_E_MAXIMUM_NUMBER_OF_VOLUMES_REACHED,
L"The maximum number (%d) of Lovelace threads was reached.",
m_VolumesMap.GetSize());
// Create the queued volume object
CVssQueuedVolume* pQueuedVol = new CVssQueuedVolume();
if (pQueuedVol == NULL)
ft.Throw( VSSDBG_COORD, E_OUTOFMEMORY, L"Memory allocation error.");
// Initialize the pQueuedVol object. This method may throw
ft.hr = pQueuedVol->Initialize(pwszVolumeName, pwszVolumeDisplayName);
if (ft.HrFailed()) {
delete pQueuedVol;
ft.Throw( VSSDBG_COORD, E_OUTOFMEMORY,
L"Cannot initialize volume object 0x%08lx", ft.hr);
}
// Add the volume object to the map
// Beware that the volume name is already allocated.
BS_ASSERT(pQueuedVol->GetVolumeName() != NULL);
if (!m_VolumesMap.Add(pQueuedVol->GetVolumeName(), pQueuedVol)) {
delete pQueuedVol;
ft.Throw( VSSDBG_COORD, E_OUTOFMEMORY, L"Memory allocation error.");
}
}
VSS_STANDARD_CATCH(ft)
return ft.hr;
};
HRESULT CVssQueuedVolumesList::RemoveVolume(
WCHAR* pwszVolumeName
)
/*++
Routine description:
Removes a volume to the volume list.
Error codes returned:
E_UNEXPECTED
- The thread state is incorrect. No logging is done - programming error.
VSS_E_OBJECT_NOT_FOUND
- The volume was not added to the snapshot set.
--*/
{
CVssFunctionTracer ft( VSSDBG_COORD, L"CVssQueuedVolumesList::RemoveVolume" );
try
{
// Assert parameters
BS_ASSERT(pwszVolumeName && pwszVolumeName[0]);
// Make sure the volume list object is initialized
if (m_eState != VSS_TS_INITIALIZING)
ft.Throw( VSSDBG_COORD, E_UNEXPECTED, L"Bad state %d.", m_eState);
// Find if the volume was already added
CVssQueuedVolume* pQueuedVol = m_VolumesMap.Lookup(pwszVolumeName);
if (pQueuedVol == NULL)
ft.Throw( VSSDBG_COORD, VSS_E_OBJECT_NOT_FOUND, L"Volume does not exist");
// Remove the corresponding entry
BOOL bRemoved = m_VolumesMap.Remove(pwszVolumeName);
if (!bRemoved) {
BS_ASSERT(bRemoved);
ft.Trace( VSSDBG_COORD, L"Error removing the volume entry");
}
// Delete the volume object.
delete pQueuedVol;
}
VSS_STANDARD_CATCH(ft)
return ft.hr;
};
void CVssQueuedVolumesList::Reset()
/*++
Routine description:
Waits for all background threads. Reset the snapshot set.
Thrown errors:
None.
--*/
{
CVssFunctionTracer ft( VSSDBG_COORD, L"CVssQueuedVolumesList::Reset" );
// If the flush faield this must be treated already in the "flush" error case
if ( (m_eState == VSS_TS_HOLDING)
||(m_eState == VSS_TS_FAILED_IN_FLUSH) )
{
BS_ASSERT(m_VolumesMap.GetSize() > 0);
// Wait for all threads to finish.
// This will signal the m_hBeginReleaseWritesEvent event.
// WARNING: Ignore return codes from this call. Trace already done.
WaitForFinish();
}
// Remove all queued volumes
for(int nIndex = 0; nIndex < m_VolumesMap.GetSize(); nIndex++) {
CVssQueuedVolume* pVol = m_VolumesMap.GetValueAt(nIndex);
BS_ASSERT(pVol);
delete pVol;
}
// Remove all map entries
m_VolumesMap.RemoveAll();
ft.Trace(VSSDBG_COORD, L"Current state %d. Reset to initializing", m_eState);
m_eState = VSS_TS_INITIALIZING;
}
HRESULT CVssQueuedVolumesList::FlushAndHoldAllWrites(
IN VSS_ID SnapshotSetID
)
/*++
Routine description:
Creates the background threads.
Flush and Hold all writes on the background threads.
Wait until all IOCTLS are performed.
Return codes:
E_OUTOFMEMORY
E_UNEXPECTED
- Invalid thread state. Dev error - no entry is put in the event log.
- Empty volume array. Dev error - no entry is put in the event log.
- Error creating or waiting a Win32 event. An entry is added into the Event Log if needed.
VSS_ERROR_FLUSH_WRITES_TIMEOUT
- An error occured while flushing the writes from a background thread. An event log entry is added.
--*/
{
CVssFunctionTracer ft( VSSDBG_COORD, L"CVssQueuedVolumesList::FlushAndHoldAllWrites" );
HANDLE* pHandleArray = NULL;
INT nFilledHandles = 0;
try
{
// Check to see if the state is correct
if (m_eState != VSS_TS_INITIALIZING) {
BS_ASSERT(false);
ft.Throw( VSSDBG_COORD, E_UNEXPECTED, L"Bad state %d.", m_eState);
}
// Check we have added some volumes first
if (m_VolumesMap.GetSize() <= 0) {
BS_ASSERT(false);
ft.Throw( VSSDBG_COORD, E_UNEXPECTED, L"Improper array size.");
}
// Create the Begin Release Writes event, as a manual reset non-signaled event
if (m_hBeginReleaseWritesEvent == NULL) {
m_hBeginReleaseWritesEvent = ::CreateEvent( NULL, TRUE, FALSE, NULL );
if (m_hBeginReleaseWritesEvent == NULL)
ft.TranslateGenericError( VSSDBG_COORD, HRESULT_FROM_WIN32(GetLastError()),
L"CreateEvent( NULL, TRUE, FALSE, NULL )");
} else
::ResetEvent( m_hBeginReleaseWritesEvent );
// Create the array of handles local to each thread
pHandleArray = new HANDLE[m_VolumesMap.GetSize()];
if (pHandleArray == NULL)
ft.Throw( VSSDBG_COORD, E_OUTOFMEMORY, L"Memory allocation error.");
// Prepares all jobs
for (int nIndex = 0; nIndex < m_VolumesMap.GetSize(); nIndex++ )
{
// Create the Finish Hold Writes event, as a manual reset non-signaled event
pHandleArray[nIndex] = ::CreateEvent( NULL, TRUE, FALSE, NULL );
if (pHandleArray[nIndex] == NULL)
ft.TranslateGenericError( VSSDBG_COORD, HRESULT_FROM_WIN32(GetLastError()),
L"CreateEvent( NULL, TRUE, FALSE, NULL )");
// Increase the number of filled handles
nFilledHandles++;
BS_ASSERT(nFilledHandles == nIndex + 1);
// Obtain the queued volume object in discussion
CVssQueuedVolume* pVol = m_VolumesMap.GetValueAt(nIndex);
BS_ASSERT(pVol);
// Transfer parameters to the current job
pVol->SetParameters(
m_hBeginReleaseWritesEvent,
pHandleArray[nIndex],
SnapshotSetID,
m_VolumesMap.GetSize()
);
// Prepare the job
ft.hr = pVol->PrepareJob();
if (ft.HrFailed())
ft.Throw( VSSDBG_COORD, E_OUTOFMEMORY, L"Error preparing the job %d [0x%08lx]. ", nIndex, ft.hr);
}
// Flush and hold writes. All threads will wait for the event to be signaled.
// This thread will wait until all IOCTLS were sent.
// Start (i.e. Resume) all threads
for (int nIndex = 0; nIndex < m_VolumesMap.GetSize(); nIndex++ ) {
// Obtain the queued volume object in discussion
CVssQueuedVolume* pVol = m_VolumesMap.GetValueAt(nIndex);
BS_ASSERT(pVol);
// This can happen only because some thread objects were in invalid state...
ft.hr = pVol->StartJob();
if (ft.HrFailed())
ft.Throw( VSSDBG_COORD, E_OUTOFMEMORY, L"Error starting the job %d [0x%08lx]. ", nIndex, ft.hr);
}
// Wait for all threads to send the FlushAndHold IOCTLS.
if (::WaitForMultipleObjects( m_VolumesMap.GetSize(),
pHandleArray, TRUE, nFlushVssTimeout * 1000) == WAIT_FAILED)
ft.TranslateGenericError( VSSDBG_COORD,
HRESULT_FROM_WIN32(GetLastError()), L"WaitForMultipleObjects(%d,%p,1,%d) == WAIT_FAILED",
m_VolumesMap.GetSize(),pHandleArray, nFlushVssTimeout * 1000);
// Check for IOCTL errors
for (int nIndex = 0; nIndex < m_VolumesMap.GetSize(); nIndex++ )
{
// Obtain the queued volume object in discussion
CVssQueuedVolume* pVol = m_VolumesMap.GetValueAt(nIndex);
BS_ASSERT(pVol);
// Check if Flush succeeded.
if (!pVol->IsFlushSucceeded()) {
BS_ASSERT(pVol->GetReleaseError() == S_OK);
if ((pVol->GetFlushError() == E_OUTOFMEMORY) ||
(pVol->GetOnRunError() == E_OUTOFMEMORY))
ft.Throw( VSSDBG_COORD, E_OUTOFMEMORY, L"Memory allocation error. [0x%08lx,0x%08lx,0x%08lx]",
pVol->GetFlushError(), pVol->GetReleaseError(), pVol->GetOnRunError());
ft.LogError(VSS_ERROR_FLUSH_WRITES_TIMEOUT,
VSSDBG_COORD << pVol->GetVolumeDisplayName() << (INT)nIndex
<< pVol->GetFlushError() << pVol->GetReleaseError() << pVol->GetOnRunError() );
ft.Throw( VSSDBG_COORD, VSS_E_FLUSH_WRITES_TIMEOUT,
L"Lovelace failed to hold writes at volume %d - '%s'",
nIndex, pVol->GetVolumeDisplayName() );
}
}
m_eState = VSS_TS_HOLDING;
}
VSS_STANDARD_CATCH(ft)
// Close all events (from 0..nFilledHandles-1)
for (int nIndexTmp = 0; nIndexTmp < nFilledHandles; nIndexTmp++ )
::CloseHandle(pHandleArray[nIndexTmp]);
// Deallocate the handle array
delete[] pHandleArray;
// Check for errors
if (ft.HrFailed())
m_eState = VSS_TS_FAILED_IN_FLUSH;
return ft.hr;
};
HRESULT CVssQueuedVolumesList::ReleaseAllWrites()
/*++
Routine description:
Signals all the background threads to release the writes.
Wait until all IOCTLS are performed.
Return codes:
[WaitForFinish() failures]
E_UNEXPECTED
- The list of volumes is empty. Dev error - nothing is logged on.
- SetEvent failed. An entry is put in the error log.
- WaitForMultipleObjects failed. An entry is put in the error log.
E_OUTOFMEMORY
- Cannot create the array of handles.
- One of the background threads failed with E_OUTOFMEMORY
VSS_E_HOLD_WRITES_TIMEOUT
- Lovelace couldn't keep more the writes. An event log entry is added.
--*/
{
CVssFunctionTracer ft( VSSDBG_COORD, L"CVssQueuedVolumesList::ReleaseAllWrites" );
try
{
// If the flush faield this must be treated already in the "flush" error case
if ( (m_eState == VSS_TS_HOLDING)
||(m_eState == VSS_TS_FAILED_IN_FLUSH) )
{
BS_ASSERT(m_VolumesMap.GetSize() > 0);
// Wait for all threads to finish.
// This will signal the m_hBeginReleaseWritesEvent event.
ft.hr = WaitForFinish();
if (ft.HrFailed())
ft.Throw( VSSDBG_COORD, ft.hr, L"Error waiting threads for finishing");
}
}
VSS_STANDARD_CATCH(ft)
// Check for errors
if (ft.HrFailed())
m_eState = VSS_TS_FAILED_IN_RELEASE;
return ft.hr;
};
HRESULT CVssQueuedVolumesList::WaitForFinish()
/*++
Routine description:
Wait until all Lovelace threads are finished.
Thrown errors:
E_UNEXPECTED
- The list of volumes is empty. Dev error - nothing is logged on.
- SetEvent failed. An entry is put in the error log.
- WaitForMultipleObjects failed. An entry is put in the error log.
E_OUTOFMEMORY
- Cannot create the array of handles.
- One of the background threads failed with E_OUTOFMEMORY
VSS_E_HOLD_WRITES_TIMEOUT
- Lovelace couldn't keep more the writes. An event log entry is added.
--*/
{
CVssFunctionTracer ft( VSSDBG_COORD, L"CVssQueuedVolumesList::WaitForFinish" );
// Table of handles used for synchronization
HANDLE* pHandleArray = NULL;
try
{
// Release all blocked threads by signaling the m_hBeginReleaseWritesEvent event.
if(m_hBeginReleaseWritesEvent != NULL) {
if (!::SetEvent(m_hBeginReleaseWritesEvent))
ft.TranslateGenericError( VSSDBG_COORD,
HRESULT_FROM_WIN32(GetLastError()),
L"SetEvent(%p)", m_hBeginReleaseWritesEvent);
}
// Get the size of the array.
if (m_VolumesMap.GetSize() <= 0) {
BS_ASSERT(false);
ft.Throw( VSSDBG_COORD, E_UNEXPECTED, L"Zero array size.");
}
// Create the array of handles local to each thread
pHandleArray = new HANDLE[m_VolumesMap.GetSize()];
if (pHandleArray == NULL)
ft.Throw( VSSDBG_COORD, E_OUTOFMEMORY, L"Memory allocation error.");
// Search to find any running threads
int nThreadHandlesCount = 0;
for (int nIndex = 0; nIndex < m_VolumesMap.GetSize(); nIndex++ )
{
// Obtain the queued volume object in discussion
CVssQueuedVolume* pVol = m_VolumesMap.GetValueAt(nIndex);
BS_ASSERT(pVol);
// Get the thread handle, if it is still running
// Note: the "prepared" threads will not be in "running" state at this point
// The only procedure that can fire them up (i.e. StartJob) cannot
// be called anymore at this point.
if (pVol->IsStarted()) {
HANDLE hThread = pVol->GetThreadHandle();
BS_ASSERT(hThread != NULL);
pHandleArray[nThreadHandlesCount++] = hThread; // will be closed on job array destruction.
}
}
// If we have threads that we can wait on...
if (nThreadHandlesCount != 0) {
// Wait for all threads to send the Release IOCTLS.
if (::WaitForMultipleObjects( nThreadHandlesCount,
pHandleArray, TRUE, nReleaseVssTimeout * 1000) == WAIT_FAILED)
ft.TranslateGenericError( VSSDBG_COORD,
HRESULT_FROM_WIN32(GetLastError()),
L"WaitForMultipleObjects(%d,%p,1,%d) == WAIT_FAILED",
nThreadHandlesCount,pHandleArray, nReleaseVssTimeout * 1000);
}
// Check for IOCTL errors
for (int nIndex = 0; nIndex < m_VolumesMap.GetSize(); nIndex++ )
{
// Obtain the queued volume object in discussion
CVssQueuedVolume* pVol = m_VolumesMap.GetValueAt(nIndex);
BS_ASSERT(pVol);
// Check if Release writers succeeded.
if (pVol->IsFlushSucceeded()) {
BS_ASSERT(pVol->GetFlushError() == S_OK);
// Check if Release writes succeeded
if (!pVol->IsReleaseSucceeded()) {
if ((pVol->GetFlushError() == E_OUTOFMEMORY) ||
(pVol->GetReleaseError() == E_OUTOFMEMORY) ||
(pVol->GetOnRunError() == E_OUTOFMEMORY))
ft.Throw( VSSDBG_COORD, E_OUTOFMEMORY, L"Memory allocation error. [0x%08lx,0x%08lx,0x%08lx]",
pVol->GetFlushError(), pVol->GetReleaseError(), pVol->GetOnRunError());
ft.LogError(VSS_ERROR_HOLD_WRITES_TIMEOUT,
VSSDBG_COORD << pVol->GetVolumeDisplayName() << (INT)nIndex
<< pVol->GetFlushError() << pVol->GetReleaseError() << pVol->GetOnRunError() );
ft.Throw( VSSDBG_COORD, VSS_E_HOLD_WRITES_TIMEOUT,
L"Lovelace failed to hold writes at volume %d - '%s'",
nIndex, pVol->GetVolumeDisplayName() );
}
}
}
m_eState = VSS_TS_RELEASED;
}
VSS_STANDARD_CATCH(ft)
// Deallocate the handle array
delete[] pHandleArray;
return ft.hr;
};
CComBSTR CVssQueuedVolumesList::GetVolumesList() throw(HRESULT)
/*++
Routine description:
Gets the list of volumes as a BSTR.
Throws:
E_OUTOFMEMORY
--*/
{
CVssFunctionTracer ft( VSSDBG_COORD, L"CVssQueuedVolumesList::GetVolumesList" );
CComBSTR bstrVolumeNamesList;
BS_ASSERT(m_VolumesMap.GetSize() > 0);
// Concatenate the list of volume display names
for (int nIndexTmp = 0; nIndexTmp < m_VolumesMap.GetSize(); nIndexTmp++ ) {
// Obtain the queued volume object in discussion
CVssQueuedVolume* pVol = m_VolumesMap.GetValueAt(nIndexTmp);
BS_ASSERT(pVol);
// Check to see if this is the first item
if (nIndexTmp == 0) {
// Put the first volume name
bstrVolumeNamesList = pVol->GetVolumeName();
if (bstrVolumeNamesList.Length() == 0)
ft.Throw( VSSDBG_COORD, E_OUTOFMEMORY, L"Memory allocation error");
} else {
// Append the semicolon
bstrVolumeNamesList += wszVolumeNamesSeparator;
if (bstrVolumeNamesList.Length() == 0)
ft.Throw( VSSDBG_COORD, E_OUTOFMEMORY, L"Memory allocation error");
// Append the next volume name
bstrVolumeNamesList += pVol->GetVolumeName();
if (bstrVolumeNamesList.Length() == 0)
ft.Throw( VSSDBG_COORD, E_OUTOFMEMORY, L"Memory allocation error");
}
}
// Return the built list
return bstrVolumeNamesList;
}
| [
"support@cryptoalgo.cf"
] | support@cryptoalgo.cf |
6703dcd1b2a566ad448ddc8d6eea0437fcb22eff | 0c117da3fa5e4f2b8e6f642f29b54e3e2f24f1ba | /2012/1.1/lights.cpp | c2e5991fded38406092e6b95b11cb361bb91099c | [] | no_license | pavel-zeman/HackerCup | 585094c5b4d0ae96261001ea2cae7f835c73f150 | d780ed196d59cff8aa8f0c389643b2e60e7f676b | refs/heads/master | 2021-09-08T07:42:33.298408 | 2021-09-01T09:51:16 | 2021-09-01T09:51:16 | 14,663,936 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,846 | cpp | #include <stdio.h>
#include <string.h>
#include <limits.h>
#include <math.h>
#include <stdlib.h>
#include <ctype.h>
#include <assert.h>
#define FOR(c, m) for(int c=0;c<(m);c++)
#define FORE(c, f, t) for(int c=(f);c<(t);c++)
int r, c;
char input[32][32];
char current[32][32];
void sw(int i, int j) {
current[i][j] = !current[i][j];
if (i > 0) current[i - 1][j] = !current[i - 1][j];
if (i < r - 1) current[i + 1][j] = !current[i + 1][j];
if (j > 0) current[i][j - 1] = !current[i][j - 1];
if (j < c - 1) current[i][j + 1] = !current[i][j + 1];
}
void dumpState() {
FOR(i, r) {
FOR(j, c) printf("%c", current[i][j] ? 'X' : '.');
printf("\n");
}
printf("\n");
}
int main(void) {
int cases;
scanf("%d", &cases);
for(int cc=1;cc<=cases;cc++) {
char row[100];
scanf("%d%d", &r, &c);
FOR(i, r) {
scanf("%s", row);
FOR(j, c) input[i][j] = row[j] == 'X';
}
int firstRow = (1<<c);
int min = 500;
while (--firstRow >= 0) {
int switches = 0;
FOR(i, r) FOR(j, c) current[i][j] = input[i][j];
int temp = firstRow;
FOR(i, c) {
if (temp & 1) sw(0, i), switches++;
temp >>= 1;
}
FORE(i, 1, r) {
FOR(j, c)
if (!current[i - 1][j]) sw(i, j), switches++;
if (switches >= min) break;
}
if (switches < min) {
bool ok = true;
FOR(j, c)
if (!current[r - 1][j]) {
ok = false;
break;
}
if (ok) min = switches;
}
}
if (min == 500) min = -1;
printf("%d\n", min);
}
}
| [
"pavel@pavel"
] | pavel@pavel |
293eebff71135cc807253fa8bb98d09ae962162d | d4c720f93631097ee048940d669e0859e85eabcf | /chromecast/cast_core/runtime/browser/runtime_service_impl.h | cedbad3e71178a487a0d2fb67a2be85fa5aac034 | [
"BSD-3-Clause"
] | permissive | otcshare/chromium-src | 26a7372773b53b236784c51677c566dc0ad839e4 | 3b920d87437d9293f654de1f22d3ea341e7a8b55 | refs/heads/webnn | 2023-03-21T03:20:15.377034 | 2023-01-25T21:19:44 | 2023-01-25T21:19:44 | 209,262,645 | 18 | 21 | BSD-3-Clause | 2023-03-23T06:20:07 | 2019-09-18T08:52:07 | null | UTF-8 | C++ | false | false | 5,777 | h | // Copyright 2021 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef CHROMECAST_CAST_CORE_RUNTIME_BROWSER_RUNTIME_SERVICE_IMPL_H_
#define CHROMECAST_CAST_CORE_RUNTIME_BROWSER_RUNTIME_SERVICE_IMPL_H_
#include <memory>
#include "base/memory/weak_ptr.h"
#include "base/time/time.h"
#include "base/timer/timer.h"
#include "chromecast/cast_core/grpc/grpc_server.h"
#include "chromecast/cast_core/runtime/browser/cast_runtime_action_recorder.h"
#include "chromecast/cast_core/runtime/browser/cast_runtime_metrics_recorder.h"
#include "chromecast/cast_core/runtime/browser/cast_runtime_metrics_recorder_service.h"
#include "chromecast/cast_core/runtime/browser/runtime_application_service_impl.h"
#include "components/cast_receiver/browser/public/runtime_application_dispatcher.h"
#include "components/cast_receiver/common/public/status.h"
#include "third_party/abseil-cpp/absl/types/optional.h"
#include "third_party/cast_core/public/src/proto/metrics/metrics_recorder.castcore.pb.h"
#include "third_party/cast_core/public/src/proto/runtime/runtime_service.castcore.pb.h"
namespace cast_receiver {
class ContentBrowserClientMixins;
} // namespace cast_receiver
namespace chromecast {
class CastWebService;
// An implementation of the gRPC-defined RuntimeService for use with Cast Core.
class RuntimeServiceImpl final
: public CastRuntimeMetricsRecorder::EventBuilderFactory {
public:
// |application_client| and |web_service| are expected to persist for the
// lifetime of this instance.
RuntimeServiceImpl(cast_receiver::ContentBrowserClientMixins& browser_mixins,
CastWebService& web_service,
std::string runtime_id,
std::string runtime_service_endpoint);
~RuntimeServiceImpl() override;
// Starts and stops the runtime service, including the gRPC completion queue.
cast_receiver::Status Start();
cast_receiver::Status Stop();
// CastRuntimeMetricsRecorder::EventBuilderFactory overrides:
std::unique_ptr<CastEventBuilder> CreateEventBuilder() override;
private:
// RuntimeService gRPC handlers:
void HandleLoadApplication(
cast::runtime::LoadApplicationRequest request,
cast::runtime::RuntimeServiceHandler::LoadApplication::Reactor* reactor);
void HandleLaunchApplication(
cast::runtime::LaunchApplicationRequest request,
cast::runtime::RuntimeServiceHandler::LaunchApplication::Reactor*
reactor);
void HandleStopApplication(
cast::runtime::StopApplicationRequest request,
cast::runtime::RuntimeServiceHandler::StopApplication::Reactor* reactor);
void HandleHeartbeat(
cast::runtime::HeartbeatRequest request,
cast::runtime::RuntimeServiceHandler::Heartbeat::Reactor* reactor);
void HandleStartMetricsRecorder(
cast::runtime::StartMetricsRecorderRequest request,
cast::runtime::RuntimeServiceHandler::StartMetricsRecorder::Reactor*
reactor);
void HandleStopMetricsRecorder(
cast::runtime::StopMetricsRecorderRequest request,
cast::runtime::RuntimeServiceHandler::StopMetricsRecorder::Reactor*
reactor);
// Helper methods.
void OnApplicationLoaded(
std::string session_id,
cast::runtime::RuntimeServiceHandler::LoadApplication::Reactor* reactor,
cast_receiver::Status status);
void OnApplicationLaunching(
std::string session_id,
cast::runtime::RuntimeServiceHandler::LaunchApplication::Reactor* reactor,
cast_receiver::Status status);
void OnApplicationStopping(
std::string session_id,
cast::runtime::RuntimeServiceHandler::StopApplication::Reactor* reactor,
cast_receiver::Status status);
void SendHeartbeat();
void OnHeartbeatSent(
cast::utils::GrpcStatusOr<
cast::runtime::RuntimeServiceHandler::Heartbeat::Reactor*>
reactor_or);
void RecordMetrics(cast::metrics::RecordRequest request,
CastRuntimeMetricsRecorderService::RecordCompleteCallback
record_complete_callback);
void OnMetricsRecorded(
CastRuntimeMetricsRecorderService::RecordCompleteCallback
record_complete_callback,
cast::utils::GrpcStatusOr<cast::metrics::RecordResponse> response_or);
void OnMetricsRecorderServiceStopped(
cast::runtime::RuntimeServiceHandler::StopMetricsRecorder::Reactor*
reactor);
const std::string runtime_id_;
const std::string runtime_service_endpoint_;
SEQUENCE_CHECKER(sequence_checker_);
std::unique_ptr<cast_receiver::RuntimeApplicationDispatcher<
RuntimeApplicationServiceImpl>>
application_dispatcher_;
scoped_refptr<base::SequencedTaskRunner> task_runner_;
base::raw_ref<CastWebService> const web_service_;
// Allows metrics, histogram, action recording, which can be reported by
// CastRuntimeMetricsRecorderService if Cast Core starts it.
CastRuntimeMetricsRecorder metrics_recorder_;
absl::optional<CastRuntimeActionRecorder> action_recorder_;
absl::optional<cast::utils::GrpcServer> grpc_server_;
absl::optional<cast::metrics::MetricsRecorderServiceStub>
metrics_recorder_stub_;
absl::optional<CastRuntimeMetricsRecorderService> metrics_recorder_service_;
// Heartbeat period as set by Cast Core.
base::TimeDelta heartbeat_period_;
// Heartbeat timeout timer.
base::OneShotTimer heartbeat_timer_;
// Server streaming reactor used to send the heartbeats to Cast Core.
cast::runtime::RuntimeServiceHandler::Heartbeat::Reactor* heartbeat_reactor_ =
nullptr;
base::WeakPtrFactory<RuntimeServiceImpl> weak_factory_{this};
};
} // namespace chromecast
#endif // CHROMECAST_CAST_CORE_RUNTIME_BROWSER_RUNTIME_SERVICE_IMPL_H_
| [
"chromium-scoped@luci-project-accounts.iam.gserviceaccount.com"
] | chromium-scoped@luci-project-accounts.iam.gserviceaccount.com |
39623909af5dccc1a2063edbf78c73373783a99b | 5898d3bd9e4cb58043b40fa58961c7452182db08 | /part2/ch06/6-2-3-char/src/char.cpp | 402cd9ad8c9bfc56d5d074fe9689baa34309e665 | [] | no_license | sasaki-seiji/ProgrammingLanguageCPP4th | 1e802f3cb15fc2ac51fa70403b95f52878223cff | 2f686b385b485c27068328c6533926903b253687 | refs/heads/master | 2020-04-04T06:10:32.942026 | 2017-08-10T11:35:08 | 2017-08-10T11:35:08 | 53,772,682 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 388 | cpp | /*
* char.cpp
*
* Created on: 2016/04/09
* Author: sasaki
*/
#include <iostream>
using namespace std;
void inval()
{
cout << "inval():\n";
for (char c; cin >> c; )
cout << "the value of '" << c << "' is " << int{c} << '\n';
}
void digits()
{
cout << "digits():\n";
for (int i=0; i!=10; ++i)
cout << static_cast<char>('0'+i);
}
int main()
{
inval();
digits();
}
| [
"sasaki-seiji@msj.biglobe.ne.jp"
] | sasaki-seiji@msj.biglobe.ne.jp |
c1e172f841283fa2ff8cf6a9b40b2da659670e1a | e780ac4efed690d0671c9e25df3e9732a32a14f5 | /RaiderEngine/libs/PhysX-4.1/physx/samples/sampleframework/renderer/src/d3d11/D3D11RendererTexture2D.cpp | 6d1ba6beea6b4ca585ad8bfe8a420f5bf95e0c29 | [
"MIT"
] | permissive | rystills/RaiderEngine | fbe943143b48f4de540843440bd4fcd2a858606a | 3fe2dcdad6041e839e1bad3632ef4b5e592a47fb | refs/heads/master | 2022-06-16T20:35:52.785407 | 2022-06-11T00:51:40 | 2022-06-11T00:51:40 | 184,037,276 | 6 | 0 | MIT | 2022-05-07T06:00:35 | 2019-04-29T09:05:20 | C++ | UTF-8 | C++ | false | false | 11,098 | cpp | //
// 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 NVIDIA CORPORATION 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 ''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.
//
// Copyright (c) 2008-2021 NVIDIA Corporation. All rights reserved.
#include <RendererConfig.h>
#if defined(RENDERER_ENABLE_DIRECT3D11)
#include "D3D11RendererTexture2D.h"
#include "D3D11RendererMemoryMacros.h"
#include <RendererTexture2DDesc.h>
using namespace SampleRenderer;
D3D11RendererTexture2D::D3D11RendererTexture2D(ID3D11Device& d3dDevice, ID3D11DeviceContext& d3dDeviceContext, const RendererTexture2DDesc& desc) :
RendererTexture2D(desc),
m_d3dDevice(d3dDevice),
m_d3dDeviceContext(d3dDeviceContext),
m_d3dTexture(NULL),
m_d3dSamplerState(NULL),
m_d3dSRV(NULL),
m_d3dRTV(NULL),
m_d3dDSV(NULL)
{
loadTextureDesc(desc);
onDeviceReset();
}
D3D11RendererTexture2D::~D3D11RendererTexture2D(void)
{
dxSafeRelease(m_d3dTexture);
dxSafeRelease(m_d3dSamplerState);
dxSafeRelease(m_d3dSRV);
dxSafeRelease(m_d3dRTV);
dxSafeRelease(m_d3dDSV);
if (m_data)
{
for (PxU32 i = 0; i < getNumLevels(); i++)
{
delete [] m_data[i];
}
delete [] m_data;
}
if (m_resourceData)
{
delete [] m_resourceData;
}
}
void* D3D11RendererTexture2D::lockLevel(PxU32 level, PxU32& pitch)
{
void* buffer = 0;
RENDERER_ASSERT(level < getNumLevels(), "Level out of range!");
if (level < getNumLevels())
{
buffer = m_data[level];
pitch = getFormatNumBlocks(getWidth() >> level, getFormat()) * getBlockSize();
}
return buffer;
}
void D3D11RendererTexture2D::unlockLevel(PxU32 level)
{
RENDERER_ASSERT(level < getNumLevels(), "Level out of range!");
if (m_d3dTexture && level < getNumLevels())
{
PxU32 w = getLevelDimension(getWidth(), level);
PxU32 h = getLevelDimension(getHeight(), level);
m_d3dDeviceContext.UpdateSubresource(m_d3dTexture,
level,
NULL,
m_data[level],
getFormatNumBlocks(w, getFormat()) * getBlockSize(),
computeImageByteSize(w, h, 1, getFormat()));
}
}
void D3D11RendererTexture2D::bind(PxU32 samplerIndex, PxU32 flags)
{
if (flags)
{
if (m_d3dSRV)
{
if (flags & BIND_VERTEX)
m_d3dDeviceContext.VSSetShaderResources(samplerIndex, 1, &m_d3dSRV);
if (flags & BIND_GEOMETRY)
m_d3dDeviceContext.GSSetShaderResources(samplerIndex, 1, &m_d3dSRV);
if (flags & BIND_PIXEL)
m_d3dDeviceContext.PSSetShaderResources(samplerIndex, 1, &m_d3dSRV);
if (flags & BIND_HULL)
m_d3dDeviceContext.HSSetShaderResources(samplerIndex, 1, &m_d3dSRV);
if (flags & BIND_DOMAIN)
m_d3dDeviceContext.DSSetShaderResources(samplerIndex, 1, &m_d3dSRV);
}
if (m_d3dSamplerState)
{
if (flags & BIND_VERTEX)
m_d3dDeviceContext.VSSetSamplers(samplerIndex, 1, &m_d3dSamplerState);
if (flags & BIND_GEOMETRY)
m_d3dDeviceContext.GSSetSamplers(samplerIndex, 1, &m_d3dSamplerState);
if (flags & BIND_PIXEL)
m_d3dDeviceContext.PSSetSamplers(samplerIndex, 1, &m_d3dSamplerState);
if (flags & BIND_HULL)
m_d3dDeviceContext.HSSetSamplers(samplerIndex, 1, &m_d3dSamplerState);
if (flags & BIND_DOMAIN)
m_d3dDeviceContext.DSSetSamplers(samplerIndex, 1, &m_d3dSamplerState);
}
}
else
{
ID3D11ShaderResourceView* nullResources[] = { NULL };
m_d3dDeviceContext.VSSetShaderResources(samplerIndex, 1, nullResources);
m_d3dDeviceContext.GSSetShaderResources(samplerIndex, 1, nullResources);
m_d3dDeviceContext.PSSetShaderResources(samplerIndex, 1, nullResources);
m_d3dDeviceContext.HSSetShaderResources(samplerIndex, 1, nullResources);
m_d3dDeviceContext.DSSetShaderResources(samplerIndex, 1, nullResources);
ID3D11SamplerState* nullSamplers[] = { NULL };
m_d3dDeviceContext.VSSetSamplers(samplerIndex, 1, nullSamplers);
m_d3dDeviceContext.GSSetSamplers(samplerIndex, 1, nullSamplers);
m_d3dDeviceContext.PSSetSamplers(samplerIndex, 1, nullSamplers);
m_d3dDeviceContext.HSSetSamplers(samplerIndex, 1, nullSamplers);
m_d3dDeviceContext.DSSetSamplers(samplerIndex, 1, nullSamplers);
}
}
void D3D11RendererTexture2D::onDeviceLost(void)
{
dxSafeRelease(m_d3dTexture);
dxSafeRelease(m_d3dSamplerState);
dxSafeRelease(m_d3dSRV);
dxSafeRelease(m_d3dRTV);
dxSafeRelease(m_d3dDSV);
}
void D3D11RendererTexture2D::onDeviceReset(void)
{
HRESULT result = S_OK;
if (!m_d3dTexture)
{
D3D11_SUBRESOURCE_DATA* pData = isDepthStencilFormat(getFormat()) ? NULL : m_resourceData;
result = m_d3dDevice.CreateTexture2D(&m_d3dTextureDesc, pData, &m_d3dTexture);
RENDERER_ASSERT(SUCCEEDED(result), "Unable to create D3D11 Texture.");
}
if (SUCCEEDED(result) && !m_d3dSamplerState)
{
result = m_d3dDevice.CreateSamplerState(&m_d3dSamplerDesc, &m_d3dSamplerState);
RENDERER_ASSERT(SUCCEEDED(result), "Unable to create D3D11 Sampler.");
}
if (SUCCEEDED(result) && m_d3dTextureDesc.BindFlags & D3D11_BIND_SHADER_RESOURCE && !m_d3dSRV)
{
result = m_d3dDevice.CreateShaderResourceView(m_d3dTexture, &m_d3dSRVDesc, &m_d3dSRV);
RENDERER_ASSERT(SUCCEEDED(result), "Unable to create D3D11 Shader Resource View.");
}
if (SUCCEEDED(result) && m_d3dTextureDesc.BindFlags & D3D11_BIND_RENDER_TARGET && !m_d3dRTV)
{
result = m_d3dDevice.CreateRenderTargetView(m_d3dTexture, &m_d3dRTVDesc, &m_d3dRTV);
RENDERER_ASSERT(SUCCEEDED(result), "Unable to create D3D11 Render Target View.");
}
if (SUCCEEDED(result) && m_d3dTextureDesc.BindFlags & D3D11_BIND_DEPTH_STENCIL && !m_d3dDSV)
{
result = m_d3dDevice.CreateDepthStencilView(m_d3dTexture, &m_d3dDSVDesc, &m_d3dDSV);
RENDERER_ASSERT(SUCCEEDED(result), "Unable to create D3D11 Depth Stencil View.");
}
}
void D3D11RendererTexture2D::loadTextureDesc(const RendererTexture2DDesc& desc)
{
RENDERER_ASSERT(desc.depth == 1, "Invalid depth for 2D Texture!");
//memset(&m_d3dTextureDesc, 0, sizeof(m_d3dTextureDesc));
m_d3dTextureDesc = D3D11_TEXTURE2D_DESC();
m_d3dTextureDesc.Width = getWidth();
m_d3dTextureDesc.Height = getHeight();
m_d3dTextureDesc.MipLevels = getNumLevels();
m_d3dTextureDesc.ArraySize = 1;
m_d3dTextureDesc.Format = getD3D11TextureFormat(desc.format);
m_d3dTextureDesc.SampleDesc.Count = 1;
m_d3dTextureDesc.SampleDesc.Quality = 0;
m_d3dTextureDesc.CPUAccessFlags = 0;
m_d3dTextureDesc.Usage = D3D11_USAGE_DEFAULT;
m_d3dTextureDesc.BindFlags = D3D11_BIND_SHADER_RESOURCE;
loadResourceDesc(desc);
if (isDepthStencilFormat(desc.format))
{
m_d3dTextureDesc.BindFlags |= D3D11_BIND_DEPTH_STENCIL;
m_d3dTextureDesc.CPUAccessFlags = 0;
m_d3dTextureDesc.Usage = D3D11_USAGE_DEFAULT;
loadDepthStencilDesc(desc);
}
else if (desc.renderTarget)
{
m_d3dTextureDesc.BindFlags |= D3D11_BIND_RENDER_TARGET;
m_d3dTextureDesc.CPUAccessFlags = 0;
m_d3dTextureDesc.Usage = D3D11_USAGE_DEFAULT;
loadTargetDesc(desc);
}
loadSamplerDesc(desc);
//if (m_d3dTextureDesc.CPUAccessFlags)
{
m_data = new PxU8*[getNumLevels()];
m_resourceData = new D3D11_SUBRESOURCE_DATA[getNumLevels()];
memset(m_data, 0, sizeof(PxU8)*getNumLevels());
memset(m_resourceData, 0, sizeof(D3D11_SUBRESOURCE_DATA)*getNumLevels());
for (PxU32 i = 0; i < desc.numLevels; i++)
{
PxU32 w = getLevelDimension(getWidth(), i);
PxU32 h = getLevelDimension(getHeight(), i);
PxU32 levelSize = computeImageByteSize(w, h, 1, desc.format);
m_data[i] = new PxU8[levelSize];
memset(m_data[i], 0, levelSize);
m_resourceData[i].pSysMem = m_data[i];
m_resourceData[i].SysMemPitch = levelSize / h;
m_resourceData[i].SysMemSlicePitch = 0;
}
}
}
void D3D11RendererTexture2D::loadSamplerDesc(const RendererTexture2DDesc& desc)
{
m_d3dSamplerDesc.Filter = getD3D11TextureFilter(desc.filter);
m_d3dSamplerDesc.AddressU = getD3D11TextureAddressing(desc.addressingU);
m_d3dSamplerDesc.AddressV = getD3D11TextureAddressing(desc.addressingV);
m_d3dSamplerDesc.AddressW = getD3D11TextureAddressing(desc.addressingW);
m_d3dSamplerDesc.MipLODBias = 0.f;
m_d3dSamplerDesc.MaxAnisotropy = 1;
m_d3dSamplerDesc.ComparisonFunc = D3D11_COMPARISON_ALWAYS;
m_d3dSamplerDesc.BorderColor[0] = m_d3dSamplerDesc.BorderColor[1] = m_d3dSamplerDesc.BorderColor[2] = m_d3dSamplerDesc.BorderColor[3] = 0.;
m_d3dSamplerDesc.MinLOD = 0;
if (desc.numLevels <= 1)
{
m_d3dSamplerDesc.MaxLOD = 0.;
}
else
{
m_d3dSamplerDesc.MaxLOD = D3D11_FLOAT32_MAX;
}
if(m_d3dDevice.GetFeatureLevel() <= D3D_FEATURE_LEVEL_9_3)
{
m_d3dSamplerDesc.MaxLOD = D3D11_FLOAT32_MAX;
}
}
void D3D11RendererTexture2D::loadResourceDesc(const RendererTexture2DDesc& desc)
{
m_d3dSRVDesc.Format = (m_d3dTextureDesc.Format == DXGI_FORMAT_R16_TYPELESS) ? DXGI_FORMAT_R16_UNORM : m_d3dTextureDesc.Format;
m_d3dSRVDesc.ViewDimension = D3D11_SRV_DIMENSION_TEXTURE2D;
m_d3dSRVDesc.Texture2D.MipLevels = m_d3dTextureDesc.MipLevels;
m_d3dSRVDesc.Texture2D.MostDetailedMip = 0;
//m_d3dSRVDesc.Texture2D.MostDetailedMip = m_d3dTextureDesc.MipLevels-1;
}
void D3D11RendererTexture2D::loadTargetDesc(const RendererTexture2DDesc& desc)
{
m_d3dRTVDesc = D3D11_RENDER_TARGET_VIEW_DESC();
m_d3dRTVDesc.Format = (m_d3dTextureDesc.Format == DXGI_FORMAT_R16_TYPELESS) ? DXGI_FORMAT_R16_UNORM : m_d3dTextureDesc.Format;
m_d3dRTVDesc.ViewDimension = D3D11_RTV_DIMENSION_TEXTURE2D;
m_d3dRTVDesc.Texture2D.MipSlice = 0;
}
void D3D11RendererTexture2D::loadDepthStencilDesc(const RendererTexture2DDesc& desc)
{
m_d3dDSVDesc = D3D11_DEPTH_STENCIL_VIEW_DESC();
m_d3dDSVDesc.Format = (m_d3dTextureDesc.Format == DXGI_FORMAT_R16_TYPELESS) ? DXGI_FORMAT_D16_UNORM : m_d3dTextureDesc.Format;
m_d3dDSVDesc.ViewDimension = D3D11_DSV_DIMENSION_TEXTURE2D;
m_d3dDSVDesc.Texture2D.MipSlice = 0;
}
#endif // #if defined(RENDERER_ENABLE_DIRECT3D11)
| [
"rystills@gmail.com"
] | rystills@gmail.com |
c2d9265231e6dc4af78e43b3a33ecbbeaad32233 | fd57ede0ba18642a730cc862c9e9059ec463320b | /av/media/libstagefright/CallbackDataSource.cpp | 9d0cb0b23e9eb99c2e1fc08320fe46de075c0c79 | [
"LicenseRef-scancode-unicode",
"Apache-2.0"
] | permissive | kailaisi/android-29-framwork | a0c706fc104d62ea5951ca113f868021c6029cd2 | b7090eebdd77595e43b61294725b41310496ff04 | refs/heads/master | 2023-04-27T14:18:52.579620 | 2021-03-08T13:05:27 | 2021-03-08T13:05:27 | 254,380,637 | 1 | 1 | null | 2023-04-15T12:22:31 | 2020-04-09T13:35:49 | C++ | UTF-8 | C++ | false | false | 6,021 | cpp | /*
* Copyright 2015 The Android Open Source Project
*
* 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.
*/
//#define LOG_NDEBUG 0
#define LOG_TAG "CallbackDataSource"
#include <utils/Log.h>
#include "include/CallbackDataSource.h"
#include <binder/IMemory.h>
#include <binder/IPCThreadState.h>
#include <media/IDataSource.h>
#include <media/stagefright/foundation/ADebug.h>
#include <algorithm>
namespace android {
CallbackDataSource::CallbackDataSource(
const sp<IDataSource>& binderDataSource)
: mIDataSource(binderDataSource),
mIsClosed(false) {
// Set up the buffer to read into.
mMemory = mIDataSource->getIMemory();
mName = String8::format("CallbackDataSource(%d->%d, %s)",
getpid(),
IPCThreadState::self()->getCallingPid(),
mIDataSource->toString().string());
}
CallbackDataSource::~CallbackDataSource() {
ALOGV("~CallbackDataSource");
close();
}
status_t CallbackDataSource::initCheck() const {
if (mMemory == NULL) {
return UNKNOWN_ERROR;
}
return OK;
}
ssize_t CallbackDataSource::readAt(off64_t offset, void* data, size_t size) {
if (mMemory == NULL || data == NULL) {
return -1;
}
// IDataSource can only read up to mMemory->size() bytes at a time, but this
// method should be able to read any number of bytes, so read in a loop.
size_t totalNumRead = 0;
size_t numLeft = size;
const size_t bufferSize = mMemory->size();
while (numLeft > 0) {
size_t numToRead = std::min(numLeft, bufferSize);
ssize_t numRead =
mIDataSource->readAt(offset + totalNumRead, numToRead);
// A negative return value represents an error. Pass it on.
if (numRead < 0) {
return numRead == ERROR_END_OF_STREAM && totalNumRead > 0 ? totalNumRead : numRead;
}
// A zero return value signals EOS. Return the bytes read so far.
if (numRead == 0) {
return totalNumRead;
}
if ((size_t)numRead > numToRead) {
return ERROR_OUT_OF_RANGE;
}
CHECK(numRead >= 0 && (size_t)numRead <= bufferSize);
memcpy(((uint8_t*)data) + totalNumRead, mMemory->pointer(), numRead);
numLeft -= numRead;
totalNumRead += numRead;
}
return totalNumRead;
}
status_t CallbackDataSource::getSize(off64_t *size) {
status_t err = mIDataSource->getSize(size);
if (err != OK) {
return err;
}
if (*size < 0) {
// IDataSource will set size to -1 to indicate unknown size, but
// DataSource returns ERROR_UNSUPPORTED for that.
return ERROR_UNSUPPORTED;
}
return OK;
}
uint32_t CallbackDataSource::flags() {
return mIDataSource->getFlags();
}
void CallbackDataSource::close() {
if (!mIsClosed) {
mIDataSource->close();
mIsClosed = true;
}
}
sp<IDataSource> CallbackDataSource::getIDataSource() const {
return mIDataSource;
}
TinyCacheSource::TinyCacheSource(const sp<DataSource>& source)
: mSource(source), mCachedOffset(0), mCachedSize(0) {
mName = String8::format("TinyCacheSource(%s)", mSource->toString().string());
}
status_t TinyCacheSource::initCheck() const {
return mSource->initCheck();
}
ssize_t TinyCacheSource::readAt(off64_t offset, void* data, size_t size) {
// Check if the cache satisfies the read.
if (mCachedOffset <= offset
&& offset < (off64_t) (mCachedOffset + mCachedSize)) {
if (offset + size <= mCachedOffset + mCachedSize) {
memcpy(data, &mCache[offset - mCachedOffset], size);
return size;
} else {
// If the cache hits only partially, flush the cache and read the
// remainder.
// This value is guaranteed to be greater than 0 because of the
// enclosing if statement.
const ssize_t remaining = mCachedOffset + mCachedSize - offset;
memcpy(data, &mCache[offset - mCachedOffset], remaining);
const ssize_t readMore = readAt(offset + remaining,
(uint8_t*)data + remaining, size - remaining);
if (readMore < 0) {
return readMore;
}
return remaining + readMore;
}
}
if (size >= kCacheSize) {
return mSource->readAt(offset, data, size);
}
// Fill the cache and copy to the caller.
const ssize_t numRead = mSource->readAt(offset, mCache, kCacheSize);
if (numRead <= 0) {
// Flush cache on error
mCachedSize = 0;
mCachedOffset = 0;
return numRead;
}
if ((size_t)numRead > kCacheSize) {
// Flush cache on error
mCachedSize = 0;
mCachedOffset = 0;
return ERROR_OUT_OF_RANGE;
}
mCachedSize = numRead;
mCachedOffset = offset;
CHECK(mCachedSize <= kCacheSize && mCachedOffset >= 0);
const size_t numToReturn = std::min(size, (size_t)numRead);
memcpy(data, mCache, numToReturn);
return numToReturn;
}
status_t TinyCacheSource::getSize(off64_t *size) {
return mSource->getSize(size);
}
uint32_t TinyCacheSource::flags() {
return mSource->flags();
}
sp<IDataSource> TinyCacheSource::getIDataSource() const {
return mSource->getIDataSource();
}
} // namespace android
| [
"541018378@qq.com"
] | 541018378@qq.com |
fb15499c798598c0b71b63d13ceae90710579ca3 | 6d33b1bb5a0933297ed54ecc543be2d82921c048 | /Exp/mpctest-/NewFrame.cpp | 6379e53dcfb2318a8e0357859838a0c2a3e9d3c5 | [] | no_license | mapic91/MpcAsfTool | 404ebc20dcf5309a5d28775494e7f10bcc4e2659 | 4b7aa5df0feeac97540ea5f870304d4a61068d42 | refs/heads/master | 2022-11-29T20:01:04.905305 | 2022-11-17T13:38:38 | 2022-11-17T13:38:38 | 32,773,531 | 12 | 12 | null | null | null | null | UTF-8 | C++ | false | false | 2,848 | cpp | #include "NewFrame.h"
//(*InternalHeaders(NewFrame)
#include <wx/intl.h>
#include <wx/string.h>
//*)
//(*IdInit(NewFrame)
const long NewFrame::ID_STATICBITMAP1 = wxNewId();
const long NewFrame::ID_BUTTON1 = wxNewId();
const long NewFrame::ID_BUTTON2 = wxNewId();
const long NewFrame::ID_BUTTON3 = wxNewId();
const long NewFrame::ID_STATICTEXT1 = wxNewId();
const long NewFrame::ID_PANEL1 = wxNewId();
//*)
BEGIN_EVENT_TABLE(NewFrame,wxFrame)
//(*EventTable(NewFrame)
//*)
END_EVENT_TABLE()
NewFrame::NewFrame(wxWindow* parent,wxWindowID id,const wxPoint& pos,const wxSize& size)
{
//(*Initialize(NewFrame)
wxBoxSizer* BoxSizer4;
wxBoxSizer* BoxSizer2;
wxBoxSizer* BoxSizer1;
wxBoxSizer* BoxSizer3;
Create(parent, wxID_ANY, _("Choose Mpc file.."), wxDefaultPosition, wxDefaultSize, wxDEFAULT_FRAME_STYLE, _T("wxID_ANY"));
Panel1 = new wxPanel(this, ID_PANEL1, wxPoint(240,168), wxDefaultSize, wxTAB_TRAVERSAL, _T("ID_PANEL1"));
BoxSizer1 = new wxBoxSizer(wxHORIZONTAL);
BoxSizer2 = new wxBoxSizer(wxVERTICAL);
BoxSizer3 = new wxBoxSizer(wxHORIZONTAL);
bitmap_view = new wxStaticBitmap(Panel1, ID_STATICBITMAP1, wxNullBitmap, wxDefaultPosition, wxDefaultSize, wxSIMPLE_BORDER, _T("ID_STATICBITMAP1"));
BoxSizer3->Add(bitmap_view, 1, wxALL|wxEXPAND|wxALIGN_CENTER_HORIZONTAL|wxALIGN_CENTER_VERTICAL, 5);
BoxSizer2->Add(BoxSizer3, 1, wxALL|wxEXPAND|wxALIGN_CENTER_HORIZONTAL|wxALIGN_CENTER_VERTICAL, 5);
BoxSizer4 = new wxBoxSizer(wxHORIZONTAL);
Button_mpcfile = new wxButton(Panel1, ID_BUTTON1, _("MpcFile..."), wxDefaultPosition, wxDefaultSize, 0, wxDefaultValidator, _T("ID_BUTTON1"));
BoxSizer4->Add(Button_mpcfile, 0, wxALL|wxALIGN_CENTER_HORIZONTAL|wxALIGN_CENTER_VERTICAL, 5);
Button_previous = new wxButton(Panel1, ID_BUTTON2, _("Previous"), wxDefaultPosition, wxDefaultSize, 0, wxDefaultValidator, _T("ID_BUTTON2"));
BoxSizer4->Add(Button_previous, 0, wxALL|wxALIGN_CENTER_HORIZONTAL|wxALIGN_CENTER_VERTICAL, 5);
Button_next = new wxButton(Panel1, ID_BUTTON3, _("Next"), wxDefaultPosition, wxDefaultSize, 0, wxDefaultValidator, _T("ID_BUTTON3"));
BoxSizer4->Add(Button_next, 0, wxALL|wxALIGN_CENTER_HORIZONTAL|wxALIGN_CENTER_VERTICAL, 5);
BoxSizer4->Add(0,0,1, wxALL|wxALIGN_CENTER_HORIZONTAL|wxALIGN_CENTER_VERTICAL, 5);
StaticText_current_pic = new wxStaticText(Panel1, ID_STATICTEXT1, _("0"), wxDefaultPosition, wxDefaultSize, 0, _T("ID_STATICTEXT1"));
BoxSizer4->Add(StaticText_current_pic, 0, wxALL|wxALIGN_CENTER_HORIZONTAL|wxALIGN_CENTER_VERTICAL, 5);
BoxSizer2->Add(BoxSizer4, 0, wxALL|wxEXPAND|wxALIGN_CENTER_HORIZONTAL|wxALIGN_CENTER_VERTICAL, 5);
BoxSizer1->Add(BoxSizer2, 1, wxALL|wxEXPAND|wxALIGN_CENTER_HORIZONTAL|wxALIGN_CENTER_VERTICAL, 5);
Panel1->SetSizer(BoxSizer1);
BoxSizer1->Fit(Panel1);
BoxSizer1->SetSizeHints(Panel1);
//*)
}
NewFrame::~NewFrame()
{
//(*Destroy(NewFrame)
//*)
}
| [
"mapic91@163.com"
] | mapic91@163.com |
6ff9b343e74517063d95b3de7ec6e2b944f442e5 | a010029f9e059a4976405827fbc0b76819c7b611 | /chapter_6/c_6_22.cpp | f55245e59dd99430263a1ccd1b3d73f770d84ca9 | [] | no_license | Aaron-Chan/CppPrimer | 976106b8d2e8f564ec013022b088e16ca58f25fb | 0d7aff8d59d86ed7652caa3aad6a070c9bca84cd | refs/heads/master | 2021-02-05T04:36:17.770246 | 2020-03-14T06:35:02 | 2020-03-14T06:35:02 | 243,745,895 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 377 | cpp | #include <iostream>
#include <string>
#include <cctype>
using namespace std;
void swap(int *&p1,int *&p2){
int *temp = p1;
p1 = p2;
p2 = temp;
}
int main(){
int i = 10;
int j = 20;
int *p1 = &i;
int *p2 = &j;
swap(p1,p2);
cout << "i "<<i<<endl;
cout << "j "<<j<<endl;
cout << "p1 "<<*p1<<endl;
cout << "p2 "<<*p2<<endl;
return 1;
} | [
"1903682265@qq.com"
] | 1903682265@qq.com |
2d547e462308ddc3741c0dc954de18488700fa88 | 9608884c88e8915eca6235773a22ebb15aff8445 | /Raiden Project/ModuleStageClear1.h | 99a43a8de28e6252f867b06e3657e8640c243229 | [] | no_license | retsnom9/idk | 16e20a6027deaf2578e81757132706a33e2b318f | df829daa9d181319411396cb155a418250b50f35 | refs/heads/master | 2021-01-22T09:10:05.507972 | 2017-05-10T22:50:18 | 2017-05-10T22:50:18 | 81,935,029 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 495 | h | #ifndef __MODULESTAGECLEAR__
#define __MODULESTAGECLEAR__
#include "Globals.h"
#include "Module.h"
#include "SDL/include/SDL.h"
#pragma comment( lib, "SDL/libx86/SDL2.lib" )
#pragma comment( lib, "SDL/libx86/SDL2main.lib" )
class ModuleStageClear1 : public Module
{
public:
ModuleStageClear1();
~ModuleStageClear1();
bool Init();
update_status Update();
bool CleanUp();
public:
SDL_Rect ground;
SDL_Texture *StageClear1;
int xmap = 0;
int ymap = 0;
};
#endif //__MODULESTAGECLEAR__ | [
"retsnom797@gmail.com"
] | retsnom797@gmail.com |
fc5f554870739f7382a7811d161268f9029458f6 | c702357d201235f5a76deb90133dbc3a13c64736 | /llvm/tools/clang/include/clang/Basic/.svn/text-base/SourceLocation.h.svn-base | 36baf5feecce25591d444eff6f6b8604613f4b97 | [
"NCSA"
] | permissive | aaasz/SHP | ab77e5be297c2e23a462c385b9e7332e38765a14 | c03ee7a26a93b2396b7c4f9179b1b2deb81951d3 | refs/heads/master | 2021-01-18T11:00:14.367480 | 2010-01-17T23:10:18 | 2010-01-17T23:10:18 | 549,107 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 9,676 | //===--- SourceLocation.h - Compact identifier for Source Files -*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// This file defines the SourceLocation class.
//
//===----------------------------------------------------------------------===//
#ifndef LLVM_CLANG_SOURCELOCATION_H
#define LLVM_CLANG_SOURCELOCATION_H
#include <utility>
#include <cassert>
namespace llvm {
class MemoryBuffer;
class raw_ostream;
template <typename T> struct DenseMapInfo;
template <typename T> struct isPodLike;
}
namespace clang {
class SourceManager;
class FileEntry;
/// FileID - This is an opaque identifier used by SourceManager which refers to
/// a source file (MemoryBuffer) along with its #include path and #line data.
///
class FileID {
/// ID - Opaque identifier, 0 is "invalid".
unsigned ID;
public:
FileID() : ID(0) {}
bool isInvalid() const { return ID == 0; }
bool operator==(const FileID &RHS) const { return ID == RHS.ID; }
bool operator<(const FileID &RHS) const { return ID < RHS.ID; }
bool operator<=(const FileID &RHS) const { return ID <= RHS.ID; }
bool operator!=(const FileID &RHS) const { return !(*this == RHS); }
bool operator>(const FileID &RHS) const { return RHS < *this; }
bool operator>=(const FileID &RHS) const { return RHS <= *this; }
static FileID getSentinel() { return get(~0U); }
unsigned getHashValue() const { return ID; }
private:
friend class SourceManager;
static FileID get(unsigned V) {
FileID F;
F.ID = V;
return F;
}
unsigned getOpaqueValue() const { return ID; }
};
/// SourceLocation - This is a carefully crafted 32-bit identifier that encodes
/// a full include stack, line and column number information for a position in
/// an input translation unit.
class SourceLocation {
unsigned ID;
friend class SourceManager;
enum {
MacroIDBit = 1U << 31
};
public:
SourceLocation() : ID(0) {} // 0 is an invalid FileID.
bool isFileID() const { return (ID & MacroIDBit) == 0; }
bool isMacroID() const { return (ID & MacroIDBit) != 0; }
/// isValid - Return true if this is a valid SourceLocation object. Invalid
/// SourceLocations are often used when events have no corresponding location
/// in the source (e.g. a diagnostic is required for a command line option).
///
bool isValid() const { return ID != 0; }
bool isInvalid() const { return ID == 0; }
private:
/// getOffset - Return the index for SourceManager's SLocEntryTable table,
/// note that this is not an index *into* it though.
unsigned getOffset() const {
return ID & ~MacroIDBit;
}
static SourceLocation getFileLoc(unsigned ID) {
assert((ID & MacroIDBit) == 0 && "Ran out of source locations!");
SourceLocation L;
L.ID = ID;
return L;
}
static SourceLocation getMacroLoc(unsigned ID) {
assert((ID & MacroIDBit) == 0 && "Ran out of source locations!");
SourceLocation L;
L.ID = MacroIDBit | ID;
return L;
}
public:
/// getFileLocWithOffset - Return a source location with the specified offset
/// from this file SourceLocation.
SourceLocation getFileLocWithOffset(int Offset) const {
assert(((getOffset()+Offset) & MacroIDBit) == 0 && "invalid location");
SourceLocation L;
L.ID = ID+Offset;
return L;
}
/// getRawEncoding - When a SourceLocation itself cannot be used, this returns
/// an (opaque) 32-bit integer encoding for it. This should only be passed
/// to SourceLocation::getFromRawEncoding, it should not be inspected
/// directly.
unsigned getRawEncoding() const { return ID; }
/// getFromRawEncoding - Turn a raw encoding of a SourceLocation object into
/// a real SourceLocation.
static SourceLocation getFromRawEncoding(unsigned Encoding) {
SourceLocation X;
X.ID = Encoding;
return X;
}
void print(llvm::raw_ostream &OS, const SourceManager &SM) const;
void dump(const SourceManager &SM) const;
};
inline bool operator==(const SourceLocation &LHS, const SourceLocation &RHS) {
return LHS.getRawEncoding() == RHS.getRawEncoding();
}
inline bool operator!=(const SourceLocation &LHS, const SourceLocation &RHS) {
return !(LHS == RHS);
}
inline bool operator<(const SourceLocation &LHS, const SourceLocation &RHS) {
return LHS.getRawEncoding() < RHS.getRawEncoding();
}
/// SourceRange - a trival tuple used to represent a source range.
class SourceRange {
SourceLocation B;
SourceLocation E;
public:
SourceRange(): B(SourceLocation()), E(SourceLocation()) {}
SourceRange(SourceLocation loc) : B(loc), E(loc) {}
SourceRange(SourceLocation begin, SourceLocation end) : B(begin), E(end) {}
SourceLocation getBegin() const { return B; }
SourceLocation getEnd() const { return E; }
void setBegin(SourceLocation b) { B = b; }
void setEnd(SourceLocation e) { E = e; }
bool isValid() const { return B.isValid() && E.isValid(); }
bool operator==(const SourceRange &X) const {
return B == X.B && E == X.E;
}
bool operator!=(const SourceRange &X) const {
return B != X.B || E != X.E;
}
};
/// FullSourceLoc - A SourceLocation and its associated SourceManager. Useful
/// for argument passing to functions that expect both objects.
class FullSourceLoc : public SourceLocation {
SourceManager* SrcMgr;
public:
/// Creates a FullSourceLoc where isValid() returns false.
explicit FullSourceLoc() : SrcMgr((SourceManager*) 0) {}
explicit FullSourceLoc(SourceLocation Loc, SourceManager &SM)
: SourceLocation(Loc), SrcMgr(&SM) {}
SourceManager &getManager() {
assert(SrcMgr && "SourceManager is NULL.");
return *SrcMgr;
}
const SourceManager &getManager() const {
assert(SrcMgr && "SourceManager is NULL.");
return *SrcMgr;
}
FileID getFileID() const;
FullSourceLoc getInstantiationLoc() const;
FullSourceLoc getSpellingLoc() const;
unsigned getInstantiationLineNumber() const;
unsigned getInstantiationColumnNumber() const;
unsigned getSpellingLineNumber() const;
unsigned getSpellingColumnNumber() const;
const char *getCharacterData() const;
const llvm::MemoryBuffer* getBuffer() const;
/// getBufferData - Return a pointer to the start and end of the source buffer
/// data for the specified FileID.
std::pair<const char*, const char*> getBufferData() const;
/// getDecomposedLoc - Decompose the specified location into a raw FileID +
/// Offset pair. The first element is the FileID, the second is the
/// offset from the start of the buffer of the location.
std::pair<FileID, unsigned> getDecomposedLoc() const;
bool isInSystemHeader() const;
/// Prints information about this FullSourceLoc to stderr. Useful for
/// debugging.
void dump() const { SourceLocation::dump(*SrcMgr); }
friend inline bool
operator==(const FullSourceLoc &LHS, const FullSourceLoc &RHS) {
return LHS.getRawEncoding() == RHS.getRawEncoding() &&
LHS.SrcMgr == RHS.SrcMgr;
}
friend inline bool
operator!=(const FullSourceLoc &LHS, const FullSourceLoc &RHS) {
return !(LHS == RHS);
}
};
/// PresumedLoc - This class represents an unpacked "presumed" location which
/// can be presented to the user. A 'presumed' location can be modified by
/// #line and GNU line marker directives and is always the instantiation point
/// of a normal location.
///
/// You can get a PresumedLoc from a SourceLocation with SourceManager.
class PresumedLoc {
const char *Filename;
unsigned Line, Col;
SourceLocation IncludeLoc;
public:
PresumedLoc() : Filename(0) {}
PresumedLoc(const char *FN, unsigned Ln, unsigned Co, SourceLocation IL)
: Filename(FN), Line(Ln), Col(Co), IncludeLoc(IL) {
}
/// isInvalid - Return true if this object is invalid or uninitialized. This
/// occurs when created with invalid source locations or when walking off
/// the top of a #include stack.
bool isInvalid() const { return Filename == 0; }
bool isValid() const { return Filename != 0; }
/// getFilename - Return the presumed filename of this location. This can be
/// affected by #line etc.
const char *getFilename() const { return Filename; }
/// getLine - Return the presumed line number of this location. This can be
/// affected by #line etc.
unsigned getLine() const { return Line; }
/// getColumn - Return the presumed column number of this location. This can
/// not be affected by #line, but is packaged here for convenience.
unsigned getColumn() const { return Col; }
/// getIncludeLoc - Return the presumed include location of this location.
/// This can be affected by GNU linemarker directives.
SourceLocation getIncludeLoc() const { return IncludeLoc; }
};
} // end namespace clang
namespace llvm {
/// Define DenseMapInfo so that FileID's can be used as keys in DenseMap and
/// DenseSets.
template <>
struct DenseMapInfo<clang::FileID> {
static inline clang::FileID getEmptyKey() {
return clang::FileID();
}
static inline clang::FileID getTombstoneKey() {
return clang::FileID::getSentinel();
}
static unsigned getHashValue(clang::FileID S) {
return S.getHashValue();
}
static bool isEqual(clang::FileID LHS, clang::FileID RHS) {
return LHS == RHS;
}
};
template <>
struct isPodLike<clang::SourceLocation> { static const bool value = true; };
template <>
struct isPodLike<clang::FileID> { static const bool value = true; };
} // end namespace llvm
#endif
| [
"aaa.szeke@gmail.com"
] | aaa.szeke@gmail.com | |
40fdcd8d3a5f29f03937b4ccfef932eada919a6b | 932a01d550331468cc4ca42910faad1485109815 | /src/agentTask.cc | 1cbf7ecfd54269b3f68cf093949deb882a4c323f | [] | no_license | eternally123/relay-server | 6c75646e3d916b4040bd2c1caeab505d8f0914c5 | 584374dfaec3b5552a1a31160b6a8d34bb97adb3 | refs/heads/master | 2020-07-29T08:26:43.595026 | 2019-09-20T07:20:41 | 2019-09-20T07:20:41 | 209,730,160 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 666 | cc | #include <agentTask.hpp>
#include <buffer.hpp>
#include "relayServer.hpp"
AgentTask::AgentTask(int srcId, int destId, int bufSize) {
m_srcId = srcId;
m_destId = destId;
m_bufSize = bufSize;
m_buf = new char[bufSize];
}
AgentTask::~AgentTask() {
if (m_buf != NULL)
delete[] m_buf;
}
int AgentTask::getDestId() {
return m_destId;
}
int AgentTask::generateTask(char *start, char *end) {
if ((end - start) != m_bufSize)
return -1;
memcpy(m_buf, start, end - start);
return end - start;
}
int AgentTask::sendTaskToBuffer(Buffer *buffer) {
memcpy(buffer->m_writeStart, m_buf, m_bufSize);
return m_bufSize;
} | [
"hbag666@163.com"
] | hbag666@163.com |
05d1d90f11ba134c371eb7d1652f647ba5099231 | 2e62eded4a05a565aa67c2557fed94d2dd2965cf | /duilib/proj_menu/main.cpp | e773e2b9e4e9ecd6f48f8f24c30dd779828f83d6 | [] | no_license | jielmn/MyProjects | f34b308a1495f02e1cdbd887ee0faf3f103a8df8 | 0f0519991d0fdbb98ad0ef86e8bd472c2176a2aa | refs/heads/master | 2021-06-03T11:56:40.884186 | 2020-05-29T09:47:55 | 2020-05-29T09:47:55 | 110,639,886 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 1,610 | cpp | // win32_1.cpp : 定义应用程序的入口点。
//
#include "Windows.h"
#include "UIlib.h"
using namespace DuiLib;
#include "MenuUI.h"
#pragma comment(lib,"User32.lib")
class CDuiFrameWnd : public WindowImplBase
{
public:
virtual LPCTSTR GetWindowClassName() const { return _T("DUIMainFrame"); }
virtual CDuiString GetSkinFile() { return _T("mainframe_menu.xml"); }
virtual CDuiString GetSkinFolder() { return _T("res\\proj_menu_res"); }
virtual void Notify(TNotifyUI& msg) {
if (msg.sType == _T("click"))
{
if (msg.pSender->GetName() == _T("btnHello"))
{
POINT pt = { msg.ptMouse.x, msg.ptMouse.y };
CDuiMenu *pMenu = new CDuiMenu(_T("menu.xml"), msg.pSender);
pMenu->Init(*this, pt);
pMenu->ShowWindow(TRUE);
return;
}
else {
CDuiString name = msg.pSender->GetName();
int a = 100;
//::MessageBox(0, "click open", "", 0);
}
}
else if (msg.sType == "menu_Open") {
::MessageBox( 0, "click open", "", 0);
}
else if (msg.sType == "menu_Mark") {
::MessageBox(0, "click MARK", "", 0);
}
else if (msg.sType == "menu_Delete") {
::MessageBox(0, "click DELETE", "", 0);
}
WindowImplBase::Notify(msg);
}
};
int APIENTRY wWinMain(_In_ HINSTANCE hInstance,
_In_opt_ HINSTANCE hPrevInstance,
_In_ LPWSTR lpCmdLine,
_In_ int nCmdShow)
{
CPaintManagerUI::SetInstance(hInstance);
CDuiFrameWnd duiFrame;
duiFrame.Create(NULL, _T("DUIWnd"), UI_WNDSTYLE_FRAME, WS_EX_WINDOWEDGE);
duiFrame.CenterWindow();
duiFrame.ShowModal();
return 0;
}
| [
"jielmn@aliyun.com"
] | jielmn@aliyun.com |
50da3294d91ab1fbb442d857061ee9fe80114e11 | 09c65e31aa1dcc4ccc1bd26f1479f070690625df | /Pokemon Class/Versions/PokemonClassV1.1/PokemonClass.cpp | d5f6c793eec2060275e7fa632b1026ac5d02701c | [] | no_license | CSC17B-SPRING-2021/Pokemon | a0bd32528dcf767826ff8ddd500aa8ee9cdd604c | a51f5d927f2b674462b2066c986de65cb9a4635c | refs/heads/main | 2023-05-13T12:23:10.279201 | 2021-06-09T04:44:12 | 2021-06-09T04:44:12 | 346,554,959 | 1 | 0 | null | 2021-05-06T05:39:29 | 2021-03-11T02:33:20 | JavaScript | UTF-8 | C++ | false | false | 2,964 | cpp | #include "PokemonClass.h"
#include "iostream"
using namespace std;
//Default Pikachu constructor
Pikachu::Pikachu(){
pokeName = "Pikachu";
pokeType = "Electric";
healthStat = 35;
baseAttack = 55;
baseSpeed = 40;
baseDef = 30;
baseSpecial = 50;
pokemonNum = 025;
};
//Defulat Charmander constrcutor
Charmander::Charmander(){
pokeName = "Charmander";
pokeType = "Fire";
healthStat = 39;
baseAttack = 52;
baseDef = 43;
baseSpeed = 65;
baseSpecial = 50;
pokemonNum = 005;
};
//Default Squirtle constructor
Squirtle::Squirtle(){
pokeName = "Squirtle";
pokeType = "Water";
healthStat = 44;
baseAttack = 48;
baseDef = 65;
baseSpeed = 43;
baseSpecial = 50;
pokemonNum = 007;
};
Rattata::Rattata(){
pokeName = "Rattata";
pokeType = "Normal";
healthStat = 30;
baseAttack = 56;
baseDef = 35;
baseSpeed = 72;
baseSpecial = 25;
pokemonNum = 19;
};
Spearow::Spearow(){
pokeName = "Spearow";
pokeType = "Flying/Normal";
healthStat = 40;
baseAttack = 60;
baseDef = 30;
baseSpeed = 70;
baseSpecial = 31;
pokemonNum = 021;
};
Pidgey::Pidgey(){
pokeName = "Pidgey";
pokeType = "Flying";
healthStat = 40;
baseAttack = 45;
baseDef = 40;
baseSpeed = 56;
baseSpecial = 35;
pokemonNum = 017;
};
Bulbasaur::Bulbasaur(){
pokeName = "Bulbasaur";
pokeType = "Grass/Poison";
healthStat = 45;
baseAttack = 49;
baseDef = 49;
baseSpeed = 45;
baseSpecial = 65;
pokemonNum = 001;
};
Weedle::Weedle(){
pokeName = "Weedle";
pokeType = "Bug/Poison";
healthStat = 40;
baseAttack = 35;
baseDef = 30;
baseSpeed = 50;
baseSpecial = 20;
pokemonNum = 013;
};
Onyx::Onyx(){
pokeName = "Onyx";
pokeType = "Rock/Ground";
healthStat = 35;
baseAttack = 45;
baseDef = 160;
baseSpeed = 70;
baseSpecial = 30;
pokemonNum = 95;
};
NidoranMale::NidoranMale(){
pokeName = "NidoranMale";
pokeType = "Posion";
//gender = "Male";
healthStat = 46;
baseAttack = 57;
baseDef = 40;
baseSpeed = 50;
baseSpecial = 40;
pokemonNum = 032;
};
NidoranFemale::NidoranFemale(){
pokeName = "NidoranFemale";
pokeType = "Posion";
//gender = "Female";
healthStat = 55;
baseAttack = 47;
baseDef = 52;
baseSpeed = 41;
baseSpecial = 40;
pokemonNum = 030;
};
Caterpie::Caterpie(){
pokeName = "Caterpie";
pokeType = "Bug";
healthStat = 45 ;
baseAttack = 30;
baseDef = 35;
baseSpeed = 45;
baseSpecial = 20;
pokemonNum = 010;
};
Geodude::Geodude(){
pokeName = "Geodude";
pokeType = "Rock/Ground";
healthStat = 40 ;
baseAttack = 80;
baseDef = 100;
baseSpeed = 20;
baseSpecial = 30;
pokemonNum = 074;
};
//PokemonClass function to display pokemon information
void PokemonClass::pokemonInfo(){
cout << pokeName << endl;
cout <<"No." << pokemonNum << endl;
cout << pokeType << endl;
cout << "Health: " << healthStat << endl;
cout << "Attack: " << baseAttack << endl;
cout << "Speed: " << baseSpeed << endl;
};
| [
"yuhuntter@gmail.com"
] | yuhuntter@gmail.com |
6f44de34a37b69531c96516be863f97b8690327c | 0b9f6534a99ff551f0006df78a24e8af30340580 | /Source/BackupFiles/KR_Hedge/ChartSHM/SaveChart.h | 096eff77cc48b0efebfbc2b4bcbb92efeebb8d7a | [] | no_license | jayirum/ChartProjSvr | 9bac49865d1e081de0cbd7559d0d2cbdd26279c2 | d69edfcb3ac3698e1bdfcf5862d5e63bb305cb52 | refs/heads/master | 2020-03-24T03:22:18.176911 | 2019-07-05T01:38:03 | 2019-07-05T01:38:03 | 142,416,528 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 528 | h | #pragma once
#include "../../IRUM_UTIL/BaseThread.h"
#include "../../IRUM_UTIL/sharedmem.h"
#include "../../IRUM_UTIL/Screwdb.h"
class CSaveChart : public CBaseThread
{
public:
CSaveChart(int chartTp, char* pzConfig);
~CSaveChart();
BOOL Initialize();
virtual VOID ThreadFunc();
BOOL LoadShm();
BOOL LoadShmWrapper();
VOID DBSave();
VOID DBSaveWrapper();
private:
int m_nChartTp;
CDBPool *m_pDBPool;
CSharedMem m_shm, m_lastShm;
char m_zConfig[_MAX_PATH];
char m_zMsg[1024];
BOOL m_bContinue;
};
| [
"jay.bwkim@gmail.com"
] | jay.bwkim@gmail.com |
99343bcc6f39494f77c2003e958c2aea46b6fd29 | 2c65ca2f5307cf56bd0039f5b6f2e236862e963f | /R_DP/coin_change_total.cpp | ac16a6f74ea55b47f6957d04137b265c095a889b | [] | no_license | aaryan6789/cppSpace | e0af567cb37f2a151ad764f73221ec59fbefc491 | 53d79178e44df70d00c2039e0326a6be47ad14e9 | refs/heads/master | 2021-06-25T12:24:57.939582 | 2021-04-01T18:50:20 | 2021-04-01T18:50:20 | 216,731,462 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,175 | cpp | #include "_r_dp.h"
/** LeetCode M | 322 | CTCI
*
Suppose you are given the coins 1 cent, 5 cents, and 10 cents with N = 8 cents,
what are the total number of permutations of the coins you can arrange to obtain 8 cents.
Input : N=8 Coins : 1, 5, 10
Output : 2
Explanation: 1 way: 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 = 8 cents.
2 way: 1 + 1 + 1 + 5 = 8 cents.
Input : N = 10 Coins : 1, 5, 10
Output : 4
Explanation: 1 way: 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 = 10 cents.
2 way: 1 + 1 + 1 + 1 + 1 + 5 = 10 cents.
3 way: 5 + 5 = 10 cents.
4 way: 10 cents = 10 cents.
*/
// https://www.geeksforgeeks.org/understanding-the-coin-change-problem-with-dynamic-programming/?ref=rp
int makeChange(vector<int>& coins, int amount) {
int size = coins.size();
vector<int> cache(amount + 1, 0);
cache[0] = 1;
for(int i = 0; i< size; i++){
for(int j = 0; j<= amount; j++){
if(coins[i] <= j){
cache[j] += cache[ j - coins[i]]; // For Total Ways
}
}
}
return cache[amount];
} | [
"aaryan6789@gmail.com"
] | aaryan6789@gmail.com |
4da42cfc6a2f7cf56fb29dd35c0421af26b0d889 | c1e46ab779a04a1496742a443caac94574e1e446 | /FinalVersionMacros/Prompt4parameter/TurnOnRate/L1RateDisplacedPU.h | a9d46eebbdff25e0b52caea9ba65bef69afff0ce | [] | no_license | rpatelCERN/TSABoardDocumentation | 84d6f2db6b34530a55fb3142c1adf864cf04b8f7 | 5ba8671919f4bad972e710afd86941e6cddb9fb3 | refs/heads/master | 2020-07-02T05:59:36.839589 | 2019-10-03T10:44:14 | 2019-10-03T10:44:14 | 201,434,308 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 19,281 | h | //////////////////////////////////////////////////////////
// This class has been automatically generated on
// Mon Aug 26 15:21:13 2019 by ROOT version 5.34/37
// from TTree eventTree/Event tree
// found on file: MinBiasD41Extended.root
//////////////////////////////////////////////////////////
#ifndef L1RateDisplacedPU_h
#define L1RateDisplacedPU_h
#include <TROOT.h>
#include <TChain.h>
#include <TFile.h>
// Header file for the classes stored in the TTree if any.
#include <vector>
#include <vector>
// Fixed size dimensions of array or collections stored in the TTree if any.
class L1RateDisplacedPU {
public :
TTree *fChain; //!pointer to the analyzed TTree or TChain
Int_t fCurrent; //!current Tree number in a TChain
// Declaration of leaf types
vector<float> *trk_p;
vector<float> *trk_pt;
vector<float> *trk_eta;
vector<float> *trk_phi;
vector<float> *trk_d0;
vector<float> *trk_z0;
vector<float> *trk_bconsist;
vector<float> *trk_sconsist;
vector<float> *trk_chi2;
vector<int> *trk_nstub;
vector<int> *trk_psnstub;
vector<int> *trk_genuine;
vector<int> *trk_loose;
vector<int> *trk_unknown;
vector<int> *trk_combinatoric;
vector<int> *trk_fake;
vector<int> *trk_matchtp_pdgid;
vector<float> *trk_matchtp_pt;
vector<float> *trk_matchtp_eta;
vector<float> *trk_matchtp_phi;
vector<float> *trk_matchtp_z0;
vector<float> *trk_matchtp_dxy;
vector<float> *tp_p;
vector<float> *tp_pt;
vector<float> *tp_eta;
vector<float> *tp_phi;
vector<float> *tp_dxy;
vector<float> *tp_d0;
vector<float> *tp_z0;
vector<float> *tp_d0_prod;
vector<float> *tp_z0_prod;
vector<int> *tp_pdgid;
vector<int> *tp_nmatch;
vector<int> *tp_nstub;
vector<int> *tp_nstublayers;
vector<int> *tp_eventid;
vector<int> *tp_charge;
vector<float> *matchtrk_p;
vector<float> *matchtrk_pt;
vector<float> *matchtrk_eta;
vector<float> *matchtrk_phi;
vector<float> *matchtrk_z0;
vector<float> *matchtrk_d0;
vector<float> *matchtrk_chi2;
vector<int> *matchtrk_nstub;
Float_t trueMET;
Float_t tkMET;
Float_t tkMHT;
Float_t tkHT;
vector<float> *pv_L1recotruesumpt;
vector<float> *pv_L1recosumpt;
vector<float> *pv_L1reco;
vector<float> *pv_L1TP;
vector<float> *pv_L1TPsumpt;
vector<int> *MC_lep;
vector<float> *pv_MCChgSumpT;
vector<float> *pv_MC;
vector<float> *tpjet_eta;
vector<float> *tpjet_vz;
vector<float> *tpjet_p;
vector<float> *tpjet_pt;
vector<float> *tpjet_phi;
vector<int> *tpjet_ntracks;
vector<float> *tpjet_tp_sumpt;
vector<float> *tpjet_truetp_sumpt;
vector<float> *Twol_eta;
vector<float> *Twoltrkjet_vz;
vector<float> *Twoltrkjet_p;
vector<float> *Twoltrkjet_eta;
vector<float> *Twoltrkjet_pt;
vector<float> *Twoltrkjet_phi;
vector<int> *Twoltrkjet_ntracks;
vector<int> *Twoltrkjet_nDisplaced;
vector<int> *Twoltrkjet_nTight;
vector<int> *Twoltrkjet_nTightDisplaced;
vector<float> *trkjet_eta;
vector<float> *trkjet_vz;
vector<float> *trkjet_p;
vector<float> *trkjet_pt;
vector<float> *trkjet_phi;
vector<int> *trkjet_ntracks;
vector<float> *trkjet_truetp_sumpt;
vector<float> *genjetak4_neufrac;
vector<float> *genjetak4_chgfrac;
vector<float> *genjetak4_metfrac;
vector<float> *genjetak4_eta;
vector<float> *genjetak4_phi;
vector<float> *genjetak4_p;
vector<float> *genjetak4_pt;
vector<float> *genjetchgak4_eta;
vector<float> *genjetchgak4_phi;
vector<float> *genjetchgak4_p;
vector<float> *genjetchgak4_z;
vector<float> *genjetchgak4_pt;
// List of branches
TBranch *b_trk_p; //!
TBranch *b_trk_pt; //!
TBranch *b_trk_eta; //!
TBranch *b_trk_phi; //!
TBranch *b_trk_d0; //!
TBranch *b_trk_z0; //!
TBranch *b_trk_bconsist; //!
TBranch *b_trk_sconsist; //!
TBranch *b_trk_chi2; //!
TBranch *b_trk_nstub; //!
TBranch *b_trk_psnstub; //!
TBranch *b_trk_genuine; //!
TBranch *b_trk_loose; //!
TBranch *b_trk_unknown; //!
TBranch *b_trk_combinatoric; //!
TBranch *b_trk_fake; //!
TBranch *b_trk_matchtp_pdgid; //!
TBranch *b_trk_matchtp_pt; //!
TBranch *b_trk_matchtp_eta; //!
TBranch *b_trk_matchtp_phi; //!
TBranch *b_trk_matchtp_z0; //!
TBranch *b_trk_matchtp_dxy; //!
TBranch *b_tp_p; //!
TBranch *b_tp_pt; //!
TBranch *b_tp_eta; //!
TBranch *b_tp_phi; //!
TBranch *b_tp_dxy; //!
TBranch *b_tp_d0; //!
TBranch *b_tp_z0; //!
TBranch *b_tp_d0_prod; //!
TBranch *b_tp_z0_prod; //!
TBranch *b_tp_pdgid; //!
TBranch *b_tp_nmatch; //!
TBranch *b_tp_nstub; //!
TBranch *b_tp_nstublayers; //!
TBranch *b_tp_eventid; //!
TBranch *b_tp_charge; //!
TBranch *b_matchtrk_p; //!
TBranch *b_matchtrk_pt; //!
TBranch *b_matchtrk_eta; //!
TBranch *b_matchtrk_phi; //!
TBranch *b_matchtrk_z0; //!
TBranch *b_matchtrk_d0; //!
TBranch *b_matchtrk_chi2; //!
TBranch *b_matchtrk_nstub; //!
TBranch *b_trueMET; //!
TBranch *b_tkMET; //!
TBranch *b_tkMHT; //!
TBranch *b_tkHT; //!
TBranch *b_pv_L1recotruesumpt; //!
TBranch *b_pv_L1recosumpt; //!
TBranch *b_pv_L1reco; //!
TBranch *b_pv_L1TP; //!
TBranch *b_pv_L1TPsumpt; //!
TBranch *b_MC_lep; //!
TBranch *b_pv_MCChgSumpT; //!
TBranch *b_pv_MC; //!
TBranch *b_tpjet_eta; //!
TBranch *b_tpjet_vz; //!
TBranch *b_tpjet_p; //!
TBranch *b_tpjet_pt; //!
TBranch *b_tpjet_phi; //!
TBranch *b_tpjet_ntracks; //!
TBranch *b_tpjet_tp_sumpt; //!
TBranch *b_tpjet_truetp_sumpt; //!
TBranch *b_2ltrkjet_eta; //!
TBranch *b_2ltrkjet_vz; //!
TBranch *b_2ltrkjet_p; //!
TBranch *b_2ltrkjet_pt; //!
TBranch *b_2ltrkjet_phi; //!
TBranch *b_2ltrkjet_ntracks; //!
TBranch *b_2ltrkjet_nDisplaced; //!
TBranch *b_2ltrkjet_nTight; //!
TBranch *b_2ltrkjet_nTightDisplaced; //!
TBranch *b_trkjet_eta; //!
TBranch *b_trkjet_vz; //!
TBranch *b_trkjet_p; //!
TBranch *b_trkjet_pt; //!
TBranch *b_trkjet_phi; //!
TBranch *b_trkjet_ntracks; //!
TBranch *b_trkjet_truetp_sumpt; //!
TBranch *b_genjetak4_neufrac; //!
TBranch *b_genjetak4_chgfrac; //!
TBranch *b_genjetak4_metfrac; //!
TBranch *b_genjetak4_eta; //!
TBranch *b_genjetak4_phi; //!
TBranch *b_genjetak4_p; //!
TBranch *b_genjetak4_pt; //!
TBranch *b_genjetchgak4_eta; //!
TBranch *b_genjetchgak4_phi; //!
TBranch *b_genjetchgak4_p; //!
TBranch *b_genjetchgak4_z; //!
TBranch *b_genjetchgak4_pt; //!
L1RateDisplacedPU(TTree *tree=0);
virtual ~L1RateDisplacedPU();
virtual Int_t Cut(Long64_t entry);
virtual Int_t GetEntry(Long64_t entry);
virtual Long64_t LoadTree(Long64_t entry);
virtual void Init(TTree *tree);
virtual void Loop();
virtual Bool_t Notify();
virtual void Show(Long64_t entry = -1);
};
#endif
#ifdef L1RateDisplacedPU_cxx
L1RateDisplacedPU::L1RateDisplacedPU(TTree *tree) : fChain(0)
{
// if parameter tree is not specified (or zero), connect the file
// used to generate this class and read the Tree.
if (tree == 0) {
TFile *f = (TFile*)gROOT->GetListOfFiles()->FindObject("StopHybridPU200.root");
if (!f || !f->IsOpen()) {
f = new TFile("StopHybridPU200.root");
}
TDirectory * dir = (TDirectory*)f->Get("StopHybridPU200.root:/L1TrackJetsFast");
dir->GetObject("eventTree",tree);
}
Init(tree);
}
L1RateDisplacedPU::~L1RateDisplacedPU()
{
if (!fChain) return;
delete fChain->GetCurrentFile();
}
Int_t L1RateDisplacedPU::GetEntry(Long64_t entry)
{
// Read contents of entry.
if (!fChain) return 0;
return fChain->GetEntry(entry);
}
Long64_t L1RateDisplacedPU::LoadTree(Long64_t entry)
{
// Set the environment to read one entry
if (!fChain) return -5;
Long64_t centry = fChain->LoadTree(entry);
if (centry < 0) return centry;
if (fChain->GetTreeNumber() != fCurrent) {
fCurrent = fChain->GetTreeNumber();
Notify();
}
return centry;
}
void L1RateDisplacedPU::Init(TTree *tree)
{
// The Init() function is called when the selector needs to initialize
// a new tree or chain. Typically here the branch addresses and branch
// pointers of the tree will be set.
// It is normally not necessary to make changes to the generated
// code, but the routine can be extended by the user if needed.
// Init() will be called many times when running on PROOF
// (once per file to be processed).
// Set object pointer
trk_p = 0;
trk_pt = 0;
trk_eta = 0;
trk_phi = 0;
trk_d0 = 0;
trk_z0 = 0;
trk_bconsist = 0;
trk_sconsist = 0;
trk_chi2 = 0;
trk_nstub = 0;
trk_psnstub = 0;
trk_genuine = 0;
trk_loose = 0;
trk_unknown = 0;
trk_combinatoric = 0;
trk_fake = 0;
trk_matchtp_pdgid = 0;
trk_matchtp_pt = 0;
trk_matchtp_eta = 0;
trk_matchtp_phi = 0;
trk_matchtp_z0 = 0;
trk_matchtp_dxy = 0;
tp_p = 0;
tp_pt = 0;
tp_eta = 0;
tp_phi = 0;
tp_dxy = 0;
tp_d0 = 0;
tp_z0 = 0;
tp_d0_prod = 0;
tp_z0_prod = 0;
tp_pdgid = 0;
tp_nmatch = 0;
tp_nstub = 0;
tp_nstublayers = 0;
tp_eventid = 0;
tp_charge = 0;
matchtrk_p = 0;
matchtrk_pt = 0;
matchtrk_eta = 0;
matchtrk_phi = 0;
matchtrk_z0 = 0;
matchtrk_d0 = 0;
matchtrk_chi2 = 0;
matchtrk_nstub = 0;
pv_L1recotruesumpt = 0;
pv_L1recosumpt = 0;
pv_L1reco = 0;
pv_L1TP = 0;
pv_L1TPsumpt = 0;
MC_lep = 0;
pv_MCChgSumpT = 0;
pv_MC = 0;
tpjet_eta = 0;
tpjet_vz = 0;
tpjet_p = 0;
tpjet_pt = 0;
tpjet_phi = 0;
tpjet_ntracks = 0;
tpjet_tp_sumpt = 0;
tpjet_truetp_sumpt = 0;
Twoltrkjet_eta = 0;
Twoltrkjet_vz = 0;
Twoltrkjet_p = 0;
Twoltrkjet_pt = 0;
Twoltrkjet_phi = 0;
Twoltrkjet_ntracks = 0;
Twoltrkjet_nDisplaced = 0;
Twoltrkjet_nTight = 0;
Twoltrkjet_nTightDisplaced = 0;
trkjet_eta = 0;
trkjet_vz = 0;
trkjet_p = 0;
trkjet_pt = 0;
trkjet_phi = 0;
trkjet_ntracks = 0;
trkjet_truetp_sumpt = 0;
genjetak4_neufrac = 0;
genjetak4_chgfrac = 0;
genjetak4_metfrac = 0;
genjetak4_eta = 0;
genjetak4_phi = 0;
genjetak4_p = 0;
genjetak4_pt = 0;
genjetchgak4_eta = 0;
genjetchgak4_phi = 0;
genjetchgak4_p = 0;
genjetchgak4_z = 0;
genjetchgak4_pt = 0;
// Set branch addresses and branch pointers
if (!tree) return;
fChain = tree;
fCurrent = -1;
fChain->SetMakeClass(1);
fChain->SetBranchAddress("trk_p", &trk_p, &b_trk_p);
fChain->SetBranchAddress("trk_pt", &trk_pt, &b_trk_pt);
fChain->SetBranchAddress("trk_eta", &trk_eta, &b_trk_eta);
fChain->SetBranchAddress("trk_phi", &trk_phi, &b_trk_phi);
fChain->SetBranchAddress("trk_d0", &trk_d0, &b_trk_d0);
fChain->SetBranchAddress("trk_z0", &trk_z0, &b_trk_z0);
fChain->SetBranchAddress("trk_bconsist", &trk_bconsist, &b_trk_bconsist);
fChain->SetBranchAddress("trk_sconsist", &trk_sconsist, &b_trk_sconsist);
fChain->SetBranchAddress("trk_chi2", &trk_chi2, &b_trk_chi2);
fChain->SetBranchAddress("trk_nstub", &trk_nstub, &b_trk_nstub);
fChain->SetBranchAddress("trk_psnstub", &trk_psnstub, &b_trk_psnstub);
fChain->SetBranchAddress("trk_genuine", &trk_genuine, &b_trk_genuine);
fChain->SetBranchAddress("trk_loose", &trk_loose, &b_trk_loose);
fChain->SetBranchAddress("trk_unknown", &trk_unknown, &b_trk_unknown);
fChain->SetBranchAddress("trk_combinatoric", &trk_combinatoric, &b_trk_combinatoric);
fChain->SetBranchAddress("trk_fake", &trk_fake, &b_trk_fake);
fChain->SetBranchAddress("trk_matchtp_pdgid", &trk_matchtp_pdgid, &b_trk_matchtp_pdgid);
fChain->SetBranchAddress("trk_matchtp_pt", &trk_matchtp_pt, &b_trk_matchtp_pt);
fChain->SetBranchAddress("trk_matchtp_eta", &trk_matchtp_eta, &b_trk_matchtp_eta);
fChain->SetBranchAddress("trk_matchtp_phi", &trk_matchtp_phi, &b_trk_matchtp_phi);
fChain->SetBranchAddress("trk_matchtp_z0", &trk_matchtp_z0, &b_trk_matchtp_z0);
fChain->SetBranchAddress("trk_matchtp_dxy", &trk_matchtp_dxy, &b_trk_matchtp_dxy);
fChain->SetBranchAddress("tp_p", &tp_p, &b_tp_p);
fChain->SetBranchAddress("tp_pt", &tp_pt, &b_tp_pt);
fChain->SetBranchAddress("tp_eta", &tp_eta, &b_tp_eta);
fChain->SetBranchAddress("tp_phi", &tp_phi, &b_tp_phi);
fChain->SetBranchAddress("tp_dxy", &tp_dxy, &b_tp_dxy);
fChain->SetBranchAddress("tp_d0", &tp_d0, &b_tp_d0);
fChain->SetBranchAddress("tp_z0", &tp_z0, &b_tp_z0);
fChain->SetBranchAddress("tp_d0_prod", &tp_d0_prod, &b_tp_d0_prod);
fChain->SetBranchAddress("tp_z0_prod", &tp_z0_prod, &b_tp_z0_prod);
fChain->SetBranchAddress("tp_pdgid", &tp_pdgid, &b_tp_pdgid);
fChain->SetBranchAddress("tp_nmatch", &tp_nmatch, &b_tp_nmatch);
fChain->SetBranchAddress("tp_nstub", &tp_nstub, &b_tp_nstub);
fChain->SetBranchAddress("tp_nstublayers", &tp_nstublayers, &b_tp_nstublayers);
fChain->SetBranchAddress("tp_eventid", &tp_eventid, &b_tp_eventid);
fChain->SetBranchAddress("tp_charge", &tp_charge, &b_tp_charge);
fChain->SetBranchAddress("matchtrk_p", &matchtrk_p, &b_matchtrk_p);
fChain->SetBranchAddress("matchtrk_pt", &matchtrk_pt, &b_matchtrk_pt);
fChain->SetBranchAddress("matchtrk_eta", &matchtrk_eta, &b_matchtrk_eta);
fChain->SetBranchAddress("matchtrk_phi", &matchtrk_phi, &b_matchtrk_phi);
fChain->SetBranchAddress("matchtrk_z0", &matchtrk_z0, &b_matchtrk_z0);
fChain->SetBranchAddress("matchtrk_d0", &matchtrk_d0, &b_matchtrk_d0);
fChain->SetBranchAddress("matchtrk_chi2", &matchtrk_chi2, &b_matchtrk_chi2);
fChain->SetBranchAddress("matchtrk_nstub", &matchtrk_nstub, &b_matchtrk_nstub);
fChain->SetBranchAddress("trueMET", &trueMET, &b_trueMET);
fChain->SetBranchAddress("tkMET", &tkMET, &b_tkMET);
fChain->SetBranchAddress("tkMHT", &tkMHT, &b_tkMHT);
fChain->SetBranchAddress("tkHT", &tkHT, &b_tkHT);
fChain->SetBranchAddress("pv_L1recotruesumpt", &pv_L1recotruesumpt, &b_pv_L1recotruesumpt);
fChain->SetBranchAddress("pv_L1recosumpt", &pv_L1recosumpt, &b_pv_L1recosumpt);
fChain->SetBranchAddress("pv_L1reco", &pv_L1reco, &b_pv_L1reco);
fChain->SetBranchAddress("pv_L1TP", &pv_L1TP, &b_pv_L1TP);
fChain->SetBranchAddress("pv_L1TPsumpt", &pv_L1TPsumpt, &b_pv_L1TPsumpt);
fChain->SetBranchAddress("MC_lep", &MC_lep, &b_MC_lep);
fChain->SetBranchAddress("pv_MCChgSumpT", &pv_MCChgSumpT, &b_pv_MCChgSumpT);
fChain->SetBranchAddress("pv_MC", &pv_MC, &b_pv_MC);
fChain->SetBranchAddress("tpjet_eta", &tpjet_eta, &b_tpjet_eta);
fChain->SetBranchAddress("tpjet_vz", &tpjet_vz, &b_tpjet_vz);
fChain->SetBranchAddress("tpjet_p", &tpjet_p, &b_tpjet_p);
fChain->SetBranchAddress("tpjet_pt", &tpjet_pt, &b_tpjet_pt);
fChain->SetBranchAddress("tpjet_phi", &tpjet_phi, &b_tpjet_phi);
fChain->SetBranchAddress("tpjet_ntracks", &tpjet_ntracks, &b_tpjet_ntracks);
fChain->SetBranchAddress("tpjet_tp_sumpt", &tpjet_tp_sumpt, &b_tpjet_tp_sumpt);
fChain->SetBranchAddress("tpjet_truetp_sumpt", &tpjet_truetp_sumpt, &b_tpjet_truetp_sumpt);
fChain->SetBranchAddress("2ltrkjet_eta", &Twoltrkjet_eta, &b_2ltrkjet_eta);
fChain->SetBranchAddress("2ltrkjet_vz", &Twoltrkjet_vz, &b_2ltrkjet_vz);
fChain->SetBranchAddress("2ltrkjet_p", &Twoltrkjet_p, &b_2ltrkjet_p);
fChain->SetBranchAddress("2ltrkjet_pt", &Twoltrkjet_pt, &b_2ltrkjet_pt);
fChain->SetBranchAddress("2ltrkjet_phi", &Twoltrkjet_phi, &b_2ltrkjet_phi);
fChain->SetBranchAddress("2ltrkjet_ntracks", &Twoltrkjet_ntracks, &b_2ltrkjet_ntracks);
fChain->SetBranchAddress("2ltrkjet_nDisplaced", &Twoltrkjet_nDisplaced, &b_2ltrkjet_nDisplaced);
fChain->SetBranchAddress("2ltrkjet_nTight", &Twoltrkjet_nTight, &b_2ltrkjet_nTight);
fChain->SetBranchAddress("2ltrkjet_nTightDisplaced", &Twoltrkjet_nTightDisplaced, &b_2ltrkjet_nTightDisplaced);
fChain->SetBranchAddress("trkjet_eta", &trkjet_eta, &b_trkjet_eta);
fChain->SetBranchAddress("trkjet_vz", &trkjet_vz, &b_trkjet_vz);
fChain->SetBranchAddress("trkjet_p", &trkjet_p, &b_trkjet_p);
fChain->SetBranchAddress("trkjet_pt", &trkjet_pt, &b_trkjet_pt);
fChain->SetBranchAddress("trkjet_phi", &trkjet_phi, &b_trkjet_phi);
fChain->SetBranchAddress("trkjet_ntracks", &trkjet_ntracks, &b_trkjet_ntracks);
fChain->SetBranchAddress("trkjet_truetp_sumpt", &trkjet_truetp_sumpt, &b_trkjet_truetp_sumpt);
fChain->SetBranchAddress("genjetak4_neufrac", &genjetak4_neufrac, &b_genjetak4_neufrac);
fChain->SetBranchAddress("genjetak4_chgfrac", &genjetak4_chgfrac, &b_genjetak4_chgfrac);
fChain->SetBranchAddress("genjetak4_metfrac", &genjetak4_metfrac, &b_genjetak4_metfrac);
fChain->SetBranchAddress("genjetak4_eta", &genjetak4_eta, &b_genjetak4_eta);
fChain->SetBranchAddress("genjetak4_phi", &genjetak4_phi, &b_genjetak4_phi);
fChain->SetBranchAddress("genjetak4_p", &genjetak4_p, &b_genjetak4_p);
fChain->SetBranchAddress("genjetak4_pt", &genjetak4_pt, &b_genjetak4_pt);
fChain->SetBranchAddress("genjetchgak4_eta", &genjetchgak4_eta, &b_genjetchgak4_eta);
fChain->SetBranchAddress("genjetchgak4_phi", &genjetchgak4_phi, &b_genjetchgak4_phi);
fChain->SetBranchAddress("genjetchgak4_p", &genjetchgak4_p, &b_genjetchgak4_p);
fChain->SetBranchAddress("genjetchgak4_z", &genjetchgak4_z, &b_genjetchgak4_z);
fChain->SetBranchAddress("genjetchgak4_pt", &genjetchgak4_pt, &b_genjetchgak4_pt);
Notify();
}
Bool_t L1RateDisplacedPU::Notify()
{
// The Notify() function is called when a new file is opened. This
// can be either for a new TTree in a TChain or when when a new TTree
// is started when using PROOF. It is normally not necessary to make changes
// to the generated code, but the routine can be extended by the
// user if needed. The return value is currently not used.
return kTRUE;
}
void L1RateDisplacedPU::Show(Long64_t entry)
{
// Print contents of entry.
// If entry is not specified, print current entry
if (!fChain) return;
fChain->Show(entry);
}
Int_t L1RateDisplacedPU::Cut(Long64_t entry)
{
// This function may be called from Loop.
// returns 1 if entry is accepted.
// returns -1 otherwise.
return 1;
}
#endif // #ifdef L1RateDisplacedPU_cxx
| [
"rpatel@cern.ch"
] | rpatel@cern.ch |
62d9c66b11b8becfa00b90a52194a70d3e77021d | e048e4be6556fe3d5e32385df9839639f4485d0d | /src/animator/SkDisplayTypes.h | 0ac57babea567fb8042e84aec0f329c35b661ec9 | [
"Apache-2.0"
] | permissive | voku/android_external_skia | 54512b0de5f9bf32f8d312e1da308fe6de566f16 | 759a5d9e079f604fb69d97db8b501b9c851e83d5 | refs/heads/gingerbread | 2021-01-16T20:47:00.656841 | 2011-07-06T10:11:16 | 2012-02-25T12:57:04 | 2,706,545 | 0 | 1 | NOASSERTION | 2020-12-16T16:46:42 | 2011-11-04T01:48:27 | C++ | UTF-8 | C++ | false | false | 3,458 | h | /* libs/graphics/animator/SkDisplayTypes.h
**
** Copyright 2006, The Android Open Source Project
**
** 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.
*/
#ifndef SkDisplayTypes_DEFINED
#define SkDisplayTypes_DEFINED
#include "SkDisplayable.h"
#include "SkMemberInfo.h"
#include "SkTypedArray.h"
class SkOpArray; // compiled script experiment
class SkDisplayDepend : public SkDisplayable {
public:
virtual bool canContainDependents() const;
void addDependent(SkDisplayable* displayable) {
if (fDependents.find(displayable) < 0)
*fDependents.append() = displayable;
}
virtual void dirty();
private:
SkTDDisplayableArray fDependents;
typedef SkDisplayable INHERITED;
};
class SkDisplayBoolean : public SkDisplayDepend {
DECLARE_DISPLAY_MEMBER_INFO(Boolean);
SkDisplayBoolean();
#ifdef SK_DUMP_ENABLED
virtual void dump(SkAnimateMaker* );
#endif
SkBool value;
friend class SkAnimatorScript;
friend class SkAnimatorScript_Box;
friend class SkAnimatorScript_Unbox;
typedef SkDisplayDepend INHERITED;
};
class SkDisplayInt : public SkDisplayDepend {
DECLARE_DISPLAY_MEMBER_INFO(Int);
SkDisplayInt();
#ifdef SK_DUMP_ENABLED
virtual void dump(SkAnimateMaker* );
#endif
private:
int32_t value;
friend class SkAnimatorScript;
friend class SkAnimatorScript_Box;
friend class SkAnimatorScript_Unbox;
typedef SkDisplayDepend INHERITED;
};
class SkDisplayFloat : public SkDisplayDepend {
DECLARE_DISPLAY_MEMBER_INFO(Float);
SkDisplayFloat();
#ifdef SK_DUMP_ENABLED
virtual void dump(SkAnimateMaker* );
#endif
private:
SkScalar value;
friend class SkAnimatorScript;
friend class SkAnimatorScript_Box;
friend class SkAnimatorScript_Unbox;
typedef SkDisplayDepend INHERITED;
};
class SkDisplayString : public SkDisplayDepend {
DECLARE_DISPLAY_MEMBER_INFO(String);
SkDisplayString();
SkDisplayString(SkString& );
virtual void executeFunction(SkDisplayable* , int index,
SkTDArray<SkScriptValue>& parameters, SkDisplayTypes type,
SkScriptValue* );
virtual const SkFunctionParamType* getFunctionsParameters();
virtual bool getProperty(int index, SkScriptValue* ) const;
SkString value;
private:
static const SkFunctionParamType fFunctionParameters[];
};
class SkDisplayArray : public SkDisplayDepend {
DECLARE_DISPLAY_MEMBER_INFO(Array);
SkDisplayArray();
SkDisplayArray(SkTypedArray& );
SkDisplayArray(SkOpArray& ); // compiled script experiment
virtual ~SkDisplayArray();
virtual bool getProperty(int index, SkScriptValue* ) const;
private:
SkTypedArray values;
friend class SkAnimator;
friend class SkAnimatorScript;
friend class SkAnimatorScript2;
friend class SkAnimatorScript_Unbox;
friend class SkDisplayable;
friend struct SkMemberInfo;
friend class SkScriptEngine;
};
#endif // SkDisplayTypes_DEFINED
| [
"initial-contribution@android.com"
] | initial-contribution@android.com |
933492e384a7fca261f6b890ba2b21c51d734dad | 5ce3bee20160b3020b2a2a69c7f999a224330cbe | /numero aleatorio/main.cpp | 2364eb02bea30ecb690123981cb4bfee7881fd66 | [] | no_license | jcdp23/parcial-1 | 29e7c8cf90f0282d25d046fd5a3019768b838938 | faab9f23314eacff53646610cabe863e7d50b052 | refs/heads/master | 2021-01-01T05:13:27.563431 | 2016-05-18T03:55:47 | 2016-05-18T03:55:47 | 58,972,768 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 307 | cpp | #include <iostream>
#include<time.h>
#include<stdlib.h>
#include<stdio.h>
using namespace std;
int main()
{ srand(time(0));
int numero;
numero =50 + rand() % (100-50);
// % mpd
// rango inicial + numero generado
cout <<"valor de numero"<<numero<<"\n";
system("PAUSE");
return 0;
}
| [
"juancarlos_dubon_6@hotmail.com"
] | juancarlos_dubon_6@hotmail.com |
f3830ab80451d35fff53ca7467cfb859a5083c44 | 372c08821ef974438caa387eb83449144c670889 | /libs/GeomLib/OUAlgorithm.hpp | fc56f33d391fd1000c5334a886f0c256af490f76 | [
"MIT"
] | permissive | dekamps/miind | a20ecce2cc2f6961f58b62215d92ac080ee74aaa | b97ea5e86436dbb2a9fb3bcf7fb5e5c01b60be2f | refs/heads/master | 2023-06-23T03:44:21.018547 | 2023-06-21T14:39:20 | 2023-06-21T14:39:20 | 31,783,822 | 14 | 12 | null | 2019-05-30T12:25:29 | 2015-03-06T18:51:34 | C++ | UTF-8 | C++ | false | false | 5,636 | hpp | // Copyright (c) 2005 - 2010 Marc de Kamps
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation
// and/or other materials provided with the distribution.
// * Neither the name of the copyright holder 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.
//
// If you use this software in work leading to a scientific publication, you should include a reference there to
// the 'currently valid reference', which can be found at http://miind.sourceforge.net
#ifndef MPILIB_ALGORITHMS_OUALGORITHM_HPP_
#define MPILIB_ALGORITHMS_OUALGORITHM_HPP_
#include <NumtoolsLib/NumtoolsLib.h>
#include <MPILib/include/WilsonCowanParameter.hpp>
#include <MPILib/include/AlgorithmInterface.hpp>
#include <MPILib/include/DelayedConnection.hpp>
#include "GeomInputConvertor.hpp"
#include "MuSigmaScalarProduct.hpp"
#include "NeuronParameter.hpp"
#include "ResponseParameter.hpp"
namespace GeomLib {
//!< \brief Rate-based model with gain function based on a diffusion process.
class OUAlgorithm : public MPILib::AlgorithmInterface<MPILib::DelayedConnection> {
public:
/// Create an OUAlgorithm from neuronal parameters
OUAlgorithm
(
const NeuronParameter&
);
/// copy ctor
OUAlgorithm
(
const OUAlgorithm&
);
/// virtual destructor
virtual ~OUAlgorithm();
/// configure algorithm
virtual void configure
(
const MPILib::SimulationRunParameter& //!< simulation run parameter
);
/**
* Evolve the node state
* @param nodeVector Vector of the node States
* @param weightVector Vector of the weights of the nodes
* @param time Time point of the algorithm
*/
virtual void evolveNodeState
(
const std::vector<MPILib::Rate>& nodeVector,
const std::vector<MPILib::DelayedConnection>& weightVector,
MPILib::Time time
);
/**
* prepare the Evolve method
* @param nodeVector Vector of the node States
* @param weightVector Vector of the weights of the nodes
* @param typeVector Vector of the NodeTypes of the precursors
*/
virtual void prepareEvolve(const std::vector<MPILib::Rate>& nodeVector,
const std::vector<MPILib::DelayedConnection>& weightVector,
const std::vector<MPILib::NodeType>& typeVector);
/// Current AlgorithmGrid
virtual MPILib::AlgorithmGrid getGrid(MPILib::NodeId, bool b_state = true) const;
/**
* Cloning operation, to provide each DynamicNode with its own
* Algorithm instance. Clients use the naked pointer at their own risk.
*/
virtual OUAlgorithm* clone() const;
//! Current tme of the simulation
virtual MPILib::Time getCurrentTime() const;
//! Current output rate of the population
virtual MPILib::Rate getCurrentRate() const;
private:
MPILib::AlgorithmGrid InitialGrid() const;
vector<double> InitialState() const;
ResponseParameter
InitializeParameters
(
const NeuronParameter&
) const;
NeuronParameter _parameter_neuron;
ResponseParameter _parameter_response;
NumtoolsLib::DVIntegrator<ResponseParameter> _integrator;
MuSigmaScalarProduct<MPILib::DelayedConnection> _scalar_product;
};
} // GeomLib
#endif // include guard
| [
"scsmdk@leeds.ac.uk"
] | scsmdk@leeds.ac.uk |
4acfc9bd7a91f82ac049d173de0b77fa32edcaf3 | a545441c8a0e010637193be32dee0fedbff464a6 | /src/test/fuzz/utxo_total_supply.cpp | 7813b7854b1ea5dcdb9962f2d2a0ef8f9615b701 | [
"MIT"
] | permissive | YANGHONGEUN/bitcoin | 0771ad8b2190ef2972ea5f3838664b6bf15be65f | 452ea0a214456fabd4f3caed004e4d34d07d9a38 | refs/heads/master | 2023-05-26T01:52:27.975225 | 2023-05-08T22:25:24 | 2023-05-08T22:25:24 | 205,278,260 | 2 | 0 | MIT | 2019-08-30T01:07:45 | 2019-08-30T01:07:45 | null | UTF-8 | C++ | false | false | 6,552 | cpp | // Copyright (c) 2020 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <chainparams.h>
#include <consensus/consensus.h>
#include <consensus/merkle.h>
#include <kernel/coinstats.h>
#include <node/miner.h>
#include <script/interpreter.h>
#include <streams.h>
#include <test/fuzz/FuzzedDataProvider.h>
#include <test/fuzz/fuzz.h>
#include <test/fuzz/util.h>
#include <test/util/mining.h>
#include <test/util/setup_common.h>
#include <validation.h>
#include <version.h>
FUZZ_TARGET(utxo_total_supply)
{
/** The testing setup that creates a chainman only (no chainstate) */
ChainTestingSetup test_setup{
CBaseChainParams::REGTEST,
{
"-testactivationheight=bip34@2",
},
};
// Create chainstate
test_setup.LoadVerifyActivateChainstate();
auto& node{test_setup.m_node};
auto& chainman{*Assert(test_setup.m_node.chainman)};
FuzzedDataProvider fuzzed_data_provider(buffer.data(), buffer.size());
const auto ActiveHeight = [&]() {
LOCK(chainman.GetMutex());
return chainman.ActiveHeight();
};
const auto PrepareNextBlock = [&]() {
// Use OP_FALSE to avoid BIP30 check from hitting early
auto block = PrepareBlock(node, CScript{} << OP_FALSE);
// Replace OP_FALSE with OP_TRUE
{
CMutableTransaction tx{*block->vtx.back()};
tx.vout.at(0).scriptPubKey = CScript{} << OP_TRUE;
block->vtx.back() = MakeTransactionRef(tx);
}
return block;
};
/** The block template this fuzzer is working on */
auto current_block = PrepareNextBlock();
/** Append-only set of tx outpoints, entries are not removed when spent */
std::vector<std::pair<COutPoint, CTxOut>> txos;
/** The utxo stats at the chain tip */
kernel::CCoinsStats utxo_stats;
/** The total amount of coins in the utxo set */
CAmount circulation{0};
// Store the tx out in the txo map
const auto StoreLastTxo = [&]() {
// get last tx
const CTransaction& tx = *current_block->vtx.back();
// get last out
const uint32_t i = tx.vout.size() - 1;
// store it
txos.emplace_back(COutPoint{tx.GetHash(), i}, tx.vout.at(i));
if (current_block->vtx.size() == 1 && tx.vout.at(i).scriptPubKey[0] == OP_RETURN) {
// also store coinbase
const uint32_t i = tx.vout.size() - 2;
txos.emplace_back(COutPoint{tx.GetHash(), i}, tx.vout.at(i));
}
};
const auto AppendRandomTxo = [&](CMutableTransaction& tx) {
const auto& txo = txos.at(fuzzed_data_provider.ConsumeIntegralInRange<size_t>(0, txos.size() - 1));
tx.vin.emplace_back(txo.first);
tx.vout.emplace_back(txo.second.nValue, txo.second.scriptPubKey); // "Forward" coin with no fee
};
const auto UpdateUtxoStats = [&]() {
LOCK(chainman.GetMutex());
chainman.ActiveChainstate().ForceFlushStateToDisk();
utxo_stats = std::move(
*Assert(kernel::ComputeUTXOStats(kernel::CoinStatsHashType::NONE, &chainman.ActiveChainstate().CoinsDB(), chainman.m_blockman, {})));
// Check that miner can't print more money than they are allowed to
assert(circulation == utxo_stats.total_amount);
};
// Update internal state to chain tip
StoreLastTxo();
UpdateUtxoStats();
assert(ActiveHeight() == 0);
// Get at which height we duplicate the coinbase
// Assuming that the fuzzer will mine relatively short chains (less than 200 blocks), we want the duplicate coinbase to be not too high.
// Up to 2000 seems reasonable.
int64_t duplicate_coinbase_height = fuzzed_data_provider.ConsumeIntegralInRange(0, 20 * COINBASE_MATURITY);
// Always pad with OP_0 at the end to avoid bad-cb-length error
const CScript duplicate_coinbase_script = CScript() << duplicate_coinbase_height << OP_0;
// Mine the first block with this duplicate
current_block = PrepareNextBlock();
StoreLastTxo();
{
// Create duplicate (CScript should match exact format as in CreateNewBlock)
CMutableTransaction tx{*current_block->vtx.front()};
tx.vin.at(0).scriptSig = duplicate_coinbase_script;
// Mine block and create next block template
current_block->vtx.front() = MakeTransactionRef(tx);
}
current_block->hashMerkleRoot = BlockMerkleRoot(*current_block);
assert(!MineBlock(node, current_block).IsNull());
circulation += GetBlockSubsidy(ActiveHeight(), Params().GetConsensus());
assert(ActiveHeight() == 1);
UpdateUtxoStats();
current_block = PrepareNextBlock();
StoreLastTxo();
LIMITED_WHILE(fuzzed_data_provider.remaining_bytes(), 100'000)
{
CallOneOf(
fuzzed_data_provider,
[&] {
// Append an input-output pair to the last tx in the current block
CMutableTransaction tx{*current_block->vtx.back()};
AppendRandomTxo(tx);
current_block->vtx.back() = MakeTransactionRef(tx);
StoreLastTxo();
},
[&] {
// Append a tx to the list of txs in the current block
CMutableTransaction tx{};
AppendRandomTxo(tx);
current_block->vtx.push_back(MakeTransactionRef(tx));
StoreLastTxo();
},
[&] {
// Append the current block to the active chain
node::RegenerateCommitments(*current_block, chainman);
const bool was_valid = !MineBlock(node, current_block).IsNull();
const auto prev_utxo_stats = utxo_stats;
if (was_valid) {
circulation += GetBlockSubsidy(ActiveHeight(), Params().GetConsensus());
if (duplicate_coinbase_height == ActiveHeight()) {
// we mined the duplicate coinbase
assert(current_block->vtx.at(0)->vin.at(0).scriptSig == duplicate_coinbase_script);
}
}
UpdateUtxoStats();
if (!was_valid) {
// utxo stats must not change
assert(prev_utxo_stats.hashSerialized == utxo_stats.hashSerialized);
}
current_block = PrepareNextBlock();
StoreLastTxo();
});
}
}
| [
"*~=`'#}+{/-|&$^_@721217.xyz"
] | *~=`'#}+{/-|&$^_@721217.xyz |
3163062687cef4bf61157cfa966e5eac465b4bb1 | 886b0e63a8e693b8d3b38b13e0b65604e29bf135 | /BINARY_TREE_TRAVERSALS.cpp | fd3cab75ff9fcb037e42c5cfa978fb55b608184f | [] | no_license | shubhamg931/Competitive-Algos-and-Data-Structures | 2d5c19804c2e54c71510cdac4365e0c0c7778cdd | 76bff2b3a2b1a86228f3e871413d90a4b54a5fce | refs/heads/master | 2021-06-07T16:26:42.376984 | 2020-10-02T08:40:07 | 2020-10-02T08:40:07 | 151,111,378 | 5 | 3 | null | 2020-10-02T08:40:09 | 2018-10-01T15:26:46 | C++ | UTF-8 | C++ | false | false | 1,142 | cpp | #include<bits/stdc++.h>
using namespace std;
class node{
public:
int val;
node* left;
node* right;
};
node* newNode(int val){
node* new_node = new node();
new_node->val = val;
new_node->left = NULL;
new_node->right = NULL;
return new_node;
}
void inorder_traversal(node* root){
if(root != NULL){
inorder_traversal(root->left);
cout<<root->val<<" ";
inorder_traversal(root->right);
}
}
void preorder_traversal(node* root){
if(root != NULL){
cout<<root->val<<" ";
preorder_traversal(root->left);
preorder_traversal(root->right);
}
}
void postorder_traversal(node* root){
if(root != NULL){
postorder_traversal(root->left);
postorder_traversal(root->right);
cout<<root->val<<" ";
}
}
int main(){
node* root = newNode(2);
root->left = newNode(3);
root->right = newNode(4);
root->left->left = newNode(5);
root->left->right = newNode(6);
preorder_traversal(root);
cout<<endl;
inorder_traversal(root);
cout<<endl;
postorder_traversal(root);
return 0;
} | [
"sg270798@gmail.com"
] | sg270798@gmail.com |
5272088f9ad9861572ff96cd38170b3b4baae7aa | e0c9aa0a834a98fec92fb385b62d8cfb16eb13b6 | /AllInOne/AllInOne/bag1.h | 0f803c4d1efb19e8c731383ef25bb9f73ed5cb36 | [] | no_license | tanthua/AllInOne | 05878f58475da704bd11bc9e99304be7f2c91973 | 290b7bd6978b2ccc42c6366a702ceb670e3909e4 | refs/heads/master | 2021-01-17T20:33:44.081275 | 2016-07-02T05:51:52 | 2016-07-02T05:51:52 | 61,401,495 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,074 | h | #pragma once
// FILE: bag1.h
// CLASS PROVIDED: bag (part of the namespace tan_3)
//
// TYPEDEF and MEMBER CONSTANTS for the bag class:
// typedef ____ value_type
// bag::value_type is the data type of the items in the bag. It may be any of
// the C++ built-in types (int, char, etc.), or a class with a default
// constructor, an assignment operator, and operators to
// test for equality (x == y) and non-equality (x != y).
//
// typedef ____ size_type
// bag::size_type is the data type of any variable that keeps track of how many items
// are in a bag.
//
// static const size_type CAPACITY = _____
// bag::CAPACITY is the maximum number of items that a bag can hold.
//
// CONSTRUCTOR for the bag class:
// bag( )
// Postcondition: The bag has been initialized as an empty bag.
//
// MODIFICATION MEMBER FUNCTIONS for the bag class:
// size_type erase(const value_type& target);
// Postcondition: All copies of target have been removed from the bag.
// The return value is the number of copies removed (which could be zero).
//
// void erase_one(const value_type& target)
// Postcondition: If target was in the bag, then one copy has been removed;
// otherwise the bag is unchanged. A true return value indicates that one
// copy was removed; false indicates that nothing was removed.
//
// void insert(const value_type& entry)
// Precondition: size( ) < CAPACITY.
// Postcondition: A new copy of entry has been added to the bag.
//
// void operator +=(const bag& addend)
// Precondition: size( ) + addend.size( ) <= CAPACITY.
// Postcondition: Each item in addend has been added to this bag.
//
// CONSTANT MEMBER FUNCTIONS for the bag class:
// size_type size( ) const
// Postcondition: The return value is the total number of items in the bag.
//
// size_type count(const value_type& target) const
// Postcondition: The return value is number of times target is in the bag.
//
// NONMEMBER FUNCTIONS for the bag class:
// bag operator +(const bag& b1, const bag& b2)
// Precondition: b1.size( ) + b2.size( ) <= bag::CAPACITY.
// Postcondition: The bag returned is the union of b1 and b2.
//
// VALUE SEMANTICS for the bag class:
// Assignments and the copy constructor may be used with bag objects.
#ifndef HUA_BAG1_H
#define HUA_BAG1_H
#include <cstdlib>
namespace hua_3
{
class bag
{
public:
//TYPEDEFS and MEMBER CONSTANTS
typedef int value_type;
typedef std::size_t size_type;
static const size_type CAPACITY = 30;
//CONSTRUCTOR
bag() { used = 0; }
//MODIFICATION MEMBER FUNCTIONS
size_type erase(const value_type& target);
bool erase_one(const value_type& target);
void insert(const value_type& entry);
void operator +=(const bag& addend);
//CONSTANT MEMBER FUNCTIONS
size_type size() const { return used; }
size_type count(const value_type& target) const;
private:
value_type data[CAPACITY];
size_type used;
};
//NONMEMBER FUNCTIONS for the bag class
bag operator +(const bag& b1, const bag& b2);
}
#endif | [
"tanhua@csus.edu"
] | tanhua@csus.edu |
41ba78b35a35df1e8a498d3b9f5fe1304edfd07d | 413d09052e4e56db3647c9038d00fdac173c717a | /torch/csrc/distributed/rpc/init.cpp | 78b44bfc548f5634a2da2d5f1bfd0e46c19faee7 | [
"BSD-3-Clause",
"LicenseRef-scancode-generic-cla",
"Apache-2.0",
"BSD-2-Clause"
] | permissive | keunhong/pytorch | 580bbea25d2519bbef9a0c35b99bded020b7594b | c235be42ddecc3c4e1cdf192ca2764455082c1c6 | refs/heads/master | 2021-03-14T12:36:46.123637 | 2020-03-12T06:29:34 | 2020-03-12T06:32:48 | 246,765,793 | 1 | 0 | NOASSERTION | 2020-03-12T07:03:33 | 2020-03-12T07:03:32 | null | UTF-8 | C++ | false | false | 20,727 | cpp | #include <torch/csrc/python_headers.h>
#include <torch/csrc/distributed/rpc/process_group_agent.h>
#include <torch/csrc/distributed/rpc/py_rref.h>
#include <torch/csrc/distributed/rpc/python_functions.h>
#include <torch/csrc/distributed/rpc/python_rpc_handler.h>
#include <torch/csrc/distributed/rpc/rpc_agent.h>
#include <torch/csrc/distributed/rpc/rref_context.h>
#include <torch/csrc/distributed/rpc/torchscript_functions.h>
#include <torch/csrc/distributed/rpc/types.h>
#include <torch/csrc/jit/python/pybind_utils.h>
#include <torch/csrc/utils/object_ptr.h>
#include <torch/csrc/utils/pybind.h>
#include <torch/csrc/utils/python_compat.h>
#include <torch/types.h>
#include <pybind11/chrono.h>
#include <pybind11/operators.h>
namespace torch {
namespace distributed {
namespace rpc {
namespace {
template <typename T>
using shared_ptr_class_ = py::class_<T, std::shared_ptr<T>>;
PyObject* rpc_init(PyObject* /* unused */) {
auto rpc_module =
THPObjectPtr(PyImport_ImportModule("torch.distributed.rpc"));
if (!rpc_module) {
throw python_error();
}
auto module = py::handle(rpc_module).cast<py::module>();
auto rpcBackendOptions =
shared_ptr_class_<RpcBackendOptions>(
module,
"RpcBackendOptions",
R"(An abstract structure encapsulating the options passed into the RPC
backend. An instance of this class can be passed in to
:meth:`~torch.distributed.rpc.init_rpc` in order to initialize RPC
with specific configurations, such as the RPC timeout and
``init_method`` to be used. )")
.def_readwrite(
"rpc_timeout",
&RpcBackendOptions::rpcTimeout,
R"(A ``datetime.timedelta`` indicating the timeout to use for all
RPCs. If an RPC does not complete in this timeframe, it will
complete with an exception indicating that it has timed out.)")
.def_readwrite(
"init_method",
&RpcBackendOptions::initMethod,
R"(URL specifying how to initialize the process group.
Default is ``env://``)");
module.attr("_DEFAULT_RPC_TIMEOUT") = py::cast(kDefaultRpcTimeout);
module.attr("_DEFAULT_INIT_METHOD") = py::cast(kDefaultInitMethod);
auto workerInfo =
shared_ptr_class_<WorkerInfo>(
module,
"WorkerInfo",
R"(A structure that encapsulates information of a worker in the system.
Contains the name and ID of the worker. This class is not meant to
be constructed directly, rather, an instance can be retrieved
through :meth:`~torch.distributed.rpc.get_worker_info` and the
result can be passed in to functions such as
:meth:`~torch.distributed.rpc.rpc_sync`, :class:`~torch.distributed.rpc.rpc_async`,
:meth:`~torch.distributed.rpc.remote` to avoid copying a string on
every invocation.)")
.def(
py::init<std::string, worker_id_t>(),
py::arg("name"),
py::arg("id"))
.def_readonly(
"name", &WorkerInfo::name_, R"(The name of the worker.)")
.def_readonly(
"id",
&WorkerInfo::id_,
R"(Globally unique id to identify the worker.)")
.def("__eq__", &WorkerInfo::operator==, py::is_operator())
// pybind11 suggests the syntax .def(hash(py::self)), with the
// unqualified "hash" function call. However the
// argument-dependent lookup for the function "hash" doesn't get
// triggered in this context because it conflicts with the struct
// torch::hash, so we need to use the qualified name
// py::detail::hash, which unfortunately is in a detail namespace.
.def(py::detail::hash(py::self));
auto rpcAgent =
shared_ptr_class_<RpcAgent>(module, "RpcAgent")
.def(
"join", &RpcAgent::join, py::call_guard<py::gil_scoped_release>())
.def(
"sync", &RpcAgent::sync, py::call_guard<py::gil_scoped_release>())
.def(
"get_worker_infos",
&RpcAgent::getWorkerInfos,
py::call_guard<py::gil_scoped_release>())
.def(
"get_debug_info",
&RpcAgent::getDebugInfo,
py::call_guard<py::gil_scoped_release>())
.def(
"get_metrics",
&RpcAgent::getMetrics,
py::call_guard<py::gil_scoped_release>());
auto pyRRef =
shared_ptr_class_<PyRRef>(module, "RRef", R"(
A class encapsulating a reference to a value of some type on a remote
worker. This handle will keep the referenced remote value alive on the
worker.
Example::
Following examples skip RPC initialization and shutdown code
for simplicity. Refer to RPC docs for those details.
1. Create an RRef using rpc.remote
>>> import torch
>>> import torch.distributed.rpc as rpc
>>> rref = rpc.remote("worker1", torch.add, args=(torch.ones(2), 3))
>>> # get a copy of value from the RRef
>>> x = rref.to_here()
2. Create an RRef from a local object
>>> import torch
>>> from torch.distributed.rpc import RRef
>>> x = torch.zeros(2, 2)
>>> rref = RRef(x)
3. Share an RRef with other workers
>>> # On both worker0 and worker1:
>>> def f(rref):
>>> return rref.to_here() + 1
>>> # On worker0:
>>> import torch
>>> import torch.distributed.rpc as rpc
>>> from torch.distributed.rpc import RRef
>>> rref = RRef(torch.zeros(2, 2))
>>> # the following RPC shares the rref with worker1, reference
>>> # count is automatically updated.
>>> rpc.rpc_sync("worker1", f, args(rref,))
)")
.def(
py::init<const py::object&, const py::object&>(),
py::arg("value"),
py::arg("type_hint") = py::none())
.def(
// not releasing GIL here to avoid context switch on getters
"is_owner",
&PyRRef::isOwner,
R"(
Returns whether or not the current node is the owner of this
``RRef``.
)")
.def(
// not releasing GIL here to avoid context switch on getters
"owner",
&PyRRef::owner,
R"(
Returns worker information of the node that owns this ``RRef``.
)")
.def(
"to_here",
&PyRRef::toHere,
py::call_guard<py::gil_scoped_release>(),
R"(
Blocking call that copies the value of the RRef from the owner
to the local node and returns it. If the current node is the
owner, returns a reference to the local value.
)")
.def(
"local_value",
&PyRRef::localValue,
py::call_guard<py::gil_scoped_release>(),
R"(
If the current node is the owner, returns a reference to the
local value. Otherwise, throws an exception.
)")
.def(
py::pickle(
[](const PyRRef& self) {
// __getstate__
return self.pickle();
},
[](py::tuple t) { // NOLINT
// __setstate__
return PyRRef::unpickle(t);
}),
py::call_guard<py::gil_scoped_release>())
// not releasing GIL to avoid context switch
.def("__str__", &PyRRef::str);
// future.wait() should not be called after shutdown(), e.g.,
// pythonRpcHandler is cleaned up in shutdown(), after
// shutdown(), python objects returned from rpc python call can not be
// resolved.
auto future = shared_ptr_class_<FutureMessage>(module, "Future")
.def(
"wait",
[&](FutureMessage& fut) { return toPyObj(fut.wait()); },
py::call_guard<py::gil_scoped_release>(),
R"(
Wait on future to complete and return the object it completed with.
If the future completes with an error, an exception is thrown.
)");
shared_ptr_class_<ProcessGroupRpcBackendOptions>(
module,
"ProcessGroupRpcBackendOptions",
rpcBackendOptions,
R"(
The backend options class for ``ProcessGroupAgent``, which is derived
from ``RpcBackendOptions``.
Arguments:
num_send_recv_threads (int, optional): The number of threads in
the thread-pool used by ``ProcessGroupAgent`` (default: 4).
rpc_timeout (datetime.timedelta, optional): The timeout for RPC
requests (default: ``timedelta(seconds=60)``).
init_method (str, optional): The URL to initialize
``ProcessGroupGloo`` (default: ``env://``).
Example::
>>> import datetime, os
>>> from torch.distributed import rpc
>>> os.environ['MASTER_ADDR'] = 'localhost'
>>> os.environ['MASTER_PORT'] = '29500'
>>>
>>> rpc.init_rpc(
>>> "worker1",
>>> rank=0,
>>> world_size=2,
>>> rpc_backend_options=rpc.ProcessGroupRpcBackendOptions(
>>> num_send_recv_threads=16,
>>> datetime.timedelta(seconds=20)
>>> )
>>> )
>>>
>>> # omitting init_rpc invocation on worker2
)")
.def(
py::init<int, std::chrono::milliseconds, std::string>(),
py::arg("num_send_recv_threads") = kDefaultNumSendRecvThreads,
py::arg("rpc_timeout") = kDefaultRpcTimeout,
py::arg("init_method") = kDefaultInitMethod)
.def_readwrite(
"num_send_recv_threads",
&ProcessGroupRpcBackendOptions::numSendRecvThreads,
R"(
The number of threads in the thread-pool used by ProcessGroupAgent.
)");
module.attr("_DEFAULT_NUM_SEND_RECV_THREADS") =
py::cast(kDefaultNumSendRecvThreads);
shared_ptr_class_<ProcessGroupAgent>(module, "ProcessGroupAgent", rpcAgent)
.def(
py::init<
std::string,
std::shared_ptr<::c10d::ProcessGroup>,
int,
std::chrono::milliseconds>(),
py::arg("name"),
py::arg("process_group"),
py::arg("num_send_recv_threads"),
py::arg("rpc_timeout"))
.def(
"get_worker_info",
(const WorkerInfo& (ProcessGroupAgent::*)(void)const) &
RpcAgent::getWorkerInfo,
py::call_guard<py::gil_scoped_release>())
.def(
"get_worker_info",
(const WorkerInfo& (ProcessGroupAgent::*)(const std::string&)const) &
ProcessGroupAgent::getWorkerInfo,
py::call_guard<py::gil_scoped_release>())
.def(
"get_worker_infos",
(std::vector<WorkerInfo>(ProcessGroupAgent::*)() const) &
ProcessGroupAgent::getWorkerInfos,
py::call_guard<py::gil_scoped_release>())
.def(
"join",
&ProcessGroupAgent::join,
py::call_guard<py::gil_scoped_release>())
.def(
"shutdown",
&ProcessGroupAgent::shutdown,
py::call_guard<py::gil_scoped_release>())
.def(
"sync",
&ProcessGroupAgent::sync,
py::call_guard<py::gil_scoped_release>());
module.def("_is_current_rpc_agent_set", &RpcAgent::isCurrentRpcAgentSet);
module.def("_get_current_rpc_agent", &RpcAgent::getCurrentRpcAgent);
module.def(
"_set_and_start_rpc_agent",
[](const std::shared_ptr<RpcAgent>& rpcAgent) {
RpcAgent::setCurrentRpcAgent(rpcAgent);
// Initializing typeResolver inside RpcAgent constructor will make
// RpcAgent have python dependency. To avoid RpcAgent to have python
// dependency, setTypeResolver() here.
std::shared_ptr<TypeResolver> typeResolver =
std::make_shared<TypeResolver>([&](const c10::QualifiedName& qn) {
auto typePtr = PythonRpcHandler::getInstance().parseTypeFromStr(
qn.qualifiedName());
return c10::StrongTypePtr(
PythonRpcHandler::getInstance().jitCompilationUnit(),
std::move(typePtr));
});
rpcAgent->setTypeResolver(typeResolver);
rpcAgent->start();
},
py::call_guard<py::gil_scoped_release>());
module.def("_reset_current_rpc_agent", []() {
RpcAgent::setCurrentRpcAgent(nullptr);
});
module.def("_destroy_rref_context", [](bool ignoreRRefLeak) {
// NB: do not release GIL in the function. The destroyInstance() method
// returns a list of deleted OwnerRRefs that hold py::object instances.
// Clearing those OwnerRRefs are likely to trigger Python deref, which
// requires GIL.
RRefContext::getInstance().destroyInstance(ignoreRRefLeak).clear();
});
module.def("_rref_context_get_debug_info", []() {
return RRefContext::getInstance().getDebugInfo();
});
module.def(
"_cleanup_python_rpc_handler",
[]() { PythonRpcHandler::getInstance().cleanup(); },
py::call_guard<py::gil_scoped_release>());
module.def(
"_invoke_rpc_builtin",
[](const WorkerInfo& dst,
const std::string& opName,
const std::shared_ptr<torch::autograd::profiler::RecordFunction>& rf,
const py::args& args,
const py::kwargs& kwargs) {
DCHECK(PyGILState_Check());
return pyRpcBuiltin(dst, opName, rf, args, kwargs);
},
py::call_guard<py::gil_scoped_acquire>());
module.def(
"_invoke_rpc_python_udf",
[](const WorkerInfo& dst,
std::string& pickledPythonUDF,
std::vector<torch::Tensor>& tensors,
const std::shared_ptr<torch::autograd::profiler::RecordFunction>& rf) {
DCHECK(!PyGILState_Check());
return pyRpcPythonUdf(dst, pickledPythonUDF, tensors, rf);
},
py::call_guard<py::gil_scoped_release>(),
py::arg("dst"),
py::arg("pickledPythonUDF"),
py::arg("tensors"),
py::arg("rf") = nullptr);
// TODO This python future wrapper wraps c10::ivalue::Future.
// Will merge with JIT PythonFutureWrapper while merging generic Future with
// c10::ivalue::Future later on.
struct PythonFutureWrapper {
explicit PythonFutureWrapper(c10::intrusive_ptr<c10::ivalue::Future> fut)
: fut(std::move(fut)) {}
c10::intrusive_ptr<c10::ivalue::Future> fut;
};
// Since FutureMessage is binded to Future, here we need to bind the
// PythonFutureWrapper to a different name.
// TODO Once python object can be tagged as IValue and c10::ivalue::Future is
// implemented as generic Future<IValue>, we can consider all rpc call
// to return a future<IValue> later on.
shared_ptr_class_<PythonFutureWrapper>(module, "_pyFuture")
.def(
"wait",
[](PythonFutureWrapper& fut) {
fut.fut->wait();
auto res = fut.fut->value();
{
// acquiring GIL as torch::jit::toPyObject creates new py::object
// without grabbing the GIL.
pybind11::gil_scoped_acquire ag;
return torch::jit::toPyObject(std::move(res));
}
},
py::call_guard<py::gil_scoped_release>());
module.def(
"_invoke_rpc_torchscript",
[](const std::string& dstWorkerName,
const py::object& userCallable,
const py::tuple& argsTuple,
const py::dict& kwargsDict) {
DCHECK(!PyGILState_Check());
// No need to catch exception here, if function can not be found,
// exception will be thrown in get_function() call; if args do not match
// with function schema, exception will be thrown in
// createStackForSchema() call.
auto& pythonRpcHandler = PythonRpcHandler::getInstance();
c10::QualifiedName qualifiedName =
pythonRpcHandler.getQualifiedName(userCallable);
c10::FunctionSchema functionSchema =
pythonRpcHandler.jitCompilationUnit()
->get_function(qualifiedName)
.getSchema();
Stack stack;
{
py::gil_scoped_acquire acquire;
stack = torch::jit::createStackForSchema(
functionSchema,
argsTuple.cast<py::args>(),
kwargsDict.cast<py::kwargs>(),
c10::nullopt);
}
DCHECK(!PyGILState_Check());
c10::intrusive_ptr<c10::ivalue::Future> fut =
rpcTorchscript(dstWorkerName, qualifiedName, functionSchema, stack);
return PythonFutureWrapper(fut);
},
py::call_guard<py::gil_scoped_release>());
module.def(
"_invoke_remote_builtin",
[](const WorkerInfo& dst,
const std::string& opName,
const std::shared_ptr<torch::autograd::profiler::RecordFunction>& rf,
const py::args& args,
const py::kwargs& kwargs) {
DCHECK(PyGILState_Check());
return pyRemoteBuiltin(dst, opName, rf, args, kwargs);
},
py::call_guard<py::gil_scoped_acquire>());
module.def(
"_invoke_remote_torchscript",
[](const std::string& dstWorkerName,
const std::string& qualifiedNameStr,
const py::args& args,
const py::kwargs& kwargs) {
DCHECK(!PyGILState_Check());
auto qualifiedName = c10::QualifiedName(qualifiedNameStr);
auto functionSchema = PythonRpcHandler::getInstance()
.jitCompilationUnit()
->get_function(qualifiedName)
.getSchema();
Stack stack;
// Acquire GIL for py::args and py::kwargs processing.
{
pybind11::gil_scoped_acquire ag;
stack = torch::jit::createStackForSchema(
functionSchema, args, kwargs, c10::nullopt);
}
DCHECK(!PyGILState_Check());
auto rrefPtr = remoteTorchscript(
dstWorkerName, qualifiedName, functionSchema, stack);
return PyRRef(rrefPtr);
},
py::call_guard<py::gil_scoped_release>());
module.def(
"_invoke_remote_python_udf",
[](const WorkerInfo& dst,
std::string& pickledPythonUDF,
std::vector<torch::Tensor>& tensors,
const std::shared_ptr<torch::autograd::profiler::RecordFunction>& rf) {
DCHECK(!PyGILState_Check());
return pyRemotePythonUdf(dst, pickledPythonUDF, tensors, rf);
},
py::call_guard<py::gil_scoped_release>(),
py::arg("dst"),
py::arg("pickledPythonUDF"),
py::arg("tensors"),
py::arg("rf") = nullptr);
module.def(
"get_rpc_timeout",
[]() { return RpcAgent::getCurrentRpcAgent()->getRpcTimeout(); },
R"(
Retrieve the timeout for all RPCs that was set during RPC initialization.
Returns:
``datetime.timedelta`` instance indicating the RPC timeout.
)");
module.def(
"enable_gil_profiling",
[](bool flag) {
RpcAgent::getCurrentRpcAgent()->enableGILProfiling(flag);
},
R"(
Set whether GIL wait times should be enabled or not. This incurs a slight
overhead cost. Default is disabled for performance reasons.
Arguments:
flag (bool): True to set GIL profiling, False to disable.
)");
module.def(
"_set_rpc_timeout",
[](const std::chrono::milliseconds& rpcTimeout) {
RpcAgent::getCurrentRpcAgent()->setRpcTimeout(rpcTimeout);
},
R"(
Set the timeout for all RPCs. If an RPC is not completed within this
time, an exception indicating it has timed out will be raised.
)");
Py_RETURN_TRUE;
}
} // namespace
static PyMethodDef methods[] = { // NOLINT
{"_rpc_init", (PyCFunction)rpc_init, METH_NOARGS, nullptr},
{nullptr, nullptr, 0, nullptr}};
PyMethodDef* python_functions() {
return methods;
}
} // namespace rpc
} // namespace distributed
} // namespace torch
| [
"facebook-github-bot@users.noreply.github.com"
] | facebook-github-bot@users.noreply.github.com |
7900c432256dfa22a468a8a383adeab669def238 | c51febc209233a9160f41913d895415704d2391f | /YorozuyaGSLib/source/CReturnGateCreateParam.cpp | e9be5fdc4a01becf938fbbb7fd2cba2119ace20e | [
"MIT"
] | permissive | roussukke/Yorozuya | 81f81e5e759ecae02c793e65d6c3acc504091bc3 | d9a44592b0714da1aebf492b64fdcb3fa072afe5 | refs/heads/master | 2023-07-08T03:23:00.584855 | 2023-06-29T08:20:25 | 2023-06-29T08:20:25 | 463,330,454 | 0 | 0 | MIT | 2022-02-24T23:15:01 | 2022-02-24T23:15:00 | null | UTF-8 | C++ | false | false | 1,107 | cpp | #include <CReturnGateCreateParam.hpp>
START_ATF_NAMESPACE
CReturnGateCreateParam::CReturnGateCreateParam(struct CPlayer* pkOwner)
{
using org_ptr = void (WINAPIV*)(struct CReturnGateCreateParam*, struct CPlayer*);
(org_ptr(0x1401684e0L))(this, pkOwner);
};
void CReturnGateCreateParam::ctor_CReturnGateCreateParam(struct CPlayer* pkOwner)
{
using org_ptr = void (WINAPIV*)(struct CReturnGateCreateParam*, struct CPlayer*);
(org_ptr(0x1401684e0L))(this, pkOwner);
};
struct CPlayer* CReturnGateCreateParam::GetOwner()
{
using org_ptr = struct CPlayer* (WINAPIV*)(struct CReturnGateCreateParam*);
return (org_ptr(0x1401692d0L))(this);
};
CReturnGateCreateParam::~CReturnGateCreateParam()
{
using org_ptr = void (WINAPIV*)(struct CReturnGateCreateParam*);
(org_ptr(0x140251510L))(this);
};
void CReturnGateCreateParam::dtor_CReturnGateCreateParam()
{
using org_ptr = void (WINAPIV*)(struct CReturnGateCreateParam*);
(org_ptr(0x140251510L))(this);
};
END_ATF_NAMESPACE
| [
"b1ll.cipher@yandex.ru"
] | b1ll.cipher@yandex.ru |
a970a8fb8e55a91b961be2e4c457f1bb079b6ee1 | c05f4620e3247ebeb6cc2b577a4ca8a125c82ab1 | /Actividades/A1.2.iterator/iterator.cpp | f02af6c6b432c9c3113819c8d119fe7bd4fd43c7 | [] | no_license | semylevy/A01023530_aymss18 | 4c6500fe71417fa86c1cd3021822d5b7a5b009e6 | bc9ccc55e27406866b0426027e83e9b8e0e5b4ed | refs/heads/master | 2021-05-12T14:35:41.104814 | 2019-01-14T19:53:30 | 2019-01-14T19:53:30 | 116,961,384 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,772 | cpp | #include <iostream>
using namespace std;
class IntCollection;
class Iterator {
protected:
IntCollection* collection;
int count;
public:
virtual bool hasNext() = 0;
virtual int next() = 0;
};
class IntCollection {
public:
virtual void add(int element) = 0;
virtual int at(int position) = 0;
virtual Iterator* getIterator() = 0;
virtual int getNumElements() = 0;
};
class IntArray;
class ArrayIterator : public Iterator {
public:
ArrayIterator(IntArray* intArray) {
collection = (IntCollection*)intArray;
count = 0;
}
int next() {
return collection->at(count++);
}
bool hasNext(){
if( count >= collection->getNumElements()) {
return false;
}
return true;
}
};
class IntArray : public IntCollection {
protected:
int* array;
int size;
int numElems;
public:
IntArray() {
size = 10;
array = new int[size];
numElems = 0;
}
void add(int element) {
if(numElems >= size) {
cout << "No more space" << endl;
return;
}
array[numElems++] = element;
}
int at(int position) {
if(size <= position < 0) {
cout << "index not valid" << endl;
throw "out_of_range";
}
return array[position];
}
Iterator* getIterator() {
return new ArrayIterator(this);
}
int getNumElements() {
return numElems;
}
};
int main(int argc, char const *argv[]) {
IntCollection* c = new IntArray;
c->add(2);
c->add(3);
c->add(14);
c->add(2);
Iterator* i = c->getIterator();
while( i->hasNext() ) {
cout << i->next() << " ";
}
cout << endl;
return 0;
}
| [
"semylevy@hotmail.com"
] | semylevy@hotmail.com |
a91c081e475d9a3b57d3c1847a2bde301454a03e | d6258ae3c0fd9f36efdd859a2c93ab489da2aa9b | /fulldocset/add/codesnippet/CPP/p-system.windows.forms.w_4_1.cpp | 92e28ce6d069f519efa51052946634d90fb006c9 | [
"CC-BY-4.0",
"MIT"
] | permissive | OpenLocalizationTestOrg/ECMA2YamlTestRepo2 | ca4d3821767bba558336b2ef2d2a40aa100d67f6 | 9a577bbd8ead778fd4723fbdbce691e69b3b14d4 | refs/heads/master | 2020-05-26T22:12:47.034527 | 2017-03-07T07:07:15 | 2017-03-07T07:07:15 | 82,508,764 | 1 | 0 | null | 2017-02-28T02:14:26 | 2017-02-20T02:36:59 | Visual Basic | UTF-8 | C++ | false | false | 433 | cpp | // Navigates WebBrowser1 to the next page in history.
void ButtonForward_Click( System::Object^ /*sender*/, System::EventArgs^ /*e*/ )
{
this->WebBrowser1->GoForward();
}
// Disables the Forward button at the end of navigation history.
void WebBrowser1_CanGoForwardChanged( System::Object^ /*sender*/, System::EventArgs^ /*e*/ )
{
this->ButtonForward->Enabled = this->WebBrowser1->CanGoForward;
} | [
"tianzh@microsoft.com"
] | tianzh@microsoft.com |
f5cddda48e39ddb16d1f0221eaa8a698c5cf3353 | 820fd14cd7ff7e7cd676f138b0619c529509df2c | /HighResolutionPrinter/VecTextOBJ.cpp | 81b1be8276ef9e26cbb650c1463b8dd41dc8fca9 | [] | no_license | FREEWING-JP/TwoCharPrinter | 22273d66262906f41c4b23270dd3cd21f610b471 | 1e4bd7f13a9336e439fdb91f46a673ab7061daa5 | refs/heads/master | 2023-03-24T07:01:40.526066 | 2021-03-24T01:41:20 | 2021-03-24T01:41:20 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 751 | cpp | #include "VecTextOBJ.h"
CVecTextOBJ::CVecTextOBJ(void)
{
}
CVecTextOBJ::CVecTextOBJ(OBJ_Control obj,CVecTextOBJ VecTextObj)
{
strType1 = obj.strType1;
strType2 = obj.strType2;
intX = obj.intX;
intY = obj.intY;
intSW = obj.intSW;
intSS = obj.intSS;
strFont = obj.strFont;
strText = obj.strText;
booNEG = obj.booNEG;
booBWDx = obj.booBWDx;
booBWDy = obj.booBWDy;
intLineSize = obj.intLineSize;
intRowSize = obj.intRowSize;
intLineStart = obj.intLineStart;
intRowStart = obj.intRowStart;
booFocus = obj.booFocus;
intFontSize = VecTextObj.intFontSize;
SideLength = 1;
intSideHight = intLineSize;
intSideWidth = intRowSize;
booDotVecText.clear();
booDotVecText = obj.booDotVecText;
}
CVecTextOBJ::~CVecTextOBJ(void)
{
}
| [
"57797239+zwjbrother@users.noreply.github.com"
] | 57797239+zwjbrother@users.noreply.github.com |
7bad16cd1734ca8b7e316cb3c9e5c059da2736f1 | b41f6e98f4f09494a1d06dc33102e6909700392c | /src/MainWindow.hpp | a9f6084cdec1b8f41651155951689bca07aae8d1 | [
"MIT"
] | permissive | marsiliano/qode | 2c963cde78b59b2b2729f8cb2db8516ebfd05c28 | 8be6848a675f73dd09f0f33e2fa67510b6972041 | refs/heads/master | 2022-06-19T23:14:23.919069 | 2020-05-07T16:48:29 | 2020-05-07T16:50:09 | 260,882,963 | 0 | 0 | null | 2020-05-03T10:34:07 | 2020-05-03T10:34:06 | null | UTF-8 | C++ | false | false | 640 | hpp | #pragma once
#include <QMainWindow>
#include "Editor.hpp"
#include "FileSystemView.hpp"
#include "ToolBar.hpp"
QT_BEGIN_NAMESPACE
namespace Ui {
class MainWindow;
} // namespace Ui
QT_END_NAMESPACE
class MainWindow : public QMainWindow
{
Q_OBJECT
public:
MainWindow(QWidget *parent = nullptr);
~MainWindow() override;
void setTreeViewPath(QString filename);
public slots:
void open(QString filename);
void openAndSetPath(QString filename);
private slots:
void save();
private:
Ui::MainWindow *ui;
Editor m_editor;
ToolBar m_toolbar;
FileSystemView m_fsView;
QFile m_currentOpen;
};
| [
"guerinoni.federico@gmail.com"
] | guerinoni.federico@gmail.com |
91d0f897c9618b766ac53b3327fb0cc43f89efca | 34dd7dce81e0d728756110428a3b17764e44549e | /AssemblyB.cpp | eb4e9f2cae2a1cdb260f3d76a8fcf8fca3bfee89 | [] | no_license | gnrlpz/CS162BLab04 | 6f62cca49b631b30328331d76212a30a653ebdab | 4142165dd69a063e5fc0d8c5d700b8cc2e9a1987 | refs/heads/master | 2021-04-29T22:06:10.994074 | 2018-02-16T03:35:08 | 2018-02-16T03:35:08 | 121,630,525 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 176 | cpp | int dummy (int a, int b) {
int x = a + b;
int y = a - b;
int z = a * b;
int w = a / b;
int v = a % b;
return 0;
}
int main(void) {
int temp = dummy(19, 3);
return 0;
} | [
"gener.lopez@gmail.com"
] | gener.lopez@gmail.com |
f51e5c41bada8bdf50e49f25f365cbe2053c2c80 | fc585e577235a03b2ec749f5a947e2e3cde9c97f | /src/Interface/Modules/Fields/CreateImageDialog.cc | ef4a9a8bf4f3d8ce7e6346cb34ffaa2d52ee080d | [
"MIT"
] | permissive | gongch/SCIRun | 670b85f8aa45681580fa7406dc9cc91ca550a1f2 | d8b26d69ebb3b087dcdd861bed2da115133a468f | refs/heads/master | 2021-01-03T18:52:56.346016 | 2020-02-12T16:05:55 | 2020-02-12T16:05:55 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,999 | cc | /*
For more information, please see: http://software.sci.utah.edu
The MIT License
Copyright (c) 2015 Scientific Computing and Imaging Institute,
University of Utah.
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 <Interface/Modules/Fields/CreateImageDialog.h>
#include <Modules/Legacy/Fields/CreateImage.h>
#include <Dataflow/Network/ModuleStateInterface.h> //TODO: extract into intermediate
using namespace SCIRun::Gui;
using namespace SCIRun::Dataflow::Networks;
typedef SCIRun::Modules::Fields::CreateImage CreateImageModule;
CreateImageDialog::CreateImageDialog(const std::string& name, ModuleStateHandle state,
QWidget* parent /* = 0 */)
: ModuleDialogGeneric(state, parent)
{
setupUi(this);
setWindowTitle(QString::fromStdString(name));
fixSize();
addSpinBoxManager(width_, CreateImageModule::Width);
addSpinBoxManager(height_, CreateImageModule::Height);
addDoubleSpinBoxManager(padPercentageSpinBox_, CreateImageModule::PadPercent);
addComboBoxManager(mode_, CreateImageModule::Mode);
addComboBoxManager(axis_, CreateImageModule::Axis);
addDoubleSpinBoxManager(centerX_, CreateImageModule::CenterX);
addDoubleSpinBoxManager(centerY_, CreateImageModule::CenterY);
addDoubleSpinBoxManager(centerZ_, CreateImageModule::CenterZ);
addDoubleSpinBoxManager(normalX_, CreateImageModule::NormalX);
addDoubleSpinBoxManager(normalY_, CreateImageModule::NormalY);
addDoubleSpinBoxManager(normalZ_, CreateImageModule::NormalZ);
addDoubleSpinBoxManager(position_, CreateImageModule::Position);
connect(mode_, SIGNAL(activated(const QString&)), this, SLOT(enableWidgets(const QString&)));
addComboBoxManager(dataLocation_, CreateImageModule::DataLocation);
}
void CreateImageDialog::enableWidgets(const QString& mode)
{
index_->setReadOnly(mode!="Auto");
}
void CreateImageDialog::pullSpecial()
{
enableWidgets(QString::fromStdString(state_->getValue(CreateImageModule::Mode).toString()));
}
| [
"chhabragarima15@gmail.com"
] | chhabragarima15@gmail.com |
e891b2805cd5345197a6a31e74461e4c809c5e9d | c008f88941235837dbf809d39113911b54934fbe | /sample/android/sample/haxe/bin/src/Xml.cpp | 3fbe626b5eda36f5c4b01c2c16042f3694c04217 | [
"MIT"
] | permissive | proletariatgames/nmexpro | fb90b6c6465c57f5e8b0987deafdd2effc3dd8ce | 1f322c4e126543b30db20fc90d99202b1cac5c94 | refs/heads/master | 2022-05-04T02:05:12.648496 | 2022-03-24T17:31:09 | 2022-03-24T17:31:09 | 8,226,048 | 0 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 43,989 | cpp | #include <hxcpp.h>
#ifndef INCLUDED_Reflect
#include <Reflect.h>
#endif
#ifndef INCLUDED_StringBuf
#include <StringBuf.h>
#endif
#ifndef INCLUDED_Type
#include <Type.h>
#endif
#ifndef INCLUDED_Xml
#include <Xml.h>
#endif
#ifndef INCLUDED_XmlType
#include <XmlType.h>
#endif
#ifndef INCLUDED_cpp_Lib
#include <cpp/Lib.h>
#endif
Void Xml_obj::__construct()
{
{
}
;
return null();
}
Xml_obj::~Xml_obj() { }
Dynamic Xml_obj::__CreateEmpty() { return new Xml_obj; }
hx::ObjectPtr< Xml_obj > Xml_obj::__new()
{ hx::ObjectPtr< Xml_obj > result = new Xml_obj();
result->__construct();
return result;}
Dynamic Xml_obj::__Create(hx::DynamicArray inArgs)
{ hx::ObjectPtr< Xml_obj > result = new Xml_obj();
result->__construct();
return result;}
void Xml_obj::__init__(){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",407)
::Xml_obj::PCData = ::Type_obj::createEnum(hx::ClassOf< ::XmlType >(),HX_CSTRING("__"),null());
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",408)
::Xml_obj::Element = ::Type_obj::createEnum(hx::ClassOf< ::XmlType >(),HX_CSTRING("__"),null());
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",409)
::Xml_obj::CData = ::Type_obj::createEnum(hx::ClassOf< ::XmlType >(),HX_CSTRING("__"),null());
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",410)
::Xml_obj::Comment = ::Type_obj::createEnum(hx::ClassOf< ::XmlType >(),HX_CSTRING("__"),null());
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",411)
::Xml_obj::DocType = ::Type_obj::createEnum(hx::ClassOf< ::XmlType >(),HX_CSTRING("__"),null());
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",412)
::Xml_obj::Prolog = ::Type_obj::createEnum(hx::ClassOf< ::XmlType >(),HX_CSTRING("__"),null());
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",413)
::Xml_obj::Document = ::Type_obj::createEnum(hx::ClassOf< ::XmlType >(),HX_CSTRING("__"),null());
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",414)
::__hxcpp_enum_force(::Xml_obj::PCData,HX_CSTRING("pcdata"),(int)0);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",415)
::__hxcpp_enum_force(::Xml_obj::Element,HX_CSTRING("element"),(int)1);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",416)
::__hxcpp_enum_force(::Xml_obj::CData,HX_CSTRING("cdata"),(int)2);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",417)
::__hxcpp_enum_force(::Xml_obj::Comment,HX_CSTRING("comment"),(int)3);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",418)
::__hxcpp_enum_force(::Xml_obj::DocType,HX_CSTRING("doctype"),(int)4);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",419)
::__hxcpp_enum_force(::Xml_obj::Prolog,HX_CSTRING("prolog"),(int)5);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",420)
::__hxcpp_enum_force(::Xml_obj::Document,HX_CSTRING("document"),(int)6);
}
::String Xml_obj::getNodeName( ){
HX_SOURCE_PUSH("Xml_obj::getNodeName")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",172)
if (((this->nodeType != ::Xml_obj::Element))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",173)
hx::Throw (HX_CSTRING("bad nodeType"));
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",174)
return this->_nodeName;
}
HX_DEFINE_DYNAMIC_FUNC0(Xml_obj,getNodeName,return )
::String Xml_obj::setNodeName( ::String n){
HX_SOURCE_PUSH("Xml_obj::setNodeName")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",178)
if (((this->nodeType != ::Xml_obj::Element))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",179)
hx::Throw (HX_CSTRING("bad nodeType"));
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",180)
return this->_nodeName = n;
}
HX_DEFINE_DYNAMIC_FUNC1(Xml_obj,setNodeName,return )
::String Xml_obj::getNodeValue( ){
HX_SOURCE_PUSH("Xml_obj::getNodeValue")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",184)
if (((bool((this->nodeType == ::Xml_obj::Element)) || bool((this->nodeType == ::Xml_obj::Document))))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",185)
hx::Throw (HX_CSTRING("bad nodeType"));
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",186)
return this->_nodeValue;
}
HX_DEFINE_DYNAMIC_FUNC0(Xml_obj,getNodeValue,return )
::String Xml_obj::setNodeValue( ::String v){
HX_SOURCE_PUSH("Xml_obj::setNodeValue")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",190)
if (((bool((this->nodeType == ::Xml_obj::Element)) || bool((this->nodeType == ::Xml_obj::Document))))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",191)
hx::Throw (HX_CSTRING("bad nodeType"));
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",192)
return this->_nodeValue = v;
}
HX_DEFINE_DYNAMIC_FUNC1(Xml_obj,setNodeValue,return )
::Xml Xml_obj::getParent( ){
HX_SOURCE_PUSH("Xml_obj::getParent")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",196)
return this->_parent;
}
HX_DEFINE_DYNAMIC_FUNC0(Xml_obj,getParent,return )
::String Xml_obj::get( ::String att){
HX_SOURCE_PUSH("Xml_obj::get")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",201)
if (((this->nodeType != ::Xml_obj::Element))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",202)
hx::Throw (HX_CSTRING("bad nodeType"));
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",203)
return ::Reflect_obj::field(this->_attributes,att);
}
HX_DEFINE_DYNAMIC_FUNC1(Xml_obj,get,return )
Void Xml_obj::set( ::String att,::String value){
{
HX_SOURCE_PUSH("Xml_obj::set")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",207)
if (((this->nodeType != ::Xml_obj::Element))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",208)
hx::Throw (HX_CSTRING("bad nodeType"));
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",209)
if (((this->_attributes == null()))){
struct _Function_2_1{
inline static Dynamic Block( ){
hx::Anon __result = hx::Anon_obj::Create();
return __result;
}
};
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",210)
this->_attributes = _Function_2_1::Block();
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",211)
{
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",211)
Dynamic o = this->_attributes;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",211)
if (((o != null()))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",211)
o->__SetField(att,value);
}
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",212)
return null();
}
return null();
}
HX_DEFINE_DYNAMIC_FUNC2(Xml_obj,set,(void))
Void Xml_obj::remove( ::String att){
{
HX_SOURCE_PUSH("Xml_obj::remove")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",216)
if (((this->nodeType != ::Xml_obj::Element))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",217)
hx::Throw (HX_CSTRING("bad nodeType"));
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",218)
::Reflect_obj::deleteField(this->_attributes,att);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",219)
return null();
}
return null();
}
HX_DEFINE_DYNAMIC_FUNC1(Xml_obj,remove,(void))
bool Xml_obj::exists( ::String att){
HX_SOURCE_PUSH("Xml_obj::exists")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",223)
if (((this->nodeType != ::Xml_obj::Element))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",224)
hx::Throw (HX_CSTRING("bad nodeType"));
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",225)
return ::Reflect_obj::hasField(this->_attributes,att);
}
HX_DEFINE_DYNAMIC_FUNC1(Xml_obj,exists,return )
Dynamic Xml_obj::attributes( ){
HX_SOURCE_PUSH("Xml_obj::attributes")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",229)
if (((this->nodeType != ::Xml_obj::Element))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",230)
hx::Throw (HX_CSTRING("bad nodeType"));
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",231)
return ::Reflect_obj::fields(this->_attributes)->iterator();
}
HX_DEFINE_DYNAMIC_FUNC0(Xml_obj,attributes,return )
Dynamic Xml_obj::iterator( ){
HX_SOURCE_PUSH("Xml_obj::iterator")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",235)
if (((this->_children == null()))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",236)
hx::Throw (HX_CSTRING("bad nodetype"));
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",237)
return this->_children->__Field(HX_CSTRING("iterator"))();
}
HX_DEFINE_DYNAMIC_FUNC0(Xml_obj,iterator,return )
Dynamic Xml_obj::elements( ){
HX_SOURCE_PUSH("Xml_obj::elements")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",242)
if (((this->_children == null()))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",243)
hx::Throw (HX_CSTRING("bad nodetype"));
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",244)
Dynamic children = Dynamic( Array_obj<Dynamic>::__new().Add(this->_children));
struct _Function_1_1{
inline static Dynamic Block( Dynamic &children){
hx::Anon __result = hx::Anon_obj::Create();
__result->Add(HX_CSTRING("cur") , (int)0,false);
HX_BEGIN_LOCAL_FUNC_S1(hx::LocalThisFunc,_Function_2_1,Dynamic,children)
bool run(){
{
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",248)
int k = __this->__Field(HX_CSTRING("cur"));
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",249)
int l = children->__GetItem((int)0)->__Field(HX_CSTRING("length"));
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",250)
while(((k < l))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",251)
if (((children->__GetItem((int)0)->__GetItem(k)->__Field(HX_CSTRING("nodeType")) == ::Xml_obj::Element))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",252)
break;
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",253)
hx::AddEq(k,(int)1);
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",255)
__this->__FieldRef(HX_CSTRING("cur")) = k;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",256)
return (k < l);
}
return null();
}
HX_END_LOCAL_FUNC0(return)
__result->Add(HX_CSTRING("hasNext") , Dynamic(new _Function_2_1(children)),true);
HX_BEGIN_LOCAL_FUNC_S1(hx::LocalThisFunc,_Function_2_2,Dynamic,children)
Dynamic run(){
{
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",259)
int k = __this->__Field(HX_CSTRING("cur"));
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",260)
int l = children->__GetItem((int)0)->__Field(HX_CSTRING("length"));
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",261)
while(((k < l))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",262)
Dynamic n = children->__GetItem((int)0)->__GetItem(k);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",263)
hx::AddEq(k,(int)1);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",264)
if (((n->__Field(HX_CSTRING("nodeType")) == ::Xml_obj::Element))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",265)
__this->__FieldRef(HX_CSTRING("cur")) = k;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",266)
return n;
}
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",269)
return null();
}
return null();
}
HX_END_LOCAL_FUNC0(return)
__result->Add(HX_CSTRING("next") , Dynamic(new _Function_2_2(children)),true);
return __result;
}
};
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",245)
return _Function_1_1::Block(children);
}
HX_DEFINE_DYNAMIC_FUNC0(Xml_obj,elements,return )
Dynamic Xml_obj::elementsNamed( ::String name){
HX_SOURCE_PUSH("Xml_obj::elementsNamed")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",274)
Array< ::String > name1 = Array_obj< ::String >::__new().Add(name);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",275)
if (((this->_children == null()))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",276)
hx::Throw (HX_CSTRING("bad nodetype"));
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",277)
Dynamic children = Dynamic( Array_obj<Dynamic>::__new().Add(this->_children));
struct _Function_1_1{
inline static Dynamic Block( Dynamic &children,Array< ::String > &name1){
hx::Anon __result = hx::Anon_obj::Create();
__result->Add(HX_CSTRING("cur") , (int)0,false);
HX_BEGIN_LOCAL_FUNC_S2(hx::LocalThisFunc,_Function_2_1,Dynamic,children,Array< ::String >,name1)
bool run(){
{
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",281)
int k = __this->__Field(HX_CSTRING("cur"));
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",282)
int l = children->__GetItem((int)0)->__Field(HX_CSTRING("length"));
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",283)
while(((k < l))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",284)
Dynamic n = children->__GetItem((int)0)->__GetItem(k);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",285)
if (((bool((n->__Field(HX_CSTRING("nodeType")) == ::Xml_obj::Element)) && bool((n->__Field(HX_CSTRING("_nodeName")) == name1->__get((int)0)))))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",286)
break;
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",287)
(k)++;
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",289)
__this->__FieldRef(HX_CSTRING("cur")) = k;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",290)
return (k < l);
}
return null();
}
HX_END_LOCAL_FUNC0(return)
__result->Add(HX_CSTRING("hasNext") , Dynamic(new _Function_2_1(children,name1)),true);
HX_BEGIN_LOCAL_FUNC_S2(hx::LocalThisFunc,_Function_2_2,Dynamic,children,Array< ::String >,name1)
Dynamic run(){
{
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",293)
int k = __this->__Field(HX_CSTRING("cur"));
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",294)
int l = children->__GetItem((int)0)->__Field(HX_CSTRING("length"));
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",295)
while(((k < l))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",296)
Dynamic n = children->__GetItem((int)0)->__GetItem(k);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",297)
(k)++;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",298)
if (((bool((n->__Field(HX_CSTRING("nodeType")) == ::Xml_obj::Element)) && bool((n->__Field(HX_CSTRING("_nodeName")) == name1->__get((int)0)))))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",299)
__this->__FieldRef(HX_CSTRING("cur")) = k;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",300)
return n;
}
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",303)
return null();
}
return null();
}
HX_END_LOCAL_FUNC0(return)
__result->Add(HX_CSTRING("next") , Dynamic(new _Function_2_2(children,name1)),true);
return __result;
}
};
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",278)
return _Function_1_1::Block(children,name1);
}
HX_DEFINE_DYNAMIC_FUNC1(Xml_obj,elementsNamed,return )
::Xml Xml_obj::firstChild( ){
HX_SOURCE_PUSH("Xml_obj::firstChild")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",309)
if (((this->_children == null()))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",310)
hx::Throw (HX_CSTRING("bad nodetype"));
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",311)
return this->_children->__GetItem((int)0);
}
HX_DEFINE_DYNAMIC_FUNC0(Xml_obj,firstChild,return )
::Xml Xml_obj::firstElement( ){
HX_SOURCE_PUSH("Xml_obj::firstElement")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",315)
if (((this->_children == null()))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",316)
hx::Throw (HX_CSTRING("bad nodetype"));
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",317)
{
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",317)
int _g1 = (int)0;
int _g = this->_children->__Field(HX_CSTRING("length"));
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",317)
while(((_g1 < _g))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",317)
int cur = (_g1)++;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",318)
::Xml n = this->_children->__GetItem(cur);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",319)
if (((n->nodeType == ::Xml_obj::Element))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",320)
return n;
}
}
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",322)
return null();
}
HX_DEFINE_DYNAMIC_FUNC0(Xml_obj,firstElement,return )
Void Xml_obj::addChild( ::Xml x){
{
HX_SOURCE_PUSH("Xml_obj::addChild")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",326)
if (((this->_children == null()))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",327)
hx::Throw (HX_CSTRING("bad nodetype"));
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",328)
if (((x->_parent != null()))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",328)
x->_parent->_children->__Field(HX_CSTRING("remove"))(x);
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",329)
x->_parent = hx::ObjectPtr<OBJ_>(this);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",330)
this->_children->__Field(HX_CSTRING("push"))(x);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",331)
return null();
}
return null();
}
HX_DEFINE_DYNAMIC_FUNC1(Xml_obj,addChild,(void))
bool Xml_obj::removeChild( ::Xml x){
HX_SOURCE_PUSH("Xml_obj::removeChild")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",335)
if (((this->_children == null()))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",336)
hx::Throw (HX_CSTRING("bad nodetype"));
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",337)
bool b = this->_children->__Field(HX_CSTRING("remove"))(x);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",338)
if ((b)){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",338)
x->_parent = null();
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",339)
return b;
}
HX_DEFINE_DYNAMIC_FUNC1(Xml_obj,removeChild,return )
Void Xml_obj::insertChild( ::Xml x,int pos){
{
HX_SOURCE_PUSH("Xml_obj::insertChild")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",343)
if (((this->_children == null()))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",344)
hx::Throw (HX_CSTRING("bad nodetype"));
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",345)
if (((x->_parent != null()))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",345)
x->_parent->_children->__Field(HX_CSTRING("remove"))(x);
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",346)
x->_parent = hx::ObjectPtr<OBJ_>(this);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",347)
this->_children->__Field(HX_CSTRING("insert"))(pos,x);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",348)
return null();
}
return null();
}
HX_DEFINE_DYNAMIC_FUNC2(Xml_obj,insertChild,(void))
::String Xml_obj::toString( ){
HX_SOURCE_PUSH("Xml_obj::toString")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",352)
::StringBuf s = ::StringBuf_obj::__new();
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",353)
this->toStringRec(s);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",354)
return s->b->__Field(HX_CSTRING("join"))(HX_CSTRING(""));
}
HX_DEFINE_DYNAMIC_FUNC0(Xml_obj,toString,return )
Void Xml_obj::toStringRec( ::StringBuf s){
{
HX_SOURCE_PUSH("Xml_obj::toStringRec")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",357)
::XmlType _switch_1 = (this->nodeType);
if ( ( _switch_1==::Xml_obj::Document)){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",360)
int _g = (int)0;
Dynamic _g1 = this->_children;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",360)
while(((_g < _g1->__Field(HX_CSTRING("length"))))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",360)
Dynamic x = _g1->__GetItem(_g);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",360)
++(_g);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",361)
x->__Field(HX_CSTRING("toStringRec"))(s);
}
}
else if ( ( _switch_1==::Xml_obj::Element)){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",363)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = ::String::fromCharCode((int)60);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",364)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = this->_nodeName;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",365)
{
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",365)
int _g = (int)0;
Array< ::String > _g1 = ::Reflect_obj::fields(this->_attributes);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",365)
while(((_g < _g1->length))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",365)
::String k = _g1->__get(_g);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",365)
++(_g);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",366)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = ::String::fromCharCode((int)32);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",367)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = k;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",368)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = ::String::fromCharCode((int)61);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",369)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = ::String::fromCharCode((int)34);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",370)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = ::Reflect_obj::field(this->_attributes,k);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",371)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = ::String::fromCharCode((int)34);
}
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",373)
if (((this->_children->__Field(HX_CSTRING("length")) == (int)0))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",374)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = ::String::fromCharCode((int)47);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",375)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = ::String::fromCharCode((int)62);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",376)
return null();
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",378)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = ::String::fromCharCode((int)62);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",379)
{
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",379)
int _g = (int)0;
Dynamic _g1 = this->_children;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",379)
while(((_g < _g1->__Field(HX_CSTRING("length"))))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",379)
Dynamic x = _g1->__GetItem(_g);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",379)
++(_g);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",380)
x->__Field(HX_CSTRING("toStringRec"))(s);
}
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",381)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = ::String::fromCharCode((int)60);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",382)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = ::String::fromCharCode((int)47);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",383)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = this->_nodeName;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",384)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = ::String::fromCharCode((int)62);
}
else if ( ( _switch_1==::Xml_obj::PCData)){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",385)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = this->_nodeValue;
}
else if ( ( _switch_1==::Xml_obj::CData)){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",388)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = HX_CSTRING("<![CDATA[");
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",389)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = this->_nodeValue;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",390)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = HX_CSTRING("]]>");
}
else if ( ( _switch_1==::Xml_obj::Comment)){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",392)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = HX_CSTRING("<!--");
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",393)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = this->_nodeValue;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",394)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = HX_CSTRING("-->");
}
else if ( ( _switch_1==::Xml_obj::DocType)){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",396)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = HX_CSTRING("<!DOCTYPE ");
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",397)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = this->_nodeValue;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",398)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = HX_CSTRING(">");
}
else if ( ( _switch_1==::Xml_obj::Prolog)){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",400)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = HX_CSTRING("<?");
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",401)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = this->_nodeValue;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",402)
hx::IndexRef((s->b).mPtr,s->b->__Field(HX_CSTRING("length"))) = HX_CSTRING("?>");
}
}
return null();
}
HX_DEFINE_DYNAMIC_FUNC1(Xml_obj,toStringRec,(void))
::XmlType Xml_obj::Element;
::XmlType Xml_obj::PCData;
::XmlType Xml_obj::CData;
::XmlType Xml_obj::Comment;
::XmlType Xml_obj::DocType;
::XmlType Xml_obj::Prolog;
::XmlType Xml_obj::Document;
Dynamic Xml_obj::_parse;
::Xml Xml_obj::parse( ::String str){
HX_SOURCE_PUSH("Xml_obj::parse")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",51)
::Xml x = ::Xml_obj::__new();
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",52)
x->_children = Dynamic( Array_obj<Dynamic>::__new() );
struct _Function_1_1{
inline static Dynamic Block( ::Xml &x){
hx::Anon __result = hx::Anon_obj::Create();
__result->Add(HX_CSTRING("cur") , x,false);
HX_BEGIN_LOCAL_FUNC_S0(hx::LocalThisFunc,_Function_2_1)
Void run(::String name,Dynamic att){
{
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",56)
Dynamic x1 = ::Xml_obj::__new();
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",57)
x1->__FieldRef(HX_CSTRING("_parent")) = __this->__Field(HX_CSTRING("cur"));
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",58)
x1->__FieldRef(HX_CSTRING("nodeType")) = ::Xml_obj::Element;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",59)
x1->__FieldRef(HX_CSTRING("_nodeName")) = ::String(name);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",60)
x1->__FieldRef(HX_CSTRING("_attributes")) = att;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",61)
x1->__FieldRef(HX_CSTRING("_children")) = Dynamic( Array_obj<Dynamic>::__new() );
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",62)
{
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",63)
int i = (int)0;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",64)
__this->__Field(HX_CSTRING("cur"))->__Field(HX_CSTRING("addChild"))(x1);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",65)
__this->__FieldRef(HX_CSTRING("cur")) = x1;
}
}
return null();
}
HX_END_LOCAL_FUNC2((void))
__result->Add(HX_CSTRING("xml") , Dynamic(new _Function_2_1()),true);
HX_BEGIN_LOCAL_FUNC_S0(hx::LocalThisFunc,_Function_2_2)
Void run(::String text){
{
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",69)
::Xml x1 = ::Xml_obj::__new();
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",70)
x1->_parent = __this->__Field(HX_CSTRING("cur"));
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",71)
x1->nodeType = ::Xml_obj::CData;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",72)
x1->_nodeValue = ::String(text);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",73)
__this->__Field(HX_CSTRING("cur"))->__Field(HX_CSTRING("addChild"))(x1);
}
return null();
}
HX_END_LOCAL_FUNC1((void))
__result->Add(HX_CSTRING("cdata") , Dynamic(new _Function_2_2()),true);
HX_BEGIN_LOCAL_FUNC_S0(hx::LocalThisFunc,_Function_2_3)
Void run(::String text){
{
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",76)
::Xml x1 = ::Xml_obj::__new();
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",77)
x1->_parent = __this->__Field(HX_CSTRING("cur"));
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",78)
x1->nodeType = ::Xml_obj::PCData;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",79)
x1->_nodeValue = ::String(text);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",80)
__this->__Field(HX_CSTRING("cur"))->__Field(HX_CSTRING("addChild"))(x1);
}
return null();
}
HX_END_LOCAL_FUNC1((void))
__result->Add(HX_CSTRING("pcdata") , Dynamic(new _Function_2_3()),true);
HX_BEGIN_LOCAL_FUNC_S0(hx::LocalThisFunc,_Function_2_4)
Void run(::String text){
{
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",83)
::Xml x1 = ::Xml_obj::__new();
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",84)
x1->_parent = __this->__Field(HX_CSTRING("cur"));
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",85)
if (((text.cca((int)0) == (int)63))){
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",86)
x1->nodeType = ::Xml_obj::Prolog;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",87)
text = ::String(text);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",88)
text = text.substr((int)1,(text.length - (int)2));
}
else{
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",90)
x1->nodeType = ::Xml_obj::Comment;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",91)
text = ::String(text);
}
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",93)
x1->_nodeValue = text;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",94)
__this->__Field(HX_CSTRING("cur"))->__Field(HX_CSTRING("addChild"))(x1);
}
return null();
}
HX_END_LOCAL_FUNC1((void))
__result->Add(HX_CSTRING("comment") , Dynamic(new _Function_2_4()),true);
HX_BEGIN_LOCAL_FUNC_S0(hx::LocalThisFunc,_Function_2_5)
Void run(::String text){
{
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",97)
::Xml x1 = ::Xml_obj::__new();
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",98)
x1->_parent = __this->__Field(HX_CSTRING("cur"));
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",99)
x1->nodeType = ::Xml_obj::DocType;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",100)
x1->_nodeValue = ::String(text).substr((int)1,null());
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",101)
__this->__Field(HX_CSTRING("cur"))->__Field(HX_CSTRING("addChild"))(x1);
}
return null();
}
HX_END_LOCAL_FUNC1((void))
__result->Add(HX_CSTRING("doctype") , Dynamic(new _Function_2_5()),true);
HX_BEGIN_LOCAL_FUNC_S0(hx::LocalThisFunc,_Function_2_6)
Void run(){
{
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",103)
__this->__FieldRef(HX_CSTRING("cur")) = __this->__Field(HX_CSTRING("cur"))->__Field(HX_CSTRING("_parent"));
}
return null();
}
HX_END_LOCAL_FUNC0((void))
__result->Add(HX_CSTRING("done") , Dynamic(new _Function_2_6()),true);
return __result;
}
};
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",53)
Dynamic parser = _Function_1_1::Block(x);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",107)
::Xml_obj::_parse(str,parser);
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",108)
x->nodeType = ::Xml_obj::Document;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",109)
return x;
}
STATIC_HX_DEFINE_DYNAMIC_FUNC1(Xml_obj,parse,return )
::Xml Xml_obj::createElement( ::String name){
HX_SOURCE_PUSH("Xml_obj::createElement")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",114)
::Xml r = ::Xml_obj::__new();
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",115)
r->nodeType = ::Xml_obj::Element;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",116)
r->_nodeName = name;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",117)
r->_attributes = null();
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",118)
r->_children = Dynamic( Array_obj<Dynamic>::__new() );
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",119)
return r;
}
STATIC_HX_DEFINE_DYNAMIC_FUNC1(Xml_obj,createElement,return )
::Xml Xml_obj::createPCData( ::String data){
HX_SOURCE_PUSH("Xml_obj::createPCData")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",123)
::Xml r = ::Xml_obj::__new();
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",124)
r->nodeType = ::Xml_obj::PCData;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",125)
r->_nodeValue = data;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",126)
return r;
}
STATIC_HX_DEFINE_DYNAMIC_FUNC1(Xml_obj,createPCData,return )
::Xml Xml_obj::createCData( ::String data){
HX_SOURCE_PUSH("Xml_obj::createCData")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",130)
::Xml r = ::Xml_obj::__new();
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",131)
r->nodeType = ::Xml_obj::CData;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",132)
r->_nodeValue = data;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",133)
return r;
}
STATIC_HX_DEFINE_DYNAMIC_FUNC1(Xml_obj,createCData,return )
::Xml Xml_obj::createComment( ::String data){
HX_SOURCE_PUSH("Xml_obj::createComment")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",137)
::Xml r = ::Xml_obj::__new();
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",138)
r->nodeType = ::Xml_obj::Comment;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",139)
r->_nodeValue = data;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",140)
return r;
}
STATIC_HX_DEFINE_DYNAMIC_FUNC1(Xml_obj,createComment,return )
::Xml Xml_obj::createDocType( ::String data){
HX_SOURCE_PUSH("Xml_obj::createDocType")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",144)
::Xml r = ::Xml_obj::__new();
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",145)
r->nodeType = ::Xml_obj::DocType;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",146)
r->_nodeValue = data;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",147)
return r;
}
STATIC_HX_DEFINE_DYNAMIC_FUNC1(Xml_obj,createDocType,return )
::Xml Xml_obj::createProlog( ::String data){
HX_SOURCE_PUSH("Xml_obj::createProlog")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",151)
::Xml r = ::Xml_obj::__new();
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",152)
r->nodeType = ::Xml_obj::Prolog;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",153)
r->_nodeValue = data;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",154)
return r;
}
STATIC_HX_DEFINE_DYNAMIC_FUNC1(Xml_obj,createProlog,return )
::Xml Xml_obj::createDocument( ){
HX_SOURCE_PUSH("Xml_obj::createDocument")
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",158)
::Xml r = ::Xml_obj::__new();
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",159)
r->nodeType = ::Xml_obj::Document;
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",160)
r->_children = Dynamic( Array_obj<Dynamic>::__new() );
HX_SOURCE_POS("/usr/lib/haxe/std/cpp/_std/Xml.hx",161)
return r;
}
STATIC_HX_DEFINE_DYNAMIC_FUNC0(Xml_obj,createDocument,return )
Xml_obj::Xml_obj()
{
}
void Xml_obj::__Mark(HX_MARK_PARAMS)
{
HX_MARK_BEGIN_CLASS(Xml);
HX_MARK_MEMBER_NAME(_nodeName,"_nodeName");
HX_MARK_MEMBER_NAME(_nodeValue,"_nodeValue");
HX_MARK_MEMBER_NAME(_attributes,"_attributes");
HX_MARK_MEMBER_NAME(_children,"_children");
HX_MARK_MEMBER_NAME(_parent,"_parent");
HX_MARK_MEMBER_NAME(nodeType,"nodeType");
HX_MARK_MEMBER_NAME(nodeName,"nodeName");
HX_MARK_MEMBER_NAME(nodeValue,"nodeValue");
HX_MARK_MEMBER_NAME(parent,"parent");
HX_MARK_END_CLASS();
}
Dynamic Xml_obj::__Field(const ::String &inName)
{
switch(inName.length) {
case 3:
if (HX_FIELD_EQ(inName,"get") ) { return get_dyn(); }
if (HX_FIELD_EQ(inName,"set") ) { return set_dyn(); }
break;
case 5:
if (HX_FIELD_EQ(inName,"CData") ) { return CData; }
if (HX_FIELD_EQ(inName,"parse") ) { return parse_dyn(); }
break;
case 6:
if (HX_FIELD_EQ(inName,"PCData") ) { return PCData; }
if (HX_FIELD_EQ(inName,"Prolog") ) { return Prolog; }
if (HX_FIELD_EQ(inName,"_parse") ) { return _parse; }
if (HX_FIELD_EQ(inName,"parent") ) { return getParent(); }
if (HX_FIELD_EQ(inName,"remove") ) { return remove_dyn(); }
if (HX_FIELD_EQ(inName,"exists") ) { return exists_dyn(); }
break;
case 7:
if (HX_FIELD_EQ(inName,"Element") ) { return Element; }
if (HX_FIELD_EQ(inName,"Comment") ) { return Comment; }
if (HX_FIELD_EQ(inName,"DocType") ) { return DocType; }
if (HX_FIELD_EQ(inName,"_parent") ) { return _parent; }
break;
case 8:
if (HX_FIELD_EQ(inName,"Document") ) { return Document; }
if (HX_FIELD_EQ(inName,"nodeType") ) { return nodeType; }
if (HX_FIELD_EQ(inName,"nodeName") ) { return getNodeName(); }
if (HX_FIELD_EQ(inName,"iterator") ) { return iterator_dyn(); }
if (HX_FIELD_EQ(inName,"elements") ) { return elements_dyn(); }
if (HX_FIELD_EQ(inName,"addChild") ) { return addChild_dyn(); }
if (HX_FIELD_EQ(inName,"toString") ) { return toString_dyn(); }
break;
case 9:
if (HX_FIELD_EQ(inName,"_nodeName") ) { return _nodeName; }
if (HX_FIELD_EQ(inName,"_children") ) { return _children; }
if (HX_FIELD_EQ(inName,"nodeValue") ) { return getNodeValue(); }
if (HX_FIELD_EQ(inName,"getParent") ) { return getParent_dyn(); }
break;
case 10:
if (HX_FIELD_EQ(inName,"_nodeValue") ) { return _nodeValue; }
if (HX_FIELD_EQ(inName,"attributes") ) { return attributes_dyn(); }
if (HX_FIELD_EQ(inName,"firstChild") ) { return firstChild_dyn(); }
break;
case 11:
if (HX_FIELD_EQ(inName,"createCData") ) { return createCData_dyn(); }
if (HX_FIELD_EQ(inName,"_attributes") ) { return _attributes; }
if (HX_FIELD_EQ(inName,"getNodeName") ) { return getNodeName_dyn(); }
if (HX_FIELD_EQ(inName,"setNodeName") ) { return setNodeName_dyn(); }
if (HX_FIELD_EQ(inName,"removeChild") ) { return removeChild_dyn(); }
if (HX_FIELD_EQ(inName,"insertChild") ) { return insertChild_dyn(); }
if (HX_FIELD_EQ(inName,"toStringRec") ) { return toStringRec_dyn(); }
break;
case 12:
if (HX_FIELD_EQ(inName,"createPCData") ) { return createPCData_dyn(); }
if (HX_FIELD_EQ(inName,"createProlog") ) { return createProlog_dyn(); }
if (HX_FIELD_EQ(inName,"getNodeValue") ) { return getNodeValue_dyn(); }
if (HX_FIELD_EQ(inName,"setNodeValue") ) { return setNodeValue_dyn(); }
if (HX_FIELD_EQ(inName,"firstElement") ) { return firstElement_dyn(); }
break;
case 13:
if (HX_FIELD_EQ(inName,"createElement") ) { return createElement_dyn(); }
if (HX_FIELD_EQ(inName,"createComment") ) { return createComment_dyn(); }
if (HX_FIELD_EQ(inName,"createDocType") ) { return createDocType_dyn(); }
if (HX_FIELD_EQ(inName,"elementsNamed") ) { return elementsNamed_dyn(); }
break;
case 14:
if (HX_FIELD_EQ(inName,"createDocument") ) { return createDocument_dyn(); }
}
return super::__Field(inName);
}
Dynamic Xml_obj::__SetField(const ::String &inName,const Dynamic &inValue)
{
switch(inName.length) {
case 5:
if (HX_FIELD_EQ(inName,"CData") ) { CData=inValue.Cast< ::XmlType >(); return inValue; }
break;
case 6:
if (HX_FIELD_EQ(inName,"PCData") ) { PCData=inValue.Cast< ::XmlType >(); return inValue; }
if (HX_FIELD_EQ(inName,"Prolog") ) { Prolog=inValue.Cast< ::XmlType >(); return inValue; }
if (HX_FIELD_EQ(inName,"_parse") ) { _parse=inValue.Cast< Dynamic >(); return inValue; }
if (HX_FIELD_EQ(inName,"parent") ) { parent=inValue.Cast< ::Xml >(); return inValue; }
break;
case 7:
if (HX_FIELD_EQ(inName,"Element") ) { Element=inValue.Cast< ::XmlType >(); return inValue; }
if (HX_FIELD_EQ(inName,"Comment") ) { Comment=inValue.Cast< ::XmlType >(); return inValue; }
if (HX_FIELD_EQ(inName,"DocType") ) { DocType=inValue.Cast< ::XmlType >(); return inValue; }
if (HX_FIELD_EQ(inName,"_parent") ) { _parent=inValue.Cast< ::Xml >(); return inValue; }
break;
case 8:
if (HX_FIELD_EQ(inName,"Document") ) { Document=inValue.Cast< ::XmlType >(); return inValue; }
if (HX_FIELD_EQ(inName,"nodeType") ) { nodeType=inValue.Cast< ::XmlType >(); return inValue; }
if (HX_FIELD_EQ(inName,"nodeName") ) { return setNodeName(inValue); }
break;
case 9:
if (HX_FIELD_EQ(inName,"_nodeName") ) { _nodeName=inValue.Cast< ::String >(); return inValue; }
if (HX_FIELD_EQ(inName,"_children") ) { _children=inValue.Cast< Dynamic >(); return inValue; }
if (HX_FIELD_EQ(inName,"nodeValue") ) { return setNodeValue(inValue); }
break;
case 10:
if (HX_FIELD_EQ(inName,"_nodeValue") ) { _nodeValue=inValue.Cast< ::String >(); return inValue; }
break;
case 11:
if (HX_FIELD_EQ(inName,"_attributes") ) { _attributes=inValue.Cast< Dynamic >(); return inValue; }
}
return super::__SetField(inName,inValue);
}
void Xml_obj::__GetFields(Array< ::String> &outFields)
{
outFields->push(HX_CSTRING("_nodeName"));
outFields->push(HX_CSTRING("_nodeValue"));
outFields->push(HX_CSTRING("_attributes"));
outFields->push(HX_CSTRING("_children"));
outFields->push(HX_CSTRING("_parent"));
outFields->push(HX_CSTRING("nodeType"));
outFields->push(HX_CSTRING("nodeName"));
outFields->push(HX_CSTRING("nodeValue"));
outFields->push(HX_CSTRING("parent"));
super::__GetFields(outFields);
};
static ::String sStaticFields[] = {
HX_CSTRING("Element"),
HX_CSTRING("PCData"),
HX_CSTRING("CData"),
HX_CSTRING("Comment"),
HX_CSTRING("DocType"),
HX_CSTRING("Prolog"),
HX_CSTRING("Document"),
HX_CSTRING("_parse"),
HX_CSTRING("parse"),
HX_CSTRING("createElement"),
HX_CSTRING("createPCData"),
HX_CSTRING("createCData"),
HX_CSTRING("createComment"),
HX_CSTRING("createDocType"),
HX_CSTRING("createProlog"),
HX_CSTRING("createDocument"),
String(null()) };
static ::String sMemberFields[] = {
HX_CSTRING("_nodeName"),
HX_CSTRING("_nodeValue"),
HX_CSTRING("_attributes"),
HX_CSTRING("_children"),
HX_CSTRING("_parent"),
HX_CSTRING("nodeType"),
HX_CSTRING("nodeName"),
HX_CSTRING("nodeValue"),
HX_CSTRING("getNodeName"),
HX_CSTRING("setNodeName"),
HX_CSTRING("getNodeValue"),
HX_CSTRING("setNodeValue"),
HX_CSTRING("parent"),
HX_CSTRING("getParent"),
HX_CSTRING("get"),
HX_CSTRING("set"),
HX_CSTRING("remove"),
HX_CSTRING("exists"),
HX_CSTRING("attributes"),
HX_CSTRING("iterator"),
HX_CSTRING("elements"),
HX_CSTRING("elementsNamed"),
HX_CSTRING("firstChild"),
HX_CSTRING("firstElement"),
HX_CSTRING("addChild"),
HX_CSTRING("removeChild"),
HX_CSTRING("insertChild"),
HX_CSTRING("toString"),
HX_CSTRING("toStringRec"),
String(null()) };
static void sMarkStatics(HX_MARK_PARAMS) {
HX_MARK_MEMBER_NAME(Xml_obj::Element,"Element");
HX_MARK_MEMBER_NAME(Xml_obj::PCData,"PCData");
HX_MARK_MEMBER_NAME(Xml_obj::CData,"CData");
HX_MARK_MEMBER_NAME(Xml_obj::Comment,"Comment");
HX_MARK_MEMBER_NAME(Xml_obj::DocType,"DocType");
HX_MARK_MEMBER_NAME(Xml_obj::Prolog,"Prolog");
HX_MARK_MEMBER_NAME(Xml_obj::Document,"Document");
HX_MARK_MEMBER_NAME(Xml_obj::_parse,"_parse");
};
Class Xml_obj::__mClass;
void Xml_obj::__register()
{
Static(__mClass) = hx::RegisterClass(HX_CSTRING("Xml"), hx::TCanCast< Xml_obj> ,sStaticFields,sMemberFields,
&__CreateEmpty, &__Create,
&super::__SGetClass(), 0, sMarkStatics);
}
void Xml_obj::__boot()
{
hx::Static(Element);
hx::Static(PCData);
hx::Static(CData);
hx::Static(Comment);
hx::Static(DocType);
hx::Static(Prolog);
hx::Static(Document);
hx::Static(_parse) = ::cpp::Lib_obj::load(HX_CSTRING("std"),HX_CSTRING("parse_xml"),(int)2);
}
| [
"danogles@gmail.com"
] | danogles@gmail.com |
1b79e20524e83d1de0bdcc81ae0a1b665ae701ef | 249630ace4f18594e43ac8179db3b8d30021370a | /aws-cpp-sdk-iam/include/aws/iam/model/GetRoleRequest.h | b49553f2daa97f69a7ffe091c0970bef4a928c7d | [
"JSON",
"MIT",
"Apache-2.0"
] | permissive | FlyingSquid/aws-sdk-cpp | 5e5f2040867b1e1998fa8b06b837b3b19f550469 | 3fe46f05d1c58fc946045d3b860a79c88d76ceb1 | refs/heads/master | 2021-01-10T17:19:36.927018 | 2016-02-27T01:30:38 | 2016-02-27T01:30:38 | 52,852,300 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,272 | h | /*
* Copyright 2010-2016 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.
*/
#pragma once
#include <aws/iam/IAM_EXPORTS.h>
#include <aws/iam/IAMRequest.h>
#include <aws/core/utils/memory/stl/AWSString.h>
namespace Aws
{
namespace IAM
{
namespace Model
{
/**
*/
class AWS_IAM_API GetRoleRequest : public IAMRequest
{
public:
GetRoleRequest();
Aws::String SerializePayload() const override;
/**
* <p>The name of the role to get information about.</p>
*/
inline const Aws::String& GetRoleName() const{ return m_roleName; }
/**
* <p>The name of the role to get information about.</p>
*/
inline void SetRoleName(const Aws::String& value) { m_roleNameHasBeenSet = true; m_roleName = value; }
/**
* <p>The name of the role to get information about.</p>
*/
inline void SetRoleName(Aws::String&& value) { m_roleNameHasBeenSet = true; m_roleName = value; }
/**
* <p>The name of the role to get information about.</p>
*/
inline void SetRoleName(const char* value) { m_roleNameHasBeenSet = true; m_roleName.assign(value); }
/**
* <p>The name of the role to get information about.</p>
*/
inline GetRoleRequest& WithRoleName(const Aws::String& value) { SetRoleName(value); return *this;}
/**
* <p>The name of the role to get information about.</p>
*/
inline GetRoleRequest& WithRoleName(Aws::String&& value) { SetRoleName(value); return *this;}
/**
* <p>The name of the role to get information about.</p>
*/
inline GetRoleRequest& WithRoleName(const char* value) { SetRoleName(value); return *this;}
private:
Aws::String m_roleName;
bool m_roleNameHasBeenSet;
};
} // namespace Model
} // namespace IAM
} // namespace Aws
| [
"henso@amazon.com"
] | henso@amazon.com |
ac55fc3e2de4f20d70ed065982cf6389e03f34e5 | c223e4259ddbfe9b9a51ddcceab37c3d4ab65ee4 | /Learnbay Practice/Array/replaceSmallerElementFromLeft.c++ | 4a4ea843d119c8d50b4297746a3c78c04b04d853 | [] | no_license | roshan3010/Roshan_NITM | bd4b4eaab4a040bdda1c381bd78795619d4df496 | 5b2b6be6d20382a6971016ddd874ae4c3c654cf0 | refs/heads/master | 2022-01-27T12:22:19.143220 | 2020-06-17T07:13:02 | 2020-06-17T07:13:02 | 219,022,844 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 576 | /*
*************************
Gien an array replace every element by smaller element on left side (not including current element)
*************************
*/
#include<bits/stdc++.h>
using namespace std;
void replace(int arr[], int n)
{
int max_so_far=arr[n-1];
arr[n-1]=-1;
for(int i=n-2;i>=0;i--)
{
int temp=arr[i];
if(max_so_far>arr[i+1])
arr[i]=max_so_far;
else
arr[i]=arr[i+1];
if(max_so_far<temp)
max_so_far=temp;
}
for(int i=0; i<6; i++)
{
cout<<arr[i]<<" ";
}
}
int main()
{
int arr[]={16,17,4,3,5,2};
replace(arr,6);
return 0;
} | [
"roshan.kumar@sungardas.com"
] | roshan.kumar@sungardas.com | |
083eb90c96d38205109067954c4edd9b0305ca8d | cfc2b3879dda6b96f875cb525266ee4752e0bf2d | /class.cpp | 193fc353ceedeec87ba35ed23d36101948edb68f | [] | no_license | macabdul9/object-oriented-programming-in-cpp | 311fb9021e1de6870014e94a2cf9e026d5899ecc | 7a61ba6926470074045b0baf309177d0a5a1a233 | refs/heads/master | 2020-05-22T20:44:15.746317 | 2019-05-23T08:07:50 | 2019-05-23T08:07:50 | 186,513,575 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,274 | cpp | /*
* @author : macab (macab@debian)
* @file : class
* @created : Monday May 13, 2019 12:21:31 IST
*/
#include<bits/stdc++.h>
#define endl "\n"
#define merge(a, b) a##b
#define loop(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define rloop(i,a,b) for(int i=(int)a;i<=(int)b;++i)
#define loopl(i,a,b) for(ll i=(ll)a;i<(ll)b;++i)
#define loopr(i,a,b) for(int i=(int)a;i>=(int)b;--i)
#define MOD 1000000007
#define MAX 1e9
#define MIN -1e9
#define pll pair<ll,ll>
#define pii pair<int,int>
#define psi pair<string, int>
#define pci pair<char, int>
#define all(p) p.begin(),p.end()
#define max(x,y) (x>y)?x:y
#define min(x,y) (x<y)?x:y
#define vi vector<int>
#define vll vector<long long int>
#define vs vector<string>
#define si set<int>
#define ss set<string>
#define sll set<long long int>
#define mii map<int, int>
#define mll map<long long int, long long int>
#define msi map<string, int>
#define umii unordered_map<int, int>
#define umsi unordered_map<string, int>
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned long long int ull;
using namespace std;
/*
* ---private constructor ---
* If we want that class should not be instantiated by anyone else but only by a friend class.
*/
class car{
//// private members /////
string carName , modelName;
int price;
public:
car(string name , string model, int price){
this->carName = name;
this->modelName = model;
this->price = price;
}
void showCar(){
cout << "car name : " << this->carName << endl;
cout << "car model : " << this->modelName << endl;
cout << "car price : " << this->price << endl;
}
};
int main(){
ios::sync_with_stdio(0);
car c1("audi a-11", "a-11", 122446);
car c2("maruti i-20", "i-20", 33535);
c1.showCar();
c2.showCar();
return 0;
}
| [
"abdulwaheed1513@gmail.com"
] | abdulwaheed1513@gmail.com |
df1c7b7574e62b46a71f85300b47c50d144b43da | 24bc4990e9d0bef6a42a6f86dc783785b10dbd42 | /components/cast_streaming/browser/frame/stream_consumer.cc | 74f8ed347710970b93d46b33bbb6edd651d5d02e | [
"BSD-3-Clause"
] | permissive | nwjs/chromium.src | 7736ce86a9a0b810449a3b80a4af15de9ef9115d | 454f26d09b2f6204c096b47f778705eab1e3ba46 | refs/heads/nw75 | 2023-08-31T08:01:39.796085 | 2023-04-19T17:25:53 | 2023-04-19T17:25:53 | 50,512,158 | 161 | 201 | BSD-3-Clause | 2023-05-08T03:19:09 | 2016-01-27T14:17:03 | null | UTF-8 | C++ | false | false | 9,860 | cc | // Copyright 2020 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "components/cast_streaming/browser/frame/stream_consumer.h"
#include <algorithm>
#include "base/containers/span.h"
#include "base/logging.h"
#include "base/task/sequenced_task_runner.h"
#include "components/cast_streaming/public/features.h"
#include "components/cast_streaming/public/remoting_proto_utils.h"
#include "media/base/media_util.h"
#include "media/mojo/common/media_type_converters.h"
#include "third_party/openscreen/src/platform/base/span.h"
namespace cast_streaming {
base::span<uint8_t> StreamConsumer::BufferDataWrapper::Get() {
return base::span<uint8_t>(&pending_buffer_[pending_buffer_offset_],
pending_buffer_remaining_bytes_);
}
base::span<uint8_t> StreamConsumer::BufferDataWrapper::Consume(
uint32_t max_size) {
const uint32_t current_offset = pending_buffer_offset_;
const uint32_t current_remaining_bytes = pending_buffer_remaining_bytes_;
const uint32_t read_size = std::min(max_size, current_remaining_bytes);
pending_buffer_offset_ += read_size;
pending_buffer_remaining_bytes_ -= read_size;
return base::span<uint8_t>(&pending_buffer_[current_offset], read_size);
}
bool StreamConsumer::BufferDataWrapper::Reset(uint32_t new_size) {
if (new_size > kMaxFrameSize) {
return false;
}
pending_buffer_offset_ = 0;
pending_buffer_remaining_bytes_ = new_size;
return true;
}
void StreamConsumer::BufferDataWrapper::Clear() {
bool success = Reset(uint32_t{0});
DCHECK(success);
}
StreamConsumer::StreamConsumer(openscreen::cast::Receiver* receiver,
base::TimeDelta frame_duration,
mojo::ScopedDataPipeProducerHandle data_pipe,
FrameReceivedCB frame_received_cb,
base::RepeatingClosure on_new_frame,
bool is_remoting)
: receiver_(receiver),
data_pipe_(std::move(data_pipe)),
frame_received_cb_(std::move(frame_received_cb)),
pipe_watcher_(FROM_HERE,
mojo::SimpleWatcher::ArmingPolicy::MANUAL,
base::SequencedTaskRunner::GetCurrentDefault()),
frame_duration_(frame_duration),
is_remoting_(is_remoting),
on_new_frame_(std::move(on_new_frame)) {
DCHECK(receiver_);
receiver_->SetConsumer(this);
MojoResult result =
pipe_watcher_.Watch(data_pipe_.get(), MOJO_HANDLE_SIGNAL_WRITABLE,
base::BindRepeating(&StreamConsumer::OnPipeWritable,
base::Unretained(this)));
if (result != MOJO_RESULT_OK) {
CloseDataPipeOnError();
return;
}
}
StreamConsumer::StreamConsumer(StreamConsumer&& other,
openscreen::cast::Receiver* receiver,
mojo::ScopedDataPipeProducerHandle data_pipe)
: StreamConsumer(receiver,
other.frame_duration_,
std::move(data_pipe),
std::move(other.frame_received_cb_),
std::move(other.on_new_frame_),
other.is_remoting_) {
if (other.is_read_pending_) {
ReadFrame(std::move(other.no_frames_available_cb_));
}
}
// NOTE: Do NOT call into |receiver_| methods here, as the object may no longer
// be valid at time of this object's destruction.
StreamConsumer::~StreamConsumer() = default;
void StreamConsumer::ReadFrame(base::OnceClosure no_frames_available_cb) {
DCHECK(!is_read_pending_);
DCHECK(!no_frames_available_cb_);
is_read_pending_ = true;
no_frames_available_cb_ = std::move(no_frames_available_cb);
MaybeSendNextFrame();
}
void StreamConsumer::CloseDataPipeOnError() {
DLOG(WARNING) << "[ssrc:" << receiver_->ssrc() << "] Data pipe closed.";
pipe_watcher_.Cancel();
data_pipe_.reset();
}
void StreamConsumer::OnPipeWritable(MojoResult result) {
DCHECK(data_pipe_);
if (result != MOJO_RESULT_OK) {
CloseDataPipeOnError();
return;
}
base::span<uint8_t> span = data_wrapper_.Get();
uint32_t bytes_written = span.size();
result = data_pipe_->WriteData(span.data(), &bytes_written,
MOJO_WRITE_DATA_FLAG_NONE);
if (result != MOJO_RESULT_OK) {
CloseDataPipeOnError();
return;
}
data_wrapper_.Consume(bytes_written);
if (!data_wrapper_.empty()) {
pipe_watcher_.ArmOrNotify();
return;
}
MaybeSendNextFrame();
}
void StreamConsumer::OnFramesReady(int next_frame_buffer_size) {
MaybeSendNextFrame();
}
void StreamConsumer::FlushUntil(uint32_t frame_id) {
skip_until_frame_id_ = frame_id;
if (is_read_pending_) {
is_read_pending_ = false;
no_frames_available_cb_.Reset();
frame_received_cb_.Run(nullptr);
}
}
void StreamConsumer::MaybeSendNextFrame() {
if (!is_read_pending_ || !data_wrapper_.empty()) {
return;
}
const int current_frame_buffer_size = receiver_->AdvanceToNextFrame();
if (current_frame_buffer_size == openscreen::cast::Receiver::kNoFramesReady) {
if (no_frames_available_cb_) {
std::move(no_frames_available_cb_).Run();
}
return;
}
on_new_frame_.Run();
if (!data_wrapper_.Reset(current_frame_buffer_size)) {
LOG(ERROR) << "[ssrc:" << receiver_->ssrc() << "] "
<< "Frame size too big: " << current_frame_buffer_size;
CloseDataPipeOnError();
return;
}
openscreen::cast::EncodedFrame encoded_frame;
// Write to temporary storage in case we need to drop this frame.
base::span<uint8_t> span = data_wrapper_.Get();
encoded_frame = receiver_->ConsumeNextFrame(
openscreen::ByteBuffer(span.data(), span.size()));
// If the frame occurs before the id we want to flush until, drop it and try
// again.
// TODO(crbug.com/1412561): Move this logic to Openscreen.
if (encoded_frame.frame_id <
openscreen::cast::FrameId(int64_t{skip_until_frame_id_})) {
VLOG(1) << "Skipping Frame " << encoded_frame.frame_id;
data_wrapper_.Clear();
MaybeSendNextFrame();
return;
}
// Create the buffer, retrying if this fails.
//
// NOTE: Using CreateRemotingBuffer() is EXPECTED for all remoting streams,
// but REQUIRED only for certain codecs - so inconsistent behavior rather than
// just "not working" will be observed if the wrong call is made.
scoped_refptr<media::DecoderBuffer> decoder_buffer;
if (is_remoting_) {
decoder_buffer = CreateRemotingBuffer();
} else {
decoder_buffer = CreateMirroringBuffer(encoded_frame);
}
if (!decoder_buffer) {
data_wrapper_.Clear();
MaybeSendNextFrame();
}
// At this point, the frame is known to be "good".
skip_until_frame_id_ = 0;
no_frames_available_cb_.Reset();
// Write the frame's data to Mojo.
span = data_wrapper_.Get();
uint32_t bytes_written = span.size();
auto result = data_pipe_->WriteData(span.data(), &bytes_written,
MOJO_WRITE_DATA_FLAG_NONE);
if (result == MOJO_RESULT_SHOULD_WAIT) {
pipe_watcher_.ArmOrNotify();
bytes_written = 0;
} else if (result != MOJO_RESULT_OK) {
CloseDataPipeOnError();
return;
}
data_wrapper_.Consume(bytes_written);
// Return the frame.
is_read_pending_ = false;
frame_received_cb_.Run(media::mojom::DecoderBuffer::From(*decoder_buffer));
// Wait for the mojo pipe to be writable if there is still pending data to
// write.
if (!data_wrapper_.empty()) {
pipe_watcher_.ArmOrNotify();
}
}
scoped_refptr<media::DecoderBuffer> StreamConsumer::CreateRemotingBuffer() {
DCHECK(is_remoting_);
auto span = data_wrapper_.Get();
scoped_refptr<media::DecoderBuffer> decoder_buffer =
remoting::ByteArrayToDecoderBuffer(span.data(), span.size());
if (!decoder_buffer) {
DLOG(WARNING) << "Deserialization failed!";
return nullptr;
}
if (!data_wrapper_.Reset(decoder_buffer->data_size())) {
DLOG(WARNING) << "Buffer overflow!";
return nullptr;
}
span = data_wrapper_.Get();
base::span<const uint8_t> decoder_buffer_data(decoder_buffer->data(),
decoder_buffer->data_size());
std::copy(decoder_buffer_data.begin(), decoder_buffer_data.end(),
span.begin());
return decoder_buffer;
}
scoped_refptr<media::DecoderBuffer> StreamConsumer::CreateMirroringBuffer(
const openscreen::cast::EncodedFrame& encoded_frame) {
DCHECK(!is_remoting_);
scoped_refptr<media::DecoderBuffer> decoder_buffer =
base::MakeRefCounted<media::DecoderBuffer>(data_wrapper_.size());
decoder_buffer->set_duration(frame_duration_);
decoder_buffer->set_is_key_frame(
encoded_frame.dependency ==
openscreen::cast::EncodedFrame::Dependency::kKeyFrame);
base::TimeDelta playout_time =
base::Microseconds(encoded_frame.rtp_timestamp
.ToTimeSinceOrigin<std::chrono::microseconds>(
receiver_->rtp_timebase())
.count());
// Some senders do not send an initial playout time of 0. To work around this,
// a playout offset is added here. This is NOT done when remoting is enabled
// because the timestamp of the first frame is used to automatically start
// playback in such cases.
if (!IsCastRemotingEnabled()) {
if (playout_offset_ == base::TimeDelta::Max()) {
playout_offset_ = playout_time;
}
playout_time -= playout_offset_;
}
decoder_buffer->set_timestamp(playout_time);
DVLOG(3) << "[ssrc:" << receiver_->ssrc() << "] "
<< "Received new frame. Timestamp: " << playout_time
<< ", is_key_frame: " << decoder_buffer->is_key_frame();
return decoder_buffer;
}
} // namespace cast_streaming
| [
"roger@nwjs.io"
] | roger@nwjs.io |
506a1ced2fe6bf59bc57ed2d5e51bcc634c43f4f | a72d01c6c8dfdd687e9cc9b9bf4f4959e9d74f5d | /KOMPROMAT/kompvter/include/kompvter/graphics/texture.hpp | 8ae9a9ff28d2581d7e217e1cd0b2f7c655fb922b | [] | no_license | erinmaus/autonomaus | 8a3619f8380eae451dc40ba507b46661c5bc8247 | 9653f27f6ef0bbe14371a7077744a1fd8b97ae8d | refs/heads/master | 2022-10-01T01:24:23.028210 | 2018-05-09T21:59:26 | 2020-06-10T21:08:09 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,713 | hpp | // This file is a part of KOMPROMAT.
//
// Look, but don't touch.
//
// Copyright 2017 [bk]door.maus
#ifndef KOMPVTER_GRAPHICS_TEXTURE_HPP
#define KOMPVTER_GRAPHICS_TEXTURE_HPP
#include <cstddef>
#include <cstdint>
#include <map>
#include <memory>
#include <unordered_map>
#include <unordered_set>
#include "kompvter/graphics/textureRegion.hpp"
namespace kompvter
{
class Texture
{
public:
friend class TextureManager;
struct const_iterator;
typedef int TextureRegionName;
Texture() = default;
Texture(
int name,
int width, int height,
int pixel_format, int pixel_type, bool is_compressed);
~Texture() = default;
int get_name() const;
int get_width() const;
int get_height() const;
int get_pixel_format() const;
int get_pixel_type() const;
bool get_is_compressed() const;
TextureRegionName add_region(
int x, int y,
int width, int height,
int pixel_format, int pixel_type, bool is_compressed,
const std::uint8_t* pixels_data, std::size_t pixels_size);
const TextureRegion* get_region_from_name(TextureRegionName name) const;
const TextureRegion* get_region_from_pixel(int x, int y) const;
const TextureRegion* get_region_from_texture_coordinate(float s, float t) const;
const_iterator begin() const;
const_iterator end() const;
private:
static const int HASH_SPACE_SIZE;
struct Data;
Texture(const std::shared_ptr<Data>& data);
typedef std::unordered_map<TextureRegionName, TextureRegion> TextureRegionMap;
typedef std::pair<int, int> TextureCellKey;
typedef std::unordered_set<TextureRegionName> TextureCell;
typedef std::map<TextureCellKey, TextureCell> TextureRegionHashSpace;
void add_to_hash_space(TextureRegion& region);
void remove_from_hash_space(TextureRegion& region);
struct Data
{
Data() = default;
Data(
int name,
int width, int height,
int pixel_format, int pixel_type, bool is_compressed);
Data(const Data& other) = default;
~Data() = default;
int name = 0;
int width = 0, height = 0;
int pixel_format = 0, pixel_type = 0;
bool is_compressed = false;
TextureRegionName current_name = 0;
std::shared_ptr<TextureRegionMap> regions = std::make_shared<TextureRegionMap>();
std::shared_ptr<TextureRegionHashSpace> hash_space = std::make_shared<TextureRegionHashSpace>();
};
typedef std::shared_ptr<Data> DataPointer;
DataPointer data = std::make_shared<Data>();
public:
struct const_iterator : public TextureRegionMap::const_iterator
{
public:
typedef TextureRegion value_type;
const_iterator(TextureRegionMap::const_iterator source);
const value_type& operator *() const;
const value_type& operator ->() const;
};
};
}
#endif
| [
"squeak@erinmaus.com"
] | squeak@erinmaus.com |
430644816b6eaf50888dbe633ff082fe910aa43e | d0c44dd3da2ef8c0ff835982a437946cbf4d2940 | /cmake-build-debug/programs_tiling/function14693/function14693_schedule_4/function14693_schedule_4.cpp | 7d0d561a86cb38c1e4f56467cd5176f0a575cb6a | [] | no_license | IsraMekki/tiramisu_code_generator | 8b3f1d63cff62ba9f5242c019058d5a3119184a3 | 5a259d8e244af452e5301126683fa4320c2047a3 | refs/heads/master | 2020-04-29T17:27:57.987172 | 2019-04-23T16:50:32 | 2019-04-23T16:50:32 | 176,297,755 | 1 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 857 | cpp | #include <tiramisu/tiramisu.h>
using namespace tiramisu;
int main(int argc, char **argv){
tiramisu::init("function14693_schedule_4");
constant c0("c0", 128), c1("c1", 64), c2("c2", 128), c3("c3", 64);
var i0("i0", 0, c0), i1("i1", 0, c1), i2("i2", 0, c2), i3("i3", 0, c3), i01("i01"), i02("i02"), i03("i03"), i04("i04");
input input00("input00", {i2}, p_int32);
computation comp0("comp0", {i0, i1, i2, i3}, input00(i2));
comp0.tile(i1, i2, 32, 64, i01, i02, i03, i04);
comp0.parallelize(i0);
buffer buf00("buf00", {128}, p_int32, a_input);
buffer buf0("buf0", {128, 64, 128, 64}, p_int32, a_output);
input00.store_in(&buf00);
comp0.store_in(&buf0);
tiramisu::codegen({&buf00, &buf0}, "../data/programs/function14693/function14693_schedule_4/function14693_schedule_4.o");
return 0;
} | [
"ei_mekki@esi.dz"
] | ei_mekki@esi.dz |
ba6c1a3bf977c3524334ee98bcbd08815d177342 | 00e289ad1b01e71cb569bcdf2daab31d6b63eaf9 | /dotnetcore/ubuntu1404_tizen/llvm-3.8.1/lib/Target/SystemZ/SystemZGenAsmWriter.inc.tmp | 3f07b903dc0278b5e493d8bb2a83cf94d4b0e662 | [] | no_license | jyoungyun/docker | daac16cf23df1e846da78d54aba0f932fcb1af92 | 867082db0dfe3553d8da52efd0b01e3f3c60335a | refs/heads/master | 2021-01-18T17:24:03.296236 | 2017-06-09T01:49:52 | 2017-06-09T01:49:52 | 86,791,750 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 136,109 | tmp | /*===- TableGen'erated file -------------------------------------*- C++ -*-===*\
|* *|
|* Assembly Writer Source Fragment *|
|* *|
|* Automatically generated file, do not edit! *|
|* *|
\*===----------------------------------------------------------------------===*/
/// printInstruction - This method is automatically generated by tablegen
/// from the instruction set description.
void SystemZInstPrinter::printInstruction(const MCInst *MI, raw_ostream &O) {
static const char AsmStrs[] = {
/* 0 */ 'l', 'a', 'a', 9, 0,
/* 5 */ 'l', 'a', 9, 0,
/* 9 */ 'p', 'p', 'a', 9, 0,
/* 14 */ 'l', 'e', 'd', 'b', 'r', 'a', 9, 0,
/* 22 */ 'f', 'i', 'd', 'b', 'r', 'a', 9, 0,
/* 30 */ 'f', 'i', 'e', 'b', 'r', 'a', 9, 0,
/* 38 */ 'l', 'd', 'x', 'b', 'r', 'a', 9, 0,
/* 46 */ 'l', 'e', 'x', 'b', 'r', 'a', 9, 0,
/* 54 */ 'f', 'i', 'x', 'b', 'r', 'a', 9, 0,
/* 62 */ 'v', 's', 'r', 'a', 9, 0,
/* 68 */ 'v', 'g', 'f', 'm', 'a', 'b', 9, 0,
/* 76 */ 'v', 'e', 's', 'r', 'a', 'b', 9, 0,
/* 84 */ 'v', 's', 'r', 'a', 'b', 9, 0,
/* 91 */ 'v', 'a', 'b', 9, 0,
/* 96 */ 'l', 'c', 'b', 'b', 9, 0,
/* 102 */ 'v', 'l', 'b', 'b', 9, 0,
/* 108 */ 'v', 'a', 'c', 'c', 'b', 9, 0,
/* 115 */ 'v', 'e', 'c', 'b', 9, 0,
/* 121 */ 'v', 'l', 'c', 'b', 9, 0,
/* 127 */ 'v', 's', 't', 'r', 'c', 'b', 9, 0,
/* 135 */ 'v', 'f', 'a', 'd', 'b', 9, 0,
/* 142 */ 'w', 'f', 'a', 'd', 'b', 9, 0,
/* 149 */ 'v', 'f', 'm', 'a', 'd', 'b', 9, 0,
/* 157 */ 'w', 'f', 'm', 'a', 'd', 'b', 9, 0,
/* 165 */ 'w', 'f', 'c', 'd', 'b', 9, 0,
/* 172 */ 'v', 'f', 'l', 'c', 'd', 'b', 9, 0,
/* 180 */ 'w', 'f', 'l', 'c', 'd', 'b', 9, 0,
/* 188 */ 'v', 'f', 'd', 'd', 'b', 9, 0,
/* 195 */ 'w', 'f', 'd', 'd', 'b', 9, 0,
/* 202 */ 'v', 'f', 'c', 'e', 'd', 'b', 9, 0,
/* 210 */ 'w', 'f', 'c', 'e', 'd', 'b', 9, 0,
/* 218 */ 'v', 'f', 'c', 'h', 'e', 'd', 'b', 9, 0,
/* 227 */ 'w', 'f', 'c', 'h', 'e', 'd', 'b', 9, 0,
/* 236 */ 'v', 'l', 'e', 'd', 'b', 9, 0,
/* 243 */ 'w', 'l', 'e', 'd', 'b', 9, 0,
/* 250 */ 'v', 'c', 'g', 'd', 'b', 9, 0,
/* 257 */ 'w', 'c', 'g', 'd', 'b', 9, 0,
/* 264 */ 'v', 'c', 'l', 'g', 'd', 'b', 9, 0,
/* 272 */ 'w', 'c', 'l', 'g', 'd', 'b', 9, 0,
/* 280 */ 'v', 'f', 'c', 'h', 'd', 'b', 9, 0,
/* 288 */ 'w', 'f', 'c', 'h', 'd', 'b', 9, 0,
/* 296 */ 'v', 'f', 't', 'c', 'i', 'd', 'b', 9, 0,
/* 305 */ 'w', 'f', 't', 'c', 'i', 'd', 'b', 9, 0,
/* 314 */ 'v', 'f', 'i', 'd', 'b', 9, 0,
/* 321 */ 'w', 'f', 'i', 'd', 'b', 9, 0,
/* 328 */ 'w', 'f', 'k', 'd', 'b', 9, 0,
/* 335 */ 'v', 's', 'l', 'd', 'b', 9, 0,
/* 342 */ 'v', 'f', 'm', 'd', 'b', 9, 0,
/* 349 */ 'w', 'f', 'm', 'd', 'b', 9, 0,
/* 356 */ 'v', 'f', 'l', 'n', 'd', 'b', 9, 0,
/* 364 */ 'w', 'f', 'l', 'n', 'd', 'b', 9, 0,
/* 372 */ 'v', 'f', 'l', 'p', 'd', 'b', 9, 0,
/* 380 */ 'w', 'f', 'l', 'p', 'd', 'b', 9, 0,
/* 388 */ 'v', 'f', 's', 'q', 'd', 'b', 9, 0,
/* 396 */ 'w', 'f', 's', 'q', 'd', 'b', 9, 0,
/* 404 */ 'v', 'f', 's', 'd', 'b', 9, 0,
/* 411 */ 'w', 'f', 's', 'd', 'b', 9, 0,
/* 418 */ 'v', 'f', 'm', 's', 'd', 'b', 9, 0,
/* 426 */ 'w', 'f', 'm', 's', 'd', 'b', 9, 0,
/* 434 */ 'l', 'x', 'd', 'b', 9, 0,
/* 440 */ 'm', 'x', 'd', 'b', 9, 0,
/* 446 */ 'v', 'f', 'a', 'e', 'b', 9, 0,
/* 453 */ 'v', 'm', 'a', 'e', 'b', 9, 0,
/* 460 */ 'c', 'e', 'b', 9, 0,
/* 465 */ 'v', 'l', 'd', 'e', 'b', 9, 0,
/* 472 */ 'w', 'l', 'd', 'e', 'b', 9, 0,
/* 479 */ 'm', 'd', 'e', 'b', 9, 0,
/* 485 */ 'v', 'f', 'e', 'e', 'b', 9, 0,
/* 492 */ 'm', 'e', 'e', 'b', 9, 0,
/* 498 */ 'v', 'm', 'a', 'l', 'e', 'b', 9, 0,
/* 506 */ 'v', 'm', 'l', 'e', 'b', 9, 0,
/* 513 */ 'v', 'l', 'e', 'b', 9, 0,
/* 519 */ 'v', 'm', 'e', 'b', 9, 0,
/* 525 */ 'v', 'f', 'e', 'n', 'e', 'b', 9, 0,
/* 533 */ 's', 'q', 'e', 'b', 9, 0,
/* 539 */ 'm', 's', 'e', 'b', 9, 0,
/* 545 */ 'v', 's', 't', 'e', 'b', 9, 0,
/* 552 */ 'l', 'x', 'e', 'b', 9, 0,
/* 558 */ 'v', 'c', 'd', 'g', 'b', 9, 0,
/* 565 */ 'w', 'c', 'd', 'g', 'b', 9, 0,
/* 572 */ 'v', 's', 'e', 'g', 'b', 9, 0,
/* 579 */ 'v', 'c', 'd', 'l', 'g', 'b', 9, 0,
/* 587 */ 'w', 'c', 'd', 'l', 'g', 'b', 9, 0,
/* 595 */ 'v', 'a', 'v', 'g', 'b', 9, 0,
/* 602 */ 'v', 'l', 'v', 'g', 'b', 9, 0,
/* 609 */ 'v', 'm', 'a', 'h', 'b', 9, 0,
/* 616 */ 'v', 'c', 'h', 'b', 9, 0,
/* 622 */ 'v', 'm', 'a', 'l', 'h', 'b', 9, 0,
/* 630 */ 'v', 'm', 'l', 'h', 'b', 9, 0,
/* 637 */ 'v', 'u', 'p', 'l', 'h', 'b', 9, 0,
/* 645 */ 'v', 'm', 'h', 'b', 9, 0,
/* 651 */ 'v', 'u', 'p', 'h', 'b', 9, 0,
/* 658 */ 'v', 'm', 'r', 'h', 'b', 9, 0,
/* 665 */ 'v', 's', 'c', 'b', 'i', 'b', 9, 0,
/* 673 */ 'v', 'l', 'e', 'i', 'b', 9, 0,
/* 680 */ 'v', 'r', 'e', 'p', 'i', 'b', 9, 0,
/* 688 */ 'v', 'm', 'a', 'l', 'b', 9, 0,
/* 695 */ 'v', 'e', 'c', 'l', 'b', 9, 0,
/* 702 */ 'v', 'a', 'v', 'g', 'l', 'b', 9, 0,
/* 710 */ 'v', 'c', 'h', 'l', 'b', 9, 0,
/* 717 */ 'v', 'u', 'p', 'l', 'l', 'b', 9, 0,
/* 725 */ 'v', 'e', 'r', 'l', 'l', 'b', 9, 0,
/* 733 */ 'v', 'm', 'l', 'b', 9, 0,
/* 739 */ 'v', 'm', 'n', 'l', 'b', 9, 0,
/* 746 */ 'v', 'u', 'p', 'l', 'b', 9, 0,
/* 753 */ 'v', 'm', 'r', 'l', 'b', 9, 0,
/* 760 */ 'v', 'e', 's', 'r', 'l', 'b', 9, 0,
/* 768 */ 'v', 's', 'r', 'l', 'b', 9, 0,
/* 775 */ 'v', 'e', 's', 'l', 'b', 9, 0,
/* 782 */ 'v', 's', 'l', 'b', 9, 0,
/* 788 */ 'v', 'm', 'x', 'l', 'b', 9, 0,
/* 795 */ 'v', 'g', 'f', 'm', 'b', 9, 0,
/* 802 */ 'v', 'g', 'm', 'b', 9, 0,
/* 808 */ 'v', 'e', 'r', 'i', 'm', 'b', 9, 0,
/* 816 */ 'v', 's', 'u', 'm', 'b', 9, 0,
/* 823 */ 'v', 'm', 'n', 'b', 9, 0,
/* 829 */ 'v', 'm', 'a', 'o', 'b', 9, 0,
/* 836 */ 'v', 'm', 'a', 'l', 'o', 'b', 9, 0,
/* 844 */ 'v', 'm', 'l', 'o', 'b', 9, 0,
/* 851 */ 'v', 'm', 'o', 'b', 9, 0,
/* 857 */ 'v', 'l', 'r', 'e', 'p', 'b', 9, 0,
/* 865 */ 'v', 'r', 'e', 'p', 'b', 9, 0,
/* 872 */ 'v', 'l', 'p', 'b', 9, 0,
/* 878 */ 'v', 'c', 'e', 'q', 'b', 9, 0,
/* 885 */ 'v', 'i', 's', 't', 'r', 'b', 9, 0,
/* 893 */ 'v', 's', 'b', 9, 0,
/* 898 */ 'v', 'e', 's', 'r', 'a', 'v', 'b', 9, 0,
/* 907 */ 'v', 'l', 'g', 'v', 'b', 9, 0,
/* 914 */ 'v', 'e', 'r', 'l', 'l', 'v', 'b', 9, 0,
/* 923 */ 'v', 'e', 's', 'r', 'l', 'v', 'b', 9, 0,
/* 932 */ 'v', 'e', 's', 'l', 'v', 'b', 9, 0,
/* 940 */ 'v', 'm', 'x', 'b', 9, 0,
/* 946 */ 'v', 's', 't', 'r', 'c', 'z', 'b', 9, 0,
/* 955 */ 'v', 'f', 'a', 'e', 'z', 'b', 9, 0,
/* 963 */ 'v', 'f', 'e', 'e', 'z', 'b', 9, 0,
/* 971 */ 'v', 'l', 'l', 'e', 'z', 'b', 9, 0,
/* 979 */ 'v', 'f', 'e', 'n', 'e', 'z', 'b', 9, 0,
/* 988 */ 'v', 'c', 'l', 'z', 'b', 9, 0,
/* 995 */ 'v', 'c', 't', 'z', 'b', 9, 0,
/* 1002 */ 'l', 'l', 'g', 'c', 9, 0,
/* 1008 */ 'i', 'c', 9, 0,
/* 1012 */ 'a', 'l', 'c', 9, 0,
/* 1017 */ 'c', 'l', 'c', 9, 0,
/* 1022 */ 'l', 'l', 'c', 9, 0,
/* 1027 */ 't', 'b', 'e', 'g', 'i', 'n', 'c', 9, 0,
/* 1036 */ 'v', 'n', 'c', 9, 0,
/* 1041 */ 'l', 'o', 'c', 9, 0,
/* 1046 */ 's', 't', 'o', 'c', 9, 0,
/* 1052 */ 'b', 'r', 'c', 9, 0,
/* 1057 */ 's', 't', 'c', 9, 0,
/* 1062 */ 'm', 'v', 'c', 9, 0,
/* 1067 */ 'x', 'c', 9, 0,
/* 1071 */ 'p', 'f', 'd', 9, 0,
/* 1076 */ 'l', 'd', 9, 0,
/* 1080 */ 'e', 't', 'n', 'd', 9, 0,
/* 1086 */ 's', 't', 'd', 9, 0,
/* 1091 */ 'l', 'o', 'c', 'e', 9, 0,
/* 1097 */ 's', 't', 'o', 'c', 'e', 9, 0,
/* 1104 */ 'l', 'd', 'e', 9, 0,
/* 1109 */ 'l', 'o', 'c', 'g', 'e', 9, 0,
/* 1116 */ 's', 't', 'o', 'c', 'g', 'e', 9, 0,
/* 1124 */ 'j', 'g', 'e', 9, 0,
/* 1129 */ 'l', 'o', 'c', 'h', 'e', 9, 0,
/* 1136 */ 's', 't', 'o', 'c', 'h', 'e', 9, 0,
/* 1144 */ 'l', 'o', 'c', 'g', 'h', 'e', 9, 0,
/* 1152 */ 's', 't', 'o', 'c', 'g', 'h', 'e', 9, 0,
/* 1161 */ 'j', 'g', 'h', 'e', 9, 0,
/* 1167 */ 'c', 'i', 'j', 'h', 'e', 9, 0,
/* 1174 */ 'c', 'g', 'i', 'j', 'h', 'e', 9, 0,
/* 1182 */ 'c', 'l', 'g', 'i', 'j', 'h', 'e', 9, 0,
/* 1191 */ 'c', 'l', 'i', 'j', 'h', 'e', 9, 0,
/* 1199 */ 'c', 'r', 'j', 'h', 'e', 9, 0,
/* 1206 */ 'c', 'g', 'r', 'j', 'h', 'e', 9, 0,
/* 1214 */ 'c', 'l', 'g', 'r', 'j', 'h', 'e', 9, 0,
/* 1223 */ 'c', 'l', 'r', 'j', 'h', 'e', 9, 0,
/* 1231 */ 'l', 'o', 'c', 'n', 'h', 'e', 9, 0,
/* 1239 */ 's', 't', 'o', 'c', 'n', 'h', 'e', 9, 0,
/* 1248 */ 'l', 'o', 'c', 'g', 'n', 'h', 'e', 9, 0,
/* 1257 */ 's', 't', 'o', 'c', 'g', 'n', 'h', 'e', 9, 0,
/* 1267 */ 'j', 'g', 'n', 'h', 'e', 9, 0,
/* 1274 */ 'c', 'i', 'j', 'n', 'h', 'e', 9, 0,
/* 1282 */ 'c', 'g', 'i', 'j', 'n', 'h', 'e', 9, 0,
/* 1291 */ 'c', 'l', 'g', 'i', 'j', 'n', 'h', 'e', 9, 0,
/* 1301 */ 'c', 'l', 'i', 'j', 'n', 'h', 'e', 9, 0,
/* 1310 */ 'c', 'r', 'j', 'n', 'h', 'e', 9, 0,
/* 1318 */ 'c', 'g', 'r', 'j', 'n', 'h', 'e', 9, 0,
/* 1327 */ 'c', 'l', 'g', 'r', 'j', 'n', 'h', 'e', 9, 0,
/* 1337 */ 'c', 'l', 'r', 'j', 'n', 'h', 'e', 9, 0,
/* 1346 */ 'l', 'o', 'c', 'r', 'n', 'h', 'e', 9, 0,
/* 1355 */ 'l', 'o', 'c', 'g', 'r', 'n', 'h', 'e', 9, 0,
/* 1365 */ 'l', 'o', 'c', 'r', 'h', 'e', 9, 0,
/* 1373 */ 'l', 'o', 'c', 'g', 'r', 'h', 'e', 9, 0,
/* 1382 */ 'c', 'i', 'j', 'e', 9, 0,
/* 1388 */ 'c', 'g', 'i', 'j', 'e', 9, 0,
/* 1395 */ 'c', 'l', 'g', 'i', 'j', 'e', 9, 0,
/* 1403 */ 'c', 'l', 'i', 'j', 'e', 9, 0,
/* 1410 */ 'c', 'r', 'j', 'e', 9, 0,
/* 1416 */ 'c', 'g', 'r', 'j', 'e', 9, 0,
/* 1423 */ 'c', 'l', 'g', 'r', 'j', 'e', 9, 0,
/* 1431 */ 'c', 'l', 'r', 'j', 'e', 9, 0,
/* 1438 */ 's', 't', 'c', 'k', 'e', 9, 0,
/* 1445 */ 'l', 'o', 'c', 'l', 'e', 9, 0,
/* 1452 */ 's', 't', 'o', 'c', 'l', 'e', 9, 0,
/* 1460 */ 's', 't', 'f', 'l', 'e', 9, 0,
/* 1467 */ 'l', 'o', 'c', 'g', 'l', 'e', 9, 0,
/* 1475 */ 's', 't', 'o', 'c', 'g', 'l', 'e', 9, 0,
/* 1484 */ 'j', 'g', 'l', 'e', 9, 0,
/* 1490 */ 'c', 'i', 'j', 'l', 'e', 9, 0,
/* 1497 */ 'c', 'g', 'i', 'j', 'l', 'e', 9, 0,
/* 1505 */ 'c', 'l', 'g', 'i', 'j', 'l', 'e', 9, 0,
/* 1514 */ 'c', 'l', 'i', 'j', 'l', 'e', 9, 0,
/* 1522 */ 'c', 'r', 'j', 'l', 'e', 9, 0,
/* 1529 */ 'c', 'g', 'r', 'j', 'l', 'e', 9, 0,
/* 1537 */ 'c', 'l', 'g', 'r', 'j', 'l', 'e', 9, 0,
/* 1546 */ 'c', 'l', 'r', 'j', 'l', 'e', 9, 0,
/* 1554 */ 'l', 'o', 'c', 'n', 'l', 'e', 9, 0,
/* 1562 */ 's', 't', 'o', 'c', 'n', 'l', 'e', 9, 0,
/* 1571 */ 'l', 'o', 'c', 'g', 'n', 'l', 'e', 9, 0,
/* 1580 */ 's', 't', 'o', 'c', 'g', 'n', 'l', 'e', 9, 0,
/* 1590 */ 'j', 'g', 'n', 'l', 'e', 9, 0,
/* 1597 */ 'c', 'i', 'j', 'n', 'l', 'e', 9, 0,
/* 1605 */ 'c', 'g', 'i', 'j', 'n', 'l', 'e', 9, 0,
/* 1614 */ 'c', 'l', 'g', 'i', 'j', 'n', 'l', 'e', 9, 0,
/* 1624 */ 'c', 'l', 'i', 'j', 'n', 'l', 'e', 9, 0,
/* 1633 */ 'c', 'r', 'j', 'n', 'l', 'e', 9, 0,
/* 1641 */ 'c', 'g', 'r', 'j', 'n', 'l', 'e', 9, 0,
/* 1650 */ 'c', 'l', 'g', 'r', 'j', 'n', 'l', 'e', 9, 0,
/* 1660 */ 'c', 'l', 'r', 'j', 'n', 'l', 'e', 9, 0,
/* 1669 */ 'l', 'o', 'c', 'r', 'n', 'l', 'e', 9, 0,
/* 1678 */ 'l', 'o', 'c', 'g', 'r', 'n', 'l', 'e', 9, 0,
/* 1688 */ 'l', 'o', 'c', 'r', 'l', 'e', 9, 0,
/* 1696 */ 'l', 'o', 'c', 'g', 'r', 'l', 'e', 9, 0,
/* 1705 */ 'l', 'o', 'c', 'n', 'e', 9, 0,
/* 1712 */ 's', 't', 'o', 'c', 'n', 'e', 9, 0,
/* 1720 */ 'l', 'o', 'c', 'g', 'n', 'e', 9, 0,
/* 1728 */ 's', 't', 'o', 'c', 'g', 'n', 'e', 9, 0,
/* 1737 */ 'j', 'g', 'n', 'e', 9, 0,
/* 1743 */ 'c', 'i', 'j', 'n', 'e', 9, 0,
/* 1750 */ 'c', 'g', 'i', 'j', 'n', 'e', 9, 0,
/* 1758 */ 'c', 'l', 'g', 'i', 'j', 'n', 'e', 9, 0,
/* 1767 */ 'c', 'l', 'i', 'j', 'n', 'e', 9, 0,
/* 1775 */ 'c', 'r', 'j', 'n', 'e', 9, 0,
/* 1782 */ 'c', 'g', 'r', 'j', 'n', 'e', 9, 0,
/* 1790 */ 'c', 'l', 'g', 'r', 'j', 'n', 'e', 9, 0,
/* 1799 */ 'c', 'l', 'r', 'j', 'n', 'e', 9, 0,
/* 1807 */ 'v', 'o', 'n', 'e', 9, 0,
/* 1813 */ 'l', 'o', 'c', 'r', 'n', 'e', 9, 0,
/* 1821 */ 'l', 'o', 'c', 'g', 'r', 'n', 'e', 9, 0,
/* 1830 */ 'l', 'o', 'c', 'r', 'e', 9, 0,
/* 1837 */ 'l', 'o', 'c', 'g', 'r', 'e', 9, 0,
/* 1845 */ 's', 't', 'e', 9, 0,
/* 1850 */ 'v', 'g', 'f', 'm', 'a', 'f', 9, 0,
/* 1858 */ 'v', 'e', 's', 'r', 'a', 'f', 9, 0,
/* 1866 */ 'v', 'a', 'f', 9, 0,
/* 1871 */ 'v', 'a', 'c', 'c', 'f', 9, 0,
/* 1878 */ 'v', 'e', 'c', 'f', 9, 0,
/* 1884 */ 'v', 'l', 'c', 'f', 9, 0,
/* 1890 */ 'v', 's', 't', 'r', 'c', 'f', 9, 0,
/* 1898 */ 'v', 'f', 'a', 'e', 'f', 9, 0,
/* 1905 */ 'v', 'm', 'a', 'e', 'f', 9, 0,
/* 1912 */ 'v', 's', 'c', 'e', 'f', 9, 0,
/* 1919 */ 'v', 'f', 'e', 'e', 'f', 9, 0,
/* 1926 */ 'v', 'g', 'e', 'f', 9, 0,
/* 1932 */ 'v', 'm', 'a', 'l', 'e', 'f', 9, 0,
/* 1940 */ 'v', 'm', 'l', 'e', 'f', 9, 0,
/* 1947 */ 'v', 'l', 'e', 'f', 9, 0,
/* 1953 */ 'v', 'm', 'e', 'f', 9, 0,
/* 1959 */ 'v', 'f', 'e', 'n', 'e', 'f', 9, 0,
/* 1967 */ 'v', 's', 't', 'e', 'f', 9, 0,
/* 1974 */ 'a', 'g', 'f', 9, 0,
/* 1979 */ 'c', 'g', 'f', 9, 0,
/* 1984 */ 'v', 's', 'e', 'g', 'f', 9, 0,
/* 1991 */ 'a', 'l', 'g', 'f', 9, 0,
/* 1997 */ 'c', 'l', 'g', 'f', 9, 0,
/* 2003 */ 'l', 'l', 'g', 'f', 9, 0,
/* 2009 */ 's', 'l', 'g', 'f', 9, 0,
/* 2015 */ 'v', 's', 'u', 'm', 'g', 'f', 9, 0,
/* 2023 */ 'd', 's', 'g', 'f', 9, 0,
/* 2029 */ 'm', 's', 'g', 'f', 9, 0,
/* 2035 */ 'l', 't', 'g', 'f', 9, 0,
/* 2041 */ 'v', 'a', 'v', 'g', 'f', 9, 0,
/* 2048 */ 'v', 'l', 'v', 'g', 'f', 9, 0,
/* 2055 */ 'v', 'm', 'a', 'h', 'f', 9, 0,
/* 2062 */ 'v', 'c', 'h', 'f', 9, 0,
/* 2068 */ 'i', 'i', 'h', 'f', 9, 0,
/* 2074 */ 'l', 'l', 'i', 'h', 'f', 9, 0,
/* 2081 */ 'n', 'i', 'h', 'f', 9, 0,
/* 2087 */ 'o', 'i', 'h', 'f', 9, 0,
/* 2093 */ 'x', 'i', 'h', 'f', 9, 0,
/* 2099 */ 'v', 'm', 'a', 'l', 'h', 'f', 9, 0,
/* 2107 */ 'c', 'l', 'h', 'f', 9, 0,
/* 2113 */ 'v', 'm', 'l', 'h', 'f', 9, 0,
/* 2120 */ 'v', 'u', 'p', 'l', 'h', 'f', 9, 0,
/* 2128 */ 'v', 'm', 'h', 'f', 9, 0,
/* 2134 */ 'v', 'u', 'p', 'h', 'f', 9, 0,
/* 2141 */ 'v', 'm', 'r', 'h', 'f', 9, 0,
/* 2148 */ 'v', 's', 'c', 'b', 'i', 'f', 9, 0,
/* 2156 */ 'v', 'l', 'e', 'i', 'f', 9, 0,
/* 2163 */ 'v', 'r', 'e', 'p', 'i', 'f', 9, 0,
/* 2171 */ 's', 't', 'c', 'k', 'f', 9, 0,
/* 2178 */ 'v', 'p', 'k', 'f', 9, 0,
/* 2184 */ 'v', 'm', 'a', 'l', 'f', 9, 0,
/* 2191 */ 'v', 'e', 'c', 'l', 'f', 9, 0,
/* 2198 */ 'v', 'a', 'v', 'g', 'l', 'f', 9, 0,
/* 2206 */ 'v', 'c', 'h', 'l', 'f', 9, 0,
/* 2213 */ 'i', 'i', 'l', 'f', 9, 0,
/* 2219 */ 'l', 'l', 'i', 'l', 'f', 9, 0,
/* 2226 */ 'n', 'i', 'l', 'f', 9, 0,
/* 2232 */ 'o', 'i', 'l', 'f', 9, 0,
/* 2238 */ 'x', 'i', 'l', 'f', 9, 0,
/* 2244 */ 'v', 'u', 'p', 'l', 'l', 'f', 9, 0,
/* 2252 */ 'v', 'e', 'r', 'l', 'l', 'f', 9, 0,
/* 2260 */ 'v', 'm', 'l', 'f', 9, 0,
/* 2266 */ 'v', 'm', 'n', 'l', 'f', 9, 0,
/* 2273 */ 'v', 'u', 'p', 'l', 'f', 9, 0,
/* 2280 */ 'v', 'm', 'r', 'l', 'f', 9, 0,
/* 2287 */ 'v', 'e', 's', 'r', 'l', 'f', 9, 0,
/* 2295 */ 'v', 'e', 's', 'l', 'f', 9, 0,
/* 2302 */ 'v', 'm', 'x', 'l', 'f', 9, 0,
/* 2309 */ 'v', 'g', 'f', 'm', 'f', 9, 0,
/* 2316 */ 'v', 'g', 'm', 'f', 9, 0,
/* 2322 */ 'v', 'e', 'r', 'i', 'm', 'f', 9, 0,
/* 2330 */ 'v', 'm', 'n', 'f', 9, 0,
/* 2336 */ 'v', 'm', 'a', 'o', 'f', 9, 0,
/* 2343 */ 'v', 'm', 'a', 'l', 'o', 'f', 9, 0,
/* 2351 */ 'v', 'm', 'l', 'o', 'f', 9, 0,
/* 2358 */ 'v', 'm', 'o', 'f', 9, 0,
/* 2364 */ 'v', 'l', 'r', 'e', 'p', 'f', 9, 0,
/* 2372 */ 'v', 'r', 'e', 'p', 'f', 9, 0,
/* 2379 */ 'v', 'l', 'p', 'f', 9, 0,
/* 2385 */ 'v', 'c', 'e', 'q', 'f', 9, 0,
/* 2392 */ 'v', 's', 'u', 'm', 'q', 'f', 9, 0,
/* 2400 */ 'v', 'i', 's', 't', 'r', 'f', 9, 0,
/* 2408 */ 'v', 'p', 'k', 's', 'f', 9, 0,
/* 2415 */ 'v', 'p', 'k', 'l', 's', 'f', 9, 0,
/* 2423 */ 'v', 's', 'f', 9, 0,
/* 2428 */ 'v', 'e', 's', 'r', 'a', 'v', 'f', 9, 0,
/* 2437 */ 'v', 'l', 'g', 'v', 'f', 9, 0,
/* 2444 */ 'v', 'e', 'r', 'l', 'l', 'v', 'f', 9, 0,
/* 2453 */ 'v', 'e', 's', 'r', 'l', 'v', 'f', 9, 0,
/* 2462 */ 'v', 'e', 's', 'l', 'v', 'f', 9, 0,
/* 2470 */ 'v', 'm', 'x', 'f', 9, 0,
/* 2476 */ 'v', 's', 't', 'r', 'c', 'z', 'f', 9, 0,
/* 2485 */ 'v', 'f', 'a', 'e', 'z', 'f', 9, 0,
/* 2493 */ 'v', 'f', 'e', 'e', 'z', 'f', 9, 0,
/* 2501 */ 'v', 'l', 'l', 'e', 'z', 'f', 9, 0,
/* 2509 */ 'v', 'f', 'e', 'n', 'e', 'z', 'f', 9, 0,
/* 2518 */ 'v', 'c', 'l', 'z', 'f', 9, 0,
/* 2525 */ 'v', 'c', 't', 'z', 'f', 9, 0,
/* 2532 */ 'l', 'a', 'a', 'g', 9, 0,
/* 2538 */ 'v', 'g', 'f', 'm', 'a', 'g', 9, 0,
/* 2546 */ 'v', 'e', 's', 'r', 'a', 'g', 9, 0,
/* 2554 */ 'v', 'a', 'g', 9, 0,
/* 2559 */ 's', 'l', 'b', 'g', 9, 0,
/* 2565 */ 'r', 'i', 's', 'b', 'g', 9, 0,
/* 2572 */ 'r', 'n', 's', 'b', 'g', 9, 0,
/* 2579 */ 'r', 'o', 's', 'b', 'g', 9, 0,
/* 2586 */ 'r', 'x', 's', 'b', 'g', 9, 0,
/* 2593 */ 'v', 'a', 'c', 'c', 'g', 9, 0,
/* 2600 */ 'v', 'e', 'c', 'g', 9, 0,
/* 2606 */ 'a', 'l', 'c', 'g', 9, 0,
/* 2612 */ 'v', 'l', 'c', 'g', 9, 0,
/* 2618 */ 'l', 'o', 'c', 'g', 9, 0,
/* 2624 */ 's', 't', 'o', 'c', 'g', 9, 0,
/* 2631 */ 'v', 's', 'c', 'e', 'g', 9, 0,
/* 2638 */ 'v', 'g', 'e', 'g', 9, 0,
/* 2644 */ 'v', 'l', 'e', 'g', 9, 0,
/* 2650 */ 'v', 's', 't', 'e', 'g', 9, 0,
/* 2657 */ 'v', 'a', 'v', 'g', 'g', 9, 0,
/* 2664 */ 'v', 'l', 'v', 'g', 'g', 9, 0,
/* 2671 */ 'r', 'i', 's', 'b', 'h', 'g', 9, 0,
/* 2679 */ 'v', 'c', 'h', 'g', 9, 0,
/* 2685 */ 'v', 'm', 'r', 'h', 'g', 9, 0,
/* 2692 */ 'v', 's', 'c', 'b', 'i', 'g', 9, 0,
/* 2700 */ 'v', 'l', 'e', 'i', 'g', 9, 0,
/* 2707 */ 'v', 'r', 'e', 'p', 'i', 'g', 9, 0,
/* 2715 */ 'j', 'g', 9, 0,
/* 2719 */ 'v', 'p', 'k', 'g', 9, 0,
/* 2725 */ 'l', 'a', 'a', 'l', 'g', 9, 0,
/* 2732 */ 'r', 'i', 's', 'b', 'l', 'g', 9, 0,
/* 2740 */ 'v', 'e', 'c', 'l', 'g', 9, 0,
/* 2747 */ 'd', 'l', 'g', 9, 0,
/* 2752 */ 'v', 'a', 'v', 'g', 'l', 'g', 9, 0,
/* 2760 */ 'v', 'c', 'h', 'l', 'g', 9, 0,
/* 2767 */ 'v', 'e', 'r', 'l', 'l', 'g', 9, 0,
/* 2775 */ 's', 'l', 'l', 'g', 9, 0,
/* 2781 */ 'm', 'l', 'g', 9, 0,
/* 2786 */ 'v', 'm', 'n', 'l', 'g', 9, 0,
/* 2793 */ 'v', 'm', 'r', 'l', 'g', 9, 0,
/* 2800 */ 'v', 'e', 's', 'r', 'l', 'g', 9, 0,
/* 2808 */ 'v', 'e', 's', 'l', 'g', 9, 0,
/* 2815 */ 'v', 'm', 'x', 'l', 'g', 9, 0,
/* 2822 */ 'v', 'g', 'f', 'm', 'g', 9, 0,
/* 2829 */ 'v', 'g', 'm', 'g', 9, 0,
/* 2835 */ 'v', 'e', 'r', 'i', 'm', 'g', 9, 0,
/* 2843 */ 'l', 'm', 'g', 9, 0,
/* 2848 */ 's', 't', 'm', 'g', 9, 0,
/* 2854 */ 'l', 'a', 'n', 'g', 9, 0,
/* 2860 */ 'v', 'm', 'n', 'g', 9, 0,
/* 2866 */ 'l', 'a', 'o', 'g', 9, 0,
/* 2872 */ 'v', 'l', 'r', 'e', 'p', 'g', 9, 0,
/* 2880 */ 'v', 'r', 'e', 'p', 'g', 9, 0,
/* 2887 */ 'v', 'l', 'p', 'g', 9, 0,
/* 2893 */ 'v', 'c', 'e', 'q', 'g', 9, 0,
/* 2900 */ 'v', 's', 'u', 'm', 'q', 'g', 9, 0,
/* 2908 */ 'c', 's', 'g', 9, 0,
/* 2913 */ 'd', 's', 'g', 9, 0,
/* 2918 */ 'v', 'p', 'k', 's', 'g', 9, 0,
/* 2925 */ 'v', 'p', 'k', 'l', 's', 'g', 9, 0,
/* 2933 */ 'm', 's', 'g', 9, 0,
/* 2938 */ 'v', 's', 'g', 9, 0,
/* 2943 */ 'b', 'r', 'c', 't', 'g', 9, 0,
/* 2950 */ 'l', 't', 'g', 9, 0,
/* 2955 */ 'n', 't', 's', 't', 'g', 9, 0,
/* 2962 */ 'v', 'e', 's', 'r', 'a', 'v', 'g', 9, 0,
/* 2971 */ 'v', 'l', 'g', 'v', 'g', 9, 0,
/* 2978 */ 'v', 'e', 'r', 'l', 'l', 'v', 'g', 9, 0,
/* 2987 */ 'v', 'e', 's', 'r', 'l', 'v', 'g', 9, 0,
/* 2996 */ 'v', 'e', 's', 'l', 'v', 'g', 9, 0,
/* 3004 */ 'l', 'r', 'v', 'g', 9, 0,
/* 3010 */ 's', 't', 'r', 'v', 'g', 9, 0,
/* 3017 */ 'l', 'a', 'x', 'g', 9, 0,
/* 3023 */ 'v', 'm', 'x', 'g', 9, 0,
/* 3029 */ 'v', 'l', 'l', 'e', 'z', 'g', 9, 0,
/* 3037 */ 'v', 'c', 'l', 'z', 'g', 9, 0,
/* 3044 */ 'v', 'c', 't', 'z', 'g', 9, 0,
/* 3051 */ 'v', 'g', 'f', 'm', 'a', 'h', 9, 0,
/* 3059 */ 'v', 'e', 's', 'r', 'a', 'h', 9, 0,
/* 3067 */ 'v', 'a', 'h', 9, 0,
/* 3072 */ 'l', 'b', 'h', 9, 0,
/* 3077 */ 'v', 'a', 'c', 'c', 'h', 9, 0,
/* 3084 */ 'v', 'e', 'c', 'h', 9, 0,
/* 3090 */ 'l', 'l', 'c', 'h', 9, 0,
/* 3096 */ 'v', 'l', 'c', 'h', 9, 0,
/* 3102 */ 'l', 'o', 'c', 'h', 9, 0,
/* 3108 */ 's', 't', 'o', 'c', 'h', 9, 0,
/* 3115 */ 'v', 's', 't', 'r', 'c', 'h', 9, 0,
/* 3123 */ 's', 't', 'c', 'h', 9, 0,
/* 3129 */ 'v', 'f', 'a', 'e', 'h', 9, 0,
/* 3136 */ 'v', 'm', 'a', 'e', 'h', 9, 0,
/* 3143 */ 'v', 'f', 'e', 'e', 'h', 9, 0,
/* 3150 */ 'v', 'm', 'a', 'l', 'e', 'h', 9, 0,
/* 3158 */ 'v', 'm', 'l', 'e', 'h', 9, 0,
/* 3165 */ 'v', 'l', 'e', 'h', 9, 0,
/* 3171 */ 'v', 'm', 'e', 'h', 9, 0,
/* 3177 */ 'v', 'f', 'e', 'n', 'e', 'h', 9, 0,
/* 3185 */ 'v', 's', 't', 'e', 'h', 9, 0,
/* 3192 */ 'l', 'f', 'h', 9, 0,
/* 3197 */ 's', 't', 'f', 'h', 9, 0,
/* 3203 */ 'l', 'o', 'c', 'g', 'h', 9, 0,
/* 3210 */ 's', 't', 'o', 'c', 'g', 'h', 9, 0,
/* 3218 */ 'v', 's', 'e', 'g', 'h', 9, 0,
/* 3225 */ 'j', 'g', 'h', 9, 0,
/* 3230 */ 'l', 'l', 'g', 'h', 9, 0,
/* 3236 */ 'v', 's', 'u', 'm', 'g', 'h', 9, 0,
/* 3244 */ 'v', 'a', 'v', 'g', 'h', 9, 0,
/* 3251 */ 'v', 'l', 'v', 'g', 'h', 9, 0,
/* 3258 */ 'v', 'm', 'a', 'h', 'h', 9, 0,
/* 3265 */ 'v', 'c', 'h', 'h', 9, 0,
/* 3271 */ 'i', 'i', 'h', 'h', 9, 0,
/* 3277 */ 'l', 'l', 'i', 'h', 'h', 9, 0,
/* 3284 */ 'n', 'i', 'h', 'h', 9, 0,
/* 3290 */ 'o', 'i', 'h', 'h', 9, 0,
/* 3296 */ 'v', 'm', 'a', 'l', 'h', 'h', 9, 0,
/* 3304 */ 'l', 'l', 'h', 'h', 9, 0,
/* 3310 */ 'v', 'm', 'l', 'h', 'h', 9, 0,
/* 3317 */ 'v', 'u', 'p', 'l', 'h', 'h', 9, 0,
/* 3325 */ 't', 'm', 'h', 'h', 9, 0,
/* 3331 */ 'v', 'm', 'h', 'h', 9, 0,
/* 3337 */ 'v', 'u', 'p', 'h', 'h', 9, 0,
/* 3344 */ 'v', 'm', 'r', 'h', 'h', 9, 0,
/* 3351 */ 's', 't', 'h', 'h', 9, 0,
/* 3357 */ 'a', 'i', 'h', 9, 0,
/* 3362 */ 'v', 's', 'c', 'b', 'i', 'h', 9, 0,
/* 3370 */ 'c', 'i', 'h', 9, 0,
/* 3375 */ 'v', 'l', 'e', 'i', 'h', 9, 0,
/* 3382 */ 'c', 'l', 'i', 'h', 9, 0,
/* 3388 */ 'v', 'r', 'e', 'p', 'i', 'h', 9, 0,
/* 3396 */ 'c', 'i', 'j', 'h', 9, 0,
/* 3402 */ 'c', 'g', 'i', 'j', 'h', 9, 0,
/* 3409 */ 'c', 'l', 'g', 'i', 'j', 'h', 9, 0,
/* 3417 */ 'c', 'l', 'i', 'j', 'h', 9, 0,
/* 3424 */ 'c', 'r', 'j', 'h', 9, 0,
/* 3430 */ 'c', 'g', 'r', 'j', 'h', 9, 0,
/* 3437 */ 'c', 'l', 'g', 'r', 'j', 'h', 9, 0,
/* 3445 */ 'c', 'l', 'r', 'j', 'h', 9, 0,
/* 3452 */ 'v', 'p', 'k', 'h', 9, 0,
/* 3458 */ 'v', 'e', 'c', 'l', 'h', 9, 0,
/* 3465 */ 'l', 'o', 'c', 'l', 'h', 9, 0,
/* 3472 */ 's', 't', 'o', 'c', 'l', 'h', 9, 0,
/* 3480 */ 'l', 'o', 'c', 'g', 'l', 'h', 9, 0,
/* 3488 */ 's', 't', 'o', 'c', 'g', 'l', 'h', 9, 0,
/* 3497 */ 'j', 'g', 'l', 'h', 9, 0,
/* 3503 */ 'v', 'a', 'v', 'g', 'l', 'h', 9, 0,
/* 3511 */ 'v', 'c', 'h', 'l', 'h', 9, 0,
/* 3518 */ 'i', 'i', 'l', 'h', 9, 0,
/* 3524 */ 'l', 'l', 'i', 'l', 'h', 9, 0,
/* 3531 */ 'n', 'i', 'l', 'h', 9, 0,
/* 3537 */ 'o', 'i', 'l', 'h', 9, 0,
/* 3543 */ 'c', 'i', 'j', 'l', 'h', 9, 0,
/* 3550 */ 'c', 'g', 'i', 'j', 'l', 'h', 9, 0,
/* 3558 */ 'c', 'l', 'g', 'i', 'j', 'l', 'h', 9, 0,
/* 3567 */ 'c', 'l', 'i', 'j', 'l', 'h', 9, 0,
/* 3575 */ 'c', 'r', 'j', 'l', 'h', 9, 0,
/* 3582 */ 'c', 'g', 'r', 'j', 'l', 'h', 9, 0,
/* 3590 */ 'c', 'l', 'g', 'r', 'j', 'l', 'h', 9, 0,
/* 3599 */ 'c', 'l', 'r', 'j', 'l', 'h', 9, 0,
/* 3607 */ 'v', 'u', 'p', 'l', 'l', 'h', 9, 0,
/* 3615 */ 'v', 'e', 'r', 'l', 'l', 'h', 9, 0,
/* 3623 */ 't', 'm', 'l', 'h', 9, 0,
/* 3629 */ 'l', 'o', 'c', 'n', 'l', 'h', 9, 0,
/* 3637 */ 's', 't', 'o', 'c', 'n', 'l', 'h', 9, 0,
/* 3646 */ 'l', 'o', 'c', 'g', 'n', 'l', 'h', 9, 0,
/* 3655 */ 's', 't', 'o', 'c', 'g', 'n', 'l', 'h', 9, 0,
/* 3665 */ 'j', 'g', 'n', 'l', 'h', 9, 0,
/* 3672 */ 'c', 'i', 'j', 'n', 'l', 'h', 9, 0,
/* 3680 */ 'c', 'g', 'i', 'j', 'n', 'l', 'h', 9, 0,
/* 3689 */ 'c', 'l', 'g', 'i', 'j', 'n', 'l', 'h', 9, 0,
/* 3699 */ 'c', 'l', 'i', 'j', 'n', 'l', 'h', 9, 0,
/* 3708 */ 'c', 'r', 'j', 'n', 'l', 'h', 9, 0,
/* 3716 */ 'c', 'g', 'r', 'j', 'n', 'l', 'h', 9, 0,
/* 3725 */ 'c', 'l', 'g', 'r', 'j', 'n', 'l', 'h', 9, 0,
/* 3735 */ 'c', 'l', 'r', 'j', 'n', 'l', 'h', 9, 0,
/* 3744 */ 'v', 'm', 'n', 'l', 'h', 9, 0,
/* 3751 */ 'l', 'o', 'c', 'r', 'n', 'l', 'h', 9, 0,
/* 3760 */ 'l', 'o', 'c', 'g', 'r', 'n', 'l', 'h', 9, 0,
/* 3770 */ 'l', 'o', 'c', 'r', 'l', 'h', 9, 0,
/* 3778 */ 'l', 'o', 'c', 'g', 'r', 'l', 'h', 9, 0,
/* 3787 */ 'v', 'm', 'r', 'l', 'h', 9, 0,
/* 3794 */ 'v', 'e', 's', 'r', 'l', 'h', 9, 0,
/* 3802 */ 'v', 'e', 's', 'l', 'h', 9, 0,
/* 3809 */ 'v', 'm', 'x', 'l', 'h', 9, 0,
/* 3816 */ 'v', 'g', 'f', 'm', 'h', 9, 0,
/* 3823 */ 'v', 'g', 'm', 'h', 9, 0,
/* 3829 */ 'v', 'e', 'r', 'i', 'm', 'h', 9, 0,
/* 3837 */ 'v', 's', 'u', 'm', 'h', 9, 0,
/* 3844 */ 'l', 'o', 'c', 'n', 'h', 9, 0,
/* 3851 */ 's', 't', 'o', 'c', 'n', 'h', 9, 0,
/* 3859 */ 'l', 'o', 'c', 'g', 'n', 'h', 9, 0,
/* 3867 */ 's', 't', 'o', 'c', 'g', 'n', 'h', 9, 0,
/* 3876 */ 'j', 'g', 'n', 'h', 9, 0,
/* 3882 */ 'c', 'i', 'j', 'n', 'h', 9, 0,
/* 3889 */ 'c', 'g', 'i', 'j', 'n', 'h', 9, 0,
/* 3897 */ 'c', 'l', 'g', 'i', 'j', 'n', 'h', 9, 0,
/* 3906 */ 'c', 'l', 'i', 'j', 'n', 'h', 9, 0,
/* 3914 */ 'c', 'r', 'j', 'n', 'h', 9, 0,
/* 3921 */ 'c', 'g', 'r', 'j', 'n', 'h', 9, 0,
/* 3929 */ 'c', 'l', 'g', 'r', 'j', 'n', 'h', 9, 0,
/* 3938 */ 'c', 'l', 'r', 'j', 'n', 'h', 9, 0,
/* 3946 */ 'v', 'm', 'n', 'h', 9, 0,
/* 3952 */ 'l', 'o', 'c', 'r', 'n', 'h', 9, 0,
/* 3960 */ 'l', 'o', 'c', 'g', 'r', 'n', 'h', 9, 0,
/* 3969 */ 'v', 'm', 'a', 'o', 'h', 9, 0,
/* 3976 */ 'v', 'm', 'a', 'l', 'o', 'h', 9, 0,
/* 3984 */ 'v', 'm', 'l', 'o', 'h', 9, 0,
/* 3991 */ 'v', 'm', 'o', 'h', 9, 0,
/* 3997 */ 'v', 'l', 'r', 'e', 'p', 'h', 9, 0,
/* 4005 */ 'v', 'r', 'e', 'p', 'h', 9, 0,
/* 4012 */ 'v', 'l', 'p', 'h', 9, 0,
/* 4018 */ 'v', 'c', 'e', 'q', 'h', 9, 0,
/* 4025 */ 'l', 'o', 'c', 'r', 'h', 9, 0,
/* 4032 */ 'l', 'o', 'c', 'g', 'r', 'h', 9, 0,
/* 4040 */ 'v', 'i', 's', 't', 'r', 'h', 9, 0,
/* 4048 */ 'v', 'p', 'k', 's', 'h', 9, 0,
/* 4055 */ 'v', 'p', 'k', 'l', 's', 'h', 9, 0,
/* 4063 */ 'v', 's', 'h', 9, 0,
/* 4068 */ 's', 't', 'h', 9, 0,
/* 4073 */ 'v', 'e', 's', 'r', 'a', 'v', 'h', 9, 0,
/* 4082 */ 'v', 'l', 'g', 'v', 'h', 9, 0,
/* 4089 */ 'v', 'e', 'r', 'l', 'l', 'v', 'h', 9, 0,
/* 4098 */ 'v', 'e', 's', 'r', 'l', 'v', 'h', 9, 0,
/* 4107 */ 'v', 'e', 's', 'l', 'v', 'h', 9, 0,
/* 4115 */ 'v', 'm', 'x', 'h', 9, 0,
/* 4121 */ 'v', 's', 't', 'r', 'c', 'z', 'h', 9, 0,
/* 4130 */ 'v', 'f', 'a', 'e', 'z', 'h', 9, 0,
/* 4138 */ 'v', 'f', 'e', 'e', 'z', 'h', 9, 0,
/* 4146 */ 'v', 'l', 'l', 'e', 'z', 'h', 9, 0,
/* 4154 */ 'v', 'f', 'e', 'n', 'e', 'z', 'h', 9, 0,
/* 4163 */ 'v', 'c', 'l', 'z', 'h', 9, 0,
/* 4170 */ 'v', 'c', 't', 'z', 'h', 9, 0,
/* 4177 */ 'v', 'p', 'd', 'i', 9, 0,
/* 4183 */ 'a', 'f', 'i', 9, 0,
/* 4188 */ 'c', 'f', 'i', 9, 0,
/* 4193 */ 'a', 'g', 'f', 'i', 9, 0,
/* 4199 */ 'c', 'g', 'f', 'i', 9, 0,
/* 4205 */ 'a', 'l', 'g', 'f', 'i', 9, 0,
/* 4212 */ 'c', 'l', 'g', 'f', 'i', 9, 0,
/* 4219 */ 's', 'l', 'g', 'f', 'i', 9, 0,
/* 4226 */ 'm', 's', 'g', 'f', 'i', 9, 0,
/* 4233 */ 'a', 'l', 'f', 'i', 9, 0,
/* 4239 */ 'c', 'l', 'f', 'i', 9, 0,
/* 4245 */ 's', 'l', 'f', 'i', 9, 0,
/* 4251 */ 'm', 's', 'f', 'i', 9, 0,
/* 4257 */ 'a', 'h', 'i', 9, 0,
/* 4262 */ 'c', 'h', 'i', 9, 0,
/* 4267 */ 'a', 'g', 'h', 'i', 9, 0,
/* 4273 */ 'c', 'g', 'h', 'i', 9, 0,
/* 4279 */ 'l', 'g', 'h', 'i', 9, 0,
/* 4285 */ 'm', 'g', 'h', 'i', 9, 0,
/* 4291 */ 'm', 'v', 'g', 'h', 'i', 9, 0,
/* 4298 */ 'm', 'v', 'h', 'h', 'i', 9, 0,
/* 4305 */ 'l', 'h', 'i', 9, 0,
/* 4310 */ 'm', 'h', 'i', 9, 0,
/* 4315 */ 'm', 'v', 'h', 'i', 9, 0,
/* 4321 */ 'c', 'l', 'i', 9, 0,
/* 4326 */ 'n', 'i', 9, 0,
/* 4330 */ 'o', 'i', 9, 0,
/* 4334 */ 'a', 's', 'i', 9, 0,
/* 4339 */ 'a', 'g', 's', 'i', 9, 0,
/* 4345 */ 'c', 'h', 's', 'i', 9, 0,
/* 4351 */ 'c', 'l', 'f', 'h', 's', 'i', 9, 0,
/* 4359 */ 'c', 'g', 'h', 's', 'i', 9, 0,
/* 4366 */ 'c', 'l', 'g', 'h', 's', 'i', 9, 0,
/* 4374 */ 'c', 'h', 'h', 's', 'i', 9, 0,
/* 4381 */ 'c', 'l', 'h', 'h', 's', 'i', 9, 0,
/* 4389 */ 'm', 'v', 'i', 9, 0,
/* 4394 */ 'x', 'i', 9, 0,
/* 4398 */ 'c', 'i', 'j', 9, 0,
/* 4403 */ 'c', 'g', 'i', 'j', 9, 0,
/* 4409 */ 'c', 'l', 'g', 'i', 'j', 9, 0,
/* 4416 */ 'c', 'l', 'i', 'j', 9, 0,
/* 4422 */ 'c', 'r', 'j', 9, 0,
/* 4427 */ 'c', 'g', 'r', 'j', 9, 0,
/* 4433 */ 'c', 'l', 'g', 'r', 'j', 9, 0,
/* 4440 */ 'c', 'l', 'r', 'j', 9, 0,
/* 4446 */ 's', 'r', 'a', 'k', 9, 0,
/* 4452 */ 's', 't', 'c', 'k', 9, 0,
/* 4458 */ 'a', 'h', 'i', 'k', 9, 0,
/* 4464 */ 'a', 'g', 'h', 'i', 'k', 9, 0,
/* 4471 */ 'a', 'l', 'g', 'h', 's', 'i', 'k', 9, 0,
/* 4480 */ 'a', 'l', 'h', 's', 'i', 'k', 9, 0,
/* 4488 */ 's', 'l', 'l', 'k', 9, 0,
/* 4494 */ 's', 'r', 'l', 'k', 9, 0,
/* 4500 */ 'a', 'r', 'k', 9, 0,
/* 4505 */ 'a', 'g', 'r', 'k', 9, 0,
/* 4511 */ 'a', 'l', 'g', 'r', 'k', 9, 0,
/* 4518 */ 's', 'l', 'g', 'r', 'k', 9, 0,
/* 4525 */ 'n', 'g', 'r', 'k', 9, 0,
/* 4531 */ 'o', 'g', 'r', 'k', 9, 0,
/* 4537 */ 's', 'g', 'r', 'k', 9, 0,
/* 4543 */ 'x', 'g', 'r', 'k', 9, 0,
/* 4549 */ 'a', 'l', 'r', 'k', 9, 0,
/* 4555 */ 's', 'l', 'r', 'k', 9, 0,
/* 4561 */ 'n', 'r', 'k', 9, 0,
/* 4566 */ 'o', 'r', 'k', 9, 0,
/* 4571 */ 's', 'r', 'k', 9, 0,
/* 4576 */ 'x', 'r', 'k', 9, 0,
/* 4581 */ 'l', 'a', 'a', 'l', 9, 0,
/* 4587 */ 'l', 'o', 'c', 'l', 9, 0,
/* 4593 */ 's', 't', 'o', 'c', 'l', 9, 0,
/* 4600 */ 'b', 'r', 'c', 'l', 9, 0,
/* 4606 */ 'd', 'l', 9, 0,
/* 4610 */ 'v', 's', 'e', 'l', 9, 0,
/* 4616 */ 'l', 'o', 'c', 'g', 'l', 9, 0,
/* 4623 */ 's', 't', 'o', 'c', 'g', 'l', 9, 0,
/* 4631 */ 'j', 'g', 'l', 9, 0,
/* 4636 */ 'i', 'i', 'h', 'l', 9, 0,
/* 4642 */ 'l', 'l', 'i', 'h', 'l', 9, 0,
/* 4649 */ 'n', 'i', 'h', 'l', 9, 0,
/* 4655 */ 'o', 'i', 'h', 'l', 9, 0,
/* 4661 */ 't', 'm', 'h', 'l', 9, 0,
/* 4667 */ 'c', 'i', 'j', 'l', 9, 0,
/* 4673 */ 'c', 'g', 'i', 'j', 'l', 9, 0,
/* 4680 */ 'c', 'l', 'g', 'i', 'j', 'l', 9, 0,
/* 4688 */ 'c', 'l', 'i', 'j', 'l', 9, 0,
/* 4695 */ 'c', 'r', 'j', 'l', 9, 0,
/* 4701 */ 'c', 'g', 'r', 'j', 'l', 9, 0,
/* 4708 */ 'c', 'l', 'g', 'r', 'j', 'l', 9, 0,
/* 4716 */ 'c', 'l', 'r', 'j', 'l', 9, 0,
/* 4723 */ 'i', 'i', 'l', 'l', 9, 0,
/* 4729 */ 'l', 'l', 'i', 'l', 'l', 9, 0,
/* 4736 */ 'n', 'i', 'l', 'l', 9, 0,
/* 4742 */ 'o', 'i', 'l', 'l', 9, 0,
/* 4748 */ 't', 'm', 'l', 'l', 9, 0,
/* 4754 */ 'r', 'l', 'l', 9, 0,
/* 4759 */ 's', 'l', 'l', 9, 0,
/* 4764 */ 'v', 'l', 'l', 9, 0,
/* 4769 */ 'l', 'o', 'c', 'n', 'l', 9, 0,
/* 4776 */ 's', 't', 'o', 'c', 'n', 'l', 9, 0,
/* 4784 */ 'l', 'o', 'c', 'g', 'n', 'l', 9, 0,
/* 4792 */ 's', 't', 'o', 'c', 'g', 'n', 'l', 9, 0,
/* 4801 */ 'j', 'g', 'n', 'l', 9, 0,
/* 4807 */ 'c', 'i', 'j', 'n', 'l', 9, 0,
/* 4814 */ 'c', 'g', 'i', 'j', 'n', 'l', 9, 0,
/* 4822 */ 'c', 'l', 'g', 'i', 'j', 'n', 'l', 9, 0,
/* 4831 */ 'c', 'l', 'i', 'j', 'n', 'l', 9, 0,
/* 4839 */ 'c', 'r', 'j', 'n', 'l', 9, 0,
/* 4846 */ 'c', 'g', 'r', 'j', 'n', 'l', 9, 0,
/* 4854 */ 'c', 'l', 'g', 'r', 'j', 'n', 'l', 9, 0,
/* 4863 */ 'c', 'l', 'r', 'j', 'n', 'l', 9, 0,
/* 4871 */ 'l', 'o', 'c', 'r', 'n', 'l', 9, 0,
/* 4879 */ 'l', 'o', 'c', 'g', 'r', 'n', 'l', 9, 0,
/* 4888 */ 'l', 'a', 'r', 'l', 9, 0,
/* 4894 */ 'l', 'o', 'c', 'r', 'l', 9, 0,
/* 4901 */ 'p', 'f', 'd', 'r', 'l', 9, 0,
/* 4908 */ 'c', 'g', 'f', 'r', 'l', 9, 0,
/* 4915 */ 'c', 'l', 'g', 'f', 'r', 'l', 9, 0,
/* 4923 */ 'l', 'l', 'g', 'f', 'r', 'l', 9, 0,
/* 4931 */ 'l', 'o', 'c', 'g', 'r', 'l', 9, 0,
/* 4939 */ 'c', 'l', 'g', 'r', 'l', 9, 0,
/* 4946 */ 's', 't', 'g', 'r', 'l', 9, 0,
/* 4953 */ 'c', 'h', 'r', 'l', 9, 0,
/* 4959 */ 'c', 'g', 'h', 'r', 'l', 9, 0,
/* 4966 */ 'c', 'l', 'g', 'h', 'r', 'l', 9, 0,
/* 4974 */ 'l', 'l', 'g', 'h', 'r', 'l', 9, 0,
/* 4982 */ 'c', 'l', 'h', 'r', 'l', 9, 0,
/* 4989 */ 'l', 'l', 'h', 'r', 'l', 9, 0,
/* 4996 */ 's', 't', 'h', 'r', 'l', 9, 0,
/* 5003 */ 'c', 'l', 'r', 'l', 9, 0,
/* 5009 */ 'v', 's', 'r', 'l', 9, 0,
/* 5015 */ 's', 't', 'r', 'l', 9, 0,
/* 5021 */ 'b', 'r', 'a', 's', 'l', 9, 0,
/* 5028 */ 'v', 's', 'l', 9, 0,
/* 5033 */ 'v', 's', 't', 'l', 9, 0,
/* 5039 */ 'v', 'l', 9, 0,
/* 5043 */ 'v', 'g', 'b', 'm', 9, 0,
/* 5049 */ 'v', 'l', 'm', 9, 0,
/* 5054 */ 'i', 'p', 'm', 9, 0,
/* 5059 */ 'v', 'p', 'e', 'r', 'm', 9, 0,
/* 5066 */ 'v', 'c', 'k', 's', 'm', 9, 0,
/* 5073 */ 'v', 's', 't', 'm', 9, 0,
/* 5079 */ 'v', 't', 'm', 9, 0,
/* 5084 */ 'l', 'a', 'n', 9, 0,
/* 5089 */ 'r', 'i', 's', 'b', 'g', 'n', 9, 0,
/* 5097 */ 't', 'b', 'e', 'g', 'i', 'n', 9, 0,
/* 5105 */ 'v', 'n', 9, 0,
/* 5109 */ 'l', 'a', 'o', 9, 0,
/* 5114 */ 'l', 'o', 'c', 'o', 9, 0,
/* 5120 */ 's', 't', 'o', 'c', 'o', 9, 0,
/* 5127 */ 'l', 'o', 'c', 'g', 'o', 9, 0,
/* 5134 */ 's', 't', 'o', 'c', 'g', 'o', 9, 0,
/* 5142 */ 'j', 'g', 'o', 9, 0,
/* 5147 */ 'j', 'o', 9, 0,
/* 5151 */ 'l', 'o', 'c', 'n', 'o', 9, 0,
/* 5158 */ 's', 't', 'o', 'c', 'n', 'o', 9, 0,
/* 5166 */ 'l', 'o', 'c', 'g', 'n', 'o', 9, 0,
/* 5174 */ 's', 't', 'o', 'c', 'g', 'n', 'o', 9, 0,
/* 5183 */ 'j', 'g', 'n', 'o', 9, 0,
/* 5189 */ 'j', 'n', 'o', 9, 0,
/* 5194 */ 'l', 'o', 'c', 'r', 'n', 'o', 9, 0,
/* 5202 */ 'l', 'o', 'c', 'g', 'r', 'n', 'o', 9, 0,
/* 5211 */ 'v', 'n', 'o', 9, 0,
/* 5216 */ 'l', 'o', 'c', 'r', 'o', 9, 0,
/* 5223 */ 'v', 'z', 'e', 'r', 'o', 9, 0,
/* 5230 */ 'l', 'o', 'c', 'g', 'r', 'o', 9, 0,
/* 5238 */ 'v', 'o', 9, 0,
/* 5242 */ 'v', 'l', 'v', 'g', 'p', 9, 0,
/* 5249 */ 'v', 'a', 'q', 9, 0,
/* 5254 */ 'v', 'a', 'c', 'q', 9, 0,
/* 5260 */ 'v', 'a', 'c', 'c', 'q', 9, 0,
/* 5267 */ 'v', 'a', 'c', 'c', 'c', 'q', 9, 0,
/* 5275 */ 'v', 's', 'b', 'c', 'b', 'i', 'q', 9, 0,
/* 5284 */ 'v', 's', 'c', 'b', 'i', 'q', 9, 0,
/* 5292 */ 'v', 's', 'b', 'i', 'q', 9, 0,
/* 5299 */ 'v', 's', 'q', 9, 0,
/* 5304 */ 'e', 'a', 'r', 9, 0,
/* 5309 */ 'm', 'a', 'd', 'b', 'r', 9, 0,
/* 5316 */ 'l', 'c', 'd', 'b', 'r', 9, 0,
/* 5323 */ 'd', 'd', 'b', 'r', 9, 0,
/* 5329 */ 'l', 'e', 'd', 'b', 'r', 9, 0,
/* 5336 */ 'c', 'f', 'd', 'b', 'r', 9, 0,
/* 5343 */ 'c', 'l', 'f', 'd', 'b', 'r', 9, 0,
/* 5351 */ 'c', 'g', 'd', 'b', 'r', 9, 0,
/* 5358 */ 'c', 'l', 'g', 'd', 'b', 'r', 9, 0,
/* 5366 */ 'f', 'i', 'd', 'b', 'r', 9, 0,
/* 5373 */ 'm', 'd', 'b', 'r', 9, 0,
/* 5379 */ 'l', 'n', 'd', 'b', 'r', 9, 0,
/* 5386 */ 'l', 'p', 'd', 'b', 'r', 9, 0,
/* 5393 */ 's', 'q', 'd', 'b', 'r', 9, 0,
/* 5400 */ 'm', 's', 'd', 'b', 'r', 9, 0,
/* 5407 */ 'l', 't', 'd', 'b', 'r', 9, 0,
/* 5414 */ 'l', 'x', 'd', 'b', 'r', 9, 0,
/* 5421 */ 'm', 'x', 'd', 'b', 'r', 9, 0,
/* 5428 */ 'm', 'a', 'e', 'b', 'r', 9, 0,
/* 5435 */ 'l', 'c', 'e', 'b', 'r', 9, 0,
/* 5442 */ 'l', 'd', 'e', 'b', 'r', 9, 0,
/* 5449 */ 'm', 'd', 'e', 'b', 'r', 9, 0,
/* 5456 */ 'm', 'e', 'e', 'b', 'r', 9, 0,
/* 5463 */ 'c', 'f', 'e', 'b', 'r', 9, 0,
/* 5470 */ 'c', 'l', 'f', 'e', 'b', 'r', 9, 0,
/* 5478 */ 'c', 'g', 'e', 'b', 'r', 9, 0,
/* 5485 */ 'c', 'l', 'g', 'e', 'b', 'r', 9, 0,
/* 5493 */ 'f', 'i', 'e', 'b', 'r', 9, 0,
/* 5500 */ 'l', 'n', 'e', 'b', 'r', 9, 0,
/* 5507 */ 'l', 'p', 'e', 'b', 'r', 9, 0,
/* 5514 */ 's', 'q', 'e', 'b', 'r', 9, 0,
/* 5521 */ 'm', 's', 'e', 'b', 'r', 9, 0,
/* 5528 */ 'l', 't', 'e', 'b', 'r', 9, 0,
/* 5535 */ 'l', 'x', 'e', 'b', 'r', 9, 0,
/* 5542 */ 'c', 'd', 'f', 'b', 'r', 9, 0,
/* 5549 */ 'c', 'e', 'f', 'b', 'r', 9, 0,
/* 5556 */ 'c', 'd', 'l', 'f', 'b', 'r', 9, 0,
/* 5564 */ 'c', 'e', 'l', 'f', 'b', 'r', 9, 0,
/* 5572 */ 'c', 'x', 'l', 'f', 'b', 'r', 9, 0,
/* 5580 */ 'c', 'x', 'f', 'b', 'r', 9, 0,
/* 5587 */ 'c', 'd', 'g', 'b', 'r', 9, 0,
/* 5594 */ 'c', 'e', 'g', 'b', 'r', 9, 0,
/* 5601 */ 'c', 'd', 'l', 'g', 'b', 'r', 9, 0,
/* 5609 */ 'c', 'e', 'l', 'g', 'b', 'r', 9, 0,
/* 5617 */ 'c', 'x', 'l', 'g', 'b', 'r', 9, 0,
/* 5625 */ 'c', 'x', 'g', 'b', 'r', 9, 0,
/* 5632 */ 's', 'l', 'b', 'r', 9, 0,
/* 5638 */ 'a', 'x', 'b', 'r', 9, 0,
/* 5644 */ 'l', 'c', 'x', 'b', 'r', 9, 0,
/* 5651 */ 'l', 'd', 'x', 'b', 'r', 9, 0,
/* 5658 */ 'l', 'e', 'x', 'b', 'r', 9, 0,
/* 5665 */ 'c', 'f', 'x', 'b', 'r', 9, 0,
/* 5672 */ 'c', 'l', 'f', 'x', 'b', 'r', 9, 0,
/* 5680 */ 'c', 'g', 'x', 'b', 'r', 9, 0,
/* 5687 */ 'c', 'l', 'g', 'x', 'b', 'r', 9, 0,
/* 5695 */ 'f', 'i', 'x', 'b', 'r', 9, 0,
/* 5702 */ 'm', 'x', 'b', 'r', 9, 0,
/* 5708 */ 'l', 'n', 'x', 'b', 'r', 9, 0,
/* 5715 */ 'l', 'p', 'x', 'b', 'r', 9, 0,
/* 5722 */ 's', 'q', 'x', 'b', 'r', 9, 0,
/* 5729 */ 's', 'x', 'b', 'r', 9, 0,
/* 5735 */ 'l', 't', 'x', 'b', 'r', 9, 0,
/* 5742 */ 'b', 'c', 'r', 9, 0,
/* 5747 */ 'l', 'l', 'g', 'c', 'r', 9, 0,
/* 5754 */ 'a', 'l', 'c', 'r', 9, 0,
/* 5760 */ 'l', 'l', 'c', 'r', 9, 0,
/* 5766 */ 'l', 'o', 'c', 'r', 9, 0,
/* 5772 */ 'l', 'g', 'd', 'r', 9, 0,
/* 5778 */ 'l', 'd', 'r', 9, 0,
/* 5783 */ 'c', 'p', 's', 'd', 'r', 9, 0,
/* 5790 */ 'l', 'z', 'd', 'r', 9, 0,
/* 5796 */ 'b', 'e', 'r', 9, 0,
/* 5801 */ 'b', 'h', 'e', 'r', 9, 0,
/* 5807 */ 'b', 'n', 'h', 'e', 'r', 9, 0,
/* 5814 */ 'b', 'l', 'e', 'r', 9, 0,
/* 5820 */ 'b', 'n', 'l', 'e', 'r', 9, 0,
/* 5827 */ 'b', 'n', 'e', 'r', 9, 0,
/* 5833 */ 'l', 'z', 'e', 'r', 9, 0,
/* 5839 */ 'l', 'c', 'd', 'f', 'r', 9, 0,
/* 5846 */ 'l', 'n', 'd', 'f', 'r', 9, 0,
/* 5853 */ 'l', 'p', 'd', 'f', 'r', 9, 0,
/* 5860 */ 'a', 'g', 'f', 'r', 9, 0,
/* 5866 */ 'l', 'c', 'g', 'f', 'r', 9, 0,
/* 5873 */ 'a', 'l', 'g', 'f', 'r', 9, 0,
/* 5880 */ 'c', 'l', 'g', 'f', 'r', 9, 0,
/* 5887 */ 'l', 'l', 'g', 'f', 'r', 9, 0,
/* 5894 */ 's', 'l', 'g', 'f', 'r', 9, 0,
/* 5901 */ 'l', 'n', 'g', 'f', 'r', 9, 0,
/* 5908 */ 'l', 'p', 'g', 'f', 'r', 9, 0,
/* 5915 */ 'd', 's', 'g', 'f', 'r', 9, 0,
/* 5922 */ 'm', 's', 'g', 'f', 'r', 9, 0,
/* 5929 */ 'l', 't', 'g', 'f', 'r', 9, 0,
/* 5936 */ 'a', 'g', 'r', 9, 0,
/* 5941 */ 's', 'l', 'b', 'g', 'r', 9, 0,
/* 5948 */ 'a', 'l', 'c', 'g', 'r', 9, 0,
/* 5955 */ 'l', 'o', 'c', 'g', 'r', 9, 0,
/* 5962 */ 'l', 'd', 'g', 'r', 9, 0,
/* 5968 */ 'a', 'l', 'g', 'r', 9, 0,
/* 5974 */ 'c', 'l', 'g', 'r', 9, 0,
/* 5980 */ 'd', 'l', 'g', 'r', 9, 0,
/* 5986 */ 'm', 'l', 'g', 'r', 9, 0,
/* 5992 */ 's', 'l', 'g', 'r', 9, 0,
/* 5998 */ 'l', 'n', 'g', 'r', 9, 0,
/* 6004 */ 'f', 'l', 'o', 'g', 'r', 9, 0,
/* 6011 */ 'l', 'p', 'g', 'r', 9, 0,
/* 6017 */ 'd', 's', 'g', 'r', 9, 0,
/* 6023 */ 'm', 's', 'g', 'r', 9, 0,
/* 6029 */ 'l', 't', 'g', 'r', 9, 0,
/* 6035 */ 'l', 'r', 'v', 'g', 'r', 9, 0,
/* 6042 */ 'x', 'g', 'r', 9, 0,
/* 6047 */ 'b', 'h', 'r', 9, 0,
/* 6052 */ 'l', 'l', 'g', 'h', 'r', 9, 0,
/* 6059 */ 'b', 'l', 'h', 'r', 9, 0,
/* 6065 */ 'l', 'l', 'h', 'r', 9, 0,
/* 6071 */ 'b', 'n', 'l', 'h', 'r', 9, 0,
/* 6078 */ 'b', 'n', 'h', 'r', 9, 0,
/* 6084 */ 'a', 'l', 'r', 9, 0,
/* 6089 */ 'b', 'l', 'r', 9, 0,
/* 6094 */ 'c', 'l', 'r', 9, 0,
/* 6099 */ 'd', 'l', 'r', 9, 0,
/* 6104 */ 'b', 'n', 'l', 'r', 9, 0,
/* 6110 */ 's', 'l', 'r', 9, 0,
/* 6115 */ 'v', 'l', 'r', 9, 0,
/* 6120 */ 'l', 'n', 'r', 9, 0,
/* 6125 */ 'b', 'o', 'r', 9, 0,
/* 6130 */ 'b', 'n', 'o', 'r', 9, 0,
/* 6136 */ 'l', 'p', 'r', 9, 0,
/* 6141 */ 'b', 'a', 's', 'r', 9, 0,
/* 6147 */ 'm', 's', 'r', 9, 0,
/* 6152 */ 'l', 't', 'r', 9, 0,
/* 6157 */ 'l', 'r', 'v', 'r', 9, 0,
/* 6163 */ 'l', 'x', 'r', 9, 0,
/* 6168 */ 'l', 'z', 'x', 'r', 9, 0,
/* 6174 */ 'b', 'r', 'a', 's', 9, 0,
/* 6180 */ 'v', 's', 't', 'r', 'c', 'b', 's', 9, 0,
/* 6189 */ 'v', 'f', 'c', 'e', 'd', 'b', 's', 9, 0,
/* 6198 */ 'w', 'f', 'c', 'e', 'd', 'b', 's', 9, 0,
/* 6207 */ 'v', 'f', 'c', 'h', 'e', 'd', 'b', 's', 9, 0,
/* 6217 */ 'w', 'f', 'c', 'h', 'e', 'd', 'b', 's', 9, 0,
/* 6227 */ 'v', 'f', 'c', 'h', 'd', 'b', 's', 9, 0,
/* 6236 */ 'w', 'f', 'c', 'h', 'd', 'b', 's', 9, 0,
/* 6245 */ 'v', 'f', 'a', 'e', 'b', 's', 9, 0,
/* 6253 */ 'v', 'f', 'e', 'e', 'b', 's', 9, 0,
/* 6261 */ 'v', 'f', 'e', 'n', 'e', 'b', 's', 9, 0,
/* 6270 */ 'v', 'c', 'h', 'b', 's', 9, 0,
/* 6277 */ 'v', 'c', 'h', 'l', 'b', 's', 9, 0,
/* 6285 */ 'v', 'c', 'e', 'q', 'b', 's', 9, 0,
/* 6293 */ 'v', 'i', 's', 't', 'r', 'b', 's', 9, 0,
/* 6302 */ 'v', 's', 't', 'r', 'c', 'z', 'b', 's', 9, 0,
/* 6312 */ 'v', 'f', 'a', 'e', 'z', 'b', 's', 9, 0,
/* 6321 */ 'v', 'f', 'e', 'e', 'z', 'b', 's', 9, 0,
/* 6330 */ 'v', 'f', 'e', 'n', 'e', 'z', 'b', 's', 9, 0,
/* 6340 */ 'c', 's', 9, 0,
/* 6344 */ 'v', 's', 't', 'r', 'c', 'f', 's', 9, 0,
/* 6353 */ 'v', 'f', 'a', 'e', 'f', 's', 9, 0,
/* 6361 */ 'v', 'f', 'e', 'e', 'f', 's', 9, 0,
/* 6369 */ 'v', 'f', 'e', 'n', 'e', 'f', 's', 9, 0,
/* 6378 */ 'v', 'c', 'h', 'f', 's', 9, 0,
/* 6385 */ 'v', 'c', 'h', 'l', 'f', 's', 9, 0,
/* 6393 */ 'v', 'c', 'e', 'q', 'f', 's', 9, 0,
/* 6401 */ 'v', 'i', 's', 't', 'r', 'f', 's', 9, 0,
/* 6410 */ 'v', 'p', 'k', 's', 'f', 's', 9, 0,
/* 6418 */ 'v', 'p', 'k', 'l', 's', 'f', 's', 9, 0,
/* 6427 */ 'v', 's', 't', 'r', 'c', 'z', 'f', 's', 9, 0,
/* 6437 */ 'v', 'f', 'a', 'e', 'z', 'f', 's', 9, 0,
/* 6446 */ 'v', 'f', 'e', 'e', 'z', 'f', 's', 9, 0,
/* 6455 */ 'v', 'f', 'e', 'n', 'e', 'z', 'f', 's', 9, 0,
/* 6465 */ 'v', 'c', 'h', 'g', 's', 9, 0,
/* 6472 */ 'v', 'c', 'h', 'l', 'g', 's', 9, 0,
/* 6480 */ 'v', 'c', 'e', 'q', 'g', 's', 9, 0,
/* 6488 */ 'v', 'p', 'k', 's', 'g', 's', 9, 0,
/* 6496 */ 'v', 'p', 'k', 'l', 's', 'g', 's', 9, 0,
/* 6505 */ 'v', 's', 't', 'r', 'c', 'h', 's', 9, 0,
/* 6514 */ 'v', 'f', 'a', 'e', 'h', 's', 9, 0,
/* 6522 */ 'v', 'f', 'e', 'e', 'h', 's', 9, 0,
/* 6530 */ 'v', 'f', 'e', 'n', 'e', 'h', 's', 9, 0,
/* 6539 */ 'v', 'c', 'h', 'h', 's', 9, 0,
/* 6546 */ 'v', 'c', 'h', 'l', 'h', 's', 9, 0,
/* 6554 */ 'v', 'c', 'e', 'q', 'h', 's', 9, 0,
/* 6562 */ 'v', 'i', 's', 't', 'r', 'h', 's', 9, 0,
/* 6571 */ 'v', 'p', 'k', 's', 'h', 's', 9, 0,
/* 6579 */ 'v', 'p', 'k', 'l', 's', 'h', 's', 9, 0,
/* 6588 */ 'v', 's', 't', 'r', 'c', 'z', 'h', 's', 9, 0,
/* 6598 */ 'v', 'f', 'a', 'e', 'z', 'h', 's', 9, 0,
/* 6607 */ 'v', 'f', 'e', 'e', 'z', 'h', 's', 9, 0,
/* 6616 */ 'v', 'f', 'e', 'n', 'e', 'z', 'h', 's', 9, 0,
/* 6626 */ 'm', 's', 9, 0,
/* 6630 */ 'v', 'p', 'o', 'p', 'c', 't', 9, 0,
/* 6638 */ 'b', 'r', 'c', 't', 9, 0,
/* 6644 */ 'l', 't', 9, 0,
/* 6648 */ 'p', 'o', 'p', 'c', 'n', 't', 9, 0,
/* 6656 */ 't', 'a', 'b', 'o', 'r', 't', 9, 0,
/* 6664 */ 'c', 'l', 's', 't', 9, 0,
/* 6670 */ 's', 'r', 's', 't', 9, 0,
/* 6676 */ 'm', 'v', 's', 't', 9, 0,
/* 6682 */ 'l', 'r', 'v', 9, 0,
/* 6687 */ 's', 't', 'r', 'v', 9, 0,
/* 6693 */ 'v', 'm', 'a', 'l', 'h', 'w', 9, 0,
/* 6701 */ 'v', 'm', 'l', 'h', 'w', 9, 0,
/* 6708 */ 'v', 'u', 'p', 'l', 'h', 'w', 9, 0,
/* 6716 */ 'l', 'a', 'x', 9, 0,
/* 6721 */ 'v', 'x', 9, 0,
/* 6725 */ 'l', 'a', 'y', 9, 0,
/* 6730 */ 'i', 'c', 'y', 9, 0,
/* 6735 */ 's', 't', 'c', 'y', 9, 0,
/* 6741 */ 'l', 'd', 'y', 9, 0,
/* 6746 */ 's', 't', 'd', 'y', 9, 0,
/* 6752 */ 'l', 'e', 'y', 9, 0,
/* 6757 */ 's', 't', 'e', 'y', 9, 0,
/* 6763 */ 'a', 'h', 'y', 9, 0,
/* 6768 */ 'c', 'h', 'y', 9, 0,
/* 6773 */ 'l', 'h', 'y', 9, 0,
/* 6778 */ 'm', 'h', 'y', 9, 0,
/* 6783 */ 's', 'h', 'y', 9, 0,
/* 6788 */ 's', 't', 'h', 'y', 9, 0,
/* 6794 */ 'c', 'l', 'i', 'y', 9, 0,
/* 6800 */ 'n', 'i', 'y', 9, 0,
/* 6805 */ 'o', 'i', 'y', 9, 0,
/* 6810 */ 'm', 'v', 'i', 'y', 9, 0,
/* 6816 */ 'x', 'i', 'y', 9, 0,
/* 6821 */ 'a', 'l', 'y', 9, 0,
/* 6826 */ 'c', 'l', 'y', 9, 0,
/* 6831 */ 's', 'l', 'y', 9, 0,
/* 6836 */ 't', 'm', 'y', 9, 0,
/* 6841 */ 'n', 'y', 9, 0,
/* 6845 */ 'o', 'y', 9, 0,
/* 6849 */ 'c', 's', 'y', 9, 0,
/* 6854 */ 'm', 's', 'y', 9, 0,
/* 6859 */ 's', 't', 'y', 9, 0,
/* 6864 */ 'x', 'y', 9, 0,
/* 6868 */ 'L', 'I', 'F', 'E', 'T', 'I', 'M', 'E', '_', 'E', 'N', 'D', 0,
/* 6881 */ 'B', 'U', 'N', 'D', 'L', 'E', 0,
/* 6888 */ 'D', 'B', 'G', '_', 'V', 'A', 'L', 'U', 'E', 0,
/* 6898 */ 'L', 'I', 'F', 'E', 'T', 'I', 'M', 'E', '_', 'S', 'T', 'A', 'R', 'T', 0,
/* 6913 */ 'l', 'o', 'c', 0,
/* 6917 */ 's', 't', 'o', 'c', 0,
/* 6922 */ 't', 'e', 'n', 'd', 0,
/* 6927 */ 'l', 'o', 'c', 'g', 0,
/* 6932 */ 's', 't', 'o', 'c', 'g', 0,
/* 6938 */ 'j', 'g', 0,
/* 6941 */ 'c', 'i', 'j', 0,
/* 6945 */ 'c', 'g', 'i', 'j', 0,
/* 6950 */ 'c', 'l', 'g', 'i', 'j', 0,
/* 6956 */ 'c', 'l', 'i', 'j', 0,
/* 6961 */ 'c', 'r', 'j', 0,
/* 6965 */ 'c', 'g', 'r', 'j', 0,
/* 6970 */ 'c', 'l', 'g', 'r', 'j', 0,
/* 6976 */ 'c', 'l', 'r', 'j', 0,
/* 6981 */ 'l', 'o', 'c', 'r', 0,
/* 6986 */ 'l', 'o', 'c', 'g', 'r', 0,
};
static const uint32_t OpInfo0[] = {
0U, // PHI
0U, // INLINEASM
0U, // CFI_INSTRUCTION
0U, // EH_LABEL
0U, // GC_LABEL
0U, // KILL
0U, // EXTRACT_SUBREG
0U, // INSERT_SUBREG
0U, // IMPLICIT_DEF
0U, // SUBREG_TO_REG
0U, // COPY_TO_REGCLASS
6889U, // DBG_VALUE
0U, // REG_SEQUENCE
0U, // COPY
6882U, // BUNDLE
6899U, // LIFETIME_START
6869U, // LIFETIME_END
0U, // STACKMAP
0U, // PATCHPOINT
0U, // LOAD_STACK_GUARD
0U, // STATEPOINT
0U, // LOCAL_ESCAPE
0U, // FAULTING_LOAD_OP
8195U, // A
8330U, // ADB
1062079U, // ADBR
0U, // ADJCALLSTACKDOWN
0U, // ADJCALLSTACKUP
0U, // ADJDYNALLOC
8641U, // AEB
1062198U, // AEBR
0U, // AEXT128_64
2109528U, // AFI
0U, // AFIMux
10727U, // AG
10167U, // AGF
2109538U, // AGFI
1062629U, // AGFR
3158188U, // AGHI
37761393U, // AGHIK
1062705U, // AGR
574632346U, // AGRK
5263604U, // AGSI
11248U, // AH
3158178U, // AHI
37761387U, // AHIK
0U, // AHIMux
0U, // AHIMuxK
14956U, // AHY
2108702U, // AIH
12776U, // AL
9205U, // ALC
10799U, // ALCG
1062717U, // ALCGR
1062523U, // ALCR
6303882U, // ALFI
10920U, // ALG
10184U, // ALGF
6303854U, // ALGFI
1062642U, // ALGFR
37761400U, // ALGHSIK
1062737U, // ALGR
574632352U, // ALGRK
37761409U, // ALHSIK
1062853U, // ALR
574632390U, // ALRK
15014U, // ALY
1062074U, // AR
574632341U, // ARK
5263599U, // ASI
0U, // ATOMIC_CMP_SWAPW
0U, // ATOMIC_LOADW_AFI
0U, // ATOMIC_LOADW_AR
0U, // ATOMIC_LOADW_MAX
0U, // ATOMIC_LOADW_MIN
0U, // ATOMIC_LOADW_NILH
0U, // ATOMIC_LOADW_NILHi
0U, // ATOMIC_LOADW_NR
0U, // ATOMIC_LOADW_NRi
0U, // ATOMIC_LOADW_OILH
0U, // ATOMIC_LOADW_OR
0U, // ATOMIC_LOADW_SR
0U, // ATOMIC_LOADW_UMAX
0U, // ATOMIC_LOADW_UMIN
0U, // ATOMIC_LOADW_XILF
0U, // ATOMIC_LOADW_XR
0U, // ATOMIC_LOAD_AFI
0U, // ATOMIC_LOAD_AGFI
0U, // ATOMIC_LOAD_AGHI
0U, // ATOMIC_LOAD_AGR
0U, // ATOMIC_LOAD_AHI
0U, // ATOMIC_LOAD_AR
0U, // ATOMIC_LOAD_MAX_32
0U, // ATOMIC_LOAD_MAX_64
0U, // ATOMIC_LOAD_MIN_32
0U, // ATOMIC_LOAD_MIN_64
0U, // ATOMIC_LOAD_NGR
0U, // ATOMIC_LOAD_NGRi
0U, // ATOMIC_LOAD_NIHF64
0U, // ATOMIC_LOAD_NIHF64i
0U, // ATOMIC_LOAD_NIHH64
0U, // ATOMIC_LOAD_NIHH64i
0U, // ATOMIC_LOAD_NIHL64
0U, // ATOMIC_LOAD_NIHL64i
0U, // ATOMIC_LOAD_NILF
0U, // ATOMIC_LOAD_NILF64
0U, // ATOMIC_LOAD_NILF64i
0U, // ATOMIC_LOAD_NILFi
0U, // ATOMIC_LOAD_NILH
0U, // ATOMIC_LOAD_NILH64
0U, // ATOMIC_LOAD_NILH64i
0U, // ATOMIC_LOAD_NILHi
0U, // ATOMIC_LOAD_NILL
0U, // ATOMIC_LOAD_NILL64
0U, // ATOMIC_LOAD_NILL64i
0U, // ATOMIC_LOAD_NILLi
0U, // ATOMIC_LOAD_NR
0U, // ATOMIC_LOAD_NRi
0U, // ATOMIC_LOAD_OGR
0U, // ATOMIC_LOAD_OIHF64
0U, // ATOMIC_LOAD_OIHH64
0U, // ATOMIC_LOAD_OIHL64
0U, // ATOMIC_LOAD_OILF
0U, // ATOMIC_LOAD_OILF64
0U, // ATOMIC_LOAD_OILH
0U, // ATOMIC_LOAD_OILH64
0U, // ATOMIC_LOAD_OILL
0U, // ATOMIC_LOAD_OILL64
0U, // ATOMIC_LOAD_OR
0U, // ATOMIC_LOAD_SGR
0U, // ATOMIC_LOAD_SR
0U, // ATOMIC_LOAD_UMAX_32
0U, // ATOMIC_LOAD_UMAX_64
0U, // ATOMIC_LOAD_UMIN_32
0U, // ATOMIC_LOAD_UMIN_64
0U, // ATOMIC_LOAD_XGR
0U, // ATOMIC_LOAD_XIHF64
0U, // ATOMIC_LOAD_XILF
0U, // ATOMIC_LOAD_XILF64
0U, // ATOMIC_LOAD_XR
0U, // ATOMIC_SWAPW
0U, // ATOMIC_SWAP_32
0U, // ATOMIC_SWAP_64
1062407U, // AXBR
14919U, // AY
7501423U, // AsmBCR
287773U, // AsmBRC
291321U, // AsmBRCL
75510068U, // AsmCGIJ
1111503180U, // AsmCGRJ
75510063U, // AsmCIJ
76558650U, // AsmCLGIJ
1111503186U, // AsmCLGRJ
76558657U, // AsmCLIJ
1111503193U, // AsmCLRJ
1111503175U, // AsmCRJ
407205U, // AsmEBR
34153U, // AsmEJ
33893U, // AsmEJG
10495044U, // AsmELOC
10495062U, // AsmELOCG
1058606U, // AsmELOCGR
1058599U, // AsmELOCR
11543626U, // AsmESTOC
11543645U, // AsmESTOCG
407456U, // AsmHBR
407210U, // AsmHEBR
33938U, // AsmHEJ
33930U, // AsmHEJG
10495082U, // AsmHELOC
10495097U, // AsmHELOCG
1058142U, // AsmHELOCGR
1058134U, // AsmHELOCR
11543665U, // AsmHESTOC
11543681U, // AsmHESTOCG
36167U, // AsmHJ
35994U, // AsmHJG
10497055U, // AsmHLOC
10497156U, // AsmHLOCG
1060801U, // AsmHLOCGR
1060794U, // AsmHLOCR
11545637U, // AsmHSTOC
11545739U, // AsmHSTOCG
109063777U, // AsmJEAltCGI
1648373381U, // AsmJEAltCGR
109063769U, // AsmJEAltCI
110112362U, // AsmJEAltCLGI
1648373390U, // AsmJEAltCLGR
110112372U, // AsmJEAltCLI
1648373400U, // AsmJEAltCLR
1648373373U, // AsmJEAltCR
109061485U, // AsmJECGI
1648371081U, // AsmJECGR
109061479U, // AsmJECI
110110068U, // AsmJECLGI
1648371088U, // AsmJECLGR
110110076U, // AsmJECLI
1648371096U, // AsmJECLR
1648371075U, // AsmJECR
109061702U, // AsmJHAltCGI
1648371306U, // AsmJHAltCGR
109061694U, // AsmJHAltCI
110110287U, // AsmJHAltCLGI
1648371315U, // AsmJHAltCLGR
110110297U, // AsmJHAltCLI
1648371325U, // AsmJHAltCLR
1648371298U, // AsmJHAltCR
109063499U, // AsmJHCGI
1648373095U, // AsmJHCGR
109063493U, // AsmJHCI
110112082U, // AsmJHCLGI
1648373102U, // AsmJHCLGR
110112090U, // AsmJHCLI
1648373110U, // AsmJHCLR
1648373089U, // AsmJHCR
109064911U, // AsmJHEAltCGI
1648374511U, // AsmJHEAltCGR
109064904U, // AsmJHEAltCI
110113495U, // AsmJHEAltCLGI
1648374519U, // AsmJHEAltCLGR
110113504U, // AsmJHEAltCLI
1648374528U, // AsmJHEAltCLR
1648374504U, // AsmJHEAltCR
109061271U, // AsmJHECGI
1648370871U, // AsmJHECGR
109061264U, // AsmJHECI
110109855U, // AsmJHECLGI
1648370879U, // AsmJHECLGR
110109864U, // AsmJHECLI
1648370888U, // AsmJHECLR
1648370864U, // AsmJHECR
109061379U, // AsmJLAltCGI
1648370983U, // AsmJLAltCGR
109061371U, // AsmJLAltCI
110109964U, // AsmJLAltCLGI
1648370992U, // AsmJLAltCLGR
110109974U, // AsmJLAltCLI
1648371002U, // AsmJLAltCLR
1648370975U, // AsmJLAltCR
109064770U, // AsmJLCGI
1648374366U, // AsmJLCGR
109064764U, // AsmJLCI
110113353U, // AsmJLCLGI
1648374373U, // AsmJLCLGR
110113361U, // AsmJLCLI
1648374381U, // AsmJLCLR
1648374360U, // AsmJLCR
109063986U, // AsmJLEAltCGI
1648373586U, // AsmJLEAltCGR
109063979U, // AsmJLEAltCI
110112570U, // AsmJLEAltCLGI
1648373594U, // AsmJLEAltCLGR
110112579U, // AsmJLEAltCLI
1648373603U, // AsmJLEAltCLR
1648373579U, // AsmJLEAltCR
109061594U, // AsmJLECGI
1648371194U, // AsmJLECGR
109061587U, // AsmJLECI
110110178U, // AsmJLECLGI
1648371202U, // AsmJLECLGR
110110187U, // AsmJLECLI
1648371211U, // AsmJLECLR
1648371187U, // AsmJLECR
109061847U, // AsmJLHAltCGI
1648371447U, // AsmJLHAltCGR
109061840U, // AsmJLHAltCI
110110431U, // AsmJLHAltCLGI
1648371455U, // AsmJLHAltCLGR
110110440U, // AsmJLHAltCLI
1648371464U, // AsmJLHAltCLR
1648371440U, // AsmJLHAltCR
109063647U, // AsmJLHCGI
1648373247U, // AsmJLHCGR
109063640U, // AsmJLHCI
110112231U, // AsmJLHCLGI
1648373255U, // AsmJLHCLGR
110112240U, // AsmJLHCLI
1648373264U, // AsmJLHCLR
1648373240U, // AsmJLHCR
407498U, // AsmLBR
407223U, // AsmLEBR
34261U, // AsmLEJ
34253U, // AsmLEJG
10495398U, // AsmLELOC
10495420U, // AsmLELOCG
1058465U, // AsmLELOCGR
1058457U, // AsmLELOCR
11543981U, // AsmLESTOC
11544004U, // AsmLESTOCG
407468U, // AsmLHBR
36314U, // AsmLHJ
36266U, // AsmLHJG
10497418U, // AsmLHLOC
10497433U, // AsmLHLOCG
1060547U, // AsmLHLOCGR
1060539U, // AsmLHLOCR
11546001U, // AsmLHSTOC
11546017U, // AsmLHSTOCG
37438U, // AsmLJ
37400U, // AsmLJG
10498540U, // AsmLLOC
10498569U, // AsmLLOCG
1061700U, // AsmLLOCGR
1061663U, // AsmLLOCR
2191533074U, // AsmLOC
2191534651U, // AsmLOCG
2718971716U, // AsmLOCGR
2718971527U, // AsmLOCR
11547122U, // AsmLSTOC
11547152U, // AsmLSTOCG
407236U, // AsmNEBR
34514U, // AsmNEJ
34506U, // AsmNEJG
10495658U, // AsmNELOC
10495673U, // AsmNELOCG
1058590U, // AsmNELOCGR
1058582U, // AsmNELOCR
11544241U, // AsmNESTOC
11544257U, // AsmNESTOCG
407487U, // AsmNHBR
407216U, // AsmNHEBR
34045U, // AsmNHEJ
34036U, // AsmNHEJG
10495184U, // AsmNHELOC
10495201U, // AsmNHELOCG
1058124U, // AsmNHELOCGR
1058115U, // AsmNHELOCR
11543768U, // AsmNHESTOC
11543786U, // AsmNHESTOCG
36653U, // AsmNHJ
36645U, // AsmNHJG
10497797U, // AsmNHLOC
10497812U, // AsmNHLOCG
1060729U, // AsmNHLOCGR
1060721U, // AsmNHLOCR
11546380U, // AsmNHSTOC
11546396U, // AsmNHSTOCG
407513U, // AsmNLBR
407229U, // AsmNLEBR
34368U, // AsmNLEJ
34359U, // AsmNLEJG
10495507U, // AsmNLELOC
10495524U, // AsmNLELOCG
1058447U, // AsmNLELOCGR
1058438U, // AsmNLELOCR
11544091U, // AsmNLESTOC
11544109U, // AsmNLESTOCG
407480U, // AsmNLHBR
36443U, // AsmNLHJ
36434U, // AsmNLHJG
10497582U, // AsmNLHLOC
10497599U, // AsmNLHLOCG
1060529U, // AsmNLHLOCGR
1060520U, // AsmNLHLOCR
11546166U, // AsmNLHSTOC
11546184U, // AsmNLHSTOCG
37578U, // AsmNLJ
37570U, // AsmNLJG
10498722U, // AsmNLLOC
10498737U, // AsmNLLOCG
1061648U, // AsmNLLOCGR
1061640U, // AsmNLLOCR
11547305U, // AsmNLSTOC
11547321U, // AsmNLSTOCG
407539U, // AsmNOBR
37958U, // AsmNOJ
37952U, // AsmNOJG
10499104U, // AsmNOLOC
10499119U, // AsmNOLOCG
1061971U, // AsmNOLOCGR
1061963U, // AsmNOLOCR
11547687U, // AsmNOSTOC
11547703U, // AsmNOSTOCG
407534U, // AsmOBR
37916U, // AsmOJ
37911U, // AsmOJG
10499067U, // AsmOLOC
10499080U, // AsmOLOCG
1061999U, // AsmOLOCGR
1061985U, // AsmOLOCR
11547649U, // AsmOSTOC
11547663U, // AsmOSTOCG
2729452567U, // AsmSTOC
2729454145U, // AsmSTOCG
4208638U, // BASR
406721U, // BR
12597279U, // BRAS
12596126U, // BRASL
47904U, // BRC
47899U, // BRCL
13646319U, // BRCT
13642624U, // BRCTG
14689262U, // C
14688424U, // CDB
4207814U, // CDBR
4208039U, // CDFBR
4208084U, // CDGBR
2733651381U, // CDLFBR
2733651426U, // CDLGBR
14688717U, // CEB
4207933U, // CEBR
4208046U, // CEFBR
4208091U, // CEGBR
2733651389U, // CELFBR
2733651434U, // CELGBR
15742169U, // CFDBR
15742296U, // CFEBR
16789597U, // CFI
0U, // CFIMux
15742498U, // CFXBR
14690853U, // CG
15742184U, // CGDBR
15742311U, // CGEBR
14690236U, // CGF
16789608U, // CGFI
4208364U, // CGFR
17838893U, // CGFRL
14691462U, // CGH
18886834U, // CGHI
17838944U, // CGHRL
3166472U, // CGHSI
580386U, // CGIJ
4208447U, // CGR
20110134U, // CGRJ
17838918U, // CGRL
15742513U, // CGXBR
14691337U, // CH
14690320U, // CHF
3166487U, // CHHSI
18886823U, // CHI
17838938U, // CHRL
3166458U, // CHSI
14695025U, // CHY
16788779U, // CIH
580382U, // CIJ
14692846U, // CL
58362U, // CLC
0U, // CLCLoop
0U, // CLCSequence
2733651168U, // CLFDBR
2733651295U, // CLFEBR
20992256U, // CLFHSI
22032528U, // CLFI
0U, // CLFIMux
2733651497U, // CLFXBR
14690999U, // CLG
2733651183U, // CLGDBR
2733651310U, // CLGEBR
14690254U, // CLGF
22032501U, // CLGFI
4208377U, // CLGFR
17838900U, // CLGFRL
17838951U, // CLGHRL
20992271U, // CLGHSI
711463U, // CLGIJ
4208471U, // CLGR
20110139U, // CLGRJ
17838924U, // CLGRL
2733651512U, // CLGXBR
14690364U, // CLHF
20992286U, // CLHHSI
17838967U, // CLHRL
23089378U, // CLI
22031671U, // CLIH
711469U, // CLIJ
23091851U, // CLIY
0U, // CLMux
4208591U, // CLR
20110145U, // CLRJ
17838988U, // CLRL
4209161U, // CLST
0U, // CLSTLoop
14695083U, // CLY
0U, // CMux
574633624U, // CPSDRdd
574633624U, // CPSDRds
574633624U, // CPSDRsd
574633624U, // CPSDRss
4208240U, // CR
20110130U, // CRJ
17838881U, // CRL
3255843013U, // CS
3255839581U, // CSG
3255843522U, // CSY
4208142U, // CXBR
4208077U, // CXFBR
4208122U, // CXGBR
2733651397U, // CXLFBR
2733651442U, // CXLGBR
14694988U, // CY
0U, // CallBASR
0U, // CallBR
0U, // CallBRASL
0U, // CallJG
0U, // CondStore16
0U, // CondStore16Inv
0U, // CondStore16Mux
0U, // CondStore16MuxInv
0U, // CondStore32
0U, // CondStore32Inv
0U, // CondStore64
0U, // CondStore64Inv
0U, // CondStore8
0U, // CondStore8Inv
0U, // CondStore8Mux
0U, // CondStore8MuxInv
0U, // CondStoreF32
0U, // CondStoreF32Inv
0U, // CondStoreF64
0U, // CondStoreF64Inv
8383U, // DDB
1062092U, // DDBR
8660U, // DEB
1062212U, // DEBR
12799U, // DL
10940U, // DLG
1062749U, // DLGR
1062868U, // DLR
11106U, // DSG
10216U, // DSGF
1062684U, // DSGFR
1062786U, // DSGR
1062421U, // DXBR
24130745U, // EAR
402489U, // ETND
15742199U, // FIDBR
2733645847U, // FIDBRA
15742326U, // FIEBR
2733645855U, // FIEBRA
15742528U, // FIXBR
2733645879U, // FIXBRA
4208501U, // FLOGR
0U, // GOT
9201U, // IC
9201U, // IC32
14923U, // IC32Y
14923U, // ICY
0U, // IIFMux
22030357U, // IIHF
0U, // IIHF64
20982984U, // IIHH
0U, // IIHH64
20984349U, // IIHL
0U, // IIHL64
0U, // IIHMux
22030502U, // IILF
0U, // IILF64
20983231U, // IILH
0U, // IILH64
20984436U, // IILL
0U, // IILL64
0U, // IILMux
406463U, // IPM
37169U, // J
35484U, // JG
14692841U, // L
0U, // L128
14688262U, // LA
3795853313U, // LAA
3795855845U, // LAAG
3795857894U, // LAAL
3795856038U, // LAALG
3795858397U, // LAN
3795856167U, // LANG
3795858422U, // LAO
3795856179U, // LAOG
17838873U, // LARL
3795860029U, // LAX
3795856330U, // LAXG
14694982U, // LAY
14688948U, // LB
14691329U, // LBH
0U, // LBMux
4208130U, // LBR
2195726433U, // LCBB
4207813U, // LCDBR
4208336U, // LCDFR
4208336U, // LCDFR_32
4207932U, // LCEBR
4208363U, // LCGFR
4208446U, // LCGR
4208252U, // LCR
4208141U, // LCXBR
14689333U, // LD
14689361U, // LDE32
14688723U, // LDEB
4207939U, // LDEBR
4208459U, // LDGR
4208275U, // LDR
4208148U, // LDXBR
2733645863U, // LDXBRA
14694998U, // LDY
14689705U, // LE
4207826U, // LEDBR
2733645839U, // LEDBRA
0U, // LEFR
4208312U, // LER
4208155U, // LEXBR
2733645871U, // LEXBRA
14695009U, // LEY
0U, // LFER
14691449U, // LFH
14690985U, // LG
14688839U, // LGB
4208100U, // LGBR
4208269U, // LGDR
14690249U, // LGF
16789615U, // LGFI
4208371U, // LGFR
17838901U, // LGFRL
14691488U, // LGH
18886840U, // LGHI
4208550U, // LGHR
17838952U, // LGHRL
4208466U, // LGR
17838925U, // LGRL
14691718U, // LH
14691556U, // LHH
18886866U, // LHI
0U, // LHIMux
0U, // LHMux
4208557U, // LHR
17838968U, // LHRL
14695030U, // LHY
14689279U, // LLC
14691347U, // LLCH
0U, // LLCMux
4208257U, // LLCR
0U, // LLCRMux
14689259U, // LLGC
4208244U, // LLGCR
14690260U, // LLGF
4208384U, // LLGFR
17838908U, // LLGFRL
14691487U, // LLGH
4208549U, // LLGHR
17838959U, // LLGHRL
14691867U, // LLH
14691561U, // LLHH
0U, // LLHMux
4208562U, // LLHR
17838974U, // LLHRL
0U, // LLHRMux
22030363U, // LLIHF
25177294U, // LLIHH
25178659U, // LLIHL
22030508U, // LLILF
25177541U, // LLILH
25178746U, // LLILL
3795856156U, // LMG
0U, // LMux
4207876U, // LNDBR
4208343U, // LNDFR
4208343U, // LNDFR_32
4207997U, // LNEBR
4208398U, // LNGFR
4208495U, // LNGR
4208617U, // LNR
4208205U, // LNXBR
72450U, // LOC
72464U, // LOCG
80715U, // LOCGR
80710U, // LOCR
4207883U, // LPDBR
4208350U, // LPDFR
4208350U, // LPDFR_32
4208004U, // LPEBR
4208405U, // LPGFR
4208508U, // LPGR
4208633U, // LPR
4208212U, // LPXBR
4208582U, // LR
17838989U, // LRL
0U, // LRMux
14694939U, // LRV
14691261U, // LRVG
4208532U, // LRVGR
4208654U, // LRVR
14694901U, // LT
4207904U, // LTDBR
4207904U, // LTDBRCompare
0U, // LTDBRCompare_VecPseudo
4208025U, // LTEBR
4208025U, // LTEBRCompare
0U, // LTEBRCompare_VecPseudo
14691207U, // LTG
14690292U, // LTGF
4208426U, // LTGFR
4208526U, // LTGR
4208649U, // LTR
4208232U, // LTXBR
4208232U, // LTXBRCompare
0U, // LTXBRCompare_VecPseudo
0U, // LX
14688691U, // LXDB
4207911U, // LXDBR
14688809U, // LXEB
4208032U, // LXEBR
4208660U, // LXR
14695079U, // LY
407199U, // LZDR
407242U, // LZER
407577U, // LZXR
34611352U, // MADB
571487422U, // MADBR
34611655U, // MAEB
571487541U, // MAEBR
8537U, // MDB
1062142U, // MDBR
8672U, // MDEB
1062218U, // MDEBR
8685U, // MEEB
1062225U, // MEEBR
3158206U, // MGHI
12012U, // MH
3158231U, // MHI
14971U, // MHY
10974U, // MLG
1062755U, // MLGR
14819U, // MS
34611621U, // MSDB
571487513U, // MSDBR
34611740U, // MSEB
571487634U, // MSEBR
2109596U, // MSFI
11126U, // MSG
10222U, // MSGF
2109571U, // MSGFI
1062691U, // MSGFR
1062792U, // MSGR
1062916U, // MSR
15047U, // MSY
58407U, // MVC
0U, // MVCLoop
0U, // MVCSequence
3166404U, // MVGHI
3166411U, // MVHHI
3166428U, // MVHI
23089446U, // MVI
23091867U, // MVIY
4209173U, // MVST
0U, // MVSTLoop
1062471U, // MXBR
8633U, // MXDB
1062190U, // MXDBR
13279U, // N
58377U, // NC
0U, // NCLoop
0U, // NCSequence
11049U, // NG
1062768U, // NGR
574632366U, // NGRK
23089383U, // NI
0U, // NIFMux
6301730U, // NIHF
0U, // NIHF64
20982997U, // NIHH
0U, // NIHH64
20984362U, // NIHL
0U, // NIHL64
0U, // NIHMux
6301875U, // NILF
0U, // NILF64
20983244U, // NILH
0U, // NILH64
20984449U, // NILL
0U, // NILL64
0U, // NILMux
23091857U, // NIY
1062890U, // NR
574632402U, // NRK
14691212U, // NTSTG
15034U, // NY
13304U, // O
58387U, // OC
0U, // OCLoop
0U, // OCSequence
11061U, // OG
1062775U, // OGR
574632372U, // OGRK
23089387U, // OI
0U, // OIFMux
6301736U, // OIHF
0U, // OIHF64
20983003U, // OIHH
0U, // OIHH64
20984368U, // OIHL
0U, // OIHL64
0U, // OIHMux
6301881U, // OILF
0U, // OILF64
20983250U, // OILH
0U, // OILH64
20984455U, // OILL
0U, // OILL64
0U, // OILMux
23091862U, // OIY
1062895U, // OR
574632407U, // ORK
15038U, // OY
812080U, // PFD
291622U, // PFDRL
4209145U, // POPCNT
1111498762U, // PPA
1108355590U, // RISBG
1108355590U, // RISBG32
1108358114U, // RISBGN
1108355696U, // RISBHG
0U, // RISBHH
0U, // RISBHL
1108355757U, // RISBLG
0U, // RISBLH
0U, // RISBLL
0U, // RISBMux
3795858067U, // RLL
3795856082U, // RLLG
1108355597U, // RNSBG
1108355604U, // ROSBG
1108355611U, // RXSBG
0U, // Return
14370U, // S
8599U, // SDB
1062170U, // SDBR
8733U, // SEB
1062291U, // SEBR
11102U, // SG
10217U, // SGF
1062685U, // SGFR
1062787U, // SGR
574632378U, // SGRK
12244U, // SH
14976U, // SHY
13217U, // SL
8970U, // SLB
10752U, // SLBG
1062401U, // SLBR
6303894U, // SLFI
11003U, // SLG
1062710U, // SLGBR
10202U, // SLGF
6303868U, // SLGFI
1062663U, // SLGFR
1062761U, // SLGR
574632359U, // SLGRK
10498712U, // SLL
3795856088U, // SLLG
3795857801U, // SLLK
1062879U, // SLR
574632396U, // SLRK
15024U, // SLY
14688647U, // SQDB
4207890U, // SQDBR
14688790U, // SQEB
4208011U, // SQEBR
4208219U, // SQXBR
1062912U, // SR
10494016U, // SRA
3795855861U, // SRAG
3795857759U, // SRAK
574632412U, // SRK
10498963U, // SRL
3795856115U, // SRLG
3795857807U, // SRLK
4209167U, // SRST
0U, // SRSTLoop
14694923U, // ST
0U, // ST128
14689314U, // STC
14691380U, // STCH
414053U, // STCK
411039U, // STCKE
411772U, // STCKF
0U, // STCMux
14694992U, // STCY
14689343U, // STD
14695003U, // STDY
14690102U, // STE
14695014U, // STEY
14691454U, // STFH
411061U, // STFLE
14691214U, // STG
17838931U, // STGRL
14692325U, // STH
14691608U, // STHH
0U, // STHMux
17838981U, // STHRL
14695045U, // STHY
3795856161U, // STMG
0U, // STMux
88838U, // STOC
88853U, // STOCG
17839000U, // STRL
14694944U, // STRV
14691267U, // STRVG
0U, // STX
14695116U, // STY
1062498U, // SXBR
15043U, // SY
0U, // Select32
0U, // Select32Mux
0U, // Select64
0U, // SelectF128
0U, // SelectF32
0U, // SelectF64
0U, // Serialize
416257U, // TABORT
20993002U, // TBEGIN
20988932U, // TBEGINC
0U, // TBEGIN_nofloat
6923U, // TEND
0U, // TLS_GDCALL
0U, // TLS_LDCALL
23090132U, // TM
25177342U, // TMHH
0U, // TMHH64
25178678U, // TMHL
0U, // TMHL64
0U, // TMHMux
25177640U, // TMLH
0U, // TMLH64
25178765U, // TMLL
0U, // TMLL64
0U, // TMLMux
23091893U, // TMY
574627932U, // VAB
574627949U, // VACCB
574633108U, // VACCCQ
574629712U, // VACCF
574630434U, // VACCG
574630918U, // VACCH
574633101U, // VACCQ
574633095U, // VACQ
574629707U, // VAF
574630395U, // VAG
574630908U, // VAH
574633090U, // VAQ
574628436U, // VAVGB
574629882U, // VAVGF
574630498U, // VAVGG
574631085U, // VAVGH
574628543U, // VAVGLB
574630039U, // VAVGLF
574630593U, // VAVGLG
574631344U, // VAVGLH
1111499311U, // VCDGB
1111499332U, // VCDLGB
574628719U, // VCEQB
574634126U, // VCEQBS
574630226U, // VCEQF
574634234U, // VCEQFS
574630734U, // VCEQG
574634321U, // VCEQGS
574631859U, // VCEQH
574634395U, // VCEQHS
1111499003U, // VCGDB
574628457U, // VCHB
574634111U, // VCHBS
574629903U, // VCHF
574634219U, // VCHFS
574630520U, // VCHG
574634306U, // VCHGS
574631106U, // VCHH
574634380U, // VCHHS
574628551U, // VCHLB
574634118U, // VCHLBS
574630047U, // VCHLF
574634226U, // VCHLFS
574630601U, // VCHLG
574634313U, // VCHLGS
574631352U, // VCHLH
574634387U, // VCHLHS
574632907U, // VCKSM
1111499017U, // VCLGDB
4203485U, // VCLZB
4205015U, // VCLZF
4205534U, // VCLZG
4206660U, // VCLZH
4203492U, // VCTZB
4205022U, // VCTZF
4205541U, // VCTZG
4206667U, // VCTZH
4202612U, // VECB
4204375U, // VECF
4205097U, // VECG
4205581U, // VECH
4203192U, // VECLB
4204688U, // VECLF
4205237U, // VECLG
4205955U, // VECLH
571482921U, // VERIMB
571484435U, // VERIMF
571484948U, // VERIMG
571485942U, // VERIMH
3795854038U, // VERLLB
3795855565U, // VERLLF
3795856080U, // VERLLG
3795856928U, // VERLLH
574628755U, // VERLLVB
574630285U, // VERLLVF
574630819U, // VERLLVG
574631930U, // VERLLVH
3795854088U, // VESLB
3795855608U, // VESLF
3795856121U, // VESLG
3795857115U, // VESLH
574628773U, // VESLVB
574630303U, // VESLVF
574630837U, // VESLVG
574631948U, // VESLVH
3795853389U, // VESRAB
3795855171U, // VESRAF
3795855859U, // VESRAG
3795856372U, // VESRAH
574628739U, // VESRAVB
574630269U, // VESRAVF
574630803U, // VESRAVG
574631914U, // VESRAVH
3795854073U, // VESRLB
3795855600U, // VESRLF
3795856113U, // VESRLG
3795857107U, // VESRLH
574628764U, // VESRLVB
574630294U, // VESRLVF
574630828U, // VESRLVG
574631939U, // VESRLVH
574627976U, // VFADB
574628287U, // VFAEB
574634086U, // VFAEBS
574629739U, // VFAEF
574634194U, // VFAEFS
574630970U, // VFAEH
574634355U, // VFAEHS
574628796U, // VFAEZB
574634153U, // VFAEZBS
574630326U, // VFAEZF
574634278U, // VFAEZFS
574631971U, // VFAEZH
574634439U, // VFAEZHS
574628043U, // VFCEDB
574634030U, // VFCEDBS
574628121U, // VFCHDB
574634068U, // VFCHDBS
574628059U, // VFCHEDB
574634048U, // VFCHEDBS
574628029U, // VFDDB
574628326U, // VFEEB
574634094U, // VFEEBS
574629760U, // VFEEF
574634202U, // VFEEFS
574630984U, // VFEEH
574634363U, // VFEEHS
574628804U, // VFEEZB
574634162U, // VFEEZBS
574630334U, // VFEEZF
574634287U, // VFEEZFS
574631979U, // VFEEZH
574634448U, // VFEEZHS
574628366U, // VFENEB
574634102U, // VFENEBS
574629800U, // VFENEF
574634210U, // VFENEFS
574631018U, // VFENEH
574634371U, // VFENEHS
574628820U, // VFENEZB
574634171U, // VFENEZBS
574630350U, // VFENEZF
574634296U, // VFENEZFS
574631995U, // VFENEZH
574634457U, // VFENEZHS
1111499067U, // VFIDB
4202669U, // VFLCDB
4202853U, // VFLNDB
4202869U, // VFLPDB
574627990U, // VFMADB
574628183U, // VFMDB
574628259U, // VFMSDB
574628245U, // VFSDB
4202885U, // VFSQDB
1648369961U, // VFTCIDB
25179060U, // VGBM
160442247U, // VGEF
193997391U, // VGEG
574627909U, // VGFMAB
574629691U, // VGFMAF
574630379U, // VGFMAG
574630892U, // VGFMAH
574628636U, // VGFMB
574630150U, // VGFMF
574630663U, // VGFMG
574631657U, // VGFMH
210772771U, // VGMB
210774285U, // VGMF
210774798U, // VGMG
210775792U, // VGMH
4203382U, // VISTRB
4208790U, // VISTRBS
4204897U, // VISTRF
4208898U, // VISTRFS
4206537U, // VISTRH
4209059U, // VISTRHS
14693296U, // VL
0U, // VL32
0U, // VL64
2195726439U, // VLBB
4202618U, // VLCB
4204381U, // VLCF
4205109U, // VLCG
4205593U, // VLCH
4202962U, // VLDEB
2181046786U, // VLEB
1111498989U, // VLEDB
2717919132U, // VLEF
3254790741U, // VLEG
3791662174U, // VLEH
2721063586U, // VLEIB
36710509U, // VLEIF
573581965U, // VLEIG
1110453552U, // VLEIH
3795854220U, // VLGVB
3795855750U, // VLGVF
3795856284U, // VLGVG
3795857395U, // VLGVH
3795858077U, // VLL
14689228U, // VLLEZB
14690758U, // VLLEZF
14691286U, // VLLEZG
14692403U, // VLLEZH
3795858362U, // VLM
4203369U, // VLPB
4204876U, // VLPF
4205384U, // VLPG
4206509U, // VLPH
4208612U, // VLR
0U, // VLR32
0U, // VLR64
14689114U, // VLREPB
14690621U, // VLREPF
14691129U, // VLREPG
14692254U, // VLREPH
3255837275U, // VLVGB
3255838721U, // VLVGF
3255839337U, // VLVGG
3255839924U, // VLVGH
574633083U, // VLVGP
0U, // VLVGP32
574628294U, // VMAEB
574629746U, // VMAEF
574630977U, // VMAEH
574628450U, // VMAHB
574629896U, // VMAHF
574631099U, // VMAHH
574628529U, // VMALB
574628339U, // VMALEB
574629773U, // VMALEF
574630991U, // VMALEH
574630025U, // VMALF
574628463U, // VMALHB
574629940U, // VMALHF
574631137U, // VMALHH
574634534U, // VMALHW
574628677U, // VMALOB
574630184U, // VMALOF
574631817U, // VMALOH
574628670U, // VMAOB
574630177U, // VMAOF
574631810U, // VMAOH
574628360U, // VMEB
574629794U, // VMEF
574631012U, // VMEH
574628486U, // VMHB
574629969U, // VMHF
574631172U, // VMHH
574628574U, // VMLB
574628347U, // VMLEB
574629781U, // VMLEF
574630999U, // VMLEH
574630101U, // VMLF
574628471U, // VMLHB
574629954U, // VMLHF
574631151U, // VMLHH
574634542U, // VMLHW
574628685U, // VMLOB
574630192U, // VMLOF
574631825U, // VMLOH
574628664U, // VMNB
574630171U, // VMNF
574630701U, // VMNG
574631787U, // VMNH
574628580U, // VMNLB
574630107U, // VMNLF
574630627U, // VMNLG
574631585U, // VMNLH
574628692U, // VMOB
574630199U, // VMOF
574631832U, // VMOH
574628499U, // VMRHB
574629982U, // VMRHF
574630526U, // VMRHG
574631185U, // VMRHH
574628594U, // VMRLB
574630121U, // VMRLF
574630634U, // VMRLG
574631628U, // VMRLH
574628781U, // VMXB
574630311U, // VMXF
574630864U, // VMXG
574631956U, // VMXH
574628629U, // VMXLB
574630143U, // VMXLF
574630656U, // VMXLG
574631650U, // VMXLH
574632946U, // VN
574628877U, // VNC
574633052U, // VNO
574633079U, // VO
403216U, // VONE
574632018U, // VPDI
574632900U, // VPERM
574630019U, // VPKF
574630560U, // VPKG
574631293U, // VPKH
574630256U, // VPKLSF
574634259U, // VPKLSFS
574630766U, // VPKLSG
574634337U, // VPKLSGS
574631896U, // VPKLSH
574634420U, // VPKLSHS
574630249U, // VPKSF
574634251U, // VPKSFS
574630759U, // VPKSG
574634329U, // VPKSGS
574631889U, // VPKSH
574634412U, // VPKSHS
1111505383U, // VPOPCT
1648370530U, // VREPB
1648372037U, // VREPF
1648372545U, // VREPG
1648373670U, // VREPH
18883241U, // VREPIB
18884724U, // VREPIF
18885268U, // VREPIG
18885949U, // VREPIH
574628734U, // VSB
574633116U, // VSBCBIQ
574633133U, // VSBIQ
574628506U, // VSCBIB
574629989U, // VSCBIF
574630533U, // VSCBIG
574631203U, // VSCBIH
574633125U, // VSCBIQ
262154105U, // VSCEF
295709256U, // VSCEG
4203069U, // VSEGB
4204481U, // VSEGF
4205715U, // VSEGH
574632451U, // VSEL
574630264U, // VSF
574630779U, // VSG
574631904U, // VSH
574632869U, // VSL
574628623U, // VSLB
574628176U, // VSLDB
574633140U, // VSQ
574627903U, // VSRA
574627925U, // VSRAB
574632850U, // VSRL
574628609U, // VSRLB
14694934U, // VST
0U, // VST32
0U, // VST64
2195726882U, // VSTEB
2195728304U, // VSTEF
2732599899U, // VSTEG
3269471346U, // VSTEH
3795858346U, // VSTL
3795858386U, // VSTM
574627968U, // VSTRCB
574634021U, // VSTRCBS
574629731U, // VSTRCF
574634185U, // VSTRCFS
574630956U, // VSTRCH
574634346U, // VSTRCHS
574628787U, // VSTRCZB
574634143U, // VSTRCZBS
574630317U, // VSTRCZF
574634268U, // VSTRCZFS
574631962U, // VSTRCZH
574634429U, // VSTRCZHS
574628657U, // VSUMB
574629856U, // VSUMGF
574631077U, // VSUMGH
574631678U, // VSUMH
574630233U, // VSUMQF
574630741U, // VSUMQG
4207576U, // VTM
4203148U, // VUPHB
4204631U, // VUPHF
4205834U, // VUPHH
4203243U, // VUPLB
4204770U, // VUPLF
4203134U, // VUPLHB
4204617U, // VUPLHF
4205814U, // VUPLHH
4209205U, // VUPLHW
4203214U, // VUPLLB
4204741U, // VUPLLF
4206104U, // VUPLLH
574634562U, // VX
406632U, // VZERO
1111499318U, // WCDGB
1111499340U, // WCDLGB
1111499010U, // WCGDB
1111499025U, // WCLGDB
574627983U, // WFADB
4202662U, // WFCDB
574628051U, // WFCEDB
574634039U, // WFCEDBS
574628129U, // WFCHDB
574634077U, // WFCHDBS
574628068U, // WFCHEDB
574634058U, // WFCHEDBS
574628036U, // WFDDB
1111499074U, // WFIDB
4202825U, // WFKDB
4202677U, // WFLCDB
4202861U, // WFLNDB
4202877U, // WFLPDB
574627998U, // WFMADB
574628190U, // WFMDB
574628267U, // WFMSDB
574628252U, // WFSDB
4202893U, // WFSQDB
1648369970U, // WFTCIDB
4202969U, // WLDEB
1111498996U, // WLEDB
14911U, // X
58412U, // XC
0U, // XCLoop
0U, // XCSequence
11212U, // XG
1062811U, // XGR
574632384U, // XGRK
23089451U, // XI
0U, // XIFMux
6301742U, // XIHF
0U, // XIHF64
6301887U, // XILF
0U, // XILF64
23091873U, // XIY
1062933U, // XR
574632417U, // XRK
15057U, // XY
0U, // ZEXT128_32
0U, // ZEXT128_64
};
static const uint8_t OpInfo1[] = {
0U, // PHI
0U, // INLINEASM
0U, // CFI_INSTRUCTION
0U, // EH_LABEL
0U, // GC_LABEL
0U, // KILL
0U, // EXTRACT_SUBREG
0U, // INSERT_SUBREG
0U, // IMPLICIT_DEF
0U, // SUBREG_TO_REG
0U, // COPY_TO_REGCLASS
0U, // DBG_VALUE
0U, // REG_SEQUENCE
0U, // COPY
0U, // BUNDLE
0U, // LIFETIME_START
0U, // LIFETIME_END
0U, // STACKMAP
0U, // PATCHPOINT
0U, // LOAD_STACK_GUARD
0U, // STATEPOINT
0U, // LOCAL_ESCAPE
0U, // FAULTING_LOAD_OP
0U, // A
0U, // ADB
0U, // ADBR
0U, // ADJCALLSTACKDOWN
0U, // ADJCALLSTACKUP
0U, // ADJDYNALLOC
0U, // AEB
0U, // AEBR
0U, // AEXT128_64
0U, // AFI
0U, // AFIMux
0U, // AG
0U, // AGF
0U, // AGFI
0U, // AGFR
0U, // AGHI
0U, // AGHIK
0U, // AGR
0U, // AGRK
0U, // AGSI
0U, // AH
0U, // AHI
0U, // AHIK
0U, // AHIMux
0U, // AHIMuxK
0U, // AHY
0U, // AIH
0U, // AL
0U, // ALC
0U, // ALCG
0U, // ALCGR
0U, // ALCR
0U, // ALFI
0U, // ALG
0U, // ALGF
0U, // ALGFI
0U, // ALGFR
0U, // ALGHSIK
0U, // ALGR
0U, // ALGRK
0U, // ALHSIK
0U, // ALR
0U, // ALRK
0U, // ALY
0U, // AR
0U, // ARK
0U, // ASI
0U, // ATOMIC_CMP_SWAPW
0U, // ATOMIC_LOADW_AFI
0U, // ATOMIC_LOADW_AR
0U, // ATOMIC_LOADW_MAX
0U, // ATOMIC_LOADW_MIN
0U, // ATOMIC_LOADW_NILH
0U, // ATOMIC_LOADW_NILHi
0U, // ATOMIC_LOADW_NR
0U, // ATOMIC_LOADW_NRi
0U, // ATOMIC_LOADW_OILH
0U, // ATOMIC_LOADW_OR
0U, // ATOMIC_LOADW_SR
0U, // ATOMIC_LOADW_UMAX
0U, // ATOMIC_LOADW_UMIN
0U, // ATOMIC_LOADW_XILF
0U, // ATOMIC_LOADW_XR
0U, // ATOMIC_LOAD_AFI
0U, // ATOMIC_LOAD_AGFI
0U, // ATOMIC_LOAD_AGHI
0U, // ATOMIC_LOAD_AGR
0U, // ATOMIC_LOAD_AHI
0U, // ATOMIC_LOAD_AR
0U, // ATOMIC_LOAD_MAX_32
0U, // ATOMIC_LOAD_MAX_64
0U, // ATOMIC_LOAD_MIN_32
0U, // ATOMIC_LOAD_MIN_64
0U, // ATOMIC_LOAD_NGR
0U, // ATOMIC_LOAD_NGRi
0U, // ATOMIC_LOAD_NIHF64
0U, // ATOMIC_LOAD_NIHF64i
0U, // ATOMIC_LOAD_NIHH64
0U, // ATOMIC_LOAD_NIHH64i
0U, // ATOMIC_LOAD_NIHL64
0U, // ATOMIC_LOAD_NIHL64i
0U, // ATOMIC_LOAD_NILF
0U, // ATOMIC_LOAD_NILF64
0U, // ATOMIC_LOAD_NILF64i
0U, // ATOMIC_LOAD_NILFi
0U, // ATOMIC_LOAD_NILH
0U, // ATOMIC_LOAD_NILH64
0U, // ATOMIC_LOAD_NILH64i
0U, // ATOMIC_LOAD_NILHi
0U, // ATOMIC_LOAD_NILL
0U, // ATOMIC_LOAD_NILL64
0U, // ATOMIC_LOAD_NILL64i
0U, // ATOMIC_LOAD_NILLi
0U, // ATOMIC_LOAD_NR
0U, // ATOMIC_LOAD_NRi
0U, // ATOMIC_LOAD_OGR
0U, // ATOMIC_LOAD_OIHF64
0U, // ATOMIC_LOAD_OIHH64
0U, // ATOMIC_LOAD_OIHL64
0U, // ATOMIC_LOAD_OILF
0U, // ATOMIC_LOAD_OILF64
0U, // ATOMIC_LOAD_OILH
0U, // ATOMIC_LOAD_OILH64
0U, // ATOMIC_LOAD_OILL
0U, // ATOMIC_LOAD_OILL64
0U, // ATOMIC_LOAD_OR
0U, // ATOMIC_LOAD_SGR
0U, // ATOMIC_LOAD_SR
0U, // ATOMIC_LOAD_UMAX_32
0U, // ATOMIC_LOAD_UMAX_64
0U, // ATOMIC_LOAD_UMIN_32
0U, // ATOMIC_LOAD_UMIN_64
0U, // ATOMIC_LOAD_XGR
0U, // ATOMIC_LOAD_XIHF64
0U, // ATOMIC_LOAD_XILF
0U, // ATOMIC_LOAD_XILF64
0U, // ATOMIC_LOAD_XR
0U, // ATOMIC_SWAPW
0U, // ATOMIC_SWAP_32
0U, // ATOMIC_SWAP_64
0U, // AXBR
0U, // AY
0U, // AsmBCR
0U, // AsmBRC
0U, // AsmBRCL
0U, // AsmCGIJ
4U, // AsmCGRJ
0U, // AsmCIJ
0U, // AsmCLGIJ
4U, // AsmCLGRJ
0U, // AsmCLIJ
4U, // AsmCLRJ
4U, // AsmCRJ
0U, // AsmEBR
0U, // AsmEJ
0U, // AsmEJG
0U, // AsmELOC
0U, // AsmELOCG
0U, // AsmELOCGR
0U, // AsmELOCR
0U, // AsmESTOC
0U, // AsmESTOCG
0U, // AsmHBR
0U, // AsmHEBR
0U, // AsmHEJ
0U, // AsmHEJG
0U, // AsmHELOC
0U, // AsmHELOCG
0U, // AsmHELOCGR
0U, // AsmHELOCR
0U, // AsmHESTOC
0U, // AsmHESTOCG
0U, // AsmHJ
0U, // AsmHJG
0U, // AsmHLOC
0U, // AsmHLOCG
0U, // AsmHLOCGR
0U, // AsmHLOCR
0U, // AsmHSTOC
0U, // AsmHSTOCG
0U, // AsmJEAltCGI
0U, // AsmJEAltCGR
0U, // AsmJEAltCI
0U, // AsmJEAltCLGI
0U, // AsmJEAltCLGR
0U, // AsmJEAltCLI
0U, // AsmJEAltCLR
0U, // AsmJEAltCR
0U, // AsmJECGI
0U, // AsmJECGR
0U, // AsmJECI
0U, // AsmJECLGI
0U, // AsmJECLGR
0U, // AsmJECLI
0U, // AsmJECLR
0U, // AsmJECR
0U, // AsmJHAltCGI
0U, // AsmJHAltCGR
0U, // AsmJHAltCI
0U, // AsmJHAltCLGI
0U, // AsmJHAltCLGR
0U, // AsmJHAltCLI
0U, // AsmJHAltCLR
0U, // AsmJHAltCR
0U, // AsmJHCGI
0U, // AsmJHCGR
0U, // AsmJHCI
0U, // AsmJHCLGI
0U, // AsmJHCLGR
0U, // AsmJHCLI
0U, // AsmJHCLR
0U, // AsmJHCR
0U, // AsmJHEAltCGI
0U, // AsmJHEAltCGR
0U, // AsmJHEAltCI
0U, // AsmJHEAltCLGI
0U, // AsmJHEAltCLGR
0U, // AsmJHEAltCLI
0U, // AsmJHEAltCLR
0U, // AsmJHEAltCR
0U, // AsmJHECGI
0U, // AsmJHECGR
0U, // AsmJHECI
0U, // AsmJHECLGI
0U, // AsmJHECLGR
0U, // AsmJHECLI
0U, // AsmJHECLR
0U, // AsmJHECR
0U, // AsmJLAltCGI
0U, // AsmJLAltCGR
0U, // AsmJLAltCI
0U, // AsmJLAltCLGI
0U, // AsmJLAltCLGR
0U, // AsmJLAltCLI
0U, // AsmJLAltCLR
0U, // AsmJLAltCR
0U, // AsmJLCGI
0U, // AsmJLCGR
0U, // AsmJLCI
0U, // AsmJLCLGI
0U, // AsmJLCLGR
0U, // AsmJLCLI
0U, // AsmJLCLR
0U, // AsmJLCR
0U, // AsmJLEAltCGI
0U, // AsmJLEAltCGR
0U, // AsmJLEAltCI
0U, // AsmJLEAltCLGI
0U, // AsmJLEAltCLGR
0U, // AsmJLEAltCLI
0U, // AsmJLEAltCLR
0U, // AsmJLEAltCR
0U, // AsmJLECGI
0U, // AsmJLECGR
0U, // AsmJLECI
0U, // AsmJLECLGI
0U, // AsmJLECLGR
0U, // AsmJLECLI
0U, // AsmJLECLR
0U, // AsmJLECR
0U, // AsmJLHAltCGI
0U, // AsmJLHAltCGR
0U, // AsmJLHAltCI
0U, // AsmJLHAltCLGI
0U, // AsmJLHAltCLGR
0U, // AsmJLHAltCLI
0U, // AsmJLHAltCLR
0U, // AsmJLHAltCR
0U, // AsmJLHCGI
0U, // AsmJLHCGR
0U, // AsmJLHCI
0U, // AsmJLHCLGI
0U, // AsmJLHCLGR
0U, // AsmJLHCLI
0U, // AsmJLHCLR
0U, // AsmJLHCR
0U, // AsmLBR
0U, // AsmLEBR
0U, // AsmLEJ
0U, // AsmLEJG
0U, // AsmLELOC
0U, // AsmLELOCG
0U, // AsmLELOCGR
0U, // AsmLELOCR
0U, // AsmLESTOC
0U, // AsmLESTOCG
0U, // AsmLHBR
0U, // AsmLHJ
0U, // AsmLHJG
0U, // AsmLHLOC
0U, // AsmLHLOCG
0U, // AsmLHLOCGR
0U, // AsmLHLOCR
0U, // AsmLHSTOC
0U, // AsmLHSTOCG
0U, // AsmLJ
0U, // AsmLJG
0U, // AsmLLOC
0U, // AsmLLOCG
0U, // AsmLLOCGR
0U, // AsmLLOCR
0U, // AsmLOC
0U, // AsmLOCG
0U, // AsmLOCGR
0U, // AsmLOCR
0U, // AsmLSTOC
0U, // AsmLSTOCG
0U, // AsmNEBR
0U, // AsmNEJ
0U, // AsmNEJG
0U, // AsmNELOC
0U, // AsmNELOCG
0U, // AsmNELOCGR
0U, // AsmNELOCR
0U, // AsmNESTOC
0U, // AsmNESTOCG
0U, // AsmNHBR
0U, // AsmNHEBR
0U, // AsmNHEJ
0U, // AsmNHEJG
0U, // AsmNHELOC
0U, // AsmNHELOCG
0U, // AsmNHELOCGR
0U, // AsmNHELOCR
0U, // AsmNHESTOC
0U, // AsmNHESTOCG
0U, // AsmNHJ
0U, // AsmNHJG
0U, // AsmNHLOC
0U, // AsmNHLOCG
0U, // AsmNHLOCGR
0U, // AsmNHLOCR
0U, // AsmNHSTOC
0U, // AsmNHSTOCG
0U, // AsmNLBR
0U, // AsmNLEBR
0U, // AsmNLEJ
0U, // AsmNLEJG
0U, // AsmNLELOC
0U, // AsmNLELOCG
0U, // AsmNLELOCGR
0U, // AsmNLELOCR
0U, // AsmNLESTOC
0U, // AsmNLESTOCG
0U, // AsmNLHBR
0U, // AsmNLHJ
0U, // AsmNLHJG
0U, // AsmNLHLOC
0U, // AsmNLHLOCG
0U, // AsmNLHLOCGR
0U, // AsmNLHLOCR
0U, // AsmNLHSTOC
0U, // AsmNLHSTOCG
0U, // AsmNLJ
0U, // AsmNLJG
0U, // AsmNLLOC
0U, // AsmNLLOCG
0U, // AsmNLLOCGR
0U, // AsmNLLOCR
0U, // AsmNLSTOC
0U, // AsmNLSTOCG
0U, // AsmNOBR
0U, // AsmNOJ
0U, // AsmNOJG
0U, // AsmNOLOC
0U, // AsmNOLOCG
0U, // AsmNOLOCGR
0U, // AsmNOLOCR
0U, // AsmNOSTOC
0U, // AsmNOSTOCG
0U, // AsmOBR
0U, // AsmOJ
0U, // AsmOJG
0U, // AsmOLOC
0U, // AsmOLOCG
0U, // AsmOLOCGR
0U, // AsmOLOCR
0U, // AsmOSTOC
0U, // AsmOSTOCG
0U, // AsmSTOC
0U, // AsmSTOCG
0U, // BASR
0U, // BR
0U, // BRAS
0U, // BRASL
0U, // BRC
0U, // BRCL
0U, // BRCT
0U, // BRCTG
0U, // C
0U, // CDB
0U, // CDBR
0U, // CDFBR
0U, // CDGBR
0U, // CDLFBR
0U, // CDLGBR
0U, // CEB
0U, // CEBR
0U, // CEFBR
0U, // CEGBR
0U, // CELFBR
0U, // CELGBR
0U, // CFDBR
0U, // CFEBR
0U, // CFI
0U, // CFIMux
0U, // CFXBR
0U, // CG
0U, // CGDBR
0U, // CGEBR
0U, // CGF
0U, // CGFI
0U, // CGFR
0U, // CGFRL
0U, // CGH
0U, // CGHI
0U, // CGHRL
0U, // CGHSI
0U, // CGIJ
0U, // CGR
0U, // CGRJ
0U, // CGRL
0U, // CGXBR
0U, // CH
0U, // CHF
0U, // CHHSI
0U, // CHI
0U, // CHRL
0U, // CHSI
0U, // CHY
0U, // CIH
0U, // CIJ
0U, // CL
0U, // CLC
0U, // CLCLoop
0U, // CLCSequence
0U, // CLFDBR
0U, // CLFEBR
0U, // CLFHSI
0U, // CLFI
0U, // CLFIMux
0U, // CLFXBR
0U, // CLG
0U, // CLGDBR
0U, // CLGEBR
0U, // CLGF
0U, // CLGFI
0U, // CLGFR
0U, // CLGFRL
0U, // CLGHRL
0U, // CLGHSI
0U, // CLGIJ
0U, // CLGR
0U, // CLGRJ
0U, // CLGRL
0U, // CLGXBR
0U, // CLHF
0U, // CLHHSI
0U, // CLHRL
0U, // CLI
0U, // CLIH
0U, // CLIJ
0U, // CLIY
0U, // CLMux
0U, // CLR
0U, // CLRJ
0U, // CLRL
0U, // CLST
0U, // CLSTLoop
0U, // CLY
0U, // CMux
0U, // CPSDRdd
0U, // CPSDRds
0U, // CPSDRsd
0U, // CPSDRss
0U, // CR
0U, // CRJ
0U, // CRL
0U, // CS
0U, // CSG
0U, // CSY
0U, // CXBR
0U, // CXFBR
0U, // CXGBR
0U, // CXLFBR
0U, // CXLGBR
0U, // CY
0U, // CallBASR
0U, // CallBR
0U, // CallBRASL
0U, // CallJG
0U, // CondStore16
0U, // CondStore16Inv
0U, // CondStore16Mux
0U, // CondStore16MuxInv
0U, // CondStore32
0U, // CondStore32Inv
0U, // CondStore64
0U, // CondStore64Inv
0U, // CondStore8
0U, // CondStore8Inv
0U, // CondStore8Mux
0U, // CondStore8MuxInv
0U, // CondStoreF32
0U, // CondStoreF32Inv
0U, // CondStoreF64
0U, // CondStoreF64Inv
0U, // DDB
0U, // DDBR
0U, // DEB
0U, // DEBR
0U, // DL
0U, // DLG
0U, // DLGR
0U, // DLR
0U, // DSG
0U, // DSGF
0U, // DSGFR
0U, // DSGR
0U, // DXBR
0U, // EAR
0U, // ETND
0U, // FIDBR
0U, // FIDBRA
0U, // FIEBR
0U, // FIEBRA
0U, // FIXBR
0U, // FIXBRA
0U, // FLOGR
0U, // GOT
0U, // IC
0U, // IC32
0U, // IC32Y
0U, // ICY
0U, // IIFMux
0U, // IIHF
0U, // IIHF64
0U, // IIHH
0U, // IIHH64
0U, // IIHL
0U, // IIHL64
0U, // IIHMux
0U, // IILF
0U, // IILF64
0U, // IILH
0U, // IILH64
0U, // IILL
0U, // IILL64
0U, // IILMux
0U, // IPM
0U, // J
0U, // JG
0U, // L
0U, // L128
0U, // LA
0U, // LAA
0U, // LAAG
0U, // LAAL
0U, // LAALG
0U, // LAN
0U, // LANG
0U, // LAO
0U, // LAOG
0U, // LARL
0U, // LAX
0U, // LAXG
0U, // LAY
0U, // LB
0U, // LBH
0U, // LBMux
0U, // LBR
0U, // LCBB
0U, // LCDBR
0U, // LCDFR
0U, // LCDFR_32
0U, // LCEBR
0U, // LCGFR
0U, // LCGR
0U, // LCR
0U, // LCXBR
0U, // LD
0U, // LDE32
0U, // LDEB
0U, // LDEBR
0U, // LDGR
0U, // LDR
0U, // LDXBR
0U, // LDXBRA
0U, // LDY
0U, // LE
0U, // LEDBR
0U, // LEDBRA
0U, // LEFR
0U, // LER
0U, // LEXBR
0U, // LEXBRA
0U, // LEY
0U, // LFER
0U, // LFH
0U, // LG
0U, // LGB
0U, // LGBR
0U, // LGDR
0U, // LGF
0U, // LGFI
0U, // LGFR
0U, // LGFRL
0U, // LGH
0U, // LGHI
0U, // LGHR
0U, // LGHRL
0U, // LGR
0U, // LGRL
0U, // LH
0U, // LHH
0U, // LHI
0U, // LHIMux
0U, // LHMux
0U, // LHR
0U, // LHRL
0U, // LHY
0U, // LLC
0U, // LLCH
0U, // LLCMux
0U, // LLCR
0U, // LLCRMux
0U, // LLGC
0U, // LLGCR
0U, // LLGF
0U, // LLGFR
0U, // LLGFRL
0U, // LLGH
0U, // LLGHR
0U, // LLGHRL
0U, // LLH
0U, // LLHH
0U, // LLHMux
0U, // LLHR
0U, // LLHRL
0U, // LLHRMux
0U, // LLIHF
0U, // LLIHH
0U, // LLIHL
0U, // LLILF
0U, // LLILH
0U, // LLILL
0U, // LMG
0U, // LMux
0U, // LNDBR
0U, // LNDFR
0U, // LNDFR_32
0U, // LNEBR
0U, // LNGFR
0U, // LNGR
0U, // LNR
0U, // LNXBR
0U, // LOC
0U, // LOCG
0U, // LOCGR
0U, // LOCR
0U, // LPDBR
0U, // LPDFR
0U, // LPDFR_32
0U, // LPEBR
0U, // LPGFR
0U, // LPGR
0U, // LPR
0U, // LPXBR
0U, // LR
0U, // LRL
0U, // LRMux
0U, // LRV
0U, // LRVG
0U, // LRVGR
0U, // LRVR
0U, // LT
0U, // LTDBR
0U, // LTDBRCompare
0U, // LTDBRCompare_VecPseudo
0U, // LTEBR
0U, // LTEBRCompare
0U, // LTEBRCompare_VecPseudo
0U, // LTG
0U, // LTGF
0U, // LTGFR
0U, // LTGR
0U, // LTR
0U, // LTXBR
0U, // LTXBRCompare
0U, // LTXBRCompare_VecPseudo
0U, // LX
0U, // LXDB
0U, // LXDBR
0U, // LXEB
0U, // LXEBR
0U, // LXR
0U, // LY
0U, // LZDR
0U, // LZER
0U, // LZXR
1U, // MADB
1U, // MADBR
1U, // MAEB
1U, // MAEBR
0U, // MDB
0U, // MDBR
0U, // MDEB
0U, // MDEBR
0U, // MEEB
0U, // MEEBR
0U, // MGHI
0U, // MH
0U, // MHI
0U, // MHY
0U, // MLG
0U, // MLGR
0U, // MS
1U, // MSDB
1U, // MSDBR
1U, // MSEB
1U, // MSEBR
0U, // MSFI
0U, // MSG
0U, // MSGF
0U, // MSGFI
0U, // MSGFR
0U, // MSGR
0U, // MSR
0U, // MSY
0U, // MVC
0U, // MVCLoop
0U, // MVCSequence
0U, // MVGHI
0U, // MVHHI
0U, // MVHI
0U, // MVI
0U, // MVIY
0U, // MVST
0U, // MVSTLoop
0U, // MXBR
0U, // MXDB
0U, // MXDBR
0U, // N
0U, // NC
0U, // NCLoop
0U, // NCSequence
0U, // NG
0U, // NGR
0U, // NGRK
0U, // NI
0U, // NIFMux
0U, // NIHF
0U, // NIHF64
0U, // NIHH
0U, // NIHH64
0U, // NIHL
0U, // NIHL64
0U, // NIHMux
0U, // NILF
0U, // NILF64
0U, // NILH
0U, // NILH64
0U, // NILL
0U, // NILL64
0U, // NILMux
0U, // NIY
0U, // NR
0U, // NRK
0U, // NTSTG
0U, // NY
0U, // O
0U, // OC
0U, // OCLoop
0U, // OCSequence
0U, // OG
0U, // OGR
0U, // OGRK
0U, // OI
0U, // OIFMux
0U, // OIHF
0U, // OIHF64
0U, // OIHH
0U, // OIHH64
0U, // OIHL
0U, // OIHL64
0U, // OIHMux
0U, // OILF
0U, // OILF64
0U, // OILH
0U, // OILH64
0U, // OILL
0U, // OILL64
0U, // OILMux
0U, // OIY
0U, // OR
0U, // ORK
0U, // OY
0U, // PFD
0U, // PFDRL
0U, // POPCNT
0U, // PPA
1U, // RISBG
1U, // RISBG32
1U, // RISBGN
1U, // RISBHG
0U, // RISBHH
0U, // RISBHL
1U, // RISBLG
0U, // RISBLH
0U, // RISBLL
0U, // RISBMux
0U, // RLL
0U, // RLLG
1U, // RNSBG
1U, // ROSBG
1U, // RXSBG
0U, // Return
0U, // S
0U, // SDB
0U, // SDBR
0U, // SEB
0U, // SEBR
0U, // SG
0U, // SGF
0U, // SGFR
0U, // SGR
0U, // SGRK
0U, // SH
0U, // SHY
0U, // SL
0U, // SLB
0U, // SLBG
0U, // SLBR
0U, // SLFI
0U, // SLG
0U, // SLGBR
0U, // SLGF
0U, // SLGFI
0U, // SLGFR
0U, // SLGR
0U, // SLGRK
0U, // SLL
0U, // SLLG
0U, // SLLK
0U, // SLR
0U, // SLRK
0U, // SLY
0U, // SQDB
0U, // SQDBR
0U, // SQEB
0U, // SQEBR
0U, // SQXBR
0U, // SR
0U, // SRA
0U, // SRAG
0U, // SRAK
0U, // SRK
0U, // SRL
0U, // SRLG
0U, // SRLK
0U, // SRST
0U, // SRSTLoop
0U, // ST
0U, // ST128
0U, // STC
0U, // STCH
0U, // STCK
0U, // STCKE
0U, // STCKF
0U, // STCMux
0U, // STCY
0U, // STD
0U, // STDY
0U, // STE
0U, // STEY
0U, // STFH
0U, // STFLE
0U, // STG
0U, // STGRL
0U, // STH
0U, // STHH
0U, // STHMux
0U, // STHRL
0U, // STHY
0U, // STMG
0U, // STMux
0U, // STOC
0U, // STOCG
0U, // STRL
0U, // STRV
0U, // STRVG
0U, // STX
0U, // STY
0U, // SXBR
0U, // SY
0U, // Select32
0U, // Select32Mux
0U, // Select64
0U, // SelectF128
0U, // SelectF32
0U, // SelectF64
0U, // Serialize
0U, // TABORT
0U, // TBEGIN
0U, // TBEGINC
0U, // TBEGIN_nofloat
0U, // TEND
0U, // TLS_GDCALL
0U, // TLS_LDCALL
0U, // TM
0U, // TMHH
0U, // TMHH64
0U, // TMHL
0U, // TMHL64
0U, // TMHMux
0U, // TMLH
0U, // TMLH64
0U, // TMLL
0U, // TMLL64
0U, // TMLMux
0U, // TMY
0U, // VAB
0U, // VACCB
12U, // VACCCQ
0U, // VACCF
0U, // VACCG
0U, // VACCH
0U, // VACCQ
12U, // VACQ
0U, // VAF
0U, // VAG
0U, // VAH
0U, // VAQ
0U, // VAVGB
0U, // VAVGF
0U, // VAVGG
0U, // VAVGH
0U, // VAVGLB
0U, // VAVGLF
0U, // VAVGLG
0U, // VAVGLH
20U, // VCDGB
20U, // VCDLGB
0U, // VCEQB
0U, // VCEQBS
0U, // VCEQF
0U, // VCEQFS
0U, // VCEQG
0U, // VCEQGS
0U, // VCEQH
0U, // VCEQHS
20U, // VCGDB
0U, // VCHB
0U, // VCHBS
0U, // VCHF
0U, // VCHFS
0U, // VCHG
0U, // VCHGS
0U, // VCHH
0U, // VCHHS
0U, // VCHLB
0U, // VCHLBS
0U, // VCHLF
0U, // VCHLFS
0U, // VCHLG
0U, // VCHLGS
0U, // VCHLH
0U, // VCHLHS
0U, // VCKSM
20U, // VCLGDB
0U, // VCLZB
0U, // VCLZF
0U, // VCLZG
0U, // VCLZH
0U, // VCTZB
0U, // VCTZF
0U, // VCTZG
0U, // VCTZH
0U, // VECB
0U, // VECF
0U, // VECG
0U, // VECH
0U, // VECLB
0U, // VECLF
0U, // VECLG
0U, // VECLH
29U, // VERIMB
29U, // VERIMF
29U, // VERIMG
29U, // VERIMH
0U, // VERLLB
0U, // VERLLF
0U, // VERLLG
0U, // VERLLH
0U, // VERLLVB
0U, // VERLLVF
0U, // VERLLVG
0U, // VERLLVH
0U, // VESLB
0U, // VESLF
0U, // VESLG
0U, // VESLH
0U, // VESLVB
0U, // VESLVF
0U, // VESLVG
0U, // VESLVH
0U, // VESRAB
0U, // VESRAF
0U, // VESRAG
0U, // VESRAH
0U, // VESRAVB
0U, // VESRAVF
0U, // VESRAVG
0U, // VESRAVH
0U, // VESRLB
0U, // VESRLF
0U, // VESRLG
0U, // VESRLH
0U, // VESRLVB
0U, // VESRLVF
0U, // VESRLVG
0U, // VESRLVH
0U, // VFADB
20U, // VFAEB
20U, // VFAEBS
20U, // VFAEF
20U, // VFAEFS
20U, // VFAEH
20U, // VFAEHS
20U, // VFAEZB
20U, // VFAEZBS
20U, // VFAEZF
20U, // VFAEZFS
20U, // VFAEZH
20U, // VFAEZHS
0U, // VFCEDB
0U, // VFCEDBS
0U, // VFCHDB
0U, // VFCHDBS
0U, // VFCHEDB
0U, // VFCHEDBS
0U, // VFDDB
0U, // VFEEB
0U, // VFEEBS
0U, // VFEEF
0U, // VFEEFS
0U, // VFEEH
0U, // VFEEHS
0U, // VFEEZB
0U, // VFEEZBS
0U, // VFEEZF
0U, // VFEEZFS
0U, // VFEEZH
0U, // VFEEZHS
0U, // VFENEB
0U, // VFENEBS
0U, // VFENEF
0U, // VFENEFS
0U, // VFENEH
0U, // VFENEHS
0U, // VFENEZB
0U, // VFENEZBS
0U, // VFENEZF
0U, // VFENEZFS
0U, // VFENEZH
0U, // VFENEZHS
20U, // VFIDB
0U, // VFLCDB
0U, // VFLNDB
0U, // VFLPDB
12U, // VFMADB
0U, // VFMDB
12U, // VFMSDB
0U, // VFSDB
0U, // VFSQDB
1U, // VFTCIDB
0U, // VGBM
0U, // VGEF
0U, // VGEG
12U, // VGFMAB
12U, // VGFMAF
12U, // VGFMAG
12U, // VGFMAH
0U, // VGFMB
0U, // VGFMF
0U, // VGFMG
0U, // VGFMH
0U, // VGMB
0U, // VGMF
0U, // VGMG
0U, // VGMH
0U, // VISTRB
0U, // VISTRBS
0U, // VISTRF
0U, // VISTRFS
0U, // VISTRH
0U, // VISTRHS
0U, // VL
0U, // VL32
0U, // VL64
0U, // VLBB
0U, // VLCB
0U, // VLCF
0U, // VLCG
0U, // VLCH
0U, // VLDEB
1U, // VLEB
20U, // VLEDB
1U, // VLEF
1U, // VLEG
1U, // VLEH
0U, // VLEIB
2U, // VLEIF
2U, // VLEIG
2U, // VLEIH
0U, // VLGVB
0U, // VLGVF
0U, // VLGVG
0U, // VLGVH
0U, // VLL
0U, // VLLEZB
0U, // VLLEZF
0U, // VLLEZG
0U, // VLLEZH
0U, // VLM
0U, // VLPB
0U, // VLPF
0U, // VLPG
0U, // VLPH
0U, // VLR
0U, // VLR32
0U, // VLR64
0U, // VLREPB
0U, // VLREPF
0U, // VLREPG
0U, // VLREPH
0U, // VLVGB
0U, // VLVGF
0U, // VLVGG
0U, // VLVGH
0U, // VLVGP
0U, // VLVGP32
12U, // VMAEB
12U, // VMAEF
12U, // VMAEH
12U, // VMAHB
12U, // VMAHF
12U, // VMAHH
12U, // VMALB
12U, // VMALEB
12U, // VMALEF
12U, // VMALEH
12U, // VMALF
12U, // VMALHB
12U, // VMALHF
12U, // VMALHH
12U, // VMALHW
12U, // VMALOB
12U, // VMALOF
12U, // VMALOH
12U, // VMAOB
12U, // VMAOF
12U, // VMAOH
0U, // VMEB
0U, // VMEF
0U, // VMEH
0U, // VMHB
0U, // VMHF
0U, // VMHH
0U, // VMLB
0U, // VMLEB
0U, // VMLEF
0U, // VMLEH
0U, // VMLF
0U, // VMLHB
0U, // VMLHF
0U, // VMLHH
0U, // VMLHW
0U, // VMLOB
0U, // VMLOF
0U, // VMLOH
0U, // VMNB
0U, // VMNF
0U, // VMNG
0U, // VMNH
0U, // VMNLB
0U, // VMNLF
0U, // VMNLG
0U, // VMNLH
0U, // VMOB
0U, // VMOF
0U, // VMOH
0U, // VMRHB
0U, // VMRHF
0U, // VMRHG
0U, // VMRHH
0U, // VMRLB
0U, // VMRLF
0U, // VMRLG
0U, // VMRLH
0U, // VMXB
0U, // VMXF
0U, // VMXG
0U, // VMXH
0U, // VMXLB
0U, // VMXLF
0U, // VMXLG
0U, // VMXLH
0U, // VN
0U, // VNC
0U, // VNO
0U, // VO
0U, // VONE
20U, // VPDI
12U, // VPERM
0U, // VPKF
0U, // VPKG
0U, // VPKH
0U, // VPKLSF
0U, // VPKLSFS
0U, // VPKLSG
0U, // VPKLSGS
0U, // VPKLSH
0U, // VPKLSHS
0U, // VPKSF
0U, // VPKSFS
0U, // VPKSG
0U, // VPKSGS
0U, // VPKSH
0U, // VPKSHS
0U, // VPOPCT
2U, // VREPB
2U, // VREPF
2U, // VREPG
2U, // VREPH
0U, // VREPIB
0U, // VREPIF
0U, // VREPIG
0U, // VREPIH
0U, // VSB
12U, // VSBCBIQ
12U, // VSBIQ
0U, // VSCBIB
0U, // VSCBIF
0U, // VSCBIG
0U, // VSCBIH
0U, // VSCBIQ
0U, // VSCEF
0U, // VSCEG
0U, // VSEGB
0U, // VSEGF
0U, // VSEGH
12U, // VSEL
0U, // VSF
0U, // VSG
0U, // VSH
0U, // VSL
0U, // VSLB
36U, // VSLDB
0U, // VSQ
0U, // VSRA
0U, // VSRAB
0U, // VSRL
0U, // VSRLB
0U, // VST
0U, // VST32
0U, // VST64
0U, // VSTEB
2U, // VSTEF
2U, // VSTEG
2U, // VSTEH
0U, // VSTL
0U, // VSTM
76U, // VSTRCB
76U, // VSTRCBS
76U, // VSTRCF
76U, // VSTRCFS
76U, // VSTRCH
76U, // VSTRCHS
76U, // VSTRCZB
76U, // VSTRCZBS
76U, // VSTRCZF
76U, // VSTRCZFS
76U, // VSTRCZH
76U, // VSTRCZHS
0U, // VSUMB
0U, // VSUMGF
0U, // VSUMGH
0U, // VSUMH
0U, // VSUMQF
0U, // VSUMQG
0U, // VTM
0U, // VUPHB
0U, // VUPHF
0U, // VUPHH
0U, // VUPLB
0U, // VUPLF
0U, // VUPLHB
0U, // VUPLHF
0U, // VUPLHH
0U, // VUPLHW
0U, // VUPLLB
0U, // VUPLLF
0U, // VUPLLH
0U, // VX
0U, // VZERO
20U, // WCDGB
20U, // WCDLGB
20U, // WCGDB
20U, // WCLGDB
0U, // WFADB
0U, // WFCDB
0U, // WFCEDB
0U, // WFCEDBS
0U, // WFCHDB
0U, // WFCHDBS
0U, // WFCHEDB
0U, // WFCHEDBS
0U, // WFDDB
20U, // WFIDB
0U, // WFKDB
0U, // WFLCDB
0U, // WFLNDB
0U, // WFLPDB
12U, // WFMADB
0U, // WFMDB
12U, // WFMSDB
0U, // WFSDB
0U, // WFSQDB
1U, // WFTCIDB
0U, // WLDEB
20U, // WLEDB
0U, // X
0U, // XC
0U, // XCLoop
0U, // XCSequence
0U, // XG
0U, // XGR
0U, // XGRK
0U, // XI
0U, // XIFMux
0U, // XIHF
0U, // XIHF64
0U, // XILF
0U, // XILF64
0U, // XIY
0U, // XR
0U, // XRK
0U, // XY
0U, // ZEXT128_32
0U, // ZEXT128_64
};
O << "\t";
// Emit the opcode for the instruction.
uint64_t Bits = 0;
Bits |= (uint64_t)OpInfo0[MI->getOpcode()] << 0;
Bits |= (uint64_t)OpInfo1[MI->getOpcode()] << 32;
assert(Bits != 0 && "Cannot print this instruction.");
O << AsmStrs+(Bits & 8191)-1;
// Fragment 0 encoded into 4 bits for 11 unique commands.
switch ((Bits >> 13) & 15) {
default: llvm_unreachable("Invalid command number.");
case 0:
// DBG_VALUE, BUNDLE, LIFETIME_START, LIFETIME_END, TEND
return;
break;
case 1:
// A, ADB, ADBR, AEB, AEBR, AFI, AG, AGF, AGFI, AGFR, AGHI, AGHIK, AGR, A...
printOperand(MI, 0, O);
break;
case 2:
// AGSI, ASI, CGHSI, CHHSI, CHSI, CLFHSI, CLGHSI, CLHHSI, CLI, CLIY, MVGH...
printBDAddrOperand(MI, 0, O);
break;
case 3:
// AsmBCR, AsmBRC, AsmBRCL, PFD, PFDRL
printU4ImmOperand(MI, 0, O);
O << ", ";
break;
case 4:
// AsmEJ, AsmEJG, AsmHEJ, AsmHEJG, AsmHJ, AsmHJG, AsmLEJ, AsmLEJG, AsmLHJ...
printPCRelOperand(MI, 0, O);
return;
break;
case 5:
// BRC, BRCL
printCond4Operand(MI, 1, O);
O << "\t";
printPCRelOperand(MI, 2, O);
return;
break;
case 6:
// CGIJ, CGRJ, CIJ, CLGIJ, CLGRJ, CLIJ, CLRJ, CRJ
printCond4Operand(MI, 2, O);
O << "\t";
printOperand(MI, 0, O);
O << ", ";
break;
case 7:
// CLC, MVC, NC, OC, XC
printBDLAddrOperand(MI, 0, O);
O << ", ";
printBDAddrOperand(MI, 3, O);
return;
break;
case 8:
// LOC, LOCG
printCond4Operand(MI, 5, O);
O << "\t";
printOperand(MI, 0, O);
O << ", ";
printBDAddrOperand(MI, 2, O);
return;
break;
case 9:
// LOCGR, LOCR
printCond4Operand(MI, 3, O);
O << "\t";
printOperand(MI, 0, O);
O << ", ";
printOperand(MI, 1, O);
return;
break;
case 10:
// STOC, STOCG
printCond4Operand(MI, 4, O);
O << "\t";
printOperand(MI, 0, O);
O << ", ";
printBDAddrOperand(MI, 1, O);
return;
break;
}
// Fragment 1 encoded into 3 bits for 7 unique commands.
switch ((Bits >> 17) & 7) {
default: llvm_unreachable("Invalid command number.");
case 0:
// A, ADB, ADBR, AEB, AEBR, AFI, AG, AGF, AGFI, AGFR, AGHI, AGHIK, AGR, A...
O << ", ";
break;
case 1:
// AsmBCR, CGRJ, CLGRJ, CLRJ, CRJ
printOperand(MI, 1, O);
break;
case 2:
// AsmBRC, AsmBRCL, PFDRL
printPCRelOperand(MI, 1, O);
return;
break;
case 3:
// AsmEBR, AsmHBR, AsmHEBR, AsmLBR, AsmLEBR, AsmLHBR, AsmNEBR, AsmNHBR, A...
return;
break;
case 4:
// CGIJ, CIJ
printS8ImmOperand(MI, 1, O);
O << ", ";
printPCRelOperand(MI, 3, O);
return;
break;
case 5:
// CLGIJ, CLIJ
printU8ImmOperand(MI, 1, O);
O << ", ";
printPCRelOperand(MI, 3, O);
return;
break;
case 6:
// PFD
printBDXAddrOperand(MI, 1, O);
return;
break;
}
// Fragment 2 encoded into 5 bits for 27 unique commands.
switch ((Bits >> 20) & 31) {
default: llvm_unreachable("Invalid command number.");
case 0:
// A, ADB, AEB, AG, AGF, AH, AHY, AL, ALC, ALCG, ALG, ALGF, ALY, AY, DDB,...
printBDXAddrOperand(MI, 2, O);
break;
case 1:
// ADBR, AEBR, AGFR, AGR, ALCGR, ALCR, ALGFR, ALGR, ALR, AR, AXBR, AsmELO...
printOperand(MI, 2, O);
break;
case 2:
// AFI, AGFI, AIH, MSFI, MSGFI
printS32ImmOperand(MI, 2, O);
return;
break;
case 3:
// AGHI, AHI, CGHSI, CHHSI, CHSI, MGHI, MHI, MVGHI, MVHHI, MVHI, VLEIB, V...
printS16ImmOperand(MI, 2, O);
break;
case 4:
// AGHIK, AGRK, AHIK, ALGHSIK, ALGRK, ALHSIK, ALRK, ARK, AsmCGRJ, AsmCLGR...
printOperand(MI, 1, O);
break;
case 5:
// AGSI, ASI
printS8ImmOperand(MI, 2, O);
return;
break;
case 6:
// ALFI, ALGFI, NIHF, NILF, OIHF, OILF, SLFI, SLGFI, XIHF, XILF
printU32ImmOperand(MI, 2, O);
return;
break;
case 7:
// AsmBCR
return;
break;
case 8:
// AsmCGIJ, AsmCIJ, AsmJEAltCGI, AsmJEAltCI, AsmJECGI, AsmJECI, AsmJHAltC...
printS8ImmOperand(MI, 1, O);
O << ", ";
break;
case 9:
// AsmCLGIJ, AsmCLIJ, AsmJEAltCLGI, AsmJEAltCLI, AsmJECLGI, AsmJECLI, Asm...
printU8ImmOperand(MI, 1, O);
O << ", ";
break;
case 10:
// AsmELOC, AsmELOCG, AsmHELOC, AsmHELOCG, AsmHLOC, AsmHLOCG, AsmLELOC, A...
printBDAddrOperand(MI, 2, O);
break;
case 11:
// AsmESTOC, AsmESTOCG, AsmHESTOC, AsmHESTOCG, AsmHSTOC, AsmHSTOCG, AsmLE...
printBDAddrOperand(MI, 1, O);
break;
case 12:
// BRAS, BRASL
printPCRelTLSOperand(MI, 1, O);
return;
break;
case 13:
// BRCT, BRCTG
printPCRelOperand(MI, 2, O);
return;
break;
case 14:
// C, CDB, CEB, CG, CGF, CGH, CH, CHF, CHY, CL, CLG, CLGF, CLHF, CLY, CY,...
printBDXAddrOperand(MI, 1, O);
break;
case 15:
// CDLFBR, CDLGBR, CELFBR, CELGBR, CFDBR, CFEBR, CFXBR, CGDBR, CGEBR, CGX...
printU4ImmOperand(MI, 1, O);
O << ", ";
printOperand(MI, 2, O);
break;
case 16:
// CFI, CGFI, CIH, LGFI
printS32ImmOperand(MI, 1, O);
return;
break;
case 17:
// CGFRL, CGHRL, CGRL, CHRL, CLGFRL, CLGHRL, CLGRL, CLHRL, CLRL, CRL, LAR...
printPCRelOperand(MI, 1, O);
return;
break;
case 18:
// CGHI, CHI, LGHI, LHI, VREPIB, VREPIF, VREPIG, VREPIH
printS16ImmOperand(MI, 1, O);
return;
break;
case 19:
// CGRJ, CLGRJ, CLRJ, CRJ
O << ", ";
printPCRelOperand(MI, 3, O);
return;
break;
case 20:
// CLFHSI, CLGHSI, CLHHSI, IIHH, IIHL, IILH, IILL, NIHH, NIHL, NILH, NILL...
printU16ImmOperand(MI, 2, O);
return;
break;
case 21:
// CLFI, CLGFI, CLIH, IIHF, IILF, LLIHF, LLILF
printU32ImmOperand(MI, 1, O);
return;
break;
case 22:
// CLI, CLIY, MVI, MVIY, NI, NIY, OI, OIY, TM, TMY, XI, XIY
printU8ImmOperand(MI, 2, O);
return;
break;
case 23:
// EAR
printAccessRegOperand(MI, 1, O);
return;
break;
case 24:
// LLIHH, LLIHL, LLILH, LLILL, TMHH, TMHL, TMLH, TMLL, VGBM
printU16ImmOperand(MI, 1, O);
return;
break;
case 25:
// VGEF, VGEG
printBDVAddrOperand(MI, 2, O);
O << ", ";
break;
case 26:
// VSCEF, VSCEG
printBDVAddrOperand(MI, 1, O);
O << ", ";
break;
}
// Fragment 3 encoded into 4 bits for 9 unique commands.
switch ((Bits >> 25) & 15) {
default: llvm_unreachable("Invalid command number.");
case 0:
// A, ADB, ADBR, AEB, AEBR, AG, AGF, AGFR, AGHI, AGR, AH, AHI, AHY, AL, A...
return;
break;
case 1:
// AGHIK, AGRK, AHIK, ALGHSIK, ALGRK, ALHSIK, ALRK, ARK, AsmCGRJ, AsmCLGR...
O << ", ";
break;
case 2:
// AsmCGIJ, AsmCIJ, AsmCLGIJ, AsmCLIJ
printU4ImmOperand(MI, 2, O);
O << ", ";
printPCRelOperand(MI, 3, O);
return;
break;
case 3:
// AsmJEAltCGI, AsmJEAltCI, AsmJEAltCLGI, AsmJEAltCLI, AsmJECGI, AsmJECI,...
printPCRelOperand(MI, 2, O);
return;
break;
case 4:
// VGEF
printU2ImmOperand(MI, 5, O);
return;
break;
case 5:
// VGEG
printU1ImmOperand(MI, 5, O);
return;
break;
case 6:
// VGMB, VGMF, VGMG, VGMH
printU8ImmOperand(MI, 2, O);
return;
break;
case 7:
// VSCEF
printU2ImmOperand(MI, 4, O);
return;
break;
case 8:
// VSCEG
printU1ImmOperand(MI, 4, O);
return;
break;
}
// Fragment 4 encoded into 5 bits for 23 unique commands.
switch ((Bits >> 29) & 31) {
default: llvm_unreachable("Invalid command number.");
case 0:
// AGHIK, AHIK, ALGHSIK, ALHSIK
printS16ImmOperand(MI, 2, O);
return;
break;
case 1:
// AGRK, ALGRK, ALRK, ARK, CPSDRdd, CPSDRds, CPSDRsd, CPSDRss, NGRK, NRK,...
printOperand(MI, 2, O);
break;
case 2:
// AsmCGRJ, AsmCLGRJ, AsmCLRJ, AsmCRJ, PPA, VCDGB, VCDLGB, VCGDB, VCLGDB,...
printU4ImmOperand(MI, 2, O);
break;
case 3:
// AsmJEAltCGR, AsmJEAltCLGR, AsmJEAltCLR, AsmJEAltCR, AsmJECGR, AsmJECLG...
printPCRelOperand(MI, 2, O);
return;
break;
case 4:
// AsmLOC, AsmLOCG, LCBB, VLBB, VSTEB
printU4ImmOperand(MI, 4, O);
return;
break;
case 5:
// AsmLOCGR, AsmLOCR, AsmSTOC, AsmSTOCG, CDLFBR, CDLGBR, CELFBR, CELGBR, ...
printU4ImmOperand(MI, 3, O);
return;
break;
case 6:
// CS, CSG, CSY, VLVGB, VLVGF, VLVGG, VLVGH
printBDAddrOperand(MI, 3, O);
return;
break;
case 7:
// LAA, LAAG, LAAL, LAALG, LAN, LANG, LAO, LAOG, LAX, LAXG, LMG, RLL, RLL...
printBDAddrOperand(MI, 2, O);
return;
break;
case 8:
// MADB, MAEB, MSDB, MSEB
printBDXAddrOperand(MI, 3, O);
return;
break;
case 9:
// MADBR, MAEBR, MSDBR, MSEBR, VERIMB, VERIMF, VERIMG, VERIMH
printOperand(MI, 3, O);
break;
case 10:
// RISBG, RISBG32, RISBGN, RISBHG, RISBLG, RNSBG, ROSBG, RXSBG
printU8ImmOperand(MI, 3, O);
O << ", ";
printU8ImmOperand(MI, 4, O);
O << ", ";
printU6ImmOperand(MI, 5, O);
return;
break;
case 11:
// VFTCIDB, WFTCIDB
printU12ImmOperand(MI, 2, O);
return;
break;
case 12:
// VLEB
printU4ImmOperand(MI, 5, O);
return;
break;
case 13:
// VLEF
printU2ImmOperand(MI, 5, O);
return;
break;
case 14:
// VLEG
printU1ImmOperand(MI, 5, O);
return;
break;
case 15:
// VLEH
printU3ImmOperand(MI, 5, O);
return;
break;
case 16:
// VLEIF
printU2ImmOperand(MI, 3, O);
return;
break;
case 17:
// VLEIG
printU1ImmOperand(MI, 3, O);
return;
break;
case 18:
// VLEIH
printU3ImmOperand(MI, 3, O);
return;
break;
case 19:
// VREPB, VREPF, VREPG, VREPH
printU16ImmOperand(MI, 2, O);
return;
break;
case 20:
// VSTEF
printU2ImmOperand(MI, 4, O);
return;
break;
case 21:
// VSTEG
printU1ImmOperand(MI, 4, O);
return;
break;
case 22:
// VSTEH
printU3ImmOperand(MI, 4, O);
return;
break;
}
// Fragment 5 encoded into 1 bits for 2 unique commands.
if ((Bits >> 34) & 1) {
// AsmCGRJ, AsmCLGRJ, AsmCLRJ, AsmCRJ, VACCCQ, VACQ, VCDGB, VCDLGB, VCGDB...
O << ", ";
} else {
// AGRK, ALGRK, ALRK, ARK, CPSDRdd, CPSDRds, CPSDRsd, CPSDRss, MADBR, MAE...
return;
}
// Fragment 6 encoded into 3 bits for 5 unique commands.
switch ((Bits >> 35) & 7) {
default: llvm_unreachable("Invalid command number.");
case 0:
// AsmCGRJ, AsmCLGRJ, AsmCLRJ, AsmCRJ
printPCRelOperand(MI, 3, O);
return;
break;
case 1:
// VACCCQ, VACQ, VFMADB, VFMSDB, VGFMAB, VGFMAF, VGFMAG, VGFMAH, VMAEB, V...
printOperand(MI, 3, O);
break;
case 2:
// VCDGB, VCDLGB, VCGDB, VCLGDB, VFAEB, VFAEBS, VFAEF, VFAEFS, VFAEH, VFA...
printU4ImmOperand(MI, 3, O);
return;
break;
case 3:
// VERIMB, VERIMF, VERIMG, VERIMH
printU8ImmOperand(MI, 4, O);
return;
break;
case 4:
// VSLDB
printU8ImmOperand(MI, 3, O);
return;
break;
}
// Fragment 7 encoded into 1 bits for 2 unique commands.
if ((Bits >> 38) & 1) {
// VSTRCB, VSTRCBS, VSTRCF, VSTRCFS, VSTRCH, VSTRCHS, VSTRCZB, VSTRCZBS, ...
O << ", ";
printU4ImmOperand(MI, 4, O);
return;
} else {
// VACCCQ, VACQ, VFMADB, VFMSDB, VGFMAB, VGFMAF, VGFMAG, VGFMAH, VMAEB, V...
return;
}
}
/// getRegisterName - This method is automatically generated by tblgen
/// from the register set description. This returns the assembler name
/// for the specified register.
const char *SystemZInstPrinter::getRegisterName(unsigned RegNo) {
assert(RegNo && RegNo < 162 && "Invalid register number!");
static const char AsmStrs[] = {
/* 0 */ 'f', '1', '0', 0,
/* 4 */ 'r', '1', '0', 0,
/* 8 */ 'v', '1', '0', 0,
/* 12 */ 'v', '2', '0', 0,
/* 16 */ 'v', '3', '0', 0,
/* 20 */ 'f', '0', 0,
/* 23 */ 'r', '0', 0,
/* 26 */ 'v', '0', 0,
/* 29 */ 'f', '1', '1', 0,
/* 33 */ 'r', '1', '1', 0,
/* 37 */ 'v', '1', '1', 0,
/* 41 */ 'v', '2', '1', 0,
/* 45 */ 'v', '3', '1', 0,
/* 49 */ 'f', '1', 0,
/* 52 */ 'r', '1', 0,
/* 55 */ 'v', '1', 0,
/* 58 */ 'f', '1', '2', 0,
/* 62 */ 'r', '1', '2', 0,
/* 66 */ 'v', '1', '2', 0,
/* 70 */ 'v', '2', '2', 0,
/* 74 */ 'f', '2', 0,
/* 77 */ 'r', '2', 0,
/* 80 */ 'v', '2', 0,
/* 83 */ 'f', '1', '3', 0,
/* 87 */ 'r', '1', '3', 0,
/* 91 */ 'v', '1', '3', 0,
/* 95 */ 'v', '2', '3', 0,
/* 99 */ 'f', '3', 0,
/* 102 */ 'r', '3', 0,
/* 105 */ 'v', '3', 0,
/* 108 */ 'f', '1', '4', 0,
/* 112 */ 'r', '1', '4', 0,
/* 116 */ 'v', '1', '4', 0,
/* 120 */ 'v', '2', '4', 0,
/* 124 */ 'f', '4', 0,
/* 127 */ 'r', '4', 0,
/* 130 */ 'v', '4', 0,
/* 133 */ 'f', '1', '5', 0,
/* 137 */ 'r', '1', '5', 0,
/* 141 */ 'v', '1', '5', 0,
/* 145 */ 'v', '2', '5', 0,
/* 149 */ 'f', '5', 0,
/* 152 */ 'r', '5', 0,
/* 155 */ 'v', '5', 0,
/* 158 */ 'v', '1', '6', 0,
/* 162 */ 'v', '2', '6', 0,
/* 166 */ 'f', '6', 0,
/* 169 */ 'r', '6', 0,
/* 172 */ 'v', '6', 0,
/* 175 */ 'v', '1', '7', 0,
/* 179 */ 'v', '2', '7', 0,
/* 183 */ 'f', '7', 0,
/* 186 */ 'r', '7', 0,
/* 189 */ 'v', '7', 0,
/* 192 */ 'v', '1', '8', 0,
/* 196 */ 'v', '2', '8', 0,
/* 200 */ 'f', '8', 0,
/* 203 */ 'r', '8', 0,
/* 206 */ 'v', '8', 0,
/* 209 */ 'v', '1', '9', 0,
/* 213 */ 'v', '2', '9', 0,
/* 217 */ 'f', '9', 0,
/* 220 */ 'r', '9', 0,
/* 223 */ 'v', '9', 0,
/* 226 */ 'c', 'c', 0,
};
static const uint8_t RegAsmOffset[] = {
226, 26, 55, 80, 105, 130, 155, 172, 189, 206, 223, 8, 37, 66,
91, 116, 141, 158, 175, 192, 209, 12, 41, 70, 95, 120, 145, 162,
179, 196, 213, 16, 45, 20, 49, 74, 99, 124, 149, 166, 183, 200,
217, 0, 29, 58, 83, 108, 133, 158, 175, 192, 209, 12, 41, 70,
95, 120, 145, 162, 179, 196, 213, 16, 45, 20, 49, 124, 149, 200,
217, 58, 83, 20, 49, 74, 99, 124, 149, 166, 183, 200, 217, 0,
29, 58, 83, 108, 133, 158, 175, 192, 209, 12, 41, 70, 95, 120,
145, 162, 179, 196, 213, 16, 45, 23, 52, 77, 102, 127, 152, 169,
186, 203, 220, 4, 33, 62, 87, 112, 137, 23, 52, 77, 102, 127,
152, 169, 186, 203, 220, 4, 33, 62, 87, 112, 137, 23, 52, 77,
102, 127, 152, 169, 186, 203, 220, 4, 33, 62, 87, 112, 137, 23,
77, 127, 169, 203, 4, 62, 112,
};
assert (*(AsmStrs+RegAsmOffset[RegNo-1]) &&
"Invalid alt name index for register!");
return AsmStrs+RegAsmOffset[RegNo-1];
}
#ifdef PRINT_ALIAS_INSTR
#undef PRINT_ALIAS_INSTR
bool SystemZInstPrinter::printAliasInstr(const MCInst *MI, raw_ostream &OS) {
const char *AsmString;
switch (MI->getOpcode()) {
default: return false;
case SystemZ::VFAEB:
if (MI->getNumOperands() == 4 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isImm() &&
MI->getOperand(3).getImm() == 0) {
// (VFAEB VR128:$V1, VR128:$V2, VR128:$V3, 0)
AsmString = "vfaeb $\x01, $\x02, $\x03";
break;
}
return false;
case SystemZ::VFAEBS:
if (MI->getNumOperands() == 4 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isImm() &&
MI->getOperand(3).getImm() == 0) {
// (VFAEBS VR128:$V1, VR128:$V2, VR128:$V3, 0)
AsmString = "vfaebs $\x01, $\x02, $\x03";
break;
}
return false;
case SystemZ::VFAEF:
if (MI->getNumOperands() == 4 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isImm() &&
MI->getOperand(3).getImm() == 0) {
// (VFAEF VR128:$V1, VR128:$V2, VR128:$V3, 0)
AsmString = "vfaef $\x01, $\x02, $\x03";
break;
}
return false;
case SystemZ::VFAEFS:
if (MI->getNumOperands() == 4 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isImm() &&
MI->getOperand(3).getImm() == 0) {
// (VFAEFS VR128:$V1, VR128:$V2, VR128:$V3, 0)
AsmString = "vfaefs $\x01, $\x02, $\x03";
break;
}
return false;
case SystemZ::VFAEH:
if (MI->getNumOperands() == 4 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isImm() &&
MI->getOperand(3).getImm() == 0) {
// (VFAEH VR128:$V1, VR128:$V2, VR128:$V3, 0)
AsmString = "vfaeh $\x01, $\x02, $\x03";
break;
}
return false;
case SystemZ::VFAEHS:
if (MI->getNumOperands() == 4 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isImm() &&
MI->getOperand(3).getImm() == 0) {
// (VFAEHS VR128:$V1, VR128:$V2, VR128:$V3, 0)
AsmString = "vfaehs $\x01, $\x02, $\x03";
break;
}
return false;
case SystemZ::VFAEZB:
if (MI->getNumOperands() == 4 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isImm() &&
MI->getOperand(3).getImm() == 0) {
// (VFAEZB VR128:$V1, VR128:$V2, VR128:$V3, 0)
AsmString = "vfaezb $\x01, $\x02, $\x03";
break;
}
return false;
case SystemZ::VFAEZBS:
if (MI->getNumOperands() == 4 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isImm() &&
MI->getOperand(3).getImm() == 0) {
// (VFAEZBS VR128:$V1, VR128:$V2, VR128:$V3, 0)
AsmString = "vfaezbs $\x01, $\x02, $\x03";
break;
}
return false;
case SystemZ::VFAEZF:
if (MI->getNumOperands() == 4 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isImm() &&
MI->getOperand(3).getImm() == 0) {
// (VFAEZF VR128:$V1, VR128:$V2, VR128:$V3, 0)
AsmString = "vfaezf $\x01, $\x02, $\x03";
break;
}
return false;
case SystemZ::VFAEZFS:
if (MI->getNumOperands() == 4 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isImm() &&
MI->getOperand(3).getImm() == 0) {
// (VFAEZFS VR128:$V1, VR128:$V2, VR128:$V3, 0)
AsmString = "vfaezfs $\x01, $\x02, $\x03";
break;
}
return false;
case SystemZ::VFAEZH:
if (MI->getNumOperands() == 4 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isImm() &&
MI->getOperand(3).getImm() == 0) {
// (VFAEZH VR128:$V1, VR128:$V2, VR128:$V3, 0)
AsmString = "vfaezh $\x01, $\x02, $\x03";
break;
}
return false;
case SystemZ::VFAEZHS:
if (MI->getNumOperands() == 4 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isImm() &&
MI->getOperand(3).getImm() == 0) {
// (VFAEZHS VR128:$V1, VR128:$V2, VR128:$V3, 0)
AsmString = "vfaezhs $\x01, $\x02, $\x03";
break;
}
return false;
case SystemZ::VSTRCB:
if (MI->getNumOperands() == 5 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(3).getReg()) &&
MI->getOperand(4).isImm() &&
MI->getOperand(4).getImm() == 0) {
// (VSTRCB VR128:$V1, VR128:$V2, VR128:$V3, VR128:$V4, 0)
AsmString = "vstrcb $\x01, $\x02, $\x03, $\x04";
break;
}
return false;
case SystemZ::VSTRCBS:
if (MI->getNumOperands() == 5 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(3).getReg()) &&
MI->getOperand(4).isImm() &&
MI->getOperand(4).getImm() == 0) {
// (VSTRCBS VR128:$V1, VR128:$V2, VR128:$V3, VR128:$V4, 0)
AsmString = "vstrcbs $\x01, $\x02, $\x03, $\x04";
break;
}
return false;
case SystemZ::VSTRCF:
if (MI->getNumOperands() == 5 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(3).getReg()) &&
MI->getOperand(4).isImm() &&
MI->getOperand(4).getImm() == 0) {
// (VSTRCF VR128:$V1, VR128:$V2, VR128:$V3, VR128:$V4, 0)
AsmString = "vstrcf $\x01, $\x02, $\x03, $\x04";
break;
}
return false;
case SystemZ::VSTRCFS:
if (MI->getNumOperands() == 5 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(3).getReg()) &&
MI->getOperand(4).isImm() &&
MI->getOperand(4).getImm() == 0) {
// (VSTRCFS VR128:$V1, VR128:$V2, VR128:$V3, VR128:$V4, 0)
AsmString = "vstrcfs $\x01, $\x02, $\x03, $\x04";
break;
}
return false;
case SystemZ::VSTRCH:
if (MI->getNumOperands() == 5 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(3).getReg()) &&
MI->getOperand(4).isImm() &&
MI->getOperand(4).getImm() == 0) {
// (VSTRCH VR128:$V1, VR128:$V2, VR128:$V3, VR128:$V4, 0)
AsmString = "vstrch $\x01, $\x02, $\x03, $\x04";
break;
}
return false;
case SystemZ::VSTRCHS:
if (MI->getNumOperands() == 5 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(3).getReg()) &&
MI->getOperand(4).isImm() &&
MI->getOperand(4).getImm() == 0) {
// (VSTRCHS VR128:$V1, VR128:$V2, VR128:$V3, VR128:$V4, 0)
AsmString = "vstrchs $\x01, $\x02, $\x03, $\x04";
break;
}
return false;
case SystemZ::VSTRCZB:
if (MI->getNumOperands() == 5 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(3).getReg()) &&
MI->getOperand(4).isImm() &&
MI->getOperand(4).getImm() == 0) {
// (VSTRCZB VR128:$V1, VR128:$V2, VR128:$V3, VR128:$V4, 0)
AsmString = "vstrczb $\x01, $\x02, $\x03, $\x04";
break;
}
return false;
case SystemZ::VSTRCZBS:
if (MI->getNumOperands() == 5 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(3).getReg()) &&
MI->getOperand(4).isImm() &&
MI->getOperand(4).getImm() == 0) {
// (VSTRCZBS VR128:$V1, VR128:$V2, VR128:$V3, VR128:$V4, 0)
AsmString = "vstrczbs $\x01, $\x02, $\x03, $\x04";
break;
}
return false;
case SystemZ::VSTRCZF:
if (MI->getNumOperands() == 5 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(3).getReg()) &&
MI->getOperand(4).isImm() &&
MI->getOperand(4).getImm() == 0) {
// (VSTRCZF VR128:$V1, VR128:$V2, VR128:$V3, VR128:$V4, 0)
AsmString = "vstrczf $\x01, $\x02, $\x03, $\x04";
break;
}
return false;
case SystemZ::VSTRCZFS:
if (MI->getNumOperands() == 5 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(3).getReg()) &&
MI->getOperand(4).isImm() &&
MI->getOperand(4).getImm() == 0) {
// (VSTRCZFS VR128:$V1, VR128:$V2, VR128:$V3, VR128:$V4, 0)
AsmString = "vstrczfs $\x01, $\x02, $\x03, $\x04";
break;
}
return false;
case SystemZ::VSTRCZH:
if (MI->getNumOperands() == 5 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(3).getReg()) &&
MI->getOperand(4).isImm() &&
MI->getOperand(4).getImm() == 0) {
// (VSTRCZH VR128:$V1, VR128:$V2, VR128:$V3, VR128:$V4, 0)
AsmString = "vstrczh $\x01, $\x02, $\x03, $\x04";
break;
}
return false;
case SystemZ::VSTRCZHS:
if (MI->getNumOperands() == 5 &&
MI->getOperand(0).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(0).getReg()) &&
MI->getOperand(1).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(1).getReg()) &&
MI->getOperand(2).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(2).getReg()) &&
MI->getOperand(3).isReg() &&
MRI.getRegClass(SystemZ::VR128BitRegClassID).contains(MI->getOperand(3).getReg()) &&
MI->getOperand(4).isImm() &&
MI->getOperand(4).getImm() == 0) {
// (VSTRCZHS VR128:$V1, VR128:$V2, VR128:$V3, VR128:$V4, 0)
AsmString = "vstrczhs $\x01, $\x02, $\x03, $\x04";
break;
}
return false;
}
unsigned I = 0;
while (AsmString[I] != ' ' && AsmString[I] != ' ' &&
AsmString[I] != '\0')
++I;
OS << '\t' << StringRef(AsmString, I);
if (AsmString[I] != '\0') {
OS << '\t';
do {
if (AsmString[I] == '$') {
++I;
if (AsmString[I] == (char)0xff) {
++I;
int OpIdx = AsmString[I++] - 1;
int PrintMethodIdx = AsmString[I++] - 1;
printCustomAliasOperand(MI, OpIdx, PrintMethodIdx, OS);
} else
printOperand(MI, unsigned(AsmString[I++]) - 1, OS);
} else {
OS << AsmString[I++];
}
} while (AsmString[I] != '\0');
}
return true;
}
void SystemZInstPrinter::printCustomAliasOperand(
const MCInst *MI, unsigned OpIdx,
unsigned PrintMethodIdx,
raw_ostream &OS) {
llvm_unreachable("Unknown PrintMethod kind");
}
#endif // PRINT_ALIAS_INSTR
| [
"jy910.yun@samsung.com"
] | jy910.yun@samsung.com |
5fa23432c7779a821d9a6f264f5a272511168f4f | 32809f6f425bf5665fc19de2bc929bacc3eeb469 | /src/0462-Minimum-Moves-to-Equal-Array-Elements-II/0462.cpp | 1456b615889a8e5f295aa0a6371f732fe58061ab | [] | no_license | luliyucoordinate/Leetcode | 9f6bf01f79aa680e2dff11e73e4d10993467f113 | bcc04d49969654cb44f79218a7ef2fd5c1e5449a | refs/heads/master | 2023-05-25T04:58:45.046772 | 2023-05-24T11:57:20 | 2023-05-24T11:57:20 | 132,753,892 | 1,575 | 569 | null | 2023-05-24T11:57:22 | 2018-05-09T12:30:59 | C++ | UTF-8 | C++ | false | false | 423 | cpp | static int x = []() {std::ios::sync_with_stdio(false); cin.tie(0); return 0; }();
class Solution
{
public:
int minMoves2(vector<int>& nums)
{
int n = nums.size();
nth_element(nums.begin(), nums.begin() + n/2, nums.end());
int x = nums[n / 2], res = 0;
for_each(nums.begin(), nums.end(), [&](const int& num){
res += abs(num - x);
});
return res;
}
}; | [
"luliyucoordinate@outlook.com"
] | luliyucoordinate@outlook.com |
9d9a2c217014fc4cd159bece450f7f1cb1961870 | 7e791eccdc4d41ba225a90b3918ba48e356fdd78 | /chromium/src/content/shell/browser/shell_mojo_test_utils_android.cc | 39063bb86eecb94eb46308c70d05ff7fcafb2aba | [
"BSD-3-Clause"
] | permissive | WiViClass/cef-3.2623 | 4e22b763a75e90d10ebf9aa3ea9a48a3d9ccd885 | 17fe881e9e481ef368d9f26e903e00a6b7bdc018 | refs/heads/master | 2021-01-25T04:38:14.941623 | 2017-06-09T07:37:43 | 2017-06-09T07:37:43 | 93,824,379 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 2,921 | 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 "content/shell/browser/shell_mojo_test_utils_android.h"
#include <utility>
#include "base/memory/scoped_vector.h"
#include "base/message_loop/message_loop.h"
#include "base/run_loop.h"
#include "content/browser/mojo/service_registry_android.h"
#include "content/common/mojo/service_registry_impl.h"
#include "jni/ShellMojoTestUtils_jni.h"
namespace {
struct TestEnvironment {
base::MessageLoop message_loop;
ScopedVector<content::ServiceRegistryImpl> registries;
ScopedVector<content::ServiceRegistryAndroid> wrappers;
};
} // namespace
namespace content {
static jlong SetupTestEnvironment(JNIEnv* env,
const JavaParamRef<jclass>& jcaller) {
return reinterpret_cast<intptr_t>(new TestEnvironment());
}
static void TearDownTestEnvironment(JNIEnv* env,
const JavaParamRef<jclass>& jcaller,
jlong test_environment) {
delete reinterpret_cast<TestEnvironment*>(test_environment);
}
static ScopedJavaLocalRef<jobject> CreateServiceRegistryPair(
JNIEnv* env,
const JavaParamRef<jclass>& jcaller,
jlong native_test_environment) {
TestEnvironment* test_environment =
reinterpret_cast<TestEnvironment*>(native_test_environment);
content::ServiceRegistryImpl* registry_a = new ServiceRegistryImpl();
test_environment->registries.push_back(registry_a);
content::ServiceRegistryImpl* registry_b = new ServiceRegistryImpl();
test_environment->registries.push_back(registry_b);
mojo::ServiceProviderPtr exposed_services_a;
registry_a->Bind(GetProxy(&exposed_services_a));
registry_b->BindRemoteServiceProvider(std::move(exposed_services_a));
mojo::ServiceProviderPtr exposed_services_b;
registry_b->Bind(GetProxy(&exposed_services_b));
registry_a->BindRemoteServiceProvider(std::move(exposed_services_b));
content::ServiceRegistryAndroid* wrapper_a =
new ServiceRegistryAndroid(registry_a);
test_environment->wrappers.push_back(wrapper_a);
content::ServiceRegistryAndroid* wrapper_b =
new ServiceRegistryAndroid(registry_b);
test_environment->wrappers.push_back(wrapper_b);
return Java_ShellMojoTestUtils_makePair(env, wrapper_a->GetObj().obj(),
wrapper_b->GetObj().obj());
}
static void RunLoop(JNIEnv* env,
const JavaParamRef<jclass>& jcaller,
jlong timeout_ms) {
base::MessageLoop::current()->PostDelayedTask(
FROM_HERE, base::MessageLoop::QuitWhenIdleClosure(),
base::TimeDelta::FromMilliseconds(timeout_ms));
base::RunLoop run_loop;
run_loop.Run();
}
bool RegisterShellMojoTestUtils(JNIEnv* env) {
return RegisterNativesImpl(env);
}
} // namespace content
| [
"1480868058@qq.com"
] | 1480868058@qq.com |
3d70311fc2b69a92a3be801b1ed93974e9fe1375 | 662c05fcb9357743f307e869e0482c48d3d41db0 | /debug.cpp | 36cf3435cd7caccfd9136a690bd1ce15f69e246b | [
"LicenseRef-scancode-public-domain"
] | permissive | cmagagna/CC3000Patch | 909f1db12fc38336d75e636d224817d0935adb18 | cc267df21480800532344d940b964c743ecb1f08 | refs/heads/master | 2020-05-28T03:36:11.078577 | 2014-08-05T03:57:56 | 2014-08-05T03:57:56 | 12,963,846 | 1 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 2,496 | cpp | /**************************************************************************/
/*!
@file Adafruit_CC3000.cpp
@author KTOWN (Kevin Townsend Adafruit Industries)
@license BSD (see license.txt)
This is a library for the Adafruit CC3000 WiFi breakout board
This library works with the Adafruit CC3000 breakout
----> https://www.adafruit.com/products/1469
Check out the links above for our tutorials and wiring diagrams
These chips use SPI to communicate.
Adafruit invests time and resources providing this open source code,
please support Adafruit and open-source hardware by purchasing
products from Adafruit!
@section HISTORY
v1.0 - Initial release
*/
/**************************************************************************/
#include "debug.h"
/**************************************************************************/
/*!
@brief This function will display the number of bytes currently free
in RAM ... useful for debugging!
*/
/**************************************************************************/
int getFreeRam(void)
{
extern int __bss_end;
extern int *__brkval;
int free_memory;
if((int)__brkval == 0) {
free_memory = ((int)&free_memory) - ((int)&__bss_end);
}
else {
free_memory = ((int)&free_memory) - ((int)__brkval);
}
return free_memory;
}
void displayFreeRam(void)
{
if (CC3KPrinter == 0) {
return;
}
CC3KPrinter->print(F("Free RAM: "));
CC3KPrinter->print(getFreeRam());
CC3KPrinter->println(F(" bytes"));
}
void uart_putchar(char c) {
if (CC3KPrinter != 0) {
CC3KPrinter->write(c);
}
}
void printDec(uint8_t h) {
uart_putchar((h / 100) + '0');
h %= 100;
uart_putchar((h / 10) + '0');
h %= 10;
uart_putchar(h + '0');
}
void printHex(uint8_t h) {
uint8_t d = h >> 4;
if (d >= 10) {
uart_putchar(d - 10 + 'A');
} else {
uart_putchar(d + '0');
}
h &= 0xF;
if (h >= 10) {
uart_putchar(h - 10 + 'A');
} else {
uart_putchar(h + '0');
}
}
void printHex16(uint16_t h) {
uart_putchar('0');
uart_putchar('x');
DEBUGPRINT_HEX(h >> 8);
DEBUGPRINT_HEX(h);
}
void printDec16(uint16_t h) {
uart_putchar((h / 10000) + '0');
h %= 10000;
uart_putchar((h / 1000) + '0');
h %= 1000;
uart_putchar((h / 100) + '0');
h %= 100;
uart_putchar((h / 10) + '0');
h %= 10;
uart_putchar(h + '0');
}
void DEBUGPRINT(const prog_char *fstr)
{
char c;
if(!fstr) return;
while((c = pgm_read_byte(fstr++)))
uart_putchar(c);
}
| [
"cmagagna@yahoo.com"
] | cmagagna@yahoo.com |
eecd470c8fdfe4ca5b5cc3ca767becb76e0ca580 | f00687b9f8671496f417672aaf8ddffc2fa8060a | /codechef/SEPT17/WEASELTX.cpp | 6d25d6ff55d17068e3abeaf8ad092f3dea3af6c8 | [] | no_license | kazi-nayeem/Programming-Problems-Solutions | 29c338085f1025b2545ff66bdb0476ec4d7773c2 | 7ee29a4e06e9841388389be5566db34fbdda8f7c | refs/heads/master | 2023-02-05T15:06:50.355903 | 2020-12-30T10:19:54 | 2020-12-30T10:19:54 | 279,388,214 | 2 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 6,361 | cpp | #include <cstdio>
#include <sstream>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <list>
#include <iostream>
#include <fstream>
#include <numeric>
#include <string>
#include <vector>
#include <cstring>
#include <map>
#include <iterator>
#include<complex>
//#include <bits/stdc++.h>
using namespace std;
#define HI printf("HI\n")
#define sf scanf
#define pf printf
#define sf1(a) scanf("%d",&a)
#define sf2(a,b) scanf("%d %d",&a,&b)
#define sf3(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define sf4(a,b,c,d) scanf("%d %d %d %d",&a,&b,&c,&d)
#define sf1ll(a) scanf("%lld",&a)
#define sf2ll(a,b) scanf("%lld %lld",&a,&b)
#define sf3ll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define sf4ll(a,b,c,d) scanf("%lld %lld %lld %lld",&a,&b,&c,&d)
#define forln(i,a,n) for(int i=a ; i<n ; i++)
#define foren(i,a,n) for(int i=a ; i<=n ; i++)
#define forg0(i,a,n) for(int i=a ; i>n ; i--)
#define fore0(i,a,n) for(int i=a ; i>=n ; i--)
#define pb push_back
#define ppb pop_back
#define ppf push_front
#define popf pop_front
#define ll long long int
#define ui unsigned int
#define ull unsigned long long
#define fs first
#define sc second
#define clr( a, b ) memset((a),b,sizeof(a))
#define jora pair<int, int>
#define jora_d pair<double, double>
#define jora_ll pair<long long int, long long int>
#define mp make_pair
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define PI acos(0.0)
#define wait system("pause")
#define ps pf("PASS\n")
#define popc(a) (__builtin_popcount(a))
template<class T1> void deb(T1 e1)
{
cout<<e1<<endl;
}
template<class T1,class T2> void deb(T1 e1,T2 e2)
{
cout<<e1<<" "<<e2<<endl;
}
template<class T1,class T2,class T3> void deb(T1 e1,T2 e2,T3 e3)
{
cout<<e1<<" "<<e2<<" "<<e3<<endl;
}
template<class T1,class T2,class T3,class T4> void deb(T1 e1,T2 e2,T3 e3,T4 e4)
{
cout<<e1<<" "<<e2<<" "<<e3<<" "<<e4<<endl;
}
template<class T1,class T2,class T3,class T4,class T5> void deb(T1 e1,T2 e2,T3 e3,T4 e4,T5 e5)
{
cout<<e1<<" "<<e2<<" "<<e3<<" "<<e4<<" "<<e5<<endl;
}
template<class T1,class T2,class T3,class T4,class T5,class T6> void deb(T1 e1,T2 e2,T3 e3,T4 e4,T5 e5,T6 e6)
{
cout<<e1<<" "<<e2<<" "<<e3<<" "<<e4<<" "<<e5<<" "<<e6<<endl;
}
/// <--------------------------- For Bitmasking -------------------------------->
//int on( int n, int pos ){
// return n = n|( 1<<pos );
//}
//bool check( int n, int pos ){
// return (bool)( n&( 1<<pos ) );
//}
//int off( int n, int pos ){
// return n = n&~( 1<<pos );
//}
//int toggle( int n, int pos ){
// return n = n^(1<<pos);
//}
//int count_bit( int n ){
// return __builtin_popcount( n );
//}
/// <--------------------------- End of Bitmasking -------------------------------->
/// <--------------------------- For B - Base Number System ----------------------------------->
//int base;
//int pw[10];
//void calPow(int b){
// base = b;
// pw[0] = 1;
// for( int i = 1; i<10; i++ ){
// pw[i] = pw[i-1]*base;
// }
//}
//int getV(int mask, int pos){
// mask /= pw[pos];
// return ( mask%base );
//}
//int setV(int mask, int v, int pos){
// int rem = mask%pw[pos];
// mask /= pw[pos+1];
// mask = ( mask*base ) + v;
// mask = ( mask*pw[pos] ) + rem;
// return mask;
//}
/// <--------------------------- End B - Base Number System ----------------------------------->
// moves
//int dx[]= {0,0,1,-1};/*4 side move*/
//int dy[]= {-1,1,0,0};/*4 side move*/
//int dx[]= {1,1,0,-1,-1,-1,0,1};/*8 side move*/
//int dy[]= {0,1,1,1,0,-1,-1,-1};/*8 side move*/
//int dx[]={1,1,2,2,-1,-1,-2,-2};/*night move*/
//int dy[]={2,-2,1,-1,2,-2,1,-1};/*night move*/
//double Expo(double n, int p) {
// if (p == 0)return 1;
// double x = Expo(n, p >> 1);
// x = (x * x);
// return ((p & 1) ? (x * n) : x);
//}
//ll bigmod(ll a,ll b,ll m){if(b == 0) return 1%m;ll x = bigmod(a,b/2,m);x = (x * x) % m;if(b % 2 == 1) x = (x * a) % m;return x;}
//ll BigMod(ll B,ll P,ll M){ ll R=1%M; while(P>0) {if(P%2==1){R=(R*B)%M;}P/=2;B=(B*B)%M;} return R;} /// (B^P)%M
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MXN 50
#define MXE
#define MXQ
#define SZE
#define MOD
#define EPS
#define INF 100000000
#define MX 300005
#define inf 100000000
ll lev[MX];
ll res[MX];
void solve(int i, int j, int l, int r)
{
if(i == 1 && j == 1)
{
res[l] = lev[l];
// deb(">>>>", j, l, r);
// for(int i = l; i <= r; i++)
// printf("%d %d\n", i, res[i]);
return;
}
int m1 = (i+j)/2;
int m2 = (l+r)/2;
solve(1,m1,l,m2);
solve(1,m1,m2+1,r);
for(int i = l, j = m2+1; i <= m2; i++, j++)
{
ll tem = res[i];
res[i] ^= res[j];
res[j] = tem;
}
// deb(">>>>", j, l, r);
// for(int i = l; i <= r; i++)
// printf("%d %d\n", i, res[i]);
}
vector<int> adj[MX];
ll arr[MX];
void dfs(int u, int p, int l)
{
lev[l] ^= arr[u];
for(int i = 0; i < adj[u].size(); i++)
{
int v = adj[u][i];
if(v == p) continue;
dfs(v,u,l+1);
}
}
int main()
{
// freopen("input.txt", "r", stdin);
int n, q, u, v;
scanf("%d %d", &n, &q);
for(int i = 0; i <= n; i++) adj[i].clear();
for(int i = 1; i < n; i++)
{
scanf("%d %d", &u, &v);
adj[u].push_back(v);
adj[v].push_back(u);
}
for(int i = 0; i < n; i++)
scanf("%lld", &arr[i]);
memset(lev,0,sizeof lev);
dfs(0,0,1);
int nn = 1;
while(nn<n) nn<<=1;
// for(int i = 1; i <= nn; i++)
// deb("lev", i, lev[i]);
solve(1,nn,1,nn);
res[0] = res[nn];
while(q--)
{
ll x;
scanf("%lld", &x);
printf("%lld\n", res[(x%nn)]);
}
return 0;
}
| [
"masum.nayeem@gmail.com"
] | masum.nayeem@gmail.com |
86fe72a294906c89c900b67083c0be4612ed71f0 | a4955271b1a8e261aa86a52a8bc4c9fe7382d3ff | /serial.ino | a91239305af2363eef5b01606076560295bcd701 | [] | no_license | TeoLucco/TeoG-Nano | 0377dfe135384865bf2c24f6c1e330c63fcbddd8 | 07891981e2b28bd6fc6f6948efff9b0ad816a472 | refs/heads/master | 2021-08-17T06:21:44.631696 | 2017-11-20T21:10:39 | 2017-11-20T21:10:39 | 108,388,487 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,929 | ino | void SerialLoop() {
// if (print) {
// print = false;
// if (workingCapacitives == body) {
// Serial.println("");
// Serial.print(millis()); Serial.print(",");
// for(int i=0;i<N_BODY_SENSORS-1;i++){
// Serial.print(bodySensorValue[i]); Serial.print(","); //Serial.print(calibration[i]); Serial.print(",");
// }
// Serial.print(bodySensorValue[N_BODY_SENSORS-1]);
// Serial.print(",");
// Serial.print(touchState);
// //Serial.print(millis() - startTouchingTime);
// }
// }
// if (workingCapacitives == head) {
// Serial.print(headSensorValue[0]); Serial.print(" "); Serial.print(headSensorValue[1]); Serial.print(" ");
// Serial.print(headSensorValue[2]); Serial.print(" "); Serial.print(headSensorValue[3]); Serial.print(" "); Serial.println(pressedButton);
// }
reciveSerial();
sendSerial();
}
void reciveSerial() {
if (Serial.available()) {
int b = Serial.read();
switch (b) {
case 0: workingCapacitives = noOne; capStateStartTime=millis();break;
case 1: workingCapacitives = head;resetHeadCapacitives();capStateStartTime=millis(); break;
case 2: resetCapacitives(); bodyStartTime=millis(); workingCapacitives = body;capStateStartTime=millis();chooseThreshold(); break;
case 3: workingCapacitives = both;capStateStartTime=millis(); break;
}
}
}
void sendSerial() {
if (workingCapacitives == head && pressedButton != -1) {
Serial.write(4);
Serial.write(pressedButton);
}
//i vari abbracci , carezze e colpi vengono scritti su seriale direttamente dalle funzioni di body_capacitives
//scrivo 1 per abbraccio, 2 per carezza, 3 per colpo e 4 per bottone
}
void chooseThreshold(){
if(Serial.read()==5) setThreshold(400);
else if(Serial.read()==4) setThreshold(150);
}
void setThreshold(int value){
for(int i=0; i<N_BODY_SENSORS;i++){
lowBodyThreshold[i]=value;
}
}
| [
"teolucco@gmail.com"
] | teolucco@gmail.com |
91528935fa38f3340e95158c1e55b5418989b681 | ef85e8a029ebbf14d24921c304675f4b3d246f44 | /core/fixed_string.hpp | 870a37984914c42020a75f1a19d5c671e09fd688 | [] | no_license | KriwkA/ConstexprSQLQuery | 4ac3080366942b86dfbaa367ab32c77ba27a14b2 | 1b6040b2302566a22e8b164fb27690c523cc8093 | refs/heads/master | 2020-09-28T12:31:23.170179 | 2019-12-09T03:47:31 | 2019-12-09T03:47:31 | 226,779,256 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,099 | hpp | #pragma once
#include <utility>
#include <cstddef>
#include <string_view>
#include <cstdint>
namespace ctll {
template <typename CharT, size_t N>
class fixed_string {
CharT content[N] = {};
size_t real_size{0};
public:
static constexpr size_t content_size = N;
using value_type = CharT;
constexpr fixed_string() = default;
//concat value_type of all args must be same
template<typename ...Args>
constexpr fixed_string(const Args& ...args) noexcept {
size_t pos = 0;
auto builder = [&](const auto& str) {
for(size_t i = 0; i < str.size(); ++i) {
content[pos++] = str[i];
}
real_size += str.size();
};
(builder(args), ...);
}
constexpr fixed_string(const CharT (&input)[N]) noexcept {
for (size_t i{0}; i < N; ++i) {
content[i] = input[i];
if ((i == (N-1)) && (input[i] == 0)) {
break;
}
real_size++;
}
}
template<size_t M>
constexpr fixed_string(const fixed_string<CharT, M>& other) noexcept {
for (size_t i = 0; i < other.size(); ++i) {
content[i] = other[i];
}
real_size = other.size();
}
constexpr size_t size() const noexcept {
return real_size;
}
constexpr const CharT * begin() const noexcept {
return content;
}
constexpr const CharT * end() const noexcept {
return content + size();
}
constexpr CharT operator[](size_t i) const noexcept {
return content[i];
}
template<size_t M>
constexpr fixed_string<CharT, N + M> operator+(const fixed_string<CharT, M>& fs) const noexcept {
return fixed_string<CharT, N + M>(*this, fs);
}
template<size_t M>
constexpr fixed_string<CharT, N + M> operator+(const CharT (&input)[M]) const noexcept {
return fixed_string<CharT, N + M>(*this, fixed_string<CharT, M>(input));
}
constexpr fixed_string<CharT, N + 1> operator+(CharT c) const noexcept {
CharT arr[] = {c};
return *this + arr;
}
template <size_t M>
constexpr bool is_same_as(const fixed_string<CharT, M> & rhs) const noexcept {
if (real_size != rhs.size()) return false;
for (size_t i{0}; i != real_size; ++i) {
if (content[i] != rhs[i]) {
return false;
}
}
return true;
}
};
template <typename CharT> class fixed_string<CharT, 0> {
static constexpr CharT __empty[1] = {0};
public:
constexpr fixed_string() noexcept {}
constexpr fixed_string(const CharT *) noexcept {
}
constexpr fixed_string(std::initializer_list<CharT>) noexcept {
}
constexpr fixed_string(const fixed_string &) noexcept {
}
constexpr size_t size() const noexcept {
return 0;
}
constexpr const CharT * begin() const noexcept {
return __empty;
}
constexpr const CharT * end() const noexcept {
return __empty + size();
}
constexpr CharT operator[](size_t) const noexcept {
return 0;
}
template<size_t M>
constexpr fixed_string<CharT,M> operator+(const fixed_string<CharT, M>& fs) const noexcept {
return fs;
}
constexpr fixed_string<CharT, 1> operator+(CharT c) const noexcept {
CharT arr[1] = {c};
return fixed_string<CharT, 1>(arr);
}
};
template <typename CharT, size_t N> fixed_string(const CharT (&)[N]) -> fixed_string<CharT, N>;
}
template <typename CharT, size_t N, size_t M>
constexpr decltype(auto) operator+(const CharT (&left)[N], const ctll::fixed_string<CharT, M>& right) noexcept {
return ctll::fixed_string(left) + right;
}
template <typename CharT, size_t N>
constexpr decltype(auto) operator+(CharT c, const ctll::fixed_string<CharT, N>& right) noexcept {
CharT arr[1] = {c};
return arr + right;
}
template <size_t N>
std::ostream& operator<<(std::ostream& os, const ctll::fixed_string<char, N>& str) {
os.write(str.begin(), str.size());
return os;
}
template <size_t N>
std::wostream& operator<<(std::wostream& os, const ctll::fixed_string<wchar_t, N>& str) {
os.write(str.begin(), str.size());
return os;
}
| [
"kriwka30@gmail.com"
] | kriwka30@gmail.com |
89429978315dab586cf63da505122cb520b09e13 | 6165f87c58e012455b77113e36d49054cc3e9ff5 | /include/SSVUtils/CmdLine/Ctx.hpp | eaa85e691e7a4bd5a832f78fb1c28d6289c8cb35 | [
"AFL-3.0",
"AFL-2.1",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | j4cobgarby/SSVUtils | 26d06bd082852c8df1df9acb816574c7f8c1c453 | 6526ee9e8714414ce8963c4af8a1f9f407078835 | refs/heads/master | 2021-07-18T16:16:20.106185 | 2017-05-27T20:15:45 | 2017-05-27T20:15:45 | 108,466,388 | 0 | 0 | null | 2017-10-26T21:15:57 | 2017-10-26T21:15:57 | null | UTF-8 | C++ | false | false | 1,654 | hpp | // Copyright (c) 2013-2015 Vittorio Romeo
// License: Academic Free License ("AFL") v. 3.0
// AFL License page: http://opensource.org/licenses/AFL-3.0
#ifndef SSVU_CMDLINE_CTX
#define SSVU_CMDLINE_CTX
#include "SSVUtils/Core/Core.hpp"
#include "SSVUtils/Delegate/Delegate.hpp"
#include "SSVUtils/MemoryManager/MemoryManager.hpp"
#include "SSVUtils/CmdLine/Cmd.hpp"
namespace ssvu
{
namespace CmdLine
{
class Ctx
{
private:
VecUPtr<Cmd> cmds;
Cmd cmdMain{Cmd::createCmdMain()};
inline bool beginsAsFlag(const std::string& mStr) const noexcept
{
return beginsWith(mStr, Impl::flagPrefixShort) ||
beginsWith(mStr, Impl::flagPrefixLong);
}
inline auto getForCmdPhrase(Cmd& mCmd) const noexcept
{
return mCmd.isMainCmd() ? ""s
: " for command "s + mCmd.getNamesStr();
}
public:
Cmd& findCmd(const std::string& mName) const;
Cmd& create(const std::initializer_list<std::string>& mNames);
void process(const std::vector<std::string>& mArgs);
inline void process(int mArgCount, char* mArgValues[])
{
std::vector<std::string> args;
for(int i{1}; i < mArgCount; ++i)
args.emplace_back(mArgValues[i]);
process(args);
}
inline const auto& getCmds() const noexcept { return cmds; }
inline auto& getCmdMain() noexcept { return cmdMain; }
};
}
}
#endif
| [
"vittorio.romeo@outlook.com"
] | vittorio.romeo@outlook.com |
0a8530a1d54b21f302afdea6e79cfa78bb35c127 | a33aac97878b2cb15677be26e308cbc46e2862d2 | /program_data/PKU_raw/43/1170.c | 5d1253099ac838943ff66347d269c8029eb01278 | [] | no_license | GabeOchieng/ggnn.tensorflow | f5d7d0bca52258336fc12c9de6ae38223f28f786 | 7c62c0e8427bea6c8bec2cebf157b6f1ea70a213 | refs/heads/master | 2022-05-30T11:17:42.278048 | 2020-05-02T11:33:31 | 2020-05-02T11:33:31 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 530 | c | //********************************
//*????????? **
//*????? 1300012845 **
//*???2013.10.23 **
//********************************
int main ()//???
{
int i,j,k,m,s;//??????i?k
cin >> m;
for (i=3; i<=m/2; i+=2)//?i?????m/2???
{
s=sqrt(i);
for (j=2; j<=s;j++)
{
if (i%j==0)
break;
}
if (j==s+1)//??????????i?????
{
k=m-i;
s=sqrt(k);
for (j=2; j<=s;j++)//??k?????
{
if (k%j==0)
break;
}
if (j==s+1)
cout << i << " "<< k<< endl;
}
}
return 0;
} | [
"bdqnghi@gmail.com"
] | bdqnghi@gmail.com |
2bb65ced9dc3c7650c406a5ff4da7dea60fef6c0 | 0e4e98b41c84c4f612b54c9d22d4ef9db8b3addc | /Source/TestUEProject/Data/GroupDefinitionAsset.h | 219dc1db8dfc9f4235b3a398be6cf7a84c55d045 | [] | no_license | nexon-97/UE-prototype-game | 5d397994d6e8c38e998d2fbc84497b625025bc56 | a087392bd74c8af531b595d36668673e95a99380 | refs/heads/master | 2021-06-18T01:13:09.365058 | 2021-01-30T21:52:33 | 2021-01-30T21:52:33 | 170,294,704 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 296 | h | #pragma once
#include "NPC/NPCRelation.h"
#include "Engine/DataAsset.h"
#include "GroupDefinitionAsset.generated.h"
UCLASS(Blueprintable)
class UGroupDefinitionAsset
: public UDataAsset
{
GENERATED_BODY()
public:
UPROPERTY(EditDefaultsOnly)
TMap<FName, ENPCRelation> GroupRelations;
};
| [
"nexons.97@gmail.com"
] | nexons.97@gmail.com |
a6950741a8aad7aab79f1f578bd46b9bcacfdc3c | 62846c9d4f7e0d1c5fa859ac0560b5d07e664b54 | /1. CppHomework/8-CustomTrianglePrinter-Visteon.cpp | a70d660b8d5f8492e6d010794bc782280357c111 | [] | no_license | bgdopus/Visteon-Homeworks2017 | 1bf8a9db0aa4c1f5861baeeb1bbb6cbd3692c723 | 71e3ddd411268d0d4ac3b52fe8b153f4db0b9dc0 | refs/heads/master | 2020-05-09T13:23:55.294133 | 2019-04-13T10:20:53 | 2019-04-13T10:20:53 | 181,150,381 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 704 | cpp | //============================================================================
// Name : 8-CustomTrianglePrinter-Visteon.cpp
// Author : Daniel Georiev
// Version :
// Copyright : Your copyright notice
// Description : 8. The same triangle as previous, but having height and symbol input by the user.
//============================================================================
#include <iostream>
using namespace std;
int main() {
int size;
cin >> size;
char symbol;
cin >> symbol;
for (int i=1; i<size*2; i += 2)
{
for (int k=0; k < (size - i / 2); k++)
{
cout << " ";
}
for (int j=0; j<i; j++)
{
cout << symbol;
}
cout << "" << endl;
}
return 0;
}
| [
"bgdopus@gmail.com"
] | bgdopus@gmail.com |
b0dfe1c6f3aa347d447dd4919d3eeb434b532fd2 | a43d044987a2c18e634a7dadccd3fc97fcbf1ce6 | /src/test/zerocoin_transactions_tests.cpp | b9eecc99a1ff0ac64007809bbd230eaf8b06e58b | [
"MIT"
] | permissive | mhannigan/luckycoin | 6de1b3287aad72eb7cdac0cb0af2f5363ee3b78f | f67258db5078c47adc6a768216b97ef685da5875 | refs/heads/master | 2020-03-27T06:54:52.029067 | 2018-08-26T02:46:21 | 2018-08-26T02:46:21 | 146,146,249 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,883 | cpp | // Copyright (c) 2017-2018 The LUK developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "libzerocoin/Denominations.h"
#include "amount.h"
#include "chainparams.h"
#include "coincontrol.h"
#include "main.h"
#include "wallet.h"
#include "walletdb.h"
#include "txdb.h"
#include <boost/test/unit_test.hpp>
#include <iostream>
using namespace libzerocoin;
BOOST_AUTO_TEST_SUITE(zerocoin_transactions_tests)
static CWallet cWallet("unlocked.dat");
BOOST_AUTO_TEST_CASE(zerocoin_spend_test)
{
SelectParams(CBaseChainParams::MAIN);
ZerocoinParams *ZCParams = Params().Zerocoin_Params(false);
(void)ZCParams;
bool fFirstRun;
cWallet.LoadWallet(fFirstRun);
cWallet.zpivTracker = unique_ptr<CzLUKTracker>(new CzLUKTracker(cWallet.strWalletFile));
CMutableTransaction tx;
CWalletTx* wtx = new CWalletTx(&cWallet, tx);
bool fMintChange=true;
bool fMinimizeChange=true;
std::vector<CZerocoinSpend> vSpends;
std::vector<CZerocoinMint> vMints;
CAmount nAmount = COIN;
int nSecurityLevel = 100;
CZerocoinSpendReceipt receipt;
cWallet.SpendZerocoin(nAmount, nSecurityLevel, *wtx, receipt, vMints, fMintChange, fMinimizeChange);
BOOST_CHECK_MESSAGE(receipt.GetStatus() == ZLUK_TRX_FUNDS_PROBLEMS, "Failed Invalid Amount Check");
nAmount = 1;
CZerocoinSpendReceipt receipt2;
cWallet.SpendZerocoin(nAmount, nSecurityLevel, *wtx, receipt2, vMints, fMintChange, fMinimizeChange);
// if using "wallet.dat", instead of "unlocked.dat" need this
/// BOOST_CHECK_MESSAGE(vString == "Error: Wallet locked, unable to create transaction!"," Locked Wallet Check Failed");
BOOST_CHECK_MESSAGE(receipt2.GetStatus() == ZLUK_TRX_FUNDS_PROBLEMS, "Failed Invalid Amount Check");
}
BOOST_AUTO_TEST_SUITE_END()
| [
"root@ip-172-31-94-31.ec2.internal"
] | root@ip-172-31-94-31.ec2.internal |
632c7dcb13c7342f5c9fe703a50bc230db3b229f | 50c05e8a3e9940b2af30d2666440e7b0552c24df | /src/ivi_FFT.h | f0cdf648a26afc04bb16e8fc2832d91c49e6cbae | [] | no_license | phsn/ivi_compilation_01 | 06574595eb18d755710b5acec6d3c5dbb3c4aa3e | 4d2bbb1560fbc1bf947dfa4d7a1c404ef649efa8 | refs/heads/master | 2021-01-10T05:34:08.881143 | 2016-01-06T16:04:18 | 2016-01-06T16:04:18 | 49,099,769 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 709 | h | #pragma once
#include "ofMain.h"
#include "ofxFFTBase.h"
class ivi_FFT : public ofBaseApp {
public:
void setup(int deviceID);
void update();
void exit();
vector<float> getLogAverages();
void drawSamples();
float analyzeSampleRange(float minRange, float maxRange);
void visualizeSampleRange(float minRange, float maxRange);
void listDevices();
private:
void audioIn(float * input, int bufferSize, int nChannels);
ofSoundStream soundStream;
vector<float> samplesChannelL;
vector<float> samplesChannelR;
ofxFFTBase fftChannelL;
ofxFFTBase fftChannelR;
float getBandWidth();
int freqToIndex(int freq);
};
| [
"phsn@psmbp.fritz.box"
] | phsn@psmbp.fritz.box |
aef0c7a242f960c40d21c46ebf627e61aabf6174 | 08b8cf38e1936e8cec27f84af0d3727321cec9c4 | /data/crawl/squid/old_hunk_5519.cpp | 880a51f1b77bc5a49d3135b41927ee2189bfa69c | [] | no_license | ccdxc/logSurvey | eaf28e9c2d6307140b17986d5c05106d1fd8e943 | 6b80226e1667c1e0760ab39160893ee19b0e9fb1 | refs/heads/master | 2022-01-07T21:31:55.446839 | 2018-04-21T14:12:43 | 2018-04-21T14:12:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 267 | cpp | static void
authBasicCfgDump(StoreEntry * entry, const char *name, authScheme * scheme)
{
auth_basic_config *config = scheme->scheme_data;
wordlist *list = config->authenticate;
storeAppendPrintf(entry, "%s %s", name, "basic");
while (list != NULL) {
| [
"993273596@qq.com"
] | 993273596@qq.com |
adec1dd21210ec7094b1fe30cad273e006fbc8db | 2fa389f110c2c0bb587fb0c8c9be82d5fc7097d3 | /test/ExceptionTest.cc | 8c8b7a50e97e8b71cbbef50d7bd0fe083320986c | [] | no_license | PeterZs/OpenRoomAlive | 8a2d7094975005b0479b6e07f88b28f5d6af2498 | e29b7d89049ddc30768e335aee47c8f26dc97d80 | refs/heads/master | 2020-09-26T15:36:38.601085 | 2018-01-31T12:28:36 | 2018-01-31T12:28:36 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 522 | cc | // This file is part of the DerpVision Project.
// Licensing information can be found in the LICENSE file.
// (C) 2015 Group 13. All rights reserved.
#include <gtest/gtest.h>
#include "core/Exception.h"
using namespace dv;
/**
* Tests that the file name recorded by the exception is correct.
*/
TEST(ExceptionTest, TestFileName) {
try {
throw EXCEPTION() << "test";
} catch (const Exception &ex) {
ASSERT_EQ("test/ExceptionTest.cc", ex.getFile());
return;
}
FAIL() << "Exception not thrown.";
}
| [
"licker.nandor@gmail.com"
] | licker.nandor@gmail.com |
250107b4e1777eb68a28ef2fc06f6ea29bc17681 | b7e97047616d9343be5b9bbe03fc0d79ba5a6143 | /src/protocols/helical_bundle/BundleGridSampler.hh | c71a7ecf6492637f73c271555ab9d77ece7eeba1 | [] | no_license | achitturi/ROSETTA-main-source | 2772623a78e33e7883a453f051d53ea6cc53ffa5 | fe11c7e7cb68644f404f4c0629b64da4bb73b8f9 | refs/heads/master | 2021-05-09T15:04:34.006421 | 2018-01-26T17:10:33 | 2018-01-26T17:10:33 | 119,081,547 | 1 | 3 | null | null | null | null | UTF-8 | C++ | false | false | 24,904 | hh | // -*- mode:c++;tab-width:2;indent-tabs-mode:t;show-trailing-whitespace:t;rm-trailing-spaces:t -*-
// vi: set ts=2 noet:
//
// (c) Copyright Rosetta Commons Member Institutions.
// (c) This file is part of the Rosetta software suite and is made available under license.
// (c) The Rosetta software is developed by the contributing members of the Rosetta Commons.
// (c) For more information, see http://www.rosettacommons.org. Questions about this can be
// (c) addressed to University of Washington CoMotion, email: license@uw.edu.
/// @file protocols/helical_bundle/BundleGridSampler.hh
/// @brief Headers for BundleGridSampler.cc. Samples conformations of a helical bundle by performing a grid
/// search in Crick parameter space.
/// @author Vikram K. Mulligan (vmullig@uw.edu)
#ifndef INCLUDED_protocols_helical_bundle_BundleGridSampler_hh
#define INCLUDED_protocols_helical_bundle_BundleGridSampler_hh
// Unit Headers
#include <protocols/moves/Mover.hh>
#include <protocols/filters/Filter.fwd.hh>
#include <protocols/filters/Filter.hh>
#include <protocols/helical_bundle/BundleGridSampler.fwd.hh>
#include <protocols/helical_bundle/BundleGridSamplerHelper.fwd.hh>
#include <protocols/helical_bundle/BundleGridSamplerHelper.hh>
#include <protocols/helical_bundle/parameters/BundleParameters.fwd.hh>
#include <protocols/helical_bundle/parameters/BundleParameters.hh>
#include <protocols/helical_bundle/parameters/BundleParametersSet.fwd.hh>
#include <protocols/helical_bundle/parameters/BundleParametersSet.hh>
#include <core/conformation/parametric/Parameters.fwd.hh>
#include <core/conformation/parametric/Parameters.hh>
#include <core/conformation/parametric/ParametersSet.fwd.hh>
#include <core/conformation/parametric/ParametersSet.hh>
#include <protocols/helical_bundle/PerturbBundleOptions.fwd.hh>
#include <protocols/helical_bundle/MakeBundle.fwd.hh>
#include <protocols/helical_bundle/MakeBundle.hh>
#include <core/scoring/ScoreFunction.hh>
#include <core/scoring/ScoreFunctionFactory.hh>
// Scripter Headers
#include <utility/tag/Tag.fwd.hh>
#include <basic/datacache/DataMap.fwd.hh>
#include <protocols/filters/Filter.fwd.hh>
#include <protocols/moves/Mover.fwd.hh>
//JD2:
#include <protocols/jd2/JobDistributor.fwd.hh>
#include <protocols/jd2/Job.fwd.hh>
// Project Headers
#include <utility/vector1.hh>
#include <numeric/xyzVector.hh>
#include <core/id/AtomID.hh>
#include <core/conformation/Residue.hh>
#include <set>
#include <core/grid/CartGrid.fwd.hh>
///////////////////////////////////////////////////////////////////////
namespace protocols {
namespace helical_bundle {
class BundleGridSampler : public protocols::moves::Mover
{
public: //Typedefs
typedef core::conformation::parametric::Parameters Parameters;
typedef core::conformation::parametric::ParametersOP ParametersOP;
typedef core::conformation::parametric::ParametersSet ParametersSet;
typedef core::conformation::parametric::ParametersSetOP ParametersSetOP;
typedef protocols::helical_bundle::parameters::BundleParameters BundleParameters;
typedef protocols::helical_bundle::parameters::BundleParametersOP BundleParametersOP;
typedef protocols::helical_bundle::parameters::BundleParametersCOP BundleParametersCOP;
typedef protocols::helical_bundle::parameters::BundleParametersSet BundleParametersSet;
typedef protocols::helical_bundle::parameters::BundleParametersSetOP BundleParametersSetOP;
typedef protocols::helical_bundle::parameters::BundleParametersSetCOP BundleParametersSetCOP;
public:
BundleGridSampler();
BundleGridSampler( BundleGridSampler const &src );
~BundleGridSampler() override;
protocols::moves::MoverOP clone() const override;
protocols::moves::MoverOP fresh_instance() const override;
/// @brief Actually apply the mover to the pose.
void apply(core::pose::Pose & pose) override;
// XRW TEMP std::string get_name() const override;
void parse_my_tag(
utility::tag::TagCOP tag,
basic::datacache::DataMap & data,
protocols::filters::Filters_map const & filters,
protocols::moves::Movers_map const & movers,
core::pose::Pose const &
) override;
public:
////////////////////////////////////////////////////////////////////////////////
// PUBLIC FUNCTIONS //
////////////////////////////////////////////////////////////////////////////////
/// @brief Set the reset mode.
/// @brief If true (default), the pose is reset before generating bundles. If false, it is not.
void set_reset_mode( bool const val) { reset_mode_=val; return; }
/// @brief Get the reset mode.
/// @brief If true (default), the pose is reset before generating bundles. If false, it is not.
bool reset_mode() const { return reset_mode_; }
/// @brief Access the r0_ BundleOptions object, by index.
/// @details This is the index in order of helices added, NOT necessarily the index of the helix.
PerturbBundleOptionsOP r0( core::Size const index ) {
runtime_assert_string_msg(index>0 && index<=r0_.size(), "Index passed to protocols::helical_bundle::PerturbBundle::r0() out of range.");
return r0_[index];
}
/// @brief Access the r0_ BundleOptions object, by index. This provides const access.
/// @details This is the index in order of helices added, NOT necessarily the index of the helix.
PerturbBundleOptionsCOP r0( core::Size const index ) const {
runtime_assert_string_msg(index>0 && index<=r0_.size(), "Index passed to protocols::helical_bundle::PerturbBundle::r0() out of range.");
return r0_[index];
}
/// @brief Access the omega0_ BundleOptions object, by index.
/// @details This is the index in order of helices added, NOT necessarily the index of the helix.
PerturbBundleOptionsOP omega0( core::Size const index ) {
runtime_assert_string_msg(index>0 && index<=omega0_.size(), "Index passed to protocols::helical_bundle::PerturbBundle::omega0() out of range.");
return omega0_[index];
}
/// @brief Access the omega0_ BundleOptions object, by index. This provides const access.
/// @details This is the index in order of helices added, NOT necessarily the index of the helix.
PerturbBundleOptionsCOP omega0( core::Size const index ) const {
runtime_assert_string_msg(index>0 && index<=omega0_.size(), "Index passed to protocols::helical_bundle::PerturbBundle::omega0() out of range.");
return omega0_[index];
}
/// @brief Access the delta_omega0_ BundleOptions object, by index.
/// @details This is the index in order of helices added, NOT necessarily the index of the helix.
PerturbBundleOptionsOP delta_omega0( core::Size const index ) {
runtime_assert_string_msg(index>0 && index<=delta_omega0_.size(), "Index passed to protocols::helical_bundle::PerturbBundle::delta_omega0() out of range.");
return delta_omega0_[index];
}
/// @brief Access the delta_omega0_ BundleOptions object, by index. This provides const access.
/// @details This is the index in order of helices added, NOT necessarily the index of the helix.
PerturbBundleOptionsCOP delta_omega0( core::Size const index ) const {
runtime_assert_string_msg(index>0 && index<=delta_omega0_.size(), "Index passed to protocols::helical_bundle::PerturbBundle::delta_omega0() out of range.");
return delta_omega0_[index];
}
/// @brief Access the delta_omega1_ BundleOptions object, by index.
/// @details This is the index in order of helices added, NOT necessarily the index of the helix.
PerturbBundleOptionsOP delta_omega1( core::Size const index ) {
runtime_assert_string_msg(index>0 && index<=delta_omega1_.size(), "Index passed to protocols::helical_bundle::PerturbBundle::delta_omega1() out of range.");
return delta_omega1_[index];
}
/// @brief Access the delta_omega1_ BundleOptions object, by index. This provides const access.
/// @details This is the index in order of helices added, NOT necessarily the index of the helix.
PerturbBundleOptionsCOP delta_omega1( core::Size const index ) const {
runtime_assert_string_msg(index>0 && index<=delta_omega1_.size(), "Index passed to protocols::helical_bundle::PerturbBundle::delta_omega1() out of range.");
return delta_omega1_[index];
}
/// @brief Access the delta_t_ BundleOptions object, by index.
/// @details This is the index in order of helices added, NOT necessarily the index of the helix.
PerturbBundleOptionsOP delta_t( core::Size const index ) {
runtime_assert_string_msg(index>0 && index<=delta_t_.size(), "Index passed to protocols::helical_bundle::PerturbBundle::delta_t() out of range.");
return delta_t_[index];
}
/// @brief Access the delta_t_ BundleOptions object, by index. This provides const access.
/// @details This is the index in order of helices added, NOT necessarily the index of the helix.
PerturbBundleOptionsCOP delta_t( core::Size const index ) const {
runtime_assert_string_msg(index>0 && index<=delta_t_.size(), "Index passed to protocols::helical_bundle::PerturbBundle::delta_t() out of range.");
return delta_t_[index];
}
/// @brief Access the z1_offset_ BundleOptions object, by index.
/// @details This is the index in order of helices added, NOT necessarily the index of the helix.
PerturbBundleOptionsOP z1_offset( core::Size const index ) {
runtime_assert_string_msg(index>0 && index<=z1_offset_.size(), "Index passed to protocols::helical_bundle::PerturbBundle::z1_offset() out of range.");
return z1_offset_[index];
}
/// @brief Access the z1_offset_ BundleOptions object, by index. This provides const access.
/// @details This is the index in order of helices added, NOT necessarily the index of the helix.
PerturbBundleOptionsCOP z1_offset( core::Size const index ) const {
runtime_assert_string_msg(index>0 && index<=z1_offset_.size(), "Index passed to protocols::helical_bundle::PerturbBundle::z1_offset() out of range.");
return z1_offset_[index];
}
/// @brief Access the z0_offset_ BundleOptions object, by index.
/// @details This is the index in order of helices added, NOT necessarily the index of the helix.
PerturbBundleOptionsOP z0_offset( core::Size const index ) {
runtime_assert_string_msg(index>0 && index<=z0_offset_.size(), "Index passed to protocols::helical_bundle::PerturbBundle::z0_offset() out of range.");
return z0_offset_[index];
}
/// @brief Access the z0_offset_ BundleOptions object, by index. This provides const access.
/// @details This is the index in order of helices added, NOT necessarily the index of the helix.
PerturbBundleOptionsCOP z0_offset( core::Size const index ) const {
runtime_assert_string_msg(index>0 && index<=z0_offset_.size(), "Index passed to protocols::helical_bundle::PerturbBundle::z0_offset() out of range.");
return z0_offset_[index];
}
/// @brief Access the epsilon_ BundleOptions object, by index.
/// @details This is the index in order of helices added, NOT necessarily the index of the helix.
PerturbBundleOptionsOP epsilon( core::Size const index ) {
runtime_assert_string_msg(index>0 && index<=epsilon_.size(), "Index passed to protocols::helical_bundle::PerturbBundle::epsilon() out of range.");
return epsilon_[index];
}
/// @brief Access the epsilon_ BundleOptions object, by index. This provides const access.
/// @details This is the index in order of helices added, NOT necessarily the index of the helix.
PerturbBundleOptionsCOP epsilon( core::Size const index ) const {
runtime_assert_string_msg(index>0 && index<=epsilon_.size(), "Index passed to protocols::helical_bundle::PerturbBundle::epsilon() out of range.");
return epsilon_[index];
}
/// @brief Access the default_r0_ BundleOptions object.
///
PerturbBundleOptionsOP default_r0() { return default_r0_; }
/// @brief Access the default_r0_ BundleOptions object (const-access).
///
PerturbBundleOptionsCOP default_r0() const { return default_r0_; }
/// @brief Access the default_omega0_ BundleOptions object.
///
PerturbBundleOptionsOP default_omega0() { return default_omega0_; }
/// @brief Access the default_omega0_ BundleOptions object (const-access).
///
PerturbBundleOptionsCOP default_omega0() const { return default_omega0_; }
/// @brief Access the default_delta_omega0_ BundleOptions object.
///
PerturbBundleOptionsOP default_delta_omega0() { return default_delta_omega0_; }
/// @brief Access the default_delta_omega0_ BundleOptions object (const-access).
///
PerturbBundleOptionsCOP default_delta_omega0() const { return default_delta_omega0_; }
/// @brief Access the default_delta_omega1_ BundleOptions object.
///
PerturbBundleOptionsOP default_delta_omega1() { return default_delta_omega1_; }
/// @brief Access the default_delta_omega1_ BundleOptions object (const-access).
///
PerturbBundleOptionsCOP default_delta_omega1() const { return default_delta_omega1_; }
/// @brief Access the default_delta_t_ BundleOptions object.
///
PerturbBundleOptionsOP default_delta_t() { return default_delta_t_; }
/// @brief Access the default_delta_t_ BundleOptions object (const-access).
///
PerturbBundleOptionsCOP default_delta_t() const { return default_delta_t_; }
/// @brief Access the default_z1_offset_ BundleOptions object.
///
PerturbBundleOptionsOP default_z1_offset() { return default_z1_offset_; }
/// @brief Access the default_z1_offset_ BundleOptions object (const-access).
///
PerturbBundleOptionsCOP default_z1_offset() const { return default_z1_offset_; }
/// @brief Access the default_z0_offset_ BundleOptions object.
///
PerturbBundleOptionsOP default_z0_offset() { return default_z0_offset_; }
/// @brief Access the default_z0_offset_ BundleOptions object (const-access).
///
PerturbBundleOptionsCOP default_z0_offset() const { return default_z0_offset_; }
/// @brief Access the default_epsilon_ BundleOptions object.
///
PerturbBundleOptionsOP default_epsilon() { return default_epsilon_; }
/// @brief Access the default_epsilon_ BundleOptions object (const-access).
///
PerturbBundleOptionsCOP default_epsilon() const { return default_epsilon_; }
/// @brief Add options for a new helix
/// @details Return value is the current total number of helices after the addition.
core::Size add_helix();
/// @brief Set the maximum number of samples for the mover.
/// @details If the number of gridpoints based on user options exceeds this number, an error is thrown
/// and the mover aborts. This is to prevent unreasonably large calculations from being attempted.
void set_max_samples( core::Size const val ) { max_samples_=val; return; }
/// @brief Get the maximum number of samples for the mover.
/// @details If the number of gridpoints based on user options exceeds this number, an error is thrown
/// and the mover aborts. This is to prevent unreasonably large calculations from being attempted.
core::Size max_samples() const { return max_samples_; }
/// @brief Increments the number of helices that have been defined.
///
void increment_helix_count() { ++n_helices_; return; }
/// @brief Returns the number of helices that have been defined.
///
core::Size n_helices() const { return n_helices_; }
/// @brief Sets whether the selection should be for the lowest score value (true) or highest (false).
///
void set_selection_low( bool const val ) { select_low_=val; return; }
/// @brief Returns whether the selection should be for the lowest score value (true) or highest (false).
///
bool selection_low() { return select_low_; }
/// @brief Sets the mover that will be applied to all helical bundles generated prior to energy evaluation.
/// @details Note: if this is used, there is no guarantee that the resulting geometry will still lie within the
/// parameter space. (That is, this mover could move the backbone.)
void set_preselection_mover ( protocols::moves::MoverOP mover );
/// @brief Sets the filter that will be applied to all helical bundles generated prior to energy evaluation.
/// @details See the pre_selection_filter_ private member variable for details.
void set_preselection_filter ( protocols::filters::FilterOP filter );
/// @brief Returns "true" if and only if a preselection mover has been assigned.
///
bool preselection_mover_exists() const { return pre_selection_mover_exists_; }
/// @brief Returns "true" if and only if a preselection filter has been assigned.
///
bool preselection_filter_exists() const { return pre_selection_filter_exists_; }
/// @brief Set whether the mover dumps pdbs or not.
///
void set_pdb_output( bool const val ) { dump_pdbs_=val; return; }
/// @brief Returns whether the mover dumps pdbs or not.
///
bool pdb_output() const { return dump_pdbs_; }
/// @brief Sets the filename prefix for PDB output.
/// @details PDB files are of the form <prefix>_#####.pdb.
void set_pdb_prefix( std::string const &prefix ) { pdb_prefix_=prefix; return; }
/// @brief Access the filename prefix for PDB output.
/// @details PDB files are of the form <prefix>_#####.pdb.
std::string pdb_prefix() { return pdb_prefix_; }
/// @brief Sets the scorefunction for this mover.
/// @details This must be done before calling the apply() function.
void set_sfxn( core::scoring::ScoreFunctionOP sfxn_in ) {
runtime_assert_string_msg( sfxn_in, "In BundleGridSampler::set_sfxn(): A null scorefunction pointer was provided." );
sfxn_=sfxn_in;
sfxn_set_=true;
return;
}
/// @brief Returns whether the scorefunction has been set.
///
bool sfxn_set() const { return sfxn_set_; }
/// @brief Set the nstruct mode.
/// @details If true, each job samples one set of Crick parameters. If false, every job samples
/// every set of Crick parameters. False by default.
void set_nstruct_mode( bool const &val ) { nstruct_mode_=val; return; }
/// @brief Get the nstruct mode.
/// @details If true, each job samples one set of Crick parameters. If false, every job samples
/// every set of Crick parameters. False by default.
bool nstruct_mode( ) const { return nstruct_mode_; }
/// @brief Set the nstruct repeats.
/// @details This is set to 1 by default, which means that each nstruct number correspnds to a different
/// set of Crick parameters. If set greater than 1, then multiple consecutive nstruct numbers will
/// correspond to the same Crick parameters. This allows combinatorially combining this mover's sampling
/// with another, similar mover's sampling.
void set_nstruct_repeats( core::Size const val ) { nstruct_mode_repeats_=val; return; }
/// @brief Get the nstruct repeats.
/// @details This is set to 1 by default, which means that each nstruct number correspnds to a different
/// set of Crick parameters. If set greater than 1, then multiple consecutive nstruct numbers will
/// correspond to the same Crick parameters. This allows combinatorially combining this mover's sampling
/// with another, similar mover's sampling.
core::Size nstruct_repeats( ) const {
if ( nstruct_mode_repeats_ < 1 ) return 1;
return nstruct_mode_repeats_;
}
std::string
get_name() const override;
static
std::string
mover_name();
static
void
provide_xml_schema( utility::tag::XMLSchemaDefinition & xsd );
private:
////////////////////////////////////////////////////////////////////////////////
// PRIVATE DATA //
////////////////////////////////////////////////////////////////////////////////
/// @brief Should the pose be reset before applying the GridSampler? Default true.
///
bool reset_mode_;
/// @brief Should the parallel sampling be done based on the job (nstruct number)?
/// @details If true, each job samples one set of Crick parameters. If false, every job samples
/// every set of Crick parameters. False by default.
bool nstruct_mode_;
/// @brief If nstruct_mode_ is true, how many times should each set of Crick parameters be repeated?
/// @details This is set to 1 by default, which means that each nstruct number correspnds to a different
/// set of Crick parameters. If set greater than 1, then multiple consecutive nstruct numbers will
/// correspond to the same Crick parameters. This allows combinatorially combining this mover's sampling
/// with another, similar mover's sampling.
core::Size nstruct_mode_repeats_;
/// @brief The selection type.
/// @default If false, the pose with the highest score value is selected. If true,
/// the pose with the lowest score value is selected. True by default.
bool select_low_;
/// @brief The number of helices that have been defined.
///
core::Size n_helices_;
/// @brief The maximum number of gridpoints allowed.
/// @details If the number of gridpoints based on user options exceeds this number, an error is thrown
/// and the mover aborts. This is to prevent unreasonably large calculations from being attempted.
/// Default value is ten thousand (10,000).
core::Size max_samples_;
/// @brief Default options for sampling r0.
/// @details May be overridden on a helix-by-helix basis.
PerturbBundleOptionsOP default_r0_;
/// @brief Helix-by-helix options for sampling r0.
///
PerturbBundleOptionsOPs r0_;
/// @brief Default options for sampling omega0.
/// @details May be overridden on a helix-by-helix basis.
PerturbBundleOptionsOP default_omega0_;
/// @brief Helix-by-helix options for sampling omega0.
///
PerturbBundleOptionsOPs omega0_;
/// @brief Default options for sampling delta_omega0.
/// @details May be overridden on a helix-by-helix basis.
PerturbBundleOptionsOP default_delta_omega0_;
/// @brief Helix-by-helix options for sampling delta_omega0.
///
PerturbBundleOptionsOPs delta_omega0_;
/// @brief Default options for sampling delta_omega1.
/// @details May be overridden on a helix-by-helix basis.
PerturbBundleOptionsOP default_delta_omega1_;
/// @brief Helix-by-helix options for sampling delta_omega1.
///
PerturbBundleOptionsOPs delta_omega1_;
/// @brief Default options for sampling delta_t.
/// @details May be overridden on a helix-by-helix basis.
PerturbBundleOptionsOP default_delta_t_;
/// @brief Helix-by-helix options for sampling delta_t.
///
PerturbBundleOptionsOPs delta_t_;
/// @brief Default options for sampling z1_offset.
/// @details May be overridden on a helix-by-helix basis.
PerturbBundleOptionsOP default_z1_offset_;
/// @brief Helix-by-helix options for sampling z1_offset.
///
PerturbBundleOptionsOPs z1_offset_;
/// @brief Default options for sampling z0_offset.
/// @details May be overridden on a helix-by-helix basis.
PerturbBundleOptionsOP default_z0_offset_;
/// @brief Helix-by-helix options for sampling z0_offset.
///
PerturbBundleOptionsOPs z0_offset_;
/// @brief Default options for sampling epsilon.
/// @details May be overridden on a helix-by-helix basis.
PerturbBundleOptionsOP default_epsilon_;
/// @brief Helix-by-helix options for sampling epsilon.
///
PerturbBundleOptionsOPs epsilon_;
/// @brief A MakeBundle mover that this mover will call.
///
MakeBundleOP make_bundle_;
/// @brief Owning pointer for an (optional) pre-selection mover applied to all helical bundles before energy evaluation.
///
protocols::moves::MoverOP pre_selection_mover_;
/// @brief Bool determining whether there exists a pre-selection mover that wlil be applied.
///
bool pre_selection_mover_exists_;
/// @brief Owning pointer for an (optional) pre-selection filter applied to all helical bundles after the pre-selection mover but before
/// picking the lowest-energy solution. If PDBs are dumped, only those passing filters are dumped.
protocols::filters::FilterOP pre_selection_filter_;
/// @brief Bool determining whether a pre-selection filter has been set.
///
bool pre_selection_filter_exists_;
/// @brief Dump a PDB file for each bundle generated? False by default.
///
bool dump_pdbs_;
/// @brief PDB filename prefix. Filename will be of the form <prefix>_#####.pdb.
/// @details Defaults to "bgs_out".
std::string pdb_prefix_;
/// @brief Has the scorefunction been set?
/// @details False by default.
bool sfxn_set_;
/// @brief The scorefunction that this mover will use to pick the lowest-energy bundle.
/// @details Must be set prior to calling apply() function.
core::scoring::ScoreFunctionOP sfxn_;
private:
////////////////////////////////////////////////////////////////////////////////
// PRIVATE FUNCTIONS //
////////////////////////////////////////////////////////////////////////////////
/// @brief Is a value in a list?
///
bool is_in_list( core::Size const val, utility::vector1 < core::Size> const &list ) const;
/// @brief Calculate the number of grid points that will be sampled, based on the options set by the user.
///
core::Size calculate_total_samples() const;
}; //BundleGridSampler class
} //namespace helical_bundle
} //namespace protocols
#endif //INCLUDED_protocols_helical_bundle_BundleGridSampler_hh
| [
"achitturi17059@gmail.com"
] | achitturi17059@gmail.com |
64f0c39df22fa45c6690e415115e6cce2a0bbb73 | 9c133a261c0a5193deda08d14a0de9a9a1905999 | /firmware/Arduino-Archives/main.cpp | 4dc65c74b03c211b1642159e4b1ca09c8afb753d | [
"MIT"
] | permissive | SPARC-Auburn/SARP-Bot-Software | 1267d083dacb2e869525a8f148b940ce9be13e86 | 930e69e3d5d93ead6717ef9277aa225ae37d733c | refs/heads/master | 2020-05-18T20:49:25.689361 | 2019-06-16T20:00:41 | 2019-06-16T20:00:41 | 184,642,483 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 10,365 | cpp | #include "ros/ros.h"
#include "std_msgs/String.h"
#include "std_msgs/Float32.h"
#include "std_msgs/Int32.h"
#include <thread>
#include <unistd.h>
#include <iostream>
#include <chrono>
#include <signal.h>
#include <stdlib.h>
#include <stdio.h>
#include "opencv_node/vision_msg.h"
#include <geometry_msgs/PoseWithCovarianceStamped.h>
#include "opencv_node/object.h"
#include <move_base_msgs/MoveBaseAction.h>
#include <actionlib/client/simple_action_client.h>
#include <tf/transform_broadcaster.h>
//#include "sensor_msgs/Imu.h"
#include "Arduino-Serial/ArduinoSerial.h"
//Color Indices = red(0), yellow(1), blue(2), green(3)
using namespace std;
//serialPort arduino("/dev/serial/by-id/usb-1a86_USB2.0-Serial-if00-port0");
typedef actionlib::SimpleActionClient<move_base_msgs::MoveBaseAction> MoveBaseClient;
std_msgs::String msg;
int rightSpeed=0,leftSpeed=0;
double closestBlockX = 0.0;//add this to y for map placement
double closestBlockY = 0.0;//add this to x for map placement
int numberBlocks = 0; //number of blocks seen
double desiredColor = 0.0;
string colorSelect = "0"; //recieved startColor
int colorChoose = 0;
int goalMet = 0;
int octetNum = 0;
double dummyRobotX = 0.0;
double dummyRobotY = 0.0;
int startMatch = 0;
int loopNum = 0;
double initialPose[2] = {0.0,0.0};
int moveBaseTest = 0;
void colorSelected(const std_msgs::Float32ConstPtr &msg){
colorChoose = int(msg->data);
}
void matchStarted(const std_msgs::Float32ConstPtr &msg){
startMatch = int(msg->data);
}
double objDistance(const opencv_node::object& obj) {
return sqrt(pow(obj.x_position, 2) + pow(obj.y_position, 2));
}
void visionCallback(const opencv_node::vision_msg::ConstPtr &msg)
{
ROS_INFO("Main>>>Number of Objects: %d", msg->objects.size());
numberBlocks = msg->objects.size();
int desiredColor = 0;
double minDistance = 0.0;
int currentMin = -1;
for (int i = 0; i < msg->objects.size(); ++i)
{
const opencv_node::object &prop = msg->objects[i];
ROS_INFO_STREAM("Position: " << prop.x_position << "," << prop.y_position << " Color:" << prop.color_index << " Object Type:" << prop.object_type);
if(prop.color_index == desiredColor && (currentMin == -1 || objDistance(prop) < minDistance)) {
currentMin = i;
minDistance = objDistance(prop);
}
}
//auto closest = min_element(msg->objects.begin(),msg->objects.end(),[](const opencv_node::object &first,const opencv_node::object &second){
//return objDistance(first) < objDistance(second);
//});
if(currentMin != -1) {
closestBlockX = msg->objects[currentMin].x_position;
closestBlockY = msg->objects[currentMin].y_position;
desiredColor = msg->objects[currentMin].color_index;//not used yet
ROS_INFO_STREAM("Selected Object >>> Position: " << msg->objects[currentMin].x_position << "," << msg->objects[currentMin].y_position << " Color:" << msg->objects[currentMin].color_index << " Object Type:" << msg->objects[currentMin].object_type);
}
}
void moveFwdOneMeter(){
//MOVE BASE CODE//
int counter = 1;
MoveBaseClient ac("/move_base", true); //Tell the client we want to spin a thread by default
while(!ac.waitForServer(ros::Duration(5.0))){
ROS_INFO("Waiting for the move_base action server to come up");
}
move_base_msgs::MoveBaseGoal moveFwd;
moveFwd.target_pose.header.frame_id = "base_footprint";
moveFwd.target_pose.header.stamp = ros::Time::now();
//if(counter){
moveFwd.target_pose.pose.position.x = 0.5; //move 1 meter forward
moveFwd.target_pose.pose.orientation = tf::createQuaternionMsgFromYaw(0.0);
counter = 0;
//}
//else{
/* counter++;
moveFwd.target_pose.pose.position.x = 0.5;
moveFwd.target_pose.pose.orientation = tf::createQuaternionMsgFromYaw(-90.0);
}*/
ROS_INFO("Sending goal");
ac.sendGoal(moveFwd);
//ac.waitForResult();
//if(ac.getState() == actionlib::SimpleClientGoalState::SUCCEEDED)
// ROS_INFO("WOOP WOOP YOU DID IT");
//else
// ROS_INFO("You screwed up boi");
/////////////////
}
//Note: frame is typicall "map" or "base_footprint"
bool moveToGoal(double xGoal, double yGoal){
//define a client for to send goal requests to the move_base server through a SimpleActionClient
actionlib::SimpleActionClient<move_base_msgs::MoveBaseAction> ac("/move_base", true);
//wait for the action server to come up
while(!ac.waitForServer(ros::Duration(5.0))){
ROS_INFO("Waiting for the move_base action server to come up");
}
move_base_msgs::MoveBaseGoal goal;
//set up the frame parameters
goal.target_pose.header.frame_id = "map";
goal.target_pose.header.stamp = ros::Time::now();
/* moving towards the goal*/
goal.target_pose.pose.position.x = - xGoal;
goal.target_pose.pose.position.y = - yGoal;
goal.target_pose.pose.position.z = 0.0;
goal.target_pose.pose.orientation.x = 0.0;
goal.target_pose.pose.orientation.y = 0.0;
goal.target_pose.pose.orientation.z = 0.0;
goal.target_pose.pose.orientation.w = 1.0;
ROS_INFO("Sending goal location ...");
ac.sendGoal(goal);
if(ac.getState() == actionlib::SimpleClientGoalState::SUCCEEDED){
ROS_INFO("You have reached the destination");
goalMet = 1;
return true;
}
else{
ROS_INFO("The robot failed to reach the destination");
goalMet = 0;
return false;
}
}
// void arduinoCallback(const std_msgs::String& msg) {
// ROS_INFO_STREAM(msg << '\n');
// }
/*void imuCallback(const sensor_msgs::Imu::ConstPtr &msg)
{
float gyro_x = msg->angular_velocity.x;
float gyro_y = msg->angular_velocity.y;
float gyro_z = msg->angular_velocity.z;
float orientation_x = msg->orientation.x;
float orientation_y = msg->orientation.y;
float orientation_z = msg->orientation.z;
float orientation_w = msg->orientation.w;
//ROS_INFO("Main>>>Angular Velocity: x(%f),y(%f),z(%f)", gyro_x,gyro_y,gyro_z);
ROS_INFO("Main>>>Orientation: x(%f),y(%f),z(%f)", orientation_x, orientation_y, orientation_z);
}*/
int main(int argc, char **argv)
{
ros::init(argc, argv, "main");
ros::NodeHandle n;
ros::Subscriber sub = n.subscribe("vision_info", 1000, visionCallback);
// initPose = n.advertise<geometry_msgs::PoseWithCovarianceStamped>("initialpose",1,true);
cout << "\033[1;34m-------------------------------------------------------------------\033[0m" << endl;
cout << "\033[1;34m .:: :: .::::::: .: .::::::: .:: \033[0m" << endl;
cout << "\033[1;34m .:: .:: .:: .:: .: :: .:: .:: .:: .:: \033[0m" << endl;
cout << "\033[1;34m .:: .:: .:: .: .:: .:: .:: .:: \033[0m" << endl;
cout << "\033[1;34m .:: .::::::: .:: .:: .: .:: .:: \033[0m" << endl;
cout << "\033[1;34m .:: .:: .:::::: .:: .:: .:: .:: \033[0m" << endl;
cout << "\033[1;34m .:: .:: .:: .:: .:: .:: .:: .:: .:: \033[0m" << endl;
cout << "\033[1;34m .:: :: .:: .:: .:: .:: .:: .:::: \033[0m" << endl;
cout << "\033[1;34m-------------------------------------------------------------------\033[0m" << endl;
cout << "\033[1;34m| Student Projects and Research Committee IEEE 2019 |\033[0m" << endl;
cout << "\033[1;34m ------------------------------------------------------------------\033[0m" << endl;
sleep(1);
//ros::Subscriber sub2 = n.subscribe("sensor_msgs/Imu", 1000, imuCallback);
ros::Publisher colorSelectPub = n.advertise<std_msgs::Int32>("colorSelect",1);//this publishes data to vision shit
ros::Publisher gate_cmd = n.advertise<std_msgs::Int32>("gate_cmd",1);
ros::Publisher flag_cmd = n.advertise<std_msgs::Int32>("flag_cmd",1);
ros::Publisher color_Want = n.advertise<std_msgs::Float32>("color_want",1);
ros::Subscriber startColorSub = n.subscribe<std_msgs::Float32>("start_color", 1, colorSelected);
ros::Subscriber startMatchSub = n.subscribe<std_msgs::Float32>("start_match", 1, matchStarted);
ros::Rate loop_rate(40); //1 Hz
//geometry_msgs::PoseWithCovarianceStamped ip;
//ip.header.frame_id = "map";
ros::Time current_time = ros::Time::now();
/*ip.header.stamp = current_time;
ip.pose.pose.position.x = 0.1143;
ip.pose.pose.position.y = 0.1143;
ip.pose.pose.orientation.z = 0;
ip.pose.covariance[0] = 1e-3;
ip.pose.covariance[7] = 1e-3;
ip.pose.covariance[35] = 1e-3;
initPose.publish(ip);
*/
int count = 0;
bool done = 0;
double myGoalX[8] = {0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0};
double myGoalY[8] = {0.0,0.0,0.0,0.0,0.0,0.0,0.0,0.0};//set these according to the new map locations
while(ros::ok()) {
msg.data = std::string("Hello ");
msg.data += std::to_string(count);
//this sets the selected
//this tests the octet and debris goal setting
if(startMatch == 1){ //only runs on second button press
if(octetNum == 0){//first start location setting
moveToGoal(myGoalX[octetNum],myGoalY[octetNum]);//go to initial octet
if(goalMet){octetNum++;}
}
//check to see if any blocks in view, if so go to them.
if(numberBlocks > 0 && octetNum != 0){
gate_cmd.publish(75);//open gate
moveToGoal(dummyRobotX+closestBlockY+0.11,dummyRobotY+closestBlockX);//location reference to map, .11 is roughly half the width of the robot
//to compensate for camera offset,,this waits until the robot has met its goal
//also this moves to collect all blocks
if(goalMet){octetNum++;}
}
else if(numberBlocks == 0 && abs(dummyRobotX-myGoalX[octetNum+1])>0.2 && abs(dummyRobotY-myGoalY[octetNum+1])<0.2){ //checks to see if goal is too close to current position, 20 is arbitrary
gate_cmd.publish(20);//close Gate
octetNum++;
}
else{
moveToGoal(myGoalX[octetNum],myGoalY[octetNum]);
}
if(octetNum == 8){octetNum = 0;loopNum++;color_Want.publish(colorChoose++);}
if(loopNum == 3){
moveToGoal(initialPose[0],initialPose[1]);//go back to start position
if(goalMet){octetNum++;loopNum = 0; flag_cmd.publish(40);}
}
}
if(moveBaseTest == 0){
moveBaseTest++;
moveToGoal(-0.5,0);
//moveFwdOneMeter();
}
ros::spinOnce();
loop_rate.sleep();
++count;
}
return 0;
}
| [
"mtc0030@auburn.edu"
] | mtc0030@auburn.edu |
81f2c406186f8502117fb841095fc8b80aae2df4 | 5c7dfe924c97e606e69811089618b4402a8046bc | /src/ext/Bootstrap/Bootstrap_helper_container_3.cpp | ac0f3bea203c67a5da6827c8e846096707365d3c | [
"MIT"
] | permissive | QiaoKes/UDRefl | 837f857163cd0f4b36cab0d63816d6f301daaf91 | fde9b36bb07fbbfa58a409a0373c5ca6c417a73f | refs/heads/master | 2023-03-22T11:01:13.587413 | 2021-03-05T14:07:52 | 2021-03-05T14:07:52 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 208 | cpp | #include "Bootstrap_helper.h"
using namespace Ubpa;
using namespace Ubpa::UDRefl;
void Ubpa::UDRefl::ext::details::Bootstrap_helper_container_3() {
Mngr->RegisterType<std::vector<InfoTypeMethodPair>>();
}
| [
"ustczt@mail.ustc.edu.cn"
] | ustczt@mail.ustc.edu.cn |
728ea94d10238487b42882ee2d0fa44837765b32 | 641fa8341d8c436ad24945bcbf8e7d7d1dd7dbb2 | /third_party/WebKit/Source/web/FrameLoaderClientImpl.h | 3ddbeaaa5fbb8b374465c2a16e53bdf9be12cc6c | [
"LGPL-2.0-or-later",
"LicenseRef-scancode-warranty-disclaimer",
"LGPL-2.1-only",
"GPL-1.0-or-later",
"GPL-2.0-only",
"LGPL-2.0-only",
"BSD-2-Clause",
"LicenseRef-scancode-other-copyleft",
"MIT",
"Apache-2.0",
"BSD-3-Clause"
] | permissive | massnetwork/mass-browser | 7de0dfc541cbac00ffa7308541394bac1e945b76 | 67526da9358734698c067b7775be491423884339 | refs/heads/master | 2022-12-07T09:01:31.027715 | 2017-01-19T14:29:18 | 2017-01-19T14:29:18 | 73,799,690 | 4 | 4 | BSD-3-Clause | 2022-11-26T11:53:23 | 2016-11-15T09:49:29 | null | UTF-8 | C++ | false | false | 11,086 | h | /*
* Copyright (C) 2009, 2012 Google Inc. All rights reserved.
* Copyright (C) 2011 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef FrameLoaderClientImpl_h
#define FrameLoaderClientImpl_h
#include "core/loader/FrameLoaderClient.h"
#include "platform/heap/Handle.h"
#include "platform/weborigin/KURL.h"
#include "public/platform/WebInsecureRequestPolicy.h"
#include "wtf/RefPtr.h"
#include <memory>
namespace blink {
class WebDevToolsAgentImpl;
class WebLocalFrameImpl;
class FrameLoaderClientImpl final : public FrameLoaderClient {
public:
static FrameLoaderClientImpl* create(WebLocalFrameImpl*);
~FrameLoaderClientImpl() override;
DECLARE_VIRTUAL_TRACE();
WebLocalFrameImpl* webFrame() const { return m_webFrame.get(); }
// FrameLoaderClient ----------------------------------------------
void didCreateNewDocument() override;
// Notifies the WebView delegate that the JS window object has been cleared,
// giving it a chance to bind native objects to the window before script
// parsing begins.
void dispatchDidClearWindowObjectInMainWorld() override;
void documentElementAvailable() override;
void runScriptsAtDocumentElementAvailable() override;
void runScriptsAtDocumentReady(bool documentIsEmpty) override;
void didCreateScriptContext(v8::Local<v8::Context>,
int extensionGroup,
int worldId) override;
void willReleaseScriptContext(v8::Local<v8::Context>, int worldId) override;
// Returns true if we should allow the given V8 extension to be added to
// the script context at the currently loading page and given extension group.
bool allowScriptExtension(const String& extensionName,
int extensionGroup,
int worldId) override;
bool hasWebView() const override;
bool inShadowTree() const override;
Frame* opener() const override;
void setOpener(Frame*) override;
Frame* parent() const override;
Frame* top() const override;
Frame* nextSibling() const override;
Frame* firstChild() const override;
void willBeDetached() override;
void detached(FrameDetachType) override;
void dispatchWillSendRequest(ResourceRequest&) override;
void dispatchDidReceiveResponse(const ResourceResponse&) override;
void dispatchDidLoadResourceFromMemoryCache(const ResourceRequest&,
const ResourceResponse&) override;
void dispatchDidHandleOnloadEvents() override;
void dispatchDidReceiveServerRedirectForProvisionalLoad() override;
void dispatchDidNavigateWithinPage(HistoryItem*,
HistoryCommitType,
bool contentInitiated) override;
void dispatchWillCommitProvisionalLoad() override;
void dispatchDidStartProvisionalLoad() override;
void dispatchDidReceiveTitle(const String&) override;
void dispatchDidChangeIcons(IconType) override;
void dispatchDidCommitLoad(HistoryItem*, HistoryCommitType) override;
void dispatchDidFailProvisionalLoad(const ResourceError&,
HistoryCommitType) override;
void dispatchDidFailLoad(const ResourceError&, HistoryCommitType) override;
void dispatchDidFinishDocumentLoad() override;
void dispatchDidFinishLoad() override;
void dispatchDidChangeThemeColor() override;
NavigationPolicy decidePolicyForNavigation(const ResourceRequest&,
DocumentLoader*,
NavigationType,
NavigationPolicy,
bool shouldReplaceCurrentEntry,
bool isClientRedirect,
HTMLFormElement*) override;
void dispatchWillSendSubmitEvent(HTMLFormElement*) override;
void dispatchWillSubmitForm(HTMLFormElement*) override;
void didStartLoading(LoadStartType) override;
void didStopLoading() override;
void progressEstimateChanged(double progressEstimate) override;
void loadURLExternally(const ResourceRequest&,
NavigationPolicy,
const String& suggestedName,
bool shouldReplaceCurrentEntry) override;
void loadErrorPage(int reason) override;
bool navigateBackForward(int offset) const override;
void didAccessInitialDocument() override;
void didDisplayInsecureContent() override;
void didRunInsecureContent(SecurityOrigin*, const KURL& insecureURL) override;
void didDetectXSS(const KURL&, bool didBlockEntirePage) override;
void didDispatchPingLoader(const KURL&) override;
void didDisplayContentWithCertificateErrors(const KURL&) override;
void didRunContentWithCertificateErrors(const KURL&) override;
void didChangePerformanceTiming() override;
void didObserveLoadingBehavior(WebLoadingBehaviorFlag) override;
void selectorMatchChanged(const Vector<String>& addedSelectors,
const Vector<String>& removedSelectors) override;
DocumentLoader* createDocumentLoader(LocalFrame*,
const ResourceRequest&,
const SubstituteData&,
ClientRedirectPolicy) override;
WTF::String userAgent() override;
WTF::String doNotTrackValue() override;
void transitionToCommittedForNewPage() override;
LocalFrame* createFrame(const FrameLoadRequest&,
const WTF::AtomicString& name,
HTMLFrameOwnerElement*) override;
virtual bool canCreatePluginWithoutRenderer(const String& mimeType) const;
Widget* createPlugin(HTMLPlugInElement*,
const KURL&,
const Vector<WTF::String>&,
const Vector<WTF::String>&,
const WTF::String&,
bool loadManually,
DetachedPluginPolicy) override;
std::unique_ptr<WebMediaPlayer> createWebMediaPlayer(
HTMLMediaElement&,
const WebMediaPlayerSource&,
WebMediaPlayerClient*) override;
WebRemotePlaybackClient* createWebRemotePlaybackClient(
HTMLMediaElement&) override;
ObjectContentType getObjectContentType(
const KURL&,
const WTF::String& mimeType,
bool shouldPreferPlugInsForImages) override;
void didChangeScrollOffset() override;
void didUpdateCurrentHistoryItem() override;
bool allowScript(bool enabledPerSettings) override;
bool allowScriptFromSource(bool enabledPerSettings,
const KURL& scriptURL) override;
bool allowPlugins(bool enabledPerSettings) override;
bool allowImage(bool enabledPerSettings, const KURL& imageURL) override;
bool allowRunningInsecureContent(bool enabledPerSettings,
SecurityOrigin*,
const KURL&) override;
bool allowAutoplay(bool defaultValue) override;
void passiveInsecureContentFound(const KURL&) override;
void didNotAllowScript() override;
void didNotAllowPlugins() override;
void didUseKeygen() override;
WebCookieJar* cookieJar() const override;
void frameFocused() const override;
void didChangeName(const String& name, const String& uniqueName) override;
void didEnforceInsecureRequestPolicy(WebInsecureRequestPolicy) override;
void didUpdateToUniqueOrigin() override;
void didChangeSandboxFlags(Frame* childFrame, SandboxFlags) override;
void didSetFeaturePolicyHeader(const String& headerValue) override;
void didAddContentSecurityPolicy(const String& headerValue,
ContentSecurityPolicyHeaderType,
ContentSecurityPolicyHeaderSource) override;
void didChangeFrameOwnerProperties(HTMLFrameElementBase*) override;
void dispatchWillStartUsingPeerConnectionHandler(
WebRTCPeerConnectionHandler*) override;
bool allowWebGL(bool enabledPerSettings) override;
void dispatchWillInsertBody() override;
std::unique_ptr<WebServiceWorkerProvider> createServiceWorkerProvider()
override;
bool isControlledByServiceWorker(DocumentLoader&) override;
int64_t serviceWorkerID(DocumentLoader&) override;
SharedWorkerRepositoryClient* sharedWorkerRepositoryClient() override;
std::unique_ptr<WebApplicationCacheHost> createApplicationCacheHost(
WebApplicationCacheHostClient*) override;
void dispatchDidChangeManifest() override;
unsigned backForwardLength() override;
void suddenTerminationDisablerChanged(bool present,
SuddenTerminationDisablerType) override;
BlameContext* frameBlameContext() override;
LinkResource* createServiceWorkerLinkResource(HTMLLinkElement*) override;
WebEffectiveConnectionType getEffectiveConnectionType() override;
KURL overrideFlashEmbedWithHTML(const KURL&) override;
private:
explicit FrameLoaderClientImpl(WebLocalFrameImpl*);
bool isFrameLoaderClientImpl() const override { return true; }
WebDevToolsAgentImpl* devToolsAgent();
// The WebFrame that owns this object and manages its lifetime. Therefore,
// the web frame object is guaranteed to exist.
Member<WebLocalFrameImpl> m_webFrame;
String m_userAgent;
};
DEFINE_TYPE_CASTS(FrameLoaderClientImpl,
FrameLoaderClient,
client,
client->isFrameLoaderClientImpl(),
client.isFrameLoaderClientImpl());
} // namespace blink
#endif
| [
"xElvis89x@gmail.com"
] | xElvis89x@gmail.com |
1ced70494a2cd8aede3b74ca4ec3993ddf11cc76 | 0e31e2489cd915d15c08eec651d1f549eb8923ea | /Engine/Source/Challenge/UI/Util/Platform/Win32/FileDialogWin32.h | 7500ced5bf0ea04613a777ccb629438a18c14c25 | [] | no_license | metsfan/challenge-engine | 4c2f9eb13d62c33b23e92f47a58f1169082da786 | 9c36cd134936fa4b1a0c7451e683bbef27dc6288 | refs/heads/master | 2021-01-01T15:18:26.750423 | 2014-10-07T13:33:59 | 2014-10-07T13:33:59 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 376 | h | #pragma once
#include <Challenge/Challenge.h>
#include <Challenge/UI/Util/FileDialog.h>
namespace challenge
{
template<>
class _FileDialog<PlatformTypeWin32>
{
public:
static std::vector<std::wstring> OpenFileDialog(OPEN_FILE_DIALOG_DESC desc = OPEN_FILE_DIALOG_DESC());
static std::wstring SaveFileDialog(SAVE_FILE_DIALOG_DESC desc = SAVE_FILE_DIALOG_DESC());
};
} | [
"aeskreis@gmail.com"
] | aeskreis@gmail.com |
acc2f72f322f7ecde6577b9b4db3220a0768afc4 | 69b32b79c7a62590b1e21ac98e3475be1e19a912 | /contrib/autoboost/autoboost/preprocessor/repetition/detail/dmc/for.hpp | 9d14a8891dc97a8da84060d622217d7ee27c3327 | [
"Apache-2.0"
] | permissive | codemercenary/autowiring | 636596d1ece37ea75003cd5180299c4adc070869 | b2775e86cd29fc3e9bc50f3f5f9e735efdbcff21 | refs/heads/master | 2020-12-25T00:29:08.143286 | 2016-08-19T23:49:16 | 2016-08-19T23:49:16 | 22,248,790 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 83,659 | hpp | # /* Copyright (C) 2001
# * Housemarque Oy
# * http://www.housemarque.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)
# */
#
# /* Revised by Paul Mensonides (2002) */
#
# /* See http://www.boost.org for most recent version. */
#
# ifndef AUTOBOOST_PREPROCESSOR_REPETITION_DETAIL_FOR_HPP
# define AUTOBOOST_PREPROCESSOR_REPETITION_DETAIL_FOR_HPP
#
# include <autoboost/preprocessor/control/expr_iif.hpp>
# include <autoboost/preprocessor/control/iif.hpp>
# include <autoboost/preprocessor/logical/bool.hpp>
# include <autoboost/preprocessor/tuple/eat.hpp>
#
# define AUTOBOOST_PP_FOR_1(s, p, o, m) AUTOBOOST_PP_FOR_1_C(AUTOBOOST_PP_BOOL(p##(2, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_2(s, p, o, m) AUTOBOOST_PP_FOR_2_C(AUTOBOOST_PP_BOOL(p##(3, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_3(s, p, o, m) AUTOBOOST_PP_FOR_3_C(AUTOBOOST_PP_BOOL(p##(4, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_4(s, p, o, m) AUTOBOOST_PP_FOR_4_C(AUTOBOOST_PP_BOOL(p##(5, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_5(s, p, o, m) AUTOBOOST_PP_FOR_5_C(AUTOBOOST_PP_BOOL(p##(6, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_6(s, p, o, m) AUTOBOOST_PP_FOR_6_C(AUTOBOOST_PP_BOOL(p##(7, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_7(s, p, o, m) AUTOBOOST_PP_FOR_7_C(AUTOBOOST_PP_BOOL(p##(8, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_8(s, p, o, m) AUTOBOOST_PP_FOR_8_C(AUTOBOOST_PP_BOOL(p##(9, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_9(s, p, o, m) AUTOBOOST_PP_FOR_9_C(AUTOBOOST_PP_BOOL(p##(10, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_10(s, p, o, m) AUTOBOOST_PP_FOR_10_C(AUTOBOOST_PP_BOOL(p##(11, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_11(s, p, o, m) AUTOBOOST_PP_FOR_11_C(AUTOBOOST_PP_BOOL(p##(12, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_12(s, p, o, m) AUTOBOOST_PP_FOR_12_C(AUTOBOOST_PP_BOOL(p##(13, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_13(s, p, o, m) AUTOBOOST_PP_FOR_13_C(AUTOBOOST_PP_BOOL(p##(14, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_14(s, p, o, m) AUTOBOOST_PP_FOR_14_C(AUTOBOOST_PP_BOOL(p##(15, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_15(s, p, o, m) AUTOBOOST_PP_FOR_15_C(AUTOBOOST_PP_BOOL(p##(16, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_16(s, p, o, m) AUTOBOOST_PP_FOR_16_C(AUTOBOOST_PP_BOOL(p##(17, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_17(s, p, o, m) AUTOBOOST_PP_FOR_17_C(AUTOBOOST_PP_BOOL(p##(18, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_18(s, p, o, m) AUTOBOOST_PP_FOR_18_C(AUTOBOOST_PP_BOOL(p##(19, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_19(s, p, o, m) AUTOBOOST_PP_FOR_19_C(AUTOBOOST_PP_BOOL(p##(20, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_20(s, p, o, m) AUTOBOOST_PP_FOR_20_C(AUTOBOOST_PP_BOOL(p##(21, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_21(s, p, o, m) AUTOBOOST_PP_FOR_21_C(AUTOBOOST_PP_BOOL(p##(22, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_22(s, p, o, m) AUTOBOOST_PP_FOR_22_C(AUTOBOOST_PP_BOOL(p##(23, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_23(s, p, o, m) AUTOBOOST_PP_FOR_23_C(AUTOBOOST_PP_BOOL(p##(24, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_24(s, p, o, m) AUTOBOOST_PP_FOR_24_C(AUTOBOOST_PP_BOOL(p##(25, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_25(s, p, o, m) AUTOBOOST_PP_FOR_25_C(AUTOBOOST_PP_BOOL(p##(26, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_26(s, p, o, m) AUTOBOOST_PP_FOR_26_C(AUTOBOOST_PP_BOOL(p##(27, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_27(s, p, o, m) AUTOBOOST_PP_FOR_27_C(AUTOBOOST_PP_BOOL(p##(28, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_28(s, p, o, m) AUTOBOOST_PP_FOR_28_C(AUTOBOOST_PP_BOOL(p##(29, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_29(s, p, o, m) AUTOBOOST_PP_FOR_29_C(AUTOBOOST_PP_BOOL(p##(30, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_30(s, p, o, m) AUTOBOOST_PP_FOR_30_C(AUTOBOOST_PP_BOOL(p##(31, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_31(s, p, o, m) AUTOBOOST_PP_FOR_31_C(AUTOBOOST_PP_BOOL(p##(32, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_32(s, p, o, m) AUTOBOOST_PP_FOR_32_C(AUTOBOOST_PP_BOOL(p##(33, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_33(s, p, o, m) AUTOBOOST_PP_FOR_33_C(AUTOBOOST_PP_BOOL(p##(34, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_34(s, p, o, m) AUTOBOOST_PP_FOR_34_C(AUTOBOOST_PP_BOOL(p##(35, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_35(s, p, o, m) AUTOBOOST_PP_FOR_35_C(AUTOBOOST_PP_BOOL(p##(36, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_36(s, p, o, m) AUTOBOOST_PP_FOR_36_C(AUTOBOOST_PP_BOOL(p##(37, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_37(s, p, o, m) AUTOBOOST_PP_FOR_37_C(AUTOBOOST_PP_BOOL(p##(38, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_38(s, p, o, m) AUTOBOOST_PP_FOR_38_C(AUTOBOOST_PP_BOOL(p##(39, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_39(s, p, o, m) AUTOBOOST_PP_FOR_39_C(AUTOBOOST_PP_BOOL(p##(40, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_40(s, p, o, m) AUTOBOOST_PP_FOR_40_C(AUTOBOOST_PP_BOOL(p##(41, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_41(s, p, o, m) AUTOBOOST_PP_FOR_41_C(AUTOBOOST_PP_BOOL(p##(42, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_42(s, p, o, m) AUTOBOOST_PP_FOR_42_C(AUTOBOOST_PP_BOOL(p##(43, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_43(s, p, o, m) AUTOBOOST_PP_FOR_43_C(AUTOBOOST_PP_BOOL(p##(44, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_44(s, p, o, m) AUTOBOOST_PP_FOR_44_C(AUTOBOOST_PP_BOOL(p##(45, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_45(s, p, o, m) AUTOBOOST_PP_FOR_45_C(AUTOBOOST_PP_BOOL(p##(46, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_46(s, p, o, m) AUTOBOOST_PP_FOR_46_C(AUTOBOOST_PP_BOOL(p##(47, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_47(s, p, o, m) AUTOBOOST_PP_FOR_47_C(AUTOBOOST_PP_BOOL(p##(48, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_48(s, p, o, m) AUTOBOOST_PP_FOR_48_C(AUTOBOOST_PP_BOOL(p##(49, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_49(s, p, o, m) AUTOBOOST_PP_FOR_49_C(AUTOBOOST_PP_BOOL(p##(50, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_50(s, p, o, m) AUTOBOOST_PP_FOR_50_C(AUTOBOOST_PP_BOOL(p##(51, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_51(s, p, o, m) AUTOBOOST_PP_FOR_51_C(AUTOBOOST_PP_BOOL(p##(52, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_52(s, p, o, m) AUTOBOOST_PP_FOR_52_C(AUTOBOOST_PP_BOOL(p##(53, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_53(s, p, o, m) AUTOBOOST_PP_FOR_53_C(AUTOBOOST_PP_BOOL(p##(54, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_54(s, p, o, m) AUTOBOOST_PP_FOR_54_C(AUTOBOOST_PP_BOOL(p##(55, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_55(s, p, o, m) AUTOBOOST_PP_FOR_55_C(AUTOBOOST_PP_BOOL(p##(56, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_56(s, p, o, m) AUTOBOOST_PP_FOR_56_C(AUTOBOOST_PP_BOOL(p##(57, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_57(s, p, o, m) AUTOBOOST_PP_FOR_57_C(AUTOBOOST_PP_BOOL(p##(58, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_58(s, p, o, m) AUTOBOOST_PP_FOR_58_C(AUTOBOOST_PP_BOOL(p##(59, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_59(s, p, o, m) AUTOBOOST_PP_FOR_59_C(AUTOBOOST_PP_BOOL(p##(60, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_60(s, p, o, m) AUTOBOOST_PP_FOR_60_C(AUTOBOOST_PP_BOOL(p##(61, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_61(s, p, o, m) AUTOBOOST_PP_FOR_61_C(AUTOBOOST_PP_BOOL(p##(62, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_62(s, p, o, m) AUTOBOOST_PP_FOR_62_C(AUTOBOOST_PP_BOOL(p##(63, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_63(s, p, o, m) AUTOBOOST_PP_FOR_63_C(AUTOBOOST_PP_BOOL(p##(64, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_64(s, p, o, m) AUTOBOOST_PP_FOR_64_C(AUTOBOOST_PP_BOOL(p##(65, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_65(s, p, o, m) AUTOBOOST_PP_FOR_65_C(AUTOBOOST_PP_BOOL(p##(66, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_66(s, p, o, m) AUTOBOOST_PP_FOR_66_C(AUTOBOOST_PP_BOOL(p##(67, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_67(s, p, o, m) AUTOBOOST_PP_FOR_67_C(AUTOBOOST_PP_BOOL(p##(68, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_68(s, p, o, m) AUTOBOOST_PP_FOR_68_C(AUTOBOOST_PP_BOOL(p##(69, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_69(s, p, o, m) AUTOBOOST_PP_FOR_69_C(AUTOBOOST_PP_BOOL(p##(70, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_70(s, p, o, m) AUTOBOOST_PP_FOR_70_C(AUTOBOOST_PP_BOOL(p##(71, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_71(s, p, o, m) AUTOBOOST_PP_FOR_71_C(AUTOBOOST_PP_BOOL(p##(72, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_72(s, p, o, m) AUTOBOOST_PP_FOR_72_C(AUTOBOOST_PP_BOOL(p##(73, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_73(s, p, o, m) AUTOBOOST_PP_FOR_73_C(AUTOBOOST_PP_BOOL(p##(74, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_74(s, p, o, m) AUTOBOOST_PP_FOR_74_C(AUTOBOOST_PP_BOOL(p##(75, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_75(s, p, o, m) AUTOBOOST_PP_FOR_75_C(AUTOBOOST_PP_BOOL(p##(76, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_76(s, p, o, m) AUTOBOOST_PP_FOR_76_C(AUTOBOOST_PP_BOOL(p##(77, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_77(s, p, o, m) AUTOBOOST_PP_FOR_77_C(AUTOBOOST_PP_BOOL(p##(78, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_78(s, p, o, m) AUTOBOOST_PP_FOR_78_C(AUTOBOOST_PP_BOOL(p##(79, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_79(s, p, o, m) AUTOBOOST_PP_FOR_79_C(AUTOBOOST_PP_BOOL(p##(80, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_80(s, p, o, m) AUTOBOOST_PP_FOR_80_C(AUTOBOOST_PP_BOOL(p##(81, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_81(s, p, o, m) AUTOBOOST_PP_FOR_81_C(AUTOBOOST_PP_BOOL(p##(82, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_82(s, p, o, m) AUTOBOOST_PP_FOR_82_C(AUTOBOOST_PP_BOOL(p##(83, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_83(s, p, o, m) AUTOBOOST_PP_FOR_83_C(AUTOBOOST_PP_BOOL(p##(84, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_84(s, p, o, m) AUTOBOOST_PP_FOR_84_C(AUTOBOOST_PP_BOOL(p##(85, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_85(s, p, o, m) AUTOBOOST_PP_FOR_85_C(AUTOBOOST_PP_BOOL(p##(86, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_86(s, p, o, m) AUTOBOOST_PP_FOR_86_C(AUTOBOOST_PP_BOOL(p##(87, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_87(s, p, o, m) AUTOBOOST_PP_FOR_87_C(AUTOBOOST_PP_BOOL(p##(88, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_88(s, p, o, m) AUTOBOOST_PP_FOR_88_C(AUTOBOOST_PP_BOOL(p##(89, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_89(s, p, o, m) AUTOBOOST_PP_FOR_89_C(AUTOBOOST_PP_BOOL(p##(90, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_90(s, p, o, m) AUTOBOOST_PP_FOR_90_C(AUTOBOOST_PP_BOOL(p##(91, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_91(s, p, o, m) AUTOBOOST_PP_FOR_91_C(AUTOBOOST_PP_BOOL(p##(92, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_92(s, p, o, m) AUTOBOOST_PP_FOR_92_C(AUTOBOOST_PP_BOOL(p##(93, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_93(s, p, o, m) AUTOBOOST_PP_FOR_93_C(AUTOBOOST_PP_BOOL(p##(94, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_94(s, p, o, m) AUTOBOOST_PP_FOR_94_C(AUTOBOOST_PP_BOOL(p##(95, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_95(s, p, o, m) AUTOBOOST_PP_FOR_95_C(AUTOBOOST_PP_BOOL(p##(96, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_96(s, p, o, m) AUTOBOOST_PP_FOR_96_C(AUTOBOOST_PP_BOOL(p##(97, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_97(s, p, o, m) AUTOBOOST_PP_FOR_97_C(AUTOBOOST_PP_BOOL(p##(98, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_98(s, p, o, m) AUTOBOOST_PP_FOR_98_C(AUTOBOOST_PP_BOOL(p##(99, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_99(s, p, o, m) AUTOBOOST_PP_FOR_99_C(AUTOBOOST_PP_BOOL(p##(100, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_100(s, p, o, m) AUTOBOOST_PP_FOR_100_C(AUTOBOOST_PP_BOOL(p##(101, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_101(s, p, o, m) AUTOBOOST_PP_FOR_101_C(AUTOBOOST_PP_BOOL(p##(102, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_102(s, p, o, m) AUTOBOOST_PP_FOR_102_C(AUTOBOOST_PP_BOOL(p##(103, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_103(s, p, o, m) AUTOBOOST_PP_FOR_103_C(AUTOBOOST_PP_BOOL(p##(104, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_104(s, p, o, m) AUTOBOOST_PP_FOR_104_C(AUTOBOOST_PP_BOOL(p##(105, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_105(s, p, o, m) AUTOBOOST_PP_FOR_105_C(AUTOBOOST_PP_BOOL(p##(106, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_106(s, p, o, m) AUTOBOOST_PP_FOR_106_C(AUTOBOOST_PP_BOOL(p##(107, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_107(s, p, o, m) AUTOBOOST_PP_FOR_107_C(AUTOBOOST_PP_BOOL(p##(108, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_108(s, p, o, m) AUTOBOOST_PP_FOR_108_C(AUTOBOOST_PP_BOOL(p##(109, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_109(s, p, o, m) AUTOBOOST_PP_FOR_109_C(AUTOBOOST_PP_BOOL(p##(110, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_110(s, p, o, m) AUTOBOOST_PP_FOR_110_C(AUTOBOOST_PP_BOOL(p##(111, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_111(s, p, o, m) AUTOBOOST_PP_FOR_111_C(AUTOBOOST_PP_BOOL(p##(112, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_112(s, p, o, m) AUTOBOOST_PP_FOR_112_C(AUTOBOOST_PP_BOOL(p##(113, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_113(s, p, o, m) AUTOBOOST_PP_FOR_113_C(AUTOBOOST_PP_BOOL(p##(114, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_114(s, p, o, m) AUTOBOOST_PP_FOR_114_C(AUTOBOOST_PP_BOOL(p##(115, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_115(s, p, o, m) AUTOBOOST_PP_FOR_115_C(AUTOBOOST_PP_BOOL(p##(116, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_116(s, p, o, m) AUTOBOOST_PP_FOR_116_C(AUTOBOOST_PP_BOOL(p##(117, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_117(s, p, o, m) AUTOBOOST_PP_FOR_117_C(AUTOBOOST_PP_BOOL(p##(118, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_118(s, p, o, m) AUTOBOOST_PP_FOR_118_C(AUTOBOOST_PP_BOOL(p##(119, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_119(s, p, o, m) AUTOBOOST_PP_FOR_119_C(AUTOBOOST_PP_BOOL(p##(120, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_120(s, p, o, m) AUTOBOOST_PP_FOR_120_C(AUTOBOOST_PP_BOOL(p##(121, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_121(s, p, o, m) AUTOBOOST_PP_FOR_121_C(AUTOBOOST_PP_BOOL(p##(122, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_122(s, p, o, m) AUTOBOOST_PP_FOR_122_C(AUTOBOOST_PP_BOOL(p##(123, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_123(s, p, o, m) AUTOBOOST_PP_FOR_123_C(AUTOBOOST_PP_BOOL(p##(124, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_124(s, p, o, m) AUTOBOOST_PP_FOR_124_C(AUTOBOOST_PP_BOOL(p##(125, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_125(s, p, o, m) AUTOBOOST_PP_FOR_125_C(AUTOBOOST_PP_BOOL(p##(126, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_126(s, p, o, m) AUTOBOOST_PP_FOR_126_C(AUTOBOOST_PP_BOOL(p##(127, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_127(s, p, o, m) AUTOBOOST_PP_FOR_127_C(AUTOBOOST_PP_BOOL(p##(128, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_128(s, p, o, m) AUTOBOOST_PP_FOR_128_C(AUTOBOOST_PP_BOOL(p##(129, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_129(s, p, o, m) AUTOBOOST_PP_FOR_129_C(AUTOBOOST_PP_BOOL(p##(130, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_130(s, p, o, m) AUTOBOOST_PP_FOR_130_C(AUTOBOOST_PP_BOOL(p##(131, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_131(s, p, o, m) AUTOBOOST_PP_FOR_131_C(AUTOBOOST_PP_BOOL(p##(132, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_132(s, p, o, m) AUTOBOOST_PP_FOR_132_C(AUTOBOOST_PP_BOOL(p##(133, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_133(s, p, o, m) AUTOBOOST_PP_FOR_133_C(AUTOBOOST_PP_BOOL(p##(134, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_134(s, p, o, m) AUTOBOOST_PP_FOR_134_C(AUTOBOOST_PP_BOOL(p##(135, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_135(s, p, o, m) AUTOBOOST_PP_FOR_135_C(AUTOBOOST_PP_BOOL(p##(136, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_136(s, p, o, m) AUTOBOOST_PP_FOR_136_C(AUTOBOOST_PP_BOOL(p##(137, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_137(s, p, o, m) AUTOBOOST_PP_FOR_137_C(AUTOBOOST_PP_BOOL(p##(138, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_138(s, p, o, m) AUTOBOOST_PP_FOR_138_C(AUTOBOOST_PP_BOOL(p##(139, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_139(s, p, o, m) AUTOBOOST_PP_FOR_139_C(AUTOBOOST_PP_BOOL(p##(140, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_140(s, p, o, m) AUTOBOOST_PP_FOR_140_C(AUTOBOOST_PP_BOOL(p##(141, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_141(s, p, o, m) AUTOBOOST_PP_FOR_141_C(AUTOBOOST_PP_BOOL(p##(142, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_142(s, p, o, m) AUTOBOOST_PP_FOR_142_C(AUTOBOOST_PP_BOOL(p##(143, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_143(s, p, o, m) AUTOBOOST_PP_FOR_143_C(AUTOBOOST_PP_BOOL(p##(144, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_144(s, p, o, m) AUTOBOOST_PP_FOR_144_C(AUTOBOOST_PP_BOOL(p##(145, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_145(s, p, o, m) AUTOBOOST_PP_FOR_145_C(AUTOBOOST_PP_BOOL(p##(146, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_146(s, p, o, m) AUTOBOOST_PP_FOR_146_C(AUTOBOOST_PP_BOOL(p##(147, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_147(s, p, o, m) AUTOBOOST_PP_FOR_147_C(AUTOBOOST_PP_BOOL(p##(148, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_148(s, p, o, m) AUTOBOOST_PP_FOR_148_C(AUTOBOOST_PP_BOOL(p##(149, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_149(s, p, o, m) AUTOBOOST_PP_FOR_149_C(AUTOBOOST_PP_BOOL(p##(150, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_150(s, p, o, m) AUTOBOOST_PP_FOR_150_C(AUTOBOOST_PP_BOOL(p##(151, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_151(s, p, o, m) AUTOBOOST_PP_FOR_151_C(AUTOBOOST_PP_BOOL(p##(152, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_152(s, p, o, m) AUTOBOOST_PP_FOR_152_C(AUTOBOOST_PP_BOOL(p##(153, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_153(s, p, o, m) AUTOBOOST_PP_FOR_153_C(AUTOBOOST_PP_BOOL(p##(154, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_154(s, p, o, m) AUTOBOOST_PP_FOR_154_C(AUTOBOOST_PP_BOOL(p##(155, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_155(s, p, o, m) AUTOBOOST_PP_FOR_155_C(AUTOBOOST_PP_BOOL(p##(156, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_156(s, p, o, m) AUTOBOOST_PP_FOR_156_C(AUTOBOOST_PP_BOOL(p##(157, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_157(s, p, o, m) AUTOBOOST_PP_FOR_157_C(AUTOBOOST_PP_BOOL(p##(158, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_158(s, p, o, m) AUTOBOOST_PP_FOR_158_C(AUTOBOOST_PP_BOOL(p##(159, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_159(s, p, o, m) AUTOBOOST_PP_FOR_159_C(AUTOBOOST_PP_BOOL(p##(160, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_160(s, p, o, m) AUTOBOOST_PP_FOR_160_C(AUTOBOOST_PP_BOOL(p##(161, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_161(s, p, o, m) AUTOBOOST_PP_FOR_161_C(AUTOBOOST_PP_BOOL(p##(162, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_162(s, p, o, m) AUTOBOOST_PP_FOR_162_C(AUTOBOOST_PP_BOOL(p##(163, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_163(s, p, o, m) AUTOBOOST_PP_FOR_163_C(AUTOBOOST_PP_BOOL(p##(164, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_164(s, p, o, m) AUTOBOOST_PP_FOR_164_C(AUTOBOOST_PP_BOOL(p##(165, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_165(s, p, o, m) AUTOBOOST_PP_FOR_165_C(AUTOBOOST_PP_BOOL(p##(166, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_166(s, p, o, m) AUTOBOOST_PP_FOR_166_C(AUTOBOOST_PP_BOOL(p##(167, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_167(s, p, o, m) AUTOBOOST_PP_FOR_167_C(AUTOBOOST_PP_BOOL(p##(168, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_168(s, p, o, m) AUTOBOOST_PP_FOR_168_C(AUTOBOOST_PP_BOOL(p##(169, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_169(s, p, o, m) AUTOBOOST_PP_FOR_169_C(AUTOBOOST_PP_BOOL(p##(170, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_170(s, p, o, m) AUTOBOOST_PP_FOR_170_C(AUTOBOOST_PP_BOOL(p##(171, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_171(s, p, o, m) AUTOBOOST_PP_FOR_171_C(AUTOBOOST_PP_BOOL(p##(172, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_172(s, p, o, m) AUTOBOOST_PP_FOR_172_C(AUTOBOOST_PP_BOOL(p##(173, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_173(s, p, o, m) AUTOBOOST_PP_FOR_173_C(AUTOBOOST_PP_BOOL(p##(174, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_174(s, p, o, m) AUTOBOOST_PP_FOR_174_C(AUTOBOOST_PP_BOOL(p##(175, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_175(s, p, o, m) AUTOBOOST_PP_FOR_175_C(AUTOBOOST_PP_BOOL(p##(176, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_176(s, p, o, m) AUTOBOOST_PP_FOR_176_C(AUTOBOOST_PP_BOOL(p##(177, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_177(s, p, o, m) AUTOBOOST_PP_FOR_177_C(AUTOBOOST_PP_BOOL(p##(178, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_178(s, p, o, m) AUTOBOOST_PP_FOR_178_C(AUTOBOOST_PP_BOOL(p##(179, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_179(s, p, o, m) AUTOBOOST_PP_FOR_179_C(AUTOBOOST_PP_BOOL(p##(180, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_180(s, p, o, m) AUTOBOOST_PP_FOR_180_C(AUTOBOOST_PP_BOOL(p##(181, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_181(s, p, o, m) AUTOBOOST_PP_FOR_181_C(AUTOBOOST_PP_BOOL(p##(182, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_182(s, p, o, m) AUTOBOOST_PP_FOR_182_C(AUTOBOOST_PP_BOOL(p##(183, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_183(s, p, o, m) AUTOBOOST_PP_FOR_183_C(AUTOBOOST_PP_BOOL(p##(184, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_184(s, p, o, m) AUTOBOOST_PP_FOR_184_C(AUTOBOOST_PP_BOOL(p##(185, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_185(s, p, o, m) AUTOBOOST_PP_FOR_185_C(AUTOBOOST_PP_BOOL(p##(186, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_186(s, p, o, m) AUTOBOOST_PP_FOR_186_C(AUTOBOOST_PP_BOOL(p##(187, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_187(s, p, o, m) AUTOBOOST_PP_FOR_187_C(AUTOBOOST_PP_BOOL(p##(188, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_188(s, p, o, m) AUTOBOOST_PP_FOR_188_C(AUTOBOOST_PP_BOOL(p##(189, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_189(s, p, o, m) AUTOBOOST_PP_FOR_189_C(AUTOBOOST_PP_BOOL(p##(190, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_190(s, p, o, m) AUTOBOOST_PP_FOR_190_C(AUTOBOOST_PP_BOOL(p##(191, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_191(s, p, o, m) AUTOBOOST_PP_FOR_191_C(AUTOBOOST_PP_BOOL(p##(192, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_192(s, p, o, m) AUTOBOOST_PP_FOR_192_C(AUTOBOOST_PP_BOOL(p##(193, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_193(s, p, o, m) AUTOBOOST_PP_FOR_193_C(AUTOBOOST_PP_BOOL(p##(194, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_194(s, p, o, m) AUTOBOOST_PP_FOR_194_C(AUTOBOOST_PP_BOOL(p##(195, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_195(s, p, o, m) AUTOBOOST_PP_FOR_195_C(AUTOBOOST_PP_BOOL(p##(196, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_196(s, p, o, m) AUTOBOOST_PP_FOR_196_C(AUTOBOOST_PP_BOOL(p##(197, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_197(s, p, o, m) AUTOBOOST_PP_FOR_197_C(AUTOBOOST_PP_BOOL(p##(198, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_198(s, p, o, m) AUTOBOOST_PP_FOR_198_C(AUTOBOOST_PP_BOOL(p##(199, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_199(s, p, o, m) AUTOBOOST_PP_FOR_199_C(AUTOBOOST_PP_BOOL(p##(200, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_200(s, p, o, m) AUTOBOOST_PP_FOR_200_C(AUTOBOOST_PP_BOOL(p##(201, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_201(s, p, o, m) AUTOBOOST_PP_FOR_201_C(AUTOBOOST_PP_BOOL(p##(202, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_202(s, p, o, m) AUTOBOOST_PP_FOR_202_C(AUTOBOOST_PP_BOOL(p##(203, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_203(s, p, o, m) AUTOBOOST_PP_FOR_203_C(AUTOBOOST_PP_BOOL(p##(204, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_204(s, p, o, m) AUTOBOOST_PP_FOR_204_C(AUTOBOOST_PP_BOOL(p##(205, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_205(s, p, o, m) AUTOBOOST_PP_FOR_205_C(AUTOBOOST_PP_BOOL(p##(206, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_206(s, p, o, m) AUTOBOOST_PP_FOR_206_C(AUTOBOOST_PP_BOOL(p##(207, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_207(s, p, o, m) AUTOBOOST_PP_FOR_207_C(AUTOBOOST_PP_BOOL(p##(208, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_208(s, p, o, m) AUTOBOOST_PP_FOR_208_C(AUTOBOOST_PP_BOOL(p##(209, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_209(s, p, o, m) AUTOBOOST_PP_FOR_209_C(AUTOBOOST_PP_BOOL(p##(210, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_210(s, p, o, m) AUTOBOOST_PP_FOR_210_C(AUTOBOOST_PP_BOOL(p##(211, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_211(s, p, o, m) AUTOBOOST_PP_FOR_211_C(AUTOBOOST_PP_BOOL(p##(212, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_212(s, p, o, m) AUTOBOOST_PP_FOR_212_C(AUTOBOOST_PP_BOOL(p##(213, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_213(s, p, o, m) AUTOBOOST_PP_FOR_213_C(AUTOBOOST_PP_BOOL(p##(214, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_214(s, p, o, m) AUTOBOOST_PP_FOR_214_C(AUTOBOOST_PP_BOOL(p##(215, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_215(s, p, o, m) AUTOBOOST_PP_FOR_215_C(AUTOBOOST_PP_BOOL(p##(216, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_216(s, p, o, m) AUTOBOOST_PP_FOR_216_C(AUTOBOOST_PP_BOOL(p##(217, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_217(s, p, o, m) AUTOBOOST_PP_FOR_217_C(AUTOBOOST_PP_BOOL(p##(218, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_218(s, p, o, m) AUTOBOOST_PP_FOR_218_C(AUTOBOOST_PP_BOOL(p##(219, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_219(s, p, o, m) AUTOBOOST_PP_FOR_219_C(AUTOBOOST_PP_BOOL(p##(220, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_220(s, p, o, m) AUTOBOOST_PP_FOR_220_C(AUTOBOOST_PP_BOOL(p##(221, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_221(s, p, o, m) AUTOBOOST_PP_FOR_221_C(AUTOBOOST_PP_BOOL(p##(222, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_222(s, p, o, m) AUTOBOOST_PP_FOR_222_C(AUTOBOOST_PP_BOOL(p##(223, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_223(s, p, o, m) AUTOBOOST_PP_FOR_223_C(AUTOBOOST_PP_BOOL(p##(224, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_224(s, p, o, m) AUTOBOOST_PP_FOR_224_C(AUTOBOOST_PP_BOOL(p##(225, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_225(s, p, o, m) AUTOBOOST_PP_FOR_225_C(AUTOBOOST_PP_BOOL(p##(226, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_226(s, p, o, m) AUTOBOOST_PP_FOR_226_C(AUTOBOOST_PP_BOOL(p##(227, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_227(s, p, o, m) AUTOBOOST_PP_FOR_227_C(AUTOBOOST_PP_BOOL(p##(228, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_228(s, p, o, m) AUTOBOOST_PP_FOR_228_C(AUTOBOOST_PP_BOOL(p##(229, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_229(s, p, o, m) AUTOBOOST_PP_FOR_229_C(AUTOBOOST_PP_BOOL(p##(230, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_230(s, p, o, m) AUTOBOOST_PP_FOR_230_C(AUTOBOOST_PP_BOOL(p##(231, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_231(s, p, o, m) AUTOBOOST_PP_FOR_231_C(AUTOBOOST_PP_BOOL(p##(232, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_232(s, p, o, m) AUTOBOOST_PP_FOR_232_C(AUTOBOOST_PP_BOOL(p##(233, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_233(s, p, o, m) AUTOBOOST_PP_FOR_233_C(AUTOBOOST_PP_BOOL(p##(234, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_234(s, p, o, m) AUTOBOOST_PP_FOR_234_C(AUTOBOOST_PP_BOOL(p##(235, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_235(s, p, o, m) AUTOBOOST_PP_FOR_235_C(AUTOBOOST_PP_BOOL(p##(236, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_236(s, p, o, m) AUTOBOOST_PP_FOR_236_C(AUTOBOOST_PP_BOOL(p##(237, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_237(s, p, o, m) AUTOBOOST_PP_FOR_237_C(AUTOBOOST_PP_BOOL(p##(238, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_238(s, p, o, m) AUTOBOOST_PP_FOR_238_C(AUTOBOOST_PP_BOOL(p##(239, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_239(s, p, o, m) AUTOBOOST_PP_FOR_239_C(AUTOBOOST_PP_BOOL(p##(240, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_240(s, p, o, m) AUTOBOOST_PP_FOR_240_C(AUTOBOOST_PP_BOOL(p##(241, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_241(s, p, o, m) AUTOBOOST_PP_FOR_241_C(AUTOBOOST_PP_BOOL(p##(242, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_242(s, p, o, m) AUTOBOOST_PP_FOR_242_C(AUTOBOOST_PP_BOOL(p##(243, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_243(s, p, o, m) AUTOBOOST_PP_FOR_243_C(AUTOBOOST_PP_BOOL(p##(244, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_244(s, p, o, m) AUTOBOOST_PP_FOR_244_C(AUTOBOOST_PP_BOOL(p##(245, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_245(s, p, o, m) AUTOBOOST_PP_FOR_245_C(AUTOBOOST_PP_BOOL(p##(246, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_246(s, p, o, m) AUTOBOOST_PP_FOR_246_C(AUTOBOOST_PP_BOOL(p##(247, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_247(s, p, o, m) AUTOBOOST_PP_FOR_247_C(AUTOBOOST_PP_BOOL(p##(248, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_248(s, p, o, m) AUTOBOOST_PP_FOR_248_C(AUTOBOOST_PP_BOOL(p##(249, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_249(s, p, o, m) AUTOBOOST_PP_FOR_249_C(AUTOBOOST_PP_BOOL(p##(250, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_250(s, p, o, m) AUTOBOOST_PP_FOR_250_C(AUTOBOOST_PP_BOOL(p##(251, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_251(s, p, o, m) AUTOBOOST_PP_FOR_251_C(AUTOBOOST_PP_BOOL(p##(252, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_252(s, p, o, m) AUTOBOOST_PP_FOR_252_C(AUTOBOOST_PP_BOOL(p##(253, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_253(s, p, o, m) AUTOBOOST_PP_FOR_253_C(AUTOBOOST_PP_BOOL(p##(254, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_254(s, p, o, m) AUTOBOOST_PP_FOR_254_C(AUTOBOOST_PP_BOOL(p##(255, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_255(s, p, o, m) AUTOBOOST_PP_FOR_255_C(AUTOBOOST_PP_BOOL(p##(256, s)), s, p, o, m)
# define AUTOBOOST_PP_FOR_256(s, p, o, m) AUTOBOOST_PP_FOR_256_C(AUTOBOOST_PP_BOOL(p##(257, s)), s, p, o, m)
#
# define AUTOBOOST_PP_FOR_1_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(2, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_2, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(2, s), p, o, m)
# define AUTOBOOST_PP_FOR_2_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(3, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_3, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(3, s), p, o, m)
# define AUTOBOOST_PP_FOR_3_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(4, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_4, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(4, s), p, o, m)
# define AUTOBOOST_PP_FOR_4_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(5, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_5, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(5, s), p, o, m)
# define AUTOBOOST_PP_FOR_5_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(6, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_6, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(6, s), p, o, m)
# define AUTOBOOST_PP_FOR_6_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(7, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_7, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(7, s), p, o, m)
# define AUTOBOOST_PP_FOR_7_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(8, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_8, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(8, s), p, o, m)
# define AUTOBOOST_PP_FOR_8_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(9, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_9, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(9, s), p, o, m)
# define AUTOBOOST_PP_FOR_9_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(10, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_10, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(10, s), p, o, m)
# define AUTOBOOST_PP_FOR_10_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(11, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_11, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(11, s), p, o, m)
# define AUTOBOOST_PP_FOR_11_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(12, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_12, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(12, s), p, o, m)
# define AUTOBOOST_PP_FOR_12_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(13, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_13, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(13, s), p, o, m)
# define AUTOBOOST_PP_FOR_13_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(14, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_14, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(14, s), p, o, m)
# define AUTOBOOST_PP_FOR_14_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(15, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_15, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(15, s), p, o, m)
# define AUTOBOOST_PP_FOR_15_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(16, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_16, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(16, s), p, o, m)
# define AUTOBOOST_PP_FOR_16_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(17, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_17, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(17, s), p, o, m)
# define AUTOBOOST_PP_FOR_17_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(18, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_18, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(18, s), p, o, m)
# define AUTOBOOST_PP_FOR_18_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(19, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_19, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(19, s), p, o, m)
# define AUTOBOOST_PP_FOR_19_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(20, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_20, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(20, s), p, o, m)
# define AUTOBOOST_PP_FOR_20_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(21, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_21, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(21, s), p, o, m)
# define AUTOBOOST_PP_FOR_21_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(22, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_22, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(22, s), p, o, m)
# define AUTOBOOST_PP_FOR_22_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(23, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_23, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(23, s), p, o, m)
# define AUTOBOOST_PP_FOR_23_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(24, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_24, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(24, s), p, o, m)
# define AUTOBOOST_PP_FOR_24_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(25, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_25, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(25, s), p, o, m)
# define AUTOBOOST_PP_FOR_25_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(26, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_26, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(26, s), p, o, m)
# define AUTOBOOST_PP_FOR_26_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(27, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_27, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(27, s), p, o, m)
# define AUTOBOOST_PP_FOR_27_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(28, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_28, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(28, s), p, o, m)
# define AUTOBOOST_PP_FOR_28_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(29, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_29, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(29, s), p, o, m)
# define AUTOBOOST_PP_FOR_29_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(30, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_30, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(30, s), p, o, m)
# define AUTOBOOST_PP_FOR_30_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(31, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_31, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(31, s), p, o, m)
# define AUTOBOOST_PP_FOR_31_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(32, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_32, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(32, s), p, o, m)
# define AUTOBOOST_PP_FOR_32_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(33, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_33, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(33, s), p, o, m)
# define AUTOBOOST_PP_FOR_33_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(34, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_34, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(34, s), p, o, m)
# define AUTOBOOST_PP_FOR_34_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(35, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_35, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(35, s), p, o, m)
# define AUTOBOOST_PP_FOR_35_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(36, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_36, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(36, s), p, o, m)
# define AUTOBOOST_PP_FOR_36_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(37, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_37, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(37, s), p, o, m)
# define AUTOBOOST_PP_FOR_37_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(38, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_38, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(38, s), p, o, m)
# define AUTOBOOST_PP_FOR_38_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(39, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_39, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(39, s), p, o, m)
# define AUTOBOOST_PP_FOR_39_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(40, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_40, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(40, s), p, o, m)
# define AUTOBOOST_PP_FOR_40_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(41, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_41, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(41, s), p, o, m)
# define AUTOBOOST_PP_FOR_41_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(42, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_42, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(42, s), p, o, m)
# define AUTOBOOST_PP_FOR_42_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(43, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_43, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(43, s), p, o, m)
# define AUTOBOOST_PP_FOR_43_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(44, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_44, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(44, s), p, o, m)
# define AUTOBOOST_PP_FOR_44_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(45, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_45, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(45, s), p, o, m)
# define AUTOBOOST_PP_FOR_45_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(46, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_46, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(46, s), p, o, m)
# define AUTOBOOST_PP_FOR_46_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(47, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_47, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(47, s), p, o, m)
# define AUTOBOOST_PP_FOR_47_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(48, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_48, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(48, s), p, o, m)
# define AUTOBOOST_PP_FOR_48_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(49, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_49, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(49, s), p, o, m)
# define AUTOBOOST_PP_FOR_49_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(50, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_50, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(50, s), p, o, m)
# define AUTOBOOST_PP_FOR_50_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(51, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_51, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(51, s), p, o, m)
# define AUTOBOOST_PP_FOR_51_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(52, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_52, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(52, s), p, o, m)
# define AUTOBOOST_PP_FOR_52_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(53, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_53, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(53, s), p, o, m)
# define AUTOBOOST_PP_FOR_53_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(54, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_54, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(54, s), p, o, m)
# define AUTOBOOST_PP_FOR_54_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(55, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_55, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(55, s), p, o, m)
# define AUTOBOOST_PP_FOR_55_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(56, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_56, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(56, s), p, o, m)
# define AUTOBOOST_PP_FOR_56_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(57, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_57, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(57, s), p, o, m)
# define AUTOBOOST_PP_FOR_57_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(58, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_58, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(58, s), p, o, m)
# define AUTOBOOST_PP_FOR_58_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(59, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_59, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(59, s), p, o, m)
# define AUTOBOOST_PP_FOR_59_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(60, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_60, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(60, s), p, o, m)
# define AUTOBOOST_PP_FOR_60_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(61, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_61, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(61, s), p, o, m)
# define AUTOBOOST_PP_FOR_61_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(62, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_62, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(62, s), p, o, m)
# define AUTOBOOST_PP_FOR_62_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(63, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_63, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(63, s), p, o, m)
# define AUTOBOOST_PP_FOR_63_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(64, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_64, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(64, s), p, o, m)
# define AUTOBOOST_PP_FOR_64_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(65, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_65, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(65, s), p, o, m)
# define AUTOBOOST_PP_FOR_65_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(66, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_66, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(66, s), p, o, m)
# define AUTOBOOST_PP_FOR_66_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(67, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_67, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(67, s), p, o, m)
# define AUTOBOOST_PP_FOR_67_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(68, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_68, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(68, s), p, o, m)
# define AUTOBOOST_PP_FOR_68_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(69, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_69, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(69, s), p, o, m)
# define AUTOBOOST_PP_FOR_69_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(70, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_70, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(70, s), p, o, m)
# define AUTOBOOST_PP_FOR_70_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(71, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_71, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(71, s), p, o, m)
# define AUTOBOOST_PP_FOR_71_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(72, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_72, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(72, s), p, o, m)
# define AUTOBOOST_PP_FOR_72_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(73, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_73, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(73, s), p, o, m)
# define AUTOBOOST_PP_FOR_73_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(74, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_74, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(74, s), p, o, m)
# define AUTOBOOST_PP_FOR_74_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(75, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_75, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(75, s), p, o, m)
# define AUTOBOOST_PP_FOR_75_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(76, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_76, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(76, s), p, o, m)
# define AUTOBOOST_PP_FOR_76_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(77, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_77, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(77, s), p, o, m)
# define AUTOBOOST_PP_FOR_77_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(78, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_78, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(78, s), p, o, m)
# define AUTOBOOST_PP_FOR_78_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(79, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_79, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(79, s), p, o, m)
# define AUTOBOOST_PP_FOR_79_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(80, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_80, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(80, s), p, o, m)
# define AUTOBOOST_PP_FOR_80_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(81, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_81, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(81, s), p, o, m)
# define AUTOBOOST_PP_FOR_81_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(82, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_82, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(82, s), p, o, m)
# define AUTOBOOST_PP_FOR_82_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(83, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_83, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(83, s), p, o, m)
# define AUTOBOOST_PP_FOR_83_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(84, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_84, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(84, s), p, o, m)
# define AUTOBOOST_PP_FOR_84_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(85, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_85, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(85, s), p, o, m)
# define AUTOBOOST_PP_FOR_85_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(86, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_86, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(86, s), p, o, m)
# define AUTOBOOST_PP_FOR_86_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(87, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_87, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(87, s), p, o, m)
# define AUTOBOOST_PP_FOR_87_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(88, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_88, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(88, s), p, o, m)
# define AUTOBOOST_PP_FOR_88_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(89, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_89, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(89, s), p, o, m)
# define AUTOBOOST_PP_FOR_89_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(90, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_90, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(90, s), p, o, m)
# define AUTOBOOST_PP_FOR_90_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(91, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_91, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(91, s), p, o, m)
# define AUTOBOOST_PP_FOR_91_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(92, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_92, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(92, s), p, o, m)
# define AUTOBOOST_PP_FOR_92_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(93, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_93, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(93, s), p, o, m)
# define AUTOBOOST_PP_FOR_93_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(94, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_94, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(94, s), p, o, m)
# define AUTOBOOST_PP_FOR_94_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(95, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_95, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(95, s), p, o, m)
# define AUTOBOOST_PP_FOR_95_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(96, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_96, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(96, s), p, o, m)
# define AUTOBOOST_PP_FOR_96_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(97, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_97, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(97, s), p, o, m)
# define AUTOBOOST_PP_FOR_97_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(98, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_98, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(98, s), p, o, m)
# define AUTOBOOST_PP_FOR_98_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(99, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_99, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(99, s), p, o, m)
# define AUTOBOOST_PP_FOR_99_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(100, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_100, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(100, s), p, o, m)
# define AUTOBOOST_PP_FOR_100_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(101, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_101, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(101, s), p, o, m)
# define AUTOBOOST_PP_FOR_101_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(102, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_102, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(102, s), p, o, m)
# define AUTOBOOST_PP_FOR_102_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(103, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_103, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(103, s), p, o, m)
# define AUTOBOOST_PP_FOR_103_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(104, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_104, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(104, s), p, o, m)
# define AUTOBOOST_PP_FOR_104_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(105, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_105, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(105, s), p, o, m)
# define AUTOBOOST_PP_FOR_105_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(106, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_106, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(106, s), p, o, m)
# define AUTOBOOST_PP_FOR_106_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(107, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_107, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(107, s), p, o, m)
# define AUTOBOOST_PP_FOR_107_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(108, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_108, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(108, s), p, o, m)
# define AUTOBOOST_PP_FOR_108_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(109, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_109, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(109, s), p, o, m)
# define AUTOBOOST_PP_FOR_109_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(110, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_110, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(110, s), p, o, m)
# define AUTOBOOST_PP_FOR_110_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(111, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_111, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(111, s), p, o, m)
# define AUTOBOOST_PP_FOR_111_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(112, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_112, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(112, s), p, o, m)
# define AUTOBOOST_PP_FOR_112_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(113, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_113, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(113, s), p, o, m)
# define AUTOBOOST_PP_FOR_113_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(114, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_114, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(114, s), p, o, m)
# define AUTOBOOST_PP_FOR_114_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(115, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_115, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(115, s), p, o, m)
# define AUTOBOOST_PP_FOR_115_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(116, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_116, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(116, s), p, o, m)
# define AUTOBOOST_PP_FOR_116_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(117, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_117, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(117, s), p, o, m)
# define AUTOBOOST_PP_FOR_117_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(118, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_118, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(118, s), p, o, m)
# define AUTOBOOST_PP_FOR_118_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(119, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_119, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(119, s), p, o, m)
# define AUTOBOOST_PP_FOR_119_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(120, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_120, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(120, s), p, o, m)
# define AUTOBOOST_PP_FOR_120_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(121, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_121, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(121, s), p, o, m)
# define AUTOBOOST_PP_FOR_121_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(122, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_122, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(122, s), p, o, m)
# define AUTOBOOST_PP_FOR_122_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(123, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_123, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(123, s), p, o, m)
# define AUTOBOOST_PP_FOR_123_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(124, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_124, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(124, s), p, o, m)
# define AUTOBOOST_PP_FOR_124_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(125, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_125, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(125, s), p, o, m)
# define AUTOBOOST_PP_FOR_125_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(126, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_126, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(126, s), p, o, m)
# define AUTOBOOST_PP_FOR_126_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(127, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_127, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(127, s), p, o, m)
# define AUTOBOOST_PP_FOR_127_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(128, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_128, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(128, s), p, o, m)
# define AUTOBOOST_PP_FOR_128_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(129, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_129, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(129, s), p, o, m)
# define AUTOBOOST_PP_FOR_129_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(130, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_130, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(130, s), p, o, m)
# define AUTOBOOST_PP_FOR_130_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(131, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_131, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(131, s), p, o, m)
# define AUTOBOOST_PP_FOR_131_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(132, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_132, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(132, s), p, o, m)
# define AUTOBOOST_PP_FOR_132_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(133, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_133, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(133, s), p, o, m)
# define AUTOBOOST_PP_FOR_133_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(134, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_134, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(134, s), p, o, m)
# define AUTOBOOST_PP_FOR_134_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(135, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_135, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(135, s), p, o, m)
# define AUTOBOOST_PP_FOR_135_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(136, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_136, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(136, s), p, o, m)
# define AUTOBOOST_PP_FOR_136_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(137, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_137, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(137, s), p, o, m)
# define AUTOBOOST_PP_FOR_137_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(138, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_138, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(138, s), p, o, m)
# define AUTOBOOST_PP_FOR_138_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(139, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_139, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(139, s), p, o, m)
# define AUTOBOOST_PP_FOR_139_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(140, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_140, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(140, s), p, o, m)
# define AUTOBOOST_PP_FOR_140_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(141, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_141, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(141, s), p, o, m)
# define AUTOBOOST_PP_FOR_141_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(142, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_142, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(142, s), p, o, m)
# define AUTOBOOST_PP_FOR_142_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(143, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_143, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(143, s), p, o, m)
# define AUTOBOOST_PP_FOR_143_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(144, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_144, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(144, s), p, o, m)
# define AUTOBOOST_PP_FOR_144_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(145, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_145, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(145, s), p, o, m)
# define AUTOBOOST_PP_FOR_145_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(146, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_146, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(146, s), p, o, m)
# define AUTOBOOST_PP_FOR_146_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(147, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_147, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(147, s), p, o, m)
# define AUTOBOOST_PP_FOR_147_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(148, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_148, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(148, s), p, o, m)
# define AUTOBOOST_PP_FOR_148_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(149, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_149, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(149, s), p, o, m)
# define AUTOBOOST_PP_FOR_149_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(150, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_150, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(150, s), p, o, m)
# define AUTOBOOST_PP_FOR_150_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(151, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_151, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(151, s), p, o, m)
# define AUTOBOOST_PP_FOR_151_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(152, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_152, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(152, s), p, o, m)
# define AUTOBOOST_PP_FOR_152_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(153, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_153, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(153, s), p, o, m)
# define AUTOBOOST_PP_FOR_153_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(154, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_154, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(154, s), p, o, m)
# define AUTOBOOST_PP_FOR_154_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(155, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_155, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(155, s), p, o, m)
# define AUTOBOOST_PP_FOR_155_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(156, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_156, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(156, s), p, o, m)
# define AUTOBOOST_PP_FOR_156_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(157, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_157, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(157, s), p, o, m)
# define AUTOBOOST_PP_FOR_157_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(158, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_158, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(158, s), p, o, m)
# define AUTOBOOST_PP_FOR_158_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(159, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_159, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(159, s), p, o, m)
# define AUTOBOOST_PP_FOR_159_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(160, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_160, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(160, s), p, o, m)
# define AUTOBOOST_PP_FOR_160_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(161, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_161, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(161, s), p, o, m)
# define AUTOBOOST_PP_FOR_161_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(162, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_162, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(162, s), p, o, m)
# define AUTOBOOST_PP_FOR_162_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(163, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_163, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(163, s), p, o, m)
# define AUTOBOOST_PP_FOR_163_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(164, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_164, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(164, s), p, o, m)
# define AUTOBOOST_PP_FOR_164_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(165, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_165, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(165, s), p, o, m)
# define AUTOBOOST_PP_FOR_165_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(166, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_166, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(166, s), p, o, m)
# define AUTOBOOST_PP_FOR_166_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(167, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_167, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(167, s), p, o, m)
# define AUTOBOOST_PP_FOR_167_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(168, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_168, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(168, s), p, o, m)
# define AUTOBOOST_PP_FOR_168_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(169, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_169, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(169, s), p, o, m)
# define AUTOBOOST_PP_FOR_169_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(170, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_170, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(170, s), p, o, m)
# define AUTOBOOST_PP_FOR_170_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(171, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_171, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(171, s), p, o, m)
# define AUTOBOOST_PP_FOR_171_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(172, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_172, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(172, s), p, o, m)
# define AUTOBOOST_PP_FOR_172_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(173, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_173, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(173, s), p, o, m)
# define AUTOBOOST_PP_FOR_173_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(174, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_174, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(174, s), p, o, m)
# define AUTOBOOST_PP_FOR_174_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(175, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_175, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(175, s), p, o, m)
# define AUTOBOOST_PP_FOR_175_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(176, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_176, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(176, s), p, o, m)
# define AUTOBOOST_PP_FOR_176_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(177, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_177, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(177, s), p, o, m)
# define AUTOBOOST_PP_FOR_177_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(178, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_178, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(178, s), p, o, m)
# define AUTOBOOST_PP_FOR_178_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(179, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_179, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(179, s), p, o, m)
# define AUTOBOOST_PP_FOR_179_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(180, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_180, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(180, s), p, o, m)
# define AUTOBOOST_PP_FOR_180_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(181, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_181, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(181, s), p, o, m)
# define AUTOBOOST_PP_FOR_181_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(182, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_182, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(182, s), p, o, m)
# define AUTOBOOST_PP_FOR_182_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(183, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_183, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(183, s), p, o, m)
# define AUTOBOOST_PP_FOR_183_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(184, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_184, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(184, s), p, o, m)
# define AUTOBOOST_PP_FOR_184_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(185, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_185, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(185, s), p, o, m)
# define AUTOBOOST_PP_FOR_185_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(186, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_186, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(186, s), p, o, m)
# define AUTOBOOST_PP_FOR_186_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(187, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_187, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(187, s), p, o, m)
# define AUTOBOOST_PP_FOR_187_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(188, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_188, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(188, s), p, o, m)
# define AUTOBOOST_PP_FOR_188_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(189, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_189, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(189, s), p, o, m)
# define AUTOBOOST_PP_FOR_189_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(190, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_190, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(190, s), p, o, m)
# define AUTOBOOST_PP_FOR_190_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(191, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_191, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(191, s), p, o, m)
# define AUTOBOOST_PP_FOR_191_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(192, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_192, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(192, s), p, o, m)
# define AUTOBOOST_PP_FOR_192_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(193, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_193, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(193, s), p, o, m)
# define AUTOBOOST_PP_FOR_193_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(194, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_194, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(194, s), p, o, m)
# define AUTOBOOST_PP_FOR_194_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(195, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_195, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(195, s), p, o, m)
# define AUTOBOOST_PP_FOR_195_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(196, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_196, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(196, s), p, o, m)
# define AUTOBOOST_PP_FOR_196_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(197, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_197, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(197, s), p, o, m)
# define AUTOBOOST_PP_FOR_197_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(198, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_198, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(198, s), p, o, m)
# define AUTOBOOST_PP_FOR_198_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(199, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_199, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(199, s), p, o, m)
# define AUTOBOOST_PP_FOR_199_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(200, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_200, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(200, s), p, o, m)
# define AUTOBOOST_PP_FOR_200_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(201, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_201, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(201, s), p, o, m)
# define AUTOBOOST_PP_FOR_201_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(202, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_202, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(202, s), p, o, m)
# define AUTOBOOST_PP_FOR_202_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(203, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_203, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(203, s), p, o, m)
# define AUTOBOOST_PP_FOR_203_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(204, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_204, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(204, s), p, o, m)
# define AUTOBOOST_PP_FOR_204_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(205, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_205, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(205, s), p, o, m)
# define AUTOBOOST_PP_FOR_205_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(206, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_206, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(206, s), p, o, m)
# define AUTOBOOST_PP_FOR_206_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(207, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_207, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(207, s), p, o, m)
# define AUTOBOOST_PP_FOR_207_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(208, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_208, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(208, s), p, o, m)
# define AUTOBOOST_PP_FOR_208_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(209, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_209, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(209, s), p, o, m)
# define AUTOBOOST_PP_FOR_209_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(210, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_210, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(210, s), p, o, m)
# define AUTOBOOST_PP_FOR_210_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(211, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_211, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(211, s), p, o, m)
# define AUTOBOOST_PP_FOR_211_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(212, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_212, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(212, s), p, o, m)
# define AUTOBOOST_PP_FOR_212_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(213, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_213, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(213, s), p, o, m)
# define AUTOBOOST_PP_FOR_213_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(214, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_214, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(214, s), p, o, m)
# define AUTOBOOST_PP_FOR_214_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(215, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_215, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(215, s), p, o, m)
# define AUTOBOOST_PP_FOR_215_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(216, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_216, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(216, s), p, o, m)
# define AUTOBOOST_PP_FOR_216_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(217, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_217, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(217, s), p, o, m)
# define AUTOBOOST_PP_FOR_217_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(218, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_218, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(218, s), p, o, m)
# define AUTOBOOST_PP_FOR_218_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(219, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_219, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(219, s), p, o, m)
# define AUTOBOOST_PP_FOR_219_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(220, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_220, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(220, s), p, o, m)
# define AUTOBOOST_PP_FOR_220_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(221, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_221, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(221, s), p, o, m)
# define AUTOBOOST_PP_FOR_221_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(222, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_222, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(222, s), p, o, m)
# define AUTOBOOST_PP_FOR_222_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(223, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_223, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(223, s), p, o, m)
# define AUTOBOOST_PP_FOR_223_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(224, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_224, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(224, s), p, o, m)
# define AUTOBOOST_PP_FOR_224_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(225, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_225, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(225, s), p, o, m)
# define AUTOBOOST_PP_FOR_225_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(226, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_226, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(226, s), p, o, m)
# define AUTOBOOST_PP_FOR_226_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(227, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_227, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(227, s), p, o, m)
# define AUTOBOOST_PP_FOR_227_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(228, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_228, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(228, s), p, o, m)
# define AUTOBOOST_PP_FOR_228_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(229, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_229, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(229, s), p, o, m)
# define AUTOBOOST_PP_FOR_229_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(230, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_230, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(230, s), p, o, m)
# define AUTOBOOST_PP_FOR_230_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(231, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_231, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(231, s), p, o, m)
# define AUTOBOOST_PP_FOR_231_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(232, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_232, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(232, s), p, o, m)
# define AUTOBOOST_PP_FOR_232_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(233, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_233, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(233, s), p, o, m)
# define AUTOBOOST_PP_FOR_233_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(234, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_234, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(234, s), p, o, m)
# define AUTOBOOST_PP_FOR_234_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(235, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_235, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(235, s), p, o, m)
# define AUTOBOOST_PP_FOR_235_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(236, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_236, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(236, s), p, o, m)
# define AUTOBOOST_PP_FOR_236_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(237, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_237, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(237, s), p, o, m)
# define AUTOBOOST_PP_FOR_237_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(238, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_238, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(238, s), p, o, m)
# define AUTOBOOST_PP_FOR_238_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(239, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_239, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(239, s), p, o, m)
# define AUTOBOOST_PP_FOR_239_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(240, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_240, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(240, s), p, o, m)
# define AUTOBOOST_PP_FOR_240_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(241, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_241, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(241, s), p, o, m)
# define AUTOBOOST_PP_FOR_241_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(242, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_242, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(242, s), p, o, m)
# define AUTOBOOST_PP_FOR_242_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(243, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_243, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(243, s), p, o, m)
# define AUTOBOOST_PP_FOR_243_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(244, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_244, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(244, s), p, o, m)
# define AUTOBOOST_PP_FOR_244_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(245, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_245, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(245, s), p, o, m)
# define AUTOBOOST_PP_FOR_245_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(246, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_246, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(246, s), p, o, m)
# define AUTOBOOST_PP_FOR_246_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(247, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_247, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(247, s), p, o, m)
# define AUTOBOOST_PP_FOR_247_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(248, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_248, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(248, s), p, o, m)
# define AUTOBOOST_PP_FOR_248_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(249, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_249, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(249, s), p, o, m)
# define AUTOBOOST_PP_FOR_249_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(250, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_250, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(250, s), p, o, m)
# define AUTOBOOST_PP_FOR_250_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(251, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_251, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(251, s), p, o, m)
# define AUTOBOOST_PP_FOR_251_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(252, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_252, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(252, s), p, o, m)
# define AUTOBOOST_PP_FOR_252_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(253, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_253, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(253, s), p, o, m)
# define AUTOBOOST_PP_FOR_253_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(254, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_254, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(254, s), p, o, m)
# define AUTOBOOST_PP_FOR_254_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(255, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_255, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(255, s), p, o, m)
# define AUTOBOOST_PP_FOR_255_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(256, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_256, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(256, s), p, o, m)
# define AUTOBOOST_PP_FOR_256_C(c, s, p, o, m) AUTOBOOST_PP_IIF(c, m, AUTOBOOST_PP_TUPLE_EAT_2)(257, s) AUTOBOOST_PP_IIF(c, AUTOBOOST_PP_FOR_257, AUTOBOOST_PP_TUPLE_EAT_4)(AUTOBOOST_PP_EXPR_IIF(c, o)(257, s), p, o, m)
#
# endif
| [
"cmercenary@gmail.com"
] | cmercenary@gmail.com |
d2769c5d5f9d8644df5364c3471445a7d9443bf1 | e8401d42320cb89e9782f58720dbbfaf3553be45 | /DlgProxy.h | 326dc87cbb8dae385ccb894c42e4de04f560dcab | [] | no_license | dwatow/CASDK-Z | e1689aef4e428e5738652494499e36cc9e1507d6 | 69cc9c92fb839ac4c69ac0e7b8fa505aefb9c7b3 | refs/heads/master | 2021-01-15T18:08:51.863944 | 2012-10-04T01:36:12 | 2012-10-04T01:36:12 | 6,069,380 | 2 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 1,567 | h | // DlgProxy.h : header file
//
#if !defined(AFX_DLGPROXY_H__A538AB2C_92FD_4F9C_9A7A_26C1F8F1C7F4__INCLUDED_)
#define AFX_DLGPROXY_H__A538AB2C_92FD_4F9C_9A7A_26C1F8F1C7F4__INCLUDED_
#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000
class CSwordDlg;
/////////////////////////////////////////////////////////////////////////////
// CSwordDlgAutoProxy command target
class CSwordDlgAutoProxy : public CCmdTarget
{
DECLARE_DYNCREATE(CSwordDlgAutoProxy)
CSwordDlgAutoProxy(); // protected constructor used by dynamic creation
// Attributes
public:
CSwordDlg* m_pDialog;
// Operations
public:
// Overrides
// ClassWizard generated virtual function overrides
//{{AFX_VIRTUAL(CSwordDlgAutoProxy)
public:
virtual void OnFinalRelease();
//}}AFX_VIRTUAL
// Implementation
protected:
virtual ~CSwordDlgAutoProxy();
// Generated message map functions
//{{AFX_MSG(CSwordDlgAutoProxy)
// NOTE - the ClassWizard will add and remove member functions here.
//}}AFX_MSG
DECLARE_MESSAGE_MAP()
DECLARE_OLECREATE(CSwordDlgAutoProxy)
// Generated OLE dispatch map functions
//{{AFX_DISPATCH(CSwordDlgAutoProxy)
// NOTE - the ClassWizard will add and remove member functions here.
//}}AFX_DISPATCH
DECLARE_DISPATCH_MAP()
DECLARE_INTERFACE_MAP()
};
/////////////////////////////////////////////////////////////////////////////
//{{AFX_INSERT_LOCATION}}
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.
#endif // !defined(AFX_DLGPROXY_H__A538AB2C_92FD_4F9C_9A7A_26C1F8F1C7F4__INCLUDED_)
| [
"dwatow@gmail.com"
] | dwatow@gmail.com |
bf03fd766af924853983bda1f03a99f9d192c4a7 | 935927010571e2f820e70cead9a1fd471d88ea16 | /Online Judge/Codeforces/Gym/ACM_ICPC_NEERC_Southern_Subregional_2017-2018/E.cpp | 0360ab593d91ba3086f49f05d8143065a2ce075a | [] | no_license | muhammadhasan01/cp | ebb0869b94c2a2ab9487861bd15a8e62083193ef | 3b0152b9621c81190dd1a96dde0eb80bff284268 | refs/heads/master | 2023-05-30T07:18:02.094877 | 2023-05-21T22:03:57 | 2023-05-21T22:03:57 | 196,739,005 | 6 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,015 | cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 55;
const int M = 1e3 + 5;
int n, m;
string s, a;
vector<vector<int>> v;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> s;
vector<int> cnt(30);
for (auto e : s) {
if (e != '*') cnt[e - 'a'] = true;
}
cin >> m;
for (int i = 1; i <= m; i++) {
cin >> a;
bool valid = true;
for (int j = 0; j < n; j++) {
if (s[j] == '*' && cnt[a[j] - 'a'] > 0) {
valid = false;
break;
} else if (s[j] != '*' && s[j] != a[j]) {
valid = false;
break;
}
}
if (valid) {
vector<int> cur(30);
for (int j = 0; j < n; j++) {
if (s[j] == '*') cur[a[j] - 'a'] = true;
}
v.push_back(cur);
}
}
int ans = 0;
for (int i = 0; i < 26; i++) {
bool flag = true;
for (auto e : v) {
if (!e[i]) {
flag = false;
break;
}
}
if (flag) ans++;
}
cout << ans << '\n';
return 0;
}
| [
"39514247+muhammadhasan01@users.noreply.github.com"
] | 39514247+muhammadhasan01@users.noreply.github.com |
b2dc57ae31ea7d7f8e94c67a264a14652dde4c37 | caf962e0810e2afc480039dfc0d714cd8ed83637 | /sda/IteratedList_DLL/DLLNode.cpp | fdb271600687379789ec1cac4c3209ff4ff9af52 | [] | no_license | razvanw0w/university | 35e4afd1b9b774a074d5041e68a74acee1c5b172 | 78a40bdff2c69a2029712b39941bda365be21e4b | refs/heads/master | 2020-12-28T05:28:56.625004 | 2020-10-12T16:04:52 | 2020-10-12T16:04:52 | 238,196,889 | 0 | 8 | null | null | null | null | UTF-8 | C++ | false | false | 785 | cpp | //
// Created by razvan on 30.03.2019.
//
#include "DLLNode.h"
DLLNode::DLLNode(TElem element, DLLNode *prev, DLLNode *next) : element(element), prev(prev), next(next) {}
TElem DLLNode::getElement() const {
return element;
}
void DLLNode::setElement(TElem element) {
this->element = element;
}
DLLNode *DLLNode::getPrev() const {
return prev;
}
void DLLNode::setPrev(DLLNode *prev) {
this->prev = prev;
}
DLLNode *DLLNode::getNext() const {
return next;
}
void DLLNode::setNext(DLLNode *next) {
this->next = next;
}
bool DLLNode::operator==(const DLLNode &rhs) const {
return element == rhs.element &&
prev == rhs.prev &&
next == rhs.next;
}
bool DLLNode::operator!=(const DLLNode &rhs) const {
return !(rhs == *this);
}
| [
"razvanztn@gmail.com"
] | razvanztn@gmail.com |
0f7faa8063a4381c5646507123944b708735a2a7 | 85eca97255eed9af2252073909718ba82d8b0903 | /include/NRI/Source/Validation/PipelineLayoutVal.h | 0cdbb2123975582eeadb9453c70d20aeb2e87bbf | [] | no_license | gamehacker1999/DX12Engine | 1141985b9956b41fb275018e82523b4e342cfcc3 | 9ce4fac6241574f76a1af992972a66df1a519155 | refs/heads/master | 2022-01-25T10:07:38.362772 | 2022-01-16T20:34:48 | 2022-01-16T20:34:48 | 232,304,912 | 18 | 6 | null | null | null | null | UTF-8 | C++ | false | false | 1,258 | h | /*
Copyright (c) 2020, NVIDIA CORPORATION. All rights reserved.
NVIDIA CORPORATION and its licensors retain all intellectual property
and proprietary rights in and to this software, related documentation
and any modifications thereto. Any use, reproduction, disclosure or
distribution of this software and related documentation without an express
license agreement from NVIDIA CORPORATION is strictly prohibited.
*/
#pragma once
namespace nri
{
struct PipelineLayoutVal : public DeviceObjectVal<PipelineLayout>
{
PipelineLayoutVal(DeviceVal& device, PipelineLayout& pipelineLayout, const PipelineLayoutDesc& pipelineLayoutDesc);
const PipelineLayoutDesc& GetPipelineLayoutDesc() const;
void SetDebugName(const char* name);
private:
PipelineLayoutDesc m_PipelineLayoutDesc;
Vector<DescriptorSetDesc> m_DescriptorSets;
Vector<PushConstantDesc> m_PushConstants;
Vector<DescriptorRangeDesc> m_DescriptorRangeDescs;
Vector<StaticSamplerDesc> m_StaticSamplerDescs;
Vector<DynamicConstantBufferDesc> m_DynamicConstantBufferDescs;
};
inline const PipelineLayoutDesc& PipelineLayoutVal::GetPipelineLayoutDesc() const
{
return m_PipelineLayoutDesc;
}
}
| [
"shubham.sachdeva0499@gmail.com"
] | shubham.sachdeva0499@gmail.com |
7e21ef746b18ce6abde92a5b59c0fd4a3f20323f | 6452866acc13c4fa3199c8e25114f61ae96b85f7 | /DataStructures/CF899E_SegmentsRemoval.cpp | 8b2e61c47ac5865ce8215636b932eb7279be100a | [] | no_license | Tanavya/Competitive-Programming | 7b46ce7a4fad8489ede77756dff44a00487f69b1 | 2519df7406bb2351230353488672afb48f45c350 | refs/heads/master | 2021-01-21T11:34:03.655193 | 2018-04-30T04:22:00 | 2018-04-30T04:22:00 | 102,010,530 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,245 | cpp | #include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
#include <stdio.h>
#include <queue>
#include <set>
#include <list>
#include <cmath>
#include <assert.h>
#include <bitset>
#include <cstring>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip> //cout << setprecision(node) << fixed << num
#include <stack>
#include <sstream>
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define print(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout << *it << " "; cout << endl;
#define debug(x) cout << x << endl;
#define debug2(x,y) cout << x << " " << y << endl;
#define debug3(x,y,z) cout << x << " " << y << " " << z << endl;
typedef long long int ll;
typedef long double ld;
typedef unsigned long long int ull;
typedef std::pair <int, int> ii;
typedef std::vector <int> vi;
typedef std::vector <ll> vll;
typedef std::vector <ld> vld;
const int INF = int(1e9);
const ll INF64 = ll(1e18);
const ld EPS = 1e-9, PI = 3.1415926535897932384626433832795;
using namespace std;
const int maxn = 200007;
int A[maxn], dp[maxn];
bool cmp (ii a, ii b) {
if (a.fi != b.fi) return a.fi > b.fi;
return a.se < b.se;
}
int main() {
int N;
scanf("%d", &N);
set <ii> S;
int curr_start = 0, curr_val = 0, curr_size = 0;
//priority_queue <ii, vector <ii>, cmp> pq;
map <int, set <int>> M;
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
S.insert(mp(i, A[i]));
if (!i) {
dp[i] = 1;
}
else {
if (A[i] == A[i-1]) dp[i] = dp[i-1] + 1;
else {
M[dp[i-1]].insert(i-dp[i-1]+1);
dp[i] = 1;
}
}
}
M[dp[N-1]].insert(N-dp[N-1]);
while (!M.empty()) {
auto it = prev(M.end());
int pos = *((it->second).begin());
auto it2 = S.find(mp(pos, A[pos]));
int len = it->first;
vector <ii> to_remove;
while (len && it2 != S.end()) {
to_remove.pb(*it2);
it2++;
len--;
}
if (pos) {
if (A[pos-1] == A[pos+it->first]) {
}
}
}
return 0;
} | [
"tanavya.dimri@gmail.com"
] | tanavya.dimri@gmail.com |
2cd0ef51fe10a378fc3845d67ceac53cc4ff0c10 | 0aae0bdf6a3681d73db3d67433c3104b4cc93938 | /scintilla/src/LineMarker.cxx | 5846170bbdf135cd3303bbbb0407290c831d5620 | [
"BSD-3-Clause",
"LicenseRef-scancode-unknown-license-reference",
"LicenseRef-scancode-scintilla",
"MIT",
"BSD-2-Clause"
] | permissive | fromasmtodisasm/notepad2 | 7ca9b0969733b8c099614f88b65eef831280a5d1 | b34f1d55b110e02bbb37bab39d58e782c620eb10 | refs/heads/master | 2020-04-23T10:48:04.145386 | 2019-02-17T09:27:29 | 2019-02-17T09:27:29 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 15,869 | cxx | // Scintilla source code edit control
/** @file LineMarker.cxx
** Defines the look of a line marker in the margin.
**/
// Copyright 1998-2011 by Neil Hodgson <neilh@scintilla.org>
// The License.txt file describes the conditions under which this software may be distributed.
#include <cstring>
#include <cmath>
#include <stdexcept>
#include <string>
#include <string_view>
#include <vector>
#include <map>
#include <algorithm>
#include <memory>
#include "Platform.h"
#include "Scintilla.h"
#include "IntegerRectangle.h"
#include "XPM.h"
#include "LineMarker.h"
using namespace Scintilla;
LineMarker::~LineMarker() = default;
LineMarker::LineMarker() noexcept {
markType = SC_MARK_CIRCLE;
fore = ColourDesired(0, 0, 0);
back = ColourDesired(0xff, 0xff, 0xff);
backSelected = ColourDesired(0xff, 0x00, 0x00);
alpha = SC_ALPHA_NOALPHA;
customDraw = nullptr;
}
LineMarker::LineMarker(const LineMarker &) noexcept {
// Defined to avoid pxpm and image being blindly copied, not as a complete copy constructor.
markType = SC_MARK_CIRCLE;
fore = ColourDesired(0, 0, 0);
back = ColourDesired(0xff, 0xff, 0xff);
backSelected = ColourDesired(0xff, 0x00, 0x00);
alpha = SC_ALPHA_NOALPHA;
pxpm.reset();
image.reset();
customDraw = nullptr;
}
LineMarker &LineMarker::operator=(const LineMarker &other) noexcept {
// Defined to avoid pxpm and image being blindly copied, not as a complete assignment operator.
if (this != &other) {
markType = SC_MARK_CIRCLE;
fore = ColourDesired(0, 0, 0);
back = ColourDesired(0xff, 0xff, 0xff);
backSelected = ColourDesired(0xff, 0x00, 0x00);
alpha = SC_ALPHA_NOALPHA;
pxpm.reset();
image.reset();
customDraw = nullptr;
}
return *this;
}
void LineMarker::SetXPM(const char *textForm) {
pxpm = std::make_unique<XPM>(textForm);
markType = SC_MARK_PIXMAP;
}
void LineMarker::SetXPM(const char *const *linesForm) {
pxpm = std::make_unique<XPM>(linesForm);
markType = SC_MARK_PIXMAP;
}
void LineMarker::SetRGBAImage(Point sizeRGBAImage, float scale, const unsigned char *pixelsRGBAImage) {
image = std::make_unique<RGBAImage>(static_cast<int>(sizeRGBAImage.x), static_cast<int>(sizeRGBAImage.y), scale, pixelsRGBAImage);
markType = SC_MARK_RGBAIMAGE;
}
static void DrawBox(Surface *surface, int centreX, int centreY, int armSize, ColourDesired fore, ColourDesired back) {
const PRectangle rc = PRectangle::FromInts(
centreX - armSize,
centreY - armSize,
centreX + armSize + 1,
centreY + armSize + 1);
surface->RectangleDraw(rc, back, fore);
}
static void DrawCircle(Surface *surface, int centreX, int centreY, int armSize, ColourDesired fore, ColourDesired back) {
const PRectangle rcCircle = PRectangle::FromInts(
centreX - armSize,
centreY - armSize,
centreX + armSize + 1,
centreY + armSize + 1);
surface->Ellipse(rcCircle, back, fore);
}
static void DrawPlus(Surface *surface, int centreX, int centreY, int armSize, ColourDesired fore) {
const PRectangle rcV = PRectangle::FromInts(centreX, centreY - armSize + 2, centreX + 1, centreY + armSize - 2 + 1);
surface->FillRectangle(rcV, fore);
const PRectangle rcH = PRectangle::FromInts(centreX - armSize + 2, centreY, centreX + armSize - 2 + 1, centreY + 1);
surface->FillRectangle(rcH, fore);
}
static void DrawMinus(Surface *surface, int centreX, int centreY, int armSize, ColourDesired fore) {
const PRectangle rcH = PRectangle::FromInts(centreX - armSize + 2, centreY, centreX + armSize - 2 + 1, centreY + 1);
surface->FillRectangle(rcH, fore);
}
void LineMarker::Draw(Surface *surface, PRectangle rcWhole, const Font &fontForCharacter, typeOfFold tFold, int marginStyle) const {
if (customDraw) {
customDraw(surface, rcWhole, fontForCharacter, tFold, marginStyle, this);
return;
}
ColourDesired colourHead = back;
ColourDesired colourBody = back;
ColourDesired colourTail = back;
switch (tFold) {
case LineMarker::head:
case LineMarker::headWithTail:
colourHead = backSelected;
colourTail = backSelected;
break;
case LineMarker::body:
colourHead = backSelected;
colourBody = backSelected;
break;
case LineMarker::tail:
colourBody = backSelected;
colourTail = backSelected;
break;
default:
// LineMarker::undefined
break;
}
if ((markType == SC_MARK_PIXMAP) && (pxpm)) {
pxpm->Draw(surface, rcWhole);
return;
}
if ((markType == SC_MARK_RGBAIMAGE) && (image)) {
// Make rectangle just large enough to fit image centred on centre of rcWhole
PRectangle rcImage;
rcImage.top = ((rcWhole.top + rcWhole.bottom) - image->GetScaledHeight()) / 2;
rcImage.bottom = rcImage.top + image->GetScaledHeight();
rcImage.left = ((rcWhole.left + rcWhole.right) - image->GetScaledWidth()) / 2;
rcImage.right = rcImage.left + image->GetScaledWidth();
surface->DrawRGBAImage(rcImage, image->GetWidth(), image->GetHeight(), image->Pixels());
return;
}
const IntegerRectangle ircWhole(rcWhole);
// Restrict most shapes a bit
const PRectangle rc(rcWhole.left, rcWhole.top + 1, rcWhole.right, rcWhole.bottom - 1);
// Ensure does not go beyond edge
const int minDim = std::min(ircWhole.Width(), ircWhole.Height() - 2) - 1;
int centreX = (ircWhole.right + ircWhole.left) / 2;
const int centreY = (ircWhole.bottom + ircWhole.top) / 2;
const int dimOn2 = minDim / 2;
const int dimOn4 = minDim / 4;
const int blobSize = dimOn2 - 1;
const int armSize = dimOn2 - 2;
if (marginStyle == SC_MARGIN_NUMBER || marginStyle == SC_MARGIN_TEXT || marginStyle == SC_MARGIN_RTEXT) {
// On textual margins move marker to the left to try to avoid overlapping the text
centreX = ircWhole.left + dimOn2 + 1;
}
if (markType == SC_MARK_ROUNDRECT) {
PRectangle rcRounded = rc;
rcRounded.left = rc.left + 1;
rcRounded.right = rc.right - 1;
surface->RoundedRectangle(rcRounded, fore, back);
} else if (markType == SC_MARK_CIRCLE) {
const PRectangle rcCircle = PRectangle::FromInts(
centreX - dimOn2,
centreY - dimOn2,
centreX + dimOn2,
centreY + dimOn2);
surface->Ellipse(rcCircle, fore, back);
} else if (markType == SC_MARK_ARROW) {
Point pts[] = {
Point::FromInts(centreX - dimOn4, centreY - dimOn2),
Point::FromInts(centreX - dimOn4, centreY + dimOn2),
Point::FromInts(centreX + dimOn2 - dimOn4, centreY),
};
surface->Polygon(pts, std::size(pts), fore, back);
} else if (markType == SC_MARK_ARROWDOWN) {
Point pts[] = {
Point::FromInts(centreX - dimOn2, centreY - dimOn4),
Point::FromInts(centreX + dimOn2, centreY - dimOn4),
Point::FromInts(centreX, centreY + dimOn2 - dimOn4),
};
surface->Polygon(pts, std::size(pts), fore, back);
} else if (markType == SC_MARK_PLUS) {
Point pts[] = {
Point::FromInts(centreX - armSize, centreY - 1),
Point::FromInts(centreX - 1, centreY - 1),
Point::FromInts(centreX - 1, centreY - armSize),
Point::FromInts(centreX + 1, centreY - armSize),
Point::FromInts(centreX + 1, centreY - 1),
Point::FromInts(centreX + armSize, centreY - 1),
Point::FromInts(centreX + armSize, centreY + 1),
Point::FromInts(centreX + 1, centreY + 1),
Point::FromInts(centreX + 1, centreY + armSize),
Point::FromInts(centreX - 1, centreY + armSize),
Point::FromInts(centreX - 1, centreY + 1),
Point::FromInts(centreX - armSize, centreY + 1),
};
surface->Polygon(pts, std::size(pts), fore, back);
} else if (markType == SC_MARK_MINUS) {
Point pts[] = {
Point::FromInts(centreX - armSize, centreY - 1),
Point::FromInts(centreX + armSize, centreY - 1),
Point::FromInts(centreX + armSize, centreY + 1),
Point::FromInts(centreX - armSize, centreY + 1),
};
surface->Polygon(pts, std::size(pts), fore, back);
} else if (markType == SC_MARK_SMALLRECT) {
PRectangle rcSmall;
rcSmall.left = rc.left + 1;
rcSmall.top = rc.top + 2;
rcSmall.right = rc.right - 1;
rcSmall.bottom = rc.bottom - 2;
surface->RectangleDraw(rcSmall, fore, back);
} else if (markType == SC_MARK_EMPTY || markType == SC_MARK_BACKGROUND ||
markType == SC_MARK_UNDERLINE || markType == SC_MARK_AVAILABLE) {
// An invisible marker so don't draw anything
} else if (markType == SC_MARK_VLINE) {
surface->PenColour(colourBody);
surface->MoveTo(centreX, ircWhole.top);
surface->LineTo(centreX, ircWhole.bottom);
} else if (markType == SC_MARK_LCORNER) {
surface->PenColour(colourTail);
surface->MoveTo(centreX, ircWhole.top);
surface->LineTo(centreX, centreY);
surface->LineTo(ircWhole.right - 1, centreY);
} else if (markType == SC_MARK_TCORNER) {
surface->PenColour(colourTail);
surface->MoveTo(centreX, centreY);
surface->LineTo(ircWhole.right - 1, centreY);
surface->PenColour(colourBody);
surface->MoveTo(centreX, ircWhole.top);
surface->LineTo(centreX, centreY + 1);
surface->PenColour(colourHead);
surface->LineTo(centreX, ircWhole.bottom);
} else if (markType == SC_MARK_LCORNERCURVE) {
surface->PenColour(colourTail);
surface->MoveTo(centreX, ircWhole.top);
surface->LineTo(centreX, centreY - 3);
surface->LineTo(centreX + 3, centreY);
surface->LineTo(ircWhole.right - 1, centreY);
} else if (markType == SC_MARK_TCORNERCURVE) {
surface->PenColour(colourTail);
surface->MoveTo(centreX, centreY - 3);
surface->LineTo(centreX + 3, centreY);
surface->LineTo(ircWhole.right - 1, centreY);
surface->PenColour(colourBody);
surface->MoveTo(centreX, ircWhole.top);
surface->LineTo(centreX, centreY - 2);
surface->PenColour(colourHead);
surface->LineTo(centreX, ircWhole.bottom);
} else if (markType == SC_MARK_BOXPLUS) {
DrawBox(surface, centreX, centreY, blobSize, fore, colourHead);
DrawPlus(surface, centreX, centreY, blobSize, colourTail);
} else if (markType == SC_MARK_BOXPLUSCONNECTED) {
if (tFold == LineMarker::headWithTail)
surface->PenColour(colourTail);
else
surface->PenColour(colourBody);
surface->MoveTo(centreX, centreY + blobSize);
surface->LineTo(centreX, ircWhole.bottom);
surface->PenColour(colourBody);
surface->MoveTo(centreX, ircWhole.top);
surface->LineTo(centreX, centreY - blobSize);
DrawBox(surface, centreX, centreY, blobSize, fore, colourHead);
DrawPlus(surface, centreX, centreY, blobSize, colourTail);
if (tFold == LineMarker::body) {
surface->PenColour(colourTail);
surface->MoveTo(centreX + 1, centreY + blobSize);
surface->LineTo(centreX + blobSize + 1, centreY + blobSize);
surface->MoveTo(centreX + blobSize, centreY + blobSize);
surface->LineTo(centreX + blobSize, centreY - blobSize);
surface->MoveTo(centreX + 1, centreY - blobSize);
surface->LineTo(centreX + blobSize + 1, centreY - blobSize);
}
} else if (markType == SC_MARK_BOXMINUS) {
DrawBox(surface, centreX, centreY, blobSize, fore, colourHead);
DrawMinus(surface, centreX, centreY, blobSize, colourTail);
surface->PenColour(colourHead);
surface->MoveTo(centreX, centreY + blobSize);
surface->LineTo(centreX, ircWhole.bottom);
} else if (markType == SC_MARK_BOXMINUSCONNECTED) {
DrawBox(surface, centreX, centreY, blobSize, fore, colourHead);
DrawMinus(surface, centreX, centreY, blobSize, colourTail);
surface->PenColour(colourHead);
surface->MoveTo(centreX, centreY + blobSize);
surface->LineTo(centreX, ircWhole.bottom);
surface->PenColour(colourBody);
surface->MoveTo(centreX, ircWhole.top);
surface->LineTo(centreX, centreY - blobSize);
if (tFold == LineMarker::body) {
surface->PenColour(colourTail);
surface->MoveTo(centreX + 1, centreY + blobSize);
surface->LineTo(centreX + blobSize + 1, centreY + blobSize);
surface->MoveTo(centreX + blobSize, centreY + blobSize);
surface->LineTo(centreX + blobSize, centreY - blobSize);
surface->MoveTo(centreX + 1, centreY - blobSize);
surface->LineTo(centreX + blobSize + 1, centreY - blobSize);
}
} else if (markType == SC_MARK_CIRCLEPLUS) {
DrawCircle(surface, centreX, centreY, blobSize, fore, colourHead);
DrawPlus(surface, centreX, centreY, blobSize, colourTail);
} else if (markType == SC_MARK_CIRCLEPLUSCONNECTED) {
if (tFold == LineMarker::headWithTail)
surface->PenColour(colourTail);
else
surface->PenColour(colourBody);
surface->MoveTo(centreX, centreY + blobSize);
surface->LineTo(centreX, ircWhole.bottom);
surface->PenColour(colourBody);
surface->MoveTo(centreX, ircWhole.top);
surface->LineTo(centreX, centreY - blobSize);
DrawCircle(surface, centreX, centreY, blobSize, fore, colourHead);
DrawPlus(surface, centreX, centreY, blobSize, colourTail);
} else if (markType == SC_MARK_CIRCLEMINUS) {
surface->PenColour(colourHead);
surface->MoveTo(centreX, centreY + blobSize);
surface->LineTo(centreX, ircWhole.bottom);
DrawCircle(surface, centreX, centreY, blobSize, fore, colourHead);
DrawMinus(surface, centreX, centreY, blobSize, colourTail);
} else if (markType == SC_MARK_CIRCLEMINUSCONNECTED) {
surface->PenColour(colourHead);
surface->MoveTo(centreX, centreY + blobSize);
surface->LineTo(centreX, ircWhole.bottom);
surface->PenColour(colourBody);
surface->MoveTo(centreX, ircWhole.top);
surface->LineTo(centreX, centreY - blobSize);
DrawCircle(surface, centreX, centreY, blobSize, fore, colourHead);
DrawMinus(surface, centreX, centreY, blobSize, colourTail);
} else if (markType >= SC_MARK_CHARACTER) {
std::string character(1, static_cast<char>(markType - SC_MARK_CHARACTER));
const XYPOSITION width = surface->WidthText(fontForCharacter, character);
PRectangle rcText = rc;
rcText.left += (rc.Width() - width) / 2;
rcText.right = rc.left + width;
surface->DrawTextClipped(rcText, fontForCharacter, rcText.bottom - 2,
character, fore, back);
} else if (markType == SC_MARK_DOTDOTDOT) {
XYPOSITION right = static_cast<XYPOSITION>(centreX - 6);
for (int b = 0; b < 3; b++) {
const PRectangle rcBlob(right, rc.bottom - 4, right + 2, rc.bottom - 2);
surface->FillRectangle(rcBlob, fore);
right += 5.0f;
}
} else if (markType == SC_MARK_ARROWS) {
surface->PenColour(fore);
int right = centreX - 2;
const int armLength = dimOn2 - 1;
for (int b = 0; b < 3; b++) {
surface->MoveTo(right, centreY);
surface->LineTo(right - armLength, centreY - armLength);
surface->MoveTo(right, centreY);
surface->LineTo(right - armLength, centreY + armLength);
right += 4;
}
} else if (markType == SC_MARK_SHORTARROW) {
Point pts[] = {
Point::FromInts(centreX, centreY + dimOn2),
Point::FromInts(centreX + dimOn2, centreY),
Point::FromInts(centreX, centreY - dimOn2),
Point::FromInts(centreX, centreY - dimOn4),
Point::FromInts(centreX - dimOn4, centreY - dimOn4),
Point::FromInts(centreX - dimOn4, centreY + dimOn4),
Point::FromInts(centreX, centreY + dimOn4),
Point::FromInts(centreX, centreY + dimOn2),
};
surface->Polygon(pts, std::size(pts), fore, back);
} else if (markType == SC_MARK_LEFTRECT) {
PRectangle rcLeft = rcWhole;
rcLeft.right = rcLeft.left + 4;
surface->FillRectangle(rcLeft, back);
} else if (markType == SC_MARK_BOOKMARK) {
const int halfHeight = minDim / 3;
Point pts[] = {
Point::FromInts(ircWhole.left, centreY - halfHeight),
Point::FromInts(ircWhole.right - 3, centreY - halfHeight),
Point::FromInts(ircWhole.right - 3 - halfHeight, centreY),
Point::FromInts(ircWhole.right - 3, centreY + halfHeight),
Point::FromInts(ircWhole.left, centreY + halfHeight),
};
surface->Polygon(pts, std::size(pts), fore, back);
} else { // SC_MARK_FULLRECT
surface->FillRectangle(rcWhole, back);
}
}
| [
"zufuliu@gmail.com"
] | zufuliu@gmail.com |
dd4ce7924e037378f2cf527d68046a57e3e034ae | fea2ddb0436b1e46cca48d7202b95414ae88679b | /Rafaat Elhagan/Obstacle.cpp | b8f9d99645b30d78fab46616a7483a41b7a69437 | [] | no_license | medo/raafat-elhagan | b7d45df6c1dfe42e764f6ca87685cd720dfaf949 | 29da1f2b1ed6ae322f0c409471965d753b465e4b | refs/heads/master | 2021-06-04T08:41:58.906801 | 2018-10-28T17:24:43 | 2018-10-28T17:24:43 | 27,666,716 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 204 | cpp | //
// Obstacle.cpp
// Rafaat Elhagan
//
// Created by Mohamed Farghal on 12/11/14.
// Copyright (c) 2014 GUC. All rights reserved.
//
//
#include <stdio.h>
#include "Obstacle.h"
#include <iostream>
// | [
"mohamed@farghal.com"
] | mohamed@farghal.com |
6c4bf2ca2f0d88d807b2626576e693142a11ead0 | d28619b8589aa2ffaef74093d1b4236dbc8f5828 | /case3_CreditCard/testCard.cpp | 34f0d763141c70923839390414c64b126dfee082 | [] | no_license | Anthonyeef/Data-Structure | 7058918137b552f5531500781415acdbd4647926 | 17ed9b13de58372493b6454258d1318eb4235234 | refs/heads/master | 2021-01-10T19:54:27.256466 | 2015-10-26T03:50:40 | 2015-10-26T03:50:40 | 42,766,239 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 934 | cpp | //
// Created by Anthonyeef on 9/19/15.
//
#include <vector>
#include "CreditCard.h"
using namespace std;
void testCard() {
vector<CreditCard*> wallet(10);
wallet[0] = new CreditCard("5464 6543 9876 0976", "John Bowman", 2500);
wallet[1] = new CreditCard("2398 0238 9284 2013", "John Bowman", 3500);
wallet[2] = new CreditCard("2398 0238 8723 2013", "John Bowman", 4500);
for (int j = 0; j <= 16; ++j) {
wallet[0]->chargelt(double(j));
wallet[1]->chargelt(2 * j);
wallet[2]->chargelt(double(3 * j));
}
cout << "Card payments:\n";
for (int i = 0; i < 3 ; ++i) {
cout<< *wallet[i];
while (wallet[i]->getBalance() > 100.0) {
wallet[i]->makePayment(100.0);
cout<< "New balance = " << wallet[i]->getBalance()<<"\n";
}
cout<<"\n";
delete wallet[i];
}
}
int main() {
testCard();
return EXIT_SUCCESS;
}
| [
"anthonyeef@gmail.com"
] | anthonyeef@gmail.com |
14191236799758a8c6a73dd22909f64f6f113d97 | 681c84ad83ce6ad403a8f905f65f4bb43ef2bb87 | /hot/0/ellipse/T | d030e6f8aae1acc491a62e5bbcc294cd11f411b6 | [] | no_license | zachery-style/prolate | fd8c1b8edb5457508c50b431fc34c8bcfead1cab | b344df4ae9f22d16555b43b07cc66d0cd2fce3fd | refs/heads/main | 2023-04-08T22:07:41.537811 | 2021-04-14T02:28:52 | 2021-04-14T02:28:52 | 346,477,510 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,243 | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: v2012 |
| \\ / A nd | Website: www.openfoam.com |
| \\/ M anipulation | |
\*---------------------------------------------------------------------------*/
FoamFile
{
version 2.0;
format ascii;
class volScalarField;
location "0/ellipse";
object T;
}
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
dimensions [ 0 0 0 1 0 0 0 ];
internalField uniform 400;
boundaryField
{
ellipse_to_fluid
{
type compressible::turbulentTemperatureCoupledBaffleMixed;
value uniform 400;
Tnbr T;
kappaMethod solidThermo;
}
}
ellipse_to_fluid
{
type calculated;
value uniform 400;
}
// ************************************************************************* //
| [
"zachery.style@mines.sdsmt.edu"
] | zachery.style@mines.sdsmt.edu | |
8d288d3056af0c56fd9deadfd29104ee87b561b1 | 91e45eace638bc26e29c19b265e22f3590f311d1 | /5_Hex_BKPS/Project_programers/Project_programmer_UNO.ino | c8a364dc56d03fc9a84cb6ae4d01c64e1e59d02a | [] | no_license | aclandmark/PCB-111000_1 | 2243207a193555efa0bc2b523afbd19e7d58919e | 37e9c2be9e9183176bc1dbb6445787417cd70f0c | refs/heads/master | 2023-01-04T16:11:45.357849 | 2022-12-26T13:09:37 | 2022-12-26T13:09:37 | 205,899,791 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 18,286 | ino |
/********ATMEGA programmer for flash, config bits and EEPROM. Runs on an ATMEGA328.
Used to program the EEPROM of either device but the flash of the PCB_A device only.
The UNO flash is programmed using the PCB_A bootloader.
The reason foor this is that the devices run under different configuration settings.
To make the program as easy as possible to use, the strings used for user prompts are
stored in program memory space rather than the host EEPROM.
Strings to be programmed to the target EEPROM are also temporarily stored in SRAM.
Use of an anything with less SRAM than the Atmega 328 to host this program is not therefore recommended.
The programmer runs under configuarion settings Extended: 0xFF High: 0xD7 Low: 0xE2
The important parameters are: Watch dog under program control, EEprom preserved through chip erase and 8HMz clock
Terminal port settings: 57600 Baud, 8 data bits, no parity, 1 stop bit and no handshaking.
ON_CHIP EEPROM reservation for Atmega 328
0x3FD Default byte
0x3FE User cal byte
0x3FF User cal byte repeated
0x3F9 0 if PCB_A has just been programed
TARGET CHIP EEPROM reservations
0x0 Top of programmed text space MSB
0x1 Top of programmed text space LSB
0x2 Number of programmed data items
0x3 Bottom of application EEPROM space MSB
0x4 Bottom of application EEPROM space LSB
A hex file that comes even near to filling the Atmega 328 program space must be split into
two or more files which can be sent separately. The LED flashes when the download is in progress.
As soon as it stops flashing the next file can be sent.
Note: it appears that the Arduino GUI polls its target device at regular intervals using the null character.
This interferres with PCB 111000_UNO when text files are being programmed to EEPROM. The "EEPROM_programmer_sub.c" file
of this projects is therefore very slightly diffent from the eqivalent file used by "Project_programmmer_AVR". A line
has been introduced to ensure that null characters received during a text file download are ignored.
*/
#include "Project_programmer_UNO.h"
int main (void){
unsigned int target_type = 0, target_type_M; //Device signature bytes
unsigned char op_code;
unsigned char keypress;
unsigned char OSCCAL_mini_OS;
int error_mag;
CLKPR = (1 << CLKPCE);
CLKPR = (1 << CLKPS0); //Convert 16MHx xtal to 8MHx clock
setup_328_HW; //see "Resources\ATMEGA_Programmer.h"
/*****************Power-up and make contact with target****************************/
while(1){
do{sendString("s ");}
while((isCharavailable(255) == 0)); //User prompt
if(receiveChar() == 's')break;}
Atmel_powerup_and_target_detect; //Leave target in programming mode
if (Atmel_config(read_fuse_bits_h, 0) == 0xFF)
pcb_type = 1; //UNO pcb device
else pcb_type = 2; //PC_A device
sendString ("\r\n\r\nATMEGA");
if (pcb_type == 1)sendString (" (UNO)");
else sendString (" (PCB_A)");
switch (target){
case 3281: sendString ("328"); break;
case 3282: sendString ("328P");break;
default: wdt_enable(WDTO_1S); while(1);break;}
PageSZ = 0x40; PAmask = 0x3FC0; FlashSZ=0x4000; //flash page size, gives address on page, flash size words
EE_top = 0x400-0x10; //Last 16 bytes reseerved for system use
text_start = 0x5; //First 5 bytes reserved for programmmer use
sendString(" detected\r\nPress -p- or -e- to program flash \
or EEPROM (or -x- to escape).");
while(1){
op_code = waitforkeypress();
switch (op_code){
case 'e': Prog_EEPROM(); break;
case 'd': //Delete contents of the EEPROM
sendString("\r\nReset EEPROM! D or AOK to escape"); //but leave cal data.
newline();
if(waitforkeypress() == 'D'){
sendString("10 sec wait");
for (int m = 0; m < EE_top; m++)
{Read_write_mem('I', m, 0xFF);}
sendString(" Done\r\n");}
Exit_Programmer;break;
case 'p':
case 'P': break;
case 'x':
case 'X': Exit_Programmer;break;
default: break;}
if ((op_code == 'P') || (op_code == 'p')) break;}
if (Atmel_config(read_fuse_bits_h, 0) == 0xFF)
{sendString("\r\nCannot be used to program UNO flash\r\n");
Exit_Programmer;}
sendString("\r\nSend Program file (or x to escape).\r\n");
while ((keypress = waitforkeypress()) != ':') //Ignore characters before the first ':'
{if (keypress == 'x'){Exit_Programmer;}} //X pressed to escape
Initialise_variables_for_programming_flash;
UCSR0B |= (1<<RXCIE0); sei(); //Set UART Rx interrupt
(Atmel_config(Chip_erase_h, 0)); //Erase chip after first char of hex file has been received
Program_Flash();
/***Program target config space***/
Atmel_config(write_extended_fuse_bits_h,0xFD ); //2.7V BOD
Atmel_config(write_fuse_bits_H_h,0xD0 ); //WDT under prog control and Eeprom preserved, Reset vector 0x7000
Atmel_config(write_fuse_bits_h,0xE2 ); //8MHz internal RC clock with 65mS SUT
Atmel_config(write_lock_bits_h,0xFF ); //No memory lock
Verify_Flash();
sendString (Version);
sendString("Programming PCB_A");
sendString("\r\nConfig bytes: Fuses extended, \
high, low and lock\r\n"); //Print out fuse bytes, cal byte and file sizes
sendHex(16, Atmel_config(read_extended_fuse_bits_h, 0));
sendHex(16, Atmel_config(read_fuse_bits_H_h,0));
sendHex(16, Atmel_config(read_fuse_bits_h, 0));
sendHex(16, Atmel_config(read_lock_bits_h, 0));
newline();
sendString("Hex_file_size: ");
sendHex(10,cmd_counter); sendString(" d'loaded: ");
sendHex(10,prog_counter); sendString(" in: ");
sendHex(10,read_ops); sendString(" out\r\n");
if(pcb_type == 1) //UNO pcb: Note this version never programs the UNO flash
Read_write_mem('I', 0x3FC,0x80); //Therefore this line is never executed
if(pcb_type == 2) //PCB_A
{Read_write_mem('I', 0x3F9, 0); //Ensures that PCB_A jumps to mini-os immediately post programming
Read_write_mem('I', 0x3F1, 0); //Only autocal PCB_A after programming flash.
Read_write_mem('I', 0x3F4, 0); //I2C_V18 resets UNO when it first runs
}
Reset_H; //Set target device running
/*************Auto cal mini-OS device*********************/
set_up_I2C;
waiting_for_I2C_master;
OSCCAL_mini_OS = receive_byte_with_Ack();
error_mag = receive_byte_with_Ack() << 8;
error_mag += receive_byte_with_Nack();
clear_I2C_interrupt;
sendString("\r\nmini_OS OSCCAL user value "); sendHex(10,OSCCAL_mini_OS);
sendString("calibration error "); sendHex(10,error_mag);
/*********************************/
UCSR0B &= (~((1 << RXEN0) | (1<< TXEN0))); //Dissable UART
while(1);
return 1;}
/***************************************************************************************************************************************************/
ISR(USART_RX_vect){
unsigned char Rx_Hex_char=0;
unsigned char Rx_askii_char;
int local_pointer;
Rx_askii_char = receiveChar();
switch (Rx_askii_char){
case '0': Rx_Hex_char = 0x00; break; //Convert askii chars received from hex file to binary digits
case '1': Rx_Hex_char = 0x01; break;
case '2': Rx_Hex_char = 0x02; break;
case '3': Rx_Hex_char = 0x03; break;
case '4': Rx_Hex_char = 0x04; break;
case '5': Rx_Hex_char = 0x05; break;
case '6': Rx_Hex_char = 0x06; break;
case '7': Rx_Hex_char = 0x07; break;
case '8': Rx_Hex_char = 0x08; break;
case '9': Rx_Hex_char = 0x09; break;
case 'A': Rx_Hex_char = 0x0A; break;
case 'B': Rx_Hex_char = 0x0B; break;
case 'C': Rx_Hex_char = 0x0C; break;
case 'D': Rx_Hex_char = 0x0D; break;
case 'E': Rx_Hex_char = 0x0E; break;
case 'F': Rx_Hex_char = 0x0F; break;
case ':': counter = 0; break;
default: break;}
switch (counter){
case 0x0: break; //Detect -:- at start of new line
case 0x1: tempInt1 = Rx_Hex_char<<4; break; //Acquire first digit
case 0x2: tempInt1 += Rx_Hex_char; //Acquire second digit and combine with first to obtain number of commands in line
char_count = 9 + ((tempInt1) *2); //Calculate line length in terms of individual characters
local_pointer = w_pointer++; //Update pointer to array "store"
store[local_pointer] = tempInt1; break; //Save the number of commands in the line to the array
case 0x3: tempInt1 = Rx_Hex_char<<4; break; //Next 4 digits give the address of the first command in the line
case 0x4: tempInt1 += Rx_Hex_char;
tempInt1=tempInt1<<8; break; //Acquire second digit and combine it with first
case 0x5: tempInt1 += Rx_Hex_char<<4; break; //Continue for third digit
case 0x6: tempInt1 += Rx_Hex_char; //Acquire final digit and caculate address of next command
local_pointer = w_pointer++; //Update pointers to array "store"
store[local_pointer] = tempInt1; break; //Save address of next command to array "store"
case 0x7: break; //chars 7 and 8 are not used
case 0x8: break;
default: break;}
if ((counter > 8)&&(counter < char_count)){ //Continue to acquire, decode and store commands
if ((counter & 0x03) == 0x01){tempInt1 = Rx_Hex_char<<4;} //Note: Final two chars at the end of every line are ignored
if ((counter & 0x03) == 0x02) {tempInt1 += Rx_Hex_char;}
if ((counter & 0x03) == 0x03) {tempInt2 = Rx_Hex_char<<4;}
if ((counter & 0x03) == 0x0) {tempInt2+= Rx_Hex_char;
tempInt2=tempInt2<<8;tempInt1+=tempInt2;
local_pointer = w_pointer++;
store[local_pointer] = tempInt1; cmd_counter++;}}
counter++;
w_pointer = w_pointer & 0b00011111; } //Overwrites array after 32 entries
/***************************************************************************************************************************************************/
void Program_Flash (void){
new_record(); //Start reading first record which is being downloaded to array "store"
start_new_code_block(); //Initialise new programming block (usually starts at address zero but not exclusivle so)
Program_record(); //Coppy commands from array "store" to the page_buffer
while(1){
new_record(); //Continue reading subsequent records
if (record_length==0)break; //Escape when end of hex file is reached
if (Hex_address == HW_address){ //Normal code: Address read from hex file equals HW address and lines contains 8 commands
switch(short_record){
case 0: if (space_on_page == (PageSZ - line_offset)) //If starting new page
{page_address = (Hex_address & PAmask);} //get new page address
break;
case 1: start_new_code_block(); //Short line with no break in file (often found in WinAVR hex files).
short_record=0;break;}}
if(Hex_address != HW_address){ //Break in file
if (section_break){ //Section break: always found when two hex files are combined into one
if((Flash_flag) && (!(orphan)))
{write_page_SUB(page_address);} //Burn contents of the partially full page buffer to flash
if(orphan)
write_page_SUB(page_address + PageSZ);} //Burn outstanding commands to the next page in flash
if(page_break) //In practice page breaks and short jumps are rarely if ever found
{if((Flash_flag) && (!(orphan))) //Burn contents of the partially filled page buffer to flash
{write_page_SUB(page_address);}
orphan = 0;}
start_new_code_block(); //A new code block is always required where there is a break in the hex file.
short_record=0;}
Program_record();} //Continue filling page_buffer
cli();
UCSR0B &= (~(1<<RXCIE0)); //download complete, disable UART Rx interrupt
LEDs_off;
while(1){if (isCharavailable(1)==1)receiveChar();
else break;} //Clear last few characters of hex file
if((Flash_flag) && (!(orphan)))
{write_page_SUB(page_address);} //Burn final contents of page_buffer to flash
if(orphan) {write_page_SUB(page_address + PageSZ);}}
/***************************************************************************************************************************************************/
void Verify_Flash (void){
int line_counter = 0, print_line = 0; //Controls printing of hex file
int line_no; //Refers to the .hex file
signed int phys_address; //Address in flash memory
signed int prog_counter_mem; //Initialised with size of .hex file used for programming
unsigned char print_out_mode = 0; //Print out flash contents as hex or askii characters
char skip_lines[4]; //Enter number to limit the print out
phys_address = 0; read_ops=0;
line_no = 0; prog_counter_mem = prog_counter;
sendString("Integer(0-FF)? "); //0 prints no lines -1-, every line, -8- prints every eighth line etc...
skip_lines[0] = '0'; //Acquire integer between 0 and FF
skip_lines[1] = waitforkeypress();
skip_lines[2] = '\0';
timer_T1_sub(T1_delay_500mS);
if (isCharavailable(1)){skip_lines[0] = skip_lines[1];
skip_lines[1] = receiveChar();}
binUnwantedChars();
print_line = askiX2_to_hex(skip_lines);
sendHex (16,print_line); sendString(" ");
if (print_line == 0); //hex file print out not required
else {sendString("1/2?\r\n"); //else -1- sends file as askii, -2- sends it as hex
print_out_mode = waitforkeypress();
binUnwantedChars();
newline();}
while(1){ if(!(prog_counter_mem))break; //print out loop starts here, exit when finished
while(1) { //Start reading the flash memory searching for the next hex command
Hex_cmd = Read_write_mem('L',phys_address, 0x0);
Hex_cmd = (Hex_cmd<<8) + (Read_write_mem('H',phys_address, 0x0));
phys_address++;
if (phys_address == FlashSZ)break; //No more memory? Quit if yes
if (Hex_cmd != 0xFFFF) break; //If the hex command is 0xFFFF remain in this loop otherwise exit.
LEDs_on;}
LEDs_off;
if (phys_address == FlashSZ)break; //Exit when there is no more flash to read
if ((print_line == 0) && (!(line_no%10)))
sendChar('*'); //Print out of hex file not required
//Print a -*- every tenth line of the file
if(print_line && (!(line_no%print_line))) //Print out required: Print all lines or just a selection
{newline(); sendHex (16, (phys_address-1)*2);
sendString(" "); line_counter++;
if(print_out_mode == '1'){send_as_askii;} //Start with the address of the first command in the line
else sendHex (16, Hex_cmd);} //Print first command in askii or hex
read_ops++; //Value to be sent to PC for comparison with the hex filer size
prog_counter_mem--; //"prog_counter_mem" decrements to zero when the end of the file is reached
for(int m=0; m<7; m++){ //Read the next seven locations in the flash memory
Hex_cmd = Read_write_mem('L',phys_address, 0x0);
Hex_cmd = (Hex_cmd<<8) + (Read_write_mem('H',phys_address, 0x0));
phys_address++;
if(Hex_cmd == 0xFFFF)break; //Read 0xFFFF: return to start of print out loop
prog_counter_mem--;
if ((print_line) && (!(line_counter%2))) {LEDs_on;} else {LEDs_off;}
if(print_line && (!(line_no%print_line)))
{if(print_out_mode == '1'){send_as_askii;}
else sendHex (16, Hex_cmd);}
read_ops++;
if(phys_address==FlashSZ)break;}
if ((print_line)&&(!(line_no%print_line)) && (!(line_counter%8)))sendString("\r\n");
line_no++;
if (phys_address == FlashSZ)break;}
LEDs_off;
newline();newline(); }
/***********************************************************/
unsigned char receive_byte_with_Ack(void){
char byte;
TWCR = (1 << TWEA) | (1 << TWEN) | (1 << TWINT); //Set Ack enable and clear interrupt
while (!(TWCR & (1 << TWINT))); //Wait for interrupt
byte = TWDR;
return byte;}
/***********************************************************/
unsigned char receive_byte_with_Nack(void){
char byte;
TWCR = (1 << TWEN) | (1 << TWINT); //Set Ack enable and clear interrupt
while (!(TWCR & (1 << TWINT))); //Wait for interrupt
byte = TWDR;
return byte;}
| [
"mark.osborne15@btinternet.com"
] | mark.osborne15@btinternet.com |
9a679c79800f576f01c75d5f3a10261f4f235309 | f1b8eb3006239567c883d54135a6c11ecee0a57a | /LeftRightShifts.cpp | 649fcc1e89f3315c00b3830c283115db63091761 | [] | no_license | ChetanKrishna07/left-and-right-shift-a-number | 42396870440a3390e90ec3d5dc9659ca527f8349 | baf9dba5429bbf75fb7756b7ef4a0d625d39b50a | refs/heads/main | 2023-02-22T01:06:18.213860 | 2021-01-29T18:24:30 | 2021-01-29T18:24:30 | 334,226,602 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 694 | cpp | #include <stdio.h>
#include <math.h>
int leftShift(int n);
int rightShift(int n);
int getLength(int n);
int main() {
int n, lS, rS;
scanf("%d", &n);
lS = leftShift(n);
rS = rightShift(n);
printf("Right Shift of %d is %d.\nLeft Shift of %d is %d.", n, rS, n, lS);
return 0;
}
int leftShift(int n) {
int count, result, mul;
count = getLength(n);
mul = pow(10, count - 1);
result = (n%mul)*10 + (n/mul);
return result;
}
int rightShift(int n) {
int count, result, mul;
count = getLength(n);
mul = pow(10, count - 1);
result = (n%10)*mul + (n/10);
return result;
}
int getLength(int n) {
int count = 0;
while(n!=0) {
n/=10;
++count;
}
return count;
}
| [
"chetanpalicherla@gmail.com"
] | chetanpalicherla@gmail.com |
9a0aaec68344a7e4d9371cda33910c2bd146c286 | 1346a61bccb11d41e36ae7dfc613dafbe56ddb29 | /GeometricTools/GTEngine/Include/GteImage2.h | 1a0b830f21b81aadd8b0c76699451b1f94d5545c | [] | no_license | cnsuhao/GeometricToolsEngine1p0 | c9a5845e3eb3a44733445c02bfa57c8ed286a499 | d4f2b7fda351917d4bfc3db1c6f8090f211f63d1 | refs/heads/master | 2021-05-28T02:00:50.566024 | 2014-08-14T07:28:23 | 2014-08-14T07:28:23 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,094 | h | // Geometric Tools LLC, Redmond WA 98052
// Copyright (c) 1998-2014
// Distributed under the Boost Software License, Version 1.0.
// http://www.boost.org/LICENSE_1_0.txt
// http://www.geometrictools.com/License/Boost/LICENSE_1_0.txt
// File Version: 1.0.0 (2014/08/11)
#pragma once
#include "GteImage.h"
#include "GteLogger.h"
#include <array>
namespace gte
{
// The PixelType must be "plain old data" (POD) and cannot have side effects
// from construction or destruction.
template <typename PixelType>
class Image2 : public Image
{
public:
// The default constructor creates a null image. You can resize the image
// later with an explicit Resize call, an assignment, or by loading the
// image from disk.
virtual ~Image2 ();
Image2 ();
// Copy the input image using the assignment operator.
Image2 (Image2 const& image);
// The input dimensions must be positive; otherwise, a null image is
// created.
Image2 (int dimension0, int dimension1);
// If the input image is compatible with 'this', a copy of the input
// image data occurs. If the input image is not compatible, 'this' is
// recreated to be a copy of 'image'.
Image2& operator= (Image2 const& image);
// The input array must have the correct number of pixels as determined by
// the image parameters. Use at your own risk, because we cannot verify
// the compatibility.
virtual void SetRawPixels (char* rawPixels);
// Conversion between 1-dimensional indices and 2-dimensional coordinates.
inline int GetIndex (int x, int y) const;
inline int GetIndex (std::array<int,2> const& coord) const;
inline void GetCoordinates (int index, int& x, int& y) const;
inline std::array<int,2> GetCoordinates (int index) const;
// Access the data as a 1-dimensional array. The operator[] functions
// test for valid i in debug configurations and assert on invalid i. The
// Get() functions test for valid i and clamp when invalid (debug and
// release); these functions cannot fail.
inline PixelType* GetPixels1D () const;
inline PixelType& operator[] (int i);
inline PixelType const& operator[] (int i) const;
PixelType& Get (int i);
PixelType const& Get (int i) const;
// Access the data as a 2-dimensional array. Pixel (x,y) is accessed
// as "pixels2D[y][x]". The operator() functions test for valid (x,y) in
// debug configurations and assert on invalid (x,y). The Get() functions
// test for valid (x,y) and clamp when invalid (debug and release); these
// functions cannot fail.
inline PixelType** GetPixels2D () const;
inline PixelType& operator() (int x, int y);
inline PixelType const& operator() (int x, int y) const;
inline PixelType& operator() (std::array<int,2> const& coord);
inline PixelType const& operator() (std::array<int,2> const& coord) const;
inline PixelType& Get (int x, int y);
inline PixelType const& Get (int x, int y) const;
inline PixelType& Get (std::array<int,2> coord);
inline PixelType const& Get (std::array<int,2> coord) const;
// Resize an image. All data is lost from the original image. The
// function is convenient for taking a default-constructed image and
// setting its dimension once it is known. This avoids an irrelevant
// memory copy that occurs if instead you were to use the statement
// image = Image1<PixelType>(dimension0, dimension1). The return value
// is 'true' whenever the image is resized (reallocations occurred).
bool Resize (int dimension0, int dimension1);
// Set all pixels to the specified value.
void SetAllPixels (PixelType const& value);
// The required dimensions and pixel type are that of the current image
// object.
bool Load (std::string const& filename);
private:
void AllocatePointers ();
void DeallocatePointers ();
// Typed pointers to Image::mRawPixels.
PixelType** mPixels;
// Uninitialized, used in the Get(int) calls.
PixelType mInvalidPixel;
};
#include "GteImage2.inl"
}
| [
"qloach@foxmail.com"
] | qloach@foxmail.com |
11ba7c5356e971e605758c8a9280cc89368a1dc1 | b1767fc21c21aa5d7dbb3928ec05cfc4529037bb | /PersonManager/filemanager.h | 548ff2ece4e4a5123a07d09764e4cdd17f293829 | [] | no_license | gaissa/school-temp | 518b92f716d305b5ef901787d641c0f17c593beb | 043d619aa6fb1b7d89eda45ac55bd09d303b2540 | refs/heads/master | 2016-09-15T22:41:25.769324 | 2014-05-15T16:41:25 | 2014-05-15T16:41:25 | 17,829,423 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 397 | h | #ifndef FILEMANAGER_H
#define FILEMANAGER_H
#include <gui.h>
class FileManager : Gui
{
public:
FileManager();
~FileManager();
void saveValues(QString q);
QStringList loadValues();
QString writeValues();
void readValues();
QString getFileName();
private:
QStringList personList;
QStringList loadedList;
QString loadFile;
};
#endif // FILEMANAGER_H
| [
"jannekahkonen@gmail.com"
] | jannekahkonen@gmail.com |
306319d69413026548e4640a00bf2f0bcd6d49e6 | 4bc239619d4511d4551909d0e4353e71f0b2f439 | /Практическое занятие 5/Exercise_5_zadanie_2_sln/Exercise_5_zadanie_2/Exercise_5_zadanie_2.cpp | dde672190eff05b9558af0840800f12a1a90a537 | [] | no_license | 87053334313/c- | d8f2987a33f014b5ae05938963ea98e5d1303e09 | be9dbe9ede40340a60b0336a5913a372c9d3be0c | refs/heads/main | 2023-07-03T10:19:13.109791 | 2021-07-30T15:48:29 | 2021-07-30T15:48:29 | 383,513,247 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 774 | cpp |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
system("chcp 1251");
vector<int> v1;
vector<int> v2;
int a, b, c;
int k = 0;
for (int i = 0; i < 10; i++)
{
a = rand() % 10 + 1;
b = rand() % 10 + 1;
cout << a << " * " << b << " = ";
cin >> c;
if (a * b != c)
{
v2.push_back(c);
k++;
cout << "Непраильно"<<endl;
cout << a << "*" << b <<"="<< a * b;
}
else
{
v1.push_back(c);
}
cout << endl;
}
cout << endl;
cout << "Правильные ответы: " << endl;
for (int i = 0; i < v1.size(); i++)
{
cout << v1[i] << endl;
}
cout << endl;
cout << "Неправильных "<< k<< ", они:"<<endl;
for (int i = 0; i < v2.size(); i = i + 1)
{
cout << v2[i] << endl;
}
}
| [
"87053334313@mail.ru"
] | 87053334313@mail.ru |
31f982a5f44fc22f0ab1bcf2a203b804cb49b905 | 43c8089fed0642fb228efb9162280951c7e389c4 | /libcef_dll/ctocpp/dictionary_value_ctocpp.cc | e51d99b22aba4a2797466126d9bb90dc83e454c0 | [
"MIT"
] | permissive | Steveb-p/brick | 369e1618e03ab6df1042bd8f3942305a34d33302 | 82d4b54806ab30504c5a38386663d0d1b7c99150 | refs/heads/master | 2020-08-11T18:23:18.570244 | 2020-05-14T08:30:57 | 2020-05-14T08:30:57 | 214,607,683 | 1 | 1 | MIT | 2019-10-12T08:17:43 | 2019-10-12T08:17:43 | null | UTF-8 | C++ | false | false | 16,834 | cc | // Copyright (c) 2015 The Chromium Embedded Framework Authors. All rights
// reserved. Use of this source code is governed by a BSD-style license that
// can be found in the LICENSE file.
//
// ---------------------------------------------------------------------------
//
// This file was generated by the CEF translator tool. If making changes by
// hand only do so within the body of existing method and function
// implementations. See the translator.README.txt file in the tools directory
// for more information.
//
#include "libcef_dll/ctocpp/binary_value_ctocpp.h"
#include "libcef_dll/ctocpp/dictionary_value_ctocpp.h"
#include "libcef_dll/ctocpp/list_value_ctocpp.h"
#include "libcef_dll/ctocpp/value_ctocpp.h"
#include "libcef_dll/transfer_util.h"
// STATIC METHODS - Body may be edited by hand.
CefRefPtr<CefDictionaryValue> CefDictionaryValue::Create() {
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Execute
cef_dictionary_value_t* _retval = cef_dictionary_value_create();
// Return type: refptr_same
return CefDictionaryValueCToCpp::Wrap(_retval);
}
// VIRTUAL METHODS - Body may be edited by hand.
bool CefDictionaryValueCToCpp::IsValid() {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, is_valid))
return false;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Execute
int _retval = _struct->is_valid(_struct);
// Return type: bool
return _retval?true:false;
}
bool CefDictionaryValueCToCpp::IsOwned() {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, is_owned))
return false;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Execute
int _retval = _struct->is_owned(_struct);
// Return type: bool
return _retval?true:false;
}
bool CefDictionaryValueCToCpp::IsReadOnly() {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, is_read_only))
return false;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Execute
int _retval = _struct->is_read_only(_struct);
// Return type: bool
return _retval?true:false;
}
bool CefDictionaryValueCToCpp::IsSame(CefRefPtr<CefDictionaryValue> that) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, is_same))
return false;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Verify param: that; type: refptr_same
DCHECK(that.get());
if (!that.get())
return false;
// Execute
int _retval = _struct->is_same(_struct,
CefDictionaryValueCToCpp::Unwrap(that));
// Return type: bool
return _retval?true:false;
}
bool CefDictionaryValueCToCpp::IsEqual(CefRefPtr<CefDictionaryValue> that) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, is_equal))
return false;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Verify param: that; type: refptr_same
DCHECK(that.get());
if (!that.get())
return false;
// Execute
int _retval = _struct->is_equal(_struct,
CefDictionaryValueCToCpp::Unwrap(that));
// Return type: bool
return _retval?true:false;
}
CefRefPtr<CefDictionaryValue> CefDictionaryValueCToCpp::Copy(
bool exclude_empty_children) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, copy))
return NULL;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Execute
cef_dictionary_value_t* _retval = _struct->copy(_struct,
exclude_empty_children);
// Return type: refptr_same
return CefDictionaryValueCToCpp::Wrap(_retval);
}
size_t CefDictionaryValueCToCpp::GetSize() {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, get_size))
return 0;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Execute
size_t _retval = _struct->get_size(_struct);
// Return type: simple
return _retval;
}
bool CefDictionaryValueCToCpp::Clear() {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, clear))
return false;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Execute
int _retval = _struct->clear(_struct);
// Return type: bool
return _retval?true:false;
}
bool CefDictionaryValueCToCpp::HasKey(const CefString& key) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, has_key))
return false;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Verify param: key; type: string_byref_const
DCHECK(!key.empty());
if (key.empty())
return false;
// Execute
int _retval = _struct->has_key(_struct,
key.GetStruct());
// Return type: bool
return _retval?true:false;
}
bool CefDictionaryValueCToCpp::GetKeys(KeyList& keys) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, get_keys))
return false;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Translate param: keys; type: string_vec_byref
cef_string_list_t keysList = cef_string_list_alloc();
DCHECK(keysList);
if (keysList)
transfer_string_list_contents(keys, keysList);
// Execute
int _retval = _struct->get_keys(_struct,
keysList);
// Restore param:keys; type: string_vec_byref
if (keysList) {
keys.clear();
transfer_string_list_contents(keysList, keys);
cef_string_list_free(keysList);
}
// Return type: bool
return _retval?true:false;
}
bool CefDictionaryValueCToCpp::Remove(const CefString& key) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, remove))
return false;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Verify param: key; type: string_byref_const
DCHECK(!key.empty());
if (key.empty())
return false;
// Execute
int _retval = _struct->remove(_struct,
key.GetStruct());
// Return type: bool
return _retval?true:false;
}
CefValueType CefDictionaryValueCToCpp::GetType(const CefString& key) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, get_type))
return VTYPE_INVALID;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Verify param: key; type: string_byref_const
DCHECK(!key.empty());
if (key.empty())
return VTYPE_INVALID;
// Execute
cef_value_type_t _retval = _struct->get_type(_struct,
key.GetStruct());
// Return type: simple
return _retval;
}
CefRefPtr<CefValue> CefDictionaryValueCToCpp::GetValue(const CefString& key) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, get_value))
return NULL;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Verify param: key; type: string_byref_const
DCHECK(!key.empty());
if (key.empty())
return NULL;
// Execute
cef_value_t* _retval = _struct->get_value(_struct,
key.GetStruct());
// Return type: refptr_same
return CefValueCToCpp::Wrap(_retval);
}
bool CefDictionaryValueCToCpp::GetBool(const CefString& key) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, get_bool))
return false;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Verify param: key; type: string_byref_const
DCHECK(!key.empty());
if (key.empty())
return false;
// Execute
int _retval = _struct->get_bool(_struct,
key.GetStruct());
// Return type: bool
return _retval?true:false;
}
int CefDictionaryValueCToCpp::GetInt(const CefString& key) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, get_int))
return 0;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Verify param: key; type: string_byref_const
DCHECK(!key.empty());
if (key.empty())
return 0;
// Execute
int _retval = _struct->get_int(_struct,
key.GetStruct());
// Return type: simple
return _retval;
}
double CefDictionaryValueCToCpp::GetDouble(const CefString& key) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, get_double))
return 0;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Verify param: key; type: string_byref_const
DCHECK(!key.empty());
if (key.empty())
return 0;
// Execute
double _retval = _struct->get_double(_struct,
key.GetStruct());
// Return type: simple
return _retval;
}
CefString CefDictionaryValueCToCpp::GetString(const CefString& key) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, get_string))
return CefString();
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Verify param: key; type: string_byref_const
DCHECK(!key.empty());
if (key.empty())
return CefString();
// Execute
cef_string_userfree_t _retval = _struct->get_string(_struct,
key.GetStruct());
// Return type: string
CefString _retvalStr;
_retvalStr.AttachToUserFree(_retval);
return _retvalStr;
}
CefRefPtr<CefBinaryValue> CefDictionaryValueCToCpp::GetBinary(
const CefString& key) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, get_binary))
return NULL;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Verify param: key; type: string_byref_const
DCHECK(!key.empty());
if (key.empty())
return NULL;
// Execute
cef_binary_value_t* _retval = _struct->get_binary(_struct,
key.GetStruct());
// Return type: refptr_same
return CefBinaryValueCToCpp::Wrap(_retval);
}
CefRefPtr<CefDictionaryValue> CefDictionaryValueCToCpp::GetDictionary(
const CefString& key) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, get_dictionary))
return NULL;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Verify param: key; type: string_byref_const
DCHECK(!key.empty());
if (key.empty())
return NULL;
// Execute
cef_dictionary_value_t* _retval = _struct->get_dictionary(_struct,
key.GetStruct());
// Return type: refptr_same
return CefDictionaryValueCToCpp::Wrap(_retval);
}
CefRefPtr<CefListValue> CefDictionaryValueCToCpp::GetList(
const CefString& key) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, get_list))
return NULL;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Verify param: key; type: string_byref_const
DCHECK(!key.empty());
if (key.empty())
return NULL;
// Execute
cef_list_value_t* _retval = _struct->get_list(_struct,
key.GetStruct());
// Return type: refptr_same
return CefListValueCToCpp::Wrap(_retval);
}
bool CefDictionaryValueCToCpp::SetValue(const CefString& key,
CefRefPtr<CefValue> value) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, set_value))
return false;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Verify param: key; type: string_byref_const
DCHECK(!key.empty());
if (key.empty())
return false;
// Verify param: value; type: refptr_same
DCHECK(value.get());
if (!value.get())
return false;
// Execute
int _retval = _struct->set_value(_struct,
key.GetStruct(),
CefValueCToCpp::Unwrap(value));
// Return type: bool
return _retval?true:false;
}
bool CefDictionaryValueCToCpp::SetNull(const CefString& key) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, set_null))
return false;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Verify param: key; type: string_byref_const
DCHECK(!key.empty());
if (key.empty())
return false;
// Execute
int _retval = _struct->set_null(_struct,
key.GetStruct());
// Return type: bool
return _retval?true:false;
}
bool CefDictionaryValueCToCpp::SetBool(const CefString& key, bool value) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, set_bool))
return false;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Verify param: key; type: string_byref_const
DCHECK(!key.empty());
if (key.empty())
return false;
// Execute
int _retval = _struct->set_bool(_struct,
key.GetStruct(),
value);
// Return type: bool
return _retval?true:false;
}
bool CefDictionaryValueCToCpp::SetInt(const CefString& key, int value) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, set_int))
return false;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Verify param: key; type: string_byref_const
DCHECK(!key.empty());
if (key.empty())
return false;
// Execute
int _retval = _struct->set_int(_struct,
key.GetStruct(),
value);
// Return type: bool
return _retval?true:false;
}
bool CefDictionaryValueCToCpp::SetDouble(const CefString& key, double value) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, set_double))
return false;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Verify param: key; type: string_byref_const
DCHECK(!key.empty());
if (key.empty())
return false;
// Execute
int _retval = _struct->set_double(_struct,
key.GetStruct(),
value);
// Return type: bool
return _retval?true:false;
}
bool CefDictionaryValueCToCpp::SetString(const CefString& key,
const CefString& value) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, set_string))
return false;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Verify param: key; type: string_byref_const
DCHECK(!key.empty());
if (key.empty())
return false;
// Unverified params: value
// Execute
int _retval = _struct->set_string(_struct,
key.GetStruct(),
value.GetStruct());
// Return type: bool
return _retval?true:false;
}
bool CefDictionaryValueCToCpp::SetBinary(const CefString& key,
CefRefPtr<CefBinaryValue> value) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, set_binary))
return false;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Verify param: key; type: string_byref_const
DCHECK(!key.empty());
if (key.empty())
return false;
// Verify param: value; type: refptr_same
DCHECK(value.get());
if (!value.get())
return false;
// Execute
int _retval = _struct->set_binary(_struct,
key.GetStruct(),
CefBinaryValueCToCpp::Unwrap(value));
// Return type: bool
return _retval?true:false;
}
bool CefDictionaryValueCToCpp::SetDictionary(const CefString& key,
CefRefPtr<CefDictionaryValue> value) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, set_dictionary))
return false;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Verify param: key; type: string_byref_const
DCHECK(!key.empty());
if (key.empty())
return false;
// Verify param: value; type: refptr_same
DCHECK(value.get());
if (!value.get())
return false;
// Execute
int _retval = _struct->set_dictionary(_struct,
key.GetStruct(),
CefDictionaryValueCToCpp::Unwrap(value));
// Return type: bool
return _retval?true:false;
}
bool CefDictionaryValueCToCpp::SetList(const CefString& key,
CefRefPtr<CefListValue> value) {
cef_dictionary_value_t* _struct = GetStruct();
if (CEF_MEMBER_MISSING(_struct, set_list))
return false;
// AUTO-GENERATED CONTENT - DELETE THIS COMMENT BEFORE MODIFYING
// Verify param: key; type: string_byref_const
DCHECK(!key.empty());
if (key.empty())
return false;
// Verify param: value; type: refptr_same
DCHECK(value.get());
if (!value.get())
return false;
// Execute
int _retval = _struct->set_list(_struct,
key.GetStruct(),
CefListValueCToCpp::Unwrap(value));
// Return type: bool
return _retval?true:false;
}
// CONSTRUCTOR - Do not edit by hand.
CefDictionaryValueCToCpp::CefDictionaryValueCToCpp() {
}
template<> cef_dictionary_value_t* CefCToCpp<CefDictionaryValueCToCpp,
CefDictionaryValue, cef_dictionary_value_t>::UnwrapDerived(
CefWrapperType type, CefDictionaryValue* c) {
NOTREACHED() << "Unexpected class type: " << type;
return NULL;
}
#ifndef NDEBUG
template<> base::AtomicRefCount CefCToCpp<CefDictionaryValueCToCpp,
CefDictionaryValue, cef_dictionary_value_t>::DebugObjCt = 0;
#endif
template<> CefWrapperType CefCToCpp<CefDictionaryValueCToCpp,
CefDictionaryValue, cef_dictionary_value_t>::kWrapperType =
WT_DICTIONARY_VALUE;
| [
"buglloc@yandex.ru"
] | buglloc@yandex.ru |
045b4b8b31159ffaa28f51cfd8db5e74d1d44d4a | 164c5521c78ef0d0587544a9d63ada2aeabc5546 | /Content/ShaderStructures.h | f31379dca92af1d99c6d237821ed9717498e9e7c | [] | no_license | PcloD/LearnDirectX | 437e99b13eca9e9ed4576aaae49b73f2c25d8d9b | 087b6c79e421221fa1dcd58b031831d5133364d4 | refs/heads/master | 2020-11-26T13:52:02.730240 | 2019-10-28T12:42:45 | 2019-10-28T12:42:45 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 674 | h | #pragma once
namespace LearnDirectx
{
// 用于向顶点着色器发送 MVP 矩阵的常量缓冲区。
struct ModelViewProjectionConstantBuffer
{
DirectX::XMFLOAT4X4 model;
DirectX::XMFLOAT4X4 view;
DirectX::XMFLOAT4X4 projection;
DirectX::XMFLOAT4 cameraPos;
};
// 用于向顶点着色器发送每个顶点的数据。
struct VertexPositionColor
{
DirectX::XMFLOAT3 pos;
DirectX::XMFLOAT3 color;
DirectX::XMFLOAT3 normal;
DirectX::XMFLOAT2 uv;
};
struct PixelConstantBuffer
{
DirectX::XMFLOAT4 mainColor;
DirectX::XMFLOAT4 lightPos;
DirectX::XMFLOAT4 diffuse;
DirectX::XMFLOAT4 specular;
DirectX::XMFLOAT4 specular_falloff;
};
} | [
"1162793975@qq.com"
] | 1162793975@qq.com |
806028cc5f092f0f4c201e7e6ae4523e9888ea06 | ae2b00e058cfd5b576c5a134673ed2bb6c712c84 | /image-item.cpp | 9648ccac876c94d236b343d885eace0c229806ff | [] | no_license | tong123/ffmpeg_client | c775c26d5324ed36316903cadcdfd462ffbc2eb0 | d704b2efa50efa634c0a4847fcc6f442d2f6c218 | refs/heads/master | 2020-09-27T16:45:05.648508 | 2017-09-29T11:12:17 | 2017-09-29T11:12:17 | 66,991,176 | 4 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 4,063 | cpp | #include "image-item.h"
#include <QPainter>
#include <QPixmap>
#include <QBitmap>
#include <QImage>
#include <QImageReader>
#include <QDateTime>
#include <QApplication>
#include <QDesktopWidget>
#define ImageW 640
#define ImageH 480
//CImageItem::CImageItem( QQuickItem *parent ) : QQuickItem( parent )
CImageItem::CImageItem( QQuickItem *parent ) : QQuickPaintedItem( parent )
{
// update();
// QImage img( ":/wheat.jpg" );
// m_ir_img = img;
mp_buffer = new unsigned char[640*480*4];
n_start_frame_count = 0;
n_frame_rate = 0;
n_width = QApplication::desktop()->width();
n_height = QApplication::desktop()->height();
// n_width = 480;
// n_height = 640;
}
CImageItem::~CImageItem()
{
}
void CImageItem::paint( QPainter *painter )
{
m_mutex.lock();
QRect a(0,0,n_height,n_width);
qDebug()<<"paint=====";
m_ir_img = m_ir_img.scaled( n_height, n_width );
// painter->drawImage( a, m_ir_img );
painter->drawImage( a, m_ir_img );
m_mutex.unlock();
}
//QSGNode *CImageItem::updatePaintNode(QSGNode *p_old_node, QQuickItem::UpdatePaintNodeData *)
//{
// ImageNode *p_node = (ImageNode*)p_old_node;
// if ( !p_node ) {
// p_node = new ImageNode( window() );
// p_node->removeAllChildNodes();
// qDebug() << "p_node NULL";
// }
// int i_texture_id = p_node->get_material_texture_id();
// glBindTexture( GL_TEXTURE_2D, i_texture_id );
// QImage tem_img = QImage( m_ir_img );
// if( m_ir_img.isNull() ) {
// big_img = QImage(":/wheat.jpg").scaled( RIGHT_AREA_WIDTH, RIGHT_AREA_HIGHT );
// } else {
// big_img = QImage( QSize( RIGHT_AREA_WIDTH, RIGHT_AREA_HIGHT ), QImage::Format_RGB32 );//.scaled( RIGHT_AREA_WIDTH, RIGHT_AREA_HIGHT );
// }
// QPainter painter( &big_img );
// if( tem_img.isNull() ) {
// } else {
// painter.drawImage( QRect( 0, 0, tem_img.width(), tem_img.height() ), tem_img );
// }
// if( !big_img.isNull() ) {
// glTexSubImage2D( GL_TEXTURE_2D, 0, 0, 0, RIGHT_AREA_WIDTH, RIGHT_AREA_HIGHT, GL_BGRA_EXT, GL_UNSIGNED_BYTE, big_img.constBits() );
// }
// p_node->setRect( boundingRect() );
// return p_node;
//// return NULL;
//}
void CImageItem::img_trigged_slot( unsigned int puc_out_buf, int n_data_len )
{
if( n_start_frame_count<=5 ) {
n_start_frame_count++;
return;
}
m_mutex.lock();
qDebug()<<"img_trigged_slot====";
if( n_frame_rate == 0 ) {
n_prev_time = QDateTime::currentMSecsSinceEpoch();
n_frame_rate++;
} else {
n_current_time = QDateTime::currentMSecsSinceEpoch();
if( n_current_time - n_prev_time >= 1000 ) {
emit show_frame_rate_info( QString("%1").arg( n_frame_rate ) );
n_frame_rate = 0;
} else {
n_frame_rate++;
}
}
qDebug()<<"n_frame_rate: "<<n_frame_rate;
for( int i=0; i<n_data_len; i++ ) {
mp_buffer[i] = *( (unsigned char*)puc_out_buf + i );
}
m_ir_img = QImage( (const uchar *)mp_buffer, 640, 480, QImage::Format_RGB32 );
m_ir_img = QImage( (const uchar*)rgb_to_rgb(m_ir_img,640, 480 ), 640, 480, QImage::Format_RGB32 );
// m_ir_img = m_ir_img.copy( 0, 0, m_ir_img.width(), m_ir_img.height() );
// m_ir_img = m_ir_img.scaled( 640, 480 );
update();
m_mutex.unlock();
}
uchar* CImageItem::rgb_to_rgb( QImage &image32, int n_width, int n_height )
{
uchar* imagebits_32 = (uchar* )image32.constBits(); //获取图像首地址，32位图
int n_line_num = 0;
int w_32 = image32.bytesPerLine();
for( int i=0; i<n_height; i++ ) {
n_line_num = i*w_32;
for( int j=0; j<n_width; j++ ) {
int r_32 = imagebits_32[ n_line_num+ j * 4 + 2 ];
int g_32 = imagebits_32[ n_line_num+ j * 4 + 1 ];
int b_32 = imagebits_32[ n_line_num+ j * 4 ];
imagebits_32[ n_line_num+ j * 4 ] = r_32;
imagebits_32[ n_line_num+ j * 4 + 2 ] = b_32;
}
}
return imagebits_32;
// return NULL;
}
| [
"595696730@qq.com"
] | 595696730@qq.com |
bb2a6cc0735cbb1dec65632e1cb0f4ffd610dd41 | 0e72085c47c549175d782986ae5aa93b2f837b12 | /modules/ui/src/systems/update_transform_hierarchy.cpp | ada13f1d9b177bd0766d18460e13f5df02cb90aa | [
"Apache-2.0",
"LicenseRef-scancode-unknown-license-reference",
"MIT",
"BSD-3-Clause",
"LicenseRef-scancode-public-domain"
] | permissive | JiangKevin/lagrange | 56005122ddd749cfb3e92ec0df5a7368fbfb1048 | 8025f98c6e4590abdd73ddcf302e339bb5d6b9df | refs/heads/main | 2023-06-30T06:59:18.490563 | 2021-08-04T15:45:39 | 2021-08-04T15:45:39 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,412 | cpp | /*
* Copyright 2020 Adobe. All rights reserved.
* This file is licensed to you under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License. You may obtain a copy
* of the License at http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software distributed under
* the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR REPRESENTATIONS
* OF ANY KIND, either express or implied. See the License for the specific language
* governing permissions and limitations under the License.
*/
#include <lagrange/ui/components/Transform.h>
#include <lagrange/ui/systems/update_transform_hierarchy.h>
#include <lagrange/ui/utils/treenode.h>
#include <lagrange/ui/default_events.h>
#include <lagrange/ui/utils/events.h>
namespace lagrange {
namespace ui {
void update_transform_recursive(
Registry& registry,
Entity e,
const Eigen::Affine3f& parent_global_transform,
bool check_change = false
)
{
assert(registry.has<TreeNode>(e));
if (registry.has<Transform>(e)) {
auto& transform = registry.get<Transform>(e);
if (check_change) {
auto new_global = (parent_global_transform * transform.local);
if(transform.global.matrix() != new_global.matrix()){
ui::publish<TransformChangedEvent>(registry, e);
}
transform.global = new_global;
}
else {
transform.global = (parent_global_transform * transform.local);
}
foreach_child(registry, e, [&](Entity e) {
update_transform_recursive(registry, e, transform.global, check_change);
});
} else {
// Passthrough if entity doesn't have Transform component
foreach_child(registry, e, [&](Entity e) {
update_transform_recursive(registry, e, parent_global_transform, check_change);
});
}
}
void update_transform_hierarchy(Registry& registry)
{
auto view = registry.view<TreeNode>();
const bool check_change = !(ui::get_event_emitter(registry).empty<TransformChangedEvent>());
for (auto e : view) {
if (view.get<TreeNode>(e).parent == NullEntity) {
update_transform_recursive(registry, e, Eigen::Affine3f::Identity(), check_change);
}
}
}
} // namespace ui
} // namespace lagrange | [
"gori@adobe.com"
] | gori@adobe.com |
3c934a54d01090d3c0812ed125e5f5f105ac1d9f | e820144375ff16f96f48249063fce91f729e58f3 | /common/presenter/agent/src/ascenddk/presenter/agent/net/raw_socket_factory.h | 5c58f2163ffedd35cbad7976e21da3c495a4834c | [
"BSD-3-Clause",
"LicenseRef-scancode-protobuf",
"MIT",
"ISC",
"Apache-2.0"
] | permissive | yElaine/ascenddk | d3a08a3e766e4bc4f396ec0dd128145d8a7a811b | f6fc77585f0723486d4c37d572d06e3d3cdd749b | refs/heads/master | 2020-04-30T20:09:25.523339 | 2019-04-13T06:59:09 | 2019-04-13T06:59:09 | 172,181,316 | 0 | 1 | NOASSERTION | 2019-03-22T02:25:56 | 2019-02-23T06:42:36 | C++ | UTF-8 | C++ | false | false | 2,731 | h | /**
* ============================================================================
*
* Copyright (C) 2018, Hisilicon Technologies Co., Ltd. All Rights Reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1 Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2 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.
*
* 3 Neither the names of the copyright holders nor the names of the
* 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 HOLDER 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 ASCENDDK_PRESENTER_AGENT_NET_RAW_SOCKET_FACTORY_H_
#define ASCENDDK_PRESENTER_AGENT_NET_RAW_SOCKET_FACTORY_H_
#include <memory>
#include <string>
#include "ascenddk/presenter/agent/net/raw_socket.h"
#include "ascenddk/presenter/agent/net/socket_factory.h"
namespace ascend {
namespace presenter {
/**
* Factory of RawSocket
*/
class RawSocketFactory : public SocketFactory {
public:
/**
* @brief Constructor
* @param hostIp host IP
* @param port port
*/
RawSocketFactory(const std::string& host_ip, uint16_t port);
/**
* @brief Create instance of RawSocket, If NULL is returned,
* Invoke GetErrorCode() for error code
* @return pointer of RawSocket
*/
virtual RawSocket* Create() override;
private:
std::string host_ip_;
uint16_t port_;
};
} /* namespace presenter */
} /* namespace ascend */
#endif /* ASCENDDK_PRESENTER_AGENT_NET_RAW_SOCKET_FACTORY_H_ */
| [
"ascend@huawei.com"
] | ascend@huawei.com |
e4169cfb84c2c596df7fb87e7b5925d740b296a2 | 5d5a8fe2b00d748d2ea40839953f648a818ba44e | /CodeSource_1/chap14/matvect1.cpp | 8b203baf619a1396d8f6c69229bedf4d092bdf26 | [] | no_license | YBTayeb/Cpp | e5a75b105549475c74f9b0acae111580e6acbd78 | 860e1f84e2273fdafb171f5f3f6bfacdbeba62d7 | refs/heads/master | 2019-03-21T04:23:59.276269 | 2018-04-09T22:45:36 | 2018-04-09T22:45:36 | 124,126,567 | 0 | 0 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 1,588 | cpp | #include <iostream>
using namespace std ;
class matrice ; // pour pouvoir compiler la déclaration de vect
// *********** La classe vect *******************
class vect
{
double v[3] ; // vecteur à 3 composantes
public :
vect (double v1=0, double v2=0, double v3=0) // constructeur
{ v[0] = v1 ; v[1]=v2 ; v[2]=v3 ;
}
friend vect prod (const matrice&, const vect &) ; // fct amie indépendante
void affiche () const
{ int i ;
for (i=0 ; i<3 ; i++) cout << v[i] << " " ;
cout << "\n" ;
}
} ;
// *********** La classe matrice *****************
class matrice
{
double mat[3] [3] ; // matrice 3 X 3
public :
matrice (double t[3][3]) // constructeur, à partir d’un tableau 3 x 3
{ int i ; int j ;
for (i=0 ; i<3 ; i++)
for (j=0 ; j<3 ; j++)
mat[i] [j] = t[i] [j] ;
}
friend vect prod (const matrice &, const vect &) ;
} ;
// ********** La fonction prod *****************
vect prod (const matrice & m,const vect & x)
{ int i, j ;
double som ;
vect res ; // pour le résultat du produit
for (i=0 ; i<3 ; i++)
{ for (j=0, som=0 ; j<3 ; j++)
som += m.mat[i] [j] * x.v[j] ;
res.v[i] = som ;
}
return res ;
}
// ********** Un petit programme de test *********
int main()
{ vect prod (const matrice & m,const vect & x) ;
vect w (1,2,3) ;
vect res ;
double tb [3][3] = { 1, 2, 3, 4, 5, 6, 7, 8, 9 } ;
matrice a = tb ;
res = prod(a, w) ;
res.affiche () ;
} | [
"y.belhajt@hotmail.com"
] | y.belhajt@hotmail.com |
afed8d9a6cf0f69f5feafc4be0ca3967a94b64e7 | 9defd7d957384fc0a7026ad0dfa920574e4192a7 | /exception/rethrow.cpp | 42254cb628b2a532d93c83fc29e6fb4a5d790e78 | [] | no_license | ramapraveen/learning_cpp | 55cfed505a11a4910062c351100e4f321640d8cc | 456d5314573507620b3888e49e6470ec83ee55af | refs/heads/master | 2020-03-22T12:44:09.298399 | 2018-07-13T07:31:34 | 2018-07-13T07:31:34 | 140,058,788 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 773 | cpp |
#include <iostream>
using namespace std;
class MyError {
public:
const char *data;
MyError(const char *msg) : data(msg) {}
};
class Rainbow {
public:
Rainbow() { std::cout<<"In Raibow constructor"<<endl; }
~Rainbow() { std::cout<<"In Raibow destructor"<<endl; }
};
void a() {
Rainbow rb;
throw MyError("something bad happened");
}
void b() {
try {
a();
} catch(...) {
cout<<"in b exception happened, rethrowing"<<endl;
throw; //XXX exception is preserved for main to see it
}
}
int main() {
try {
b();
} catch (MyError &err) {
cout <<err.data<<endl;
}
cout<<"after try catch block"<<endl;
return 0;
}
/*
Output:
In Raibow constructor
In Raibow destructor
in b exception happened, rethrowing
something bad happened
after try catch block
*/
| [
"ramapraveen@fb.com"
] | ramapraveen@fb.com |
1faa0b5324546552baca4099dc25e2c536e5dd9a | a81c07a5663d967c432a61d0b4a09de5187be87b | /components/autofill/core/browser/payments/credit_card_fido_authenticator.h | 697a21c26efc683405a0a9d6f9e549047a2f4e77 | [
"BSD-3-Clause"
] | permissive | junxuezheng/chromium | c401dec07f19878501801c9e9205a703e8643031 | 381ce9d478b684e0df5d149f59350e3bc634dad3 | refs/heads/master | 2023-02-28T17:07:31.342118 | 2019-09-03T01:42:42 | 2019-09-03T01:42:42 | 205,967,014 | 2 | 0 | BSD-3-Clause | 2019-09-03T01:48:23 | 2019-09-03T01:48:23 | null | UTF-8 | C++ | false | false | 8,793 | h | // Copyright 2019 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 COMPONENTS_AUTOFILL_CORE_BROWSER_PAYMENTS_CREDIT_CARD_FIDO_AUTHENTICATOR_H_
#define COMPONENTS_AUTOFILL_CORE_BROWSER_PAYMENTS_CREDIT_CARD_FIDO_AUTHENTICATOR_H_
#include <memory>
#include "base/strings/string16.h"
#include "components/autofill/core/browser/autofill_client.h"
#include "components/autofill/core/browser/autofill_driver.h"
#include "components/autofill/core/browser/data_model/credit_card.h"
#include "components/autofill/core/browser/payments/full_card_request.h"
#include "components/autofill/core/browser/payments/payments_client.h"
#include "device/fido/fido_constants.h"
#include "mojo/public/cpp/bindings/remote.h"
#include "third_party/blink/public/mojom/webauthn/internal_authenticator.mojom.h"
namespace autofill {
using blink::mojom::AuthenticatorStatus;
using blink::mojom::GetAssertionAuthenticatorResponse;
using blink::mojom::GetAssertionAuthenticatorResponsePtr;
using blink::mojom::InternalAuthenticator;
using blink::mojom::MakeCredentialAuthenticatorResponse;
using blink::mojom::MakeCredentialAuthenticatorResponsePtr;
using blink::mojom::PublicKeyCredentialCreationOptions;
using blink::mojom::PublicKeyCredentialCreationOptionsPtr;
using blink::mojom::PublicKeyCredentialRequestOptions;
using blink::mojom::PublicKeyCredentialRequestOptionsPtr;
using device::CredentialType;
using device::FidoTransportProtocol;
using device::PublicKeyCredentialDescriptor;
using device::UserVerificationRequirement;
// Authenticates credit card unmasking through FIDO authentication, using the
// WebAuthn specification, standardized by the FIDO alliance. The Webauthn
// specification defines an API to cryptographically bind a server and client,
// and verify that binding. More information can be found here:
// - https://www.w3.org/TR/webauthn-1/
// - https://fidoalliance.org/fido2/
class CreditCardFIDOAuthenticator
: public payments::FullCardRequest::ResultDelegate {
public:
// Useful for splitting metrics to correct sub-histograms and knowing which
// Payments RPC's to send.
enum Flow {
// No flow is in progress.
NONE_FLOW,
// Authentication flow.
AUTHENTICATION_FLOW,
// Registration flow, including a challenge to sign.
OPT_IN_WITH_CHALLENGE_FLOW,
// Opt-in attempt flow, no challenge to sign.
OPT_IN_WITHOUT_CHALLENGE_FLOW,
// Opt-out flow.
OPT_OUT_FLOW,
};
class Requester {
public:
virtual ~Requester() {}
virtual void OnFIDOAuthenticationComplete(
bool did_succeed,
const CreditCard* card = nullptr) = 0;
};
CreditCardFIDOAuthenticator(AutofillDriver* driver, AutofillClient* client);
~CreditCardFIDOAuthenticator() override;
// Offer the option to use WebAuthn for authenticating future card unmasking.
void ShowWebauthnOfferDialog();
// Authentication
void Authenticate(const CreditCard* card,
base::WeakPtr<Requester> requester,
base::TimeTicks form_parsed_timestamp,
base::Value request_options);
// Registration
void Register(base::Value creation_options = base::Value());
// Opts the user out.
void OptOut();
// Invokes callback with true if user has a verifying platform authenticator.
// e.g. Touch/Face ID, Windows Hello, Android fingerprint, etc., is available
// and enabled. Otherwise invokes callback with false.
virtual void IsUserVerifiable(base::OnceCallback<void(bool)> callback);
// Returns true only if the user has opted-in to use WebAuthn for autofill.
virtual bool IsUserOptedIn();
// Ensures that local user opt-in pref is in-sync with payments server.
void SyncUserOptIn(AutofillClient::UnmaskDetails& unmask_details);
// Returns the current flow.
Flow current_flow() { return current_flow_; }
private:
friend class AutofillManagerTest;
friend class CreditCardAccessManagerTest;
friend class CreditCardFIDOAuthenticatorTest;
friend class TestCreditCardFIDOAuthenticator;
FRIEND_TEST_ALL_PREFIXES(CreditCardFIDOAuthenticatorTest,
ParseRequestOptions);
FRIEND_TEST_ALL_PREFIXES(CreditCardFIDOAuthenticatorTest,
ParseAssertionResponse);
FRIEND_TEST_ALL_PREFIXES(CreditCardFIDOAuthenticatorTest,
ParseCreationOptions);
FRIEND_TEST_ALL_PREFIXES(CreditCardFIDOAuthenticatorTest,
ParseAttestationResponse);
// Invokes the WebAuthn prompt to request user verification to sign the
// challenge in |request_options|.
virtual void GetAssertion(
PublicKeyCredentialRequestOptionsPtr request_options);
// Invokes the WebAuthn prompt to request user verification to sign the
// challenge in |creation_options| and create a key-pair.
virtual void MakeCredential(
PublicKeyCredentialCreationOptionsPtr creation_options);
// Makes a request to payments to either opt-in or opt-out the user.
void OptChange(bool opt_in, base::Value attestation_response = base::Value());
// The callback invoked from the WebAuthn prompt including the
// |assertion_response|, which will be sent to Google Payments to retrieve
// card details.
void OnDidGetAssertion(
AuthenticatorStatus status,
GetAssertionAuthenticatorResponsePtr assertion_response);
// The callback invoked from the WebAuthn prompt including the
// |attestation_response|, which will be sent to Google Payments to enroll the
// credential for this user.
void OnDidMakeCredential(
AuthenticatorStatus status,
MakeCredentialAuthenticatorResponsePtr attestation_response);
// Sets prefstore to enable credit card authentication if rpc was successful.
void OnDidGetOptChangeResult(AutofillClient::PaymentsRpcResult result,
bool user_is_opted_in,
base::Value creation_options = base::Value());
// The callback invoked from the WebAuthn offer dialog when it is accepted or
// declined/cancelled.
void OnWebauthnOfferDialogUserResponse(bool did_accept);
// payments::FullCardRequest::ResultDelegate:
void OnFullCardRequestSucceeded(
const payments::FullCardRequest& full_card_request,
const CreditCard& card,
const base::string16& cvc) override;
void OnFullCardRequestFailed() override;
// Converts |request_options| from JSON to mojom pointer.
PublicKeyCredentialRequestOptionsPtr ParseRequestOptions(
const base::Value& request_options);
// Converts |creation_options| from JSON to mojom pointer.
PublicKeyCredentialCreationOptionsPtr ParseCreationOptions(
const base::Value& creation_options);
// Helper function to parse |key_info| sub-dictionary found in
// |request_options| and |creation_options|.
PublicKeyCredentialDescriptor ParseCredentialDescriptor(
const base::Value& key_info);
// Converts |assertion_response| from mojom pointer to JSON.
base::Value ParseAssertionResponse(
GetAssertionAuthenticatorResponsePtr assertion_response);
// Converts |attestation_response| from mojom pointer to JSON.
base::Value ParseAttestationResponse(
MakeCredentialAuthenticatorResponsePtr attestation_response);
// Returns true if |request_options| contains a challenge and has a non-empty
// list of keys that each have a Credential ID.
bool IsValidRequestOptions(const base::Value& request_options);
// Returns true if |request_options| contains a challenge.
bool IsValidCreationOptions(const base::Value& creation_options);
// Card being unmasked.
const CreditCard* card_;
// The current flow in progress.
Flow current_flow_ = NONE_FLOW;
// Meant for histograms recorded in FullCardRequest.
base::TimeTicks form_parsed_timestamp_;
// The associated autofill driver. Weak reference.
AutofillDriver* const autofill_driver_;
// The associated autofill client. Weak reference.
AutofillClient* const autofill_client_;
// Payments client to make requests to Google Payments.
payments::PaymentsClient* const payments_client_;
// Authenticator pointer to facilitate WebAuthn.
mojo::Remote<InternalAuthenticator> authenticator_;
// Responsible for getting the full card details, including the PAN and the
// CVC.
std::unique_ptr<payments::FullCardRequest> full_card_request_;
// Weak pointer to object that is requesting authentication.
base::WeakPtr<Requester> requester_;
base::WeakPtrFactory<CreditCardFIDOAuthenticator> weak_ptr_factory_{this};
DISALLOW_COPY_AND_ASSIGN(CreditCardFIDOAuthenticator);
};
} // namespace autofill
#endif // COMPONENTS_AUTOFILL_CORE_BROWSER_PAYMENTS_CREDIT_CARD_FIDO_AUTHENTICATOR_H_
| [
"commit-bot@chromium.org"
] | commit-bot@chromium.org |
73cfeaa317c5d87952bf1ef7df2d6bceb19b9d22 | 1806eaae69f944683e308348714efc4c470bb95c | /tools/KPFGen/src/common.c | 5cbe76e6e82d44838e867d60d8643bee2b075505 | [] | no_license | ayaz345/TurokEX | 09b929f69918ffef9c45d6142fe7888e96d409d9 | 90589b4bd3c35e79ea42572e4c89dc335c5cfbfe | refs/heads/master | 2023-07-10T20:56:47.643435 | 2014-06-20T01:59:44 | 2014-06-20T01:59:44 | 650,764,618 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 13,415 | c | // Emacs style mode select -*- C++ -*-
//-----------------------------------------------------------------------------
//
// Copyright(C) 2012 Samuel Villarreal
//
// 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., 59 Temple Place - Suite 330, Boston, MA
// 02111-1307, USA.
//
//-----------------------------------------------------------------------------
#ifdef _WIN32
#include <windows.h>
#include <commctrl.h>
#include "resource.h"
#endif
#include "types.h"
#include "common.h"
#include "pak.h"
#define ASCII_SLASH 47
#define ASCII_BACKSLASH 92
unsigned long com_fileoffset = 0;
static FILE *com_file = NULL;
static FILE *com_bufferFile = NULL;
byte *cartfile = NULL;
#define TEXTBUFFER_SIZE 65536*1024
static char com_textbuffer[TEXTBUFFER_SIZE];
#ifdef _WIN32
extern HWND hwndWait;
extern HWND hwndLoadBar;
extern HWND hwndDataBar;
#endif
//
// Com_Printf
//
void Com_Printf(char* s, ...)
{
char msg[1024];
va_list v;
va_start(v,s);
vsprintf(msg,s,v);
va_end(v);
#ifdef _WIN32
ShowWindow(hwndWait, SW_HIDE);
UpdateWindow(hwndWait);
MessageBoxA(NULL, (LPCSTR)(msg), (LPCSTR)"Info", MB_OK | MB_ICONINFORMATION);
ShowWindow(hwndWait, SW_SHOW);
UpdateWindow(hwndWait);
#else
printf("%s\n", msg);
#endif
}
//
// Com_Error
//
void Com_Error(char *fmt, ...)
{
va_list va;
char buff[1024];
va_start(va, fmt);
vsprintf(buff, fmt, va);
va_end(va);
#ifdef _WIN32
ShowWindow(hwndWait, SW_HIDE);
UpdateWindow(hwndWait);
MessageBoxA(NULL, (LPCSTR)(buff), (LPCSTR)"Error", MB_OK | MB_ICONINFORMATION);
ShowWindow(hwndWait, SW_SHOW);
UpdateWindow(hwndWait);
#else
Com_Printf("\n**************************\n");
Com_Printf("ERROR: %s", buff);
Com_Printf("**************************\n");
#endif
Com_SetWriteFile("kpf_err.txt");
Com_FPrintf(buff);
Com_CloseFile();
exit(1);
}
//
// Com_UpdateProgress
//
void Com_UpdateProgress(char *fmt, ...)
{
va_list va;
char buff[1024];
va_start(va, fmt);
vsprintf(buff, fmt, va);
va_end(va);
#ifdef _WIN32
SendMessage(hwndLoadBar, PBM_STEPIT, 0, 0);
SetDlgItemTextA(hwndWait, IDC_PROGRESSTEXT, buff);
UpdateWindow(hwndWait);
#else
#endif
}
//
// Com_UpdateDataProgress
//
void Com_UpdateDataProgress(void)
{
#ifdef _WIN32
SendMessage(hwndDataBar, PBM_STEPIT, 0, 0);
UpdateWindow(hwndWait);
#endif
}
//
// Com_SetDataProgress
//
void Com_SetDataProgress(int range)
{
#ifdef _WIN32
SendMessage(hwndDataBar, PBM_SETPOS, 0, 0);
SendMessage(hwndDataBar, PBM_SETRANGE, 0, MAKELPARAM(0, range));
UpdateWindow(hwndWait);
#endif
}
//
// Com_Alloc
//
void* Com_Alloc(int size)
{
void *ret = calloc(1, size);
if(!ret)
Com_Error("Com_Alloc: Out of memory");
return ret;
}
//
// Com_Free
//
void Com_Free(void **ptr)
{
if(!*ptr)
Com_Error("Com_Free: Tried to free NULL");
free(*ptr);
*ptr = NULL;
}
//
// Com_ReadFile
//
int Com_ReadFile(const char* name, byte** buffer)
{
FILE *fp;
errno = 0;
if((fp = fopen(name, "r")))
{
size_t length;
fseek(fp, 0, SEEK_END);
length = ftell(fp);
fseek(fp, 0, SEEK_SET);
*buffer = Com_Alloc(length);
if(fread(*buffer, 1, length, fp) == length)
{
fclose(fp);
return length;
}
fclose(fp);
}
else
{
Com_Error("Couldn't open %s", name);
}
return -1;
}
//
// Com_ReadFile
//
int Com_ReadBinaryFile(const char* name, byte** buffer)
{
FILE *fp;
errno = 0;
if((fp = fopen(name, "rb")))
{
size_t length;
fseek(fp, 0, SEEK_END);
length = ftell(fp);
fseek(fp, 0, SEEK_SET);
*buffer = Com_Alloc(length);
if(fread(*buffer, 1, length, fp) == length)
{
fclose(fp);
return length;
}
fclose(fp);
}
return -1;
}
//
// Com_SetWriteFile
//
dboolean Com_SetWriteFile(char const* name, ...)
{
char filename[1024];
va_list v;
va_start(v, name);
vsprintf(filename, name, v);
va_end(v);
if(!(com_file = fopen(filename, "w")))
return 0;
return 1;
}
//
// Com_SetWriteFile
//
dboolean Com_SetWriteBinaryFile(char const* name, ...)
{
char filename[1024];
va_list v;
va_start(v, name);
vsprintf(filename, name, v);
va_end(v);
if(!(com_file = fopen(filename, "wb")))
return 0;
return 1;
}
//
// Com_CloseFile
//
void Com_CloseFile(void)
{
fclose(com_file);
}
//
// Com_StrcatClear
//
void Com_StrcatClear(void)
{
memset(com_textbuffer, 0, TEXTBUFFER_SIZE);
}
//
// Com_Strcat
//
void Com_Strcat(const char *string, ...)
{
char s[1024];
va_list v;
va_start(v, string);
vsprintf(s, string, v);
va_end(v);
strcat(com_textbuffer, s);
}
//
// Com_Strcpy
//
void Com_Strcpy(const char *string)
{
strcpy(com_textbuffer, string);
}
//
// Com_StrcatAddToFile
//
void Com_StrcatAddToFile(const char *name)
{
PK_AddFile(name, com_textbuffer, strlen(com_textbuffer), true);
}
//
// Com_GetFileBuffer
//
byte *Com_GetFileBuffer(byte *buffer)
{
return buffer + com_fileoffset;
}
//
// Com_Read8
//
byte Com_Read8(byte* buffer)
{
byte result;
result = buffer[com_fileoffset++];
return result;
}
//
// Com_Read16
//
short Com_Read16(byte* buffer)
{
int result;
result = Com_Read8(buffer);
result |= Com_Read8(buffer) << 8;
return result;
}
//
// Com_Read32
//
int Com_Read32(byte* buffer)
{
int result;
result = Com_Read8(buffer);
result |= Com_Read8(buffer) << 8;
result |= Com_Read8(buffer) << 16;
result |= Com_Read8(buffer) << 24;
return result;
}
//
// Com_Write8
//
void Com_Write8(byte value)
{
fwrite(&value, 1, 1, com_file);
com_fileoffset++;
}
//
// Com_Write16
//
void Com_Write16(short value)
{
Com_Write8(value & 0xff);
Com_Write8((value >> 8) & 0xff);
}
//
// Com_Write32
//
void Com_Write32(int value)
{
Com_Write8(value & 0xff);
Com_Write8((value >> 8) & 0xff);
Com_Write8((value >> 16) & 0xff);
Com_Write8((value >> 24) & 0xff);
}
//
// Com_WriteBuffer8
//
void Com_WriteBuffer8(byte *buffer, byte value)
{
buffer[com_fileoffset] = value;
com_fileoffset++;
}
//
// Com_WriteBuffer16
//
void Com_WriteBuffer16(byte *buffer, short value)
{
Com_WriteBuffer8(buffer, value & 0xff);
Com_WriteBuffer8(buffer, (value >> 8) & 0xff);
}
//
// Com_WriteBuffer32
//
void Com_WriteBuffer32(byte *buffer, int value)
{
Com_WriteBuffer8(buffer, value & 0xff);
Com_WriteBuffer8(buffer, (value >> 8) & 0xff);
Com_WriteBuffer8(buffer, (value >> 16) & 0xff);
Com_WriteBuffer8(buffer, (value >> 24) & 0xff);
}
//
// Com_WriteBufferFloat
//
void Com_WriteBufferFloat(byte *buffer, float i)
{
fint_t fi;
fi.f = i;
Com_WriteBuffer32(buffer, fi.i);
}
//
// Com_WriteBufferString
//
void Com_WriteBufferString(byte *buffer, char *string)
{
unsigned int i;
Com_WriteBuffer16(buffer, strlen(string)+1);
for(i = 0; i < strlen(string); i++)
Com_WriteBuffer8(buffer, string[i]);
Com_WriteBuffer8(buffer, 0);
}
//
// Com_WriteBufferPad4
//
void Com_WriteBufferPad4(byte *buffer)
{
unsigned int i;
for(i = 0; i < (com_fileoffset & 3); i++)
Com_WriteBuffer8(buffer, 0);
}
//
// Com_FPrintf
//
void Com_FPrintf(char* s, ...)
{
char msg[1024];
va_list v;
va_start(v,s);
vsprintf(msg,s,v);
va_end(v);
fprintf(com_file, msg);
}
//
// Com_FileLength
//
long Com_FileLength(FILE *handle)
{
long savedpos;
long length;
// save the current position in the file
savedpos = ftell(handle);
// jump to the end and find the length
fseek(handle, 0, SEEK_END);
length = ftell(handle);
// go back to the old location
fseek(handle, savedpos, SEEK_SET);
return length;
}
//
// Com_FileExists
// Check if a wad file exists
//
int Com_FileExists(const char *filename)
{
FILE *fstream;
fstream = fopen(filename, "r");
if(fstream != NULL)
{
fclose(fstream);
return 1;
}
else
{
// If we can't open because the file is a directory, the
// "file" exists at least!
if(errno == 21)
return 2;
}
return 0;
}
//
// Com_GetCartFile
//
#ifdef _WIN32
byte *Com_GetCartFile(const char *filter, const char *title)
{
char filepath[MAX_PATH];
OPENFILENAMEA ofn;
memset(&ofn, 0, sizeof(ofn));
memset(filepath, 0, MAX_PATH);
cartfile = NULL;
ofn.lStructSize = sizeof(ofn);
ofn.hwndOwner = NULL;
ofn.lpstrFilter = (LPCSTR)filter;
ofn.lpstrFile = (LPSTR)filepath;
ofn.nMaxFile = MAX_PATH;
ofn.lpstrTitle = (LPCSTR)title;
ofn.Flags = OFN_EXPLORER | OFN_FILEMUSTEXIST;
ShowWindow(hwndWait, SW_HIDE);
UpdateWindow(hwndWait);
if(GetOpenFileNameA(&ofn))
{
Com_ReadFile(filepath, &cartfile);
ShowWindow(hwndWait, SW_SHOW);
UpdateWindow(hwndWait);
return cartfile;
}
ShowWindow(hwndWait, SW_SHOW);
UpdateWindow(hwndWait);
Com_Error("Canceled by user");
return NULL;
}
#else
#error TODO: support Com_GetCartFile in *unix
#endif
//
// Com_CloseCartFile
//
void Com_CloseCartFile(void)
{
Com_Free(&cartfile);
cartfile = NULL;
}
//
// Com_StripExt
//
void Com_StripExt(char *name)
{
char *search;
search = name + strlen(name) - 1;
while(*search != ASCII_BACKSLASH && *search != ASCII_SLASH
&& search != name)
{
if(*search == '.')
{
*search = '\0';
return;
}
search--;
}
}
void Com_StripPath(char *name)
{
char *search;
int len = 0;
int pos = 0;
int i = 0;
len = strlen(name) - 1;
pos = len + 1;
for(search = name + len;
*search != ASCII_BACKSLASH && *search != ASCII_SLASH; search--, pos--)
{
if(search == name)
{
return;
}
}
if(pos <= 0)
{
return;
}
for(i = 0; pos < len+1; pos++, i++)
{
name[i] = name[pos];
}
name[i] = '\0';
}
//
// Com_Hash
//
int Com_Hash(const char *s) {
unsigned int hash = 0;
char *str = (char*)s;
char c;
while((c = *str++)) {
hash = c + (hash << 6) + (hash << 16) - hash;
}
return hash & (MAX_HASH-1);
}
//
// Com_GetExePath
//
const char *Com_GetExePath(void)
{
static const char current_dir_dummy[] = {"."};
static char *base;
if(!base) // cache multiple requests
{
size_t len = strlen(*myargv);
char *p = (base = Com_Alloc(len + 1)) + len - 1;
strcpy(base, *myargv);
while (p > base && *p!='/' && *p!='\\')
{
*p--=0;
}
if(*p=='/' || *p=='\\')
{
*p--=0;
}
if(strlen(base) < 2)
{
Com_Free(&base);
base = Com_Alloc(1024);
if(!_getcwd(base, 1024))
{
strcpy(base, current_dir_dummy);
}
}
}
return base;
}
//
// va
//
char *va(char *str, ...)
{
va_list v;
static char vastr[1024];
va_start(v, str);
vsprintf(vastr, str,v);
va_end(v);
return vastr;
}
//
// Com_GetCartOffset
//
int Com_GetCartOffset(byte *buf, int count, int *size)
{
if(size)
*size = *(int*)(buf + count + 4) - *(int*)(buf + count);
return *(int*)(buf + count);
}
//
// Com_GetCartData
//
byte *Com_GetCartData(byte *buf, int count, int *size)
{
return &buf[Com_GetCartOffset(buf, count, size)];
}
//
// Com_UpdateCartData
//
void Com_UpdateCartData(byte* data, int entries, int next)
{
*(int*)data = entries;
*(int*)(data + 4 * *(int*)data + 4) = next;
}
//
// Com_SetCartHeader
//
void Com_SetCartHeader(byte* data, int size, int count)
{
*(int*)data = size;
*(int*)(data + 4) = count;
}
//
// Com_WriteCartData
//
void Com_WriteCartData(byte *buf, int count, char* s, ...)
{
char msg[1024];
va_list v;
int size;
byte *data;
FILE *f;
va_start(v, s);
vsprintf(msg, s, v);
va_end(v);
f = fopen(msg, "wb");
data = Com_GetCartData(buf, count, &size);
fwrite(data, 1, size, f);
fclose(f);
}
//
// Com_Swap16
//
int Com_Swap16(int x)
{
return(((word)(x & 0xff) << 8) | ((word)x >> 8));
}
//
// Com_Swap32
//
dword Com_Swap32(unsigned int x)
{
return(
((x & 0xff) << 24) |
(((x >> 8) & 0xff) << 16) |
(((x >> 16) & 0xff) << 8) |
((x >> 24) & 0xff)
);
}
| [
"svkaiser@gmail.com"
] | svkaiser@gmail.com |
0809c24ae0d3c05fb1f16a04a0e68f9260db1199 | 9dc55ad0f4520205c4ae4915ef74c8d6f59120a8 | /MxTest/LyricTest.cpp | 96da32400852cb753af1dad4c9a94f84d2cc37e1 | [
"LicenseRef-scancode-warranty-disclaimer",
"MIT",
"LicenseRef-scancode-unknown-license-reference"
] | permissive | torogmw/MusicXML-Class-Library | 0e6532bd53aa0837768770c6f050328f15ec318a | d582b091f4e0574ce4a9f19284963670449eaf81 | refs/heads/master | 2020-12-30T20:57:41.396247 | 2015-04-27T05:54:55 | 2015-04-27T05:54:55 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,181 | cpp |
#include "TestHarness.h"
#include "MxTestHelper.h"
#include "Elements.h"
#include "ElisionSyllabicGroupTest.h"
#include "ElisionSyllabicTextGroupTest.h"
#include "SyllabicTextGroupTest.h"
#include "LyricTextChoiceTest.h"
#include "LyricTest.h"
#include "EditorialGroupTest.h"
#include "MidiInstrumentTest.h"
/* #include "MidiDeviceTest.cpp" */
using namespace mx::e;
using namespace mx::t;
using namespace std;
using namespace MxTestHelpers;
#include "MxTestCompileControl.h"
#ifdef RUN_PHASE3_TESTS
TEST( Test01, Lyric )
{
variant v = variant::one;
LyricPtr object = tgenLyric( v );
stringstream expected;
tgenLyricExpected( expected, 1, v );
stringstream actual;
// object->toStream( std::cout, 1 );
object->toStream( actual, 1 );
CHECK_EQUAL( expected.str(), actual.str() )
CHECK( ! object->hasAttributes() )
CHECK( object->hasContents() )
}
TEST( Test02, Lyric )
{
variant v = variant::two;
LyricPtr object = tgenLyric( v );
stringstream expected;
tgenLyricExpected( expected, 1, v );
stringstream actual;
// object->toStream( std::cout, 1 );
object->toStream( actual, 1 );
CHECK_EQUAL( expected.str(), actual.str() )
CHECK( object->hasAttributes() )
CHECK( object->hasContents() )
}
TEST( Test03, Lyric )
{
variant v = variant::three;
LyricPtr object = tgenLyric( v );
stringstream expected;
tgenLyricExpected( expected, 1, v );
stringstream actual;
// object->toStream( std::cout, 1 );
object->toStream( actual, 1 );
CHECK_EQUAL( expected.str(), actual.str() )
CHECK( object->hasAttributes() )
CHECK( object->hasContents() )
}
#endif
namespace MxTestHelpers
{
LyricPtr tgenLyric( variant v )
{
LyricPtr o = makeLyric();
switch ( v )
{
case variant::one:
{
o->setLyricTextChoice( tgenLyricTextChoice( v ) );
}
break;
case variant::two:
{
o->getAttributes()->hasName = true;
o->getAttributes()->name = XsToken( "Toker" );
o->setLyricTextChoice( tgenLyricTextChoice( v ) );
o->setEditorialGroup( tgenEditorialGroup( v ) );
o->setHasEndLine( true );
}
break;
case variant::three:
{
o->getAttributes()->hasName = true;
o->getAttributes()->name = XsToken( "YOLO" );
o->getAttributes()->hasNumber = true;
o->getAttributes()->number = XsNMToken( "Looser" );
o->setLyricTextChoice( tgenLyricTextChoice( v ) );
o->setEditorialGroup( tgenEditorialGroup( v ) );
o->setHasEndParagraph( true );
}
break;
default:
break;
}
return o;
}
void tgenLyricExpected( std::ostream& os, int i, variant v )
{
switch ( v )
{
case variant::one:
{
streamLine( os, i, R"(<lyric>)" );
tgenLyricTextChoiceExpected( os, i+1, v );
os << std::endl;
streamLine( os, i, R"(</lyric>)", false );
}
break;
case variant::two:
{
streamLine( os, i, R"(<lyric name="Toker">)" );
tgenLyricTextChoiceExpected( os, i+1, v );
os << std::endl;
streamLine( os, i+1, R"(<end-line/>)" );
tgenEditorialGroupExpected( os, i+1, v );
os << std::endl;
streamLine( os, i, R"(</lyric>)", false );
}
break;
case variant::three:
{
streamLine( os, i, R"(<lyric number="Looser" name="YOLO">)" );
tgenLyricTextChoiceExpected( os, i+1, v );
os << std::endl;
streamLine( os, i+1, R"(<end-paragraph/>)" );
tgenEditorialGroupExpected( os, i+1, v );
os << std::endl;
streamLine( os, i, R"(</lyric>)", false );
}
break;
default:
break;
}
}
} | [
"matthew.james.rbiggs@gmail.com"
] | matthew.james.rbiggs@gmail.com |
41e4726f38d3c72cbef6b4da912accd63e659a8a | 0354f4b70ad8731d78801919a275eaa83ee26f3a | /NodeModel/BinaryTree.h | eac333464e3b6bee0ba1325dac4345c39ec4078b | [] | no_license | Wellrabbit/Nodes | d3b2cd5fd200dae534725f8d27c4514d29735a49 | 66daecedd54ff670e5dcb5b37d0bf2ad11f8928c | refs/heads/master | 2021-01-18T20:12:54.843798 | 2016-05-25T17:22:55 | 2016-05-25T17:22:55 | 54,221,419 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,120 | h | //
// BinaryTree.hpp
// Nodes
//
// Created by Orton, Emily on 4/11/16.
// Copyright © 2016 CTEC. All rights reserved.
//
#ifndef BinaryTree_hpp
#define BinaryTree_hpp
#include "TreeNode.h"
template <class Type>
class BinaryTree
{
private:
int size;
TreeNode<Type> * root;
int height;
bool balanced;
void calculateSize(TreeNode<Type> * currentNode);
bool contains(Type value, TreeNode<Type> * currentTree); // Done
TreeNode<Type> * getRightMostChild(TreeNode<Type> * leftSubTree);
TreeNode<Type> * getLeftMostChild(TreeNode<Type> * rightSubTree);
public:
BinaryTree();
~BinaryTree();
bool insert( const Type& value);
void remove(const Type& value);
void remove(TreeNode<Type> * nodeToBeRemoved);
bool contains (Type value); //Done
int getSize();
int getHieght();
bool isBalanced();
TreeNode<Type> * getRoot();
void preorderTraversal(TreeNode<Type> * currentNode); //Done
void inorderTraversal(TreeNode<Type> * currentNode); //Done
void postorderTraversal(TreeNode<Type> * currentNode); //Done
};
#endif /* BinaryTree_hpp */
| [
"eort3611@740s-pl-177.local"
] | eort3611@740s-pl-177.local |
3b6610498029a28021070ad9c586685326409734 | e76a79816ff5203be2c4061e263a09d31072c940 | /test/com/facebook/buck/cxx/testdata/platform_sources/bin.cpp | 5c05855632e7fbfe02d59b7889873dc0b3ddb738 | [
"Apache-2.0"
] | permissive | facebook/buck | ef3a833334499b1b44c586e9bc5e2eec8d930e09 | 9c7c421e49f4d92d67321f18c6d1cd90974c77c4 | refs/heads/main | 2023-08-25T19:30:28.803205 | 2023-04-19T11:32:59 | 2023-04-19T11:32:59 | 9,504,214 | 8,481 | 1,338 | Apache-2.0 | 2023-05-04T22:13:59 | 2013-04-17T18:12:18 | Java | UTF-8 | C++ | false | false | 54 | cpp | extern int answer();
int main() { return answer(); }
| [
"sdwilsh@fb.com"
] | sdwilsh@fb.com |
bc022e53fa9d6c159e730730e3847f52ce6b868b | e2676341b2eb83990362e71402dafebc44d5eeb8 | /5/5.cpp | c3c27829413680bf721f1faa2fcee2e47377a3a4 | [] | no_license | Quantrap/9pr | 9197bad3c71716a286bfd962fca8f35a9aa4b6ee | ac1c7eea215dd161e27cef557e83cec09497741c | refs/heads/master | 2023-01-19T10:02:45.543098 | 2020-11-24T14:59:00 | 2020-11-24T14:59:00 | 315,663,738 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 628 | cpp | #include <iostream>
#include <string>
using namespace std;
int main()
{
setlocale(NULL, "rus");
string s;
string glas = "QWERTYUIOPASDFGHJKLLZXCVBNM";
int k = 0;
cout << "Введите строку:";
cin >> s;
for (std::string::size_type i = 0; i < s.length(); i++)
{
for (std::string::size_type g = 0; g < glas.length(); g++)
{
if (s.find(glas[g], i) == i)
{
k++;
break;
}
}
}
cout << "Количество прописных букв = " << k;
cout << "\n";
system("pause");
}
| [
"quantrap0910@gmail.com"
] | quantrap0910@gmail.com |
98a208f31bccf35fd079c65737819b4aadc0bb52 | b1aef802c0561f2a730ac3125c55325d9c480e45 | /src/ripple/rpc/handlers/AccountChannels.cpp | 91f4d0872c1fcb658c7c7c8b46f9eff22052af9b | [] | no_license | sgy-official/sgy | d3f388cefed7cf20513c14a2a333c839aa0d66c6 | 8c5c356c81b24180d8763d3bbc0763f1046871ac | refs/heads/master | 2021-05-19T07:08:54.121998 | 2020-03-31T11:08:16 | 2020-03-31T11:08:16 | 251,577,856 | 6 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 4,970 | cpp |
#include <ripple/app/main/Application.h>
#include <ripple/ledger/ReadView.h>
#include <ripple/ledger/View.h>
#include <ripple/net/RPCErr.h>
#include <ripple/protocol/ErrorCodes.h>
#include <ripple/protocol/jss.h>
#include <ripple/protocol/PublicKey.h>
#include <ripple/protocol/STAccount.h>
#include <ripple/resource/Fees.h>
#include <ripple/rpc/Context.h>
#include <ripple/rpc/impl/RPCHelpers.h>
#include <ripple/rpc/impl/Tuning.h>
namespace ripple {
void addChannel (Json::Value& jsonLines, SLE const& line)
{
Json::Value& jDst (jsonLines.append (Json::objectValue));
jDst[jss::channel_id] = to_string (line.key ());
jDst[jss::account] = to_string (line[sfAccount]);
jDst[jss::destination_account] = to_string (line[sfDestination]);
jDst[jss::amount] = line[sfAmount].getText ();
jDst[jss::balance] = line[sfBalance].getText ();
if (publicKeyType(line[sfPublicKey]))
{
PublicKey const pk (line[sfPublicKey]);
jDst[jss::public_key] = toBase58 (TokenType::AccountPublic, pk);
jDst[jss::public_key_hex] = strHex (pk);
}
jDst[jss::settle_delay] = line[sfSettleDelay];
if (auto const& v = line[~sfExpiration])
jDst[jss::expiration] = *v;
if (auto const& v = line[~sfCancelAfter])
jDst[jss::cancel_after] = *v;
if (auto const& v = line[~sfSourceTag])
jDst[jss::source_tag] = *v;
if (auto const& v = line[~sfDestinationTag])
jDst[jss::destination_tag] = *v;
}
Json::Value doAccountChannels (RPC::Context& context)
{
auto const& params (context.params);
if (! params.isMember (jss::account))
return RPC::missing_field_error (jss::account);
std::shared_ptr<ReadView const> ledger;
auto result = RPC::lookupLedger (ledger, context);
if (! ledger)
return result;
std::string strIdent (params[jss::account].asString ());
AccountID accountID;
if (auto const actResult = RPC::accountFromString (accountID, strIdent))
return actResult;
if (! ledger->exists(keylet::account (accountID)))
return rpcError (rpcACT_NOT_FOUND);
std::string strDst;
if (params.isMember (jss::destination_account))
strDst = params[jss::destination_account].asString ();
auto hasDst = ! strDst.empty ();
AccountID raDstAccount;
if (hasDst)
{
if (auto const actResult = RPC::accountFromString (raDstAccount, strDst))
return actResult;
}
unsigned int limit;
if (auto err = readLimitField(limit, RPC::Tuning::accountChannels, context))
return *err;
Json::Value jsonChannels{Json::arrayValue};
struct VisitData
{
std::vector <std::shared_ptr<SLE const>> items;
AccountID const& accountID;
bool hasDst;
AccountID const& raDstAccount;
};
VisitData visitData = {{}, accountID, hasDst, raDstAccount};
unsigned int reserve (limit);
uint256 startAfter;
std::uint64_t startHint;
if (params.isMember (jss::marker))
{
Json::Value const& marker (params[jss::marker]);
if (! marker.isString ())
return RPC::expected_field_error (jss::marker, "string");
startAfter.SetHex (marker.asString ());
auto const sleChannel = ledger->read({ltPAYCHAN, startAfter});
if (! sleChannel)
return rpcError (rpcINVALID_PARAMS);
if (sleChannel->getFieldAmount (sfLowLimit).getIssuer () == accountID)
startHint = sleChannel->getFieldU64 (sfLowNode);
else if (sleChannel->getFieldAmount (sfHighLimit).getIssuer () == accountID)
startHint = sleChannel->getFieldU64 (sfHighNode);
else
return rpcError (rpcINVALID_PARAMS);
addChannel (jsonChannels, *sleChannel);
visitData.items.reserve (reserve);
}
else
{
startHint = 0;
visitData.items.reserve (++reserve);
}
if (! forEachItemAfter(*ledger, accountID,
startAfter, startHint, reserve,
[&visitData](std::shared_ptr<SLE const> const& sleCur)
{
if (sleCur && sleCur->getType () == ltPAYCHAN &&
(! visitData.hasDst ||
visitData.raDstAccount == (*sleCur)[sfDestination]))
{
visitData.items.emplace_back (sleCur);
return true;
}
return false;
}))
{
return rpcError (rpcINVALID_PARAMS);
}
if (visitData.items.size () == reserve)
{
result[jss::limit] = limit;
result[jss::marker] = to_string (visitData.items.back()->key());
visitData.items.pop_back ();
}
result[jss::account] = context.app.accountIDCache().toBase58 (accountID);
for (auto const& item : visitData.items)
addChannel (jsonChannels, *item);
context.loadType = Resource::feeMediumBurdenRPC;
result[jss::channels] = std::move(jsonChannels);
return result;
}
}
| [
"sgy-official@hotmail.com"
] | sgy-official@hotmail.com |
8558b27c9a88c8737b2a0ea4d3a60f99c1a43e7a | f5e515ecd2353968ea61221916ce506d1ab272bd | /Popular/1914/main.cpp | ffd6122ce679a3614add10a7843ba05942317c82 | [] | no_license | longlongvip/LuoGu | e19affc49f21cc2a4d709ac1b4e4ae2aea93fc85 | 4bec278bac369f1f91fca2f3b9fb77d9d23992e1 | refs/heads/master | 2020-12-21T02:50:59.275412 | 2020-01-26T08:33:19 | 2020-01-26T08:33:19 | 236,284,507 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 615 | cpp | #include<cstdio>
#include<iostream>
#include<string>
char little_table[26] = {
'a' , 'b' , 'c' , 'd' , 'e' , 'f' , 'g' ,
'h' , 'i' , 'j' , 'k' , 'l' , 'm' , 'n' ,
'o' , 'p' , 'q' , 'r' , 's' , 't' , 'u' ,
'v' , 'w' , 'x' , 'y' , 'z'
};
using namespace std;
int main(){
int n;
cin >> n;
string input;
cin >> input;
int l = input.length();
for(int i = 0 ; i < l ; i++)
{
int index = input[i] - 'a';
input[i] = little_table[(index + n) % 26];
}
for(int i = 0 ; i < l ; i++)
{
cout << input[i];
}
system("pause");
return 0;
}
| [
"longlongvip@outlook.com"
] | longlongvip@outlook.com |
a15a4e7099d1e01a68899a6cdd513341f4735b57 | 64777f2b4d2c9781aef8f19f499d5525ea395b2d | /src/Street.cpp | 417a7f56b1166b30f5f3d405e7cf699cf431c709 | [] | no_license | mlsdpk/concurrent-traffic-simulation | 528f38215ef5b966c60a3a46808110621eb8cc43 | 73528b4cb7ea60b96b2faede07d6895b7b88c445 | refs/heads/master | 2023-02-27T16:21:51.053392 | 2021-02-04T06:58:12 | 2021-02-04T06:58:12 | 335,706,372 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 646 | cpp | #include "Street.h"
#include <iostream>
#include "Intersection.h"
#include "Vehicle.h"
Street::Street() {
_type = ObjectType::objectStreet;
_length = 1000.0; // in m
}
void Street::setInIntersection(std::shared_ptr<Intersection> in) {
_interIn = in;
in->addStreet(get_shared_this()); // add this street to list of streets
// connected to the intersection
}
void Street::setOutIntersection(std::shared_ptr<Intersection> out) {
_interOut = out;
out->addStreet(get_shared_this()); // add this street to list of streets
// connected to the intersection
}
| [
"mlsdphonethk@gmail.com"
] | mlsdphonethk@gmail.com |
57c1abf7b4afcd14c1c25ca8b36c8b1ba52ab27c | a0515b77831cd7654096201cfacca8ef04762ae0 | /zad2/zad2.ino | 8790fd0f6fb66a464dbd5613e9ad2caa4548bca1 | [] | no_license | jankowskirobert/ArduinoISA | 07cdabd66b3dcfdbc8d76e8c02eb52276a1a7744 | 48aced37dc4169b1b212a2d31e5d8db8d2e69dbd | refs/heads/master | 2021-01-22T19:42:04.892038 | 2018-01-09T19:15:20 | 2018-01-09T19:15:20 | 85,230,476 | 1 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 332 | ino | #include <ISADefinitions.h>
void setup() {
int licznik;
for(licznik = 0; licznik<8; licznik++)
{
pinMode(LEDS[licznik], OUTPUT);
}
}
void loop() {
int dioda;
int licznik;
for(licznik = 0; licznik<8; licznik++)
{
digitalWrite(LEDS[licznik], HIGH);
delay(100);
digitalWrite(LEDS[licznik], LOW);
}
}
| [
"jankowski.r@hotmail.com"
] | jankowski.r@hotmail.com |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.