Reset23/the-stack-v2-cpp · Datasets at Hugging Face

5011a39e3fea2204fbf6f81870612ec0269f4c72

59138b1b34e2a9356ad7154a9705007349209e9a

/platform/JS/V8/v8/test/cctest/test-macro-assembler-mips.cc

c00b8e65a19f7599f373fb524b2ca376929741f8

[ "BSD-3-Clause", "bzip2-1.0.6", "SunPro", "Apache-2.0" ]

permissive

gboyraz/macchina.io

6b879fca2329e7060122adfc691b4870d4dc06ac

de79c4d2eace01e24d685ac7f7c2e8aadf6b2668

refs/heads/master

2020-06-29T13:18:05.975243

2019-08-04T22:43:08

200,547,738

2

0

Apache-2.0

2019-08-04T22:29:19

null

UTF-8

C++

false

57,987

cc

// Copyright 2013 the V8 project authors. 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. #include <stdlib.h> #include <iostream> // NOLINT(readability/streams) #include "src/base/utils/random-number-generator.h" #include "src/macro-assembler.h" #include "src/mips/macro-assembler-mips.h" #include "src/mips/simulator-mips.h" #include "src/v8.h" #include "test/cctest/cctest.h" using namespace v8::internal; typedef void* (*F)(int x, int y, int p2, int p3, int p4); typedef Object* (*F1)(int x, int p1, int p2, int p3, int p4); typedef Object* (*F3)(void* p, int p1, int p2, int p3, int p4); typedef Object* (*F4)(void* p0, void* p1, int p2, int p3, int p4); #define __ masm-> TEST(BYTESWAP) { CcTest::InitializeVM(); Isolate* isolate = CcTest::i_isolate(); HandleScope handles(isolate); struct T { int32_t r1; int32_t r2; int32_t r3; int32_t r4; int32_t r5; }; T t; MacroAssembler assembler(isolate, NULL, 0, v8::internal::CodeObjectRequired::kYes); MacroAssembler* masm = &assembler; __ lw(a2, MemOperand(a0, offsetof(T, r1))); __ nop(); __ ByteSwapSigned(a2, a2, 4); __ sw(a2, MemOperand(a0, offsetof(T, r1))); __ lw(a2, MemOperand(a0, offsetof(T, r2))); __ nop(); __ ByteSwapSigned(a2, a2, 2); __ sw(a2, MemOperand(a0, offsetof(T, r2))); __ lw(a2, MemOperand(a0, offsetof(T, r3))); __ nop(); __ ByteSwapSigned(a2, a2, 1); __ sw(a2, MemOperand(a0, offsetof(T, r3))); __ lw(a2, MemOperand(a0, offsetof(T, r4))); __ nop(); __ ByteSwapUnsigned(a2, a2, 1); __ sw(a2, MemOperand(a0, offsetof(T, r4))); __ lw(a2, MemOperand(a0, offsetof(T, r5))); __ nop(); __ ByteSwapUnsigned(a2, a2, 2); __ sw(a2, MemOperand(a0, offsetof(T, r5))); __ jr(ra); __ nop(); CodeDesc desc; masm->GetCode(isolate, &desc); Handle<Code> code = isolate->factory()->NewCode( desc, Code::ComputeFlags(Code::STUB), Handle<Code>()); ::F3 f = FUNCTION_CAST<::F3>(code->entry()); t.r1 = 0x781A15C3; t.r2 = 0x2CDE; t.r3 = 0x9F; t.r4 = 0x9F; t.r5 = 0x2CDE; Object* dummy = CALL_GENERATED_CODE(isolate, f, &t, 0, 0, 0, 0); USE(dummy); CHECK_EQ(static_cast<int32_t>(0xC3151A78), t.r1); CHECK_EQ(static_cast<int32_t>(0xDE2C0000), t.r2); CHECK_EQ(static_cast<int32_t>(0x9FFFFFFF), t.r3); CHECK_EQ(static_cast<int32_t>(0x9F000000), t.r4); CHECK_EQ(static_cast<int32_t>(0xDE2C0000), t.r5); } static void TestNaN(const char *code) { // NaN value is different on MIPS and x86 architectures, and TEST(NaNx) // tests checks the case where a x86 NaN value is serialized into the // snapshot on the simulator during cross compilation. v8::HandleScope scope(CcTest::isolate()); v8::Local<v8::Context> context = CcTest::NewContext(PRINT_EXTENSION); v8::Context::Scope context_scope(context); v8::Local<v8::Script> script = v8::Script::Compile(context, v8_str(code)).ToLocalChecked(); v8::Local<v8::Object> result = v8::Local<v8::Object>::Cast(script->Run(context).ToLocalChecked()); i::Handle<i::JSReceiver> o = v8::Utils::OpenHandle(*result); i::Handle<i::JSArray> array1(reinterpret_cast<i::JSArray*>(*o)); i::FixedDoubleArray* a = i::FixedDoubleArray::cast(array1->elements()); double value = a->get_scalar(0); CHECK(std::isnan(value) && bit_cast<uint64_t>(value) == bit_cast<uint64_t>(std::numeric_limits<double>::quiet_NaN())); } TEST(NaN0) { TestNaN( "var result;" "for (var i = 0; i < 2; i++) {" " result = new Array(Number.NaN, Number.POSITIVE_INFINITY);" "}" "result;"); } TEST(NaN1) { TestNaN( "var result;" "for (var i = 0; i < 2; i++) {" " result = [NaN];" "}" "result;"); } TEST(jump_tables4) { // Similar to test-assembler-mips jump_tables1, with extra test for branch // trampoline required before emission of the dd table (where trampolines are // blocked), and proper transition to long-branch mode. // Regression test for v8:4294. CcTest::InitializeVM(); Isolate* isolate = CcTest::i_isolate(); HandleScope scope(isolate); MacroAssembler assembler(isolate, nullptr, 0, v8::internal::CodeObjectRequired::kYes); MacroAssembler* masm = &assembler; const int kNumCases = 512; int values[kNumCases]; isolate->random_number_generator()->NextBytes(values, sizeof(values)); Label labels[kNumCases]; Label near_start, end, done; __ Push(ra); __ mov(v0, zero_reg); __ Branch(&end); __ bind(&near_start); // Generate slightly less than 32K instructions, which will soon require // trampoline for branch distance fixup. for (int i = 0; i < 32768 - 256; ++i) { __ addiu(v0, v0, 1); } __ GenerateSwitchTable(a0, kNumCases, [&labels](size_t i) { return labels + i; }); for (int i = 0; i < kNumCases; ++i) { __ bind(&labels[i]); __ li(v0, values[i]); __ Branch(&done); } __ bind(&done); __ Pop(ra); __ jr(ra); __ nop(); __ bind(&end); __ Branch(&near_start); CodeDesc desc; masm->GetCode(isolate, &desc); Handle<Code> code = isolate->factory()->NewCode( desc, Code::ComputeFlags(Code::STUB), Handle<Code>()); #ifdef OBJECT_PRINT code->Print(std::cout); #endif F1 f = FUNCTION_CAST<F1>(code->entry()); for (int i = 0; i < kNumCases; ++i) { int res = reinterpret_cast<int>(CALL_GENERATED_CODE(isolate, f, i, 0, 0, 0, 0)); ::printf("f(%d) = %d\n", i, res); CHECK_EQ(values[i], res); } } TEST(jump_tables5) { if (!IsMipsArchVariant(kMips32r6)) return; // Similar to test-assembler-mips jump_tables1, with extra test for emitting a // compact branch instruction before emission of the dd table. CcTest::InitializeVM(); Isolate* isolate = CcTest::i_isolate(); HandleScope scope(isolate); MacroAssembler assembler(isolate, nullptr, 0, v8::internal::CodeObjectRequired::kYes); MacroAssembler* masm = &assembler; const int kNumCases = 512; int values[kNumCases]; isolate->random_number_generator()->NextBytes(values, sizeof(values)); Label labels[kNumCases]; Label done; __ Push(ra); { __ BlockTrampolinePoolFor(kNumCases + 6 + 1); PredictableCodeSizeScope predictable( masm, kNumCases * kPointerSize + ((6 + 1) * Assembler::kInstrSize)); __ addiupc(at, 6 + 1); __ Lsa(at, at, a0, 2); __ lw(at, MemOperand(at)); __ jalr(at); __ nop(); // Branch delay slot nop. __ bc(&done); // A nop instruction must be generated by the forbidden slot guard // (Assembler::dd(Label*)). for (int i = 0; i < kNumCases; ++i) { __ dd(&labels[i]); } } for (int i = 0; i < kNumCases; ++i) { __ bind(&labels[i]); __ li(v0, values[i]); __ jr(ra); __ nop(); } __ bind(&done); __ Pop(ra); __ jr(ra); __ nop(); CodeDesc desc; masm->GetCode(isolate, &desc); Handle<Code> code = isolate->factory()->NewCode( desc, Code::ComputeFlags(Code::STUB), Handle<Code>()); #ifdef OBJECT_PRINT code->Print(std::cout); #endif F1 f = FUNCTION_CAST<F1>(code->entry()); for (int i = 0; i < kNumCases; ++i) { int32_t res = reinterpret_cast<int32_t>( CALL_GENERATED_CODE(isolate, f, i, 0, 0, 0, 0)); ::printf("f(%d) = %d\n", i, res); CHECK_EQ(values[i], res); } } TEST(jump_tables6) { // Similar to test-assembler-mips jump_tables1, with extra test for branch // trampoline required after emission of the dd table (where trampolines are // blocked). This test checks if number of really generated instructions is // greater than number of counted instructions from code, as we are expecting // generation of trampoline in this case (when number of kFillInstr // instructions is close to 32K) CcTest::InitializeVM(); Isolate* isolate = CcTest::i_isolate(); HandleScope scope(isolate); MacroAssembler assembler(isolate, nullptr, 0, v8::internal::CodeObjectRequired::kYes); MacroAssembler* masm = &assembler; const int kSwitchTableCases = 40; const int kInstrSize = Assembler::kInstrSize; const int kMaxBranchOffset = Assembler::kMaxBranchOffset; const int kTrampolineSlotsSize = Assembler::kTrampolineSlotsSize; const int kSwitchTablePrologueSize = MacroAssembler::kSwitchTablePrologueSize; const int kMaxOffsetForTrampolineStart = kMaxBranchOffset - 16 * kTrampolineSlotsSize; const int kFillInstr = (kMaxOffsetForTrampolineStart / kInstrSize) - (kSwitchTablePrologueSize + kSwitchTableCases) - 20; int values[kSwitchTableCases]; isolate->random_number_generator()->NextBytes(values, sizeof(values)); Label labels[kSwitchTableCases]; Label near_start, end, done; __ Push(ra); __ mov(v0, zero_reg); int offs1 = masm->pc_offset(); int gen_insn = 0; __ Branch(&end); gen_insn += Assembler::IsCompactBranchSupported() ? 1 : 2; __ bind(&near_start); // Generate slightly less than 32K instructions, which will soon require // trampoline for branch distance fixup. for (int i = 0; i < kFillInstr; ++i) { __ addiu(v0, v0, 1); } gen_insn += kFillInstr; __ GenerateSwitchTable(a0, kSwitchTableCases, [&labels](size_t i) { return labels + i; }); gen_insn += (kSwitchTablePrologueSize + kSwitchTableCases); for (int i = 0; i < kSwitchTableCases; ++i) { __ bind(&labels[i]); __ li(v0, values[i]); __ Branch(&done); } gen_insn += ((Assembler::IsCompactBranchSupported() ? 3 : 4) * kSwitchTableCases); // If offset from here to first branch instr is greater than max allowed // offset for trampoline ... CHECK_LT(kMaxOffsetForTrampolineStart, masm->pc_offset() - offs1); // ... number of generated instructions must be greater then "gen_insn", // as we are expecting trampoline generation CHECK_LT(gen_insn, (masm->pc_offset() - offs1) / kInstrSize); __ bind(&done); __ Pop(ra); __ jr(ra); __ nop(); __ bind(&end); __ Branch(&near_start); CodeDesc desc; masm->GetCode(isolate, &desc); Handle<Code> code = isolate->factory()->NewCode( desc, Code::ComputeFlags(Code::STUB), Handle<Code>()); #ifdef OBJECT_PRINT code->Print(std::cout); #endif F1 f = FUNCTION_CAST<F1>(code->entry()); for (int i = 0; i < kSwitchTableCases; ++i) { int res = reinterpret_cast<int>(CALL_GENERATED_CODE(isolate, f, i, 0, 0, 0, 0)); ::printf("f(%d) = %d\n", i, res); CHECK_EQ(values[i], res); } } static uint32_t run_lsa(uint32_t rt, uint32_t rs, int8_t sa) { Isolate* isolate = CcTest::i_isolate(); HandleScope scope(isolate); MacroAssembler assembler(isolate, nullptr, 0, v8::internal::CodeObjectRequired::kYes); MacroAssembler* masm = &assembler; __ Lsa(v0, a0, a1, sa); __ jr(ra); __ nop(); CodeDesc desc; assembler.GetCode(isolate, &desc); Handle<Code> code = isolate->factory()->NewCode( desc, Code::ComputeFlags(Code::STUB), Handle<Code>()); F1 f = FUNCTION_CAST<F1>(code->entry()); uint32_t res = reinterpret_cast<uint32_t>( CALL_GENERATED_CODE(isolate, f, rt, rs, 0, 0, 0)); return res; } TEST(Lsa) { CcTest::InitializeVM(); struct TestCaseLsa { int32_t rt; int32_t rs; uint8_t sa; uint32_t expected_res; }; struct TestCaseLsa tc[] = {// rt, rs, sa, expected_res {0x4, 0x1, 1, 0x6}, {0x4, 0x1, 2, 0x8}, {0x4, 0x1, 3, 0xc}, {0x4, 0x1, 4, 0x14}, {0x4, 0x1, 5, 0x24}, {0x0, 0x1, 1, 0x2}, {0x0, 0x1, 2, 0x4}, {0x0, 0x1, 3, 0x8}, {0x0, 0x1, 4, 0x10}, {0x0, 0x1, 5, 0x20}, {0x4, 0x0, 1, 0x4}, {0x4, 0x0, 2, 0x4}, {0x4, 0x0, 3, 0x4}, {0x4, 0x0, 4, 0x4}, {0x4, 0x0, 5, 0x4}, // Shift overflow. {0x4, INT32_MAX, 1, 0x2}, {0x4, INT32_MAX >> 1, 2, 0x0}, {0x4, INT32_MAX >> 2, 3, 0xfffffffc}, {0x4, INT32_MAX >> 3, 4, 0xfffffff4}, {0x4, INT32_MAX >> 4, 5, 0xffffffe4}, // Signed addition overflow. {INT32_MAX - 1, 0x1, 1, 0x80000000}, {INT32_MAX - 3, 0x1, 2, 0x80000000}, {INT32_MAX - 7, 0x1, 3, 0x80000000}, {INT32_MAX - 15, 0x1, 4, 0x80000000}, {INT32_MAX - 31, 0x1, 5, 0x80000000}, // Addition overflow. {-2, 0x1, 1, 0x0}, {-4, 0x1, 2, 0x0}, {-8, 0x1, 3, 0x0}, {-16, 0x1, 4, 0x0}, {-32, 0x1, 5, 0x0}}; size_t nr_test_cases = sizeof(tc) / sizeof(TestCaseLsa); for (size_t i = 0; i < nr_test_cases; ++i) { uint32_t res = run_lsa(tc[i].rt, tc[i].rs, tc[i].sa); PrintF("0x%x =? 0x%x == lsa(v0, %x, %x, %hhu)\n", tc[i].expected_res, res, tc[i].rt, tc[i].rs, tc[i].sa); CHECK_EQ(tc[i].expected_res, res); } } static const std::vector<uint32_t> cvt_trunc_uint32_test_values() { static const uint32_t kValues[] = {0x00000000, 0x00000001, 0x00ffff00, 0x7fffffff, 0x80000000, 0x80000001, 0x80ffff00, 0x8fffffff, 0xffffffff}; return std::vector<uint32_t>(&kValues[0], &kValues[arraysize(kValues)]); } static const std::vector<int32_t> cvt_trunc_int32_test_values() { static const int32_t kValues[] = { static_cast<int32_t>(0x00000000), static_cast<int32_t>(0x00000001), static_cast<int32_t>(0x00ffff00), static_cast<int32_t>(0x7fffffff), static_cast<int32_t>(0x80000000), static_cast<int32_t>(0x80000001), static_cast<int32_t>(0x80ffff00), static_cast<int32_t>(0x8fffffff), static_cast<int32_t>(0xffffffff)}; return std::vector<int32_t>(&kValues[0], &kValues[arraysize(kValues)]); } // Helper macros that can be used in FOR_INT32_INPUTS(i) { ... *i ... } #define FOR_INPUTS(ctype, itype, var, test_vector) \ std::vector<ctype> var##_vec = test_vector(); \ for (std::vector<ctype>::iterator var = var##_vec.begin(); \ var != var##_vec.end(); ++var) #define FOR_INPUTS2(ctype, itype, var, var2, test_vector) \ std::vector<ctype> var##_vec = test_vector(); \ std::vector<ctype>::iterator var; \ std::vector<ctype>::reverse_iterator var2; \ for (var = var##_vec.begin(), var2 = var##_vec.rbegin(); \ var != var##_vec.end(); ++var, ++var2) #define FOR_ENUM_INPUTS(var, type, test_vector) \ FOR_INPUTS(enum type, type, var, test_vector) #define FOR_STRUCT_INPUTS(var, type, test_vector) \ FOR_INPUTS(struct type, type, var, test_vector) #define FOR_UINT32_INPUTS(var, test_vector) \ FOR_INPUTS(uint32_t, uint32, var, test_vector) #define FOR_INT32_INPUTS(var, test_vector) \ FOR_INPUTS(int32_t, int32, var, test_vector) #define FOR_INT32_INPUTS2(var, var2, test_vector) \ FOR_INPUTS2(int32_t, int32, var, var2, test_vector) #define FOR_UINT64_INPUTS(var, test_vector) \ FOR_INPUTS(uint64_t, uint32, var, test_vector) template <typename RET_TYPE, typename IN_TYPE, typename Func> RET_TYPE run_Cvt(IN_TYPE x, Func GenerateConvertInstructionFunc) { typedef RET_TYPE (*F_CVT)(IN_TYPE x0, int x1, int x2, int x3, int x4); Isolate* isolate = CcTest::i_isolate(); HandleScope scope(isolate); MacroAssembler assm(isolate, nullptr, 0, v8::internal::CodeObjectRequired::kYes); MacroAssembler* masm = &assm; __ mtc1(a0, f4); GenerateConvertInstructionFunc(masm); __ mfc1(v0, f2); __ jr(ra); __ nop(); CodeDesc desc; assm.GetCode(isolate, &desc); Handle<Code> code = isolate->factory()->NewCode( desc, Code::ComputeFlags(Code::STUB), Handle<Code>()); F_CVT f = FUNCTION_CAST<F_CVT>(code->entry()); return reinterpret_cast<RET_TYPE>( CALL_GENERATED_CODE(isolate, f, x, 0, 0, 0, 0)); } TEST(cvt_s_w_Trunc_uw_s) { CcTest::InitializeVM(); FOR_UINT32_INPUTS(i, cvt_trunc_uint32_test_values) { uint32_t input = *i; auto fn = [](MacroAssembler* masm) { __ cvt_s_w(f0, f4); __ Trunc_uw_s(f2, f0, f6); }; CHECK_EQ(static_cast<float>(input), run_Cvt<uint32_t>(input, fn)); } } TEST(cvt_d_w_Trunc_w_d) { CcTest::InitializeVM(); FOR_INT32_INPUTS(i, cvt_trunc_int32_test_values) { int32_t input = *i; auto fn = [](MacroAssembler* masm) { __ cvt_d_w(f0, f4); __ Trunc_w_d(f2, f0); }; CHECK_EQ(static_cast<double>(input), run_Cvt<int32_t>(input, fn)); } } static const std::vector<int32_t> overflow_int32_test_values() { static const int32_t kValues[] = { static_cast<int32_t>(0xf0000000), static_cast<int32_t>(0x00000001), static_cast<int32_t>(0xff000000), static_cast<int32_t>(0x0000f000), static_cast<int32_t>(0x0f000000), static_cast<int32_t>(0x991234ab), static_cast<int32_t>(0xb0ffff01), static_cast<int32_t>(0x00006fff), static_cast<int32_t>(0xffffffff)}; return std::vector<int32_t>(&kValues[0], &kValues[arraysize(kValues)]); } enum OverflowBranchType { kAddBranchOverflow, kSubBranchOverflow, }; struct OverflowRegisterCombination { Register dst; Register left; Register right; Register scratch; }; static const std::vector<enum OverflowBranchType> overflow_branch_type() { static const enum OverflowBranchType kValues[] = {kAddBranchOverflow, kSubBranchOverflow}; return std::vector<enum OverflowBranchType>(&kValues[0], &kValues[arraysize(kValues)]); } static const std::vector<struct OverflowRegisterCombination> overflow_register_combination() { static const struct OverflowRegisterCombination kValues[] = { {t0, t1, t2, t3}, {t0, t0, t2, t3}, {t0, t1, t0, t3}, {t0, t1, t1, t3}}; return std::vector<struct OverflowRegisterCombination>( &kValues[0], &kValues[arraysize(kValues)]); } template <typename T> static bool IsAddOverflow(T x, T y) { DCHECK(std::numeric_limits<T>::is_integer); T max = std::numeric_limits<T>::max(); T min = std::numeric_limits<T>::min(); return (x > 0 && y > (max - x)) || (x < 0 && y < (min - x)); } template <typename T> static bool IsSubOverflow(T x, T y) { DCHECK(std::numeric_limits<T>::is_integer); T max = std::numeric_limits<T>::max(); T min = std::numeric_limits<T>::min(); return (y > 0 && x < (min + y)) || (y < 0 && x > (max + y)); } template <typename IN_TYPE, typename Func> static bool runOverflow(IN_TYPE valLeft, IN_TYPE valRight, Func GenerateOverflowInstructions) { typedef int32_t (*F_CVT)(char* x0, int x1, int x2, int x3, int x4); Isolate* isolate = CcTest::i_isolate(); HandleScope scope(isolate); MacroAssembler assm(isolate, nullptr, 0, v8::internal::CodeObjectRequired::kYes); MacroAssembler* masm = &assm; GenerateOverflowInstructions(masm, valLeft, valRight); __ jr(ra); __ nop(); CodeDesc desc; assm.GetCode(isolate, &desc); Handle<Code> code = isolate->factory()->NewCode( desc, Code::ComputeFlags(Code::STUB), Handle<Code>()); F_CVT f = FUNCTION_CAST<F_CVT>(code->entry()); int32_t r = reinterpret_cast<int32_t>(CALL_GENERATED_CODE(isolate, f, 0, 0, 0, 0, 0)); DCHECK(r == 0 || r == 1); return r; } TEST(BranchOverflowInt32BothLabelsTrampoline) { if (!IsMipsArchVariant(kMips32r6)) return; static const int kMaxBranchOffset = (1 << (18 - 1)) - 1; FOR_INT32_INPUTS(i, overflow_int32_test_values) { FOR_INT32_INPUTS(j, overflow_int32_test_values) { FOR_ENUM_INPUTS(br, OverflowBranchType, overflow_branch_type) { FOR_STRUCT_INPUTS(regComb, OverflowRegisterCombination, overflow_register_combination) { int32_t ii = *i; int32_t jj = *j; enum OverflowBranchType branchType = *br; struct OverflowRegisterCombination rc = *regComb; // If left and right register are same then left and right // test values must also be same, otherwise we skip the test if (rc.left.code() == rc.right.code()) { if (ii != jj) { continue; } } bool res1 = runOverflow<int32_t>( ii, jj, [branchType, rc](MacroAssembler* masm, int32_t valLeft, int32_t valRight) { Label overflow, no_overflow, end; __ li(rc.left, valLeft); __ li(rc.right, valRight); switch (branchType) { case kAddBranchOverflow: __ AddBranchOvf(rc.dst, rc.left, rc.right, &overflow, &no_overflow, rc.scratch); break; case kSubBranchOverflow: __ SubBranchOvf(rc.dst, rc.left, rc.right, &overflow, &no_overflow, rc.scratch); break; } Label done; size_t nr_calls = kMaxBranchOffset / (2 * Instruction::kInstrSize) + 2; for (size_t i = 0; i < nr_calls; ++i) { __ BranchShort(&done, eq, a0, Operand(a1)); } __ bind(&done); __ li(v0, 2); __ Branch(&end); __ bind(&overflow); __ li(v0, 1); __ Branch(&end); __ bind(&no_overflow); __ li(v0, 0); __ bind(&end); }); switch (branchType) { case kAddBranchOverflow: CHECK_EQ(IsAddOverflow<int32_t>(ii, jj), res1); break; case kSubBranchOverflow: CHECK_EQ(IsSubOverflow<int32_t>(ii, jj), res1); break; default: UNREACHABLE(); } } } } } } TEST(BranchOverflowInt32BothLabels) { FOR_INT32_INPUTS(i, overflow_int32_test_values) { FOR_INT32_INPUTS(j, overflow_int32_test_values) { FOR_ENUM_INPUTS(br, OverflowBranchType, overflow_branch_type) { FOR_STRUCT_INPUTS(regComb, OverflowRegisterCombination, overflow_register_combination) { int32_t ii = *i; int32_t jj = *j; enum OverflowBranchType branchType = *br; struct OverflowRegisterCombination rc = *regComb; // If left and right register are same then left and right // test values must also be same, otherwise we skip the test if (rc.left.code() == rc.right.code()) { if (ii != jj) { continue; } } bool res1 = runOverflow<int32_t>( ii, jj, [branchType, rc](MacroAssembler* masm, int32_t valLeft, int32_t valRight) { Label overflow, no_overflow, end; __ li(rc.left, valLeft); __ li(rc.right, valRight); switch (branchType) { case kAddBranchOverflow: __ AddBranchOvf(rc.dst, rc.left, rc.right, &overflow, &no_overflow, rc.scratch); break; case kSubBranchOverflow: __ SubBranchOvf(rc.dst, rc.left, rc.right, &overflow, &no_overflow, rc.scratch); break; } __ li(v0, 2); __ Branch(&end); __ bind(&overflow); __ li(v0, 1); __ Branch(&end); __ bind(&no_overflow); __ li(v0, 0); __ bind(&end); }); bool res2 = runOverflow<int32_t>( ii, jj, [branchType, rc](MacroAssembler* masm, int32_t valLeft, int32_t valRight) { Label overflow, no_overflow, end; __ li(rc.left, valLeft); switch (branchType) { case kAddBranchOverflow: __ AddBranchOvf(rc.dst, rc.left, Operand(valRight), &overflow, &no_overflow, rc.scratch); break; case kSubBranchOverflow: __ SubBranchOvf(rc.dst, rc.left, Operand(valRight), &overflow, &no_overflow, rc.scratch); break; } __ li(v0, 2); __ Branch(&end); __ bind(&overflow); __ li(v0, 1); __ Branch(&end); __ bind(&no_overflow); __ li(v0, 0); __ bind(&end); }); switch (branchType) { case kAddBranchOverflow: CHECK_EQ(IsAddOverflow<int32_t>(ii, jj), res1); CHECK_EQ(IsAddOverflow<int32_t>(ii, jj), res2); break; case kSubBranchOverflow: CHECK_EQ(IsSubOverflow<int32_t>(ii, jj), res1); CHECK_EQ(IsSubOverflow<int32_t>(ii, jj), res2); break; default: UNREACHABLE(); } } } } } } TEST(BranchOverflowInt32LeftLabel) { FOR_INT32_INPUTS(i, overflow_int32_test_values) { FOR_INT32_INPUTS(j, overflow_int32_test_values) { FOR_ENUM_INPUTS(br, OverflowBranchType, overflow_branch_type) { FOR_STRUCT_INPUTS(regComb, OverflowRegisterCombination, overflow_register_combination) { int32_t ii = *i; int32_t jj = *j; enum OverflowBranchType branchType = *br; struct OverflowRegisterCombination rc = *regComb; // If left and right register are same then left and right // test values must also be same, otherwise we skip the test if (rc.left.code() == rc.right.code()) { if (ii != jj) { continue; } } bool res1 = runOverflow<int32_t>( ii, jj, [branchType, rc](MacroAssembler* masm, int32_t valLeft, int32_t valRight) { Label overflow, end; __ li(rc.left, valLeft); __ li(rc.right, valRight); switch (branchType) { case kAddBranchOverflow: __ AddBranchOvf(rc.dst, rc.left, rc.right, &overflow, NULL, rc.scratch); break; case kSubBranchOverflow: __ SubBranchOvf(rc.dst, rc.left, rc.right, &overflow, NULL, rc.scratch); break; } __ li(v0, 0); __ Branch(&end); __ bind(&overflow); __ li(v0, 1); __ bind(&end); }); bool res2 = runOverflow<int32_t>( ii, jj, [branchType, rc](MacroAssembler* masm, int32_t valLeft, int32_t valRight) { Label overflow, end; __ li(rc.left, valLeft); switch (branchType) { case kAddBranchOverflow: __ AddBranchOvf(rc.dst, rc.left, Operand(valRight), &overflow, NULL, rc.scratch); break; case kSubBranchOverflow: __ SubBranchOvf(rc.dst, rc.left, Operand(valRight), &overflow, NULL, rc.scratch); break; } __ li(v0, 0); __ Branch(&end); __ bind(&overflow); __ li(v0, 1); __ bind(&end); }); switch (branchType) { case kAddBranchOverflow: CHECK_EQ(IsAddOverflow<int32_t>(ii, jj), res1); CHECK_EQ(IsAddOverflow<int32_t>(ii, jj), res2); break; case kSubBranchOverflow: CHECK_EQ(IsSubOverflow<int32_t>(ii, jj), res1); CHECK_EQ(IsSubOverflow<int32_t>(ii, jj), res2); break; default: UNREACHABLE(); } } } } } } TEST(BranchOverflowInt32RightLabel) { FOR_INT32_INPUTS(i, overflow_int32_test_values) { FOR_INT32_INPUTS(j, overflow_int32_test_values) { FOR_ENUM_INPUTS(br, OverflowBranchType, overflow_branch_type) { FOR_STRUCT_INPUTS(regComb, OverflowRegisterCombination, overflow_register_combination) { int32_t ii = *i; int32_t jj = *j; enum OverflowBranchType branchType = *br; struct OverflowRegisterCombination rc = *regComb; // If left and right register are same then left and right // test values must also be same, otherwise we skip the test if (rc.left.code() == rc.right.code()) { if (ii != jj) { continue; } } bool res1 = runOverflow<int32_t>( ii, jj, [branchType, rc](MacroAssembler* masm, int32_t valLeft, int32_t valRight) { Label no_overflow, end; __ li(rc.left, valLeft); __ li(rc.right, valRight); switch (branchType) { case kAddBranchOverflow: __ AddBranchOvf(rc.dst, rc.left, rc.right, NULL, &no_overflow, rc.scratch); break; case kSubBranchOverflow: __ SubBranchOvf(rc.dst, rc.left, rc.right, NULL, &no_overflow, rc.scratch); break; } __ li(v0, 1); __ Branch(&end); __ bind(&no_overflow); __ li(v0, 0); __ bind(&end); }); bool res2 = runOverflow<int32_t>( ii, jj, [branchType, rc](MacroAssembler* masm, int32_t valLeft, int32_t valRight) { Label no_overflow, end; __ li(rc.left, valLeft); switch (branchType) { case kAddBranchOverflow: __ AddBranchOvf(rc.dst, rc.left, Operand(valRight), NULL, &no_overflow, rc.scratch); break; case kSubBranchOverflow: __ SubBranchOvf(rc.dst, rc.left, Operand(valRight), NULL, &no_overflow, rc.scratch); break; } __ li(v0, 1); __ Branch(&end); __ bind(&no_overflow); __ li(v0, 0); __ bind(&end); }); switch (branchType) { case kAddBranchOverflow: CHECK_EQ(IsAddOverflow<int32_t>(ii, jj), res1); CHECK_EQ(IsAddOverflow<int32_t>(ii, jj), res2); break; case kSubBranchOverflow: CHECK_EQ(IsSubOverflow<int32_t>(ii, jj), res1); CHECK_EQ(IsSubOverflow<int32_t>(ii, jj), res2); break; default: UNREACHABLE(); } } } } } } TEST(min_max_nan) { CcTest::InitializeVM(); Isolate* isolate = CcTest::i_isolate(); HandleScope scope(isolate); MacroAssembler assembler(isolate, nullptr, 0, v8::internal::CodeObjectRequired::kYes); MacroAssembler* masm = &assembler; struct TestFloat { double a; double b; double c; double d; float e; float f; float g; float h; }; TestFloat test; const double dnan = std::numeric_limits<double>::quiet_NaN(); const double dinf = std::numeric_limits<double>::infinity(); const double dminf = -std::numeric_limits<double>::infinity(); const float fnan = std::numeric_limits<float>::quiet_NaN(); const float finf = std::numeric_limits<float>::infinity(); const float fminf = std::numeric_limits<float>::infinity(); const int kTableLength = 13; double inputsa[kTableLength] = {2.0, 3.0, -0.0, 0.0, 42.0, dinf, dminf, dinf, dnan, 3.0, dinf, dnan, dnan}; double inputsb[kTableLength] = {3.0, 2.0, 0.0, -0.0, dinf, 42.0, dinf, dminf, 3.0, dnan, dnan, dinf, dnan}; double outputsdmin[kTableLength] = {2.0, 2.0, -0.0, -0.0, 42.0, 42.0, dminf, dminf, dnan, dnan, dnan, dnan, dnan}; double outputsdmax[kTableLength] = {3.0, 3.0, 0.0, 0.0, dinf, dinf, dinf, dinf, dnan, dnan, dnan, dnan, dnan}; float inputse[kTableLength] = {2.0, 3.0, -0.0, 0.0, 42.0, finf, fminf, finf, fnan, 3.0, finf, fnan, fnan}; float inputsf[kTableLength] = {3.0, 2.0, 0.0, -0.0, finf, 42.0, finf, fminf, 3.0, fnan, fnan, finf, fnan}; float outputsfmin[kTableLength] = {2.0, 2.0, -0.0, -0.0, 42.0, 42.0, fminf, fminf, fnan, fnan, fnan, fnan, fnan}; float outputsfmax[kTableLength] = {3.0, 3.0, 0.0, 0.0, finf, finf, finf, finf, fnan, fnan, fnan, fnan, fnan}; auto handle_dnan = [masm](FPURegister dst, Label* nan, Label* back) { __ bind(nan); __ LoadRoot(t8, Heap::kNanValueRootIndex); __ Ldc1(dst, FieldMemOperand(t8, HeapNumber::kValueOffset)); __ Branch(back); }; auto handle_snan = [masm, fnan](FPURegister dst, Label* nan, Label* back) { __ bind(nan); __ Move(dst, fnan); __ Branch(back); }; Label handle_mind_nan, handle_maxd_nan, handle_mins_nan, handle_maxs_nan; Label back_mind_nan, back_maxd_nan, back_mins_nan, back_maxs_nan; __ push(s6); __ InitializeRootRegister(); __ Ldc1(f4, MemOperand(a0, offsetof(TestFloat, a))); __ Ldc1(f8, MemOperand(a0, offsetof(TestFloat, b))); __ lwc1(f2, MemOperand(a0, offsetof(TestFloat, e))); __ lwc1(f6, MemOperand(a0, offsetof(TestFloat, f))); __ Float64Min(f10, f4, f8, &handle_mind_nan); __ bind(&back_mind_nan); __ Float64Max(f12, f4, f8, &handle_maxd_nan); __ bind(&back_maxd_nan); __ Float32Min(f14, f2, f6, &handle_mins_nan); __ bind(&back_mins_nan); __ Float32Max(f16, f2, f6, &handle_maxs_nan); __ bind(&back_maxs_nan); __ Sdc1(f10, MemOperand(a0, offsetof(TestFloat, c))); __ Sdc1(f12, MemOperand(a0, offsetof(TestFloat, d))); __ swc1(f14, MemOperand(a0, offsetof(TestFloat, g))); __ swc1(f16, MemOperand(a0, offsetof(TestFloat, h))); __ pop(s6); __ jr(ra); __ nop(); handle_dnan(f10, &handle_mind_nan, &back_mind_nan); handle_dnan(f12, &handle_maxd_nan, &back_maxd_nan); handle_snan(f14, &handle_mins_nan, &back_mins_nan); handle_snan(f16, &handle_maxs_nan, &back_maxs_nan); CodeDesc desc; masm->GetCode(isolate, &desc); Handle<Code> code = isolate->factory()->NewCode( desc, Code::ComputeFlags(Code::STUB), Handle<Code>()); ::F3 f = FUNCTION_CAST<::F3>(code->entry()); for (int i = 0; i < kTableLength; i++) { test.a = inputsa[i]; test.b = inputsb[i]; test.e = inputse[i]; test.f = inputsf[i]; CALL_GENERATED_CODE(isolate, f, &test, 0, 0, 0, 0); CHECK_EQ(0, memcmp(&test.c, &outputsdmin[i], sizeof(test.c))); CHECK_EQ(0, memcmp(&test.d, &outputsdmax[i], sizeof(test.d))); CHECK_EQ(0, memcmp(&test.g, &outputsfmin[i], sizeof(test.g))); CHECK_EQ(0, memcmp(&test.h, &outputsfmax[i], sizeof(test.h))); } } template <typename IN_TYPE, typename Func> bool run_Unaligned(char* memory_buffer, int32_t in_offset, int32_t out_offset, IN_TYPE value, Func GenerateUnalignedInstructionFunc) { typedef int32_t (*F_CVT)(char* x0, int x1, int x2, int x3, int x4); Isolate* isolate = CcTest::i_isolate(); HandleScope scope(isolate); MacroAssembler assm(isolate, nullptr, 0, v8::internal::CodeObjectRequired::kYes); MacroAssembler* masm = &assm; IN_TYPE res; GenerateUnalignedInstructionFunc(masm, in_offset, out_offset); __ jr(ra); __ nop(); CodeDesc desc; assm.GetCode(isolate, &desc); Handle<Code> code = isolate->factory()->NewCode( desc, Code::ComputeFlags(Code::STUB), Handle<Code>()); F_CVT f = FUNCTION_CAST<F_CVT>(code->entry()); MemCopy(memory_buffer + in_offset, &value, sizeof(IN_TYPE)); CALL_GENERATED_CODE(isolate, f, memory_buffer, 0, 0, 0, 0); MemCopy(&res, memory_buffer + out_offset, sizeof(IN_TYPE)); return res == value; } static const std::vector<uint64_t> unsigned_test_values() { static const uint64_t kValues[] = { 0x2180f18a06384414, 0x000a714532102277, 0xbc1acccf180649f0, 0x8000000080008000, 0x0000000000000001, 0xffffffffffffffff, }; return std::vector<uint64_t>(&kValues[0], &kValues[arraysize(kValues)]); } static const std::vector<int32_t> unsigned_test_offset() { static const int32_t kValues[] = {// value, offset -132 * KB, -21 * KB, 0, 19 * KB, 135 * KB}; return std::vector<int32_t>(&kValues[0], &kValues[arraysize(kValues)]); } static const std::vector<int32_t> unsigned_test_offset_increment() { static const int32_t kValues[] = {-5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5}; return std::vector<int32_t>(&kValues[0], &kValues[arraysize(kValues)]); } TEST(Ulh) { CcTest::InitializeVM(); static const int kBufferSize = 300 * KB; char memory_buffer[kBufferSize]; char* buffer_middle = memory_buffer + (kBufferSize / 2); FOR_UINT64_INPUTS(i, unsigned_test_values) { FOR_INT32_INPUTS2(j1, j2, unsigned_test_offset) { FOR_INT32_INPUTS2(k1, k2, unsigned_test_offset_increment) { uint16_t value = static_cast<uint64_t>(*i & 0xFFFF); int32_t in_offset = *j1 + *k1; int32_t out_offset = *j2 + *k2; auto fn_1 = [](MacroAssembler* masm, int32_t in_offset, int32_t out_offset) { __ Ulh(v0, MemOperand(a0, in_offset)); __ Ush(v0, MemOperand(a0, out_offset), v0); }; CHECK_EQ(true, run_Unaligned<uint16_t>(buffer_middle, in_offset, out_offset, value, fn_1)); auto fn_2 = [](MacroAssembler* masm, int32_t in_offset, int32_t out_offset) { __ mov(t0, a0); __ Ulh(a0, MemOperand(a0, in_offset)); __ Ush(a0, MemOperand(t0, out_offset), v0); }; CHECK_EQ(true, run_Unaligned<uint16_t>(buffer_middle, in_offset, out_offset, value, fn_2)); auto fn_3 = [](MacroAssembler* masm, int32_t in_offset, int32_t out_offset) { __ mov(t0, a0); __ Ulhu(a0, MemOperand(a0, in_offset)); __ Ush(a0, MemOperand(t0, out_offset), t1); }; CHECK_EQ(true, run_Unaligned<uint16_t>(buffer_middle, in_offset, out_offset, value, fn_3)); auto fn_4 = [](MacroAssembler* masm, int32_t in_offset, int32_t out_offset) { __ Ulhu(v0, MemOperand(a0, in_offset)); __ Ush(v0, MemOperand(a0, out_offset), t1); }; CHECK_EQ(true, run_Unaligned<uint16_t>(buffer_middle, in_offset, out_offset, value, fn_4)); } } } } TEST(Ulh_bitextension) { CcTest::InitializeVM(); static const int kBufferSize = 300 * KB; char memory_buffer[kBufferSize]; char* buffer_middle = memory_buffer + (kBufferSize / 2); FOR_UINT64_INPUTS(i, unsigned_test_values) { FOR_INT32_INPUTS2(j1, j2, unsigned_test_offset) { FOR_INT32_INPUTS2(k1, k2, unsigned_test_offset_increment) { uint16_t value = static_cast<uint64_t>(*i & 0xFFFF); int32_t in_offset = *j1 + *k1; int32_t out_offset = *j2 + *k2; auto fn = [](MacroAssembler* masm, int32_t in_offset, int32_t out_offset) { Label success, fail, end, different; __ Ulh(t0, MemOperand(a0, in_offset)); __ Ulhu(t1, MemOperand(a0, in_offset)); __ Branch(&different, ne, t0, Operand(t1)); // If signed and unsigned values are same, check // the upper bits to see if they are zero __ sra(t0, t0, 15); __ Branch(&success, eq, t0, Operand(zero_reg)); __ Branch(&fail); // If signed and unsigned values are different, // check that the upper bits are complementary __ bind(&different); __ sra(t1, t1, 15); __ Branch(&fail, ne, t1, Operand(1)); __ sra(t0, t0, 15); __ addiu(t0, t0, 1); __ Branch(&fail, ne, t0, Operand(zero_reg)); // Fall through to success __ bind(&success); __ Ulh(t0, MemOperand(a0, in_offset)); __ Ush(t0, MemOperand(a0, out_offset), v0); __ Branch(&end); __ bind(&fail); __ Ush(zero_reg, MemOperand(a0, out_offset), v0); __ bind(&end); }; CHECK_EQ(true, run_Unaligned<uint16_t>(buffer_middle, in_offset, out_offset, value, fn)); } } } } TEST(Ulw) { CcTest::InitializeVM(); static const int kBufferSize = 300 * KB; char memory_buffer[kBufferSize]; char* buffer_middle = memory_buffer + (kBufferSize / 2); FOR_UINT64_INPUTS(i, unsigned_test_values) { FOR_INT32_INPUTS2(j1, j2, unsigned_test_offset) { FOR_INT32_INPUTS2(k1, k2, unsigned_test_offset_increment) { uint32_t value = static_cast<uint32_t>(*i & 0xFFFFFFFF); int32_t in_offset = *j1 + *k1; int32_t out_offset = *j2 + *k2; auto fn_1 = [](MacroAssembler* masm, int32_t in_offset, int32_t out_offset) { __ Ulw(v0, MemOperand(a0, in_offset)); __ Usw(v0, MemOperand(a0, out_offset)); }; CHECK_EQ(true, run_Unaligned<uint32_t>(buffer_middle, in_offset, out_offset, value, fn_1)); auto fn_2 = [](MacroAssembler* masm, int32_t in_offset, int32_t out_offset) { __ mov(t0, a0); __ Ulw(a0, MemOperand(a0, in_offset)); __ Usw(a0, MemOperand(t0, out_offset)); }; CHECK_EQ(true, run_Unaligned<uint32_t>(buffer_middle, in_offset, out_offset, (uint32_t)value, fn_2)); } } } } TEST(Ulwc1) { CcTest::InitializeVM(); static const int kBufferSize = 300 * KB; char memory_buffer[kBufferSize]; char* buffer_middle = memory_buffer + (kBufferSize / 2); FOR_UINT64_INPUTS(i, unsigned_test_values) { FOR_INT32_INPUTS2(j1, j2, unsigned_test_offset) { FOR_INT32_INPUTS2(k1, k2, unsigned_test_offset_increment) { float value = static_cast<float>(*i & 0xFFFFFFFF); int32_t in_offset = *j1 + *k1; int32_t out_offset = *j2 + *k2; auto fn = [](MacroAssembler* masm, int32_t in_offset, int32_t out_offset) { __ Ulwc1(f0, MemOperand(a0, in_offset), t0); __ Uswc1(f0, MemOperand(a0, out_offset), t0); }; CHECK_EQ(true, run_Unaligned<float>(buffer_middle, in_offset, out_offset, value, fn)); } } } } TEST(Uldc1) { CcTest::InitializeVM(); static const int kBufferSize = 300 * KB; char memory_buffer[kBufferSize]; char* buffer_middle = memory_buffer + (kBufferSize / 2); FOR_UINT64_INPUTS(i, unsigned_test_values) { FOR_INT32_INPUTS2(j1, j2, unsigned_test_offset) { FOR_INT32_INPUTS2(k1, k2, unsigned_test_offset_increment) { double value = static_cast<double>(*i); int32_t in_offset = *j1 + *k1; int32_t out_offset = *j2 + *k2; auto fn = [](MacroAssembler* masm, int32_t in_offset, int32_t out_offset) { __ Uldc1(f0, MemOperand(a0, in_offset), t0); __ Usdc1(f0, MemOperand(a0, out_offset), t0); }; CHECK_EQ(true, run_Unaligned<double>(buffer_middle, in_offset, out_offset, value, fn)); } } } } static const std::vector<uint32_t> sltu_test_values() { static const uint32_t kValues[] = { 0, 1, 0x7ffe, 0x7fff, 0x8000, 0x8001, 0xfffe, 0xffff, 0xffff7ffe, 0xffff7fff, 0xffff8000, 0xffff8001, 0xfffffffe, 0xffffffff, }; return std::vector<uint32_t>(&kValues[0], &kValues[arraysize(kValues)]); } template <typename Func> bool run_Sltu(uint32_t rs, uint32_t rd, Func GenerateSltuInstructionFunc) { typedef int32_t (*F_CVT)(uint32_t x0, uint32_t x1, int x2, int x3, int x4); Isolate* isolate = CcTest::i_isolate(); HandleScope scope(isolate); MacroAssembler assm(isolate, nullptr, 0, v8::internal::CodeObjectRequired::kYes); MacroAssembler* masm = &assm; GenerateSltuInstructionFunc(masm, rd); __ jr(ra); __ nop(); CodeDesc desc; assm.GetCode(isolate, &desc); Handle<Code> code = isolate->factory()->NewCode( desc, Code::ComputeFlags(Code::STUB), Handle<Code>()); F_CVT f = FUNCTION_CAST<F_CVT>(code->entry()); int32_t res = reinterpret_cast<int32_t>( CALL_GENERATED_CODE(isolate, f, rs, rd, 0, 0, 0)); return res == 1; } TEST(Sltu) { CcTest::InitializeVM(); FOR_UINT32_INPUTS(i, sltu_test_values) { FOR_UINT32_INPUTS(j, sltu_test_values) { uint32_t rs = *i; uint32_t rd = *j; auto fn_1 = [](MacroAssembler* masm, uint32_t imm) { __ Sltu(v0, a0, Operand(imm)); }; CHECK_EQ(rs < rd, run_Sltu(rs, rd, fn_1)); auto fn_2 = [](MacroAssembler* masm, uint32_t imm) { __ Sltu(v0, a0, a1); }; CHECK_EQ(rs < rd, run_Sltu(rs, rd, fn_2)); } } } template <typename T, typename Inputs, typename Results> static ::F4 GenerateMacroFloat32MinMax(MacroAssembler* masm) { T a = T::from_code(4); // f4 T b = T::from_code(6); // f6 T c = T::from_code(8); // f8 Label ool_min_abc, ool_min_aab, ool_min_aba; Label ool_max_abc, ool_max_aab, ool_max_aba; Label done_min_abc, done_min_aab, done_min_aba; Label done_max_abc, done_max_aab, done_max_aba; #define FLOAT_MIN_MAX(fminmax, res, x, y, done, ool, res_field) \ __ lwc1(x, MemOperand(a0, offsetof(Inputs, src1_))); \ __ lwc1(y, MemOperand(a0, offsetof(Inputs, src2_))); \ __ fminmax(res, x, y, &ool); \ __ bind(&done); \ __ swc1(a, MemOperand(a1, offsetof(Results, res_field))) // a = min(b, c); FLOAT_MIN_MAX(Float32Min, a, b, c, done_min_abc, ool_min_abc, min_abc_); // a = min(a, b); FLOAT_MIN_MAX(Float32Min, a, a, b, done_min_aab, ool_min_aab, min_aab_); // a = min(b, a); FLOAT_MIN_MAX(Float32Min, a, b, a, done_min_aba, ool_min_aba, min_aba_); // a = max(b, c); FLOAT_MIN_MAX(Float32Max, a, b, c, done_max_abc, ool_max_abc, max_abc_); // a = max(a, b); FLOAT_MIN_MAX(Float32Max, a, a, b, done_max_aab, ool_max_aab, max_aab_); // a = max(b, a); FLOAT_MIN_MAX(Float32Max, a, b, a, done_max_aba, ool_max_aba, max_aba_); #undef FLOAT_MIN_MAX __ jr(ra); __ nop(); // Generate out-of-line cases. __ bind(&ool_min_abc); __ Float32MinOutOfLine(a, b, c); __ Branch(&done_min_abc); __ bind(&ool_min_aab); __ Float32MinOutOfLine(a, a, b); __ Branch(&done_min_aab); __ bind(&ool_min_aba); __ Float32MinOutOfLine(a, b, a); __ Branch(&done_min_aba); __ bind(&ool_max_abc); __ Float32MaxOutOfLine(a, b, c); __ Branch(&done_max_abc); __ bind(&ool_max_aab); __ Float32MaxOutOfLine(a, a, b); __ Branch(&done_max_aab); __ bind(&ool_max_aba); __ Float32MaxOutOfLine(a, b, a); __ Branch(&done_max_aba); CodeDesc desc; masm->GetCode(masm->isolate(), &desc); Handle<Code> code = masm->isolate()->factory()->NewCode( desc, Code::ComputeFlags(Code::STUB), Handle<Code>()); #ifdef DEBUG OFStream os(stdout); code->Print(os); #endif return FUNCTION_CAST<::F4>(code->entry()); } TEST(macro_float_minmax_f32) { // Test the Float32Min and Float32Max macros. CcTest::InitializeVM(); Isolate* isolate = CcTest::i_isolate(); HandleScope scope(isolate); MacroAssembler assembler(isolate, NULL, 0, v8::internal::CodeObjectRequired::kYes); MacroAssembler* masm = &assembler; struct Inputs { float src1_; float src2_; }; struct Results { // Check all register aliasing possibilities in order to exercise all // code-paths in the macro assembler. float min_abc_; float min_aab_; float min_aba_; float max_abc_; float max_aab_; float max_aba_; }; ::F4 f = GenerateMacroFloat32MinMax<FPURegister, Inputs, Results>(masm); Object* dummy = nullptr; USE(dummy); #define CHECK_MINMAX(src1, src2, min, max) \ do { \ Inputs inputs = {src1, src2}; \ Results results; \ dummy = CALL_GENERATED_CODE(isolate, f, &inputs, &results, 0, 0, 0); \ CHECK_EQ(bit_cast<uint32_t>(min), bit_cast<uint32_t>(results.min_abc_)); \ CHECK_EQ(bit_cast<uint32_t>(min), bit_cast<uint32_t>(results.min_aab_)); \ CHECK_EQ(bit_cast<uint32_t>(min), bit_cast<uint32_t>(results.min_aba_)); \ CHECK_EQ(bit_cast<uint32_t>(max), bit_cast<uint32_t>(results.max_abc_)); \ CHECK_EQ(bit_cast<uint32_t>(max), bit_cast<uint32_t>(results.max_aab_)); \ CHECK_EQ(bit_cast<uint32_t>(max), bit_cast<uint32_t>(results.max_aba_)); \ /* Use a bit_cast to correctly identify -0.0 and NaNs. */ \ } while (0) float nan_a = std::numeric_limits<float>::quiet_NaN(); float nan_b = std::numeric_limits<float>::quiet_NaN(); CHECK_MINMAX(1.0f, -1.0f, -1.0f, 1.0f); CHECK_MINMAX(-1.0f, 1.0f, -1.0f, 1.0f); CHECK_MINMAX(0.0f, -1.0f, -1.0f, 0.0f); CHECK_MINMAX(-1.0f, 0.0f, -1.0f, 0.0f); CHECK_MINMAX(-0.0f, -1.0f, -1.0f, -0.0f); CHECK_MINMAX(-1.0f, -0.0f, -1.0f, -0.0f); CHECK_MINMAX(0.0f, 1.0f, 0.0f, 1.0f); CHECK_MINMAX(1.0f, 0.0f, 0.0f, 1.0f); CHECK_MINMAX(0.0f, 0.0f, 0.0f, 0.0f); CHECK_MINMAX(-0.0f, -0.0f, -0.0f, -0.0f); CHECK_MINMAX(-0.0f, 0.0f, -0.0f, 0.0f); CHECK_MINMAX(0.0f, -0.0f, -0.0f, 0.0f); CHECK_MINMAX(0.0f, nan_a, nan_a, nan_a); CHECK_MINMAX(nan_a, 0.0f, nan_a, nan_a); CHECK_MINMAX(nan_a, nan_b, nan_a, nan_a); CHECK_MINMAX(nan_b, nan_a, nan_b, nan_b); #undef CHECK_MINMAX } template <typename T, typename Inputs, typename Results> static ::F4 GenerateMacroFloat64MinMax(MacroAssembler* masm) { T a = T::from_code(4); // f4 T b = T::from_code(6); // f6 T c = T::from_code(8); // f8 Label ool_min_abc, ool_min_aab, ool_min_aba; Label ool_max_abc, ool_max_aab, ool_max_aba; Label done_min_abc, done_min_aab, done_min_aba; Label done_max_abc, done_max_aab, done_max_aba; #define FLOAT_MIN_MAX(fminmax, res, x, y, done, ool, res_field) \ __ Ldc1(x, MemOperand(a0, offsetof(Inputs, src1_))); \ __ Ldc1(y, MemOperand(a0, offsetof(Inputs, src2_))); \ __ fminmax(res, x, y, &ool); \ __ bind(&done); \ __ Sdc1(a, MemOperand(a1, offsetof(Results, res_field))) // a = min(b, c); FLOAT_MIN_MAX(Float64Min, a, b, c, done_min_abc, ool_min_abc, min_abc_); // a = min(a, b); FLOAT_MIN_MAX(Float64Min, a, a, b, done_min_aab, ool_min_aab, min_aab_); // a = min(b, a); FLOAT_MIN_MAX(Float64Min, a, b, a, done_min_aba, ool_min_aba, min_aba_); // a = max(b, c); FLOAT_MIN_MAX(Float64Max, a, b, c, done_max_abc, ool_max_abc, max_abc_); // a = max(a, b); FLOAT_MIN_MAX(Float64Max, a, a, b, done_max_aab, ool_max_aab, max_aab_); // a = max(b, a); FLOAT_MIN_MAX(Float64Max, a, b, a, done_max_aba, ool_max_aba, max_aba_); #undef FLOAT_MIN_MAX __ jr(ra); __ nop(); // Generate out-of-line cases. __ bind(&ool_min_abc); __ Float64MinOutOfLine(a, b, c); __ Branch(&done_min_abc); __ bind(&ool_min_aab); __ Float64MinOutOfLine(a, a, b); __ Branch(&done_min_aab); __ bind(&ool_min_aba); __ Float64MinOutOfLine(a, b, a); __ Branch(&done_min_aba); __ bind(&ool_max_abc); __ Float64MaxOutOfLine(a, b, c); __ Branch(&done_max_abc); __ bind(&ool_max_aab); __ Float64MaxOutOfLine(a, a, b); __ Branch(&done_max_aab); __ bind(&ool_max_aba); __ Float64MaxOutOfLine(a, b, a); __ Branch(&done_max_aba); CodeDesc desc; masm->GetCode(masm->isolate(), &desc); Handle<Code> code = masm->isolate()->factory()->NewCode( desc, Code::ComputeFlags(Code::STUB), Handle<Code>()); #ifdef DEBUG OFStream os(stdout); code->Print(os); #endif return FUNCTION_CAST<::F4>(code->entry()); } TEST(macro_float_minmax_f64) { // Test the Float64Min and Float64Max macros. CcTest::InitializeVM(); Isolate* isolate = CcTest::i_isolate(); HandleScope scope(isolate); MacroAssembler assembler(isolate, NULL, 0, v8::internal::CodeObjectRequired::kYes); MacroAssembler* masm = &assembler; struct Inputs { double src1_; double src2_; }; struct Results { // Check all register aliasing possibilities in order to exercise all // code-paths in the macro assembler. double min_abc_; double min_aab_; double min_aba_; double max_abc_; double max_aab_; double max_aba_; }; ::F4 f = GenerateMacroFloat64MinMax<DoubleRegister, Inputs, Results>(masm); Object* dummy = nullptr; USE(dummy); #define CHECK_MINMAX(src1, src2, min, max) \ do { \ Inputs inputs = {src1, src2}; \ Results results; \ dummy = CALL_GENERATED_CODE(isolate, f, &inputs, &results, 0, 0, 0); \ CHECK_EQ(bit_cast<uint64_t>(min), bit_cast<uint64_t>(results.min_abc_)); \ CHECK_EQ(bit_cast<uint64_t>(min), bit_cast<uint64_t>(results.min_aab_)); \ CHECK_EQ(bit_cast<uint64_t>(min), bit_cast<uint64_t>(results.min_aba_)); \ CHECK_EQ(bit_cast<uint64_t>(max), bit_cast<uint64_t>(results.max_abc_)); \ CHECK_EQ(bit_cast<uint64_t>(max), bit_cast<uint64_t>(results.max_aab_)); \ CHECK_EQ(bit_cast<uint64_t>(max), bit_cast<uint64_t>(results.max_aba_)); \ /* Use a bit_cast to correctly identify -0.0 and NaNs. */ \ } while (0) double nan_a = std::numeric_limits<double>::quiet_NaN(); double nan_b = std::numeric_limits<double>::quiet_NaN(); CHECK_MINMAX(1.0, -1.0, -1.0, 1.0); CHECK_MINMAX(-1.0, 1.0, -1.0, 1.0); CHECK_MINMAX(0.0, -1.0, -1.0, 0.0); CHECK_MINMAX(-1.0, 0.0, -1.0, 0.0); CHECK_MINMAX(-0.0, -1.0, -1.0, -0.0); CHECK_MINMAX(-1.0, -0.0, -1.0, -0.0); CHECK_MINMAX(0.0, 1.0, 0.0, 1.0); CHECK_MINMAX(1.0, 0.0, 0.0, 1.0); CHECK_MINMAX(0.0, 0.0, 0.0, 0.0); CHECK_MINMAX(-0.0, -0.0, -0.0, -0.0); CHECK_MINMAX(-0.0, 0.0, -0.0, 0.0); CHECK_MINMAX(0.0, -0.0, -0.0, 0.0); CHECK_MINMAX(0.0, nan_a, nan_a, nan_a); CHECK_MINMAX(nan_a, 0.0, nan_a, nan_a); CHECK_MINMAX(nan_a, nan_b, nan_a, nan_a); CHECK_MINMAX(nan_b, nan_a, nan_b, nan_b); #undef CHECK_MINMAX } #undef __

[ "guenter.obiltschnig@appinf.com" ]

guenter.obiltschnig@appinf.com

53cc9380c5a2ab04cd70a1ce7b13d37fa565cfa3

1f950ec13cc94459bea3f4f2903e688d123d4812

/Brother_Task_Shader/main.cpp

baaf106b71856aef8711eb1ed1bf610929603070

[]

no_license

katsuto-kawauchi/brother_task

b53a101257e331a0a61166fc377ca68fb0c5c74f

8417417c8e75f0599983e1651943fb323824e822

refs/heads/master

2020-04-03T15:08:58.802944

2018-10-30T08:29:11

155,352,373

0

null

SHIFT_JIS

C++

false

21,893

cpp

#pragma comment(lib,"d3d11.lib") #pragma comment(lib,"d3dx11.lib") #pragma comment(lib,"d3dx10.lib") #pragma comment(lib,"d3dCompiler.lib") #pragma comment(lib, "dinput8.lib") #pragma comment(lib, "dxguid.lib") #include <stdio.h> #include <vector> #include <d3dx11.h> #include <d3dx10.h> #include <DirectXMath.h> #include <d3dCompiler.h> #include <dinput.h> #include <Windows.h> #include "MoveCamera.h" #define FILE_NAME "sword.obj" using namespace std; using namespace DirectX; //安全に解放する #define SAFE_RELEASE(x) if(x){x->Release(); x=NULL;} //定数定義 #define WINDOW_WIDTH 1280 //ウィンドウ幅 #define WINDOW_HEIGHT 720 //ウィンドウ高さ #define DIRECTINPUT_VERSION 0x0800 //グローバル変数 HWND hWnd = NULL; HWND ActiveWnd = NULL; ID3D11Device* Device = NULL; //デバイス ID3D11DeviceContext* DeviceContext = NULL; //デバイスコンテキスト IDXGISwapChain* SwapChain = NULL; //スワップチェイン ID3D11RenderTargetView* RenderTargetView = NULL; //レンダーターゲットビュー ID3D11DepthStencilView* DepthStencilView = NULL; ID3D11Texture2D* DepthStencil = NULL; ID3D11InputLayout* VertexLayout = NULL; ID3D11VertexShader* VertexShader = NULL;//頂点シェーダー ID3D11PixelShader* PixelShader = NULL;//ピクセルシェーダー ID3D11Buffer* ConstantBuffer[2];//コンスタントバッファ D3DXVECTOR3 LightDir(1, 1, -1);//ライト方向 D3DXVECTOR3 CameraEye(0.0, 0.0, -200.0);//カメラ視点 D3DXVECTOR3 CameraAt(0.0, 0.0, 0.0);//カメラ注視点 D3DXVECTOR2 CameraRad(XM_PI / 2, XM_PI / 2);//カメラアングル ID3D11SamplerState* SampleLinear = NULL;//テクスチャーのサンプラー ID3D11ShaderResourceView* Texture = NULL;//テクスチャー LPDIRECTINPUT8 g_pDInput = NULL; // DirectInputオブジェクト LPDIRECTINPUTDEVICE8 g_pDIMouse = NULL; // マウスデバイス DIMOUSESTATE g_zdiMouseState; //シェーダーに渡す値 struct SHADER_GLOBAL0 { D3DXMATRIX mW;//ワールド行列 D3DXMATRIX mWVP;//ワールドから射影までの変換行列 D3DXVECTOR4 vLightDir;//ライト方向 D3DXVECTOR4 vEye;//カメラ位置 }; struct SHADER_GLOBAL1 { D3DXVECTOR4 vAmbient;//アンビエント D3DXVECTOR4 vDiffuse;//ディフューズ D3DXVECTOR4 vSpecular;//鏡面反射 }; //マテリアル構造体 struct MATERIAL { CHAR Name[255]; D3DXVECTOR4 Ka;//アンビエント D3DXVECTOR4 Kd;//ディフューズ D3DXVECTOR4 Ks;//スペキュラー CHAR TextureName[255];//テクスチャファイル名 ID3D11ShaderResourceView* pTexture;//テクスチャデータ DWORD MaxFace;//ポリゴン数 }mat; //頂点構造体 struct VERTEX { D3DXVECTOR3 Pos;//位置 D3DXVECTOR3 Normal;//法線 D3DXVECTOR2 UV;//UV }vert; //.OBJファイルクラス class OBJ { protected: vector <MATERIAL> Material;//マテリアル vector <VERTEX> Vertex;//頂点構造体 ID3D11Buffer* VertexBuffer;//頂点バッファ ID3D11Buffer** IndexBuffer;//インデックスバッファ HRESULT LoadMaterialFromFile(LPSTR FileName);//マテリアルファイル読み込み public: void Draw();//描画 HRESULT Load(LPSTR FileName);//読み込み }; OBJ obj; //メッシュの描画 void OBJ::Draw() { //バーテックスバッファをセット UINT stride = sizeof(VERTEX); UINT offset = 0; DeviceContext->IASetVertexBuffers(0, 1, &VertexBuffer, &stride, &offset); //マテリアルの数だけ、それぞれのマテリアルのインデックスバッファを描画 for (DWORD i = 0; i < Material.size(); i++) { //使用されていないマテリアル対策 if (Material[i].MaxFace == 0) { continue; } //インデックスバッファをセット DeviceContext->IASetIndexBuffer(IndexBuffer[i], DXGI_FORMAT_R32_UINT, 0); //プリミティブ・トポロジーをセット DeviceContext->IASetPrimitiveTopology(D3D11_PRIMITIVE_TOPOLOGY_TRIANGLELIST); //マテリアルの各要素をシェーダーに渡す D3D11_MAPPED_SUBRESOURCE pData; if (SUCCEEDED(DeviceContext->Map(ConstantBuffer[1], 0, D3D11_MAP_WRITE_DISCARD, 0, &pData))) { SHADER_GLOBAL1 sg; sg.vAmbient = Material[i].Ka; sg.vDiffuse = Material[i].Kd; sg.vSpecular = Material[i].Ks; memcpy_s(pData.pData, pData.RowPitch, (void*)&sg, sizeof(SHADER_GLOBAL1)); DeviceContext->Unmap(ConstantBuffer[1], 0); } DeviceContext->VSSetConstantBuffers(1, 1, &ConstantBuffer[1]); DeviceContext->PSSetConstantBuffers(1, 1, &ConstantBuffer[1]); //テクスチャをシェーダーに渡す if (Material[i].TextureName[0] != NULL) { DeviceContext->PSSetSamplers(0, 1, &SampleLinear); DeviceContext->PSSetShaderResources(0, 1, &Material[i].pTexture); } DeviceContext->DrawIndexed(Material[i].MaxFace * 3, 0, 0); } } //マテリアルファイルを読み込む関数 HRESULT OBJ::LoadMaterialFromFile(LPSTR FileName) { FILE* fp = NULL; fopen_s(&fp, FileName, "rt"); char key[255] = { 0 }; bool flag = false; D3DXVECTOR4 v(0, 0, 0, 0); fseek(fp, SEEK_SET, 0); while (!feof(fp)) { //キーワード読み込み fscanf_s(fp, "%s ", key, sizeof(key)); //マテリアル名 if (strcmp(key, "newmtl") == 0) { if (flag)Material.push_back(mat); flag = true; fscanf_s(fp, "%s ", key, sizeof(key)); strcpy_s(mat.Name, key); } //Ka　アンビエント if (strcmp(key, "Ka") == 0) { fscanf_s(fp, "%f %f %f", &v.x, &v.y, &v.z); mat.Ka = v; } //Kd　ディフューズ if (strcmp(key, "Kd") == 0) { fscanf_s(fp, "%f %f %f", &v.x, &v.y, &v.z); mat.Kd = v; } //Ks　スペキュラー if (strcmp(key, "Ks") == 0) { fscanf_s(fp, "%f %f %f", &v.x, &v.y, &v.z); mat.Ks = v; } //map_Kd　テクスチャ if (strcmp(key, "map_Kd") == 0) { fscanf_s(fp, "%s", &mat.TextureName, sizeof(mat.TextureName)); //テクスチャを作成 if (FAILED(D3DX11CreateShaderResourceViewFromFileA(Device, mat.TextureName, NULL, NULL, &mat.pTexture, NULL))) { return E_FAIL; } } } fclose(fp); if (flag)Material.push_back(mat); return S_OK; } //OBJファイルからメッシュに必要な情報を読み込む HRESULT OBJ::Load(LPSTR FileName) { //一時代入用 D3DXVECTOR3 vec3d; D3DXVECTOR2 vec2d; vector <D3DXVECTOR3> Pos; vector <D3DXVECTOR3> Normal; vector <D3DXVECTOR2> UV; vector <int> FaceIndex; int v1 = 0, v2 = 0, v3 = 0; int vn1 = 0, vn2 = 0, vn3 = 0; int vt1 = 0, vt2 = 0, vt3 = 0; DWORD dwFCount = 0;//読み込みカウンタ char key[255] = { 0 }; //OBJファイルを開いて内容を読み込む FILE* fp = NULL; fopen_s(&fp, FileName, "rt"); //読み込み fseek(fp, SEEK_SET, 0); while (!feof(fp)) { //キーワード ZeroMemory(key, sizeof(key)); fscanf_s(fp, "%s ", key, sizeof(key)); //マテリアル if (strcmp(key, "mtllib") == 0) { fscanf_s(fp, "%s ", key, sizeof(key)); LoadMaterialFromFile(key); } //頂点 if (strcmp(key, "v") == 0) { fscanf_s(fp, "%f %f %f", &vec3d.x, &vec3d.y, &vec3d.z); Pos.push_back(vec3d); Vertex.push_back(vert); } //法線 if (strcmp(key, "vn") == 0) { fscanf_s(fp, "%f %f %f", &vec3d.x, &vec3d.y, &vec3d.z); Normal.push_back(vec3d); } //テクスチャ if (strcmp(key, "vt") == 0) { fscanf_s(fp, "%f %f", &vec2d.x, &vec2d.y); UV.push_back(-vec2d); } //フェイス if (strcmp(key, "f") == 0) { FaceIndex.push_back(0); FaceIndex.push_back(0); FaceIndex.push_back(0); } } //マテリアルの数だけインデックスバッファを作成 IndexBuffer = new ID3D11Buffer*[Material.size()]; bool boFlag = false; for (DWORD i = 0; i < Material.size(); i++) { fseek(fp, SEEK_SET, 0); dwFCount = 0; while (!feof(fp)) { //キーワード ZeroMemory(key, sizeof(key)); fscanf_s(fp, "%s ", key, sizeof(key)); //フェイス読み込み→頂点インデックスに if (strcmp(key, "usemtl") == 0) { fscanf_s(fp, "%s ", key, sizeof(key)); if (strcmp(key, Material[i].Name) == 0) { boFlag = true; } else { boFlag = false; } } if (strcmp(key, "f") == 0 && boFlag == true) { fscanf_s(fp, "%d/%d/%d %d/%d/%d %d/%d/%d", &v1, &vt1, &vn1, &v2, &vt2, &vn2, &v3, &vt3, &vn3); //if (Material[i].pTexture != NULL)//テクスチャーありサーフェイス //{ // fscanf_s(fp, "%d/%d/%d %d/%d/%d %d/%d/%d", &v1, &vt1, &vn1, &v2, &vt2, &vn2, &v3, &vt3, &vn3); //} //else//テクスチャー無しサーフェイス //{ // fscanf_s(fp, "%d//%d %d//%d %d//%d", &v1, &vn1, &v2, &vn2, &v3, &vn3); //} FaceIndex[dwFCount * 3] = v1 - 1; FaceIndex[dwFCount * 3 + 1] = v2 - 1; FaceIndex[dwFCount * 3 + 2] = v3 - 1; dwFCount++; //頂点構造体に代入 Vertex[v1 - 1].Pos = Pos[v1 - 1]; Vertex[v1 - 1].Normal = Normal[vn1 - 1]; Vertex[v1 - 1].UV = UV[vt1 - 1]; Vertex[v2 - 1].Pos = Pos[v2 - 1]; Vertex[v2 - 1].Normal = Normal[vn2 - 1]; Vertex[v2 - 1].UV = UV[vt2 - 1]; Vertex[v3 - 1].Pos = Pos[v3 - 1]; Vertex[v3 - 1].Normal = Normal[vn3 - 1]; Vertex[v3 - 1].UV = UV[vt3 - 1]; } } if (dwFCount == 0)//使用されていないマテリアル対策 { IndexBuffer[i] = NULL; continue; } //インデックスバッファを作成 D3D11_BUFFER_DESC bd; bd.Usage = D3D11_USAGE_DEFAULT; bd.ByteWidth = sizeof(int) * dwFCount * 3; bd.BindFlags = D3D11_BIND_INDEX_BUFFER; bd.CPUAccessFlags = 0; bd.MiscFlags = 0; D3D11_SUBRESOURCE_DATA InitData; InitData.pSysMem = &FaceIndex[0]; InitData.SysMemPitch = 0; InitData.SysMemSlicePitch = 0; if (FAILED(Device->CreateBuffer(&bd, &InitData, &IndexBuffer[i])))return FALSE; Material[i].MaxFace = dwFCount; } FaceIndex.clear(); fclose(fp); //バーテックスバッファを作成 D3D11_BUFFER_DESC bd; bd.Usage = D3D11_USAGE_DEFAULT; bd.ByteWidth = sizeof(VERTEX) *Vertex.size(); bd.BindFlags = D3D11_BIND_VERTEX_BUFFER; bd.CPUAccessFlags = 0; bd.MiscFlags = 0; D3D11_SUBRESOURCE_DATA InitData; InitData.pSysMem = &Vertex[0]; if (FAILED(Device->CreateBuffer(&bd, &InitData, &VertexBuffer)))return FALSE; Pos.clear(); Normal.clear(); UV.clear(); Vertex.clear(); return S_OK; } //Direct3Dの初期化関数 HRESULT InitD3D(HWND hWnd) { // デバイスとスワップチェーンの作成 DXGI_SWAP_CHAIN_DESC sd; ZeroMemory(&sd, sizeof(sd)); sd.BufferCount = 1; //バックバッファの数 sd.BufferDesc.Width = WINDOW_WIDTH; //バッファの幅 sd.BufferDesc.Height = WINDOW_HEIGHT; //バッファの高さ sd.BufferDesc.Format = DXGI_FORMAT_R8G8B8A8_UNORM; //バッファのフォーマット sd.BufferDesc.RefreshRate.Numerator = 60; //リフレッシュレート sd.BufferDesc.RefreshRate.Denominator = 1; sd.BufferUsage = DXGI_USAGE_RENDER_TARGET_OUTPUT; sd.OutputWindow = hWnd; sd.SampleDesc.Count = 1; sd.SampleDesc.Quality = 0; sd.Windowed = TRUE; D3D_FEATURE_LEVEL FeatureLevel = D3D_FEATURE_LEVEL_11_0; D3D_FEATURE_LEVEL* pFeatureLevel = NULL; if (FAILED(D3D11CreateDeviceAndSwapChain(NULL, D3D_DRIVER_TYPE_HARDWARE, NULL, 0, &FeatureLevel, 1, D3D11_SDK_VERSION, &sd, &SwapChain, &Device, NULL, &DeviceContext))) { return FALSE; } //レンダーターゲットビューの作成 ID3D11Texture2D *BackBuffer; SwapChain->GetBuffer(0, __uuidof(ID3D11Texture2D), (LPVOID*)&BackBuffer); Device->CreateRenderTargetView(BackBuffer, NULL, &RenderTargetView); SAFE_RELEASE(BackBuffer); //深度ステンシルビューの作成 D3D11_TEXTURE2D_DESC descDepth; descDepth.Width = WINDOW_WIDTH; descDepth.Height = WINDOW_HEIGHT; descDepth.MipLevels = 1; descDepth.ArraySize = 1; descDepth.Format = DXGI_FORMAT_D32_FLOAT; descDepth.SampleDesc.Count = 1; descDepth.SampleDesc.Quality = 0; descDepth.Usage = D3D11_USAGE_DEFAULT; descDepth.BindFlags = D3D11_BIND_DEPTH_STENCIL; descDepth.CPUAccessFlags = 0; descDepth.MiscFlags = 0; Device->CreateTexture2D(&descDepth, NULL, &DepthStencil); Device->CreateDepthStencilView(DepthStencil, NULL, &DepthStencilView); //レンダーターゲットビューと深度ステンシルビューをパイプラインにバインド DeviceContext->OMSetRenderTargets(1, &RenderTargetView, DepthStencilView); //ビューポートの設定 D3D11_VIEWPORT vp; vp.Width = WINDOW_WIDTH; vp.Height = WINDOW_HEIGHT; vp.MinDepth = 0.0f; vp.MaxDepth = 1.0f; vp.TopLeftX = 0; vp.TopLeftY = 0; DeviceContext->RSSetViewports(1, &vp); //hlslファイル読み込み ID3DBlob *pCompiledShader = NULL; ID3DBlob *pErrors = NULL; //ブロブから頂点シェーダー作成 if (FAILED(D3DX11CompileFromFile("shader.hlsl", NULL, NULL, "VS", "vs_5_0", 0, 0, NULL, &pCompiledShader, &pErrors, NULL))) { MessageBox(0, "頂点シェーダー読み込み失敗", NULL, MB_OK); return E_FAIL; } SAFE_RELEASE(pErrors); if (FAILED(Device->CreateVertexShader(pCompiledShader->GetBufferPointer(), pCompiledShader->GetBufferSize(), NULL, &VertexShader))) { SAFE_RELEASE(pCompiledShader); MessageBox(0, "頂点シェーダー作成失敗", NULL, MB_OK); return E_FAIL; } //頂点インプットレイアウトを定義 D3D11_INPUT_ELEMENT_DESC layout[] = { { "POSITION", 0, DXGI_FORMAT_R32G32B32_FLOAT, 0, 0, D3D11_INPUT_PER_VERTEX_DATA, 0 }, { "NORMAL", 0, DXGI_FORMAT_R32G32B32_FLOAT, 0, 12, D3D11_INPUT_PER_VERTEX_DATA, 0 }, { "TEXCOORD", 0, DXGI_FORMAT_R32G32_FLOAT, 0, 24, D3D11_INPUT_PER_VERTEX_DATA, 0 }, }; UINT numElements = sizeof(layout) / sizeof(layout[0]); //頂点インプットレイアウトを作成 if (FAILED(Device->CreateInputLayout(layout, numElements, pCompiledShader->GetBufferPointer(), pCompiledShader->GetBufferSize(), &VertexLayout))) return FALSE; //頂点インプットレイアウトをセット DeviceContext->IASetInputLayout(VertexLayout); //ブロブからピクセルシェーダー作成 if (FAILED(D3DX11CompileFromFile("shader.hlsl", NULL, NULL, "PS", "ps_5_0", 0, 0, NULL, &pCompiledShader, &pErrors, NULL))) { MessageBox(0, "ピクセルシェーダー読み込み失敗", NULL, MB_OK); return E_FAIL; } SAFE_RELEASE(pErrors); if (FAILED(Device->CreatePixelShader(pCompiledShader->GetBufferPointer(), pCompiledShader->GetBufferSize(), NULL, &PixelShader))) { SAFE_RELEASE(pCompiledShader); MessageBox(0, "ピクセルシェーダー作成失敗", NULL, MB_OK); return E_FAIL; } SAFE_RELEASE(pCompiledShader); //ラスタライズ設定 D3D11_RASTERIZER_DESC rdc; ZeroMemory(&rdc, sizeof(rdc)); rdc.CullMode = D3D11_CULL_NONE; rdc.FillMode = D3D11_FILL_SOLID; ID3D11RasterizerState* pIr = NULL; Device->CreateRasterizerState(&rdc, &pIr); DeviceContext->RSSetState(pIr); SAFE_RELEASE(pIr); //コンスタントバッファー作成　ここでは変換行列渡し用 D3D11_BUFFER_DESC cb; cb.BindFlags = D3D11_BIND_CONSTANT_BUFFER; cb.ByteWidth = sizeof(SHADER_GLOBAL0); cb.CPUAccessFlags = D3D11_CPU_ACCESS_WRITE; cb.MiscFlags = 0; cb.StructureByteStride = 0; cb.Usage = D3D11_USAGE_DYNAMIC; if (FAILED(Device->CreateBuffer(&cb, NULL, &ConstantBuffer[0]))) { return E_FAIL; } //コンスタントバッファー作成マテリアル渡し用 cb.BindFlags = D3D11_BIND_CONSTANT_BUFFER; cb.ByteWidth = sizeof(SHADER_GLOBAL1); cb.CPUAccessFlags = D3D11_CPU_ACCESS_WRITE; cb.MiscFlags = 0; cb.StructureByteStride = 0; cb.Usage = D3D11_USAGE_DYNAMIC; if (FAILED(Device->CreateBuffer(&cb, NULL, &ConstantBuffer[1]))) { return E_FAIL; } //テクスチャー用サンプラー作成 D3D11_SAMPLER_DESC SamDesc; ZeroMemory(&SamDesc, sizeof(D3D11_SAMPLER_DESC)); SamDesc.Filter = D3D11_FILTER_MIN_MAG_MIP_LINEAR; SamDesc.AddressU = D3D11_TEXTURE_ADDRESS_WRAP; SamDesc.AddressV = D3D11_TEXTURE_ADDRESS_WRAP; SamDesc.AddressW = D3D11_TEXTURE_ADDRESS_WRAP; Device->CreateSamplerState(&SamDesc, &SampleLinear); //OBJファイルからオリジナルメッシュを作成 obj.Load((LPSTR)FILE_NAME); return S_OK; } //レンダリング VOID Render() { //マウスの状態を取得 HRESULT hr = g_pDIMouse->GetDeviceState(sizeof(DIMOUSESTATE), &g_zdiMouseState); float ClearColor[4] = { 0,0,1,1 }; // クリア色作成　RGBAの順 DeviceContext->ClearRenderTargetView(RenderTargetView, ClearColor);//画面クリア DeviceContext->ClearDepthStencilView(DepthStencilView, D3D11_CLEAR_DEPTH, 1.0f, 0);//深度バッファクリア //変換行列作成 D3DXMATRIX mWorld; D3DXMATRIX mView; D3DXMATRIX mProj; //ワールド行列 static float angle = 0; //angle += 0.03f; D3DXMATRIX mRot; D3DXMatrixRotationY(&mRot, (float)D3DXToRadian(angle)); mWorld = mRot; //ビュー行列操作 MoveCamera(&g_zdiMouseState, &CameraAt, &CameraEye, &CameraRad); D3DXVECTOR3 Up(0.0f, 1.0f, 0.0f); D3DXMatrixLookAtLH(&mView, &CameraEye, &CameraAt, &Up); //プロジェクション行列 D3DXMatrixPerspectiveFovLH(&mProj, (float)D3DX_PI / 4, (float)WINDOW_WIDTH / (float)WINDOW_HEIGHT, 0.1f, 1000.0f); //ワールド・ビュー・プロジェクション行列をシェーダーに渡す DeviceContext->VSSetConstantBuffers(0, 1, &ConstantBuffer[0]); D3D11_MAPPED_SUBRESOURCE pData; if (SUCCEEDED(DeviceContext->Map(ConstantBuffer[0], 0, D3D11_MAP_WRITE_DISCARD, 0, &pData))) { SHADER_GLOBAL0 sg; sg.mW = mWorld; D3DXMatrixTranspose(&sg.mW, &sg.mW); sg.mWVP = mWorld * mView*mProj; D3DXMatrixTranspose(&sg.mWVP, &sg.mWVP); sg.vLightDir = D3DXVECTOR4(LightDir.x, LightDir.y, LightDir.z, 0.0f); sg.vEye = D3DXVECTOR4(CameraEye.x, CameraEye.y, CameraEye.z, 0); memcpy_s(pData.pData, pData.RowPitch, (void*)&sg, sizeof(SHADER_GLOBAL0)); DeviceContext->Unmap(ConstantBuffer[0], 0); } DeviceContext->VSSetConstantBuffers(0, 1, &ConstantBuffer[0]); DeviceContext->PSSetConstantBuffers(0, 1, &ConstantBuffer[0]); //使用するシェーダーの登録 DeviceContext->VSSetShader(VertexShader, NULL, 0); DeviceContext->PSSetShader(PixelShader, NULL, 0); //メッシュを描画 obj.Draw(); ShowCursor(true); SwapChain->Present(0, 0);//フリップ } //終了時解放処理 VOID Cleanup() { SAFE_RELEASE(SampleLinear); SAFE_RELEASE(Texture); SAFE_RELEASE(DepthStencil); SAFE_RELEASE(DepthStencilView); SAFE_RELEASE(VertexShader); SAFE_RELEASE(PixelShader); SAFE_RELEASE(ConstantBuffer[0]); SAFE_RELEASE(ConstantBuffer[1]); SAFE_RELEASE(VertexLayout); SAFE_RELEASE(SwapChain); SAFE_RELEASE(RenderTargetView); SAFE_RELEASE(DeviceContext); SAFE_RELEASE(Device); SAFE_RELEASE(g_pDInput); SAFE_RELEASE(g_pDIMouse); } //メッセージプロシージャ LRESULT CALLBACK MsgProc(HWND hWnd, UINT msg, WPARAM wParam, LPARAM lParam) { switch (msg) { case WM_DESTROY://終了時 Cleanup(); PostQuitMessage(0); break; } return DefWindowProc(hWnd, msg, wParam, lParam); } bool InitMouse(HINSTANCE hInst) { //入力関係初期化 HRESULT ret = DirectInput8Create(hInst, DIRECTINPUT_VERSION, IID_IDirectInput8, (void**)&g_pDInput, NULL); if (FAILED(ret)) { return false; // 作成に失敗 } if (g_pDInput == NULL) { return false; } // マウス用にデバイスオブジェクトを作成 ret = g_pDInput->CreateDevice(GUID_SysMouse, &g_pDIMouse, NULL); if (FAILED(ret)) { // デバイスの作成に失敗 return false; } // データフォーマットを設定 ret = g_pDIMouse->SetDataFormat(&c_dfDIMouse); // マウス用のデータ・フォーマットを設定 if (FAILED(ret)) { // データフォーマットに失敗 return false; } // モードを設定（フォアグラウンド＆非排他モード） ret = g_pDIMouse->SetCooperativeLevel(hWnd, DISCL_NONEXCLUSIVE | DISCL_FOREGROUND); if (FAILED(ret)) { // モードの設定に失敗 return false; } // デバイスの設定 DIPROPDWORD diprop; diprop.diph.dwSize = sizeof(diprop); diprop.diph.dwHeaderSize = sizeof(diprop.diph); diprop.diph.dwObj = 0; diprop.diph.dwHow = DIPH_DEVICE; diprop.dwData = DIPROPAXISMODE_REL; // 相対値モードで設定（絶対値はDIPROPAXISMODE_ABS） ret = g_pDIMouse->SetProperty(DIPROP_AXISMODE, &diprop.diph); if (FAILED(ret)) { // デバイスの設定に失敗 return false; } // 入力制御開始 g_pDIMouse->Acquire(); return true; } //メイン関数 INT WINAPI WinMain(HINSTANCE hInst, HINSTANCE hPrevInst, LPSTR szStr, INT iCmdShow) { //ウインドウクラスの登録 WNDCLASSEX wc = { sizeof(WNDCLASSEX), CS_CLASSDC, MsgProc, 0L, 0L, GetModuleHandle(NULL), NULL, NULL, NULL, NULL, "Window1", NULL }; RegisterClassEx(&wc); //タイトルバーとウインドウ枠の分を含めてウインドウサイズを設定 RECT rect; SetRect(&rect, 0, 0, WINDOW_WIDTH, WINDOW_HEIGHT); AdjustWindowRect(&rect, WS_OVERLAPPEDWINDOW, FALSE); rect.right = rect.right - rect.left; rect.bottom = rect.bottom - rect.top; rect.top = 0; rect.left = 0; //ウインドウの生成 hWnd = CreateWindow("Window1", "OBJローダ", WS_OVERLAPPEDWINDOW, CW_USEDEFAULT, CW_USEDEFAULT, rect.right, rect.bottom, NULL, NULL, wc.hInstance, NULL); MSG msg; ZeroMemory(&msg, sizeof(msg)); //Direct3D初期化 if (!SUCCEEDED(InitD3D(hWnd))) { return false; } //ウインドウ表示 ShowWindow(hWnd, SW_NORMAL); UpdateWindow(hWnd); while (msg.message != WM_QUIT) { bool nowActive = true; ActiveWnd = GetActiveWindow(); if (PeekMessage(&msg, NULL, 0, 0, PM_REMOVE)) { TranslateMessage(&msg); DispatchMessage(&msg); } else { if (g_pDInput == NULL) { InitMouse(hInst); } Render(); } //Escキーが押されたら終了 BYTE key[256]; GetKeyboardState(key); if (key[VK_ESCAPE] & 0x80) { break; } if (hWnd == ActiveWnd) { if (nowActive == false) { if (InitMouse(hInst)) { nowActive = true; } } } else { SAFE_RELEASE(g_pDInput); SAFE_RELEASE(g_pDIMouse); nowActive = false; } } }

[ "katsuto-kawauchi@koeitecmo.co.jp" ]

katsuto-kawauchi@koeitecmo.co.jp

576eaf24837a0be87b3fa02801bff4064e33e4a3

24ce63cfba8a5dd2c5ab206963a5760cc42cf4f3

/SceneObject.hpp

368b3c3fade5649be4e22080f9e41fd9a6277c55

[]

no_license

dylanswiggett/raytracer

b79b3283d64f26b4086326dfb195ba45d5137dca

edbc1d76af5093a255bbda26512ab3d2e32971b7

refs/heads/master

2020-04-27T00:50:34.594200

2014-08-26T04:56:17

null

0

null

UTF-8

C++

false

631

hpp

#ifndef _SCENE_OBJECT_HPP_ #define _SCENE_OBJECT_HPP_ #include "Ray.hpp" #include "Material.hpp" class SceneObject { public: // Attempts to trace the given ray onto this object. If no collision // occurs, the return value is false. If a collision occurs, a ray // is returned containing the material values of the object hit, from // the point of collision and in the direction of the surface normal. virtual bool raytrace(Ray *ray, Ray *ret) = 0; virtual Material *getmat() { return &material; }; virtual void setmat(Material m) { material = m; }; protected: Material material; }; #endif // _SCENE_OBJECT_HPP_

[ "dylanswiggett@gmail.com" ]

dylanswiggett@gmail.com

7679563da73d36201fbc00a0d67dceb06a22bfac

db1c300a95ec1e11263b78e0d2aab797fa812558

/Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal/cbtfiapt.cc

e1aeeb6b2cc8a99aa8e2f5b3314b67fdc763f6b5

[]

no_license

graywzc/leetcode2

cd218e9d0de2600f10a66aabc5602e0b075e824b

243c5c5671d26a6b5c174faa43509876a28a3073

refs/heads/master

2016-09-06T15:52:20.846244

2015-05-30T20:11:37

34,969,423

0

null

UTF-8

C++

false

1,239

cc

/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { public: TreeNode* buildTree(const vector<int>& inorder, int istart, int iend, const vector<int>& postorder, int pstart, int pend) { if(istart>iend) return NULL; else if(istart == iend) { TreeNode *root = new TreeNode(inorder[istart]); return root; } else { TreeNode *root = new TreeNode(postorder[pend]); int i = istart; while(inorder[i]!=postorder[pend]) i++; root->left = buildTree(inorder,istart,i-1,postorder,pstart,i-1-istart+pstart); root->right = buildTree(inorder,i+1,iend,postorder,i-istart+pstart,pend-1); return root; } } TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) { return buildTree(inorder,0,inorder.size()-1,postorder,0,postorder.size()-1); } };

[ "graywzc@gmail.com" ]

graywzc@gmail.com

61c61ac3e66e4f56395f2d311e1a854d3dcbc737

6ae42ae04953d0bd619554b2191ae4a63adec3d0

/PlistToFnt/dialog.cpp

a19d2e4c8853b8c3a7ccf1c31d4fb4f04695e030

[]

no_license

wolfand11/Tools_PlistToFnt

ce0a0138dc8f6bac98300060c9507341fe757426

51a5b3d893d00edcf4a8a4cfed02aa42fddfb4b3

refs/heads/master

2016-09-05T18:04:12.857367

2013-12-10T11:42:23

14,587,375

1

0

null

UTF-8

C++

false

1,880

cpp

#include "dialog.h" #include "ui_dialog.h" #include <QFileDialog> #include <QDir> #include "gsetting.h" #include "./libs/qtplist/PListParser.h" #include "./libs/qtplist/PListSerializer.h" #include "./libs/fnt/fntserializer.h" #define kPlistFileSuffix ".plist" #define kFntFileSuffix ".fnt" Dialog::Dialog(QWidget *parent) : QDialog(parent), ui(new Ui::Dialog) { ui->setupUi(this); } Dialog::~Dialog() { delete ui; } void Dialog::ShowMessage(const QString& msg) { ui->textEdit->setText(msg); } void Dialog::selectFile() { QString plistFilePath = GSetting::GetInstance()->ReadPlistFilePathSetting(); m_fileFullPath = QFileDialog::getOpenFileName(this, "Select Plist File", plistFilePath, tr("Plist (*.plist)")); if(m_fileFullPath.isEmpty()) { m_message = "Please select plist file"; } else { m_message = "You Selected File: \n\n"; m_message += m_fileFullPath; GSetting::GetInstance()->WritePlistFilePathSetting(m_fileFullPath); } ShowMessage(m_message); } void Dialog::convertFile() { QFile readFile(m_fileFullPath); if(!readFile.open(QFile::ReadOnly | QIODevice::Text)) { ShowMessage("ERROR:\n Open plist file failed!\n Please Select Plist file."); return; } QVariant plistVar = PListParser::parsePList(&readFile); QString fntStr = FntSerializer::ConvertPlistVarToFntDataStr(plistVar); QString fntFileFullPath = m_fileFullPath.replace(kPlistFileSuffix,kFntFileSuffix); QFile writeFile(fntFileFullPath); writeFile.open(QFile::WriteOnly | QIODevice::Text); writeFile.write(fntStr.toStdString().c_str()); ShowMessage("Convert Completed!\n Please Select Plist file."); }

[ "smile_guodong@163.com" ]

smile_guodong@163.com

a365cf2a2b1e41307d17a7af9ba25a6b009e5872

793c8848753f530aab28076a4077deac815af5ac

/src/dskphone/ui/t48/settingui/src/cdlgcustomforward.cpp

6f654232844ca7141c334538bd497becd25f54f6

[]

no_license

Parantido/sipphone

4c1b9b18a7a6e478514fe0aadb79335e734bc016

f402efb088bb42900867608cc9ccf15d9b946d7d

refs/heads/master

2021-09-10T20:12:36.553640

2018-03-30T12:44:13

263,628,242

1

0

null

2020-05-13T12:49:19

2020-05-13T12:49:18

null

UTF-8

C++

false

5,533

cpp

#include "cdlgcustomforward.h" #include "account/include/modaccount.h" #include "settingui/include/modsettingui.h" #include "qtcommon/qmisc.h" #include "uikernel/languagehelper.h" #include "uimanager/moduimanager.h" #include "keymap.h" #include "baseui/fontcolor.h" #include "setting/src/callforwardcontroller.h" CDlgCustomForward::CDlgCustomForward(QWidget * parent) : CDlgBaseSubPage(parent) , m_bEnableAccount(false) { m_strTitle = LANG_TRANSLATE(TRID_CUSTOM_FORWARD).toUtf8().data(); m_listForwardData.clear(); InitData(); } CDlgCustomForward::~CDlgCustomForward() { } void CDlgCustomForward::InitData() { if (NULL != m_pGeneralFrame) { m_pGeneralFrame->SetNote(LANG_TRANSLATE(TRID_NONE)); } QWidgetPair qPair; QString strLab; //获取可用账号数据 ListAccounts listValidAccount = acc_GetAvailableAccountList(); int nIndex = 0; ListAccounts::iterator itAccount = listValidAccount.begin(); for (/* */; itAccount != listValidAccount.end(); ++itAccount) { QLabel * pLabel = new QLabel(this); if (NULL != pLabel) { // 设置字体颜色 SetWgtFontColor(pLabel, FONT_TYPE_TEXT); //http://10.2.1.199/Bug.php?BugID=92700 改为和黑白屏一样统一通过acc_GetAccountShowText接口获取 yl::string strAccountDisplayName = acc_GetAccountShowText(*itAccount); //设置Activation标签 strLab = toQString(strAccountDisplayName.c_str()); qPair.first = strLab; qPair.second = pLabel; qPair.third = "enter"; qPair.bWithStatus = true; qPair.eType = SETTING_ITEM_MENU; // 加入映射中 CustomForwardData ItemData; ItemData.iAccountID = *itAccount; ItemData.pLabel = pLabel; ItemData.nIndex = nIndex; m_listForwardData.push_back(ItemData); m_vecWidgetPair.push_back(qPair); nIndex++; } } #ifdef IF_FEATURE_FORWARD_OPT if (listValidAccount.size() > 1) { QLabel * pLabel = new QLabel(this); if (NULL != pLabel) { // 设置字体颜色 SetWgtFontColor(pLabel, FONT_TYPE_TEXT); //设置Activation标签 strLab = LANG_TRANSLATE(TRID_ALL_LINES); qPair.first = strLab; qPair.second = pLabel; qPair.third = "enter"; qPair.bWithStatus = true; qPair.eType = SETTING_ITEM_MENU; CustomForwardData ItemData; ItemData.iAccountID = -1; ItemData.pLabel = pLabel; ItemData.nIndex = nIndex++; m_listForwardData.push_back(ItemData); m_vecWidgetPair.push_back(qPair); } } #endif //设置为None的提示必须在AddWidget之后 AddWidget(m_vecWidgetPair, true, false, true, false); // 无账号可用 m_bEnableAccount = (listValidAccount.size() != 0); //为界面自己安装事件过滤器 this->installEventFilter(this); } // 设置子页面的SoftKey bool CDlgCustomForward::GetSoftkeyData(CArraySoftKeyBarData & objWndData) { objWndData[3].m_strSoftkeyAction = ""; objWndData[3].m_strSoftkeyTitle = ""; return true; } // 对输入框的数据进行验证 bool CDlgCustomForward::IsInputDataValid(InputDataErrorInfo & objErrorContent) { return true; } //从V层读取当前界面的配置，通过C层保存 bool CDlgCustomForward::SavePageData() { return false; } //通过C层获取已有配置数据，通过V层在界面上显示出来 bool CDlgCustomForward::LoadPageData() { int nAccountID; for (nAccountID = 0; nAccountID < acc_AccountNum(); nAccountID++) { IterForwardData itrBegin = m_listForwardData.begin(); for (; itrBegin != m_listForwardData.end(); ++itrBegin) { CustomForwardData & ItemData = *itrBegin; if (ItemData.iAccountID == nAccountID) { // 从配置中读值 QString strText = g_pCallForwardController->IsForwardEnable(FWD_TYPE_ALL, ItemData.iAccountID) ? LANG_TRANSLATE(TRID_ON) : LANG_TRANSLATE(TRID_OFF); ItemData.pLabel->setText(strText); } } } //给自己安装过滤器 this->installEventFilter(this); return true; } //通过C层获取配置数据，与GetPageData值比较，有改动时返回true bool CDlgCustomForward::IsStatusChanged() { return false; } bool CDlgCustomForward::OnAction(const QString & strAction) { bool bResult = false; if (strAction == "enter") { //根据账号进入，显示 IterForwardData itrBegin = m_listForwardData.begin(); for (; itrBegin != m_listForwardData.end(); ++itrBegin) { if (itrBegin->nIndex == m_pGeneralFrame->GetFocusItemDataIndex()) { SubMenuData subMenuData; subMenuData.iFirstSelectItem = 0; subMenuData.pBeforeSetSubpageData = (void *) & (itrBegin->iAccountID); subMenuData.strMenuAction = "OpenSubPage(call_forward_option)"; emit openpage(subMenuData); break; } } bResult = true; } return bResult; } void CDlgCustomForward::showEvent(QShowEvent * e) { //从CDlgCustomForwardOption子界面返回，需重新下载数据 LoadPageData(); }

[ "rongxx@yealink.com" ]

rongxx@yealink.com

020cb123aec4fe9bfc85b9417875f190b85df0e6

c2239a4e2f88d072021113fe355c02eedefe9110

/private/ToolZ/PositionService.cxx

4afe8e6d912776abc11c28db9efa68a5d2856974

[]

no_license

mzoll/ToolZ

d581258655c61a5958ed25004ee1d4b15cabd28c

6f8dcaf439db172ad8c5248f71d644ffbe9566c7

refs/heads/master

2020-03-29T16:18:13.566897

2018-09-24T13:41:50

150,108,017

0

null

UTF-8

C++

false

2,056

cxx

/** * \file PositionService.cxx * * copyright (c) 2011 * the IceCube Collaboration * $Id: IceHiveHelpers.cxx 144968 2016-04-20 22:52:24Z mzoll $ * @date $Date: 2013-10-22$ * @author mzoll <marcel.zoll@fysik.su.se> */ #include "ToolZ/PositionService.h" #include <boost/foreach.hpp> #include <boost/make_shared.hpp> #include <algorithm> #include <vector> //=================== CLASS PositionService =========== PositionService::PositionService( const I3OMGeoMap& omgeo, CompactOMKeyHashServiceConstPtr& hasher) : hasher_(hasher ? hasher : boost::make_shared<const CompactOMKeyHashService>(ExtractOMKeys(omgeo))), hashedPosition_(ConstructHashedPositions(omgeo)) { if (!hasher) hasher = hasher_; }; PositionService::PositionService( const I3OMGeoMap& omgeo, const CompactOMKeyHashServiceConstPtr& hasher) : hasher_(hasher), hashedPosition_(ConstructHashedPositions(omgeo)) {}; #if SERIALIZATION_ENABLED PositionService::PositionService( const CompactOMKeyHashServiceConstPtr& hasher, const std::vector<I3Position>& hashedPosition) : hasher_(hasher), hashedPosition_(hashedPosition) {}; #endif //SERIALIZATION_ENABLED std::vector<I3Position> PositionService::ConstructHashedPositions ( const I3OMGeoMap& omgeo) const { std::vector<I3Position> hashedPosition; BOOST_FOREACH(const OMKey& omkey, hasher_->GetOMKeys()) { hashedPosition.push_back(omgeo.at(omkey).position); } return hashedPosition; }; bool PositionService::VerifyAgainst( const I3OMGeoMap& omgeo) const { for (uint64_t i=0; i<hashedPosition_.size(); i++) { const OMKey omkey = hasher_->OMKeyFromHash(i); const I3OMGeoMap::const_iterator geo_entry = omgeo.find(omkey); if (geo_entry == omgeo.end()) { log_error("Do not verify against each other"); return false; } if (hashedPosition_.at(i) != omgeo.at(omkey).position) { log_error("Do not verify against each other"); return false; } } return true; } #if SERIALIZATION_ENABLED I3_SERIALIZABLE(PositionService); #endif

[ "marcel.zoll.physics@gmail.com" ]

marcel.zoll.physics@gmail.com

17bfbe68ebd0abf874c7784bb510a3d1669972f2

0e227713c07dbbc686432913c69a95f7f047fdc8

/finalProject/finalProject/greyShell.cpp

8694c55bd0e5d0d9afec66fad551e1696e533cab

[]

no_license

MeetPuppet/2019-WIN-API

aecb2e2fa54515d6c7d6b4d730891ef600487315

1aa0056b5d6eebfd34b5ac538b4997862987e2f8

refs/heads/master

2022-12-20T02:24:04.899545

2020-10-20T04:57:43

186,378,686

0

null

UTF-8

C++

false

477

cpp

#include "stdafx.h" #include "greyShell.h" greyShell::greyShell() { } greyShell::~greyShell() { } HRESULT greyShell::init(int x, int y, int sizeX, int sizeY) { objectNode::init("greyShell", x, y, sizeX, sizeY); timenum = 0; return S_OK; } void greyShell::update() { objectNode::update(); timenum++; if (timenum > 100) { if (frameX == 0) { frameX = 1; } else frameX = 0; } if (timenum > 500) { } } void greyShell::render() { objectNode::render(); }

[ "gnslgns2000@naver.com" ]

gnslgns2000@naver.com

eb7c39d6b27d6a3d3e09e4f8d19be20a607a85dd

f615faafdd6120c0bcbe0bea52ad22c8ea26fa13

/Ja2Project/AssemblyInfo.cpp

690b29899e76edc39b54e6d8d9b62ba58878520a

[]

no_license

egorovav/Ja2Project

af35304af21c82b4c71eb466b3bdae77fd028be8

880bdbcf6eea9692f35a9346de71f20239c279ac

refs/heads/master

2021-01-19T22:53:28.517555

2019-10-24T21:04:20

88,882,719

0

1

null

UTF-8

C++

false

1,254

cpp

#include "stdafx.h" using namespace System; using namespace System::Reflection; using namespace System::Runtime::CompilerServices; using namespace System::Runtime::InteropServices; using namespace System::Security::Permissions; // // General Information about an assembly is controlled through the following // set of attributes. Change these attribute values to modify the information // associated with an assembly. // [assembly:AssemblyTitleAttribute(L"Ja2Project")]; [assembly:AssemblyDescriptionAttribute(L"")]; [assembly:AssemblyConfigurationAttribute(L"")]; [assembly:AssemblyCompanyAttribute(L"")]; [assembly:AssemblyProductAttribute(L"Ja2Project")]; [assembly:AssemblyCopyrightAttribute(L"Copyright (c) 2015")]; [assembly:AssemblyTrademarkAttribute(L"")]; [assembly:AssemblyCultureAttribute(L"")]; // // Version information for an assembly consists of the following four values: // // Major Version // Minor Version // Build Number // Revision // // You can specify all the value or you can default the Revision and Build Numbers // by using the '*' as shown below: [assembly:AssemblyVersionAttribute("1.0.*")]; [assembly:ComVisible(false)]; [assembly:CLSCompliantAttribute(true)];

[ "egorov_av@mail.ru" ]

egorov_av@mail.ru

8aadadc1a7827974a901c88b78b24d2d550986e9

dc2e0d49f99951bc40e323fb92ea4ddd5d9644a0

/SDK/ThirdLibrary/include/activemq-cpp/decaf/internal/DecafRuntime.cpp

86d2a830d11975c1655b6fdb93f74f6e8a769d6a

[]

no_license

wenyu826/CecilySolution

8696290d1723fdfe6e41ce63e07c7c25a9295ded

14c4ba9adbb937d0ae236040b2752e2c7337b048

refs/heads/master

2020-07-03T06:26:07.875201

2016-11-19T07:04:29

74,192,785

0

1

null

UTF-8

C++

false

3,678

cpp

/* * Licensed to the Apache Software Foundation (ASF) under one or more * contributor license agreements. See the NOTICE file distributed with * this work for additional information regarding copyright ownership. * The ASF licenses this file to You under the Apache License, Version 2.0 * (the "License"); you may not use this file except in compliance with * the License. You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ #include "DecafRuntime.h" #include <apr.h> #include <apr_general.h> #include <apr_pools.h> #include <decaf/lang/System.h> #include <decaf/lang/Thread.h> #include <decaf/internal/net/Network.h> #include <decaf/internal/security/SecurityRuntime.h> #include <decaf/internal/util/concurrent/Threading.h> using namespace decaf; using namespace decaf::internal; using namespace decaf::internal::net; using namespace decaf::internal::security; using namespace decaf::internal::util::concurrent; using namespace decaf::lang; using namespace decaf::util::concurrent; //////////////////////////////////////////////////////////////////////////////// namespace { apr_pool_t* aprPool; Mutex* globalLock; } //////////////////////////////////////////////////////////////////////////////// DecafRuntime::DecafRuntime() : decaf::lang::Runtime() { } //////////////////////////////////////////////////////////////////////////////// DecafRuntime::~DecafRuntime() { } //////////////////////////////////////////////////////////////////////////////// apr_pool_t* DecafRuntime::getGlobalPool() const { return aprPool; } //////////////////////////////////////////////////////////////////////////////// Mutex* DecafRuntime::getGlobalLock() { return globalLock; } //////////////////////////////////////////////////////////////////////////////// Runtime* Runtime::getRuntime() { static DecafRuntime runtime; return &runtime; } //////////////////////////////////////////////////////////////////////////////// void Runtime::initializeRuntime(int argc, char **argv) { // Initializes the APR Runtime from within a library. apr_initialize(); apr_pool_create_ex(&aprPool, NULL, NULL, NULL); Runtime::getRuntime(); Threading::initialize(); globalLock = new Mutex; System::initSystem(argc, argv); Network::initializeNetworking(); SecurityRuntime::initializeSecurity(); } //////////////////////////////////////////////////////////////////////////////// void Runtime::initializeRuntime() { Runtime::initializeRuntime(0, NULL); } //////////////////////////////////////////////////////////////////////////////// void Runtime::shutdownRuntime() { SecurityRuntime::shutdownSecurity(); // Shutdown the networking layer before Threading, many network routines need // to be thread safe and require Threading primitives. Network::shutdownNetworking(); System::shutdownSystem(); // This must go away before Threading is shutdown. delete globalLock; // Threading is the last to by shutdown since most other parts of the Runtime // need to make use of Thread primitives. Threading::shutdown(); // Cleans up APR data structures. apr_pool_destroy(aprPool); apr_terminate(); }

[ "626955115@qq.com" ]

626955115@qq.com

4bf788dbabe480ccac3237702945d73cd80dcef9

02bd20fa7dd7a01d161aa6a6ebf0df361e7edff9

/areaRect.cpp

9f2f66669d726f017287d1b0d77ff885fee819b6

[]

no_license

Minakshi-probuz/cPlusPlus

bcb4d8603bf8f001462dd87cc529a757a6001eb6

206875f2ff7f3783039fd7e50cfb62e79483220a

refs/heads/main

2023-03-05T09:12:56.995454

2021-02-21T08:38:53

335,289,333

0

null

UTF-8

C++

false

249

cpp

#include<iostream> using namespace std; int rectangle; int rect(); int rect(){ int l=10; int b=2; rectangle=l*b; return rectangle; } int main(){ rect(); cout<<"area of rectangle:"<<rectangle; }

[ "noreply@github.com" ]

Minakshi-probuz.noreply@github.com

96cc75bb4e878114dc87de4300e61070f537ce61

3ded37602d6d303e61bff401b2682f5c2b52928c

/ml/013/Classes/View/MachineView.h

808f5ec4562c4acea8e15bca3b723637f0ce20bd

[]

no_license

CristinaBaby/Demo_CC

8ce532dcf016f21b442d8b05173a7d20c03d337e

6f6a7ff132e93271b8952b8da6884c3634f5cb59

refs/heads/master

2021-05-02T14:58:52.900119

2018-02-09T11:48:02

120,727,659

0

null

UTF-8

C++

false

1,145

h

// // MachineView.h // Make // // Created by liji on 15/5/28. // // #ifndef __Make__MachineView__ #define __Make__MachineView__ #include <stdio.h> #include "cocos2d.h" USING_NS_CC; class MachineViewDelegate { public: virtual void allStepFinished(){}; }; class MachineView : public Layer { public: CREATE_FUNC(MachineView); bool init(); void setDelegate(MachineViewDelegate* delegate){delegate_ = delegate;}; private: void initMachine(); void showIceBag(); void iceBagClicked(); void machineCoverClosed(); void showMachineBtn(); void runMachine(); void iceEffect(float dt); void snowconeFall(float dt); void showIcePile(); void stepFinish(); private: Sprite* lid_; Sprite* boxBottom_; Sprite* boxCover_; Sprite* hint_; Sprite* iceBag_; Sprite* pile_; Sprite* btn_; MachineViewDelegate* delegate_; Vector<Sprite*> vec_ice; int iceCount_ = 0; EventListenerTouchOneByOne* listener_; float _rectPosY = 0.f; const float _totalTime = 3.f; float _speed = 0.f; }; #endif /* defined(__Make__MachineView__) */

[ "wuguiling@smalltreemedia.com" ]

wuguiling@smalltreemedia.com

6da92fb60696181195412c98b4f98a06af53716c

d928143913c7b298b7bc637c2dcfa2ae617229e7

/src/System/SilentSoundSystem/SilentSoundBuffer.cpp

c6af19b974cb0439f59decd8e5c424ee2673b943

[]

no_license

hackerlank/Mengine

d7e649c29ab6cfd861bd85c75e514939ba7a09d6

108491a9ef86946fc4abed0662b0beafbde4fda4

refs/heads/master

2021-01-12T06:19:27.136456

2016-12-13T00:55:25

null

0

null

UTF-8

C++

false

3,284

cpp

# include "SilentSoundBuffer.h" # include "Interface/SoundCodecInterface.h" # include <time.h> namespace Menge { ////////////////////////////////////////////////////////////////////////// static float s_getTimeMs() { clock_t cl = clock(); float sec = (float)(cl) / float(CLOCKS_PER_SEC); return sec; } ////////////////////////////////////////////////////////////////////////// SilentSoundBuffer::SilentSoundBuffer() : m_playTime(0.f) , m_pauseTime(0.f) , m_frequency(0) , m_channels(0) , m_length(0.f) , m_isStereo(false) { } ////////////////////////////////////////////////////////////////////////// SilentSoundBuffer::~SilentSoundBuffer() { } ////////////////////////////////////////////////////////////////////////// bool SilentSoundBuffer::update() { return false; } ////////////////////////////////////////////////////////////////////////// const SoundDecoderInterfacePtr & SilentSoundBuffer::getDecoder() const { return m_soundDecoder; } ////////////////////////////////////////////////////////////////////////// bool SilentSoundBuffer::load( const SoundDecoderInterfacePtr & _soundDecoder ) { m_soundDecoder = _soundDecoder; const SoundCodecDataInfo* dataInfo = m_soundDecoder->getCodecDataInfo(); m_frequency = dataInfo->frequency; m_channels = dataInfo->channels; m_length = dataInfo->length; //size_t size = dataInfo->size; if( m_channels == 1 ) { m_isStereo = false; } else { m_isStereo = true; } return true; } ////////////////////////////////////////////////////////////////////////// void SilentSoundBuffer::play( uint32_t _id, bool _looped, float _pos ) { (void)_id; (void)_looped; (void)_pos; float sec = s_getTimeMs(); m_playTime = sec; m_pauseTime = 0.f; } ////////////////////////////////////////////////////////////////////////// bool SilentSoundBuffer::resume( uint32_t _id ) { (void)_id; float sec = s_getTimeMs(); float deltha = m_pauseTime - m_playTime; m_playTime = sec - deltha; m_pauseTime = 0.f; return true; } ////////////////////////////////////////////////////////////////////////// void SilentSoundBuffer::pause( uint32_t _id ) { (void)_id; float sec = s_getTimeMs(); m_pauseTime = sec; } ////////////////////////////////////////////////////////////////////////// void SilentSoundBuffer::stop( uint32_t _id ) { (void)_id; m_playTime = 0.f; m_pauseTime = 0.f; } ////////////////////////////////////////////////////////////////////////// float SilentSoundBuffer::getTimePos( uint32_t _id ) const { (void)_id; if( m_pauseTime > m_playTime ) { return m_pauseTime; } float sec = s_getTimeMs(); return sec - m_playTime; } ////////////////////////////////////////////////////////////////////////// float SilentSoundBuffer::getTimeTotal() const { return m_length; } ////////////////////////////////////////////////////////////////////////// } // namespace Menge

[ "yuriy_levchenko@202150c4-1a32-4ab8-af31-e3358ecdd631" ]

yuriy_levchenko@202150c4-1a32-4ab8-af31-e3358ecdd631

059ebc32b0ffa6e7552d68da8b9de8f10236b4a0

03d3231478373089a3de04db162f61b79a388fd3

/l2packets/l2world/L2Npc.cpp

816cef502291c3a828bb8ed370bb4bb6e461c5ce

[]

no_license

minlexx/l2-unlegits

f4b0e9d70afe2a0a26f81daa16123eb2fe31cc13

fc189ca35edf14439a5eeac81359b30112496b80

refs/heads/master

2021-01-17T05:35:09.738039

2015-06-28T09:16:13

38,192,499

6

3

null

UTF-8

C++

false

3,552

cpp

#include "stdafx.h" #include "L2Npc.h" #include "../l2data/L2Data.h" #include "../game/L2GamePacket.h" #include "../os/os_abstraction.h" L2Npc::L2Npc() { setUnused(); } L2Npc::~L2Npc() { setUnused(); } L2Npc::L2Npc( const L2Npc& other ): L2Character() { setUnused(); operator=( other ); } const L2Npc& L2Npc::operator=( const L2Npc& other ) { if( this == &other ) return (*this); L2Character::operator=( other ); templateID = other.templateID; isAttackable = other.isAttackable; iid_left_hand = other.iid_left_hand; iid_right_hand = other.iid_right_hand; iid_chest = other.iid_chest; return (*this); } void L2Npc::setUnused() { L2Character::setUnused(); templateID = 0; isAttackable = 0; // weapon iid_left_hand = iid_right_hand = iid_chest = 0; } void L2Npc::setNpcNameTitleByTemplate() { char db_name[256], db_title[256]; db_name[0] = db_title[0] = 0; if( L2Data_DB_GetNPCNameTitleByID( templateID, db_name, db_title ) ) { setName( db_name ); setTitle( db_title ); } } bool L2Npc::parse_NpcInfo( void *l2_game_packet, L2_VERSION l2_version ) { if( !l2_game_packet ) return false; L2GamePacket *p = (L2GamePacket *)l2_game_packet; // parse unsigned char ptype = p->getPacketType(); if( ptype != 0x0C ) return false; // 0x0C NpcInfo // objectID = p->readUInt(); templateID = p->readUInt() - 1000000; // ? :) L2J adds 1000000 to this field isAttackable = p->readD(); // _isAttackable x = p->readD(); y = p->readD(); z = p->readD(); heading = p->readUInt(); p->readD(); // 0x00 mAtkSpd = p->readD(); pAtkSpd = p->readD(); runSpeed = p->readD(); walkSpeed = p->readD(); p->readD(); // swim run speed p->readD(); // swim walk speed p->readD(); // fl run speed (?) p->readD(); // fl walk speed (?) p->readD(); // fly run speed (?) same as fl p->readD(); // fly walk speed (?) double moveSpeedMultiplier = p->readF(); double attackSpeedMultiplier = p->readF(); if( moveSpeedMultiplier > 0 ) { runSpeed = (int)( ((double)runSpeed) * moveSpeedMultiplier ); walkSpeed = (int)( ((double)walkSpeed) * moveSpeedMultiplier ); } if( attackSpeedMultiplier > 0 ) pAtkSpd = (int)( ((double)pAtkSpd) * attackSpeedMultiplier ); collisionRadius = p->readF(); collisionHeight = p->readF(); iid_right_hand = p->readUInt(); iid_chest = p->readUInt(); iid_left_hand = p->readUInt(); p->readC(); // has title isRunning = p->readC(); isInCombat = p->readC(); isAlikeDead = p->readC(); p->readC(); // is summoned setName( p->readUnicodeStringPtr() ); setTitle( p->readUnicodeStringPtr() ); p->readD(); // title color p->readD(); // 0x00 pvpFlag = p->readD(); // pvp flag abnormalEffect = p->readUInt(); clanID = p->readUInt(); // Gracia Final clanCrestID = p->readUInt(); // Gracia Final isFlying = p->readC(); // Gracia Final p->readC(); // 0x00 p->readF(); // collisionRadius (again?) p->readF(); // collisionHeight (again?) p->readD(); // 0x00 p->readD(); // isFlying? (again?) Gracia Final p->readD(); // 0x00 p->readD(); // pet form and skills (?) // Gracia Final has some more to read if( l2_version >= L2_VERSION_T23 ) { p->readC(); // 0x01 p->readC(); // 0x01 p->readD(); // 0x00000000 } // set last time when npc coordinates were known exactly lastMoveTickTime = OS_GetTickCount(); return true; }

[ "alexey.min@gmail.com" ]

alexey.min@gmail.com

f00cb7fe4d1750a9d81afb4c71cb92354c843d40

3a50c0712e0a31b88d0a5e80a0c01dbefc6a6e75

/thrift/test/FieldRefBenchmark.cpp

706f851ea29b5cc158903e35fe401137cd7bc28a

[ "Apache-2.0" ]

permissive

facebook/fbthrift

3b7b94a533666c965ce69cfd6054041218b1ea6f

53cf6f138a7648efe5aef9a263aabed3d282df91

refs/heads/main

2023-08-24T12:51:32.367985

2023-08-24T08:28:35

11,131,631

2,347

666

Apache-2.0

2023-09-01T01:44:39

2013-07-02T18:15:51

C++

UTF-8

C++

false

2,109

cpp

/* * Copyright (c) Meta Platforms, Inc. and affiliates. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ #include <glog/logging.h> #include <folly/Benchmark.h> #include <folly/Portability.h> #include <folly/init/Init.h> #include <thrift/test/gen-cpp2/optionals_types.h> using namespace std; using namespace cpp2; using namespace folly; BENCHMARK_COUNTERS(field_ref_direct, counters, n) { HasOptionals a; counters["stack_mem"] = sizeof(a); int64_t k = n * (1 + 'a'); while (n--) { a.int64Opt() = 1; k -= a.int64Opt().value(); a.stringOpt() = "a"; k -= a.stringOpt().value()[0]; } CHECK_EQ(k, 0); folly::doNotOptimizeAway(k); } template <class T, class U> FOLLY_NOINLINE void run(T int64Opt_ref, U stringOpt_ref, int n) { int64_t k = n * (1 + 'a'); while (n--) { int64Opt_ref = 1; k -= int64Opt_ref.value(); stringOpt_ref = "a"; k -= stringOpt_ref.value()[0]; } CHECK_EQ(k, 0); folly::doNotOptimizeAway(k); } BENCHMARK_RELATIVE(field_ref_indirect, n) { HasOptionals a; run(a.int64Opt(), a.stringOpt(), n); } BENCHMARK_RELATIVE(unsafe, n) { HasOptionals a; apache::thrift::ensure_isset_unsafe(a.int64Opt()); apache::thrift::ensure_isset_unsafe(a.stringOpt()); int64_t k = n * (1 + 'a'); while (n--) { a.int64Opt().value_unchecked() = 1; k -= a.int64Opt().value_unchecked(); a.stringOpt().value_unchecked() = "a"; k -= a.stringOpt().value_unchecked()[0]; } CHECK_EQ(k, 0); folly::doNotOptimizeAway(k); } int main(int argc, char** argv) { folly::init(&argc, &argv); runBenchmarks(); return 0; }

[ "facebook-github-bot@users.noreply.github.com" ]

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

6155bf956ac9c31035b9ac8053e3bcb579b4da01

62ec94314f194157f62c49c206dd777a159e0817

/src/console/gengetopt/cl_arguments.cpp

d3b1c5f8d7203caea7327edcac7cb0b7c14f1204

[]

no_license

telishev/sneakPic

e6c3a9ceee97caf5c46808225e0e3e68a1ca2bf0

25cac33adfec70f161cc526123df5376ece9b950

refs/heads/master

2020-04-14T19:04:56.660200

2014-07-19T20:37:38

10,853,376

2

3

null

UTF-8

C++

false

35,197

cpp

/* File autogenerated by gengetopt version 2.22.6 generated with the following command: e:\MinGW\msys\1.0\local\bin\gengetopt.exe -i cl_arguments.ggo --unamed-opt=SVG_FILES --show-required -G -F cl_arguments -c cpp The developers of gengetopt consider the fixed text that goes in all gengetopt output files to be in the public domain: we make no copyright claims on it. */ /* If we use autoconf. */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include <stdio.h> #include <stdlib.h> #include <string.h> #ifndef FIX_UNUSED #define FIX_UNUSED(X) (void) (X) /* avoid warnings for unused params */ #endif #include "cl_arguments.h" const char *gengetopt_args_info_purpose = ""; const char *gengetopt_args_info_usage = "Usage: " CMDLINE_PARSER_PACKAGE " [OPTIONS]... [SVG_FILES]..."; const char *gengetopt_args_info_versiontext = ""; const char *gengetopt_args_info_description = ""; const char *gengetopt_args_info_full_help[] = { " -h, --help Print help and exit", " --full-help Print help, including hidden options, and exit", " -V, --version Print version and exit", "\nExport:", " -r, --render-png=FileName.png Renders target svg file to FileName.png", " --save=FileName.svg Saves file to FileName.svg in svg format (for\n testing purposes)", 0 }; static void init_help_array(void) { gengetopt_args_info_help[0] = gengetopt_args_info_full_help[0]; gengetopt_args_info_help[1] = gengetopt_args_info_full_help[1]; gengetopt_args_info_help[2] = gengetopt_args_info_full_help[2]; gengetopt_args_info_help[3] = gengetopt_args_info_full_help[3]; gengetopt_args_info_help[4] = gengetopt_args_info_full_help[4]; gengetopt_args_info_help[5] = 0; } const char *gengetopt_args_info_help[6]; typedef enum {ARG_NO , ARG_STRING } cmdline_parser_arg_type; static void clear_given (struct gengetopt_args_info *args_info); static void clear_args (struct gengetopt_args_info *args_info); static int cmdline_parser_internal (int argc, char **argv, struct gengetopt_args_info *args_info, struct cmdline_parser_params *params, const char *additional_error); static char * gengetopt_strdup (const char *s); static void clear_given (struct gengetopt_args_info *args_info) { args_info->help_given = 0 ; args_info->full_help_given = 0 ; args_info->version_given = 0 ; args_info->render_png_given = 0 ; args_info->save_given = 0 ; } static void clear_args (struct gengetopt_args_info *args_info) { FIX_UNUSED (args_info); args_info->render_png_arg = NULL; args_info->render_png_orig = NULL; args_info->save_arg = NULL; args_info->save_orig = NULL; } static void init_args_info(struct gengetopt_args_info *args_info) { init_help_array(); args_info->help_help = gengetopt_args_info_full_help[0] ; args_info->full_help_help = gengetopt_args_info_full_help[1] ; args_info->version_help = gengetopt_args_info_full_help[2] ; args_info->render_png_help = gengetopt_args_info_full_help[4] ; args_info->save_help = gengetopt_args_info_full_help[5] ; } void cmdline_parser_print_version (void) { printf ("%s %s\n", (strlen(CMDLINE_PARSER_PACKAGE_NAME) ? CMDLINE_PARSER_PACKAGE_NAME : CMDLINE_PARSER_PACKAGE), CMDLINE_PARSER_VERSION); if (strlen(gengetopt_args_info_versiontext) > 0) printf("\n%s\n", gengetopt_args_info_versiontext); } static void print_help_common(void) { cmdline_parser_print_version (); if (strlen(gengetopt_args_info_purpose) > 0) printf("\n%s\n", gengetopt_args_info_purpose); if (strlen(gengetopt_args_info_usage) > 0) printf("\n%s\n", gengetopt_args_info_usage); printf("\n"); if (strlen(gengetopt_args_info_description) > 0) printf("%s\n\n", gengetopt_args_info_description); } void cmdline_parser_print_help (void) { int i = 0; print_help_common(); while (gengetopt_args_info_help[i]) printf("%s\n", gengetopt_args_info_help[i++]); } void cmdline_parser_print_full_help (void) { int i = 0; print_help_common(); while (gengetopt_args_info_full_help[i]) printf("%s\n", gengetopt_args_info_full_help[i++]); } void cmdline_parser_init (struct gengetopt_args_info *args_info) { clear_given (args_info); clear_args (args_info); init_args_info (args_info); args_info->inputs = 0; args_info->inputs_num = 0; } void cmdline_parser_params_init(struct cmdline_parser_params *params) { if (params) { params->override = 0; params->initialize = 1; params->check_required = 1; params->check_ambiguity = 0; params->print_errors = 1; } } struct cmdline_parser_params * cmdline_parser_params_create(void) { struct cmdline_parser_params *params = (struct cmdline_parser_params *)malloc(sizeof(struct cmdline_parser_params)); cmdline_parser_params_init(params); return params; } static void free_string_field (char **s) { if (*s) { free (*s); *s = 0; } } static void cmdline_parser_release (struct gengetopt_args_info *args_info) { unsigned int i; free_string_field (&(args_info->render_png_arg)); free_string_field (&(args_info->render_png_orig)); free_string_field (&(args_info->save_arg)); free_string_field (&(args_info->save_orig)); for (i = 0; i < args_info->inputs_num; ++i) free (args_info->inputs [i]); if (args_info->inputs_num) free (args_info->inputs); clear_given (args_info); } static void write_into_file(FILE *outfile, const char *opt, const char *arg, const char *values[]) { FIX_UNUSED (values); if (arg) { fprintf(outfile, "%s=\"%s\"\n", opt, arg); } else { fprintf(outfile, "%s\n", opt); } } int cmdline_parser_dump(FILE *outfile, struct gengetopt_args_info *args_info) { int i = 0; if (!outfile) { fprintf (stderr, "%s: cannot dump options to stream\n", CMDLINE_PARSER_PACKAGE); return EXIT_FAILURE; } if (args_info->help_given) write_into_file(outfile, "help", 0, 0 ); if (args_info->full_help_given) write_into_file(outfile, "full-help", 0, 0 ); if (args_info->version_given) write_into_file(outfile, "version", 0, 0 ); if (args_info->render_png_given) write_into_file(outfile, "render-png", args_info->render_png_orig, 0); if (args_info->save_given) write_into_file(outfile, "save", args_info->save_orig, 0); i = EXIT_SUCCESS; return i; } int cmdline_parser_file_save(const char *filename, struct gengetopt_args_info *args_info) { FILE *outfile; int i = 0; outfile = fopen(filename, "w"); if (!outfile) { fprintf (stderr, "%s: cannot open file for writing: %s\n", CMDLINE_PARSER_PACKAGE, filename); return EXIT_FAILURE; } i = cmdline_parser_dump(outfile, args_info); fclose (outfile); return i; } void cmdline_parser_free (struct gengetopt_args_info *args_info) { cmdline_parser_release (args_info); } /** @brief replacement of strdup, which is not standard */ char * gengetopt_strdup (const char *s) { char *result = 0; if (!s) return result; result = (char*)malloc(strlen(s) + 1); if (result == (char*)0) return (char*)0; strcpy(result, s); return result; } int cmdline_parser (int argc, char **argv, struct gengetopt_args_info *args_info) { return cmdline_parser2 (argc, argv, args_info, 0, 1, 1); } int cmdline_parser_ext (int argc, char **argv, struct gengetopt_args_info *args_info, struct cmdline_parser_params *params) { int result; result = cmdline_parser_internal (argc, argv, args_info, params, 0); if (result == EXIT_FAILURE) { cmdline_parser_free (args_info); exit (EXIT_FAILURE); } return result; } int cmdline_parser2 (int argc, char **argv, struct gengetopt_args_info *args_info, int override, int initialize, int check_required) { int result; struct cmdline_parser_params params; params.override = override; params.initialize = initialize; params.check_required = check_required; params.check_ambiguity = 0; params.print_errors = 1; result = cmdline_parser_internal (argc, argv, args_info, &params, 0); if (result == EXIT_FAILURE) { cmdline_parser_free (args_info); exit (EXIT_FAILURE); } return result; } int cmdline_parser_required (struct gengetopt_args_info *args_info, const char *prog_name) { FIX_UNUSED (args_info); FIX_UNUSED (prog_name); return EXIT_SUCCESS; } /* * Extracted from the glibc source tree, version 2.3.6 * * Licensed under the GPL as per the whole glibc source tree. * * This file was modified so that getopt_long can be called * many times without risking previous memory to be spoiled. * * Modified by Andre Noll and Lorenzo Bettini for use in * GNU gengetopt generated files. * */ /* * we must include anything we need since this file is not thought to be * inserted in a file already using getopt.h * * Lorenzo */ struct option { const char *name; /* has_arg can't be an enum because some compilers complain about type mismatches in all the code that assumes it is an int. */ int has_arg; int *flag; int val; }; /* This version of `getopt' appears to the caller like standard Unix `getopt' but it behaves differently for the user, since it allows the user to intersperse the options with the other arguments. As `getopt' works, it permutes the elements of ARGV so that, when it is done, all the options precede everything else. Thus all application programs are extended to handle flexible argument order. */ /* If the field `flag' is not NULL, it points to a variable that is set to the value given in the field `val' when the option is found, but left unchanged if the option is not found. To have a long-named option do something other than set an `int' to a compiled-in constant, such as set a value from `custom_optarg', set the option's `flag' field to zero and its `val' field to a nonzero value (the equivalent single-letter option character, if there is one). For long options that have a zero `flag' field, `getopt' returns the contents of the `val' field. */ /* Names for the values of the `has_arg' field of `struct option'. */ #ifndef no_argument #define no_argument 0 #endif #ifndef required_argument #define required_argument 1 #endif #ifndef optional_argument #define optional_argument 2 #endif struct custom_getopt_data { /* * These have exactly the same meaning as the corresponding global variables, * except that they are used for the reentrant versions of getopt. */ int custom_optind; int custom_opterr; int custom_optopt; char *custom_optarg; /* True if the internal members have been initialized. */ int initialized; /* * The next char to be scanned in the option-element in which the last option * character we returned was found. This allows us to pick up the scan where * we left off. If this is zero, or a null string, it means resume the scan by * advancing to the next ARGV-element. */ char *nextchar; /* * Describe the part of ARGV that contains non-options that have been skipped. * `first_nonopt' is the index in ARGV of the first of them; `last_nonopt' is * the index after the last of them. */ int first_nonopt; int last_nonopt; }; /* * the variables optarg, optind, opterr and optopt are renamed with * the custom_ prefix so that they don't interfere with getopt ones. * * Moreover they're static so they are visible only from within the * file where this very file will be included. */ /* * For communication from `custom_getopt' to the caller. When `custom_getopt' finds an * option that takes an argument, the argument value is returned here. */ static char *custom_optarg; /* * Index in ARGV of the next element to be scanned. This is used for * communication to and from the caller and for communication between * successive calls to `custom_getopt'. * * On entry to `custom_getopt', 1 means this is the first call; initialize. * * When `custom_getopt' returns -1, this is the index of the first of the non-option * elements that the caller should itself scan. * * Otherwise, `custom_optind' communicates from one call to the next how much of ARGV * has been scanned so far. * * 1003.2 says this must be 1 before any call. */ static int custom_optind = 1; /* * Callers store zero here to inhibit the error message for unrecognized * options. */ static int custom_opterr = 1; /* * Set to an option character which was unrecognized. This must be initialized * on some systems to avoid linking in the system's own getopt implementation. */ static int custom_optopt = '?'; /* * Exchange two adjacent subsequences of ARGV. One subsequence is elements * [first_nonopt,last_nonopt) which contains all the non-options that have been * skipped so far. The other is elements [last_nonopt,custom_optind), which contains * all the options processed since those non-options were skipped. * `first_nonopt' and `last_nonopt' are relocated so that they describe the new * indices of the non-options in ARGV after they are moved. */ static void exchange(char **argv, struct custom_getopt_data *d) { int bottom = d->first_nonopt; int middle = d->last_nonopt; int top = d->custom_optind; char *tem; /* * Exchange the shorter segment with the far end of the longer segment. * That puts the shorter segment into the right place. It leaves the * longer segment in the right place overall, but it consists of two * parts that need to be swapped next. */ while (top > middle && middle > bottom) { if (top - middle > middle - bottom) { /* Bottom segment is the short one. */ int len = middle - bottom; int i; /* Swap it with the top part of the top segment. */ for (i = 0; i < len; i++) { tem = argv[bottom + i]; argv[bottom + i] = argv[top - (middle - bottom) + i]; argv[top - (middle - bottom) + i] = tem; } /* Exclude the moved bottom segment from further swapping. */ top -= len; } else { /* Top segment is the short one. */ int len = top - middle; int i; /* Swap it with the bottom part of the bottom segment. */ for (i = 0; i < len; i++) { tem = argv[bottom + i]; argv[bottom + i] = argv[middle + i]; argv[middle + i] = tem; } /* Exclude the moved top segment from further swapping. */ bottom += len; } } /* Update records for the slots the non-options now occupy. */ d->first_nonopt += (d->custom_optind - d->last_nonopt); d->last_nonopt = d->custom_optind; } /* Initialize the internal data when the first call is made. */ static void custom_getopt_initialize(struct custom_getopt_data *d) { /* * Start processing options with ARGV-element 1 (since ARGV-element 0 * is the program name); the sequence of previously skipped non-option * ARGV-elements is empty. */ d->first_nonopt = d->last_nonopt = d->custom_optind; d->nextchar = NULL; d->initialized = 1; } #define NONOPTION_P (argv[d->custom_optind][0] != '-' || argv[d->custom_optind][1] == '\0') /* return: zero: continue, nonzero: return given value to user */ static int shuffle_argv(int argc, char *const *argv,const struct option *longopts, struct custom_getopt_data *d) { /* * Give FIRST_NONOPT & LAST_NONOPT rational values if CUSTOM_OPTIND has been * moved back by the user (who may also have changed the arguments). */ if (d->last_nonopt > d->custom_optind) d->last_nonopt = d->custom_optind; if (d->first_nonopt > d->custom_optind) d->first_nonopt = d->custom_optind; /* * If we have just processed some options following some * non-options, exchange them so that the options come first. */ if (d->first_nonopt != d->last_nonopt && d->last_nonopt != d->custom_optind) exchange((char **) argv, d); else if (d->last_nonopt != d->custom_optind) d->first_nonopt = d->custom_optind; /* * Skip any additional non-options and extend the range of * non-options previously skipped. */ while (d->custom_optind < argc && NONOPTION_P) d->custom_optind++; d->last_nonopt = d->custom_optind; /* * The special ARGV-element `--' means premature end of options. Skip * it like a null option, then exchange with previous non-options as if * it were an option, then skip everything else like a non-option. */ if (d->custom_optind != argc && !strcmp(argv[d->custom_optind], "--")) { d->custom_optind++; if (d->first_nonopt != d->last_nonopt && d->last_nonopt != d->custom_optind) exchange((char **) argv, d); else if (d->first_nonopt == d->last_nonopt) d->first_nonopt = d->custom_optind; d->last_nonopt = argc; d->custom_optind = argc; } /* * If we have done all the ARGV-elements, stop the scan and back over * any non-options that we skipped and permuted. */ if (d->custom_optind == argc) { /* * Set the next-arg-index to point at the non-options that we * previously skipped, so the caller will digest them. */ if (d->first_nonopt != d->last_nonopt) d->custom_optind = d->first_nonopt; return -1; } /* * If we have come to a non-option and did not permute it, either stop * the scan or describe it to the caller and pass it by. */ if (NONOPTION_P) { d->custom_optarg = argv[d->custom_optind++]; return 1; } /* * We have found another option-ARGV-element. Skip the initial * punctuation. */ d->nextchar = (argv[d->custom_optind] + 1 + (longopts != NULL && argv[d->custom_optind][1] == '-')); return 0; } /* * Check whether the ARGV-element is a long option. * * If there's a long option "fubar" and the ARGV-element is "-fu", consider * that an abbreviation of the long option, just like "--fu", and not "-f" with * arg "u". * * This distinction seems to be the most useful approach. * */ static int check_long_opt(int argc, char *const *argv, const char *optstring, const struct option *longopts, int *longind, int print_errors, struct custom_getopt_data *d) { char *nameend; const struct option *p; const struct option *pfound = NULL; int exact = 0; int ambig = 0; int indfound = -1; int option_index; for (nameend = d->nextchar; *nameend && *nameend != '='; nameend++) /* Do nothing. */ ; /* Test all long options for either exact match or abbreviated matches */ for (p = longopts, option_index = 0; p->name; p++, option_index++) if (!strncmp(p->name, d->nextchar, nameend - d->nextchar)) { if ((unsigned int) (nameend - d->nextchar) == (unsigned int) strlen(p->name)) { /* Exact match found. */ pfound = p; indfound = option_index; exact = 1; break; } else if (pfound == NULL) { /* First nonexact match found. */ pfound = p; indfound = option_index; } else if (pfound->has_arg != p->has_arg || pfound->flag != p->flag || pfound->val != p->val) /* Second or later nonexact match found. */ ambig = 1; } if (ambig && !exact) { if (print_errors) { fprintf(stderr, "%s: option `%s' is ambiguous\n", argv[0], argv[d->custom_optind]); } d->nextchar += strlen(d->nextchar); d->custom_optind++; d->custom_optopt = 0; return '?'; } if (pfound) { option_index = indfound; d->custom_optind++; if (*nameend) { if (pfound->has_arg != no_argument) d->custom_optarg = nameend + 1; else { if (print_errors) { if (argv[d->custom_optind - 1][1] == '-') { /* --option */ fprintf(stderr, "%s: option `--%s' doesn't allow an argument\n", argv[0], pfound->name); } else { /* +option or -option */ fprintf(stderr, "%s: option `%c%s' doesn't allow an argument\n", argv[0], argv[d->custom_optind - 1][0], pfound->name); } } d->nextchar += strlen(d->nextchar); d->custom_optopt = pfound->val; return '?'; } } else if (pfound->has_arg == required_argument) { if (d->custom_optind < argc) d->custom_optarg = argv[d->custom_optind++]; else { if (print_errors) { fprintf(stderr, "%s: option `%s' requires an argument\n", argv[0], argv[d->custom_optind - 1]); } d->nextchar += strlen(d->nextchar); d->custom_optopt = pfound->val; return optstring[0] == ':' ? ':' : '?'; } } d->nextchar += strlen(d->nextchar); if (longind != NULL) *longind = option_index; if (pfound->flag) { *(pfound->flag) = pfound->val; return 0; } return pfound->val; } /* * Can't find it as a long option. If this is not getopt_long_only, or * the option starts with '--' or is not a valid short option, then * it's an error. Otherwise interpret it as a short option. */ if (print_errors) { if (argv[d->custom_optind][1] == '-') { /* --option */ fprintf(stderr, "%s: unrecognized option `--%s'\n", argv[0], d->nextchar); } else { /* +option or -option */ fprintf(stderr, "%s: unrecognized option `%c%s'\n", argv[0], argv[d->custom_optind][0], d->nextchar); } } d->nextchar = (char *) ""; d->custom_optind++; d->custom_optopt = 0; return '?'; } static int check_short_opt(int argc, char *const *argv, const char *optstring, int print_errors, struct custom_getopt_data *d) { char c = *d->nextchar++; const char *temp = strchr(optstring, c); /* Increment `custom_optind' when we start to process its last character. */ if (*d->nextchar == '\0') ++d->custom_optind; if (!temp || c == ':') { if (print_errors) fprintf(stderr, "%s: invalid option -- %c\n", argv[0], c); d->custom_optopt = c; return '?'; } if (temp[1] == ':') { if (temp[2] == ':') { /* This is an option that accepts an argument optionally. */ if (*d->nextchar != '\0') { d->custom_optarg = d->nextchar; d->custom_optind++; } else d->custom_optarg = NULL; d->nextchar = NULL; } else { /* This is an option that requires an argument. */ if (*d->nextchar != '\0') { d->custom_optarg = d->nextchar; /* * If we end this ARGV-element by taking the * rest as an arg, we must advance to the next * element now. */ d->custom_optind++; } else if (d->custom_optind == argc) { if (print_errors) { fprintf(stderr, "%s: option requires an argument -- %c\n", argv[0], c); } d->custom_optopt = c; if (optstring[0] == ':') c = ':'; else c = '?'; } else /* * We already incremented `custom_optind' once; * increment it again when taking next ARGV-elt * as argument. */ d->custom_optarg = argv[d->custom_optind++]; d->nextchar = NULL; } } return c; } /* * Scan elements of ARGV for option characters given in OPTSTRING. * * If an element of ARGV starts with '-', and is not exactly "-" or "--", * then it is an option element. The characters of this element * (aside from the initial '-') are option characters. If `getopt' * is called repeatedly, it returns successively each of the option characters * from each of the option elements. * * If `getopt' finds another option character, it returns that character, * updating `custom_optind' and `nextchar' so that the next call to `getopt' can * resume the scan with the following option character or ARGV-element. * * If there are no more option characters, `getopt' returns -1. * Then `custom_optind' is the index in ARGV of the first ARGV-element * that is not an option. (The ARGV-elements have been permuted * so that those that are not options now come last.) * * OPTSTRING is a string containing the legitimate option characters. * If an option character is seen that is not listed in OPTSTRING, * return '?' after printing an error message. If you set `custom_opterr' to * zero, the error message is suppressed but we still return '?'. * * If a char in OPTSTRING is followed by a colon, that means it wants an arg, * so the following text in the same ARGV-element, or the text of the following * ARGV-element, is returned in `custom_optarg'. Two colons mean an option that * wants an optional arg; if there is text in the current ARGV-element, * it is returned in `custom_optarg', otherwise `custom_optarg' is set to zero. * * If OPTSTRING starts with `-' or `+', it requests different methods of * handling the non-option ARGV-elements. * See the comments about RETURN_IN_ORDER and REQUIRE_ORDER, above. * * Long-named options begin with `--' instead of `-'. * Their names may be abbreviated as long as the abbreviation is unique * or is an exact match for some defined option. If they have an * argument, it follows the option name in the same ARGV-element, separated * from the option name by a `=', or else the in next ARGV-element. * When `getopt' finds a long-named option, it returns 0 if that option's * `flag' field is nonzero, the value of the option's `val' field * if the `flag' field is zero. * * The elements of ARGV aren't really const, because we permute them. * But we pretend they're const in the prototype to be compatible * with other systems. * * LONGOPTS is a vector of `struct option' terminated by an * element containing a name which is zero. * * LONGIND returns the index in LONGOPT of the long-named option found. * It is only valid when a long-named option has been found by the most * recent call. * * Return the option character from OPTS just read. Return -1 when there are * no more options. For unrecognized options, or options missing arguments, * `custom_optopt' is set to the option letter, and '?' is returned. * * The OPTS string is a list of characters which are recognized option letters, * optionally followed by colons, specifying that that letter takes an * argument, to be placed in `custom_optarg'. * * If a letter in OPTS is followed by two colons, its argument is optional. * This behavior is specific to the GNU `getopt'. * * The argument `--' causes premature termination of argument scanning, * explicitly telling `getopt' that there are no more options. If OPTS begins * with `--', then non-option arguments are treated as arguments to the option * '\0'. This behavior is specific to the GNU `getopt'. */ static int getopt_internal_r(int argc, char *const *argv, const char *optstring, const struct option *longopts, int *longind, struct custom_getopt_data *d) { int ret, print_errors = d->custom_opterr; if (optstring[0] == ':') print_errors = 0; if (argc < 1) return -1; d->custom_optarg = NULL; /* * This is a big difference with GNU getopt, since optind == 0 * means initialization while here 1 means first call. */ if (d->custom_optind == 0 || !d->initialized) { if (d->custom_optind == 0) d->custom_optind = 1; /* Don't scan ARGV[0], the program name. */ custom_getopt_initialize(d); } if (d->nextchar == NULL || *d->nextchar == '\0') { ret = shuffle_argv(argc, argv, longopts, d); if (ret) return ret; } if (longopts && (argv[d->custom_optind][1] == '-' )) return check_long_opt(argc, argv, optstring, longopts, longind, print_errors, d); return check_short_opt(argc, argv, optstring, print_errors, d); } static int custom_getopt_internal(int argc, char *const *argv, const char *optstring, const struct option *longopts, int *longind) { int result; /* Keep a global copy of all internal members of d */ static struct custom_getopt_data d; d.custom_optind = custom_optind; d.custom_opterr = custom_opterr; result = getopt_internal_r(argc, argv, optstring, longopts, longind, &d); custom_optind = d.custom_optind; custom_optarg = d.custom_optarg; custom_optopt = d.custom_optopt; return result; } static int custom_getopt_long (int argc, char *const *argv, const char *options, const struct option *long_options, int *opt_index) { return custom_getopt_internal(argc, argv, options, long_options, opt_index); } static char *package_name = 0; /** * @brief updates an option * @param field the generic pointer to the field to update * @param orig_field the pointer to the orig field * @param field_given the pointer to the number of occurrence of this option * @param prev_given the pointer to the number of occurrence already seen * @param value the argument for this option (if null no arg was specified) * @param possible_values the possible values for this option (if specified) * @param default_value the default value (in case the option only accepts fixed values) * @param arg_type the type of this option * @param check_ambiguity @see cmdline_parser_params.check_ambiguity * @param override @see cmdline_parser_params.override * @param no_free whether to free a possible previous value * @param multiple_option whether this is a multiple option * @param long_opt the corresponding long option * @param short_opt the corresponding short option (or '-' if none) * @param additional_error possible further error specification */ static int update_arg(void *field, char **orig_field, unsigned int *field_given, unsigned int *prev_given, char *value, const char *possible_values[], const char *default_value, cmdline_parser_arg_type arg_type, int check_ambiguity, int override, int no_free, int multiple_option, const char *long_opt, char short_opt, const char *additional_error) { char *stop_char = 0; const char *val = value; int found; char **string_field; FIX_UNUSED (field); stop_char = 0; found = 0; if (!multiple_option && prev_given && (*prev_given || (check_ambiguity && *field_given))) { if (short_opt != '-') fprintf (stderr, "%s: `--%s' (`-%c') option given more than once%s\n", package_name, long_opt, short_opt, (additional_error ? additional_error : "")); else fprintf (stderr, "%s: `--%s' option given more than once%s\n", package_name, long_opt, (additional_error ? additional_error : "")); return 1; /* failure */ } FIX_UNUSED (default_value); if (field_given && *field_given && ! override) return 0; if (prev_given) (*prev_given)++; if (field_given) (*field_given)++; if (possible_values) val = possible_values[found]; switch(arg_type) { case ARG_STRING: if (val) { string_field = (char **)field; if (!no_free && *string_field) free (*string_field); /* free previous string */ *string_field = gengetopt_strdup (val); } break; default: break; }; /* store the original value */ switch(arg_type) { case ARG_NO: break; default: if (value && orig_field) { if (no_free) { *orig_field = value; } else { if (*orig_field) free (*orig_field); /* free previous string */ *orig_field = gengetopt_strdup (value); } } }; return 0; /* OK */ } int cmdline_parser_internal ( int argc, char **argv, struct gengetopt_args_info *args_info, struct cmdline_parser_params *params, const char *additional_error) { int c; /* Character of the parsed option. */ int error_occurred = 0; struct gengetopt_args_info local_args_info; int override; int initialize; int check_required; int check_ambiguity; char *optarg; int optind; int opterr; int optopt; package_name = argv[0]; override = params->override; initialize = params->initialize; check_required = params->check_required; check_ambiguity = params->check_ambiguity; if (initialize) cmdline_parser_init (args_info); cmdline_parser_init (&local_args_info); optarg = 0; optind = 0; opterr = params->print_errors; optopt = '?'; while (1) { int option_index = 0; static struct option long_options[] = { { "help", 0, NULL, 'h' }, { "full-help", 0, NULL, 0 }, { "version", 0, NULL, 'V' }, { "render-png", 1, NULL, 'r' }, { "save", 1, NULL, 0 }, { 0, 0, 0, 0 } }; custom_optarg = optarg; custom_optind = optind; custom_opterr = opterr; custom_optopt = optopt; c = custom_getopt_long (argc, argv, "hVr:", long_options, &option_index); optarg = custom_optarg; optind = custom_optind; opterr = custom_opterr; optopt = custom_optopt; if (c == -1) break; /* Exit from `while (1)' loop. */ switch (c) { case 'h': /* Print help and exit. */ cmdline_parser_print_help (); cmdline_parser_free (&local_args_info); exit (EXIT_SUCCESS); case 'V': /* Print version and exit. */ cmdline_parser_print_version (); cmdline_parser_free (&local_args_info); exit (EXIT_SUCCESS); case 'r': /* Renders target svg file to FileName.png. */ if (update_arg( (void *)&(args_info->render_png_arg), &(args_info->render_png_orig), &(args_info->render_png_given), &(local_args_info.render_png_given), optarg, 0, 0, ARG_STRING, check_ambiguity, override, 0, 0, "render-png", 'r', additional_error)) goto failure; break; case 0: /* Long option with no short option */ if (strcmp (long_options[option_index].name, "full-help") == 0) { cmdline_parser_print_full_help (); cmdline_parser_free (&local_args_info); exit (EXIT_SUCCESS); } /* Saves file to FileName.svg in svg format (for testing purposes). */ if (strcmp (long_options[option_index].name, "save") == 0) { if (update_arg( (void *)&(args_info->save_arg), &(args_info->save_orig), &(args_info->save_given), &(local_args_info.save_given), optarg, 0, 0, ARG_STRING, check_ambiguity, override, 0, 0, "save", '-', additional_error)) goto failure; } break; case '?': /* Invalid option. */ /* `getopt_long' already printed an error message. */ goto failure; default: /* bug: option not considered. */ fprintf (stderr, "%s: option unknown: %c%s\n", CMDLINE_PARSER_PACKAGE, c, (additional_error ? additional_error : "")); abort (); } /* switch */ } /* while */ cmdline_parser_release (&local_args_info); if ( error_occurred ) return (EXIT_FAILURE); if (optind < argc) { int i = 0 ; int found_prog_name = 0; /* whether program name, i.e., argv[0], is in the remaining args (this may happen with some implementations of getopt, but surely not with the one included by gengetopt) */ args_info->inputs_num = argc - optind - found_prog_name; args_info->inputs = (char **)(malloc ((args_info->inputs_num)*sizeof(char *))) ; while (optind < argc) args_info->inputs[ i++ ] = gengetopt_strdup (argv[optind++]) ; } return 0; failure: cmdline_parser_release (&local_args_info); return (EXIT_FAILURE); }

[ "predelnik@gmail.com" ]

predelnik@gmail.com

0ce1705be0ac31f1e99b5a49599c1200ff88361a

17f2dd4fde9cbcd9b3b0cd101fc740d3495bbe80

/165 - 红黑树/RedBlackTree.hpp

3fb9d65f73f1e5745b5d1f036505554ddece371c

[ "Apache-2.0" ]

permissive

NekoSilverFox/CPP

0a7f48b50ee1769bb5ba318fb6fb6c6c342e5544

c6797264fceda4a65ac3452acca496e468d1365a

refs/heads/master

2021-11-11T17:48:48.514822

2021-11-01T20:30:31

230,780,197

11

7

null

2021-04-11T22:24:56

2019-12-29T17:12:19

C++

GB18030

C++

false

8,178

hpp

#pragma once #include "MyErrorInfo.h" #include <iostream> #define red true #define black false class RedBlackTree { private: struct Node { Node() : key_(0), colour_(red), p_(nullptr), left_(nullptr), right_(nullptr) {} Node(int key) : key_(key), colour_(red), p_(nullptr), left_(nullptr), right_(nullptr) {} int key_; bool colour_; // red - true; black - false; Node* p_; Node* left_; Node* right_; }; Node* root_; public: RedBlackTree() { root_ = new Node; root_->key_ = -1; root_->colour_ = red; root_->p_ = nullptr; root_->left_ = nullptr; root_->right_ = nullptr; } void insert(int key_insert) { /* * bool init 为标识符，判断是否为第一个插入的节点，如果是，直接将 root_结点更新为 key_insert */ static bool init = false; if (false == init) { init = true; root_->key_ = key_insert; root_->colour_ = black; } else { Node* node_insert = new Node; node_insert->key_ = key_insert; insertNode(root_, node_insert); } } void foreach() { foreachRBTree(root_); } private: void insertNode(Node* root, Node* node_insert) { if (nullptr == root) throw MyErrorInfo("nullptr_in_insertNode"); if (node_insert->key_ > root->key_) { if (nullptr != root->right_) { insertNode(root->right_, node_insert); } else { root->right_ = node_insert; node_insert->p_ = root; judgmentAdjustmentCondition(node_insert); } } else if (node_insert->key_ < root->key_) { if (nullptr != root->left_) { insertNode(root->left_, node_insert); } else { root->left_ = node_insert; node_insert->p_ = root; judgmentAdjustmentCondition(node_insert); } } else { return; } } void foreachRBTree(Node* root) { if (nullptr == root) return; foreachRBTree(root->left_); std::cout << root->key_ << " "; foreachRBTree(root->right_); } int judgmentAdjustmentCondition(Node* node) { if (nullptr == node) throw MyErrorInfo("nullptr_node_judgmentAdjustmentCondition"); if (nullptr == node->p_) return 0; if (black == node->p_->colour_) { cout << "\033[31m (2) \033[0m"; return 2; } else if (red == node->p_->colour_) { // 叔叔结点存在，且为红结点 if ( node->p_ == node->p_->p_->left_ && nullptr != node->p_->p_->right_ && red == node->p_->p_->right_->colour_ ) { adjustRedBlackTree_411(node); cout << "\033[31m (411) \033[0m"; return 411; } // 叔叔结点存在，且为红结点 else if ( node->p_ == node->p_->p_->right_ && nullptr != node->p_->p_->left_ && red == node->p_->p_->left_->colour_ ) { adjustRedBlackTree_412(node); cout << "\033[31m (412) \033[0m"; return 412; } else if ( (node->p_ == node->p_->p_->left_) && ( nullptr == node->p_->p_->right_ || black == node->p_->p_->right_->colour_ ) ) { if (node == node->p_->left_) { adjustRedBlackTree_421(node); cout << "\033[31m (421) \033[0m"; return 421; } if (node == node->p_->right_) { adjustRedBlackTree_422(node); cout << "\033[31m (422) \033[0m"; return 422; } } else if ( (node->p_ == node->p_->p_->right_) && ( nullptr == node->p_->p_->left_ || black == node->p_->p_->left_->colour_ ) ) { if (node == node->p_->left_) { adjustRedBlackTree_431(node); cout << "\033[31m (431) \033[0m"; return 431; } else if (node == node->p_->right_) { adjustRedBlackTree_432(node); cout << "\033[31m (432) \033[0m"; return 432; } } } else { return 0; } } // 叔叔结点存在，且为红结点 void adjustRedBlackTree_411(Node* node) { if (nullptr == node) throw MyErrorInfo("nullptr_node_in_411"); // 把父节点和叔叔结点设为black node->p_->colour_ = black; node->p_->p_->right_->colour_ = black; // 把爷爷设为 red node->p_->p_->colour_ = red; judgmentAdjustmentCondition(node->p_->p_); #if 0 // 将 pp 设为待插入的结点，如果 pp 的父节点为红，需要继续做自平衡处理 if (red == node->p_->p_->p_->colour_) { Node* tempNode = node->p_->p_; adjustRedBlackTree_411(tempNode); } #endif } // 叔叔结点存在，且为红结点 void adjustRedBlackTree_412(Node* node) { if (nullptr == node) throw MyErrorInfo("nullptr_node_in_412"); // 把父节点和叔叔结点设为black node->p_->colour_ = black; node->p_->p_->right_->colour_ = black; // 把爷爷设为 red node->p_->p_->colour_ = red; judgmentAdjustmentCondition(node->p_->p_); #if 0 // 将 pp 设为待插入的结点，如果 pp 的父节点为红，需要继续做自平衡处理 if (red == node->p_->p_->p_->colour_) { Node* tempNode = node->p_->p_; adjustRedBlackTree_411(tempNode); } #endif } // 叔叔结点不存在，或者为黑结点，并且插入的结点是父节点是祖父结点的左节点 // 插入节点是其父节点的左节点 void adjustRedBlackTree_421(Node* node) { if (nullptr == node) throw MyErrorInfo("nullptr_node_in_421"); node->p_->colour_ = black; node->p_->p_->colour_ = red; // 对pp进行右旋 // 缓存一下 pp Node* temp_pp = node->p_->p_; if (nullptr != temp_pp->p_) { if (temp_pp->p_->left_ == temp_pp) { temp_pp->p_->left_ = node->p_; } else if (temp_pp->p_->right_ == temp_pp) { temp_pp->p_->right_ = node->p_; } node->p_->right_ = temp_pp; temp_pp->left_ = nullptr; temp_pp->p_ = node->p_; } else { root_ = node->p_; root_->p_ = nullptr; root_->left_ = node; node->p_ = root_; root_->right_ = temp_pp; temp_pp->left_ = nullptr; temp_pp->p_ = root_; //node->p_->p_ = node->p_; //node->p_->p_ = nullptr; //node->p_->right_ = temp_pp; //temp_pp->p_ = node->p_; //temp_pp->left_ = nullptr; } } // 叔叔结点不存在，或者为黑结点，并且插入的结点是父节点是祖父结点的左节点 // 插入节点是其父节点的右节点 void adjustRedBlackTree_422(Node* node) { if (nullptr == node) throw MyErrorInfo("nullptr_node_in_422"); // 对p进行左旋 // 缓存一下 p Node* temp_p = node->p_; //if (temp_p->p_->left_ == temp_p->p_) //{ // temp_p->p_->left_ = node; //} //else if (temp_p->p_->right_ == temp_p->p_) //{ // temp_p->p_->right_ == node; //} node->p_->p_->left_ = node; node->p_ = temp_p->p_; node->right_ = temp_p; temp_p->p_ = node; temp_p->right_ = nullptr; // 把 p 设置为插入节点，得到情景 4.2.1 // 进行 4.2.1 的处理 adjustRedBlackTree_421(temp_p); } // 叔叔结点不存在或为黑结点，并且插入的结点的父节点是祖父节点的右节点 // 插入节点是父节点的右节点 void adjustRedBlackTree_431(Node* node) { if (nullptr == node) throw MyErrorInfo("nullptr_node_in_431"); // 将 p 设为黑色 node->p_->colour_ = black; // 将 pp 设为红色 node->p_->p_->colour_ = red; // 将 pp 进行左旋 Node* temp_pp = node->p_->p_; if (nullptr != temp_pp->p_) { if (temp_pp->p_->left_ == temp_pp) { temp_pp->p_->left_ = node->p_; } else if (temp_pp->p_->right_ == temp_pp) { temp_pp->p_->right_ = node->p_; } node->p_ = temp_pp->p_; node->left_ = temp_pp; temp_pp->p_ = node->p_; temp_pp->right_ = nullptr; } else { root_ = node->p_; root_->p_ = nullptr; root_->left_ = temp_pp; temp_pp->p_ = root_; temp_pp->right_ = nullptr; //node->p_ = temp_pp->p_; //node->p_->left_ = temp_pp; //temp_pp->p_ = node->p_; //temp_pp->right_ = nullptr; } } void adjustRedBlackTree_432(Node* node) { if (nullptr == node) throw MyErrorInfo("nullptr_node_in_432"); Node* temp_p = node->p_; node->p_->p_->right_ = node; node->right_ = temp_p; node->p_ = temp_p->p_; temp_p->p_ = node; temp_p->left_ = nullptr; //temp_p->p_->right_ = node; //node->p_ = temp_p->p_; //node->right_ = temp_p; //temp_p->left_ = nullptr; adjustRedBlackTree_431(temp_p); } };

[ "weidufox@gmail.com" ]

weidufox@gmail.com

94be2c3827807df886ed80becf07e7104a58cc34

fe81eae22f5662b6b6dca838b6972be27ca63b2d

/aorus/AORUS/inc/kb/KbCfg.cpp

236b31773491b9980cb9a0e63a4d10927afdbd1c

[]

no_license

josephx86/Aorus

d014c1d97131cfb7201ab0352b38e2bc4adb007e

8f9dcd4a4b55176d4575d9309e8536fbc8008b60

refs/heads/master

2021-05-05T19:29:47.147219

2017-07-25T09:36:08

null

0

null

UTF-8

C++

false

5,414

cpp

#include "StdAfx.h" #include "KbCfg.h" KB_CLR_CFG::_KB_CLR_CFG() { nCount = 1; ZeroMemory(clrList, sizeof(COLORREF) * 10); clrList[0] = 255; } KB_CLR_CFG::_KB_CLR_CFG(int nType) { switch(nType) { case 0: clrList[0] = s_clrKbLed[0]; nCount = 1; break; case 1: clrList[0] = s_clrKbLed[0]; clrList[1] = s_clrKbLed[1]; nCount = 2; break; case 2: clrList[0] = s_clrKbLed[0]; nCount = 0; break; case 3: clrList[0] = s_clrKbLed[0]; clrList[1] = s_clrKbLed[1]; clrList[2] = s_clrKbLed[2]; clrList[3] = s_clrKbLed[3]; clrList[4] = s_clrKbLed[4]; clrList[5] = s_clrKbLed[5]; clrList[6] = s_clrKbLed[6]; nCount = 7; break; case 4: clrList[0] = s_clrKbLed[0]; clrList[1] = s_clrKbLed[1]; clrList[2] = s_clrKbLed[2]; clrList[3] = s_clrKbLed[3]; clrList[4] = s_clrKbLed[4]; clrList[5] = s_clrKbLed[5]; clrList[6] = s_clrKbLed[7]; nCount = 7; break; case 5: clrList[0] = s_clrKbLed[0]; clrList[1] = s_clrKbLed[1]; clrList[2] = s_clrKbLed[2]; clrList[3] = s_clrKbLed[3]; clrList[4] = s_clrKbLed[4]; clrList[5] = s_clrKbLed[5]; clrList[6] = s_clrKbLed[7]; nCount = 7; break; } } KB_LED_CFG::_KB_LED_CFG() { nType = 1; nSpeed = 10; nBrightness = 10; nStartWay = START_AUTO; nTimes = 2; nWidth = 2; nAngle = 0; nClrCount = 0; bOn = true; } void KB_LED_CFG::Def(int nType) { switch(nType) { case 1: nType = LED_CONSISTENT; nSpeed = 10; nBrightness = 10; nStartWay = START_AUTO; nTimes = 2; nWidth = 2; nAngle = 0; bOn = true; nClrCount = 1; clrCfg[0].clrList[0] = s_clrKbLed[0]; clrCfg[0].nCount = 1; break; case 2: nType = LED_PULSING; nSpeed = 10; nBrightness = 10; nStartWay = START_AUTO; nTimes = 2; nWidth = 2; nAngle = 0; nClrCount = 1; bOn = true; clrCfg[0].clrList[0] = s_clrKbLed[0]; clrCfg[0].clrList[1] = s_clrKbLed[1]; clrCfg[0].nCount = 2; break; case 3: nType = LED_REACTIVE; nSpeed = 10; nBrightness = 10; nStartWay = START_AUTO; nTimes = 2; nWidth = 1; nAngle = 1; nClrCount = 1; bOn = true; clrCfg[0].clrList[0] = s_clrKbLed[0]; clrCfg[0].nCount = 0; break; case 4: nType = LED_RIPPLE; nSpeed = 10; nBrightness = 10; nStartWay = START_PRESS; nTimes = 1; nWidth = 1; nAngle = 0; nClrCount = 1; bOn = true; clrCfg[0].clrList[0] = s_clrKbLed[0]; clrCfg[0].clrList[1] = s_clrKbLed[1]; clrCfg[0].clrList[2] = s_clrKbLed[2]; clrCfg[0].clrList[3] = s_clrKbLed[3]; clrCfg[0].clrList[4] = s_clrKbLed[4]; clrCfg[0].clrList[5] = s_clrKbLed[5]; clrCfg[0].clrList[6] = s_clrKbLed[6]; clrCfg[0].nCount = 7; break; case 5: nType = LED_CYCLING; nSpeed = 10; nBrightness = 10; nStartWay = START_AUTO; nTimes = 0; nWidth = 2; nAngle = 0; nClrCount = 1; bOn = true; clrCfg[0].clrList[0] = s_clrKbLed[0]; clrCfg[0].clrList[1] = s_clrKbLed[1]; clrCfg[0].clrList[2] = s_clrKbLed[2]; clrCfg[0].clrList[3] = s_clrKbLed[3]; clrCfg[0].clrList[4] = s_clrKbLed[4]; clrCfg[0].clrList[5] = s_clrKbLed[5]; clrCfg[0].clrList[6] = s_clrKbLed[7]; clrCfg[0].nCount = 7; break; case 6: nType = LED_WAVE; nSpeed = 10; nBrightness = 10; nStartWay = START_PRESS; nTimes = 1; nWidth = 2; nAngle = 0; nClrCount = 1; bOn = true; clrCfg[0].clrList[0] = s_clrKbLed[0]; clrCfg[0].clrList[1] = s_clrKbLed[1]; clrCfg[0].clrList[2] = s_clrKbLed[2]; clrCfg[0].clrList[3] = s_clrKbLed[3]; clrCfg[0].clrList[4] = s_clrKbLed[4]; clrCfg[0].clrList[5] = s_clrKbLed[5]; clrCfg[0].clrList[6] = s_clrKbLed[7]; clrCfg[0].nCount = 7; break; } } ////////////////////////////////////////////////////////////////////////// CKbCfg::CKbCfg(void) { } CKbCfg::~CKbCfg(void) { } void CKbCfg::SetClrCfg(KB_CLR_CFG cfg, int nType, int nIndex) { CIniFile ini; CString sPath = CKbLedCtrl::GetCfgPath(-1) + _T("present.ini"); ini.SetIniFile(sPath); CString sSession; sSession.Format(_T("T%d_%d"), nType, nIndex); for (int m = 0; m < cfg.nCount; m++) { CString sKey; sKey.Format(_T("C%d"), m); ini.SetIniInfo(sSession, sKey, cfg.clrList[m]); } ini.SetIniInfo(sSession, _T("Count"), cfg.nCount); } void CKbCfg::SetClrCfgs(KB_CLR_CFG cfg[], int nType, int nCount) { CIniFile ini; CString sPath = CKbLedCtrl::GetCfgPath(-1) + _T("present.ini"); ini.SetIniFile(sPath); CString sSession; for (int n = 0; n < nCount; n++) { sSession.Format(_T("T%d_%d"), nType, n); for (int m = 0; m < cfg[n].nCount; m++) { CString sKey; sKey.Format(_T("C%d"), m); ini.SetIniInfo(sSession, sKey, cfg[n].clrList[m]); } ini.SetIniInfo(sSession, _T("Count"), cfg[n].nCount); } sSession.Format(_T("T%d"), nType); ini.SetIniInfo(sSession, _T("Count"), nCount); } void CKbCfg::GetClrCfgs(KB_CLR_CFG cfg[], int nType, int& nCount) { CIniFile ini; CString sPath = CKbLedCtrl::GetCfgPath(-1) + _T("present.ini"); ini.SetIniFile(sPath); CString sSession; sSession.Format(_T("T%d"), nType); BOOL bGet = ini.GetIniInfo(sSession, _T("Count"), nCount); if (!bGet) { KB_CLR_CFG cfgDefault(nType); cfg[0] = cfgDefault; nCount = 1; SetClrCfgs(cfg, nType, nCount); return; } for (int n = 0; n < nCount; n++) { sSession.Format(_T("T%d_%d"), nType, n); ini.GetIniInfo(sSession, _T("Count"), cfg[n].nCount); for (int m = 0; m < cfg[n].nCount; m++) { CString sKey; sKey.Format(_T("C%d"), m); ini.GetIniInfo(sSession, sKey, cfg[n].clrList[m]); } } }

[ "925350731@qq.com" ]

925350731@qq.com

0dbe5447ac2492031d8bb18cc2ad6ebd48bac8cc

fbd1bd8238aa7af82fa68f0fbc3e5e2b4bebb9c0

/clock.cpp

f97da1a9984a5ce8c0873e6e6be5261469edf103

[ "MIT" ]

permissive

Oscar-Rod/Thermostat

785a42b4c7f76329dc78860aa3f75f0f473812ba

83dfb4f89b03f37a64da784a1df80973174f4425

refs/heads/main

2023-03-01T22:57:57.184350

2021-02-03T18:24:55

332,833,599

0

MIT

2021-02-03T18:24:55

2021-01-25T17:50:45

C++

UTF-8

C++

false

828

cpp

#include "clock.h" Clock::Clock() { } void Clock::init() { Wire.begin(); clockModule.setClockMode(false); } void Clock::setTime(int hour, int minute, int second) { clockModule.setHour(hour); clockModule.setMinute(minute); clockModule.setSecond(second); } int Clock::getTime(int *hour, int *minute, int *second) { currentMilis = millis(); if (currentMilis - previousMilis >= 1000){ previousMilis = currentMilis; *hour = clockModule.getHour(h12Flag, pmFlag); *minute = clockModule.getMinute(); *second = clockModule.getSecond(); } } bool Clock::isWeekend() { int dayOfWeek = getDayOfWeek(); if (dayOfWeek > 5) return true; else return false; } void Clock::setDayOfWeek(byte DayOfWeek) { clockModule.setDoW(DayOfWeek); } byte Clock::getDayOfWeek() { return clockModule.getDoW(); }

[ "rguez.r.os@gmail.com" ]

rguez.r.os@gmail.com

7e1501dd5f12879f2f22719b0a5d910bc623774b

afabc850e37f3d0242cef7af838236f9b863a30e

/tests/set_gravity.cpp

23024c2dfc149c9a1f608f328e1370698f6f89bc

[ "BSD-2-Clause", "BSD-3-Clause" ]

permissive

resibots/tsid

ca7057cdd8c3d5dde11fe5f9bf7dd6f6af6d7ce8

b0d6bff80292fb3451ca7ca438a4ab84b5b8c022

refs/heads/master

2023-03-07T14:33:32.767574

2021-10-19T14:17:22

251,612,829

1

0

null

2020-04-21T07:51:17

2020-03-31T13:36:42

null

UTF-8

C++

false

1,704

cpp

// // Copyright (c) 2017 CNRS // // This file is part of tsid // tsid is free software: you can redistribute it // and/or modify it under the terms of the GNU Lesser General Public // License as published by the Free Software Foundation, either version // 3 of the License, or (at your option) any later version. // tsid 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 Lesser Public License for more details. You should have // received a copy of the GNU Lesser General Public License along with // tsid If not, see // <http://www.gnu.org/licenses/>. // #include <iostream> #include <boost/test/unit_test.hpp> #include <boost/utility/binary.hpp> #include <tsid/math/utils.hpp> #include "tsid/robots/robot-wrapper.hpp" using namespace tsid; using namespace tsid::robots; using namespace std; using namespace pinocchio; typedef pinocchio::Motion Motion; BOOST_AUTO_TEST_SUITE ( BOOST_TEST_MODULE ) BOOST_AUTO_TEST_CASE ( test_set_gravity ) { const string romeo_model_path = TSID_SOURCE_DIR"/models/romeo"; vector<string> package_dirs; package_dirs.push_back(romeo_model_path); string urdfFileName = package_dirs[0] + "/urdf/romeo.urdf"; RobotWrapper robot(urdfFileName, package_dirs, pinocchio::JointModelFreeFlyer(), false); Motion g = pinocchio::Motion::Zero(); Motion init_gravity = robot.model().gravity; robot.setGravity(g); Motion no_gravity = robot.model().gravity; BOOST_CHECK(no_gravity != init_gravity); } BOOST_AUTO_TEST_SUITE_END ()

[ "noreply@github.com" ]

resibots.noreply@github.com

209e60843b7e137a184b774f69aa6413fa1b492c

6a47b5f04c74ed475b632e6561a675135e3baa80

/core/api/service/chain/impl/chain_api_impl.hpp

2957da258faf16eca6f9ff62966c090ca802cdca

[ "Apache-2.0" ]

permissive

DiamondNetwork/kagome

3f89afcc7432c7047b2ce2a3ef6bf7a6ee878423

c018130a5595eeb69e439ea4695c7b7db1c7ee43

refs/heads/master

2023-08-05T01:19:31.739959

2021-10-08T14:01:45

null

0

null

UTF-8

C++

false

2,661

hpp

/** * Copyright Soramitsu Co., Ltd. All Rights Reserved. * SPDX-License-Identifier: Apache-2.0 */ #ifndef KAGOME_CHAIN_API_IMPL_HPP #define KAGOME_CHAIN_API_IMPL_HPP #include <memory> #include "api/service/chain/chain_api.hpp" #include "blockchain/block_header_repository.hpp" #include "blockchain/block_storage.hpp" #include "blockchain/block_tree.hpp" namespace kagome::api { class ChainApiImpl : public ChainApi { public: ~ChainApiImpl() override = default; ChainApiImpl(std::shared_ptr<blockchain::BlockHeaderRepository> block_repo, std::shared_ptr<blockchain::BlockTree> block_tree, std::shared_ptr<blockchain::BlockStorage> block_storage); void setApiService( std::shared_ptr<api::ApiService> const &api_service) override; outcome::result<BlockHash> getBlockHash() const override; outcome::result<BlockHash> getBlockHash(BlockNumber value) const override; outcome::result<BlockHash> getBlockHash( std::string_view value) const override; outcome::result<std::vector<BlockHash>> getBlockHash( gsl::span<const ValueType> values) const override; outcome::result<primitives::BlockHeader> getHeader( std::string_view hash) override { OUTCOME_TRY(h, primitives::BlockHash::fromHexWithPrefix(hash)); return block_repo_->getBlockHeader(h); } outcome::result<primitives::BlockHeader> getHeader() override { auto last = block_tree_->getLastFinalized(); return block_repo_->getBlockHeader(last.hash); } outcome::result<primitives::BlockData> getBlock( std::string_view hash) override { OUTCOME_TRY(h, primitives::BlockHash::fromHexWithPrefix(hash)); return block_storage_->getBlockData(h); } outcome::result<primitives::BlockData> getBlock() override { auto last = block_tree_->getLastFinalized(); return block_storage_->getBlockData(last.hash); } outcome::result<primitives::BlockHash> getFinalizedHead() const override; outcome::result<uint32_t> subscribeFinalizedHeads() override; outcome::result<void> unsubscribeFinalizedHeads( uint32_t subscription_id) override; outcome::result<uint32_t> subscribeNewHeads() override; outcome::result<void> unsubscribeNewHeads( uint32_t subscription_id) override; private: std::shared_ptr<blockchain::BlockHeaderRepository> block_repo_; std::shared_ptr<blockchain::BlockTree> block_tree_; std::weak_ptr<api::ApiService> api_service_; std::shared_ptr<blockchain::BlockStorage> block_storage_; }; } // namespace kagome::api #endif // KAGOME_CHAIN_API_IMPL_HPP

[ "noreply@github.com" ]

DiamondNetwork.noreply@github.com

606bab50851eb5b8b34c3fb298e057efabdb181e

780f8126f04a71080a229b9b72b6b69b6f7b49d7

/multiview/multiview_cpp/src/perceive/cost-functions/features-2d/run-scharr.cpp

2192c7adead2511742ebb7c9943de6cc23d99726

[ "Apache-2.0" ]

permissive

shang766/multiview

b882ae5d1d84ee29609535c6a81b8a715453fcda

1a03e14855292967ffb0c0ec7fff855c5abbc9d2

refs/heads/main

2023-08-28T19:35:11.279270

2021-10-03T01:14:22

452,168,226

1

0

Apache-2.0

2022-01-26T06:42:52

2022-01-26T06:42:51

null

UTF-8

C++

false

3,062

cpp

#include "features-2d.hpp" #include "perceive/foundation.hpp" #include "perceive/geometry/vector.hpp" #include "perceive/graphics/colour-set.hpp" #include <opencv2/core.hpp> #include <opencv2/highgui/highgui.hpp> #include <opencv2/imgproc/imgproc.hpp> #include <opencv2/features2d/features2d.hpp> #include <opencv2/xfeatures2d.hpp> namespace perceive { // ---------------------------------------------------------------------- Scharr void run_scharr(ImageFeatures2d& ss, const cv::Mat& grey, const ImageFeatures2d::Params& p, std::function<bool(void)> is_canceled) { Expects(ss.w != 0); Expects(ss.h != 0); const auto w = ss.w; const auto h = ss.h; if(is_canceled()) return; unsigned blur_sz = p.scharr_blur_sz; double blur_sigma = p.scharr_blur_sigma; // Apply Gaussian blur auto sz = cv::Size(int(blur_sz), int(blur_sz)); cv::GaussianBlur(grey, grey, sz, blur_sigma, blur_sigma, cv::BORDER_DEFAULT); /// Generate grad_x and grad_y cv::Mat grad_x, grad_y; cv::Mat abs_grad_x, abs_grad_y; /// Gradient X and Y auto ddepth = CV_32F; // produce floating-point images Scharr(grey, grad_x, ddepth, 1, 0); Scharr(grey, grad_y, ddepth, 0, 1); if(is_canceled()) return; // Convert to a field... auto& field = ss.scharr; auto& invmag = ss.scharr_invmag; field.resize(grey.cols, grey.rows); invmag.resize(grey.cols, grey.rows); // Pack result into our field... auto dst = field.data(); auto d2 = invmag.data(); std::vector<real> mags; mags.reserve(size_t(grey.rows * grey.cols)); for(int y = 0; y < grey.rows; ++y) { const float* src_x = grad_x.ptr<const float>(y); const float* src_y = grad_y.ptr<const float>(y); for(int x = 0; x < grey.cols; ++x) { dst->x = real(*src_x++); dst->y = real(*src_y++); auto norm = dst->norm(); auto mag_inv = 1.0 / norm; mags.emplace_back(norm); // if(!std::isfinite(mag_inv)) { // cout << format("mag_inv = {}, dst = {}", // mag_inv, dst->to_string()) // << endl; // FATAL("kBAM!"); // } *d2++ = float(mag_inv); dst++; } } // Calculate statistics ss.scharr_mag_stats = calc_sample_statistics(mags.begin(), mags.end()); // Make the threshold image const auto threshold = ss.scharr_mag_stats.median + p.scharr_threshold_absdevs * ss.scharr_mag_stats.absdev; { auto& im = ss.scharr_binary; im.resize(field.width, field.height); im.resize(w, h); im.zero(); for(auto y = 0u; y < field.height; ++y) { for(auto x = 0u; x < field.width; ++x) { Vector2 v = field(x, y); if(v.norm() > threshold) { auto theta = atan2(v.y, v.x); if(theta < 0) theta += M_PI; im(x, y) = angle_to_colour(theta); } } } } } } // namespace perceive

[ "everett@perceiveinc.com" ]

everett@perceiveinc.com

ccda5af3e7a546b7549e05cac8ec9b8ee73b9375

d47ed5449b8cda84f4343750f122a09ef537b090

/Source/Game/public/SGameMode.h

cd3c17714b3797761a6aa96cac68388b191c301b

[]

no_license

Helaly96/UE4-BarthGame

1993b5631e96117b0ec81c0d4f4f5a7f1cbab331

7119885a8fc7d2d3d8641a6d81faa8f3710b2581

refs/heads/master

2022-09-25T10:50:45.477744

2020-06-05T00:46:14

266,905,577

0

null

UTF-8

C++

false

1,155

h

// Fill out your copyright notice in the Description page of Project Settings. #pragma once #include "CoreMinimal.h" #include "GameFramework/GameModeBase.h" #include "SGameMode.generated.h" DECLARE_DYNAMIC_MULTICAST_DELEGATE_ThreeParams(FOnActorKilled ,AActor*, KillerActor, AActor*, KilledActor,AController *,KillerController); struct FCurrentScore; /** * */ UCLASS() class GAME_API ASGameMode : public AGameModeBase { GENERATED_BODY() protected: UFUNCTION(BlueprintImplementableEvent) void SpawnNewBot(); void SpawnBotTimerElapsed(); void StartWave(); void PrepareForNextWave(); void EndWave(); void SetMatchScore(FCurrentScore Score); void AssignTeams(); //bots to spawn in a current wave float NoOfBots; //Number of survived waves int WaveCount; FTimerHandle TimerHandle_SpawnBot; UPROPERTY(EditDefaultsOnly) float TimeBetweenWaves; public: void RestartDeadPlayers(); APlayerController* PlayerToRevive; virtual void Tick(float DeltaSeconds) override; void Revive(); ASGameMode(); virtual void StartPlay() override; UPROPERTY(BlueprintAssignable) FOnActorKilled OnActorKilled; int next_assignable_team; };

[ "zfaesu@gmail.com" ]

zfaesu@gmail.com

5483e62b35f56845325429369351c2de3374ab7e

a0bdedcc814dfcbf6f1742c398b64a31619af4df

/ideccmbd/gbl/JobIdecStereo_blks.cpp

679c968af03cbea563358db9fb24041f3e07f981

[ "BSD-2-Clause" ]

permissive

mpsitech/idec_public

ec7231939b8987fd66482d99276609e16d4ad3f7

a74cf1c7095e08ee61b237fddc1642f83dbb852d

refs/heads/master

2021-05-13T20:43:55.046131

2018-06-09T16:11:30

116,916,593

0

null

UTF-8

C++

false

1,209

cpp

/** * \file JobIdecStereo_blks.cpp * job handler for job JobIdecStereo (implementation of blocks) * \author Alexander Wirthmueller * \date created: 30 Dec 2017 * \date modified: 30 Dec 2017 */ /****************************************************************************** class JobIdecStereo::VecVSge ******************************************************************************/ uint JobIdecStereo::VecVSge::getIx( const string& sref ) { string s = StrMod::lc(sref); if (s == "idle") return IDLE; else if (s == "ready") return READY; else if (s == "acqidle") return ACQIDLE; else if (s == "acq") return ACQ; else if (s == "prcidle") return PRCIDLE; else if (s == "prc") return PRC; return(0); }; string JobIdecStereo::VecVSge::getSref( const uint ix ) { if (ix == IDLE) return("idle"); else if (ix == READY) return("ready"); else if (ix == ACQIDLE) return("acqidle"); else if (ix == ACQ) return("acq"); else if (ix == PRCIDLE) return("prcidle"); else if (ix == PRC) return("prc"); return(""); }; void JobIdecStereo::VecVSge::fillFeed( Feed& feed ) { feed.clear(); for (unsigned int i=1;i<=6;i++) feed.appendIxSrefTitles(i, getSref(i), getSref(i)); };

[ "mpsitech@ungenio.local" ]

mpsitech@ungenio.local

a4b3546f8dca8a4f9748227b4c3cdb0405a781cf

45ae4cf99ef88c0348619030b9378a5f44a15e5f

/src/rnnhubo/rnn.cpp

a911acd98fdbc0bac4bd5c58974d6ee37accb2cd

[]

no_license

datemoon/rnn_lm_score

d24f5d70072f52d60a3b08d70b70d24e20a3d364

1ab69d656883f1fe846deeff484c7a33282108d1

refs/heads/master

2020-06-12T07:14:51.903019

2019-06-28T07:53:25

194,229,279

1

0

null

UTF-8

C++

false

10,505

cpp

#include <string.h> #include <stdio.h> #include <stdlib.h> #include <assert.h> #include "rnn.h" void Rnn::LoadRNNLM(string modelname) { LoadTextRNNLM(modelname); } void Rnn::LoadTextRNNLM (string modelname) { int i, a, b; float v; char word[1024]; FILE *fptr = NULL; // read model file fptr = fopen (modelname.c_str(), "r"); if (fptr == NULL) { printf ("ERROR: Failed to read RNNLM model file(%s)\n", modelname.c_str()); exit (0); } fscanf (fptr, "cuedrnnlm v%f\n", &v); if (v - 0.1 > 0.1 || v - 0.1 < -0.1) { printf ("Error: the version of rnnlm model(v%.1f) is not consistent with binary supported(v%.1f)\n", v, 0.1); exit (0); } fscanf (fptr, "train file: %s\n", word); trainfile = word; fscanf (fptr, "valid file: %s\n", word); validfile = word; fscanf (fptr, "number of iteration: %d\n", &iter); fscanf (fptr, "#train words: %d\n", &trainwordcnt); fscanf (fptr, "#valid words: %d\n", &validwordcnt); fscanf (fptr, "#layer: %d\n", &num_layer); layersizes.resize(num_layer+1); for (i=0; i<layersizes.size(); i++) { fscanf (fptr, "layer %d size: %d\n", &b, &a); assert(b==i); layersizes[i] = a; } fscanf (fptr, "feature dimension: %d\n", &dim_fea); fscanf (fptr, "class layer dimension: %d\n", &nclass); allocMem(); fscanf (fptr, "independent mode: %d\n", &independent); fscanf (fptr, "train crit mode: %d\n", &traincritmode); for (i=0; i<num_layer; i++) { fscanf (fptr, "layer %d -> %d\n", &a, &b); assert (a==i); assert (b==(i+1)); for (a=0; a<layersizes[i]; a++) { for (b=0; b<layersizes[i+1]; b++) { fscanf (fptr, "%f", &v); if(0 != layers[i]->SetData(a, b, v)) { fprintf(stderr,"matrix SetData error!\n"); return ; } } fscanf (fptr, "\n"); } } fscanf (fptr, "recurrent layer 1 -> 1\n"); for (a=0; a<layersizes[1]; a++) { for (b=0; b<layersizes[1]; b++) { fscanf (fptr, "%f", &v); if(0 != hidtohid_weight[0]->SetData(a, b, v)) { fprintf(stderr,"matrix SetData error!\n"); return ; } } fscanf (fptr, "\n"); } /* if (dim_fea > 0) { fscanf (fptr, "feature layer weight\n"); for (a=0; a<dim_fea; a++) { for (b=0; b<layersizes[1]; b++) { fscanf (fptr, "%f", &v); layer0_fea->assignhostvalue(a, b, v); } fscanf (fptr, "\n"); } }*/ if (nclass > 0) { fscanf (fptr, "class layer weight\n"); for (a=0; a<layersizes[num_layer-1]; a++) { for (b=0; b<nclass; b++) { fscanf (fptr, "%f", &v); class_layer_weight->SetData(a, b, v); } fscanf (fptr, "\n"); } } fscanf (fptr, "hidden layer ac\n"); for (a=0; a<layersizes[1]; a++) { fscanf (fptr, "%f", &v); for (b=0; b<minibatch; b++) neu0_ac_hist->SetData(a, b, v); } fscanf (fptr, "\n"); fscanf (fptr, "%d", &a); if (a != 9999999) { printf ("ERROR: failed to read the check number(%d) when reading model\n",9999999);// CHECKNUM); exit (0); } // if (debug > 1) { printf ("Successfully loaded model: %s\n", modelname.c_str()); } fclose (fptr); } void Rnn::allocMem() { hidtohid_weight.resize(1); hidtohid_weight[0] = new Matrix(layersizes[1], layersizes[1]); layers.resize(num_layer); for(int i=0;i<num_layer;++i) { layers[i] = new Matrix(layersizes[i],layersizes[i+1]); } if(nclass > 0) { class_layer_weight = new Matrix(layersizes[num_layer-1], nclass); } neu0_ac_hist = new Matrix(layersizes[1],1); } //only calculate word output layer. float Rnn::forword(int curword,float *hidden,float hiddim, float *class_out,int class_dim,float *output, int outdim) { memset(output,0x00,sizeof(float)*outdim); int nrow = layersizes[num_layer-1]; //int ncol = layersizes[num_layer]; int clsid = word2class[curword]; int swordid = classinfo[clsid*3]; int nword = classinfo[clsid*3+2]; float *wgt = layers[num_layer-1]->GetDataP(); matrixXvector(hidden,wgt+swordid*nrow,output+swordid, nrow, nword); SoftMax(output+swordid,nword); if(nclass > 0) { int clsid = word2class[curword]; return output[curword] * class_out[clsid]; } else { return output[curword]; } } //iodim: iput and oput dim ,it's word list length. //iput,oput,hidden_out:external application for memory. float Rnn::forword (int prevword, int curword,float *iput,float *oput,int iodim, float *hid_in,int hid_dim,float *class_out,int class_dim) { int a, b; //int c; int nrow, ncol; //float v, norm, maxv; nrow = layersizes[1]; ncol = layersizes[1]; float *wgt; //iodim == layersizes[0] //hidden_out == layersizes[1] //class_dim == nclass memset(iput,0x00,sizeof(float)*iodim); memset(oput,0x00,sizeof(float)*iodim); memset(class_out,0x00,sizeof(float)*class_dim); // neu0 -> neu1 for (a=0; a<layers.size(); a++) { if (a==0)//calculate feature * weight,first layer { memcpy(iput,hid_in ,hid_dim*sizeof(float)); wgt = hidtohid_weight[0]->GetDataP(); // oput = neu_ac[1]->gethostdataptr(); nrow = layersizes[1]; ncol = layersizes[1]; memset(oput, 0, sizeof(float)*ncol); for(b=0;b<ncol;++b) { oput[b] = layers[0]->GetData(prevword,b); } } else//last layer { if(a==1) memcpy(hid_in,oput,hid_dim*sizeof(float)); float *tmp=NULL; tmp = iput; iput = oput; oput = tmp; nrow = layersizes[a]; ncol = layersizes[a+1]; memset(oput, 0, sizeof(float)*ncol); wgt = layers[a]->GetDataP(); } if (a+1==num_layer) { if(lognormconst < 0) { if (nclass > 0) { int ncol_cls = nclass; float *cls_w = class_layer_weight->GetDataP(); matrixXvector(iput,cls_w, class_out,nrow, ncol_cls); //for(int i=0;i<ncol_cls;++i) SoftMax(class_out,ncol_cls); int clsid = word2class[curword]; int swordid = classinfo[clsid*3]; //int ewordid = classinfo[clsid*3+1]; int nword = classinfo[clsid*3+2]; matrixXvector(iput, wgt+swordid*nrow, oput+swordid, nrow, nword); SoftMax(oput+swordid,nword); } else { matrixXvector(iput,wgt,oput,nrow, ncol); SoftMax(oput,ncol); } } else { float v = 0; for (int i=0; i<nrow; i++) { v += iput[i]*layers[a]->GetData(i,curword); } oput[curword] = exp(v-lognormconst); } } else { matrixXvector (iput, wgt, oput, nrow, ncol); for(int i=0;i<ncol;++i) oput[i]=SigMoid(oput[i]); } } if(nclass > 0) { int clsid = word2class[curword]; return oput[curword] * class_out[clsid]; } else { return oput[curword]; } } float Rnn::SigMoid(float A) { return 1/(1+exp(-A)); } void Rnn::SoftMax(float *A,int dim) { int a, maxi; float v, norm, maxv = 1e-8; maxv = 1e-10; for (a=0; a<dim; a++) { v = A[a]; if(v > maxv) { maxv = v; maxi = a; } } norm = 0; for (a=0; a<dim; a++) { v = A[a] - maxv; A[a] = exp(v); norm += A[a]; } for (a=0; a<dim; a++) { v = A[a] / norm; A[a] = v; } } void Rnn::matrixXvector(float *src, float *wgt, float *dst, int nr, int nc) { #ifndef CBLAS int i,j; for (i=0; i<nc; i++) { for (j=0; j<nr; j++) { dst[i] += wgt[j+i*nr]*src[j]; } } #else cblas_sgemm(CblasRowMajor,CblasNoTrans,CblasTrans, 1,nc,nr,1.0,(float const *)src,nr,(float const *)wgt,nr,1.0,dst,nc); #endif return ; } void Rnn::ReadWordlist(string inputlist, string outputlist) { int i; //int a, b; //float v; char word[1024]; FILE *finlst, *foutlst; finlst = fopen (inputlist.c_str(), "r"); foutlst = fopen (outputlist.c_str(), "r"); if (finlst == NULL || foutlst == NULL) { printf ("ERROR: Failed to open input (%s) or output list file(%s)\n", inputlist.c_str(), outputlist.c_str()); exit (0); } inputmap.insert(make_pair(string("<s>"), 0)); outputmap.insert(make_pair(string("</s>"), 0)); inputvec.clear(); outputvec.clear(); inputvec.push_back("<s>"); outputvec.push_back("</s>"); int index = 1; while (!feof(finlst)) { if(fscanf (finlst, "%d%s", &i, word) == 2) { if (inputmap.find(word) == inputmap.end()) { // printf("%d %s\n",i,word); inputmap[word] = index; inputvec.push_back(word); index ++; } } } if (inputmap.find("<OOS>") == inputmap.end()) { inputmap.insert(make_pair(string("<OOS>"), index)); inputvec.push_back("<OOS>"); } else { assert (inputmap["<OOS>"] == inputvec.size()-1); } index = 1; // allocate memory for class information if (nclass > 0) { word2class = new int[layersizes[num_layer]]; classinfo = new int[nclass*3]; classinfo[0] = 0; } int clsid, prevclsid = 0; while (!feof(foutlst)) { if (nclass > 0) { if (fscanf(foutlst, "%d%s%d", &i, word, &clsid) == 3) { // printf("%d %s\n",i,word); if (outputmap.find(word) == outputmap.end()) { outputmap[word] = index; outputvec.push_back(word); index ++; } int idx = outputmap[word]; word2class[idx] = clsid; if (clsid != prevclsid) { classinfo[prevclsid*3+1] = idx-1; classinfo[prevclsid*3+2] = idx-classinfo[prevclsid*3]; classinfo[3*clsid]=idx; } prevclsid = clsid; } } else { if (fscanf(foutlst, "%d%s", &i, word) == 2) { if (outputmap.find(word) == outputmap.end()) { outputmap[word] = index; outputvec.push_back(word); index ++; } } } } if (nclass > 0) { classinfo[prevclsid*3+1] = layersizes[num_layer]-1; classinfo[prevclsid*3+2] = layersizes[num_layer]-classinfo[prevclsid*3]; } if (outputmap.find("<OOS>") == outputmap.end()) { outputmap.insert(make_pair(string("<OOS>"), index)); outputvec.push_back("<OOS>"); } else { assert (outputmap["<OOS>"] == outputvec.size()-1); } fprintf(stderr,"inputvec %ld layersizes[0] %d\n", inputvec.size(), layersizes[0]); assert (inputvec.size() == layersizes[0]); assert (outputvec.size() == layersizes[num_layer]); inStartindex = 0; outEndindex = 0; inOOSindex = inputvec.size() - 1; outOOSindex = outputvec.size() - 1; assert (outOOSindex == outputmap["<OOS>"]); assert (inOOSindex == inputmap["<OOS>"]); fclose (finlst); fclose (foutlst); }

[ "hubo@1057277483@qq.com" ]

hubo@1057277483@qq.com

944ccb4ba5c429aac8884b42b275dee4bd9baa0a

8dcf1479ce569ffad7b607dd3d43115e3c8ebc41

/DaQinBot/Source/MapTools.cpp

8b317b04f602bd2e7006826417b349833978807b

[]

no_license

liongis/DaQin

3d628aa481a4fcaa72582728851341863dece6bb

f851984c34b60da2bfa51baa3355e69153a617d3

refs/heads/master

2020-03-30T20:39:39.900596

2018-12-12T07:59:15

151,597,967

8

0

null

GB18030

C++

false

25,001

cpp

#include "MapTools.h" #include "BuildingPlacer.h" #include "InformationManager.h" const double pi = 3.14159265358979323846; namespace { auto & bwemMap = BWEM::Map::Instance(); } namespace { auto & bwebMap = BWEB::Map::Instance(); } using namespace UAlbertaBot; MapTools & MapTools::Instance() { static MapTools instance; return instance; } MapTools::MapTools() { // Figure out which tiles are walkable and buildable. setBWAPIMapData(); _hasIslandBases = false; for (BWTA::BaseLocation * base : BWTA::getBaseLocations()) { if (base->isIsland()) { _hasIslandBases = true; break; } } // Get all of the BWEM chokepoints std::set<const BWEM::ChokePoint*> chokes; for (const auto & area : bwemMap.Areas()) for (const BWEM::ChokePoint * choke : area.ChokePoints()) chokes.insert(choke); // Store a ChokeData object for each choke for (const BWEM::ChokePoint * choke : chokes) { choke->SetExt(new ChokeData(choke)); ChokeData & chokeData = *((ChokeData*)choke->Ext()); // Compute the choke width // Because the ends are themselves walkable tiles, we need to add a bit of padding to estimate the actual walkable width of the choke int width = BWAPI::Position(choke->Pos(choke->end1)).getApproxDistance(BWAPI::Position(choke->Pos(choke->end2))) + 15; chokeData.width = width; // Determine if the choke is a ramp int firstAreaElevation = BWAPI::Broodwar->getGroundHeight(BWAPI::TilePosition(choke->GetAreas().first->Top())); int secondAreaElevation = BWAPI::Broodwar->getGroundHeight(BWAPI::TilePosition(choke->GetAreas().second->Top())); if (firstAreaElevation != secondAreaElevation) { chokeData.isRamp = true; // For narrow ramps with a difference in elevation, compute a tile at high elevation close to the choke // We will use this for pathfinding if (chokeData.width < 96) { // Start by computing the angle of the choke BWAPI::Position chokeDelta(choke->Pos(choke->end1) - choke->Pos(choke->end2)); double chokeAngle = atan2(chokeDelta.y, chokeDelta.x); // Now find a tile a bit away from the middle of the choke that is at high elevation int highestElevation = std::max(firstAreaElevation, secondAreaElevation); BWAPI::Position center(choke->Center()); BWAPI::TilePosition closestToCenter = BWAPI::TilePositions::Invalid; for (int step = 0; step <= 6; step++) for (int direction = -1; direction <= 1; direction += 2) { BWAPI::TilePosition tile(BWAPI::Position( center.x - (int)std::round(16 * step * std::cos(chokeAngle + direction * (pi / 2.0))), center.y - (int)std::round(16 * step * std::sin(chokeAngle + direction * (pi / 2.0))))); if (!tile.isValid()) continue; if (!bwebMap.isWalkable(tile)) continue; if (BWAPI::Broodwar->getGroundHeight(tile) == highestElevation) { chokeData.highElevationTile = tile; } } } } } // On Plasma, we enrich the BWEM chokepoints with data about mineral walking if (BWAPI::Broodwar->mapHash() == "6f5295624a7e3887470f3f2e14727b1411321a67") { // Process each choke for (const BWEM::ChokePoint * choke : chokes) { ChokeData & chokeData = *((ChokeData*)choke->Ext()); BWAPI::Position chokeCenter(choke->Center()); // Determine if the choke is blocked by eggs, and grab the close mineral patches bool blockedByEggs = false; BWAPI::Unit closestMineralPatch = nullptr; BWAPI::Unit secondClosestMineralPatch = nullptr; int closestMineralPatchDist = INT_MAX; int secondClosestMineralPatchDist = INT_MAX; for (const auto staticNeutral : BWAPI::Broodwar->getStaticNeutralUnits()) { if (!blockedByEggs && staticNeutral->getType() == BWAPI::UnitTypes::Zerg_Egg && staticNeutral->getDistance(chokeCenter) < 100) { blockedByEggs = true; } if (staticNeutral->getType() == BWAPI::UnitTypes::Resource_Mineral_Field && staticNeutral->getResources() == 32) { int dist = staticNeutral->getDistance(chokeCenter); if (dist <= closestMineralPatchDist) { secondClosestMineralPatchDist = closestMineralPatchDist; closestMineralPatchDist = dist; secondClosestMineralPatch = closestMineralPatch; closestMineralPatch = staticNeutral; } else if (dist < secondClosestMineralPatchDist) { secondClosestMineralPatchDist = dist; secondClosestMineralPatch = staticNeutral; } } } if (!blockedByEggs) continue; chokeData.requiresMineralWalk = true; chokeData.firstMineralPatch = closestMineralPatch; chokeData.secondMineralPatch = secondClosestMineralPatch; } } // TODO testing //BWAPI::TilePosition homePosition = BWAPI::Broodwar->self()->getStartLocation(); //BWAPI::Broodwar->printf("start position %d,%d", homePosition.x, homePosition.y); } // Read the map data from BWAPI and remember which 32x32 build tiles are walkable. // NOTE The game map is walkable at the resolution of 8x8 walk tiles, so this is an approximation. // We're asking "Can big units walk here?" Small units may be able to squeeze into more places. void MapTools::setBWAPIMapData() { // 1. Mark all tiles walkable and buildable at first. _terrainWalkable = std::vector< std::vector<bool> >(BWAPI::Broodwar->mapWidth(), std::vector<bool>(BWAPI::Broodwar->mapHeight(), true)); _walkable = std::vector< std::vector<bool> >(BWAPI::Broodwar->mapWidth(), std::vector<bool>(BWAPI::Broodwar->mapHeight(), true)); _buildable = std::vector< std::vector<bool> >(BWAPI::Broodwar->mapWidth(), std::vector<bool>(BWAPI::Broodwar->mapHeight(), true)); _depotBuildable = std::vector< std::vector<bool> >(BWAPI::Broodwar->mapWidth(), std::vector<bool>(BWAPI::Broodwar->mapHeight(), true)); // 2. Check terrain: Is it buildable? Is it walkable? // This sets _walkable and _terrainWalkable identically. for (int x = 0; x < BWAPI::Broodwar->mapWidth(); ++x) { for (int y = 0; y < BWAPI::Broodwar->mapHeight(); ++y) { // This initializes all cells of _buildable and _depotBuildable. bool buildable = BWAPI::Broodwar->isBuildable(BWAPI::TilePosition(x, y), false); _buildable[x][y] = buildable; _depotBuildable[x][y] = buildable; bool walkable = true; // Check each 8x8 walk tile within this 32x32 TilePosition. int walkableWalkPositions = 0; for (int i = 0; i < 4; ++i) { for (int j = 0; j < 4; ++j) { if (BWAPI::Broodwar->isWalkable(x * 4 + i, y * 4 + j)) walkableWalkPositions++; } } // On Plasma, consider the tile walkable if at least 10 walk positions are walkable if (walkableWalkPositions < 16 && (BWAPI::Broodwar->mapHash() != "6f5295624a7e3887470f3f2e14727b1411321a67" || walkableWalkPositions < 10)) { _terrainWalkable[x][y] = false; _walkable[x][y] = false; } } } // 3. Check neutral units: Do they block walkability? // This affects _walkable but not _terrainWalkable. We don't update buildability here. for (const auto unit : BWAPI::Broodwar->getStaticNeutralUnits()) { // Ignore the eggs on Plasma if (BWAPI::Broodwar->mapHash() == "6f5295624a7e3887470f3f2e14727b1411321a67" && unit->getType() == BWAPI::UnitTypes::Zerg_Egg) continue; // The neutral units may include moving critters which do not permanently block tiles. // Something immobile blocks tiles it occupies until it is destroyed. (Are there exceptions?) if (!unit->getType().canMove() && !unit->isFlying()) { BWAPI::TilePosition pos = unit->getTilePosition(); for (int x = pos.x; x < pos.x + unit->getType().tileWidth(); ++x) { for (int y = pos.y; y < pos.y + unit->getType().tileHeight(); ++y) { if (BWAPI::TilePosition(x, y).isValid()) // assume it may be partly off the edge { _walkable[x][y] = false; } } } } } // 4. Check static resources: Do they block buildability? for (const BWAPI::Unit resource : BWAPI::Broodwar->getStaticNeutralUnits()) { if (!resource->getType().isResourceContainer()) { continue; } int tileX = resource->getTilePosition().x; int tileY = resource->getTilePosition().y; for (int x = tileX; x<tileX + resource->getType().tileWidth(); ++x) { for (int y = tileY; y<tileY + resource->getType().tileHeight(); ++y) { _buildable[x][y] = false; // depots can't be built within 3 tiles of any resource // TODO rewrite this to be less disgusting for (int dx = -3; dx <= 3; dx++) { for (int dy = -3; dy <= 3; dy++) { if (!BWAPI::TilePosition(x + dx, y + dy).isValid()) { continue; } _depotBuildable[x + dx][y + dy] = false; } } } } } } // Ground distance in tiles, -1 if no path exists. // This is Manhattan distance, not walking distance. Still good for finding paths. int MapTools::getGroundTileDistance(BWAPI::TilePosition origin, BWAPI::TilePosition destination) { // if we have too many maps, reset our stored maps in case we run out of memory if (_allMaps.size() > allMapsSize) { _allMaps.clear(); if (Config::Debug::DrawMapDistances) { BWAPI::Broodwar->printf("Cleared distance map cache"); } } // Do we have a distance map to the destination? auto it = _allMaps.find(destination); if (it != _allMaps.end()) { return (*it).second.getDistance(origin); } // It's symmetrical. A distance map to the origin is just as good. it = _allMaps.find(origin); if (it != _allMaps.end()) { return (*it).second.getDistance(destination); } // Make a new map for this destination. _allMaps.insert(std::pair<BWAPI::TilePosition, DistanceMap>(destination, DistanceMap(destination))); return _allMaps[destination].getDistance(origin); } int MapTools::getGroundTileDistance(BWAPI::Position origin, BWAPI::Position destination) { return getGroundTileDistance(BWAPI::TilePosition(origin), BWAPI::TilePosition(destination)); } // Ground distance in pixels (with TilePosition granularity), -1 if no path exists. // TilePosition granularity means that the distance is a multiple of 32 pixels. int MapTools::getGroundDistance(BWAPI::Position origin, BWAPI::Position destination) { int tiles = getGroundTileDistance(origin, destination); if (tiles > 0) { return 32 * tiles; } return tiles; // 0 or -1 } const std::vector<BWAPI::TilePosition> & MapTools::getClosestTilesTo(BWAPI::TilePosition pos) { // make sure the distance map is calculated with pos as a destination int a = getGroundTileDistance(pos, pos); return _allMaps[pos].getSortedTiles(); } const std::vector<BWAPI::TilePosition> & MapTools::getClosestTilesTo(BWAPI::Position pos) { return getClosestTilesTo(BWAPI::TilePosition(pos)); } bool MapTools::isBuildable(BWAPI::TilePosition tile, BWAPI::UnitType type) const { if (!tile.isValid()) { return false; } int startX = tile.x; int endX = tile.x + type.tileWidth(); int startY = tile.y; int endY = tile.y + type.tileHeight(); for (int x = startX; x<endX; ++x) { for (int y = startY; y<endY; ++y) { BWAPI::TilePosition tile(x, y); if (!tile.isValid() || !isBuildable(tile) || type.isResourceDepot() && !isDepotBuildable(tile)) { return false; } } } return true; } void MapTools::drawHomeDistanceMap() { if (!Config::Debug::DrawMapDistances) { return; } BWAPI::TilePosition homePosition = BWAPI::Broodwar->self()->getStartLocation(); DistanceMap d(homePosition, false); for (int x = 0; x < BWAPI::Broodwar->mapWidth(); ++x) { for (int y = 0; y < BWAPI::Broodwar->mapHeight(); ++y) { int dist = d.getDistance(x, y); char color = dist == -1 ? orange : white; BWAPI::Position pos(BWAPI::TilePosition(x, y)); BWAPI::Broodwar->drawTextMap(pos + BWAPI::Position(12, 12), "%c%d", color, dist); if (homePosition.x == x && homePosition.y == y) { BWAPI::Broodwar->drawBoxMap(pos.x, pos.y, pos.x+33, pos.y+33, BWAPI::Colors::Yellow); } } } } BWTA::BaseLocation * MapTools::nextExpansion(bool hidden, bool wantMinerals, bool wantGas) { UAB_ASSERT(wantMinerals || wantGas, "unwanted expansion"); // Abbreviations. BWAPI::Player player = BWAPI::Broodwar->self(); BWAPI::Player enemy = BWAPI::Broodwar->enemy(); // We'll go through the bases and pick the one with the best score. BWTA::BaseLocation * bestBase = nullptr; double bestScore = -999999.0; auto myBases = InformationManager::Instance().getMyBases(); auto enemyBases = InformationManager::Instance().getEnemyBases(); // may be empty for (BWTA::BaseLocation * base : BWTA::getBaseLocations()) { double score = 0.0; // Do we demand a gas base? if (wantGas && (base->isMineralOnly() || base->gas() == 0)) { continue; } // Do we demand a mineral base? // The constant is an arbitrary limit "enough minerals to be worth it". if (wantMinerals && base->minerals() < 500) { continue; } // Don't expand to an existing base. if (InformationManager::Instance().getBaseOwner(base) != BWAPI::Broodwar->neutral()) { continue; } // Don't expand to a spider-mined base. if (InformationManager::Instance().getBase(base)->spiderMined) { continue; } BWAPI::TilePosition tile = base->getTilePosition(); bool buildingInTheWay = false; for (int x = 0; x < player->getRace().getCenter().tileWidth(); ++x) { for (int y = 0; y < player->getRace().getCenter().tileHeight(); ++y) { if (BuildingPlacer::Instance().isReserved(tile.x + x, tile.y + y)) { // This happens if we were already planning to expand here. Try somewhere else. buildingInTheWay = true; break; } // TODO bug: this doesn't include enemy buildings which are known but out of sight for (const auto unit : BWAPI::Broodwar->getUnitsOnTile(BWAPI::TilePosition (tile.x + x, tile.y + y))) { if (unit->getType().isBuilding() && !unit->isLifted()) { buildingInTheWay = true; break; } } } } if (buildingInTheWay) { continue; } // Want to be close to our own base (unless this is to be a hidden base). double distanceFromUs = closestBaseDistance(base, myBases); // if it is not connected, continue if (distanceFromUs < 0) { continue; } // Want to be far from the enemy base. double distanceFromEnemy = std::max(0, closestBaseDistance(base, enemyBases)); // Add up the score. score = hidden ? (distanceFromEnemy + distanceFromUs / 2.0) : (distanceFromEnemy / 1.5 - distanceFromUs); // More resources -> better. if (wantMinerals) { score += 0.01 * base->minerals(); } if (wantGas) { score += 0.02 * base->gas(); } // Big penalty for enemy buildings in the same region. if (InformationManager::Instance().isEnemyBuildingInRegion(base->getRegion(), false)) { score -= 100.0; } // BWAPI::Broodwar->printf("base score %d, %d -> %f", tile.x, tile.y, score); if (score > bestScore) { bestBase = base; bestScore = score; } } if (bestBase) { return bestBase; } if (wantMinerals && wantGas) { // We wanted a gas base and there isn't one. Try for a mineral-only base. return nextExpansion(hidden, true, false); } return nullptr; } int MapTools::closestBaseDistance(BWTA::BaseLocation * base, std::vector<BWTA::BaseLocation*> bases) { int closestDistance = -1; for (auto other : bases) { int dist = getGroundTileDistance(base->getPosition(), other->getPosition()); if (dist >= 0 && (dist < closestDistance || closestDistance == -1)) closestDistance = dist; } return closestDistance; } BWAPI::TilePosition MapTools::getNextExpansion(bool hidden, bool wantMinerals, bool wantGas) { BWTA::BaseLocation * base = nextExpansion(hidden, wantMinerals, wantGas); if (base) { // BWAPI::Broodwar->printf("foresee base @ %d, %d", base->getTilePosition().x, base->getTilePosition().y); return base->getTilePosition(); } return BWAPI::TilePositions::None; } /* 获取距离起点坐标指定长度的坐标,靠近用 */ BWAPI::Position MapTools::getDistancePosition(BWAPI::Position start, BWAPI::Position end, double dist) { double distance = sqrt(pow(start.x - end.x, 2) + pow(start.y - end.y, 2));// 两点的坐标距离 double lenthUnit = distance / 5;// 单位长度 // 第一步：求得直线方程相关参数y=kx+b double k = (start.y - end.y) * 1.0 / (start.x - end.x);// 坐标直线斜率k double b = start.y - k * start.x;// 坐标直线b // 第二步：求得在直线y=kx+b上，距离当前坐标距离为L的某点 // 一元二次方程Ax^2+Bx+C=0中, // 一元二次方程求根公式： // 两根x1,x2= [-B±√(B^2-4AC)]/2A // ①(y-y0)^2+(x-x0)^2=L^2; // ②y=kx+b; // 式中x,y即为根据以上lenthUnit单位长度(这里就是距离L)对应点的坐标 // 由①②表达式得到:(k^2+1)x^2+2[(b-y0)k-x0]x+[(b-y0)^2+x0^2-L^2]=0 double A = pow(k, 2) + 1;// A=k^2+1; double B = 2 * ((b - start.y) * k - start.x);// B=2[(b-y0)k-x0]; int m = 1; double L = m * dist; // C=(b-y0)^2+x0^2-L^2 double C = pow(b - start.y, 2) + pow(start.x, 2) - pow(L, 2); // 两根x1,x2= [-B±√(B^2-4AC)]/2A double x1 = (-B + sqrt(pow(B, 2) - 4 * A * C)) / (2 * A); double x2 = (-B - sqrt(pow(B, 2) - 4 * A * C)) / (2 * A); double x = 0;// 最后确定是在已知两点之间的某点 if (x1 == x2) { x = x1; } else if (start.x <= x1 && x1 <= end.x || end.x <= x1 && x1 <= start.x) { x = x1; } else if (start.x <= x2 && x2 <= end.x || end.x <= x2 && x2 <= start.x) { x = x2; } double y = k * x + b; return BWAPI::Position(x, y); } /* 获取距离起点延长指定长度的坐标,后退用 */ BWAPI::Position MapTools::getExtendedPosition(BWAPI::Position start, BWAPI::Position end, double dist) { double xab, yab; double xbd, ybd; double xd, yd; xab = start.x - end.x; yab = start.y - end.y; xbd = sqrt((dist * dist) / ((yab / xab) * (yab / xab) + 1)); if (xab > 0) { xbd = sqrt((dist * dist) / ((yab / xab) * (yab / xab) + 1)); } else { xbd = -sqrt((dist * dist) / ((yab / xab) * (yab / xab) + 1)); } xd = start.x + xbd; yd = start.y + yab / xab * xbd; //printf("xd=%f,yd=%f\n", xd, yd); return BWAPI::Position(xd, yd); } //求点到圆的切点 void MapTools::getCutPoint(BWAPI::Position center, double radius, BWAPI::Position sp, BWAPI::Position & rp1, BWAPI::Position & rp2) { double m = sp.x, n = sp.y; double a = center.x, b = center.y; double r = radius; double dx = center.x - sp.x; double dy = center.y - sp.y; //计算点击处与圆心相对于X轴的夹角 double r1 = atan2(dy, dx); //计算点击处与圆心、点击处与切点1这两条线段间的夹角 double d1 = sqrt(dx*dx + dy*dy); double r2 = asin(radius / d1); //计算从切点1向圆的垂直直径做垂线形成的直角三角形的一个角 double r3 = r1 - r2; //计算坐标系中的角度 double r4 = r3 - 3.1415926 / 2; //计算切点1相对于圆心的x、y坐标 double x1 = radius * cos(r4); double y1 = radius * sin(r4); //计算点击处与切线2相对于X轴的夹角 double r5 = 3.1415926 / 2 - r1 - r2; //计算坐标系中的角度 double r6 = -r5; //计算切点2相对于圆心的x、y坐标 double x2 = radius * cos(r6); double y2 = radius * sin(r6); rp1.x = center.x + x1; rp1.y = center.y + y1; rp2.x = center.x - x2; rp2.y = center.y - y2; } std::vector<BWAPI::Position> MapTools::calculateEnemyRegionVertices(BWTA::BaseLocation * enemyBaseLocation) { std::vector<BWAPI::Position> _regionVertices; if (!enemyBaseLocation) { return _regionVertices; } BWTA::Region * enemyRegion = enemyBaseLocation->getRegion(); if (!enemyRegion) { return _regionVertices; } const BWAPI::Position basePosition = BWAPI::Position(BWAPI::Broodwar->self()->getStartLocation()); const std::vector<BWAPI::TilePosition> & closestTobase = getClosestTilesTo(basePosition); std::set<BWAPI::Position> unsortedVertices; // check each tile position for (size_t i(0); i < closestTobase.size(); ++i) { const BWAPI::TilePosition & tp = closestTobase[i]; if (BWTA::getRegion(tp) != enemyRegion) { continue; } // a tile is 'on an edge' unless // 1) in all 4 directions there's a tile position in the current region // 2) in all 4 directions there's a buildable tile //瓷砖是 ' 在边缘 ', 除非 //1) 在所有4个方向在当前区域有一个瓷砖位置 //2) 在所有4个方向有一个可生成瓷砖 bool edge = BWTA::getRegion(BWAPI::TilePosition(tp.x + 1, tp.y)) != enemyRegion || !BWAPI::Broodwar->isBuildable(BWAPI::TilePosition(tp.x + 1, tp.y)) || BWTA::getRegion(BWAPI::TilePosition(tp.x, tp.y + 1)) != enemyRegion || !BWAPI::Broodwar->isBuildable(BWAPI::TilePosition(tp.x, tp.y + 1)) || BWTA::getRegion(BWAPI::TilePosition(tp.x - 1, tp.y)) != enemyRegion || !BWAPI::Broodwar->isBuildable(BWAPI::TilePosition(tp.x - 1, tp.y)) || BWTA::getRegion(BWAPI::TilePosition(tp.x, tp.y - 1)) != enemyRegion || !BWAPI::Broodwar->isBuildable(BWAPI::TilePosition(tp.x, tp.y - 1)); // push the tiles that aren't surrounded //推开没有被包围的瓷砖 if (edge && BWAPI::Broodwar->isBuildable(tp)) { if (Config::Debug::DrawScoutInfo) { int x1 = tp.x * 32 + 2; int y1 = tp.y * 32 + 2; int x2 = (tp.x + 1) * 32 - 2; int y2 = (tp.y + 1) * 32 - 2; BWAPI::Broodwar->drawTextMap(x1 + 3, y1 + 2, "%d", getGroundTileDistance(BWAPI::Position(tp), basePosition)); BWAPI::Broodwar->drawBoxMap(x1, y1, x2, y2, BWAPI::Colors::Green, false); } unsortedVertices.insert(BWAPI::Position(tp) + BWAPI::Position(16, 16)); } } std::vector<BWAPI::Position> sortedVertices; BWAPI::Position current = *unsortedVertices.begin(); _regionVertices.push_back(current); unsortedVertices.erase(current); // while we still have unsorted vertices left, find the closest one remaining to current //虽然我们仍然有未排序的顶点左, 找到最接近的一个剩余的当前 while (!unsortedVertices.empty()) { double bestDist = 1000000; BWAPI::Position bestPos; for (const BWAPI::Position & pos : unsortedVertices) { double dist = pos.getDistance(current); if (dist < bestDist) { bestDist = dist; bestPos = pos; } } current = bestPos; sortedVertices.push_back(bestPos); unsortedVertices.erase(bestPos); } // let's close loops on a threshold, eliminating death grooves //让我们关闭循环的门槛, 消除死亡凹槽 int distanceThreshold = 100; while (true) { // find the largest index difference whose distance is less than the threshold //查找距离小于阈值的最大索引差异 int maxFarthest = 0; int maxFarthestStart = 0; int maxFarthestEnd = 0; // for each starting vertex for (int i(0); i < (int)sortedVertices.size(); ++i) { int farthest = 0; int farthestIndex = 0; // only test half way around because we'll find the other one on the way back for (size_t j(1); j < sortedVertices.size() / 2; ++j) { int jindex = (i + j) % sortedVertices.size(); if (sortedVertices[i].getDistance(sortedVertices[jindex]) < distanceThreshold) { farthest = j; farthestIndex = jindex; } } if (farthest > maxFarthest) { maxFarthest = farthest; maxFarthestStart = i; maxFarthestEnd = farthestIndex; } } // stop when we have no long chains within the threshold if (maxFarthest < 4) { break; } std::vector<BWAPI::Position> temp; for (size_t s(maxFarthestEnd); s != maxFarthestStart; s = (s + 1) % sortedVertices.size()) { temp.push_back(sortedVertices[s]); } sortedVertices = temp; } return sortedVertices; }

[ "liongis@163.com" ]

liongis@163.com

8bb3dfade91d35731dc58e39ace895c2cb94d16c

77f8410a1b13402b33806ac45263a61d0c3aba90

/v8/src/builtins/builtins-collections-gen.cc

476c4833f71d0542cf506cb0d1ac65b26e982e23

[]

no_license

ngot/libv8

93d5a874cffce7373bb13f4cba343d7e906524a5

34abbc81c745a896221918e75dc8658337c7a1f1

refs/heads/master

2021-06-26T07:31:23.672284

2017-09-15T16:22:01

103,535,365

17

8

null

UTF-8

C++

false

72,012

cc

// Copyright 2017 the V8 project 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 "src/builtins/builtins-constructor-gen.h" #include "src/builtins/builtins-iterator-gen.h" #include "src/builtins/builtins-utils-gen.h" #include "src/code-stub-assembler.h" #include "src/factory-inl.h" #include "src/objects/hash-table.h" namespace v8 { namespace internal { using compiler::Node; class CollectionsBuiltinsAssembler : public CodeStubAssembler { public: explicit CollectionsBuiltinsAssembler(compiler::CodeAssemblerState* state) : CodeStubAssembler(state) {} protected: Node* AllocateJSMap(Node* js_map_function); template <typename CollectionType> Node* AllocateOrderedHashTable(); Node* AllocateJSCollection(Node* js_map_function); template <typename IteratorType> Node* AllocateJSCollectionIterator(Node* context, int map_index, Node* collection); Node* GetHash(Node* const key); Node* CallGetHashRaw(Node* const key); Node* CallGetOrCreateHashRaw(Node* const key); // Transitions the iterator to the non obsolete backing store. // This is a NOP if the [table] is not obsolete. typedef std::function<void(Node* const table, Node* const index)> UpdateInTransition; template <typename TableType> std::tuple<Node*, Node*> Transition( Node* const table, Node* const index, UpdateInTransition const& update_in_transition); template <typename IteratorType, typename TableType> std::tuple<Node*, Node*> TransitionAndUpdate(Node* const iterator); template <typename TableType> std::tuple<Node*, Node*, Node*> NextSkipHoles(Node* table, Node* index, Label* if_end); // Builds code that finds OrderedHashTable entry for a key with hash code // {hash} with using the comparison code generated by {key_compare}. The code // jumps to {entry_found} if the key is found, or to {not_found} if the key // was not found. In the {entry_found} branch, the variable // entry_start_position will be bound to the index of the entry (relative to // OrderedHashTable::kHashTableStartIndex). // // The {CollectionType} template parameter stands for the particular instance // of OrderedHashTable, it should be OrderedHashMap or OrderedHashSet. template <typename CollectionType> void FindOrderedHashTableEntry( Node* table, Node* hash, std::function<void(Node* other, Label* if_same, Label* if_not_same)> key_compare, Variable* entry_start_position, Label* entry_found, Label* not_found); // Specialization for Smi. // The {result} variable will contain the entry index if the key was found, // or the hash code otherwise. template <typename CollectionType> void FindOrderedHashTableEntryForSmiKey(Node* table, Node* key_tagged, Variable* result, Label* entry_found, Label* not_found); void SameValueZeroSmi(Node* key_smi, Node* candidate_key, Label* if_same, Label* if_not_same); // Specialization for heap numbers. // The {result} variable will contain the entry index if the key was found, // or the hash code otherwise. void SameValueZeroHeapNumber(Node* key_string, Node* candidate_key, Label* if_same, Label* if_not_same); template <typename CollectionType> void FindOrderedHashTableEntryForHeapNumberKey(Node* context, Node* table, Node* key_heap_number, Variable* result, Label* entry_found, Label* not_found); // Specialization for bigints. // The {result} variable will contain the entry index if the key was found, // or the hash code otherwise. void SameValueZeroBigInt(Node* key, Node* candidate_key, Label* if_same, Label* if_not_same); template <typename CollectionType> void FindOrderedHashTableEntryForBigIntKey(Node* context, Node* table, Node* key, Variable* result, Label* entry_found, Label* not_found); // Specialization for string. // The {result} variable will contain the entry index if the key was found, // or the hash code otherwise. template <typename CollectionType> void FindOrderedHashTableEntryForStringKey(Node* context, Node* table, Node* key_tagged, Variable* result, Label* entry_found, Label* not_found); Node* ComputeIntegerHashForString(Node* context, Node* string_key); void SameValueZeroString(Node* context, Node* key_string, Node* candidate_key, Label* if_same, Label* if_not_same); // Specialization for non-strings, non-numbers. For those we only need // reference equality to compare the keys. // The {result} variable will contain the entry index if the key was found, // or the hash code otherwise. If the hash-code has not been computed, it // should be Smi -1. template <typename CollectionType> void FindOrderedHashTableEntryForOtherKey(Node* context, Node* table, Node* key, Variable* result, Label* entry_found, Label* not_found); template <typename CollectionType> void TryLookupOrderedHashTableIndex(Node* const table, Node* const key, Node* const context, Variable* result, Label* if_entry_found, Label* if_not_found); Node* NormalizeNumberKey(Node* key); void StoreOrderedHashMapNewEntry(Node* const table, Node* const key, Node* const value, Node* const hash, Node* const number_of_buckets, Node* const occupancy); void StoreOrderedHashSetNewEntry(Node* const table, Node* const key, Node* const hash, Node* const number_of_buckets, Node* const occupancy); }; template <typename CollectionType> Node* CollectionsBuiltinsAssembler::AllocateOrderedHashTable() { static const int kCapacity = CollectionType::kMinCapacity; static const int kBucketCount = kCapacity / CollectionType::kLoadFactor; static const int kDataTableLength = kCapacity * CollectionType::kEntrySize; static const int kFixedArrayLength = CollectionType::kHashTableStartIndex + kBucketCount + kDataTableLength; static const int kDataTableStartIndex = CollectionType::kHashTableStartIndex + kBucketCount; STATIC_ASSERT(base::bits::IsPowerOfTwo(kCapacity)); STATIC_ASSERT(kCapacity <= CollectionType::kMaxCapacity); // Allocate the table and add the proper map. const ElementsKind elements_kind = HOLEY_ELEMENTS; Node* const length_intptr = IntPtrConstant(kFixedArrayLength); Node* const table = AllocateFixedArray(elements_kind, length_intptr); CSA_ASSERT(this, IntPtrLessThanOrEqual( length_intptr, IntPtrConstant(FixedArray::kMaxRegularLength))); Heap::RootListIndex map_index = Heap::kOrderedHashTableMapRootIndex; // TODO(gsathya): Directly store correct in AllocateFixedArray, // instead of overwriting here. StoreMapNoWriteBarrier(table, map_index); // Initialize the OrderedHashTable fields. const WriteBarrierMode barrier_mode = SKIP_WRITE_BARRIER; StoreFixedArrayElement(table, CollectionType::kNumberOfElementsIndex, SmiConstant(0), barrier_mode); StoreFixedArrayElement(table, CollectionType::kNumberOfDeletedElementsIndex, SmiConstant(0), barrier_mode); StoreFixedArrayElement(table, CollectionType::kNumberOfBucketsIndex, SmiConstant(kBucketCount), barrier_mode); // Fill the buckets with kNotFound. Node* const not_found = SmiConstant(CollectionType::kNotFound); STATIC_ASSERT(CollectionType::kHashTableStartIndex == CollectionType::kNumberOfBucketsIndex + 1); STATIC_ASSERT((CollectionType::kHashTableStartIndex + kBucketCount) == kDataTableStartIndex); for (int i = 0; i < kBucketCount; i++) { StoreFixedArrayElement(table, CollectionType::kHashTableStartIndex + i, not_found, barrier_mode); } // Fill the data table with undefined. STATIC_ASSERT(kDataTableStartIndex + kDataTableLength == kFixedArrayLength); for (int i = 0; i < kDataTableLength; i++) { StoreFixedArrayElement(table, kDataTableStartIndex + i, UndefinedConstant(), barrier_mode); } return table; } Node* CollectionsBuiltinsAssembler::AllocateJSCollection( Node* js_map_function) { CSA_ASSERT(this, IsConstructorMap(LoadMap(js_map_function))); Node* const initial_map = LoadObjectField( js_map_function, JSFunction::kPrototypeOrInitialMapOffset); Node* const instance = AllocateJSObjectFromMap(initial_map); StoreObjectFieldRoot(instance, JSMap::kTableOffset, Heap::kUndefinedValueRootIndex); return instance; } template <typename IteratorType> Node* CollectionsBuiltinsAssembler::AllocateJSCollectionIterator( Node* context, int map_index, Node* collection) { Node* const table = LoadObjectField(collection, JSCollection::kTableOffset); Node* const native_context = LoadNativeContext(context); Node* const iterator_map = LoadContextElement(native_context, map_index); Node* const iterator = AllocateInNewSpace(IteratorType::kSize); StoreMapNoWriteBarrier(iterator, iterator_map); StoreObjectFieldRoot(iterator, IteratorType::kPropertiesOrHashOffset, Heap::kEmptyFixedArrayRootIndex); StoreObjectFieldRoot(iterator, IteratorType::kElementsOffset, Heap::kEmptyFixedArrayRootIndex); StoreObjectFieldNoWriteBarrier(iterator, IteratorType::kTableOffset, table); StoreObjectFieldNoWriteBarrier(iterator, IteratorType::kIndexOffset, SmiConstant(0)); return iterator; } TF_BUILTIN(MapConstructor, CollectionsBuiltinsAssembler) { const int kIterableArg = 0; Node* argc = ChangeInt32ToIntPtr(Parameter(BuiltinDescriptor::kArgumentsCount)); CodeStubArguments args(this, argc); Node* const iterable = args.GetOptionalArgumentValue(kIterableArg); Node* const new_target = Parameter(BuiltinDescriptor::kNewTarget); Node* const context = Parameter(BuiltinDescriptor::kContext); Label if_target_is_undefined(this, Label::kDeferred); GotoIf(IsUndefined(new_target), &if_target_is_undefined); Node* const native_context = LoadNativeContext(context); Node* const js_map_fun = LoadContextElement(native_context, Context::JS_MAP_FUN_INDEX); VARIABLE(var_result, MachineRepresentation::kTagged); Label init(this), exit(this), if_targetisnotmodified(this), if_targetismodified(this); Branch(WordEqual(js_map_fun, new_target), &if_targetisnotmodified, &if_targetismodified); BIND(&if_targetisnotmodified); { Node* const instance = AllocateJSCollection(js_map_fun); var_result.Bind(instance); Goto(&init); } BIND(&if_targetismodified); { ConstructorBuiltinsAssembler constructor_assembler(this->state()); Node* const instance = constructor_assembler.EmitFastNewObject( context, js_map_fun, new_target); var_result.Bind(instance); Goto(&init); } BIND(&init); Node* table = AllocateOrderedHashTable<OrderedHashMap>(); StoreObjectField(var_result.value(), JSMap::kTableOffset, table); GotoIf(Word32Or(IsUndefined(iterable), IsNull(iterable)), &exit); Label if_notcallable(this); // TODO(gsathya): Add fast path for unmodified maps. Node* const adder = GetProperty(context, var_result.value(), isolate()->factory()->set_string()); GotoIf(TaggedIsSmi(adder), &if_notcallable); GotoIfNot(IsCallable(adder), &if_notcallable); IteratorBuiltinsAssembler iterator_assembler(this->state()); Node* const iterator = iterator_assembler.GetIterator(context, iterable); GotoIf(IsUndefined(iterator), &exit); Node* const fast_iterator_result_map = LoadContextElement(native_context, Context::ITERATOR_RESULT_MAP_INDEX); VARIABLE(var_exception, MachineRepresentation::kTagged, TheHoleConstant()); Label loop(this), if_notobject(this), if_exception(this); Goto(&loop); BIND(&loop); { Node* const next = iterator_assembler.IteratorStep( context, iterator, &exit, fast_iterator_result_map); Node* const next_value = iterator_assembler.IteratorValue( context, next, fast_iterator_result_map); GotoIf(TaggedIsSmi(next_value), &if_notobject); GotoIfNot(IsJSReceiver(next_value), &if_notobject); Node* const k = GetProperty(context, next_value, isolate()->factory()->zero_string()); GotoIfException(k, &if_exception, &var_exception); Node* const v = GetProperty(context, next_value, isolate()->factory()->one_string()); GotoIfException(v, &if_exception, &var_exception); Node* add_call = CallJS(CodeFactory::Call(isolate()), context, adder, var_result.value(), k, v); GotoIfException(add_call, &if_exception, &var_exception); Goto(&loop); BIND(&if_notobject); { Node* const exception = MakeTypeError( MessageTemplate::kIteratorValueNotAnObject, context, next_value); var_exception.Bind(exception); Goto(&if_exception); } } BIND(&if_exception); { iterator_assembler.IteratorCloseOnException(context, iterator, &var_exception); } BIND(&if_notcallable); { Node* const receiver_str = HeapConstant(isolate()->factory()->add_string()); ThrowTypeError(context, MessageTemplate::kPropertyNotFunction, adder, receiver_str, var_result.value()); } BIND(&if_target_is_undefined); ThrowTypeError(context, MessageTemplate::kConstructorNotFunction, HeapConstant(isolate()->factory()->Map_string())); BIND(&exit); args.PopAndReturn(var_result.value()); } TF_BUILTIN(SetConstructor, CollectionsBuiltinsAssembler) { const int kIterableArg = 0; Node* argc = ChangeInt32ToIntPtr(Parameter(BuiltinDescriptor::kArgumentsCount)); CodeStubArguments args(this, argc); Node* const iterable = args.GetOptionalArgumentValue(kIterableArg); Node* const new_target = Parameter(BuiltinDescriptor::kNewTarget); Node* const context = Parameter(BuiltinDescriptor::kContext); Label if_target_is_undefined(this, Label::kDeferred); GotoIf(IsUndefined(new_target), &if_target_is_undefined); Node* const native_context = LoadNativeContext(context); Node* const js_set_fun = LoadContextElement(native_context, Context::JS_SET_FUN_INDEX); VARIABLE(var_result, MachineRepresentation::kTagged); Label init(this), exit(this), if_targetisnotmodified(this), if_targetismodified(this); Branch(WordEqual(js_set_fun, new_target), &if_targetisnotmodified, &if_targetismodified); BIND(&if_targetisnotmodified); { Node* const instance = AllocateJSCollection(js_set_fun); var_result.Bind(instance); Goto(&init); } BIND(&if_targetismodified); { ConstructorBuiltinsAssembler constructor_assembler(this->state()); Node* const instance = constructor_assembler.EmitFastNewObject( context, js_set_fun, new_target); var_result.Bind(instance); Goto(&init); } BIND(&init); Node* table = AllocateOrderedHashTable<OrderedHashSet>(); StoreObjectField(var_result.value(), JSSet::kTableOffset, table); GotoIf(Word32Or(IsUndefined(iterable), IsNull(iterable)), &exit); Label if_notcallable(this); // TODO(gsathya): Add fast path for unmodified maps. Node* const adder = GetProperty(context, var_result.value(), isolate()->factory()->add_string()); GotoIf(TaggedIsSmi(adder), &if_notcallable); GotoIfNot(IsCallable(adder), &if_notcallable); IteratorBuiltinsAssembler iterator_assembler(this->state()); Node* const iterator = iterator_assembler.GetIterator(context, iterable); GotoIf(IsUndefined(iterator), &exit); Node* const fast_iterator_result_map = LoadContextElement(native_context, Context::ITERATOR_RESULT_MAP_INDEX); VARIABLE(var_exception, MachineRepresentation::kTagged, TheHoleConstant()); Label loop(this), if_notobject(this), if_exception(this); Goto(&loop); BIND(&loop); { Node* const next = iterator_assembler.IteratorStep( context, iterator, &exit, fast_iterator_result_map); Node* const next_value = iterator_assembler.IteratorValue( context, next, fast_iterator_result_map); Node* add_call = CallJS(CodeFactory::Call(isolate()), context, adder, var_result.value(), next_value); GotoIfException(add_call, &if_exception, &var_exception); Goto(&loop); } BIND(&if_exception); { iterator_assembler.IteratorCloseOnException(context, iterator, &var_exception); } BIND(&if_notcallable); ThrowTypeError(context, MessageTemplate::kPropertyNotFunction, adder, HeapConstant(isolate()->factory()->add_string()), var_result.value()); BIND(&if_target_is_undefined); ThrowTypeError(context, MessageTemplate::kConstructorNotFunction, HeapConstant(isolate()->factory()->Set_string())); BIND(&exit); args.PopAndReturn(var_result.value()); } Node* CollectionsBuiltinsAssembler::CallGetOrCreateHashRaw(Node* const key) { Node* const function_addr = ExternalConstant(ExternalReference::get_or_create_hash_raw(isolate())); Node* const isolate_ptr = ExternalConstant(ExternalReference::isolate_address(isolate())); MachineType type_ptr = MachineType::Pointer(); MachineType type_tagged = MachineType::AnyTagged(); Node* const result = CallCFunction2(type_tagged, type_ptr, type_tagged, function_addr, isolate_ptr, key); return result; } Node* CollectionsBuiltinsAssembler::CallGetHashRaw(Node* const key) { Node* const function_addr = ExternalConstant( ExternalReference::orderedhashmap_gethash_raw(isolate())); Node* const isolate_ptr = ExternalConstant(ExternalReference::isolate_address(isolate())); MachineType type_ptr = MachineType::Pointer(); MachineType type_tagged = MachineType::AnyTagged(); Node* const result = CallCFunction2(type_tagged, type_ptr, type_tagged, function_addr, isolate_ptr, key); return SmiUntag(result); } Node* CollectionsBuiltinsAssembler::GetHash(Node* const key) { VARIABLE(var_result, MachineType::PointerRepresentation()); Label if_jsobject(this), other(this), done(this); Node* instance_type = LoadMapInstanceType(LoadMap(key)); Branch(IsJSObjectInstanceType(instance_type), &if_jsobject, &other); BIND(&if_jsobject); { Node* hash = LoadHashForJSObject(key, instance_type); // TODO(gsathya): Change all uses of -1 to PropertyArray::kNoHashSentinel. var_result.Bind(SelectConstant( Word32Equal(hash, Int32Constant(PropertyArray::kNoHashSentinel)), IntPtrConstant(-1), ChangeInt32ToIntPtr(hash), MachineType::PointerRepresentation())); Goto(&done); } BIND(&other); { var_result.Bind(CallGetHashRaw(key)); Goto(&done); } BIND(&done); return var_result.value(); } void CollectionsBuiltinsAssembler::SameValueZeroSmi(Node* key_smi, Node* candidate_key, Label* if_same, Label* if_not_same) { // If the key is the same, we are done. GotoIf(WordEqual(candidate_key, key_smi), if_same); // If the candidate key is smi, then it must be different (because // we already checked for equality above). GotoIf(TaggedIsSmi(candidate_key), if_not_same); // If the candidate key is not smi, we still have to check if it is a // heap number with the same value. GotoIfNot(IsHeapNumber(candidate_key), if_not_same); Node* const candidate_key_number = LoadHeapNumberValue(candidate_key); Node* const key_number = SmiToFloat64(key_smi); GotoIf(Float64Equal(candidate_key_number, key_number), if_same); Goto(if_not_same); } template <typename CollectionType> void CollectionsBuiltinsAssembler::FindOrderedHashTableEntryForSmiKey( Node* table, Node* smi_key, Variable* result, Label* entry_found, Label* not_found) { Node* const key_untagged = SmiUntag(smi_key); Node* const hash = ChangeInt32ToIntPtr(ComputeIntegerHash(key_untagged, Int32Constant(0))); CSA_ASSERT(this, IntPtrGreaterThanOrEqual(hash, IntPtrConstant(0))); result->Bind(hash); FindOrderedHashTableEntry<CollectionType>( table, hash, [&](Node* other_key, Label* if_same, Label* if_not_same) { SameValueZeroSmi(smi_key, other_key, if_same, if_not_same); }, result, entry_found, not_found); } template <typename CollectionType> void CollectionsBuiltinsAssembler::FindOrderedHashTableEntryForStringKey( Node* context, Node* table, Node* key_tagged, Variable* result, Label* entry_found, Label* not_found) { Node* const hash = ComputeIntegerHashForString(context, key_tagged); CSA_ASSERT(this, IntPtrGreaterThanOrEqual(hash, IntPtrConstant(0))); result->Bind(hash); FindOrderedHashTableEntry<CollectionType>( table, hash, [&](Node* other_key, Label* if_same, Label* if_not_same) { SameValueZeroString(context, key_tagged, other_key, if_same, if_not_same); }, result, entry_found, not_found); } template <typename CollectionType> void CollectionsBuiltinsAssembler::FindOrderedHashTableEntryForHeapNumberKey( Node* context, Node* table, Node* key_heap_number, Variable* result, Label* entry_found, Label* not_found) { Node* hash = CallGetHashRaw(key_heap_number); CSA_ASSERT(this, IntPtrGreaterThanOrEqual(hash, IntPtrConstant(0))); result->Bind(hash); Node* const key_float = LoadHeapNumberValue(key_heap_number); FindOrderedHashTableEntry<CollectionType>( table, hash, [&](Node* other_key, Label* if_same, Label* if_not_same) { SameValueZeroHeapNumber(key_float, other_key, if_same, if_not_same); }, result, entry_found, not_found); } template <typename CollectionType> void CollectionsBuiltinsAssembler::FindOrderedHashTableEntryForBigIntKey( Node* context, Node* table, Node* key, Variable* result, Label* entry_found, Label* not_found) { Node* hash = CallGetHashRaw(key); CSA_ASSERT(this, IntPtrGreaterThanOrEqual(hash, IntPtrConstant(0))); result->Bind(hash); FindOrderedHashTableEntry<CollectionType>( table, hash, [&](Node* other_key, Label* if_same, Label* if_not_same) { SameValueZeroBigInt(key, other_key, if_same, if_not_same); }, result, entry_found, not_found); } template <typename CollectionType> void CollectionsBuiltinsAssembler::FindOrderedHashTableEntryForOtherKey( Node* context, Node* table, Node* key, Variable* result, Label* entry_found, Label* not_found) { Node* hash = GetHash(key); result->Bind(hash); FindOrderedHashTableEntry<CollectionType>( table, hash, [&](Node* other_key, Label* if_same, Label* if_not_same) { Branch(WordEqual(key, other_key), if_same, if_not_same); }, result, entry_found, not_found); } Node* CollectionsBuiltinsAssembler::ComputeIntegerHashForString( Node* context, Node* string_key) { VARIABLE(var_result, MachineType::PointerRepresentation()); Label hash_not_computed(this), done(this, &var_result); Node* hash = ChangeInt32ToIntPtr(LoadNameHash(string_key, &hash_not_computed)); var_result.Bind(hash); Goto(&done); BIND(&hash_not_computed); var_result.Bind(CallGetHashRaw(string_key)); Goto(&done); BIND(&done); return var_result.value(); } void CollectionsBuiltinsAssembler::SameValueZeroString(Node* context, Node* key_string, Node* candidate_key, Label* if_same, Label* if_not_same) { // If the candidate is not a string, the keys are not equal. GotoIf(TaggedIsSmi(candidate_key), if_not_same); GotoIfNot(IsString(candidate_key), if_not_same); Branch(WordEqual(CallBuiltin(Builtins::kStringEqual, context, key_string, candidate_key), TrueConstant()), if_same, if_not_same); } void CollectionsBuiltinsAssembler::SameValueZeroBigInt(Node* key, Node* candidate_key, Label* if_same, Label* if_not_same) { CSA_ASSERT(this, IsBigInt(key)); GotoIf(TaggedIsSmi(candidate_key), if_not_same); GotoIfNot(IsBigInt(candidate_key), if_not_same); Branch(WordEqual(CallRuntime(Runtime::kBigIntEqual, NoContextConstant(), key, candidate_key), TrueConstant()), if_same, if_not_same); } void CollectionsBuiltinsAssembler::SameValueZeroHeapNumber(Node* key_float, Node* candidate_key, Label* if_same, Label* if_not_same) { Label if_smi(this), if_keyisnan(this); GotoIf(TaggedIsSmi(candidate_key), &if_smi); GotoIfNot(IsHeapNumber(candidate_key), if_not_same); { // {candidate_key} is a heap number. Node* const candidate_float = LoadHeapNumberValue(candidate_key); GotoIf(Float64Equal(key_float, candidate_float), if_same); // SameValueZero needs to treat NaNs as equal. First check if {key_float} // is NaN. BranchIfFloat64IsNaN(key_float, &if_keyisnan, if_not_same); BIND(&if_keyisnan); { // Return true iff {candidate_key} is NaN. Branch(Float64Equal(candidate_float, candidate_float), if_not_same, if_same); } } BIND(&if_smi); { Node* const candidate_float = SmiToFloat64(candidate_key); Branch(Float64Equal(key_float, candidate_float), if_same, if_not_same); } } template <typename CollectionType> void CollectionsBuiltinsAssembler::FindOrderedHashTableEntry( Node* table, Node* hash, std::function<void(Node*, Label*, Label*)> key_compare, Variable* entry_start_position, Label* entry_found, Label* not_found) { // Get the index of the bucket. Node* const number_of_buckets = SmiUntag( LoadFixedArrayElement(table, CollectionType::kNumberOfBucketsIndex)); Node* const bucket = WordAnd(hash, IntPtrSub(number_of_buckets, IntPtrConstant(1))); Node* const first_entry = SmiUntag(LoadFixedArrayElement( table, bucket, CollectionType::kHashTableStartIndex * kPointerSize)); // Walk the bucket chain. Node* entry_start; Label if_key_found(this); { VARIABLE(var_entry, MachineType::PointerRepresentation(), first_entry); Label loop(this, {&var_entry, entry_start_position}), continue_next_entry(this); Goto(&loop); BIND(&loop); // If the entry index is the not-found sentinel, we are done. GotoIf( WordEqual(var_entry.value(), IntPtrConstant(CollectionType::kNotFound)), not_found); // Make sure the entry index is within range. CSA_ASSERT( this, UintPtrLessThan( var_entry.value(), SmiUntag(SmiAdd( LoadFixedArrayElement(table, CollectionType::kNumberOfElementsIndex), LoadFixedArrayElement( table, CollectionType::kNumberOfDeletedElementsIndex))))); // Compute the index of the entry relative to kHashTableStartIndex. entry_start = IntPtrAdd(IntPtrMul(var_entry.value(), IntPtrConstant(CollectionType::kEntrySize)), number_of_buckets); // Load the key from the entry. Node* const candidate_key = LoadFixedArrayElement( table, entry_start, CollectionType::kHashTableStartIndex * kPointerSize); key_compare(candidate_key, &if_key_found, &continue_next_entry); BIND(&continue_next_entry); // Load the index of the next entry in the bucket chain. var_entry.Bind(SmiUntag(LoadFixedArrayElement( table, entry_start, (CollectionType::kHashTableStartIndex + CollectionType::kChainOffset) * kPointerSize))); Goto(&loop); } BIND(&if_key_found); entry_start_position->Bind(entry_start); Goto(entry_found); } TF_BUILTIN(OrderedHashTableHealIndex, CollectionsBuiltinsAssembler) { Node* table = Parameter(Descriptor::kTable); Node* index = Parameter(Descriptor::kIndex); CSA_ASSERT(this, TaggedIsNotSmi(table)); CSA_ASSERT(this, TaggedIsSmi(index)); Label return_index(this), return_zero(this); // Check if we need to update the {index}. GotoIfNot(SmiLessThan(SmiConstant(Smi::kZero), index), &return_zero); // Check if the {table} was cleared. Node* number_of_deleted_elements = LoadAndUntagObjectField( table, OrderedHashTableBase::kNumberOfDeletedElementsOffset); GotoIf(WordEqual(number_of_deleted_elements, IntPtrConstant(OrderedHashTableBase::kClearedTableSentinel)), &return_zero); VARIABLE(var_i, MachineType::PointerRepresentation(), IntPtrConstant(0)); VARIABLE(var_index, MachineRepresentation::kTagged, index); Label loop(this, {&var_i, &var_index}); Goto(&loop); BIND(&loop); { Node* i = var_i.value(); GotoIfNot(IntPtrLessThan(i, number_of_deleted_elements), &return_index); Node* removed_index = LoadFixedArrayElement( table, i, OrderedHashTableBase::kRemovedHolesIndex * kPointerSize); GotoIf(SmiGreaterThanOrEqual(removed_index, index), &return_index); Decrement(&var_index, 1, SMI_PARAMETERS); Increment(&var_i); Goto(&loop); } BIND(&return_index); Return(var_index.value()); BIND(&return_zero); Return(SmiConstant(Smi::kZero)); } template <typename TableType> std::tuple<Node*, Node*> CollectionsBuiltinsAssembler::Transition( Node* const table, Node* const index, UpdateInTransition const& update_in_transition) { VARIABLE(var_index, MachineType::PointerRepresentation(), index); VARIABLE(var_table, MachineRepresentation::kTagged, table); Label if_done(this), if_transition(this, Label::kDeferred); Branch(TaggedIsSmi( LoadObjectField(var_table.value(), TableType::kNextTableOffset)), &if_done, &if_transition); BIND(&if_transition); { Label loop(this, {&var_table, &var_index}), done_loop(this); Goto(&loop); BIND(&loop); { Node* table = var_table.value(); Node* index = var_index.value(); Node* next_table = LoadObjectField(table, TableType::kNextTableOffset); GotoIf(TaggedIsSmi(next_table), &done_loop); var_table.Bind(next_table); var_index.Bind( SmiUntag(CallBuiltin(Builtins::kOrderedHashTableHealIndex, NoContextConstant(), table, SmiTag(index)))); Goto(&loop); } BIND(&done_loop); // Update with the new {table} and {index}. update_in_transition(var_table.value(), var_index.value()); Goto(&if_done); } BIND(&if_done); return std::tuple<Node*, Node*>(var_table.value(), var_index.value()); } template <typename IteratorType, typename TableType> std::tuple<Node*, Node*> CollectionsBuiltinsAssembler::TransitionAndUpdate( Node* const iterator) { return Transition<TableType>( LoadObjectField(iterator, IteratorType::kTableOffset), LoadAndUntagObjectField(iterator, IteratorType::kIndexOffset), [this, iterator](Node* const table, Node* const index) { // Update the {iterator} with the new state. StoreObjectField(iterator, IteratorType::kTableOffset, table); StoreObjectFieldNoWriteBarrier(iterator, IteratorType::kIndexOffset, SmiTag(index)); }); } template <typename TableType> std::tuple<Node*, Node*, Node*> CollectionsBuiltinsAssembler::NextSkipHoles( Node* table, Node* index, Label* if_end) { // Compute the used capacity for the {table}. Node* number_of_buckets = LoadAndUntagObjectField(table, TableType::kNumberOfBucketsOffset); Node* number_of_elements = LoadAndUntagObjectField(table, TableType::kNumberOfElementsOffset); Node* number_of_deleted_elements = LoadAndUntagObjectField(table, TableType::kNumberOfDeletedElementsOffset); Node* used_capacity = IntPtrAdd(number_of_elements, number_of_deleted_elements); Node* entry_key; Node* entry_start_position; VARIABLE(var_index, MachineType::PointerRepresentation(), index); Label loop(this, &var_index), done_loop(this); Goto(&loop); BIND(&loop); { GotoIfNot(IntPtrLessThan(var_index.value(), used_capacity), if_end); entry_start_position = IntPtrAdd( IntPtrMul(var_index.value(), IntPtrConstant(TableType::kEntrySize)), number_of_buckets); entry_key = LoadFixedArrayElement(table, entry_start_position, TableType::kHashTableStartIndex * kPointerSize); Increment(&var_index); Branch(IsTheHole(entry_key), &loop, &done_loop); } BIND(&done_loop); return std::tuple<Node*, Node*, Node*>(entry_key, entry_start_position, var_index.value()); } TF_BUILTIN(MapGet, CollectionsBuiltinsAssembler) { Node* const receiver = Parameter(Descriptor::kReceiver); Node* const key = Parameter(Descriptor::kKey); Node* const context = Parameter(Descriptor::kContext); ThrowIfNotInstanceType(context, receiver, JS_MAP_TYPE, "Map.prototype.get"); Node* const table = LoadObjectField(receiver, JSMap::kTableOffset); Node* index = CallBuiltin(Builtins::kMapLookupHashIndex, context, table, key); Label if_found(this), if_not_found(this); Branch(SmiGreaterThanOrEqual(index, SmiConstant(0)), &if_found, &if_not_found); BIND(&if_found); Return(LoadFixedArrayElement(table, SmiUntag(index))); BIND(&if_not_found); Return(UndefinedConstant()); } TF_BUILTIN(MapHas, CollectionsBuiltinsAssembler) { Node* const receiver = Parameter(Descriptor::kReceiver); Node* const key = Parameter(Descriptor::kKey); Node* const context = Parameter(Descriptor::kContext); ThrowIfNotInstanceType(context, receiver, JS_MAP_TYPE, "Map.prototype.has"); Node* const table = LoadObjectField(receiver, JSMap::kTableOffset); Node* index = CallBuiltin(Builtins::kMapLookupHashIndex, context, table, key); Label if_found(this), if_not_found(this); Branch(SmiGreaterThanOrEqual(index, SmiConstant(0)), &if_found, &if_not_found); BIND(&if_found); Return(TrueConstant()); BIND(&if_not_found); Return(FalseConstant()); } Node* CollectionsBuiltinsAssembler::NormalizeNumberKey(Node* const key) { VARIABLE(result, MachineRepresentation::kTagged, key); Label done(this); GotoIf(TaggedIsSmi(key), &done); GotoIfNot(IsHeapNumber(key), &done); Node* const number = LoadHeapNumberValue(key); GotoIfNot(Float64Equal(number, Float64Constant(0.0)), &done); // We know the value is zero, so we take the key to be Smi 0. // Another option would be to normalize to Smi here. result.Bind(SmiConstant(0)); Goto(&done); BIND(&done); return result.value(); } TF_BUILTIN(MapSet, CollectionsBuiltinsAssembler) { Node* const receiver = Parameter(Descriptor::kReceiver); Node* key = Parameter(Descriptor::kKey); Node* const value = Parameter(Descriptor::kValue); Node* const context = Parameter(Descriptor::kContext); ThrowIfNotInstanceType(context, receiver, JS_MAP_TYPE, "Map.prototype.set"); key = NormalizeNumberKey(key); Node* const table = LoadObjectField(receiver, JSMap::kTableOffset); VARIABLE(entry_start_position_or_hash, MachineType::PointerRepresentation(), IntPtrConstant(0)); Label entry_found(this), not_found(this); TryLookupOrderedHashTableIndex<OrderedHashMap>(table, key, context, &entry_start_position_or_hash, &entry_found, &not_found); BIND(&entry_found); // If we found the entry, we just store the value there. StoreFixedArrayElement(table, entry_start_position_or_hash.value(), value, UPDATE_WRITE_BARRIER, kPointerSize * (OrderedHashMap::kHashTableStartIndex + OrderedHashMap::kValueOffset)); Return(receiver); Label no_hash(this), add_entry(this), store_new_entry(this); BIND(&not_found); { // If we have a hash code, we can start adding the new entry. GotoIf(IntPtrGreaterThanOrEqual(entry_start_position_or_hash.value(), IntPtrConstant(0)), &add_entry); // Otherwise, go to runtime to compute the hash code. entry_start_position_or_hash.Bind(SmiUntag(CallGetOrCreateHashRaw(key))); Goto(&add_entry); } BIND(&add_entry); VARIABLE(number_of_buckets, MachineType::PointerRepresentation()); VARIABLE(occupancy, MachineType::PointerRepresentation()); VARIABLE(table_var, MachineRepresentation::kTaggedPointer, table); { // Check we have enough space for the entry. number_of_buckets.Bind(SmiUntag( LoadFixedArrayElement(table, OrderedHashMap::kNumberOfBucketsIndex))); STATIC_ASSERT(OrderedHashMap::kLoadFactor == 2); Node* const capacity = WordShl(number_of_buckets.value(), 1); Node* const number_of_elements = SmiUntag( CAST(LoadObjectField(table, OrderedHashMap::kNumberOfElementsOffset))); Node* const number_of_deleted = SmiUntag(CAST(LoadObjectField( table, OrderedHashMap::kNumberOfDeletedElementsOffset))); occupancy.Bind(IntPtrAdd(number_of_elements, number_of_deleted)); GotoIf(IntPtrLessThan(occupancy.value(), capacity), &store_new_entry); // We do not have enough space, grow the table and reload the relevant // fields. CallRuntime(Runtime::kMapGrow, context, receiver); table_var.Bind(LoadObjectField(receiver, JSMap::kTableOffset)); number_of_buckets.Bind(SmiUntag(LoadFixedArrayElement( table_var.value(), OrderedHashMap::kNumberOfBucketsIndex))); Node* const new_number_of_elements = SmiUntag(CAST(LoadObjectField( table_var.value(), OrderedHashMap::kNumberOfElementsOffset))); Node* const new_number_of_deleted = SmiUntag(CAST(LoadObjectField( table_var.value(), OrderedHashMap::kNumberOfDeletedElementsOffset))); occupancy.Bind(IntPtrAdd(new_number_of_elements, new_number_of_deleted)); Goto(&store_new_entry); } BIND(&store_new_entry); // Store the key, value and connect the element to the bucket chain. StoreOrderedHashMapNewEntry(table_var.value(), key, value, entry_start_position_or_hash.value(), number_of_buckets.value(), occupancy.value()); Return(receiver); } void CollectionsBuiltinsAssembler::StoreOrderedHashMapNewEntry( Node* const table, Node* const key, Node* const value, Node* const hash, Node* const number_of_buckets, Node* const occupancy) { Node* const bucket = WordAnd(hash, IntPtrSub(number_of_buckets, IntPtrConstant(1))); Node* const bucket_entry = LoadFixedArrayElement( table, bucket, OrderedHashMap::kHashTableStartIndex * kPointerSize); // Store the entry elements. Node* const entry_start = IntPtrAdd( IntPtrMul(occupancy, IntPtrConstant(OrderedHashMap::kEntrySize)), number_of_buckets); StoreFixedArrayElement(table, entry_start, key, UPDATE_WRITE_BARRIER, kPointerSize * OrderedHashMap::kHashTableStartIndex); StoreFixedArrayElement(table, entry_start, value, UPDATE_WRITE_BARRIER, kPointerSize * (OrderedHashMap::kHashTableStartIndex + OrderedHashMap::kValueOffset)); StoreFixedArrayElement(table, entry_start, bucket_entry, SKIP_WRITE_BARRIER, kPointerSize * (OrderedHashMap::kHashTableStartIndex + OrderedHashMap::kChainOffset)); // Update the bucket head. StoreFixedArrayElement(table, bucket, SmiTag(occupancy), SKIP_WRITE_BARRIER, OrderedHashMap::kHashTableStartIndex * kPointerSize); // Bump the elements count. Node* const number_of_elements = LoadObjectField(table, OrderedHashMap::kNumberOfElementsOffset); StoreObjectFieldNoWriteBarrier(table, OrderedHashMap::kNumberOfElementsOffset, SmiAdd(number_of_elements, SmiConstant(1))); } TF_BUILTIN(MapDelete, CollectionsBuiltinsAssembler) { Node* const receiver = Parameter(Descriptor::kReceiver); Node* key = Parameter(Descriptor::kKey); Node* const context = Parameter(Descriptor::kContext); ThrowIfNotInstanceType(context, receiver, JS_MAP_TYPE, "Map.prototype.delete"); Node* const table = LoadObjectField(receiver, JSMap::kTableOffset); VARIABLE(entry_start_position_or_hash, MachineType::PointerRepresentation(), IntPtrConstant(0)); Label entry_found(this), not_found(this); TryLookupOrderedHashTableIndex<OrderedHashMap>(table, key, context, &entry_start_position_or_hash, &entry_found, &not_found); BIND(&not_found); Return(FalseConstant()); BIND(&entry_found); // If we found the entry, mark the entry as deleted. StoreFixedArrayElement(table, entry_start_position_or_hash.value(), TheHoleConstant(), UPDATE_WRITE_BARRIER, kPointerSize * OrderedHashMap::kHashTableStartIndex); StoreFixedArrayElement(table, entry_start_position_or_hash.value(), TheHoleConstant(), UPDATE_WRITE_BARRIER, kPointerSize * (OrderedHashMap::kHashTableStartIndex + OrderedHashMap::kValueOffset)); // Decrement the number of elements, increment the number of deleted elements. Node* const number_of_elements = SmiSub( CAST(LoadObjectField(table, OrderedHashMap::kNumberOfElementsOffset)), SmiConstant(1)); StoreObjectFieldNoWriteBarrier(table, OrderedHashMap::kNumberOfElementsOffset, number_of_elements); Node* const number_of_deleted = SmiAdd(CAST(LoadObjectField( table, OrderedHashMap::kNumberOfDeletedElementsOffset)), SmiConstant(1)); StoreObjectFieldNoWriteBarrier( table, OrderedHashMap::kNumberOfDeletedElementsOffset, number_of_deleted); Node* const number_of_buckets = LoadFixedArrayElement(table, OrderedHashMap::kNumberOfBucketsIndex); // If there fewer elements than #buckets / 2, shrink the table. Label shrink(this); GotoIf(SmiLessThan(SmiAdd(number_of_elements, number_of_elements), number_of_buckets), &shrink); Return(TrueConstant()); BIND(&shrink); CallRuntime(Runtime::kMapShrink, context, receiver); Return(TrueConstant()); } TF_BUILTIN(SetAdd, CollectionsBuiltinsAssembler) { Node* const receiver = Parameter(Descriptor::kReceiver); Node* key = Parameter(Descriptor::kKey); Node* const context = Parameter(Descriptor::kContext); ThrowIfNotInstanceType(context, receiver, JS_SET_TYPE, "Set.prototype.add"); key = NormalizeNumberKey(key); Node* const table = LoadObjectField(receiver, JSMap::kTableOffset); VARIABLE(entry_start_position_or_hash, MachineType::PointerRepresentation(), IntPtrConstant(0)); Label entry_found(this), not_found(this); TryLookupOrderedHashTableIndex<OrderedHashSet>(table, key, context, &entry_start_position_or_hash, &entry_found, &not_found); BIND(&entry_found); // The entry was found, there is nothing to do. Return(receiver); Label no_hash(this), add_entry(this), store_new_entry(this); BIND(&not_found); { // If we have a hash code, we can start adding the new entry. GotoIf(IntPtrGreaterThanOrEqual(entry_start_position_or_hash.value(), IntPtrConstant(0)), &add_entry); // Otherwise, go to runtime to compute the hash code. entry_start_position_or_hash.Bind(SmiUntag((CallGetOrCreateHashRaw(key)))); Goto(&add_entry); } BIND(&add_entry); VARIABLE(number_of_buckets, MachineType::PointerRepresentation()); VARIABLE(occupancy, MachineType::PointerRepresentation()); VARIABLE(table_var, MachineRepresentation::kTaggedPointer, table); { // Check we have enough space for the entry. number_of_buckets.Bind(SmiUntag( LoadFixedArrayElement(table, OrderedHashSet::kNumberOfBucketsIndex))); STATIC_ASSERT(OrderedHashSet::kLoadFactor == 2); Node* const capacity = WordShl(number_of_buckets.value(), 1); Node* const number_of_elements = SmiUntag( CAST(LoadObjectField(table, OrderedHashSet::kNumberOfElementsOffset))); Node* const number_of_deleted = SmiUntag(CAST(LoadObjectField( table, OrderedHashSet::kNumberOfDeletedElementsOffset))); occupancy.Bind(IntPtrAdd(number_of_elements, number_of_deleted)); GotoIf(IntPtrLessThan(occupancy.value(), capacity), &store_new_entry); // We do not have enough space, grow the table and reload the relevant // fields. CallRuntime(Runtime::kSetGrow, context, receiver); table_var.Bind(LoadObjectField(receiver, JSMap::kTableOffset)); number_of_buckets.Bind(SmiUntag(LoadFixedArrayElement( table_var.value(), OrderedHashSet::kNumberOfBucketsIndex))); Node* const new_number_of_elements = SmiUntag(CAST(LoadObjectField( table_var.value(), OrderedHashSet::kNumberOfElementsOffset))); Node* const new_number_of_deleted = SmiUntag(CAST(LoadObjectField( table_var.value(), OrderedHashSet::kNumberOfDeletedElementsOffset))); occupancy.Bind(IntPtrAdd(new_number_of_elements, new_number_of_deleted)); Goto(&store_new_entry); } BIND(&store_new_entry); // Store the key, value and connect the element to the bucket chain. StoreOrderedHashSetNewEntry(table_var.value(), key, entry_start_position_or_hash.value(), number_of_buckets.value(), occupancy.value()); Return(receiver); } void CollectionsBuiltinsAssembler::StoreOrderedHashSetNewEntry( Node* const table, Node* const key, Node* const hash, Node* const number_of_buckets, Node* const occupancy) { Node* const bucket = WordAnd(hash, IntPtrSub(number_of_buckets, IntPtrConstant(1))); Node* const bucket_entry = LoadFixedArrayElement( table, bucket, OrderedHashSet::kHashTableStartIndex * kPointerSize); // Store the entry elements. Node* const entry_start = IntPtrAdd( IntPtrMul(occupancy, IntPtrConstant(OrderedHashSet::kEntrySize)), number_of_buckets); StoreFixedArrayElement(table, entry_start, key, UPDATE_WRITE_BARRIER, kPointerSize * OrderedHashSet::kHashTableStartIndex); StoreFixedArrayElement(table, entry_start, bucket_entry, SKIP_WRITE_BARRIER, kPointerSize * (OrderedHashSet::kHashTableStartIndex + OrderedHashSet::kChainOffset)); // Update the bucket head. StoreFixedArrayElement(table, bucket, SmiTag(occupancy), SKIP_WRITE_BARRIER, OrderedHashSet::kHashTableStartIndex * kPointerSize); // Bump the elements count. Node* const number_of_elements = LoadObjectField(table, OrderedHashSet::kNumberOfElementsOffset); StoreObjectFieldNoWriteBarrier(table, OrderedHashSet::kNumberOfElementsOffset, SmiAdd(number_of_elements, SmiConstant(1))); } TF_BUILTIN(SetDelete, CollectionsBuiltinsAssembler) { Node* const receiver = Parameter(Descriptor::kReceiver); Node* key = Parameter(Descriptor::kKey); Node* const context = Parameter(Descriptor::kContext); ThrowIfNotInstanceType(context, receiver, JS_SET_TYPE, "Set.prototype.delete"); Node* const table = LoadObjectField(receiver, JSMap::kTableOffset); VARIABLE(entry_start_position_or_hash, MachineType::PointerRepresentation(), IntPtrConstant(0)); Label entry_found(this), not_found(this); TryLookupOrderedHashTableIndex<OrderedHashSet>(table, key, context, &entry_start_position_or_hash, &entry_found, &not_found); BIND(&not_found); Return(FalseConstant()); BIND(&entry_found); // If we found the entry, mark the entry as deleted. StoreFixedArrayElement(table, entry_start_position_or_hash.value(), TheHoleConstant(), UPDATE_WRITE_BARRIER, kPointerSize * OrderedHashSet::kHashTableStartIndex); // Decrement the number of elements, increment the number of deleted elements. Node* const number_of_elements = SmiSub( CAST(LoadObjectField(table, OrderedHashSet::kNumberOfElementsOffset)), SmiConstant(1)); StoreObjectFieldNoWriteBarrier(table, OrderedHashSet::kNumberOfElementsOffset, number_of_elements); Node* const number_of_deleted = SmiAdd(CAST(LoadObjectField( table, OrderedHashSet::kNumberOfDeletedElementsOffset)), SmiConstant(1)); StoreObjectFieldNoWriteBarrier( table, OrderedHashSet::kNumberOfDeletedElementsOffset, number_of_deleted); Node* const number_of_buckets = LoadFixedArrayElement(table, OrderedHashSet::kNumberOfBucketsIndex); // If there fewer elements than #buckets / 2, shrink the table. Label shrink(this); GotoIf(SmiLessThan(SmiAdd(number_of_elements, number_of_elements), number_of_buckets), &shrink); Return(TrueConstant()); BIND(&shrink); CallRuntime(Runtime::kSetShrink, context, receiver); Return(TrueConstant()); } TF_BUILTIN(MapPrototypeEntries, CollectionsBuiltinsAssembler) { Node* const receiver = Parameter(Descriptor::kReceiver); Node* const context = Parameter(Descriptor::kContext); ThrowIfNotInstanceType(context, receiver, JS_MAP_TYPE, "Map.prototype.entries"); Return(AllocateJSCollectionIterator<JSMapIterator>( context, Context::MAP_KEY_VALUE_ITERATOR_MAP_INDEX, receiver)); } TF_BUILTIN(MapPrototypeGetSize, CollectionsBuiltinsAssembler) { Node* const receiver = Parameter(Descriptor::kReceiver); Node* const context = Parameter(Descriptor::kContext); ThrowIfNotInstanceType(context, receiver, JS_MAP_TYPE, "get Map.prototype.size"); Node* const table = LoadObjectField(receiver, JSMap::kTableOffset); Return(LoadObjectField(table, OrderedHashMap::kNumberOfElementsOffset)); } TF_BUILTIN(MapPrototypeForEach, CollectionsBuiltinsAssembler) { const char* const kMethodName = "Map.prototype.forEach"; Node* const argc = Parameter(BuiltinDescriptor::kArgumentsCount); Node* const context = Parameter(BuiltinDescriptor::kContext); CodeStubArguments args(this, ChangeInt32ToIntPtr(argc)); Node* const receiver = args.GetReceiver(); Node* const callback = args.GetOptionalArgumentValue(0); Node* const this_arg = args.GetOptionalArgumentValue(1); ThrowIfNotInstanceType(context, receiver, JS_MAP_TYPE, kMethodName); // Ensure that {callback} is actually callable. Label callback_not_callable(this, Label::kDeferred); GotoIf(TaggedIsSmi(callback), &callback_not_callable); GotoIfNot(IsCallable(callback), &callback_not_callable); VARIABLE(var_index, MachineType::PointerRepresentation(), IntPtrConstant(0)); VARIABLE(var_table, MachineRepresentation::kTagged, LoadObjectField(receiver, JSMap::kTableOffset)); Label loop(this, {&var_index, &var_table}), done_loop(this); Goto(&loop); BIND(&loop); { // Transition {table} and {index} if there was any modification to // the {receiver} while we're iterating. Node* index = var_index.value(); Node* table = var_table.value(); std::tie(table, index) = Transition<OrderedHashMap>(table, index, [](Node*, Node*) {}); // Read the next entry from the {table}, skipping holes. Node* entry_key; Node* entry_start_position; std::tie(entry_key, entry_start_position, index) = NextSkipHoles<OrderedHashMap>(table, index, &done_loop); // Load the entry value as well. Node* entry_value = LoadFixedArrayElement( table, entry_start_position, (OrderedHashMap::kHashTableStartIndex + OrderedHashMap::kValueOffset) * kPointerSize); // Invoke the {callback} passing the {entry_key}, {entry_value} and the // {receiver}. CallJS(CodeFactory::Call(isolate()), context, callback, this_arg, entry_value, entry_key, receiver); // Continue with the next entry. var_index.Bind(index); var_table.Bind(table); Goto(&loop); } BIND(&done_loop); args.PopAndReturn(UndefinedConstant()); BIND(&callback_not_callable); { CallRuntime(Runtime::kThrowCalledNonCallable, context, callback); Unreachable(); } } TF_BUILTIN(MapPrototypeKeys, CollectionsBuiltinsAssembler) { Node* const receiver = Parameter(Descriptor::kReceiver); Node* const context = Parameter(Descriptor::kContext); ThrowIfNotInstanceType(context, receiver, JS_MAP_TYPE, "Map.prototype.keys"); Return(AllocateJSCollectionIterator<JSMapIterator>( context, Context::MAP_KEY_ITERATOR_MAP_INDEX, receiver)); } TF_BUILTIN(MapPrototypeValues, CollectionsBuiltinsAssembler) { Node* const receiver = Parameter(Descriptor::kReceiver); Node* const context = Parameter(Descriptor::kContext); ThrowIfNotInstanceType(context, receiver, JS_MAP_TYPE, "Map.prototype.values"); Return(AllocateJSCollectionIterator<JSMapIterator>( context, Context::MAP_VALUE_ITERATOR_MAP_INDEX, receiver)); } TF_BUILTIN(MapIteratorPrototypeNext, CollectionsBuiltinsAssembler) { const char* const kMethodName = "Map Iterator.prototype.next"; Node* const receiver = Parameter(Descriptor::kReceiver); Node* const context = Parameter(Descriptor::kContext); // Ensure that the {receiver} is actually a JSMapIterator. Label if_receiver_valid(this), if_receiver_invalid(this, Label::kDeferred); GotoIf(TaggedIsSmi(receiver), &if_receiver_invalid); Node* const receiver_instance_type = LoadInstanceType(receiver); GotoIf( InstanceTypeEqual(receiver_instance_type, JS_MAP_KEY_VALUE_ITERATOR_TYPE), &if_receiver_valid); GotoIf(InstanceTypeEqual(receiver_instance_type, JS_MAP_KEY_ITERATOR_TYPE), &if_receiver_valid); Branch(InstanceTypeEqual(receiver_instance_type, JS_MAP_VALUE_ITERATOR_TYPE), &if_receiver_valid, &if_receiver_invalid); BIND(&if_receiver_invalid); ThrowIncompatibleMethodReceiver(context, kMethodName, receiver); BIND(&if_receiver_valid); // Check if the {receiver} is exhausted. VARIABLE(var_done, MachineRepresentation::kTagged, TrueConstant()); VARIABLE(var_value, MachineRepresentation::kTagged, UndefinedConstant()); Label return_value(this, {&var_done, &var_value}), return_entry(this), return_end(this, Label::kDeferred); // Transition the {receiver} table if necessary. Node* table; Node* index; std::tie(table, index) = TransitionAndUpdate<JSMapIterator, OrderedHashMap>(receiver); // Read the next entry from the {table}, skipping holes. Node* entry_key; Node* entry_start_position; std::tie(entry_key, entry_start_position, index) = NextSkipHoles<OrderedHashMap>(table, index, &return_end); StoreObjectFieldNoWriteBarrier(receiver, JSMapIterator::kIndexOffset, SmiTag(index)); var_value.Bind(entry_key); var_done.Bind(FalseConstant()); // Check how to return the {key} (depending on {receiver} type). GotoIf(InstanceTypeEqual(receiver_instance_type, JS_MAP_KEY_ITERATOR_TYPE), &return_value); var_value.Bind(LoadFixedArrayElement( table, entry_start_position, (OrderedHashMap::kHashTableStartIndex + OrderedHashMap::kValueOffset) * kPointerSize)); Branch(InstanceTypeEqual(receiver_instance_type, JS_MAP_VALUE_ITERATOR_TYPE), &return_value, &return_entry); BIND(&return_entry); { Node* result = AllocateJSIteratorResultForEntry(context, entry_key, var_value.value()); Return(result); } BIND(&return_value); { Node* result = AllocateJSIteratorResult(context, var_value.value(), var_done.value()); Return(result); } BIND(&return_end); { StoreObjectFieldRoot(receiver, JSMapIterator::kTableOffset, Heap::kEmptyOrderedHashTableRootIndex); Goto(&return_value); } } TF_BUILTIN(SetHas, CollectionsBuiltinsAssembler) { Node* const receiver = Parameter(Descriptor::kReceiver); Node* const key = Parameter(Descriptor::kKey); Node* const context = Parameter(Descriptor::kContext); ThrowIfNotInstanceType(context, receiver, JS_SET_TYPE, "Set.prototype.has"); Node* const table = LoadObjectField(receiver, JSMap::kTableOffset); VARIABLE(entry_start_position, MachineType::PointerRepresentation(), IntPtrConstant(0)); VARIABLE(result, MachineRepresentation::kTaggedSigned, IntPtrConstant(0)); Label if_key_smi(this), if_key_string(this), if_key_heap_number(this), if_key_bigint(this), entry_found(this), not_found(this), done(this); GotoIf(TaggedIsSmi(key), &if_key_smi); Node* key_map = LoadMap(key); Node* key_instance_type = LoadMapInstanceType(key_map); GotoIf(IsStringInstanceType(key_instance_type), &if_key_string); GotoIf(IsHeapNumberMap(key_map), &if_key_heap_number); GotoIf(IsBigIntInstanceType(key_instance_type), &if_key_bigint); FindOrderedHashTableEntryForOtherKey<OrderedHashSet>( context, table, key, &entry_start_position, &entry_found, &not_found); BIND(&if_key_smi); { FindOrderedHashTableEntryForSmiKey<OrderedHashSet>( table, key, &entry_start_position, &entry_found, &not_found); } BIND(&if_key_string); { FindOrderedHashTableEntryForStringKey<OrderedHashSet>( context, table, key, &entry_start_position, &entry_found, &not_found); } BIND(&if_key_heap_number); { FindOrderedHashTableEntryForHeapNumberKey<OrderedHashSet>( context, table, key, &entry_start_position, &entry_found, &not_found); } BIND(&if_key_bigint); { FindOrderedHashTableEntryForBigIntKey<OrderedHashSet>( context, table, key, &entry_start_position, &entry_found, &not_found); } BIND(&entry_found); Return(TrueConstant()); BIND(&not_found); Return(FalseConstant()); } TF_BUILTIN(SetPrototypeEntries, CollectionsBuiltinsAssembler) { Node* const receiver = Parameter(Descriptor::kReceiver); Node* const context = Parameter(Descriptor::kContext); ThrowIfNotInstanceType(context, receiver, JS_SET_TYPE, "Set.prototype.entries"); Return(AllocateJSCollectionIterator<JSSetIterator>( context, Context::SET_KEY_VALUE_ITERATOR_MAP_INDEX, receiver)); } TF_BUILTIN(SetPrototypeGetSize, CollectionsBuiltinsAssembler) { Node* const receiver = Parameter(Descriptor::kReceiver); Node* const context = Parameter(Descriptor::kContext); ThrowIfNotInstanceType(context, receiver, JS_SET_TYPE, "get Set.prototype.size"); Node* const table = LoadObjectField(receiver, JSSet::kTableOffset); Return(LoadObjectField(table, OrderedHashSet::kNumberOfElementsOffset)); } TF_BUILTIN(SetPrototypeForEach, CollectionsBuiltinsAssembler) { const char* const kMethodName = "Set.prototype.forEach"; Node* const argc = Parameter(BuiltinDescriptor::kArgumentsCount); Node* const context = Parameter(BuiltinDescriptor::kContext); CodeStubArguments args(this, ChangeInt32ToIntPtr(argc)); Node* const receiver = args.GetReceiver(); Node* const callback = args.GetOptionalArgumentValue(0); Node* const this_arg = args.GetOptionalArgumentValue(1); ThrowIfNotInstanceType(context, receiver, JS_SET_TYPE, kMethodName); // Ensure that {callback} is actually callable. Label callback_not_callable(this, Label::kDeferred); GotoIf(TaggedIsSmi(callback), &callback_not_callable); GotoIfNot(IsCallable(callback), &callback_not_callable); VARIABLE(var_index, MachineType::PointerRepresentation(), IntPtrConstant(0)); VARIABLE(var_table, MachineRepresentation::kTagged, LoadObjectField(receiver, JSSet::kTableOffset)); Label loop(this, {&var_index, &var_table}), done_loop(this); Goto(&loop); BIND(&loop); { // Transition {table} and {index} if there was any modification to // the {receiver} while we're iterating. Node* index = var_index.value(); Node* table = var_table.value(); std::tie(table, index) = Transition<OrderedHashSet>(table, index, [](Node*, Node*) {}); // Read the next entry from the {table}, skipping holes. Node* entry_key; Node* entry_start_position; std::tie(entry_key, entry_start_position, index) = NextSkipHoles<OrderedHashSet>(table, index, &done_loop); // Invoke the {callback} passing the {entry_key} (twice) and the {receiver}. CallJS(CodeFactory::Call(isolate()), context, callback, this_arg, entry_key, entry_key, receiver); // Continue with the next entry. var_index.Bind(index); var_table.Bind(table); Goto(&loop); } BIND(&done_loop); args.PopAndReturn(UndefinedConstant()); BIND(&callback_not_callable); { CallRuntime(Runtime::kThrowCalledNonCallable, context, callback); Unreachable(); } } TF_BUILTIN(SetPrototypeValues, CollectionsBuiltinsAssembler) { Node* const receiver = Parameter(Descriptor::kReceiver); Node* const context = Parameter(Descriptor::kContext); ThrowIfNotInstanceType(context, receiver, JS_SET_TYPE, "Set.prototype.values"); Return(AllocateJSCollectionIterator<JSSetIterator>( context, Context::SET_VALUE_ITERATOR_MAP_INDEX, receiver)); } TF_BUILTIN(SetIteratorPrototypeNext, CollectionsBuiltinsAssembler) { const char* const kMethodName = "Set Iterator.prototype.next"; Node* const receiver = Parameter(Descriptor::kReceiver); Node* const context = Parameter(Descriptor::kContext); // Ensure that the {receiver} is actually a JSSetIterator. Label if_receiver_valid(this), if_receiver_invalid(this, Label::kDeferred); GotoIf(TaggedIsSmi(receiver), &if_receiver_invalid); Node* const receiver_instance_type = LoadInstanceType(receiver); GotoIf(InstanceTypeEqual(receiver_instance_type, JS_SET_VALUE_ITERATOR_TYPE), &if_receiver_valid); Branch( InstanceTypeEqual(receiver_instance_type, JS_SET_KEY_VALUE_ITERATOR_TYPE), &if_receiver_valid, &if_receiver_invalid); BIND(&if_receiver_invalid); ThrowIncompatibleMethodReceiver(context, kMethodName, receiver); BIND(&if_receiver_valid); // Check if the {receiver} is exhausted. VARIABLE(var_done, MachineRepresentation::kTagged, TrueConstant()); VARIABLE(var_value, MachineRepresentation::kTagged, UndefinedConstant()); Label return_value(this, {&var_done, &var_value}), return_entry(this), return_end(this, Label::kDeferred); // Transition the {receiver} table if necessary. Node* table; Node* index; std::tie(table, index) = TransitionAndUpdate<JSSetIterator, OrderedHashSet>(receiver); // Read the next entry from the {table}, skipping holes. Node* entry_key; Node* entry_start_position; std::tie(entry_key, entry_start_position, index) = NextSkipHoles<OrderedHashSet>(table, index, &return_end); StoreObjectFieldNoWriteBarrier(receiver, JSSetIterator::kIndexOffset, SmiTag(index)); var_value.Bind(entry_key); var_done.Bind(FalseConstant()); // Check how to return the {key} (depending on {receiver} type). Branch(InstanceTypeEqual(receiver_instance_type, JS_SET_VALUE_ITERATOR_TYPE), &return_value, &return_entry); BIND(&return_entry); { Node* result = AllocateJSIteratorResultForEntry(context, var_value.value(), var_value.value()); Return(result); } BIND(&return_value); { Node* result = AllocateJSIteratorResult(context, var_value.value(), var_done.value()); Return(result); } BIND(&return_end); { StoreObjectFieldRoot(receiver, JSSetIterator::kTableOffset, Heap::kEmptyOrderedHashTableRootIndex); Goto(&return_value); } } template <typename CollectionType> void CollectionsBuiltinsAssembler::TryLookupOrderedHashTableIndex( Node* const table, Node* const key, Node* const context, Variable* result, Label* if_entry_found, Label* if_not_found) { Label if_key_smi(this), if_key_string(this), if_key_heap_number(this), if_key_bigint(this); GotoIf(TaggedIsSmi(key), &if_key_smi); Node* key_map = LoadMap(key); Node* key_instance_type = LoadMapInstanceType(key_map); GotoIf(IsStringInstanceType(key_instance_type), &if_key_string); GotoIf(IsHeapNumberMap(key_map), &if_key_heap_number); GotoIf(IsBigIntInstanceType(key_instance_type), &if_key_bigint); FindOrderedHashTableEntryForOtherKey<CollectionType>( context, table, key, result, if_entry_found, if_not_found); BIND(&if_key_smi); { FindOrderedHashTableEntryForSmiKey<CollectionType>( table, key, result, if_entry_found, if_not_found); } BIND(&if_key_string); { FindOrderedHashTableEntryForStringKey<CollectionType>( context, table, key, result, if_entry_found, if_not_found); } BIND(&if_key_heap_number); { FindOrderedHashTableEntryForHeapNumberKey<CollectionType>( context, table, key, result, if_entry_found, if_not_found); } BIND(&if_key_bigint); { FindOrderedHashTableEntryForBigIntKey<CollectionType>( context, table, key, result, if_entry_found, if_not_found); } } TF_BUILTIN(MapLookupHashIndex, CollectionsBuiltinsAssembler) { Node* const table = Parameter(Descriptor::kTable); Node* const key = Parameter(Descriptor::kKey); Node* const context = Parameter(Descriptor::kContext); VARIABLE(entry_start_position, MachineType::PointerRepresentation(), IntPtrConstant(0)); Label entry_found(this), not_found(this); TryLookupOrderedHashTableIndex<OrderedHashMap>( table, key, context, &entry_start_position, &entry_found, &not_found); BIND(&entry_found); Node* index = IntPtrAdd(entry_start_position.value(), IntPtrConstant(OrderedHashMap::kHashTableStartIndex + OrderedHashMap::kValueOffset)); Return(SmiTag(index)); BIND(&not_found); Return(SmiConstant(-1)); } TF_BUILTIN(WeakMapLookupHashIndex, CollectionsBuiltinsAssembler) { Node* const table = Parameter(Descriptor::kTable); Node* const key = Parameter(Descriptor::kKey); Label if_found(this), if_not_found(this); Node* const capacity = SmiUntag(LoadFixedArrayElement(table, WeakHashTable::kCapacityIndex)); Node* const mask = IntPtrSub(capacity, IntPtrConstant(1)); Node* const hash = GetHash(key); GotoIf(IntPtrLessThan(hash, IntPtrConstant(0)), &if_not_found); // See HashTable::FirstProbe(). Node* entry = WordAnd(hash, mask); VARIABLE(var_count, MachineType::PointerRepresentation(), IntPtrConstant(0)); VARIABLE(var_entry, MachineType::PointerRepresentation(), entry); Variable* loop_vars[] = {&var_count, &var_entry}; Label loop(this, arraysize(loop_vars), loop_vars); Goto(&loop); BIND(&loop); Node* index; { Node* entry = var_entry.value(); index = IntPtrMul(entry, IntPtrConstant(WeakHashTable::kEntrySize)); index = IntPtrAdd(index, IntPtrConstant(WeakHashTable::kElementsStartIndex)); Node* current = LoadFixedArrayElement(table, index); GotoIf(WordEqual(current, UndefinedConstant()), &if_not_found); GotoIf(WordEqual(current, key), &if_found); // See HashTable::NextProbe(). Increment(&var_count); entry = WordAnd(IntPtrAdd(entry, var_count.value()), mask); var_entry.Bind(entry); Goto(&loop); } BIND(&if_not_found); Return(SmiConstant(-1)); BIND(&if_found); Return(SmiTag(Signed(IntPtrAdd(index, IntPtrConstant(1))))); } TF_BUILTIN(WeakMapGet, CollectionsBuiltinsAssembler) { Node* const receiver = Parameter(Descriptor::kReceiver); Node* const key = Parameter(Descriptor::kKey); Node* const context = Parameter(Descriptor::kContext); Label return_undefined(this); ThrowIfNotInstanceType(context, receiver, JS_WEAK_MAP_TYPE, "WeakMap.prototype.get"); GotoIf(TaggedIsSmi(key), &return_undefined); GotoIfNot(IsJSReceiver(key), &return_undefined); Node* const table = LoadObjectField(receiver, JSWeakCollection::kTableOffset); Node* const index = CallBuiltin(Builtins::kWeakMapLookupHashIndex, context, table, key); GotoIf(WordEqual(index, SmiConstant(-1)), &return_undefined); Return(LoadFixedArrayElement(table, SmiUntag(index))); BIND(&return_undefined); Return(UndefinedConstant()); } TF_BUILTIN(WeakMapHas, CollectionsBuiltinsAssembler) { Node* const receiver = Parameter(Descriptor::kReceiver); Node* const key = Parameter(Descriptor::kKey); Node* const context = Parameter(Descriptor::kContext); Label return_false(this); ThrowIfNotInstanceType(context, receiver, JS_WEAK_MAP_TYPE, "WeakMap.prototype.get"); GotoIf(TaggedIsSmi(key), &return_false); GotoIfNot(IsJSReceiver(key), &return_false); Node* const table = LoadObjectField(receiver, JSWeakCollection::kTableOffset); Node* const index = CallBuiltin(Builtins::kWeakMapLookupHashIndex, context, table, key); GotoIf(WordEqual(index, SmiConstant(-1)), &return_false); Return(TrueConstant()); BIND(&return_false); Return(FalseConstant()); } TF_BUILTIN(WeakSetHas, CollectionsBuiltinsAssembler) { Node* const receiver = Parameter(Descriptor::kReceiver); Node* const key = Parameter(Descriptor::kKey); Node* const context = Parameter(Descriptor::kContext); Label return_false(this); ThrowIfNotInstanceType(context, receiver, JS_WEAK_SET_TYPE, "WeakSet.prototype.get"); GotoIf(TaggedIsSmi(key), &return_false); GotoIfNot(IsJSReceiver(key), &return_false); Node* const table = LoadObjectField(receiver, JSWeakCollection::kTableOffset); Node* const index = CallBuiltin(Builtins::kWeakMapLookupHashIndex, context, table, key); GotoIf(WordEqual(index, SmiConstant(-1)), &return_false); Return(TrueConstant()); BIND(&return_false); Return(FalseConstant()); } } // namespace internal } // namespace v8

[ "zhuanghengfei@gmail.com" ]

zhuanghengfei@gmail.com

1340b1353eb635b903b4f14353a07de75ee36a0d

62232f6b7a23f990ccb781ce157dc0be91eac80c

/Engine/Source/Mesh/Mesh Overlay.cpp

377d23c5ad95c6330503a651cd073d17e9d6dbc1

[ "LicenseRef-scancode-other-permissive", "LicenseRef-scancode-warranty-disclaimer" ]

permissive

randydom/EsenthelEngine

152adb45bac2e0f4a579f6479f209402c227708e

4164781a2d906b136f66da2a021d649533a15ba9

refs/heads/master

2020-07-21T02:44:51.579450

2019-09-03T08:24:02

null

0

null

UTF-8

C++

false

14,835

cpp

/******************************************************************************/ #include "stdafx.h" namespace EE{ /******************************************************************************/ #define CC4_MSOV CC4('M','S','O','V') /******************************************************************************/ static void SetBoxAndPlanes(Box &box, Memc<Plane> &planes, Matrix &matrix) { box.set(1)*=matrix; planes.del(); Vec n; // x n=matrix.x; n.normalize(); planes.New().set(matrix.pos+matrix.x, n); planes.New().set(matrix.pos-matrix.x, -n); // y n=matrix.y; n.normalize(); planes.New().set(matrix.pos+matrix.y, n); planes.New().set(matrix.pos-matrix.y, -n); // z n=matrix.z; n.normalize(); planes.New().set(matrix.pos+matrix.z, n); planes.New().set(matrix.pos-matrix.z, -n); } static void ClipMeshToPlanes(C Mesh &src, C Matrix *matrix, Mesh &dest, C Plane *clip_plane, Int clip_planes, C Box &box) { Mesh temp; // box test Vec corner[8]; src.ext.toCorners(corner); if(matrix)Transform(corner, *matrix, Elms(corner)); Bool all_inside=true; REPD(p, clip_planes) { Bool inside=false, outside=false; REPAD(c, corner) { if(Dist(corner[c], clip_plane[p])<=0)inside=true;else outside=true; } if(!inside)goto finished; // if no vertexes are inside the plane then cancel if(outside)all_inside=false; } // create dest /*if(all_inside) can't be used because it may happen that we're operating on MeshRender { temp.create(src, flag_and); if(matrix) { temp.transform(*matrix).setBox(); temp.lod_center=src.lod_center*(*matrix); } }else*/ { Bool poly_cur=0; Flt scale=(matrix ? matrix->maxScale() : 1); Memc< Vec> poly[2]; Memc< Memc<Vec> > polys; temp.copyParams(src); FREPD(l, src.lods()) // order is important { C MeshLod &src_lod=src.lod(l); REPA(src_lod) { // create 'polys' from MeshPart C MeshPart &part=src_lod.parts[i]; Bool semi_transparent=false; if(part.material())if(part.material()->hasAlpha() || part.material()->technique==MTECH_FUR)semi_transparent=true; if( !semi_transparent) // don't apply overlays on semi-transparent parts (because it will look like floating in air) { if(part.base.is()) // MSHB { C Vec *pos=part.base.vtx.pos(); REPA(part.base.tri) // TRI { VecI t=part.base.tri.ind(i); poly[poly_cur].New()=pos[t.x]; poly[poly_cur].New()=pos[t.y]; poly[poly_cur].New()=pos[t.z]; if(matrix)REPAO(poly[poly_cur])*=*matrix; Box b; b.from(poly[poly_cur].data(), poly[poly_cur].elms()); if(Cuts(b, box)) { REPD(p, clip_planes) { ClipPoly(poly[poly_cur], clip_plane[p], poly[poly_cur^1]); poly_cur^=1; if(poly[poly_cur].elms()<=2)goto mshb_tri_done; } Swap(poly[poly_cur], polys.New()); } mshb_tri_done:; poly[0].clear(); poly[1].clear(); } REPA(part.base.quad) // QUAD { VecI4 q=part.base.quad.ind(i); poly[poly_cur].New()=pos[q.x]; poly[poly_cur].New()=pos[q.y]; poly[poly_cur].New()=pos[q.z]; poly[poly_cur].New()=pos[q.w]; if(matrix)REPAO(poly[poly_cur])*=*matrix; Box b; b.from(poly[poly_cur].data(), poly[poly_cur].elms()); if(Cuts(b, box)) { REPD(p, clip_planes) { ClipPoly(poly[poly_cur], clip_plane[p], poly[poly_cur^1]); poly_cur^=1; if(poly[poly_cur].elms()<=2)goto mshb_quad_done; } Swap(poly[poly_cur], polys.New()); } mshb_quad_done:; poly[0].clear(); poly[1].clear(); } }else if(part.render.is()) // MSHR { Int vtx_pos=part.render.vtxOfs(VTX_POS); if( vtx_pos>=0) if(C Byte *vtx=part.render.vtxLockRead()) { vtx+=vtx_pos; if(CPtr ind=part.render.indLockRead()) { if(part.render._ib.bit16()) // 16 BIT { VecUS *tri=(VecUS*)ind; REP(part.render.tris()) { VecUS t=tri[i]; poly[poly_cur].New()=*(Vec*)(vtx+t.x*part.render.vtxSize()); poly[poly_cur].New()=*(Vec*)(vtx+t.y*part.render.vtxSize()); poly[poly_cur].New()=*(Vec*)(vtx+t.z*part.render.vtxSize()); if(matrix)REPAO(poly[poly_cur])*=*matrix; Box b; b.from(poly[poly_cur].data(), poly[poly_cur].elms()); if(Cuts(b, box)) { REPD(p, clip_planes) { ClipPoly(poly[poly_cur], clip_plane[p], poly[poly_cur^1]); poly_cur^=1; if(poly[poly_cur].elms()<=2)goto mshr_tri16_done; } Swap(poly[poly_cur], polys.New()); } mshr_tri16_done:; poly[0].clear(); poly[1].clear(); } } else // 32 BIT { VecI *tri=(VecI*)ind; REP(part.render.tris()) { VecI t=tri[i]; poly[poly_cur].New()=*(Vec*)(vtx+t.x*part.render.vtxSize()); poly[poly_cur].New()=*(Vec*)(vtx+t.y*part.render.vtxSize()); poly[poly_cur].New()=*(Vec*)(vtx+t.z*part.render.vtxSize()); if(matrix)REPAO(poly[poly_cur])*=*matrix; Box b; b.from(poly[poly_cur].data(), poly[poly_cur].elms()); if(Cuts(b, box)) { REPD(p, clip_planes) { ClipPoly(poly[poly_cur], clip_plane[p], poly[poly_cur^1]); poly_cur^=1; if(poly[poly_cur].elms()<=2)goto mshr_tri32_done; } Swap(poly[poly_cur], polys.New()); } mshr_tri32_done:; poly[0].clear(); poly[1].clear(); } } part.render.indUnlock(); } part.render.vtxUnlock(); } } } } // create MeshBase from 'polys' if(polys.elms()) { MeshBase mshb; Triangulate(polys, mshb, EPS, true); polys.clear(); if(mshb.vtxs() && mshb.faces()) { MeshLod &dest_lod=(temp.parts.elms() ? temp.newLod() : temp); dest_lod. copyParams(src_lod); dest_lod.scaleParams(scale ); Swap(mshb, dest_lod.parts.New().base); } } } temp.setBox(); temp.lod_center=src.lod_center; if(matrix)temp.lod_center*=*matrix; } finished:; Swap(dest, temp); } /******************************************************************************/ void MeshOverlay::zero() { _lod_center.zero(); _ext .zero(); _matrix .identity(); _shader=null; } MeshOverlay::MeshOverlay() {zero();} MeshOverlay& MeshOverlay::del() { _lods .del (); _material.clear(); zero(); return T; } /******************************************************************************/ Bool MeshOverlay::createStatic(C Mesh &mesh, C MaterialPtr &material, C Matrix &overlay_matrix, C Matrix *mesh_matrix) { del(); if(mesh.is()) { _matrix=overlay_matrix; Memc<Plane> planes; Box box ; SetBoxAndPlanes(box, planes, _matrix); Mesh temp ; ClipMeshToPlanes(mesh, mesh_matrix, temp, planes.data(), planes.elms(), box); if(temp.is()) { T._lod_center= temp.lod_center; T._ext = temp.ext; T._lods.setNum(temp.lods()); FREPD(l, temp.lods()) // order is important { MeshBase &mshb=temp.lod(l).parts[0].base; #if 0 mshb.setNormals(); REPA(mshb.vtx)mshb.vtx.pos[i]+=mshb.vtx.nrm[i]*0.005f; // surface epsilon #endif #if 0 mshb.include(VTX_TEX0); REPA(mshb.vtx)mshb.vtx.tex0[i]=_matrix.convert(mshb.vtx.pos[i]); // maybe it will require changing axis length when restored #endif _lods[l].dist2=temp.lod(l).dist2; _lods[l].mshr.create(mshb); } T.material(material); return true; } } return false; } Bool MeshOverlay::createAnimated(C Mesh &mesh, C MaterialPtr &material, C Matrix &overlay_matrix, C Matrix *mesh_matrix) { del(); if(mesh.is()) { if(!mesh_matrix)_matrix=overlay_matrix;else { mesh_matrix->inverse(_matrix); overlay_matrix.mul(_matrix, _matrix); } Memc<Plane> planes; Box box ; SetBoxAndPlanes(box, planes, _matrix); Mesh temp ; ClipMeshToPlanes(mesh, null, temp, planes.data(), planes.elms(), box); if(temp.is()) { T._lod_center= temp.lod_center; T._ext = temp.ext; T._lods.setNum(temp.lods()); FREPD(l, temp.lods()) // order is important { MeshBase &mshb=temp.lod(l).parts[0].base; #if 0 mshb.setNormals(); REPA(mshb.vtx)mshb.vtx.pos[i]+=mshb.vtx.nrm[i]*0.005f; // surface epsilon #endif #if 0 mshb.include(VTX_TEX0); REPA(mshb.vtx)mshb.vtx.tex0[i]=_matrix.convert(mshb.vtx.pos[i]); // maybe it will require changing axis length when restored #endif _lods[l].dist2=temp.lod(l).dist2; _lods[l].mshr.create(mshb); } T.material(material); return true; } } return false; } /******************************************************************************/ void MeshOverlay::setShader() { _shader=null; if(_lods.elms() && _material && _material->base_0)_shader=ShaderFiles("Overlay")->get(ShaderOverlay(false, _material->base_1!=null)); } MeshOverlay& MeshOverlay::material(C MaterialPtr &material) { T._material=material; setShader(); return T; } #pragma pack(push, 4) struct GOverlayClass { Vec4 param; Matrix mtrx ; }; #pragma pack(pop) void MeshOverlay::setParams(Flt alpha)C // this is called only inside 'draw' methods, so '_material' is assumed to be != null { GOverlayClass overlay_params; overlay_params.param.set(0.8f, alpha, 0, 0); overlay_params.mtrx=_matrix; Sh.OverlayParams->set(overlay_params); _material ->setBlend(); D.depth(true); D.cull (true); //D.alpha(ALPHA_BLEND_FACTOR); not needed because ALPHA_BLEND_FACTOR is used everywhere in RM_OVERLAY /*D.depthWrite(false); not needed because false is used everywhere in RM_OVERLAY*/ Renderer.needDepthTest(); // !! 'needDepthTest' after 'depthWrite' !! } /******************************************************************************/ C MeshRender& MeshOverlay::getDrawLod(C Matrix &matrix)C { if(_lods.elms()>1) { Flt dist2=GetLodDist2(_lod_center, matrix); REPA(_lods){C Lod &test=_lods[i]; if(dist2>=test.dist2)return test.mshr;} } return _lods[0].mshr; } C MeshRender& MeshOverlay::getDrawLod(C MatrixM &matrix)C { if(_lods.elms()>1) { Flt dist2=GetLodDist2(_lod_center, matrix); REPA(_lods){C Lod &test=_lods[i]; if(dist2>=test.dist2)return test.mshr;} } return _lods[0].mshr; } /******************************************************************************/ void MeshOverlay::draw(Flt alpha)C { if(_shader) { setParams(alpha); _shader->begin(); C MeshRender &mshr=getDrawLod(ObjMatrix); mshr.set().draw(); } } void MeshOverlay::draw(C MatrixM &matrix, Flt alpha)C { if(_shader) { SetOneMatrix(matrix); setParams(alpha); _shader->begin(); C MeshRender &mshr=getDrawLod(matrix); mshr.set().draw(); } } void MeshOverlay::draw(C AnimatedSkeleton &anim_skel, Flt alpha)C { if(_shader) { anim_skel.setMatrix(); setParams(alpha); _shader->begin(); C MeshRender &mshr=getDrawLod(anim_skel.matrix()); mshr.set(); mshr.draw(); } } /******************************************************************************/ Bool MeshOverlay::save(File &f, CChar *path)C { f.putMulti(Byte(0), Int(_lods.elms())); // version if(_lods.elms()) { f.putMulti(_lod_center, _ext, _matrix); f.putAsset(_material.id()); FREPA(_lods) { f<<_lods[i].dist2; if(!_lods[i].mshr.saveData(f))return false; } } return f.ok(); } Bool MeshOverlay::load(File &f, CChar *path) { del(); switch(f.decUIntV()) // version { case 0: { _lods.setNum(f.getInt()); if(_lods.elms()) { f.getMulti(_lod_center, _ext, _matrix); _material.require(f.getAssetID(), path); FREPA(_lods) { f>>_lods[i].dist2; if(!_lods[i].mshr.loadData(f))goto error; } setShader(); } if(f.ok())return true; }break; } error: del(); return false; } /******************************************************************************/ } /******************************************************************************/

[ "esenthel@hotmail.com" ]

esenthel@hotmail.com

02554a3ef3162531d98ec7e3fa683c8a17eaa75a

89870ca1f16af0f2ba65ec0175cd089da852afbc

/codeforces/round-737-div-2/c.cpp

90e3c2dd6745a05279a7185f3eb4059d68db05de

[]

no_license

Merisho/comprog

3b8ce833f0f16dbcfa252f9c6678c160bf081a11

fb4829ba93fcb376078a5baccda0c07ce35d6d04

refs/heads/master

2023-08-18T00:10:45.535195

2023-08-11T07:16:02

216,174,595

0

null

UTF-8

C++

false

1,560

cpp

#include <bits/stdc++.h> using namespace std; using ll = long long; constexpr ll MOD = 1e9 + 7; ll binexp(ll n, ll e, ll p) { if (e == 0) { return 1; } if (e % 2 == 0) { ll a = binexp(n, e / 2, p); return (a * a) % p; } return (binexp(n, e - 1, p) * n) % p; } ll modinv(ll n, ll p) { return binexp(n, p - 2, p); } vector<ll> mem_fact(300000, -1); ll fact(ll n, ll p) { mem_fact[0] = 1; mem_fact[1] = 1; if (mem_fact[n] > -1) { return mem_fact[n]; } for (ll i = 2; i <= n; ++i) { mem_fact[i] = (mem_fact[i - 1] * i) % p; } return mem_fact[n]; } ll choose(ll n, ll k, ll p) { ll nf = fact(n, p); ll kf = fact(k, p); ll df = fact(n - k, p); return (((nf * modinv(kf, p)) % p) * modinv(df, p)) % p; } int main() { ll T; cin >> T; for (ll test_case = 1; test_case <= T; ++test_case) { ll n, k; cin >> n >> k; ll odd = 0; ll even = 0; for (ll i = 0; i < n; ++i) { if (i % 2 == 0) { even = (even + choose(n, i, MOD)) % MOD; } else { odd = (odd + choose(n, i, MOD)) % MOD; } } ll dp[k + 1][2]; dp[0][0] = 1; dp[0][1] = 0; for (ll i = 0; i < k; ++i) { dp[i + 1][0] = (dp[i][0] * even) % MOD; dp[i + 1][1] = (dp[i][1] * even) % MOD; dp[i + 1][1] = (dp[i + 1][1] + ((dp[i][1] * odd) % MOD)) % MOD; dp[i + 1][1] = (dp[i + 1][1] + dp[i][1]) % MOD; if (n % 2 == 0) { dp[i + 1][1] = (dp[i + 1][1] + dp[i][0]) % MOD; } else { dp[i + 1][0] = (dp[i + 1][0] + dp[i][0]) % MOD; } } ll res = (dp[k][0] + dp[k][1]) % MOD; cout << res << endl; } return 0; }

[ "merishot@gmail.com" ]

merishot@gmail.com

9fc4222e178dc2ac51fd665ee8fca3e6e40e08f5

3d5f96474b2596fe743a87323285c79aae047185

/GLES3/GLES/HelloScene.cpp

890dcc2cda32c21c6cd60660ddd75013e9665bcf

[]

no_license

1414648814/GLES3

932dda44c6e79767cc1a3a54798e8be79ef3750c

8a4fd6e61fcfef37f53783136255f2c1623712f8

refs/heads/sceneisnode

2021-01-22T04:14:46.233071

2017-02-12T07:22:59

81,521,232

0

null

2017-02-12T07:22:59

2017-02-10T03:14:17

C++

UTF-8

C++

false

802

cpp

// // HelloScene.cpp // GLES // // Created by staff on 2016/12/27. // Copyright © 2016年 George1994. All rights reserved. // #include "HelloScene.h" #include "CCGame.h" HelloScene::HelloScene() : Scene() { } HelloScene::~HelloScene() { } Scene* HelloScene::scene() { HelloScene* scene = new HelloScene(); if (scene && scene->init()) { return scene; } return nullptr; } // insert code into here bool HelloScene::init() { if (!Scene::init()) { return false; } auto visibleSize = Game::getInstance()->getVisibleSize(); auto sp = Sprite::create("/Users/staff/Desktop/GLES3/GLES3/wall.jpg", 1); sp->setAnchorPoint(Vector2(0.0, 0.0)); sp->setPosition(Vector2(150, 50)); this->addChild(sp, 1); return true; }

[ "1414648814@qq.com" ]

1414648814@qq.com

18a5aeda1b3358b41fc847a8057a50df9cc49512

8784d329b85af404060555631e47887258f4cc4b

/libHttp/lib_socket.h

05950423733db3828033cb03bfd727e72283b8c1

[]

no_license

mojo55aa/libHttp

d0a5285f64ca6b1351e447b1aed98b62137a11ca

0ecd0f80978f8dd502060d1e5a5df8bdf572c53d

refs/heads/master

2020-04-21T07:01:57.413947

2019-02-08T02:55:07

169,382,006

1

0

null

UTF-8

C++

false

613

h

//#pragma once #include <string> #define _WINSOCK_DEPRECATED_NO_WARNINGS #define DNS_ERROR "dns_err" #ifdef __LINUX__ #include <sys/socket.h> #define INVALID_SOCKET -1 typedef int SOCKET; #else #include <WinSock2.h> #pragma comment(lib, "ws2_32.lib") #endif // __LINUX__ class LIBSocket { public: LIBSocket(); virtual ~LIBSocket(); bool Connect(const char* ip, unsigned int port); __int64 Send(const char* buff, unsigned int nbytes); __int64 Recv(char* buff, unsigned int nbytes); protected: private: SOCKET mSocket; }; std::string GetSockErrMsg(); std::string GetIpByDomain(const char* domain);

[ "format0103@163.com" ]

format0103@163.com

175bbb66a0cda3a1f10859f6af0b90874134652f

cd9c4670683df414f814928ec69778c13095f862

/SpotVMFrame/SpotVMFrame/mutation.cpp

801c32f0e0995fd1a6a0c34f4cfa20178faca145

[]

no_license

amelieczhou/hybrid-dynamic-workflow-scheduling

a1d82d0ec110cf099c0eab37984622fb2c5dbf2b

c13d8d1aaaee95a9262a530d91746309b081c25c

refs/heads/master

2020-12-25T18:20:30.888574

2015-01-13T03:37:29

32,119,838

1

0

null

UTF-8

C++

false

4,278

cpp

#include "stdafx.h" #include "mutation.h" extern std::vector<individual* > generation; //initial size = populationsize extern std::vector<individual* > variation; //initially empty extern std::vector<individual* > matingpool; int mu = 10; int solutionsize = 10;//20;//for epi float variable_swap_probability = 0.9;//crossover float variable_mutation_probability = 0.5; //mutation int update_from_arc(std::vector<individual*>& population) // Removes the individuals, that are not in the archive { int size, result; //int *keep; int i, current; size = population.size(); std::vector<int > keep(size); result = 0; // keep = (int *) malloc(sizeof(int)*size); /*if (keep == NULL) { std::cout<<"SPEA variator: out of memory"<<std::endl; exit(1); }*/ for(i=0; i < size; i++) keep[i] = population[i]->index; // sort the array of indexes to keep, // so we can go through the array and delete all indexes, // that are in between //qsort(keep, (size_t) size, sizeof(int), cmp_int); // delete all indexes in global_population not found in keep array for(int i=0; i<generation.size(); i++){ if(std::find(keep.begin(),keep.end(),generation[i]->index) == keep.end()){//no need to keep this one generation.erase(generation.begin()+i); i--; } } /* int count = 0; current = generation[count]->index; for(i = 0; i < size; i++) { while(current < keep[i]) { generation[count] = NULL; generation.erase(generation.begin()+count); //count--; current = generation[count]->index; } if (current == keep[i]) { count++; if(count<generation.size()) current = generation[count]->index; } // this one we keep else // current must be bigger than keep[i], // something went wrong... { std::cout<<"identity in archive is not in the global population!"<<std::endl; exit(1); } }*/ // delete the last individuals at end of list while(generation.size() > population.size()) generation.erase(generation.end()-1); //free(keep); return (0); } int variate(std::vector<individual*>& selected) // Performs the real variation of individuals // *selected points to the selected individuals // *result_ids will contain the offspring individuals { int result, i, k; result = 1; // copying all individuals from selected to global population //for(int j=0; j<selected.size(); j++) // generation.push_back(selected[j]); // if odd number of individuals, last one is left as is if((((double)mu/2) - (int)(mu/2)) != 0) k = mu - 1; else k = mu; // do recombination for(i = 0; i < k; i+= 2) { if (rn_01() <= variable_swap_probability) { single_point_crossover(selected[i],selected[i+1]); } } // do mutation for(i = 0; i < mu; i++) { if (rn_01() <= variable_mutation_probability) { mutation(selected[i]); } } return (0); } void single_point_crossover(individual *ind1, individual *ind2) { //select two points in the vector and swap int start, end, tmp; start = rn_integers(0,solutionsize); while(start == solutionsize) start = rn_integers(0,solutionsize); end = rn_integers(0,solutionsize); while(end == solutionsize) end = rn_integers(0,solutionsize); if(start > end){ tmp = start; start = end; end = tmp; } for(int i=start; i<=end; i++){ tmp = ind1->solution[i]; ind1->solution[i] = ind2->solution[i]; ind2->solution[i] = tmp; } return; } void mutation(individual* ind){ if (ind == NULL) { exit(1); } for (int i = 0; i < solutionsize; i++) { //replacing mutation if(rn_01() <= variable_mutation_probability){ int mut = rn_integers(0,types); while(mut == types) mut = rn_integers(0,types); ind->solution[i] = mut; } //reordering mutation } return ; }

[ "andyzhang870914@gmail.com@0f0f248c-0e70-7bf0-40e6-9a9aec565ee8" ]

andyzhang870914@gmail.com@0f0f248c-0e70-7bf0-40e6-9a9aec565ee8

dafca8af74d70cd289ebd105cd4010a1bed9d6fb

bac010ab15283d0ec3f7bbe33f5ce2a0c28a822c

/SCANF6.CPP

836dbf321b511725c7653c6050680b61f2be43d2

[ "MIT" ]

permissive

sonu2016-stack/CPP_Programming_Language_Practice_Code

8d12073e2544c891d9cbd322b784f92c7c16fbc6

50b143124690249e5dbd4eaaddfb8a3dadf48f1f

refs/heads/master

2023-04-28T22:17:18.459328

2021-05-16T21:27:21

null

0

null

UTF-8

C++

false

345

cpp

//Program to Swap or Interchange the Value Using Third Variable #include<stdio.h> #include<conio.h> main() { int a,b,c; clrscr(); printf("Enter the Value of a= "); scanf("%d",&a); printf("Enter the Value of b= "); scanf("%d",&b); c=a; a=b; b=c; printf("\nAfter Swapping Value of a= %d",a); printf("\nAfter Swapping Value of b= %d",b); getch(); }

[ "Kumarashish79924@gmail.com" ]

Kumarashish79924@gmail.com

4ef662429e50863f690dd73786eb250f3ae20629

ed2aa12a14dd8594b303bb508923bdda3a62eeb9

/PhotonChat/LoadBalancing-cpp/inc/Enums/MatchmakingMode.h

a16798abd987717bfcb9546a076821d8b9a0586d

[ "MIT" ]

permissive

anhtrangg/PhotonChat

c7e83dae1107746abc83f43e541ae4b85ed54dd0

4bd5788fe4ec89dab83ae01d7f372b6e9bd5ebc9

refs/heads/master

2023-04-12T09:53:53.273785

2021-05-17T08:27:32

364,878,364

0

null

UTF-8

C++

false

1,009

h

/* Exit Games Photon LoadBalancing - C++ Client Lib * Copyright (C) 2004-2020 by Exit Games GmbH. All rights reserved. * http://www.photonengine.com * mailto:developer@photonengine.com */ #pragma once #include "Common-cpp/inc/Common.h" namespace ExitGames { namespace LoadBalancing { /** Options for matchmaking rules for OpJoinRandomRoom.*/ namespace MatchmakingMode { static const nByte FILL_ROOM = 0; ///<Fills up rooms (oldest first) to get players together as fast as possible. Default. Makes most sense with MaxPlayers > 0 and games that can only start with more players. static const nByte SERIAL_MATCHING = 1; ///<Distributes players across available rooms sequentially but takes filters into account. Without filters, rooms get players evenly distributed. static const nByte RANDOM_MATCHING = 2; ///<Joins a (fully) random room. Expected properties must match, but aside from this, any available room might be selected. } /** @file */ } }

[ "anh.tran@gogame.net" ]

anh.tran@gogame.net

38cb27f00fe1c71e9743989fe7b1091dc0e2f9dd

e9fd7bc03ba68c04ee5dccb683158a59b4b9ad21

/A1120.cpp

79cc3314d5b4492a5efcfde9c2f4fd8335309dd6

[]

no_license

LittleVolcano/MY-PAT

77cc0890611106be797eb0e85d73efd9108c73b4

0489bb5ff1913ac4b8458368f391b47e36ea70e1

refs/heads/master

2021-05-09T03:53:41.683631

2018-04-08T03:06:52

119,255,216

0

null

UTF-8

C++

false

498

cpp

#include<stdio.h> int main() { int a[50] = {0}; int n; int temp; int friid; int sum = 0; int flag = 0; scanf("%d",&n); for(int i = 0;i < n; ++i) { friid = 0; scanf("%d",&temp); while(temp != 0) { friid += temp % 10; temp /= 10; } a[friid]++; } for(int i = 0;i < 50; ++i) { if(a[i] != 0 ) ++sum; } printf("%d\n",sum); for(int i = 0;i < 50; ++i) { if(a[i] != 0 ) { if(flag == 1) printf(" "); printf("%d",i); flag = 1; } } return 0; }

[ "495328602@qq.com" ]

495328602@qq.com

6127da0c80ed45d083b9e43a73a58508665871c7

ced632b0a81654ec9ea3f270e2e51d36170dd050

/src/localization/src/frombfl/mobile_robot.h

da3e93d8fb332fb51c3fadaec4dad849421f169f

[]

no_license

lian16thu/RoboCup

4a0b84f54a6253a1284e3922c54210bb8239087b

95dbd5753be3f0391176420ec2cb012d8fda59fe

refs/heads/master

2020-04-30T15:21:31.379146

2019-03-21T10:04:40

176,918,206

0

null

UTF-8

C++

false

1,766

h

// $Id: mobile_robot.h tdelaet $ // Copyright (C) 2006 Tinne De Laet <first dot last at mech dot kuleuven dot be> // // This program is free software; you can redistribute it and/or modify // it under the terms of the GNU Lesser General Public License as published by // the Free Software Foundation; either version 2.1 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 Lesser General Public License for more details. // // You should have received a copy of the GNU Lesser 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. // #ifndef MOBILE_ROBOT_HPP #define MOBILE_ROBOT_HPP #include <bfl/model/analyticsystemmodel_gaussianuncertainty.h> #include <bfl/model/linearanalyticmeasurementmodel_gaussianuncertainty.h> #include <bfl/pdf/gaussian.h> #include "matrix_wrapper.h" #include "vector_wrapper.h" #include <bfl/wrappers/matrix/matrix_NEWMAT.h> #include <bfl/wrappers/matrix/matrix_LTI.h> #include <bfl/wrappers/matrix/matrix_BOOST.h> namespace BFL{ class MobileRobot { public: // Constructor MobileRobot(); ~MobileRobot(); void Move(MatrixWrapper::ColumnVector inputs); MatrixWrapper::ColumnVector Measure(); MatrixWrapper::ColumnVector GetState(); //method only for simulation purposes private: Gaussian* _sys_noise; Gaussian* _meas_noise; MatrixWrapper::Matrix _meas_model; MatrixWrapper::ColumnVector _state; }; } #endif

[ "lian16thu" ]

lian16thu

e7b0716dd88c67d53c548157167a627d939366d7

0c1f5efe63ded94e7c5d3f3eec7ffa17e7e2ccd8

/Smart_House.ino

1dac4aae9dd7fca0dd1286dc40b29e5400ddfff5

[]

no_license

nancy9taya/Smart_House

404fb66c484b0715e13ffd5cc8e6d98e11d4af0c

94310aa6d4e12f3327955ed23c4240f9f2a24243

refs/heads/master

2022-05-12T14:46:24.891455

2020-04-28T02:53:42

259,439,090

0

null

UTF-8

C++

false

1,855

ino

#include<Keypad.h> #include<LiquidCrystal.h> LiquidCrystal lcd(A1,A2,3,2,1,A3); const byte ROWS = 4; const byte COLS = 4; char KeyMap[ROWS][COLS] = { {'7', '8', '9', '*'}, {'4', '5', '6', '/'}, {'1', '2', '3', '-'}, {'#', '0', '=', '+'} }; byte rowPins[ROWS] = {11, 10, 9, 8}; byte colPins[COLS] = {7,6, 5, 4}; Keypad customKeypad = Keypad(makeKeymap(KeyMap), rowPins, colPins, ROWS, COLS); int controller = 13; int House = 12; int Fan = 0; volatile int buttonState; int input; char password[4]={'9','2','4','8'}; boolean flag = 1; float temp_old, temp_new; int x=0; int password_enterd =0; void setup() { lcd.begin(16,2); pinMode(controller, INPUT); pinMode(House, OUTPUT); pinMode(Fan, OUTPUT); lcd.print(" password"); attachInterrupt(1, pin_input, CHANGE); } void loop() { flag=1; //wait for owner to enter the password to enter house if( password_enterd == 0){ for(int i = 0 ;i <sizeof(password) ;i++){ char key = customKeypad.waitForKey(); //lcd.clear(); lcd.setCursor(i,1); lcd.print("#"); // lcd.scroll() if(key != password[i]){ flag = 0; } } } if(flag){ x=1; password_enterd =1; } temp_old = analogRead(A0); temp_new = temp_old * 0.489; // input = digitalRead(controller); if(flag ){ //digitalWrite(House, HIGH); if(temp_new >= 25){ digitalWrite(Fan, HIGH); } else{ digitalWrite(Fan, LOW); } lcd.clear(); lcd.setCursor(1,0); lcd.print("temp is"); lcd.setCursor(0,1); lcd.print(temp_new); delay(1000); } else if(flag == 0){ lcd.clear(); lcd.setCursor(1,0); lcd.print("wrong"); } } void pin_input() { buttonState = digitalRead(controller); if(x ==1){ if(buttonState == 0 ){ digitalWrite(House, LOW); } else{ digitalWrite(House, HIGH); } } }

[ "nancy.hassan1998@gmail.com" ]

nancy.hassan1998@gmail.com

b45a7be7429bc43e6fc6986cc06cc55538211716

ba305b9bb38e6d9539f01400c180af4f93b3f567

/quic_stream_factory.cc

279b5eb993b1f09e1b0264ccacf778855f69d21e

[]

no_license

velicue/quic_codes

2759ffff82f8741f99ef77bbef35fc4432d2925c

a0393aeccccb45ac40e8ece076f8fd026fe6b3d7

refs/heads/master

2021-01-01T18:38:33.596665

2014-07-19T00:50:19

2014-07-19T00:50:28

null

0

null

UTF-8

C++

false

32,393

cc

// Copyright (c) 2012 The Chromium Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file. #include "net/quic/quic_stream_factory.h" #include <set> #include "base/cpu.h" #include "base/message_loop/message_loop.h" #include "base/message_loop/message_loop_proxy.h" #include "base/metrics/histogram.h" #include "base/rand_util.h" #include "base/stl_util.h" #include "base/strings/string_util.h" #include "base/values.h" #include "net/base/net_errors.h" #include "net/cert/cert_verifier.h" #include "net/dns/host_resolver.h" #include "net/dns/single_request_host_resolver.h" #include "net/http/http_server_properties.h" #include "net/quic/congestion_control/tcp_receiver.h" #include "net/quic/crypto/proof_verifier_chromium.h" #include "net/quic/crypto/quic_random.h" #include "net/quic/crypto/quic_server_info.h" #include "net/quic/port_suggester.h" #include "net/quic/quic_client_session.h" #include "net/quic/quic_clock.h" #include "net/quic/quic_connection.h" #include "net/quic/quic_connection_helper.h" #include "net/quic/quic_crypto_client_stream_factory.h" #include "net/quic/quic_default_packet_writer.h" #include "net/quic/quic_http_stream.h" #include "net/quic/quic_protocol.h" #include "net/quic/quic_server_id.h" #include "net/socket/client_socket_factory.h" #if defined(OS_WIN) #include "base/win/windows_version.h" #endif using std::string; using std::vector; namespace net { namespace { enum CreateSessionFailure { CREATION_ERROR_CONNECTING_SOCKET, CREATION_ERROR_SETTING_RECEIVE_BUFFER, CREATION_ERROR_SETTING_SEND_BUFFER, CREATION_ERROR_MAX }; // When a connection is idle for 30 seconds it will be closed. const int kIdleConnectionTimeoutSeconds = 30; // The initial receive window size for both streams and sessions. const int32 kInitialReceiveWindowSize = 10 * 1024 * 1024; // 10MB // The suggested initial congestion windows for a server to use. // TODO: This should be tested and optimized, and even better, suggest a window // that corresponds to historical bandwidth and min-RTT. // Larger initial congestion windows can, if we don't overshoot, reduce latency // by avoiding the RTT needed for slow start to double (and re-double) from a // default of 10. // We match SPDY's use of 32 when secure (since we'd compete with SPDY). const int32 kServerSecureInitialCongestionWindow = 32; // Be conservative, and just use double a typical TCP ICWND for HTTP. const int32 kServerInecureInitialCongestionWindow = 20; void HistogramCreateSessionFailure(enum CreateSessionFailure error) { UMA_HISTOGRAM_ENUMERATION("Net.QuicSession.CreationError", error, CREATION_ERROR_MAX); } bool IsEcdsaSupported() { #if defined(OS_WIN) if (base::win::GetVersion() < base::win::VERSION_VISTA) return false; #endif return true; } QuicConfig InitializeQuicConfig(bool enable_pacing, bool enable_time_based_loss_detection, QuicTagVector connection_options) { QuicConfig config; config.SetDefaults(); config.EnablePacing(enable_pacing); if (enable_time_based_loss_detection) config.SetLossDetectionToSend(kTIME); config.set_idle_connection_state_lifetime( QuicTime::Delta::FromSeconds(kIdleConnectionTimeoutSeconds), QuicTime::Delta::FromSeconds(kIdleConnectionTimeoutSeconds)); config.SetConnectionOptionsToSend(connection_options); return config; } } // namespace QuicStreamFactory::IpAliasKey::IpAliasKey() {} QuicStreamFactory::IpAliasKey::IpAliasKey(IPEndPoint ip_endpoint, bool is_https) : ip_endpoint(ip_endpoint), is_https(is_https) {} QuicStreamFactory::IpAliasKey::~IpAliasKey() {} bool QuicStreamFactory::IpAliasKey::operator<( const QuicStreamFactory::IpAliasKey& other) const { if (!(ip_endpoint == other.ip_endpoint)) { return ip_endpoint < other.ip_endpoint; } return is_https < other.is_https; } bool QuicStreamFactory::IpAliasKey::operator==( const QuicStreamFactory::IpAliasKey& other) const { return is_https == other.is_https && ip_endpoint == other.ip_endpoint; }; // Responsible for creating a new QUIC session to the specified server, and // for notifying any associated requests when complete. class QuicStreamFactory::Job { public: Job(QuicStreamFactory* factory, HostResolver* host_resolver, const HostPortPair& host_port_pair, bool is_https, bool was_alternate_protocol_recently_broken, PrivacyMode privacy_mode, base::StringPiece method, QuicServerInfo* server_info, const BoundNetLog& net_log); // Creates a new job to handle the resumption of for connecting an // existing session. Job(QuicStreamFactory* factory, HostResolver* host_resolver, QuicClientSession* session, QuicServerId server_id); ~Job(); int Run(const CompletionCallback& callback); int DoLoop(int rv); int DoResolveHost(); int DoResolveHostComplete(int rv); int DoLoadServerInfo(); int DoLoadServerInfoComplete(int rv); int DoConnect(); int DoResumeConnect(); int DoConnectComplete(int rv); void OnIOComplete(int rv); CompletionCallback callback() { return callback_; } const QuicServerId server_id() const { return server_id_; } private: enum IoState { STATE_NONE, STATE_RESOLVE_HOST, STATE_RESOLVE_HOST_COMPLETE, STATE_LOAD_SERVER_INFO, STATE_LOAD_SERVER_INFO_COMPLETE, STATE_CONNECT, STATE_RESUME_CONNECT, STATE_CONNECT_COMPLETE, }; IoState io_state_; QuicStreamFactory* factory_; SingleRequestHostResolver host_resolver_; QuicServerId server_id_; bool is_post_; bool was_alternate_protocol_recently_broken_; scoped_ptr<QuicServerInfo> server_info_; const BoundNetLog net_log_; QuicClientSession* session_; CompletionCallback callback_; AddressList address_list_; base::TimeTicks disk_cache_load_start_time_; base::WeakPtrFactory<Job> weak_factory_; DISALLOW_COPY_AND_ASSIGN(Job); }; QuicStreamFactory::Job::Job(QuicStreamFactory* factory, HostResolver* host_resolver, const HostPortPair& host_port_pair, bool is_https, bool was_alternate_protocol_recently_broken, PrivacyMode privacy_mode, base::StringPiece method, QuicServerInfo* server_info, const BoundNetLog& net_log) : io_state_(STATE_RESOLVE_HOST), factory_(factory), host_resolver_(host_resolver), server_id_(host_port_pair, is_https, privacy_mode), is_post_(method == "POST"), was_alternate_protocol_recently_broken_( was_alternate_protocol_recently_broken), server_info_(server_info), net_log_(net_log), session_(NULL), weak_factory_(this) {} QuicStreamFactory::Job::Job(QuicStreamFactory* factory, HostResolver* host_resolver, QuicClientSession* session, QuicServerId server_id) : io_state_(STATE_RESUME_CONNECT), factory_(factory), host_resolver_(host_resolver), // unused server_id_(server_id), is_post_(false), // unused was_alternate_protocol_recently_broken_(false), // unused net_log_(session->net_log()), // unused session_(session), weak_factory_(this) {} QuicStreamFactory::Job::~Job() { } int QuicStreamFactory::Job::Run(const CompletionCallback& callback) { int rv = DoLoop(OK); if (rv == ERR_IO_PENDING) callback_ = callback; return rv > 0 ? OK : rv; } int QuicStreamFactory::Job::DoLoop(int rv) { do { IoState state = io_state_; io_state_ = STATE_NONE; switch (state) { case STATE_RESOLVE_HOST: CHECK_EQ(OK, rv); rv = DoResolveHost(); break; case STATE_RESOLVE_HOST_COMPLETE: rv = DoResolveHostComplete(rv); break; case STATE_LOAD_SERVER_INFO: CHECK_EQ(OK, rv); rv = DoLoadServerInfo(); break; case STATE_LOAD_SERVER_INFO_COMPLETE: rv = DoLoadServerInfoComplete(rv); break; case STATE_CONNECT: CHECK_EQ(OK, rv); rv = DoConnect(); break; case STATE_RESUME_CONNECT: CHECK_EQ(OK, rv); rv = DoResumeConnect(); break; case STATE_CONNECT_COMPLETE: rv = DoConnectComplete(rv); break; default: NOTREACHED() << "io_state_: " << io_state_; break; } } while (io_state_ != STATE_NONE && rv != ERR_IO_PENDING); return rv; } void QuicStreamFactory::Job::OnIOComplete(int rv) { rv = DoLoop(rv); if (rv != ERR_IO_PENDING && !callback_.is_null()) { callback_.Run(rv); } } int QuicStreamFactory::Job::DoResolveHost() { // Start loading the data now, and wait for it after we resolve the host. if (server_info_) { disk_cache_load_start_time_ = base::TimeTicks::Now(); server_info_->Start(); } io_state_ = STATE_RESOLVE_HOST_COMPLETE; return host_resolver_.Resolve( HostResolver::RequestInfo(server_id_.host_port_pair()), DEFAULT_PRIORITY, &address_list_, base::Bind(&QuicStreamFactory::Job::OnIOComplete, weak_factory_.GetWeakPtr()), net_log_); } int QuicStreamFactory::Job::DoResolveHostComplete(int rv) { if (rv != OK) return rv; DCHECK(!factory_->HasActiveSession(server_id_)); // Inform the factory of this resolution, which will set up // a session alias, if possible. if (factory_->OnResolution(server_id_, address_list_)) { return OK; } io_state_ = STATE_LOAD_SERVER_INFO; return OK; } int QuicStreamFactory::Job::DoLoadServerInfo() { io_state_ = STATE_LOAD_SERVER_INFO_COMPLETE; if (!server_info_) return OK; return server_info_->WaitForDataReady( base::Bind(&QuicStreamFactory::Job::OnIOComplete, weak_factory_.GetWeakPtr())); } int QuicStreamFactory::Job::DoLoadServerInfoComplete(int rv) { if (server_info_) { UMA_HISTOGRAM_TIMES("Net.QuicServerInfo.DiskCacheReadTime", base::TimeTicks::Now() - disk_cache_load_start_time_); } if (rv != OK) { server_info_.reset(); } io_state_ = STATE_CONNECT; return OK; } int QuicStreamFactory::Job::DoConnect() { io_state_ = STATE_CONNECT_COMPLETE; int rv = factory_->CreateSession(server_id_, server_info_.Pass(), address_list_, net_log_, &session_); if (rv != OK) { DCHECK(rv != ERR_IO_PENDING); DCHECK(!session_); return rv; } session_->StartReading(); if (!session_->connection()->connected()) { return ERR_QUIC_PROTOCOL_ERROR; } bool require_confirmation = factory_->require_confirmation() || is_post_ || was_alternate_protocol_recently_broken_; rv = session_->CryptoConnect( require_confirmation, base::Bind(&QuicStreamFactory::Job::OnIOComplete, base::Unretained(this))); return rv; } int QuicStreamFactory::Job::DoResumeConnect() { io_state_ = STATE_CONNECT_COMPLETE; int rv = session_->ResumeCryptoConnect( base::Bind(&QuicStreamFactory::Job::OnIOComplete, base::Unretained(this))); return rv; } int QuicStreamFactory::Job::DoConnectComplete(int rv) { if (rv != OK) return rv; DCHECK(!factory_->HasActiveSession(server_id_)); // There may well now be an active session for this IP. If so, use the // existing session instead. AddressList address(session_->connection()->peer_address()); if (factory_->OnResolution(server_id_, address)) { session_->connection()->SendConnectionClose(QUIC_CONNECTION_IP_POOLED); session_ = NULL; return OK; } factory_->ActivateSession(server_id_, session_); return OK; } QuicStreamRequest::QuicStreamRequest(QuicStreamFactory* factory) : factory_(factory) {} QuicStreamRequest::~QuicStreamRequest() { if (factory_ && !callback_.is_null()) factory_->CancelRequest(this); } int QuicStreamRequest::Request(const HostPortPair& host_port_pair, bool is_https, PrivacyMode privacy_mode, base::StringPiece method, const BoundNetLog& net_log, const CompletionCallback& callback) { DCHECK(!stream_); DCHECK(callback_.is_null()); DCHECK(factory_); int rv = factory_->Create(host_port_pair, is_https, privacy_mode, method, net_log, this); if (rv == ERR_IO_PENDING) { host_port_pair_ = host_port_pair; is_https_ = is_https; net_log_ = net_log; callback_ = callback; } else { factory_ = NULL; } if (rv == OK) DCHECK(stream_); return rv; } void QuicStreamRequest::set_stream(scoped_ptr<QuicHttpStream> stream) { DCHECK(stream); stream_ = stream.Pass(); } void QuicStreamRequest::OnRequestComplete(int rv) { factory_ = NULL; callback_.Run(rv); } scoped_ptr<QuicHttpStream> QuicStreamRequest::ReleaseStream() { DCHECK(stream_); return stream_.Pass(); } QuicStreamFactory::QuicStreamFactory( HostResolver* host_resolver, ClientSocketFactory* client_socket_factory, base::WeakPtr<HttpServerProperties> http_server_properties, CertVerifier* cert_verifier, QuicCryptoClientStreamFactory* quic_crypto_client_stream_factory, QuicRandom* random_generator, QuicClock* clock, size_t max_packet_length, const std::string& user_agent_id, const QuicVersionVector& supported_versions, bool enable_port_selection, bool enable_pacing, bool enable_time_based_loss_detection, QuicTagVector connection_options) : require_confirmation_(true), host_resolver_(host_resolver), client_socket_factory_(client_socket_factory), http_server_properties_(http_server_properties), cert_verifier_(cert_verifier), quic_server_info_factory_(NULL), quic_crypto_client_stream_factory_(quic_crypto_client_stream_factory), random_generator_(random_generator), clock_(clock), max_packet_length_(max_packet_length), config_(InitializeQuicConfig(enable_pacing, enable_time_based_loss_detection, connection_options)), supported_versions_(supported_versions), enable_port_selection_(enable_port_selection), port_seed_(random_generator_->RandUint64()), weak_factory_(this) { crypto_config_.SetDefaults(); crypto_config_.set_user_agent_id(user_agent_id); crypto_config_.AddCanonicalSuffix(".c.youtube.com"); crypto_config_.AddCanonicalSuffix(".googlevideo.com"); crypto_config_.SetProofVerifier(new ProofVerifierChromium(cert_verifier)); base::CPU cpu; if (cpu.has_aesni() && cpu.has_avx()) crypto_config_.PreferAesGcm(); if (!IsEcdsaSupported()) crypto_config_.DisableEcdsa(); } QuicStreamFactory::~QuicStreamFactory() { CloseAllSessions(ERR_ABORTED); while (!all_sessions_.empty()) { delete all_sessions_.begin()->first; all_sessions_.erase(all_sessions_.begin()); } STLDeleteValues(&active_jobs_); } int QuicStreamFactory::Create(const HostPortPair& host_port_pair, bool is_https, PrivacyMode privacy_mode, base::StringPiece method, const BoundNetLog& net_log, QuicStreamRequest* request) { QuicServerId server_id(host_port_pair, is_https, privacy_mode); if (HasActiveSession(server_id)) { request->set_stream(CreateIfSessionExists(server_id, net_log)); return OK; } if (HasActiveJob(server_id)) { Job* job = active_jobs_[server_id]; active_requests_[request] = job; job_requests_map_[job].insert(request); return ERR_IO_PENDING; } QuicServerInfo* quic_server_info = NULL; if (quic_server_info_factory_) { QuicCryptoClientConfig::CachedState* cached = crypto_config_.LookupOrCreate(server_id); DCHECK(cached); if (cached->IsEmpty()) { quic_server_info = quic_server_info_factory_->GetForServer(server_id); } } bool was_alternate_protocol_recently_broken = http_server_properties_ && http_server_properties_->WasAlternateProtocolRecentlyBroken( server_id.host_port_pair()); scoped_ptr<Job> job(new Job(this, host_resolver_, host_port_pair, is_https, was_alternate_protocol_recently_broken, privacy_mode, method, quic_server_info, net_log)); int rv = job->Run(base::Bind(&QuicStreamFactory::OnJobComplete, base::Unretained(this), job.get())); if (rv == ERR_IO_PENDING) { active_requests_[request] = job.get(); job_requests_map_[job.get()].insert(request); active_jobs_[server_id] = job.release(); } if (rv == OK) { DCHECK(HasActiveSession(server_id)); request->set_stream(CreateIfSessionExists(server_id, net_log)); } return rv; } bool QuicStreamFactory::OnResolution( const QuicServerId& server_id, const AddressList& address_list) { DCHECK(!HasActiveSession(server_id)); for (size_t i = 0; i < address_list.size(); ++i) { const IPEndPoint& address = address_list[i]; const IpAliasKey ip_alias_key(address, server_id.is_https()); if (!ContainsKey(ip_aliases_, ip_alias_key)) continue; const SessionSet& sessions = ip_aliases_[ip_alias_key]; for (SessionSet::const_iterator i = sessions.begin(); i != sessions.end(); ++i) { QuicClientSession* session = *i; if (!session->CanPool(server_id.host())) continue; active_sessions_[server_id] = session; session_aliases_[session].insert(server_id); return true; } } return false; } void QuicStreamFactory::OnJobComplete(Job* job, int rv) { if (rv == OK) { require_confirmation_ = false; // Create all the streams, but do not notify them yet. for (RequestSet::iterator it = job_requests_map_[job].begin(); it != job_requests_map_[job].end() ; ++it) { DCHECK(HasActiveSession(job->server_id())); (*it)->set_stream(CreateIfSessionExists(job->server_id(), (*it)->net_log())); } } while (!job_requests_map_[job].empty()) { RequestSet::iterator it = job_requests_map_[job].begin(); QuicStreamRequest* request = *it; job_requests_map_[job].erase(it); active_requests_.erase(request); // Even though we're invoking callbacks here, we don't need to worry // about |this| being deleted, because the factory is owned by the // profile which can not be deleted via callbacks. request->OnRequestComplete(rv); } active_jobs_.erase(job->server_id()); job_requests_map_.erase(job); delete job; return; } // Returns a newly created QuicHttpStream owned by the caller, if a // matching session already exists. Returns NULL otherwise. scoped_ptr<QuicHttpStream> QuicStreamFactory::CreateIfSessionExists( const QuicServerId& server_id, const BoundNetLog& net_log) { if (!HasActiveSession(server_id)) { DVLOG(1) << "No active session"; return scoped_ptr<QuicHttpStream>(); } QuicClientSession* session = active_sessions_[server_id]; DCHECK(session); return scoped_ptr<QuicHttpStream>( new QuicHttpStream(session->GetWeakPtr())); } void QuicStreamFactory::OnIdleSession(QuicClientSession* session) { } void QuicStreamFactory::OnSessionGoingAway(QuicClientSession* session) { const AliasSet& aliases = session_aliases_[session]; for (AliasSet::const_iterator it = aliases.begin(); it != aliases.end(); ++it) { DCHECK(active_sessions_.count(*it)); DCHECK_EQ(session, active_sessions_[*it]); // Track sessions which have recently gone away so that we can disable // port suggestions. if (session->goaway_received()) { gone_away_aliases_.insert(*it); } active_sessions_.erase(*it); ProcessGoingAwaySession(session, *it, true); } ProcessGoingAwaySession(session, all_sessions_[session], false); if (!aliases.empty()) { const IpAliasKey ip_alias_key(session->connection()->peer_address(), aliases.begin()->is_https()); ip_aliases_[ip_alias_key].erase(session); if (ip_aliases_[ip_alias_key].empty()) { ip_aliases_.erase(ip_alias_key); } } session_aliases_.erase(session); } void QuicStreamFactory::OnSessionClosed(QuicClientSession* session) { DCHECK_EQ(0u, session->GetNumOpenStreams()); OnSessionGoingAway(session); delete session; all_sessions_.erase(session); } void QuicStreamFactory::OnSessionConnectTimeout( QuicClientSession* session) { const AliasSet& aliases = session_aliases_[session]; for (AliasSet::const_iterator it = aliases.begin(); it != aliases.end(); ++it) { DCHECK(active_sessions_.count(*it)); DCHECK_EQ(session, active_sessions_[*it]); active_sessions_.erase(*it); } if (aliases.empty()) { return; } const IpAliasKey ip_alias_key(session->connection()->peer_address(), aliases.begin()->is_https()); ip_aliases_[ip_alias_key].erase(session); if (ip_aliases_[ip_alias_key].empty()) { ip_aliases_.erase(ip_alias_key); } QuicServerId server_id = *aliases.begin(); session_aliases_.erase(session); Job* job = new Job(this, host_resolver_, session, server_id); active_jobs_[server_id] = job; int rv = job->Run(base::Bind(&QuicStreamFactory::OnJobComplete, base::Unretained(this), job)); DCHECK_EQ(ERR_IO_PENDING, rv); } void QuicStreamFactory::CancelRequest(QuicStreamRequest* request) { DCHECK(ContainsKey(active_requests_, request)); Job* job = active_requests_[request]; job_requests_map_[job].erase(request); active_requests_.erase(request); } void QuicStreamFactory::CloseAllSessions(int error) { while (!active_sessions_.empty()) { size_t initial_size = active_sessions_.size(); active_sessions_.begin()->second->CloseSessionOnError(error); DCHECK_NE(initial_size, active_sessions_.size()); } while (!all_sessions_.empty()) { size_t initial_size = all_sessions_.size(); all_sessions_.begin()->first->CloseSessionOnError(error); DCHECK_NE(initial_size, all_sessions_.size()); } DCHECK(all_sessions_.empty()); } base::Value* QuicStreamFactory::QuicStreamFactoryInfoToValue() const { base::ListValue* list = new base::ListValue(); for (SessionMap::const_iterator it = active_sessions_.begin(); it != active_sessions_.end(); ++it) { const QuicServerId& server_id = it->first; QuicClientSession* session = it->second; const AliasSet& aliases = session_aliases_.find(session)->second; // Only add a session to the list once. if (server_id == *aliases.begin()) { std::set<HostPortPair> hosts; for (AliasSet::const_iterator alias_it = aliases.begin(); alias_it != aliases.end(); ++alias_it) { hosts.insert(alias_it->host_port_pair()); } list->Append(session->GetInfoAsValue(hosts)); } } return list; } void QuicStreamFactory::ClearCachedStatesInCryptoConfig() { crypto_config_.ClearCachedStates(); } void QuicStreamFactory::OnIPAddressChanged() { CloseAllSessions(ERR_NETWORK_CHANGED); require_confirmation_ = true; } void QuicStreamFactory::OnCertAdded(const X509Certificate* cert) { CloseAllSessions(ERR_CERT_DATABASE_CHANGED); } void QuicStreamFactory::OnCACertChanged(const X509Certificate* cert) { // We should flush the sessions if we removed trust from a // cert, because a previously trusted server may have become // untrusted. // // We should not flush the sessions if we added trust to a cert. // // Since the OnCACertChanged method doesn't tell us what // kind of change it is, we have to flush the socket // pools to be safe. CloseAllSessions(ERR_CERT_DATABASE_CHANGED); } bool QuicStreamFactory::HasActiveSession( const QuicServerId& server_id) const { return ContainsKey(active_sessions_, server_id); } int QuicStreamFactory::CreateSession( const QuicServerId& server_id, scoped_ptr<QuicServerInfo> server_info, const AddressList& address_list, const BoundNetLog& net_log, QuicClientSession** session) { bool enable_port_selection = enable_port_selection_; if (enable_port_selection && ContainsKey(gone_away_aliases_, server_id)) { // Disable port selection when the server is going away. // There is no point in trying to return to the same server, if // that server is no longer handling requests. enable_port_selection = false; gone_away_aliases_.erase(server_id); } QuicConnectionId connection_id = random_generator_->RandUint64(); IPEndPoint addr = *address_list.begin(); scoped_refptr<PortSuggester> port_suggester = new PortSuggester(server_id.host_port_pair(), port_seed_); DatagramSocket::BindType bind_type = enable_port_selection ? DatagramSocket::RANDOM_BIND : // Use our callback. DatagramSocket::DEFAULT_BIND; // Use OS to randomize. scoped_ptr<DatagramClientSocket> socket( client_socket_factory_->CreateDatagramClientSocket( bind_type, base::Bind(&PortSuggester::SuggestPort, port_suggester), net_log.net_log(), net_log.source())); int rv = socket->Connect(addr); if (rv != OK) { HistogramCreateSessionFailure(CREATION_ERROR_CONNECTING_SOCKET); return rv; } UMA_HISTOGRAM_COUNTS("Net.QuicEphemeralPortsSuggested", port_suggester->call_count()); if (enable_port_selection) { DCHECK_LE(1u, port_suggester->call_count()); } else { DCHECK_EQ(0u, port_suggester->call_count()); } // We should adaptively set this buffer size, but for now, we'll use a size // that is more than large enough for a full receive window, and yet // does not consume "too much" memory. If we see bursty packet loss, we may // revisit this setting and test for its impact. const int32 kSocketBufferSize(TcpReceiver::kReceiveWindowTCP); rv = socket->SetReceiveBufferSize(kSocketBufferSize); if (rv != OK) { HistogramCreateSessionFailure(CREATION_ERROR_SETTING_RECEIVE_BUFFER); return rv; } // Set a buffer large enough to contain the initial CWND's worth of packet // to work around the problem with CHLO packets being sent out with the // wrong encryption level, when the send buffer is full. rv = socket->SetSendBufferSize(kMaxPacketSize * 20); if (rv != OK) { HistogramCreateSessionFailure(CREATION_ERROR_SETTING_SEND_BUFFER); return rv; } scoped_ptr<QuicDefaultPacketWriter> writer( new QuicDefaultPacketWriter(socket.get())); if (!helper_.get()) { helper_.reset(new QuicConnectionHelper( base::MessageLoop::current()->message_loop_proxy().get(), clock_.get(), random_generator_)); } QuicConnection* connection = new QuicConnection(connection_id, addr, helper_.get(), writer.get(), false, supported_versions_); writer->SetConnection(connection); connection->set_max_packet_length(max_packet_length_); InitializeCachedStateInCryptoConfig(server_id, server_info); QuicConfig config = config_; config.SetInitialCongestionWindowToSend( server_id.is_https() ? kServerSecureInitialCongestionWindow : kServerInecureInitialCongestionWindow); config.SetInitialFlowControlWindowToSend(kInitialReceiveWindowSize); config.SetInitialStreamFlowControlWindowToSend(kInitialReceiveWindowSize); config.SetInitialSessionFlowControlWindowToSend(kInitialReceiveWindowSize); if (http_server_properties_) { const HttpServerProperties::NetworkStats* stats = http_server_properties_->GetServerNetworkStats( server_id.host_port_pair()); if (stats != NULL) { config.SetInitialRoundTripTimeUsToSend(stats->srtt.InMicroseconds()); } } *session = new QuicClientSession( connection, socket.Pass(), writer.Pass(), this, quic_crypto_client_stream_factory_, server_info.Pass(), server_id, config, &crypto_config_, base::MessageLoop::current()->message_loop_proxy().get(), net_log.net_log()); all_sessions_[*session] = server_id; // owning pointer return OK; } bool QuicStreamFactory::HasActiveJob(const QuicServerId& key) const { return ContainsKey(active_jobs_, key); } void QuicStreamFactory::ActivateSession( const QuicServerId& server_id, QuicClientSession* session) { DCHECK(!HasActiveSession(server_id)); UMA_HISTOGRAM_COUNTS("Net.QuicActiveSessions", active_sessions_.size()); active_sessions_[server_id] = session; session_aliases_[session].insert(server_id); const IpAliasKey ip_alias_key(session->connection()->peer_address(), server_id.is_https()); DCHECK(!ContainsKey(ip_aliases_[ip_alias_key], session)); ip_aliases_[ip_alias_key].insert(session); } void QuicStreamFactory::InitializeCachedStateInCryptoConfig( const QuicServerId& server_id, const scoped_ptr<QuicServerInfo>& server_info) { if (!server_info) return; QuicCryptoClientConfig::CachedState* cached = crypto_config_.LookupOrCreate(server_id); if (!cached->IsEmpty()) return; if (!cached->Initialize(server_info->state().server_config, server_info->state().source_address_token, server_info->state().certs, server_info->state().server_config_sig, clock_->WallNow())) return; if (!server_id.is_https()) { // Don't check the certificates for insecure QUIC. cached->SetProofValid(); } } void QuicStreamFactory::ProcessGoingAwaySession( QuicClientSession* session, const QuicServerId& server_id, bool session_was_active) { if (!http_server_properties_) return; const QuicConnectionStats& stats = session->connection()->GetStats(); if (session->IsCryptoHandshakeConfirmed()) { HttpServerProperties::NetworkStats network_stats; network_stats.srtt = base::TimeDelta::FromMicroseconds(stats.srtt_us); network_stats.bandwidth_estimate = stats.estimated_bandwidth; http_server_properties_->SetServerNetworkStats(server_id.host_port_pair(), network_stats); return; } UMA_HISTOGRAM_COUNTS("Net.QuicHandshakeNotConfirmedNumPacketsReceived", stats.packets_received); if (!session_was_active) return; const HostPortPair& server = server_id.host_port_pair(); // Don't try to change the alternate-protocol state, if the // alternate-protocol state is unknown. if (!http_server_properties_->HasAlternateProtocol(server)) return; // TODO(rch): In the special case where the session has received no // packets from the peer, we should consider blacklisting this // differently so that we still race TCP but we don't consider the // session connected until the handshake has been confirmed. HistogramBrokenAlternateProtocolLocation( BROKEN_ALTERNATE_PROTOCOL_LOCATION_QUIC_STREAM_FACTORY); PortAlternateProtocolPair alternate = http_server_properties_->GetAlternateProtocol(server); DCHECK_EQ(QUIC, alternate.protocol); // Since the session was active, there's no longer an // HttpStreamFactoryImpl::Job running which can mark it broken, unless the // TCP job also fails. So to avoid not using QUIC when we otherwise could, // we mark it as broken, and then immediately re-enable it. This leaves // QUIC as "recently broken" which means that 0-RTT will be disabled but // we'll still race. http_server_properties_->SetBrokenAlternateProtocol(server); http_server_properties_->ClearAlternateProtocol(server); http_server_properties_->SetAlternateProtocol( server, alternate.port, alternate.protocol); DCHECK_EQ(QUIC, http_server_properties_->GetAlternateProtocol(server).protocol); DCHECK(http_server_properties_->WasAlternateProtocolRecentlyBroken( server)); } } // namespace net

[ "chenming.eecs@pku.edu.cn" ]

chenming.eecs@pku.edu.cn

9ebfe0b30acf0a05a4de133c45ce19f2f0b88a20

6768858dfdb0aec72ff95ed78e32760bc7198347

/Sorting Algorithm/Algorithm_assignment/main.cpp

1451dafed9fa112b7af3d8d6d421395df19e95f6

[]

no_license

dhk1349/Algorithm

fe58f8d6bd48e02f30005f0ff440af7888a04424

a9d547fa16eedf1338d049700688f3545b5b8686

refs/heads/master

2021-12-30T16:48:10.813904

2021-12-27T16:57:09

194,836,267

0

null

UTF-8

C++

false

509

cpp

#include<iostream> #include<fstream> #include <string> #include <ctime> #include "Sorting_algorithm.h" using namespace std; int main() { int testarr[15000]; int result=get_arr("test_array.csv",testarr,15000); //ERROR if (result == -1) { cerr << "\tFailed to load array file!\n"; return -1; } // clock_t begin = clock(); Bubble(testarr,15000); clock_t end = clock(); double elapsed_secs = double(end - begin) / CLOCKS_PER_SEC; cout << elapsed_secs << "seconds"<<endl; return 1; }

[ "dhk1349@naver.com" ]

dhk1349@naver.com

6c6a5fd5de14e43e38cef7a7007f649fb01e95e0

745a45b6bcf85fe497fc1acd06ef0b68b934626a

/suif/suif2b/suifbrowser/visual/vtcl.h

835c8fbebe7351d1cca1d31e82a6b5b4c4dfea2d

[]

no_license

jrk/suif2

e7c9f5e644f30422f7735837734e34248115cd2c

6f4dee1a906cfd00d3b57a7ead6f9fc807d7455d

refs/heads/master

2021-01-23T11:54:36.487230

2011-03-23T03:18:28

1,514,729

1

0

null

UTF-8

C++

false

5,211

h

#ifndef VTCL_H #define VTCL_H //#include <sty.h> #include "common/suif_list.h" #include "vcommands.h" #include <tcl.h> #include <tk.h> #include <stdlib.h> #include <string.h> #include "suifkernel/suifkernel_messages.h" /* globals */ extern Tcl_Interp *v_interp; // Visual interpreter /* * tcl command interface class * */ #define COMMAND_INCREMENT_SIZE 500 class tcl_terminator { }; extern tcl_terminator *tcl_end; // end of tcl command, will call tcl to // interpret the command extern char *tcl_0; class tcl_command { private: char *command; // points to current tcl_command (or 0) int end_command; // offset of the last valid element of string (the 0) int end_reserved_space; // the first offset past the allocation area // (all usable offsets have to be smaller) Tcl_Interp *interp; protected: char* reserve_space( int size_to_reserve ) { // space_remaining can be negative! (in the beginning) int space_remaining = end_reserved_space - end_command - 1; if ( size_to_reserve > space_remaining ) { int increment_size = size_to_reserve < COMMAND_INCREMENT_SIZE ? COMMAND_INCREMENT_SIZE : size_to_reserve; end_reserved_space = end_reserved_space + increment_size; if ( !command ) end_reserved_space++; // space for extra 0 char* new_space = new char[ end_reserved_space ]; // initialize the new string if ( command ) { strcpy( new_space, command ); } else { assert( end_command == 0 ); new_space[0]=0; } delete [] command; command = new_space; } suif_assert_message( ( command[end_command]==0 ), ("End of string must be 0" )); return command+end_command; } void reset_string() { delete [] command; command = 0; end_command = 0; end_reserved_space = 0; } public: tcl_command() { command = 0; reset_string(); interp = 0; } ~tcl_command() { reset_string(); } void set_interp(Tcl_Interp *tcl_interp) { interp = tcl_interp; } Tcl_Interp *get_interp(void) { return interp; } /* * create command */ void create_command(char *cmdName, Tcl_CmdProc *proc, ClientData clientData, Tcl_CmdDeleteProc *deleteProc) { Tcl_CreateCommand(interp, cmdName, proc, clientData, deleteProc); } int link_var(char *varName, char *addr, int type) { return (Tcl_LinkVar(interp, varName, addr, type)); } void unlink_var(char *varName) { Tcl_UnlinkVar(interp, varName); } /* * Evaluating tcl command * */ int operator << (const tcl_terminator *) { assert( command ); // ATTENTION: This might be invoked recursively!! // => reinitialize this object before invoking eval char* current_command = command; command = 0; reset_string(); int result = eval( current_command ); delete [] current_command; return result; } tcl_command &operator << (const char *string) { int length = strlen( string ); char* start = reserve_space( length ); sprintf( start, "{%s} ", string); end_command += length + 3; return *this; } tcl_command &operator << (const void *data) { const int buffer_size = 20; char buffer[ buffer_size ]; sprintf( buffer, "%p ", data ); int len = strlen( buffer ); suif_assert_message( (len<=buffer_size), ("Pointer to string conversion has unexpected size (too large).\n") ); strcat( reserve_space( len ), buffer ); end_command += len; return *this; } tcl_command &operator << (int data) { const int buffer_size = 40; char buffer[ buffer_size ]; sprintf( buffer, "%d ", data ); int len = strlen( buffer ); suif_assert_message(( len<=buffer_size), ("Int to string conversion has unexpected size (too large).\n" )); strcat( reserve_space( len ), buffer ); end_command += len; return *this; } tcl_command &operator << ( double data ) { const int buffer_size = 40; char buffer[ buffer_size ]; sprintf( buffer, "%f ", data ); int len = strlen( buffer ); suif_assert_message( (len<=buffer_size), ("Double to string conversion has unexpected size (too large).\n") ); strcat( reserve_space( len ), buffer ); end_command += len; return *this; } int eval(char *string) { int result = Tcl_Eval(interp, string); if (result != TCL_OK) { v_warning("Tcl command `%s': (%d) %s", string, result, interp->result); } return result; } int eval_file(char *filename) { return (Tcl_EvalFile(interp, filename)); } /* * Get results from tcl */ int operator >> (int &data) { data = atoi(interp->result); return TCL_OK; } int operator >> (char *&data) { strcpy(data, interp->result); return TCL_OK; } int operator >> (void *&data) { if (sscanf(interp->result, "%p", &data) != 1) { return TCL_ERROR; } else { return TCL_OK; } } char *result() { return interp->result; } /* * Misc */ void print(FILE *fd = stdout) { fprintf(fd, "%s\n", command ? command : "<NO COMMAND>"); } }; extern tcl_command tcl; #endif

[ "jrk@csail.mit.edu" ]

jrk@csail.mit.edu

e2f3e32e8fc8cd12c0bae06a54c1165edf919a10

29dc7d8a031e7f686dc223d054cdd3ee62058371

/Networking/Network/Src/MemoryStream.cpp

6e64e31308cef98d46412476aef02df60b47265b

[]

no_license

teddysot/Engine

c4ca8503762570027662e28b4a4a7c6784bcbc3b

2aaf6cdc566e7b83fd805998c708415882d288ae

refs/heads/master

2020-04-07T21:31:30.938297

2018-11-22T18:00:57

158,730,601

0

null

UTF-8

C++

false

1,729

cpp

//==================================================================================================== // Filename: MemoryStream.cpp // Created by: Peter Chan //==================================================================================================== #include "Precompiled.h" #include "MemoryStream.h" using namespace Network; //---------------------------------------------------------------------------------------------------- MemoryStream::MemoryStream() : mBuffer(nullptr) , mHead(0) , mCapacity(0) { } //---------------------------------------------------------------------------------------------------- MemoryStream::MemoryStream(uint32_t capacity) : mBuffer(nullptr) , mHead(0) , mCapacity(0) { ReallocBuffer(capacity); } //---------------------------------------------------------------------------------------------------- MemoryStream::MemoryStream(const uint8_t* data, uint32_t size, bool takeOwnership) : mBuffer(nullptr) , mHead(0) , mCapacity(size) { if (takeOwnership) { mBuffer = const_cast<uint8_t*>(data); } else { mBuffer = static_cast<uint8_t*>(std::malloc(size)); memcpy(mBuffer, data, size); } } //---------------------------------------------------------------------------------------------------- MemoryStream::~MemoryStream() { std::free(mBuffer); } //---------------------------------------------------------------------------------------------------- void MemoryStream::Reset() { mHead = 0; } //---------------------------------------------------------------------------------------------------- void MemoryStream::ReallocBuffer(uint32_t newCapacity) { mBuffer = static_cast<uint8_t*>(std::realloc(mBuffer, newCapacity)); mCapacity = newCapacity; }

[ "earth_sot@hotmail.com" ]

earth_sot@hotmail.com

6aa3b8afde4d7bb2ba2cb3e5ed63fe53a78044f6

c7f254879ddbc7e14120c6ae7afa8f104fe44e57

/NanoguiModule/nanogui/label.h

40f652f2bad2cb30acba3e49fddaef660117f19f

[]

no_license

Hurleyworks/NanoguiBlock

6926bb57dae837a9f6ef782dbfbd572c0cd75be8

b3dd7edfa8c1c865b70bf68daebf041259dc4578

refs/heads/master

2021-01-10T17:55:46.177295

2016-11-08T20:16:25

45,840,075

11

13

null

2020-04-18T03:48:05

2015-11-09T13:38:21

C++

UTF-8

C++

false

1,827

h

/* nanogui/label.h -- Text label with an arbitrary font, color, and size NanoGUI was developed by Wenzel Jakob <wenzel@inf.ethz.ch>. The widget drawing code is based on the NanoVG demo application by Mikko Mononen. All rights reserved. Use of this source code is governed by a BSD-style license that can be found in the LICENSE.txt file. */ #pragma once NAMESPACE_BEGIN (nanogui) /** \brief Text label widget The font and color can be customized. When \ref Widget::setFixedWidth() is used, the text is wrapped when it surpasses the specified width */ class Label : public Widget { public: Label (Widget * parent, const std::string & caption, const std::string & font = "sans", int fontSize = -1); /// Get the label's text caption const std::string & caption() const { return mCaption; } /// Set the label's text caption void setCaption (const std::string & caption) { mCaption = caption; } /// Set the currently active font (2 are available by default: 'sans' and 'sans-bold') void setFont (const std::string & font) { mFont = font; } /// Get the currently active font const std::string & font() const { return mFont; } /// Get the label color Colour color() const { return mColor; } /// Set the label color void setColor (Colour color) { mColor = color; } /// Compute the size needed to fully display the label virtual ivec2 preferredSize (NVGcontext * ctx) const; /// Draw the label virtual void draw (NVGcontext * ctx); protected: std::string mCaption; std::string mFont; Colour mColor; }; NAMESPACE_END (nanogui)

[ "github@hurleyworks.com" ]

github@hurleyworks.com

5951799d160e1ed2d6c5c324d7663fce377040b0

b0f2009e1c70d729574295697cc0d5d1dd465e97

/labo/2015-2016/04/02.ino

d9ed29a9b2b76b3552d82d14bf9bc471a3109e43

[]

no_license

oberonlievens/computertechnologie-3

36a60c54abdaefc8e29466299e9c41ac9c81ef3b

1ef8502574def922039d5d261ac46440f753ea56

refs/heads/master

2022-04-02T19:07:56.006781

2020-01-30T09:06:09

null

0

null

UTF-8

C++

false

435

ino

#include <TimerOne.h> int minute = 0; int second = 0; void setup() { Timer1.initialize(1000000); Timer1.attachInterrupt(timerIsr); Serial.begin(9600); } void loop() { minute < 10 ? Serial.print("0"):false; Serial.print(minute); Serial.print(":"); second < 10 ? Serial.print("0"):false; Serial.println(second); delay(1000); } void timerIsr() { second++; if (second == 60 ) { second = 0; minute++; } }

[ "hello@haroen.me" ]

hello@haroen.me

b60fea8cc6b976d323fae0dda2e654c378a55b4b

1513f7e79a7142c933636066908b79ebc131f10e

/squashfs-root/usr/include/KF5/KI18n/kuitmarkup.h

e17073b72afc7922f210223501eeeee7992b54b7

[]

no_license

softwarenerd7/eXternOS-Base

1e11dd26ae2dfebe77cf3a46c0e6925bc7f83542

2e202775e52dd69352b7325d270090323121111d

refs/heads/master

2023-01-12T10:31:48.635447

2020-11-17T21:08:36

null

0

null

UTF-8

C++

false

6,502

h

/* This file is part of the KDE libraries Copyright (C) 2013 Chusslove Illich <caslav.ilic@gmx.net> This library is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public License for more details. You should have received a copy of the GNU Library General Public License along with this library; see the file COPYING.LIB. If not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ #ifndef KUITMARKUP_H #define KUITMARKUP_H #include <ki18n_export.h> #include <QString> #include <QStringList> #include <QHash> class KuitSetup; /** * Global constants and functions related to KUIT markup. */ namespace Kuit { /** * Visual formats into which KUIT markup can be resolved. */ enum VisualFormat { /** * Visual format not defined. * This value can be explicitly set * (e.g. through \c KLocalizedString::withFormat) * to indicate that the format should be decided * by another mechanism (e.g. context UI marker). */ UndefinedFormat = 0, /** * Plain text. */ PlainText = 10, /** * Qt rich text (HTML subset). */ RichText = 20, /** * Terminal escape sequences. */ TermText = 30 }; /** * Classification of KUIT tags. */ enum TagClass { /** * Tags wrapping text inserted into running text. */ PhraseTag = 0, /** * Tags spliting text into paragraph-level blocks. */ StructTag = 1 }; /** * Functions accepted by tag formatting functions. * * \param languages the target languages (by decreasing priority) * \param tagName the wrapping tag name * \param attributes the attribute name-value pairs in the tag * \param text the wrapped text * \param tagPath the ordered list of ancestor tag names, parent first * \param format the target visual format * \return formatted text */ typedef QString(*TagFormatter)(const QStringList &languages, const QString &tagName, const QHash<QString, QString> &attributes, const QString &text, const QStringList &tagPath, Kuit::VisualFormat format); /** * Get hold of the KUIT setup object for a given domain. * * \param domain the translation domain * \return pointer to KUIT setup object */ KuitSetup &setupForDomain(const char *domain); KuitSetup &setupForDomain(const QByteArray& domain); } class KLocalizedString; class KuitSetupPrivate; class KuitFormatterPrivate; /** * @class KuitSetup kuitmarkup.h <KuitSetup> * * Class for modifying KUIT markup in a given domain. * * Not directly constructed, but obtained through \c Kuit::setupForDomain. */ class KI18N_EXPORT KuitSetup { friend KuitSetup &Kuit::setupForDomain(const QByteArray& domain); friend class KuitFormatterPrivate; public: /** * Destructor. */ ~KuitSetup(); /** * Set the formatting string for a tag with attributes combination. * * If a new tag name is given, this effectively defines a new tag. * The same holds for attribute names. * * The pattern string \p pattern should contain placeholders * for inserting the text and the attribute values. * %1 will be replaced with the wrapped text, and %2 and upwards * with attribute values in the order given by \p attrNames. * Non markup-aware translation call with context (\c ki18nc) * should be used to create the pattern string. * * In addition to the pattern, a formatting function * of the type \c TagFormatter can be given. * This function receives the full markup parsing context, * so that it can do whatever is necessary with the wrapped text. * The result of this function is then substituted into the pattern. * You can also give an empty pattern (as <tt>KLocalizedString()</tt>) * together with the formatting function, in which case the function * is assumed to do everything and no substitution is performed. * * \param tagName the name of the tag * \param attribNames the names of the attributes (empty names are ignored) * \param format the target visual format * \param pattern the pattern string * \param leadingNewlines the number of new lines (\\n) to be maintained * between any preceding text and the text wrapped * with this tag (for formats where it matters) */ void setTagPattern(const QString &tagName, const QStringList &attribNames, Kuit::VisualFormat format, const KLocalizedString &pattern, Kuit::TagFormatter formatter = nullptr, int leadingNewlines = 0); /** * Set the KUIT class of the tag. * * \param tagName the name of the tag * \param aClass the KUIT tag class */ void setTagClass(const QString &tagName, Kuit::TagClass aClass); /** * Set the default visual format for a given UI marker. * * Giving <tt>"@<major>"</tt> for \p marker means to set the format * only for standalone <tt>\@\<major\></tt> marker, * while <tt>"@<major>:"</tt> (with trailing colon) means to set * the same format for all <tt>\@\<major\>:\<minor\></tt> combinations. * * Defined UI marker major/minor combinations are listed in the section * \ref uimark_ctxt. If an UI marker combination outside of the defined * is given as \p marker, it will be ignored. * * Setting \c Kuit::UndefinedFormat as \p format * means to fall back to default format for the given UI marker. * * \param marker the UI marker * \param format the visual format */ void setFormatForMarker(const QString &marker, Kuit::VisualFormat format); private: KuitSetup(const QByteArray &domain); Q_DISABLE_COPY(KuitSetup) KuitSetupPrivate *const d; }; #endif // KUITMARKUP_H

[ "anesuemail@gmail.com" ]

anesuemail@gmail.com

d7877543ead429ced221511f784b137a8d1503f3

dbaa90195352be895c97e92d1391d3df1314b1b8

/xTen/src/graphics/mesh.cpp

51332139d4bcfe56d999fb5f0851f52e0afef27d

[]

no_license

paubertin/xTen_old

08610a81a3d43f73b9162090400eb9c531461aa3

9412b611ae9a8867a8b9b4d9907e99e064a63a97

refs/heads/master

2021-06-01T10:13:53.441813

2016-07-06T23:41:16

null

0

null

UTF-8

C++

false

5,424

cpp

#include "mesh.h" #include "../utils/utils.h" #include "../maths/xmaths.h" #include "texturemanager.h" namespace xten { namespace xgraphics { Mesh::MeshEntry::MeshEntry() : m_VAO(NULL), m_VBO(NULL), m_IBO(NULL), numIndices(NULL), materialIndex(NULL) { } Mesh::MeshEntry::~MeshEntry() { GLCall( glDeleteBuffers(1, &m_VBO) ); GLCall( glDeleteBuffers(1, &m_IBO) ); } void Mesh::MeshEntry::init(const std::vector<Vertex>& vertices, const std::vector<GLuint>& indices) { numIndices = indices.size(); GLCall( glGenVertexArrays(1, &m_VAO) ); GLCall( glGenBuffers(1, &m_VBO) ); GLCall( glGenBuffers(1, &m_IBO) ); GLCall( glBindVertexArray(m_VAO) ); GLCall( glBindBuffer(GL_ARRAY_BUFFER, m_VBO) ); GLCall( glBufferData(GL_ARRAY_BUFFER, sizeof(Vertex) * vertices.size(), &vertices[0], GL_STATIC_DRAW) ); GLCall( glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, m_IBO) ); GLCall( glBufferData(GL_ELEMENT_ARRAY_BUFFER, sizeof(GLuint) * numIndices, &indices[0], GL_STATIC_DRAW) ); //positions GLCall( glEnableVertexAttribArray(0) ); GLCall( glVertexAttribPointer(0, 3, GL_FLOAT, GL_FALSE, sizeof(Vertex), (GLvoid*)(0)) ); //texcoord GLCall( glEnableVertexAttribArray(1) ); GLCall( glVertexAttribPointer(1, 2, GL_FLOAT, GL_FALSE, sizeof(Vertex), (GLvoid*)(offsetof(Vertex, Vertex::uv))) ); //normal GLCall( glEnableVertexAttribArray(2) ); GLCall( glVertexAttribPointer(2, 3, GL_FLOAT, GL_FALSE, sizeof(Vertex), (GLvoid*)(offsetof(Vertex, Vertex::normal))) ); //glBindBuffer(GL_ELEMENT_ARRAY_BUFFER, 0); //glBindBuffer(GL_ARRAY_BUFFER, 0); GLCall( glBindVertexArray(0) ); } Mesh::Mesh() {} Mesh::~Mesh() { clear(); } void Mesh::clear() { for (GLuint i = 0; i < m_Textures.size(); ++i) { // XDEL(m_Textures[i]); } } GLboolean Mesh::loadMesh(const std::string & filename) { clear(); GLboolean res = GL_FALSE; Assimp::Importer import; const aiScene* scene = import.ReadFile(filename.c_str(), aiProcess_FlipUVs | aiProcess_GenSmoothNormals | aiProcess_Triangulate); if (!scene || scene->mFlags == AI_SCENE_FLAGS_INCOMPLETE || !scene->mRootNode) { std::string err = "[ASSIMP]. Could not load file: " + filename + "\n" + import.GetErrorString(); XTEN_ERROR(err); return res; } else { res = initFromScene(scene, filename); } return res; } void Mesh::render() { for (GLuint i = 0; i < m_Entries.size(); i++) { const GLuint MaterialIndex = m_Entries[i].materialIndex; if (MaterialIndex < m_Textures.size() && m_Textures[MaterialIndex]) { m_Textures[MaterialIndex]->bind(GL_TEXTURE0); } GLCall( glBindVertexArray(m_Entries[i].m_VAO) ); GLCall( glDrawElements(GL_TRIANGLES, m_Entries[i].numIndices, GL_UNSIGNED_INT, NULL) ); GLCall( glBindVertexArray(0) ); } } GLboolean Mesh::initFromScene(const aiScene* scene, const std::string & filename) { m_Entries.resize(scene->mNumMeshes); m_Textures.resize(scene->mNumMaterials); for (GLuint i = 0; i < m_Entries.size(); ++i) { const aiMesh* aimesh = scene->mMeshes[i]; initMesh(i, aimesh); } return initMaterials(scene, filename); } void Mesh::initMesh(GLuint index, const aiMesh* aimesh) { using namespace xmaths; std::vector<Vertex> vertices; std::vector<GLuint> indices; for (GLuint i = 0; i < aimesh->mNumVertices; i++) { vec3 position(aimesh->mVertices[i].x, aimesh->mVertices[i].y, aimesh->mVertices[i].z); vec3 normal(aimesh->mNormals[i].x, aimesh->mNormals[i].y, aimesh->mNormals[i].z); vec2 texcoord = aimesh->HasTextureCoords(0) ? vec2(aimesh->mTextureCoords[0][i].x, aimesh->mTextureCoords[0][i].y) : vec2(0.f); vertices.push_back(Vertex(vec3(aimesh->mVertices[i].x, aimesh->mVertices[i].y, aimesh->mVertices[i].z), aimesh->HasTextureCoords(0) ? vec2(aimesh->mTextureCoords[0][i].x, aimesh->mTextureCoords[0][i].y) : vec2(0.f), vec3(aimesh->mNormals[i].x, aimesh->mNormals[i].y, aimesh->mNormals[i].z))); } for (GLuint i = 0; i < aimesh->mNumFaces; i++) { const aiFace& face = aimesh->mFaces[i]; XASSERT(face.mNumIndices == 3); indices.push_back(face.mIndices[0]); indices.push_back(face.mIndices[1]); indices.push_back(face.mIndices[2]); } m_Entries[index].materialIndex = aimesh->mMaterialIndex; m_Entries[index].init(vertices, indices); } GLboolean Mesh::initMaterials(const aiScene* scene, const std::string & filename) { // Extract the directory part from the file name std::string::size_type SlashIndex = filename.find_last_of("/"); std::string Dir; if (SlashIndex == std::string::npos) { Dir = "."; } else if (SlashIndex == 0) { Dir = "/"; } else { Dir = filename.substr(0, SlashIndex); } GLboolean res = GL_TRUE; for (GLuint i = 0; i < scene->mNumMaterials; i++) { const aiMaterial * mat = scene->mMaterials[i]; m_Textures[i] = nullptr; if (mat->GetTextureCount(aiTextureType_DIFFUSE) > 0) { aiString path; if (mat->GetTexture(aiTextureType_DIFFUSE, 0, &path, NULL, NULL, NULL, NULL, NULL) == AI_SUCCESS) { std::string fullpath = Dir + "/" + path.data; m_Textures[i] = TexManager::add(GL_TEXTURE_2D, path.data, fullpath, GL_TRUE); } } if (!m_Textures[i]) { m_Textures[i] = TexManager::get("default_white"); } if (!m_Textures[i]) { res = GL_FALSE; } } return res; } } }

[ "paubertin@gmail.com" ]

paubertin@gmail.com

62a62f70f7dc2c66e011312594ee24329e8aedff

ae956d4076e4fc03b632a8c0e987e9ea5ca89f56

/SDK/TBP_UI_Quest_Objective_Notification_Item_functions.cpp

c8c3277f475af07bf35576662f13557157ddaee3

[]

no_license

BrownBison/Bloodhunt-BASE

5c79c00917fcd43c4e1932bee3b94e85c89b6bc7

8ae1104b748dd4b294609717142404066b6bc1e6

refs/heads/main

2023-08-07T12:04:49.234272

2021-10-02T15:13:42

638,649,990

1

0

null

2023-05-09T20:02:24

2023-05-09T20:02:23

null

UTF-8

C++

false

3,116

cpp

// Name: bbbbbbbbbbbbbbbbbbbbbbblod, Version: 1 #include "../pch.h" /*!!DEFINE!!*/ /*!!HELPER_DEF!!*/ /*!!HELPER_INC!!*/ #ifdef _MSC_VER #pragma pack(push, 0x01) #endif namespace CG { //--------------------------------------------------------------------------- // Functions //--------------------------------------------------------------------------- // Function: // Offset -> 0x016C0340 // Name -> Function TBP_UI_Quest_Objective_Notification_Item.TBP_UI_Quest_Objective_Notification_Item_C.SetupDataFromQuestObjective // Flags -> (Public, BlueprintCallable, BlueprintEvent) // Parameters: // class UTigerQuestObjective* TigerQuestObjective (BlueprintVisible, BlueprintReadOnly, Parm, ZeroConstructor, IsPlainOldData, NoDestructor, HasGetValueTypeHash) void UTBP_UI_Quest_Objective_Notification_Item_C::SetupDataFromQuestObjective(class UTigerQuestObjective* TigerQuestObjective) { static UFunction* fn = UObject::FindObject<UFunction>("Function TBP_UI_Quest_Objective_Notification_Item.TBP_UI_Quest_Objective_Notification_Item_C.SetupDataFromQuestObjective"); UTBP_UI_Quest_Objective_Notification_Item_C_SetupDataFromQuestObjective_Params params; params.TigerQuestObjective = TigerQuestObjective; auto flags = fn->FunctionFlags; UObject::ProcessEvent(fn, &params); fn->FunctionFlags = flags; } // Function: // Offset -> 0x016C0340 // Name -> Function TBP_UI_Quest_Objective_Notification_Item.TBP_UI_Quest_Objective_Notification_Item_C.Construct // Flags -> (BlueprintCosmetic, Event, Public, BlueprintEvent) void UTBP_UI_Quest_Objective_Notification_Item_C::Construct() { static UFunction* fn = UObject::FindObject<UFunction>("Function TBP_UI_Quest_Objective_Notification_Item.TBP_UI_Quest_Objective_Notification_Item_C.Construct"); UTBP_UI_Quest_Objective_Notification_Item_C_Construct_Params params; auto flags = fn->FunctionFlags; UObject::ProcessEvent(fn, &params); fn->FunctionFlags = flags; } // Function: // Offset -> 0x016C0340 // Name -> Function TBP_UI_Quest_Objective_Notification_Item.TBP_UI_Quest_Objective_Notification_Item_C.ExecuteUbergraph_TBP_UI_Quest_Objective_Notification_Item // Flags -> (Final) // Parameters: // int EntryPoint (BlueprintVisible, BlueprintReadOnly, Parm, ZeroConstructor, IsPlainOldData, NoDestructor, HasGetValueTypeHash) void UTBP_UI_Quest_Objective_Notification_Item_C::ExecuteUbergraph_TBP_UI_Quest_Objective_Notification_Item(int EntryPoint) { static UFunction* fn = UObject::FindObject<UFunction>("Function TBP_UI_Quest_Objective_Notification_Item.TBP_UI_Quest_Objective_Notification_Item_C.ExecuteUbergraph_TBP_UI_Quest_Objective_Notification_Item"); UTBP_UI_Quest_Objective_Notification_Item_C_ExecuteUbergraph_TBP_UI_Quest_Objective_Notification_Item_Params params; params.EntryPoint = EntryPoint; auto flags = fn->FunctionFlags; UObject::ProcessEvent(fn, &params); fn->FunctionFlags = flags; } } #ifdef _MSC_VER #pragma pack(pop) #endif

[ "69031575+leoireo@users.noreply.github.com" ]

69031575+leoireo@users.noreply.github.com

985ccc1b83815dad8fdd35a710ad2b7a858ef987

6cdd54e4a9f02b49f8bbc03a67a5722e33f66d52

/lab/3-4.cc

2cb2fdce2dae8d85df3755d80f4ba1efd804dfbe

[]

no_license

dr3w-an/oop-studies

17284e63f112d829377af9950d0cb1438da991bf

eb61168d6a1b411f8243daca52c79605fbc7f65f

refs/heads/master

2021-07-13T14:54:14.420686

2019-06-29T01:27:24

172,923,308

0

null

UTF-8

C++

false

1,562

cc

#include <iostream> #include <math.h> class Vector { public: double x, y; double abs() { return sqrt(pow(x, 2) + pow(y, 2)); } Vector add(Vector vector) { Vector result; result.x = x + vector.x; result.y = y + vector.y; return result; } Vector substract(Vector vector) { Vector result; result.x = x - vector.x; result.y = y - vector.y; return result; } }; int main() { Vector first_vector; std::cout << "Введите абсциссу первого вектора: "; std::cin >> first_vector.x; std::cout << "Введите ординату первого вектора: "; std::cin >> first_vector.y; Vector second_vector; std::cout << "Введите абсциссу второго вектора: "; std::cin >> second_vector.x; std::cout << "Введите ординату второго вектора: "; std::cin >> second_vector.y; Vector sum = first_vector.add(second_vector); Vector dif = first_vector.substract(second_vector); std::cout << "Модуль первого вектора: " << first_vector.abs() << '\n' << "Модуль второго вектора: " << second_vector.abs() << '\n' << "Сумма векторов: (" << sum.x << ", " << sum.y << ")\n" << "Разность векторов: (" << dif.x << ", " << dif.y << ')' << std::endl; return 0; }

[ "dr3w.an@yandex.ru" ]

dr3w.an@yandex.ru

a12d7911d81f783de4df4204b3938ce06c3704d3

7044c0e66ed48d47dae188c2a2ab22ee6fd63ec3

/src/Player.hpp

91f04205af7da521e08bf7cf4c126239e49c3e46

[]

no_license

fatumlegion/pelly

dba73fd20d9e92ddece6195364a7c31ed93b7285

f4c51b79e3478648f4d91d7e6242174afff62d36

refs/heads/master

2016-08-04T20:32:35.147345

2013-08-21T01:30:37

null

0

null

UTF-8

C++

false

546

hpp

#ifndef PLAYER_HPP #define PLAYER_HPP #include <SFML/Graphics.hpp> #include "Block.hpp" class Player { private: sf::Sprite self; bool right, left, moving, canJump, revGrav, canRotate, inRotation; sf::Vector2f pos; float xs, fric, grav, currentRotation, targetRotation; sf::FloatRect box; public: Player(sf::Texture &txtr); ~Player(); void input(sf::Event &event); void draw(sf::RenderWindow &rwin, float interp); void update(float dt); void touchBlock(Block &b); sf::Vector2f getPosition() { return self.getPosition(); } }; #endif

[ "fatumlegion@gmail.com" ]

fatumlegion@gmail.com

0c9bc57859f194698df7543260efaf70cf289d54

e4df4dd3c33ecb4b04b433330c0dbe3fcf7c5c4e

/AStar/UI/UIManager.h

7f2d9619ba686a9cc47128bc164d000e201fdabd

[]

no_license

soelusoelu/AStar

0b0d9dc0021c940b45bc36d04c858f86c7b134a4

c8006ecf0e6c54340f1a9586ad43bf80c8973047

refs/heads/master

2020-11-24T07:51:06.623562

2019-12-14T14:43:28

228,038,146

0

null

UTF-8

C++

false

512

h

#pragma once #include "../Utility/IManager.h" #include <list> #include <memory> class UI; class UIManager : public IManager<UI> { public: UIManager(); ~UIManager(); virtual void update() override; virtual void draw() const override; void add(UI* add); virtual void remove() override; virtual void clear() override; private: UIManager(const UIManager&) = delete; UIManager& operator=(const UIManager&) = delete; private: std::list<std::unique_ptr<UI>> mUIStack; };

[ "llmn.0419@gmail.com" ]

llmn.0419@gmail.com

2ece42c1d4ae91578b1e5312f9a8ff8b3ffc9856

d3289431cb91bcb55edefee17ab4168a80392cef

/Minos/Game/InputReplay.h

0de6cd75a0c46d777bfb7a3d85fe99d63f1151f4

[]

no_license

Sumez/Minos

fd6071f6f5fcf46d9418f4961e9b0cb9275970f2

f7584657856b28388a41a68a6c62c5ac002521e1

refs/heads/master

2021-01-19T05:29:38.606819

2016-07-05T13:58:45

61,880,163

0

null

UTF-8

C++

false

845

h

#pragma once #include <inttypes.h> #include "../InputHandler.h" class InputReplay : public InputHandler { public: InputReplay(std::vector<int>& recording); virtual Coords GetMouseCoords(); virtual bool IsHolding(ControlButton button); virtual bool JustPressed(ControlButton button); virtual bool WasMouseButtonClicked(MouseButton button); virtual bool IsMouseButtonHeld(MouseButton button); virtual void BindControl(ControlButton button); virtual void CancelBind(); virtual bool IsWaitingForBind(ControlButton button) { return false; } virtual std::string GetInputFor(ControlButton button); virtual void AdvanceFrame(); virtual void BeginRecording(); virtual std::vector<int>& GetRecording() { return _recording; }; private: void ProcessInput(); uint64_t _pointer = 0; uint64_t _frame = 0; std::vector<int>& _recording; };

[ "morten@eternal.dk" ]

morten@eternal.dk

5037069d4dc20035675ca6de3d82c9ae48dfe2b9

94e5a9e157d3520374d95c43fe6fec97f1fc3c9b

/@DOC by DIPTA/dipta007_final/Max-flow/sgtlaugh-mincost-maxflow(Dijkstra+Potentials).cpp

8f67f28fd32f68b1cfad3425cc05e0b5eb0fb158

[ "MIT" ]

permissive

dipta007/Competitive-Programming

0127c550ad523884a84eb3ea333d08de8b4ba528

998d47f08984703c5b415b98365ddbc84ad289c4

refs/heads/master

2021-01-21T14:06:40.082553

2020-07-06T17:40:46

54,851,014

8

4

null

2020-05-02T13:14:41

2016-03-27T22:30:02

C++

UTF-8

C++

false

2,864

cpp

#include <stdio.h> #include <bits/stdtr1c++.h> #define MAX 200010 /// 2 * max(nodes, edges) #define clr(ar) memset(ar, 0, sizeof(ar)) #define read() freopen("lol.txt", "r", stdin) #define dbg(x) cout << #x << " = " << x << endl #define ran(a, b) ((((rand() << 15) ^ rand()) % ((b) - (a) + 1)) + (a)) using namespace std; /// Min-cost Max-flow using dijkstra with potentials /// 0 Based indexed for directed weighted graphs (for undirected graphs, just add two directed edges) /// Runs in around 2 seconds when n <= 200 and m = n * (n - 1) / 2 /// Runs well for sparse graphs though, e.g, m <= 10 * n /// Costs must be non-negative namespace mcmf{ const long long INF = 1LL << 60; long long potential[MAX], dis[MAX], cap[MAX], cost[MAX]; int n, m, s, t, to[MAX], from[MAX], last[MAX], next[MAX], adj[MAX]; struct compare{ inline bool operator()(int a, int b){ if (dis[a] == dis[b]) return (a < b); return (dis[a] < dis[b]); } }; set<int, compare> S; void init(int nodes, int source, int sink){ m = 0, n = nodes; s = source, t = sink; for (int i = 0; i <= n; i++) potential[i] = 0, last[i] = -1; } /// u -> v, capacity, cost void addEdge(int u, int v, long long c, long long w){ from[m] = u, adj[m] = v, cap[m] = c, cost[m] = w, next[m] = last[u], last[u] = m++; from[m] = v, adj[m] = u, cap[m] = 0, cost[m] = -w, next[m] = last[v], last[v] = m++; } pair<long long, long long> solve(){ int i, j, e, u, v; long long w, aug = 0, mincost = 0, maxflow = 0; while (1){ S.clear(); for (i = 0; i < n; i++) dis[i] = INF; dis[s] = 0, S.insert(s); while (!S.empty()){ u = *(S.begin()); if (u == t) break; S.erase(S.begin()); for (e = last[u]; e != -1; e = next[e]){ if (cap[e] != 0){ v = adj[e]; w = dis[u] + potential[u] + cost[e] - potential[v]; if (dis[v] > w){ S.erase(v); dis[v] = w, to[v] = e; S.insert(v); } } } } if (dis[t] >= (INF >> 1)) break; aug = cap[to[t]]; for (i = t; i != s; i = from[to[i]]) aug = min(aug, cap[to[i]]); for (i = t; i != s; i = from[to[i]]){ cap[to[i]] -= aug; cap[to[i] ^ 1] += aug; mincost += (cost[to[i]] * aug); } for (i = 0; i <= n; i++) potential[i] = min(potential[i] + dis[i], INF); maxflow += aug; } return make_pair(mincost, maxflow); } } int main(){ }

[ "iamdipta@gmail.com" ]

iamdipta@gmail.com

64178d56059f9b8209762d8ceeec9448faedb734

0b6aa7ce3ea19c3f7fcac64daa9857ef4e13d6fd

/cncState.hh

40e3c5b027f1580bcacd21817423683ebd65945f

[]

no_license

lumpyh/LHCNC

23b2903cd10a516684b631b606febfbcdb605414

42ea14ef5dce4a4593afe171b449433c837ab1e0

refs/heads/master

2020-12-12T13:59:27.599846

2016-11-26T20:57:47

51,971,694

0

null

UTF-8

C++

false

479

hh

#ifndef CNCSTATE_HH #define CNCSTATE_HH #include "point.hh" class cncState{ public: cncState(); bool isAbsolute(); bool isInMill(); int getStepsPerMill(); const point<int>& getStepPos(); const point<double>& getPos(); void setAbsolute( bool); void setInMill( bool); void setStepPos( int, int, int); void setPos( double, double, double); private: bool absolute; bool inMill; int stepsPerMill; point<int> stepPos; point<double> pos; }; #endif

[ "lumpy.hega@gmx.de" ]

lumpy.hega@gmx.de

1918cb6291fd4e38dcf6cf0851e449b0e53543f4

5740ea2c2d9d5fb5626ff5ad651f3789048ae86b

/PlasmaLibraries/Serialization/OldDataTreeParser.hpp

0380bdab33ccf0345749d098d5a43b997159bd44

[ "MIT" ]

permissive

donovan680/Plasma

4945b92b7c6e642a557f12e05c7d53819186de55

51d40ef0669b7a3015f95e3c84c6d639d5469b62

refs/heads/master

2022-04-15T02:42:26.469268

2020-02-26T22:32:12

null

0

null

UTF-8

C++

false

1,936

hpp

//////////////////////////////////////////////////////////////////////////////////////////////////// /// /// Authors: Joshua Claeys /// Copyright 2016, DigiPen Institute of Technology /// //////////////////////////////////////////////////////////////////////////////////////////////////// #pragma once namespace Plasma { class DataNode; struct DataTreeContext; //------------------------------------------------------------ Data Tree Grammar class DataTreeGrammar { public: static DataTreeGrammar& GetInstance(); DataTreeGrammar(); // Tokenizer GrammarSet<Character> mTokenGrammar; GrammarRule<Character>* mTokenStart; GrammarRule<Character>* mEnum; GrammarRule<Character>* mIdentifier; GrammarRule<Character>* mFloat; GrammarRule<Character>* mInteger; GrammarRule<Character>* mHex; GrammarRule<Character>* mWhitespace; GrammarRule<Character>* mStringLiteral; GrammarRule<Character>* mTrue; GrammarRule<Character>* mFalse; GrammarRule<Character>* mVar; // Parser GrammarSet<Token> mParserGrammar; GrammarRule<Token>* mParserStart; GrammarRule<Token>* mObject; GrammarRule<Token>* mAttribute; GrammarRule<Token>* mProperty; GrammarRule<Token>* mValue; }; //------------------------------------------------------------- Data Tree Parser class OldDataTreeParser { public: static DataNode* BuildTree(DataTreeContext& context, StringRange data); OldDataTreeParser(); /// Parser template interface. void StartRule(GrammarRule<Token>* rule); void EndRule(ParseNodeInfo<Token>* info); void TokenParsed(ParseNodeInfo<Token>* info) {} void StartParsing() {} void EndParsing() {} /// Set all flags on nodes based on the read in attributes. void PostProcessAttributes(DataNode* node); bool mOpenedProperty; bool mAttributeStarted; Array<DataNode*> mNodeStack; bool mPropertyObject; DataTreeContext* mContext; DataNode* mLastEndedNode; }; }//namespace Plasma

[ "dragonCASTjosh@gmail.com" ]

dragonCASTjosh@gmail.com

762fb49da685c868d046e7de42cd53aefce10d80

814fd0bea5bc063a4e34ebdd0a5597c9ff67532b

/content/child/web_gesture_curve_impl.cc

da8a18cecaf9e1b34016c612f07ac35af0ac53a1

[ "BSD-3-Clause" ]

permissive

rzr/chromium-crosswalk

1b22208ff556d69c009ad292bc17dca3fe15c493

d391344809adf7b4f39764ac0e15c378169b805f

refs/heads/master

2021-01-21T09:11:07.316526

2015-02-16T11:52:21

38,887,985

0

NOASSERTION

2019-08-07T21:59:20

2015-07-10T15:35:50

C++

UTF-8

C++

false

4,749

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/child/web_gesture_curve_impl.h" #include "base/logging.h" #include "base/metrics/histogram.h" #include "third_party/WebKit/public/platform/WebFloatSize.h" #include "third_party/WebKit/public/platform/WebGestureCurveTarget.h" #include "ui/events/gestures/fling_curve.h" #include "ui/gfx/geometry/safe_integer_conversions.h" #include "ui/gfx/geometry/vector2d.h" #if defined(OS_ANDROID) #include "ui/events/android/scroller.h" #endif using blink::WebGestureCurve; namespace content { namespace { scoped_ptr<ui::GestureCurve> CreateDefaultPlatformCurve( const gfx::Vector2dF& initial_velocity) { DCHECK(!initial_velocity.IsZero()); #if defined(OS_ANDROID) auto scroller = make_scoped_ptr(new ui::Scroller(ui::Scroller::Config())); scroller->Fling(0, 0, initial_velocity.x(), initial_velocity.y(), INT_MIN, INT_MAX, INT_MIN, INT_MAX, base::TimeTicks()); return scroller.Pass(); #else return make_scoped_ptr( new ui::FlingCurve(initial_velocity, base::TimeTicks())); #endif } } // namespace // static scoped_ptr<WebGestureCurve> WebGestureCurveImpl::CreateFromDefaultPlatformCurve( const gfx::Vector2dF& initial_velocity, const gfx::Vector2dF& initial_offset, bool on_main_thread) { return scoped_ptr<WebGestureCurve>(new WebGestureCurveImpl( CreateDefaultPlatformCurve(initial_velocity), initial_offset, on_main_thread ? ThreadType::MAIN : ThreadType::IMPL)); } // static scoped_ptr<WebGestureCurve> WebGestureCurveImpl::CreateFromUICurveForTesting( scoped_ptr<ui::GestureCurve> curve, const gfx::Vector2dF& initial_offset) { return scoped_ptr<WebGestureCurve>( new WebGestureCurveImpl(curve.Pass(), initial_offset, ThreadType::TEST)); } WebGestureCurveImpl::WebGestureCurveImpl(scoped_ptr<ui::GestureCurve> curve, const gfx::Vector2dF& initial_offset, ThreadType animating_thread_type) : curve_(curve.Pass()), last_offset_(initial_offset), animating_thread_type_(animating_thread_type), ticks_since_first_animate_(0), first_animate_time_(0), last_animate_time_(0) { } WebGestureCurveImpl::~WebGestureCurveImpl() { if (ticks_since_first_animate_ <= 1) return; if (last_animate_time_ <= first_animate_time_) return; switch (animating_thread_type_) { case ThreadType::MAIN: UMA_HISTOGRAM_CUSTOM_COUNTS( "Event.Frequency.Renderer.FlingAnimate", gfx::ToRoundedInt(ticks_since_first_animate_ / (last_animate_time_ - first_animate_time_)), 1, 240, 120); break; case ThreadType::IMPL: UMA_HISTOGRAM_CUSTOM_COUNTS( "Event.Frequency.RendererImpl.FlingAnimate", gfx::ToRoundedInt(ticks_since_first_animate_ / (last_animate_time_ - first_animate_time_)), 1, 240, 120); break; case ThreadType::TEST: break; } } bool WebGestureCurveImpl::apply(double time, blink::WebGestureCurveTarget* target) { // If the fling has yet to start, simply return and report true to prevent // fling termination. if (time <= 0) return true; if (!first_animate_time_) { first_animate_time_ = last_animate_time_ = time; } else if (time != last_animate_time_) { // Animation can occur multiple times a frame, but with the same timestamp. // Suppress recording of such redundant animate calls, avoiding artificially // inflated FPS computation. last_animate_time_ = time; ++ticks_since_first_animate_; } const base::TimeTicks time_ticks = base::TimeTicks() + base::TimeDelta::FromSecondsD(time); gfx::Vector2dF offset, velocity; bool still_active = curve_->ComputeScrollOffset(time_ticks, &offset, &velocity); gfx::Vector2dF delta = offset - last_offset_; last_offset_ = offset; // As successive timestamps can be arbitrarily close (but monotonic!), don't // assume that a zero delta means the curve has terminated. if (delta.IsZero()) return still_active; // scrollBy() could delete this curve if the animation is over, so don't touch // any member variables after making that call. bool did_scroll = target->scrollBy(blink::WebFloatSize(delta), blink::WebFloatSize(velocity)); return did_scroll && still_active; } } // namespace content

[ "commit-bot@chromium.org" ]

commit-bot@chromium.org

ae76c86104e09c1716c05e48629c8e1993b56730

c4f3d6aaeecda81b20b9ce3e90aa49459b4b7bbc

/Renderer.cpp

90b9d2cbd8fadf63521a7a4a79b390f799441467

[]

no_license

jcohen1964/MadCow

f030a37d78cd76528116569637c19d12a38cecdd

ae7abf926e15436d398e63d164d1d2cce79e2969

refs/heads/master

2020-03-22T10:22:49.348843

2018-07-05T21:16:58

139,898,542

0

null

UTF-8

C++

false

5,665

cpp

#include "renderer.h" #include "Random.h" #include "reporter.h" #include "util.h" #include "Meal.h" #include "MealGroup.h" using std::cerr; using std::endl; // Probability that a P meal pkt will contaminate an NP pkt at a mixed producer plant double Renderer::probContamination; // Table with 2 entries -- 1) render reduction factor, and 2) probability that rendering // will achieve reduction factor specified by (1) FunctDistrDisc<int, double> Renderer::renderFactor; // Table with 2 entries -- 1) Type of renderer, and 2) probability that animal remains // will be sent to a renderer of type in (1) FunctTable<Meal::ProducerType, double> Renderer::probType; FunctTable<Meal::ProducerType, double> Renderer::probMisLabel; double Renderer::fracContaminate; Renderer::Renderer() {} //Receives a vector of organs (i.e., the carcas) and returns a mealGroup //Infectivity ends up in P MBM, NP MBM, and in BLOOD MealGroup Renderer::process(std::vector<Organ>& organs) { double thisRenderFactor; //Holds renderFactor value; MealGroup result; //List of meal objects; Meal mealBlood; //meal packet for blood meal Meal mealP; //meal packet for prohibited MBM Meal mealNP; //meal packet for non-prohibited MBM Meal contaminatedMeal; //NP meal packet containing contamination from P MBM Meal mislabeledMeal; //NP meal packet containing mislabeled P MBM Meal::ProducerType producer; //meal producer type Random& generator = *(Random::instance()); //Alias random number singleton //Designate the material type; mealBlood.material = Meal::BLOOD; mealP.material = Meal::P_MBM; mealNP.material = Meal::NP_MBM; contaminatedMeal.material = Meal::NP_MBM; mislabeledMeal.material = Meal::NP_MBM; //Choose the meal producerType double unif = generator.nextFloat(); if(unif <= probType(Meal::P_MBM_PRODUCER)) { producer = Meal::P_MBM_PRODUCER; } else if(unif <= probType(Meal::P_MBM_PRODUCER) + probType(Meal::NP_MBM_PRODUCER)) { producer = Meal::NP_MBM_PRODUCER; } else { producer = Meal::MIXED_MBM_PRODUCER; } //If there is any infectivity in blood, and if the blood is not going to human //consumption, then copy blood info into meal packet. if(organs[Organ::BLOOD].ID50 > 0 && !organs[Organ::BLOOD].forHumanFood) { mealBlood.destination = Meal::BLOOD_PRODUCER; mealBlood.id50 = organs[Organ::BLOOD].ID50; organs[Organ::BLOOD].ID50 = 0; } //If not chosen for food then add organs to P_MBM mealP.id50 = 0; //Initialize id50 field to zero for(int i = 0; i < Organ::END_TYPE; ++i) { if(!organs[i].forHumanFood) { mealP.id50 += organs[i].ID50; organs[i].ID50 = 0; } } //Apply render factor thisRenderFactor = renderFactor(0); //0 is dummy argument; Reporter::instance()->reportid50Track(Reporter::ID50_RENDER, mealP.id50 * (thisRenderFactor-1) / thisRenderFactor); mealP.id50 /= thisRenderFactor; //If mislabelling occurs, move infectivity to mislabeledMeal. //Note -- the mislabel probability should be set to 1.0 for the NP MBM producer if(generator.nextFloat() <= probMisLabel(producer)) { mislabeledMeal.id50 = mealP.id50; mealP.id50 = 0; } //If contamination occurs, NP MBM gets some of the P MBM infectivity. if(producer == Meal::MIXED_MBM_PRODUCER && generator.nextFloat() <= probContamination ) { double deltaContamination = Renderer::fracContaminate*mealP.id50; mealP.id50 -= deltaContamination; contaminatedMeal.id50 = deltaContamination; } //Add to MealGroup list those meal packets with non-zero id50 values if(mealBlood.id50>0) { mealBlood.producer = producer; result.addMeal(mealBlood); } if(mealP.id50>0) { mealP.producer = producer; result.addMeal(mealP); Reporter::instance()->reportid50Track(Reporter::ID50_P_MBM, mealP.id50); } if(mealNP.id50>0) { mealNP.producer = producer; result.addMeal(mealNP); Reporter::instance()->reportid50Track(Reporter::ID50_NP_MBM, mealNP.id50); } if(mislabeledMeal.id50>0) { mislabeledMeal.producer = producer; result.addMeal(mislabeledMeal); Reporter::instance()->reportid50Track(Reporter::ID50_MISLABEL_P_MBM, mislabeledMeal.id50); } if(contaminatedMeal.id50>0) { contaminatedMeal.producer = producer; result.addMeal(contaminatedMeal); Reporter::instance()->reportid50Track(Reporter::ID50_CONTAM_NP_MBM, contaminatedMeal.id50); } return result; }; // error function utility void Renderer::readError() { cerr << "Error reading Renderer data" << endl; exit(0); } //input function from data stream istream& operator>> (istream& stream, Renderer& me) { string word; char dump[256]; stream >> word; while((word != "</renderer>") && !stream.eof()) { if(word == "<renderFactor>") stream >> me.renderFactor >> word; else if(word == "<probContamination>") stream >> me.probContamination >> word; else if(word == "<probType>") stream.getline(dump, 256).getline(dump, 256) >> me.probType >> word; else if(word == "<probMisLabel>") stream.getline(dump, 256).getline(dump, 256) >> me.probMisLabel >> word; else if(word == "<fracContaminate>") stream >> me.fracContaminate >> word; else Renderer::readError(); stream >> word; } if(word != "</renderer>") Renderer::readError(); return stream; }

[ "noreply@github.com" ]

jcohen1964.noreply@github.com

93706c34197a3eee316994c0147cc89074f20c82

67d0fb30fb385791af1d6a0ae6187ef0a7991eff

/ABC037/a.cpp

4d6b058fb5128a6cab04c80f48aed4e346e801af

[]

no_license

misogi/atcoder

a5e4b221747bdcae8c32b9f1f59bebf065200285

d9dff5905bfcfae6113ccfbe710a2dee88906d9f

refs/heads/master

2021-01-19T03:47:21.139037

2017-02-21T09:24:36

48,310,921

0

null

UTF-8

C++

false

229

cpp

#include <iostream> #include <vector> using namespace std; int main() { int a, b, mo; cin >> a >> b >> mo; int num; if (a < b) { num = mo / a; } else { num = mo / b; } cout << num << endl; return 0; }

[ "dev@misogi.info" ]

dev@misogi.info

60e7c05aae2ea42de0784b4a01bf6f963068cd7f

5370b9e27da3064f35a59610b7746a263204e621

/CodeChef/PINS.cpp

8817a49e77831117b79a1d689a5377d353916007

[]

no_license

Paryul10/Competetive-Coding

4619d84b282d58303dc5db9cb8bdad769fc3176d

3cc06f80dfffe4dc742fd5d8a4b427a9de778d85

refs/heads/master

2020-04-02T11:12:49.838056

2018-08-02T11:36:04

154,376,787

0

1

null

2019-10-19T12:00:45

2018-10-23T18:22:09

C++

UTF-8

C++

false

276

cpp

#include "bits/stdc++.h" using namespace std; int main() { int t; cin >> t; while (t--) { int n; cin >> n; cout << "1 "; cout << "1"; for (int i=1; i<=(n/2); i++) cout << "0"; cout << endl; } return 0; }

[ "eeshadutta99@gmail.com" ]

eeshadutta99@gmail.com

4ee9971c1889457b7af52d00f74d25fe3d3dbebe

bba8ad0d783119c7d9a413b4ead7654ed074fc2a

/Volume116/11624 - Fire.cpp

0da7714b75d9c8c01677c9a2addd5d69115b72d9

[]

no_license

m00p1ng/UVa-problem

08d1298225a7d2bffef3e99ff33fd2f940d7924c

9517304685e6681e7027335dbbea20f643d5fc37

refs/heads/master

2023-04-04T10:51:12.141260

2021-04-16T23:08:27

81,700,393

0

null

UTF-8

C++

false

2,535

cpp

#include <cstdio> #include <cstring> #include <queue> using namespace std; int r, c; int si, sj; char board[1010][1010]; bool visited[1010][1010]; int fire[1010][1010]; int dr[] = {1, -1, 0, 0}; int dc[] = {0, 0, -1, 1}; typedef pair<int, int> ii; typedef pair<int, ii> iii; bool is_valid(int i, int j, int d) { return i >= 0 && j >= 0 && i < r && j < c && board[i][j] != '#' && fire[i][j] > d+1; } bool is_bound(int i, int j) { return i == 0 || j == 0 || i == r-1 || j == c-1; } void fire_connected() { queue<iii> q; for(int i = 0; i < r; i++) { for(int j = 0; j < c; j++) { if(fire[i][j] == 0) { q.push(iii(0, ii(i, j))); } } } int ni, nj; while(!q.empty()) { iii v = q.front(); q.pop(); ii p = v.second; for(int d = 0; d < 4; d++) { ni = p.first + dr[d]; nj = p.second + dc[d]; if(is_valid(ni, nj, v.first)) { fire[ni][nj] = v.first+1; q.push(iii(v.first+1, ii(ni, nj))); } } } } int bfs_joe(int i, int j) { queue<iii> q; q.push(iii(0, ii(i, j))); int cnt = 0, ni, nj; while(!q.empty()) { iii v = q.front(); q.pop(); ii p = v.second; if(is_bound(p.first, p.second)) { return v.first+1; } visited[p.first][p.second] = true; for(int d = 0; d < 4; d++) { ni = p.first + dr[d]; nj = p.second + dc[d]; if(is_valid(ni, nj, v.first) && !visited[ni][nj]) { q.push(iii(v.first+1, ii(ni, nj))); } } } return -1; } void input_board() { for(int i = 0; i < r; i++) { for(int j = 0; j < c; j++) { fire[i][j] = 1<<20; } } for(int i = 0; i < r; i++) { scanf("%s", board[i]); for(int j = 0; j < c; j++) { if(board[i][j] == 'J') { si = i; sj = j; board[i][j] = '.'; } if(board[i][j] == 'F') { fire[i][j] = 0; board[i][j] = '.'; } } } } int main() { int ts; scanf("%d", &ts); while(ts--) { scanf("%d %d", &r, &c); memset(visited, 0, sizeof(visited)); memset(fire, 0, sizeof(fire)); input_board(); fire_connected(); int b = bfs_joe(si, sj); if(b == -1) puts("IMPOSSIBLE"); else printf("%d\n", b); } }

[ "mongkonchai4412@gmail.com" ]

mongkonchai4412@gmail.com

7c1a8fd4b87291dacd3c2d9f51ad8a892d881ac8

e3f9ab83c0e3c8722920f8850fb295551682a969

/src/display/old/draw_grid/draw_grid.ino

92435cdf292e599460c0313c3c10e50fed2cd885

[]

no_license

wizard97/3400_team5electricboogaloo

8e80f05fa81dce8f05c1c598345e914887d000ea

a0d507ce57b8b13943eb6ec80e2ceb3d13774cbd

refs/heads/master

2021-01-20T12:11:07.339947

2018-06-05T22:12:50

101,703,482

1

5

null

2017-09-26T03:43:54

2017-08-29T01:15:12

Arduino

UTF-8

C++

false

2,567

ino

#include <SPI.h> #include <VGAGraphics.h> #define VGA_SS 10 #define XRES 240 #define YRES 240 // define pins for buttons to move block arround #define BUTTON_UP 3 #define BUTTON_DOWN 4 #define BUTTON_LEFT 5 #define BUTTON_RIGHT 6 #define BLOCK_COLOR (genColor(7,0,0)) void clearScreen(uint8_t color=0); uint8_t genColor(uint8_t r, uint8_t g, uint8_t b); void writePixel(uint8_t x, uint8_t y, uint8_t color); void setup() { Serial.begin(115200); // set the slaveSelectPin as an output: //pinMode(VGA_SS, OUTPUT); DDRB |= B00000100; //set slave select output //digitalWrite(VGA_SS, HIGH); PORTB |= B00000100; // Set it high // initialize SPI: SPI.begin(); SPI.setClockDivider(SPI_CLOCK_DIV2); //faster 8mhz //init buttons, configure pull up /* digitalWrite(BUTTON_UP, HIGH); digitalWrite(BUTTON_DOWN, HIGH); digitalWrite(BUTTON_LEFT, HIGH); digitalWrite(BUTTON_RIGHT, HIGH); */ pinMode(BUTTON_UP, INPUT); pinMode(BUTTON_DOWN, INPUT); pinMode(BUTTON_LEFT, INPUT); pinMode(BUTTON_RIGHT, INPUT); clearScreen(); } //64-36- //64-48=16 void loop() { /* for (uint8_t i=0; i <= 5; i++) { for (uint8_t j=10; j < 120; j++) writePixel(10+20*i, j, 0xff); } for (uint8_t i=0; i <= 4; i++) { for (uint8_t j=0; j < 120; j++) writePixel(j, 20+20*i, 0xff); } */ /* for (uint8_t i=0; i <= 5; i++) { for (uint8_t j=0; j < 120; j++) writePixel(10+20*i, j, 0xff); } */ /* writePixel(0, 0, 0xff); writePixel(119, 0, 0xff); writePixel(0, 119, 0xff); writePixel(119, 119, 0xff); */ randScreen(); //clearScreen(); delay(2000); clearScreen(); delay(2000); } /* Use this to write to FPGA vga driver * x cord: [0:63] * y cord: [0:63] * color: Red: color[7:5], Green: color[4:2], Blue: blue[1:0] */ void writePixel(uint8_t x, uint8_t y, uint8_t color) { if (x >= XRES || y >= YRES) return; //digitalWrite(VGA_SS, LOW); PORTB &= ~B00000100; // This is faster! uint8_t data[] = {x, y, color}; SPI.transfer(data, 3); //digitalWrite(VGA_SS, HIGH); PORTB |= B00000100; } void clearScreen(uint8_t color) { for (uint8_t i=0; i < XRES; i++) { for (uint8_t j=0; j < YRES; j++) { writePixel(i, j, color); } } } void randScreen() { for (uint8_t i=0; i < XRES; i++) { for (uint8_t j=0; j < YRES; j++) { writePixel(i, j, random(0, 255)); } } } // r: [0,7], g: [0,7], b: [0,3] uint8_t genColor(uint8_t r, uint8_t g, uint8_t b) { r &= 0b111; g &= 0b111; b &= 0b11; return (r << 5) | (g << 2) | b; }

[ "daw268@cornell.edu" ]

daw268@cornell.edu

634430ac808278d348753fe694518e2b6efb7068

2cf838b54b556987cfc49f42935f8aa7563ea1f4

/aws-cpp-sdk-ivs/include/aws/ivs/model/UpdateChannelRequest.h

88dfe35dd3bd32d7a765824490d3816354b97eac

[ "MIT", "Apache-2.0", "JSON" ]

permissive

QPC-database/aws-sdk-cpp

d11e9f0ff6958c64e793c87a49f1e034813dac32

9f83105f7e07fe04380232981ab073c247d6fc85

refs/heads/main

2023-06-14T17:41:04.817304

2021-07-09T20:28:20

384,714,703

1

0

Apache-2.0

2021-07-10T14:16:41

null

UTF-8

C++

false

15,290

h

/** * Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved. * SPDX-License-Identifier: Apache-2.0. */ #pragma once #include <aws/ivs/IVS_EXPORTS.h> #include <aws/ivs/IVSRequest.h> #include <aws/core/utils/memory/stl/AWSString.h> #include <aws/ivs/model/ChannelLatencyMode.h> #include <aws/ivs/model/ChannelType.h> #include <utility> namespace Aws { namespace IVS { namespace Model { /** */ class AWS_IVS_API UpdateChannelRequest : public IVSRequest { public: UpdateChannelRequest(); // Service request name is the Operation name which will send this request out, // each operation should has unique request name, so that we can get operation's name from this request. // Note: this is not true for response, multiple operations may have the same response name, // so we can not get operation's name from response. inline virtual const char* GetServiceRequestName() const override { return "UpdateChannel"; } Aws::String SerializePayload() const override; /** * ARN of the channel to be updated. */ inline const Aws::String& GetArn() const{ return m_arn; } /** * ARN of the channel to be updated. */ inline bool ArnHasBeenSet() const { return m_arnHasBeenSet; } /** * ARN of the channel to be updated. */ inline void SetArn(const Aws::String& value) { m_arnHasBeenSet = true; m_arn = value; } /** * ARN of the channel to be updated. */ inline void SetArn(Aws::String&& value) { m_arnHasBeenSet = true; m_arn = std::move(value); } /** * ARN of the channel to be updated. */ inline void SetArn(const char* value) { m_arnHasBeenSet = true; m_arn.assign(value); } /** * ARN of the channel to be updated. */ inline UpdateChannelRequest& WithArn(const Aws::String& value) { SetArn(value); return *this;} /** * ARN of the channel to be updated. */ inline UpdateChannelRequest& WithArn(Aws::String&& value) { SetArn(std::move(value)); return *this;} /** * ARN of the channel to be updated. */ inline UpdateChannelRequest& WithArn(const char* value) { SetArn(value); return *this;} /** * Channel name. */ inline const Aws::String& GetName() const{ return m_name; } /** * Channel name. */ inline bool NameHasBeenSet() const { return m_nameHasBeenSet; } /** * Channel name. */ inline void SetName(const Aws::String& value) { m_nameHasBeenSet = true; m_name = value; } /** * Channel name. */ inline void SetName(Aws::String&& value) { m_nameHasBeenSet = true; m_name = std::move(value); } /** * Channel name. */ inline void SetName(const char* value) { m_nameHasBeenSet = true; m_name.assign(value); } /** * Channel name. */ inline UpdateChannelRequest& WithName(const Aws::String& value) { SetName(value); return *this;} /** * Channel name. */ inline UpdateChannelRequest& WithName(Aws::String&& value) { SetName(std::move(value)); return *this;} /** * Channel name. */ inline UpdateChannelRequest& WithName(const char* value) { SetName(value); return *this;} /** * Channel latency mode. Use <code>NORMAL</code> to broadcast and deliver live * video up to Full HD. Use <code>LOW</code> for near-real-time interaction with * viewers. (Note: In the Amazon IVS console, <code>LOW</code> and * <code>NORMAL</code> correspond to Ultra-low and Standard, respectively.) */ inline const ChannelLatencyMode& GetLatencyMode() const{ return m_latencyMode; } /** * Channel latency mode. Use <code>NORMAL</code> to broadcast and deliver live * video up to Full HD. Use <code>LOW</code> for near-real-time interaction with * viewers. (Note: In the Amazon IVS console, <code>LOW</code> and * <code>NORMAL</code> correspond to Ultra-low and Standard, respectively.) */ inline bool LatencyModeHasBeenSet() const { return m_latencyModeHasBeenSet; } /** * Channel latency mode. Use <code>NORMAL</code> to broadcast and deliver live * video up to Full HD. Use <code>LOW</code> for near-real-time interaction with * viewers. (Note: In the Amazon IVS console, <code>LOW</code> and * <code>NORMAL</code> correspond to Ultra-low and Standard, respectively.) */ inline void SetLatencyMode(const ChannelLatencyMode& value) { m_latencyModeHasBeenSet = true; m_latencyMode = value; } /** * Channel latency mode. Use <code>NORMAL</code> to broadcast and deliver live * video up to Full HD. Use <code>LOW</code> for near-real-time interaction with * viewers. (Note: In the Amazon IVS console, <code>LOW</code> and * <code>NORMAL</code> correspond to Ultra-low and Standard, respectively.) */ inline void SetLatencyMode(ChannelLatencyMode&& value) { m_latencyModeHasBeenSet = true; m_latencyMode = std::move(value); } /** * Channel latency mode. Use <code>NORMAL</code> to broadcast and deliver live * video up to Full HD. Use <code>LOW</code> for near-real-time interaction with * viewers. (Note: In the Amazon IVS console, <code>LOW</code> and * <code>NORMAL</code> correspond to Ultra-low and Standard, respectively.) */ inline UpdateChannelRequest& WithLatencyMode(const ChannelLatencyMode& value) { SetLatencyMode(value); return *this;} /** * Channel latency mode. Use <code>NORMAL</code> to broadcast and deliver live * video up to Full HD. Use <code>LOW</code> for near-real-time interaction with * viewers. (Note: In the Amazon IVS console, <code>LOW</code> and * <code>NORMAL</code> correspond to Ultra-low and Standard, respectively.) */ inline UpdateChannelRequest& WithLatencyMode(ChannelLatencyMode&& value) { SetLatencyMode(std::move(value)); return *this;} /** * Channel type, which determines the allowable resolution and bitrate. If * you exceed the allowable resolution or bitrate, the stream probably will * disconnect immediately. Valid values: <ul> <li> * <code>STANDARD</code>: Multiple qualities are generated from the original input, * to automatically give viewers the best experience for their devices and network * conditions. Vertical resolution can be up to 1080 and bitrate can be up to 8.5 * Mbps. </li> <li> <code>BASIC</code>: Amazon IVS delivers the original * input to viewers. The viewer’s video-quality choice is limited to the original * input. Vertical resolution can be up to 480 and bitrate can be up to 1.5 * Mbps. </li> </ul> */ inline const ChannelType& GetType() const{ return m_type; } /** * Channel type, which determines the allowable resolution and bitrate. If * you exceed the allowable resolution or bitrate, the stream probably will * disconnect immediately. Valid values: <ul> <li> * <code>STANDARD</code>: Multiple qualities are generated from the original input, * to automatically give viewers the best experience for their devices and network * conditions. Vertical resolution can be up to 1080 and bitrate can be up to 8.5 * Mbps. </li> <li> <code>BASIC</code>: Amazon IVS delivers the original * input to viewers. The viewer’s video-quality choice is limited to the original * input. Vertical resolution can be up to 480 and bitrate can be up to 1.5 * Mbps. </li> </ul> */ inline bool TypeHasBeenSet() const { return m_typeHasBeenSet; } /** * Channel type, which determines the allowable resolution and bitrate. If * you exceed the allowable resolution or bitrate, the stream probably will * disconnect immediately. Valid values: <ul> <li> * <code>STANDARD</code>: Multiple qualities are generated from the original input, * to automatically give viewers the best experience for their devices and network * conditions. Vertical resolution can be up to 1080 and bitrate can be up to 8.5 * Mbps. </li> <li> <code>BASIC</code>: Amazon IVS delivers the original * input to viewers. The viewer’s video-quality choice is limited to the original * input. Vertical resolution can be up to 480 and bitrate can be up to 1.5 * Mbps. </li> </ul> */ inline void SetType(const ChannelType& value) { m_typeHasBeenSet = true; m_type = value; } /** * Channel type, which determines the allowable resolution and bitrate. If * you exceed the allowable resolution or bitrate, the stream probably will * disconnect immediately. Valid values: <ul> <li> * <code>STANDARD</code>: Multiple qualities are generated from the original input, * to automatically give viewers the best experience for their devices and network * conditions. Vertical resolution can be up to 1080 and bitrate can be up to 8.5 * Mbps. </li> <li> <code>BASIC</code>: Amazon IVS delivers the original * input to viewers. The viewer’s video-quality choice is limited to the original * input. Vertical resolution can be up to 480 and bitrate can be up to 1.5 * Mbps. </li> </ul> */ inline void SetType(ChannelType&& value) { m_typeHasBeenSet = true; m_type = std::move(value); } /** * Channel type, which determines the allowable resolution and bitrate. If * you exceed the allowable resolution or bitrate, the stream probably will * disconnect immediately. Valid values: <ul> <li> * <code>STANDARD</code>: Multiple qualities are generated from the original input, * to automatically give viewers the best experience for their devices and network * conditions. Vertical resolution can be up to 1080 and bitrate can be up to 8.5 * Mbps. </li> <li> <code>BASIC</code>: Amazon IVS delivers the original * input to viewers. The viewer’s video-quality choice is limited to the original * input. Vertical resolution can be up to 480 and bitrate can be up to 1.5 * Mbps. </li> </ul> */ inline UpdateChannelRequest& WithType(const ChannelType& value) { SetType(value); return *this;} /** * Channel type, which determines the allowable resolution and bitrate. If * you exceed the allowable resolution or bitrate, the stream probably will * disconnect immediately. Valid values: <ul> <li> * <code>STANDARD</code>: Multiple qualities are generated from the original input, * to automatically give viewers the best experience for their devices and network * conditions. Vertical resolution can be up to 1080 and bitrate can be up to 8.5 * Mbps. </li> <li> <code>BASIC</code>: Amazon IVS delivers the original * input to viewers. The viewer’s video-quality choice is limited to the original * input. Vertical resolution can be up to 480 and bitrate can be up to 1.5 * Mbps. </li> </ul> */ inline UpdateChannelRequest& WithType(ChannelType&& value) { SetType(std::move(value)); return *this;} /** * Whether the channel is private (enabled for playback authorization). */ inline bool GetAuthorized() const{ return m_authorized; } /** * Whether the channel is private (enabled for playback authorization). */ inline bool AuthorizedHasBeenSet() const { return m_authorizedHasBeenSet; } /** * Whether the channel is private (enabled for playback authorization). */ inline void SetAuthorized(bool value) { m_authorizedHasBeenSet = true; m_authorized = value; } /** * Whether the channel is private (enabled for playback authorization). */ inline UpdateChannelRequest& WithAuthorized(bool value) { SetAuthorized(value); return *this;} /** * Recording-configuration ARN. If this is set to an empty string, recording is * disabled. A value other than an empty string indicates that recording is * enabled */ inline const Aws::String& GetRecordingConfigurationArn() const{ return m_recordingConfigurationArn; } /** * Recording-configuration ARN. If this is set to an empty string, recording is * disabled. A value other than an empty string indicates that recording is * enabled */ inline bool RecordingConfigurationArnHasBeenSet() const { return m_recordingConfigurationArnHasBeenSet; } /** * Recording-configuration ARN. If this is set to an empty string, recording is * disabled. A value other than an empty string indicates that recording is * enabled */ inline void SetRecordingConfigurationArn(const Aws::String& value) { m_recordingConfigurationArnHasBeenSet = true; m_recordingConfigurationArn = value; } /** * Recording-configuration ARN. If this is set to an empty string, recording is * disabled. A value other than an empty string indicates that recording is * enabled */ inline void SetRecordingConfigurationArn(Aws::String&& value) { m_recordingConfigurationArnHasBeenSet = true; m_recordingConfigurationArn = std::move(value); } /** * Recording-configuration ARN. If this is set to an empty string, recording is * disabled. A value other than an empty string indicates that recording is * enabled */ inline void SetRecordingConfigurationArn(const char* value) { m_recordingConfigurationArnHasBeenSet = true; m_recordingConfigurationArn.assign(value); } /** * Recording-configuration ARN. If this is set to an empty string, recording is * disabled. A value other than an empty string indicates that recording is * enabled */ inline UpdateChannelRequest& WithRecordingConfigurationArn(const Aws::String& value) { SetRecordingConfigurationArn(value); return *this;} /** * Recording-configuration ARN. If this is set to an empty string, recording is * disabled. A value other than an empty string indicates that recording is * enabled */ inline UpdateChannelRequest& WithRecordingConfigurationArn(Aws::String&& value) { SetRecordingConfigurationArn(std::move(value)); return *this;} /** * Recording-configuration ARN. If this is set to an empty string, recording is * disabled. A value other than an empty string indicates that recording is * enabled */ inline UpdateChannelRequest& WithRecordingConfigurationArn(const char* value) { SetRecordingConfigurationArn(value); return *this;} private: Aws::String m_arn; bool m_arnHasBeenSet; Aws::String m_name; bool m_nameHasBeenSet; ChannelLatencyMode m_latencyMode; bool m_latencyModeHasBeenSet; ChannelType m_type; bool m_typeHasBeenSet; bool m_authorized; bool m_authorizedHasBeenSet; Aws::String m_recordingConfigurationArn; bool m_recordingConfigurationArnHasBeenSet; }; } // namespace Model } // namespace IVS } // namespace Aws

[ "aws-sdk-cpp-automation@github.com" ]

aws-sdk-cpp-automation@github.com

22e6d2846ed6bcd8b03f459713a13d189e46ec41

ccfe4094847ca44b9cd3e2b747964b1063132355

/C++/hw5_10.cpp

73b9f9320ef4f407e04bde517115443bba60369f

[]

no_license

dils12001/C_Practice

53fdee47a17e0c0e69ff01318cdd727fa2dab291

c80d6698c048eb03dfef0bf52b5f1faaaaf26272

refs/heads/master

2023-08-01T00:13:16.521740

2021-09-04T11:23:14

403,036,972

0

null

UTF-8

C++

false

479

cpp

#include <iostream> int main() { using namespace std; cout << "Enter number of rows: "; int num; cin >> num; for(int row = 1;row <= num;row++) { for(int col = 1;col <= num;col++) { if(col == num) cout << "*\n"; else if(col > (num-row)) cout << "*"; else cout << "."; } } cout << "\n\n\n"; for(int i = 0;i < num;i++) { int j = 0; for(;j < (num-i-1);j++) cout << "."; for(;j < num;j++) cout << "*"; cout << "\n"; } }

[ "dils210293@gmail.com" ]

dils210293@gmail.com

3273c04a0879ed79906355ca1c57d94978013b59

94415be920d27a4e875e6f34a730edef398c8e24

/Chapter6/Chapter6/Game.h

1594c6527c04215dcc229b0fff4b843868ce54be

[ "BSD-3-Clause" ]

permissive

maato-origin/OpenGLPractice

d55a205fef582ebeebaf9e9eb7794350c2854e66

9769570f2d23ffbd857681752b5bd7dd10879507

refs/heads/master

2022-01-10T18:06:15.252712

2019-06-17T07:15:56

188,250,436

1

0

null

SHIFT_JIS

C++

false

879

h

#pragma once #include "SDL/SDL.h" #include <unordered_map> #include <string> #include <vector> #include "Math.h" class Game { public: Game(); bool Initialize(); void RunLoop(); void Shutdown(); void AddActor(class Actor* actor); void RemoveActor(class Actor* actor); void AddSprite(class SpriteComponent* sprite); void RemoveSprite(class SpriteComponent* sprite); class Renderer* GetRenderer() { return mRenderer; } private: void ProcessInput(); void UpdateGame(); void GenerateOutput(); void LoadData(); void UnloadData(); //ゲーム内の全てのアクター std::vector<class Actor*> mActors; //待ち状態のアクター std::vector<class Actor*> mPendingActors; class Renderer* mRenderer; Uint32 mTicksCount; bool mIsRunning; //アクターを更新中か追跡 bool mUpdatingActors; //ゲーム仕様 class CameraActor* mCameraActor; };

[ "t-khms@live.jp" ]

t-khms@live.jp

f8ebdcd583e02826bf8792a43ac0fed8546cb21b

6a79102592f6f1d4eb843b2f5c673899aba28a6d

/Classwork/Lecture06/Node.h

cf5d9687b63e02536452d5e72521a102723b4d5e

[]

no_license

saidou578/CS246-1

886b351e445eecc5e0185e7b490f7582a2f066b7

b9b47aa91557ad3c8a2ff9a6218c68adbda8d46f

refs/heads/master

2021-01-09T16:13:42.279033

2020-05-25T14:28:57

242,368,027

0

null

2020-02-22T15:51:39

null

UTF-8

C++

false

1,449

h

#ifndef NODE_H #define NODE_H #include <iostream> #include <string> #include <sstream> namespace ds { template <class T> class Node { private: T data; Node<T>* link; Node(const Node<T>& obj); Node& operator=(const Node<T>& rhs); public: Node() : Node(T(),NULL) {} Node(const T& data) : Node(data,NULL) {} Node(const T& data,Node<T>* link) : data(data), link(link) {} ~Node() {} T& GetData() {return data;} const T& GetData() const {return data;} Node<T>* GetLink() {return link;} const Node<T>* GetLink() const {return link;} void SetData(const T& data) {this->data = data;} void SetLink(Node<T>* link) {this->link = link;} std::string ToString() const { std::stringstream out; out << data; return out.str(); } friend std::ostream& operator<<(std::ostream& out,const Node<T>& obj) { out << obj.ToString(); return out; } }; template<typename T> void Clear(Node<T>*& root) { Node<T> *tmp; while(root != NULL) { tmp = root; root = root->GetLink(); delete tmp; tmp = NULL; } } template<typename T> Node<T>* Copy(Node<T>* root) { if(root == NULL) { return NULL; } Node<T> *head = new Node<T>(root->GetData()); Node<T> *tmp2 = head; Node<T> *tmp1 = root->GetLink(); while(tmp1 != NULL) { tmp2->SetLink(new Node<T>(tmp1->GetData())); tmp1 = tmp1->GetLink(); tmp2 = tmp2->GetLink(); } return head; } } #endif

[ "jermainereid@mec.science" ]

jermainereid@mec.science

0ea8bd89b0db2fe42a19fae9caeab7d7e8db3480

d4b18945429b19dcfe750b1100e8486d8429f185

/src/net/Socket.cpp

4db1ace240ace2231de0ecd8e7f08b2300ebd56a

[ "MIT" ]

permissive

Maltliquor/HttpServer

2f019cceb15304d5cffab615538615f4076e3786

b05825752d96e5a7331be30db7587478db9b3124

refs/heads/master

2022-12-12T06:29:20.139591

2020-09-02T02:18:26

250,186,233

0

null

UTF-8

C++

false

1,960

cpp

#include <netinet/in.h> #include <netinet/tcp.h> #include <stdio.h> // snprintf #include "src/net/InetAddress.h" #include "src/net/Socket.h" #include "src/net/SocketOp.h" using namespace serverlib; Socket::~Socket() { sockets::close(_sock_fd); } bool Socket::getTcpInfo(struct tcp_info* tcpi) const { socklen_t len = sizeof(*tcpi); bzero(tcpi, len); return ::getsockopt(_sock_fd, SOL_TCP, TCP_INFO, tcpi, &len) == 0; } void Socket::bindAddress(const InetAddress& addr) { sockets::bindOrDie(_sock_fd, addr.getSockAddr()); } void Socket::listen() { sockets::listenOrDie(_sock_fd); } int Socket::accept(InetAddress* peeraddr) { struct sockaddr_in6 addr; bzero(&addr, sizeof addr); int connfd = sockets::accept(_sock_fd, &addr); if (connfd >= 0) { peeraddr->setSockAddrInet6(addr); } return connfd; } void Socket::shutdownWrite() { sockets::shutdownWrite(_sock_fd); } void Socket::setTcpNoDelay(bool on) { int optval = on ? 1 : 0; ::setsockopt(_sock_fd, IPPROTO_TCP, TCP_NODELAY, &optval, static_cast<socklen_t>(sizeof optval)); // FIXME CHECK } void Socket::setReuseAddr(bool on) { int optval = on ? 1 : 0; ::setsockopt(_sock_fd, SOL_SOCKET, SO_REUSEADDR, &optval, static_cast<socklen_t>(sizeof optval)); // FIXME CHECK } void Socket::setReusePort(bool on) { #ifdef SO_REUSEPORT int optval = on ? 1 : 0; int ret = ::setsockopt(_sock_fd, SOL_SOCKET, SO_REUSEPORT, &optval, static_cast<socklen_t>(sizeof optval)); if (ret < 0 && on) { perror("SO_REUSEPORT failed."); } #else if (on) { perror("SO_REUSEPORT is not supported."); } #endif } void Socket::setKeepAlive(bool on) { int optval = on ? 1 : 0; ::setsockopt(_sock_fd, SOL_SOCKET, SO_KEEPALIVE, &optval, static_cast<socklen_t>(sizeof optval)); // FIXME CHECK }

[ "1078918078@qq.com" ]

1078918078@qq.com

80bcd84fc5b20131e8ce38117a06772e23f69361

40fce7e4b95efdd5eedd6da0c2359ae102f9ccac

/task93.cpp

4189ac966eec8c7b2b0e1f3121e081ca7357ddd7

[]

no_license

ShamyratDauren/Dauren-Shamyrat-CS1904

f95df37bf8f711b8490500abf9ebab999260e813

6401d6d10fc0acf615ccb553428d3dd78c833fbc

refs/heads/master

2021-07-03T22:40:00.516726

2021-01-30T20:07:23

222,635,789

0

null

UTF-8

C++

false

261

cpp

#include <iostream> //93 #include <cmath> using namespace std; int main() { int n; cin >> n; int sum = 0; for (int i = 1; i <= n; i++) { int a = pow(i, 2.0); sum += a; cout << a << '+'; } cout << '=' << sum << endl; return 0; }

[ "noreply@github.com" ]

ShamyratDauren.noreply@github.com

0ac5df940130fb28a315b955c7f031946a1e77c4

69e577a4c7e051c3e0399853e0f3233d5f52882a

/pcre.cc

72f258eb6a0f605db3e79ed3bccef870808128c7

[ "MIT", "LicenseRef-scancode-public-domain" ]

permissive

atrn/ici

07ce3849e96e4acaa35f30b4144ae48a7a584925

c3807f5cc7ffd2d272818978060c0a04c19ed55d

refs/heads/master

2023-07-08T19:36:58.035538

2023-06-27T20:59:29

118,180,499

2

null

UTF-8

C++

false

165,229

cc

/************************************************* * Perl-Compatible Regular Expressions * *************************************************/ /* This is a library of functions to support regular expressions whose syntax and semantics are as close as possible to those of the Perl 5 language. See the file Tech.Notes for some information on the internals. Written by: Philip Hazel <ph10@cam.ac.uk> Copyright (c) 1997-1999 University of Cambridge ----------------------------------------------------------------------------- Permission is granted to anyone to use this software for any purpose on any computer system, and to redistribute it freely, subject to the following restrictions: 1. This software 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. 2. The origin of this software must not be misrepresented, either by explicit claim or by omission. 3. Altered versions must be plainly marked as such, and must not be misrepresented as being the original software. 4. If PCRE is embedded in any software that is released under the GNU General Purpose Licence (GPL), then the terms of that licence shall supersede any condition above with which it is incompatible. ----------------------------------------------------------------------------- */ /* Define DEBUG to get debugging output on stdout. */ /* #define DEBUG */ /* Use a macro for debugging printing, 'cause that eliminates the use of #ifdef inline, and there are *still* stupid compilers about that don't like indented pre-processor statements. I suppose it's only been 10 years... */ #ifdef DEBUG #define DPRINTF(p) printf p #else #define DPRINTF(p) /*nothing*/ #endif /* Include the internals header, which itself includes Standard C headers plus the external pcre header. */ #include "internal.h" /* Allow compilation as C++ source code, should anybody want to do that. */ #ifdef __cplusplus #define class pcre_class #endif /* Number of items on the nested bracket stacks at compile time. This should not be set greater than 200. */ #define BRASTACK_SIZE 200 /* Min and max values for the common repeats; for the maxima, 0 => infinity */ static const char rep_min[] = {0, 0, 1, 1, 0, 0}; static const char rep_max[] = {0, 0, 0, 0, 1, 1}; /* Text forms of OP_ values and things, for debugging (not all used) */ #ifdef DEBUG static const char *OP_names[] = { "End", "\\A", "\\B", "\\b", "\\D", "\\d", "\\S", "\\s", "\\W", "\\w", "\\Z", "\\z", "Opt", "^", "$", "Any", "chars", "not", "*", "*?", "+", "+?", "?", "??", "{", "{", "{", "*", "*?", "+", "+?", "?", "??", "{", "{", "{", "*", "*?", "+", "+?", "?", "??", "{", "{", "{", "*", "*?", "+", "+?", "?", "??", "{", "{", "class", "Ref", "Alt", "Ket", "KetRmax", "KetRmin", "Assert", "Assert not", "AssertB", "AssertB not", "Reverse", "Once", "Cond", "Cref", "Brazero", "Braminzero", "Bra"}; #endif /* Table for handling escaped characters in the range '0'-'z'. Positive returns are simple data values; negative values are for special things like \d and so on. Zero means further processing is needed (for things like \x), or the escape is invalid. */ static const short int escapes[] = { 0, 0, 0, 0, 0, 0, 0, 0, /* 0 - 7 */ 0, 0, ':', ';', '<', '=', '>', '?', /* 8 - ? */ '@', -ESC_A, -ESC_B, 0, -ESC_D, 0, 0, 0, /* @ - G */ 0, 0, 0, 0, 0, 0, 0, 0, /* H - O */ 0, 0, 0, -ESC_S, 0, 0, 0, -ESC_W, /* P - W */ 0, 0, -ESC_Z, '[', '\\', ']', '^', '_', /* X - _ */ '`', 7, -ESC_b, 0, -ESC_d, 27, '\f', 0, /* ` - g */ 0, 0, 0, 0, 0, 0, '\n', 0, /* h - o */ 0, 0, '\r', -ESC_s, '\t', 0, 0, -ESC_w, /* p - w */ 0, 0, -ESC_z /* x - z */ }; /* Definition to allow mutual recursion */ static BOOL compile_regex(int, int, int *, uschar **, const uschar **, const char **, BOOL, int, int *, int *, compile_data *); /************************************************* * Global variables * *************************************************/ /* PCRE is thread-clean and doesn't use any global variables in the normal sense. However, it calls memory allocation and free functions via the two indirections below, which are can be changed by the caller, but are shared between all threads. */ void *(*pcre_malloc)(size_t) = malloc; void (*pcre_free)(void *) = free; /************************************************* * Default character tables * *************************************************/ /* A default set of character tables is included in the PCRE binary. Its source is built by the maketables auxiliary program, which uses the default C ctypes functions, and put in the file chartables.c. These tables are used by PCRE whenever the caller of pcre_compile() does not provide an alternate set of tables. */ #include "chartables.i" /************************************************* * Return version string * *************************************************/ #define STRING(a) #a #define XSTRING(s) STRING(s) const char *pcre_version(void) { return XSTRING(PCRE_MAJOR) "." XSTRING(PCRE_MINOR) " " XSTRING(PCRE_DATE); } /************************************************* * Return info about a compiled pattern * *************************************************/ /* This function picks potentially useful data out of the private structure. The public options are passed back in an int - though the re->options field has been expanded to a long int, all the public options at the low end of it, and so even on 16-bit systems this will still be OK. Therefore, I haven't changed the API for pcre_info(). Arguments: external_re points to compiled code optptr where to pass back the options first_char where to pass back the first character, or -1 if multiline and all branches start ^, or -2 otherwise Returns: number of identifying extraction brackets or negative values on error */ int pcre_info(const pcre *external_re, int *optptr, int *first_char) { const real_pcre *re = (const real_pcre *)external_re; if (re == nullptr) return PCRE_ERROR_NULL; if (re->magic_number != MAGIC_NUMBER) return PCRE_ERROR_BADMAGIC; if (optptr != nullptr) *optptr = (int)(re->options & PUBLIC_OPTIONS); if (first_char != nullptr) *first_char = ((re->options & PCRE_FIRSTSET) != 0) ? re->first_char : ((re->options & PCRE_STARTLINE) != 0) ? -1 : -2; return re->top_bracket; } #ifdef DEBUG /************************************************* * Debugging function to print chars * *************************************************/ /* Print a sequence of chars in printable format, stopping at the end of the subject if the requested. Arguments: p points to characters length number to print is_subject TRUE if printing from within md->start_subject md pointer to matching data block, if is_subject is TRUE Returns: nothing */ static void pchars(const uschar *p, int length, BOOL is_subject, match_data *md) { int c; if (is_subject && length > md->end_subject - p) length = md->end_subject - p; while (length-- > 0) if (isprint(c = *(p++))) printf("%c", c); else printf("\\x%02x", c); } #endif /************************************************* * Handle escapes * *************************************************/ /* This function is called when a \ has been encountered. It either returns a positive value for a simple escape such as \n, or a negative value which encodes one of the more complicated things such as \d. On entry, ptr is pointing at the \. On exit, it is on the final character of the escape sequence. Arguments: ptrptr points to the pattern position pointer errorptr points to the pointer to the error message bracount number of previous extracting brackets options the options bits isclass TRUE if inside a character class cd pointer to char tables block Returns: zero or positive => a data character negative => a special escape sequence on error, errorptr is set */ static int check_escape(const uschar **ptrptr, const char **errorptr, int bracount, int options, BOOL isclass, compile_data *cd) { const uschar *ptr = *ptrptr; int c = *(++ptr) & 255; /* Ensure > 0 on signed-char systems */ int i; if (c == 0) *errorptr = ERR1; /* Digits or letters may have special meaning; all others are literals. */ else if (c < '0' || c > 'z') { } /* Do an initial lookup in a table. A non-zero result is something that can be returned immediately. Otherwise further processing may be required. */ else if ((i = escapes[c - '0']) != 0) c = i; /* Escapes that need further processing, or are illegal. */ else { const uschar *oldptr; switch (c) { /* The handling of escape sequences consisting of a string of digits starting with one that is not zero is not straightforward. By experiment, the way Perl works seems to be as follows: Outside a character class, the digits are read as a decimal number. If the number is less than 10, or if there are that many previous extracting left brackets, then it is a back reference. Otherwise, up to three octal digits are read to form an escaped byte. Thus \123 is likely to be octal 123 (cf \0123, which is octal 012 followed by the literal 3). If the octal value is greater than 377, the least significant 8 bits are taken. Inside a character class, \ followed by a digit is always an octal number. */ case '1': case '2': case '3': case '4': case '5': case '6': case '7': case '8': case '9': if (!isclass) { oldptr = ptr; c -= '0'; while ((cd->ctypes[ptr[1]] & ctype_digit) != 0) c = c * 10 + *(++ptr) - '0'; if (c < 10 || c <= bracount) { c = -(ESC_REF + c); break; } ptr = oldptr; /* Put the pointer back and fall through */ } /* Handle an octal number following \. If the first digit is 8 or 9, Perl generates a binary zero byte and treats the digit as a following literal. Thus we have to pull back the pointer by one. */ if ((c = *ptr) >= '8') { ptr--; c = 0; break; } /* \0 always starts an octal number, but we may drop through to here with a larger first octal digit */ case '0': c -= '0'; while (i++ < 2 && (cd->ctypes[ptr[1]] & ctype_digit) != 0 && ptr[1] != '8' && ptr[1] != '9') c = c * 8 + *(++ptr) - '0'; break; /* Special escapes not starting with a digit are straightforward */ case 'x': c = 0; while (i++ < 2 && (cd->ctypes[ptr[1]] & ctype_xdigit) != 0) { ptr++; c = c * 16 + cd->lcc[*ptr] - (((cd->ctypes[*ptr] & ctype_digit) != 0) ? '0' : 'W'); } break; case 'c': c = *(++ptr); if (c == 0) { *errorptr = ERR2; return 0; } /* A letter is upper-cased; then the 0x40 bit is flipped */ if (c >= 'a' && c <= 'z') c = cd->fcc[c]; c ^= 0x40; break; /* PCRE_EXTRA enables extensions to Perl in the matter of escapes. Any other alphameric following \ is an error if PCRE_EXTRA was set; otherwise, for Perl compatibility, it is a literal. This code looks a bit odd, but there used to be some cases other than the default, and there may be again in future, so I haven't "optimized" it. */ default: if ((options & PCRE_EXTRA) != 0) switch (c) { default: *errorptr = ERR3; break; } break; } } *ptrptr = ptr; return c; } /************************************************* * Check for counted repeat * *************************************************/ /* This function is called when a '{' is encountered in a place where it might start a quantifier. It looks ahead to see if it really is a quantifier or not. It is only a quantifier if it is one of the forms {ddd} {ddd,} or {ddd,ddd} where the ddds are digits. Arguments: p pointer to the first char after '{' cd pointer to char tables block Returns: TRUE or FALSE */ static BOOL is_counted_repeat(const uschar *p, compile_data *cd) { if ((cd->ctypes[*p++] & ctype_digit) == 0) return FALSE; while ((cd->ctypes[*p] & ctype_digit) != 0) p++; if (*p == '}') return TRUE; if (*p++ != ',') return FALSE; if (*p == '}') return TRUE; if ((cd->ctypes[*p++] & ctype_digit) == 0) return FALSE; while ((cd->ctypes[*p] & ctype_digit) != 0) p++; return (*p == '}'); } /************************************************* * Read repeat counts * *************************************************/ /* Read an item of the form {n,m} and return the values. This is called only after is_counted_repeat() has confirmed that a repeat-count quantifier exists, so the syntax is guaranteed to be correct, but we need to check the values. Arguments: p pointer to first char after '{' minp pointer to int for min maxp pointer to int for max returned as -1 if no max errorptr points to pointer to error message cd pointer to character tables clock Returns: pointer to '}' on success; current ptr on error, with errorptr set */ static const uschar *read_repeat_counts(const uschar *p, int *minp, int *maxp, const char **errorptr, compile_data *cd) { int min = 0; int max = -1; while ((cd->ctypes[*p] & ctype_digit) != 0) min = min * 10 + *p++ - '0'; if (*p == '}') max = min; else { if (*(++p) != '}') { max = 0; while ((cd->ctypes[*p] & ctype_digit) != 0) max = max * 10 + *p++ - '0'; if (max < min) { *errorptr = ERR4; return p; } } } /* Do paranoid checks, then fill in the required variables, and pass back the pointer to the terminating '}'. */ if (min > 65535 || max > 65535) *errorptr = ERR5; else { *minp = min; *maxp = max; } return p; } /************************************************* * Find the fixed length of a pattern * *************************************************/ /* Scan a pattern and compute the fixed length of subject that will match it, if the length is fixed. This is needed for dealing with backward assertions. Arguments: code points to the start of the pattern (the bracket) Returns: the fixed length, or -1 if there is no fixed length */ static int find_fixedlength(uschar *code) { int length = -1; int branchlength = 0; uschar *cc = code + 3; /* Scan along the opcodes for this branch. If we get to the end of the branch, check the length against that of the other branches. */ for (;;) { int d; int op = *cc; if (op >= OP_BRA) op = OP_BRA; switch (op) { case OP_BRA: case OP_ONCE: case OP_COND: d = find_fixedlength(cc); if (d < 0) return -1; branchlength += d; do cc += (cc[1] << 8) + cc[2]; while (*cc == OP_ALT); cc += 3; break; /* Reached end of a branch; if it's a ket it is the end of a nested call. If it's ALT it is an alternation in a nested call. If it is END it's the end of the outer call. All can be handled by the same code. */ case OP_ALT: case OP_KET: case OP_KETRMAX: case OP_KETRMIN: case OP_END: if (length < 0) length = branchlength; else if (length != branchlength) return -1; if (*cc != OP_ALT) return length; cc += 3; branchlength = 0; break; /* Skip over assertive subpatterns */ case OP_ASSERT: case OP_ASSERT_NOT: case OP_ASSERTBACK: case OP_ASSERTBACK_NOT: do cc += (cc[1] << 8) + cc[2]; while (*cc == OP_ALT); cc += 3; break; /* Skip over things that don't match chars */ case OP_REVERSE: cc++; /* Fall through */ case OP_CREF: case OP_OPT: cc++; /* Fall through */ case OP_SOD: case OP_EOD: case OP_EODN: case OP_CIRC: case OP_DOLL: case OP_NOT_WORD_BOUNDARY: case OP_WORD_BOUNDARY: cc++; break; /* Handle char strings */ case OP_CHARS: branchlength += *(++cc); cc += *cc + 1; break; /* Handle exact repetitions */ case OP_EXACT: case OP_TYPEEXACT: branchlength += (cc[1] << 8) + cc[2]; cc += 4; break; /* Handle single-char matchers */ case OP_NOT_DIGIT: case OP_DIGIT: case OP_NOT_WHITESPACE: case OP_WHITESPACE: case OP_NOT_WORDCHAR: case OP_WORDCHAR: case OP_ANY: branchlength++; cc++; break; /* Check a class for variable quantification */ case OP_CLASS: cc += (*cc == OP_REF) ? 2 : 33; switch (*cc) { case OP_CRSTAR: case OP_CRMINSTAR: case OP_CRQUERY: case OP_CRMINQUERY: return -1; case OP_CRRANGE: case OP_CRMINRANGE: if ((cc[1] << 8) + cc[2] != (cc[3] << 8) + cc[4]) return -1; branchlength += (cc[1] << 8) + cc[2]; cc += 5; break; default: branchlength++; } break; /* Anything else is variable length */ default: return -1; } } /* Control never gets here */ } /************************************************* * Compile one branch * *************************************************/ /* Scan the pattern, compiling it into the code vector. Arguments: options the option bits brackets points to number of brackets used code points to the pointer to the current code point ptrptr points to the current pattern pointer errorptr points to pointer to error message optchanged set to the value of the last OP_OPT item compiled reqchar set to the last literal character required, else -1 countlits set to count of mandatory literal characters cd contains pointers to tables Returns: TRUE on success FALSE, with *errorptr set on error */ static BOOL compile_branch(int options, int *brackets, uschar **codeptr, const uschar **ptrptr, const char **errorptr, int *optchanged, int *reqchar, int *countlits, compile_data *cd) { int repeat_type, op_type; int repeat_min = 0, repeat_max = 0; int bravalue, length; int greedy_default, greedy_non_default; int prevreqchar; int condcount = 0; int subcountlits = 0; int c = 0; /* init to shut up compiler */ uschar *code = *codeptr; uschar *tempcode; const uschar *ptr = *ptrptr; const uschar *tempptr; uschar *previous = nullptr; uschar class[32]; /* Set up the default and non-default settings for greediness */ greedy_default = ((options & PCRE_UNGREEDY) != 0); greedy_non_default = greedy_default ^ 1; /* Initialize no required char, and count of literals */ *reqchar = prevreqchar = -1; *countlits = 0; /* Switch on next character until the end of the branch */ for (;; ptr++) { BOOL negate_class; int class_charcount; int class_lastchar; int newoptions; int condref; int subreqchar; c = *ptr; if ((options & PCRE_EXTENDED) != 0) { if ((cd->ctypes[c] & ctype_space) != 0) continue; if (c == '#') { while ((c = *(++ptr)) != 0 && c != '\n') ; continue; } } switch (c) { /* The branch terminates at end of string, |, or ). */ case 0: case '|': case ')': *codeptr = code; *ptrptr = ptr; return TRUE; /* Handle single-character metacharacters */ case '^': previous = nullptr; *code++ = OP_CIRC; break; case '$': previous = nullptr; *code++ = OP_DOLL; break; case '.': previous = code; *code++ = OP_ANY; break; /* Character classes. These always build a 32-byte bitmap of the permitted characters, except in the special case where there is only one character. For negated classes, we build the map as usual, then invert it at the end. */ case '[': previous = code; *code++ = OP_CLASS; /* If the first character is '^', set the negation flag and skip it. */ if ((c = *(++ptr)) == '^') { negate_class = TRUE; c = *(++ptr); } else negate_class = FALSE; /* Keep a count of chars so that we can optimize the case of just a single character. */ class_charcount = 0; class_lastchar = -1; /* Initialize the 32-char bit map to all zeros. We have to build the map in a temporary bit of store, in case the class contains only 1 character, because in that case the compiled code doesn't use the bit map. */ memset(class, 0, 32 * sizeof(uschar)); /* Process characters until ] is reached. By writing this as a "do" it means that an initial ] is taken as a data character. */ do { if (c == 0) { *errorptr = ERR6; goto FAILED; } /* Backslash may introduce a single character, or it may introduce one of the specials, which just set a flag. Escaped items are checked for validity in the pre-compiling pass. The sequence \b is a special case. Inside a class (and only there) it is treated as backspace. Elsewhere it marks a word boundary. Other escapes have preset maps ready to or into the one we are building. We assume they have more than one character in them, so set class_count bigger than one. */ if (c == '\\') { c = check_escape(&ptr, errorptr, *brackets, options, TRUE, cd); if (-c == ESC_b) c = '\b'; else if (c < 0) { const uschar *cbits = cd->cbits; class_charcount = 10; switch (-c) { case ESC_d: for (c = 0; c < 32; c++) class[c] |= cbits[c + cbit_digit]; continue; case ESC_D: for (c = 0; c < 32; c++) class[c] |= ~cbits[c + cbit_digit]; continue; case ESC_w: for (c = 0; c < 32; c++) class[c] |= (cbits[c + cbit_digit] | cbits[c + cbit_word]); continue; case ESC_W: for (c = 0; c < 32; c++) class[c] |= ~(cbits[c + cbit_digit] | cbits[c + cbit_word]); continue; case ESC_s: for (c = 0; c < 32; c++) class[c] |= cbits[c + cbit_space]; continue; case ESC_S: for (c = 0; c < 32; c++) class[c] |= ~cbits[c + cbit_space]; continue; default: *errorptr = ERR7; goto FAILED; } } /* Fall through if single character */ } /* A single character may be followed by '-' to form a range. However, Perl does not permit ']' to be the end of the range. A '-' character here is treated as a literal. */ if (ptr[1] == '-' && ptr[2] != ']') { int d; ptr += 2; d = *ptr; if (d == 0) { *errorptr = ERR6; goto FAILED; } /* The second part of a range can be a single-character escape, but not any of the other escapes. */ if (d == '\\') { d = check_escape(&ptr, errorptr, *brackets, options, TRUE, cd); if (d < 0) { if (d == -ESC_b) d = '\b'; else { *errorptr = ERR7; goto FAILED; } } } if (d < c) { *errorptr = ERR8; goto FAILED; } for (; c <= d; c++) { class[c / 8] |= (1 << (c & 7)); if ((options & PCRE_CASELESS) != 0) { int uc = cd->fcc[c]; /* flip case */ class[uc / 8] |= (1 << (uc & 7)); } class_charcount++; /* in case a one-char range */ class_lastchar = c; } continue; /* Go get the next char in the class */ } /* Handle a lone single character - we can get here for a normal non-escape char, or after \ that introduces a single character. */ class[c / 8] |= (1 << (c & 7)); if ((options & PCRE_CASELESS) != 0) { c = cd->fcc[c]; /* flip case */ class[c / 8] |= (1 << (c & 7)); } class_charcount++; class_lastchar = c; } /* Loop until ']' reached; the check for end of string happens inside the loop. This "while" is the end of the "do" above. */ while ((c = *(++ptr)) != ']'); /* If class_charcount is 1 and class_lastchar is not negative, we saw precisely one character. This doesn't need the whole 32-byte bit map. We turn it into a 1-character OP_CHAR if it's positive, or OP_NOT if it's negative. */ if (class_charcount == 1 && class_lastchar >= 0) { if (negate_class) { code[-1] = OP_NOT; } else { code[-1] = OP_CHARS; *code++ = 1; } *code++ = class_lastchar; } /* Otherwise, negate the 32-byte map if necessary, and copy it into the code vector. */ else { if (negate_class) for (c = 0; c < 32; c++) code[c] = ~class[c]; else memcpy(code, class, 32); code += 32; } break; /* Various kinds of repeat */ case '{': if (!is_counted_repeat(ptr + 1, cd)) goto NORMAL_CHAR; ptr = read_repeat_counts(ptr + 1, &repeat_min, &repeat_max, errorptr, cd); if (*errorptr != nullptr) goto FAILED; goto REPEAT; case '*': repeat_min = 0; repeat_max = -1; goto REPEAT; case '+': repeat_min = 1; repeat_max = -1; goto REPEAT; case '?': repeat_min = 0; repeat_max = 1; REPEAT: if (previous == nullptr) { *errorptr = ERR9; goto FAILED; } /* If the next character is '?' this is a minimizing repeat, by default, but if PCRE_UNGREEDY is set, it works the other way round. Advance to the next character. */ if (ptr[1] == '?') { repeat_type = greedy_non_default; ptr++; } else repeat_type = greedy_default; /* If previous was a string of characters, chop off the last one and use it as the subject of the repeat. If there was only one character, we can abolish the previous item altogether. A repeat with a zero minimum wipes out any reqchar setting, backing up to the previous value. We must also adjust the countlits value. */ if (*previous == OP_CHARS) { int len = previous[1]; if (repeat_min == 0) *reqchar = prevreqchar; *countlits += repeat_min - 1; if (len == 1) { c = previous[2]; code = previous; } else { c = previous[len + 1]; previous[1]--; code--; } op_type = 0; /* Use single-char op codes */ goto OUTPUT_SINGLE_REPEAT; /* Code shared with single character types */ } /* If previous was a single negated character ([^a] or similar), we use one of the special opcodes, replacing it. The code is shared with single- character repeats by adding a suitable offset into repeat_type. */ else if ((int)*previous == OP_NOT) { op_type = OP_NOTSTAR - OP_STAR; /* Use "not" opcodes */ c = previous[1]; code = previous; goto OUTPUT_SINGLE_REPEAT; } /* If previous was a character type match (\d or similar), abolish it and create a suitable repeat item. The code is shared with single-character repeats by adding a suitable offset into repeat_type. */ else if ((int)*previous < OP_EODN || *previous == OP_ANY) { op_type = OP_TYPESTAR - OP_STAR; /* Use type opcodes */ c = *previous; code = previous; OUTPUT_SINGLE_REPEAT: /* If the maximum is zero then the minimum must also be zero; Perl allows this case, so we do too - by simply omitting the item altogether. */ if (repeat_max == 0) goto END_REPEAT; /* Combine the op_type with the repeat_type */ repeat_type += op_type; /* A minimum of zero is handled either as the special case * or ?, or as an UPTO, with the maximum given. */ if (repeat_min == 0) { if (repeat_max == -1) *code++ = OP_STAR + repeat_type; else if (repeat_max == 1) *code++ = OP_QUERY + repeat_type; else { *code++ = OP_UPTO + repeat_type; *code++ = repeat_max >> 8; *code++ = (repeat_max & 255); } } /* The case {1,} is handled as the special case + */ else if (repeat_min == 1 && repeat_max == -1) *code++ = OP_PLUS + repeat_type; /* The case {n,n} is just an EXACT, while the general case {n,m} is handled as an EXACT followed by an UPTO. An EXACT of 1 is optimized. */ else { if (repeat_min != 1) { *code++ = OP_EXACT + op_type; /* NB EXACT doesn't have repeat_type */ *code++ = repeat_min >> 8; *code++ = (repeat_min & 255); } /* If the mininum is 1 and the previous item was a character string, we either have to put back the item that got cancelled if the string length was 1, or add the character back onto the end of a longer string. For a character type nothing need be done; it will just get put back naturally. Note that the final character is always going to get added below. */ else if (*previous == OP_CHARS) { if (code == previous) code += 2; else previous[1]++; } /* For a single negated character we also have to put back the item that got cancelled. */ else if (*previous == OP_NOT) code++; /* If the maximum is unlimited, insert an OP_STAR. */ if (repeat_max < 0) { *code++ = c; *code++ = OP_STAR + repeat_type; } /* Else insert an UPTO if the max is greater than the min. */ else if (repeat_max != repeat_min) { *code++ = c; repeat_max -= repeat_min; *code++ = OP_UPTO + repeat_type; *code++ = repeat_max >> 8; *code++ = (repeat_max & 255); } } /* The character or character type itself comes last in all cases. */ *code++ = c; } /* If previous was a character class or a back reference, we put the repeat stuff after it, but just skip the item if the repeat was {0,0}. */ else if (*previous == OP_CLASS || *previous == OP_REF) { if (repeat_max == 0) { code = previous; goto END_REPEAT; } if (repeat_min == 0 && repeat_max == -1) *code++ = OP_CRSTAR + repeat_type; else if (repeat_min == 1 && repeat_max == -1) *code++ = OP_CRPLUS + repeat_type; else if (repeat_min == 0 && repeat_max == 1) *code++ = OP_CRQUERY + repeat_type; else { *code++ = OP_CRRANGE + repeat_type; *code++ = repeat_min >> 8; *code++ = repeat_min & 255; if (repeat_max == -1) repeat_max = 0; /* 2-byte encoding for max */ *code++ = repeat_max >> 8; *code++ = repeat_max & 255; } } /* If previous was a bracket group, we may have to replicate it in certain cases. */ else if ((int)*previous >= OP_BRA || (int)*previous == OP_ONCE || (int)*previous == OP_COND) { int i; int ketoffset = 0; int len = code - previous; uschar *bralink = nullptr; /* If the maximum repeat count is unlimited, find the end of the bracket by scanning through from the start, and compute the offset back to it from the current code pointer. There may be an OP_OPT setting following the final KET, so we can't find the end just by going back from the code pointer. */ if (repeat_max == -1) { uschar *ket = previous; do ket += (ket[1] << 8) + ket[2]; while (*ket != OP_KET); ketoffset = code - ket; } /* The case of a zero minimum is special because of the need to stick OP_BRAZERO in front of it, and because the group appears once in the data, whereas in other cases it appears the minimum number of times. For this reason, it is simplest to treat this case separately, as otherwise the code gets far too mess. There are several special subcases when the minimum is zero. */ if (repeat_min == 0) { /* If we set up a required char from the bracket, we must back off to the previous value and reset the countlits value too. */ if (subcountlits > 0) { *reqchar = prevreqchar; *countlits -= subcountlits; } /* If the maximum is also zero, we just omit the group from the output altogether. */ if (repeat_max == 0) { code = previous; goto END_REPEAT; } /* If the maximum is 1 or unlimited, we just have to stick in the BRAZERO and do no more at this point. */ if (repeat_max <= 1) { memmove(previous + 1, previous, len); code++; *previous++ = OP_BRAZERO + repeat_type; } /* If the maximum is greater than 1 and limited, we have to replicate in a nested fashion, sticking OP_BRAZERO before each set of brackets. The first one has to be handled carefully because it's the original copy, which has to be moved up. The remainder can be handled by code that is common with the non-zero minimum case below. We just have to adjust the value or repeat_max, since one less copy is required. */ else { int offset; memmove(previous + 4, previous, len); code += 4; *previous++ = OP_BRAZERO + repeat_type; *previous++ = OP_BRA; /* We chain together the bracket offset fields that have to be filled in later when the ends of the brackets are reached. */ offset = (bralink == nullptr) ? 0 : previous - bralink; bralink = previous; *previous++ = offset >> 8; *previous++ = offset & 255; } repeat_max--; } /* If the minimum is greater than zero, replicate the group as many times as necessary, and adjust the maximum to the number of subsequent copies that we need. */ else { for (i = 1; i < repeat_min; i++) { memcpy(code, previous, len); code += len; } if (repeat_max > 0) repeat_max -= repeat_min; } /* This code is common to both the zero and non-zero minimum cases. If the maximum is limited, it replicates the group in a nested fashion, remembering the bracket starts on a stack. In the case of a zero minimum, the first one was set up above. In all cases the repeat_max now specifies the number of additional copies needed. */ if (repeat_max >= 0) { for (i = repeat_max - 1; i >= 0; i--) { *code++ = OP_BRAZERO + repeat_type; /* All but the final copy start a new nesting, maintaining the chain of brackets outstanding. */ if (i != 0) { int offset; *code++ = OP_BRA; offset = (bralink == nullptr) ? 0 : code - bralink; bralink = code; *code++ = offset >> 8; *code++ = offset & 255; } memcpy(code, previous, len); code += len; } /* Now chain through the pending brackets, and fill in their length fields (which are holding the chain links pro tem). */ while (bralink != nullptr) { int oldlinkoffset; int offset = code - bralink + 1; uschar *bra = code - offset; oldlinkoffset = (bra[1] << 8) + bra[2]; bralink = (oldlinkoffset == 0) ? nullptr : bralink - oldlinkoffset; *code++ = OP_KET; *code++ = bra[1] = offset >> 8; *code++ = bra[2] = (offset & 255); } } /* If the maximum is unlimited, set a repeater in the final copy. We can't just offset backwards from the current code point, because we don't know if there's been an options resetting after the ket. The correct offset was computed above. */ else code[-ketoffset] = OP_KETRMAX + repeat_type; } /* Else there's some kind of shambles */ else { *errorptr = ERR11; goto FAILED; } /* In all case we no longer have a previous item. */ END_REPEAT: previous = nullptr; break; /* Start of nested bracket sub-expression, or comment or lookahead or lookbehind or option setting or condition. First deal with special things that can come after a bracket; all are introduced by ?, and the appearance of any of them means that this is not a referencing group. They were checked for validity in the first pass over the string, so we don't have to check for syntax errors here. */ case '(': newoptions = options; condref = -1; if (*(++ptr) == '?') { int set, unset; int *optset; switch (*(++ptr)) { case '#': /* Comment; skip to ket */ ptr++; while (*ptr != ')') ptr++; continue; case ':': /* Non-extracting bracket */ bravalue = OP_BRA; ptr++; break; case '(': bravalue = OP_COND; /* Conditional group */ if ((cd->ctypes[*(++ptr)] & ctype_digit) != 0) { condref = *ptr - '0'; while (*(++ptr) != ')') condref = condref * 10 + *ptr - '0'; ptr++; } else ptr--; break; case '=': /* Positive lookahead */ bravalue = OP_ASSERT; ptr++; break; case '!': /* Negative lookahead */ bravalue = OP_ASSERT_NOT; ptr++; break; case '<': /* Lookbehinds */ switch (*(++ptr)) { case '=': /* Positive lookbehind */ bravalue = OP_ASSERTBACK; ptr++; break; case '!': /* Negative lookbehind */ bravalue = OP_ASSERTBACK_NOT; ptr++; break; default: /* Syntax error */ *errorptr = ERR24; goto FAILED; } break; case '>': /* One-time brackets */ bravalue = OP_ONCE; ptr++; break; default: /* Option setting */ set = unset = 0; optset = &set; while (*ptr != ')' && *ptr != ':') { switch (*ptr++) { case '-': optset = &unset; break; case 'i': *optset |= PCRE_CASELESS; break; case 'm': *optset |= PCRE_MULTILINE; break; case 's': *optset |= PCRE_DOTALL; break; case 'x': *optset |= PCRE_EXTENDED; break; case 'U': *optset |= PCRE_UNGREEDY; break; case 'X': *optset |= PCRE_EXTRA; break; default: *errorptr = ERR12; goto FAILED; } } /* Set up the changed option bits, but don't change anything yet. */ newoptions = (options | set) & (~unset); /* If the options ended with ')' this is not the start of a nested group with option changes, so the options change at this level. At top level there is nothing else to be done (the options will in fact have been set from the start of compiling as a result of the first pass) but at an inner level we must compile code to change the ims options if necessary, and pass the new setting back so that it can be put at the start of any following branches, and when this group ends, a resetting item can be compiled. */ if (*ptr == ')') { if ((options & PCRE_INGROUP) != 0 && (options & PCRE_IMS) != (newoptions & PCRE_IMS)) { *code++ = OP_OPT; *code++ = *optchanged = newoptions & PCRE_IMS; } options = newoptions; /* Change options at this level */ previous = nullptr; /* This item can't be repeated */ continue; /* It is complete */ } /* If the options ended with ':' we are heading into a nested group with possible change of options. Such groups are non-capturing and are not assertions of any kind. All we need to do is skip over the ':'; the newoptions value is handled below. */ bravalue = OP_BRA; ptr++; } } /* Else we have a referencing group; adjust the opcode. */ else { if (++(*brackets) > EXTRACT_MAX) { *errorptr = ERR13; goto FAILED; } bravalue = OP_BRA + *brackets; } /* Process nested bracketed re. Assertions may not be repeated, but other kinds can be. We copy code into a non- variable in order to be able to pass its address because some compilers complain otherwise. Pass in a new setting for the ims options if they have changed. */ previous = (bravalue >= OP_ONCE) ? code : nullptr; *code = bravalue; tempcode = code; if (!compile_regex(options | PCRE_INGROUP, /* Set for all nested groups */ ((options & PCRE_IMS) != (newoptions & PCRE_IMS)) ? newoptions & PCRE_IMS : -1, /* Pass ims options if changed */ brackets, /* Bracket level */ &tempcode, /* Where to put code (updated) */ &ptr, /* Input pointer (updated) */ errorptr, /* Where to put an error message */ (bravalue == OP_ASSERTBACK || bravalue == OP_ASSERTBACK_NOT), /* TRUE if back assert */ condref, /* Condition reference number */ &subreqchar, /* For possible last char */ &subcountlits, /* For literal count */ cd)) /* Tables block */ goto FAILED; /* At the end of compiling, code is still pointing to the start of the group, while tempcode has been updated to point past the end of the group and any option resetting that may follow it. The pattern pointer (ptr) is on the bracket. */ /* If this is a conditional bracket, check that there are no more than two branches in the group. */ if (bravalue == OP_COND) { uschar *tc = code; condcount = 0; do { condcount++; tc += (tc[1] << 8) | tc[2]; } while (*tc != OP_KET); if (condcount > 2) { *errorptr = ERR27; goto FAILED; } } /* Handle updating of the required character. If the subpattern didn't set one, leave it as it was. Otherwise, update it for normal brackets of all kinds, forward assertions, and conditions with two branches. Don't update the literal count for forward assertions, however. If the bracket is followed by a quantifier with zero repeat, we have to back off. Hence the definition of prevreqchar and subcountlits outside the main loop so that they can be accessed for the back off. */ if (subreqchar > 0 && (bravalue >= OP_BRA || bravalue == OP_ONCE || bravalue == OP_ASSERT || (bravalue == OP_COND && condcount == 2))) { prevreqchar = *reqchar; *reqchar = subreqchar; if (bravalue != OP_ASSERT) *countlits += subcountlits; } /* Now update the main code pointer to the end of the group. */ code = tempcode; /* Error if hit end of pattern */ if (*ptr != ')') { *errorptr = ERR14; goto FAILED; } break; /* Check \ for being a real metacharacter; if not, fall through and handle it as a data character at the start of a string. Escape items are checked for validity in the pre-compiling pass. */ case '\\': tempptr = ptr; c = check_escape(&ptr, errorptr, *brackets, options, FALSE, cd); /* Handle metacharacters introduced by \. For ones like \d, the ESC_ values are arranged to be the negation of the corresponding OP_values. For the back references, the values are ESC_REF plus the reference number. Only back references and those types that consume a character may be repeated. We can test for values between ESC_b and ESC_Z for the latter; this may have to change if any new ones are ever created. */ if (c < 0) { if (-c >= ESC_REF) { previous = code; *code++ = OP_REF; *code++ = -c - ESC_REF; } else { previous = (-c > ESC_b && -c < ESC_Z) ? code : nullptr; *code++ = -c; } continue; } /* Data character: reset and fall through */ ptr = tempptr; c = '\\'; /* Handle a run of data characters until a metacharacter is encountered. The first character is guaranteed not to be whitespace or # when the extended flag is set. */ NORMAL_CHAR: default: previous = code; *code = OP_CHARS; code += 2; length = 0; do { if ((options & PCRE_EXTENDED) != 0) { if ((cd->ctypes[c] & ctype_space) != 0) continue; if (c == '#') { while ((c = *(++ptr)) != 0 && c != '\n') ; if (c == 0) break; continue; } } /* Backslash may introduce a data char or a metacharacter. Escaped items are checked for validity in the pre-compiling pass. Stop the string before a metaitem. */ if (c == '\\') { tempptr = ptr; c = check_escape(&ptr, errorptr, *brackets, options, FALSE, cd); if (c < 0) { ptr = tempptr; break; } } /* Ordinary character or single-char escape */ *code++ = c; length++; } /* This "while" is the end of the "do" above. */ while (length < 255 && (cd->ctypes[c = *(++ptr)] & ctype_meta) == 0); /* Update the last character and the count of literals */ prevreqchar = (length > 1) ? code[-2] : *reqchar; *reqchar = code[-1]; *countlits += length; /* Compute the length and set it in the data vector, and advance to the next state. */ previous[1] = length; if (length < 255) ptr--; break; } } /* end of big loop */ /* Control never reaches here by falling through, only by a goto for all the error states. Pass back the position in the pattern so that it can be displayed to the user for diagnosing the error. */ FAILED: *ptrptr = ptr; return FALSE; } /************************************************* * Compile sequence of alternatives * *************************************************/ /* On entry, ptr is pointing past the bracket character, but on return it points to the closing bracket, or vertical bar, or end of string. The code variable is pointing at the byte into which the BRA operator has been stored. If the ims options are changed at the start (for a (?ims: group) or during any branch, we need to insert an OP_OPT item at the start of every following branch to ensure they get set correctly at run time, and also pass the new options into every subsequent branch compile. Argument: options the option bits optchanged new ims options to set as if (?ims) were at the start, or -1 for no change brackets -> int containing the number of extracting brackets used codeptr -> the address of the current code pointer ptrptr -> the address of the current pattern pointer errorptr -> pointer to error message lookbehind TRUE if this is a lookbehind assertion condref > 0 for OPT_CREF setting at start of conditional group reqchar -> place to put the last required character, or a negative number countlits -> place to put the shortest literal count of any branch cd points to the data block with tables pointers Returns: TRUE on success */ static BOOL compile_regex(int options, int optchanged, int *brackets, uschar **codeptr, const uschar **ptrptr, const char **errorptr, BOOL lookbehind, int condref, int *reqchar, int *countlits, compile_data *cd) { const uschar *ptr = *ptrptr; uschar *code = *codeptr; uschar *last_branch = code; uschar *start_bracket = code; uschar *reverse_count = nullptr; int oldoptions = options & PCRE_IMS; int branchreqchar, branchcountlits; *reqchar = -1; *countlits = INT_MAX; code += 3; /* At the start of a reference-based conditional group, insert the reference number as an OP_CREF item. */ if (condref > 0) { *code++ = OP_CREF; *code++ = condref; } /* Loop for each alternative branch */ for (;;) { int length; /* Handle change of options */ if (optchanged >= 0) { *code++ = OP_OPT; *code++ = optchanged; options = (options & ~PCRE_IMS) | optchanged; } /* Set up dummy OP_REVERSE if lookbehind assertion */ if (lookbehind) { *code++ = OP_REVERSE; reverse_count = code; *code++ = 0; *code++ = 0; } /* Now compile the branch */ if (!compile_branch(options, brackets, &code, &ptr, errorptr, &optchanged, &branchreqchar, &branchcountlits, cd)) { *ptrptr = ptr; return FALSE; } /* Fill in the length of the last branch */ length = code - last_branch; last_branch[1] = length >> 8; last_branch[2] = length & 255; /* Save the last required character if all branches have the same; a current value of -1 means unset, while -2 means "previous branch had no last required char". */ if (*reqchar != -2) { if (branchreqchar >= 0) { if (*reqchar == -1) *reqchar = branchreqchar; else if (*reqchar != branchreqchar) *reqchar = -2; } else *reqchar = -2; } /* Keep the shortest literal count */ if (branchcountlits < *countlits) *countlits = branchcountlits; DPRINTF(("literal count = %d min=%d\n", branchcountlits, *countlits)); /* If lookbehind, check that this branch matches a fixed-length string, and put the length into the OP_REVERSE item. Temporarily mark the end of the branch with OP_END. */ if (lookbehind) { *code = OP_END; length = find_fixedlength(last_branch); DPRINTF(("fixed length = %d\n", length)); if (length < 0) { *errorptr = ERR25; *ptrptr = ptr; return FALSE; } reverse_count[0] = (length >> 8); reverse_count[1] = length & 255; } /* Reached end of expression, either ')' or end of pattern. Insert a terminating ket and the length of the whole bracketed item, and return, leaving the pointer at the terminating char. If any of the ims options were changed inside the group, compile a resetting op-code following. */ if (*ptr != '|') { length = code - start_bracket; *code++ = OP_KET; *code++ = length >> 8; *code++ = length & 255; if (optchanged >= 0) { *code++ = OP_OPT; *code++ = oldoptions; } *codeptr = code; *ptrptr = ptr; return TRUE; } /* Another branch follows; insert an "or" node and advance the pointer. */ *code = OP_ALT; last_branch = code; code += 3; ptr++; } /* Control never reaches here */ } /************************************************* * Find first significant op code * *************************************************/ /* This is called by several functions that scan a compiled expression looking for a fixed first character, or an anchoring op code etc. It skips over things that do not influence this. For one application, a change of caseless option is important. Arguments: code pointer to the start of the group options pointer to external options optbit the option bit whose changing is significant, or zero if none are optstop TRUE to return on option change, otherwise change the options value and continue Returns: pointer to the first significant opcode */ static const uschar *first_significant_code(const uschar *code, int *options, int optbit, BOOL optstop) { for (;;) { switch ((int)*code) { case OP_OPT: if (optbit > 0 && ((int)code[1] & optbit) != (*options & optbit)) { if (optstop) return code; *options = (int)code[1]; } code += 2; break; case OP_CREF: code += 2; break; case OP_WORD_BOUNDARY: case OP_NOT_WORD_BOUNDARY: code++; break; case OP_ASSERT_NOT: case OP_ASSERTBACK: case OP_ASSERTBACK_NOT: do code += (code[1] << 8) + code[2]; while (*code == OP_ALT); code += 3; break; default: return code; } } /* Control never reaches here */ } /************************************************* * Check for anchored expression * *************************************************/ /* Try to find out if this is an anchored regular expression. Consider each alternative branch. If they all start with OP_SOD or OP_CIRC, or with a bracket all of whose alternatives start with OP_SOD or OP_CIRC (recurse ad lib), then it's anchored. However, if this is a multiline pattern, then only OP_SOD counts, since OP_CIRC can match in the middle. A branch is also implicitly anchored if it starts with .* and DOTALL is set, because that will try the rest of the pattern at all possible matching points, so there is no point trying them again. Arguments: code points to start of expression (the bracket) options points to the options setting Returns: TRUE or FALSE */ static BOOL is_anchored(const uschar *code, int *options) { do { const uschar *scode = first_significant_code(code + 3, options, PCRE_MULTILINE, FALSE); int op = *scode; if (op >= OP_BRA || op == OP_ASSERT || op == OP_ONCE || op == OP_COND) { if (!is_anchored(scode, options)) return FALSE; } else if ((op == OP_TYPESTAR || op == OP_TYPEMINSTAR) && (*options & PCRE_DOTALL) != 0) { if (scode[1] != OP_ANY) return FALSE; } else if (op != OP_SOD && ((*options & PCRE_MULTILINE) != 0 || op != OP_CIRC)) return FALSE; code += (code[1] << 8) + code[2]; } while (*code == OP_ALT); return TRUE; } /************************************************* * Check for starting with ^ or .* * *************************************************/ /* This is called to find out if every branch starts with ^ or .* so that "first char" processing can be done to speed things up in multiline matching and for non-DOTALL patterns that start with .* (which must start at the beginning or after \n). Argument: points to start of expression (the bracket) Returns: TRUE or FALSE */ static BOOL is_startline(const uschar *code) { do { const uschar *scode = first_significant_code(code + 3, nullptr, 0, FALSE); int op = *scode; if (op >= OP_BRA || op == OP_ASSERT || op == OP_ONCE || op == OP_COND) { if (!is_startline(scode)) return FALSE; } else if (op == OP_TYPESTAR || op == OP_TYPEMINSTAR) { if (scode[1] != OP_ANY) return FALSE; } else if (op != OP_CIRC) return FALSE; code += (code[1] << 8) + code[2]; } while (*code == OP_ALT); return TRUE; } /************************************************* * Check for fixed first char * *************************************************/ /* Try to find out if there is a fixed first character. This is called for unanchored expressions, as it speeds up their processing quite considerably. Consider each alternative branch. If they all start with the same char, or with a bracket all of whose alternatives start with the same char (recurse ad lib), then we return that char, otherwise -1. Arguments: code points to start of expression (the bracket) options pointer to the options (used to check casing changes) Returns: -1 or the fixed first char */ static int find_firstchar(const uschar *code, int *options) { int c = -1; do { int d; const uschar *scode = first_significant_code(code + 3, options, PCRE_CASELESS, TRUE); int op = *scode; if (op >= OP_BRA) op = OP_BRA; switch (op) { default: return -1; case OP_BRA: case OP_ASSERT: case OP_ONCE: case OP_COND: if ((d = find_firstchar(scode, options)) < 0) return -1; if (c < 0) c = d; else if (c != d) return -1; break; case OP_EXACT: /* Fall through */ scode++; case OP_CHARS: /* Fall through */ scode++; case OP_PLUS: case OP_MINPLUS: if (c < 0) c = scode[1]; else if (c != scode[1]) return -1; break; } code += (code[1] << 8) + code[2]; } while (*code == OP_ALT); return c; } /************************************************* * Compile a Regular Expression * *************************************************/ /* This function takes a string and returns a pointer to a block of store holding a compiled version of the expression. Arguments: pattern the regular expression options various option bits errorptr pointer to pointer to error text erroroffset ptr offset in pattern where error was detected tables pointer to character tables or nullptr Returns: pointer to compiled data block, or nullptr on error, with errorptr and erroroffset set */ pcre *pcre_compile(const char *pattern, int options, const char **errorptr, int *erroroffset, const unsigned char *tables) { real_pcre *re; int length = 3; /* For initial BRA plus length */ int runlength; int c, size, reqchar, countlits; int bracount = 0; int top_backref = 0; int branch_extra = 0; int branch_newextra; unsigned int brastackptr = 0; uschar *code; const uschar *ptr; compile_data compile_block; int brastack[BRASTACK_SIZE]; uschar bralenstack[BRASTACK_SIZE]; #ifdef DEBUG uschar *code_base, *code_end; #endif /* We can't pass back an error message if errorptr is nullptr; I guess the best we can do is just return nullptr. */ if (errorptr == nullptr) return nullptr; *errorptr = nullptr; /* However, we can give a message for this error */ if (erroroffset == nullptr) { *errorptr = ERR16; return nullptr; } *erroroffset = 0; if ((options & ~PUBLIC_OPTIONS) != 0) { *errorptr = ERR17; return nullptr; } /* Set up pointers to the individual character tables */ if (tables == nullptr) tables = pcre_default_tables; compile_block.lcc = tables + lcc_offset; compile_block.fcc = tables + fcc_offset; compile_block.cbits = tables + cbits_offset; compile_block.ctypes = tables + ctypes_offset; /* Reflect pattern for debugging output */ DPRINTF(("------------------------------------------------------------------\n")); DPRINTF(("%s\n", pattern)); /* The first thing to do is to make a pass over the pattern to compute the amount of store required to hold the compiled code. This does not have to be perfect as long as errors are overestimates. At the same time we can detect any internal flag settings. Make an attempt to correct for any counted white space if an "extended" flag setting appears late in the pattern. We can't be so clever for #-comments. */ ptr = (const uschar *)(pattern - 1); while ((c = *(++ptr)) != 0) { int min = 0, max = 0; int class_charcount; if ((options & PCRE_EXTENDED) != 0) { if ((compile_block.ctypes[c] & ctype_space) != 0) continue; if (c == '#') { while ((c = *(++ptr)) != 0 && c != '\n') ; continue; } } switch (c) { /* A backslashed item may be an escaped "normal" character or a character type. For a "normal" character, put the pointers and character back so that tests for whitespace etc. in the input are done correctly. */ case '\\': { const uschar *save_ptr = ptr; c = check_escape(&ptr, errorptr, bracount, options, FALSE, &compile_block); if (*errorptr != nullptr) goto PCRE_ERROR_RETURN; if (c >= 0) { ptr = save_ptr; c = '\\'; goto NORMAL_CHAR; } } length++; /* A back reference needs an additional char, plus either one or 5 bytes for a repeat. We also need to keep the value of the highest back reference. */ if (c <= -ESC_REF) { int refnum = -c - ESC_REF; if (refnum > top_backref) top_backref = refnum; length++; /* For single back reference */ if (ptr[1] == '{' && is_counted_repeat(ptr + 2, &compile_block)) { ptr = read_repeat_counts(ptr + 2, &min, &max, errorptr, &compile_block); if (*errorptr != nullptr) goto PCRE_ERROR_RETURN; if ((min == 0 && (max == 1 || max == -1)) || (min == 1 && max == -1)) length++; else length += 5; if (ptr[1] == '?') ptr++; } } continue; case '^': case '.': case '$': case '*': /* These repeats won't be after brackets; */ case '+': /* those are handled separately */ case '?': length++; continue; /* This covers the cases of repeats after a single char, metachar, class, or back reference. */ case '{': if (!is_counted_repeat(ptr + 1, &compile_block)) goto NORMAL_CHAR; ptr = read_repeat_counts(ptr + 1, &min, &max, errorptr, &compile_block); if (*errorptr != nullptr) goto PCRE_ERROR_RETURN; if ((min == 0 && (max == 1 || max == -1)) || (min == 1 && max == -1)) length++; else { length--; /* Uncount the original char or metachar */ if (min == 1) length++; else if (min > 0) length += 4; if (max > 0) length += 4; else length += 2; } if (ptr[1] == '?') ptr++; continue; /* An alternation contains an offset to the next branch or ket. If any ims options changed in the previous branch(es), and/or if we are in a lookbehind assertion, extra space will be needed at the start of the branch. This is handled by branch_extra. */ case '|': length += 3 + branch_extra; continue; /* A character class uses 33 characters. Don't worry about character types that aren't allowed in classes - they'll get picked up during the compile. A character class that contains only one character uses 2 or 3 bytes, depending on whether it is negated or not. Notice this where we can. */ case '[': class_charcount = 0; if (*(++ptr) == '^') ptr++; do { if (*ptr == '\\') { int ch = check_escape(&ptr, errorptr, bracount, options, TRUE, &compile_block); if (*errorptr != nullptr) goto PCRE_ERROR_RETURN; if (-ch == ESC_b) class_charcount++; else class_charcount = 10; } else class_charcount++; ptr++; } while (*ptr != 0 && *ptr != ']'); /* Repeats for negated single chars are handled by the general code */ if (class_charcount == 1) length += 3; else { length += 33; /* A repeat needs either 1 or 5 bytes. */ if (*ptr != 0 && ptr[1] == '{' && is_counted_repeat(ptr + 2, &compile_block)) { ptr = read_repeat_counts(ptr + 2, &min, &max, errorptr, &compile_block); if (*errorptr != nullptr) goto PCRE_ERROR_RETURN; if ((min == 0 && (max == 1 || max == -1)) || (min == 1 && max == -1)) length++; else length += 5; if (ptr[1] == '?') ptr++; } } continue; /* Brackets may be genuine groups or special things */ case '(': branch_newextra = 0; /* Handle special forms of bracket, which all start (? */ if (ptr[1] == '?') { int set, unset; int *optset; switch (c = ptr[2]) { /* Skip over comments entirely */ case '#': ptr += 3; while (*ptr != 0 && *ptr != ')') ptr++; if (*ptr == 0) { *errorptr = ERR18; goto PCRE_ERROR_RETURN; } continue; /* Non-referencing groups and lookaheads just move the pointer on, and then behave like a non-special bracket, except that they don't increment the count of extracting brackets. Ditto for the "once only" bracket, which is in Perl from version 5.005. */ case ':': case '=': case '!': case '>': ptr += 2; break; /* Lookbehinds are in Perl from version 5.005 */ case '<': if (ptr[3] == '=' || ptr[3] == '!') { ptr += 3; branch_newextra = 3; length += 3; /* For the first branch */ break; } *errorptr = ERR24; goto PCRE_ERROR_RETURN; /* Conditionals are in Perl from version 5.005. The bracket must either be followed by a number (for bracket reference) or by an assertion group. */ case '(': if ((compile_block.ctypes[ptr[3]] & ctype_digit) != 0) { ptr += 4; length += 2; while ((compile_block.ctypes[*ptr] & ctype_digit) != 0) ptr++; if (*ptr != ')') { *errorptr = ERR26; goto PCRE_ERROR_RETURN; } } else /* An assertion must follow */ { ptr++; /* Can treat like ':' as far as spacing is concerned */ if (ptr[2] != '?' || strchr("=!<", ptr[3]) == nullptr) { ptr += 2; /* To get right offset in message */ *errorptr = ERR28; goto PCRE_ERROR_RETURN; } } break; /* Else loop checking valid options until ) is met. Anything else is an error. If we are without any brackets, i.e. at top level, the settings act as if specified in the options, so massage the options immediately. This is for backward compatibility with Perl 5.004. */ default: set = unset = 0; optset = &set; ptr += 2; for (;; ptr++) { c = *ptr; switch (c) { case 'i': *optset |= PCRE_CASELESS; continue; case 'm': *optset |= PCRE_MULTILINE; continue; case 's': *optset |= PCRE_DOTALL; continue; case 'x': *optset |= PCRE_EXTENDED; continue; case 'X': *optset |= PCRE_EXTRA; continue; case 'U': *optset |= PCRE_UNGREEDY; continue; case '-': optset = &unset; continue; /* A termination by ')' indicates an options-setting-only item; this is global at top level; otherwise nothing is done here and it is handled during the compiling process on a per-bracket-group basis. */ case ')': if (brastackptr == 0) { options = (options | set) & (~unset); set = unset = 0; /* To save length */ } /* Fall through */ /* A termination by ':' indicates the start of a nested group with the given options set. This is again handled at compile time, but we must allow for compiled space if any of the ims options are set. We also have to allow for resetting space at the end of the group, which is why 4 is added to the length and not just 2. If there are several changes of options within the same group, this will lead to an over-estimate on the length, but this shouldn't matter very much. We also have to allow for resetting options at the start of any alternations, which we do by setting branch_newextra to 2. Finally, we record whether the case-dependent flag ever changes within the regex. This is used by the "required character" code. */ case ':': if (((set | unset) & PCRE_IMS) != 0) { length += 4; branch_newextra = 2; if (((set | unset) & PCRE_CASELESS) != 0) options |= PCRE_ICHANGED; } goto END_OPTIONS; /* Unrecognized option character */ default: *errorptr = ERR12; goto PCRE_ERROR_RETURN; } } /* If we hit a closing bracket, that's it - this is a freestanding option-setting. We need to ensure that branch_extra is updated if necessary. The only values branch_newextra can have here are 0 or 2. If the value is 2, then branch_extra must either be 2 or 5, depending on whether this is a lookbehind group or not. */ END_OPTIONS: if (c == ')') { if (branch_newextra == 2 && (branch_extra == 0 || branch_extra == 3)) branch_extra += branch_newextra; continue; } /* If options were terminated by ':' control comes here. Fall through to handle the group below. */ } } /* Extracting brackets must be counted so we can process escapes in a Perlish way. */ else bracount++; /* Non-special forms of bracket. Save length for computing whole length at end if there's a repeat that requires duplication of the group. Also save the current value of branch_extra, and start the new group with the new value. If non-zero, this will either be 2 for a (?imsx: group, or 3 for a lookbehind assertion. */ if (brastackptr >= sizeof(brastack) / sizeof(int)) { *errorptr = ERR19; goto PCRE_ERROR_RETURN; } bralenstack[brastackptr] = branch_extra; branch_extra = branch_newextra; brastack[brastackptr++] = length; length += 3; continue; /* Handle ket. Look for subsequent max/min; for certain sets of values we have to replicate this bracket up to that many times. If brastackptr is 0 this is an unmatched bracket which will generate an error, but take care not to try to access brastack[-1] when computing the length and restoring the branch_extra value. */ case ')': length += 3; { int minval = 1; int maxval = 1; int duplength; if (brastackptr > 0) { duplength = length - brastack[--brastackptr]; branch_extra = bralenstack[brastackptr]; } else duplength = 0; /* Leave ptr at the final char; for read_repeat_counts this happens automatically; for the others we need an increment. */ if ((c = ptr[1]) == '{' && is_counted_repeat(ptr + 2, &compile_block)) { ptr = read_repeat_counts(ptr + 2, &minval, &maxval, errorptr, &compile_block); if (*errorptr != nullptr) goto PCRE_ERROR_RETURN; } else if (c == '*') { minval = 0; maxval = -1; ptr++; } else if (c == '+') { maxval = -1; ptr++; } else if (c == '?') { minval = 0; ptr++; } /* If the minimum is zero, we have to allow for an OP_BRAZERO before the group, and if the maximum is greater than zero, we have to replicate maxval-1 times; each replication acquires an OP_BRAZERO plus a nesting bracket set - hence the 7. */ if (minval == 0) { length++; if (maxval > 0) length += (maxval - 1) * (duplength + 7); } /* When the minimum is greater than zero, 1 we have to replicate up to minval-1 times, with no additions required in the copies. Then, if there is a limited maximum we have to replicate up to maxval-1 times allowing for a BRAZERO item before each optional copy and nesting brackets for all but one of the optional copies. */ else { length += (minval - 1) * duplength; if (maxval > minval) /* Need this test as maxval=-1 means no limit */ length += (maxval - minval) * (duplength + 7) - 6; } } continue; /* Non-special character. For a run of such characters the length required is the number of characters + 2, except that the maximum run length is 255. We won't get a skipped space or a non-data escape or the start of a # comment as the first character, so the length can't be zero. */ NORMAL_CHAR: default: length += 2; runlength = 0; do { if ((options & PCRE_EXTENDED) != 0) { if ((compile_block.ctypes[c] & ctype_space) != 0) continue; if (c == '#') { while ((c = *(++ptr)) != 0 && c != '\n') ; continue; } } /* Backslash may introduce a data char or a metacharacter; stop the string before the latter. */ if (c == '\\') { const uschar *saveptr = ptr; c = check_escape(&ptr, errorptr, bracount, options, FALSE, &compile_block); if (*errorptr != nullptr) goto PCRE_ERROR_RETURN; if (c < 0) { ptr = saveptr; break; } } /* Ordinary character or single-char escape */ runlength++; } /* This "while" is the end of the "do" above. */ while (runlength < 255 && (compile_block.ctypes[c = *(++ptr)] & ctype_meta) == 0); ptr--; length += runlength; continue; } } length += 4; /* For final KET and END */ if (length > 65539) { *errorptr = ERR20; return nullptr; } /* Compute the size of data block needed and get it, either from malloc or externally provided function. We specify "code[0]" in the offsetof() expression rather than just "code", because it has been reported that one broken compiler fails on "code" because it is also an independent variable. It should make no difference to the value of the offsetof(). */ size = length + offsetof(real_pcre, code[0]); re = (real_pcre *)(pcre_malloc)(size); if (re == nullptr) { *errorptr = ERR21; return nullptr; } /* Put in the magic number and the options. */ re->magic_number = MAGIC_NUMBER; re->options = options; re->tables = tables; /* ICI */ re->size = size; /* ICI */ /* Set up a starting, non-extracting bracket, then compile the expression. On error, *errorptr will be set non-nullptr, so we don't need to look at the result of the function here. */ ptr = (const uschar *)pattern; code = re->code; *code = OP_BRA; bracount = 0; (void)compile_regex(options, -1, &bracount, &code, &ptr, errorptr, FALSE, -1, &reqchar, &countlits, &compile_block); re->top_bracket = bracount; re->top_backref = top_backref; /* If not reached end of pattern on success, there's an excess bracket. */ if (*errorptr == nullptr && *ptr != 0) *errorptr = ERR22; /* Fill in the terminating state and check for disastrous overflow, but if debugging, leave the test till after things are printed out. */ *code++ = OP_END; #ifndef DEBUG if (code - re->code > length) *errorptr = ERR23; #endif /* Give an error if there's back reference to a non-existent capturing subpattern. */ if (top_backref > re->top_bracket) *errorptr = ERR15; /* Failed to compile */ if (*errorptr != nullptr) { (pcre_free)(re); PCRE_ERROR_RETURN: *erroroffset = ptr - (const uschar *)pattern; return nullptr; } /* If the anchored option was not passed, set flag if we can determine that the pattern is anchored by virtue of ^ characters or \A or anything else (such as starting with .* when DOTALL is set). Otherwise, see if we can determine what the first character has to be, because that speeds up unanchored matches no end. If not, see if we can set the PCRE_STARTLINE flag. This is helpful for multiline matches when all branches start with ^. and also when all branches start with .* for non-DOTALL matches. */ if ((options & PCRE_ANCHORED) == 0) { int temp_options = options; if (is_anchored(re->code, &temp_options)) re->options |= PCRE_ANCHORED; else { int ch = find_firstchar(re->code, &temp_options); if (ch >= 0) { re->first_char = ch; re->options |= PCRE_FIRSTSET; } else if (is_startline(re->code)) re->options |= PCRE_STARTLINE; } } /* Save the last required character if there are at least two literal characters on all paths, or if there is no first character setting. */ if (reqchar >= 0 && (countlits > 1 || (re->options & PCRE_FIRSTSET) == 0)) { re->req_char = reqchar; re->options |= PCRE_REQCHSET; } /* Print out the compiled data for debugging */ #ifdef DEBUG printf("Length = %d top_bracket = %d top_backref = %d\n", length, re->top_bracket, re->top_backref); if (re->options != 0) { printf("%s%s%s%s%s%s%s%s%s\n", ((re->options & PCRE_ANCHORED) != 0) ? "anchored " : "", ((re->options & PCRE_CASELESS) != 0) ? "caseless " : "", ((re->options & PCRE_ICHANGED) != 0) ? "case state changed " : "", ((re->options & PCRE_EXTENDED) != 0) ? "extended " : "", ((re->options & PCRE_MULTILINE) != 0) ? "multiline " : "", ((re->options & PCRE_DOTALL) != 0) ? "dotall " : "", ((re->options & PCRE_DOLLAR_ENDONLY) != 0) ? "endonly " : "", ((re->options & PCRE_EXTRA) != 0) ? "extra " : "", ((re->options & PCRE_UNGREEDY) != 0) ? "ungreedy " : ""); } if ((re->options & PCRE_FIRSTSET) != 0) { if (isprint(re->first_char)) printf("First char = %c\n", re->first_char); else printf("First char = \\x%02x\n", re->first_char); } if ((re->options & PCRE_REQCHSET) != 0) { if (isprint(re->req_char)) printf("Req char = %c\n", re->req_char); else printf("Req char = \\x%02x\n", re->req_char); } code_end = code; code_base = code = re->code; while (code < code_end) { int charlength; printf("%3ld ", code - code_base); if (*code >= OP_BRA) { printf("%3d Bra %d", (code[1] << 8) + code[2], *code - OP_BRA); code += 2; } else switch (*code) { case OP_OPT: printf(" %.2x %s", code[1], OP_names[*code]); code++; break; case OP_COND: printf("%3d Cond", (code[1] << 8) + code[2]); code += 2; break; case OP_CREF: printf(" %.2d %s", code[1], OP_names[*code]); code++; break; case OP_CHARS: charlength = *(++code); printf("%3d ", charlength); while (charlength-- > 0) if (isprint(c = *(++code))) printf("%c", c); else printf("\\x%02x", c); break; case OP_KETRMAX: case OP_KETRMIN: case OP_ALT: case OP_KET: case OP_ASSERT: case OP_ASSERT_NOT: case OP_ASSERTBACK: case OP_ASSERTBACK_NOT: case OP_ONCE: printf("%3d %s", (code[1] << 8) + code[2], OP_names[*code]); code += 2; break; case OP_REVERSE: printf("%3d %s", (code[1] << 8) + code[2], OP_names[*code]); code += 2; break; case OP_STAR: case OP_MINSTAR: case OP_PLUS: case OP_MINPLUS: case OP_QUERY: case OP_MINQUERY: case OP_TYPESTAR: case OP_TYPEMINSTAR: case OP_TYPEPLUS: case OP_TYPEMINPLUS: case OP_TYPEQUERY: case OP_TYPEMINQUERY: if (*code >= OP_TYPESTAR) printf(" %s", OP_names[code[1]]); else if (isprint(c = code[1])) printf(" %c", c); else printf(" \\x%02x", c); printf("%s", OP_names[*code++]); break; case OP_EXACT: case OP_UPTO: case OP_MINUPTO: if (isprint(c = code[3])) printf(" %c{", c); else printf(" \\x%02x{", c); if (*code != OP_EXACT) printf("0,"); printf("%d}", (code[1] << 8) + code[2]); if (*code == OP_MINUPTO) printf("?"); code += 3; break; case OP_TYPEEXACT: case OP_TYPEUPTO: case OP_TYPEMINUPTO: printf(" %s{", OP_names[code[3]]); if (*code != OP_TYPEEXACT) printf(","); printf("%d}", (code[1] << 8) + code[2]); if (*code == OP_TYPEMINUPTO) printf("?"); code += 3; break; case OP_NOT: if (isprint(c = *(++code))) printf(" [^%c]", c); else printf(" [^\\x%02x]", c); break; case OP_NOTSTAR: case OP_NOTMINSTAR: case OP_NOTPLUS: case OP_NOTMINPLUS: case OP_NOTQUERY: case OP_NOTMINQUERY: if (isprint(c = code[1])) printf(" [^%c]", c); else printf(" [^\\x%02x]", c); printf("%s", OP_names[*code++]); break; case OP_NOTEXACT: case OP_NOTUPTO: case OP_NOTMINUPTO: if (isprint(c = code[3])) printf(" [^%c]{", c); else printf(" [^\\x%02x]{", c); if (*code != OP_NOTEXACT) printf(","); printf("%d}", (code[1] << 8) + code[2]); if (*code == OP_NOTMINUPTO) printf("?"); code += 3; break; case OP_REF: printf(" \\%d", *(++code)); code++; goto CLASS_REF_REPEAT; case OP_CLASS: { int i, min, max; code++; printf(" ["); for (i = 0; i < 256; i++) { if ((code[i / 8] & (1 << (i & 7))) != 0) { int j; for (j = i + 1; j < 256; j++) if ((code[j / 8] & (1 << (j & 7))) == 0) break; if (i == '-' || i == ']') printf("\\"); if (isprint(i)) printf("%c", i); else printf("\\x%02x", i); if (--j > i) { printf("-"); if (j == '-' || j == ']') printf("\\"); if (isprint(j)) printf("%c", j); else printf("\\x%02x", j); } i = j; } } printf("]"); code += 32; CLASS_REF_REPEAT: switch (*code) { case OP_CRSTAR: case OP_CRMINSTAR: case OP_CRPLUS: case OP_CRMINPLUS: case OP_CRQUERY: case OP_CRMINQUERY: printf("%s", OP_names[*code]); break; case OP_CRRANGE: case OP_CRMINRANGE: min = (code[1] << 8) + code[2]; max = (code[3] << 8) + code[4]; if (max == 0) printf("{%d,}", min); else printf("{%d,%d}", min, max); if (*code == OP_CRMINRANGE) printf("?"); code += 4; break; default: code--; } } break; /* Anything else is just a one-node item */ default: printf(" %s", OP_names[*code]); break; } code++; printf("\n"); } printf("------------------------------------------------------------------\n"); /* This check is done here in the debugging case so that the code that was compiled can be seen. */ if (code - re->code > length) { *errorptr = ERR23; (pcre_free)(re); *erroroffset = ptr - (uschar *)pattern; return nullptr; } #endif return (pcre *)re; } /************************************************* * Match a back-reference * *************************************************/ /* If a back reference hasn't been set, the length that is passed is greater than the number of characters left in the string, so the match fails. Arguments: offset index into the offset vector eptr points into the subject length length to be matched md points to match data block ims the ims flags Returns: TRUE if matched */ static BOOL match_ref(int offset, const uschar *eptr, int length, match_data *md, unsigned long int ims) { const uschar *p = md->start_subject + md->offset_vector[offset]; #ifdef DEBUG if (eptr >= md->end_subject) printf("matching subject <null>"); else { printf("matching subject "); pchars(eptr, length, TRUE, md); } printf(" against backref "); pchars(p, length, FALSE, md); printf("\n"); #endif /* Always fail if not enough characters left */ if (length > md->end_subject - eptr) return FALSE; /* Separate the caselesss case for speed */ if ((ims & PCRE_CASELESS) != 0) { while (length-- > 0) if (md->lcc[*p++] != md->lcc[*eptr++]) return FALSE; } else { while (length-- > 0) if (*p++ != *eptr++) return FALSE; } return TRUE; } /************************************************* * Match from current position * *************************************************/ /* On entry ecode points to the first opcode, and eptr to the first character in the subject string, while eptrb holds the value of eptr at the start of the last bracketed group - used for breaking infinite loops matching zero-length strings. Arguments: eptr pointer in subject ecode position in code offset_top current top pointer md pointer to "static" info for the match ims current /i, /m, and /s options condassert TRUE if called to check a condition assertion eptrb eptr at start of last bracket Returns: TRUE if matched */ static BOOL match(const uschar *eptr, const uschar *ecode, int offset_top, match_data *md, unsigned long int ims, BOOL condassert, const uschar *eptrb) { unsigned long int original_ims = ims; /* Save for resetting on ')' */ for (;;) { int op = (int)*ecode; int min, max, ctype; int i; int c; BOOL minimize = FALSE; /* Opening capturing bracket. If there is space in the offset vector, save the current subject position in the working slot at the top of the vector. We mustn't change the current values of the data slot, because they may be set from a previous iteration of this group, and be referred to by a reference inside the group. If the bracket fails to match, we need to restore this value and also the values of the final offsets, in case they were set by a previous iteration of the same bracket. If there isn't enough space in the offset vector, treat this as if it were a non-capturing bracket. Don't worry about setting the flag for the error case here; that is handled in the code for KET. */ if (op > OP_BRA) { int number = op - OP_BRA; int offset = number << 1; #ifdef DEBUG printf("start bracket %d subject=", number); pchars(eptr, 16, TRUE, md); printf("\n"); #endif if (offset < md->offset_max) { int save_offset1 = md->offset_vector[offset]; int save_offset2 = md->offset_vector[offset + 1]; int save_offset3 = md->offset_vector[md->offset_end - number]; DPRINTF(("saving %d %d %d\n", save_offset1, save_offset2, save_offset3)); md->offset_vector[md->offset_end - number] = eptr - md->start_subject; do { if (match(eptr, ecode + 3, offset_top, md, ims, FALSE, eptr)) return TRUE; ecode += (ecode[1] << 8) + ecode[2]; } while (*ecode == OP_ALT); DPRINTF(("bracket %d failed\n", number)); md->offset_vector[offset] = save_offset1; md->offset_vector[offset + 1] = save_offset2; md->offset_vector[md->offset_end - number] = save_offset3; return FALSE; } /* Insufficient room for saving captured contents */ else op = OP_BRA; } /* Other types of node can be handled by a switch */ switch (op) { case OP_BRA: /* Non-capturing bracket: optimized */ DPRINTF(("start bracket 0\n")); do { if (match(eptr, ecode + 3, offset_top, md, ims, FALSE, eptr)) return TRUE; ecode += (ecode[1] << 8) + ecode[2]; } while (*ecode == OP_ALT); DPRINTF(("bracket 0 failed\n")); return FALSE; /* Conditional group: compilation checked that there are no more than two branches. If the condition is false, skipping the first branch takes us past the end if there is only one branch, but that's OK because that is exactly what going to the ket would do. */ case OP_COND: if (ecode[3] == OP_CREF) /* Condition is extraction test */ { int offset = ecode[4] << 1; /* Doubled reference number */ return match(eptr, ecode + ((offset < offset_top && md->offset_vector[offset] >= 0) ? 5 : 3 + (ecode[1] << 8) + ecode[2]), offset_top, md, ims, FALSE, eptr); } /* The condition is an assertion. Call match() to evaluate it - setting the final argument TRUE causes it to stop at the end of an assertion. */ else { if (match(eptr, ecode + 3, offset_top, md, ims, TRUE, nullptr)) { ecode += 3 + (ecode[4] << 8) + ecode[5]; while (*ecode == OP_ALT) ecode += (ecode[1] << 8) + ecode[2]; } else ecode += (ecode[1] << 8) + ecode[2]; return match(eptr, ecode + 3, offset_top, md, ims, FALSE, eptr); } /* Control never reaches here */ /* Skip over conditional reference data if encountered (should not be) */ case OP_CREF: ecode += 2; break; /* End of the pattern. If PCRE_NOTEMPTY is set, fail if we have matched an empty string - recursion will then try other alternatives, if any. */ case OP_END: if (md->notempty && eptr == md->start_match) return FALSE; md->end_match_ptr = eptr; /* Record where we ended */ md->end_offset_top = offset_top; /* and how many extracts were taken */ return TRUE; /* Change option settings */ case OP_OPT: ims = ecode[1]; ecode += 2; DPRINTF(("ims set to %02lx\n", ims)); break; /* Assertion brackets. Check the alternative branches in turn - the matching won't pass the KET for an assertion. If any one branch matches, the assertion is true. Lookbehind assertions have an OP_REVERSE item at the start of each branch to move the current point backwards, so the code at this level is identical to the lookahead case. */ case OP_ASSERT: case OP_ASSERTBACK: do { if (match(eptr, ecode + 3, offset_top, md, ims, FALSE, nullptr)) break; ecode += (ecode[1] << 8) + ecode[2]; } while (*ecode == OP_ALT); if (*ecode == OP_KET) return FALSE; /* If checking an assertion for a condition, return TRUE. */ if (condassert) return TRUE; /* Continue from after the assertion, updating the offsets high water mark, since extracts may have been taken during the assertion. */ do ecode += (ecode[1] << 8) + ecode[2]; while (*ecode == OP_ALT); ecode += 3; offset_top = md->end_offset_top; continue; /* Negative assertion: all branches must fail to match */ case OP_ASSERT_NOT: case OP_ASSERTBACK_NOT: do { if (match(eptr, ecode + 3, offset_top, md, ims, FALSE, nullptr)) return FALSE; ecode += (ecode[1] << 8) + ecode[2]; } while (*ecode == OP_ALT); if (condassert) return TRUE; ecode += 3; continue; /* Move the subject pointer back. This occurs only at the start of each branch of a lookbehind assertion. If we are too close to the start to move back, this match function fails. */ case OP_REVERSE: eptr -= (ecode[1] << 8) + ecode[2]; if (eptr < md->start_subject) return FALSE; ecode += 3; break; /* "Once" brackets are like assertion brackets except that after a match, the point in the subject string is not moved back. Thus there can never be a move back into the brackets. Check the alternative branches in turn - the matching won't pass the KET for this kind of subpattern. If any one branch matches, we carry on as at the end of a normal bracket, leaving the subject pointer. */ case OP_ONCE: { const uschar *prev = ecode; do { if (match(eptr, ecode + 3, offset_top, md, ims, FALSE, eptr)) break; ecode += (ecode[1] << 8) + ecode[2]; } while (*ecode == OP_ALT); /* If hit the end of the group (which could be repeated), fail */ if (*ecode != OP_ONCE && *ecode != OP_ALT) return FALSE; /* Continue as from after the assertion, updating the offsets high water mark, since extracts may have been taken. */ do ecode += (ecode[1] << 8) + ecode[2]; while (*ecode == OP_ALT); offset_top = md->end_offset_top; eptr = md->end_match_ptr; /* For a non-repeating ket, just continue at this level. This also happens for a repeating ket if no characters were matched in the group. This is the forcible breaking of infinite loops as implemented in Perl 5.005. If there is an options reset, it will get obeyed in the normal course of events. */ if (*ecode == OP_KET || eptr == eptrb) { ecode += 3; break; } /* The repeating kets try the rest of the pattern or restart from the preceding bracket, in the appropriate order. We need to reset any options that changed within the bracket before re-running it, so check the next opcode. */ if (ecode[3] == OP_OPT) { ims = (ims & ~PCRE_IMS) | ecode[4]; DPRINTF(("ims set to %02lx at group repeat\n", ims)); } if (*ecode == OP_KETRMIN) { if (match(eptr, ecode + 3, offset_top, md, ims, FALSE, eptr) || match(eptr, prev, offset_top, md, ims, FALSE, eptr)) return TRUE; } else /* OP_KETRMAX */ { if (match(eptr, prev, offset_top, md, ims, FALSE, eptr) || match(eptr, ecode + 3, offset_top, md, ims, FALSE, eptr)) return TRUE; } } return FALSE; /* An alternation is the end of a branch; scan along to find the end of the bracketed group and go to there. */ case OP_ALT: do ecode += (ecode[1] << 8) + ecode[2]; while (*ecode == OP_ALT); break; /* BRAZERO and BRAMINZERO occur just before a bracket group, indicating that it may occur zero times. It may repeat infinitely, or not at all - i.e. it could be ()* or ()? in the pattern. Brackets with fixed upper repeat limits are compiled as a number of copies, with the optional ones preceded by BRAZERO or BRAMINZERO. */ case OP_BRAZERO: { const uschar *next = ecode + 1; if (match(eptr, next, offset_top, md, ims, FALSE, eptr)) return TRUE; do next += (next[1] << 8) + next[2]; while (*next == OP_ALT); ecode = next + 3; } break; case OP_BRAMINZERO: { const uschar *next = ecode + 1; do next += (next[1] << 8) + next[2]; while (*next == OP_ALT); if (match(eptr, next + 3, offset_top, md, ims, FALSE, eptr)) return TRUE; ecode++; } break; /* End of a group, repeated or non-repeating. If we are at the end of an assertion "group", stop matching and return TRUE, but record the current high water mark for use by positive assertions. Do this also for the "once" (not-backup up) groups. */ case OP_KET: case OP_KETRMIN: case OP_KETRMAX: { const uschar *prev = ecode - (ecode[1] << 8) - ecode[2]; if (*prev == OP_ASSERT || *prev == OP_ASSERT_NOT || *prev == OP_ASSERTBACK || *prev == OP_ASSERTBACK_NOT || *prev == OP_ONCE) { md->end_match_ptr = eptr; /* For ONCE */ md->end_offset_top = offset_top; return TRUE; } /* In all other cases except a conditional group we have to check the group number back at the start and if necessary complete handling an extraction by setting the offsets and bumping the high water mark. */ if (*prev != OP_COND) { int number = *prev - OP_BRA; int offset = number << 1; DPRINTF(("end bracket %d\n", number)); if (number > 0) { if (offset >= md->offset_max) md->offset_overflow = TRUE; else { md->offset_vector[offset] = md->offset_vector[md->offset_end - number]; md->offset_vector[offset + 1] = eptr - md->start_subject; if (offset_top <= offset) offset_top = offset + 2; } } } /* Reset the value of the ims flags, in case they got changed during the group. */ ims = original_ims; DPRINTF(("ims reset to %02lx\n", ims)); /* For a non-repeating ket, just continue at this level. This also happens for a repeating ket if no characters were matched in the group. This is the forcible breaking of infinite loops as implemented in Perl 5.005. If there is an options reset, it will get obeyed in the normal course of events. */ if (*ecode == OP_KET || eptr == eptrb) { ecode += 3; break; } /* The repeating kets try the rest of the pattern or restart from the preceding bracket, in the appropriate order. */ if (*ecode == OP_KETRMIN) { if (match(eptr, ecode + 3, offset_top, md, ims, FALSE, eptr) || match(eptr, prev, offset_top, md, ims, FALSE, eptr)) return TRUE; } else /* OP_KETRMAX */ { if (match(eptr, prev, offset_top, md, ims, FALSE, eptr) || match(eptr, ecode + 3, offset_top, md, ims, FALSE, eptr)) return TRUE; } } return FALSE; /* Start of subject unless notbol, or after internal newline if multiline */ case OP_CIRC: if (md->notbol && eptr == md->start_subject) return FALSE; if ((ims & PCRE_MULTILINE) != 0) { if (eptr != md->start_subject && eptr[-1] != '\n') return FALSE; ecode++; break; } /* ... else fall through */ /* Start of subject assertion */ case OP_SOD: if (eptr != md->start_subject) return FALSE; ecode++; break; /* Assert before internal newline if multiline, or before a terminating newline unless endonly is set, else end of subject unless noteol is set. */ case OP_DOLL: if ((ims & PCRE_MULTILINE) != 0) { if (eptr < md->end_subject) { if (*eptr != '\n') return FALSE; } else { if (md->noteol) return FALSE; } ecode++; break; } else { if (md->noteol) return FALSE; if (!md->endonly) { if (eptr < md->end_subject - 1 || (eptr == md->end_subject - 1 && *eptr != '\n')) return FALSE; ecode++; break; } } /* ... else fall through */ /* End of subject assertion (\z) */ case OP_EOD: if (eptr < md->end_subject) return FALSE; ecode++; break; /* End of subject or ending \n assertion (\Z) */ case OP_EODN: if (eptr < md->end_subject - 1 || (eptr == md->end_subject - 1 && *eptr != '\n')) return FALSE; ecode++; break; /* Word boundary assertions */ case OP_NOT_WORD_BOUNDARY: case OP_WORD_BOUNDARY: { BOOL prev_is_word = (eptr != md->start_subject) && ((md->ctypes[eptr[-1]] & ctype_word) != 0); BOOL cur_is_word = (eptr < md->end_subject) && ((md->ctypes[*eptr] & ctype_word) != 0); if ((*ecode++ == OP_WORD_BOUNDARY) ? cur_is_word == prev_is_word : cur_is_word != prev_is_word) return FALSE; } break; /* Match a single character type; inline for speed */ case OP_ANY: if ((ims & PCRE_DOTALL) == 0 && eptr < md->end_subject && *eptr == '\n') return FALSE; if (eptr++ >= md->end_subject) return FALSE; ecode++; break; case OP_NOT_DIGIT: if (eptr >= md->end_subject || (md->ctypes[*eptr++] & ctype_digit) != 0) return FALSE; ecode++; break; case OP_DIGIT: if (eptr >= md->end_subject || (md->ctypes[*eptr++] & ctype_digit) == 0) return FALSE; ecode++; break; case OP_NOT_WHITESPACE: if (eptr >= md->end_subject || (md->ctypes[*eptr++] & ctype_space) != 0) return FALSE; ecode++; break; case OP_WHITESPACE: if (eptr >= md->end_subject || (md->ctypes[*eptr++] & ctype_space) == 0) return FALSE; ecode++; break; case OP_NOT_WORDCHAR: if (eptr >= md->end_subject || (md->ctypes[*eptr++] & ctype_word) != 0) return FALSE; ecode++; break; case OP_WORDCHAR: if (eptr >= md->end_subject || (md->ctypes[*eptr++] & ctype_word) == 0) return FALSE; ecode++; break; /* Match a back reference, possibly repeatedly. Look past the end of the item to see if there is repeat information following. The code is similar to that for character classes, but repeated for efficiency. Then obey similar code to character type repeats - written out again for speed. However, if the referenced string is the empty string, always treat it as matched, any number of times (otherwise there could be infinite loops). */ case OP_REF: { int length; int offset = ecode[1] << 1; /* Doubled reference number */ ecode += 2; /* Advance past the item */ /* If the reference is unset, set the length to be longer than the amount of subject left; this ensures that every attempt at a match fails. We can't just fail here, because of the possibility of quantifiers with zero minima. */ length = (offset >= offset_top || md->offset_vector[offset] < 0) ? md->end_subject - eptr + 1 : md->offset_vector[offset + 1] - md->offset_vector[offset]; /* Set up for repetition, or handle the non-repeated case */ switch (*ecode) { case OP_CRSTAR: case OP_CRMINSTAR: case OP_CRPLUS: case OP_CRMINPLUS: case OP_CRQUERY: case OP_CRMINQUERY: c = *ecode++ - OP_CRSTAR; minimize = (c & 1) != 0; min = rep_min[c]; /* Pick up values from tables; */ max = rep_max[c]; /* zero for max => infinity */ if (max == 0) max = INT_MAX; break; case OP_CRRANGE: case OP_CRMINRANGE: minimize = (*ecode == OP_CRMINRANGE); min = (ecode[1] << 8) + ecode[2]; max = (ecode[3] << 8) + ecode[4]; if (max == 0) max = INT_MAX; ecode += 5; break; default: /* No repeat follows */ if (!match_ref(offset, eptr, length, md, ims)) return FALSE; eptr += length; continue; /* With the main loop */ } /* If the length of the reference is zero, just continue with the main loop. */ if (length == 0) continue; /* First, ensure the minimum number of matches are present. We get back the length of the reference string explicitly rather than passing the address of eptr, so that eptr can be a variable. */ for (i = 1; i <= min; i++) { if (!match_ref(offset, eptr, length, md, ims)) return FALSE; eptr += length; } /* If min = max, continue at the same level without recursion. They are not both allowed to be zero. */ if (min == max) continue; /* If minimizing, keep trying and advancing the pointer */ if (minimize) { for (i = min;; i++) { if (match(eptr, ecode, offset_top, md, ims, FALSE, eptrb)) return TRUE; if (i >= max || !match_ref(offset, eptr, length, md, ims)) return FALSE; eptr += length; } /* Control never gets here */ } /* If maximizing, find the longest string and work backwards */ else { const uschar *pp = eptr; for (i = min; i < max; i++) { if (!match_ref(offset, eptr, length, md, ims)) break; eptr += length; } while (eptr >= pp) { if (match(eptr, ecode, offset_top, md, ims, FALSE, eptrb)) return TRUE; eptr -= length; } return FALSE; } } /* Control never gets here */ /* Match a character class, possibly repeatedly. Look past the end of the item to see if there is repeat information following. Then obey similar code to character type repeats - written out again for speed. */ case OP_CLASS: { const uschar *data = ecode + 1; /* Save for matching */ ecode += 33; /* Advance past the item */ switch (*ecode) { case OP_CRSTAR: case OP_CRMINSTAR: case OP_CRPLUS: case OP_CRMINPLUS: case OP_CRQUERY: case OP_CRMINQUERY: c = *ecode++ - OP_CRSTAR; minimize = (c & 1) != 0; min = rep_min[c]; /* Pick up values from tables; */ max = rep_max[c]; /* zero for max => infinity */ if (max == 0) max = INT_MAX; break; case OP_CRRANGE: case OP_CRMINRANGE: minimize = (*ecode == OP_CRMINRANGE); min = (ecode[1] << 8) + ecode[2]; max = (ecode[3] << 8) + ecode[4]; if (max == 0) max = INT_MAX; ecode += 5; break; default: /* No repeat follows */ min = max = 1; break; } /* First, ensure the minimum number of matches are present. */ for (i = 1; i <= min; i++) { if (eptr >= md->end_subject) return FALSE; c = *eptr++; if ((data[c / 8] & (1 << (c & 7))) != 0) continue; return FALSE; } /* If max == min we can continue with the main loop without the need to recurse. */ if (min == max) continue; /* If minimizing, keep testing the rest of the expression and advancing the pointer while it matches the class. */ if (minimize) { for (i = min;; i++) { if (match(eptr, ecode, offset_top, md, ims, FALSE, eptrb)) return TRUE; if (i >= max || eptr >= md->end_subject) return FALSE; c = *eptr++; if ((data[c / 8] & (1 << (c & 7))) != 0) continue; return FALSE; } /* Control never gets here */ } /* If maximizing, find the longest possible run, then work backwards. */ else { const uschar *pp = eptr; for (i = min; i < max; eptr++, i++) { if (eptr >= md->end_subject) break; c = *eptr; if ((data[c / 8] & (1 << (c & 7))) != 0) continue; break; } while (eptr >= pp) if (match(eptr--, ecode, offset_top, md, ims, FALSE, eptrb)) return TRUE; return FALSE; } } /* Control never gets here */ /* Match a run of characters */ case OP_CHARS: { int length = ecode[1]; ecode += 2; #ifdef DEBUG /* Sigh. Some compilers never learn. */ if (eptr >= md->end_subject) printf("matching subject <null> against pattern "); else { printf("matching subject "); pchars(eptr, length, TRUE, md); printf(" against pattern "); } pchars(ecode, length, FALSE, md); printf("\n"); #endif if (length > md->end_subject - eptr) return FALSE; if ((ims & PCRE_CASELESS) != 0) { while (length-- > 0) if (md->lcc[*ecode++] != md->lcc[*eptr++]) return FALSE; } else { while (length-- > 0) if (*ecode++ != *eptr++) return FALSE; } } break; /* Match a single character repeatedly; different opcodes share code. */ case OP_EXACT: min = max = (ecode[1] << 8) + ecode[2]; ecode += 3; goto REPEATCHAR; case OP_UPTO: case OP_MINUPTO: min = 0; max = (ecode[1] << 8) + ecode[2]; minimize = *ecode == OP_MINUPTO; ecode += 3; goto REPEATCHAR; case OP_STAR: case OP_MINSTAR: case OP_PLUS: case OP_MINPLUS: case OP_QUERY: case OP_MINQUERY: c = *ecode++ - OP_STAR; minimize = (c & 1) != 0; min = rep_min[c]; /* Pick up values from tables; */ max = rep_max[c]; /* zero for max => infinity */ if (max == 0) max = INT_MAX; /* Common code for all repeated single-character matches. We can give up quickly if there are fewer than the minimum number of characters left in the subject. */ REPEATCHAR: if (min > md->end_subject - eptr) return FALSE; c = *ecode++; /* The code is duplicated for the caseless and caseful cases, for speed, since matching characters is likely to be quite common. First, ensure the minimum number of matches are present. If min = max, continue at the same level without recursing. Otherwise, if minimizing, keep trying the rest of the expression and advancing one matching character if failing, up to the maximum. Alternatively, if maximizing, find the maximum number of characters and work backwards. */ DPRINTF(("matching %c{%d,%d} against subject %.*s\n", c, min, max, max, eptr)); if ((ims & PCRE_CASELESS) != 0) { c = md->lcc[c]; for (i = 1; i <= min; i++) if (c != md->lcc[*eptr++]) return FALSE; if (min == max) continue; if (minimize) { for (i = min;; i++) { if (match(eptr, ecode, offset_top, md, ims, FALSE, eptrb)) return TRUE; if (i >= max || eptr >= md->end_subject || c != md->lcc[*eptr++]) return FALSE; } /* Control never gets here */ } else { const uschar *pp = eptr; for (i = min; i < max; i++) { if (eptr >= md->end_subject || c != md->lcc[*eptr]) break; eptr++; } while (eptr >= pp) if (match(eptr--, ecode, offset_top, md, ims, FALSE, eptrb)) return TRUE; return FALSE; } /* Control never gets here */ } /* Caseful comparisons */ else { for (i = 1; i <= min; i++) if (c != *eptr++) return FALSE; if (min == max) continue; if (minimize) { for (i = min;; i++) { if (match(eptr, ecode, offset_top, md, ims, FALSE, eptrb)) return TRUE; if (i >= max || eptr >= md->end_subject || c != *eptr++) return FALSE; } /* Control never gets here */ } else { const uschar *pp = eptr; for (i = min; i < max; i++) { if (eptr >= md->end_subject || c != *eptr) break; eptr++; } while (eptr >= pp) if (match(eptr--, ecode, offset_top, md, ims, FALSE, eptrb)) return TRUE; return FALSE; } } /* Control never gets here */ /* Match a negated single character */ case OP_NOT: if (eptr >= md->end_subject) return FALSE; ecode++; if ((ims & PCRE_CASELESS) != 0) { if (md->lcc[*ecode++] == md->lcc[*eptr++]) return FALSE; } else { if (*ecode++ == *eptr++) return FALSE; } break; /* Match a negated single character repeatedly. This is almost a repeat of the code for a repeated single character, but I haven't found a nice way of commoning these up that doesn't require a test of the positive/negative option for each character match. Maybe that wouldn't add very much to the time taken, but character matching *is* what this is all about... */ case OP_NOTEXACT: min = max = (ecode[1] << 8) + ecode[2]; ecode += 3; goto REPEATNOTCHAR; case OP_NOTUPTO: case OP_NOTMINUPTO: min = 0; max = (ecode[1] << 8) + ecode[2]; minimize = *ecode == OP_NOTMINUPTO; ecode += 3; goto REPEATNOTCHAR; case OP_NOTSTAR: case OP_NOTMINSTAR: case OP_NOTPLUS: case OP_NOTMINPLUS: case OP_NOTQUERY: case OP_NOTMINQUERY: c = *ecode++ - OP_NOTSTAR; minimize = (c & 1) != 0; min = rep_min[c]; /* Pick up values from tables; */ max = rep_max[c]; /* zero for max => infinity */ if (max == 0) max = INT_MAX; /* Common code for all repeated single-character matches. We can give up quickly if there are fewer than the minimum number of characters left in the subject. */ REPEATNOTCHAR: if (min > md->end_subject - eptr) return FALSE; c = *ecode++; /* The code is duplicated for the caseless and caseful cases, for speed, since matching characters is likely to be quite common. First, ensure the minimum number of matches are present. If min = max, continue at the same level without recursing. Otherwise, if minimizing, keep trying the rest of the expression and advancing one matching character if failing, up to the maximum. Alternatively, if maximizing, find the maximum number of characters and work backwards. */ DPRINTF(("negative matching %c{%d,%d} against subject %.*s\n", c, min, max, max, eptr)); if ((ims & PCRE_CASELESS) != 0) { c = md->lcc[c]; for (i = 1; i <= min; i++) if (c == md->lcc[*eptr++]) return FALSE; if (min == max) continue; if (minimize) { for (i = min;; i++) { if (match(eptr, ecode, offset_top, md, ims, FALSE, eptrb)) return TRUE; if (i >= max || eptr >= md->end_subject || c == md->lcc[*eptr++]) return FALSE; } /* Control never gets here */ } else { const uschar *pp = eptr; for (i = min; i < max; i++) { if (eptr >= md->end_subject || c == md->lcc[*eptr]) break; eptr++; } while (eptr >= pp) if (match(eptr--, ecode, offset_top, md, ims, FALSE, eptrb)) return TRUE; return FALSE; } /* Control never gets here */ } /* Caseful comparisons */ else { for (i = 1; i <= min; i++) if (c == *eptr++) return FALSE; if (min == max) continue; if (minimize) { for (i = min;; i++) { if (match(eptr, ecode, offset_top, md, ims, FALSE, eptrb)) return TRUE; if (i >= max || eptr >= md->end_subject || c == *eptr++) return FALSE; } /* Control never gets here */ } else { const uschar *pp = eptr; for (i = min; i < max; i++) { if (eptr >= md->end_subject || c == *eptr) break; eptr++; } while (eptr >= pp) if (match(eptr--, ecode, offset_top, md, ims, FALSE, eptrb)) return TRUE; return FALSE; } } /* Control never gets here */ /* Match a single character type repeatedly; several different opcodes share code. This is very similar to the code for single characters, but we repeat it in the interests of efficiency. */ case OP_TYPEEXACT: min = max = (ecode[1] << 8) + ecode[2]; minimize = TRUE; ecode += 3; goto REPEATTYPE; case OP_TYPEUPTO: case OP_TYPEMINUPTO: min = 0; max = (ecode[1] << 8) + ecode[2]; minimize = *ecode == OP_TYPEMINUPTO; ecode += 3; goto REPEATTYPE; case OP_TYPESTAR: case OP_TYPEMINSTAR: case OP_TYPEPLUS: case OP_TYPEMINPLUS: case OP_TYPEQUERY: case OP_TYPEMINQUERY: c = *ecode++ - OP_TYPESTAR; minimize = (c & 1) != 0; min = rep_min[c]; /* Pick up values from tables; */ max = rep_max[c]; /* zero for max => infinity */ if (max == 0) max = INT_MAX; /* Common code for all repeated single character type matches */ REPEATTYPE: ctype = *ecode++; /* Code for the character type */ /* First, ensure the minimum number of matches are present. Use inline code for maximizing the speed, and do the type test once at the start (i.e. keep it out of the loop). Also test that there are at least the minimum number of characters before we start. */ if (min > md->end_subject - eptr) return FALSE; if (min > 0) switch (ctype) { case OP_ANY: if ((ims & PCRE_DOTALL) == 0) { for (i = 1; i <= min; i++) if (*eptr++ == '\n') return FALSE; } else eptr += min; break; case OP_NOT_DIGIT: for (i = 1; i <= min; i++) if ((md->ctypes[*eptr++] & ctype_digit) != 0) return FALSE; break; case OP_DIGIT: for (i = 1; i <= min; i++) if ((md->ctypes[*eptr++] & ctype_digit) == 0) return FALSE; break; case OP_NOT_WHITESPACE: for (i = 1; i <= min; i++) if ((md->ctypes[*eptr++] & ctype_space) != 0) return FALSE; break; case OP_WHITESPACE: for (i = 1; i <= min; i++) if ((md->ctypes[*eptr++] & ctype_space) == 0) return FALSE; break; case OP_NOT_WORDCHAR: for (i = 1; i <= min; i++) if ((md->ctypes[*eptr++] & ctype_word) != 0) return FALSE; break; case OP_WORDCHAR: for (i = 1; i <= min; i++) if ((md->ctypes[*eptr++] & ctype_word) == 0) return FALSE; break; } /* If min = max, continue at the same level without recursing */ if (min == max) continue; /* If minimizing, we have to test the rest of the pattern before each subsequent match. */ if (minimize) { for (i = min;; i++) { if (match(eptr, ecode, offset_top, md, ims, FALSE, eptrb)) return TRUE; if (i >= max || eptr >= md->end_subject) return FALSE; c = *eptr++; switch (ctype) { case OP_ANY: if ((ims & PCRE_DOTALL) == 0 && c == '\n') return FALSE; break; case OP_NOT_DIGIT: if ((md->ctypes[c] & ctype_digit) != 0) return FALSE; break; case OP_DIGIT: if ((md->ctypes[c] & ctype_digit) == 0) return FALSE; break; case OP_NOT_WHITESPACE: if ((md->ctypes[c] & ctype_space) != 0) return FALSE; break; case OP_WHITESPACE: if ((md->ctypes[c] & ctype_space) == 0) return FALSE; break; case OP_NOT_WORDCHAR: if ((md->ctypes[c] & ctype_word) != 0) return FALSE; break; case OP_WORDCHAR: if ((md->ctypes[c] & ctype_word) == 0) return FALSE; break; } } /* Control never gets here */ } /* If maximizing it is worth using inline code for speed, doing the type test once at the start (i.e. keep it out of the loop). */ else { const uschar *pp = eptr; switch (ctype) { case OP_ANY: if ((ims & PCRE_DOTALL) == 0) { for (i = min; i < max; i++) { if (eptr >= md->end_subject || *eptr == '\n') break; eptr++; } } else { c = max - min; if (c > md->end_subject - eptr) c = md->end_subject - eptr; eptr += c; } break; case OP_NOT_DIGIT: for (i = min; i < max; i++) { if (eptr >= md->end_subject || (md->ctypes[*eptr] & ctype_digit) != 0) break; eptr++; } break; case OP_DIGIT: for (i = min; i < max; i++) { if (eptr >= md->end_subject || (md->ctypes[*eptr] & ctype_digit) == 0) break; eptr++; } break; case OP_NOT_WHITESPACE: for (i = min; i < max; i++) { if (eptr >= md->end_subject || (md->ctypes[*eptr] & ctype_space) != 0) break; eptr++; } break; case OP_WHITESPACE: for (i = min; i < max; i++) { if (eptr >= md->end_subject || (md->ctypes[*eptr] & ctype_space) == 0) break; eptr++; } break; case OP_NOT_WORDCHAR: for (i = min; i < max; i++) { if (eptr >= md->end_subject || (md->ctypes[*eptr] & ctype_word) != 0) break; eptr++; } break; case OP_WORDCHAR: for (i = min; i < max; i++) { if (eptr >= md->end_subject || (md->ctypes[*eptr] & ctype_word) == 0) break; eptr++; } break; } while (eptr >= pp) if (match(eptr--, ecode, offset_top, md, ims, FALSE, eptrb)) return TRUE; return FALSE; } /* Control never gets here */ /* There's been some horrible disaster. */ default: DPRINTF(("Unknown opcode %d\n", *ecode)); md->errorcode = PCRE_ERROR_UNKNOWN_NODE; return FALSE; } /* Do not stick any code in here without much thought; it is assumed that "continue" in the code above comes out to here to repeat the main loop. */ } /* End of main loop */ /* Control never reaches here */ } /************************************************* * Execute a Regular Expression * *************************************************/ /* This function applies a compiled re to a subject string and picks out portions of the string if it matches. Two elements in the vector are set for each substring: the offsets to the start and end of the substring. Arguments: external_re points to the compiled expression external_extra points to "hints" from pcre_study() or is nullptr subject points to the subject string length length of subject string (may contain binary zeros) start_offset where to start in the subject string options option bits offsets points to a vector of ints to be filled in with offsets offsetcount the number of elements in the vector Returns: > 0 => success; value is the number of elements filled in = 0 => success, but offsets is not big enough -1 => failed to match < -1 => some kind of unexpected problem */ int pcre_exec(const pcre *external_re, const pcre_extra *external_extra, const char *subject, int length, int start_offset, int options, int *offsets, int offsetcount) { int resetcount, ocount; int first_char = -1; int req_char = -1; int req_char2 = -1; unsigned long int ims = 0; match_data match_block; const uschar *start_bits = nullptr; const uschar *start_match = (const uschar *)subject + start_offset; const uschar *end_subject; const uschar *req_char_ptr = start_match - 1; const real_pcre *re = (const real_pcre *)external_re; const real_pcre_extra *extra = (const real_pcre_extra *)external_extra; BOOL using_temporary_offsets = FALSE; BOOL anchored = ((re->options | options) & PCRE_ANCHORED) != 0; BOOL startline = (re->options & PCRE_STARTLINE) != 0; if ((options & ~PUBLIC_EXEC_OPTIONS) != 0) return PCRE_ERROR_BADOPTION; if (re == nullptr || subject == nullptr || (offsets == nullptr && offsetcount > 0)) return PCRE_ERROR_NULL; if (re->magic_number != MAGIC_NUMBER) return PCRE_ERROR_BADMAGIC; match_block.start_subject = (const uschar *)subject; match_block.end_subject = match_block.start_subject + length; end_subject = match_block.end_subject; match_block.endonly = (re->options & PCRE_DOLLAR_ENDONLY) != 0; match_block.notbol = (options & PCRE_NOTBOL) != 0; match_block.noteol = (options & PCRE_NOTEOL) != 0; match_block.notempty = (options & PCRE_NOTEMPTY) != 0; match_block.errorcode = PCRE_ERROR_NOMATCH; /* Default error */ match_block.lcc = re->tables + lcc_offset; match_block.ctypes = re->tables + ctypes_offset; /* The ims options can vary during the matching as a result of the presence of (?ims) items in the pattern. They are kept in a local variable so that restoring at the exit of a group is easy. */ ims = re->options & (PCRE_CASELESS | PCRE_MULTILINE | PCRE_DOTALL); /* If the expression has got more back references than the offsets supplied can hold, we get a temporary bit of working store to use during the matching. Otherwise, we can use the vector supplied, rounding down its size to a multiple of 3. */ ocount = offsetcount - (offsetcount % 3); if (re->top_backref > 0 && re->top_backref >= ocount / 3) { ocount = re->top_backref * 3 + 3; match_block.offset_vector = (int *)(pcre_malloc)(ocount * sizeof(int)); if (match_block.offset_vector == nullptr) return PCRE_ERROR_NOMEMORY; using_temporary_offsets = TRUE; DPRINTF(("Got memory to hold back references\n")); } else match_block.offset_vector = offsets; match_block.offset_end = ocount; match_block.offset_max = (2 * ocount) / 3; match_block.offset_overflow = FALSE; /* Compute the minimum number of offsets that we need to reset each time. Doing this makes a huge difference to execution time when there aren't many brackets in the pattern. */ resetcount = 2 + re->top_bracket * 2; if (resetcount > offsetcount) resetcount = ocount; /* Reset the working variable associated with each extraction. These should never be used unless previously set, but they get saved and restored, and so we initialize them to avoid reading uninitialized locations. */ if (match_block.offset_vector != nullptr) { int *iptr = match_block.offset_vector + ocount; int *iend = iptr - resetcount / 2 + 1; while (--iptr >= iend) *iptr = -1; } /* Set up the first character to match, if available. The first_char value is never set for an anchored regular expression, but the anchoring may be forced at run time, so we have to test for anchoring. The first char may be unset for an unanchored pattern, of course. If there's no first char and the pattern was studied, there may be a bitmap of possible first characters. */ if (!anchored) { if ((re->options & PCRE_FIRSTSET) != 0) { first_char = re->first_char; if ((ims & PCRE_CASELESS) != 0) first_char = match_block.lcc[first_char]; } else if (!startline && extra != nullptr && (extra->options & PCRE_STUDY_MAPPED) != 0) start_bits = extra->start_bits; } /* For anchored or unanchored matches, there may be a "last known required character" set. If the PCRE_CASELESS is set, implying that the match starts caselessly, or if there are any changes of this flag within the regex, set up both cases of the character. Otherwise set the two values the same, which will avoid duplicate testing (which takes significant time). This covers the vast majority of cases. It will be suboptimal when the case flag changes in a regex and the required character in fact is caseful. */ if ((re->options & PCRE_REQCHSET) != 0) { req_char = re->req_char; req_char2 = ((re->options & (PCRE_CASELESS | PCRE_ICHANGED)) != 0) ? (re->tables + fcc_offset)[req_char] : req_char; } /* Loop for handling unanchored repeated matching attempts; for anchored regexs the loop runs just once. */ do { int rc; int *iptr = match_block.offset_vector; int *iend = iptr + resetcount; /* Reset the maximum number of extractions we might see. */ while (iptr < iend) *iptr++ = -1; /* Advance to a unique first char if possible */ if (first_char >= 0) { if ((ims & PCRE_CASELESS) != 0) while (start_match < end_subject && match_block.lcc[*start_match] != first_char) start_match++; else while (start_match < end_subject && *start_match != first_char) start_match++; } /* Or to just after \n for a multiline match if possible */ else if (startline) { if (start_match > match_block.start_subject + start_offset) { while (start_match < end_subject && start_match[-1] != '\n') start_match++; } } /* Or to a non-unique first char after study */ else if (start_bits != nullptr) { while (start_match < end_subject) { int c = *start_match; if ((start_bits[c / 8] & (1 << (c & 7))) == 0) start_match++; else break; } } #ifdef DEBUG /* Sigh. Some compilers never learn. */ printf(">>>> Match against: "); pchars(start_match, end_subject - start_match, TRUE, &match_block); printf("\n"); #endif /* If req_char is set, we know that that character must appear in the subject for the match to succeed. If the first character is set, req_char must be later in the subject; otherwise the test starts at the match point. This optimization can save a huge amount of backtracking in patterns with nested unlimited repeats that aren't going to match. We don't know what the state of case matching may be when this character is hit, so test for it in both its cases if necessary. However, the different cased versions will not be set up unless PCRE_CASELESS was given or the casing state changes within the regex. Writing separate code makes it go faster, as does using an autoincrement and backing off on a match. */ if (req_char >= 0) { const uschar *p = start_match + ((first_char >= 0) ? 1 : 0); /* We don't need to repeat the search if we haven't yet reached the place we found it at last time. */ if (p > req_char_ptr) { /* Do a single test if no case difference is set up */ if (req_char == req_char2) { while (p < end_subject) { if (*p++ == req_char) { p--; break; } } } /* Otherwise test for either case */ else { while (p < end_subject) { int pp = *p++; if (pp == req_char || pp == req_char2) { p--; break; } } } /* If we can't find the required character, break the matching loop */ if (p >= end_subject) break; /* If we have found the required character, save the point where we found it, so that we don't search again next time round the loop if the start hasn't passed this character yet. */ req_char_ptr = p; } } /* When a match occurs, substrings will be set for all internal extractions; we just need to set up the whole thing as substring 0 before returning. If there were too many extractions, set the return code to zero. In the case where we had to get some local store to hold offsets for backreferences, copy those back references that we can. In this case there need not be overflow if certain parts of the pattern were not used. */ match_block.start_match = start_match; if (!match(start_match, re->code, 2, &match_block, ims, FALSE, start_match)) continue; /* Copy the offset information from temporary store if necessary */ if (using_temporary_offsets) { if (offsetcount >= 4) { memcpy(offsets + 2, match_block.offset_vector + 2, (offsetcount - 2) * sizeof(int)); DPRINTF(("Copied offsets from temporary memory\n")); } if (match_block.end_offset_top > offsetcount) match_block.offset_overflow = TRUE; DPRINTF(("Freeing temporary memory\n")); (pcre_free)(match_block.offset_vector); } rc = match_block.offset_overflow ? 0 : match_block.end_offset_top / 2; if (match_block.offset_end < 2) rc = 0; else { offsets[0] = start_match - match_block.start_subject; offsets[1] = match_block.end_match_ptr - match_block.start_subject; } DPRINTF((">>>> returning %d\n", rc)); return rc; } /* This "while" is the end of the "do" above */ while (!anchored && match_block.errorcode == PCRE_ERROR_NOMATCH && start_match++ < end_subject); if (using_temporary_offsets) { DPRINTF(("Freeing temporary memory\n")); (pcre_free)(match_block.offset_vector); } DPRINTF((">>>> returning %d\n", match_block.errorcode)); return match_block.errorcode; } /* End of pcre.c */

[ "an@atrn.org" ]

an@atrn.org

09bd8d58de8093724d50665c4d0911d896b3f20b

11836fe43d9fe469b0b8d3c2c7b037604469cc32

/void-pointer.cpp

95438f55513ed1db3ac83f7e611c231513d70f80

[]

no_license

Ghassen-kh/Cpp_Training

9f188f0a98d0e6feb84e0b7a3a1b3e1da773def9

db99ce77d6c98c67c452a6a0ca908667c7cd23a5

refs/heads/main

2023-04-12T05:57:09.067943

2021-05-11T17:58:13

346,858,231

0

null

UTF-8

C++

false

269

cpp

#include <iostream> void * func (void *); int main(int argc, char ** argv){ printf("this is void pointer.c\n"); const char * cp="1235"; int * vp=(int *) func((void *)cp); printf("%08x\n",* vp); return 0; } void * func (void * vp){ return vp; }

[ "ghassen.khalouaoui15@gmail.com" ]

ghassen.khalouaoui15@gmail.com

6d86917b8e119f719624164176375ec9a2c299cb

57d30906de95e20fb45216925791cb809a11b7f1

/ase/misc/t19.cpp

0ad4aa01a3e098a99d4cab9a507e57efcb2b0c90

[ "MIT" ]

permissive

ahiguti/ase

ad782902ca3a8713b155769413fc5d9fd537c347

f6bc5f337fe7df6eabf676660d9189d3c474150d

refs/heads/main

2021-06-13T17:39:25.280776

2012-06-15T21:01:17

4,680,010

1

0

null

UTF-8

C++

false

775

cpp

#include <ase/asecpnfobj.hpp> namespace { struct fobj { ase_variant operator ()(ASE_Component::Library& lib, const ase_variant *args, ase_size_type nargs) { typedef ase_variant Var; Var Test = lib.GetGlobals().get("Native").get("Util").get("Test"); ase_int mid_sum = Test.GetMethodId("Sum"); ase_int mid_add = Test.get_instance_method_id("Add"); ase_variant r; for (int i = 0; i < 10000000; ++i) { ase_variant obj = Test.invoke(); obj.minvoke(mid_add, 1); } r = Test.minvoke(mid_sum, 10, 20, 30); std::cout << r << std::endl; return r; } }; }; // anonymous namespace extern "C" void ASE_NewVariantFactory(ASE_VariantFactoryPtr& ap_r) { ASE_ComponentFuncObject::NewLibraryFactory<fobj, false>(ap_r); }

[ "ahiguti100@gmail.com" ]

ahiguti100@gmail.com

e7d6a347ad55f66135908648af23c6da9bafdec4

79f0db22eabee887ca366fae743a7df7e0eea24a

/user/MIT_Controller/Controllers/NeuralMPC/NeuralRobotState.h

226e03705dcfe4ae5989e1ca907e81fdcc4af112

[ "MIT" ]

permissive

gmargo11/Cheetah-Software

61130acd948a7650558e7828a1739d41d6e2b2e7

02aa003393f1d831e973e596d43f1f0bf0d8f754

refs/heads/master

2023-01-31T09:36:53.093599

2020-05-27T22:42:38

260,376,293

1

0

MIT

2020-05-01T04:06:16

2020-05-01T04:06:15

null

UTF-8

C++

false

570

h

#ifndef Neural_RobotState #define Neural_RobotState #include <eigen3/Eigen/Dense> #include "../convexMPC/common_types.h" using Eigen::Matrix; using Eigen::Quaternionf; class NeuralRobotState { public: void set(flt* p, flt* v, flt* q, flt* w, flt* r, flt yaw); //void compute_rotations(); void print(); Matrix<fpt,3,1> p,v,w; Matrix<fpt,3,4> r_feet; Matrix<fpt,3,3> R; Matrix<fpt,3,3> R_yaw; Matrix<fpt,3,3> I_body; Quaternionf q; fpt yaw; fpt m = 9; //private: }; #endif

[ "gmargo@mit.edu" ]

gmargo@mit.edu

27d26de63bc6c1f8133cf82b835e98e3df8e490d

c3147a539c3bad6d24105df990146e9bffcae1a5

/leetcode/32.longest-valid-parentheses.cpp

d92d4b1f9744b24d06438e41ad744c1fd782c6a2

[]

no_license

eataix/algorithms

6158a93d02d53be4940d7d2db09393915081b267

6c61a6ae52707ac6f8a01bfc9344ca48be9736f8

refs/heads/master

2021-03-22T00:21:23.926258

2018-10-20T05:07:55

2018-10-20T05:57:53

19,340,004

0

null

UTF-8

C++

false

1,765

cpp

#include <stack> #include <string> using namespace std; /* * [32] Longest Valid Parentheses * * https://leetcode.com/problems/longest-valid-parentheses/description/ * * algorithms * Hard (23.45%) * Total Accepted: 133.1K * Total Submissions: 567.6K * Testcase Example: '"(()"' * * Given a string containing just the characters '(' and ')', find the length * of the longest valid (well-formed) parentheses substring. * * Example 1: * * * Input: "(()" * Output: 2 * Explanation: The longest valid parentheses substring is "()" * * * Example 2: * * * Input: ")()())" * Output: 4 * Explanation: The longest valid parentheses substring is "()()" * * */ class Solution { public: int longestValidParentheses(string s) { int left = 0; int right = 0; int maxLen = 0; for (int i = 0; i < s.size(); ++i) { if (s[i] == '(') { left += 1; } else { right += 1; } if (left == right) { maxLen = max(maxLen, 2 * right); } else if (right > left) { left = right = 0; } } left = right = 0; for (int i = s.size() - 1; i >= 0; --i) { if (s[i] == '(') { left += 1; } else { right += 1; } if (left == right) { maxLen = max(maxLen, 2 * left); } else if (left > right) { left = right = 0; } } return maxLen; } int longestValidParentheses2(string s) { int res = 0; stack<int> st; st.push(-1); for (int i = 0; i < s.size(); ++i) { if (s[i] == '(') { st.push(i); } else { st.pop(); if (st.empty()) { st.push(i); } else { res = max(res, i - st.top()); } } } return res; } };

[ "_@freeaddr.info" ]

_@freeaddr.info

89e9c89a9894fa888acb74294066017ed09bdeb0

27234219edb7095de9453ae9d9130aaf7f94f35c

/lab5/VectorsOperation.cpp

6061f6629995074ed4c3712b2f472e0801306378

[]

no_license

andruga225/lab5

226bf0ec6cc573bee8855879c283f767af4de8fd

c523057a7adb20fe0db8291c080f1224a23c07a2

refs/heads/master

2023-09-02T22:13:59.622116

2021-11-25T10:19:26

427,715,899

0

null

UTF-8

C++

false

1,314

cpp

#include "VectorsOperation.h" #include <algorithm> std::vector<double> SubtractionVector(std::vector<double> a, std::vector<double> b) { std::vector<double> res; for (int i = 0; i < a.size(); ++i) res.push_back(a[i] - b[i]); return res; } double FirstVectorNorm(std::vector<double> a) { return abs(*std::max_element(a.begin(), a.end(), [](double x, double y) {return abs(x) < abs(y); })); } double SecondVectorNorm(std::vector<double> a) { double sum = 0; for (int i = 0; i < a.size(); ++i) sum += std::abs(a[i]); return sum; } double ScalarMult(std::vector<double> a, std::vector<double> b) { double sum = 0; for (int i = 0; i < a.size(); ++i) sum += a[i] * b[i]; return sum; } double ThirdVectorNorm(std::vector<double> a) { return sqrt(ScalarMult(a, a)); } std::vector<double> AdditionVector(std::vector<double> A, std::vector<double> B) // ÿ íå ïîìíþ åñòü ëè ýòî â òâîåé áèáå èëè íåò { std::vector<double> res; for (int i = 0; i < A.size(); ++i) res.push_back(A[i] + B[i]); return res; } std::vector<double> MultVectorNum(std::vector<double> A, double B) // ÿ íå ïîìíþ åñòü ëè ýòî â òâîåé áèáå èëè íåò { std::vector<double> res; for (int i = 0; i < A.size(); ++i) res.push_back(A[i] * B); return res; }

[ "ryanworld225@yandex.ru" ]

ryanworld225@yandex.ru

571b28381d6bf7710800963b694c0e83ac415d71

2cf838b54b556987cfc49f42935f8aa7563ea1f4

/aws-cpp-sdk-ec2/include/aws/ec2/model/AssociateClientVpnTargetNetworkResponse.h

27570f63df09982306493a74cf96c43d2c06c3a9

[ "MIT", "Apache-2.0", "JSON" ]

permissive

QPC-database/aws-sdk-cpp

d11e9f0ff6958c64e793c87a49f1e034813dac32

9f83105f7e07fe04380232981ab073c247d6fc85

refs/heads/main

2023-06-14T17:41:04.817304

2021-07-09T20:28:20

384,714,703

1

0

Apache-2.0

2021-07-10T14:16:41

null

UTF-8

C++

false

3,971

h

/** * Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved. * SPDX-License-Identifier: Apache-2.0. */ #pragma once #include <aws/ec2/EC2_EXPORTS.h> #include <aws/core/utils/memory/stl/AWSString.h> #include <aws/ec2/model/AssociationStatus.h> #include <aws/ec2/model/ResponseMetadata.h> #include <utility> namespace Aws { template<typename RESULT_TYPE> class AmazonWebServiceResult; namespace Utils { namespace Xml { class XmlDocument; } // namespace Xml } // namespace Utils namespace EC2 { namespace Model { class AWS_EC2_API AssociateClientVpnTargetNetworkResponse { public: AssociateClientVpnTargetNetworkResponse(); AssociateClientVpnTargetNetworkResponse(const Aws::AmazonWebServiceResult<Aws::Utils::Xml::XmlDocument>& result); AssociateClientVpnTargetNetworkResponse& operator=(const Aws::AmazonWebServiceResult<Aws::Utils::Xml::XmlDocument>& result); /** * The unique ID of the target network association. */ inline const Aws::String& GetAssociationId() const{ return m_associationId; } /** * The unique ID of the target network association. */ inline void SetAssociationId(const Aws::String& value) { m_associationId = value; } /** * The unique ID of the target network association. */ inline void SetAssociationId(Aws::String&& value) { m_associationId = std::move(value); } /** * The unique ID of the target network association. */ inline void SetAssociationId(const char* value) { m_associationId.assign(value); } /** * The unique ID of the target network association. */ inline AssociateClientVpnTargetNetworkResponse& WithAssociationId(const Aws::String& value) { SetAssociationId(value); return *this;} /** * The unique ID of the target network association. */ inline AssociateClientVpnTargetNetworkResponse& WithAssociationId(Aws::String&& value) { SetAssociationId(std::move(value)); return *this;} /** * The unique ID of the target network association. */ inline AssociateClientVpnTargetNetworkResponse& WithAssociationId(const char* value) { SetAssociationId(value); return *this;} /** * The current state of the target network association. */ inline const AssociationStatus& GetStatus() const{ return m_status; } /** * The current state of the target network association. */ inline void SetStatus(const AssociationStatus& value) { m_status = value; } /** * The current state of the target network association. */ inline void SetStatus(AssociationStatus&& value) { m_status = std::move(value); } /** * The current state of the target network association. */ inline AssociateClientVpnTargetNetworkResponse& WithStatus(const AssociationStatus& value) { SetStatus(value); return *this;} /** * The current state of the target network association. */ inline AssociateClientVpnTargetNetworkResponse& WithStatus(AssociationStatus&& value) { SetStatus(std::move(value)); return *this;} inline const ResponseMetadata& GetResponseMetadata() const{ return m_responseMetadata; } inline void SetResponseMetadata(const ResponseMetadata& value) { m_responseMetadata = value; } inline void SetResponseMetadata(ResponseMetadata&& value) { m_responseMetadata = std::move(value); } inline AssociateClientVpnTargetNetworkResponse& WithResponseMetadata(const ResponseMetadata& value) { SetResponseMetadata(value); return *this;} inline AssociateClientVpnTargetNetworkResponse& WithResponseMetadata(ResponseMetadata&& value) { SetResponseMetadata(std::move(value)); return *this;} private: Aws::String m_associationId; AssociationStatus m_status; ResponseMetadata m_responseMetadata; }; } // namespace Model } // namespace EC2 } // namespace Aws

[ "aws-sdk-cpp-automation@github.com" ]

aws-sdk-cpp-automation@github.com

e4bec3ac6c41c7ee263c85179eb96275c87d30b4

7774f5fa84edbe372df5bbb536e8b07b51306681

/Temp/StagingArea/Data/il2cppOutput/Il2CppMethodPointerTable.cpp

b77179e1b6503559c02fe8a36ed3b87b2fd9b3f1

[]

no_license

1jeffcohen/Mr-Turtle-Breaks-Free

677f4792b30ac3041e1454e6027a64478ec18a05

360506196b46e3b8234cf732230b266e655975e1

refs/heads/master

2016-09-01T16:24:29.294516

2015-10-08T21:46:23

43,917,971

0

null

UTF-8

C++

false

332,758

cpp

#include "il2cpp-config.h" #ifndef _MSC_VER # include <alloca.h> #else # include <malloc.h> #endif #include "class-internals.h" #include "codegen/il2cpp-codegen.h" extern "C" void m0 (); extern "C" void m1 (); extern "C" void m2 (); extern "C" void m3 (); extern "C" void m4 (); extern "C" void m5 (); extern "C" void m6 (); extern "C" void m7 (); extern "C" void m8 (); extern "C" void m9 (); extern "C" void m10 (); extern "C" void m11 (); extern "C" void m12 (); extern "C" void m13 (); extern "C" void m14 (); extern "C" void m15 (); extern "C" void m16 (); extern "C" void m17 (); extern "C" void m18 (); extern "C" void m19 (); extern "C" void m20 (); extern "C" void m21 (); extern "C" void m22 (); extern "C" void m23 (); extern "C" void m24 (); extern "C" void m25 (); extern "C" void m26 (); extern "C" void m27 (); extern "C" void m28 (); extern "C" void m29 (); extern "C" void m30 (); extern "C" void m31 (); extern "C" void m32 (); extern "C" void m33 (); extern "C" void m81 (); extern "C" void m82 (); extern "C" void m83 (); extern "C" void m84 (); extern "C" void m85 (); extern "C" void m86 (); extern "C" void m87 (); extern "C" void m88 (); extern "C" void m89 (); extern "C" void m90 (); extern "C" void m91 (); extern "C" void m92 (); extern "C" void m93 (); extern "C" void m94 (); extern "C" void m95 (); extern "C" void m96 (); extern "C" void m97 (); extern "C" void m98 (); extern "C" void m99 (); extern "C" void m100 (); extern "C" void m101 (); extern "C" void m102 (); extern "C" void m103 (); extern "C" void m104 (); extern "C" void m105 (); extern "C" void m106 (); extern "C" void m107 (); extern "C" void m108 (); extern "C" void m109 (); extern "C" void m110 (); extern "C" void m111 (); extern "C" void m112 (); extern "C" void m113 (); extern "C" void m114 (); extern "C" void m115 (); extern "C" void m116 (); extern "C" void m117 (); extern "C" void m118 (); extern "C" void m119 (); extern "C" void m120 (); extern "C" void m121 (); extern "C" void m122 (); extern "C" void m123 (); extern "C" void m124 (); extern "C" void m125 (); extern "C" void m126 (); extern "C" void m127 (); extern "C" void m128 (); extern "C" void m129 (); extern "C" void m130 (); extern "C" void m131 (); extern "C" void m132 (); extern "C" void m133 (); extern "C" void m134 (); extern "C" void m135 (); extern "C" void m136 (); extern "C" void m137 (); extern "C" void m138 (); extern "C" void m139 (); extern "C" void m140 (); extern "C" void m141 (); extern "C" void m142 (); extern "C" void m143 (); extern "C" void m144 (); extern "C" void m145 (); extern "C" void m146 (); extern "C" void m147 (); extern "C" void m148 (); extern "C" void m149 (); extern "C" void m150 (); extern "C" void m151 (); extern "C" void m152 (); extern "C" void m153 (); extern "C" void m154 (); extern "C" void m155 (); extern "C" void m156 (); extern "C" void m157 (); extern "C" void m158 (); extern "C" void m159 (); extern "C" void m160 (); extern "C" void m161 (); extern "C" void m162 (); extern "C" void m163 (); extern "C" void m164 (); extern "C" void m165 (); extern "C" void m166 (); extern "C" void m167 (); extern "C" void m168 (); extern "C" void m169 (); extern "C" void m170 (); extern "C" void m171 (); extern "C" void m172 (); extern "C" void m173 (); extern "C" void m174 (); extern "C" void m175 (); extern "C" void m176 (); extern "C" void m177 (); extern "C" void m178 (); extern "C" void m179 (); extern "C" void m180 (); extern "C" void m181 (); extern "C" void m182 (); extern "C" void m183 (); extern "C" void m184 (); extern "C" void m185 (); extern "C" void m186 (); extern "C" void m187 (); extern "C" void m188 (); extern "C" void m189 (); extern "C" void m190 (); extern "C" void m191 (); extern "C" void m192 (); extern "C" void m193 (); extern "C" void m194 (); extern "C" void m195 (); extern "C" void m196 (); extern "C" void m197 (); extern "C" void m198 (); extern "C" void m199 (); extern "C" void m200 (); extern "C" void m201 (); extern "C" void m202 (); extern "C" void m203 (); extern "C" void m204 (); extern "C" void m205 (); extern "C" void m206 (); extern "C" void m207 (); extern "C" void m208 (); extern "C" void m209 (); extern "C" void m210 (); extern "C" void m211 (); extern "C" void m212 (); extern "C" void m213 (); extern "C" void m214 (); extern "C" void m215 (); extern "C" void m216 (); extern "C" void m217 (); extern "C" void m218 (); extern "C" void m219 (); extern "C" void m220 (); extern "C" void m221 (); extern "C" void m222 (); extern "C" void m223 (); extern "C" void m224 (); extern "C" void m225 (); extern "C" void m226 (); extern "C" void m227 (); extern "C" void m228 (); extern "C" void m229 (); extern "C" void m230 (); extern "C" void m231 (); extern "C" void m232 (); extern "C" void m233 (); extern "C" void m234 (); extern "C" void m235 (); extern "C" void m236 (); extern "C" void m237 (); extern "C" void m238 (); extern "C" void m239 (); extern "C" void m240 (); extern "C" void m241 (); extern "C" void m242 (); extern "C" void m243 (); extern "C" void m244 (); extern "C" void m245 (); extern "C" void m246 (); extern "C" void m247 (); extern "C" void m248 (); extern "C" void m249 (); extern "C" void m250 (); extern "C" void m251 (); extern "C" void m252 (); extern "C" void m253 (); extern "C" void m254 (); extern "C" void m255 (); extern "C" void m256 (); extern "C" void m257 (); extern "C" void m258 (); extern "C" void m259 (); extern "C" void m260 (); extern "C" void m261 (); extern "C" void m262 (); extern "C" void m263 (); extern "C" void m264 (); extern "C" void m265 (); extern "C" void m266 (); extern "C" void m267 (); extern "C" void m268 (); extern "C" void m269 (); extern "C" void m270 (); extern "C" void m271 (); extern "C" void m272 (); extern "C" void m273 (); extern "C" void m274 (); extern "C" void m275 (); extern "C" void m276 (); extern "C" void m277 (); extern "C" void m278 (); extern "C" void m279 (); extern "C" void m280 (); extern "C" void m281 (); extern "C" void m282 (); extern "C" void m283 (); extern "C" void m284 (); extern "C" void m285 (); extern "C" void m286 (); extern "C" void m287 (); extern "C" void m288 (); extern "C" void m289 (); extern "C" void m290 (); extern "C" void m291 (); extern "C" void m292 (); extern "C" void m293 (); extern "C" void m294 (); extern "C" void m295 (); extern "C" void m296 (); extern "C" void m297 (); extern "C" void m298 (); extern "C" void m299 (); extern "C" void m300 (); extern "C" void m301 (); extern "C" void m302 (); extern "C" void m303 (); extern "C" void m304 (); extern "C" void m305 (); extern "C" void m306 (); extern "C" void m307 (); extern "C" void m308 (); extern "C" void m309 (); extern "C" void m310 (); extern "C" void m311 (); extern "C" void m312 (); extern "C" void m313 (); extern "C" void m314 (); extern "C" void m315 (); extern "C" void m316 (); extern "C" void m317 (); extern "C" void m318 (); extern "C" void m319 (); extern "C" void m320 (); extern "C" void m321 (); extern "C" void m322 (); extern "C" void m323 (); extern "C" void m324 (); extern "C" void m325 (); extern "C" void m326 (); extern "C" void m327 (); extern "C" void m328 (); extern "C" void m329 (); extern "C" void m330 (); extern "C" void m331 (); extern "C" void m332 (); extern "C" void m333 (); extern "C" void m334 (); extern "C" void m335 (); extern "C" void m336 (); extern "C" void m337 (); extern "C" void m338 (); extern "C" void m339 (); extern "C" void m340 (); extern "C" void m341 (); extern "C" void m342 (); extern "C" void m343 (); extern "C" void m344 (); extern "C" void m345 (); extern "C" void m346 (); extern "C" void m347 (); extern "C" void m348 (); extern "C" void m349 (); extern "C" void m350 (); extern "C" void m351 (); extern "C" void m352 (); extern "C" void m353 (); extern "C" void m354 (); extern "C" void m355 (); extern "C" void m356 (); extern "C" void m357 (); extern "C" void m358 (); extern "C" void m359 (); extern "C" void m360 (); extern "C" void m361 (); extern "C" void m362 (); extern "C" void m363 (); extern "C" void m364 (); extern "C" void m365 (); extern "C" void m366 (); extern "C" void m367 (); extern "C" void m368 (); extern "C" void m369 (); extern "C" void m370 (); extern "C" void m371 (); extern "C" void m372 (); extern "C" void m373 (); extern "C" void m374 (); extern "C" void m375 (); extern "C" void m376 (); extern "C" void m377 (); extern "C" void m378 (); extern "C" void m379 (); extern "C" void m380 (); extern "C" void m381 (); extern "C" void m382 (); extern "C" void m383 (); extern "C" void m384 (); extern "C" void m385 (); extern "C" void m386 (); extern "C" void m387 (); extern "C" void m388 (); extern "C" void m389 (); extern "C" void m390 (); extern "C" void m391 (); extern "C" void m392 (); extern "C" void m393 (); extern "C" void m394 (); extern "C" void m395 (); extern "C" void m396 (); extern "C" void m397 (); extern "C" void m398 (); extern "C" void m399 (); extern "C" void m400 (); extern "C" void m401 (); extern "C" void m402 (); extern "C" void m403 (); extern "C" void m404 (); extern "C" void m405 (); extern "C" void m406 (); extern "C" void m407 (); extern "C" void m408 (); extern "C" void m409 (); extern "C" void m410 (); extern "C" void m411 (); extern "C" void m412 (); extern "C" void m413 (); extern "C" void m414 (); extern "C" void m415 (); extern "C" void m416 (); extern "C" void m417 (); extern "C" void m418 (); extern "C" void m419 (); extern "C" void m420 (); extern "C" void m421 (); extern "C" void m422 (); extern "C" void m423 (); extern "C" void m424 (); extern "C" void m425 (); extern "C" void m426 (); extern "C" void m427 (); extern "C" void m428 (); extern "C" void m429 (); extern "C" void m430 (); extern "C" void m431 (); extern "C" void m432 (); extern "C" void m433 (); extern "C" void m434 (); extern "C" void m435 (); extern "C" void m436 (); extern "C" void m437 (); extern "C" void m438 (); extern "C" void m439 (); extern "C" void m440 (); extern "C" void m441 (); extern "C" void m442 (); extern "C" void m443 (); extern "C" void m444 (); extern "C" void m445 (); extern "C" void m446 (); extern "C" void m447 (); extern "C" void m448 (); extern "C" void m449 (); extern "C" void m450 (); extern "C" void m451 (); extern "C" void m452 (); extern "C" void m453 (); extern "C" void m454 (); extern "C" void m455 (); extern "C" void m456 (); extern "C" void m457 (); extern "C" void m458 (); extern "C" void m459 (); extern "C" void m460 (); extern "C" void m461 (); extern "C" void m462 (); extern "C" void m463 (); extern "C" void m464 (); extern "C" void m465 (); extern "C" void m466 (); extern "C" void m467 (); extern "C" void m468 (); extern "C" void m469 (); extern "C" void m470 (); extern "C" void m471 (); extern "C" void m472 (); extern "C" void m473 (); extern "C" void m474 (); extern "C" void m475 (); extern "C" void m476 (); extern "C" void m477 (); extern "C" void m478 (); extern "C" void m479 (); extern "C" void m480 (); extern "C" void m481 (); extern "C" void m482 (); extern "C" void m483 (); extern "C" void m484 (); extern "C" void m485 (); extern "C" void m486 (); extern "C" void m487 (); extern "C" void m488 (); extern "C" void m489 (); extern "C" void m490 (); extern "C" void m491 (); extern "C" void m492 (); extern "C" void m493 (); extern "C" void m494 (); extern "C" void m495 (); extern "C" void m496 (); extern "C" void m497 (); extern "C" void m498 (); extern "C" void m499 (); extern "C" void m500 (); extern "C" void m501 (); extern "C" void m502 (); extern "C" void m503 (); extern "C" void m504 (); extern "C" void m505 (); extern "C" void m506 (); extern "C" void m507 (); extern "C" void m508 (); extern "C" void m509 (); extern "C" void m510 (); extern "C" void m511 (); extern "C" void m512 (); extern "C" void m513 (); extern "C" void m514 (); extern "C" void m515 (); extern "C" void m516 (); extern "C" void m517 (); extern "C" void m518 (); extern "C" void m519 (); extern "C" void m520 (); extern "C" void m521 (); extern "C" void m522 (); extern "C" void m523 (); extern "C" void m524 (); extern "C" void m525 (); extern "C" void m526 (); extern "C" void m527 (); extern "C" void m528 (); extern "C" void m529 (); extern "C" void m530 (); extern "C" void m531 (); extern "C" void m532 (); extern "C" void m533 (); extern "C" void m534 (); extern "C" void m535 (); extern "C" void m536 (); extern "C" void m537 (); extern "C" void m538 (); extern "C" void m539 (); extern "C" void m540 (); extern "C" void m541 (); extern "C" void m542 (); extern "C" void m543 (); extern "C" void m544 (); extern "C" void m545 (); extern "C" void m546 (); extern "C" void m547 (); extern "C" void m548 (); extern "C" void m549 (); extern "C" void m550 (); extern "C" void m551 (); extern "C" void m552 (); extern "C" void m553 (); extern "C" void m554 (); extern "C" void m555 (); extern "C" void m556 (); extern "C" void m557 (); extern "C" void m558 (); extern "C" void m559 (); extern "C" void m560 (); extern "C" void m561 (); extern "C" void m562 (); extern "C" void m563 (); extern "C" void m564 (); extern "C" void m565 (); extern "C" void m566 (); extern "C" void m567 (); extern "C" void m568 (); extern "C" void m569 (); extern "C" void m570 (); extern "C" void m571 (); extern "C" void m572 (); extern "C" void m573 (); extern "C" void m574 (); extern "C" void m575 (); extern "C" void m576 (); extern "C" void m577 (); extern "C" void m578 (); extern "C" void m579 (); extern "C" void m580 (); extern "C" void m581 (); extern "C" void m582 (); extern "C" void m583 (); extern "C" void m584 (); extern "C" void m585 (); extern "C" void m586 (); extern "C" void m587 (); extern "C" void m588 (); extern "C" void m589 (); extern "C" void m590 (); extern "C" void m591 (); extern "C" void m592 (); extern "C" void m593 (); extern "C" void m594 (); extern "C" void m595 (); extern "C" void m596 (); extern "C" void m597 (); extern "C" void m598 (); extern "C" void m599 (); extern "C" void m600 (); extern "C" void m601 (); extern "C" void m602 (); extern "C" void m603 (); extern "C" void m604 (); extern "C" void m605 (); extern "C" void m606 (); extern "C" void m607 (); extern "C" void m608 (); extern "C" void m609 (); extern "C" void m610 (); extern "C" void m611 (); extern "C" void m612 (); extern "C" void m613 (); extern "C" void m614 (); extern "C" void m615 (); extern "C" void m616 (); extern "C" void m617 (); extern "C" void m618 (); extern "C" void m619 (); extern "C" void m620 (); extern "C" void m621 (); extern "C" void m622 (); extern "C" void m623 (); extern "C" void m624 (); extern "C" void m625 (); extern "C" void m626 (); extern "C" void m627 (); extern "C" void m628 (); extern "C" void m629 (); extern "C" void m630 (); extern "C" void m631 (); extern "C" void m632 (); extern "C" void m633 (); extern "C" void m634 (); extern "C" void m635 (); extern "C" void m636 (); extern "C" void m637 (); extern "C" void m638 (); extern "C" void m639 (); extern "C" void m640 (); extern "C" void m641 (); extern "C" void m642 (); extern "C" void m643 (); extern "C" void m644 (); extern "C" void m645 (); extern "C" void m646 (); extern "C" void m647 (); extern "C" void m648 (); extern "C" void m649 (); extern "C" void m650 (); extern "C" void m651 (); extern "C" void m652 (); extern "C" void m653 (); extern "C" void m654 (); extern "C" void m655 (); extern "C" void m656 (); extern "C" void m657 (); extern "C" void m658 (); extern "C" void m659 (); extern "C" void m660 (); extern "C" void m661 (); extern "C" void m662 (); extern "C" void m663 (); extern "C" void m664 (); extern "C" void m665 (); extern "C" void m666 (); extern "C" void m667 (); extern "C" void m668 (); extern "C" void m669 (); extern "C" void m670 (); extern "C" void m671 (); extern "C" void m672 (); extern "C" void m673 (); extern "C" void m674 (); extern "C" void m675 (); extern "C" void m676 (); extern "C" void m677 (); extern "C" void m678 (); extern "C" void m679 (); extern "C" void m680 (); extern "C" void m681 (); extern "C" void m682 (); extern "C" void m683 (); extern "C" void m684 (); extern "C" void m685 (); extern "C" void m686 (); extern "C" void m687 (); extern "C" void m688 (); extern "C" void m689 (); extern "C" void m690 (); extern "C" void m691 (); extern "C" void m692 (); extern "C" void m693 (); extern "C" void m694 (); extern "C" void m695 (); extern "C" void m696 (); extern "C" void m697 (); extern "C" void m698 (); extern "C" void m699 (); extern "C" void m700 (); extern "C" void m701 (); extern "C" void m702 (); extern "C" void m703 (); extern "C" void m704 (); extern "C" void m705 (); extern "C" void m706 (); extern "C" void m707 (); extern "C" void m708 (); extern "C" void m709 (); extern "C" void m710 (); extern "C" void m711 (); extern "C" void m712 (); extern "C" void m713 (); extern "C" void m714 (); extern "C" void m715 (); extern "C" void m716 (); extern "C" void m717 (); extern "C" void m718 (); extern "C" void m719 (); extern "C" void m720 (); extern "C" void m721 (); extern "C" void m722 (); extern "C" void m723 (); extern "C" void m724 (); extern "C" void m725 (); extern "C" void m726 (); extern "C" void m727 (); extern "C" void m728 (); extern "C" void m729 (); extern "C" void m730 (); extern "C" void m731 (); extern "C" void m732 (); extern "C" void m733 (); extern "C" void m734 (); extern "C" void m735 (); extern "C" void m736 (); extern "C" void m737 (); extern "C" void m738 (); extern "C" void m739 (); extern "C" void m740 (); extern "C" void m741 (); extern "C" void m742 (); extern "C" void m743 (); extern "C" void m744 (); extern "C" void m745 (); extern "C" void m746 (); extern "C" void m747 (); extern "C" void m748 (); extern "C" void m749 (); extern "C" void m750 (); extern "C" void m751 (); extern "C" void m752 (); extern "C" void m753 (); extern "C" void m754 (); extern "C" void m755 (); extern "C" void m756 (); extern "C" void m757 (); extern "C" void m758 (); extern "C" void m759 (); extern "C" void m760 (); extern "C" void m761 (); extern "C" void m762 (); extern "C" void m763 (); extern "C" void m764 (); extern "C" void m765 (); extern "C" void m766 (); extern "C" void m767 (); extern "C" void m768 (); extern "C" void m769 (); extern "C" void m770 (); extern "C" void m771 (); extern "C" void m772 (); extern "C" void m773 (); extern "C" void m774 (); extern "C" void m775 (); extern "C" void m776 (); extern "C" void m777 (); extern "C" void m778 (); extern "C" void m779 (); extern "C" void m780 (); extern "C" void m781 (); extern "C" void m782 (); extern "C" void m783 (); extern "C" void m784 (); extern "C" void m785 (); extern "C" void m786 (); extern "C" void m787 (); extern "C" void m788 (); extern "C" void m789 (); extern "C" void m790 (); extern "C" void m791 (); extern "C" void m792 (); extern "C" void m793 (); extern "C" void m794 (); extern "C" void m795 (); extern "C" void m796 (); extern "C" void m797 (); extern "C" void m798 (); extern "C" void m799 (); extern "C" void m800 (); extern "C" void m801 (); extern "C" void m802 (); extern "C" void m803 (); extern "C" void m804 (); extern "C" void m805 (); extern "C" void m806 (); extern "C" void m807 (); extern "C" void m808 (); extern "C" void m809 (); extern "C" void m810 (); extern "C" void m811 (); extern "C" void m812 (); extern "C" void m813 (); extern "C" void m814 (); extern "C" void m815 (); extern "C" void m816 (); extern "C" void m817 (); extern "C" void m818 (); extern "C" void m819 (); extern "C" void m820 (); extern "C" void m821 (); extern "C" void m822 (); extern "C" void m823 (); extern "C" void m824 (); extern "C" void m825 (); extern "C" void m826 (); extern "C" void m827 (); extern "C" void m828 (); extern "C" void m829 (); extern "C" void m830 (); extern "C" void m831 (); extern "C" void m832 (); extern "C" void m833 (); extern "C" void m834 (); extern "C" void m835 (); extern "C" void m836 (); extern "C" void m837 (); extern "C" void m838 (); extern "C" void m839 (); extern "C" void m840 (); extern "C" void m841 (); extern "C" void m842 (); extern "C" void m843 (); extern "C" void m844 (); extern "C" void m845 (); extern "C" void m846 (); extern "C" void m847 (); extern "C" void m848 (); extern "C" void m849 (); extern "C" void m850 (); extern "C" void m851 (); extern "C" void m852 (); extern "C" void m853 (); extern "C" void m854 (); extern "C" void m855 (); extern "C" void m856 (); extern "C" void m857 (); extern "C" void m858 (); extern "C" void m859 (); extern "C" void m860 (); extern "C" void m861 (); extern "C" void m862 (); extern "C" void m863 (); extern "C" void m864 (); extern "C" void m865 (); extern "C" void m866 (); extern "C" void m867 (); extern "C" void m868 (); extern "C" void m869 (); extern "C" void m870 (); extern "C" void m871 (); extern "C" void m872 (); extern "C" void m873 (); extern "C" void m874 (); extern "C" void m875 (); extern "C" void m876 (); extern "C" void m877 (); extern "C" void m878 (); extern "C" void m879 (); extern "C" void m880 (); extern "C" void m881 (); extern "C" void m882 (); extern "C" void m883 (); extern "C" void m884 (); extern "C" void m885 (); extern "C" void m886 (); extern "C" void m887 (); extern "C" void m888 (); extern "C" void m889 (); extern "C" void m890 (); extern "C" void m891 (); extern "C" void m892 (); extern "C" void m893 (); extern "C" void m894 (); extern "C" void m895 (); extern "C" void m896 (); extern "C" void m897 (); extern "C" void m898 (); extern "C" void m899 (); extern "C" void m900 (); extern "C" void m901 (); extern "C" void m902 (); extern "C" void m903 (); extern "C" void m904 (); extern "C" void m905 (); extern "C" void m906 (); extern "C" void m907 (); extern "C" void m908 (); extern "C" void m909 (); extern "C" void m910 (); extern "C" void m911 (); extern "C" void m912 (); extern "C" void m913 (); extern "C" void m914 (); extern "C" void m915 (); extern "C" void m916 (); extern "C" void m917 (); extern "C" void m918 (); extern "C" void m919 (); extern "C" void m920 (); extern "C" void m921 (); extern "C" void m922 (); extern "C" void m923 (); extern "C" void m924 (); extern "C" void m925 (); extern "C" void m926 (); extern "C" void m927 (); extern "C" void m928 (); extern "C" void m929 (); extern "C" void m930 (); extern "C" void m931 (); extern "C" void m932 (); extern "C" void m933 (); extern "C" void m934 (); extern "C" void m935 (); extern "C" void m936 (); extern "C" void m937 (); extern "C" void m938 (); extern "C" void m939 (); extern "C" void m940 (); extern "C" void m941 (); extern "C" void m942 (); extern "C" void m943 (); extern "C" void m944 (); extern "C" void m945 (); extern "C" void m946 (); extern "C" void m947 (); extern "C" void m948 (); extern "C" void m949 (); extern "C" void m950 (); extern "C" void m951 (); extern "C" void m952 (); extern "C" void m953 (); extern "C" void m954 (); extern "C" void m955 (); extern "C" void m956 (); extern "C" void m957 (); extern "C" void m958 (); extern "C" void m959 (); extern "C" void m960 (); extern "C" void m961 (); extern "C" void m962 (); extern "C" void m963 (); extern "C" void m964 (); extern "C" void m965 (); extern "C" void m966 (); extern "C" void m967 (); extern "C" void m968 (); extern "C" void m969 (); extern "C" void m970 (); extern "C" void m971 (); extern "C" void m972 (); extern "C" void m973 (); extern "C" void m974 (); extern "C" void m975 (); extern "C" void m976 (); extern "C" void m977 (); extern "C" void m978 (); extern "C" void m979 (); extern "C" void m980 (); extern "C" void m981 (); extern "C" void m982 (); extern "C" void m983 (); extern "C" void m984 (); extern "C" void m985 (); extern "C" void m986 (); extern "C" void m987 (); extern "C" void m988 (); extern "C" void m989 (); extern "C" void m990 (); extern "C" void m991 (); extern "C" void m992 (); extern "C" void m993 (); extern "C" void m994 (); extern "C" void m995 (); extern "C" void m996 (); extern "C" void m997 (); extern "C" void m998 (); extern "C" void m999 (); extern "C" void m1000 (); extern "C" void m1001 (); extern "C" void m1002 (); extern "C" void m1003 (); extern "C" void m1004 (); extern "C" void m1005 (); extern "C" void m1006 (); extern "C" void m1007 (); extern "C" void m1008 (); extern "C" void m1009 (); extern "C" void m1010 (); extern "C" void m1011 (); extern "C" void m1012 (); extern "C" void m1013 (); extern "C" void m1014 (); extern "C" void m1015 (); extern "C" void m1016 (); extern "C" void m1017 (); extern "C" void m1018 (); extern "C" void m1019 (); extern "C" void m1020 (); extern "C" void m1021 (); extern "C" void m1022 (); extern "C" void m1023 (); extern "C" void m1024 (); extern "C" void m1025 (); extern "C" void m1026 (); extern "C" void m1027 (); extern "C" void m1028 (); extern "C" void m1029 (); extern "C" void m1030 (); extern "C" void m1031 (); extern "C" void m1032 (); extern "C" void m1033 (); extern "C" void m1034 (); extern "C" void m1035 (); extern "C" void m1036 (); extern "C" void m1037 (); extern "C" void m1038 (); extern "C" void m1039 (); extern "C" void m1040 (); extern "C" void m1041 (); extern "C" void m1042 (); extern "C" void m1043 (); extern "C" void m1044 (); extern "C" void m1045 (); extern "C" void m1046 (); extern "C" void m1047 (); extern "C" void m1048 (); extern "C" void m1049 (); extern "C" void m1050 (); extern "C" void m1051 (); extern "C" void m1052 (); extern "C" void m1053 (); extern "C" void m1054 (); extern "C" void m1055 (); extern "C" void m1056 (); extern "C" void m1057 (); extern "C" void m1058 (); extern "C" void m1059 (); extern "C" void m1060 (); extern "C" void m1061 (); extern "C" void m1062 (); extern "C" void m1063 (); extern "C" void m1064 (); extern "C" void m1065 (); extern "C" void m1066 (); extern "C" void m1067 (); extern "C" void m1068 (); extern "C" void m1069 (); extern "C" void m1070 (); extern "C" void m1071 (); extern "C" void m1072 (); extern "C" void m1073 (); extern "C" void m1074 (); extern "C" void m1075 (); extern "C" void m1076 (); extern "C" void m1077 (); extern "C" void m1078 (); extern "C" void m1079 (); extern "C" void m1080 (); extern "C" void m1081 (); extern "C" void m1082 (); extern "C" void m1083 (); extern "C" void m1084 (); extern "C" void m1085 (); extern "C" void m1086 (); extern "C" void m1087 (); extern "C" void m1088 (); extern "C" void m1089 (); extern "C" void m1090 (); extern "C" void m1091 (); extern "C" void m1092 (); extern "C" void m1093 (); extern "C" void m1094 (); extern "C" void m1095 (); extern "C" void m1096 (); extern "C" void m1097 (); extern "C" void m1098 (); extern "C" void m1099 (); extern "C" void m1100 (); extern "C" void m1101 (); extern "C" void m1102 (); extern "C" void m1103 (); extern "C" void m1104 (); extern "C" void m1105 (); extern "C" void m1106 (); extern "C" void m1107 (); extern "C" void m1108 (); extern "C" void m1109 (); extern "C" void m1110 (); extern "C" void m1111 (); extern "C" void m1112 (); extern "C" void m1113 (); extern "C" void m1114 (); extern "C" void m1115 (); extern "C" void m1116 (); extern "C" void m1117 (); extern "C" void m1118 (); extern "C" void m1119 (); extern "C" void m1120 (); extern "C" void m1121 (); extern "C" void m1122 (); extern "C" void m1123 (); extern "C" void m1124 (); extern "C" void m1125 (); extern "C" void m1126 (); extern "C" void m1127 (); extern "C" void m1128 (); extern "C" void m1129 (); extern "C" void m1130 (); extern "C" void m1131 (); extern "C" void m1132 (); extern "C" void m1133 (); extern "C" void m1134 (); extern "C" void m1135 (); extern "C" void m1136 (); extern "C" void m1137 (); extern "C" void m1138 (); extern "C" void m1139 (); extern "C" void m1140 (); extern "C" void m1141 (); extern "C" void m1142 (); extern "C" void m1143 (); extern "C" void m1144 (); extern "C" void m1145 (); extern "C" void m1146 (); extern "C" void m1147 (); extern "C" void m1148 (); extern "C" void m1149 (); extern "C" void m1150 (); extern "C" void m1151 (); extern "C" void m1152 (); extern "C" void m1153 (); extern "C" void m1154 (); extern "C" void m1155 (); extern "C" void m1156 (); extern "C" void m1157 (); extern "C" void m1158 (); extern "C" void m1159 (); extern "C" void m1160 (); extern "C" void m1161 (); extern "C" void m1162 (); extern "C" void m1163 (); extern "C" void m1164 (); extern "C" void m1165 (); extern "C" void m1166 (); extern "C" void m1167 (); extern "C" void m1168 (); extern "C" void m1169 (); extern "C" void m1170 (); extern "C" void m1171 (); extern "C" void m1172 (); extern "C" void m1173 (); extern "C" void m1174 (); extern "C" void m1175 (); extern "C" void m1176 (); extern "C" void m1177 (); extern "C" void m1178 (); extern "C" void m1179 (); extern "C" void m1180 (); extern "C" void m1181 (); extern "C" void m1182 (); extern "C" void m1183 (); extern "C" void m1184 (); extern "C" void m1185 (); extern "C" void m1186 (); extern "C" void m1187 (); extern "C" void m1188 (); extern "C" void m1189 (); extern "C" void m1190 (); extern "C" void m1191 (); extern "C" void m1192 (); extern "C" void m1193 (); extern "C" void m1194 (); extern "C" void m1195 (); extern "C" void m1196 (); extern "C" void m1197 (); extern "C" void m1198 (); extern "C" void m1199 (); extern "C" void m1200 (); extern "C" void m1201 (); extern "C" void m1202 (); extern "C" void m1203 (); extern "C" void m1204 (); extern "C" void m1205 (); extern "C" void m1206 (); extern "C" void m1207 (); extern "C" void m1208 (); extern "C" void m1209 (); extern "C" void m1210 (); extern "C" void m1211 (); extern "C" void m1212 (); extern "C" void m1213 (); extern "C" void m1214 (); extern "C" void m1215 (); extern "C" void m1216 (); extern "C" void m1217 (); extern "C" void m1218 (); extern "C" void m1219 (); extern "C" void m1220 (); extern "C" void m1221 (); extern "C" void m1222 (); extern "C" void m1223 (); extern "C" void m1224 (); extern "C" void m1225 (); extern "C" void m1226 (); extern "C" void m1227 (); extern "C" void m1228 (); extern "C" void m1229 (); extern "C" void m1230 (); extern "C" void m1231 (); extern "C" void m1232 (); extern "C" void m1233 (); extern "C" void m1234 (); extern "C" void m1235 (); extern "C" void m1236 (); extern "C" void m1237 (); extern "C" void m1238 (); extern "C" void m1239 (); extern "C" void m1240 (); extern "C" void m1241 (); extern "C" void m1242 (); extern "C" void m1243 (); extern "C" void m1244 (); extern "C" void m1245 (); extern "C" void m1246 (); extern "C" void m1247 (); extern "C" void m1248 (); extern "C" void m1249 (); extern "C" void m1250 (); extern "C" void m1251 (); extern "C" void m1252 (); extern "C" void m1253 (); extern "C" void m1254 (); extern "C" void m1255 (); extern "C" void m1256 (); extern "C" void m1257 (); extern "C" void m1258 (); extern "C" void m1259 (); extern "C" void m1260 (); extern "C" void m1261 (); extern "C" void m1262 (); extern "C" void m1263 (); extern "C" void m1264 (); extern "C" void m1265 (); extern "C" void m1266 (); extern "C" void m1267 (); extern "C" void m1268 (); extern "C" void m1269 (); extern "C" void m1270 (); extern "C" void m1271 (); extern "C" void m1272 (); extern "C" void m1273 (); extern "C" void m1274 (); extern "C" void m1275 (); extern "C" void m1276 (); extern "C" void m1277 (); extern "C" void m1278 (); extern "C" void m1279 (); extern "C" void m1280 (); extern "C" void m1281 (); extern "C" void m1282 (); extern "C" void m1283 (); extern "C" void m1284 (); extern "C" void m1285 (); extern "C" void m1286 (); extern "C" void m1287 (); extern "C" void m1288 (); extern "C" void m1289 (); extern "C" void m1290 (); extern "C" void m1291 (); extern "C" void m1292 (); extern "C" void m1293 (); extern "C" void m1294 (); extern "C" void m1295 (); extern "C" void m1296 (); extern "C" void m1297 (); extern "C" void m1298 (); extern "C" void m1299 (); extern "C" void m1300 (); extern "C" void m1301 (); extern "C" void m1302 (); extern "C" void m1303 (); extern "C" void m1304 (); extern "C" void m1305 (); extern "C" void m1306 (); extern "C" void m1307 (); extern "C" void m1308 (); extern "C" void m1309 (); extern "C" void m1310 (); extern "C" void m1311 (); extern "C" void m1312 (); extern "C" void m1313 (); extern "C" void m1314 (); extern "C" void m1315 (); extern "C" void m1316 (); extern "C" void m1317 (); extern "C" void m1318 (); extern "C" void m1319 (); extern "C" void m1320 (); extern "C" void m1321 (); extern "C" void m1322 (); extern "C" void m1323 (); extern "C" void m1324 (); extern "C" void m1325 (); extern "C" void m1326 (); extern "C" void m1327 (); extern "C" void m1328 (); extern "C" void m1329 (); extern "C" void m1330 (); extern "C" void m1331 (); extern "C" void m1332 (); extern "C" void m1333 (); extern "C" void m1334 (); extern "C" void m1335 (); extern "C" void m1336 (); extern "C" void m1337 (); extern "C" void m1338 (); extern "C" void m1339 (); extern "C" void m1340 (); extern "C" void m1341 (); extern "C" void m1342 (); extern "C" void m1343 (); extern "C" void m1344 (); extern "C" void m1345 (); extern "C" void m1346 (); extern "C" void m1347 (); extern "C" void m1348 (); extern "C" void m1349 (); extern "C" void m1350 (); extern "C" void m1351 (); extern "C" void m1352 (); extern "C" void m1353 (); extern "C" void m1354 (); extern "C" void m1355 (); extern "C" void m1356 (); extern "C" void m1357 (); extern "C" void m1358 (); extern "C" void m1359 (); extern "C" void m1360 (); extern "C" void m1361 (); extern "C" void m1362 (); extern "C" void m1363 (); extern "C" void m1364 (); extern "C" void m1365 (); extern "C" void m1366 (); extern "C" void m1367 (); extern "C" void m1368 (); extern "C" void m1369 (); extern "C" void m1370 (); extern "C" void m1371 (); extern "C" void m1372 (); extern "C" void m1373 (); extern "C" void m1374 (); extern "C" void m1375 (); extern "C" void m1376 (); extern "C" void m1377 (); extern "C" void m1378 (); extern "C" void m1379 (); extern "C" void m1380 (); extern "C" void m1381 (); extern "C" void m1382 (); extern "C" void m1383 (); extern "C" void m1384 (); extern "C" void m1385 (); extern "C" void m1386 (); extern "C" void m1387 (); extern "C" void m1388 (); extern "C" void m1389 (); extern "C" void m1390 (); extern "C" void m1391 (); extern "C" void m1392 (); extern "C" void m1393 (); extern "C" void m1394 (); extern "C" void m1395 (); extern "C" void m1396 (); extern "C" void m1397 (); extern "C" void m1398 (); extern "C" void m1399 (); extern "C" void m1400 (); extern "C" void m1401 (); extern "C" void m1402 (); extern "C" void m1403 (); extern "C" void m1404 (); extern "C" void m1405 (); extern "C" void m1406 (); extern "C" void m1407 (); extern "C" void m1408 (); extern "C" void m1409 (); extern "C" void m1410 (); extern "C" void m1411 (); extern "C" void m1412 (); extern "C" void m1413 (); extern "C" void m1414 (); extern "C" void m1415 (); extern "C" void m1416 (); extern "C" void m1417 (); extern "C" void m1418 (); extern "C" void m1419 (); extern "C" void m1420 (); extern "C" void m1421 (); extern "C" void m1422 (); extern "C" void m1423 (); extern "C" void m1424 (); extern "C" void m1425 (); extern "C" void m1426 (); extern "C" void m1427 (); extern "C" void m1428 (); extern "C" void m1429 (); extern "C" void m1430 (); extern "C" void m1431 (); extern "C" void m1432 (); extern "C" void m1433 (); extern "C" void m1434 (); extern "C" void m1435 (); extern "C" void m1436 (); extern "C" void m1437 (); extern "C" void m1438 (); extern "C" void m1439 (); extern "C" void m1440 (); extern "C" void m1441 (); extern "C" void m1442 (); extern "C" void m1443 (); extern "C" void m1444 (); extern "C" void m1445 (); extern "C" void m1446 (); extern "C" void m1447 (); extern "C" void m1448 (); extern "C" void m1449 (); extern "C" void m1450 (); extern "C" void m1451 (); extern "C" void m1452 (); extern "C" void m1453 (); extern "C" void m1454 (); extern "C" void m2091 (); extern "C" void m2092 (); extern "C" void m2093 (); extern "C" void m2094 (); extern "C" void m2095 (); extern "C" void m2096 (); extern "C" void m2097 (); extern "C" void m2098 (); extern "C" void m2099 (); extern "C" void m1652 (); extern "C" void m2100 (); extern "C" void m1923 (); extern "C" void m2101 (); extern "C" void m2102 (); extern "C" void m2103 (); extern "C" void m2104 (); extern "C" void m2105 (); extern "C" void m2106 (); extern "C" void m2107 (); extern "C" void m2108 (); extern "C" void m1732 (); extern "C" void m2109 (); extern "C" void m2110 (); extern "C" void m2071 (); extern "C" void m2058 (); extern "C" void m2072 (); extern "C" void m2111 (); extern "C" void m2065 (); extern "C" void m2075 (); extern "C" void m2112 (); extern "C" void m2066 (); extern "C" void m2076 (); extern "C" void m2113 (); extern "C" void m2062 (); extern "C" void m2064 (); extern "C" void m2074 (); extern "C" void m2114 (); extern "C" void m2060 (); extern "C" void m2073 (); extern "C" void m2115 (); extern "C" void m2078 (); extern "C" void m2077 (); extern "C" void m2116 (); extern "C" void m2068 (); extern "C" void m2117 (); extern "C" void m2118 (); extern "C" void m2119 (); extern "C" void m2120 (); extern "C" void m2121 (); extern "C" void m2122 (); extern "C" void m2123 (); extern "C" void m2124 (); extern "C" void m2125 (); extern "C" void m2126 (); extern "C" void m2127 (); extern "C" void m2128 (); extern "C" void m2129 (); extern "C" void m2130 (); extern "C" void m2131 (); extern "C" void m2132 (); extern "C" void m2133 (); extern "C" void m2134 (); extern "C" void m2135 (); extern "C" void m2136 (); extern "C" void m1577 (); extern "C" void m1578 (); extern "C" void m76 (); extern "C" void m1756 (); extern "C" void m2022 (); extern "C" void m2137 (); extern "C" void m2138 (); extern "C" void m2139 (); extern "C" void m2140 (); extern "C" void m2141 (); extern "C" void m2142 (); extern "C" void m1724 (); extern "C" void m1806 (); extern "C" void m2143 (); extern "C" void m2144 (); extern "C" void m2145 (); extern "C" void m2146 (); extern "C" void m2147 (); extern "C" void m2148 (); extern "C" void m2149 (); extern "C" void m2150 (); extern "C" void m2151 (); extern "C" void m2152 (); extern "C" void m2153 (); extern "C" void m2154 (); extern "C" void m2155 (); extern "C" void m2156 (); extern "C" void m2157 (); extern "C" void m2158 (); extern "C" void m2159 (); extern "C" void m2160 (); extern "C" void m1898 (); extern "C" void m1899 (); extern "C" void m2161 (); extern "C" void m1818 (); extern "C" void m1819 (); extern "C" void m1897 (); extern "C" void m1817 (); extern "C" void m1896 (); extern "C" void m1841 (); extern "C" void m1837 (); extern "C" void m1836 (); extern "C" void m2162 (); extern "C" void m2163 (); extern "C" void m2164 (); extern "C" void m2165 (); extern "C" void m2166 (); extern "C" void m1582 (); extern "C" void m1579 (); extern "C" void m43 (); extern "C" void m1799 (); extern "C" void m1808 (); extern "C" void m1886 (); extern "C" void m2167 (); extern "C" void m2168 (); extern "C" void m2169 (); extern "C" void m1547 (); extern "C" void m1509 (); extern "C" void m2170 (); extern "C" void m1504 (); extern "C" void m1626 (); extern "C" void m1648 (); extern "C" void m1641 (); extern "C" void m50 (); extern "C" void m1521 (); extern "C" void m1796 (); extern "C" void m1849 (); extern "C" void m2088 (); extern "C" void m1882 (); extern "C" void m1523 (); extern "C" void m1565 (); extern "C" void m73 (); extern "C" void m1738 (); extern "C" void m1936 (); extern "C" void m1940 (); extern "C" void m1941 (); extern "C" void m2171 (); extern "C" void m2172 (); extern "C" void m2173 (); extern "C" void m1965 (); extern "C" void m2174 (); extern "C" void m2175 (); extern "C" void m1764 (); extern "C" void m1574 (); extern "C" void m2176 (); extern "C" void m2177 (); extern "C" void m1968 (); extern "C" void m1950 (); extern "C" void m1951 (); extern "C" void m1503 (); extern "C" void m1689 (); extern "C" void m1762 (); extern "C" void m2070 (); extern "C" void m1502 (); extern "C" void m1972 (); extern "C" void m1970 (); extern "C" void m1971 (); extern "C" void m39 (); extern "C" void m38 (); extern "C" void m2006 (); extern "C" void m2178 (); extern "C" void m2179 (); extern "C" void m1878 (); extern "C" void m1614 (); extern "C" void m1618 (); extern "C" void m2180 (); extern "C" void m2181 (); extern "C" void m1745 (); extern "C" void m1591 (); extern "C" void m1712 (); extern "C" void m1749 (); extern "C" void m1696 (); extern "C" void m1964 (); extern "C" void m2182 (); extern "C" void m1612 (); extern "C" void m2183 (); extern "C" void m1737 (); extern "C" void m1613 (); extern "C" void m2184 (); extern "C" void m57 (); extern "C" void m2185 (); extern "C" void m1966 (); extern "C" void m2186 (); extern "C" void m2187 (); extern "C" void m2188 (); extern "C" void m2189 (); extern "C" void m1763 (); extern "C" void m1880 (); extern "C" void m1913 (); extern "C" void m1734 (); extern "C" void m1792 (); extern "C" void m1735 (); extern "C" void m1790 (); extern "C" void m1797 (); extern "C" void m1929 (); extern "C" void m1674 (); extern "C" void m1676 (); extern "C" void m1730 (); extern "C" void m1791 (); extern "C" void m1680 (); extern "C" void m1789 (); extern "C" void m1677 (); extern "C" void m1813 (); extern "C" void m1812 (); extern "C" void m1804 (); extern "C" void m1805 (); extern "C" void m2190 (); extern "C" void m1683 (); extern "C" void m1908 (); extern "C" void m2191 (); extern "C" void m2192 (); extern "C" void m1922 (); extern "C" void m1918 (); extern "C" void m2193 (); extern "C" void m2194 (); extern "C" void m2195 (); extern "C" void m2196 (); extern "C" void m2197 (); extern "C" void m2198 (); extern "C" void m2199 (); extern "C" void m2200 (); extern "C" void m2201 (); extern "C" void m2202 (); extern "C" void m2203 (); extern "C" void m2204 (); extern "C" void m2205 (); extern "C" void m2206 (); extern "C" void m2207 (); extern "C" void m2208 (); extern "C" void m2209 (); extern "C" void m2210 (); extern "C" void m2211 (); extern "C" void m2212 (); extern "C" void m1949 (); extern "C" void m2213 (); extern "C" void m2214 (); extern "C" void m2215 (); extern "C" void m2216 (); extern "C" void m2217 (); extern "C" void m2218 (); extern "C" void m2219 (); extern "C" void m2220 (); extern "C" void m2221 (); extern "C" void m2222 (); extern "C" void m2223 (); extern "C" void m2224 (); extern "C" void m2225 (); extern "C" void m2226 (); extern "C" void m2227 (); extern "C" void m1943 (); extern "C" void m2228 (); extern "C" void m2229 (); extern "C" void m1945 (); extern "C" void m1947 (); extern "C" void m1934 (); extern "C" void m1946 (); extern "C" void m2230 (); extern "C" void m2231 (); extern "C" void m1939 (); extern "C" void m2232 (); extern "C" void m1953 (); extern "C" void m2233 (); extern "C" void m2234 (); extern "C" void m1952 (); extern "C" void m2235 (); extern "C" void m2236 (); extern "C" void m2237 (); extern "C" void m2238 (); extern "C" void m2239 (); extern "C" void m2240 (); extern "C" void m2241 (); extern "C" void m2242 (); extern "C" void m2243 (); extern "C" void m2244 (); extern "C" void m2245 (); extern "C" void m2246 (); extern "C" void m2247 (); extern "C" void m2248 (); extern "C" void m2249 (); extern "C" void m2250 (); extern "C" void m2251 (); extern "C" void m2252 (); extern "C" void m2253 (); extern "C" void m2254 (); extern "C" void m1937 (); extern "C" void m1736 (); extern "C" void m1798 (); extern "C" void m1800 (); extern "C" void m2255 (); extern "C" void m2256 (); extern "C" void m2257 (); extern "C" void m2258 (); extern "C" void m2259 (); extern "C" void m1782 (); extern "C" void m1785 (); extern "C" void m2260 (); extern "C" void m1795 (); extern "C" void m2261 (); extern "C" void m2262 (); extern "C" void m1569 (); extern "C" void m1570 (); extern "C" void m1844 (); extern "C" void m2263 (); extern "C" void m1842 (); extern "C" void m2264 (); extern "C" void m2265 (); extern "C" void m1843 (); extern "C" void m2266 (); extern "C" void m2267 (); extern "C" void m2268 (); extern "C" void m2269 (); extern "C" void m2270 (); extern "C" void m2271 (); extern "C" void m2016 (); extern "C" void m1862 (); extern "C" void m1969 (); extern "C" void m1860 (); extern "C" void m2272 (); extern "C" void m2021 (); extern "C" void m2273 (); extern "C" void m2274 (); extern "C" void m2031 (); extern "C" void m2033 (); extern "C" void m1788 (); extern "C" void m1942 (); extern "C" void m74 (); extern "C" void m1655 (); extern "C" void m1777 (); extern "C" void m1595 (); extern "C" void m1543 (); extern "C" void m1935 (); extern "C" void m1810 (); extern "C" void m1809 (); extern "C" void m1928 (); extern "C" void m1927 (); extern "C" void m2045 (); extern "C" void m2275 (); extern "C" void m2276 (); extern "C" void m2277 (); extern "C" void m2046 (); extern "C" void m2278 (); extern "C" void m1673 (); extern "C" void m2279 (); extern "C" void m1685 (); extern "C" void m1625 (); extern "C" void m2280 (); extern "C" void m2281 (); extern "C" void m1686 (); extern "C" void m1627 (); extern "C" void m2282 (); extern "C" void m2283 (); extern "C" void m1687 (); extern "C" void m1628 (); extern "C" void m2284 (); extern "C" void m2285 (); extern "C" void m1643 (); extern "C" void m1617 (); extern "C" void m2286 (); extern "C" void m2287 (); extern "C" void m1688 (); extern "C" void m1642 (); extern "C" void m2288 (); extern "C" void m2289 (); extern "C" void m2290 (); extern "C" void m2291 (); extern "C" void m1681 (); extern "C" void m1636 (); extern "C" void m1637 (); extern "C" void m2044 (); extern "C" void m2019 (); extern "C" void m2292 (); extern "C" void m2293 (); extern "C" void m2294 (); extern "C" void m2295 (); extern "C" void m2296 (); extern "C" void m2297 (); extern "C" void m2298 (); extern "C" void m1995 (); extern "C" void m2000 (); extern "C" void m2299 (); extern "C" void m2300 (); extern "C" void m2301 (); extern "C" void m2302 (); extern "C" void m1997 (); extern "C" void m1993 (); extern "C" void m2303 (); extern "C" void m2304 (); extern "C" void m1465 (); extern "C" void m2305 (); extern "C" void m2306 (); extern "C" void m2307 (); extern "C" void m2308 (); extern "C" void m2309 (); extern "C" void m2310 (); extern "C" void m2311 (); extern "C" void m2312 (); extern "C" void m2313 (); extern "C" void m2314 (); extern "C" void m2315 (); extern "C" void m2316 (); extern "C" void m2317 (); extern "C" void m2318 (); extern "C" void m2319 (); extern "C" void m2320 (); extern "C" void m2321 (); extern "C" void m2322 (); extern "C" void m1787 (); extern "C" void m2323 (); extern "C" void m1783 (); extern "C" void m1780 (); extern "C" void m1803 (); extern "C" void m2324 (); extern "C" void m1781 (); extern "C" void m2325 (); extern "C" void m65 (); extern "C" void m2326 (); extern "C" void m61 (); extern "C" void m2327 (); extern "C" void m1794 (); extern "C" void m1793 (); extern "C" void m1786 (); extern "C" void m1801 (); extern "C" void m2328 (); extern "C" void m2329 (); extern "C" void m2330 (); extern "C" void m2331 (); extern "C" void m2332 (); extern "C" void m2333 (); extern "C" void m2334 (); extern "C" void m2335 (); extern "C" void m2336 (); extern "C" void m69 (); extern "C" void m70 (); extern "C" void m71 (); extern "C" void m67 (); extern "C" void m2337 (); extern "C" void m1654 (); extern "C" void m1917 (); extern "C" void m1816 (); extern "C" void m2338 (); extern "C" void m2339 (); extern "C" void m1514 (); extern "C" void m1659 (); extern "C" void m1507 (); extern "C" void m2340 (); extern "C" void m2341 (); extern "C" void m2342 (); extern "C" void m2343 (); extern "C" void m1568 (); extern "C" void m1567 (); extern "C" void m1463 (); extern "C" void m1581 (); extern "C" void m2344 (); extern "C" void m2345 (); extern "C" void m2346 (); extern "C" void m2347 (); extern "C" void m2348 (); extern "C" void m1757 (); extern "C" void m2349 (); extern "C" void m1566 (); extern "C" void m2350 (); extern "C" void m1580 (); extern "C" void m2351 (); extern "C" void m2352 (); extern "C" void m2353 (); extern "C" void m2354 (); extern "C" void m2355 (); extern "C" void m2356 (); extern "C" void m2357 (); extern "C" void m2358 (); extern "C" void m2359 (); extern "C" void m2360 (); extern "C" void m2361 (); extern "C" void m68 (); extern "C" void m66 (); extern "C" void m1660 (); extern "C" void m2362 (); extern "C" void m1610 (); extern "C" void m2363 (); extern "C" void m1994 (); extern "C" void m2364 (); extern "C" void m2365 (); extern "C" void m2366 (); extern "C" void m2367 (); extern "C" void m2368 (); extern "C" void m2369 (); extern "C" void m2370 (); extern "C" void m2371 (); extern "C" void m2372 (); extern "C" void m2373 (); extern "C" void m2374 (); extern "C" void m2375 (); extern "C" void m2376 (); extern "C" void m2377 (); extern "C" void m2378 (); extern "C" void m2379 (); extern "C" void m2380 (); extern "C" void m2381 (); extern "C" void m2382 (); extern "C" void m2383 (); extern "C" void m2384 (); extern "C" void m2385 (); extern "C" void m2386 (); extern "C" void m2387 (); extern "C" void m2388 (); extern "C" void m2389 (); extern "C" void m2390 (); extern "C" void m2391 (); extern "C" void m2392 (); extern "C" void m2393 (); extern "C" void m2394 (); extern "C" void m2395 (); extern "C" void m34 (); extern "C" void m1602 (); extern "C" void m2396 (); extern "C" void m2397 (); extern "C" void m1924 (); extern "C" void m2398 (); extern "C" void m2399 (); extern "C" void m1518 (); extern "C" void m1520 (); extern "C" void m1519 (); extern "C" void m2400 (); extern "C" void m1542 (); extern "C" void m1541 (); extern "C" void m1562 (); extern "C" void m41 (); extern "C" void m1522 (); extern "C" void m75 (); extern "C" void m2401 (); extern "C" void m1524 (); extern "C" void m2402 (); extern "C" void m1540 (); extern "C" void m1560 (); extern "C" void m1561 (); extern "C" void m1559 (); extern "C" void m1900 (); extern "C" void m1832 (); extern "C" void m1888 (); extern "C" void m2403 (); extern "C" void m2404 (); extern "C" void m2405 (); extern "C" void m2406 (); extern "C" void m2407 (); extern "C" void m2408 (); extern "C" void m56 (); extern "C" void m2409 (); extern "C" void m1833 (); extern "C" void m2410 (); extern "C" void m1872 (); extern "C" void m1639 (); extern "C" void m77 (); extern "C" void m1733 (); extern "C" void m2411 (); extern "C" void m2412 (); extern "C" void m2413 (); extern "C" void m2414 (); extern "C" void m2415 (); extern "C" void m2416 (); extern "C" void m2417 (); extern "C" void m58 (); extern "C" void m2418 (); extern "C" void m2419 (); extern "C" void m1458 (); extern "C" void m1460 (); extern "C" void m63 (); extern "C" void m2420 (); extern "C" void m36 (); extern "C" void m55 (); extern "C" void m2043 (); extern "C" void m2421 (); extern "C" void m2422 (); extern "C" void m2423 (); extern "C" void m1722 (); extern "C" void m51 (); extern "C" void m1615 (); extern "C" void m2424 (); extern "C" void m2425 (); extern "C" void m2426 (); extern "C" void m2427 (); extern "C" void m1499 (); extern "C" void m1620 (); extern "C" void m1621 (); extern "C" void m1647 (); extern "C" void m1944 (); extern "C" void m1515 (); extern "C" void m2428 (); extern "C" void m2429 (); extern "C" void m2430 (); extern "C" void m2431 (); extern "C" void m2432 (); extern "C" void m2433 (); extern "C" void m2434 (); extern "C" void m2435 (); extern "C" void m2436 (); extern "C" void m37 (); extern "C" void m40 (); extern "C" void m2437 (); extern "C" void m2438 (); extern "C" void m1675 (); extern "C" void m1883 (); extern "C" void m2439 (); extern "C" void m2440 (); extern "C" void m1765 (); extern "C" void m1761 (); extern "C" void m2441 (); extern "C" void m1879 (); extern "C" void m1884 (); extern "C" void m2442 (); extern "C" void m2443 (); extern "C" void m1881 (); extern "C" void m1885 (); extern "C" void m2444 (); extern "C" void m2445 (); extern "C" void m1500 (); extern "C" void m1916 (); extern "C" void m2446 (); extern "C" void m2447 (); extern "C" void m1873 (); extern "C" void m1619 (); extern "C" void m1948 (); extern "C" void m2448 (); extern "C" void m1967 (); extern "C" void m2449 (); extern "C" void m1682 (); extern "C" void m2450 (); extern "C" void m1623 (); extern "C" void m1874 (); extern "C" void m1662 (); extern "C" void m2451 (); extern "C" void m1622 (); extern "C" void m2452 (); extern "C" void m1546 (); extern "C" void m1599 (); extern "C" void m2453 (); extern "C" void m45 (); extern "C" void m46 (); extern "C" void m2454 (); extern "C" void m2455 (); extern "C" void m2456 (); extern "C" void m2457 (); extern "C" void m2458 (); extern "C" void m2459 (); extern "C" void m2460 (); extern "C" void m2461 (); extern "C" void m2462 (); extern "C" void m2463 (); extern "C" void m2464 (); extern "C" void m2465 (); extern "C" void m2466 (); extern "C" void m2467 (); extern "C" void m2468 (); extern "C" void m2469 (); extern "C" void m2470 (); extern "C" void m2471 (); extern "C" void m2472 (); extern "C" void m2473 (); extern "C" void m2474 (); extern "C" void m2475 (); extern "C" void m2476 (); extern "C" void m2477 (); extern "C" void m2478 (); extern "C" void m2479 (); extern "C" void m2480 (); extern "C" void m62 (); extern "C" void m2481 (); extern "C" void m2482 (); extern "C" void m2483 (); extern "C" void m2484 (); extern "C" void m2485 (); extern "C" void m2486 (); extern "C" void m2487 (); extern "C" void m2488 (); extern "C" void m2489 (); extern "C" void m2490 (); extern "C" void m2491 (); extern "C" void m2492 (); extern "C" void m2493 (); extern "C" void m2494 (); extern "C" void m2495 (); extern "C" void m2496 (); extern "C" void m2497 (); extern "C" void m2498 (); extern "C" void m1758 (); extern "C" void m2499 (); extern "C" void m1583 (); extern "C" void m2500 (); extern "C" void m2501 (); extern "C" void m2502 (); extern "C" void m2503 (); extern "C" void m2504 (); extern "C" void m1588 (); extern "C" void m1589 (); extern "C" void m1587 (); extern "C" void m1586 (); extern "C" void m2505 (); extern "C" void m2506 (); extern "C" void m2507 (); extern "C" void m1759 (); extern "C" void m2508 (); extern "C" void m1571 (); extern "C" void m2509 (); extern "C" void m1575 (); extern "C" void m1576 (); extern "C" void m1760 (); extern "C" void m1572 (); extern "C" void m2510 (); extern "C" void m1573 (); extern "C" void m49 (); extern "C" void m44 (); extern "C" void m2511 (); extern "C" void m2512 (); extern "C" void m2513 (); extern "C" void m2514 (); extern "C" void m2515 (); extern "C" void m2516 (); extern "C" void m2517 (); extern "C" void m2518 (); extern "C" void m2519 (); extern "C" void m2520 (); extern "C" void m2521 (); extern "C" void m2522 (); extern "C" void m2523 (); extern "C" void m2524 (); extern "C" void m2525 (); extern "C" void m2526 (); extern "C" void m2527 (); extern "C" void m2528 (); extern "C" void m2529 (); extern "C" void m2530 (); extern "C" void m2531 (); extern "C" void m2532 (); extern "C" void m48 (); extern "C" void m54 (); extern "C" void m2533 (); extern "C" void m2534 (); extern "C" void m2535 (); extern "C" void m2536 (); extern "C" void m2537 (); extern "C" void m2538 (); extern "C" void m2539 (); extern "C" void m2540 (); extern "C" void m2541 (); extern "C" void m2542 (); extern "C" void m2543 (); extern "C" void m2544 (); extern "C" void m2545 (); extern "C" void m2546 (); extern "C" void m2547 (); extern "C" void m2548 (); extern "C" void m2549 (); extern "C" void m2550 (); extern "C" void m2551 (); extern "C" void m2552 (); extern "C" void m2553 (); extern "C" void m2554 (); extern "C" void m2555 (); extern "C" void m2556 (); extern "C" void m2557 (); extern "C" void m2558 (); extern "C" void m2559 (); extern "C" void m2560 (); extern "C" void m2561 (); extern "C" void m2562 (); extern "C" void m2563 (); extern "C" void m2564 (); extern "C" void m2565 (); extern "C" void m2566 (); extern "C" void m2567 (); extern "C" void m2568 (); extern "C" void m2569 (); extern "C" void m2570 (); extern "C" void m2571 (); extern "C" void m2572 (); extern "C" void m2573 (); extern "C" void m2574 (); extern "C" void m2575 (); extern "C" void m2576 (); extern "C" void m2577 (); extern "C" void m2578 (); extern "C" void m2579 (); extern "C" void m2580 (); extern "C" void m2581 (); extern "C" void m1975 (); extern "C" void m1974 (); extern "C" void m1973 (); extern "C" void m2582 (); extern "C" void m2583 (); extern "C" void m2584 (); extern "C" void m2585 (); extern "C" void m2586 (); extern "C" void m2587 (); extern "C" void m2588 (); extern "C" void m2589 (); extern "C" void m2590 (); extern "C" void m2591 (); extern "C" void m2592 (); extern "C" void m2593 (); extern "C" void m2594 (); extern "C" void m2595 (); extern "C" void m2596 (); extern "C" void m2597 (); extern "C" void m2598 (); extern "C" void m2599 (); extern "C" void m2600 (); extern "C" void m2601 (); extern "C" void m2602 (); extern "C" void m2603 (); extern "C" void m2604 (); extern "C" void m2605 (); extern "C" void m2606 (); extern "C" void m2607 (); extern "C" void m2608 (); extern "C" void m2609 (); extern "C" void m2610 (); extern "C" void m2611 (); extern "C" void m2612 (); extern "C" void m2613 (); extern "C" void m2614 (); extern "C" void m2615 (); extern "C" void m2616 (); extern "C" void m2617 (); extern "C" void m2618 (); extern "C" void m2619 (); extern "C" void m2620 (); extern "C" void m2621 (); extern "C" void m2622 (); extern "C" void m2623 (); extern "C" void m2624 (); extern "C" void m2625 (); extern "C" void m2626 (); extern "C" void m2627 (); extern "C" void m1711 (); extern "C" void m2628 (); extern "C" void m2629 (); extern "C" void m2630 (); extern "C" void m2631 (); extern "C" void m2632 (); extern "C" void m2633 (); extern "C" void m2634 (); extern "C" void m2635 (); extern "C" void m1999 (); extern "C" void m2636 (); extern "C" void m1853 (); extern "C" void m2637 (); extern "C" void m2638 (); extern "C" void m2639 (); extern "C" void m2640 (); extern "C" void m2641 (); extern "C" void m2642 (); extern "C" void m2643 (); extern "C" void m2644 (); extern "C" void m2645 (); extern "C" void m2646 (); extern "C" void m2647 (); extern "C" void m2648 (); extern "C" void m2649 (); extern "C" void m2650 (); extern "C" void m2002 (); extern "C" void m2651 (); extern "C" void m2652 (); extern "C" void m2004 (); extern "C" void m1815 (); extern "C" void m1998 (); extern "C" void m2653 (); extern "C" void m2654 (); extern "C" void m2655 (); extern "C" void m2656 (); extern "C" void m2657 (); extern "C" void m2658 (); extern "C" void m1871 (); extern "C" void m2659 (); extern "C" void m2660 (); extern "C" void m2661 (); extern "C" void m2662 (); extern "C" void m2663 (); extern "C" void m1847 (); extern "C" void m2664 (); extern "C" void m2665 (); extern "C" void m1846 (); extern "C" void m2666 (); extern "C" void m2667 (); extern "C" void m1887 (); extern "C" void m2668 (); extern "C" void m2669 (); extern "C" void m2001 (); extern "C" void m2670 (); extern "C" void m2671 (); extern "C" void m2672 (); extern "C" void m2007 (); extern "C" void m2008 (); extern "C" void m1870 (); extern "C" void m2673 (); extern "C" void m2005 (); extern "C" void m1848 (); extern "C" void m1845 (); extern "C" void m1604 (); extern "C" void m2674 (); extern "C" void m2675 (); extern "C" void m2676 (); extern "C" void m1605 (); extern "C" void m2677 (); extern "C" void m1753 (); extern "C" void m2020 (); extern "C" void m1767 (); extern "C" void m2003 (); extern "C" void m2023 (); extern "C" void m1784 (); extern "C" void m2024 (); extern "C" void m1741 (); extern "C" void m1754 (); extern "C" void m1915 (); extern "C" void m1665 (); extern "C" void m1694 (); extern "C" void m1666 (); extern "C" void m1692 (); extern "C" void m1693 (); extern "C" void m1766 (); extern "C" void m1715 (); extern "C" void m2678 (); extern "C" void m1933 (); extern "C" void m1703 (); extern "C" void m1707 (); extern "C" void m1963 (); extern "C" void m2679 (); extern "C" void m1740 (); extern "C" void m2680 (); extern "C" void m2681 (); extern "C" void m1746 (); extern "C" void m2682 (); extern "C" void m1744 (); extern "C" void m1911 (); extern "C" void m2683 (); extern "C" void m1912 (); extern "C" void m1902 (); extern "C" void m2684 (); extern "C" void m1727 (); extern "C" void m1728 (); extern "C" void m1876 (); extern "C" void m1903 (); extern "C" void m1904 (); extern "C" void m1729 (); extern "C" void m1731 (); extern "C" void m1725 (); extern "C" void m1726 (); extern "C" void m1909 (); extern "C" void m1717 (); extern "C" void m1907 (); extern "C" void m2685 (); extern "C" void m1768 (); extern "C" void m2686 (); extern "C" void m1742 (); extern "C" void m2687 (); extern "C" void m2688 (); extern "C" void m1743 (); extern "C" void m2689 (); extern "C" void m1802 (); extern "C" void m2690 (); extern "C" void m1684 (); extern "C" void m1930 (); extern "C" void m2691 (); extern "C" void m1814 (); extern "C" void m2692 (); extern "C" void m2693 (); extern "C" void m2694 (); extern "C" void m2695 (); extern "C" void m2696 (); extern "C" void m2697 (); extern "C" void m2698 (); extern "C" void m2699 (); extern "C" void m2700 (); extern "C" void m1854 (); extern "C" void m1855 (); extern "C" void m2701 (); extern "C" void m1850 (); extern "C" void m1852 (); extern "C" void m1856 (); extern "C" void m1851 (); extern "C" void m1858 (); extern "C" void m2702 (); extern "C" void m2703 (); extern "C" void m2704 (); extern "C" void m2705 (); extern "C" void m2039 (); extern "C" void m2706 (); extern "C" void m2707 (); extern "C" void m2708 (); extern "C" void m2709 (); extern "C" void m2037 (); extern "C" void m2710 (); extern "C" void m2038 (); extern "C" void m2711 (); extern "C" void m2032 (); extern "C" void m2034 (); extern "C" void m2712 (); extern "C" void m2713 (); extern "C" void m2714 (); extern "C" void m2715 (); extern "C" void m2716 (); extern "C" void m2717 (); extern "C" void m2718 (); extern "C" void m2719 (); extern "C" void m1834 (); extern "C" void m1835 (); extern "C" void m2720 (); extern "C" void m2721 (); extern "C" void m2722 (); extern "C" void m2723 (); extern "C" void m2724 (); extern "C" void m2725 (); extern "C" void m2726 (); extern "C" void m2727 (); extern "C" void m2728 (); extern "C" void m2729 (); extern "C" void m2730 (); extern "C" void m2731 (); extern "C" void m2732 (); extern "C" void m2733 (); extern "C" void m2734 (); extern "C" void m2735 (); extern "C" void m2736 (); extern "C" void m2737 (); extern "C" void m2738 (); extern "C" void m2739 (); extern "C" void m2740 (); extern "C" void m2741 (); extern "C" void m2742 (); extern "C" void m2743 (); extern "C" void m2744 (); extern "C" void m2745 (); extern "C" void m2746 (); extern "C" void m2747 (); extern "C" void m2748 (); extern "C" void m2749 (); extern "C" void m2750 (); extern "C" void m2751 (); extern "C" void m2752 (); extern "C" void m2753 (); extern "C" void m2754 (); extern "C" void m2755 (); extern "C" void m2756 (); extern "C" void m2757 (); extern "C" void m2758 (); extern "C" void m2759 (); extern "C" void m2760 (); extern "C" void m2761 (); extern "C" void m2762 (); extern "C" void m2763 (); extern "C" void m2764 (); extern "C" void m2765 (); extern "C" void m2766 (); extern "C" void m2767 (); extern "C" void m2768 (); extern "C" void m2769 (); extern "C" void m2770 (); extern "C" void m2771 (); extern "C" void m2772 (); extern "C" void m2773 (); extern "C" void m2774 (); extern "C" void m2775 (); extern "C" void m2776 (); extern "C" void m2777 (); extern "C" void m2778 (); extern "C" void m2779 (); extern "C" void m2780 (); extern "C" void m2781 (); extern "C" void m2782 (); extern "C" void m2783 (); extern "C" void m2784 (); extern "C" void m2785 (); extern "C" void m2786 (); extern "C" void m2787 (); extern "C" void m2788 (); extern "C" void m2789 (); extern "C" void m2790 (); extern "C" void m2791 (); extern "C" void m2792 (); extern "C" void m2793 (); extern "C" void m2794 (); extern "C" void m2795 (); extern "C" void m2796 (); extern "C" void m2797 (); extern "C" void m2798 (); extern "C" void m2799 (); extern "C" void m2800 (); extern "C" void m2801 (); extern "C" void m2802 (); extern "C" void m2803 (); extern "C" void m2804 (); extern "C" void m2805 (); extern "C" void m2806 (); extern "C" void m2807 (); extern "C" void m2808 (); extern "C" void m2809 (); extern "C" void m2810 (); extern "C" void m2811 (); extern "C" void m2812 (); extern "C" void m2813 (); extern "C" void m2814 (); extern "C" void m2815 (); extern "C" void m2816 (); extern "C" void m2817 (); extern "C" void m2818 (); extern "C" void m2819 (); extern "C" void m2820 (); extern "C" void m1598 (); extern "C" void m1698 (); extern "C" void m2821 (); extern "C" void m2822 (); extern "C" void m2823 (); extern "C" void m1601 (); extern "C" void m2824 (); extern "C" void m2825 (); extern "C" void m2826 (); extern "C" void m2827 (); extern "C" void m2828 (); extern "C" void m2829 (); extern "C" void m2830 (); extern "C" void m2831 (); extern "C" void m2832 (); extern "C" void m2833 (); extern "C" void m2834 (); extern "C" void m2835 (); extern "C" void m2836 (); extern "C" void m2837 (); extern "C" void m2838 (); extern "C" void m1697 (); extern "C" void m1716 (); extern "C" void m2839 (); extern "C" void m2840 (); extern "C" void m2910 (); extern "C" void m2911 (); extern "C" void m2912 (); extern "C" void m2913 (); extern "C" void m2914 (); extern "C" void m2915 (); extern "C" void m2916 (); extern "C" void m2917 (); extern "C" void m2918 (); extern "C" void m2919 (); extern "C" void m2920 (); extern "C" void m2921 (); extern "C" void m2922 (); extern "C" void m2923 (); extern "C" void m2924 (); extern "C" void m2925 (); extern "C" void m2926 (); extern "C" void m2927 (); extern "C" void m2928 (); extern "C" void m2929 (); extern "C" void m2930 (); extern "C" void m2931 (); extern "C" void m2932 (); extern "C" void m2933 (); extern "C" void m2934 (); extern "C" void m2935 (); extern "C" void m2936 (); extern "C" void m2937 (); extern "C" void m2938 (); extern "C" void m2939 (); extern "C" void m2940 (); extern "C" void m2941 (); extern "C" void m2942 (); extern "C" void m2943 (); extern "C" void m2944 (); extern "C" void m2945 (); extern "C" void m2946 (); extern "C" void m2947 (); extern "C" void m2948 (); extern "C" void m2949 (); extern "C" void m2950 (); extern "C" void m2951 (); extern "C" void m2952 (); extern "C" void m2953 (); extern "C" void m2954 (); extern "C" void m2955 (); extern "C" void m2956 (); extern "C" void m2957 (); extern "C" void m2979 (); extern "C" void m2980 (); extern "C" void m2981 (); extern "C" void m2982 (); extern "C" void m2983 (); extern "C" void m2984 (); extern "C" void m2985 (); extern "C" void m2986 (); extern "C" void m2987 (); extern "C" void m2988 (); extern "C" void m2989 (); extern "C" void m2990 (); extern "C" void m2991 (); extern "C" void m2992 (); extern "C" void m2993 (); extern "C" void m2994 (); extern "C" void m2995 (); extern "C" void m2996 (); extern "C" void m2997 (); extern "C" void m2998 (); extern "C" void m2999 (); extern "C" void m3000 (); extern "C" void m3001 (); extern "C" void m3002 (); extern "C" void m3003 (); extern "C" void m3004 (); extern "C" void m3005 (); extern "C" void m3006 (); extern "C" void m3007 (); extern "C" void m3008 (); extern "C" void m3009 (); extern "C" void m3010 (); extern "C" void m3011 (); extern "C" void m3012 (); extern "C" void m3013 (); extern "C" void m3014 (); extern "C" void m3015 (); extern "C" void m3016 (); extern "C" void m3017 (); extern "C" void m3018 (); extern "C" void m3019 (); extern "C" void m3020 (); extern "C" void m3021 (); extern "C" void m3022 (); extern "C" void m3023 (); extern "C" void m3024 (); extern "C" void m3025 (); extern "C" void m3026 (); extern "C" void m3027 (); extern "C" void m3028 (); extern "C" void m3029 (); extern "C" void m3030 (); extern "C" void m3031 (); extern "C" void m3032 (); extern "C" void m3033 (); extern "C" void m3034 (); extern "C" void m3035 (); extern "C" void m3036 (); extern "C" void m3037 (); extern "C" void m3038 (); extern "C" void m3039 (); extern "C" void m3040 (); extern "C" void m3041 (); extern "C" void m3042 (); extern "C" void m3043 (); extern "C" void m3044 (); extern "C" void m3045 (); extern "C" void m3046 (); extern "C" void m3047 (); extern "C" void m3048 (); extern "C" void m3049 (); extern "C" void m3050 (); extern "C" void m3051 (); extern "C" void m3052 (); extern "C" void m3053 (); extern "C" void m3054 (); extern "C" void m3055 (); extern "C" void m3056 (); extern "C" void m3057 (); extern "C" void m3058 (); extern "C" void m3059 (); extern "C" void m3060 (); extern "C" void m3061 (); extern "C" void m3062 (); extern "C" void m3063 (); extern "C" void m3064 (); extern "C" void m3065 (); extern "C" void m3066 (); extern "C" void m3067 (); extern "C" void m3068 (); extern "C" void m3069 (); extern "C" void m3070 (); extern "C" void m3071 (); extern "C" void m3072 (); extern "C" void m3073 (); extern "C" void m3074 (); extern "C" void m3075 (); extern "C" void m3076 (); extern "C" void m3077 (); extern "C" void m3078 (); extern "C" void m3079 (); extern "C" void m3080 (); extern "C" void m3081 (); extern "C" void m3082 (); extern "C" void m3083 (); extern "C" void m3084 (); extern "C" void m3085 (); extern "C" void m3086 (); extern "C" void m3087 (); extern "C" void m3088 (); extern "C" void m3089 (); extern "C" void m3090 (); extern "C" void m3091 (); extern "C" void m3092 (); extern "C" void m3093 (); extern "C" void m3094 (); extern "C" void m3095 (); extern "C" void m3096 (); extern "C" void m3097 (); extern "C" void m3098 (); extern "C" void m3099 (); extern "C" void m3100 (); extern "C" void m3101 (); extern "C" void m3102 (); extern "C" void m3103 (); extern "C" void m3104 (); extern "C" void m3105 (); extern "C" void m3106 (); extern "C" void m3107 (); extern "C" void m3108 (); extern "C" void m3109 (); extern "C" void m3110 (); extern "C" void m3111 (); extern "C" void m3112 (); extern "C" void m3113 (); extern "C" void m3114 (); extern "C" void m3115 (); extern "C" void m3116 (); extern "C" void m3117 (); extern "C" void m3118 (); extern "C" void m3119 (); extern "C" void m3120 (); extern "C" void m3121 (); extern "C" void m3122 (); extern "C" void m3123 (); extern "C" void m3124 (); extern "C" void m3125 (); extern "C" void m3126 (); extern "C" void m3127 (); extern "C" void m3128 (); extern "C" void m3129 (); extern "C" void m3130 (); extern "C" void m3131 (); extern "C" void m3132 (); extern "C" void m3133 (); extern "C" void m3134 (); extern "C" void m3135 (); extern "C" void m3136 (); extern "C" void m3137 (); extern "C" void m3138 (); extern "C" void m3139 (); extern "C" void m3140 (); extern "C" void m3141 (); extern "C" void m3142 (); extern "C" void m3143 (); extern "C" void m3144 (); extern "C" void m3145 (); extern "C" void m3146 (); extern "C" void m3147 (); extern "C" void m3148 (); extern "C" void m3149 (); extern "C" void m3150 (); extern "C" void m3151 (); extern "C" void m3152 (); extern "C" void m3153 (); extern "C" void m3154 (); extern "C" void m3155 (); extern "C" void m3156 (); extern "C" void m3157 (); extern "C" void m3158 (); extern "C" void m3159 (); extern "C" void m3160 (); extern "C" void m3161 (); extern "C" void m3162 (); extern "C" void m3163 (); extern "C" void m3164 (); extern "C" void m3165 (); extern "C" void m3166 (); extern "C" void m3167 (); extern "C" void m3168 (); extern "C" void m3169 (); extern "C" void m3170 (); extern "C" void m3171 (); extern "C" void m3172 (); extern "C" void m3173 (); extern "C" void m3174 (); extern "C" void m3175 (); extern "C" void m3176 (); extern "C" void m3177 (); extern "C" void m3178 (); extern "C" void m3179 (); extern "C" void m3180 (); extern "C" void m3181 (); extern "C" void m3182 (); extern "C" void m3183 (); extern "C" void m3184 (); extern "C" void m3185 (); extern "C" void m3186 (); extern "C" void m3187 (); extern "C" void m3188 (); extern "C" void m3189 (); extern "C" void m3190 (); extern "C" void m3191 (); extern "C" void m3192 (); extern "C" void m3193 (); extern "C" void m3194 (); extern "C" void m3195 (); extern "C" void m3196 (); extern "C" void m3197 (); extern "C" void m3198 (); extern "C" void m3199 (); extern "C" void m3200 (); extern "C" void m3201 (); extern "C" void m3202 (); extern "C" void m3203 (); extern "C" void m3204 (); extern "C" void m3205 (); extern "C" void m3206 (); extern "C" void m3207 (); extern "C" void m3208 (); extern "C" void m3209 (); extern "C" void m3210 (); extern "C" void m3211 (); extern "C" void m3212 (); extern "C" void m3213 (); extern "C" void m3214 (); extern "C" void m3215 (); extern "C" void m3216 (); extern "C" void m3217 (); extern "C" void m3218 (); extern "C" void m3219 (); extern "C" void m3220 (); extern "C" void m3221 (); extern "C" void m3222 (); extern "C" void m3223 (); extern "C" void m3224 (); extern "C" void m3225 (); extern "C" void m3226 (); extern "C" void m3227 (); extern "C" void m3228 (); extern "C" void m3229 (); extern "C" void m3230 (); extern "C" void m3231 (); extern "C" void m3232 (); extern "C" void m3233 (); extern "C" void m3234 (); extern "C" void m3235 (); extern "C" void m3236 (); extern "C" void m3237 (); extern "C" void m3238 (); extern "C" void m3239 (); extern "C" void m3240 (); extern "C" void m3241 (); extern "C" void m3242 (); extern "C" void m3243 (); extern "C" void m3244 (); extern "C" void m3245 (); extern "C" void m3246 (); extern "C" void m3247 (); extern "C" void m3248 (); extern "C" void m3249 (); extern "C" void m3250 (); extern "C" void m3251 (); extern "C" void m3252 (); extern "C" void m3253 (); extern "C" void m3254 (); extern "C" void m3255 (); extern "C" void m3256 (); extern "C" void m3257 (); extern "C" void m3258 (); extern "C" void m3259 (); extern "C" void m3260 (); extern "C" void m3261 (); extern "C" void m3262 (); extern "C" void m3263 (); extern "C" void m3264 (); extern "C" void m3265 (); extern "C" void m3266 (); extern "C" void m3267 (); extern "C" void m3268 (); extern "C" void m3269 (); extern "C" void m3270 (); extern "C" void m3271 (); extern "C" void m3272 (); extern "C" void m3273 (); extern "C" void m3274 (); extern "C" void m3275 (); extern "C" void m3276 (); extern "C" void m3277 (); extern "C" void m3278 (); extern "C" void m3279 (); extern "C" void m3280 (); extern "C" void m3281 (); extern "C" void m3282 (); extern "C" void m3283 (); extern "C" void m3284 (); extern "C" void m3285 (); extern "C" void m3286 (); extern "C" void m3287 (); extern "C" void m3288 (); extern "C" void m3289 (); extern "C" void m3290 (); extern "C" void m3291 (); extern "C" void m3292 (); extern "C" void m3293 (); extern "C" void m3294 (); extern "C" void m3295 (); extern "C" void m3296 (); extern "C" void m3297 (); extern "C" void m3298 (); extern "C" void m3299 (); extern "C" void m3300 (); extern "C" void m3301 (); extern "C" void m3302 (); extern "C" void m3303 (); extern "C" void m3304 (); extern "C" void m3305 (); extern "C" void m3306 (); extern "C" void m3307 (); extern "C" void m3308 (); extern "C" void m3309 (); extern "C" void m3310 (); extern "C" void m3311 (); extern "C" void m3312 (); extern "C" void m3313 (); extern "C" void m3314 (); extern "C" void m3315 (); extern "C" void m3316 (); extern "C" void m3317 (); extern "C" void m3318 (); extern "C" void m3319 (); extern "C" void m3320 (); extern "C" void m3321 (); extern "C" void m3322 (); extern "C" void m3323 (); extern "C" void m3324 (); extern "C" void m3325 (); extern "C" void m3326 (); extern "C" void m3327 (); extern "C" void m3328 (); extern "C" void m3329 (); extern "C" void m3330 (); extern "C" void m3331 (); extern "C" void m3332 (); extern "C" void m3333 (); extern "C" void m3334 (); extern "C" void m3335 (); extern "C" void m3336 (); extern "C" void m3337 (); extern "C" void m3338 (); extern "C" void m3339 (); extern "C" void m3340 (); extern "C" void m3341 (); extern "C" void m3342 (); extern "C" void m3343 (); extern "C" void m3344 (); extern "C" void m3345 (); extern "C" void m3346 (); extern "C" void m3347 (); extern "C" void m3348 (); extern "C" void m3349 (); extern "C" void m3350 (); extern "C" void m3351 (); extern "C" void m3352 (); extern "C" void m3353 (); extern "C" void m3354 (); extern "C" void m3355 (); extern "C" void m3356 (); extern "C" void m3357 (); extern "C" void m3358 (); extern "C" void m3359 (); extern "C" void m3360 (); extern "C" void m3361 (); extern "C" void m3362 (); extern "C" void m3363 (); extern "C" void m3364 (); extern "C" void m3365 (); extern "C" void m3366 (); extern "C" void m3367 (); extern "C" void m3368 (); extern "C" void m3369 (); extern "C" void m3370 (); extern "C" void m3371 (); extern "C" void m3372 (); extern "C" void m3373 (); extern "C" void m3374 (); extern "C" void m3375 (); extern "C" void m3376 (); extern "C" void m3377 (); extern "C" void m3378 (); extern "C" void m3379 (); extern "C" void m3380 (); extern "C" void m3381 (); extern "C" void m3382 (); extern "C" void m3383 (); extern "C" void m3384 (); extern "C" void m3385 (); extern "C" void m3386 (); extern "C" void m3387 (); extern "C" void m3388 (); extern "C" void m3389 (); extern "C" void m3390 (); extern "C" void m3391 (); extern "C" void m3392 (); extern "C" void m3393 (); extern "C" void m3394 (); extern "C" void m3395 (); extern "C" void m3396 (); extern "C" void m3397 (); extern "C" void m3398 (); extern "C" void m3399 (); extern "C" void m3400 (); extern "C" void m3401 (); extern "C" void m3402 (); extern "C" void m3403 (); extern "C" void m3404 (); extern "C" void m3405 (); extern "C" void m3406 (); extern "C" void m3407 (); extern "C" void m3408 (); extern "C" void m3409 (); extern "C" void m3410 (); extern "C" void m3411 (); extern "C" void m3412 (); extern "C" void m3413 (); extern "C" void m3414 (); extern "C" void m3415 (); extern "C" void m3416 (); extern "C" void m3417 (); extern "C" void m3418 (); extern "C" void m3419 (); extern "C" void m3420 (); extern "C" void m3421 (); extern "C" void m3422 (); extern "C" void m3423 (); extern "C" void m3424 (); extern "C" void m3425 (); extern "C" void m3426 (); extern "C" void m3427 (); extern "C" void m3428 (); extern "C" void m3429 (); extern "C" void m3430 (); extern "C" void m3431 (); extern "C" void m3432 (); extern "C" void m3433 (); extern "C" void m3434 (); extern "C" void m3435 (); extern "C" void m3436 (); extern "C" void m3437 (); extern "C" void m3438 (); extern "C" void m3439 (); extern "C" void m3440 (); extern "C" void m3441 (); extern "C" void m3442 (); extern "C" void m3443 (); extern "C" void m3444 (); extern "C" void m3445 (); extern "C" void m3446 (); extern "C" void m3447 (); extern "C" void m3448 (); extern "C" void m3449 (); extern "C" void m3450 (); extern "C" void m3451 (); extern "C" void m3452 (); extern "C" void m3453 (); extern "C" void m3454 (); extern "C" void m3455 (); extern "C" void m3456 (); extern "C" void m3457 (); extern "C" void m3458 (); extern "C" void m3459 (); extern "C" void m3460 (); extern "C" void m3461 (); extern "C" void m3462 (); extern "C" void m3463 (); extern "C" void m3464 (); extern "C" void m3465 (); extern "C" void m3466 (); extern "C" void m3467 (); extern "C" void m3468 (); extern "C" void m3469 (); extern "C" void m3470 (); extern "C" void m3471 (); extern "C" void m3472 (); extern "C" void m3473 (); extern "C" void m3474 (); extern "C" void m3475 (); extern "C" void m3476 (); extern "C" void m3477 (); extern "C" void m3478 (); extern "C" void m3479 (); extern "C" void m3480 (); extern "C" void m3481 (); extern "C" void m3482 (); extern "C" void m3483 (); extern "C" void m3484 (); extern "C" void m3485 (); extern "C" void m3486 (); extern "C" void m3487 (); extern "C" void m3488 (); extern "C" void m3489 (); extern "C" void m3490 (); extern "C" void m3491 (); extern "C" void m3492 (); extern "C" void m3493 (); extern "C" void m3494 (); extern "C" void m3495 (); extern "C" void m3496 (); extern "C" void m3497 (); extern "C" void m3498 (); extern "C" void m3499 (); extern "C" void m3500 (); extern "C" void m3501 (); extern "C" void m3502 (); extern "C" void m3503 (); extern "C" void m3504 (); extern "C" void m3505 (); extern "C" void m3506 (); extern "C" void m3507 (); extern "C" void m3508 (); extern "C" void m3509 (); extern "C" void m3510 (); extern "C" void m3511 (); extern "C" void m3512 (); extern "C" void m3513 (); extern "C" void m3514 (); extern "C" void m3515 (); extern "C" void m3516 (); extern "C" void m3517 (); extern "C" void m3518 (); extern "C" void m3519 (); extern "C" void m3520 (); extern "C" void m3521 (); extern "C" void m3522 (); extern "C" void m3523 (); extern "C" void m3524 (); extern "C" void m3525 (); extern "C" void m3526 (); extern "C" void m3527 (); extern "C" void m3528 (); extern "C" void m3529 (); extern "C" void m3530 (); extern "C" void m3531 (); extern "C" void m3532 (); extern "C" void m3533 (); extern "C" void m3534 (); extern "C" void m3535 (); extern "C" void m3536 (); extern "C" void m3537 (); extern "C" void m3538 (); extern "C" void m3539 (); extern "C" void m3540 (); extern "C" void m3541 (); extern "C" void m3542 (); extern "C" void m3543 (); extern "C" void m3544 (); extern "C" void m3545 (); extern "C" void m3546 (); extern "C" void m3547 (); extern "C" void m3548 (); extern "C" void m3549 (); extern "C" void m3550 (); extern "C" void m3551 (); extern "C" void m3552 (); extern "C" void m3553 (); extern "C" void m3554 (); extern "C" void m3555 (); extern "C" void m3556 (); extern "C" void m3557 (); extern "C" void m3558 (); extern "C" void m3559 (); extern "C" void m3560 (); extern "C" void m3561 (); extern "C" void m3562 (); extern "C" void m3563 (); extern "C" void m3564 (); extern "C" void m3565 (); extern "C" void m3566 (); extern "C" void m3567 (); extern "C" void m3568 (); extern "C" void m3569 (); extern "C" void m3570 (); extern "C" void m3571 (); extern "C" void m3572 (); extern "C" void m3573 (); extern "C" void m3574 (); extern "C" void m3575 (); extern "C" void m3576 (); extern "C" void m3577 (); extern "C" void m3578 (); extern "C" void m3579 (); extern "C" void m3580 (); extern "C" void m3581 (); extern "C" void m3582 (); extern "C" void m3583 (); extern "C" void m3584 (); extern "C" void m3585 (); extern "C" void m3586 (); extern "C" void m3587 (); extern "C" void m3588 (); extern "C" void m3589 (); extern "C" void m3590 (); extern "C" void m3591 (); extern "C" void m3592 (); extern "C" void m3593 (); extern "C" void m3594 (); extern "C" void m3595 (); extern "C" void m3596 (); extern "C" void m3597 (); extern "C" void m3598 (); extern "C" void m3599 (); extern "C" void m3600 (); extern "C" void m3601 (); extern "C" void m3602 (); extern "C" void m3603 (); extern "C" void m3604 (); extern "C" void m3605 (); extern "C" void m3606 (); extern "C" void m3607 (); extern "C" void m3608 (); extern "C" void m3609 (); extern "C" void m3610 (); extern "C" void m3611 (); extern "C" void m3612 (); extern "C" void m3613 (); extern "C" void m3614 (); extern "C" void m3615 (); extern "C" void m3616 (); extern "C" void m3617 (); extern "C" void m3618 (); extern "C" void m3619 (); extern "C" void m3620 (); extern "C" void m3621 (); extern "C" void m3622 (); extern "C" void m3623 (); extern "C" void m3624 (); extern "C" void m3625 (); extern "C" void m3626 (); extern "C" void m3627 (); extern "C" void m3628 (); extern "C" void m3629 (); extern "C" void m3630 (); extern "C" void m3631 (); extern "C" void m3632 (); extern "C" void m3633 (); extern "C" void m3634 (); extern "C" void m3635 (); extern "C" void m3636 (); extern "C" void m3637 (); extern "C" void m3638 (); extern "C" void m3639 (); extern "C" void m3640 (); extern "C" void m3641 (); extern "C" void m3642 (); extern "C" void m3643 (); extern "C" void m3644 (); extern "C" void m3645 (); extern "C" void m3646 (); extern "C" void m3647 (); extern "C" void m3648 (); extern "C" void m3649 (); extern "C" void m3650 (); extern "C" void m3651 (); extern "C" void m3652 (); extern "C" void m3653 (); extern "C" void m3654 (); extern "C" void m3655 (); extern "C" void m3656 (); extern "C" void m3657 (); extern "C" void m3658 (); extern "C" void m3659 (); extern "C" void m3660 (); extern "C" void m3661 (); extern "C" void m3662 (); extern "C" void m3663 (); extern "C" void m3664 (); extern "C" void m3665 (); extern "C" void m3666 (); extern "C" void m3667 (); extern "C" void m3668 (); extern "C" void m3669 (); extern "C" void m3670 (); extern "C" void m3671 (); extern "C" void m3672 (); extern "C" void m3673 (); extern "C" void m3674 (); extern "C" void m3675 (); extern "C" void m3676 (); extern "C" void m3677 (); extern "C" void m3678 (); extern "C" void m3679 (); extern "C" void m3680 (); extern "C" void m3681 (); extern "C" void m3682 (); extern "C" void m3683 (); extern "C" void m3684 (); extern "C" void m3685 (); extern "C" void m3686 (); extern "C" void m3687 (); extern "C" void m3688 (); extern "C" void m3689 (); extern "C" void m3690 (); extern "C" void m3691 (); extern "C" void m3692 (); extern "C" void m3693 (); extern "C" void m3694 (); extern "C" void m3695 (); extern "C" void m3696 (); extern "C" void m3697 (); extern "C" void m3698 (); extern "C" void m3699 (); extern "C" void m3700 (); extern "C" void m3701 (); extern "C" void m3702 (); extern "C" void m3703 (); extern "C" void m3704 (); extern "C" void m3705 (); extern "C" void m3706 (); extern "C" void m3707 (); extern "C" void m3708 (); extern "C" void m3709 (); extern "C" void m3710 (); extern "C" void m3711 (); extern "C" void m3712 (); extern "C" void m3713 (); extern "C" void m3714 (); extern "C" void m3715 (); extern "C" void m3716 (); extern "C" void m3717 (); extern "C" void m3718 (); extern "C" void m3719 (); extern "C" void m3720 (); extern "C" void m3721 (); extern "C" void m3722 (); extern "C" void m3723 (); extern "C" void m3724 (); extern "C" void m3725 (); extern "C" void m3726 (); extern "C" void m3727 (); extern "C" void m3728 (); extern "C" void m3729 (); extern "C" void m3730 (); extern "C" void m3731 (); extern "C" void m3732 (); extern "C" void m3733 (); extern "C" void m3734 (); extern "C" void m3735 (); extern "C" void m3736 (); extern "C" void m3737 (); extern "C" void m3738 (); extern "C" void m3739 (); extern "C" void m3740 (); extern "C" void m3741 (); extern "C" void m3742 (); extern "C" void m3743 (); extern "C" void m3744 (); extern "C" void m3745 (); extern "C" void m3746 (); extern "C" void m3747 (); extern "C" void m3748 (); extern "C" void m3749 (); extern "C" void m3750 (); extern "C" void m3751 (); extern "C" void m3752 (); extern "C" void m3753 (); extern "C" void m3754 (); extern "C" void m3755 (); extern "C" void m3756 (); extern "C" void m3757 (); extern "C" void m3758 (); extern "C" void m3759 (); extern "C" void m3760 (); extern "C" void m3761 (); extern "C" void m3762 (); extern "C" void m3763 (); extern "C" void m3764 (); extern "C" void m3765 (); extern "C" void m3766 (); extern "C" void m3767 (); extern "C" void m3768 (); extern "C" void m3769 (); extern "C" void m3770 (); extern "C" void m3771 (); extern "C" void m3772 (); extern "C" void m3773 (); extern "C" void m3774 (); extern "C" void m3775 (); extern "C" void m3776 (); extern "C" void m3777 (); extern "C" void m3778 (); extern "C" void m3779 (); extern "C" void m3780 (); extern "C" void m3781 (); extern "C" void m3782 (); extern "C" void m3783 (); extern "C" void m3784 (); extern "C" void m3785 (); extern "C" void m3786 (); extern "C" void m3787 (); extern "C" void m3788 (); extern "C" void m3789 (); extern "C" void m3790 (); extern "C" void m3791 (); extern "C" void m3792 (); extern "C" void m3793 (); extern "C" void m3794 (); extern "C" void m3795 (); extern "C" void m3796 (); extern "C" void m3797 (); extern "C" void m3798 (); extern "C" void m3799 (); extern "C" void m3800 (); extern "C" void m3801 (); extern "C" void m3802 (); extern "C" void m3803 (); extern "C" void m3804 (); extern "C" void m3805 (); extern "C" void m3806 (); extern "C" void m3807 (); extern "C" void m3808 (); extern "C" void m3809 (); extern "C" void m3810 (); extern "C" void m3811 (); extern "C" void m3812 (); extern "C" void m3813 (); extern "C" void m3814 (); extern "C" void m3815 (); extern "C" void m3816 (); extern "C" void m3817 (); extern "C" void m3818 (); extern "C" void m3819 (); extern "C" void m3820 (); extern "C" void m3821 (); extern "C" void m3822 (); extern "C" void m3823 (); extern "C" void m3824 (); extern "C" void m3825 (); extern "C" void m3826 (); extern "C" void m3827 (); extern "C" void m3828 (); extern "C" void m3829 (); extern "C" void m3830 (); extern "C" void m3831 (); extern "C" void m3832 (); extern "C" void m3833 (); extern "C" void m3834 (); extern "C" void m3835 (); extern "C" void m3836 (); extern "C" void m3837 (); extern "C" void m3838 (); extern "C" void m3839 (); extern "C" void m3840 (); extern "C" void m3841 (); extern "C" void m3842 (); extern "C" void m3843 (); extern "C" void m3844 (); extern "C" void m3845 (); extern "C" void m3846 (); extern "C" void m3847 (); extern "C" void m3848 (); extern "C" void m3849 (); extern "C" void m3850 (); extern "C" void m3851 (); extern "C" void m3852 (); extern "C" void m3853 (); extern "C" void m3854 (); extern "C" void m3855 (); extern "C" void m3856 (); extern "C" void m3857 (); extern "C" void m3858 (); extern "C" void m3859 (); extern "C" void m3860 (); extern "C" void m3861 (); extern "C" void m3862 (); extern "C" void m3863 (); extern "C" void m3864 (); extern "C" void m4001 (); extern "C" void m4002 (); extern "C" void m4003 (); extern "C" void m4004 (); extern "C" void m4005 (); extern "C" void m4006 (); extern "C" void m4007 (); extern "C" void m4008 (); extern "C" void m4009 (); extern "C" void m4010 (); extern "C" void m4011 (); extern "C" void m4012 (); extern "C" void m4013 (); extern "C" void m4014 (); extern "C" void m4015 (); extern "C" void m4016 (); extern "C" void m4017 (); extern "C" void m4018 (); extern "C" void m4019 (); extern "C" void m4020 (); extern "C" void m4021 (); extern "C" void m4022 (); extern "C" void m4023 (); extern "C" void m4024 (); extern "C" void m4025 (); extern "C" void m4026 (); extern "C" void m4027 (); extern "C" void m4028 (); extern "C" void m4029 (); extern "C" void m4030 (); extern "C" void m4031 (); extern "C" void m4032 (); extern "C" void m4033 (); extern "C" void m4034 (); extern "C" void m4035 (); extern "C" void m4036 (); extern "C" void m4037 (); extern "C" void m4038 (); extern "C" void m4039 (); extern "C" void m4040 (); extern "C" void m4041 (); extern "C" void m4042 (); extern "C" void m4043 (); extern "C" void m4044 (); extern "C" void m4045 (); extern "C" void m4046 (); extern "C" void m4047 (); extern "C" void m4048 (); extern "C" void m4049 (); extern "C" void m4050 (); extern "C" void m4051 (); extern "C" void m4052 (); extern "C" void m4053 (); extern "C" void m4054 (); extern "C" void m4055 (); extern "C" void m4056 (); extern "C" void m4057 (); extern "C" void m4058 (); extern "C" void m4059 (); extern "C" void m4060 (); extern "C" void m4061 (); extern "C" void m4062 (); extern "C" void m4063 (); extern "C" void m4064 (); extern "C" void m4065 (); extern "C" void m4066 (); extern "C" void m4067 (); extern "C" void m4068 (); extern "C" void m4069 (); extern "C" void m4070 (); extern "C" void m4071 (); extern "C" void m4072 (); extern "C" void m4073 (); extern "C" void m4074 (); extern "C" void m4075 (); extern "C" void m4076 (); extern "C" void m4077 (); extern "C" void m4078 (); extern "C" void m4079 (); extern "C" void m4080 (); extern "C" void m4081 (); extern "C" void m4082 (); extern "C" void m4083 (); extern "C" void m4084 (); extern "C" void m4085 (); extern "C" void m4086 (); extern "C" void m4087 (); extern "C" void m4088 (); extern "C" void m4089 (); extern "C" void m4090 (); extern "C" void m4091 (); extern "C" void m4092 (); extern "C" void m4093 (); extern "C" void m4094 (); extern "C" void m4095 (); extern "C" void m4096 (); extern "C" void m4097 (); extern "C" void m4098 (); extern "C" void m4099 (); extern "C" void m4100 (); extern "C" void m4101 (); extern "C" void m4102 (); extern "C" void m4103 (); extern "C" void m4104 (); extern "C" void m4105 (); extern "C" void m4106 (); extern "C" void m4107 (); extern "C" void m4108 (); extern "C" void m4109 (); extern "C" void m4110 (); extern "C" void m4111 (); extern "C" void m4112 (); extern "C" void m3958 (); extern "C" void m3962 (); extern "C" void m4113 (); extern "C" void m4114 (); extern "C" void m4115 (); extern "C" void m4116 (); extern "C" void m4117 (); extern "C" void m4118 (); extern "C" void m4119 (); extern "C" void m4120 (); extern "C" void m4121 (); extern "C" void m4122 (); extern "C" void m4123 (); extern "C" void m4124 (); extern "C" void m4125 (); extern "C" void m4126 (); extern "C" void m4127 (); extern "C" void m4128 (); extern "C" void m4129 (); extern "C" void m4130 (); extern "C" void m4131 (); extern "C" void m4132 (); extern "C" void m4133 (); extern "C" void m4134 (); extern "C" void m4135 (); extern "C" void m4136 (); extern "C" void m4137 (); extern "C" void m4138 (); extern "C" void m4139 (); extern "C" void m4140 (); extern "C" void m4141 (); extern "C" void m4142 (); extern "C" void m4143 (); extern "C" void m4144 (); extern "C" void m4145 (); extern "C" void m4146 (); extern "C" void m4147 (); extern "C" void m4148 (); extern "C" void m4149 (); extern "C" void m4150 (); extern "C" void m4151 (); extern "C" void m4152 (); extern "C" void m4153 (); extern "C" void m4154 (); extern "C" void m4155 (); extern "C" void m4156 (); extern "C" void m4157 (); extern "C" void m4158 (); extern "C" void m4159 (); extern "C" void m4160 (); extern "C" void m4161 (); extern "C" void m4162 (); extern "C" void m4163 (); extern "C" void m4164 (); extern "C" void m4165 (); extern "C" void m4166 (); extern "C" void m4167 (); extern "C" void m4168 (); extern "C" void m4169 (); extern "C" void m3961 (); extern "C" void m3926 (); extern "C" void m3960 (); extern "C" void m3963 (); extern "C" void m4170 (); extern "C" void m4171 (); extern "C" void m4172 (); extern "C" void m4173 (); extern "C" void m4174 (); extern "C" void m4175 (); extern "C" void m4176 (); extern "C" void m4177 (); extern "C" void m4178 (); extern "C" void m4179 (); extern "C" void m4180 (); extern "C" void m4181 (); extern "C" void m4182 (); extern "C" void m4183 (); extern "C" void m4184 (); extern "C" void m4185 (); extern "C" void m4186 (); extern "C" void m4187 (); extern "C" void m4188 (); extern "C" void m4189 (); extern "C" void m4190 (); extern "C" void m4191 (); extern "C" void m4192 (); extern "C" void m4193 (); extern "C" void m4194 (); extern "C" void m4195 (); extern "C" void m4196 (); extern "C" void m4197 (); extern "C" void m4198 (); extern "C" void m4199 (); extern "C" void m4200 (); extern "C" void m4201 (); extern "C" void m4202 (); extern "C" void m4203 (); extern "C" void m4204 (); extern "C" void m4205 (); extern "C" void m4206 (); extern "C" void m4207 (); extern "C" void m4208 (); extern "C" void m4209 (); extern "C" void m4210 (); extern "C" void m4211 (); extern "C" void m4212 (); extern "C" void m4213 (); extern "C" void m4214 (); extern "C" void m4215 (); extern "C" void m4216 (); extern "C" void m4217 (); extern "C" void m4218 (); extern "C" void m4219 (); extern "C" void m4220 (); extern "C" void m4221 (); extern "C" void m4222 (); extern "C" void m4223 (); extern "C" void m4224 (); extern "C" void m4225 (); extern "C" void m4226 (); extern "C" void m4227 (); extern "C" void m4228 (); extern "C" void m4229 (); extern "C" void m4230 (); extern "C" void m4231 (); extern "C" void m4232 (); extern "C" void m3964 (); extern "C" void m4233 (); extern "C" void m4234 (); extern "C" void m4235 (); extern "C" void m4236 (); extern "C" void m4237 (); extern "C" void m3969 (); extern "C" void m4238 (); extern "C" void m4239 (); extern "C" void m4240 (); extern "C" void m4241 (); extern "C" void m4242 (); extern "C" void m4243 (); extern "C" void m4244 (); extern "C" void m4245 (); extern "C" void m4246 (); extern "C" void m4247 (); extern "C" void m4248 (); extern "C" void m4249 (); extern "C" void m4250 (); extern "C" void m4251 (); extern "C" void m4252 (); extern "C" void m4253 (); extern "C" void m4254 (); extern "C" void m4255 (); extern "C" void m4256 (); extern "C" void m4257 (); extern "C" void m4258 (); extern "C" void m4259 (); extern "C" void m4260 (); extern "C" void m4261 (); extern "C" void m4262 (); extern "C" void m4263 (); extern "C" void m4264 (); extern "C" void m4265 (); extern "C" void m4266 (); extern "C" void m4267 (); extern "C" void m4268 (); extern "C" void m4269 (); extern "C" void m4270 (); extern "C" void m4271 (); extern "C" void m4272 (); extern "C" void m4273 (); extern "C" void m3990 (); extern "C" void m4274 (); extern "C" void m4275 (); extern "C" void m3979 (); extern "C" void m3978 (); extern "C" void m3968 (); extern "C" void m4276 (); extern "C" void m3989 (); extern "C" void m4277 (); extern "C" void m3965 (); extern "C" void m4278 (); extern "C" void m4279 (); extern "C" void m4280 (); extern "C" void m3966 (); extern "C" void m4281 (); extern "C" void m4282 (); extern "C" void m4283 (); extern "C" void m4284 (); extern "C" void m4285 (); extern "C" void m4286 (); extern "C" void m4287 (); extern "C" void m4288 (); extern "C" void m4289 (); extern "C" void m4290 (); extern "C" void m4291 (); extern "C" void m4292 (); extern "C" void m4293 (); extern "C" void m4294 (); extern "C" void m4295 (); extern "C" void m4296 (); extern "C" void m4297 (); extern "C" void m4298 (); extern "C" void m4299 (); extern "C" void m4300 (); extern "C" void m4301 (); extern "C" void m4302 (); extern "C" void m4303 (); extern "C" void m4304 (); extern "C" void m4305 (); extern "C" void m4306 (); extern "C" void m4307 (); extern "C" void m4308 (); extern "C" void m4309 (); extern "C" void m4310 (); extern "C" void m4311 (); extern "C" void m4312 (); extern "C" void m4313 (); extern "C" void m4314 (); extern "C" void m4315 (); extern "C" void m4316 (); extern "C" void m4317 (); extern "C" void m4318 (); extern "C" void m4319 (); extern "C" void m4320 (); extern "C" void m4321 (); extern "C" void m4322 (); extern "C" void m4323 (); extern "C" void m4324 (); extern "C" void m4325 (); extern "C" void m4326 (); extern "C" void m4327 (); extern "C" void m4328 (); extern "C" void m4329 (); extern "C" void m4330 (); extern "C" void m4331 (); extern "C" void m4332 (); extern "C" void m4333 (); extern "C" void m4334 (); extern "C" void m4335 (); extern "C" void m4336 (); extern "C" void m4337 (); extern "C" void m4338 (); extern "C" void m4339 (); extern "C" void m4340 (); extern "C" void m4341 (); extern "C" void m4342 (); extern "C" void m4343 (); extern "C" void m4344 (); extern "C" void m4345 (); extern "C" void m4346 (); extern "C" void m4347 (); extern "C" void m4348 (); extern "C" void m4349 (); extern "C" void m4350 (); extern "C" void m4351 (); extern "C" void m4352 (); extern "C" void m4353 (); extern "C" void m4354 (); extern "C" void m4355 (); extern "C" void m4356 (); extern "C" void m4357 (); extern "C" void m4358 (); extern "C" void m4359 (); extern "C" void m4360 (); extern "C" void m4361 (); extern "C" void m4362 (); extern "C" void m4363 (); extern "C" void m4364 (); extern "C" void m4365 (); extern "C" void m4366 (); extern "C" void m4367 (); extern "C" void m4368 (); extern "C" void m4369 (); extern "C" void m4370 (); extern "C" void m4371 (); extern "C" void m4372 (); extern "C" void m4373 (); extern "C" void m4374 (); extern "C" void m4375 (); extern "C" void m4376 (); extern "C" void m4377 (); extern "C" void m4378 (); extern "C" void m4379 (); extern "C" void m4380 (); extern "C" void m4381 (); extern "C" void m4382 (); extern "C" void m4383 (); extern "C" void m4384 (); extern "C" void m4385 (); extern "C" void m4386 (); extern "C" void m4387 (); extern "C" void m4388 (); extern "C" void m4389 (); extern "C" void m4390 (); extern "C" void m4391 (); extern "C" void m4392 (); extern "C" void m4393 (); extern "C" void m4394 (); extern "C" void m4395 (); extern "C" void m4396 (); extern "C" void m4397 (); extern "C" void m4398 (); extern "C" void m4399 (); extern "C" void m4400 (); extern "C" void m4401 (); extern "C" void m4402 (); extern "C" void m4403 (); extern "C" void m4404 (); extern "C" void m4405 (); extern "C" void m4406 (); extern "C" void m4407 (); extern "C" void m4408 (); extern "C" void m4409 (); extern "C" void m4410 (); extern "C" void m4411 (); extern "C" void m4412 (); extern "C" void m4413 (); extern "C" void m4414 (); extern "C" void m4415 (); extern "C" void m4416 (); extern "C" void m4417 (); extern "C" void m4418 (); extern "C" void m4419 (); extern "C" void m4420 (); extern "C" void m4421 (); extern "C" void m4422 (); extern "C" void m4423 (); extern "C" void m4424 (); extern "C" void m4425 (); extern "C" void m4426 (); extern "C" void m4427 (); extern "C" void m4428 (); extern "C" void m4429 (); extern "C" void m4430 (); extern "C" void m4431 (); extern "C" void m4432 (); extern "C" void m4433 (); extern "C" void m4434 (); extern "C" void m4435 (); extern "C" void m4436 (); extern "C" void m4437 (); extern "C" void m4438 (); extern "C" void m4439 (); extern "C" void m4440 (); extern "C" void m4441 (); extern "C" void m3997 (); extern "C" void m4442 (); extern "C" void m4443 (); extern "C" void m4444 (); extern "C" void m4445 (); extern "C" void m4446 (); extern "C" void m4447 (); extern "C" void m4448 (); extern "C" void m4449 (); extern "C" void m4450 (); extern "C" void m4451 (); extern "C" void m4452 (); extern "C" void m4453 (); extern "C" void m4454 (); extern "C" void m4455 (); extern "C" void m3995 (); extern "C" void m4456 (); extern "C" void m4457 (); extern "C" void m4458 (); extern "C" void m3996 (); extern "C" void m4459 (); extern "C" void m4460 (); extern "C" void m4461 (); extern "C" void m4462 (); extern "C" void m4463 (); extern "C" void m4464 (); extern "C" void m4465 (); extern "C" void m4466 (); extern "C" void m4467 (); extern "C" void m4468 (); extern "C" void m4469 (); extern "C" void m4470 (); extern "C" void m4471 (); extern "C" void m4472 (); extern "C" void m4473 (); extern "C" void m4474 (); extern "C" void m4475 (); extern "C" void m4476 (); extern "C" void m4477 (); extern "C" void m4478 (); extern "C" void m4479 (); extern "C" void m4480 (); extern "C" void m4481 (); extern "C" void m4482 (); extern "C" void m4483 (); extern "C" void m4484 (); extern "C" void m3993 (); extern "C" void m4485 (); extern "C" void m4486 (); extern "C" void m4487 (); extern "C" void m4488 (); extern "C" void m2889 (); extern "C" void m4489 (); extern "C" void m4490 (); extern "C" void m4491 (); extern "C" void m4492 (); extern "C" void m4493 (); extern "C" void m4494 (); extern "C" void m4495 (); extern "C" void m4496 (); extern "C" void m4497 (); extern "C" void m4498 (); extern "C" void m4499 (); extern "C" void m4500 (); extern "C" void m4501 (); extern "C" void m3994 (); extern "C" void m4502 (); extern "C" void m4503 (); extern "C" void m4504 (); extern "C" void m4505 (); extern "C" void m4506 (); extern "C" void m4507 (); extern "C" void m4508 (); extern "C" void m4509 (); extern "C" void m4510 (); extern "C" void m4511 (); extern "C" void m4512 (); extern "C" void m4513 (); extern "C" void m4514 (); extern "C" void m4515 (); extern "C" void m4516 (); extern "C" void m4517 (); extern "C" void m4518 (); extern "C" void m4519 (); extern "C" void m4520 (); extern "C" void m4521 (); extern "C" void m4522 (); extern "C" void m4523 (); extern "C" void m4524 (); extern "C" void m4525 (); extern "C" void m4526 (); extern "C" void m4527 (); extern "C" void m4528 (); extern "C" void m4529 (); extern "C" void m4530 (); extern "C" void m4531 (); extern "C" void m4532 (); extern "C" void m4533 (); extern "C" void m4534 (); extern "C" void m4535 (); extern "C" void m4536 (); extern "C" void m4537 (); extern "C" void m4538 (); extern "C" void m4539 (); extern "C" void m4540 (); extern "C" void m4541 (); extern "C" void m4542 (); extern "C" void m4543 (); extern "C" void m4544 (); extern "C" void m4545 (); extern "C" void m4546 (); extern "C" void m4547 (); extern "C" void m4548 (); extern "C" void m4549 (); extern "C" void m4550 (); extern "C" void m4551 (); extern "C" void m4552 (); extern "C" void m4553 (); extern "C" void m4554 (); extern "C" void m4555 (); extern "C" void m4556 (); extern "C" void m4557 (); extern "C" void m4558 (); extern "C" void m4559 (); extern "C" void m4560 (); extern "C" void m4561 (); extern "C" void m4562 (); extern "C" void m4563 (); extern "C" void m4564 (); extern "C" void m4565 (); extern "C" void m4566 (); extern "C" void m4567 (); extern "C" void m4568 (); extern "C" void m4569 (); extern "C" void m4570 (); extern "C" void m4571 (); extern "C" void m4572 (); extern "C" void m4573 (); extern "C" void m4574 (); extern "C" void m4575 (); extern "C" void m4576 (); extern "C" void m4577 (); extern "C" void m4578 (); extern "C" void m4579 (); extern "C" void m4580 (); extern "C" void m4581 (); extern "C" void m4582 (); extern "C" void m4583 (); extern "C" void m4584 (); extern "C" void m4585 (); extern "C" void m4586 (); extern "C" void m4587 (); extern "C" void m4588 (); extern "C" void m4589 (); extern "C" void m4590 (); extern "C" void m4591 (); extern "C" void m4592 (); extern "C" void m4593 (); extern "C" void m4594 (); extern "C" void m4595 (); extern "C" void m4596 (); extern "C" void m4597 (); extern "C" void m4598 (); extern "C" void m4599 (); extern "C" void m4600 (); extern "C" void m4601 (); extern "C" void m4602 (); extern "C" void m4603 (); extern "C" void m4604 (); extern "C" void m4605 (); extern "C" void m4606 (); extern "C" void m4607 (); extern "C" void m4608 (); extern "C" void m4609 (); extern "C" void m4610 (); extern "C" void m4611 (); extern "C" void m4612 (); extern "C" void m4613 (); extern "C" void m4614 (); extern "C" void m4615 (); extern "C" void m4616 (); extern "C" void m4617 (); extern "C" void m4618 (); extern "C" void m4619 (); extern "C" void m4620 (); extern "C" void m4621 (); extern "C" void m4622 (); extern "C" void m4623 (); extern "C" void m4624 (); extern "C" void m4625 (); extern "C" void m4626 (); extern "C" void m4627 (); extern "C" void m4628 (); extern "C" void m4629 (); extern "C" void m4630 (); extern "C" void m4631 (); extern "C" void m4632 (); extern "C" void m4633 (); extern "C" void m4634 (); extern "C" void m4635 (); extern "C" void m4636 (); extern "C" void m4637 (); extern "C" void m4638 (); extern "C" void m4639 (); extern "C" void m4640 (); extern "C" void m4641 (); extern "C" void m4642 (); extern "C" void m4643 (); extern "C" void m4644 (); extern "C" void m4645 (); extern "C" void m4646 (); extern "C" void m4647 (); extern "C" void m4648 (); extern "C" void m4649 (); extern "C" void m4650 (); extern "C" void m4651 (); extern "C" void m4652 (); extern "C" void m4653 (); extern "C" void m4654 (); extern "C" void m4655 (); extern "C" void m4656 (); extern "C" void m4657 (); extern "C" void m4658 (); extern "C" void m4659 (); extern "C" void m4660 (); extern "C" void m4661 (); extern "C" void m4662 (); extern "C" void m4663 (); extern "C" void m4664 (); extern "C" void m4665 (); extern "C" void m4666 (); extern "C" void m4667 (); extern "C" void m4668 (); extern "C" void m4669 (); extern "C" void m4670 (); extern "C" void m4671 (); extern "C" void m4672 (); extern "C" void m4673 (); extern "C" void m4674 (); extern "C" void m4675 (); extern "C" void m4676 (); extern "C" void m4677 (); extern "C" void m4678 (); extern "C" void m4679 (); extern "C" void m4680 (); extern "C" void m4681 (); extern "C" void m4682 (); extern "C" void m4683 (); extern "C" void m4684 (); extern "C" void m4685 (); extern "C" void m4686 (); extern "C" void m4687 (); extern "C" void m4688 (); extern "C" void m4689 (); extern "C" void m4690 (); extern "C" void m4691 (); extern "C" void m4692 (); extern "C" void m4693 (); extern "C" void m4694 (); extern "C" void m4695 (); extern "C" void m4696 (); extern "C" void m4697 (); extern "C" void m4698 (); extern "C" void m4699 (); extern "C" void m4700 (); extern "C" void m4701 (); extern "C" void m4702 (); extern "C" void m4703 (); extern "C" void m4704 (); extern "C" void m4705 (); extern "C" void m4706 (); extern "C" void m4707 (); extern "C" void m4708 (); extern "C" void m4709 (); extern "C" void m4710 (); extern "C" void m4711 (); extern "C" void m4712 (); extern "C" void m4713 (); extern "C" void m4714 (); extern "C" void m4715 (); extern "C" void m4716 (); extern "C" void m4717 (); extern "C" void m4718 (); extern "C" void m4719 (); extern "C" void m4720 (); extern "C" void m4721 (); extern "C" void m4722 (); extern "C" void m4723 (); extern "C" void m4724 (); extern "C" void m4725 (); extern "C" void m4726 (); extern "C" void m4727 (); extern "C" void m4728 (); extern "C" void m4729 (); extern "C" void m4730 (); extern "C" void m4731 (); extern "C" void m4732 (); extern "C" void m4733 (); extern "C" void m4734 (); extern "C" void m4735 (); extern "C" void m4736 (); extern "C" void m4737 (); extern "C" void m4738 (); extern "C" void m4739 (); extern "C" void m4740 (); extern "C" void m4741 (); extern "C" void m4742 (); extern "C" void m4743 (); extern "C" void m4744 (); extern "C" void m4745 (); extern "C" void m4746 (); extern "C" void m4747 (); extern "C" void m4748 (); extern "C" void m4749 (); extern "C" void m4750 (); extern "C" void m4751 (); extern "C" void m4752 (); extern "C" void m4753 (); extern "C" void m4754 (); extern "C" void m4755 (); extern "C" void m4756 (); extern "C" void m4757 (); extern "C" void m4758 (); extern "C" void m4759 (); extern "C" void m4760 (); extern "C" void m4761 (); extern "C" void m4762 (); extern "C" void m4763 (); extern "C" void m4764 (); extern "C" void m4765 (); extern "C" void m4766 (); extern "C" void m4767 (); extern "C" void m4768 (); extern "C" void m4769 (); extern "C" void m4770 (); extern "C" void m4771 (); extern "C" void m4772 (); extern "C" void m4773 (); extern "C" void m4774 (); extern "C" void m4775 (); extern "C" void m4776 (); extern "C" void m4777 (); extern "C" void m4778 (); extern "C" void m4779 (); extern "C" void m4780 (); extern "C" void m4781 (); extern "C" void m4782 (); extern "C" void m4783 (); extern "C" void m4784 (); extern "C" void m4785 (); extern "C" void m4786 (); extern "C" void m4787 (); extern "C" void m4788 (); extern "C" void m4789 (); extern "C" void m4790 (); extern "C" void m4791 (); extern "C" void m4792 (); extern "C" void m4793 (); extern "C" void m4794 (); extern "C" void m4795 (); extern "C" void m4796 (); extern "C" void m4797 (); extern "C" void m4798 (); extern "C" void m4799 (); extern "C" void m4800 (); extern "C" void m4801 (); extern "C" void m4802 (); extern "C" void m4803 (); extern "C" void m4804 (); extern "C" void m4805 (); extern "C" void m4806 (); extern "C" void m4807 (); extern "C" void m4808 (); extern "C" void m4809 (); extern "C" void m4810 (); extern "C" void m4811 (); extern "C" void m4812 (); extern "C" void m4813 (); extern "C" void m4814 (); extern "C" void m4815 (); extern "C" void m4816 (); extern "C" void m4817 (); extern "C" void m4818 (); extern "C" void m4819 (); extern "C" void m4820 (); extern "C" void m4821 (); extern "C" void m4822 (); extern "C" void m3959 (); extern "C" void m4823 (); extern "C" void m4824 (); extern "C" void m4825 (); extern "C" void m4826 (); extern "C" void m4827 (); extern "C" void m4828 (); extern "C" void m4829 (); extern "C" void m4830 (); extern "C" void m4831 (); extern "C" void m4832 (); extern "C" void m4833 (); extern "C" void m4834 (); extern "C" void m4835 (); extern "C" void m4836 (); extern "C" void m4837 (); extern "C" void m4838 (); extern "C" void m4839 (); extern "C" void m4840 (); extern "C" void m4841 (); extern "C" void m4842 (); extern "C" void m4843 (); extern "C" void m4844 (); extern "C" void m4845 (); extern "C" void m4846 (); extern "C" void m4847 (); extern "C" void m4848 (); extern "C" void m4849 (); extern "C" void m4850 (); extern "C" void m4851 (); extern "C" void m4852 (); extern "C" void m4853 (); extern "C" void m4854 (); extern "C" void m4855 (); extern "C" void m4856 (); extern "C" void m4857 (); extern "C" void m4858 (); extern "C" void m4859 (); extern "C" void m4860 (); extern "C" void m4861 (); extern "C" void m4862 (); extern "C" void m4863 (); extern "C" void m4864 (); extern "C" void m4865 (); extern "C" void m4866 (); extern "C" void m4867 (); extern "C" void m4868 (); extern "C" void m4869 (); extern "C" void m4870 (); extern "C" void m4871 (); extern "C" void m4872 (); extern "C" void m4873 (); extern "C" void m4874 (); extern "C" void m4875 (); extern "C" void m4876 (); extern "C" void m4877 (); extern "C" void m3967 (); extern "C" void m4878 (); extern "C" void m4879 (); extern "C" void m4880 (); extern "C" void m4881 (); extern "C" void m4882 (); extern "C" void m4883 (); extern "C" void m1474 (); extern "C" void m4977 (); extern "C" void m4974 (); extern "C" void m2842 (); extern "C" void m4978 (); extern "C" void m1532 (); extern "C" void m4979 (); extern "C" void m2906 (); extern "C" void m2862 (); extern "C" void m4980 (); extern "C" void m4981 (); extern "C" void m4982 (); extern "C" void m4983 (); extern "C" void m4984 (); extern "C" void m4985 (); extern "C" void m4986 (); extern "C" void m4987 (); extern "C" void m2852 (); extern "C" void m4988 (); extern "C" void m4989 (); extern "C" void m4990 (); extern "C" void m2907 (); extern "C" void m4991 (); extern "C" void m4992 (); extern "C" void m4993 (); extern "C" void m4994 (); extern "C" void m4995 (); extern "C" void m4996 (); extern "C" void m4997 (); extern "C" void m4998 (); extern "C" void m4999 (); extern "C" void m5000 (); extern "C" void m5001 (); extern "C" void m5002 (); extern "C" void m5003 (); extern "C" void m5004 (); extern "C" void m5005 (); extern "C" void m5006 (); extern "C" void m5007 (); extern "C" void m5008 (); extern "C" void m5009 (); extern "C" void m5010 (); extern "C" void m5011 (); extern "C" void m5012 (); extern "C" void m2843 (); extern "C" void m1464 (); extern "C" void m2845 (); extern "C" void m5013 (); extern "C" void m5014 (); extern "C" void m5015 (); extern "C" void m5016 (); extern "C" void m5017 (); extern "C" void m5018 (); extern "C" void m5019 (); extern "C" void m5020 (); extern "C" void m5021 (); extern "C" void m5022 (); extern "C" void m5023 (); extern "C" void m5024 (); extern "C" void m3951 (); extern "C" void m5025 (); extern "C" void m5026 (); extern "C" void m4912 (); extern "C" void m2883 (); extern "C" void m3935 (); extern "C" void m4946 (); extern "C" void m3939 (); extern "C" void m5027 (); extern "C" void m5028 (); extern "C" void m5029 (); extern "C" void m5030 (); extern "C" void m5031 (); extern "C" void m5032 (); extern "C" void m5033 (); extern "C" void m5034 (); extern "C" void m5035 (); extern "C" void m5036 (); extern "C" void m5037 (); extern "C" void m5038 (); extern "C" void m5039 (); extern "C" void m5040 (); extern "C" void m5041 (); extern "C" void m5042 (); extern "C" void m5043 (); extern "C" void m5044 (); extern "C" void m5045 (); extern "C" void m5046 (); extern "C" void m5047 (); extern "C" void m5048 (); extern "C" void m5049 (); extern "C" void m5050 (); extern "C" void m5051 (); extern "C" void m5052 (); extern "C" void m5053 (); extern "C" void m5054 (); extern "C" void m5055 (); extern "C" void m5056 (); extern "C" void m5057 (); extern "C" void m5058 (); extern "C" void m5059 (); extern "C" void m5060 (); extern "C" void m4909 (); extern "C" void m4910 (); extern "C" void m5061 (); extern "C" void m5062 (); extern "C" void m5063 (); extern "C" void m5064 (); extern "C" void m5065 (); extern "C" void m5066 (); extern "C" void m5067 (); extern "C" void m5068 (); extern "C" void m5069 (); extern "C" void m5070 (); extern "C" void m5071 (); extern "C" void m5072 (); extern "C" void m5073 (); extern "C" void m5074 (); extern "C" void m5075 (); extern "C" void m5076 (); extern "C" void m5077 (); extern "C" void m5078 (); extern "C" void m5079 (); extern "C" void m5080 (); extern "C" void m5081 (); extern "C" void m5082 (); extern "C" void m5083 (); extern "C" void m5084 (); extern "C" void m5085 (); extern "C" void m5086 (); extern "C" void m5087 (); extern "C" void m4968 (); extern "C" void m5088 (); extern "C" void m5089 (); extern "C" void m5090 (); extern "C" void m5091 (); extern "C" void m5092 (); extern "C" void m5093 (); extern "C" void m5094 (); extern "C" void m5095 (); extern "C" void m5096 (); extern "C" void m5097 (); extern "C" void m5098 (); extern "C" void m5099 (); extern "C" void m5100 (); extern "C" void m5101 (); extern "C" void m5102 (); extern "C" void m5103 (); extern "C" void m5104 (); extern "C" void m5105 (); extern "C" void m5106 (); extern "C" void m5107 (); extern "C" void m5108 (); extern "C" void m5109 (); extern "C" void m5110 (); extern "C" void m5111 (); extern "C" void m5112 (); extern "C" void m5113 (); extern "C" void m5114 (); extern "C" void m5115 (); extern "C" void m5116 (); extern "C" void m5117 (); extern "C" void m5118 (); extern "C" void m3880 (); extern "C" void m5119 (); extern "C" void m5120 (); extern "C" void m5121 (); extern "C" void m5122 (); extern "C" void m5123 (); extern "C" void m5124 (); extern "C" void m5125 (); extern "C" void m5126 (); extern "C" void m5127 (); extern "C" void m5128 (); extern "C" void m5129 (); extern "C" void m5130 (); extern "C" void m5131 (); extern "C" void m5132 (); extern "C" void m5133 (); extern "C" void m5134 (); extern "C" void m5135 (); extern "C" void m5136 (); extern "C" void m5137 (); extern "C" void m5138 (); extern "C" void m5139 (); extern "C" void m5140 (); extern "C" void m5141 (); extern "C" void m5142 (); extern "C" void m5143 (); extern "C" void m5144 (); extern "C" void m5145 (); extern "C" void m3936 (); extern "C" void m3870 (); extern "C" void m3879 (); extern "C" void m3885 (); extern "C" void m5146 (); extern "C" void m5147 (); extern "C" void m5148 (); extern "C" void m5149 (); extern "C" void m5150 (); extern "C" void m5151 (); extern "C" void m5152 (); extern "C" void m5153 (); extern "C" void m5154 (); extern "C" void m5155 (); extern "C" void m5156 (); extern "C" void m5157 (); extern "C" void m5158 (); extern "C" void m5159 (); extern "C" void m5160 (); extern "C" void m5161 (); extern "C" void m5162 (); extern "C" void m5163 (); extern "C" void m5164 (); extern "C" void m5165 (); extern "C" void m5166 (); extern "C" void m5167 (); extern "C" void m5168 (); extern "C" void m5169 (); extern "C" void m5170 (); extern "C" void m5171 (); extern "C" void m5172 (); extern "C" void m5173 (); extern "C" void m5174 (); extern "C" void m5175 (); extern "C" void m5176 (); extern "C" void m5177 (); extern "C" void m5178 (); extern "C" void m5179 (); extern "C" void m5180 (); extern "C" void m5181 (); extern "C" void m5182 (); extern "C" void m5183 (); extern "C" void m5184 (); extern "C" void m5185 (); extern "C" void m5186 (); extern "C" void m5187 (); extern "C" void m5188 (); extern "C" void m5189 (); extern "C" void m5190 (); extern "C" void m5191 (); extern "C" void m5192 (); extern "C" void m5193 (); extern "C" void m5194 (); extern "C" void m5195 (); extern "C" void m5196 (); extern "C" void m5197 (); extern "C" void m5198 (); extern "C" void m5199 (); extern "C" void m5200 (); extern "C" void m5201 (); extern "C" void m5202 (); extern "C" void m5203 (); extern "C" void m5204 (); extern "C" void m5205 (); extern "C" void m5206 (); extern "C" void m5207 (); extern "C" void m5208 (); extern "C" void m5209 (); extern "C" void m5210 (); extern "C" void m5211 (); extern "C" void m5212 (); extern "C" void m5213 (); extern "C" void m5214 (); extern "C" void m5215 (); extern "C" void m5216 (); extern "C" void m5217 (); extern "C" void m5218 (); extern "C" void m5219 (); extern "C" void m5220 (); extern "C" void m5221 (); extern "C" void m5222 (); extern "C" void m5223 (); extern "C" void m5224 (); extern "C" void m5225 (); extern "C" void m5226 (); extern "C" void m5227 (); extern "C" void m5228 (); extern "C" void m5229 (); extern "C" void m5230 (); extern "C" void m5231 (); extern "C" void m5232 (); extern "C" void m5233 (); extern "C" void m5234 (); extern "C" void m5235 (); extern "C" void m5236 (); extern "C" void m5237 (); extern "C" void m5238 (); extern "C" void m5239 (); extern "C" void m5240 (); extern "C" void m5241 (); extern "C" void m5242 (); extern "C" void m5243 (); extern "C" void m5244 (); extern "C" void m5245 (); extern "C" void m5246 (); extern "C" void m5247 (); extern "C" void m5248 (); extern "C" void m5249 (); extern "C" void m5250 (); extern "C" void m5251 (); extern "C" void m4957 (); extern "C" void m4955 (); extern "C" void m1890 (); extern "C" void m4954 (); extern "C" void m1891 (); extern "C" void m5252 (); extern "C" void m1893 (); extern "C" void m4956 (); extern "C" void m4927 (); extern "C" void m5253 (); extern "C" void m5254 (); extern "C" void m1894 (); extern "C" void m5255 (); extern "C" void m5256 (); extern "C" void m1892 (); extern "C" void m4929 (); extern "C" void m1864 (); extern "C" void m5257 (); extern "C" void m5258 (); extern "C" void m5259 (); extern "C" void m5260 (); extern "C" void m5261 (); extern "C" void m5262 (); extern "C" void m5263 (); extern "C" void m5264 (); extern "C" void m5265 (); extern "C" void m5266 (); extern "C" void m5267 (); extern "C" void m5268 (); extern "C" void m5269 (); extern "C" void m5270 (); extern "C" void m5271 (); extern "C" void m5272 (); extern "C" void m5273 (); extern "C" void m5274 (); extern "C" void m5275 (); extern "C" void m5276 (); extern "C" void m5277 (); extern "C" void m5278 (); extern "C" void m5279 (); extern "C" void m5280 (); extern "C" void m5281 (); extern "C" void m5282 (); extern "C" void m3901 (); extern "C" void m1839 (); extern "C" void m5283 (); extern "C" void m5284 (); extern "C" void m4908 (); extern "C" void m5285 (); extern "C" void m2876 (); extern "C" void m5286 (); extern "C" void m5287 (); extern "C" void m5288 (); extern "C" void m4930 (); extern "C" void m1867 (); extern "C" void m1840 (); extern "C" void m5289 (); extern "C" void m2873 (); extern "C" void m5290 (); extern "C" void m4970 (); extern "C" void m4928 (); extern "C" void m5291 (); extern "C" void m5292 (); extern "C" void m5293 (); extern "C" void m5294 (); extern "C" void m3998 (); extern "C" void m4000 (); extern "C" void m5295 (); extern "C" void m5296 (); extern "C" void m5297 (); extern "C" void m5298 (); extern "C" void m5299 (); extern "C" void m2878 (); extern "C" void m5300 (); extern "C" void m1859 (); extern "C" void m3909 (); extern "C" void m5301 (); extern "C" void m4941 (); extern "C" void m5302 (); extern "C" void m5303 (); extern "C" void m5304 (); extern "C" void m5305 (); extern "C" void m1895 (); extern "C" void m3999 (); extern "C" void m4971 (); extern "C" void m5306 (); extern "C" void m2877 (); extern "C" void m2879 (); extern "C" void m5307 (); extern "C" void m5308 (); extern "C" void m1861 (); extern "C" void m5309 (); extern "C" void m4913 (); extern "C" void m5310 (); extern "C" void m4972 (); extern "C" void m5311 (); extern "C" void m2882 (); extern "C" void m5312 (); extern "C" void m1889 (); extern "C" void m1869 (); extern "C" void m5313 (); extern "C" void m2871 (); extern "C" void m2881 (); extern "C" void m2880 (); extern "C" void m5314 (); extern "C" void m5315 (); extern "C" void m1863 (); extern "C" void m4960 (); extern "C" void m4969 (); extern "C" void m5316 (); extern "C" void m2870 (); extern "C" void m5317 (); extern "C" void m1611 (); extern "C" void m5318 (); extern "C" void m5319 (); extern "C" void m1996 (); extern "C" void m3949 (); extern "C" void m5320 (); extern "C" void m1469 (); extern "C" void m1459 (); extern "C" void m1701 (); extern "C" void m1807 (); extern "C" void m2874 (); extern "C" void m1506 (); extern "C" void m4911 (); extern "C" void m5321 (); extern "C" void m1865 (); extern "C" void m5322 (); extern "C" void m5323 (); extern "C" void m5324 (); extern "C" void m1820 (); extern "C" void m5325 (); extern "C" void m5326 (); extern "C" void m5327 (); extern "C" void m5328 (); extern "C" void m2856 (); extern "C" void m5329 (); extern "C" void m5330 (); extern "C" void m5331 (); extern "C" void m5332 (); extern "C" void m5333 (); extern "C" void m5334 (); extern "C" void m5335 (); extern "C" void m4962 (); extern "C" void m1868 (); extern "C" void m5336 (); extern "C" void m5337 (); extern "C" void m5338 (); extern "C" void m5339 (); extern "C" void m5340 (); extern "C" void m5341 (); extern "C" void m5342 (); extern "C" void m5343 (); extern "C" void m5344 (); extern "C" void m5345 (); extern "C" void m5346 (); extern "C" void m52 (); extern "C" void m1838 (); extern "C" void m5347 (); extern "C" void m5348 (); extern "C" void m5349 (); extern "C" void m5350 (); extern "C" void m5351 (); extern "C" void m5352 (); extern "C" void m5353 (); extern "C" void m5354 (); extern "C" void m5355 (); extern "C" void m5356 (); extern "C" void m5357 (); extern "C" void m5358 (); extern "C" void m5359 (); extern "C" void m5360 (); extern "C" void m5361 (); extern "C" void m5362 (); extern "C" void m5363 (); extern "C" void m1466 (); extern "C" void m1704 (); extern "C" void m2844 (); extern "C" void m5364 (); extern "C" void m5365 (); extern "C" void m5366 (); extern "C" void m5367 (); extern "C" void m5368 (); extern "C" void m5369 (); extern "C" void m5370 (); extern "C" void m2849 (); extern "C" void m5371 (); extern "C" void m5372 (); extern "C" void m5373 (); extern "C" void m5374 (); extern "C" void m5375 (); extern "C" void m5376 (); extern "C" void m5377 (); extern "C" void m5378 (); extern "C" void m5379 (); extern "C" void m5380 (); extern "C" void m5381 (); extern "C" void m5382 (); extern "C" void m5383 (); extern "C" void m5384 (); extern "C" void m5385 (); extern "C" void m5386 (); extern "C" void m5387 (); extern "C" void m5388 (); extern "C" void m5389 (); extern "C" void m5390 (); extern "C" void m5391 (); extern "C" void m5392 (); extern "C" void m5393 (); extern "C" void m5394 (); extern "C" void m5395 (); extern "C" void m5396 (); extern "C" void m5397 (); extern "C" void m5398 (); extern "C" void m5399 (); extern "C" void m5400 (); extern "C" void m5401 (); extern "C" void m5402 (); extern "C" void m5403 (); extern "C" void m5404 (); extern "C" void m5405 (); extern "C" void m5406 (); extern "C" void m5407 (); extern "C" void m5408 (); extern "C" void m5409 (); extern "C" void m5410 (); extern "C" void m5411 (); extern "C" void m5412 (); extern "C" void m5413 (); extern "C" void m5414 (); extern "C" void m5415 (); extern "C" void m5416 (); extern "C" void m5417 (); extern "C" void m5418 (); extern "C" void m5419 (); extern "C" void m5420 (); extern "C" void m5421 (); extern "C" void m5422 (); extern "C" void m5423 (); extern "C" void m5424 (); extern "C" void m5425 (); extern "C" void m5426 (); extern "C" void m5427 (); extern "C" void m5428 (); extern "C" void m5429 (); extern "C" void m5430 (); extern "C" void m5431 (); extern "C" void m5432 (); extern "C" void m5433 (); extern "C" void m5434 (); extern "C" void m5435 (); extern "C" void m5436 (); extern "C" void m5437 (); extern "C" void m5438 (); extern "C" void m5439 (); extern "C" void m5440 (); extern "C" void m5441 (); extern "C" void m5442 (); extern "C" void m5443 (); extern "C" void m5444 (); extern "C" void m5445 (); extern "C" void m5446 (); extern "C" void m5447 (); extern "C" void m5448 (); extern "C" void m5449 (); extern "C" void m5450 (); extern "C" void m5451 (); extern "C" void m5452 (); extern "C" void m5453 (); extern "C" void m5454 (); extern "C" void m5455 (); extern "C" void m5456 (); extern "C" void m5457 (); extern "C" void m5458 (); extern "C" void m5459 (); extern "C" void m5460 (); extern "C" void m5461 (); extern "C" void m5462 (); extern "C" void m5463 (); extern "C" void m5464 (); extern "C" void m5465 (); extern "C" void m5466 (); extern "C" void m5467 (); extern "C" void m5468 (); extern "C" void m5469 (); extern "C" void m5470 (); extern "C" void m5471 (); extern "C" void m5472 (); extern "C" void m5473 (); extern "C" void m5474 (); extern "C" void m5475 (); extern "C" void m5476 (); extern "C" void m5477 (); extern "C" void m5478 (); extern "C" void m5479 (); extern "C" void m5480 (); extern "C" void m5481 (); extern "C" void m5482 (); extern "C" void m5483 (); extern "C" void m5484 (); extern "C" void m5485 (); extern "C" void m5486 (); extern "C" void m5487 (); extern "C" void m5488 (); extern "C" void m5489 (); extern "C" void m5490 (); extern "C" void m5491 (); extern "C" void m5492 (); extern "C" void m5493 (); extern "C" void m5494 (); extern "C" void m5495 (); extern "C" void m5496 (); extern "C" void m5497 (); extern "C" void m5498 (); extern "C" void m5499 (); extern "C" void m5500 (); extern "C" void m5501 (); extern "C" void m5502 (); extern "C" void m5503 (); extern "C" void m5504 (); extern "C" void m5505 (); extern "C" void m5506 (); extern "C" void m5507 (); extern "C" void m5508 (); extern "C" void m5509 (); extern "C" void m5510 (); extern "C" void m5511 (); extern "C" void m5512 (); extern "C" void m5513 (); extern "C" void m5514 (); extern "C" void m5515 (); extern "C" void m5516 (); extern "C" void m2853 (); extern "C" void m5517 (); extern "C" void m5518 (); extern "C" void m5519 (); extern "C" void m5520 (); extern "C" void m5521 (); extern "C" void m5522 (); extern "C" void m5523 (); extern "C" void m5524 (); extern "C" void m2847 (); extern "C" void m5525 (); extern "C" void m5526 (); extern "C" void m2888 (); extern "C" void m2846 (); extern "C" void m5527 (); extern "C" void m5528 (); extern "C" void m5529 (); extern "C" void m2887 (); extern "C" void m5530 (); extern "C" void m5531 (); extern "C" void m5532 (); extern "C" void m5533 (); extern "C" void m5534 (); extern "C" void m5535 (); extern "C" void m5536 (); extern "C" void m5537 (); extern "C" void m5538 (); extern "C" void m5539 (); extern "C" void m5540 (); extern "C" void m5541 (); extern "C" void m5542 (); extern "C" void m5543 (); extern "C" void m5544 (); extern "C" void m5545 (); extern "C" void m5546 (); extern "C" void m5547 (); extern "C" void m5548 (); extern "C" void m5549 (); extern "C" void m5550 (); extern "C" void m5551 (); extern "C" void m5552 (); extern "C" void m5553 (); extern "C" void m5554 (); extern "C" void m5555 (); extern "C" void m5556 (); extern "C" void m5557 (); extern "C" void m5558 (); extern "C" void m2909 (); extern "C" void m2891 (); extern "C" void m5559 (); extern "C" void m5560 (); extern "C" void m5561 (); extern "C" void m5562 (); extern "C" void m5563 (); extern "C" void m2908 (); extern "C" void m5564 (); extern "C" void m5565 (); extern "C" void m5566 (); extern "C" void m5567 (); extern "C" void m5568 (); extern "C" void m5569 (); extern "C" void m5570 (); extern "C" void m5571 (); extern "C" void m5572 (); extern "C" void m5573 (); extern "C" void m5574 (); extern "C" void m5575 (); extern "C" void m1750 (); extern "C" void m5576 (); extern "C" void m5577 (); extern "C" void m1751 (); extern "C" void m5578 (); extern "C" void m5579 (); extern "C" void m5580 (); extern "C" void m5581 (); extern "C" void m5582 (); extern "C" void m5583 (); extern "C" void m5584 (); extern "C" void m5585 (); extern "C" void m5586 (); extern "C" void m5587 (); extern "C" void m5588 (); extern "C" void m5589 (); extern "C" void m5590 (); extern "C" void m5591 (); extern "C" void m5592 (); extern "C" void m5593 (); extern "C" void m5594 (); extern "C" void m5595 (); extern "C" void m5596 (); extern "C" void m5597 (); extern "C" void m5598 (); extern "C" void m5599 (); extern "C" void m5600 (); extern "C" void m3975 (); extern "C" void m5601 (); extern "C" void m5602 (); extern "C" void m5603 (); extern "C" void m5604 (); extern "C" void m4953 (); extern "C" void m5605 (); extern "C" void m5606 (); extern "C" void m5607 (); extern "C" void m5608 (); extern "C" void m5609 (); extern "C" void m5610 (); extern "C" void m5611 (); extern "C" void m5612 (); extern "C" void m5613 (); extern "C" void m5614 (); extern "C" void m5615 (); extern "C" void m5616 (); extern "C" void m5617 (); extern "C" void m5618 (); extern "C" void m5619 (); extern "C" void m5620 (); extern "C" void m5621 (); extern "C" void m5622 (); extern "C" void m5623 (); extern "C" void m5624 (); extern "C" void m5625 (); extern "C" void m5626 (); extern "C" void m5627 (); extern "C" void m5628 (); extern "C" void m5629 (); extern "C" void m5630 (); extern "C" void m5631 (); extern "C" void m5632 (); extern "C" void m5633 (); extern "C" void m5634 (); extern "C" void m5635 (); extern "C" void m5636 (); extern "C" void m5637 (); extern "C" void m5638 (); extern "C" void m5639 (); extern "C" void m5640 (); extern "C" void m5641 (); extern "C" void m5642 (); extern "C" void m5643 (); extern "C" void m5644 (); extern "C" void m5645 (); extern "C" void m5646 (); extern "C" void m5647 (); extern "C" void m5648 (); extern "C" void m5649 (); extern "C" void m4890 (); extern "C" void m5650 (); extern "C" void m4893 (); extern "C" void m5651 (); extern "C" void m5652 (); extern "C" void m5653 (); extern "C" void m5654 (); extern "C" void m5655 (); extern "C" void m5656 (); extern "C" void m5657 (); extern "C" void m5658 (); extern "C" void m5659 (); extern "C" void m5660 (); extern "C" void m5661 (); extern "C" void m5662 (); extern "C" void m5663 (); extern "C" void m5664 (); extern "C" void m5665 (); extern "C" void m5666 (); extern "C" void m5667 (); extern "C" void m5668 (); extern "C" void m5669 (); extern "C" void m5670 (); extern "C" void m5671 (); extern "C" void m5672 (); extern "C" void m5673 (); extern "C" void m5674 (); extern "C" void m5675 (); extern "C" void m4891 (); extern "C" void m5676 (); extern "C" void m5677 (); extern "C" void m5678 (); extern "C" void m5679 (); extern "C" void m5680 (); extern "C" void m5681 (); extern "C" void m5682 (); extern "C" void m5683 (); extern "C" void m5684 (); extern "C" void m5685 (); extern "C" void m5686 (); extern "C" void m5687 (); extern "C" void m5688 (); extern "C" void m5689 (); extern "C" void m5690 (); extern "C" void m5691 (); extern "C" void m2963 (); extern "C" void m5692 (); extern "C" void m5693 (); extern "C" void m4963 (); extern "C" void m5694 (); extern "C" void m5695 (); extern "C" void m5696 (); extern "C" void m5697 (); extern "C" void m5698 (); extern "C" void m5699 (); extern "C" void m5700 (); extern "C" void m5701 (); extern "C" void m5702 (); extern "C" void m5703 (); extern "C" void m5704 (); extern "C" void m3875 (); extern "C" void m3911 (); extern "C" void m5705 (); extern "C" void m5706 (); extern "C" void m5707 (); extern "C" void m5708 (); extern "C" void m5709 (); extern "C" void m5710 (); extern "C" void m5711 (); extern "C" void m5712 (); extern "C" void m5713 (); extern "C" void m5714 (); extern "C" void m5715 (); extern "C" void m5716 (); extern "C" void m5717 (); extern "C" void m5718 (); extern "C" void m5719 (); extern "C" void m5720 (); extern "C" void m5721 (); extern "C" void m5722 (); extern "C" void m5723 (); extern "C" void m5724 (); extern "C" void m5725 (); extern "C" void m5726 (); extern "C" void m5727 (); extern "C" void m5728 (); extern "C" void m5729 (); extern "C" void m5730 (); extern "C" void m5731 (); extern "C" void m5732 (); extern "C" void m5733 (); extern "C" void m5734 (); extern "C" void m5735 (); extern "C" void m5736 (); extern "C" void m5737 (); extern "C" void m5738 (); extern "C" void m5739 (); extern "C" void m5740 (); extern "C" void m5741 (); extern "C" void m5742 (); extern "C" void m5743 (); extern "C" void m5744 (); extern "C" void m5745 (); extern "C" void m5746 (); extern "C" void m5747 (); extern "C" void m5748 (); extern "C" void m5749 (); extern "C" void m5750 (); extern "C" void m5751 (); extern "C" void m5752 (); extern "C" void m5753 (); extern "C" void m5754 (); extern "C" void m5755 (); extern "C" void m5756 (); extern "C" void m5757 (); extern "C" void m2896 (); extern "C" void m5758 (); extern "C" void m5759 (); extern "C" void m1721 (); extern "C" void m5760 (); extern "C" void m5761 (); extern "C" void m5762 (); extern "C" void m5763 (); extern "C" void m5764 (); extern "C" void m5765 (); extern "C" void m5766 (); extern "C" void m5767 (); extern "C" void m5768 (); extern "C" void m5769 (); extern "C" void m5770 (); extern "C" void m5771 (); extern "C" void m5772 (); extern "C" void m5773 (); extern "C" void m5774 (); extern "C" void m5775 (); extern "C" void m5776 (); extern "C" void m5777 (); extern "C" void m5778 (); extern "C" void m5779 (); extern "C" void m5780 (); extern "C" void m5781 (); extern "C" void m5782 (); extern "C" void m5783 (); extern "C" void m5784 (); extern "C" void m5785 (); extern "C" void m5786 (); extern "C" void m5787 (); extern "C" void m5788 (); extern "C" void m5789 (); extern "C" void m5790 (); extern "C" void m5791 (); extern "C" void m5792 (); extern "C" void m5793 (); extern "C" void m5794 (); extern "C" void m5795 (); extern "C" void m5796 (); extern "C" void m3865 (); extern "C" void m2884 (); extern "C" void m3986 (); extern "C" void m2886 (); extern "C" void m5797 (); extern "C" void m2885 (); extern "C" void m5798 (); extern "C" void m5799 (); extern "C" void m5800 (); extern "C" void m5801 (); extern "C" void m4976 (); extern "C" void m5802 (); extern "C" void m5803 (); extern "C" void m5804 (); extern "C" void m5805 (); extern "C" void m5806 (); extern "C" void m5807 (); extern "C" void m5808 (); extern "C" void m5809 (); extern "C" void m5810 (); extern "C" void m5811 (); extern "C" void m5812 (); extern "C" void m5813 (); extern "C" void m5814 (); extern "C" void m5815 (); extern "C" void m5816 (); extern "C" void m5817 (); extern "C" void m5818 (); extern "C" void m5819 (); extern "C" void m5820 (); extern "C" void m5821 (); extern "C" void m5822 (); extern "C" void m5823 (); extern "C" void m5824 (); extern "C" void m5825 (); extern "C" void m5826 (); extern "C" void m5827 (); extern "C" void m5828 (); extern "C" void m5829 (); extern "C" void m5830 (); extern "C" void m5831 (); extern "C" void m5832 (); extern "C" void m5833 (); extern "C" void m5834 (); extern "C" void m5835 (); extern "C" void m3974 (); extern "C" void m5836 (); extern "C" void m3972 (); extern "C" void m5837 (); extern "C" void m5838 (); extern "C" void m5839 (); extern "C" void m5840 (); extern "C" void m5841 (); extern "C" void m4923 (); extern "C" void m5842 (); extern "C" void m5843 (); extern "C" void m2978 (); extern "C" void m5844 (); extern "C" void m5845 (); extern "C" void m5846 (); extern "C" void m5847 (); extern "C" void m5848 (); extern "C" void m5849 (); extern "C" void m5850 (); extern "C" void m5851 (); extern "C" void m5852 (); extern "C" void m5853 (); extern "C" void m5854 (); extern "C" void m5855 (); extern "C" void m5856 (); extern "C" void m5857 (); extern "C" void m5858 (); extern "C" void m5859 (); extern "C" void m5860 (); extern "C" void m5861 (); extern "C" void m5862 (); extern "C" void m5863 (); extern "C" void m5864 (); extern "C" void m5865 (); extern "C" void m5866 (); extern "C" void m5867 (); extern "C" void m5868 (); extern "C" void m5869 (); extern "C" void m5870 (); extern "C" void m5871 (); extern "C" void m5872 (); extern "C" void m5873 (); extern "C" void m5874 (); extern "C" void m5875 (); extern "C" void m5876 (); extern "C" void m5877 (); extern "C" void m5878 (); extern "C" void m5879 (); extern "C" void m5880 (); extern "C" void m5881 (); extern "C" void m5882 (); extern "C" void m5883 (); extern "C" void m5884 (); extern "C" void m5885 (); extern "C" void m5886 (); extern "C" void m5887 (); extern "C" void m5888 (); extern "C" void m5889 (); extern "C" void m5890 (); extern "C" void m5891 (); extern "C" void m5892 (); extern "C" void m5893 (); extern "C" void m5894 (); extern "C" void m5895 (); extern "C" void m5896 (); extern "C" void m5897 (); extern "C" void m5898 (); extern "C" void m5899 (); extern "C" void m5900 (); extern "C" void m5901 (); extern "C" void m5902 (); extern "C" void m5903 (); extern "C" void m5904 (); extern "C" void m5905 (); extern "C" void m5906 (); extern "C" void m5907 (); extern "C" void m5908 (); extern "C" void m5909 (); extern "C" void m5910 (); extern "C" void m5911 (); extern "C" void m5912 (); extern "C" void m5913 (); extern "C" void m5914 (); extern "C" void m5915 (); extern "C" void m5916 (); extern "C" void m5917 (); extern "C" void m5918 (); extern "C" void m5919 (); extern "C" void m5920 (); extern "C" void m5921 (); extern "C" void m5922 (); extern "C" void m5923 (); extern "C" void m5924 (); extern "C" void m5925 (); extern "C" void m5926 (); extern "C" void m5927 (); extern "C" void m5928 (); extern "C" void m5929 (); extern "C" void m5930 (); extern "C" void m5931 (); extern "C" void m5932 (); extern "C" void m5933 (); extern "C" void m5934 (); extern "C" void m5935 (); extern "C" void m5936 (); extern "C" void m5937 (); extern "C" void m5938 (); extern "C" void m5939 (); extern "C" void m5940 (); extern "C" void m5941 (); extern "C" void m5942 (); extern "C" void m5943 (); extern "C" void m5944 (); extern "C" void m5945 (); extern "C" void m5946 (); extern "C" void m5947 (); extern "C" void m5948 (); extern "C" void m5949 (); extern "C" void m5950 (); extern "C" void m5951 (); extern "C" void m5952 (); extern "C" void m5953 (); extern "C" void m5954 (); extern "C" void m5955 (); extern "C" void m5956 (); extern "C" void m5957 (); extern "C" void m5958 (); extern "C" void m5959 (); extern "C" void m5960 (); extern "C" void m5961 (); extern "C" void m5962 (); extern "C" void m5963 (); extern "C" void m5964 (); extern "C" void m5965 (); extern "C" void m5966 (); extern "C" void m5967 (); extern "C" void m5968 (); extern "C" void m5969 (); extern "C" void m5970 (); extern "C" void m5971 (); extern "C" void m5972 (); extern "C" void m5973 (); extern "C" void m5974 (); extern "C" void m5975 (); extern "C" void m5976 (); extern "C" void m5977 (); extern "C" void m5978 (); extern "C" void m5979 (); extern "C" void m5980 (); extern "C" void m5981 (); extern "C" void m5982 (); extern "C" void m5983 (); extern "C" void m5984 (); extern "C" void m5985 (); extern "C" void m5986 (); extern "C" void m5987 (); extern "C" void m5988 (); extern "C" void m5989 (); extern "C" void m5990 (); extern "C" void m5991 (); extern "C" void m5992 (); extern "C" void m5993 (); extern "C" void m5994 (); extern "C" void m5995 (); extern "C" void m5996 (); extern "C" void m5997 (); extern "C" void m5998 (); extern "C" void m5999 (); extern "C" void m6000 (); extern "C" void m6001 (); extern "C" void m6002 (); extern "C" void m6003 (); extern "C" void m6004 (); extern "C" void m6005 (); extern "C" void m6006 (); extern "C" void m6007 (); extern "C" void m6008 (); extern "C" void m6009 (); extern "C" void m6010 (); extern "C" void m6011 (); extern "C" void m6012 (); extern "C" void m6013 (); extern "C" void m6014 (); extern "C" void m6015 (); extern "C" void m6016 (); extern "C" void m6017 (); extern "C" void m6018 (); extern "C" void m6019 (); extern "C" void m6020 (); extern "C" void m6021 (); extern "C" void m6022 (); extern "C" void m6023 (); extern "C" void m6024 (); extern "C" void m6025 (); extern "C" void m6026 (); extern "C" void m6027 (); extern "C" void m6028 (); extern "C" void m6029 (); extern "C" void m6030 (); extern "C" void m6031 (); extern "C" void m6032 (); extern "C" void m6033 (); extern "C" void m6034 (); extern "C" void m6035 (); extern "C" void m6036 (); extern "C" void m6037 (); extern "C" void m6038 (); extern "C" void m6039 (); extern "C" void m6040 (); extern "C" void m6041 (); extern "C" void m6042 (); extern "C" void m6043 (); extern "C" void m6044 (); extern "C" void m6045 (); extern "C" void m6046 (); extern "C" void m6047 (); extern "C" void m6048 (); extern "C" void m6049 (); extern "C" void m6050 (); extern "C" void m6051 (); extern "C" void m6052 (); extern "C" void m6053 (); extern "C" void m6054 (); extern "C" void m6055 (); extern "C" void m6056 (); extern "C" void m6057 (); extern "C" void m6058 (); extern "C" void m6059 (); extern "C" void m6060 (); extern "C" void m6061 (); extern "C" void m6062 (); extern "C" void m6063 (); extern "C" void m6064 (); extern "C" void m6065 (); extern "C" void m6066 (); extern "C" void m6067 (); extern "C" void m6068 (); extern "C" void m6069 (); extern "C" void m6070 (); extern "C" void m6071 (); extern "C" void m6072 (); extern "C" void m6073 (); extern "C" void m6074 (); extern "C" void m6075 (); extern "C" void m6076 (); extern "C" void m6077 (); extern "C" void m6078 (); extern "C" void m6079 (); extern "C" void m6080 (); extern "C" void m6081 (); extern "C" void m6082 (); extern "C" void m6083 (); extern "C" void m6084 (); extern "C" void m6085 (); extern "C" void m6086 (); extern "C" void m6087 (); extern "C" void m6088 (); extern "C" void m6089 (); extern "C" void m6090 (); extern "C" void m6091 (); extern "C" void m6092 (); extern "C" void m6093 (); extern "C" void m6094 (); extern "C" void m6095 (); extern "C" void m6096 (); extern "C" void m6097 (); extern "C" void m6098 (); extern "C" void m6099 (); extern "C" void m6100 (); extern "C" void m6101 (); extern "C" void m6102 (); extern "C" void m6103 (); extern "C" void m6104 (); extern "C" void m6105 (); extern "C" void m6106 (); extern "C" void m6107 (); extern "C" void m6108 (); extern "C" void m6109 (); extern "C" void m6110 (); extern "C" void m6111 (); extern "C" void m6112 (); extern "C" void m6113 (); extern "C" void m6114 (); extern "C" void m6115 (); extern "C" void m6116 (); extern "C" void m6117 (); extern "C" void m6118 (); extern "C" void m6119 (); extern "C" void m6120 (); extern "C" void m6121 (); extern "C" void m6122 (); extern "C" void m6123 (); extern "C" void m6124 (); extern "C" void m6125 (); extern "C" void m6126 (); extern "C" void m6127 (); extern "C" void m6128 (); extern "C" void m6129 (); extern "C" void m6130 (); extern "C" void m6131 (); extern "C" void m6132 (); extern "C" void m6133 (); extern "C" void m6134 (); extern "C" void m6135 (); extern "C" void m6136 (); extern "C" void m6137 (); extern "C" void m6138 (); extern "C" void m6139 (); extern "C" void m6140 (); extern "C" void m6141 (); extern "C" void m6142 (); extern "C" void m6143 (); extern "C" void m6144 (); extern "C" void m6145 (); extern "C" void m6146 (); extern "C" void m6147 (); extern "C" void m6148 (); extern "C" void m6149 (); extern "C" void m6150 (); extern "C" void m6151 (); extern "C" void m6152 (); extern "C" void m6153 (); extern "C" void m6154 (); extern "C" void m6155 (); extern "C" void m6156 (); extern "C" void m6157 (); extern "C" void m6158 (); extern "C" void m6159 (); extern "C" void m6160 (); extern "C" void m6161 (); extern "C" void m6162 (); extern "C" void m6163 (); extern "C" void m6164 (); extern "C" void m6165 (); extern "C" void m6166 (); extern "C" void m6167 (); extern "C" void m6168 (); extern "C" void m6169 (); extern "C" void m6170 (); extern "C" void m6171 (); extern "C" void m6172 (); extern "C" void m6173 (); extern "C" void m6174 (); extern "C" void m6175 (); extern "C" void m6176 (); extern "C" void m6177 (); extern "C" void m6178 (); extern "C" void m6179 (); extern "C" void m6180 (); extern "C" void m6181 (); extern "C" void m6182 (); extern "C" void m6183 (); extern "C" void m6184 (); extern "C" void m6185 (); extern "C" void m6186 (); extern "C" void m6187 (); extern "C" void m6188 (); extern "C" void m6189 (); extern "C" void m6190 (); extern "C" void m6191 (); extern "C" void m6192 (); extern "C" void m6193 (); extern "C" void m6194 (); extern "C" void m6195 (); extern "C" void m6196 (); extern "C" void m6197 (); extern "C" void m6198 (); extern "C" void m6199 (); extern "C" void m6200 (); extern "C" void m6201 (); extern "C" void m6202 (); extern "C" void m6203 (); extern "C" void m6204 (); extern "C" void m6205 (); extern "C" void m6206 (); extern "C" void m6207 (); extern "C" void m6208 (); extern "C" void m6209 (); extern "C" void m6210 (); extern "C" void m6211 (); extern "C" void m6212 (); extern "C" void m6213 (); extern "C" void m6214 (); extern "C" void m6215 (); extern "C" void m6216 (); extern "C" void m6217 (); extern "C" void m6218 (); extern "C" void m6219 (); extern "C" void m6220 (); extern "C" void m6221 (); extern "C" void m6222 (); extern "C" void m6223 (); extern "C" void m6224 (); extern "C" void m6225 (); extern "C" void m6226 (); extern "C" void m6227 (); extern "C" void m6228 (); extern "C" void m6229 (); extern "C" void m6230 (); extern "C" void m6231 (); extern "C" void m6232 (); extern "C" void m6233 (); extern "C" void m6234 (); extern "C" void m6235 (); extern "C" void m6236 (); extern "C" void m6237 (); extern "C" void m6238 (); extern "C" void m6239 (); extern "C" void m6240 (); extern "C" void m6241 (); extern "C" void m6242 (); extern "C" void m6243 (); extern "C" void m6244 (); extern "C" void m6245 (); extern "C" void m6246 (); extern "C" void m6247 (); extern "C" void m6248 (); extern "C" void m6249 (); extern "C" void m6250 (); extern "C" void m6251 (); extern "C" void m6252 (); extern "C" void m6253 (); extern "C" void m6254 (); extern "C" void m6255 (); extern "C" void m6256 (); extern "C" void m6257 (); extern "C" void m6258 (); extern "C" void m6259 (); extern "C" void m6260 (); extern "C" void m6261 (); extern "C" void m6262 (); extern "C" void m6263 (); extern "C" void m6264 (); extern "C" void m6265 (); extern "C" void m6266 (); extern "C" void m6267 (); extern "C" void m6268 (); extern "C" void m6269 (); extern "C" void m6270 (); extern "C" void m6271 (); extern "C" void m6272 (); extern "C" void m6273 (); extern "C" void m6274 (); extern "C" void m6275 (); extern "C" void m6276 (); extern "C" void m6277 (); extern "C" void m6278 (); extern "C" void m6279 (); extern "C" void m6280 (); extern "C" void m6281 (); extern "C" void m6282 (); extern "C" void m6283 (); extern "C" void m6284 (); extern "C" void m6285 (); extern "C" void m6286 (); extern "C" void m6287 (); extern "C" void m6288 (); extern "C" void m6289 (); extern "C" void m6290 (); extern "C" void m6291 (); extern "C" void m6292 (); extern "C" void m6293 (); extern "C" void m6294 (); extern "C" void m6295 (); extern "C" void m6296 (); extern "C" void m6297 (); extern "C" void m6298 (); extern "C" void m6299 (); extern "C" void m6300 (); extern "C" void m6301 (); extern "C" void m6302 (); extern "C" void m6303 (); extern "C" void m6304 (); extern "C" void m6305 (); extern "C" void m6306 (); extern "C" void m6307 (); extern "C" void m6308 (); extern "C" void m6309 (); extern "C" void m6310 (); extern "C" void m6311 (); extern "C" void m6312 (); extern "C" void m6313 (); extern "C" void m6314 (); extern "C" void m6315 (); extern "C" void m6316 (); extern "C" void m6317 (); extern "C" void m6318 (); extern "C" void m6319 (); extern "C" void m6320 (); extern "C" void m6321 (); extern "C" void m6322 (); extern "C" void m6323 (); extern "C" void m6324 (); extern "C" void m6325 (); extern "C" void m6326 (); extern "C" void m6327 (); extern "C" void m6328 (); extern "C" void m6329 (); extern "C" void m6330 (); extern "C" void m6331 (); extern "C" void m6332 (); extern "C" void m6333 (); extern "C" void m6334 (); extern "C" void m6335 (); extern "C" void m6336 (); extern "C" void m6337 (); extern "C" void m6338 (); extern "C" void m6339 (); extern "C" void m6340 (); extern "C" void m6341 (); extern "C" void m6342 (); extern "C" void m6343 (); extern "C" void m6344 (); extern "C" void m6345 (); extern "C" void m6346 (); extern "C" void m6347 (); extern "C" void m6348 (); extern "C" void m6349 (); extern "C" void m6350 (); extern "C" void m6351 (); extern "C" void m6352 (); extern "C" void m6353 (); extern "C" void m6354 (); extern "C" void m6355 (); extern "C" void m6356 (); extern "C" void m6357 (); extern "C" void m6358 (); extern "C" void m6359 (); extern "C" void m6360 (); extern "C" void m6361 (); extern "C" void m6362 (); extern "C" void m6363 (); extern "C" void m6364 (); extern "C" void m6365 (); extern "C" void m6366 (); extern "C" void m6367 (); extern "C" void m6368 (); extern "C" void m6369 (); extern "C" void m6370 (); extern "C" void m6371 (); extern "C" void m6372 (); extern "C" void m6373 (); extern "C" void m6374 (); extern "C" void m6375 (); extern "C" void m6376 (); extern "C" void m6377 (); extern "C" void m6378 (); extern "C" void m6379 (); extern "C" void m6380 (); extern "C" void m6381 (); extern "C" void m6382 (); extern "C" void m6383 (); extern "C" void m6384 (); extern "C" void m6385 (); extern "C" void m6386 (); extern "C" void m6387 (); extern "C" void m6388 (); extern "C" void m6389 (); extern "C" void m6390 (); extern "C" void m6391 (); extern "C" void m6392 (); extern "C" void m6393 (); extern "C" void m6394 (); extern "C" void m6395 (); extern "C" void m6396 (); extern "C" void m6397 (); extern "C" void m6398 (); extern "C" void m6399 (); extern "C" void m6400 (); extern "C" void m6401 (); extern "C" void m6402 (); extern "C" void m6403 (); extern "C" void m6404 (); extern "C" void m6405 (); extern "C" void m6406 (); extern "C" void m6407 (); extern "C" void m6408 (); extern "C" void m6409 (); extern "C" void m6410 (); extern "C" void m6411 (); extern "C" void m6412 (); extern "C" void m6413 (); extern "C" void m6414 (); extern "C" void m6415 (); extern "C" void m6416 (); extern "C" void m6417 (); extern "C" void m6418 (); extern "C" void m6419 (); extern "C" void m6420 (); extern "C" void m6421 (); extern "C" void m6422 (); extern "C" void m6423 (); extern "C" void m6424 (); extern "C" void m6425 (); extern "C" void m6426 (); extern "C" void m6427 (); extern "C" void m6428 (); extern "C" void m6429 (); extern "C" void m6430 (); extern "C" void m6431 (); extern "C" void m6432 (); extern "C" void m6433 (); extern "C" void m6434 (); extern "C" void m6435 (); extern "C" void m6436 (); extern "C" void m6437 (); extern "C" void m6438 (); extern "C" void m6439 (); extern "C" void m6440 (); extern "C" void m6441 (); extern "C" void m6442 (); extern "C" void m6443 (); extern "C" void m6444 (); extern "C" void m3869 (); extern "C" void m4922 (); extern "C" void m4944 (); extern "C" void m6445 (); extern "C" void m6446 (); extern "C" void m6447 (); extern "C" void m6448 (); extern "C" void m6449 (); extern "C" void m6450 (); extern "C" void m6451 (); extern "C" void m6452 (); extern "C" void m6453 (); extern "C" void m6454 (); extern "C" void m6455 (); extern "C" void m6456 (); extern "C" void m6457 (); extern "C" void m6458 (); extern "C" void m6459 (); extern "C" void m6460 (); extern "C" void m6461 (); extern "C" void m6462 (); extern "C" void m6463 (); extern "C" void m6464 (); extern "C" void m6465 (); extern "C" void m6466 (); extern "C" void m6467 (); extern "C" void m6468 (); extern "C" void m6469 (); extern "C" void m6470 (); extern "C" void m6471 (); extern "C" void m6472 (); extern "C" void m6473 (); extern "C" void m6474 (); extern "C" void m6475 (); extern "C" void m6476 (); extern "C" void m6477 (); extern "C" void m6478 (); extern "C" void m6479 (); extern "C" void m3902 (); extern "C" void m6480 (); extern "C" void m6481 (); extern "C" void m6482 (); extern "C" void m6483 (); extern "C" void m6484 (); extern "C" void m6485 (); extern "C" void m6486 (); extern "C" void m4966 (); extern "C" void m6487 (); extern "C" void m6488 (); extern "C" void m6489 (); extern "C" void m4959 (); extern "C" void m4967 (); extern "C" void m4958 (); extern "C" void m6490 (); extern "C" void m6491 (); extern "C" void m6492 (); extern "C" void m6493 (); extern "C" void m6494 (); extern "C" void m6495 (); extern "C" void m6496 (); extern "C" void m6497 (); extern "C" void m6498 (); extern "C" void m4884 (); extern "C" void m6499 (); extern "C" void m6500 (); extern "C" void m6501 (); extern "C" void m6502 (); extern "C" void m6503 (); extern "C" void m6504 (); extern "C" void m4885 (); extern "C" void m6505 (); extern "C" void m3924 (); extern "C" void m6506 (); extern "C" void m6507 (); extern "C" void m6508 (); extern "C" void m6509 (); extern "C" void m6510 (); extern "C" void m6511 (); extern "C" void m6512 (); extern "C" void m6513 (); extern "C" void m6514 (); extern "C" void m6515 (); extern "C" void m6516 (); extern "C" void m6517 (); extern "C" void m6518 (); extern "C" void m6519 (); extern "C" void m6520 (); extern "C" void m6521 (); extern "C" void m3925 (); extern "C" void m4964 (); extern "C" void m6522 (); extern "C" void m6523 (); extern "C" void m6524 (); extern "C" void m6525 (); extern "C" void m6526 (); extern "C" void m6527 (); extern "C" void m6528 (); extern "C" void m6529 (); extern "C" void m6530 (); extern "C" void m6531 (); extern "C" void m6532 (); extern "C" void m6533 (); extern "C" void m6534 (); extern "C" void m6535 (); extern "C" void m4888 (); extern "C" void m6536 (); extern "C" void m6537 (); extern "C" void m6538 (); extern "C" void m6539 (); extern "C" void m6540 (); extern "C" void m6541 (); extern "C" void m6542 (); extern "C" void m6543 (); extern "C" void m6544 (); extern "C" void m6545 (); extern "C" void m6546 (); extern "C" void m6547 (); extern "C" void m6548 (); extern "C" void m6549 (); extern "C" void m6550 (); extern "C" void m6551 (); extern "C" void m6552 (); extern "C" void m6553 (); extern "C" void m6554 (); extern "C" void m6555 (); extern "C" void m6556 (); extern "C" void m6557 (); extern "C" void m6558 (); extern "C" void m6559 (); extern "C" void m6560 (); extern "C" void m6561 (); extern "C" void m6562 (); extern "C" void m6563 (); extern "C" void m6564 (); extern "C" void m6565 (); extern "C" void m6566 (); extern "C" void m6567 (); extern "C" void m6568 (); extern "C" void m6569 (); extern "C" void m6570 (); extern "C" void m6571 (); extern "C" void m6572 (); extern "C" void m6573 (); extern "C" void m6574 (); extern "C" void m6575 (); extern "C" void m6576 (); extern "C" void m6577 (); extern "C" void m6578 (); extern "C" void m6579 (); extern "C" void m3953 (); extern "C" void m6580 (); extern "C" void m6581 (); extern "C" void m4952 (); extern "C" void m6582 (); extern "C" void m4886 (); extern "C" void m6583 (); extern "C" void m4887 (); extern "C" void m4919 (); extern "C" void m6584 (); extern "C" void m4894 (); extern "C" void m6585 (); extern "C" void m6586 (); extern "C" void m6587 (); extern "C" void m6588 (); extern "C" void m6589 (); extern "C" void m6590 (); extern "C" void m6591 (); extern "C" void m6592 (); extern "C" void m6593 (); extern "C" void m6594 (); extern "C" void m6595 (); extern "C" void m6596 (); extern "C" void m6597 (); extern "C" void m6598 (); extern "C" void m6599 (); extern "C" void m6600 (); extern "C" void m6601 (); extern "C" void m6602 (); extern "C" void m6603 (); extern "C" void m6604 (); extern "C" void m6605 (); extern "C" void m6606 (); extern "C" void m6607 (); extern "C" void m6608 (); extern "C" void m6609 (); extern "C" void m6610 (); extern "C" void m6611 (); extern "C" void m6612 (); extern "C" void m6613 (); extern "C" void m6614 (); extern "C" void m6615 (); extern "C" void m6616 (); extern "C" void m6617 (); extern "C" void m6618 (); extern "C" void m6619 (); extern "C" void m6620 (); extern "C" void m6621 (); extern "C" void m6622 (); extern "C" void m6623 (); extern "C" void m6624 (); extern "C" void m6625 (); extern "C" void m6626 (); extern "C" void m6627 (); extern "C" void m6628 (); extern "C" void m4918 (); extern "C" void m6629 (); extern "C" void m6630 (); extern "C" void m6631 (); extern "C" void m6632 (); extern "C" void m6633 (); extern "C" void m6634 (); extern "C" void m6635 (); extern "C" void m6636 (); extern "C" void m6637 (); extern "C" void m6638 (); extern "C" void m6639 (); extern "C" void m6640 (); extern "C" void m6641 (); extern "C" void m6642 (); extern "C" void m6643 (); extern "C" void m6644 (); extern "C" void m6645 (); extern "C" void m6646 (); extern "C" void m6647 (); extern "C" void m6648 (); extern "C" void m6649 (); extern "C" void m6650 (); extern "C" void m6651 (); extern "C" void m6652 (); extern "C" void m6653 (); extern "C" void m6654 (); extern "C" void m6655 (); extern "C" void m6656 (); extern "C" void m6657 (); extern "C" void m6658 (); extern "C" void m6659 (); extern "C" void m6660 (); extern "C" void m6661 (); extern "C" void m4961 (); extern "C" void m6662 (); extern "C" void m6663 (); extern "C" void m6664 (); extern "C" void m6665 (); extern "C" void m6666 (); extern "C" void m6667 (); extern "C" void m6668 (); extern "C" void m6669 (); extern "C" void m6670 (); extern "C" void m6671 (); extern "C" void m6672 (); extern "C" void m6673 (); extern "C" void m6674 (); extern "C" void m6675 (); extern "C" void m6676 (); extern "C" void m6677 (); extern "C" void m6678 (); extern "C" void m6679 (); extern "C" void m6680 (); extern "C" void m6681 (); extern "C" void m6682 (); extern "C" void m6683 (); extern "C" void m6684 (); extern "C" void m6685 (); extern "C" void m6686 (); extern "C" void m6687 (); extern "C" void m6688 (); extern "C" void m6689 (); extern "C" void m6690 (); extern "C" void m6691 (); extern "C" void m2869 (); extern "C" void m6692 (); extern "C" void m6693 (); extern "C" void m6694 (); extern "C" void m6695 (); extern "C" void m6696 (); extern "C" void m6697 (); extern "C" void m6698 (); extern "C" void m6699 (); extern "C" void m6700 (); extern "C" void m6701 (); extern "C" void m6702 (); extern "C" void m6703 (); extern "C" void m6704 (); extern "C" void m6705 (); extern "C" void m6706 (); extern "C" void m6707 (); extern "C" void m6708 (); extern "C" void m6709 (); extern "C" void m6710 (); extern "C" void m6711 (); extern "C" void m6712 (); extern "C" void m6713 (); extern "C" void m6714 (); extern "C" void m6715 (); extern "C" void m6716 (); extern "C" void m6717 (); extern "C" void m6718 (); extern "C" void m6719 (); extern "C" void m6720 (); extern "C" void m6721 (); extern "C" void m6722 (); extern "C" void m6723 (); extern "C" void m6724 (); extern "C" void m6725 (); extern "C" void m6726 (); extern "C" void m6727 (); extern "C" void m6728 (); extern "C" void m6729 (); extern "C" void m6730 (); extern "C" void m6731 (); extern "C" void m6732 (); extern "C" void m6733 (); extern "C" void m6734 (); extern "C" void m6735 (); extern "C" void m6736 (); extern "C" void m6737 (); extern "C" void m6738 (); extern "C" void m6739 (); extern "C" void m6740 (); extern "C" void m6741 (); extern "C" void m6742 (); extern "C" void m6743 (); extern "C" void m6744 (); extern "C" void m6745 (); extern "C" void m6746 (); extern "C" void m6747 (); extern "C" void m6748 (); extern "C" void m6749 (); extern "C" void m6750 (); extern "C" void m6751 (); extern "C" void m6752 (); extern "C" void m6753 (); extern "C" void m3878 (); extern "C" void m3946 (); extern "C" void m3948 (); extern "C" void m6754 (); extern "C" void m6755 (); extern "C" void m6756 (); extern "C" void m6757 (); extern "C" void m6758 (); extern "C" void m6759 (); extern "C" void m6760 (); extern "C" void m6761 (); extern "C" void m6762 (); extern "C" void m6763 (); extern "C" void m6764 (); extern "C" void m6765 (); extern "C" void m6766 (); extern "C" void m6767 (); extern "C" void m6768 (); extern "C" void m6769 (); extern "C" void m6770 (); extern "C" void m6771 (); extern "C" void m6772 (); extern "C" void m6773 (); extern "C" void m6774 (); extern "C" void m6775 (); extern "C" void m6776 (); extern "C" void m6777 (); extern "C" void m6778 (); extern "C" void m6779 (); extern "C" void m6780 (); extern "C" void m6781 (); extern "C" void m6782 (); extern "C" void m6783 (); extern "C" void m6784 (); extern "C" void m6785 (); extern "C" void m6786 (); extern "C" void m6787 (); extern "C" void m6788 (); extern "C" void m6789 (); extern "C" void m6790 (); extern "C" void m6791 (); extern "C" void m6792 (); extern "C" void m6793 (); extern "C" void m6794 (); extern "C" void m6795 (); extern "C" void m6796 (); extern "C" void m6797 (); extern "C" void m6798 (); extern "C" void m6799 (); extern "C" void m6800 (); extern "C" void m6801 (); extern "C" void m6802 (); extern "C" void m6803 (); extern "C" void m6804 (); extern "C" void m6805 (); extern "C" void m6806 (); extern "C" void m6807 (); extern "C" void m6808 (); extern "C" void m6809 (); extern "C" void m6810 (); extern "C" void m6811 (); extern "C" void m6812 (); extern "C" void m6813 (); extern "C" void m6814 (); extern "C" void m6815 (); extern "C" void m6816 (); extern "C" void m6817 (); extern "C" void m6818 (); extern "C" void m6819 (); extern "C" void m6820 (); extern "C" void m6821 (); extern "C" void m6822 (); extern "C" void m6823 (); extern "C" void m6824 (); extern "C" void m6825 (); extern "C" void m6826 (); extern "C" void m6827 (); extern "C" void m6828 (); extern "C" void m6829 (); extern "C" void m6830 (); extern "C" void m6831 (); extern "C" void m6832 (); extern "C" void m6833 (); extern "C" void m6834 (); extern "C" void m6835 (); extern "C" void m6836 (); extern "C" void m6837 (); extern "C" void m6838 (); extern "C" void m6839 (); extern "C" void m6840 (); extern "C" void m6841 (); extern "C" void m6842 (); extern "C" void m6843 (); extern "C" void m6844 (); extern "C" void m6845 (); extern "C" void m6846 (); extern "C" void m6847 (); extern "C" void m6848 (); extern "C" void m6849 (); extern "C" void m6850 (); extern "C" void m6851 (); extern "C" void m6852 (); extern "C" void m6853 (); extern "C" void m6854 (); extern "C" void m6855 (); extern "C" void m6856 (); extern "C" void m6857 (); extern "C" void m6858 (); extern "C" void m6859 (); extern "C" void m6860 (); extern "C" void m6861 (); extern "C" void m6862 (); extern "C" void m6863 (); extern "C" void m6864 (); extern "C" void m6865 (); extern "C" void m6866 (); extern "C" void m6867 (); extern "C" void m6868 (); extern "C" void m6869 (); extern "C" void m6870 (); extern "C" void m6871 (); extern "C" void m6872 (); extern "C" void m6873 (); extern "C" void m6874 (); extern "C" void m6875 (); extern "C" void m6876 (); extern "C" void m6877 (); extern "C" void m6878 (); extern "C" void m6879 (); extern "C" void m6880 (); extern "C" void m6881 (); extern "C" void m6882 (); extern "C" void m6883 (); extern "C" void m6884 (); extern "C" void m6885 (); extern "C" void m6886 (); extern "C" void m6887 (); extern "C" void m6888 (); extern "C" void m6889 (); extern "C" void m6890 (); extern "C" void m6891 (); extern "C" void m6892 (); extern "C" void m6893 (); extern "C" void m6894 (); extern "C" void m6895 (); extern "C" void m6896 (); extern "C" void m6897 (); extern "C" void m6898 (); extern "C" void m6899 (); extern "C" void m6900 (); extern "C" void m6901 (); extern "C" void m6902 (); extern "C" void m6903 (); extern "C" void m6904 (); extern "C" void m6905 (); extern "C" void m6906 (); extern "C" void m6907 (); extern "C" void m6908 (); extern "C" void m6909 (); extern "C" void m6910 (); extern "C" void m6911 (); extern "C" void m6912 (); extern "C" void m6913 (); extern "C" void m6914 (); extern "C" void m6915 (); extern "C" void m6916 (); extern "C" void m6917 (); extern "C" void m3931 (); extern "C" void m6918 (); extern "C" void m3930 (); extern "C" void m6919 (); extern "C" void m3933 (); extern "C" void m6920 (); extern "C" void m6921 (); extern "C" void m6922 (); extern "C" void m6923 (); extern "C" void m6924 (); extern "C" void m6925 (); extern "C" void m6926 (); extern "C" void m6927 (); extern "C" void m6928 (); extern "C" void m6929 (); extern "C" void m6930 (); extern "C" void m6931 (); extern "C" void m6932 (); extern "C" void m6933 (); extern "C" void m6934 (); extern "C" void m6935 (); extern "C" void m6936 (); extern "C" void m3929 (); extern "C" void m6937 (); extern "C" void m6938 (); extern "C" void m6939 (); extern "C" void m6940 (); extern "C" void m6941 (); extern "C" void m6942 (); extern "C" void m6943 (); extern "C" void m6944 (); extern "C" void m6945 (); extern "C" void m6946 (); extern "C" void m6947 (); extern "C" void m6948 (); extern "C" void m6949 (); extern "C" void m6950 (); extern "C" void m6951 (); extern "C" void m6952 (); extern "C" void m6953 (); extern "C" void m6954 (); extern "C" void m6955 (); extern "C" void m6956 (); extern "C" void m6957 (); extern "C" void m6958 (); extern "C" void m6959 (); extern "C" void m6960 (); extern "C" void m6961 (); extern "C" void m6962 (); extern "C" void m6963 (); extern "C" void m6964 (); extern "C" void m6965 (); extern "C" void m6966 (); extern "C" void m6967 (); extern "C" void m6968 (); extern "C" void m6969 (); extern "C" void m6970 (); extern "C" void m6971 (); extern "C" void m6972 (); extern "C" void m6973 (); extern "C" void m6974 (); extern "C" void m6975 (); extern "C" void m6976 (); extern "C" void m6977 (); extern "C" void m6978 (); extern "C" void m6979 (); extern "C" void m6980 (); extern "C" void m6981 (); extern "C" void m6982 (); extern "C" void m6983 (); extern "C" void m6984 (); extern "C" void m6985 (); extern "C" void m6986 (); extern "C" void m6987 (); extern "C" void m6988 (); extern "C" void m6989 (); extern "C" void m6990 (); extern "C" void m6991 (); extern "C" void m6992 (); extern "C" void m6993 (); extern "C" void m6994 (); extern "C" void m6995 (); extern "C" void m6996 (); extern "C" void m6997 (); extern "C" void m6998 (); extern "C" void m6999 (); extern "C" void m7000 (); extern "C" void m7001 (); extern "C" void m3980 (); extern "C" void m7002 (); extern "C" void m7003 (); extern "C" void m3981 (); extern "C" void m3987 (); extern "C" void m3988 (); extern "C" void m7004 (); extern "C" void m7005 (); extern "C" void m7006 (); extern "C" void m7007 (); extern "C" void m7008 (); extern "C" void m7009 (); extern "C" void m7010 (); extern "C" void m7011 (); extern "C" void m7012 (); extern "C" void m7013 (); extern "C" void m7014 (); extern "C" void m7015 (); extern "C" void m7016 (); extern "C" void m7017 (); extern "C" void m7018 (); extern "C" void m7019 (); extern "C" void m7020 (); extern "C" void m7021 (); extern "C" void m7022 (); extern "C" void m7023 (); extern "C" void m7024 (); extern "C" void m7025 (); extern "C" void m7026 (); extern "C" void m7027 (); extern "C" void m7028 (); extern "C" void m7029 (); extern "C" void m7030 (); extern "C" void m7031 (); extern "C" void m7032 (); extern "C" void m7033 (); extern "C" void m7034 (); extern "C" void m7035 (); extern "C" void m7036 (); extern "C" void m7037 (); extern "C" void m7038 (); extern "C" void m7039 (); extern "C" void m7040 (); extern "C" void m7041 (); extern "C" void m7042 (); extern "C" void m7043 (); extern "C" void m7044 (); extern "C" void m7045 (); extern "C" void m7046 (); extern "C" void m7047 (); extern "C" void m7048 (); extern "C" void m7049 (); extern "C" void m7050 (); extern "C" void m3932 (); extern "C" void m7051 (); extern "C" void m7052 (); extern "C" void m7053 (); extern "C" void m7054 (); extern "C" void m7055 (); extern "C" void m7056 (); extern "C" void m7057 (); extern "C" void m7058 (); extern "C" void m7059 (); extern "C" void m7060 (); extern "C" void m7061 (); extern "C" void m7062 (); extern "C" void m7063 (); extern "C" void m7064 (); extern "C" void m7065 (); extern "C" void m7066 (); extern "C" void m7067 (); extern "C" void m3982 (); extern "C" void m7068 (); extern "C" void m7069 (); extern "C" void m3985 (); extern "C" void m3984 (); extern "C" void m7070 (); extern "C" void m7071 (); extern "C" void m7072 (); extern "C" void m7073 (); extern "C" void m7074 (); extern "C" void m7075 (); extern "C" void m7076 (); extern "C" void m7077 (); extern "C" void m7078 (); extern "C" void m7079 (); extern "C" void m7080 (); extern "C" void m7081 (); extern "C" void m7082 (); extern "C" void m7083 (); extern "C" void m7084 (); extern "C" void m7085 (); extern "C" void m7086 (); extern "C" void m7087 (); extern "C" void m7088 (); extern "C" void m7089 (); extern "C" void m7090 (); extern "C" void m7091 (); extern "C" void m7092 (); extern "C" void m7093 (); extern "C" void m7094 (); extern "C" void m7095 (); extern "C" void m7096 (); extern "C" void m7097 (); extern "C" void m7098 (); extern "C" void m7099 (); extern "C" void m7100 (); extern "C" void m7101 (); extern "C" void m7102 (); extern "C" void m7103 (); extern "C" void m7104 (); extern "C" void m7105 (); extern "C" void m7106 (); extern "C" void m7107 (); extern "C" void m7108 (); extern "C" void m7109 (); extern "C" void m7110 (); extern "C" void m7111 (); extern "C" void m7112 (); extern "C" void m7113 (); extern "C" void m7114 (); extern "C" void m7115 (); extern "C" void m7116 (); extern "C" void m7117 (); extern "C" void m7118 (); extern "C" void m7119 (); extern "C" void m7120 (); extern "C" void m7121 (); extern "C" void m7122 (); extern "C" void m7123 (); extern "C" void m7124 (); extern "C" void m7125 (); extern "C" void m7126 (); extern "C" void m7127 (); extern "C" void m7128 (); extern "C" void m7129 (); extern "C" void m7130 (); extern "C" void m7131 (); extern "C" void m7132 (); extern "C" void m7133 (); extern "C" void m7134 (); extern "C" void m7135 (); extern "C" void m7136 (); extern "C" void m7137 (); extern "C" void m7138 (); extern "C" void m7139 (); extern "C" void m7140 (); extern "C" void m7141 (); extern "C" void m7142 (); extern "C" void m7143 (); extern "C" void m7144 (); extern "C" void m7145 (); extern "C" void m7146 (); extern "C" void m7147 (); extern "C" void m7148 (); extern "C" void m7149 (); extern "C" void m7150 (); extern "C" void m7151 (); extern "C" void m7152 (); extern "C" void m7153 (); extern "C" void m7154 (); extern "C" void m7155 (); extern "C" void m7156 (); extern "C" void m7157 (); extern "C" void m7158 (); extern "C" void m7159 (); extern "C" void m7160 (); extern "C" void m7161 (); extern "C" void m7162 (); extern "C" void m7163 (); extern "C" void m7164 (); extern "C" void m7165 (); extern "C" void m7166 (); extern "C" void m7167 (); extern "C" void m7168 (); extern "C" void m7169 (); extern "C" void m7170 (); extern "C" void m7171 (); extern "C" void m7172 (); extern "C" void m7173 (); extern "C" void m7174 (); extern "C" void m7175 (); extern "C" void m7176 (); extern "C" void m7177 (); extern "C" void m7178 (); extern "C" void m7179 (); extern "C" void m7180 (); extern "C" void m7181 (); extern "C" void m7182 (); extern "C" void m7183 (); extern "C" void m7184 (); extern "C" void m7185 (); extern "C" void m7186 (); extern "C" void m7187 (); extern "C" void m7188 (); extern "C" void m7189 (); extern "C" void m7190 (); extern "C" void m7191 (); extern "C" void m7192 (); extern "C" void m7193 (); extern "C" void m7194 (); extern "C" void m7195 (); extern "C" void m7196 (); extern "C" void m7197 (); extern "C" void m7198 (); extern "C" void m7199 (); extern "C" void m7200 (); extern "C" void m7201 (); extern "C" void m7202 (); extern "C" void m7203 (); extern "C" void m7204 (); extern "C" void m7205 (); extern "C" void m7206 (); extern "C" void m7207 (); extern "C" void m7208 (); extern "C" void m7209 (); extern "C" void m7210 (); extern "C" void m7211 (); extern "C" void m7212 (); extern "C" void m7213 (); extern "C" void m7214 (); extern "C" void m7215 (); extern "C" void m7216 (); extern "C" void m7217 (); extern "C" void m7218 (); extern "C" void m7219 (); extern "C" void m7220 (); extern "C" void m7221 (); extern "C" void m7222 (); extern "C" void m7223 (); extern "C" void m7224 (); extern "C" void m7225 (); extern "C" void m7226 (); extern "C" void m7227 (); extern "C" void m7228 (); extern "C" void m7229 (); extern "C" void m7230 (); extern "C" void m7231 (); extern "C" void m7232 (); extern "C" void m7233 (); extern "C" void m7234 (); extern "C" void m7235 (); extern "C" void m7236 (); extern "C" void m7237 (); extern "C" void m7238 (); extern "C" void m7239 (); extern "C" void m7240 (); extern "C" void m7241 (); extern "C" void m7242 (); extern "C" void m7243 (); extern "C" void m7244 (); extern "C" void m7245 (); extern "C" void m7246 (); extern "C" void m7247 (); extern "C" void m7248 (); extern "C" void m7249 (); extern "C" void m7250 (); extern "C" void m7251 (); extern "C" void m7252 (); extern "C" void m7253 (); extern "C" void m7254 (); extern "C" void m7255 (); extern "C" void m7256 (); extern "C" void m7257 (); extern "C" void m7258 (); extern "C" void m7259 (); extern "C" void m7260 (); extern "C" void m7261 (); extern "C" void m7262 (); extern "C" void m7263 (); extern "C" void m7264 (); extern "C" void m7265 (); extern "C" void m7266 (); extern "C" void m7267 (); extern "C" void m7268 (); extern "C" void m7269 (); extern "C" void m7270 (); extern "C" void m7271 (); extern "C" void m7272 (); extern "C" void m7273 (); extern "C" void m7274 (); extern "C" void m7275 (); extern "C" void m7276 (); extern "C" void m7277 (); extern "C" void m7278 (); extern "C" void m7279 (); extern "C" void m7280 (); extern "C" void m7281 (); extern "C" void m7282 (); extern "C" void m7283 (); extern "C" void m7284 (); extern "C" void m7285 (); extern "C" void m7286 (); extern "C" void m7287 (); extern "C" void m7288 (); extern "C" void m7289 (); extern "C" void m7290 (); extern "C" void m7291 (); extern "C" void m7292 (); extern "C" void m7293 (); extern "C" void m7294 (); extern "C" void m7295 (); extern "C" void m7296 (); extern "C" void m7297 (); extern "C" void m7298 (); extern "C" void m7299 (); extern "C" void m7300 (); extern "C" void m7301 (); extern "C" void m7302 (); extern "C" void m7303 (); extern "C" void m7304 (); extern "C" void m7305 (); extern "C" void m7306 (); extern "C" void m7307 (); extern "C" void m7308 (); extern "C" void m7309 (); extern "C" void m7310 (); extern "C" void m7311 (); extern "C" void m7312 (); extern "C" void m7313 (); extern "C" void m7314 (); extern "C" void m7315 (); extern "C" void m7316 (); extern "C" void m7317 (); extern "C" void m7318 (); extern "C" void m7319 (); extern "C" void m7320 (); extern "C" void m7321 (); extern "C" void m7322 (); extern "C" void m7323 (); extern "C" void m7324 (); extern "C" void m7325 (); extern "C" void m7326 (); extern "C" void m7327 (); extern "C" void m7328 (); extern "C" void m7329 (); extern "C" void m7330 (); extern "C" void m7331 (); extern "C" void m7332 (); extern "C" void m7333 (); extern "C" void m7334 (); extern "C" void m7335 (); extern "C" void m7336 (); extern "C" void m7337 (); extern "C" void m7338 (); extern "C" void m7339 (); extern "C" void m7340 (); extern "C" void m7341 (); extern "C" void m7342 (); extern "C" void m7343 (); extern "C" void m7344 (); extern "C" void m7345 (); extern "C" void m7346 (); extern "C" void m7347 (); extern "C" void m7348 (); extern "C" void m7349 (); extern "C" void m7350 (); extern "C" void m7351 (); extern "C" void m7352 (); extern "C" void m7353 (); extern "C" void m7354 (); extern "C" void m7355 (); extern "C" void m7356 (); extern "C" void m7357 (); extern "C" void m7358 (); extern "C" void m7359 (); extern "C" void m7360 (); extern "C" void m7361 (); extern "C" void m7362 (); extern "C" void m7363 (); extern "C" void m7364 (); extern "C" void m7365 (); extern "C" void m7366 (); extern "C" void m7367 (); extern "C" void m7368 (); extern "C" void m7369 (); extern "C" void m7370 (); extern "C" void m7371 (); extern "C" void m7372 (); extern "C" void m7373 (); extern "C" void m7374 (); extern "C" void m7375 (); extern "C" void m7376 (); extern "C" void m7377 (); extern "C" void m7378 (); extern "C" void m7379 (); extern "C" void m7380 (); extern "C" void m7381 (); extern "C" void m7382 (); extern "C" void m7383 (); extern "C" void m7384 (); extern "C" void m7385 (); extern "C" void m7386 (); extern "C" void m7387 (); extern "C" void m7388 (); extern "C" void m7389 (); extern "C" void m7390 (); extern "C" void m7391 (); extern "C" void m7392 (); extern "C" void m7393 (); extern "C" void m7394 (); extern "C" void m7395 (); extern "C" void m7396 (); extern "C" void m7397 (); extern "C" void m7398 (); extern "C" void m7399 (); extern "C" void m7400 (); extern "C" void m7401 (); extern "C" void m7402 (); extern "C" void m7403 (); extern "C" void m7404 (); extern "C" void m7405 (); extern "C" void m7406 (); extern "C" void m7407 (); extern "C" void m7408 (); extern "C" void m7409 (); extern "C" void m7410 (); extern "C" void m7411 (); extern "C" void m7412 (); extern "C" void m7413 (); extern "C" void m7414 (); extern "C" void m7415 (); extern "C" void m7416 (); extern "C" void m7417 (); extern "C" void m7418 (); extern "C" void m7419 (); extern "C" void m7420 (); extern "C" void m7421 (); extern "C" void m7422 (); extern "C" void m7423 (); extern "C" void m7424 (); extern "C" void m7425 (); extern "C" void m7426 (); extern "C" void m7427 (); extern "C" void m7428 (); extern "C" void m7429 (); extern "C" void m7430 (); extern "C" void m7431 (); extern "C" void m7432 (); extern "C" void m7433 (); extern "C" void m7434 (); extern "C" void m7435 (); extern "C" void m7436 (); extern "C" void m7437 (); extern "C" void m7438 (); extern "C" void m7439 (); extern "C" void m7440 (); extern "C" void m7441 (); extern "C" void m7442 (); extern "C" void m7443 (); extern "C" void m7444 (); extern "C" void m7445 (); extern "C" void m7446 (); extern "C" void m7447 (); extern "C" void m7448 (); extern "C" void m7449 (); extern "C" void m7450 (); extern "C" void m7451 (); extern "C" void m7452 (); extern "C" void m7453 (); extern "C" void m7454 (); extern "C" void m7455 (); extern "C" void m7456 (); extern "C" void m7457 (); extern "C" void m7458 (); extern "C" void m7459 (); extern "C" void m7460 (); extern "C" void m7461 (); extern "C" void m7462 (); extern "C" void m7463 (); extern "C" void m7464 (); extern "C" void m7465 (); extern "C" void m7466 (); extern "C" void m7467 (); extern "C" void m7468 (); extern "C" void m7469 (); extern "C" void m7470 (); extern "C" void m7471 (); extern "C" void m7472 (); extern "C" void m7473 (); extern "C" void m7474 (); extern "C" void m7475 (); extern "C" void m7476 (); extern "C" void m7477 (); extern "C" void m7478 (); extern "C" void m7479 (); extern "C" void m7480 (); extern "C" void m7481 (); extern "C" void m7482 (); extern "C" void m7483 (); extern "C" void m7484 (); extern "C" void m7485 (); extern "C" void m7486 (); extern "C" void m7487 (); extern "C" void m7488 (); extern "C" void m7489 (); extern "C" void m7490 (); extern "C" void m7491 (); extern "C" void m7492 (); extern "C" void m7493 (); extern "C" void m7494 (); extern "C" void m7495 (); extern "C" void m7496 (); extern "C" void m7497 (); extern "C" void m7498 (); extern "C" void m7499 (); extern "C" void m7500 (); extern "C" void m7501 (); extern "C" void m7502 (); extern "C" void m7503 (); extern "C" void m7504 (); extern "C" void m7505 (); extern "C" void m7506 (); extern "C" void m7507 (); extern "C" void m7508 (); extern "C" void m7509 (); extern "C" void m7510 (); extern "C" void m7511 (); extern "C" void m7512 (); extern "C" void m7513 (); extern "C" void m7514 (); extern "C" void m7515 (); extern "C" void m7516 (); extern "C" void m7517 (); extern "C" void m7518 (); extern "C" void m7519 (); extern "C" void m7520 (); extern "C" void m7521 (); extern "C" void m7522 (); extern "C" void m7523 (); extern "C" void m7524 (); extern "C" void m7525 (); extern "C" void m7526 (); extern "C" void m7527 (); extern "C" void m7528 (); extern "C" void m7529 (); extern "C" void m7530 (); extern "C" void m7531 (); extern "C" void m7532 (); extern "C" void m7533 (); extern "C" void m7534 (); extern "C" void m7535 (); extern "C" void m7536 (); extern "C" void m7537 (); extern "C" void m7538 (); extern "C" void m7539 (); extern "C" void m7540 (); extern "C" void m7541 (); extern "C" void m7542 (); extern "C" void m7543 (); extern "C" void m7544 (); extern "C" void m7545 (); extern "C" void m7546 (); extern "C" void m7547 (); extern "C" void m7548 (); extern "C" void m7549 (); extern "C" void m7550 (); extern "C" void m7551 (); extern "C" void m7552 (); extern "C" void m2897 (); extern "C" void m7553 (); extern "C" void m7554 (); extern "C" void m7555 (); extern "C" void m7556 (); extern "C" void m7557 (); extern "C" void m7558 (); extern "C" void m7559 (); extern "C" void m7560 (); extern "C" void m7561 (); extern "C" void m7562 (); extern "C" void m7563 (); extern "C" void m7564 (); extern "C" void m7565 (); extern "C" void m7566 (); extern "C" void m7567 (); extern "C" void m7568 (); extern "C" void m7569 (); extern "C" void m7570 (); extern "C" void m7571 (); extern "C" void m7572 (); extern "C" void m7573 (); extern "C" void m7574 (); extern "C" void m7575 (); extern "C" void m7576 (); extern "C" void m7577 (); extern "C" void m7578 (); extern "C" void m7579 (); extern "C" void m7580 (); extern "C" void m7581 (); extern "C" void m7582 (); extern "C" void m7583 (); extern "C" void m7584 (); extern "C" void m7585 (); extern "C" void m7586 (); extern "C" void m7587 (); extern "C" void m7588 (); extern "C" void m7589 (); extern "C" void m7590 (); extern "C" void m7591 (); extern "C" void m7592 (); extern "C" void m7593 (); extern "C" void m7594 (); extern "C" void m7595 (); extern "C" void m7596 (); extern "C" void m7597 (); extern "C" void m7598 (); extern "C" void m7599 (); extern "C" void m7600 (); extern "C" void m7601 (); extern "C" void m7602 (); extern "C" void m7603 (); extern "C" void m7604 (); extern "C" void m7605 (); extern "C" void m7606 (); extern "C" void m7607 (); extern "C" void m7608 (); extern "C" void m7609 (); extern "C" void m7610 (); extern "C" void m7611 (); extern "C" void m7612 (); extern "C" void m7613 (); extern "C" void m7614 (); extern "C" void m7615 (); extern "C" void m7616 (); extern "C" void m7617 (); extern "C" void m7618 (); extern "C" void m7619 (); extern "C" void m7620 (); extern "C" void m7621 (); extern "C" void m7622 (); extern "C" void m7623 (); extern "C" void m7624 (); extern "C" void m7625 (); extern "C" void m7626 (); extern "C" void m7627 (); extern "C" void m7628 (); extern "C" void m7629 (); extern "C" void m7630 (); extern "C" void m7631 (); extern "C" void m7632 (); extern "C" void m7633 (); extern "C" void m7634 (); extern "C" void m7635 (); extern "C" void m7636 (); extern "C" void m7637 (); extern "C" void m7638 (); extern "C" void m7639 (); extern "C" void m7640 (); extern "C" void m7641 (); extern "C" void m7642 (); extern "C" void m7643 (); extern "C" void m7644 (); extern "C" void m7645 (); extern "C" void m7646 (); extern "C" void m7647 (); extern "C" void m7648 (); extern "C" void m7649 (); extern "C" void m7650 (); extern "C" void m7651 (); extern "C" void m7652 (); extern "C" void m7653 (); extern "C" void m7654 (); extern "C" void m7655 (); extern "C" void m7656 (); extern "C" void m7657 (); extern "C" void m7658 (); extern "C" void m7659 (); extern "C" void m7660 (); extern "C" void m7661 (); extern "C" void m7662 (); extern "C" void m7663 (); extern "C" void m7664 (); extern "C" void m7665 (); extern "C" void m7666 (); extern "C" void m7667 (); extern "C" void m7668 (); extern "C" void m7669 (); extern "C" void m7670 (); extern "C" void m7671 (); extern "C" void m7672 (); extern "C" void m7673 (); extern "C" void m7674 (); extern "C" void m7675 (); extern "C" void m7676 (); extern "C" void m7677 (); extern "C" void m7678 (); extern "C" void m7679 (); extern "C" void m7680 (); extern "C" void m7681 (); extern "C" void m7682 (); extern "C" void m7683 (); extern "C" void m7684 (); extern "C" void m7685 (); extern "C" void m7686 (); extern "C" void m7687 (); extern "C" void m7688 (); extern "C" void m7689 (); extern "C" void m7690 (); extern "C" void m7691 (); extern "C" void m7692 (); extern "C" void m7693 (); extern "C" void m7694 (); extern "C" void m7695 (); extern "C" void m7696 (); extern "C" void m7697 (); extern "C" void m7698 (); extern "C" void m7699 (); extern "C" void m7700 (); extern "C" void m7701 (); extern "C" void m7702 (); extern "C" void m7703 (); extern "C" void m7704 (); extern "C" void m7705 (); extern "C" void m7706 (); extern "C" void m7707 (); extern "C" void m7708 (); extern "C" void m7709 (); extern "C" void m7710 (); extern "C" void m7711 (); extern "C" void m7712 (); extern "C" void m7713 (); extern "C" void m7714 (); extern "C" void m7715 (); extern "C" void m7716 (); extern "C" void m7717 (); extern "C" void m7718 (); extern "C" void m7719 (); extern "C" void m7720 (); extern "C" void m7721 (); extern "C" void m7722 (); extern "C" void m7723 (); extern "C" void m7724 (); extern "C" void m7725 (); extern "C" void m7726 (); extern "C" void m7727 (); extern "C" void m7728 (); extern "C" void m7729 (); extern "C" void m7730 (); extern "C" void m7731 (); extern "C" void m7732 (); extern "C" void m7733 (); extern "C" void m7734 (); extern "C" void m7735 (); extern "C" void m7736 (); extern "C" void m7737 (); extern "C" void m7738 (); extern "C" void m7739 (); extern "C" void m7740 (); extern "C" void m7741 (); extern "C" void m7742 (); extern "C" void m7743 (); extern "C" void m7744 (); extern "C" void m7745 (); extern "C" void m7746 (); extern "C" void m7747 (); extern "C" void m7748 (); extern "C" void m7749 (); extern "C" void m7750 (); extern "C" void m7751 (); extern "C" void m7752 (); extern "C" void m7753 (); extern "C" void m7754 (); extern "C" void m7755 (); extern "C" void m7756 (); extern "C" void m7757 (); extern "C" void m7758 (); extern "C" void m7759 (); extern "C" void m7760 (); extern "C" void m7761 (); extern "C" void m7762 (); extern "C" void m7763 (); extern "C" void m7764 (); extern "C" void m7765 (); extern "C" void m7766 (); extern "C" void m7767 (); extern "C" void m7768 (); extern "C" void m7769 (); extern "C" void m7770 (); extern "C" void m7771 (); extern "C" void m7772 (); extern "C" void m7773 (); extern "C" void m7774 (); extern "C" void m7775 (); extern "C" void m7776 (); extern "C" void m7777 (); extern "C" void m7778 (); extern "C" void m7779 (); extern "C" void m7780 (); extern "C" void m7781 (); extern "C" void m7782 (); extern "C" void m7783 (); extern "C" void m7784 (); extern "C" void m7785 (); extern "C" void m7786 (); extern "C" void m7787 (); extern "C" void m7788 (); extern "C" void m7789 (); extern "C" void m7790 (); extern "C" void m7791 (); extern "C" void m7792 (); extern "C" void m7793 (); extern "C" void m7794 (); extern "C" void m7795 (); extern "C" void m7796 (); extern "C" void m7797 (); extern "C" void m7798 (); extern "C" void m7799 (); extern "C" void m7800 (); extern "C" void m7801 (); extern "C" void m7802 (); extern "C" void m7803 (); extern "C" void m7804 (); extern "C" void m7805 (); extern "C" void m7806 (); extern "C" void m7807 (); extern "C" void m7808 (); extern "C" void m7809 (); extern "C" void m7810 (); extern "C" void m7811 (); extern "C" void m7812 (); extern "C" void m7813 (); extern "C" void m7814 (); extern "C" void m7815 (); extern "C" void m7816 (); extern "C" void m7817 (); extern "C" void m7818 (); extern "C" void m7819 (); extern "C" void m7820 (); extern "C" void m7821 (); extern "C" void m7822 (); extern "C" void m7823 (); extern "C" void m7824 (); extern "C" void m7825 (); extern "C" void m7826 (); extern "C" void m7827 (); extern "C" void m7828 (); extern "C" void m7829 (); extern "C" void m7830 (); extern "C" void m7831 (); extern "C" void m7832 (); extern "C" void m7833 (); extern "C" void m7834 (); extern "C" void m7835 (); extern "C" void m7836 (); extern "C" void m7837 (); extern "C" void m7838 (); extern "C" void m7839 (); extern "C" void m7840 (); extern "C" void m7841 (); extern "C" void m7842 (); extern "C" void m7843 (); extern "C" void m7844 (); extern "C" void m7845 (); extern "C" void m7846 (); extern "C" void m7847 (); extern "C" void m7848 (); extern "C" void m7849 (); extern "C" void m7850 (); extern "C" void m7851 (); extern "C" void m7852 (); extern "C" void m7853 (); extern "C" void m7854 (); extern "C" void m7855 (); extern "C" void m7856 (); extern "C" void m7857 (); extern "C" void m7858 (); extern "C" void m7859 (); extern "C" void m7860 (); extern "C" void m7861 (); extern "C" void m7862 (); extern "C" void m7863 (); extern "C" void m7864 (); extern "C" void m7865 (); extern "C" void m7866 (); extern "C" void m7867 (); extern "C" void m7868 (); extern "C" void m7869 (); extern "C" void m7870 (); extern "C" void m7871 (); extern "C" void m7872 (); extern "C" void m7873 (); extern "C" void m7874 (); extern "C" void m7875 (); extern "C" void m7876 (); extern "C" void m7877 (); extern "C" void m7878 (); extern "C" void m7879 (); extern "C" void m7880 (); extern "C" void m7881 (); extern "C" void m7882 (); extern "C" void m7883 (); extern "C" void m7884 (); extern "C" void m7885 (); extern "C" void m7886 (); extern "C" void m7887 (); extern "C" void m7888 (); extern "C" void m7889 (); extern "C" void m7890 (); extern "C" void m7891 (); extern "C" void m7892 (); extern "C" void m7893 (); extern "C" void m7894 (); extern "C" void m7895 (); extern "C" void m7896 (); extern "C" void m7897 (); extern "C" void m7898 (); extern "C" void m7899 (); extern "C" void m7900 (); extern "C" void m7901 (); extern "C" void m7902 (); extern "C" void m7903 (); extern "C" void m7904 (); extern "C" void m7905 (); extern "C" void m7906 (); extern "C" void m7907 (); extern "C" void m7908 (); extern "C" void m7909 (); extern "C" void m7910 (); extern "C" void m7911 (); extern "C" void m7912 (); extern "C" void m7913 (); extern "C" void m7914 (); extern "C" void m7915 (); extern "C" void m7916 (); extern "C" void m7917 (); extern "C" void m7918 (); extern "C" void m7919 (); extern "C" void m7920 (); extern "C" void m7921 (); extern "C" void m7922 (); extern "C" void m7923 (); extern "C" void m7924 (); extern "C" void m7925 (); extern "C" void m7926 (); extern "C" void m7927 (); extern "C" void m7928 (); extern "C" void m7929 (); extern "C" void m7930 (); extern "C" void m7931 (); extern "C" void m7932 (); extern "C" void m7933 (); extern "C" void m7934 (); extern "C" void m7935 (); extern "C" void m7936 (); extern "C" void m7937 (); extern "C" void m7938 (); extern "C" void m7939 (); extern "C" void m7940 (); extern "C" void m7941 (); extern "C" void m7942 (); extern "C" void m7943 (); extern "C" void m7944 (); extern "C" void m7945 (); extern "C" void m7946 (); extern "C" void m7947 (); extern "C" void m7948 (); extern "C" void m7949 (); extern "C" void m7950 (); extern "C" void m7951 (); extern "C" void m7952 (); extern "C" void m7953 (); extern "C" void m7954 (); extern "C" void m7955 (); extern "C" void m7956 (); extern "C" void m7957 (); extern "C" void m7958 (); extern "C" void m7959 (); extern "C" void m7960 (); extern "C" void m7961 (); extern "C" void m7962 (); extern "C" void m7963 (); extern "C" void m7964 (); extern "C" void m7965 (); extern "C" void m7966 (); extern "C" void m7967 (); extern "C" void m7968 (); extern "C" void m7969 (); extern "C" void m7970 (); extern "C" void m7971 (); extern "C" void m7972 (); extern "C" void m7973 (); extern "C" void m7974 (); extern "C" void m7975 (); extern "C" void m7976 (); extern "C" void m7977 (); extern "C" void m7978 (); extern "C" void m7979 (); extern "C" void m7980 (); extern "C" void m7981 (); extern "C" void m7982 (); extern "C" void m7983 (); extern "C" void m7984 (); extern "C" void m7985 (); extern "C" void m7986 (); extern "C" void m7987 (); extern "C" void m7988 (); extern "C" void m7989 (); extern "C" void m7990 (); extern "C" void m7991 (); extern "C" void m7992 (); extern "C" void m7993 (); extern "C" void m7994 (); extern "C" void m7995 (); extern "C" void m7996 (); extern "C" void m7997 (); extern "C" void m7998 (); extern "C" void m7999 (); extern "C" void m8000 (); extern "C" void m8001 (); extern "C" void m8002 (); extern "C" void m8003 (); extern "C" void m8004 (); extern "C" void m8005 (); extern "C" void m8006 (); extern "C" void m8007 (); extern "C" void m8008 (); extern "C" void m8009 (); extern "C" void m8010 (); extern "C" void m8011 (); extern "C" void m8012 (); extern "C" void m8013 (); extern "C" void m8014 (); extern "C" void m8015 (); extern "C" void m8016 (); extern "C" void m8017 (); extern "C" void m8018 (); extern "C" void m8019 (); extern "C" void m8020 (); extern "C" void m8021 (); extern "C" void m8022 (); extern "C" void m8023 (); extern "C" void m8024 (); extern "C" void m8025 (); extern "C" void m8026 (); extern "C" void m8027 (); extern "C" void m8028 (); extern "C" void m8029 (); extern "C" void m8030 (); extern "C" void m8031 (); extern "C" void m8032 (); extern "C" void m8033 (); extern "C" void m8034 (); extern "C" void m8035 (); extern "C" void m8036 (); extern "C" void m8037 (); extern "C" void m8038 (); extern "C" void m8039 (); extern "C" void m8040 (); extern "C" void m8041 (); extern "C" void m8042 (); extern "C" void m8043 (); extern "C" void m8044 (); extern "C" void m8045 (); extern "C" void m8046 (); extern "C" void m8047 (); extern "C" void m8048 (); extern "C" void m8049 (); extern "C" void m8050 (); extern "C" void m8051 (); extern "C" void m8052 (); extern "C" void m8053 (); extern "C" void m8054 (); extern "C" void m8055 (); extern "C" void m8056 (); extern "C" void m8057 (); extern "C" void m8058 (); extern "C" void m8059 (); extern "C" void m8060 (); extern "C" void m8061 (); extern "C" void m8062 (); extern "C" void m8063 (); extern "C" void m8064 (); extern "C" void m8065 (); extern "C" void m8066 (); extern "C" void m8067 (); extern "C" void m8068 (); extern "C" void m8069 (); extern "C" void m8070 (); extern "C" void m8071 (); extern "C" void m8072 (); extern "C" void m8073 (); extern "C" void m8074 (); extern "C" void m8075 (); extern "C" void m8076 (); extern "C" void m8077 (); extern "C" void m8078 (); extern "C" void m8079 (); extern "C" void m8080 (); extern "C" void m8081 (); extern "C" void m8082 (); extern "C" void m8083 (); extern "C" void m8084 (); extern "C" void m8085 (); extern "C" void m8086 (); extern "C" void m8087 (); extern "C" void m8088 (); extern "C" void m8089 (); extern "C" void m8090 (); extern "C" void m8091 (); extern "C" void m8092 (); extern "C" void m8093 (); extern "C" void m8094 (); extern "C" void m8095 (); extern "C" void m8096 (); extern "C" void m8097 (); extern "C" void m8098 (); extern "C" void m8099 (); extern "C" void m8100 (); extern "C" void m8101 (); extern "C" void m8102 (); extern "C" void m8103 (); extern "C" void m8104 (); extern "C" void m8105 (); extern "C" void m8106 (); extern "C" void m8107 (); extern "C" void m8108 (); extern "C" void m8109 (); extern "C" void m8110 (); extern "C" void m8111 (); extern "C" void m8112 (); extern "C" void m8113 (); extern "C" void m8114 (); extern "C" void m8115 (); extern "C" void m8116 (); extern "C" void m8117 (); extern "C" void m8118 (); extern "C" void m8119 (); extern "C" void m8120 (); extern "C" void m8121 (); extern "C" void m8122 (); extern "C" void m8123 (); extern "C" void m8124 (); extern "C" void m8125 (); extern "C" void m8126 (); extern "C" void m8127 (); extern "C" void m8128 (); extern "C" void m8129 (); extern "C" void m8130 (); extern "C" void m8131 (); extern "C" void m8132 (); extern "C" void m8133 (); extern "C" void m8134 (); extern "C" void m8135 (); extern "C" void m8136 (); extern "C" void m8137 (); extern "C" void m8138 (); extern "C" void m8139 (); extern "C" void m8140 (); extern "C" void m8141 (); extern "C" void m8142 (); extern "C" void m8143 (); extern "C" void m8144 (); extern "C" void m8145 (); extern "C" void m8146 (); extern "C" void m8147 (); extern "C" void m8148 (); extern "C" void m8149 (); extern "C" void m8150 (); extern "C" void m8151 (); extern "C" void m8152 (); extern "C" void m8153 (); extern "C" void m8154 (); extern "C" void m8155 (); extern "C" void m8156 (); extern "C" void m8157 (); extern "C" void m8158 (); extern "C" void m8159 (); extern "C" void m8160 (); extern "C" void m8161 (); extern "C" void m8162 (); extern "C" void m8163 (); extern "C" void m8164 (); extern "C" void m8165 (); extern "C" void m8166 (); extern "C" void m8167 (); extern "C" void m8168 (); extern "C" void m8169 (); extern "C" void m8170 (); extern "C" void m8171 (); extern "C" void m8172 (); extern "C" void m8173 (); extern "C" void m8174 (); extern "C" void m8175 (); extern "C" void m8176 (); extern "C" void m8177 (); extern "C" void m8178 (); extern "C" void m8179 (); extern "C" void m8180 (); extern "C" void m8181 (); extern "C" void m8182 (); extern "C" void m8183 (); extern "C" void m8184 (); extern "C" void m8185 (); extern "C" void m8186 (); extern "C" void m8187 (); extern "C" void m8188 (); extern "C" void m8189 (); extern "C" void m8190 (); extern "C" void m8191 (); extern "C" void m8192 (); extern "C" void m8193 (); extern "C" void m8194 (); extern "C" void m8195 (); extern "C" void m8196 (); extern "C" void m8197 (); extern "C" void m8198 (); extern "C" void m8199 (); extern "C" void m8200 (); extern "C" void m8201 (); extern "C" void m8202 (); extern "C" void m8203 (); extern "C" void m8204 (); extern "C" void m8205 (); extern "C" void m8206 (); extern "C" void m8207 (); extern "C" void m8208 (); extern "C" void m8209 (); extern "C" void m8210 (); extern "C" void m8211 (); extern "C" void m8212 (); extern "C" void m8213 (); extern "C" void m8214 (); extern "C" void m8215 (); extern "C" void m8216 (); extern "C" void m8217 (); extern "C" void m8218 (); extern "C" void m8219 (); extern "C" void m8220 (); extern "C" void m8221 (); extern "C" void m8222 (); extern "C" void m8223 (); extern "C" void m8224 (); extern "C" void m8225 (); extern "C" void m8226 (); extern "C" void m8227 (); extern "C" void m8228 (); extern "C" void m8229 (); extern "C" void m8230 (); extern "C" void m8231 (); extern "C" void m8232 (); extern "C" void m8233 (); extern "C" void m8234 (); extern "C" void m8235 (); extern "C" void m8236 (); extern "C" void m8237 (); extern "C" void m8238 (); extern "C" void m8239 (); extern "C" void m8240 (); extern "C" void m8241 (); extern "C" void m8242 (); extern "C" void m8243 (); extern "C" void m8244 (); extern "C" void m8245 (); extern "C" void m8246 (); extern "C" void m8247 (); extern "C" void m8248 (); extern "C" void m8249 (); extern "C" void m8250 (); extern "C" void m8251 (); extern "C" void m8252 (); extern "C" void m8253 (); extern "C" void m8254 (); extern "C" void m8255 (); extern "C" void m8256 (); extern "C" void m8257 (); extern "C" void m8258 (); extern "C" void m8259 (); extern "C" void m8260 (); extern "C" void m8261 (); extern "C" void m8262 (); extern "C" void m8263 (); extern "C" void m8264 (); extern "C" void m8265 (); extern "C" void m8266 (); extern "C" void m8267 (); extern "C" void m8268 (); extern "C" void m8269 (); extern "C" void m8270 (); extern "C" void m8271 (); extern "C" void m8272 (); extern "C" void m8273 (); extern "C" void m8274 (); extern "C" void m8275 (); extern "C" void m8276 (); extern "C" void m8277 (); extern "C" void m8278 (); extern "C" void m8279 (); extern "C" void m8280 (); extern "C" void m8281 (); extern "C" void m8282 (); extern "C" void m8283 (); extern "C" void m8284 (); extern "C" void m8285 (); extern "C" void m8286 (); extern "C" void m8287 (); extern "C" void m8288 (); extern "C" void m8289 (); extern "C" void m8290 (); extern "C" void m8291 (); extern "C" void m8292 (); extern "C" void m8293 (); extern "C" void m8294 (); extern "C" void m8295 (); extern "C" void m8296 (); extern "C" void m8297 (); extern "C" void m8298 (); extern "C" void m8299 (); extern "C" void m8300 (); extern "C" void m8301 (); extern "C" void m8302 (); extern "C" void m8303 (); extern "C" void m8304 (); extern "C" void m8305 (); extern "C" void m8306 (); extern "C" void m8307 (); extern "C" void m8308 (); extern "C" void m8309 (); extern "C" void m8310 (); extern "C" void m8311 (); extern "C" void m8312 (); extern "C" void m8313 (); extern "C" void m8314 (); extern "C" void m8315 (); extern "C" void m8316 (); extern "C" void m8317 (); extern "C" void m8318 (); extern "C" void m8319 (); extern "C" void m8320 (); extern "C" void m8321 (); extern "C" void m8322 (); extern "C" void m8323 (); extern "C" void m8324 (); extern "C" void m8325 (); extern "C" void m8326 (); extern "C" void m8327 (); extern "C" void m8328 (); extern "C" void m8329 (); extern "C" void m8330 (); extern "C" void m8331 (); extern "C" void m8332 (); extern "C" void m8333 (); extern "C" void m8334 (); extern "C" void m8335 (); extern "C" void m8336 (); extern "C" void m8337 (); extern "C" void m8338 (); extern "C" void m8339 (); extern "C" void m8340 (); extern "C" void m8341 (); extern "C" void m8342 (); extern "C" void m8343 (); extern "C" void m8344 (); extern "C" void m8345 (); extern "C" void m8346 (); extern "C" void m8347 (); extern "C" void m8348 (); extern "C" void m8349 (); extern "C" void m8350 (); extern "C" void m8351 (); extern "C" void m8352 (); extern "C" void m8353 (); extern "C" void m8354 (); extern "C" void m8355 (); extern "C" void m8356 (); extern "C" void m8357 (); extern "C" void m8358 (); extern "C" void m8359 (); extern "C" void m8360 (); extern "C" void m8361 (); extern "C" void m8362 (); extern "C" void m8363 (); extern "C" void m8364 (); extern "C" void m8365 (); extern "C" void m8366 (); extern "C" void m8367 (); extern "C" void m8368 (); extern "C" void m8369 (); extern "C" void m8370 (); extern "C" void m8371 (); extern "C" void m8372 (); extern "C" void m8373 (); extern "C" void m8374 (); extern "C" void m8375 (); extern "C" void m8376 (); extern "C" void m8377 (); extern "C" void m8378 (); extern "C" void m8379 (); extern "C" void m8380 (); extern "C" void m8381 (); extern "C" void m8382 (); extern "C" void m8383 (); extern "C" void m8384 (); extern "C" void m8385 (); extern "C" void m8386 (); extern "C" void m8387 (); extern "C" void m8388 (); extern "C" void m8389 (); extern "C" void m8390 (); extern "C" void m8391 (); extern "C" void m8392 (); extern "C" void m8393 (); extern "C" void m8394 (); extern "C" void m8395 (); extern "C" void m8396 (); extern "C" void m8397 (); extern "C" void m8398 (); extern "C" void m8399 (); extern "C" void m8400 (); extern "C" void m8401 (); extern "C" void m8402 (); extern "C" void m8403 (); extern "C" void m8404 (); extern "C" void m8405 (); extern "C" void m8406 (); extern "C" void m8407 (); extern "C" void m8408 (); extern "C" void m8409 (); extern "C" void m8410 (); extern "C" void m8411 (); extern "C" void m8412 (); extern "C" void m8413 (); extern "C" void m8414 (); extern "C" void m8415 (); extern "C" void m8416 (); extern "C" void m8417 (); extern "C" void m8418 (); extern "C" void m8419 (); extern "C" void m8420 (); extern "C" void m8421 (); extern "C" void m8422 (); extern "C" void m8423 (); extern "C" void m8424 (); extern "C" void m8425 (); extern "C" void m8426 (); extern "C" void m8427 (); extern "C" void m8428 (); extern "C" void m8429 (); extern "C" void m8430 (); extern "C" void m4899 (); extern "C" void m8431 (); extern "C" void m8432 (); extern "C" void m4895 (); extern "C" void m4898 (); extern "C" void m8433 (); extern "C" void m8434 (); extern "C" void m8435 (); extern "C" void m4897 (); extern "C" void m4896 (); extern "C" void m8436 (); extern "C" void m8437 (); extern "C" void m4906 (); extern "C" void m8438 (); extern "C" void m3922 (); extern "C" void m4900 (); extern "C" void m8439 (); extern "C" void m4905 (); extern "C" void m4904 (); extern "C" void m4903 (); extern "C" void m8440 (); extern "C" void m8441 (); extern "C" void m8442 (); extern "C" void m8443 (); extern "C" void m8444 (); extern "C" void m8445 (); extern "C" void m8446 (); extern "C" void m8447 (); extern "C" void m8448 (); extern "C" void m8449 (); extern "C" void m8450 (); extern "C" void m8451 (); extern "C" void m8452 (); extern "C" void m3983 (); extern "C" void m4932 (); extern "C" void m8453 (); extern "C" void m8454 (); extern "C" void m8455 (); extern "C" void m8456 (); extern "C" void m8457 (); extern "C" void m8458 (); extern "C" void m4934 (); extern "C" void m8459 (); extern "C" void m8460 (); extern "C" void m8461 (); extern "C" void m8462 (); extern "C" void m8463 (); extern "C" void m8464 (); extern "C" void m8465 (); extern "C" void m8466 (); extern "C" void m4937 (); extern "C" void m4939 (); extern "C" void m4938 (); extern "C" void m8467 (); extern "C" void m4935 (); extern "C" void m4936 (); extern "C" void m8468 (); extern "C" void m8469 (); extern "C" void m3896 (); extern "C" void m3895 (); extern "C" void m3992 (); extern "C" void m8470 (); extern "C" void m8471 (); extern "C" void m3976 (); extern "C" void m3977 (); extern "C" void m8472 (); extern "C" void m8473 (); extern "C" void m8474 (); extern "C" void m3887 (); extern "C" void m4945 (); extern "C" void m3888 (); extern "C" void m3876 (); extern "C" void m8475 (); extern "C" void m8476 (); extern "C" void m2959 (); extern "C" void m3910 (); extern "C" void m2968 (); extern "C" void m8477 (); extern "C" void m8478 (); extern "C" void m3941 (); extern "C" void m8479 (); extern "C" void m3890 (); extern "C" void m8480 (); extern "C" void m8481 (); extern "C" void m8482 (); extern "C" void m8483 (); extern "C" void m3891 (); extern "C" void m8484 (); extern "C" void m8485 (); extern "C" void m3942 (); extern "C" void m8486 (); extern "C" void m8487 (); extern "C" void m8488 (); extern "C" void m8489 (); extern "C" void m8490 (); extern "C" void m8491 (); extern "C" void m8492 (); extern "C" void m8493 (); extern "C" void m8494 (); extern "C" void m8495 (); extern "C" void m8496 (); extern "C" void m8497 (); extern "C" void m8498 (); extern "C" void m8499 (); extern "C" void m8500 (); extern "C" void m8501 (); extern "C" void m8502 (); extern "C" void m8503 (); extern "C" void m8504 (); extern "C" void m8505 (); extern "C" void m3893 (); extern "C" void m8506 (); extern "C" void m8507 (); extern "C" void m8508 (); extern "C" void m8509 (); extern "C" void m8510 (); extern "C" void m3912 (); extern "C" void m8511 (); extern "C" void m8512 (); extern "C" void m8513 (); extern "C" void m8514 (); extern "C" void m4926 (); extern "C" void m8515 (); extern "C" void m8516 (); extern "C" void m8517 (); extern "C" void m8518 (); extern "C" void m8519 (); extern "C" void m8520 (); extern "C" void m8521 (); extern "C" void m3920 (); extern "C" void m8522 (); extern "C" void m8523 (); extern "C" void m8524 (); extern "C" void m8525 (); extern "C" void m8526 (); extern "C" void m8527 (); extern "C" void m8528 (); extern "C" void m8529 (); extern "C" void m8530 (); extern "C" void m8531 (); extern "C" void m8532 (); extern "C" void m8533 (); extern "C" void m8534 (); extern "C" void m8535 (); extern "C" void m8536 (); extern "C" void m8537 (); extern "C" void m8538 (); extern "C" void m8539 (); extern "C" void m8540 (); extern "C" void m3905 (); extern "C" void m8541 (); extern "C" void m8542 (); extern "C" void m8543 (); extern "C" void m8544 (); extern "C" void m8545 (); extern "C" void m8546 (); extern "C" void m8547 (); extern "C" void m8548 (); extern "C" void m8549 (); extern "C" void m8550 (); extern "C" void m8551 (); extern "C" void m8552 (); extern "C" void m8553 (); extern "C" void m8554 (); extern "C" void m8555 (); extern "C" void m8556 (); extern "C" void m8557 (); extern "C" void m3886 (); extern "C" void m8558 (); extern "C" void m8559 (); extern "C" void m3927 (); extern "C" void m3899 (); extern "C" void m3898 (); extern "C" void m8560 (); extern "C" void m8561 (); extern "C" void m8562 (); extern "C" void m8563 (); extern "C" void m8564 (); extern "C" void m2970 (); extern "C" void m8565 (); extern "C" void m8566 (); extern "C" void m8567 (); extern "C" void m8568 (); extern "C" void m8569 (); extern "C" void m3940 (); extern "C" void m8570 (); extern "C" void m8571 (); extern "C" void m8572 (); extern "C" void m8573 (); extern "C" void m8574 (); extern "C" void m8575 (); extern "C" void m8576 (); extern "C" void m8577 (); extern "C" void m8578 (); extern "C" void m8579 (); extern "C" void m8580 (); extern "C" void m8581 (); extern "C" void m8582 (); extern "C" void m3913 (); extern "C" void m8583 (); extern "C" void m8584 (); extern "C" void m8585 (); extern "C" void m8586 (); extern "C" void m8587 (); extern "C" void m8588 (); extern "C" void m8589 (); extern "C" void m8590 (); extern "C" void m8591 (); extern "C" void m8592 (); extern "C" void m8593 (); extern "C" void m8594 (); extern "C" void m3943 (); extern "C" void m8595 (); extern "C" void m8596 (); extern "C" void m8597 (); extern "C" void m8598 (); extern "C" void m8599 (); extern "C" void m8600 (); extern "C" void m8601 (); extern "C" void m8602 (); extern "C" void m8603 (); extern "C" void m8604 (); extern "C" void m8605 (); extern "C" void m8606 (); extern "C" void m8607 (); extern "C" void m8608 (); extern "C" void m8609 (); extern "C" void m8610 (); extern "C" void m8611 (); extern "C" void m8612 (); extern "C" void m8613 (); extern "C" void m8614 (); extern "C" void m8615 (); extern "C" void m8616 (); extern "C" void m8617 (); extern "C" void m8618 (); extern "C" void m8619 (); extern "C" void m8620 (); extern "C" void m8621 (); extern "C" void m8622 (); extern "C" void m8623 (); extern "C" void m8624 (); extern "C" void m8625 (); extern "C" void m8626 (); extern "C" void m8627 (); extern "C" void m8628 (); extern "C" void m8629 (); extern "C" void m8630 (); extern "C" void m8631 (); extern "C" void m8632 (); extern "C" void m8633 (); extern "C" void m8634 (); extern "C" void m8635 (); extern "C" void m8636 (); extern "C" void m8637 (); extern "C" void m8638 (); extern "C" void m8639 (); extern "C" void m8640 (); extern "C" void m8641 (); extern "C" void m8642 (); extern "C" void m3894 (); extern "C" void m3889 (); extern "C" void m8643 (); extern "C" void m8644 (); extern "C" void m8645 (); extern "C" void m8646 (); extern "C" void m8647 (); extern "C" void m3892 (); extern "C" void m3916 (); extern "C" void m8648 (); extern "C" void m8649 (); extern "C" void m8650 (); extern "C" void m8651 (); extern "C" void m4925 (); extern "C" void m8652 (); extern "C" void m8653 (); extern "C" void m8654 (); extern "C" void m8655 (); extern "C" void m8656 (); extern "C" void m8657 (); extern "C" void m3991 (); extern "C" void m8658 (); extern "C" void m8659 (); extern "C" void m8660 (); extern "C" void m3921 (); extern "C" void m8661 (); extern "C" void m8662 (); extern "C" void m8663 (); extern "C" void m8664 (); extern "C" void m8665 (); extern "C" void m8666 (); extern "C" void m8667 (); extern "C" void m8668 (); extern "C" void m2958 (); extern "C" void m8669 (); extern "C" void m8670 (); extern "C" void m3945 (); extern "C" void m8671 (); extern "C" void m8672 (); extern "C" void m8673 (); extern "C" void m8674 (); extern "C" void m8675 (); extern "C" void m8676 (); extern "C" void m8677 (); extern "C" void m8678 (); extern "C" void m8679 (); extern "C" void m8680 (); extern "C" void m8681 (); extern "C" void m8682 (); extern "C" void m8683 (); extern "C" void m8684 (); extern "C" void m8685 (); extern "C" void m8686 (); extern "C" void m8687 (); extern "C" void m8688 (); extern "C" void m8689 (); extern "C" void m8690 (); extern "C" void m8691 (); extern "C" void m8692 (); extern "C" void m8693 (); extern "C" void m3914 (); extern "C" void m8694 (); extern "C" void m8695 (); extern "C" void m8696 (); extern "C" void m8697 (); extern "C" void m8698 (); extern "C" void m8699 (); extern "C" void m8700 (); extern "C" void m8701 (); extern "C" void m8702 (); extern "C" void m8703 (); extern "C" void m8704 (); extern "C" void m8705 (); extern "C" void m8706 (); extern "C" void m8707 (); extern "C" void m8708 (); extern "C" void m8709 (); extern "C" void m8710 (); extern "C" void m8711 (); extern "C" void m8712 (); extern "C" void m8713 (); extern "C" void m8714 (); extern "C" void m3915 (); extern "C" void m8715 (); extern "C" void m8716 (); extern "C" void m8717 (); extern "C" void m8718 (); extern "C" void m8719 (); extern "C" void m8720 (); extern "C" void m8721 (); extern "C" void m8722 (); extern "C" void m8723 (); extern "C" void m8724 (); extern "C" void m8725 (); extern "C" void m8726 (); extern "C" void m8727 (); extern "C" void m8728 (); extern "C" void m8729 (); extern "C" void m8730 (); extern "C" void m8731 (); extern "C" void m8732 (); extern "C" void m8733 (); extern "C" void m8734 (); extern "C" void m8735 (); extern "C" void m8736 (); extern "C" void m8737 (); extern "C" void m8738 (); extern "C" void m8739 (); extern "C" void m8740 (); extern "C" void m8741 (); extern "C" void m8742 (); extern "C" void m8743 (); extern "C" void m8744 (); extern "C" void m8745 (); extern "C" void m8746 (); extern "C" void m8747 (); extern "C" void m8748 (); extern "C" void m8749 (); extern "C" void m8750 (); extern "C" void m8751 (); extern "C" void m8752 (); extern "C" void m8753 (); extern "C" void m8754 (); extern "C" void m8755 (); extern "C" void m8756 (); extern "C" void m8757 (); extern "C" void m8758 (); extern "C" void m8759 (); extern "C" void m8760 (); extern "C" void m8761 (); extern "C" void m2969 (); extern "C" void m8762 (); extern "C" void m3884 (); extern "C" void m3904 (); extern "C" void m2977 (); extern "C" void m8763 (); extern "C" void m8764 (); extern "C" void m8765 (); extern "C" void m2971 (); extern "C" void m2972 (); extern "C" void m2973 (); extern "C" void m2974 (); extern "C" void m2975 (); extern "C" void m2976 (); extern "C" void m8766 (); extern "C" void m8767 (); extern "C" void m8768 (); extern "C" void m8769 (); extern "C" void m8770 (); extern "C" void m8771 (); extern "C" void m8772 (); extern "C" void m3903 (); extern "C" void m8773 (); extern "C" void m8774 (); extern "C" void m8775 (); extern "C" void m8776 (); extern "C" void m8777 (); extern "C" void m8778 (); extern "C" void m8779 (); extern "C" void m8780 (); extern "C" void m8781 (); extern "C" void m8782 (); extern "C" void m8783 (); extern "C" void m8784 (); extern "C" void m8785 (); extern "C" void m8786 (); extern "C" void m3944 (); extern "C" void m8787 (); extern "C" void m8788 (); extern "C" void m8789 (); extern "C" void m8790 (); extern "C" void m8791 (); extern "C" void m8792 (); extern "C" void m8793 (); extern "C" void m8794 (); extern "C" void m8795 (); extern "C" void m8796 (); extern "C" void m8797 (); extern "C" void m8798 (); extern "C" void m8799 (); extern "C" void m8800 (); extern "C" void m8801 (); extern "C" void m8802 (); extern "C" void m8803 (); extern "C" void m8804 (); extern "C" void m8805 (); extern "C" void m8806 (); extern "C" void m8807 (); extern "C" void m8808 (); extern "C" void m8809 (); extern "C" void m8810 (); extern "C" void m8811 (); extern "C" void m8812 (); extern "C" void m8813 (); extern "C" void m8814 (); extern "C" void m8815 (); extern "C" void m8816 (); extern "C" void m8817 (); extern "C" void m8818 (); extern "C" void m8819 (); extern "C" void m8820 (); extern "C" void m8821 (); extern "C" void m8822 (); extern "C" void m8823 (); extern "C" void m8824 (); extern "C" void m8825 (); extern "C" void m8826 (); extern "C" void m8827 (); extern "C" void m8828 (); extern "C" void m8829 (); extern "C" void m8830 (); extern "C" void m8831 (); extern "C" void m8832 (); extern "C" void m8833 (); extern "C" void m8834 (); extern "C" void m8835 (); extern "C" void m8836 (); extern "C" void m8837 (); extern "C" void m8838 (); extern "C" void m8839 (); extern "C" void m8840 (); extern "C" void m8841 (); extern "C" void m8842 (); extern "C" void m8843 (); extern "C" void m8844 (); extern "C" void m8845 (); extern "C" void m8846 (); extern "C" void m8847 (); extern "C" void m8848 (); extern "C" void m8849 (); extern "C" void m8850 (); extern "C" void m8851 (); extern "C" void m8852 (); extern "C" void m8853 (); extern "C" void m8854 (); extern "C" void m8855 (); extern "C" void m8856 (); extern "C" void m8857 (); extern "C" void m8858 (); extern "C" void m8859 (); extern "C" void m8860 (); extern "C" void m8861 (); extern "C" void m8862 (); extern "C" void m8863 (); extern "C" void m8864 (); extern "C" void m8865 (); extern "C" void m8866 (); extern "C" void m8867 (); extern "C" void m8868 (); extern "C" void m8869 (); extern "C" void m8870 (); extern "C" void m8871 (); extern "C" void m8872 (); extern "C" void m8873 (); extern "C" void m8874 (); extern "C" void m8875 (); extern "C" void m8876 (); extern "C" void m8877 (); extern "C" void m8878 (); extern "C" void m8879 (); extern "C" void m8880 (); extern "C" void m8881 (); extern "C" void m8882 (); extern "C" void m8883 (); extern "C" void m8884 (); extern "C" void m8885 (); extern "C" void m8886 (); extern "C" void m8887 (); extern "C" void m8888 (); extern "C" void m8889 (); extern "C" void m8890 (); extern "C" void m8891 (); extern "C" void m8892 (); extern "C" void m8893 (); extern "C" void m8894 (); extern "C" void m8895 (); extern "C" void m8896 (); extern "C" void m8897 (); extern "C" void m8898 (); extern "C" void m8899 (); extern "C" void m8900 (); extern "C" void m8901 (); extern "C" void m8902 (); extern "C" void m8903 (); extern "C" void m8904 (); extern "C" void m8905 (); extern "C" void m8906 (); extern "C" void m8907 (); extern "C" void m8908 (); extern "C" void m8909 (); extern "C" void m8910 (); extern "C" void m8911 (); extern "C" void m8912 (); extern "C" void m8913 (); extern "C" void m8914 (); extern "C" void m8915 (); extern "C" void m8916 (); extern "C" void m8917 (); extern "C" void m8918 (); extern "C" void m8919 (); extern "C" void m8920 (); extern "C" void m8921 (); extern "C" void m8922 (); extern "C" void m8923 (); extern "C" void m8924 (); extern "C" void m8925 (); extern "C" void m8926 (); extern "C" void m8927 (); extern "C" void m8928 (); extern "C" void m8929 (); extern "C" void m8930 (); extern "C" void m8931 (); extern "C" void m8932 (); extern "C" void m8933 (); extern "C" void m8934 (); extern "C" void m8935 (); extern "C" void m8936 (); extern "C" void m8937 (); extern "C" void m8938 (); extern "C" void m8939 (); extern "C" void m8940 (); extern "C" void m8941 (); extern "C" void m8942 (); extern "C" void m8943 (); extern "C" void m8944 (); extern "C" void m8945 (); extern "C" void m8946 (); extern "C" void m8947 (); extern "C" void m8948 (); extern "C" void m8949 (); extern "C" void m8950 (); extern "C" void m8951 (); extern "C" void m8952 (); extern "C" void m8953 (); extern "C" void m8954 (); extern "C" void m8955 (); extern "C" void m8956 (); extern "C" void m8957 (); extern "C" void m8958 (); extern "C" void m8959 (); extern "C" void m8960 (); extern "C" void m8961 (); extern "C" void m8962 (); extern "C" void m8963 (); extern "C" void m8964 (); extern "C" void m8965 (); extern "C" void m8966 (); extern "C" void m8967 (); extern "C" void m8968 (); extern "C" void m8969 (); extern "C" void m8970 (); extern "C" void m8971 (); extern "C" void m8972 (); extern "C" void m8973 (); extern "C" void m8974 (); extern "C" void m8975 (); extern "C" void m8976 (); extern "C" void m8977 (); extern "C" void m8978 (); extern "C" void m8979 (); extern "C" void m8980 (); extern "C" void m8981 (); extern "C" void m8982 (); extern "C" void m8983 (); extern "C" void m8984 (); extern "C" void m8985 (); extern "C" void m8986 (); extern "C" void m8987 (); extern "C" void m8988 (); extern "C" void m8989 (); extern "C" void m8990 (); extern "C" void m8991 (); extern "C" void m8992 (); extern "C" void m8993 (); extern "C" void m8994 (); extern "C" void m8995 (); extern "C" void m8996 (); extern "C" void m8997 (); extern "C" void m8998 (); extern "C" void m8999 (); extern "C" void m9000 (); extern "C" void m9001 (); extern "C" void m9002 (); extern "C" void m9003 (); extern "C" void m9004 (); extern "C" void m9005 (); extern "C" void m9006 (); extern "C" void m3881 (); extern "C" void m3900 (); extern "C" void m9007 (); extern "C" void m9008 (); extern "C" void m9009 (); extern "C" void m3907 (); extern "C" void m3908 (); extern "C" void m9010 (); extern "C" void m9011 (); extern "C" void m9012 (); extern "C" void m9013 (); extern "C" void m9014 (); extern "C" void m9015 (); extern "C" void m9016 (); extern "C" void m9017 (); extern "C" void m9018 (); extern "C" void m9019 (); extern "C" void m9020 (); extern "C" void m9021 (); extern "C" void m9022 (); extern "C" void m9023 (); extern "C" void m9024 (); extern "C" void m9025 (); extern "C" void m9026 (); extern "C" void m9027 (); extern "C" void m9028 (); extern "C" void m9029 (); extern "C" void m9030 (); extern "C" void m9031 (); extern "C" void m1468 (); extern "C" void m2872 (); extern "C" void m1533 (); extern "C" void m4901 (); extern "C" void m9032 (); extern "C" void m9033 (); extern "C" void m9034 (); extern "C" void m9035 (); extern "C" void m3938 (); extern "C" void m4973 (); extern "C" void m9036 (); extern "C" void m9037 (); extern "C" void m1472 (); extern "C" void m9038 (); extern "C" void m9039 (); extern "C" void m9040 (); extern "C" void m9041 (); extern "C" void m2875 (); extern "C" void m4931 (); extern "C" void m4914 (); extern "C" void m4902 (); extern "C" void m3906 (); extern "C" void m9042 (); extern "C" void m9043 (); extern "C" void m4948 (); extern "C" void m1471 (); extern "C" void m1470 (); extern "C" void m3874 (); extern "C" void m9044 (); extern "C" void m3873 (); extern "C" void m3872 (); extern "C" void m4940 (); extern "C" void m9045 (); extern "C" void m9046 (); extern "C" void m9047 (); extern "C" void m9048 (); extern "C" void m9049 (); extern "C" void m9050 (); extern "C" void m9051 (); extern "C" void m9052 (); extern "C" void m9053 (); extern "C" void m9054 (); extern "C" void m9055 (); extern "C" void m9056 (); extern "C" void m9057 (); extern "C" void m9058 (); extern "C" void m9059 (); extern "C" void m9060 (); extern "C" void m9061 (); extern "C" void m9062 (); extern "C" void m9063 (); extern "C" void m9064 (); extern "C" void m9065 (); extern "C" void m9066 (); extern "C" void m9067 (); extern "C" void m9068 (); extern "C" void m9069 (); extern "C" void m9070 (); extern "C" void m9071 (); extern "C" void m9072 (); extern "C" void m9073 (); extern "C" void m9074 (); extern "C" void m9075 (); extern "C" void m9076 (); extern "C" void m9077 (); extern "C" void m9078 (); extern "C" void m9079 (); extern "C" void m9080 (); extern "C" void m9081 (); extern "C" void m9082 (); extern "C" void m9083 (); extern "C" void m9084 (); extern "C" void m9085 (); extern "C" void m9086 (); extern "C" void m9087 (); extern "C" void m9088 (); extern "C" void m9089 (); extern "C" void m9090 (); extern "C" void m9091 (); extern "C" void m9092 (); extern "C" void m9093 (); extern "C" void m9094 (); extern "C" void m9095 (); extern "C" void m9096 (); extern "C" void m9097 (); extern "C" void m9098 (); extern "C" void m9099 (); extern "C" void m9100 (); extern "C" void m9101 (); extern "C" void m9102 (); extern "C" void m9103 (); extern "C" void m9104 (); extern "C" void m9105 (); extern "C" void m9106 (); extern "C" void m9107 (); extern "C" void m9108 (); extern "C" void m9109 (); extern "C" void m9110 (); extern "C" void m9111 (); extern "C" void m9112 (); extern "C" void m9113 (); extern "C" void m9114 (); extern "C" void m9115 (); extern "C" void m9116 (); extern "C" void m9117 (); extern "C" void m9118 (); extern "C" void m9119 (); extern "C" void m9120 (); extern "C" void m9121 (); extern "C" void m9122 (); extern "C" void m9123 (); extern "C" void m9124 (); extern "C" void m9125 (); extern "C" void m9126 (); extern "C" void m9127 (); extern "C" void m9128 (); extern "C" void m9129 (); extern "C" void m9130 (); extern "C" void m9131 (); extern "C" void m9132 (); extern "C" void m9133 (); extern "C" void m9134 (); extern "C" void m9135 (); extern "C" void m9136 (); extern "C" void m9137 (); extern "C" void m9138 (); extern "C" void m9139 (); extern "C" void m9140 (); extern "C" void m9141 (); extern "C" void m9142 (); extern "C" void m9143 (); extern "C" void m9144 (); extern "C" void m9145 (); extern "C" void m9146 (); extern "C" void m9147 (); extern "C" void m9148 (); extern "C" void m9149 (); extern "C" void m9150 (); extern "C" void m9151 (); extern "C" void m9152 (); extern "C" void m3973 (); extern "C" void m3971 (); extern "C" void m9153 (); extern "C" void m9154 (); extern "C" void m9155 (); extern "C" void m9156 (); extern "C" void m9157 (); extern "C" void m9158 (); extern "C" void m9159 (); extern "C" void m9160 (); extern "C" void m9161 (); extern "C" void m9162 (); extern "C" void m2850 (); extern "C" void m3970 (); extern "C" void m3954 (); extern "C" void m3956 (); extern "C" void m9163 (); extern "C" void m9164 (); extern "C" void m9165 (); extern "C" void m9166 (); extern "C" void m9167 (); extern "C" void m9168 (); extern "C" void m9169 (); extern "C" void m9170 (); extern "C" void m9171 (); extern "C" void m9172 (); extern "C" void m9173 (); extern "C" void m9174 (); extern "C" void m9175 (); extern "C" void m9176 (); extern "C" void m9177 (); extern "C" void m9178 (); extern "C" void m9179 (); extern "C" void m9180 (); extern "C" void m9181 (); extern "C" void m9182 (); extern "C" void m9183 (); extern "C" void m9184 (); extern "C" void m9185 (); extern "C" void m9186 (); extern "C" void m9187 (); extern "C" void m9188 (); extern "C" void m9189 (); extern "C" void m9190 (); extern "C" void m9191 (); extern "C" void m9192 (); extern "C" void m9193 (); extern "C" void m9194 (); extern "C" void m9195 (); extern "C" void m9196 (); extern "C" void m9197 (); extern "C" void m9198 (); extern "C" void m9199 (); extern "C" void m9200 (); extern "C" void m9201 (); extern "C" void m9202 (); extern "C" void m9203 (); extern "C" void m9204 (); extern "C" void m9205 (); extern "C" void m9206 (); extern "C" void m9207 (); extern "C" void m9208 (); extern "C" void m9209 (); extern "C" void m9210 (); extern "C" void m9211 (); extern "C" void m9212 (); extern "C" void m9213 (); extern "C" void m9214 (); extern "C" void m9215 (); extern "C" void m9216 (); extern "C" void m9217 (); extern "C" void m9218 (); extern "C" void m9219 (); extern "C" void m9220 (); extern "C" void m9221 (); extern "C" void m9222 (); extern "C" void m9223 (); extern "C" void m9224 (); extern "C" void m9225 (); extern "C" void m9226 (); extern "C" void m9227 (); extern "C" void m9228 (); extern "C" void m9229 (); extern "C" void m9230 (); extern "C" void m9231 (); extern "C" void m9232 (); extern "C" void m9233 (); extern "C" void m9234 (); extern "C" void m9235 (); extern "C" void m9236 (); extern "C" void m9237 (); extern "C" void m9238 (); extern "C" void m9239 (); extern "C" void m9240 (); extern "C" void m9241 (); extern "C" void m9242 (); extern "C" void m9243 (); extern "C" void m9244 (); extern "C" void m9245 (); extern "C" void m9246 (); extern "C" void m9247 (); extern "C" void m9248 (); extern "C" void m9249 (); extern "C" void m9250 (); extern "C" void m9251 (); extern "C" void m9252 (); extern "C" void m4924 (); extern "C" void m9253 (); extern "C" void m9254 (); extern "C" void m9255 (); extern "C" void m9256 (); extern "C" void m9257 (); extern "C" void m9258 (); extern "C" void m9259 (); extern "C" void m9260 (); extern "C" void m9261 (); extern "C" void m9262 (); extern "C" void m9263 (); extern "C" void m9264 (); extern "C" void m9265 (); extern "C" void m9266 (); extern "C" void m9267 (); extern "C" void m9268 (); extern "C" void m9269 (); extern "C" void m9270 (); extern "C" void m9271 (); extern "C" void m9272 (); extern "C" void m9273 (); extern "C" void m9274 (); extern "C" void m9275 (); extern "C" void m2010 (); extern "C" void m4943 (); extern "C" void m2966 (); extern "C" void m9276 (); extern "C" void m9277 (); extern "C" void m9278 (); extern "C" void m9279 (); extern "C" void m9280 (); extern "C" void m9281 (); extern "C" void m2890 (); extern "C" void m4889 (); extern "C" void m9282 (); extern "C" void m4947 (); extern "C" void m3867 (); extern "C" void m2965 (); extern "C" void m9283 (); extern "C" void m9284 (); extern "C" void m9285 (); extern "C" void m9286 (); extern "C" void m9287 (); extern "C" void m3866 (); extern "C" void m9288 (); extern "C" void m9289 (); extern "C" void m9290 (); extern "C" void m9291 (); extern "C" void m9292 (); extern "C" void m9293 (); extern "C" void m9294 (); extern "C" void m9295 (); extern "C" void m9296 (); extern "C" void m9297 (); extern "C" void m9298 (); extern "C" void m9299 (); extern "C" void m3955 (); extern "C" void m9300 (); extern "C" void m9301 (); extern "C" void m2961 (); extern "C" void m9302 (); extern "C" void m9303 (); extern "C" void m9304 (); extern "C" void m9305 (); extern "C" void m9306 (); extern "C" void m9307 (); extern "C" void m9308 (); extern "C" void m9309 (); extern "C" void m9310 (); extern "C" void m9311 (); extern "C" void m9312 (); extern "C" void m4965 (); extern "C" void m9313 (); extern "C" void m9314 (); extern "C" void m9315 (); extern "C" void m9316 (); extern "C" void m9317 (); extern "C" void m9318 (); extern "C" void m9319 (); extern "C" void m3923 (); extern "C" void m3897 (); extern "C" void m9320 (); extern "C" void m9321 (); extern "C" void m9322 (); extern "C" void m9323 (); extern "C" void m9324 (); extern "C" void m9325 (); extern "C" void m9326 (); extern "C" void m9327 (); extern "C" void m9328 (); extern "C" void m9329 (); extern "C" void m9330 (); extern "C" void m9331 (); extern "C" void m9332 (); extern "C" void m9333 (); extern "C" void m9334 (); extern "C" void m9335 (); extern "C" void m9336 (); extern "C" void m9337 (); extern "C" void m9338 (); extern "C" void m9339 (); extern "C" void m9340 (); extern "C" void m9341 (); extern "C" void m9342 (); extern "C" void m9343 (); extern "C" void m9344 (); extern "C" void m9345 (); extern "C" void m9346 (); extern "C" void m9347 (); extern "C" void m9348 (); extern "C" void m9349 (); extern "C" void m3928 (); extern "C" void m9350 (); extern "C" void m9351 (); extern "C" void m9352 (); extern "C" void m9353 (); extern "C" void m9354 (); extern "C" void m9355 (); extern "C" void m9356 (); extern "C" void m9357 (); extern "C" void m9358 (); extern "C" void m9359 (); extern "C" void m9360 (); extern "C" void m9361 (); extern "C" void m9362 (); extern "C" void m9363 (); extern "C" void m9364 (); extern "C" void m9365 (); extern "C" void m9366 (); extern "C" void m9367 (); extern "C" void m9368 (); extern "C" void m9369 (); extern "C" void m9370 (); extern "C" void m9371 (); extern "C" void m9372 (); extern "C" void m9373 (); extern "C" void m9374 (); extern "C" void m9375 (); extern "C" void m9376 (); extern "C" void m9377 (); extern "C" void m9378 (); extern "C" void m9379 (); extern "C" void m9380 (); extern "C" void m9381 (); extern "C" void m9382 (); extern "C" void m9383 (); extern "C" void m9384 (); extern "C" void m9385 (); extern "C" void m9386 (); extern "C" void m9387 (); extern "C" void m9388 (); extern "C" void m9389 (); extern "C" void m9390 (); extern "C" void m9391 (); extern "C" void m9392 (); extern "C" void m9393 (); extern "C" void m9394 (); extern "C" void m9395 (); extern "C" void m9396 (); extern "C" void m9397 (); extern "C" void m9398 (); extern "C" void m9399 (); extern "C" void m9400 (); extern "C" void m9401 (); extern "C" void m9402 (); extern "C" void m9403 (); extern "C" void m9404 (); extern "C" void m9405 (); extern "C" void m9406 (); extern "C" void m3882 (); extern "C" void m9407 (); extern "C" void m9408 (); extern "C" void m9409 (); extern "C" void m9410 (); extern "C" void m9411 (); extern "C" void m9412 (); extern "C" void m9413 (); extern "C" void m9414 (); extern "C" void m9415 (); extern "C" void m9416 (); extern "C" void m9417 (); extern "C" void m9418 (); extern "C" void m9419 (); extern "C" void m9420 (); extern "C" void m9421 (); extern "C" void m9422 (); extern "C" void m9423 (); extern "C" void m9424 (); extern "C" void m9425 (); extern "C" void m3937 (); extern "C" void m9426 (); extern "C" void m9427 (); extern "C" void m9428 (); extern "C" void m9429 (); extern "C" void m9430 (); extern "C" void m9431 (); extern "C" void m9432 (); extern "C" void m9433 (); extern "C" void m9434 (); extern "C" void m9435 (); extern "C" void m9436 (); extern "C" void m9437 (); extern "C" void m9438 (); extern "C" void m9439 (); extern "C" void m9440 (); extern "C" void m9441 (); extern "C" void m9442 (); extern "C" void m9443 (); extern "C" void m9444 (); extern "C" void m9445 (); extern "C" void m9446 (); extern "C" void m9447 (); extern "C" void m9448 (); extern "C" void m9449 (); extern "C" void m9450 (); extern "C" void m9451 (); extern "C" void m9452 (); extern "C" void m9453 (); extern "C" void m9454 (); extern "C" void m9455 (); extern "C" void m9456 (); extern "C" void m9457 (); extern "C" void m9458 (); extern "C" void m9459 (); extern "C" void m9460 (); extern "C" void m9461 (); extern "C" void m9462 (); extern "C" void m9463 (); extern "C" void m9464 (); extern "C" void m9465 (); extern "C" void m9466 (); extern "C" void m9467 (); extern "C" void m9468 (); extern "C" void m9469 (); extern "C" void m9470 (); extern "C" void m9471 (); extern "C" void m9472 (); extern "C" void m9473 (); extern "C" void m9474 (); extern "C" void m9475 (); extern "C" void m9476 (); extern "C" void m9477 (); extern "C" void m9478 (); extern "C" void m9479 (); extern "C" void m9480 (); extern "C" void m9481 (); extern "C" void m9482 (); extern "C" void m9483 (); extern "C" void m9484 (); extern "C" void m9485 (); extern "C" void m9486 (); extern "C" void m9487 (); extern "C" void m9488 (); extern "C" void m9489 (); extern "C" void m9490 (); extern "C" void m9491 (); extern "C" void m9492 (); extern "C" void m9493 (); extern "C" void m9494 (); extern "C" void m9495 (); extern "C" void m9496 (); extern "C" void m9497 (); extern "C" void m9498 (); extern "C" void m9499 (); extern "C" void m9500 (); extern "C" void m9501 (); extern "C" void m9502 (); extern "C" void m9503 (); extern "C" void m9504 (); extern "C" void m9505 (); extern "C" void m9506 (); extern "C" void m9507 (); extern "C" void m9508 (); extern "C" void m9509 (); extern "C" void m9510 (); extern "C" void m9511 (); extern "C" void m9512 (); extern "C" void m9513 (); extern "C" void m9514 (); extern "C" void m9515 (); extern "C" void m9516 (); extern "C" void m9517 (); extern "C" void m9518 (); extern "C" void m9519 (); extern "C" void m9520 (); extern "C" void m9521 (); extern "C" void m9522 (); extern "C" void m9523 (); extern "C" void m9524 (); extern "C" void m9525 (); extern "C" void m9526 (); extern "C" void m9527 (); extern "C" void m9528 (); extern "C" void m9529 (); extern "C" void m9530 (); extern "C" void m9531 (); extern "C" void m9532 (); extern "C" void m9533 (); extern "C" void m9534 (); extern "C" void m9535 (); extern "C" void m9536 (); extern "C" void m9537 (); extern "C" void m9538 (); extern "C" void m9539 (); extern "C" void m9540 (); extern "C" void m9541 (); extern "C" void m9542 (); extern "C" void m9543 (); extern "C" void m9544 (); extern "C" void m9545 (); extern "C" void m9546 (); extern "C" void m9547 (); extern "C" void m9548 (); extern "C" void m9549 (); extern "C" void m9550 (); extern "C" void m9551 (); extern "C" void m9552 (); extern "C" void m9553 (); extern "C" void m9554 (); extern "C" void m9555 (); extern "C" void m9556 (); extern "C" void m9557 (); extern "C" void m9558 (); extern "C" void m9559 (); extern "C" void m9560 (); extern "C" void m9561 (); extern "C" void m9562 (); extern "C" void m9563 (); extern "C" void m9564 (); extern "C" void m9565 (); extern "C" void m9566 (); extern "C" void m9567 (); extern "C" void m9568 (); extern "C" void m9569 (); extern "C" void m4915 (); extern "C" void m3957 (); extern "C" void m9570 (); extern "C" void m3917 (); extern "C" void m9571 (); extern "C" void m9572 (); extern "C" void m9573 (); extern "C" void m9574 (); extern "C" void m4916 (); extern "C" void m3952 (); extern "C" void m9575 (); extern "C" void m9576 (); extern "C" void m9577 (); extern "C" void m9578 (); extern "C" void m9579 (); extern "C" void m9580 (); extern "C" void m9581 (); extern "C" void m9582 (); extern "C" void m9583 (); extern "C" void m9584 (); extern "C" void m9585 (); extern "C" void m9586 (); extern "C" void m9587 (); extern "C" void m9588 (); extern "C" void m9589 (); extern "C" void m9590 (); extern "C" void m9591 (); extern "C" void m9592 (); extern "C" void m9593 (); extern "C" void m9594 (); extern "C" void m9595 (); extern "C" void m9596 (); extern "C" void m9597 (); extern "C" void m3883 (); extern "C" void m9598 (); extern "C" void m9599 (); extern "C" void m9600 (); extern "C" void m9601 (); extern "C" void m9602 (); extern "C" void m9603 (); extern "C" void m9604 (); extern "C" void m4933 (); extern "C" void m9605 (); extern "C" void m9606 (); extern "C" void m9607 (); extern "C" void m3918 (); extern "C" void m4917 (); extern "C" void m9608 (); extern "C" void m4942 (); extern "C" void m3919 (); extern "C" void m9609 (); extern "C" void m9610 (); extern "C" void m9611 (); extern "C" void m9612 (); extern "C" void m9613 (); extern "C" void m9614 (); extern "C" void m9615 (); extern "C" void m9616 (); extern "C" void m9617 (); extern "C" void m9618 (); extern "C" void m9619 (); extern "C" void m9620 (); extern "C" void m9621 (); extern "C" void m9622 (); extern "C" void m9623 (); extern "C" void m9624 (); extern "C" void m9625 (); extern "C" void m9626 (); extern "C" void m9627 (); extern "C" void m9628 (); extern "C" void m9629 (); extern "C" void m9630 (); extern "C" void m9631 (); extern "C" void m9632 (); extern "C" void m9633 (); extern "C" void m9634 (); extern "C" void m9635 (); extern "C" void m9636 (); extern "C" void m9637 (); extern "C" void m9638 (); extern "C" void m9639 (); extern "C" void m9640 (); extern "C" void m9641 (); extern "C" void m9642 (); extern "C" void m9643 (); extern "C" void m9644 (); extern "C" void m9645 (); extern "C" void m9646 (); extern "C" void m9647 (); extern "C" void m9648 (); extern "C" void m9649 (); extern "C" void m9650 (); extern "C" void m9651 (); extern "C" void m9652 (); extern "C" void m9653 (); extern "C" void m9654 (); extern "C" void m9655 (); extern "C" void m9656 (); extern "C" void m9657 (); extern "C" void m9658 (); extern "C" void m9659 (); extern "C" void m9660 (); extern "C" void m9661 (); extern "C" void m9662 (); extern "C" void m9663 (); extern "C" void m3871 (); extern "C" void m9664 (); extern "C" void m9665 (); extern "C" void m9666 (); extern "C" void m9667 (); extern "C" void m3950 (); extern "C" void m9668 (); extern "C" void m3934 (); extern "C" void m9669 (); extern "C" void m9670 (); extern "C" void m9671 (); extern "C" void m9672 (); extern "C" void m9673 (); extern "C" void m9674 (); extern "C" void m9675 (); extern "C" void m9676 (); extern "C" void m9677 (); extern "C" void m9678 (); extern "C" void m9679 (); extern "C" void m9680 (); extern "C" void m9681 (); extern "C" void m9682 (); extern "C" void m3877 (); extern "C" void m4975 (); extern "C" void m2962 (); extern "C" void m9683 (); extern "C" void m9684 (); extern "C" void m9685 (); extern "C" void m9686 (); extern "C" void m9687 (); extern "C" void m9688 (); extern "C" void m9689 (); extern "C" void m9690 (); extern "C" void m9691 (); extern "C" void m9692 (); extern "C" void m9693 (); extern "C" void m9694 (); extern "C" void m9695 (); extern "C" void m9696 (); extern "C" void m9697 (); extern "C" void m9698 (); extern "C" void m9699 (); extern "C" void m9700 (); extern "C" void m9701 (); extern "C" void m9702 (); extern "C" void m9703 (); extern "C" void m9704 (); extern "C" void m2848 (); extern "C" void m9705 (); extern "C" void m9706 (); extern "C" void m9707 (); extern "C" void m9708 (); extern "C" void m4892 (); extern "C" void m3947 (); extern "C" void m9709 (); extern "C" void m9710 (); extern "C" void m9711 (); extern "C" void m9712 (); extern "C" void m9713 (); extern "C" void m9714 (); extern "C" void m9715 (); extern "C" void m9716 (); extern "C" void m9717 (); extern "C" void m9718 (); extern "C" void m2851 (); extern "C" void m2861 (); extern "C" void m2960 (); extern "C" void m9719 (); extern "C" void m9720 (); extern "C" void m9721 (); extern "C" void m9722 (); extern "C" void m9723 (); extern "C" void m9724 (); extern "C" void m9725 (); extern "C" void m9726 (); extern "C" void m9727 (); extern "C" void m9728 (); extern "C" void m9729 (); extern "C" void m9730 (); extern "C" void m9731 (); extern "C" void m9732 (); extern "C" void m9733 (); extern "C" void m9734 (); extern "C" void m9735 (); extern "C" void m9736 (); extern "C" void m9737 (); extern "C" void m9738 (); extern "C" void m9739 (); extern "C" void m9740 (); extern "C" void m9741 (); extern "C" void m9742 (); extern "C" void m9743 (); extern "C" void m9744 (); extern "C" void m9745 (); extern "C" void m9746 (); extern "C" void m9747 (); extern "C" void m9748 (); extern "C" void m9749 (); extern "C" void m9750 (); extern "C" void m9751 (); extern "C" void m9752 (); extern "C" void m9753 (); extern "C" void m9754 (); extern "C" void m9755 (); extern "C" void m9756 (); extern "C" void m9757 (); extern "C" void m9758 (); extern "C" void m9759 (); extern "C" void m9760 (); extern "C" void m9761 (); extern "C" void m9762 (); extern "C" void m9763 (); extern "C" void m9764 (); extern "C" void m9765 (); extern "C" void m9766 (); extern "C" void m9767 (); extern "C" void m9768 (); extern "C" void m9769 (); extern "C" void m9770 (); extern "C" void m9771 (); extern "C" void m9772 (); extern "C" void m9773 (); extern "C" void m9774 (); extern "C" void m9775 (); extern "C" void m9776 (); extern "C" void m9777 (); extern "C" void m9778 (); extern "C" void m9779 (); extern "C" void m9780 (); extern "C" void m9781 (); extern "C" void m9782 (); extern "C" void m9783 (); extern "C" void m9784 (); extern "C" void m9785 (); extern "C" void m9786 (); extern "C" void m9787 (); extern "C" void m9788 (); extern "C" void m9789 (); extern "C" void m9790 (); extern "C" void m9791 (); extern "C" void m9792 (); extern "C" void m9793 (); extern "C" void m9794 (); extern "C" void m9795 (); extern "C" void m9796 (); extern "C" void m9797 (); extern "C" void m9798 (); extern "C" void m9799 (); extern "C" void m9800 (); extern "C" void m9801 (); extern "C" void m9802 (); extern "C" void m9803 (); extern "C" void m9804 (); extern "C" void m9805 (); extern "C" void m9806 (); extern "C" void m9807 (); extern "C" void m9808 (); extern "C" void m9809 (); extern "C" void m9810 (); extern "C" void m9811 (); extern "C" void m9812 (); extern "C" void m9813 (); extern "C" void m9814 (); extern "C" void m9815 (); extern "C" void m9816 (); extern "C" void m9817 (); extern "C" void m9818 (); extern "C" void m9819 (); extern "C" void m9820 (); extern "C" void m2964 (); extern "C" void m9821 (); extern "C" void m1600 (); extern "C" void m3868 (); extern "C" void m9822 (); extern "C" void m9823 (); extern "C" void m2841 (); extern "C" void m9824 (); extern "C" void m9825 (); extern "C" void m9826 (); extern "C" void m9827 (); extern "C" void m9828 (); extern "C" void m9829 (); extern "C" void m9830 (); extern "C" void m9831 (); extern "C" void m9832 (); extern "C" void m9833 (); extern "C" void m9834 (); extern "C" void m9835 (); extern "C" void m9836 (); extern "C" void m9837 (); extern "C" void m9838 (); extern "C" void m9839 (); extern "C" void m9840 (); extern "C" void m9841 (); extern "C" void m9842 (); extern "C" void m9843 (); extern "C" void m9844 (); extern "C" void m9845 (); extern "C" void m9846 (); extern "C" void m9847 (); extern "C" void m9848 (); extern "C" void m9849 (); extern "C" void m9850 (); extern "C" void m9851 (); extern "C" void m9852 (); extern "C" void m9853 (); extern "C" void m9854 (); extern "C" void m9855 (); extern "C" void m9856 (); extern "C" void m9857 (); extern "C" void m9858 (); extern "C" void m9859 (); extern "C" void m9860 (); extern "C" void m9861 (); extern "C" void m9862 (); extern "C" void m9863 (); extern "C" void m9864 (); extern "C" void m9865 (); extern "C" void m9866 (); extern "C" void m9867 (); extern "C" void m9868 (); extern "C" void m9869 (); extern "C" void m9870 (); extern "C" void m9871 (); extern "C" void m9872 (); extern "C" void m9873 (); extern "C" void m9874 (); extern "C" void m9875 (); extern "C" void m9876 (); extern "C" void m9877 (); extern "C" void m9878 (); extern "C" void m9879 (); extern "C" void m9880 (); extern "C" void m9881 (); extern "C" void m9882 (); extern "C" void m9883 (); extern "C" void m9884 (); extern "C" void m9885 (); extern "C" void m9886 (); extern "C" void m9887 (); extern "C" void m9888 (); extern "C" void m9889 (); extern "C" void m9890 (); extern "C" void m9891 (); extern "C" void m9892 (); extern "C" void m9893 (); extern "C" void m9894 (); extern "C" void m9895 (); extern "C" void m9896 (); extern "C" void m9897 (); extern "C" void m9898 (); extern "C" void m9899 (); extern "C" void m9900 (); extern "C" void m9901 (); extern "C" void m9902 (); extern "C" void m9903 (); extern "C" void m9904 (); extern "C" void m9905 (); extern "C" void m9906 (); extern "C" void m9907 (); extern "C" void m9908 (); extern "C" void m9909 (); extern "C" void m9910 (); extern "C" void m9911 (); extern "C" void m9912 (); extern "C" void m9913 (); extern "C" void m9914 (); extern "C" void m9915 (); extern "C" void m9916 (); extern "C" void m9917 (); extern "C" void m9918 (); extern "C" void m9919 (); extern "C" void m9920 (); extern "C" void m9921 (); extern "C" void m9922 (); extern "C" void m2967 (); extern "C" void m9923 (); extern "C" void m9924 (); extern "C" void m9925 (); extern "C" void m9926 (); extern "C" void m9927 (); extern "C" void m9928 (); extern "C" void m9929 (); extern "C" void m9930 (); extern "C" void m9931 (); extern "C" void m9932 (); extern "C" void m9933 (); extern "C" void m9934 (); extern "C" void m9935 (); extern "C" void m9936 (); extern "C" void m9937 (); extern "C" void m9938 (); extern "C" void m9939 (); extern "C" void m9940 (); extern "C" void m9941 (); extern "C" void m9942 (); extern "C" void m9943 (); extern "C" void m9944 (); extern "C" void m9945 (); extern "C" void m9946 (); extern "C" void m9947 (); extern "C" void m9948 (); extern "C" void m4920 (); extern "C" void m9949 (); extern "C" void m9950 (); extern "C" void m9951 (); extern "C" void m9952 (); extern "C" void m9953 (); extern "C" void m9954 (); extern "C" void m9955 (); extern "C" void m9956 (); extern "C" void m9957 (); extern "C" void m9958 (); extern "C" void m9959 (); extern "C" void m9960 (); extern "C" void m4949 (); extern "C" void m9961 (); extern "C" void m9962 (); extern "C" void m9963 (); extern "C" void m9964 (); extern "C" void m9965 (); extern "C" void m9966 (); extern "C" void m9967 (); extern "C" void m9968 (); extern "C" void m9969 (); extern "C" void m9970 (); extern "C" void m9971 (); extern "C" void m9972 (); extern "C" void m9973 (); extern "C" void m9974 (); extern "C" void m9975 (); extern "C" void m9976 (); extern "C" void m9977 (); extern "C" void m9978 (); extern "C" void m9979 (); extern "C" void m9980 (); extern "C" void m9981 (); extern "C" void m9982 (); extern "C" void m9983 (); extern "C" void m9984 (); extern "C" void m9985 (); extern "C" void m9986 (); extern "C" void m9987 (); extern "C" void m9988 (); extern "C" void m9989 (); extern "C" void m9990 (); extern "C" void m9991 (); extern "C" void m9992 (); extern "C" void m9993 (); extern "C" void m9994 (); extern "C" void m9995 (); extern "C" void m9996 (); extern "C" void m9997 (); extern "C" void m9998 (); extern "C" void m9999 (); extern "C" void m10000 (); extern "C" void m10001 (); extern "C" void m10002 (); extern "C" void m10003 (); extern "C" void m10004 (); extern "C" void m10005 (); extern "C" void m10006 (); extern "C" void m10007 (); extern "C" void m10008 (); extern "C" void m10009 (); extern "C" void m10010 (); extern "C" void m10011 (); extern "C" void m10012 (); extern "C" void m10013 (); extern "C" void m10014 (); extern "C" void m10015 (); extern "C" void m10016 (); extern "C" void m10017 (); extern "C" void m10018 (); extern "C" void m10019 (); extern "C" void m10020 (); extern "C" void m10021 (); extern "C" void m10022 (); extern "C" void m10023 (); extern "C" void m10024 (); extern "C" void m10025 (); extern "C" void m10026 (); extern "C" void m10027 (); extern "C" void m10028 (); extern "C" void m10029 (); extern "C" void m10030 (); extern "C" void m10031 (); extern "C" void m10032 (); extern "C" void m10033 (); extern "C" void m10034 (); extern "C" void m10035 (); extern "C" void m10036 (); extern "C" void m10037 (); extern "C" void m10038 (); extern "C" void m10039 (); extern "C" void m10040 (); extern "C" void m10041 (); extern "C" void m10042 (); extern "C" void m4907 (); extern "C" void m10043 (); extern "C" void m10044 (); extern "C" void m10045 (); extern "C" void m10046 (); extern "C" void m10047 (); extern "C" void m10048 (); extern "C" void m10049 (); extern "C" void m10050 (); extern "C" void m10051 (); extern "C" void m10052 (); extern "C" void m10053 (); extern "C" void m10054 (); extern "C" void m10055 (); extern "C" void m10056 (); extern "C" void m10057 (); extern "C" void m10058 (); extern "C" void m10059 (); extern "C" void m10060 (); extern "C" void m10061 (); extern "C" void m10062 (); extern "C" void m10063 (); extern "C" void m10064 (); extern "C" void m10065 (); extern "C" void m10066 (); extern "C" void m10067 (); extern "C" void m10068 (); extern "C" void m10069 (); extern "C" void m10070 (); extern "C" void m10071 (); extern "C" void m10072 (); extern "C" void m10073 (); extern "C" void m10074 (); extern "C" void m10075 (); extern "C" void m10076 (); extern "C" void m10077 (); extern "C" void m10078 (); extern "C" void m10079 (); extern "C" void m10080 (); extern "C" void m10081 (); extern "C" void m10082 (); extern "C" void m10083 (); extern "C" void m10084 (); extern "C" void m10085 (); extern "C" void m10086 (); extern "C" void m10087 (); extern "C" void m10088 (); extern "C" void m10089 (); extern "C" void m10090 (); extern "C" void m10091 (); extern "C" void m10092 (); extern "C" void m10093 (); extern "C" void m10094 (); extern "C" void m10095 (); extern "C" void m10096 (); extern "C" void m10097 (); extern "C" void m10098 (); extern "C" void m10099 (); extern "C" void m10100 (); extern "C" void m10101 (); extern "C" void m10102 (); extern "C" void m10103 (); extern "C" void m10104 (); extern "C" void m10105 (); extern "C" void m10106 (); extern "C" void m10107 (); extern "C" void m10108 (); extern "C" void m10109 (); extern "C" void m10110 (); extern "C" void m10111 (); extern "C" void m10112 (); extern "C" void m10113 (); extern "C" void m10114 (); extern "C" void m10115 (); extern "C" void m10116 (); extern "C" void m10117 (); extern "C" void m10118 (); extern "C" void m10119 (); extern "C" void m10120 (); extern const methodPointerType g_MethodPointers[9837] = { m0, m1, m2, m3, m4, m5, m6, m7, m8, m9, m10, m11, m12, m13, m14, m15, m16, m17, m18, m19, m20, m21, m22, m23, m24, m25, m26, m27, m28, m29, m30, m31, m32, m33, m81, m82, m83, m84, m85, m86, m87, m88, m89, m90, m91, m92, m93, m94, m95, m96, m97, m98, m99, m100, m101, m102, m103, m104, m105, m106, m107, m108, m109, m110, m111, m112, m113, m114, m115, m116, m117, m118, m119, m120, m121, m122, m123, m124, m125, m126, m127, m128, m129, m130, m131, m132, m133, m134, m135, m136, m137, m138, m139, m140, m141, m142, m143, m144, m145, m146, m147, m148, m149, m150, m151, m152, m153, m154, m155, m156, m157, m158, m159, m160, m161, m162, m163, m164, m165, m166, m167, m168, m169, m170, m171, m172, m173, m174, m175, m176, m177, m178, m179, m180, m181, m182, m183, m184, m185, m186, m187, m188, m189, m190, m191, m192, m193, m194, m195, m196, m197, m198, m199, m200, m201, m202, m203, m204, m205, m206, m207, m208, m209, m210, m211, m212, m213, m214, m215, m216, m217, m218, m219, m220, m221, m222, m223, m224, m225, m226, m227, m228, m229, m230, m231, m232, m233, m234, m235, m236, m237, m238, m239, m240, m241, m242, m243, m244, m245, m246, m247, m248, m249, m250, m251, m252, m253, m254, m255, m256, m257, m258, m259, m260, m261, m262, m263, m264, m265, m266, m267, m268, m269, m270, m271, m272, m273, m274, m275, m276, m277, m278, m279, m280, m281, m282, m283, m284, m285, m286, m287, m288, m289, m290, m291, m292, m293, m294, m295, m296, m297, m298, m299, m300, m301, m302, m303, m304, m305, m306, m307, m308, m309, m310, m311, m312, m313, m314, m315, m316, m317, m318, m319, m320, m321, m322, m323, m324, m325, m326, m327, m328, m329, m330, m331, m332, m333, m334, m335, m336, m337, m338, m339, m340, m341, m342, m343, m344, m345, m346, m347, m348, m349, m350, m351, m352, m353, m354, m355, m356, m357, m358, m359, m360, m361, m362, m363, m364, m365, m366, m367, m368, m369, m370, m371, m372, m373, m374, m375, m376, m377, m378, m379, m380, m381, m382, m383, m384, m385, m386, m387, m388, m389, m390, m391, m392, m393, m394, m395, m396, m397, m398, m399, m400, m401, m402, m403, m404, m405, m406, m407, m408, m409, m410, m411, m412, m413, m414, m415, m416, m417, m418, m419, m420, m421, m422, m423, m424, m425, m426, m427, m428, m429, m430, m431, m432, m433, m434, m435, m436, m437, m438, m439, m440, m441, m442, m443, m444, m445, m446, m447, m448, m449, m450, m451, m452, m453, m454, m455, m456, m457, m458, m459, m460, m461, m462, m463, m464, m465, m466, m467, m468, m469, m470, m471, m472, m473, m474, m475, m476, m477, m478, m479, m480, m481, m482, m483, m484, m485, m486, m487, m488, m489, m490, m491, m492, m493, m494, m495, m496, m497, m498, m499, m500, m501, m502, m503, m504, m505, m506, m507, m508, m509, m510, m511, m512, m513, m514, m515, m516, m517, m518, m519, m520, m521, m522, m523, m524, m525, m526, m527, m528, m529, m530, m531, m532, m533, m534, m535, m536, m537, m538, m539, m540, m541, m542, m543, m544, m545, m546, m547, m548, m549, m550, m551, m552, m553, m554, m555, m556, m557, m558, m559, m560, m561, m562, m563, m564, m565, m566, m567, m568, m569, m570, m571, m572, m573, m574, m575, m576, m577, m578, m579, m580, m581, m582, m583, m584, m585, m586, m587, m588, m589, m590, m591, m592, m593, m594, m595, m596, m597, m598, m599, m600, m601, m602, m603, m604, m605, m606, m607, m608, m609, m610, m611, m612, m613, m614, m615, m616, m617, m618, m619, m620, m621, m622, m623, m624, m625, m626, m627, m628, m629, m630, m631, m632, m633, m634, m635, m636, m637, m638, m639, m640, m641, m642, m643, m644, m645, m646, m647, m648, m649, m650, m651, m652, m653, m654, m655, m656, m657, m658, m659, m660, m661, m662, m663, m664, m665, m666, m667, m668, m669, m670, m671, m672, m673, m674, m675, m676, m677, m678, m679, m680, m681, m682, m683, m684, m685, m686, m687, m688, m689, m690, m691, m692, m693, m694, m695, m696, m697, m698, m699, m700, m701, m702, m703, m704, m705, m706, m707, m708, m709, m710, m711, m712, m713, m714, m715, m716, m717, m718, m719, m720, m721, m722, m723, m724, m725, m726, m727, m728, m729, m730, m731, m732, m733, m734, m735, m736, m737, m738, m739, m740, m741, m742, m743, m744, m745, m746, m747, m748, m749, m750, m751, m752, m753, m754, m755, m756, m757, m758, m759, m760, m761, m762, m763, m764, m765, m766, m767, m768, m769, m770, m771, m772, m773, m774, m775, m776, m777, m778, m779, m780, m781, m782, m783, m784, m785, m786, m787, m788, m789, m790, m791, m792, m793, m794, m795, m796, m797, m798, m799, m800, m801, m802, m803, m804, m805, m806, m807, m808, m809, m810, m811, m812, m813, m814, m815, m816, m817, m818, m819, m820, m821, m822, m823, m824, m825, m826, m827, m828, m829, m830, m831, m832, m833, m834, m835, m836, m837, m838, m839, m840, m841, m842, m843, m844, m845, m846, m847, m848, m849, m850, m851, m852, m853, m854, m855, m856, m857, m858, m859, m860, m861, m862, m863, m864, m865, m866, m867, m868, m869, m870, m871, m872, m873, m874, m875, m876, m877, m878, m879, m880, m881, m882, m883, m884, m885, m886, m887, m888, m889, m890, m891, m892, m893, m894, m895, m896, m897, m898, m899, m900, m901, m902, m903, m904, m905, m906, m907, m908, m909, m910, m911, m912, m913, m914, m915, m916, m917, m918, m919, m920, m921, m922, m923, m924, m925, m926, m927, m928, m929, m930, m931, m932, m933, m934, m935, m936, m937, m938, m939, m940, m941, m942, m943, m944, m945, m946, m947, m948, m949, m950, m951, m952, m953, m954, m955, m956, m957, m958, m959, m960, m961, m962, m963, m964, m965, m966, m967, m968, m969, m970, m971, m972, m973, m974, m975, m976, m977, m978, m979, m980, m981, m982, m983, m984, m985, m986, m987, m988, m989, m990, m991, m992, m993, m994, m995, m996, m997, m998, m999, m1000, m1001, m1002, m1003, m1004, m1005, m1006, m1007, m1008, m1009, m1010, m1011, m1012, m1013, m1014, m1015, m1016, m1017, m1018, m1019, m1020, m1021, m1022, m1023, m1024, m1025, m1026, m1027, m1028, m1029, m1030, m1031, m1032, m1033, m1034, m1035, m1036, m1037, m1038, m1039, m1040, m1041, m1042, m1043, m1044, m1045, m1046, m1047, m1048, m1049, m1050, m1051, m1052, m1053, m1054, m1055, m1056, m1057, m1058, m1059, m1060, m1061, m1062, m1063, m1064, m1065, m1066, m1067, m1068, m1069, m1070, m1071, m1072, m1073, m1074, m1075, m1076, m1077, m1078, m1079, m1080, m1081, m1082, m1083, m1084, m1085, m1086, m1087, m1088, m1089, m1090, m1091, m1092, m1093, m1094, m1095, m1096, m1097, m1098, m1099, m1100, m1101, m1102, m1103, m1104, m1105, m1106, m1107, m1108, m1109, m1110, m1111, m1112, m1113, m1114, m1115, m1116, m1117, m1118, m1119, m1120, m1121, m1122, m1123, m1124, m1125, m1126, m1127, m1128, m1129, m1130, m1131, m1132, m1133, m1134, m1135, m1136, m1137, m1138, m1139, m1140, m1141, m1142, m1143, m1144, m1145, m1146, m1147, m1148, m1149, m1150, m1151, m1152, m1153, m1154, m1155, m1156, m1157, m1158, m1159, m1160, m1161, m1162, m1163, m1164, m1165, m1166, m1167, m1168, m1169, m1170, m1171, m1172, m1173, m1174, m1175, m1176, m1177, m1178, m1179, m1180, m1181, m1182, m1183, m1184, m1185, m1186, m1187, m1188, m1189, m1190, m1191, m1192, m1193, m1194, m1195, m1196, m1197, m1198, m1199, m1200, m1201, m1202, m1203, m1204, m1205, m1206, m1207, m1208, m1209, m1210, m1211, m1212, m1213, m1214, m1215, m1216, m1217, m1218, m1219, m1220, m1221, m1222, m1223, m1224, m1225, m1226, m1227, m1228, m1229, m1230, m1231, m1232, m1233, m1234, m1235, m1236, m1237, m1238, m1239, m1240, m1241, m1242, m1243, m1244, m1245, m1246, m1247, m1248, m1249, m1250, m1251, m1252, m1253, m1254, m1255, m1256, m1257, m1258, m1259, m1260, m1261, m1262, m1263, m1264, m1265, m1266, m1267, m1268, m1269, m1270, m1271, m1272, m1273, m1274, m1275, m1276, m1277, m1278, m1279, m1280, m1281, m1282, m1283, m1284, m1285, m1286, m1287, m1288, m1289, m1290, m1291, m1292, m1293, m1294, m1295, m1296, m1297, m1298, m1299, m1300, m1301, m1302, m1303, m1304, m1305, m1306, m1307, m1308, m1309, m1310, m1311, m1312, m1313, m1314, m1315, m1316, m1317, m1318, m1319, m1320, m1321, m1322, m1323, m1324, m1325, m1326, m1327, m1328, m1329, m1330, m1331, m1332, m1333, m1334, m1335, m1336, m1337, m1338, m1339, m1340, m1341, m1342, m1343, m1344, m1345, m1346, m1347, m1348, m1349, m1350, m1351, m1352, m1353, m1354, m1355, m1356, m1357, m1358, m1359, m1360, m1361, m1362, m1363, m1364, m1365, m1366, m1367, m1368, m1369, m1370, m1371, m1372, m1373, m1374, m1375, m1376, m1377, m1378, m1379, m1380, m1381, m1382, m1383, m1384, m1385, m1386, m1387, m1388, m1389, m1390, m1391, m1392, m1393, m1394, m1395, m1396, m1397, m1398, m1399, m1400, m1401, m1402, m1403, m1404, m1405, m1406, m1407, m1408, m1409, m1410, m1411, m1412, m1413, m1414, m1415, m1416, m1417, m1418, m1419, m1420, m1421, m1422, m1423, m1424, m1425, m1426, m1427, m1428, m1429, m1430, m1431, m1432, m1433, m1434, m1435, m1436, m1437, m1438, m1439, m1440, m1441, m1442, m1443, m1444, m1445, m1446, m1447, m1448, m1449, m1450, m1451, m1452, m1453, m1454, m2091, m2092, m2093, m2094, m2095, m2096, m2097, m2098, m2099, m1652, m2100, m1923, m2101, m2102, m2103, m2104, m2105, m2106, m2107, m2108, m1732, m2109, m2110, m2071, m2058, m2072, m2111, m2065, m2075, m2112, m2066, m2076, m2113, m2062, m2064, m2074, m2114, m2060, m2073, m2115, m2078, m2077, m2116, m2068, m2117, m2118, m2119, m2120, m2121, m2122, m2123, m2124, m2125, m2126, m2127, m2128, m2129, m2130, m2131, m2132, m2133, m2134, m2135, m2136, m1577, m1578, m76, m1756, m2022, m2137, m2138, m2139, m2140, m2141, m2142, m1724, m1806, m2143, m2144, m2145, m2146, m2147, m2148, m2149, m2150, m2151, m2152, m2153, m2154, m2155, m2156, m2157, m2158, m2159, m2160, m1898, m1899, m2161, m1818, m1819, m1897, m1817, m1896, m1841, m1837, m1836, m2162, m2163, m2164, m2165, m2166, m1582, m1579, m43, m1799, m1808, m1886, m2167, m2168, m2169, m1547, m1509, m2170, m1504, m1626, m1648, m1641, m50, m1521, m1796, m1849, m2088, m1882, m1523, m1565, m73, m1738, m1936, m1940, m1941, m2171, m2172, m2173, m1965, m2174, m2175, m1764, m1574, m2176, m2177, m1968, m1950, m1951, m1503, m1689, m1762, m2070, m1502, m1972, m1970, m1971, m39, m38, m2006, m2178, m2179, m1878, m1614, m1618, m2180, m2181, m1745, m1591, m1712, m1749, m1696, m1964, m2182, m1612, m2183, m1737, m1613, m2184, m57, m2185, m1966, m2186, m2187, m2188, m2189, m1763, m1880, m1913, m1734, m1792, m1735, m1790, m1797, m1929, m1674, m1676, m1730, m1791, m1680, m1789, m1677, m1813, m1812, m1804, m1805, m2190, m1683, m1908, m2191, m2192, m1922, m1918, m2193, m2194, m2195, m2196, m2197, m2198, m2199, m2200, m2201, m2202, m2203, m2204, m2205, m2206, m2207, m2208, m2209, m2210, m2211, m2212, m1949, m2213, m2214, m2215, m2216, m2217, m2218, m2219, m2220, m2221, m2222, m2223, m2224, m2225, m2226, m2227, m1943, m2228, m2229, m1945, m1947, m1934, m1946, m2230, m2231, m1939, m2232, m1953, m2233, m2234, m1952, m2235, m2236, m2237, m2238, m2239, m2240, m2241, m2242, m2243, m2244, m2245, m2246, m2247, m2248, m2249, m2250, m2251, m2252, m2253, m2254, m1937, m1736, m1798, m1800, m2255, m2256, m2257, m2258, m2259, m1782, m1785, m2260, m1795, m2261, m2262, m1569, m1570, m1844, m2263, m1842, m2264, m2265, m1843, m2266, m2267, m2268, m2269, m2270, m2271, m2016, m1862, m1969, m1860, m2272, m2021, m2273, m2274, m2031, m2033, m1788, m1942, m74, m1655, m1777, m1595, m1543, m1935, m1810, m1809, m1928, m1927, m2045, m2275, m2276, m2277, m2046, m2278, m1673, m2279, m1685, m1625, m2280, m2281, m1686, m1627, m2282, m2283, m1687, m1628, m2284, m2285, m1643, m1617, m2286, m2287, m1688, m1642, m2288, m2289, m2290, m2291, m1681, m1636, m1637, m2044, m2019, m2292, m2293, m2294, m2295, m2296, m2297, m2298, m1995, m2000, m2299, m2300, m2301, m2302, m1997, m1993, m2303, m2304, m1465, m2305, m2306, m2307, m2308, m2309, m2310, m2311, m2312, m2313, m2314, m2315, m2316, m2317, m2318, m2319, m2320, m2321, m2322, m1787, m2323, m1783, m1780, m1803, m2324, m1781, m2325, m65, m2326, m61, m2327, m1794, m1793, m1786, m1801, m2328, m2329, m2330, m2331, m2332, m2333, m2334, m2335, m2336, m69, m70, m71, m67, m2337, m1654, m1917, m1816, m2338, m2339, m1514, m1659, m1507, m2340, m2341, m2342, m2343, m1568, m1567, m1463, m1581, m2344, m2345, m2346, m2347, m2348, m1757, m2349, m1566, m2350, m1580, m2351, m2352, m2353, m2354, m2355, m2356, m2357, m2358, m2359, m2360, m2361, m68, m66, m1660, m2362, m1610, m2363, m1994, m2364, m2365, m2366, m2367, m2368, m2369, m2370, m2371, m2372, m2373, m2374, m2375, m2376, m2377, m2378, m2379, m2380, m2381, m2382, m2383, m2384, m2385, m2386, m2387, m2388, m2389, m2390, m2391, m2392, m2393, m2394, m2395, m34, m1602, m2396, m2397, m1924, m2398, m2399, m1518, m1520, m1519, m2400, m1542, m1541, m1562, m41, m1522, m75, m2401, m1524, m2402, m1540, m1560, m1561, m1559, m1900, m1832, m1888, m2403, m2404, m2405, m2406, m2407, m2408, m56, m2409, m1833, m2410, m1872, m1639, m77, m1733, m2411, m2412, m2413, m2414, m2415, m2416, m2417, m58, m2418, m2419, m1458, m1460, m63, m2420, m36, m55, m2043, m2421, m2422, m2423, m1722, m51, m1615, m2424, m2425, m2426, m2427, m1499, m1620, m1621, m1647, m1944, m1515, m2428, m2429, m2430, m2431, m2432, m2433, m2434, m2435, m2436, m37, m40, m2437, m2438, m1675, m1883, m2439, m2440, m1765, m1761, m2441, m1879, m1884, m2442, m2443, m1881, m1885, m2444, m2445, m1500, m1916, m2446, m2447, m1873, m1619, m1948, m2448, m1967, m2449, m1682, m2450, m1623, m1874, m1662, m2451, m1622, m2452, m1546, m1599, m2453, m45, m46, m2454, m2455, m2456, m2457, m2458, m2459, m2460, m2461, m2462, m2463, m2464, m2465, m2466, m2467, m2468, m2469, m2470, m2471, m2472, m2473, m2474, m2475, m2476, m2477, m2478, m2479, m2480, m62, m2481, m2482, m2483, m2484, m2485, m2486, m2487, m2488, m2489, m2490, m2491, m2492, m2493, m2494, m2495, m2496, m2497, m2498, m1758, m2499, m1583, m2500, m2501, m2502, m2503, m2504, m1588, m1589, m1587, m1586, m2505, m2506, m2507, m1759, m2508, m1571, m2509, m1575, m1576, m1760, m1572, m2510, m1573, m49, m44, m2511, m2512, m2513, m2514, m2515, m2516, m2517, m2518, m2519, m2520, m2521, m2522, m2523, m2524, m2525, m2526, m2527, m2528, m2529, m2530, m2531, m2532, m48, m54, m2533, m2534, m2535, m2536, m2537, m2538, m2539, m2540, m2541, m2542, m2543, m2544, m2545, m2546, m2547, m2548, m2549, m2550, m2551, m2552, m2553, m2554, m2555, m2556, m2557, m2558, m2559, m2560, m2561, m2562, m2563, m2564, m2565, m2566, m2567, m2568, m2569, m2570, m2571, m2572, m2573, m2574, m2575, m2576, m2577, m2578, m2579, m2580, m2581, m1975, m1974, m1973, m2582, m2583, m2584, m2585, m2586, m2587, m2588, m2589, m2590, m2591, m2592, m2593, m2594, m2595, m2596, m2597, m2598, m2599, m2600, m2601, m2602, m2603, m2604, m2605, m2606, m2607, m2608, m2609, m2610, m2611, m2612, m2613, m2614, m2615, m2616, m2617, m2618, m2619, m2620, m2621, m2622, m2623, m2624, m2625, m2626, m2627, m1711, m2628, m2629, m2630, m2631, m2632, m2633, m2634, m2635, m1999, m2636, m1853, m2637, m2638, m2639, m2640, m2641, m2642, m2643, m2644, m2645, m2646, m2647, m2648, m2649, m2650, m2002, m2651, m2652, m2004, m1815, m1998, m2653, m2654, m2655, m2656, m2657, m2658, m1871, m2659, m2660, m2661, m2662, m2663, m1847, m2664, m2665, m1846, m2666, m2667, m1887, m2668, m2669, m2001, m2670, m2671, m2672, m2007, m2008, m1870, m2673, m2005, m1848, m1845, m1604, m2674, m2675, m2676, m1605, m2677, m1753, m2020, m1767, m2003, m2023, m1784, m2024, m1741, m1754, m1915, m1665, m1694, m1666, m1692, m1693, m1766, m1715, m2678, m1933, m1703, m1707, m1963, m2679, m1740, m2680, m2681, m1746, m2682, m1744, m1911, m2683, m1912, m1902, m2684, m1727, m1728, m1876, m1903, m1904, m1729, m1731, m1725, m1726, m1909, m1717, m1907, m2685, m1768, m2686, m1742, m2687, m2688, m1743, m2689, m1802, m2690, m1684, m1930, m2691, m1814, m2692, m2693, m2694, m2695, m2696, m2697, m2698, m2699, m2700, m1854, m1855, m2701, m1850, m1852, m1856, m1851, m1858, m2702, m2703, m2704, m2705, m2039, m2706, m2707, m2708, m2709, m2037, m2710, m2038, m2711, m2032, m2034, m2712, m2713, m2714, m2715, m2716, m2717, m2718, m2719, m1834, m1835, m2720, m2721, m2722, m2723, m2724, m2725, m2726, m2727, m2728, m2729, m2730, m2731, m2732, m2733, m2734, m2735, m2736, m2737, m2738, m2739, m2740, m2741, m2742, m2743, m2744, m2745, m2746, m2747, m2748, m2749, m2750, m2751, m2752, m2753, m2754, m2755, m2756, m2757, m2758, m2759, m2760, m2761, m2762, m2763, m2764, m2765, m2766, m2767, m2768, m2769, m2770, m2771, m2772, m2773, m2774, m2775, m2776, m2777, m2778, m2779, m2780, m2781, m2782, m2783, m2784, m2785, m2786, m2787, m2788, m2789, m2790, m2791, m2792, m2793, m2794, m2795, m2796, m2797, m2798, m2799, m2800, m2801, m2802, m2803, m2804, m2805, m2806, m2807, m2808, m2809, m2810, m2811, m2812, m2813, m2814, m2815, m2816, m2817, m2818, m2819, m2820, m1598, m1698, m2821, m2822, m2823, m1601, m2824, m2825, m2826, m2827, m2828, m2829, m2830, m2831, m2832, m2833, m2834, m2835, m2836, m2837, m2838, m1697, m1716, m2839, m2840, m2910, m2911, m2912, m2913, m2914, m2915, m2916, m2917, m2918, m2919, m2920, m2921, m2922, m2923, m2924, m2925, m2926, m2927, m2928, m2929, m2930, m2931, m2932, m2933, m2934, m2935, m2936, m2937, m2938, m2939, m2940, m2941, m2942, m2943, m2944, m2945, m2946, m2947, m2948, m2949, m2950, m2951, m2952, m2953, m2954, m2955, m2956, m2957, m2979, m2980, m2981, m2982, m2983, m2984, m2985, m2986, m2987, m2988, m2989, m2990, m2991, m2992, m2993, m2994, m2995, m2996, m2997, m2998, m2999, m3000, m3001, m3002, m3003, m3004, m3005, m3006, m3007, m3008, m3009, m3010, m3011, m3012, m3013, m3014, m3015, m3016, m3017, m3018, m3019, m3020, m3021, m3022, m3023, m3024, m3025, m3026, m3027, m3028, m3029, m3030, m3031, m3032, m3033, m3034, m3035, m3036, m3037, m3038, m3039, m3040, m3041, m3042, m3043, m3044, m3045, m3046, m3047, m3048, m3049, m3050, m3051, m3052, m3053, m3054, m3055, m3056, m3057, m3058, m3059, m3060, m3061, m3062, m3063, m3064, m3065, m3066, m3067, m3068, m3069, m3070, m3071, m3072, m3073, m3074, m3075, m3076, m3077, m3078, m3079, m3080, m3081, m3082, m3083, m3084, m3085, m3086, m3087, m3088, m3089, m3090, m3091, m3092, m3093, m3094, m3095, m3096, m3097, m3098, m3099, m3100, m3101, m3102, m3103, m3104, m3105, m3106, m3107, m3108, m3109, m3110, m3111, m3112, m3113, m3114, m3115, m3116, m3117, m3118, m3119, m3120, m3121, m3122, m3123, m3124, m3125, m3126, m3127, m3128, m3129, m3130, m3131, m3132, m3133, m3134, m3135, m3136, m3137, m3138, m3139, m3140, m3141, m3142, m3143, m3144, m3145, m3146, m3147, m3148, m3149, m3150, m3151, m3152, m3153, m3154, m3155, m3156, m3157, m3158, m3159, m3160, m3161, m3162, m3163, m3164, m3165, m3166, m3167, m3168, m3169, m3170, m3171, m3172, m3173, m3174, m3175, m3176, m3177, m3178, m3179, m3180, m3181, m3182, m3183, m3184, m3185, m3186, m3187, m3188, m3189, m3190, m3191, m3192, m3193, m3194, m3195, m3196, m3197, m3198, m3199, m3200, m3201, m3202, m3203, m3204, m3205, m3206, m3207, m3208, m3209, m3210, m3211, m3212, m3213, m3214, m3215, m3216, m3217, m3218, m3219, m3220, m3221, m3222, m3223, m3224, m3225, m3226, m3227, m3228, m3229, m3230, m3231, m3232, m3233, m3234, m3235, m3236, m3237, m3238, m3239, m3240, m3241, m3242, m3243, m3244, m3245, m3246, m3247, m3248, m3249, m3250, m3251, m3252, m3253, m3254, m3255, m3256, m3257, m3258, m3259, m3260, m3261, m3262, m3263, m3264, m3265, m3266, m3267, m3268, m3269, m3270, m3271, m3272, m3273, m3274, m3275, m3276, m3277, m3278, m3279, m3280, m3281, m3282, m3283, m3284, m3285, m3286, m3287, m3288, m3289, m3290, m3291, m3292, m3293, m3294, m3295, m3296, m3297, m3298, m3299, m3300, m3301, m3302, m3303, m3304, m3305, m3306, m3307, m3308, m3309, m3310, m3311, m3312, m3313, m3314, m3315, m3316, m3317, m3318, m3319, m3320, m3321, m3322, m3323, m3324, m3325, m3326, m3327, m3328, m3329, m3330, m3331, m3332, m3333, m3334, m3335, m3336, m3337, m3338, m3339, m3340, m3341, m3342, m3343, m3344, m3345, m3346, m3347, m3348, m3349, m3350, m3351, m3352, m3353, m3354, m3355, m3356, m3357, m3358, m3359, m3360, m3361, m3362, m3363, m3364, m3365, m3366, m3367, m3368, m3369, m3370, m3371, m3372, m3373, m3374, m3375, m3376, m3377, m3378, m3379, m3380, m3381, m3382, m3383, m3384, m3385, m3386, m3387, m3388, m3389, m3390, m3391, m3392, m3393, m3394, m3395, m3396, m3397, m3398, m3399, m3400, m3401, m3402, m3403, m3404, m3405, m3406, m3407, m3408, m3409, m3410, m3411, m3412, m3413, m3414, m3415, m3416, m3417, m3418, m3419, m3420, m3421, m3422, m3423, m3424, m3425, m3426, m3427, m3428, m3429, m3430, m3431, m3432, m3433, m3434, m3435, m3436, m3437, m3438, m3439, m3440, m3441, m3442, m3443, m3444, m3445, m3446, m3447, m3448, m3449, m3450, m3451, m3452, m3453, m3454, m3455, m3456, m3457, m3458, m3459, m3460, m3461, m3462, m3463, m3464, m3465, m3466, m3467, m3468, m3469, m3470, m3471, m3472, m3473, m3474, m3475, m3476, m3477, m3478, m3479, m3480, m3481, m3482, m3483, m3484, m3485, m3486, m3487, m3488, m3489, m3490, m3491, m3492, m3493, m3494, m3495, m3496, m3497, m3498, m3499, m3500, m3501, m3502, m3503, m3504, m3505, m3506, m3507, m3508, m3509, m3510, m3511, m3512, m3513, m3514, m3515, m3516, m3517, m3518, m3519, m3520, m3521, m3522, m3523, m3524, m3525, m3526, m3527, m3528, m3529, m3530, m3531, m3532, m3533, m3534, m3535, m3536, m3537, m3538, m3539, m3540, m3541, m3542, m3543, m3544, m3545, m3546, m3547, m3548, m3549, m3550, m3551, m3552, m3553, m3554, m3555, m3556, m3557, m3558, m3559, m3560, m3561, m3562, m3563, m3564, m3565, m3566, m3567, m3568, m3569, m3570, m3571, m3572, m3573, m3574, m3575, m3576, m3577, m3578, m3579, m3580, m3581, m3582, m3583, m3584, m3585, m3586, m3587, m3588, m3589, m3590, m3591, m3592, m3593, m3594, m3595, m3596, m3597, m3598, m3599, m3600, m3601, m3602, m3603, m3604, m3605, m3606, m3607, m3608, m3609, m3610, m3611, m3612, m3613, m3614, m3615, m3616, m3617, m3618, m3619, m3620, m3621, m3622, m3623, m3624, m3625, m3626, m3627, m3628, m3629, m3630, m3631, m3632, m3633, m3634, m3635, m3636, m3637, m3638, m3639, m3640, m3641, m3642, m3643, m3644, m3645, m3646, m3647, m3648, m3649, m3650, m3651, m3652, m3653, m3654, m3655, m3656, m3657, m3658, m3659, m3660, m3661, m3662, m3663, m3664, m3665, m3666, m3667, m3668, m3669, m3670, m3671, m3672, m3673, m3674, m3675, m3676, m3677, m3678, m3679, m3680, m3681, m3682, m3683, m3684, m3685, m3686, m3687, m3688, m3689, m3690, m3691, m3692, m3693, m3694, m3695, m3696, m3697, m3698, m3699, m3700, m3701, m3702, m3703, m3704, m3705, m3706, m3707, m3708, m3709, m3710, m3711, m3712, m3713, m3714, m3715, m3716, m3717, m3718, m3719, m3720, m3721, m3722, m3723, m3724, m3725, m3726, m3727, m3728, m3729, m3730, m3731, m3732, m3733, m3734, m3735, m3736, m3737, m3738, m3739, m3740, m3741, m3742, m3743, m3744, m3745, m3746, m3747, m3748, m3749, m3750, m3751, m3752, m3753, m3754, m3755, m3756, m3757, m3758, m3759, m3760, m3761, m3762, m3763, m3764, m3765, m3766, m3767, m3768, m3769, m3770, m3771, m3772, m3773, m3774, m3775, m3776, m3777, m3778, m3779, m3780, m3781, m3782, m3783, m3784, m3785, m3786, m3787, m3788, m3789, m3790, m3791, m3792, m3793, m3794, m3795, m3796, m3797, m3798, m3799, m3800, m3801, m3802, m3803, m3804, m3805, m3806, m3807, m3808, m3809, m3810, m3811, m3812, m3813, m3814, m3815, m3816, m3817, m3818, m3819, m3820, m3821, m3822, m3823, m3824, m3825, m3826, m3827, m3828, m3829, m3830, m3831, m3832, m3833, m3834, m3835, m3836, m3837, m3838, m3839, m3840, m3841, m3842, m3843, m3844, m3845, m3846, m3847, m3848, m3849, m3850, m3851, m3852, m3853, m3854, m3855, m3856, m3857, m3858, m3859, m3860, m3861, m3862, m3863, m3864, m4001, m4002, m4003, m4004, m4005, m4006, m4007, m4008, m4009, m4010, m4011, m4012, m4013, m4014, m4015, m4016, m4017, m4018, m4019, m4020, m4021, m4022, m4023, m4024, m4025, m4026, m4027, m4028, m4029, m4030, m4031, m4032, m4033, m4034, m4035, m4036, m4037, m4038, m4039, m4040, m4041, m4042, m4043, m4044, m4045, m4046, m4047, m4048, m4049, m4050, m4051, m4052, m4053, m4054, m4055, m4056, m4057, m4058, m4059, m4060, m4061, m4062, m4063, m4064, m4065, m4066, m4067, m4068, m4069, m4070, m4071, m4072, m4073, m4074, m4075, m4076, m4077, m4078, m4079, m4080, m4081, m4082, m4083, m4084, m4085, m4086, m4087, m4088, m4089, m4090, m4091, m4092, m4093, m4094, m4095, m4096, m4097, m4098, m4099, m4100, m4101, m4102, m4103, m4104, m4105, m4106, m4107, m4108, m4109, m4110, m4111, m4112, m3958, m3962, m4113, m4114, m4115, m4116, m4117, m4118, m4119, m4120, m4121, m4122, m4123, m4124, m4125, m4126, m4127, m4128, m4129, m4130, m4131, m4132, m4133, m4134, m4135, m4136, m4137, m4138, m4139, m4140, m4141, m4142, m4143, m4144, m4145, m4146, m4147, m4148, m4149, m4150, m4151, m4152, m4153, m4154, m4155, m4156, m4157, m4158, m4159, m4160, m4161, m4162, m4163, m4164, m4165, m4166, m4167, m4168, m4169, m3961, m3926, m3960, m3963, m4170, m4171, m4172, m4173, m4174, m4175, m4176, m4177, m4178, m4179, m4180, m4181, m4182, m4183, m4184, m4185, m4186, m4187, m4188, m4189, m4190, m4191, m4192, m4193, m4194, m4195, m4196, m4197, m4198, m4199, m4200, m4201, m4202, m4203, m4204, m4205, m4206, m4207, m4208, m4209, m4210, m4211, m4212, m4213, m4214, m4215, m4216, m4217, m4218, m4219, m4220, m4221, m4222, m4223, m4224, m4225, m4226, m4227, m4228, m4229, m4230, m4231, m4232, m3964, m4233, m4234, m4235, m4236, m4237, m3969, m4238, m4239, m4240, m4241, m4242, m4243, m4244, m4245, m4246, m4247, m4248, m4249, m4250, m4251, m4252, m4253, m4254, m4255, m4256, m4257, m4258, m4259, m4260, m4261, m4262, m4263, m4264, m4265, m4266, m4267, m4268, m4269, m4270, m4271, m4272, m4273, m3990, m4274, m4275, m3979, m3978, m3968, m4276, m3989, m4277, m3965, m4278, m4279, m4280, m3966, m4281, m4282, m4283, m4284, m4285, m4286, m4287, m4288, m4289, m4290, m4291, m4292, m4293, m4294, m4295, m4296, m4297, m4298, m4299, m4300, m4301, m4302, m4303, m4304, m4305, m4306, m4307, m4308, m4309, m4310, m4311, m4312, m4313, m4314, m4315, m4316, m4317, m4318, m4319, m4320, m4321, m4322, m4323, m4324, m4325, m4326, m4327, m4328, m4329, m4330, m4331, m4332, m4333, m4334, m4335, m4336, m4337, m4338, m4339, m4340, m4341, m4342, m4343, m4344, m4345, m4346, m4347, m4348, m4349, m4350, m4351, m4352, m4353, m4354, m4355, m4356, m4357, m4358, m4359, m4360, m4361, m4362, m4363, m4364, m4365, m4366, m4367, m4368, m4369, m4370, m4371, m4372, m4373, m4374, m4375, m4376, m4377, m4378, m4379, m4380, m4381, m4382, m4383, m4384, m4385, m4386, m4387, m4388, m4389, m4390, m4391, m4392, m4393, m4394, m4395, m4396, m4397, m4398, m4399, m4400, m4401, m4402, m4403, m4404, m4405, m4406, m4407, m4408, m4409, m4410, m4411, m4412, m4413, m4414, m4415, m4416, m4417, m4418, m4419, m4420, m4421, m4422, m4423, m4424, m4425, m4426, m4427, m4428, m4429, m4430, m4431, m4432, m4433, m4434, m4435, m4436, m4437, m4438, m4439, m4440, m4441, m3997, m4442, m4443, m4444, m4445, m4446, m4447, m4448, m4449, m4450, m4451, m4452, m4453, m4454, m4455, m3995, m4456, m4457, m4458, m3996, m4459, m4460, m4461, m4462, m4463, m4464, m4465, m4466, m4467, m4468, m4469, m4470, m4471, m4472, m4473, m4474, m4475, m4476, m4477, m4478, m4479, m4480, m4481, m4482, m4483, m4484, m3993, m4485, m4486, m4487, m4488, m2889, m4489, m4490, m4491, m4492, m4493, m4494, m4495, m4496, m4497, m4498, m4499, m4500, m4501, m3994, m4502, m4503, m4504, m4505, m4506, m4507, m4508, m4509, m4510, m4511, m4512, m4513, m4514, m4515, m4516, m4517, m4518, m4519, m4520, m4521, m4522, m4523, m4524, m4525, m4526, m4527, m4528, m4529, m4530, m4531, m4532, m4533, m4534, m4535, m4536, m4537, m4538, m4539, m4540, m4541, m4542, m4543, m4544, m4545, m4546, m4547, m4548, m4549, m4550, m4551, m4552, m4553, m4554, m4555, m4556, m4557, m4558, m4559, m4560, m4561, m4562, m4563, m4564, m4565, m4566, m4567, m4568, m4569, m4570, m4571, m4572, m4573, m4574, m4575, m4576, m4577, m4578, m4579, m4580, m4581, m4582, m4583, m4584, m4585, m4586, m4587, m4588, m4589, m4590, m4591, m4592, m4593, m4594, m4595, m4596, m4597, m4598, m4599, m4600, m4601, m4602, m4603, m4604, m4605, m4606, m4607, m4608, m4609, m4610, m4611, m4612, m4613, m4614, m4615, m4616, m4617, m4618, m4619, m4620, m4621, m4622, m4623, m4624, m4625, m4626, m4627, m4628, m4629, m4630, m4631, m4632, m4633, m4634, m4635, m4636, m4637, m4638, m4639, m4640, m4641, m4642, m4643, m4644, m4645, m4646, m4647, m4648, m4649, m4650, m4651, m4652, m4653, m4654, m4655, m4656, m4657, m4658, m4659, m4660, m4661, m4662, m4663, m4664, m4665, m4666, m4667, m4668, m4669, m4670, m4671, m4672, m4673, m4674, m4675, m4676, m4677, m4678, m4679, m4680, m4681, m4682, m4683, m4684, m4685, m4686, m4687, m4688, m4689, m4690, m4691, m4692, m4693, m4694, m4695, m4696, m4697, m4698, m4699, m4700, m4701, m4702, m4703, m4704, m4705, m4706, m4707, m4708, m4709, m4710, m4711, m4712, m4713, m4714, m4715, m4716, m4717, m4718, m4719, m4720, m4721, m4722, m4723, m4724, m4725, m4726, m4727, m4728, m4729, m4730, m4731, m4732, m4733, m4734, m4735, m4736, m4737, m4738, m4739, m4740, m4741, m4742, m4743, m4744, m4745, m4746, m4747, m4748, m4749, m4750, m4751, m4752, m4753, m4754, m4755, m4756, m4757, m4758, m4759, m4760, m4761, m4762, m4763, m4764, m4765, m4766, m4767, m4768, m4769, m4770, m4771, m4772, m4773, m4774, m4775, m4776, m4777, m4778, m4779, m4780, m4781, m4782, m4783, m4784, m4785, m4786, m4787, m4788, m4789, m4790, m4791, m4792, m4793, m4794, m4795, m4796, m4797, m4798, m4799, m4800, m4801, m4802, m4803, m4804, m4805, m4806, m4807, m4808, m4809, m4810, m4811, m4812, m4813, m4814, m4815, m4816, m4817, m4818, m4819, m4820, m4821, m4822, m3959, m4823, m4824, m4825, m4826, m4827, m4828, m4829, m4830, m4831, m4832, m4833, m4834, m4835, m4836, m4837, m4838, m4839, m4840, m4841, m4842, m4843, m4844, m4845, m4846, m4847, m4848, m4849, m4850, m4851, m4852, m4853, m4854, m4855, m4856, m4857, m4858, m4859, m4860, m4861, m4862, m4863, m4864, m4865, m4866, m4867, m4868, m4869, m4870, m4871, m4872, m4873, m4874, m4875, m4876, m4877, m3967, m4878, m4879, m4880, m4881, m4882, m4883, m1474, m4977, m4974, m2842, m4978, m1532, m4979, m2906, m2862, m4980, m4981, m4982, m4983, m4984, m4985, m4986, m4987, m2852, m4988, m4989, m4990, m2907, m4991, m4992, m4993, m4994, m4995, m4996, m4997, m4998, m4999, m5000, m5001, m5002, m5003, m5004, m5005, m5006, m5007, m5008, m5009, m5010, m5011, m5012, m2843, m1464, m2845, m5013, m5014, m5015, m5016, m5017, m5018, m5019, m5020, m5021, m5022, m5023, m5024, m3951, m5025, m5026, m4912, m2883, m3935, m4946, m3939, m5027, m5028, m5029, m5030, m5031, m5032, m5033, m5034, m5035, m5036, m5037, m5038, m5039, m5040, m5041, m5042, m5043, m5044, m5045, m5046, m5047, m5048, m5049, m5050, m5051, m5052, m5053, m5054, m5055, m5056, m5057, m5058, m5059, m5060, m4909, m4910, m5061, m5062, m5063, m5064, m5065, m5066, m5067, m5068, m5069, m5070, m5071, m5072, m5073, m5074, m5075, m5076, m5077, m5078, m5079, m5080, m5081, m5082, m5083, m5084, m5085, m5086, m5087, m4968, m5088, m5089, m5090, m5091, m5092, m5093, m5094, m5095, m5096, m5097, m5098, m5099, m5100, m5101, m5102, m5103, m5104, m5105, m5106, m5107, m5108, m5109, m5110, m5111, m5112, m5113, m5114, m5115, m5116, m5117, m5118, m3880, m5119, m5120, m5121, m5122, m5123, m5124, m5125, m5126, m5127, m5128, m5129, m5130, m5131, m5132, m5133, m5134, m5135, m5136, m5137, m5138, m5139, m5140, m5141, m5142, m5143, m5144, m5145, m3936, m3870, m3879, m3885, m5146, m5147, m5148, m5149, m5150, m5151, m5152, m5153, m5154, m5155, m5156, m5157, m5158, m5159, m5160, m5161, m5162, m5163, m5164, m5165, m5166, m5167, m5168, m5169, m5170, m5171, m5172, m5173, m5174, m5175, m5176, m5177, m5178, m5179, m5180, m5181, m5182, m5183, m5184, m5185, m5186, m5187, m5188, m5189, m5190, m5191, m5192, m5193, m5194, m5195, m5196, m5197, m5198, m5199, m5200, m5201, m5202, m5203, m5204, m5205, m5206, m5207, m5208, m5209, m5210, m5211, m5212, m5213, m5214, m5215, m5216, m5217, m5218, m5219, m5220, m5221, m5222, m5223, m5224, m5225, m5226, m5227, m5228, m5229, m5230, m5231, m5232, m5233, m5234, m5235, m5236, m5237, m5238, m5239, m5240, m5241, m5242, m5243, m5244, m5245, m5246, m5247, m5248, m5249, m5250, m5251, m4957, m4955, m1890, m4954, m1891, m5252, m1893, m4956, m4927, m5253, m5254, m1894, m5255, m5256, m1892, m4929, m1864, m5257, m5258, m5259, m5260, m5261, m5262, m5263, m5264, m5265, m5266, m5267, m5268, m5269, m5270, m5271, m5272, m5273, m5274, m5275, m5276, m5277, m5278, m5279, m5280, m5281, m5282, m3901, m1839, m5283, m5284, m4908, m5285, m2876, m5286, m5287, m5288, m4930, m1867, m1840, m5289, m2873, m5290, m4970, m4928, m5291, m5292, m5293, m5294, m3998, m4000, m5295, m5296, m5297, m5298, m5299, m2878, m5300, m1859, m3909, m5301, m4941, m5302, m5303, m5304, m5305, m1895, m3999, m4971, m5306, m2877, m2879, m5307, m5308, m1861, m5309, m4913, m5310, m4972, m5311, m2882, m5312, m1889, m1869, m5313, m2871, m2881, m2880, m5314, m5315, m1863, m4960, m4969, m5316, m2870, m5317, m1611, m5318, m5319, m1996, m3949, m5320, m1469, m1459, m1701, m1807, m2874, m1506, m4911, m5321, m1865, m5322, m5323, m5324, m1820, m5325, m5326, m5327, m5328, m2856, m5329, m5330, m5331, m5332, m5333, m5334, m5335, m4962, m1868, m5336, m5337, m5338, m5339, m5340, m5341, m5342, m5343, m5344, m5345, m5346, m52, m1838, m5347, m5348, m5349, m5350, m5351, m5352, m5353, m5354, m5355, m5356, m5357, m5358, m5359, m5360, m5361, m5362, m5363, m1466, m1704, m2844, m5364, m5365, m5366, m5367, m5368, m5369, m5370, m2849, m5371, m5372, m5373, m5374, m5375, m5376, m5377, m5378, m5379, m5380, m5381, m5382, m5383, m5384, m5385, m5386, m5387, m5388, m5389, m5390, m5391, m5392, m5393, m5394, m5395, m5396, m5397, m5398, m5399, m5400, m5401, m5402, m5403, m5404, m5405, m5406, m5407, m5408, m5409, m5410, m5411, m5412, m5413, m5414, m5415, m5416, m5417, m5418, m5419, m5420, m5421, m5422, m5423, m5424, m5425, m5426, m5427, m5428, m5429, m5430, m5431, m5432, m5433, m5434, m5435, m5436, m5437, m5438, m5439, m5440, m5441, m5442, m5443, m5444, m5445, m5446, m5447, m5448, m5449, m5450, m5451, m5452, m5453, m5454, m5455, m5456, m5457, m5458, m5459, m5460, m5461, m5462, m5463, m5464, m5465, m5466, m5467, m5468, m5469, m5470, m5471, m5472, m5473, m5474, m5475, m5476, m5477, m5478, m5479, m5480, m5481, m5482, m5483, m5484, m5485, m5486, m5487, m5488, m5489, m5490, m5491, m5492, m5493, m5494, m5495, m5496, m5497, m5498, m5499, m5500, m5501, m5502, m5503, m5504, m5505, m5506, m5507, m5508, m5509, m5510, m5511, m5512, m5513, m5514, m5515, m5516, m2853, m5517, m5518, m5519, m5520, m5521, m5522, m5523, m5524, m2847, m5525, m5526, m2888, m2846, m5527, m5528, m5529, m2887, m5530, m5531, m5532, m5533, m5534, m5535, m5536, m5537, m5538, m5539, m5540, m5541, m5542, m5543, m5544, m5545, m5546, m5547, m5548, m5549, m5550, m5551, m5552, m5553, m5554, m5555, m5556, m5557, m5558, m2909, m2891, m5559, m5560, m5561, m5562, m5563, m2908, m5564, m5565, m5566, m5567, m5568, m5569, m5570, m5571, m5572, m5573, m5574, m5575, m1750, m5576, m5577, m1751, m5578, m5579, m5580, m5581, m5582, m5583, m5584, m5585, m5586, m5587, m5588, m5589, m5590, m5591, m5592, m5593, m5594, m5595, m5596, m5597, m5598, m5599, m5600, m3975, m5601, m5602, m5603, m5604, m4953, m5605, m5606, m5607, m5608, m5609, m5610, m5611, m5612, m5613, m5614, m5615, m5616, m5617, m5618, m5619, m5620, m5621, m5622, m5623, m5624, m5625, m5626, m5627, m5628, m5629, m5630, m5631, m5632, m5633, m5634, m5635, m5636, m5637, m5638, m5639, m5640, m5641, m5642, m5643, m5644, m5645, m5646, m5647, m5648, m5649, m4890, m5650, m4893, m5651, m5652, m5653, m5654, m5655, m5656, m5657, m5658, m5659, m5660, m5661, m5662, m5663, m5664, m5665, m5666, m5667, m5668, m5669, m5670, m5671, m5672, m5673, m5674, m5675, m4891, m5676, m5677, m5678, m5679, m5680, m5681, m5682, m5683, m5684, m5685, m5686, m5687, m5688, m5689, m5690, m5691, m2963, m5692, m5693, m4963, m5694, m5695, m5696, m5697, m5698, m5699, m5700, m5701, m5702, m5703, m5704, m3875, m3911, m5705, m5706, m5707, m5708, m5709, m5710, m5711, m5712, m5713, m5714, m5715, m5716, m5717, m5718, m5719, m5720, m5721, m5722, m5723, m5724, m5725, m5726, m5727, m5728, m5729, m5730, m5731, m5732, m5733, m5734, m5735, m5736, m5737, m5738, m5739, m5740, m5741, m5742, m5743, m5744, m5745, m5746, m5747, m5748, m5749, m5750, m5751, m5752, m5753, m5754, m5755, m5756, m5757, m2896, m5758, m5759, m1721, m5760, m5761, m5762, m5763, m5764, m5765, m5766, m5767, m5768, m5769, m5770, m5771, m5772, m5773, m5774, m5775, m5776, m5777, m5778, m5779, m5780, m5781, m5782, m5783, m5784, m5785, m5786, m5787, m5788, m5789, m5790, m5791, m5792, m5793, m5794, m5795, m5796, m3865, m2884, m3986, m2886, m5797, m2885, m5798, m5799, m5800, m5801, m4976, m5802, m5803, m5804, m5805, m5806, m5807, m5808, m5809, m5810, m5811, m5812, m5813, m5814, m5815, m5816, m5817, m5818, m5819, m5820, m5821, m5822, m5823, m5824, m5825, m5826, m5827, m5828, m5829, m5830, m5831, m5832, m5833, m5834, m5835, m3974, m5836, m3972, m5837, m5838, m5839, m5840, m5841, m4923, m5842, m5843, m2978, m5844, m5845, m5846, m5847, m5848, m5849, m5850, m5851, m5852, m5853, m5854, m5855, m5856, m5857, m5858, m5859, m5860, m5861, m5862, m5863, m5864, m5865, m5866, m5867, m5868, m5869, m5870, m5871, m5872, m5873, m5874, m5875, m5876, m5877, m5878, m5879, m5880, m5881, m5882, m5883, m5884, m5885, m5886, m5887, m5888, m5889, m5890, m5891, m5892, m5893, m5894, m5895, m5896, m5897, m5898, m5899, m5900, m5901, m5902, m5903, m5904, m5905, m5906, m5907, m5908, m5909, m5910, m5911, m5912, m5913, m5914, m5915, m5916, m5917, m5918, m5919, m5920, m5921, m5922, m5923, m5924, m5925, m5926, m5927, m5928, m5929, m5930, m5931, m5932, m5933, m5934, m5935, m5936, m5937, m5938, m5939, m5940, m5941, m5942, m5943, m5944, m5945, m5946, m5947, m5948, m5949, m5950, m5951, m5952, m5953, m5954, m5955, m5956, m5957, m5958, m5959, m5960, m5961, m5962, m5963, m5964, m5965, m5966, m5967, m5968, m5969, m5970, m5971, m5972, m5973, m5974, m5975, m5976, m5977, m5978, m5979, m5980, m5981, m5982, m5983, m5984, m5985, m5986, m5987, m5988, m5989, m5990, m5991, m5992, m5993, m5994, m5995, m5996, m5997, m5998, m5999, m6000, m6001, m6002, m6003, m6004, m6005, m6006, m6007, m6008, m6009, m6010, m6011, m6012, m6013, m6014, m6015, m6016, m6017, m6018, m6019, m6020, m6021, m6022, m6023, m6024, m6025, m6026, m6027, m6028, m6029, m6030, m6031, m6032, m6033, m6034, m6035, m6036, m6037, m6038, m6039, m6040, m6041, m6042, m6043, m6044, m6045, m6046, m6047, m6048, m6049, m6050, m6051, m6052, m6053, m6054, m6055, m6056, m6057, m6058, m6059, m6060, m6061, m6062, m6063, m6064, m6065, m6066, m6067, m6068, m6069, m6070, m6071, m6072, m6073, m6074, m6075, m6076, m6077, m6078, m6079, m6080, m6081, m6082, m6083, m6084, m6085, m6086, m6087, m6088, m6089, m6090, m6091, m6092, m6093, m6094, m6095, m6096, m6097, m6098, m6099, m6100, m6101, m6102, m6103, m6104, m6105, m6106, m6107, m6108, m6109, m6110, m6111, m6112, m6113, m6114, m6115, m6116, m6117, m6118, m6119, m6120, m6121, m6122, m6123, m6124, m6125, m6126, m6127, m6128, m6129, m6130, m6131, m6132, m6133, m6134, m6135, m6136, m6137, m6138, m6139, m6140, m6141, m6142, m6143, m6144, m6145, m6146, m6147, m6148, m6149, m6150, m6151, m6152, m6153, m6154, m6155, m6156, m6157, m6158, m6159, m6160, m6161, m6162, m6163, m6164, m6165, m6166, m6167, m6168, m6169, m6170, m6171, m6172, m6173, m6174, m6175, m6176, m6177, m6178, m6179, m6180, m6181, m6182, m6183, m6184, m6185, m6186, m6187, m6188, m6189, m6190, m6191, m6192, m6193, m6194, m6195, m6196, m6197, m6198, m6199, m6200, m6201, m6202, m6203, m6204, m6205, m6206, m6207, m6208, m6209, m6210, m6211, m6212, m6213, m6214, m6215, m6216, m6217, m6218, m6219, m6220, m6221, m6222, m6223, m6224, m6225, m6226, m6227, m6228, m6229, m6230, m6231, m6232, m6233, m6234, m6235, m6236, m6237, m6238, m6239, m6240, m6241, m6242, m6243, m6244, m6245, m6246, m6247, m6248, m6249, m6250, m6251, m6252, m6253, m6254, m6255, m6256, m6257, m6258, m6259, m6260, m6261, m6262, m6263, m6264, m6265, m6266, m6267, m6268, m6269, m6270, m6271, m6272, m6273, m6274, m6275, m6276, m6277, m6278, m6279, m6280, m6281, m6282, m6283, m6284, m6285, m6286, m6287, m6288, m6289, m6290, m6291, m6292, m6293, m6294, m6295, m6296, m6297, m6298, m6299, m6300, m6301, m6302, m6303, m6304, m6305, m6306, m6307, m6308, m6309, m6310, m6311, m6312, m6313, m6314, m6315, m6316, m6317, m6318, m6319, m6320, m6321, m6322, m6323, m6324, m6325, m6326, m6327, m6328, m6329, m6330, m6331, m6332, m6333, m6334, m6335, m6336, m6337, m6338, m6339, m6340, m6341, m6342, m6343, m6344, m6345, m6346, m6347, m6348, m6349, m6350, m6351, m6352, m6353, m6354, m6355, m6356, m6357, m6358, m6359, m6360, m6361, m6362, m6363, m6364, m6365, m6366, m6367, m6368, m6369, m6370, m6371, m6372, m6373, m6374, m6375, m6376, m6377, m6378, m6379, m6380, m6381, m6382, m6383, m6384, m6385, m6386, m6387, m6388, m6389, m6390, m6391, m6392, m6393, m6394, m6395, m6396, m6397, m6398, m6399, m6400, m6401, m6402, m6403, m6404, m6405, m6406, m6407, m6408, m6409, m6410, m6411, m6412, m6413, m6414, m6415, m6416, m6417, m6418, m6419, m6420, m6421, m6422, m6423, m6424, m6425, m6426, m6427, m6428, m6429, m6430, m6431, m6432, m6433, m6434, m6435, m6436, m6437, m6438, m6439, m6440, m6441, m6442, m6443, m6444, m3869, m4922, m4944, m6445, m6446, m6447, m6448, m6449, m6450, m6451, m6452, m6453, m6454, m6455, m6456, m6457, m6458, m6459, m6460, m6461, m6462, m6463, m6464, m6465, m6466, m6467, m6468, m6469, m6470, m6471, m6472, m6473, m6474, m6475, m6476, m6477, m6478, m6479, m3902, m6480, m6481, m6482, m6483, m6484, m6485, m6486, m4966, m6487, m6488, m6489, m4959, m4967, m4958, m6490, m6491, m6492, m6493, m6494, m6495, m6496, m6497, m6498, m4884, m6499, m6500, m6501, m6502, m6503, m6504, m4885, m6505, m3924, m6506, m6507, m6508, m6509, m6510, m6511, m6512, m6513, m6514, m6515, m6516, m6517, m6518, m6519, m6520, m6521, m3925, m4964, m6522, m6523, m6524, m6525, m6526, m6527, m6528, m6529, m6530, m6531, m6532, m6533, m6534, m6535, m4888, m6536, m6537, m6538, m6539, m6540, m6541, m6542, m6543, m6544, m6545, m6546, m6547, m6548, m6549, m6550, m6551, m6552, m6553, m6554, m6555, m6556, m6557, m6558, m6559, m6560, m6561, m6562, m6563, m6564, m6565, m6566, m6567, m6568, m6569, m6570, m6571, m6572, m6573, m6574, m6575, m6576, m6577, m6578, m6579, m3953, m6580, m6581, m4952, m6582, m4886, m6583, m4887, m4919, m6584, m4894, m6585, m6586, m6587, m6588, m6589, m6590, m6591, m6592, m6593, m6594, m6595, m6596, m6597, m6598, m6599, m6600, m6601, m6602, m6603, m6604, m6605, m6606, m6607, m6608, m6609, m6610, m6611, m6612, m6613, m6614, m6615, m6616, m6617, m6618, m6619, m6620, m6621, m6622, m6623, m6624, m6625, m6626, m6627, m6628, m4918, m6629, m6630, m6631, m6632, m6633, m6634, m6635, m6636, m6637, m6638, m6639, m6640, m6641, m6642, m6643, m6644, m6645, m6646, m6647, m6648, m6649, m6650, m6651, m6652, m6653, m6654, m6655, m6656, m6657, m6658, m6659, m6660, m6661, m4961, m6662, m6663, m6664, m6665, m6666, m6667, m6668, m6669, m6670, m6671, m6672, m6673, m6674, m6675, m6676, m6677, m6678, m6679, m6680, m6681, m6682, m6683, m6684, m6685, m6686, m6687, m6688, m6689, m6690, m6691, m2869, m6692, m6693, m6694, m6695, m6696, m6697, m6698, m6699, m6700, m6701, m6702, m6703, m6704, m6705, m6706, m6707, m6708, m6709, m6710, m6711, m6712, m6713, m6714, m6715, m6716, m6717, m6718, m6719, m6720, m6721, m6722, m6723, m6724, m6725, m6726, m6727, m6728, m6729, m6730, m6731, m6732, m6733, m6734, m6735, m6736, m6737, m6738, m6739, m6740, m6741, m6742, m6743, m6744, m6745, m6746, m6747, m6748, m6749, m6750, m6751, m6752, m6753, m3878, m3946, m3948, m6754, m6755, m6756, m6757, m6758, m6759, m6760, m6761, m6762, m6763, m6764, m6765, m6766, m6767, m6768, m6769, m6770, m6771, m6772, m6773, m6774, m6775, m6776, m6777, m6778, m6779, m6780, m6781, m6782, m6783, m6784, m6785, m6786, m6787, m6788, m6789, m6790, m6791, m6792, m6793, m6794, m6795, m6796, m6797, m6798, m6799, m6800, m6801, m6802, m6803, m6804, m6805, m6806, m6807, m6808, m6809, m6810, m6811, m6812, m6813, m6814, m6815, m6816, m6817, m6818, m6819, m6820, m6821, m6822, m6823, m6824, m6825, m6826, m6827, m6828, m6829, m6830, m6831, m6832, m6833, m6834, m6835, m6836, m6837, m6838, m6839, m6840, m6841, m6842, m6843, m6844, m6845, m6846, m6847, m6848, m6849, m6850, m6851, m6852, m6853, m6854, m6855, m6856, m6857, m6858, m6859, m6860, m6861, m6862, m6863, m6864, m6865, m6866, m6867, m6868, m6869, m6870, m6871, m6872, m6873, m6874, m6875, m6876, m6877, m6878, m6879, m6880, m6881, m6882, m6883, m6884, m6885, m6886, m6887, m6888, m6889, m6890, m6891, m6892, m6893, m6894, m6895, m6896, m6897, m6898, m6899, m6900, m6901, m6902, m6903, m6904, m6905, m6906, m6907, m6908, m6909, m6910, m6911, m6912, m6913, m6914, m6915, m6916, m6917, m3931, m6918, m3930, m6919, m3933, m6920, m6921, m6922, m6923, m6924, m6925, m6926, m6927, m6928, m6929, m6930, m6931, m6932, m6933, m6934, m6935, m6936, m3929, m6937, m6938, m6939, m6940, m6941, m6942, m6943, m6944, m6945, m6946, m6947, m6948, m6949, m6950, m6951, m6952, m6953, m6954, m6955, m6956, m6957, m6958, m6959, m6960, m6961, m6962, m6963, m6964, m6965, m6966, m6967, m6968, m6969, m6970, m6971, m6972, m6973, m6974, m6975, m6976, m6977, m6978, m6979, m6980, m6981, m6982, m6983, m6984, m6985, m6986, m6987, m6988, m6989, m6990, m6991, m6992, m6993, m6994, m6995, m6996, m6997, m6998, m6999, m7000, m7001, m3980, m7002, m7003, m3981, m3987, m3988, m7004, m7005, m7006, m7007, m7008, m7009, m7010, m7011, m7012, m7013, m7014, m7015, m7016, m7017, m7018, m7019, m7020, m7021, m7022, m7023, m7024, m7025, m7026, m7027, m7028, m7029, m7030, m7031, m7032, m7033, m7034, m7035, m7036, m7037, m7038, m7039, m7040, m7041, m7042, m7043, m7044, m7045, m7046, m7047, m7048, m7049, m7050, m3932, m7051, m7052, m7053, m7054, m7055, m7056, m7057, m7058, m7059, m7060, m7061, m7062, m7063, m7064, m7065, m7066, m7067, m3982, m7068, m7069, m3985, m3984, m7070, m7071, m7072, m7073, m7074, m7075, m7076, m7077, m7078, m7079, m7080, m7081, m7082, m7083, m7084, m7085, m7086, m7087, m7088, m7089, m7090, m7091, m7092, m7093, m7094, m7095, m7096, m7097, m7098, m7099, m7100, m7101, m7102, m7103, m7104, m7105, m7106, m7107, m7108, m7109, m7110, m7111, m7112, m7113, m7114, m7115, m7116, m7117, m7118, m7119, m7120, m7121, m7122, m7123, m7124, m7125, m7126, m7127, m7128, m7129, m7130, m7131, m7132, m7133, m7134, m7135, m7136, m7137, m7138, m7139, m7140, m7141, m7142, m7143, m7144, m7145, m7146, m7147, m7148, m7149, m7150, m7151, m7152, m7153, m7154, m7155, m7156, m7157, m7158, m7159, m7160, m7161, m7162, m7163, m7164, m7165, m7166, m7167, m7168, m7169, m7170, m7171, m7172, m7173, m7174, m7175, m7176, m7177, m7178, m7179, m7180, m7181, m7182, m7183, m7184, m7185, m7186, m7187, m7188, m7189, m7190, m7191, m7192, m7193, m7194, m7195, m7196, m7197, m7198, m7199, m7200, m7201, m7202, m7203, m7204, m7205, m7206, m7207, m7208, m7209, m7210, m7211, m7212, m7213, m7214, m7215, m7216, m7217, m7218, m7219, m7220, m7221, m7222, m7223, m7224, m7225, m7226, m7227, m7228, m7229, m7230, m7231, m7232, m7233, m7234, m7235, m7236, m7237, m7238, m7239, m7240, m7241, m7242, m7243, m7244, m7245, m7246, m7247, m7248, m7249, m7250, m7251, m7252, m7253, m7254, m7255, m7256, m7257, m7258, m7259, m7260, m7261, m7262, m7263, m7264, m7265, m7266, m7267, m7268, m7269, m7270, m7271, m7272, m7273, m7274, m7275, m7276, m7277, m7278, m7279, m7280, m7281, m7282, m7283, m7284, m7285, m7286, m7287, m7288, m7289, m7290, m7291, m7292, m7293, m7294, m7295, m7296, m7297, m7298, m7299, m7300, m7301, m7302, m7303, m7304, m7305, m7306, m7307, m7308, m7309, m7310, m7311, m7312, m7313, m7314, m7315, m7316, m7317, m7318, m7319, m7320, m7321, m7322, m7323, m7324, m7325, m7326, m7327, m7328, m7329, m7330, m7331, m7332, m7333, m7334, m7335, m7336, m7337, m7338, m7339, m7340, m7341, m7342, m7343, m7344, m7345, m7346, m7347, m7348, m7349, m7350, m7351, m7352, m7353, m7354, m7355, m7356, m7357, m7358, m7359, m7360, m7361, m7362, m7363, m7364, m7365, m7366, m7367, m7368, m7369, m7370, m7371, m7372, m7373, m7374, m7375, m7376, m7377, m7378, m7379, m7380, m7381, m7382, m7383, m7384, m7385, m7386, m7387, m7388, m7389, m7390, m7391, m7392, m7393, m7394, m7395, m7396, m7397, m7398, m7399, m7400, m7401, m7402, m7403, m7404, m7405, m7406, m7407, m7408, m7409, m7410, m7411, m7412, m7413, m7414, m7415, m7416, m7417, m7418, m7419, m7420, m7421, m7422, m7423, m7424, m7425, m7426, m7427, m7428, m7429, m7430, m7431, m7432, m7433, m7434, m7435, m7436, m7437, m7438, m7439, m7440, m7441, m7442, m7443, m7444, m7445, m7446, m7447, m7448, m7449, m7450, m7451, m7452, m7453, m7454, m7455, m7456, m7457, m7458, m7459, m7460, m7461, m7462, m7463, m7464, m7465, m7466, m7467, m7468, m7469, m7470, m7471, m7472, m7473, m7474, m7475, m7476, m7477, m7478, m7479, m7480, m7481, m7482, m7483, m7484, m7485, m7486, m7487, m7488, m7489, m7490, m7491, m7492, m7493, m7494, m7495, m7496, m7497, m7498, m7499, m7500, m7501, m7502, m7503, m7504, m7505, m7506, m7507, m7508, m7509, m7510, m7511, m7512, m7513, m7514, m7515, m7516, m7517, m7518, m7519, m7520, m7521, m7522, m7523, m7524, m7525, m7526, m7527, m7528, m7529, m7530, m7531, m7532, m7533, m7534, m7535, m7536, m7537, m7538, m7539, m7540, m7541, m7542, m7543, m7544, m7545, m7546, m7547, m7548, m7549, m7550, m7551, m7552, m2897, m7553, m7554, m7555, m7556, m7557, m7558, m7559, m7560, m7561, m7562, m7563, m7564, m7565, m7566, m7567, m7568, m7569, m7570, m7571, m7572, m7573, m7574, m7575, m7576, m7577, m7578, m7579, m7580, m7581, m7582, m7583, m7584, m7585, m7586, m7587, m7588, m7589, m7590, m7591, m7592, m7593, m7594, m7595, m7596, m7597, m7598, m7599, m7600, m7601, m7602, m7603, m7604, m7605, m7606, m7607, m7608, m7609, m7610, m7611, m7612, m7613, m7614, m7615, m7616, m7617, m7618, m7619, m7620, m7621, m7622, m7623, m7624, m7625, m7626, m7627, m7628, m7629, m7630, m7631, m7632, m7633, m7634, m7635, m7636, m7637, m7638, m7639, m7640, m7641, m7642, m7643, m7644, m7645, m7646, m7647, m7648, m7649, m7650, m7651, m7652, m7653, m7654, m7655, m7656, m7657, m7658, m7659, m7660, m7661, m7662, m7663, m7664, m7665, m7666, m7667, m7668, m7669, m7670, m7671, m7672, m7673, m7674, m7675, m7676, m7677, m7678, m7679, m7680, m7681, m7682, m7683, m7684, m7685, m7686, m7687, m7688, m7689, m7690, m7691, m7692, m7693, m7694, m7695, m7696, m7697, m7698, m7699, m7700, m7701, m7702, m7703, m7704, m7705, m7706, m7707, m7708, m7709, m7710, m7711, m7712, m7713, m7714, m7715, m7716, m7717, m7718, m7719, m7720, m7721, m7722, m7723, m7724, m7725, m7726, m7727, m7728, m7729, m7730, m7731, m7732, m7733, m7734, m7735, m7736, m7737, m7738, m7739, m7740, m7741, m7742, m7743, m7744, m7745, m7746, m7747, m7748, m7749, m7750, m7751, m7752, m7753, m7754, m7755, m7756, m7757, m7758, m7759, m7760, m7761, m7762, m7763, m7764, m7765, m7766, m7767, m7768, m7769, m7770, m7771, m7772, m7773, m7774, m7775, m7776, m7777, m7778, m7779, m7780, m7781, m7782, m7783, m7784, m7785, m7786, m7787, m7788, m7789, m7790, m7791, m7792, m7793, m7794, m7795, m7796, m7797, m7798, m7799, m7800, m7801, m7802, m7803, m7804, m7805, m7806, m7807, m7808, m7809, m7810, m7811, m7812, m7813, m7814, m7815, m7816, m7817, m7818, m7819, m7820, m7821, m7822, m7823, m7824, m7825, m7826, m7827, m7828, m7829, m7830, m7831, m7832, m7833, m7834, m7835, m7836, m7837, m7838, m7839, m7840, m7841, m7842, m7843, m7844, m7845, m7846, m7847, m7848, m7849, m7850, m7851, m7852, m7853, m7854, m7855, m7856, m7857, m7858, m7859, m7860, m7861, m7862, m7863, m7864, m7865, m7866, m7867, m7868, m7869, m7870, m7871, m7872, m7873, m7874, m7875, m7876, m7877, m7878, m7879, m7880, m7881, m7882, m7883, m7884, m7885, m7886, m7887, m7888, m7889, m7890, m7891, m7892, m7893, m7894, m7895, m7896, m7897, m7898, m7899, m7900, m7901, m7902, m7903, m7904, m7905, m7906, m7907, m7908, m7909, m7910, m7911, m7912, m7913, m7914, m7915, m7916, m7917, m7918, m7919, m7920, m7921, m7922, m7923, m7924, m7925, m7926, m7927, m7928, m7929, m7930, m7931, m7932, m7933, m7934, m7935, m7936, m7937, m7938, m7939, m7940, m7941, m7942, m7943, m7944, m7945, m7946, m7947, m7948, m7949, m7950, m7951, m7952, m7953, m7954, m7955, m7956, m7957, m7958, m7959, m7960, m7961, m7962, m7963, m7964, m7965, m7966, m7967, m7968, m7969, m7970, m7971, m7972, m7973, m7974, m7975, m7976, m7977, m7978, m7979, m7980, m7981, m7982, m7983, m7984, m7985, m7986, m7987, m7988, m7989, m7990, m7991, m7992, m7993, m7994, m7995, m7996, m7997, m7998, m7999, m8000, m8001, m8002, m8003, m8004, m8005, m8006, m8007, m8008, m8009, m8010, m8011, m8012, m8013, m8014, m8015, m8016, m8017, m8018, m8019, m8020, m8021, m8022, m8023, m8024, m8025, m8026, m8027, m8028, m8029, m8030, m8031, m8032, m8033, m8034, m8035, m8036, m8037, m8038, m8039, m8040, m8041, m8042, m8043, m8044, m8045, m8046, m8047, m8048, m8049, m8050, m8051, m8052, m8053, m8054, m8055, m8056, m8057, m8058, m8059, m8060, m8061, m8062, m8063, m8064, m8065, m8066, m8067, m8068, m8069, m8070, m8071, m8072, m8073, m8074, m8075, m8076, m8077, m8078, m8079, m8080, m8081, m8082, m8083, m8084, m8085, m8086, m8087, m8088, m8089, m8090, m8091, m8092, m8093, m8094, m8095, m8096, m8097, m8098, m8099, m8100, m8101, m8102, m8103, m8104, m8105, m8106, m8107, m8108, m8109, m8110, m8111, m8112, m8113, m8114, m8115, m8116, m8117, m8118, m8119, m8120, m8121, m8122, m8123, m8124, m8125, m8126, m8127, m8128, m8129, m8130, m8131, m8132, m8133, m8134, m8135, m8136, m8137, m8138, m8139, m8140, m8141, m8142, m8143, m8144, m8145, m8146, m8147, m8148, m8149, m8150, m8151, m8152, m8153, m8154, m8155, m8156, m8157, m8158, m8159, m8160, m8161, m8162, m8163, m8164, m8165, m8166, m8167, m8168, m8169, m8170, m8171, m8172, m8173, m8174, m8175, m8176, m8177, m8178, m8179, m8180, m8181, m8182, m8183, m8184, m8185, m8186, m8187, m8188, m8189, m8190, m8191, m8192, m8193, m8194, m8195, m8196, m8197, m8198, m8199, m8200, m8201, m8202, m8203, m8204, m8205, m8206, m8207, m8208, m8209, m8210, m8211, m8212, m8213, m8214, m8215, m8216, m8217, m8218, m8219, m8220, m8221, m8222, m8223, m8224, m8225, m8226, m8227, m8228, m8229, m8230, m8231, m8232, m8233, m8234, m8235, m8236, m8237, m8238, m8239, m8240, m8241, m8242, m8243, m8244, m8245, m8246, m8247, m8248, m8249, m8250, m8251, m8252, m8253, m8254, m8255, m8256, m8257, m8258, m8259, m8260, m8261, m8262, m8263, m8264, m8265, m8266, m8267, m8268, m8269, m8270, m8271, m8272, m8273, m8274, m8275, m8276, m8277, m8278, m8279, m8280, m8281, m8282, m8283, m8284, m8285, m8286, m8287, m8288, m8289, m8290, m8291, m8292, m8293, m8294, m8295, m8296, m8297, m8298, m8299, m8300, m8301, m8302, m8303, m8304, m8305, m8306, m8307, m8308, m8309, m8310, m8311, m8312, m8313, m8314, m8315, m8316, m8317, m8318, m8319, m8320, m8321, m8322, m8323, m8324, m8325, m8326, m8327, m8328, m8329, m8330, m8331, m8332, m8333, m8334, m8335, m8336, m8337, m8338, m8339, m8340, m8341, m8342, m8343, m8344, m8345, m8346, m8347, m8348, m8349, m8350, m8351, m8352, m8353, m8354, m8355, m8356, m8357, m8358, m8359, m8360, m8361, m8362, m8363, m8364, m8365, m8366, m8367, m8368, m8369, m8370, m8371, m8372, m8373, m8374, m8375, m8376, m8377, m8378, m8379, m8380, m8381, m8382, m8383, m8384, m8385, m8386, m8387, m8388, m8389, m8390, m8391, m8392, m8393, m8394, m8395, m8396, m8397, m8398, m8399, m8400, m8401, m8402, m8403, m8404, m8405, m8406, m8407, m8408, m8409, m8410, m8411, m8412, m8413, m8414, m8415, m8416, m8417, m8418, m8419, m8420, m8421, m8422, m8423, m8424, m8425, m8426, m8427, m8428, m8429, m8430, m4899, m8431, m8432, m4895, m4898, m8433, m8434, m8435, m4897, m4896, m8436, m8437, m4906, m8438, m3922, m4900, m8439, m4905, m4904, m4903, m8440, m8441, m8442, m8443, m8444, m8445, m8446, m8447, m8448, m8449, m8450, m8451, m8452, m3983, m4932, m8453, m8454, m8455, m8456, m8457, m8458, m4934, m8459, m8460, m8461, m8462, m8463, m8464, m8465, m8466, m4937, m4939, m4938, m8467, m4935, m4936, m8468, m8469, m3896, m3895, m3992, m8470, m8471, m3976, m3977, m8472, m8473, m8474, m3887, m4945, m3888, m3876, m8475, m8476, m2959, m3910, m2968, m8477, m8478, m3941, m8479, m3890, m8480, m8481, m8482, m8483, m3891, m8484, m8485, m3942, m8486, m8487, m8488, m8489, m8490, m8491, m8492, m8493, m8494, m8495, m8496, m8497, m8498, m8499, m8500, m8501, m8502, m8503, m8504, m8505, m3893, m8506, m8507, m8508, m8509, m8510, m3912, m8511, m8512, m8513, m8514, m4926, m8515, m8516, m8517, m8518, m8519, m8520, m8521, m3920, m8522, m8523, m8524, m8525, m8526, m8527, m8528, m8529, m8530, m8531, m8532, m8533, m8534, m8535, m8536, m8537, m8538, m8539, m8540, m3905, m8541, m8542, m8543, m8544, m8545, m8546, m8547, m8548, m8549, m8550, m8551, m8552, m8553, m8554, m8555, m8556, m8557, m3886, m8558, m8559, m3927, m3899, m3898, m8560, m8561, m8562, m8563, m8564, m2970, m8565, m8566, m8567, m8568, m8569, m3940, m8570, m8571, m8572, m8573, m8574, m8575, m8576, m8577, m8578, m8579, m8580, m8581, m8582, m3913, m8583, m8584, m8585, m8586, m8587, m8588, m8589, m8590, m8591, m8592, m8593, m8594, m3943, m8595, m8596, m8597, m8598, m8599, m8600, m8601, m8602, m8603, m8604, m8605, m8606, m8607, m8608, m8609, m8610, m8611, m8612, m8613, m8614, m8615, m8616, m8617, m8618, m8619, m8620, m8621, m8622, m8623, m8624, m8625, m8626, m8627, m8628, m8629, m8630, m8631, m8632, m8633, m8634, m8635, m8636, m8637, m8638, m8639, m8640, m8641, m8642, m3894, m3889, m8643, m8644, m8645, m8646, m8647, m3892, m3916, m8648, m8649, m8650, m8651, m4925, m8652, m8653, m8654, m8655, m8656, m8657, m3991, m8658, m8659, m8660, m3921, m8661, m8662, m8663, m8664, m8665, m8666, m8667, m8668, m2958, m8669, m8670, m3945, m8671, m8672, m8673, m8674, m8675, m8676, m8677, m8678, m8679, m8680, m8681, m8682, m8683, m8684, m8685, m8686, m8687, m8688, m8689, m8690, m8691, m8692, m8693, m3914, m8694, m8695, m8696, m8697, m8698, m8699, m8700, m8701, m8702, m8703, m8704, m8705, m8706, m8707, m8708, m8709, m8710, m8711, m8712, m8713, m8714, m3915, m8715, m8716, m8717, m8718, m8719, m8720, m8721, m8722, m8723, m8724, m8725, m8726, m8727, m8728, m8729, m8730, m8731, m8732, m8733, m8734, m8735, m8736, m8737, m8738, m8739, m8740, m8741, m8742, m8743, m8744, m8745, m8746, m8747, m8748, m8749, m8750, m8751, m8752, m8753, m8754, m8755, m8756, m8757, m8758, m8759, m8760, m8761, m2969, m8762, m3884, m3904, m2977, m8763, m8764, m8765, m2971, m2972, m2973, m2974, m2975, m2976, m8766, m8767, m8768, m8769, m8770, m8771, m8772, m3903, m8773, m8774, m8775, m8776, m8777, m8778, m8779, m8780, m8781, m8782, m8783, m8784, m8785, m8786, m3944, m8787, m8788, m8789, m8790, m8791, m8792, m8793, m8794, m8795, m8796, m8797, m8798, m8799, m8800, m8801, m8802, m8803, m8804, m8805, m8806, m8807, m8808, m8809, m8810, m8811, m8812, m8813, m8814, m8815, m8816, m8817, m8818, m8819, m8820, m8821, m8822, m8823, m8824, m8825, m8826, m8827, m8828, m8829, m8830, m8831, m8832, m8833, m8834, m8835, m8836, m8837, m8838, m8839, m8840, m8841, m8842, m8843, m8844, m8845, m8846, m8847, m8848, m8849, m8850, m8851, m8852, m8853, m8854, m8855, m8856, m8857, m8858, m8859, m8860, m8861, m8862, m8863, m8864, m8865, m8866, m8867, m8868, m8869, m8870, m8871, m8872, m8873, m8874, m8875, m8876, m8877, m8878, m8879, m8880, m8881, m8882, m8883, m8884, m8885, m8886, m8887, m8888, m8889, m8890, m8891, m8892, m8893, m8894, m8895, m8896, m8897, m8898, m8899, m8900, m8901, m8902, m8903, m8904, m8905, m8906, m8907, m8908, m8909, m8910, m8911, m8912, m8913, m8914, m8915, m8916, m8917, m8918, m8919, m8920, m8921, m8922, m8923, m8924, m8925, m8926, m8927, m8928, m8929, m8930, m8931, m8932, m8933, m8934, m8935, m8936, m8937, m8938, m8939, m8940, m8941, m8942, m8943, m8944, m8945, m8946, m8947, m8948, m8949, m8950, m8951, m8952, m8953, m8954, m8955, m8956, m8957, m8958, m8959, m8960, m8961, m8962, m8963, m8964, m8965, m8966, m8967, m8968, m8969, m8970, m8971, m8972, m8973, m8974, m8975, m8976, m8977, m8978, m8979, m8980, m8981, m8982, m8983, m8984, m8985, m8986, m8987, m8988, m8989, m8990, m8991, m8992, m8993, m8994, m8995, m8996, m8997, m8998, m8999, m9000, m9001, m9002, m9003, m9004, m9005, m9006, m3881, m3900, m9007, m9008, m9009, m3907, m3908, m9010, m9011, m9012, m9013, m9014, m9015, m9016, m9017, m9018, m9019, m9020, m9021, m9022, m9023, m9024, m9025, m9026, m9027, m9028, m9029, m9030, m9031, m1468, m2872, m1533, m4901, m9032, m9033, m9034, m9035, m3938, m4973, m9036, m9037, m1472, m9038, m9039, m9040, m9041, m2875, m4931, m4914, m4902, m3906, m9042, m9043, m4948, m1471, m1470, m3874, m9044, m3873, m3872, m4940, m9045, m9046, m9047, m9048, m9049, m9050, m9051, m9052, m9053, m9054, m9055, m9056, m9057, m9058, m9059, m9060, m9061, m9062, m9063, m9064, m9065, m9066, m9067, m9068, m9069, m9070, m9071, m9072, m9073, m9074, m9075, m9076, m9077, m9078, m9079, m9080, m9081, m9082, m9083, m9084, m9085, m9086, m9087, m9088, m9089, m9090, m9091, m9092, m9093, m9094, m9095, m9096, m9097, m9098, m9099, m9100, m9101, m9102, m9103, m9104, m9105, m9106, m9107, m9108, m9109, m9110, m9111, m9112, m9113, m9114, m9115, m9116, m9117, m9118, m9119, m9120, m9121, m9122, m9123, m9124, m9125, m9126, m9127, m9128, m9129, m9130, m9131, m9132, m9133, m9134, m9135, m9136, m9137, m9138, m9139, m9140, m9141, m9142, m9143, m9144, m9145, m9146, m9147, m9148, m9149, m9150, m9151, m9152, m3973, m3971, m9153, m9154, m9155, m9156, m9157, m9158, m9159, m9160, m9161, m9162, m2850, m3970, m3954, m3956, m9163, m9164, m9165, m9166, m9167, m9168, m9169, m9170, m9171, m9172, m9173, m9174, m9175, m9176, m9177, m9178, m9179, m9180, m9181, m9182, m9183, m9184, m9185, m9186, m9187, m9188, m9189, m9190, m9191, m9192, m9193, m9194, m9195, m9196, m9197, m9198, m9199, m9200, m9201, m9202, m9203, m9204, m9205, m9206, m9207, m9208, m9209, m9210, m9211, m9212, m9213, m9214, m9215, m9216, m9217, m9218, m9219, m9220, m9221, m9222, m9223, m9224, m9225, m9226, m9227, m9228, m9229, m9230, m9231, m9232, m9233, m9234, m9235, m9236, m9237, m9238, m9239, m9240, m9241, m9242, m9243, m9244, m9245, m9246, m9247, m9248, m9249, m9250, m9251, m9252, m4924, m9253, m9254, m9255, m9256, m9257, m9258, m9259, m9260, m9261, m9262, m9263, m9264, m9265, m9266, m9267, m9268, m9269, m9270, m9271, m9272, m9273, m9274, m9275, m2010, m4943, m2966, m9276, m9277, m9278, m9279, m9280, m9281, m2890, m4889, m9282, m4947, m3867, m2965, m9283, m9284, m9285, m9286, m9287, m3866, m9288, m9289, m9290, m9291, m9292, m9293, m9294, m9295, m9296, m9297, m9298, m9299, m3955, m9300, m9301, m2961, m9302, m9303, m9304, m9305, m9306, m9307, m9308, m9309, m9310, m9311, m9312, m4965, m9313, m9314, m9315, m9316, m9317, m9318, m9319, m3923, m3897, m9320, m9321, m9322, m9323, m9324, m9325, m9326, m9327, m9328, m9329, m9330, m9331, m9332, m9333, m9334, m9335, m9336, m9337, m9338, m9339, m9340, m9341, m9342, m9343, m9344, m9345, m9346, m9347, m9348, m9349, m3928, m9350, m9351, m9352, m9353, m9354, m9355, m9356, m9357, m9358, m9359, m9360, m9361, m9362, m9363, m9364, m9365, m9366, m9367, m9368, m9369, m9370, m9371, m9372, m9373, m9374, m9375, m9376, m9377, m9378, m9379, m9380, m9381, m9382, m9383, m9384, m9385, m9386, m9387, m9388, m9389, m9390, m9391, m9392, m9393, m9394, m9395, m9396, m9397, m9398, m9399, m9400, m9401, m9402, m9403, m9404, m9405, m9406, m3882, m9407, m9408, m9409, m9410, m9411, m9412, m9413, m9414, m9415, m9416, m9417, m9418, m9419, m9420, m9421, m9422, m9423, m9424, m9425, m3937, m9426, m9427, m9428, m9429, m9430, m9431, m9432, m9433, m9434, m9435, m9436, m9437, m9438, m9439, m9440, m9441, m9442, m9443, m9444, m9445, m9446, m9447, m9448, m9449, m9450, m9451, m9452, m9453, m9454, m9455, m9456, m9457, m9458, m9459, m9460, m9461, m9462, m9463, m9464, m9465, m9466, m9467, m9468, m9469, m9470, m9471, m9472, m9473, m9474, m9475, m9476, m9477, m9478, m9479, m9480, m9481, m9482, m9483, m9484, m9485, m9486, m9487, m9488, m9489, m9490, m9491, m9492, m9493, m9494, m9495, m9496, m9497, m9498, m9499, m9500, m9501, m9502, m9503, m9504, m9505, m9506, m9507, m9508, m9509, m9510, m9511, m9512, m9513, m9514, m9515, m9516, m9517, m9518, m9519, m9520, m9521, m9522, m9523, m9524, m9525, m9526, m9527, m9528, m9529, m9530, m9531, m9532, m9533, m9534, m9535, m9536, m9537, m9538, m9539, m9540, m9541, m9542, m9543, m9544, m9545, m9546, m9547, m9548, m9549, m9550, m9551, m9552, m9553, m9554, m9555, m9556, m9557, m9558, m9559, m9560, m9561, m9562, m9563, m9564, m9565, m9566, m9567, m9568, m9569, m4915, m3957, m9570, m3917, m9571, m9572, m9573, m9574, m4916, m3952, m9575, m9576, m9577, m9578, m9579, m9580, m9581, m9582, m9583, m9584, m9585, m9586, m9587, m9588, m9589, m9590, m9591, m9592, m9593, m9594, m9595, m9596, m9597, m3883, m9598, m9599, m9600, m9601, m9602, m9603, m9604, m4933, m9605, m9606, m9607, m3918, m4917, m9608, m4942, m3919, m9609, m9610, m9611, m9612, m9613, m9614, m9615, m9616, m9617, m9618, m9619, m9620, m9621, m9622, m9623, m9624, m9625, m9626, m9627, m9628, m9629, m9630, m9631, m9632, m9633, m9634, m9635, m9636, m9637, m9638, m9639, m9640, m9641, m9642, m9643, m9644, m9645, m9646, m9647, m9648, m9649, m9650, m9651, m9652, m9653, m9654, m9655, m9656, m9657, m9658, m9659, m9660, m9661, m9662, m9663, m3871, m9664, m9665, m9666, m9667, m3950, m9668, m3934, m9669, m9670, m9671, m9672, m9673, m9674, m9675, m9676, m9677, m9678, m9679, m9680, m9681, m9682, m3877, m4975, m2962, m9683, m9684, m9685, m9686, m9687, m9688, m9689, m9690, m9691, m9692, m9693, m9694, m9695, m9696, m9697, m9698, m9699, m9700, m9701, m9702, m9703, m9704, m2848, m9705, m9706, m9707, m9708, m4892, m3947, m9709, m9710, m9711, m9712, m9713, m9714, m9715, m9716, m9717, m9718, m2851, m2861, m2960, m9719, m9720, m9721, m9722, m9723, m9724, m9725, m9726, m9727, m9728, m9729, m9730, m9731, m9732, m9733, m9734, m9735, m9736, m9737, m9738, m9739, m9740, m9741, m9742, m9743, m9744, m9745, m9746, m9747, m9748, m9749, m9750, m9751, m9752, m9753, m9754, m9755, m9756, m9757, m9758, m9759, m9760, m9761, m9762, m9763, m9764, m9765, m9766, m9767, m9768, m9769, m9770, m9771, m9772, m9773, m9774, m9775, m9776, m9777, m9778, m9779, m9780, m9781, m9782, m9783, m9784, m9785, m9786, m9787, m9788, m9789, m9790, m9791, m9792, m9793, m9794, m9795, m9796, m9797, m9798, m9799, m9800, m9801, m9802, m9803, m9804, m9805, m9806, m9807, m9808, m9809, m9810, m9811, m9812, m9813, m9814, m9815, m9816, m9817, m9818, m9819, m9820, m2964, m9821, m1600, m3868, m9822, m9823, m2841, m9824, m9825, m9826, m9827, m9828, m9829, m9830, m9831, m9832, m9833, m9834, m9835, m9836, m9837, m9838, m9839, m9840, m9841, m9842, m9843, m9844, m9845, m9846, m9847, m9848, m9849, m9850, m9851, m9852, m9853, m9854, m9855, m9856, m9857, m9858, m9859, m9860, m9861, m9862, m9863, m9864, m9865, m9866, m9867, m9868, m9869, m9870, m9871, m9872, m9873, m9874, m9875, m9876, m9877, m9878, m9879, m9880, m9881, m9882, m9883, m9884, m9885, m9886, m9887, m9888, m9889, m9890, m9891, m9892, m9893, m9894, m9895, m9896, m9897, m9898, m9899, m9900, m9901, m9902, m9903, m9904, m9905, m9906, m9907, m9908, m9909, m9910, m9911, m9912, m9913, m9914, m9915, m9916, m9917, m9918, m9919, m9920, m9921, m9922, m2967, m9923, m9924, m9925, m9926, m9927, m9928, m9929, m9930, m9931, m9932, m9933, m9934, m9935, m9936, m9937, m9938, m9939, m9940, m9941, m9942, m9943, m9944, m9945, m9946, m9947, m9948, m4920, m9949, m9950, m9951, m9952, m9953, m9954, m9955, m9956, m9957, m9958, m9959, m9960, m4949, m9961, m9962, m9963, m9964, m9965, m9966, m9967, m9968, m9969, m9970, m9971, m9972, m9973, m9974, m9975, m9976, m9977, m9978, m9979, m9980, m9981, m9982, m9983, m9984, m9985, m9986, m9987, m9988, m9989, m9990, m9991, m9992, m9993, m9994, m9995, m9996, m9997, m9998, m9999, m10000, m10001, m10002, m10003, m10004, m10005, m10006, m10007, m10008, m10009, m10010, m10011, m10012, m10013, m10014, m10015, m10016, m10017, m10018, m10019, m10020, m10021, m10022, m10023, m10024, m10025, m10026, m10027, m10028, m10029, m10030, m10031, m10032, m10033, m10034, m10035, m10036, m10037, m10038, m10039, m10040, m10041, m10042, m4907, m10043, m10044, m10045, m10046, m10047, m10048, m10049, m10050, m10051, m10052, m10053, m10054, m10055, m10056, m10057, m10058, m10059, m10060, m10061, m10062, m10063, m10064, m10065, m10066, m10067, m10068, m10069, m10070, m10071, m10072, m10073, m10074, m10075, m10076, m10077, m10078, m10079, m10080, m10081, m10082, m10083, m10084, m10085, m10086, m10087, m10088, m10089, m10090, m10091, m10092, m10093, m10094, m10095, m10096, m10097, m10098, m10099, m10100, m10101, m10102, m10103, m10104, m10105, m10106, m10107, m10108, m10109, m10110, m10111, m10112, m10113, m10114, m10115, m10116, m10117, m10118, m10119, m10120, };

[ "1jeffcohen@gmail.com" ]

1jeffcohen@gmail.com

d2f05fc84fd214b91c0891962f8839a8a21ec26d

3d97b8349f2bf779befde639a9e91112955a1d6e

/src/type_info.cc

50cfef5d4d1f985851693db2248634a51dedffe2

[]

no_license

bmax/v9

5090ba530403f4fb810da73fbd3aa18529c0dad8

74e0cc8802dc35c8e378be9812209f42e138feb0

refs/heads/master

2021-01-15T15:23:34.772969

2015-04-16T23:52:58

34,086,713

6

3

null

2015-04-16T23:51:42

null

UTF-8

C++

false

410

cc

#include "type_info.h" namespace Type { std::string AsString(int type) { switch (type) { case VOID: return "void"; case NUMBER: return "number"; case BOOL: return "bool"; case STRING: return "string"; case OBJECT: return "object"; case ARRAY: return "array"; case REFERENCE: return "reference"; case NLL: return "null"; } return "unknown"; } };

[ "curljosh@msu.edu" ]

curljosh@msu.edu

5df6301abaee87d400da1f766a2df6445e7c3995

497c5bc5df53028a9cbb38522350aac3b581f8c3

/message/generation/swift-mt-generation/repository/SR2018/parsers/SwiftMtParser_MT942BaseListener.h

1dd0ecc389443bc4d858e242bc76f43770de637b

[ "MIT" ]

permissive

Yanick-Salzmann/message-converter-c

188f6474160badecfd245a4fefa20a7c8ad9ca0c

6dfdf56e12f19e0f0b63ee0354fda16968f36415

refs/heads/master

2020-06-25T11:54:12.874635

2019-08-19T19:32:41

199,298,618

0

null

UTF-8

C++

false

3,441

h

#include "repository/ISwiftMtParser.h" #include "SwiftMtMessage.pb.h" #include <vector> #include <string> #include "BaseErrorListener.h" #include "SwiftMtParser_MT942Lexer.h" // Generated from C:/programming/message-converter-c/message/generation/swift-mt-generation/repository/SR2018/grammars/SwiftMtParser_MT942.g4 by ANTLR 4.7.2 #pragma once #include "antlr4-runtime.h" #include "SwiftMtParser_MT942Listener.h" namespace message::definition::swift::mt::parsers::sr2018 { /** * This class provides an empty implementation of SwiftMtParser_MT942Listener, * which can be extended to create a listener which only needs to handle a subset * of the available methods. */ class SwiftMtParser_MT942BaseListener : public SwiftMtParser_MT942Listener { public: virtual void enterMessage(SwiftMtParser_MT942Parser::MessageContext * /*ctx*/) override { } virtual void exitMessage(SwiftMtParser_MT942Parser::MessageContext * /*ctx*/) override { } virtual void enterBh(SwiftMtParser_MT942Parser::BhContext * /*ctx*/) override { } virtual void exitBh(SwiftMtParser_MT942Parser::BhContext * /*ctx*/) override { } virtual void enterBh_content(SwiftMtParser_MT942Parser::Bh_contentContext * /*ctx*/) override { } virtual void exitBh_content(SwiftMtParser_MT942Parser::Bh_contentContext * /*ctx*/) override { } virtual void enterAh(SwiftMtParser_MT942Parser::AhContext * /*ctx*/) override { } virtual void exitAh(SwiftMtParser_MT942Parser::AhContext * /*ctx*/) override { } virtual void enterAh_content(SwiftMtParser_MT942Parser::Ah_contentContext * /*ctx*/) override { } virtual void exitAh_content(SwiftMtParser_MT942Parser::Ah_contentContext * /*ctx*/) override { } virtual void enterUh(SwiftMtParser_MT942Parser::UhContext * /*ctx*/) override { } virtual void exitUh(SwiftMtParser_MT942Parser::UhContext * /*ctx*/) override { } virtual void enterTr(SwiftMtParser_MT942Parser::TrContext * /*ctx*/) override { } virtual void exitTr(SwiftMtParser_MT942Parser::TrContext * /*ctx*/) override { } virtual void enterSys_block(SwiftMtParser_MT942Parser::Sys_blockContext * /*ctx*/) override { } virtual void exitSys_block(SwiftMtParser_MT942Parser::Sys_blockContext * /*ctx*/) override { } virtual void enterSys_element(SwiftMtParser_MT942Parser::Sys_elementContext * /*ctx*/) override { } virtual void exitSys_element(SwiftMtParser_MT942Parser::Sys_elementContext * /*ctx*/) override { } virtual void enterSys_element_key(SwiftMtParser_MT942Parser::Sys_element_keyContext * /*ctx*/) override { } virtual void exitSys_element_key(SwiftMtParser_MT942Parser::Sys_element_keyContext * /*ctx*/) override { } virtual void enterSys_element_content(SwiftMtParser_MT942Parser::Sys_element_contentContext * /*ctx*/) override { } virtual void exitSys_element_content(SwiftMtParser_MT942Parser::Sys_element_contentContext * /*ctx*/) override { } virtual void enterMt(SwiftMtParser_MT942Parser::MtContext * /*ctx*/) override { } virtual void exitMt(SwiftMtParser_MT942Parser::MtContext * /*ctx*/) override { } virtual void enterEveryRule(antlr4::ParserRuleContext * /*ctx*/) override { } virtual void exitEveryRule(antlr4::ParserRuleContext * /*ctx*/) override { } virtual void visitTerminal(antlr4::tree::TerminalNode * /*node*/) override { } virtual void visitErrorNode(antlr4::tree::ErrorNode * /*node*/) override { } }; } // namespace message::definition::swift::mt::parsers::sr2018

[ "yanick.salzmann@gmail.com" ]

yanick.salzmann@gmail.com

6768f727952da58af6d33fadd937ddeedb439e1d

30098f72d82cf4bf754af89ce1bc3ebfd9d2a0fa

/MyClass/HitStop/HitStop.h

cc646534e66479e2f54f7be79654754afdbd81d7

[]

no_license

GlanzH/QuantumAccelerator

cc968d0493ec661676c345d73f395b6a36f5ea4c

10a72aeb8c44fde26591a87ccb7fa472506c978b

refs/heads/main

2023-04-30T10:14:21.358694

2021-05-28T00:25:37

null

0

null

SHIFT_JIS

C++

false

553

h

#pragma once #include "../C_OBJECT/Object.h" //ヒットストップ class HitStop : public Object { private: //ヒットストップ残り時間 int _count = 0; //止める対象 Object* p_taget; public: //初期化 void HitStop::Init(); //更新 void HitStop::Update(); //ヒットストップ値設定 void HitStop::SetStopCount(int damage); //ヒットストップ中か bool HitStop::IsStop(); //対象指定 void HitStop::SetTaget(Object* taget) { p_taget = taget; }; };

[ "noreply@github.com" ]

GlanzH.noreply@github.com

32b0e1c772f5d135a18746a3b0ad4789ae7e2720

38c10c01007624cd2056884f25e0d6ab85442194

/v8/src/ic/handler-compiler.cc

077a3a9a6d7e2d0043291a7ee7d890e7d2079263

[ "BSD-3-Clause", "bzip2-1.0.6" ]

permissive

zenoalbisser/chromium

6ecf37b6c030c84f1b26282bc4ef95769c62a9b2

e71f21b9b4b9b839f5093301974a45545dad2691

refs/heads/master

2022-12-25T14:23:18.568575

2016-07-14T21:49:52

2016-07-23T08:02:51

63,980,627

0

2

BSD-3-Clause

2022-12-12T12:43:41

2016-07-22T20:14:04

null

UTF-8

C++

false

22,919

cc

// Copyright 2014 the V8 project 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 "src/ic/handler-compiler.h" #include "src/ic/call-optimization.h" #include "src/ic/ic.h" #include "src/ic/ic-inl.h" #include "src/isolate-inl.h" #include "src/profiler/cpu-profiler.h" namespace v8 { namespace internal { Handle<Code> PropertyHandlerCompiler::Find(Handle<Name> name, Handle<Map> stub_holder, Code::Kind kind, CacheHolderFlag cache_holder, Code::StubType type) { Code::Flags flags = Code::ComputeHandlerFlags(kind, type, cache_holder); Object* probe = stub_holder->FindInCodeCache(*name, flags); if (probe->IsCode()) return handle(Code::cast(probe)); return Handle<Code>::null(); } Handle<Code> NamedLoadHandlerCompiler::ComputeLoadNonexistent( Handle<Name> name, Handle<Map> receiver_map) { Isolate* isolate = name->GetIsolate(); if (receiver_map->prototype()->IsNull()) { // TODO(jkummerow/verwaest): If there is no prototype and the property // is nonexistent, introduce a builtin to handle this (fast properties // -> return undefined, dictionary properties -> do negative lookup). return Handle<Code>(); } CacheHolderFlag flag; Handle<Map> stub_holder_map = IC::GetHandlerCacheHolder(receiver_map, false, isolate, &flag); // If no dictionary mode objects are present in the prototype chain, the load // nonexistent IC stub can be shared for all names for a given map and we use // the empty string for the map cache in that case. If there are dictionary // mode objects involved, we need to do negative lookups in the stub and // therefore the stub will be specific to the name. Handle<Name> cache_name = receiver_map->is_dictionary_map() ? name : Handle<Name>::cast(isolate->factory()->nonexistent_symbol()); Handle<Map> current_map = stub_holder_map; Handle<JSObject> last(JSObject::cast(receiver_map->prototype())); while (true) { if (current_map->is_dictionary_map()) cache_name = name; if (current_map->prototype()->IsNull()) break; if (name->IsPrivate()) { // TODO(verwaest): Use nonexistent_private_symbol. cache_name = name; JSReceiver* prototype = JSReceiver::cast(current_map->prototype()); if (!prototype->map()->is_hidden_prototype() && !prototype->map()->IsGlobalObjectMap()) { break; } } last = handle(JSObject::cast(current_map->prototype())); current_map = handle(last->map()); } // Compile the stub that is either shared for all names or // name specific if there are global objects involved. Handle<Code> handler = PropertyHandlerCompiler::Find( cache_name, stub_holder_map, Code::LOAD_IC, flag, Code::FAST); if (!handler.is_null()) return handler; NamedLoadHandlerCompiler compiler(isolate, receiver_map, last, flag); handler = compiler.CompileLoadNonexistent(cache_name); Map::UpdateCodeCache(stub_holder_map, cache_name, handler); return handler; } Handle<Code> PropertyHandlerCompiler::GetCode(Code::Kind kind, Code::StubType type, Handle<Name> name) { Code::Flags flags = Code::ComputeHandlerFlags(kind, type, cache_holder()); Handle<Code> code = GetCodeWithFlags(flags, name); PROFILE(isolate(), CodeCreateEvent(Logger::HANDLER_TAG, *code, *name)); #ifdef DEBUG code->VerifyEmbeddedObjects(); #endif return code; } #define __ ACCESS_MASM(masm()) Register NamedLoadHandlerCompiler::FrontendHeader(Register object_reg, Handle<Name> name, Label* miss, ReturnHolder return_what) { PrototypeCheckType check_type = SKIP_RECEIVER; int function_index = map()->IsPrimitiveMap() ? map()->GetConstructorFunctionIndex() : Map::kNoConstructorFunctionIndex; if (function_index != Map::kNoConstructorFunctionIndex) { GenerateDirectLoadGlobalFunctionPrototype(masm(), function_index, scratch1(), miss); Object* function = isolate()->native_context()->get(function_index); Object* prototype = JSFunction::cast(function)->instance_prototype(); Handle<Map> map(JSObject::cast(prototype)->map()); set_map(map); object_reg = scratch1(); check_type = CHECK_ALL_MAPS; } // Check that the maps starting from the prototype haven't changed. return CheckPrototypes(object_reg, scratch1(), scratch2(), scratch3(), name, miss, check_type, return_what); } // Frontend for store uses the name register. It has to be restored before a // miss. Register NamedStoreHandlerCompiler::FrontendHeader(Register object_reg, Handle<Name> name, Label* miss, ReturnHolder return_what) { return CheckPrototypes(object_reg, this->name(), scratch1(), scratch2(), name, miss, SKIP_RECEIVER, return_what); } Register PropertyHandlerCompiler::Frontend(Handle<Name> name) { Label miss; if (IC::ICUseVector(kind())) { PushVectorAndSlot(); } Register reg = FrontendHeader(receiver(), name, &miss, RETURN_HOLDER); FrontendFooter(name, &miss); // The footer consumes the vector and slot from the stack if miss occurs. if (IC::ICUseVector(kind())) { DiscardVectorAndSlot(); } return reg; } void PropertyHandlerCompiler::NonexistentFrontendHeader(Handle<Name> name, Label* miss, Register scratch1, Register scratch2) { Register holder_reg; Handle<Map> last_map; if (holder().is_null()) { holder_reg = receiver(); last_map = map(); // If |type| has null as its prototype, |holder()| is // Handle<JSObject>::null(). DCHECK(last_map->prototype() == isolate()->heap()->null_value()); } else { last_map = handle(holder()->map()); // This condition matches the branches below. bool need_holder = last_map->is_dictionary_map() && !last_map->IsJSGlobalObjectMap(); holder_reg = FrontendHeader(receiver(), name, miss, need_holder ? RETURN_HOLDER : DONT_RETURN_ANYTHING); } if (last_map->is_dictionary_map()) { if (last_map->IsJSGlobalObjectMap()) { Handle<JSGlobalObject> global = holder().is_null() ? Handle<JSGlobalObject>::cast(isolate()->global_object()) : Handle<JSGlobalObject>::cast(holder()); GenerateCheckPropertyCell(masm(), global, name, scratch1, miss); } else { if (!name->IsUniqueName()) { DCHECK(name->IsString()); name = factory()->InternalizeString(Handle<String>::cast(name)); } DCHECK(holder().is_null() || holder()->property_dictionary()->FindEntry(name) == NameDictionary::kNotFound); GenerateDictionaryNegativeLookup(masm(), miss, holder_reg, name, scratch1, scratch2); } } } Handle<Code> NamedLoadHandlerCompiler::CompileLoadField(Handle<Name> name, FieldIndex field) { Register reg = Frontend(name); __ Move(receiver(), reg); LoadFieldStub stub(isolate(), field); GenerateTailCall(masm(), stub.GetCode()); return GetCode(kind(), Code::FAST, name); } Handle<Code> NamedLoadHandlerCompiler::CompileLoadConstant(Handle<Name> name, int constant_index) { Register reg = Frontend(name); __ Move(receiver(), reg); LoadConstantStub stub(isolate(), constant_index); GenerateTailCall(masm(), stub.GetCode()); return GetCode(kind(), Code::FAST, name); } Handle<Code> NamedLoadHandlerCompiler::CompileLoadNonexistent( Handle<Name> name) { Label miss; if (IC::ICUseVector(kind())) { DCHECK(kind() == Code::LOAD_IC); PushVectorAndSlot(); } NonexistentFrontendHeader(name, &miss, scratch2(), scratch3()); if (IC::ICUseVector(kind())) { DiscardVectorAndSlot(); } GenerateLoadConstant(isolate()->factory()->undefined_value()); FrontendFooter(name, &miss); return GetCode(kind(), Code::FAST, name); } Handle<Code> NamedLoadHandlerCompiler::CompileLoadCallback( Handle<Name> name, Handle<ExecutableAccessorInfo> callback) { Register reg = Frontend(name); GenerateLoadCallback(reg, callback); return GetCode(kind(), Code::FAST, name); } Handle<Code> NamedLoadHandlerCompiler::CompileLoadCallback( Handle<Name> name, const CallOptimization& call_optimization, int accessor_index) { DCHECK(call_optimization.is_simple_api_call()); Register holder = Frontend(name); GenerateApiAccessorCall(masm(), call_optimization, map(), receiver(), scratch2(), false, no_reg, holder, accessor_index); return GetCode(kind(), Code::FAST, name); } void NamedLoadHandlerCompiler::InterceptorVectorSlotPush(Register holder_reg) { if (IC::ICUseVector(kind())) { if (holder_reg.is(receiver())) { PushVectorAndSlot(); } else { DCHECK(holder_reg.is(scratch1())); PushVectorAndSlot(scratch2(), scratch3()); } } } void NamedLoadHandlerCompiler::InterceptorVectorSlotPop(Register holder_reg, PopMode mode) { if (IC::ICUseVector(kind())) { if (mode == DISCARD) { DiscardVectorAndSlot(); } else { if (holder_reg.is(receiver())) { PopVectorAndSlot(); } else { DCHECK(holder_reg.is(scratch1())); PopVectorAndSlot(scratch2(), scratch3()); } } } } Handle<Code> NamedLoadHandlerCompiler::CompileLoadInterceptor( LookupIterator* it) { // So far the most popular follow ups for interceptor loads are DATA and // ExecutableAccessorInfo, so inline only them. Other cases may be added // later. bool inline_followup = false; switch (it->state()) { case LookupIterator::TRANSITION: UNREACHABLE(); case LookupIterator::ACCESS_CHECK: case LookupIterator::INTERCEPTOR: case LookupIterator::JSPROXY: case LookupIterator::NOT_FOUND: case LookupIterator::INTEGER_INDEXED_EXOTIC: break; case LookupIterator::DATA: inline_followup = it->property_details().type() == DATA && !it->is_dictionary_holder(); break; case LookupIterator::ACCESSOR: { Handle<Object> accessors = it->GetAccessors(); if (accessors->IsExecutableAccessorInfo()) { Handle<ExecutableAccessorInfo> info = Handle<ExecutableAccessorInfo>::cast(accessors); inline_followup = info->getter() != NULL && ExecutableAccessorInfo::IsCompatibleReceiverMap( isolate(), info, map()); } else if (accessors->IsAccessorPair()) { Handle<JSObject> property_holder(it->GetHolder<JSObject>()); Handle<Object> getter(Handle<AccessorPair>::cast(accessors)->getter(), isolate()); if (!getter->IsJSFunction()) break; if (!property_holder->HasFastProperties()) break; auto function = Handle<JSFunction>::cast(getter); CallOptimization call_optimization(function); Handle<Map> receiver_map = map(); inline_followup = call_optimization.is_simple_api_call() && call_optimization.IsCompatibleReceiverMap( receiver_map, property_holder); } } } Label miss; InterceptorVectorSlotPush(receiver()); bool lost_holder_register = false; auto holder_orig = holder(); // non masking interceptors must check the entire chain, so temporarily reset // the holder to be that last element for the FrontendHeader call. if (holder()->GetNamedInterceptor()->non_masking()) { DCHECK(!inline_followup); JSObject* last = *holder(); PrototypeIterator iter(isolate(), last); while (!iter.IsAtEnd()) { lost_holder_register = true; last = iter.GetCurrent<JSObject>(); iter.Advance(); } auto last_handle = handle(last); set_holder(last_handle); } Register reg = FrontendHeader(receiver(), it->name(), &miss, RETURN_HOLDER); // Reset the holder so further calculations are correct. set_holder(holder_orig); if (lost_holder_register) { if (*it->GetReceiver() == *holder()) { reg = receiver(); } else { // Reload lost holder register. auto cell = isolate()->factory()->NewWeakCell(holder()); __ LoadWeakValue(reg, cell, &miss); } } FrontendFooter(it->name(), &miss); InterceptorVectorSlotPop(reg); if (inline_followup) { // TODO(368): Compile in the whole chain: all the interceptors in // prototypes and ultimate answer. GenerateLoadInterceptorWithFollowup(it, reg); } else { GenerateLoadInterceptor(reg); } return GetCode(kind(), Code::FAST, it->name()); } void NamedLoadHandlerCompiler::GenerateLoadPostInterceptor( LookupIterator* it, Register interceptor_reg) { Handle<JSObject> real_named_property_holder(it->GetHolder<JSObject>()); Handle<Map> holder_map(holder()->map()); set_map(holder_map); set_holder(real_named_property_holder); Label miss; InterceptorVectorSlotPush(interceptor_reg); Register reg = FrontendHeader(interceptor_reg, it->name(), &miss, RETURN_HOLDER); FrontendFooter(it->name(), &miss); // We discard the vector and slot now because we don't miss below this point. InterceptorVectorSlotPop(reg, DISCARD); switch (it->state()) { case LookupIterator::ACCESS_CHECK: case LookupIterator::INTERCEPTOR: case LookupIterator::JSPROXY: case LookupIterator::NOT_FOUND: case LookupIterator::INTEGER_INDEXED_EXOTIC: case LookupIterator::TRANSITION: UNREACHABLE(); case LookupIterator::DATA: { DCHECK_EQ(DATA, it->property_details().type()); __ Move(receiver(), reg); LoadFieldStub stub(isolate(), it->GetFieldIndex()); GenerateTailCall(masm(), stub.GetCode()); break; } case LookupIterator::ACCESSOR: if (it->GetAccessors()->IsExecutableAccessorInfo()) { Handle<ExecutableAccessorInfo> info = Handle<ExecutableAccessorInfo>::cast(it->GetAccessors()); DCHECK_NOT_NULL(info->getter()); GenerateLoadCallback(reg, info); } else { auto function = handle(JSFunction::cast( AccessorPair::cast(*it->GetAccessors())->getter())); CallOptimization call_optimization(function); GenerateApiAccessorCall(masm(), call_optimization, holder_map, receiver(), scratch2(), false, no_reg, reg, it->GetAccessorIndex()); } } } Handle<Code> NamedLoadHandlerCompiler::CompileLoadViaGetter( Handle<Name> name, int accessor_index, int expected_arguments) { Register holder = Frontend(name); GenerateLoadViaGetter(masm(), map(), receiver(), holder, accessor_index, expected_arguments, scratch2()); return GetCode(kind(), Code::FAST, name); } // TODO(verwaest): Cleanup. holder() is actually the receiver. Handle<Code> NamedStoreHandlerCompiler::CompileStoreTransition( Handle<Map> transition, Handle<Name> name) { Label miss; if (FLAG_vector_stores) PushVectorAndSlot(); // Check that we are allowed to write this. bool is_nonexistent = holder()->map() == transition->GetBackPointer(); if (is_nonexistent) { // Find the top object. Handle<JSObject> last; PrototypeIterator::WhereToEnd end = name->IsPrivate() ? PrototypeIterator::END_AT_NON_HIDDEN : PrototypeIterator::END_AT_NULL; PrototypeIterator iter(isolate(), holder()); while (!iter.IsAtEnd(end)) { last = PrototypeIterator::GetCurrent<JSObject>(iter); iter.Advance(); } if (!last.is_null()) set_holder(last); NonexistentFrontendHeader(name, &miss, scratch1(), scratch2()); } else { FrontendHeader(receiver(), name, &miss, DONT_RETURN_ANYTHING); DCHECK(holder()->HasFastProperties()); } int descriptor = transition->LastAdded(); Handle<DescriptorArray> descriptors(transition->instance_descriptors()); PropertyDetails details = descriptors->GetDetails(descriptor); Representation representation = details.representation(); DCHECK(!representation.IsNone()); // Stub is never generated for objects that require access checks. DCHECK(!transition->is_access_check_needed()); // Call to respective StoreTransitionStub. bool virtual_args = StoreTransitionHelper::HasVirtualSlotArg(); Register map_reg = StoreTransitionHelper::MapRegister(); if (details.type() == DATA_CONSTANT) { DCHECK(descriptors->GetValue(descriptor)->IsJSFunction()); Register tmp = virtual_args ? VectorStoreICDescriptor::VectorRegister() : map_reg; GenerateRestoreMap(transition, tmp, scratch2(), &miss); GenerateConstantCheck(tmp, descriptor, value(), scratch2(), &miss); if (virtual_args) { // This will move the map from tmp into map_reg. RearrangeVectorAndSlot(tmp, map_reg); } else if (FLAG_vector_stores) { PopVectorAndSlot(); } GenerateRestoreName(name); StoreTransitionStub stub(isolate()); GenerateTailCall(masm(), stub.GetCode()); } else { if (representation.IsHeapObject()) { GenerateFieldTypeChecks(descriptors->GetFieldType(descriptor), value(), &miss); } StoreTransitionStub::StoreMode store_mode = Map::cast(transition->GetBackPointer())->unused_property_fields() == 0 ? StoreTransitionStub::ExtendStorageAndStoreMapAndValue : StoreTransitionStub::StoreMapAndValue; Register tmp = virtual_args ? VectorStoreICDescriptor::VectorRegister() : map_reg; GenerateRestoreMap(transition, tmp, scratch2(), &miss); if (virtual_args) { RearrangeVectorAndSlot(tmp, map_reg); } else if (FLAG_vector_stores) { PopVectorAndSlot(); } GenerateRestoreName(name); StoreTransitionStub stub(isolate(), FieldIndex::ForDescriptor(*transition, descriptor), representation, store_mode); GenerateTailCall(masm(), stub.GetCode()); } GenerateRestoreName(&miss, name); if (FLAG_vector_stores) PopVectorAndSlot(); TailCallBuiltin(masm(), MissBuiltin(kind())); return GetCode(kind(), Code::FAST, name); } bool NamedStoreHandlerCompiler::RequiresFieldTypeChecks( HeapType* field_type) const { return !field_type->Classes().Done(); } Handle<Code> NamedStoreHandlerCompiler::CompileStoreField(LookupIterator* it) { Label miss; DCHECK(it->representation().IsHeapObject()); HeapType* field_type = *it->GetFieldType(); bool need_save_restore = false; if (RequiresFieldTypeChecks(field_type)) { need_save_restore = IC::ICUseVector(kind()); if (need_save_restore) PushVectorAndSlot(); GenerateFieldTypeChecks(field_type, value(), &miss); if (need_save_restore) PopVectorAndSlot(); } StoreFieldStub stub(isolate(), it->GetFieldIndex(), it->representation()); GenerateTailCall(masm(), stub.GetCode()); __ bind(&miss); if (need_save_restore) PopVectorAndSlot(); TailCallBuiltin(masm(), MissBuiltin(kind())); return GetCode(kind(), Code::FAST, it->name()); } Handle<Code> NamedStoreHandlerCompiler::CompileStoreViaSetter( Handle<JSObject> object, Handle<Name> name, int accessor_index, int expected_arguments) { Register holder = Frontend(name); GenerateStoreViaSetter(masm(), map(), receiver(), holder, accessor_index, expected_arguments, scratch2()); return GetCode(kind(), Code::FAST, name); } Handle<Code> NamedStoreHandlerCompiler::CompileStoreCallback( Handle<JSObject> object, Handle<Name> name, const CallOptimization& call_optimization, int accessor_index) { Register holder = Frontend(name); GenerateApiAccessorCall(masm(), call_optimization, handle(object->map()), receiver(), scratch2(), true, value(), holder, accessor_index); return GetCode(kind(), Code::FAST, name); } #undef __ void ElementHandlerCompiler::CompileElementHandlers( MapHandleList* receiver_maps, CodeHandleList* handlers, LanguageMode language_mode) { for (int i = 0; i < receiver_maps->length(); ++i) { Handle<Map> receiver_map = receiver_maps->at(i); Handle<Code> cached_stub; if (receiver_map->IsStringMap()) { cached_stub = LoadIndexedStringStub(isolate()).GetCode(); } else if (receiver_map->instance_type() < FIRST_JS_RECEIVER_TYPE) { cached_stub = is_strong(language_mode) ? isolate()->builtins()->KeyedLoadIC_Slow_Strong() : isolate()->builtins()->KeyedLoadIC_Slow(); } else { bool is_js_array = receiver_map->instance_type() == JS_ARRAY_TYPE; ElementsKind elements_kind = receiver_map->elements_kind(); // No need to check for an elements-free prototype chain here, the // generated stub code needs to check that dynamically anyway. bool convert_hole_to_undefined = (is_js_array && elements_kind == FAST_HOLEY_ELEMENTS && *receiver_map == isolate()->get_initial_js_array_map(elements_kind)) && !is_strong(language_mode); if (receiver_map->has_indexed_interceptor()) { cached_stub = LoadIndexedInterceptorStub(isolate()).GetCode(); } else if (IsSloppyArgumentsElements(elements_kind)) { cached_stub = KeyedLoadSloppyArgumentsStub(isolate()).GetCode(); } else if (IsFastElementsKind(elements_kind) || IsFixedTypedArrayElementsKind(elements_kind)) { cached_stub = LoadFastElementStub(isolate(), is_js_array, elements_kind, convert_hole_to_undefined).GetCode(); } else { DCHECK(elements_kind == DICTIONARY_ELEMENTS); LoadICState state = LoadICState(is_strong(language_mode) ? LoadICState::kStrongModeState : kNoExtraICState); cached_stub = LoadDictionaryElementStub(isolate(), state).GetCode(); } } handlers->Add(cached_stub); } } } // namespace internal } // namespace v8

[ "zeno.albisser@hemispherian.com" ]

zeno.albisser@hemispherian.com

d23ba01ab67494cdd51cb965e2b734e0da5de03c

061454fa81774bb548ffb14d81011bd27e6f72ea

/lunar_csgo_recode/sdk/weapon.hh

203e9b63eecb5cc527dde6d7133e6169c4bfce90

[]

no_license

Aybrr/lunar_leak

f46eea6b14219bb0408c9dfd17d6f78d36148c26

fdd9c4c6613701067ccc2936f7b0f311f3ca3736

refs/heads/main

2023-05-01T22:51:36.443040

2021-05-23T13:33:12

null

0

null

UTF-8

C++

false

11,457

hh

#pragma once #include "entity.hh" #include <map> namespace sdk { struct strike_weapon_definition_t { pad ( 8 ); int weapon_id; }; enum class e_cs_weapon_type : int { weapontype_knife = 0 , weapontype_pistol , weapontype_submachinegun , weapontype_rifle , weapontype_shotgun , weapontype_sniper_rifle , weapontype_machinegun , weapontype_c4 , weapontype_placeholder , weapontype_grenade , weapontype_unknown }; enum class e_item_definition_index : short { weapon_none = 0 , weapon_deagle , weapon_elite , weapon_fiveseven , weapon_glock , weapon_ak47 = 7 , weapon_aug , weapon_awp , weapon_famas , weapon_g3sg1 , weapon_galilar = 13 , weapon_m249 , weapon_m4a1 = 16 , weapon_mac10 , weapon_p90 = 19 , weapon_mp5sd = 23 , weapon_ump45 , weapon_xm1014 , weapon_bizon , weapon_mag7 , weapon_negev , weapon_sawedoff , weapon_tec9 , weapon_taser , weapon_hkp2000 , weapon_mp7 , weapon_mp9 , weapon_nova , weapon_p250 , weapon_shield , weapon_scar20 , weapon_sg556 , weapon_ssg08 , weapon_knifegg , weapon_knife , weapon_flashbang , weapon_hegrenade , weapon_smokegrenade , weapon_molotov , weapon_decoy , weapon_incgrenade , weapon_c4 , weapon_healthshot = 57 , weapon_knife_t = 59 , weapon_m4a1_silencer , weapon_usp_silencer , weapon_cz75a = 63 , weapon_revolver , weapon_tagrenade = 68 , weapon_fists , weapon_breachcharge , weapon_tablet = 72 , weapon_melee = 74 , weapon_axe , weapon_hammer , weapon_spanner = 78 , weapon_knife_ghost = 80 , weapon_firebomb , weapon_diversion , weapon_frag_grenade , weapon_snowball , weapon_bumpmine , weapon_bayonet = 500 , weapon_knife_css = 500 , weapon_knife_flip = 505 , weapon_knife_gut , weapon_knife_karambit , weapon_knife_m9_bayonet , weapon_knife_tactical , weapon_knife_falchion = 512 , weapon_knife_survival_bowie = 514 , weapon_knife_butterfly , weapon_knife_push , weapon_knife_cord , weapon_knife_canis , weapon_knife_ursus = 519 , weapon_knife_gypsy_jackknife , weapon_knife_outdoor , weapon_knife_stiletto = 522 , weapon_knife_widowmaker , weapon_knife_skeleton = 525 , glove_studded = 5027 , glove_t_side , glove_ct_side , glove_sporty , glove_slick , glove_leather , glove_motorcycle , glove_specialist , glove_hydra }; /* from some random sdk */ class c_weaponinfo { public: virtual ~c_weaponinfo ( ) = default; //char pad_0000[4]; //0x0000 char * consolename; // 0x0004 char pad_0008 [ 8 ]; // 0x0008 void * m_pweapondef; //0x0010 int imaxclip1; // 0x0014 int imaxclip2; // 0x0018 int idefaultclip1; // 0x001c int idefaultclip2; // 0x0020 char pad_0024 [ 8 ]; // 0x0024 char * szworldmodel; // 0x002c char * szviewmodel; // 0x0030 char * szdroppedmodel; // 0x0034 char pad_0038 [ 4 ]; // 0x0038 char * n0000023e; // 0x003c char pad_0040 [ 56 ]; // 0x0040 char * szemptysound; // 0x0078 char pad_007c [ 4 ]; // 0x007c char * szbullettype; // 0x0080 char pad_0084 [ 4 ]; // 0x0084 char * szhudname; // 0x0088 char * szweaponname; // 0x008c char pad_0090 [ 60 ]; // 0x0090 int weapontype; // 0x00c8 int iweaponprice; // 0x00cc int ikillaward; // 0x00d0 char * szanimationprefix; // 0x00d4 float flcycletime; // 0x00d8 float flcycletimealt; // 0x00dc float fltimetoidle; // 0x00e0 float flidleinterval; // 0x00e4 bool bfullauto; // 0x00e8 char pad_0x00e5 [ 3 ]; // 0x00e9 int idamage; // 0x00ec float flarmorratio; // 0x00f0 int ibullets; // 0x00f4 float flpenetration; // 0x00f8 float flflinchvelocitymodifierlarge; // 0x00fc float flflinchvelocitymodifiersmall; // 0x0100 float flrange; // 0x0104 float flrangemodifier; // 0x0108 float flthrowvelocity; // 0x010c char pad_0x010c [ 16 ]; // 0x0110 bool bhassilencer; // 0x011c char pad_0x0119 [ 3 ]; // 0x011d char * psilencermodel; // 0x0120 int icrosshairmindistance; // 0x0124 float flmaxplayerspeed; // 0x0128 float flmaxplayerspeedalt; // 0x012c char pad_0x0130 [ 4 ]; // 0x0130 float flspread; // 0x0134 float flspreadalt; // 0x0138 float flinaccuracycrouch; // 0x013c float flinaccuracycrouchalt; // 0x0140 float flinaccuracystand; // 0x0144 float flinaccuracystandalt; // 0x0148 float flinaccuracyjumpinitial; // 0x014c float flinaccuracyjump; // 0x0150 float flinaccuracyjumpalt; // 0x0154 float flinaccuracyland; // 0x0158 float flinaccuracylandalt; // 0x015c float flinaccuracyladder; // 0x0160 float flinaccuracyladderalt; // 0x0164 float flinaccuracyfire; // 0x0168 float flinaccuracyfirealt; // 0x016c float flinaccuracymove; // 0x0170 float flinaccuracymovealt; // 0x0174 float flinaccuracyreload; // 0x0178 int irecoilseed; // 0x017c float flrecoilangle; // 0x0180 float flrecoilanglealt; // 0x0184 float flrecoilanglevariance; // 0x0188 float flrecoilanglevariancealt; // 0x018c float flrecoilmagnitude; // 0x0190 float flrecoilmagnitudealt; // 0x0194 float flrecoilmagnitudevariance; // 0x0198 float flrecoilmagnitudevariancealt; // 0x019c float flrecoverytimecrouch; // 0x01a0 float flrecoverytimestand; // 0x01a4 float flrecoverytimecrouchfinal; // 0x01a8 float flrecoverytimestandfinal; // 0x01ac int irecoverytransitionstartbullet; // 0x01b0 int irecoverytransitionendbullet; // 0x01b4 bool bunzoomaftershot; // 0x01b8 bool bhideviewmodelzoomed; // 0x01b9 char pad_0x01b5 [ 2 ]; // 0x01ba char izoomlevels [ 3 ]; // 0x01bc int izoomfov [ 2 ]; // 0x01c0 float fzoomtime [ 3 ]; // 0x01c4 char * szweaponclass; // 0x01d4 float fladdonscale; // 0x01d8 char pad_0x01dc [ 4 ]; // 0x01dc char * szejectbrasseffect; // 0x01e0 char * sztracereffect; // 0x01e4 int itracerfrequency; // 0x01e8 int itracerfrequencyalt; // 0x01ec char * szmuzzleflasheffect_1stperson; // 0x01f0 char pad_0x01f4 [ 4 ]; // 0x01f4 char * szmuzzleflasheffect_3rdperson; // 0x01f8 char pad_0x01fc [ 4 ]; // 0x01fc char * szmuzzlesmokeeffect; // 0x0200 float flheatpershot; // 0x0204 char * szzoominsound; // 0x0208 char * szzoomoutsound; // 0x020c float flinaccuracypitchshift; // 0x0210 float flinaccuracysoundthreshold; // 0x0214 float flbotaudiblerange; // 0x0218 char pad_0x0218 [ 8 ]; // 0x0220 char * pwrongteammsg; // 0x0224 bool bhasburstmode; // 0x0228 char pad_0x0225 [ 3 ]; // 0x0229 bool bisrevolver; // 0x022c bool bcannotshootunderwater; // 0x0230 }; class c_weapon { public: /* netvars */ /* local weapon data */ netvar_fn ( float , next_primary_attack , "DT_LocalActiveWeaponData->m_flNextPrimaryAttack" ); netvar_fn ( float , next_secondary_attack , "DT_LocalActiveWeaponData->m_flNextSecondaryAttack" ); netvar_fn ( float , time_weapon_idle , "DT_LocalActiveWeaponData->m_flTimeWeaponIdle" ); /* weapon cs base */ netvar_fn ( float , postpone_fire_ready_time , "DT_WeaponCSBase->m_flPostponeFireReadyTime" ); netvar_fn ( float , last_shot_time , "DT_WeaponCSBase->m_fLastShotTime" ); netvar_fn ( int , clip , "DT_BaseCombatWeapon->m_iClip1" ); netvar_fn ( int , second_clip , "DT_BaseCombatWeapon->m_iClip2" ); /* nades */ netvar_fn ( float , throw_time , "DT_BaseCSGrenade->m_fThrowTime" ); netvar_fn ( bool , pin_pulled , "DT_BaseCSGrenade->m_bPinPulled" ); /* offsets */ // offset ( e_item_definition_index , item_definition_index , 0x2FAA ); offset ( bool , in_reload , 0x32A5 ); /* methods */ /* shit netvar manager forces my hand lolll */ e_item_definition_index item_definition_index ( ) { if ( !this ) return e_item_definition_index::weapon_none; static const auto offset = hack::game::netvars::offsets [ fnv1a ( "DT_BaseAttributableItem->m_AttributeManager" ) ] + hack::game::netvars::offsets [ fnv1a ( "DT_AttributeContainer->m_Item" ) ] + hack::game::netvars::offsets [ fnv1a ( "DT_ScriptCreatedItem->m_iItemDefinitionIndex" ) ]; return *( e_item_definition_index * ) ( std::uintptr_t ( this ) + offset ); } /* this is a meme */ auto weapon_kind ( ) { switch ( this->item_definition_index ( ) ) { case sdk::e_item_definition_index::weapon_c4: return sdk::e_cs_weapon_type::weapontype_c4; break; case sdk::e_item_definition_index::weapon_knife: case sdk::e_item_definition_index::weapon_knifegg: case sdk::e_item_definition_index::weapon_knife_butterfly: case sdk::e_item_definition_index::weapon_knife_canis: case sdk::e_item_definition_index::weapon_knife_cord: case sdk::e_item_definition_index::weapon_knife_css: case sdk::e_item_definition_index::weapon_knife_falchion: case sdk::e_item_definition_index::weapon_knife_flip: case sdk::e_item_definition_index::weapon_knife_ghost: case sdk::e_item_definition_index::weapon_knife_gut: case sdk::e_item_definition_index::weapon_knife_gypsy_jackknife: case sdk::e_item_definition_index::weapon_knife_karambit: case sdk::e_item_definition_index::weapon_knife_m9_bayonet: case sdk::e_item_definition_index::weapon_knife_push: case sdk::e_item_definition_index::weapon_knife_outdoor: case sdk::e_item_definition_index::weapon_knife_skeleton: case sdk::e_item_definition_index::weapon_knife_stiletto: case sdk::e_item_definition_index::weapon_knife_survival_bowie: case sdk::e_item_definition_index::weapon_knife_t: case sdk::e_item_definition_index::weapon_knife_tactical: case sdk::e_item_definition_index::weapon_knife_ursus: case sdk::e_item_definition_index::weapon_knife_widowmaker: return sdk::e_cs_weapon_type::weapontype_knife; break; case sdk::e_item_definition_index::weapon_hegrenade: case sdk::e_item_definition_index::weapon_decoy: case sdk::e_item_definition_index::weapon_smokegrenade: case sdk::e_item_definition_index::weapon_molotov: case sdk::e_item_definition_index::weapon_incgrenade: case sdk::e_item_definition_index::weapon_firebomb: case sdk::e_item_definition_index::weapon_flashbang: case sdk::e_item_definition_index::weapon_frag_grenade: case sdk::e_item_definition_index::weapon_tagrenade: case sdk::e_item_definition_index::weapon_snowball: return sdk::e_cs_weapon_type::weapontype_grenade; break; case sdk::e_item_definition_index::weapon_g3sg1: case sdk::e_item_definition_index::weapon_scar20: case sdk::e_item_definition_index::weapon_awp: case sdk::e_item_definition_index::weapon_ssg08: return sdk::e_cs_weapon_type::weapontype_sniper_rifle; break; default: return sdk::e_cs_weapon_type::weapontype_unknown; break; } return sdk::e_cs_weapon_type::weapontype_unknown; } std::pair<std::string , bool> get_weapon_as_string ( ) { if ( !this || !this->data ( ) ) return std::pair<std::string , bool> ( " " , false ); std::string name = this->data ( )->consolename; name.erase ( 0 , 7 ); return std::pair<std::string , bool > ( name , false ); } sdk::c_weaponinfo * data ( ); float inaccuracy ( ); float spread ( ); void update_accuracy ( ); }; }

[ "senpaifuuzy@gmail.com" ]

senpaifuuzy@gmail.com

34a54e829cec48ae982319e0f82a7fa684e0306c

affd7dc26a0f4580454a9af1dfc4be601141892a

/src/qt/bitcoinunits.cpp

a66e2b91fa6bbcc77c5330fa347d2ab1d883bca2

[ "MIT" ]

permissive

hendo420/Grdtcoin

6d9410a5c3d2e2a8d38489542e4b5e67ac281f60

59262e398eb9dbef8bcf85713eae03fe6e7e953d

refs/heads/master

2021-01-25T09:00:26.330968

2013-12-28T23:57:17

null

0

null

UTF-8

C++

false

4,341

cpp

#include "bitcoinunits.h" #include <QStringList> BitcoinUnits::BitcoinUnits(QObject *parent): QAbstractListModel(parent), unitlist(availableUnits()) { } QList<BitcoinUnits::Unit> BitcoinUnits::availableUnits() { QList<BitcoinUnits::Unit> unitlist; unitlist.append(BTC); unitlist.append(mBTC); unitlist.append(uBTC); return unitlist; } bool BitcoinUnits::valid(int unit) { switch(unit) { case BTC: case mBTC: case uBTC: return true; default: return false; } } QString BitcoinUnits::name(int unit) { switch(unit) { case BTC: return QString("GRDT"); case mBTC: return QString("mGRDT"); case uBTC: return QString::fromUtf8("μGRDT"); default: return QString("???"); } } QString BitcoinUnits::description(int unit) { switch(unit) { case BTC: return QString("grdtcoin"); case mBTC: return QString("milligrdtcoin (1 / 1,000)"); case uBTC: return QString("microgrdtcoin (1 / 1,000,000)"); default: return QString("???"); } } //a single unit (.00000001) of grdtcoin is called a "wander." qint64 BitcoinUnits::factor(int unit) { switch(unit) { case BTC: return 100000000; case mBTC: return 100000; case uBTC: return 100; default: return 100000000; } } int BitcoinUnits::amountDigits(int unit) { switch(unit) { case BTC: return 8; // 21,000,000 (# digits, without commas) case mBTC: return 11; // 21,000,000,000 case uBTC: return 14; // 21,000,000,000,000 default: return 0; } } int BitcoinUnits::decimals(int unit) { switch(unit) { case BTC: return 8; case mBTC: return 5; case uBTC: return 2; default: return 0; } } QString BitcoinUnits::format(int unit, qint64 n, bool fPlus) { // Note: not using straight sprintf here because we do NOT want // localized number formatting. if(!valid(unit)) return QString(); // Refuse to format invalid unit qint64 coin = factor(unit); int num_decimals = decimals(unit); qint64 n_abs = (n > 0 ? n : -n); qint64 quotient = n_abs / coin; qint64 remainder = n_abs % coin; QString quotient_str = QString::number(quotient); QString remainder_str = QString::number(remainder).rightJustified(num_decimals, '0'); // Right-trim excess 0's after the decimal point int nTrim = 0; for (int i = remainder_str.size()-1; i>=2 && (remainder_str.at(i) == '0'); --i) ++nTrim; remainder_str.chop(nTrim); if (n < 0) quotient_str.insert(0, '-'); else if (fPlus && n > 0) quotient_str.insert(0, '+'); return quotient_str + QString(".") + remainder_str; } QString BitcoinUnits::formatWithUnit(int unit, qint64 amount, bool plussign) { return format(unit, amount, plussign) + QString(" ") + name(unit); } bool BitcoinUnits::parse(int unit, const QString &value, qint64 *val_out) { if(!valid(unit) || value.isEmpty()) return false; // Refuse to parse invalid unit or empty string int num_decimals = decimals(unit); QStringList parts = value.split("."); if(parts.size() > 2) { return false; // More than one dot } QString whole = parts[0]; QString decimals; if(parts.size() > 1) { decimals = parts[1]; } if(decimals.size() > num_decimals) { return false; // Exceeds max precision } bool ok = false; QString str = whole + decimals.leftJustified(num_decimals, '0'); if(str.size() > 18) { return false; // Longer numbers will exceed 63 bits } qint64 retvalue = str.toLongLong(&ok); if(val_out) { *val_out = retvalue; } return ok; } int BitcoinUnits::rowCount(const QModelIndex &parent) const { Q_UNUSED(parent); return unitlist.size(); } QVariant BitcoinUnits::data(const QModelIndex &index, int role) const { int row = index.row(); if(row >= 0 && row < unitlist.size()) { Unit unit = unitlist.at(row); switch(role) { case Qt::EditRole: case Qt::DisplayRole: return QVariant(name(unit)); case Qt::ToolTipRole: return QVariant(description(unit)); case UnitRole: return QVariant(static_cast<int>(unit)); } } return QVariant(); }

[ "root@d1stkfactory" ]

root@d1stkfactory

fb89dff8f2d268d7185d1bf060199cf7bfc3168f

4ffdc4341ce50d462dc9ed0198691b9aa5f2d0ba

/week-02/day-5/palindromes2.cpp

949a785192acbef213932ce57adbe5552b6e990c

[]

no_license

greenfox-zerda-sparta/Akatakata

b1289cc176a88f5e51133e4e723e97ad9a71e402

a4a7f464c66582568c238eea7b98ecc949f87c05

refs/heads/master

2021-01-12T18:14:53.086793

2017-02-14T14:32:17

71,350,782

0

null

UTF-8

C++

false

1,271

cpp

#include <iostream> #include <string> using namespace std; // Create a function that searches for all the palindromes // in a string that are at least than 3 characters, and // returns a list with the found palindromes. void find_words(string &text, int count, int start, int mod, string &word, string &to){ // Finds palindromes of odd and even length in text // writes them to string if longer than 2 chars, and resets counter while (text[start - count + mod] == text[start + count]) { count++; } for (int n = start +1 - count + mod; n < start + count; n++) { word = word + text[n]; } if (word.size() > 2) { to = to + "'" + word + "', "; } count = 1; word = ""; } string SearchPalindromes(string text) { string palis = ""; string to_concat = ""; int distance = 1; for (int i = 0; i < text.size(); i++) { if (text[i - distance] == text[i + distance]) { find_words(text, distance, i, 0, to_concat, palis); } if (text[i] == text[i + distance]) { find_words(text, distance, i, 1, to_concat, palis); } } return palis; } int main() { string output = SearchPalindromes("dog goat dad duck doodle never"); cout << output << endl; // it prints: ['og go', ' dad ', 'd d', 'dood', 'eve'] return 0; }

[ "almasy.kata@gmail.com" ]

almasy.kata@gmail.com

71fe164049950f62f851c36ea195916623b004e9

7bc7490eb6396368abcf642d4397b2ad225e4e35

/ser/conser.h

f38e5ae9dba90e92492c230295c3e3945cc8c9aa

[]

no_license

eveonline96/cloudpan

ce2a39d8d4d2360351e984e7d931201e99f0c851

0ad9dbca8e31a907bccd9176f8209923eda99ac0

refs/heads/master

2021-01-01T19:35:52.780045

2017-08-08T15:59:16

98,617,831

0

null

UTF-8

C++

false

626

h

#ifndef CONSER_H #define CONSER_H #include "../public.h" #include "mydb.h" #include "sqlConnPool.h" class conSer { public conSer(int port,const char *addr); ~conSer(); void Bind(); void Listen(); int accept_timeout(unsigned int wait_seconds);//select void epoll_work(); //epoll void Run(); private: void selectFTServer(); void do_service(int conn); void get_cmd(); private: int listenfd; //监听套接字 int port; //端口 char *addr; //地址 list<string> sql; string msg; struct sockaddr_in seraddr,peeraddr; }; #endif

[ "870402433@qq.com" ]

870402433@qq.com

e6dc452b53c0bcc5a626aaf59dd300f95a99a067

d0c44dd3da2ef8c0ff835982a437946cbf4d2940

/cmake-build-debug/programs_tiling/function13777/function13777_schedule_51/function13777_schedule_51_wrapper.cpp

d0d360df18b09d394210fb990acdebc7394f21b0

[]

no_license

IsraMekki/tiramisu_code_generator

8b3f1d63cff62ba9f5242c019058d5a3119184a3

5a259d8e244af452e5301126683fa4320c2047a3

refs/heads/master

2020-04-29T17:27:57.987172

2019-04-23T16:50:32

176,297,755

1

2

null

UTF-8

C++

false

931

cpp

#include "Halide.h" #include "function13777_schedule_51_wrapper.h" #include "tiramisu/utils.h" #include <cstdlib> #include <iostream> #include <time.h> #include <fstream> #include <chrono> #define MAX_RAND 200 int main(int, char **){ Halide::Buffer<int32_t> buf00(128, 128); Halide::Buffer<int32_t> buf0(64, 128, 128, 64); init_buffer(buf0, (int32_t)0); auto t1 = std::chrono::high_resolution_clock::now(); function13777_schedule_51(buf00.raw_buffer(), buf0.raw_buffer()); auto t2 = std::chrono::high_resolution_clock::now(); std::chrono::duration<double> diff = t2 - t1; std::ofstream exec_times_file; exec_times_file.open("../data/programs/function13777/function13777_schedule_51/exec_times.txt", std::ios_base::app); if (exec_times_file.is_open()){ exec_times_file << diff.count() * 1000000 << "us" <<std::endl; exec_times_file.close(); } return 0; }

[ "ei_mekki@esi.dz" ]

ei_mekki@esi.dz

fec8c07d761312821cb1f6e92009df9c8fdb1558

abbc8f2c4bb2a97657e30f481468d5bb562837b5

/include/Stream.hpp

55fa405f6400ef3bab04f65b9086420871e21603

[ "MIT" ]

permissive

henu/libagl

ca37bb06afe35c7f4763d3f7026614a08c6e2fb4

0bf8ef6482111b5a134771249fccc7282b8eada1

refs/heads/master

2016-09-05T15:11:28.352046

2014-09-17T22:12:02

null

0

null

UTF-8

C++

false

3,265

hpp

#ifndef AGL_STREAM_HPP #define AGL_STREAM_HPP #include "Bytes.hpp" #include "Rbuf.hpp" #include <string> #include <stdexcept> #include <cstring> #include <stdint.h> namespace Agl { class Stream { public: class StreamInputClosed : public std::runtime_error { public: inline StreamInputClosed() : std::runtime_error("Stream input already closed!") { } inline virtual ~StreamInputClosed() throw () { } inline virtual const char* what() const throw () { return "Stream input already closed!"; } }; inline Stream(); inline ~Stream(); inline void push(const Bytes& bytes); inline void push(const std::string& str); inline void push(const char* bytes, uint64_t size); // Informs stream, that all data is got. No more data will be pushed. inline void setEndOfData(); // Functions to read data that Stream has processed inline Bytes readBytes(size_t limit = 0); inline std::string readString(size_t limit = 0); protected: // Reads chunk from input data. If limit // is not given, then everything is read. // Data is written to the end of "result". inline void readInputData(Bytes& result, size_t limit = 0); // Writes to outputdata inline void writeOutputData(uint8_t* begin, uint8_t* end); private: Rbuf< uint8_t > input; Rbuf< uint8_t > output; bool end_of_data; // Ensures there is specific amount of unused space in ring buffer inline void ensureEmptySpace(uint64_t size); // This virtual function informs subclass when there is // new data available, or when end of data has been set. virtual void newDataAvailable(uint64_t amount, bool end_of_data) = 0; }; inline Stream::Stream() : end_of_data(false) { } inline Stream::~Stream() { } inline void Stream::push(const Bytes& bytes) { push((const char*)&bytes[0], bytes.size()); } inline void Stream::push(const std::string& str) { push(str.c_str(), str.size()); } inline void Stream::push(const char* bytes, uint64_t size) { if (end_of_data) throw StreamInputClosed(); input.insert((uint8_t*)bytes, (uint8_t*)bytes + size); newDataAvailable(input.size(), false); } inline void Stream::setEndOfData() { if (end_of_data) throw StreamInputClosed(); end_of_data = true; newDataAvailable(input.size(), true); } inline Bytes Stream::readBytes(size_t limit) { size_t amount_to_copy; if (limit == 0 || limit > output.size()) amount_to_copy = output.size(); else amount_to_copy = limit; Bytes result(amount_to_copy, 0); output.read(&result[0], amount_to_copy); return result; } inline std::string Stream::readString(size_t limit) { size_t amount_to_copy; if (limit == 0 || limit > output.size()) amount_to_copy = output.size(); else amount_to_copy = limit; std::string result(amount_to_copy, ' '); output.read((uint8_t*)&result[0], amount_to_copy); return result; } inline void Stream::readInputData(Bytes& result, size_t limit) { size_t amount_to_copy; if (limit == 0 || limit > input.size()) amount_to_copy = input.size(); else amount_to_copy = limit; uint8_t* readbuf = new uint8_t[amount_to_copy]; input.read(readbuf, amount_to_copy); result.insert(result.end(), readbuf, readbuf + amount_to_copy); delete[] readbuf; } inline void Stream::writeOutputData(uint8_t* begin, uint8_t* end) { output.insert(begin, end); } } #endif

[ "henrik.heino@gmail.com" ]

henrik.heino@gmail.com

985f1664317326bbad7a32e037deef7d07634065

2c3245916133aad0b707abde5e3236caf58404d8

/libbulletc/src/btOverlappingPairCache_wrap.cpp

245501354121d8f00f7f7742ec122175d2e0a7ef

[ "Zlib" ]

permissive

ValtoLibraries/BulletSharp

3ac2dc389b4c0f6ba1d31a7ac8ca87fe27395e94

079846c1663f9d6323df1e97083f091070ad6f52

refs/heads/master

2021-09-11T20:31:40.886634

2018-04-12T00:46:49

81,493,381

2

0

null

2018-04-12T00:46:50

2017-02-09T20:47:00

C#

UTF-8

C++

false

4,350

cpp

#include <BulletCollision/BroadphaseCollision/btDispatcher.h> #include <BulletCollision/BroadphaseCollision/btOverlappingPairCache.h> #include "btOverlappingPairCache_wrap.h" bool btOverlapCallback_processOverlap(btOverlapCallback* obj, btBroadphasePair* pair) { return obj->processOverlap(*pair); } void btOverlapCallback_delete(btOverlapCallback* obj) { delete obj; } bool btOverlapFilterCallback_needBroadphaseCollision(btOverlapFilterCallback* obj, btBroadphaseProxy* proxy0, btBroadphaseProxy* proxy1) { return obj->needBroadphaseCollision(proxy0, proxy1); } void btOverlapFilterCallback_delete(btOverlapFilterCallback* obj) { delete obj; } void btOverlappingPairCache_cleanOverlappingPair(btOverlappingPairCache* obj, btBroadphasePair* pair, btDispatcher* dispatcher) { obj->cleanOverlappingPair(*pair, dispatcher); } void btOverlappingPairCache_cleanProxyFromPairs(btOverlappingPairCache* obj, btBroadphaseProxy* proxy, btDispatcher* dispatcher) { obj->cleanProxyFromPairs(proxy, dispatcher); } btBroadphasePair* btOverlappingPairCache_findPair(btOverlappingPairCache* obj, btBroadphaseProxy* proxy0, btBroadphaseProxy* proxy1) { return obj->findPair(proxy0, proxy1); } int btOverlappingPairCache_getNumOverlappingPairs(btOverlappingPairCache* obj) { return obj->getNumOverlappingPairs(); } btAlignedObjectArray_btBroadphasePair* btOverlappingPairCache_getOverlappingPairArray( btOverlappingPairCache* obj) { return &obj->getOverlappingPairArray(); } btBroadphasePair* btOverlappingPairCache_getOverlappingPairArrayPtr(btOverlappingPairCache* obj) { return obj->getOverlappingPairArrayPtr(); } bool btOverlappingPairCache_hasDeferredRemoval(btOverlappingPairCache* obj) { return obj->hasDeferredRemoval(); } void btOverlappingPairCache_processAllOverlappingPairs(btOverlappingPairCache* obj, btOverlapCallback* __unnamed0, btDispatcher* dispatcher) { obj->processAllOverlappingPairs(__unnamed0, dispatcher); } void btOverlappingPairCache_setInternalGhostPairCallback(btOverlappingPairCache* obj, btOverlappingPairCallback* ghostPairCallback) { obj->setInternalGhostPairCallback(ghostPairCallback); } void btOverlappingPairCache_setOverlapFilterCallback(btOverlappingPairCache* obj, btOverlapFilterCallback* callback) { obj->setOverlapFilterCallback(callback); } void btOverlappingPairCache_sortOverlappingPairs(btOverlappingPairCache* obj, btDispatcher* dispatcher) { obj->sortOverlappingPairs(dispatcher); } btOverlapFilterCallbackWrapper * btOverlapFilterCallbackWrapper_new(p_btOverlapFilterCallback_needBroadphaseCollision needBroadphaseCollision) { return new btOverlapFilterCallbackWrapper(needBroadphaseCollision); } btHashedOverlappingPairCache* btHashedOverlappingPairCache_new() { return new btHashedOverlappingPairCache(); } int btHashedOverlappingPairCache_GetCount(btHashedOverlappingPairCache* obj) { return obj->GetCount(); } btOverlapFilterCallback* btHashedOverlappingPairCache_getOverlapFilterCallback(btHashedOverlappingPairCache* obj) { return obj->getOverlapFilterCallback(); } bool btHashedOverlappingPairCache_needsBroadphaseCollision(btHashedOverlappingPairCache* obj, btBroadphaseProxy* proxy0, btBroadphaseProxy* proxy1) { return obj->needsBroadphaseCollision(proxy0, proxy1); } btSortedOverlappingPairCache* btSortedOverlappingPairCache_new() { return new btSortedOverlappingPairCache(); } btOverlapFilterCallback* btSortedOverlappingPairCache_getOverlapFilterCallback(btSortedOverlappingPairCache* obj) { return obj->getOverlapFilterCallback(); } bool btSortedOverlappingPairCache_needsBroadphaseCollision(btSortedOverlappingPairCache* obj, btBroadphaseProxy* proxy0, btBroadphaseProxy* proxy1) { return obj->needsBroadphaseCollision(proxy0, proxy1); } btNullPairCache* btNullPairCache_new() { return new btNullPairCache(); } btOverlapFilterCallbackWrapper::btOverlapFilterCallbackWrapper(p_btOverlapFilterCallback_needBroadphaseCollision needBroadphaseCollision) { _needBroadphaseCollision = needBroadphaseCollision; } bool btOverlapFilterCallbackWrapper::needBroadphaseCollision(btBroadphaseProxy* proxy0, btBroadphaseProxy* proxy1) const { return _needBroadphaseCollision(proxy0, proxy1); }

[ "andres.traks@gmail.com" ]

andres.traks@gmail.com

1b42d781a56a771043f1bb8ed7f652cdcb57d385

16dc54384a53f8bcd6dfdecfbabd385d51acb7de

/2016_a_practice/week9/C - Conductors/main.cpp

862b1acb6a2f3e669013b1387c60a158fa318609

[]

no_license

kkkkBlueSky/HUAS_ACM

629771b4b583a0725ee0955ddbf35cdfaddec652

3b9aad20476ec09bb5f12f951340829e68152094

refs/heads/master

2021-12-17T21:47:13.245217

2017-09-22T12:54:51

null

0

null

UTF-8

C++

false

499

cpp

#include <iostream> #include <cstdio> using namespace std; int main() { double p, q, pmin1,qmax1; int pmin, qmax, flag; while(~scanf("%lf %lf", &p, &q)){ int ans=1; p/=100.0; q/=100.0; while(1){ pmin1=ans*p; qmax1=ans*q; pmin=int(pmin1); qmax=int(qmax1); if(qmax>pmin&&pmin1-pmin>0.0001&&qmax1-qmax>0.0001)break; ans++; } printf("%d\n", ans); } return 0; }

[ "woodcoding@gmail.com" ]

woodcoding@gmail.com

fd3abd0dc2a34bbafc9e0f8dc5749fb4c5165a7a

7b763f3ab5f3cfb424d825f60ddff97b163d62e3

/FirstTriangle/rendering/Render.hxx

46f781b69f684fb0fe4ac90d94891bf7179a955d

[]

no_license

iAmSomeone2/VulkanPractice

65bc40efdc686aeed12b969238045f0a14ccb4b9

7a0b5517b4bfaa36a1bea8ced5e5c48f245d2b39

refs/heads/master

2020-08-23T16:27:23.276853

2019-10-25T23:59:12

216,662,368

0

null

UTF-8

C++

false

312

hxx

#ifndef RENDER_HXX #define RENDER_HXX #include <vulkan/vulkan.hpp> class Render { public: Render(vk::Device *logicalDevice, vk::Format swapChainImageFormat); ~Render(); vk::RenderPass *renderPass(); private: vk::Device *m_logicalDevice; vk::RenderPass m_renderPass; }; #endif // RENDER_HXX

[ "brendend13@gmail.com" ]

brendend13@gmail.com

680becbb9d4efb018d1fe6d0938756fe81444eb1

71b380f43de7f76789bef938b70872bd59687a06

/src/Game.h

927c00d9b5d7214fe3d293d41e04d85aad70b8ca

[]

no_license

serzap/VeryCrazyTanks

e1c140074e5bffa9f89167c6f3cf45b7b65d4a58

6483fe622a2532c8bace624cca6e42b7da63ba10

refs/heads/master

2021-04-12T10:08:37.482712

2018-03-27T18:41:01

126,162,813

1

0

null

UTF-8

C++

false

197

h

#ifndef VERYCRAZYTANKS_GAME_H #define VERYCRAZYTANKS_GAME_H #include <iomanip> #include "BattleField.h" class Game { public: Game(); ~Game(); void run(); private: BattleField bf; }; #endif

[ "serhii.zaporozhchenko@gmail.com" ]

serhii.zaporozhchenko@gmail.com

68b059c22310377785b812181ffdab1d7fd09109

af757d873c431a899438f66220027ae4f10c59e6

/node_modules/marionette-client/node_modules/sockit-to-me/externals/v8/src/code-stubs.cc

5bec7e05f913be19ef8526f76e86580b99041115

[ "Apache-2.0", "bzip2-1.0.6", "BSD-3-Clause" ]

permissive

a-os/gaia-node-modules

fb57372d1b2b0dc1ae6e0cb650b0c3ef9f69d74b

43c434626a862bc092f825175bc88d11988c4d6a

refs/heads/master

2021-01-22T00:51:10.683335

2015-07-03T23:02:03

2015-07-03T23:02:37

38,414,532

0

null

2015-07-02T06:06:26

null

UTF-8

C++

false

25,596

cc

// Copyright 2012 the V8 project authors. 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. #include "v8.h" #include "bootstrapper.h" #include "code-stubs.h" #include "stub-cache.h" #include "factory.h" #include "gdb-jit.h" #include "macro-assembler.h" namespace v8 { namespace internal { CodeStubInterfaceDescriptor::CodeStubInterfaceDescriptor() : register_param_count_(-1), stack_parameter_count_(NULL), hint_stack_parameter_count_(-1), function_mode_(NOT_JS_FUNCTION_STUB_MODE), register_params_(NULL), deoptimization_handler_(NULL), miss_handler_(IC_Utility(IC::kUnreachable), Isolate::Current()), has_miss_handler_(false) { } bool CodeStub::FindCodeInCache(Code** code_out, Isolate* isolate) { UnseededNumberDictionary* stubs = isolate->heap()->code_stubs(); int index = stubs->FindEntry(GetKey()); if (index != UnseededNumberDictionary::kNotFound) { *code_out = Code::cast(stubs->ValueAt(index)); return true; } return false; } SmartArrayPointer<const char> CodeStub::GetName() { char buffer[100]; NoAllocationStringAllocator allocator(buffer, static_cast<unsigned>(sizeof(buffer))); StringStream stream(&allocator); PrintName(&stream); return stream.ToCString(); } void CodeStub::RecordCodeGeneration(Code* code, Isolate* isolate) { SmartArrayPointer<const char> name = GetName(); PROFILE(isolate, CodeCreateEvent(Logger::STUB_TAG, code, *name)); GDBJIT(AddCode(GDBJITInterface::STUB, *name, code)); Counters* counters = isolate->counters(); counters->total_stubs_code_size()->Increment(code->instruction_size()); } Code::Kind CodeStub::GetCodeKind() const { return Code::STUB; } Handle<Code> PlatformCodeStub::GenerateCode() { Isolate* isolate = Isolate::Current(); Factory* factory = isolate->factory(); // Generate the new code. MacroAssembler masm(isolate, NULL, 256); { // Update the static counter each time a new code stub is generated. isolate->counters()->code_stubs()->Increment(); // Nested stubs are not allowed for leaves. AllowStubCallsScope allow_scope(&masm, false); // Generate the code for the stub. masm.set_generating_stub(true); NoCurrentFrameScope scope(&masm); Generate(&masm); } // Create the code object. CodeDesc desc; masm.GetCode(&desc); // Copy the generated code into a heap object. Code::Flags flags = Code::ComputeFlags( GetCodeKind(), GetICState(), GetExtraICState(), GetStubType(), GetStubFlags()); Handle<Code> new_object = factory->NewCode( desc, flags, masm.CodeObject(), NeedsImmovableCode()); return new_object; } Handle<Code> CodeStub::GetCode(Isolate* isolate) { Factory* factory = isolate->factory(); Heap* heap = isolate->heap(); Code* code; if (UseSpecialCache() ? FindCodeInSpecialCache(&code, isolate) : FindCodeInCache(&code, isolate)) { ASSERT(IsPregenerated() == code->is_pregenerated()); return Handle<Code>(code); } { HandleScope scope(isolate); Handle<Code> new_object = GenerateCode(); new_object->set_major_key(MajorKey()); FinishCode(new_object); RecordCodeGeneration(*new_object, isolate); #ifdef ENABLE_DISASSEMBLER if (FLAG_print_code_stubs) { new_object->Disassemble(*GetName()); PrintF("\n"); } #endif if (UseSpecialCache()) { AddToSpecialCache(new_object); } else { // Update the dictionary and the root in Heap. Handle<UnseededNumberDictionary> dict = factory->DictionaryAtNumberPut( Handle<UnseededNumberDictionary>(heap->code_stubs()), GetKey(), new_object); heap->public_set_code_stubs(*dict); } code = *new_object; } Activate(code); ASSERT(!NeedsImmovableCode() || heap->lo_space()->Contains(code) || heap->code_space()->FirstPage()->Contains(code->address())); return Handle<Code>(code, isolate); } const char* CodeStub::MajorName(CodeStub::Major major_key, bool allow_unknown_keys) { switch (major_key) { #define DEF_CASE(name) case name: return #name "Stub"; CODE_STUB_LIST(DEF_CASE) #undef DEF_CASE default: if (!allow_unknown_keys) { UNREACHABLE(); } return NULL; } } void CodeStub::PrintName(StringStream* stream) { stream->Add("%s", MajorName(MajorKey(), false)); } void BinaryOpStub::Generate(MacroAssembler* masm) { // Explicitly allow generation of nested stubs. It is safe here because // generation code does not use any raw pointers. AllowStubCallsScope allow_stub_calls(masm, true); BinaryOpIC::TypeInfo operands_type = Max(left_type_, right_type_); if (left_type_ == BinaryOpIC::ODDBALL && right_type_ == BinaryOpIC::ODDBALL) { // The OddballStub handles a number and an oddball, not two oddballs. operands_type = BinaryOpIC::GENERIC; } switch (operands_type) { case BinaryOpIC::UNINITIALIZED: GenerateTypeTransition(masm); break; case BinaryOpIC::SMI: GenerateSmiStub(masm); break; case BinaryOpIC::INT32: GenerateInt32Stub(masm); break; case BinaryOpIC::NUMBER: GenerateNumberStub(masm); break; case BinaryOpIC::ODDBALL: GenerateOddballStub(masm); break; case BinaryOpIC::STRING: GenerateStringStub(masm); break; case BinaryOpIC::GENERIC: GenerateGeneric(masm); break; default: UNREACHABLE(); } } #define __ ACCESS_MASM(masm) void BinaryOpStub::GenerateCallRuntime(MacroAssembler* masm) { switch (op_) { case Token::ADD: __ InvokeBuiltin(Builtins::ADD, CALL_FUNCTION); break; case Token::SUB: __ InvokeBuiltin(Builtins::SUB, CALL_FUNCTION); break; case Token::MUL: __ InvokeBuiltin(Builtins::MUL, CALL_FUNCTION); break; case Token::DIV: __ InvokeBuiltin(Builtins::DIV, CALL_FUNCTION); break; case Token::MOD: __ InvokeBuiltin(Builtins::MOD, CALL_FUNCTION); break; case Token::BIT_OR: __ InvokeBuiltin(Builtins::BIT_OR, CALL_FUNCTION); break; case Token::BIT_AND: __ InvokeBuiltin(Builtins::BIT_AND, CALL_FUNCTION); break; case Token::BIT_XOR: __ InvokeBuiltin(Builtins::BIT_XOR, CALL_FUNCTION); break; case Token::SAR: __ InvokeBuiltin(Builtins::SAR, CALL_FUNCTION); break; case Token::SHR: __ InvokeBuiltin(Builtins::SHR, CALL_FUNCTION); break; case Token::SHL: __ InvokeBuiltin(Builtins::SHL, CALL_FUNCTION); break; default: UNREACHABLE(); } } #undef __ void BinaryOpStub::PrintName(StringStream* stream) { const char* op_name = Token::Name(op_); const char* overwrite_name; switch (mode_) { case NO_OVERWRITE: overwrite_name = "Alloc"; break; case OVERWRITE_RIGHT: overwrite_name = "OverwriteRight"; break; case OVERWRITE_LEFT: overwrite_name = "OverwriteLeft"; break; default: overwrite_name = "UnknownOverwrite"; break; } stream->Add("BinaryOpStub_%s_%s_%s+%s", op_name, overwrite_name, BinaryOpIC::GetName(left_type_), BinaryOpIC::GetName(right_type_)); } void BinaryOpStub::GenerateStringStub(MacroAssembler* masm) { ASSERT(left_type_ == BinaryOpIC::STRING || right_type_ == BinaryOpIC::STRING); ASSERT(op_ == Token::ADD); if (left_type_ == BinaryOpIC::STRING && right_type_ == BinaryOpIC::STRING) { GenerateBothStringStub(masm); return; } // Try to add arguments as strings, otherwise, transition to the generic // BinaryOpIC type. GenerateAddStrings(masm); GenerateTypeTransition(masm); } InlineCacheState ICCompareStub::GetICState() { CompareIC::State state = Max(left_, right_); switch (state) { case CompareIC::UNINITIALIZED: return ::v8::internal::UNINITIALIZED; case CompareIC::SMI: case CompareIC::NUMBER: case CompareIC::INTERNALIZED_STRING: case CompareIC::STRING: case CompareIC::UNIQUE_NAME: case CompareIC::OBJECT: case CompareIC::KNOWN_OBJECT: return MONOMORPHIC; case CompareIC::GENERIC: return ::v8::internal::GENERIC; } UNREACHABLE(); return ::v8::internal::UNINITIALIZED; } void ICCompareStub::AddToSpecialCache(Handle<Code> new_object) { ASSERT(*known_map_ != NULL); Isolate* isolate = new_object->GetIsolate(); Factory* factory = isolate->factory(); return Map::UpdateCodeCache(known_map_, strict() ? factory->strict_compare_ic_string() : factory->compare_ic_string(), new_object); } bool ICCompareStub::FindCodeInSpecialCache(Code** code_out, Isolate* isolate) { Factory* factory = isolate->factory(); Code::Flags flags = Code::ComputeFlags( GetCodeKind(), UNINITIALIZED); ASSERT(op_ == Token::EQ || op_ == Token::EQ_STRICT); Handle<Object> probe( known_map_->FindInCodeCache( strict() ? *factory->strict_compare_ic_string() : *factory->compare_ic_string(), flags), isolate); if (probe->IsCode()) { *code_out = Code::cast(*probe); #ifdef DEBUG Token::Value cached_op; ICCompareStub::DecodeMinorKey((*code_out)->stub_info(), NULL, NULL, NULL, &cached_op); ASSERT(op_ == cached_op); #endif return true; } return false; } int ICCompareStub::MinorKey() { return OpField::encode(op_ - Token::EQ) | LeftStateField::encode(left_) | RightStateField::encode(right_) | HandlerStateField::encode(state_); } void ICCompareStub::DecodeMinorKey(int minor_key, CompareIC::State* left_state, CompareIC::State* right_state, CompareIC::State* handler_state, Token::Value* op) { if (left_state) { *left_state = static_cast<CompareIC::State>(LeftStateField::decode(minor_key)); } if (right_state) { *right_state = static_cast<CompareIC::State>(RightStateField::decode(minor_key)); } if (handler_state) { *handler_state = static_cast<CompareIC::State>(HandlerStateField::decode(minor_key)); } if (op) { *op = static_cast<Token::Value>(OpField::decode(minor_key) + Token::EQ); } } void ICCompareStub::Generate(MacroAssembler* masm) { switch (state_) { case CompareIC::UNINITIALIZED: GenerateMiss(masm); break; case CompareIC::SMI: GenerateSmis(masm); break; case CompareIC::NUMBER: GenerateNumbers(masm); break; case CompareIC::STRING: GenerateStrings(masm); break; case CompareIC::INTERNALIZED_STRING: GenerateInternalizedStrings(masm); break; case CompareIC::UNIQUE_NAME: GenerateUniqueNames(masm); break; case CompareIC::OBJECT: GenerateObjects(masm); break; case CompareIC::KNOWN_OBJECT: ASSERT(*known_map_ != NULL); GenerateKnownObjects(masm); break; case CompareIC::GENERIC: GenerateGeneric(masm); break; } } void CompareNilICStub::Record(Handle<Object> object) { ASSERT(state_ != State::Generic()); if (object->IsNull()) { state_.Add(NULL_TYPE); } else if (object->IsUndefined()) { state_.Add(UNDEFINED); } else if (object->IsUndetectableObject() || object->IsOddball() || !object->IsHeapObject()) { state_ = State::Generic(); } else if (IsMonomorphic()) { state_ = State::Generic(); } else { state_.Add(MONOMORPHIC_MAP); } } void CompareNilICStub::State::TraceTransition(State to) const { #ifdef DEBUG if (!FLAG_trace_ic) return; char buffer[100]; NoAllocationStringAllocator allocator(buffer, static_cast<unsigned>(sizeof(buffer))); StringStream stream(&allocator); stream.Add("[CompareNilIC : "); Print(&stream); stream.Add("=>"); to.Print(&stream); stream.Add("]\n"); stream.OutputToStdOut(); #endif } void CompareNilICStub::PrintName(StringStream* stream) { stream->Add("CompareNilICStub_"); state_.Print(stream); stream->Add((nil_value_ == kNullValue) ? "(NullValue|": "(UndefinedValue|"); } void CompareNilICStub::State::Print(StringStream* stream) const { stream->Add("("); SimpleListPrinter printer(stream); if (IsEmpty()) printer.Add("None"); if (Contains(UNDEFINED)) printer.Add("Undefined"); if (Contains(NULL_TYPE)) printer.Add("Null"); if (Contains(MONOMORPHIC_MAP)) printer.Add("MonomorphicMap"); if (Contains(UNDETECTABLE)) printer.Add("Undetectable"); if (Contains(GENERIC)) printer.Add("Generic"); stream->Add(")"); } Handle<Type> CompareNilICStub::StateToType( Isolate* isolate, State state, Handle<Map> map) { if (state.Contains(CompareNilICStub::GENERIC)) { return handle(Type::Any(), isolate); } Handle<Type> result(Type::None(), isolate); if (state.Contains(CompareNilICStub::UNDEFINED)) { result = handle(Type::Union(result, handle(Type::Undefined(), isolate)), isolate); } if (state.Contains(CompareNilICStub::NULL_TYPE)) { result = handle(Type::Union(result, handle(Type::Null(), isolate)), isolate); } if (state.Contains(CompareNilICStub::UNDETECTABLE)) { result = handle(Type::Union(result, handle(Type::Undetectable(), isolate)), isolate); } else if (state.Contains(CompareNilICStub::MONOMORPHIC_MAP)) { Type* type = map.is_null() ? Type::Detectable() : Type::Class(map); result = handle(Type::Union(result, handle(type, isolate)), isolate); } return result; } void InstanceofStub::PrintName(StringStream* stream) { const char* args = ""; if (HasArgsInRegisters()) { args = "_REGS"; } const char* inline_check = ""; if (HasCallSiteInlineCheck()) { inline_check = "_INLINE"; } const char* return_true_false_object = ""; if (ReturnTrueFalseObject()) { return_true_false_object = "_TRUEFALSE"; } stream->Add("InstanceofStub%s%s%s", args, inline_check, return_true_false_object); } void JSEntryStub::FinishCode(Handle<Code> code) { Handle<FixedArray> handler_table = code->GetIsolate()->factory()->NewFixedArray(1, TENURED); handler_table->set(0, Smi::FromInt(handler_offset_)); code->set_handler_table(*handler_table); } void KeyedLoadDictionaryElementStub::Generate(MacroAssembler* masm) { KeyedLoadStubCompiler::GenerateLoadDictionaryElement(masm); } void KeyedStoreElementStub::Generate(MacroAssembler* masm) { switch (elements_kind_) { case FAST_ELEMENTS: case FAST_HOLEY_ELEMENTS: case FAST_SMI_ELEMENTS: case FAST_HOLEY_SMI_ELEMENTS: { KeyedStoreStubCompiler::GenerateStoreFastElement(masm, is_js_array_, elements_kind_, store_mode_); } break; case FAST_DOUBLE_ELEMENTS: case FAST_HOLEY_DOUBLE_ELEMENTS: KeyedStoreStubCompiler::GenerateStoreFastDoubleElement(masm, is_js_array_, store_mode_); break; case EXTERNAL_BYTE_ELEMENTS: case EXTERNAL_UNSIGNED_BYTE_ELEMENTS: case EXTERNAL_SHORT_ELEMENTS: case EXTERNAL_UNSIGNED_SHORT_ELEMENTS: case EXTERNAL_INT_ELEMENTS: case EXTERNAL_UNSIGNED_INT_ELEMENTS: case EXTERNAL_FLOAT_ELEMENTS: case EXTERNAL_DOUBLE_ELEMENTS: case EXTERNAL_PIXEL_ELEMENTS: KeyedStoreStubCompiler::GenerateStoreExternalArray(masm, elements_kind_); break; case DICTIONARY_ELEMENTS: KeyedStoreStubCompiler::GenerateStoreDictionaryElement(masm); break; case NON_STRICT_ARGUMENTS_ELEMENTS: UNREACHABLE(); break; } } void ArgumentsAccessStub::PrintName(StringStream* stream) { stream->Add("ArgumentsAccessStub_"); switch (type_) { case READ_ELEMENT: stream->Add("ReadElement"); break; case NEW_NON_STRICT_FAST: stream->Add("NewNonStrictFast"); break; case NEW_NON_STRICT_SLOW: stream->Add("NewNonStrictSlow"); break; case NEW_STRICT: stream->Add("NewStrict"); break; } } void CallFunctionStub::PrintName(StringStream* stream) { stream->Add("CallFunctionStub_Args%d", argc_); if (ReceiverMightBeImplicit()) stream->Add("_Implicit"); if (RecordCallTarget()) stream->Add("_Recording"); } void CallConstructStub::PrintName(StringStream* stream) { stream->Add("CallConstructStub"); if (RecordCallTarget()) stream->Add("_Recording"); } bool ToBooleanStub::Record(Handle<Object> object) { Types old_types(types_); bool to_boolean_value = types_.Record(object); old_types.TraceTransition(types_); return to_boolean_value; } void ToBooleanStub::PrintName(StringStream* stream) { stream->Add("ToBooleanStub_"); types_.Print(stream); } void ToBooleanStub::Types::Print(StringStream* stream) const { stream->Add("("); SimpleListPrinter printer(stream); if (IsEmpty()) printer.Add("None"); if (Contains(UNDEFINED)) printer.Add("Undefined"); if (Contains(BOOLEAN)) printer.Add("Bool"); if (Contains(NULL_TYPE)) printer.Add("Null"); if (Contains(SMI)) printer.Add("Smi"); if (Contains(SPEC_OBJECT)) printer.Add("SpecObject"); if (Contains(STRING)) printer.Add("String"); if (Contains(SYMBOL)) printer.Add("Symbol"); if (Contains(HEAP_NUMBER)) printer.Add("HeapNumber"); stream->Add(")"); } void ToBooleanStub::Types::TraceTransition(Types to) const { #ifdef DEBUG if (!FLAG_trace_ic) return; char buffer[100]; NoAllocationStringAllocator allocator(buffer, static_cast<unsigned>(sizeof(buffer))); StringStream stream(&allocator); stream.Add("[ToBooleanIC : "); Print(&stream); stream.Add("=>"); to.Print(&stream); stream.Add("]\n"); stream.OutputToStdOut(); #endif } bool ToBooleanStub::Types::Record(Handle<Object> object) { if (object->IsUndefined()) { Add(UNDEFINED); return false; } else if (object->IsBoolean()) { Add(BOOLEAN); return object->IsTrue(); } else if (object->IsNull()) { Add(NULL_TYPE); return false; } else if (object->IsSmi()) { Add(SMI); return Smi::cast(*object)->value() != 0; } else if (object->IsSpecObject()) { Add(SPEC_OBJECT); return !object->IsUndetectableObject(); } else if (object->IsString()) { Add(STRING); return !object->IsUndetectableObject() && String::cast(*object)->length() != 0; } else if (object->IsSymbol()) { Add(SYMBOL); return true; } else if (object->IsHeapNumber()) { ASSERT(!object->IsUndetectableObject()); Add(HEAP_NUMBER); double value = HeapNumber::cast(*object)->value(); return value != 0 && !std::isnan(value); } else { // We should never see an internal object at runtime here! UNREACHABLE(); return true; } } bool ToBooleanStub::Types::NeedsMap() const { return Contains(ToBooleanStub::SPEC_OBJECT) || Contains(ToBooleanStub::STRING) || Contains(ToBooleanStub::SYMBOL) || Contains(ToBooleanStub::HEAP_NUMBER); } bool ToBooleanStub::Types::CanBeUndetectable() const { return Contains(ToBooleanStub::SPEC_OBJECT) || Contains(ToBooleanStub::STRING); } void ElementsTransitionAndStoreStub::Generate(MacroAssembler* masm) { Label fail; AllocationSiteMode mode = AllocationSiteInfo::GetMode(from_, to_); ASSERT(!IsFastHoleyElementsKind(from_) || IsFastHoleyElementsKind(to_)); if (!FLAG_trace_elements_transitions) { if (IsFastSmiOrObjectElementsKind(to_)) { if (IsFastSmiOrObjectElementsKind(from_)) { ElementsTransitionGenerator:: GenerateMapChangeElementsTransition(masm, mode, &fail); } else if (IsFastDoubleElementsKind(from_)) { ASSERT(!IsFastSmiElementsKind(to_)); ElementsTransitionGenerator::GenerateDoubleToObject(masm, mode, &fail); } else { UNREACHABLE(); } KeyedStoreStubCompiler::GenerateStoreFastElement(masm, is_jsarray_, to_, store_mode_); } else if (IsFastSmiElementsKind(from_) && IsFastDoubleElementsKind(to_)) { ElementsTransitionGenerator::GenerateSmiToDouble(masm, mode, &fail); KeyedStoreStubCompiler::GenerateStoreFastDoubleElement(masm, is_jsarray_, store_mode_); } else if (IsFastDoubleElementsKind(from_)) { ASSERT(to_ == FAST_HOLEY_DOUBLE_ELEMENTS); ElementsTransitionGenerator:: GenerateMapChangeElementsTransition(masm, mode, &fail); } else { UNREACHABLE(); } } masm->bind(&fail); KeyedStoreIC::GenerateRuntimeSetProperty(masm, strict_mode_); } void StubFailureTrampolineStub::GenerateAheadOfTime(Isolate* isolate) { StubFailureTrampolineStub stub1(NOT_JS_FUNCTION_STUB_MODE); StubFailureTrampolineStub stub2(JS_FUNCTION_STUB_MODE); stub1.GetCode(isolate)->set_is_pregenerated(true); stub2.GetCode(isolate)->set_is_pregenerated(true); } FunctionEntryHook ProfileEntryHookStub::entry_hook_ = NULL; void ProfileEntryHookStub::EntryHookTrampoline(intptr_t function, intptr_t stack_pointer) { if (entry_hook_ != NULL) entry_hook_(function, stack_pointer); } bool ProfileEntryHookStub::SetFunctionEntryHook(FunctionEntryHook entry_hook) { // We don't allow setting a new entry hook over one that's // already active, as the hooks won't stack. if (entry_hook != 0 && entry_hook_ != 0) return false; entry_hook_ = entry_hook; return true; } static void InstallDescriptor(Isolate* isolate, HydrogenCodeStub* stub) { int major_key = stub->MajorKey(); CodeStubInterfaceDescriptor* descriptor = isolate->code_stub_interface_descriptor(major_key); if (!descriptor->initialized()) { stub->InitializeInterfaceDescriptor(isolate, descriptor); } } void ArrayConstructorStubBase::InstallDescriptors(Isolate* isolate) { ArrayNoArgumentConstructorStub stub1(GetInitialFastElementsKind()); InstallDescriptor(isolate, &stub1); ArraySingleArgumentConstructorStub stub2(GetInitialFastElementsKind()); InstallDescriptor(isolate, &stub2); ArrayNArgumentsConstructorStub stub3(GetInitialFastElementsKind()); InstallDescriptor(isolate, &stub3); } ArrayConstructorStub::ArrayConstructorStub(Isolate* isolate) : argument_count_(ANY) { ArrayConstructorStubBase::GenerateStubsAheadOfTime(isolate); } ArrayConstructorStub::ArrayConstructorStub(Isolate* isolate, int argument_count) { if (argument_count == 0) { argument_count_ = NONE; } else if (argument_count == 1) { argument_count_ = ONE; } else if (argument_count >= 2) { argument_count_ = MORE_THAN_ONE; } else { UNREACHABLE(); } ArrayConstructorStubBase::GenerateStubsAheadOfTime(isolate); } void InternalArrayConstructorStubBase::InstallDescriptors(Isolate* isolate) { InternalArrayNoArgumentConstructorStub stub1(FAST_ELEMENTS); InstallDescriptor(isolate, &stub1); InternalArraySingleArgumentConstructorStub stub2(FAST_ELEMENTS); InstallDescriptor(isolate, &stub2); InternalArrayNArgumentsConstructorStub stub3(FAST_ELEMENTS); InstallDescriptor(isolate, &stub3); } InternalArrayConstructorStub::InternalArrayConstructorStub( Isolate* isolate) { InternalArrayConstructorStubBase::GenerateStubsAheadOfTime(isolate); } } } // namespace v8::internal

[ "gaye@mozilla.com" ]

gaye@mozilla.com

c688324b2fca80a20724968ceb91c1f4fca2ac8f

a0fba5c81df7d408362807c55c0eec609819cb69

/share/qt_property_browser/src/qtpropertymanager.cpp

4ec3e987042fa9b3e188f543e0ee1cdf118e1131

[]

no_license

cuixiongyi/hiveground-ros-pkg

23edf94b9f0cb85184fce8a3116226f9733756d1

134377e42af9fcc852a3709257a9499edd941242

refs/heads/master

2021-01-10T12:41:00.140152

2013-07-10T08:11:36

53,974,217

0

null

UTF-8

C++

false

212,012

cpp

/**************************************************************************** ** ** Copyright (C) 2012 Digia Plc and/or its subsidiary(-ies). ** Contact: http://www.qt-project.org/legal ** ** This file is part of the Qt Solutions component. ** ** $QT_BEGIN_LICENSE:BSD$ ** You may use this file under the terms of the BSD license as follows: ** ** "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 Digia Plc and its Subsidiary(-ies) 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." ** ** $QT_END_LICENSE$ ** ****************************************************************************/ #include "qtpropertymanager.h" #include "qtpropertybrowserutils_p.h" #include <QDateTime> #include <QLocale> #include <QMap> #include <QTimer> #include <QIcon> #include <QMetaEnum> #include <QFontDatabase> #include <QStyleOption> #include <QStyle> #include <QApplication> #include <QPainter> #include <QLabel> #include <QCheckBox> #include <QLineEdit> #include <limits.h> #include <float.h> #if defined(Q_CC_MSVC) # pragma warning(disable: 4786) /* MS VS 6: truncating debug info after 255 characters */ #endif #if QT_VERSION >= 0x040400 QT_BEGIN_NAMESPACE #endif template <class PrivateData, class Value> static void setSimpleMinimumData(PrivateData *data, const Value &minVal) { data->minVal = minVal; if (data->maxVal < data->minVal) data->maxVal = data->minVal; if (data->val < data->minVal) data->val = data->minVal; } template <class PrivateData, class Value> static void setSimpleMaximumData(PrivateData *data, const Value &maxVal) { data->maxVal = maxVal; if (data->minVal > data->maxVal) data->minVal = data->maxVal; if (data->val > data->maxVal) data->val = data->maxVal; } template <class PrivateData, class Value> static void setSizeMinimumData(PrivateData *data, const Value &newMinVal) { data->minVal = newMinVal; if (data->maxVal.width() < data->minVal.width()) data->maxVal.setWidth(data->minVal.width()); if (data->maxVal.height() < data->minVal.height()) data->maxVal.setHeight(data->minVal.height()); if (data->val.width() < data->minVal.width()) data->val.setWidth(data->minVal.width()); if (data->val.height() < data->minVal.height()) data->val.setHeight(data->minVal.height()); } template <class PrivateData, class Value> static void setSizeMaximumData(PrivateData *data, const Value &newMaxVal) { data->maxVal = newMaxVal; if (data->minVal.width() > data->maxVal.width()) data->minVal.setWidth(data->maxVal.width()); if (data->minVal.height() > data->maxVal.height()) data->minVal.setHeight(data->maxVal.height()); if (data->val.width() > data->maxVal.width()) data->val.setWidth(data->maxVal.width()); if (data->val.height() > data->maxVal.height()) data->val.setHeight(data->maxVal.height()); } template <class SizeValue> static SizeValue qBoundSize(const SizeValue &minVal, const SizeValue &val, const SizeValue &maxVal) { SizeValue croppedVal = val; if (minVal.width() > val.width()) croppedVal.setWidth(minVal.width()); else if (maxVal.width() < val.width()) croppedVal.setWidth(maxVal.width()); if (minVal.height() > val.height()) croppedVal.setHeight(minVal.height()); else if (maxVal.height() < val.height()) croppedVal.setHeight(maxVal.height()); return croppedVal; } // Match the exact signature of qBound for VS 6. QSize qBound(QSize minVal, QSize val, QSize maxVal) { return qBoundSize(minVal, val, maxVal); } QSizeF qBound(QSizeF minVal, QSizeF val, QSizeF maxVal) { return qBoundSize(minVal, val, maxVal); } namespace { namespace { template <class Value> void orderBorders(Value &minVal, Value &maxVal) { if (minVal > maxVal) qSwap(minVal, maxVal); } template <class Value> static void orderSizeBorders(Value &minVal, Value &maxVal) { Value fromSize = minVal; Value toSize = maxVal; if (fromSize.width() > toSize.width()) { fromSize.setWidth(maxVal.width()); toSize.setWidth(minVal.width()); } if (fromSize.height() > toSize.height()) { fromSize.setHeight(maxVal.height()); toSize.setHeight(minVal.height()); } minVal = fromSize; maxVal = toSize; } void orderBorders(QSize &minVal, QSize &maxVal) { orderSizeBorders(minVal, maxVal); } void orderBorders(QSizeF &minVal, QSizeF &maxVal) { orderSizeBorders(minVal, maxVal); } } } //////// template <class Value, class PrivateData> static Value getData(const QMap<const QtProperty *, PrivateData> &propertyMap, Value PrivateData::*data, const QtProperty *property, const Value &defaultValue = Value()) { typedef QMap<const QtProperty *, PrivateData> PropertyToData; typedef typename PropertyToData::const_iterator PropertyToDataConstIterator; const PropertyToDataConstIterator it = propertyMap.constFind(property); if (it == propertyMap.constEnd()) return defaultValue; return it.value().*data; } template <class Value, class PrivateData> static Value getValue(const QMap<const QtProperty *, PrivateData> &propertyMap, const QtProperty *property, const Value &defaultValue = Value()) { return getData<Value>(propertyMap, &PrivateData::val, property, defaultValue); } template <class Value, class PrivateData> static Value getMinimum(const QMap<const QtProperty *, PrivateData> &propertyMap, const QtProperty *property, const Value &defaultValue = Value()) { return getData<Value>(propertyMap, &PrivateData::minVal, property, defaultValue); } template <class Value, class PrivateData> static Value getMaximum(const QMap<const QtProperty *, PrivateData> &propertyMap, const QtProperty *property, const Value &defaultValue = Value()) { return getData<Value>(propertyMap, &PrivateData::maxVal, property, defaultValue); } template <class ValueChangeParameter, class Value, class PropertyManager> static void setSimpleValue(QMap<const QtProperty *, Value> &propertyMap, PropertyManager *manager, void (PropertyManager::*propertyChangedSignal)(QtProperty *), void (PropertyManager::*valueChangedSignal)(QtProperty *, ValueChangeParameter), QtProperty *property, const Value &val) { typedef QMap<const QtProperty *, Value> PropertyToData; typedef typename PropertyToData::iterator PropertyToDataIterator; const PropertyToDataIterator it = propertyMap.find(property); if (it == propertyMap.end()) return; if (it.value() == val) return; it.value() = val; Q_EMIT (manager->*propertyChangedSignal)(property); Q_EMIT (manager->*valueChangedSignal)(property, val); } template <class ValueChangeParameter, class PropertyManagerPrivate, class PropertyManager, class Value> static void setValueInRange(PropertyManager *manager, PropertyManagerPrivate *managerPrivate, void (PropertyManager::*propertyChangedSignal)(QtProperty *), void (PropertyManager::*valueChangedSignal)(QtProperty *, ValueChangeParameter), QtProperty *property, const Value &val, void (PropertyManagerPrivate::*setSubPropertyValue)(QtProperty *, ValueChangeParameter)) { typedef typename PropertyManagerPrivate::Data PrivateData; typedef QMap<const QtProperty *, PrivateData> PropertyToData; typedef typename PropertyToData::iterator PropertyToDataIterator; const PropertyToDataIterator it = managerPrivate->m_values.find(property); if (it == managerPrivate->m_values.end()) return; PrivateData &data = it.value(); if (data.val == val) return; const Value oldVal = data.val; data.val = qBound(data.minVal, val, data.maxVal); if (data.val == oldVal) return; if (setSubPropertyValue) (managerPrivate->*setSubPropertyValue)(property, data.val); Q_EMIT (manager->*propertyChangedSignal)(property); Q_EMIT (manager->*valueChangedSignal)(property, data.val); } template <class ValueChangeParameter, class PropertyManagerPrivate, class PropertyManager, class Value> static void setBorderValues(PropertyManager *manager, PropertyManagerPrivate *managerPrivate, void (PropertyManager::*propertyChangedSignal)(QtProperty *), void (PropertyManager::*valueChangedSignal)(QtProperty *, ValueChangeParameter), void (PropertyManager::*rangeChangedSignal)(QtProperty *, ValueChangeParameter, ValueChangeParameter), QtProperty *property, const Value &minVal, const Value &maxVal, void (PropertyManagerPrivate::*setSubPropertyRange)(QtProperty *, ValueChangeParameter, ValueChangeParameter, ValueChangeParameter)) { typedef typename PropertyManagerPrivate::Data PrivateData; typedef QMap<const QtProperty *, PrivateData> PropertyToData; typedef typename PropertyToData::iterator PropertyToDataIterator; const PropertyToDataIterator it = managerPrivate->m_values.find(property); if (it == managerPrivate->m_values.end()) return; Value fromVal = minVal; Value toVal = maxVal; orderBorders(fromVal, toVal); PrivateData &data = it.value(); if (data.minVal == fromVal && data.maxVal == toVal) return; const Value oldVal = data.val; data.setMinimumValue(fromVal); data.setMaximumValue(toVal); Q_EMIT (manager->*rangeChangedSignal)(property, data.minVal, data.maxVal); if (setSubPropertyRange) (managerPrivate->*setSubPropertyRange)(property, data.minVal, data.maxVal, data.val); if (data.val == oldVal) return; Q_EMIT (manager->*propertyChangedSignal)(property); Q_EMIT (manager->*valueChangedSignal)(property, data.val); } template <class ValueChangeParameter, class PropertyManagerPrivate, class PropertyManager, class Value, class PrivateData> static void setBorderValue(PropertyManager *manager, PropertyManagerPrivate *managerPrivate, void (PropertyManager::*propertyChangedSignal)(QtProperty *), void (PropertyManager::*valueChangedSignal)(QtProperty *, ValueChangeParameter), void (PropertyManager::*rangeChangedSignal)(QtProperty *, ValueChangeParameter, ValueChangeParameter), QtProperty *property, Value (PrivateData::*getRangeVal)() const, void (PrivateData::*setRangeVal)(ValueChangeParameter), const Value &borderVal, void (PropertyManagerPrivate::*setSubPropertyRange)(QtProperty *, ValueChangeParameter, ValueChangeParameter, ValueChangeParameter)) { typedef QMap<const QtProperty *, PrivateData> PropertyToData; typedef typename PropertyToData::iterator PropertyToDataIterator; const PropertyToDataIterator it = managerPrivate->m_values.find(property); if (it == managerPrivate->m_values.end()) return; PrivateData &data = it.value(); if ((data.*getRangeVal)() == borderVal) return; const Value oldVal = data.val; (data.*setRangeVal)(borderVal); Q_EMIT (manager->*rangeChangedSignal)(property, data.minVal, data.maxVal); if (setSubPropertyRange) (managerPrivate->*setSubPropertyRange)(property, data.minVal, data.maxVal, data.val); if (data.val == oldVal) return; Q_EMIT (manager->*propertyChangedSignal)(property); Q_EMIT (manager->*valueChangedSignal)(property, data.val); } template <class ValueChangeParameter, class PropertyManagerPrivate, class PropertyManager, class Value, class PrivateData> static void setMinimumValue(PropertyManager *manager, PropertyManagerPrivate *managerPrivate, void (PropertyManager::*propertyChangedSignal)(QtProperty *), void (PropertyManager::*valueChangedSignal)(QtProperty *, ValueChangeParameter), void (PropertyManager::*rangeChangedSignal)(QtProperty *, ValueChangeParameter, ValueChangeParameter), QtProperty *property, const Value &minVal) { void (PropertyManagerPrivate::*setSubPropertyRange)(QtProperty *, ValueChangeParameter, ValueChangeParameter, ValueChangeParameter) = 0; setBorderValue<ValueChangeParameter, PropertyManagerPrivate, PropertyManager, Value, PrivateData>(manager, managerPrivate, propertyChangedSignal, valueChangedSignal, rangeChangedSignal, property, &PropertyManagerPrivate::Data::minimumValue, &PropertyManagerPrivate::Data::setMinimumValue, minVal, setSubPropertyRange); } template <class ValueChangeParameter, class PropertyManagerPrivate, class PropertyManager, class Value, class PrivateData> static void setMaximumValue(PropertyManager *manager, PropertyManagerPrivate *managerPrivate, void (PropertyManager::*propertyChangedSignal)(QtProperty *), void (PropertyManager::*valueChangedSignal)(QtProperty *, ValueChangeParameter), void (PropertyManager::*rangeChangedSignal)(QtProperty *, ValueChangeParameter, ValueChangeParameter), QtProperty *property, const Value &maxVal) { void (PropertyManagerPrivate::*setSubPropertyRange)(QtProperty *, ValueChangeParameter, ValueChangeParameter, ValueChangeParameter) = 0; setBorderValue<ValueChangeParameter, PropertyManagerPrivate, PropertyManager, Value, PrivateData>(manager, managerPrivate, propertyChangedSignal, valueChangedSignal, rangeChangedSignal, property, &PropertyManagerPrivate::Data::maximumValue, &PropertyManagerPrivate::Data::setMaximumValue, maxVal, setSubPropertyRange); } class QtMetaEnumWrapper : public QObject { Q_OBJECT Q_PROPERTY(QSizePolicy::Policy policy READ policy) public: QSizePolicy::Policy policy() const { return QSizePolicy::Ignored; } private: QtMetaEnumWrapper(QObject *parent) : QObject(parent) {} }; class QtMetaEnumProvider { public: QtMetaEnumProvider(); QStringList policyEnumNames() const { return m_policyEnumNames; } QStringList languageEnumNames() const { return m_languageEnumNames; } QStringList countryEnumNames(QLocale::Language language) const { return m_countryEnumNames.value(language); } QSizePolicy::Policy indexToSizePolicy(int index) const; int sizePolicyToIndex(QSizePolicy::Policy policy) const; void indexToLocale(int languageIndex, int countryIndex, QLocale::Language *language, QLocale::Country *country) const; void localeToIndex(QLocale::Language language, QLocale::Country country, int *languageIndex, int *countryIndex) const; private: void initLocale(); QStringList m_policyEnumNames; QStringList m_languageEnumNames; QMap<QLocale::Language, QStringList> m_countryEnumNames; QMap<int, QLocale::Language> m_indexToLanguage; QMap<QLocale::Language, int> m_languageToIndex; QMap<int, QMap<int, QLocale::Country> > m_indexToCountry; QMap<QLocale::Language, QMap<QLocale::Country, int> > m_countryToIndex; QMetaEnum m_policyEnum; }; #if QT_VERSION < 0x040300 static QList<QLocale::Country> countriesForLanguage(QLocale::Language language) { QList<QLocale::Country> countries; QLocale::Country country = QLocale::AnyCountry; while (country <= QLocale::LastCountry) { QLocale locale(language, country); if (locale.language() == language && !countries.contains(locale.country())) countries << locale.country(); country = (QLocale::Country)((uint)country + 1); // ++country } return countries; } #endif static QList<QLocale::Country> sortCountries(const QList<QLocale::Country> &countries) { QMultiMap<QString, QLocale::Country> nameToCountry; QListIterator<QLocale::Country> itCountry(countries); while (itCountry.hasNext()) { QLocale::Country country = itCountry.next(); nameToCountry.insert(QLocale::countryToString(country), country); } return nameToCountry.values(); } void QtMetaEnumProvider::initLocale() { QMultiMap<QString, QLocale::Language> nameToLanguage; QLocale::Language language = QLocale::C; while (language <= QLocale::LastLanguage) { QLocale locale(language); if (locale.language() == language) nameToLanguage.insert(QLocale::languageToString(language), language); language = (QLocale::Language)((uint)language + 1); // ++language } const QLocale system = QLocale::system(); if (!nameToLanguage.contains(QLocale::languageToString(system.language()))) nameToLanguage.insert(QLocale::languageToString(system.language()), system.language()); QList<QLocale::Language> languages = nameToLanguage.values(); QListIterator<QLocale::Language> itLang(languages); while (itLang.hasNext()) { QLocale::Language language = itLang.next(); QList<QLocale::Country> countries; #if QT_VERSION < 0x040300 countries = countriesForLanguage(language); #else countries = QLocale::countriesForLanguage(language); #endif if (countries.isEmpty() && language == system.language()) countries << system.country(); if (!countries.isEmpty() && !m_languageToIndex.contains(language)) { countries = sortCountries(countries); int langIdx = m_languageEnumNames.count(); m_indexToLanguage[langIdx] = language; m_languageToIndex[language] = langIdx; QStringList countryNames; QListIterator<QLocale::Country> it(countries); int countryIdx = 0; while (it.hasNext()) { QLocale::Country country = it.next(); countryNames << QLocale::countryToString(country); m_indexToCountry[langIdx][countryIdx] = country; m_countryToIndex[language][country] = countryIdx; ++countryIdx; } m_languageEnumNames << QLocale::languageToString(language); m_countryEnumNames[language] = countryNames; } } } QtMetaEnumProvider::QtMetaEnumProvider() { QMetaProperty p; p = QtMetaEnumWrapper::staticMetaObject.property( QtMetaEnumWrapper::staticMetaObject.propertyOffset() + 0); m_policyEnum = p.enumerator(); const int keyCount = m_policyEnum.keyCount(); for (int i = 0; i < keyCount; i++) m_policyEnumNames << QLatin1String(m_policyEnum.key(i)); initLocale(); } QSizePolicy::Policy QtMetaEnumProvider::indexToSizePolicy(int index) const { return static_cast<QSizePolicy::Policy>(m_policyEnum.value(index)); } int QtMetaEnumProvider::sizePolicyToIndex(QSizePolicy::Policy policy) const { const int keyCount = m_policyEnum.keyCount(); for (int i = 0; i < keyCount; i++) if (indexToSizePolicy(i) == policy) return i; return -1; } void QtMetaEnumProvider::indexToLocale(int languageIndex, int countryIndex, QLocale::Language *language, QLocale::Country *country) const { QLocale::Language l = QLocale::C; QLocale::Country c = QLocale::AnyCountry; if (m_indexToLanguage.contains(languageIndex)) { l = m_indexToLanguage[languageIndex]; if (m_indexToCountry.contains(languageIndex) && m_indexToCountry[languageIndex].contains(countryIndex)) c = m_indexToCountry[languageIndex][countryIndex]; } if (language) *language = l; if (country) *country = c; } void QtMetaEnumProvider::localeToIndex(QLocale::Language language, QLocale::Country country, int *languageIndex, int *countryIndex) const { int l = -1; int c = -1; if (m_languageToIndex.contains(language)) { l = m_languageToIndex[language]; if (m_countryToIndex.contains(language) && m_countryToIndex[language].contains(country)) c = m_countryToIndex[language][country]; } if (languageIndex) *languageIndex = l; if (countryIndex) *countryIndex = c; } Q_GLOBAL_STATIC(QtMetaEnumProvider, metaEnumProvider) // QtGroupPropertyManager /*! \class QtGroupPropertyManager \brief The QtGroupPropertyManager provides and manages group properties. This class is intended to provide a grouping element without any value. \sa QtAbstractPropertyManager */ /*! Creates a manager with the given \a parent. */ QtGroupPropertyManager::QtGroupPropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { } /*! Destroys this manager, and all the properties it has created. */ QtGroupPropertyManager::~QtGroupPropertyManager() { } /*! \reimp */ bool QtGroupPropertyManager::hasValue(const QtProperty *property) const { Q_UNUSED(property) return false; } /*! \reimp */ void QtGroupPropertyManager::initializeProperty(QtProperty *property) { Q_UNUSED(property) } /*! \reimp */ void QtGroupPropertyManager::uninitializeProperty(QtProperty *property) { Q_UNUSED(property) } // QtIntPropertyManager class QtIntPropertyManagerPrivate { QtIntPropertyManager *q_ptr; Q_DECLARE_PUBLIC(QtIntPropertyManager) public: struct Data { Data() : val(0), minVal(-INT_MAX), maxVal(INT_MAX), singleStep(1) {} int val; int minVal; int maxVal; int singleStep; int minimumValue() const { return minVal; } int maximumValue() const { return maxVal; } void setMinimumValue(int newMinVal) { setSimpleMinimumData(this, newMinVal); } void setMaximumValue(int newMaxVal) { setSimpleMaximumData(this, newMaxVal); } }; typedef QMap<const QtProperty *, Data> PropertyValueMap; PropertyValueMap m_values; }; /*! \class QtIntPropertyManager \brief The QtIntPropertyManager provides and manages int properties. An int property has a current value, and a range specifying the valid values. The range is defined by a minimum and a maximum value. The property's value and range can be retrieved using the value(), minimum() and maximum() functions, and can be set using the setValue(), setMinimum() and setMaximum() slots. Alternatively, the range can be defined in one go using the setRange() slot. In addition, QtIntPropertyManager provides the valueChanged() signal which is Q_EMITted whenever a property created by this manager changes, and the rangeChanged() signal which is Q_EMITted whenever such a property changes its range of valid values. \sa QtAbstractPropertyManager, QtSpinBoxFactory, QtSliderFactory, QtScrollBarFactory */ /*! \fn void QtIntPropertyManager::valueChanged(QtProperty *property, int value) This signal is Q_EMITted whenever a property created by this manager changes its value, passing a pointer to the \a property and the new \a value as parameters. \sa setValue() */ /*! \fn void QtIntPropertyManager::rangeChanged(QtProperty *property, int minimum, int maximum) This signal is Q_EMITted whenever a property created by this manager changes its range of valid values, passing a pointer to the \a property and the new \a minimum and \a maximum values. \sa setRange() */ /*! \fn void QtIntPropertyManager::singleStepChanged(QtProperty *property, int step) This signal is Q_EMITted whenever a property created by this manager changes its single step property, passing a pointer to the \a property and the new \a step value \sa setSingleStep() */ /*! Creates a manager with the given \a parent. */ QtIntPropertyManager::QtIntPropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { d_ptr = new QtIntPropertyManagerPrivate; d_ptr->q_ptr = this; } /*! Destroys this manager, and all the properties it has created. */ QtIntPropertyManager::~QtIntPropertyManager() { clear(); delete d_ptr; } /*! Returns the given \a property's value. If the given property is not managed by this manager, this function returns 0. \sa setValue() */ int QtIntPropertyManager::value(const QtProperty *property) const { return getValue<int>(d_ptr->m_values, property, 0); } /*! Returns the given \a property's minimum value. \sa setMinimum(), maximum(), setRange() */ int QtIntPropertyManager::minimum(const QtProperty *property) const { return getMinimum<int>(d_ptr->m_values, property, 0); } /*! Returns the given \a property's maximum value. \sa setMaximum(), minimum(), setRange() */ int QtIntPropertyManager::maximum(const QtProperty *property) const { return getMaximum<int>(d_ptr->m_values, property, 0); } /*! Returns the given \a property's step value. The step is typically used to increment or decrement a property value while pressing an arrow key. \sa setSingleStep() */ int QtIntPropertyManager::singleStep(const QtProperty *property) const { return getData<int>(d_ptr->m_values, &QtIntPropertyManagerPrivate::Data::singleStep, property, 0); } /*! \reimp */ QString QtIntPropertyManager::valueText(const QtProperty *property) const { const QtIntPropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); return QString::number(it.value().val); } /*! \fn void QtIntPropertyManager::setValue(QtProperty *property, int value) Sets the value of the given \a property to \a value. If the specified \a value is not valid according to the given \a property's range, the \a value is adjusted to the nearest valid value within the range. \sa value(), setRange(), valueChanged() */ void QtIntPropertyManager::setValue(QtProperty *property, int val) { void (QtIntPropertyManagerPrivate::*setSubPropertyValue)(QtProperty *, int) = 0; setValueInRange<int, QtIntPropertyManagerPrivate, QtIntPropertyManager, int>(this, d_ptr, &QtIntPropertyManager::propertyChanged, &QtIntPropertyManager::valueChanged, property, val, setSubPropertyValue); } /*! Sets the minimum value for the given \a property to \a minVal. When setting the minimum value, the maximum and current values are adjusted if necessary (ensuring that the range remains valid and that the current value is within the range). \sa minimum(), setRange(), rangeChanged() */ void QtIntPropertyManager::setMinimum(QtProperty *property, int minVal) { setMinimumValue<int, QtIntPropertyManagerPrivate, QtIntPropertyManager, int, QtIntPropertyManagerPrivate::Data>(this, d_ptr, &QtIntPropertyManager::propertyChanged, &QtIntPropertyManager::valueChanged, &QtIntPropertyManager::rangeChanged, property, minVal); } /*! Sets the maximum value for the given \a property to \a maxVal. When setting maximum value, the minimum and current values are adjusted if necessary (ensuring that the range remains valid and that the current value is within the range). \sa maximum(), setRange(), rangeChanged() */ void QtIntPropertyManager::setMaximum(QtProperty *property, int maxVal) { setMaximumValue<int, QtIntPropertyManagerPrivate, QtIntPropertyManager, int, QtIntPropertyManagerPrivate::Data>(this, d_ptr, &QtIntPropertyManager::propertyChanged, &QtIntPropertyManager::valueChanged, &QtIntPropertyManager::rangeChanged, property, maxVal); } /*! \fn void QtIntPropertyManager::setRange(QtProperty *property, int minimum, int maximum) Sets the range of valid values. This is a convenience function defining the range of valid values in one go; setting the \a minimum and \a maximum values for the given \a property with a single function call. When setting a new range, the current value is adjusted if necessary (ensuring that the value remains within range). \sa setMinimum(), setMaximum(), rangeChanged() */ void QtIntPropertyManager::setRange(QtProperty *property, int minVal, int maxVal) { void (QtIntPropertyManagerPrivate::*setSubPropertyRange)(QtProperty *, int, int, int) = 0; setBorderValues<int, QtIntPropertyManagerPrivate, QtIntPropertyManager, int>(this, d_ptr, &QtIntPropertyManager::propertyChanged, &QtIntPropertyManager::valueChanged, &QtIntPropertyManager::rangeChanged, property, minVal, maxVal, setSubPropertyRange); } /*! Sets the step value for the given \a property to \a step. The step is typically used to increment or decrement a property value while pressing an arrow key. \sa singleStep() */ void QtIntPropertyManager::setSingleStep(QtProperty *property, int step) { const QtIntPropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; QtIntPropertyManagerPrivate::Data data = it.value(); if (step < 0) step = 0; if (data.singleStep == step) return; data.singleStep = step; it.value() = data; Q_EMIT singleStepChanged(property, data.singleStep); } /*! \reimp */ void QtIntPropertyManager::initializeProperty(QtProperty *property) { d_ptr->m_values[property] = QtIntPropertyManagerPrivate::Data(); } /*! \reimp */ void QtIntPropertyManager::uninitializeProperty(QtProperty *property) { d_ptr->m_values.remove(property); } // QtDoublePropertyManager class QtDoublePropertyManagerPrivate { QtDoublePropertyManager *q_ptr; Q_DECLARE_PUBLIC(QtDoublePropertyManager) public: struct Data { Data() : val(0), minVal(-INT_MAX), maxVal(INT_MAX), singleStep(1), decimals(2) {} double val; double minVal; double maxVal; double singleStep; int decimals; double minimumValue() const { return minVal; } double maximumValue() const { return maxVal; } void setMinimumValue(double newMinVal) { setSimpleMinimumData(this, newMinVal); } void setMaximumValue(double newMaxVal) { setSimpleMaximumData(this, newMaxVal); } }; typedef QMap<const QtProperty *, Data> PropertyValueMap; PropertyValueMap m_values; }; /*! \class QtDoublePropertyManager \brief The QtDoublePropertyManager provides and manages double properties. A double property has a current value, and a range specifying the valid values. The range is defined by a minimum and a maximum value. The property's value and range can be retrieved using the value(), minimum() and maximum() functions, and can be set using the setValue(), setMinimum() and setMaximum() slots. Alternatively, the range can be defined in one go using the setRange() slot. In addition, QtDoublePropertyManager provides the valueChanged() signal which is Q_EMITted whenever a property created by this manager changes, and the rangeChanged() signal which is Q_EMITted whenever such a property changes its range of valid values. \sa QtAbstractPropertyManager, QtDoubleSpinBoxFactory */ /*! \fn void QtDoublePropertyManager::valueChanged(QtProperty *property, double value) This signal is Q_EMITted whenever a property created by this manager changes its value, passing a pointer to the \a property and the new \a value as parameters. \sa setValue() */ /*! \fn void QtDoublePropertyManager::rangeChanged(QtProperty *property, double minimum, double maximum) This signal is Q_EMITted whenever a property created by this manager changes its range of valid values, passing a pointer to the \a property and the new \a minimum and \a maximum values \sa setRange() */ /*! \fn void QtDoublePropertyManager::decimalsChanged(QtProperty *property, int prec) This signal is Q_EMITted whenever a property created by this manager changes its precision of value, passing a pointer to the \a property and the new \a prec value \sa setDecimals() */ /*! \fn void QtDoublePropertyManager::singleStepChanged(QtProperty *property, double step) This signal is Q_EMITted whenever a property created by this manager changes its single step property, passing a pointer to the \a property and the new \a step value \sa setSingleStep() */ /*! Creates a manager with the given \a parent. */ QtDoublePropertyManager::QtDoublePropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { d_ptr = new QtDoublePropertyManagerPrivate; d_ptr->q_ptr = this; } /*! Destroys this manager, and all the properties it has created. */ QtDoublePropertyManager::~QtDoublePropertyManager() { clear(); delete d_ptr; } /*! Returns the given \a property's value. If the given property is not managed by this manager, this function returns 0. \sa setValue() */ double QtDoublePropertyManager::value(const QtProperty *property) const { return getValue<double>(d_ptr->m_values, property, 0.0); } /*! Returns the given \a property's minimum value. \sa maximum(), setRange() */ double QtDoublePropertyManager::minimum(const QtProperty *property) const { return getMinimum<double>(d_ptr->m_values, property, 0.0); } /*! Returns the given \a property's maximum value. \sa minimum(), setRange() */ double QtDoublePropertyManager::maximum(const QtProperty *property) const { return getMaximum<double>(d_ptr->m_values, property, 0.0); } /*! Returns the given \a property's step value. The step is typically used to increment or decrement a property value while pressing an arrow key. \sa setSingleStep() */ double QtDoublePropertyManager::singleStep(const QtProperty *property) const { return getData<double>(d_ptr->m_values, &QtDoublePropertyManagerPrivate::Data::singleStep, property, 0); } /*! Returns the given \a property's precision, in decimals. \sa setDecimals() */ int QtDoublePropertyManager::decimals(const QtProperty *property) const { return getData<int>(d_ptr->m_values, &QtDoublePropertyManagerPrivate::Data::decimals, property, 0); } /*! \reimp */ QString QtDoublePropertyManager::valueText(const QtProperty *property) const { const QtDoublePropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); return QLocale::system().toString(it.value().val, 'f', it.value().decimals); } /*! \fn void QtDoublePropertyManager::setValue(QtProperty *property, double value) Sets the value of the given \a property to \a value. If the specified \a value is not valid according to the given \a property's range, the \a value is adjusted to the nearest valid value within the range. \sa value(), setRange(), valueChanged() */ void QtDoublePropertyManager::setValue(QtProperty *property, double val) { void (QtDoublePropertyManagerPrivate::*setSubPropertyValue)(QtProperty *, double) = 0; setValueInRange<double, QtDoublePropertyManagerPrivate, QtDoublePropertyManager, double>(this, d_ptr, &QtDoublePropertyManager::propertyChanged, &QtDoublePropertyManager::valueChanged, property, val, setSubPropertyValue); } /*! Sets the step value for the given \a property to \a step. The step is typically used to increment or decrement a property value while pressing an arrow key. \sa singleStep() */ void QtDoublePropertyManager::setSingleStep(QtProperty *property, double step) { const QtDoublePropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; QtDoublePropertyManagerPrivate::Data data = it.value(); if (step < 0) step = 0; if (data.singleStep == step) return; data.singleStep = step; it.value() = data; Q_EMIT singleStepChanged(property, data.singleStep); } /*! \fn void QtDoublePropertyManager::setDecimals(QtProperty *property, int prec) Sets the precision of the given \a property to \a prec. The valid decimal range is 0-13. The default is 2. \sa decimals() */ void QtDoublePropertyManager::setDecimals(QtProperty *property, int prec) { const QtDoublePropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; QtDoublePropertyManagerPrivate::Data data = it.value(); if (prec > 13) prec = 13; else if (prec < 0) prec = 0; if (data.decimals == prec) return; data.decimals = prec; it.value() = data; Q_EMIT decimalsChanged(property, data.decimals); } /*! Sets the minimum value for the given \a property to \a minVal. When setting the minimum value, the maximum and current values are adjusted if necessary (ensuring that the range remains valid and that the current value is within in the range). \sa minimum(), setRange(), rangeChanged() */ void QtDoublePropertyManager::setMinimum(QtProperty *property, double minVal) { setMinimumValue<double, QtDoublePropertyManagerPrivate, QtDoublePropertyManager, double, QtDoublePropertyManagerPrivate::Data>(this, d_ptr, &QtDoublePropertyManager::propertyChanged, &QtDoublePropertyManager::valueChanged, &QtDoublePropertyManager::rangeChanged, property, minVal); } /*! Sets the maximum value for the given \a property to \a maxVal. When setting the maximum value, the minimum and current values are adjusted if necessary (ensuring that the range remains valid and that the current value is within in the range). \sa maximum(), setRange(), rangeChanged() */ void QtDoublePropertyManager::setMaximum(QtProperty *property, double maxVal) { setMaximumValue<double, QtDoublePropertyManagerPrivate, QtDoublePropertyManager, double, QtDoublePropertyManagerPrivate::Data>(this, d_ptr, &QtDoublePropertyManager::propertyChanged, &QtDoublePropertyManager::valueChanged, &QtDoublePropertyManager::rangeChanged, property, maxVal); } /*! \fn void QtDoublePropertyManager::setRange(QtProperty *property, double minimum, double maximum) Sets the range of valid values. This is a convenience function defining the range of valid values in one go; setting the \a minimum and \a maximum values for the given \a property with a single function call. When setting a new range, the current value is adjusted if necessary (ensuring that the value remains within range). \sa setMinimum(), setMaximum(), rangeChanged() */ void QtDoublePropertyManager::setRange(QtProperty *property, double minVal, double maxVal) { void (QtDoublePropertyManagerPrivate::*setSubPropertyRange)(QtProperty *, double, double, double) = 0; setBorderValues<double, QtDoublePropertyManagerPrivate, QtDoublePropertyManager, double>(this, d_ptr, &QtDoublePropertyManager::propertyChanged, &QtDoublePropertyManager::valueChanged, &QtDoublePropertyManager::rangeChanged, property, minVal, maxVal, setSubPropertyRange); } /*! \reimp */ void QtDoublePropertyManager::initializeProperty(QtProperty *property) { d_ptr->m_values[property] = QtDoublePropertyManagerPrivate::Data(); } /*! \reimp */ void QtDoublePropertyManager::uninitializeProperty(QtProperty *property) { d_ptr->m_values.remove(property); } // QtStringPropertyManager class QtStringPropertyManagerPrivate { QtStringPropertyManager *q_ptr; Q_DECLARE_PUBLIC(QtStringPropertyManager) public: struct Data { Data() : regExp(QString(QLatin1Char('*')), Qt::CaseSensitive, QRegExp::Wildcard), echoMode(QLineEdit::Normal) { } QString val; QRegExp regExp; int echoMode; }; typedef QMap<const QtProperty *, Data> PropertyValueMap; QMap<const QtProperty *, Data> m_values; }; /*! \class QtStringPropertyManager \brief The QtStringPropertyManager provides and manages QString properties. A string property's value can be retrieved using the value() function, and set using the setValue() slot. The current value can be checked against a regular expression. To set the regular expression use the setRegExp() slot, use the regExp() function to retrieve the currently set expression. In addition, QtStringPropertyManager provides the valueChanged() signal which is Q_EMITted whenever a property created by this manager changes, and the regExpChanged() signal which is Q_EMITted whenever such a property changes its currently set regular expression. \sa QtAbstractPropertyManager, QtLineEditFactory */ /*! \fn void QtStringPropertyManager::valueChanged(QtProperty *property, const QString &value) This signal is Q_EMITted whenever a property created by this manager changes its value, passing a pointer to the \a property and the new \a value as parameters. \sa setValue() */ /*! \fn void QtStringPropertyManager::regExpChanged(QtProperty *property, const QRegExp &regExp) This signal is Q_EMITted whenever a property created by this manager changes its currenlty set regular expression, passing a pointer to the \a property and the new \a regExp as parameters. \sa setRegExp() */ /*! Creates a manager with the given \a parent. */ QtStringPropertyManager::QtStringPropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { d_ptr = new QtStringPropertyManagerPrivate; d_ptr->q_ptr = this; } /*! Destroys this manager, and all the properties it has created. */ QtStringPropertyManager::~QtStringPropertyManager() { clear(); delete d_ptr; } /*! Returns the given \a property's value. If the given property is not managed by this manager, this function returns an empty string. \sa setValue() */ QString QtStringPropertyManager::value(const QtProperty *property) const { return getValue<QString>(d_ptr->m_values, property); } /*! Returns the given \a property's currently set regular expression. If the given \a property is not managed by this manager, this function returns an empty expression. \sa setRegExp() */ QRegExp QtStringPropertyManager::regExp(const QtProperty *property) const { return getData<QRegExp>(d_ptr->m_values, &QtStringPropertyManagerPrivate::Data::regExp, property, QRegExp()); } /*! \reimp */ EchoMode QtStringPropertyManager::echoMode(const QtProperty *property) const { return (EchoMode)getData<int>(d_ptr->m_values, &QtStringPropertyManagerPrivate::Data::echoMode, property, 0); } /*! \reimp */ QString QtStringPropertyManager::valueText(const QtProperty *property) const { const QtStringPropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); return it.value().val; } /*! \reimp */ QString QtStringPropertyManager::displayText(const QtProperty *property) const { const QtStringPropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); QLineEdit edit; edit.setEchoMode((EchoMode)it.value().echoMode); edit.setText(it.value().val); return edit.displayText(); } /*! \fn void QtStringPropertyManager::setValue(QtProperty *property, const QString &value) Sets the value of the given \a property to \a value. If the specified \a value doesn't match the given \a property's regular expression, this function does nothing. \sa value(), setRegExp(), valueChanged() */ void QtStringPropertyManager::setValue(QtProperty *property, const QString &val) { const QtStringPropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; QtStringPropertyManagerPrivate::Data data = it.value(); if (data.val == val) return; if (data.regExp.isValid() && !data.regExp.exactMatch(val)) return; data.val = val; it.value() = data; Q_EMIT propertyChanged(property); Q_EMIT valueChanged(property, data.val); } /*! Sets the regular expression of the given \a property to \a regExp. \sa regExp(), setValue(), regExpChanged() */ void QtStringPropertyManager::setRegExp(QtProperty *property, const QRegExp &regExp) { const QtStringPropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; QtStringPropertyManagerPrivate::Data data = it.value() ; if (data.regExp == regExp) return; data.regExp = regExp; it.value() = data; Q_EMIT regExpChanged(property, data.regExp); } void QtStringPropertyManager::setEchoMode(QtProperty *property, EchoMode echoMode) { const QtStringPropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; QtStringPropertyManagerPrivate::Data data = it.value(); if (data.echoMode == echoMode) return; data.echoMode = echoMode; it.value() = data; Q_EMIT propertyChanged(property); Q_EMIT echoModeChanged(property, data.echoMode); } /*! \reimp */ void QtStringPropertyManager::initializeProperty(QtProperty *property) { d_ptr->m_values[property] = QtStringPropertyManagerPrivate::Data(); } /*! \reimp */ void QtStringPropertyManager::uninitializeProperty(QtProperty *property) { d_ptr->m_values.remove(property); } // QtBoolPropertyManager // Return an icon containing a check box indicator static QIcon drawCheckBox(bool value) { QStyleOptionButton opt; opt.state |= value ? QStyle::State_On : QStyle::State_Off; opt.state |= QStyle::State_Enabled; const QStyle *style = QApplication::style(); // Figure out size of an indicator and make sure it is not scaled down in a list view item // by making the pixmap as big as a list view icon and centering the indicator in it. // (if it is smaller, it can't be helped) const int indicatorWidth = style->pixelMetric(QStyle::PM_IndicatorWidth, &opt); const int indicatorHeight = style->pixelMetric(QStyle::PM_IndicatorHeight, &opt); const int listViewIconSize = indicatorWidth; const int pixmapWidth = indicatorWidth; const int pixmapHeight = qMax(indicatorHeight, listViewIconSize); opt.rect = QRect(0, 0, indicatorWidth, indicatorHeight); QPixmap pixmap = QPixmap(pixmapWidth, pixmapHeight); pixmap.fill(Qt::transparent); { // Center? const int xoff = (pixmapWidth > indicatorWidth) ? (pixmapWidth - indicatorWidth) / 2 : 0; const int yoff = (pixmapHeight > indicatorHeight) ? (pixmapHeight - indicatorHeight) / 2 : 0; QPainter painter(&pixmap); painter.translate(xoff, yoff); style->drawPrimitive(QStyle::PE_IndicatorCheckBox, &opt, &painter); } return QIcon(pixmap); } class QtBoolPropertyManagerPrivate { QtBoolPropertyManager *q_ptr; Q_DECLARE_PUBLIC(QtBoolPropertyManager) public: QtBoolPropertyManagerPrivate(); QMap<const QtProperty *, bool> m_values; const QIcon m_checkedIcon; const QIcon m_uncheckedIcon; }; QtBoolPropertyManagerPrivate::QtBoolPropertyManagerPrivate() : m_checkedIcon(drawCheckBox(true)), m_uncheckedIcon(drawCheckBox(false)) { } /*! \class QtBoolPropertyManager \brief The QtBoolPropertyManager class provides and manages boolean properties. The property's value can be retrieved using the value() function, and set using the setValue() slot. In addition, QtBoolPropertyManager provides the valueChanged() signal which is Q_EMITted whenever a property created by this manager changes. \sa QtAbstractPropertyManager, QtCheckBoxFactory */ /*! \fn void QtBoolPropertyManager::valueChanged(QtProperty *property, bool value) This signal is Q_EMITted whenever a property created by this manager changes its value, passing a pointer to the \a property and the new \a value as parameters. */ /*! Creates a manager with the given \a parent. */ QtBoolPropertyManager::QtBoolPropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { d_ptr = new QtBoolPropertyManagerPrivate; d_ptr->q_ptr = this; } /*! Destroys this manager, and all the properties it has created. */ QtBoolPropertyManager::~QtBoolPropertyManager() { clear(); delete d_ptr; } /*! Returns the given \a property's value. If the given \a property is not managed by \e this manager, this function returns false. \sa setValue() */ bool QtBoolPropertyManager::value(const QtProperty *property) const { return d_ptr->m_values.value(property, false); } /*! \reimp */ QString QtBoolPropertyManager::valueText(const QtProperty *property) const { const QMap<const QtProperty *, bool>::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); static const QString trueText = tr("True"); static const QString falseText = tr("False"); return it.value() ? trueText : falseText; } /*! \reimp */ QIcon QtBoolPropertyManager::valueIcon(const QtProperty *property) const { const QMap<const QtProperty *, bool>::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QIcon(); return it.value() ? d_ptr->m_checkedIcon : d_ptr->m_uncheckedIcon; } /*! \fn void QtBoolPropertyManager::setValue(QtProperty *property, bool value) Sets the value of the given \a property to \a value. \sa value() */ void QtBoolPropertyManager::setValue(QtProperty *property, bool val) { setSimpleValue<bool, bool, QtBoolPropertyManager>(d_ptr->m_values, this, &QtBoolPropertyManager::propertyChanged, &QtBoolPropertyManager::valueChanged, property, val); } /*! \reimp */ void QtBoolPropertyManager::initializeProperty(QtProperty *property) { d_ptr->m_values[property] = false; } /*! \reimp */ void QtBoolPropertyManager::uninitializeProperty(QtProperty *property) { d_ptr->m_values.remove(property); } // QtDatePropertyManager class QtDatePropertyManagerPrivate { QtDatePropertyManager *q_ptr; Q_DECLARE_PUBLIC(QtDatePropertyManager) public: struct Data { Data() : val(QDate::currentDate()), minVal(QDate(1752, 9, 14)), maxVal(QDate(7999, 12, 31)) {} QDate val; QDate minVal; QDate maxVal; QDate minimumValue() const { return minVal; } QDate maximumValue() const { return maxVal; } void setMinimumValue(const QDate &newMinVal) { setSimpleMinimumData(this, newMinVal); } void setMaximumValue(const QDate &newMaxVal) { setSimpleMaximumData(this, newMaxVal); } }; QString m_format; typedef QMap<const QtProperty *, Data> PropertyValueMap; QMap<const QtProperty *, Data> m_values; }; /*! \class QtDatePropertyManager \brief The QtDatePropertyManager provides and manages QDate properties. A date property has a current value, and a range specifying the valid dates. The range is defined by a minimum and a maximum value. The property's values can be retrieved using the minimum(), maximum() and value() functions, and can be set using the setMinimum(), setMaximum() and setValue() slots. Alternatively, the range can be defined in one go using the setRange() slot. In addition, QtDatePropertyManager provides the valueChanged() signal which is Q_EMITted whenever a property created by this manager changes, and the rangeChanged() signal which is Q_EMITted whenever such a property changes its range of valid dates. \sa QtAbstractPropertyManager, QtDateEditFactory, QtDateTimePropertyManager */ /*! \fn void QtDatePropertyManager::valueChanged(QtProperty *property, const QDate &value) This signal is Q_EMITted whenever a property created by this manager changes its value, passing a pointer to the \a property and the new \a value as parameters. \sa setValue() */ /*! \fn void QtDatePropertyManager::rangeChanged(QtProperty *property, const QDate &minimum, const QDate &maximum) This signal is Q_EMITted whenever a property created by this manager changes its range of valid dates, passing a pointer to the \a property and the new \a minimum and \a maximum dates. \sa setRange() */ /*! Creates a manager with the given \a parent. */ QtDatePropertyManager::QtDatePropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { d_ptr = new QtDatePropertyManagerPrivate; d_ptr->q_ptr = this; QLocale loc; d_ptr->m_format = loc.dateFormat(QLocale::ShortFormat); } /*! Destroys this manager, and all the properties it has created. */ QtDatePropertyManager::~QtDatePropertyManager() { clear(); delete d_ptr; } /*! Returns the given \a property's value. If the given \a property is not managed by \e this manager, this function returns an invalid date. \sa setValue() */ QDate QtDatePropertyManager::value(const QtProperty *property) const { return getValue<QDate>(d_ptr->m_values, property); } /*! Returns the given \a property's minimum date. \sa maximum(), setRange() */ QDate QtDatePropertyManager::minimum(const QtProperty *property) const { return getMinimum<QDate>(d_ptr->m_values, property); } /*! Returns the given \a property's maximum date. \sa minimum(), setRange() */ QDate QtDatePropertyManager::maximum(const QtProperty *property) const { return getMaximum<QDate>(d_ptr->m_values, property); } /*! \reimp */ QString QtDatePropertyManager::valueText(const QtProperty *property) const { const QtDatePropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); return it.value().val.toString(d_ptr->m_format); } /*! \fn void QtDatePropertyManager::setValue(QtProperty *property, const QDate &value) Sets the value of the given \a property to \a value. If the specified \a value is not a valid date according to the given \a property's range, the value is adjusted to the nearest valid value within the range. \sa value(), setRange(), valueChanged() */ void QtDatePropertyManager::setValue(QtProperty *property, const QDate &val) { void (QtDatePropertyManagerPrivate::*setSubPropertyValue)(QtProperty *, const QDate &) = 0; setValueInRange<const QDate &, QtDatePropertyManagerPrivate, QtDatePropertyManager, const QDate>(this, d_ptr, &QtDatePropertyManager::propertyChanged, &QtDatePropertyManager::valueChanged, property, val, setSubPropertyValue); } /*! Sets the minimum value for the given \a property to \a minVal. When setting the minimum value, the maximum and current values are adjusted if necessary (ensuring that the range remains valid and that the current value is within in the range). \sa minimum(), setRange() */ void QtDatePropertyManager::setMinimum(QtProperty *property, const QDate &minVal) { setMinimumValue<const QDate &, QtDatePropertyManagerPrivate, QtDatePropertyManager, QDate, QtDatePropertyManagerPrivate::Data>(this, d_ptr, &QtDatePropertyManager::propertyChanged, &QtDatePropertyManager::valueChanged, &QtDatePropertyManager::rangeChanged, property, minVal); } /*! Sets the maximum value for the given \a property to \a maxVal. When setting the maximum value, the minimum and current values are adjusted if necessary (ensuring that the range remains valid and that the current value is within in the range). \sa maximum(), setRange() */ void QtDatePropertyManager::setMaximum(QtProperty *property, const QDate &maxVal) { setMaximumValue<const QDate &, QtDatePropertyManagerPrivate, QtDatePropertyManager, QDate, QtDatePropertyManagerPrivate::Data>(this, d_ptr, &QtDatePropertyManager::propertyChanged, &QtDatePropertyManager::valueChanged, &QtDatePropertyManager::rangeChanged, property, maxVal); } /*! \fn void QtDatePropertyManager::setRange(QtProperty *property, const QDate &minimum, const QDate &maximum) Sets the range of valid dates. This is a convenience function defining the range of valid dates in one go; setting the \a minimum and \a maximum values for the given \a property with a single function call. When setting a new date range, the current value is adjusted if necessary (ensuring that the value remains in date range). \sa setMinimum(), setMaximum(), rangeChanged() */ void QtDatePropertyManager::setRange(QtProperty *property, const QDate &minVal, const QDate &maxVal) { void (QtDatePropertyManagerPrivate::*setSubPropertyRange)(QtProperty *, const QDate &, const QDate &, const QDate &) = 0; setBorderValues<const QDate &, QtDatePropertyManagerPrivate, QtDatePropertyManager, QDate>(this, d_ptr, &QtDatePropertyManager::propertyChanged, &QtDatePropertyManager::valueChanged, &QtDatePropertyManager::rangeChanged, property, minVal, maxVal, setSubPropertyRange); } /*! \reimp */ void QtDatePropertyManager::initializeProperty(QtProperty *property) { d_ptr->m_values[property] = QtDatePropertyManagerPrivate::Data(); } /*! \reimp */ void QtDatePropertyManager::uninitializeProperty(QtProperty *property) { d_ptr->m_values.remove(property); } // QtTimePropertyManager class QtTimePropertyManagerPrivate { QtTimePropertyManager *q_ptr; Q_DECLARE_PUBLIC(QtTimePropertyManager) public: QString m_format; typedef QMap<const QtProperty *, QTime> PropertyValueMap; PropertyValueMap m_values; }; /*! \class QtTimePropertyManager \brief The QtTimePropertyManager provides and manages QTime properties. A time property's value can be retrieved using the value() function, and set using the setValue() slot. In addition, QtTimePropertyManager provides the valueChanged() signal which is Q_EMITted whenever a property created by this manager changes. \sa QtAbstractPropertyManager, QtTimeEditFactory */ /*! \fn void QtTimePropertyManager::valueChanged(QtProperty *property, const QTime &value) This signal is Q_EMITted whenever a property created by this manager changes its value, passing a pointer to the \a property and the new \a value as parameters. \sa setValue() */ /*! Creates a manager with the given \a parent. */ QtTimePropertyManager::QtTimePropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { d_ptr = new QtTimePropertyManagerPrivate; d_ptr->q_ptr = this; QLocale loc; d_ptr->m_format = loc.timeFormat(QLocale::ShortFormat); } /*! Destroys this manager, and all the properties it has created. */ QtTimePropertyManager::~QtTimePropertyManager() { clear(); delete d_ptr; } /*! Returns the given \a property's value. If the given property is not managed by this manager, this function returns an invalid time object. \sa setValue() */ QTime QtTimePropertyManager::value(const QtProperty *property) const { return d_ptr->m_values.value(property, QTime()); } /*! \reimp */ QString QtTimePropertyManager::valueText(const QtProperty *property) const { const QtTimePropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); return it.value().toString(d_ptr->m_format); } /*! \fn void QtTimePropertyManager::setValue(QtProperty *property, const QTime &value) Sets the value of the given \a property to \a value. \sa value(), valueChanged() */ void QtTimePropertyManager::setValue(QtProperty *property, const QTime &val) { setSimpleValue<const QTime &, QTime, QtTimePropertyManager>(d_ptr->m_values, this, &QtTimePropertyManager::propertyChanged, &QtTimePropertyManager::valueChanged, property, val); } /*! \reimp */ void QtTimePropertyManager::initializeProperty(QtProperty *property) { d_ptr->m_values[property] = QTime::currentTime(); } /*! \reimp */ void QtTimePropertyManager::uninitializeProperty(QtProperty *property) { d_ptr->m_values.remove(property); } // QtDateTimePropertyManager class QtDateTimePropertyManagerPrivate { QtDateTimePropertyManager *q_ptr; Q_DECLARE_PUBLIC(QtDateTimePropertyManager) public: QString m_format; typedef QMap<const QtProperty *, QDateTime> PropertyValueMap; PropertyValueMap m_values; }; /*! \class QtDateTimePropertyManager \brief The QtDateTimePropertyManager provides and manages QDateTime properties. A date and time property has a current value which can be retrieved using the value() function, and set using the setValue() slot. In addition, QtDateTimePropertyManager provides the valueChanged() signal which is Q_EMITted whenever a property created by this manager changes. \sa QtAbstractPropertyManager, QtDateTimeEditFactory, QtDatePropertyManager */ /*! \fn void QtDateTimePropertyManager::valueChanged(QtProperty *property, const QDateTime &value) This signal is Q_EMITted whenever a property created by this manager changes its value, passing a pointer to the \a property and the new \a value as parameters. */ /*! Creates a manager with the given \a parent. */ QtDateTimePropertyManager::QtDateTimePropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { d_ptr = new QtDateTimePropertyManagerPrivate; d_ptr->q_ptr = this; QLocale loc; d_ptr->m_format = loc.dateFormat(QLocale::ShortFormat); d_ptr->m_format += QLatin1Char(' '); d_ptr->m_format += loc.timeFormat(QLocale::ShortFormat); } /*! Destroys this manager, and all the properties it has created. */ QtDateTimePropertyManager::~QtDateTimePropertyManager() { clear(); delete d_ptr; } /*! Returns the given \a property's value. If the given \a property is not managed by this manager, this function returns an invalid QDateTime object. \sa setValue() */ QDateTime QtDateTimePropertyManager::value(const QtProperty *property) const { return d_ptr->m_values.value(property, QDateTime()); } /*! \reimp */ QString QtDateTimePropertyManager::valueText(const QtProperty *property) const { const QtDateTimePropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); return it.value().toString(d_ptr->m_format); } /*! \fn void QtDateTimePropertyManager::setValue(QtProperty *property, const QDateTime &value) Sets the value of the given \a property to \a value. \sa value(), valueChanged() */ void QtDateTimePropertyManager::setValue(QtProperty *property, const QDateTime &val) { setSimpleValue<const QDateTime &, QDateTime, QtDateTimePropertyManager>(d_ptr->m_values, this, &QtDateTimePropertyManager::propertyChanged, &QtDateTimePropertyManager::valueChanged, property, val); } /*! \reimp */ void QtDateTimePropertyManager::initializeProperty(QtProperty *property) { d_ptr->m_values[property] = QDateTime::currentDateTime(); } /*! \reimp */ void QtDateTimePropertyManager::uninitializeProperty(QtProperty *property) { d_ptr->m_values.remove(property); } // QtKeySequencePropertyManager class QtKeySequencePropertyManagerPrivate { QtKeySequencePropertyManager *q_ptr; Q_DECLARE_PUBLIC(QtKeySequencePropertyManager) public: QString m_format; typedef QMap<const QtProperty *, QKeySequence> PropertyValueMap; PropertyValueMap m_values; }; /*! \class QtKeySequencePropertyManager \brief The QtKeySequencePropertyManager provides and manages QKeySequence properties. A key sequence's value can be retrieved using the value() function, and set using the setValue() slot. In addition, QtKeySequencePropertyManager provides the valueChanged() signal which is Q_EMITted whenever a property created by this manager changes. \sa QtAbstractPropertyManager */ /*! \fn void QtKeySequencePropertyManager::valueChanged(QtProperty *property, const QKeySequence &value) This signal is Q_EMITted whenever a property created by this manager changes its value, passing a pointer to the \a property and the new \a value as parameters. */ /*! Creates a manager with the given \a parent. */ QtKeySequencePropertyManager::QtKeySequencePropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { d_ptr = new QtKeySequencePropertyManagerPrivate; d_ptr->q_ptr = this; } /*! Destroys this manager, and all the properties it has created. */ QtKeySequencePropertyManager::~QtKeySequencePropertyManager() { clear(); delete d_ptr; } /*! Returns the given \a property's value. If the given \a property is not managed by this manager, this function returns an empty QKeySequence object. \sa setValue() */ QKeySequence QtKeySequencePropertyManager::value(const QtProperty *property) const { return d_ptr->m_values.value(property, QKeySequence()); } /*! \reimp */ QString QtKeySequencePropertyManager::valueText(const QtProperty *property) const { const QtKeySequencePropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); return it.value().toString(QKeySequence::NativeText); } /*! \fn void QtKeySequencePropertyManager::setValue(QtProperty *property, const QKeySequence &value) Sets the value of the given \a property to \a value. \sa value(), valueChanged() */ void QtKeySequencePropertyManager::setValue(QtProperty *property, const QKeySequence &val) { setSimpleValue<const QKeySequence &, QKeySequence, QtKeySequencePropertyManager>(d_ptr->m_values, this, &QtKeySequencePropertyManager::propertyChanged, &QtKeySequencePropertyManager::valueChanged, property, val); } /*! \reimp */ void QtKeySequencePropertyManager::initializeProperty(QtProperty *property) { d_ptr->m_values[property] = QKeySequence(); } /*! \reimp */ void QtKeySequencePropertyManager::uninitializeProperty(QtProperty *property) { d_ptr->m_values.remove(property); } // QtCharPropertyManager class QtCharPropertyManagerPrivate { QtCharPropertyManager *q_ptr; Q_DECLARE_PUBLIC(QtCharPropertyManager) public: typedef QMap<const QtProperty *, QChar> PropertyValueMap; PropertyValueMap m_values; }; /*! \class QtCharPropertyManager \brief The QtCharPropertyManager provides and manages QChar properties. A char's value can be retrieved using the value() function, and set using the setValue() slot. In addition, QtCharPropertyManager provides the valueChanged() signal which is Q_EMITted whenever a property created by this manager changes. \sa QtAbstractPropertyManager */ /*! \fn void QtCharPropertyManager::valueChanged(QtProperty *property, const QChar &value) This signal is Q_EMITted whenever a property created by this manager changes its value, passing a pointer to the \a property and the new \a value as parameters. */ /*! Creates a manager with the given \a parent. */ QtCharPropertyManager::QtCharPropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { d_ptr = new QtCharPropertyManagerPrivate; d_ptr->q_ptr = this; } /*! Destroys this manager, and all the properties it has created. */ QtCharPropertyManager::~QtCharPropertyManager() { clear(); delete d_ptr; } /*! Returns the given \a property's value. If the given \a property is not managed by this manager, this function returns an null QChar object. \sa setValue() */ QChar QtCharPropertyManager::value(const QtProperty *property) const { return d_ptr->m_values.value(property, QChar()); } /*! \reimp */ QString QtCharPropertyManager::valueText(const QtProperty *property) const { const QtCharPropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); const QChar c = it.value(); return c.isNull() ? QString() : QString(c); } /*! \fn void QtCharPropertyManager::setValue(QtProperty *property, const QChar &value) Sets the value of the given \a property to \a value. \sa value(), valueChanged() */ void QtCharPropertyManager::setValue(QtProperty *property, const QChar &val) { setSimpleValue<const QChar &, QChar, QtCharPropertyManager>(d_ptr->m_values, this, &QtCharPropertyManager::propertyChanged, &QtCharPropertyManager::valueChanged, property, val); } /*! \reimp */ void QtCharPropertyManager::initializeProperty(QtProperty *property) { d_ptr->m_values[property] = QChar(); } /*! \reimp */ void QtCharPropertyManager::uninitializeProperty(QtProperty *property) { d_ptr->m_values.remove(property); } // QtLocalePropertyManager class QtLocalePropertyManagerPrivate { QtLocalePropertyManager *q_ptr; Q_DECLARE_PUBLIC(QtLocalePropertyManager) public: QtLocalePropertyManagerPrivate(); void slotEnumChanged(QtProperty *property, int value); void slotPropertyDestroyed(QtProperty *property); typedef QMap<const QtProperty *, QLocale> PropertyValueMap; PropertyValueMap m_values; QtEnumPropertyManager *m_enumPropertyManager; QMap<const QtProperty *, QtProperty *> m_propertyToLanguage; QMap<const QtProperty *, QtProperty *> m_propertyToCountry; QMap<const QtProperty *, QtProperty *> m_languageToProperty; QMap<const QtProperty *, QtProperty *> m_countryToProperty; }; QtLocalePropertyManagerPrivate::QtLocalePropertyManagerPrivate() { } void QtLocalePropertyManagerPrivate::slotEnumChanged(QtProperty *property, int value) { if (QtProperty *prop = m_languageToProperty.value(property, 0)) { const QLocale loc = m_values[prop]; QLocale::Language newLanguage = loc.language(); QLocale::Country newCountry = loc.country(); metaEnumProvider()->indexToLocale(value, 0, &newLanguage, 0); QLocale newLoc(newLanguage, newCountry); q_ptr->setValue(prop, newLoc); } else if (QtProperty *prop = m_countryToProperty.value(property, 0)) { const QLocale loc = m_values[prop]; QLocale::Language newLanguage = loc.language(); QLocale::Country newCountry = loc.country(); metaEnumProvider()->indexToLocale(m_enumPropertyManager->value(m_propertyToLanguage.value(prop)), value, &newLanguage, &newCountry); QLocale newLoc(newLanguage, newCountry); q_ptr->setValue(prop, newLoc); } } void QtLocalePropertyManagerPrivate::slotPropertyDestroyed(QtProperty *property) { if (QtProperty *subProp = m_languageToProperty.value(property, 0)) { m_propertyToLanguage[subProp] = 0; m_languageToProperty.remove(property); } else if (QtProperty *subProp = m_countryToProperty.value(property, 0)) { m_propertyToCountry[subProp] = 0; m_countryToProperty.remove(property); } } /*! \class QtLocalePropertyManager \brief The QtLocalePropertyManager provides and manages QLocale properties. A locale property has nested \e language and \e country subproperties. The top-level property's value can be retrieved using the value() function, and set using the setValue() slot. The subproperties are created by QtEnumPropertyManager object. These submanager can be retrieved using the subEnumPropertyManager() function. In order to provide editing widgets for the subproperties in a property browser widget, this manager must be associated with editor factory. In addition, QtLocalePropertyManager provides the valueChanged() signal which is Q_EMITted whenever a property created by this manager changes. \sa QtAbstractPropertyManager, QtEnumPropertyManager */ /*! \fn void QtLocalePropertyManager::valueChanged(QtProperty *property, const QLocale &value) This signal is Q_EMITted whenever a property created by this manager changes its value, passing a pointer to the \a property and the new \a value as parameters. \sa setValue() */ /*! Creates a manager with the given \a parent. */ QtLocalePropertyManager::QtLocalePropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { d_ptr = new QtLocalePropertyManagerPrivate; d_ptr->q_ptr = this; d_ptr->m_enumPropertyManager = new QtEnumPropertyManager(this); connect(d_ptr->m_enumPropertyManager, SIGNAL(valueChanged(QtProperty *, int)), this, SLOT(slotEnumChanged(QtProperty *, int))); connect(d_ptr->m_enumPropertyManager, SIGNAL(propertyDestroyed(QtProperty *)), this, SLOT(slotPropertyDestroyed(QtProperty *))); } /*! Destroys this manager, and all the properties it has created. */ QtLocalePropertyManager::~QtLocalePropertyManager() { clear(); delete d_ptr; } /*! Returns the manager that creates the nested \e language and \e country subproperties. In order to provide editing widgets for the mentioned subproperties in a property browser widget, this manager must be associated with an editor factory. \sa QtAbstractPropertyBrowser::setFactoryForManager() */ QtEnumPropertyManager *QtLocalePropertyManager::subEnumPropertyManager() const { return d_ptr->m_enumPropertyManager; } /*! Returns the given \a property's value. If the given property is not managed by this manager, this function returns the default locale. \sa setValue() */ QLocale QtLocalePropertyManager::value(const QtProperty *property) const { return d_ptr->m_values.value(property, QLocale()); } /*! \reimp */ QString QtLocalePropertyManager::valueText(const QtProperty *property) const { const QtLocalePropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); QLocale loc = it.value(); int langIdx = 0; int countryIdx = 0; metaEnumProvider()->localeToIndex(loc.language(), loc.country(), &langIdx, &countryIdx); QString str = tr("%1, %2") .arg(metaEnumProvider()->languageEnumNames().at(langIdx)) .arg(metaEnumProvider()->countryEnumNames(loc.language()).at(countryIdx)); return str; } /*! \fn void QtLocalePropertyManager::setValue(QtProperty *property, const QLocale &value) Sets the value of the given \a property to \a value. Nested properties are updated automatically. \sa value(), valueChanged() */ void QtLocalePropertyManager::setValue(QtProperty *property, const QLocale &val) { const QtLocalePropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; const QLocale loc = it.value(); if (loc == val) return; it.value() = val; int langIdx = 0; int countryIdx = 0; metaEnumProvider()->localeToIndex(val.language(), val.country(), &langIdx, &countryIdx); if (loc.language() != val.language()) { d_ptr->m_enumPropertyManager->setValue(d_ptr->m_propertyToLanguage.value(property), langIdx); d_ptr->m_enumPropertyManager->setEnumNames(d_ptr->m_propertyToCountry.value(property), metaEnumProvider()->countryEnumNames(val.language())); } d_ptr->m_enumPropertyManager->setValue(d_ptr->m_propertyToCountry.value(property), countryIdx); Q_EMIT propertyChanged(property); Q_EMIT valueChanged(property, val); } /*! \reimp */ void QtLocalePropertyManager::initializeProperty(QtProperty *property) { QLocale val; d_ptr->m_values[property] = val; int langIdx = 0; int countryIdx = 0; metaEnumProvider()->localeToIndex(val.language(), val.country(), &langIdx, &countryIdx); QtProperty *languageProp = d_ptr->m_enumPropertyManager->addProperty(); languageProp->setPropertyName(tr("Language")); d_ptr->m_enumPropertyManager->setEnumNames(languageProp, metaEnumProvider()->languageEnumNames()); d_ptr->m_enumPropertyManager->setValue(languageProp, langIdx); d_ptr->m_propertyToLanguage[property] = languageProp; d_ptr->m_languageToProperty[languageProp] = property; property->addSubProperty(languageProp); QtProperty *countryProp = d_ptr->m_enumPropertyManager->addProperty(); countryProp->setPropertyName(tr("Country")); d_ptr->m_enumPropertyManager->setEnumNames(countryProp, metaEnumProvider()->countryEnumNames(val.language())); d_ptr->m_enumPropertyManager->setValue(countryProp, countryIdx); d_ptr->m_propertyToCountry[property] = countryProp; d_ptr->m_countryToProperty[countryProp] = property; property->addSubProperty(countryProp); } /*! \reimp */ void QtLocalePropertyManager::uninitializeProperty(QtProperty *property) { QtProperty *languageProp = d_ptr->m_propertyToLanguage[property]; if (languageProp) { d_ptr->m_languageToProperty.remove(languageProp); delete languageProp; } d_ptr->m_propertyToLanguage.remove(property); QtProperty *countryProp = d_ptr->m_propertyToCountry[property]; if (countryProp) { d_ptr->m_countryToProperty.remove(countryProp); delete countryProp; } d_ptr->m_propertyToCountry.remove(property); d_ptr->m_values.remove(property); } // QtPointPropertyManager class QtPointPropertyManagerPrivate { QtPointPropertyManager *q_ptr; Q_DECLARE_PUBLIC(QtPointPropertyManager) public: void slotIntChanged(QtProperty *property, int value); void slotPropertyDestroyed(QtProperty *property); typedef QMap<const QtProperty *, QPoint> PropertyValueMap; PropertyValueMap m_values; QtIntPropertyManager *m_intPropertyManager; QMap<const QtProperty *, QtProperty *> m_propertyToX; QMap<const QtProperty *, QtProperty *> m_propertyToY; QMap<const QtProperty *, QtProperty *> m_xToProperty; QMap<const QtProperty *, QtProperty *> m_yToProperty; }; void QtPointPropertyManagerPrivate::slotIntChanged(QtProperty *property, int value) { if (QtProperty *xprop = m_xToProperty.value(property, 0)) { QPoint p = m_values[xprop]; p.setX(value); q_ptr->setValue(xprop, p); } else if (QtProperty *yprop = m_yToProperty.value(property, 0)) { QPoint p = m_values[yprop]; p.setY(value); q_ptr->setValue(yprop, p); } } void QtPointPropertyManagerPrivate::slotPropertyDestroyed(QtProperty *property) { if (QtProperty *pointProp = m_xToProperty.value(property, 0)) { m_propertyToX[pointProp] = 0; m_xToProperty.remove(property); } else if (QtProperty *pointProp = m_yToProperty.value(property, 0)) { m_propertyToY[pointProp] = 0; m_yToProperty.remove(property); } } /*! \class QtPointPropertyManager \brief The QtPointPropertyManager provides and manages QPoint properties. A point property has nested \e x and \e y subproperties. The top-level property's value can be retrieved using the value() function, and set using the setValue() slot. The subproperties are created by a QtIntPropertyManager object. This manager can be retrieved using the subIntPropertyManager() function. In order to provide editing widgets for the subproperties in a property browser widget, this manager must be associated with an editor factory. In addition, QtPointPropertyManager provides the valueChanged() signal which is Q_EMITted whenever a property created by this manager changes. \sa QtAbstractPropertyManager, QtIntPropertyManager, QtPointFPropertyManager */ /*! \fn void QtPointPropertyManager::valueChanged(QtProperty *property, const QPoint &value) This signal is Q_EMITted whenever a property created by this manager changes its value, passing a pointer to the \a property and the new \a value as parameters. \sa setValue() */ /*! Creates a manager with the given \a parent. */ QtPointPropertyManager::QtPointPropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { d_ptr = new QtPointPropertyManagerPrivate; d_ptr->q_ptr = this; d_ptr->m_intPropertyManager = new QtIntPropertyManager(this); connect(d_ptr->m_intPropertyManager, SIGNAL(valueChanged(QtProperty *, int)), this, SLOT(slotIntChanged(QtProperty *, int))); connect(d_ptr->m_intPropertyManager, SIGNAL(propertyDestroyed(QtProperty *)), this, SLOT(slotPropertyDestroyed(QtProperty *))); } /*! Destroys this manager, and all the properties it has created. */ QtPointPropertyManager::~QtPointPropertyManager() { clear(); delete d_ptr; } /*! Returns the manager that creates the nested \e x and \e y subproperties. In order to provide editing widgets for the subproperties in a property browser widget, this manager must be associated with an editor factory. \sa QtAbstractPropertyBrowser::setFactoryForManager() */ QtIntPropertyManager *QtPointPropertyManager::subIntPropertyManager() const { return d_ptr->m_intPropertyManager; } /*! Returns the given \a property's value. If the given \a property is not managed by this manager, this function returns a point with coordinates (0, 0). \sa setValue() */ QPoint QtPointPropertyManager::value(const QtProperty *property) const { return d_ptr->m_values.value(property, QPoint()); } /*! \reimp */ QString QtPointPropertyManager::valueText(const QtProperty *property) const { const QtPointPropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); const QPoint v = it.value(); return QString(tr("(%1, %2)").arg(QString::number(v.x())) .arg(QString::number(v.y()))); } /*! \fn void QtPointPropertyManager::setValue(QtProperty *property, const QPoint &value) Sets the value of the given \a property to \a value. Nested properties are updated automatically. \sa value(), valueChanged() */ void QtPointPropertyManager::setValue(QtProperty *property, const QPoint &val) { const QtPointPropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; if (it.value() == val) return; it.value() = val; d_ptr->m_intPropertyManager->setValue(d_ptr->m_propertyToX[property], val.x()); d_ptr->m_intPropertyManager->setValue(d_ptr->m_propertyToY[property], val.y()); Q_EMIT propertyChanged(property); Q_EMIT valueChanged(property, val); } /*! \reimp */ void QtPointPropertyManager::initializeProperty(QtProperty *property) { d_ptr->m_values[property] = QPoint(0, 0); QtProperty *xProp = d_ptr->m_intPropertyManager->addProperty(); xProp->setPropertyName(tr("X")); d_ptr->m_intPropertyManager->setValue(xProp, 0); d_ptr->m_propertyToX[property] = xProp; d_ptr->m_xToProperty[xProp] = property; property->addSubProperty(xProp); QtProperty *yProp = d_ptr->m_intPropertyManager->addProperty(); yProp->setPropertyName(tr("Y")); d_ptr->m_intPropertyManager->setValue(yProp, 0); d_ptr->m_propertyToY[property] = yProp; d_ptr->m_yToProperty[yProp] = property; property->addSubProperty(yProp); } /*! \reimp */ void QtPointPropertyManager::uninitializeProperty(QtProperty *property) { QtProperty *xProp = d_ptr->m_propertyToX[property]; if (xProp) { d_ptr->m_xToProperty.remove(xProp); delete xProp; } d_ptr->m_propertyToX.remove(property); QtProperty *yProp = d_ptr->m_propertyToY[property]; if (yProp) { d_ptr->m_yToProperty.remove(yProp); delete yProp; } d_ptr->m_propertyToY.remove(property); d_ptr->m_values.remove(property); } // QtPointFPropertyManager class QtPointFPropertyManagerPrivate { QtPointFPropertyManager *q_ptr; Q_DECLARE_PUBLIC(QtPointFPropertyManager) public: struct Data { Data() : decimals(2) {} QPointF val; int decimals; }; void slotDoubleChanged(QtProperty *property, double value); void slotPropertyDestroyed(QtProperty *property); typedef QMap<const QtProperty *, Data> PropertyValueMap; PropertyValueMap m_values; QtDoublePropertyManager *m_doublePropertyManager; QMap<const QtProperty *, QtProperty *> m_propertyToX; QMap<const QtProperty *, QtProperty *> m_propertyToY; QMap<const QtProperty *, QtProperty *> m_xToProperty; QMap<const QtProperty *, QtProperty *> m_yToProperty; }; void QtPointFPropertyManagerPrivate::slotDoubleChanged(QtProperty *property, double value) { if (QtProperty *prop = m_xToProperty.value(property, 0)) { QPointF p = m_values[prop].val; p.setX(value); q_ptr->setValue(prop, p); } else if (QtProperty *prop = m_yToProperty.value(property, 0)) { QPointF p = m_values[prop].val; p.setY(value); q_ptr->setValue(prop, p); } } void QtPointFPropertyManagerPrivate::slotPropertyDestroyed(QtProperty *property) { if (QtProperty *pointProp = m_xToProperty.value(property, 0)) { m_propertyToX[pointProp] = 0; m_xToProperty.remove(property); } else if (QtProperty *pointProp = m_yToProperty.value(property, 0)) { m_propertyToY[pointProp] = 0; m_yToProperty.remove(property); } } /*! \class QtPointFPropertyManager \brief The QtPointFPropertyManager provides and manages QPointF properties. A point property has nested \e x and \e y subproperties. The top-level property's value can be retrieved using the value() function, and set using the setValue() slot. The subproperties are created by a QtDoublePropertyManager object. This manager can be retrieved using the subDoublePropertyManager() function. In order to provide editing widgets for the subproperties in a property browser widget, this manager must be associated with an editor factory. In addition, QtPointFPropertyManager provides the valueChanged() signal which is Q_EMITted whenever a property created by this manager changes. \sa QtAbstractPropertyManager, QtDoublePropertyManager, QtPointPropertyManager */ /*! \fn void QtPointFPropertyManager::valueChanged(QtProperty *property, const QPointF &value) This signal is Q_EMITted whenever a property created by this manager changes its value, passing a pointer to the \a property and the new \a value as parameters. \sa setValue() */ /*! \fn void QtPointFPropertyManager::decimalsChanged(QtProperty *property, int prec) This signal is Q_EMITted whenever a property created by this manager changes its precision of value, passing a pointer to the \a property and the new \a prec value \sa setDecimals() */ /*! Creates a manager with the given \a parent. */ QtPointFPropertyManager::QtPointFPropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { d_ptr = new QtPointFPropertyManagerPrivate; d_ptr->q_ptr = this; d_ptr->m_doublePropertyManager = new QtDoublePropertyManager(this); connect(d_ptr->m_doublePropertyManager, SIGNAL(valueChanged(QtProperty *, double)), this, SLOT(slotDoubleChanged(QtProperty *, double))); connect(d_ptr->m_doublePropertyManager, SIGNAL(propertyDestroyed(QtProperty *)), this, SLOT(slotPropertyDestroyed(QtProperty *))); } /*! Destroys this manager, and all the properties it has created. */ QtPointFPropertyManager::~QtPointFPropertyManager() { clear(); delete d_ptr; } /*! Returns the manager that creates the nested \e x and \e y subproperties. In order to provide editing widgets for the subproperties in a property browser widget, this manager must be associated with an editor factory. \sa QtAbstractPropertyBrowser::setFactoryForManager() */ QtDoublePropertyManager *QtPointFPropertyManager::subDoublePropertyManager() const { return d_ptr->m_doublePropertyManager; } /*! Returns the given \a property's value. If the given \a property is not managed by this manager, this function returns a point with coordinates (0, 0). \sa setValue() */ QPointF QtPointFPropertyManager::value(const QtProperty *property) const { return getValue<QPointF>(d_ptr->m_values, property); } /*! Returns the given \a property's precision, in decimals. \sa setDecimals() */ int QtPointFPropertyManager::decimals(const QtProperty *property) const { return getData<int>(d_ptr->m_values, &QtPointFPropertyManagerPrivate::Data::decimals, property, 0); } /*! \reimp */ QString QtPointFPropertyManager::valueText(const QtProperty *property) const { const QtPointFPropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); const QPointF v = it.value().val; const int dec = it.value().decimals; return QString(tr("(%1, %2)").arg(QString::number(v.x(), 'f', dec)) .arg(QString::number(v.y(), 'f', dec))); } /*! \fn void QtPointFPropertyManager::setValue(QtProperty *property, const QPointF &value) Sets the value of the given \a property to \a value. Nested properties are updated automatically. \sa value(), valueChanged() */ void QtPointFPropertyManager::setValue(QtProperty *property, const QPointF &val) { const QtPointFPropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; if (it.value().val == val) return; it.value().val = val; d_ptr->m_doublePropertyManager->setValue(d_ptr->m_propertyToX[property], val.x()); d_ptr->m_doublePropertyManager->setValue(d_ptr->m_propertyToY[property], val.y()); Q_EMIT propertyChanged(property); Q_EMIT valueChanged(property, val); } /*! \fn void QtPointFPropertyManager::setDecimals(QtProperty *property, int prec) Sets the precision of the given \a property to \a prec. The valid decimal range is 0-13. The default is 2. \sa decimals() */ void QtPointFPropertyManager::setDecimals(QtProperty *property, int prec) { const QtPointFPropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; QtPointFPropertyManagerPrivate::Data data = it.value(); if (prec > 13) prec = 13; else if (prec < 0) prec = 0; if (data.decimals == prec) return; data.decimals = prec; d_ptr->m_doublePropertyManager->setDecimals(d_ptr->m_propertyToX[property], prec); d_ptr->m_doublePropertyManager->setDecimals(d_ptr->m_propertyToY[property], prec); it.value() = data; Q_EMIT decimalsChanged(property, data.decimals); } /*! \reimp */ void QtPointFPropertyManager::initializeProperty(QtProperty *property) { d_ptr->m_values[property] = QtPointFPropertyManagerPrivate::Data(); QtProperty *xProp = d_ptr->m_doublePropertyManager->addProperty(); xProp->setPropertyName(tr("X")); d_ptr->m_doublePropertyManager->setDecimals(xProp, decimals(property)); d_ptr->m_doublePropertyManager->setValue(xProp, 0); d_ptr->m_propertyToX[property] = xProp; d_ptr->m_xToProperty[xProp] = property; property->addSubProperty(xProp); QtProperty *yProp = d_ptr->m_doublePropertyManager->addProperty(); yProp->setPropertyName(tr("Y")); d_ptr->m_doublePropertyManager->setDecimals(yProp, decimals(property)); d_ptr->m_doublePropertyManager->setValue(yProp, 0); d_ptr->m_propertyToY[property] = yProp; d_ptr->m_yToProperty[yProp] = property; property->addSubProperty(yProp); } /*! \reimp */ void QtPointFPropertyManager::uninitializeProperty(QtProperty *property) { QtProperty *xProp = d_ptr->m_propertyToX[property]; if (xProp) { d_ptr->m_xToProperty.remove(xProp); delete xProp; } d_ptr->m_propertyToX.remove(property); QtProperty *yProp = d_ptr->m_propertyToY[property]; if (yProp) { d_ptr->m_yToProperty.remove(yProp); delete yProp; } d_ptr->m_propertyToY.remove(property); d_ptr->m_values.remove(property); } // QtSizePropertyManager class QtSizePropertyManagerPrivate { QtSizePropertyManager *q_ptr; Q_DECLARE_PUBLIC(QtSizePropertyManager) public: void slotIntChanged(QtProperty *property, int value); void slotPropertyDestroyed(QtProperty *property); void setValue(QtProperty *property, const QSize &val); void setRange(QtProperty *property, const QSize &minVal, const QSize &maxVal, const QSize &val); struct Data { Data() : val(QSize(0, 0)), minVal(QSize(0, 0)), maxVal(QSize(INT_MAX, INT_MAX)) {} QSize val; QSize minVal; QSize maxVal; QSize minimumValue() const { return minVal; } QSize maximumValue() const { return maxVal; } void setMinimumValue(const QSize &newMinVal) { setSizeMinimumData(this, newMinVal); } void setMaximumValue(const QSize &newMaxVal) { setSizeMaximumData(this, newMaxVal); } }; typedef QMap<const QtProperty *, Data> PropertyValueMap; PropertyValueMap m_values; QtIntPropertyManager *m_intPropertyManager; QMap<const QtProperty *, QtProperty *> m_propertyToW; QMap<const QtProperty *, QtProperty *> m_propertyToH; QMap<const QtProperty *, QtProperty *> m_wToProperty; QMap<const QtProperty *, QtProperty *> m_hToProperty; }; void QtSizePropertyManagerPrivate::slotIntChanged(QtProperty *property, int value) { if (QtProperty *prop = m_wToProperty.value(property, 0)) { QSize s = m_values[prop].val; s.setWidth(value); q_ptr->setValue(prop, s); } else if (QtProperty *prop = m_hToProperty.value(property, 0)) { QSize s = m_values[prop].val; s.setHeight(value); q_ptr->setValue(prop, s); } } void QtSizePropertyManagerPrivate::slotPropertyDestroyed(QtProperty *property) { if (QtProperty *pointProp = m_wToProperty.value(property, 0)) { m_propertyToW[pointProp] = 0; m_wToProperty.remove(property); } else if (QtProperty *pointProp = m_hToProperty.value(property, 0)) { m_propertyToH[pointProp] = 0; m_hToProperty.remove(property); } } void QtSizePropertyManagerPrivate::setValue(QtProperty *property, const QSize &val) { m_intPropertyManager->setValue(m_propertyToW.value(property), val.width()); m_intPropertyManager->setValue(m_propertyToH.value(property), val.height()); } void QtSizePropertyManagerPrivate::setRange(QtProperty *property, const QSize &minVal, const QSize &maxVal, const QSize &val) { QtProperty *wProperty = m_propertyToW.value(property); QtProperty *hProperty = m_propertyToH.value(property); m_intPropertyManager->setRange(wProperty, minVal.width(), maxVal.width()); m_intPropertyManager->setValue(wProperty, val.width()); m_intPropertyManager->setRange(hProperty, minVal.height(), maxVal.height()); m_intPropertyManager->setValue(hProperty, val.height()); } /*! \class QtSizePropertyManager \brief The QtSizePropertyManager provides and manages QSize properties. A size property has nested \e width and \e height subproperties. The top-level property's value can be retrieved using the value() function, and set using the setValue() slot. The subproperties are created by a QtIntPropertyManager object. This manager can be retrieved using the subIntPropertyManager() function. In order to provide editing widgets for the subproperties in a property browser widget, this manager must be associated with an editor factory. A size property also has a range of valid values defined by a minimum size and a maximum size. These sizes can be retrieved using the minimum() and the maximum() functions, and set using the setMinimum() and setMaximum() slots. Alternatively, the range can be defined in one go using the setRange() slot. In addition, QtSizePropertyManager provides the valueChanged() signal which is Q_EMITted whenever a property created by this manager changes, and the rangeChanged() signal which is Q_EMITted whenever such a property changes its range of valid sizes. \sa QtAbstractPropertyManager, QtIntPropertyManager, QtSizeFPropertyManager */ /*! \fn void QtSizePropertyManager::valueChanged(QtProperty *property, const QSize &value) This signal is Q_EMITted whenever a property created by this manager changes its value, passing a pointer to the \a property and the new \a value as parameters. \sa setValue() */ /*! \fn void QtSizePropertyManager::rangeChanged(QtProperty *property, const QSize &minimum, const QSize &maximum) This signal is Q_EMITted whenever a property created by this manager changes its range of valid sizes, passing a pointer to the \a property and the new \a minimum and \a maximum sizes. \sa setRange() */ /*! Creates a manager with the given \a parent. */ QtSizePropertyManager::QtSizePropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { d_ptr = new QtSizePropertyManagerPrivate; d_ptr->q_ptr = this; d_ptr->m_intPropertyManager = new QtIntPropertyManager(this); connect(d_ptr->m_intPropertyManager, SIGNAL(valueChanged(QtProperty *, int)), this, SLOT(slotIntChanged(QtProperty *, int))); connect(d_ptr->m_intPropertyManager, SIGNAL(propertyDestroyed(QtProperty *)), this, SLOT(slotPropertyDestroyed(QtProperty *))); } /*! Destroys this manager, and all the properties it has created. */ QtSizePropertyManager::~QtSizePropertyManager() { clear(); delete d_ptr; } /*! Returns the manager that creates the nested \e width and \e height subproperties. In order to provide editing widgets for the \e width and \e height properties in a property browser widget, this manager must be associated with an editor factory. \sa QtAbstractPropertyBrowser::setFactoryForManager() */ QtIntPropertyManager *QtSizePropertyManager::subIntPropertyManager() const { return d_ptr->m_intPropertyManager; } /*! Returns the given \a property's value. If the given \a property is not managed by this manager, this function returns an invalid size \sa setValue() */ QSize QtSizePropertyManager::value(const QtProperty *property) const { return getValue<QSize>(d_ptr->m_values, property); } /*! Returns the given \a property's minimum size value. \sa setMinimum(), maximum(), setRange() */ QSize QtSizePropertyManager::minimum(const QtProperty *property) const { return getMinimum<QSize>(d_ptr->m_values, property); } /*! Returns the given \a property's maximum size value. \sa setMaximum(), minimum(), setRange() */ QSize QtSizePropertyManager::maximum(const QtProperty *property) const { return getMaximum<QSize>(d_ptr->m_values, property); } /*! \reimp */ QString QtSizePropertyManager::valueText(const QtProperty *property) const { const QtSizePropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); const QSize v = it.value().val; return QString(tr("%1 x %2").arg(QString::number(v.width())) .arg(QString::number(v.height()))); } /*! \fn void QtSizePropertyManager::setValue(QtProperty *property, const QSize &value) Sets the value of the given \a property to \a value. If the specified \a value is not valid according to the given \a property's size range, the \a value is adjusted to the nearest valid value within the size range. \sa value(), setRange(), valueChanged() */ void QtSizePropertyManager::setValue(QtProperty *property, const QSize &val) { setValueInRange<const QSize &, QtSizePropertyManagerPrivate, QtSizePropertyManager, const QSize>(this, d_ptr, &QtSizePropertyManager::propertyChanged, &QtSizePropertyManager::valueChanged, property, val, &QtSizePropertyManagerPrivate::setValue); } /*! Sets the minimum size value for the given \a property to \a minVal. When setting the minimum size value, the maximum and current values are adjusted if necessary (ensuring that the size range remains valid and that the current value is within the range). \sa minimum(), setRange(), rangeChanged() */ void QtSizePropertyManager::setMinimum(QtProperty *property, const QSize &minVal) { setBorderValue<const QSize &, QtSizePropertyManagerPrivate, QtSizePropertyManager, QSize, QtSizePropertyManagerPrivate::Data>(this, d_ptr, &QtSizePropertyManager::propertyChanged, &QtSizePropertyManager::valueChanged, &QtSizePropertyManager::rangeChanged, property, &QtSizePropertyManagerPrivate::Data::minimumValue, &QtSizePropertyManagerPrivate::Data::setMinimumValue, minVal, &QtSizePropertyManagerPrivate::setRange); } /*! Sets the maximum size value for the given \a property to \a maxVal. When setting the maximum size value, the minimum and current values are adjusted if necessary (ensuring that the size range remains valid and that the current value is within the range). \sa maximum(), setRange(), rangeChanged() */ void QtSizePropertyManager::setMaximum(QtProperty *property, const QSize &maxVal) { setBorderValue<const QSize &, QtSizePropertyManagerPrivate, QtSizePropertyManager, QSize, QtSizePropertyManagerPrivate::Data>(this, d_ptr, &QtSizePropertyManager::propertyChanged, &QtSizePropertyManager::valueChanged, &QtSizePropertyManager::rangeChanged, property, &QtSizePropertyManagerPrivate::Data::maximumValue, &QtSizePropertyManagerPrivate::Data::setMaximumValue, maxVal, &QtSizePropertyManagerPrivate::setRange); } /*! \fn void QtSizePropertyManager::setRange(QtProperty *property, const QSize &minimum, const QSize &maximum) Sets the range of valid values. This is a convenience function defining the range of valid values in one go; setting the \a minimum and \a maximum values for the given \a property with a single function call. When setting a new range, the current value is adjusted if necessary (ensuring that the value remains within the range). \sa setMinimum(), setMaximum(), rangeChanged() */ void QtSizePropertyManager::setRange(QtProperty *property, const QSize &minVal, const QSize &maxVal) { setBorderValues<const QSize &, QtSizePropertyManagerPrivate, QtSizePropertyManager, QSize>(this, d_ptr, &QtSizePropertyManager::propertyChanged, &QtSizePropertyManager::valueChanged, &QtSizePropertyManager::rangeChanged, property, minVal, maxVal, &QtSizePropertyManagerPrivate::setRange); } /*! \reimp */ void QtSizePropertyManager::initializeProperty(QtProperty *property) { d_ptr->m_values[property] = QtSizePropertyManagerPrivate::Data(); QtProperty *wProp = d_ptr->m_intPropertyManager->addProperty(); wProp->setPropertyName(tr("Width")); d_ptr->m_intPropertyManager->setValue(wProp, 0); d_ptr->m_intPropertyManager->setMinimum(wProp, 0); d_ptr->m_propertyToW[property] = wProp; d_ptr->m_wToProperty[wProp] = property; property->addSubProperty(wProp); QtProperty *hProp = d_ptr->m_intPropertyManager->addProperty(); hProp->setPropertyName(tr("Height")); d_ptr->m_intPropertyManager->setValue(hProp, 0); d_ptr->m_intPropertyManager->setMinimum(hProp, 0); d_ptr->m_propertyToH[property] = hProp; d_ptr->m_hToProperty[hProp] = property; property->addSubProperty(hProp); } /*! \reimp */ void QtSizePropertyManager::uninitializeProperty(QtProperty *property) { QtProperty *wProp = d_ptr->m_propertyToW[property]; if (wProp) { d_ptr->m_wToProperty.remove(wProp); delete wProp; } d_ptr->m_propertyToW.remove(property); QtProperty *hProp = d_ptr->m_propertyToH[property]; if (hProp) { d_ptr->m_hToProperty.remove(hProp); delete hProp; } d_ptr->m_propertyToH.remove(property); d_ptr->m_values.remove(property); } // QtSizeFPropertyManager class QtSizeFPropertyManagerPrivate { QtSizeFPropertyManager *q_ptr; Q_DECLARE_PUBLIC(QtSizeFPropertyManager) public: void slotDoubleChanged(QtProperty *property, double value); void slotPropertyDestroyed(QtProperty *property); void setValue(QtProperty *property, const QSizeF &val); void setRange(QtProperty *property, const QSizeF &minVal, const QSizeF &maxVal, const QSizeF &val); struct Data { Data() : val(QSizeF(0, 0)), minVal(QSizeF(0, 0)), maxVal(QSizeF(INT_MAX, INT_MAX)), decimals(2) {} QSizeF val; QSizeF minVal; QSizeF maxVal; int decimals; QSizeF minimumValue() const { return minVal; } QSizeF maximumValue() const { return maxVal; } void setMinimumValue(const QSizeF &newMinVal) { setSizeMinimumData(this, newMinVal); } void setMaximumValue(const QSizeF &newMaxVal) { setSizeMaximumData(this, newMaxVal); } }; typedef QMap<const QtProperty *, Data> PropertyValueMap; PropertyValueMap m_values; QtDoublePropertyManager *m_doublePropertyManager; QMap<const QtProperty *, QtProperty *> m_propertyToW; QMap<const QtProperty *, QtProperty *> m_propertyToH; QMap<const QtProperty *, QtProperty *> m_wToProperty; QMap<const QtProperty *, QtProperty *> m_hToProperty; }; void QtSizeFPropertyManagerPrivate::slotDoubleChanged(QtProperty *property, double value) { if (QtProperty *prop = m_wToProperty.value(property, 0)) { QSizeF s = m_values[prop].val; s.setWidth(value); q_ptr->setValue(prop, s); } else if (QtProperty *prop = m_hToProperty.value(property, 0)) { QSizeF s = m_values[prop].val; s.setHeight(value); q_ptr->setValue(prop, s); } } void QtSizeFPropertyManagerPrivate::slotPropertyDestroyed(QtProperty *property) { if (QtProperty *pointProp = m_wToProperty.value(property, 0)) { m_propertyToW[pointProp] = 0; m_wToProperty.remove(property); } else if (QtProperty *pointProp = m_hToProperty.value(property, 0)) { m_propertyToH[pointProp] = 0; m_hToProperty.remove(property); } } void QtSizeFPropertyManagerPrivate::setValue(QtProperty *property, const QSizeF &val) { m_doublePropertyManager->setValue(m_propertyToW.value(property), val.width()); m_doublePropertyManager->setValue(m_propertyToH.value(property), val.height()); } void QtSizeFPropertyManagerPrivate::setRange(QtProperty *property, const QSizeF &minVal, const QSizeF &maxVal, const QSizeF &val) { m_doublePropertyManager->setRange(m_propertyToW[property], minVal.width(), maxVal.width()); m_doublePropertyManager->setValue(m_propertyToW[property], val.width()); m_doublePropertyManager->setRange(m_propertyToH[property], minVal.height(), maxVal.height()); m_doublePropertyManager->setValue(m_propertyToH[property], val.height()); } /*! \class QtSizeFPropertyManager \brief The QtSizeFPropertyManager provides and manages QSizeF properties. A size property has nested \e width and \e height subproperties. The top-level property's value can be retrieved using the value() function, and set using the setValue() slot. The subproperties are created by a QtDoublePropertyManager object. This manager can be retrieved using the subDoublePropertyManager() function. In order to provide editing widgets for the subproperties in a property browser widget, this manager must be associated with an editor factory. A size property also has a range of valid values defined by a minimum size and a maximum size. These sizes can be retrieved using the minimum() and the maximum() functions, and set using the setMinimum() and setMaximum() slots. Alternatively, the range can be defined in one go using the setRange() slot. In addition, QtSizeFPropertyManager provides the valueChanged() signal which is Q_EMITted whenever a property created by this manager changes, and the rangeChanged() signal which is Q_EMITted whenever such a property changes its range of valid sizes. \sa QtAbstractPropertyManager, QtDoublePropertyManager, QtSizePropertyManager */ /*! \fn void QtSizeFPropertyManager::valueChanged(QtProperty *property, const QSizeF &value) This signal is Q_EMITted whenever a property created by this manager changes its value, passing a pointer to the \a property and the new \a value as parameters. \sa setValue() */ /*! \fn void QtSizeFPropertyManager::rangeChanged(QtProperty *property, const QSizeF &minimum, const QSizeF &maximum) This signal is Q_EMITted whenever a property created by this manager changes its range of valid sizes, passing a pointer to the \a property and the new \a minimum and \a maximum sizes. \sa setRange() */ /*! \fn void QtSizeFPropertyManager::decimalsChanged(QtProperty *property, int prec) This signal is Q_EMITted whenever a property created by this manager changes its precision of value, passing a pointer to the \a property and the new \a prec value \sa setDecimals() */ /*! Creates a manager with the given \a parent. */ QtSizeFPropertyManager::QtSizeFPropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { d_ptr = new QtSizeFPropertyManagerPrivate; d_ptr->q_ptr = this; d_ptr->m_doublePropertyManager = new QtDoublePropertyManager(this); connect(d_ptr->m_doublePropertyManager, SIGNAL(valueChanged(QtProperty *, double)), this, SLOT(slotDoubleChanged(QtProperty *, double))); connect(d_ptr->m_doublePropertyManager, SIGNAL(propertyDestroyed(QtProperty *)), this, SLOT(slotPropertyDestroyed(QtProperty *))); } /*! Destroys this manager, and all the properties it has created. */ QtSizeFPropertyManager::~QtSizeFPropertyManager() { clear(); delete d_ptr; } /*! Returns the manager that creates the nested \e width and \e height subproperties. In order to provide editing widgets for the \e width and \e height properties in a property browser widget, this manager must be associated with an editor factory. \sa QtAbstractPropertyBrowser::setFactoryForManager() */ QtDoublePropertyManager *QtSizeFPropertyManager::subDoublePropertyManager() const { return d_ptr->m_doublePropertyManager; } /*! Returns the given \a property's value. If the given \a property is not managed by this manager, this function returns an invalid size \sa setValue() */ QSizeF QtSizeFPropertyManager::value(const QtProperty *property) const { return getValue<QSizeF>(d_ptr->m_values, property); } /*! Returns the given \a property's precision, in decimals. \sa setDecimals() */ int QtSizeFPropertyManager::decimals(const QtProperty *property) const { return getData<int>(d_ptr->m_values, &QtSizeFPropertyManagerPrivate::Data::decimals, property, 0); } /*! Returns the given \a property's minimum size value. \sa setMinimum(), maximum(), setRange() */ QSizeF QtSizeFPropertyManager::minimum(const QtProperty *property) const { return getMinimum<QSizeF>(d_ptr->m_values, property); } /*! Returns the given \a property's maximum size value. \sa setMaximum(), minimum(), setRange() */ QSizeF QtSizeFPropertyManager::maximum(const QtProperty *property) const { return getMaximum<QSizeF>(d_ptr->m_values, property); } /*! \reimp */ QString QtSizeFPropertyManager::valueText(const QtProperty *property) const { const QtSizeFPropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); const QSizeF v = it.value().val; const int dec = it.value().decimals; return QString(tr("%1 x %2").arg(QString::number(v.width(), 'f', dec)) .arg(QString::number(v.height(), 'f', dec))); } /*! \fn void QtSizeFPropertyManager::setValue(QtProperty *property, const QSizeF &value) Sets the value of the given \a property to \a value. If the specified \a value is not valid according to the given \a property's size range, the \a value is adjusted to the nearest valid value within the size range. \sa value(), setRange(), valueChanged() */ void QtSizeFPropertyManager::setValue(QtProperty *property, const QSizeF &val) { setValueInRange<const QSizeF &, QtSizeFPropertyManagerPrivate, QtSizeFPropertyManager, QSizeF>(this, d_ptr, &QtSizeFPropertyManager::propertyChanged, &QtSizeFPropertyManager::valueChanged, property, val, &QtSizeFPropertyManagerPrivate::setValue); } /*! \fn void QtSizeFPropertyManager::setDecimals(QtProperty *property, int prec) Sets the precision of the given \a property to \a prec. The valid decimal range is 0-13. The default is 2. \sa decimals() */ void QtSizeFPropertyManager::setDecimals(QtProperty *property, int prec) { const QtSizeFPropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; QtSizeFPropertyManagerPrivate::Data data = it.value(); if (prec > 13) prec = 13; else if (prec < 0) prec = 0; if (data.decimals == prec) return; data.decimals = prec; d_ptr->m_doublePropertyManager->setDecimals(d_ptr->m_propertyToW[property], prec); d_ptr->m_doublePropertyManager->setDecimals(d_ptr->m_propertyToH[property], prec); it.value() = data; Q_EMIT decimalsChanged(property, data.decimals); } /*! Sets the minimum size value for the given \a property to \a minVal. When setting the minimum size value, the maximum and current values are adjusted if necessary (ensuring that the size range remains valid and that the current value is within the range). \sa minimum(), setRange(), rangeChanged() */ void QtSizeFPropertyManager::setMinimum(QtProperty *property, const QSizeF &minVal) { setBorderValue<const QSizeF &, QtSizeFPropertyManagerPrivate, QtSizeFPropertyManager, QSizeF, QtSizeFPropertyManagerPrivate::Data>(this, d_ptr, &QtSizeFPropertyManager::propertyChanged, &QtSizeFPropertyManager::valueChanged, &QtSizeFPropertyManager::rangeChanged, property, &QtSizeFPropertyManagerPrivate::Data::minimumValue, &QtSizeFPropertyManagerPrivate::Data::setMinimumValue, minVal, &QtSizeFPropertyManagerPrivate::setRange); } /*! Sets the maximum size value for the given \a property to \a maxVal. When setting the maximum size value, the minimum and current values are adjusted if necessary (ensuring that the size range remains valid and that the current value is within the range). \sa maximum(), setRange(), rangeChanged() */ void QtSizeFPropertyManager::setMaximum(QtProperty *property, const QSizeF &maxVal) { setBorderValue<const QSizeF &, QtSizeFPropertyManagerPrivate, QtSizeFPropertyManager, QSizeF, QtSizeFPropertyManagerPrivate::Data>(this, d_ptr, &QtSizeFPropertyManager::propertyChanged, &QtSizeFPropertyManager::valueChanged, &QtSizeFPropertyManager::rangeChanged, property, &QtSizeFPropertyManagerPrivate::Data::maximumValue, &QtSizeFPropertyManagerPrivate::Data::setMaximumValue, maxVal, &QtSizeFPropertyManagerPrivate::setRange); } /*! \fn void QtSizeFPropertyManager::setRange(QtProperty *property, const QSizeF &minimum, const QSizeF &maximum) Sets the range of valid values. This is a convenience function defining the range of valid values in one go; setting the \a minimum and \a maximum values for the given \a property with a single function call. When setting a new range, the current value is adjusted if necessary (ensuring that the value remains within the range). \sa setMinimum(), setMaximum(), rangeChanged() */ void QtSizeFPropertyManager::setRange(QtProperty *property, const QSizeF &minVal, const QSizeF &maxVal) { setBorderValues<const QSizeF &, QtSizeFPropertyManagerPrivate, QtSizeFPropertyManager, QSizeF>(this, d_ptr, &QtSizeFPropertyManager::propertyChanged, &QtSizeFPropertyManager::valueChanged, &QtSizeFPropertyManager::rangeChanged, property, minVal, maxVal, &QtSizeFPropertyManagerPrivate::setRange); } /*! \reimp */ void QtSizeFPropertyManager::initializeProperty(QtProperty *property) { d_ptr->m_values[property] = QtSizeFPropertyManagerPrivate::Data(); QtProperty *wProp = d_ptr->m_doublePropertyManager->addProperty(); wProp->setPropertyName(tr("Width")); d_ptr->m_doublePropertyManager->setDecimals(wProp, decimals(property)); d_ptr->m_doublePropertyManager->setValue(wProp, 0); d_ptr->m_doublePropertyManager->setMinimum(wProp, 0); d_ptr->m_propertyToW[property] = wProp; d_ptr->m_wToProperty[wProp] = property; property->addSubProperty(wProp); QtProperty *hProp = d_ptr->m_doublePropertyManager->addProperty(); hProp->setPropertyName(tr("Height")); d_ptr->m_doublePropertyManager->setDecimals(hProp, decimals(property)); d_ptr->m_doublePropertyManager->setValue(hProp, 0); d_ptr->m_doublePropertyManager->setMinimum(hProp, 0); d_ptr->m_propertyToH[property] = hProp; d_ptr->m_hToProperty[hProp] = property; property->addSubProperty(hProp); } /*! \reimp */ void QtSizeFPropertyManager::uninitializeProperty(QtProperty *property) { QtProperty *wProp = d_ptr->m_propertyToW[property]; if (wProp) { d_ptr->m_wToProperty.remove(wProp); delete wProp; } d_ptr->m_propertyToW.remove(property); QtProperty *hProp = d_ptr->m_propertyToH[property]; if (hProp) { d_ptr->m_hToProperty.remove(hProp); delete hProp; } d_ptr->m_propertyToH.remove(property); d_ptr->m_values.remove(property); } // QtRectPropertyManager class QtRectPropertyManagerPrivate { QtRectPropertyManager *q_ptr; Q_DECLARE_PUBLIC(QtRectPropertyManager) public: void slotIntChanged(QtProperty *property, int value); void slotPropertyDestroyed(QtProperty *property); void setConstraint(QtProperty *property, const QRect &constraint, const QRect &val); struct Data { Data() : val(0, 0, 0, 0) {} QRect val; QRect constraint; }; typedef QMap<const QtProperty *, Data> PropertyValueMap; PropertyValueMap m_values; QtIntPropertyManager *m_intPropertyManager; QMap<const QtProperty *, QtProperty *> m_propertyToX; QMap<const QtProperty *, QtProperty *> m_propertyToY; QMap<const QtProperty *, QtProperty *> m_propertyToW; QMap<const QtProperty *, QtProperty *> m_propertyToH; QMap<const QtProperty *, QtProperty *> m_xToProperty; QMap<const QtProperty *, QtProperty *> m_yToProperty; QMap<const QtProperty *, QtProperty *> m_wToProperty; QMap<const QtProperty *, QtProperty *> m_hToProperty; }; void QtRectPropertyManagerPrivate::slotIntChanged(QtProperty *property, int value) { if (QtProperty *prop = m_xToProperty.value(property, 0)) { QRect r = m_values[prop].val; r.moveLeft(value); q_ptr->setValue(prop, r); } else if (QtProperty *prop = m_yToProperty.value(property)) { QRect r = m_values[prop].val; r.moveTop(value); q_ptr->setValue(prop, r); } else if (QtProperty *prop = m_wToProperty.value(property, 0)) { Data data = m_values[prop]; QRect r = data.val; r.setWidth(value); if (!data.constraint.isNull() && data.constraint.x() + data.constraint.width() < r.x() + r.width()) { r.moveLeft(data.constraint.left() + data.constraint.width() - r.width()); } q_ptr->setValue(prop, r); } else if (QtProperty *prop = m_hToProperty.value(property, 0)) { Data data = m_values[prop]; QRect r = data.val; r.setHeight(value); if (!data.constraint.isNull() && data.constraint.y() + data.constraint.height() < r.y() + r.height()) { r.moveTop(data.constraint.top() + data.constraint.height() - r.height()); } q_ptr->setValue(prop, r); } } void QtRectPropertyManagerPrivate::slotPropertyDestroyed(QtProperty *property) { if (QtProperty *pointProp = m_xToProperty.value(property, 0)) { m_propertyToX[pointProp] = 0; m_xToProperty.remove(property); } else if (QtProperty *pointProp = m_yToProperty.value(property, 0)) { m_propertyToY[pointProp] = 0; m_yToProperty.remove(property); } else if (QtProperty *pointProp = m_wToProperty.value(property, 0)) { m_propertyToW[pointProp] = 0; m_wToProperty.remove(property); } else if (QtProperty *pointProp = m_hToProperty.value(property, 0)) { m_propertyToH[pointProp] = 0; m_hToProperty.remove(property); } } void QtRectPropertyManagerPrivate::setConstraint(QtProperty *property, const QRect &constraint, const QRect &val) { const bool isNull = constraint.isNull(); const int left = isNull ? INT_MIN : constraint.left(); const int right = isNull ? INT_MAX : constraint.left() + constraint.width(); const int top = isNull ? INT_MIN : constraint.top(); const int bottom = isNull ? INT_MAX : constraint.top() + constraint.height(); const int width = isNull ? INT_MAX : constraint.width(); const int height = isNull ? INT_MAX : constraint.height(); m_intPropertyManager->setRange(m_propertyToX[property], left, right); m_intPropertyManager->setRange(m_propertyToY[property], top, bottom); m_intPropertyManager->setRange(m_propertyToW[property], 0, width); m_intPropertyManager->setRange(m_propertyToH[property], 0, height); m_intPropertyManager->setValue(m_propertyToX[property], val.x()); m_intPropertyManager->setValue(m_propertyToY[property], val.y()); m_intPropertyManager->setValue(m_propertyToW[property], val.width()); m_intPropertyManager->setValue(m_propertyToH[property], val.height()); } /*! \class QtRectPropertyManager \brief The QtRectPropertyManager provides and manages QRect properties. A rectangle property has nested \e x, \e y, \e width and \e height subproperties. The top-level property's value can be retrieved using the value() function, and set using the setValue() slot. The subproperties are created by a QtIntPropertyManager object. This manager can be retrieved using the subIntPropertyManager() function. In order to provide editing widgets for the subproperties in a property browser widget, this manager must be associated with an editor factory. A rectangle property also has a constraint rectangle which can be retrieved using the constraint() function, and set using the setConstraint() slot. In addition, QtRectPropertyManager provides the valueChanged() signal which is Q_EMITted whenever a property created by this manager changes, and the constraintChanged() signal which is Q_EMITted whenever such a property changes its constraint rectangle. \sa QtAbstractPropertyManager, QtIntPropertyManager, QtRectFPropertyManager */ /*! \fn void QtRectPropertyManager::valueChanged(QtProperty *property, const QRect &value) This signal is Q_EMITted whenever a property created by this manager changes its value, passing a pointer to the \a property and the new \a value as parameters. \sa setValue() */ /*! \fn void QtRectPropertyManager::constraintChanged(QtProperty *property, const QRect &constraint) This signal is Q_EMITted whenever property changes its constraint rectangle, passing a pointer to the \a property and the new \a constraint rectangle as parameters. \sa setConstraint() */ /*! Creates a manager with the given \a parent. */ QtRectPropertyManager::QtRectPropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { d_ptr = new QtRectPropertyManagerPrivate; d_ptr->q_ptr = this; d_ptr->m_intPropertyManager = new QtIntPropertyManager(this); connect(d_ptr->m_intPropertyManager, SIGNAL(valueChanged(QtProperty *, int)), this, SLOT(slotIntChanged(QtProperty *, int))); connect(d_ptr->m_intPropertyManager, SIGNAL(propertyDestroyed(QtProperty *)), this, SLOT(slotPropertyDestroyed(QtProperty *))); } /*! Destroys this manager, and all the properties it has created. */ QtRectPropertyManager::~QtRectPropertyManager() { clear(); delete d_ptr; } /*! Returns the manager that creates the nested \e x, \e y, \e width and \e height subproperties. In order to provide editing widgets for the mentioned subproperties in a property browser widget, this manager must be associated with an editor factory. \sa QtAbstractPropertyBrowser::setFactoryForManager() */ QtIntPropertyManager *QtRectPropertyManager::subIntPropertyManager() const { return d_ptr->m_intPropertyManager; } /*! Returns the given \a property's value. If the given \a property is not managed by this manager, this function returns an invalid rectangle. \sa setValue(), constraint() */ QRect QtRectPropertyManager::value(const QtProperty *property) const { return getValue<QRect>(d_ptr->m_values, property); } /*! Returns the given \a property's constraining rectangle. If returned value is null QRect it means there is no constraint applied. \sa value(), setConstraint() */ QRect QtRectPropertyManager::constraint(const QtProperty *property) const { return getData<QRect>(d_ptr->m_values, &QtRectPropertyManagerPrivate::Data::constraint, property, QRect()); } /*! \reimp */ QString QtRectPropertyManager::valueText(const QtProperty *property) const { const QtRectPropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); const QRect v = it.value().val; return QString(tr("[(%1, %2), %3 x %4]").arg(QString::number(v.x())) .arg(QString::number(v.y())) .arg(QString::number(v.width())) .arg(QString::number(v.height()))); } /*! \fn void QtRectPropertyManager::setValue(QtProperty *property, const QRect &value) Sets the value of the given \a property to \a value. Nested properties are updated automatically. If the specified \a value is not inside the given \a property's constraining rectangle, the value is adjusted accordingly to fit within the constraint. \sa value(), setConstraint(), valueChanged() */ void QtRectPropertyManager::setValue(QtProperty *property, const QRect &val) { const QtRectPropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; QtRectPropertyManagerPrivate::Data data = it.value(); QRect newRect = val.normalized(); if (!data.constraint.isNull() && !data.constraint.contains(newRect)) { const QRect r1 = data.constraint; const QRect r2 = newRect; newRect.setLeft(qMax(r1.left(), r2.left())); newRect.setRight(qMin(r1.right(), r2.right())); newRect.setTop(qMax(r1.top(), r2.top())); newRect.setBottom(qMin(r1.bottom(), r2.bottom())); if (newRect.width() < 0 || newRect.height() < 0) return; } if (data.val == newRect) return; data.val = newRect; it.value() = data; d_ptr->m_intPropertyManager->setValue(d_ptr->m_propertyToX[property], newRect.x()); d_ptr->m_intPropertyManager->setValue(d_ptr->m_propertyToY[property], newRect.y()); d_ptr->m_intPropertyManager->setValue(d_ptr->m_propertyToW[property], newRect.width()); d_ptr->m_intPropertyManager->setValue(d_ptr->m_propertyToH[property], newRect.height()); Q_EMIT propertyChanged(property); Q_EMIT valueChanged(property, data.val); } /*! Sets the given \a property's constraining rectangle to \a constraint. When setting the constraint, the current value is adjusted if necessary (ensuring that the current rectangle value is inside the constraint). In order to reset the constraint pass a null QRect value. \sa setValue(), constraint(), constraintChanged() */ void QtRectPropertyManager::setConstraint(QtProperty *property, const QRect &constraint) { const QtRectPropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; QtRectPropertyManagerPrivate::Data data = it.value(); QRect newConstraint = constraint.normalized(); if (data.constraint == newConstraint) return; const QRect oldVal = data.val; data.constraint = newConstraint; if (!data.constraint.isNull() && !data.constraint.contains(oldVal)) { QRect r1 = data.constraint; QRect r2 = data.val; if (r2.width() > r1.width()) r2.setWidth(r1.width()); if (r2.height() > r1.height()) r2.setHeight(r1.height()); if (r2.left() < r1.left()) r2.moveLeft(r1.left()); else if (r2.right() > r1.right()) r2.moveRight(r1.right()); if (r2.top() < r1.top()) r2.moveTop(r1.top()); else if (r2.bottom() > r1.bottom()) r2.moveBottom(r1.bottom()); data.val = r2; } it.value() = data; Q_EMIT constraintChanged(property, data.constraint); d_ptr->setConstraint(property, data.constraint, data.val); if (data.val == oldVal) return; Q_EMIT propertyChanged(property); Q_EMIT valueChanged(property, data.val); } /*! \reimp */ void QtRectPropertyManager::initializeProperty(QtProperty *property) { d_ptr->m_values[property] = QtRectPropertyManagerPrivate::Data(); QtProperty *xProp = d_ptr->m_intPropertyManager->addProperty(); xProp->setPropertyName(tr("X")); d_ptr->m_intPropertyManager->setValue(xProp, 0); d_ptr->m_propertyToX[property] = xProp; d_ptr->m_xToProperty[xProp] = property; property->addSubProperty(xProp); QtProperty *yProp = d_ptr->m_intPropertyManager->addProperty(); yProp->setPropertyName(tr("Y")); d_ptr->m_intPropertyManager->setValue(yProp, 0); d_ptr->m_propertyToY[property] = yProp; d_ptr->m_yToProperty[yProp] = property; property->addSubProperty(yProp); QtProperty *wProp = d_ptr->m_intPropertyManager->addProperty(); wProp->setPropertyName(tr("Width")); d_ptr->m_intPropertyManager->setValue(wProp, 0); d_ptr->m_intPropertyManager->setMinimum(wProp, 0); d_ptr->m_propertyToW[property] = wProp; d_ptr->m_wToProperty[wProp] = property; property->addSubProperty(wProp); QtProperty *hProp = d_ptr->m_intPropertyManager->addProperty(); hProp->setPropertyName(tr("Height")); d_ptr->m_intPropertyManager->setValue(hProp, 0); d_ptr->m_intPropertyManager->setMinimum(hProp, 0); d_ptr->m_propertyToH[property] = hProp; d_ptr->m_hToProperty[hProp] = property; property->addSubProperty(hProp); } /*! \reimp */ void QtRectPropertyManager::uninitializeProperty(QtProperty *property) { QtProperty *xProp = d_ptr->m_propertyToX[property]; if (xProp) { d_ptr->m_xToProperty.remove(xProp); delete xProp; } d_ptr->m_propertyToX.remove(property); QtProperty *yProp = d_ptr->m_propertyToY[property]; if (yProp) { d_ptr->m_yToProperty.remove(yProp); delete yProp; } d_ptr->m_propertyToY.remove(property); QtProperty *wProp = d_ptr->m_propertyToW[property]; if (wProp) { d_ptr->m_wToProperty.remove(wProp); delete wProp; } d_ptr->m_propertyToW.remove(property); QtProperty *hProp = d_ptr->m_propertyToH[property]; if (hProp) { d_ptr->m_hToProperty.remove(hProp); delete hProp; } d_ptr->m_propertyToH.remove(property); d_ptr->m_values.remove(property); } // QtRectFPropertyManager class QtRectFPropertyManagerPrivate { QtRectFPropertyManager *q_ptr; Q_DECLARE_PUBLIC(QtRectFPropertyManager) public: void slotDoubleChanged(QtProperty *property, double value); void slotPropertyDestroyed(QtProperty *property); void setConstraint(QtProperty *property, const QRectF &constraint, const QRectF &val); struct Data { Data() : val(0, 0, 0, 0), decimals(2) {} QRectF val; QRectF constraint; int decimals; }; typedef QMap<const QtProperty *, Data> PropertyValueMap; PropertyValueMap m_values; QtDoublePropertyManager *m_doublePropertyManager; QMap<const QtProperty *, QtProperty *> m_propertyToX; QMap<const QtProperty *, QtProperty *> m_propertyToY; QMap<const QtProperty *, QtProperty *> m_propertyToW; QMap<const QtProperty *, QtProperty *> m_propertyToH; QMap<const QtProperty *, QtProperty *> m_xToProperty; QMap<const QtProperty *, QtProperty *> m_yToProperty; QMap<const QtProperty *, QtProperty *> m_wToProperty; QMap<const QtProperty *, QtProperty *> m_hToProperty; }; void QtRectFPropertyManagerPrivate::slotDoubleChanged(QtProperty *property, double value) { if (QtProperty *prop = m_xToProperty.value(property, 0)) { QRectF r = m_values[prop].val; r.moveLeft(value); q_ptr->setValue(prop, r); } else if (QtProperty *prop = m_yToProperty.value(property, 0)) { QRectF r = m_values[prop].val; r.moveTop(value); q_ptr->setValue(prop, r); } else if (QtProperty *prop = m_wToProperty.value(property, 0)) { Data data = m_values[prop]; QRectF r = data.val; r.setWidth(value); if (!data.constraint.isNull() && data.constraint.x() + data.constraint.width() < r.x() + r.width()) { r.moveLeft(data.constraint.left() + data.constraint.width() - r.width()); } q_ptr->setValue(prop, r); } else if (QtProperty *prop = m_hToProperty.value(property, 0)) { Data data = m_values[prop]; QRectF r = data.val; r.setHeight(value); if (!data.constraint.isNull() && data.constraint.y() + data.constraint.height() < r.y() + r.height()) { r.moveTop(data.constraint.top() + data.constraint.height() - r.height()); } q_ptr->setValue(prop, r); } } void QtRectFPropertyManagerPrivate::slotPropertyDestroyed(QtProperty *property) { if (QtProperty *pointProp = m_xToProperty.value(property, 0)) { m_propertyToX[pointProp] = 0; m_xToProperty.remove(property); } else if (QtProperty *pointProp = m_yToProperty.value(property, 0)) { m_propertyToY[pointProp] = 0; m_yToProperty.remove(property); } else if (QtProperty *pointProp = m_wToProperty.value(property, 0)) { m_propertyToW[pointProp] = 0; m_wToProperty.remove(property); } else if (QtProperty *pointProp = m_hToProperty.value(property, 0)) { m_propertyToH[pointProp] = 0; m_hToProperty.remove(property); } } void QtRectFPropertyManagerPrivate::setConstraint(QtProperty *property, const QRectF &constraint, const QRectF &val) { const bool isNull = constraint.isNull(); const float left = isNull ? FLT_MIN : constraint.left(); const float right = isNull ? FLT_MAX : constraint.left() + constraint.width(); const float top = isNull ? FLT_MIN : constraint.top(); const float bottom = isNull ? FLT_MAX : constraint.top() + constraint.height(); const float width = isNull ? FLT_MAX : constraint.width(); const float height = isNull ? FLT_MAX : constraint.height(); m_doublePropertyManager->setRange(m_propertyToX[property], left, right); m_doublePropertyManager->setRange(m_propertyToY[property], top, bottom); m_doublePropertyManager->setRange(m_propertyToW[property], 0, width); m_doublePropertyManager->setRange(m_propertyToH[property], 0, height); m_doublePropertyManager->setValue(m_propertyToX[property], val.x()); m_doublePropertyManager->setValue(m_propertyToY[property], val.y()); m_doublePropertyManager->setValue(m_propertyToW[property], val.width()); m_doublePropertyManager->setValue(m_propertyToH[property], val.height()); } /*! \class QtRectFPropertyManager \brief The QtRectFPropertyManager provides and manages QRectF properties. A rectangle property has nested \e x, \e y, \e width and \e height subproperties. The top-level property's value can be retrieved using the value() function, and set using the setValue() slot. The subproperties are created by a QtDoublePropertyManager object. This manager can be retrieved using the subDoublePropertyManager() function. In order to provide editing widgets for the subproperties in a property browser widget, this manager must be associated with an editor factory. A rectangle property also has a constraint rectangle which can be retrieved using the constraint() function, and set using the setConstraint() slot. In addition, QtRectFPropertyManager provides the valueChanged() signal which is Q_EMITted whenever a property created by this manager changes, and the constraintChanged() signal which is Q_EMITted whenever such a property changes its constraint rectangle. \sa QtAbstractPropertyManager, QtDoublePropertyManager, QtRectPropertyManager */ /*! \fn void QtRectFPropertyManager::valueChanged(QtProperty *property, const QRectF &value) This signal is Q_EMITted whenever a property created by this manager changes its value, passing a pointer to the \a property and the new \a value as parameters. \sa setValue() */ /*! \fn void QtRectFPropertyManager::constraintChanged(QtProperty *property, const QRectF &constraint) This signal is Q_EMITted whenever property changes its constraint rectangle, passing a pointer to the \a property and the new \a constraint rectangle as parameters. \sa setConstraint() */ /*! \fn void QtRectFPropertyManager::decimalsChanged(QtProperty *property, int prec) This signal is Q_EMITted whenever a property created by this manager changes its precision of value, passing a pointer to the \a property and the new \a prec value \sa setDecimals() */ /*! Creates a manager with the given \a parent. */ QtRectFPropertyManager::QtRectFPropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { d_ptr = new QtRectFPropertyManagerPrivate; d_ptr->q_ptr = this; d_ptr->m_doublePropertyManager = new QtDoublePropertyManager(this); connect(d_ptr->m_doublePropertyManager, SIGNAL(valueChanged(QtProperty *, double)), this, SLOT(slotDoubleChanged(QtProperty *, double))); connect(d_ptr->m_doublePropertyManager, SIGNAL(propertyDestroyed(QtProperty *)), this, SLOT(slotPropertyDestroyed(QtProperty *))); } /*! Destroys this manager, and all the properties it has created. */ QtRectFPropertyManager::~QtRectFPropertyManager() { clear(); delete d_ptr; } /*! Returns the manager that creates the nested \e x, \e y, \e width and \e height subproperties. In order to provide editing widgets for the mentioned subproperties in a property browser widget, this manager must be associated with an editor factory. \sa QtAbstractPropertyBrowser::setFactoryForManager() */ QtDoublePropertyManager *QtRectFPropertyManager::subDoublePropertyManager() const { return d_ptr->m_doublePropertyManager; } /*! Returns the given \a property's value. If the given \a property is not managed by this manager, this function returns an invalid rectangle. \sa setValue(), constraint() */ QRectF QtRectFPropertyManager::value(const QtProperty *property) const { return getValue<QRectF>(d_ptr->m_values, property); } /*! Returns the given \a property's precision, in decimals. \sa setDecimals() */ int QtRectFPropertyManager::decimals(const QtProperty *property) const { return getData<int>(d_ptr->m_values, &QtRectFPropertyManagerPrivate::Data::decimals, property, 0); } /*! Returns the given \a property's constraining rectangle. If returned value is null QRectF it means there is no constraint applied. \sa value(), setConstraint() */ QRectF QtRectFPropertyManager::constraint(const QtProperty *property) const { return getData<QRectF>(d_ptr->m_values, &QtRectFPropertyManagerPrivate::Data::constraint, property, QRect()); } /*! \reimp */ QString QtRectFPropertyManager::valueText(const QtProperty *property) const { const QtRectFPropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); const QRectF v = it.value().val; const int dec = it.value().decimals; return QString(tr("[(%1, %2), %3 x %4]").arg(QString::number(v.x(), 'f', dec)) .arg(QString::number(v.y(), 'f', dec)) .arg(QString::number(v.width(), 'f', dec)) .arg(QString::number(v.height(), 'f', dec))); } /*! \fn void QtRectFPropertyManager::setValue(QtProperty *property, const QRectF &value) Sets the value of the given \a property to \a value. Nested properties are updated automatically. If the specified \a value is not inside the given \a property's constraining rectangle, the value is adjusted accordingly to fit within the constraint. \sa value(), setConstraint(), valueChanged() */ void QtRectFPropertyManager::setValue(QtProperty *property, const QRectF &val) { const QtRectFPropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; QtRectFPropertyManagerPrivate::Data data = it.value(); QRectF newRect = val.normalized(); if (!data.constraint.isNull() && !data.constraint.contains(newRect)) { const QRectF r1 = data.constraint; const QRectF r2 = newRect; newRect.setLeft(qMax(r1.left(), r2.left())); newRect.setRight(qMin(r1.right(), r2.right())); newRect.setTop(qMax(r1.top(), r2.top())); newRect.setBottom(qMin(r1.bottom(), r2.bottom())); if (newRect.width() < 0 || newRect.height() < 0) return; } if (data.val == newRect) return; data.val = newRect; it.value() = data; d_ptr->m_doublePropertyManager->setValue(d_ptr->m_propertyToX[property], newRect.x()); d_ptr->m_doublePropertyManager->setValue(d_ptr->m_propertyToY[property], newRect.y()); d_ptr->m_doublePropertyManager->setValue(d_ptr->m_propertyToW[property], newRect.width()); d_ptr->m_doublePropertyManager->setValue(d_ptr->m_propertyToH[property], newRect.height()); Q_EMIT propertyChanged(property); Q_EMIT valueChanged(property, data.val); } /*! Sets the given \a property's constraining rectangle to \a constraint. When setting the constraint, the current value is adjusted if necessary (ensuring that the current rectangle value is inside the constraint). In order to reset the constraint pass a null QRectF value. \sa setValue(), constraint(), constraintChanged() */ void QtRectFPropertyManager::setConstraint(QtProperty *property, const QRectF &constraint) { const QtRectFPropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; QtRectFPropertyManagerPrivate::Data data = it.value(); QRectF newConstraint = constraint.normalized(); if (data.constraint == newConstraint) return; const QRectF oldVal = data.val; data.constraint = newConstraint; if (!data.constraint.isNull() && !data.constraint.contains(oldVal)) { QRectF r1 = data.constraint; QRectF r2 = data.val; if (r2.width() > r1.width()) r2.setWidth(r1.width()); if (r2.height() > r1.height()) r2.setHeight(r1.height()); if (r2.left() < r1.left()) r2.moveLeft(r1.left()); else if (r2.right() > r1.right()) r2.moveRight(r1.right()); if (r2.top() < r1.top()) r2.moveTop(r1.top()); else if (r2.bottom() > r1.bottom()) r2.moveBottom(r1.bottom()); data.val = r2; } it.value() = data; Q_EMIT constraintChanged(property, data.constraint); d_ptr->setConstraint(property, data.constraint, data.val); if (data.val == oldVal) return; Q_EMIT propertyChanged(property); Q_EMIT valueChanged(property, data.val); } /*! \fn void QtRectFPropertyManager::setDecimals(QtProperty *property, int prec) Sets the precision of the given \a property to \a prec. The valid decimal range is 0-13. The default is 2. \sa decimals() */ void QtRectFPropertyManager::setDecimals(QtProperty *property, int prec) { const QtRectFPropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; QtRectFPropertyManagerPrivate::Data data = it.value(); if (prec > 13) prec = 13; else if (prec < 0) prec = 0; if (data.decimals == prec) return; data.decimals = prec; d_ptr->m_doublePropertyManager->setDecimals(d_ptr->m_propertyToX[property], prec); d_ptr->m_doublePropertyManager->setDecimals(d_ptr->m_propertyToY[property], prec); d_ptr->m_doublePropertyManager->setDecimals(d_ptr->m_propertyToW[property], prec); d_ptr->m_doublePropertyManager->setDecimals(d_ptr->m_propertyToH[property], prec); it.value() = data; Q_EMIT decimalsChanged(property, data.decimals); } /*! \reimp */ void QtRectFPropertyManager::initializeProperty(QtProperty *property) { d_ptr->m_values[property] = QtRectFPropertyManagerPrivate::Data(); QtProperty *xProp = d_ptr->m_doublePropertyManager->addProperty(); xProp->setPropertyName(tr("X")); d_ptr->m_doublePropertyManager->setDecimals(xProp, decimals(property)); d_ptr->m_doublePropertyManager->setValue(xProp, 0); d_ptr->m_propertyToX[property] = xProp; d_ptr->m_xToProperty[xProp] = property; property->addSubProperty(xProp); QtProperty *yProp = d_ptr->m_doublePropertyManager->addProperty(); yProp->setPropertyName(tr("Y")); d_ptr->m_doublePropertyManager->setDecimals(yProp, decimals(property)); d_ptr->m_doublePropertyManager->setValue(yProp, 0); d_ptr->m_propertyToY[property] = yProp; d_ptr->m_yToProperty[yProp] = property; property->addSubProperty(yProp); QtProperty *wProp = d_ptr->m_doublePropertyManager->addProperty(); wProp->setPropertyName(tr("Width")); d_ptr->m_doublePropertyManager->setDecimals(wProp, decimals(property)); d_ptr->m_doublePropertyManager->setValue(wProp, 0); d_ptr->m_doublePropertyManager->setMinimum(wProp, 0); d_ptr->m_propertyToW[property] = wProp; d_ptr->m_wToProperty[wProp] = property; property->addSubProperty(wProp); QtProperty *hProp = d_ptr->m_doublePropertyManager->addProperty(); hProp->setPropertyName(tr("Height")); d_ptr->m_doublePropertyManager->setDecimals(hProp, decimals(property)); d_ptr->m_doublePropertyManager->setValue(hProp, 0); d_ptr->m_doublePropertyManager->setMinimum(hProp, 0); d_ptr->m_propertyToH[property] = hProp; d_ptr->m_hToProperty[hProp] = property; property->addSubProperty(hProp); } /*! \reimp */ void QtRectFPropertyManager::uninitializeProperty(QtProperty *property) { QtProperty *xProp = d_ptr->m_propertyToX[property]; if (xProp) { d_ptr->m_xToProperty.remove(xProp); delete xProp; } d_ptr->m_propertyToX.remove(property); QtProperty *yProp = d_ptr->m_propertyToY[property]; if (yProp) { d_ptr->m_yToProperty.remove(yProp); delete yProp; } d_ptr->m_propertyToY.remove(property); QtProperty *wProp = d_ptr->m_propertyToW[property]; if (wProp) { d_ptr->m_wToProperty.remove(wProp); delete wProp; } d_ptr->m_propertyToW.remove(property); QtProperty *hProp = d_ptr->m_propertyToH[property]; if (hProp) { d_ptr->m_hToProperty.remove(hProp); delete hProp; } d_ptr->m_propertyToH.remove(property); d_ptr->m_values.remove(property); } // QtEnumPropertyManager class QtEnumPropertyManagerPrivate { QtEnumPropertyManager *q_ptr; Q_DECLARE_PUBLIC(QtEnumPropertyManager) public: struct Data { Data() : val(-1) {} int val; QStringList enumNames; QMap<int, QIcon> enumIcons; }; typedef QMap<const QtProperty *, Data> PropertyValueMap; PropertyValueMap m_values; }; /*! \class QtEnumPropertyManager \brief The QtEnumPropertyManager provides and manages enum properties. Each enum property has an associated list of enum names which can be retrieved using the enumNames() function, and set using the corresponding setEnumNames() function. An enum property's value is represented by an index in this list, and can be retrieved and set using the value() and setValue() slots respectively. Each enum value can also have an associated icon. The mapping from values to icons can be set using the setEnumIcons() function and queried with the enumIcons() function. In addition, QtEnumPropertyManager provides the valueChanged() signal which is Q_EMITted whenever a property created by this manager changes. The enumNamesChanged() or enumIconsChanged() signal is Q_EMITted whenever the list of enum names or icons is altered. \sa QtAbstractPropertyManager, QtEnumEditorFactory */ /*! \fn void QtEnumPropertyManager::valueChanged(QtProperty *property, int value) This signal is Q_EMITted whenever a property created by this manager changes its value, passing a pointer to the \a property and the new \a value as parameters. \sa setValue() */ /*! \fn void QtEnumPropertyManager::enumNamesChanged(QtProperty *property, const QStringList &names) This signal is Q_EMITted whenever a property created by this manager changes its enum names, passing a pointer to the \a property and the new \a names as parameters. \sa setEnumNames() */ /*! \fn void QtEnumPropertyManager::enumIconsChanged(QtProperty *property, const QMap<int, QIcon> &icons) This signal is Q_EMITted whenever a property created by this manager changes its enum icons, passing a pointer to the \a property and the new mapping of values to \a icons as parameters. \sa setEnumIcons() */ /*! Creates a manager with the given \a parent. */ QtEnumPropertyManager::QtEnumPropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { d_ptr = new QtEnumPropertyManagerPrivate; d_ptr->q_ptr = this; } /*! Destroys this manager, and all the properties it has created. */ QtEnumPropertyManager::~QtEnumPropertyManager() { clear(); delete d_ptr; } /*! Returns the given \a property's value which is an index in the list returned by enumNames() If the given property is not managed by this manager, this function returns -1. \sa enumNames(), setValue() */ int QtEnumPropertyManager::value(const QtProperty *property) const { return getValue<int>(d_ptr->m_values, property, -1); } /*! Returns the given \a property's list of enum names. \sa value(), setEnumNames() */ QStringList QtEnumPropertyManager::enumNames(const QtProperty *property) const { return getData<QStringList>(d_ptr->m_values, &QtEnumPropertyManagerPrivate::Data::enumNames, property, QStringList()); } /*! Returns the given \a property's map of enum values to their icons. \sa value(), setEnumIcons() */ QMap<int, QIcon> QtEnumPropertyManager::enumIcons(const QtProperty *property) const { return getData<QMap<int, QIcon> >(d_ptr->m_values, &QtEnumPropertyManagerPrivate::Data::enumIcons, property, QMap<int, QIcon>()); } /*! \reimp */ QString QtEnumPropertyManager::valueText(const QtProperty *property) const { const QtEnumPropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); const QtEnumPropertyManagerPrivate::Data &data = it.value(); const int v = data.val; if (v >= 0 && v < data.enumNames.count()) return data.enumNames.at(v); return QString(); } /*! \reimp */ QIcon QtEnumPropertyManager::valueIcon(const QtProperty *property) const { const QtEnumPropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QIcon(); const QtEnumPropertyManagerPrivate::Data &data = it.value(); const int v = data.val; return data.enumIcons.value(v); } /*! \fn void QtEnumPropertyManager::setValue(QtProperty *property, int value) Sets the value of the given \a property to \a value. The specified \a value must be less than the size of the given \a property's enumNames() list, and larger than (or equal to) 0. \sa value(), valueChanged() */ void QtEnumPropertyManager::setValue(QtProperty *property, int val) { const QtEnumPropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; QtEnumPropertyManagerPrivate::Data data = it.value(); if (val >= data.enumNames.count()) return; if (val < 0 && data.enumNames.count() > 0) return; if (val < 0) val = -1; if (data.val == val) return; data.val = val; it.value() = data; Q_EMIT propertyChanged(property); Q_EMIT valueChanged(property, data.val); } /*! Sets the given \a property's list of enum names to \a enumNames. The \a property's current value is reset to 0 indicating the first item of the list. If the specified \a enumNames list is empty, the \a property's current value is set to -1. \sa enumNames(), enumNamesChanged() */ void QtEnumPropertyManager::setEnumNames(QtProperty *property, const QStringList &enumNames) { const QtEnumPropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; QtEnumPropertyManagerPrivate::Data data = it.value(); if (data.enumNames == enumNames) return; data.enumNames = enumNames; data.val = -1; if (enumNames.count() > 0) data.val = 0; it.value() = data; Q_EMIT enumNamesChanged(property, data.enumNames); Q_EMIT propertyChanged(property); Q_EMIT valueChanged(property, data.val); } /*! Sets the given \a property's map of enum values to their icons to \a enumIcons. Each enum value can have associated icon. This association is represented with passed \a enumIcons map. \sa enumNames(), enumNamesChanged() */ void QtEnumPropertyManager::setEnumIcons(QtProperty *property, const QMap<int, QIcon> &enumIcons) { const QtEnumPropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; it.value().enumIcons = enumIcons; Q_EMIT enumIconsChanged(property, it.value().enumIcons); Q_EMIT propertyChanged(property); } /*! \reimp */ void QtEnumPropertyManager::initializeProperty(QtProperty *property) { d_ptr->m_values[property] = QtEnumPropertyManagerPrivate::Data(); } /*! \reimp */ void QtEnumPropertyManager::uninitializeProperty(QtProperty *property) { d_ptr->m_values.remove(property); } // QtFlagPropertyManager class QtFlagPropertyManagerPrivate { QtFlagPropertyManager *q_ptr; Q_DECLARE_PUBLIC(QtFlagPropertyManager) public: void slotBoolChanged(QtProperty *property, bool value); void slotPropertyDestroyed(QtProperty *property); struct Data { Data() : val(-1) {} int val; QStringList flagNames; }; typedef QMap<const QtProperty *, Data> PropertyValueMap; PropertyValueMap m_values; QtBoolPropertyManager *m_boolPropertyManager; QMap<const QtProperty *, QList<QtProperty *> > m_propertyToFlags; QMap<const QtProperty *, QtProperty *> m_flagToProperty; }; void QtFlagPropertyManagerPrivate::slotBoolChanged(QtProperty *property, bool value) { QtProperty *prop = m_flagToProperty.value(property, 0); if (prop == 0) return; QListIterator<QtProperty *> itProp(m_propertyToFlags[prop]); int level = 0; while (itProp.hasNext()) { QtProperty *p = itProp.next(); if (p == property) { int v = m_values[prop].val; if (value) { v |= (1 << level); } else { v &= ~(1 << level); } q_ptr->setValue(prop, v); return; } level++; } } void QtFlagPropertyManagerPrivate::slotPropertyDestroyed(QtProperty *property) { QtProperty *flagProperty = m_flagToProperty.value(property, 0); if (flagProperty == 0) return; m_propertyToFlags[flagProperty].replace(m_propertyToFlags[flagProperty].indexOf(property), 0); m_flagToProperty.remove(property); } /*! \class QtFlagPropertyManager \brief The QtFlagPropertyManager provides and manages flag properties. Each flag property has an associated list of flag names which can be retrieved using the flagNames() function, and set using the corresponding setFlagNames() function. The flag manager provides properties with nested boolean subproperties representing each flag, i.e. a flag property's value is the binary combination of the subproperties' values. A property's value can be retrieved and set using the value() and setValue() slots respectively. The combination of flags is represented by single int value - that's why it's possible to store up to 32 independent flags in one flag property. The subproperties are created by a QtBoolPropertyManager object. This manager can be retrieved using the subBoolPropertyManager() function. In order to provide editing widgets for the subproperties in a property browser widget, this manager must be associated with an editor factory. In addition, QtFlagPropertyManager provides the valueChanged() signal which is Q_EMITted whenever a property created by this manager changes, and the flagNamesChanged() signal which is Q_EMITted whenever the list of flag names is altered. \sa QtAbstractPropertyManager, QtBoolPropertyManager */ /*! \fn void QtFlagPropertyManager::valueChanged(QtProperty *property, int value) This signal is Q_EMITted whenever a property created by this manager changes its value, passing a pointer to the \a property and the new \a value as parameters. \sa setValue() */ /*! \fn void QtFlagPropertyManager::flagNamesChanged(QtProperty *property, const QStringList &names) This signal is Q_EMITted whenever a property created by this manager changes its flag names, passing a pointer to the \a property and the new \a names as parameters. \sa setFlagNames() */ /*! Creates a manager with the given \a parent. */ QtFlagPropertyManager::QtFlagPropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { d_ptr = new QtFlagPropertyManagerPrivate; d_ptr->q_ptr = this; d_ptr->m_boolPropertyManager = new QtBoolPropertyManager(this); connect(d_ptr->m_boolPropertyManager, SIGNAL(valueChanged(QtProperty *, bool)), this, SLOT(slotBoolChanged(QtProperty *, bool))); connect(d_ptr->m_boolPropertyManager, SIGNAL(propertyDestroyed(QtProperty *)), this, SLOT(slotPropertyDestroyed(QtProperty *))); } /*! Destroys this manager, and all the properties it has created. */ QtFlagPropertyManager::~QtFlagPropertyManager() { clear(); delete d_ptr; } /*! Returns the manager that produces the nested boolean subproperties representing each flag. In order to provide editing widgets for the subproperties in a property browser widget, this manager must be associated with an editor factory. \sa QtAbstractPropertyBrowser::setFactoryForManager() */ QtBoolPropertyManager *QtFlagPropertyManager::subBoolPropertyManager() const { return d_ptr->m_boolPropertyManager; } /*! Returns the given \a property's value. If the given property is not managed by this manager, this function returns 0. \sa flagNames(), setValue() */ int QtFlagPropertyManager::value(const QtProperty *property) const { return getValue<int>(d_ptr->m_values, property, 0); } /*! Returns the given \a property's list of flag names. \sa value(), setFlagNames() */ QStringList QtFlagPropertyManager::flagNames(const QtProperty *property) const { return getData<QStringList>(d_ptr->m_values, &QtFlagPropertyManagerPrivate::Data::flagNames, property, QStringList()); } /*! \reimp */ QString QtFlagPropertyManager::valueText(const QtProperty *property) const { const QtFlagPropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); const QtFlagPropertyManagerPrivate::Data &data = it.value(); QString str; int level = 0; const QChar bar = QLatin1Char('|'); const QStringList::const_iterator fncend = data.flagNames.constEnd(); for (QStringList::const_iterator it = data.flagNames.constBegin(); it != fncend; ++it) { if (data.val & (1 << level)) { if (!str.isEmpty()) str += bar; str += *it; } level++; } return str; } /*! \fn void QtFlagPropertyManager::setValue(QtProperty *property, int value) Sets the value of the given \a property to \a value. Nested properties are updated automatically. The specified \a value must be less than the binary combination of the property's flagNames() list size (i.e. less than 2\sup n, where \c n is the size of the list) and larger than (or equal to) 0. \sa value(), valueChanged() */ void QtFlagPropertyManager::setValue(QtProperty *property, int val) { const QtFlagPropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; QtFlagPropertyManagerPrivate::Data data = it.value(); if (data.val == val) return; if (val > (1 << data.flagNames.count()) - 1) return; if (val < 0) return; data.val = val; it.value() = data; QListIterator<QtProperty *> itProp(d_ptr->m_propertyToFlags[property]); int level = 0; while (itProp.hasNext()) { QtProperty *prop = itProp.next(); if (prop) d_ptr->m_boolPropertyManager->setValue(prop, val & (1 << level)); level++; } Q_EMIT propertyChanged(property); Q_EMIT valueChanged(property, data.val); } /*! Sets the given \a property's list of flag names to \a flagNames. The property's current value is reset to 0 indicating the first item of the list. \sa flagNames(), flagNamesChanged() */ void QtFlagPropertyManager::setFlagNames(QtProperty *property, const QStringList &flagNames) { const QtFlagPropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; QtFlagPropertyManagerPrivate::Data data = it.value(); if (data.flagNames == flagNames) return; data.flagNames = flagNames; data.val = 0; it.value() = data; QListIterator<QtProperty *> itProp(d_ptr->m_propertyToFlags[property]); while (itProp.hasNext()) { QtProperty *prop = itProp.next(); if (prop) { delete prop; d_ptr->m_flagToProperty.remove(prop); } } d_ptr->m_propertyToFlags[property].clear(); QStringListIterator itFlag(flagNames); while (itFlag.hasNext()) { const QString flagName = itFlag.next(); QtProperty *prop = d_ptr->m_boolPropertyManager->addProperty(); prop->setPropertyName(flagName); property->addSubProperty(prop); d_ptr->m_propertyToFlags[property].append(prop); d_ptr->m_flagToProperty[prop] = property; } Q_EMIT flagNamesChanged(property, data.flagNames); Q_EMIT propertyChanged(property); Q_EMIT valueChanged(property, data.val); } /*! \reimp */ void QtFlagPropertyManager::initializeProperty(QtProperty *property) { d_ptr->m_values[property] = QtFlagPropertyManagerPrivate::Data(); d_ptr->m_propertyToFlags[property] = QList<QtProperty *>(); } /*! \reimp */ void QtFlagPropertyManager::uninitializeProperty(QtProperty *property) { QListIterator<QtProperty *> itProp(d_ptr->m_propertyToFlags[property]); while (itProp.hasNext()) { QtProperty *prop = itProp.next(); if (prop) { delete prop; d_ptr->m_flagToProperty.remove(prop); } } d_ptr->m_propertyToFlags.remove(property); d_ptr->m_values.remove(property); } // QtSizePolicyPropertyManager class QtSizePolicyPropertyManagerPrivate { QtSizePolicyPropertyManager *q_ptr; Q_DECLARE_PUBLIC(QtSizePolicyPropertyManager) public: QtSizePolicyPropertyManagerPrivate(); void slotIntChanged(QtProperty *property, int value); void slotEnumChanged(QtProperty *property, int value); void slotPropertyDestroyed(QtProperty *property); typedef QMap<const QtProperty *, QSizePolicy> PropertyValueMap; PropertyValueMap m_values; QtIntPropertyManager *m_intPropertyManager; QtEnumPropertyManager *m_enumPropertyManager; QMap<const QtProperty *, QtProperty *> m_propertyToHPolicy; QMap<const QtProperty *, QtProperty *> m_propertyToVPolicy; QMap<const QtProperty *, QtProperty *> m_propertyToHStretch; QMap<const QtProperty *, QtProperty *> m_propertyToVStretch; QMap<const QtProperty *, QtProperty *> m_hPolicyToProperty; QMap<const QtProperty *, QtProperty *> m_vPolicyToProperty; QMap<const QtProperty *, QtProperty *> m_hStretchToProperty; QMap<const QtProperty *, QtProperty *> m_vStretchToProperty; }; QtSizePolicyPropertyManagerPrivate::QtSizePolicyPropertyManagerPrivate() { } void QtSizePolicyPropertyManagerPrivate::slotIntChanged(QtProperty *property, int value) { if (QtProperty *prop = m_hStretchToProperty.value(property, 0)) { QSizePolicy sp = m_values[prop]; sp.setHorizontalStretch(value); q_ptr->setValue(prop, sp); } else if (QtProperty *prop = m_vStretchToProperty.value(property, 0)) { QSizePolicy sp = m_values[prop]; sp.setVerticalStretch(value); q_ptr->setValue(prop, sp); } } void QtSizePolicyPropertyManagerPrivate::slotEnumChanged(QtProperty *property, int value) { if (QtProperty *prop = m_hPolicyToProperty.value(property, 0)) { QSizePolicy sp = m_values[prop]; sp.setHorizontalPolicy(metaEnumProvider()->indexToSizePolicy(value)); q_ptr->setValue(prop, sp); } else if (QtProperty *prop = m_vPolicyToProperty.value(property, 0)) { QSizePolicy sp = m_values[prop]; sp.setVerticalPolicy(metaEnumProvider()->indexToSizePolicy(value)); q_ptr->setValue(prop, sp); } } void QtSizePolicyPropertyManagerPrivate::slotPropertyDestroyed(QtProperty *property) { if (QtProperty *pointProp = m_hStretchToProperty.value(property, 0)) { m_propertyToHStretch[pointProp] = 0; m_hStretchToProperty.remove(property); } else if (QtProperty *pointProp = m_vStretchToProperty.value(property, 0)) { m_propertyToVStretch[pointProp] = 0; m_vStretchToProperty.remove(property); } else if (QtProperty *pointProp = m_hPolicyToProperty.value(property, 0)) { m_propertyToHPolicy[pointProp] = 0; m_hPolicyToProperty.remove(property); } else if (QtProperty *pointProp = m_vPolicyToProperty.value(property, 0)) { m_propertyToVPolicy[pointProp] = 0; m_vPolicyToProperty.remove(property); } } /*! \class QtSizePolicyPropertyManager \brief The QtSizePolicyPropertyManager provides and manages QSizePolicy properties. A size policy property has nested \e horizontalPolicy, \e verticalPolicy, \e horizontalStretch and \e verticalStretch subproperties. The top-level property's value can be retrieved using the value() function, and set using the setValue() slot. The subproperties are created by QtIntPropertyManager and QtEnumPropertyManager objects. These managers can be retrieved using the subIntPropertyManager() and subEnumPropertyManager() functions respectively. In order to provide editing widgets for the subproperties in a property browser widget, these managers must be associated with editor factories. In addition, QtSizePolicyPropertyManager provides the valueChanged() signal which is Q_EMITted whenever a property created by this manager changes. \sa QtAbstractPropertyManager, QtIntPropertyManager, QtEnumPropertyManager */ /*! \fn void QtSizePolicyPropertyManager::valueChanged(QtProperty *property, const QSizePolicy &value) This signal is Q_EMITted whenever a property created by this manager changes its value, passing a pointer to the \a property and the new \a value as parameters. \sa setValue() */ /*! Creates a manager with the given \a parent. */ QtSizePolicyPropertyManager::QtSizePolicyPropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { d_ptr = new QtSizePolicyPropertyManagerPrivate; d_ptr->q_ptr = this; d_ptr->m_intPropertyManager = new QtIntPropertyManager(this); connect(d_ptr->m_intPropertyManager, SIGNAL(valueChanged(QtProperty *, int)), this, SLOT(slotIntChanged(QtProperty *, int))); d_ptr->m_enumPropertyManager = new QtEnumPropertyManager(this); connect(d_ptr->m_enumPropertyManager, SIGNAL(valueChanged(QtProperty *, int)), this, SLOT(slotEnumChanged(QtProperty *, int))); connect(d_ptr->m_intPropertyManager, SIGNAL(propertyDestroyed(QtProperty *)), this, SLOT(slotPropertyDestroyed(QtProperty *))); connect(d_ptr->m_enumPropertyManager, SIGNAL(propertyDestroyed(QtProperty *)), this, SLOT(slotPropertyDestroyed(QtProperty *))); } /*! Destroys this manager, and all the properties it has created. */ QtSizePolicyPropertyManager::~QtSizePolicyPropertyManager() { clear(); delete d_ptr; } /*! Returns the manager that creates the nested \e horizontalStretch and \e verticalStretch subproperties. In order to provide editing widgets for the mentioned subproperties in a property browser widget, this manager must be associated with an editor factory. \sa QtAbstractPropertyBrowser::setFactoryForManager() */ QtIntPropertyManager *QtSizePolicyPropertyManager::subIntPropertyManager() const { return d_ptr->m_intPropertyManager; } /*! Returns the manager that creates the nested \e horizontalPolicy and \e verticalPolicy subproperties. In order to provide editing widgets for the mentioned subproperties in a property browser widget, this manager must be associated with an editor factory. \sa QtAbstractPropertyBrowser::setFactoryForManager() */ QtEnumPropertyManager *QtSizePolicyPropertyManager::subEnumPropertyManager() const { return d_ptr->m_enumPropertyManager; } /*! Returns the given \a property's value. If the given property is not managed by this manager, this function returns the default size policy. \sa setValue() */ QSizePolicy QtSizePolicyPropertyManager::value(const QtProperty *property) const { return d_ptr->m_values.value(property, QSizePolicy()); } /*! \reimp */ QString QtSizePolicyPropertyManager::valueText(const QtProperty *property) const { const QtSizePolicyPropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); const QSizePolicy sp = it.value(); const QtMetaEnumProvider *mep = metaEnumProvider(); const int hIndex = mep->sizePolicyToIndex(sp.horizontalPolicy()); const int vIndex = mep->sizePolicyToIndex(sp.verticalPolicy()); //! Unknown size policy on reading invalid uic3 files const QString hPolicy = hIndex != -1 ? mep->policyEnumNames().at(hIndex) : tr("<Invalid>"); const QString vPolicy = vIndex != -1 ? mep->policyEnumNames().at(vIndex) : tr("<Invalid>"); const QString str = tr("[%1, %2, %3, %4]").arg(hPolicy, vPolicy).arg(sp.horizontalStretch()).arg(sp.verticalStretch()); return str; } /*! \fn void QtSizePolicyPropertyManager::setValue(QtProperty *property, const QSizePolicy &value) Sets the value of the given \a property to \a value. Nested properties are updated automatically. \sa value(), valueChanged() */ void QtSizePolicyPropertyManager::setValue(QtProperty *property, const QSizePolicy &val) { const QtSizePolicyPropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; if (it.value() == val) return; it.value() = val; d_ptr->m_enumPropertyManager->setValue(d_ptr->m_propertyToHPolicy[property], metaEnumProvider()->sizePolicyToIndex(val.horizontalPolicy())); d_ptr->m_enumPropertyManager->setValue(d_ptr->m_propertyToVPolicy[property], metaEnumProvider()->sizePolicyToIndex(val.verticalPolicy())); d_ptr->m_intPropertyManager->setValue(d_ptr->m_propertyToHStretch[property], val.horizontalStretch()); d_ptr->m_intPropertyManager->setValue(d_ptr->m_propertyToVStretch[property], val.verticalStretch()); Q_EMIT propertyChanged(property); Q_EMIT valueChanged(property, val); } /*! \reimp */ void QtSizePolicyPropertyManager::initializeProperty(QtProperty *property) { QSizePolicy val; d_ptr->m_values[property] = val; QtProperty *hPolicyProp = d_ptr->m_enumPropertyManager->addProperty(); hPolicyProp->setPropertyName(tr("Horizontal Policy")); d_ptr->m_enumPropertyManager->setEnumNames(hPolicyProp, metaEnumProvider()->policyEnumNames()); d_ptr->m_enumPropertyManager->setValue(hPolicyProp, metaEnumProvider()->sizePolicyToIndex(val.horizontalPolicy())); d_ptr->m_propertyToHPolicy[property] = hPolicyProp; d_ptr->m_hPolicyToProperty[hPolicyProp] = property; property->addSubProperty(hPolicyProp); QtProperty *vPolicyProp = d_ptr->m_enumPropertyManager->addProperty(); vPolicyProp->setPropertyName(tr("Vertical Policy")); d_ptr->m_enumPropertyManager->setEnumNames(vPolicyProp, metaEnumProvider()->policyEnumNames()); d_ptr->m_enumPropertyManager->setValue(vPolicyProp, metaEnumProvider()->sizePolicyToIndex(val.verticalPolicy())); d_ptr->m_propertyToVPolicy[property] = vPolicyProp; d_ptr->m_vPolicyToProperty[vPolicyProp] = property; property->addSubProperty(vPolicyProp); QtProperty *hStretchProp = d_ptr->m_intPropertyManager->addProperty(); hStretchProp->setPropertyName(tr("Horizontal Stretch")); d_ptr->m_intPropertyManager->setValue(hStretchProp, val.horizontalStretch()); d_ptr->m_intPropertyManager->setRange(hStretchProp, 0, 0xff); d_ptr->m_propertyToHStretch[property] = hStretchProp; d_ptr->m_hStretchToProperty[hStretchProp] = property; property->addSubProperty(hStretchProp); QtProperty *vStretchProp = d_ptr->m_intPropertyManager->addProperty(); vStretchProp->setPropertyName(tr("Vertical Stretch")); d_ptr->m_intPropertyManager->setValue(vStretchProp, val.verticalStretch()); d_ptr->m_intPropertyManager->setRange(vStretchProp, 0, 0xff); d_ptr->m_propertyToVStretch[property] = vStretchProp; d_ptr->m_vStretchToProperty[vStretchProp] = property; property->addSubProperty(vStretchProp); } /*! \reimp */ void QtSizePolicyPropertyManager::uninitializeProperty(QtProperty *property) { QtProperty *hPolicyProp = d_ptr->m_propertyToHPolicy[property]; if (hPolicyProp) { d_ptr->m_hPolicyToProperty.remove(hPolicyProp); delete hPolicyProp; } d_ptr->m_propertyToHPolicy.remove(property); QtProperty *vPolicyProp = d_ptr->m_propertyToVPolicy[property]; if (vPolicyProp) { d_ptr->m_vPolicyToProperty.remove(vPolicyProp); delete vPolicyProp; } d_ptr->m_propertyToVPolicy.remove(property); QtProperty *hStretchProp = d_ptr->m_propertyToHStretch[property]; if (hStretchProp) { d_ptr->m_hStretchToProperty.remove(hStretchProp); delete hStretchProp; } d_ptr->m_propertyToHStretch.remove(property); QtProperty *vStretchProp = d_ptr->m_propertyToVStretch[property]; if (vStretchProp) { d_ptr->m_vStretchToProperty.remove(vStretchProp); delete vStretchProp; } d_ptr->m_propertyToVStretch.remove(property); d_ptr->m_values.remove(property); } // QtFontPropertyManager: // QtFontPropertyManagerPrivate has a mechanism for reacting // to QApplication::fontDatabaseChanged() [4.5], which is Q_EMITted // when someone loads an application font. The signals are compressed // using a timer with interval 0, which then causes the family // enumeration manager to re-set its strings and index values // for each property. Q_GLOBAL_STATIC(QFontDatabase, fontDatabase) class QtFontPropertyManagerPrivate { QtFontPropertyManager *q_ptr; Q_DECLARE_PUBLIC(QtFontPropertyManager) public: QtFontPropertyManagerPrivate(); void slotIntChanged(QtProperty *property, int value); void slotEnumChanged(QtProperty *property, int value); void slotBoolChanged(QtProperty *property, bool value); void slotPropertyDestroyed(QtProperty *property); void slotFontDatabaseChanged(); void slotFontDatabaseDelayedChange(); QStringList m_familyNames; typedef QMap<const QtProperty *, QFont> PropertyValueMap; PropertyValueMap m_values; QtIntPropertyManager *m_intPropertyManager; QtEnumPropertyManager *m_enumPropertyManager; QtBoolPropertyManager *m_boolPropertyManager; QMap<const QtProperty *, QtProperty *> m_propertyToFamily; QMap<const QtProperty *, QtProperty *> m_propertyToPointSize; QMap<const QtProperty *, QtProperty *> m_propertyToBold; QMap<const QtProperty *, QtProperty *> m_propertyToItalic; QMap<const QtProperty *, QtProperty *> m_propertyToUnderline; QMap<const QtProperty *, QtProperty *> m_propertyToStrikeOut; QMap<const QtProperty *, QtProperty *> m_propertyToKerning; QMap<const QtProperty *, QtProperty *> m_familyToProperty; QMap<const QtProperty *, QtProperty *> m_pointSizeToProperty; QMap<const QtProperty *, QtProperty *> m_boldToProperty; QMap<const QtProperty *, QtProperty *> m_italicToProperty; QMap<const QtProperty *, QtProperty *> m_underlineToProperty; QMap<const QtProperty *, QtProperty *> m_strikeOutToProperty; QMap<const QtProperty *, QtProperty *> m_kerningToProperty; bool m_settingValue; QTimer *m_fontDatabaseChangeTimer; }; QtFontPropertyManagerPrivate::QtFontPropertyManagerPrivate() : m_settingValue(false), m_fontDatabaseChangeTimer(0) { } void QtFontPropertyManagerPrivate::slotIntChanged(QtProperty *property, int value) { if (m_settingValue) return; if (QtProperty *prop = m_pointSizeToProperty.value(property, 0)) { QFont f = m_values[prop]; f.setPointSize(value); q_ptr->setValue(prop, f); } } void QtFontPropertyManagerPrivate::slotEnumChanged(QtProperty *property, int value) { if (m_settingValue) return; if (QtProperty *prop = m_familyToProperty.value(property, 0)) { QFont f = m_values[prop]; f.setFamily(m_familyNames.at(value)); q_ptr->setValue(prop, f); } } void QtFontPropertyManagerPrivate::slotBoolChanged(QtProperty *property, bool value) { if (m_settingValue) return; if (QtProperty *prop = m_boldToProperty.value(property, 0)) { QFont f = m_values[prop]; f.setBold(value); q_ptr->setValue(prop, f); } else if (QtProperty *prop = m_italicToProperty.value(property, 0)) { QFont f = m_values[prop]; f.setItalic(value); q_ptr->setValue(prop, f); } else if (QtProperty *prop = m_underlineToProperty.value(property, 0)) { QFont f = m_values[prop]; f.setUnderline(value); q_ptr->setValue(prop, f); } else if (QtProperty *prop = m_strikeOutToProperty.value(property, 0)) { QFont f = m_values[prop]; f.setStrikeOut(value); q_ptr->setValue(prop, f); } else if (QtProperty *prop = m_kerningToProperty.value(property, 0)) { QFont f = m_values[prop]; f.setKerning(value); q_ptr->setValue(prop, f); } } void QtFontPropertyManagerPrivate::slotPropertyDestroyed(QtProperty *property) { if (QtProperty *pointProp = m_pointSizeToProperty.value(property, 0)) { m_propertyToPointSize[pointProp] = 0; m_pointSizeToProperty.remove(property); } else if (QtProperty *pointProp = m_familyToProperty.value(property, 0)) { m_propertyToFamily[pointProp] = 0; m_familyToProperty.remove(property); } else if (QtProperty *pointProp = m_boldToProperty.value(property, 0)) { m_propertyToBold[pointProp] = 0; m_boldToProperty.remove(property); } else if (QtProperty *pointProp = m_italicToProperty.value(property, 0)) { m_propertyToItalic[pointProp] = 0; m_italicToProperty.remove(property); } else if (QtProperty *pointProp = m_underlineToProperty.value(property, 0)) { m_propertyToUnderline[pointProp] = 0; m_underlineToProperty.remove(property); } else if (QtProperty *pointProp = m_strikeOutToProperty.value(property, 0)) { m_propertyToStrikeOut[pointProp] = 0; m_strikeOutToProperty.remove(property); } else if (QtProperty *pointProp = m_kerningToProperty.value(property, 0)) { m_propertyToKerning[pointProp] = 0; m_kerningToProperty.remove(property); } } void QtFontPropertyManagerPrivate::slotFontDatabaseChanged() { if (!m_fontDatabaseChangeTimer) { m_fontDatabaseChangeTimer = new QTimer(q_ptr); m_fontDatabaseChangeTimer->setInterval(0); m_fontDatabaseChangeTimer->setSingleShot(true); QObject::connect(m_fontDatabaseChangeTimer, SIGNAL(timeout()), q_ptr, SLOT(slotFontDatabaseDelayedChange())); } if (!m_fontDatabaseChangeTimer->isActive()) m_fontDatabaseChangeTimer->start(); } void QtFontPropertyManagerPrivate::slotFontDatabaseDelayedChange() { typedef QMap<const QtProperty *, QtProperty *> PropertyPropertyMap; // rescan available font names const QStringList oldFamilies = m_familyNames; m_familyNames = fontDatabase()->families(); // Adapt all existing properties if (!m_propertyToFamily.empty()) { PropertyPropertyMap::const_iterator cend = m_propertyToFamily.constEnd(); for (PropertyPropertyMap::const_iterator it = m_propertyToFamily.constBegin(); it != cend; ++it) { QtProperty *familyProp = it.value(); const int oldIdx = m_enumPropertyManager->value(familyProp); int newIdx = m_familyNames.indexOf(oldFamilies.at(oldIdx)); if (newIdx < 0) newIdx = 0; m_enumPropertyManager->setEnumNames(familyProp, m_familyNames); m_enumPropertyManager->setValue(familyProp, newIdx); } } } /*! \class QtFontPropertyManager \brief The QtFontPropertyManager provides and manages QFont properties. A font property has nested \e family, \e pointSize, \e bold, \e italic, \e underline, \e strikeOut and \e kerning subproperties. The top-level property's value can be retrieved using the value() function, and set using the setValue() slot. The subproperties are created by QtIntPropertyManager, QtEnumPropertyManager and QtBoolPropertyManager objects. These managers can be retrieved using the corresponding subIntPropertyManager(), subEnumPropertyManager() and subBoolPropertyManager() functions. In order to provide editing widgets for the subproperties in a property browser widget, these managers must be associated with editor factories. In addition, QtFontPropertyManager provides the valueChanged() signal which is Q_EMITted whenever a property created by this manager changes. \sa QtAbstractPropertyManager, QtEnumPropertyManager, QtIntPropertyManager, QtBoolPropertyManager */ /*! \fn void QtFontPropertyManager::valueChanged(QtProperty *property, const QFont &value) This signal is Q_EMITted whenever a property created by this manager changes its value, passing a pointer to the \a property and the new \a value as parameters. \sa setValue() */ /*! Creates a manager with the given \a parent. */ QtFontPropertyManager::QtFontPropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { d_ptr = new QtFontPropertyManagerPrivate; d_ptr->q_ptr = this; #if QT_VERSION >= 0x040500 QObject::connect(qApp, SIGNAL(fontDatabaseChanged()), this, SLOT(slotFontDatabaseChanged())); #endif d_ptr->m_intPropertyManager = new QtIntPropertyManager(this); connect(d_ptr->m_intPropertyManager, SIGNAL(valueChanged(QtProperty *, int)), this, SLOT(slotIntChanged(QtProperty *, int))); d_ptr->m_enumPropertyManager = new QtEnumPropertyManager(this); connect(d_ptr->m_enumPropertyManager, SIGNAL(valueChanged(QtProperty *, int)), this, SLOT(slotEnumChanged(QtProperty *, int))); d_ptr->m_boolPropertyManager = new QtBoolPropertyManager(this); connect(d_ptr->m_boolPropertyManager, SIGNAL(valueChanged(QtProperty *, bool)), this, SLOT(slotBoolChanged(QtProperty *, bool))); connect(d_ptr->m_intPropertyManager, SIGNAL(propertyDestroyed(QtProperty *)), this, SLOT(slotPropertyDestroyed(QtProperty *))); connect(d_ptr->m_enumPropertyManager, SIGNAL(propertyDestroyed(QtProperty *)), this, SLOT(slotPropertyDestroyed(QtProperty *))); connect(d_ptr->m_boolPropertyManager, SIGNAL(propertyDestroyed(QtProperty *)), this, SLOT(slotPropertyDestroyed(QtProperty *))); } /*! Destroys this manager, and all the properties it has created. */ QtFontPropertyManager::~QtFontPropertyManager() { clear(); delete d_ptr; } /*! Returns the manager that creates the \e pointSize subproperty. In order to provide editing widgets for the \e pointSize property in a property browser widget, this manager must be associated with an editor factory. \sa QtAbstractPropertyBrowser::setFactoryForManager() */ QtIntPropertyManager *QtFontPropertyManager::subIntPropertyManager() const { return d_ptr->m_intPropertyManager; } /*! Returns the manager that create the \e family subproperty. In order to provide editing widgets for the \e family property in a property browser widget, this manager must be associated with an editor factory. \sa QtAbstractPropertyBrowser::setFactoryForManager() */ QtEnumPropertyManager *QtFontPropertyManager::subEnumPropertyManager() const { return d_ptr->m_enumPropertyManager; } /*! Returns the manager that creates the \e bold, \e italic, \e underline, \e strikeOut and \e kerning subproperties. In order to provide editing widgets for the mentioned properties in a property browser widget, this manager must be associated with an editor factory. \sa QtAbstractPropertyBrowser::setFactoryForManager() */ QtBoolPropertyManager *QtFontPropertyManager::subBoolPropertyManager() const { return d_ptr->m_boolPropertyManager; } /*! Returns the given \a property's value. If the given property is not managed by this manager, this function returns a font object that uses the application's default font. \sa setValue() */ QFont QtFontPropertyManager::value(const QtProperty *property) const { return d_ptr->m_values.value(property, QFont()); } /*! \reimp */ QString QtFontPropertyManager::valueText(const QtProperty *property) const { const QtFontPropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); return QtPropertyBrowserUtils::fontValueText(it.value()); } /*! \reimp */ QIcon QtFontPropertyManager::valueIcon(const QtProperty *property) const { const QtFontPropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QIcon(); return QtPropertyBrowserUtils::fontValueIcon(it.value()); } /*! \fn void QtFontPropertyManager::setValue(QtProperty *property, const QFont &value) Sets the value of the given \a property to \a value. Nested properties are updated automatically. \sa value(), valueChanged() */ void QtFontPropertyManager::setValue(QtProperty *property, const QFont &val) { const QtFontPropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; const QFont oldVal = it.value(); if (oldVal == val && oldVal.resolve() == val.resolve()) return; it.value() = val; int idx = d_ptr->m_familyNames.indexOf(val.family()); if (idx == -1) idx = 0; bool settingValue = d_ptr->m_settingValue; d_ptr->m_settingValue = true; d_ptr->m_enumPropertyManager->setValue(d_ptr->m_propertyToFamily[property], idx); d_ptr->m_intPropertyManager->setValue(d_ptr->m_propertyToPointSize[property], val.pointSize()); d_ptr->m_boolPropertyManager->setValue(d_ptr->m_propertyToBold[property], val.bold()); d_ptr->m_boolPropertyManager->setValue(d_ptr->m_propertyToItalic[property], val.italic()); d_ptr->m_boolPropertyManager->setValue(d_ptr->m_propertyToUnderline[property], val.underline()); d_ptr->m_boolPropertyManager->setValue(d_ptr->m_propertyToStrikeOut[property], val.strikeOut()); d_ptr->m_boolPropertyManager->setValue(d_ptr->m_propertyToKerning[property], val.kerning()); d_ptr->m_settingValue = settingValue; Q_EMIT propertyChanged(property); Q_EMIT valueChanged(property, val); } /*! \reimp */ void QtFontPropertyManager::initializeProperty(QtProperty *property) { QFont val; d_ptr->m_values[property] = val; QtProperty *familyProp = d_ptr->m_enumPropertyManager->addProperty(); familyProp->setPropertyName(tr("Family")); if (d_ptr->m_familyNames.empty()) d_ptr->m_familyNames = fontDatabase()->families(); d_ptr->m_enumPropertyManager->setEnumNames(familyProp, d_ptr->m_familyNames); int idx = d_ptr->m_familyNames.indexOf(val.family()); if (idx == -1) idx = 0; d_ptr->m_enumPropertyManager->setValue(familyProp, idx); d_ptr->m_propertyToFamily[property] = familyProp; d_ptr->m_familyToProperty[familyProp] = property; property->addSubProperty(familyProp); QtProperty *pointSizeProp = d_ptr->m_intPropertyManager->addProperty(); pointSizeProp->setPropertyName(tr("Point Size")); d_ptr->m_intPropertyManager->setValue(pointSizeProp, val.pointSize()); d_ptr->m_intPropertyManager->setMinimum(pointSizeProp, 1); d_ptr->m_propertyToPointSize[property] = pointSizeProp; d_ptr->m_pointSizeToProperty[pointSizeProp] = property; property->addSubProperty(pointSizeProp); QtProperty *boldProp = d_ptr->m_boolPropertyManager->addProperty(); boldProp->setPropertyName(tr("Bold")); d_ptr->m_boolPropertyManager->setValue(boldProp, val.bold()); d_ptr->m_propertyToBold[property] = boldProp; d_ptr->m_boldToProperty[boldProp] = property; property->addSubProperty(boldProp); QtProperty *italicProp = d_ptr->m_boolPropertyManager->addProperty(); italicProp->setPropertyName(tr("Italic")); d_ptr->m_boolPropertyManager->setValue(italicProp, val.italic()); d_ptr->m_propertyToItalic[property] = italicProp; d_ptr->m_italicToProperty[italicProp] = property; property->addSubProperty(italicProp); QtProperty *underlineProp = d_ptr->m_boolPropertyManager->addProperty(); underlineProp->setPropertyName(tr("Underline")); d_ptr->m_boolPropertyManager->setValue(underlineProp, val.underline()); d_ptr->m_propertyToUnderline[property] = underlineProp; d_ptr->m_underlineToProperty[underlineProp] = property; property->addSubProperty(underlineProp); QtProperty *strikeOutProp = d_ptr->m_boolPropertyManager->addProperty(); strikeOutProp->setPropertyName(tr("Strikeout")); d_ptr->m_boolPropertyManager->setValue(strikeOutProp, val.strikeOut()); d_ptr->m_propertyToStrikeOut[property] = strikeOutProp; d_ptr->m_strikeOutToProperty[strikeOutProp] = property; property->addSubProperty(strikeOutProp); QtProperty *kerningProp = d_ptr->m_boolPropertyManager->addProperty(); kerningProp->setPropertyName(tr("Kerning")); d_ptr->m_boolPropertyManager->setValue(kerningProp, val.kerning()); d_ptr->m_propertyToKerning[property] = kerningProp; d_ptr->m_kerningToProperty[kerningProp] = property; property->addSubProperty(kerningProp); } /*! \reimp */ void QtFontPropertyManager::uninitializeProperty(QtProperty *property) { QtProperty *familyProp = d_ptr->m_propertyToFamily[property]; if (familyProp) { d_ptr->m_familyToProperty.remove(familyProp); delete familyProp; } d_ptr->m_propertyToFamily.remove(property); QtProperty *pointSizeProp = d_ptr->m_propertyToPointSize[property]; if (pointSizeProp) { d_ptr->m_pointSizeToProperty.remove(pointSizeProp); delete pointSizeProp; } d_ptr->m_propertyToPointSize.remove(property); QtProperty *boldProp = d_ptr->m_propertyToBold[property]; if (boldProp) { d_ptr->m_boldToProperty.remove(boldProp); delete boldProp; } d_ptr->m_propertyToBold.remove(property); QtProperty *italicProp = d_ptr->m_propertyToItalic[property]; if (italicProp) { d_ptr->m_italicToProperty.remove(italicProp); delete italicProp; } d_ptr->m_propertyToItalic.remove(property); QtProperty *underlineProp = d_ptr->m_propertyToUnderline[property]; if (underlineProp) { d_ptr->m_underlineToProperty.remove(underlineProp); delete underlineProp; } d_ptr->m_propertyToUnderline.remove(property); QtProperty *strikeOutProp = d_ptr->m_propertyToStrikeOut[property]; if (strikeOutProp) { d_ptr->m_strikeOutToProperty.remove(strikeOutProp); delete strikeOutProp; } d_ptr->m_propertyToStrikeOut.remove(property); QtProperty *kerningProp = d_ptr->m_propertyToKerning[property]; if (kerningProp) { d_ptr->m_kerningToProperty.remove(kerningProp); delete kerningProp; } d_ptr->m_propertyToKerning.remove(property); d_ptr->m_values.remove(property); } // QtColorPropertyManager class QtColorPropertyManagerPrivate { QtColorPropertyManager *q_ptr; Q_DECLARE_PUBLIC(QtColorPropertyManager) public: void slotIntChanged(QtProperty *property, int value); void slotPropertyDestroyed(QtProperty *property); typedef QMap<const QtProperty *, QColor> PropertyValueMap; PropertyValueMap m_values; QtIntPropertyManager *m_intPropertyManager; QMap<const QtProperty *, QtProperty *> m_propertyToR; QMap<const QtProperty *, QtProperty *> m_propertyToG; QMap<const QtProperty *, QtProperty *> m_propertyToB; QMap<const QtProperty *, QtProperty *> m_propertyToA; QMap<const QtProperty *, QtProperty *> m_rToProperty; QMap<const QtProperty *, QtProperty *> m_gToProperty; QMap<const QtProperty *, QtProperty *> m_bToProperty; QMap<const QtProperty *, QtProperty *> m_aToProperty; }; void QtColorPropertyManagerPrivate::slotIntChanged(QtProperty *property, int value) { if (QtProperty *prop = m_rToProperty.value(property, 0)) { QColor c = m_values[prop]; c.setRed(value); q_ptr->setValue(prop, c); } else if (QtProperty *prop = m_gToProperty.value(property, 0)) { QColor c = m_values[prop]; c.setGreen(value); q_ptr->setValue(prop, c); } else if (QtProperty *prop = m_bToProperty.value(property, 0)) { QColor c = m_values[prop]; c.setBlue(value); q_ptr->setValue(prop, c); } else if (QtProperty *prop = m_aToProperty.value(property, 0)) { QColor c = m_values[prop]; c.setAlpha(value); q_ptr->setValue(prop, c); } } void QtColorPropertyManagerPrivate::slotPropertyDestroyed(QtProperty *property) { if (QtProperty *pointProp = m_rToProperty.value(property, 0)) { m_propertyToR[pointProp] = 0; m_rToProperty.remove(property); } else if (QtProperty *pointProp = m_gToProperty.value(property, 0)) { m_propertyToG[pointProp] = 0; m_gToProperty.remove(property); } else if (QtProperty *pointProp = m_bToProperty.value(property, 0)) { m_propertyToB[pointProp] = 0; m_bToProperty.remove(property); } else if (QtProperty *pointProp = m_aToProperty.value(property, 0)) { m_propertyToA[pointProp] = 0; m_aToProperty.remove(property); } } /*! \class QtColorPropertyManager \brief The QtColorPropertyManager provides and manages QColor properties. A color property has nested \e red, \e green and \e blue subproperties. The top-level property's value can be retrieved using the value() function, and set using the setValue() slot. The subproperties are created by a QtIntPropertyManager object. This manager can be retrieved using the subIntPropertyManager() function. In order to provide editing widgets for the subproperties in a property browser widget, this manager must be associated with an editor factory. In addition, QtColorPropertyManager provides the valueChanged() signal which is Q_EMITted whenever a property created by this manager changes. \sa QtAbstractPropertyManager, QtAbstractPropertyBrowser, QtIntPropertyManager */ /*! \fn void QtColorPropertyManager::valueChanged(QtProperty *property, const QColor &value) This signal is Q_EMITted whenever a property created by this manager changes its value, passing a pointer to the \a property and the new \a value as parameters. \sa setValue() */ /*! Creates a manager with the given \a parent. */ QtColorPropertyManager::QtColorPropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { d_ptr = new QtColorPropertyManagerPrivate; d_ptr->q_ptr = this; d_ptr->m_intPropertyManager = new QtIntPropertyManager(this); connect(d_ptr->m_intPropertyManager, SIGNAL(valueChanged(QtProperty *, int)), this, SLOT(slotIntChanged(QtProperty *, int))); connect(d_ptr->m_intPropertyManager, SIGNAL(propertyDestroyed(QtProperty *)), this, SLOT(slotPropertyDestroyed(QtProperty *))); } /*! Destroys this manager, and all the properties it has created. */ QtColorPropertyManager::~QtColorPropertyManager() { clear(); delete d_ptr; } /*! Returns the manager that produces the nested \e red, \e green and \e blue subproperties. In order to provide editing widgets for the subproperties in a property browser widget, this manager must be associated with an editor factory. \sa QtAbstractPropertyBrowser::setFactoryForManager() */ QtIntPropertyManager *QtColorPropertyManager::subIntPropertyManager() const { return d_ptr->m_intPropertyManager; } /*! Returns the given \a property's value. If the given \a property is not managed by \e this manager, this function returns an invalid color. \sa setValue() */ QColor QtColorPropertyManager::value(const QtProperty *property) const { return d_ptr->m_values.value(property, QColor()); } /*! \reimp */ QString QtColorPropertyManager::valueText(const QtProperty *property) const { const QtColorPropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); return QtPropertyBrowserUtils::colorValueText(it.value()); } /*! \reimp */ QIcon QtColorPropertyManager::valueIcon(const QtProperty *property) const { const QtColorPropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QIcon(); return QtPropertyBrowserUtils::brushValueIcon(QBrush(it.value())); } /*! \fn void QtColorPropertyManager::setValue(QtProperty *property, const QColor &value) Sets the value of the given \a property to \a value. Nested properties are updated automatically. \sa value(), valueChanged() */ void QtColorPropertyManager::setValue(QtProperty *property, const QColor &val) { const QtColorPropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; if (it.value() == val) return; it.value() = val; d_ptr->m_intPropertyManager->setValue(d_ptr->m_propertyToR[property], val.red()); d_ptr->m_intPropertyManager->setValue(d_ptr->m_propertyToG[property], val.green()); d_ptr->m_intPropertyManager->setValue(d_ptr->m_propertyToB[property], val.blue()); d_ptr->m_intPropertyManager->setValue(d_ptr->m_propertyToA[property], val.alpha()); Q_EMIT propertyChanged(property); Q_EMIT valueChanged(property, val); } /*! \reimp */ void QtColorPropertyManager::initializeProperty(QtProperty *property) { QColor val; d_ptr->m_values[property] = val; QtProperty *rProp = d_ptr->m_intPropertyManager->addProperty(); rProp->setPropertyName(tr("Red")); d_ptr->m_intPropertyManager->setValue(rProp, val.red()); d_ptr->m_intPropertyManager->setRange(rProp, 0, 0xFF); d_ptr->m_propertyToR[property] = rProp; d_ptr->m_rToProperty[rProp] = property; property->addSubProperty(rProp); QtProperty *gProp = d_ptr->m_intPropertyManager->addProperty(); gProp->setPropertyName(tr("Green")); d_ptr->m_intPropertyManager->setValue(gProp, val.green()); d_ptr->m_intPropertyManager->setRange(gProp, 0, 0xFF); d_ptr->m_propertyToG[property] = gProp; d_ptr->m_gToProperty[gProp] = property; property->addSubProperty(gProp); QtProperty *bProp = d_ptr->m_intPropertyManager->addProperty(); bProp->setPropertyName(tr("Blue")); d_ptr->m_intPropertyManager->setValue(bProp, val.blue()); d_ptr->m_intPropertyManager->setRange(bProp, 0, 0xFF); d_ptr->m_propertyToB[property] = bProp; d_ptr->m_bToProperty[bProp] = property; property->addSubProperty(bProp); QtProperty *aProp = d_ptr->m_intPropertyManager->addProperty(); aProp->setPropertyName(tr("Alpha")); d_ptr->m_intPropertyManager->setValue(aProp, val.alpha()); d_ptr->m_intPropertyManager->setRange(aProp, 0, 0xFF); d_ptr->m_propertyToA[property] = aProp; d_ptr->m_aToProperty[aProp] = property; property->addSubProperty(aProp); } /*! \reimp */ void QtColorPropertyManager::uninitializeProperty(QtProperty *property) { QtProperty *rProp = d_ptr->m_propertyToR[property]; if (rProp) { d_ptr->m_rToProperty.remove(rProp); delete rProp; } d_ptr->m_propertyToR.remove(property); QtProperty *gProp = d_ptr->m_propertyToG[property]; if (gProp) { d_ptr->m_gToProperty.remove(gProp); delete gProp; } d_ptr->m_propertyToG.remove(property); QtProperty *bProp = d_ptr->m_propertyToB[property]; if (bProp) { d_ptr->m_bToProperty.remove(bProp); delete bProp; } d_ptr->m_propertyToB.remove(property); QtProperty *aProp = d_ptr->m_propertyToA[property]; if (aProp) { d_ptr->m_aToProperty.remove(aProp); delete aProp; } d_ptr->m_propertyToA.remove(property); d_ptr->m_values.remove(property); } // QtCursorPropertyManager // Make sure icons are removed as soon as QApplication is destroyed, otherwise, // handles are leaked on X11. static void clearCursorDatabase(); namespace { struct CursorDatabase : public QtCursorDatabase { CursorDatabase() { qAddPostRoutine(clearCursorDatabase); } }; } Q_GLOBAL_STATIC(QtCursorDatabase, cursorDatabase) static void clearCursorDatabase() { cursorDatabase()->clear(); } class QtCursorPropertyManagerPrivate { QtCursorPropertyManager *q_ptr; Q_DECLARE_PUBLIC(QtCursorPropertyManager) public: typedef QMap<const QtProperty *, QCursor> PropertyValueMap; PropertyValueMap m_values; }; /*! \class QtCursorPropertyManager \brief The QtCursorPropertyManager provides and manages QCursor properties. A cursor property has a current value which can be retrieved using the value() function, and set using the setValue() slot. In addition, QtCursorPropertyManager provides the valueChanged() signal which is Q_EMITted whenever a property created by this manager changes. \sa QtAbstractPropertyManager */ /*! \fn void QtCursorPropertyManager::valueChanged(QtProperty *property, const QCursor &value) This signal is Q_EMITted whenever a property created by this manager changes its value, passing a pointer to the \a property and the new \a value as parameters. \sa setValue() */ /*! Creates a manager with the given \a parent. */ QtCursorPropertyManager::QtCursorPropertyManager(QObject *parent) : QtAbstractPropertyManager(parent) { d_ptr = new QtCursorPropertyManagerPrivate; d_ptr->q_ptr = this; } /*! Destroys this manager, and all the properties it has created. */ QtCursorPropertyManager::~QtCursorPropertyManager() { clear(); delete d_ptr; } /*! Returns the given \a property's value. If the given \a property is not managed by this manager, this function returns a default QCursor object. \sa setValue() */ #ifndef QT_NO_CURSOR QCursor QtCursorPropertyManager::value(const QtProperty *property) const { return d_ptr->m_values.value(property, QCursor()); } #endif /*! \reimp */ QString QtCursorPropertyManager::valueText(const QtProperty *property) const { const QtCursorPropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QString(); return cursorDatabase()->cursorToShapeName(it.value()); } /*! \reimp */ QIcon QtCursorPropertyManager::valueIcon(const QtProperty *property) const { const QtCursorPropertyManagerPrivate::PropertyValueMap::const_iterator it = d_ptr->m_values.constFind(property); if (it == d_ptr->m_values.constEnd()) return QIcon(); return cursorDatabase()->cursorToShapeIcon(it.value()); } /*! \fn void QtCursorPropertyManager::setValue(QtProperty *property, const QCursor &value) Sets the value of the given \a property to \a value. \sa value(), valueChanged() */ void QtCursorPropertyManager::setValue(QtProperty *property, const QCursor &value) { #ifndef QT_NO_CURSOR const QtCursorPropertyManagerPrivate::PropertyValueMap::iterator it = d_ptr->m_values.find(property); if (it == d_ptr->m_values.end()) return; if (it.value().shape() == value.shape() && value.shape() != Qt::BitmapCursor) return; it.value() = value; Q_EMIT propertyChanged(property); Q_EMIT valueChanged(property, value); #endif } /*! \reimp */ void QtCursorPropertyManager::initializeProperty(QtProperty *property) { #ifndef QT_NO_CURSOR d_ptr->m_values[property] = QCursor(); #endif } /*! \reimp */ void QtCursorPropertyManager::uninitializeProperty(QtProperty *property) { d_ptr->m_values.remove(property); } #if QT_VERSION >= 0x040400 QT_END_NAMESPACE #endif #include "moc_qtpropertymanager.cpp" #include "qtpropertymanager.moc"

[ "Mahisorn@localhost" ]

Mahisorn@localhost

226c75a44c5a49dc14340cbf70e94d422482701d

c5e26167d000f9d52db0a1491c7995d0714f8714

/洛谷/P1516 青蛙的约会.cpp

336bbd09ace01140e115372875e03a73d2a7fed7

[]

no_license

memset0/OI-Code

48d0970685a62912409d75e1183080ec0c243e21

237e66d21520651a87764c385345e250f73b245c

refs/heads/master

2020-03-24T21:23:04.692539

2019-01-05T12:38:28

143,029,281

18

1

null

UTF-8

C++

false

1,240

cpp

#include <bits/stdc++.h> #define il inline #define rg register #define ll long long #define getc getchar #define putc putchar #define rep(i, l, r) for (int i = l; i <= r; ++i) namespace ringo { template < class T > il void read(T &x) { x = 0; rg char c = getc(); rg bool f = 0; while (!isdigit(c)) f ^= c == '-', c = getc(); while (isdigit(c)) x = x * 10 + c - '0', c = getc(); if (f) x = -x; } template < class T > il void print(T x) { if (x < 0) putc('-'), x = -x; if (x > 9) print(x / 10); putc('0' + x % 10); } ll x, y, m, n, l, a, b, c, d, ans; ll gcd(ll a, ll b) { return !b ? a : gcd(b, a % b); } void exgcd(ll a, ll b, ll &x, ll &y) { if (!b) return (void)(x = 1, y = 0); exgcd(b, a % b, x, y); ll tmp = y; y = x - (a / b) * y; x = tmp; } void main() { // freopen("1.in", "r", stdin); // freopen("1.out", "w", stdout); read(x), read(y), read(m), read(n), read(l); a = m - n, b = -l, c = y - x, d = gcd(a, b); // printf("%lld %lld %lld %lld\n", a, b, c, d); if (c % d) puts("Impossible"); else { exgcd(a, b, x, y); ans = x * (c / d); l = abs(l / d); ans = (ans % l + l) % l; // printf("%lld %lld %lld %lld\n", x, y, ans, l); print(ans), putc('\n'); } } } int main() { return ringo::main(), 0; }

[ "memset0@outlook.com" ]

memset0@outlook.com

bc9509c7fe7dd9a1d5b736cabd79f4771d8baf73

9b4e0a5a649d2482a5e266d9fc2ef01f17bda671

/src/Eigen.d/Elu.c++

1d73d61ecffd8364b6abdf7740c43aa311b39709

[ "MIT" ]

permissive

naruto2/CodeFEM

7209d241c150003e3369fa47e09b05937b6bc2a5

eb689aa7573d4ac9fc83d057f99c79a5d8f3bd90

refs/heads/master

2020-12-12T03:17:42.445395

2018-06-20T16:31:42

48,607,270

1

0

null

UTF-8

C++

false

1,317

#include <stdio.h> #include "est/sparse.hpp" #include "est/psc98.hpp" #include "est/op.hpp" #include "est/TDMA.hpp" #include "solvers.h" vector<double> jacobi(sparse::matrix<double>&A, vector<double>&x,vector<double>&b); int enough(sparse::matrix<double>&A, vector<double>&x, const vector<double>&b); vector<double> Elu(sparse::matrix<double>&A, vector<double>&b) { int diag = 1; for ( int k=1, n=A.size(); k<n; k++) if (A[k][k] == 0.0) { diag = 0; break; } if ( diag && isTridiagonal(A) ) return TDMA(A,b); if ( A.size() > 16000 ) { fprintf(stderr,"Warning: Elu() can't solve n < 16000 matrix\n"); vector<double> x(A.size()); for(int k=0;k<A.size();k++) x[k] = b[k]; return x; } for ( int i=1; i<A.size(); i++) for ( auto it: A[i]) { int j = it.first; Tri(i,j,A[i][j]); } Tri(0,0,1.0); b[0] = 0.0; Smatrix Aa = MapSmatrix(A.size(),A.size()); Vector bb(A.size()); for(int k=0;k<A.size();k++) bb[k] = b[k]; Vector xx = Elu(Aa,bb); vector<double> x(A.size()); for(int k=0;k<A.size();k++) x[k] = xx[k]; if(!enough(A,x,b)) jacobi(A,x,b); return x; } #if 0 int main(int argc, char **argv){ initop(argc,argv); sparse::matrix<double> A; vector<double> x,b; psc98_init(A,b); x = Elu(A,b); psc98_check(x); return 0; } #endif

[ "tsukuda.yoshio@gmail.com" ]

tsukuda.yoshio@gmail.com

9be832673bf969e46355e6315d256bee4de69591

fef58dcd0c1434724a0a0a82e4c84ae906200289

/usages/0x75DBEC174AEEAD10.cpp

147fe08ae6bd5f347dcd14b6f0197013f44d9922

[]

no_license

DottieDot/gta5-additional-nativedb-data

a8945d29a60c04dc202f180e947cbdb3e0842ace

aea92b8b66833f063f391cb86cbcf4d58e1d7da3

refs/heads/main

2023-06-14T08:09:24.230253

2021-07-11T20:43:48

380,364,689

1

0

null

UTF-8

C++

false

416

cpp

// ambient_diving.ysc @ L2165 void func_59() { func_61(); if (func_50(iLocal_64)) { if (VEHICLE::IS_THIS_MODEL_A_BOAT(ENTITY::GET_ENTITY_MODEL(iLocal_64))) { VEHICLE::SET_BOAT_ANCHOR(iLocal_64, false); } ENTITY::SET_ENTITY_RECORDS_COLLISIONS(iLocal_64, 0); if (ENTITY::IS_ENTITY_A_MISSION_ENTITY(iLocal_64)) { ENTITY::SET_VEHICLE_AS_NO_LONGER_NEEDED(&iLocal_64); } } }

[ "tvangroenigen@outlook.com" ]

tvangroenigen@outlook.com

f918a2dddea6e96b05f16143cd0afeaa96a1c0e3

e94faed4698eba0859637076840147f417ee5953

/Master/Fail/KeyBoardTest.ino

14b3447bc73ef19e2254a0bbec7ebeb5e547d5e6

[]

no_license

maisonsmd/MatrixKeysToLEDs_VS_Solutions

8f4827082c3c958babf336287307d0a5eed07b5a

5ebd1981a0d016bf6e5673c35487423651ca2198

refs/heads/master

2021-09-03T04:11:15.518826

2018-01-05T13:35:30

null

0

null

UTF-8

C++

false

966

ino

//#include "Libs/MatrixKeyToLEDs.h" //#include "Libs/MS_Communication.h" //#include <Wire.h> void setup() { Serial.begin(9600); pinMode(13, OUTPUT); for (int i = 0; i < 1000; i++) Serial.println("HELLO"); delay(100); //MatrixKeyToLEDs.init(); //MatrixKeyToLEDs.SetLEDsIntensity(1); //Intensity (brightness): 0->15 //MatrixKeyToLEDs.SetToneStyle(1244, 50); //frequency, duration //MatrixKeyToLEDs.SetBuzzerType(SUPPLY_VOLTAGE); //SUPPLY_VOLTAGE(default)/SUPPLY_FREQ //MatrixKeyToLEDs.SetBuzzerActiveLogicLevel(HIGH); //HIGH(default)/LOW // //Dat kieu nhan cho tat ca phim //MatrixKeyToLEDs.SetKeysToggleStyle(CLICK_TOGGLE); //CLICK_TOGGLE(default)/PRESS_AND_HOLD //MatrixKeyToLEDs.SetReactMoment(ON_CLICK); //ON_CLICK(default)/ON_RELEASE //MatrixKeyToLEDs.SetTempOutput(10, 1, 100, 250); // Output, button, Time_On, Time_Off //Wire.begin(); //MS.init(); } void loop() { //MatrixKeyToLEDs.Execute(); //MS.Execute(); }

[ "maisonsmd@gmail.com" ]

maisonsmd@gmail.com

cf2c500ea4a8e668870223656a8b3062137c555e

8c5054be017ac21e1aedfa433ab6c910206fe6aa

/Vault/DSA_NMS_18/HomePractice3/F.cpp

c61afd227363441e3f999b5d26edb9d4d16deb72

[]

no_license

liv1n9/AkikazeCP

a3348a37d4151c0579f23ea21a1f0f84bb4f8862

9db7ee0398eaebfeb0efc4a2bfddffed9f43b8f9

refs/heads/master

2020-08-12T16:05:15.884390

2019-10-13T08:52:12

null

0

null

UTF-8

C++

false

2,415

cpp

/** Template by Akikaze (秋風) - formerly proptit_4t41. Code written by a random fan of momocashew and Chiho. H△G x Mili - November 27th, 2013 Mag Mell (Mili) - Sep 17th, 2014 H△G x Mili Vol.2 - May 9th, 2015 Miracle Milk (Mili) - Oct 12th, 2016 青色フィルム (H△G) - February 14th, 2018 Millennium Mother (Mili) - April 25th, 2018 **/ /** -----PRAGMA----- **/ #pragma comment(linker, "/stack:200000000") #pragma GCC optimize("Ofast") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #include <bits/stdc++.h> using namespace std; /** -----BASIC MACROES----- **/ #define endl '\n' #define i64 long long #define ld long double #define pub push_back #define mp make_pair #define fi first #define se second const long long MOD = 1000000007LL, INF = 1e9, LINF = 1e18; const long double PI = 3.141592653589793116, EPS = 1e-9, GOLD = ((1+sqrt(5))/2); typedef vector<i64> vi; typedef vector<ld> vd; typedef vector<string> vs; typedef vector<bool> vb; typedef pair<i64, i64> pii; typedef pair<i64, pii> pip; typedef pair<pii, i64> ppi; /** -----BIT CONTROLS----- **/ template<class T> int getbit(T s, int i) { return (s >> 1) & 1; } template<class T> T onbit(T s, int i) { return s | (T(1) << i); } template<class T> T offbit(T s, int i) { return s & (~(T(1) << i)); } template<class T> int cntbit(T s) { return __builtin_popcount(s); } /** -----IDEAS/ALGORITHMS----- -------------------------- **/ /** -----CUSTOM TYPEDEFS/DEFINES----- **/ /** -----GLOBAL VARIABLES----- **/ i64 N; /** -----EXTENSIVE FUNCTIONS----- **/ i64 modPow(i64 a, i64 b) { if (b == 0) return 1; if (b == 1) return a; i64 tmp = modPow(a, b/2); if (b % 2 == 0) return ((tmp * tmp) % MOD); return ((((tmp * tmp) % MOD) * a) % MOD); } /** -----COMPULSORY FUNCTIONS----- **/ void VarInput() { ios_base::sync_with_stdio(0); cin.tie(NULL); cin >> N; } void ProSolve() { cout << modPow(3, N-1); } /** -----MAIN FUNCTION----- **/ int main() { #ifdef Akikaze //freopen("FILE.INP", "r", stdin); //freopen("FILE.OUT", "w", stdout); #endif VarInput(); #ifdef Akikaze auto TIME1 = chrono::steady_clock::now(); #endif ProSolve(); #ifdef Akikaze auto TIME2 = chrono::steady_clock::now(); auto DIFF = TIME2 - TIME1; cout << "\n\nTime elapsed: " << fixed << setprecision(18) << chrono::duration<double>(DIFF).count() << " seconds."; #endif return 0; }

[ "duybach.224575@gmail.com" ]

duybach.224575@gmail.com

ba5b788c6f1978af7e5b7649b5c0abf144a5be07

90e64a6679a16401e762b447a0a1c6d7d5815815

/TSUI/CGalacticMapSystemDetails.cpp

839e5b275a004cbfa657d72a9246b30a926343f0

[ "LicenseRef-scancode-warranty-disclaimer" ]

no_license

kronosaur/Mammoth

a339f3860e01612c47fdbfc3aa1d657b5fd25a4b

a73df3f356201ecffd6590303d5cd52edd040a92

refs/heads/master

2021-04-19T00:26:33.936970

2019-01-08T01:11:51

28,847,176

5

14

NOASSERTION

2018-12-26T08:09:11

2015-01-06T04:47:28

C++

UTF-8

C++

false

15,422

cpp

// CGalacticMapSystemDetails.h // // CGalacticMapSystemDetails class // Copyright (c) 2016 by Kronosaur Productions, LLC. All Rights Reserved. #include "stdafx.h" #define ID_STATION_LIST CONSTLIT("idStationList") #define PROP_COLOR CONSTLIT("color") #define PROP_ENABLED CONSTLIT("enabled") #define PROP_FADE_EDGE_HEIGHT CONSTLIT("fadeEdgeHeight") #define PROP_FILL_TYPE CONSTLIT("fillType") #define PROP_FONT CONSTLIT("font") #define PROP_LINE_COLOR CONSTLIT("lineColor") #define PROP_LINE_PADDING CONSTLIT("linePadding") #define PROP_LINE_TYPE CONSTLIT("lineType") #define PROP_LINE_WIDTH CONSTLIT("lineWidth") #define PROP_LL_RADIUS CONSTLIT("llRadius") #define PROP_LR_RADIUS CONSTLIT("lrRadius") #define PROP_OPACITY CONSTLIT("opacity") #define PROP_PADDING_BOTTOM CONSTLIT("paddingBottom") #define PROP_POSITION CONSTLIT("position") #define PROP_SCALE CONSTLIT("scale") #define PROP_TEXT CONSTLIT("text") #define PROP_TEXT_ALIGN_HORZ CONSTLIT("textAlignHorz") #define PROP_UL_RADIUS CONSTLIT("ulRadius") #define PROP_UR_RADIUS CONSTLIT("urRadius") const int MAJOR_PADDING_TOP = 20; const int INTER_LINE_SPACING = 20; const int MAX_ICON_SIZE = 100; const int MIN_ICON_SIZE = 32; const Metric ICON_SCALE = 0.25; const int ICON_SPACING_HORZ = 16; const int LIST_PADDING_X = 20; const int HEADER_PADDING_X = 20; const int HEADER_PADDING_Y = 20; const int ATTRIB_SPACING_Y = 2; static const CG32bitPixel RGB_MODIFIER_NORMAL_BACKGROUND = CG32bitPixel(101,101,101); // H:0 S:0 B:40 static const CG32bitPixel RGB_MODIFIER_NORMAL_TEXT = CG32bitPixel(220,220,220); // H:0 S:0 B:86 CGalacticMapSystemDetails::CGalacticMapSystemDetails (const CVisualPalette &VI, CReanimator &Reanimator, const RECT &rcPane) : m_VI(VI), m_Reanimator(Reanimator), m_rcPane(rcPane) // CGalacticMapSystemDetails constructor { } bool CGalacticMapSystemDetails::CreateDetailsPane (CTopologyNode *pNode, IAnimatron **retpAni) // CreateDetailsPane // // Creates an animation showing the details for a given system. Returns FALSE // if we fail to create the pane. { int i; // Get the list of objects at this node TSortMap<CString, SObjDesc> Objs; GetObjList(pNode, Objs); // Create a sequencer which will be the root pane. CAniSequencer *pRoot = new CAniSequencer; pRoot->SetPropertyVector(PROP_POSITION, CVector(m_rcPane.left, m_rcPane.top)); // Create a background for the whole pane IAnimatron *pFrame; m_VI.CreateFrame(pRoot, NULL_STR, 0, 0, RectWidth(m_rcPane), RectHeight(m_rcPane), CVisualPalette::OPTION_FRAME_TRANS, &pFrame); IAnimatron *pHeaderBack; m_VI.CreateFrameHeader(pRoot, NULL_STR, 0, 0, 0, 0, 0, &pHeaderBack); // Add system information int cyHeader; CreateSystemHeader(pRoot, pNode, &cyHeader); // Now that we know the size of the text, resize pHeaderBack->SetPropertyVector(PROP_SCALE, CVector(RectWidth(m_rcPane) - 2, cyHeader - 1)); // Compute the size of the list area RECT rcList; rcList.top = cyHeader; rcList.bottom = rcList.top + RectHeight(m_rcPane) - cyHeader; rcList.left = LIST_PADDING_X; rcList.right = RectWidth(m_rcPane) - LIST_PADDING_X; // Create a listbox which will hold all stations in the system. if (Objs.GetCount() > 0 && pNode->IsKnown()) { CAniListBox *pList; m_VI.CreateListBox(pRoot, ID_STATION_LIST, rcList.left, rcList.top, RectWidth(rcList), RectHeight(rcList), 0, &pList); // Add all the stations in the node int y = MAJOR_PADDING_TOP; for (i = 0; i < Objs.GetCount(); i++) { // Generate a record for the object IAnimatron *pEntry; int cyHeight; CreateObjEntry(Objs[i], y, RectWidth(rcList), &pEntry, &cyHeight); pList->AddEntry(strFromInt(Objs[i].ObjData.dwObjID), pEntry); y += cyHeight + INTER_LINE_SPACING; } } // If no objects, then shrink the pane else { pFrame->SetPropertyVector(PROP_SCALE, CVector(RectWidth(m_rcPane), cyHeader + 1)); } // Done *retpAni = pRoot; return true; } void CGalacticMapSystemDetails::CreateObjEntry (const SObjDesc &Obj, int yPos, int cxWidth, IAnimatron **retpAni, int *retcyHeight) // CreateObjEntry // // Creates an entry for the station. { const CG16bitFont &HeaderFont = m_VI.GetFont(fontHeader); const CG16bitFont &TextFont = m_VI.GetFont(fontMedium); // Start with a sequencer CAniSequencer *pRoot = new CAniSequencer; pRoot->SetPropertyVector(PROP_POSITION, CVector(0, yPos)); int x = 0; int y = 0; // Create the icon for the object IAnimatron *pIconAni = NULL; CG32bitImage *pIcon = NULL; int xIcon = 0; if (CreateObjIcon(Obj.ObjData, &pIcon)) { xIcon = x + ((MAX_ICON_SIZE - pIcon->GetWidth()) / 2); pIconAni = new CAniRect; pIconAni->SetPropertyVector(PROP_SCALE, CVector(pIcon->GetWidth(), pIcon->GetHeight())); pIconAni->SetFillMethod(new CAniImageFill(pIcon, true)); pRoot->AddTrack(pIconAni, 0); } // Keep track of the total height of the text part so we can vertically // center it. int cyText = 0; // Add the object name CString sHeading = CLanguage::ComposeNounPhrase(Obj.ObjData.sName, Obj.iCount, NULL_STR, Obj.ObjData.dwNameFlags, nounCountOnly | nounTitleCapitalize); int xText = x + MAX_ICON_SIZE + ICON_SPACING_HORZ; int cxText = cxWidth - (MAX_ICON_SIZE + ICON_SPACING_HORZ); IAnimatron *pName = new CAniText; pName->SetPropertyVector(PROP_SCALE, CVector(10000, 1000)); pName->SetPropertyColor(PROP_COLOR, m_VI.GetColor(colorTextHighlight)); pName->SetPropertyFont(PROP_FONT, &HeaderFont); pName->SetPropertyString(PROP_TEXT, sHeading); pRoot->AddTrack(pName, 0); cyText += HeaderFont.GetHeight(); // Add attributes, if necessary IAnimatron *pAttribs = NULL; int cyAttribs = 0; if (Obj.Attribs.GetCount() > 0) { m_VI.CreateCartoucheArea(pRoot, NULL_STR, 0, 0, cxText, Obj.Attribs, TextFont, &pAttribs, &cyAttribs); cyText += cyAttribs + ATTRIB_SPACING_Y; } // Add description IAnimatron *pDesc = NULL; if (!Obj.ObjData.sNotes.IsBlank()) { pDesc = new CAniText; pDesc->SetPropertyVector(PROP_SCALE, CVector(cxText, 1000)); if (Obj.ObjData.fEnemy) pDesc->SetPropertyColor(PROP_COLOR, m_VI.GetColor(colorTextDisadvantage)); else pDesc->SetPropertyColor(PROP_COLOR, m_VI.GetColor(colorTextNormal)); pDesc->SetPropertyFont(PROP_FONT, &TextFont); pDesc->SetPropertyString(PROP_TEXT, Obj.ObjData.sNotes); RECT rcLine; pDesc->GetSpacingRect(&rcLine); pRoot->AddTrack(pDesc, 0); cyText += RectHeight(rcLine); } // Center the text int cyEntry = Max((pIcon ? pIcon->GetHeight() : 0), cyText); int yText = (cyEntry - cyText) / 2; pName->SetPropertyVector(PROP_POSITION, CVector(xText, yText)); yText += HeaderFont.GetHeight(); if (pAttribs) { pAttribs->SetPropertyVector(PROP_POSITION, CVector(xText, yText)); yText += cyAttribs + ATTRIB_SPACING_Y; } if (pDesc) pDesc->SetPropertyVector(PROP_POSITION, CVector(xText, yText)); // Center the icon if (pIconAni) { int yIcon = (cyEntry - pIcon->GetHeight()) / 2; pIconAni->SetPropertyVector(PROP_POSITION, CVector(xIcon, yIcon)); } // Done *retpAni = pRoot; if (retcyHeight) *retcyHeight = cyEntry; } bool CGalacticMapSystemDetails::CreateObjIcon (const CObjectTracker::SObjEntry &Obj, CG32bitImage **retpIcon) // CreateObjIcon // // Creates an icon for the object. Returns FALSE if we could not create the // icon. { CCompositeImageModifiers Modifiers; if (Obj.fShowDestroyed) Modifiers.SetStationDamage(true); int iVariant; const CObjectImageArray &FullImage = Obj.pType->GetTypeImage().GetImage(Obj.ImageSel, Modifiers, &iVariant); CG32bitImage *pBmpImage = (FullImage.IsLoaded() ? &FullImage.GetImage(CONSTLIT("Galactic map")) : NULL); RECT rcBmpImage = FullImage.GetImageRect(0, iVariant); if (pBmpImage == NULL) { CStationType *pStationType = CStationType::AsType(Obj.pType); if (pStationType == NULL) return false; // If we can't find the standard image, see if we have a hero image. const CObjectImageArray &HeroImage = pStationType->GetHeroImage(CCompositeImageSelector(), Modifiers, &iVariant); pBmpImage = (HeroImage.IsLoaded() ? &HeroImage.GetImage(CONSTLIT("Galactic map")) : NULL); if (pBmpImage == NULL) return false; rcBmpImage = HeroImage.GetImageRect(0, iVariant); } int iSize = Max(RectWidth(rcBmpImage), RectHeight(rcBmpImage)); if (iSize <= 0) return false; // Compute scale int iScaleSize = Max(MIN_ICON_SIZE, Min((int)(ICON_SCALE * iSize), MAX_ICON_SIZE)); Metric rScale = (Metric)iScaleSize / (Metric)iSize; // Create a small version CG32bitImage *pIcon = new CG32bitImage; if (!pIcon->CreateFromImageTransformed(*pBmpImage, rcBmpImage.left, rcBmpImage.top, RectWidth(rcBmpImage), RectHeight(rcBmpImage), rScale, rScale, 0.0)) { delete pIcon; return false; } // Done *retpIcon = pIcon; return true; } void CGalacticMapSystemDetails::CreateSystemHeader (CAniSequencer *pContainer, CTopologyNode *pTopology, int *retcyHeight) const // CreateSystemHeader // // Creates info about the system. { SSystemHeader Header; GetSystemHeaderData(pTopology, Header); const CG16bitFont &TitleFont = m_VI.GetFont(fontHeader); const CG16bitFont &DescFont = m_VI.GetFont(fontMedium); int x = HEADER_PADDING_X; int y = HEADER_PADDING_Y; int cxWidth = RectWidth(m_rcPane) - (2 * HEADER_PADDING_X); // System name int cyText; m_VI.CreateTextArea(pContainer, NULL_STR, x, y, cxWidth, 1000, Header.sTitle, m_VI.GetColor(colorTextHighlight), TitleFont, NULL, &cyText); y += cyText; // Attributes if (Header.Attribs.GetCount() > 0) { m_VI.CreateCartoucheArea(pContainer, NULL_STR, x, y, cxWidth, Header.Attribs, DescFont, NULL, &cyText); y += cyText + ATTRIB_SPACING_Y; } // Details m_VI.CreateTextArea(pContainer, NULL_STR, x, y, cxWidth, 1000, Header.sDetails, m_VI.GetColor(colorTextNormal), DescFont, NULL, &cyText); y += cyText; y += HEADER_PADDING_Y; if (retcyHeight) *retcyHeight = y; } void CGalacticMapSystemDetails::GetObjAttribs (const CObjectTracker::SObjEntry &Obj, TArray<CCartoucheBlock::SCartoucheDesc> &retAttribs) const // GetObjAttribs // // Returns attributes for the object. { // Add currency CTradingDesc *pTrade = Obj.pType->GetTradingDesc(); if (pTrade && !Obj.fEnemy && pTrade->HasConsumerService()) { const CEconomyType *pCurrencyType = pTrade->GetEconomyType(); if (pCurrencyType && pCurrencyType != g_pUniverse->GetDefaultCurrency()) { CCartoucheBlock::SCartoucheDesc *pEntry = retAttribs.Insert(); pEntry->sText = pCurrencyType->GetCurrencyNamePlural(); pEntry->rgbBack = RGB_MODIFIER_NORMAL_BACKGROUND; pEntry->rgbColor = RGB_MODIFIER_NORMAL_TEXT; } } } bool CGalacticMapSystemDetails::GetObjList (CTopologyNode *pNode, TSortMap<CString, SObjDesc> &Results) const // GetObjList // // Returns an ordered list of objects to show in the details pane for this // node. We return FALSE if there are no objects in the list. { int i; // Initialize Results.DeleteAll(); // Get the list of objects at this node TArray<CObjectTracker::SObjEntry> Objs; g_pUniverse->GetGlobalObjects().GetGalacticMapObjects(pNode, Objs); if (Objs.GetCount() == 0) return false; // Now add them to our result sorted and collated for (i = 0; i < Objs.GetCount(); i++) { // Sort stations into groups int iDispSort; // Abandoned enemy stations always show last if (Objs[i].fEnemy && Objs[i].fShowDestroyed) iDispSort = 4; // Friendly stations show first else if (Objs[i].fFriendly) iDispSort = 1; // Next are neutral stations else if (!Objs[i].fEnemy) iDispSort = 2; // And then enemy stations else iDispSort = 3; // Higher level stations go first int iLevelSort = (MAX_ITEM_LEVEL + 1 - Objs[i].pType->GetLevel()); // Size is next int iSizeSort = 10000 - Min(10000, Objs[i].pType->GetPropertyInteger(CONSTLIT("size"))); // Abandoned stations are separate CString sAbandoned; if (Objs[i].fShowDestroyed) sAbandoned = CONSTLIT("-A"); // Generate a sort string. We want stations with the same type and name // to be collapsed into a single entry. CString sSort = strPatternSubst(CONSTLIT("%d-%02d-%05d-%s-%08x-%s"), iDispSort, iLevelSort, iSizeSort, Objs[i].sName, Objs[i].pType->GetUNID(), sAbandoned); // Add to our result list SObjDesc *pEntry = Results.SetAt(sSort); pEntry->iCount++; if (pEntry->iCount == 1) { pEntry->ObjData = Objs[i]; GetObjAttribs(Objs[i], pEntry->Attribs); } } // Done return true; } void CGalacticMapSystemDetails::GetSystemHeaderData (CTopologyNode *pNode, SSystemHeader &Header) const // GetSystemHeaderData // // Returns data to show in the system header. { // Title is either the system name or "Unknown" if we don't know about this // system. if (pNode->IsKnown()) Header.sTitle = pNode->GetSystemName(); else Header.sTitle = CONSTLIT("Unknown"); // Compuse import/export data if (pNode->IsKnown()) Header.sDetails = pNode->GetTradingEconomy().GetDescription(); // Compose a string indicating when we visited. CString sVisit; DWORD dwLastVisit = pNode->GetLastVisitedTime(); if (dwLastVisit == 0xffffffff) sVisit = CONSTLIT("You've never visited this system."); else if (dwLastVisit == (DWORD)g_pUniverse->GetTicks()) sVisit = CONSTLIT("You are currently in this system."); else { CTimeSpan Span = g_pUniverse->GetElapsedGameTimeAt(g_pUniverse->GetTicks()) - g_pUniverse->GetElapsedGameTimeAt(dwLastVisit); sVisit = strPatternSubst(CONSTLIT("Last visited %s ago."), Span.Format(NULL_STR)); } if (!Header.sDetails.IsBlank()) Header.sDetails = strPatternSubst(CONSTLIT("%s\n%s"), Header.sDetails, sVisit); else Header.sDetails = sVisit; // Add debug information, if necessary if (g_pUniverse->GetDebugOptions().IsShowNodeAttributesEnabled()) Header.sDetails = strPatternSubst(CONSTLIT("%s\n%s: %s"), Header.sDetails, pNode->GetID(), pNode->GetAttributes()); #if 0 // Attributes CCartoucheBlock::SCartoucheDesc *pEntry = Header.Attribs.Insert(); pEntry->sText = CONSTLIT("Test"); pEntry->rgbBack = RGB_MODIFIER_NORMAL_BACKGROUND; pEntry->rgbColor = RGB_MODIFIER_NORMAL_TEXT; #endif }

[ "public@neurohack.com" ]

public@neurohack.com

77c3bb393bbec47d5f64108fcbd07b60f3b90271

b3c47795e8b6d95ae5521dcbbb920ab71851a92f

/LintCode/cpp/Expression Evaluation.cc

7e530571ad7cec6a999d9c0f99109a69f5d5cb6f

[ "LicenseRef-scancode-warranty-disclaimer" ]

no_license

Wizmann/ACM-ICPC

6afecd0fd09918c53a2a84c4d22c244de0065710

7c30454c49485a794dcc4d1c09daf2f755f9ecc1

refs/heads/master

2023-07-15T02:46:21.372860

2023-07-09T15:30:27

3,009,276

51

23

null

UTF-8

C++

false

2,018

cc

class Solution { public: /** * @param expression: a vector of strings; * @return: an integer */ int evaluateExpression(vector<string> &expression) { expression.push_back("#"); stack<int> nums; stack<char> symbols; for (auto& item: expression) { int p = prior(item[0]); if (p == NOT_SYMBOL) { nums.push(strtol(item.c_str(), NULL, 10)); continue; } if (symbols.empty() || prior(symbols.top()) < p) { symbols.push(item[0]); continue; } while (!symbols.empty() && prior(symbols.top()) >= p) { char s = symbols.top(); symbols.pop(); if (s == '(' && item[0] == ')') { break; } if (s == '(') { symbols.push('('); break; } int b = nums.top(); nums.pop(); int a = nums.top(); nums.pop(); nums.push(calc(a, b, s)); } if (item[0] != ')') { symbols.push(item[0]); } } return nums.empty()? 0: nums.top(); } private: int prior(char symbol) { switch (symbol) { case '(': return 999; case '*': case '/': return 99; case '+': case '-': return 9; case '#': case ')': return -1; } return NOT_SYMBOL; } int calc(int a, int b, char s) { switch (s) { case '+': return a + b; case '-': return a - b; case '*': return a * b; case '/': return a / b; } return -1; } private: static const int NOT_SYMBOL = -999; };

[ "mail.kuuy@gmail.com" ]

mail.kuuy@gmail.com

34502113da5892483bbc55e9d282d2fa2a8543e0

444df7dac40df615fc0068e25dcd56c6fa3f5399

/src/libs/data/type/Enumeration.cpp

f1f28d7315ac49105469f266ec190435af822eac

[ "MIT" ]

permissive

eirTony/eirTasker

f4642cb4f1893271d20c5811d4797672fd99e04b

65550a4faf6a53d853d39285d94291f07271b07a

refs/heads/develop

2020-04-18T12:09:23.585884

2017-01-29T00:05:41

67,777,386

0

null

2017-01-10T04:11:47

2016-09-09T07:37:00

C++

UTF-8

C++

false

6,882

cpp

/*! @file Enumeration.cpp Definitions for Enumeration base class */ #include "Enumeration.h" //#include "BaseLog.h" #include <QStringList> /*! Enumeration Construct an empty, invalid item */ Enumeration::Enumeration(void) : value_i(0) , name_s("[null]") , name_map(0) { } /*! Construct an item from a valid integer @arg const int value a valid integer @note if the specified value is not valid, an invalid item is constructed */ Enumeration::Enumeration(Named<int> * p, const int value) : value_i(value) , name_map(p) { } Enumeration::Enumeration(Named<int> * p, const BasicName & name) : value_i(0) , name_map(p) { set(name); } Enumeration::Enumeration(const Enumeration & other) : value_i(other.value_i) , name_s(other.name_s) , name_map(other.name_map) { } Enumeration & Enumeration::operator = (const Enumeration & other) { value_i = other.value_i, name_s = other.name_s, name_map = other.name_map; return *this; } bool Enumeration::isEmpty(void) const { return name_map ? name_map->isEmpty() : true; } Enumeration Enumeration::first(void) const { return isEmpty() ? Enumeration() : Enumeration(name_map, name_map->first(1)); } Enumeration Enumeration::last(void) const { return isEmpty() ? Enumeration() : Enumeration(name_map, name_map->last(1)); } BasicName Enumeration::nameOf(const int value) const { return name_map ? name_map->value(value) : BasicName(); } int Enumeration::valueOf(const BasicName & name) const { return name_map ? name_map->value(name) : 0; } Enumeration & Enumeration::operator ++(void) // prefix ++e { if (name_map) set(name_map->next(value_i)); return *this; } Enumeration Enumeration::operator ++(int) // postfix e++ { Enumeration before(*this); if (name_map) set(name_map->next(value_i)); return before; } Enumeration & Enumeration::operator --(void) // prefix --e { if (name_map) set(name_map->previous(value_i)); return *this; } Enumeration Enumeration::operator --(int) // postfix e-- { Enumeration before(*this); if (name_map) set(name_map->previous(value_i)); return before; } void Enumeration::set(const int value) { if (name_map && name_map->contains(value)) { value_i = value; name_s = name_map->value(value_i); } else name_map = 0; if ( ! name_map) { value_i = 0; name_s.clear(); } } void Enumeration::set(const BasicName & name) { if (name_map && name_map->contains(name)) { value_i = name_map->value(name); name_s = name_map->value(value_i); } else name_map = 0; if ( ! name_map) { value_i = 0; name_s.clear(); } } void Enumeration::invalidate(void) { value_i = 0, name_s.clear(), name_map = 0; } bool Enumeration::isValid(void) const { return name_map && (name_map->contains(value_i) || 0 == value_i); } bool Enumeration::isNull(void) const { return ! name_map; } bool Enumeration::is(const int value) const { return isValid() && value_i == value; } bool Enumeration::operator == (const Enumeration & other) const { return isValid() && other.isValid() && value_i == other.value_i; } bool Enumeration::operator < (const Enumeration & other) const { return isValid() && other.isValid() && value_i < other.value_i; } Enumeration::operator int (void) const { return value(); } int Enumeration::value(void) const { return value_i; } BasicName Enumeration::name(void) const { return name_s; } QList<Enumeration> Enumeration::all(void) { QList<Enumeration> result; foreach (int i, values()) result.append(Enumeration(name_map, i)); return result; } QList<int> Enumeration::values(void) const { return name_map ? name_map->keys() : QList<int>(); } BasicNameList Enumeration::nameFlags(int f) { BasicNameList nameList; if (name_map) { QList<int> intList = name_map->keys(); foreach (int i, intList) if (i && i == (i & f)) nameList << name_map->name(i); } return nameList; } bool Enumeration::isValid(const BasicName & name) { return (name_map && name_map->contains(name)); } int Enumeration::value(const BasicName & name) { int result = -1; if (name_map) { if (name_map->contains(name)) result = name_map->value(name); } return result; } QList<Enumeration> Enumeration::parse(const QString & string) { QList<Enumeration> result; foreach (QString s, string .simplified() .split(' ', QString::SkipEmptyParts)) { bool negate = false; bool toggle = false; if (s.startsWith('-')) { negate = true; s = s.mid(1); } else if (s.startsWith('!')) { toggle = true; s = s.mid(1); } if ("~" == s) { if (negate) result.clear(); else result = all(); } else if (s.contains('~')) { Enumeration min_v(first()); Enumeration max_v(last()); if (s.startsWith('~')) max_v.set(s.mid(1)); else if (s.endsWith('~')) min_v.set(s.left(s.size()-1)); else { int x = s.indexOf('~'); min_v.set(s.left(x)); max_v.set(s.mid(x+1)); } if (min_v.isValid() && max_v.isValid()) { Enumeration v(min_v); do { if (negate) result.removeAll(v); else result.append(v); ++v; } while (v.isValid() && v <= max_v); } } else { Enumeration v(first()); v.set(s); if (v.isValid()) { if (negate) result.removeAll(v); else if (toggle) { if (result.contains(v)) result.removeAll(v); else result.append(v); } else result.append(v); } } } return result; } int Enumeration::parseFlags(const QString & string) { int result = 0; QList<Enumeration> eList = parse(string); foreach (Enumeration e, eList) result |= e.value(); return result; }

[ "noreply@github.com" ]

eirTony.noreply@github.com

04f2bf868de9b8f3e12988c11b4f518fc2346e11

30bc33c36074f2e104099f3a553226d8a19b3b8d

/inheritance/ispark/Trust_account.cpp

12bb100b8006a9ff4917e3a078690178ee8e0653

[]

no_license

ParkInsoo/cplusplusProject

00c3578cb7fafd62f6d70b0229168645304c654a

db7977172c511d7986d315db91d50f27d4bd48d6

refs/heads/master

2021-04-20T19:40:48.128981

2020-03-24T14:37:52

249,713,376

0

null

2020-03-24T13:19:38

null

UTF-8

C++

false

512

cpp

#include "Trust_account.h" TrustAccount::TrustAccount(string name, double balance, double int_rate) : Account { name, balance}, int_rate{int_rate} { } bool TrustAccount::deposit(double amount) { amount += amount * (int_rate/100); if (5000 <= amount) { amount += 50; } return Account::deposit(amount); } ostream &operator<<(ostream &os, const Savings_Account &account) { os << "[Trust Account: " << account.name << " : " << account.balance << "," << account.int_rate << "% ]"; return os; }

[ "noreply@github.com" ]

ParkInsoo.noreply@github.com

41eab95f7b2ae3d866c1cd4c230f6edff79fdb67

0ee909cdc644a9950a97ed4aac8607682736d4f5

/泡泡龙/refactor/CoinShopView.h

431a923cbf79ab4f26235780370b303d26583909

[]

no_license

wtuetnsrmh/pyppl

24671f87b01d8cd503610558cd073fe4d57db84e

982876fa1896db71aa374ba8e76d777a999311c8

refs/heads/master

2021-01-23T10:00:43.201035

2015-03-18T10:24:00

32,452,018

1

0

null

UTF-8

C++

false

1,119

h

#ifndef __CoinShopView_H__ #define __CoinShopView_H__ #include "cocos2d.h" #include "extensions/cocos-ext.h" using namespace cocos2d::extension; using namespace cocos2d; #define POWER_ITEM_TAG 1111 class CoinShopView : public Layer,public TableViewDataSource,public TableViewDelegate { public: CoinShopView(void); ~CoinShopView(void); virtual bool init(); public: virtual void scrollViewDidScroll(cocos2d::extension::ScrollView* view); virtual void scrollViewDidZoom(cocos2d::extension::ScrollView* view); virtual void tableCellTouched(TableView* table, TableViewCell* cell); virtual cocos2d::Size cellSizeForTable(TableView *table); virtual TableViewCell* tableCellAtIndex(TableView *table, ssize_t idx); virtual ssize_t numberOfCellsInTableView(TableView *table); virtual void tableCellHighlight(TableView* table, TableViewCell* cell); virtual void tableCellUnhighlight(TableView* table, TableViewCell* cell); CREATE_FUNC(CoinShopView); void updateItems(int itemIndex); private: TableView *_tableView; }; #endif

[ "123@qq.com" ]

123@qq.com

3dbcdf3d419d37fd121baad01331530e0c431ead

52fc096dce507dcf24ebe9616d8febf4aef6c9c8

/matrixDijkstra.cpp

726ee1da599c4aa8d6938448fe773d69542d41db

[]

no_license

mcheemaa/Shortest-Path

d95702a4a15dd0edb8d8eec56c7e073ffdeabfe8

3665ebe15ad73eacd0aa5e216cc1b486761b2b0a

refs/heads/master

2022-10-30T06:39:52.968515

2020-06-11T23:25:05

271,665,352

0

null

UTF-8

C++

false

2,178

cpp

#include "readGraph.hpp" #include "shortestPath.hpp" #include <fstream> #include <string> #include <cstdlib> #include <iostream> #include <limits> #include <chrono> using namespace std; int main(int argc, char** argv) { if (argc != 5) { cout << "Try Again With Proper Information " << endl; return 1; } string inFile = argv[1]; string outFile = argv[2]; string source = argv[3]; string dest = argv[4]; double ** matrix; string * vLabels; string ** eLabels; int sou; double * dist; int * prev; int desti; ifstream file (inFile); int vert = readGraph(file, matrix, vLabels, eLabels); cout << "Num Vert " << vert << endl; for (int i = 0; i < vert; i++) { if ( source == vLabels[i]) { sou = i; } if ( dest == vLabels[i]) { desti = i; } } cout << "Source " << sou << endl; std::chrono::time_point<std::chrono::system_clock> start, end; start = std::chrono::system_clock::now(); dijkstra(matrix, vert, sou, dist, prev); end = std::chrono::system_clock::now(); int * path; int finals = getPath(sou, desti, prev, path); //cout << "Path Size " << finals << endl; ofstream ofile; ofile.open(outFile); ofile << vert << " " << finals - 1 << endl; for (int i = 0; i < vert; i++) { ofile << vLabels[i] << endl ; } int previous = path[0]; int temp; for (int i = 1; i < finals; i++) { temp = path [i]; ofile << previous << " " << temp << " " << matrix[previous][temp] << " " << eLabels[previous][temp] << " " << endl ; previous = temp; //cout << path[i] << " " << endl;; } double shortest = 0; previous = path[0]; int tempo; for (int i = 1; i < finals; i++) { tempo = path [i]; shortest = shortest + matrix[previous][tempo]; previous = tempo; //cout << path[i] << " " << endl;; } cout << "\nShortest Path From " << sou << " To " << desti << " Is : " << shortest << endl; std::chrono::duration<double> spent = end - start; cout << "\nTime Take By Dijkstra: " << spent.count() << "\n" <<endl; }

[ "noreply@github.com" ]

mcheemaa.noreply@github.com