blob_id stringlengths 40 40 | directory_id stringlengths 40 40 | path stringlengths 3 264 | content_id stringlengths 40 40 | detected_licenses listlengths 0 85 | license_type stringclasses 2 values | repo_name stringlengths 5 140 | snapshot_id stringlengths 40 40 | revision_id stringlengths 40 40 | branch_name stringclasses 905 values | visit_date timestamp[us]date 2015-08-09 11:21:18 2023-09-06 10:45:07 | revision_date timestamp[us]date 1997-09-14 05:04:47 2023-09-17 19:19:19 | committer_date timestamp[us]date 1997-09-14 05:04:47 2023-09-06 06:22:19 | github_id int64 3.89k 681M ⌀ | star_events_count int64 0 209k | fork_events_count int64 0 110k | gha_license_id stringclasses 22 values | gha_event_created_at timestamp[us]date 2012-06-07 00:51:45 2023-09-14 21:58:39 ⌀ | gha_created_at timestamp[us]date 2008-03-27 23:40:48 2023-08-21 23:17:38 ⌀ | gha_language stringclasses 141 values | src_encoding stringclasses 34 values | language stringclasses 1 value | is_vendor bool 1 class | is_generated bool 2 classes | length_bytes int64 3 10.4M | extension stringclasses 115 values | content stringlengths 3 10.4M | authors listlengths 1 1 | author_id stringlengths 0 158 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
8c11acaf8aae680647dd6fb58922d78e1bd8960f | ddcdb3d2c74688e783d3fbd49ab0cac69b9cf8f5 | /examples/WioTerminal_TinyML_6_Speech_Recognition/Wio_Terminal_TF-MICRO_Speech_Recognition_Mic/dma_rec.cpp | d46ef37e413f52e2f8783efb921539c22f3c86d7 | [
"MIT"
] | permissive | gits00/Seeed_Arduino_Sketchbook | 79e4ca34170677cdd339933803234c91700cae9c | ddf33d2f6166123aeae66484ec20254b0a3facc1 | refs/heads/master | 2023-09-05T00:21:26.860974 | 2021-11-23T17:14:34 | 2021-11-23T17:14:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,177 | cpp | #include "dma_rec.h"
enum {ADC_BUF_LEN = BUF_SIZE}; // Size of one of the DMA double buffers
static const int debug_pin = LED_BUILTIN; // Toggles each DAC ISR (if DEBUG is set to 1)
// DMAC descriptor structure
typedef struct {
uint16_t btctrl;
uint16_t btcnt;
uint32_t srcaddr;
uint32_t dstaddr;
uint32_t descaddr;
} dmacdescriptor ;
// Globals - DMA and ADC
volatile uint8_t recording = 0;
volatile static bool record_ready = false;
uint16_t adc_buf_0[ADC_BUF_LEN]; // ADC results array 0
uint16_t adc_buf_1[ADC_BUF_LEN]; // ADC results array 1
volatile dmacdescriptor wrb[DMAC_CH_NUM] __attribute__ ((aligned (16))); // Write-back DMAC descriptors
dmacdescriptor descriptor_section[DMAC_CH_NUM] __attribute__ ((aligned (16))); // DMAC channel descriptors
dmacdescriptor descriptor __attribute__ ((aligned (16))); // Place holder descriptor
int16_t audio_buffer[BUF_SIZE];
bool buf_ready = false;
//High pass butterworth filter order=1 alpha1=0.0125
FilterBuHp::FilterBuHp()
{
v[0]=0.0;
}
float FilterBuHp::step(float x)
{
v[0] = v[1];
v[1] = (9.621952458291035404e-1f * x) + (0.92439049165820696974f * v[0]);
return (v[1] - v[0]);
}
FilterBuHp filter;
/*******************************************************************************
* Interrupt Service Routines (ISRs)
*/
/**
* @brief Copy sample data in selected buf and signal ready when buffer is full
*
* @param[in] *buf Pointer to source buffer
* @param[in] buf_len Number of samples to copy from buffer
*/
static void audio_rec_callback(uint16_t *buf, uint32_t buf_len) {
// Copy samples from DMA buffer to inference buffer
if (recording) {
for (uint32_t i = 0; i < buf_len; i++) {
// Convert 12-bit unsigned ADC value to 16-bit PCM (signed) audio value
audio_buffer[i++] = filter.step((int16_t)(buf[i] - 1024) * 16);
buf_ready = true;
}
}
}
/**
* Interrupt Service Routine (ISR) for DMAC 1
*/
void DMAC_1_Handler() {
static uint8_t count = 0;
// Check if DMAC channel 1 has been suspended (SUSP)
if (DMAC->Channel[1].CHINTFLAG.bit.SUSP) {
// Debug: make pin high before copying buffer
#ifdef DEBUG
digitalWrite(debug_pin, HIGH);
#endif
// Restart DMAC on channel 1 and clear SUSP interrupt flag
DMAC->Channel[1].CHCTRLB.reg = DMAC_CHCTRLB_CMD_RESUME;
DMAC->Channel[1].CHINTFLAG.bit.SUSP = 1;
// See which buffer has filled up, and dump results into large buffer
if (count) {
audio_rec_callback(adc_buf_0, ADC_BUF_LEN);
} else {
audio_rec_callback(adc_buf_1, ADC_BUF_LEN);
}
// Flip to next buffer
count = (count + 1) % 2;
// Debug: make pin low after copying buffer
#ifdef DEBUG
digitalWrite(debug_pin, LOW);
#endif
}
}
/*******************************************************************************
* Functions
*/
// This is all based on MartinL's work from these two posts:
// https://forum.arduino.cc/index.php?topic=685347.0
// and https://forum.arduino.cc/index.php?topic=709104.0
void config_dma_adc() {
// Configure DMA to sample from ADC at a regular interval (triggered by timer/counter)
DMAC->BASEADDR.reg = (uint32_t)descriptor_section; // Specify the location of the descriptors
DMAC->WRBADDR.reg = (uint32_t)wrb; // Specify the location of the write back descriptors
DMAC->CTRL.reg = DMAC_CTRL_DMAENABLE | DMAC_CTRL_LVLEN(0xf); // Enable the DMAC peripheral
DMAC->Channel[1].CHCTRLA.reg = DMAC_CHCTRLA_TRIGSRC(TC5_DMAC_ID_OVF) | // Set DMAC to trigger on TC5 timer overflow
DMAC_CHCTRLA_TRIGACT_BURST; // DMAC burst transfer
descriptor.descaddr = (uint32_t)&descriptor_section[1]; // Set up a circular descriptor
descriptor.srcaddr = (uint32_t)&ADC1->RESULT.reg; // Take the result from the ADC0 RESULT register
descriptor.dstaddr = (uint32_t)adc_buf_0 + sizeof(uint16_t) * ADC_BUF_LEN; // Place it in the adc_buf_0 array
descriptor.btcnt = ADC_BUF_LEN; // Beat count
descriptor.btctrl = DMAC_BTCTRL_BEATSIZE_HWORD | // Beat size is HWORD (16-bits)
DMAC_BTCTRL_DSTINC | // Increment the destination address
DMAC_BTCTRL_VALID | // Descriptor is valid
DMAC_BTCTRL_BLOCKACT_SUSPEND; // Suspend DMAC channel 0 after block transfer
memcpy(&descriptor_section[0], &descriptor, sizeof(descriptor)); // Copy the descriptor to the descriptor section
descriptor.descaddr = (uint32_t)&descriptor_section[0]; // Set up a circular descriptor
descriptor.srcaddr = (uint32_t)&ADC1->RESULT.reg; // Take the result from the ADC0 RESULT register
descriptor.dstaddr = (uint32_t)adc_buf_1 + sizeof(uint16_t) * ADC_BUF_LEN; // Place it in the adc_buf_1 array
descriptor.btcnt = ADC_BUF_LEN; // Beat count
descriptor.btctrl = DMAC_BTCTRL_BEATSIZE_HWORD | // Beat size is HWORD (16-bits)
DMAC_BTCTRL_DSTINC | // Increment the destination address
DMAC_BTCTRL_VALID | // Descriptor is valid
DMAC_BTCTRL_BLOCKACT_SUSPEND; // Suspend DMAC channel 0 after block transfer
memcpy(&descriptor_section[1], &descriptor, sizeof(descriptor)); // Copy the descriptor to the descriptor section
// Configure NVIC
NVIC_SetPriority(DMAC_1_IRQn, 0); // Set the Nested Vector Interrupt Controller (NVIC) priority for DMAC1 to 0 (highest)
NVIC_EnableIRQ(DMAC_1_IRQn); // Connect DMAC1 to Nested Vector Interrupt Controller (NVIC)
// Activate the suspend (SUSP) interrupt on DMAC channel 1
DMAC->Channel[1].CHINTENSET.reg = DMAC_CHINTENSET_SUSP;
// Configure ADC
ADC1->INPUTCTRL.bit.MUXPOS = ADC_INPUTCTRL_MUXPOS_AIN12_Val; // Set the analog input to ADC0/AIN2 (PB08 - A4 on Metro M4)
while(ADC1->SYNCBUSY.bit.INPUTCTRL); // Wait for synchronization
ADC1->SAMPCTRL.bit.SAMPLEN = 0x00; // Set max Sampling Time Length to half divided ADC clock pulse (2.66us)
while(ADC1->SYNCBUSY.bit.SAMPCTRL); // Wait for synchronization
ADC1->CTRLA.reg = ADC_CTRLA_PRESCALER_DIV128; // Divide Clock ADC GCLK by 128 (48MHz/128 = 375kHz)
ADC1->CTRLB.reg = ADC_CTRLB_RESSEL_12BIT | // Set ADC resolution to 12 bits
ADC_CTRLB_FREERUN; // Set ADC to free run mode
while(ADC1->SYNCBUSY.bit.CTRLB); // Wait for synchronization
ADC1->CTRLA.bit.ENABLE = 1; // Enable the ADC
while(ADC1->SYNCBUSY.bit.ENABLE); // Wait for synchronization
ADC1->SWTRIG.bit.START = 1; // Initiate a software trigger to start an ADC conversion
while(ADC1->SYNCBUSY.bit.SWTRIG); // Wait for synchronization
// Enable DMA channel 1
DMAC->Channel[1].CHCTRLA.bit.ENABLE = 1;
// Configure Timer/Counter 5
GCLK->PCHCTRL[TC5_GCLK_ID].reg = GCLK_PCHCTRL_CHEN | // Enable perhipheral channel for TC5
GCLK_PCHCTRL_GEN_GCLK1; // Connect generic clock 0 at 48MHz
TC5->COUNT16.WAVE.reg = TC_WAVE_WAVEGEN_MFRQ; // Set TC5 to Match Frequency (MFRQ) mode
TC5->COUNT16.CC[0].reg = 3000 - 1; // Set the trigger to 16 kHz: (4Mhz / 16000) - 1
while (TC5->COUNT16.SYNCBUSY.bit.CC0); // Wait for synchronization
// Start Timer/Counter 5
TC5->COUNT16.CTRLA.bit.ENABLE = 1; // Enable the TC5 timer
while (TC5->COUNT16.SYNCBUSY.bit.ENABLE); // Wait for synchronization
}
| [
"dmitrywat@gmail.com"
] | dmitrywat@gmail.com |
ae49df8cdbcf070d5dd19566f9ec3da43f2a3e82 | 11d335b447ea5389f93165dd21e7514737259ced | /transport/Transcendence/TSE/CCommunicationsHandler.cpp | b17aaa5b2fb0aff9555815ff3e69e484e63b0634 | [] | no_license | bennbollay/Transport | bcac9dbd1449561f2a7126b354efc29ba3857d20 | 5585baa68fc1f56310bcd79a09bbfdccfaa61ed7 | refs/heads/master | 2021-05-27T03:30:57.746841 | 2012-04-12T04:31:22 | 2012-04-12T04:31:22 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,922 | cpp | // CCommunicationsHandler.cpp
//
// CCommunicationsHandler class
#include "PreComp.h"
#define ON_SHOW_TAG CONSTLIT("OnShow")
#define CODE_TAG CONSTLIT("Code")
#define INVOKE_TAG CONSTLIT("Invoke")
#define NAME_ATTRIB CONSTLIT("name")
#define KEY_ATTRIB CONSTLIT("key")
CCommunicationsHandler::CCommunicationsHandler (void) : m_iCount(0),
m_pMessages(NULL)
// CCommunicationsHandler constructor
{
}
CCommunicationsHandler::~CCommunicationsHandler (void)
// CCommunicationsHandler destructor
{
for (int i = 0; i < m_iCount; i++)
{
if (m_pMessages[i].pCode)
m_pMessages[i].pCode->Discard(&g_pUniverse->GetCC());
if (m_pMessages[i].pOnShow)
m_pMessages[i].pOnShow->Discard(&g_pUniverse->GetCC());
}
if (m_pMessages)
delete [] m_pMessages;
}
ALERROR CCommunicationsHandler::InitFromXML (CXMLElement *pDesc, CString *retsError)
// InitFromXML
//
// Load from an XML element
{
int i, j;
CString sError;
// Allocate the structure
int iCount = pDesc->GetContentElementCount();
if (iCount == 0)
return NOERROR;
ASSERT(m_pMessages == NULL);
m_pMessages = new SMessage [iCount];
m_iCount = iCount;
for (i = 0; i < iCount; i++)
{
CXMLElement *pMessage = pDesc->GetContentElement(i);
// Get the name
m_pMessages[i].sMessage = pMessage->GetAttribute(NAME_ATTRIB);
m_pMessages[i].sShortcut = pMessage->GetAttribute(KEY_ATTRIB);
// If no sub elements, just get the code from the content
if (pMessage->GetContentElementCount() == 0)
{
m_pMessages[i].pCode = g_pUniverse->GetCC().Link(pMessage->GetContentText(0), 0, NULL);
m_pMessages[i].pOnShow = NULL;
}
// If we've got sub elements, then load the different code blocks
else
{
m_pMessages[i].pCode = NULL;
m_pMessages[i].pOnShow = NULL;
for (j = 0; j < pMessage->GetContentElementCount(); j++)
{
CXMLElement *pItem = pMessage->GetContentElement(j);
// OnShow
if (strEquals(pItem->GetTag(), ON_SHOW_TAG))
m_pMessages[i].pOnShow = g_pUniverse->GetCC().Link(pItem->GetContentText(0), 0, NULL);
else if (strEquals(pItem->GetTag(), INVOKE_TAG) || strEquals(pItem->GetTag(), CODE_TAG))
m_pMessages[i].pCode = g_pUniverse->GetCC().Link(pItem->GetContentText(0), 0, NULL);
else
{
*retsError = strPatternSubst(CONSTLIT("Unknown element: <%s>"), pItem->GetTag().GetASCIIZPointer());
return ERR_FAIL;
}
}
}
// Deal with error
if (m_pMessages[i].pCode && m_pMessages[i].pCode->IsError())
sError = m_pMessages[i].pCode->GetStringValue();
if (m_pMessages[i].pOnShow && m_pMessages[i].pOnShow->IsError())
sError = m_pMessages[i].pOnShow->GetStringValue();
}
// Done
if (retsError)
*retsError = sError;
return (sError.IsBlank() ? NOERROR : ERR_FAIL);
}
| [
"g.github@magitech.org"
] | g.github@magitech.org |
f87fb418de1d9d25dd60cf90cef533aea8b4dff8 | a19275ff09caf880e135bce76dc7a0107ec0369e | /catkin_ws/src/robot_controller/armc_controller/src/armc_position_controller.cpp | 67858c0f2a0e2d47d669b3191d13d42ebd2a9501 | [] | no_license | xtyzhen/Multi_arm_robot | e201c898a86406c1b1deb82326bb2157d5b28975 | 15daf1a80c781c1c929ba063d779c0928a24b117 | refs/heads/master | 2023-03-21T14:00:24.128957 | 2021-03-10T12:04:36 | 2021-03-10T12:04:36 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,956 | cpp | #include <armc_controller/armc_position_controller.h>
#include <pluginlib/class_list_macros.hpp>
namespace armc_controller //命名空间
{
ArmcPositionController::ArmcPositionController() {}
ArmcPositionController::~ArmcPositionController() {sub_command_.shutdown();}
bool ArmcPositionController::init(hardware_interface::PositionJointInterface* hw, ros::NodeHandle &n)
{
//获取控制方法
// std::string param_name1 = "control_methods";
// if(!n.getParam(param_name1, control_methods))
// {
// ROS_ERROR_STREAM("Failed to getParam '" << param_name1 << "' (namespace: " << n.getNamespace() << ").");
// return false;
// }
// List of controlled joints
std::string param_name2 = "joints";
if(!n.getParam(param_name2, joint_names_)) //获得关节名
{
ROS_ERROR_STREAM("Failed to getParam '" << param_name2 << "' (namespace: " << n.getNamespace() << ").");
return false;
}
n_joints_ = joint_names_.size();
if(n_joints_ == 0){
ROS_ERROR_STREAM("List of joint names is empty.");
return false;
}
for(unsigned int i=0; i<n_joints_; i++)
{
try
{
joints_.push_back(hw->getHandle(joint_names_[i])); //通过关节名获得句柄
}
catch (const hardware_interface::HardwareInterfaceException& e)
{
ROS_ERROR_STREAM("Exception thrown: " << e.what());
return false;
}
}
commands_buffer_.writeFromNonRT(std::vector<double>(n_joints_, 0.0)); //将命令初值赋值为0
sub_command_ = n.subscribe<std_msgs::Float64MultiArray>("command", 1, &ArmcPositionController::commandCB, this);
return true;
}
void ArmcPositionController::starting(const ros::Time& time) //开始控制器
{
// Start controller with current joint positions
std::vector<double> & commands = *commands_buffer_.readFromRT();
for(unsigned int i=0; i<joints_.size(); i++)
{
commands[i]=joints_[i].getPosition(); //从底层获取关节当前位置为命令的初始值
}
}
void ArmcPositionController::update(const ros::Time& /*time*/, const ros::Duration& /*period*/)
{
std::vector<double> & commands = *commands_buffer_.readFromRT();
for(unsigned int i=0; i<n_joints_; i++)
{ joints_[i].setCommand(commands[i]); } //设置关节命令
}
void ArmcPositionController::commandCB(const std_msgs::Float64MultiArrayConstPtr& msg) //命令回调函数
{
if(msg->data.size()!=n_joints_)
{
ROS_ERROR_STREAM("Dimension of command (" << msg->data.size() << ") does not match number of joints (" << n_joints_ << ")! Not executing!");
return;
}
commands_buffer_.writeFromNonRT(msg->data);
}
} //namespace end
PLUGINLIB_EXPORT_CLASS(armc_controller::ArmcPositionController,controller_interface::ControllerBase)
| [
"qyz146006@163.com"
] | qyz146006@163.com |
bf57a6c71e3b92a5da85c861be3a9f4a7889485e | e740f1e877578efa4b0737eaebdee6ddbb1c4c77 | /hphp/runtime/vm/jit/vasm-simplify-arm.cpp | 1a2a1bc9695f9fdf29fb7f1925843f78f899c681 | [
"PHP-3.01",
"Zend-2.0",
"MIT"
] | permissive | godfredakpan/hhvm | faf01434fb7a806e4b1d8cb9562e7f70655e6d0c | 91d35445d9b13cd33f54e782c3757d334828cc4c | refs/heads/master | 2020-03-28T12:29:11.857977 | 2018-09-11T06:40:08 | 2018-09-11T06:43:56 | 148,303,284 | 1 | 0 | null | 2018-09-11T10:56:23 | 2018-09-11T10:56:23 | null | UTF-8 | C++ | false | false | 5,178 | cpp | /*
+----------------------------------------------------------------------+
| HipHop for PHP |
+----------------------------------------------------------------------+
| Copyright (c) 2010-present Facebook, Inc. (http://www.facebook.com) |
+----------------------------------------------------------------------+
| This source file is subject to version 3.01 of the PHP license, |
| that is bundled with this package in the file LICENSE, and is |
| available through the world-wide-web at the following url: |
| http://www.php.net/license/3_01.txt |
| If you did not receive a copy of the PHP license and are unable to |
| obtain it through the world-wide-web, please send a note to |
| license@php.net so we can mail you a copy immediately. |
+----------------------------------------------------------------------+
*/
#include "hphp/runtime/vm/jit/vasm-simplify-internal.h"
#include "hphp/runtime/vm/jit/vasm.h"
#include "hphp/runtime/vm/jit/vasm-gen.h"
#include "hphp/runtime/vm/jit/vasm-instr.h"
#include "hphp/runtime/vm/jit/vasm-unit.h"
#include "hphp/runtime/vm/jit/vasm-util.h"
#include "hphp/vixl/a64/assembler-a64.h"
namespace HPHP { namespace jit { namespace arm {
namespace {
///////////////////////////////////////////////////////////////////////////////
template <typename Inst>
bool simplify(Env&, const Inst& /*inst*/, Vlabel /*b*/, size_t /*i*/) {
return false;
}
///////////////////////////////////////////////////////////////////////////////
bool operand_one(Env& env, Vreg op) {
auto const op_it = env.unit.regToConst.find(op);
if (op_it == env.unit.regToConst.end()) return false;
auto const op_const = op_it->second;
if (op_const.isUndef) return false;
if (op_const.val != 1) return false;
return true;
}
// Reduce use of immediate one possibly removing def as dead code.
// Specific to ARM using hard-coded zero register.
template <typename Out, typename Inst>
bool cmov_fold_one(Env& env, const Inst& inst, Vlabel b, size_t i) {
if (operand_one(env, inst.f)) {
return simplify_impl(env, b, i, [&] (Vout& v) {
v << Out{inst.cc, inst.sf, PhysReg(vixl::wzr), inst.t, inst.d};
return 1;
});
}
if (operand_one(env, inst.t)) {
return simplify_impl(env, b, i, [&] (Vout& v) {
v << Out{ccNegate(inst.cc), inst.sf, PhysReg(vixl::wzr), inst.f, inst.d};
return 1;
});
}
return false;
}
bool simplify(Env& env, const cmovb& inst, Vlabel b, size_t i) {
return cmov_fold_one<csincb>(env, inst, b, i);
}
bool simplify(Env& env, const cmovw& inst, Vlabel b, size_t i) {
return cmov_fold_one<csincw>(env, inst, b, i);
}
bool simplify(Env& env, const cmovl& inst, Vlabel b, size_t i) {
return cmov_fold_one<csincl>(env, inst, b, i);
}
bool simplify(Env& env, const cmovq& inst, Vlabel b, size_t i) {
return cmov_fold_one<csincq>(env, inst, b, i);
}
///////////////////////////////////////////////////////////////////////////////
bool simplify(Env& env, const loadb& inst, Vlabel b, size_t i) {
return if_inst<Vinstr::movzbl>(env, b, i + 1, [&] (const movzbl& mov) {
// loadb{s, tmp}; movzbl{tmp, d}; -> loadzbl{s, d};
if (!(env.use_counts[inst.d] == 1 &&
inst.d == mov.s)) return false;
return simplify_impl(env, b, i, [&] (Vout& v) {
v << loadzbl{inst.s, mov.d};
return 2;
});
});
}
///////////////////////////////////////////////////////////////////////////////
bool simplify(Env& env, const ldimmq& inst, Vlabel b, size_t i) {
return if_inst<Vinstr::lea>(env, b, i + 1, [&] (const lea& ea) {
// ldimmq{s, index}; lea{base[index], d} -> lea{base[s],d}
if (!(env.use_counts[inst.d] == 1 &&
inst.s.q() <= 4095 &&
inst.s.q() >= -4095 &&
inst.d == ea.s.index &&
ea.s.disp == 0 &&
ea.s.base.isValid())) return false;
return simplify_impl(env, b, i, [&] (Vout& v) {
v << lea{ea.s.base[inst.s.l()], ea.d};
return 2;
});
});
}
///////////////////////////////////////////////////////////////////////////////
bool simplify(Env& env, const movzbl& inst, Vlabel b, size_t i) {
// movzbl{s, d}; shrli{2, s, d} --> ubfmli{2, 7, s, d}
return if_inst<Vinstr::shrli>(env, b, i + 1, [&](const shrli& sh) {
if (!(sh.s0.l() == 2 &&
env.use_counts[inst.d] == 1 &&
env.use_counts[sh.sf] == 0 &&
inst.d == sh.s1)) return false;
return simplify_impl(env, b, i, [&] (Vout& v) {
v << copy{inst.s, inst.d};
v << ubfmli{2, 7, inst.d, sh.d};
return 2;
});
});
}
///////////////////////////////////////////////////////////////////////////////
}
bool simplify(Env& env, Vlabel b, size_t i) {
assertx(i <= env.unit.blocks[b].code.size());
auto const& inst = env.unit.blocks[b].code[i];
switch (inst.op) {
#define O(name, ...) \
case Vinstr::name: \
return simplify(env, inst.name##_, b, i); \
VASM_OPCODES
#undef O
}
not_reached();
}
///////////////////////////////////////////////////////////////////////////////
}}}
| [
"hhvm-bot@users.noreply.github.com"
] | hhvm-bot@users.noreply.github.com |
b741abc27db3179905357f8ea72560e74e41b0fd | d19327949a17ba357a24fa2f35b882b29c47a5d0 | /Копейкин_Борис/vector/vector2.cpp | 5c8eece4554410d25ecbe0087ff2b068fca03db7 | [] | no_license | droidroot1995/DAFE_CPP_014 | 4778654322f5bba2b8555a7ac47bcd4428b639b0 | 8ea50a5e3cb2440ec9249fb20293a9e709c4f5a1 | refs/heads/main | 2023-01-28T14:58:03.793973 | 2020-12-16T15:18:45 | 2020-12-16T15:18:45 | 300,523,672 | 0 | 14 | null | 2020-12-16T15:18:46 | 2020-10-02T06:36:14 | C++ | UTF-8 | C++ | false | false | 1,148 | cpp | #include "vector2.h"
vector2::vector2(int s) : sz(s),
elem(new double[s])
{
for (int i = 0; i < s; ++i)
elem[i] = 0.0;
}
vector2::vector2(std::initializer_list<double> lst) : sz{int(lst.size())},
elem{new double[sz]}
{
std::copy(lst.begin(), lst.end(), elem);
}
vector2::vector2(const vector2& arg) : sz{arg.sz},// Copying constructor
elem{new double[arg.sz]}
{
std::copy(arg.elem, arg.elem + arg.sz, elem);
}
vector2::vector2(vector2&& a) // Moving constructor
:sz{a.sz}, elem{a.elem}
{
a.sz = 0;
a.elem = nullptr;
}
vector2& vector2::operator=(const vector2& a)// Copying assignment
{
double* p = new double[a.sz];
std::copy(a.elem,a.elem+a.sz, p);
delete[] elem;
elem = p;
sz = a.sz;
return *this;
}
vector2& vector2::operator=(vector2&& a) // Moving assignment
{
delete[] elem;
elem = a.elem;
sz = a.sz;
a.elem = nullptr;
a.sz = 0;
return *this;
}
double& vector2::operator[] (int n) // Operator [] for non-const vector
{
return elem[n];
}
double vector2::operator[] (int n) const // Operator [] for constant vector
{
return elem[n];
}
| [
"droidroot1995@gmail.com"
] | droidroot1995@gmail.com |
f735357bd936775f573a156e516ab65a16776dd5 | cee0a47e266624cf3b250c4802dde6e93eefa6e3 | /inc/eqMivt.h | 05000140bc013ffa9e3ebd69ecc05c19485c612e | [] | no_license | carlosduelo/eqMivtRefactor | 339e528cd3467ddc580b1333010a1809faddc71e | 8a6349aa20eeca30b81c5e2d650cb216547c7f0f | refs/heads/master | 2016-09-10T19:32:22.185196 | 2014-03-13T15:10:08 | 2014-03-13T15:10:08 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 652 | h | /*
Author: Carlos Duelo Serrano
Company: Cesvima
Notes:
*/
#ifndef EQ_MIVT_H
#define EQ_MIVT_H
#define VERSION_EQ_MIVT 0.3
#include <eq/eq.h>
namespace eqMivt
{
class LocalInitData;
class EqMivt : public eq::Client
{
public:
EqMivt( const LocalInitData& initData );
virtual ~EqMivt() {}
int run();
static const std::string& getHelp();
protected:
virtual void clientLoop();
private:
const LocalInitData& _initData;
};
enum LogTopics
{
LOG_STATS = eq::LOG_CUSTOM << 0, // 65536
LOG_CULL = eq::LOG_CUSTOM << 1 // 131072
};
}
#endif /* EQ_MIVT_H */
| [
"carlos.duelo@gmail.com"
] | carlos.duelo@gmail.com |
a2a5b067d3b81da13fdfdae5fcf09c70b98e2be3 | c13b76409887dab5f634eda7547e5f3472560386 | /Non-Overlapping Palindromes/hello.cpp | 6b223c27b31fa0dcacc233d17cf684a3f5d06412 | [] | no_license | fozz101/IEEEXTREME-14.0 | 75a91cfb79daa0aed0e8f7ec72cea2a4ad9be6e2 | f8da723108fc9ae6d675ae96f32cc76caf323824 | refs/heads/main | 2023-06-05T04:00:32.639378 | 2021-06-29T15:46:39 | 2021-06-29T15:46:39 | 381,417,689 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 166 | cpp | #include <bits/stdc++.h>
using namespace std;
int main(){
int T=0;
string S="";
cin>>T;
for (int i=0;i<T;i++){
cin>>S;
}
return 0;
} | [
"fedi.galfat@esprit.tn"
] | fedi.galfat@esprit.tn |
ae133bf3fcd2efaf8070d1f0bb2b8074d91b297d | 63c8b9227a6b3178d918769042ecb060acc557be | /lte/gateway/c/session_manager/test/test_session_manager_handler.cpp | 6e28bee79399c382b13f0fc711b1ae8a84b1a92c | [
"BSD-3-Clause",
"Apache-2.0"
] | permissive | snwfdhmp/magma | 7c4898db68d2668fd39ed25f73bb9a2bc5959066 | 8b3ff20a2717337a83c8ef531fa773a851d2e54d | refs/heads/master | 2020-12-06T09:06:25.806497 | 2020-01-07T18:27:09 | 2020-01-07T18:28:51 | 232,418,366 | 1 | 0 | NOASSERTION | 2020-01-07T21:12:28 | 2020-01-07T21:12:27 | null | UTF-8 | C++ | false | false | 3,573 | cpp | /**
* Copyright (c) 2016-present, Facebook, Inc.
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree. An additional grant
* of patent rights can be found in the PATENTS file in the same directory.
*/
#include <memory>
#include <glog/logging.h>
#include <gtest/gtest.h>
#include <folly/io/async/EventBaseManager.h>
#include "MagmaService.h"
#include "LocalEnforcer.h"
#include "ProtobufCreators.h"
#include "RuleStore.h"
#include "ServiceRegistrySingleton.h"
#include "SessiondMocks.h"
#include "magma_logging.h"
using ::testing::Test;
namespace magma {
class SessionManagerHandlerTest : public ::testing::Test {
protected:
protected:
virtual void SetUp() {
reporter = std::make_shared<MockSessionReporter>();
auto rule_store = std::make_shared<StaticRuleStore>();
auto pipelined_client = std::make_shared<MockPipelinedClient>();
auto directoryd_client = std::make_shared<MockDirectorydClient>();
auto spgw_client = std::make_shared<MockSpgwServiceClient>();
auto aaa_client = std::make_shared<MockAAAClient>();
local_enforcer = std::make_shared<LocalEnforcer>(
reporter,
rule_store,
pipelined_client,
directoryd_client,
spgw_client,
aaa_client,
0);
evb = folly::EventBaseManager::get()->getEventBase();
local_enforcer->attachEventBase(evb);
session_manager = std::make_shared<LocalSessionManagerHandlerImpl>(
local_enforcer, reporter.get(), directoryd_client);
}
protected:
std::shared_ptr<LocalSessionManagerHandlerImpl> session_manager;
std::shared_ptr<MockSessionReporter> reporter;
std::shared_ptr <LocalEnforcer> local_enforcer;
SessionIDGenerator id_gen_;
folly::EventBase *evb;
};
TEST_F(SessionManagerHandlerTest, test_create_session_cfg)
{
LocalCreateSessionRequest request;
CreateSessionResponse response;
std::string hardware_addr_bytes = {0x0f,0x10,0x2e,0x12,0x3a,0x55};
std::string imsi = "IMSI1";
std::string msisdn = "5100001234";
std::string radius_session_id = "AA-AA-AA-AA-AA-AA:TESTAP__"
"0F-10-2E-12-3A-55";
auto sid = id_gen_.gen_session_id(imsi);
SessionState::Config cfg = {.ue_ipv4 = "",
.spgw_ipv4 = "",
.msisdn = msisdn,
.apn = "",
.imei = "",
.plmn_id = "",
.imsi_plmn_id = "",
.user_location = "",
.rat_type = RATType::TGPP_WLAN,
.mac_addr = "0f:10:2e:12:3a:55",
.hardware_addr = hardware_addr_bytes,
.radius_session_id = radius_session_id};
local_enforcer->init_session_credit(imsi, sid, cfg, response);
grpc::ServerContext create_context;
request.mutable_sid()->set_id("IMSI1");
request.set_rat_type(RATType::TGPP_WLAN);
request.set_hardware_addr(hardware_addr_bytes);
request.set_msisdn(msisdn);
request.set_radius_session_id(radius_session_id);
// Ensure session is not reported as its a duplicate
EXPECT_CALL(*reporter, report_create_session(_, _)).Times(0);
session_manager->CreateSession(&create_context, &request, [this](
grpc::Status status, LocalCreateSessionResponse response_out) {});
}
int main(int argc, char **argv)
{
::testing::InitGoogleTest(&argc, argv);
return RUN_ALL_TESTS();
}
} // namespace magma
| [
"facebook-github-bot@users.noreply.github.com"
] | facebook-github-bot@users.noreply.github.com |
070d2d42cca74abf34203b433ca648f42999708e | ea2c98167dd31d283c0e7a5e49af74a3ae321d03 | /VertexCompositeProducer/src/LamC3PProducer.cc | e4a1c850af7a43a95d4af17696b7f90c544b0946 | [] | no_license | stahlleiton/VertexCompositeAnalysis | 907041c2a6e78e6bc8721a11658d296dc7bdc696 | cf77d659aade975b73991409a58eaa4e7c485b80 | refs/heads/master | 2023-07-06T15:17:38.257916 | 2019-01-14T23:30:03 | 2019-01-14T23:30:03 | 167,209,905 | 0 | 2 | null | 2023-06-28T22:04:55 | 2019-01-23T15:54:55 | Python | UTF-8 | C++ | false | false | 2,265 | cc | // -*- C++ -*-
//
// Package: VertexCompositeProducer
//
// Class: LamC3PProducer
//
/**\class LamC3PProducer LamC3PProducer.cc VertexCompositeAnalysis/VertexCompositeProducer/src/LamC3PProducer.cc
Description: <one line class summary>
Implementation:
<Notes on implementation>
*/
//
// Original Author: Wei Li
//
//
// system include files
#include <memory>
#include "VertexCompositeAnalysis/VertexCompositeProducer/interface/LamC3PProducer.h"
// Constructor
LamC3PProducer::LamC3PProducer(const edm::ParameterSet& iConfig) :
theVees(iConfig, consumesCollector())
{
useAnyMVA_ = false;
if(iConfig.exists("useAnyMVA")) useAnyMVA_ = iConfig.getParameter<bool>("useAnyMVA");
produces< reco::VertexCompositeCandidateCollection >("LamC3P");
if(useAnyMVA_) produces<MVACollection>("MVAValuesLamC3P");
}
// (Empty) Destructor
LamC3PProducer::~LamC3PProducer() {
}
//
// Methods
//
// Producer Method
void LamC3PProducer::produce(edm::Event& iEvent, const edm::EventSetup& iSetup) {
using namespace edm;
// Create LamC3PFitter object which reconstructs the vertices and creates
// LamC3PFitter theVees(theParams, iEvent, iSetup);
theVees.fitAll(iEvent, iSetup);
// Create auto_ptr for each collection to be stored in the Event
// std::auto_ptr< reco::VertexCompositeCandidateCollection >
// lamCCandidates( new reco::VertexCompositeCandidateCollection );
//
auto lamCCandidates = std::make_unique<reco::VertexCompositeCandidateCollection>();
lamCCandidates->reserve( theVees.getLamC3P().size() );
std::copy( theVees.getLamC3P().begin(),
theVees.getLamC3P().end(),
std::back_inserter(*lamCCandidates) );
// Write the collections to the Event
iEvent.put( std::move(lamCCandidates), std::string("LamC3P") );
if(useAnyMVA_)
{
auto mvas = std::make_unique<MVACollection>(theVees.getMVAVals().begin(),theVees.getMVAVals().end());
iEvent.put(std::move(mvas), std::string("MVAValuesLamC3P"));
}
theVees.resetAll();
}
//void LamC3PProducer::beginJob() {
void LamC3PProducer::beginJob() {
}
void LamC3PProducer::endJob() {
}
//define this as a plug-in
#include "FWCore/PluginManager/interface/ModuleDef.h"
DEFINE_FWK_MODULE(LamC3PProducer);
| [
"liwei810812@gmail.com"
] | liwei810812@gmail.com |
1e6fe88764ba6ac34c0d6f77877431ad8bdaf79c | 1df0f2dd40099cdc146dc82ee353e7ea4e563af2 | /ntree/wldWidget.h | 8d030370ab0d9571c7f90c2c87b8854ca976f0be | [] | no_license | chuckbruno/aphid | 1d0b2637414a03feee91b4c8909dd5d421d229d4 | f07c216f3fda0798ee3f96cd9decb35719098b01 | refs/heads/master | 2021-01-01T18:10:17.713198 | 2017-07-25T02:37:15 | 2017-07-25T02:37:15 | 98,267,729 | 0 | 1 | null | 2017-07-25T05:30:27 | 2017-07-25T05:30:27 | null | UTF-8 | C++ | false | false | 1,417 | h | #ifndef WldWidget_H
#define WldWidget_H
#include <QGLWidget>
#include <Base3DView.h>
#include <KdEngine.h>
#include <ConvexShape.h>
#include <IntersectionContext.h>
#include <HWorldGrid.h>
#include <HAssetGrid.h>
#include <Manager.h>
class WldWidget : public aphid::Base3DView
{
Q_OBJECT
public:
WldWidget(const std::string & filename, QWidget *parent = 0);
~WldWidget();
protected:
virtual void clientInit();
virtual void clientDraw();
virtual void clientSelect(QMouseEvent *event);
virtual void clientDeselect(QMouseEvent *event);
virtual void clientMouseInput(QMouseEvent *event);
virtual void keyPressEvent(QKeyEvent *event);
virtual void keyReleaseEvent(QKeyEvent *event);
virtual void resizeEvent(QResizeEvent * event);
private:
void drawBoxes() const;
void drawTree();
void drawIntersect();
void drawVoxel();
void testIntersect(const aphid::Ray * incident);
void drawActiveSource(const unsigned & iLeaf);
aphid::BoundingBox getFrameBox();
private slots:
private:
aphid::IntersectionContext m_intersectCtx;
typedef aphid::sdb::HAssetGrid<aphid::HTriangleAsset, aphid::cvx::Triangle > InnerGridT;
typedef aphid::sdb::HWorldGrid<InnerGridT, aphid::cvx::Triangle > WorldGridT;
typedef aphid::KdNTree<aphid::Voxel, aphid::KdNode4 > TreeT;
TreeT * m_voxelTree;
aphid::jul::Manager<WorldGridT, InnerGridT, TreeT> m_hio;
};
//! [3]
#endif
| [
"zhangmdev@gmail.com"
] | zhangmdev@gmail.com |
d2abd7bd2767a6a8078f13170aec08415629fdc4 | e5915783daab49e7218fa27e565647278fc46804 | /src/test/hash_tests.cpp | 526efe3fc31637a8b18c0dcdccf698abcf0c55a9 | [
"MIT"
] | permissive | chratos-system/chratos-core | c2d985272c1113c52b79f47bc87de98df586d224 | 26488032eff82a99b99c48bde31d3fbb1863f2f9 | refs/heads/master | 2020-03-19T21:01:08.133304 | 2018-08-11T21:58:39 | 2018-08-11T21:58:39 | 136,926,009 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,370 | cpp | // Copyright (c) 2013-2015 The Bitcoin Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "hash.h"
#include "utilstrencodings.h"
#include "test/test_chratos.h"
#include <vector>
#include <boost/test/unit_test.hpp>
using namespace std;
BOOST_FIXTURE_TEST_SUITE(hash_tests, BasicTestingSetup)
BOOST_AUTO_TEST_CASE(murmurhash3)
{
#define T(expected, seed, data) BOOST_CHECK_EQUAL(MurmurHash3(seed, ParseHex(data)), expected)
// Test MurmurHash3 with various inputs. Of course this is retested in the
// bloom filter tests - they would fail if MurmurHash3() had any problems -
// but is useful for those trying to implement Chratos libraries as a
// source of test data for their MurmurHash3() primitive during
// development.
//
// The magic number 0xFBA4C795 comes from CBloomFilter::Hash()
T(0x00000000, 0x00000000, "");
T(0x6a396f08, 0xFBA4C795, "");
T(0x81f16f39, 0xffffffff, "");
T(0x514e28b7, 0x00000000, "00");
T(0xea3f0b17, 0xFBA4C795, "00");
T(0xfd6cf10d, 0x00000000, "ff");
T(0x16c6b7ab, 0x00000000, "0011");
T(0x8eb51c3d, 0x00000000, "001122");
T(0xb4471bf8, 0x00000000, "00112233");
T(0xe2301fa8, 0x00000000, "0011223344");
T(0xfc2e4a15, 0x00000000, "001122334455");
T(0xb074502c, 0x00000000, "00112233445566");
T(0x8034d2a0, 0x00000000, "0011223344556677");
T(0xb4698def, 0x00000000, "001122334455667788");
#undef T
}
/*
SipHash-2-4 output with
k = 00 01 02 ...
and
in = (empty string)
in = 00 (1 byte)
in = 00 01 (2 bytes)
in = 00 01 02 (3 bytes)
...
in = 00 01 02 ... 3e (63 bytes)
from: https://131002.net/siphash/siphash24.c
*/
uint64_t siphash_4_2_testvec[] = {
0x726fdb47dd0e0e31, 0x74f839c593dc67fd, 0x0d6c8009d9a94f5a, 0x85676696d7fb7e2d,
0xcf2794e0277187b7, 0x18765564cd99a68d, 0xcbc9466e58fee3ce, 0xab0200f58b01d137,
0x93f5f5799a932462, 0x9e0082df0ba9e4b0, 0x7a5dbbc594ddb9f3, 0xf4b32f46226bada7,
0x751e8fbc860ee5fb, 0x14ea5627c0843d90, 0xf723ca908e7af2ee, 0xa129ca6149be45e5,
0x3f2acc7f57c29bdb, 0x699ae9f52cbe4794, 0x4bc1b3f0968dd39c, 0xbb6dc91da77961bd,
0xbed65cf21aa2ee98, 0xd0f2cbb02e3b67c7, 0x93536795e3a33e88, 0xa80c038ccd5ccec8,
0xb8ad50c6f649af94, 0xbce192de8a85b8ea, 0x17d835b85bbb15f3, 0x2f2e6163076bcfad,
0xde4daaaca71dc9a5, 0xa6a2506687956571, 0xad87a3535c49ef28, 0x32d892fad841c342,
0x7127512f72f27cce, 0xa7f32346f95978e3, 0x12e0b01abb051238, 0x15e034d40fa197ae,
0x314dffbe0815a3b4, 0x027990f029623981, 0xcadcd4e59ef40c4d, 0x9abfd8766a33735c,
0x0e3ea96b5304a7d0, 0xad0c42d6fc585992, 0x187306c89bc215a9, 0xd4a60abcf3792b95,
0xf935451de4f21df2, 0xa9538f0419755787, 0xdb9acddff56ca510, 0xd06c98cd5c0975eb,
0xe612a3cb9ecba951, 0xc766e62cfcadaf96, 0xee64435a9752fe72, 0xa192d576b245165a,
0x0a8787bf8ecb74b2, 0x81b3e73d20b49b6f, 0x7fa8220ba3b2ecea, 0x245731c13ca42499,
0xb78dbfaf3a8d83bd, 0xea1ad565322a1a0b, 0x60e61c23a3795013, 0x6606d7e446282b93,
0x6ca4ecb15c5f91e1, 0x9f626da15c9625f3, 0xe51b38608ef25f57, 0x958a324ceb064572
};
BOOST_AUTO_TEST_CASE(siphash)
{
CSipHasher hasher(0x0706050403020100ULL, 0x0F0E0D0C0B0A0908ULL);
BOOST_CHECK_EQUAL(hasher.Finalize(), 0x726fdb47dd0e0e31ull);
static const unsigned char t0[1] = {0};
hasher.Write(t0, 1);
BOOST_CHECK_EQUAL(hasher.Finalize(), 0x74f839c593dc67fdull);
static const unsigned char t1[7] = {1,2,3,4,5,6,7};
hasher.Write(t1, 7);
BOOST_CHECK_EQUAL(hasher.Finalize(), 0x93f5f5799a932462ull);
hasher.Write(0x0F0E0D0C0B0A0908ULL);
BOOST_CHECK_EQUAL(hasher.Finalize(), 0x3f2acc7f57c29bdbull);
static const unsigned char t2[2] = {16,17};
hasher.Write(t2, 2);
BOOST_CHECK_EQUAL(hasher.Finalize(), 0x4bc1b3f0968dd39cull);
static const unsigned char t3[9] = {18,19,20,21,22,23,24,25,26};
hasher.Write(t3, 9);
BOOST_CHECK_EQUAL(hasher.Finalize(), 0x2f2e6163076bcfadull);
static const unsigned char t4[5] = {27,28,29,30,31};
hasher.Write(t4, 5);
BOOST_CHECK_EQUAL(hasher.Finalize(), 0x7127512f72f27cceull);
hasher.Write(0x2726252423222120ULL);
BOOST_CHECK_EQUAL(hasher.Finalize(), 0x0e3ea96b5304a7d0ull);
hasher.Write(0x2F2E2D2C2B2A2928ULL);
BOOST_CHECK_EQUAL(hasher.Finalize(), 0xe612a3cb9ecba951ull);
BOOST_CHECK_EQUAL(SipHashUint256(0x0706050403020100ULL, 0x0F0E0D0C0B0A0908ULL, uint256S("1f1e1d1c1b1a191817161514131211100f0e0d0c0b0a09080706050403020100")), 0x7127512f72f27cceull);
// Check test vectors from spec, one byte at a time
CSipHasher hasher2(0x0706050403020100ULL, 0x0F0E0D0C0B0A0908ULL);
for (uint8_t x=0; x<ARRAYLEN(siphash_4_2_testvec); ++x)
{
BOOST_CHECK_EQUAL(hasher2.Finalize(), siphash_4_2_testvec[x]);
hasher2.Write(&x, 1);
}
// Check test vectors from spec, eight bytes at a time
CSipHasher hasher3(0x0706050403020100ULL, 0x0F0E0D0C0B0A0908ULL);
for (uint8_t x=0; x<ARRAYLEN(siphash_4_2_testvec); x+=8)
{
BOOST_CHECK_EQUAL(hasher3.Finalize(), siphash_4_2_testvec[x]);
hasher3.Write(uint64_t(x)|(uint64_t(x+1)<<8)|(uint64_t(x+2)<<16)|(uint64_t(x+3)<<24)|
(uint64_t(x+4)<<32)|(uint64_t(x+5)<<40)|(uint64_t(x+6)<<48)|(uint64_t(x+7)<<56));
}
}
BOOST_AUTO_TEST_SUITE_END()
| [
"vidaru@protonmail.com"
] | vidaru@protonmail.com |
4910df6bbdb4b9181a4ebba0f6f466e709e74414 | 9ce12679092dfd823f7c62b0e2ea89c93e7fd765 | /Lyapunov.h | 9a1505d88d833ba7af683e10c9bed33ec7018611 | [] | no_license | ksynnott/Lyapunov_Exponent_Calculation_with_Kicks | 0b9a5d0a0cbdfa7c32c526f65374b885d7636b50 | 6f89d58a474bbe6a9dd16f567ccc3c0d8f68e149 | refs/heads/master | 2021-01-21T16:00:37.291908 | 2016-10-25T18:34:57 | 2016-10-25T18:34:57 | 68,705,173 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,167 | h | #ifndef LYAPUNOV_H
#define LYAPUNOV_H
#include "Attach.h"
// This class (will) contain a functional Gram-Schmidt
// orthogonalization procedure.
class Lyapunov{
public:
Lyapunov(); // default constructor
Lyapunov(int NormalSteps, double TimeStepSize, double TransientTime, double TimeEvolution, vector<double> y0, vector<double> p0);
Lyapunov(int NormalSteps, double TimeStepSize, double TransientTime, double TimeEvolution, vector<long double> y0, vector<long double> p0);
Lyapunov(int NormalSteps, double TimeStepSize, double TransientTime, double TimeEvolution, vector<double> y0, vector<vector<double> > p0);
vector<double> CalcManyLypunov(vector<double> (*f_yt)(vector <double> vec, double param), double K);
double CalcBigLypunov_Kick_new(vector<double> (*f_yt)(vector<double> vec), vector<double> (*k_yt)(vector<double> vec, double KickSize), double Kicktime, double kicksize);
double CalcBigLypunov_Kick_new_l(vector<long double> (*f_yt)(vector<long double> vec), vector<long double> (*k_yt)(vector<long double> vec, double KickSize), double Kicktime, double kicksize);
private:
vector<double> x;
vector<double> p;
vector<long double> xl;
vector<long double> pl;
vector<vector<double> > pvol;
int N; // Dim of system
int m; // Number of steps before renormalization
double dt; // Time Steps
double Tran; // Time to settle into attractor
double TimeEvlo; // Time to settle into attractor
double tol;
vector<double> KICK_B(vector<double> ENvec, double kicksize);
vector<double> KICK_C(vector<double> ENvec, double kicksize);
vector<long double> KICK_B(vector<long double> ENvec, double kicksize);
vector<long double> KICK_C(vector<long double> ENvec, double kicksize);
vector<long double> KICK_B_Pert(vector<long double> ENvec, double kicksize);
vector <double> normalize(vector<double> v);
vector <long double> normalize(vector<long double> v);
vector <double> normalize_P_only(vector<double> p);
double GetNorm(vector<double> v);
long double GetNorm(vector<long double> v);
double GetVol(vector<vector<long double> > v, int i);
void LookForConvergence(double m, vector<double> alphas);
};
#endif | [
"k.synnott16@imperial.ac.uk"
] | k.synnott16@imperial.ac.uk |
63142522416bf17723dda13134b48fb78c1558b3 | a6dae9c44a649a046ef8a5d5cfd3e425e9d800b0 | /CDetection.cpp | c8e54c919f58eeb31fa5bb03895da616f8d325e9 | [] | no_license | noypi/blinker | 7e956644e660d277090ea48222de21189432b08a | 2dc7fdf2a630d72f5779648613bf32555992324b | refs/heads/master | 2021-01-16T18:31:57.035190 | 2015-04-07T13:37:51 | 2015-04-07T13:37:51 | 33,545,161 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,730 | cpp | #include "stdafx.h"
#include "CDetection.h"
#include <iostream>
using namespace std;
CDetection::CDetection() {
cascade_face = (CvHaarClassifierCascade*)0;
blinkDetector = new BlinkDetection();
rFace = (CvRect*)0;
rEyes = (vector<CvRect*>)0;
loadHaarClassifier();
}
CDetection::~CDetection() {
if (cascade_face)
cvReleaseHaarClassifierCascade(&cascade_face);
if(blinkDetector)
delete blinkDetector;
}
bool CDetection::detectBlink(IplImage* frame ) {
if(!frame)
return false;
return detectBlink( frame,
detectEyes(frame) );
}
bool CDetection::detectBlink(IplImage* frame, vector<CvRect*> eyes) {
if(eyes == (vector<CvRect*>)0)
eyes = detectEyes(frame);
if(!frame )
return false;
return blinkDetector->detect( frame, eyes );
}
IplImage* CDetection::detectVideo(IplImage* frame) {
CvRect* face = (CvRect*)0;
vector<CvRect*> eyes = (vector<CvRect*>)0;
if( !frame )
return frame;
face = detectFace( frame );
if (face) {
cvRectangle( frame,
cvPoint(face->x,face->y),
cvPoint((face->x+face->width),(face->y+face->height)),
CV_RGB(255,0,0), 3 ); // blue, rectangle for face
rFace = face;
} else {
rFace = (CvRect*)0;
}
eyes = detectEyes( frame, face );
if(eyes != (vector<CvRect*>)0) {
if ( eyes.at(0) ) {
/*cvRectangle( frame,
cvPoint(eyes.at(0)->x,eyes.at(0)->y),
cvPoint((eyes.at(0)->x+eyes.at(0)->width),(eyes.at(0)->y+eyes.at(0)->height)),
CV_RGB(0,255,0), 3 );*/
}
if ( eyes.at(1) ) {
/*cvRectangle( frame,
cvPoint(eyes.at(1)->x,eyes.at(1)->y),
cvPoint((eyes.at(1)->x+eyes.at(1)->width),(eyes.at(1)->y+eyes.at(1)->height)),
CV_RGB(0,255,0), 3 );*/
}
rEyes = eyes;
}else {
rEyes = (vector<CvRect*>)0;
}
return frame;
}
vector<CvRect*> CDetection::detectEyes( IplImage* frame, CvRect* rFace ) {
vector<CvRect*> vEyes = (vector<CvRect*>)0;
CvRect* lRect = (CvRect*)0;
CvRect* rRect = (CvRect*)0;
float x, y, width, height;
if ( !frame || !rFace)
return (vector<CvRect*>)0;
// left eye
x = rFace->x + rFace->width*0.125;
y = rFace->y + rFace->height*0.25;
width = (rFace->x + rFace->width*0.45) - x;
height = (rFace->y + rFace->height*0.5) - y;
lRect = new CvRect();
lRect->x = x;
lRect->y = y;
lRect->width = width;
lRect->height = height;
// right eye
x = rFace->x + rFace->width*0.55;
y = rFace->y + rFace->height*0.25;
width = (rFace->x + rFace->width*0.875) - x;
height = (rFace->y + rFace->height*0.5) - y;
rRect = new CvRect();
rRect->x = x;
rRect->y = y;
rRect->width = width;
rRect->height = height;
vEyes = vector<CvRect*>();
vEyes.insert(vEyes.begin(),rRect);
vEyes.insert(vEyes.begin(),lRect);
return vEyes;
}
vector<CvRect*> CDetection::detectEyes( IplImage* frame ) {
if ( !frame )
return (vector<CvRect*>)0;
return detectEyes( frame, detectFace(frame) );
}
bool CDetection::loadHaarClassifier() {
if (cascade_face)
cvReleaseHaarClassifierCascade( &cascade_face );
cascade_face = (CvHaarClassifierCascade*) cvLoad( CASC_FACE, 0, 0, 0);
if ( !cascade_face ) {
fl_alert( "Error: Could not load cascade face classifier!" );
return false;
}
return true;
}
CvRect* CDetection::detectFace( IplImage* frame ) {
CvRect* rFace = (CvRect*)0;
CvRect* rect = (CvRect*)0;
CvSeq* faces = (CvSeq*)0;
CvMemStorage* storage = (CvMemStorage*)0;
IplImage* img_help = (IplImage*)0;
int pos = 0;
int size = 0;
int help = 0;
int scale_factor = 3;
if(frame && cascade_face) {
if(storage)
cvClearMemStorage( storage );
storage = cvCreateMemStorage(0);
// speed up detection by performing on smaller image
img_help = cvCreateImage( cvSize(frame->width/scale_factor,frame->height/scale_factor), IPL_DEPTH_8U, 3 );
cvResize( frame, img_help, CV_INTER_LINEAR );
faces = cvHaarDetectObjects( img_help, cascade_face, storage, 1.2, 2,
CV_HAAR_DO_CANNY_PRUNING, cvSize(30, 30) );
// faces in frame detected
if ( faces->total != 0 ) {
// select largest rectangle
for ( int i = 0; i < (faces ? faces->total : 0); i++) {
rect = (CvRect*)cvGetSeqElem( faces, i );
help = 2*rect->height + 2*rect->width;
if ( help > size ) {
pos = i;
size = help;
}
}
rFace = (CvRect*)cvGetSeqElem( faces, pos );
// resize rectangle
rFace->height *= scale_factor;
rFace->width *= scale_factor;
rFace->x *= scale_factor;
rFace->y *= scale_factor;
}
}
if (storage)
cvClearMemStorage( storage );
if (img_help)
cvReleaseImage(&img_help);
return rFace;
}
CvHistogram* CDetection::createHist( const IplImage* img ) {
int hdims = 16;
float hranges_arr[] = {0,180};
float * hranges = hranges_arr;
CvHistogram* hist = 0;
IplImage *hue = 0;
IplImage *sat = 0;
IplImage *val = 0;
IplImage *_img = 0;
if(img) {
_img = cvCreateImage( cvGetSize( img ), img->depth, img->nChannels );
cvCopyImage(img,_img);
// convert from BGR to HSV
cvCvtColor(_img, _img, CV_BGR2HSV);
hue = cvCreateImage(cvGetSize(_img), IPL_DEPTH_8U, 1);
sat = cvCreateImage(cvGetSize(_img), IPL_DEPTH_8U, 1);
val = cvCreateImage(cvGetSize(_img), IPL_DEPTH_8U, 1);
hist = cvCreateHist( 1, &hdims, CV_HIST_ARRAY, &hranges, 1 );
cvCvtPixToPlane( _img, hue, sat, val, 0 );
cvCalcHist( &hue, hist );
cvNormalizeHist( hist, 1000 );
// release
if(hue)cvReleaseImage(&hue);
if(sat)cvReleaseImage(&sat);
if(val)cvReleaseImage(&val);
if(_img)cvReleaseImage(&_img);
}
return hist;
}
| [
"agnes.wojdecka@2a6e18b2-c867-11de-9d4f-f947ee5921c8"
] | agnes.wojdecka@2a6e18b2-c867-11de-9d4f-f947ee5921c8 |
7461d868bf3dd5f617a76b07a86d1718ce8dde53 | da1bbdd3b7ed46b9453fc9128ba6bacf2b2473a2 | /cpp/iedriver/VariantUtilities.cpp | 6dcfbd8d3941e4325e335ebdd1030133794897bf | [
"Apache-2.0"
] | permissive | maneesh-ms/selenium | dcafbae1cda5fc8d624ea2a3f7d5e237afdae0cb | 84a0299f56ad5192b3135509fe9e9e60f56c7f02 | refs/heads/master | 2020-04-18T22:39:28.209799 | 2019-01-27T12:14:38 | 2019-01-27T12:14:38 | 167,800,506 | 0 | 0 | null | 2019-01-27T11:20:29 | 2019-01-27T11:20:29 | null | UTF-8 | C++ | false | false | 20,079 | cpp | // Licensed to the Software Freedom Conservancy (SFC) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The SFC 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 "VariantUtilities.h"
#include "errorcodes.h"
#include "json.h"
#include "logging.h"
#include "Element.h"
#include "IECommandExecutor.h"
#include "Script.h"
#include "StringUtilities.h"
namespace webdriver {
VariantUtilities::VariantUtilities(void) {
}
VariantUtilities::~VariantUtilities(void) {
}
bool VariantUtilities::VariantIsString(VARIANT value) {
return value.vt == VT_BSTR;
}
bool VariantUtilities::VariantIsInteger(VARIANT value) {
return value.vt == VT_I4 || value.vt == VT_I8;
}
bool VariantUtilities::VariantIsDouble(VARIANT value) {
return value.vt == VT_R4 || value.vt == VT_R8;
}
bool VariantUtilities::VariantIsBoolean(VARIANT value) {
return value.vt == VT_BOOL;
}
bool VariantUtilities::VariantIsEmpty(VARIANT value) {
return value.vt == VT_EMPTY;
}
bool VariantUtilities::VariantIsIDispatch(VARIANT value) {
return value.vt == VT_DISPATCH;
}
bool VariantUtilities::VariantIsElementCollection(VARIANT value) {
if (value.vt == VT_DISPATCH) {
CComPtr<IHTMLElementCollection> is_collection;
value.pdispVal->QueryInterface<IHTMLElementCollection>(&is_collection);
if (is_collection) {
return true;
}
}
return false;
}
bool VariantUtilities::VariantIsElement(VARIANT value) {
if (value.vt == VT_DISPATCH) {
CComPtr<IHTMLElement> is_element;
value.pdispVal->QueryInterface<IHTMLElement>(&is_element);
if (is_element) {
return true;
}
}
return false;
}
bool VariantUtilities::VariantIsArray(VARIANT value) {
if (value.vt != VT_DISPATCH) {
return false;
}
std::wstring type_name = GetVariantObjectTypeName(value);
// If the name is DispStaticNodeList, we can be pretty sure it's an array
// (or at least has array semantics). It is unclear to what extent checking
// for DispStaticNodeList is supported behaviour.
if (type_name == L"DispStaticNodeList") {
LOG(DEBUG) << "Result type is DispStaticNodeList";
return true;
}
// If the name is JScriptTypeInfo then this *may* be a Javascript array.
// Note that strictly speaking, to determine if the result is *actually*
// a JavaScript array object, we should also be testing to see if
// propertyIsEnumerable('length') == false, but that does not find the
// array-like objects returned by some of the calls we make to the Google
// Closure library.
// IMPORTANT: Using this script, user-defined objects with a length
// property defined will be seen as arrays instead of objects.
if (type_name == L"JScriptTypeInfo" || type_name == L"") {
LOG(DEBUG) << "Result type is JScriptTypeInfo";
LPOLESTR length_property_name = L"length";
DISPID dispid_length = 0;
HRESULT hr = value.pdispVal->GetIDsOfNames(IID_NULL,
&length_property_name,
1,
LOCALE_USER_DEFAULT,
&dispid_length);
if (SUCCEEDED(hr)) {
return true;
}
}
return false;
}
bool VariantUtilities::VariantIsObject(VARIANT value) {
if (value.vt != VT_DISPATCH) {
return false;
}
std::wstring type_name = GetVariantObjectTypeName(value);
if (type_name == L"JScriptTypeInfo") {
return true;
}
return false;
}
int VariantUtilities::VariantAsJsonValue(IElementManager* element_manager,
VARIANT variant_value,
Json::Value* value) {
std::vector<IDispatch*> visited;
if (HasSelfReferences(variant_value, &visited)) {
return EUNEXPECTEDJSERROR;
}
return ConvertVariantToJsonValue(element_manager, variant_value, value);
}
bool VariantUtilities::HasSelfReferences(VARIANT current_object,
std::vector<IDispatch*>* visited) {
int status_code = WD_SUCCESS;
bool has_self_references = false;
if (VariantIsArray(current_object) || VariantIsObject(current_object)) {
std::vector<std::wstring> property_names;
if (VariantIsArray(current_object)) {
long length = 0;
status_code = GetArrayLength(current_object.pdispVal, &length);
for (long index = 0; index < length; ++index) {
std::wstring index_string = std::to_wstring(static_cast<long long>(index));
property_names.push_back(index_string);
}
} else {
status_code = GetPropertyNameList(current_object.pdispVal,
&property_names);
}
visited->push_back(current_object.pdispVal);
for (size_t i = 0; i < property_names.size(); ++i) {
CComVariant property_value;
GetVariantObjectPropertyValue(current_object.pdispVal,
property_names[i],
&property_value);
if (VariantIsIDispatch(property_value)) {
for (size_t i = 0; i < visited->size(); ++i) {
CComPtr<IDispatch> visited_dispatch((*visited)[i]);
if (visited_dispatch.IsEqualObject(property_value.pdispVal)) {
return true;
}
}
has_self_references = has_self_references || HasSelfReferences(property_value, visited);
if (has_self_references) {
break;
}
}
}
visited->pop_back();
}
return has_self_references;
}
int VariantUtilities::ConvertVariantToJsonValue(IElementManager* element_manager,
VARIANT variant_value,
Json::Value* value) {
int status_code = WD_SUCCESS;
if (VariantIsString(variant_value)) {
std::string string_value = "";
if (variant_value.bstrVal) {
std::wstring bstr_value = variant_value.bstrVal;
StringUtilities::DecomposeUnicodeString(&bstr_value);
string_value = StringUtilities::ToString(bstr_value);
}
*value = string_value;
} else if (VariantIsInteger(variant_value)) {
*value = variant_value.lVal;
} else if (VariantIsDouble(variant_value)) {
double int_part;
if (std::modf(variant_value.dblVal, &int_part) == 0.0) {
// This bears some explaining. Due to inconsistencies between versions
// of the JSON serializer we use, if the value is floating-point, but
// has no fractional part, convert it to a 64-bit integer so that it
// will be serialized in a way consistent with language bindings'
// expectations.
*value = static_cast<long long>(int_part);
} else {
*value = variant_value.dblVal;
}
} else if (VariantIsBoolean(variant_value)) {
*value = variant_value.boolVal == VARIANT_TRUE;
} else if (VariantIsEmpty(variant_value)) {
*value = Json::Value::null;
} else if (variant_value.vt == VT_NULL) {
*value = Json::Value::null;
} else if (VariantIsIDispatch(variant_value)) {
if (VariantIsArray(variant_value) ||
VariantIsElementCollection(variant_value)) {
Json::Value result_array(Json::arrayValue);
long length = 0;
status_code = GetArrayLength(variant_value.pdispVal, &length);
if (status_code != WD_SUCCESS) {
LOG(WARN) << "Did not successfully get array length.";
return EUNEXPECTEDJSERROR;
}
for (long i = 0; i < length; ++i) {
CComVariant array_item;
int array_item_status = GetArrayItem(variant_value.pdispVal,
i,
&array_item);
if (array_item_status != WD_SUCCESS) {
LOG(WARN) << "Did not successfully get item with index "
<< i << " from array.";
return EUNEXPECTEDJSERROR;
}
Json::Value array_item_result;
ConvertVariantToJsonValue(element_manager,
array_item,
&array_item_result);
result_array[i] = array_item_result;
}
*value = result_array;
} else if (VariantIsObject(variant_value)) {
Json::Value result_object;
CComVariant json_serialized;
if (ExecuteToJsonMethod(variant_value, &json_serialized)) {
ConvertVariantToJsonValue(element_manager, json_serialized, &result_object);
} else {
std::vector<std::wstring> property_names;
GetPropertyNameList(variant_value.pdispVal, &property_names);
for (size_t i = 0; i < property_names.size(); ++i) {
CComVariant property_value_variant;
bool property_value_retrieved =
GetVariantObjectPropertyValue(variant_value.pdispVal,
property_names[i],
&property_value_variant);
if (!property_value_retrieved) {
LOG(WARN) << "Did not successfully get value for property '"
<< StringUtilities::ToString(property_names[i])
<< "' from object.";
return EUNEXPECTEDJSERROR;
}
Json::Value property_value;
ConvertVariantToJsonValue(element_manager,
property_value_variant,
&property_value);
std::string name = StringUtilities::ToString(property_names[i]);
result_object[name] = property_value;
}
}
*value = result_object;
} else {
CComPtr<IHTMLElement> node;
HRESULT hr = variant_value.pdispVal->QueryInterface<IHTMLElement>(&node);
if (FAILED(hr)) {
LOG(DEBUG) << "Unknown type of dispatch not IHTMLElement, checking for IHTMLWindow2";
CComPtr<IHTMLWindow2> window_node;
hr = variant_value.pdispVal->QueryInterface<IHTMLWindow2>(&window_node);
if (SUCCEEDED(hr) && window_node) {
// TODO: We need to track window objects and return a custom JSON
// object according to the spec, but that will require a fair
// amount of refactoring.
LOG(WARN) << "Returning window object from JavaScript is not supported";
return EUNEXPECTEDJSERROR;
}
LOG(DEBUG) << "Unknown type of dispatch not IHTMLWindow2, checking for toJSON function";
CComVariant json_serialized_variant;
if (ExecuteToJsonMethod(variant_value, &json_serialized_variant)) {
Json::Value interim_value;
ConvertVariantToJsonValue(element_manager,
json_serialized_variant,
&interim_value);
*value = interim_value;
return WD_SUCCESS;
}
// We've already done our best to check if the object is an array or
// an object. We now know it doesn't implement IHTMLElement. We have
// no choice but to throw up our hands here.
LOG(WARN) << "Dispatch value is not recognized as a JavaScript object, array, or element reference";
return EUNEXPECTEDJSERROR;
}
ElementHandle element_wrapper;
bool element_added = element_manager->AddManagedElement(node, &element_wrapper);
Json::Value element_value(Json::objectValue);
element_value[JSON_ELEMENT_PROPERTY_NAME] = element_wrapper->element_id();
*value = element_value;
}
} else {
LOG(WARN) << "Unknown type of result is found";
status_code = EUNKNOWNSCRIPTRESULT;
}
return status_code;
}
bool VariantUtilities::ExecuteToJsonMethod(VARIANT object_to_serialize,
VARIANT* json_object_variant) {
CComVariant to_json_method;
bool has_to_json_property = GetVariantObjectPropertyValue(object_to_serialize.pdispVal,
L"toJSON",
&to_json_method);
if (!has_to_json_property) {
LOG(DEBUG) << "No toJSON property found on IDispatch";
return false;
}
// Grab the "call" method out of the returned function
DISPID call_member_id;
OLECHAR FAR* call_member_name = L"call";
HRESULT hr = to_json_method.pdispVal->GetIDsOfNames(IID_NULL,
&call_member_name,
1,
LOCALE_USER_DEFAULT,
&call_member_id);
if (FAILED(hr)) {
LOGHR(WARN, hr) << "Cannot locate call method on toJSON function";
return false;
}
// IDispatch::Invoke() expects the arguments to be passed into it
// in reverse order. To accomplish this, we create a new variant
// array of size n + 1 where n is the number of arguments we have.
// we copy each element of arguments_array_ into the new array in
// reverse order, and add an extra argument, the window object,
// to the end of the array to use as the "this" parameter for the
// function invocation.
std::vector<CComVariant> argument_array(1);
argument_array[0].Copy(&object_to_serialize);
DISPPARAMS call_parameters = { 0 };
memset(&call_parameters, 0, sizeof call_parameters);
call_parameters.cArgs = static_cast<unsigned int>(argument_array.size());
call_parameters.rgvarg = &argument_array[0];
CComBSTR error_description = L"";
int return_code = WD_SUCCESS;
EXCEPINFO exception;
memset(&exception, 0, sizeof exception);
hr = to_json_method.pdispVal->Invoke(call_member_id,
IID_NULL,
LOCALE_USER_DEFAULT,
DISPATCH_METHOD,
&call_parameters,
json_object_variant,
&exception,
0);
if (FAILED(hr)) {
if (DISP_E_EXCEPTION == hr) {
error_description = exception.bstrDescription ? exception.bstrDescription : L"EUNEXPECTEDJSERROR";
CComBSTR error_source(exception.bstrSource ? exception.bstrSource : L"EUNEXPECTEDJSERROR");
LOG(INFO) << "Exception message was: '" << error_description << "'";
LOG(INFO) << "Exception source was: '" << error_source << "'";
}
else {
LOGHR(DEBUG, hr) << "Failed to execute anonymous function, no exception information retrieved";
}
return false;
}
return true;
}
bool VariantUtilities::GetVariantObjectPropertyValue(IDispatch* variant_object_dispatch,
std::wstring property_name,
VARIANT* property_value) {
LPOLESTR property_name_pointer = reinterpret_cast<LPOLESTR>(const_cast<wchar_t*>(property_name.data()));
DISPID dispid_property;
HRESULT hr = variant_object_dispatch->GetIDsOfNames(IID_NULL,
&property_name_pointer,
1,
LOCALE_USER_DEFAULT,
&dispid_property);
if (FAILED(hr)) {
// Only log failures to find dispid to debug level, not warn level.
// Querying for the existence of a property is a normal thing to
// want to accomplish.
LOGHR(DEBUG, hr) << "Unable to get dispatch ID (dispid) for property "
<< StringUtilities::ToString(property_name);
return false;
}
// get the value of eval result
DISPPARAMS no_args_dispatch_parameters = { 0 };
hr = variant_object_dispatch->Invoke(dispid_property,
IID_NULL,
LOCALE_USER_DEFAULT,
DISPATCH_PROPERTYGET,
&no_args_dispatch_parameters,
property_value,
NULL,
NULL);
if (FAILED(hr)) {
LOGHR(WARN, hr) << "Unable to get result for property "
<< StringUtilities::ToString(property_name);
return false;
}
return true;
}
std::wstring VariantUtilities::GetVariantObjectTypeName(VARIANT value) {
std::wstring name = L"";
if (value.vt == VT_DISPATCH && value.pdispVal) {
CComPtr<ITypeInfo> typeinfo;
HRESULT get_type_info_result = value.pdispVal->GetTypeInfo(0,
LOCALE_USER_DEFAULT,
&typeinfo);
TYPEATTR* type_attr;
CComBSTR name_bstr;
if (SUCCEEDED(get_type_info_result) &&
SUCCEEDED(typeinfo->GetTypeAttr(&type_attr)) &&
SUCCEEDED(typeinfo->GetDocumentation(-1, &name_bstr, 0, 0, 0))) {
typeinfo->ReleaseTypeAttr(type_attr);
name = name_bstr.Copy();
} else {
LOG(WARN) << "Unable to get object type";
}
} else {
LOG(DEBUG) << "Unable to get object type for non-object result, result is not IDispatch or IDispatch pointer is NULL";
}
return name;
}
int VariantUtilities::GetPropertyNameList(IDispatch* object_dispatch,
std::vector<std::wstring>* property_names) {
LOG(TRACE) << "Entering Script::GetPropertyNameList";
CComPtr<IDispatchEx> dispatchex;
HRESULT hr = object_dispatch->QueryInterface<IDispatchEx>(&dispatchex);
DISPID current_disp_id;
hr = dispatchex->GetNextDispID(fdexEnumAll,
DISPID_STARTENUM,
¤t_disp_id);
while (hr == S_OK) {
CComBSTR member_name_bstr;
dispatchex->GetMemberName(current_disp_id, &member_name_bstr);
std::wstring member_name = member_name_bstr;
property_names->push_back(member_name);
hr = dispatchex->GetNextDispID(fdexEnumAll,
current_disp_id,
¤t_disp_id);
}
return WD_SUCCESS;
}
int VariantUtilities::GetArrayLength(IDispatch* array_dispatch, long* length) {
LOG(TRACE) << "Entering Script::GetArrayLength";
CComVariant length_result;
bool get_length_success = GetVariantObjectPropertyValue(array_dispatch,
L"length",
&length_result);
if (!get_length_success) {
// Failure already logged by GetVariantObjectPropertyValue
return EUNEXPECTEDJSERROR;
}
*length = length_result.lVal;
return WD_SUCCESS;
}
int VariantUtilities::GetArrayItem(IDispatch* array_dispatch,
long index,
VARIANT* item){
LOG(TRACE) << "Entering Script::GetArrayItem";
std::wstring index_string = std::to_wstring(static_cast<long long>(index));
CComVariant array_item_variant;
bool get_array_item_success = GetVariantObjectPropertyValue(array_dispatch,
index_string,
item);
if (!get_array_item_success) {
// Failure already logged by GetVariantObjectPropertyValue
return EUNEXPECTEDJSERROR;
}
return WD_SUCCESS;
}
} // namespace webdriver
| [
"james.h.evans.jr@gmail.com"
] | james.h.evans.jr@gmail.com |
8a0d87c99502784bddb1e380c5a54ea945569569 | 2600488d150a793a203aca78e051531677447ade | /phashtable/phashtable.h | f48c70ecd1e7697f2ab633619a2e7c4044fdab8f | [] | no_license | nmfanguy/pcollections | 012e4ba89adcea0997e1c89ee9e841af779fe1ce | a967e55e6602ac9963c05702be0e167065f23b33 | refs/heads/master | 2023-08-27T17:21:53.711455 | 2021-11-11T02:44:11 | 2021-11-11T02:44:11 | 422,963,066 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,269 | h | #ifndef _PHASHTABLE_H
#define _PHASHTABLE_H
#include <iostream>
#include <libpmemobj++/make_persistent.hpp>
#include <libpmemobj++/persistent_ptr.hpp>
#include <libpmemobj++/transaction.hpp>
#include <stdexcept>
#include "../pvector/pvector.h"
#include "../plist/plist.h"
using namespace pmem;
using namespace pmem::obj;
static const unsigned int max_prime = 1301081;
static const unsigned int default_capacity = 11;
// the pair struct for a Key-Value pair that is the basis for the hash table
template <typename KEY_T, typename VAL_T>
struct ppair {
p<KEY_T> key;
p<VAL_T> val;
};
template<typename KEY_T, typename VAL_T, typename ROOT_T>
class phashtable {
private:
persistent_ptr<pvector<plist<ppair<KEY_T, VAL_T>, ROOT_T>, ROOT_T>> data;
p<int> len;
pool<ROOT_T> pop;
persistent_ptr<std::hash<KEY_T>> hash_function;
// helper functions
void rehash();
int hash(const KEY_T&) const;
unsigned long prime_below(unsigned long);
void set_primes(std::vector<bool>&);
public:
// Constructors
phashtable(pool<ROOT_T>);
// Operator Overloads
// Push/Pop
// Get/Set
int get_length() const;
// Misc.
void refresh_pool(pool<ROOT_T>);
void destroy();
};
#include "phashtable.hpp"
#endif | [
"trashemail430@gmail.com"
] | trashemail430@gmail.com |
f443ff93846e062179b58258bb7b06cf1374acae | c327cf66dcd08a3201d27c3b6e5188bb334669a1 | /TextContainer.h | 36384931f0f78241ba6a1e6978a50fe454a572da | [] | no_license | cristo512/SFML_2.3 | 4def75ccd2806f3e99405e3cf5f56f772c3ec293 | 7ecd9729a44081fb7cdd2214bcf499e3773b8360 | refs/heads/master | 2021-03-12T20:01:29.466759 | 2015-05-28T20:44:07 | 2015-05-28T20:44:07 | 36,464,909 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 665 | h | #pragma once
#include <SFML/Graphics.hpp>
#include <vector>
#include "Game.h"
class TextContainer
{
public:
TextContainer();
~TextContainer(void);
void init();
void addLine(std::string string);
void draw();
void setPosition(float x, float y);
void setString(unsigned int it, std::string newText);
void setColors(sf::Color mouseOn, sf::Color mouseOut);
sf::Text getText(unsigned int it);
int onMouseOver();
private:
bool defaultSettings;
void normalize();
void update();
sf::Font font;
sf::Vector2f position;
sf::Vector2f size;
std::vector<sf::Text> text;
sf::Color mouseOnColor;
sf::Color mouseOutColor;
float textSpace;
float textHeight;
};
| [
"cristo512@o2.pl"
] | cristo512@o2.pl |
4450e5dc773a90bbde525daf535c66afb8ca37cc | aec312f7892374a123f29400d411323d86341372 | /src/core/devDriverUtil.cpp | 1f112ad8bd901b0c23f4eb0b3ecb04152db11af6 | [
"MIT"
] | permissive | FelixBellaby/pal | 1bda0e122cdbcbb846f921ba17ac88ae5310a6d2 | 3ce3d9a004e8ed15134567c0fd800ee81916b423 | refs/heads/master | 2021-01-24T00:14:50.251555 | 2018-04-06T18:40:14 | 2018-04-09T07:47:09 | 122,757,786 | 0 | 0 | null | 2018-02-24T16:29:46 | 2018-02-24T16:29:45 | null | UTF-8 | C++ | false | false | 17,375 | cpp | /*
***********************************************************************************************************************
*
* Copyright (c) 2016-2018 Advanced Micro Devices, Inc. All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*
**********************************************************************************************************************/
#include "core/devDriverUtil.h"
#include "core/device.h"
#include "palHashMapImpl.h"
#include "palJsonWriter.h"
#include "devDriverServer.h"
#include "protocols/driverControlServer.h"
#include "ddTransferManager.h"
using namespace Util;
namespace Pal
{
// Size required to hold a hash text string and null terminator.
static const uint32 HashStringBufferSize = 19;
// Lookup table for binary to hex string conversion.
static const char HexStringLookup[] = "0123456789ABCDEF";
// =====================================================================================================================
// Helper function which converts an array of bytes into a hex string.
void ConvertToHexString(
char* pDstBuffer,
const uint8* pSrcBuffer,
size_t srcBufferSize)
{
// Two characters for each byte in hex plus null terminator
const size_t numTextBytes = (srcBufferSize * 2) + 1;
// Build a hex string in the destination buffer.
for (uint32 byteIndex = 0; byteIndex < srcBufferSize; ++byteIndex)
{
const size_t bufferOffset = (byteIndex * 2);
char* pBufferStart = pDstBuffer + bufferOffset;
const uint8 byteValue = pSrcBuffer[byteIndex];
pBufferStart[0] = HexStringLookup[byteValue >> 4];
pBufferStart[1] = HexStringLookup[byteValue & 0x0F];
}
// Null terminate the string
pDstBuffer[numTextBytes - 1] = '\0';
}
// =====================================================================================================================
// An JsonStream implementation that writes json data directly to a developer driver transfer block.
class BlockJsonStream : public Util::JsonStream
{
public:
explicit BlockJsonStream(
DevDriver::TransferProtocol::LocalBlock* pBlock)
:
m_pBlock(pBlock) {}
virtual ~BlockJsonStream() {}
virtual void WriteString(
const char* pString,
uint32 length) override
{
m_pBlock->Write(reinterpret_cast<const DevDriver::uint8*>(pString), length);
}
virtual void WriteCharacter(
char character) override
{
m_pBlock->Write(reinterpret_cast<const DevDriver::uint8*>(&character), 1);
}
private:
DevDriver::TransferProtocol::LocalBlock* m_pBlock;
PAL_DISALLOW_COPY_AND_ASSIGN(BlockJsonStream);
PAL_DISALLOW_DEFAULT_CTOR(BlockJsonStream);
};
// =====================================================================================================================
// DevDriver DeviceClockMode to Pal::DeviceClockMode table
static DeviceClockMode PalDeviceClockModeTable[] =
{
DeviceClockMode::Default, // Unknown = 0
DeviceClockMode::Default, // Default = 1
DeviceClockMode::Profiling, // Profiling = 2
DeviceClockMode::MinimumMemory, // MinimumMemory = 3
DeviceClockMode::MinimumEngine, // MinimumEngine = 4
DeviceClockMode::Peak // Peak = 5
};
// =====================================================================================================================
// Callback function which returns the current device clock for the requested gpu.
DevDriver::Result QueryClockCallback(
uint32 gpuIndex,
float* pGpuClock,
float* pMemClock,
void* pUserData)
{
Platform* pPlatform = reinterpret_cast<Platform*>(pUserData);
DevDriver::Result result = DevDriver::Result::Error;
Device* pPalDevice = nullptr;
if (gpuIndex < pPlatform->GetDeviceCount())
{
pPalDevice = pPlatform->GetDevice(gpuIndex);
}
if (pPalDevice != nullptr)
{
const GpuChipProperties& chipProps = pPalDevice->ChipProperties();
SetClockModeInput clockModeInput = {};
clockModeInput.clockMode = DeviceClockMode::Query;
SetClockModeOutput clockModeOutput = {};
Result palResult = pPalDevice->SetClockMode(clockModeInput, &clockModeOutput);
if (palResult == Result::Success)
{
*pGpuClock = (static_cast<float>(chipProps.maxEngineClock) * clockModeOutput.engineClockRatioToPeak);
*pMemClock = (static_cast<float>(chipProps.maxMemoryClock) * clockModeOutput.memoryClockRatioToPeak);
result = DevDriver::Result::Success;
}
}
return result;
}
// =====================================================================================================================
// Callback function which returns the max device clock for the requested gpu.
DevDriver::Result QueryMaxClockCallback(
uint32 gpuIndex,
float* pGpuClock,
float* pMemClock,
void* pUserData)
{
Platform* pPlatform = reinterpret_cast<Platform*>(pUserData);
DevDriver::Result result = DevDriver::Result::Error;
Device* pPalDevice = nullptr;
if (gpuIndex < pPlatform->GetDeviceCount())
{
pPalDevice = pPlatform->GetDevice(gpuIndex);
}
if (pPalDevice != nullptr)
{
const GpuChipProperties& chipProps = pPalDevice->ChipProperties();
*pGpuClock = static_cast<float>(chipProps.maxEngineClock);
*pMemClock = static_cast<float>(chipProps.maxMemoryClock);
result = DevDriver::Result::Success;
}
return result;
}
// =====================================================================================================================
// Callback function which sets the current device clock mode for the requested gpu.
DevDriver::Result SetClockModeCallback(
uint32 gpuIndex,
DevDriver::DriverControlProtocol::DeviceClockMode clockMode,
void* pUserData)
{
Platform* pPlatform = reinterpret_cast<Platform*>(pUserData);
DevDriver::Result result = DevDriver::Result::Error;
Device* pPalDevice = nullptr;
if (gpuIndex < pPlatform->GetDeviceCount())
{
pPalDevice = pPlatform->GetDevice(gpuIndex);
}
if (pPalDevice != nullptr)
{
// Convert the DevDriver DeviceClockMode enum into a Pal enum
DeviceClockMode palClockMode = PalDeviceClockModeTable[static_cast<uint32>(clockMode)];
SetClockModeInput clockModeInput = {};
clockModeInput.clockMode = palClockMode;
Result palResult = pPalDevice->SetClockMode(clockModeInput, nullptr);
result = (palResult == Result::Success) ? DevDriver::Result::Success : DevDriver::Result::Error;
}
return result;
}
// =====================================================================================================================
// Callback function used to allocate memory inside the developer driver component.
void* DevDriverAlloc(
void* pUserdata,
size_t size,
size_t alignment,
bool zero)
{
Platform* pAllocator = reinterpret_cast<Platform*>(pUserdata);
//NOTE: Alignment is ignored here since PAL always aligns to an entire cache line by default. This shouldn't be an
// issue because no type should require more than a cache line of alignment (64 bytes).
PAL_ASSERT(alignment <= PAL_CACHE_LINE_BYTES);
void* pMemory = zero ? PAL_CALLOC(size, pAllocator, Util::AllocInternal)
: PAL_MALLOC(size, pAllocator, Util::AllocInternal);
return pMemory;
}
// =====================================================================================================================
// Callback function used to free memory inside the developer driver component.
void DevDriverFree(
void* pUserdata,
void* pMemory)
{
Platform* pAllocator = reinterpret_cast<Platform*>(pUserdata);
PAL_FREE(pMemory, pAllocator);
}
// =====================================================================================================================
PipelineDumpService::PipelineDumpService(
Platform* pPlatform)
:
DevDriver::IService(),
m_pPlatform(pPlatform),
m_pipelineRecords(0x4000, pPlatform),
m_maxPipelineBinarySize(0)
{
}
// =====================================================================================================================
PipelineDumpService::~PipelineDumpService()
{
auto iter = m_pipelineRecords.Begin();
while (iter.Get())
{
void* pPipelineBinary = iter.Get()->value.pPipelineBinary;
PAL_ASSERT(pPipelineBinary != nullptr);
PAL_SAFE_FREE(pPipelineBinary, m_pPlatform);
iter.Next();
}
}
// =====================================================================================================================
Result PipelineDumpService::Init()
{
Result result = m_mutex.Init();
if (result == Result::Success)
{
result = m_pipelineRecords.Init();
}
return result;
}
// =====================================================================================================================
// Handles pipeline dump requests from the developer driver bus
DevDriver::Result PipelineDumpService::HandleRequest(
DevDriver::URIRequestContext* pContext)
{
DevDriver::Result result = DevDriver::Result::Error;
if (strcmp(pContext->pRequestArguments, "index") == 0)
{
// The client requested an index of all available pipeline dumps.
BlockJsonStream jsonStream(pContext->pResponseBlock.Get());
JsonWriter jsonWriter(&jsonStream);
jsonWriter.BeginList(false);
m_mutex.Lock();
// Allocate a small buffer on the stack that's exactly large enough for a hex string.
char hashStringBuffer[HashStringBufferSize];
auto iter = m_pipelineRecords.Begin();
while (iter.Get())
{
Util::Snprintf(hashStringBuffer, sizeof(hashStringBuffer), "0x%016llX", iter.Get()->key);
jsonWriter.Value(hashStringBuffer);
iter.Next();
}
m_mutex.Unlock();
jsonWriter.EndList();
result = DevDriver::Result::Success;
}
else if (strcmp(pContext->pRequestArguments, "all") == 0)
{
// The client requested all pipeline dumps.
m_mutex.Lock();
// Allocate enough space to handle the request.
// Two characters for each byte in hex plus null terminator
const uint32 maxNumTextBytes = (m_maxPipelineBinarySize * 2) + 1;
const uint32 scratchMemorySize = Util::Max(HashStringBufferSize, maxNumTextBytes);
void* pScratchMemory = PAL_MALLOC(scratchMemorySize,
m_pPlatform,
AllocInternalTemp);
if (pScratchMemory != nullptr)
{
BlockJsonStream jsonStream(pContext->pResponseBlock.Get());
JsonWriter jsonWriter(&jsonStream);
jsonWriter.BeginList(false);
auto iter = m_pipelineRecords.Begin();
while (iter.Get())
{
const PipelineRecord* pRecord = &iter.Get()->value;
const uint32 numBytes = pRecord->pipelineBinaryLength;
// Two characters for each byte in hex plus null terminator
const uint32 numTextBytes = (numBytes * 2) + 1;
jsonWriter.BeginMap(false);
Util::Snprintf(reinterpret_cast<char*>(pScratchMemory),
scratchMemorySize,
"0x%016llX",
iter.Get()->key);
jsonWriter.KeyAndValue("hash", reinterpret_cast<char*>(pScratchMemory));
jsonWriter.Key("binary");
// Build a hex string of the pipeline binary data in the scratch buffer.
ConvertToHexString(reinterpret_cast<char*>(pScratchMemory),
reinterpret_cast<const uint8*>(pRecord->pPipelineBinary),
numBytes);
jsonWriter.Value(reinterpret_cast<char*>(pScratchMemory));
jsonWriter.EndMap();
iter.Next();
}
jsonWriter.EndList();
PAL_SAFE_FREE(pScratchMemory, m_pPlatform);
result = DevDriver::Result::Success;
}
m_mutex.Unlock();
}
else
{
// The client requested a specific pipeline dump via the pipeline hash.
m_mutex.Lock();
const uint64 pipelineHash = strtoull(pContext->pRequestArguments, nullptr, 16);
const PipelineRecord* pRecord = m_pipelineRecords.FindKey(pipelineHash);
if (pRecord != nullptr)
{
const uint32 numBytes = pRecord->pipelineBinaryLength;
// Two characters for each byte in hex plus null terminator
const uint32 numTextBytes = (numBytes * 2) + 1;
// Allocate exactly enough memory for the specific pipeline's binary data.
const uint32 scratchMemorySize = Util::Max(HashStringBufferSize, numTextBytes);
void* pScratchMemory = PAL_MALLOC(scratchMemorySize,
m_pPlatform,
AllocInternalTemp);
if (pScratchMemory != nullptr)
{
BlockJsonStream jsonStream(pContext->pResponseBlock.Get());
JsonWriter jsonWriter(&jsonStream);
jsonWriter.BeginMap(false);
Util::Snprintf(reinterpret_cast<char*>(pScratchMemory), scratchMemorySize, "0x%016llX", pipelineHash);
jsonWriter.KeyAndValue("hash", reinterpret_cast<char*>(pScratchMemory));
jsonWriter.Key("binary");
// Build a hex string of the pipeline binary data in the scratch buffer.
ConvertToHexString(reinterpret_cast<char*>(pScratchMemory),
reinterpret_cast<const uint8*>(pRecord->pPipelineBinary),
numBytes);
jsonWriter.Value(reinterpret_cast<char*>(pScratchMemory));
jsonWriter.EndMap();
result = DevDriver::Result::Success;
PAL_FREE(pScratchMemory, m_pPlatform);
}
}
m_mutex.Unlock();
}
return result;
}
// =====================================================================================================================
// Registers a pipeline into the pipeline records map and exposes it to the developer driver bus
void PipelineDumpService::RegisterPipeline(
void* pPipelineBinary,
uint32 pipelineBinaryLength,
uint64 pipelineHash)
{
m_mutex.Lock();
PipelineRecord* pRecord = nullptr;
bool existed = false;
const Util::Result result = m_pipelineRecords.FindAllocate(pipelineHash, &existed, &pRecord);
// We only need to store the pipeline binary if it hasn't been registered already.
// No need to store redundant pipeline data.
// Also make sure we only continue if we successfully allocated memory.
if ((existed == false) && (result == Result::Success))
{
// Allocate memory to store the pipeline binary data in.
pRecord->pPipelineBinary = PAL_MALLOC(pipelineBinaryLength, m_pPlatform, AllocInternal);
// Only continue with the copy if we were able to allocate memory for the pipeline.
if (pRecord->pPipelineBinary != nullptr)
{
// Copy the pipeline binary data into the memory.
memcpy(pRecord->pPipelineBinary, pPipelineBinary, pipelineBinaryLength);
// Save the length.
pRecord->pipelineBinaryLength = pipelineBinaryLength;
// Update the max pipeline binary size.
m_maxPipelineBinarySize = Util::Max(m_maxPipelineBinarySize, pipelineBinaryLength);
}
else
{
// Erase the pipeline record from the map if we fail to allocate memory to store its binary data.
const bool eraseResult = m_pipelineRecords.Erase(pipelineHash);
PAL_ASSERT(eraseResult);
}
}
m_mutex.Unlock();
}
} // Pal
| [
"jacob.he@amd.com"
] | jacob.he@amd.com |
ef6c2e76a37e3cbae8b643b9a9ba10bda7624d4c | a04bd3db8f80193dfa669e1afe20176995c20622 | /source/CAIntel.cpp | 0984c7c2680cf47f346b92736276705cec713d25 | [
"MIT"
] | permissive | prokoptasis/defenders | 527ac29700af9a9910fb47b46373bdf2e83a6d36 | 773fb4ec898d54e76df4cd1a7a6fc16d8f304725 | refs/heads/main | 2023-01-29T03:57:38.855604 | 2020-12-16T13:24:39 | 2020-12-16T13:24:39 | 321,988,934 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,459 | cpp | /////////////////////////////////////////////////////////////////////////////
// Name : CAIntel.cpp
// Desc :
// Date : 2002.11.27
// Mail : jhook@hanmail.net
/////////////////////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////////////////////////////
// INCLUDE
/////////////////////////////////////////////////////////////////////////////
#include "CAIntel.h"
/////////////////////////////////////////////////////////////////////////////
// GLOBAL
/////////////////////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////////////////////////////
// TYPE
/////////////////////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////////////////////////////
// PROTOTYPES
/////////////////////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////////////////////////////
// FUNCTIONS
/////////////////////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////////////////////////////
// Name : CAIntel()
// Desc :
/////////////////////////////////////////////////////////////////////////////
CAIntel::CAIntel()
{
}
CAIntel::~CAIntel()
{
}
HRESULT CAIntel::WayPointWalking()
{
//int i = CDMap::Map[0][0];
return S_OK;
} | [
"c.exigua@gmail.com"
] | c.exigua@gmail.com |
3a6ff3dec77589e3fbcf58ac9b7c28837feb0d2c | 8e79060087307d6d3d7c63a5fb3839d32216b698 | /sim/ConfigReader.h | 35c44f4975f907434c39f17d4f1d04d9df4171f7 | [] | no_license | luomai/gearbox-simulator | e0b6c5d81c0326dcbc076f31254c6b3d060e9109 | 403601b57c92f6396cbfacd033ca1a1a28800933 | refs/heads/master | 2016-09-05T20:59:16.886340 | 2015-01-06T09:28:17 | 2015-01-06T09:28:17 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,359 | h | //
// 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 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU 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, see http://www.gnu.org/licenses/.
//
#ifndef CONFIGREADER_H_
#define CONFIGREADER_H_
#include "Config.h"
#include <fstream>
#include <map>
#include <string>
#include <vector>
#include <boost/algorithm/string.hpp>
using namespace std;
/**
* This is a singleton class read configurations from a file.
* The design pattern is inspired by: http://stackoverflow.com/questions/1008019/c-singleton-design-pattern
*/
class ConfigReader
{
private:
map<string, string> pars;
ConfigReader()
{
ifstream file("./sim_config/config_file");
string line;
vector<string> strs;
if (file.is_open())
{
getline(file, line); // Skip the title line.
cout << "\nSimulator configuration info: " << endl;
while (file.good())
{
getline(file, line);
if (line.find(":") != string::npos)
{
boost::split(strs, line, boost::is_any_of(":"));
if (strs.size() >= 2)
{
string key = strs[0];
string value = strs[1];
cout << ">> " << key << " : " << value << endl;
pars.insert(pair<string, string>(key, value));
}
else
{
cout << "Configuration has errors." << endl;
file.close();
exit(EXIT_FAILURE);
}
strs.clear();
}
else {
// Skip the comments.
cout << line << endl;
}
}
file.close();
}
else
{
cout << "Configuration file ./sim_config/config_file cannot be opened." << endl;
file.close();
exit(EXIT_FAILURE);
}
}
// Don't forget to declare these two. You want to make sure they
// are unaccessible otherwise you may accidently get copies of
// your singleton appearing.
ConfigReader(ConfigReader const&); // Don't implement
void operator=(ConfigReader const&); // Don't implement
public:
static ConfigReader& getInstance()
{
static ConfigReader instance;
return instance;
}
string getVal(const string& key)
{
return pars.find(key)->second;
}
};
#endif /* CONFIGREADER_H_ */
| [
"luo.mai11@imperial.ac.uk"
] | luo.mai11@imperial.ac.uk |
3089cd4cf04b9f8381939ec90d37c1974e405dcd | 163663b9f3e792e2b545d91291ea51f63f3a70fe | /lab01/SongTester.h | 49b542d6d3e755ba8acb0971bf5c46ced2fc0791 | [] | no_license | sebeneyi/cs112 | e3764fefad582c4290f20128c50aae530a773d54 | e5c3921580421e6fae5ac715c2381d88b5b07219 | refs/heads/main | 2023-03-25T19:05:22.997781 | 2021-03-09T20:34:05 | 2021-03-09T20:34:05 | 345,799,833 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 353 | h | /*
* SongTester.h declares a test-class for class Song
*
* Created on: Feb 5, 2019
* Author: ssy3 at Calvin College for CS 112 lab01
*/
#ifndef SONGTESTER_H_
#define SONGTESTER_H_
#include "Song.h"
class SongTester {
public:
void runTests();
void testConstructors();
void testReadFrom();
void testWriteTo();
};
#endif /* SONGTESTER_H_ */
| [
"yimail08@gmail.com"
] | yimail08@gmail.com |
aa26cd46de711646af3a457a8c0a5d6d7fc73736 | e37dd8210e23cac5257c2cc7582f7119c7ade969 | /SPH-Fluid-Simulation/Vector3.cpp | 5963870f0c5323fa8c56583c106b1707205ff323 | [] | no_license | fangledon/SPH-Fluid-Simualtion | 7709f67d54b0c7302bc7e80723035794ed5e17f2 | 1d0cea51e5df4658e87560a930ee27354d5b2cc8 | refs/heads/master | 2021-03-17T08:43:17.610523 | 2020-03-13T08:48:30 | 2020-03-13T08:48:30 | 246,977,713 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 185 | cpp | #include "Vector3.hpp"
Vector3 Vector3::XAXIS(1.0f,0.0f,0.0f);
Vector3 Vector3::YAXIS(0.0f,1.0f,0.0f);
Vector3 Vector3::ZAXIS(0.0f,0.0f,1.0f);
Vector3 Vector3::ORIGIN(0.0f,0.0f,0.0f);
| [
"fangledon@yahoo.com"
] | fangledon@yahoo.com |
1c8e559f86b8608f8318f54c3768629a466f909e | b27e4f400a1412895550064b6deac3ef8c7bc3bf | /10487 - Closest Sums.cpp | 26b6aaa0b17c69c474d6c4048f38f1a18f2a96a2 | [] | no_license | ddthanhdat/olp | 0ede078073f9f71024237e89a8df032c3de91df1 | b8dabc9ed810531971c41337d154ef978464b8d2 | refs/heads/master | 2020-04-06T12:12:28.684799 | 2015-09-13T14:46:52 | 2015-09-13T14:46:52 | 42,399,405 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 442 | cpp | #include <iostream>
#include <math.h>
using namespace std;
int main(){
freopen("test.INP","r",stdin);
freopen("test.OUT","w",stdout);
int n;
int d=1;
while(cin >> n){
int p=1;
int kt=-1;
int *pn=new int[n];
for(int i=0; i<n;i++){
cin >> pn[i];
}
for(int i=0; i<n;i++){
if(pn[i]>0) {
p*=pn[i];
kt=1;
}
}
if(kt==-1) p=0;
cout << "Case #"<< d <<": The maximum product is "<< p <<"."<< endl;
d++;
}
}
| [
"ddthanhdat@gmail.com"
] | ddthanhdat@gmail.com |
879189ced77d68c8211b21a69705aff250629aae | c5bf47d4e64a38b9f3bcfd8ae7f1b935c788a9af | /NativeLibrary/Src/System/Common.h | b8ffe98c612060c081e1be9bb755371a778139ae | [] | no_license | taiki-f/AndroidOpenglSimple2 | a358a78cfc38b6ea7b1f6fdc03387b60c30a4866 | ec2ac4423c4f23c8b6c0da7140420ad6b6324b81 | refs/heads/main | 2023-01-10T19:12:41.928156 | 2020-11-17T13:58:20 | 2020-11-17T13:58:20 | 313,620,344 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,630 | h | #pragma once
namespace drs { namespace util {
/// <summary>
/// べき乗の値を取得する
/// </summary>
/// <param name="value">元の値</param>
template<typename _Type>
_Type GET_POW2(_Type value) {
_Type v;
for (v = 1; v < value; v *= (_Type)2);
return v;
}
/// <summary>
/// 配列サイズを取得する
/// </summary>
/// <param name="&">配列参照</param>
/// <returns>配列の要素数</returns>
template<typename _Type, size_t _Size>
size_t ARRAY_SIZE(const _Type(&)[_Size]) {
return _Size;
}
/// <summary>
/// カラー共用体
/// </summary>
union Color {
u32 full;
struct {
u8 a, b, g, r;
};
};
#define RGBA(r, g, b, a) (((u32)(a) << 24) | ((u32)(b) << 16) | ((u32)(g) << 8) | ((u32)(r)))
} } // namespace
#if defined(NDEBUG)
#define LOGI(...) {}
#define LOGW(...) {}
#define LOGE(...) {}
#define ASSERT(v) {}
#else // defined(NDEBUG)
#if defined(ANDROID)
#define LOGI(...) ((void)__android_log_print(ANDROID_LOG_INFO, "NativeLibrary", __VA_ARGS__))
#define LOGW(...) ((void)__android_log_print(ANDROID_LOG_WARN, "NativeLibrary", __VA_ARGS__))
#define LOGE(...) ((void)__android_log_print(ANDROID_LOG_ERROR, "NativeLibrary", __VA_ARGS__))
#define ASSERT(v) {if (!(v)) {LOGE(#v); assert(false);}}
#else
#define LOGI(...) {}
#define LOGW(...) {}
#define LOGE(...) {}
#define ASSERT(v) {}
#endif
#endif // defined(NDEBUG)
| [
"matsudalvup@gmail.com"
] | matsudalvup@gmail.com |
662c0a106dec3a7eb0aa1801b3a4feb027702f1b | ea4e3ac0966fe7b69f42eaa5a32980caa2248957 | /download/unzip/WebKit2/WebKit2-7600.1.4.16.7/WebProcess/ios/WebVideoFullscreenManager.h | c8201c95caea4a6ae7c2fc7e0f15c5d817b12f1b | [] | no_license | hyl946/opensource_apple | 36b49deda8b2f241437ed45113d624ad45aa6d5f | e0f41fa0d9d535d57bfe56a264b4b27b8f93d86a | refs/heads/master | 2023-02-26T16:27:25.343636 | 2020-03-29T08:50:45 | 2020-03-29T08:50:45 | 249,169,732 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,132 | h | /*
* Copyright (C) 2014 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS 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 APPLE INC. OR ITS CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef WebVideoFullscreenManager_h
#define WebVideoFullscreenManager_h
#if PLATFORM(IOS)
#include "MessageReceiver.h"
#include <WebCore/EventListener.h>
#include <WebCore/PlatformCALayer.h>
#include <WebCore/WebVideoFullscreenInterface.h>
#include <WebCore/WebVideoFullscreenModelMediaElement.h>
#include <wtf/RefCounted.h>
#include <wtf/RefPtr.h>
namespace IPC {
class Attachment;
class Connection;
class MessageDecoder;
class MessageReceiver;
}
namespace WebCore {
class Node;
}
namespace WebKit {
class LayerHostingContext;
class WebPage;
class WebVideoFullscreenManager : public WebCore::WebVideoFullscreenModelMediaElement, public WebCore::WebVideoFullscreenInterface, private IPC::MessageReceiver {
public:
static PassRefPtr<WebVideoFullscreenManager> create(PassRefPtr<WebPage>);
virtual ~WebVideoFullscreenManager();
void didReceiveMessage(IPC::Connection*, IPC::MessageDecoder&);
bool supportsFullscreen(const WebCore::Node*) const;
void enterFullscreenForNode(WebCore::Node*);
void exitFullscreenForNode(WebCore::Node*);
protected:
explicit WebVideoFullscreenManager(PassRefPtr<WebPage>);
virtual bool operator==(const EventListener& rhs) override { return static_cast<WebCore::EventListener*>(this) == &rhs; }
// FullscreenInterface
virtual void resetMediaState() override;
virtual void setDuration(double) override;
virtual void setCurrentTime(double currentTime, double anchorTime) override;
virtual void setRate(bool isPlaying, float playbackRate) override;
virtual void setVideoDimensions(bool hasVideo, float width, float height) override;
virtual void setSeekableRanges(const WebCore::TimeRanges&) override;
virtual void setCanPlayFastReverse(bool value) override;
virtual void setAudioMediaSelectionOptions(const Vector<String>& options, uint64_t selectedIndex) override;
virtual void setLegibleMediaSelectionOptions(const Vector<String>& options, uint64_t selectedIndex) override;
virtual void setExternalPlayback(bool enabled, WebVideoFullscreenInterface::ExternalPlaybackTargetType, String localizedDeviceName) override;
// additional incoming
virtual void didSetupFullscreen();
virtual void didEnterFullscreen();
virtual void didExitFullscreen();
virtual void didCleanupFullscreen();
virtual void setVideoLayerGravityEnum(unsigned);
void setVideoLayerFrameFenced(WebCore::FloatRect bounds, IPC::Attachment fencePort);
WebPage* m_page;
RefPtr<WebCore::Node> m_node;
std::unique_ptr<LayerHostingContext> m_layerHostingContext;
bool m_isAnimating;
bool m_targetIsFullscreen;
bool m_isFullscreen;
};
} // namespace WebKit
#endif // PLATFORM(IOS)
#endif // WebVideoFullscreenManager_h
| [
"hyl946@163.com"
] | hyl946@163.com |
ef9d1743722bdd6babfbab26b13ae4c5f7a86bb6 | 0ab5aa2d779fe235ba34227d7361f49571a2a6d9 | /_swaptions/src/HJM_SimPath_Forward_Blocking.cpp | 15c932467787514ed549596a73e028b3f1db9a89 | [
"BSD-3-Clause"
] | permissive | lihanglin/riscv-vectorized-benchmark-suite | 4373db8a5f6329e4ea05fb422aa816d1e761c9d9 | edbfdcdb97b74a1de50c1788ee8400c525ea29c4 | refs/heads/master | 2023-01-01T01:45:10.586866 | 2020-10-21T11:41:36 | 2020-10-21T11:41:36 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 8,754 | cpp | #include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include "HJM_type.h"
#include "HJM.h"
#include "nr_routines.h"
#ifdef TBB_VERSION
#include <pthread.h>
#include "tbb/task_scheduler_init.h"
#include "tbb/blocked_range.h"
#include "tbb/parallel_for.h"
#include "tbb/cache_aligned_allocator.h"
// #include <time.h>
// #include <sys/time.h>
#define PARALLEL_B_GRAINSIZE 8
struct ParallelB {
__volatile__ int l;
FTYPE **pdZ;
FTYPE **randZ;
int BLOCKSIZE;
int iN;
ParallelB(FTYPE **pdZ_, FTYPE **randZ_, int BLOCKSIZE_, int iN_)//:
// pdZ(pdZ_), randZ(randZ_), BLOCKSIZE(BLOCKSIZE_), iN(iN_)
{
pdZ = pdZ_;
randZ = randZ_;
BLOCKSIZE = BLOCKSIZE_;
iN = iN_;
/*fprintf(stderr,"(Construction object) pdZ=0x%08x, randZ=0x%08x\n",
pdZ, randZ);*/
}
void set_l(int l_){l = l_;}
void operator()(const tbb::blocked_range<int> &range) const {
int begin = range.begin();
int end = range.end();
int b,j;
/*fprintf(stderr,"B: Thread %d from %d to %d. l=%d pdZ=0x%08x, BLOCKSIZE=%d, iN=%d\n",
pthread_self(), begin, end, l,(int)pdZ,BLOCKSIZE,iN); */
for(b=begin; b!=end; b++) {
for (j=1;j<=iN-1;++j){
pdZ[l][BLOCKSIZE*j + b]= CumNormalInv(randZ[l][BLOCKSIZE*j + b]); /* 18% of the total executition time */
//fprintf(stderr,"%d (%d, %d): [%d][%d]=%e\n",pthread_self(), begin, end, l,BLOCKSIZE*j+b,pdZ[l][BLOCKSIZE*j + b]);
}
}
}
};
#endif // TBB_VERSION
void serialB(FTYPE **pdZ, FTYPE **randZ, int BLOCKSIZE, int iN, int iFactors)
{
#ifdef USE_RISCV_VECTOR
for(int l=0;l<=iFactors-1;++l){
for (int j=1;j<=iN-1;++j){
//for(int b=0; b<BLOCKSIZE; b+=BLOCKSIZE){
unsigned long int gvl = __builtin_epi_vsetvl(BLOCKSIZE, __epi_e64, __epi_m1);
CumNormalInv_vector(&randZ[l][BLOCKSIZE*j /*+ b*/] , &pdZ[l][BLOCKSIZE*j/* + b*/] , gvl);
FENCE();
//}
}
}
#else
for(int l=0;l<=iFactors-1;++l){
for (int j=1;j<=iN-1;++j){
for(int b=0; b<BLOCKSIZE; b++){
pdZ[l][BLOCKSIZE*j + b]= CumNormalInv(randZ[l][BLOCKSIZE*j + b]); /* 18% of the total executition time */
// printf("CumNormalInv output: %f, input: %f\n",pdZ[l][BLOCKSIZE*j + b],randZ[l][BLOCKSIZE*j + b]);
}
}
}
#endif // USE_RISCV_VECTOR
}
int HJM_SimPath_Forward_Blocking(FTYPE **ppdHJMPath, //Matrix that stores generated HJM path (Output)
int iN, //Number of time-steps
int iFactors, //Number of factors in the HJM framework
FTYPE dYears, //Number of years
FTYPE *pdForward, //t=0 Forward curve
FTYPE *pdTotalDrift, //Vector containing total drift corrections for different maturities
FTYPE **ppdFactors, //Factor volatilities
long *lRndSeed, //Random number seed
int BLOCKSIZE)
{
//This function computes and stores an HJM Path for given inputs
//#ifdef USE_RISCV_VECTOR
// struct timeval tv1_0, tv2_0;
// struct timezone tz_0;
// double elapsed0=0.0;
// gettimeofday(&tv1_0, &tz_0);
//#endif
int iSuccess = 0;
int i,j,l; //looping variables
FTYPE **pdZ; //vector to store random normals
FTYPE **randZ; //vector to store random normals
FTYPE dTotalShock; //total shock by which the forward curve is hit at (t, T-t)
FTYPE ddelt, sqrt_ddelt; //length of time steps
ddelt = (FTYPE)(dYears/iN);
sqrt_ddelt = sqrt(ddelt);
pdZ = dmatrix(0, iFactors-1, 0, iN*BLOCKSIZE -1); //assigning memory
randZ = dmatrix(0, iFactors-1, 0, iN*BLOCKSIZE -1); //assigning memory
// =====================================================
// t=0 forward curve stored iN first row of ppdHJMPath
// At time step 0: insert expected drift
// rest reset to 0
#ifdef USE_RISCV_VECTOR
unsigned long int gvl = __builtin_epi_vsetvl(BLOCKSIZE, __epi_e64, __epi_m1);
_MMR_f64 xZero;
xZero = _MM_SET_f64(0.0,gvl);
//for(int b=0; b<BLOCKSIZE; b++){
for(j=0;j<=iN-1;j++) {
_MM_STORE_f64(&ppdHJMPath[0][BLOCKSIZE*j],_MM_SET_f64(pdForward[j],gvl),gvl);
for(i=1;i<=iN-1;++i) {
_MM_STORE_f64(&ppdHJMPath[i][BLOCKSIZE*j],xZero,gvl);
} //initializing HJMPath to zero
}
//}
#else
for(int b=0; b<BLOCKSIZE; b++){
for(j=0;j<=iN-1;j++){
ppdHJMPath[0][BLOCKSIZE*j + b] = pdForward[j];
for(i=1;i<=iN-1;++i){
ppdHJMPath[i][BLOCKSIZE*j + b]=0;
} //initializing HJMPath to zero
}
}
#endif
// -----------------------------------------------------
//#ifdef USE_RISCV_VECTOR
// gettimeofday(&tv2_0, &tz_0);
// elapsed0 = (double) (tv2_0.tv_sec-tv1_0.tv_sec) + (double) (tv2_0.tv_usec-tv1_0.tv_usec) * 1.e-6;
// printf("HJM_SimPath_Forward_Blocking first part took %8.8lf secs \n", elapsed0 );
//#endif
//#ifdef USE_RISCV_VECTOR
// elapsed0=0.0;
// gettimeofday(&tv1_0, &tz_0);
//#endif
// =====================================================
// sequentially generating random numbers
#ifdef USE_RISCV_VECTOR
RanUnif_vector( lRndSeed ,iFactors , iN ,BLOCKSIZE , randZ);
#else
// =====================================================
// sequentially generating random numbers
for(int b=0; b<BLOCKSIZE; b++){
for(int s=0; s<1; s++){
for (j=1;j<=iN-1;++j){
for (l=0;l<=iFactors-1;++l){
//compute random number in exact same sequence
randZ[l][BLOCKSIZE*j + b + s] = RanUnif(lRndSeed); /* 10% of the total executition time */
}
}
}
}
#endif
//#ifdef USE_RISCV_VECTOR
// gettimeofday(&tv2_0, &tz_0);
// elapsed0 = (double) (tv2_0.tv_sec-tv1_0.tv_sec) + (double) (tv2_0.tv_usec-tv1_0.tv_usec) * 1.e-6;
// printf("HJM_SimPath_Forward_Blocking second part took %8.8lf secs \n", elapsed0 );
//#endif
//#ifdef USE_RISCV_VECTOR
// elapsed0=0.0;
// gettimeofday(&tv1_0, &tz_0);
//#endif
// =====================================================
// shocks to hit various factors for forward curve at t
#ifdef TBB_VERSION
ParallelB B(pdZ, randZ, BLOCKSIZE, iN);
for(l=0;l<=iFactors-1;++l){
B.set_l(l);
tbb::parallel_for(tbb::blocked_range<int>(0, BLOCKSIZE, PARALLEL_B_GRAINSIZE),B);
}
#else
/* 18% of the total executition time */
serialB(pdZ, randZ, BLOCKSIZE, iN, iFactors);
#endif
//#ifdef USE_RISCV_VECTOR
// gettimeofday(&tv2_0, &tz_0);
// elapsed0 = (double) (tv2_0.tv_sec-tv1_0.tv_sec) + (double) (tv2_0.tv_usec-tv1_0.tv_usec) * 1.e-6;
// printf("HJM_SimPath_Forward_Blocking third part took %8.8lf secs \n", elapsed0 );
//#endif
//#ifdef USE_RISCV_VECTOR
// elapsed0=0.0;
// gettimeofday(&tv1_0, &tz_0);
//#endif
#ifdef USE_RISCV_VECTOR
FTYPE pdDriftxddelt;
// =====================================================
// Generation of HJM Path1 Vector
gvl = __builtin_epi_vsetvl(BLOCKSIZE, __epi_e64, __epi_m1);
_MMR_f64 xdTotalShock;
//for(int b=0; b<BLOCKSIZE; b++){ // b is the blocks
for (j=1;j<=iN-1;++j) {// j is the timestep
for (l=0;l<=iN-(j+1);++l){ // l is the future steps
xdTotalShock = _MM_SET_f64(0.0,gvl);
pdDriftxddelt = pdTotalDrift[l]*ddelt;
for (i=0;i<=iFactors-1;++i){// i steps through the stochastic factors
xdTotalShock = _MM_ADD_f64(xdTotalShock, _MM_MUL_f64(_MM_SET_f64(ppdFactors[i][l],gvl), _MM_LOAD_f64(&pdZ[i][BLOCKSIZE*j],gvl),gvl),gvl);
}
_MM_STORE_f64(&(ppdHJMPath[j][BLOCKSIZE*l]), _MM_ADD_f64(_MM_LOAD_f64(&ppdHJMPath[j-1][BLOCKSIZE*(l+1)],gvl),_MM_ADD_f64(_MM_SET_f64(pdDriftxddelt,gvl),_MM_MUL_f64(_MM_SET_f64(sqrt_ddelt,gvl),xdTotalShock,gvl),gvl),gvl),gvl);
//as per formula
}
}
//} // end Blocks
#else
// =====================================================
// Generation of HJM Path1
for(int b=0; b<BLOCKSIZE; b++){ // b is the blocks
for (j=1;j<=iN-1;++j) {// j is the timestep
for (l=0;l<=iN-(j+1);++l){ // l is the future steps
dTotalShock = 0;
for (i=0;i<=iFactors-1;++i){// i steps through the stochastic factors
dTotalShock += ppdFactors[i][l]* pdZ[i][BLOCKSIZE*j + b];
}
ppdHJMPath[j][BLOCKSIZE*l+b] = ppdHJMPath[j-1][BLOCKSIZE*(l+1)+b]+ pdTotalDrift[l]*ddelt + sqrt_ddelt*dTotalShock;
//as per formula
}
}
} // end Blocks
// -----------------------------------------------------
#endif
//#ifdef USE_RISCV_VECTOR
// gettimeofday(&tv2_0, &tz_0);
// elapsed0 = (double) (tv2_0.tv_sec-tv1_0.tv_sec) + (double) (tv2_0.tv_usec-tv1_0.tv_usec) * 1.e-6;
// printf("HJM_SimPath_Forward_Blocking fourth part took %8.8lf secs \n", elapsed0 );
//#endif
free_dmatrix(pdZ, 0, iFactors -1, 0, iN*BLOCKSIZE -1);
free_dmatrix(randZ, 0, iFactors -1, 0, iN*BLOCKSIZE -1);
iSuccess = 1;
return iSuccess;
}
| [
"cristobal.ramirez.lazo@gmail.com"
] | cristobal.ramirez.lazo@gmail.com |
974fd395366c7981218f85bf0b92f7a00c150778 | 0efb71923c02367a1194a9b47779e8def49a7b9f | /Oblig1/les/0.39/phi_0 | 36c7d0e4f43df73918a71d94e057b2fa29c68f85 | [] | no_license | andergsv/blandet | bbff505e8663c7547b5412700f51e3f42f088d78 | f648b164ea066c918e297001a8049dd5e6f786f9 | refs/heads/master | 2021-01-17T13:23:44.372215 | 2016-06-14T21:32:00 | 2016-06-14T21:32:00 | 41,495,450 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 214,377 | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: 2.4.0 |
| \\ / A nd | Web: www.OpenFOAM.org |
| \\/ M anipulation | |
\*---------------------------------------------------------------------------*/
FoamFile
{
version 2.0;
format ascii;
class surfaceScalarField;
location "0.39";
object phi_0;
}
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
dimensions [0 3 -1 0 0 0 0];
internalField nonuniform List<scalar>
17320
(
1.76352e-05
7.3648e-06
1.16133e-05
6.02191e-06
8.68315e-06
2.93014e-06
7.35894e-06
1.3242e-06
6.71544e-06
6.435e-07
6.34207e-06
3.73378e-07
6.08707e-06
2.54997e-07
5.8583e-06
2.28765e-07
5.71074e-06
1.47561e-07
5.5907e-06
1.20038e-07
5.46993e-06
1.20774e-07
5.38245e-06
8.74749e-08
5.32098e-06
6.14742e-08
5.2181e-06
1.0288e-07
5.13054e-06
8.7563e-08
5.04132e-06
8.92225e-08
4.97253e-06
6.87888e-08
4.8449e-06
1.27626e-07
4.63266e-06
2.1224e-07
-4.07639e-07
5.0403e-06
2.54535e-05
6.91127e-06
2.32407e-05
8.23473e-06
2.09903e-05
5.18054e-06
1.93214e-05
2.99316e-06
1.80721e-05
1.89275e-06
1.71173e-05
1.3282e-06
1.63709e-05
1.0014e-06
1.57606e-05
8.39021e-07
1.53171e-05
5.91039e-07
1.49377e-05
4.99517e-07
1.46246e-05
4.33813e-07
1.43697e-05
3.42373e-07
1.41645e-05
2.66713e-07
1.39238e-05
3.43529e-07
1.37277e-05
2.83749e-07
1.35207e-05
2.96134e-07
1.33324e-05
2.57134e-07
1.30599e-05
4.0014e-07
1.29026e-05
3.69558e-07
-2.25208e-07
1.27201e-05
2.6609e-05
5.30225e-06
2.71483e-05
7.69542e-06
2.67819e-05
5.54697e-06
2.6252e-05
3.52303e-06
2.55973e-05
2.54743e-06
2.48853e-05
2.04021e-06
2.41619e-05
1.72482e-06
2.3487e-05
1.51392e-06
2.29493e-05
1.1288e-06
2.24421e-05
1.00666e-06
2.20277e-05
8.48259e-07
2.16716e-05
6.98483e-07
2.1377e-05
5.61278e-07
2.10539e-05
6.66617e-07
2.07946e-05
5.43088e-07
2.05227e-05
5.68025e-07
2.02886e-05
4.91266e-07
1.98874e-05
8.01298e-07
1.97868e-05
4.70139e-07
4.05595e-07
1.9156e-05
2.63098e-05
3.99249e-06
2.75231e-05
6.48212e-06
2.80841e-05
4.98597e-06
2.84646e-05
3.14253e-06
2.86372e-05
2.37476e-06
2.86424e-05
2.035e-06
2.84848e-05
1.88245e-06
2.82078e-05
1.79087e-06
2.79894e-05
1.34722e-06
2.76833e-05
1.31276e-06
2.74238e-05
1.10781e-06
2.71602e-05
9.62022e-07
2.69404e-05
7.81125e-07
2.66602e-05
9.46811e-07
2.64225e-05
7.80774e-07
2.6188e-05
8.02526e-07
2.59894e-05
6.8982e-07
2.5543e-05
1.24776e-06
2.52914e-05
7.21776e-07
1.46386e-06
2.42331e-05
2.60538e-05
2.93872e-06
2.72057e-05
5.3302e-06
2.79993e-05
4.19232e-06
2.85187e-05
2.6232e-06
2.89901e-05
1.9033e-06
2.93469e-05
1.67826e-06
2.9616e-05
1.61333e-06
2.97186e-05
1.68825e-06
2.98525e-05
1.21337e-06
2.9897e-05
1.26822e-06
2.99578e-05
1.04697e-06
2.99347e-05
9.85126e-07
2.99704e-05
7.45498e-07
2.99519e-05
9.65231e-07
2.98407e-05
8.92043e-07
2.9819e-05
8.24183e-07
2.97654e-05
7.43445e-07
2.96563e-05
1.3568e-06
2.96377e-05
7.40443e-07
1.01724e-06
3.00843e-05
2.58554e-05
2.08334e-06
2.69902e-05
4.19539e-06
2.77629e-05
3.41964e-06
2.82088e-05
2.17727e-06
2.87299e-05
1.3822e-06
2.91207e-05
1.28744e-06
2.94918e-05
1.24222e-06
2.97367e-05
1.44342e-06
2.99522e-05
9.97875e-07
3.01445e-05
1.07585e-06
3.04251e-05
7.66428e-07
3.04966e-05
9.1358e-07
3.06829e-05
5.59244e-07
3.09316e-05
7.16461e-07
3.09155e-05
9.08207e-07
3.10807e-05
6.58989e-07
3.12466e-05
5.77527e-07
3.15117e-05
1.09165e-06
3.14763e-05
7.75936e-07
5.14175e-07
3.19793e-05
2.5675e-05
1.40831e-06
2.67755e-05
3.0949e-06
2.76137e-05
2.5815e-06
2.80254e-05
1.7655e-06
2.84291e-05
9.78517e-07
2.88654e-05
8.51168e-07
2.92293e-05
8.78374e-07
2.95252e-05
1.14745e-06
2.97673e-05
7.55833e-07
2.99861e-05
8.57027e-07
3.0269e-05
4.83551e-07
3.03436e-05
8.38932e-07
3.05788e-05
3.24085e-07
3.08997e-05
3.9556e-07
3.08844e-05
9.23453e-07
3.11129e-05
4.30469e-07
3.14348e-05
2.55642e-07
3.17279e-05
7.98566e-07
3.17957e-05
7.08131e-07
-5.41476e-08
3.2364e-05
2.55838e-05
8.24528e-07
2.66258e-05
2.05291e-06
2.74612e-05
1.74608e-06
2.79953e-05
1.23134e-06
2.82475e-05
7.26371e-07
2.86461e-05
4.52563e-07
2.89853e-05
5.39185e-07
2.94047e-05
7.28062e-07
2.96501e-05
5.10412e-07
2.98014e-05
7.05661e-07
3.00096e-05
2.75368e-07
3.02252e-05
6.23337e-07
3.04443e-05
1.04987e-07
3.07132e-05
1.26657e-07
3.07334e-05
9.03253e-07
3.09999e-05
1.64031e-07
3.13197e-05
-6.41697e-08
3.14677e-05
6.50527e-07
3.1718e-05
4.5789e-07
-5.64026e-07
3.22278e-05
2.54729e-05
3.51583e-07
2.64676e-05
1.0583e-06
2.73048e-05
9.08802e-07
2.78605e-05
6.75723e-07
2.82801e-05
3.06764e-07
2.86627e-05
6.99388e-08
2.88222e-05
3.79626e-07
2.92161e-05
3.34187e-07
2.94985e-05
2.28006e-07
2.96528e-05
5.51344e-07
2.99462e-05
-1.80165e-08
3.02378e-05
3.3181e-07
3.02762e-05
6.65393e-08
3.04911e-05
-8.82035e-08
3.06994e-05
6.94913e-07
3.09518e-05
-8.84067e-08
3.12267e-05
-3.39026e-07
3.13382e-05
5.38977e-07
3.15823e-05
2.13845e-07
-8.66889e-07
3.18852e-05
2.5425e-05
-7.34509e-08
2.63619e-05
1.21487e-07
2.7215e-05
5.56824e-08
2.79243e-05
-3.35745e-08
2.83153e-05
-8.4261e-08
2.85649e-05
-1.79659e-07
2.87604e-05
1.84102e-07
2.90844e-05
1.01642e-08
2.94166e-05
-1.04172e-07
2.96695e-05
2.98444e-07
2.99014e-05
-2.49907e-07
3.01544e-05
7.87823e-08
3.02422e-05
-2.12674e-08
3.04798e-05
-3.25716e-07
3.07182e-05
4.56507e-07
3.0848e-05
-2.18297e-07
3.11275e-05
-6.18461e-07
3.13005e-05
3.6601e-07
3.1427e-05
8.72464e-08
-1.1555e-06
3.17157e-05
2.53869e-05
-4.60339e-07
2.6389e-05
-8.80618e-07
2.73218e-05
-8.77171e-07
2.7978e-05
-6.89695e-07
2.82075e-05
-3.13809e-07
2.84834e-05
-4.55562e-07
2.87795e-05
-1.11955e-07
2.90967e-05
-3.07058e-07
2.94546e-05
-4.62103e-07
2.96865e-05
6.66071e-08
2.98613e-05
-4.24751e-07
3.01944e-05
-2.54282e-07
3.02742e-05
-1.0112e-07
3.04388e-05
-4.90262e-07
3.07354e-05
1.59843e-07
3.08385e-05
-3.21337e-07
3.10317e-05
-8.11715e-07
3.13082e-05
8.95658e-08
3.14894e-05
-9.40095e-08
-1.36363e-06
3.16976e-05
2.54432e-05
-9.03527e-07
2.64898e-05
-1.92723e-06
2.73764e-05
-1.76376e-06
2.79376e-05
-1.25091e-06
2.82038e-05
-5.79976e-07
2.85602e-05
-8.12023e-07
2.88694e-05
-4.21106e-07
2.91733e-05
-6.10977e-07
2.94936e-05
-7.82437e-07
2.97907e-05
-2.30403e-07
2.99267e-05
-5.60753e-07
3.02116e-05
-5.39188e-07
3.03131e-05
-2.02664e-07
3.04512e-05
-6.28341e-07
3.07722e-05
-1.6113e-07
3.09358e-05
-4.84975e-07
3.1018e-05
-8.93942e-07
3.14165e-05
-3.08932e-07
3.16429e-05
-3.20353e-07
-1.36623e-06
3.16455e-05
2.55246e-05
-1.42817e-06
2.65794e-05
-2.98194e-06
2.74653e-05
-2.64974e-06
2.8007e-05
-1.79261e-06
2.83388e-05
-9.1171e-07
2.86586e-05
-1.13189e-06
2.89917e-05
-7.54139e-07
2.9329e-05
-9.48292e-07
2.95597e-05
-1.0131e-06
2.9905e-05
-5.75781e-07
3.00301e-05
-6.85799e-07
3.02605e-05
-7.69612e-07
3.04301e-05
-3.72275e-07
3.05588e-05
-7.57064e-07
3.08547e-05
-4.5695e-07
3.10695e-05
-6.99788e-07
3.11128e-05
-9.37312e-07
3.15482e-05
-7.44262e-07
3.17987e-05
-5.70833e-07
-1.31324e-06
3.17457e-05
2.56525e-05
-2.08069e-06
2.67486e-05
-4.078e-06
2.76358e-05
-3.53694e-06
2.80586e-05
-2.21545e-06
2.8478e-05
-1.33105e-06
2.88289e-05
-1.48285e-06
2.91761e-05
-1.10131e-06
2.95044e-05
-1.27659e-06
2.97401e-05
-1.24878e-06
3.00387e-05
-8.74447e-07
3.01907e-05
-8.37808e-07
3.04241e-05
-1.00297e-06
3.06134e-05
-5.61613e-07
3.07469e-05
-8.9051e-07
3.09731e-05
-6.83167e-07
3.11952e-05
-9.21844e-07
3.12761e-05
-1.01831e-06
3.16501e-05
-1.11819e-06
3.19054e-05
-8.26198e-07
-1.4306e-06
3.20228e-05
2.58361e-05
-2.91679e-06
2.69903e-05
-5.23224e-06
2.78281e-05
-4.37466e-06
2.82022e-05
-2.5896e-06
2.87034e-05
-1.83219e-06
2.90912e-05
-1.87069e-06
2.94431e-05
-1.45323e-06
2.97347e-05
-1.56816e-06
2.99801e-05
-1.49421e-06
3.02023e-05
-1.09665e-06
3.03779e-05
-1.01341e-06
3.05351e-05
-1.16019e-06
3.07071e-05
-7.33607e-07
3.08094e-05
-9.92753e-07
3.09716e-05
-8.45414e-07
3.11127e-05
-1.06291e-06
3.11425e-05
-1.04812e-06
3.13789e-05
-1.35454e-06
3.15568e-05
-1.00418e-06
-1.57842e-06
3.17047e-05
2.60508e-05
-3.96756e-06
2.72718e-05
-6.45325e-06
2.80121e-05
-5.115e-06
2.84777e-05
-3.05514e-06
2.89912e-05
-2.34576e-06
2.9308e-05
-2.18749e-06
2.96002e-05
-1.74538e-06
2.975e-05
-1.71802e-06
2.98418e-05
-1.58597e-06
2.99137e-05
-1.16855e-06
2.99496e-05
-1.04929e-06
2.99285e-05
-1.13916e-06
2.99663e-05
-7.71378e-07
2.98878e-05
-9.1429e-07
2.98712e-05
-8.28808e-07
2.9778e-05
-9.69687e-07
2.96369e-05
-9.06992e-07
2.9591e-05
-1.30863e-06
2.95399e-05
-9.53137e-07
-1.5472e-06
2.95087e-05
2.63255e-05
-5.2931e-06
2.75521e-05
-7.67984e-06
2.80464e-05
-5.60928e-06
2.84599e-05
-3.46859e-06
2.8653e-05
-2.53886e-06
2.86014e-05
-2.13595e-06
2.84972e-05
-1.64116e-06
2.8237e-05
-1.45782e-06
2.79431e-05
-1.29209e-06
2.77013e-05
-9.26727e-07
2.74299e-05
-7.7787e-07
2.71311e-05
-8.40385e-07
2.69201e-05
-5.60362e-07
2.66359e-05
-6.30071e-07
2.64067e-05
-5.99626e-07
2.6112e-05
-6.74987e-07
2.5842e-05
-6.36983e-07
2.55115e-05
-9.78166e-07
2.52864e-05
-7.28017e-07
-1.34463e-06
2.50838e-05
2.66159e-05
-6.909e-06
2.71603e-05
-8.22428e-06
2.67612e-05
-5.21016e-06
2.62644e-05
-2.97176e-06
2.56042e-05
-1.87863e-06
2.48529e-05
-1.38464e-06
2.41771e-05
-9.65363e-07
2.35077e-05
-7.8844e-07
2.29081e-05
-6.9246e-07
2.24518e-05
-4.70522e-07
2.20377e-05
-3.6368e-07
2.16389e-05
-4.41581e-07
2.1351e-05
-2.72462e-07
2.10353e-05
-3.14406e-07
2.07559e-05
-3.20272e-07
2.04405e-05
-3.59545e-07
2.01556e-05
-3.52043e-07
1.97233e-05
-5.45916e-07
1.9388e-05
-3.92706e-07
-4.88939e-07
1.85323e-05
2.54562e-05
-7.36516e-06
2.32484e-05
-6.01651e-06
2.09784e-05
-2.94013e-06
1.93273e-05
-1.32074e-06
1.80791e-05
-6.30383e-07
1.70945e-05
-4.00055e-07
1.63762e-05
-2.4706e-07
1.57827e-05
-1.94971e-07
1.52848e-05
-1.94529e-07
1.4933e-05
-1.18749e-07
1.46433e-05
-7.39983e-08
1.4339e-05
-1.37235e-07
1.41343e-05
-6.77325e-08
1.39062e-05
-8.63015e-08
1.36872e-05
-1.01283e-07
1.34422e-05
-1.14579e-07
1.32034e-05
-1.13199e-07
1.28506e-05
-1.93173e-07
1.26234e-05
-1.65527e-07
-8.86109e-08
1.22231e-05
1.76348e-05
1.16183e-05
8.6782e-06
7.35746e-06
6.72708e-06
6.32702e-06
6.07996e-06
5.88499e-06
5.69046e-06
5.57171e-06
5.49771e-06
5.36048e-06
5.29275e-06
5.20644e-06
5.10516e-06
4.99058e-06
4.87738e-06
4.68421e-06
4.51868e-06
4.43007e-06
5.50276e-06
-2.42849e-07
-2.19609e-07
5.88553e-06
-1.1281e-07
-2.69963e-07
6.20617e-06
-1.03351e-07
-2.17295e-07
6.51705e-06
-1.56732e-07
-1.54144e-07
6.80953e-06
-2.10185e-07
-8.22889e-08
7.06768e-06
-2.23485e-07
-3.46733e-08
7.26177e-06
-2.28177e-07
3.40954e-08
7.3884e-06
-2.25478e-07
9.88452e-08
7.44613e-06
-2.38863e-07
1.81131e-07
7.48527e-06
-2.5952e-07
2.20378e-07
7.4728e-06
-2.71948e-07
2.84423e-07
7.48674e-06
-2.49797e-07
2.35858e-07
7.48833e-06
-1.90299e-07
1.88706e-07
7.52364e-06
-9.41344e-08
5.88304e-08
7.58417e-06
2.6798e-08
-8.73351e-08
7.6993e-06
1.54923e-07
-2.70054e-07
7.87981e-06
2.90657e-07
-4.71166e-07
8.09665e-06
3.60704e-07
-5.77539e-07
8.3858e-06
4.06134e-07
-6.95283e-07
8.75947e-06
4.10744e-07
-7.84412e-07
9.16266e-06
3.362e-07
-7.39389e-07
9.46364e-06
1.97252e-07
-4.98237e-07
9.61217e-06
-1.55077e-09
-1.46981e-07
9.58119e-06
-2.27575e-07
2.58553e-07
9.39892e-06
-4.48157e-07
6.30428e-07
9.16092e-06
-5.40871e-07
7.78878e-07
8.9274e-06
-5.62265e-07
7.95781e-07
8.74653e-06
-5.48128e-07
7.28993e-07
8.58878e-06
-5.01188e-07
6.58942e-07
8.44939e-06
-4.61309e-07
6.00694e-07
8.32164e-06
-3.91081e-07
5.18831e-07
8.19724e-06
-2.75897e-07
4.003e-07
8.1096e-06
-9.61984e-08
1.83836e-07
8.1264e-06
1.32596e-07
-1.49388e-07
8.29127e-06
4.22922e-07
-5.87798e-07
8.65519e-06
7.35088e-07
-1.09901e-06
9.21347e-06
1.03679e-06
-1.59507e-06
9.92674e-06
1.23705e-06
-1.95033e-06
1.06852e-05
1.4415e-06
-2.19994e-06
1.14501e-05
1.52929e-06
-2.29423e-06
1.22929e-05
1.52982e-06
-2.3726e-06
1.29965e-05
1.60357e-06
-2.30716e-06
1.36067e-05
1.38473e-06
-1.99489e-06
1.41465e-05
1.1883e-06
-1.72819e-06
1.44263e-05
9.18684e-07
-1.19844e-06
1.4658e-05
4.63132e-07
-6.94801e-07
1.47227e-05
2.02724e-07
-2.67453e-07
1.45816e-05
-1.83949e-07
3.25009e-07
1.44429e-05
-3.74995e-07
5.13718e-07
1.42065e-05
-4.6503e-07
7.01472e-07
1.40383e-05
-6.26526e-07
7.9468e-07
1.38929e-05
-5.00061e-07
6.45521e-07
1.38502e-05
-5.95111e-07
6.37744e-07
1.39082e-05
-6.75471e-07
6.17447e-07
1.39395e-05
-6.17905e-07
5.86672e-07
1.41409e-05
-8.69999e-07
6.68535e-07
1.43428e-05
-9.94874e-07
7.93014e-07
1.4519e-05
-1.06142e-06
8.85222e-07
1.49291e-05
-1.43503e-06
1.02495e-06
1.52333e-05
-1.50456e-06
1.20033e-06
1.55978e-05
-1.69775e-06
1.33327e-06
1.61576e-05
-2.05485e-06
1.49505e-06
1.65416e-05
-2.10877e-06
1.72475e-06
1.70799e-05
-2.40428e-06
1.86597e-06
1.76985e-05
-2.77405e-06
2.15551e-06
1.811e-05
-2.83274e-06
2.42117e-06
1.87266e-05
-3.27775e-06
2.66121e-06
1.92695e-05
-3.49395e-06
2.95102e-06
1.96824e-05
-3.70067e-06
3.2878e-06
2.02614e-05
-4.02106e-06
3.44204e-06
2.06486e-05
-4.04105e-06
3.6539e-06
2.10131e-05
-4.22517e-06
3.86057e-06
2.14551e-05
-4.26852e-06
3.82661e-06
2.16888e-05
-4.01606e-06
3.78234e-06
2.20273e-05
-4.06921e-06
3.73067e-06
2.23096e-05
-3.80756e-06
3.52527e-06
2.25613e-05
-3.42796e-06
3.1763e-06
2.28627e-05
-3.22562e-06
2.92414e-06
2.31493e-05
-2.84552e-06
2.55898e-06
2.34496e-05
-2.52582e-06
2.22548e-06
2.38272e-05
-2.19015e-06
1.81261e-06
2.41636e-05
-1.84841e-06
1.51197e-06
2.46272e-05
-1.75946e-06
1.29584e-06
2.50166e-05
-1.54435e-06
1.155e-06
2.54188e-05
-1.51386e-06
1.11166e-06
2.59337e-05
-1.6329e-06
1.11801e-06
2.64214e-05
-1.60754e-06
1.11977e-06
2.68582e-05
-1.92579e-06
1.48905e-06
2.74187e-05
-2.12509e-06
1.5646e-06
2.79793e-05
-2.35129e-06
1.79071e-06
2.84783e-05
-2.82544e-06
2.32636e-06
2.90265e-05
-3.03814e-06
2.48992e-06
2.9667e-05
-3.47031e-06
2.8299e-06
3.01942e-05
-3.94551e-06
3.41831e-06
3.08042e-05
-4.19055e-06
3.58052e-06
3.1373e-05
-4.62199e-06
4.05317e-06
3.19201e-05
-5.08004e-06
4.53293e-06
3.25068e-05
-5.21229e-06
4.62559e-06
3.31745e-05
-5.80771e-06
5.14001e-06
3.35533e-05
-5.88101e-06
5.50222e-06
3.41354e-05
-6.13196e-06
5.54989e-06
3.46417e-05
-6.51766e-06
6.01135e-06
3.51063e-05
-6.49225e-06
6.02761e-06
3.55287e-05
-6.76768e-06
6.34532e-06
3.60171e-05
-6.95687e-06
6.4684e-06
3.63367e-05
-6.82936e-06
6.50985e-06
3.66829e-05
-7.06745e-06
6.72119e-06
3.70817e-05
-7.20204e-06
6.80325e-06
3.73546e-05
-6.8479e-06
6.57497e-06
3.75709e-05
-7.28281e-06
7.06653e-06
3.78018e-05
-7.00317e-06
6.77223e-06
3.78691e-05
-6.85882e-06
6.79155e-06
3.78157e-05
-7.0331e-06
7.08656e-06
3.78137e-05
-6.79827e-06
6.80022e-06
3.75581e-05
-6.65886e-06
6.91449e-06
3.72127e-05
-6.79725e-06
7.14258e-06
3.67505e-05
-6.42605e-06
6.8883e-06
3.61278e-05
-6.49923e-06
7.12197e-06
3.52873e-05
-6.31994e-06
7.16038e-06
3.44269e-05
-6.07998e-06
6.94037e-06
3.33562e-05
-5.91683e-06
6.98756e-06
3.23025e-05
-5.53593e-06
6.58963e-06
3.10994e-05
-5.16875e-06
6.37186e-06
2.9808e-05
-4.6408e-06
5.93224e-06
2.84211e-05
-3.77722e-06
5.16406e-06
2.70488e-05
-3.25905e-06
4.63137e-06
2.5623e-05
-2.48213e-06
3.90795e-06
2.42918e-05
-1.5685e-06
2.89965e-06
2.28981e-05
-1.48592e-06
2.87966e-06
2.1664e-05
-5.63567e-07
1.79761e-06
2.04571e-05
2.00886e-07
1.00607e-06
1.95682e-05
5.27583e-07
3.61347e-07
1.85255e-05
1.19707e-06
-1.54432e-07
1.77237e-05
2.08907e-06
-1.28721e-06
1.67476e-05
1.85096e-06
-8.74866e-07
1.61607e-05
1.59813e-06
-1.01123e-06
1.52891e-05
2.36177e-06
-1.49024e-06
1.46403e-05
3.26107e-06
-2.61226e-06
1.41644e-05
2.03462e-06
-1.55865e-06
1.37642e-05
-3.28713e-07
7.28861e-07
1.2138e-05
3.31511e-06
-1.68889e-06
1.20554e-05
1.84078e-06
-1.75815e-06
1.15136e-05
1.06656e-06
-5.24772e-07
1.07205e-05
-6.70238e-07
1.4633e-06
1.2038e-05
-5.04951e-06
3.73207e-06
1.25059e-05
-1.10538e-05
1.05858e-05
1.24426e-05
-1.33365e-05
1.33998e-05
1.2869e-05
-1.79355e-05
1.75092e-05
1.38182e-05
-2.0056e-05
1.91067e-05
1.50262e-05
-1.99502e-05
1.87423e-05
1.57257e-05
-2.22966e-05
2.15971e-05
1.53653e-05
-1.84721e-05
1.88325e-05
1.5601e-05
-1.70722e-05
1.68365e-05
1.6135e-05
-1.58589e-05
1.53249e-05
1.67545e-05
-1.5384e-05
1.47645e-05
1.83437e-05
-1.4848e-05
1.32588e-05
1.93983e-05
-1.22015e-05
1.11469e-05
1.99247e-05
-8.89038e-06
8.36403e-06
2.03416e-05
-4.49248e-06
4.07554e-06
2.0815e-05
6.55957e-08
-5.39015e-07
2.11193e-05
3.42438e-06
-3.72867e-06
2.14351e-05
7.48954e-06
-7.80537e-06
2.13734e-05
1.14374e-05
-1.13756e-05
2.15498e-05
1.3127e-05
-1.33035e-05
2.20297e-05
1.50972e-05
-1.55771e-05
2.25217e-05
1.84303e-05
-1.89222e-05
2.23659e-05
2.19858e-05
-2.183e-05
2.17553e-05
2.34196e-05
-2.2809e-05
2.15445e-05
2.33168e-05
-2.3106e-05
2.08361e-05
2.3836e-05
-2.31276e-05
1.97177e-05
2.44667e-05
-2.33483e-05
1.86352e-05
2.43467e-05
-2.32641e-05
1.68599e-05
2.42237e-05
-2.24484e-05
1.50451e-05
2.1356e-05
-1.95412e-05
1.32557e-05
1.77493e-05
-1.59599e-05
1.19355e-05
1.55954e-05
-1.42752e-05
1.17934e-05
1.38247e-05
-1.36826e-05
1.1797e-05
1.39826e-05
-1.39862e-05
1.19888e-05
1.42981e-05
-1.44899e-05
1.23274e-05
1.46419e-05
-1.49805e-05
1.26342e-05
1.42713e-05
-1.4578e-05
1.27422e-05
1.35252e-05
-1.36332e-05
1.30705e-05
1.29041e-05
-1.32324e-05
1.24533e-05
1.28959e-05
-1.22788e-05
1.31145e-05
1.05086e-05
-1.11698e-05
1.237e-05
1.1925e-05
-1.11805e-05
1.25279e-05
8.80122e-06
-8.95909e-06
1.21912e-05
1.07507e-05
-1.04141e-05
1.18644e-05
7.76422e-06
-7.43733e-06
1.15292e-05
9.3023e-06
-8.96714e-06
1.23801e-05
5.24695e-06
-6.09786e-06
1.11504e-05
8.32438e-06
-7.09466e-06
1.29148e-05
1.90132e-06
-3.66576e-06
1.1271e-05
6.52908e-06
-4.88519e-06
1.23064e-05
-7.55135e-07
-2.80353e-07
1.04082e-05
4.42628e-06
-2.52804e-06
1.15628e-05
-2.70111e-06
1.54654e-06
9.51569e-06
3.47545e-06
-1.42837e-06
9.84786e-06
-1.88236e-06
1.55019e-06
5.02082e-06
-5.5343e-06
1.03613e-05
1.2749e-05
-2.71764e-07
1.29055e-05
-2.69223e-07
1.31082e-05
-3.06066e-07
1.33238e-05
-3.72325e-07
1.35037e-05
-3.90165e-07
1.3648e-05
-3.67737e-07
1.37408e-05
-3.20967e-07
1.38018e-05
-2.86519e-07
1.38079e-05
-2.44957e-07
1.38099e-05
-2.6146e-07
1.37743e-05
-2.36349e-07
1.3756e-05
-2.31571e-07
1.37366e-05
-1.7087e-07
1.3734e-05
-9.14985e-08
1.37711e-05
-1.03192e-08
1.38191e-05
1.0691e-07
1.38976e-05
2.12145e-07
1.39845e-05
2.73866e-07
1.41008e-05
2.89798e-07
1.42079e-05
3.03602e-07
1.43435e-05
2.00639e-07
1.44237e-05
1.17002e-07
1.45003e-05
-7.80726e-08
1.44874e-05
-2.14705e-07
1.44177e-05
-3.78443e-07
1.43541e-05
-4.77266e-07
1.42641e-05
-4.72245e-07
1.41953e-05
-4.79324e-07
1.41021e-05
-4.08001e-07
1.40187e-05
-3.77986e-07
1.39008e-05
-2.73121e-07
1.37954e-05
-1.70554e-07
1.36977e-05
1.58535e-09
1.3614e-05
2.16232e-07
1.35636e-05
4.73324e-07
1.35937e-05
7.05037e-07
1.36998e-05
9.30679e-07
1.38142e-05
1.12262e-06
1.4105e-05
1.15068e-06
1.43528e-05
1.28158e-06
1.46866e-05
1.19598e-06
1.51432e-05
1.14699e-06
1.54375e-05
1.09042e-06
1.58308e-05
7.94984e-07
1.60853e-05
6.64152e-07
1.62063e-05
3.42178e-07
1.63887e-05
2.02702e-08
1.63139e-05
-1.09113e-07
1.63515e-05
-4.12617e-07
1.63854e-05
-4.98909e-07
1.63304e-05
-5.71499e-07
1.65657e-05
-7.35328e-07
1.66955e-05
-7.24937e-07
1.6918e-05
-8.97989e-07
1.73329e-05
-1.03282e-06
1.75728e-05
-1.10989e-06
1.80174e-05
-1.43947e-06
1.84621e-05
-1.50616e-06
1.88231e-05
-1.79595e-06
1.9414e-05
-2.09548e-06
1.98793e-05
-2.1631e-06
2.03962e-05
-2.5717e-06
2.10263e-05
-2.73889e-06
2.15372e-05
-2.91522e-06
2.21115e-05
-3.34832e-06
2.26913e-05
-3.41252e-06
2.31956e-05
-3.7821e-06
2.37201e-05
-4.01842e-06
2.41757e-05
-4.15627e-06
2.46078e-05
-4.45318e-06
2.49776e-05
-4.4108e-06
2.53041e-05
-4.55173e-06
2.55678e-05
-4.53215e-06
2.58301e-05
-4.27838e-06
2.60264e-05
-4.26551e-06
2.62196e-05
-4.0008e-06
2.6426e-05
-3.63438e-06
2.66772e-05
-3.47679e-06
2.69286e-05
-3.09688e-06
2.71984e-05
-2.79561e-06
2.75336e-05
-2.52536e-06
2.79211e-05
-2.23599e-06
2.8227e-05
-2.06532e-06
2.86156e-05
-1.933e-06
2.90534e-05
-1.95166e-06
2.93679e-05
-1.94738e-06
2.9859e-05
-2.09857e-06
3.02587e-05
-2.32558e-06
3.06565e-05
-2.52284e-06
3.11654e-05
-2.86016e-06
3.15527e-05
-3.2128e-06
3.20179e-05
-3.50335e-06
3.24995e-05
-3.95192e-06
3.2861e-05
-4.30696e-06
3.32945e-05
-4.62401e-06
3.37595e-05
-5.08702e-06
3.40961e-05
-5.41661e-06
3.44957e-05
-5.61193e-06
3.4858e-05
-6.17e-06
3.512e-05
-6.14307e-06
3.5469e-05
-6.48093e-06
3.57425e-05
-6.79115e-06
3.59949e-05
-6.74462e-06
3.61663e-05
-6.93911e-06
3.64294e-05
-7.21996e-06
3.66233e-05
-7.02328e-06
3.68107e-05
-7.25485e-06
3.69399e-05
-7.33117e-06
3.72078e-05
-7.11585e-06
3.71446e-05
-7.21958e-06
3.72792e-05
-7.13777e-06
3.72962e-05
-6.8758e-06
3.71649e-05
-6.90179e-06
3.70382e-05
-6.67166e-06
3.68234e-05
-6.44401e-06
3.63466e-05
-6.32046e-06
3.5927e-05
-6.00649e-06
3.53587e-05
-5.93089e-06
3.46103e-05
-5.57154e-06
3.38522e-05
-5.32187e-06
3.29434e-05
-5.00801e-06
3.19692e-05
-4.56177e-06
3.08443e-05
-4.04383e-06
2.98046e-05
-3.60106e-06
2.8671e-05
-2.64371e-06
2.76158e-05
-2.20383e-06
2.63339e-05
-1.20023e-06
2.51118e-05
-3.46429e-07
2.35977e-05
2.82438e-08
2.24542e-05
5.79901e-07
2.12174e-05
1.43771e-06
2.01661e-05
1.57885e-06
1.91188e-05
2.24438e-06
1.84297e-05
2.77815e-06
1.73999e-05
2.88085e-06
1.65553e-05
2.44271e-06
1.55497e-05
3.3673e-06
1.49457e-05
3.86508e-06
1.4795e-05
2.18535e-06
1.34614e-05
1.00491e-06
1.25849e-05
4.19158e-06
1.18769e-05
2.54883e-06
1.11168e-05
1.8266e-06
1.03627e-05
8.38931e-08
1.16966e-05
-6.38345e-06
1.094e-05
-1.02971e-05
1.15597e-05
-1.39563e-05
1.18741e-05
-1.82499e-05
1.31238e-05
-2.13057e-05
1.40588e-05
-2.08852e-05
1.39637e-05
-2.22015e-05
1.36722e-05
-1.81806e-05
1.41051e-05
-1.75051e-05
1.48718e-05
-1.66256e-05
1.51203e-05
-1.56326e-05
1.62679e-05
-1.59955e-05
1.73313e-05
-1.32649e-05
1.77941e-05
-9.35318e-06
1.80434e-05
-4.74174e-06
1.87457e-05
-6.36674e-07
1.90249e-05
3.14514e-06
1.93056e-05
7.20885e-06
1.95985e-05
1.11445e-05
1.97143e-05
1.30112e-05
2.00504e-05
1.47611e-05
2.0865e-05
1.76156e-05
2.12542e-05
2.15966e-05
2.04895e-05
2.41843e-05
1.98191e-05
2.39872e-05
1.95252e-05
2.41299e-05
1.91646e-05
2.48273e-05
1.85763e-05
2.4935e-05
1.7619e-05
2.5181e-05
1.61664e-05
2.28086e-05
1.44259e-05
1.94898e-05
1.28775e-05
1.71437e-05
1.19661e-05
1.47362e-05
1.19024e-05
1.40464e-05
1.21896e-05
1.40108e-05
1.24924e-05
1.43391e-05
1.31217e-05
1.3642e-05
1.32379e-05
1.3409e-05
1.38709e-05
1.22711e-05
1.33163e-05
1.34505e-05
1.34172e-05
1.04078e-05
1.28778e-05
1.24644e-05
1.27727e-05
8.90628e-06
1.22489e-05
1.12745e-05
1.32423e-05
6.77083e-06
1.1838e-05
1.07066e-05
1.34001e-05
3.68482e-06
1.2344e-05
9.38047e-06
1.24205e-05
1.82488e-06
1.16303e-05
7.31924e-06
1.09773e-05
-1.02102e-07
1.04896e-05
4.91395e-06
9.52528e-06
-1.73679e-06
1.00438e-05
2.95698e-06
9.71757e-06
-1.55617e-06
2.90388e-06
1.18345e-05
1.91577e-05
-2.73452e-07
1.935e-05
-4.6152e-07
1.96102e-05
-5.66278e-07
1.98575e-05
-6.19585e-07
2.00059e-05
-5.38544e-07
2.00838e-05
-4.45686e-07
2.01008e-05
-3.37958e-07
2.0109e-05
-2.94727e-07
2.008e-05
-2.15966e-07
2.00562e-05
-2.37602e-07
2.00024e-05
-1.82568e-07
1.99611e-05
-1.90256e-07
1.99308e-05
-1.40605e-07
1.99056e-05
-6.63017e-08
1.99234e-05
-2.81146e-08
1.99422e-05
8.81389e-08
2.00089e-05
1.45382e-07
2.0067e-05
2.15784e-07
2.01466e-05
2.10191e-07
2.02038e-05
2.46436e-07
2.02623e-05
1.42122e-07
2.02867e-05
9.2556e-08
2.02779e-05
-6.92489e-08
2.02486e-05
-1.85337e-07
2.01497e-05
-2.79578e-07
2.0081e-05
-4.08608e-07
1.99864e-05
-3.77642e-07
1.99142e-05
-4.07112e-07
1.98257e-05
-3.19501e-07
1.97376e-05
-2.89859e-07
1.96485e-05
-1.84043e-07
1.95464e-05
-6.8443e-08
1.94689e-05
7.90652e-08
1.93722e-05
3.12907e-07
1.93458e-05
4.99736e-07
1.93059e-05
7.44985e-07
1.93172e-05
9.19319e-07
1.93615e-05
1.07837e-06
1.93539e-05
1.15831e-06
1.94585e-05
1.17699e-06
1.95074e-05
1.14698e-06
1.96056e-05
1.04882e-06
1.97773e-05
9.18766e-07
1.98252e-05
7.47069e-07
2.00143e-05
4.75037e-07
2.00757e-05
2.80802e-07
2.01045e-05
-8.60107e-09
2.0258e-05
-2.6257e-07
2.02641e-05
-4.18705e-07
2.0431e-05
-6.65779e-07
2.05849e-05
-7.25469e-07
2.07705e-05
-9.20883e-07
2.10969e-05
-1.05139e-06
2.13875e-05
-1.18855e-06
2.17803e-05
-1.42558e-06
2.21928e-05
-1.52238e-06
2.26142e-05
-1.86096e-06
2.30922e-05
-1.98411e-06
2.35406e-05
-2.2444e-06
2.40505e-05
-2.60535e-06
2.45399e-05
-2.65246e-06
2.50552e-05
-3.08703e-06
2.55473e-05
-3.23095e-06
2.60592e-05
-3.42716e-06
2.65304e-05
-3.81949e-06
2.69545e-05
-3.83667e-06
2.74103e-05
-4.2379e-06
2.77549e-05
-4.36298e-06
2.80917e-05
-4.49307e-06
2.83971e-05
-4.7586e-06
2.86173e-05
-4.631e-06
2.88383e-05
-4.7727e-06
2.89279e-05
-4.62182e-06
2.90569e-05
-4.40731e-06
2.91216e-05
-4.33026e-06
2.90991e-05
-3.97832e-06
2.92597e-05
-3.79498e-06
2.93289e-05
-3.54589e-06
2.94876e-05
-3.25562e-06
2.97569e-05
-3.06488e-06
2.99435e-05
-2.71201e-06
3.03375e-05
-2.62997e-06
3.05911e-05
-2.31889e-06
3.09203e-05
-2.2622e-06
3.13058e-05
-2.33716e-06
3.15579e-05
-2.19952e-06
3.19573e-05
-2.49791e-06
3.22966e-05
-2.66492e-06
3.25556e-05
-2.78187e-06
3.30043e-05
-3.30883e-06
3.32295e-05
-3.43796e-06
3.35894e-05
-3.86329e-06
3.3884e-05
-4.24648e-06
3.41165e-05
-4.53949e-06
3.43996e-05
-4.90716e-06
3.46499e-05
-5.33728e-06
3.47947e-05
-5.56142e-06
3.50158e-05
-5.83303e-06
3.51307e-05
-6.28491e-06
3.53081e-05
-6.32047e-06
3.54122e-05
-6.58501e-06
3.55292e-05
-6.90816e-06
3.56483e-05
-6.8637e-06
3.57686e-05
-7.0594e-06
3.58878e-05
-7.33916e-06
3.60667e-05
-7.20214e-06
3.61745e-05
-7.36271e-06
3.62647e-05
-7.42138e-06
3.64644e-05
-7.31558e-06
3.64833e-05
-7.23844e-06
3.65678e-05
-7.22227e-06
3.66407e-05
-6.94874e-06
3.65731e-05
-6.83416e-06
3.64407e-05
-6.53924e-06
3.63273e-05
-6.33066e-06
3.59888e-05
-5.98188e-06
3.56922e-05
-5.70997e-06
3.52106e-05
-5.44924e-06
3.46045e-05
-4.96548e-06
3.38903e-05
-4.60768e-06
3.31421e-05
-4.25981e-06
3.22101e-05
-3.62972e-06
3.13862e-05
-3.21997e-06
3.03829e-05
-2.59775e-06
2.93564e-05
-1.61725e-06
2.82753e-05
-1.12273e-06
2.70385e-05
3.6659e-08
2.58302e-05
8.61871e-07
2.45092e-05
1.34916e-06
2.31474e-05
1.94169e-06
2.18985e-05
2.68667e-06
2.09196e-05
2.55776e-06
1.99085e-05
3.25545e-06
1.88191e-05
3.86758e-06
1.78378e-05
3.86208e-06
1.70624e-05
3.21817e-06
1.62705e-05
4.15919e-06
1.53013e-05
4.83426e-06
1.48234e-05
2.66324e-06
1.27191e-05
3.10928e-06
1.21592e-05
4.75146e-06
1.13692e-05
3.33887e-06
1.05164e-05
2.67935e-06
1.01641e-05
4.36256e-07
1.08534e-05
-7.0728e-06
1.01468e-05
-9.59049e-06
1.07201e-05
-1.45296e-05
1.09684e-05
-1.84983e-05
1.18754e-05
-2.22126e-05
1.22425e-05
-2.12524e-05
1.19821e-05
-2.19411e-05
1.22395e-05
-1.8438e-05
1.34848e-05
-1.87504e-05
1.39538e-05
-1.70946e-05
1.38301e-05
-1.55089e-05
1.42536e-05
-1.6419e-05
1.48887e-05
-1.39001e-05
1.53659e-05
-9.83037e-06
1.57314e-05
-5.10727e-06
1.64798e-05
-1.38508e-06
1.69151e-05
2.70987e-06
1.69735e-05
7.15043e-06
1.7374e-05
1.0744e-05
1.78063e-05
1.25789e-05
1.83287e-05
1.42387e-05
1.87014e-05
1.72429e-05
1.95678e-05
2.07302e-05
1.99731e-05
2.3779e-05
1.9328e-05
2.46322e-05
1.8776e-05
2.46819e-05
1.8362e-05
2.52413e-05
1.77912e-05
2.55058e-05
1.73717e-05
2.56006e-05
1.61913e-05
2.3989e-05
1.46793e-05
2.10018e-05
1.34669e-05
1.83562e-05
1.2139e-05
1.6064e-05
1.16405e-05
1.45448e-05
1.20679e-05
1.35834e-05
1.23696e-05
1.40374e-05
1.2808e-05
1.32036e-05
1.26088e-05
1.36082e-05
1.31262e-05
1.17537e-05
1.28821e-05
1.36946e-05
1.31685e-05
1.01215e-05
1.28935e-05
1.27393e-05
1.35111e-05
8.28875e-06
1.23694e-05
1.24162e-05
1.36974e-05
5.44283e-06
1.32141e-05
1.119e-05
1.2952e-05
3.94684e-06
1.3034e-05
9.29847e-06
1.20579e-05
2.80102e-06
1.22282e-05
7.14891e-06
1.09887e-05
1.13741e-06
1.15551e-05
4.34759e-06
1.04049e-05
-5.86607e-07
1.11706e-05
2.19129e-06
1.0952e-05
-1.33755e-06
9.38816e-07
1.2917e-05
2.44938e-05
-5.34144e-07
2.49514e-05
-9.19129e-07
2.53313e-05
-9.46216e-07
2.55076e-05
-7.95905e-07
2.55637e-05
-5.94647e-07
2.55634e-05
-4.45378e-07
2.55437e-05
-3.18256e-07
2.55026e-05
-2.53623e-07
2.5461e-05
-1.74373e-07
2.542e-05
-1.96588e-07
2.53689e-05
-1.31398e-07
2.53314e-05
-1.52801e-07
2.52956e-05
-1.04819e-07
2.52717e-05
-4.2407e-08
2.52687e-05
-2.50604e-08
2.52935e-05
6.33428e-08
2.531e-05
1.28837e-07
2.53863e-05
1.39507e-07
2.54188e-05
1.77663e-07
2.54789e-05
1.86342e-07
2.5517e-05
1.04037e-07
2.55165e-05
9.30544e-08
2.55101e-05
-6.28308e-08
2.54458e-05
-1.21025e-07
2.53838e-05
-2.17645e-07
2.52731e-05
-2.97858e-07
2.51966e-05
-3.01173e-07
2.50818e-05
-2.92331e-07
2.50199e-05
-2.57614e-07
2.49029e-05
-1.72834e-07
2.48246e-05
-1.05687e-07
2.47375e-05
1.8608e-08
2.46224e-05
1.94158e-07
2.46197e-05
3.15639e-07
2.45351e-05
5.84301e-07
2.45643e-05
7.15833e-07
2.45726e-05
9.11005e-07
2.4599e-05
1.05191e-06
2.46584e-05
1.099e-06
2.46937e-05
1.14165e-06
2.4756e-05
1.08471e-06
2.47874e-05
1.01739e-06
2.48618e-05
8.44378e-07
2.48933e-05
7.15514e-07
2.49377e-05
4.30694e-07
2.50021e-05
2.16369e-07
2.50177e-05
-2.41868e-08
2.51154e-05
-3.60292e-07
2.51791e-05
-4.82376e-07
2.53005e-05
-7.87222e-07
2.54898e-05
-9.1478e-07
2.5657e-05
-1.08801e-06
2.5953e-05
-1.34739e-06
2.6238e-05
-1.47354e-06
2.65431e-05
-1.73066e-06
2.69474e-05
-1.9267e-06
2.7268e-05
-2.18159e-06
2.76631e-05
-2.37918e-06
2.80772e-05
-2.65853e-06
2.84046e-05
-2.93279e-06
2.88326e-05
-3.08043e-06
2.922e-05
-3.47445e-06
2.95263e-05
-3.53721e-06
2.9907e-05
-3.8079e-06
3.0177e-05
-4.08946e-06
3.04033e-05
-4.06296e-06
3.06636e-05
-4.49823e-06
3.07936e-05
-4.49302e-06
3.09398e-05
-4.63919e-06
3.10753e-05
-4.89413e-06
3.11241e-05
-4.67983e-06
3.11754e-05
-4.82401e-06
3.11638e-05
-4.61019e-06
3.10908e-05
-4.33434e-06
3.10148e-05
-4.25419e-06
3.08582e-05
-3.82178e-06
3.08061e-05
-3.74288e-06
3.07363e-05
-3.47605e-06
3.07687e-05
-3.28808e-06
3.08762e-05
-3.17237e-06
3.10344e-05
-2.87015e-06
3.12893e-05
-2.88485e-06
3.15124e-05
-2.54203e-06
3.17795e-05
-2.52931e-06
3.20672e-05
-2.62482e-06
3.22858e-05
-2.41813e-06
3.25739e-05
-2.78604e-06
3.27956e-05
-2.88657e-06
3.3024e-05
-3.01033e-06
3.32748e-05
-3.55958e-06
3.34393e-05
-3.60245e-06
3.36297e-05
-4.05376e-06
3.38168e-05
-4.43358e-06
3.39208e-05
-4.64344e-06
3.40931e-05
-5.0795e-06
3.41575e-05
-5.40166e-06
3.42607e-05
-5.66466e-06
3.4396e-05
-5.96834e-06
3.43901e-05
-6.27892e-06
3.45785e-05
-6.50893e-06
3.46185e-05
-6.62504e-06
3.47474e-05
-7.03699e-06
3.49235e-05
-7.0398e-06
3.51409e-05
-7.27688e-06
3.52699e-05
-7.4681e-06
3.55541e-05
-7.48636e-06
3.574e-05
-7.54861e-06
3.5921e-05
-7.60233e-06
3.61469e-05
-7.54149e-06
3.63374e-05
-7.42897e-06
3.63993e-05
-7.28417e-06
3.66097e-05
-7.15918e-06
3.6583e-05
-6.80744e-06
3.65712e-05
-6.52747e-06
3.65042e-05
-6.26363e-06
3.62873e-05
-5.76497e-06
3.59567e-05
-5.37932e-06
3.54957e-05
-4.98826e-06
3.49484e-05
-4.41824e-06
3.42451e-05
-3.90436e-06
3.35911e-05
-3.60578e-06
3.27232e-05
-2.76184e-06
3.18644e-05
-2.3612e-06
3.08077e-05
-1.54105e-06
2.98328e-05
-6.42283e-07
2.86748e-05
3.52904e-08
2.76073e-05
1.10407e-06
2.63245e-05
2.14468e-06
2.50519e-05
2.6218e-06
2.37117e-05
3.28186e-06
2.25266e-05
3.87181e-06
2.12493e-05
3.83509e-06
2.02172e-05
4.28745e-06
1.9155e-05
4.9298e-06
1.8245e-05
4.7721e-06
1.70445e-05
4.41863e-06
1.59856e-05
5.2181e-06
1.53558e-05
5.46404e-06
1.51429e-05
2.87621e-06
1.36878e-05
4.5643e-06
1.28534e-05
5.58587e-06
1.16592e-05
4.53311e-06
1.06331e-05
3.7054e-06
1.06116e-05
4.57791e-07
1.00001e-05
-6.46133e-06
1.00672e-05
-9.65752e-06
1.00306e-05
-1.4493e-05
1.03406e-05
-1.88083e-05
1.013e-05
-2.20019e-05
1.03704e-05
-2.14929e-05
1.07108e-05
-2.22815e-05
1.16505e-05
-1.93776e-05
1.32968e-05
-2.03967e-05
1.30432e-05
-1.68411e-05
1.21049e-05
-1.45705e-05
1.21552e-05
-1.64693e-05
1.25521e-05
-1.42971e-05
1.29909e-05
-1.02691e-05
1.38062e-05
-5.92254e-06
1.41739e-05
-1.7528e-06
1.48131e-05
2.07069e-06
1.4998e-05
6.96553e-06
1.52185e-05
1.05234e-05
1.56501e-05
1.21474e-05
1.66981e-05
1.31907e-05
1.7121e-05
1.682e-05
1.73136e-05
2.05376e-05
1.81052e-05
2.29875e-05
1.82785e-05
2.44589e-05
1.83099e-05
2.46505e-05
1.81964e-05
2.53548e-05
1.76809e-05
2.60213e-05
1.73267e-05
2.59548e-05
1.63317e-05
2.4984e-05
1.48521e-05
2.24814e-05
1.36261e-05
1.95822e-05
1.26398e-05
1.70503e-05
1.17813e-05
1.54034e-05
1.16814e-05
1.36833e-05
1.17554e-05
1.39634e-05
1.23253e-05
1.26337e-05
1.2224e-05
1.37095e-05
1.25724e-05
1.14053e-05
1.25715e-05
1.36955e-05
1.33853e-05
9.30766e-06
1.29727e-05
1.31519e-05
1.39073e-05
7.3542e-06
1.34465e-05
1.2877e-05
1.296e-05
5.92929e-06
1.33093e-05
1.08407e-05
1.27128e-05
4.54331e-06
1.32895e-05
8.72182e-06
1.24214e-05
3.6691e-06
1.30901e-05
6.48023e-06
1.22869e-05
1.94061e-06
1.30903e-05
3.54419e-06
1.26723e-05
-1.68608e-07
1.41088e-05
7.5475e-07
1.41581e-05
-1.38682e-06
-7.61638e-07
1.58585e-05
2.99034e-05
-3.53229e-07
2.96427e-05
-6.58452e-07
2.9524e-05
-8.27499e-07
2.94991e-05
-7.71025e-07
2.95073e-05
-6.02872e-07
2.94696e-05
-4.07661e-07
2.94623e-05
-3.10971e-07
2.94092e-05
-2.00469e-07
2.93601e-05
-1.25328e-07
2.93246e-05
-1.61056e-07
2.92447e-05
-5.15374e-08
2.9249e-05
-1.57048e-07
2.91717e-05
-2.75397e-08
2.92076e-05
-7.83222e-08
2.91653e-05
1.72902e-08
2.92287e-05
-1.06753e-10
2.92164e-05
1.41142e-07
2.92912e-05
6.47135e-08
2.933e-05
1.38837e-07
2.93582e-05
1.5822e-07
2.9444e-05
1.81786e-08
2.93826e-05
1.54435e-07
2.94556e-05
-1.35805e-07
2.93281e-05
6.51778e-09
2.9318e-05
-2.07598e-07
2.92106e-05
-1.9048e-07
2.91161e-05
-2.06652e-07
2.90553e-05
-2.31554e-07
2.89255e-05
-1.2772e-07
2.88852e-05
-1.32545e-07
2.87416e-05
3.78835e-08
2.8691e-05
6.91651e-08
2.85945e-05
2.90709e-07
2.85709e-05
3.39196e-07
2.85722e-05
5.83e-07
2.86048e-05
6.83268e-07
2.86738e-05
8.41963e-07
2.87455e-05
9.80218e-07
2.8846e-05
9.98536e-07
2.89182e-05
1.06948e-06
2.90353e-05
9.67566e-07
2.9123e-05
9.29712e-07
2.92038e-05
7.6356e-07
2.93261e-05
5.93209e-07
2.93449e-05
4.11917e-07
2.9423e-05
1.3828e-07
2.94655e-05
-6.67252e-08
2.94652e-05
-3.59999e-07
2.95798e-05
-5.96997e-07
2.96022e-05
-8.09575e-07
2.97383e-05
-1.05084e-06
2.99073e-05
-1.25709e-06
3.00493e-05
-1.48936e-06
3.02794e-05
-1.7036e-06
3.04848e-05
-1.93614e-06
3.07135e-05
-2.15539e-06
3.09276e-05
-2.3957e-06
3.11784e-05
-2.62992e-06
3.14073e-05
-2.88744e-06
3.16141e-05
-3.13959e-06
3.18843e-05
-3.35063e-06
3.20345e-05
-3.62469e-06
3.22185e-05
-3.72121e-06
3.23567e-05
-3.94605e-06
3.23589e-05
-4.09163e-06
3.24574e-05
-4.16146e-06
3.23732e-05
-4.41405e-06
3.23578e-05
-4.47769e-06
3.23133e-05
-4.59463e-06
3.21985e-05
-4.77932e-06
3.21786e-05
-4.65995e-06
3.20327e-05
-4.67814e-06
3.19115e-05
-4.48897e-06
3.17794e-05
-4.20227e-06
3.15263e-05
-4.00108e-06
3.13938e-05
-3.68924e-06
3.11688e-05
-3.51792e-06
3.10339e-05
-3.3411e-06
3.09628e-05
-3.217e-06
3.09239e-05
-3.13344e-06
3.10234e-05
-2.96974e-06
3.10829e-05
-2.94428e-06
3.13091e-05
-2.76821e-06
3.14769e-05
-2.69713e-06
3.16695e-05
-2.81743e-06
3.1912e-05
-2.66062e-06
3.20848e-05
-2.95886e-06
3.22817e-05
-3.08351e-06
3.25041e-05
-3.23271e-06
3.25945e-05
-3.64997e-06
3.27956e-05
-3.80361e-06
3.28817e-05
-4.13979e-06
3.30125e-05
-4.5644e-06
3.31169e-05
-4.74785e-06
3.32463e-05
-5.2089e-06
3.3308e-05
-5.4634e-06
3.34965e-05
-5.85314e-06
3.36139e-05
-6.08576e-06
3.37369e-05
-6.40186e-06
3.39582e-05
-6.73021e-06
3.42124e-05
-6.87929e-06
3.43833e-05
-7.20789e-06
3.47641e-05
-7.42055e-06
3.50214e-05
-7.53422e-06
3.52913e-05
-7.73803e-06
3.55918e-05
-7.78687e-06
3.58859e-05
-7.84263e-06
3.60868e-05
-7.80328e-06
3.63247e-05
-7.77937e-06
3.65645e-05
-7.66881e-06
3.66614e-05
-7.381e-06
3.68381e-05
-7.33588e-06
3.68697e-05
-6.83912e-06
3.68408e-05
-6.4985e-06
3.67181e-05
-6.14101e-06
3.6445e-05
-5.49177e-06
3.60651e-05
-4.99948e-06
3.56124e-05
-4.53551e-06
3.49871e-05
-3.79295e-06
3.43777e-05
-3.29495e-06
3.35685e-05
-2.79662e-06
3.27272e-05
-1.92058e-06
3.1762e-05
-1.39595e-06
3.07799e-05
-5.58928e-07
2.97394e-05
3.98134e-07
2.85887e-05
1.18607e-06
2.74781e-05
2.21465e-06
2.63229e-05
3.29985e-06
2.50857e-05
3.85903e-06
2.37684e-05
4.59913e-06
2.26499e-05
4.99031e-06
2.14711e-05
5.01392e-06
2.03399e-05
5.41865e-06
1.91973e-05
6.07244e-06
1.84013e-05
5.56809e-06
1.73083e-05
5.51158e-06
1.61041e-05
6.42234e-06
1.56635e-05
5.90463e-06
1.48833e-05
3.65641e-06
1.37286e-05
5.71898e-06
1.26323e-05
6.68217e-06
1.10513e-05
6.11418e-06
9.94213e-06
4.81452e-06
1.00704e-05
3.2955e-07
9.01528e-06
-5.40623e-06
9.03e-06
-9.67225e-06
8.99499e-06
-1.4458e-05
9.13023e-06
-1.89436e-05
8.22601e-06
-2.10977e-05
9.14818e-06
-2.2415e-05
1.01758e-05
-2.33091e-05
1.15592e-05
-2.07611e-05
1.22921e-05
-2.11296e-05
1.13728e-05
-1.59218e-05
9.96569e-06
-1.31634e-05
1.02293e-05
-1.67328e-05
1.02258e-05
-1.42936e-05
1.04984e-05
-1.05417e-05
1.15997e-05
-7.02381e-06
1.21088e-05
-2.26187e-06
1.23004e-05
1.87906e-06
1.27393e-05
6.52661e-06
1.33773e-05
9.88546e-06
1.37085e-05
1.18162e-05
1.45845e-05
1.23147e-05
1.57218e-05
1.56827e-05
1.59097e-05
2.03496e-05
1.63613e-05
2.25359e-05
1.67265e-05
2.40937e-05
1.6909e-05
2.44681e-05
1.73248e-05
2.4939e-05
1.73436e-05
2.60024e-05
1.72737e-05
2.60247e-05
1.69352e-05
2.53224e-05
1.60454e-05
2.33712e-05
1.4822e-05
2.08056e-05
1.39494e-05
1.79229e-05
1.30489e-05
1.63038e-05
1.26799e-05
1.40524e-05
1.23269e-05
1.43164e-05
1.24444e-05
1.25162e-05
1.22599e-05
1.3894e-05
1.29278e-05
1.07374e-05
1.30759e-05
1.35474e-05
1.37633e-05
8.62022e-06
1.35635e-05
1.33517e-05
1.34444e-05
7.47328e-06
1.38063e-05
1.2515e-05
1.31485e-05
6.5871e-06
1.39876e-05
1.00016e-05
1.33471e-05
5.1838e-06
1.45032e-05
7.56565e-06
1.41948e-05
3.9775e-06
1.5576e-05
5.0991e-06
1.51732e-05
2.3434e-06
1.66048e-05
2.11257e-06
1.64947e-05
-5.8507e-08
1.7554e-05
-3.04501e-07
1.81168e-05
-1.94964e-06
-2.0457e-06
1.94008e-05
3.1965e-05
-3.38942e-07
3.17455e-05
-4.38944e-07
3.15773e-05
-6.59281e-07
3.14187e-05
-6.12424e-07
3.13923e-05
-5.76457e-07
3.13479e-05
-3.63256e-07
3.13451e-05
-3.08207e-07
3.13226e-05
-1.77951e-07
3.12825e-05
-8.51904e-08
3.12704e-05
-1.48952e-07
3.11896e-05
2.92166e-08
3.11921e-05
-1.5955e-07
3.1121e-05
4.36034e-08
3.11594e-05
-1.16785e-07
3.11448e-05
3.19546e-08
3.11905e-05
-4.58866e-08
3.12182e-05
1.13522e-07
3.12454e-05
3.74562e-08
3.12945e-05
8.97878e-08
3.1293e-05
1.59715e-07
3.13637e-05
-5.25829e-08
3.13435e-05
1.74644e-07
3.13878e-05
-1.80081e-07
3.13643e-05
3.00443e-08
3.13179e-05
-1.61251e-07
3.13062e-05
-1.78722e-07
3.11899e-05
-9.04306e-08
3.11714e-05
-2.12968e-07
3.10626e-05
-1.8931e-08
3.10008e-05
-7.0786e-08
3.09458e-05
9.29095e-08
3.08401e-05
1.74888e-07
3.08446e-05
2.86215e-07
3.07832e-05
4.00513e-07
3.08438e-05
5.22495e-07
3.09185e-05
6.0852e-07
3.10155e-05
7.44913e-07
3.11793e-05
8.16423e-07
3.13022e-05
8.75715e-07
3.14261e-05
9.45553e-07
3.15453e-05
8.48358e-07
3.16466e-05
8.28418e-07
3.17362e-05
6.73961e-07
3.18798e-05
4.4963e-07
3.19675e-05
3.24162e-07
3.21032e-05
2.58718e-09
3.22288e-05
-1.92287e-07
3.22994e-05
-4.30592e-07
3.24475e-05
-7.45089e-07
3.24929e-05
-8.54968e-07
3.26018e-05
-1.15982e-06
3.26816e-05
-1.33681e-06
3.27166e-05
-1.52438e-06
3.27854e-05
-1.77247e-06
3.281e-05
-1.96074e-06
3.28534e-05
-2.19876e-06
3.28934e-05
-2.43567e-06
3.29655e-05
-2.70199e-06
3.30266e-05
-2.94862e-06
3.30896e-05
-3.20253e-06
3.31701e-05
-3.43119e-06
3.31385e-05
-3.59301e-06
3.31677e-05
-3.75045e-06
3.3069e-05
-3.84738e-06
3.29332e-05
-3.95584e-06
3.28585e-05
-4.08675e-06
3.26141e-05
-4.16965e-06
3.24837e-05
-4.34726e-06
3.23238e-05
-4.43468e-06
3.20535e-05
-4.5091e-06
3.19536e-05
-4.56004e-06
3.1678e-05
-4.40254e-06
3.14996e-05
-4.31057e-06
3.1339e-05
-4.0417e-06
3.11352e-05
-3.79723e-06
3.10522e-05
-3.60622e-06
3.09201e-05
-3.38587e-06
3.08407e-05
-3.26164e-06
3.07783e-05
-3.15465e-06
3.07271e-05
-3.08222e-06
3.07159e-05
-2.95853e-06
3.07278e-05
-2.95623e-06
3.08249e-05
-2.86528e-06
3.09608e-05
-2.83296e-06
3.10495e-05
-2.90616e-06
3.13347e-05
-2.94583e-06
3.14275e-05
-3.05162e-06
3.16621e-05
-3.31814e-06
3.18273e-05
-3.39792e-06
3.19384e-05
-3.76104e-06
3.21226e-05
-3.98786e-06
3.22706e-05
-4.28779e-06
3.23861e-05
-4.67984e-06
3.26064e-05
-4.96816e-06
3.27502e-05
-5.35267e-06
3.29507e-05
-5.66396e-06
3.31535e-05
-6.05592e-06
3.34092e-05
-6.34146e-06
3.36171e-05
-6.6097e-06
3.39263e-05
-7.03944e-06
3.4266e-05
-7.219e-06
3.44843e-05
-7.42616e-06
3.48466e-05
-7.78283e-06
3.50883e-05
-7.776e-06
3.52991e-05
-7.94874e-06
3.55464e-05
-8.03419e-06
3.57504e-05
-8.04667e-06
3.58876e-05
-7.94045e-06
3.60494e-05
-7.94119e-06
3.61717e-05
-7.79111e-06
3.62417e-05
-7.45095e-06
3.62317e-05
-7.32596e-06
3.62209e-05
-6.82823e-06
3.6048e-05
-6.32562e-06
3.5826e-05
-5.91904e-06
3.55121e-05
-5.1779e-06
3.51157e-05
-4.60306e-06
3.4594e-05
-4.01381e-06
3.39865e-05
-3.18542e-06
3.33675e-05
-2.67593e-06
3.2522e-05
-1.95111e-06
3.17208e-05
-1.11941e-06
3.08152e-05
-4.90333e-07
2.98135e-05
4.42725e-07
2.87907e-05
1.42098e-06
2.77703e-05
2.20643e-06
2.65956e-05
3.38937e-06
2.55537e-05
4.34178e-06
2.44885e-05
4.92424e-06
2.33139e-05
5.77376e-06
2.21878e-05
6.11635e-06
2.11099e-05
6.0918e-06
1.99988e-05
6.52976e-06
1.90089e-05
7.0624e-06
1.80016e-05
6.57535e-06
1.68993e-05
6.61383e-06
1.56817e-05
7.64003e-06
1.53448e-05
6.24148e-06
1.42932e-05
4.70798e-06
1.3136e-05
6.8762e-06
1.21326e-05
7.68558e-06
1.09253e-05
7.32147e-06
9.94109e-06
5.79875e-06
9.61422e-06
6.56413e-07
8.80734e-06
-4.59935e-06
8.1961e-06
-9.061e-06
8.31948e-06
-1.45814e-05
7.96095e-06
-1.8585e-05
7.01405e-06
-2.01508e-05
7.9454e-06
-2.33464e-05
8.79432e-06
-2.4158e-05
9.87765e-06
-2.18444e-05
9.41848e-06
-2.06704e-05
8.96787e-06
-1.54711e-05
8.15904e-06
-1.23546e-05
8.54628e-06
-1.71201e-05
8.05611e-06
-1.38034e-05
8.23623e-06
-1.07219e-05
9.01532e-06
-7.8029e-06
9.82019e-06
-3.06674e-06
1.00897e-05
1.6096e-06
1.02461e-05
6.37015e-06
1.11013e-05
9.03024e-06
1.23415e-05
1.0576e-05
1.26423e-05
1.20139e-05
1.36082e-05
1.47169e-05
1.43485e-05
1.96093e-05
1.49328e-05
2.19516e-05
1.56116e-05
2.34149e-05
1.58788e-05
2.42009e-05
1.64013e-05
2.44165e-05
1.6758e-05
2.56457e-05
1.69118e-05
2.58709e-05
1.702e-05
2.52142e-05
1.67751e-05
2.36162e-05
1.58758e-05
2.17049e-05
1.50579e-05
1.87408e-05
1.41793e-05
1.71824e-05
1.36424e-05
1.45892e-05
1.31581e-05
1.48007e-05
1.33502e-05
1.23242e-05
1.325e-05
1.39941e-05
1.36168e-05
1.03706e-05
1.36282e-05
1.3536e-05
1.36313e-05
8.61719e-06
1.41275e-05
1.28555e-05
1.37707e-05
7.83011e-06
1.50574e-05
1.12283e-05
1.47588e-05
6.88568e-06
1.60646e-05
8.69585e-06
1.55905e-05
5.65793e-06
1.7161e-05
5.99515e-06
1.72429e-05
3.89559e-06
1.87902e-05
3.55178e-06
1.89477e-05
2.18591e-06
1.9683e-05
1.37725e-06
2.02062e-05
-5.81728e-07
2.10546e-05
-1.15283e-06
2.17849e-05
-2.68001e-06
-2.6534e-06
2.23926e-05
3.23193e-05
-2.94218e-07
3.2148e-05
-2.67645e-07
3.19605e-05
-4.71789e-07
3.17421e-05
-3.94044e-07
3.16237e-05
-4.58011e-07
3.15529e-05
-2.92492e-07
3.15177e-05
-2.72957e-07
3.15173e-05
-1.77588e-07
3.1519e-05
-8.68332e-08
3.15201e-05
-1.50121e-07
3.15372e-05
1.21011e-08
3.15188e-05
-1.41141e-07
3.15452e-05
1.72258e-08
3.1542e-05
-1.13599e-07
3.15889e-05
-1.49386e-08
3.15894e-05
-4.63965e-08
3.16523e-05
5.06347e-08
3.16458e-05
4.39541e-08
3.16778e-05
5.77969e-08
3.1702e-05
1.35567e-07
3.16935e-05
-4.40982e-08
3.17609e-05
1.07221e-07
3.17066e-05
-1.25751e-07
3.17838e-05
-4.72087e-08
3.17145e-05
-9.19757e-08
3.17396e-05
-2.03804e-07
3.16738e-05
-2.45627e-08
3.1628e-05
-1.67174e-07
3.15809e-05
2.81426e-08
3.14801e-05
3.0057e-08
3.14905e-05
8.24444e-08
3.14103e-05
2.55141e-07
3.14758e-05
2.20643e-07
3.14653e-05
4.11057e-07
3.15294e-05
4.58349e-07
3.15979e-05
5.40038e-07
3.1681e-05
6.61788e-07
3.18141e-05
6.83336e-07
3.19596e-05
7.30246e-07
3.21206e-05
7.84537e-07
3.22747e-05
6.94283e-07
3.24354e-05
6.67749e-07
3.25584e-05
5.50872e-07
3.27067e-05
3.01411e-07
3.28322e-05
1.98585e-07
3.29789e-05
-1.44057e-07
3.31189e-05
-3.32268e-07
3.32652e-05
-5.76969e-07
3.33598e-05
-8.39691e-07
3.3478e-05
-9.73119e-07
3.35208e-05
-1.20259e-06
3.35134e-05
-1.32948e-06
3.35232e-05
-1.53417e-06
3.3448e-05
-1.69723e-06
3.34314e-05
-1.94418e-06
3.33954e-05
-2.16269e-06
3.33838e-05
-2.42408e-06
3.33793e-05
-2.69747e-06
3.33435e-05
-2.91289e-06
3.33103e-05
-3.16927e-06
3.31978e-05
-3.31872e-06
3.3072e-05
-3.46718e-06
3.29342e-05
-3.61271e-06
3.27529e-05
-3.66607e-06
3.26269e-05
-3.82987e-06
3.24846e-05
-3.94436e-06
3.23083e-05
-3.99337e-06
3.21623e-05
-4.20131e-06
3.193e-05
-4.20232e-06
3.16567e-05
-4.2358e-06
3.14307e-05
-4.33408e-06
3.11513e-05
-4.12313e-06
3.0961e-05
-4.12022e-06
3.08579e-05
-3.9386e-06
3.07549e-05
-3.69431e-06
3.07696e-05
-3.62085e-06
3.07496e-05
-3.36585e-06
3.07349e-05
-3.24696e-06
3.07492e-05
-3.16898e-06
3.06894e-05
-3.02244e-06
3.07409e-05
-3.00999e-06
3.07299e-05
-2.94523e-06
3.08255e-05
-2.96089e-06
3.09315e-05
-2.93894e-06
3.10522e-05
-3.02693e-06
3.12095e-05
-3.10306e-06
3.13694e-05
-3.21151e-06
3.14583e-05
-3.40707e-06
3.16488e-05
-3.58846e-06
3.17363e-05
-3.84851e-06
3.19283e-05
-4.17987e-06
3.21049e-05
-4.46435e-06
3.22671e-05
-4.84208e-06
3.25268e-05
-5.22787e-06
3.26982e-05
-5.52408e-06
3.29421e-05
-5.90782e-06
3.31394e-05
-6.25326e-06
3.33932e-05
-6.59521e-06
3.36466e-05
-6.86311e-06
3.38827e-05
-7.2756e-06
3.41168e-05
-7.45306e-06
3.43508e-05
-7.66018e-06
3.44669e-05
-7.8989e-06
3.46532e-05
-7.96229e-06
3.47379e-05
-8.0335e-06
3.48204e-05
-8.11662e-06
3.48492e-05
-8.07549e-06
3.48706e-05
-7.96191e-06
3.48309e-05
-7.90147e-06
3.47399e-05
-7.70008e-06
3.4634e-05
-7.3451e-06
3.44194e-05
-7.11137e-06
3.42095e-05
-6.61832e-06
3.39294e-05
-6.04546e-06
3.36089e-05
-5.59855e-06
3.32385e-05
-4.80755e-06
3.27935e-05
-4.15806e-06
3.23019e-05
-3.52223e-06
3.17519e-05
-2.63539e-06
3.112e-05
-2.04406e-06
3.04147e-05
-1.24579e-06
2.97105e-05
-4.15242e-07
2.89318e-05
2.88394e-07
2.80477e-05
1.32683e-06
2.71398e-05
2.32886e-06
2.62183e-05
3.12797e-06
2.52735e-05
4.33419e-06
2.43467e-05
5.2685e-06
2.33154e-05
5.95554e-06
2.22127e-05
6.87648e-06
2.12043e-05
7.12474e-06
2.02539e-05
7.04217e-06
1.90788e-05
7.70493e-06
1.82473e-05
7.8939e-06
1.75453e-05
7.27731e-06
1.67931e-05
7.36601e-06
1.58687e-05
8.56443e-06
1.51987e-05
6.91152e-06
1.38071e-05
6.0996e-06
1.25884e-05
8.09484e-06
1.15468e-05
8.72726e-06
1.06483e-05
8.21993e-06
1.02715e-05
6.17559e-06
9.69513e-06
1.23274e-06
9.04182e-06
-3.94604e-06
8.37685e-06
-8.39604e-06
8.20395e-06
-1.44085e-05
7.59724e-06
-1.79783e-05
6.84404e-06
-1.93976e-05
6.25224e-06
-2.27546e-05
5.6615e-06
-2.35672e-05
5.79671e-06
-2.19796e-05
5.45931e-06
-2.0333e-05
6.51606e-06
-1.65279e-05
7.54056e-06
-1.33791e-05
7.18411e-06
-1.67636e-05
5.97191e-06
-1.25912e-05
5.89146e-06
-1.06414e-05
6.99532e-06
-8.90677e-06
6.9583e-06
-3.02971e-06
7.74461e-06
8.23283e-07
8.28422e-06
5.83055e-06
8.56378e-06
8.75068e-06
1.03116e-05
8.82818e-06
1.12694e-05
1.1056e-05
1.18623e-05
1.4124e-05
1.26495e-05
1.88222e-05
1.31554e-05
2.14456e-05
1.41168e-05
2.24535e-05
1.4805e-05
2.35127e-05
1.54558e-05
2.37658e-05
1.61683e-05
2.49332e-05
1.66583e-05
2.53808e-05
1.68242e-05
2.50484e-05
1.67527e-05
2.36876e-05
1.63218e-05
2.21358e-05
1.58605e-05
1.92021e-05
1.52333e-05
1.78096e-05
1.47816e-05
1.5041e-05
1.42349e-05
1.53474e-05
1.44066e-05
1.21525e-05
1.44891e-05
1.39115e-05
1.45371e-05
1.03226e-05
1.49235e-05
1.31497e-05
1.4603e-05
8.93765e-06
1.57491e-05
1.17094e-05
1.54779e-05
8.10132e-06
1.71283e-05
9.57786e-06
1.70049e-05
7.00909e-06
1.86655e-05
7.03527e-06
1.87422e-05
5.5812e-06
2.01615e-05
4.57584e-06
2.04953e-05
3.56184e-06
2.12931e-05
2.75398e-06
2.226e-05
1.21904e-06
2.26993e-05
9.37948e-07
2.33791e-05
-1.26152e-06
2.40186e-05
-1.79238e-06
2.46681e-05
-3.32946e-06
-2.93425e-06
2.49489e-05
3.21291e-05
-1.95459e-07
3.19906e-05
-1.29155e-07
3.18013e-05
-2.82513e-07
3.15972e-05
-1.89918e-07
3.14388e-05
-2.99642e-07
3.1346e-05
-1.99635e-07
3.12798e-05
-2.06829e-07
3.12854e-05
-1.83115e-07
3.12941e-05
-9.55429e-08
3.13225e-05
-1.7854e-07
3.13865e-05
-5.19257e-08
3.13757e-05
-1.30294e-07
3.14367e-05
-4.38429e-08
3.14079e-05
-8.47539e-08
3.14618e-05
-6.88668e-08
3.14354e-05
-1.9968e-08
3.15254e-05
-3.94149e-08
3.15046e-05
6.47984e-08
3.15598e-05
2.63882e-09
3.16017e-05
9.36371e-08
3.15499e-05
7.63858e-09
3.16583e-05
-1.12686e-09
3.15722e-05
-3.96379e-08
3.16276e-05
-1.02627e-07
3.16066e-05
-7.09253e-08
3.15546e-05
-1.5189e-07
3.15691e-05
-3.90658e-08
3.14954e-05
-9.33976e-08
3.14966e-05
2.68655e-08
3.14838e-05
4.29413e-08
3.14905e-05
7.57054e-08
3.15215e-05
2.24153e-07
3.15235e-05
2.18631e-07
3.15508e-05
3.83757e-07
3.15384e-05
4.70782e-07
3.15452e-05
5.33186e-07
3.15709e-05
6.36154e-07
3.16177e-05
6.36486e-07
3.17327e-05
6.15243e-07
3.19035e-05
6.13764e-07
3.21307e-05
4.67097e-07
3.2377e-05
4.21426e-07
3.2659e-05
2.68841e-07
3.28542e-05
1.06271e-07
3.3064e-05
-1.12175e-08
3.31615e-05
-2.41591e-07
3.32047e-05
-3.75463e-07
3.32325e-05
-6.04775e-07
3.31596e-05
-7.66826e-07
3.31714e-05
-9.8485e-07
3.31284e-05
-1.15965e-06
3.31289e-05
-1.32996e-06
3.31699e-05
-1.57516e-06
3.31901e-05
-1.71741e-06
3.32402e-05
-1.99434e-06
3.32611e-05
-2.18359e-06
3.32411e-05
-2.40403e-06
3.31831e-05
-2.63951e-06
3.3077e-05
-2.80682e-06
3.2939e-05
-3.03124e-06
3.28218e-05
-3.20148e-06
3.27041e-05
-3.34946e-06
3.26401e-05
-3.54872e-06
3.25983e-05
-3.62428e-06
3.25142e-05
-3.74584e-06
3.2447e-05
-3.8771e-06
3.22594e-05
-3.80582e-06
3.20642e-05
-4.00606e-06
3.181e-05
-3.9482e-06
3.1557e-05
-3.98279e-06
3.13621e-05
-4.13911e-06
3.1193e-05
-3.95403e-06
3.11127e-05
-4.03997e-06
3.10429e-05
-3.86874e-06
3.09977e-05
-3.64921e-06
3.09391e-05
-3.56219e-06
3.08578e-05
-3.28454e-06
3.0801e-05
-3.19014e-06
3.07403e-05
-3.10828e-06
3.07513e-05
-3.03345e-06
3.07896e-05
-3.04835e-06
3.08956e-05
-3.05125e-06
3.09889e-05
-3.05417e-06
3.11247e-05
-3.07474e-06
3.12139e-05
-3.11607e-06
3.12965e-05
-3.1857e-06
3.13777e-05
-3.29267e-06
3.14393e-05
-3.46869e-06
3.15544e-05
-3.70363e-06
3.16762e-05
-3.97029e-06
3.18095e-05
-4.31315e-06
3.19881e-05
-4.643e-06
3.21414e-05
-4.99535e-06
3.22742e-05
-5.36064e-06
3.24571e-05
-5.70695e-06
3.25846e-05
-6.03536e-06
3.27489e-05
-6.41754e-06
3.29253e-05
-6.77166e-06
3.31214e-05
-7.0592e-06
3.32053e-05
-7.35946e-06
3.33694e-05
-7.61719e-06
3.34281e-05
-7.71889e-06
3.34322e-05
-7.90297e-06
3.34472e-05
-7.97732e-06
3.3394e-05
-7.9803e-06
3.32499e-05
-7.9725e-06
3.30731e-05
-7.89863e-06
3.28542e-05
-7.74308e-06
3.2508e-05
-7.55525e-06
3.2149e-05
-7.34106e-06
3.17964e-05
-6.99247e-06
3.13177e-05
-6.63274e-06
3.0917e-05
-6.21761e-06
3.0516e-05
-5.64444e-06
3.00183e-05
-5.1008e-06
2.9626e-05
-4.41525e-06
2.91825e-05
-3.71459e-06
2.86647e-05
-3.00445e-06
2.82256e-05
-2.19624e-06
2.7704e-05
-1.52246e-06
2.71982e-05
-7.40058e-07
2.67258e-05
5.71295e-08
2.61102e-05
9.04082e-07
2.55083e-05
1.92872e-06
2.49376e-05
2.89956e-06
2.41777e-05
3.88784e-06
2.34034e-05
5.10854e-06
2.26404e-05
6.03146e-06
2.17623e-05
6.83359e-06
2.08286e-05
7.81021e-06
1.99948e-05
7.95851e-06
1.91095e-05
7.92751e-06
1.80811e-05
8.73329e-06
1.71987e-05
8.77632e-06
1.63423e-05
8.13375e-06
1.51942e-05
8.51412e-06
1.45374e-05
9.22118e-06
1.40316e-05
7.41729e-06
1.30276e-05
7.10364e-06
1.22344e-05
8.88807e-06
1.1484e-05
9.47765e-06
1.06398e-05
9.06414e-06
1.03001e-05
6.51522e-06
9.93914e-06
1.59374e-06
9.0094e-06
-3.0163e-06
8.68993e-06
-8.07657e-06
8.20822e-06
-1.39268e-05
7.58723e-06
-1.73573e-05
6.73618e-06
-1.85465e-05
4.46377e-06
-2.04822e-05
2.4295e-06
-2.1533e-05
1.90234e-06
-2.14525e-05
2.55003e-06
-2.09807e-05
4.88652e-06
-1.88644e-05
6.95039e-06
-1.5443e-05
5.79262e-06
-1.56059e-05
3.78506e-06
-1.05837e-05
3.68872e-06
-1.05451e-05
5.38764e-06
-1.06057e-05
4.92389e-06
-2.56596e-06
5.45341e-06
2.9377e-07
6.45779e-06
4.82617e-06
7.12873e-06
8.07973e-06
8.20463e-06
7.75228e-06
9.17477e-06
1.00859e-05
9.85594e-06
1.34428e-05
1.09173e-05
1.77608e-05
1.1506e-05
2.0857e-05
1.24642e-05
2.14953e-05
1.36682e-05
2.23086e-05
1.46044e-05
2.28296e-05
1.54694e-05
2.40682e-05
1.63973e-05
2.4453e-05
1.69109e-05
2.45347e-05
1.71519e-05
2.34466e-05
1.70663e-05
2.22215e-05
1.6909e-05
1.93594e-05
1.64938e-05
1.82248e-05
1.63896e-05
1.51451e-05
1.6006e-05
1.57311e-05
1.5735e-05
1.24235e-05
1.60939e-05
1.35526e-05
1.60216e-05
1.03948e-05
1.69813e-05
1.219e-05
1.68766e-05
9.04233e-06
1.85011e-05
1.00849e-05
1.83857e-05
8.21676e-06
1.9692e-05
8.27152e-06
1.9791e-05
6.91007e-06
2.10172e-05
5.80914e-06
2.14954e-05
5.10293e-06
2.26145e-05
3.45679e-06
2.37376e-05
2.43872e-06
2.39047e-05
2.58689e-06
2.47811e-05
3.42593e-07
2.49888e-05
7.30262e-07
2.55625e-05
-1.83523e-06
2.64792e-05
-2.70907e-06
2.72797e-05
-4.12998e-06
-3.24552e-06
2.7591e-05
3.18128e-05
-1.23107e-07
3.17679e-05
-8.42348e-08
3.16531e-05
-1.67699e-07
3.15361e-05
-7.29458e-08
3.14212e-05
-1.84721e-07
3.13295e-05
-1.0795e-07
3.12593e-05
-1.36616e-07
3.12072e-05
-1.31055e-07
3.12091e-05
-9.74037e-08
3.11802e-05
-1.49684e-07
3.12369e-05
-1.08617e-07
3.12385e-05
-1.31894e-07
3.12736e-05
-7.89708e-08
3.13028e-05
-1.13935e-07
3.13197e-05
-8.57907e-08
3.13495e-05
-4.97021e-08
3.14271e-05
-1.17074e-07
3.1459e-05
3.2898e-08
3.15165e-05
-5.48479e-08
3.15759e-05
3.42874e-08
3.15209e-05
6.26171e-08
3.15644e-05
-4.4674e-08
3.14721e-05
5.2723e-08
3.14538e-05
-8.43775e-08
3.14397e-05
-5.68003e-08
3.13727e-05
-8.48567e-08
3.14156e-05
-8.19532e-08
3.13469e-05
-2.47638e-08
3.13779e-05
-4.15297e-09
3.1335e-05
8.59303e-08
3.13182e-05
9.2447e-08
3.13389e-05
2.0343e-07
3.13098e-05
2.47729e-07
3.13983e-05
2.95261e-07
3.14392e-05
4.29889e-07
3.15601e-05
4.12353e-07
3.16677e-05
5.28528e-07
3.17947e-05
5.09475e-07
3.19073e-05
5.02623e-07
3.2032e-05
4.89128e-07
3.21445e-05
3.54566e-07
3.22527e-05
3.1324e-07
3.23772e-05
1.44354e-07
3.24585e-05
2.48885e-08
3.2558e-05
-1.10676e-07
3.26238e-05
-3.07394e-07
3.26842e-05
-4.35848e-07
3.27385e-05
-6.59062e-07
3.28146e-05
-8.42904e-07
3.28604e-05
-1.03066e-06
3.29567e-05
-1.25598e-06
3.30165e-05
-1.38973e-06
3.30491e-05
-1.60784e-06
3.309e-05
-1.75823e-06
3.3015e-05
-1.91933e-06
3.29817e-05
-2.15033e-06
3.28568e-05
-2.27917e-06
3.27852e-05
-2.56788e-06
3.27196e-05
-2.74115e-06
3.26659e-05
-2.97761e-06
3.27183e-05
-3.2539e-06
3.2681e-05
-3.31212e-06
3.27259e-05
-3.59364e-06
3.26625e-05
-3.56082e-06
3.25262e-05
-3.60953e-06
3.2375e-05
-3.72589e-06
3.21361e-05
-3.56692e-06
3.19423e-05
-3.81228e-06
3.17625e-05
-3.76839e-06
3.16511e-05
-3.87138e-06
3.1528e-05
-4.01605e-06
3.14615e-05
-3.88757e-06
3.13677e-05
-3.94612e-06
3.12198e-05
-3.72085e-06
3.11257e-05
-3.55508e-06
3.09702e-05
-3.40669e-06
3.08754e-05
-3.18974e-06
3.08378e-05
-3.1526e-06
3.08e-05
-3.07042e-06
3.08455e-05
-3.07894e-06
3.08919e-05
-3.09479e-06
3.09261e-05
-3.08544e-06
3.09862e-05
-3.11423e-06
3.1008e-05
-3.09654e-06
3.10478e-05
-3.15592e-06
3.10886e-05
-3.22645e-06
3.11595e-05
-3.36362e-06
3.12723e-05
-3.58151e-06
3.1382e-05
-3.81332e-06
3.15153e-05
-4.1036e-06
3.15923e-05
-4.39013e-06
3.16811e-05
-4.73175e-06
3.17037e-05
-5.01797e-06
3.17284e-05
-5.38534e-06
3.17671e-05
-5.74572e-06
3.18125e-05
-6.08074e-06
3.18454e-05
-6.45042e-06
3.18878e-05
-6.81406e-06
3.18834e-05
-7.05475e-06
3.18292e-05
-7.30526e-06
3.17196e-05
-7.50761e-06
3.15677e-05
-7.56703e-06
3.13341e-05
-7.66935e-06
3.10433e-05
-7.6865e-06
3.06899e-05
-7.62691e-06
3.02482e-05
-7.53079e-06
2.97249e-05
-7.3754e-06
2.91435e-05
-7.16166e-06
2.85028e-05
-6.91451e-06
2.78598e-05
-6.6981e-06
2.72158e-05
-6.34849e-06
2.6567e-05
-5.98392e-06
2.59977e-05
-5.64831e-06
2.54472e-05
-5.09387e-06
2.49181e-05
-4.57178e-06
2.45049e-05
-4.00203e-06
2.40321e-05
-3.24182e-06
2.36391e-05
-2.61144e-06
2.33797e-05
-1.93682e-06
2.29895e-05
-1.13229e-06
2.2691e-05
-4.41474e-07
2.24788e-05
2.69252e-07
2.21441e-05
1.23885e-06
2.18656e-05
2.20723e-06
2.16595e-05
3.10561e-06
2.12925e-05
4.2549e-06
2.08718e-05
5.52923e-06
2.03778e-05
6.52545e-06
1.96772e-05
7.53419e-06
1.90086e-05
8.4788e-06
1.82679e-05
8.69921e-06
1.71689e-05
9.02648e-06
1.63685e-05
9.53371e-06
1.58701e-05
9.27467e-06
1.53201e-05
8.68379e-06
1.45885e-05
9.24576e-06
1.43397e-05
9.46999e-06
1.41713e-05
7.5856e-06
1.32322e-05
8.04283e-06
1.23877e-05
9.73251e-06
1.16657e-05
1.01997e-05
1.1144e-05
9.58585e-06
1.07335e-05
6.92575e-06
1.0436e-05
1.8912e-06
9.5337e-06
-2.11399e-06
9.02043e-06
-7.56329e-06
8.16858e-06
-1.30749e-05
7.54806e-06
-1.67368e-05
6.60562e-06
-1.76041e-05
4.04435e-06
-1.79209e-05
1.57548e-06
-1.90641e-05
1.14303e-06
-2.102e-05
2.33147e-06
-2.21691e-05
3.98159e-06
-2.05145e-05
5.18321e-06
-1.66446e-05
3.24306e-06
-1.36657e-05
2.06544e-06
-9.40605e-06
2.95636e-06
-1.1436e-05
3.79224e-06
-1.14416e-05
3.26884e-06
-2.04256e-06
4.93125e-06
-1.36864e-06
4.23643e-06
5.52099e-06
6.58256e-06
5.7336e-06
6.96981e-06
7.36503e-06
7.59845e-06
9.45725e-06
7.94374e-06
1.30975e-05
8.96493e-06
1.67396e-05
9.88579e-06
1.99361e-05
1.08739e-05
2.05072e-05
1.22372e-05
2.09454e-05
1.34747e-05
2.1592e-05
1.46044e-05
2.29386e-05
1.58144e-05
2.32429e-05
1.67639e-05
2.35853e-05
1.75365e-05
2.26739e-05
1.78858e-05
2.18722e-05
1.81202e-05
1.9125e-05
1.78828e-05
1.84623e-05
1.77849e-05
1.52429e-05
1.80133e-05
1.55027e-05
1.77263e-05
1.27105e-05
1.84109e-05
1.28681e-05
1.83469e-05
1.04588e-05
1.94725e-05
1.10644e-05
1.94624e-05
9.05249e-06
2.06712e-05
8.8761e-06
2.10929e-05
7.79505e-06
2.21643e-05
7.20007e-06
2.24963e-05
6.57809e-06
2.35338e-05
4.77163e-06
2.43772e-05
4.25954e-06
2.48088e-05
3.02523e-06
2.61532e-05
1.09431e-06
2.64185e-05
2.32161e-06
2.72854e-05
-5.24329e-07
2.78229e-05
1.92711e-07
2.79048e-05
-1.91713e-06
2.86141e-05
-3.41833e-06
2.92955e-05
-4.81142e-06
-3.74922e-06
2.97992e-05
3.17488e-05
-1.5625e-07
3.17731e-05
-1.08558e-07
3.17361e-05
-1.30678e-07
3.1665e-05
-1.87083e-09
3.15339e-05
-5.36096e-08
3.14325e-05
-6.50411e-09
3.12824e-05
1.342e-08
3.11782e-05
-2.68671e-08
3.11408e-05
-5.99749e-08
3.10729e-05
-8.17431e-08
3.1137e-05
-1.72753e-07
3.11387e-05
-1.33558e-07
3.12103e-05
-1.50621e-07
3.12645e-05
-1.68131e-07
3.12853e-05
-1.0653e-07
3.13438e-05
-1.082e-07
3.13509e-05
-1.24232e-07
3.1405e-05
-2.12177e-08
3.14141e-05
-6.38883e-08
3.14586e-05
-1.02055e-08
3.14534e-05
6.77396e-08
3.14505e-05
-4.17272e-08
3.14208e-05
8.24075e-08
3.1391e-05
-5.46054e-08
3.13566e-05
-2.23357e-08
3.13205e-05
-4.87503e-08
3.12999e-05
-6.13461e-08
3.12517e-05
2.34208e-08
3.12543e-05
-6.80334e-09
3.12264e-05
1.13848e-07
3.1256e-05
6.28957e-08
3.13055e-05
1.53874e-07
3.13925e-05
1.60701e-07
3.15019e-05
1.85952e-07
3.16217e-05
3.10067e-07
3.17446e-05
2.89408e-07
3.18276e-05
4.45579e-07
3.18998e-05
4.37253e-07
3.19485e-05
4.53885e-07
3.19687e-05
4.68991e-07
3.19939e-05
3.29361e-07
3.2016e-05
2.91145e-07
3.20424e-05
1.1788e-07
3.21233e-05
-5.60116e-08
3.21786e-05
-1.65943e-07
3.23253e-05
-4.54107e-07
3.24358e-05
-5.46299e-07
3.25791e-05
-8.02393e-07
3.27167e-05
-9.80447e-07
3.27658e-05
-1.07977e-06
3.286e-05
-1.35023e-06
3.2821e-05
-1.35072e-06
3.28088e-05
-1.59564e-06
3.27605e-05
-1.70993e-06
3.26887e-05
-1.84751e-06
3.27039e-05
-2.16552e-06
3.26631e-05
-2.23845e-06
3.27234e-05
-2.62814e-06
3.27431e-05
-2.76083e-06
3.27494e-05
-2.98396e-06
3.27438e-05
-3.24824e-06
3.26362e-05
-3.20456e-06
3.25239e-05
-3.48134e-06
3.2367e-05
-3.40396e-06
3.22404e-05
-3.48287e-06
3.213e-05
-3.6155e-06
3.21054e-05
-3.54236e-06
3.20655e-05
-3.77236e-06
3.2058e-05
-3.76089e-06
3.20067e-05
-3.82008e-06
3.18357e-05
-3.84501e-06
3.16641e-05
-3.71597e-06
3.13766e-05
-3.65864e-06
3.11589e-05
-3.50313e-06
3.10035e-05
-3.39977e-06
3.09044e-05
-3.30753e-06
3.0949e-05
-3.23431e-06
3.09733e-05
-3.17697e-06
3.10311e-05
-3.12815e-06
3.1023e-05
-3.07085e-06
3.09396e-05
-3.0114e-06
3.08494e-05
-2.9953e-06
3.0724e-05
-2.98878e-06
3.06696e-05
-3.04219e-06
3.06782e-05
-3.1645e-06
3.07538e-05
-3.302e-06
3.08927e-05
-3.50256e-06
3.10088e-05
-3.69756e-06
3.11127e-05
-3.91722e-06
3.11292e-05
-4.12018e-06
3.11075e-05
-4.36836e-06
3.10367e-05
-4.66102e-06
3.09483e-05
-4.9295e-06
3.08439e-05
-5.28097e-06
3.07353e-05
-5.6371e-06
3.05775e-05
-5.92292e-06
3.03797e-05
-6.25263e-06
3.00887e-05
-6.52306e-06
2.97451e-05
-6.71118e-06
2.93023e-05
-6.86247e-06
2.87661e-05
-6.9714e-06
2.81953e-05
-6.99625e-06
2.75285e-05
-7.00249e-06
2.68112e-05
-6.96926e-06
2.60639e-05
-6.87954e-06
2.52365e-05
-6.70338e-06
2.43706e-05
-6.50951e-06
2.35054e-05
-6.29652e-06
2.26478e-05
-6.05687e-06
2.18141e-05
-5.86438e-06
2.10276e-05
-5.56203e-06
2.0326e-05
-5.28227e-06
1.96814e-05
-5.00377e-06
1.91728e-05
-4.58524e-06
1.87376e-05
-4.13664e-06
1.83112e-05
-3.57555e-06
1.79521e-05
-2.88277e-06
1.76898e-05
-2.34913e-06
1.74744e-05
-1.72143e-06
1.73203e-05
-9.78158e-07
1.72692e-05
-3.90391e-07
1.72378e-05
3.00674e-07
1.73105e-05
1.16611e-06
1.75228e-05
1.99492e-06
1.75786e-05
3.04982e-06
1.74967e-05
4.3368e-06
1.7463e-05
5.56291e-06
1.73598e-05
6.62872e-06
1.7067e-05
7.82694e-06
1.68451e-05
8.70071e-06
1.64696e-05
9.0747e-06
1.58264e-05
9.66966e-06
1.52602e-05
1.01e-05
1.49072e-05
9.62766e-06
1.41479e-05
9.44307e-06
1.35386e-05
9.85502e-06
1.35224e-05
9.48626e-06
1.34255e-05
7.68245e-06
1.28766e-05
8.59178e-06
1.22863e-05
1.03228e-05
1.16851e-05
1.08008e-05
1.13937e-05
9.87731e-06
1.15224e-05
6.79699e-06
1.11486e-05
2.26502e-06
1.09379e-05
-1.90326e-06
1.0039e-05
-6.66442e-06
8.83583e-06
-1.18717e-05
7.78844e-06
-1.56894e-05
6.59534e-06
-1.6411e-05
5.31511e-06
-1.66407e-05
3.62544e-06
-1.73744e-05
2.80847e-06
-2.02031e-05
2.58101e-06
-2.19417e-05
2.41343e-06
-2.03469e-05
1.67917e-06
-1.59103e-05
-8.58284e-08
-1.19007e-05
1.41981e-06
-1.09117e-05
2.67027e-06
-1.26864e-05
1.26641e-06
-1.00377e-05
8.20866e-07
-1.59702e-06
3.17546e-06
-3.72323e-06
2.86989e-06
5.82656e-06
4.90095e-06
3.70254e-06
4.69102e-06
7.57496e-06
5.8638e-06
8.28447e-06
5.93075e-06
1.30306e-05
6.73938e-06
1.5931e-05
8.04753e-06
1.86279e-05
9.38164e-06
1.91731e-05
1.07698e-05
1.95573e-05
1.23072e-05
2.00546e-05
1.37594e-05
2.14863e-05
1.51241e-05
2.18783e-05
1.62621e-05
2.24473e-05
1.74623e-05
2.14737e-05
1.82047e-05
2.11298e-05
1.86968e-05
1.86328e-05
1.89867e-05
1.81724e-05
1.88238e-05
1.54058e-05
1.96353e-05
1.46912e-05
1.96729e-05
1.26729e-05
2.04228e-05
1.21183e-05
2.06133e-05
1.02683e-05
2.15233e-05
1.01544e-05
2.1813e-05
8.76277e-06
2.26444e-05
8.04469e-06
2.32656e-05
7.17382e-06
2.45016e-05
5.96414e-06
2.51976e-05
5.88209e-06
2.57949e-05
4.17432e-06
2.68863e-05
3.16816e-06
2.71139e-05
2.79756e-06
2.80962e-05
1.11998e-07
2.85348e-05
1.88311e-06
2.90006e-05
-9.90223e-07
2.99607e-05
-7.67346e-07
3.04119e-05
-2.36835e-06
3.11386e-05
-4.14501e-06
3.13681e-05
-5.04092e-06
-4.10697e-06
3.17259e-05
3.17671e-05
-2.25742e-07
3.17436e-05
-8.51388e-08
3.17062e-05
-9.32616e-08
3.16126e-05
9.17876e-08
3.14817e-05
7.72797e-08
3.13941e-05
8.11022e-08
3.12405e-05
1.67027e-07
3.1197e-05
1.65706e-08
3.11126e-05
2.4439e-08
3.11195e-05
-8.86406e-08
3.11369e-05
-1.90179e-07
3.11679e-05
-1.64525e-07
3.12575e-05
-2.40222e-07
3.12755e-05
-1.86164e-07
3.13374e-05
-1.68385e-07
3.13568e-05
-1.27613e-07
3.13715e-05
-1.38936e-07
3.14052e-05
-5.49398e-08
3.14201e-05
-7.87807e-08
3.14425e-05
-3.25968e-08
3.14781e-05
3.21615e-08
3.145e-05
-1.36669e-08
3.145e-05
8.23988e-08
3.13947e-05
7.58756e-10
3.13567e-05
1.56308e-08
3.13044e-05
3.5817e-09
3.12901e-05
-4.70693e-08
3.12912e-05
2.23505e-08
3.12984e-05
-1.39894e-08
3.1353e-05
5.91857e-08
3.1364e-05
5.18669e-08
3.14245e-05
9.34366e-08
3.14631e-05
1.22124e-07
3.15059e-05
1.43098e-07
3.15777e-05
2.38304e-07
3.16337e-05
2.3337e-07
3.17099e-05
3.69349e-07
3.17608e-05
3.86361e-07
3.18321e-05
3.82588e-07
3.18773e-05
4.23814e-07
3.1968e-05
2.38631e-07
3.20402e-05
2.19014e-07
3.21467e-05
1.13785e-08
3.22473e-05
-1.56588e-07
3.23219e-05
-2.40634e-07
3.2403e-05
-5.35147e-07
3.24035e-05
-5.46805e-07
3.24131e-05
-8.11983e-07
3.23827e-05
-9.50068e-07
3.23473e-05
-1.0444e-06
3.23555e-05
-1.35842e-06
3.23792e-05
-1.37438e-06
3.24543e-05
-1.67074e-06
3.25618e-05
-1.81746e-06
3.26849e-05
-1.97057e-06
3.27735e-05
-2.25418e-06
3.28523e-05
-2.31726e-06
3.28269e-05
-2.60274e-06
3.27754e-05
-2.70925e-06
3.26668e-05
-2.8754e-06
3.25127e-05
-3.09411e-06
3.24461e-05
-3.13797e-06
3.23245e-05
-3.35976e-06
3.23288e-05
-3.40823e-06
3.23337e-05
-3.48781e-06
3.23169e-05
-3.59869e-06
3.23387e-05
-3.56413e-06
3.2212e-05
-3.64567e-06
3.20679e-05
-3.61684e-06
3.18459e-05
-3.59807e-06
3.16013e-05
-3.60044e-06
3.14155e-05
-3.5301e-06
3.12547e-05
-3.49792e-06
3.11979e-05
-3.44624e-06
3.11464e-05
-3.34835e-06
3.11438e-05
-3.30491e-06
3.11096e-05
-3.20009e-06
3.10148e-05
-3.08213e-06
3.09198e-05
-3.03319e-06
3.07541e-05
-2.90515e-06
3.06284e-05
-2.88569e-06
3.05171e-05
-2.88406e-06
3.04275e-05
-2.89911e-06
3.04096e-05
-3.02433e-06
3.03756e-05
-3.13052e-06
3.03617e-05
-3.28802e-06
3.03166e-05
-3.45746e-06
3.02295e-05
-3.61055e-06
3.01017e-05
-3.78937e-06
2.99606e-05
-3.97904e-06
2.97814e-05
-4.18923e-06
2.95852e-05
-4.46483e-06
2.93566e-05
-4.70091e-06
2.90443e-05
-4.96862e-06
2.86396e-05
-5.23239e-06
2.81395e-05
-5.42287e-06
2.75073e-05
-5.6204e-06
2.67858e-05
-5.80155e-06
2.59645e-05
-5.88991e-06
2.50471e-05
-5.94509e-06
2.40665e-05
-5.99074e-06
2.30375e-05
-5.9673e-06
2.20106e-05
-5.97559e-06
2.09917e-05
-5.95033e-06
1.9963e-05
-5.85081e-06
1.89717e-05
-5.71212e-06
1.79921e-05
-5.52989e-06
1.70551e-05
-5.35953e-06
1.62177e-05
-5.21946e-06
1.54138e-05
-5.0605e-06
1.46772e-05
-4.82543e-06
1.40172e-05
-4.62227e-06
1.34324e-05
-4.41899e-06
1.29833e-05
-4.13614e-06
1.25838e-05
-3.73715e-06
1.22472e-05
-3.23889e-06
1.20246e-05
-2.6602e-06
1.18201e-05
-2.14461e-06
1.16987e-05
-1.60003e-06
1.17346e-05
-1.01412e-06
1.18337e-05
-4.89396e-07
1.20092e-05
1.25125e-07
1.24005e-05
7.74779e-07
1.2807e-05
1.58849e-06
1.31221e-05
2.73467e-06
1.34669e-05
3.99197e-06
1.38164e-05
5.21346e-06
1.39323e-05
6.51278e-06
1.38755e-05
7.88379e-06
1.38767e-05
8.69947e-06
1.36275e-05
9.32389e-06
1.31816e-05
1.01156e-05
1.29768e-05
1.03048e-05
1.28074e-05
9.79706e-06
1.23342e-05
9.91619e-06
1.19361e-05
1.02532e-05
1.22922e-05
9.13014e-06
1.24057e-05
7.56894e-06
1.2094e-05
8.90347e-06
1.17099e-05
1.07069e-05
1.14778e-05
1.10329e-05
1.14897e-05
9.8654e-06
1.19855e-05
6.30114e-06
1.20524e-05
2.19817e-06
1.20566e-05
-1.90742e-06
1.12499e-05
-5.85781e-06
9.84549e-06
-1.04673e-05
7.96811e-06
-1.38121e-05
6.95693e-06
-1.53998e-05
6.86218e-06
-1.65459e-05
5.94056e-06
-1.64528e-05
3.71308e-06
-1.79756e-05
1.59116e-06
-1.98197e-05
-1.0924e-06
-1.76634e-05
-2.54781e-06
-1.44549e-05
-2.12284e-06
-1.23257e-05
5.60974e-08
-1.30906e-05
7.53767e-07
-1.33841e-05
-9.32205e-07
-8.35174e-06
-2.64456e-06
1.15333e-07
-4.95939e-07
-5.87185e-06
1.88052e-06
3.4501e-06
3.19611e-06
2.38695e-06
2.69601e-06
8.07506e-06
3.94843e-06
7.03205e-06
4.02184e-06
1.29572e-05
4.87934e-06
1.50735e-05
6.07585e-06
1.74314e-05
7.81103e-06
1.74379e-05
9.22999e-06
1.81383e-05
1.09428e-05
1.83417e-05
1.29363e-05
1.94928e-05
1.47166e-05
2.0098e-05
1.60745e-05
2.10894e-05
1.74028e-05
2.01454e-05
1.85342e-05
1.99984e-05
1.9262e-05
1.79051e-05
2.03002e-05
1.71342e-05
2.03962e-05
1.53098e-05
2.12055e-05
1.38818e-05
2.15411e-05
1.23374e-05
2.20699e-05
1.15894e-05
2.26967e-05
9.64154e-06
2.36299e-05
9.22117e-06
2.41314e-05
8.26122e-06
2.49417e-05
7.23444e-06
2.55629e-05
6.55257e-06
2.65445e-05
4.9826e-06
2.75355e-05
4.89103e-06
2.78388e-05
3.87107e-06
2.86979e-05
2.309e-06
2.91574e-05
2.33813e-06
2.9873e-05
-6.03647e-07
3.08058e-05
9.50327e-07
3.13094e-05
-1.49384e-06
3.21662e-05
-1.6241e-06
3.24977e-05
-2.69991e-06
3.28066e-05
-4.45392e-06
3.29301e-05
-5.16436e-06
-4.51073e-06
3.33338e-05
3.16631e-05
-2.43358e-07
3.16116e-05
-3.36952e-08
3.15761e-05
-5.77063e-08
3.14922e-05
1.75625e-07
3.14636e-05
1.05947e-07
3.14149e-05
1.29817e-07
3.14014e-05
1.80531e-07
3.14076e-05
1.03799e-08
3.13651e-05
6.68445e-08
3.14009e-05
-1.24355e-07
3.13538e-05
-1.43101e-07
3.13868e-05
-1.97582e-07
3.1388e-05
-2.41349e-07
3.13825e-05
-1.80733e-07
3.13953e-05
-1.81165e-07
3.1372e-05
-1.04274e-07
3.13715e-05
-1.38461e-07
3.13697e-05
-5.31533e-08
3.13834e-05
-9.24246e-08
3.14035e-05
-5.27821e-08
3.14372e-05
-1.45139e-09
3.14625e-05
-3.90142e-08
3.14673e-05
7.76321e-08
3.14801e-05
-1.20355e-08
3.14793e-05
1.64443e-08
3.14655e-05
1.73046e-08
3.14963e-05
-7.78151e-08
3.14923e-05
2.62957e-08
3.15146e-05
-3.62551e-08
3.15189e-05
5.49151e-08
3.1474e-05
9.6701e-08
3.14722e-05
9.52817e-08
3.14088e-05
1.85464e-07
3.14131e-05
1.38807e-07
3.1447e-05
2.04428e-07
3.15095e-05
1.70878e-07
3.16526e-05
2.26237e-07
3.1789e-05
2.49978e-07
3.19375e-05
2.34061e-07
3.20704e-05
2.90985e-07
3.21483e-05
1.60719e-07
3.22068e-05
1.60526e-07
3.22291e-05
-1.09568e-08
3.22283e-05
-1.55842e-07
3.22346e-05
-2.46885e-07
3.22124e-05
-5.12947e-07
3.22313e-05
-5.6574e-07
3.22258e-05
-8.06496e-07
3.22566e-05
-9.80794e-07
3.23141e-05
-1.10197e-06
3.236e-05
-1.4043e-06
3.24725e-05
-1.4869e-06
3.25396e-05
-1.73778e-06
3.26192e-05
-1.8971e-06
3.26628e-05
-2.01417e-06
3.26452e-05
-2.23651e-06
3.26427e-05
-2.31476e-06
3.25681e-05
-2.52813e-06
3.25509e-05
-2.69215e-06
3.25153e-05
-2.83972e-06
3.24943e-05
-3.07317e-06
3.25317e-05
-3.17533e-06
3.24833e-05
-3.31134e-06
3.24855e-05
-3.41041e-06
3.23955e-05
-3.39781e-06
3.22685e-05
-3.47175e-06
3.21429e-05
-3.43852e-06
3.19631e-05
-3.46585e-06
3.18307e-05
-3.48448e-06
3.16896e-05
-3.45694e-06
3.1586e-05
-3.49684e-06
3.14671e-05
-3.41124e-06
3.13445e-05
-3.37528e-06
3.11785e-05
-3.28024e-06
3.0974e-05
-3.14388e-06
3.07508e-05
-3.08165e-06
3.05115e-05
-2.96078e-06
3.03131e-05
-2.88374e-06
3.01273e-05
-2.84744e-06
3.00001e-05
-2.77792e-06
2.98733e-05
-2.75892e-06
2.97387e-05
-2.74939e-06
2.95942e-05
-2.75467e-06
2.93664e-05
-2.79648e-06
2.91345e-05
-2.89862e-06
2.88509e-05
-3.00447e-06
2.85749e-05
-3.1814e-06
2.83106e-05
-3.34626e-06
2.80245e-05
-3.50331e-06
2.77217e-05
-3.67626e-06
2.73453e-05
-3.81278e-06
2.68499e-05
-3.96946e-06
2.62501e-05
-4.10112e-06
2.55184e-05
-4.23687e-06
2.4677e-05
-4.39101e-06
2.37609e-05
-4.50683e-06
2.27496e-05
-4.60909e-06
2.16393e-05
-4.69124e-06
2.04686e-05
-4.71918e-06
1.92339e-05
-4.71034e-06
1.79747e-05
-4.7316e-06
1.6776e-05
-4.7686e-06
1.56864e-05
-4.88594e-06
1.47066e-05
-4.97055e-06
1.38125e-05
-4.95668e-06
1.30036e-05
-4.90327e-06
1.22241e-05
-4.75037e-06
1.14716e-05
-4.60699e-06
1.07374e-05
-4.48534e-06
9.97875e-06
-4.30181e-06
9.26668e-06
-4.11336e-06
8.64432e-06
-3.9999e-06
8.12145e-06
-3.89612e-06
7.69654e-06
-3.71123e-06
7.31026e-06
-3.35087e-06
7.00486e-06
-2.93349e-06
6.79664e-06
-2.45199e-06
6.60738e-06
-1.95535e-06
6.53325e-06
-1.5259e-06
6.61155e-06
-1.09242e-06
6.8226e-06
-7.00444e-07
7.20137e-06
-2.53644e-07
7.78232e-06
1.93824e-07
8.39959e-06
9.71218e-07
8.99339e-06
2.14087e-06
9.54578e-06
3.43959e-06
9.9185e-06
4.84074e-06
1.01244e-05
6.30685e-06
1.05348e-05
7.47344e-06
1.10134e-05
8.22086e-06
1.11923e-05
9.14498e-06
1.12808e-05
1.0027e-05
1.14934e-05
1.00922e-05
1.12459e-05
1.00446e-05
1.07423e-05
1.04198e-05
1.07165e-05
1.0279e-05
1.1047e-05
8.79964e-06
1.11047e-05
7.51129e-06
1.09106e-05
9.09752e-06
1.08658e-05
1.07517e-05
1.10689e-05
1.08298e-05
1.17635e-05
9.17078e-06
1.23509e-05
5.71381e-06
1.3039e-05
1.51003e-06
1.27972e-05
-1.6656e-06
1.20747e-05
-5.13528e-06
1.03255e-05
-8.71813e-06
8.02159e-06
-1.15081e-05
6.66717e-06
-1.40454e-05
6.33086e-06
-1.62096e-05
5.30659e-06
-1.54285e-05
2.52496e-06
-1.5194e-05
-4.77264e-07
-1.68175e-05
-2.8632e-06
-1.52774e-05
-2.54691e-06
-1.47712e-05
-1.89854e-07
-1.46827e-05
1.041e-06
-1.43215e-05
-1.98856e-07
-1.21443e-05
-6.80152e-07
-7.87044e-06
-1.03461e-06
4.69787e-07
-1.11301e-06
-5.79344e-06
-9.23784e-07
3.26087e-06
-3.12395e-07
1.77556e-06
4.52006e-07
7.31066e-06
8.3968e-07
6.64438e-06
1.46268e-06
1.23342e-05
2.96928e-06
1.35669e-05
4.31377e-06
1.6087e-05
5.99349e-06
1.57582e-05
7.81319e-06
1.63186e-05
9.45007e-06
1.67048e-05
1.15966e-05
1.73463e-05
1.36036e-05
1.8091e-05
1.54961e-05
1.91969e-05
1.71042e-05
1.85373e-05
1.89409e-05
1.81617e-05
1.97529e-05
1.70931e-05
2.10975e-05
1.57896e-05
2.16742e-05
1.47331e-05
2.24575e-05
1.30985e-05
2.32089e-05
1.15859e-05
2.37449e-05
1.10534e-05
2.45083e-05
8.87811e-06
2.5508e-05
8.22147e-06
2.60244e-05
7.7448e-06
2.68321e-05
6.42671e-06
2.76556e-05
5.72917e-06
2.83585e-05
4.27962e-06
2.93594e-05
3.89015e-06
2.98441e-05
3.38637e-06
3.07319e-05
1.42125e-06
3.15515e-05
1.51851e-06
3.20698e-05
-1.12199e-06
3.30873e-05
-6.70868e-08
3.34335e-05
-1.84011e-06
3.41501e-05
-2.34069e-06
3.44602e-05
-3.00996e-06
3.43491e-05
-4.34282e-06
3.42569e-05
-5.07221e-06
-4.60356e-06
3.43497e-05
3.17266e-05
-2.24301e-07
3.16918e-05
1.10969e-09
3.16167e-05
1.74109e-08
3.15609e-05
2.31431e-07
3.15182e-05
1.48614e-07
3.14872e-05
1.60782e-07
3.15096e-05
1.58167e-07
3.15163e-05
3.6553e-09
3.15402e-05
4.30045e-08
3.15515e-05
-1.35646e-07
3.15452e-05
-1.36823e-07
3.15428e-05
-1.95159e-07
3.15384e-05
-2.37016e-07
3.1538e-05
-1.80343e-07
3.15345e-05
-1.77659e-07
3.15516e-05
-1.21336e-07
3.15294e-05
-1.16246e-07
3.15281e-05
-5.18975e-08
3.15135e-05
-7.78413e-08
3.14999e-05
-3.91319e-08
3.15224e-05
-2.39861e-08
3.15429e-05
-5.94495e-08
3.15701e-05
5.04229e-08
3.162e-05
-6.19598e-08
3.16171e-05
1.93707e-08
3.16201e-05
1.43023e-08
3.15982e-05
-5.59391e-08
3.15612e-05
6.32763e-08
3.15576e-05
-3.26389e-08
3.15359e-05
7.66241e-08
3.15513e-05
8.12792e-08
3.15879e-05
5.86794e-08
3.16241e-05
1.49279e-07
3.16806e-05
8.23384e-08
3.17341e-05
1.50873e-07
3.17837e-05
1.21269e-07
3.18454e-05
1.64599e-07
3.19025e-05
1.92817e-07
3.19694e-05
1.67182e-07
3.2039e-05
2.21353e-07
3.20927e-05
1.07009e-07
3.21629e-05
9.04139e-08
3.22044e-05
-5.24499e-08
3.22576e-05
-2.09042e-07
3.22965e-05
-2.8587e-07
3.23149e-05
-5.31343e-07
3.23644e-05
-6.15203e-07
3.23726e-05
-8.147e-07
3.24093e-05
-1.01749e-06
3.24298e-05
-1.12246e-06
3.243e-05
-1.40453e-06
3.24543e-05
-1.51116e-06
3.24361e-05
-1.7196e-06
3.24469e-05
-1.9079e-06
3.24423e-05
-2.00955e-06
3.24501e-05
-2.24439e-06
3.24931e-05
-2.35774e-06
3.25122e-05
-2.54715e-06
3.25597e-05
-2.73973e-06
3.25575e-05
-2.83745e-06
3.2501e-05
-3.01675e-06
3.24106e-05
-3.08487e-06
3.2243e-05
-3.14378e-06
3.20594e-05
-3.22678e-06
3.18757e-05
-3.21412e-06
3.16881e-05
-3.28412e-06
3.15443e-05
-3.29473e-06
3.14101e-05
-3.33168e-06
3.12712e-05
-3.34554e-06
3.11284e-05
-3.31421e-06
3.09107e-05
-3.2791e-06
3.06451e-05
-3.14559e-06
3.03191e-05
-3.04936e-06
2.99547e-05
-2.91581e-06
2.96192e-05
-2.80838e-06
2.92849e-05
-2.74733e-06
2.9015e-05
-2.69094e-06
2.87685e-05
-2.63718e-06
2.85061e-05
-2.58511e-06
2.82522e-05
-2.52395e-06
2.79273e-05
-2.434e-06
2.75791e-05
-2.40122e-06
2.72073e-05
-2.38291e-06
2.68174e-05
-2.40655e-06
2.64204e-05
-2.5016e-06
2.60239e-05
-2.60795e-06
2.55798e-05
-2.73734e-06
2.50785e-05
-2.84493e-06
2.44957e-05
-2.92053e-06
2.38071e-05
-2.98769e-06
2.30315e-05
-3.03722e-06
2.21664e-05
-3.10435e-06
2.1227e-05
-3.16166e-06
2.02096e-05
-3.21945e-06
1.91047e-05
-3.28615e-06
1.79238e-05
-3.32593e-06
1.66721e-05
-3.35738e-06
1.53866e-05
-3.40571e-06
1.41146e-05
-3.44718e-06
1.29143e-05
-3.51009e-06
1.1817e-05
-3.63433e-06
1.09032e-05
-3.85473e-06
1.01405e-05
-4.12334e-06
9.47509e-06
-4.30509e-06
8.90743e-06
-4.38903e-06
8.33121e-06
-4.32706e-06
7.72037e-06
-4.13953e-06
7.08097e-06
-3.96759e-06
6.35866e-06
-3.76302e-06
5.57708e-06
-3.52023e-06
4.82194e-06
-3.35823e-06
4.13739e-06
-3.31535e-06
3.59383e-06
-3.35256e-06
3.21955e-06
-3.33696e-06
2.93856e-06
-3.06987e-06
2.67201e-06
-2.66693e-06
2.37797e-06
-2.15795e-06
2.13716e-06
-1.71453e-06
2.0361e-06
-1.42484e-06
2.08801e-06
-1.14433e-06
2.30777e-06
-9.20211e-07
2.75657e-06
-7.02443e-07
3.37933e-06
-4.2894e-07
4.13074e-06
2.19811e-07
4.92607e-06
1.34554e-06
5.58308e-06
2.78258e-06
6.12454e-06
4.29927e-06
6.71454e-06
5.71685e-06
7.38311e-06
6.80486e-06
7.78771e-06
7.81626e-06
8.01282e-06
8.91988e-06
8.50796e-06
9.53188e-06
9.0415e-06
9.55871e-06
9.27853e-06
9.80755e-06
9.44988e-06
1.02484e-05
9.94825e-06
9.78063e-06
1.04438e-05
8.30413e-06
1.03674e-05
7.58766e-06
1.02358e-05
9.22914e-06
1.04792e-05
1.05084e-05
1.09589e-05
1.035e-05
1.18334e-05
8.2963e-06
1.28373e-05
4.7099e-06
1.35822e-05
7.65164e-07
1.34238e-05
-1.50723e-06
1.24948e-05
-4.20632e-06
1.04117e-05
-6.63496e-06
7.84592e-06
-8.94239e-06
5.69782e-06
-1.18973e-05
3.91542e-06
-1.44272e-05
2.87867e-06
-1.43918e-05
1.21682e-06
-1.35321e-05
-1.56668e-08
-1.5585e-05
-6.5925e-07
-1.46339e-05
-5.6609e-07
-1.48644e-05
6.53622e-07
-1.59024e-05
-4.42606e-07
-1.32253e-05
-2.16289e-06
-1.0424e-05
-2.11285e-06
-7.92049e-06
-1.75303e-06
1.09974e-07
-3.36236e-06
-4.18411e-06
-3.17025e-06
3.06875e-06
-2.03476e-06
6.40076e-07
-1.61889e-06
6.89479e-06
-1.49034e-06
6.51583e-06
-5.45204e-07
1.1389e-05
1.16501e-06
1.18567e-05
2.67642e-06
1.45755e-05
4.22492e-06
1.42097e-05
6.42081e-06
1.41227e-05
8.23999e-06
1.48857e-05
1.05583e-05
1.50279e-05
1.2448e-05
1.62013e-05
1.482e-05
1.68249e-05
1.64155e-05
1.69417e-05
1.86759e-05
1.59014e-05
1.98453e-05
1.59237e-05
2.14289e-05
1.4206e-05
2.26651e-05
1.34968e-05
2.35897e-05
1.2174e-05
2.45289e-05
1.06467e-05
2.54578e-05
1.01245e-05
2.61761e-05
8.15984e-06
2.70738e-05
7.3237e-06
2.78617e-05
6.95689e-06
2.8753e-05
5.53547e-06
2.96332e-05
4.84895e-06
3.01874e-05
3.72542e-06
3.11749e-05
2.90267e-06
3.20545e-05
2.5068e-06
3.29191e-05
5.56588e-07
3.36938e-05
7.43793e-07
3.39505e-05
-1.37871e-06
3.48342e-05
-9.5078e-07
3.50968e-05
-2.10264e-06
3.54414e-05
-2.68531e-06
3.55543e-05
-3.12285e-06
3.52512e-05
-4.03978e-06
3.50256e-05
-4.84659e-06
-4.47797e-06
3.49e-05
3.20004e-05
-2.01932e-07
3.1918e-05
8.35282e-08
3.17624e-05
1.73034e-07
3.1662e-05
3.31813e-07
3.15544e-05
2.56255e-07
3.15161e-05
1.99088e-07
3.15077e-05
1.66528e-07
3.15246e-05
-1.32302e-08
3.15652e-05
2.42454e-09
3.15965e-05
-1.66941e-07
3.16336e-05
-1.73959e-07
3.16417e-05
-2.03266e-07
3.16627e-05
-2.58025e-07
3.16562e-05
-1.73837e-07
3.16657e-05
-1.87109e-07
3.1668e-05
-1.23713e-07
3.16586e-05
-1.06832e-07
3.16667e-05
-5.99731e-08
3.16455e-05
-5.6647e-08
3.16381e-05
-3.17117e-08
3.16387e-05
-2.46377e-08
3.16176e-05
-3.8353e-08
3.16461e-05
2.19905e-08
3.16457e-05
-6.1555e-08
3.16634e-05
1.63487e-09
3.16725e-05
5.20195e-09
3.16605e-05
-4.39066e-08
3.16661e-05
5.76005e-08
3.16534e-05
-1.99061e-08
3.16667e-05
6.33143e-08
3.16751e-05
7.28895e-08
3.17102e-05
2.3592e-08
3.1753e-05
1.06479e-07
3.17853e-05
4.99949e-08
3.18362e-05
1.0001e-07
3.18514e-05
1.06117e-07
3.18868e-05
1.29182e-07
3.19191e-05
1.60472e-07
3.19486e-05
1.37682e-07
3.20172e-05
1.52815e-07
3.20548e-05
6.94142e-08
3.21297e-05
1.55e-08
3.21884e-05
-1.11155e-07
3.22273e-05
-2.47939e-07
3.22797e-05
-3.38292e-07
3.22854e-05
-5.3706e-07
3.23165e-05
-6.46302e-07
3.23156e-05
-8.13813e-07
3.23091e-05
-1.01097e-06
3.23138e-05
-1.12717e-06
3.22723e-05
-1.36299e-06
3.22655e-05
-1.50444e-06
3.22307e-05
-1.68471e-06
3.22037e-05
-1.88096e-06
3.21945e-05
-2.00034e-06
3.21574e-05
-2.20733e-06
3.21292e-05
-2.32948e-06
3.20618e-05
-2.47981e-06
3.19363e-05
-2.61416e-06
3.17907e-05
-2.69185e-06
3.15741e-05
-2.80019e-06
3.13546e-05
-2.86533e-06
3.11305e-05
-2.91974e-06
3.08926e-05
-2.98882e-06
3.06899e-05
-3.01144e-06
3.04377e-05
-3.03189e-06
3.0177e-05
-3.03403e-06
2.98397e-05
-2.99441e-06
2.94462e-05
-2.95208e-06
2.90155e-05
-2.88353e-06
2.85542e-05
-2.81773e-06
2.81311e-05
-2.72254e-06
2.77217e-05
-2.6399e-06
2.73433e-05
-2.53746e-06
2.6958e-05
-2.42311e-06
2.654e-05
-2.32934e-06
2.60754e-05
-2.22628e-06
2.55748e-05
-2.13663e-06
2.50698e-05
-2.08003e-06
2.45732e-05
-2.02737e-06
2.41201e-05
-1.98086e-06
2.3674e-05
-1.95511e-06
2.32227e-05
-1.93167e-06
2.27219e-05
-1.90575e-06
2.214e-05
-1.91968e-06
2.14858e-05
-1.95377e-06
2.07626e-05
-2.01414e-06
1.99943e-05
-2.07667e-06
1.9185e-05
-2.11124e-06
1.83166e-05
-2.11927e-06
1.73692e-05
-2.08979e-06
1.63271e-05
-2.06225e-06
1.51998e-05
-2.03435e-06
1.40325e-05
-2.05214e-06
1.28617e-05
-2.11537e-06
1.17319e-05
-2.19614e-06
1.0684e-05
-2.30946e-06
9.71137e-06
-2.43309e-06
8.81547e-06
-2.55129e-06
7.96933e-06
-2.66395e-06
7.1749e-06
-2.8399e-06
6.47648e-06
-3.1563e-06
5.89979e-06
-3.54665e-06
5.47853e-06
-3.88383e-06
5.07628e-06
-3.98678e-06
4.65584e-06
-3.90662e-06
4.20832e-06
-3.69201e-06
3.67649e-06
-3.43575e-06
3.06846e-06
-3.155e-06
2.29324e-06
-2.74501e-06
1.46971e-06
-2.5347e-06
7.95797e-07
-2.64144e-06
3.20032e-07
-2.87679e-06
9.27523e-09
-3.0262e-06
-1.31547e-07
-2.92905e-06
-2.15527e-07
-2.58295e-06
-2.61772e-07
-2.11171e-06
-3.8019e-07
-1.59611e-06
-5.82841e-07
-1.22219e-06
-7.738e-07
-9.53369e-07
-8.54324e-07
-8.39686e-07
-6.6478e-07
-8.91987e-07
-2.02423e-07
-8.91297e-07
5.18073e-07
-5.00685e-07
1.28862e-06
5.7499e-07
1.91272e-06
2.15848e-06
2.45967e-06
3.75233e-06
2.96497e-06
5.21155e-06
3.43084e-06
6.33899e-06
3.9242e-06
7.32291e-06
4.75294e-06
8.09114e-06
5.85208e-06
8.43274e-06
6.7072e-06
8.70359e-06
7.1989e-06
9.31585e-06
7.78615e-06
9.66115e-06
8.48065e-06
9.08613e-06
9.10675e-06
7.67802e-06
9.21764e-06
7.47676e-06
9.377e-06
9.06978e-06
9.69588e-06
1.01895e-05
1.05883e-05
9.45764e-06
1.18244e-05
7.06018e-06
1.32182e-05
3.31604e-06
1.37533e-05
2.30053e-07
1.36209e-05
-1.37476e-06
1.27734e-05
-3.3588e-06
1.10142e-05
-4.87578e-06
8.16862e-06
-6.09683e-06
4.94523e-06
-8.67392e-06
2.0076e-06
-1.14896e-05
8.44088e-07
-1.32283e-05
1.2572e-06
-1.39452e-05
3.97634e-07
-1.47255e-05
-4.66502e-07
-1.37697e-05
-1.47031e-06
-1.38606e-05
-2.75433e-06
-1.46184e-05
-4.85058e-06
-1.1129e-05
-6.12429e-06
-9.15027e-06
-6.27846e-06
-7.76631e-06
-5.851e-06
-3.17479e-07
-6.71944e-06
-3.31567e-06
-5.97115e-06
2.32046e-06
-6.04652e-06
7.15448e-07
-5.77632e-06
6.62459e-06
-3.54156e-06
4.28107e-06
-3.51515e-06
1.13626e-05
-1.37212e-06
9.71363e-06
6.45813e-07
1.25576e-05
2.76116e-06
1.20943e-05
4.72316e-06
1.21607e-05
7.15355e-06
1.24553e-05
9.42143e-06
1.27601e-05
1.13563e-05
1.42665e-05
1.40334e-05
1.41477e-05
1.55384e-05
1.54368e-05
1.80868e-05
1.3353e-05
1.98407e-05
1.41699e-05
2.16349e-05
1.24117e-05
2.32911e-05
1.18406e-05
2.44827e-05
1.09824e-05
2.54246e-05
9.70477e-06
2.6691e-05
8.85809e-06
2.75443e-05
7.30655e-06
2.83672e-05
6.50077e-06
2.93622e-05
5.96189e-06
3.02659e-05
4.63179e-06
3.12145e-05
3.90033e-06
3.19552e-05
2.98476e-06
3.28617e-05
1.9961e-06
3.36927e-05
1.67584e-06
3.43276e-05
-7.82658e-08
3.50203e-05
5.10716e-08
3.52067e-05
-1.56511e-06
3.58808e-05
-1.62492e-06
3.61417e-05
-2.36347e-06
3.62889e-05
-2.83254e-06
3.62021e-05
-3.03605e-06
3.55493e-05
-3.38699e-06
3.4948e-05
-4.24525e-06
-4.02914e-06
3.44991e-05
3.16103e-05
-1.07598e-07
3.1458e-05
2.35826e-07
3.12806e-05
3.50466e-07
3.11801e-05
4.32291e-07
3.11068e-05
3.29572e-07
3.10754e-05
2.30474e-07
3.10908e-05
1.51134e-07
3.10976e-05
-2.00286e-08
3.11553e-05
-5.52952e-08
3.11666e-05
-1.78205e-07
3.11882e-05
-1.95588e-07
3.11951e-05
-2.10162e-07
3.11802e-05
-2.43106e-07
3.11712e-05
-1.64883e-07
3.11443e-05
-1.60143e-07
3.11296e-05
-1.08989e-07
3.1108e-05
-8.52315e-08
3.11062e-05
-5.82423e-08
3.109e-05
-4.04451e-08
3.10896e-05
-3.13033e-08
3.10897e-05
-2.47302e-08
3.10776e-05
-2.62726e-08
3.10928e-05
6.76666e-09
3.1082e-05
-5.07118e-08
3.10874e-05
-3.71888e-09
3.109e-05
2.59547e-09
3.1071e-05
-2.49496e-08
3.10908e-05
3.77959e-08
3.10856e-05
-1.4685e-08
3.11073e-05
4.16473e-08
3.11325e-05
4.76598e-08
3.11463e-05
9.76836e-09
3.1178e-05
7.48419e-08
3.11853e-05
4.26218e-08
3.12007e-05
8.46214e-08
3.11983e-05
1.08555e-07
3.12211e-05
1.06319e-07
3.12416e-05
1.39961e-07
3.12809e-05
9.84117e-08
3.13422e-05
9.15217e-08
3.13835e-05
2.81662e-08
3.14467e-05
-4.77751e-08
3.14764e-05
-1.40862e-07
3.14922e-05
-2.63707e-07
3.15024e-05
-3.48499e-07
3.14813e-05
-5.15963e-07
3.14664e-05
-6.31424e-07
3.14341e-05
-7.81514e-07
3.13893e-05
-9.66159e-07
3.13488e-05
-1.08661e-06
3.12688e-05
-1.28297e-06
3.11948e-05
-1.4305e-06
3.10886e-05
-1.57847e-06
3.096e-05
-1.75238e-06
3.08251e-05
-1.86547e-06
3.06349e-05
-2.0171e-06
3.04332e-05
-2.12777e-06
3.018e-05
-2.2266e-06
2.98907e-05
-2.32491e-06
2.95884e-05
-2.38954e-06
2.92518e-05
-2.46355e-06
2.8911e-05
-2.5246e-06
2.85494e-05
-2.55811e-06
2.8148e-05
-2.58739e-06
2.77155e-05
-2.57895e-06
2.72386e-05
-2.55504e-06
2.67309e-05
-2.52627e-06
2.62102e-05
-2.47375e-06
2.56829e-05
-2.42479e-06
2.51511e-05
-2.35169e-06
2.46088e-05
-2.27548e-06
2.40508e-05
-2.16447e-06
2.34691e-05
-2.05824e-06
2.28885e-05
-1.95687e-06
2.2319e-05
-1.85357e-06
2.1764e-05
-1.77436e-06
2.12197e-05
-1.68204e-06
2.06771e-05
-1.594e-06
2.01164e-05
-1.51936e-06
1.95443e-05
-1.45525e-06
1.89645e-05
-1.40102e-06
1.83588e-05
-1.34942e-06
1.77364e-05
-1.30926e-06
1.70856e-05
-1.25502e-06
1.63906e-05
-1.22464e-06
1.56481e-05
-1.21129e-06
1.48457e-05
-1.21174e-06
1.39818e-05
-1.21272e-06
1.30668e-05
-1.19631e-06
1.21245e-05
-1.1769e-06
1.11804e-05
-1.14567e-06
1.02548e-05
-1.13669e-06
9.37766e-06
-1.15722e-06
8.54868e-06
-1.22315e-06
7.75142e-06
-1.3181e-06
6.98865e-06
-1.43338e-06
6.26096e-06
-1.58176e-06
5.52622e-06
-1.69836e-06
4.72478e-06
-1.74985e-06
3.88422e-06
-1.82338e-06
3.05282e-06
-2.0085e-06
2.49037e-06
-2.59386e-06
2.31897e-06
-3.37524e-06
2.26414e-06
-3.829e-06
2.1486e-06
-3.87124e-06
2.01279e-06
-3.77081e-06
1.7504e-06
-3.42961e-06
1.29906e-06
-2.98442e-06
7.04982e-07
-2.56091e-06
9.76564e-08
-2.13768e-06
-4.25494e-07
-2.01155e-06
-7.71128e-07
-2.2958e-06
-1.02202e-06
-2.6259e-06
-1.20774e-06
-2.84047e-06
-1.36192e-06
-2.77487e-06
-1.49747e-06
-2.4474e-06
-1.64673e-06
-1.96245e-06
-1.91617e-06
-1.32667e-06
-2.30359e-06
-8.34765e-07
-2.69349e-06
-5.63469e-07
-2.92456e-06
-6.0862e-07
-2.9881e-06
-8.28445e-07
-2.83214e-06
-1.04726e-06
-2.49423e-06
-8.38589e-07
-2.0388e-06
1.19556e-07
-1.4585e-06
1.57818e-06
-8.31248e-07
3.12508e-06
-1.79238e-07
4.55954e-06
4.65459e-07
5.69429e-06
1.22996e-06
6.55841e-06
2.18472e-06
7.13638e-06
3.08486e-06
7.5326e-06
3.7397e-06
8.04875e-06
4.50609e-06
8.54946e-06
5.77835e-06
8.38889e-06
7.29676e-06
7.56772e-06
8.23773e-06
6.73706e-06
8.39456e-06
7.31993e-06
8.7217e-06
8.74265e-06
9.50688e-06
9.4043e-06
1.05073e-05
8.45727e-06
1.17786e-05
5.7888e-06
1.30249e-05
2.06982e-06
1.35238e-05
-2.68935e-07
1.3459e-05
-1.30995e-06
1.2901e-05
-2.80072e-06
1.14734e-05
-3.44819e-06
9.03321e-06
-3.65668e-06
6.01879e-06
-5.6595e-06
2.26589e-06
-7.73666e-06
6.51128e-08
-1.10275e-05
-9.70512e-07
-1.29096e-05
-3.00632e-06
-1.26897e-05
-3.92897e-06
-1.28471e-05
-4.26214e-06
-1.35274e-05
-6.47417e-06
-1.24064e-05
-8.48276e-06
-9.12042e-06
-8.87722e-06
-8.75581e-06
-9.33182e-06
-7.31172e-06
-7.95985e-06
-1.68944e-06
-8.3237e-06
-2.95183e-06
-8.5925e-06
2.58926e-06
-9.04493e-06
1.16788e-06
-7.13763e-06
4.71729e-06
-4.99974e-06
2.14318e-06
-5.50836e-06
1.18712e-05
-2.2829e-06
6.48817e-06
-1.05861e-06
1.13333e-05
1.41555e-06
9.62019e-06
2.9673e-06
1.0609e-05
5.31429e-06
1.01083e-05
7.54263e-06
1.05317e-05
1.01075e-05
1.17017e-05
1.28358e-05
1.14194e-05
1.46258e-05
1.36468e-05
1.7014e-05
1.09648e-05
1.92079e-05
1.1976e-05
2.12765e-05
1.03431e-05
2.32532e-05
9.86397e-06
2.47886e-05
9.44704e-06
2.59776e-05
8.51578e-06
2.75018e-05
7.3339e-06
2.8564e-05
6.24433e-06
2.9421e-05
5.64381e-06
3.05927e-05
4.7901e-06
3.14928e-05
3.73178e-06
3.2405e-05
2.98814e-06
3.31327e-05
2.25697e-06
3.39136e-05
1.21525e-06
3.47449e-05
8.44562e-07
3.5202e-05
-5.35408e-07
3.5811e-05
-5.57966e-07
3.59918e-05
-1.74586e-06
3.64039e-05
-2.03704e-06
3.63191e-05
-2.27862e-06
3.59311e-05
-2.44462e-06
3.56001e-05
-2.70499e-06
3.49911e-05
-2.77797e-06
3.45109e-05
-3.76507e-06
-3.45962e-06
3.39414e-05
2.93967e-05
4.36591e-09
2.92489e-05
3.83674e-07
2.91165e-05
4.82894e-07
2.90762e-05
4.72548e-07
2.90348e-05
3.71037e-07
2.90456e-05
2.19653e-07
2.90771e-05
1.19619e-07
2.90879e-05
-3.08284e-08
2.91122e-05
-7.95708e-08
2.90799e-05
-1.45925e-07
2.9059e-05
-1.74704e-07
2.90198e-05
-1.70931e-07
2.89659e-05
-1.89199e-07
2.89361e-05
-1.35152e-07
2.88973e-05
-1.21305e-07
2.888e-05
-9.17107e-08
2.8865e-05
-7.02395e-08
2.88591e-05
-5.23575e-08
2.8855e-05
-3.63499e-08
2.88532e-05
-2.94376e-08
2.88494e-05
-2.1e-08
2.88379e-05
-1.47324e-08
2.88433e-05
1.3253e-09
2.88183e-05
-2.57086e-08
2.88189e-05
-4.3201e-09
2.88166e-05
4.91456e-09
2.88043e-05
-1.26533e-08
2.88268e-05
1.53053e-08
2.8823e-05
-1.08792e-08
2.88454e-05
1.93076e-08
2.88598e-05
3.31907e-08
2.88582e-05
1.14331e-08
2.88706e-05
6.23884e-08
2.88648e-05
4.84384e-08
2.88719e-05
7.74732e-08
2.8884e-05
9.65035e-08
2.8908e-05
8.22889e-08
2.89504e-05
9.75497e-08
2.89857e-05
6.31268e-08
2.90339e-05
4.33681e-08
2.90669e-05
-4.85151e-09
2.90854e-05
-6.62362e-08
2.90919e-05
-1.47433e-07
2.90697e-05
-2.41452e-07
2.90443e-05
-3.23138e-07
2.89882e-05
-4.5982e-07
2.89243e-05
-5.67537e-07
2.88411e-05
-6.98351e-07
2.87301e-05
-8.55107e-07
2.86083e-05
-9.64854e-07
2.84445e-05
-1.11921e-06
2.82614e-05
-1.24731e-06
2.80413e-05
-1.35844e-06
2.77842e-05
-1.49526e-06
2.75018e-05
-1.58302e-06
2.71719e-05
-1.68726e-06
2.68187e-05
-1.77453e-06
2.64299e-05
-1.8378e-06
2.60055e-05
-1.90057e-06
2.55551e-05
-1.93914e-06
2.50696e-05
-1.978e-06
2.45449e-05
-1.99989e-06
2.39977e-05
-2.0109e-06
2.34194e-05
-2.00907e-06
2.28304e-05
-1.98996e-06
2.22316e-05
-1.95624e-06
2.16158e-05
-1.91048e-06
2.09944e-05
-1.85233e-06
2.03531e-05
-1.78355e-06
1.97083e-05
-1.70685e-06
1.90572e-05
-1.62435e-06
1.84231e-05
-1.53039e-06
1.77991e-05
-1.43425e-06
1.71851e-05
-1.34288e-06
1.65834e-05
-1.25187e-06
1.59726e-05
-1.16351e-06
1.53694e-05
-1.07885e-06
1.47729e-05
-9.97496e-07
1.41794e-05
-9.25849e-07
1.35845e-05
-8.6038e-07
1.29772e-05
-7.93701e-07
1.23493e-05
-7.21598e-07
1.16926e-05
-6.5251e-07
1.10243e-05
-5.86707e-07
1.03374e-05
-5.37797e-07
9.64548e-06
-5.19329e-07
8.94272e-06
-5.08967e-07
8.23087e-06
-5.0087e-07
7.53896e-06
-5.04396e-07
6.88883e-06
-5.26766e-07
6.30028e-06
-5.57118e-07
5.74616e-06
-5.82567e-07
5.17953e-06
-5.9059e-07
4.51376e-06
-5.57384e-07
3.76354e-06
-5.6789e-07
2.99758e-06
-6.67415e-07
2.25817e-06
-8.42358e-07
1.61114e-06
-1.05132e-06
1.08568e-06
-1.22438e-06
6.20382e-07
-1.35809e-06
2.73088e-07
-1.66121e-06
9.10545e-08
-2.41182e-06
-8.44439e-08
-3.19974e-06
-3.3155e-07
-3.58189e-06
-5.88836e-07
-3.61396e-06
-8.36528e-07
-3.52311e-06
-1.1708e-06
-3.09534e-06
-1.65985e-06
-2.49537e-06
-2.16204e-06
-2.05873e-06
-2.62364e-06
-1.67609e-06
-3.06303e-06
-1.57215e-06
-3.51758e-06
-1.84125e-06
-3.93775e-06
-2.20573e-06
-4.28685e-06
-2.49138e-06
-4.52366e-06
-2.53806e-06
-4.61562e-06
-2.35545e-06
-4.66217e-06
-1.9159e-06
-4.67596e-06
-1.31289e-06
-4.75162e-06
-7.59104e-07
-4.88329e-06
-4.31796e-07
-5.06562e-06
-4.26293e-07
-5.33233e-06
-5.61739e-07
-5.62358e-06
-7.56005e-07
-5.78786e-06
-6.74312e-07
-5.71438e-06
4.60737e-08
-5.33168e-06
1.19548e-06
-4.76001e-06
2.55341e-06
-4.02105e-06
3.82058e-06
-3.18977e-06
4.86302e-06
-2.26329e-06
5.63192e-06
-1.28426e-06
6.15734e-06
-2.34754e-07
6.4831e-06
1.02427e-06
6.78973e-06
2.70998e-06
6.86374e-06
4.51053e-06
6.58834e-06
5.92138e-06
6.15688e-06
6.63815e-06
6.02028e-06
6.98299e-06
6.97509e-06
7.81184e-06
7.9138e-06
9.10307e-06
8.11308e-06
1.00267e-05
7.53365e-06
1.11397e-05
4.67575e-06
1.26124e-05
5.97133e-07
1.35021e-05
-1.15859e-06
1.37528e-05
-1.56065e-06
1.34272e-05
-2.47515e-06
1.20868e-05
-2.10781e-06
1.02874e-05
-1.85723e-06
8.27141e-06
-3.64352e-06
6.21069e-06
-5.67594e-06
3.13485e-06
-7.95165e-06
-7.64897e-07
-9.00985e-06
-3.60061e-06
-9.85394e-06
-5.14423e-06
-1.13034e-05
-7.65498e-06
-1.10166e-05
-1.07033e-05
-9.35811e-06
-1.12164e-05
-8.60731e-06
-1.09106e-05
-9.06157e-06
-1.2434e-05
-5.78832e-06
-1.23442e-05
-1.77926e-06
-1.32079e-05
-2.08814e-06
-1.20636e-05
1.44501e-06
-1.18937e-05
9.97936e-07
-9.81662e-06
2.64023e-06
-7.99038e-06
3.1694e-07
-6.92415e-06
1.0805e-05
-3.23965e-06
2.80367e-06
-3.22188e-06
1.13155e-05
-3.92407e-07
6.79072e-06
1.52392e-06
8.69265e-06
3.72071e-06
7.91149e-06
5.99033e-06
8.2621e-06
8.6497e-06
9.04229e-06
1.09201e-05
9.14896e-06
1.32173e-05
1.13496e-05
1.54562e-05
8.72591e-06
1.81052e-05
9.32703e-06
2.02585e-05
8.18971e-06
2.24288e-05
7.69372e-06
2.43453e-05
7.53056e-06
2.59471e-05
6.91392e-06
2.7442e-05
5.83903e-06
2.85986e-05
5.08769e-06
2.96518e-05
4.59068e-06
3.09451e-05
3.49671e-06
3.1827e-05
2.84994e-06
3.26187e-05
2.19645e-06
3.3341e-05
1.53461e-06
3.40089e-05
5.47379e-07
3.47313e-05
1.22136e-07
3.51202e-05
-9.24306e-07
3.55159e-05
-9.53624e-07
3.55314e-05
-1.76139e-06
3.54874e-05
-1.99298e-06
3.53595e-05
-2.15072e-06
3.50726e-05
-2.15778e-06
3.4731e-05
-2.36335e-06
3.40833e-05
-2.13026e-06
3.31617e-05
-2.84349e-06
-2.62163e-06
3.23237e-05
2.49365e-05
1.51675e-07
2.4877e-05
4.43163e-07
2.48972e-05
4.62664e-07
2.49348e-05
4.34974e-07
2.49701e-05
3.35783e-07
2.4986e-05
2.03686e-07
2.49989e-05
1.06716e-07
2.49858e-05
-1.77217e-08
2.49706e-05
-6.43273e-08
2.49387e-05
-1.14026e-07
2.4905e-05
-1.4105e-07
2.48687e-05
-1.3463e-07
2.4825e-05
-1.45479e-07
2.48e-05
-1.1016e-07
2.4772e-05
-9.32983e-08
2.47573e-05
-7.70097e-08
2.47446e-05
-5.74994e-08
2.47354e-05
-4.31675e-08
2.47299e-05
-3.08445e-08
2.47224e-05
-2.19641e-08
2.47132e-05
-1.17467e-08
2.471e-05
-1.15997e-08
2.47092e-05
2.17821e-09
2.47015e-05
-1.8056e-08
2.47065e-05
-9.26625e-09
2.47107e-05
6.98069e-10
2.47119e-05
-1.38244e-08
2.47195e-05
7.6223e-09
2.47154e-05
-6.71582e-09
2.47231e-05
1.15853e-08
2.47302e-05
2.60706e-08
2.47265e-05
1.51185e-08
2.47457e-05
4.3239e-08
2.4754e-05
4.01316e-08
2.47763e-05
5.51662e-08
2.48031e-05
6.96485e-08
2.48276e-05
5.78289e-08
2.48607e-05
6.44909e-08
2.48821e-05
4.16694e-08
2.49091e-05
1.63507e-08
2.49195e-05
-1.52359e-08
2.49216e-05
-6.82924e-08
2.49071e-05
-1.32972e-07
2.48711e-05
-2.05431e-07
2.48265e-05
-2.78556e-07
2.47443e-05
-3.77594e-07
2.46428e-05
-4.66009e-07
2.45108e-05
-5.66415e-07
2.43339e-05
-6.78141e-07
2.41337e-05
-7.64696e-07
2.3886e-05
-8.71533e-07
2.36021e-05
-9.63376e-07
2.32846e-05
-1.04094e-06
2.29172e-05
-1.12782e-06
2.25243e-05
-1.19015e-06
2.20897e-05
-1.25269e-06
2.16205e-05
-1.30531e-06
2.1119e-05
-1.33633e-06
2.05814e-05
-1.36294e-06
2.00162e-05
-1.37395e-06
1.942e-05
-1.38178e-06
1.8804e-05
-1.38388e-06
1.81674e-05
-1.37437e-06
1.75169e-05
-1.35848e-06
1.68598e-05
-1.33291e-06
1.61999e-05
-1.2964e-06
1.55399e-05
-1.25039e-06
1.48809e-05
-1.19337e-06
1.4225e-05
-1.12765e-06
1.35728e-05
-1.05465e-06
1.29287e-05
-9.80308e-07
1.22976e-05
-8.99278e-07
1.16772e-05
-8.13871e-07
1.10696e-05
-7.35225e-07
1.04757e-05
-6.58013e-07
9.89367e-06
-5.8145e-07
9.32208e-06
-5.07258e-07
8.76445e-06
-4.39868e-07
8.21542e-06
-3.76822e-07
7.67454e-06
-3.19491e-07
7.14212e-06
-2.61285e-07
6.6243e-06
-2.03779e-07
6.1319e-06
-1.6011e-07
5.68236e-06
-1.37166e-07
5.25411e-06
-1.09547e-07
4.82051e-06
-8.57293e-08
4.37543e-06
-6.38881e-08
3.91598e-06
-4.14212e-08
3.4728e-06
-6.12196e-08
3.03655e-06
-9.05162e-08
2.55162e-06
-7.21859e-08
1.99798e-06
-2.89261e-08
1.40953e-06
-2.13898e-09
8.67984e-07
-1.58379e-08
4.21781e-07
-1.21686e-07
8.26481e-08
-3.28282e-07
-1.0227e-07
-6.5744e-07
-1.31826e-07
-1.02177e-06
-1.35346e-07
-1.22086e-06
-3.02924e-07
-1.19051e-06
-9.90756e-07
-9.73376e-07
-2.07494e-06
-1.32763e-06
-3.19403e-06
-2.08066e-06
-4.25322e-06
-2.5227e-06
-5.07909e-06
-2.78809e-06
-5.55104e-06
-3.05116e-06
-5.82992e-06
-2.81647e-06
-6.02076e-06
-2.30452e-06
-6.24671e-06
-1.83278e-06
-6.54859e-06
-1.37421e-06
-6.86209e-06
-1.25864e-06
-7.27281e-06
-1.43053e-06
-7.7615e-06
-1.71704e-06
-8.2416e-06
-2.01128e-06
-8.63045e-06
-2.14921e-06
-8.82719e-06
-2.15871e-06
-8.87288e-06
-1.87021e-06
-8.82295e-06
-1.36281e-06
-8.70229e-06
-8.79763e-07
-8.59758e-06
-5.36506e-07
-8.61584e-06
-4.08032e-07
-8.76751e-06
-4.10063e-07
-8.99091e-06
-5.32605e-07
-9.21369e-06
-4.51539e-07
-9.25811e-06
9.04986e-08
-9.01811e-06
9.55478e-07
-8.4043e-06
1.9396e-06
-7.54256e-06
2.95884e-06
-6.44275e-06
3.76321e-06
-5.1729e-06
4.36208e-06
-3.76929e-06
4.75373e-06
-2.24134e-06
4.95515e-06
-4.73177e-07
5.02156e-06
1.41874e-06
4.97183e-06
2.9389e-06
5.06818e-06
4.10377e-06
4.99201e-06
4.8991e-06
5.22496e-06
5.65463e-06
6.21956e-06
7.22477e-06
6.34366e-06
9.16955e-06
6.16829e-06
1.08959e-05
5.80727e-06
1.24833e-05
3.08839e-06
1.38081e-05
-7.27687e-07
1.48153e-05
-2.16576e-06
1.49683e-05
-1.71369e-06
1.43194e-05
-1.8262e-06
1.31886e-05
-9.77026e-07
1.13124e-05
1.90092e-08
9.20956e-06
-1.54072e-06
7.1954e-06
-3.66178e-06
4.10236e-06
-4.8586e-06
1.12285e-06
-6.03035e-06
-1.2068e-06
-7.52429e-06
-3.9307e-06
-8.57954e-06
-6.75017e-06
-8.19718e-06
-8.21613e-06
-7.89215e-06
-9.45949e-06
-7.36394e-06
-1.19536e-05
-6.5675e-06
-1.37306e-05
-4.01133e-06
-1.39277e-05
-1.58214e-06
-1.51858e-05
-8.30009e-07
-1.53492e-05
1.60836e-06
-1.58144e-05
1.46316e-06
-1.30571e-05
-1.17067e-07
-1.11243e-05
-1.61587e-06
-1.15177e-05
1.11984e-05
-6.85281e-06
-1.86119e-06
-5.19006e-06
9.65278e-06
-2.43265e-06
4.03332e-06
3.30369e-07
5.92962e-06
2.23533e-06
6.00653e-06
4.07729e-06
6.42014e-06
6.36859e-06
6.75099e-06
8.51325e-06
7.0043e-06
1.14172e-05
8.44567e-06
1.36539e-05
6.48917e-06
1.64355e-05
6.54543e-06
1.86528e-05
5.97241e-06
2.08902e-05
5.4563e-06
2.30532e-05
5.36755e-06
2.48682e-05
5.0989e-06
2.6312e-05
4.3953e-06
2.7771e-05
3.62867e-06
2.91099e-05
3.25178e-06
3.0301e-05
2.3056e-06
3.11916e-05
1.95935e-06
3.19777e-05
1.41037e-06
3.27875e-05
7.24753e-07
3.33173e-05
1.76503e-08
3.38426e-05
-4.03196e-07
3.41421e-05
-1.2238e-06
3.44636e-05
-1.2751e-06
3.44866e-05
-1.78446e-06
3.42516e-05
-1.75793e-06
3.39546e-05
-1.85371e-06
3.35106e-05
-1.71377e-06
3.30044e-05
-1.8572e-06
3.25392e-05
-1.6651e-06
3.17156e-05
-2.01982e-06
-1.77399e-06
3.08679e-05
1.86196e-05
6.44273e-08
1.89123e-05
1.50401e-07
1.91347e-05
2.40322e-07
1.92622e-05
3.07454e-07
1.93419e-05
2.56092e-07
1.9383e-05
1.62602e-07
1.94195e-05
7.01606e-08
1.942e-05
-1.81925e-08
1.9419e-05
-6.33164e-08
1.94044e-05
-9.94804e-08
1.93741e-05
-1.10755e-07
1.93455e-05
-1.05999e-07
1.93075e-05
-1.07506e-07
1.92804e-05
-8.30516e-08
1.9256e-05
-6.88552e-08
1.92345e-05
-5.55768e-08
1.9218e-05
-4.09353e-08
1.92069e-05
-3.20569e-08
1.91976e-05
-2.16068e-08
1.91902e-05
-1.45129e-08
1.91899e-05
-1.1455e-08
1.91857e-05
-7.41347e-09
1.91918e-05
-3.93343e-09
1.91876e-05
-1.38635e-08
1.91867e-05
-8.39531e-09
1.91935e-05
-6.05892e-09
1.91886e-05
-8.90997e-09
1.91947e-05
1.53854e-09
1.91928e-05
-4.84832e-09
1.9198e-05
6.39147e-09
1.92079e-05
1.61656e-08
1.9212e-05
1.10159e-08
1.92276e-05
2.76786e-08
1.92401e-05
2.76244e-08
1.92608e-05
3.44785e-08
1.92865e-05
4.38845e-08
1.93089e-05
3.54087e-08
1.93379e-05
3.54882e-08
1.93594e-05
2.02673e-08
1.93756e-05
6.24842e-11
1.93833e-05
-2.28763e-08
1.93739e-05
-5.89564e-08
1.93436e-05
-1.02618e-07
1.92886e-05
-1.50398e-07
1.92103e-05
-2.00273e-07
1.90943e-05
-2.6161e-07
1.89473e-05
-3.19045e-07
1.87625e-05
-3.81638e-07
1.85321e-05
-4.47738e-07
1.82691e-05
-5.01682e-07
1.79588e-05
-5.61199e-07
1.76076e-05
-6.12192e-07
1.72207e-05
-6.54048e-07
1.67889e-05
-6.96046e-07
1.63231e-05
-7.24347e-07
1.5821e-05
-7.50504e-07
1.52849e-05
-7.69242e-07
1.47238e-05
-7.75254e-07
1.41375e-05
-7.76641e-07
1.35336e-05
-7.69999e-07
1.2911e-05
-7.59202e-07
1.22732e-05
-7.4611e-07
1.1628e-05
-7.29127e-07
1.09808e-05
-7.11269e-07
1.03385e-05
-6.90685e-07
9.70727e-06
-6.65115e-07
9.09083e-06
-6.33954e-07
8.48981e-06
-5.92344e-07
7.90286e-06
-5.40696e-07
7.3301e-06
-4.81891e-07
6.76843e-06
-4.18635e-07
6.22132e-06
-3.52164e-07
5.69094e-06
-2.83493e-07
5.1787e-06
-2.22982e-07
4.69187e-06
-1.71191e-07
4.2393e-06
-1.28877e-07
3.82995e-06
-9.79077e-08
3.47071e-06
-8.06223e-08
3.16287e-06
-6.89833e-08
2.89404e-06
-5.06642e-08
2.64549e-06
-1.27388e-08
2.39968e-06
4.20304e-08
2.13115e-06
1.08422e-07
1.82079e-06
1.732e-07
1.47818e-06
2.33057e-07
1.12017e-06
2.7228e-07
7.94843e-07
2.61443e-07
5.7278e-07
1.80641e-07
4.58994e-07
5.25666e-08
3.8006e-07
-1.1582e-08
2.29107e-07
7.87678e-08
-3.31847e-08
2.33365e-07
-2.64742e-07
2.29418e-07
-3.09877e-07
2.92968e-08
-2.16135e-07
-2.15428e-07
-9.49728e-08
-4.49444e-07
-6.44003e-08
-6.88013e-07
-2.9291e-07
-7.93257e-07
-1.03685e-06
-4.76922e-07
-2.31352e-06
8.61625e-08
-3.78359e-06
4.96696e-07
-4.89554e-06
-2.15689e-07
-5.66725e-06
-1.30894e-06
-6.39832e-06
-1.79163e-06
-7.09947e-06
-2.08694e-06
-7.81402e-06
-2.3366e-06
-8.51684e-06
-2.11365e-06
-9.05175e-06
-1.76961e-06
-9.57233e-06
-1.31221e-06
-1.0066e-05
-8.80556e-07
-1.04704e-05
-8.5422e-07
-1.0927e-05
-9.7391e-07
-1.14029e-05
-1.24121e-06
-1.18549e-05
-1.55925e-06
-1.22893e-05
-1.71475e-06
-1.26301e-05
-1.81795e-06
-1.27831e-05
-1.71717e-06
-1.27504e-05
-1.39556e-06
-1.26396e-05
-9.90613e-07
-1.2532e-05
-6.44036e-07
-1.2426e-05
-5.14041e-07
-1.23656e-05
-4.70522e-07
-1.24062e-05
-4.91946e-07
-1.24507e-05
-4.0706e-07
-1.23808e-05
2.0559e-08
-1.20009e-05
5.75669e-07
-1.12495e-05
1.18818e-06
-1.01775e-05
1.88683e-06
-8.87854e-06
2.46423e-06
-7.37497e-06
2.8585e-06
-5.74618e-06
3.12495e-06
-4.11664e-06
3.3256e-06
-2.43039e-06
3.33531e-06
-9.11849e-07
3.45329e-06
4.36888e-07
3.71944e-06
1.84746e-06
3.58143e-06
3.05262e-06
4.0198e-06
4.35967e-06
4.91251e-06
6.32595e-06
4.37738e-06
8.7059e-06
3.78834e-06
1.16648e-05
2.84836e-06
1.42227e-05
5.30504e-07
1.53384e-05
-1.84344e-06
1.60042e-05
-2.83153e-06
1.57003e-05
-1.40977e-06
1.38993e-05
-2.52055e-08
1.23724e-05
5.49829e-07
1.11824e-05
1.20906e-06
9.25369e-06
3.87984e-07
6.13345e-06
-5.4155e-07
3.56077e-06
-2.28592e-06
1.58231e-06
-4.05188e-06
-1.0439e-06
-4.89808e-06
-3.68728e-06
-5.93616e-06
-5.72321e-06
-6.16125e-06
-7.52202e-06
-6.09335e-06
-1.01705e-05
-4.71548e-06
-1.34163e-05
-3.32166e-06
-1.44214e-05
-3.00622e-06
-1.47075e-05
-1.29606e-06
-1.57773e-05
2.39773e-07
-1.5143e-05
9.74066e-07
-1.30451e-05
-6.34754e-07
-1.02018e-05
-2.9604e-06
-1.23694e-05
5.51776e-07
-1.24863e-05
1.13153e-05
-8.55793e-06
-5.78958e-06
-4.75223e-06
5.84708e-06
-3.92132e-06
3.20241e-06
-1.30294e-06
3.31124e-06
1.51783e-07
4.55181e-06
1.96275e-06
4.60917e-06
4.25206e-06
4.46168e-06
6.5535e-06
4.70286e-06
9.64058e-06
5.35859e-06
1.19076e-05
4.22213e-06
1.45235e-05
3.9296e-06
1.67771e-05
3.71881e-06
1.88967e-05
3.33669e-06
2.10022e-05
3.26197e-06
2.28795e-05
3.22163e-06
2.4488e-05
2.78678e-06
2.59955e-05
2.12117e-06
2.73913e-05
1.85599e-06
2.8465e-05
1.23187e-06
2.94844e-05
9.40018e-07
3.04063e-05
4.88402e-07
3.1197e-05
-6.58526e-08
3.17563e-05
-5.41663e-07
3.22189e-05
-8.65875e-07
3.23176e-05
-1.32242e-06
3.2384e-05
-1.34152e-06
3.21313e-05
-1.53174e-06
3.18752e-05
-1.50189e-06
3.15157e-05
-1.49414e-06
3.11443e-05
-1.34244e-06
3.06532e-05
-1.36609e-06
3.01253e-05
-1.13715e-06
2.93092e-05
-1.2038e-06
-9.78278e-07
2.85135e-05
1.21767e-05
1.10879e-07
1.22584e-05
6.86746e-08
1.24043e-05
9.43987e-08
1.25797e-05
1.32092e-07
1.27202e-05
1.15544e-07
1.2814e-05
6.87806e-08
1.28679e-05
1.62639e-08
1.2877e-05
-2.72084e-08
1.28636e-05
-4.99204e-08
1.28274e-05
-6.33085e-08
1.27834e-05
-6.67157e-08
1.27385e-05
-6.11765e-08
1.26879e-05
-5.68544e-08
1.26482e-05
-4.33829e-08
1.26136e-05
-3.42823e-08
1.25855e-05
-2.74449e-08
1.25651e-05
-2.05383e-08
1.25481e-05
-1.50375e-08
1.25359e-05
-9.46749e-09
1.25276e-05
-6.1929e-09
1.25204e-05
-4.25664e-09
1.25156e-05
-2.55448e-09
1.25128e-05
-1.12011e-09
1.25036e-05
-4.75377e-09
1.24985e-05
-3.22372e-09
1.24939e-05
-1.52174e-09
1.24876e-05
-2.59492e-09
1.24881e-05
1.03374e-09
1.24834e-05
-8.80255e-11
1.24856e-05
4.15402e-09
1.24945e-05
7.22463e-09
1.24991e-05
6.49271e-09
1.25145e-05
1.22227e-08
1.25301e-05
1.20478e-08
1.25498e-05
1.47737e-08
1.25756e-05
1.80581e-08
1.25968e-05
1.42114e-08
1.26201e-05
1.22222e-08
1.26357e-05
4.68397e-09
1.26406e-05
-4.82254e-09
1.26337e-05
-1.59869e-08
1.26074e-05
-3.26495e-08
1.2557e-05
-5.22315e-08
1.24798e-05
-7.31882e-08
1.23745e-05
-9.49691e-08
1.22328e-05
-1.19974e-07
1.20569e-05
-1.43101e-07
1.18424e-05
-1.67152e-07
1.15861e-05
-1.91451e-07
1.12948e-05
-2.10361e-07
1.09628e-05
-2.29194e-07
1.05947e-05
-2.44115e-07
1.01957e-05
-2.55082e-07
9.7644e-06
-2.64698e-07
9.30872e-06
-2.68668e-07
8.82906e-06
-2.70846e-07
8.32996e-06
-2.70142e-07
7.81888e-06
-2.64179e-07
7.29804e-06
-2.55799e-07
6.77236e-06
-2.44315e-07
6.24471e-06
-2.3155e-07
5.71719e-06
-2.18595e-07
5.19486e-06
-2.06795e-07
4.68187e-06
-1.98281e-07
4.18573e-06
-1.94543e-07
3.7142e-06
-1.93587e-07
3.27252e-06
-1.92274e-07
2.8664e-06
-1.8622e-07
2.49224e-06
-1.66534e-07
2.14325e-06
-1.32908e-07
1.8131e-06
-8.84809e-08
1.4989e-06
-3.79635e-08
1.20334e-06
1.2069e-08
9.24139e-07
5.62161e-08
6.63338e-07
8.96108e-08
4.27403e-07
1.07058e-07
2.19342e-07
1.10154e-07
3.9494e-08
9.92255e-08
-1.06002e-07
7.65123e-08
-2.09374e-07
5.27081e-08
-2.67425e-07
4.53123e-08
-2.88896e-07
6.35011e-08
-2.82347e-07
1.01874e-07
-2.50054e-07
1.40907e-07
-1.85501e-07
1.68504e-07
-9.37321e-08
1.80511e-07
-4.15801e-09
1.71869e-07
4.89981e-08
1.27485e-07
3.47985e-08
6.67663e-08
-2.28121e-08
4.60286e-08
-7.46436e-08
1.30599e-07
-9.72458e-08
2.55967e-07
-7.03278e-08
2.025e-07
-6.23232e-09
-3.47986e-08
2.11962e-08
-2.42856e-07
-1.30855e-07
-2.97392e-07
-6.13015e-07
-2.05853e-07
-1.41055e-06
4.27622e-09
-2.16826e-06
2.80792e-07
-2.55686e-06
4.74758e-07
-2.51566e-06
4.55499e-07
-2.85723e-06
1.2588e-07
-3.97055e-06
-1.95621e-07
-5.2426e-06
-5.1958e-07
-6.26833e-06
-1.06122e-06
-7.2296e-06
-1.37533e-06
-8.04289e-06
-1.30036e-06
-8.70041e-06
-1.11209e-06
-9.28433e-06
-7.28296e-07
-9.69989e-06
-4.64989e-07
-1.0188e-05
-3.66116e-07
-1.08356e-05
-3.2626e-07
-1.16258e-05
-4.51037e-07
-1.25351e-05
-6.50019e-07
-1.33807e-05
-8.69056e-07
-1.41318e-05
-1.06685e-06
-1.47234e-05
-1.12557e-06
-1.51062e-05
-1.0128e-06
-1.53272e-05
-7.69609e-07
-1.54051e-05
-5.66098e-07
-1.54086e-05
-5.10547e-07
-1.5403e-05
-4.76187e-07
-1.54475e-05
-4.47387e-07
-1.54241e-05
-4.30496e-07
-1.51653e-05
-2.38243e-07
-1.47023e-05
1.12715e-07
-1.39216e-05
4.07481e-07
-1.28226e-05
7.87829e-07
-1.14733e-05
1.11492e-06
-9.93989e-06
1.32507e-06
-8.31612e-06
1.50119e-06
-6.61213e-06
1.6216e-06
-4.92325e-06
1.64644e-06
-3.29552e-06
1.82555e-06
-1.5502e-06
1.97412e-06
1.46571e-07
1.88467e-06
2.03855e-06
2.12782e-06
4.54307e-06
2.40799e-06
7.11531e-06
1.80514e-06
9.99739e-06
9.0626e-07
1.29017e-05
-5.59343e-08
1.42802e-05
-8.48015e-07
1.36457e-05
-1.20899e-06
1.192e-05
-1.10576e-06
1.06643e-05
-1.54044e-07
9.91048e-06
7.28566e-07
9.58723e-06
8.7308e-07
9.9585e-06
8.37787e-07
9.65753e-06
6.88956e-07
8.73488e-06
3.81099e-07
6.78331e-06
-3.34347e-07
3.70965e-06
-9.78231e-07
2.66154e-07
-1.45458e-06
-3.46436e-06
-2.20564e-06
-6.73422e-06
-2.89139e-06
-9.40098e-06
-3.42659e-06
-1.11626e-05
-2.95385e-06
-1.26595e-05
-1.82472e-06
-1.3705e-05
-1.96072e-06
-1.37845e-05
-1.21658e-06
-1.37838e-05
2.39077e-07
-1.31361e-05
3.26337e-07
-1.2889e-05
-8.81852e-07
-1.29817e-05
-2.86774e-06
-1.34279e-05
9.97963e-07
-9.24651e-06
7.13398e-06
-9.82828e-06
-5.2078e-06
-6.94599e-06
2.9648e-06
-6.15961e-06
2.41603e-06
-3.85566e-06
1.00729e-06
-1.93197e-06
2.62812e-06
3.93667e-07
2.28354e-06
2.73167e-06
2.12368e-06
5.20261e-06
2.23192e-06
8.16825e-06
2.39295e-06
1.04748e-05
1.91559e-06
1.27076e-05
1.69676e-06
1.48088e-05
1.6176e-06
1.67529e-05
1.39262e-06
1.86854e-05
1.32952e-06
2.05844e-05
1.32261e-06
2.22902e-05
1.08099e-06
2.37253e-05
6.86057e-07
2.50866e-05
4.94621e-07
2.61375e-05
1.81051e-07
2.71356e-05
-5.81276e-08
2.79067e-05
-2.82692e-07
2.8396e-05
-5.55106e-07
2.86107e-05
-7.56368e-07
2.85889e-05
-8.44125e-07
2.8254e-05
-9.87495e-07
2.78874e-05
-9.74912e-07
2.73046e-05
-9.49018e-07
2.66938e-05
-8.91041e-07
2.59567e-05
-7.57022e-07
2.52471e-05
-6.32909e-07
2.43973e-05
-5.16274e-07
2.36594e-05
-3.99183e-07
2.27471e-05
-2.91562e-07
-2.72608e-07
2.20414e-05
4.54095e-06
4.60962e-06
4.70402e-06
4.83612e-06
4.95166e-06
5.02044e-06
5.0367e-06
5.0095e-06
4.95958e-06
4.89627e-06
4.82955e-06
4.76837e-06
4.71152e-06
4.66814e-06
4.63385e-06
4.60641e-06
4.58587e-06
4.57083e-06
4.56137e-06
4.55517e-06
4.55092e-06
4.54836e-06
4.54724e-06
4.54249e-06
4.53927e-06
4.53774e-06
4.53515e-06
4.53618e-06
4.53609e-06
4.54025e-06
4.54747e-06
4.55397e-06
4.56619e-06
4.57824e-06
4.59301e-06
4.61107e-06
4.62528e-06
4.6375e-06
4.64219e-06
4.63736e-06
4.62138e-06
4.58873e-06
4.5365e-06
4.46331e-06
4.36834e-06
4.24836e-06
4.10526e-06
3.93811e-06
3.74666e-06
3.5363e-06
3.3071e-06
3.06299e-06
2.80791e-06
2.54321e-06
2.27454e-06
2.0037e-06
1.73355e-06
1.46938e-06
1.21358e-06
9.69261e-07
7.37711e-07
5.19115e-07
3.1232e-07
1.14039e-07
-8.05045e-08
-2.74092e-07
-4.66366e-07
-6.52586e-07
-8.19119e-07
-9.52027e-07
-1.04051e-06
-1.07847e-06
-1.0664e-06
-1.01019e-06
-9.20576e-07
-8.13518e-07
-7.03364e-07
-6.04139e-07
-5.27626e-07
-4.74918e-07
-4.29606e-07
-3.66105e-07
-2.64231e-07
-1.23324e-07
4.51805e-08
2.25691e-07
3.9756e-07
5.25045e-07
5.91811e-07
6.3784e-07
7.68439e-07
1.02441e-06
1.22691e-06
1.19211e-06
9.49253e-07
6.5186e-07
4.46007e-07
4.50283e-07
7.31075e-07
1.20583e-06
1.66133e-06
1.78721e-06
1.59159e-06
1.07201e-06
1.07901e-08
-1.36454e-06
-2.6649e-06
-3.77699e-06
-4.50529e-06
-4.97027e-06
-5.33639e-06
-5.66265e-06
-6.11369e-06
-6.76371e-06
-7.63276e-06
-8.69961e-06
-9.82518e-06
-1.0838e-05
-1.16076e-05
-1.21737e-05
-1.26842e-05
-1.31604e-05
-1.36078e-05
-1.40383e-05
-1.42766e-05
-1.41638e-05
-1.37564e-05
-1.29685e-05
-1.18536e-05
-1.05285e-05
-9.02735e-06
-7.40575e-06
-5.75931e-06
-3.93376e-06
-1.95964e-06
-7.49715e-08
2.05285e-06
4.46084e-06
6.26598e-06
7.17224e-06
7.11631e-06
6.26829e-06
5.0593e-06
3.95355e-06
3.7995e-06
4.52807e-06
5.40115e-06
6.23894e-06
6.92789e-06
7.30899e-06
6.97464e-06
5.99641e-06
4.54183e-06
2.33619e-06
-5.55202e-07
-3.98179e-06
-6.93565e-06
-8.76036e-06
-1.07211e-05
-1.19377e-05
-1.16986e-05
-1.13722e-05
-1.22541e-05
-1.51218e-05
-1.41239e-05
-6.9899e-06
-1.21977e-05
-9.2329e-06
-6.81688e-06
-5.80959e-06
-3.18147e-06
-8.97933e-07
1.22575e-06
3.45767e-06
5.85062e-06
7.76621e-06
9.46297e-06
1.10806e-05
1.24732e-05
1.38027e-05
1.51253e-05
1.62063e-05
1.68924e-05
1.7387e-05
1.7568e-05
1.75099e-05
1.72272e-05
1.66721e-05
1.59158e-05
1.50716e-05
1.40841e-05
1.31092e-05
1.21602e-05
1.12692e-05
1.05121e-05
9.87923e-06
9.36296e-06
8.96377e-06
8.67221e-06
8.3996e-06
-5.72283e-07
5.72283e-07
-3.75583e-07
-1.96701e-07
5.0873e-07
-8.84313e-07
1.46719e-06
-9.58458e-07
2.16472e-06
-6.97536e-07
2.41443e-06
-2.49703e-07
2.24958e-06
1.64844e-07
1.7573e-06
4.92282e-07
1.02271e-06
7.34596e-07
3.60491e-07
6.62216e-07
-1.88218e-08
3.79313e-07
-6.1876e-08
4.30542e-08
2.53167e-07
-3.15043e-07
6.64712e-07
-4.11545e-07
8.95273e-07
-2.30561e-07
9.69164e-07
-7.3891e-08
9.05778e-07
6.33863e-08
6.44853e-07
2.60926e-07
6.97835e-08
5.75069e-07
-7.71421e-07
8.41205e-07
-1.46989e-06
6.98472e-07
-1.83109e-06
3.61199e-07
-1.8646e-06
3.35054e-08
-1.54602e-06
-3.18579e-07
-8.96007e-07
-6.50012e-07
1.18375e-07
-1.01438e-06
1.50326e-06
-1.38488e-06
3.14161e-06
-1.63835e-06
4.89145e-06
-1.74984e-06
6.32724e-06
-1.43579e-06
7.25639e-06
-9.29144e-07
7.69932e-06
-4.42931e-07
7.66693e-06
3.23901e-08
7.20908e-06
4.57849e-07
6.5357e-06
6.73381e-07
5.81273e-06
7.22973e-07
5.13947e-06
6.73259e-07
4.44851e-06
6.90957e-07
3.63062e-06
8.17891e-07
2.86134e-06
7.69281e-07
2.44245e-06
4.18889e-07
2.45529e-06
-1.28406e-08
2.74404e-06
-2.88749e-07
3.1692e-06
-4.25164e-07
3.41924e-06
-2.50042e-07
3.24669e-06
1.72557e-07
2.47204e-06
7.74643e-07
9.61934e-07
1.51011e-06
-1.38661e-06
2.34855e-06
-4.32983e-06
2.94322e-06
-6.49968e-06
2.16985e-06
-7.18316e-06
6.83488e-07
-7.12044e-06
-6.27262e-08
-6.81837e-06
-3.02067e-07
-6.10809e-06
-7.10282e-07
-5.18927e-06
-9.18818e-07
-4.44997e-06
-7.39303e-07
-3.71751e-06
-7.32459e-07
-2.63862e-06
-1.07889e-06
-1.1876e-06
-1.45102e-06
4.453e-07
-1.6329e-06
2.13911e-06
-1.69381e-06
3.94148e-06
-1.80237e-06
5.67878e-06
-1.73731e-06
7.30244e-06
-1.62366e-06
8.7205e-06
-1.41806e-06
9.72762e-06
-1.00711e-06
1.01538e-05
-4.26157e-07
9.56857e-06
5.85203e-07
8.11576e-06
1.45282e-06
4.92505e-06
3.1907e-06
1.34352e-06
3.58153e-06
-8.00436e-07
2.14396e-06
-1.78216e-06
9.81726e-07
-2.14874e-06
3.66577e-07
-2.71625e-06
5.67508e-07
-2.72001e-06
3.75955e-09
-2.57012e-06
-1.49883e-07
-1.81749e-06
-7.52635e-07
-4.23572e-07
-1.39392e-06
3.57227e-08
-4.59295e-07
3.78726e-07
-3.43004e-07
1.43346e-06
-1.05473e-06
2.40553e-06
-9.72072e-07
3.44597e-06
-1.04044e-06
4.80718e-06
-1.3612e-06
5.82837e-06
-1.02119e-06
5.94889e-06
-1.20521e-07
5.40662e-06
5.42278e-07
4.44528e-06
9.61335e-07
4.13614e-06
3.09138e-07
4.80095e-06
-6.64803e-07
5.79452e-06
-9.93573e-07
6.77934e-06
-9.84816e-07
7.15625e-06
-3.76918e-07
5.62847e-06
1.52778e-06
3.01028e-06
2.61819e-06
7.50817e-07
2.25946e-06
-9.48798e-07
1.69961e-06
-2.39725e-06
1.44845e-06
-3.695e-06
1.29774e-06
-4.88527e-06
1.19028e-06
-6.0014e-06
1.11613e-06
-7.04979e-06
1.04839e-06
-8.02475e-06
9.7496e-07
-8.94442e-06
9.19668e-07
-9.80327e-06
8.58847e-07
-1.06091e-05
8.0587e-07
-1.13682e-05
7.59107e-07
-1.20775e-05
7.09228e-07
-1.27591e-05
6.81598e-07
-1.34016e-05
6.42481e-07
-1.39952e-05
5.93697e-07
-1.45348e-05
5.39591e-07
-1.49837e-05
4.48909e-07
-1.53313e-05
3.47527e-07
-1.55563e-05
2.25068e-07
-1.56103e-05
5.39184e-08
-1.55006e-05
-1.09637e-07
-1.51949e-05
-3.05747e-07
-1.46821e-05
-5.1276e-07
-1.39538e-05
-7.28271e-07
-1.3005e-05
-9.48863e-07
-1.18556e-05
-1.14939e-06
-1.0528e-05
-1.32758e-06
-9.0472e-06
-1.48081e-06
-7.47213e-06
-1.57507e-06
-5.83916e-06
-1.63296e-06
-4.12609e-06
-1.71307e-06
-2.33828e-06
-1.78781e-06
-5.1731e-07
-1.82098e-06
1.24703e-06
-1.76434e-06
2.8004e-06
-1.55337e-06
4.01625e-06
-1.21585e-06
4.89957e-06
-8.83319e-07
5.5682e-06
-6.68628e-07
6.10307e-06
-5.34874e-07
6.53019e-06
-4.2712e-07
6.89832e-06
-3.68124e-07
7.22239e-06
-3.24071e-07
7.4729e-06
-2.50511e-07
7.62336e-06
-1.50461e-07
7.6488e-06
-2.5445e-08
7.5529e-06
9.59068e-08
7.36667e-06
1.86231e-07
7.14772e-06
2.18947e-07
6.93086e-06
2.16858e-07
6.72348e-06
2.07379e-07
6.50853e-06
2.14955e-07
6.25037e-06
2.58156e-07
5.96436e-06
2.8601e-07
5.67388e-06
2.90478e-07
5.3514e-06
3.22489e-07
5.06741e-06
2.83982e-07
4.97302e-06
9.43965e-08
5.05443e-06
-8.14173e-08
5.15174e-06
-9.7307e-08
5.12227e-06
2.94749e-08
5.03324e-06
8.90285e-08
4.97705e-06
5.61855e-08
4.94175e-06
3.53034e-08
5.03e-06
-8.82483e-08
5.31158e-06
-2.81585e-07
5.52916e-06
-2.17573e-07
5.62833e-06
-9.9175e-08
5.83553e-06
-2.07202e-07
6.09626e-06
-2.60723e-07
6.3007e-06
-2.04443e-07
6.42483e-06
-1.24128e-07
6.47391e-06
-4.9085e-08
6.4885e-06
-1.45846e-08
6.39956e-06
8.89398e-08
6.26428e-06
1.35273e-07
6.29922e-06
-3.49337e-08
6.61195e-06
-3.12729e-07
7.20378e-06
-5.91833e-07
7.90555e-06
-7.01772e-07
8.73352e-06
-8.27966e-07
9.81025e-06
-1.07673e-06
1.05447e-05
-7.34493e-07
1.0698e-05
-1.53288e-07
1.05438e-05
1.54273e-07
8.71413e-06
1.82963e-06
6.11222e-06
2.60191e-06
4.14456e-06
1.96766e-06
2.02256e-06
2.122e-06
1.56738e-06
4.55181e-07
2.85123e-06
-1.28385e-06
3.38725e-06
-5.36026e-07
2.29872e-06
1.08854e-06
8.19764e-07
1.47895e-06
5.29228e-08
7.66841e-07
-2.66056e-07
3.18979e-07
-2.94335e-07
2.82795e-08
1.24485e-07
-4.1882e-07
9.48248e-07
-8.23763e-07
1.85132e-06
-9.03076e-07
1.74483e-06
1.06496e-07
1.19462e-06
5.50209e-07
1.19462e-06
-4.99284e-08
6.22212e-07
6.87372e-07
-9.34001e-07
1.69325e-06
-1.89019e-06
2.59206e-06
-1.85727e-06
3.19919e-06
-1.30467e-06
3.50748e-06
-5.5799e-07
3.50174e-06
1.70584e-07
3.12151e-06
8.72509e-07
2.53771e-06
1.3184e-06
1.86147e-06
1.33846e-06
1.18003e-06
1.06075e-06
7.59168e-07
4.63913e-07
7.39861e-07
-2.95736e-07
9.26305e-07
-5.97989e-07
1.02103e-06
-3.2529e-07
8.10781e-07
1.36362e-07
2.40051e-07
6.34116e-07
-6.67054e-07
1.16803e-06
-1.58605e-06
1.49406e-06
-2.09518e-06
1.35034e-06
-2.41396e-06
1.01725e-06
-2.53755e-06
4.84791e-07
-2.44887e-06
-5.51798e-08
-2.06348e-06
-7.03964e-07
-1.35322e-06
-1.36028e-06
-3.42445e-07
-2.02516e-06
1.05797e-06
-2.7853e-06
2.69524e-06
-3.27562e-06
4.48182e-06
-3.53642e-06
5.99373e-06
-2.9477e-06
7.05657e-06
-1.99198e-06
7.76582e-06
-1.15218e-06
8.10713e-06
-3.0892e-07
8.09439e-06
4.70597e-07
7.83502e-06
9.32746e-07
7.46378e-06
1.09421e-06
7.07132e-06
1.06572e-06
6.71737e-06
1.0449e-06
6.37336e-06
1.1619e-06
5.95682e-06
1.18583e-06
5.54408e-06
8.31625e-07
5.27525e-06
2.55986e-07
5.28943e-06
-3.02925e-07
5.4543e-06
-5.90034e-07
5.52954e-06
-3.25281e-07
5.36047e-06
3.41629e-07
4.81204e-06
1.32307e-06
3.78886e-06
2.53329e-06
2.25226e-06
3.88515e-06
1.20844e-07
5.07463e-06
-2.72277e-06
5.01346e-06
-5.417e-06
3.37772e-06
-6.74425e-06
1.26452e-06
-6.53088e-06
-5.15432e-07
-5.79236e-06
-1.44881e-06
-5.35536e-06
-1.35581e-06
-5.21848e-06
-8.76188e-07
-4.75791e-06
-1.19303e-06
-3.75024e-06
-2.08656e-06
-2.50839e-06
-2.69287e-06
-1.0773e-06
-3.06399e-06
5.28943e-07
-3.30006e-06
2.24198e-06
-3.51541e-06
4.03442e-06
-3.52974e-06
5.84111e-06
-3.43036e-06
7.61725e-06
-3.1942e-06
9.0939e-06
-2.48377e-06
1.01444e-05
-1.47665e-06
1.08285e-05
-9.89008e-08
1.0802e-05
1.47931e-06
1.04838e-05
3.50891e-06
9.01204e-06
5.05329e-06
5.5695e-06
5.5865e-06
2.38694e-06
4.16428e-06
4.66616e-07
2.2869e-06
-9.18304e-08
1.12595e-06
-7.87033e-08
-9.36747e-09
2.70498e-07
-4.99085e-07
1.01126e-06
-1.4934e-06
1.81509e-06
-2.19775e-06
2.26919e-06
-9.13391e-07
2.94877e-06
-1.02258e-06
3.8328e-06
-1.93876e-06
4.54583e-06
-1.68511e-06
5.70841e-06
-2.20302e-06
6.82869e-06
-2.48148e-06
7.54564e-06
-1.73814e-06
7.73844e-06
-3.13322e-07
7.55772e-06
7.22996e-07
8.05528e-06
4.6377e-07
8.13581e-06
2.28608e-07
6.58727e-06
8.83738e-07
2.78246e-06
2.81124e-06
-1.52278e-06
3.32042e-06
-4.97484e-06
3.07514e-06
-7.00193e-06
3.55487e-06
-8.2772e-06
3.89347e-06
-9.59065e-06
3.57291e-06
-1.09737e-05
3.0827e-06
-1.21799e-05
2.65458e-06
-1.32191e-05
2.33702e-06
-1.41223e-05
2.09345e-06
-1.48887e-05
1.88255e-06
-1.55422e-05
1.70187e-06
-1.60849e-05
1.51762e-06
-1.65281e-05
1.36292e-06
-1.68942e-05
1.22493e-06
-1.71788e-05
1.09051e-06
-1.7404e-05
9.8431e-07
-1.75707e-05
8.75873e-07
-1.76782e-05
7.89107e-07
-1.77347e-05
6.99024e-07
-1.77271e-05
5.8609e-07
-1.76539e-05
4.66375e-07
-1.74979e-05
2.92847e-07
-1.72374e-05
8.7025e-08
-1.68833e-05
-1.28934e-07
-1.64156e-05
-4.13818e-07
-1.58023e-05
-7.2299e-07
-1.50444e-05
-1.06359e-06
-1.41324e-05
-1.42477e-06
-1.30514e-05
-1.80927e-06
-1.1823e-05
-2.17731e-06
-1.04534e-05
-2.51896e-06
-8.93892e-06
-2.84206e-06
-7.31695e-06
-3.10278e-06
-5.63152e-06
-3.2605e-06
-3.9506e-06
-3.31389e-06
-2.24299e-06
-3.42067e-06
-4.58416e-07
-3.57239e-06
1.43125e-06
-3.71064e-06
3.36269e-06
-3.69578e-06
5.21716e-06
-3.40785e-06
6.79013e-06
-2.78882e-06
7.98748e-06
-2.08067e-06
8.9061e-06
-1.58725e-06
9.6905e-06
-1.31927e-06
1.04051e-05
-1.14175e-06
1.11023e-05
-1.06534e-06
1.18202e-05
-1.04191e-06
1.25621e-05
-9.92474e-07
1.32825e-05
-8.70786e-07
1.39211e-05
-6.64045e-07
1.43851e-05
-3.68072e-07
1.4666e-05
-9.4671e-08
1.48002e-05
8.46623e-08
1.48689e-05
1.48235e-07
1.49624e-05
1.13885e-07
1.508e-05
9.73115e-08
1.51691e-05
1.69068e-07
1.52752e-05
1.79902e-07
1.53617e-05
2.0394e-07
1.53107e-05
3.73558e-07
1.50726e-05
5.22039e-07
1.46378e-05
5.29253e-07
1.39061e-05
6.50239e-07
1.28746e-05
9.34233e-07
1.16749e-05
1.22917e-06
1.04029e-05
1.36103e-06
9.33494e-06
1.1241e-06
8.63916e-06
7.31089e-07
8.33174e-06
2.19168e-07
8.36452e-06
-3.14364e-07
8.5027e-06
-3.55752e-07
8.40155e-06
1.97418e-09
8.13457e-06
5.97815e-08
8.12715e-06
-2.53308e-07
8.46345e-06
-5.40741e-07
8.92355e-06
-5.84227e-07
9.52061e-06
-6.46146e-07
1.02743e-05
-7.68268e-07
1.09105e-05
-5.47309e-07
1.11637e-05
-1.1786e-07
1.11179e-05
1.0835e-08
1.09977e-05
-1.92568e-07
1.09746e-05
-5.68711e-07
1.10188e-05
-7.45979e-07
1.1488e-05
-1.29711e-06
1.23288e-05
-1.91757e-06
1.30718e-05
-1.47745e-06
1.40261e-05
-1.10764e-06
1.40124e-05
1.68028e-07
1.31603e-05
2.68165e-06
1.25907e-05
3.17156e-06
1.01043e-05
4.45409e-06
7.14405e-06
5.08221e-06
6.10789e-06
1.49134e-06
4.69764e-06
1.26404e-07
2.25398e-06
1.90763e-06
1.40782e-07
3.20173e-06
-7.6417e-07
2.38391e-06
-1.29426e-06
1.29693e-06
-1.82836e-06
8.53081e-07
-1.84157e-06
4.14906e-08
-1.30533e-06
-9.55065e-07
-3.68428e-07
-1.76066e-06
5.58375e-07
-1.82988e-06
8.75641e-07
-2.1077e-07
8.7476e-07
5.5109e-07
2.06938e-06
4.65764e-07
1.56447e-07
1.74558e-06
-2.21382e-06
2.56705e-06
-2.71166e-06
3.19159e-06
-2.4818e-06
3.64e-06
-1.75308e-06
3.90189e-06
-8.19886e-07
3.97436e-06
9.81152e-08
3.75248e-06
1.09439e-06
3.27312e-06
1.79776e-06
2.63574e-06
1.97583e-06
2.00378e-06
1.69271e-06
1.5004e-06
9.67298e-07
1.17774e-06
2.69223e-08
9.35465e-07
-3.55713e-07
5.25899e-07
8.42752e-08
-1.37135e-07
7.99396e-07
-1.03968e-06
1.53666e-06
-1.85879e-06
1.98715e-06
-2.29335e-06
1.92862e-06
-2.5988e-06
1.6558e-06
-2.79643e-06
1.21488e-06
-2.88074e-06
5.69094e-07
-2.81508e-06
-1.20842e-07
-2.46883e-06
-1.05021e-06
-1.83306e-06
-1.99605e-06
-9.11516e-07
-2.9467e-06
3.68144e-07
-4.06496e-06
1.79165e-06
-4.69912e-06
3.38499e-06
-5.12977e-06
4.72235e-06
-4.28505e-06
5.60004e-06
-2.86968e-06
6.23211e-06
-1.78425e-06
6.60772e-06
-6.84529e-07
6.72781e-06
3.50509e-07
6.65156e-06
1.00899e-06
6.47158e-06
1.27419e-06
6.25346e-06
1.28385e-06
6.10295e-06
1.19541e-06
5.89602e-06
1.36883e-06
5.7171e-06
1.36475e-06
5.54744e-06
1.00129e-06
5.45591e-06
3.47513e-07
5.51437e-06
-3.61379e-07
5.58859e-06
-6.64253e-07
5.55081e-06
-2.87505e-07
5.30054e-06
5.91895e-07
4.85994e-06
1.76368e-06
4.20386e-06
3.18937e-06
3.33803e-06
4.75098e-06
2.18581e-06
6.22685e-06
3.97123e-07
6.80214e-06
-1.76138e-06
5.53622e-06
-3.42732e-06
2.93046e-06
-4.4634e-06
5.20644e-07
-5.13093e-06
-7.81277e-07
-5.94835e-06
-5.38388e-07
-6.52716e-06
-2.97379e-07
-6.2738e-06
-1.44639e-06
-5.63705e-06
-2.72331e-06
-4.93437e-06
-3.39555e-06
-3.84875e-06
-4.14961e-06
-2.53733e-06
-4.61148e-06
-1.10359e-06
-4.94915e-06
5.51047e-07
-5.18437e-06
2.31061e-06
-5.18992e-06
4.0066e-06
-4.89019e-06
5.59651e-06
-4.07368e-06
6.99705e-06
-2.87719e-06
8.11691e-06
-1.21876e-06
8.93576e-06
6.60457e-07
9.8071e-06
2.63757e-06
1.0007e-05
4.85339e-06
9.44251e-06
6.151e-06
8.0952e-06
5.51159e-06
6.36111e-06
4.021e-06
5.22862e-06
2.25845e-06
4.91148e-06
3.07767e-07
4.73807e-06
-3.25675e-07
5.12554e-06
-1.88086e-06
5.23055e-06
-2.30276e-06
4.98702e-06
-6.69862e-07
5.63058e-06
-1.66614e-06
5.59779e-06
-1.90597e-06
5.70966e-06
-1.79698e-06
6.90525e-06
-3.3986e-06
7.86839e-06
-3.44463e-06
7.99941e-06
-1.86916e-06
7.53182e-06
1.5427e-07
6.43622e-06
1.8186e-06
3.59158e-06
3.30841e-06
-7.43263e-07
4.56345e-06
-4.79351e-06
4.93399e-06
-7.25997e-06
5.27769e-06
-9.12005e-06
5.1805e-06
-1.10069e-05
4.96197e-06
-1.22239e-05
4.77191e-06
-1.2796e-05
4.46558e-06
-1.32865e-05
4.06342e-06
-1.38163e-05
3.61246e-06
-1.43291e-05
3.16736e-06
-1.47494e-05
2.7573e-06
-1.50763e-05
2.42034e-06
-1.53212e-05
2.12751e-06
-1.54714e-05
1.85204e-06
-1.55674e-05
1.61362e-06
-1.56034e-05
1.39896e-06
-1.55866e-05
1.20812e-06
-1.55421e-05
1.04596e-06
-1.54606e-05
9.02829e-07
-1.53772e-05
7.92504e-07
-1.5275e-05
6.86925e-07
-1.51368e-05
5.60758e-07
-1.49897e-05
4.3899e-07
-1.47939e-05
2.70585e-07
-1.45541e-05
5.31171e-08
-1.42644e-05
-2.02735e-07
-1.38814e-05
-5.11903e-07
-1.34095e-05
-8.85758e-07
-1.28168e-05
-1.31564e-06
-1.20893e-05
-1.79107e-06
-1.12275e-05
-2.28662e-06
-1.02e-05
-2.83673e-06
-9.00404e-06
-3.3733e-06
-7.68288e-06
-3.84012e-06
-6.22504e-06
-4.2999e-06
-4.62549e-06
-4.70233e-06
-2.93738e-06
-4.94861e-06
-1.30811e-06
-4.94315e-06
2.14829e-07
-4.94362e-06
1.68845e-06
-5.046e-06
3.26744e-06
-5.28963e-06
4.98701e-06
-5.41534e-06
6.76476e-06
-5.1856e-06
8.36777e-06
-4.39183e-06
9.62694e-06
-3.33984e-06
1.05805e-05
-2.54077e-06
1.13804e-05
-2.11926e-06
1.21052e-05
-1.86647e-06
1.27508e-05
-1.71101e-06
1.33601e-05
-1.65116e-06
1.40569e-05
-1.68926e-06
1.48445e-05
-1.65846e-06
1.56208e-05
-1.44034e-06
1.63143e-05
-1.06152e-06
1.68604e-05
-6.4076e-07
1.72226e-05
-2.77578e-07
1.74783e-05
-1.07475e-07
1.77275e-05
-1.35255e-07
1.80063e-05
-1.81533e-07
1.83399e-05
-1.64507e-07
1.87348e-05
-2.15016e-07
1.91593e-05
-2.20567e-07
1.95194e-05
1.35081e-08
1.97934e-05
2.48027e-07
1.98467e-05
4.75878e-07
1.96609e-05
8.36063e-07
1.92486e-05
1.34657e-06
1.86729e-05
1.80489e-06
1.79265e-05
2.10734e-06
1.6651e-05
2.39961e-06
1.47585e-05
2.62363e-06
1.27316e-05
2.24607e-06
1.10675e-05
1.3497e-06
1.01391e-05
5.72727e-07
9.64748e-06
4.93553e-07
9.03931e-06
6.67952e-07
8.5757e-06
2.10292e-07
8.60739e-06
-5.72424e-07
8.95874e-06
-9.35579e-07
9.38557e-06
-1.07298e-06
9.93883e-06
-1.32152e-06
1.07132e-05
-1.3217e-06
1.15676e-05
-9.72277e-07
1.21769e-05
-5.98466e-07
1.22805e-05
-2.96174e-07
1.19021e-05
-1.90232e-07
1.16068e-05
-4.50694e-07
1.17654e-05
-1.45577e-06
1.2365e-05
-2.5171e-06
1.34024e-05
-2.5149e-06
1.41275e-05
-1.83269e-06
1.38693e-05
4.26228e-07
1.35942e-05
2.95668e-06
1.26008e-05
4.16499e-06
1.01237e-05
6.93119e-06
8.87243e-06
6.33348e-06
7.52942e-06
2.83434e-06
4.19167e-06
3.46415e-06
6.77551e-07
5.42176e-06
-9.84136e-07
4.86342e-06
-1.871e-06
3.27077e-06
-3.23871e-06
2.66465e-06
-4.1319e-06
1.74627e-06
-4.29076e-06
2.00348e-07
-3.87353e-06
-1.37229e-06
-2.89245e-06
-2.74174e-06
-1.85696e-06
-2.86537e-06
-2.34083e-07
-1.83365e-06
7.28369e-07
-4.11362e-07
2.79775e-06
1.06041e-06
-9.03963e-07
2.01019e-06
-3.1636e-06
2.55567e-06
-3.25714e-06
2.90864e-06
-2.83477e-06
3.21042e-06
-2.05486e-06
3.47459e-06
-1.08406e-06
3.63833e-06
-6.56221e-08
3.59136e-06
1.14136e-06
3.29413e-06
2.09499e-06
2.80807e-06
2.46189e-06
2.21696e-06
2.28382e-06
1.68235e-06
1.50191e-06
1.24501e-06
4.64267e-07
6.65387e-07
2.23907e-07
-1.08089e-07
8.57752e-07
-1.05601e-06
1.74732e-06
-1.89133e-06
2.37197e-06
-2.31989e-06
2.41572e-06
-2.54736e-06
2.15608e-06
-2.85972e-06
1.96815e-06
-3.00563e-06
1.3608e-06
-3.15028e-06
7.13749e-07
-3.0782e-06
-1.92927e-07
-2.85461e-06
-1.2738e-06
-2.30793e-06
-2.54272e-06
-1.48575e-06
-3.76888e-06
-3.30328e-07
-5.22038e-06
9.14866e-07
-5.94432e-06
2.23083e-06
-6.44574e-06
3.36041e-06
-5.41463e-06
4.03755e-06
-3.54683e-06
4.48484e-06
-2.23153e-06
4.77421e-06
-9.73901e-07
4.97146e-06
1.53254e-07
5.04066e-06
9.39796e-07
5.01141e-06
1.30344e-06
4.89357e-06
1.40168e-06
4.73189e-06
1.35709e-06
4.63728e-06
1.46344e-06
4.52685e-06
1.47518e-06
4.47157e-06
1.05657e-06
4.58318e-06
2.35903e-07
4.53949e-06
-3.17685e-07
4.26582e-06
-3.90584e-07
3.91844e-06
5.9872e-08
3.56739e-06
9.42951e-07
3.23295e-06
2.09811e-06
2.91706e-06
3.50527e-06
2.5621e-06
5.10594e-06
2.07804e-06
6.7109e-06
1.18703e-06
7.69315e-06
-3.68384e-07
7.09164e-06
-2.1981e-06
4.76018e-06
-3.86438e-06
2.18692e-06
-5.57638e-06
9.3072e-07
-7.07024e-06
9.55478e-07
-7.69047e-06
3.22849e-07
-7.64744e-06
-1.48942e-06
-7.68735e-06
-2.6834e-06
-7.25235e-06
-3.83056e-06
-6.36721e-06
-5.03475e-06
-5.34343e-06
-5.63525e-06
-4.0278e-06
-6.26478e-06
-2.71863e-06
-6.49354e-06
-1.20773e-06
-6.70081e-06
3.0249e-07
-6.40042e-06
1.89539e-06
-5.66657e-06
3.29648e-06
-4.27828e-06
4.5614e-06
-2.48369e-06
5.78327e-06
-5.61403e-07
7.02564e-06
1.3952e-06
8.26703e-06
3.612e-06
9.23897e-06
5.17906e-06
9.51658e-06
5.23397e-06
9.22989e-06
4.30769e-06
8.95169e-06
2.53665e-06
8.75645e-06
5.03011e-07
8.52237e-06
-9.15909e-08
8.51739e-06
-1.87589e-06
7.82786e-06
-1.61323e-06
7.63137e-06
-4.7337e-07
7.31023e-06
-1.34501e-06
6.09099e-06
-6.86727e-07
6.34968e-06
-2.05567e-06
6.53605e-06
-3.58497e-06
5.32098e-06
-2.22955e-06
2.94396e-06
5.07857e-07
5.06761e-08
3.04755e-06
-3.05341e-06
4.92269e-06
-5.85594e-06
6.11094e-06
-8.10702e-06
6.81453e-06
-9.96229e-06
6.78925e-06
-1.10917e-05
6.40714e-06
-1.18316e-05
5.92036e-06
-1.23757e-05
5.50608e-06
-1.26493e-05
5.04551e-06
-1.27295e-05
4.54582e-06
-1.27417e-05
4.07558e-06
-1.27605e-05
3.63128e-06
-1.27907e-05
3.19758e-06
-1.28299e-05
2.79642e-06
-1.28446e-05
2.43505e-06
-1.28307e-05
2.11359e-06
-1.27879e-05
1.80924e-06
-1.27102e-05
1.53595e-06
-1.26236e-05
1.31233e-06
-1.25251e-05
1.10967e-06
-1.24224e-05
9.43276e-07
-1.23147e-05
7.95055e-07
-1.21975e-05
6.75317e-07
-1.20891e-05
5.78543e-07
-1.19701e-05
4.41804e-07
-1.1834e-05
3.02843e-07
-1.16703e-05
1.06869e-07
-1.14782e-05
-1.38954e-07
-1.12221e-05
-4.58857e-07
-1.08943e-05
-8.39654e-07
-1.04751e-05
-1.30498e-06
-9.94406e-06
-1.84668e-06
-9.28446e-06
-2.45066e-06
-8.50456e-06
-3.06652e-06
-7.57515e-06
-3.76613e-06
-6.46311e-06
-4.48535e-06
-5.20551e-06
-5.09772e-06
-3.82602e-06
-5.67939e-06
-2.30793e-06
-6.22042e-06
-5.94133e-07
-6.66241e-06
1.242e-06
-6.77929e-06
2.93406e-06
-6.63568e-06
4.31036e-06
-6.4223e-06
5.53855e-06
-6.51782e-06
6.92211e-06
-6.7989e-06
8.47982e-06
-6.74331e-06
9.89157e-06
-5.80358e-06
1.09431e-05
-4.39133e-06
1.17824e-05
-3.38013e-06
1.26322e-05
-2.96903e-06
1.34712e-05
-2.70547e-06
1.41761e-05
-2.41594e-06
1.47764e-05
-2.25144e-06
1.53696e-05
-2.28245e-06
1.59837e-05
-2.27255e-06
1.65815e-05
-2.03809e-06
1.7122e-05
-1.60205e-06
1.75914e-05
-1.11017e-06
1.79253e-05
-6.11507e-07
1.81778e-05
-3.59961e-07
1.84006e-05
-3.5806e-07
1.86349e-05
-4.15777e-07
1.89779e-05
-5.07527e-07
1.94378e-05
-6.74891e-07
1.99073e-05
-6.90151e-07
2.04323e-05
-5.11426e-07
2.1038e-05
-3.5766e-07
2.1488e-05
2.58327e-08
2.17566e-05
5.67467e-07
2.20577e-05
1.04547e-06
2.2002e-05
1.86056e-06
2.1451e-05
2.65834e-06
2.09442e-05
2.90644e-06
2.03751e-05
3.19269e-06
1.88894e-05
3.73176e-06
1.64513e-05
3.78785e-06
1.40417e-05
2.98234e-06
1.24666e-05
2.06867e-06
1.14296e-05
1.70488e-06
1.05392e-05
1.10068e-06
9.93905e-06
2.77679e-08
9.66553e-06
-6.6206e-07
9.5022e-06
-9.09642e-07
9.51987e-06
-1.33919e-06
1.00118e-05
-1.81361e-06
1.08496e-05
-1.81009e-06
1.14435e-05
-1.19241e-06
1.14584e-05
-3.11016e-07
1.10496e-05
2.18536e-07
1.09731e-05
-3.74143e-07
1.14637e-05
-1.9464e-06
1.21872e-05
-3.24065e-06
1.29621e-05
-3.28977e-06
1.32725e-05
-2.14311e-06
1.33729e-05
3.25925e-07
1.33029e-05
3.02658e-06
1.19869e-05
5.48099e-06
1.07302e-05
8.18798e-06
9.69988e-06
7.36375e-06
6.17452e-06
6.35971e-06
1.82438e-06
7.81429e-06
-8.63066e-07
8.1092e-06
-2.35255e-06
6.35291e-06
-4.21308e-06
5.13129e-06
-6.03219e-06
4.48375e-06
-6.81084e-06
2.52493e-06
-7.08096e-06
4.70465e-07
-6.66263e-06
-1.79063e-06
-5.83824e-06
-3.56613e-06
-4.11231e-06
-4.5913e-06
-1.65614e-06
-4.28981e-06
2.67997e-08
-2.0943e-06
2.82455e-06
1.35689e-06
-2.26085e-06
1.69863e-06
-3.50534e-06
1.89609e-06
-3.4546e-06
2.1069e-06
-3.04558e-06
2.36602e-06
-2.31398e-06
2.63626e-06
-1.3543e-06
2.81188e-06
-2.41241e-07
2.88481e-06
1.06844e-06
2.77324e-06
2.20656e-06
2.4511e-06
2.78403e-06
1.95646e-06
2.77846e-06
1.4288e-06
2.02957e-06
8.19157e-07
1.07391e-06
4.65196e-08
9.96544e-07
-8.57571e-07
1.76184e-06
-1.67682e-06
2.56657e-06
-2.17277e-06
2.86792e-06
-2.3383e-06
2.58125e-06
-2.62176e-06
2.43954e-06
-2.91646e-06
2.26285e-06
-3.09043e-06
1.53477e-06
-3.33276e-06
9.56081e-07
-3.29681e-06
-2.28875e-07
-3.05727e-06
-1.51335e-06
-2.54598e-06
-3.05401e-06
-1.91607e-06
-4.39879e-06
-1.02097e-06
-6.11549e-06
-7.13757e-09
-6.95815e-06
9.85415e-07
-7.43829e-06
1.96012e-06
-6.38934e-06
2.4669e-06
-4.05361e-06
2.75526e-06
-2.51989e-06
2.973e-06
-1.19164e-06
3.09865e-06
2.76007e-08
3.21584e-06
8.22614e-07
3.3086e-06
1.21067e-06
3.31812e-06
1.39217e-06
3.11233e-06
1.56288e-06
2.79476e-06
1.78101e-06
2.65231e-06
1.61763e-06
2.7356e-06
9.73278e-07
2.6468e-06
3.24697e-07
2.3612e-06
-3.20792e-08
2.09705e-06
-1.2644e-07
1.91369e-06
2.43236e-07
1.76506e-06
1.09158e-06
1.57816e-06
2.28501e-06
1.38302e-06
3.7004e-06
1.16603e-06
5.32293e-06
9.30415e-07
6.94652e-06
4.98435e-07
8.12513e-06
-4.83668e-07
8.07375e-06
-1.9738e-06
6.25031e-06
-3.8248e-06
4.03793e-06
-5.84849e-06
2.95441e-06
-7.52282e-06
2.6298e-06
-8.413e-06
1.21303e-06
-9.01369e-06
-8.88727e-07
-9.36968e-06
-2.32741e-06
-8.98366e-06
-4.21658e-06
-8.57586e-06
-5.44255e-06
-7.7802e-06
-6.43091e-06
-6.86062e-06
-7.18436e-06
-5.8113e-06
-7.54286e-06
-4.65844e-06
-7.85367e-06
-3.41405e-06
-7.64481e-06
-2.12287e-06
-6.95775e-06
-8.12771e-07
-5.58838e-06
7.03421e-07
-3.99988e-06
2.10406e-06
-1.96204e-06
3.51598e-06
-1.67241e-08
5.12454e-06
2.00344e-06
6.58267e-06
3.72093e-06
7.89397e-06
3.92267e-06
8.7794e-06
3.42226e-06
9.38342e-06
1.93263e-06
9.49777e-06
3.88664e-07
9.98868e-06
-5.82504e-07
9.6048e-06
-1.49201e-06
8.93306e-06
-9.41488e-07
8.85308e-06
-3.93388e-07
7.03486e-06
4.73212e-07
5.90029e-06
4.47838e-07
5.19377e-06
-1.34915e-06
2.11266e-06
-5.03862e-07
-1.62196e-06
1.50507e-06
-4.6218e-06
3.5077e-06
-7.04879e-06
5.47454e-06
-8.96582e-06
6.83971e-06
-1.02811e-05
7.42618e-06
-1.09467e-05
7.48017e-06
-1.13055e-05
7.14807e-06
-1.1408e-05
6.50961e-06
-1.14008e-05
5.91321e-06
-1.12572e-05
5.36246e-06
-1.10267e-05
4.81498e-06
-1.07972e-05
4.31629e-06
-1.05652e-05
3.84367e-06
-1.03489e-05
3.41491e-06
-1.01718e-05
3.02055e-06
-1.00162e-05
2.64075e-06
-9.87695e-06
2.29582e-06
-9.74331e-06
1.97995e-06
-9.61617e-06
1.6821e-06
-9.48628e-06
1.40607e-06
-9.34778e-06
1.17383e-06
-9.21839e-06
9.80284e-07
-9.08984e-06
8.14726e-07
-8.97418e-06
6.79389e-07
-8.84501e-06
5.46151e-07
-8.71301e-06
4.46543e-07
-8.5928e-06
3.21591e-07
-8.45203e-06
1.62073e-07
-8.28369e-06
-6.14731e-08
-8.07997e-06
-3.42676e-07
-7.83323e-06
-7.05593e-07
-7.50625e-06
-1.16664e-06
-7.09675e-06
-1.71448e-06
-6.61515e-06
-2.32828e-06
-5.98768e-06
-3.07814e-06
-5.26332e-06
-3.79088e-06
-4.45694e-06
-4.57251e-06
-3.46488e-06
-5.47741e-06
-2.31271e-06
-6.24989e-06
-1.10466e-06
-6.88744e-06
1.10789e-07
-7.43587e-06
1.45533e-06
-8.00696e-06
3.08435e-06
-8.40831e-06
4.93599e-06
-8.48732e-06
6.61021e-06
-8.09652e-06
7.78027e-06
-7.68788e-06
8.83322e-06
-7.85185e-06
1.01173e-05
-8.02743e-06
1.13507e-05
-7.03692e-06
1.22034e-05
-5.24402e-06
1.28232e-05
-3.99995e-06
1.3521e-05
-3.66687e-06
1.43403e-05
-3.52472e-06
1.51102e-05
-3.18584e-06
1.57336e-05
-2.87489e-06
1.62688e-05
-2.81762e-06
1.67408e-05
-2.74456e-06
1.71136e-05
-2.41089e-06
1.74489e-05
-1.93734e-06
1.77641e-05
-1.42541e-06
1.79421e-05
-7.89516e-07
1.79913e-05
-4.09073e-07
1.81279e-05
-4.94713e-07
1.82766e-05
-5.6442e-07
1.85205e-05
-7.51442e-07
1.90131e-05
-1.16753e-06
1.95937e-05
-1.27078e-06
2.00926e-05
-1.01027e-06
2.07675e-05
-1.0326e-06
2.15269e-05
-7.33551e-07
2.20225e-05
7.1856e-08
2.23829e-05
6.85095e-07
2.2874e-05
1.36941e-06
2.31185e-05
2.41391e-06
2.28367e-05
3.1882e-06
2.24244e-05
3.605e-06
2.21478e-05
4.00833e-06
2.11496e-05
4.78603e-06
1.89766e-05
5.15535e-06
1.64458e-05
4.59952e-06
1.44786e-05
3.67203e-06
1.28358e-05
2.74348e-06
1.14683e-05
1.39533e-06
1.0522e-05
2.84207e-07
9.84751e-06
-2.35148e-07
9.41572e-06
-9.07395e-07
9.53234e-06
-1.93023e-06
1.00933e-05
-2.37108e-06
1.04783e-05
-1.57735e-06
1.03448e-05
-1.77569e-07
1.00024e-05
5.60932e-07
9.99742e-06
-3.69151e-07
1.02609e-05
-2.20989e-06
1.04025e-05
-3.38228e-06
1.03833e-05
-3.27054e-06
1.02803e-05
-2.04013e-06
1.02832e-05
3.23042e-07
1.00843e-05
3.2255e-06
9.25726e-06
6.30803e-06
8.55191e-06
8.89334e-06
6.45322e-06
9.46243e-06
2.51618e-06
1.02968e-05
-7.0603e-07
1.10365e-05
-2.48599e-06
9.88916e-06
-4.25862e-06
8.12554e-06
-6.59528e-06
7.46795e-06
-8.11857e-06
6.00705e-06
-8.68801e-06
3.09436e-06
-9.07434e-06
8.56799e-07
-8.9132e-06
-1.95177e-06
-8.19893e-06
-4.2804e-06
-6.53789e-06
-6.25234e-06
-4.36118e-06
-6.46652e-06
-1.55291e-06
-4.90257e-06
1.27164e-06
7.46866e-07
-3.00772e-06
1.00049e-06
-3.75897e-06
1.14193e-06
-3.59604e-06
1.3323e-06
-3.23595e-06
1.53935e-06
-2.52103e-06
1.71725e-06
-1.5322e-06
1.83325e-06
-3.5724e-07
1.94253e-06
9.59164e-07
1.92439e-06
2.22469e-06
1.71677e-06
2.99165e-06
1.36425e-06
3.13098e-06
9.45384e-07
2.44843e-06
3.62023e-07
1.65727e-06
-4.06261e-07
1.76483e-06
-1.20167e-06
2.55726e-06
-1.80692e-06
3.17182e-06
-2.0389e-06
3.09989e-06
-2.22396e-06
2.76631e-06
-2.62524e-06
2.84082e-06
-2.85674e-06
2.49435e-06
-3.15599e-06
1.83402e-06
-3.38086e-06
1.18095e-06
-3.32259e-06
-2.8715e-07
-3.09872e-06
-1.73721e-06
-2.75422e-06
-3.39851e-06
-2.31033e-06
-4.84268e-06
-1.85853e-06
-6.56728e-06
-1.11923e-06
-7.69745e-06
-3.89914e-07
-8.16761e-06
4.34711e-07
-7.21396e-06
9.38864e-07
-4.55776e-06
1.12117e-06
-2.7022e-06
1.28126e-06
-1.35172e-06
1.37543e-06
-6.65723e-08
1.45695e-06
7.41091e-07
1.43065e-06
1.23697e-06
1.23279e-06
1.59002e-06
8.98977e-07
1.8967e-06
7.06123e-07
1.97386e-06
6.24943e-07
1.69881e-06
3.76316e-07
1.2219e-06
1.21468e-07
5.79545e-07
3.55802e-08
5.38085e-08
-6.27982e-09
-8.458e-08
-7.15481e-08
3.08504e-07
-1.94658e-07
1.21469e-06
-3.03571e-07
2.39392e-06
-3.92478e-07
3.78931e-06
-4.65527e-07
5.39598e-06
-5.81685e-07
7.06268e-06
-8.62625e-07
8.40607e-06
-1.54891e-06
8.76003e-06
-2.80032e-06
7.50171e-06
-4.57528e-06
5.81289e-06
-6.56907e-06
4.9482e-06
-8.09102e-06
4.15176e-06
-8.84421e-06
1.96622e-06
-9.51069e-06
-2.22256e-07
-9.90017e-06
-1.93792e-06
-1.00801e-05
-4.03669e-06
-1.00797e-05
-5.44289e-06
-9.60841e-06
-6.90221e-06
-9.1357e-06
-7.65708e-06
-8.33198e-06
-8.34658e-06
-7.54169e-06
-8.64396e-06
-6.62775e-06
-8.55875e-06
-5.69901e-06
-7.88649e-06
-4.52166e-06
-6.76573e-06
-3.30205e-06
-5.21949e-06
-1.89009e-06
-3.374e-06
-3.44112e-07
-1.5627e-06
1.27744e-06
3.81892e-07
3.03537e-06
1.96299e-06
4.77387e-06
2.18418e-06
6.37211e-06
1.82401e-06
7.54202e-06
7.62718e-07
8.30017e-06
-3.69486e-07
9.0063e-06
-1.28863e-06
9.02954e-06
-1.51524e-06
8.84057e-06
-7.52526e-07
7.84163e-06
6.05556e-07
6.33411e-06
1.98073e-06
4.81398e-06
1.96797e-06
1.25371e-06
2.21111e-06
-2.86705e-06
3.6169e-06
-6.12662e-06
4.76463e-06
-8.63425e-06
6.01533e-06
-1.02069e-05
7.0472e-06
-1.09573e-05
7.59007e-06
-1.11437e-05
7.61263e-06
-1.09368e-05
7.27332e-06
-1.0563e-05
6.77418e-06
-1.01415e-05
6.08819e-06
-9.70251e-06
5.47418e-06
-9.26201e-06
4.92196e-06
-8.84392e-06
4.39688e-06
-8.43564e-06
3.90801e-06
-8.07759e-06
3.48562e-06
-7.74998e-06
3.0873e-06
-7.45043e-06
2.721e-06
-7.18772e-06
2.37805e-06
-6.95168e-06
2.05977e-06
-6.73274e-06
1.76101e-06
-6.53014e-06
1.47951e-06
-6.35419e-06
1.23011e-06
-6.17699e-06
9.96638e-07
-6.02245e-06
8.25738e-07
-5.86837e-06
6.60652e-07
-5.72587e-06
5.36888e-07
-5.58845e-06
4.08732e-07
-5.43501e-06
2.93102e-07
-5.27361e-06
1.60185e-07
-5.09761e-06
-1.3926e-08
-4.91649e-06
-2.42597e-07
-4.69244e-06
-5.66722e-07
-4.41841e-06
-9.79617e-07
-4.10955e-06
-1.4755e-06
-3.70597e-06
-2.11806e-06
-3.24095e-06
-2.7933e-06
-2.65512e-06
-3.66396e-06
-1.89712e-06
-4.54888e-06
-1.12786e-06
-5.34177e-06
-2.38882e-07
-6.36639e-06
8.05365e-07
-7.29414e-06
2.03254e-06
-8.11461e-06
3.23804e-06
-8.64137e-06
4.36886e-06
-9.13778e-06
5.51499e-06
-9.55444e-06
6.85763e-06
-9.82995e-06
8.4873e-06
-9.72619e-06
9.80296e-06
-9.00354e-06
1.06513e-05
-8.70015e-06
1.15335e-05
-8.90967e-06
1.24912e-05
-7.99464e-06
1.3199e-05
-5.95175e-06
1.3713e-05
-4.51399e-06
1.43334e-05
-4.28726e-06
1.5075e-05
-4.26634e-06
1.57931e-05
-3.90396e-06
1.63257e-05
-3.40749e-06
1.66492e-05
-3.1411e-06
1.67865e-05
-2.88188e-06
1.68519e-05
-2.47627e-06
1.69661e-05
-2.05156e-06
1.70382e-05
-1.49752e-06
1.69798e-05
-7.31061e-07
1.69423e-05
-3.71585e-07
1.70492e-05
-6.01615e-07
1.7426e-05
-9.41188e-07
1.79142e-05
-1.23963e-06
1.83809e-05
-1.63424e-06
1.905e-05
-1.9399e-06
1.97884e-05
-1.74871e-06
2.0389e-05
-1.63314e-06
2.10746e-05
-1.41917e-06
2.18891e-05
-7.42661e-07
2.22736e-05
3.00563e-07
2.25548e-05
1.08829e-06
2.32188e-05
1.74987e-06
2.34236e-05
2.9834e-06
2.30342e-05
3.99442e-06
2.28184e-05
4.22411e-06
2.27636e-05
4.84081e-06
2.19502e-05
5.96882e-06
2.02391e-05
6.31058e-06
1.79207e-05
5.99044e-06
1.56288e-05
5.03534e-06
1.36515e-05
3.3727e-06
1.21763e-05
1.75938e-06
1.10642e-05
8.76931e-07
1.02348e-05
-7.7994e-08
9.89978e-06
-1.59519e-06
9.92031e-06
-2.39161e-06
9.87423e-06
-1.53126e-06
9.47136e-06
2.25302e-07
9.11724e-06
9.15048e-07
8.92333e-06
-1.7524e-07
8.36898e-06
-1.65555e-06
7.29372e-06
-2.30702e-06
6.13645e-06
-2.11327e-06
5.43736e-06
-1.34104e-06
5.22851e-06
5.31889e-07
5.07325e-06
3.38077e-06
4.67943e-06
6.70185e-06
3.96308e-06
9.60968e-06
1.91944e-06
1.15061e-05
-7.20949e-07
1.29371e-05
-2.69347e-06
1.3009e-05
-4.13755e-06
1.13332e-05
-6.05561e-06
1.00436e-05
-8.00286e-06
9.4152e-06
-8.91665e-06
6.92084e-06
-9.33159e-06
3.5093e-06
-9.50779e-06
1.03299e-06
-9.28764e-06
-2.17191e-06
-8.71146e-06
-4.85658e-06
-7.71315e-06
-7.25066e-06
-5.99507e-06
-8.1846e-06
-3.17892e-06
-7.71872e-06
-1.90728e-06
4.1036e-07
-3.41808e-06
5.09781e-07
-3.85839e-06
5.37013e-07
-3.62327e-06
6.12615e-07
-3.31155e-06
7.15214e-07
-2.62363e-06
8.15972e-07
-1.63296e-06
8.85748e-07
-4.27015e-07
9.57964e-07
8.86947e-07
9.91557e-07
2.1911e-06
9.14722e-07
3.06849e-06
7.38953e-07
3.30675e-06
5.0505e-07
2.68233e-06
4.07585e-08
2.12156e-06
-6.94343e-07
2.49993e-06
-1.38449e-06
3.2474e-06
-1.78583e-06
3.57316e-06
-1.89943e-06
3.21349e-06
-2.15095e-06
3.01784e-06
-2.54101e-06
3.23088e-06
-2.80638e-06
2.75971e-06
-3.18281e-06
2.21046e-06
-3.27545e-06
1.27359e-06
-3.34504e-06
-2.17561e-07
-3.3032e-06
-1.77906e-06
-3.15633e-06
-3.54538e-06
-2.82106e-06
-5.17794e-06
-2.5835e-06
-6.80484e-06
-2.14499e-06
-8.13595e-06
-1.61363e-06
-8.69897e-06
-1.02952e-06
-7.79807e-06
-4.96835e-07
-5.09045e-06
-2.62404e-07
-2.93663e-06
-7.04121e-08
-1.54371e-06
4.34367e-08
-1.80421e-07
4.69703e-08
7.37557e-07
-1.65338e-07
1.44928e-06
-5.70297e-07
1.99498e-06
-1.04451e-06
2.37091e-06
-1.52062e-06
2.44997e-06
-1.98083e-06
2.15902e-06
-2.26288e-06
1.50396e-06
-2.37866e-06
6.95323e-07
-2.40728e-06
8.2431e-08
-2.40955e-06
-8.23119e-08
-2.44033e-06
3.39279e-07
-2.49664e-06
1.27101e-06
-2.52769e-06
2.42497e-06
-2.5134e-06
3.77502e-06
-2.49486e-06
5.37745e-06
-2.51524e-06
7.08306e-06
-2.63115e-06
8.52198e-06
-3.00096e-06
9.12984e-06
-3.83104e-06
8.33179e-06
-5.24189e-06
7.22374e-06
-6.8808e-06
6.5871e-06
-7.87171e-06
5.14268e-06
-8.40789e-06
2.5024e-06
-9.18728e-06
5.57134e-07
-9.65272e-06
-1.47248e-06
-1.01189e-05
-3.57052e-06
-1.03704e-05
-5.1914e-06
-1.04937e-05
-6.77892e-06
-1.03076e-05
-7.84319e-06
-9.9542e-06
-8.69995e-06
-9.49521e-06
-9.10295e-06
-8.97344e-06
-9.08052e-06
-8.39004e-06
-8.46989e-06
-7.66182e-06
-7.49395e-06
-6.751e-06
-6.13031e-06
-5.59013e-06
-4.53488e-06
-4.29431e-06
-2.85852e-06
-2.64877e-06
-1.26365e-06
-7.65133e-07
7.93531e-08
1.05009e-06
3.68957e-07
2.98699e-06
-1.12897e-07
4.73862e-06
-9.8891e-07
6.22075e-06
-1.85162e-06
7.08948e-06
-2.15736e-06
7.16765e-06
-1.59341e-06
6.46786e-06
-5.27272e-08
4.8797e-06
2.19371e-06
3.0421e-06
3.81833e-06
1.21078e-07
4.88899e-06
-3.57363e-06
5.90583e-06
-6.51025e-06
6.55352e-06
-8.60873e-06
6.86311e-06
-9.98952e-06
7.39612e-06
-1.05523e-05
7.61002e-06
-1.05345e-05
7.5722e-06
-1.01547e-05
7.23289e-06
-9.57894e-06
6.69753e-06
-8.88063e-06
6.07587e-06
-8.29545e-06
5.50301e-06
-7.70807e-06
4.88679e-06
-7.12982e-06
4.34371e-06
-6.60713e-06
3.8742e-06
-6.11308e-06
3.41396e-06
-5.6581e-06
3.03064e-06
-5.24388e-06
2.67309e-06
-4.85708e-06
2.3342e-06
-4.50245e-06
2.02342e-06
-4.17519e-06
1.73251e-06
-3.88906e-06
1.47488e-06
-3.61593e-06
1.20638e-06
-3.36879e-06
9.82974e-07
-3.14425e-06
7.72092e-07
-2.93848e-06
6.19973e-07
-2.75195e-06
4.74124e-07
-2.54504e-06
3.29975e-07
-2.34169e-06
2.05378e-07
-2.13841e-06
8.98227e-08
-1.93409e-06
-4.41315e-08
-1.69924e-06
-2.48772e-07
-1.44847e-06
-4.93375e-07
-1.18894e-06
-8.2625e-07
-8.80755e-07
-1.2878e-06
-5.51918e-07
-1.80434e-06
-1.69539e-07
-2.50044e-06
2.44314e-07
-3.20715e-06
6.79072e-07
-4.09872e-06
1.33218e-06
-5.20199e-06
2.0268e-06
-6.0364e-06
2.64786e-06
-6.98745e-06
3.44716e-06
-8.09343e-06
4.59363e-06
-9.26109e-06
5.82992e-06
-9.87766e-06
7.02986e-06
-1.03377e-05
8.23871e-06
-1.07633e-05
9.26962e-06
-1.08609e-05
1.04141e-05
-1.08707e-05
1.16222e-05
-1.02116e-05
1.2412e-05
-9.48992e-06
1.2984e-05
-9.48174e-06
1.35747e-05
-8.58529e-06
1.40112e-05
-6.38823e-06
1.43939e-05
-4.89677e-06
1.4974e-05
-4.86736e-06
1.5654e-05
-4.94632e-06
1.61691e-05
-4.41901e-06
1.64524e-05
-3.69086e-06
1.63606e-05
-3.04927e-06
1.60559e-05
-2.57715e-06
1.56788e-05
-2.09916e-06
1.54286e-05
-1.80137e-06
1.52923e-05
-1.36123e-06
1.5347e-05
-7.85783e-07
1.57164e-05
-7.4104e-07
1.63305e-05
-1.21564e-06
1.69706e-05
-1.58132e-06
1.7705e-05
-1.97398e-06
1.83817e-05
-2.311e-06
1.89363e-05
-2.49452e-06
1.9812e-05
-2.62441e-06
2.05794e-05
-2.40047e-06
2.11192e-05
-1.95898e-06
2.16877e-05
-1.31116e-06
2.25929e-05
-6.04631e-07
2.28598e-05
8.21407e-07
2.29339e-05
1.6757e-06
2.34243e-05
2.49305e-06
2.33636e-05
4.05515e-06
2.28662e-05
4.72148e-06
2.2727e-05
4.97995e-06
2.27428e-05
5.95308e-06
2.19965e-05
7.05687e-06
2.05292e-05
7.45777e-06
1.84114e-05
7.1531e-06
1.60472e-05
5.73694e-06
1.3907e-05
3.89948e-06
1.22906e-05
2.49335e-06
1.1132e-05
1.08061e-06
1.02899e-05
-7.53104e-07
9.83255e-06
-1.93422e-06
9.30623e-06
-1.00494e-06
8.80951e-06
7.22021e-07
8.56525e-06
1.15931e-06
8.07315e-06
3.16861e-07
6.7981e-06
-3.80497e-07
4.89461e-06
-4.0353e-07
3.1765e-06
-3.95167e-07
1.95365e-06
-1.18181e-07
1.22617e-06
1.25937e-06
7.87883e-07
3.81906e-06
1.45894e-07
7.34384e-06
-9.38745e-07
1.06943e-05
-2.2057e-06
1.2773e-05
-3.26803e-06
1.39995e-05
-4.17808e-06
1.39191e-05
-5.34954e-06
1.25047e-05
-6.72238e-06
1.14164e-05
-7.77371e-06
1.04665e-05
-8.04389e-06
7.19101e-06
-8.02056e-06
3.48598e-06
-7.63959e-06
6.5203e-07
-7.23421e-06
-2.57729e-06
-6.74513e-06
-5.34566e-06
-6.12511e-06
-7.87068e-06
-5.39994e-06
-8.90977e-06
-3.88709e-06
-9.23158e-06
-5.79437e-06
8.69908e-08
-3.50507e-06
-4.17827e-08
-3.72961e-06
-1.63349e-07
-3.5017e-06
-2.35291e-07
-3.23961e-06
-2.31645e-07
-2.62727e-06
-1.51376e-07
-1.71323e-06
-6.19553e-08
-5.16436e-07
2.11282e-08
8.03864e-07
1.44856e-07
2.06737e-06
2.09559e-07
3.00378e-06
1.8156e-07
3.33475e-06
3.87756e-08
2.82512e-06
-3.48283e-07
2.50862e-06
-8.9499e-07
3.04664e-06
-1.36653e-06
3.71895e-06
-1.56326e-06
3.76989e-06
-1.70242e-06
3.35264e-06
-2.1069e-06
3.42232e-06
-2.45297e-06
3.57695e-06
-2.76967e-06
3.07641e-06
-3.14192e-06
2.5827e-06
-3.26113e-06
1.39281e-06
-3.50146e-06
2.27669e-08
-3.4856e-06
-1.79491e-06
-3.40989e-06
-3.6211e-06
-3.23481e-06
-5.35302e-06
-3.07524e-06
-6.96441e-06
-2.89453e-06
-8.31666e-06
-2.63416e-06
-8.95934e-06
-2.20346e-06
-8.22877e-06
-1.71802e-06
-5.57589e-06
-1.51915e-06
-3.1355e-06
-1.40851e-06
-1.65435e-06
-1.42338e-06
-1.65547e-07
-1.51927e-06
8.33448e-07
-1.92175e-06
1.85176e-06
-2.50925e-06
2.58249e-06
-3.21292e-06
3.07458e-06
-3.90606e-06
3.14311e-06
-4.45441e-06
2.70737e-06
-4.78885e-06
1.8384e-06
-4.98131e-06
8.87782e-07
-5.04062e-06
1.41741e-07
-5.06422e-06
-5.87135e-08
-4.99879e-06
2.73845e-07
-4.85057e-06
1.12279e-06
-4.71342e-06
2.28781e-06
-4.57295e-06
3.63455e-06
-4.47856e-06
5.28305e-06
-4.36043e-06
6.96493e-06
-4.23703e-06
8.39857e-06
-4.29752e-06
9.19033e-06
-4.89263e-06
8.92691e-06
-5.98173e-06
8.31284e-06
-6.8767e-06
7.48207e-06
-7.06254e-06
5.32852e-06
-7.19629e-06
2.63615e-06
-7.56831e-06
9.29147e-07
-7.9236e-06
-1.11719e-06
-8.65563e-06
-2.83849e-06
-9.37309e-06
-4.47393e-06
-1.00316e-05
-6.12037e-06
-1.04092e-05
-7.46567e-06
-1.05397e-05
-8.56937e-06
-1.0494e-05
-9.14866e-06
-1.03937e-05
-9.18082e-06
-1.01129e-05
-8.7507e-06
-9.7298e-06
-7.87706e-06
-9.14035e-06
-6.71976e-06
-8.27041e-06
-5.40481e-06
-7.12868e-06
-4.00025e-06
-5.62546e-06
-2.76688e-06
-3.80976e-06
-1.73635e-06
-1.87013e-06
-1.57067e-06
-6.22562e-08
-1.92077e-06
1.33695e-06
-2.38812e-06
2.0289e-06
-2.54357e-06
1.93148e-06
-2.05995e-06
1.23748e-06
-8.99403e-07
1.8031e-07
1.00444e-06
-1.04802e-06
3.42205e-06
-2.81885e-06
5.58915e-06
-5.04663e-06
7.11678e-06
-6.97558e-06
7.83477e-06
-8.3073e-06
7.88524e-06
-9.25418e-06
7.80999e-06
-9.616e-06
7.75794e-06
-9.48359e-06
7.4776e-06
-9.04463e-06
7.13324e-06
-8.37376e-06
6.56202e-06
-7.66218e-06
5.98595e-06
-6.94637e-06
5.36005e-06
-6.28198e-06
4.83863e-06
-5.6165e-06
4.22131e-06
-5.0007e-06
3.72791e-06
-4.41442e-06
3.28792e-06
-3.87437e-06
2.8739e-06
-3.35318e-06
2.50945e-06
-2.86194e-06
2.18185e-06
-2.40775e-06
1.88001e-06
-1.98243e-06
1.5981e-06
-1.58582e-06
1.3359e-06
-1.21463e-06
1.10369e-06
-8.85128e-07
8.76876e-07
-5.73762e-07
6.71609e-07
-2.95204e-07
4.93534e-07
-4.1256e-08
3.66025e-07
2.28558e-07
2.04309e-07
4.97381e-07
6.11524e-08
7.53607e-07
-5.08482e-08
1.01715e-06
-1.73721e-07
1.28103e-06
-3.0801e-07
1.54512e-06
-5.12858e-07
1.86025e-06
-8.08514e-07
2.14832e-06
-1.11432e-06
2.47633e-06
-1.61581e-06
2.84607e-06
-2.17408e-06
3.26984e-06
-2.92421e-06
3.75694e-06
-3.69425e-06
4.12906e-06
-4.47084e-06
4.68281e-06
-5.75573e-06
5.54743e-06
-6.90102e-06
6.3519e-06
-7.79191e-06
6.9136e-06
-8.65513e-06
7.74466e-06
-1.00922e-05
8.74206e-06
-1.08751e-05
9.57331e-06
-1.1169e-05
1.05832e-05
-1.17732e-05
1.15717e-05
-1.18493e-05
1.23632e-05
-1.16622e-05
1.32138e-05
-1.10623e-05
1.382e-05
-1.00961e-05
1.41856e-05
-9.84733e-06
1.45176e-05
-8.91738e-06
1.47945e-05
-6.66509e-06
1.50874e-05
-5.18967e-06
1.55568e-05
-5.33678e-06
1.5979e-05
-5.36845e-06
1.61301e-05
-4.57011e-06
1.58978e-05
-3.45862e-06
1.52451e-05
-2.39653e-06
1.43741e-05
-1.70617e-06
1.40094e-05
-1.73441e-06
1.39935e-05
-1.78554e-06
1.41745e-05
-1.54221e-06
1.4753e-05
-1.36423e-06
1.57057e-05
-1.69382e-06
1.65437e-05
-2.05361e-06
1.71187e-05
-2.15634e-06
1.77912e-05
-2.64642e-06
1.85242e-05
-3.04405e-06
1.91538e-05
-3.1241e-06
1.98159e-05
-3.28653e-06
2.07227e-05
-3.3073e-06
2.14654e-05
-2.70169e-06
2.2108e-05
-1.95376e-06
2.27052e-05
-1.20181e-06
2.33785e-05
1.48127e-07
2.35836e-05
1.47058e-06
2.37297e-05
2.34696e-06
2.39057e-05
3.87917e-06
2.35367e-05
5.09052e-06
2.29143e-05
5.6023e-06
2.26832e-05
6.18421e-06
2.26834e-05
7.0566e-06
2.18794e-05
8.26182e-06
2.03769e-05
8.65555e-06
1.81297e-05
7.98414e-06
1.58087e-05
6.22049e-06
1.39151e-05
4.38697e-06
1.23639e-05
2.63187e-06
1.11824e-05
4.28346e-07
1.01673e-05
-9.19113e-07
9.32661e-06
-1.64248e-07
8.64614e-06
1.4025e-06
7.92871e-06
1.87673e-06
6.90011e-06
1.34547e-06
5.35387e-06
1.16574e-06
3.49877e-06
1.45157e-06
1.81818e-06
1.28542e-06
3.37003e-07
1.363e-06
-7.62404e-07
2.35877e-06
-1.73604e-06
4.79269e-06
-2.60765e-06
8.21545e-06
-3.04684e-06
1.11335e-05
-3.59246e-06
1.33187e-05
-4.13284e-06
1.45399e-05
-4.52764e-06
1.43139e-05
-5.19879e-06
1.31758e-05
-5.97409e-06
1.21918e-05
-6.39442e-06
1.08869e-05
-6.26975e-06
7.06635e-06
-5.86619e-06
3.08242e-06
-5.32881e-06
1.14644e-07
-5.01858e-06
-2.88752e-06
-4.41821e-06
-5.94604e-06
-3.87237e-06
-8.41652e-06
-3.50662e-06
-9.27551e-06
-2.66826e-06
-1.00699e-05
-8.46263e-06
-1.54699e-07
-3.35037e-06
-3.99655e-07
-3.48466e-06
-6.41184e-07
-3.26017e-06
-8.46826e-07
-3.03397e-06
-9.89711e-07
-2.48439e-06
-9.87676e-07
-1.71526e-06
-9.25496e-07
-5.78617e-07
-8.41372e-07
7.1974e-07
-6.79702e-07
1.9057e-06
-5.23402e-07
2.84748e-06
-3.49349e-07
3.16069e-06
-3.415e-07
2.81727e-06
-7.24605e-07
2.89173e-06
-1.18906e-06
3.51109e-06
-1.45632e-06
3.9862e-06
-1.5059e-06
3.81948e-06
-1.69311e-06
3.53985e-06
-2.12106e-06
3.85027e-06
-2.39366e-06
3.84956e-06
-2.72267e-06
3.40542e-06
-3.09475e-06
2.95479e-06
-3.31042e-06
1.60847e-06
-3.54213e-06
2.54478e-07
-3.53454e-06
-1.8025e-06
-3.5742e-06
-3.58144e-06
-3.55643e-06
-5.3708e-06
-3.61359e-06
-6.90726e-06
-3.66327e-06
-8.26698e-06
-3.53519e-06
-9.08743e-06
-3.26149e-06
-8.50246e-06
-2.74282e-06
-6.09456e-06
-2.51597e-06
-3.36236e-06
-2.50801e-06
-1.66231e-06
-2.66701e-06
-6.55259e-09
-3.06072e-06
1.22716e-06
-3.71436e-06
2.50539e-06
-4.53699e-06
3.40513e-06
-5.45795e-06
3.99553e-06
-6.29696e-06
3.98212e-06
-6.88979e-06
3.3002e-06
-7.32493e-06
2.27354e-06
-7.60623e-06
1.16909e-06
-7.82638e-06
3.61893e-07
-7.83786e-06
-4.7232e-08
-7.66251e-06
9.84912e-08
-7.36095e-06
8.2123e-07
-7.02041e-06
1.94728e-06
-6.63065e-06
3.24479e-06
-6.21663e-06
4.86902e-06
-5.91805e-06
6.66635e-06
-5.61686e-06
8.09739e-06
-5.51212e-06
9.08559e-06
-5.81467e-06
9.22946e-06
-6.21236e-06
8.71053e-06
-6.08452e-06
7.35423e-06
-5.54454e-06
4.78854e-06
-5.3305e-06
2.42212e-06
-5.34653e-06
9.45173e-07
-5.63944e-06
-8.24287e-07
-6.27249e-06
-2.20544e-06
-7.08471e-06
-3.66171e-06
-8.16682e-06
-5.03826e-06
-9.13946e-06
-6.49303e-06
-9.90656e-06
-7.80227e-06
-1.04542e-05
-8.60102e-06
-1.07767e-05
-8.85829e-06
-1.09566e-05
-8.57079e-06
-1.08855e-05
-7.94816e-06
-1.06136e-05
-6.99171e-06
-1.00325e-05
-5.98593e-06
-9.17107e-06
-4.86166e-06
-8.13652e-06
-3.80142e-06
-6.90279e-06
-2.97008e-06
-5.69594e-06
-2.77752e-06
-4.7895e-06
-2.8272e-06
-4.23859e-06
-2.93903e-06
-3.97009e-06
-2.81207e-06
-4.02737e-06
-2.00267e-06
-4.5312e-06
-3.95572e-07
-5.44138e-06
1.91461e-06
-6.41214e-06
4.39281e-06
-7.3614e-06
6.53841e-06
-8.03382e-06
7.7892e-06
-8.39043e-06
8.19139e-06
-8.5672e-06
8.06201e-06
-8.59493e-06
7.83771e-06
-8.25844e-06
7.42146e-06
-7.75552e-06
6.97468e-06
-7.0883e-06
6.46603e-06
-6.31347e-06
5.78719e-06
-5.57034e-06
5.24282e-06
-4.85631e-06
4.64602e-06
-4.12957e-06
4.11188e-06
-3.47229e-06
3.56403e-06
-2.83745e-06
3.09308e-06
-2.19266e-06
2.64313e-06
-1.60836e-06
2.2896e-06
-1.07482e-06
1.97592e-06
-5.34161e-07
1.64119e-06
-3.00098e-08
1.37586e-06
4.41146e-07
1.12694e-06
8.77989e-07
8.99057e-07
1.29829e-06
6.83392e-07
1.69964e-06
4.75518e-07
2.07323e-06
2.9802e-07
2.413e-06
1.53769e-07
2.75805e-06
2.09709e-08
3.07369e-06
-1.11333e-07
3.40056e-06
-2.65718e-07
3.70891e-06
-3.59196e-07
4.02642e-06
-4.91224e-07
4.39035e-06
-6.7194e-07
4.72889e-06
-8.51399e-07
5.10862e-06
-1.18824e-06
5.47665e-06
-1.48235e-06
5.75913e-06
-1.89829e-06
6.07373e-06
-2.48868e-06
6.44696e-06
-3.29744e-06
7.0386e-06
-4.2859e-06
7.49659e-06
-4.92883e-06
7.7343e-06
-5.99344e-06
8.30267e-06
-7.46939e-06
9.30172e-06
-8.79095e-06
1.00652e-05
-9.4186e-06
1.07263e-05
-1.07533e-05
1.17284e-05
-1.18771e-05
1.24772e-05
-1.19178e-05
1.31333e-05
-1.24293e-05
1.39174e-05
-1.26334e-05
1.44242e-05
-1.2169e-05
1.49067e-05
-1.15448e-05
1.52782e-05
-1.04675e-05
1.53644e-05
-9.93349e-06
1.53871e-05
-8.94016e-06
1.54595e-05
-6.73749e-06
1.56546e-05
-5.38471e-06
1.5905e-05
-5.58719e-06
1.59734e-05
-5.43692e-06
1.54607e-05
-4.05737e-06
1.46109e-05
-2.60886e-06
1.3888e-05
-1.67361e-06
1.35196e-05
-1.33778e-06
1.34595e-05
-1.67432e-06
1.38915e-05
-2.21749e-06
1.45042e-05
-2.15488e-06
1.52216e-05
-2.08165e-06
1.59509e-05
-2.42317e-06
1.65361e-05
-2.63872e-06
1.69875e-05
-2.60782e-06
1.74312e-05
-3.09012e-06
1.82985e-05
-3.91131e-06
1.92798e-05
-4.10541e-06
2.04587e-05
-4.46544e-06
2.13104e-05
-4.15899e-06
2.24066e-05
-3.79786e-06
2.32034e-05
-2.75061e-06
2.35933e-05
-1.59168e-06
2.40781e-05
-3.36708e-07
2.43585e-05
1.19023e-06
2.42414e-05
2.4641e-06
2.43933e-05
3.72726e-06
2.42037e-05
5.28009e-06
2.34998e-05
6.30615e-06
2.29762e-05
6.70784e-06
2.27179e-05
7.31489e-06
2.25072e-05
8.47257e-06
2.15762e-05
9.58649e-06
1.99546e-05
9.60576e-06
1.75444e-05
8.63067e-06
1.52014e-05
6.72999e-06
1.30526e-05
4.78068e-06
1.12374e-05
2.24355e-06
1.01965e-05
1.21762e-07
9.42667e-06
6.05606e-07
8.64066e-06
2.1885e-06
7.70737e-06
2.81003e-06
6.24136e-06
2.81148e-06
4.5119e-06
2.89519e-06
2.98212e-06
2.98135e-06
1.55573e-06
2.71181e-06
2.95172e-07
2.62356e-06
-1.00132e-06
3.65526e-06
-2.30489e-06
6.09627e-06
-2.87079e-06
8.78135e-06
-3.11258e-06
1.13753e-05
-3.33824e-06
1.35443e-05
-3.53962e-06
1.47412e-05
-3.90593e-06
1.46802e-05
-4.26233e-06
1.35322e-05
-4.48851e-06
1.24179e-05
-4.40324e-06
1.08016e-05
-4.36136e-06
7.02446e-06
-4.09951e-06
2.82056e-06
-3.58721e-06
-3.97652e-07
-3.24793e-06
-3.22681e-06
-2.86847e-06
-6.32549e-06
-2.39809e-06
-8.8869e-06
-1.88721e-06
-9.78639e-06
-1.35767e-06
-1.05995e-05
-9.8203e-06
-2.55112e-07
-3.09526e-06
-6.15246e-07
-3.12452e-06
-9.50252e-07
-2.92517e-06
-1.25385e-06
-2.73037e-06
-1.51441e-06
-2.22382e-06
-1.63703e-06
-1.59265e-06
-1.61802e-06
-5.97626e-07
-1.50743e-06
6.09152e-07
-1.29475e-06
1.69303e-06
-1.00314e-06
2.55587e-06
-6.49681e-07
2.80723e-06
-5.89188e-07
2.75677e-06
-8.47154e-07
3.14969e-06
-1.13515e-06
3.79909e-06
-1.28463e-06
4.13568e-06
-1.39047e-06
3.92532e-06
-1.67837e-06
3.82775e-06
-2.04289e-06
4.21479e-06
-2.27071e-06
4.07738e-06
-2.6381e-06
3.77281e-06
-3.03521e-06
3.3519e-06
-3.2508e-06
1.82407e-06
-3.42123e-06
4.24908e-07
-3.50526e-06
-1.71848e-06
-3.51474e-06
-3.57195e-06
-3.50556e-06
-5.37998e-06
-3.69261e-06
-6.7202e-06
-3.96976e-06
-7.98983e-06
-4.17951e-06
-8.87768e-06
-4.17833e-06
-8.50364e-06
-3.75142e-06
-6.52146e-06
-3.38926e-06
-3.72452e-06
-3.28697e-06
-1.76461e-06
-3.61449e-06
3.20972e-07
-4.32672e-06
1.93938e-06
-5.27238e-06
3.45105e-06
-6.37638e-06
4.50914e-06
-7.38484e-06
5.00399e-06
-8.09987e-06
4.69715e-06
-8.64974e-06
3.85007e-06
-9.14292e-06
2.76672e-06
-9.59363e-06
1.61979e-06
-9.94783e-06
7.16086e-07
-1.00696e-05
7.45233e-08
-9.97352e-06
2.42683e-09
-9.66608e-06
5.13799e-07
-9.21486e-06
1.49606e-06
-8.68269e-06
2.71262e-06
-8.04336e-06
4.2297e-06
-7.4407e-06
6.06368e-06
-6.91319e-06
7.56989e-06
-6.55429e-06
8.72669e-06
-6.2952e-06
8.97036e-06
-5.78192e-06
8.19725e-06
-4.88415e-06
6.45646e-06
-4.00731e-06
3.91169e-06
-3.61155e-06
2.02637e-06
-3.36383e-06
6.97444e-07
-3.32951e-06
-8.58599e-07
-3.49167e-06
-2.04329e-06
-4.07015e-06
-3.08323e-06
-5.10919e-06
-3.99921e-06
-6.43127e-06
-5.17095e-06
-7.88741e-06
-6.34612e-06
-9.0724e-06
-7.41602e-06
-1.00351e-05
-7.89564e-06
-1.07482e-05
-7.85765e-06
-1.1229e-05
-7.46735e-06
-1.1408e-05
-6.81275e-06
-1.13185e-05
-6.07539e-06
-1.09393e-05
-5.24088e-06
-1.03748e-05
-4.36589e-06
-9.57319e-06
-3.7717e-06
-8.72505e-06
-3.62567e-06
-8.05765e-06
-3.4946e-06
-7.73182e-06
-3.26485e-06
-7.71778e-06
-2.82611e-06
-7.97434e-06
-1.74611e-06
-8.48393e-06
1.14013e-07
-8.90577e-06
2.33646e-06
-9.1653e-06
4.65234e-06
-9.10534e-06
6.47846e-06
-8.71517e-06
7.39903e-06
-8.21728e-06
7.69349e-06
-7.69594e-06
7.54067e-06
-7.13146e-06
7.27324e-06
-6.43238e-06
6.72237e-06
-5.69305e-06
6.23536e-06
-4.88092e-06
5.65389e-06
-4.09977e-06
5.00604e-06
-3.31861e-06
4.46167e-06
-2.60377e-06
3.93118e-06
-1.86824e-06
3.37635e-06
-1.1938e-06
2.88959e-06
-5.08343e-07
2.40762e-06
1.08327e-07
2.02646e-06
6.81452e-07
1.71647e-06
1.25286e-06
1.40451e-06
1.81429e-06
1.07976e-06
2.3291e-06
8.61045e-07
2.81325e-06
6.42794e-07
3.26534e-06
4.46969e-07
3.73881e-06
2.09926e-07
4.19332e-06
2.10047e-08
4.62339e-06
-1.32055e-07
4.99781e-06
-2.2065e-07
5.37921e-06
-3.60427e-07
5.75808e-06
-4.90206e-07
6.12657e-06
-6.34205e-07
6.54619e-06
-7.7881e-07
6.92814e-06
-8.73179e-07
7.32411e-06
-1.06791e-06
7.65419e-06
-1.18147e-06
7.96686e-06
-1.50091e-06
8.45599e-06
-1.97148e-06
8.94466e-06
-2.38695e-06
9.35765e-06
-2.90167e-06
9.63092e-06
-3.57071e-06
1.01242e-05
-4.77922e-06
1.09688e-05
-5.77344e-06
1.1594e-05
-6.61864e-06
1.19315e-05
-7.80683e-06
1.25479e-05
-9.40738e-06
1.33692e-05
-1.02398e-05
1.38696e-05
-1.12537e-05
1.45041e-05
-1.25116e-05
1.51434e-05
-1.25571e-05
1.55006e-05
-1.27865e-05
1.60303e-05
-1.31631e-05
1.6259e-05
-1.23977e-05
1.63013e-05
-1.15871e-05
1.64304e-05
-1.05966e-05
1.62984e-05
-9.80149e-06
1.61121e-05
-8.75389e-06
1.60377e-05
-6.66314e-06
1.60083e-05
-5.35531e-06
1.58953e-05
-5.47417e-06
1.54678e-05
-5.00937e-06
1.46301e-05
-3.21972e-06
1.37439e-05
-1.72263e-06
1.34255e-05
-1.35526e-06
1.36657e-05
-1.57795e-06
1.40496e-05
-2.0582e-06
1.43217e-05
-2.48966e-06
1.47769e-05
-2.61003e-06
1.51751e-05
-2.47987e-06
1.53567e-05
-2.60481e-06
1.54364e-05
-2.71841e-06
1.60307e-05
-3.20209e-06
1.72365e-05
-4.29594e-06
1.86907e-05
-5.36549e-06
2.03588e-05
-5.77348e-06
2.19353e-05
-6.04198e-06
2.34276e-05
-5.65133e-06
2.44825e-05
-4.85271e-06
2.54333e-05
-3.70143e-06
2.58336e-05
-1.99195e-06
2.62138e-05
-7.16919e-07
2.61902e-05
1.21378e-06
2.58039e-05
2.85044e-06
2.53861e-05
4.14504e-06
2.50649e-05
5.60126e-06
2.43086e-05
7.06247e-06
2.33721e-05
7.64434e-06
2.28052e-05
7.88179e-06
2.26289e-05
8.64891e-06
2.22301e-05
9.98528e-06
2.0863e-05
1.09729e-05
1.91809e-05
1.03128e-05
1.70538e-05
8.85704e-06
1.47773e-05
7.0572e-06
1.22626e-05
4.75826e-06
1.0081e-05
2.30334e-06
8.73832e-06
1.94831e-06
7.63688e-06
3.28994e-06
6.67654e-06
3.77037e-06
5.75414e-06
3.73387e-06
4.32773e-06
4.3216e-06
2.85656e-06
4.45252e-06
1.50728e-06
4.06109e-06
4.95918e-07
3.63492e-06
-7.43384e-07
4.89456e-06
-1.64958e-06
7.00247e-06
-1.97679e-06
9.10856e-06
-2.46595e-06
1.18645e-05
-2.90273e-06
1.39811e-05
-2.92907e-06
1.47676e-05
-2.85224e-06
1.46033e-05
-2.85543e-06
1.35354e-05
-2.86708e-06
1.24296e-05
-2.54019e-06
1.04747e-05
-2.34007e-06
6.82434e-06
-2.17291e-06
2.65341e-06
-1.72438e-06
-8.46178e-07
-1.08759e-06
-3.8636e-06
-6.37584e-07
-6.7755e-06
-4.77604e-07
-9.04688e-06
-7.03005e-07
-9.56099e-06
-8.25135e-07
-1.04774e-05
-1.06454e-05
-3.68925e-07
-2.72633e-06
-7.37185e-07
-2.75627e-06
-1.05197e-06
-2.61039e-06
-1.36443e-06
-2.41791e-06
-1.67814e-06
-1.91011e-06
-1.91454e-06
-1.35626e-06
-1.94662e-06
-5.65539e-07
-1.78656e-06
4.49087e-07
-1.53049e-06
1.43696e-06
-1.12336e-06
2.14874e-06
-7.60787e-07
2.44466e-06
-7.43149e-07
2.73914e-06
-9.49854e-07
3.3564e-06
-1.14725e-06
3.99648e-06
-1.21466e-06
4.20309e-06
-1.27923e-06
3.98989e-06
-1.53739e-06
4.08591e-06
-1.85577e-06
4.53316e-06
-2.09755e-06
4.31916e-06
-2.45174e-06
4.127e-06
-2.7243e-06
3.62446e-06
-2.90545e-06
2.00522e-06
-3.05138e-06
5.70832e-07
-3.16754e-06
-1.60232e-06
-3.1116e-06
-3.62788e-06
-3.10476e-06
-5.38683e-06
-3.33394e-06
-6.49101e-06
-3.85779e-06
-7.46599e-06
-4.4878e-06
-8.24767e-06
-4.85907e-06
-8.13237e-06
-4.79864e-06
-6.58189e-06
-4.64628e-06
-3.87688e-06
-4.8372e-06
-1.57368e-06
-5.26288e-06
7.46656e-07
-6.01617e-06
2.69267e-06
-6.92671e-06
4.36159e-06
-7.82004e-06
5.40246e-06
-8.41449e-06
5.59844e-06
-8.86191e-06
5.14457e-06
-9.29778e-06
4.28594e-06
-9.78656e-06
3.25551e-06
-1.02992e-05
2.1324e-06
-1.0764e-05
1.18088e-06
-1.11173e-05
4.27838e-07
-1.12642e-05
1.49301e-07
-1.1119e-05
3.68596e-07
-1.07018e-05
1.07894e-06
-1.00994e-05
2.11024e-06
-9.36441e-06
3.49467e-06
-8.48847e-06
5.18774e-06
-7.61254e-06
6.69396e-06
-6.75768e-06
7.87183e-06
-5.79481e-06
8.00749e-06
-4.66939e-06
7.07183e-06
-3.44705e-06
5.23412e-06
-2.5625e-06
3.02714e-06
-2.0453e-06
1.50917e-06
-1.67228e-06
3.24422e-07
-1.53724e-06
-9.93639e-07
-1.55262e-06
-2.02791e-06
-1.82849e-06
-2.80736e-06
-2.34499e-06
-3.48271e-06
-3.27512e-06
-4.24083e-06
-4.62108e-06
-5.00016e-06
-6.13279e-06
-5.90432e-06
-7.51227e-06
-6.51616e-06
-8.62198e-06
-6.74794e-06
-9.48329e-06
-6.60604e-06
-1.00267e-05
-6.26936e-06
-1.03561e-05
-5.74598e-06
-1.04278e-05
-5.16917e-06
-1.03366e-05
-4.45705e-06
-9.98564e-06
-4.12269e-06
-9.63307e-06
-3.97824e-06
-9.40618e-06
-3.72149e-06
-9.33525e-06
-3.33579e-06
-9.42786e-06
-2.7335e-06
-9.65307e-06
-1.52089e-06
-9.80666e-06
2.67598e-07
-9.77651e-06
2.30631e-06
-9.41838e-06
4.29421e-06
-8.69201e-06
5.75208e-06
-7.80481e-06
6.51183e-06
-6.88672e-06
6.7754e-06
-5.99699e-06
6.65095e-06
-5.12838e-06
6.40462e-06
-4.24737e-06
5.84136e-06
-3.38251e-06
5.37049e-06
-2.49548e-06
4.76686e-06
-1.69677e-06
4.20733e-06
-9.3596e-07
3.70086e-06
-1.68434e-07
3.16366e-06
5.63857e-07
2.64406e-06
1.23009e-06
2.22336e-06
1.86057e-06
1.77713e-06
2.45115e-06
1.43589e-06
3.07045e-06
1.09717e-06
3.65761e-06
8.17346e-07
4.18435e-06
5.53021e-07
4.66221e-06
3.83186e-07
5.15977e-06
1.45231e-07
5.6822e-06
-7.54604e-08
6.18617e-06
-2.94036e-07
6.63583e-06
-4.28658e-07
7.06059e-06
-5.56819e-07
7.49104e-06
-6.51093e-07
7.91688e-06
-7.86274e-07
8.41703e-06
-9.90352e-07
8.84605e-06
-1.06323e-06
9.22526e-06
-1.15802e-06
9.61449e-06
-1.26241e-06
1.00828e-05
-1.53626e-06
1.06532e-05
-1.75185e-06
1.1023e-05
-1.87072e-06
1.1366e-05
-2.31444e-06
1.18929e-05
-2.91387e-06
1.25502e-05
-3.559e-06
1.30489e-05
-4.06934e-06
1.32914e-05
-5.02174e-06
1.37195e-05
-6.2016e-06
1.44035e-05
-7.30261e-06
1.50928e-05
-8.49613e-06
1.56413e-05
-9.95589e-06
1.63265e-05
-1.09251e-05
1.69365e-05
-1.18637e-05
1.73732e-05
-1.29483e-05
1.7845e-05
-1.30289e-05
1.79677e-05
-1.29092e-05
1.81037e-05
-1.32992e-05
1.80975e-05
-1.23914e-05
1.77535e-05
-1.12432e-05
1.75713e-05
-1.04143e-05
1.71842e-05
-9.41437e-06
1.6637e-05
-8.20676e-06
1.62916e-05
-6.31774e-06
1.59875e-05
-5.05112e-06
1.56602e-05
-5.14688e-06
1.49827e-05
-4.33193e-06
1.40405e-05
-2.27752e-06
1.34608e-05
-1.14291e-06
1.357e-05
-1.46447e-06
1.39867e-05
-1.99464e-06
1.42759e-05
-2.34742e-06
1.43051e-05
-2.51883e-06
1.40086e-05
-2.31357e-06
1.38784e-05
-2.34958e-06
1.41048e-05
-2.83124e-06
1.48366e-05
-3.45016e-06
1.61003e-05
-4.46586e-06
1.80314e-05
-6.22696e-06
2.01327e-05
-7.46688e-06
2.21133e-05
-7.75402e-06
2.38302e-05
-7.75891e-06
2.55636e-05
-7.38476e-06
2.66899e-05
-5.97898e-06
2.7749e-05
-4.76051e-06
2.84167e-05
-2.65963e-06
2.85923e-05
-8.92561e-07
2.87953e-05
1.01074e-06
2.82665e-05
3.37932e-06
2.75455e-05
4.86596e-06
2.67658e-05
6.38102e-06
2.58786e-05
7.94963e-06
2.44295e-05
9.09352e-06
2.32161e-05
9.09518e-06
2.25559e-05
9.30908e-06
2.23213e-05
1.02199e-05
2.16707e-05
1.16235e-05
1.98838e-05
1.20997e-05
1.77437e-05
1.09971e-05
1.54903e-05
9.31058e-06
1.39923e-05
6.25625e-06
1.27378e-05
3.55783e-06
1.1599e-05
3.08715e-06
1.05879e-05
4.30105e-06
8.79446e-06
5.56379e-06
6.89146e-06
5.63687e-06
5.1559e-06
6.05716e-06
3.40741e-06
6.20101e-06
2.05244e-06
5.41606e-06
8.27685e-07
4.85968e-06
-1.11061e-07
5.83331e-06
-6.37739e-07
7.52914e-06
-1.37053e-06
9.84135e-06
-1.53826e-06
1.20322e-05
-1.2401e-06
1.36829e-05
-1.36115e-06
1.48886e-05
-1.57214e-06
1.48143e-05
-1.40934e-06
1.33726e-05
-8.94157e-07
1.19144e-05
-5.14167e-07
1.00947e-05
-2.74037e-07
6.58421e-06
8.74731e-08
2.2919e-06
3.16609e-07
-1.07531e-06
7.1489e-07
-4.26188e-06
9.46304e-07
-7.00691e-06
7.25026e-07
-8.8256e-06
9.62491e-08
-8.93221e-06
-1.30945e-07
-1.02502e-05
-1.07764e-05
-3.68383e-07
-2.35795e-06
-7.73746e-07
-2.3509e-06
-1.10228e-06
-2.28186e-06
-1.36846e-06
-2.15173e-06
-1.64635e-06
-1.63221e-06
-1.91953e-06
-1.08308e-06
-2.00488e-06
-4.80185e-07
-1.77171e-06
2.15918e-07
-1.43421e-06
1.09946e-06
-1.10634e-06
1.82086e-06
-8.68159e-07
2.20649e-06
-8.61913e-07
2.73289e-06
-9.63229e-07
3.45771e-06
-1.00817e-06
4.04142e-06
-1.04787e-06
4.24279e-06
-1.15943e-06
4.10145e-06
-1.35324e-06
4.27973e-06
-1.55677e-06
4.73669e-06
-1.72896e-06
4.49135e-06
-1.91444e-06
4.31247e-06
-2.05406e-06
3.76408e-06
-2.27585e-06
2.22702e-06
-2.47646e-06
7.71446e-07
-2.638e-06
-1.44079e-06
-2.67623e-06
-3.58965e-06
-2.70914e-06
-5.35391e-06
-2.83975e-06
-6.36041e-06
-3.39715e-06
-6.90858e-06
-4.30894e-06
-7.33588e-06
-5.03388e-06
-7.40744e-06
-5.35891e-06
-6.25686e-06
-5.47331e-06
-3.76248e-06
-5.95065e-06
-1.09634e-06
-6.49313e-06
1.28913e-06
-7.21695e-06
3.4165e-06
-7.73799e-06
4.88264e-06
-8.0608e-06
5.72527e-06
-8.22593e-06
5.76356e-06
-8.40758e-06
5.32623e-06
-8.74706e-06
4.62542e-06
-9.18027e-06
3.68872e-06
-9.69782e-06
2.64996e-06
-1.02031e-05
1.68615e-06
-1.06846e-05
9.09328e-07
-1.10347e-05
4.99377e-07
-1.11065e-05
4.40435e-07
-1.08442e-05
8.16592e-07
-1.02897e-05
1.55577e-06
-9.52176e-06
2.72675e-06
-8.49732e-06
4.16329e-06
-7.3206e-06
5.51724e-06
-5.96251e-06
6.51373e-06
-4.48928e-06
6.53426e-06
-3.07686e-06
5.65941e-06
-1.8457e-06
4.00296e-06
-1.08381e-06
2.26524e-06
-5.771e-07
1.00246e-06
-2.01533e-07
-5.11447e-08
-1.02489e-07
-1.09268e-06
-2.28095e-07
-1.9023e-06
-4.84377e-07
-2.55108e-06
-7.92281e-07
-3.1748e-06
-1.28197e-06
-3.75114e-06
-2.05126e-06
-4.23087e-06
-3.26962e-06
-4.68597e-06
-4.67009e-06
-5.11569e-06
-5.95505e-06
-5.46298e-06
-6.95193e-06
-5.60916e-06
-7.74182e-06
-5.47947e-06
-8.28112e-06
-5.20668e-06
-8.66967e-06
-4.78062e-06
-8.7919e-06
-4.33482e-06
-8.75525e-06
-4.15934e-06
-8.77548e-06
-3.958e-06
-8.83575e-06
-3.66123e-06
-8.94511e-06
-3.22642e-06
-9.10541e-06
-2.5732e-06
-9.20344e-06
-1.42287e-06
-9.10896e-06
1.73119e-07
-8.72061e-06
1.91796e-06
-7.98649e-06
3.56009e-06
-6.9708e-06
4.73639e-06
-5.87871e-06
5.41974e-06
-4.8069e-06
5.70359e-06
-3.7698e-06
5.61384e-06
-2.73128e-06
5.3661e-06
-1.74341e-06
4.8535e-06
-8.57753e-07
4.48483e-06
8.24627e-09
3.90086e-06
8.30967e-07
3.38461e-06
1.62505e-06
2.90677e-06
2.37262e-06
2.41609e-06
3.04368e-06
1.973e-06
3.65496e-06
1.61208e-06
4.27837e-06
1.15372e-06
4.89023e-06
8.24033e-07
5.46613e-06
5.21266e-07
5.98672e-06
2.9675e-07
6.49347e-06
4.62777e-08
7.02995e-06
-1.53298e-07
7.56406e-06
-3.88884e-07
8.07004e-06
-5.81436e-07
8.54669e-06
-7.7069e-07
9.00878e-06
-8.90742e-07
9.48524e-06
-1.03328e-06
1.00485e-05
-1.21435e-06
1.04969e-05
-1.23463e-06
1.09028e-05
-1.39633e-06
1.14296e-05
-1.58995e-06
1.19525e-05
-1.68097e-06
1.24231e-05
-1.73304e-06
1.2802e-05
-1.91513e-06
1.33549e-05
-2.30478e-06
1.3994e-05
-2.50982e-06
1.4467e-05
-2.78743e-06
1.48058e-05
-3.2526e-06
1.52893e-05
-4.04258e-06
1.60539e-05
-4.83388e-06
1.67633e-05
-5.73118e-06
1.74024e-05
-6.84067e-06
1.79652e-05
-7.86542e-06
1.85225e-05
-9.05341e-06
1.90043e-05
-1.04377e-05
1.94229e-05
-1.13436e-05
1.98148e-05
-1.22556e-05
1.99308e-05
-1.30643e-05
2.00694e-05
-1.31675e-05
2.00314e-05
-1.28712e-05
1.97943e-05
-1.30621e-05
1.94717e-05
-1.20688e-05
1.87814e-05
-1.05529e-05
1.83404e-05
-9.97331e-06
1.77577e-05
-8.83171e-06
1.68889e-05
-7.33787e-06
1.63533e-05
-5.78219e-06
1.59885e-05
-4.68628e-06
1.53743e-05
-4.53274e-06
1.4631e-05
-3.58864e-06
1.37168e-05
-1.36332e-06
1.33572e-05
-7.83236e-07
1.36917e-05
-1.799e-06
1.40904e-05
-2.39335e-06
1.38786e-05
-2.13564e-06
1.33821e-05
-2.02233e-06
1.31341e-05
-2.06556e-06
1.3073e-05
-2.28849e-06
1.37261e-05
-3.48429e-06
1.51067e-05
-4.83077e-06
1.72697e-05
-6.62891e-06
1.94445e-05
-8.40172e-06
2.16415e-05
-9.66387e-06
2.36065e-05
-9.71905e-06
2.53069e-05
-9.45925e-06
2.68097e-05
-8.88757e-06
2.80872e-05
-7.25648e-06
2.89302e-05
-5.60353e-06
2.99574e-05
-3.6868e-06
3.02241e-05
-1.15927e-06
3.03678e-05
8.67012e-07
3.02915e-05
3.45557e-06
2.94564e-05
5.70113e-06
2.87003e-05
7.13709e-06
2.76934e-05
8.9565e-06
2.64552e-05
1.03318e-05
2.44116e-05
1.11388e-05
2.31293e-05
1.05914e-05
2.2379e-05
1.09702e-05
2.17233e-05
1.22791e-05
2.08824e-05
1.29406e-05
1.90554e-05
1.28242e-05
1.6434e-05
1.1932e-05
1.3427e-05
9.26322e-06
1.09087e-05
6.07619e-06
9.46794e-06
4.52787e-06
8.48431e-06
5.28468e-06
7.78866e-06
6.25944e-06
6.48449e-06
6.94105e-06
5.00309e-06
7.53855e-06
3.86816e-06
7.33594e-06
2.43999e-06
6.84423e-06
1.1762e-06
6.12347e-06
7.14155e-07
6.29536e-06
4.92598e-07
7.7507e-06
2.31867e-07
1.01021e-05
1.27616e-07
1.21364e-05
1.01806e-07
1.37087e-05
1.56902e-07
1.48335e-05
3.11633e-07
1.46596e-05
4.58262e-07
1.3226e-05
8.27414e-07
1.15453e-05
1.35323e-06
9.5689e-06
1.81429e-06
6.12314e-06
2.12222e-06
1.98397e-06
2.27869e-06
-1.23179e-06
2.28086e-06
-4.26405e-06
1.78705e-06
-6.51311e-06
9.37054e-07
-7.9756e-06
2.4241e-07
-8.23757e-06
7.67357e-08
-1.00845e-05
-1.06996e-05
-4.40596e-07
-1.91735e-06
-8.66211e-07
-1.92529e-06
-1.22593e-06
-1.92214e-06
-1.49611e-06
-1.88155e-06
-1.68346e-06
-1.44486e-06
-1.89611e-06
-8.70436e-07
-2.0396e-06
-3.36694e-07
-1.88344e-06
5.97544e-08
-1.4865e-06
7.02523e-07
-1.13887e-06
1.47324e-06
-9.7058e-07
2.0382e-06
-9.32508e-07
2.69482e-06
-9.05486e-07
3.43069e-06
-8.53026e-07
3.98896e-06
-7.22492e-07
4.11226e-06
-6.631e-07
4.04205e-06
-6.98955e-07
4.31559e-06
-7.42311e-07
4.78004e-06
-8.16589e-07
4.56563e-06
-9.39138e-07
4.43502e-06
-1.10277e-06
3.92771e-06
-1.40545e-06
2.52969e-06
-1.61232e-06
9.78315e-07
-1.84638e-06
-1.20673e-06
-2.00072e-06
-3.43532e-06
-2.07848e-06
-5.27615e-06
-2.13433e-06
-6.30456e-06
-2.55307e-06
-6.48984e-06
-3.58443e-06
-6.30451e-06
-4.69581e-06
-6.29606e-06
-5.40015e-06
-5.55252e-06
-5.79316e-06
-3.36948e-06
-6.23442e-06
-6.55074e-07
-6.57045e-06
1.62515e-06
-6.94543e-06
3.79148e-06
-7.1505e-06
5.08771e-06
-7.19995e-06
5.77472e-06
-7.15136e-06
5.71498e-06
-7.28294e-06
5.4578e-06
-7.55355e-06
4.89603e-06
-7.88911e-06
4.02428e-06
-8.32642e-06
3.08727e-06
-8.81517e-06
2.1749e-06
-9.31126e-06
1.40542e-06
-9.69653e-06
8.84644e-07
-9.84688e-06
5.90781e-07
-9.66042e-06
6.30134e-07
-9.14737e-06
1.04271e-06
-8.31406e-06
1.89344e-06
-7.1446e-06
2.99384e-06
-5.74894e-06
4.12158e-06
-4.13757e-06
4.90236e-06
-2.49415e-06
4.89084e-06
-1.05369e-06
4.21896e-06
6.16022e-08
2.88767e-06
7.90253e-07
1.53659e-06
1.28627e-06
5.0645e-07
1.6279e-06
-3.92775e-07
1.74877e-06
-1.21356e-06
1.70832e-06
-1.86186e-06
1.48925e-06
-2.33201e-06
1.06569e-06
-2.75124e-06
5.00939e-07
-3.18639e-06
-8.3851e-08
-3.64608e-06
-8.01199e-07
-3.96862e-06
-1.86098e-06
-4.05591e-06
-3.09428e-06
-4.22968e-06
-4.19622e-06
-4.50721e-06
-5.07491e-06
-4.60078e-06
-5.74686e-06
-4.53474e-06
-6.21563e-06
-4.31185e-06
-6.46416e-06
-4.0863e-06
-6.64723e-06
-3.97627e-06
-6.83608e-06
-3.76914e-06
-7.00521e-06
-3.4921e-06
-7.18815e-06
-3.04348e-06
-7.35952e-06
-2.40182e-06
-7.34878e-06
-1.43361e-06
-7.07289e-06
-1.02776e-07
-6.52395e-06
1.36902e-06
-5.63063e-06
2.66677e-06
-4.50874e-06
3.61451e-06
-3.39057e-06
4.30157e-06
-2.26432e-06
4.57733e-06
-1.13943e-06
4.48896e-06
-8.59285e-08
4.31261e-06
8.58887e-07
3.90868e-06
1.77629e-06
3.56743e-06
2.64436e-06
3.03279e-06
3.45842e-06
2.57055e-06
4.19949e-06
2.1657e-06
4.85996e-06
1.75562e-06
5.48732e-06
1.34565e-06
6.13864e-06
9.60753e-07
6.71257e-06
5.79788e-07
7.23453e-06
3.02079e-07
7.7438e-06
1.19941e-08
8.2851e-06
-2.44552e-07
8.84901e-06
-5.17631e-07
9.40676e-06
-7.11047e-07
9.89403e-06
-8.76159e-07
1.03771e-05
-1.0645e-06
1.09079e-05
-1.3015e-06
1.147e-05
-1.45281e-06
1.19426e-05
-1.50585e-06
1.24887e-05
-1.76046e-06
1.30944e-05
-1.84035e-06
1.35744e-05
-1.87637e-06
1.39952e-05
-2.01071e-06
1.45068e-05
-2.19262e-06
1.51892e-05
-2.41541e-06
1.57653e-05
-2.49126e-06
1.61665e-05
-2.70593e-06
1.66367e-05
-2.98009e-06
1.73975e-05
-3.54814e-06
1.81673e-05
-4.02243e-06
1.8731e-05
-4.60634e-06
1.93464e-05
-5.44928e-06
1.98892e-05
-6.27391e-06
2.04024e-05
-7.35391e-06
2.10198e-05
-8.48284e-06
2.15741e-05
-9.60767e-06
2.20122e-05
-1.08758e-05
2.22442e-05
-1.15756e-05
2.24917e-05
-1.25031e-05
2.24792e-05
-1.30517e-05
2.22236e-05
-1.29119e-05
2.19498e-05
-1.25974e-05
2.13316e-05
-1.2444e-05
2.06993e-05
-1.14365e-05
1.98361e-05
-9.68967e-06
1.89597e-05
-9.09694e-06
1.81715e-05
-8.04351e-06
1.69608e-05
-6.1272e-06
1.62354e-05
-5.05679e-06
1.57926e-05
-4.24347e-06
1.50389e-05
-3.77902e-06
1.40831e-05
-2.63292e-06
1.36718e-05
-9.51954e-07
1.34835e-05
-5.94925e-07
1.35308e-05
-1.84629e-06
1.37128e-05
-2.57542e-06
1.35607e-05
-1.98354e-06
1.30863e-05
-1.54791e-06
1.26669e-05
-1.6462e-06
1.2965e-05
-2.58655e-06
1.40445e-05
-4.56378e-06
1.61321e-05
-6.91839e-06
1.83907e-05
-8.88755e-06
2.06475e-05
-1.06585e-05
2.25431e-05
-1.15594e-05
2.44987e-05
-1.16747e-05
2.58628e-05
-1.08233e-05
2.719e-05
-1.02148e-05
2.84947e-05
-8.56115e-06
2.94119e-05
-6.52079e-06
3.03359e-05
-4.61076e-06
3.10917e-05
-1.91501e-06
3.11904e-05
7.68252e-07
3.13595e-05
3.28644e-06
3.09287e-05
6.13197e-06
2.99026e-05
8.1632e-06
2.91607e-05
9.69845e-06
2.80222e-05
1.14703e-05
2.62588e-05
1.29021e-05
2.4194e-05
1.26561e-05
2.29992e-05
1.21651e-05
2.21016e-05
1.31766e-05
2.10463e-05
1.3996e-05
1.96796e-05
1.41908e-05
1.77853e-05
1.38263e-05
1.54983e-05
1.15501e-05
1.30091e-05
8.56545e-06
1.07895e-05
6.74744e-06
9.07367e-06
7.00053e-06
7.798e-06
7.53511e-06
6.5764e-06
8.16265e-06
5.31547e-06
8.79948e-06
3.76162e-06
8.88979e-06
2.31852e-06
8.28733e-06
1.13046e-06
7.31153e-06
3.89289e-07
7.03653e-06
6.51121e-07
7.48887e-06
1.44481e-06
9.30839e-06
1.82912e-06
1.17521e-05
1.86651e-06
1.36713e-05
1.84186e-06
1.48582e-05
2.09978e-06
1.44017e-05
2.29568e-06
1.30301e-05
2.6316e-06
1.12093e-05
3.41319e-06
8.78731e-06
4.05858e-06
5.47776e-06
4.25325e-06
1.7893e-06
4.18566e-06
-1.16419e-06
3.66073e-06
-3.73912e-06
2.64896e-06
-5.50134e-06
1.54309e-06
-6.86972e-06
9.15968e-07
-7.61045e-06
4.67617e-07
-9.63614e-06
-1.0232e-05
-4.48416e-07
-1.46894e-06
-9.00766e-07
-1.47294e-06
-1.31765e-06
-1.50525e-06
-1.70679e-06
-1.49241e-06
-1.92969e-06
-1.22196e-06
-2.05403e-06
-7.46103e-07
-2.13311e-06
-2.57613e-07
-2.07364e-06
2.90622e-10
-1.77962e-06
4.08496e-07
-1.40439e-06
1.09801e-06
-1.08538e-06
1.71918e-06
-9.12931e-07
2.52237e-06
-6.51157e-07
3.16892e-06
-4.64593e-07
3.8024e-06
-3.50279e-07
3.99794e-06
-2.56327e-07
3.9481e-06
-1.8996e-07
4.24922e-06
-1.58048e-07
4.74813e-06
-9.40762e-08
4.50166e-06
-3.55992e-08
4.37654e-06
6.44188e-09
3.88567e-06
-1.09096e-07
2.64523e-06
-2.45183e-07
1.1144e-06
-4.05822e-07
-1.04609e-06
-5.63841e-07
-3.2773e-06
-7.88699e-07
-5.05129e-06
-1.14307e-06
-5.95019e-06
-1.58859e-06
-6.04432e-06
-2.45468e-06
-5.43843e-06
-3.71459e-06
-5.03615e-06
-4.70096e-06
-4.56615e-06
-5.24029e-06
-2.83015e-06
-5.61173e-06
-2.83629e-07
-5.8673e-06
1.88072e-06
-5.99875e-06
3.92293e-06
-6.00075e-06
5.08971e-06
-5.83894e-06
5.61292e-06
-5.65979e-06
5.53582e-06
-5.60034e-06
5.39836e-06
-5.6556e-06
4.95128e-06
-5.87297e-06
4.24165e-06
-6.23168e-06
3.44598e-06
-6.68422e-06
2.62743e-06
-7.1747e-06
1.8959e-06
-7.58318e-06
1.29312e-06
-7.78722e-06
7.94819e-07
-7.68506e-06
5.2798e-07
-7.20893e-06
5.66581e-07
-6.34942e-06
1.03393e-06
-5.14565e-06
1.79007e-06
-3.65646e-06
2.63239e-06
-1.97291e-06
3.21881e-06
-3.72519e-07
3.29045e-06
1.04596e-06
2.80048e-06
2.06635e-06
1.86728e-06
2.69532e-06
9.0763e-07
3.11838e-06
8.33821e-08
3.38623e-06
-6.60621e-07
3.47101e-06
-1.29834e-06
3.42501e-06
-1.81585e-06
3.24541e-06
-2.15241e-06
2.99677e-06
-2.5026e-06
2.66616e-06
-2.85578e-06
2.16855e-06
-3.14846e-06
1.56847e-06
-3.36854e-06
9.63721e-07
-3.45117e-06
1.31041e-07
-3.397e-06
-9.75291e-07
-3.40088e-06
-2.03859e-06
-3.53748e-06
-2.90283e-06
-3.67049e-06
-3.46305e-06
-3.75164e-06
-3.83037e-06
-3.71897e-06
-4.13286e-06
-3.67379e-06
-4.36985e-06
-3.53215e-06
-4.54279e-06
-3.31916e-06
-4.64632e-06
-2.93995e-06
-4.75191e-06
-2.29624e-06
-4.68107e-06
-1.50445e-06
-4.29542e-06
-4.88424e-07
-3.61883e-06
6.9243e-07
-2.71221e-06
1.76015e-06
-1.66136e-06
2.56366e-06
-5.32282e-07
3.17249e-06
6.10234e-07
3.43482e-06
1.62903e-06
3.47016e-06
2.66129e-06
3.28035e-06
3.59261e-06
2.97735e-06
4.50779e-06
2.65225e-06
5.30077e-06
2.23982e-06
6.003e-06
1.86833e-06
6.64199e-06
1.52671e-06
7.31665e-06
1.08096e-06
7.92964e-06
7.32655e-07
8.5238e-06
3.66597e-07
9.01952e-06
8.40677e-08
9.52563e-06
-2.04033e-07
1.00735e-05
-5.35864e-07
1.06268e-05
-7.9786e-07
1.1129e-05
-1.01986e-06
1.16899e-05
-1.27197e-06
1.2258e-05
-1.44426e-06
1.27621e-05
-1.56859e-06
1.32665e-05
-1.80586e-06
1.394e-05
-2.12633e-06
1.45398e-05
-2.10566e-06
1.501e-05
-2.23059e-06
1.55229e-05
-2.35326e-06
1.61686e-05
-2.52214e-06
1.68552e-05
-2.69729e-06
1.74071e-05
-2.74449e-06
1.78787e-05
-2.88705e-06
1.85243e-05
-3.13681e-06
1.93165e-05
-3.49821e-06
1.9947e-05
-3.61058e-06
2.05686e-05
-4.16973e-06
2.12219e-05
-4.67574e-06
2.17936e-05
-5.17802e-06
2.25214e-05
-6.17703e-06
2.32807e-05
-7.03322e-06
2.39281e-05
-8.00134e-06
2.44758e-05
-9.03051e-06
2.48404e-05
-9.9723e-06
2.50733e-05
-1.11088e-05
2.51114e-05
-1.16137e-05
2.48413e-05
-1.2233e-05
2.44753e-05
-1.26858e-05
2.38681e-05
-1.23047e-05
2.32401e-05
-1.19693e-05
2.23803e-05
-1.15842e-05
2.13425e-05
-1.03987e-05
2.03141e-05
-8.66132e-06
1.91726e-05
-7.95538e-06
1.81235e-05
-6.99445e-06
1.69858e-05
-4.98942e-06
1.60481e-05
-4.11916e-06
1.56088e-05
-3.80419e-06
1.49206e-05
-3.09073e-06
1.38009e-05
-1.5133e-06
1.32226e-05
-3.7361e-07
1.34455e-05
-8.1787e-07
1.34918e-05
-1.89253e-06
1.35364e-05
-2.62003e-06
1.29319e-05
-1.37902e-06
1.24502e-05
-1.0662e-06
1.21627e-05
-1.35877e-06
1.30375e-05
-3.46134e-06
1.46644e-05
-6.19069e-06
1.69026e-05
-9.15654e-06
1.92219e-05
-1.12068e-05
2.09359e-05
-1.23725e-05
2.25267e-05
-1.31502e-05
2.40627e-05
-1.32107e-05
2.52946e-05
-1.20553e-05
2.64584e-05
-1.13786e-05
2.77193e-05
-9.82205e-06
2.86811e-05
-7.48254e-06
2.96867e-05
-5.61644e-06
3.06695e-05
-2.89773e-06
3.11631e-05
2.7458e-07
3.14004e-05
3.04913e-06
3.15523e-05
5.9801e-06
3.0786e-05
8.92956e-06
2.99288e-05
1.05556e-05
2.90282e-05
1.23709e-05
2.77307e-05
1.41997e-05
2.55796e-05
1.48072e-05
2.36086e-05
1.41361e-05
2.26548e-05
1.41305e-05
2.14522e-05
1.51985e-05
2.01679e-05
1.54751e-05
1.86284e-05
1.53659e-05
1.64718e-05
1.37067e-05
1.46829e-05
1.03543e-05
1.33497e-05
8.08068e-06
1.24242e-05
7.92607e-06
1.15496e-05
8.40962e-06
1.01556e-05
9.55665e-06
8.63826e-06
1.03169e-05
6.52176e-06
1.10063e-05
4.1123e-06
1.06968e-05
2.04617e-06
9.37766e-06
7.20878e-07
8.36182e-06
3.39455e-07
7.87029e-06
1.10277e-06
8.54508e-06
2.18726e-06
1.06676e-05
3.06987e-06
1.27887e-05
4.00019e-06
1.39279e-05
4.38287e-06
1.4019e-05
4.53801e-06
1.2875e-05
5.08574e-06
1.06616e-05
5.93221e-06
7.94083e-06
6.4597e-06
4.95027e-06
6.38398e-06
1.86502e-06
5.70827e-06
-4.88478e-07
4.44043e-06
-2.47128e-06
2.98305e-06
-4.04395e-06
1.67304e-06
-5.55972e-06
1.20243e-06
-7.13984e-06
7.87414e-07
-9.22112e-06
-9.44461e-06
-5.05156e-07
-9.63783e-07
-1.02626e-06
-9.51833e-07
-1.47218e-06
-1.05933e-06
-1.9114e-06
-1.05319e-06
-2.25258e-06
-8.80784e-07
-2.41415e-06
-5.84526e-07
-2.41699e-06
-2.54776e-07
-2.28567e-06
-1.31025e-07
-2.00785e-06
1.30675e-07
-1.61913e-06
7.09284e-07
-1.13429e-06
1.23435e-06
-8.76108e-07
2.26419e-06
-5.3814e-07
2.83095e-06
-1.39315e-07
3.40357e-06
1.84134e-07
3.67449e-06
4.91471e-07
3.64077e-06
8.24229e-07
3.91646e-06
1.04486e-06
4.5275e-06
1.16309e-06
4.38343e-06
1.38889e-06
4.15075e-06
1.64394e-06
3.63062e-06
1.76428e-06
2.52488e-06
1.76179e-06
1.1169e-06
1.60013e-06
-8.84427e-07
1.38821e-06
-3.06538e-06
1.06349e-06
-4.72657e-06
4.61325e-07
-5.34803e-06
-3.29911e-07
-5.25308e-06
-1.08287e-06
-4.68547e-06
-2.24298e-06
-3.87604e-06
-3.43684e-06
-3.37228e-06
-4.02424e-06
-2.24275e-06
-4.19289e-06
-1.14986e-07
-4.30551e-06
1.99335e-06
-4.16473e-06
3.78214e-06
-4.01472e-06
4.9397e-06
-3.73929e-06
5.33748e-06
-3.53805e-06
5.33458e-06
-3.37916e-06
5.23947e-06
-3.33337e-06
4.90549e-06
-3.44717e-06
4.35545e-06
-3.67326e-06
3.67207e-06
-3.98768e-06
2.94186e-06
-4.32688e-06
2.2351e-06
-4.64503e-06
1.61127e-06
-4.84224e-06
9.92028e-07
-4.79768e-06
4.8342e-07
-4.45888e-06
2.27778e-07
-3.80037e-06
3.75427e-07
-2.79707e-06
7.86766e-07
-1.49267e-06
1.32799e-06
-3.12832e-08
1.75742e-06
1.46743e-06
1.79174e-06
2.77313e-06
1.49478e-06
3.72267e-06
9.17736e-07
4.3439e-06
2.86395e-07
4.75202e-06
-3.2473e-07
4.97432e-06
-8.82925e-07
5.04025e-06
-1.36427e-06
4.98304e-06
-1.75864e-06
4.80019e-06
-1.96956e-06
4.52134e-06
-2.22375e-06
4.12276e-06
-2.4572e-06
3.64289e-06
-2.66859e-06
3.12567e-06
-2.85132e-06
2.59143e-06
-2.91693e-06
2.1901e-06
-2.99567e-06
1.75762e-06
-2.9684e-06
1.09129e-06
-2.87115e-06
3.16125e-07
-2.89533e-06
-3.96326e-07
-3.03919e-06
-9.1606e-07
-3.19924e-06
-1.30298e-06
-3.28687e-06
-1.58939e-06
-3.24574e-06
-1.76673e-06
-3.14182e-06
-1.83744e-06
-2.86923e-06
-1.82874e-06
-2.30494e-06
-1.66307e-06
-1.67011e-06
-1.26234e-06
-8.89158e-07
-5.19034e-07
-5.08747e-08
3.8087e-07
8.60245e-07
1.37974e-06
1.56479e-06
2.38153e-06
2.1707e-06
3.40675e-06
2.4096e-06
4.40162e-06
2.47529e-06
5.38406e-06
2.2979e-06
6.30528e-06
2.05614e-06
7.14822e-06
1.80931e-06
7.80535e-06
1.58269e-06
8.42844e-06
1.24524e-06
9.05453e-06
9.00612e-07
9.70089e-06
4.34604e-07
1.02967e-05
1.36853e-07
1.08258e-05
-1.62506e-07
1.13135e-05
-4.03649e-07
1.18194e-05
-7.09884e-07
1.24063e-05
-1.12277e-06
1.30146e-05
-1.40618e-06
1.35245e-05
-1.52975e-06
1.39969e-05
-1.74442e-06
1.46068e-05
-2.05414e-06
1.53233e-05
-2.28505e-06
1.59216e-05
-2.40424e-06
1.64634e-05
-2.66806e-06
1.70366e-05
-2.67892e-06
1.7692e-05
-2.886e-06
1.84286e-05
-3.08986e-06
1.89588e-05
-3.0523e-06
1.95666e-05
-3.30509e-06
2.0368e-05
-3.54591e-06
2.11219e-05
-3.64094e-06
2.17176e-05
-3.73251e-06
2.23694e-05
-4.15002e-06
2.30544e-05
-4.29558e-06
2.38774e-05
-4.99272e-06
2.46633e-05
-5.46162e-06
2.54446e-05
-5.95937e-06
2.60964e-05
-6.82877e-06
2.66161e-05
-7.55292e-06
2.71281e-05
-8.51341e-06
2.74755e-05
-9.37793e-06
2.75543e-05
-1.00511e-05
2.74996e-05
-1.10541e-05
2.73785e-05
-1.14925e-05
2.68364e-05
-1.16908e-05
2.61726e-05
-1.20219e-05
2.53294e-05
-1.14615e-05
2.43036e-05
-1.09436e-05
2.31852e-05
-1.04658e-05
2.18537e-05
-9.0672e-06
2.07163e-05
-7.52391e-06
1.94508e-05
-6.68996e-06
1.79858e-05
-5.52941e-06
1.68266e-05
-3.83022e-06
1.59923e-05
-3.28482e-06
1.52832e-05
-3.09514e-06
1.44738e-05
-2.2813e-06
1.35263e-05
-5.65789e-07
1.3156e-05
-3.37006e-09
1.33036e-05
-9.65465e-07
1.33694e-05
-1.95832e-06
1.29045e-05
-2.15508e-06
1.20653e-05
-5.39855e-07
1.15971e-05
-5.97962e-07
1.20528e-05
-1.81448e-06
1.34391e-05
-4.84766e-06
1.53523e-05
-8.10389e-06
1.71027e-05
-1.09069e-05
1.88579e-05
-1.29621e-05
2.02061e-05
-1.37207e-05
2.17246e-05
-1.46688e-05
2.31827e-05
-1.46688e-05
2.45279e-05
-1.34005e-05
2.54969e-05
-1.23476e-05
2.67164e-05
-1.10415e-05
2.75212e-05
-8.28734e-06
2.84351e-05
-6.53033e-06
2.94452e-05
-3.90782e-06
3.01071e-05
-3.87335e-07
3.05886e-05
2.56763e-06
3.09549e-05
5.61384e-06
3.08555e-05
9.02889e-06
3.0118e-05
1.1293e-05
2.94839e-05
1.30051e-05
2.84246e-05
1.52589e-05
2.67491e-05
1.64827e-05
2.46634e-05
1.62218e-05
2.29754e-05
1.58184e-05
2.18955e-05
1.62785e-05
2.06341e-05
1.67364e-05
1.89617e-05
1.70383e-05
1.65418e-05
1.61267e-05
1.3993e-05
1.29031e-05
1.21682e-05
9.90547e-06
1.06309e-05
9.4633e-06
9.29987e-06
9.74067e-06
8.18694e-06
1.06696e-05
7.35207e-06
1.11517e-05
6.63505e-06
1.17233e-05
5.44401e-06
1.18878e-05
3.78682e-06
1.10348e-05
2.42405e-06
9.72459e-06
1.34284e-06
8.9515e-06
1.09467e-06
8.79325e-06
1.96726e-06
9.79505e-06
3.26378e-06
1.14922e-05
4.90665e-06
1.2285e-05
6.00053e-06
1.29251e-05
6.54897e-06
1.23265e-05
7.2813e-06
9.92927e-06
7.80685e-06
7.41528e-06
7.80793e-06
4.94919e-06
7.06267e-06
2.61028e-06
5.87758e-06
6.96608e-07
4.43611e-06
-1.02981e-06
2.89256e-06
-2.5004e-06
1.65454e-06
-4.3217e-06
1.02127e-06
-6.50657e-06
4.36077e-07
-8.63593e-06
-9.00853e-06
-5.05161e-07
-4.58622e-07
-1.04113e-06
-4.15864e-07
-1.52591e-06
-5.74548e-07
-1.98917e-06
-5.89932e-07
-2.39951e-06
-4.70447e-07
-2.69074e-06
-2.93292e-07
-2.76591e-06
-1.79601e-07
-2.63975e-06
-2.57187e-07
-2.30642e-06
-2.02656e-07
-1.88682e-06
2.89687e-07
-1.24091e-06
5.88439e-07
-6.33455e-07
1.65673e-06
-1.51443e-07
2.34894e-06
2.71224e-07
2.98091e-06
5.68778e-07
3.37694e-06
9.48285e-07
3.26126e-06
1.52827e-06
3.33647e-06
2.18017e-06
3.8756e-06
2.65171e-06
3.91189e-06
3.05132e-06
3.75114e-06
3.38302e-06
3.29892e-06
3.58568e-06
2.32222e-06
3.67372e-06
1.02886e-06
3.55684e-06
-7.67554e-07
3.19921e-06
-2.70775e-06
2.64486e-06
-4.17221e-06
2.0225e-06
-4.72567e-06
1.08661e-06
-4.31719e-06
1.16784e-07
-3.71565e-06
-7.37838e-07
-3.02142e-06
-1.84007e-06
-2.27004e-06
-2.51819e-06
-1.56463e-06
-2.47087e-06
-1.62308e-07
-2.36947e-06
1.89195e-06
-2.17555e-06
3.58822e-06
-1.79966e-06
4.56381e-06
-1.31674e-06
4.85457e-06
-8.54451e-07
4.87229e-06
-4.48464e-07
4.83348e-06
-2.95513e-07
4.75254e-06
-2.9737e-07
4.35731e-06
-4.47887e-07
3.82259e-06
-6.57153e-07
3.15112e-06
-8.9161e-07
2.46956e-06
-1.13104e-06
1.8507e-06
-1.27908e-06
1.14007e-06
-1.2516e-06
4.55942e-07
-1.00392e-06
-1.99041e-08
-4.98251e-07
-1.30245e-07
2.66597e-07
2.19185e-08
1.26262e-06
3.31968e-07
2.39585e-06
6.24191e-07
3.52037e-06
6.67218e-07
4.53225e-06
4.82901e-07
5.33061e-06
1.19377e-07
5.89809e-06
-2.81094e-07
6.2782e-06
-7.04837e-07
6.48581e-06
-1.09053e-06
6.54278e-06
-1.42125e-06
6.47806e-06
-1.69391e-06
6.35662e-06
-1.84813e-06
6.1529e-06
-2.02003e-06
5.84304e-06
-2.14734e-06
5.40324e-06
-2.22879e-06
4.87355e-06
-2.32163e-06
4.33034e-06
-2.37371e-06
3.76422e-06
-2.42956e-06
3.3424e-06
-2.54658e-06
3.16221e-06
-2.69095e-06
2.96688e-06
-2.7e-06
2.68573e-06
-2.75804e-06
2.31841e-06
-2.83192e-06
1.96564e-06
-2.9341e-06
1.6426e-06
-2.9227e-06
1.4422e-06
-2.94143e-06
1.35354e-06
-2.78057e-06
1.35999e-06
-2.31139e-06
1.55283e-06
-1.86295e-06
1.94862e-06
-1.28495e-06
2.64166e-06
-7.4391e-07
3.48054e-06
2.13619e-08
4.32888e-06
7.16444e-07
5.22018e-06
1.2794e-06
6.15333e-06
1.47645e-06
7.17515e-06
1.45346e-06
8.1703e-06
1.30276e-06
8.97932e-06
1.24712e-06
9.6305e-06
1.15813e-06
1.02301e-05
9.83092e-07
1.08568e-05
6.18504e-07
1.15912e-05
1.66292e-07
1.21686e-05
-1.42815e-07
1.26412e-05
-3.35725e-07
1.31084e-05
-6.2977e-07
1.3742e-05
-1.0372e-06
1.43773e-05
-1.34518e-06
1.4929e-05
-1.67454e-06
1.54058e-05
-1.88294e-06
1.59825e-05
-2.10645e-06
1.66365e-05
-2.39838e-06
1.73296e-05
-2.74723e-06
1.79599e-05
-2.9154e-06
1.8589e-05
-3.03336e-06
1.92776e-05
-3.35667e-06
1.99955e-05
-3.39675e-06
2.05679e-05
-3.45844e-06
2.13908e-05
-3.9128e-06
2.22549e-05
-3.91634e-06
2.29557e-05
-4.00594e-06
2.35937e-05
-4.18391e-06
2.42825e-05
-4.32973e-06
2.51331e-05
-4.58308e-06
2.59661e-05
-4.98303e-06
2.67685e-05
-5.098e-06
2.75235e-05
-5.74768e-06
2.81492e-05
-6.08737e-06
2.87883e-05
-6.59847e-06
2.93932e-05
-7.4336e-06
2.97489e-05
-7.90863e-06
3.01087e-05
-8.87325e-06
3.03662e-05
-9.63545e-06
3.0206e-05
-9.89088e-06
2.98285e-05
-1.06765e-05
2.93732e-05
-1.10372e-05
2.84268e-05
-1.07445e-05
2.72039e-05
-1.0799e-05
2.60674e-05
-1.03251e-05
2.46468e-05
-9.52292e-06
2.3242e-05
-9.06094e-06
2.18154e-05
-7.64067e-06
2.05157e-05
-6.22422e-06
1.90686e-05
-5.24282e-06
1.77161e-05
-4.17686e-06
1.66267e-05
-2.74089e-06
1.59322e-05
-2.59028e-06
1.49649e-05
-2.12785e-06
1.40814e-05
-1.39777e-06
1.33938e-05
1.21725e-07
1.32825e-05
1.07958e-07
1.3111e-05
-7.93925e-07
1.29259e-05
-1.77325e-06
1.23349e-05
-1.56403e-06
1.15295e-05
2.65459e-07
1.17288e-05
-7.97232e-07
1.23757e-05
-2.4614e-06
1.38756e-05
-6.34752e-06
1.5021e-05
-9.24935e-06
1.66335e-05
-1.25194e-05
1.82067e-05
-1.45353e-05
1.97738e-05
-1.52877e-05
2.13515e-05
-1.62465e-05
2.28179e-05
-1.61351e-05
2.40009e-05
-1.45835e-05
2.48602e-05
-1.32069e-05
2.57892e-05
-1.19705e-05
2.65197e-05
-9.01792e-06
2.72072e-05
-7.21776e-06
2.81905e-05
-4.89111e-06
2.87434e-05
-9.403e-07
2.92614e-05
2.04967e-06
2.97282e-05
5.147e-06
2.99525e-05
8.80464e-06
2.95554e-05
1.16901e-05
2.91816e-05
1.33789e-05
2.85966e-05
1.58439e-05
2.71737e-05
1.79056e-05
2.53398e-05
1.80557e-05
2.36127e-05
1.75454e-05
2.22733e-05
1.76179e-05
2.08548e-05
1.8155e-05
1.94833e-05
1.84098e-05
1.79779e-05
1.76321e-05
1.59396e-05
1.49414e-05
1.41837e-05
1.16613e-05
1.29881e-05
1.06589e-05
1.14214e-05
1.13074e-05
1.00899e-05
1.20011e-05
9.09327e-06
1.21483e-05
8.35509e-06
1.24615e-05
7.72774e-06
1.25152e-05
6.50791e-06
1.22547e-05
5.00328e-06
1.12292e-05
3.64417e-06
1.03106e-05
2.72119e-06
9.71622e-06
2.66838e-06
9.84786e-06
3.53437e-06
1.06262e-05
4.75464e-06
1.10647e-05
6.09036e-06
1.15894e-05
7.33646e-06
1.10804e-05
7.99304e-06
9.27269e-06
8.18918e-06
7.21914e-06
7.73962e-06
5.39876e-06
6.9645e-06
3.38539e-06
5.88618e-06
1.77493e-06
5.10348e-06
-2.47105e-07
4.31159e-06
-1.70851e-06
3.37195e-06
-3.38207e-06
1.83822e-06
-4.97283e-06
4.72647e-07
-7.27036e-06
-8.53589e-06
-3.94801e-07
-6.38207e-08
-1.07161e-06
2.60942e-07
-1.69227e-06
4.61104e-08
-2.11254e-06
-1.69658e-07
-2.39991e-06
-1.83079e-07
-2.60309e-06
-9.01055e-08
-2.73656e-06
-4.61301e-08
-2.81348e-06
-1.80275e-07
-2.68951e-06
-3.26625e-07
-2.3243e-06
-7.55174e-08
-1.688e-06
-4.78635e-08
-7.49451e-07
7.18181e-07
1.63298e-07
1.43619e-06
9.99171e-07
2.14503e-06
1.55173e-06
2.82437e-06
1.86957e-06
2.94342e-06
2.25977e-06
2.94627e-06
2.89196e-06
3.24341e-06
3.51824e-06
3.28561e-06
4.14176e-06
3.12763e-06
4.68827e-06
2.75241e-06
5.11115e-06
1.89934e-06
5.37707e-06
7.62941e-07
5.37431e-06
-7.64796e-07
5.1303e-06
-2.46373e-06
4.45305e-06
-3.49496e-06
3.48494e-06
-3.75756e-06
2.53303e-06
-3.36528e-06
1.50054e-06
-2.68315e-06
6.23974e-07
-2.14485e-06
-1.29145e-07
-1.51692e-06
-8.23992e-07
-8.69785e-07
-8.52167e-07
-1.34133e-07
-3.06134e-07
1.34592e-06
2.26505e-07
3.05558e-06
6.31922e-07
4.15839e-06
1.05207e-06
4.43442e-06
1.50161e-06
4.42275e-06
1.98533e-06
4.34976e-06
2.46881e-06
4.26906e-06
2.7714e-06
4.05472e-06
2.90182e-06
3.69217e-06
2.88959e-06
3.16335e-06
2.79829e-06
2.56087e-06
2.7142e-06
1.93479e-06
2.64467e-06
1.2096e-06
2.63136e-06
4.6925e-07
2.76313e-06
-1.51669e-07
3.08912e-06
-4.56239e-07
3.6228e-06
-5.11765e-07
4.3625e-06
-4.07725e-07
5.20526e-06
-2.18569e-07
6.03279e-06
-1.60313e-07
6.75674e-06
-2.41047e-07
7.29519e-06
-4.19081e-07
7.69736e-06
-6.83262e-07
7.93676e-06
-9.4423e-07
7.98796e-06
-1.14174e-06
7.90953e-06
-1.34281e-06
7.72295e-06
-1.50733e-06
7.48301e-06
-1.6082e-06
7.16427e-06
-1.70129e-06
6.8279e-06
-1.81097e-06
6.45626e-06
-1.85714e-06
6.07601e-06
-1.94138e-06
5.75019e-06
-2.04789e-06
5.43419e-06
-2.11356e-06
5.10063e-06
-2.21303e-06
4.85552e-06
-2.44584e-06
4.74937e-06
-2.59385e-06
4.79462e-06
-2.80328e-06
4.98243e-06
-3.01973e-06
5.10452e-06
-3.05619e-06
5.126e-06
-2.94418e-06
5.06641e-06
-2.88184e-06
5.06438e-06
-2.77854e-06
5.08608e-06
-2.33309e-06
5.16685e-06
-1.94373e-06
5.47082e-06
-1.58892e-06
5.96386e-06
-1.23695e-06
6.56263e-06
-5.77412e-07
7.2162e-06
6.28782e-08
8.03989e-06
4.55713e-07
8.98025e-06
5.36089e-07
9.91277e-06
5.20941e-07
1.06913e-05
5.24202e-07
1.13345e-05
6.039e-07
1.19621e-05
5.30574e-07
1.27628e-05
1.82382e-07
1.34276e-05
-4.62583e-08
1.39773e-05
-3.83438e-07
1.44605e-05
-6.2602e-07
1.50771e-05
-9.52318e-07
1.57088e-05
-1.26143e-06
1.63715e-05
-1.69992e-06
1.69191e-05
-1.89283e-06
1.74959e-05
-2.25131e-06
1.81247e-05
-2.5117e-06
1.89252e-05
-2.90699e-06
1.95628e-05
-3.03598e-06
2.02576e-05
-3.44206e-06
2.10528e-05
-3.71052e-06
2.1759e-05
-3.73957e-06
2.2396e-05
-3.9937e-06
2.33197e-05
-4.32049e-06
2.42344e-05
-4.37308e-06
2.49388e-05
-4.61725e-06
2.56204e-05
-4.59785e-06
2.6462e-05
-4.84758e-06
2.72979e-05
-5.01977e-06
2.81246e-05
-5.15651e-06
2.89725e-05
-5.43097e-06
2.96604e-05
-5.67087e-06
3.03503e-05
-5.7879e-06
3.10011e-05
-6.39847e-06
3.15577e-05
-6.64403e-06
3.20512e-05
-7.09191e-06
3.25616e-05
-7.94404e-06
3.27575e-05
-8.10456e-06
3.27026e-05
-8.81833e-06
3.2539e-05
-9.47182e-06
3.20664e-05
-9.41824e-06
3.12891e-05
-9.89928e-06
3.03513e-05
-1.00994e-05
2.91461e-05
-9.53931e-06
2.78101e-05
-9.46299e-06
2.64258e-05
-8.94081e-06
2.48207e-05
-7.91787e-06
2.3314e-05
-7.55426e-06
2.1852e-05
-6.17862e-06
2.0355e-05
-4.72719e-06
1.89501e-05
-3.83792e-06
1.77487e-05
-2.97549e-06
1.66128e-05
-1.60495e-06
1.56478e-05
-1.62537e-06
1.48265e-05
-1.30651e-06
1.40441e-05
-6.15371e-07
1.34709e-05
6.94908e-07
1.30301e-05
5.48745e-07
1.3183e-05
-9.46749e-07
1.2861e-05
-1.45125e-06
1.20401e-05
-7.432e-07
1.13279e-05
9.77637e-07
1.19578e-05
-1.42705e-06
1.24788e-05
-2.98243e-06
1.35568e-05
-7.42556e-06
1.45013e-05
-1.01938e-05
1.62294e-05
-1.42475e-05
1.79919e-05
-1.62978e-05
1.94105e-05
-1.67063e-05
2.09645e-05
-1.78005e-05
2.20602e-05
-1.72309e-05
2.29173e-05
-1.54406e-05
2.36419e-05
-1.39314e-05
2.41716e-05
-1.25003e-05
2.50342e-05
-9.8805e-06
2.57053e-05
-7.88881e-06
2.66722e-05
-5.85807e-06
2.72909e-05
-1.559e-06
2.76598e-05
1.68077e-06
2.81992e-05
4.60765e-06
2.85432e-05
8.46062e-06
2.85265e-05
1.17068e-05
2.81992e-05
1.37062e-05
2.80293e-05
1.60138e-05
2.72216e-05
1.87133e-05
2.55277e-05
1.97496e-05
2.37473e-05
1.93258e-05
2.23495e-05
1.90158e-05
2.10223e-05
1.94821e-05
1.9498e-05
1.99342e-05
1.76781e-05
1.9452e-05
1.58667e-05
1.67528e-05
1.39936e-05
1.35344e-05
1.32505e-05
1.14019e-05
1.27461e-05
1.18118e-05
1.17811e-05
1.29661e-05
1.09305e-05
1.29989e-05
9.98331e-06
1.34087e-05
8.81664e-06
1.36819e-05
7.82206e-06
1.32493e-05
6.6348e-06
1.24165e-05
5.52376e-06
1.14217e-05
4.43325e-06
1.08067e-05
3.86174e-06
1.04194e-05
4.13028e-06
1.03577e-05
4.83943e-06
1.03556e-05
5.96717e-06
1.04617e-05
6.98289e-06
1.00647e-05
7.7247e-06
8.53088e-06
7.87254e-06
7.0713e-06
7.8844e-06
5.3869e-06
7.71461e-06
3.55519e-06
7.14549e-06
2.34405e-06
6.55158e-06
3.46807e-07
5.5996e-06
-7.56529e-07
4.94104e-06
-2.72351e-06
3.17463e-06
-3.20642e-06
1.17527e-06
-5.271e-06
-7.36061e-06
-4.93407e-07
4.29587e-07
-9.26779e-07
6.94314e-07
-1.4511e-06
5.70431e-07
-1.91874e-06
2.97984e-07
-2.21581e-06
1.13987e-07
-2.35713e-06
5.12144e-08
-2.40522e-06
1.96669e-09
-2.48147e-06
-1.04026e-07
-2.54899e-06
-2.59113e-07
-2.36438e-06
-2.60124e-07
-2.02852e-06
-3.83727e-07
-1.25886e-06
-5.14752e-08
-2.01978e-07
3.79308e-07
9.70143e-07
9.72911e-07
2.14812e-06
1.6464e-06
3.01172e-06
2.07982e-06
3.66079e-06
2.2972e-06
4.36693e-06
2.53727e-06
5.06004e-06
2.5925e-06
5.70181e-06
2.48586e-06
6.31666e-06
2.13755e-06
6.81536e-06
1.40064e-06
7.07787e-06
5.00434e-07
7.01231e-06
-6.99241e-07
6.51242e-06
-1.96384e-06
5.73315e-06
-2.7157e-06
4.65075e-06
-2.67515e-06
3.47263e-06
-2.18716e-06
2.46685e-06
-1.67737e-06
1.6505e-06
-1.32851e-06
1.19971e-06
-1.06613e-06
9.00841e-07
-5.70919e-07
7.75151e-07
-8.44314e-09
1.23329e-06
8.87774e-07
2.2014e-06
2.08747e-06
3.13951e-06
3.22028e-06
3.82885e-06
3.74508e-06
4.31777e-06
3.93383e-06
4.73886e-06
3.92867e-06
5.18063e-06
3.82729e-06
5.56966e-06
3.66569e-06
5.87574e-06
3.38609e-06
6.10039e-06
2.9387e-06
6.27322e-06
2.38804e-06
6.41592e-06
1.79209e-06
6.52652e-06
1.099e-06
6.60897e-06
3.86799e-07
6.72465e-06
-2.67347e-07
6.92595e-06
-6.57546e-07
7.23195e-06
-8.17761e-07
7.67451e-06
-8.50282e-07
8.15098e-06
-6.95037e-07
8.61046e-06
-6.19795e-07
9.00937e-06
-6.39959e-07
9.24991e-06
-6.59625e-07
9.38008e-06
-8.13424e-07
9.40394e-06
-9.68092e-07
9.28414e-06
-1.02194e-06
9.11413e-06
-1.1728e-06
8.91195e-06
-1.30514e-06
8.65499e-06
-1.35125e-06
8.39444e-06
-1.44073e-06
8.13307e-06
-1.5496e-06
7.83595e-06
-1.56003e-06
7.59013e-06
-1.69556e-06
7.40735e-06
-1.8651e-06
7.28943e-06
-1.99564e-06
7.3054e-06
-2.229e-06
7.4378e-06
-2.57824e-06
7.59561e-06
-2.75166e-06
7.66363e-06
-2.87131e-06
7.78095e-06
-3.13705e-06
7.96143e-06
-3.23667e-06
8.15987e-06
-3.14262e-06
8.44361e-06
-3.16558e-06
8.74567e-06
-3.08059e-06
9.03193e-06
-2.61936e-06
9.36102e-06
-2.27281e-06
9.70409e-06
-1.93199e-06
1.00268e-05
-1.55969e-06
1.04562e-05
-1.00678e-06
1.10098e-05
-4.90742e-07
1.17209e-05
-2.55311e-07
1.24387e-05
-1.81778e-07
1.2997e-05
-3.73343e-08
1.35646e-05
-4.34501e-08
1.42694e-05
-1.00893e-07
1.49694e-05
-1.69416e-07
1.56168e-05
-4.65026e-07
1.62269e-05
-6.56356e-07
1.67977e-05
-9.54178e-07
1.74036e-05
-1.23191e-06
1.81137e-05
-1.66248e-06
1.87457e-05
-1.89338e-06
1.93179e-05
-2.27211e-06
2.00596e-05
-2.63454e-06
2.08214e-05
-3.01318e-06
2.14503e-05
-3.14058e-06
2.23036e-05
-3.76023e-06
2.3197e-05
-3.9294e-06
2.37964e-05
-4.04154e-06
2.45528e-05
-4.46687e-06
2.55161e-05
-4.70283e-06
2.64034e-05
-4.88103e-06
2.71189e-05
-5.03604e-06
2.79265e-05
-5.18066e-06
2.87156e-05
-5.40632e-06
2.95536e-05
-5.43592e-06
3.04039e-05
-5.69788e-06
3.11698e-05
-5.78565e-06
3.18512e-05
-5.83788e-06
3.24927e-05
-6.07245e-06
3.3165e-05
-6.34317e-06
3.36597e-05
-6.28261e-06
3.42119e-05
-6.95074e-06
3.4627e-05
-7.05904e-06
3.48499e-05
-7.31483e-06
3.48662e-05
-7.9604e-06
3.48136e-05
-8.05195e-06
3.44067e-05
-8.41143e-06
3.38643e-05
-8.92937e-06
3.31745e-05
-8.72849e-06
3.21976e-05
-8.92238e-06
3.0979e-05
-8.88072e-06
2.96072e-05
-8.1675e-06
2.79914e-05
-7.84726e-06
2.61365e-05
-7.08591e-06
2.44215e-05
-6.20282e-06
2.28061e-05
-5.93884e-06
2.12766e-05
-4.64916e-06
1.98332e-05
-3.28375e-06
1.86984e-05
-2.70319e-06
1.76262e-05
-1.90327e-06
1.66562e-05
-6.34994e-07
1.56823e-05
-6.51453e-07
1.49597e-05
-5.83925e-07
1.41743e-05
1.70053e-07
1.36083e-05
1.26093e-06
1.31678e-05
9.89255e-07
1.32647e-05
-1.04369e-06
1.29008e-05
-1.08729e-06
1.1554e-05
6.03581e-07
1.16193e-05
9.12321e-07
1.21683e-05
-1.97606e-06
1.23593e-05
-3.17337e-06
1.29452e-05
-8.0115e-06
1.44052e-05
-1.16538e-05
1.60489e-05
-1.58912e-05
1.7576e-05
-1.78249e-05
1.83279e-05
-1.74582e-05
1.96479e-05
-1.91205e-05
2.03845e-05
-1.79675e-05
2.09957e-05
-1.60518e-05
2.15665e-05
-1.45023e-05
2.2088e-05
-1.30217e-05
2.3095e-05
-1.08875e-05
2.40651e-05
-8.85885e-06
2.49638e-05
-6.75678e-06
2.5911e-05
-2.5062e-06
2.61545e-05
1.43725e-06
2.64584e-05
4.30375e-06
2.68335e-05
8.0855e-06
2.7055e-05
1.14854e-05
2.69449e-05
1.38163e-05
2.69264e-05
1.60323e-05
2.66094e-05
1.90303e-05
2.54894e-05
2.08696e-05
2.39227e-05
2.08925e-05
2.24152e-05
2.05233e-05
2.14141e-05
2.04832e-05
2.00993e-05
2.1249e-05
1.80462e-05
2.15052e-05
1.56905e-05
1.91085e-05
1.29752e-05
1.62497e-05
1.13581e-05
1.3019e-05
1.08948e-05
1.22752e-05
1.03012e-05
1.35597e-05
9.62183e-06
1.36783e-05
9.19695e-06
1.38336e-05
8.64516e-06
1.42336e-05
8.13992e-06
1.37545e-05
7.7604e-06
1.2796e-05
7.12426e-06
1.20578e-05
6.40979e-06
1.15212e-05
6.0444e-06
1.07848e-05
6.21901e-06
1.01831e-05
6.25182e-06
1.03228e-05
7.14752e-06
9.56595e-06
8.15737e-06
9.05486e-06
8.64329e-06
8.04496e-06
9.16654e-06
6.54805e-06
8.55175e-06
6.00169e-06
8.73103e-06
3.37591e-06
7.90193e-06
3.17315e-06
7.7334e-06
5.15339e-07
6.54993e-06
4.26944e-07
6.15799e-06
-2.33157e-06
5.00148e-06
-2.04992e-06
2.99668e-06
-3.2662e-06
-4.36393e-06
-4.92768e-07
9.22354e-07
-5.38251e-07
7.39798e-07
-5.94511e-07
6.2669e-07
-7.61515e-07
4.64988e-07
-9.64646e-07
3.17118e-07
-1.12178e-06
2.08351e-07
-1.19299e-06
7.31706e-08
-1.23871e-06
-5.83051e-08
-1.30115e-06
-1.96673e-07
-1.28292e-06
-2.78349e-07
-1.23884e-06
-4.27805e-07
-9.6613e-07
-3.24189e-07
-3.68853e-07
-2.1797e-07
5.18658e-07
8.53999e-08
1.72961e-06
4.35453e-07
2.93303e-06
8.76391e-07
4.00584e-06
1.2244e-06
5.08122e-06
1.46188e-06
6.06092e-06
1.61281e-06
6.89011e-06
1.65667e-06
7.57534e-06
1.45233e-06
8.02869e-06
9.47295e-07
8.20622e-06
3.22903e-07
8.02191e-06
-5.14934e-07
7.30259e-06
-1.24452e-06
6.12014e-06
-1.53324e-06
4.9233e-06
-1.47831e-06
3.99228e-06
-1.25614e-06
3.35392e-06
-1.03901e-06
2.89742e-06
-8.72007e-07
2.54003e-06
-7.0874e-07
2.46076e-06
-4.91648e-07
2.55787e-06
-1.05555e-07
2.95362e-06
4.92018e-07
3.7984e-06
1.2427e-06
4.94873e-06
2.06995e-06
6.01512e-06
2.67869e-06
6.90751e-06
3.04145e-06
7.64263e-06
3.19355e-06
8.23666e-06
3.23326e-06
8.74023e-06
3.16212e-06
9.18261e-06
2.94372e-06
9.52145e-06
2.59985e-06
9.8085e-06
2.10098e-06
1.00797e-05
1.52086e-06
1.02557e-05
9.22994e-07
1.03795e-05
2.63072e-07
1.04407e-05
-3.2857e-07
1.0473e-05
-6.89833e-07
1.05445e-05
-8.89283e-07
1.06386e-05
-9.44384e-07
1.07869e-05
-8.43319e-07
1.08834e-05
-7.16319e-07
1.09616e-05
-7.18173e-07
1.10093e-05
-7.07314e-07
1.0913e-05
-7.17104e-07
1.08362e-05
-8.91337e-07
1.0715e-05
-9.0071e-07
1.05169e-05
-9.74693e-07
1.03925e-05
-1.18072e-06
1.02281e-05
-1.18688e-06
1.0076e-05
-1.2886e-06
1.00246e-05
-1.49817e-06
9.98422e-06
-1.5197e-06
1.00531e-05
-1.7644e-06
1.02225e-05
-2.03457e-06
1.04373e-05
-2.21038e-06
1.07193e-05
-2.51101e-06
1.0991e-05
-2.84999e-06
1.12523e-05
-3.01295e-06
1.16131e-05
-3.23211e-06
1.19363e-05
-3.46023e-06
1.22338e-05
-3.53415e-06
1.25522e-05
-3.46105e-06
1.27997e-05
-3.41309e-06
1.3018e-05
-3.29882e-06
1.32483e-05
-2.84972e-06
1.35846e-05
-2.60914e-06
1.39205e-05
-2.26782e-06
1.42274e-05
-1.86657e-06
1.46522e-05
-1.4316e-06
1.52358e-05
-1.07432e-06
1.57573e-05
-7.76851e-07
1.63149e-05
-7.39412e-07
1.68583e-05
-5.80692e-07
1.74038e-05
-5.88945e-07
1.79627e-05
-6.59806e-07
1.86569e-05
-8.63617e-07
1.91829e-05
-9.91021e-07
1.98152e-05
-1.28864e-06
2.04965e-05
-1.63554e-06
2.10977e-05
-1.8331e-06
2.17272e-05
-2.29192e-06
2.25541e-05
-2.72031e-06
2.31152e-05
-2.83317e-06
2.38483e-05
-3.36766e-06
2.47109e-05
-3.87578e-06
2.55067e-05
-3.93636e-06
2.6121e-05
-4.37455e-06
2.69929e-05
-4.80124e-06
2.77898e-05
-4.83851e-06
2.86641e-05
-5.34116e-06
2.93925e-05
-5.43118e-06
3.01607e-05
-5.64929e-06
3.08935e-05
-5.76882e-06
3.16912e-05
-5.97836e-06
3.24403e-05
-6.15544e-06
3.31994e-05
-6.19503e-06
3.37439e-05
-6.2423e-06
3.44541e-05
-6.49585e-06
3.49998e-05
-6.38361e-06
3.54632e-05
-6.53581e-06
3.60046e-05
-6.88457e-06
3.63432e-05
-6.62129e-06
3.64855e-05
-7.09302e-06
3.66538e-05
-7.22735e-06
3.65516e-05
-7.21254e-06
3.62066e-05
-7.61543e-06
3.5943e-05
-7.78841e-06
3.53162e-05
-7.78463e-06
3.44644e-05
-8.07754e-06
3.35061e-05
-7.77017e-06
3.22513e-05
-7.66763e-06
3.0736e-05
-7.36535e-06
2.91329e-05
-6.56443e-06
2.74577e-05
-6.17211e-06
2.58293e-05
-5.45747e-06
2.42633e-05
-4.63686e-06
2.27211e-05
-4.3966e-06
2.11734e-05
-3.10143e-06
1.99426e-05
-2.05299e-06
1.87691e-05
-1.52964e-06
1.77029e-05
-8.37124e-07
1.66367e-05
4.3123e-07
1.58903e-05
9.4969e-08
1.50814e-05
2.24989e-07
1.44245e-05
8.26962e-07
1.37673e-05
1.91805e-06
1.3564e-05
1.19262e-06
1.33885e-05
-8.68241e-07
1.2439e-05
-1.37742e-07
1.14408e-05
1.60175e-06
1.18432e-05
5.09903e-07
1.18495e-05
-1.9823e-06
1.18582e-05
-3.18212e-06
1.29913e-05
-9.14462e-06
1.43623e-05
-1.30248e-05
1.54046e-05
-1.69334e-05
1.61898e-05
-1.86101e-05
1.65788e-05
-1.78472e-05
1.78359e-05
-2.03776e-05
1.84791e-05
-1.86107e-05
1.89378e-05
-1.65105e-05
1.9387e-05
-1.49515e-05
2.01876e-05
-1.38223e-05
2.12472e-05
-1.19472e-05
2.24499e-05
-1.00615e-05
2.33018e-05
-7.60866e-06
2.42444e-05
-3.44882e-06
2.47084e-05
9.73249e-07
2.48739e-05
4.13829e-06
2.50314e-05
7.92801e-06
2.52033e-05
1.13135e-05
2.53755e-05
1.3644e-05
2.54907e-05
1.59171e-05
2.54277e-05
1.90934e-05
2.47585e-05
2.15388e-05
2.35472e-05
2.21038e-05
2.20413e-05
2.20292e-05
2.09447e-05
2.15797e-05
2.01221e-05
2.20715e-05
1.91443e-05
2.2483e-05
1.74914e-05
2.07614e-05
1.57477e-05
1.79934e-05
1.42272e-05
1.45395e-05
1.32808e-05
1.32216e-05
1.29498e-05
1.38907e-05
1.24293e-05
1.41988e-05
1.18549e-05
1.44079e-05
1.14366e-05
1.4652e-05
1.10021e-05
1.41889e-05
1.04996e-05
1.32985e-05
9.84047e-06
1.27169e-05
9.3905e-06
1.19712e-05
8.77394e-06
1.14013e-05
8.77092e-06
1.01861e-05
9.28834e-06
9.80535e-06
8.95096e-06
9.90333e-06
1.00696e-05
7.93625e-06
9.50212e-06
8.61242e-06
1.02668e-05
5.78335e-06
9.44286e-06
6.82565e-06
9.22169e-06
3.59708e-06
8.32643e-06
4.0684e-06
7.81821e-06
1.02356e-06
6.92547e-06
1.31969e-06
5.89973e-06
-1.30584e-06
4.83925e-06
-9.89443e-07
4.04631e-06
-2.47325e-06
-3.1762e-07
7.02746e-07
1.17258e-06
1.58198e-06
1.89282e-06
2.12765e-06
2.30133e-06
2.40859e-06
2.44913e-06
2.43359e-06
2.37562e-06
2.23224e-06
2.14391e-06
2.11464e-06
2.25887e-06
2.60699e-06
3.21333e-06
3.96656e-06
4.8509e-06
5.76843e-06
6.64068e-06
7.35362e-06
7.80268e-06
7.9786e-06
7.72222e-06
7.10812e-06
6.35376e-06
5.67123e-06
5.14408e-06
4.76401e-06
4.4927e-06
4.30279e-06
4.21144e-06
4.28972e-06
4.63235e-06
5.28725e-06
6.25819e-06
7.34182e-06
8.43294e-06
9.42654e-06
1.03656e-05
1.11551e-05
1.17916e-05
1.23966e-05
1.27694e-05
1.30918e-05
1.332e-05
1.33156e-05
1.33121e-05
1.3136e-05
1.29481e-05
1.27984e-05
1.26006e-05
1.25221e-05
1.24213e-05
1.23007e-05
1.22521e-05
1.21538e-05
1.21383e-05
1.21886e-05
1.22082e-05
1.23546e-05
1.2561e-05
1.27876e-05
1.31339e-05
1.3525e-05
1.39116e-05
1.43624e-05
1.48024e-05
1.52402e-05
1.56693e-05
1.60911e-05
1.64914e-05
1.67839e-05
1.71052e-05
1.74228e-05
1.76492e-05
1.79758e-05
1.82908e-05
1.8582e-05
1.89409e-05
1.93219e-05
1.97595e-05
2.02785e-05
2.06941e-05
2.12251e-05
2.17541e-05
2.22141e-05
2.28395e-05
2.34131e-05
2.39152e-05
2.4606e-05
2.52628e-05
2.58008e-05
2.64988e-05
2.72462e-05
2.79317e-05
2.85888e-05
2.9278e-05
3.00435e-05
3.07445e-05
3.14559e-05
3.21261e-05
3.27225e-05
3.34185e-05
3.41181e-05
3.46496e-05
3.52153e-05
3.58235e-05
3.61562e-05
3.67269e-05
3.71155e-05
3.73713e-05
3.75732e-05
3.77522e-05
3.75736e-05
3.74889e-05
3.71646e-05
3.66712e-05
3.60431e-05
3.51989e-05
3.41089e-05
3.29284e-05
3.16326e-05
3.01995e-05
2.87991e-05
2.72584e-05
2.57089e-05
2.39717e-05
2.24547e-05
2.11509e-05
2.0104e-05
1.89357e-05
1.79441e-05
1.70881e-05
1.63082e-05
1.5522e-05
1.48587e-05
1.41645e-05
1.37985e-05
1.36591e-05
1.18325e-05
1.16761e-05
1.16612e-05
1.11422e-05
1.16921e-05
1.31334e-05
1.35083e-05
1.40841e-05
1.45808e-05
1.54758e-05
1.66953e-05
1.69171e-05
1.72432e-05
1.76165e-05
1.85587e-05
1.98704e-05
2.09557e-05
2.1711e-05
2.23378e-05
2.2772e-05
2.31816e-05
2.33043e-05
2.32422e-05
2.35827e-05
2.39227e-05
2.40938e-05
2.38026e-05
2.30975e-05
2.20207e-05
2.04728e-05
1.9196e-05
1.84149e-05
1.67279e-05
1.51801e-05
1.37597e-05
1.27061e-05
1.29142e-05
1.31267e-05
1.30448e-05
1.27163e-05
1.23272e-05
1.19925e-05
1.1477e-05
1.11694e-05
1.1401e-05
1.04065e-05
1.12528e-05
1.0742e-05
1.1241e-05
1.08862e-05
1.05717e-05
1.03027e-05
1.0234e-05
9.41724e-06
1.01605e-05
8.95209e-06
9.1928e-06
6.77499e-06
5.85192e-06
7.29477e-06
3.06657e-06
6.223e-06
1.07177e-06
5.37854e-06
8.44459e-07
5.51776e-06
-1.39222e-07
4.93679e-06
5.80968e-07
5.23902e-06
-3.0223e-07
5.48233e-06
-2.43306e-07
4.55058e-06
9.31749e-07
4.19876e-06
3.51815e-07
3.00534e-06
1.19343e-06
2.61594e-06
3.89399e-07
3.22005e-06
-6.04118e-07
3.65947e-06
-4.39419e-07
3.66922e-06
-9.75305e-09
4.17752e-06
-5.08294e-07
5.05802e-06
-8.805e-07
5.10354e-06
-4.55211e-08
5.03879e-06
6.47503e-08
3.99563e-06
1.04317e-06
9.67262e-07
1.56221e-05
-7.2106e-07
1.70088e-05
-3.14861e-07
1.51892e-05
2.66401e-06
1.43212e-05
7.28781e-07
1.2755e-05
2.14716e-06
1.26949e-05
-2.4209e-07
1.20518e-05
3.9982e-07
1.0307e-05
2.67649e-06
9.82172e-06
8.37108e-07
8.32768e-06
2.68746e-06
8.34677e-06
3.70311e-07
9.43184e-06
-1.68919e-06
1.03004e-05
-1.30794e-06
1.07329e-05
-4.42342e-07
1.16164e-05
-1.39171e-06
1.24093e-05
-1.67348e-06
1.18004e-05
5.63393e-07
1.10309e-05
8.34286e-07
9.35465e-06
2.71942e-06
2.00728e-06
1.81197e-05
-5.92373e-06
2.25374e-05
-4.73252e-06
2.23389e-05
2.86247e-06
2.16303e-05
1.43739e-06
1.94164e-05
4.36109e-06
1.87138e-05
4.60437e-07
1.75608e-05
1.55283e-06
1.52782e-05
4.95907e-06
1.47421e-05
1.37322e-06
1.33508e-05
4.07877e-06
1.34868e-05
2.34283e-07
1.46583e-05
-2.86064e-06
1.55588e-05
-2.20843e-06
1.63529e-05
-1.23644e-06
1.73854e-05
-2.42427e-06
1.79943e-05
-2.28231e-06
1.72426e-05
1.31508e-06
1.62532e-05
1.82369e-06
1.43159e-05
4.65674e-06
3.00442e-06
1.98163e-05
-9.88149e-06
2.4334e-05
-9.2502e-06
2.62404e-05
9.56044e-07
2.6718e-05
9.59763e-07
2.48071e-05
6.27206e-06
2.36338e-05
1.63371e-06
2.23437e-05
2.84289e-06
2.00672e-05
7.23558e-06
1.94018e-05
2.03864e-06
1.83679e-05
5.11267e-06
1.84693e-05
1.32892e-07
1.96137e-05
-4.00507e-06
2.0186e-05
-2.78074e-06
2.07113e-05
-1.76173e-06
2.1994e-05
-3.70689e-06
2.25264e-05
-2.81476e-06
2.19035e-05
1.93802e-06
2.11987e-05
2.52848e-06
1.92864e-05
6.569e-06
3.96757e-06
2.3075e-05
-1.35557e-05
2.56661e-05
-1.18412e-05
2.83813e-05
-1.75921e-06
2.95425e-05
-2.01409e-07
2.88573e-05
6.95726e-06
2.77774e-05
2.71357e-06
2.60804e-05
4.53997e-06
2.45693e-05
8.74664e-06
2.36077e-05
3.00023e-06
2.2782e-05
5.93839e-06
2.28921e-05
2.27682e-08
2.38789e-05
-4.99182e-06
2.45472e-05
-3.44905e-06
2.45232e-05
-1.73779e-06
2.57385e-05
-4.92215e-06
2.61441e-05
-3.22034e-06
2.5871e-05
2.21104e-06
2.57584e-05
2.64115e-06
2.39901e-05
8.33731e-06
4.88004e-06
2.64045e-05
-1.75676e-05
2.71252e-05
-1.25619e-05
3.01824e-05
-4.81636e-06
3.08094e-05
-8.28403e-07
3.08567e-05
6.90987e-06
3.09175e-05
2.6528e-06
2.84942e-05
6.96328e-06
2.84051e-05
8.83571e-06
2.78337e-05
3.57168e-06
2.67659e-05
7.00621e-06
2.67663e-05
2.23082e-08
2.7173e-05
-5.39847e-06
2.80258e-05
-4.30188e-06
2.76807e-05
-1.39268e-06
2.88383e-05
-6.0797e-06
2.89872e-05
-3.36926e-06
2.88912e-05
2.30705e-06
2.9654e-05
1.87835e-06
2.83514e-05
9.63983e-06
5.66651e-06
2.90753e-05
-2.16939e-05
2.82211e-05
-1.17077e-05
3.14592e-05
-8.05453e-06
3.18402e-05
-1.20934e-06
3.13681e-05
7.38197e-06
3.3478e-05
5.42851e-07
3.02614e-05
1.01799e-05
3.01388e-05
8.95832e-06
3.06113e-05
3.09918e-06
2.97801e-05
7.83739e-06
2.99163e-05
-1.13874e-07
2.98954e-05
-5.37756e-06
3.08959e-05
-5.30234e-06
3.01882e-05
-6.85064e-07
3.10852e-05
-6.97668e-06
3.12286e-05
-3.51268e-06
3.10663e-05
2.46934e-06
3.23774e-05
5.67287e-07
3.1917e-05
1.01002e-05
6.04134e-06
3.08098e-05
-2.49127e-05
2.88785e-05
-9.77636e-06
3.18207e-05
-1.09967e-05
3.26598e-05
-2.04848e-06
3.06356e-05
9.40616e-06
3.42714e-05
-3.09294e-06
3.20018e-05
1.24495e-05
3.10083e-05
9.95186e-06
3.16396e-05
2.46785e-06
3.11217e-05
8.35529e-06
3.15927e-05
-5.84839e-07
3.14486e-05
-5.23349e-06
3.27534e-05
-6.60714e-06
3.22994e-05
-2.3103e-07
3.26934e-05
-7.37072e-06
3.27898e-05
-3.60906e-06
3.24959e-05
2.76327e-06
3.37074e-05
-6.44254e-07
3.41075e-05
9.7001e-06
5.77595e-06
3.16878e-05
-2.68013e-05
2.89751e-05
-7.06367e-06
3.17359e-05
-1.37575e-05
3.3367e-05
-3.6796e-06
3.01561e-05
1.2617e-05
3.32407e-05
-6.17749e-06
3.27813e-05
1.29089e-05
3.25803e-05
1.01528e-05
3.30368e-05
2.01139e-06
3.22283e-05
9.16375e-06
3.304e-05
-1.39651e-06
3.30565e-05
-5.25003e-06
3.42378e-05
-7.7884e-06
3.43272e-05
-3.20401e-07
3.43983e-05
-7.44182e-06
3.45422e-05
-3.75298e-06
3.40428e-05
3.26266e-06
3.43148e-05
-9.16267e-07
3.5017e-05
8.99792e-06
5.01086e-06
3.21437e-05
-2.72192e-05
2.89512e-05
-3.87112e-06
3.12971e-05
-1.61035e-05
3.34358e-05
-5.8183e-06
3.06565e-05
1.53963e-05
3.21851e-05
-7.70605e-06
3.2345e-05
1.2749e-05
3.3234e-05
9.26379e-06
3.40785e-05
1.16695e-06
3.3465e-05
9.77724e-06
3.42158e-05
-2.14738e-06
3.46125e-05
-5.64669e-06
3.56235e-05
-8.79937e-06
3.58997e-05
-5.9669e-07
3.55636e-05
-7.10568e-06
3.59201e-05
-4.10951e-06
3.55872e-05
3.5956e-06
3.49498e-05
-2.78862e-07
3.54565e-05
8.49121e-06
4.16092e-06
3.18684e-05
-2.57538e-05
2.89062e-05
-9.08842e-07
3.03852e-05
-1.75825e-05
3.23146e-05
-7.74777e-06
3.11358e-05
1.65752e-05
3.15836e-05
-8.15382e-06
3.17167e-05
1.26158e-05
3.26887e-05
8.29178e-06
3.36972e-05
1.58459e-07
3.39981e-05
9.47637e-06
3.47505e-05
-2.89979e-06
3.55922e-05
-6.48839e-06
3.64457e-05
-9.65284e-06
3.70163e-05
-1.16728e-06
3.64144e-05
-6.50378e-06
3.62272e-05
-3.92239e-06
3.58751e-05
3.94773e-06
3.50496e-05
5.46637e-07
3.56365e-05
7.90435e-06
3.38594e-06
3.13141e-05
-2.27182e-05
2.95116e-05
8.93666e-07
2.98374e-05
-1.79083e-05
3.08219e-05
-8.73226e-06
3.13445e-05
1.60526e-05
3.11226e-05
-7.93195e-06
3.14498e-05
1.22886e-05
3.23232e-05
7.4184e-06
3.31848e-05
-7.0318e-07
3.40392e-05
8.62201e-06
3.48722e-05
-3.73285e-06
3.61732e-05
-7.7893e-06
3.68674e-05
-1.03471e-05
3.78537e-05
-2.15362e-06
3.71076e-05
-5.75767e-06
3.57559e-05
-2.57071e-06
3.5309e-05
4.39463e-06
3.45496e-05
1.30606e-06
3.51238e-05
7.33017e-06
2.61473e-06
3.06129e-05
-1.84311e-05
2.9947e-05
1.55961e-06
2.89508e-05
-1.69121e-05
2.84937e-05
-8.27513e-06
3.07167e-05
1.38296e-05
3.02755e-05
-7.49078e-06
3.13202e-05
1.12439e-05
3.2051e-05
6.68767e-06
3.24835e-05
-1.13576e-06
3.3933e-05
7.17252e-06
3.51466e-05
-4.94643e-06
3.69072e-05
-9.54992e-06
3.7368e-05
-1.08079e-05
3.81754e-05
-2.96102e-06
3.68506e-05
-4.43286e-06
3.4931e-05
-6.51078e-07
3.45834e-05
4.74221e-06
3.35706e-05
2.31889e-06
3.42006e-05
6.70012e-06
1.68358e-06
3.00409e-05
-1.39729e-05
3.04392e-05
1.16126e-06
2.75379e-05
-1.40108e-05
2.60892e-05
-6.82644e-06
2.97417e-05
1.01771e-05
2.89118e-05
-6.66092e-06
3.08958e-05
9.25998e-06
3.15817e-05
6.00178e-06
3.17507e-05
-1.30474e-06
3.43326e-05
4.59057e-06
3.57266e-05
-6.34041e-06
3.71151e-05
-1.09384e-05
3.68363e-05
-1.05291e-05
3.71138e-05
-3.2385e-06
3.53053e-05
-2.62438e-06
3.33916e-05
1.26258e-06
3.3212e-05
4.92182e-06
3.24192e-05
3.11175e-06
3.33509e-05
5.76837e-06
8.35859e-07
2.96231e-05
-9.65464e-06
3.04717e-05
3.12635e-07
2.66077e-05
-1.01468e-05
2.54407e-05
-5.6594e-06
2.89586e-05
6.6592e-06
2.75849e-05
-5.28718e-06
3.05645e-05
6.28037e-06
3.12383e-05
5.32792e-06
3.16123e-05
-1.67866e-06
3.50233e-05
1.1795e-06
3.57038e-05
-7.0209e-06
3.55219e-05
-1.07565e-05
3.42068e-05
-9.21402e-06
3.36932e-05
-2.72486e-06
3.18228e-05
-7.54033e-07
3.07772e-05
2.30822e-06
3.12096e-05
4.48941e-06
3.06743e-05
3.64708e-06
3.15741e-05
4.86856e-06
2.55994e-07
2.97107e-05
-7.04164e-06
3.07183e-05
-6.95009e-07
2.66964e-05
-6.12481e-06
2.52309e-05
-4.19391e-06
2.78503e-05
4.03982e-06
2.69013e-05
-4.33824e-06
2.9656e-05
3.52574e-06
3.03967e-05
4.58721e-06
3.12932e-05
-2.57521e-06
3.40044e-05
-1.5317e-06
3.33081e-05
-6.32459e-06
3.14727e-05
-8.92107e-06
2.93368e-05
-7.07807e-06
2.84365e-05
-1.82461e-06
2.72615e-05
4.20941e-07
2.72005e-05
2.36931e-06
2.75663e-05
4.12357e-06
2.7363e-05
3.8504e-06
2.87121e-05
3.51941e-06
-2.3641e-07
2.90717e-05
-5.2454e-06
2.95539e-05
-1.17723e-06
2.64881e-05
-3.05896e-06
2.51895e-05
-2.89535e-06
2.70909e-05
2.13844e-06
2.58769e-05
-3.12429e-06
2.77209e-05
1.6818e-06
2.92565e-05
3.05161e-06
2.96668e-05
-2.98558e-06
3.03355e-05
-2.20037e-06
2.8368e-05
-4.35708e-06
2.54731e-05
-6.02615e-06
2.31408e-05
-4.74581e-06
2.23728e-05
-1.05659e-06
2.19321e-05
8.61605e-07
2.23187e-05
1.98275e-06
2.29242e-05
3.5181e-06
2.38003e-05
2.97427e-06
2.53211e-05
1.99867e-06
-3.07567e-07
2.67319e-05
-3.46379e-06
2.65288e-05
-9.74108e-07
2.47646e-05
-1.29477e-06
2.37311e-05
-1.86185e-06
2.46854e-05
1.18417e-06
2.31909e-05
-1.6298e-06
2.43735e-05
4.99217e-07
2.56514e-05
1.77371e-06
2.46059e-05
-1.94014e-06
2.36846e-05
-1.27899e-06
2.13631e-05
-2.03561e-06
1.8563e-05
-3.22604e-06
1.65432e-05
-2.72607e-06
1.60153e-05
-5.28658e-07
1.62183e-05
6.58621e-07
1.69887e-05
1.21231e-06
1.81863e-05
2.32048e-06
1.95369e-05
1.62372e-06
2.04609e-05
1.0747e-06
1.31992e-08
1.97512e-05
-1.17351e-06
1.88511e-05
-7.40291e-08
1.77257e-05
-1.69349e-07
1.66922e-05
-8.28372e-07
1.7335e-05
5.41314e-07
1.6241e-05
-5.35729e-07
1.67982e-05
-5.80114e-08
1.77394e-05
8.32555e-07
1.64129e-05
-6.13696e-07
1.54117e-05
-2.77761e-07
1.37846e-05
-4.08565e-07
1.16693e-05
-1.11073e-06
1.00557e-05
-1.11239e-06
9.79916e-06
-2.72164e-07
1.02575e-05
2.00276e-07
1.10629e-05
4.06952e-07
1.24186e-05
9.64705e-07
1.3461e-05
5.81345e-07
1.39922e-05
5.43517e-07
2.21778e-07
7.22609e-06
7.15206e-06
6.98271e-06
6.15434e-06
6.69565e-06
6.15992e-06
6.10191e-06
6.93447e-06
6.32077e-06
6.04301e-06
5.63445e-06
4.52372e-06
3.41133e-06
3.13916e-06
3.33944e-06
3.74639e-06
4.7111e-06
5.29244e-06
5.83596e-06
)
;
boundaryField
{
inlet
{
type calculated;
value nonuniform List<scalar>
20
(
-2.5e-05
-2.5e-05
-2.5e-05
-2.5e-05
-2.5e-05
-2.5e-05
-2.5e-05
-2.5e-05
-2.5e-05
-2.5e-05
-2.5e-05
-2.5e-05
-2.5e-05
-2.5e-05
-2.5e-05
-2.5e-05
-2.5e-05
-2.5e-05
-2.5e-05
-2.5e-05
)
;
}
outlet
{
type calculated;
value nonuniform List<scalar>
20
(
3.02837e-06
8.31463e-06
1.33187e-05
1.83233e-05
2.30776e-05
2.7565e-05
3.15422e-05
3.43729e-05
3.57821e-05
3.63065e-05
3.64114e-05
3.5895e-05
3.51318e-05
3.41986e-05
3.21539e-05
2.92045e-05
2.53922e-05
2.01401e-05
1.37836e-05
6.05774e-06
)
;
}
walls
{
type calculated;
value uniform 0;
}
frontAndBack
{
type empty;
value nonuniform 0();
}
}
// ************************************************************************* //
| [
"g.svenn@online.no"
] | g.svenn@online.no | |
58c45fabb5ab96b1eeae43df91cf505c21780fbd | 19b4aea6c829b272ae29692ccc51f9ab8dcf573f | /src/winrt/impl/Windows.Devices.SmartCards.1.h | 8b848d7f7d1bde03cc541deb9f06999792242bc8 | [
"MIT"
] | permissive | liquidboy/X | 9665573b6e30dff8912ab64a8daf08f9f3176628 | bf94a0af4dd06ab6c66027afdcda88eda0b4ae47 | refs/heads/master | 2022-12-10T17:41:15.490231 | 2021-12-07T01:31:38 | 2021-12-07T01:31:38 | 51,222,325 | 29 | 9 | null | 2021-08-04T21:30:44 | 2016-02-06T21:16:04 | C++ | UTF-8 | C++ | false | false | 11,845 | h | // C++/WinRT v1.0.170906.1
// Copyright (c) 2017 Microsoft Corporation. All rights reserved.
#pragma once
#include "winrt/impl/Windows.Security.Cryptography.Core.0.h"
#include "winrt/impl/Windows.Storage.Streams.0.h"
#include "winrt/impl/Windows.Foundation.0.h"
#include "winrt/impl/Windows.Devices.SmartCards.0.h"
WINRT_EXPORT namespace winrt::Windows::Devices::SmartCards {
struct WINRT_EBO ICardAddedEventArgs :
Windows::Foundation::IInspectable,
impl::consume_t<ICardAddedEventArgs>
{
ICardAddedEventArgs(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ICardRemovedEventArgs :
Windows::Foundation::IInspectable,
impl::consume_t<ICardRemovedEventArgs>
{
ICardRemovedEventArgs(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCard :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCard>
{
ISmartCard(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardAppletIdGroup :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardAppletIdGroup>
{
ISmartCardAppletIdGroup(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardAppletIdGroupFactory :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardAppletIdGroupFactory>
{
ISmartCardAppletIdGroupFactory(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardAppletIdGroupRegistration :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardAppletIdGroupRegistration>
{
ISmartCardAppletIdGroupRegistration(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardAppletIdGroupStatics :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardAppletIdGroupStatics>
{
ISmartCardAppletIdGroupStatics(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardAutomaticResponseApdu :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardAutomaticResponseApdu>
{
ISmartCardAutomaticResponseApdu(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardAutomaticResponseApdu2 :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardAutomaticResponseApdu2>
{
ISmartCardAutomaticResponseApdu2(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardAutomaticResponseApdu3 :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardAutomaticResponseApdu3>
{
ISmartCardAutomaticResponseApdu3(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardAutomaticResponseApduFactory :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardAutomaticResponseApduFactory>
{
ISmartCardAutomaticResponseApduFactory(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardChallengeContext :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardChallengeContext>,
impl::require<ISmartCardChallengeContext, Windows::Foundation::IClosable>
{
ISmartCardChallengeContext(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardConnect :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardConnect>
{
ISmartCardConnect(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardConnection :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardConnection>,
impl::require<ISmartCardConnection, Windows::Foundation::IClosable>
{
ISmartCardConnection(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardCryptogramGenerator :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardCryptogramGenerator>
{
ISmartCardCryptogramGenerator(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardCryptogramGenerator2 :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardCryptogramGenerator2>
{
ISmartCardCryptogramGenerator2(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardCryptogramGeneratorStatics :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardCryptogramGeneratorStatics>
{
ISmartCardCryptogramGeneratorStatics(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardCryptogramGeneratorStatics2 :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardCryptogramGeneratorStatics2>
{
ISmartCardCryptogramGeneratorStatics2(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardCryptogramGetAllCryptogramMaterialCharacteristicsResult :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardCryptogramGetAllCryptogramMaterialCharacteristicsResult>
{
ISmartCardCryptogramGetAllCryptogramMaterialCharacteristicsResult(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardCryptogramGetAllCryptogramMaterialPackageCharacteristicsResult :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardCryptogramGetAllCryptogramMaterialPackageCharacteristicsResult>
{
ISmartCardCryptogramGetAllCryptogramMaterialPackageCharacteristicsResult(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardCryptogramGetAllCryptogramStorageKeyCharacteristicsResult :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardCryptogramGetAllCryptogramStorageKeyCharacteristicsResult>
{
ISmartCardCryptogramGetAllCryptogramStorageKeyCharacteristicsResult(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardCryptogramMaterialCharacteristics :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardCryptogramMaterialCharacteristics>
{
ISmartCardCryptogramMaterialCharacteristics(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardCryptogramMaterialPackageCharacteristics :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardCryptogramMaterialPackageCharacteristics>
{
ISmartCardCryptogramMaterialPackageCharacteristics(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardCryptogramMaterialPossessionProof :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardCryptogramMaterialPossessionProof>
{
ISmartCardCryptogramMaterialPossessionProof(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardCryptogramPlacementStep :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardCryptogramPlacementStep>
{
ISmartCardCryptogramPlacementStep(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardCryptogramStorageKeyCharacteristics :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardCryptogramStorageKeyCharacteristics>
{
ISmartCardCryptogramStorageKeyCharacteristics(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardCryptogramStorageKeyInfo :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardCryptogramStorageKeyInfo>
{
ISmartCardCryptogramStorageKeyInfo(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardCryptogramStorageKeyInfo2 :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardCryptogramStorageKeyInfo2>
{
ISmartCardCryptogramStorageKeyInfo2(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardEmulator :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardEmulator>
{
ISmartCardEmulator(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardEmulator2 :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardEmulator2>
{
ISmartCardEmulator2(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardEmulatorApduReceivedEventArgs :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardEmulatorApduReceivedEventArgs>
{
ISmartCardEmulatorApduReceivedEventArgs(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardEmulatorApduReceivedEventArgs2 :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardEmulatorApduReceivedEventArgs2>
{
ISmartCardEmulatorApduReceivedEventArgs2(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardEmulatorApduReceivedEventArgsWithCryptograms :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardEmulatorApduReceivedEventArgsWithCryptograms>
{
ISmartCardEmulatorApduReceivedEventArgsWithCryptograms(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardEmulatorConnectionDeactivatedEventArgs :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardEmulatorConnectionDeactivatedEventArgs>
{
ISmartCardEmulatorConnectionDeactivatedEventArgs(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardEmulatorConnectionProperties :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardEmulatorConnectionProperties>
{
ISmartCardEmulatorConnectionProperties(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardEmulatorStatics :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardEmulatorStatics>
{
ISmartCardEmulatorStatics(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardEmulatorStatics2 :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardEmulatorStatics2>
{
ISmartCardEmulatorStatics2(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardEmulatorStatics3 :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardEmulatorStatics3>
{
ISmartCardEmulatorStatics3(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardPinPolicy :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardPinPolicy>
{
ISmartCardPinPolicy(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardPinResetDeferral :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardPinResetDeferral>
{
ISmartCardPinResetDeferral(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardPinResetRequest :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardPinResetRequest>
{
ISmartCardPinResetRequest(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardProvisioning :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardProvisioning>
{
ISmartCardProvisioning(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardProvisioning2 :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardProvisioning2>
{
ISmartCardProvisioning2(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardProvisioningStatics :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardProvisioningStatics>
{
ISmartCardProvisioningStatics(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardProvisioningStatics2 :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardProvisioningStatics2>
{
ISmartCardProvisioningStatics2(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardReader :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardReader>
{
ISmartCardReader(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardReaderStatics :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardReaderStatics>
{
ISmartCardReaderStatics(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardTriggerDetails :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardTriggerDetails>
{
ISmartCardTriggerDetails(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardTriggerDetails2 :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardTriggerDetails2>
{
ISmartCardTriggerDetails2(std::nullptr_t = nullptr) noexcept {}
};
struct WINRT_EBO ISmartCardTriggerDetails3 :
Windows::Foundation::IInspectable,
impl::consume_t<ISmartCardTriggerDetails3>
{
ISmartCardTriggerDetails3(std::nullptr_t = nullptr) noexcept {}
};
}
| [
"fajardo_jf@hotmail.com"
] | fajardo_jf@hotmail.com |
6e6c034a9063cf0acf7418c5f26511e0ab9b1b91 | 1faf448be4adddc6048542410049df86ae77525a | /Word Count/Output.h | ce68af754bd5982ec107d3abcbc2cb0ae5e8129b | [] | no_license | Joshs-Projects/Word-Count | 7b62bdddb8ea1951e05bba8a9a6a726dbc54b637 | b04ceca87e7ec6add7268bf9b8ef04a79dec6f15 | refs/heads/master | 2023-03-31T05:57:15.902227 | 2021-04-13T09:35:40 | 2021-04-13T09:35:40 | 354,870,318 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,912 | h | #pragma once
#include "CSVFile.h"
#include <tuple>
class Output : public CSVFile {
public:
Output(std::string newFilename) {
SetFilename(newFilename);
}
std::string getEntry(int row, int column) {
return data[row + 1][column];
}
int setEntry(int row, int column, std::string entry) {
data[row + 1][column] = entry;
return 1;
}
int setNewRow(std::vector <std::string> newRow) {
data.push_back(newRow);
return 1;
}
//This gets the version that the csv file has most recently
int getVersion() {
return data.size() - 1;
}
int getWordCount() {
if (getVersion() == 0) {
return 0;
}
else {
return stoi(data[getVersion()][3]);
}
}
int getAverageWordsPerSession() {
int total = 0;
for (int i = 1; i < data.size(); i++) {
total = total + stoi(data[i][2]);
}
return (total / getVersion());
}
std::vector<std::tuple<std::string, int>> getAverageWordsPerDay() {
//First entry is the date second is the number of sessions in that day third is the total for the day
std::vector <std::tuple <std::string, int, int>> daySessionsTotal = {};
std::tuple <std::string, int, int> tempTuple;
/*std::get<0>(tempTuple) = data[1][0];
std::get<1>(tempTuple) = 1;
std::get<2>(tempTuple) = stoi(data[1][2]);
daySessionsTotal.push_back(tempTuple);*/
std::vector<std::tuple <std::string, int>> dateAverage = {};
std::tuple <std::string, int> tempTupleAverage;
for (int i = 1; i < data.size(); i++) {
bool found = false;
for (int q = 0; q < daySessionsTotal.size(); q++) {
if (data[i][0].compare(std::get<0>(daySessionsTotal[q])) == 0) {
std::get<1>(daySessionsTotal[q]) = std::get<1>(daySessionsTotal[q]) + 1;
std::get<2>(daySessionsTotal[q]) = std::get<2>(daySessionsTotal[q]) + stoi(data[i][2]);
found = true;
}
}
if (found == false) {
std::get<0>(tempTuple) = data[i][0];
std::get<1>(tempTuple) = 1;
std::get<2>(tempTuple) = stoi(data[i][2]);
daySessionsTotal.push_back(tempTuple);
}
}
/*for (int q = 0; q < daySessionsTotal.size(); q++) {
for (int i = 1; i < data.size(); i++) {
if (data[i][0] == std::get<0>(daySessionsTotal[q])) {
std::get<1>(daySessionsTotal[q]) = std::get<1>(daySessionsTotal[q]) + 1;
std::get<2>(daySessionsTotal[q]) = std::get<2>(daySessionsTotal[q]) + stoi(data[i][2]);
}
else {
std::get<0>(tempTuple) = data[i][0];
std::get<1>(tempTuple) = 1;
std::get<2>(tempTuple) = stoi(data[i][2]);
daySessionsTotal.push_back(tempTuple);
}
}
}*/
for (int i = 0; i < daySessionsTotal.size(); i++) {
std::get<0>(tempTupleAverage) = std::get<0>(daySessionsTotal[i]);
std::get<1>(tempTupleAverage) = std::get<2>(daySessionsTotal[i])/(std::get<1>(daySessionsTotal[i]));
dateAverage.push_back(tempTupleAverage);
}
return dateAverage;
}
std::string getNewestEntryDate() {
return data[getVersion()][0];
}
};
| [
"74363804+Joshs-Projects@users.noreply.github.com"
] | 74363804+Joshs-Projects@users.noreply.github.com |
2cd916e97c2522aa8f49b007bba148dd8cd105dd | bc1c43d7ebb8fbb23d022f1554e1639285f276b2 | /osl/core/test/mobility/countMobility.t.cc | 9a0fe99ef216f4d1a59c5a2def682c0930f8c3d1 | [] | no_license | ai5/gpsfish | d1eafdece0c7c203c32603892ff9263a8fbcba59 | b6ed91f77478fdb51b8747e2fcd78042d79271d5 | refs/heads/master | 2020-12-24T06:54:11.062234 | 2016-07-02T20:42:10 | 2016-07-02T20:42:10 | 62,468,733 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,333 | cc | /* countMobility.t.cc
*/
#include "osl/mobility/countMobility.h"
#include "osl/csa.h"
#include <boost/test/unit_test.hpp>
#include <iostream>
using namespace osl;
using namespace osl::mobility;
BOOST_AUTO_TEST_CASE(CountMobilityTestCount)
{
{
SimpleState sState=
CsaString(
"P1+NY+TO * * * * -OU-KE-KY\n"
"P2 * * * * * -GI-FU * *\n"
"P3 * +RY * * +UM * -KI-FU-FU\n"
"P4 * * +FU-KI * * * * *\n"
"P5 * * -KE * +FU * * +FU *\n"
"P6+KE * * +FU+GI-FU * * +FU\n"
"P7 * * -UM * * * * * *\n"
"P8 * * * * * * * * * \n"
"P9 * +OU * -GI * * * * -NG\n"
"P+00HI00KI00KE00KY00FU00FU00FU00FU00FU00FU\n"
"P-00KI00KY00FU00FU\n"
"P-00AL\n"
"+\n"
).initialState();
NumEffectState state(sState);
// 83 飛車
{
const Square pos(8,3);
{
const Offset o(0,-1);
BOOST_CHECK_EQUAL(1,countMobilitySafe(BLACK,state,pos,o));
BOOST_CHECK_EQUAL(1,countMobilityAll(BLACK,state,pos,o));
int countAll=0,countSafe=0;
countMobilityBoth(BLACK,state,pos,o,countAll,countSafe);
BOOST_CHECK_EQUAL(1,countAll);
BOOST_CHECK_EQUAL(1,countSafe);
}
{
const Offset o(0,1);
BOOST_CHECK_EQUAL(5,countMobilityAll(BLACK,state,pos,o));
BOOST_CHECK_EQUAL(2,countMobilitySafe(BLACK,state,pos,o));
int countAll=0,countSafe=0;
countMobilityBoth(BLACK,state,pos,o,countAll,countSafe);
BOOST_CHECK_EQUAL(5,countAll);
BOOST_CHECK_EQUAL(2,countSafe);
}
{
const Offset o(-1,0);
BOOST_CHECK_EQUAL(2,countMobilityAll(BLACK,state,pos,o));
BOOST_CHECK_EQUAL(1,countMobilitySafe(BLACK,state,pos,o));
int countAll=0,countSafe=0;
countMobilityBoth(BLACK,state,pos,o,countAll,countSafe);
BOOST_CHECK_EQUAL(2,countAll);
BOOST_CHECK_EQUAL(1,countSafe);
}
{
const Offset o(1,0);
BOOST_CHECK_EQUAL(1,countMobilityAll(BLACK,state,pos,o));
BOOST_CHECK_EQUAL(1,countMobilitySafe(BLACK,state,pos,o));
int countAll=0,countSafe=0;
countMobilityBoth(BLACK,state,pos,o,countAll,countSafe);
BOOST_CHECK_EQUAL(1,countAll);
BOOST_CHECK_EQUAL(1,countSafe);
}
}
// 53 馬
{
const Square pos(5,3);
{
const Offset o(-1,-1);
BOOST_CHECK_EQUAL(1,countMobilityAll(BLACK,state,pos,o));
BOOST_CHECK_EQUAL(0,countMobilitySafe(BLACK,state,pos,o));
int countAll=0,countSafe=0;
countMobilityBoth(BLACK,state,pos,o,countAll,countSafe);
BOOST_CHECK_EQUAL(1,countAll);
BOOST_CHECK_EQUAL(0,countSafe);
}
{
const Offset o(-1,1);
BOOST_CHECK_EQUAL(4,countMobilityAll(BLACK,state,pos,o));
BOOST_CHECK_EQUAL(3,countMobilitySafe(BLACK,state,pos,o));
int countAll=0,countSafe=0;
countMobilityBoth(BLACK,state,pos,o,countAll,countSafe);
BOOST_CHECK_EQUAL(4,countAll);
BOOST_CHECK_EQUAL(3,countSafe);
}
{
const Offset o(1,-1);
BOOST_CHECK_EQUAL(2,countMobilityAll(BLACK,state,pos,o));
BOOST_CHECK_EQUAL(2,countMobilitySafe(BLACK,state,pos,o));
int countAll=0,countSafe=0;
countMobilityBoth(BLACK,state,pos,o,countAll,countSafe);
BOOST_CHECK_EQUAL(2,countAll);
BOOST_CHECK_EQUAL(2,countSafe);
}
{
const Offset o(1,1);
BOOST_CHECK_EQUAL(1,countMobilityAll(BLACK,state,pos,o));
BOOST_CHECK_EQUAL(1,countMobilitySafe(BLACK,state,pos,o));
int countAll=0,countSafe=0;
countMobilityBoth(BLACK,state,pos,o,countAll,countSafe);
BOOST_CHECK_EQUAL(1,countAll);
BOOST_CHECK_EQUAL(1,countSafe);
}
}
// 77 馬
{
const Square pos(7,7);
{
const Offset o(-1,-1);
BOOST_CHECK_EQUAL(1,countMobilityAll(WHITE,state,pos,o));
BOOST_CHECK_EQUAL(1,countMobilitySafe(WHITE,state,pos,o));
int countAll=0,countSafe=0;
countMobilityBoth(WHITE,state,pos,o,countAll,countSafe);
BOOST_CHECK_EQUAL(1,countAll);
BOOST_CHECK_EQUAL(1,countSafe);
}
{
const Offset o(-1,1);
BOOST_CHECK_EQUAL(2,countMobilityAll(WHITE,state,pos,o));
BOOST_CHECK_EQUAL(2,countMobilitySafe(WHITE,state,pos,o));
int countAll=0,countSafe=0;
countMobilityBoth(WHITE,state,pos,o,countAll,countSafe);
BOOST_CHECK_EQUAL(2,countAll);
BOOST_CHECK_EQUAL(2,countSafe);
}
{
const Offset o(1,-1);
BOOST_CHECK_EQUAL(2,countMobilityAll(WHITE,state,pos,o));
BOOST_CHECK_EQUAL(1,countMobilitySafe(WHITE,state,pos,o));
int countAll=0,countSafe=0;
countMobilityBoth(WHITE,state,pos,o,countAll,countSafe);
BOOST_CHECK_EQUAL(2,countAll);
BOOST_CHECK_EQUAL(1,countSafe);
}
{
const Offset o(1,1);
BOOST_CHECK_EQUAL(2,countMobilityAll(WHITE,state,pos,o));
BOOST_CHECK_EQUAL(0,countMobilitySafe(WHITE,state,pos,o));
int countAll=0,countSafe=0;
countMobilityBoth(WHITE,state,pos,o,countAll,countSafe);
BOOST_CHECK_EQUAL(2,countAll);
BOOST_CHECK_EQUAL(0,countSafe);
}
}
// 11 香車
{
const Square pos(1,1);
{
const Offset o(0,1);
BOOST_CHECK_EQUAL(1,countMobilityAll(WHITE,state,pos,o));
BOOST_CHECK_EQUAL(1,countMobilitySafe(WHITE,state,pos,o));
int countAll=0,countSafe=0;
countMobilityBoth(WHITE,state,pos,o,countAll,countSafe);
BOOST_CHECK_EQUAL(1,countAll);
BOOST_CHECK_EQUAL(1,countSafe);
}
}
}
}
/* ------------------------------------------------------------------------- */
// ;;; Local Variables:
// ;;; mode:c++
// ;;; c-basic-offset:2
// ;;; End:
| [
"taibarax@gmail.com"
] | taibarax@gmail.com |
70b71bcc4113a4a15915afd7de72df82a87132af | 885b255849d15d027c3a0a860f84d47708695c9e | /Binary Search Trees/Populate Inorder Successor Of All Nodes/Populate_inorder_successor_for_all_nodes(2).cpp | dc4a79e025a314d9949fbd9c6d74be3cf8d7c177 | [] | no_license | RishabhShukla1511/Algorithms | ac004fdc72206f891a272d22fcf51d23a5239371 | 8482e6b09782a5a74f90a7fd337e090691f9f767 | refs/heads/main | 2023-06-12T12:01:30.686139 | 2021-06-27T15:01:40 | 2021-06-27T15:01:40 | 337,818,976 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,343 | cpp | #include <stdio.h>
#include <stdlib.h>
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
struct node
{
int data;
struct node *left;
struct node *right;
struct node *next;
node(int x){
data = x;
left = NULL;
right = NULL;
next = NULL;
}
};
struct node* Inorder(struct node* root)
{
if(root->left==NULL)
return root;
Inorder(root->left);
}
void populateNext(struct node* root);
void insert(struct node *root,int n1,int n2,char lr)
{
if(root==NULL)
return;
if(root->data==n1)
{
switch(lr)
{
case 'L': root->left=new node(n2);
break;
case 'R': root->right=new node(n2);
break;
}
}
else
{
insert(root->left,n1,n2,lr);
insert(root->right,n1,n2,lr);
}
}
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
struct node *root=NULL;
while(n--)
{
char lr;
int n1,n2;
cin>>n1>>n2;
cin>>lr;
if(root==NULL)
{
root=new node(n1);
switch(lr){
case 'L': root->left=new node(n2);
break;
case 'R': root->right=new node(n2);
break;
}
}
else
{
insert(root,n1,n2,lr);
}
}
populateNext(root);
struct node *ptr = Inorder(root);
while(ptr)
{
printf("%d->%d ", ptr->data, ptr->next? ptr->next->data: -1);
ptr = ptr->next;
}
cout<<endl;
}
return 0;
}
// } Driver Code Ends
/* Set next of p and all descendents of p by traversing them in reverse Inorder */
/*
Node Structure
struct node
{
int data;
struct node *left;
struct node *right;
struct node *next;
node(int x){
data = x;
left = NULL;
right = NULL;
next = NULL;
}
};
*/
void inOrder(node *root,vector<node*>&v)
{
if(root)
{
inOrder(root->left,v);
v.push_back(root);
inOrder(root->right,v);
}
}
void populateNext(struct node* p)
{
// Your code goes here
if(!p)
return;
vector<node*>v;
inOrder(p,v);
for(int i=0;i<v.size()-1;i++)
v[i]->next=v[i+1];
v[v.size()-1]->next=NULL;
} | [
"42274135+RishabhShukla1511@users.noreply.github.com"
] | 42274135+RishabhShukla1511@users.noreply.github.com |
cc091d777b97e4cc9ab7f1677a5f90b447903a7d | 3d801968b2a83496d711075b8c39d45f5c1cfc00 | /Arrays/maximum and minimum/minimum-number-of-swaps-required-for-arranging-pairs-adjacent-to-each-other.cpp | a22213533d5a0454b780eee58f406c28caab8452 | [] | no_license | hemalhansda/ds_algo | 74fa462843aed9f48fd3518a0db8664d724bfc88 | f038190e647a70dbecfcb42239abb4c679b56e04 | refs/heads/master | 2020-09-18T05:31:22.975399 | 2019-10-09T07:04:09 | 2019-10-09T07:04:09 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,771 | cpp | /*Minimum number of swaps required for arranging pairs adjacent to each other
There are n-pairs and therefore 2n people. everyone has one unique number ranging from 1 to 2n.
All these 2n persons are arranged in random fashion in an Array of size 2n. We are also given who is partner of whom.
Find the minimum number of swaps required to arrange these pairs such that all pairs become adjacent to each other.
Example:
Input:
n = 3
pairs[] = {1->3, 2->6, 4->5} // 1 is partner of 3 and so on
arr[] = {3, 5, 6, 4, 1, 2}
Output: 2
We can get {3, 1, 5, 4, 6, 2} by swapping 5 & 6, and 6 & 1
Source: Google Interview Question
We strongly recommend you to minimize your browser and try this yourself first.
The idea is to start from first and second elements and recur for remaining elements. Below are detailed steps/
1) If first and second elements are pair, then simply recur
for remaining n-1 pairs and return the value returned by
recursive call.
2) If first and second are NOT pair, then there are two ways to
arrange. So try both of them return the minimum of two.
a) Swap second with pair of first and recur for n-1 elements.
Let the value returned by recursive call be 'a'.
b) Revert the changes made by previous step.
c) Swap first with pair of second and recur for n-1 elements.
Let the value returned by recursive call be 'b'.
d) Revert the changes made by previous step before returning
control to parent call.
e) Return 1 + min(a, b)
Below is C++ implementation of above algorithm. */
// C++ program to find minimum number of swaps required so that
// all pairs become adjacent.
#include<bits/stdc++.h>
using namespace std;
// This function updates indexes of elements 'a' and 'b'
void updateindex(int index[], int a, int ai, int b, int bi)
{
index[a] = ai;
index[b] = bi;
}
// This function returns minimum number of swaps required to arrange
// all elements of arr[i..n] become aranged
int minSwapsUtil(int arr[], int pairs[], int index[], int i, int n)
{
// If all pairs procesed so no swapping needed return 0
if (i > n) return 0;
// If current pair is valid so DO NOT DISTURB this pair
// and move ahead.
if (pairs[arr[i]] == arr[i+1])
return minSwapsUtil(arr, pairs, index, i+2, n);
// If we reach here, then arr[i] and arr[i+1] don't form a pair
// Swap pair of arr[i] with arr[i+1] and recursively compute
// minimum swap required if this move is made.
int one = arr[i+1];
int indexone = index[pairs[arr[i]]]; // one should be placed at indexone and two should be placed at indextwo
int indextwo = i+1;
int two = arr[index[pairs[arr[i]]]];
swap(arr[i+1], arr[indexone]);
updateindex(index, one, indexone, two, indextwo);
int a = minSwapsUtil(arr, pairs, index, i+2, n);
// Backtrack to previous configuration. Also restore the
// previous indices, of one and two
swap(arr[i+1], arr[indexone]);
updateindex(index, one, indextwo, two, indexone);
one = arr[i], indexone = index[pairs[arr[i+1]]];
// Now swap arr[i] with pair of arr[i+1] and recursively
// compute minimum swaps required for the subproblem
// after this move
two = arr[index[pairs[arr[i+1]]]], indextwo = i;
swap(arr[i], arr[indexone]);
updateindex(index, one, indexone, two, indextwo);
int b = minSwapsUtil(arr, pairs, index, i+2, n);
// Backtrack to previous configuration. Also restore
// the previous indices, of one and two
swap(arr[i], arr[indexone]);
updateindex(index, one, indextwo, two, indexone);
// Return minimum of two cases
return 1 + min(a, b);
}
// Returns minimum swaps required
int minSwaps(int n, int pairs[], int arr[])
{
int index[2*n + 1]; // To store indices of array elements
// Store index of each element in array index
for (int i = 1; i <= 2*n; i++)
index[arr[i]] = i;
// Call the recursive function
return minSwapsUtil(arr, pairs, index, 1, 2*n);
}
// Driver program
int main()
{
// For simplicity, it is assumed that arr[0] is
// not used. The elements from index 1 to n are
// only valid elements
int arr[] = {0, 3, 5, 6, 4, 1, 2};
// if (a, b) is pair than we have assigned elements
// in array such that pairs[a] = b and pairs[b] = a
int pairs[] = {0, 3, 6, 1, 5, 4, 2};
int m = sizeof(arr)/sizeof(arr[0]);
int n = m/2; // Number of pairs n is half of total elements
// If there are n elements in array, then
// there are n pairs
cout << "Min swaps required is " << minSwaps(n, pairs, arr);
return 0;
}
| [
"avinash.kumar@seenit.in"
] | avinash.kumar@seenit.in |
6671e0baa02ee3b7afc02c1e20f7c2c2b843c33d | 80f2fa4f1f4d56eef9471174f80b62838db9fc3b | /xdl/xdl/core/ops/ps_ops/ps_mark_op.cc | b6d80e2c820465c9f6645017a9f39b5c14f22c2b | [
"Apache-2.0"
] | permissive | laozhuang727/x-deeplearning | a54f2fef1794274cbcd6fc55680ea19760d38f8a | 781545783a4e2bbbda48fc64318fb2c6d8bbb3cc | refs/heads/master | 2020-05-09T17:06:00.495080 | 2019-08-15T01:45:40 | 2019-08-15T01:45:40 | 181,295,053 | 1 | 0 | Apache-2.0 | 2019-08-15T01:45:41 | 2019-04-14T10:51:53 | PureBasic | UTF-8 | C++ | false | false | 3,955 | cc | /* Copyright 2018 Alibaba Group. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
==============================================================================*/
#include "ps-plus/client/partitioner/broadcast.h"
#include "ps-plus/client/partitioner/sparse.h"
#include "xdl/core/lib/status.h"
#include "xdl/core/framework/op_kernel.h"
#include "xdl/core/framework/op_define.h"
#include "xdl/core/framework/op_registry.h"
#include "xdl/core/ops/ps_ops/define_op.h"
#include "xdl/core/ops/ps_ops/convert_utils.h"
#include "xdl/core/ops/ps_ops/client.h"
#include "xdl/core/ops/ps_ops/var_type.h"
namespace xdl {
template <typename T>
class PsMarkOp : public xdl::OpKernelAsync {
public:
Status Init(OpKernelConstruction* ctx) override {
XDL_CHECK_STATUS(ctx->GetAttr("var_name", &var_name_));
XDL_CHECK_STATUS(ctx->GetAttr("pattern", &pattern_));
return Status::Ok();
}
void Compute(OpKernelContext* ctx, Callback done) override {
ps::client::BaseClient* client;
XDL_CHECK_STATUS_ASYNC(GetClient(&client), done);
Tensor ids;
XDL_CHECK_STATUS_ASYNC(ctx->GetInput(0, &ids), done);
ps::Tensor convert_ids;
XDL_CHECK_STATUS_ASYNC(
XDL2PS::ConvertTensor(ids, &convert_ids),
done);
Tensor t_i;
XDL_CHECK_STATUS_ASYNC(ctx->GetInput(1, &t_i), done);
int64_t i = t_i.Scalar<int64_t>();
std::vector<std::unique_ptr<ps::Data>>* outputs =
new std::vector<std::unique_ptr<ps::Data>>;
auto cb = [ctx, outputs, done](const ps::Status& st) {
delete outputs;
XDL_CHECK_STATUS_ASYNC(PS2XDL::ConvertStatus(st), done);
done(Status::Ok());
};
std::vector<ps::Tensor> id_vec = {convert_ids};
std::vector<std::string> name_vec = {var_name_};
std::vector<float> save_ratio_vec = {0.0};
std::vector<std::string> pattern_vec = {pattern_};
std::vector<int64_t> i_vec = {i};
ps::client::UdfData slice_udf("BuildHashSlice",
ps::client::UdfData(0),
ps::client::UdfData(3),
ps::client::UdfData(4),
ps::client::UdfData(5),
ps::client::UdfData(6));
ps::client::UdfData udf("ScalarIntegerLogger",
slice_udf,
ps::client::UdfData(1),
ps::client::UdfData(2));
std::vector<ps::client::Partitioner*> spliters{
new ps::client::partitioner::HashId,
new ps::client::partitioner::Broadcast,
new ps::client::partitioner::Broadcast,
new ps::client::partitioner::Broadcast,
new ps::client::partitioner::Broadcast,
new ps::client::partitioner::Broadcast,
new ps::client::partitioner::Broadcast};
client->Process(
udf, var_name_,
client->Args(id_vec, pattern_vec, i_vec, name_vec, save_ratio_vec, true, false),
spliters, {}, outputs, cb);
}
private:
std::string var_name_;
std::string pattern_;
VarType var_type_;
};
XDL_DEFINE_OP(PsMarkOp)
.Input("ids", "dtype")
.Input("i", DataType::kInt64)
.Attr("var_name", AttrValue::kString)
.Attr("pattern", AttrValue::kString)
.Attr("dtype", AttrValue::kDataType);
DEFINE_INT_OP(XDL_REGISTER_KERNEL(PsMarkOp, PsMarkOp<T>)
.Device("CPU")
.AttrDataType<T>("dtype"));
} // namespace xdl
| [
"yue.song@alibaba-inc.com"
] | yue.song@alibaba-inc.com |
fdffe7f13a976e297f287192cdc3ddeee62915a0 | 2475b2da49c916f46a1878d8fb8634735d835726 | /Sources/Infomap-0.15.7/src/io/ClusterReader.h | 95b722455806a1b9d69eab329b39d8e5715a3aa1 | [] | no_license | zackliscio/topicmapping | 2f5f608ff157c9ec825b140074e90fffb4d1adb5 | 79fad498d1401ea283504e67fb4d162a006e4586 | refs/heads/master | 2021-01-16T21:15:32.105205 | 2014-06-21T10:06:11 | 2014-06-21T10:06:11 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,488 | h | /**********************************************************************************
Infomap software package for multi-level network clustering
Copyright (c) 2013, 2014 Daniel Edler, Martin Rosvall
For more information, see <http://www.mapequation.org>
This file is part of Infomap software package.
Infomap software package is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
Infomap software package 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 Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with Infomap software package. If not, see <http://www.gnu.org/licenses/>.
**********************************************************************************/
#ifndef CLUSTERREADER_H_
#define CLUSTERREADER_H_
#include <vector>
#include <string>
using std::string;
class ClusterReader
{
public:
ClusterReader(unsigned int numNodes);
~ClusterReader();
void readData(const string filename);
const std::vector<unsigned int>& getClusterData() const
{
return m_clusterData;
}
private:
std::vector<unsigned int> m_clusterData;
};
#endif /* CLUSTERREADER_H_ */
| [
"arg.lanci@gmail.com"
] | arg.lanci@gmail.com |
5741585909a7ea6e88a7b29d0bc9d7467e3f78cb | d0c0b8542dbbb004a35433a1547c6f6f38a6adda | /Qt画面绘图demo/test2/tur_painter.h | 79a6b9f8182147c85f568ebb2d48682653c30398 | [] | no_license | yunwangzishu/ConfigurationSoftwareRuntimeSystem | f7726818309aaee79e654bb28026e06f8dad8af3 | dd10af7e520aa9232d674a53ceddb8deaf867c14 | refs/heads/master | 2022-11-19T07:58:52.640369 | 2020-07-11T03:24:23 | 2020-07-11T03:24:23 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 491 | h | #ifndef TUR_PAINTER_H
#define TUR_PAINTER_H
#include <QWidget>
#include <QPainter>
#include <QPen>
#include <qevent.h>
#include <QBrush>
#include "global.h"
class tur_painter : public QWidget
{
Q_OBJECT
public:
explicit tur_painter(QWidget *parent = 0);
~tur_painter();
signals:
void tur_update();
public slots:
protected:
void paintEvent(QPaintEvent *);
void timerEvent(QTimerEvent *);
int m_nTimerId;
};
#endif // TUR_PAINTER_H
| [
"851096514@qq.com"
] | 851096514@qq.com |
8c6a846c27eef5e81379ae6d2d5b8af98ebcc649 | bbff50d94efc9bc27a449fd5adcfde0a2ee3b5bf | /codechef/PRACTICE/HEADBOB.cpp | 7b33d2ae2c546f98dc740789305f4e11718432bc | [] | no_license | ameybhavsar24/competitive-programming | 389b1ffb9f3d11e18bb90b0bb03127086af2b1f0 | c9f74f4b9dba34b9d98d9e6c433d3d7890eaa63b | refs/heads/main | 2023-07-04T17:03:39.699518 | 2021-08-09T14:27:08 | 2021-08-09T14:27:08 | 379,605,431 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 479 | cpp | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
// your code goes here
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
string s;
cin >> s;
map<char,int> mp;
for (int i=0; i<(int)s.size();i++) {
mp[s[i]]++;
}
if (mp['Y'] > 0 && mp['I'] == 0) {
cout << "NOT INDIAN\n";
continue;
}
else if (mp['Y'] == 0 && mp['I'] > 0) {
cout << "INDIAN\n";
continue;
}
cout << "NOT SURE\n";
}
return 0;
}
| [
"28699912+ameybhavsar24@users.noreply.github.com"
] | 28699912+ameybhavsar24@users.noreply.github.com |
da0cba9d8cd8f7ffc93761db0f06cfb069451cf2 | 49b63657f846ae21103518992b7fc79c388dae92 | /1339_단어연습.cpp | ec0fa89efd0b7ef71243fabff74110a7093dc7d9 | [] | no_license | Longseabear/AlgorithmStudy | 4fc200425e52cff0b626227797e8cc196bd87bb2 | b1bc82b71a00f7388849f02a86c3fc5a134d7024 | refs/heads/master | 2020-03-27T00:23:11.732907 | 2018-08-21T21:02:57 | 2018-08-21T21:02:57 | 145,618,850 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 497 | cpp | #include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int mapping[26];
char c[11][10];
int main() {
int n, idx=0, sum=0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%s", c[i]);
int len = strlen(c[i]), digit = 1;
for (int j = len - 1; j >= 0; j--, digit*=10) mapping[c[i][j] - 'A'] += digit;
}
sort(mapping, mapping + 26, [](int a, int b){return a > b;});
while (mapping[idx]) {
sum += mapping[idx] * (9 - idx);
++idx;
}
printf("%d", sum);
} | [
"leap1568@gmail.com"
] | leap1568@gmail.com |
3e684864a0c195562f3635a85eeceacbf2da2e56 | 63ff954260ac9de2ac5420875f1bf7cf41eba2ff | /2019_06_30_Gunbird/2019_06_30_Gunbird/ObjectPicture.h | 1e62933bfd0711d273dfbe1d150f9ddb390e74c7 | [] | no_license | kmj91/kmj-api | 179b76e4d08c0654f074fadcfd8caae8832d7d7d | 9a65e7b395199f8058ad615a4377973f53604305 | refs/heads/master | 2021-05-18T12:56:44.498606 | 2020-04-16T13:49:56 | 2020-04-16T13:49:56 | 251,250,883 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 350 | h | #pragma once
#include "Object.h"
class ObjectPicture : public Object
{
public:
ObjectPicture(int iPosX, int iPosY, int iSpriteIndex, bool bOption = false);
virtual ~ObjectPicture();
virtual bool Action();
virtual void Draw();
private:
int m_iSpriteIndex;
bool m_bOption;
public:
bool m_bDrawFlag; // true 그림, false 안그림
};
| [
"lethita0302@gmail.com"
] | lethita0302@gmail.com |
1c5f9a59dc5f81ff0d046efe82b8fd8bf80742e8 | b963d6fa10cdefe047f2775e182a4144b6b86aba | /bbushnell_mdzurick_hlsyn/src/Output.cpp | f75dc8f3d8bf201dccd6e9f95cb483d5c3151bb1 | [] | no_license | bbushnell95/ECE474a_Assignment3 | f8aee43ec1d7cfb993c4d658ee9a07d96af40b45 | 75d56b5b4da854c878af78c4d36f727b903c824d | refs/heads/master | 2021-01-12T10:55:38.374888 | 2016-12-07T10:55:24 | 2016-12-07T10:55:24 | 72,758,047 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 585 | cpp | /*
Students: Brett Bushnell (Undergrad), Matt Dzurick (Grad)
Date Create: 10/17/2016
Assignment: 3
File: Output.cpp
Description: Output Class for hlsyn program
*/
#include "Output.h"
Output::Output()
{
name = "Unknown";
dataWidth = 0;
}
Output::Output(std::string n, bool s, int dW)
{
name = n;
signUnsigned = s;
dataWidth = dW;
}
//std::string Output::getName()
//{
// return name;
//}
//
//void Output::setName(std::string n)
//{
// name = n;
//}
//
//int Output::getDataWidth()
//{
// return dataWidth;
//}
//
//void Output::setDataWidth(int dW)
//{
// dataWidth = dW;
//}
| [
"bbushnell@email.arizona.edu"
] | bbushnell@email.arizona.edu |
7dc880657f1a57ec627fe62188d939ea9fb4de59 | 879dc5681a36a3df9ae5a7244fa2d9af6bd346d7 | /src/Boole1/Backup 1 of NuevoSC.cpp | 01753e9fa8700240f1ebdc34d65c2b6e7a46d262 | [
"BSD-3-Clause"
] | permissive | gachet/booledeusto | 9defdba424a64dc7cf7ccd3938d412e3e797552b | fdc110a9add4a5946fabc2055a533593932a2003 | refs/heads/master | 2022-01-18T21:27:26.810810 | 2014-01-30T15:20:23 | 2014-01-30T15:20:23 | null | 0 | 0 | null | null | null | null | ISO-8859-1 | C++ | false | false | 69,344 | cpp | //---------------------------------------------------------------------------
#include <vcl\vcl.h>
#pragma hdrstop
#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#include <shellapi.h>
#include <printers.hpp>
#include "NuevoSC.h"
#include "Libreria.h"
#include "Main.h"
#include "calc.h"
#include "TVComple.h"
#include "FormSimp.h"
#include "TVManual.h"
#include "SCCompac.h"
#include "FormasN.h"
#include "DinArray.h"
#include "VKar6.h"
#include "VKar6X.h"
#include "VKar5.h"
#include "VKar5X.h"
#include "VKar4.h"
#include "VKar4X.h"
#include "VKar3.h"
#include "VKar3X.h"
#include "ExpBool.h"
#include "app.h"
#include "Unit11.h"
#include "V_Circuito.h"
#include <vcl\Clipbrd.hpp>
#include "uTextoAsoc.h"
#include "mensajes.inc"
#include "uKarnaugh.h"
#include "claseJedec.h"
extern DinArray Tabla;
//Invocamos al constructor de la tabla
DinArray Tabla = DinArray();
//---------------------------------------------------------------------------
#pragma link "Grids"
#pragma resource "*.dfm"
TSistemaCombinacionalNuevo *SistemaCombinacionalNuevo;
//--------------------------------------------------------------------
bool ComprobarVariables ()
{
// comprobamos que haya algun valor válido en los números de variables
if ((SistemaCombinacionalNuevo->TablaEntrada->Enabled == true)
&& (SistemaCombinacionalNuevo->TablaSalida->Enabled == true))
{
AnsiString cadena;
/* si han cambiado el número de variables borramos la matriz
anterior y creamos una nueva */
if ( (Tabla.NumEntradas() != SistemaCombinacionalNuevo->NEntradas->Text)
|| (Tabla.NumColumnas() != SistemaCombinacionalNuevo->NSalidas->Text) )
{
Tabla.BorrarDinArray();
Tabla.DinX(SistemaCombinacionalNuevo->Edit1->Text.SubString(0,40),
(SistemaCombinacionalNuevo->TablaEntrada->RowCount),
(SistemaCombinacionalNuevo->TablaSalida->RowCount) );
}
else
/* sino solo volvemos a escribir los nombres de las varibales por si los
han cambiado */
{
Tabla.BorrarEntradas();
Tabla.BorrarSalidas();
}
//Reescribimos los identificativos del Sistema Combinacional
cadena = SistemaCombinacionalNuevo->Edit1->Text;
Tabla.EscribirNombre(cadena);
for (int i=0; i<(Tabla.NumEntradas()); i++)
{
cadena = SistemaCombinacionalNuevo->TablaEntrada->Cells[1][i] + " ";
Tabla.AnadirEntrada(cadena.SubString(1, 30));
}
for (int i=0; i<(Tabla.NumColumnas()); i++)
{
cadena = SistemaCombinacionalNuevo->TablaSalida->Cells[1][i] + " ";
Tabla.AnadirSalida(cadena.SubString(1, 30));
}
if (Trim(SistemaCombinacionalNuevo->Edit1->Text) != "")
{
return true;
}
else
{
Application->MessageBox(MENSAJE(msgNombreCircuito), NULL);
return false;
}
}
else
{
return false;
}
}
//---------------------------------------------------------------------------
__fastcall TSistemaCombinacionalNuevo::TSistemaCombinacionalNuevo(TComponent* Owner)
: TForm(Owner)
{
// ajustamos el tamaño de las celdas para los nombre de las variables
TablaEntrada->ColWidths[1] = TablaEntrada->Width - TablaEntrada->ColWidths[0];
TablaSalida->ColWidths[1] = TablaSalida->Width - TablaSalida->ColWidths[0];
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::NEntradasChange(TObject *Sender)
{
AnsiString cadena;
cadena = NEntradas->Text;
long numero = atol(cadena.c_str());
/* si el número de var. de entrada es aceptable activamos la tabla de
variables y le damos el tamño adecuado*/
if ((numero>0) & (numero<27))
{
TablaEntrada->Enabled = true;
TablaEntrada->Color = clWindow;
TablaEntrada->ColCount = 2;
TablaEntrada->RowCount = numero;
TablaEntrada->EditorMode = true;
for (char caracter = 'A'; caracter < ('A' + numero); caracter++)
{
TablaEntrada->Cells[0][caracter - 'A'] = caracter;
}
}
else
{
TablaEntrada->Enabled = false;
TablaEntrada->Color = clInactiveCaption;
TablaEntrada->RowCount = 1;
TablaEntrada->Cells[0][0] = ' ';
}
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::NSalidasChange(TObject *Sender)
{
AnsiString cadena;
cadena = NSalidas->Text;
long numero = atol(cadena.c_str());
/* si el número de var. de salida es aceptable activamos la tabla de
variables y le damos el tamño adecuado*/
if (numero>0)
{
TablaSalida->Enabled = true;
TablaSalida->Color = clWindow;
TablaSalida->RowCount = numero;
for (int i = 1; i <= numero; i++)
{
TablaSalida->Cells[0][i-1] = i;
}
}
else
{
TablaSalida->Enabled = false;
TablaSalida->Color = clInactiveCaption;
TablaSalida->RowCount = 1;
TablaSalida->Cells[0][0] = ' ';
}
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::TVManualClick(TObject *Sender)
{
if (ComprobarVariables())
{
TablaVerdadCompleta->Show();
//SistemaCombinacionalNuevo->Hide();
}
else
{
Application->MessageBox(MENSAJE(msgNumeroVariables), NULL);
}
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::SalirClick(TObject *Sender)
{
for(int i=0; i < TablaEntrada->RowCount; i++)
{
TablaEntrada->Cells[1][i] = "";
}
TablaEntrada->RowCount = 1;
TablaEntrada->Enabled = false;
TablaEntrada->Color = clInactiveCaption;
for(int i=0; i < TablaSalida->RowCount; i++)
{
TablaSalida->Cells[1][i] = "";
}
TablaSalida->RowCount = 1;
TablaSalida->Enabled = false;
TablaSalida->Color = clInactiveCaption;
Tabla.BorrarDinArray();
Edit1->Text = "";
NEntradas->Text = "";
NSalidas->Text = "";
Principal->Show();
SistemaCombinacionalNuevo->Hide();
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::FNPOSClick(TObject *Sender)
{
if (ComprobarVariables())
{
SCFormasCompactas->Caption = MENSAJE(msgExpresionPOS);
SCFormasCompactas->Conjuntivo->Checked = false;
SCFormasCompactas->Conjuntivo->Enabled = false;
SCFormasCompactas->Disyuntivo->Checked = true;
SCFormasCompactas->Disyuntivo->Enabled = true;
SCFormasCompactas->Show();
//SistemaCombinacionalNuevo->Hide();
}
else
{
Application->MessageBox(MENSAJE(msgNumeroVariables), NULL);
}
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::FNSOPClick(TObject *Sender)
{
if (ComprobarVariables())
{
SCFormasCompactas->Caption = MENSAJE(msgExpresionSOP);
SCFormasCompactas->Conjuntivo->Checked = true;
SCFormasCompactas->Conjuntivo->Enabled = true;
SCFormasCompactas->Disyuntivo->Checked = false;
SCFormasCompactas->Disyuntivo->Enabled = false;
SCFormasCompactas->Show();
//SistemaCombinacionalNuevo->Hide();
}
else
{
Application->MessageBox(MENSAJE(msgNumeroVariables), NULL);
}
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::TVCompactaClick(TObject *Sender)
{
if (ComprobarVariables())
{
if (Tabla.LeerDinArray(0,0) == ' ')
{
TablaVerdadManual->Show();
//SistemaCombinacionalNuevo->Hide();
}
else
Application->MessageBox(MENSAJE(msgYaExisteNoVerCompacta), "");
}
else
{
Application->MessageBox(MENSAJE(msgNumeroVariables), NULL);
}
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::FormShow(TObject *Sender)
{
fTextoAsoc->txAsociado->Clear();
NEntradas->Text = Tabla.NumEntradas();
NSalidas->Text = Tabla.NumColumnas();
Edit1->Text = Tabla.LeerNombre();
for (int i = 0; i < Tabla.NumEntradas(); i++)
{
TablaEntrada->Cells[1][i] = Tabla.LeerEntrada(i);
}
for (int i = 0; i < Tabla.NumColumnas(); i++)
{
TablaSalida->Cells[1][i] = Tabla.LeerSalida(i);
}
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::ExpBooleanaClick(TObject *Sender)
{
if (ComprobarVariables())
{
if (Tabla.LeerDinArray(0,0) == ' ')
{
ExprBooleana->Show();
//SistemaCombinacionalNuevo->Hide();
}
else
//ShowMessage ("El sistema ya existe, elija las expresiones simplificadas SOP o POS");
/* Calculando->Label2->Caption="\nEl sistema ya existe.\nSi introduce una nueva ecuación booleana el sistema se borrará.";
Calculando->B1->Visible=true;
Calculando->B2->Visible=true;
Calculando->ShowModal();
Calculando->B1->Visible=false;
Calculando->B2->Visible=false;
*/
if (Application->MessageBox(MENSAJE(msgNuevaEcBooleana), NULL, MB_YESNO)==IDYES){
ExprBooleana->Show();
}
}
else
{
Application->MessageBox(MENSAJE(msgNumeroVariables), NULL);
}
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::GuardarClick(TObject *Sender)
{
AnsiString temp="";
TStringList *Lista = new TStringList;
//Invocamos a una función para comprobar que se ha creado el objeto
if (ComprobarVariables())
if (Tabla.LeerDinArray(0,0) != ' ')
{
/* guardamos el objeto en un fichero, es decir guardamos los valores
que nos interesan en un fichero */
if (Guardador->Execute())
{
Lista->Add(Tabla.LeerNombre());
Lista->Add(Tabla.NumEntradas());
for(int i=0; i < Tabla.NumEntradas();i++)
{
Lista->Add(Tabla.LeerEntrada(i));
}
Lista->Add(Tabla.NumColumnas());
for(int i=0; i < Tabla.NumColumnas();i++)
{
Lista->Add(Tabla.LeerSalida(i));
}
for (int i=0; i< Tabla.NumColumnas(); i++)
{
for (int j=0; j< Tabla.NumFilas(); j++)
{
temp = temp + Tabla.LeerDinArray(j,i);
}
Lista->Add(temp);
temp = "";
}
Application->MessageBox(MENSAJE(msgSCGuardadoFichero), "");
Lista->SaveToFile(Guardador->FileName);
}
//Ahora funciona cojonudamente sin utilizar el control TMemo y usando un
//objeto de tipo TStringList
}
else
Application->MessageBox(MENSAJE(msgSCTodaviaNoCreado), NULL);
else
Application->MessageBox(MENSAJE(msgNumVarsIncorrecto), NULL);
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::btApExprBoolClick(TObject *Sender)
{
if ( ComprobarVariables() )
{
if (Tabla.LeerDinArray(0,0) != ' ')
{
ap->ShowModal();
}
else
Application->MessageBox(MENSAJE(msgSCTodaviaNoCreado), NULL);
}
else
{
Application->MessageBox(MENSAJE(msgNumVarsIncorrecto), NULL);
}
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::Button2Click(TObject *Sender)
{
if (ComprobarVariables())
{
FormasNormales->Caption = MENSAJE(msgFormaDisyun);
FormasNormales->Conjuntivo->Checked = false;
FormasNormales->Conjuntivo->Enabled = false;
FormasNormales->Disyuntivo->Checked = true;
FormasNormales->Disyuntivo->Enabled = true;
FormasNormales->Show();
//SistemaCombinacionalNuevo->Hide();
}
else
{
Application->MessageBox(MENSAJE(msgNumeroVariables), NULL);
}
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::Button3Click(TObject *Sender)
{
if (ComprobarVariables())
{
FormasNormales->Caption = MENSAJE(msgFormaConjun);
FormasNormales->Conjuntivo->Checked = true;
FormasNormales->Conjuntivo->Enabled = true;
FormasNormales->Disyuntivo->Checked = false;
FormasNormales->Disyuntivo->Enabled = false;
FormasNormales->Show();
//SistemaCombinacionalNuevo->Hide();
}
else
{
Application->MessageBox(MENSAJE(msgNumeroVariables), NULL);
}
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::CargarClick(TObject *Sender)
{
TStringList *Lista = new TStringList;
AnsiString Prueba;
//int numerofilas;
int numerocolumnas;
if (Cargador->Execute())
{ //Capturamos interrupcion en caso de que exista un error
try {
Lista->LoadFromFile(Cargador->FileName);
}//Ahora el sistema esta en el objeto de tipo TStringList
catch(...)
{
Application->MessageBox(MENSAJE(msgErrorCargar), NULL);
}
}
Edit1->Text = Lista->Strings[0];
NEntradas->Text = Lista->Strings[1];
int j = atol(NEntradas->Text.c_str()) + 2;
for ( int i = 2; i < j; i++)
{
//Escribimos en el grid los nombres de las variables de entrada
TablaEntrada->Cells[1][i-2] = Lista->Strings[i];
}
NSalidas->Text = Lista->Strings[j];
int i = j +1;
int paso = i;
j = j + atol(NSalidas->Text.c_str());
//int i = j;
for (i ; i <= j;i++)
{ //Escribimos en el grid los nombres de las variables de salida
TablaSalida->Cells[1][i-paso] = Lista->Strings[i];
}
// La variable i contiene la posicion donde empiezan los valores de
// la tabla
//Ahora escribimos los datos en el objeto
Tabla.DinX(Edit1->Text.SubString(0,40),
(TablaEntrada->RowCount),
(TablaSalida->RowCount) );
//Y por ultimo escribimos los datos de la(s) salida(s)
// numerofilas = atol(NEntradas->Text.c_str());
numerocolumnas = atol(NSalidas->Text.c_str());
//Ahora tenemos que coger las cadenas que contienen los datos y
//escribirlas en la Tabla
AnsiString temp;
for (int k=1 ; (k <= numerocolumnas); k++ )
{
for (int l = 1; l <= Tabla.NumFilas(); l++)
{
temp= Lista->Strings[i].SubString(l,1).c_str();
char *valor = temp.c_str();
Tabla.EscribirDinArray(l-1, k-1, *valor);
}
i= i +1;
}
Application->MessageBox(MENSAJE(msgSCCargadoFichero), "");
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::SOPSimpClick(TObject *Sender)
{
if (ComprobarVariables())
{
if (Tabla.LeerDinArray(0,0) != ' ')
{
ExpresionSimp->POS->Checked = false;
ExpresionSimp->btKarnaugh->Visible=true;
ExpresionSimp->Caption = MENSAJE(msgExprSOPSimpl);
ExpresionSimp->Show();
}
else
Application->MessageBox(MENSAJE(msgSCTodaviaNoCreado), NULL);
}
else
{
Application->MessageBox(MENSAJE(msgNumeroVariables), NULL);
}
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::POSSimpClick(TObject *Sender)
{
if (ComprobarVariables())
{
if (Tabla.LeerDinArray(0,0) != ' ')
{
//Calculando->Label2->Caption="\nCalculando expresión simplificada POS.";
//Calculando->Show();
ExpresionSimp->POS->Checked = true;
ExpresionSimp->btKarnaugh->Visible=true;
//Calculando->Repaint();
ExpresionSimp->Caption = MENSAJE(msgExprPOSSimpl);
ExpresionSimp->Show();
//ShowMessage->Hide();
// SistemaCombinacionalNuevo->Hide();
}
else
Application->MessageBox(MENSAJE(msgSCTodaviaNoCreado), NULL);
}
else
{
Application->MessageBox(MENSAJE(msgNumeroVariables), NULL);
}
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::ImprimirClick(TObject *Sender)
{
int m = 10;
TStringList *Lista = new TStringList;
if ( ComprobarVariables() )
{
Lista->Add(ANSIMENSAJE(msgNombreSC)+" : " + Tabla.LeerNombre());
Lista->Add("");
Lista->Add(ANSIMENSAJE(msgVarsEntrada)+" : ");
//Escribimos las cabeceras de la hoja diciendo cuales son la variable de entrada
AnsiString temp = "";
for ( int i = 0; i < Tabla.NumEntradas() ; i++)
{
temp = " ";
temp = temp + char('A' + i);
temp = temp + " = ";
temp = temp + Tabla.LeerEntrada(i);
Lista->Add(temp);
}
Lista->Add("");
Lista->Add(ANSIMENSAJE(msgVarsSalida)+" : ");
for ( int i = 0; i < Tabla.NumColumnas() ; i++)
{
temp = " F";
temp = temp + (i + 1);
temp = temp + " = ";
temp = temp + Tabla.LeerSalida(i);
Lista->Add(temp);
}
Lista->Add("");
//Ahora escribimos los nombres genericos de las vbles. de entrada y salida
temp = "";
for ( int i = 0 ; i < Tabla.NumEntradas(); i++ )
{
temp = temp + char('A' + i);
temp = temp + " ";
}
temp = temp + " ";
for ( int i = 0 ; i < Tabla.NumColumnas(); i++ )
{
temp = temp + "F";
temp = temp + (i+1);
temp = temp + " ";
}
Lista->Add(temp);
//Accedemos al objeto para leer sus verdaderos valores
for ( int i=0; i < Tabla.NumFilas(); i++ )
{
temp = "";
AnsiString paso = CalcularBinario(i,Tabla.NumEntradas());
for ( int j=1 ; j <= paso.Length(); j++ )
{
temp = temp + paso.SubString(j,1);
temp = temp + " ";
}
temp = temp + " ";
for ( int j=0 ;j < Tabla.NumColumnas(); j++ )
{
temp = temp + Tabla.LeerDinArray(i,j);
temp = temp + " ";
}
Lista->Add(temp);
}
//Pasamos el contenido del StringList al control TMemo para poder imprimirlo
CTexto->Text = Lista->Text;
ShowMessage(Lista->Text);
if ( impresora->Execute())
{
Printer()->Title = Tabla.LeerNombre();
Printer()->BeginDoc();
for ( int n = 0; n < CTexto->Lines->Count; n++ )
{
Printer()->Canvas->TextOut(10, m, CTexto->Lines->Strings[n]);
m += Printer()->Canvas->TextHeight("XXX");
if ( m + Printer()->Canvas->TextHeight("XXX") > Printer()->PageHeight )
{
Printer()->NewPage();
m = 10;
}
}
Printer()->EndDoc();
}
}
else
Application->MessageBox(MENSAJE(msgSCTodaviaNoCreado), NULL);
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::GuardarPLDClick(TObject *Sender)
{
//Guardamos los datos del sistema en formato PLD para escribirse en un CI
//Tendrá extension *.pld y se escribira en forma de funciones booleanas
//simplificadas SOP
AnsiString temp="";
TStringList *Lista = new TStringList;
//Invocamos a una función para comprobar que se ha creado el objeto
if (ComprobarVariables())
if (Tabla.LeerDinArray(0,0) != ' ')
{
/* guardamos el objeto en un fichero, es decir guardamos los valores
que nos interesan en un fichero */
GuardaPLD->Filter=MENSAJE(msgFiltroPLD);
if (GuardaPLD->Execute())
{
Lista->Add("|?"); //Escribimos cabecera del fichero
//preparamos para escribir los nombres de todas las variables
temp = "|in:(";
for ( int i = 0; i < Tabla.NumEntradas(); i ++)
{
//Si la entrada no tiene nombre se le asigna uno genérico
if (Tabla.LeerEntrada(i) == "")
{
temp = temp + char('A' + i);
}
temp = temp + Tabla.LeerEntrada(i);
temp = temp + ",";
}
temp.Delete(temp.Length(),1);
temp.Insert(")",temp.Length()+1);
//despues de escribir las varables de entrada escribimos las
//de las salidas
temp = temp + ",out:(";
for (int i=0; i < Tabla.NumColumnas();i++)
{
//Esto no funciona correctamente
if (Tabla.LeerSalida(i) == "")
{
temp = temp + "F";
temp = temp + (i+1);
}
temp = temp + Tabla.LeerSalida(i);
temp = temp + ",";
}
temp.Delete(temp.Length(),1);
temp.Insert(")",temp.Length()+1);
Lista->Add(temp);
//Ahora escribimos las funciones simplificadas
ExpresionSimp->StringGrid1->RowCount = Tabla.NumColumnas();
ExpresionSimp->POS->Checked = false;
// Recogemos los valores de la tabla para hacer la simplificacion
for (int l=0; l<Tabla.NumColumnas(); l++)
{
Form11->Unos->Text = "";
Form11->Equis->Text = "";
ExpresionSimp->StringGrid1->Cells[0][l] = "";
for (int i = 0; i<Tabla.NumFilas(); i++)
{
if ( ((Tabla.LeerDinArray(i,l) == '1') & (ExpresionSimp->POS->Checked == false)) |
((Tabla.LeerDinArray(i,l) == '0') & (ExpresionSimp->POS->Checked == true)) )
{
Form11->Unos->Text = Form11->Unos->Text + i + ",";
}
else if (Tabla.LeerDinArray(i,l) == 'X')
{
Form11->Equis->Text = Form11->Equis->Text + i + ",";
}
}
Form11->Button1->Click();
//Despues de mandar los valores a la función de simplificación
//los recogemos en el StringGrid de Salida donde se visualizaran
AnsiString cadenaSimp = Form11->Solucion->Text;
int x = 1;
int y = 1;
//Ahora completamos los resultados con ceros para que tengan la misma
//longitud
while ( x <= cadenaSimp.Length() )
{
if ( cadenaSimp.SubString(x,1) == "," )
{
if ( (x-y) < Tabla.NumEntradas() )
{
for ( int i=0; i < (x-y);i++)
{
cadenaSimp.Insert("0",y);
x = x +1;
}
}
x = x + 1;
y = x;
}
else
x = x + 1;
}
x = 1;
y = 1;
//Con esto transformamos la cadena de salida en letras
//tenemos que coger los verdaderos nombres de las variables
while ( x <= cadenaSimp.Length() )
{
if ( cadenaSimp.SubString(x,1) == "1" )
{
cadenaSimp.Delete(x,1);
cadenaSimp.Insert(char('A' - 1 + y),x);
cadenaSimp.Insert("&",x +1);
x = x + 2;
y = y + 1;
}
else if (cadenaSimp.SubString(x,1) == "0")
{
cadenaSimp.Delete(x,1);
cadenaSimp.Insert("!&",x);
cadenaSimp.Insert(char('A' - 1 + y),x+1);
x = x + 3;
y = y + 1;
}
else if (cadenaSimp.SubString(x,1) == "-")
{
cadenaSimp.Delete(x,1);
y = y + 1;
}
else
{
cadenaSimp.Delete(x-1,2);
cadenaSimp.Insert(")#(",x-1);
x = x + 2;
y = 1;
}
}
cadenaSimp.Delete(cadenaSimp.Length(),1);
cadenaSimp.Insert("(" , 1);
cadenaSimp = cadenaSimp + ")";
temp = "";
temp = "|";
if ( Tabla.LeerSalida(l) == "" )
{
temp = temp + "F";
temp = temp + (l+1);
}
else
{
temp = temp + Tabla.LeerSalida(l);
}
temp = temp + "=" + cadenaSimp;
temp = NombresCompletos(temp);
Lista->Add(temp);
}
Lista->SaveToFile(GuardaPLD->FileName);
}
}
else
Application->MessageBox(MENSAJE(msgSCTodaviaNoCreado), NULL);
else
Application->MessageBox(MENSAJE(msgNumVarsIncorrecto), NULL);
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::SalvarSCOClick(TObject *Sender)
{
AnsiString temp="";
TStringList *Lista = new TStringList;
//Invocamos a una función para comprobar que se ha creado el objeto
if (ComprobarVariables())
if (Tabla.LeerDinArray(0,0) != ' ')
{
/* guardamos el objeto en un fichero, es decir guardamos los valores
que nos interesan en un fichero */
if (Guardador->Execute())
{
Lista->Add(Tabla.LeerNombre());
Lista->Add(Tabla.NumEntradas());
for(int i=0; i < Tabla.NumEntradas();i++)
{
Lista->Add(Tabla.LeerEntrada(i));
}
Lista->Add(Tabla.NumColumnas());
for(int i=0; i < Tabla.NumColumnas();i++)
{
Lista->Add(Tabla.LeerSalida(i));
}
for (int i=0; i< Tabla.NumColumnas(); i++)
{
for (int j=0; j< Tabla.NumFilas(); j++)
{
temp = temp + Tabla.LeerDinArray(j,i);
}
Lista->Add(temp);
temp = "";
}
Application->MessageBox(MENSAJE(msgSCGuardadoFichero), "");
Lista->SaveToFile(Guardador->FileName);
fTextoAsoc->txAsociado->Lines->SaveToFile(Guardador->FileName + ".txt");
}
//Ahora funciona cojonudamente sin utilizar el control TMemo y usando un
//objeto de tipo TStringList
}
else
Application->MessageBox(MENSAJE(msgSCTodaviaNoCreado), NULL);
else
Application->MessageBox(MENSAJE(msgNumVarsIncorrecto), NULL);
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::ImprimirDocClick(TObject *Sender)
{
Imprimir(IMPRESORA);
}
void Imprimir(int destino)
{
int m = 10;
TStringList *Lista = new TStringList;//StringList para tabla de verdad
TStringList *Lista2 = new TStringList;//StringList para diagramas VK
TStringList *Lista3 = new TStringList;//StringList para expresiones simplificadas
TStringList *Lista4 = new TStringList;//StringList para formas normales
if ( ComprobarVariables() )
{
//Lista->Add("NOMBRE DEL SISTEMA COMBINACIONAL: " + Tabla.LeerNombre());
Lista->Add("");
Lista->Add(fTextoAsoc->txAsociado->Lines->Text);
Lista->Add("");
Lista->Add(ANSIMENSAJE(msgVarsEntrada)+" : ");
Lista->Add("");
//Escribimos las cabeceras de la hoja diciendo cuales son la variable de entrada
AnsiString temp = "";
for ( int i = 0; i < Tabla.NumEntradas() ; i++)
{
temp = " ";
temp = temp + char('A' + i);
temp = temp + " = ";
temp = temp + Tabla.LeerEntrada(i);
Lista->Add(temp);
}
Lista->Add("");
Lista->Add(ANSIMENSAJE(msgVarsSalida)+" : ");
Lista->Add("");
for ( int i = 0; i < Tabla.NumColumnas() ; i++)
{
temp = " F";
temp = temp + (i + 1);
temp = temp + " = ";
temp = temp + Tabla.LeerSalida(i);
Lista->Add(temp);
}
Lista->Add("");
Lista->Add("");
Lista->Add(ANSIMENSAJE(msgTablaVerdad));
Lista->Add("");
//Ahora escribimos los nombres genericos de las vbles. de entrada y salida
temp = "";
for ( int i = 0 ; i < Tabla.NumEntradas(); i++ )
{
temp = temp + char('A' + i);
temp = temp + " ";
}
temp = temp + " ";
for ( int i = 0 ; i < Tabla.NumColumnas(); i++ )
{
temp = temp + "F";
temp = temp + (i+1);
temp = temp + " ";
}
Lista->Add(temp);
//Accedemos al objeto para leer sus verdaderos valores
for ( int i=0; i < Tabla.NumFilas(); i++ )
{
temp = "";
AnsiString paso = CalcularBinario(i,Tabla.NumEntradas());
for ( int j=1 ; j <= paso.Length(); j++ )
{
temp = temp + paso.SubString(j,1);
temp = temp + " ";
}
temp = temp + " "; ///////<<--
for ( int j=0 ;j < Tabla.NumColumnas(); j++ )
{
temp = temp + Tabla.LeerDinArray(i,j);
temp = temp + " ";
}
Lista->Add(temp);
}
//Aqui empieza el tratamiento para sacar los diagramas de Veitch-Karnaugh
Lista->Add("");
Lista->Add("");
Lista->Add(ANSIMENSAJE(msgDiagramasVK));
Lista->Add("");
temp = "";
switch (Tabla.NumEntradas())
{
case 3 :
{
AnsiString comb="000010110100001011111101";
AnsiString funcion;
for ( int f= 0; f<Tabla.NumColumnas(); f++)
{
int posicion = 1;
///////////////////////////////////////////////////////////////////
funcion = "F";
funcion = funcion + (f+1) + " - " + Tabla.LeerSalida(f);
Lista2->Add(funcion);
Lista2->Add("");
///////////////////////////////////////////////////////////////////
//Para cada funcion de salida escribimos las cabeceras
Lista2->Add(" AB");
Lista2->Add("C 00 01 11 10");
temp = " 0 ";
for (int i=0; i < 4; i++)
{
temp = temp + Tabla.LeerDinArray(binario(comb.SubString(posicion,3)),f );
temp = temp + " ";
posicion = posicion + 3;
}
Lista2->Add(temp);
temp = " 1 ";
//posicion = 1;
for (int i=0; i < 4; i++)
{
temp = temp + Tabla.LeerDinArray(binario(comb.SubString(posicion,3)),f );
temp = temp + " ";
posicion = posicion + 3;
}
Lista2->Add(temp);
Lista2->Add("");
Lista2->Add("");
}
break;
}
case 4 :
{
AnsiString filas = "00011110";
AnsiString cols = "00011110";
AnsiString funcion;
for ( int f= 0; f<Tabla.NumColumnas(); f++)
{
funcion = "F";
funcion = funcion + (f+1) + " - " + Tabla.LeerSalida(f);
Lista2->Add(funcion);
Lista2->Add("");
//
AnsiString temp;
AnsiString valor;
int posicion = 1;
//Para cada funcion de salida escribimos las cabeceras
Lista2->Add(" AB");
Lista2->Add("CD 00 01 11 10");
for (int i=1; i <= 8; i=i+2)
{
temp = " " + cols.SubString(i,2);////<<<----
for (int j=1; j <=8; j=j+2)
{
valor = filas.SubString(j,2) + cols.SubString(i,2);
temp = temp + " ";
temp = temp + Tabla.LeerDinArray(binario(valor),f );
}
Lista2->Add(temp);
}
Lista2->Add("");
Lista2->Add("");
}
break;
}
case 5 :
{
AnsiString filas = "000001011010110111101100";
AnsiString cols = "00011110";
AnsiString funcion;
for ( int f= 0; f<Tabla.NumColumnas(); f++)
{
funcion = "F";
funcion = funcion + (f+1) + " - " + Tabla.LeerSalida(f);
Lista2->Add(funcion);
Lista2->Add("");
//
AnsiString temp;
AnsiString valor;
int posicion = 1;
//Para cada funcion de salida escribimos las cabeceras
Lista2->Add(" ABC");
Lista2->Add("DE 000 001 011 010 110 111 101 100");
for (int i=1; i <= 8; i=i+2)
{
temp = " " + cols.SubString(i,2); ////<<<<------
for (int j=1; j <=24; j=j+3)
{
valor = filas.SubString(j,3) + cols.SubString(i,2);
temp = temp + " ";
temp = temp + Tabla.LeerDinArray(binario(valor),f );
}
Lista2->Add(temp);
}
Lista2->Add("");
Lista2->Add("");
}
break;
}
case 6 :
{
AnsiString filas = "000001011010110111101100";
AnsiString cols = "000001011010110111101100";
AnsiString funcion;
for ( int f= 0; f<Tabla.NumColumnas(); f++)
{
funcion = "F";
funcion = funcion + (f+1) + " - " + Tabla.LeerSalida(f);
Lista2->Add(funcion);
Lista2->Add("");
//
AnsiString temp;
AnsiString valor;
int posicion = 1;
//Para cada funcion de salida escribimos las cabeceras
Lista2->Add(" ABC");
Lista2->Add("DEF 000 001 011 010 110 111 101 100");
for (int i=1; i <= 24; i=i+3)
{
temp = cols.SubString(i,3) + " ";
for (int j=1; j <=24; j=j+3)
{
valor = filas.SubString(j,3) + cols.SubString(i,3);
temp = temp + " ";
temp = temp + Tabla.LeerDinArray(binario(valor),f );
}
Lista2->Add(temp);
}
Lista2->Add("");
Lista2->Add("");
}
break;
}
}
//Aqui termina el codigo para imprimir los diagramas de Veitch-Karnaugh
//Aqui empieza el codigo para imprimir las formas normales
Lista4->Add(ANSIMENSAJE(msgFormasNormales));
Lista4->Add("");
Lista4->Add(ANSIMENSAJE(msgFormaDisyun));
Lista4->Add("");
char paso = ' ';
String funcion = " ";
String cadenaForma = " ";
for (int j=0; j<Tabla.NumColumnas(); j++)
{
funcion = "F";
funcion = funcion + (j+1) + ": ";
cadenaForma = funcion;
for (int i = 0; i<Tabla.NumFilas(); i++)
{
if ((Tabla.LeerDinArray(i,j) == '1'))
{
//Esta condicion es para incluir comas entre los numeros
if (paso != ' '){
cadenaForma = cadenaForma + ", ";
}
paso = '-';
cadenaForma = cadenaForma + i;
}
}
paso = ' ';
Lista4->Add(cadenaForma);
}
Lista4->Add("");
Lista4->Add(ANSIMENSAJE(msgFormaConjun));
Lista4->Add("");
for (int j=0; j<Tabla.NumColumnas(); j++)
{
funcion = "F";
funcion = funcion + (j+1) + ": ";
cadenaForma = funcion;
for (int i = 0; i<Tabla.NumFilas(); i++)
{
if ((Tabla.LeerDinArray(i,j) == '0'))
{
//Esta condicion es para incluir comas entre los numeros
if (paso != ' '){
cadenaForma = cadenaForma + ", ";
}
cadenaForma = cadenaForma + i;
paso = '-';
}
}
paso = ' ';
Lista4->Add(cadenaForma);
}
Lista4->Add("");
Lista4->Add("");
Lista4->Add(ANSIMENSAJE(msgTerminosIrrelevantes));
Lista4->Add("");
for (int j=0; j<Tabla.NumColumnas(); j++)
{
funcion = "F";
funcion = funcion + (j+1) + ": ";
cadenaForma = funcion;
for (int i = 0; i<Tabla.NumFilas(); i++)
{
if ((Tabla.LeerDinArray(i,j) == 'X'))
{
//Esta condicion es para incluir comas entre los numeros
if (paso != ' '){
cadenaForma = cadenaForma + ", ";
}
paso = '-';
cadenaForma = cadenaForma + i;
}
}
paso = ' ';
Lista4->Add(cadenaForma);
}
//Aqui acaba el codigo para imprimir las formas normales
//Aqui empieza el código para imprimir las expresiones simplificadas SOP
TStringList *ListaSOP = new TStringList;
Form11->NumC->Text = Tabla.NumEntradas();
ListaSOP->Add("");
ListaSOP->Add("");
ListaSOP->Add(ANSIMENSAJE(msgExprsSOPSimpl));
ListaSOP->Add("");
// Recogemos los valores de la tabla para hacer la simplificacion
for (int l=0; l<Tabla.NumColumnas(); l++)
{
Form11->Unos->Text = "";
Form11->Equis->Text = "";
for (int i = 0; i<Tabla.NumFilas(); i++)
{
if (Tabla.LeerDinArray(i,l) == '1')
{
Form11->Unos->Text = Form11->Unos->Text + i + ",";
}
else if (Tabla.LeerDinArray(i,l) == 'X')
{
Form11->Equis->Text = Form11->Equis->Text + i + ",";
}
}
Form11->Button1->Click();
//Despues de mandar los valores a la función de simplificación
//los recogemos en el StringGrid de Salida donde se visualizaran
AnsiString cadenaSimp = Form11->Solucion->Text;
AnsiString cadenaLlena;
for (int i=1; i<=Tabla.NumEntradas(); i++)
{
cadenaLlena = cadenaLlena + "-";
}
if (cadenaSimp == "")
cadenaSimp = "0";
else if (cadenaSimp == cadenaLlena)
cadenaSimp = "1";
else
{
int x = 1;
int y = 1;
// Con esto transformamos la cadena de salida en letras
while ( x <= cadenaSimp.Length() )
{
if ( cadenaSimp.SubString(x,1) == "1" )
{
cadenaSimp.Delete(x,1);
cadenaSimp.Insert(char('A' - 1 + y),x);
cadenaSimp.Insert("*",x +1);
x = x + 2;
y = y + 1;
}
else if (cadenaSimp.SubString(x,1) == "0")
{
cadenaSimp.Delete(x,1);
cadenaSimp.Insert("~*",x);
cadenaSimp.Insert(char('A' - 1 + y),x+1);
x = x + 3;
y = y + 1;
}
else if (cadenaSimp.SubString(x,1) == "-")
{
cadenaSimp.Delete(x,1);
y = y + 1;
}
else
{
cadenaSimp.Delete(x-1,2);
cadenaSimp.Insert(")+(",x-1);
x = x + 2;
y = 1;
}
}
cadenaSimp.Delete(cadenaSimp.Length(),1);
cadenaSimp.Insert("(" , 1);
cadenaSimp = cadenaSimp + ")";
}
AnsiString funcion;
funcion = "F";
funcion = funcion + l + " : ";
cadenaSimp = funcion + cadenaSimp;
ListaSOP->Add(cadenaSimp);
ListaSOP->Add("");
//Escribimos el resultado en el StringGrid para visualizarlo
}
//Aqui termina el codigo para imprimir las expresiones simplificadas SOP
//Aqui empieza el codigo para imprimir las expresiones simplificadas POS
TStringList *ListaPOS = new TStringList;
Form11->NumC->Text = Tabla.NumEntradas();
ListaPOS->Add("");
ListaPOS->Add(ANSIMENSAJE(msgExprsPOSSimpl));
ListaPOS->Add("");
// Recogemos los valores de la tabla para hacer la simplificacion
for (int l=0; l<Tabla.NumColumnas(); l++)
{
Form11->Unos->Text = "";
Form11->Equis->Text = "";
for (int i = 0; i<Tabla.NumFilas(); i++)
{
if (Tabla.LeerDinArray(i,l) == '0')
{
Form11->Unos->Text = Form11->Unos->Text + i + ",";
}
else if (Tabla.LeerDinArray(i,l) == 'X')
{
Form11->Equis->Text = Form11->Equis->Text + i + ",";
}
}
Form11->Button1->Click();
//Despues de mandar los valores a la función de simplificación
//los recogemos en el StringGrid de Salida donde se visualizaran
AnsiString cadenaSimp = Form11->Solucion->Text;
AnsiString cadenaLlena;
for (int i=1; i<=Tabla.NumEntradas(); i++)
{
cadenaLlena = cadenaLlena + "-";
}
if (cadenaSimp == "")
cadenaSimp = "1";
else if (cadenaSimp == cadenaLlena)
cadenaSimp = "0";
else
{
int x = 1;
int y = 1;
// Con esto transformamos la cadena de salida en letras
while ( x <= cadenaSimp.Length() )
{
if ( cadenaSimp.SubString(x,1) == "1" )
{
cadenaSimp.Delete(x,1);
cadenaSimp.Insert(char('A' - 1 + y),x);
cadenaSimp.Insert("*",x +1);
x = x + 2;
y = y + 1;
}
else if (cadenaSimp.SubString(x,1) == "0")
{
cadenaSimp.Delete(x,1);
cadenaSimp.Insert("~*",x);
cadenaSimp.Insert(char('A' - 1 + y),x+1);
x = x + 3;
y = y + 1;
}
else if (cadenaSimp.SubString(x,1) == "-")
{
cadenaSimp.Delete(x,1);
y = y + 1;
}
else
{
cadenaSimp.Delete(x-1,2);
cadenaSimp.Insert(")+(",x-1);
x = x + 2;
y = 1;
}
}
cadenaSimp.Delete(cadenaSimp.Length(),1);
cadenaSimp.Insert("(" , 1);
cadenaSimp = cadenaSimp + ")";
//Si es POS entonces tenemos que invertir las variables y cambiar los
//operadores tanto internos y externos
cadenaSimp = InvertirVariables(cadenaSimp);
cadenaSimp = CambiarSignos(cadenaSimp,false);
cadenaSimp = CambiarSignos(cadenaSimp,true);
}
AnsiString funcion;
funcion = "F";
funcion = funcion + l + " : ";
cadenaSimp = funcion + cadenaSimp;
ListaPOS->Add(cadenaSimp);
ListaPOS->Add("");
//Escribimos el resultado en el StringGrid para visualizarlo
}
//Aqui termina el codigo para imprimir las expresiones simplificadas POS
// CTexto->Text = Lista->Text + Lista2->Text + Lista4->Text + ListaSOP->Text + ListaPOS->Text;
TStringList *l=new TStringList;
// CTexto->Text = Lista->Text + Lista2->Text + Lista4->Text + ListaSOP->Text + ListaPOS->Text;
for ( int n = 0; n < Lista->Count; n++ ){
l->Add (Lista->Strings[n]);
}
for ( int n = 0; n < Lista2->Count; n++ ){
l->Add (Lista2->Strings[n]);
}
for ( int n = 0; n < Lista4->Count; n++ ){
l->Add (Lista4->Strings[n]);
}
for ( int n = 0; n < ListaSOP->Count; n++ ){
l->Add (ListaSOP->Strings[n]);
}
for ( int n = 0; n < ListaPOS->Count; n++ ){
l->Add (ListaPOS->Strings[n]);
}
if (destino == IMPRESORA)
{
if ( SistemaCombinacionalNuevo->impresora->Execute())
{
Printer()->Title = Tabla.LeerNombre();
Printer()->BeginDoc();
Printer()->Canvas->Font->Name = "Courier";
m = 60;
Printer()->Canvas->Font->Size=14;
Printer()->Canvas->TextOut(100,m,ANSIMENSAJE(msgSistemaCombi));
m += Printer()->Canvas->TextHeight("XXX");
Printer()->Canvas->Font->Size=9;
Printer()->Canvas->TextOut(100,m,ANSIMENSAJE(msgNombreSC)+" : " + SistemaCombinacionalNuevo->Edit1->Text);
m += Printer()->Canvas->TextHeight("XXX");
Printer()->Canvas->Font->Size=9;
for ( int n = 0; n < l->Count; n++ )
{
if (l->Strings[n]!="")
Printer()->Canvas->TextOut(100, m,l->Strings[n]);
m += Printer()->Canvas->TextHeight("XXX");
if ( m + Printer()->Canvas->TextHeight("XXX") > Printer()->PageHeight )
{
Printer()->NewPage();
m = 40;
}
}
Printer()->EndDoc();
}
}
else if (destino == PORTAPAPELES)
{
l->Insert(0, ANSIMENSAJE(msgNombreSC)+" : " + SistemaCombinacionalNuevo->Edit1->Text);
l->Insert(0, "");
l->Insert(0, ANSIMENSAJE(msgSistemaCombi));
Clipboard()->Clear();
Clipboard()->SetTextBuf(l->Text.c_str());
}
}
else
Application->MessageBox(MENSAJE(msgSCTodaviaNoCreado), NULL);
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::CargarSistemaClick(TObject *Sender)
{
TStringList *Lista = new TStringList;
AnsiString Prueba;
TFileStream *lectorTexto;
//int numerofilas;
int numerocolumnas;
if (Cargador->Execute())
{ //Capturamos interrupcion en caso de que exista un error
try {
Lista->LoadFromFile(Cargador->FileName);
}//Ahora el sistema esta en el objeto de tipo TStringList
catch(...)
{
Application->MessageBox(MENSAJE(msgErrorCargar), NULL);
}
AnsiString nombreAsoc = Cargador->FileName + ".txt";
if (FileExists(nombreAsoc))
fTextoAsoc->txAsociado->Lines->LoadFromFile(nombreAsoc);
else
fTextoAsoc->txAsociado->Clear();
}
if (Lista->Text != "")
{
Edit1->Text = Lista->Strings[0];
NEntradas->Text = Lista->Strings[1];
int j = atol(NEntradas->Text.c_str()) + 2;
for ( int i = 2; i < j; i++)
{
//Escribimos en el grid los nombres de las variables de entrada
TablaEntrada->Cells[1][i-2] = Lista->Strings[i];
}
NSalidas->Text = Lista->Strings[j];
int i = j +1;
int paso = i;
j = j + atol(NSalidas->Text.c_str());
//int i = j;
for (i ; i <= j;i++)
{ //Escribimos en el grid los nombres de las variables de salida
TablaSalida->Cells[1][i-paso] = Lista->Strings[i];
}
// La variable i contiene la posicion donde empiezan los valores de
// la tabla
//Ahora escribimos los datos en el objeto
Tabla.DinX(Edit1->Text.SubString(0,40),
(TablaEntrada->RowCount),
(TablaSalida->RowCount) );
//Y por ultimo escribimos los datos de la(s) salida(s)
//Quitamos esta vble
//numerofilas = atol(NEntradas->Text.c_str());
numerocolumnas = atol(NSalidas->Text.c_str());
//Ahora tenemos que coger las cadenas que contienen los datos y
//escribirlas en la Tabla
AnsiString temp;
for (int k=1 ; (k <= numerocolumnas); k++ )
{
for (int l = 1; l <= Tabla.NumFilas(); l++)
{
temp= Lista->Strings[i].SubString(l,1).c_str();
char *valor = temp.c_str();
Tabla.EscribirDinArray(l-1, k-1, *valor);
}
i= i +1;
}
Application->MessageBox(MENSAJE(msgSCCargadoFichero), "");
}
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::CerrarClick(TObject *Sender)
{
for(int i=0; i < TablaEntrada->RowCount; i++)
{
TablaEntrada->Cells[1][i] = "";
}
TablaEntrada->RowCount = 1;
TablaEntrada->Enabled = false;
TablaEntrada->Color = clInactiveCaption;
for(int i=0; i < TablaSalida->RowCount; i++)
{
TablaSalida->Cells[1][i] = "";
}
TablaSalida->RowCount = 1;
TablaSalida->Enabled = false;
TablaSalida->Color = clInactiveCaption;
Tabla.BorrarDinArray();
Edit1->Text = "";
NEntradas->Text = "";
NSalidas->Text = "";
Principal->Visible = true;
SistemaCombinacionalNuevo->Hide();
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::Button4Click(TObject *Sender)
{
if ( ComprobarVariables() )
{
if (Tabla.LeerDinArray(0,0) != ' ')
{
AnsiString cadena;
cadena = NEntradas->Text;
long numVars = atol(cadena.c_str());
fKarnaugh->setFormato(FORMATO_SOP);
fKarnaugh->setNumVars(numVars);
fKarnaugh->setModo(MODO_APRENDIZAJE_LAZOS);
fKarnaugh->ShowModal();
}
else
Application->MessageBox(MENSAJE(msgSCTodaviaNoCreado), NULL);
}
else
{
Application->MessageBox(MENSAJE(msgNumVarsIncorrecto), NULL);
}
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::SOPSimpExit(TObject *Sender)
{
ExpresionSimp->nnor->Checked = false;
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::Button5Click(TObject *Sender)
{
FormR->Titulo = MENSAJE(msgVisuCircuitos);
FormR->ecuacion->Text = "";
FormR->tipoCircuito = false;
FormR->ListaSol->Visible = false;
FormR->Lista->Visible = false; // Circuito Combinacional.
FormR->ShowModal();
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::Button6Click(TObject *Sender)
{
Application->MessageBox(MENSAJE(msgReductio), "");
ShellExecute(Handle, "open", "reductio.exe", NULL, NULL, SW_SHOWNORMAL);
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::BitBtn1Click(TObject *Sender)
{
Imprimir(PORTAPAPELES);
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::Edit1Change(TObject *Sender)
{
Tabla.EscribirNombre(Edit1->Text);
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::BitBtn2Click(TObject *Sender)
{
fTextoAsoc->Show();
}
//---------------------------------------------------------------------------
AnsiString NombreVHDL(AnsiString st)
{
st = st.Trim();
for(int i=1; i<=st.Length(); i++)
if (st[i]==' ')
st[i]='_';
return st;
}
void __fastcall TSistemaCombinacionalNuevo::BitBtn3Click(TObject *Sender)
{
AnsiString temp="";
TStringList *Lista = new TStringList;
AnsiString Titulo = Tabla.LeerNombre();
//Invocamos a una función para comprobar que se ha creado el objeto
if (ComprobarVariables())
if (Tabla.LeerDinArray(0,0) != ' ')
{
GuardaPLD->Filter=MENSAJE(msgFiltroVHDL);
if (GuardaPLD->Execute())
{
// Cabecera
Lista->Add("library IEEE;");
Lista->Add("use IEEE.STD_LOGIC_1164.ALL;");
Lista->Add("use IEEE.STD_LOGIC_ARITH.ALL;");
Lista->Add("use IEEE.STD_LOGIC_UNSIGNED.ALL;");
Lista->Add("");
// Nombre de la entidad
Lista->Add("entity " + Titulo + " is");
Lista->Add("\tPort (");
for (int i=0; i<Tabla.NumEntradas();i++)
{
AnsiString nombre = Tabla.LeerEntrada(i);
nombre=(nombre==""?AnsiString(char('A'+i)):nombre);
Lista->Add("\t\t" + NombreVHDL(nombre) + ": in std_logic;");
}
for (int i=0; i<Tabla.NumColumnas();i++)
{
AnsiString nombre = Tabla.LeerSalida(i);
nombre=(nombre==""?"S"+AnsiString(i):nombre);
Lista->Add("\t\t" + NombreVHDL(nombre) + ": out std_logic" + ((i==Tabla.NumColumnas()-1)?"":";"));
}
Lista->Add("\t\t);");
Lista->Add("end " + Titulo + ";");
Lista->Add("");
Lista->Add("architecture behavioral of " + Titulo + " is");
Lista->Add("begin");
ExpresionSimp->StringGrid1->RowCount = Tabla.NumColumnas();
ExpresionSimp->POS->Checked = false;
ExpresionSimp->calcularSimplificada(NULL);
for (int i=0; i<Tabla.NumColumnas();i++)
{
AnsiString formula = ExpresionSimp->StringGrid1->Cells[0][i];
AnsiString formulaVHDL;
if(formula == "0" || formula == "1")
formulaVHDL = "'" + formula + "'";
else
{
formula = NombresCompletos(formula);
formulaVHDL = "(";
bool faltaCerrarNot = false;
for(int j = 1; j <= formula.Length(); j++)
{
switch(formula[j])
{
case '~':
formulaVHDL += "not(";
faltaCerrarNot = true;
break;
case '*':
if (faltaCerrarNot)
{
formulaVHDL += ")";
faltaCerrarNot = false;
}
formulaVHDL += " and ";
break;
case '+':
if (faltaCerrarNot)
{
formulaVHDL += ")";
faltaCerrarNot = false;
}
formulaVHDL += " or ";
break;
case '(':
formulaVHDL += "(";
break;
case ')':
if (faltaCerrarNot)
{
formulaVHDL += ")";
faltaCerrarNot = false;
}
formulaVHDL += ")";
break;
default:
formulaVHDL += formula[j];
}
}
formulaVHDL += ")";
}
AnsiString nombre = Tabla.LeerSalida(i);
nombre=(nombre==""?"S"+AnsiString(i):nombre);
Lista->Add("\t" + NombreVHDL(nombre) + "<=" + formulaVHDL);
}
Lista->Add("end behavioral;");
Lista->SaveToFile(GuardaPLD->FileName);
}
}
else
Application->MessageBox(MENSAJE(msgSCTodaviaNoCreado), NULL);
else
Application->MessageBox(MENSAJE(msgNumVarsIncorrecto), NULL);
}
/*
// Recogemos los valores de la tabla para hacer la simplificacion
for (int l=0; l<Tabla.NumColumnas(); l++)
{
Form11->Unos->Text = "";
Form11->Equis->Text = "";
ExpresionSimp->StringGrid1->Cells[0][l] = "";
for (int i = 0; i<Tabla.NumFilas(); i++)
{
if ( ((Tabla.LeerDinArray(i,l) == '1') && (ExpresionSimp->POS->Checked == false)) ||
((Tabla.LeerDinArray(i,l) == '0') && (ExpresionSimp->POS->Checked == true)) )
{
Form11->Unos->Text = Form11->Unos->Text + i + ",";
}
else if (Tabla.LeerDinArray(i,l) == 'X')
{
Form11->Equis->Text = Form11->Equis->Text + i + ",";
}
}
Form11->Button1->Click();
//Despues de mandar los valores a la función de simplificación
//los recogemos en el StringGrid de Salida donde se visualizaran
AnsiString cadenaSimp = Form11->Solucion->Text;
/*
int x = 1;
int y = 1;
//Ahora completamos los resultados con ceros para que tengan la misma
//longitud
while ( x <= cadenaSimp.Length() )
{
if ( cadenaSimp.SubString(x,1) == "," )
{
if ( (x-y) < Tabla.NumEntradas() )
{
for ( int i=0; i < (x-y);i++)
{
cadenaSimp.Insert("0",y);
x = x +1;
}
}
x = x + 1;
y = x;
}
else
x = x + 1;
}
x = 1;
y = 1;
//Con esto transformamos la cadena de salida en letras
//tenemos que coger los verdaderos nombres de las variables
while ( x <= cadenaSimp.Length() )
{
if ( cadenaSimp.SubString(x,1) == "1" )
{
cadenaSimp.Delete(x,1);
cadenaSimp.Insert(char('A' - 1 + y),x);
cadenaSimp.Insert("&",x +1);
x = x + 2;
y = y + 1;
}
else if (cadenaSimp.SubString(x,1) == "0")
{
cadenaSimp.Delete(x,1);
cadenaSimp.Insert("!&",x);
cadenaSimp.Insert(char('A' - 1 + y),x+1);
x = x + 3;
y = y + 1;
}
else if (cadenaSimp.SubString(x,1) == "-")
{
cadenaSimp.Delete(x,1);
y = y + 1;
}
else
{
cadenaSimp.Delete(x-1,2);
cadenaSimp.Insert(")#(",x-1);
x = x + 2;
y = 1;
}
}
cadenaSimp.Delete(cadenaSimp.Length(),1);
cadenaSimp.Insert("(" , 1);
cadenaSimp = cadenaSimp + ")";
temp = "";
temp = "|";
if ( Tabla.LeerSalida(l) == "" )
{
temp = temp + "F";
temp = temp + (l+1);
}
else
{
temp = temp + Tabla.LeerSalida(l);
}
temp = temp + "=" + cadenaSimp;
temp = NombresCompletos(temp);
Lista->Add(temp);
}
Lista->SaveToFile(GuardaPLD->FileName);
}
}
else
ShowMessage("el sistema combinacional no ha sido creado todavia");
else
ShowMessage("numero incorrecto de variables");
*/
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::DiagramaVKClick(
TObject *Sender)
{
if (ComprobarVariables())
{
AnsiString cadena;
cadena = NEntradas->Text;
long numVars = atol(cadena.c_str());
fKarnaugh->setNumVars(numVars);
fKarnaugh->setModo(MODO_EDITABLE);
fKarnaugh->ShowModal();
}
else
{
Application->MessageBox(MENSAJE(msgNumeroVariables), NULL);
}
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::BitBtn4Click(TObject *Sender)
{
// Este botón genera codigo Jedec PLCC (Todo el código de este método
// es idéntico al codigo del método para generar Jedec DIP, salvo el
// tipo de encapsulado, por lo que cualquier cambio en uno de ellos
// debe ser hecho también el el otro: BitBtn5Click)
if (ComprobarVariables())
if (Tabla.LeerDinArray(0,0) != ' ')
{
GuardaPLD->Filter=MENSAJE(msgFiltroJEDEC);
if (GuardaPLD->Execute())
{
list <list<string> > listFunciones;
AnsiString cadena;
cadena = NEntradas->Text;
long numVars = atol(cadena.c_str());
for(int i = 0; i < Tabla.NumColumnas(); i++)
{
list<string> listCubos;
listCubos.push_back(string("c"));
AnsiString nombre = Tabla.LeerSalida(i);
nombre=(nombre==""?"S"+AnsiString(i):nombre);
listCubos.push_back(string(nombre.c_str()));
rdSimplificador *simp;
simp = new rdSimplificador(numVars);
// 0 --> Obtención de IPs por el método Q-M
simp->SetObtenedor(0);
// 0 --> Seleccion de IPs por método recursivo sesgado
simp->SetSelector(0);
for(int j = 0; j < Tabla.NumFilas(); j++)
{
CuboBool cAux=CuboBool(j);
cAux.literales = numVars;
if (Tabla.LeerDinArray(j, i) == '1')
simp->AnyadirMint(cAux);
else if(Tabla.LeerDinArray(j, i) == 'X')
simp->AnyadirTI(cAux);
}
simp->Simplificar();
for (set<CuboBool>::iterator j= simp->setIPE1sBEGIN();j != simp->setIPE1sEND();j++)
{
listCubos.push_back((*j).aString(numVars));
}
for (set<CuboBool>::iterator j= simp->setIPE2sBEGIN();j != simp->setIPE2sEND();j++)
{
listCubos.push_back((*j).aString(numVars));
}
for (set<CuboBool>::iterator j= simp->setIPnEsBEGIN();j != simp->setIPnEsEND();j++)
{
listCubos.push_back((*j).aString(numVars));
}
delete simp;
for(list<string>::iterator i=listCubos.begin(); i!= listCubos.end(); i++)
{
string s = *i;
}
listFunciones.push_back(listCubos);
}
string entradas[100];
for (int i=0; i<Tabla.NumEntradas();i++)
{
AnsiString nombre = Tabla.LeerEntrada(i);
nombre=(nombre==""?AnsiString(char('A'+i)):nombre);
entradas[i]=string(NombreVHDL(nombre).c_str());
string nombre2 = entradas[i];
}
Device dev("GAL22V10", 24, 5828, 44, GAL22V10_PLCC);
// Device dev("GAL22V10", 24, 5828, 44, GAL22V10_DIP);
Jedec jedec(listFunciones, dev, entradas, GuardaPLD->FileName.SubString(1,GuardaPLD->FileName.Length()-4).c_str());
if(jedec.GetCodigoFlagError())
Application->MessageBox(jedec.GetTextoFlagError(), NULL);
}
}
else
Application->MessageBox(MENSAJE(msgSCTodaviaNoCreado), NULL);
else
Application->MessageBox(MENSAJE(msgNumVarsIncorrecto), NULL);
}
//---------------------------------------------------------------------------
void __fastcall TSistemaCombinacionalNuevo::BitBtn5Click(TObject *Sender)
{
// Este botón genera codigo Jedec DIP (Todo el código de este método
// es idéntico al codigo del método para generar Jedec PLCC, salvo el
// tipo de encapsulado, por lo que cualquier cambio en uno de ellos
// debe ser hecho también el el otro: BitBtn4Click)
if (ComprobarVariables())
if (Tabla.LeerDinArray(0,0) != ' ')
{
GuardaPLD->Filter=MENSAJE(msgFiltroJEDEC);
if (GuardaPLD->Execute())
{
list <list<string> > listFunciones;
AnsiString cadena;
cadena = NEntradas->Text;
long numVars = atol(cadena.c_str());
for(int i = 0; i < Tabla.NumColumnas(); i++)
{
list<string> listCubos;
listCubos.push_back(string("c"));
AnsiString nombre = Tabla.LeerSalida(i);
nombre=(nombre==""?"S"+AnsiString(i):nombre);
listCubos.push_back(string(nombre.c_str()));
rdSimplificador *simp;
simp = new rdSimplificador(numVars);
// 0 --> Obtención de IPs por el método Q-M
simp->SetObtenedor(0);
// 0 --> Seleccion de IPs por método recursivo sesgado
simp->SetSelector(0);
for(int j = 0; j < Tabla.NumFilas(); j++)
{
CuboBool cAux=CuboBool(j);
cAux.literales = numVars;
if (Tabla.LeerDinArray(j, i) == '1')
simp->AnyadirMint(cAux);
else if(Tabla.LeerDinArray(j, i) == 'X')
simp->AnyadirTI(cAux);
}
simp->Simplificar();
for (set<CuboBool>::iterator j= simp->setIPE1sBEGIN();j != simp->setIPE1sEND();j++)
{
listCubos.push_back((*j).aString(numVars));
}
for (set<CuboBool>::iterator j= simp->setIPE2sBEGIN();j != simp->setIPE2sEND();j++)
{
listCubos.push_back((*j).aString(numVars));
}
for (set<CuboBool>::iterator j= simp->setIPnEsBEGIN();j != simp->setIPnEsEND();j++)
{
listCubos.push_back((*j).aString(numVars));
}
delete simp;
for(list<string>::iterator i=listCubos.begin(); i!= listCubos.end(); i++)
{
string s = *i;
}
listFunciones.push_back(listCubos);
}
string entradas[100];
for (int i=0; i<Tabla.NumEntradas();i++)
{
AnsiString nombre = Tabla.LeerEntrada(i);
nombre=(nombre==""?AnsiString(char('A'+i)):nombre);
entradas[i]=string(NombreVHDL(nombre).c_str());
string nombre2 = entradas[i];
}
// Device dev("GAL22V10", 24, 5828, 44, GAL22V10_PLCC);
Device dev("GAL22V10", 24, 5828, 44, GAL22V10_DIP);
Jedec jedec(listFunciones, dev, entradas, GuardaPLD->FileName.SubString(1,GuardaPLD->FileName.Length()-4).c_str());
if(jedec.GetCodigoFlagError())
Application->MessageBox(jedec.GetTextoFlagError(), NULL);
}
}
else
Application->MessageBox(MENSAJE(msgSCTodaviaNoCreado), NULL);
else
Application->MessageBox(MENSAJE(msgNumVarsIncorrecto), NULL);
}
//---------------------------------------------------------------------------
| [
"luis.rodriguez@opendeusto.es"
] | luis.rodriguez@opendeusto.es |
ce35390b75618e5d714d77eb73166606c178376f | 3bbaac515ad3cd3bf2c27e886a47b3c2a7acbecf | /eval/hrs-alternative2-eval.cc | 7eb93052244c745d496008cdf44049eb6fa510e3 | [] | no_license | zc444/image-clasification | e28a4031b18d9d6dd11eb05ac613e545f6501903 | 3966339433d41d4ba9f2920f7f9f195e289616c5 | refs/heads/master | 2022-12-22T15:40:46.609637 | 2020-09-11T01:59:26 | 2020-09-11T01:59:26 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,503 | cc | //========================================================================
// hrs-alternative-eval.cc
//========================================================================
// Evalutaion program for HRSAlternative.
#include <cstddef>
#include <iostream>
#include <iomanip> // for std::setw
#include "ece2400-stdlib.h"
#include "mnist-utils.h"
#include "Vector.h"
#include "HRSAlterative2.h"
//------------------------------------------------------------------------
// constants
//------------------------------------------------------------------------
void print_help()
{
std::cout << "usage: ./hrs-alternative-eval [<train_size>] [<test_size>]"
<< std::endl << std::endl
<< "Evaluation program for HRSAlternative. You must use "
<< "full training set to get the accuracy! "
<< "Full training set size and full testing set size"
<< "will be used if no arguments are specified."
<< std::endl << std::endl
<< "positional arguments:" << std::endl
<< " train_size Size of the training set. " << std::endl
<< "It has to be within (0, 60000]." << std::endl
<< " test_size Size of the testing set. " << std::endl
<< "It has to be within (0, 10000]." << std::endl;
}
//------------------------------------------------------------------------
// constants
//------------------------------------------------------------------------
const std::string mnsit_dir = "/classes/ece2400/mnist/";
const size_t full_training_size = 60000;
const size_t full_testing_size = 10000;
const int width = 22;
//------------------------------------------------------------------------
// main
//------------------------------------------------------------------------
int main( int argc, char** argv )
{
// Parse command line argument
size_t testing_size;
size_t training_size;
if ( argc != 3 && argc != 1 ) {
std::cout << "Invalid command line arguments!"
<< std::endl << std::endl;
print_help();
return 1;
}
if ( argc == 1 ) {
training_size = full_training_size;
testing_size = full_testing_size;
}
else {
training_size = atoi( argv[1] );
testing_size = atoi( argv[2] );
// Check range
if ( testing_size < 1 || testing_size > full_testing_size ) {
std::cout << "Invalid testing size: " << testing_size
<< std::endl << std::endl;
return 1;
}
// Check range
if ( training_size < 1 || training_size > full_training_size ) {
std::cout << "Invalid training size: " << training_size
<< std::endl << std::endl;
return 1;
}
}
Vector<Image> v_train;
Vector<Image> v_test;
std::cout << "Evaluating HRSAlternative..." << std::endl;
std::cout << std::setw(width) << std::left
<< " - training size" << " = " << training_size << std::endl;
std::cout << std::setw(width) << std::left
<< " - testing size" << " = " << testing_size << std::endl;
// Reads images into training vector
std::string image_path = mnsit_dir + "training-images.bin";
std::string label_path = mnsit_dir + "training-labels.bin";
read_labeled_images( image_path, label_path, v_train, training_size );
// Reads images into testing vector
image_path = mnsit_dir + "testing-images.bin";
label_path = mnsit_dir + "testing-labels.bin";
read_labeled_images( image_path, label_path, v_test, testing_size );
// Instantiate a classifier
HRSAlternative2 clf;
// Time the training phase
ece2400::timer_reset();
clf.train( v_train );
double training_time = ece2400::timer_get_elapsed();
// Time the classification phase
ece2400::timer_reset();
double accuracy = classify_with_progress_bar( clf, v_test );
double classification_time = ece2400::timer_get_elapsed();
std::cout << std::setw(width) << std::left
<< " - training time" << " : " << training_time
<< " seconds" << std::endl;
std::cout << std::setw(width) << std::left
<< " - classification time" << " : " << classification_time
<< " seconds" << std::endl;
// Report accuracy only if using the full traininig dataset
if ( training_size == full_training_size && testing_size == full_testing_size )
std::cout << std::setw(width) << std::left
<< " - accuracy" << " : " << accuracy << std::endl;
return 0;
}
| [
"zc444@cornell.edu"
] | zc444@cornell.edu |
c7299c582aac0d4dfbbf15bf7f8b148cf41edfb3 | d8847b347299593c51275e569f9868c8ec511381 | /NunEngine/Primitive.h | 3f276ddd6d92eeec60ed0faa408597a0a64a3b02 | [] | no_license | J-Nunes/NunEngine | 3c831d17e4b45cc878625ff952968e3d924249d0 | cc14eb0e72ef0fb2136583f260c7f7472c4820f3 | refs/heads/master | 2020-04-10T19:07:00.824768 | 2016-10-26T16:15:58 | 2016-10-26T16:15:58 | 68,187,115 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,621 | h |
#pragma once
#include "glm\glm.hpp"
#include "Color.h"
enum PrimitiveTypes
{
Primitive_Point,
Primitive_Line,
Primitive_Plane,
Primitive_Cube,
Primitive_Sphere,
Primitive_Cylinder
};
class Primitive
{
public:
Primitive();
virtual void Render() const;
virtual void InnerRender() const;
void SetPos(float x, float y, float z);
void SetRotation(float angle, const glm::vec3 &u);
void Scale(float x, float y, float z);
PrimitiveTypes GetType() const;
glm::vec3 GetPos()const;
public:
Color color;
glm::mat4x4 transform;
bool axis,wire;
protected:
PrimitiveTypes type;
};
// ============================================
class Cube : public Primitive
{
public :
Cube();
Cube(float sizeX, float sizeY, float sizeZ);
void InnerRender() const;
public:
glm::vec3 size;
};
// ============================================
class Sphere : public Primitive
{
public:
Sphere();
Sphere(float radius);
void InnerRender() const;
public:
float radius;
};
// ============================================
class Cylinder : public Primitive
{
public:
Cylinder();
Cylinder(float radius, float height);
void InnerRender() const;
public:
float radius;
float height;
};
// ============================================
class Line : public Primitive
{
public:
Line();
Line(float x, float y, float z);
void InnerRender() const;
public:
glm::vec3 origin;
glm::vec3 destination;
};
// ============================================
class Plane : public Primitive
{
public:
Plane();
Plane(float x, float y, float z, float d);
void InnerRender() const;
public:
glm::vec3 normal;
float constant;
}; | [
"jordinunes96@gmail.com"
] | jordinunes96@gmail.com |
b1d1d18585787778f70c97f9382ca08a77622c5f | 3310f6cb4b5898047607a89affed2a9d7b1383a7 | /src/pcl_utils.cpp | 2075e2c65e755235918d9aceae3831d04344978d | [] | no_license | gospodnetic/SBR | e3f43754704e0edc677278357ac5c581fdba7d02 | fa6c9cc72dc4476fd53eb0824b564d9613aa9e32 | refs/heads/master | 2021-05-08T04:57:40.978838 | 2017-11-08T22:26:49 | 2017-11-08T22:26:49 | 108,474,637 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,010 | cpp | /*
* @Author: Petra Gospodnetic
* @Date: 2017-10-18 10:36:09
* @Last Modified by: Petra Gospodnetic
* @Last Modified time: 2017-10-18 13:45:13
*/
#include "pcl_utils.h"
#include <random>
#include <cmath>
#include <chrono>
#include <pcl/io/pcd_io.h>
#include <pcl/io/vtk_io.h>
#include <pcl/kdtree/kdtree_flann.h>
#include <pcl/features/normal_3d.h>
#include <pcl/point_types.h>
#include <pcl/surface/gp3.h>
#include <pcl/visualization/pcl_visualizer.h>
namespace pcl_utils
{
/*! \brief Wrapped adjusted example PCL code.
*/
pcl::PointCloud<pcl::PointXYZRGB>::Ptr open_RGBpcd(
const std::string filename)
{
pcl::PointCloud<pcl::PointXYZRGB>::Ptr cloud(
new pcl::PointCloud<pcl::PointXYZRGB>);
if(pcl::io::loadPCDFile<pcl::PointXYZRGB>(filename, *cloud) == -1)
{
PCL_ERROR("Couldn't read pcd file.\n");
return cloud;
}
std::cout << "Loaded "
<< cloud->width * cloud->height
<< " data points from the .pcd file."
<< std::endl;
return cloud;
}
/*! \brief Generate a point cloud on the surface of a sphere at coordinate
soace origin.
\param N number of points in the cloud
\param r sphere radius
\param uniform how the points are generated. TRUE - uniformly
distributed over the surface of the sphere. FALSE - uniformly
distributed over the (phi, theta) plane, but more condensed
around the sphere poles.
*/
pcl::PointCloud<pcl::PointXYZRGB>::Ptr generate_sphere_cloud(
const size_t N,
const size_t r,
const bool uniform)
{
// Generate a sphere point cloud.
const unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();
std::mt19937 generator(seed);
std::uniform_real_distribution<double> uniform01(0.0, 1.0);
pcl::PointCloud<pcl::PointXYZRGB>::Ptr sphere_cloud(
new pcl::PointCloud<pcl::PointXYZRGB>);
// Fill in the cloud data
sphere_cloud->is_dense = false;
sphere_cloud->points.resize(N);
// TODO: Avoid code duplication.
if(uniform)
for(size_t i = 0; i < N; i++)
{
const double theta = 2 * M_PI * uniform01(generator);
const double phi = acos(1 - 2 * uniform01(generator));
sphere_cloud->points[i].x = r * sin(phi) * cos(theta);
sphere_cloud->points[i].y = r * sin(phi) * sin(theta);
sphere_cloud->points[i].z = r * cos(phi);
sphere_cloud->points[i].r = int(255 * uniform01(generator));
sphere_cloud->points[i].g = int(255 * uniform01(generator));
sphere_cloud->points[i].b = int(255 * uniform01(generator));
}
else
for(size_t i = 0; i < N; i++)
{
const double theta = 2 * M_PI * uniform01(generator);
const double phi = M_PI * uniform01(generator);
sphere_cloud->points[i].x = r * sin(phi) * cos(theta);
sphere_cloud->points[i].y = r * sin(phi) * sin(theta);
sphere_cloud->points[i].z = r * cos(phi);
sphere_cloud->points[i].r = int(255 * uniform01(generator));
sphere_cloud->points[i].g = int(255 * uniform01(generator));
sphere_cloud->points[i].b = int(255 * uniform01(generator));
}
return sphere_cloud;
}
/*! \brief Wrapped adjusted example PCL code.
*/
pcl::PointCloud<pcl::PointXYZRGBNormal>::Ptr estimate_normals(
const pcl::PointCloud<pcl::PointXYZRGB>::Ptr cloud)
{
pcl::NormalEstimation<pcl::PointXYZRGB, pcl::Normal> n;
pcl::PointCloud<pcl::Normal>::Ptr normals(
new pcl::PointCloud<pcl::Normal>);
pcl::search::KdTree<pcl::PointXYZRGB>::Ptr tree(
new pcl::search::KdTree<pcl::PointXYZRGB>);
tree->setInputCloud(cloud);
n.setInputCloud(cloud);
n.setSearchMethod(tree);
n.setKSearch(20);
n.compute(*normals);
// Concatenate the point data with the normal fields.
pcl::PointCloud<pcl::PointXYZRGBNormal>::Ptr cloud_with_normals(
new pcl::PointCloud<pcl::PointXYZRGBNormal>);
pcl::concatenateFields(*cloud, *normals, *cloud_with_normals);
return cloud_with_normals;
}
/*! \brief Wrapped adjusted example PCL code.
*/
pcl::PolygonMesh greedy_surface_reconstruct(
const pcl::PointCloud<pcl::PointXYZRGBNormal>::Ptr cloud,
const double search_radius,
const double mu,
const size_t max_nearest_neighbor,
const double max_surf_angle,
const double max_angle,
const bool normal_consistency)
{
// Greedy surface reconstruction.
pcl::search::KdTree<pcl::PointXYZRGBNormal>::Ptr tree(
new pcl::search::KdTree<pcl::PointXYZRGBNormal>);
tree->setInputCloud(cloud);
// Initialize objects
pcl::GreedyProjectionTriangulation<pcl::PointXYZRGBNormal> gp3;
pcl::PolygonMesh triangles;
// Set the maximum distance between connected points.
gp3.setSearchRadius(search_radius);
// Set typical values for the parameters
gp3.setMu(mu);
gp3.setMaximumNearestNeighbors(max_nearest_neighbor);
gp3.setMaximumSurfaceAngle(max_surf_angle);
gp3.setMaximumAngle(max_angle);
gp3.setNormalConsistency(normal_consistency);
// Reconstruct.
gp3.setInputCloud(cloud);
gp3.setSearchMethod(tree);
gp3.reconstruct(triangles);
// The reconstructed mesh can be exported as .vtk file and alse viewed
// with the pcl_viewer.
// pcl::io::saveVTKFile("reconstructed.vtk", triangles);
return triangles;
}
} // !namespace pcl_utils | [
"petra.gospodnetic@gmail.com"
] | petra.gospodnetic@gmail.com |
dfcbf65161d322e81825e58ac4e3a37cda5003fc | 64e4fabf9b43b6b02b14b9df7e1751732b30ad38 | /src/cobalt/port/renderer_stub/backend/egl/texture.cc | 17c6eef8c436fd87c8f03b1b78494165d94ff8c1 | [] | no_license | ivan-kits/skia-opengl-emscripten | 8a5ee0eab0214c84df3cd7eef37c8ba54acb045e | 79573e1ee794061bdcfd88cacdb75243eff5f6f0 | refs/heads/master | 2023-02-03T16:39:20.556706 | 2020-12-25T14:00:49 | 2020-12-25T14:00:49 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,312 | cc | // Copyright 2015 The Cobalt Authors. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#include "renderer_stub/backend/egl/texture.h"
#include <GLES2/gl2.h>
#include <GLES2/gl2ext.h>
#include "base/bind.h"
#include "cobalt/base/polymorphic_downcast.h"
#include "renderer_stub/backend/egl/framebuffer_render_target.h"
#include "renderer_stub/backend/egl/graphics_context.h"
#include "renderer_stub/backend/egl/pbuffer_render_target.h"
#include "renderer_stub/backend/egl/resource_context.h"
#include "renderer_stub/backend/egl/texture_data.h"
#include "renderer_stub/backend/egl/texture_data_cpu.h"
#include "renderer_stub/backend/egl/utils.h"
namespace cobalt {
namespace renderer {
namespace backend {
namespace {
void DoNothing() {
}
} // namespace
TextureEGL::TextureEGL(GraphicsContextEGL* graphics_context,
std::unique_ptr<TextureDataEGL> texture_source_data,
bool bgra_supported)
: graphics_context_(graphics_context),
size_(texture_source_data->GetSize()),
format_(texture_source_data->GetFormat()),
target_(GL_TEXTURE_2D) {
gl_handle_ =
texture_source_data->ConvertToTexture(graphics_context_, bgra_supported);
}
TextureEGL::TextureEGL(GraphicsContextEGL* graphics_context,
const RawTextureMemoryEGL* data, intptr_t offset,
const math::Size& size, GLenum format,
int pitch_in_bytes, bool bgra_supported)
: graphics_context_(graphics_context),
size_(size),
format_(format),
target_(GL_TEXTURE_2D) {
gl_handle_ = data->CreateTexture(graphics_context_, offset, size, format,
pitch_in_bytes, bgra_supported);
}
TextureEGL::TextureEGL(GraphicsContextEGL* graphics_context, GLuint gl_handle,
const math::Size& size, GLenum format, GLenum target,
const base::Closure& delete_function)
: graphics_context_(graphics_context),
size_(size),
format_(format),
gl_handle_(gl_handle),
target_(target),
delete_function_(delete_function) {}
TextureEGL::TextureEGL(
GraphicsContextEGL* graphics_context,
const scoped_refptr<RenderTargetEGL>& render_target)
: graphics_context_(graphics_context),
size_(render_target->GetSize()),
format_(GL_RGBA),
target_(GL_TEXTURE_2D) {
GraphicsContextEGL::ScopedMakeCurrent scoped_make_current(graphics_context_);
source_render_target_ = render_target;
if (render_target->GetSurface() != EGL_NO_SURFACE) {
// This is a PBufferRenderTargetEGL. Need to bind a texture to the surface.
const PBufferRenderTargetEGL* pbuffer_target =
base::polymorphic_downcast<const PBufferRenderTargetEGL*>
(render_target.get());
// First we create the OpenGL texture object and maintain a handle to it.
GL_CALL(glGenTextures(1, &gl_handle_));
GL_CALL(glBindTexture(GL_TEXTURE_2D, gl_handle_));
SetupInitialTextureParameters();
// This call attaches the EGL PBuffer object to the currently bound OpenGL
// texture object, effectively allowing the PBO render target to be used
// as a texture by referencing gl_handle_ from now on.
EGL_CALL(eglBindTexImage(pbuffer_target->display(),
pbuffer_target->GetSurface(),
EGL_BACK_BUFFER));
GL_CALL(glBindTexture(GL_TEXTURE_2D, 0));
} else {
// This is a FramebufferRenderTargetEGL. Wrap its color texture attachment.
const FramebufferRenderTargetEGL* framebuffer_target =
base::polymorphic_downcast<const FramebufferRenderTargetEGL*>
(render_target.get());
const TextureEGL* color_attachment = framebuffer_target->GetColorTexture();
format_ = color_attachment->GetFormat();
target_ = color_attachment->GetTarget();
gl_handle_ = color_attachment->gl_handle();
// Do not destroy the wrapped texture. Let the render target do that.
delete_function_ = base::Bind(&DoNothing);
}
}
TextureEGL::~TextureEGL() {
GraphicsContextEGL::ScopedMakeCurrent scoped_make_current(graphics_context_);
if (source_render_target_ &&
source_render_target_->GetSurface() != EGL_NO_SURFACE) {
const PBufferRenderTargetEGL* pbuffer_target =
base::polymorphic_downcast<const PBufferRenderTargetEGL*>
(source_render_target_.get());
EGL_CALL(eglReleaseTexImage(pbuffer_target->display(),
pbuffer_target->GetSurface(),
EGL_BACK_BUFFER));
}
if (!delete_function_.is_null()) {
delete_function_.Run();
} else {
GL_CALL(glDeleteTextures(1, &gl_handle_));
}
}
} // namespace backend
} // namespace renderer
} // namespace cobalt
| [
"trofimov_d_a@magnit.ru"
] | trofimov_d_a@magnit.ru |
4c5c42937306821fa206e0d197e534e90f3d8088 | 6666b9b5fe9622aac0953d6db2c2fc3174492041 | /Chapter8/8.6/towersOfHanoi.cpp | 5535e32d598df9758c7edc3ad5972588fe569f20 | [] | no_license | gmiesch/Code-Practice | 7a7933bbfc893f72f0f2c444a29c0b0b5ca598db | 33f6158ea599f0e9827bef8c7d8229c2f8685b76 | refs/heads/master | 2021-01-10T10:53:51.947996 | 2016-02-05T01:22:57 | 2016-02-05T01:22:57 | 43,040,985 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,229 | cpp | #include <iostream>
#include <stack>
#include <vector>
using std::cout;
using std::endl;
using std::stack;
using std::vector;
class Tower {
stack<int> disks;
int index;
public:
Tower(int i) {
index = i;
}
int getIndex() {
return index;
}
int numDisks() {
return disks.size();
}
void add(int d) {
if(!disks.empty() && disks.top() <= d) {
cout << "Error while placing disk: " << d << endl;
} else {
disks.push(d);
}
}
void moveTopTo(Tower &t) {
int top = disks.top();
disks.pop();
t.add(top);
}
void moveDisks(int n, Tower &dest, Tower &buffer) {
if(n > 0) {
moveDisks(n-1, buffer, dest);
moveTopTo(dest);
buffer.moveDisks(n-1, dest, *this);
}
}
};
int main() {
int n = 3;
vector<Tower> towers;
for(int i = 0; i < 3; i++) {
towers.push_back(Tower(i));
}
for(int i = n - 1; i >= 0; i--) {
towers[0].add(i);
}
cout << "Starting Configuration: " << towers[0].numDisks() << " - " << towers[1].numDisks() << " - " << towers[2].numDisks() << endl;
towers[0].moveDisks(n, towers[2], towers[1]);
cout << "Ending Configuration: " << towers[0].numDisks() << " - " << towers[1].numDisks() << " - " << towers[2].numDisks() << endl;
}
| [
"gvonrose@trinity.edu"
] | gvonrose@trinity.edu |
8dfad53393139730a1a4ee757d490302e72fb39f | 0f10023be72f4ae93e657e715e42e98c3b6cf6dc | /src/bloom.cpp | bbd6109d0acd27e5c5b8f00e9f6f0fb45cfc30de | [
"MIT"
] | permissive | kelepirci/bitcoinquality | a653f6ca6224eac40e6e974f6c8875b76c13e6c2 | ecd43ea0680571bf7d9d23fe4627e1f52b204c86 | refs/heads/master | 2021-08-20T05:54:38.919543 | 2017-11-28T10:19:43 | 2017-11-28T10:19:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,051 | cpp | // Copyright (c) 2012 The BitcoinQuality developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include <math.h>
#include <stdlib.h>
#include "bloom.h"
#include "core.h"
#include "script.h"
#define LN2SQUARED 0.4804530139182014246671025263266649717305529515945455
#define LN2 0.6931471805599453094172321214581765680755001343602552
using namespace std;
static const unsigned char bit_mask[8] = {0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80};
CBloomFilter::CBloomFilter(unsigned int nElements, double nFPRate, unsigned int nTweakIn, unsigned char nFlagsIn) :
// The ideal size for a bloom filter with a given number of elements and false positive rate is:
// - nElements * log(fp rate) / ln(2)^2
// We ignore filter parameters which will create a bloom filter larger than the protocol limits
vData(min((unsigned int)(-1 / LN2SQUARED * nElements * log(nFPRate)), MAX_BLOOM_FILTER_SIZE * 8) / 8),
// The ideal number of hash functions is filter size * ln(2) / number of elements
// Again, we ignore filter parameters which will create a bloom filter with more hash functions than the protocol limits
// See http://en.wikipedia.org/wiki/Bloom_filter for an explanation of these formulas
isFull(false),
isEmpty(false),
nHashFuncs(min((unsigned int)(vData.size() * 8 / nElements * LN2), MAX_HASH_FUNCS)),
nTweak(nTweakIn),
nFlags(nFlagsIn)
{
}
inline unsigned int CBloomFilter::Hash(unsigned int nHashNum, const std::vector<unsigned char>& vDataToHash) const
{
// 0xFBA4C795 chosen as it guarantees a reasonable bit difference between nHashNum values.
return MurmurHash3(nHashNum * 0xFBA4C795 + nTweak, vDataToHash) % (vData.size() * 8);
}
void CBloomFilter::insert(const vector<unsigned char>& vKey)
{
if (isFull)
return;
for (unsigned int i = 0; i < nHashFuncs; i++)
{
unsigned int nIndex = Hash(i, vKey);
// Sets bit nIndex of vData
vData[nIndex >> 3] |= bit_mask[7 & nIndex];
}
isEmpty = false;
}
void CBloomFilter::insert(const COutPoint& outpoint)
{
CDataStream stream(SER_NETWORK, PROTOCOL_VERSION);
stream << outpoint;
vector<unsigned char> data(stream.begin(), stream.end());
insert(data);
}
void CBloomFilter::insert(const uint256& hash)
{
vector<unsigned char> data(hash.begin(), hash.end());
insert(data);
}
bool CBloomFilter::contains(const vector<unsigned char>& vKey) const
{
if (isFull)
return true;
if (isEmpty)
return false;
for (unsigned int i = 0; i < nHashFuncs; i++)
{
unsigned int nIndex = Hash(i, vKey);
// Checks bit nIndex of vData
if (!(vData[nIndex >> 3] & bit_mask[7 & nIndex]))
return false;
}
return true;
}
bool CBloomFilter::contains(const COutPoint& outpoint) const
{
CDataStream stream(SER_NETWORK, PROTOCOL_VERSION);
stream << outpoint;
vector<unsigned char> data(stream.begin(), stream.end());
return contains(data);
}
bool CBloomFilter::contains(const uint256& hash) const
{
vector<unsigned char> data(hash.begin(), hash.end());
return contains(data);
}
bool CBloomFilter::IsWithinSizeConstraints() const
{
return vData.size() <= MAX_BLOOM_FILTER_SIZE && nHashFuncs <= MAX_HASH_FUNCS;
}
bool CBloomFilter::IsRelevantAndUpdate(const CTransaction& tx, const uint256& hash)
{
bool fFound = false;
// Match if the filter contains the hash of tx
// for finding tx when they appear in a block
if (isFull)
return true;
if (isEmpty)
return false;
if (contains(hash))
fFound = true;
for (unsigned int i = 0; i < tx.vout.size(); i++)
{
const CTxOut& txout = tx.vout[i];
// Match if the filter contains any arbitrary script data element in any scriptPubKey in tx
// If this matches, also add the specific output that was matched.
// This means clients don't have to update the filter themselves when a new relevant tx
// is discovered in order to find spending transactions, which avoids round-tripping and race conditions.
CScript::const_iterator pc = txout.scriptPubKey.begin();
vector<unsigned char> data;
while (pc < txout.scriptPubKey.end())
{
opcodetype opcode;
if (!txout.scriptPubKey.GetOp(pc, opcode, data))
break;
if (data.size() != 0 && contains(data))
{
fFound = true;
if ((nFlags & BLOOM_UPDATE_MASK) == BLOOM_UPDATE_ALL)
insert(COutPoint(hash, i));
else if ((nFlags & BLOOM_UPDATE_MASK) == BLOOM_UPDATE_P2PUBKEY_ONLY)
{
txnouttype type;
vector<vector<unsigned char> > vSolutions;
if (Solver(txout.scriptPubKey, type, vSolutions) &&
(type == TX_PUBKEY || type == TX_MULTISIG))
insert(COutPoint(hash, i));
}
break;
}
}
}
if (fFound)
return true;
BOOST_FOREACH(const CTxIn& txin, tx.vin)
{
// Match if the filter contains an outpoint tx spends
if (contains(txin.prevout))
return true;
// Match if the filter contains any arbitrary script data element in any scriptSig in tx
CScript::const_iterator pc = txin.scriptSig.begin();
vector<unsigned char> data;
while (pc < txin.scriptSig.end())
{
opcodetype opcode;
if (!txin.scriptSig.GetOp(pc, opcode, data))
break;
if (data.size() != 0 && contains(data))
return true;
}
}
return false;
}
void CBloomFilter::UpdateEmptyFull()
{
bool full = true;
bool empty = true;
for (unsigned int i = 0; i < vData.size(); i++)
{
full &= vData[i] == 0xff;
empty &= vData[i] == 0;
}
isFull = full;
isEmpty = empty;
}
| [
"info@bitcoinquality.org"
] | info@bitcoinquality.org |
90502d1a298c00987a1903cd8cc392bdb30004b6 | 7843b6c70cc94545b3b420881c754d2b11258912 | /1_1/weixin_1.h | efb194db7176b34ec2def5bea4f046538c3b74bf | [
"Apache-2.0"
] | permissive | liuyanfeier/The-Demo-of-QtLearning- | b77c109e7285cae24725e34ba5990a25c2fd46eb | 59b0bf17177f899bd1d662bff657d1102e4dbbfe | refs/heads/master | 2021-01-17T19:21:21.861210 | 2016-08-02T08:00:54 | 2016-08-02T08:00:54 | 64,736,707 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 213 | h | #ifndef WEIXIN_1_H
#define WEIXIN_1_H
class weiXin : public QDialog
{
Q_OBJECT
public:
explicit weiXin(QWidget *parent = 0);
~weiXin();
protected:
private:
QFont font;
#endif // WEIXIN_1_H
| [
"1657874451@qq.com"
] | 1657874451@qq.com |
df26391f5599621103bb154c6d240e21cfa0ec07 | 28369a4666fe78d2d6ef97cd916015a2960ae9f7 | /cmake-build-debug/gens/src/proto/grpc/reflection/v1alpha/reflection.pb.h | 0aaf147f3e502566cc56db103e47c57989a05b35 | [] | no_license | iskettan/HazelKV | af185be9d0709213e59fc3cd23c0a9c07589e2f6 | f637f99f7762ac41ab2a66277e7864dc7e42e0de | refs/heads/master | 2022-06-13T21:44:45.611009 | 2020-05-09T06:15:06 | 2020-05-09T06:15:06 | 259,865,665 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | true | 126,884 | h | // Generated by the protocol buffer compiler. DO NOT EDIT!
// source: src/proto/grpc/reflection/v1alpha/reflection.proto
#ifndef GOOGLE_PROTOBUF_INCLUDED_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto
#define GOOGLE_PROTOBUF_INCLUDED_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto
#include <limits>
#include <string>
#include <google/protobuf/port_def.inc>
#if PROTOBUF_VERSION < 3011000
#error This file was generated by a newer version of protoc which is
#error incompatible with your Protocol Buffer headers. Please update
#error your headers.
#endif
#if 3011002 < PROTOBUF_MIN_PROTOC_VERSION
#error This file was generated by an older version of protoc which is
#error incompatible with your Protocol Buffer headers. Please
#error regenerate this file with a newer version of protoc.
#endif
#include <google/protobuf/port_undef.inc>
#include <google/protobuf/io/coded_stream.h>
#include <google/protobuf/arena.h>
#include <google/protobuf/arenastring.h>
#include <google/protobuf/generated_message_table_driven.h>
#include <google/protobuf/generated_message_util.h>
#include <google/protobuf/inlined_string_field.h>
#include <google/protobuf/metadata.h>
#include <google/protobuf/generated_message_reflection.h>
#include <google/protobuf/message.h>
#include <google/protobuf/repeated_field.h> // IWYU pragma: export
#include <google/protobuf/extension_set.h> // IWYU pragma: export
#include <google/protobuf/unknown_field_set.h>
// @@protoc_insertion_point(includes)
#include <google/protobuf/port_def.inc>
#define PROTOBUF_INTERNAL_EXPORT_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto
PROTOBUF_NAMESPACE_OPEN
namespace internal {
class AnyMetadata;
} // namespace internal
PROTOBUF_NAMESPACE_CLOSE
// Internal implementation detail -- do not use these members.
struct TableStruct_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto {
static const ::PROTOBUF_NAMESPACE_ID::internal::ParseTableField entries[]
PROTOBUF_SECTION_VARIABLE(protodesc_cold);
static const ::PROTOBUF_NAMESPACE_ID::internal::AuxillaryParseTableField aux[]
PROTOBUF_SECTION_VARIABLE(protodesc_cold);
static const ::PROTOBUF_NAMESPACE_ID::internal::ParseTable schema[8]
PROTOBUF_SECTION_VARIABLE(protodesc_cold);
static const ::PROTOBUF_NAMESPACE_ID::internal::FieldMetadata field_metadata[];
static const ::PROTOBUF_NAMESPACE_ID::internal::SerializationTable serialization_table[];
static const ::PROTOBUF_NAMESPACE_ID::uint32 offsets[];
};
extern const ::PROTOBUF_NAMESPACE_ID::internal::DescriptorTable descriptor_table_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto;
namespace grpc {
namespace reflection {
namespace v1alpha {
class ErrorResponse;
class ErrorResponseDefaultTypeInternal;
extern ErrorResponseDefaultTypeInternal _ErrorResponse_default_instance_;
class ExtensionNumberResponse;
class ExtensionNumberResponseDefaultTypeInternal;
extern ExtensionNumberResponseDefaultTypeInternal _ExtensionNumberResponse_default_instance_;
class ExtensionRequest;
class ExtensionRequestDefaultTypeInternal;
extern ExtensionRequestDefaultTypeInternal _ExtensionRequest_default_instance_;
class FileDescriptorResponse;
class FileDescriptorResponseDefaultTypeInternal;
extern FileDescriptorResponseDefaultTypeInternal _FileDescriptorResponse_default_instance_;
class ListServiceResponse;
class ListServiceResponseDefaultTypeInternal;
extern ListServiceResponseDefaultTypeInternal _ListServiceResponse_default_instance_;
class ServerReflectionRequest;
class ServerReflectionRequestDefaultTypeInternal;
extern ServerReflectionRequestDefaultTypeInternal _ServerReflectionRequest_default_instance_;
class ServerReflectionResponse;
class ServerReflectionResponseDefaultTypeInternal;
extern ServerReflectionResponseDefaultTypeInternal _ServerReflectionResponse_default_instance_;
class ServiceResponse;
class ServiceResponseDefaultTypeInternal;
extern ServiceResponseDefaultTypeInternal _ServiceResponse_default_instance_;
} // namespace v1alpha
} // namespace reflection
} // namespace grpc
PROTOBUF_NAMESPACE_OPEN
template<> ::grpc::reflection::v1alpha::ErrorResponse* Arena::CreateMaybeMessage<::grpc::reflection::v1alpha::ErrorResponse>(Arena*);
template<> ::grpc::reflection::v1alpha::ExtensionNumberResponse* Arena::CreateMaybeMessage<::grpc::reflection::v1alpha::ExtensionNumberResponse>(Arena*);
template<> ::grpc::reflection::v1alpha::ExtensionRequest* Arena::CreateMaybeMessage<::grpc::reflection::v1alpha::ExtensionRequest>(Arena*);
template<> ::grpc::reflection::v1alpha::FileDescriptorResponse* Arena::CreateMaybeMessage<::grpc::reflection::v1alpha::FileDescriptorResponse>(Arena*);
template<> ::grpc::reflection::v1alpha::ListServiceResponse* Arena::CreateMaybeMessage<::grpc::reflection::v1alpha::ListServiceResponse>(Arena*);
template<> ::grpc::reflection::v1alpha::ServerReflectionRequest* Arena::CreateMaybeMessage<::grpc::reflection::v1alpha::ServerReflectionRequest>(Arena*);
template<> ::grpc::reflection::v1alpha::ServerReflectionResponse* Arena::CreateMaybeMessage<::grpc::reflection::v1alpha::ServerReflectionResponse>(Arena*);
template<> ::grpc::reflection::v1alpha::ServiceResponse* Arena::CreateMaybeMessage<::grpc::reflection::v1alpha::ServiceResponse>(Arena*);
PROTOBUF_NAMESPACE_CLOSE
namespace grpc {
namespace reflection {
namespace v1alpha {
// ===================================================================
class ServerReflectionRequest :
public ::PROTOBUF_NAMESPACE_ID::Message /* @@protoc_insertion_point(class_definition:grpc.reflection.v1alpha.ServerReflectionRequest) */ {
public:
ServerReflectionRequest();
virtual ~ServerReflectionRequest();
ServerReflectionRequest(const ServerReflectionRequest& from);
ServerReflectionRequest(ServerReflectionRequest&& from) noexcept
: ServerReflectionRequest() {
*this = ::std::move(from);
}
inline ServerReflectionRequest& operator=(const ServerReflectionRequest& from) {
CopyFrom(from);
return *this;
}
inline ServerReflectionRequest& operator=(ServerReflectionRequest&& from) noexcept {
if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) {
if (this != &from) InternalSwap(&from);
} else {
CopyFrom(from);
}
return *this;
}
static const ::PROTOBUF_NAMESPACE_ID::Descriptor* descriptor() {
return GetDescriptor();
}
static const ::PROTOBUF_NAMESPACE_ID::Descriptor* GetDescriptor() {
return GetMetadataStatic().descriptor;
}
static const ::PROTOBUF_NAMESPACE_ID::Reflection* GetReflection() {
return GetMetadataStatic().reflection;
}
static const ServerReflectionRequest& default_instance();
enum MessageRequestCase {
kFileByFilename = 3,
kFileContainingSymbol = 4,
kFileContainingExtension = 5,
kAllExtensionNumbersOfType = 6,
kListServices = 7,
MESSAGE_REQUEST_NOT_SET = 0,
};
static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY
static inline const ServerReflectionRequest* internal_default_instance() {
return reinterpret_cast<const ServerReflectionRequest*>(
&_ServerReflectionRequest_default_instance_);
}
static constexpr int kIndexInFileMessages =
0;
friend void swap(ServerReflectionRequest& a, ServerReflectionRequest& b) {
a.Swap(&b);
}
inline void Swap(ServerReflectionRequest* other) {
if (other == this) return;
InternalSwap(other);
}
// implements Message ----------------------------------------------
inline ServerReflectionRequest* New() const final {
return CreateMaybeMessage<ServerReflectionRequest>(nullptr);
}
ServerReflectionRequest* New(::PROTOBUF_NAMESPACE_ID::Arena* arena) const final {
return CreateMaybeMessage<ServerReflectionRequest>(arena);
}
void CopyFrom(const ::PROTOBUF_NAMESPACE_ID::Message& from) final;
void MergeFrom(const ::PROTOBUF_NAMESPACE_ID::Message& from) final;
void CopyFrom(const ServerReflectionRequest& from);
void MergeFrom(const ServerReflectionRequest& from);
PROTOBUF_ATTRIBUTE_REINITIALIZES void Clear() final;
bool IsInitialized() const final;
size_t ByteSizeLong() const final;
const char* _InternalParse(const char* ptr, ::PROTOBUF_NAMESPACE_ID::internal::ParseContext* ctx) final;
::PROTOBUF_NAMESPACE_ID::uint8* _InternalSerialize(
::PROTOBUF_NAMESPACE_ID::uint8* target, ::PROTOBUF_NAMESPACE_ID::io::EpsCopyOutputStream* stream) const final;
int GetCachedSize() const final { return _cached_size_.Get(); }
private:
inline void SharedCtor();
inline void SharedDtor();
void SetCachedSize(int size) const final;
void InternalSwap(ServerReflectionRequest* other);
friend class ::PROTOBUF_NAMESPACE_ID::internal::AnyMetadata;
static ::PROTOBUF_NAMESPACE_ID::StringPiece FullMessageName() {
return "grpc.reflection.v1alpha.ServerReflectionRequest";
}
private:
inline ::PROTOBUF_NAMESPACE_ID::Arena* GetArenaNoVirtual() const {
return nullptr;
}
inline void* MaybeArenaPtr() const {
return nullptr;
}
public:
::PROTOBUF_NAMESPACE_ID::Metadata GetMetadata() const final;
private:
static ::PROTOBUF_NAMESPACE_ID::Metadata GetMetadataStatic() {
::PROTOBUF_NAMESPACE_ID::internal::AssignDescriptors(&::descriptor_table_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto);
return ::descriptor_table_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto.file_level_metadata[kIndexInFileMessages];
}
public:
// nested types ----------------------------------------------------
// accessors -------------------------------------------------------
enum : int {
kHostFieldNumber = 1,
kFileByFilenameFieldNumber = 3,
kFileContainingSymbolFieldNumber = 4,
kFileContainingExtensionFieldNumber = 5,
kAllExtensionNumbersOfTypeFieldNumber = 6,
kListServicesFieldNumber = 7,
};
// string host = 1;
void clear_host();
const std::string& host() const;
void set_host(const std::string& value);
void set_host(std::string&& value);
void set_host(const char* value);
void set_host(const char* value, size_t size);
std::string* mutable_host();
std::string* release_host();
void set_allocated_host(std::string* host);
private:
const std::string& _internal_host() const;
void _internal_set_host(const std::string& value);
std::string* _internal_mutable_host();
public:
// string file_by_filename = 3;
private:
bool _internal_has_file_by_filename() const;
public:
void clear_file_by_filename();
const std::string& file_by_filename() const;
void set_file_by_filename(const std::string& value);
void set_file_by_filename(std::string&& value);
void set_file_by_filename(const char* value);
void set_file_by_filename(const char* value, size_t size);
std::string* mutable_file_by_filename();
std::string* release_file_by_filename();
void set_allocated_file_by_filename(std::string* file_by_filename);
private:
const std::string& _internal_file_by_filename() const;
void _internal_set_file_by_filename(const std::string& value);
std::string* _internal_mutable_file_by_filename();
public:
// string file_containing_symbol = 4;
private:
bool _internal_has_file_containing_symbol() const;
public:
void clear_file_containing_symbol();
const std::string& file_containing_symbol() const;
void set_file_containing_symbol(const std::string& value);
void set_file_containing_symbol(std::string&& value);
void set_file_containing_symbol(const char* value);
void set_file_containing_symbol(const char* value, size_t size);
std::string* mutable_file_containing_symbol();
std::string* release_file_containing_symbol();
void set_allocated_file_containing_symbol(std::string* file_containing_symbol);
private:
const std::string& _internal_file_containing_symbol() const;
void _internal_set_file_containing_symbol(const std::string& value);
std::string* _internal_mutable_file_containing_symbol();
public:
// .grpc.reflection.v1alpha.ExtensionRequest file_containing_extension = 5;
bool has_file_containing_extension() const;
private:
bool _internal_has_file_containing_extension() const;
public:
void clear_file_containing_extension();
const ::grpc::reflection::v1alpha::ExtensionRequest& file_containing_extension() const;
::grpc::reflection::v1alpha::ExtensionRequest* release_file_containing_extension();
::grpc::reflection::v1alpha::ExtensionRequest* mutable_file_containing_extension();
void set_allocated_file_containing_extension(::grpc::reflection::v1alpha::ExtensionRequest* file_containing_extension);
private:
const ::grpc::reflection::v1alpha::ExtensionRequest& _internal_file_containing_extension() const;
::grpc::reflection::v1alpha::ExtensionRequest* _internal_mutable_file_containing_extension();
public:
// string all_extension_numbers_of_type = 6;
private:
bool _internal_has_all_extension_numbers_of_type() const;
public:
void clear_all_extension_numbers_of_type();
const std::string& all_extension_numbers_of_type() const;
void set_all_extension_numbers_of_type(const std::string& value);
void set_all_extension_numbers_of_type(std::string&& value);
void set_all_extension_numbers_of_type(const char* value);
void set_all_extension_numbers_of_type(const char* value, size_t size);
std::string* mutable_all_extension_numbers_of_type();
std::string* release_all_extension_numbers_of_type();
void set_allocated_all_extension_numbers_of_type(std::string* all_extension_numbers_of_type);
private:
const std::string& _internal_all_extension_numbers_of_type() const;
void _internal_set_all_extension_numbers_of_type(const std::string& value);
std::string* _internal_mutable_all_extension_numbers_of_type();
public:
// string list_services = 7;
private:
bool _internal_has_list_services() const;
public:
void clear_list_services();
const std::string& list_services() const;
void set_list_services(const std::string& value);
void set_list_services(std::string&& value);
void set_list_services(const char* value);
void set_list_services(const char* value, size_t size);
std::string* mutable_list_services();
std::string* release_list_services();
void set_allocated_list_services(std::string* list_services);
private:
const std::string& _internal_list_services() const;
void _internal_set_list_services(const std::string& value);
std::string* _internal_mutable_list_services();
public:
void clear_message_request();
MessageRequestCase message_request_case() const;
// @@protoc_insertion_point(class_scope:grpc.reflection.v1alpha.ServerReflectionRequest)
private:
class _Internal;
void set_has_file_by_filename();
void set_has_file_containing_symbol();
void set_has_file_containing_extension();
void set_has_all_extension_numbers_of_type();
void set_has_list_services();
inline bool has_message_request() const;
inline void clear_has_message_request();
::PROTOBUF_NAMESPACE_ID::internal::InternalMetadataWithArena _internal_metadata_;
::PROTOBUF_NAMESPACE_ID::internal::ArenaStringPtr host_;
union MessageRequestUnion {
MessageRequestUnion() {}
::PROTOBUF_NAMESPACE_ID::internal::ArenaStringPtr file_by_filename_;
::PROTOBUF_NAMESPACE_ID::internal::ArenaStringPtr file_containing_symbol_;
::grpc::reflection::v1alpha::ExtensionRequest* file_containing_extension_;
::PROTOBUF_NAMESPACE_ID::internal::ArenaStringPtr all_extension_numbers_of_type_;
::PROTOBUF_NAMESPACE_ID::internal::ArenaStringPtr list_services_;
} message_request_;
mutable ::PROTOBUF_NAMESPACE_ID::internal::CachedSize _cached_size_;
::PROTOBUF_NAMESPACE_ID::uint32 _oneof_case_[1];
friend struct ::TableStruct_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto;
};
// -------------------------------------------------------------------
class ExtensionRequest :
public ::PROTOBUF_NAMESPACE_ID::Message /* @@protoc_insertion_point(class_definition:grpc.reflection.v1alpha.ExtensionRequest) */ {
public:
ExtensionRequest();
virtual ~ExtensionRequest();
ExtensionRequest(const ExtensionRequest& from);
ExtensionRequest(ExtensionRequest&& from) noexcept
: ExtensionRequest() {
*this = ::std::move(from);
}
inline ExtensionRequest& operator=(const ExtensionRequest& from) {
CopyFrom(from);
return *this;
}
inline ExtensionRequest& operator=(ExtensionRequest&& from) noexcept {
if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) {
if (this != &from) InternalSwap(&from);
} else {
CopyFrom(from);
}
return *this;
}
static const ::PROTOBUF_NAMESPACE_ID::Descriptor* descriptor() {
return GetDescriptor();
}
static const ::PROTOBUF_NAMESPACE_ID::Descriptor* GetDescriptor() {
return GetMetadataStatic().descriptor;
}
static const ::PROTOBUF_NAMESPACE_ID::Reflection* GetReflection() {
return GetMetadataStatic().reflection;
}
static const ExtensionRequest& default_instance();
static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY
static inline const ExtensionRequest* internal_default_instance() {
return reinterpret_cast<const ExtensionRequest*>(
&_ExtensionRequest_default_instance_);
}
static constexpr int kIndexInFileMessages =
1;
friend void swap(ExtensionRequest& a, ExtensionRequest& b) {
a.Swap(&b);
}
inline void Swap(ExtensionRequest* other) {
if (other == this) return;
InternalSwap(other);
}
// implements Message ----------------------------------------------
inline ExtensionRequest* New() const final {
return CreateMaybeMessage<ExtensionRequest>(nullptr);
}
ExtensionRequest* New(::PROTOBUF_NAMESPACE_ID::Arena* arena) const final {
return CreateMaybeMessage<ExtensionRequest>(arena);
}
void CopyFrom(const ::PROTOBUF_NAMESPACE_ID::Message& from) final;
void MergeFrom(const ::PROTOBUF_NAMESPACE_ID::Message& from) final;
void CopyFrom(const ExtensionRequest& from);
void MergeFrom(const ExtensionRequest& from);
PROTOBUF_ATTRIBUTE_REINITIALIZES void Clear() final;
bool IsInitialized() const final;
size_t ByteSizeLong() const final;
const char* _InternalParse(const char* ptr, ::PROTOBUF_NAMESPACE_ID::internal::ParseContext* ctx) final;
::PROTOBUF_NAMESPACE_ID::uint8* _InternalSerialize(
::PROTOBUF_NAMESPACE_ID::uint8* target, ::PROTOBUF_NAMESPACE_ID::io::EpsCopyOutputStream* stream) const final;
int GetCachedSize() const final { return _cached_size_.Get(); }
private:
inline void SharedCtor();
inline void SharedDtor();
void SetCachedSize(int size) const final;
void InternalSwap(ExtensionRequest* other);
friend class ::PROTOBUF_NAMESPACE_ID::internal::AnyMetadata;
static ::PROTOBUF_NAMESPACE_ID::StringPiece FullMessageName() {
return "grpc.reflection.v1alpha.ExtensionRequest";
}
private:
inline ::PROTOBUF_NAMESPACE_ID::Arena* GetArenaNoVirtual() const {
return nullptr;
}
inline void* MaybeArenaPtr() const {
return nullptr;
}
public:
::PROTOBUF_NAMESPACE_ID::Metadata GetMetadata() const final;
private:
static ::PROTOBUF_NAMESPACE_ID::Metadata GetMetadataStatic() {
::PROTOBUF_NAMESPACE_ID::internal::AssignDescriptors(&::descriptor_table_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto);
return ::descriptor_table_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto.file_level_metadata[kIndexInFileMessages];
}
public:
// nested types ----------------------------------------------------
// accessors -------------------------------------------------------
enum : int {
kContainingTypeFieldNumber = 1,
kExtensionNumberFieldNumber = 2,
};
// string containing_type = 1;
void clear_containing_type();
const std::string& containing_type() const;
void set_containing_type(const std::string& value);
void set_containing_type(std::string&& value);
void set_containing_type(const char* value);
void set_containing_type(const char* value, size_t size);
std::string* mutable_containing_type();
std::string* release_containing_type();
void set_allocated_containing_type(std::string* containing_type);
private:
const std::string& _internal_containing_type() const;
void _internal_set_containing_type(const std::string& value);
std::string* _internal_mutable_containing_type();
public:
// int32 extension_number = 2;
void clear_extension_number();
::PROTOBUF_NAMESPACE_ID::int32 extension_number() const;
void set_extension_number(::PROTOBUF_NAMESPACE_ID::int32 value);
private:
::PROTOBUF_NAMESPACE_ID::int32 _internal_extension_number() const;
void _internal_set_extension_number(::PROTOBUF_NAMESPACE_ID::int32 value);
public:
// @@protoc_insertion_point(class_scope:grpc.reflection.v1alpha.ExtensionRequest)
private:
class _Internal;
::PROTOBUF_NAMESPACE_ID::internal::InternalMetadataWithArena _internal_metadata_;
::PROTOBUF_NAMESPACE_ID::internal::ArenaStringPtr containing_type_;
::PROTOBUF_NAMESPACE_ID::int32 extension_number_;
mutable ::PROTOBUF_NAMESPACE_ID::internal::CachedSize _cached_size_;
friend struct ::TableStruct_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto;
};
// -------------------------------------------------------------------
class ServerReflectionResponse :
public ::PROTOBUF_NAMESPACE_ID::Message /* @@protoc_insertion_point(class_definition:grpc.reflection.v1alpha.ServerReflectionResponse) */ {
public:
ServerReflectionResponse();
virtual ~ServerReflectionResponse();
ServerReflectionResponse(const ServerReflectionResponse& from);
ServerReflectionResponse(ServerReflectionResponse&& from) noexcept
: ServerReflectionResponse() {
*this = ::std::move(from);
}
inline ServerReflectionResponse& operator=(const ServerReflectionResponse& from) {
CopyFrom(from);
return *this;
}
inline ServerReflectionResponse& operator=(ServerReflectionResponse&& from) noexcept {
if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) {
if (this != &from) InternalSwap(&from);
} else {
CopyFrom(from);
}
return *this;
}
static const ::PROTOBUF_NAMESPACE_ID::Descriptor* descriptor() {
return GetDescriptor();
}
static const ::PROTOBUF_NAMESPACE_ID::Descriptor* GetDescriptor() {
return GetMetadataStatic().descriptor;
}
static const ::PROTOBUF_NAMESPACE_ID::Reflection* GetReflection() {
return GetMetadataStatic().reflection;
}
static const ServerReflectionResponse& default_instance();
enum MessageResponseCase {
kFileDescriptorResponse = 4,
kAllExtensionNumbersResponse = 5,
kListServicesResponse = 6,
kErrorResponse = 7,
MESSAGE_RESPONSE_NOT_SET = 0,
};
static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY
static inline const ServerReflectionResponse* internal_default_instance() {
return reinterpret_cast<const ServerReflectionResponse*>(
&_ServerReflectionResponse_default_instance_);
}
static constexpr int kIndexInFileMessages =
2;
friend void swap(ServerReflectionResponse& a, ServerReflectionResponse& b) {
a.Swap(&b);
}
inline void Swap(ServerReflectionResponse* other) {
if (other == this) return;
InternalSwap(other);
}
// implements Message ----------------------------------------------
inline ServerReflectionResponse* New() const final {
return CreateMaybeMessage<ServerReflectionResponse>(nullptr);
}
ServerReflectionResponse* New(::PROTOBUF_NAMESPACE_ID::Arena* arena) const final {
return CreateMaybeMessage<ServerReflectionResponse>(arena);
}
void CopyFrom(const ::PROTOBUF_NAMESPACE_ID::Message& from) final;
void MergeFrom(const ::PROTOBUF_NAMESPACE_ID::Message& from) final;
void CopyFrom(const ServerReflectionResponse& from);
void MergeFrom(const ServerReflectionResponse& from);
PROTOBUF_ATTRIBUTE_REINITIALIZES void Clear() final;
bool IsInitialized() const final;
size_t ByteSizeLong() const final;
const char* _InternalParse(const char* ptr, ::PROTOBUF_NAMESPACE_ID::internal::ParseContext* ctx) final;
::PROTOBUF_NAMESPACE_ID::uint8* _InternalSerialize(
::PROTOBUF_NAMESPACE_ID::uint8* target, ::PROTOBUF_NAMESPACE_ID::io::EpsCopyOutputStream* stream) const final;
int GetCachedSize() const final { return _cached_size_.Get(); }
private:
inline void SharedCtor();
inline void SharedDtor();
void SetCachedSize(int size) const final;
void InternalSwap(ServerReflectionResponse* other);
friend class ::PROTOBUF_NAMESPACE_ID::internal::AnyMetadata;
static ::PROTOBUF_NAMESPACE_ID::StringPiece FullMessageName() {
return "grpc.reflection.v1alpha.ServerReflectionResponse";
}
private:
inline ::PROTOBUF_NAMESPACE_ID::Arena* GetArenaNoVirtual() const {
return nullptr;
}
inline void* MaybeArenaPtr() const {
return nullptr;
}
public:
::PROTOBUF_NAMESPACE_ID::Metadata GetMetadata() const final;
private:
static ::PROTOBUF_NAMESPACE_ID::Metadata GetMetadataStatic() {
::PROTOBUF_NAMESPACE_ID::internal::AssignDescriptors(&::descriptor_table_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto);
return ::descriptor_table_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto.file_level_metadata[kIndexInFileMessages];
}
public:
// nested types ----------------------------------------------------
// accessors -------------------------------------------------------
enum : int {
kValidHostFieldNumber = 1,
kOriginalRequestFieldNumber = 2,
kFileDescriptorResponseFieldNumber = 4,
kAllExtensionNumbersResponseFieldNumber = 5,
kListServicesResponseFieldNumber = 6,
kErrorResponseFieldNumber = 7,
};
// string valid_host = 1;
void clear_valid_host();
const std::string& valid_host() const;
void set_valid_host(const std::string& value);
void set_valid_host(std::string&& value);
void set_valid_host(const char* value);
void set_valid_host(const char* value, size_t size);
std::string* mutable_valid_host();
std::string* release_valid_host();
void set_allocated_valid_host(std::string* valid_host);
private:
const std::string& _internal_valid_host() const;
void _internal_set_valid_host(const std::string& value);
std::string* _internal_mutable_valid_host();
public:
// .grpc.reflection.v1alpha.ServerReflectionRequest original_request = 2;
bool has_original_request() const;
private:
bool _internal_has_original_request() const;
public:
void clear_original_request();
const ::grpc::reflection::v1alpha::ServerReflectionRequest& original_request() const;
::grpc::reflection::v1alpha::ServerReflectionRequest* release_original_request();
::grpc::reflection::v1alpha::ServerReflectionRequest* mutable_original_request();
void set_allocated_original_request(::grpc::reflection::v1alpha::ServerReflectionRequest* original_request);
private:
const ::grpc::reflection::v1alpha::ServerReflectionRequest& _internal_original_request() const;
::grpc::reflection::v1alpha::ServerReflectionRequest* _internal_mutable_original_request();
public:
// .grpc.reflection.v1alpha.FileDescriptorResponse file_descriptor_response = 4;
bool has_file_descriptor_response() const;
private:
bool _internal_has_file_descriptor_response() const;
public:
void clear_file_descriptor_response();
const ::grpc::reflection::v1alpha::FileDescriptorResponse& file_descriptor_response() const;
::grpc::reflection::v1alpha::FileDescriptorResponse* release_file_descriptor_response();
::grpc::reflection::v1alpha::FileDescriptorResponse* mutable_file_descriptor_response();
void set_allocated_file_descriptor_response(::grpc::reflection::v1alpha::FileDescriptorResponse* file_descriptor_response);
private:
const ::grpc::reflection::v1alpha::FileDescriptorResponse& _internal_file_descriptor_response() const;
::grpc::reflection::v1alpha::FileDescriptorResponse* _internal_mutable_file_descriptor_response();
public:
// .grpc.reflection.v1alpha.ExtensionNumberResponse all_extension_numbers_response = 5;
bool has_all_extension_numbers_response() const;
private:
bool _internal_has_all_extension_numbers_response() const;
public:
void clear_all_extension_numbers_response();
const ::grpc::reflection::v1alpha::ExtensionNumberResponse& all_extension_numbers_response() const;
::grpc::reflection::v1alpha::ExtensionNumberResponse* release_all_extension_numbers_response();
::grpc::reflection::v1alpha::ExtensionNumberResponse* mutable_all_extension_numbers_response();
void set_allocated_all_extension_numbers_response(::grpc::reflection::v1alpha::ExtensionNumberResponse* all_extension_numbers_response);
private:
const ::grpc::reflection::v1alpha::ExtensionNumberResponse& _internal_all_extension_numbers_response() const;
::grpc::reflection::v1alpha::ExtensionNumberResponse* _internal_mutable_all_extension_numbers_response();
public:
// .grpc.reflection.v1alpha.ListServiceResponse list_services_response = 6;
bool has_list_services_response() const;
private:
bool _internal_has_list_services_response() const;
public:
void clear_list_services_response();
const ::grpc::reflection::v1alpha::ListServiceResponse& list_services_response() const;
::grpc::reflection::v1alpha::ListServiceResponse* release_list_services_response();
::grpc::reflection::v1alpha::ListServiceResponse* mutable_list_services_response();
void set_allocated_list_services_response(::grpc::reflection::v1alpha::ListServiceResponse* list_services_response);
private:
const ::grpc::reflection::v1alpha::ListServiceResponse& _internal_list_services_response() const;
::grpc::reflection::v1alpha::ListServiceResponse* _internal_mutable_list_services_response();
public:
// .grpc.reflection.v1alpha.ErrorResponse error_response = 7;
bool has_error_response() const;
private:
bool _internal_has_error_response() const;
public:
void clear_error_response();
const ::grpc::reflection::v1alpha::ErrorResponse& error_response() const;
::grpc::reflection::v1alpha::ErrorResponse* release_error_response();
::grpc::reflection::v1alpha::ErrorResponse* mutable_error_response();
void set_allocated_error_response(::grpc::reflection::v1alpha::ErrorResponse* error_response);
private:
const ::grpc::reflection::v1alpha::ErrorResponse& _internal_error_response() const;
::grpc::reflection::v1alpha::ErrorResponse* _internal_mutable_error_response();
public:
void clear_message_response();
MessageResponseCase message_response_case() const;
// @@protoc_insertion_point(class_scope:grpc.reflection.v1alpha.ServerReflectionResponse)
private:
class _Internal;
void set_has_file_descriptor_response();
void set_has_all_extension_numbers_response();
void set_has_list_services_response();
void set_has_error_response();
inline bool has_message_response() const;
inline void clear_has_message_response();
::PROTOBUF_NAMESPACE_ID::internal::InternalMetadataWithArena _internal_metadata_;
::PROTOBUF_NAMESPACE_ID::internal::ArenaStringPtr valid_host_;
::grpc::reflection::v1alpha::ServerReflectionRequest* original_request_;
union MessageResponseUnion {
MessageResponseUnion() {}
::grpc::reflection::v1alpha::FileDescriptorResponse* file_descriptor_response_;
::grpc::reflection::v1alpha::ExtensionNumberResponse* all_extension_numbers_response_;
::grpc::reflection::v1alpha::ListServiceResponse* list_services_response_;
::grpc::reflection::v1alpha::ErrorResponse* error_response_;
} message_response_;
mutable ::PROTOBUF_NAMESPACE_ID::internal::CachedSize _cached_size_;
::PROTOBUF_NAMESPACE_ID::uint32 _oneof_case_[1];
friend struct ::TableStruct_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto;
};
// -------------------------------------------------------------------
class FileDescriptorResponse :
public ::PROTOBUF_NAMESPACE_ID::Message /* @@protoc_insertion_point(class_definition:grpc.reflection.v1alpha.FileDescriptorResponse) */ {
public:
FileDescriptorResponse();
virtual ~FileDescriptorResponse();
FileDescriptorResponse(const FileDescriptorResponse& from);
FileDescriptorResponse(FileDescriptorResponse&& from) noexcept
: FileDescriptorResponse() {
*this = ::std::move(from);
}
inline FileDescriptorResponse& operator=(const FileDescriptorResponse& from) {
CopyFrom(from);
return *this;
}
inline FileDescriptorResponse& operator=(FileDescriptorResponse&& from) noexcept {
if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) {
if (this != &from) InternalSwap(&from);
} else {
CopyFrom(from);
}
return *this;
}
static const ::PROTOBUF_NAMESPACE_ID::Descriptor* descriptor() {
return GetDescriptor();
}
static const ::PROTOBUF_NAMESPACE_ID::Descriptor* GetDescriptor() {
return GetMetadataStatic().descriptor;
}
static const ::PROTOBUF_NAMESPACE_ID::Reflection* GetReflection() {
return GetMetadataStatic().reflection;
}
static const FileDescriptorResponse& default_instance();
static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY
static inline const FileDescriptorResponse* internal_default_instance() {
return reinterpret_cast<const FileDescriptorResponse*>(
&_FileDescriptorResponse_default_instance_);
}
static constexpr int kIndexInFileMessages =
3;
friend void swap(FileDescriptorResponse& a, FileDescriptorResponse& b) {
a.Swap(&b);
}
inline void Swap(FileDescriptorResponse* other) {
if (other == this) return;
InternalSwap(other);
}
// implements Message ----------------------------------------------
inline FileDescriptorResponse* New() const final {
return CreateMaybeMessage<FileDescriptorResponse>(nullptr);
}
FileDescriptorResponse* New(::PROTOBUF_NAMESPACE_ID::Arena* arena) const final {
return CreateMaybeMessage<FileDescriptorResponse>(arena);
}
void CopyFrom(const ::PROTOBUF_NAMESPACE_ID::Message& from) final;
void MergeFrom(const ::PROTOBUF_NAMESPACE_ID::Message& from) final;
void CopyFrom(const FileDescriptorResponse& from);
void MergeFrom(const FileDescriptorResponse& from);
PROTOBUF_ATTRIBUTE_REINITIALIZES void Clear() final;
bool IsInitialized() const final;
size_t ByteSizeLong() const final;
const char* _InternalParse(const char* ptr, ::PROTOBUF_NAMESPACE_ID::internal::ParseContext* ctx) final;
::PROTOBUF_NAMESPACE_ID::uint8* _InternalSerialize(
::PROTOBUF_NAMESPACE_ID::uint8* target, ::PROTOBUF_NAMESPACE_ID::io::EpsCopyOutputStream* stream) const final;
int GetCachedSize() const final { return _cached_size_.Get(); }
private:
inline void SharedCtor();
inline void SharedDtor();
void SetCachedSize(int size) const final;
void InternalSwap(FileDescriptorResponse* other);
friend class ::PROTOBUF_NAMESPACE_ID::internal::AnyMetadata;
static ::PROTOBUF_NAMESPACE_ID::StringPiece FullMessageName() {
return "grpc.reflection.v1alpha.FileDescriptorResponse";
}
private:
inline ::PROTOBUF_NAMESPACE_ID::Arena* GetArenaNoVirtual() const {
return nullptr;
}
inline void* MaybeArenaPtr() const {
return nullptr;
}
public:
::PROTOBUF_NAMESPACE_ID::Metadata GetMetadata() const final;
private:
static ::PROTOBUF_NAMESPACE_ID::Metadata GetMetadataStatic() {
::PROTOBUF_NAMESPACE_ID::internal::AssignDescriptors(&::descriptor_table_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto);
return ::descriptor_table_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto.file_level_metadata[kIndexInFileMessages];
}
public:
// nested types ----------------------------------------------------
// accessors -------------------------------------------------------
enum : int {
kFileDescriptorProtoFieldNumber = 1,
};
// repeated bytes file_descriptor_proto = 1;
int file_descriptor_proto_size() const;
private:
int _internal_file_descriptor_proto_size() const;
public:
void clear_file_descriptor_proto();
const std::string& file_descriptor_proto(int index) const;
std::string* mutable_file_descriptor_proto(int index);
void set_file_descriptor_proto(int index, const std::string& value);
void set_file_descriptor_proto(int index, std::string&& value);
void set_file_descriptor_proto(int index, const char* value);
void set_file_descriptor_proto(int index, const void* value, size_t size);
std::string* add_file_descriptor_proto();
void add_file_descriptor_proto(const std::string& value);
void add_file_descriptor_proto(std::string&& value);
void add_file_descriptor_proto(const char* value);
void add_file_descriptor_proto(const void* value, size_t size);
const ::PROTOBUF_NAMESPACE_ID::RepeatedPtrField<std::string>& file_descriptor_proto() const;
::PROTOBUF_NAMESPACE_ID::RepeatedPtrField<std::string>* mutable_file_descriptor_proto();
private:
const std::string& _internal_file_descriptor_proto(int index) const;
std::string* _internal_add_file_descriptor_proto();
public:
// @@protoc_insertion_point(class_scope:grpc.reflection.v1alpha.FileDescriptorResponse)
private:
class _Internal;
::PROTOBUF_NAMESPACE_ID::internal::InternalMetadataWithArena _internal_metadata_;
::PROTOBUF_NAMESPACE_ID::RepeatedPtrField<std::string> file_descriptor_proto_;
mutable ::PROTOBUF_NAMESPACE_ID::internal::CachedSize _cached_size_;
friend struct ::TableStruct_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto;
};
// -------------------------------------------------------------------
class ExtensionNumberResponse :
public ::PROTOBUF_NAMESPACE_ID::Message /* @@protoc_insertion_point(class_definition:grpc.reflection.v1alpha.ExtensionNumberResponse) */ {
public:
ExtensionNumberResponse();
virtual ~ExtensionNumberResponse();
ExtensionNumberResponse(const ExtensionNumberResponse& from);
ExtensionNumberResponse(ExtensionNumberResponse&& from) noexcept
: ExtensionNumberResponse() {
*this = ::std::move(from);
}
inline ExtensionNumberResponse& operator=(const ExtensionNumberResponse& from) {
CopyFrom(from);
return *this;
}
inline ExtensionNumberResponse& operator=(ExtensionNumberResponse&& from) noexcept {
if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) {
if (this != &from) InternalSwap(&from);
} else {
CopyFrom(from);
}
return *this;
}
static const ::PROTOBUF_NAMESPACE_ID::Descriptor* descriptor() {
return GetDescriptor();
}
static const ::PROTOBUF_NAMESPACE_ID::Descriptor* GetDescriptor() {
return GetMetadataStatic().descriptor;
}
static const ::PROTOBUF_NAMESPACE_ID::Reflection* GetReflection() {
return GetMetadataStatic().reflection;
}
static const ExtensionNumberResponse& default_instance();
static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY
static inline const ExtensionNumberResponse* internal_default_instance() {
return reinterpret_cast<const ExtensionNumberResponse*>(
&_ExtensionNumberResponse_default_instance_);
}
static constexpr int kIndexInFileMessages =
4;
friend void swap(ExtensionNumberResponse& a, ExtensionNumberResponse& b) {
a.Swap(&b);
}
inline void Swap(ExtensionNumberResponse* other) {
if (other == this) return;
InternalSwap(other);
}
// implements Message ----------------------------------------------
inline ExtensionNumberResponse* New() const final {
return CreateMaybeMessage<ExtensionNumberResponse>(nullptr);
}
ExtensionNumberResponse* New(::PROTOBUF_NAMESPACE_ID::Arena* arena) const final {
return CreateMaybeMessage<ExtensionNumberResponse>(arena);
}
void CopyFrom(const ::PROTOBUF_NAMESPACE_ID::Message& from) final;
void MergeFrom(const ::PROTOBUF_NAMESPACE_ID::Message& from) final;
void CopyFrom(const ExtensionNumberResponse& from);
void MergeFrom(const ExtensionNumberResponse& from);
PROTOBUF_ATTRIBUTE_REINITIALIZES void Clear() final;
bool IsInitialized() const final;
size_t ByteSizeLong() const final;
const char* _InternalParse(const char* ptr, ::PROTOBUF_NAMESPACE_ID::internal::ParseContext* ctx) final;
::PROTOBUF_NAMESPACE_ID::uint8* _InternalSerialize(
::PROTOBUF_NAMESPACE_ID::uint8* target, ::PROTOBUF_NAMESPACE_ID::io::EpsCopyOutputStream* stream) const final;
int GetCachedSize() const final { return _cached_size_.Get(); }
private:
inline void SharedCtor();
inline void SharedDtor();
void SetCachedSize(int size) const final;
void InternalSwap(ExtensionNumberResponse* other);
friend class ::PROTOBUF_NAMESPACE_ID::internal::AnyMetadata;
static ::PROTOBUF_NAMESPACE_ID::StringPiece FullMessageName() {
return "grpc.reflection.v1alpha.ExtensionNumberResponse";
}
private:
inline ::PROTOBUF_NAMESPACE_ID::Arena* GetArenaNoVirtual() const {
return nullptr;
}
inline void* MaybeArenaPtr() const {
return nullptr;
}
public:
::PROTOBUF_NAMESPACE_ID::Metadata GetMetadata() const final;
private:
static ::PROTOBUF_NAMESPACE_ID::Metadata GetMetadataStatic() {
::PROTOBUF_NAMESPACE_ID::internal::AssignDescriptors(&::descriptor_table_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto);
return ::descriptor_table_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto.file_level_metadata[kIndexInFileMessages];
}
public:
// nested types ----------------------------------------------------
// accessors -------------------------------------------------------
enum : int {
kExtensionNumberFieldNumber = 2,
kBaseTypeNameFieldNumber = 1,
};
// repeated int32 extension_number = 2;
int extension_number_size() const;
private:
int _internal_extension_number_size() const;
public:
void clear_extension_number();
private:
::PROTOBUF_NAMESPACE_ID::int32 _internal_extension_number(int index) const;
const ::PROTOBUF_NAMESPACE_ID::RepeatedField< ::PROTOBUF_NAMESPACE_ID::int32 >&
_internal_extension_number() const;
void _internal_add_extension_number(::PROTOBUF_NAMESPACE_ID::int32 value);
::PROTOBUF_NAMESPACE_ID::RepeatedField< ::PROTOBUF_NAMESPACE_ID::int32 >*
_internal_mutable_extension_number();
public:
::PROTOBUF_NAMESPACE_ID::int32 extension_number(int index) const;
void set_extension_number(int index, ::PROTOBUF_NAMESPACE_ID::int32 value);
void add_extension_number(::PROTOBUF_NAMESPACE_ID::int32 value);
const ::PROTOBUF_NAMESPACE_ID::RepeatedField< ::PROTOBUF_NAMESPACE_ID::int32 >&
extension_number() const;
::PROTOBUF_NAMESPACE_ID::RepeatedField< ::PROTOBUF_NAMESPACE_ID::int32 >*
mutable_extension_number();
// string base_type_name = 1;
void clear_base_type_name();
const std::string& base_type_name() const;
void set_base_type_name(const std::string& value);
void set_base_type_name(std::string&& value);
void set_base_type_name(const char* value);
void set_base_type_name(const char* value, size_t size);
std::string* mutable_base_type_name();
std::string* release_base_type_name();
void set_allocated_base_type_name(std::string* base_type_name);
private:
const std::string& _internal_base_type_name() const;
void _internal_set_base_type_name(const std::string& value);
std::string* _internal_mutable_base_type_name();
public:
// @@protoc_insertion_point(class_scope:grpc.reflection.v1alpha.ExtensionNumberResponse)
private:
class _Internal;
::PROTOBUF_NAMESPACE_ID::internal::InternalMetadataWithArena _internal_metadata_;
::PROTOBUF_NAMESPACE_ID::RepeatedField< ::PROTOBUF_NAMESPACE_ID::int32 > extension_number_;
mutable std::atomic<int> _extension_number_cached_byte_size_;
::PROTOBUF_NAMESPACE_ID::internal::ArenaStringPtr base_type_name_;
mutable ::PROTOBUF_NAMESPACE_ID::internal::CachedSize _cached_size_;
friend struct ::TableStruct_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto;
};
// -------------------------------------------------------------------
class ListServiceResponse :
public ::PROTOBUF_NAMESPACE_ID::Message /* @@protoc_insertion_point(class_definition:grpc.reflection.v1alpha.ListServiceResponse) */ {
public:
ListServiceResponse();
virtual ~ListServiceResponse();
ListServiceResponse(const ListServiceResponse& from);
ListServiceResponse(ListServiceResponse&& from) noexcept
: ListServiceResponse() {
*this = ::std::move(from);
}
inline ListServiceResponse& operator=(const ListServiceResponse& from) {
CopyFrom(from);
return *this;
}
inline ListServiceResponse& operator=(ListServiceResponse&& from) noexcept {
if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) {
if (this != &from) InternalSwap(&from);
} else {
CopyFrom(from);
}
return *this;
}
static const ::PROTOBUF_NAMESPACE_ID::Descriptor* descriptor() {
return GetDescriptor();
}
static const ::PROTOBUF_NAMESPACE_ID::Descriptor* GetDescriptor() {
return GetMetadataStatic().descriptor;
}
static const ::PROTOBUF_NAMESPACE_ID::Reflection* GetReflection() {
return GetMetadataStatic().reflection;
}
static const ListServiceResponse& default_instance();
static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY
static inline const ListServiceResponse* internal_default_instance() {
return reinterpret_cast<const ListServiceResponse*>(
&_ListServiceResponse_default_instance_);
}
static constexpr int kIndexInFileMessages =
5;
friend void swap(ListServiceResponse& a, ListServiceResponse& b) {
a.Swap(&b);
}
inline void Swap(ListServiceResponse* other) {
if (other == this) return;
InternalSwap(other);
}
// implements Message ----------------------------------------------
inline ListServiceResponse* New() const final {
return CreateMaybeMessage<ListServiceResponse>(nullptr);
}
ListServiceResponse* New(::PROTOBUF_NAMESPACE_ID::Arena* arena) const final {
return CreateMaybeMessage<ListServiceResponse>(arena);
}
void CopyFrom(const ::PROTOBUF_NAMESPACE_ID::Message& from) final;
void MergeFrom(const ::PROTOBUF_NAMESPACE_ID::Message& from) final;
void CopyFrom(const ListServiceResponse& from);
void MergeFrom(const ListServiceResponse& from);
PROTOBUF_ATTRIBUTE_REINITIALIZES void Clear() final;
bool IsInitialized() const final;
size_t ByteSizeLong() const final;
const char* _InternalParse(const char* ptr, ::PROTOBUF_NAMESPACE_ID::internal::ParseContext* ctx) final;
::PROTOBUF_NAMESPACE_ID::uint8* _InternalSerialize(
::PROTOBUF_NAMESPACE_ID::uint8* target, ::PROTOBUF_NAMESPACE_ID::io::EpsCopyOutputStream* stream) const final;
int GetCachedSize() const final { return _cached_size_.Get(); }
private:
inline void SharedCtor();
inline void SharedDtor();
void SetCachedSize(int size) const final;
void InternalSwap(ListServiceResponse* other);
friend class ::PROTOBUF_NAMESPACE_ID::internal::AnyMetadata;
static ::PROTOBUF_NAMESPACE_ID::StringPiece FullMessageName() {
return "grpc.reflection.v1alpha.ListServiceResponse";
}
private:
inline ::PROTOBUF_NAMESPACE_ID::Arena* GetArenaNoVirtual() const {
return nullptr;
}
inline void* MaybeArenaPtr() const {
return nullptr;
}
public:
::PROTOBUF_NAMESPACE_ID::Metadata GetMetadata() const final;
private:
static ::PROTOBUF_NAMESPACE_ID::Metadata GetMetadataStatic() {
::PROTOBUF_NAMESPACE_ID::internal::AssignDescriptors(&::descriptor_table_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto);
return ::descriptor_table_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto.file_level_metadata[kIndexInFileMessages];
}
public:
// nested types ----------------------------------------------------
// accessors -------------------------------------------------------
enum : int {
kServiceFieldNumber = 1,
};
// repeated .grpc.reflection.v1alpha.ServiceResponse service = 1;
int service_size() const;
private:
int _internal_service_size() const;
public:
void clear_service();
::grpc::reflection::v1alpha::ServiceResponse* mutable_service(int index);
::PROTOBUF_NAMESPACE_ID::RepeatedPtrField< ::grpc::reflection::v1alpha::ServiceResponse >*
mutable_service();
private:
const ::grpc::reflection::v1alpha::ServiceResponse& _internal_service(int index) const;
::grpc::reflection::v1alpha::ServiceResponse* _internal_add_service();
public:
const ::grpc::reflection::v1alpha::ServiceResponse& service(int index) const;
::grpc::reflection::v1alpha::ServiceResponse* add_service();
const ::PROTOBUF_NAMESPACE_ID::RepeatedPtrField< ::grpc::reflection::v1alpha::ServiceResponse >&
service() const;
// @@protoc_insertion_point(class_scope:grpc.reflection.v1alpha.ListServiceResponse)
private:
class _Internal;
::PROTOBUF_NAMESPACE_ID::internal::InternalMetadataWithArena _internal_metadata_;
::PROTOBUF_NAMESPACE_ID::RepeatedPtrField< ::grpc::reflection::v1alpha::ServiceResponse > service_;
mutable ::PROTOBUF_NAMESPACE_ID::internal::CachedSize _cached_size_;
friend struct ::TableStruct_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto;
};
// -------------------------------------------------------------------
class ServiceResponse :
public ::PROTOBUF_NAMESPACE_ID::Message /* @@protoc_insertion_point(class_definition:grpc.reflection.v1alpha.ServiceResponse) */ {
public:
ServiceResponse();
virtual ~ServiceResponse();
ServiceResponse(const ServiceResponse& from);
ServiceResponse(ServiceResponse&& from) noexcept
: ServiceResponse() {
*this = ::std::move(from);
}
inline ServiceResponse& operator=(const ServiceResponse& from) {
CopyFrom(from);
return *this;
}
inline ServiceResponse& operator=(ServiceResponse&& from) noexcept {
if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) {
if (this != &from) InternalSwap(&from);
} else {
CopyFrom(from);
}
return *this;
}
static const ::PROTOBUF_NAMESPACE_ID::Descriptor* descriptor() {
return GetDescriptor();
}
static const ::PROTOBUF_NAMESPACE_ID::Descriptor* GetDescriptor() {
return GetMetadataStatic().descriptor;
}
static const ::PROTOBUF_NAMESPACE_ID::Reflection* GetReflection() {
return GetMetadataStatic().reflection;
}
static const ServiceResponse& default_instance();
static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY
static inline const ServiceResponse* internal_default_instance() {
return reinterpret_cast<const ServiceResponse*>(
&_ServiceResponse_default_instance_);
}
static constexpr int kIndexInFileMessages =
6;
friend void swap(ServiceResponse& a, ServiceResponse& b) {
a.Swap(&b);
}
inline void Swap(ServiceResponse* other) {
if (other == this) return;
InternalSwap(other);
}
// implements Message ----------------------------------------------
inline ServiceResponse* New() const final {
return CreateMaybeMessage<ServiceResponse>(nullptr);
}
ServiceResponse* New(::PROTOBUF_NAMESPACE_ID::Arena* arena) const final {
return CreateMaybeMessage<ServiceResponse>(arena);
}
void CopyFrom(const ::PROTOBUF_NAMESPACE_ID::Message& from) final;
void MergeFrom(const ::PROTOBUF_NAMESPACE_ID::Message& from) final;
void CopyFrom(const ServiceResponse& from);
void MergeFrom(const ServiceResponse& from);
PROTOBUF_ATTRIBUTE_REINITIALIZES void Clear() final;
bool IsInitialized() const final;
size_t ByteSizeLong() const final;
const char* _InternalParse(const char* ptr, ::PROTOBUF_NAMESPACE_ID::internal::ParseContext* ctx) final;
::PROTOBUF_NAMESPACE_ID::uint8* _InternalSerialize(
::PROTOBUF_NAMESPACE_ID::uint8* target, ::PROTOBUF_NAMESPACE_ID::io::EpsCopyOutputStream* stream) const final;
int GetCachedSize() const final { return _cached_size_.Get(); }
private:
inline void SharedCtor();
inline void SharedDtor();
void SetCachedSize(int size) const final;
void InternalSwap(ServiceResponse* other);
friend class ::PROTOBUF_NAMESPACE_ID::internal::AnyMetadata;
static ::PROTOBUF_NAMESPACE_ID::StringPiece FullMessageName() {
return "grpc.reflection.v1alpha.ServiceResponse";
}
private:
inline ::PROTOBUF_NAMESPACE_ID::Arena* GetArenaNoVirtual() const {
return nullptr;
}
inline void* MaybeArenaPtr() const {
return nullptr;
}
public:
::PROTOBUF_NAMESPACE_ID::Metadata GetMetadata() const final;
private:
static ::PROTOBUF_NAMESPACE_ID::Metadata GetMetadataStatic() {
::PROTOBUF_NAMESPACE_ID::internal::AssignDescriptors(&::descriptor_table_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto);
return ::descriptor_table_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto.file_level_metadata[kIndexInFileMessages];
}
public:
// nested types ----------------------------------------------------
// accessors -------------------------------------------------------
enum : int {
kNameFieldNumber = 1,
};
// string name = 1;
void clear_name();
const std::string& name() const;
void set_name(const std::string& value);
void set_name(std::string&& value);
void set_name(const char* value);
void set_name(const char* value, size_t size);
std::string* mutable_name();
std::string* release_name();
void set_allocated_name(std::string* name);
private:
const std::string& _internal_name() const;
void _internal_set_name(const std::string& value);
std::string* _internal_mutable_name();
public:
// @@protoc_insertion_point(class_scope:grpc.reflection.v1alpha.ServiceResponse)
private:
class _Internal;
::PROTOBUF_NAMESPACE_ID::internal::InternalMetadataWithArena _internal_metadata_;
::PROTOBUF_NAMESPACE_ID::internal::ArenaStringPtr name_;
mutable ::PROTOBUF_NAMESPACE_ID::internal::CachedSize _cached_size_;
friend struct ::TableStruct_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto;
};
// -------------------------------------------------------------------
class ErrorResponse :
public ::PROTOBUF_NAMESPACE_ID::Message /* @@protoc_insertion_point(class_definition:grpc.reflection.v1alpha.ErrorResponse) */ {
public:
ErrorResponse();
virtual ~ErrorResponse();
ErrorResponse(const ErrorResponse& from);
ErrorResponse(ErrorResponse&& from) noexcept
: ErrorResponse() {
*this = ::std::move(from);
}
inline ErrorResponse& operator=(const ErrorResponse& from) {
CopyFrom(from);
return *this;
}
inline ErrorResponse& operator=(ErrorResponse&& from) noexcept {
if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) {
if (this != &from) InternalSwap(&from);
} else {
CopyFrom(from);
}
return *this;
}
static const ::PROTOBUF_NAMESPACE_ID::Descriptor* descriptor() {
return GetDescriptor();
}
static const ::PROTOBUF_NAMESPACE_ID::Descriptor* GetDescriptor() {
return GetMetadataStatic().descriptor;
}
static const ::PROTOBUF_NAMESPACE_ID::Reflection* GetReflection() {
return GetMetadataStatic().reflection;
}
static const ErrorResponse& default_instance();
static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY
static inline const ErrorResponse* internal_default_instance() {
return reinterpret_cast<const ErrorResponse*>(
&_ErrorResponse_default_instance_);
}
static constexpr int kIndexInFileMessages =
7;
friend void swap(ErrorResponse& a, ErrorResponse& b) {
a.Swap(&b);
}
inline void Swap(ErrorResponse* other) {
if (other == this) return;
InternalSwap(other);
}
// implements Message ----------------------------------------------
inline ErrorResponse* New() const final {
return CreateMaybeMessage<ErrorResponse>(nullptr);
}
ErrorResponse* New(::PROTOBUF_NAMESPACE_ID::Arena* arena) const final {
return CreateMaybeMessage<ErrorResponse>(arena);
}
void CopyFrom(const ::PROTOBUF_NAMESPACE_ID::Message& from) final;
void MergeFrom(const ::PROTOBUF_NAMESPACE_ID::Message& from) final;
void CopyFrom(const ErrorResponse& from);
void MergeFrom(const ErrorResponse& from);
PROTOBUF_ATTRIBUTE_REINITIALIZES void Clear() final;
bool IsInitialized() const final;
size_t ByteSizeLong() const final;
const char* _InternalParse(const char* ptr, ::PROTOBUF_NAMESPACE_ID::internal::ParseContext* ctx) final;
::PROTOBUF_NAMESPACE_ID::uint8* _InternalSerialize(
::PROTOBUF_NAMESPACE_ID::uint8* target, ::PROTOBUF_NAMESPACE_ID::io::EpsCopyOutputStream* stream) const final;
int GetCachedSize() const final { return _cached_size_.Get(); }
private:
inline void SharedCtor();
inline void SharedDtor();
void SetCachedSize(int size) const final;
void InternalSwap(ErrorResponse* other);
friend class ::PROTOBUF_NAMESPACE_ID::internal::AnyMetadata;
static ::PROTOBUF_NAMESPACE_ID::StringPiece FullMessageName() {
return "grpc.reflection.v1alpha.ErrorResponse";
}
private:
inline ::PROTOBUF_NAMESPACE_ID::Arena* GetArenaNoVirtual() const {
return nullptr;
}
inline void* MaybeArenaPtr() const {
return nullptr;
}
public:
::PROTOBUF_NAMESPACE_ID::Metadata GetMetadata() const final;
private:
static ::PROTOBUF_NAMESPACE_ID::Metadata GetMetadataStatic() {
::PROTOBUF_NAMESPACE_ID::internal::AssignDescriptors(&::descriptor_table_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto);
return ::descriptor_table_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto.file_level_metadata[kIndexInFileMessages];
}
public:
// nested types ----------------------------------------------------
// accessors -------------------------------------------------------
enum : int {
kErrorMessageFieldNumber = 2,
kErrorCodeFieldNumber = 1,
};
// string error_message = 2;
void clear_error_message();
const std::string& error_message() const;
void set_error_message(const std::string& value);
void set_error_message(std::string&& value);
void set_error_message(const char* value);
void set_error_message(const char* value, size_t size);
std::string* mutable_error_message();
std::string* release_error_message();
void set_allocated_error_message(std::string* error_message);
private:
const std::string& _internal_error_message() const;
void _internal_set_error_message(const std::string& value);
std::string* _internal_mutable_error_message();
public:
// int32 error_code = 1;
void clear_error_code();
::PROTOBUF_NAMESPACE_ID::int32 error_code() const;
void set_error_code(::PROTOBUF_NAMESPACE_ID::int32 value);
private:
::PROTOBUF_NAMESPACE_ID::int32 _internal_error_code() const;
void _internal_set_error_code(::PROTOBUF_NAMESPACE_ID::int32 value);
public:
// @@protoc_insertion_point(class_scope:grpc.reflection.v1alpha.ErrorResponse)
private:
class _Internal;
::PROTOBUF_NAMESPACE_ID::internal::InternalMetadataWithArena _internal_metadata_;
::PROTOBUF_NAMESPACE_ID::internal::ArenaStringPtr error_message_;
::PROTOBUF_NAMESPACE_ID::int32 error_code_;
mutable ::PROTOBUF_NAMESPACE_ID::internal::CachedSize _cached_size_;
friend struct ::TableStruct_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto;
};
// ===================================================================
// ===================================================================
#ifdef __GNUC__
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wstrict-aliasing"
#endif // __GNUC__
// ServerReflectionRequest
// string host = 1;
inline void ServerReflectionRequest::clear_host() {
host_.ClearToEmptyNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
inline const std::string& ServerReflectionRequest::host() const {
// @@protoc_insertion_point(field_get:grpc.reflection.v1alpha.ServerReflectionRequest.host)
return _internal_host();
}
inline void ServerReflectionRequest::set_host(const std::string& value) {
_internal_set_host(value);
// @@protoc_insertion_point(field_set:grpc.reflection.v1alpha.ServerReflectionRequest.host)
}
inline std::string* ServerReflectionRequest::mutable_host() {
// @@protoc_insertion_point(field_mutable:grpc.reflection.v1alpha.ServerReflectionRequest.host)
return _internal_mutable_host();
}
inline const std::string& ServerReflectionRequest::_internal_host() const {
return host_.GetNoArena();
}
inline void ServerReflectionRequest::_internal_set_host(const std::string& value) {
host_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), value);
}
inline void ServerReflectionRequest::set_host(std::string&& value) {
host_.SetNoArena(
&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), ::std::move(value));
// @@protoc_insertion_point(field_set_rvalue:grpc.reflection.v1alpha.ServerReflectionRequest.host)
}
inline void ServerReflectionRequest::set_host(const char* value) {
GOOGLE_DCHECK(value != nullptr);
host_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), ::std::string(value));
// @@protoc_insertion_point(field_set_char:grpc.reflection.v1alpha.ServerReflectionRequest.host)
}
inline void ServerReflectionRequest::set_host(const char* value, size_t size) {
host_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(),
::std::string(reinterpret_cast<const char*>(value), size));
// @@protoc_insertion_point(field_set_pointer:grpc.reflection.v1alpha.ServerReflectionRequest.host)
}
inline std::string* ServerReflectionRequest::_internal_mutable_host() {
return host_.MutableNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
inline std::string* ServerReflectionRequest::release_host() {
// @@protoc_insertion_point(field_release:grpc.reflection.v1alpha.ServerReflectionRequest.host)
return host_.ReleaseNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
inline void ServerReflectionRequest::set_allocated_host(std::string* host) {
if (host != nullptr) {
} else {
}
host_.SetAllocatedNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), host);
// @@protoc_insertion_point(field_set_allocated:grpc.reflection.v1alpha.ServerReflectionRequest.host)
}
// string file_by_filename = 3;
inline bool ServerReflectionRequest::_internal_has_file_by_filename() const {
return message_request_case() == kFileByFilename;
}
inline void ServerReflectionRequest::set_has_file_by_filename() {
_oneof_case_[0] = kFileByFilename;
}
inline void ServerReflectionRequest::clear_file_by_filename() {
if (_internal_has_file_by_filename()) {
message_request_.file_by_filename_.DestroyNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
clear_has_message_request();
}
}
inline const std::string& ServerReflectionRequest::file_by_filename() const {
// @@protoc_insertion_point(field_get:grpc.reflection.v1alpha.ServerReflectionRequest.file_by_filename)
return _internal_file_by_filename();
}
inline void ServerReflectionRequest::set_file_by_filename(const std::string& value) {
_internal_set_file_by_filename(value);
// @@protoc_insertion_point(field_set:grpc.reflection.v1alpha.ServerReflectionRequest.file_by_filename)
}
inline std::string* ServerReflectionRequest::mutable_file_by_filename() {
// @@protoc_insertion_point(field_mutable:grpc.reflection.v1alpha.ServerReflectionRequest.file_by_filename)
return _internal_mutable_file_by_filename();
}
inline const std::string& ServerReflectionRequest::_internal_file_by_filename() const {
if (_internal_has_file_by_filename()) {
return message_request_.file_by_filename_.GetNoArena();
}
return *&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited();
}
inline void ServerReflectionRequest::_internal_set_file_by_filename(const std::string& value) {
if (!_internal_has_file_by_filename()) {
clear_message_request();
set_has_file_by_filename();
message_request_.file_by_filename_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
message_request_.file_by_filename_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), value);
}
inline void ServerReflectionRequest::set_file_by_filename(std::string&& value) {
// @@protoc_insertion_point(field_set:grpc.reflection.v1alpha.ServerReflectionRequest.file_by_filename)
if (!_internal_has_file_by_filename()) {
clear_message_request();
set_has_file_by_filename();
message_request_.file_by_filename_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
message_request_.file_by_filename_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), ::std::move(value));
// @@protoc_insertion_point(field_set_rvalue:grpc.reflection.v1alpha.ServerReflectionRequest.file_by_filename)
}
inline void ServerReflectionRequest::set_file_by_filename(const char* value) {
GOOGLE_DCHECK(value != nullptr);
if (!_internal_has_file_by_filename()) {
clear_message_request();
set_has_file_by_filename();
message_request_.file_by_filename_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
message_request_.file_by_filename_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(),
::std::string(value));
// @@protoc_insertion_point(field_set_char:grpc.reflection.v1alpha.ServerReflectionRequest.file_by_filename)
}
inline void ServerReflectionRequest::set_file_by_filename(const char* value, size_t size) {
if (!_internal_has_file_by_filename()) {
clear_message_request();
set_has_file_by_filename();
message_request_.file_by_filename_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
message_request_.file_by_filename_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), ::std::string(
reinterpret_cast<const char*>(value), size));
// @@protoc_insertion_point(field_set_pointer:grpc.reflection.v1alpha.ServerReflectionRequest.file_by_filename)
}
inline std::string* ServerReflectionRequest::_internal_mutable_file_by_filename() {
if (!_internal_has_file_by_filename()) {
clear_message_request();
set_has_file_by_filename();
message_request_.file_by_filename_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
return message_request_.file_by_filename_.MutableNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
inline std::string* ServerReflectionRequest::release_file_by_filename() {
// @@protoc_insertion_point(field_release:grpc.reflection.v1alpha.ServerReflectionRequest.file_by_filename)
if (_internal_has_file_by_filename()) {
clear_has_message_request();
return message_request_.file_by_filename_.ReleaseNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
} else {
return nullptr;
}
}
inline void ServerReflectionRequest::set_allocated_file_by_filename(std::string* file_by_filename) {
if (has_message_request()) {
clear_message_request();
}
if (file_by_filename != nullptr) {
set_has_file_by_filename();
message_request_.file_by_filename_.UnsafeSetDefault(file_by_filename);
}
// @@protoc_insertion_point(field_set_allocated:grpc.reflection.v1alpha.ServerReflectionRequest.file_by_filename)
}
// string file_containing_symbol = 4;
inline bool ServerReflectionRequest::_internal_has_file_containing_symbol() const {
return message_request_case() == kFileContainingSymbol;
}
inline void ServerReflectionRequest::set_has_file_containing_symbol() {
_oneof_case_[0] = kFileContainingSymbol;
}
inline void ServerReflectionRequest::clear_file_containing_symbol() {
if (_internal_has_file_containing_symbol()) {
message_request_.file_containing_symbol_.DestroyNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
clear_has_message_request();
}
}
inline const std::string& ServerReflectionRequest::file_containing_symbol() const {
// @@protoc_insertion_point(field_get:grpc.reflection.v1alpha.ServerReflectionRequest.file_containing_symbol)
return _internal_file_containing_symbol();
}
inline void ServerReflectionRequest::set_file_containing_symbol(const std::string& value) {
_internal_set_file_containing_symbol(value);
// @@protoc_insertion_point(field_set:grpc.reflection.v1alpha.ServerReflectionRequest.file_containing_symbol)
}
inline std::string* ServerReflectionRequest::mutable_file_containing_symbol() {
// @@protoc_insertion_point(field_mutable:grpc.reflection.v1alpha.ServerReflectionRequest.file_containing_symbol)
return _internal_mutable_file_containing_symbol();
}
inline const std::string& ServerReflectionRequest::_internal_file_containing_symbol() const {
if (_internal_has_file_containing_symbol()) {
return message_request_.file_containing_symbol_.GetNoArena();
}
return *&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited();
}
inline void ServerReflectionRequest::_internal_set_file_containing_symbol(const std::string& value) {
if (!_internal_has_file_containing_symbol()) {
clear_message_request();
set_has_file_containing_symbol();
message_request_.file_containing_symbol_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
message_request_.file_containing_symbol_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), value);
}
inline void ServerReflectionRequest::set_file_containing_symbol(std::string&& value) {
// @@protoc_insertion_point(field_set:grpc.reflection.v1alpha.ServerReflectionRequest.file_containing_symbol)
if (!_internal_has_file_containing_symbol()) {
clear_message_request();
set_has_file_containing_symbol();
message_request_.file_containing_symbol_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
message_request_.file_containing_symbol_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), ::std::move(value));
// @@protoc_insertion_point(field_set_rvalue:grpc.reflection.v1alpha.ServerReflectionRequest.file_containing_symbol)
}
inline void ServerReflectionRequest::set_file_containing_symbol(const char* value) {
GOOGLE_DCHECK(value != nullptr);
if (!_internal_has_file_containing_symbol()) {
clear_message_request();
set_has_file_containing_symbol();
message_request_.file_containing_symbol_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
message_request_.file_containing_symbol_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(),
::std::string(value));
// @@protoc_insertion_point(field_set_char:grpc.reflection.v1alpha.ServerReflectionRequest.file_containing_symbol)
}
inline void ServerReflectionRequest::set_file_containing_symbol(const char* value, size_t size) {
if (!_internal_has_file_containing_symbol()) {
clear_message_request();
set_has_file_containing_symbol();
message_request_.file_containing_symbol_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
message_request_.file_containing_symbol_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), ::std::string(
reinterpret_cast<const char*>(value), size));
// @@protoc_insertion_point(field_set_pointer:grpc.reflection.v1alpha.ServerReflectionRequest.file_containing_symbol)
}
inline std::string* ServerReflectionRequest::_internal_mutable_file_containing_symbol() {
if (!_internal_has_file_containing_symbol()) {
clear_message_request();
set_has_file_containing_symbol();
message_request_.file_containing_symbol_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
return message_request_.file_containing_symbol_.MutableNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
inline std::string* ServerReflectionRequest::release_file_containing_symbol() {
// @@protoc_insertion_point(field_release:grpc.reflection.v1alpha.ServerReflectionRequest.file_containing_symbol)
if (_internal_has_file_containing_symbol()) {
clear_has_message_request();
return message_request_.file_containing_symbol_.ReleaseNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
} else {
return nullptr;
}
}
inline void ServerReflectionRequest::set_allocated_file_containing_symbol(std::string* file_containing_symbol) {
if (has_message_request()) {
clear_message_request();
}
if (file_containing_symbol != nullptr) {
set_has_file_containing_symbol();
message_request_.file_containing_symbol_.UnsafeSetDefault(file_containing_symbol);
}
// @@protoc_insertion_point(field_set_allocated:grpc.reflection.v1alpha.ServerReflectionRequest.file_containing_symbol)
}
// .grpc.reflection.v1alpha.ExtensionRequest file_containing_extension = 5;
inline bool ServerReflectionRequest::_internal_has_file_containing_extension() const {
return message_request_case() == kFileContainingExtension;
}
inline bool ServerReflectionRequest::has_file_containing_extension() const {
return _internal_has_file_containing_extension();
}
inline void ServerReflectionRequest::set_has_file_containing_extension() {
_oneof_case_[0] = kFileContainingExtension;
}
inline void ServerReflectionRequest::clear_file_containing_extension() {
if (_internal_has_file_containing_extension()) {
delete message_request_.file_containing_extension_;
clear_has_message_request();
}
}
inline ::grpc::reflection::v1alpha::ExtensionRequest* ServerReflectionRequest::release_file_containing_extension() {
// @@protoc_insertion_point(field_release:grpc.reflection.v1alpha.ServerReflectionRequest.file_containing_extension)
if (_internal_has_file_containing_extension()) {
clear_has_message_request();
::grpc::reflection::v1alpha::ExtensionRequest* temp = message_request_.file_containing_extension_;
message_request_.file_containing_extension_ = nullptr;
return temp;
} else {
return nullptr;
}
}
inline const ::grpc::reflection::v1alpha::ExtensionRequest& ServerReflectionRequest::_internal_file_containing_extension() const {
return _internal_has_file_containing_extension()
? *message_request_.file_containing_extension_
: *reinterpret_cast< ::grpc::reflection::v1alpha::ExtensionRequest*>(&::grpc::reflection::v1alpha::_ExtensionRequest_default_instance_);
}
inline const ::grpc::reflection::v1alpha::ExtensionRequest& ServerReflectionRequest::file_containing_extension() const {
// @@protoc_insertion_point(field_get:grpc.reflection.v1alpha.ServerReflectionRequest.file_containing_extension)
return _internal_file_containing_extension();
}
inline ::grpc::reflection::v1alpha::ExtensionRequest* ServerReflectionRequest::_internal_mutable_file_containing_extension() {
if (!_internal_has_file_containing_extension()) {
clear_message_request();
set_has_file_containing_extension();
message_request_.file_containing_extension_ = CreateMaybeMessage< ::grpc::reflection::v1alpha::ExtensionRequest >(
GetArenaNoVirtual());
}
return message_request_.file_containing_extension_;
}
inline ::grpc::reflection::v1alpha::ExtensionRequest* ServerReflectionRequest::mutable_file_containing_extension() {
// @@protoc_insertion_point(field_mutable:grpc.reflection.v1alpha.ServerReflectionRequest.file_containing_extension)
return _internal_mutable_file_containing_extension();
}
// string all_extension_numbers_of_type = 6;
inline bool ServerReflectionRequest::_internal_has_all_extension_numbers_of_type() const {
return message_request_case() == kAllExtensionNumbersOfType;
}
inline void ServerReflectionRequest::set_has_all_extension_numbers_of_type() {
_oneof_case_[0] = kAllExtensionNumbersOfType;
}
inline void ServerReflectionRequest::clear_all_extension_numbers_of_type() {
if (_internal_has_all_extension_numbers_of_type()) {
message_request_.all_extension_numbers_of_type_.DestroyNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
clear_has_message_request();
}
}
inline const std::string& ServerReflectionRequest::all_extension_numbers_of_type() const {
// @@protoc_insertion_point(field_get:grpc.reflection.v1alpha.ServerReflectionRequest.all_extension_numbers_of_type)
return _internal_all_extension_numbers_of_type();
}
inline void ServerReflectionRequest::set_all_extension_numbers_of_type(const std::string& value) {
_internal_set_all_extension_numbers_of_type(value);
// @@protoc_insertion_point(field_set:grpc.reflection.v1alpha.ServerReflectionRequest.all_extension_numbers_of_type)
}
inline std::string* ServerReflectionRequest::mutable_all_extension_numbers_of_type() {
// @@protoc_insertion_point(field_mutable:grpc.reflection.v1alpha.ServerReflectionRequest.all_extension_numbers_of_type)
return _internal_mutable_all_extension_numbers_of_type();
}
inline const std::string& ServerReflectionRequest::_internal_all_extension_numbers_of_type() const {
if (_internal_has_all_extension_numbers_of_type()) {
return message_request_.all_extension_numbers_of_type_.GetNoArena();
}
return *&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited();
}
inline void ServerReflectionRequest::_internal_set_all_extension_numbers_of_type(const std::string& value) {
if (!_internal_has_all_extension_numbers_of_type()) {
clear_message_request();
set_has_all_extension_numbers_of_type();
message_request_.all_extension_numbers_of_type_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
message_request_.all_extension_numbers_of_type_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), value);
}
inline void ServerReflectionRequest::set_all_extension_numbers_of_type(std::string&& value) {
// @@protoc_insertion_point(field_set:grpc.reflection.v1alpha.ServerReflectionRequest.all_extension_numbers_of_type)
if (!_internal_has_all_extension_numbers_of_type()) {
clear_message_request();
set_has_all_extension_numbers_of_type();
message_request_.all_extension_numbers_of_type_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
message_request_.all_extension_numbers_of_type_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), ::std::move(value));
// @@protoc_insertion_point(field_set_rvalue:grpc.reflection.v1alpha.ServerReflectionRequest.all_extension_numbers_of_type)
}
inline void ServerReflectionRequest::set_all_extension_numbers_of_type(const char* value) {
GOOGLE_DCHECK(value != nullptr);
if (!_internal_has_all_extension_numbers_of_type()) {
clear_message_request();
set_has_all_extension_numbers_of_type();
message_request_.all_extension_numbers_of_type_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
message_request_.all_extension_numbers_of_type_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(),
::std::string(value));
// @@protoc_insertion_point(field_set_char:grpc.reflection.v1alpha.ServerReflectionRequest.all_extension_numbers_of_type)
}
inline void ServerReflectionRequest::set_all_extension_numbers_of_type(const char* value, size_t size) {
if (!_internal_has_all_extension_numbers_of_type()) {
clear_message_request();
set_has_all_extension_numbers_of_type();
message_request_.all_extension_numbers_of_type_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
message_request_.all_extension_numbers_of_type_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), ::std::string(
reinterpret_cast<const char*>(value), size));
// @@protoc_insertion_point(field_set_pointer:grpc.reflection.v1alpha.ServerReflectionRequest.all_extension_numbers_of_type)
}
inline std::string* ServerReflectionRequest::_internal_mutable_all_extension_numbers_of_type() {
if (!_internal_has_all_extension_numbers_of_type()) {
clear_message_request();
set_has_all_extension_numbers_of_type();
message_request_.all_extension_numbers_of_type_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
return message_request_.all_extension_numbers_of_type_.MutableNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
inline std::string* ServerReflectionRequest::release_all_extension_numbers_of_type() {
// @@protoc_insertion_point(field_release:grpc.reflection.v1alpha.ServerReflectionRequest.all_extension_numbers_of_type)
if (_internal_has_all_extension_numbers_of_type()) {
clear_has_message_request();
return message_request_.all_extension_numbers_of_type_.ReleaseNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
} else {
return nullptr;
}
}
inline void ServerReflectionRequest::set_allocated_all_extension_numbers_of_type(std::string* all_extension_numbers_of_type) {
if (has_message_request()) {
clear_message_request();
}
if (all_extension_numbers_of_type != nullptr) {
set_has_all_extension_numbers_of_type();
message_request_.all_extension_numbers_of_type_.UnsafeSetDefault(all_extension_numbers_of_type);
}
// @@protoc_insertion_point(field_set_allocated:grpc.reflection.v1alpha.ServerReflectionRequest.all_extension_numbers_of_type)
}
// string list_services = 7;
inline bool ServerReflectionRequest::_internal_has_list_services() const {
return message_request_case() == kListServices;
}
inline void ServerReflectionRequest::set_has_list_services() {
_oneof_case_[0] = kListServices;
}
inline void ServerReflectionRequest::clear_list_services() {
if (_internal_has_list_services()) {
message_request_.list_services_.DestroyNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
clear_has_message_request();
}
}
inline const std::string& ServerReflectionRequest::list_services() const {
// @@protoc_insertion_point(field_get:grpc.reflection.v1alpha.ServerReflectionRequest.list_services)
return _internal_list_services();
}
inline void ServerReflectionRequest::set_list_services(const std::string& value) {
_internal_set_list_services(value);
// @@protoc_insertion_point(field_set:grpc.reflection.v1alpha.ServerReflectionRequest.list_services)
}
inline std::string* ServerReflectionRequest::mutable_list_services() {
// @@protoc_insertion_point(field_mutable:grpc.reflection.v1alpha.ServerReflectionRequest.list_services)
return _internal_mutable_list_services();
}
inline const std::string& ServerReflectionRequest::_internal_list_services() const {
if (_internal_has_list_services()) {
return message_request_.list_services_.GetNoArena();
}
return *&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited();
}
inline void ServerReflectionRequest::_internal_set_list_services(const std::string& value) {
if (!_internal_has_list_services()) {
clear_message_request();
set_has_list_services();
message_request_.list_services_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
message_request_.list_services_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), value);
}
inline void ServerReflectionRequest::set_list_services(std::string&& value) {
// @@protoc_insertion_point(field_set:grpc.reflection.v1alpha.ServerReflectionRequest.list_services)
if (!_internal_has_list_services()) {
clear_message_request();
set_has_list_services();
message_request_.list_services_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
message_request_.list_services_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), ::std::move(value));
// @@protoc_insertion_point(field_set_rvalue:grpc.reflection.v1alpha.ServerReflectionRequest.list_services)
}
inline void ServerReflectionRequest::set_list_services(const char* value) {
GOOGLE_DCHECK(value != nullptr);
if (!_internal_has_list_services()) {
clear_message_request();
set_has_list_services();
message_request_.list_services_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
message_request_.list_services_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(),
::std::string(value));
// @@protoc_insertion_point(field_set_char:grpc.reflection.v1alpha.ServerReflectionRequest.list_services)
}
inline void ServerReflectionRequest::set_list_services(const char* value, size_t size) {
if (!_internal_has_list_services()) {
clear_message_request();
set_has_list_services();
message_request_.list_services_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
message_request_.list_services_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), ::std::string(
reinterpret_cast<const char*>(value), size));
// @@protoc_insertion_point(field_set_pointer:grpc.reflection.v1alpha.ServerReflectionRequest.list_services)
}
inline std::string* ServerReflectionRequest::_internal_mutable_list_services() {
if (!_internal_has_list_services()) {
clear_message_request();
set_has_list_services();
message_request_.list_services_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
return message_request_.list_services_.MutableNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
inline std::string* ServerReflectionRequest::release_list_services() {
// @@protoc_insertion_point(field_release:grpc.reflection.v1alpha.ServerReflectionRequest.list_services)
if (_internal_has_list_services()) {
clear_has_message_request();
return message_request_.list_services_.ReleaseNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
} else {
return nullptr;
}
}
inline void ServerReflectionRequest::set_allocated_list_services(std::string* list_services) {
if (has_message_request()) {
clear_message_request();
}
if (list_services != nullptr) {
set_has_list_services();
message_request_.list_services_.UnsafeSetDefault(list_services);
}
// @@protoc_insertion_point(field_set_allocated:grpc.reflection.v1alpha.ServerReflectionRequest.list_services)
}
inline bool ServerReflectionRequest::has_message_request() const {
return message_request_case() != MESSAGE_REQUEST_NOT_SET;
}
inline void ServerReflectionRequest::clear_has_message_request() {
_oneof_case_[0] = MESSAGE_REQUEST_NOT_SET;
}
inline ServerReflectionRequest::MessageRequestCase ServerReflectionRequest::message_request_case() const {
return ServerReflectionRequest::MessageRequestCase(_oneof_case_[0]);
}
// -------------------------------------------------------------------
// ExtensionRequest
// string containing_type = 1;
inline void ExtensionRequest::clear_containing_type() {
containing_type_.ClearToEmptyNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
inline const std::string& ExtensionRequest::containing_type() const {
// @@protoc_insertion_point(field_get:grpc.reflection.v1alpha.ExtensionRequest.containing_type)
return _internal_containing_type();
}
inline void ExtensionRequest::set_containing_type(const std::string& value) {
_internal_set_containing_type(value);
// @@protoc_insertion_point(field_set:grpc.reflection.v1alpha.ExtensionRequest.containing_type)
}
inline std::string* ExtensionRequest::mutable_containing_type() {
// @@protoc_insertion_point(field_mutable:grpc.reflection.v1alpha.ExtensionRequest.containing_type)
return _internal_mutable_containing_type();
}
inline const std::string& ExtensionRequest::_internal_containing_type() const {
return containing_type_.GetNoArena();
}
inline void ExtensionRequest::_internal_set_containing_type(const std::string& value) {
containing_type_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), value);
}
inline void ExtensionRequest::set_containing_type(std::string&& value) {
containing_type_.SetNoArena(
&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), ::std::move(value));
// @@protoc_insertion_point(field_set_rvalue:grpc.reflection.v1alpha.ExtensionRequest.containing_type)
}
inline void ExtensionRequest::set_containing_type(const char* value) {
GOOGLE_DCHECK(value != nullptr);
containing_type_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), ::std::string(value));
// @@protoc_insertion_point(field_set_char:grpc.reflection.v1alpha.ExtensionRequest.containing_type)
}
inline void ExtensionRequest::set_containing_type(const char* value, size_t size) {
containing_type_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(),
::std::string(reinterpret_cast<const char*>(value), size));
// @@protoc_insertion_point(field_set_pointer:grpc.reflection.v1alpha.ExtensionRequest.containing_type)
}
inline std::string* ExtensionRequest::_internal_mutable_containing_type() {
return containing_type_.MutableNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
inline std::string* ExtensionRequest::release_containing_type() {
// @@protoc_insertion_point(field_release:grpc.reflection.v1alpha.ExtensionRequest.containing_type)
return containing_type_.ReleaseNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
inline void ExtensionRequest::set_allocated_containing_type(std::string* containing_type) {
if (containing_type != nullptr) {
} else {
}
containing_type_.SetAllocatedNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), containing_type);
// @@protoc_insertion_point(field_set_allocated:grpc.reflection.v1alpha.ExtensionRequest.containing_type)
}
// int32 extension_number = 2;
inline void ExtensionRequest::clear_extension_number() {
extension_number_ = 0;
}
inline ::PROTOBUF_NAMESPACE_ID::int32 ExtensionRequest::_internal_extension_number() const {
return extension_number_;
}
inline ::PROTOBUF_NAMESPACE_ID::int32 ExtensionRequest::extension_number() const {
// @@protoc_insertion_point(field_get:grpc.reflection.v1alpha.ExtensionRequest.extension_number)
return _internal_extension_number();
}
inline void ExtensionRequest::_internal_set_extension_number(::PROTOBUF_NAMESPACE_ID::int32 value) {
extension_number_ = value;
}
inline void ExtensionRequest::set_extension_number(::PROTOBUF_NAMESPACE_ID::int32 value) {
_internal_set_extension_number(value);
// @@protoc_insertion_point(field_set:grpc.reflection.v1alpha.ExtensionRequest.extension_number)
}
// -------------------------------------------------------------------
// ServerReflectionResponse
// string valid_host = 1;
inline void ServerReflectionResponse::clear_valid_host() {
valid_host_.ClearToEmptyNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
inline const std::string& ServerReflectionResponse::valid_host() const {
// @@protoc_insertion_point(field_get:grpc.reflection.v1alpha.ServerReflectionResponse.valid_host)
return _internal_valid_host();
}
inline void ServerReflectionResponse::set_valid_host(const std::string& value) {
_internal_set_valid_host(value);
// @@protoc_insertion_point(field_set:grpc.reflection.v1alpha.ServerReflectionResponse.valid_host)
}
inline std::string* ServerReflectionResponse::mutable_valid_host() {
// @@protoc_insertion_point(field_mutable:grpc.reflection.v1alpha.ServerReflectionResponse.valid_host)
return _internal_mutable_valid_host();
}
inline const std::string& ServerReflectionResponse::_internal_valid_host() const {
return valid_host_.GetNoArena();
}
inline void ServerReflectionResponse::_internal_set_valid_host(const std::string& value) {
valid_host_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), value);
}
inline void ServerReflectionResponse::set_valid_host(std::string&& value) {
valid_host_.SetNoArena(
&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), ::std::move(value));
// @@protoc_insertion_point(field_set_rvalue:grpc.reflection.v1alpha.ServerReflectionResponse.valid_host)
}
inline void ServerReflectionResponse::set_valid_host(const char* value) {
GOOGLE_DCHECK(value != nullptr);
valid_host_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), ::std::string(value));
// @@protoc_insertion_point(field_set_char:grpc.reflection.v1alpha.ServerReflectionResponse.valid_host)
}
inline void ServerReflectionResponse::set_valid_host(const char* value, size_t size) {
valid_host_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(),
::std::string(reinterpret_cast<const char*>(value), size));
// @@protoc_insertion_point(field_set_pointer:grpc.reflection.v1alpha.ServerReflectionResponse.valid_host)
}
inline std::string* ServerReflectionResponse::_internal_mutable_valid_host() {
return valid_host_.MutableNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
inline std::string* ServerReflectionResponse::release_valid_host() {
// @@protoc_insertion_point(field_release:grpc.reflection.v1alpha.ServerReflectionResponse.valid_host)
return valid_host_.ReleaseNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
inline void ServerReflectionResponse::set_allocated_valid_host(std::string* valid_host) {
if (valid_host != nullptr) {
} else {
}
valid_host_.SetAllocatedNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), valid_host);
// @@protoc_insertion_point(field_set_allocated:grpc.reflection.v1alpha.ServerReflectionResponse.valid_host)
}
// .grpc.reflection.v1alpha.ServerReflectionRequest original_request = 2;
inline bool ServerReflectionResponse::_internal_has_original_request() const {
return this != internal_default_instance() && original_request_ != nullptr;
}
inline bool ServerReflectionResponse::has_original_request() const {
return _internal_has_original_request();
}
inline void ServerReflectionResponse::clear_original_request() {
if (GetArenaNoVirtual() == nullptr && original_request_ != nullptr) {
delete original_request_;
}
original_request_ = nullptr;
}
inline const ::grpc::reflection::v1alpha::ServerReflectionRequest& ServerReflectionResponse::_internal_original_request() const {
const ::grpc::reflection::v1alpha::ServerReflectionRequest* p = original_request_;
return p != nullptr ? *p : *reinterpret_cast<const ::grpc::reflection::v1alpha::ServerReflectionRequest*>(
&::grpc::reflection::v1alpha::_ServerReflectionRequest_default_instance_);
}
inline const ::grpc::reflection::v1alpha::ServerReflectionRequest& ServerReflectionResponse::original_request() const {
// @@protoc_insertion_point(field_get:grpc.reflection.v1alpha.ServerReflectionResponse.original_request)
return _internal_original_request();
}
inline ::grpc::reflection::v1alpha::ServerReflectionRequest* ServerReflectionResponse::release_original_request() {
// @@protoc_insertion_point(field_release:grpc.reflection.v1alpha.ServerReflectionResponse.original_request)
::grpc::reflection::v1alpha::ServerReflectionRequest* temp = original_request_;
original_request_ = nullptr;
return temp;
}
inline ::grpc::reflection::v1alpha::ServerReflectionRequest* ServerReflectionResponse::_internal_mutable_original_request() {
if (original_request_ == nullptr) {
auto* p = CreateMaybeMessage<::grpc::reflection::v1alpha::ServerReflectionRequest>(GetArenaNoVirtual());
original_request_ = p;
}
return original_request_;
}
inline ::grpc::reflection::v1alpha::ServerReflectionRequest* ServerReflectionResponse::mutable_original_request() {
// @@protoc_insertion_point(field_mutable:grpc.reflection.v1alpha.ServerReflectionResponse.original_request)
return _internal_mutable_original_request();
}
inline void ServerReflectionResponse::set_allocated_original_request(::grpc::reflection::v1alpha::ServerReflectionRequest* original_request) {
::PROTOBUF_NAMESPACE_ID::Arena* message_arena = GetArenaNoVirtual();
if (message_arena == nullptr) {
delete original_request_;
}
if (original_request) {
::PROTOBUF_NAMESPACE_ID::Arena* submessage_arena = nullptr;
if (message_arena != submessage_arena) {
original_request = ::PROTOBUF_NAMESPACE_ID::internal::GetOwnedMessage(
message_arena, original_request, submessage_arena);
}
} else {
}
original_request_ = original_request;
// @@protoc_insertion_point(field_set_allocated:grpc.reflection.v1alpha.ServerReflectionResponse.original_request)
}
// .grpc.reflection.v1alpha.FileDescriptorResponse file_descriptor_response = 4;
inline bool ServerReflectionResponse::_internal_has_file_descriptor_response() const {
return message_response_case() == kFileDescriptorResponse;
}
inline bool ServerReflectionResponse::has_file_descriptor_response() const {
return _internal_has_file_descriptor_response();
}
inline void ServerReflectionResponse::set_has_file_descriptor_response() {
_oneof_case_[0] = kFileDescriptorResponse;
}
inline void ServerReflectionResponse::clear_file_descriptor_response() {
if (_internal_has_file_descriptor_response()) {
delete message_response_.file_descriptor_response_;
clear_has_message_response();
}
}
inline ::grpc::reflection::v1alpha::FileDescriptorResponse* ServerReflectionResponse::release_file_descriptor_response() {
// @@protoc_insertion_point(field_release:grpc.reflection.v1alpha.ServerReflectionResponse.file_descriptor_response)
if (_internal_has_file_descriptor_response()) {
clear_has_message_response();
::grpc::reflection::v1alpha::FileDescriptorResponse* temp = message_response_.file_descriptor_response_;
message_response_.file_descriptor_response_ = nullptr;
return temp;
} else {
return nullptr;
}
}
inline const ::grpc::reflection::v1alpha::FileDescriptorResponse& ServerReflectionResponse::_internal_file_descriptor_response() const {
return _internal_has_file_descriptor_response()
? *message_response_.file_descriptor_response_
: *reinterpret_cast< ::grpc::reflection::v1alpha::FileDescriptorResponse*>(&::grpc::reflection::v1alpha::_FileDescriptorResponse_default_instance_);
}
inline const ::grpc::reflection::v1alpha::FileDescriptorResponse& ServerReflectionResponse::file_descriptor_response() const {
// @@protoc_insertion_point(field_get:grpc.reflection.v1alpha.ServerReflectionResponse.file_descriptor_response)
return _internal_file_descriptor_response();
}
inline ::grpc::reflection::v1alpha::FileDescriptorResponse* ServerReflectionResponse::_internal_mutable_file_descriptor_response() {
if (!_internal_has_file_descriptor_response()) {
clear_message_response();
set_has_file_descriptor_response();
message_response_.file_descriptor_response_ = CreateMaybeMessage< ::grpc::reflection::v1alpha::FileDescriptorResponse >(
GetArenaNoVirtual());
}
return message_response_.file_descriptor_response_;
}
inline ::grpc::reflection::v1alpha::FileDescriptorResponse* ServerReflectionResponse::mutable_file_descriptor_response() {
// @@protoc_insertion_point(field_mutable:grpc.reflection.v1alpha.ServerReflectionResponse.file_descriptor_response)
return _internal_mutable_file_descriptor_response();
}
// .grpc.reflection.v1alpha.ExtensionNumberResponse all_extension_numbers_response = 5;
inline bool ServerReflectionResponse::_internal_has_all_extension_numbers_response() const {
return message_response_case() == kAllExtensionNumbersResponse;
}
inline bool ServerReflectionResponse::has_all_extension_numbers_response() const {
return _internal_has_all_extension_numbers_response();
}
inline void ServerReflectionResponse::set_has_all_extension_numbers_response() {
_oneof_case_[0] = kAllExtensionNumbersResponse;
}
inline void ServerReflectionResponse::clear_all_extension_numbers_response() {
if (_internal_has_all_extension_numbers_response()) {
delete message_response_.all_extension_numbers_response_;
clear_has_message_response();
}
}
inline ::grpc::reflection::v1alpha::ExtensionNumberResponse* ServerReflectionResponse::release_all_extension_numbers_response() {
// @@protoc_insertion_point(field_release:grpc.reflection.v1alpha.ServerReflectionResponse.all_extension_numbers_response)
if (_internal_has_all_extension_numbers_response()) {
clear_has_message_response();
::grpc::reflection::v1alpha::ExtensionNumberResponse* temp = message_response_.all_extension_numbers_response_;
message_response_.all_extension_numbers_response_ = nullptr;
return temp;
} else {
return nullptr;
}
}
inline const ::grpc::reflection::v1alpha::ExtensionNumberResponse& ServerReflectionResponse::_internal_all_extension_numbers_response() const {
return _internal_has_all_extension_numbers_response()
? *message_response_.all_extension_numbers_response_
: *reinterpret_cast< ::grpc::reflection::v1alpha::ExtensionNumberResponse*>(&::grpc::reflection::v1alpha::_ExtensionNumberResponse_default_instance_);
}
inline const ::grpc::reflection::v1alpha::ExtensionNumberResponse& ServerReflectionResponse::all_extension_numbers_response() const {
// @@protoc_insertion_point(field_get:grpc.reflection.v1alpha.ServerReflectionResponse.all_extension_numbers_response)
return _internal_all_extension_numbers_response();
}
inline ::grpc::reflection::v1alpha::ExtensionNumberResponse* ServerReflectionResponse::_internal_mutable_all_extension_numbers_response() {
if (!_internal_has_all_extension_numbers_response()) {
clear_message_response();
set_has_all_extension_numbers_response();
message_response_.all_extension_numbers_response_ = CreateMaybeMessage< ::grpc::reflection::v1alpha::ExtensionNumberResponse >(
GetArenaNoVirtual());
}
return message_response_.all_extension_numbers_response_;
}
inline ::grpc::reflection::v1alpha::ExtensionNumberResponse* ServerReflectionResponse::mutable_all_extension_numbers_response() {
// @@protoc_insertion_point(field_mutable:grpc.reflection.v1alpha.ServerReflectionResponse.all_extension_numbers_response)
return _internal_mutable_all_extension_numbers_response();
}
// .grpc.reflection.v1alpha.ListServiceResponse list_services_response = 6;
inline bool ServerReflectionResponse::_internal_has_list_services_response() const {
return message_response_case() == kListServicesResponse;
}
inline bool ServerReflectionResponse::has_list_services_response() const {
return _internal_has_list_services_response();
}
inline void ServerReflectionResponse::set_has_list_services_response() {
_oneof_case_[0] = kListServicesResponse;
}
inline void ServerReflectionResponse::clear_list_services_response() {
if (_internal_has_list_services_response()) {
delete message_response_.list_services_response_;
clear_has_message_response();
}
}
inline ::grpc::reflection::v1alpha::ListServiceResponse* ServerReflectionResponse::release_list_services_response() {
// @@protoc_insertion_point(field_release:grpc.reflection.v1alpha.ServerReflectionResponse.list_services_response)
if (_internal_has_list_services_response()) {
clear_has_message_response();
::grpc::reflection::v1alpha::ListServiceResponse* temp = message_response_.list_services_response_;
message_response_.list_services_response_ = nullptr;
return temp;
} else {
return nullptr;
}
}
inline const ::grpc::reflection::v1alpha::ListServiceResponse& ServerReflectionResponse::_internal_list_services_response() const {
return _internal_has_list_services_response()
? *message_response_.list_services_response_
: *reinterpret_cast< ::grpc::reflection::v1alpha::ListServiceResponse*>(&::grpc::reflection::v1alpha::_ListServiceResponse_default_instance_);
}
inline const ::grpc::reflection::v1alpha::ListServiceResponse& ServerReflectionResponse::list_services_response() const {
// @@protoc_insertion_point(field_get:grpc.reflection.v1alpha.ServerReflectionResponse.list_services_response)
return _internal_list_services_response();
}
inline ::grpc::reflection::v1alpha::ListServiceResponse* ServerReflectionResponse::_internal_mutable_list_services_response() {
if (!_internal_has_list_services_response()) {
clear_message_response();
set_has_list_services_response();
message_response_.list_services_response_ = CreateMaybeMessage< ::grpc::reflection::v1alpha::ListServiceResponse >(
GetArenaNoVirtual());
}
return message_response_.list_services_response_;
}
inline ::grpc::reflection::v1alpha::ListServiceResponse* ServerReflectionResponse::mutable_list_services_response() {
// @@protoc_insertion_point(field_mutable:grpc.reflection.v1alpha.ServerReflectionResponse.list_services_response)
return _internal_mutable_list_services_response();
}
// .grpc.reflection.v1alpha.ErrorResponse error_response = 7;
inline bool ServerReflectionResponse::_internal_has_error_response() const {
return message_response_case() == kErrorResponse;
}
inline bool ServerReflectionResponse::has_error_response() const {
return _internal_has_error_response();
}
inline void ServerReflectionResponse::set_has_error_response() {
_oneof_case_[0] = kErrorResponse;
}
inline void ServerReflectionResponse::clear_error_response() {
if (_internal_has_error_response()) {
delete message_response_.error_response_;
clear_has_message_response();
}
}
inline ::grpc::reflection::v1alpha::ErrorResponse* ServerReflectionResponse::release_error_response() {
// @@protoc_insertion_point(field_release:grpc.reflection.v1alpha.ServerReflectionResponse.error_response)
if (_internal_has_error_response()) {
clear_has_message_response();
::grpc::reflection::v1alpha::ErrorResponse* temp = message_response_.error_response_;
message_response_.error_response_ = nullptr;
return temp;
} else {
return nullptr;
}
}
inline const ::grpc::reflection::v1alpha::ErrorResponse& ServerReflectionResponse::_internal_error_response() const {
return _internal_has_error_response()
? *message_response_.error_response_
: *reinterpret_cast< ::grpc::reflection::v1alpha::ErrorResponse*>(&::grpc::reflection::v1alpha::_ErrorResponse_default_instance_);
}
inline const ::grpc::reflection::v1alpha::ErrorResponse& ServerReflectionResponse::error_response() const {
// @@protoc_insertion_point(field_get:grpc.reflection.v1alpha.ServerReflectionResponse.error_response)
return _internal_error_response();
}
inline ::grpc::reflection::v1alpha::ErrorResponse* ServerReflectionResponse::_internal_mutable_error_response() {
if (!_internal_has_error_response()) {
clear_message_response();
set_has_error_response();
message_response_.error_response_ = CreateMaybeMessage< ::grpc::reflection::v1alpha::ErrorResponse >(
GetArenaNoVirtual());
}
return message_response_.error_response_;
}
inline ::grpc::reflection::v1alpha::ErrorResponse* ServerReflectionResponse::mutable_error_response() {
// @@protoc_insertion_point(field_mutable:grpc.reflection.v1alpha.ServerReflectionResponse.error_response)
return _internal_mutable_error_response();
}
inline bool ServerReflectionResponse::has_message_response() const {
return message_response_case() != MESSAGE_RESPONSE_NOT_SET;
}
inline void ServerReflectionResponse::clear_has_message_response() {
_oneof_case_[0] = MESSAGE_RESPONSE_NOT_SET;
}
inline ServerReflectionResponse::MessageResponseCase ServerReflectionResponse::message_response_case() const {
return ServerReflectionResponse::MessageResponseCase(_oneof_case_[0]);
}
// -------------------------------------------------------------------
// FileDescriptorResponse
// repeated bytes file_descriptor_proto = 1;
inline int FileDescriptorResponse::_internal_file_descriptor_proto_size() const {
return file_descriptor_proto_.size();
}
inline int FileDescriptorResponse::file_descriptor_proto_size() const {
return _internal_file_descriptor_proto_size();
}
inline void FileDescriptorResponse::clear_file_descriptor_proto() {
file_descriptor_proto_.Clear();
}
inline std::string* FileDescriptorResponse::add_file_descriptor_proto() {
// @@protoc_insertion_point(field_add_mutable:grpc.reflection.v1alpha.FileDescriptorResponse.file_descriptor_proto)
return _internal_add_file_descriptor_proto();
}
inline const std::string& FileDescriptorResponse::_internal_file_descriptor_proto(int index) const {
return file_descriptor_proto_.Get(index);
}
inline const std::string& FileDescriptorResponse::file_descriptor_proto(int index) const {
// @@protoc_insertion_point(field_get:grpc.reflection.v1alpha.FileDescriptorResponse.file_descriptor_proto)
return _internal_file_descriptor_proto(index);
}
inline std::string* FileDescriptorResponse::mutable_file_descriptor_proto(int index) {
// @@protoc_insertion_point(field_mutable:grpc.reflection.v1alpha.FileDescriptorResponse.file_descriptor_proto)
return file_descriptor_proto_.Mutable(index);
}
inline void FileDescriptorResponse::set_file_descriptor_proto(int index, const std::string& value) {
// @@protoc_insertion_point(field_set:grpc.reflection.v1alpha.FileDescriptorResponse.file_descriptor_proto)
file_descriptor_proto_.Mutable(index)->assign(value);
}
inline void FileDescriptorResponse::set_file_descriptor_proto(int index, std::string&& value) {
// @@protoc_insertion_point(field_set:grpc.reflection.v1alpha.FileDescriptorResponse.file_descriptor_proto)
file_descriptor_proto_.Mutable(index)->assign(std::move(value));
}
inline void FileDescriptorResponse::set_file_descriptor_proto(int index, const char* value) {
GOOGLE_DCHECK(value != nullptr);
file_descriptor_proto_.Mutable(index)->assign(value);
// @@protoc_insertion_point(field_set_char:grpc.reflection.v1alpha.FileDescriptorResponse.file_descriptor_proto)
}
inline void FileDescriptorResponse::set_file_descriptor_proto(int index, const void* value, size_t size) {
file_descriptor_proto_.Mutable(index)->assign(
reinterpret_cast<const char*>(value), size);
// @@protoc_insertion_point(field_set_pointer:grpc.reflection.v1alpha.FileDescriptorResponse.file_descriptor_proto)
}
inline std::string* FileDescriptorResponse::_internal_add_file_descriptor_proto() {
return file_descriptor_proto_.Add();
}
inline void FileDescriptorResponse::add_file_descriptor_proto(const std::string& value) {
file_descriptor_proto_.Add()->assign(value);
// @@protoc_insertion_point(field_add:grpc.reflection.v1alpha.FileDescriptorResponse.file_descriptor_proto)
}
inline void FileDescriptorResponse::add_file_descriptor_proto(std::string&& value) {
file_descriptor_proto_.Add(std::move(value));
// @@protoc_insertion_point(field_add:grpc.reflection.v1alpha.FileDescriptorResponse.file_descriptor_proto)
}
inline void FileDescriptorResponse::add_file_descriptor_proto(const char* value) {
GOOGLE_DCHECK(value != nullptr);
file_descriptor_proto_.Add()->assign(value);
// @@protoc_insertion_point(field_add_char:grpc.reflection.v1alpha.FileDescriptorResponse.file_descriptor_proto)
}
inline void FileDescriptorResponse::add_file_descriptor_proto(const void* value, size_t size) {
file_descriptor_proto_.Add()->assign(reinterpret_cast<const char*>(value), size);
// @@protoc_insertion_point(field_add_pointer:grpc.reflection.v1alpha.FileDescriptorResponse.file_descriptor_proto)
}
inline const ::PROTOBUF_NAMESPACE_ID::RepeatedPtrField<std::string>&
FileDescriptorResponse::file_descriptor_proto() const {
// @@protoc_insertion_point(field_list:grpc.reflection.v1alpha.FileDescriptorResponse.file_descriptor_proto)
return file_descriptor_proto_;
}
inline ::PROTOBUF_NAMESPACE_ID::RepeatedPtrField<std::string>*
FileDescriptorResponse::mutable_file_descriptor_proto() {
// @@protoc_insertion_point(field_mutable_list:grpc.reflection.v1alpha.FileDescriptorResponse.file_descriptor_proto)
return &file_descriptor_proto_;
}
// -------------------------------------------------------------------
// ExtensionNumberResponse
// string base_type_name = 1;
inline void ExtensionNumberResponse::clear_base_type_name() {
base_type_name_.ClearToEmptyNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
inline const std::string& ExtensionNumberResponse::base_type_name() const {
// @@protoc_insertion_point(field_get:grpc.reflection.v1alpha.ExtensionNumberResponse.base_type_name)
return _internal_base_type_name();
}
inline void ExtensionNumberResponse::set_base_type_name(const std::string& value) {
_internal_set_base_type_name(value);
// @@protoc_insertion_point(field_set:grpc.reflection.v1alpha.ExtensionNumberResponse.base_type_name)
}
inline std::string* ExtensionNumberResponse::mutable_base_type_name() {
// @@protoc_insertion_point(field_mutable:grpc.reflection.v1alpha.ExtensionNumberResponse.base_type_name)
return _internal_mutable_base_type_name();
}
inline const std::string& ExtensionNumberResponse::_internal_base_type_name() const {
return base_type_name_.GetNoArena();
}
inline void ExtensionNumberResponse::_internal_set_base_type_name(const std::string& value) {
base_type_name_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), value);
}
inline void ExtensionNumberResponse::set_base_type_name(std::string&& value) {
base_type_name_.SetNoArena(
&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), ::std::move(value));
// @@protoc_insertion_point(field_set_rvalue:grpc.reflection.v1alpha.ExtensionNumberResponse.base_type_name)
}
inline void ExtensionNumberResponse::set_base_type_name(const char* value) {
GOOGLE_DCHECK(value != nullptr);
base_type_name_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), ::std::string(value));
// @@protoc_insertion_point(field_set_char:grpc.reflection.v1alpha.ExtensionNumberResponse.base_type_name)
}
inline void ExtensionNumberResponse::set_base_type_name(const char* value, size_t size) {
base_type_name_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(),
::std::string(reinterpret_cast<const char*>(value), size));
// @@protoc_insertion_point(field_set_pointer:grpc.reflection.v1alpha.ExtensionNumberResponse.base_type_name)
}
inline std::string* ExtensionNumberResponse::_internal_mutable_base_type_name() {
return base_type_name_.MutableNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
inline std::string* ExtensionNumberResponse::release_base_type_name() {
// @@protoc_insertion_point(field_release:grpc.reflection.v1alpha.ExtensionNumberResponse.base_type_name)
return base_type_name_.ReleaseNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
inline void ExtensionNumberResponse::set_allocated_base_type_name(std::string* base_type_name) {
if (base_type_name != nullptr) {
} else {
}
base_type_name_.SetAllocatedNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), base_type_name);
// @@protoc_insertion_point(field_set_allocated:grpc.reflection.v1alpha.ExtensionNumberResponse.base_type_name)
}
// repeated int32 extension_number = 2;
inline int ExtensionNumberResponse::_internal_extension_number_size() const {
return extension_number_.size();
}
inline int ExtensionNumberResponse::extension_number_size() const {
return _internal_extension_number_size();
}
inline void ExtensionNumberResponse::clear_extension_number() {
extension_number_.Clear();
}
inline ::PROTOBUF_NAMESPACE_ID::int32 ExtensionNumberResponse::_internal_extension_number(int index) const {
return extension_number_.Get(index);
}
inline ::PROTOBUF_NAMESPACE_ID::int32 ExtensionNumberResponse::extension_number(int index) const {
// @@protoc_insertion_point(field_get:grpc.reflection.v1alpha.ExtensionNumberResponse.extension_number)
return _internal_extension_number(index);
}
inline void ExtensionNumberResponse::set_extension_number(int index, ::PROTOBUF_NAMESPACE_ID::int32 value) {
extension_number_.Set(index, value);
// @@protoc_insertion_point(field_set:grpc.reflection.v1alpha.ExtensionNumberResponse.extension_number)
}
inline void ExtensionNumberResponse::_internal_add_extension_number(::PROTOBUF_NAMESPACE_ID::int32 value) {
extension_number_.Add(value);
}
inline void ExtensionNumberResponse::add_extension_number(::PROTOBUF_NAMESPACE_ID::int32 value) {
_internal_add_extension_number(value);
// @@protoc_insertion_point(field_add:grpc.reflection.v1alpha.ExtensionNumberResponse.extension_number)
}
inline const ::PROTOBUF_NAMESPACE_ID::RepeatedField< ::PROTOBUF_NAMESPACE_ID::int32 >&
ExtensionNumberResponse::_internal_extension_number() const {
return extension_number_;
}
inline const ::PROTOBUF_NAMESPACE_ID::RepeatedField< ::PROTOBUF_NAMESPACE_ID::int32 >&
ExtensionNumberResponse::extension_number() const {
// @@protoc_insertion_point(field_list:grpc.reflection.v1alpha.ExtensionNumberResponse.extension_number)
return _internal_extension_number();
}
inline ::PROTOBUF_NAMESPACE_ID::RepeatedField< ::PROTOBUF_NAMESPACE_ID::int32 >*
ExtensionNumberResponse::_internal_mutable_extension_number() {
return &extension_number_;
}
inline ::PROTOBUF_NAMESPACE_ID::RepeatedField< ::PROTOBUF_NAMESPACE_ID::int32 >*
ExtensionNumberResponse::mutable_extension_number() {
// @@protoc_insertion_point(field_mutable_list:grpc.reflection.v1alpha.ExtensionNumberResponse.extension_number)
return _internal_mutable_extension_number();
}
// -------------------------------------------------------------------
// ListServiceResponse
// repeated .grpc.reflection.v1alpha.ServiceResponse service = 1;
inline int ListServiceResponse::_internal_service_size() const {
return service_.size();
}
inline int ListServiceResponse::service_size() const {
return _internal_service_size();
}
inline void ListServiceResponse::clear_service() {
service_.Clear();
}
inline ::grpc::reflection::v1alpha::ServiceResponse* ListServiceResponse::mutable_service(int index) {
// @@protoc_insertion_point(field_mutable:grpc.reflection.v1alpha.ListServiceResponse.service)
return service_.Mutable(index);
}
inline ::PROTOBUF_NAMESPACE_ID::RepeatedPtrField< ::grpc::reflection::v1alpha::ServiceResponse >*
ListServiceResponse::mutable_service() {
// @@protoc_insertion_point(field_mutable_list:grpc.reflection.v1alpha.ListServiceResponse.service)
return &service_;
}
inline const ::grpc::reflection::v1alpha::ServiceResponse& ListServiceResponse::_internal_service(int index) const {
return service_.Get(index);
}
inline const ::grpc::reflection::v1alpha::ServiceResponse& ListServiceResponse::service(int index) const {
// @@protoc_insertion_point(field_get:grpc.reflection.v1alpha.ListServiceResponse.service)
return _internal_service(index);
}
inline ::grpc::reflection::v1alpha::ServiceResponse* ListServiceResponse::_internal_add_service() {
return service_.Add();
}
inline ::grpc::reflection::v1alpha::ServiceResponse* ListServiceResponse::add_service() {
// @@protoc_insertion_point(field_add:grpc.reflection.v1alpha.ListServiceResponse.service)
return _internal_add_service();
}
inline const ::PROTOBUF_NAMESPACE_ID::RepeatedPtrField< ::grpc::reflection::v1alpha::ServiceResponse >&
ListServiceResponse::service() const {
// @@protoc_insertion_point(field_list:grpc.reflection.v1alpha.ListServiceResponse.service)
return service_;
}
// -------------------------------------------------------------------
// ServiceResponse
// string name = 1;
inline void ServiceResponse::clear_name() {
name_.ClearToEmptyNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
inline const std::string& ServiceResponse::name() const {
// @@protoc_insertion_point(field_get:grpc.reflection.v1alpha.ServiceResponse.name)
return _internal_name();
}
inline void ServiceResponse::set_name(const std::string& value) {
_internal_set_name(value);
// @@protoc_insertion_point(field_set:grpc.reflection.v1alpha.ServiceResponse.name)
}
inline std::string* ServiceResponse::mutable_name() {
// @@protoc_insertion_point(field_mutable:grpc.reflection.v1alpha.ServiceResponse.name)
return _internal_mutable_name();
}
inline const std::string& ServiceResponse::_internal_name() const {
return name_.GetNoArena();
}
inline void ServiceResponse::_internal_set_name(const std::string& value) {
name_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), value);
}
inline void ServiceResponse::set_name(std::string&& value) {
name_.SetNoArena(
&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), ::std::move(value));
// @@protoc_insertion_point(field_set_rvalue:grpc.reflection.v1alpha.ServiceResponse.name)
}
inline void ServiceResponse::set_name(const char* value) {
GOOGLE_DCHECK(value != nullptr);
name_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), ::std::string(value));
// @@protoc_insertion_point(field_set_char:grpc.reflection.v1alpha.ServiceResponse.name)
}
inline void ServiceResponse::set_name(const char* value, size_t size) {
name_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(),
::std::string(reinterpret_cast<const char*>(value), size));
// @@protoc_insertion_point(field_set_pointer:grpc.reflection.v1alpha.ServiceResponse.name)
}
inline std::string* ServiceResponse::_internal_mutable_name() {
return name_.MutableNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
inline std::string* ServiceResponse::release_name() {
// @@protoc_insertion_point(field_release:grpc.reflection.v1alpha.ServiceResponse.name)
return name_.ReleaseNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
inline void ServiceResponse::set_allocated_name(std::string* name) {
if (name != nullptr) {
} else {
}
name_.SetAllocatedNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), name);
// @@protoc_insertion_point(field_set_allocated:grpc.reflection.v1alpha.ServiceResponse.name)
}
// -------------------------------------------------------------------
// ErrorResponse
// int32 error_code = 1;
inline void ErrorResponse::clear_error_code() {
error_code_ = 0;
}
inline ::PROTOBUF_NAMESPACE_ID::int32 ErrorResponse::_internal_error_code() const {
return error_code_;
}
inline ::PROTOBUF_NAMESPACE_ID::int32 ErrorResponse::error_code() const {
// @@protoc_insertion_point(field_get:grpc.reflection.v1alpha.ErrorResponse.error_code)
return _internal_error_code();
}
inline void ErrorResponse::_internal_set_error_code(::PROTOBUF_NAMESPACE_ID::int32 value) {
error_code_ = value;
}
inline void ErrorResponse::set_error_code(::PROTOBUF_NAMESPACE_ID::int32 value) {
_internal_set_error_code(value);
// @@protoc_insertion_point(field_set:grpc.reflection.v1alpha.ErrorResponse.error_code)
}
// string error_message = 2;
inline void ErrorResponse::clear_error_message() {
error_message_.ClearToEmptyNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
inline const std::string& ErrorResponse::error_message() const {
// @@protoc_insertion_point(field_get:grpc.reflection.v1alpha.ErrorResponse.error_message)
return _internal_error_message();
}
inline void ErrorResponse::set_error_message(const std::string& value) {
_internal_set_error_message(value);
// @@protoc_insertion_point(field_set:grpc.reflection.v1alpha.ErrorResponse.error_message)
}
inline std::string* ErrorResponse::mutable_error_message() {
// @@protoc_insertion_point(field_mutable:grpc.reflection.v1alpha.ErrorResponse.error_message)
return _internal_mutable_error_message();
}
inline const std::string& ErrorResponse::_internal_error_message() const {
return error_message_.GetNoArena();
}
inline void ErrorResponse::_internal_set_error_message(const std::string& value) {
error_message_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), value);
}
inline void ErrorResponse::set_error_message(std::string&& value) {
error_message_.SetNoArena(
&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), ::std::move(value));
// @@protoc_insertion_point(field_set_rvalue:grpc.reflection.v1alpha.ErrorResponse.error_message)
}
inline void ErrorResponse::set_error_message(const char* value) {
GOOGLE_DCHECK(value != nullptr);
error_message_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), ::std::string(value));
// @@protoc_insertion_point(field_set_char:grpc.reflection.v1alpha.ErrorResponse.error_message)
}
inline void ErrorResponse::set_error_message(const char* value, size_t size) {
error_message_.SetNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(),
::std::string(reinterpret_cast<const char*>(value), size));
// @@protoc_insertion_point(field_set_pointer:grpc.reflection.v1alpha.ErrorResponse.error_message)
}
inline std::string* ErrorResponse::_internal_mutable_error_message() {
return error_message_.MutableNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
inline std::string* ErrorResponse::release_error_message() {
// @@protoc_insertion_point(field_release:grpc.reflection.v1alpha.ErrorResponse.error_message)
return error_message_.ReleaseNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
}
inline void ErrorResponse::set_allocated_error_message(std::string* error_message) {
if (error_message != nullptr) {
} else {
}
error_message_.SetAllocatedNoArena(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited(), error_message);
// @@protoc_insertion_point(field_set_allocated:grpc.reflection.v1alpha.ErrorResponse.error_message)
}
#ifdef __GNUC__
#pragma GCC diagnostic pop
#endif // __GNUC__
// -------------------------------------------------------------------
// -------------------------------------------------------------------
// -------------------------------------------------------------------
// -------------------------------------------------------------------
// -------------------------------------------------------------------
// -------------------------------------------------------------------
// -------------------------------------------------------------------
// @@protoc_insertion_point(namespace_scope)
} // namespace v1alpha
} // namespace reflection
} // namespace grpc
// @@protoc_insertion_point(global_scope)
#include <google/protobuf/port_undef.inc>
#endif // GOOGLE_PROTOBUF_INCLUDED_GOOGLE_PROTOBUF_INCLUDED_src_2fproto_2fgrpc_2freflection_2fv1alpha_2freflection_2eproto
| [
"iskettan@uwaterloo.ca"
] | iskettan@uwaterloo.ca |
3cc1c7feebe6e332dd3e3eff4c5ba08d534c8e1c | 24f26275ffcd9324998d7570ea9fda82578eeb9e | /chrome/browser/ui/views/layout/interpolating_layout_manager.cc | ce149dd9661a31305d4a4a78ee69a4411be02a1e | [
"BSD-3-Clause"
] | permissive | Vizionnation/chromenohistory | 70a51193c8538d7b995000a1b2a654e70603040f | 146feeb85985a6835f4b8826ad67be9195455402 | refs/heads/master | 2022-12-15T07:02:54.461083 | 2019-10-25T15:07:06 | 2019-10-25T15:07:06 | 217,557,501 | 2 | 1 | BSD-3-Clause | 2022-11-19T06:53:07 | 2019-10-25T14:58:54 | null | UTF-8 | C++ | false | false | 6,378 | cc | // Copyright 2019 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/ui/views/layout/interpolating_layout_manager.h"
#include <memory>
#include <utility>
#include "ui/gfx/animation/tween.h"
#include "ui/views/view.h"
InterpolatingLayoutManager::InterpolatingLayoutManager() {}
InterpolatingLayoutManager::~InterpolatingLayoutManager() = default;
InterpolatingLayoutManager& InterpolatingLayoutManager::SetOrientation(
views::LayoutOrientation orientation) {
if (orientation_ != orientation) {
orientation_ = orientation;
InvalidateHost(true);
}
return *this;
}
void InterpolatingLayoutManager::AddLayoutInternal(
LayoutManagerBase* engine,
const views::Span& interpolation_range) {
DCHECK(engine);
auto result = embedded_layouts_.emplace(
std::make_pair(interpolation_range, std::move(engine)));
DCHECK(result.second) << "Cannot replace existing layout manager for "
<< interpolation_range.ToString();
#if DCHECK_IS_ON()
// Sanity checking to ensure interpolation ranges do not overlap (we can
// only interpolate between two layouts currently).
auto next = result.first;
++next;
if (next != embedded_layouts_.end())
DCHECK_GE(next->first.start(), interpolation_range.end());
if (result.first != embedded_layouts_.begin()) {
auto prev = result.first;
--prev;
DCHECK_LE(prev->first.end(), interpolation_range.start());
}
#endif // DCHECK_IS_ON()
}
InterpolatingLayoutManager::LayoutInterpolation
InterpolatingLayoutManager::GetInterpolation(
const views::SizeBounds& size_bounds) const {
DCHECK(!embedded_layouts_.empty());
LayoutInterpolation result;
const base::Optional<int> dimension =
orientation_ == views::LayoutOrientation::kHorizontal
? size_bounds.width()
: size_bounds.height();
// Find the larger layout that overlaps the target size.
auto match = dimension ? embedded_layouts_.upper_bound({*dimension, 0})
: embedded_layouts_.end();
DCHECK(match != embedded_layouts_.begin())
<< "No layout set for primary dimension size "
<< (dimension ? *dimension : -1) << "; first layout starts at "
<< match->first.ToString();
result.first = (--match)->second;
// If the target size falls in an interpolation range, get the other layout.
const views::Span& first_span = match->first;
if (dimension && first_span.end() > *dimension) {
DCHECK(match != embedded_layouts_.begin())
<< "Primary dimension size " << (dimension ? *dimension : -1)
<< " falls into interpolation range " << match->first.ToString()
<< " but there is no smaller layout to interpolate with.";
result.second = (--match)->second;
result.percent_second =
float{first_span.end() - *dimension} / float{first_span.length()};
}
return result;
}
views::ProposedLayout InterpolatingLayoutManager::CalculateProposedLayout(
const views::SizeBounds& size_bounds) const {
// For interpolating layout we will never call this method except for fully-
// specified sizes.
DCHECK(size_bounds.width());
DCHECK(size_bounds.height());
const gfx::Size size(*size_bounds.width(), *size_bounds.height());
const LayoutInterpolation interpolation = GetInterpolation(size_bounds);
const views::ProposedLayout first =
interpolation.first->GetProposedLayout(size);
if (!interpolation.second)
return first;
// If the target size falls in an interpolation range, get the other layout.
const views::ProposedLayout second =
interpolation.second->GetProposedLayout(size);
return views::ProposedLayoutBetween(interpolation.percent_second, first,
second);
}
void InterpolatingLayoutManager::SetDefaultLayout(
LayoutManagerBase* default_layout) {
if (default_layout_ == default_layout)
return;
// Make sure we already own the layout.
DCHECK(embedded_layouts_.end() !=
std::find_if(
embedded_layouts_.begin(), embedded_layouts_.end(),
[=](const auto& pair) { return pair.second == default_layout; }));
default_layout_ = default_layout;
InvalidateHost(true);
}
gfx::Size InterpolatingLayoutManager::GetPreferredSize(
const views::View* host) const {
DCHECK_EQ(host_view(), host);
DCHECK(host);
return GetDefaultLayout()->GetPreferredSize(host);
}
gfx::Size InterpolatingLayoutManager::GetMinimumSize(
const views::View* host) const {
DCHECK_EQ(host_view(), host);
DCHECK(host);
return GetSmallestLayout()->GetMinimumSize(host);
}
int InterpolatingLayoutManager::GetPreferredHeightForWidth(
const views::View* host,
int width) const {
// It is in general not possible to determine what the correct height-for-
// width trade-off is while interpolating between two already-generated
// layouts because the values tend to rely on the behavior of individual child
// views at specific dimensions.
//
// The two reasonable choices are to use the larger of the two values (with
// the understanding that the height of the view may "pop" at the edge of the
// interpolation range), or to interpolate between the heights and hope that
// the result is fairly close to what we would want.
//
// We have opted for the second approach because it provides a smoother visual
// experience; if this doesn't work in practice we can look at other options.
const LayoutInterpolation interpolation =
GetInterpolation({width, base::nullopt});
const int first =
interpolation.first->GetPreferredHeightForWidth(host, width);
if (!interpolation.second)
return first;
const int second =
interpolation.second->GetPreferredHeightForWidth(host, width);
return gfx::Tween::LinearIntValueBetween(interpolation.percent_second, first,
second);
}
const views::LayoutManagerBase* InterpolatingLayoutManager::GetDefaultLayout()
const {
DCHECK(!embedded_layouts_.empty());
return default_layout_ ? default_layout_ : embedded_layouts_.rbegin()->second;
}
const views::LayoutManagerBase* InterpolatingLayoutManager::GetSmallestLayout()
const {
DCHECK(!embedded_layouts_.empty());
return embedded_layouts_.begin()->second;
}
| [
"rjkroege@chromium.org"
] | rjkroege@chromium.org |
9007f1d262ced996cf8b7b774a636df2064ff916 | c259ad028db694b8a514bb797e0ddf3583b61a5e | /app/src/main/cpp/test/HeapTest.h | 5cc9a1023ca79e58f47620e77adb5b13f7903e64 | [] | no_license | powerhe/Smart_Car | 2ca1bc1248b0d30f28f8ef40c29b33cfda5b1831 | 54491de63504b71bd0e8c85efa880b127517147b | refs/heads/master | 2021-01-22T06:48:57.458300 | 2017-03-31T06:25:37 | 2017-03-31T06:31:23 | 81,789,196 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 179 | h | //
// Created by guohao4 on 2017/3/18.
//
#ifndef TANGO_CAR_HEAPTEST_H
#define TANGO_CAR_HEAPTEST_H
class HeapTest {
public:
void start();
};
#endif //TANGO_CAR_HEAPTEST_H
| [
"harry.he.workspace@gmail.com"
] | harry.he.workspace@gmail.com |
0a8b24c2e7310df4acb4720c1e602646f48238f3 | a90839ead8a1b74a1984379efb74bdf32c9e8bc7 | /C++/Uva - 11799 - Horror Dash.cpp | 0e66d6db178139454647f1c721d97343f40d3d3e | [] | no_license | Prosen-Ghosh/Problem-Solving | 937d6140696704fa1b0e380a2faa72386f389d88 | fa59ffdf9198019e2ec50817305959e807efe24b | refs/heads/master | 2023-01-22T13:47:44.816051 | 2023-01-16T19:44:53 | 2023-01-16T19:44:53 | 72,039,023 | 8 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 420 | cpp | #include<bits/stdc++.h>
using namespace std;
/*
*
* Prosen Ghosh
* American International University - Bangladesh (AIUB)
*
*/
int main(){
int n,T;
cin >> T;
for(int t = 1; t <= T; t++){
cin >> n;
int mxS = -1,a;
for(int i = 0; i < n; i++){
cin >> a;
if(a > mxS)mxS = a;
}
cout << "Case " << t << ": " << mxS << endl;
}
return 0;
}
| [
"prosenghosh25@gmail.com"
] | prosenghosh25@gmail.com |
515ced145bac76d9711ce22f84b522b66a087550 | 0e01a7797a99638f6a9b4db9df06a5c8d94aa7f7 | /src/morgana/fmk/resources/fonts/font.h | ab6729ed6ea87cdc50a630776b89d8c26a949387 | [] | no_license | cslobodeanu/hits | c0310a4e0cfa308b353d38e301187e7bc5063555 | 1cb6663b59cb6c8ee5576d5db276c3828490a110 | refs/heads/master | 2021-05-11T15:29:42.300945 | 2018-02-01T19:43:32 | 2018-02-01T19:43:32 | 117,730,282 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,156 | h | #ifndef __MORGANA_FMK_RESOURCES_FONTS_FONT_H__
#define __MORGANA_FMK_RESOURCES_FONTS_FONT_H__
#include "../resourcefile.h"
#include "../../../base/devices/display/objects/texture.h"
namespace MorganaEngine
{
namespace Framework
{
namespace Resources
{
namespace Fonts
{
using namespace MorganaEngine::Base::Types;
using namespace MorganaEngine::Base::Devices::Display;
class Font : public ResourceFile
{
__declare_class(Font, ResourceFile);
public:
Font();
virtual ~Font();
Array<Rect> charBounds;
Array<byte> kerningPairs; // ch1, ch2, ammount
int maxCharSize;
String imageName;
String systemFontName;
int fontHeight;
bool isBold;
DisplayObjects::Texture* texture;
const int GetKerning(const char ch1, const char ch2) const;
void Copy(const Font& other);
protected:
virtual void ImportFromStreams(const StreamList& streams, const char* args = NULL);
virtual const bool SaveToStream(Stream* s);
char kerningMatrix[256][256];
void BuildKerningMatrix();
};
}
}
}
}
#endif | [
"cslobodeanu@gmail.com"
] | cslobodeanu@gmail.com |
ebe190207fc5c23cb2909fb3748d0679fc7f2285 | 45601b8f2117faf4af4aa4de0ec9610d37907cba | /src/jsonv-tests/char_convert_tests.cpp | 2098777bd3e4a10be8940497602f54d4e62f34b4 | [
"Apache-2.0",
"LicenseRef-scancode-warranty-disclaimer"
] | permissive | tgockel/json-voorhees | a4978c8b76b2873d81b669e25ef4982dcca817ec | 046083c74cd2d2740a1db50075e18f816050c0e5 | refs/heads/trunk | 2022-04-29T17:01:15.013606 | 2021-07-12T18:09:27 | 2021-07-12T18:09:27 | 23,675,821 | 141 | 29 | Apache-2.0 | 2022-04-23T19:01:27 | 2014-09-04T19:14:32 | C++ | UTF-8 | C++ | false | false | 10,794 | cpp | /** \file
*
* Copyright (c) 2014 by Travis Gockel. All rights reserved.
*
* This program is free software: you can redistribute it and/or modify it under the terms of the Apache License
* as published by the Apache Software Foundation, either version 2 of the License, or (at your option) any later
* version.
*
* \author Travis Gockel (travis@gockelhut.com)
**/
#include "test.hpp"
#include <jsonv/char_convert.hpp>
#include <sstream>
using jsonv::detail::decode_error;
template <std::size_t N>
static std::string string_decode_static(const char (& data)[N],
jsonv::parse_options::encoding encoding = jsonv::parse_options::encoding::utf8
)
{
auto decoder = jsonv::detail::get_string_decoder(encoding);
// Use N-1 for length to not include the '\0' at the end
return decoder(jsonv::string_view(data, N-1));
}
TEST(string_decode_invalid_escape_sequence)
{
ensure_throws(jsonv::detail::decode_error, string_decode_static("\\y"));
}
TEST(string_decode_unchanged)
{
ensure_eq("Hello!", string_decode_static("Hello!"));
}
TEST(string_decode_sigils)
{
ensure_eq("\t\b\f\n\r", string_decode_static("\\t\\b\\f\\n\\r"));
}
TEST(string_decode_utf_one_char)
{
ensure_eq("\xe2\x98\xa2", string_decode_static("\\u2622"));
}
TEST(string_decode_utf_char_starts)
{
ensure_eq("\xe2\x98\xa2normal text", string_decode_static("\\u2622normal text"));
}
TEST(string_decode_utf_char_ends)
{
ensure_eq("normal text\xe2\x98\xa2", string_decode_static("normal text\\u2622"));
}
TEST(string_decode_utf_char_bookends)
{
ensure_eq("\xe2\x98\xa2normal text\xe2\x9d\xa4", string_decode_static("\\u2622normal text\\u2764"));
}
TEST(string_decode_utf_char_surrounded)
{
ensure_eq("normal\xe2\x98\xa2text", string_decode_static("normal\\u2622text"));
}
TEST(string_decode_utf_many_chars)
{
ensure_eq("\xe2\x9d\xa4 \xe2\x98\x80 \xe2\x98\x86 \xe2\x98\x82 \xe2\x98\xbb \xe2\x99\x9e \xe2\x98\xaf \xe2\x98\xad \xe2\x98\xa2 \xe2\x82\xac \xe2\x86\x92 \xe2\x98\x8e \xe2\x9d\x84 \xe2\x99\xab \xe2\x9c\x82 \xe2\x96\xb7 \xe2\x9c\x87 \xe2\x99\x8e \xe2\x87\xa7 \xe2\x98\xae \xe2\x99\xbb \xe2\x8c\x98 \xe2\x8c\x9b \xe2\x98\x98",
string_decode_static("\\u2764 \\u2600 \\u2606 \\u2602 \\u263b \\u265e \\u262f \\u262d \\u2622 \\u20ac \\u2192 \\u260e \\u2744 \\u266b \\u2702 \\u25b7 \\u2707 \\u264e \\u21e7 \\u262e \\u267b \\u2318 \\u231b \\u2618"));
}
TEST(string_decode_annoying_mix)
{
string_decode_static(R"(\/\\\"\uCAFE\uBABE\uAB98\uFCDE\ubcda\uef4A\b\f\n\r\t`1~!@#$%^&*()_+-=[]{}|;:',./<>?)");
}
// A bunch of surrogate pairs generated by Python
#define JSONV_TEST_SURROGATE_PAIRS(item) \
item("\xf0\x90\x80\x80", R"(\ud800\udc00)") \
item("\xf0\x97\x9f\xa0", R"(\ud81d\udfe0)") \
item("\xf2\xba\xbe\x85", R"(\udaab\udf85)") \
item("\xf0\xba\xad\xbe", R"(\ud8aa\udf7e)") \
item("\xf1\xbb\xb7\xb0", R"(\ud9af\uddf0)") \
item("\xf0\xb7\xbc\xb4", R"(\ud89f\udf34)") \
item("\xf0\x9c\xa9\xa3", R"(\ud832\ude63)") \
item("\xf3\x81\xbd\xad", R"(\udac7\udf6d)") \
item("\xf3\x97\xa6\xa0", R"(\udb1e\udda0)") \
item("\xf4\x8a\x91\xbe", R"(\udbe9\udc7e)") \
item("\xf2\xb5\xb4\xba", R"(\uda97\udd3a)") \
item("\xf0\xb7\x9e\xb4", R"(\ud89d\udfb4)") \
item("\xf3\xa8\x8e\x8c", R"(\udb60\udf8c)") \
item("\xf2\x8b\x98\x85", R"(\ud9ed\ude05)") \
item("\xf3\x99\xae\x9c", R"(\udb26\udf9c)") \
item("\xf1\xaa\xa9\x96", R"(\ud96a\ude56)") \
item("\xf1\xb4\x98\x8a", R"(\ud991\ude0a)") \
item("\xf0\x94\xab\x97", R"(\ud812\uded7)") \
item("\xf2\x80\xbf\xb8", R"(\ud9c3\udff8)") \
item("\xf1\xb8\x8d\x8d", R"(\ud9a0\udf4d)") \
item("\xf3\x95\x84\xaa", R"(\udb14\udd2a)") \
item("\xf0\xab\xbf\x8b", R"(\ud86f\udfcb)") \
item("\xf1\x99\x86\x82", R"(\ud924\udd82)") \
item("\xf2\x8f\x87\xa0", R"(\ud9fc\udde0)") \
item("\xf2\x85\x8b\x97", R"(\ud9d4\uded7)") \
item("\xf2\xb6\xa5\xaa", R"(\uda9a\udd6a)") \
item("\xf2\x9f\xb4\xa7", R"(\uda3f\udd27)") \
item("\xf3\x91\x9b\x9f", R"(\udb05\udedf)") \
item("\xf1\xab\xbb\x9c", R"(\ud96f\udedc)") \
item("\xf3\xb5\xb3\xa9", R"(\udb97\udce9)") \
item("\xf4\x82\x95\x93", R"(\udbc9\udd53)") \
item("\xf1\xb1\xa9\xb5", R"(\ud986\ude75)") \
item("\xf2\xad\x85\xbf", R"(\uda74\udd7f)") \
item("\xf1\x8e\x8f\xa2", R"(\ud8f8\udfe2)") \
item("\xf1\x9e\xba\x9a", R"(\ud93b\ude9a)") \
item("\xf2\x90\xac\xb3", R"(\uda02\udf33)") \
item("\xf3\x9d\xa7\x82", R"(\udb36\uddc2)") \
item("\xf2\xa1\xab\xa6", R"(\uda46\udee6)") \
item("\xf2\x94\x98\x97", R"(\uda11\ude17)") \
item("\xf3\xa0\x87\xa2", R"(\udb40\udde2)") \
item("\xf2\x9b\xa7\xb3", R"(\uda2e\uddf3)") \
item("\xf2\xa7\xab\xaf", R"(\uda5e\udeef)") \
item("\xf1\xb3\x90\xa1", R"(\ud98d\udc21)") \
item("\xf2\xbb\x88\x81", R"(\udaac\ude01)") \
item("\xf3\xab\x9e\xb6", R"(\udb6d\udfb6)") \
item("\xf4\x8e\xb3\xa1", R"(\udbfb\udce1)") \
item("\xf4\x8a\x95\x99", R"(\udbe9\udd59)") \
item("\xf0\x99\xbe\xb9", R"(\ud827\udfb9)") \
item("\xf0\xa6\x9c\x85", R"(\ud859\udf05)") \
item("\xf1\x97\xb3\xbf", R"(\ud91f\udcff)") \
item("\xf1\x9a\xbc\xbb", R"(\ud92b\udf3b)") \
TEST(string_decode_unicode_surrogates_valid)
{
#define JSONV_TEST_GEN_DECODE_EQ(utf8encoding_, jsonencoding_) \
ensure_eq(utf8encoding_, string_decode_static(jsonencoding_)); \
JSONV_TEST_SURROGATE_PAIRS(JSONV_TEST_GEN_DECODE_EQ)
}
TEST(string_decode_unicode_surrogates_invalid_end_immediate)
{
ensure_throws(decode_error, string_decode_static(R"(\ud92b)"));
}
TEST(string_decode_unicode_surrogates_invalid_non_numeric_following)
{
ensure_throws(decode_error, string_decode_static(R"(\ud92b____i____)"));
ensure_throws(decode_error, string_decode_static(R"(\ud92b,.//<<>>/)"));
ensure_throws(decode_error, string_decode_static(R"(\ud92b??!!897123)"));
ensure_throws(decode_error, string_decode_static(R"(\ud92b__)"));
}
TEST(string_decode_unicode_surrogates_invalid_incomplete_escapes)
{
ensure_throws(decode_error, string_decode_static(R"(\ud92b\u)"));
ensure_throws(decode_error, string_decode_static(R"(\ud92b\ud)"));
ensure_throws(decode_error, string_decode_static(R"(\ud92b\udc)"));
ensure_throws(decode_error, string_decode_static(R"(\ud92b\udcb)"));
}
TEST(string_decode_unicode_surrogates_invalid_non_hex)
{
ensure_throws(decode_error, string_decode_static(R"(\ud92b\uPIKA)"));
ensure_throws(decode_error, string_decode_static(R"(\ud92b\ucattle)"));
ensure_throws(decode_error, string_decode_static(R"(\ud92b\u_________)"));
ensure_throws(decode_error, string_decode_static(R"(\ud92b\ujust bogus)"));
}
TEST(string_decode_unicode_surrogates_invalid_not_low_follower)
{
ensure_throws(decode_error, string_decode_static(R"(\ud92b\ucccc)"));
ensure_throws(decode_error, string_decode_static(R"(\ud92b\ubeefy)"));
ensure_throws(decode_error, string_decode_static(R"(\ud92b\ud800)"));
ensure_throws(decode_error, string_decode_static(R"(\ud92b\udbff\udc00)"));
}
static std::string string_encode_static(const std::string& source)
{
std::ostringstream ss;
jsonv::detail::string_encode(ss, source);
return ss.str();
}
TEST(string_encode_surrogates_valid)
{
#define JSONV_TEST_GEN_ENCODE_EQ(utf8encoding_, jsonencoding_) \
ensure_eq(jsonencoding_, string_encode_static(utf8encoding_)); \
JSONV_TEST_SURROGATE_PAIRS(JSONV_TEST_GEN_ENCODE_EQ)
}
#define JSONV_TEST_CESU8_ENCODINGS(item) \
item("\\u0ff5", "\xe0\xbf\xb5") \
item("\\u091b", "\xe0\xa4\x9b") \
item("\\uc486", "\xec\x92\x86") \
item("\\u88cf", "\xe8\xa3\x8f") \
item("\\u282e", "\xe2\xa0\xae") \
item("\\u3bff", "\xe3\xaf\xbf") \
item("\\ub469", "\xeb\x91\xa9") \
item("\\ucb0b", "\xec\xac\x8b") \
item("\\ufab2", "\xef\xaa\xb2") \
item("\\u0044", "D") \
item("\\ufdba", "\xef\xb6\xba") \
item("\\u3aa5", "\xe3\xaa\xa5") \
item("\\uaffe", "\xea\xbf\xbe") \
item("\\u3500", "\xe3\x94\x80") \
item("\\ubaa5", "\xeb\xaa\xa5") \
item("\\ud1b5", "\xed\x86\xb5") \
item("\\u4ff9", "\xe4\xbf\xb9") \
item("\\u7b08", "\xe7\xac\x88") \
item("\\u2044", "\xe2\x81\x84") \
item("\\uab55", "\xea\xad\x95") \
item("\\u7944", "\xe7\xa5\x84") \
item("\\uf513", "\xef\x94\x93") \
item("\\ue2dc", "\xee\x8b\x9c") \
item("\\ue072", "\xee\x81\xb2") \
item("\\ub100", "\xeb\x84\x80") \
item("\\u6868", "\xe6\xa1\xa8") \
item("\\u907f", "\xe9\x81\xbf") \
item("\\ue5ef", "\xee\x97\xaf") \
item("\\ucb23", "\xec\xac\xa3") \
item("\\u2283", "\xe2\x8a\x83") \
item("\\uf365", "\xef\x8d\xa5") \
item("\\u53d0", "\xe5\x8f\x90") \
item("\\u5605", "\xe5\x98\x85") \
item("\\u1ad2", "\xe1\xab\x92") \
item("\\u0279", "\xc9\xb9") \
item("\\u498b", "\xe4\xa6\x8b") \
item("\\u8463", "\xe8\x91\xa3") \
item("\\u48bb", "\xe4\xa2\xbb") \
item("\\u1bd1", "\xe1\xaf\x91") \
item("\\uf963", "\xef\xa5\xa3") \
item("\\u8383", "\xe8\x8e\x83") \
item("\\u4d63", "\xe4\xb5\xa3") \
item("\\udced", "\xed\xb3\xad") \
item("\\u5410", "\xe5\x90\x90") \
item("\\ucac8", "\xec\xab\x88") \
item("\\ucacb", "\xec\xab\x8b") \
item("\\ubc82", "\xeb\xb2\x82") \
item("\\u919e", "\xe9\x86\x9e") \
item("\\ua2ad", "\xea\x8a\xad") \
item("\\ud89c", "\xed\xa2\x9c") \
TEST(string_decode_cesu8)
{
#define JSONV_TEST_GEN_ENCODE_CESU8_EQ(jsonencoding_, cesu8encoding_) \
ensure_eq(string_decode_static(jsonencoding_, jsonv::parse_options::encoding::cesu8), cesu8encoding_); \
JSONV_TEST_CESU8_ENCODINGS(JSONV_TEST_GEN_ENCODE_CESU8_EQ)
}
TEST(string_decode_long_utf8_sequences)
{
// A couple of very long, but valid UTF-8 sequences
string_decode_static("\xf8\x80\x80\x80\x80");
string_decode_static("\xfc\x80\x80\x80\x80\x80");
}
TEST(string_decode_short_utf8_sequence)
{
ensure_throws(decode_error, string_decode_static("\x80 is not 1 byte long"));
ensure_throws(decode_error, string_decode_static("\xc0 is not 2 bytes long"));
ensure_throws(decode_error, string_decode_static("\xe0\x80 is not 3 bytes long"));
ensure_throws(decode_error, string_decode_static("\xf0\x80 is not 4 bytes long"));
}
TEST(string_decode_invalid_utf8_start)
{
ensure_throws(decode_error, string_decode_static("\xfe is not a UTF-8 start"));
}
| [
"travis@gockelhut.com"
] | travis@gockelhut.com |
2e1d43e92a4a602056de68d917e00ddd99b25b31 | b2720d633a2579bc020a669cae9fa6fcfcdacd62 | /json/json_writer.inl | a824116d3bb2b837345a6693b465248057d2f731 | [] | no_license | authorly/interapptive | 6158943329206cc88c9fac064e16c642465c49ab | c0e564695af649087d329bc519f04e5f85b47035 | refs/heads/master | 2020-04-09T13:34:51.508252 | 2014-09-01T13:32:22 | 2014-09-01T13:32:22 | 3,585,099 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 20,789 | inl | #ifndef JSON_JSON_WRITER_INL
#define JSON_JSON_WRITER_INL
#include <utility>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <sstream>
#include <iomanip>
#if _MSC_VER >= 1400 // VC++ 8.0
#pragma warning( disable : 4996 ) // disable warning about strdup being deprecated.
#endif
namespace Json {
inline
static bool isControlCharacter(char ch)
{
return ch > 0 && ch <= 0x1F;
}
inline
static bool containsControlCharacter( const char* str )
{
while ( *str )
{
if ( isControlCharacter( *(str++) ) )
return true;
}
return false;
}
inline
static void uintToString( unsigned int value,
char *¤t )
{
*--current = 0;
do
{
*--current = (value % 10) + '0';
value /= 10;
}
while ( value != 0 );
}
inline
std::string valueToString( Int value )
{
char buffer[32];
char *current = buffer + sizeof(buffer);
bool isNegative = value < 0;
if ( isNegative )
value = -value;
uintToString( UInt(value), current );
if ( isNegative )
*--current = '-';
assert( current >= buffer );
return current;
}
inline
std::string valueToString( UInt value )
{
char buffer[32];
char *current = buffer + sizeof(buffer);
uintToString( value, current );
assert( current >= buffer );
return current;
}
inline
std::string valueToString( double value )
{
char buffer[32];
#if defined(_MSC_VER) && defined(__STDC_SECURE_LIB__) // Use secure version with visual studio 2005 to avoid warning.
sprintf_s(buffer, sizeof(buffer), "%#.16g", value);
#else
sprintf(buffer, "%#.16g", value);
#endif
char* ch = buffer + strlen(buffer) - 1;
if (*ch != '0') return buffer; // nothing to truncate, so save time
while(ch > buffer && *ch == '0'){
--ch;
}
char* last_nonzero = ch;
while(ch >= buffer){
switch(*ch){
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
case '8':
case '9':
--ch;
continue;
case '.':
// Truncate zeroes to save bytes in output, but keep one.
*(last_nonzero+2) = '\0';
return buffer;
default:
return buffer;
}
}
return buffer;
}
inline
std::string valueToString( bool value )
{
return value ? "true" : "false";
}
inline
std::string valueToQuotedString( const char *value )
{
// Not sure how to handle unicode...
if (strpbrk(value, "\"\\\b\f\n\r\t") == NULL && !containsControlCharacter( value ))
return std::string("\"") + value + "\"";
// We have to walk value and escape any special characters.
// Appending to std::string is not efficient, but this should be rare.
// (Note: forward slashes are *not* rare, but I am not escaping them.)
const size_t maxsize = strlen(value)*2 + 3; // allescaped+quotes+NULL
std::string result;
result.reserve(maxsize); // to avoid lots of mallocs
result += "\"";
for (const char* c=value; *c != 0; ++c)
{
switch(*c)
{
case '\"':
result += "\\\"";
break;
case '\\':
result += "\\\\";
break;
case '\b':
result += "\\b";
break;
case '\f':
result += "\\f";
break;
case '\n':
result += "\\n";
break;
case '\r':
result += "\\r";
break;
case '\t':
result += "\\t";
break;
//case '/':
// Even though \/ is considered a legal escape in JSON, a bare
// slash is also legal, so I see no reason to escape it.
// (I hope I am not misunderstanding something.
// blep notes: actually escaping \/ may be useful in javascript to avoid </
// sequence.
// Should add a flag to allow this compatibility mode and prevent this
// sequence from occurring.
default:
if ( isControlCharacter( *c ) )
{
std::ostringstream oss;
oss << "\\u" << std::hex << std::uppercase << std::setfill('0') << std::setw(4) << static_cast<int>(*c);
result += oss.str();
}
else
{
result += *c;
}
break;
}
}
result += "\"";
return result;
}
inline
std::string
Value::toStyledString() const
{
StyledWriter writer;
return writer.write( *this );
}
// Class Writer
// //////////////////////////////////////////////////////////////////
inline
Writer::~Writer()
{
}
// Class FastWriter
// //////////////////////////////////////////////////////////////////
inline
FastWriter::FastWriter()
: yamlCompatiblityEnabled_( false )
{
}
inline
void
FastWriter::enableYAMLCompatibility()
{
yamlCompatiblityEnabled_ = true;
}
inline
std::string
FastWriter::write( const Value &root )
{
document_ = "";
writeValue( root );
document_ += "\n";
return document_;
}
inline
void
FastWriter::writeValue( const Value &value )
{
switch ( value.type() )
{
case nullValue:
document_ += "null";
break;
case intValue:
document_ += valueToString( value.asInt() );
break;
case uintValue:
document_ += valueToString( value.asUInt() );
break;
case realValue:
document_ += valueToString( value.asDouble() );
break;
case stringValue:
document_ += valueToQuotedString( value.asCString() );
break;
case booleanValue:
document_ += valueToString( value.asBool() );
break;
case arrayValue:
{
document_ += "[";
int size = value.size();
for ( int index =0; index < size; ++index )
{
if ( index > 0 )
document_ += ",";
writeValue( value[index] );
}
document_ += "]";
}
break;
case objectValue:
{
Value::Members members( value.getMemberNames() );
document_ += "{";
for ( Value::Members::iterator it = members.begin();
it != members.end();
++it )
{
const std::string &name = *it;
if ( it != members.begin() )
document_ += ",";
document_ += valueToQuotedString( name.c_str() );
document_ += yamlCompatiblityEnabled_ ? ": "
: ":";
writeValue( value[name] );
}
document_ += "}";
}
break;
}
}
// Class StyledWriter
// //////////////////////////////////////////////////////////////////
inline
StyledWriter::StyledWriter()
: rightMargin_( 74 )
, indentSize_( 3 )
{
}
inline
std::string
StyledWriter::write( const Value &root )
{
document_ = "";
addChildValues_ = false;
indentString_ = "";
writeCommentBeforeValue( root );
writeValue( root );
writeCommentAfterValueOnSameLine( root );
document_ += "\n";
return document_;
}
inline
void
StyledWriter::writeValue( const Value &value )
{
switch ( value.type() )
{
case nullValue:
pushValue( "null" );
break;
case intValue:
pushValue( valueToString( value.asInt() ) );
break;
case uintValue:
pushValue( valueToString( value.asUInt() ) );
break;
case realValue:
pushValue( valueToString( value.asDouble() ) );
break;
case stringValue:
pushValue( valueToQuotedString( value.asCString() ) );
break;
case booleanValue:
pushValue( valueToString( value.asBool() ) );
break;
case arrayValue:
writeArrayValue( value);
break;
case objectValue:
{
Value::Members members( value.getMemberNames() );
if ( members.empty() )
pushValue( "{}" );
else
{
writeWithIndent( "{" );
indent();
Value::Members::iterator it = members.begin();
while ( true )
{
const std::string &name = *it;
const Value &childValue = value[name];
writeCommentBeforeValue( childValue );
writeWithIndent( valueToQuotedString( name.c_str() ) );
document_ += " : ";
writeValue( childValue );
if ( ++it == members.end() )
{
writeCommentAfterValueOnSameLine( childValue );
break;
}
document_ += ",";
writeCommentAfterValueOnSameLine( childValue );
}
unindent();
writeWithIndent( "}" );
}
}
break;
}
}
inline
void
StyledWriter::writeArrayValue( const Value &value )
{
unsigned size = value.size();
if ( size == 0 )
pushValue( "[]" );
else
{
bool isArrayMultiLine = isMultineArray( value );
if ( isArrayMultiLine )
{
writeWithIndent( "[" );
indent();
bool hasChildValue = !childValues_.empty();
unsigned index =0;
while ( true )
{
const Value &childValue = value[index];
writeCommentBeforeValue( childValue );
if ( hasChildValue )
writeWithIndent( childValues_[index] );
else
{
writeIndent();
writeValue( childValue );
}
if ( ++index == size )
{
writeCommentAfterValueOnSameLine( childValue );
break;
}
document_ += ",";
writeCommentAfterValueOnSameLine( childValue );
}
unindent();
writeWithIndent( "]" );
}
else // output on a single line
{
assert( childValues_.size() == size );
document_ += "[ ";
for ( unsigned index =0; index < size; ++index )
{
if ( index > 0 )
document_ += ", ";
document_ += childValues_[index];
}
document_ += " ]";
}
}
}
inline
bool
StyledWriter::isMultineArray( const Value &value )
{
int size = value.size();
bool isMultiLine = size*3 >= rightMargin_ ;
childValues_.clear();
for ( int index =0; index < size && !isMultiLine; ++index )
{
const Value &childValue = value[index];
isMultiLine = isMultiLine ||
( (childValue.isArray() || childValue.isObject()) &&
childValue.size() > 0 );
}
if ( !isMultiLine ) // check if line length > max line length
{
childValues_.reserve( size );
addChildValues_ = true;
int lineLength = 4 + (size-1)*2; // '[ ' + ', '*n + ' ]'
for ( int index =0; index < size && !isMultiLine; ++index )
{
writeValue( value[index] );
lineLength += int( childValues_[index].length() );
isMultiLine = isMultiLine && hasCommentForValue( value[index] );
}
addChildValues_ = false;
isMultiLine = isMultiLine || lineLength >= rightMargin_;
}
return isMultiLine;
}
inline
void
StyledWriter::pushValue( const std::string &value )
{
if ( addChildValues_ )
childValues_.push_back( value );
else
document_ += value;
}
inline
void
StyledWriter::writeIndent()
{
if ( !document_.empty() )
{
char last = document_[document_.length()-1];
if ( last == ' ' ) // already indented
return;
if ( last != '\n' ) // Comments may add new-line
document_ += '\n';
}
document_ += indentString_;
}
inline
void
StyledWriter::writeWithIndent( const std::string &value )
{
writeIndent();
document_ += value;
}
inline
void
StyledWriter::indent()
{
indentString_ += std::string( indentSize_, ' ' );
}
inline
void
StyledWriter::unindent()
{
assert( int(indentString_.size()) >= indentSize_ );
indentString_.resize( indentString_.size() - indentSize_ );
}
inline
void
StyledWriter::writeCommentBeforeValue( const Value &root )
{
if ( !root.hasComment( commentBefore ) )
return;
document_ += normalizeEOL( root.getComment( commentBefore ) );
document_ += "\n";
}
inline
void
StyledWriter::writeCommentAfterValueOnSameLine( const Value &root )
{
if ( root.hasComment( commentAfterOnSameLine ) )
document_ += " " + normalizeEOL( root.getComment( commentAfterOnSameLine ) );
if ( root.hasComment( commentAfter ) )
{
document_ += "\n";
document_ += normalizeEOL( root.getComment( commentAfter ) );
document_ += "\n";
}
}
inline
bool
StyledWriter::hasCommentForValue( const Value &value )
{
return value.hasComment( commentBefore )
|| value.hasComment( commentAfterOnSameLine )
|| value.hasComment( commentAfter );
}
inline
std::string
StyledWriter::normalizeEOL( const std::string &text )
{
std::string normalized;
normalized.reserve( text.length() );
const char *begin = text.c_str();
const char *end = begin + text.length();
const char *current = begin;
while ( current != end )
{
char c = *current++;
if ( c == '\r' ) // mac or dos EOL
{
if ( *current == '\n' ) // convert dos EOL
++current;
normalized += '\n';
}
else // handle unix EOL & other char
normalized += c;
}
return normalized;
}
// Class StyledStreamWriter
// //////////////////////////////////////////////////////////////////
inline
StyledStreamWriter::StyledStreamWriter( std::string indentation )
: document_(NULL)
, rightMargin_( 74 )
, indentation_( indentation )
{
}
inline
void
StyledStreamWriter::write( std::ostream &out, const Value &root )
{
document_ = &out;
addChildValues_ = false;
indentString_ = "";
writeCommentBeforeValue( root );
writeValue( root );
writeCommentAfterValueOnSameLine( root );
*document_ << "\n";
document_ = NULL; // Forget the stream, for safety.
}
inline
void
StyledStreamWriter::writeValue( const Value &value )
{
switch ( value.type() )
{
case nullValue:
pushValue( "null" );
break;
case intValue:
pushValue( valueToString( value.asInt() ) );
break;
case uintValue:
pushValue( valueToString( value.asUInt() ) );
break;
case realValue:
pushValue( valueToString( value.asDouble() ) );
break;
case stringValue:
pushValue( valueToQuotedString( value.asCString() ) );
break;
case booleanValue:
pushValue( valueToString( value.asBool() ) );
break;
case arrayValue:
writeArrayValue( value);
break;
case objectValue:
{
Value::Members members( value.getMemberNames() );
if ( members.empty() )
pushValue( "{}" );
else
{
writeWithIndent( "{" );
indent();
Value::Members::iterator it = members.begin();
while ( true )
{
const std::string &name = *it;
const Value &childValue = value[name];
writeCommentBeforeValue( childValue );
writeWithIndent( valueToQuotedString( name.c_str() ) );
*document_ << " : ";
writeValue( childValue );
if ( ++it == members.end() )
{
writeCommentAfterValueOnSameLine( childValue );
break;
}
*document_ << ",";
writeCommentAfterValueOnSameLine( childValue );
}
unindent();
writeWithIndent( "}" );
}
}
break;
}
}
inline
void
StyledStreamWriter::writeArrayValue( const Value &value )
{
unsigned size = value.size();
if ( size == 0 )
pushValue( "[]" );
else
{
bool isArrayMultiLine = isMultineArray( value );
if ( isArrayMultiLine )
{
writeWithIndent( "[" );
indent();
bool hasChildValue = !childValues_.empty();
unsigned index =0;
while ( true )
{
const Value &childValue = value[index];
writeCommentBeforeValue( childValue );
if ( hasChildValue )
writeWithIndent( childValues_[index] );
else
{
writeIndent();
writeValue( childValue );
}
if ( ++index == size )
{
writeCommentAfterValueOnSameLine( childValue );
break;
}
*document_ << ",";
writeCommentAfterValueOnSameLine( childValue );
}
unindent();
writeWithIndent( "]" );
}
else // output on a single line
{
assert( childValues_.size() == size );
*document_ << "[ ";
for ( unsigned index =0; index < size; ++index )
{
if ( index > 0 )
*document_ << ", ";
*document_ << childValues_[index];
}
*document_ << " ]";
}
}
}
inline
bool
StyledStreamWriter::isMultineArray( const Value &value )
{
int size = value.size();
bool isMultiLine = size*3 >= rightMargin_ ;
childValues_.clear();
for ( int index =0; index < size && !isMultiLine; ++index )
{
const Value &childValue = value[index];
isMultiLine = isMultiLine ||
( (childValue.isArray() || childValue.isObject()) &&
childValue.size() > 0 );
}
if ( !isMultiLine ) // check if line length > max line length
{
childValues_.reserve( size );
addChildValues_ = true;
int lineLength = 4 + (size-1)*2; // '[ ' + ', '*n + ' ]'
for ( int index =0; index < size && !isMultiLine; ++index )
{
writeValue( value[index] );
lineLength += int( childValues_[index].length() );
isMultiLine = isMultiLine && hasCommentForValue( value[index] );
}
addChildValues_ = false;
isMultiLine = isMultiLine || lineLength >= rightMargin_;
}
return isMultiLine;
}
inline
void
StyledStreamWriter::pushValue( const std::string &value )
{
if ( addChildValues_ )
childValues_.push_back( value );
else
*document_ << value;
}
inline
void
StyledStreamWriter::writeIndent()
{
/*
Some comments in this method would have been nice. ;-)
if ( !document_.empty() )
{
char last = document_[document_.length()-1];
if ( last == ' ' ) // already indented
return;
if ( last != '\n' ) // Comments may add new-line
*document_ << '\n';
}
*/
*document_ << '\n' << indentString_;
}
inline
void
StyledStreamWriter::writeWithIndent( const std::string &value )
{
writeIndent();
*document_ << value;
}
inline
void
StyledStreamWriter::indent()
{
indentString_ += indentation_;
}
inline
void
StyledStreamWriter::unindent()
{
assert( indentString_.size() >= indentation_.size() );
indentString_.resize( indentString_.size() - indentation_.size() );
}
inline
void
StyledStreamWriter::writeCommentBeforeValue( const Value &root )
{
if ( !root.hasComment( commentBefore ) )
return;
*document_ << normalizeEOL( root.getComment( commentBefore ) );
*document_ << "\n";
}
inline
void
StyledStreamWriter::writeCommentAfterValueOnSameLine( const Value &root )
{
if ( root.hasComment( commentAfterOnSameLine ) )
*document_ << " " + normalizeEOL( root.getComment( commentAfterOnSameLine ) );
if ( root.hasComment( commentAfter ) )
{
*document_ << "\n";
*document_ << normalizeEOL( root.getComment( commentAfter ) );
*document_ << "\n";
}
}
inline
bool
StyledStreamWriter::hasCommentForValue( const Value &value )
{
return value.hasComment( commentBefore )
|| value.hasComment( commentAfterOnSameLine )
|| value.hasComment( commentAfter );
}
inline
std::string
StyledStreamWriter::normalizeEOL( const std::string &text )
{
std::string normalized;
normalized.reserve( text.length() );
const char *begin = text.c_str();
const char *end = begin + text.length();
const char *current = begin;
while ( current != end )
{
char c = *current++;
if ( c == '\r' ) // mac or dos EOL
{
if ( *current == '\n' ) // convert dos EOL
++current;
normalized += '\n';
}
else // handle unix EOL & other char
normalized += c;
}
return normalized;
}
inline
std::ostream& operator<<( std::ostream &sout, const Value &root )
{
Json::StyledStreamWriter writer;
writer.write(sout, root);
return sout;
}
} // namespace Json
#endif // JSON_JSON_WRITER_INL
| [
"chris@theoryplus.com"
] | chris@theoryplus.com |
b8cedf4d880f4c685a2a0a39a892835a95f719c5 | 148125096da896fd93292d2cd408265d159fec28 | /src/crypto/sha512.cpp | 9edff285e345fcf0b515f5cd12f83541d7529e1e | [
"MIT"
] | permissive | lycion/lkcoinse | 7cfbcbdfc1e98f20d9dfc497ea65fd75ca6de25d | 9cf9ed5730217566b44466c22dc255f0134ad1bb | refs/heads/master | 2020-03-30T03:24:44.245148 | 2018-09-28T04:55:30 | 2018-09-28T04:55:30 | 150,548,883 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 11,068 | cpp | // Copyright (c) 2014 The Lkcoinse Core developers
// Copyright (c) 2015-2017 The Lkcoinse Unlimited developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "crypto/sha512.h"
#include "crypto/common.h"
#include <string.h>
// Internal implementation code.
namespace
{
/// Internal SHA-512 implementation.
namespace sha512
{
uint64_t inline Ch(uint64_t x, uint64_t y, uint64_t z) { return z ^ (x & (y ^ z)); }
uint64_t inline Maj(uint64_t x, uint64_t y, uint64_t z) { return (x & y) | (z & (x | y)); }
uint64_t inline Sigma0(uint64_t x) { return (x >> 28 | x << 36) ^ (x >> 34 | x << 30) ^ (x >> 39 | x << 25); }
uint64_t inline Sigma1(uint64_t x) { return (x >> 14 | x << 50) ^ (x >> 18 | x << 46) ^ (x >> 41 | x << 23); }
uint64_t inline sigma0(uint64_t x) { return (x >> 1 | x << 63) ^ (x >> 8 | x << 56) ^ (x >> 7); }
uint64_t inline sigma1(uint64_t x) { return (x >> 19 | x << 45) ^ (x >> 61 | x << 3) ^ (x >> 6); }
/** One round of SHA-512. */
void inline Round(uint64_t a, uint64_t b, uint64_t c, uint64_t& d, uint64_t e, uint64_t f, uint64_t g, uint64_t& h, uint64_t k, uint64_t w)
{
uint64_t t1 = h + Sigma1(e) + Ch(e, f, g) + k + w;
uint64_t t2 = Sigma0(a) + Maj(a, b, c);
d += t1;
h = t1 + t2;
}
/** Initialize SHA-256 state. */
void inline Initialize(uint64_t* s)
{
s[0] = 0x6a09e667f3bcc908ull;
s[1] = 0xbb67ae8584caa73bull;
s[2] = 0x3c6ef372fe94f82bull;
s[3] = 0xa54ff53a5f1d36f1ull;
s[4] = 0x510e527fade682d1ull;
s[5] = 0x9b05688c2b3e6c1full;
s[6] = 0x1f83d9abfb41bd6bull;
s[7] = 0x5be0cd19137e2179ull;
}
/** Perform one SHA-512 transformation, processing a 128-byte chunk. */
void Transform(uint64_t* s, const unsigned char* chunk)
{
uint64_t a = s[0], b = s[1], c = s[2], d = s[3], e = s[4], f = s[5], g = s[6], h = s[7];
uint64_t w0, w1, w2, w3, w4, w5, w6, w7, w8, w9, w10, w11, w12, w13, w14, w15;
Round(a, b, c, d, e, f, g, h, 0x428a2f98d728ae22ull, w0 = ReadBE64(chunk + 0));
Round(h, a, b, c, d, e, f, g, 0x7137449123ef65cdull, w1 = ReadBE64(chunk + 8));
Round(g, h, a, b, c, d, e, f, 0xb5c0fbcfec4d3b2full, w2 = ReadBE64(chunk + 16));
Round(f, g, h, a, b, c, d, e, 0xe9b5dba58189dbbcull, w3 = ReadBE64(chunk + 24));
Round(e, f, g, h, a, b, c, d, 0x3956c25bf348b538ull, w4 = ReadBE64(chunk + 32));
Round(d, e, f, g, h, a, b, c, 0x59f111f1b605d019ull, w5 = ReadBE64(chunk + 40));
Round(c, d, e, f, g, h, a, b, 0x923f82a4af194f9bull, w6 = ReadBE64(chunk + 48));
Round(b, c, d, e, f, g, h, a, 0xab1c5ed5da6d8118ull, w7 = ReadBE64(chunk + 56));
Round(a, b, c, d, e, f, g, h, 0xd807aa98a3030242ull, w8 = ReadBE64(chunk + 64));
Round(h, a, b, c, d, e, f, g, 0x12835b0145706fbeull, w9 = ReadBE64(chunk + 72));
Round(g, h, a, b, c, d, e, f, 0x243185be4ee4b28cull, w10 = ReadBE64(chunk + 80));
Round(f, g, h, a, b, c, d, e, 0x550c7dc3d5ffb4e2ull, w11 = ReadBE64(chunk + 88));
Round(e, f, g, h, a, b, c, d, 0x72be5d74f27b896full, w12 = ReadBE64(chunk + 96));
Round(d, e, f, g, h, a, b, c, 0x80deb1fe3b1696b1ull, w13 = ReadBE64(chunk + 104));
Round(c, d, e, f, g, h, a, b, 0x9bdc06a725c71235ull, w14 = ReadBE64(chunk + 112));
Round(b, c, d, e, f, g, h, a, 0xc19bf174cf692694ull, w15 = ReadBE64(chunk + 120));
Round(a, b, c, d, e, f, g, h, 0xe49b69c19ef14ad2ull, w0 += sigma1(w14) + w9 + sigma0(w1));
Round(h, a, b, c, d, e, f, g, 0xefbe4786384f25e3ull, w1 += sigma1(w15) + w10 + sigma0(w2));
Round(g, h, a, b, c, d, e, f, 0x0fc19dc68b8cd5b5ull, w2 += sigma1(w0) + w11 + sigma0(w3));
Round(f, g, h, a, b, c, d, e, 0x240ca1cc77ac9c65ull, w3 += sigma1(w1) + w12 + sigma0(w4));
Round(e, f, g, h, a, b, c, d, 0x2de92c6f592b0275ull, w4 += sigma1(w2) + w13 + sigma0(w5));
Round(d, e, f, g, h, a, b, c, 0x4a7484aa6ea6e483ull, w5 += sigma1(w3) + w14 + sigma0(w6));
Round(c, d, e, f, g, h, a, b, 0x5cb0a9dcbd41fbd4ull, w6 += sigma1(w4) + w15 + sigma0(w7));
Round(b, c, d, e, f, g, h, a, 0x76f988da831153b5ull, w7 += sigma1(w5) + w0 + sigma0(w8));
Round(a, b, c, d, e, f, g, h, 0x983e5152ee66dfabull, w8 += sigma1(w6) + w1 + sigma0(w9));
Round(h, a, b, c, d, e, f, g, 0xa831c66d2db43210ull, w9 += sigma1(w7) + w2 + sigma0(w10));
Round(g, h, a, b, c, d, e, f, 0xb00327c898fb213full, w10 += sigma1(w8) + w3 + sigma0(w11));
Round(f, g, h, a, b, c, d, e, 0xbf597fc7beef0ee4ull, w11 += sigma1(w9) + w4 + sigma0(w12));
Round(e, f, g, h, a, b, c, d, 0xc6e00bf33da88fc2ull, w12 += sigma1(w10) + w5 + sigma0(w13));
Round(d, e, f, g, h, a, b, c, 0xd5a79147930aa725ull, w13 += sigma1(w11) + w6 + sigma0(w14));
Round(c, d, e, f, g, h, a, b, 0x06ca6351e003826full, w14 += sigma1(w12) + w7 + sigma0(w15));
Round(b, c, d, e, f, g, h, a, 0x142929670a0e6e70ull, w15 += sigma1(w13) + w8 + sigma0(w0));
Round(a, b, c, d, e, f, g, h, 0x27b70a8546d22ffcull, w0 += sigma1(w14) + w9 + sigma0(w1));
Round(h, a, b, c, d, e, f, g, 0x2e1b21385c26c926ull, w1 += sigma1(w15) + w10 + sigma0(w2));
Round(g, h, a, b, c, d, e, f, 0x4d2c6dfc5ac42aedull, w2 += sigma1(w0) + w11 + sigma0(w3));
Round(f, g, h, a, b, c, d, e, 0x53380d139d95b3dfull, w3 += sigma1(w1) + w12 + sigma0(w4));
Round(e, f, g, h, a, b, c, d, 0x650a73548baf63deull, w4 += sigma1(w2) + w13 + sigma0(w5));
Round(d, e, f, g, h, a, b, c, 0x766a0abb3c77b2a8ull, w5 += sigma1(w3) + w14 + sigma0(w6));
Round(c, d, e, f, g, h, a, b, 0x81c2c92e47edaee6ull, w6 += sigma1(w4) + w15 + sigma0(w7));
Round(b, c, d, e, f, g, h, a, 0x92722c851482353bull, w7 += sigma1(w5) + w0 + sigma0(w8));
Round(a, b, c, d, e, f, g, h, 0xa2bfe8a14cf10364ull, w8 += sigma1(w6) + w1 + sigma0(w9));
Round(h, a, b, c, d, e, f, g, 0xa81a664bbc423001ull, w9 += sigma1(w7) + w2 + sigma0(w10));
Round(g, h, a, b, c, d, e, f, 0xc24b8b70d0f89791ull, w10 += sigma1(w8) + w3 + sigma0(w11));
Round(f, g, h, a, b, c, d, e, 0xc76c51a30654be30ull, w11 += sigma1(w9) + w4 + sigma0(w12));
Round(e, f, g, h, a, b, c, d, 0xd192e819d6ef5218ull, w12 += sigma1(w10) + w5 + sigma0(w13));
Round(d, e, f, g, h, a, b, c, 0xd69906245565a910ull, w13 += sigma1(w11) + w6 + sigma0(w14));
Round(c, d, e, f, g, h, a, b, 0xf40e35855771202aull, w14 += sigma1(w12) + w7 + sigma0(w15));
Round(b, c, d, e, f, g, h, a, 0x106aa07032bbd1b8ull, w15 += sigma1(w13) + w8 + sigma0(w0));
Round(a, b, c, d, e, f, g, h, 0x19a4c116b8d2d0c8ull, w0 += sigma1(w14) + w9 + sigma0(w1));
Round(h, a, b, c, d, e, f, g, 0x1e376c085141ab53ull, w1 += sigma1(w15) + w10 + sigma0(w2));
Round(g, h, a, b, c, d, e, f, 0x2748774cdf8eeb99ull, w2 += sigma1(w0) + w11 + sigma0(w3));
Round(f, g, h, a, b, c, d, e, 0x34b0bcb5e19b48a8ull, w3 += sigma1(w1) + w12 + sigma0(w4));
Round(e, f, g, h, a, b, c, d, 0x391c0cb3c5c95a63ull, w4 += sigma1(w2) + w13 + sigma0(w5));
Round(d, e, f, g, h, a, b, c, 0x4ed8aa4ae3418acbull, w5 += sigma1(w3) + w14 + sigma0(w6));
Round(c, d, e, f, g, h, a, b, 0x5b9cca4f7763e373ull, w6 += sigma1(w4) + w15 + sigma0(w7));
Round(b, c, d, e, f, g, h, a, 0x682e6ff3d6b2b8a3ull, w7 += sigma1(w5) + w0 + sigma0(w8));
Round(a, b, c, d, e, f, g, h, 0x748f82ee5defb2fcull, w8 += sigma1(w6) + w1 + sigma0(w9));
Round(h, a, b, c, d, e, f, g, 0x78a5636f43172f60ull, w9 += sigma1(w7) + w2 + sigma0(w10));
Round(g, h, a, b, c, d, e, f, 0x84c87814a1f0ab72ull, w10 += sigma1(w8) + w3 + sigma0(w11));
Round(f, g, h, a, b, c, d, e, 0x8cc702081a6439ecull, w11 += sigma1(w9) + w4 + sigma0(w12));
Round(e, f, g, h, a, b, c, d, 0x90befffa23631e28ull, w12 += sigma1(w10) + w5 + sigma0(w13));
Round(d, e, f, g, h, a, b, c, 0xa4506cebde82bde9ull, w13 += sigma1(w11) + w6 + sigma0(w14));
Round(c, d, e, f, g, h, a, b, 0xbef9a3f7b2c67915ull, w14 += sigma1(w12) + w7 + sigma0(w15));
Round(b, c, d, e, f, g, h, a, 0xc67178f2e372532bull, w15 += sigma1(w13) + w8 + sigma0(w0));
Round(a, b, c, d, e, f, g, h, 0xca273eceea26619cull, w0 += sigma1(w14) + w9 + sigma0(w1));
Round(h, a, b, c, d, e, f, g, 0xd186b8c721c0c207ull, w1 += sigma1(w15) + w10 + sigma0(w2));
Round(g, h, a, b, c, d, e, f, 0xeada7dd6cde0eb1eull, w2 += sigma1(w0) + w11 + sigma0(w3));
Round(f, g, h, a, b, c, d, e, 0xf57d4f7fee6ed178ull, w3 += sigma1(w1) + w12 + sigma0(w4));
Round(e, f, g, h, a, b, c, d, 0x06f067aa72176fbaull, w4 += sigma1(w2) + w13 + sigma0(w5));
Round(d, e, f, g, h, a, b, c, 0x0a637dc5a2c898a6ull, w5 += sigma1(w3) + w14 + sigma0(w6));
Round(c, d, e, f, g, h, a, b, 0x113f9804bef90daeull, w6 += sigma1(w4) + w15 + sigma0(w7));
Round(b, c, d, e, f, g, h, a, 0x1b710b35131c471bull, w7 += sigma1(w5) + w0 + sigma0(w8));
Round(a, b, c, d, e, f, g, h, 0x28db77f523047d84ull, w8 += sigma1(w6) + w1 + sigma0(w9));
Round(h, a, b, c, d, e, f, g, 0x32caab7b40c72493ull, w9 += sigma1(w7) + w2 + sigma0(w10));
Round(g, h, a, b, c, d, e, f, 0x3c9ebe0a15c9bebcull, w10 += sigma1(w8) + w3 + sigma0(w11));
Round(f, g, h, a, b, c, d, e, 0x431d67c49c100d4cull, w11 += sigma1(w9) + w4 + sigma0(w12));
Round(e, f, g, h, a, b, c, d, 0x4cc5d4becb3e42b6ull, w12 += sigma1(w10) + w5 + sigma0(w13));
Round(d, e, f, g, h, a, b, c, 0x597f299cfc657e2aull, w13 += sigma1(w11) + w6 + sigma0(w14));
Round(c, d, e, f, g, h, a, b, 0x5fcb6fab3ad6faecull, w14 + sigma1(w12) + w7 + sigma0(w15));
Round(b, c, d, e, f, g, h, a, 0x6c44198c4a475817ull, w15 + sigma1(w13) + w8 + sigma0(w0));
s[0] += a;
s[1] += b;
s[2] += c;
s[3] += d;
s[4] += e;
s[5] += f;
s[6] += g;
s[7] += h;
}
} // namespace sha512
} // namespace
////// SHA-512
CSHA512::CSHA512() : bytes(0)
{
sha512::Initialize(s);
}
CSHA512& CSHA512::Write(const unsigned char* data, size_t len)
{
const unsigned char* end = data + len;
size_t bufsize = bytes % 128;
if (bufsize && bufsize + len >= 128) {
// Fill the buffer, and process it.
memcpy(buf + bufsize, data, 128 - bufsize);
bytes += 128 - bufsize;
data += 128 - bufsize;
sha512::Transform(s, buf);
bufsize = 0;
}
while (end >= data + 128) {
// Process full chunks directly from the source.
sha512::Transform(s, data);
data += 128;
bytes += 128;
}
if (end > data) {
// Fill the buffer with what remains.
memcpy(buf + bufsize, data, end - data);
bytes += end - data;
}
return *this;
}
void CSHA512::Finalize(unsigned char hash[OUTPUT_SIZE])
{
static const unsigned char pad[128] = {0x80};
unsigned char sizedesc[16] = {0x00};
WriteBE64(sizedesc + 8, bytes << 3);
Write(pad, 1 + ((239 - (bytes % 128)) % 128));
Write(sizedesc, 16);
WriteBE64(hash, s[0]);
WriteBE64(hash + 8, s[1]);
WriteBE64(hash + 16, s[2]);
WriteBE64(hash + 24, s[3]);
WriteBE64(hash + 32, s[4]);
WriteBE64(hash + 40, s[5]);
WriteBE64(hash + 48, s[6]);
WriteBE64(hash + 56, s[7]);
}
CSHA512& CSHA512::Reset()
{
bytes = 0;
sha512::Initialize(s);
return *this;
}
| [
"lycion@gmail.com"
] | lycion@gmail.com |
4ffd58f69ea8bc424d48e842303f243002ea1898 | ad737f6b2872819b8ea88835edee8356da58a82e | /software/tools/arm/arm-none-eabi/include/c++/7.3.1/thread | 6e850bb8d12a152076d1a56c83968da17c34cca3 | [
"MIT"
] | permissive | UASLab/RAPTRS | e4f3240aaa41000f8d4843cbc26e537ccedf2d48 | ebcebf87b5195623a228f9844a66c34d557d2714 | refs/heads/master | 2022-05-03T02:23:16.231397 | 2022-04-04T14:02:07 | 2022-04-04T14:02:07 | 208,188,913 | 4 | 3 | MIT | 2022-04-11T18:13:21 | 2019-09-13T03:29:57 | C++ | UTF-8 | C++ | false | false | 10,267 | // <thread> -*- C++ -*-
// Copyright (C) 2008-2017 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, 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 General Public License for more details.
// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.
// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
// <http://www.gnu.org/licenses/>.
/** @file include/thread
* This is a Standard C++ Library header.
*/
#ifndef _GLIBCXX_THREAD
#define _GLIBCXX_THREAD 1
#pragma GCC system_header
#if __cplusplus < 201103L
# include <bits/c++0x_warning.h>
#else
#include <chrono>
#include <memory>
#include <tuple>
#include <cerrno>
#include <bits/functexcept.h>
#include <bits/functional_hash.h>
#include <bits/invoke.h>
#include <bits/gthr.h>
#if defined(_GLIBCXX_HAS_GTHREADS) && defined(_GLIBCXX_USE_C99_STDINT_TR1)
namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION
/**
* @defgroup threads Threads
* @ingroup concurrency
*
* Classes for thread support.
* @{
*/
/// thread
class thread
{
public:
// Abstract base class for types that wrap arbitrary functors to be
// invoked in the new thread of execution.
struct _State
{
virtual ~_State();
virtual void _M_run() = 0;
};
using _State_ptr = unique_ptr<_State>;
typedef __gthread_t native_handle_type;
/// thread::id
class id
{
native_handle_type _M_thread;
public:
id() noexcept : _M_thread() { }
explicit
id(native_handle_type __id) : _M_thread(__id) { }
private:
friend class thread;
friend class hash<thread::id>;
friend bool
operator==(thread::id __x, thread::id __y) noexcept;
friend bool
operator<(thread::id __x, thread::id __y) noexcept;
template<class _CharT, class _Traits>
friend basic_ostream<_CharT, _Traits>&
operator<<(basic_ostream<_CharT, _Traits>& __out, thread::id __id);
};
private:
id _M_id;
public:
thread() noexcept = default;
// _GLIBCXX_RESOLVE_LIB_DEFECTS
// 2097. packaged_task constructors should be constrained
thread(thread&) = delete;
thread(const thread&) = delete;
thread(const thread&&) = delete;
thread(thread&& __t) noexcept
{ swap(__t); }
template<typename _Callable, typename... _Args>
explicit
thread(_Callable&& __f, _Args&&... __args)
{
#ifdef GTHR_ACTIVE_PROXY
// Create a reference to pthread_create, not just the gthr weak symbol.
auto __depend = reinterpret_cast<void(*)()>(&pthread_create);
#else
auto __depend = nullptr;
#endif
_M_start_thread(_S_make_state(
__make_invoker(std::forward<_Callable>(__f),
std::forward<_Args>(__args)...)),
__depend);
}
~thread()
{
if (joinable())
std::terminate();
}
thread& operator=(const thread&) = delete;
thread& operator=(thread&& __t) noexcept
{
if (joinable())
std::terminate();
swap(__t);
return *this;
}
void
swap(thread& __t) noexcept
{ std::swap(_M_id, __t._M_id); }
bool
joinable() const noexcept
{ return !(_M_id == id()); }
void
join();
void
detach();
thread::id
get_id() const noexcept
{ return _M_id; }
/** @pre thread is joinable
*/
native_handle_type
native_handle()
{ return _M_id._M_thread; }
// Returns a value that hints at the number of hardware thread contexts.
static unsigned int
hardware_concurrency() noexcept;
private:
template<typename _Callable>
struct _State_impl : public _State
{
_Callable _M_func;
_State_impl(_Callable&& __f) : _M_func(std::forward<_Callable>(__f))
{ }
void
_M_run() { _M_func(); }
};
void
_M_start_thread(_State_ptr, void (*)());
template<typename _Callable>
static _State_ptr
_S_make_state(_Callable&& __f)
{
using _Impl = _State_impl<_Callable>;
return _State_ptr{new _Impl{std::forward<_Callable>(__f)}};
}
#if _GLIBCXX_THREAD_ABI_COMPAT
public:
struct _Impl_base;
typedef shared_ptr<_Impl_base> __shared_base_type;
struct _Impl_base
{
__shared_base_type _M_this_ptr;
virtual ~_Impl_base() = default;
virtual void _M_run() = 0;
};
private:
void
_M_start_thread(__shared_base_type, void (*)());
void
_M_start_thread(__shared_base_type);
#endif
private:
// A call wrapper that does INVOKE(forwarded tuple elements...)
template<typename _Tuple>
struct _Invoker
{
_Tuple _M_t;
template<size_t _Index>
static __tuple_element_t<_Index, _Tuple>&&
_S_declval();
template<size_t... _Ind>
auto
_M_invoke(_Index_tuple<_Ind...>)
noexcept(noexcept(std::__invoke(_S_declval<_Ind>()...)))
-> decltype(std::__invoke(_S_declval<_Ind>()...))
{ return std::__invoke(std::get<_Ind>(std::move(_M_t))...); }
using _Indices
= typename _Build_index_tuple<tuple_size<_Tuple>::value>::__type;
auto
operator()()
noexcept(noexcept(std::declval<_Invoker&>()._M_invoke(_Indices())))
-> decltype(std::declval<_Invoker&>()._M_invoke(_Indices()))
{ return _M_invoke(_Indices()); }
};
template<typename... _Tp>
using __decayed_tuple = tuple<typename std::decay<_Tp>::type...>;
public:
// Returns a call wrapper that stores
// tuple{DECAY_COPY(__callable), DECAY_COPY(__args)...}.
template<typename _Callable, typename... _Args>
static _Invoker<__decayed_tuple<_Callable, _Args...>>
__make_invoker(_Callable&& __callable, _Args&&... __args)
{
return { __decayed_tuple<_Callable, _Args...>{
std::forward<_Callable>(__callable), std::forward<_Args>(__args)...
} };
}
};
inline void
swap(thread& __x, thread& __y) noexcept
{ __x.swap(__y); }
inline bool
operator==(thread::id __x, thread::id __y) noexcept
{
// pthread_equal is undefined if either thread ID is not valid, so we
// can't safely use __gthread_equal on default-constructed values (nor
// the non-zero value returned by this_thread::get_id() for
// single-threaded programs using GNU libc). Assume EqualityComparable.
return __x._M_thread == __y._M_thread;
}
inline bool
operator!=(thread::id __x, thread::id __y) noexcept
{ return !(__x == __y); }
inline bool
operator<(thread::id __x, thread::id __y) noexcept
{
// Pthreads doesn't define any way to do this, so we just have to
// assume native_handle_type is LessThanComparable.
return __x._M_thread < __y._M_thread;
}
inline bool
operator<=(thread::id __x, thread::id __y) noexcept
{ return !(__y < __x); }
inline bool
operator>(thread::id __x, thread::id __y) noexcept
{ return __y < __x; }
inline bool
operator>=(thread::id __x, thread::id __y) noexcept
{ return !(__x < __y); }
// DR 889.
/// std::hash specialization for thread::id.
template<>
struct hash<thread::id>
: public __hash_base<size_t, thread::id>
{
size_t
operator()(const thread::id& __id) const noexcept
{ return std::_Hash_impl::hash(__id._M_thread); }
};
template<class _CharT, class _Traits>
inline basic_ostream<_CharT, _Traits>&
operator<<(basic_ostream<_CharT, _Traits>& __out, thread::id __id)
{
if (__id == thread::id())
return __out << "thread::id of a non-executing thread";
else
return __out << __id._M_thread;
}
_GLIBCXX_END_NAMESPACE_VERSION
/** @namespace std::this_thread
* @brief ISO C++ 2011 entities sub-namespace for thread.
* 30.3.2 Namespace this_thread.
*/
namespace this_thread
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION
/// get_id
inline thread::id
get_id() noexcept
{
#ifdef __GLIBC__
// For the GNU C library pthread_self() is usable without linking to
// libpthread.so but returns 0, so we cannot use it in single-threaded
// programs, because this_thread::get_id() != thread::id{} must be true.
// We know that pthread_t is an integral type in the GNU C library.
if (!__gthread_active_p())
return thread::id(1);
#endif
return thread::id(__gthread_self());
}
/// yield
inline void
yield() noexcept
{
#ifdef _GLIBCXX_USE_SCHED_YIELD
__gthread_yield();
#endif
}
void
__sleep_for(chrono::seconds, chrono::nanoseconds);
/// sleep_for
template<typename _Rep, typename _Period>
inline void
sleep_for(const chrono::duration<_Rep, _Period>& __rtime)
{
if (__rtime <= __rtime.zero())
return;
auto __s = chrono::duration_cast<chrono::seconds>(__rtime);
auto __ns = chrono::duration_cast<chrono::nanoseconds>(__rtime - __s);
#ifdef _GLIBCXX_USE_NANOSLEEP
__gthread_time_t __ts =
{
static_cast<std::time_t>(__s.count()),
static_cast<long>(__ns.count())
};
while (::nanosleep(&__ts, &__ts) == -1 && errno == EINTR)
{ }
#else
__sleep_for(__s, __ns);
#endif
}
/// sleep_until
template<typename _Clock, typename _Duration>
inline void
sleep_until(const chrono::time_point<_Clock, _Duration>& __atime)
{
auto __now = _Clock::now();
if (_Clock::is_steady)
{
if (__now < __atime)
sleep_for(__atime - __now);
return;
}
while (__now < __atime)
{
sleep_for(__atime - __now);
__now = _Clock::now();
}
}
_GLIBCXX_END_NAMESPACE_VERSION
}
// @} group threads
} // namespace
#endif // _GLIBCXX_HAS_GTHREADS && _GLIBCXX_USE_C99_STDINT_TR1
#endif // C++11
#endif // _GLIBCXX_THREAD
| [
"brian.taylor@bolderflight.com"
] | brian.taylor@bolderflight.com | |
5157a1509d3d22467fd5ca004aa8df133aa16e89 | aaa1443767b6f99bf6d90fd11821be114dde47ab | /src/engine/Historique.h | 9f401f431730d905064c834cb0d3392d97d3c8f4 | [] | no_license | godbeno/godbillebenoit | 3bd8c7bf913a7f80a581858ea5473dca2e0f2ea4 | 25493771af07239d0ea7a786009e51d52e41cf94 | refs/heads/master | 2021-01-21T09:02:28.401339 | 2017-01-05T20:41:48 | 2017-01-05T20:41:48 | 68,697,193 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 672 | h | // Generated by dia2code
#ifndef ENGINE__HISTORIQUE__H
#define ENGINE__HISTORIQUE__H
namespace state {
class Etat;
};
namespace engine {
class ListeActions;
class Action;
class Moteur;
}
#include "Moteur.h"
namespace engine {
/// class Historique -
class Historique {
// Associations
// Attributes
private:
state::Etat* etatPrecedent;
ListeActions* lsHistorique;
// Operations
public:
Historique (state::Etat* sauvegarde);
void ajouterAction (Action* action);
void annulerUneAction (state::Etat* etat);
void annulerToutesActions (state::Etat* etat);
void retourSauvegarde (state::Etat* etat);
};
};
#endif
| [
"nicolas.benoit@ensea.fr"
] | nicolas.benoit@ensea.fr |
14059e117712da7bc67abb4b64718b73af9a4c23 | cfe39f93225e50c89ea3b0aded35ccb00c4294a6 | /webcore_bindings/derived/JSScriptProfileNode.h | e701525879c112b55246eb546b913ef65d75f81e | [
"BSD-3-Clause"
] | permissive | Web5design/webkit.js | 4d589121d5fdb29d807bd99d387be5f256b81b91 | 050d44f34d2bac3df01be2ee33c3545e5c1ce715 | refs/heads/master | 2020-12-03T07:58:21.250807 | 2014-02-16T23:19:47 | 2014-02-16T23:19:47 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,862 | h | /*
This file is part of the WebKit open source project.
This file has been generated by generate-bindings.pl. DO NOT MODIFY!
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 JSScriptProfileNode_h
#define JSScriptProfileNode_h
#if ENABLE(JAVASCRIPT_DEBUGGER)
#include "JSDOMBinding.h"
#include "ScriptProfileNode.h"
#include <runtime/JSGlobalObject.h>
#include <runtime/JSObject.h>
#include <runtime/ObjectPrototype.h>
namespace WebCore {
class JSScriptProfileNode : public JSDOMWrapper {
public:
typedef JSDOMWrapper Base;
static JSScriptProfileNode* create(JSC::Structure* structure, JSDOMGlobalObject* globalObject, PassRefPtr<ScriptProfileNode> impl)
{
JSScriptProfileNode* ptr = new (NotNull, JSC::allocateCell<JSScriptProfileNode>(globalObject->vm().heap)) JSScriptProfileNode(structure, globalObject, impl);
ptr->finishCreation(globalObject->vm());
return ptr;
}
static JSC::JSObject* createPrototype(JSC::VM&, JSC::JSGlobalObject*);
static bool getOwnPropertySlot(JSC::JSObject*, JSC::ExecState*, JSC::PropertyName, JSC::PropertySlot&);
static void destroy(JSC::JSCell*);
~JSScriptProfileNode();
DECLARE_INFO;
static JSC::Structure* createStructure(JSC::VM& vm, JSC::JSGlobalObject* globalObject, JSC::JSValue prototype)
{
return JSC::Structure::create(vm, globalObject, prototype, JSC::TypeInfo(JSC::ObjectType, StructureFlags), info());
}
ScriptProfileNode& impl() const { return *m_impl; }
void releaseImpl() { m_impl->deref(); m_impl = 0; }
void releaseImplIfNotNull()
{
if (m_impl) {
m_impl->deref();
m_impl = 0;
}
}
private:
ScriptProfileNode* m_impl;
protected:
JSScriptProfileNode(JSC::Structure*, JSDOMGlobalObject*, PassRefPtr<ScriptProfileNode>);
void finishCreation(JSC::VM&);
static const unsigned StructureFlags = JSC::OverridesGetOwnPropertySlot | JSC::InterceptsGetOwnPropertySlotByIndexEvenWhenLengthIsNotZero | Base::StructureFlags;
};
class JSScriptProfileNodeOwner : public JSC::WeakHandleOwner {
public:
virtual bool isReachableFromOpaqueRoots(JSC::Handle<JSC::Unknown>, void* context, JSC::SlotVisitor&);
virtual void finalize(JSC::Handle<JSC::Unknown>, void* context);
};
inline JSC::WeakHandleOwner* wrapperOwner(DOMWrapperWorld&, ScriptProfileNode*)
{
DEFINE_STATIC_LOCAL(JSScriptProfileNodeOwner, jsScriptProfileNodeOwner, ());
return &jsScriptProfileNodeOwner;
}
inline void* wrapperContext(DOMWrapperWorld& world, ScriptProfileNode*)
{
return &world;
}
JSC::JSValue toJS(JSC::ExecState*, JSDOMGlobalObject*, ScriptProfileNode*);
ScriptProfileNode* toScriptProfileNode(JSC::JSValue);
class JSScriptProfileNodePrototype : public JSC::JSNonFinalObject {
public:
typedef JSC::JSNonFinalObject Base;
static JSC::JSObject* self(JSC::VM&, JSC::JSGlobalObject*);
static JSScriptProfileNodePrototype* create(JSC::VM& vm, JSC::JSGlobalObject* globalObject, JSC::Structure* structure)
{
JSScriptProfileNodePrototype* ptr = new (NotNull, JSC::allocateCell<JSScriptProfileNodePrototype>(vm.heap)) JSScriptProfileNodePrototype(vm, globalObject, structure);
ptr->finishCreation(vm);
return ptr;
}
DECLARE_INFO;
static bool getOwnPropertySlot(JSC::JSObject*, JSC::ExecState*, JSC::PropertyName, JSC::PropertySlot&);
static JSC::Structure* createStructure(JSC::VM& vm, JSC::JSGlobalObject* globalObject, JSC::JSValue prototype)
{
return JSC::Structure::create(vm, globalObject, prototype, JSC::TypeInfo(JSC::ObjectType, StructureFlags), info());
}
private:
JSScriptProfileNodePrototype(JSC::VM& vm, JSC::JSGlobalObject*, JSC::Structure* structure) : JSC::JSNonFinalObject(vm, structure) { }
protected:
static const unsigned StructureFlags = JSC::OverridesGetOwnPropertySlot | Base::StructureFlags;
};
// Functions
JSC::EncodedJSValue JSC_HOST_CALL jsScriptProfileNodePrototypeFunctionChildren(JSC::ExecState*);
// Attributes
JSC::EncodedJSValue jsScriptProfileNodeFunctionName(JSC::ExecState*, JSC::EncodedJSValue, JSC::EncodedJSValue, JSC::PropertyName);
JSC::EncodedJSValue jsScriptProfileNodeUrl(JSC::ExecState*, JSC::EncodedJSValue, JSC::EncodedJSValue, JSC::PropertyName);
JSC::EncodedJSValue jsScriptProfileNodeLineNumber(JSC::ExecState*, JSC::EncodedJSValue, JSC::EncodedJSValue, JSC::PropertyName);
JSC::EncodedJSValue jsScriptProfileNodeTotalTime(JSC::ExecState*, JSC::EncodedJSValue, JSC::EncodedJSValue, JSC::PropertyName);
JSC::EncodedJSValue jsScriptProfileNodeSelfTime(JSC::ExecState*, JSC::EncodedJSValue, JSC::EncodedJSValue, JSC::PropertyName);
JSC::EncodedJSValue jsScriptProfileNodeNumberOfCalls(JSC::ExecState*, JSC::EncodedJSValue, JSC::EncodedJSValue, JSC::PropertyName);
JSC::EncodedJSValue jsScriptProfileNodeVisible(JSC::ExecState*, JSC::EncodedJSValue, JSC::EncodedJSValue, JSC::PropertyName);
JSC::EncodedJSValue jsScriptProfileNodeCallUID(JSC::ExecState*, JSC::EncodedJSValue, JSC::EncodedJSValue, JSC::PropertyName);
} // namespace WebCore
#endif // ENABLE(JAVASCRIPT_DEBUGGER)
#endif
| [
"trevor.linton@gmail.com"
] | trevor.linton@gmail.com |
df78e3fe4a3b26f4dc18bf5f313701fbe492edf1 | 6f49cc2d5112a6b97f82e7828f59b201ea7ec7b9 | /wdbecmbd/CrdWdbeVer/QryWdbeVerList_blks.cpp | cb6ff8dec19d4775f548435554b00b85db22e7b9 | [
"MIT"
] | permissive | mpsitech/wdbe-WhizniumDBE | d3702800d6e5510e41805d105228d8dd8b251d7a | 89ef36b4c86384429f1e707e5fa635f643e81240 | refs/heads/master | 2022-09-28T10:27:03.683192 | 2022-09-18T22:04:37 | 2022-09-18T22:04:37 | 282,705,449 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,447 | cpp | /**
* \file QryWdbeVerList_blks.cpp
* job handler for job QryWdbeVerList (implementation of blocks)
* \copyright (C) 2016-2020 MPSI Technologies GmbH
* \author Alexander Wirthmueller (auto-generation)
* \date created: 28 Nov 2020
*/
// IP header --- ABOVE
using namespace std;
using namespace Sbecore;
using namespace Xmlio;
/******************************************************************************
class QryWdbeVerList::VecVOrd
******************************************************************************/
uint QryWdbeVerList::VecVOrd::getIx(
const string& sref
) {
string s = StrMod::lc(sref);
if (s == "bvr") return BVR;
if (s == "ste") return STE;
if (s == "prj") return PRJ;
if (s == "own") return OWN;
if (s == "grp") return GRP;
return(0);
};
string QryWdbeVerList::VecVOrd::getSref(
const uint ix
) {
if (ix == BVR) return("bvr");
if (ix == STE) return("ste");
if (ix == PRJ) return("prj");
if (ix == OWN) return("own");
if (ix == GRP) return("grp");
return("");
};
void QryWdbeVerList::VecVOrd::fillFeed(
Feed& feed
) {
feed.clear();
for (unsigned int i = 1; i <= 5; i++) feed.appendIxSrefTitles(i, getSref(i), getSref(i));
};
/******************************************************************************
class QryWdbeVerList::StatApp
******************************************************************************/
void QryWdbeVerList::StatApp::writeJSON(
Json::Value& sup
, string difftag
, const uint firstcol
, const uint jnumFirstdisp
, const uint ncol
, const uint ndisp
) {
if (difftag.length() == 0) difftag = "StatAppQryWdbeVerList";
Json::Value& me = sup[difftag] = Json::Value(Json::objectValue);
me["firstcol"] = firstcol;
me["jnumFirstdisp"] = jnumFirstdisp;
me["ncol"] = ncol;
me["ndisp"] = ndisp;
};
void QryWdbeVerList::StatApp::writeXML(
xmlTextWriter* wr
, string difftag
, bool shorttags
, const uint firstcol
, const uint jnumFirstdisp
, const uint ncol
, const uint ndisp
) {
if (difftag.length() == 0) difftag = "StatAppQryWdbeVerList";
string itemtag;
if (shorttags) itemtag = "Si";
else itemtag = "StatitemAppQryWdbeVerList";
xmlTextWriterStartElement(wr, BAD_CAST difftag.c_str());
writeUintAttr(wr, itemtag, "sref", "firstcol", firstcol);
writeUintAttr(wr, itemtag, "sref", "jnumFirstdisp", jnumFirstdisp);
writeUintAttr(wr, itemtag, "sref", "ncol", ncol);
writeUintAttr(wr, itemtag, "sref", "ndisp", ndisp);
xmlTextWriterEndElement(wr);
};
/******************************************************************************
class QryWdbeVerList::StatShr
******************************************************************************/
QryWdbeVerList::StatShr::StatShr(
const uint ntot
, const uint jnumFirstload
, const uint nload
) :
Block()
{
this->ntot = ntot;
this->jnumFirstload = jnumFirstload;
this->nload = nload;
mask = {NTOT, JNUMFIRSTLOAD, NLOAD};
};
void QryWdbeVerList::StatShr::writeJSON(
Json::Value& sup
, string difftag
) {
if (difftag.length() == 0) difftag = "StatShrQryWdbeVerList";
Json::Value& me = sup[difftag] = Json::Value(Json::objectValue);
me["ntot"] = ntot;
me["jnumFirstload"] = jnumFirstload;
me["nload"] = nload;
};
void QryWdbeVerList::StatShr::writeXML(
xmlTextWriter* wr
, string difftag
, bool shorttags
) {
if (difftag.length() == 0) difftag = "StatShrQryWdbeVerList";
string itemtag;
if (shorttags) itemtag = "Si";
else itemtag = "StatitemShrQryWdbeVerList";
xmlTextWriterStartElement(wr, BAD_CAST difftag.c_str());
writeUintAttr(wr, itemtag, "sref", "ntot", ntot);
writeUintAttr(wr, itemtag, "sref", "jnumFirstload", jnumFirstload);
writeUintAttr(wr, itemtag, "sref", "nload", nload);
xmlTextWriterEndElement(wr);
};
set<uint> QryWdbeVerList::StatShr::comm(
const StatShr* comp
) {
set<uint> items;
if (ntot == comp->ntot) insert(items, NTOT);
if (jnumFirstload == comp->jnumFirstload) insert(items, JNUMFIRSTLOAD);
if (nload == comp->nload) insert(items, NLOAD);
return(items);
};
set<uint> QryWdbeVerList::StatShr::diff(
const StatShr* comp
) {
set<uint> commitems;
set<uint> diffitems;
commitems = comm(comp);
diffitems = {NTOT, JNUMFIRSTLOAD, NLOAD};
for (auto it = commitems.begin(); it != commitems.end(); it++) diffitems.erase(*it);
return(diffitems);
};
/******************************************************************************
class QryWdbeVerList::StgIac
******************************************************************************/
QryWdbeVerList::StgIac::StgIac(
const uint jnum
, const uint jnumFirstload
, const uint nload
) :
Block()
{
this->jnum = jnum;
this->jnumFirstload = jnumFirstload;
this->nload = nload;
mask = {JNUM, JNUMFIRSTLOAD, NLOAD};
};
bool QryWdbeVerList::StgIac::readJSON(
const Json::Value& sup
, bool addbasetag
) {
clear();
bool basefound;
const Json::Value& me = [&]{if (!addbasetag) return sup; return sup["StgIacQryWdbeVerList"];}();
basefound = (me != Json::nullValue);
if (basefound) {
if (me.isMember("jnum")) {jnum = me["jnum"].asUInt(); add(JNUM);};
if (me.isMember("jnumFirstload")) {jnumFirstload = me["jnumFirstload"].asUInt(); add(JNUMFIRSTLOAD);};
if (me.isMember("nload")) {nload = me["nload"].asUInt(); add(NLOAD);};
};
return basefound;
};
bool QryWdbeVerList::StgIac::readXML(
xmlXPathContext* docctx
, string basexpath
, bool addbasetag
) {
clear();
bool basefound;
if (addbasetag)
basefound = checkUclcXPaths(docctx, basexpath, basexpath, "StgIacQryWdbeVerList");
else
basefound = checkXPath(docctx, basexpath);
string itemtag = "StgitemIacQryWdbeVerList";
if (basefound) {
if (extractUintAttrUclc(docctx, basexpath, itemtag, "Si", "sref", "jnum", jnum)) add(JNUM);
if (extractUintAttrUclc(docctx, basexpath, itemtag, "Si", "sref", "jnumFirstload", jnumFirstload)) add(JNUMFIRSTLOAD);
if (extractUintAttrUclc(docctx, basexpath, itemtag, "Si", "sref", "nload", nload)) add(NLOAD);
};
return basefound;
};
void QryWdbeVerList::StgIac::writeJSON(
Json::Value& sup
, string difftag
) {
if (difftag.length() == 0) difftag = "StgIacQryWdbeVerList";
Json::Value& me = sup[difftag] = Json::Value(Json::objectValue);
me["jnum"] = jnum;
me["jnumFirstload"] = jnumFirstload;
me["nload"] = nload;
};
void QryWdbeVerList::StgIac::writeXML(
xmlTextWriter* wr
, string difftag
, bool shorttags
) {
if (difftag.length() == 0) difftag = "StgIacQryWdbeVerList";
string itemtag;
if (shorttags) itemtag = "Si";
else itemtag = "StgitemIacQryWdbeVerList";
xmlTextWriterStartElement(wr, BAD_CAST difftag.c_str());
writeUintAttr(wr, itemtag, "sref", "jnum", jnum);
writeUintAttr(wr, itemtag, "sref", "jnumFirstload", jnumFirstload);
writeUintAttr(wr, itemtag, "sref", "nload", nload);
xmlTextWriterEndElement(wr);
};
set<uint> QryWdbeVerList::StgIac::comm(
const StgIac* comp
) {
set<uint> items;
if (jnum == comp->jnum) insert(items, JNUM);
if (jnumFirstload == comp->jnumFirstload) insert(items, JNUMFIRSTLOAD);
if (nload == comp->nload) insert(items, NLOAD);
return(items);
};
set<uint> QryWdbeVerList::StgIac::diff(
const StgIac* comp
) {
set<uint> commitems;
set<uint> diffitems;
commitems = comm(comp);
diffitems = {JNUM, JNUMFIRSTLOAD, NLOAD};
for (auto it = commitems.begin(); it != commitems.end(); it++) diffitems.erase(*it);
return(diffitems);
};
| [
"aw@mpsitech.com"
] | aw@mpsitech.com |
9319acb2541de21af1953d3a384c3174f2fddd02 | 8625578a733b3b7997a2b258b85feae257eaa398 | /src/coordinates_transformations.cpp | e76c25f81dd53e3e38f943a5ae6740026b5e061d | [] | no_license | Pold87/cpp-sift | 85f528939e43c88bb2dc1a1c46424146c890373c | b027c1dfb98e13ed1200685a5e03b9ffc18a219f | refs/heads/master | 2021-01-17T01:11:47.769886 | 2015-10-23T13:31:27 | 2015-10-23T13:31:27 | 42,883,083 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 4,530 | cpp | #include <math.h>
#include <cmath>
#include <GeographicLib/Geodesic.hpp>
#include <GeographicLib/Geocentric.hpp>
#include "opencv2/core.hpp"
#include "opencv2/opencv.hpp"
#include "opencv2/highgui.hpp"
const double pi = 3.14159265358979323846;
using namespace cv;
using namespace GeographicLib;
// Dimensions of the sheets on the floor in the cyberzoo (in meters)
Point2f real_img_dim(0.297 * 9, 0.420 * 9);
// Dimensions of image on the computer
Point2i pix_img_dim(2891, 4347);
// Rotation angle (difference to north)
float rotation_angle = 54.0;
cv::Point3d datum_lla(51.805628606594915, 4.376725217558763, 0);
Geocentric earth(Constants::WGS84_a(), Constants::WGS84_f());
// This function converts decimal degrees to radians
double deg2rad(double deg) {
return (deg * pi / 180);
}
// This function converts radians to decimal degrees
double rad2deg(double rad) {
return (rad * 180 / pi);
}
// Convert latitude, longitude coordinates to meter offset
Point2d lla2m(cv::Point3d lla){
cv::Point2d m;
m.x = (lla.x - datum_lla.x) * Constants::WGS84_a() * 60.0 * 0.3048;
m.y = (lla.y - datum_lla.y) * Constants::WGS84_a() * 60.0 * std::cos(deg2rad(lla.x)) * 0.3048;
return m;
}
float lla2m_g(cv::Point3d lla){
const Geodesic& geod = Geodesic::WGS84;
double dist;
geod.Inverse(lla.x, lla.y,
datum_lla.x, datum_lla.y,
dist);
return dist;
}
// Convert meter offset to latitude, longitude coordinates
cv::Point3d m2lla(cv::Point2d m){
cv::Point3d lla;
lla.x = m.x / (Constants::WGS84_a() * 60.0 * 0.3048) + datum_lla.x;
lla.y = m.y / (Constants::WGS84_a() * 60 * 0.3048 * std::cos(deg2rad(datum_lla.x))) + datum_lla.y;
lla.z = datum_lla.z;
return lla;
}
cv::Point2d rotate_point(const cv::Point2d& p, const float& angle) {
cv::Point2d out_p;
// Convert radians to degrees
float angle_rad = deg2rad(angle);
out_p.x = std::cos(angle_rad) * p.x - std::sin(angle_rad) * p.y;
out_p.y = std::sin(angle_rad) * p.x + std::cos(angle_rad) * p.y;
return out_p;
}
Point2d m2pix_diff(const cv::Point2d& diff) {
cv::Point2d pix_diff;
pix_diff.x = diff.x * (pix_img_dim.x / real_img_dim.x);
pix_diff.y = diff.y * (pix_img_dim.y / real_img_dim.y);
return pix_diff;
}
/*
Convert an offset in pixels to an offset in meters.
*/
Point2d pix2m_diff(const cv::Point2d& diff) {
cv::Point2d m_diff;
m_diff.x = diff.x * (real_img_dim.x / pix_img_dim.x);
m_diff.y = diff.y * (real_img_dim.y / pix_img_dim.y);
return m_diff;
}
cv::Point3d ecef2lla(cv::Point3d ecef) {
// Reverse calculation (ECEF - lla)
double lat, lon, h;
earth.Reverse(ecef.x, ecef.y, ecef.z,
lat, lon, h);
cv::Point3d lla(lat, lon, h);
return lla;
}
cv::Point3d lla2ecef(cv::Point3d lla) {
// Forward calculation (lla -> ECEF)
double ecef_x, ecef_y, ecef_z;
earth.Forward(lla.x, lla.y, 0,
ecef_x, ecef_y, ecef_z);
cv::Point3d ecef(ecef_x, ecef_y, ecef_z);
return ecef;
}
/*
Convert a pixel position to an ECEF position
*/
Point3d pixel_pos_to_ecef_pos(const cv::Point2d& pos) {
// Difference in meters
cv::Point2d m_diff = pix2m_diff(pos);
std::cout << "m_diff" << m_diff << std::endl;
// Rotated difference
cv::Point2d m_diff_rotated = rotate_point(m_diff, rotation_angle);
std::cout << "m_diff_rotated" << m_diff_rotated << std::endl;
// Latitude, longitude
cv::Point3d lla = m2lla(m_diff_rotated);
std::cout << "lla" << lla << std::endl;
// Ecef position
cv::Point3d ecef = lla2ecef(lla);
std::cout << "ecef" << ecef << std::endl;
return ecef;
}
/*
Convert an ECEF position to a pixel position
*/
Point2d ecef_pos_to_pixel_pos(const cv::Point3d& pos) {
std::cout << "ECEF POS TO PIXEL POS" << std::endl;
// ECEF -> Latitude, longitude, altitude (LLA)
cv::Point3d lla = ecef2lla(pos);
std::cout << "lla" << lla << std::endl;
// LLA -> Meters (m)
cv::Point2d m = lla2m(lla);
std::cout << "m" << m << std::endl;
// Rotate meters
cv::Point2d m_rot = rotate_point(m, - rotation_angle);
std::cout << "m_rot" << m_rot << std::endl;
// Get distance in pixels
cv::Point2d p = m2pix_diff(m_rot);
std::cout << "p" << p << std::endl;
return p;
}
int main() {
Point2i p(100, 100);
Point3d ecef = pixel_pos_to_ecef_pos(p);
std::cout << ecef << "\n";
Point2i p2 = ecef_pos_to_pixel_pos(ecef);
std::cout << p2 << "\n";
}
| [
"volker.strobel87@gmail.com"
] | volker.strobel87@gmail.com |
af0f5e6980444192a3839d80cfcf8cce13969580 | bc3ba9aab0f483c94f310d976683abb83709a4f1 | /image/Atlas.h | 234111792a01f3324dde4f4e99d302967a2b036b | [] | no_license | mkkellogg/Core | 283c83bb7b408e0edb0773d86ca167b5ab994b5e | a3de603df9b80ed90d7a603bd5536f9273fd55e9 | refs/heads/master | 2023-08-08T03:08:14.992663 | 2023-07-31T04:02:28 | 2023-07-31T04:02:28 | 134,364,838 | 3 | 3 | null | 2020-06-11T01:21:41 | 2018-05-22T05:28:43 | C++ | UTF-8 | C++ | false | false | 1,057 | h | #pragma once
#include <vector>
#include "../util/PersistentWeakPointer.h"
#include "Texture2D.h"
namespace Core {
class Atlas {
public:
class TileArrayDescriptor {
public:
TileArrayDescriptor(UInt32 length, Real x, Real y, Real width, Real height) {
this->length = length;
this->x = x;
this->y = y;
this->width = width;
this->height = height;
}
UInt32 length;
Real x;
Real y;
Real width;
Real height;
};
Atlas();
Atlas(WeakPointer<Texture2D> texture);
virtual ~Atlas();
WeakPointer<Texture2D> getTexture();
UInt32 getTileArrayCount () const;
void addTileArray(UInt32 length, Real x, Real y, Real width, Real height);
TileArrayDescriptor& getTileArray(UInt32 index);
private:
PersistentWeakPointer<Texture2D> texture;
std::vector<TileArrayDescriptor> tileArrays;
};
}
| [
"mkkellogg@gmail.com"
] | mkkellogg@gmail.com |
d28850ac68b4088ff32d307a07c8a43553432bde | c5690b5c463c1aa885fc517a729bf718b9cc1408 | /ordenar vector recrsivo.cpp | 33be2819a5c47d1e8705b2d8ce4507f6db6ba392 | [] | no_license | Alfon-III/FAL | 94a32c13d3f8de4a6d89a3108953c6896016c706 | 3f56098f5a3494963272546717b91226b03e27a8 | refs/heads/master | 2020-12-23T16:03:34.834300 | 2020-02-07T23:20:45 | 2020-02-07T23:20:45 | 237,198,672 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 423 | cpp | #include <iostream>
using namespace std;
/*
a = 2 llamadas recursivas
b = (b - a + 1)/2 => Como estoy dividieno por la mitad
k = n // mezcla() es lineal = 1
Coste = O(n * log n)
*/
void ordena(int v[], int a, int b){
//caso recursivo, repito mientras a < b
if(a < b){
int m = (a + b)/2;
ordena(v[], a, m - 1);
ordena(v[], m, b);
mezcla(v, a, m, b);
}
}
void ordena(int v[], int n){
ordena(v, 0, n - 1);
} | [
"alfonsotercer@gmail.com"
] | alfonsotercer@gmail.com |
37b02ebf13f09d42f2a0f863431240b9591b087d | b1610899273ec07fbc480e4d1030c58adbe2dac3 | /xe_di_chuyen/xe.h | ac78a7e3a59d201cf15d791a42a8b0d5bc56d55b | [] | no_license | sangdang05/xe_di_chuyen | 03492ea5524d61787bac3b17f9197fd85abced44 | 888014a9486bd432857566a36d4d7f4868275c54 | refs/heads/master | 2020-08-06T09:48:50.794179 | 2019-10-05T02:21:36 | 2019-10-05T02:21:36 | 212,931,932 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 437 | h | #pragma once
#include"hcn.h"
#include"htron.h"
class xe:public hcn
{
public:
int x2, y2, x4, y4;
int x5, y5, x6, y6;//ve banh sau
int x7, y7, x8, y8;//ve banh truoc
int x9, y9, x10, y10;//ve dau
hcn than,dau;
htron bx1, bx2;
xe();
void vexe(CClientDC *pDC);
void vexenguoc(CClientDC *pDC);
void dichuyenphai();
void dichuyentrai();
void di_chuyen_xe_phai(CClientDC *pDC);
void di_chuyen_xe_trai(CClientDC *pDC);
~xe();
};
| [
"56111787+sangdang05@users.noreply.github.com"
] | 56111787+sangdang05@users.noreply.github.com |
5afcfa2e3a952aa3c666a733cd91b7f85ae6c93c | c34c52ac84738ad7b838f44a47fefbc9c66e658d | /creational/singleton.cpp | 3916ec5886dba2342981bb7dd64c5f69c67b03df | [] | no_license | krisai/design_patterns | 194a9eb46bbd186f2ea47e619e63e31eb27bf7b1 | 9a3ceebb1067462956244d3eb19a7895ecf43d5c | refs/heads/master | 2021-01-23T08:57:08.961784 | 2017-11-05T13:11:17 | 2017-11-05T13:11:17 | 102,559,819 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 415 | cpp | #include <stdio.h>
class Car
{
private:
Car(){};
static Car *car;
public:
virtual ~Car(){
delete car;
};
static Car* getInstance(){
if(car == nullptr){
car = new Car;
}
return car;
}
};
Car* Car::car = nullptr;
int main(int argc, char const *argv[])
{
// Car *cc = new Car;
Car *c1 = Car::getInstance();
Car *c2 = Car::getInstance();
printf("%p\n",c1 );
printf("%p\n",c2 );
return 0;
}
| [
"itahzligen@gmail.com"
] | itahzligen@gmail.com |
eba66e2afcb216f70ad22142c2e4ecda2ee9ee65 | e95bf0d4471171171f67a28dff042469a8e85a45 | /src/baseOpject.cpp | 7c1f30db6d781dd3140a72e3598be1ddf60354e2 | [] | no_license | Sophie-Williams/BeatBot | 17a36419aef584abb191b8b5b731a23b22e8ad72 | 8410e71f38d68d2c23ec7d090f47357401020c3d | refs/heads/master | 2020-05-19T15:38:57.438876 | 2018-11-11T03:56:06 | 2018-11-11T03:56:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,624 | cpp | #include "baseOpject.h"
#include <SDL_image.h>
#include <SDL.h>
#include <SDL_ttf.h>
#include <string>
#include <stdio.h>
#include <stddef.h>
BaseOpject::BaseOpject()
{
this->mTexture = NULL;
rect_.w = 0;
rect_.h = 0;
}
BaseOpject::~BaseOpject()
{
free();
}
void BaseOpject::free()
{
if (mTexture != NULL)
{
mTexture = NULL;
rect_.w = 0;
rect_.h = 0;
}
}
void BaseOpject::setColor(Uint8 red, Uint8 green, Uint8 blue)
{
//set texture rgb
SDL_SetTextureColorMod(mTexture, red, green, blue);
}
void BaseOpject::setBlendMode(SDL_BlendMode blending)
{
//Set blending function
SDL_SetTextureBlendMode(mTexture, blending);
}
void BaseOpject::setAlpha(Uint8 alpha)
{
SDL_SetTextureAlphaMod(mTexture, alpha);
}
void BaseOpject::BaseRender(SDL_Renderer* gRenderer, SDL_Rect* clip /*=NULL*/)
{
//Set rendering space and render to screen
SDL_Rect renderQuad = { rect_.x, rect_.y, rect_.w, rect_.h };
if (clip != NULL)
{
renderQuad.w = clip->w;
renderQuad.h = clip->h;
}
SDL_RenderCopy(gRenderer, mTexture, clip, &renderQuad);
}
bool BaseOpject::LoadImageGame(std::string path, SDL_Renderer* gRenderer)
{
SDL_Texture* newTexture = NULL;
SDL_Surface* loadedSurface = IMG_Load(path.c_str());
if (loadedSurface != NULL)
{
SDL_SetColorKey(loadedSurface, SDL_TRUE, SDL_MapRGB(loadedSurface->format, 0x80, 0x80, 0x80));
newTexture = SDL_CreateTextureFromSurface(gRenderer, loadedSurface);
if (newTexture != NULL)
{
rect_.w = loadedSurface->w;
rect_.h = loadedSurface->h;
}
SDL_FreeSurface(loadedSurface);
}
//Return success
mTexture = newTexture;
return mTexture != NULL;
}
| [
"vuongpyte@gmail.com"
] | vuongpyte@gmail.com |
6bdbe062ec9f95e6fd9cf0e90e808cfa3a216567 | 521662026b2baadb3c61e8e03d2b73c1203722d7 | /Camera/src/camera.cpp | c3a5cc26031bbb7c81740d3fc9f1725280f7110d | [] | no_license | CVH95/Monterrey | 09147472c1e714146e167b3db14d64d3f59c6121 | 83a3250e3c78e8605ce9528768d95d5a2404c70a | refs/heads/master | 2020-03-17T20:46:27.429941 | 2018-05-18T08:45:48 | 2018-05-18T08:45:48 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,581 | cpp | #include <iostream>
#include <fstream>
#include <vector>
#include <fstream>
#include <stdio.h>
#include <string>
#include "opencv2/opencv.hpp"
using namespace cv;
using namespace std;
int main(int argc, char** argv)
{
ofstream csv_file;
csv_file.open("../genfiles/2Dpoints.txt");
int th = 195;
int const maxval = 255;
int th_type = 0;
VideoCapture cap;
int ss = 3;
//bool nd = true;
Mat ele = getStructuringElement(cv::MORPH_RECT, cv::Size(ss, ss), cv::Point(1, 1) );
vector<int> a;
size_t a_size = a.size();
size_t i2 = 40;
size_t i1 = 420;
size_t ref_i = 413;// row
size_t ref_j = 443;// column
// open(1) for usb cam located in /dev/video1
if(!cap.open(1))
return 0;
for(;;)
{
Mat frame;
cap >> frame;
if( frame.empty() ) break; // end of video stream
Rect Rct(85,30,555,450);
Mat ROI = frame(Rct);
// Detection starts here
cvtColor(ROI, ROI, COLOR_BGR2GRAY);
Mat thresholded;
threshold( ROI, thresholded, th, maxval, th_type);
//erode(thresholded, thresholded, ele);
// Detection ends here
imshow("Nat View", frame);
imshow("ROI", ROI);
imshow("USB external camera)", thresholded);
//waitKey(5000);
//if( waitKey(10) == 27 ) break; // stop capturing by pressing ESC
// Get two points separated 20cm (between image rows 1 and 460)
if( a_size < 4 )
{
for( size_t j=0; j<thresholded.cols; j++)
{
if (thresholded.at<uchar>(i1,j) == 255)
{
cout << "Point 1 (X, Y) = (" << i1 << ", " << j << ")" << endl;
for( size_t v=j; v<thresholded.cols; v++)
{
size_t t = v-j;
if (thresholded.at<uchar>(i2,v) == 255 && t<8)
{
cout << "Point 2 (X, Y) = (" << i2 << ", " << v << ")" << endl;
int pX1 = (int) j-ref_j;
a.push_back(pX1);
int pY1 = (int) i1-ref_i;
a.push_back(pY1);
int pX2 = (int) v-ref_j;
a.push_back(pX2);
int pY2 = (int) i2-ref_i;
a.push_back(pY2);
csv_file << pX1 << " " << pY1 << " " << pX2 << " " << pY2 << endl;
csv_file.close();
a_size = a.size();
}
}
}
}
} // if
else {cout << "Points were stored" << endl;
a.clear();}
cout << endl;
cout << endl;
cout << endl;
cout << "-------------------------------------------------- NEW FRAME --------------------------------------" << endl;
cout << endl;
cout << endl;
cout << endl;
waitKey(10000);
//a.clear();
} // for ;;
// the camera will be closed automatically upon exit
// cap.close();
return 0;
}
| [
"cavie17@student.sdu.dk"
] | cavie17@student.sdu.dk |
2b241216c6efe372e4b47024f4d28eedf7c9597a | 02d2343755b3172278bbe16de8e783459550e630 | /abc069/b/main.cpp | 772d2d4ef4bf733875fe3b22210dd20ab11ebf3f | [] | no_license | naototazumi/AtCoder | 415f2860f65caef7d30d26c4599339ddbe596213 | ede6d13db5d92778237f3481b9cd313465f31047 | refs/heads/master | 2022-04-14T11:33:47.069504 | 2020-04-20T09:29:04 | 2020-04-20T09:29:04 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 750 | cpp | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define INF_LL 1LL << 60
#define INF 99999999
#define MOD (ll)1000000007
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define REP(i, a, n) for(int i = a; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
void put_double(double obj){printf("%.12f\n",obj);};
template < typename T > std::string to_string( const T& n )
{
std::ostringstream stm ;
stm << n ;
return stm.str() ;
}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int main()
{
string s;
cin >> s;
cout << s[0] << s.size()-2 << s[s.size()-1] << endl;
}
| [
"rurito.blog@gmail.com"
] | rurito.blog@gmail.com |
d6b9a82d126cabe1ea24ddecfa76e9c64ccb2e73 | 945dd1d3a90ed189965a82f394326b8b0eebdb0d | /Game/trunk/Src/Server/Base/RouterMgr.cpp | dd2e0fc3ae04e284d2da4d942d6c185bf3c3d269 | [] | no_license | cietwwl/XProject | 078a95aa1298841cf79eeda56b47ae8f76a08e83 | ccb6a067c5754b5c1c4e50ef6fad229e86b779dc | refs/heads/master | 2020-03-14T21:13:20.087967 | 2018-04-22T14:03:46 | 2018-04-22T14:03:46 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,835 | cpp | #include "Server/Base/RouterMgr.h"
#include "Include/Logger/Logger.hpp"
#include "Server/Base/ServerContext.h"
#include "Common/TimerMgr/TimerMgr.h"
extern void StartScriptEngine();
RouterMgr::RouterMgr()
{
m_nRouterNum = 0;
memset(m_RouterList, 0, sizeof(m_RouterList));
m_nUpdateTimer = 0;
}
void RouterMgr::InitRouters()
{
ServerConfig& oSrvConf = g_poContext->GetServerConfig();
for (int i = 0; i < oSrvConf.oRouterList.size(); i++)
{
const ServerNode& oNode = oSrvConf.oRouterList[i];
AddRouter((int8_t)oNode.oRouter.uService, oNode.oRouter.sIP, oNode.oRouter.uPort);
}
if (m_nUpdateTimer == 0)
{
m_nUpdateTimer = TimerMgr::Instance()->RegisterTimer(60 * 1000, RouterMgr::UpdateConfig, this);
}
}
void RouterMgr::UpdateConfig(uint32_t uTimerID, void* pParam)
{
//XLog(LEVEL_INFO, "RouterMgr::UpdateConfig***\n");
RouterMgr* poRouterMgr = (RouterMgr*)pParam;
g_poContext->LoadServerConfig();
poRouterMgr->ClearDeadRouter();
poRouterMgr->InitRouters();
}
bool RouterMgr::IsRegisterFinish()
{
ServerConfig& oSrvConf = g_poContext->GetServerConfig();
for (int i = 0; i < oSrvConf.oRouterList.size(); i++)
{
int nService = oSrvConf.oRouterList[i].oRouter.uService;
ROUTER* poRouter = GetRouter(nService);
if (poRouter == NULL || poRouter->nSession == 0)
{
return false;
}
}
return true;
}
bool RouterMgr::AddRouter(int8_t nRouterService, const char* pszIP, uint16_t uPort)
{
if (m_nRouterNum >= MAX_ROUTER_NUM)
{
return false;
}
if (GetRouter(nRouterService) != NULL)
{
return true;
}
ROUTER& oRouter = m_RouterList[m_nRouterNum];
oRouter.Reset();
oRouter.nService = nRouterService;
oRouter.nIndex = m_nRouterNum++;
strcpy(oRouter.szIP, pszIP);
oRouter.uPort = uPort;
return g_poContext->GetService()->GetInnerNet()->Connect(pszIP, uPort);
}
ROUTER* RouterMgr::OnConnectRouterSuccess(uint16_t uPort, int nSession)
{
ROUTER* poRouter = NULL;
for (int i = 0; i < m_nRouterNum; i++)
{
if (m_RouterList[i].uPort == uPort)
{
poRouter = &m_RouterList[i];
break;
}
}
if (poRouter != NULL)
{
poRouter->nSession = nSession;
}
return poRouter;
}
void RouterMgr::OnRegisterRouterSuccess(int8_t nRouterService)
{
XLog(LEVEL_INFO, "%s: Register to router:%d successful\n", g_poContext->GetService()->GetServiceName(), nRouterService);
ROUTER* pRouter = NULL;
for (int i = 0; i < m_nRouterNum; i++)
{
if (m_RouterList[i].nService == nRouterService)
{
pRouter = &m_RouterList[i];
break;
}
}
assert(pRouter != NULL && pRouter->nSession > 0);
if (IsRegisterFinish())
{
StartScriptEngine();
}
}
void RouterMgr::OnRouterDisconnected(int nSession)
{
for (int i = 0; i < m_nRouterNum; i++)
{
if (m_RouterList[i].nSession == nSession)
{
m_RouterList[i] = m_RouterList[--m_nRouterNum];
break;
}
}
}
ROUTER* RouterMgr::GetRouter(int8_t nRouterService)
{
for (int i = 0; i < m_nRouterNum; i++)
{
if (m_RouterList[i].nService == nRouterService)
{
return &m_RouterList[i];
}
}
return NULL;
}
ROUTER* RouterMgr::ChooseRouter(int8_t nTarService)
{
if (m_nRouterNum <= 0)
{
XLog(LEVEL_ERROR, "Router count is 0!\n");
return NULL;
}
int nIndex = nTarService % m_nRouterNum;
ROUTER* poRouter = &m_RouterList[nIndex];
if (poRouter->nSession > 0)
{
return poRouter;
}
XLog(LEVEL_ERROR, "Router: %d disconnected!\n", poRouter->nService);
return NULL;
}
void RouterMgr::ClearDeadRouter()
{
for (int i = 0; i < m_nRouterNum; )
{
if (m_RouterList[i].nSession == 0)
{
m_RouterList[i] = m_RouterList[--m_nRouterNum];
}
else
{
i++;
}
}
} | [
"txalll"
] | txalll |
38fe7acd04dbfcdda356a4a51cc8e658119f2304 | 6aeccfb60568a360d2d143e0271f0def40747d73 | /sandbox/big_number/libs/multiprecision/test/math/test_hermite.cpp | bb1c3ac1246d0a23d2955e8aee74d809b502a50f | [] | no_license | ttyang/sandbox | 1066b324a13813cb1113beca75cdaf518e952276 | e1d6fde18ced644bb63e231829b2fe0664e51fac | refs/heads/trunk | 2021-01-19T17:17:47.452557 | 2013-06-07T14:19:55 | 2013-06-07T14:19:55 | 13,488,698 | 1 | 3 | null | 2023-03-20T11:52:19 | 2013-10-11T03:08:51 | C++ | UTF-8 | C++ | false | false | 3,350 | cpp | ///////////////////////////////////////////////////////////////
// Copyright 2011 John Maddock. Distributed under the Boost
// Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_
#ifdef _MSC_VER
# define _SCL_SECURE_NO_WARNINGS
#endif
#define BOOST_MATH_OVERFLOW_ERROR_POLICY ignore_error
#if !defined(TEST_MPF_50) && !defined(TEST_BACKEND) && !defined(TEST_CPP_DEC_FLOAT) && !defined(TEST_MPFR_50)
# define TEST_MPF_50
# define TEST_MPFR_50
# define TEST_CPP_DEC_FLOAT
#ifdef _MSC_VER
#pragma message("CAUTION!!: No backend type specified so testing everything.... this will take some time!!")
#endif
#ifdef __GNUC__
#pragma warning "CAUTION!!: No backend type specified so testing everything.... this will take some time!!"
#endif
#endif
#if defined(TEST_MPF_50)
#include <boost/multiprecision/gmp.hpp>
#endif
#if defined(TEST_MPFR_50)
#include <boost/multiprecision/mpfr.hpp>
#endif
#ifdef TEST_BACKEND
#include <boost/multiprecision/concepts/mp_number_archetypes.hpp>
#endif
#ifdef TEST_CPP_DEC_FLOAT
#include <boost/multiprecision/cpp_dec_float.hpp>
#endif
#include "table_type.hpp"
#define TEST_UDT
#include <boost/math/special_functions/hermite.hpp>
#include "libs/math/test/test_hermite.hpp"
void expected_results()
{
//
// Define the max and mean errors expected for
// various compilers and platforms.
//
add_expected_result(
".*", // compiler
".*", // stdlib
".*", // platform
".*", // test type(s)
".*", // test data group
"boost::math::hermite", 10, 5); // test function
//
// Finish off by printing out the compiler/stdlib/platform names,
// we do this to make it easier to mark up expected error rates.
//
std::cout << "Tests run with " << BOOST_COMPILER << ", "
<< BOOST_STDLIB << ", " << BOOST_PLATFORM << std::endl;
}
int test_main(int, char* [])
{
using namespace boost::multiprecision;
expected_results();
//
// Test at:
// 18 decimal digits: tests 80-bit long double approximations
// 30 decimal digits: tests 128-bit long double approximations
// 35 decimal digits: tests arbitrary precision code
//
#ifdef TEST_MPF_50
test_hermite(number<gmp_float<18> >(), "number<gmp_float<18> >");
test_hermite(number<gmp_float<30> >(), "number<gmp_float<30> >");
test_hermite(number<gmp_float<35> >(), "number<gmp_float<35> >");
// there should be at least one test with expression templates off:
test_hermite(number<gmp_float<35>, et_off>(), "number<gmp_float<35>, et_off>");
#endif
#ifdef TEST_MPFR_50
test_hermite(number<mpfr_float_backend<18> >(), "number<mpfr_float_backend<18> >");
test_hermite(number<mpfr_float_backend<30> >(), "number<mpfr_float_backend<30> >");
test_hermite(number<mpfr_float_backend<35> >(), "number<mpfr_float_backend<35> >");
#endif
#ifdef TEST_CPP_DEC_FLOAT
test_hermite(number<cpp_dec_float<18> >(), "number<cpp_dec_float<18> >");
test_hermite(number<cpp_dec_float<30> >(), "number<cpp_dec_float<30> >");
test_hermite(number<cpp_dec_float<35, long long, std::allocator<void> > >(), "number<cpp_dec_float<35, long long, std::allocator<void> > >");
#endif
return 0;
}
| [
"john@johnmaddock.co.uk"
] | john@johnmaddock.co.uk |
5a50232e89a0a7b9822b2188daa920225b23f574 | 341d21d935272f68daff18b1c8332c16a2d9f7bd | /src/util/globals.hh | f66aa46a4acf2d51c8ac675c90c37ea7de7e7e27 | [] | no_license | jnalanko/bufboss | 102da1cc41ea5428f19cf6f48cf4a244ea8e10b6 | 544c619cd9476eee4ded9975bb9e71fb995ab2ad | refs/heads/master | 2023-06-08T13:10:27.629333 | 2021-06-22T23:08:44 | 2021-06-22T23:10:09 | 348,117,259 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 14,723 | hh | #pragma once
#include <iostream>
#include <string>
#include <chrono>
#include <fstream>
#include <sstream>
#include <iterator>
#include <cmath>
#include <cassert>
#include <sys/types.h>
#include <sys/stat.h>
#include <string>
#include <map>
#include <unordered_map>
#include "TempFileManager.hh"
#include <signal.h>
#include "input_reading.hh"
#include "throwing_streams.hh"
#include <chrono>
#include <iomanip>
using namespace std;
using namespace std::chrono;
typedef int64_t LL;
const char read_separator = '$';
Temp_File_Manager temp_file_manager;
long long cur_time_millis(){
return (std::chrono::duration_cast< milliseconds >(system_clock::now().time_since_epoch())).count();
}
static long long int program_start_millis = cur_time_millis();
double seconds_since_program_start(){
return (cur_time_millis() - program_start_millis) / 1000.0;
}
string getTimeString(){
std::time_t result = std::time(NULL);
string time = std::asctime(std::localtime(&result));
return time.substr(0,time.size() - 1); // Trim the trailing newline
}
static bool logging_enabled = true;
void enable_logging(){
logging_enabled = true;
}
void disable_logging(){
logging_enabled = false;
}
std::mutex write_log_mutex;
void write_log(string message){
std::lock_guard<std::mutex> lock(write_log_mutex);
if(logging_enabled){
std::streamsize default_precision = std::cout.precision();
std::cerr <<
std::setprecision(4) << std::fixed <<
seconds_since_program_start() <<
std::setprecision(default_precision) <<
" " << getTimeString() << " " << message << std::endl;
}
}
map<string,vector<string> > parse_args(int argc, char** argv){
// Options are argumenta that start with "--". All non-options
// that come after an option are parameters for that option
map<string,vector<string> > M; // Option -> list of parameters
string current_option = "";
for(LL i = 1; i < argc; i++){
string S = argv[i];
if(S.size() >= 2 && S.substr(0,2) == "--"){
current_option = S;
M[current_option].resize(0); // Add empty vector for this option.
} else{
if(current_option == ""){
cerr << "Error parsing command line parameters" << endl;
exit(1);
}
M[current_option].push_back(S);
}
}
return M;
}
string figure_out_file_format(string filename){
for(LL i = filename.size()-1; i >= 0; i--){
if(filename[i] == '.'){
string end = filename.substr(i);
if(end == ".fasta") return "fasta";
if(end == ".fna") return "fasta";
if(end == ".ffn") return "fasta";
if(end == ".faa") return "fasta";
if(end == ".frn") return "fasta";
if(end == ".fa") return "fasta";
if(end == ".fastq") return "fastq";
if(end == ".fq") return "fastq";
if(end == ".gz") return "gzip";
throw(runtime_error("Unknown file format: " + filename));
}
}
throw(runtime_error("Unknown file format: " + filename));
return "unknown";
}
char fix_char(char c){
char c_new = toupper(c);
if(c_new != 'A' && c_new != 'C' && c_new != 'G' && c_new != 'T'){
LL r = rand() % 4;
if(r == 0) c_new = 'A';
if(r == 1) c_new = 'C';
if(r == 2) c_new = 'G';
if(r == 3) c_new = 'T';
}
return c_new;
}
// Returns number of chars replaced
LL fix_alphabet_of_string(string& S){
LL chars_replaced = 0;
for(LL i = 0; i < (LL)S.size(); i++){
char c = S[i];
char c_new = fix_char(c);
if(c_new != c){
S[i] = c_new;
chars_replaced++;
}
}
return chars_replaced;
}
// Makes a copy of the file and replaces a bad characters. Returns the new filename
// The new file is in fasta format
string fix_alphabet(Sequence_Reader& sr){
write_log("Making all characters upper case and replacing non-{A,C,G,T} characters with random characeters from {A,C,G,T}");
//Sequence_Reader fr(fastafile, FASTA_MODE);
string new_filename = temp_file_manager.get_temp_file_name("seqs-");
throwing_ofstream out(new_filename);
LL chars_replaced = 0;
while(!sr.done()){
string read = sr.get_next_query_stream().get_all();
chars_replaced += fix_alphabet_of_string(read);
out << ">\n" << read << "\n";
}
write_log("Replaced " + to_string(chars_replaced) + " characters");
return new_filename;
}
void sigint_handler(int sig) {
cerr << "caught signal: " << sig << endl;
cerr << "Cleaning up temporary files" << endl;
temp_file_manager.clean_up();
exit(1);
}
void sigabrt_handler(int sig) {
cerr << "caught signal: " << sig << endl;
cerr << "Cleaning up temporary files" << endl;
temp_file_manager.clean_up();
cerr << "Aborting" << endl;
exit(1);
}
auto sigint_register_return_value = signal(SIGINT, sigint_handler); // Set the SIGINT handler
auto sigabrt_register_return_value = signal(SIGABRT, sigabrt_handler); // Set the SIGABRT handler
void set_temp_dir(string temp_dir){
temp_file_manager.set_dir(temp_dir);
}
string get_temp_file_name(string prefix){
return temp_file_manager.get_temp_file_name(prefix);
}
vector<string> get_first_and_last_kmers(string fastafile, LL k){
// todo: this is pretty expensive because this has to read the whole reference data
Sequence_Reader fr(fastafile, FASTA_MODE);
vector<string> result;
while(!fr.done()){
string ref = fr.get_next_query_stream().get_all();
if((LL)ref.size() >= k){
result.push_back(ref.substr(0,k));
result.push_back(ref.substr(ref.size()-k,k));
}
}
return result;
}
// true if S is colexicographically-smaller than T
bool colex_compare(const string& S, const string& T){
LL i = 0;
while(true){
if(i == (LL)S.size() || i == (LL)T.size()){
// One of the strings is a suffix of the other. Return the shorter.
if(S.size() < T.size()) return true;
else return false;
}
if(S[S.size()-1-i] < T[T.size()-1-i]) return true;
if(S[S.size()-1-i] > T[T.size()-1-i]) return false;
i++;
}
}
bool colex_compare_cstrings(const char* x, const char* y){
LL nx = strlen(x);
LL ny = strlen(y);
for(LL i = 0; i < min(nx,ny); i++){
if(x[nx-1-i] < y[ny-1-i]) return true;
if(x[nx-1-i] > y[ny-1-i]) return false;
}
// All no mismatches -> the shorter string is smaller
return nx < ny;
};
bool lex_compare(const string& S, const string& T){
return S < T;
};
bool lex_compare_cstrings(const char* x, const char* y){
return strcmp(x,y) < 0;
};
template <typename T>
vector<T> parse_tokens(string S){
vector<T> tokens;
stringstream ss(S);
T token;
while(ss >> token) tokens.push_back(token);
return tokens;
}
// Split by whitespace
vector<string> split(string text){
std::istringstream iss(text);
std::vector<std::string> results(std::istream_iterator<std::string>{iss},
std::istream_iterator<std::string>());
return results;
}
// Split by delimiter
vector<string> split(string text, char delimiter){
assert(text.size() != 0); // If called with empty string we probably have a bug
vector<LL> I; // Delimiter indices
I.push_back(-1);
for(LL i = 0; i < (LL)text.size(); i++){
if(text[i] == delimiter){
I.push_back(i);
}
}
I.push_back(text.size());
vector<string> tokens;
for(LL i = 0; i < (LL)I.size()-1; i++){
LL len = I[i+1] - I[i] + 1 - 2;
tokens.push_back(text.substr(I[i]+1, len));
}
return tokens;
}
vector<string> split(const char* text, char delimiter){
return split(string(text), delimiter);
}
// https://stackoverflow.com/questions/18100097/portable-way-to-check-if-directory-exists-windows-linux-c
void check_dir_exists(string path){
struct stat info;
if( stat( path.c_str(), &info ) != 0 ){
cerr << "Error: can not access directory " << path << endl;
exit(1);
}
else if( info.st_mode & S_IFDIR ){
// All good
}
else{
cerr << "Error: is not a directory: " << path << endl;
exit(1);
}
}
void check_readable(string filename){
throwing_ifstream F(filename); // Throws on failure
}
// Also clears the file
void check_writable(string filename){
throwing_ofstream F(filename, std::ofstream::out | std::ofstream::app); // Throws on failure
}
template <typename T>
void write_to_file(string path, T& thing){
throwing_ofstream out(path);
out << thing << endl;
}
template <typename T>
void read_from_file(string path, T& thing){
throwing_ifstream input(path);
input >> thing;
}
vector<string> get_all_lines(string infile){
vector<string> lines;
string line;
throwing_ifstream in(infile);
while(in.getline(line)){
lines.push_back(line);
}
return lines;
}
vector<char> read_binary_file(string infile){
throwing_ifstream file(infile, std::ios::binary | std::ios::ate);
std::streamsize size = file.stream.tellg();
file.stream.seekg(0, std::ios::beg);
std::vector<char> buffer(size);
if (file.read(buffer.data(), size)){
return buffer;
} else{
cerr << "Error reading file: " << infile << endl;
assert(false);
}
return buffer; // Will never come here but compiler givse a warning if this is not here
}
bool files_are_equal(const std::string& p1, const std::string& p2) {
//https://stackoverflow.com/questions/6163611/compare-two-files/6163627
throwing_ifstream f1(p1, std::ifstream::binary|std::ifstream::ate);
throwing_ifstream f2(p2, std::ifstream::binary|std::ifstream::ate);
if (f1.stream.tellg() != f2.stream.tellg()) {
return false; //size mismatch
}
//seek back to beginning and use std::equal to compare contents
f1.stream.seekg(0, std::ifstream::beg);
f2.stream.seekg(0, std::ifstream::beg);
return std::equal(std::istreambuf_iterator<char>(f1.stream.rdbuf()),
std::istreambuf_iterator<char>(),
std::istreambuf_iterator<char>(f2.stream.rdbuf()));
}
void check_true(bool condition, string error_message){
if(!condition){
throw std::runtime_error(error_message);
}
}
class Progress_printer{
public:
LL n_jobs;
LL processed;
LL total_prints;
LL next_print;
Progress_printer(LL n_jobs, LL total_prints) : n_jobs(n_jobs), processed(0), total_prints(total_prints), next_print(0) {}
void job_done(){
if(next_print == processed){
LL progress_percent = round(100 * ((double)processed / n_jobs));
write_log("Progress: " + to_string(progress_percent) + "%");
next_print += n_jobs / total_prints;
}
processed++;
}
};
set<char> get_alphabet(string S){
set<char> ans;
for(char c: S) ans.insert(c);
return ans;
}
set<string> get_all_distinct_kmers(string S, LL k){
set<string> kmers;
for(LL i = 0; i < (LL)(S.size())-k+1; i++){
kmers.insert(S.substr(i,k));
}
return kmers;
}
set<string> get_all_distinct_cyclic_kmers(string S, LL k){
set<string> kmers;
for(LL i = 0; i < (LL)S.size(); i++){
string kmer;
for(LL j = 0; j < k; j++){
kmer += S[(i+j) % S.size()];
}
kmers.insert(kmer);
}
return kmers;
}
set<string> get_all_distinct_cyclic_kmers(vector<string>& A, LL k){
string concat;
for(string read : A){
concat += read_separator + read;
}
concat += '\x01'; // bibwt end sentinel
return get_all_distinct_cyclic_kmers(concat,k);
}
vector<string> get_all_kmers(string& S, LL k){
vector<string> kmers;
for(LL i = 0; i < (LL)S.size()-k+1; i++){
kmers.push_back(S.substr(i,k));
}
return kmers;
}
vector<string> all_binary_strings_up_to(int64_t k){ // For testing
vector<string> ans;
for(int64_t length = 1; length <= k; length++){
for(int64_t mask = 0; mask < (1 << length); mask++){
string s = "";
for(int64_t i = 0; i < length; i++){
if(mask & (1 << i)) s += 'A';
else s += 'C';
}
ans.push_back(s);
}
}
return ans;
}
string get_random_dna_string(int64_t length, int64_t alphabet_size){ // For testing
string s;
assert(alphabet_size >= 1 && alphabet_size <= 4);
char alphabet[4] = {'A','T','G','C'};
for(int64_t i = 0; i < length; i++){
s.push_back(alphabet[rand() % alphabet_size]);
}
return s;
}
string get_random_string(int64_t length, int64_t alphabet_size){ // For testing
string s;
for(int64_t i = 0; i < length; i++){
LL r = rand() % alphabet_size;
s += 'a' + r;
}
return s;
}
vector<string> get_sorted_suffixes(string S){
vector<string> suffixes;
for(int64_t i = 0; i < (LL)S.size(); i++){
suffixes.push_back(S.substr(i));
}
sort(suffixes.begin(), suffixes.end());
return suffixes;
}
template <typename S, typename T>
ostream& operator<<(ostream& os, const unordered_map<S,T>& v){
os << "[";
for(auto it = v.begin(); it != v.end(); it++) {
if(it != v.begin()) os << ", ";
os << it->first << ": " << it->second;
}
os << "]";
return os;
}
template <typename S, typename T>
ostream& operator<<(ostream& os, const map<S,T>& v){
os << "{";
for(auto it = v.begin(); it != v.end(); it++) {
if(it != v.begin()) os << ", ";
os << it->first << ": " << it->second;
}
os << "}";
return os;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v){
os << "[";
for(auto it = v.begin(); it != v.end(); it++) {
if(it != v.begin()) os << ", ";
os << *it;
}
os << "]";
return os;
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v){
os << "[";
for(auto it = v.begin(); it != v.end(); it++) {
if(it != v.begin()) os << ", ";
os << *it;
}
os << "]";
return os;
}
template <typename T>
ostream& operator<<(ostream& os, const multiset<T>& v){
os << "[";
for(auto it = v.begin(); it != v.end(); it++) {
if(it != v.begin()) os << ", ";
os << *it;
}
os << "]";
return os;
}
template <typename S, typename T>
ostream& operator<<(ostream& os, const pair<S,T>& x){
os << "(" << x.first << ", " << x.second << ")";
return os;
} | [
"alanko.jarno@gmail.com"
] | alanko.jarno@gmail.com |
996d0a7c3ca7d5b9f139eb9a04fa440ca6af364b | fb7efe44f4d9f30d623f880d0eb620f3a81f0fbd | /chrome/browser/ntp_snippets/download_suggestions_provider.h | f0bd6d56551afb5e79aec33bed7b02619262bb3c | [
"BSD-3-Clause"
] | permissive | wzyy2/chromium-browser | 2644b0daf58f8b3caee8a6c09a2b448b2dfe059c | eb905f00a0f7e141e8d6c89be8fb26192a88c4b7 | refs/heads/master | 2022-11-23T20:25:08.120045 | 2018-01-16T06:41:26 | 2018-01-16T06:41:26 | 117,618,467 | 3 | 2 | BSD-3-Clause | 2022-11-20T22:03:57 | 2018-01-16T02:09:10 | null | UTF-8 | C++ | false | false | 10,748 | h | // Copyright 2016 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef CHROME_BROWSER_NTP_SNIPPETS_DOWNLOAD_SUGGESTIONS_PROVIDER_H_
#define CHROME_BROWSER_NTP_SNIPPETS_DOWNLOAD_SUGGESTIONS_PROVIDER_H_
#include <set>
#include <string>
#include <vector>
#include "base/callback_forward.h"
#include "base/memory/ptr_util.h"
#include "base/memory/weak_ptr.h"
#include "chrome/browser/download/download_history.h"
#include "components/ntp_snippets/callbacks.h"
#include "components/ntp_snippets/category.h"
#include "components/ntp_snippets/category_status.h"
#include "components/ntp_snippets/content_suggestion.h"
#include "components/ntp_snippets/content_suggestions_provider.h"
#include "components/offline_pages/core/offline_page_model.h"
#include "content/public/browser/download_manager.h"
class PrefRegistrySimple;
class PrefService;
namespace offline_pages {
struct OfflinePageItem;
}
namespace base {
class Clock;
}
// Provides download content suggestions from the offline pages model and the
// download manager (obtaining the data through DownloadManager and each
// DownloadItem). Offline page related downloads are referred to as offline page
// downloads, while the remaining downloads (e.g. images, music, books) are
// called asset downloads. In case either of the data sources is |nullptr|, it
// is ignored.
class DownloadSuggestionsProvider
: public ntp_snippets::ContentSuggestionsProvider,
public offline_pages::OfflinePageModel::Observer,
public content::DownloadManager::Observer,
public content::DownloadItem::Observer,
public DownloadHistory::Observer {
public:
DownloadSuggestionsProvider(
ContentSuggestionsProvider::Observer* observer,
offline_pages::OfflinePageModel* offline_page_model,
content::DownloadManager* download_manager,
DownloadHistory* download_history,
PrefService* pref_service,
std::unique_ptr<base::Clock> clock);
~DownloadSuggestionsProvider() override;
// ContentSuggestionsProvider implementation.
ntp_snippets::CategoryStatus GetCategoryStatus(
ntp_snippets::Category category) override;
ntp_snippets::CategoryInfo GetCategoryInfo(
ntp_snippets::Category category) override;
void DismissSuggestion(
const ntp_snippets::ContentSuggestion::ID& suggestion_id) override;
void FetchSuggestionImage(
const ntp_snippets::ContentSuggestion::ID& suggestion_id,
ntp_snippets::ImageFetchedCallback callback) override;
void Fetch(const ntp_snippets::Category& category,
const std::set<std::string>& known_suggestion_ids,
ntp_snippets::FetchDoneCallback callback) override;
void ClearHistory(
base::Time begin,
base::Time end,
const base::Callback<bool(const GURL& url)>& filter) override;
void ClearCachedSuggestions(ntp_snippets::Category category) override;
void GetDismissedSuggestionsForDebugging(
ntp_snippets::Category category,
ntp_snippets::DismissedSuggestionsCallback callback) override;
void ClearDismissedSuggestionsForDebugging(
ntp_snippets::Category category) override;
static void RegisterProfilePrefs(PrefRegistrySimple* registry);
private:
friend class DownloadSuggestionsProviderTest;
void GetPagesMatchingQueryCallbackForGetDismissedSuggestions(
ntp_snippets::DismissedSuggestionsCallback callback,
const std::vector<offline_pages::OfflinePageItem>& offline_pages) const;
// OfflinePageModel::Observer implementation.
void OfflinePageModelLoaded(offline_pages::OfflinePageModel* model) override;
void OfflinePageAdded(
offline_pages::OfflinePageModel* model,
const offline_pages::OfflinePageItem& added_page) override;
void OfflinePageDeleted(
const offline_pages::OfflinePageModel::DeletedPageInfo& page_info)
override;
// content::DownloadManager::Observer implementation.
void OnDownloadCreated(content::DownloadManager* manager,
content::DownloadItem* item) override;
void ManagerGoingDown(content::DownloadManager* manager) override;
// content::DownloadItem::Observer implementation.
void OnDownloadUpdated(content::DownloadItem* item) override;
void OnDownloadOpened(content::DownloadItem* item) override;
void OnDownloadRemoved(content::DownloadItem* item) override;
void OnDownloadDestroyed(content::DownloadItem* item) override;
// DownloadHistory::Observer implementation.
void OnHistoryQueryComplete() override;
void OnDownloadHistoryDestroyed() override;
// Updates the |category_status_| of the |provided_category_| and notifies the
// |observer_|, if necessary.
void NotifyStatusChanged(ntp_snippets::CategoryStatus new_status);
// Requests all offline pages and after asynchronously obtaining the result,
// prunes dismissed IDs and caches some most recent items. If |notify| is
// true, notifies |ContentSuggestionsProvider::Observer| about them.
void AsynchronouslyFetchOfflinePagesDownloads(bool notify);
// Retrieves all asset downloads, prunes dismissed IDs and caches some most
// recent items, but does not notify |ContentSuggestionsProvider::Observer|
// about them.
void FetchAssetsDownloads();
// Retrieves both offline page and asset downloads, updates the internal cache
// and notifies |ContentSuggestionsProvider::Observer|.
void AsynchronouslyFetchAllDownloadsAndSubmitSuggestions();
// Takes |kMaxSuggestionsCount| the most recent cached suggestions and
// notifies |ContentSuggestionsProvider::Observer| about them.
void SubmitContentSuggestions();
// Converts an OfflinePageItem to a ContentSuggestion for the
// |provided_category_|.
ntp_snippets::ContentSuggestion ConvertOfflinePage(
const offline_pages::OfflinePageItem& offline_page) const;
// Converts DownloadItem to a ContentSuggestion for the |provided_category_|.
ntp_snippets::ContentSuggestion ConvertDownloadItem(
const content::DownloadItem& download_item) const;
// Returns true if a download published and last visited times are considered
// too old for the download to be shown.
bool IsDownloadOutdated(const base::Time& published_time,
const base::Time& last_visited_time);
// Adds |item| to the internal asset download cache if all of the following
// holds:
// - the download is completed;
// - its suggestion has not been dismissed;
// - there are less than |kMaxSuggestionsCount| items cached or the oldest
// cached item is older than the current item (the oldest item is removed
// then);
// - the item is not present in the cache yet.
// Returns |true| if the item has been added.
bool CacheAssetDownloadIfNeeded(const content::DownloadItem* item);
// Removes item corresponding to |suggestion_id| either from offline pages or
// asset download cache (depends on the |suggestion_id|). Returns |false| if
// there is no corresponding item in the cache and so nothing has been
// removed.
bool RemoveSuggestionFromCacheIfPresent(
const ntp_snippets::ContentSuggestion::ID& suggestion_id);
// Removes item corresponding to |suggestion_id| from cache and fetches all
// corresponding downloads to update the cache if there may be any not in
// cache.
void RemoveSuggestionFromCacheAndRetrieveMoreIfNeeded(
const ntp_snippets::ContentSuggestion::ID& suggestion_id);
// Processes a list of offline pages (assuming that these are all the download
// offline pages that currently exist), prunes dismissed IDs and updates
// internal cache. If |notify| is true, notifies
// |ContentSuggestionsProvider::Observer|.
void UpdateOfflinePagesCache(
bool notify,
const std::vector<offline_pages::OfflinePageItem>&
all_download_offline_pages);
// Fires the |OnSuggestionInvalidated| event for the suggestion corresponding
// to the given |id_within_category| and clears it from the dismissed IDs
// list, if necessary.
void InvalidateSuggestion(const std::string& id_within_category);
// Reads dismissed IDs related to asset downloads from prefs.
std::set<std::string> ReadAssetDismissedIDsFromPrefs() const;
// Writes |dismissed_ids| into prefs for asset downloads.
void StoreAssetDismissedIDsToPrefs(
const std::set<std::string>& dismissed_ids);
// Reads dismissed IDs related to offline page downloads from prefs.
std::set<std::string> ReadOfflinePageDismissedIDsFromPrefs() const;
// Writes |dismissed_ids| into prefs for offline page downloads.
void StoreOfflinePageDismissedIDsToPrefs(
const std::set<std::string>& dismissed_ids);
// Reads from prefs dismissed IDs related to either offline page or asset
// downloads (given by |for_offline_page_downloads|).
std::set<std::string> ReadDismissedIDsFromPrefs(
bool for_offline_page_downloads) const;
// Writes |dismissed_ids| into prefs for either offline page or asset
// downloads (given by |for_offline_page_downloads|).
void StoreDismissedIDsToPrefs(bool for_offline_page_downloads,
const std::set<std::string>& dismissed_ids);
void UnregisterDownloadItemObservers();
ntp_snippets::CategoryStatus category_status_;
const ntp_snippets::Category provided_category_;
offline_pages::OfflinePageModel* offline_page_model_;
content::DownloadManager* download_manager_;
DownloadHistory* download_history_;
PrefService* pref_service_;
std::unique_ptr<base::Clock> clock_;
// Cached offline page downloads. If there are not enough asset downloads, all
// of these could be shown (they are the most recently visited, not dismissed
// and not invalidated). Order is undefined. If the model has less than
// |kMaxSuggestionsCount| offline pages, then all of them which satisfy the
// criteria above are cached, otherwise only |kMaxSuggestionsCount|.
std::vector<offline_pages::OfflinePageItem> cached_offline_page_downloads_;
// Cached asset downloads. If there are not enough offline page downloads, all
// of these could be shown (they are the most recently downloaded, not
// dismissed and not invalidated). Order is undefined. If the model has less
// than |kMaxSuggestionsCount| asset downloads, then all of them which satisfy
// the criteria above are cached, otherwise only |kMaxSuggestionsCount|.
std::vector<const content::DownloadItem*> cached_asset_downloads_;
bool is_asset_downloads_initialization_complete_;
base::WeakPtrFactory<DownloadSuggestionsProvider> weak_ptr_factory_;
DISALLOW_COPY_AND_ASSIGN(DownloadSuggestionsProvider);
};
#endif // CHROME_BROWSER_NTP_SNIPPETS_DOWNLOAD_SUGGESTIONS_PROVIDER_H_
| [
"jacob-chen@iotwrt.com"
] | jacob-chen@iotwrt.com |
785d94f506baa4b36d73735f2c3a347f29780c64 | d9a1c1f8be52fec565650042f60466aa14d91db5 | /include/shadergraph/block/SDF_RoundCone2.h | 3010f0d9be39eb869d5fa5620fdc8ead2b219751 | [
"MIT"
] | permissive | xzrunner/shadergraph | aee3bb20f7ba002414ccd948beb8e378d196f9a8 | a5bf002b40738010ef4d9870f507d4faf07ba893 | refs/heads/master | 2021-06-23T08:44:08.987696 | 2020-11-20T23:57:21 | 2020-11-20T23:57:21 | 146,755,500 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,215 | h | // from https://iquilezles.org/www/articles/distfunctions/distfunctions.htm
#pragma once
#include "shadergraph/Block.h"
namespace shadergraph
{
namespace block
{
class SDF_RoundCone2 : public Block
{
public:
SDF_RoundCone2() : Block(R"(
/////////////////////////////////////////////////
/// <sdRoundCone> @export
/////////////////////////////////////////////////
float dot2( in vec3 v ) { return dot(v,v); }
float sdRoundCone(vec3 p, vec3 a, vec3 b, float r1, float r2)
{
// sampling independent computations (only depend on shape)
vec3 ba = b - a;
float l2 = dot(ba, ba);
float rr = r1 - r2;
float a2 = l2 - rr * rr;
float il2 = 1.0 / l2;
// sampling dependant computations
vec3 pa = p - a;
float y = dot(pa, ba);
float z = y - l2;
float x2 = dot2(pa * l2 - ba * y);
float y2 = y * y * l2;
float z2 = z * z * l2;
// single square root!
float k = sign(rr) * rr * rr * x2;
if (sign(z) * a2 * z2 > k) return sqrt(x2 + z2) * il2 - r2;
if (sign(y) * a2 * y2 < k) return sqrt(x2 + y2) * il2 - r1;
return (sqrt(x2 * a2 * il2) + y * rr) * il2 - r1;
}
)") {}
RTTR_ENABLE(Block)
}; // SDF_RoundCone2
}
} | [
"xzrunner@gmail.com"
] | xzrunner@gmail.com |
7e5882155df3d4658488dd4823f5cb341a27dcf6 | 1f7bc0d0388b2a729e1c1d9c9246fe069ab05d64 | /src/main.cpp | 4798b8697c18ee9212cdff31335a573afcd028a6 | [] | no_license | bazhenov/linear-counter | cbd96836828251ccc2084dac87059d5afc81ff59 | 6c5a486cbb9e46865a38d23c29ab6d432ac483e7 | refs/heads/master | 2021-06-01T13:11:36.430190 | 2018-05-24T08:02:55 | 2018-05-24T08:02:55 | 7,129,319 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,555 | cpp | #include <iostream>
#include <cmath>
#include <boost/program_options.hpp>
#include "md5.hpp"
using namespace std;
using namespace md5;
namespace po = boost::program_options;
uint32 do_hash(const char* text, size_t length) {
md5_context md5;
uint8 digest[16];
uint32* result = (uint32*)digest;
md5_starts(&md5);
md5_update(&md5, (uint8 *)text, length);
md5_finish(&md5, digest);
return *result;
};
int populationCount(int x) {
x = x - ((x >> 1) & 0x55555555);
x = (x & 0x33333333) + ((x >> 2) & 0x33333333);
x = (x + (x >> 4)) & 0x0F0F0F0F;
x = x + (x >> 8);
x = x + (x >> 16);
return x & 0x0000003F;
}
class LinearCounter {
private:
char* vector;
size_t size;
public:
LinearCounter(int sz) : size(sz) {
vector = (char*)malloc(size);
memset(vector, 0, size);
}
~LinearCounter() {
free(vector);
}
void offer(const char* text, size_t textSize) {
uint32 h = do_hash(text, textSize) % ((int)size * 8);
uint32 byte = h / 8;
uint32 bit = h % 8;
vector[byte] |= 1 << bit;
}
int usedBits() {
int* p = (int*)vector;
int* last = (int*)(vector + size);
int result = 0;
while(p < last) {
result += populationCount(*(p++));
}
return result;
}
size_t unusedBits() {
return length() - usedBits();
}
double usedBitsProportion() {
return (double)usedBits() / length();
}
long cardinalityEstimate() {
size_t unused_bits = unusedBits();
if (unused_bits == 0) {
return -1;
} else {
return length() * log((double)length() / unusedBits());
}
}
size_t length() {
return size * 8;
}
};
int main(int argc, char** argv) {
po::options_description desc("Allowed options");
desc.add_options()
("help", "produce help message")
("size", po::value<int>()->default_value(125000), "the size of the linear counter in bytes")
("buffer", po::value<int>()->default_value(1024), "the size of the line buffer in bytes");
po::variables_map vm;
po::basic_parsed_options<char> opts = po::command_line_parser(argc, argv).options(desc).allow_unregistered().run();
po::store(opts, vm);
if (vm.count("help")) {
cout << desc << endl;
return 1;
}
int size = vm["size"].as<int>();
string line;
LinearCounter a(size);
int buffer_size = vm["size"].as<int>();
char buffer[buffer_size];
while (fgets(buffer, buffer_size, stdin)) {
a.offer(buffer, strlen(buffer));
}
long est = a.cardinalityEstimate();
if (est < 0) {
cerr << "Estimate could not be given. Try greater mask (--size)" << endl;
return 255;
} else {
cout << est << endl;
return 0;
}
} | [
"bazhenov@farpost.com"
] | bazhenov@farpost.com |
e443d6194894e652e0dcc6ff85a790ee376664fc | cf1911723d07048c4180ace63afbd6ae60727eb0 | /nyanPictureLib/bltBeta.cpp | 38cd8666a31214fa3ceab73c7c6ab8fe9bea30fb | [] | no_license | tinyan/SystemNNN | 57490606973d95aa1e65d6090957b0e25c5b89f8 | 07e18ded880a0998bf5560c05c112b5520653e19 | refs/heads/master | 2023-05-04T17:30:42.406037 | 2023-04-16T03:38:40 | 2023-04-16T03:38:40 | 7,564,789 | 13 | 2 | null | null | null | null | SHIFT_JIS | C++ | false | false | 2,441 | cpp | #include <windows.h>
#include <stdio.h>
#include "..\nyanLib\include\commonmacro.h"
#include "..\nyanLib\include\myGraphics.h"
#include "bltBeta.h"
CBltBeta::CBltBeta()
{
}
CBltBeta::~CBltBeta()
{
End();
}
void CBltBeta::End(void)
{
}
void CBltBeta::Print(POINT putPoint,POINT srcPoint,SIZE putSize,LPVOID picData,SIZE srcSize)
{
int* src = (int*)picData;
int* dst = CMyGraphics::GetScreenBuffer();
int screenSizeX = CMyGraphics::GetScreenSizeX();
// int screenSizeY = CMyGraphics::GetScreenSizeY();
src += (SSIZE_T)srcPoint.y * srcSize.cx + srcPoint.x;
dst += (SSIZE_T)putPoint.y * screenSizeX + putPoint.x;
int srcPitch = srcSize.cx * sizeof(int);
int dstPitch = screenSizeX * 4;
int loopY = putSize.cy;
int loopX = putSize.cx;
if ((loopY<=0) || (loopX<=0)) return;
#if defined _WIN64
#pragma message("*** 実装したにゃ ここにc++実装が必要にゃ " __FILE__)
int* esi = src;
int* edi = dst;
for (int j = 0; j < loopY; j++)
{
int* pushesi = esi;
int* pushedi = edi;
memcpy(edi, esi, loopX * sizeof(int));
esi = pushesi;
edi = pushedi;
esi += srcPitch / 4;
edi += dstPitch / 4;
}
#else
if ((srcPoint.x == 0) && (putSize.cx == screenSizeX) && (putPoint.x==0))
{
int loopX2 = loopX / 8;
__asm
{
push eax
push ebx
push ecx
push edx
push esi
push edi
mov esi,src
mov edi,dst
mov edx,loopY
cld
LOOP1:
push esi
push edi
// pre fetch read wnd write buffer to L1 L2 Cache
mov ecx,loopX2
LOOPPRF1:
mov eax,[esi]
mov ebx,[edi]
add esi,32
add edi,32
dec ecx
jnz LOOPPRF1
pop edi
pop esi
push esi
push edi
mov ecx,loopX2
LOOP2:
movq mm0,[esi]
movq mm1,[esi+8]
movq mm2,[esi+16]
movq mm3,[esi+24]
movq [edi],mm0
movq [edi+8],mm1
movq [edi+16],mm2
movq [edi+24],mm3
add esi,32
add edi,32
dec ecx
jnz LOOP2
pop edi
pop esi
add esi,srcPitch
add edi,dstPitch
dec edx
jnz LOOP1
pop edi
pop esi
pop edx
pop ecx
pop ebx
pop eax
emms
}
}
else
{
__asm
{
push eax
push ebx
push ecx
push edx
push esi
push edi
mov esi,src
mov edi,dst
mov edx,loopY
cld
LOOP_N1:
push esi
push edi
mov ecx,loopX
rep movsd
pop edi
pop esi
add esi,srcPitch
add edi,dstPitch
dec edx
jnz LOOP_N1
pop edi
pop esi
pop edx
pop ecx
pop ebx
pop eax
}
}
#endif
}
| [
"tinyan@mri.biglobe.ne.jp"
] | tinyan@mri.biglobe.ne.jp |
2ff5de15849dc472fd7b9be0d758227a44937ed2 | 96a59ce1d89472f3342de04123606816e4b88ca3 | /zswlib/mesh/test/test_flann.cpp | 856f879490e5c33c0f11d44c51518e281d11c5e3 | [] | no_license | wegatron/geometry | f620796fbeffc25417090c580041cdacefe74a01 | 36aa73a04deb54c8c24c2919f723af89dbf91226 | refs/heads/master | 2020-04-06T07:04:48.212278 | 2016-03-31T07:11:50 | 2016-03-31T07:11:50 | 36,479,096 | 0 | 0 | null | 2016-03-31T07:11:51 | 2015-05-29T02:50:36 | C++ | UTF-8 | C++ | false | false | 695 | cpp | #include <iostream>
#include <jtflib/mesh2/mesh.h>
#include <zswlib/mesh/zsw_flann.h>
int main(int argc, char *argv[])
{
jtf::mesh2::meshes tmp_mesh;
jtf::mesh2::load_obj("E:/workspace/geometry/bilateral_normal_filtering/result/2/expected.obj", tmp_mesh.mesh_, tmp_mesh.node_);
zsw::Flann<double> flann(tmp_mesh.node_.data(), (size_t)tmp_mesh.node_.cols());
Eigen::Matrix<double, 3, Eigen::Dynamic> query = tmp_mesh.node_;
std::vector<size_t> indices;
std::vector<double> dist;
flann.queryNearest(query, indices, dist);
for(size_t i=0; i<indices.size(); ++i) {
std::cout << indices[i] << "/" << dist[i] << " ";
}
std::cout << std::endl;
return 0;
}
| [
"wegatron@gmail.com"
] | wegatron@gmail.com |
67702395121b6343e7ecb3f712e74f92a10aa1d8 | 2fe3ef36ef7b096ff9a88e53e280e0019de68bda | /Txt-master/Source/Test_txt/Public/Save.h | 068ecc443bd16ef70a0eee442149c8da33ab8b9a | [] | no_license | EiVinny/Test_Master | 1702039daaaec55c01d3dc0514bccec31af18555 | 96f33bd3765a0c7363611e556a846a14e971821f | refs/heads/master | 2020-03-18T15:01:20.141081 | 2018-05-29T11:40:55 | 2018-05-29T11:40:55 | 134,882,193 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 395 | h | // Fill out your copyright notice in the Description page of Project Settings.
#pragma once
#include "CoreMinimal.h"
#include "iostream"
//#include "windows.system.h"
//#include "ActorComponent.generated.h"
using namespace std;
/**
*
*/
class TEST_TXT_API Save{
//BinaryParam bf = new BinaryParam();
public:
Save();
//static void SaveInfo(AActor dados, string path);
~Save();
};
| [
"vinnyosantos@gmail.com"
] | vinnyosantos@gmail.com |
3137f1dcab19aab0a5b2bb3d4ad46189e7014c7f | 2bad8133914b30f6f53a19f2609a5e5e5952f718 | /RoboCatClient/Inc/SFRenderManager.h | bc19df2630bc46a01bcd0a9862bcd2be88ec5be1 | [] | no_license | kaygrum/Multiplayer | 16d941ede667fd0ac774a4e479a2f49d9096a5b5 | 7a199b2f98789b55fc01fe54daecb8121c437122 | refs/heads/master | 2020-04-27T14:54:10.714502 | 2019-05-25T16:33:08 | 2019-05-25T16:33:08 | 174,424,204 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 920 | h | #pragma once
//I take care of rendering things!
class SFRenderManager
{
public:
static void StaticInit();
static std::unique_ptr<SFRenderManager> sInstance;
void Render();
void RenderComponents();
//vert inefficient method of tracking scene graph...
void AddComponent(SFSpriteComponent* inComponent);
void RemoveComponent(SFSpriteComponent* inComponent);
int GetComponentIndex(SFSpriteComponent* inComponent) const;
sf::Vector2f FindCatCentre();
private:
SFRenderManager();
void RenderUI();
void RenderShadows();
void UpdateView();
void RenderTexturedWorld();
uint8_t FindCatTrash();
sf::Vector2f NumberofAliveCats();
//this can't be only place that holds on to component- it has to live inside a GameObject in the world
vector< SFSpriteComponent* > mComponents;
sf::View view;
sf::Sprite m_startScreen;
sf::Sprite m_lostScreen;
sf::Sprite m_winnerScreen;
sf::Vector2f m_lastCatPos;
};
| [
"kaygrum@hotmail.com"
] | kaygrum@hotmail.com |
e513c6a11323dc519cf68c11f2dfd1e841d889e2 | e75fcddd8bbc2d233642c89680fcaa6d9f61db1c | /encryptingmessage.cpp | b9e213ed8d36fc6dff3c1a303b73d2d2a8cdea5c | [] | no_license | Amogh-Koushik/MyNewCyPher | a92367ef3959c3ef8548931e2efc089e371eb0d1 | f5f3eeac878bc49bd886aad106237521db653547 | refs/heads/master | 2022-09-23T10:23:01.575991 | 2020-06-06T19:14:24 | 2020-06-06T19:14:24 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 879 | cpp | #include <iostream>
#include <vector>
#include <string>
using std::cin;
using std::cout;
using std::endl;
using std::vector;
using std::string;
int main() {
cout << "Enter your secret message" << endl;
string user_typo;
getline(cin , user_typo);
string alphabets {" 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"};
string encrypted_alphabets {"qwertyuiopasdfghjklzxcvbn'mLKJHGFDSAPOIUYTREWQMNBVCXZ "};
string final_encryption {};
cout << "Encrypting message................." << endl;
for (auto i: user_typo) {
size_t position = alphabets.find(i);
if ( position == string::npos ){
final_encryption += i;
}
else {
char a { encrypted_alphabets.at(position)};
final_encryption += a;
}
}
cout << final_encryption << endl;
return 0;
} | [
"amoghnkoushik@gmail.com"
] | amoghnkoushik@gmail.com |
6894526293f67ed02114ace2de29fe7ef0e72a07 | 99896c573d0bef0f8189edc5fe287315371c9f08 | /branches/trunk/GUI/spot-on-rosetta.cc | 0652d0b0b5ab0a956663ff6f6b92531a2c6cb2d7 | [
"BSD-3-Clause",
"BSD-2-Clause"
] | permissive | textbrowser/spot-on | 97455c2010bb073c5f45a4ef7cb3685cae9be98f | d1da17de598233f81df66870268966923fd6bbd2 | refs/heads/master | 2023-08-17T08:20:48.149551 | 2023-08-13T19:07:31 | 2023-08-13T19:07:31 | 31,208,500 | 74 | 15 | null | 2017-12-28T20:12:24 | 2015-02-23T13:10:58 | C++ | UTF-8 | C++ | false | false | 58,563 | cc | /*
** Copyright (c) 2011 - 10^10^10, Alexis Megas.
** All rights reserved.
**
** Redistribution and use in source and binary forms, with or without
** modification, are permitted provided that the following conditions
** are met:
** 1. Redistributions of source code must retain the above copyright
** notice, this list of conditions and the following disclaimer.
** 2. Redistributions in binary form must reproduce the above copyright
** notice, this list of conditions and the following disclaimer in the
** documentation and/or other materials provided with the distribution.
** 3. The name of the author may not be used to endorse or promote products
** derived from Spot-On without specific prior written permission.
**
** SPOT-ON IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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
** SPOT-ON, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <QClipboard>
#include <QDir>
#include <QKeyEvent>
#include <QInputDialog>
#include <QMessageBox>
#include <QSettings>
#include <QSqlQuery>
#include <QStandardPaths>
#include "Common/spot-on-common.h"
#include "Common/spot-on-crypt.h"
#include "Common/spot-on-misc.h"
#include "spot-on-defines.h"
#include "spot-on-rosetta-gpg-import.h"
#include "spot-on-rosetta.h"
#if defined(Q_OS_MACOS) || defined(SPOTON_GPGME_ENABLED)
#include "spot-on-utilities.h"
#endif
#include "spot-on.h"
#ifdef SPOTON_GPGME_ENABLED
QPointer<spoton_rosetta> spoton_rosetta::s_rosetta = 0;
#endif
spoton_rosetta::spoton_rosetta(void):QMainWindow()
{
ui.setupUi(this);
setWindowTitle(tr("%1: Rosetta").arg(SPOTON_APPLICATION_NAME));
#ifndef SPOTON_GPGME_ENABLED
ui.action_Import_GPG_Keys->setEnabled(false);
ui.action_Import_GPG_Keys->setToolTip
(tr("The GnuPG Made Easy library is not available."));
ui.action_Remove_GPG_Keys->setEnabled(false);
ui.action_Remove_GPG_Keys->setToolTip(ui.action_Import_GPG_Keys->toolTip());
ui.gpg_email_addresses->addItem("Empty"); // Please do not translate Empty.
ui.gpg_email_addresses->setEnabled(false);
ui.gpg_email_addresses->setToolTip
(tr("The GnuPG Made Easy library is not available."));
#endif
ui.copy->setMenu(new QMenu(this));
#ifdef SPOTON_GPGME_ENABLED
s_rosetta = this;
ui.copy->menu()->addAction(tr("Copy My &GPG Public Keys"),
this,
SLOT(slotCopyMyGPGKeys(void)));
#else
QAction *action = ui.copy->menu()->addAction
(tr("Copy My &GPG Public Keys"));
action->setEnabled(false);
action->setToolTip(ui.action_Import_GPG_Keys->toolTip());
#endif
ui.copy->menu()->addAction(tr("Copy My &Rosetta Public Keys"),
this,
SLOT(slotCopyMyRosettaPublicKeys(void)));
ui.dump->setVisible(false);
ui.from->setText(tr("Empty"));
ui.inputDecrypt->setLineWrapColumnOrWidth(80);
ui.inputDecrypt->setLineWrapMode(QTextEdit::FixedColumnWidth);
ui.inputDecrypt->setWordWrapMode(QTextOption::WrapAnywhere);
ui.name->setMaxLength(spoton_common::NAME_MAXIMUM_LENGTH);
ui.newContact->setLineWrapColumnOrWidth(80);
ui.newContact->setLineWrapMode(QTextEdit::FixedColumnWidth);
ui.newContact->setWordWrapMode(QTextOption::WrapAnywhere);
ui.outputEncrypt->setLineWrapColumnOrWidth(80);
ui.outputEncrypt->setLineWrapMode(QTextEdit::FixedColumnWidth);
ui.outputEncrypt->setWordWrapMode(QTextOption::WrapAnywhere);
connect(ui.action_Clear_Clipboard_Buffer,
SIGNAL(triggered(void)),
this,
SLOT(slotClearClipboardBuffer(void)));
connect(ui.action_Close,
SIGNAL(triggered(void)),
this,
SLOT(slotClose(void)));
connect(ui.action_Copy,
SIGNAL(triggered(void)),
this,
SLOT(slotCopyOrPaste(void)));
connect(ui.action_Import_GPG_Keys,
SIGNAL(triggered(void)),
this,
SLOT(slotImportGPGKeys(void)));
connect(ui.action_Paste,
SIGNAL(triggered(void)),
this,
SLOT(slotCopyOrPaste(void)));
connect(ui.action_Remove_GPG_Keys,
SIGNAL(triggered(void)),
this,
SLOT(slotRemoveGPGKeys(void)));
connect(ui.add,
SIGNAL(clicked(void)),
this,
SLOT(slotAddContact(void)));
connect(ui.clearContact,
SIGNAL(clicked(void)),
this,
SLOT(slotClear(void)));
connect(ui.clearInput,
SIGNAL(clicked(void)),
this,
SLOT(slotClear(void)));
connect(ui.clearOutput,
SIGNAL(clicked(void)),
this,
SLOT(slotClear(void)));
connect(ui.contacts,
SIGNAL(currentIndexChanged(int)),
this,
SLOT(slotContactsChanged(int)));
connect(ui.convertDecrypt,
SIGNAL(clicked(void)),
this,
SLOT(slotConvertDecrypt(void)));
connect(ui.convertEncrypt,
SIGNAL(clicked(void)),
this,
SLOT(slotConvertEncrypt(void)));
connect(ui.copy,
SIGNAL(clicked(void)),
ui.copy,
SLOT(showMenu(void)));
connect(ui.copyDecrypt,
SIGNAL(clicked(void)),
this,
SLOT(slotCopyDecrypted(void)));
connect(ui.copyEncrypt,
SIGNAL(clicked(void)),
this,
SLOT(slotCopyEncrypted(void)));
connect(ui.decryptClear,
SIGNAL(clicked(void)),
this,
SLOT(slotDecryptClear(void)));
connect(ui.decryptPaste,
SIGNAL(clicked(void)),
ui.inputDecrypt,
SLOT(clear(void)));
connect(ui.decryptPaste,
SIGNAL(clicked(void)),
ui.inputDecrypt,
SLOT(paste(void)));
connect(ui.decryptReset,
SIGNAL(clicked(void)),
this,
SLOT(slotDecryptReset(void)));
connect(ui.decryptSplitter,
SIGNAL(splitterMoved(int, int)),
this,
SLOT(slotSplitterMoved(int, int)));
connect(ui.deleteContact,
SIGNAL(clicked(void)),
this,
SLOT(slotDelete(void)));
connect(ui.encryptPaste,
SIGNAL(clicked(void)),
ui.inputEncrypt,
SLOT(clear(void)));
connect(ui.encryptPaste,
SIGNAL(clicked(void)),
ui.inputEncrypt,
SLOT(paste(void)));
connect(ui.encryptSplitter,
SIGNAL(splitterMoved(int, int)),
this,
SLOT(slotSplitterMoved(int, int)));
connect(ui.mainHorizontalSplitter,
SIGNAL(splitterMoved(int, int)),
this,
SLOT(slotSplitterMoved(int, int)));
connect(ui.name,
SIGNAL(returnPressed(void)),
this,
SLOT(slotSaveName(void)));
connect(ui.rename,
SIGNAL(clicked(void)),
this,
SLOT(slotRename(void)));
connect(ui.save,
SIGNAL(clicked(void)),
this,
SLOT(slotSaveName(void)));
slotSetIcons();
ui.cipher->addItems(spoton_crypt::cipherTypes());
ui.hash->addItems(spoton_crypt::hashTypes());
QFont font(ui.newContact->font());
font.setStyleHint(QFont::Monospace);
ui.newContact->setFont(font);
/*
** Please do not translate n/a.
*/
if(ui.cipher->count() == 0)
ui.cipher->addItem("n/a");
if(ui.hash->count() == 0)
ui.hash->addItem("n/a");
populateContacts();
QList<QSplitter *> splitters;
QSettings settings;
QStringList keys;
keys << "gui/rosettaDecryptSplitter"
<< "gui/rosettaEncryptSplitter"
<< "gui/rosettaMainHorizontalSplitter";
splitters << ui.decryptSplitter
<< ui.encryptSplitter
<< ui.mainHorizontalSplitter;
for(int i = 0; i < keys.size(); i++)
if(settings.contains(keys.at(i)))
splitters.at(i)->restoreState(settings.value(keys.at(i)).toByteArray());
slotDecryptClear();
#if defined(OS_MACOS)
foreach(QToolButton *toolButton, findChildren<QToolButton *> ())
#if (QT_VERSION < QT_VERSION_CHECK(5, 10, 0))
toolButton->setStyleSheet
("QToolButton {border: none; padding-right: 10px;}"
"QToolButton::menu-button {border: none;}");
#else
toolButton->setStyleSheet
("QToolButton {border: none; padding-right: 15px;}"
"QToolButton::menu-button {border: none; width: 15px;}");
#endif
#endif
#ifdef Q_OS_MACOS
spoton_utilities::enableTabDocumentMode(this);
#endif
}
QByteArray spoton_rosetta::copyMyRosettaPublicKey(void) const
{
spoton_crypt *eCrypt = m_parent ? m_parent->crypts().value("rosetta", 0) : 0;
spoton_crypt *sCrypt = m_parent ? m_parent->crypts().
value("rosetta-signature", 0) : 0;
if(!eCrypt || !sCrypt)
return QByteArray();
QApplication::setOverrideCursor(QCursor(Qt::WaitCursor));
QByteArray name;
QByteArray mPublicKey;
QByteArray mSignature;
QByteArray sPublicKey;
QByteArray sSignature;
QSettings settings;
bool ok = true;
name = settings.value("gui/rosettaName", "unknown").toByteArray();
mPublicKey = eCrypt->publicKey(&ok);
if(ok)
mSignature = eCrypt->digitalSignature(mPublicKey, &ok);
if(ok)
sPublicKey = sCrypt->publicKey(&ok);
if(ok)
sSignature = sCrypt->digitalSignature(sPublicKey, &ok);
if(ok)
{
QByteArray data("K" +
QByteArray("rosetta").toBase64() +
"@" +
name.toBase64() +
"@" +
qCompress(mPublicKey).toBase64() +
"@" +
mSignature.toBase64() +
"@" +
sPublicKey.toBase64() +
"@" +
sSignature.toBase64());
data = spoton_misc::wrap(data);
QApplication::restoreOverrideCursor();
return data;
}
else
{
QApplication::restoreOverrideCursor();
return QByteArray();
}
}
QByteArray spoton_rosetta::gpgEncrypt(const QByteArray &receiver,
const QByteArray &sender) const
{
#ifdef SPOTON_GPGME_ENABLED
Q_UNUSED(sender);
gpgme_check_version(0);
QByteArray output;
gpgme_ctx_t ctx = 0;
gpgme_error_t err = gpgme_new(&ctx);
if(err == GPG_ERR_NO_ERROR)
{
gpgme_data_t ciphertext = 0;
gpgme_data_t plaintext = 0;
gpgme_set_armor(ctx, 1);
err = gpgme_data_new(&ciphertext);
if(err == GPG_ERR_NO_ERROR)
{
QByteArray data(ui.inputEncrypt->toPlainText().toUtf8());
err = gpgme_data_new_from_mem
(&plaintext,
data.constData(),
static_cast<size_t> (data.length()),
1);
}
if(err == GPG_ERR_NO_ERROR)
{
gpgme_data_t keydata = 0;
gpgme_key_t keys[] = {0, 0};
err = gpgme_data_new_from_mem
// 1 = A private copy.
(&keydata,
receiver.constData(),
static_cast<size_t> (receiver.length()),
1);
if(err == GPG_ERR_NO_ERROR)
err = gpgme_op_keylist_from_data_start(ctx, keydata, 0);
if(err == GPG_ERR_NO_ERROR)
err = gpgme_op_keylist_next(ctx, &keys[0]);
if(err == GPG_ERR_NO_ERROR)
{
if(ui.sign->isChecked())
{
err = gpgme_set_pinentry_mode
(ctx, GPGME_PINENTRY_MODE_LOOPBACK);
if(err == GPG_ERR_NO_ERROR)
{
gpgme_set_passphrase_cb(ctx, &gpgPassphrase, 0);
err = gpgme_op_encrypt_sign
(ctx,
keys,
GPGME_ENCRYPT_ALWAYS_TRUST,
plaintext,
ciphertext);
}
}
else
{
gpgme_set_passphrase_cb(ctx, 0, 0);
err = gpgme_op_encrypt
(ctx,
keys,
GPGME_ENCRYPT_ALWAYS_TRUST,
plaintext,
ciphertext);
}
}
gpgme_data_release(keydata);
gpgme_key_unref(keys[0]);
}
if(err == GPG_ERR_NO_ERROR)
{
QByteArray bytes(1024, 0);
ssize_t rc = 0;
gpgme_data_seek(ciphertext, 0, SEEK_SET);
while
((rc = gpgme_data_read(ciphertext,
bytes.data(),
static_cast<size_t> (bytes.length()))) > 0)
output.append(bytes.mid(0, static_cast<int> (rc)));
}
gpgme_data_release(ciphertext);
gpgme_data_release(plaintext);
}
gpgme_release(ctx);
if(err != GPG_ERR_NO_ERROR)
{
spoton_misc::logError
(QString("spoton_rosetta::gpgEncrypt(): error (%1) raised.").
arg(gpgme_strerror(err)));
ui.outputEncrypt->setText
(tr("spoton_rosetta::gpgEncrypt(): error (%1) raised.").
arg(gpgme_strerror(err)));
}
return output;
#else
Q_UNUSED(receiver);
Q_UNUSED(sender);
return QByteArray();
#endif
}
QMap<QString, QByteArray> spoton_rosetta::gpgEmailAddresses(void) const
{
QMap<QString, QByteArray> map;
spoton_crypt *crypt = m_parent ? m_parent->crypts().value("rosetta", 0) : 0;
if(!crypt)
return map;
QString connectionName("");
{
QSqlDatabase db = spoton_misc::database(connectionName);
db.setDatabaseName
(spoton_misc::homePath() + QDir::separator() + "idiotes.db");
if(db.open())
{
QSqlQuery query(db);
query.setForwardOnly(true);
if(query.exec("SELECT public_keys FROM gpg"))
while(query.next())
{
QByteArray publicKey
(QByteArray::fromBase64(query.value(0).toByteArray()));
QString email("");
bool ok = true;
publicKey = crypt->decryptedAfterAuthenticated(publicKey, &ok);
if(!(email =
spoton_rosetta_gpg_import::email(publicKey)).isEmpty())
map[email] = publicKey;
spoton_crypt::memzero(publicKey);
}
}
db.close();
}
QSqlDatabase::removeDatabase(connectionName);
return map;
}
#ifdef SPOTON_GPGME_ENABLED
gpgme_error_t spoton_rosetta::gpgPassphrase(void *hook,
const char *uid_hint,
const char *passphrase_info,
int prev_was_bad,
int fd)
{
Q_UNUSED(hook);
Q_UNUSED(passphrase_info);
Q_UNUSED(prev_was_bad);
Q_UNUSED(uid_hint);
QString passphrase("");
bool ok = true;
QApplication::restoreOverrideCursor();
passphrase = QInputDialog::getText
(s_rosetta,
tr("%1: GPG Passphrase").arg(SPOTON_APPLICATION_NAME),
tr("&GPG Passphrase"),
QLineEdit::Password,
"",
&ok);
if(!ok || passphrase.isEmpty())
{
spoton_crypt::memzero(passphrase);
return GPG_ERR_NO_PASSPHRASE;
}
Q_UNUSED
(gpgme_io_writen(fd,
passphrase.toUtf8().constData(),
static_cast<size_t> (passphrase.toUtf8().length())));
Q_UNUSED(gpgme_io_writen(fd, "\n", static_cast<size_t> (1)));
spoton_crypt::memzero(passphrase);
return GPG_ERR_NO_ERROR;
}
#endif
void spoton_rosetta::keyPressEvent(QKeyEvent *event)
{
QMainWindow::keyPressEvent(event);
}
void spoton_rosetta::populateContacts(void)
{
QApplication::setOverrideCursor(QCursor(Qt::WaitCursor));
QString connectionName("");
{
QSqlDatabase db = spoton_misc::database(connectionName);
db.setDatabaseName
(spoton_misc::homePath() + QDir::separator() + "friends_public_keys.db");
if(db.open())
{
QMultiMap<QString, QPair<DestinationTypes, QByteArray> > names;
QSqlQuery query(db);
bool ok = true;
spoton_crypt *eCrypt = m_parent ?
m_parent->crypts().value("rosetta", 0) : 0;
ui.contacts->clear();
query.setForwardOnly(true);
query.prepare("SELECT name, public_key_hash FROM friends_public_keys "
"WHERE key_type_hash = ?");
if(eCrypt)
query.addBindValue
(eCrypt->keyedHash(QByteArray("rosetta"), &ok).toBase64());
if(ok && query.exec())
while(query.next())
{
QByteArray name;
bool ok = true;
if(eCrypt)
name = eCrypt->decryptedAfterAuthenticated
(QByteArray::fromBase64(query.value(0).toByteArray()), &ok);
else
ok = false;
if(ok)
{
QPair<DestinationTypes, QByteArray> pair
(ROSETTA, query.value(1).toByteArray());
names.insert(name, pair);
}
}
query.prepare("SELECT email, public_keys_hash FROM gpg");
if(query.exec())
while(query.next())
{
QByteArray name;
bool ok = true;
if(eCrypt)
name = eCrypt->decryptedAfterAuthenticated
(QByteArray::fromBase64(query.value(0).toByteArray()), &ok);
else
ok = false;
if(ok)
{
QPair<DestinationTypes, QByteArray> pair
(GPG, query.value(1).toByteArray());
names.insert(name, pair);
}
}
#if (QT_VERSION >= QT_VERSION_CHECK(6, 0, 0))
QMultiMapIterator<QString, QPair<DestinationTypes, QByteArray> >
it(names);
#else
QMapIterator<QString, QPair<DestinationTypes, QByteArray> > it(names);
#endif
while(it.hasNext())
{
it.next();
QString str(it.key().trimmed());
if(str.isEmpty())
ui.contacts->addItem("unknown", it.value().second);
else
ui.contacts->addItem(str, it.value().second);
/*
** Record destination type.
*/
ui.contacts->setItemData
(ui.contacts->count() - 1,
it.value().first,
Qt::ItemDataRole(Qt::UserRole + 1));
}
}
db.close();
}
QSqlDatabase::removeDatabase(connectionName);
if(ui.contacts->count() == 0)
{
ui.contacts->addItem("Empty"); // Please do not translate Empty.
ui.contacts->setItemData(0, ZZZ, Qt::ItemDataRole(Qt::UserRole + 1));
}
populateGPGEmailAddresses();
QApplication::restoreOverrideCursor();
slotContactsChanged(0);
}
void spoton_rosetta::populateGPGEmailAddresses(void)
{
ui.gpg_email_addresses->clear();
QMapIterator<QString, QByteArray> it(gpgEmailAddresses());
while(it.hasNext())
{
it.next();
ui.gpg_email_addresses->addItem(it.key(), it.value());
}
if(ui.gpg_email_addresses->count() > 0)
ui.gpg_email_addresses->setCurrentIndex(0);
else
ui.gpg_email_addresses->addItem("Empty"); // Please do not translate Empty.
}
void spoton_rosetta::resizeEvent(QResizeEvent *event)
{
if(!isFullScreen())
{
QSettings settings;
settings.setValue("gui/rosettaGeometry", saveGeometry());
}
QWidget::resizeEvent(event);
}
void spoton_rosetta::setName(const QString &text)
{
ui.name->setText(text);
ui.name->setCursorPosition(0);
slotSaveName();
}
void spoton_rosetta::show(spoton *parent)
{
QSettings settings;
if(!isVisible())
if(settings.contains("gui/rosettaGeometry"))
restoreGeometry(settings.value("gui/rosettaGeometry").toByteArray());
m_parent = parent;
if(m_parent)
{
QPoint p(m_parent->pos());
int X = 0;
int Y = 0;
if(m_parent->width() >= width())
X = p.x() + (m_parent->width() - width()) / 2;
else
X = p.x() - (width() - m_parent->width()) / 2;
if(m_parent->height() >= height())
Y = p.y() + (m_parent->height() - height()) / 2;
else
Y = p.y() - (height() - m_parent->height()) / 2;
move(X, Y);
}
showNormal();
activateWindow();
raise();
ui.name->setText
(QString::fromUtf8(settings.value("gui/rosettaName", "unknown").
toByteArray().constData(),
settings.value("gui/rosettaName", "unknown").
toByteArray().length()).trimmed());
ui.name->setCursorPosition(0);
populateContacts();
}
void spoton_rosetta::slotAddContact(void)
{
spoton_crypt *eCrypt = m_parent ? m_parent->crypts().value("rosetta", 0) : 0;
if(!eCrypt)
{
QMessageBox::critical(this, tr("%1: Error").
arg(SPOTON_APPLICATION_NAME),
tr("Invalid spoton_crypt object. This is "
"a fatal flaw."));
QApplication::processEvents();
return;
}
#ifdef SPOTON_GPGME_ENABLED
{
QByteArray key(ui.newContact->toPlainText().trimmed().toUtf8());
if(key.endsWith("-----END PGP PUBLIC KEY BLOCK-----") &&
key.startsWith("-----BEGIN PGP PUBLIC KEY BLOCK-----"))
{
QByteArray fingerprint1(spoton_crypt::fingerprint(key));
QByteArray fingerprint2
(spoton_crypt::fingerprint(spoton_crypt::publicGPG(eCrypt)));
if(fingerprint1 == fingerprint2 &&
!fingerprint1.isEmpty() &&
!fingerprint2.isEmpty())
{
QMessageBox::critical
(this,
tr("%1: Error").arg(SPOTON_APPLICATION_NAME),
tr("Please do not add personal GPG keys."));
QApplication::processEvents();
return;
}
gpgme_check_version(0);
gpgme_ctx_t ctx = 0;
gpgme_error_t err = gpgme_new(&ctx);
if(err == GPG_ERR_NO_ERROR)
{
gpgme_data_t keydata = 0;
err = gpgme_data_new_from_mem
// 1 = A private copy.
(&keydata,
key.constData(),
static_cast<size_t> (key.length()),
1);
if(err == GPG_ERR_NO_ERROR)
err = gpgme_op_import(ctx, keydata);
gpgme_data_release(keydata);
}
gpgme_release(ctx);
if(err != GPG_ERR_NO_ERROR)
{
QMessageBox::critical
(this,
tr("%1: Error").arg(SPOTON_APPLICATION_NAME),
tr("GPGME error. Cannot add the key block to the keyring."));
QApplication::processEvents();
return;
}
QString connectionName("");
QString error("");
{
QSqlDatabase db = spoton_misc::database(connectionName);
db.setDatabaseName(spoton_misc::homePath() +
QDir::separator() +
"friends_public_keys.db");
if(db.open())
{
QByteArray fingerprint(spoton_crypt::fingerprint(key));
QSqlQuery query(db);
bool ok = true;
/*
** GPG public keys are not encrypted in the keyring.
*/
query.exec("CREATE TABLE IF NOT EXISTS gpg ("
"email TEXT NOT NULL, "
"public_keys TEXT NOT NULL, "
"public_keys_hash TEXT NOT NULL PRIMARY KEY)");
if(fingerprint.isEmpty())
{
error = tr("GPGME error.");
ok = false;
}
query.prepare("INSERT OR REPLACE INTO gpg "
"(email, public_keys, public_keys_hash) "
"VALUES (?, ?, ?)");
if(ok)
query.addBindValue
(eCrypt->encryptedThenHashed(spoton_rosetta_gpg_import::
email(key).toUtf8(), &ok).
toBase64());
if(ok)
query.addBindValue
(eCrypt->encryptedThenHashed(key, &ok).toBase64());
if(ok)
query.addBindValue
(eCrypt->keyedHash(fingerprint, &ok).toBase64());
if(ok)
{
if(!query.exec())
error = tr("A database error occurred.");
}
else if(error.isEmpty())
error = tr("A cryptographic error occurred.");
}
else
error = tr("Unable to access the database friends_public_keys.db.");
db.close();
}
QSqlDatabase::removeDatabase(connectionName);
if(!error.isEmpty())
{
QMessageBox::critical
(this, tr("%1: Error").arg(SPOTON_APPLICATION_NAME), error);
QApplication::processEvents();
}
else
{
populateContacts();
ui.newContact->selectAll();
}
return;
}
}
#endif
spoton_crypt *sCrypt = m_parent ? m_parent->crypts().
value("rosetta-signature", 0) : 0;
if(!sCrypt)
{
QMessageBox::critical(this, tr("%1: Error").
arg(SPOTON_APPLICATION_NAME),
tr("Invalid spoton_crypt object. This is "
"a fatal flaw."));
QApplication::processEvents();
return;
}
QByteArray key
(ui.newContact->toPlainText().remove("\n").remove("\r\n").toLatin1());
if(key.isEmpty())
{
QMessageBox::critical(this, tr("%1: Error").arg(SPOTON_APPLICATION_NAME),
tr("Empty key(s). Really?"));
QApplication::processEvents();
return;
}
if(!(key.startsWith("K") || key.startsWith("k")))
{
QMessageBox::critical
(this, tr("%1: Error").
arg(SPOTON_APPLICATION_NAME),
tr("Invalid key(s). The provided text "
"must start with either the letter K or the letter k."));
QApplication::processEvents();
return;
}
QList<QByteArray> list(key.mid(1).split('@'));
if(list.size() != 6)
{
QMessageBox::critical
(this, tr("%1: Error").
arg(SPOTON_APPLICATION_NAME),
tr("Irregular data. Expecting 6 entries, received %1.").
arg(list.size()));
QApplication::processEvents();
return;
}
QByteArray keyType(list.value(0));
keyType = QByteArray::fromBase64(keyType);
if(keyType != "rosetta")
{
QMessageBox::critical
(this, tr("%1: Error").
arg(SPOTON_APPLICATION_NAME),
tr("Invalid key type. Expecting 'rosetta'."));
QApplication::processEvents();
return;
}
QByteArray mPublicKey(list.value(2));
QByteArray mSignature(list.value(3));
QByteArray myPublicKey;
QByteArray mySPublicKey;
bool ok = true;
mPublicKey = qUncompress(QByteArray::fromBase64(mPublicKey));
myPublicKey = eCrypt->publicKey(&ok);
if(!ok)
{
QMessageBox mb(this);
mb.setIcon(QMessageBox::Question);
mb.setStandardButtons(QMessageBox::No | QMessageBox::Yes);
mb.setText(tr("Unable to retrieve your %1 "
"public key for comparison. Continue?").
arg(keyType.constData()));
mb.setWindowIcon(windowIcon());
mb.setWindowModality(Qt::ApplicationModal);
mb.setWindowTitle(tr("%1: Confirmation").
arg(SPOTON_APPLICATION_NAME));
if(mb.exec() != QMessageBox::Yes)
{
QApplication::processEvents();
return;
}
QApplication::processEvents();
}
mySPublicKey = sCrypt->publicKey(&ok);
if(!ok)
{
QMessageBox mb(this);
mb.setIcon(QMessageBox::Question);
mb.setStandardButtons(QMessageBox::No | QMessageBox::Yes);
mb.setText(tr("Unable to retrieve your %1 signature "
"public key for comparison. Continue?").
arg(keyType.constData()));
mb.setWindowIcon(windowIcon());
mb.setWindowModality(Qt::ApplicationModal);
mb.setWindowTitle(tr("%1: Confirmation").
arg(SPOTON_APPLICATION_NAME));
if(mb.exec() != QMessageBox::Yes)
{
QApplication::processEvents();
return;
}
QApplication::processEvents();
}
QByteArray sPublicKey(list.value(4));
QByteArray sSignature(list.value(5));
sPublicKey = QByteArray::fromBase64(sPublicKey);
sSignature = QByteArray::fromBase64(sSignature);
if((mPublicKey == myPublicKey && !myPublicKey.isEmpty()) ||
(sPublicKey == mySPublicKey && !mySPublicKey.isEmpty()))
{
QMessageBox::critical
(this, tr("%1: Error").
arg(SPOTON_APPLICATION_NAME),
tr("You're attempting to add your own '%1' keys. "
"Please do not do this!").arg(keyType.constData()));
QApplication::processEvents();
return;
}
mSignature = QByteArray::fromBase64(mSignature);
QString algorithm(spoton_crypt::publicKeyAlgorithm(mPublicKey).toLower());
if(!(algorithm.startsWith("mceliece") || algorithm.startsWith("ntru")))
if(!spoton_crypt::isValidSignature(mPublicKey, mPublicKey, mSignature))
{
QMessageBox::critical
(this, tr("%1: Error").
arg(SPOTON_APPLICATION_NAME),
tr("Invalid 'rosetta' public key signature."));
QApplication::processEvents();
return;
}
if(!spoton_crypt::isValidSignature(sPublicKey, sPublicKey, sSignature))
{
QMessageBox::critical
(this, tr("%1: Error").
arg(SPOTON_APPLICATION_NAME),
tr("Invalid signature public key signature."));
QApplication::processEvents();
return;
}
QString connectionName("");
{
QSqlDatabase db = spoton_misc::database(connectionName);
db.setDatabaseName
(spoton_misc::homePath() + QDir::separator() + "friends_public_keys.db");
if(db.open())
{
QByteArray name(QByteArray::fromBase64(list.value(1)));
if((ok = spoton_misc::saveFriendshipBundle(keyType,
name,
mPublicKey,
sPublicKey,
-1,
db,
eCrypt)))
if((ok = spoton_misc::saveFriendshipBundle(keyType + "-signature",
name,
sPublicKey,
QByteArray(),
-1,
db,
eCrypt)))
ui.newContact->selectAll();
}
else
ok = false;
db.close();
}
QSqlDatabase::removeDatabase(connectionName);
if(!ok)
{
QMessageBox::critical
(this, tr("%1: Error").
arg(SPOTON_APPLICATION_NAME),
tr("An error occurred while attempting to save the "
"friendship bundle."));
QApplication::processEvents();
}
else
{
emit participantAdded("rosetta");
populateContacts();
}
}
void spoton_rosetta::slotClear(void)
{
if(sender() == ui.clearContact)
ui.newContact->clear();
else if(sender() == ui.clearInput)
{
if(!ui.inputEncrypt->toPlainText().trimmed().isEmpty())
{
QMessageBox mb(this);
mb.setIcon(QMessageBox::Question);
mb.setStandardButtons(QMessageBox::No | QMessageBox::Yes);
mb.setText
(tr("Are you sure that you wish to clear the text?"));
mb.setWindowIcon(windowIcon());
mb.setWindowModality(Qt::ApplicationModal);
mb.setWindowTitle
(tr("%1: Confirmation").arg(SPOTON_APPLICATION_NAME));
if(mb.exec() != QMessageBox::Yes)
{
QApplication::processEvents();
return;
}
}
ui.cipher->setCurrentIndex(0);
ui.desktop->setChecked(false);
ui.gpg_email_addresses->setCurrentIndex(0);
ui.hash->setCurrentIndex(0);
ui.inputEncrypt->clear();
ui.sign->setChecked(true);
}
else if(sender() == ui.clearOutput)
ui.outputEncrypt->clear();
}
void spoton_rosetta::slotClearClipboardBuffer(void)
{
QClipboard *clipboard = QApplication::clipboard();
if(clipboard)
{
QApplication::setOverrideCursor(QCursor(Qt::WaitCursor));
menuBar()->repaint();
repaint();
QApplication::processEvents();
clipboard->clear();
QApplication::restoreOverrideCursor();
}
}
void spoton_rosetta::slotClose(void)
{
#ifdef SPOTON_GPGME_ENABLED
if(m_gpgImport)
m_gpgImport->close();
#endif
close();
}
void spoton_rosetta::slotContactsChanged(int index)
{
if(index < 0)
{
slotClear();
ui.convertEncrypt->setEnabled(false);
ui.deleteContact->setEnabled(false);
ui.dump->setVisible(false);
ui.rename->setEnabled(false);
ui.sign->setChecked(true);
ui.sign->setEnabled(false);
return;
}
DestinationTypes destinationType = DestinationTypes
(ui.contacts->itemData(index, Qt::ItemDataRole(Qt::UserRole + 1)).toInt());
ui.cipher->setCurrentIndex(0);
ui.cipher->setEnabled(destinationType == ROSETTA);
ui.convertEncrypt->setEnabled(destinationType != ZZZ);
ui.deleteContact->setEnabled(destinationType != ZZZ);
if(destinationType == GPG)
{
QByteArray publicKey;
spoton_crypt *eCrypt = m_parent ?
m_parent->crypts().value("rosetta", 0) : 0;
publicKey = spoton_misc::publicKeyFromHash
(QByteArray::fromBase64(ui.contacts->
itemData(ui.contacts->
currentIndex()).toByteArray()),
true,
eCrypt);
ui.dump->setText(spoton_rosetta_gpg_import::dump(publicKey).trimmed());
if(tr("GPG Empty Data") == ui.dump->text() || ui.dump->text().isEmpty())
ui.dump->setVisible(false);
else
ui.dump->setVisible(true);
ui.gpg_email_addresses->setCurrentIndex(0);
#ifdef SPOTON_GPGME_ENABLED
ui.gpg_email_addresses->setEnabled(true);
#endif
}
else
{
ui.dump->setText("");
ui.dump->setVisible(false);
ui.gpg_email_addresses->setCurrentIndex(0);
ui.gpg_email_addresses->setEnabled(false);
}
ui.hash->setCurrentIndex(0);
ui.hash->setEnabled(destinationType == ROSETTA);
ui.rename->setEnabled(destinationType != ZZZ);
ui.sign->setChecked(true);
ui.sign->setEnabled(destinationType != ZZZ);
}
void spoton_rosetta::slotConvertDecrypt(void)
{
#ifdef SPOTON_GPGME_ENABLED
{
QByteArray data(ui.inputDecrypt->toPlainText().trimmed().toUtf8());
const char begin[] = "-----BEGIN PGP MESSAGE-----";
const char end[] = "-----END PGP MESSAGE-----";
int index1 = data.indexOf(begin);
int index2 = data.indexOf(end);
if(index1 >= 0 && index1 < index2)
{
data = data.mid
(index1, index2 - index1 + static_cast<int> (qstrlen(end)));
gpgme_check_version(0);
QColor signatureColor(240, 128, 128); // Light coral!
QString signedMessage(tr("Invalid signature."));
gpgme_ctx_t ctx = 0;
gpgme_error_t err = gpgme_new(&ctx);
if(err == GPG_ERR_NO_ERROR)
{
gpgme_data_t ciphertext = 0;
gpgme_data_t plaintext = 0;
gpgme_set_armor(ctx, 1);
err = gpgme_data_new(&plaintext);
if(err == GPG_ERR_NO_ERROR)
err = gpgme_data_new_from_mem
(&ciphertext,
data.constData(),
static_cast<size_t> (data.length()),
1);
if(err == GPG_ERR_NO_ERROR)
{
err = gpgme_set_pinentry_mode
(ctx, GPGME_PINENTRY_MODE_LOOPBACK);
gpgme_set_passphrase_cb(ctx, &gpgPassphrase, 0);
}
if(err == GPG_ERR_NO_ERROR)
err = gpgme_op_decrypt_verify(ctx, ciphertext, plaintext);
if(err == GPG_ERR_NO_ERROR)
{
ui.outputDecrypt->clear();
QByteArray bytes(1024, 0);
ssize_t rc = 0;
gpgme_data_seek(plaintext, 0, SEEK_SET);
while
((rc =
gpgme_data_read(plaintext,
bytes.data(),
static_cast<size_t> (bytes.length()))) > 0)
ui.outputDecrypt->append
(bytes.mid(0, static_cast<int> (rc)));
ui.outputDecrypt->selectAll();
QTextCursor textCursor = ui.outputDecrypt->textCursor();
textCursor.setPosition(0);
ui.outputDecrypt->setTextCursor(textCursor);
gpgme_verify_result_t result = gpgme_op_verify_result(ctx);
if(result)
{
gpgme_signature_t signature = result->signatures;
if(signature && signature->fpr)
{
gpgme_key_t key = 0;
if(gpgme_get_key(ctx, signature->fpr, &key, 0) ==
GPG_ERR_NO_ERROR)
{
if(key->uids && key->uids->email)
ui.from->setText(key->uids->email);
else
ui.from->setText(tr("Empty"));
}
else
ui.from->setText(tr("Empty"));
gpgme_key_unref(key);
}
else
ui.from->setText(tr("Empty"));
if((signature && (signature->summary &
GPGME_SIGSUM_GREEN)) ||
(signature && !signature->summary))
{
signatureColor = QColor(144, 238, 144);
signedMessage = tr("Message was signed.");
}
}
}
gpgme_data_release(ciphertext);
gpgme_data_release(plaintext);
}
gpgme_release(ctx);
if(err != GPG_ERR_NO_ERROR)
{
ui.from->setText(tr("Empty"));
ui.outputDecrypt->setText
(tr("spoton_rosetta::slotConvertDecrypt(): error (%1) raised.").
arg(gpgme_strerror(err)));
}
ui.signedMessage->setStyleSheet
(QString("QLabel {background: %1;}").arg(signatureColor.name()));
ui.signedMessage->setText(signedMessage);
return;
}
}
#endif
spoton_crypt *eCrypt = m_parent ? m_parent->crypts().
value("rosetta-signature", 0) : 0;
if(!eCrypt)
{
QMessageBox::critical(this, tr("%1: Error").
arg(SPOTON_APPLICATION_NAME),
tr("Invalid spoton_crypt object. This is "
"a fatal flaw."));
QApplication::processEvents();
return;
}
QApplication::setOverrideCursor(QCursor(Qt::WaitCursor));
QByteArray data
(ui.inputDecrypt->toPlainText().remove("\n").remove("\r\n").toLatin1());
QByteArray cipherType;
QByteArray computedHash;
QByteArray encryptionKey;
QByteArray hashKey;
QByteArray hashType;
QByteArray keyInformation;
QByteArray messageCode;
QByteArray name;
QByteArray publicKeyHash;
QByteArray signature;
QColor signatureColor;
QDataStream stream(&keyInformation, QIODevice::ReadOnly);
QList<QByteArray> list;
QScopedPointer<spoton_crypt> crypt;
QString error("");
QString signedMessage("");
bool ok = true;
if(data.isEmpty())
goto done_label;
list = data.split('@');
for(int i = 0; i < list.size(); i++)
list.replace(i, QByteArray::fromBase64(list.at(i)));
data = list.value(1);
keyInformation = eCrypt->publicKeyDecrypt(qUncompress(list.value(0)), &ok);
if(!ok)
{
error = tr("The method spoton_crypt::publicKeyDecrypt() failed.");
goto done_label;
}
messageCode = list.value(2);
if(ok)
{
QDataStream stream(&keyInformation, QIODevice::ReadOnly);
QList<QByteArray> list;
for(int i = 0; i < 4; i++)
{
QByteArray a;
stream >> a;
if(stream.status() != QDataStream::Ok)
{
list.clear();
break;
}
else
list << a;
}
if(list.size() == 4)
{
encryptionKey = list.value(0);
hashKey = list.value(1);
cipherType = list.value(2);
hashType = list.value(3);
}
else
{
error = tr("Stream error.");
goto done_label;
}
}
if(ok)
{
computedHash = spoton_crypt::keyedHash(data, hashKey, hashType, &ok);
if(!ok)
{
error = tr("The method spoton_crypt::keyedHash() failed.");
goto done_label;
}
}
if(ok)
{
if(computedHash.isEmpty() || messageCode.isEmpty() ||
!spoton_crypt::memcmp(computedHash, messageCode))
{
error = tr("The computed hash does not match the provided hash.");
goto done_label;
}
}
crypt.reset(new spoton_crypt(cipherType,
"",
QByteArray(),
encryptionKey,
0,
0,
""));
if(ok)
data = crypt->decrypted(data, &ok);
if(ok)
{
QDataStream stream(&data, QIODevice::ReadOnly);
QList<QByteArray> list;
for(int i = 0; i < 4; i++)
{
QByteArray a;
stream >> a;
if(stream.status() != QDataStream::Ok)
{
list.clear();
break;
}
else
list << a;
}
if(list.size() == 4)
{
publicKeyHash = list.value(0);
name = list.value(1);
data = list.value(2);
signature = list.value(3);
}
else
{
error = tr("Stream error.");
ok = false;
}
}
crypt.reset();
if(ok)
{
if(signature.isEmpty())
{
signatureColor = QColor(240, 128, 128); // Light coral!
signedMessage = tr("Empty signature.");
}
else if(!spoton_misc::isValidSignature(publicKeyHash + name + data,
publicKeyHash,
signature,
eCrypt))
{
signatureColor = QColor(240, 128, 128); // Light coral!
signedMessage = tr
("Invalid signature. Perhaps your contacts are not current.");
}
else
{
signatureColor = QColor(144, 238, 144);
signedMessage = tr("Message was signed.");
}
}
if(!ok)
{
if(error.isEmpty())
error = tr("A serious cryptographic error occurred.");
ui.outputDecrypt->clear();
}
else
{
ui.from->setText(QString::fromUtf8(name.constData(), name.length()));
ui.outputDecrypt->setText
(QString::fromUtf8(data.constData(), data.length()));
QTextCursor textCursor = ui.outputDecrypt->textCursor();
textCursor.setPosition(0);
ui.outputDecrypt->setTextCursor(textCursor);
ui.outputDecrypt->selectAll();
ui.signedMessage->setStyleSheet
(QString("QLabel {background: %1;}").arg(signatureColor.name()));
ui.signedMessage->setText(signedMessage);
}
done_label:
if(!error.isEmpty())
{
QApplication::restoreOverrideCursor();
QMessageBox::critical(this, tr("%1: Error").
arg(SPOTON_APPLICATION_NAME),
error);
QApplication::processEvents();
}
else
QApplication::restoreOverrideCursor();
}
void spoton_rosetta::slotConvertEncrypt(void)
{
spoton_crypt *eCrypt = m_parent ? m_parent->crypts().value("rosetta", 0) : 0;
if(!eCrypt)
{
QMessageBox::critical(this, tr("%1: Error").
arg(SPOTON_APPLICATION_NAME),
tr("Invalid spoton_crypt object. This is "
"a fatal flaw."));
QApplication::processEvents();
return;
}
DestinationTypes destinationType = DestinationTypes
(ui.contacts->itemData(ui.contacts->currentIndex(),
Qt::ItemDataRole(Qt::UserRole + 1)).toInt());
if(destinationType == GPG)
{
QApplication::setOverrideCursor(QCursor(Qt::WaitCursor));
QByteArray publicKeyHash
(QByteArray::fromBase64(ui.contacts->
itemData(ui.contacts->currentIndex()).
toByteArray()));
QByteArray receiver
(spoton_misc::publicKeyFromHash(publicKeyHash, true, eCrypt));
QByteArray sender(ui.gpg_email_addresses->currentData().toByteArray());
ui.outputEncrypt->setText(gpgEncrypt(receiver, sender));
ui.outputEncrypt->selectAll();
toDesktop();
QApplication::restoreOverrideCursor();
return;
}
spoton_crypt *sCrypt = m_parent ? m_parent->crypts().
value("rosetta-signature", 0) : 0;
if(!sCrypt)
{
QMessageBox::critical(this, tr("%1: Error").
arg(SPOTON_APPLICATION_NAME),
tr("Invalid spoton_crypt object. This is "
"a fatal flaw."));
QApplication::processEvents();
return;
}
QApplication::setOverrideCursor(QCursor(Qt::WaitCursor));
QByteArray data(ui.inputEncrypt->toPlainText().toUtf8());
QByteArray encryptionKey;
QByteArray hashKey;
QByteArray keyInformation;
QByteArray messageCode;
QByteArray myPublicKey;
QByteArray myPublicKeyHash;
QByteArray name;
QByteArray publicKey;
QByteArray signature;
QDataStream stream(&keyInformation, QIODevice::WriteOnly);
QScopedPointer<spoton_crypt> crypt;
QSettings settings;
QString error("");
bool ok = true;
size_t encryptionKeyLength = 0;
if(data.isEmpty())
goto done_label;
if(ui.contacts->itemData(ui.contacts->currentIndex()).isNull())
{
error = tr("Invalid item data. This is a serious flaw.");
goto done_label;
}
if(ui.inputEncrypt->toPlainText().isEmpty())
{
error = tr("Please provide an actual message!");
goto done_label;
}
encryptionKeyLength = spoton_crypt::cipherKeyLength
(ui.cipher->currentText().toLatin1());
if(encryptionKeyLength == 0)
{
error = tr("The method spoton_crypt::cipherKeyLength() failed.");
goto done_label;
}
encryptionKey.resize(static_cast<int> (encryptionKeyLength));
encryptionKey = spoton_crypt::veryStrongRandomBytes
(static_cast<size_t> (encryptionKey.length()));
hashKey.resize(spoton_crypt::XYZ_DIGEST_OUTPUT_SIZE_IN_BYTES);
hashKey = spoton_crypt::veryStrongRandomBytes
(static_cast<size_t> (hashKey.length()));
name = settings.value("gui/rosettaName", "unknown").toByteArray();
publicKey = spoton_misc::publicKeyFromHash
(QByteArray::fromBase64(ui.contacts->
itemData(ui.contacts->
currentIndex()).toByteArray()),
false,
eCrypt);
stream << encryptionKey
<< hashKey
<< ui.cipher->currentText().toLatin1()
<< ui.hash->currentText().toLatin1();
if(stream.status() != QDataStream::Ok)
ok = false;
if(ok)
keyInformation = spoton_crypt::publicKeyEncrypt
(keyInformation, qCompress(publicKey), publicKey.mid(0, 25), &ok);
if(!ok)
{
error = tr("The method spoton_crypt::publicKeyEncrypt() failed or "
"an error occurred with the QDataStream object.");
goto done_label;
}
crypt.reset(new spoton_crypt(ui.cipher->currentText(),
ui.hash->currentText(),
QByteArray(),
encryptionKey,
hashKey,
0,
0,
""));
if(ui.sign->isChecked())
{
if(ok)
myPublicKey = eCrypt->publicKey(&ok);
if(ok)
myPublicKeyHash = spoton_crypt::preferredHash(myPublicKey);
if(ok)
signature = sCrypt->digitalSignature
(myPublicKeyHash + name + ui.inputEncrypt->toPlainText().toUtf8(),
&ok);
}
if(ok)
{
QDataStream stream(&data, QIODevice::WriteOnly);
QSettings settings;
stream << myPublicKeyHash
<< name
<< ui.inputEncrypt->toPlainText().toUtf8()
<< signature;
if(stream.status() != QDataStream::Ok)
ok = false;
if(ok)
data = crypt->encrypted(data, &ok);
}
if(ok)
messageCode = crypt->keyedHash(data, &ok);
if(ok)
data = spoton_misc::wrap(qCompress(keyInformation).toBase64() +
"@" +
data.toBase64() +
"@" +
messageCode.toBase64());
crypt.reset();
if(!ok)
if(error.isEmpty())
error = tr("A serious cryptographic error occurred.");
if(ok)
{
ui.outputEncrypt->setText(data);
ui.outputEncrypt->selectAll();
toDesktop();
}
else
ui.outputEncrypt->clear();
done_label:
if(!error.isEmpty())
{
QApplication::restoreOverrideCursor();
QMessageBox::critical(this, tr("%1: Error").
arg(SPOTON_APPLICATION_NAME),
error);
QApplication::processEvents();
}
else
QApplication::restoreOverrideCursor();
}
void spoton_rosetta::slotCopyDecrypted(void)
{
QClipboard *clipboard = QApplication::clipboard();
if(clipboard)
clipboard->setText(ui.outputDecrypt->toPlainText());
}
void spoton_rosetta::slotCopyEncrypted(void)
{
QClipboard *clipboard = QApplication::clipboard();
if(clipboard)
clipboard->setText(ui.outputEncrypt->toPlainText());
}
void spoton_rosetta::slotCopyMyGPGKeys(void)
{
QClipboard *clipboard = QApplication::clipboard();
if(!clipboard)
return;
repaint();
QApplication::processEvents();
spoton_crypt *eCrypt = m_parent ? m_parent->crypts().value("rosetta", 0) : 0;
if(!eCrypt)
return;
QApplication::setOverrideCursor(QCursor(Qt::WaitCursor));
QByteArray bytes;
QString connectionName("");
{
QSqlDatabase db = spoton_misc::database(connectionName);
db.setDatabaseName
(spoton_misc::homePath() + QDir::separator() + "idiotes.db");
if(db.open())
{
QSqlQuery query(db);
query.setForwardOnly(true);
query.prepare("SELECT public_keys FROM gpg");
if(query.exec())
while(query.next())
{
QByteArray publicKey = eCrypt->decryptedAfterAuthenticated
(QByteArray::fromBase64(query.value(0).toByteArray()), 0);
if(!publicKey.isEmpty())
{
bytes.append(publicKey);
bytes.append("\r\n");
}
}
}
db.close();
}
QSqlDatabase::removeDatabase(connectionName);
clipboard->setText(bytes.trimmed());
QApplication::restoreOverrideCursor();
}
void spoton_rosetta::slotCopyMyRosettaPublicKeys(void)
{
QApplication::setOverrideCursor(QCursor(Qt::WaitCursor));
QString text(copyMyRosettaPublicKey());
QApplication::restoreOverrideCursor();
if(text.length() >= spoton_common::MAXIMUM_COPY_KEY_SIZES)
{
QMessageBox::critical
(this, tr("%1: Error").arg(SPOTON_APPLICATION_NAME),
tr("The rosetta public key is too long (%1 bytes).").
arg(QLocale().toString(text.length())));
QApplication::processEvents();
return;
}
QClipboard *clipboard = QApplication::clipboard();
if(clipboard)
{
repaint();
QApplication::processEvents();
QApplication::setOverrideCursor(QCursor(Qt::WaitCursor));
clipboard->setText(text);
QApplication::restoreOverrideCursor();
}
}
void spoton_rosetta::slotCopyOrPaste(void)
{
QAction *action = qobject_cast<QAction *> (sender());
if(!action)
return;
QWidget *widget = QApplication::focusWidget();
if(!widget)
return;
QString a("");
if(action == ui.action_Copy)
a = "copy";
else
a = "paste";
QApplication::setOverrideCursor(QCursor(Qt::WaitCursor));
if(qobject_cast<QLineEdit *> (widget))
{
if(a == "copy")
qobject_cast<QLineEdit *> (widget)->copy();
else
{
qobject_cast<QLineEdit *> (widget)->clear();
qobject_cast<QLineEdit *> (widget)->paste();
}
}
else if(qobject_cast<QTextEdit *> (widget))
{
if(a == "copy")
qobject_cast<QTextEdit *> (widget)->copy();
else
{
qobject_cast<QTextEdit *> (widget)->paste();
qobject_cast<QTextEdit *> (widget)->paste();
}
}
QApplication::restoreOverrideCursor();
}
void spoton_rosetta::slotDecryptClear(void)
{
ui.from->setText(tr("Empty"));
ui.outputDecrypt->clear();
QColor color(240, 128, 128); // Light coral!
ui.signedMessage->setStyleSheet
(QString("QLabel {background: %1;}").arg(color.name()));
ui.signedMessage->setText(tr("Message was not signed."));
}
void spoton_rosetta::slotDecryptReset(void)
{
ui.inputDecrypt->clear();
}
void spoton_rosetta::slotDelete(void)
{
if(ui.contacts->itemData(ui.contacts->currentIndex()).isNull())
{
QMessageBox::critical
(this, tr("%1: Error").
arg(SPOTON_APPLICATION_NAME),
tr("Invalid item data. This is a serious flaw."));
QApplication::processEvents();
return;
}
DestinationTypes destinationType = DestinationTypes
(ui.contacts->itemData(ui.contacts->currentIndex(),
Qt::ItemDataRole(Qt::UserRole + 1)).toInt());
QMessageBox mb(this);
mb.setIcon(QMessageBox::Question);
mb.setStandardButtons(QMessageBox::No | QMessageBox::Yes);
if(destinationType == GPG)
mb.setText
(tr("Are you sure that you wish to remove the selected contact? "
"The contact will also be removed from the GPG keyring."));
else
mb.setText
(tr("Are you sure that you wish to remove the selected contact?"));
mb.setWindowIcon(windowIcon());
mb.setWindowModality(Qt::ApplicationModal);
mb.setWindowTitle(tr("%1: Confirmation").arg(SPOTON_APPLICATION_NAME));
if(mb.exec() != QMessageBox::Yes)
{
QApplication::processEvents();
return;
}
QApplication::processEvents();
QByteArray publicKeyHash
(ui.contacts->itemData(ui.contacts->currentIndex()).toByteArray());
QString connectionName("");
QString oid
(QString::number(spoton_misc::oidFromPublicKeyHash(publicKeyHash)));
bool ok = true;
#ifdef SPOTON_GPGME_ENABLED
if(destinationType == GPG)
{
gpgme_check_version(0);
gpgme_ctx_t ctx = 0;
gpgme_error_t err = gpgme_new(&ctx);
if(err == GPG_ERR_NO_ERROR)
{
QByteArray publicKey;
gpgme_data_t keydata = 0;
gpgme_key_t key = 0;
spoton_crypt *eCrypt = m_parent ?
m_parent->crypts().value("rosetta", 0) : 0;
publicKey = spoton_misc::publicKeyFromHash
(QByteArray::fromBase64(publicKeyHash), true, eCrypt);
err = gpgme_data_new_from_mem
// 1 = A private copy.
(&keydata,
publicKey.constData(),
static_cast<size_t> (publicKey.length()),
1);
if(err == GPG_ERR_NO_ERROR)
err = gpgme_op_keylist_from_data_start(ctx, keydata, 0);
if(err == GPG_ERR_NO_ERROR)
err = gpgme_op_keylist_next(ctx, &key);
if(err == GPG_ERR_NO_ERROR)
gpgme_op_delete_ext(ctx, key, GPGME_DELETE_FORCE);
gpgme_data_release(keydata);
gpgme_key_unref(key);
}
gpgme_release(ctx);
}
#endif
{
QSqlDatabase db = spoton_misc::database(connectionName);
db.setDatabaseName
(spoton_misc::homePath() + QDir::separator() + "friends_public_keys.db");
if(db.open())
{
QSqlQuery query(db);
query.exec("PRAGMA secure_delete = ON");
if(destinationType == GPG)
query.prepare("DELETE FROM gpg WHERE public_keys_hash = ?");
else
query.prepare
("DELETE FROM friends_public_keys WHERE public_key_hash = ?");
query.addBindValue(publicKeyHash);
ok = query.exec();
if(destinationType == ROSETTA)
spoton_misc::purgeSignatureRelationships
(db, m_parent ? m_parent->crypts().value("rosetta", 0) : 0);
}
else
ok = false;
db.close();
}
QSqlDatabase::removeDatabase(connectionName);
if(!ok)
{
QMessageBox::critical
(this, tr("%1: Error").
arg(SPOTON_APPLICATION_NAME),
tr("An error occurred while attempting to delete the specified "
"participant."));
QApplication::processEvents();
}
else
{
emit participantDeleted(oid, "rosetta");
ui.contacts->removeItem(ui.contacts->currentIndex());
if(ui.contacts->count() == 0)
{
ui.contacts->addItem("Empty"); // Please do not translate Empty.
ui.contacts->setItemData(0, ZZZ, Qt::ItemDataRole(Qt::UserRole + 1));
}
else
sortContacts();
slotContactsChanged(0);
}
}
void spoton_rosetta::slotImportGPGKeys(void)
{
#ifdef SPOTON_GPGME_ENABLED
if(!m_gpgImport)
{
m_gpgImport = new spoton_rosetta_gpg_import(this, m_parent);
connect(m_gpgImport,
SIGNAL(gpgKeysImported(void)),
this,
SLOT(slotPopulateGPGEmailAddresses(void)));
connect(m_gpgImport,
SIGNAL(gpgKeysRemoved(void)),
this,
SLOT(slotPopulateGPGEmailAddresses(void)));
connect(this,
SIGNAL(gpgKeysRemoved(void)),
m_gpgImport,
SLOT(slotGPGKeysRemoved(void)));
}
spoton_utilities::centerWidget(m_gpgImport, this);
m_gpgImport->showNormal();
m_gpgImport->activateWindow();
m_gpgImport->raise();
#endif
}
void spoton_rosetta::slotParticipantAdded(const QString &type)
{
if(type == "rosetta")
populateContacts();
}
void spoton_rosetta::slotPopulateGPGEmailAddresses(void)
{
populateGPGEmailAddresses();
}
void spoton_rosetta::slotRemoveGPGKeys(void)
{
QMessageBox mb(this);
mb.setIcon(QMessageBox::Question);
mb.setStandardButtons(QMessageBox::No | QMessageBox::Yes);
mb.setText(tr("Are you sure that you wish to remove your GPG keys? "
"The keys will not be removed from the GPG ring."));
mb.setWindowIcon(windowIcon());
mb.setWindowModality(Qt::ApplicationModal);
mb.setWindowTitle(tr("%1: Confirmation").arg(SPOTON_APPLICATION_NAME));
if(mb.exec() != QMessageBox::Yes)
{
QApplication::processEvents();
return;
}
QApplication::processEvents();
QString connectionName("");
{
QSqlDatabase db = spoton_misc::database(connectionName);
db.setDatabaseName
(spoton_misc::homePath() + QDir::separator() + "idiotes.db");
if(db.open())
{
QSqlQuery query(db);
query.exec("PRAGMA secure_delete = ON");
if(query.exec("DELETE FROM gpg"))
emit gpgKeysRemoved();
}
db.close();
}
populateGPGEmailAddresses();
QSqlDatabase::removeDatabase(connectionName);
}
void spoton_rosetta::slotRename(void)
{
spoton_crypt *eCrypt = m_parent ? m_parent->crypts().value("rosetta", 0) : 0;
if(!eCrypt)
{
QMessageBox::critical(this, tr("%1: Error").
arg(SPOTON_APPLICATION_NAME),
tr("Invalid spoton_crypt object. This is "
"a fatal flaw."));
QApplication::processEvents();
return;
}
else if(ui.contacts->itemData(ui.contacts->currentIndex()).isNull())
{
QMessageBox::critical
(this, tr("%1: Error").
arg(SPOTON_APPLICATION_NAME),
tr("Invalid item data. This is a serious flaw."));
QApplication::processEvents();
return;
}
QString name("");
bool ok = true;
name = QInputDialog::getText
(this, tr("%1: New Name").
arg(SPOTON_APPLICATION_NAME), tr("&Name"),
QLineEdit::Normal, ui.contacts->currentText(), &ok);
name = name.mid(0, spoton_common::NAME_MAXIMUM_LENGTH);
if(name.isEmpty() || !ok)
return;
DestinationTypes destinationType = DestinationTypes
(ui.contacts->itemData(ui.contacts->currentIndex(),
Qt::ItemDataRole(Qt::UserRole + 1)).toInt());
QByteArray publicKeyHash
(ui.contacts->itemData(ui.contacts->currentIndex()).toByteArray());
QString connectionName("");
{
QSqlDatabase db = spoton_misc::database(connectionName);
db.setDatabaseName
(spoton_misc::homePath() + QDir::separator() + "friends_public_keys.db");
if(db.open())
{
QSqlQuery query(db);
if(destinationType == GPG)
query.prepare("UPDATE gpg SET email = ? WHERE public_keys_hash = ?");
else
query.prepare("UPDATE friends_public_keys "
"SET name = ?, "
"name_changed_by_user = 1 "
"WHERE public_key_hash = ?");
query.addBindValue
(eCrypt->encryptedThenHashed(name.toUtf8(), &ok).toBase64());
if(ok)
query.addBindValue(publicKeyHash);
if(ok)
if((ok = query.exec()))
ui.contacts->setItemText(ui.contacts->currentIndex(), name);
}
else
ok = false;
db.close();
}
QSqlDatabase::removeDatabase(connectionName);
if(!ok)
{
QMessageBox::critical
(this, tr("%1: Error").
arg(SPOTON_APPLICATION_NAME),
tr("An error occurred while attempting to rename the specified "
"participant."));
QApplication::processEvents();
}
else
{
emit participantNameChanged(publicKeyHash, name);
sortContacts();
}
}
void spoton_rosetta::slotSaveName(void)
{
QString str(ui.name->text());
if(str.trimmed().isEmpty())
{
str = "unknown";
ui.name->setText(str);
}
else
ui.name->setText(str.trimmed());
ui.name->setCursorPosition(0);
QSettings settings;
settings.setValue("gui/rosettaName", str.toUtf8());
ui.name->selectAll();
}
void spoton_rosetta::slotSetIcons(void)
{
QSettings settings;
QString iconSet(settings.value("gui/iconSet", "nuove").toString().
toLower());
if(!(iconSet == "everaldo" ||
iconSet == "meego" ||
iconSet == "nouve" ||
iconSet == "nuvola"))
iconSet = "nouve";
ui.add->setIcon(QIcon(QString(":/%1/add.png").arg(iconSet)));
ui.clearContact->setIcon(QIcon(QString(":/%1/clear.png").arg(iconSet)));
ui.clearInput->setIcon(QIcon(QString(":/%1/clear.png").arg(iconSet)));
ui.clearOutput->setIcon(QIcon(QString(":/%1/clear.png").arg(iconSet)));
ui.copy->setIcon(QIcon(QString(":/%1/copy.png").arg(iconSet)));
ui.decryptClear->setIcon(QIcon(QString(":/%1/clear.png").arg(iconSet)));
ui.decryptReset->setIcon(QIcon(QString(":/%1/clear.png").arg(iconSet)));
ui.save->setIcon(QIcon(QString(":/%1/ok.png").arg(iconSet)));
}
void spoton_rosetta::slotSplitterMoved(int pos, int index)
{
Q_UNUSED(index);
Q_UNUSED(pos);
QSplitter *splitter = qobject_cast<QSplitter *> (sender());
if(!splitter)
return;
QSettings settings;
QString key("");
if(splitter == ui.decryptSplitter)
key = "gui/rosettaDecryptSplitter";
else if(splitter == ui.encryptSplitter)
key = "gui/rosettaEncryptSplitter";
else
key = "gui/rosettaMainHorizontalSplitter";
settings.setValue(key, splitter->saveState());
}
void spoton_rosetta::sortContacts(void)
{
QApplication::setOverrideCursor(QCursor(Qt::WaitCursor));
QMultiMap<QString, QPair<DestinationTypes, QVariant> > map;
for(int i = 0; i < ui.contacts->count(); i++)
{
QPair<DestinationTypes, QVariant> pair
(DestinationTypes(ui.contacts->
itemData(i, Qt::ItemDataRole(Qt::UserRole + 1)).
toInt()),
ui.contacts->itemData(i));
map.insert(ui.contacts->itemText(i), pair);
}
ui.contacts->clear();
#if (QT_VERSION >= QT_VERSION_CHECK(6, 0, 0))
QMultiMapIterator<QString, QPair<DestinationTypes, QVariant> > it(map);
#else
QMapIterator<QString, QPair<DestinationTypes, QVariant> > it(map);
#endif
while(it.hasNext())
{
it.next();
QString str(it.key().trimmed());
if(str.isEmpty())
ui.contacts->addItem("unknown", it.value().second);
else
ui.contacts->addItem(str, it.value().second);
/*
** Record destination type.
*/
ui.contacts->setItemData
(ui.contacts->count() - 1,
it.value().first,
Qt::ItemDataRole(Qt::UserRole + 1));
}
QApplication::restoreOverrideCursor();
}
void spoton_rosetta::toDesktop(void) const
{
if(!ui.desktop->isChecked())
return;
QFile file;
QString fileName
(QStandardPaths::writableLocation(QStandardPaths::DesktopLocation) +
QDir::separator() +
"spot_on_" +
QString::number(QDateTime::currentMSecsSinceEpoch())+
".asc");
file.setFileName(fileName);
file.open(QIODevice::Truncate | QIODevice::WriteOnly);
file.write(ui.outputEncrypt->toPlainText().toUtf8());
}
| [
"textbrowser@gmail.com"
] | textbrowser@gmail.com |
b49ef5af463339c5d5756f129c145031d8f06e50 | 1872f57c9d68db7e2b38c47580f98a3783e623f3 | /PriceSource120527/ScoredSeq.h | 007be196808ce9cca56873fd9c130ce53bc2cdbc | [
"MIT"
] | permissive | Lijiakuan/sequencing | 60e6d1ba7eb93cd97df36935555c0930dacad425 | 3ff23f6478c99ddc21da7a1fba3cb7642ae9842c | refs/heads/master | 2021-06-12T21:37:26.270625 | 2017-02-28T18:31:43 | 2017-02-28T18:31:43 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 7,284 | h | /*
PRICE was written by Graham Ruby.
This file is part of PRICE.
PRICE is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
PRICE is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with PRICE. If not, see <http://www.gnu.org/licenses/>.
*/
/*
This is the representation for sequences (reads and/or contigs) in PRICE. Abstractly, a ScoredSeq
has three properties: 1) a series of nucleotide identities, 2) a series of confidence scores for
the indicated nucleotide identities, one per nucleotide, and 3) a series of confidence scores for th
adjacency of two nucleotides (essentially a score for the existance of the indicated 3p-5p phosphodiester
bond). Both of these scores are decimal numbers that are supposed to reflect the amount of data
in support of the nucleotide identity/phosphodiester bond, i.e. a nucleotide at a position covered by
5 sequences, with all of the sequences in agreement for that nucleotide's identity, would have a score
of 5. The decimal nature of the score allows quality scores (such as those provided by .fastq files)
to be taken into account. Scores represent the possibility of a nucleotide identity being mis-called.
So in the example above, if another read was added to support the nucleotide identity, but that read had
a 1% scored possibility of being incorrect, the resulting contig's score at that position would become
5.99. Ambiguous nucleotides (N's) have a score of zero by definition. Intermediate ambiguities are not
allowed (i.e. Y for pyrimidines). All nucleotides are represented as upper-case DNA letters (A,T,C,G - U
is not recognized by a ScoredSeq).</li>
SPEC FIELDS:
seq: the sequence in nucleic acids (A,T,C,G, or N)
scoreList: the scores of the nucleotide identities
linkerList: the scores of the phosphodiester bond
*/
#ifndef SCOREDSEQ_H
#define SCOREDSEQ_H
# include <vector>
# include <string>
using std::string;
using std::vector;
class ScoredSeq {
public:
enum Nuc{ BASE=0, A=1, C=2, G=3, T=4, N=5 };
static ScoredSeq* getScoredSeq(char* seq, float score, long size);
static ScoredSeq* getScoredSeq(char* seq, float* scores, long size);
static ScoredSeq* getScoredSeq(char* seq, float* scores, float* links, long size);
static ScoredSeq* copyShallowSeq(ScoredSeq* seq, char sense);
// uses the input values directly as the stored values
static ScoredSeq* repExposedSeq(char* seq, float score, long size);
static ScoredSeq* repExposedSeq(char* seq, float* scores, long size);
static ScoredSeq* repExposedSeq(char* seq, float* scores, float* links, long size);
virtual ~ScoredSeq();
/* returns the nucleotide identity at the indicated position
on the indicated strand. The position is zero-indexed from the
5p end of the sequence; i.e. for the nucleotide at position n
on the '+' strand, its reverse complement would be obtained by
getting the nucleotide at position (lengthOfSeq - n - 1) from the
'-' strand. Remember: numbers always ascend in the 5p->3p direction.
RETURNS: nucleotide identity
REQUIRES: sense is '+' or '-'
THROWS: ??? if position >= length of this
PARAMS: position: zero-indexed, nums ascend 5p->3p
sense: '+' or '-'
*/
virtual char nucAtPosition(long position, char sense) = 0;
// optimized to not have to pass the sense char and not have to ask which sense it is
virtual char nucAtPosPlus(long position) = 0;
virtual char nucAtPosMinus(long position) = 0;
/* returns the score for the nucleotide called at the
indicated position on the indicated strand, numbered 5p->3p
on that strand
RETURNS: nucleotide confidence score
REQUIRES: sense is '+' or '-'
THROWS: ??? if position >= length of this
PARAMS: position: zero-indexed, nums ascend 5p->3p
sense: '+' or '-'
*/
virtual float scoreAtPosition(long position, char sense) = 0;
virtual float scoreAtPosPlus(long position) = 0;
virtual float scoreAtPosMinus(long position) = 0;
virtual float linkAfterPosition(long position, char sense) = 0; // must be <= nucleotide counts
virtual float linkAfterPosPlus(long position) = 0; // must be <= nucleotide counts
virtual float linkAfterPosMinus(long position) = 0; // must be <= nucleotide counts
/* gets the full nucleotide sequence as a string, presented 5p->3p
RETURNS: the nucelotide DNA sequence (composed of A,T,C,G,N)
REQUIRES: sense is '+' or '-'
PARAMS: sense: '+' or '-'
*/
virtual char* getSeq(char sense) = 0;
virtual float* getScores(char sense) = 0;
virtual float* getLinks(char sense) = 0;
virtual char* getSubseq(long position, long length, char sense) = 0;
virtual float* getSubScores(long position, long length, char sense) = 0;
virtual float* getSubLinks(long position, long length, char sense) = 0;
/* has no effects on state; purely an optimization tool that can make
retrieval of the sequence or scores using the above methods more efficient
later in some implementations.
EFFECTS: none
*/
virtual void buffer() = 0;
/* for a multi-nested seq, allows just the bottom level
* to be buffered */
virtual void bottomBuffer() = 0;
/* has no effects on state; purely an optimization tool that can save
memory in some implementations if called after sequence/score info
is accessed.
EFFECTS: none
*/
virtual void unbuffer() = 0;
/* RETURNS: length of the sequence in number of nucleotides */
virtual long size() = 0;
/* Identifies whether or not the sequence has a paired end. Paired-ends
are defined as sequences that derive from the same DNA template as one
another and derive from opposing strands. they may overlap, but the
non-sequencing-primer-derived sequences will always be mutually downstream
of one another (at worst, perfectly overlapping). */
virtual bool hasPairedEnd() = 0;
/* if there is a paired end, it can be provided as a ScoredSeq by this method.
See hasPairedEnd() comments for a description of paired ends.
THROWS: ??? if this does not have a paired-end.
*/
virtual ScoredSeq * getPairedEnd() = 0;
virtual ScoredSeq * getTempPairedEnd() = 0;
/* returns a copy of the ScoredSeq with shallow scope and so can be destroyed without adverse effects */
virtual ScoredSeq * shallowCopy() = 0;
/* returns a copy of the ScoredSeq with shallow scope and also with opposite sense as the original */
virtual ScoredSeq * flipCopy() = 0;
/* for wrapper classes */
virtual bool isNested() = 0;
/* these methods are supported in all cases even if they are only meaningfully different from their
* shallow counterparts (destructor and unbuffer) for nested classes */
virtual void deepDelete() = 0;
virtual void deepUnbuffer() = 0;
static char* reverseComplement(char* seq, long length);
private:
static Nuc _revComp[6];
};
#endif
| [
"github@jakewendt.com"
] | github@jakewendt.com |
050e7210a3fc0fdc13c1ac869a0037f6344102ca | d19d67ce66fdd66379ce028d1205f0a9cf19fc7b | /Pokemon Internal Blades/All Classes.cpp | a5353372663be41c03a66889814a334c2ea46a9c | [] | no_license | Pokemon-Internal-Blades-Crew/Pokemon-Internal-Blades | 23688fcacec26519b433d7ed9408b6dd6559a730 | 8960ddf3610e8d51a36aa9b483484fc0be629969 | refs/heads/master | 2021-01-17T11:49:45.789912 | 2013-03-26T03:34:49 | 2013-03-26T03:34:49 | 8,131,328 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 11,899 | cpp | /// <summary>
/// Kyle Amos
/// Project Internal Blades
/// This is my attempt at a text-based Pokemon syle
/// game. Plans include data for all pokemon, including
/// movesets, base stats, natures, evolution trees, and
/// more!
///
/// </summary>
#include "StdAfx.h"
#include "All Classes.h"
#include <string>
using namespace std;
using namespace pk;
// Constructor.
Pokemon::Pokemon(const string &name, const string classification, const int type1, const int type2, bool owned)
{
m_name = name; // Sets the Pokemon's name to name
m_nickname = name;
m_classification = classification; // Sets the pokemon's classification to classification.
SetRandom(); // Starts Random Generator
m_isFainted = NO; // Automatic is not fainted
m_owned = owned; // Set owned status. True is trainer, false is wild.
m_type1 = type1; // Set first type.
m_type2 = type2; // Set second type. If in real game, this does not exist, type2 is NONE.
SetIVs();
SetEVs();
}
// Sets the Individual values from 1 to 31
void Pokemon::SetIVs(void)
{
m_hpIV = Pokemon::GetRandom(1, 31); // HP Individual Value from 1 to 31
m_attIV = Pokemon::GetRandom(1, 31); // Attack Individual Values (IV) from 1 to 31
m_spAttIV = Pokemon::GetRandom(1, 31); // Special Attack IV from 1 to 31
m_defIV = Pokemon::GetRandom(1, 31); // Defense IV from 1 to 31
m_spDefIV = Pokemon::GetRandom(1, 31); // Special Defense IV from 1 to 31
m_speedIV = Pokemon::GetRandom(1, 31); // Speed IV from 1 to 31
}
// Eventually this should set the EV's to 0, but this is for the sake of testing.
void Pokemon::SetEVs(void)
{
// EV codes
m_hpEV = 0; // HP Effort Values
m_attEV = 0; // Attack Effort Values (EV)
m_spAttEV = 0; // Special Attack Effort Values (EV)
m_defEV = 0; // Defense Effort Values (EV)
m_spDefEV = 0; // Special Defense Effort Values (EV)
m_speedEV = 0; // Speed Effort Values (EV)
}
// Sets Stats. Fairly Self Explanatory.
void Pokemon::SetStats(void)
{
/*
Attack, Defense, Speed, Sp. Attack, Sp. Defense:
(((IV + 2 * BaseStat + (EV/4) ) * Level/100 ) + 5) * Nature Value
*/
m_HP = (int)(((m_hpIV + 2 * m_baseHealth + ((double)m_hpEV / 4)) * ((double)m_level / 100)) + 10 + m_level);
m_Attack = (int)((((m_attIV + 2 * m_baseAttack + ((double)m_attEV / 4)) * ((double)m_level / 100)) + 5) * GetNature().GetAttackMod());
m_SpAttack = (int)((((m_spAttIV + 2 * m_baseSpAttack + ((double)m_spAttEV / 4)) * ((double)m_level / 100)) + 5) * GetNature().GetSpAttackMod());
m_Defense = (int)((((m_defIV + 2 * m_baseDefense + ((double)m_defEV / 4)) * ((double)m_level / 100)) + 5) * GetNature().GetDefenseMod());
m_SpDefense = (int)((((m_spDefIV + 2 * m_baseSpDefense + ((double)m_spDefEV / 4)) * ((double)m_level / 100)) + 5) * GetNature().GetSpDefenseMod());
m_Speed = (int)((((m_speedIV + 2 * m_baseSpeed + ((double)m_speedEV / 4)) * ((double)m_level / 100)) + 5) * GetNature().GetSpeedMod());
}
// Checks the Effectiveness of ownType to targetType and returns a number between 0.0 and 2.0
double Pokemon::CheckTypeEffective(int moveType, int targetType)
{
double effectiveness = 1.0;
switch(moveType)
{
case FIRE:
switch(targetType)
{
case GRASS:
effectiveness *= 2.0;
break;
case ICE:
effectiveness *= 2.0;
break;
case STEEL:
effectiveness *= 2.0;
break;
case BUG:
effectiveness *= 2.0;
break;
case FIRE:
effectiveness *= 0.5;
break;
case WATER:
effectiveness *= 0.5;
break;
case ROCK:
effectiveness *= 0.5;
break;
case DRAGON:
effectiveness *= 0.5;
break;
case SHADOW:
effectiveness *= 0.5;
break;
default:
effectiveness *= 1.0;
break;
}
break;
case FIGHTING:
switch(targetType)
{
case NORMAL:
effectiveness *= 2.0;
break;
case ICE:
effectiveness *= 2.0;
break;
case DARK:
effectiveness *= 2.0;
break;
case ROCK:
effectiveness *= 2.0;
break;
case STEEL:
effectiveness *= 2.0;
break;
case POISON:
effectiveness *= 0.5;
break;
case FLYING:
effectiveness *= 0.5;
break;
case PSYCHIC:
effectiveness *= 0.5;
break;
case BUG:
effectiveness *= 0.5;
break;
case SHADOW:
effectiveness *= 0.5;
break;
default:
effectiveness *= 1.0;
break;
}
break;
case NORMAL:
switch(targetType)
{
case FIGHTING:
effectiveness *= 0.5;
break;
case SHADOW:
effectiveness *= 0.5;
break;
case GHOST:
effectiveness *= 0.0;
break;
default:
effectiveness *= 1.0;
break;
}
break;
case WATER:
switch(targetType)
{
case FIRE:
effectiveness *= 2.0;
break;
case GROUND:
effectiveness *= 2.0;
break;
case ROCK:
effectiveness *= 2.0;
break;
case WATER:
effectiveness *= 0.5;
break;
case GRASS:
effectiveness *= 0.5;
break;
case DRAGON:
effectiveness *= 0.5;
break;
case SHADOW:
effectiveness *= 0.5;
break;
default:
effectiveness *= 1.0;
break;
}
break;
case ICE:
switch(targetType)
{
case GRASS:
effectiveness *= 2.0;
break;
case GROUND:
effectiveness *= 2.0;
break;
case FLYING:
effectiveness *= 2.0;
break;
case DRAGON:
effectiveness *= 2.0;
break;
case WATER:
effectiveness *= 0.5;
break;
case FIRE:
effectiveness *= 0.5;
break;
case ICE:
effectiveness *= 0.5;
break;
case STEEL:
effectiveness *= 0.5;
break;
case SHADOW:
effectiveness *= 0.5;
break;
default:
effectiveness *= 1.0;
break;
}
break;
case GRASS:
switch(targetType)
{
case WATER:
effectiveness *= 2.0;
break;
case GROUND:
effectiveness *= 2.0;
break;
case ROCK:
effectiveness *= 2.0;
break;
case FIRE:
effectiveness *= 0.5;
break;
case GRASS:
effectiveness *= 0.5;
break;
case POISON:
effectiveness *= 0.5;
break;
case FLYING:
effectiveness *= 0.5;
break;
case BUG:
effectiveness *= 0.5;
break;
case DRAGON:
effectiveness *= 0.5;
break;
case SHADOW:
effectiveness *= 0.5;
break;
default:
effectiveness *= 1.0;
break;
}
break;
case BUG:
switch(targetType)
{
case PSYCHIC:
effectiveness *= 2.0;
break;
case GRASS:
effectiveness *= 2.0;
break;
case DARK:
effectiveness *= 2.0;
break;
case FIRE:
effectiveness *= 0.5;
break;
case FIGHTING:
effectiveness *= 0.5;
break;
case POISON:
effectiveness *= 0.5;
break;
case GHOST:
effectiveness *= 0.5;
break;
case STEEL:
effectiveness *= 0.5;
break;
case SHADOW:
effectiveness *= 0.5;
break;
default:
effectiveness *= 1.0;
break;
}
break;
case POISON:
switch(targetType)
{
case GRASS:
effectiveness *= 2.0;
break;
case GROUND:
effectiveness *= 0.5;
break;
case ROCK:
effectiveness *= 0.5;
break;
case POISON:
effectiveness *= 0.5;
break;
case GHOST:
effectiveness *= 0.5;
break;
case SHADOW:
effectiveness *= 0.5;
break;
case STEEL:
effectiveness *= 0.0;
break;
default:
effectiveness *= 1.0;
break;
}
break;
case FLYING:
switch(targetType)
{
case GRASS:
effectiveness *= 2.0;
break;
case BUG:
effectiveness *= 2.0;
break;
case FIGHTING:
effectiveness *= 2.0;
break;
case ELECTRIC:
effectiveness *= 0.5;
break;
case ROCK:
effectiveness *= 0.5;
break;
case STEEL:
effectiveness *= 0.5;
break;
case SHADOW:
effectiveness *= 0.5;
break;
default:
effectiveness *= 1.0;
break;
}
break;
case PSYCHIC:
switch(targetType)
{
case POISON:
effectiveness *= 2.0;
break;
case FIGHTING:
effectiveness *= 2.0;
break;
case PSYCHIC:
effectiveness *= 0.5;
break;
case STEEL:
effectiveness *= 0.5;
break;
case SHADOW:
effectiveness *= 0.5;
break;
case DARK:
effectiveness *= 0.0;
break;
default:
effectiveness *= 1.0;
break;
}
break;
case GHOST:
switch(targetType)
{
case PSYCHIC:
effectiveness *= 2.0;
break;
case GHOST:
effectiveness *= 2.0;
break;
case DARK:
effectiveness *= 0.5;
break;
case STEEL:
effectiveness *= 0.5;
break;
case SHADOW:
effectiveness *= 0.5;
break;
case NORMAL:
effectiveness *= 0.0;
break;
default:
effectiveness *= 1.0;
break;
}
break;
case DARK:
switch(targetType)
{
case PSYCHIC:
effectiveness *= 2.0;
break;
case GHOST:
effectiveness *= 2.0;
break;
case FIGHTING:
effectiveness *= 0.5;
break;
case DARK:
effectiveness *= 0.5;
break;
case STEEL:
effectiveness *= 0.5;
break;
case SHADOW:
effectiveness *= 0.5;
break;
default:
effectiveness *= 1.0;
break;
}
break;
case GROUND:
switch(targetType)
{
case FIRE:
effectiveness *= 2.0;
break;
case ELECTRIC:
effectiveness *= 2.0;
break;
case POISON:
effectiveness *= 2.0;
break;
case ROCK:
effectiveness *= 2.0;
break;
case STEEL:
effectiveness *= 2.0;
break;
case WATER:
effectiveness *= 0.5;
break;
case GRASS:
effectiveness *= 0.5;
break;
case ICE:
effectiveness *= 0.5;
break;
case SHADOW:
effectiveness *= 0.5;
break;
case FLYING:
effectiveness *= 0.0;
break;
default:
effectiveness *= 1.0;
break;
}
break;
case STEEL:
switch(targetType)
{
case ICE:
effectiveness *= 2.0;
break;
case BUG:
effectiveness *= 2.0;
break;
case FIRE:
effectiveness *= 0.5;
break;
case GROUND:
effectiveness *= 0.5;
break;
case SHADOW:
effectiveness *= 0.5;
break;
default:
effectiveness *= 1.0;
break;
}
break;
case ROCK:
switch(targetType)
{
case FIRE:
effectiveness *= 2.0;
break;
case ICE:
effectiveness *= 2.0;
break;
case FLYING:
effectiveness *= 2.0;
break;
case BUG:
effectiveness *= 2.0;
break;
case FIGHTING:
effectiveness *= 0.5;
break;
case GROUND:
effectiveness *= 0.5;
break;
case STEEL:
effectiveness *= 0.5;
break;
case SHADOW:
effectiveness *= 0.5;
break;
default:
effectiveness *= 1.0;
break;
}
break;
case ELECTRIC:
switch(targetType)
{
case WATER:
effectiveness *= 2.0;
break;
case FLYING:
effectiveness *= 2.0;
break;
case ELECTRIC:
effectiveness *= 0.5;
break;
case GRASS:
effectiveness *= 0.5;
break;
case DRAGON:
effectiveness *= 0.5;
break;
case SHADOW:
effectiveness *= 0.5;
break;
case GROUND:
effectiveness *= 0.0;
break;
default:
effectiveness *= 1.0;
break;
}
break;
case DRAGON:
switch(targetType)
{
case DRAGON:
effectiveness *= 2.0;
break;
case STEEL:
effectiveness *= 0.5;
break;
case SHADOW:
effectiveness *= 0.5;
break;
default:
effectiveness *= 1.0;
break;
}
break;
case SHADOW:
switch(targetType)
{
case SHADOW:
effectiveness *= 1.0;
break;
default:
effectiveness *= 2.0;
break;
}
break;
}
return effectiveness;
}
Move_class::Move_class(void)
{
m_name = EMPTY; // Empty Name
m_moveType = NORMAL; // Normal Move_class: Default
m_accuracy = 1000; // High accuracy
m_speed = 0; // Normal Speed Priority
m_power = 0; // Zero Power
m_mp = HIGH_MP; // 30 MP
}
int Move_class::GetTyping()
{
return m_moveType;
}
double Move_class::CheckEffectiveness(Pokemon user, Pokemon target)
{
double effectiveness = 1.0;
// sets selfType to the move's type;
int selfType = m_moveType;
// sets placeholder int to the target's first type
int targetType1 = target.GetType1();
// sets placeholder int to the target's second type
int targetType2 = target.GetType2();
// First run of the CheckTypeEffective
effectiveness *= user.CheckTypeEffective(selfType, targetType1);
// Second Run of the Check TYpe Effective
effectiveness *= user.CheckTypeEffective(selfType, targetType2);
return effectiveness;
}
| [
"dka@anchortd.com"
] | dka@anchortd.com |
2b1eec5159738d4a447b8786ba5049d42a30d6ed | bfbe6667ce1a0b7b2772f4de57829d8760a0f55c | /var.6/12_overloading/list.cpp | 740dc071eac95caa1bbb4e3549fc6f5fbf85b75a | [] | no_license | buger/CPP-Labs | 50333a317657d495ad5a3f120441ed5988ea16d5 | f413c505af4a9f612c597214ab68384b588f5389 | refs/heads/master | 2023-07-12T11:41:10.793947 | 2009-10-17T16:00:24 | 2009-10-17T16:00:24 | 339,804 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 12,197 | cpp | #include <stdlib.h>
#include <iostream>
#include <iomanip>
#include "list.h"
List::List(int n) //конструктор инициализирует список из n элементов по принципу "очередь"
{
NodePtr current; // указатель на текущий элемент
// Обнуляем начальный элемент
head = NULL;
// Формируем стек из n элементов
for (int i = 0; i<n; i++)
{
// Если head равно NULL, значит наш стэк еще пуст, и нам надо созать первый элемент
if (head == NULL)
{
// Создаем новый элемент типа Node, который будет первым в стэке
head = new Node;
// Заполняем значение элемента случайными числами от -5 до 5
head->data = rand()%10 - 5;
// Устанавливаем значение link в NULL, так как это первый элемент нашего стэка
head->next = NULL;
}
else
{
// Создаем новый элемент типа Node
current = new Node;
current->data = rand()%10 - 5;
// Для нового элемента, следующим будет последний созданный, который постоянно находится в head
current->next = head;
// Теперь первым элементом в стэке должен стать current
head = current;
}
}
}
List::List(List& list_for_copy)
{
// используется для перемещения по списку
// будет являться ссылкой на текущий элемент копируемого списка
NodePtr iterator;
NodePtr current; // указатель на текущий элемент
NodePtr new_element; // указатель на текущий элемент
NodePtr tail; // указатель на конец очереди
// Обнуляем начальный элемент
head = NULL;
// Для того что бы скопировать список, мы должны пройтись циклом по всем его элементам
// Устанавливаем в начало копируемого списка
iterator = list_for_copy.head;
// Делаем цикл, пока не дойдем до последнего элемента, у которого next NULL
while(iterator != NULL)
{
// Если head равно NULL, значит наш стэк еще пуст, и нам надо созать первый элемент
if (head == NULL)
{
// Создаем новый элемент типа Node, который будет первым в стэке
head = new Node;
// Устанавливаем значение копируемого элемента
head->data = iterator->data;
// Устанавливаем значение link в NULL, так как это первый элемент нашего стэка
head->next = NULL;
// Так как это первый элемент, то он является и концом
tail = head;
}
else
{
// Создаем новый элемент типа Node
current = new Node;
// Устанавливаем значение копируемого элемента
current->data = iterator->data;
/*
Если мы будем копировать как стэк, то получим инвертированный список:
дан список который хотим скопировать: 1 -> 2 -> 3 -> 4
Так как принципом стэка являетсяЖ первый вошел, первый вышел,
то при последовательном копировании списка мы получим:
4 -> 3 -> 2 -> 1, ведь головой у копируемого списка была 1
Пример:
1 итерация:
1
^
head
2 итерация:
2 -> 1
^
head
Для того что бы это не случилось нужно копироват его как очередь: Первым вошел, первым вышел
Для этого мы всегда храним наш головной элемент в head
и вводим понятие конца очереди tail, который всегда будет указывать на конец очереди:
1 итерация:
1 -> 2
^ ^
head tail
2 итерация:
1 -> 2 -> 3
^ ^
head tail
*/
tail->next = current;
// Теперь последним элементом в стэке должен стать current
tail = current;
}
// Переходим к следующему элементу копируемого списка
iterator = iterator->next;
}
}
// Вывод списка
void List::print()
{
NodePtr current; // Указатель на текущий элемент
// Установим в начало
current = head;
// Делаем цикл, пока не дойдем до последнего элемента, у которого next NULL
while(current != NULL)
{
// Вывод значения текущего элемента
// setw делается для красивого вывода
cout << setw(5) << current->data;
// Переходим к следующему элементу
current = current->next;
}
cout << endl;
}
/*
& формирование нового списка из двух списков так,
что каждый элемент информационного поля нового списка удовлетворяет условию: с = (а < b ) ? a : b
Операция очень похоже на конструктор с копированием другого списка
*/
List& List::operator & (List& list)
{
int calculated_data; // Используется для вычисления заданного условия
// используется для перемещения по списку
// 2 так как нам нужно проходится по двум спискам
NodePtr iterator, iterator_ext;
NodePtr new_list_head; // указатель на текущий элемент
NodePtr current; // указатель на текущий элемент
NodePtr new_element; // указатель на текущий элемент
NodePtr tail; // указатель на конец очереди
// Обнуляем начальный элемент
new_list_head = NULL;
// Устанавливаем в начало списка
iterator = head;
iterator_ext = list.head;
// Делаем цикл, пока не дойдем до последнего элемента любого из двух списков, у которого next NULL
while(iterator != NULL && iterator_ext != NULL)
{
// Если выполняется условые в скобках, выбираем первое значение, иначе второе
// с = (а < b ) ? a : b
calculated_data = (iterator->data < iterator_ext->data) ? iterator->data : iterator_ext-> data;
// Если head равно NULL, значит наш стэк еще пуст, и нам надо созать первый элемент
if (new_list_head == NULL)
{
// Создаем новый элемент типа Node, который будет первым в стэке
new_list_head = new Node;
// Устанавливаем значение копируемого элемента
new_list_head->data = calculated_data;
// Устанавливаем значение link в NULL, так как это первый элемент нашего стэка
new_list_head->next = NULL;
// Так как это первый элемент, то он является и концом
tail = new_list_head;
}
else
{
// Создаем новый элемент типа Node
current = new Node;
// Устанавливаем значение копируемого элемента
current->data = calculated_data;
tail->next = current;
// Теперь последним элементом в стэке должен стать current
tail = current;
}
// Переходим к следующему элементу копируемого списка
iterator = iterator->next;
iterator_ext = iterator_ext->next;
}
List* new_list = new List(0);
new_list->head = new_list_head;
return *new_list;
}
// Удаление элемента из списка, по индексу
void List::exclude(int index){
//Счетчик элементов
int counter = 0;
NodePtr iterator; // Используется для хождению по списку
NodePtr previous; // Хранит в себе предыдущий элемент
// Устанавливаем начальные значения
iterator = head;
previous = NULL;
while(iterator != NULL)
{
if(counter == index){
// Если дошли до нужного элемента, то вырежем его из списка
// 1 -> 2 -> 3
// ^ ^ ^
// previous iterator next
// Хотим вырезать iterator
// 1 -> 3
// ^ ^
// previous next
previous->next = iterator->next;
// Освобождаем память
delete iterator;
// Выходим из функции
return;
}
counter++;
// Текущий элемент становится предыдущим
previous = iterator;
// Переходим к следующему элементу
iterator = iterator->next;
}
}
// Деструктор - выполняется перед удалением объекта
// Перед удалением, необходимо отчистить память которую мы заняли
List::~ List()
{
NodePtr current;// Ссылка на текущий элемент
// Делаем цикл, пока не дойдем до последнего элемента, у которого next NULL
while(head != NULL)
{
current = head;
// Переходим к следующему элементу
head = head->next;
// Очищаем память, занимаемую current
delete current;
}
}
| [
"leonsbox@gmail.com"
] | leonsbox@gmail.com |
2f626d7ebd5aa34e1ba41fd9f7c7a6b688674294 | f8083f1ac05ecb07b93c58af98eaf78e8eab9367 | /AGC/044/A.cpp | ea8ea6f38cde0b576bfbfee2720a0238f8b6c758 | [] | no_license | itohdak/AtCoder | 4f42ccc7b2b7f71d0d51069bd86503ee0f4b3dbf | 9ee89bac3ced919b94096ffd7b644d3716569762 | refs/heads/master | 2021-06-24T14:42:54.529474 | 2020-10-16T18:41:27 | 2020-10-16T18:41:27 | 134,136,836 | 2 | 1 | null | 2020-02-07T12:45:10 | 2018-05-20T09:26:13 | C++ | UTF-8 | C++ | false | false | 1,452 | cpp | #include <bits/stdc++.h>
#include "/home/itohdak/AtCoder/000/print.hpp"
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,0,n)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
void solve() {
ll N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
ll p[] = {2, 3, 5};
ll c[] = {A, B, C, D};
priority_queue<ll> q;
map<ll, ll> mp;
q.push(N);
mp[N] = 0;
while(!q.empty()) {
ll tmp = q.top();
q.pop();
// cout << tmp << endl;
rep(i, 3) {
ll ne = tmp/p[i];
if(!mp.count(ne)) {
mp[ne] = longinf;
q.push(ne);
}
mp[ne] = min(mp[tmp]+(tmp-ne*p[i])*c[3]+c[i], mp[ne]);
if(!mp.count(ne+1)) {
mp[ne+1] = longinf;
q.push(ne+1);
}
mp[ne+1] = min(mp[tmp]+((ne+1)*p[i]-tmp)*c[3]+c[i], mp[ne+1]);
mp[ne+1] = min(mp[ne]+c[3], mp[ne+1]);
mp[ne] = min(mp[ne+1]+c[3], mp[ne]);
if(mp[tmp]+(tmp-q.top())*c[3] > 0) mp[q.top()] = min(mp[tmp]+(tmp-q.top())*c[3], mp[q.top()]);
}
}
// cout << mp << endl;
cout << mp[0] << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int T;
cin >> T;
rep(t, T) solve();
return 0;
}
| [
"itohdak@gmail.com"
] | itohdak@gmail.com |
558ec34685b3ccf7d95bfb7519fa49d10b02cd6c | 0a4ad01841a40e08c7a91cb2bc7d959f5c899ba4 | /RAS/cavity/system/FOrandomise | b0d074c8395e47be52eeb31a2967c064d81c9181 | [] | no_license | soma2210/pimpleFoam | 2238f7829315a5d192918822a79b5a580ca06382 | 1dbfd12d0af2af17969ee4ec43a3e70b1fc5526d | refs/heads/master | 2023-06-26T15:58:49.784465 | 2021-07-30T12:14:26 | 2021-07-30T12:14:26 | 391,054,332 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,083 | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: v2012 |
| \\ / A nd | Website: www.openfoam.com |
| \\/ M anipulation | |
\*---------------------------------------------------------------------------*/
randomise1
{
// Mandatory entries
type randomise;
libs (fieldFunctionObjects);
magPerturbation 0.1;
field U;
// Optional (inherited) entries
region region0;
enabled true;
log true;
timeStart 0.25;
timeEnd 1000;
executeControl timeStep;
executeInterval 5;
writeControl timeStep;
writeInterval 25;
}
// ************************************************************************* //
| [
"somnathnirali@gmail.com"
] | somnathnirali@gmail.com | |
86a725ff7960afd1ef8310d10a28100227035d6b | 4e87df024f179be11bc6ad91d3fda019183c9e3b | /user_manager_server/common/shareStruct.h | 7dc5b40aa1d95805b7a6ffc34a73aef85e709d8b | [] | no_license | lanzheng1113/game_robot | 54f03c8cb0b29ca7e38952187a45fdb00be1b508 | c8efb0770e19a9baa9fef5de3992360993847917 | refs/heads/master | 2020-07-12T14:26:25.288847 | 2019-08-28T07:23:08 | 2019-08-28T07:23:08 | 204,839,436 | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 2,327 | h | #ifndef SHARE_STRUCT_H
#define SHARE_STRUCT_H
#include <string>
using std::string;
#define max_client_user_name_len 16
#define max_acc_len 32
class AccToProcessAndId
{
public:
string _acc; //该账号
WORD _process_id; //该账号对应的处理ID，服务器发还处理结果时用这个代表账号。
protected:
private:
};
struct AccInfoForProxy
{
int id;
char acc[max_acc_len];
char szClientUserName[max_client_user_name_len];
SYSTEMTIME DeadLine;
SYSTEMTIME createTime;
BYTE isValide;
};
struct WaiGuaPrice
{
long TypeId;
double YueKaPrice;
double ZhouKaPrice;
char KardName[32];
};
struct CreateAccMsg
{
DWORD WgVersionId;
DWORD accTypeId;
DWORD createCount;
char szUserClientName[max_client_user_name_len];
};
struct ChargeAccMsg{
DWORD WgVersionId;
DWORD accTypeId;
DWORD chargeCount;
};
struct ChargeAccErrorDescribe{
WORD process_id;
int error_code;
};
struct switchAccErrorDescribe{
char szAcc[max_acc_len];
int error_code;
};
struct CreateAccErrorDescribe{
WORD process_id;
int error_code;
};
struct ProxyHistoryActive{
int id;
int type_id;
SYSTEMTIME time;
char event_describe[200];
char detail_file_name[100];
};
enum{
//返回-1 账号已经存在，返回-2账户余额不足，返回-3账号越界，返回-4测试卡数量不足。
create_acc_error_unknown = -6,
create_acc_error_count_0 = -5,
create_acc_error_testkard_count_limit = -4,
create_acc_error_balance_not_enough = -3,
create_acc_error_already_exist = -2,
create_acc_error_server_error = -1,
create_acc_success,
};
enum{
charge_acc_error_unknown = -100,
charge_acc_error_count_0,
charge_acc_error_cannot_charge_testkard,
charge_acc_error_balance_not_enough,
charge_acc_error_not_exist,
charge_acc_error_server_error,
charge_acc_success = 0,
};
enum{
disable_acc_error_unknown = -100,
disable_acc_success = 0,
};
enum{
error_proxy_switch_acc_bad_len = -1000,
error_proxy_switch_acc_beyond_max,
error_proxy_switch_acc_count_0,
error_proxy_switch_acc_count_not_equal,
error_proxy_switch_acc_buf_size_error,
error_proxy_switch_acc_not_yours,
error_proxy_switch_new_acc_already_exist,
switch_acc_error_unknow = -100,
switch_acc_success = 0,
};
enum{
proxy_event_id_create_acc = 100,
proxy_event_id_charge_acc,
proxy_event_id_swith_acc,
proxy_event_id_del_acc,
};
#endif
| [
"lanzheng_1123@163.com"
] | lanzheng_1123@163.com |
ed02961619f90c5d06934726e0f39d001168b332 | d6349a2604a160cd98d59958cb9122c1f8813715 | /include/components/24PinsComponents.hpp | ead6952d1a8b8e6ec6d54769d638d5f2a4ed36c2 | [] | no_license | Zumtak/NanoTekSpice | 4195326f43730a9d1e1a4ff4bc1e0f90134617b8 | 235bd57bf1f833dbea9ab60b5f193930733fba85 | refs/heads/master | 2023-02-27T22:37:21.398618 | 2021-02-10T10:15:08 | 2021-02-10T10:15:08 | 245,865,620 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 379 | hpp | /*
** EPITECH PROJECT, 2019
** NanoTekSpice
** File description:
** 24Pins Components class header
*/
#ifndef _24PINSCOMPONENTS_HPP_
#define _24PINSCOMPONENTS_HPP_
#include "Components.hpp"
#include <array>
namespace nts {
class Comp24Pins : public Component<24> {
public:
Comp24Pins(const std::string &name, nts::ComponentType type);
};
}
#endif
| [
"antoine.treboutte@epitech.eu"
] | antoine.treboutte@epitech.eu |
0ca06ddd9914e4a96cbc40b7e8a5e6409f1582f8 | 48e271b8803fa7d6130209ebeb3547508f35035a | /Source/MyProject/MyCharacter.cpp | ed758319c2537beafe5e77697967c3058914e024 | [] | no_license | sivelab/TPAWT-SmartShoeDemo | 758fcdce9a762957813ee81140b63413013f5a43 | 23811200516c1c0c39444ca68663fee56d6cdb97 | refs/heads/master | 2020-03-23T13:44:33.616913 | 2016-09-08T20:18:29 | 2016-09-08T20:18:29 | 141,634,620 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 733 | cpp | // Fill out your copyright notice in the Description page of Project Settings.
#include "MyProject.h"
#include "MyCharacter.h"
// Sets default values
AMyCharacter::AMyCharacter()
{
// Set this character to call Tick() every frame. You can turn this off to improve performance if you don't need it.
PrimaryActorTick.bCanEverTick = true;
}
// Called when the game starts or when spawned
void AMyCharacter::BeginPlay()
{
Super::BeginPlay();
}
// Called every frame
void AMyCharacter::Tick( float DeltaTime )
{
Super::Tick( DeltaTime );
}
// Called to bind functionality to input
void AMyCharacter::SetupPlayerInputComponent(class UInputComponent* InputComponent)
{
Super::SetupPlayerInputComponent(InputComponent);
}
| [
"beau0307@d.umn.edu"
] | beau0307@d.umn.edu |
a682e4c0fe847d5c2bdf3e9ed7dfd12702bf09a0 | 88bb57040c2a2cc9b855cceaf2e11cbd63f0bab5 | /ESP32_Touch_Tacho.cpp | a59969ce233ca164c46f7c8bfde676b83a276925 | [] | no_license | kvandt/TouchDRO_Interface | db392aeee6ba478c9407d35ce2adbf4e88631019 | 07bccc6f7b31e1aa39277e9522f062ace24ff675 | refs/heads/master | 2022-11-14T09:10:48.820539 | 2020-07-10T11:02:09 | 2020-07-10T11:02:09 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,566 | cpp | /* Routines to add Tacho capability to TouchDRO Interface
Mates with ESP32Encoder as adapted by romeo
Prepared June 2020
*/
#include "ESP32_Touch_Tacho.h"
const int minRPM = 20; //RPM below which tacho will decide shaft is stopped
extern ESP32Tacho Tacho;
portMUX_TYPE TachoMux = portMUX_INITIALIZER_UNLOCKED; //despite vs squiggly line, compiles ok
const int32_t microsPerMinute = 60000000;
ESP32Tacho::ESP32Tacho() {
pulsesPerRev = 0;
}
ESP32Tacho::ESP32Tacho(int aP, int bP, float ppr, pullupType uip) {
tachoPinA = (gpio_num_t)aP;
tachoPinB = (gpio_num_t)bP;
pulsesPerRev = ppr;
puType = uip;
pulsesPerMinute = 0;
maxPulseInterval = microsPerMinute / (minRPM * pulsesPerRev);
directionEnabled = false;
}
void ESP32Tacho::attachTacho() {
setupPin(tachoPinA);
if (tachoPinB != 0 && tachoPinB != tachoPinA) {
setupPin(tachoPinB);
directionEnabled = true;
running = false;
}
attachInterrupt(tachoPinA, tacho_isr, RISING);
}
void ESP32Tacho::setupPin(gpio_num_t a) {
gpio_pad_select_gpio(a);
gpio_set_direction(a, GPIO_MODE_INPUT);
if (puType == down) {
gpio_pulldown_en(a);
}
else {
if (puType == up) {
gpio_pullup_en(a);
}
}
}
void IRAM_ATTR tacho_isr() {
unsigned long isr_micros = micros();
if (!Tacho.running) {
portENTER_CRITICAL_ISR(&TachoMux);
Tacho.running = true;
Tacho.pulseCount = 0;
Tacho.direction = digitalRead(Tacho.tachoPinB);
Tacho.timeOfLastPulse = isr_micros;
Tacho.aggregateMicros = 0;
portEXIT_CRITICAL_ISR(&TachoMux);
}
else {
portENTER_CRITICAL_ISR(&TachoMux);
Tacho.pulseCount++;
Tacho.aggregateMicros += (isr_micros - Tacho.timeOfLastPulse);
Tacho.direction = digitalRead(Tacho.tachoPinB);
Tacho.timeOfLastPulse = isr_micros;
portEXIT_CRITICAL_ISR(&TachoMux);
}
}
float ESP32Tacho::get_ppm() {
int temp_pulseCount;
unsigned long temp_aggregateMicros;
unsigned long temp_timeOfLastPulse;
if (!Tacho.running) {
return 0;
}
portENTER_CRITICAL(&TachoMux);
temp_pulseCount = pulseCount;
pulseCount = 0;
temp_aggregateMicros = aggregateMicros;
aggregateMicros = 0;
temp_timeOfLastPulse = timeOfLastPulse;
portEXIT_CRITICAL(&TachoMux);
if (temp_pulseCount == 0) { //if no actual pulses received, display an apparent slowdown in accordance with the report interval
pulseInterval = micros() - temp_timeOfLastPulse;
if (pulseInterval > maxPulseInterval) {
running = false;
direction = 0;
return 0;
}
temp_pulseCount = 1;
}
else {
pulseInterval = temp_aggregateMicros / temp_pulseCount;
}
return (microsPerMinute / pulseInterval);
}
| [
"65019427+romeo987@users.noreply.github.com"
] | 65019427+romeo987@users.noreply.github.com |
cf0061fda253770bcc2ef73402be12570c2c88c6 | 8b6e4bff1f0c3d805881079a251470780c49ac34 | /TestBST_Recusrion.cpp | ce1d4c3d8853e22c0801153e1e7f5f915ab1c06d | [] | no_license | dipankar08/codestudioV2 | 1ab48aee20886beca4d7e28405fdcbef030c2058 | c52015af840a2e65b2b4678ed59fdf672d80b41a | refs/heads/master | 2020-04-04T17:14:45.072917 | 2019-01-13T03:21:08 | 2019-01-13T03:21:08 | 156,113,050 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 884 | cpp | /***************************************************
* Title : Recustive solution by passing max or min.
* Author: Dipankar Dutta
****************************************************/
#include "tree.h"
#include <iostream>
using namespace std;
bool isValidRecur(TreeNode *root, long min, long max) {
if (!root) {
return true;
}
int val = root->val;
if (val <= min || val >= max) {
return false;
}
return isValidRecur(root->left, min, val) &&
isValidRecur(root->right, val, max);
}
bool isValidBST(TreeNode *root) {
return isValidRecur(root, LONG_MIN, LONG_MAX);
}
int main() {
cout << isValidBST(createTree({1, 2, 3})) << endl; // 0
cout << isValidBST(createTree({2, 1, 3})) << endl; // 1
cout << isValidBST(createTree({5, 1, 4, tnull, tnull, 3, 6})) << endl; //0
cout << isValidBST(createTree({3, 2, 5, 1, 4})) << endl; // 0
return 0;
}
| [
"dip@fb.com"
] | dip@fb.com |
ee9909b8e99edfb36c13eb2300531eee77f293ee | 97435470b168491935c146b1994e248aa576489c | /AVSubtitleRect.h | 5bea7aa40424da72874af5c19ee527453052c172 | [] | no_license | rdstevens/ffmpeg.net | e828a90225ad49f105425872d455cc64363c8d26 | bf47e5cf1a7b80c2d9f373fbd072cf45fb748180 | refs/heads/master | 2020-05-20T11:37:36.801809 | 2015-01-23T20:35:56 | 2015-01-23T20:35:56 | 4,635,793 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,542 | h | #pragma once
#include "ffmpeg_actual.h"
#include "AVSubtitleType.h"
using namespace System;
namespace FFMpegNet
{
namespace AVCodec
{
public ref class AVSubtitleRect
{
public:
AVSubtitleRect(int x, int y, int w, int h, int nb_colors, System::Drawing::Bitmap^ pic,
FFMpegNet::AVCodec::AVSubtitleType type, String^ text, String^ ass)
{
_avSubtitleRect = new ::AVSubtitleRect();
_avSubtitleRect->x = x;
_avSubtitleRect->y = y;
_avSubtitleRect->w = w;
_avSubtitleRect->h = h;
_avSubtitleRect->nb_colors = nb_colors;
_avSubtitleRect->type = static_cast<::AVSubtitleType>(type);
// TODO: Marshal text and ass strings
// TODO: Transform Bitmap into AVPicture (subset of AVFrame?)
};
~AVSubtitleRect()
{
delete _avSubtitleRect;
}
AVSubtitleRect(::AVSubtitleRect* _avSubtitleRect)
{
//this->_avSubtitleRect = _avSubtitleRect; // Can't do this, unless we use smart pointers or something.
_avSubtitleRect = new ::AVSubtitleRect();
memcpy(this->_avSubtitleRect, _avSubtitleRect, sizeof(::AVSubtitleRect));
}
int GetX()
{
return _avSubtitleRect->x;
}
int GetY()
{
return _avSubtitleRect->y;
}
int GetW()
{
return _avSubtitleRect->w;
}
int GetH()
{
return _avSubtitleRect->h;
}
int GetNumberOfColors()
{
return _avSubtitleRect->nb_colors;
}
internal:
::AVSubtitleRect * _avSubtitleRect;
};
};
};
| [
"rdstevens@gmail.com"
] | rdstevens@gmail.com |
50b13b7e59ef48c776772b2e9011e30e7453244c | 5498109c7de17986a29f8ccca2c02021b5ab0ffc | /Space-Game-Project/logging.h | 61a49de7d8de9de588cd7a8ba517e7e642e1f595 | [
"MIT"
] | permissive | Archer4499/Space-Game-Project | ce3ece26d31df174aba79023364c7d669caef188 | 549c3f7239aad50ff583566cfb382895df309d4c | refs/heads/master | 2020-04-20T15:49:05.682360 | 2019-07-23T12:44:29 | 2019-07-23T12:44:29 | 168,942,046 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,414 | h | #pragma once
#define LOG_TYPE_NO 0
#define LOG_TYPE_COUT 1
#define LOG_TYPE_FILE 2
// Settings
#define LOG_TYPE LOG_TYPE_FILE
#define LOG_STREAM_OVERLOAD
////
enum LogLevel {
NO_LOG,
FATAL,
ERR,
WARN,
INFO,
DEBUG,
SPAM
};
#if LOG_TYPE == LOG_TYPE_NO
#define LOG(errLevel, ...)
#define LOG_IF(errLevel, ...)
#define LOG_RETURN(errLevel, condition, returnCode, ...) if (condition) return returnCode;
// TODO(Derek): Define LOG_S using a null output stream
int logOpen(const char *alogPath="debug.log", const char *amode="w", LogLevel alogLevel=WARN) {return 0;}
void logClose() {}
#else // LOG_TYPE != LOG_TYPE_NO
// TODO(Derek): add scope indenting
#include <string>
#include "fmt/core.h"
#define LOG(errLevel, format, ...) log(errLevel, __FILE__, __LINE__, format, __VA_ARGS__)
#define LOG_IF(errLevel, condition, format, ...) if (condition) log(errLevel, __FILE__, __LINE__, format, __VA_ARGS__)
#define LOG_RETURN(errLevel, condition, returnCode, format, ...) if (condition) { log(errLevel, __FILE__, __LINE__, format, __VA_ARGS__); return returnCode; }
// std::string curDateTime();
int logOpen(const char *alogPath="debug.log", const char *amode="w", LogLevel alogLevel=WARN);
void logClose();
void logb(LogLevel errLevel, const char *file, unsigned int line, std::string message);
template <typename... Args>
void log(LogLevel errLevel, const char *file, unsigned int line, const char* format, const Args & ... args) {
std::string message = fmt::format(format, args...);
logb(errLevel, file, line, message);
}
#ifdef LOG_STREAM_OVERLOAD
// Allows user defined types with operator<< overloads to be used in LOG
#include "fmt/ostream.h"
#endif
#ifdef LOG_STREAM
#include "fmt/format.h"
#define LOG_S(errLevel) StreamLogger(errLevel, __FILE__, __LINE__)
class StreamLogger {
public:
StreamLogger(LogLevel errLevel, const char *file, unsigned int line) : _errLevel(errLevel), _file(file), _line(line) {}
StreamLogger::~StreamLogger() {
logb(_errLevel, _file, _line, fmt::to_string(_message));
}
template<typename T>
StreamLogger& operator<<(const T& t) {
format_to(_message, "{}", t);
return *this;
}
private:
LogLevel _errLevel;
const char* _file;
unsigned int _line;
fmt::memory_buffer _message;
};
#endif // ifdef LOG_STREAM
#endif // LOG_TYPE != LOG_TYPE_NO
| [
"king.dm49@gmail.com"
] | king.dm49@gmail.com |
5d3c07baee18f1b15d4cb7d2ed68fd5c589e69e5 | a3eeea563641f51c91e9930af14bfb5f987d366a | /lib/include/impl/TileServerOSM.h | c23b7bbc62b206808a4c543d1aacdbf441f89b05 | [
"MIT"
] | permissive | foow/GlobeViewer | 2079b5ec1b471af4d6c3f8cc4bfc79b61de8e632 | e95ece3158bc8ffd02782b7bc7ce65814eb83697 | refs/heads/master | 2023-03-16T20:01:52.325908 | 2018-11-23T18:23:14 | 2018-11-23T18:23:14 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,072 | h | #pragma once
#include <array>
#include <mutex>
#include "TileServerBase.h"
namespace gv {
/*!
* \brief Implements OpenStreetMap tile server.
*
* For documentation for overridden virtual private methods
* look in the base class TileServerBase.
*/
class TileServerOSM : public TileServerBase
{
public:
TileServerOSM();
~TileServerOSM();
private:
virtual std::string getServerName() const override;
virtual std::string getServerPort() const override;
virtual std::string getNextMirror() override;
virtual std::string getTileTarget( int z, int x, int y ) const override;
const std::string name_; //!< Server name.
const std::string domain_; //!< Server address.
const std::string port_; //!< Server port.
const std::array<std::string, 3> subDomain_; //!< Server subdomains.
std::mutex mutex_; //!< Allows to synchronize mirror cycling.
unsigned int curSub_; //!< Current subdomain.
};
}
| [
"green.anger@gmail.com"
] | green.anger@gmail.com |
d43ddd384a8fb807c152bfe8da5cc9366e1ee80d | 375ed6c0680cbf20abdd7ddcef3a828787a268f2 | /p7/word.cc | 3df54350108e4b27961112e2f2a108004e7f6d42 | [] | no_license | arellanoemilio/CSE109 | 8b1657eb0aac039ba79be42e3ff660752db7026a | cb79f6692331134bdd27e5a6167b63b727b91ebd | refs/heads/master | 2020-04-06T03:37:42.906331 | 2016-08-03T18:22:39 | 2016-08-03T18:22:39 | 64,868,554 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,635 | cc | #include "word.h"
Word::~Word(){
delete [] wd;
}
Word::Word(){
copy("");
}
Word::Word(const Word & w){
copy(w.wd);
}
Word:: Word(const char *ch){
//cerr << "Word " << ch<< " ";
if(ch == NULL)
copy("");
else
copy(ch);
//const char* t =toString();
//cout<<t<<endl;
}
Word:: Word(char ch){
wd= new char(ch);
size = 1;
}
void Word::copy(const char * str){
wd=new char[strlen(str)+1];
check(wd!=NULL,"Heap overlow");
strcpy(wd,str);
size=strlen(wd);
}
void Word::check(bool b, const char * mess){
if(!b){
cout<<mess<<endl;
exit(1);
}
}
bool operator<(const Word &a,const Word &b){
return strcmp(a.wd,b.wd)<0;
}
bool operator>(const Word &a,const Word &b){
return strcmp(a.wd,b.wd)>0;
}
bool operator<=(const Word &a,const Word &b){
return strcmp(a.wd,b.wd)<=0;
}
bool operator>=(const Word &a,const Word &b){
return strcmp(a.wd,b.wd)>=0;
}
bool operator==(const Word &a,const Word &b){
return strcmp(a.wd,b.wd)==0;
}
bool operator!=(const Word &a,const Word &b){
return strcmp(a.wd,b.wd)!=0;
}
const Word & Word::operator=(const Word & w){
if(this!=&w){
copy(w.wd);
}
return *this;
}
char & Word:: operator[](int n){
check(n >= 0 && n < size,"Error: Word: operator []: int out of bounds");
return wd[n];
}
char Word:: operator[](int n)const{
check(n >= 0 && n < size,"Error: Word: operator []: int out of bounds");
return wd[n];
}
const int Word:: length()const{
return size;
}
char* Word:: toString()const{
char* ch;
ch = new char[size +1];
int i =0;
while(i<size){
ch[i] =wd[i];
i++;
}
ch[size] = '\0';
return ch;
}
int Word:: toInt(){
int num = 0;
for(int i = 0; i <= size; i++){
switch(wd[size-1- i]){
case '1':
num += (1*(pow(10,i)));
break;
case '2':
num += (2*(pow(10,i)));
break;
case '3':
num += (3*(pow(10,i)));
break;
case '4':
num += (4*(pow(10,i)));
break;
case '5':
num += (5*(pow(10,i)));
break;
case '6':
num += (6*(pow(10,i)));
break;
case '7':
num += (7*(pow(10,i)));
break;
case '8':
num += (8*(pow(10,i)));
break;
case '9':
num += (9*(pow(10,i)));
break;
case '0':
num += (0*(pow(10,i)));
break;
default://check(false,"Error: Word: toInt: string cannot be turned into int");
break;
}
//cout<<num<<endl;
}
return num;
}
Word Word:: fromInt(int i){
Word temp;
int tempI = i;
int intLength = 1;
while(tempI/10 > 0){
intLength++;
tempI = tempI / 10;
}
char *c =new char[intLength+1];
//cout<<i<<endl;
for(int j = 0; j <intLength; j++){
//problem line, for some reason c[j] is not being set to digit:
int digit = i/(int(pow(10,intLength-1-j)));
c[j] = digit + '0';
i = i%(int(pow(10,intLength-1-j)));
// cout<<i<<" "<<digit<<" "<<c[j]<<endl;
}
c[intLength]='\0';
temp.copy(c);
return temp;
}
istream & operator>>(istream &in,Word & w){
char *temp,ch;
int tempSize,loc;
tempSize=10;
temp=new char[tempSize+1];
Word::check(temp!=NULL,"Heap overflow");
ch=in.get();
loc=0;
while(in.good() && ch!='\n'){
if(loc==tempSize){
char *tempA;
tempA=new char[2*tempSize+1];
Word::check(tempA!=NULL,"Heap overflow");
for(int j=0;j<tempSize;j++)
tempA[j]=temp[j];
delete[]temp;
temp=tempA;
tempSize*=2;
}
temp[loc]=ch;
loc++;
ch=in.get();
}
temp[loc]='\0';
delete [] w.wd;
w.wd=temp;
w.size=strlen(temp);
return in;
}
ostream & operator<< (ostream &out,const Word &w){
for(int i = 0; i < w.length(); i++){
out<<w[i];
}
return out;
}
| [
"emilio@Emilios-MBP.cable.rcn.com"
] | emilio@Emilios-MBP.cable.rcn.com |
cc73a2b4d1d957f1bf577dd48765232e9678e481 | ab46744dd18e4dea747d75239e43ce971f89c7a4 | /c++_learning/sorting/insertionsort.cpp | 10a743baac010ea73c5748d426cfb87212f664fe | [] | no_license | Aaronsquires/algorithms | 43e033bcd2910317aee79fbd159edbb7b7bebaaa | 7340588786a9a79b417fa67c2c6f6e988c608d69 | refs/heads/master | 2023-03-28T17:28:13.578930 | 2021-03-25T12:03:22 | 2021-03-25T12:03:22 | 314,894,840 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,024 | cpp | #include<iostream>
using namespace std;
/*
Algorithm Structure
1. Assume the first element is already sorted
2. Select each element one by one
3. value = selected element. Index = index to insert the element in sorted sub-array
4. index = index of selected element
5. Compare it with elements in the sorted sub-array
6. shift all the elements greater than the selected element one place to the right
*/
// void insertion_sort(int UnsortedArray[])
// {
// int i, value, index;
// int n = sizeof(UnsortedArray);
// for(i=1; i<n; i++)
// {
// value = UnsortedArray[i];
// index = i;
// while(index > 0 && UnsortedArray[index -1]> value)
// {
// UnsortedArray[index] = UnsortedArray[index -1];
// index = index -1;
// }
// UnsortedArray[index] = value;
// }
// }
// int main ()
// {
// int UnsortedArray[5] = {4, 2, 5, 3, 1};
// insertion_sort(UnsortedArray);
// cout << UnsortedArray;
// return 0;
// } | [
"aaronsquires1@hotmail.com"
] | aaronsquires1@hotmail.com |
00c1af0252e66c6c2e1ace5042b58e127e37dca0 | 26b44414ec79f1fb6a501ec3a1ff7ba23d12983a | /ICDSMSCE/SystemMgr/DataTypeMgr.h | 19f379a36671bbd9ba3f6849fb2fcc0d30fa88b1 | [] | no_license | lwhay/ICDMS | d74d8f894d1b353e8dc00a0e6b98a9545b10077e | 3168d48fec96913a26b8a6a837b38dff1f70c8a3 | refs/heads/master | 2021-01-01T08:21:05.620874 | 2014-03-23T15:10:02 | 2014-03-23T15:10:02 | 17,953,721 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,195 | h | /**
* @file DataTypeMgr.h
* @date December 8, 2005
* @brief This file defines a symbol table storing pairs of string name and
integer ID for each data type. For example, <"int", 0>
* @author Mingsheng Hong (mshong@cs.cornell.edu)
*/
#ifndef _DATA_TYPE_MGR_H
#define _DATA_TYPE_MGR_H
#include "BasicDataStructure/Predicate/AttributeID.h"
using Cayuga::BasicDataStructure::Predicate::AttrTypeID;
#include "Utils/Singleton.h"
#include "Utils/ValueIDMap.h"
namespace Cayuga {
namespace SystemMgr {
#define VARIABLE_LENGTH 0xffff
using Cayuga::Utils::Singleton;
using Cayuga::Utils::ValueIDMap;
class DataTypeMgr;
/**
* @brief A DataTypeMgr object represents a symbol table storing pairs of
string name and integer ID for each data type.
* @author Mingsheng Hong (mshong@cs.cornell.edu)
* @date December 8, 2005
* @version 1.0
*/
class DataTypeMgr : public Singleton<DataTypeMgr> {
friend class Cayuga::Utils::Singleton<DataTypeMgr>;
public:
/**
* @brief Get the ID of a given type.
* @param typeName The type given to look up
* @return The ID of the input type
* @invariant The ID, type pair must exist
* @author Mingsheng Hong (mshong@cs.cornell.edu)
* @date December 8, 2005
* @version 1.0
*/
AttrTypeID getID(const string& typeName) const;
/**
* @brief Get the internal length of a given type. That is, if the type is
stored in the GC heap, the handle size will be returned. The size
of primitive types (those not handled by heap) is not affected.
* @param typeName The type given to look up
* @return The internal length of the input type
* @invariant The type must exist in the symbol table
* @author Mingsheng Hong (mshong@cs.cornell.edu)
* @date December 8, 2005
* @version 1.0
*/
unsigned getInternalLength(const string& typeName) const;
/**
* @brief Get the internal length of a given type. That is, if the type is
stored in the GC heap, the handle size will be returned. The size
of primitive types (those not handled by heap) is not affected.
* @param typeID The type given to look up
* @return The internal length of the input type
* @invariant The type must exist in the symbol table
* @author Mingsheng Hong (mshong@cs.cornell.edu)
* @date December 8, 2005
* @version 1.0
*/
unsigned getInternalLength(const AttrTypeID typeID) const;
/**
* @brief Get the name of a given type.
* @param typeID The type given to look up
* @return The string name of the input type
* @invariant The type must exist in the symbol table
* @author Mingsheng Hong (mshong@cs.cornell.edu)
* @date December 8, 2005
* @version 1.0
*/
string getName(const AttrTypeID typeID) const;
/**
* @brief Insert a type into the symbol table.
* @param typeName The name of the type
* @param typeLen The length of the type
* @param bIsComplexType Indicate whether this type is a complex type, define
to be a type that is not primitive. That is, a type handled in GC
heap.
* @author Mingsheng Hong (mshong@cs.cornell.edu)
* @date December 8, 2005
* @version 1.0
*/
void insertType(const string& typeName,
const unsigned typeLen,
const bool bIsComplexType = false
);
private:
/**
* @brief Query whether the given type is a complex type
* @param typeName The name of the type to query
* @return True iff the type is complex
* @author Mingsheng Hong (mshong@cs.cornell.edu)
* @date December 8, 2005
* @version 1.0
*/
bool isComplexType(const string& typeName) const;
/**
* @brief Query whether the given type is a complex type
* @param typeID The ID of the type to query
* @return True iff the type is complex
* @author Mingsheng Hong (mshong@cs.cornell.edu)
* @date December 8, 2005
* @version 1.0
*/
bool isComplexType(const AttrTypeID typeID) const;
/**
* This variable stores the map between type names and IDs
*/
ValueIDMap<string> _typeNameMgr;
/**
* This variable stores the length of types in the symbol table.
*/
vector<unsigned> _typeLengthMgr;
/**
* This variable indicates whether each type in the symbol table is complex.
*/
vector<bool> _complexTypeMgr;
}; //class DataTypeMgr
} //namespace SystemMgr
} //namespace Cayuga
#endif //_DATA_TYPE_MGR_H
| [
"lwh@whu.edu.cn"
] | lwh@whu.edu.cn |
c5c16132ac11550e9eb138712365dd6cc35e3f08 | 1a63c98b0e9b07e575319cf7eb21e6162bc71c2e | /src/c_genie.h | 3a396364638d6be029410850fe7a3e9262017362 | [
"BSD-3-Clause"
] | permissive | afcarl/genieclust | de4623bf44692b1af06682ebce640f063229e089 | 963502c8a2c7996cf31cadedef8b02ae91c4053f | refs/heads/master | 2022-06-19T23:09:36.508455 | 2020-05-09T11:50:11 | 2020-05-09T11:50:11 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 30,702 | h | /* The Genie++ Clustering Algorithm
*
* Copyright (C) 2018-2020 Marek Gagolewski (https://www.gagolewski.com)
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its
* contributors may be used to endorse or promote products derived from this
* software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
* OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef __c_genie_h
#define __c_genie_h
#include "c_common.h"
#include <algorithm>
#include <vector>
#include <deque>
#include <cmath>
#include "c_gini_disjoint_sets.h"
#include "c_int_dict.h"
#include "c_preprocess.h"
/*! Generate cluster hierarchy compatible with R's hclust().
*
* @param merge [out] fortran_contiguous??? array of size (n-1)*n
* @param order [out] array of length n
*/
// void HClustResult::generate_hierarchy_r(ssize_t* merge, ssize_t* order)
// {
// STOPIFNOT(curiter == n-1);
//
//
// // generate merge(n-1, 2)
//
// std::vector<size_t> elements(n+1, 0);
// std::vector<size_t> parents(n+1, 0);
//
// size_t clusterNumber = 1;
// for (size_t k=0; k<n-1; ++k, ++clusterNumber) {
// size_t i = (size_t)links(k, 0) + 1;
// size_t j = (size_t)links(k, 1) + 1;
// size_t si = elements[i];
// size_t sj = elements[j];
// elements[i] = clusterNumber;
// elements[j] = clusterNumber;
//
// if (si == 0)
// merge(k, 0) = -(double)i;
// else {
// while (parents[si] != 0) {
// size_t sinew = parents[si];
// parents[si] = clusterNumber;
// si = sinew;
// }
// if (si != 0) parents[si] = clusterNumber;
// merge(k,0) = (double)si;
// }
//
// if (sj == 0)
// merge(k, 1) = -(double)j;
// else {
// while (parents[sj] != 0) {
// size_t sjnew = parents[sj];
// parents[sj] = clusterNumber;
// sj = sjnew;
// }
// if (sj != 0) parents[sj] = clusterNumber;
// merge(k,1) = (double)sj;
// }
//
// if (merge(k, 0) < 0) {
// if (merge(k, 1) < 0 && merge(k, 0) < merge(k, 1)) std::swap(merge(k, 0), merge(k, 1));
// }
// else {
// if (merge(k, 0) > merge(k, 1)) std::swap(merge(k, 0), merge(k, 1));
// }
// }
//
//
// // generate order order(n, NA_REAL)
// std::vector< std::list<double> > relord(n+1);
// size_t clusterNumber = 1;
// for (size_t k=0; k<n-1; ++k, ++clusterNumber) {
// double i = merge(k, 0);
// if (i < 0)
// relord[clusterNumber].push_back(-i);
// else
// relord[clusterNumber].splice(relord[clusterNumber].end(), relord[(size_t)i]);
//
// double j = merge(k, 1);
// if (j < 0)
// relord[clusterNumber].push_back(-j);
// else
// relord[clusterNumber].splice(relord[clusterNumber].end(), relord[(size_t)j]);
// }
//
// STOPIFNOT(relord[n-1].size() == n);
// size_t k = 0;
// for (std::list<double>::iterator it = relord[n-1].begin();
// it != relord[n-1].end(); ++it) {
// order[k++] = (*it);
// }
// }
/*! Base class for CGenie and CGIc
*/
template <class T>
class CGenieBase {
protected:
/*! Stores the clustering result as obtained by
* CGenie::apply_genie() or CGIc::apply_gic()
*/
struct CGenieResult {
CGiniDisjointSets ds; /*!< ds at the last iteration, it;
* use denoise_index to obtain the final partition
*/
std::vector<ssize_t> links; //<! links[..] = index of merged mst_i
ssize_t it; //<! number of merges performed
ssize_t n_clusters; //<! maximal number of clusters requested
CGenieResult() { }
CGenieResult(ssize_t n, ssize_t noise_count, ssize_t n_clusters):
ds(n-noise_count), links(n-1, -1), it(0), n_clusters(n_clusters) { }
};
ssize_t* mst_i; /*!< n-1 edges of the MST,
* given by c_contiguous (n-1)*2 indices;
* (-1, -1) denotes a no-edge and will be ignored
*/
T* mst_d; //<! n-1 edge weights
ssize_t n; //<! number of points
bool noise_leaves;//<! mark leaves as noise points?
std::vector<ssize_t> deg; //<! deg[i] denotes the degree of the i-th vertex
ssize_t noise_count; //<! now many noise points are there (leaves)
std::vector<ssize_t> denoise_index; //<! which noise point is it?
std::vector<ssize_t> denoise_index_rev; //!< reverse look-up for denoise_index
CGenieResult results;
/*! When the Genie correction is on, some MST edges will be chosen
* in a non-consecutive order. An array-based skiplist will speed up
* searching within the to-be-consumed edges. Also, if there are
* noise points, then the skiplist allows the algorithm
* to naturally ignore edges that connect the leaves. */
void mst_skiplist_init(CIntDict<ssize_t>* mst_skiplist) {
// start with a list that skips all edges that lead to noise points
mst_skiplist->clear();
for (ssize_t i=0; i<this->n-1; ++i) {
GENIECLUST_ASSERT(this->mst_i[i*2+0] < this->n && this->mst_i[i*2+1] < this->n);
if (this->mst_i[i*2+0] < 0 || this->mst_i[i*2+1] < 0)
continue; // a no-edge -> ignore
if (!this->noise_leaves ||
(this->deg[this->mst_i[i*2+0]]>1 && this->deg[this->mst_i[i*2+1]]>1)) {
(*mst_skiplist)[i] = i; /*only the key is important, not the value*/
}
}
}
/** internal, used by get_labels(n_clusters, res) */
ssize_t get_labels(CGiniDisjointSets* ds, ssize_t* res) {
std::vector<ssize_t> res_cluster_id(n, -1);
ssize_t c = 0;
for (ssize_t i=0; i<n; ++i) {
if (this->denoise_index_rev[i] >= 0) {
// a non-noise point
ssize_t j = this->denoise_index[
ds->find(this->denoise_index_rev[i])
];
if (res_cluster_id[j] < 0) {
// new cluster
res_cluster_id[j] = c;
++c;
}
res[i] = res_cluster_id[j];
}
else {
// a noise point
res[i] = -1;
}
}
return c;
}
public:
CGenieBase(T* mst_d, ssize_t* mst_i, ssize_t n, bool noise_leaves)
: deg(n), denoise_index(n), denoise_index_rev(n)
{
this->mst_d = mst_d;
this->mst_i = mst_i;
this->n = n;
this->noise_leaves = noise_leaves;
for (ssize_t i=1; i<n-1; ++i)
if (mst_i[i] >= 0 && mst_i[i] >= 0 && mst_d[i-1] > mst_d[i])
throw std::domain_error("mst_d unsorted");
// set up this->deg:
Cget_graph_node_degrees(mst_i, n-1, n, this->deg.data());
// Create the non-noise points' translation table (for GiniDisjointSets)
// and count the number of noise points
if (noise_leaves) {
noise_count = 0;
ssize_t j = 0;
for (ssize_t i=0; i<n; ++i) {
if (deg[i] == 1) { // a leaf
++noise_count;
denoise_index_rev[i] = -1;
}
else { // a non-leaf
denoise_index[j] = i;
denoise_index_rev[i] = j;
++j;
}
}
GENIECLUST_ASSERT(noise_count >= 2);
GENIECLUST_ASSERT(j + noise_count == n);
}
else { // there are no noise points
this->noise_count = 0;
for (ssize_t i=0; i<n; ++i) {
denoise_index[i] = i; // identity
denoise_index_rev[i] = i;
}
}
}
/*! There can be at most n-noise_count singleton clusters
* in the hierarchy. */
ssize_t get_max_n_clusters() const {
return this->n - this->noise_count;
}
/*! Propagate res with clustering results.
*
* Noise points get cluster id of -1.
*
* @param n_clusters maximal number of clusters to find
* @param res [out] c_contiguous array of length n
*
* @return number of clusters detected (not including the noise cluster;
* can be less than n_clusters)
*/
ssize_t get_labels(ssize_t n_clusters, ssize_t* res) {
if (this->results.ds.get_n() <= 0)
throw std::runtime_error("Apply the clustering procedure first.");
if (n_clusters <= this->results.n_clusters) {
// use this->results.ds -- from the final iteration
return this->get_labels(&(this->results.ds), res);
}
else {
CGiniDisjointSets ds(this->get_max_n_clusters());
for (ssize_t it=0; it<this->get_max_n_clusters() - n_clusters; ++it) {
ssize_t j = (this->results.links[it]);
ssize_t i1 = this->mst_i[2*j+0];
ssize_t i2 = this->mst_i[2*j+1];
GENIECLUST_ASSERT(i1 >= 0 && i2 >= 0)
ds.merge(this->denoise_index_rev[i1], this->denoise_index_rev[i2]);
}
return this->get_labels(&ds, res);
}
}
/*! Propagate res with clustering results -
* all partitions from cardinality n_clusters to 1.
*
* Noise points get cluster id of -1.
*
* @param n_clusters maximal number of clusters to find
* @param res [out] c_contiguous matrix of shape (n_clusters+1, n)
*/
void get_labels_matrix(ssize_t n_clusters, ssize_t* res) {
if (this->get_max_n_clusters() < n_clusters) {
// there is nothing to do, no merge needed.
throw std::runtime_error("The requested number of clusters \
is too large with this many detected noise points");
}
if (this->results.ds.get_n() <= 0)
throw std::runtime_error("Apply the clustering procedure first.");
CGiniDisjointSets ds(this->get_max_n_clusters());
// you can do up to this->get_max_n_clusters() - 1 merges
ssize_t cur_cluster = n_clusters;
if (this->get_max_n_clusters() == n_clusters) {
cur_cluster--;
GENIECLUST_ASSERT(cur_cluster >= 0)
this->get_labels(&ds, &res[cur_cluster * this->n]);
}
for (ssize_t it=0; it<this->get_max_n_clusters() - 1; ++it) {
ssize_t j = (this->results.links[it]);
ssize_t i1 = this->mst_i[2*j+0];
ssize_t i2 = this->mst_i[2*j+1];
GENIECLUST_ASSERT(i1 >= 0 && i2 >= 0)
ds.merge(this->denoise_index_rev[i1], this->denoise_index_rev[i2]);
if (it >= this->get_max_n_clusters() - n_clusters - 1) {
cur_cluster--;
GENIECLUST_ASSERT(cur_cluster >= 0)
this->get_labels(&ds, &res[cur_cluster * this->n]);
}
}
GENIECLUST_ASSERT(cur_cluster == 0)
}
/*! Propagate res with clustering results -
* based on the current this->results.links.
*
* If there are noise points, not all elements in res will be set.
*
* @param res [out] c_contiguous array of length n-1,
* res[i] gives the index of the MST edge merged at the i-th iteration.
*
* @return number of items in res set (the array is padded with -1s)
*/
ssize_t get_links(ssize_t* res) {
if (this->results.ds.get_n() <= 0)
throw std::runtime_error("Apply the clustering procedure first.");
for (ssize_t i=0; i<this->results.it; ++i) {
res[i] = this->results.links[i];
}
for (ssize_t i=this->results.it; i<this->n-1; ++i) {
res[i] = -1;
}
return this->results.it;
}
/*! Set res[i] to true if the i-th point is a noise one.
*
* Makes sense only if noise_leaves==true
*
* @param res [out] array of length n
*/
void get_noise_status(bool* res) const {
for (ssize_t i=0; i<n; ++i) {
res[i] = (this->noise_leaves && this->deg[i] <= 1);
}
}
};
/*! The Genie++ Hierarchical Clustering Algorithm
*
* The Genie algorithm (Gagolewski et al., 2016) links two clusters
* in such a way that a chosen economic inequity measure
* (here, the Gini index) of the cluster sizes does not increase drastically
* above a given threshold. The method most often outperforms
* the Ward or average linkage, k-means, spectral clustering,
* DBSCAN, Birch and others in terms of the clustering
* quality on benchmark data while retaining the speed of the single
* linkage algorithm.
*
* This is a re-implementation of the original (Gagolewski et al., 2016)
* algorithm. First of all, given a pre-computed minimum spanning tree (MST),
* it only requires amortised O(n sqrt(n))-time.
* Additionally, MST leaves can be
* marked as noise points (if `noise_leaves==True`). This is useful,
* if the Genie algorithm is applied on the MST with respect to
* the HDBSCAN-like mutual reachability distance.
*
* Note that the input graph might be disconnected (spanning forest,
* but here we will call it MST anyway) - it must be acyclic though.
*
*
*
* References
* ===========
*
* Gagolewski M., Bartoszuk M., Cena A.,
* Genie: A new, fast, and outlier-resistant hierarchical clustering algorithm,
* Information Sciences 363, 2016, pp. 8-23. doi:10.1016/j.ins.2016.05.003
*/
template <class T>
class CGenie : public CGenieBase<T> {
protected:
/*! Run the Genie++ partitioning.
*
* @param ds
* @param mst_skiplist
* @param n_clusters maximal number of clusters to detect
* @param gini_threshold
* @param links [out] c_contiguous array of size (n-1),
* links[iter] = index of merged mst_i (up to the number of performed
* merges, see retval).
*
* @return The number of performed merges.
*/
ssize_t do_genie(CGiniDisjointSets* ds, CIntDict<ssize_t>* mst_skiplist,
ssize_t n_clusters, double gini_threshold, std::vector<ssize_t>* links)
{
if (this->get_max_n_clusters() < n_clusters) {
// there is nothing to do, no merge needed.
throw std::runtime_error("The requested number of clusters \
is too large with this many detected noise points");
}
// mst_skiplist contains all mst_i edge indexes
// that we need to consider, and nothing more.
GENIECLUST_ASSERT(!mst_skiplist->empty());
ssize_t lastidx = mst_skiplist->get_key_min();
ssize_t lastm = 0; // last minimal cluster size
ssize_t it = 0;
while (!mst_skiplist->empty() && it<this->get_max_n_clusters() - n_clusters) {
// determine the pair of vertices to merge
ssize_t i1;
ssize_t i2;
if (ds->get_gini() > gini_threshold) {
// the Genie correction for inequity of cluster sizes
ssize_t m = ds->get_smallest_count();
if (m != lastm || lastidx < mst_skiplist->get_key_min()) {
// need to start from the beginning of the MST skiplist
lastidx = mst_skiplist->get_key_min();
}
// else reuse lastidx
GENIECLUST_ASSERT(lastidx >= 0 && lastidx < this->n - 1);
GENIECLUST_ASSERT(this->mst_i[2*lastidx+0] >= 0 && this->mst_i[2*lastidx+1] >= 0);
// find the MST edge connecting a cluster of the smallest size
// with another one
while (ds->get_count(this->denoise_index_rev[this->mst_i[2*lastidx+0]]) != m
&& ds->get_count(this->denoise_index_rev[this->mst_i[2*lastidx+1]]) != m)
{
lastidx = mst_skiplist->get_key_next(lastidx);
GENIECLUST_ASSERT(lastidx >= 0 && lastidx < this->n - 1);
GENIECLUST_ASSERT(this->mst_i[2*lastidx+0] >= 0 && this->mst_i[2*lastidx+1] >= 0);
}
i1 = this->mst_i[2*lastidx+0];
i2 = this->mst_i[2*lastidx+1];
(*links)[it] = lastidx;
ssize_t delme = lastidx;
lastidx = mst_skiplist->get_key_next(lastidx);
mst_skiplist->erase(delme); // O(1)
lastm = m;
}
else { // single linkage-like
// note that we consume the MST edges in an non-decreasing order w.r.t. weights
ssize_t curidx = mst_skiplist->pop_key_min();
GENIECLUST_ASSERT(curidx >= 0 && curidx < this->n - 1);
i1 = this->mst_i[2*curidx+0];
i2 = this->mst_i[2*curidx+1];
(*links)[it] = curidx;
}
GENIECLUST_ASSERT(i1 >= 0 && i2 >= 0)
ds->merge(this->denoise_index_rev[i1], this->denoise_index_rev[i2]);
it++;
}
return it; // number of merges performed
}
public:
CGenie(T* mst_d, ssize_t* mst_i, ssize_t n, bool noise_leaves)
: CGenieBase<T>(mst_d, mst_i, n, noise_leaves)
{
;
}
CGenie() : CGenie(NULL, NULL, 0, false) { }
/*! Run the Genie++ algorithm
*
* @param n_clusters number of clusters to find, 1 for the complete hierarchy
* (warning: the algorithm might stop early if there are many noise points
* or the number of clusters to detect is > 1).
* @param gini_threshold the Gini index threshold
*/
void apply_genie(ssize_t n_clusters, double gini_threshold)
{
if (n_clusters < 1)
throw std::domain_error("n_clusters must be >= 1");
this->results = typename CGenieBase<T>::CGenieResult(this->n,
this->noise_count, n_clusters);
CIntDict<ssize_t> mst_skiplist(this->n - 1);
this->mst_skiplist_init(&mst_skiplist);
this->results.it = this->do_genie(&(this->results.ds), &mst_skiplist,
n_clusters, gini_threshold, &(this->results.links));
}
};
/*! GIc (Genie+Information Criterion) Hierarchical Clustering Algorithm
*
* GIc has been proposed by Anna Cena in [1] and was inspired
* by Mueller's (et al.) ITM [2] and Gagolewski's (et al.) Genie [3]
*
* References
* ==========
*
* [1] Cena A., Adaptive hierarchical clustering algorithms based on
* data aggregation methods, PhD Thesis, Systems Research Institute,
* Polish Academy of Sciences 2018.
*
* [2] Mueller A., Nowozin S., Lampert C.H., Information Theoretic
* Clustering using Minimum Spanning Trees, DAGM-OAGM 2012.
*
* [3] Gagolewski M., Bartoszuk M., Cena A.,
* Genie: A new, fast, and outlier-resistant hierarchical clustering algorithm,
* Information Sciences 363, 2016, pp. 8-23. doi:10.1016/j.ins.2016.05.003
*/
template <class T>
class CGIc : public CGenie<T> {
protected:
/*! Run the Genie++ algorithm with different thresholds for the Gini index
* and determine the intersection of all the resulting
* n_clusters-partitions; for this, we need the union of the
* set of MST edges that were left "unmerged".
*
* @param n_clusters number of clusters to look for in Genie run
* @param gini_thresholds array of floats in [0,1]
* @param n_thresholds size of gini_thresholds
*
* @return indexes of MST edges that were left unused by at least
* one Genie algorithm run; this gives the intersection of partitions.
* The resulting list will contain a sentinel, this->n - 1.
*
* If n_thresholds is 0 or the requested n_clusters is too large,
* all non-noise edges are set as unused.
*/
std::vector<ssize_t> get_intersection_of_genies(ssize_t n_clusters,
double* gini_thresholds, ssize_t n_thresholds)
{
std::vector<ssize_t> unused_edges;
if (n_thresholds == 0 || n_clusters >= this->get_max_n_clusters()) {
// all edges unused -> will start from n singletons
for (ssize_t i=0; i < this->n - 1; ++i) {
ssize_t i1 = this->mst_i[2*i+0];
ssize_t i2 = this->mst_i[2*i+1];
if (i1 < 0 || i2 < 0)
continue; // a no-edge -> ignore
if (!this->noise_leaves || (this->deg[i1] > 1 && this->deg[i2] > 1))
unused_edges.push_back(i);
}
unused_edges.push_back(this->n - 1); // sentinel
return unused_edges;
// EOF.
}
else {
// the same initial skiplist is used in each iter:
CIntDict<ssize_t> mst_skiplist_template(this->n-1);
this->mst_skiplist_init(&mst_skiplist_template);
for (ssize_t i=0; i<n_thresholds; ++i) {
double gini_threshold = gini_thresholds[i];
CGiniDisjointSets ds(this->get_max_n_clusters());
std::vector<ssize_t> links(this->n - 1, -1); // the history of edge merges
CIntDict<ssize_t> mst_skiplist(mst_skiplist_template);
this->do_genie(&ds, &mst_skiplist, n_clusters, gini_threshold,
&links);
// start where do_genie() concluded; add all remaining MST edges
// to the list of unused_edges
while (!mst_skiplist.empty())
unused_edges.push_back(mst_skiplist.pop_key_min());
}
// let unused_edges = sort(unique(unused_edges))
unused_edges.push_back(this->n - 1); // sentinel
std::sort(unused_edges.begin(), unused_edges.end());
// sorted, but some might not be unique, so let's remove dups
ssize_t k = 0;
for (ssize_t i=1; i<(ssize_t)unused_edges.size(); ++i) {
if (unused_edges[i] != unused_edges[k]) {
k++;
unused_edges[k] = unused_edges[i];
}
}
unused_edges.resize(k+1);
GENIECLUST_ASSERT(unused_edges[k] == this->n - 1);
return unused_edges;
}
}
public:
CGIc(T* mst_d, ssize_t* mst_i, ssize_t n, bool noise_leaves)
: CGenie<T>(mst_d, mst_i, n, noise_leaves)
{
;
}
CGIc() : CGIc(NULL, NULL, 0, false) { }
/*! Run the GIc (Genie+Information Criterion) algorithm
*
* @param n_clusters maximal number of clusters to find,
* 1 for the complete hierarchy (if possible)
* @param add_clusters number of additional clusters to work
* with internally
* @param n_features number of features (can be fractional)
* @param gini_thresholds array of size n_thresholds
* @param n_thresholds size of gini_thresholds
*/
void apply_gic(ssize_t n_clusters,
ssize_t add_clusters, double n_features,
double* gini_thresholds, ssize_t n_thresholds)
{
if (n_clusters < 1)
throw std::domain_error("n_clusters must be >= 1");
GENIECLUST_ASSERT(add_clusters>=0);
GENIECLUST_ASSERT(n_thresholds>=0);
std::vector<ssize_t> unused_edges = get_intersection_of_genies(
n_clusters+add_clusters, gini_thresholds, n_thresholds
);
// note that the unused_edges list:
// 1. does not include noise edges;
// 2. is sorted (strictly) increasingly
// 3. contains a sentinel element at the end == n-1
this->results = typename CGenieBase<T>::CGenieResult(this->n,
this->noise_count, n_clusters);
// Step 1. Merge all used edges (used by all the Genies)
// There are of course many possible merge orders that we could consider
// here. We will rely on the current ordering of the MST edges,
// which is wrt non-decreasing mst_d.
ssize_t cur_unused_edges = 0;
ssize_t num_unused_edges = unused_edges.size()-1; // ignore sentinel
std::vector<ssize_t> cluster_sizes(this->get_max_n_clusters(), 1);
std::vector<T> cluster_d_sums(this->get_max_n_clusters(), (T)0.0);
this->results.it = 0;
for (ssize_t i=0; i<this->n - 1; ++i) {
GENIECLUST_ASSERT(i<=unused_edges[cur_unused_edges]);
if (unused_edges[cur_unused_edges] == i) {
// ignore current edge and advance to the next unused edge
cur_unused_edges++;
continue;
}
ssize_t i1 = this->mst_i[2*i+0];
ssize_t i2 = this->mst_i[2*i+1];
if (i1 < 0 || i2 < 0)
continue; // a no-edge -> ignore
if (!this->noise_leaves || (this->deg[i1] > 1 && this->deg[i2] > 1)) {
GENIECLUST_ASSERT(this->results.it < this->n-1);
this->results.links[this->results.it++] = i;
i1 = this->results.ds.find(this->denoise_index_rev[i1]);
i2 = this->results.ds.find(this->denoise_index_rev[i2]);
if (i1 > i2) std::swap(i1, i2);
this->results.ds.merge(i1, i2);
// new parent node is i1
cluster_sizes[i1] += cluster_sizes[i2];
cluster_d_sums[i1] += cluster_d_sums[i2] + this->mst_d[i];
cluster_sizes[i2] = 0;
cluster_d_sums[i2] = INFTY;
}
}
GENIECLUST_ASSERT(cur_unused_edges == num_unused_edges); // sentinel
GENIECLUST_ASSERT(unused_edges[num_unused_edges] == this->n-1); // sentinel
GENIECLUST_ASSERT(num_unused_edges+1 == this->results.ds.get_k());
// Step 2. Merge all used edges
/* The objective function - Information Criterion - to MAXIMISE is
sum_{i in ds.parents()} -cluster_sizes[i] * (
n_features * log cluster_sizes[i]
-(n_features-1) * log cluster_d_sums[i]
)
*/
while (num_unused_edges > 0 && this->results.it<this->get_max_n_clusters() - n_clusters) {
ssize_t max_which = -1;
double max_obj = -INFTY;
for (ssize_t j=0; j<num_unused_edges; ++j) {
ssize_t i = unused_edges[j];
ssize_t i1 = this->mst_i[2*i+0];
ssize_t i2 = this->mst_i[2*i+1];
GENIECLUST_ASSERT(i1 >= 0 && i2 >= 0);
i1 = this->results.ds.find(this->denoise_index_rev[i1]);
i2 = this->results.ds.find(this->denoise_index_rev[i2]);
if (i1 > i2) std::swap(i1, i2);
GENIECLUST_ASSERT(i1 != i2);
// singletons should be merged first
// (we assume that they have cluster_d_sums==Inf
// (this was not addressed in Mueller's in his paper)
if (cluster_d_sums[i1] < 1e-12 || cluster_d_sums[i2] < 1e-12) {
max_which = j;
break;
}
double cur_obj = -(cluster_sizes[i1]+cluster_sizes[i2])*(
n_features*log(cluster_d_sums[i1]+cluster_d_sums[i2]+this->mst_d[i])
-(n_features-1.0)*log(cluster_sizes[i1]+cluster_sizes[i2])
);
cur_obj += cluster_sizes[i1]*(
n_features*log(cluster_d_sums[i1])
-(n_features-1.0)*log(cluster_sizes[i1])
);
cur_obj += cluster_sizes[i2]*(
n_features*log(cluster_d_sums[i2])
-(n_features-1.0)*log(cluster_sizes[i2])
);
GENIECLUST_ASSERT(std::isfinite(cur_obj));
if (cur_obj > max_obj) {
max_obj = cur_obj;
max_which = j;
}
}
GENIECLUST_ASSERT(max_which >= 0 && max_which < num_unused_edges);
ssize_t i = unused_edges[max_which];
GENIECLUST_ASSERT(this->results.it < this->n - 1);
this->results.links[this->results.it++] = i;
ssize_t i1 = this->mst_i[2*i+0];
ssize_t i2 = this->mst_i[2*i+1];
GENIECLUST_ASSERT(i1 >= 0 && i2 >= 0);
i1 = this->results.ds.find(this->denoise_index_rev[i1]);
i2 = this->results.ds.find(this->denoise_index_rev[i2]);
if (i1 > i2) std::swap(i1, i2);
this->results.ds.merge(i1, i2);
// new parent node is i1
cluster_sizes[i1] += cluster_sizes[i2];
cluster_d_sums[i1] += cluster_d_sums[i2]+this->mst_d[i];
cluster_sizes[i2] = 0;
cluster_d_sums[i2] = INFTY;
unused_edges[max_which] = unused_edges[num_unused_edges-1];
num_unused_edges--;
}
}
};
#endif
| [
"m.gagolewski@gmail.com"
] | m.gagolewski@gmail.com |
2112eb9ab705856a8961c0a0fd9ee11e271c6871 | 7b4bb96059896a951eddee83349cdca0cdde8919 | /Engine/catmull-rom.cpp | d0138dd74610acb236b604fc799cf9ec4a0aae85 | [] | no_license | ricardobp97/CG-Practical-Assignment | ce7e6a76ce67a4a18eb80b19ad0671db0bda9cb6 | c8ed0eda1d20ff502a58c7f6364a495ffccff228 | refs/heads/master | 2020-04-23T04:11:13.992834 | 2019-05-16T15:28:12 | 2019-05-16T15:28:12 | 170,901,391 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,023 | cpp | #define _USE_MATH_DEFINES
#include <math.h>
#include <map>
void buildRotMatrix(float *x, float *y, float *z, float *m) {
m[0] = x[0];
m[1] = x[1];
m[2] = x[2];
m[3] = 0;
m[4] = y[0];
m[5] = y[1];
m[6] = y[2];
m[7] = 0;
m[8] = z[0];
m[9] = z[1];
m[10] = z[2];
m[11] = 0;
m[12] = 0;
m[13] = 0;
m[14] = 0;
m[15] = 1;
}
void cross(float *a, float *b, float *res) {
res[0] = a[1] * b[2] - a[2] * b[1];
res[1] = a[2] * b[0] - a[0] * b[2];
res[2] = a[0] * b[1] - a[1] * b[0];
}
void normalize(float *a) {
float l = sqrt(a[0] * a[0] + a[1] * a[1] + a[2] * a[2]);
a[0] = a[0] / l;
a[1] = a[1] / l;
a[2] = a[2] / l;
}
float length(float *v) {
float res = sqrt(v[0] * v[0] + v[1] * v[1] + v[2] * v[2]);
return res;
}
void multMatrixVector(float *m, float *v, float *res) {
for (int j = 0; j < 4; ++j) {
res[j] = 0;
for (int k = 0; k < 4; ++k) {
res[j] += v[k] * m[j * 4 + k];
}
}
}
void getCatmullRomPoint(float t, float *p0, float *p1, float *p2, float *p3, float *pos, float *deriv) {
// catmull-rom matrix
float m[4][4] = {{-0.5f, 1.5f, -1.5f, 0.5f},
{1.0f, -2.5f, 2.0f, -0.5f},
{-0.5f, 0.0f, 0.5f, 0.0f},
{0.0f, 1.0f, 0.0f, 0.0f}};
// Compute A = M * P
float ax[4];
float ay[4];
float az[4];
float px[4] = {p0[0], p1[0], p2[0], p3[0]};
float py[4] = {p0[1], p1[1], p2[1], p3[1]};
float pz[4] = {p0[2], p1[2], p2[2], p3[2]};
multMatrixVector((float *) m, px, ax);
multMatrixVector((float *) m, py, ay);
multMatrixVector((float *) m, pz, az);
// Compute pos = T * A
float T[4] = {t * t * t, t * t, t, 1};
pos[0] = ax[0] * T[0] + ax[1] * T[1] + ax[2] * T[2] + ax[3] * T[3];
pos[1] = ay[0] * T[0] + ay[1] * T[1] + ay[2] * T[2] + ay[3] * T[3];
pos[2] = az[0] * T[0] + az[1] * T[1] + az[2] * T[2] + az[3] * T[3];
// compute deriv = T' * A
float Td[4] = {3 * t * t, 2 * t, 1, 0};
deriv[0] = ax[0] * Td[0] + ax[1] * Td[1] + ax[2] * Td[2] + ax[3] * Td[3];
deriv[1] = ay[0] * Td[0] + ay[1] * Td[1] + ay[2] * Td[2] + ay[3] * Td[3];
deriv[2] = az[0] * Td[0] + az[1] * Td[1] + az[2] * Td[2] + az[3] * Td[3];
}
/** given global t, returns the point in the curve **/
void getGlobalCatmullRomPoint(float gt, float *pos, float *deriv, std::map<int, float *> p) {
unsigned long POINT_COUNT = p.size();
float t = gt * POINT_COUNT; // this is the real global t
int index = floor(t); // which segment
t = t - index; // where within the segment
// indices store the points
int indices[4];
indices[0] = (index + POINT_COUNT - 1) % POINT_COUNT;
indices[1] = (indices[0] + 1) % POINT_COUNT;
indices[2] = (indices[1] + 1) % POINT_COUNT;
indices[3] = (indices[2] + 1) % POINT_COUNT;
getCatmullRomPoint(t, p.at(indices[0]), p.at(indices[1]), p.at(indices[2]), p.at(indices[3]), pos, deriv);
} | [
"andre.tiago.at@gmail.com"
] | andre.tiago.at@gmail.com |
4b1c922cd6b1510052f34bc396bcedd374a42c1f | 4d107a97633559963f6510767bb9297febbcbb02 | /applications/DEM_application/custom_utilities/analytic_tools/analytic_watcher.h | d07521ecf8fa7ee232765ef6109f8bfb8a856a57 | [] | no_license | asroy/Kratos | 45dc4a9ad77a2b203ab2e0c6c5fe030633433181 | e89d6808670d4d645319c7678da548b37825abe3 | refs/heads/master | 2021-03-24T13:28:43.618915 | 2017-12-19T15:38:20 | 2017-12-19T15:38:20 | 102,793,791 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,388 | h | // $Author: Guillermo Casas
#ifndef ANALYTIC_WATCHER
#define ANALYTIC_WATCHER
// System includes
#include <limits>
#include <iostream>
#include <iomanip>
// Project includes
#include "includes/define.h"
#include "../../custom_elements/spheric_particle.h"
/* External includes */
#ifdef _OPENMP
#include <omp.h>
#endif
#include "boost/python/list.hpp"
namespace Kratos
{
class AnalyticWatcher {
public:
KRATOS_CLASS_POINTER_DEFINITION(AnalyticWatcher);
/// Default constructor
AnalyticWatcher(){}
/// Destructor
virtual ~AnalyticWatcher(){}
static void ClearList(boost::python::list& my_list) // its best to pass empty lists in the first place to avoid this operation
{
while (len(my_list)){
my_list.pop(); // only way I found to remove all entries
}
}
virtual void ClearData(){}
virtual void MakeMeasurements(ModelPart& r_model_part){}
/// Turn back information as a string
virtual std::string Info() const {return "AnalyticWatcher";}
/// Print information about this object
virtual void PrintInfo(std::ostream& rOStream) const {}
/// Print object's data
virtual void PrintData(std::ostream& rOStream) const {}
virtual void Record(SphericParticle* p_particle, ModelPart& r_model_part){}
/// Assignment operator
AnalyticWatcher & operator=(AnalyticWatcher const& rOther);
}; // Class AnalyticWatcher
} // namespace Kratos.
#endif // ANALYTIC_WATCHER
| [
"cgguillem@gmail.com"
] | cgguillem@gmail.com |
610d3caa4974624fc90547912536d5560a287fc9 | f6d875335fd1384412a95596c32c61ff4863927e | /Keshav/Array/Kth_smallest_element.cpp | 2e708c1728ce9c25e2435f00f3ee50f0f2f801a6 | [] | no_license | alpha951/450_DSA | 7803d14263cf6e76cba0ecf92476bfda967eb107 | 11d206d2986069a3e1f492935f493dd1eef87f01 | refs/heads/main | 2023-07-03T17:59:06.454278 | 2021-08-11T17:33:43 | 2021-08-11T17:33:43 | 394,935,643 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 334 | cpp | #include <bits/stdc++.h>
using namespace std;
int kthsmallest(int a[], int n, int k)
{
int number = 0;
sort(a, a + n);
number = a[k - 1];
return number;
}
int main()
{
int a[] = {7, 10, 4, 3, 20, 15};
int n = sizeof(a) / sizeof(int);
int k;
cin >> k;
cout << kthsmallest(a, n, k);
return 0;
} | [
"20uec068@lnmiit.ac.in"
] | 20uec068@lnmiit.ac.in |
db01ba3a7d1e61da9d14dad0d69a830a444b298d | b2b83f1c59d6bdf0673588a3f1d310e849ab9161 | /Sorting/quick sort.cpp | 06f0363cb7c4b6740b1f21a30853a999ce2d86d2 | [
"MIT"
] | permissive | dalalsunil1986/Common-coding-puzzles | ac735841697715b406973dcd38d3dc7b280e7713 | c9a73c0ff2abc7e0acdb53e545bb219eeeb23421 | refs/heads/master | 2023-07-03T07:25:55.091004 | 2021-08-15T11:11:16 | 2021-08-15T11:11:16 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 623 | cpp | #include <vector>
using namespace std;
void _qsort( vector<int>& m, int st, int ed )
{
if ( st >= ed ) { return; }
int pvt(st), L(st+1), R(ed);
while( R >= L )
{
if ( m.at(L) > m.at(pvt) &&
m.at(R) < m.at(pvt) ) { std::swap( m[L], m[R] ); }
if ( m.at(L) <= m.at(pvt) ) { L++; }
if ( m.at(R) >= m.at(pvt) ) { R--; }
}
std::swap( m[pvt], m[R] );
if ( R - 1 - st < ed - R - 1 )
{
_qsort(m, st , R-1);
_qsort(m, R+1, ed );
}
else
{
_qsort(m, R+1, ed );
_qsort(m, st , R-1);
}
}
vector<int> quickSort(vector<int> array) {
_qsort( array, 0, array.size() - 1 );
return array;
}
| [
"mericLuc@hotmail.fr"
] | mericLuc@hotmail.fr |
2d0950875008de6f8517055fe4881a93d3194e20 | 91a882547e393d4c4946a6c2c99186b5f72122dd | /Source/XPSP1/NT/ds/adsi/router/ccolinfo.hxx | d9e8af19b48d7577354de9cbb528c81175311f10 | [] | no_license | IAmAnubhavSaini/cryptoAlgorithm-nt5src | 94f9b46f101b983954ac6e453d0cf8d02aa76fc7 | d9e1cdeec650b9d6d3ce63f9f0abe50dabfaf9e2 | refs/heads/master | 2023-09-02T10:14:14.795579 | 2021-11-20T13:47:06 | 2021-11-20T13:47:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,251 | hxx | //-----------------------------------------------------------------------------
//
// Microsoft Windows
// Copyright (C) Microsoft Corporation, 1992 - 1995.
//
// File: ccolinfo.hxx
//
// Contents: ColumnsInfo class Declaration
//
// Functions:
//
// Notes:
//
//
// History: 07/10/96 | RenatoB | Created, lifted most from EricJ
// code
//-----------------------------------------------------------------------------
#ifndef _CCOLINFO_H_
#define _CCOLINFO_H_
#ifndef PUBLIC
#define PUBLIC
#endif
#ifndef PROTECTED
#define PROTECTED
#endif
#ifndef PRIVATE
#define PRIVATE
#endif
//-----------------------------------------------------------------------------
// @class CLdap_ColumnsInfo | Implements IColumnsInfo for LDAP providers
// The only purpose of this class is to hook up CColInfo to
// CLdap_RowProvider, and maintain proper reference counts.
// All the work is done in CColInfo.
// We always delegate to CLdap_RowProvider.
//-----------------------------------------------------------------------------
class CLdap_ColumnsInfo : public IColumnsInfo // public | IColumnsInfo
{
public: // public functions
CLdap_ColumnsInfo( CLdap_RowProvider *pObj);
~CLdap_ColumnsInfo();
STDMETHODIMP_(ULONG) AddRef(void);
STDMETHODIMP_(ULONG) Release(void);
STDMETHODIMP QueryInterface(REFIID riid, LPVOID *ppv);
// @cmember Get column info
STDMETHODIMP
GetColumnInfo(
DBORDINAL *pcColumns,
DBCOLUMNINFO **prgInfo,
WCHAR **ppStringsBuffer
);
// @cmember Map Column IDs
// NOTE: AutoDoc cannot parse this correctly.
STDMETHODIMP
MapColumnIDs(
DBORDINAL cColumnIDs,
const DBID rgColumnIDs[],
DBORDINAL rgColumns[]
);
// @cmember Set CColInfo object.
STDMETHODIMP
FInit(
DBORDINAL cColumns,
DBCOLUMNINFO *rgInfo,
OLECHAR *pStringsBuffer
);
private: //@access private data
CLdap_RowProvider *m_pObj; //@cmember base object
DBCOLUMNINFO* m_ColInfo ; //@cmember columns info object
DBORDINAL m_cColumns;
IMalloc *m_pMalloc;
OLECHAR *m_pwchBuf;
};
#endif //_CCOLINFO_H_
| [
"support@cryptoalgo.cf"
] | support@cryptoalgo.cf |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.