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 986 values | visit_date timestamp[us] | revision_date timestamp[us] | committer_date timestamp[us] | github_id int64 3.89k 681M ⌀ | star_events_count int64 0 209k | fork_events_count int64 0 110k | gha_license_id stringclasses 23 values | gha_event_created_at timestamp[us] | gha_created_at timestamp[us] | gha_language stringclasses 145 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 122 values | content stringlengths 3 10.4M | authors listlengths 1 1 | author_id stringlengths 0 158 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
316448e2f7d80cdf2157848add5df50b63cb69d9 | 560659d09dbc09eadbac35ce42e4653bfddb7df8 | /BSDSBench/source/Random.hh | cfce766c0b3c6be56366746819d4d3d292e28ecc | [] | no_license | bygreencn/FLIC | 44a941a44f5eb44b86aa95ed3aa65f868a8e8c2d | 8d01146fe0a405c68ca80e53f6d9c5f37f892d13 | refs/heads/master | 2020-03-25T09:19:10.289530 | 2018-04-14T11:47:52 | 2018-04-14T11:47:52 | 143,659,341 | 1 | 0 | null | 2018-08-06T00:57:57 | 2018-08-06T00:57:57 | null | UTF-8 | C++ | false | false | 4,015 | hh |
#ifndef __Random_hh__
#define __Random_hh__
// Copyright (C) 2002 David R. Martin <dmartin@eecs.berkeley.edu>
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; either version 2 of the
// License, or (at your option) any later version.
//
// This program is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
// 02111-1307, USA, or see http://www.gnu.org/copyleft/gpl.html.
#include <assert.h>
#include <stdlib.h>
#include <math.h>
#include <stdio.h>
#include <random>
#include <Windows.h>
#include <stdint.h>
// All random numbers are generated from a single seed. This is true
// even when private random streams (seperate from the global
// Random::rand stream) are spawned from existing streams, since the new
// streams are seeded automatically from the parent's random stream.
// Any random stream can be reset so that a sequence of random values
// can be replayed.
// If seed==0, then the seed is generated from the system clock.
typedef int int32_t;
typedef unsigned int u_int32_t;
typedef unsigned long long u_int64_t;
typedef unsigned short u_int16_t;
/*
typedef struct timeval {
long tv_sec;
long tv_usec;
} timeval;
*/
class Random
{
public:
static Random rand;
std::default_random_engine generator;
double erand48(u_int16_t *_xsubi);
int gettimeofday(struct timeval * tp, struct timezone *tzp);
// These are defined in <limits.h> as the limits of int, but
// here we need the limits of int32_t.
static const int32_t int32_max = 2147483647;
static const int32_t int32_min = -int32_max-1;
static const u_int32_t u_int32_max = 4294967295u;
// Seed from the system clock.
Random ();
// Specify seed.
// If zero, seed from the system clock.
Random (u_int64_t seed);
// Spawn off a new random stream seeded from the parent's stream.
Random (Random& that);
// Restore initial seed so we can replay a random sequence.
void reset ();
// Set the seed.
// If zero, seed from the system clock.
void reseed (u_int64_t seed);
// double in [0..1) or [a..b)
inline double fp ();
inline double fp (double a, double b);
// 32-bit signed integer in [-2^31,2^31) or [a..b]
inline int32_t i32 ();
inline int32_t i32 (int32_t a, int32_t b);
// 32-bit unsigned integer in [0,2^32) or [a..b]
inline u_int32_t ui32 ();
inline u_int32_t ui32 (u_int32_t a, u_int32_t b);
protected:
void _init (u_int64_t seed);
// The original seed for this random stream.
u_int64_t _seed;
// The current state for this random stream.
u_int16_t _xsubi[3];
};
inline u_int32_t
Random::ui32 ()
{
return ui32(0,u_int32_max);
}
inline u_int32_t
Random::ui32 (u_int32_t a, u_int32_t b)
{
assert (a <= b);
double x = fp ();
return (u_int32_t) floor (x * ((double)b - (double)a + 1) + a);
}
inline int32_t
Random::i32 ()
{
return i32(int32_min,int32_max);
}
inline int32_t
Random::i32 (int32_t a, int32_t b)
{
assert (a <= b);
double x = fp ();
return (int32_t) floor (x * ((double)b - (double)a + 1) + a);
}
inline double
Random::fp ()
{
return erand48 (_xsubi);
}
inline double
Random::fp (double a, double b)
{
assert (a < b);
return erand48 (_xsubi) * (b - a) + a;
}
#endif // __Random_hh__
| [
"zhaojiaxing@mail.nankai.edu.cn"
] | zhaojiaxing@mail.nankai.edu.cn |
ae85278925c2a47b0381b5bf1bc0f3844d35618a | 74ff14608a3c91fbe650ed1039c3036ae17ded89 | /Data-Structures/Linked_List/Doubly/doubly.cpp | f15a33d15b7600896f01e237f5ffa402e2ef8d8e | [] | no_license | sooryaprakash31/ProgrammingBasics | 92fe1d9fb3d90283e7474c74db2b73091a53e462 | e46c2b7dbe35d6226120ce73d609a29e9d36e6e4 | refs/heads/master | 2023-02-10T01:32:27.071046 | 2021-01-06T18:24:08 | 2021-01-06T18:24:08 | 289,292,107 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,673 | cpp | /*
Doubly Linked List:
- A linear data structure in which the elements are not stored in
contiguous memory locations.
- Doubly Linked List contains an extra pointer to keep track of the previous
node to a particular node.
Representation:
previous|data|next <---> previous|data|next <---> previous|data|next
Advantages:
- Can be traversed from both direction
- Deletion of node is efficient if the pointer to node is known
Operations:
1. Append()
2. Prepend()
3. InsertAt()
4. DeleteAt()
5. PrintAll()
*/
#include<iostream>
using namespace std;
class Node{
public:
int data;
Node * next;
Node * previous;
Node(){
data = 0;
next = NULL;
previous = NULL;
}
};
class DoublyLinkedList{
public:
Node * head;
DoublyLinkedList(){
head = NULL;
}
DoublyLinkedList(Node * node){
head = node;
}
//appends the node at the end of the list
void appendNode(Node * node){
if(head==NULL){
head = node;
}
else{
Node * ptr = head;
//traversing to the end of the list
while(ptr->next!=NULL){
ptr = ptr->next;
}
ptr->next = node;
node->previous = ptr;
node->next = NULL;
}
cout<<"Appended!\n";
}
//prepends the node at the beginning of the list
void prependNode(Node * node){
head->previous = node;
node->next = head;
head = node;
cout<<"Prepended!\n";
}
//inserts node at a position
void insertAt(Node * node, int pos){
if (head==NULL){
cout<<"Position does not exist\n";
}
else{
if(pos==0){
head->previous = node;
node->next = head;
head = node;
}
else{
Node * ptr = head;
int count = 1;
//traversing to the position
while(count<pos){
ptr=ptr->next;
if(ptr==NULL){
cout<<"Position does not exist\n";
return;
}
count++;
}
node->next = ptr->next;
node->previous = ptr;
ptr->next = node;
}
}
cout<<"Inserted\n";
}
//deletes the node at a position
void deleteAt(int pos){
if (head==NULL){
cout<<"Position does not exist\n";
}
else{
if(pos==0){
head = head->next;
head->previous = NULL;
}
else{
Node * ptr = head;
int count = 1;
//traversing to the position
while(count!=pos){
ptr=ptr->next;
if(ptr==NULL){
cout<<"Position does not exist\n";
return;
}
count++;
}
ptr->next = ptr->next->next;
ptr->next->previous = ptr;
}
}
cout<<"Deleted!\n";
}
//prints all the nodes
void printAll(){
if(head==NULL){
cout<<"Empty list\n";
}
else{
//Traversing the nodes until the next of a node is NULL
Node * ptr = head;
while(ptr!=NULL){
cout<<ptr->data<<" ";
ptr=ptr->next;
}
cout<<"\n";
}
}
};
int main(){
DoublyLinkedList d;
int choice,data,position;
do{
cout<<"\n1. Append\t2. Prepend\t3.InsertAt\t4. DeleteAt\t5. PrintAll\t6.Stop\n";
cin>>choice;
Node * node = new Node();
switch (choice)
{
case 1:
cout<<"Enter data ";
cin>>node->data;
d.appendNode(node);
break;
case 2:
cout<<"Enter data ";
cin>>node->data;
d.prependNode(node);
break;
case 3:
cout<<"Enter data ";
cin>>node->data;
cout<<"\nEnter position ";
cin>>position;
d.insertAt(node,position);
break;
case 4:
cout<<"Enter position ";
cin>>position;
d.deleteAt(position);
break;
case 5:
d.printAll();
break;
default:
break;
}
}while(choice!=6);
return 0;
} | [
"sooryaprakash.r31@gmail.com"
] | sooryaprakash.r31@gmail.com |
bec48977bb48d90e928ac64e49382539f61b9648 | bbdb7a5e36e494574098ed6de85b38d69888fe90 | /blasr-master/alignment/Blasr.cpp | ee1347fbce5e04cae0ef110d997c23894731939b | [] | no_license | chenwi/reference | 5294ee65d75b17a0365f56a198aab3add3e70920 | 7ce094b12b2d76be18f9f07286c61e481bc03c6e | refs/heads/master | 2021-07-20T01:16:39.719966 | 2017-10-27T11:39:06 | 2017-10-27T11:39:06 | 103,332,774 | 0 | 0 | null | 2017-09-18T15:09:40 | 2017-09-13T00:07:27 | null | UTF-8 | C++ | false | false | 185,306 | cpp | #include <string>
#include <iostream>
#include <vector>
#include <set>
#include <sstream>
#include <pthread.h>
#include <stdlib.h>
#include <time.h>
#include <signal.h>
#include <execinfo.h>
#include <algorithm>
#include "MappingIPC.h"
#include "MappingSemaphores.h"
#include "CCSSequence.h"
#include "SMRTSequence.h"
#include "FASTASequence.h"
#include "FASTAReader.h"
#include "SeqUtils.h"
#include "defs.h"
#include "utils.h"
#include "tuples/DNATuple.h"
#include "tuples/HashedTupleList.h"
#include "algorithms/compare/CompareStrings.h"
#include "algorithms/alignment.h"
#include "algorithms/alignment/AffineKBandAlign.h"
#include "algorithms/alignment/GuidedAlign.h"
#include "algorithms/alignment/AffineGuidedAlign.h"
#include "algorithms/alignment/FullQVAlign.h"
#include "algorithms/alignment/ExtendAlign.h"
#include "algorithms/alignment/OneGapAlignment.h"
#include "algorithms/alignment/AlignmentUtils.h"
#include "algorithms/alignment/DistanceMatrixScoreFunction.h"
#include "algorithms/alignment/StringToScoreMatrix.h"
#include "algorithms/alignment/AlignmentFormats.h"
#include "algorithms/anchoring/LISPValue.h"
#include "algorithms/anchoring/LISPValueWeightor.h"
#include "algorithms/anchoring/LISSizeWeightor.h"
#include "algorithms/anchoring/LISQValueWeightor.h"
#include "algorithms/anchoring/FindMaxInterval.h"
#include "algorithms/anchoring/MapBySuffixArray.h"
#include "algorithms/anchoring/ClusterProbability.h"
#include "algorithms/anchoring/BWTSearch.h"
#include "datastructures/metagenome/SequenceIndexDatabase.h"
#include "datastructures/metagenome/TitleTable.h"
#include "datastructures/suffixarray/SharedSuffixArray.h"
#include "datastructures/suffixarray/SuffixArrayTypes.h"
#include "datastructures/tuplelists/TupleCountTable.h"
#include "datastructures/anchoring/WeightedInterval.h"
#include "datastructures/anchoring/AnchorParameters.h"
#include "datastructures/alignment/AlignmentCandidate.h"
#include "datastructures/alignment/AlignmentBlock.h"
#include "datastructures/alignment/AlignmentContext.h"
#include "datastructures/mapping/MappingMetrics.h"
#include "datastructures/reads/ReadInterval.h"
#include "utils/FileOfFileNames.h"
#include "utils/RegionUtils.h"
#include "qvs/QualityTransform.h"
#include "files/ReaderAgglomerate.h"
#include "files/CCSIterator.h"
#include "files/FragmentCCSIterator.h"
#include "data/hdf/HDFRegionTableReader.h"
#include "datastructures/bwt/BWT.h"
#include "datastructures/sequence/PackedDNASequence.h"
#include "CommandLineParser.h"
#include "qvs/QualityValue.h"
#include "statistics/pdfs.h"
#include "statistics/cdfs.h"
#include "statistics/statutils.h"
#include "statistics/LookupAnchorDistribution.h"
#include "algorithms/anchoring/PiecewiseMatch.h"
#define MAX_PHRED_SCORE 254
#define MAPQV_END_ALIGN_WIGGLE 5
#ifdef USE_GOOGLE_PROFILER
#include "google/profiler.h"
#endif
using namespace std;
MappingSemaphores semaphores;
/*
* Declare global structures that are shared between threads.
*/
ostream *outFilePtr;
HDFRegionTableReader *regionTableReader;
typedef SMRTSequence T_Sequence;
typedef FASTASequence T_GenomeSequence;
typedef DNASuffixArray T_SuffixArray;
typedef DNATuple T_Tuple;
typedef LISPValueWeightor<T_GenomeSequence, DNATuple, vector<ChainedMatchPos> > PValueWeightor;
//typedef LISSMatchFrequencyPValueWeightor<T_GenomeSequence, DNATuple, vector<ChainedMatchPos> > MultiplicityPValueWeightor;
ReaderAgglomerate *reader;
typedef MappingData<T_SuffixArray, T_GenomeSequence, T_Tuple> MappingIPC;
long totalBases = 0;
int totalReads = 0;
class ClusterInformation {
public:
int maxClusterSize;
float meanAnchorBasesPerRead;
float sdAnchorBasesPerRead;
int score;
float pctSimilarity;
int readLength;
float nStdDev ;
int numSignificant;
int numForward, numReverse;
};
class ReadAlignments {
public:
/*
This class stores the alignments from a read. A read may be
aligned in several different modes:
1. noSplitSureads - Treat the read as a unit from start to end
2. subreads - Align each subread independently
3. denovo - Only align the CCS sequence from a read
4. allpass - Align the de novo ccs sequences and then the
subreads to where the denovo ccs aligned.
5. fullpass - Same as allpass, except using only complete
subreads.
The alignments are a raggad array of n sequences; n is 1 for cases
1 and 3, the number of subreads for cases 2 and 4, and the number
of full length passes for case 5.
A ReadAligments class must only have alignments for a single type
of read in it.
*/
vector<vector<T_AlignmentCandidate*> > subreadAlignments;
vector<SMRTSequence> subreads;
AlignMode alignMode;
SMRTSequence read;
int GetNAlignedSeq() {
return subreadAlignments.size();
}
bool AllSubreadsHaveAlignments() {
int i, nAlignedSeq;
nAlignedSeq = subreadAlignments.size();
for (i = 0; i < nAlignedSeq; i++) {
if (subreadAlignments[i].size() == 0) {
return false;
}
}
return true;
}
void Clear() {
int i;
int nAlignedSeq;
for (i = 0, nAlignedSeq = subreadAlignments.size(); i < nAlignedSeq; i++) {
int nAlignments;
int a;
for (a = 0, nAlignments = subreadAlignments[i].size(); a < nAlignments; a++) {
delete subreadAlignments[i][a];
}
subreadAlignments[i].clear();
}
for (i = 0, nAlignedSeq = subreads.size(); i< nAlignedSeq; i++) {
subreads[i].FreeIfControlled();
if (subreads[i].title != NULL) {
delete[] subreads[i].title;
subreads[i].title = NULL;
}
}
subreadAlignments.clear();
read.Free();
}
void Resize(int nSeq) {
subreadAlignments.resize(nSeq);
subreads.resize(nSeq);
}
void CheckSeqIndex(int seqIndex) {
if ( seqIndex < 0 or seqIndex >= subreads.size() ) {
cout << "ERROR, adding a sequence to an unallocated position." << endl;
assert(0);
}
}
void SetSequence(int seqIndex, SMRTSequence &seq) {
CheckSeqIndex(seqIndex);
subreads[seqIndex] = seq;
}
void AddAlignmentForSeq(int seqIndex, T_AlignmentCandidate *alignmentPtr) {
CheckSeqIndex(seqIndex);
subreadAlignments[seqIndex].push_back(alignmentPtr);
}
void AddAlignmentsForSeq(int seqIndex, vector<T_AlignmentCandidate*> &seqAlignmentPtrs) {
CheckSeqIndex(seqIndex);
subreadAlignments[seqIndex].insert(subreadAlignments[seqIndex].end(), seqAlignmentPtrs.begin(), seqAlignmentPtrs.end());
}
~ReadAlignments() {
read.FreeIfControlled();
}
};
class SortAlignmentPointersByScore {
public:
int operator()(T_AlignmentCandidate *lhs, T_AlignmentCandidate* rhs) {
if (lhs->score == rhs->score) {
return lhs->tPos + lhs->tAlignedSeqPos < rhs->tPos + rhs->tAlignedSeqPos;
}
else {
return lhs->score < rhs->score;
}
}
};
class SortAlignmentPointersByMapQV {
public:
int operator()(T_AlignmentCandidate *lhs, T_AlignmentCandidate* rhs) {
if (lhs->mapQV == rhs->mapQV) {
if (lhs->score == rhs->score) {
return lhs->tPos + lhs->tAlignedSeqPos < rhs->tPos + rhs->tAlignedSeqPos;
}
else {
return lhs->score < rhs->score;
}
}
else {
return lhs->mapQV > rhs->mapQV;
}
}
};
string GetMajorVersion() {
return "1.MC.rc46";
}
void GetVersion(string &version) {
string perforceVersionString("$Change$");
version = GetMajorVersion();
if (perforceVersionString.size() > 12) {
version.insert(version.size(), ".");
version.insert(version.size(), perforceVersionString, 9, perforceVersionString.size() - 11);
}
}
void GetSoftwareVersion(string &changelistId, string &softwareVersion) {
int nDots = 0;
int i;
softwareVersion = "";
for (i = 0; i < changelistId.size(); i++) {
if ( changelistId[i]== '.') {
nDots +=1;
}
if (nDots == 2) {
break;
}
}
softwareVersion = changelistId.substr(0,i);
}
void MakeSAMHDString(string &hdString) {
stringstream out;
out << "@HD\t" << "VN:" << GetMajorVersion() << "\t" << "pb:3.0.1";
hdString = out.str();
}
void MakeSAMPGString(string &commandLineString, string &pgString) {
stringstream out;
string version;
GetVersion(version);
out << "@PG\t" << "ID:BLASR\tVN:"<< version<<"\tCL:"<<commandLineString;
pgString = out.str();
}
void ParseChipIdFromMovieName(string &movieName, string &chipId) {
vector<string> movieNameFields;
Tokenize(movieName, "_", movieNameFields);
if (movieNameFields.size() == 1) {
chipId = movieNameFields[0];
}
else if (movieNameFields.size() > 4) {
chipId = movieNameFields[3];
}
else {
chipId = "NO_CHIP_ID";
}
}
//
// Define a list of buffers that are meant to grow to high-water
// marks, and not shrink down past that. The memory is reused rather
// than having multiple calls to new.
//
class MappingBuffers {
public:
vector<int> hpInsScoreMat, insScoreMat;
vector<int> kbandScoreMat;
vector<Arrow> hpInsPathMat, insPathMat;
vector<Arrow> kbandPathMat;
vector<int> scoreMat;
vector<Arrow> pathMat;
vector<int> affineScoreMat;
vector<Arrow> affinePathMat;
vector<ChainedMatchPos> matchPosList;
vector<ChainedMatchPos> rcMatchPosList;
vector<BasicEndpoint<ChainedMatchPos> > globalChainEndpointBuffer;
vector<Fragment> sdpFragmentSet, sdpPrefixFragmentSet, sdpSuffixFragmentSet;
TupleList<PositionDNATuple> sdpCachedTargetTupleList;
TupleList<PositionDNATuple> sdpCachedTargetPrefixTupleList;
TupleList<PositionDNATuple> sdpCachedTargetSuffixTupleList;
std::vector<int> sdpCachedMaxFragmentChain;
vector<double> probMat;
vector<double> optPathProbMat;
vector<float> lnSubPValueMat;
vector<float> lnInsPValueMat;
vector<float> lnDelPValueMat;
vector<float> lnMatchPValueMat;
void Reset() {
vector<int>().swap(hpInsScoreMat);
vector<int>().swap(insScoreMat);
vector<int>().swap(kbandScoreMat);
vector<Arrow>().swap(hpInsPathMat);
vector<Arrow>().swap(insPathMat);
vector<Arrow>().swap(kbandPathMat);
vector<int>().swap(scoreMat);
vector<Arrow>().swap(pathMat);
vector<ChainedMatchPos>().swap(matchPosList);
vector<ChainedMatchPos>().swap(rcMatchPosList);
vector<BasicEndpoint<ChainedMatchPos> >().swap(globalChainEndpointBuffer);
vector<Fragment>().swap(sdpFragmentSet);
vector<Fragment>().swap(sdpPrefixFragmentSet);
vector<Fragment>().swap(sdpSuffixFragmentSet);
sdpCachedTargetTupleList.Reset();
sdpCachedTargetPrefixTupleList.Reset();
sdpCachedTargetSuffixTupleList.Reset();
vector<int>().swap(sdpCachedMaxFragmentChain);
vector<double>().swap(probMat);
vector<double>().swap(optPathProbMat);
vector<float>().swap(lnSubPValueMat);
vector<float>().swap(lnInsPValueMat);
vector<float>().swap(lnDelPValueMat);
vector<float>().swap(lnMatchPValueMat);
}
};
void SetHelp(string &str) {
stringstream helpStream;
helpStream << " Options for blasr " << endl
<< " Basic usage: 'blasr reads.{fasta,bas.h5} genome.fasta [-options] " << endl
<< " option\tDescription (default_value)." << endl << endl
<< " Input Files." << endl
<< " reads.fasta is a multi-fasta file of reads. While any fasta file is valid input, " <<endl
<< " it is preferable to use pls.h5 or bas.h5 files because they contain" << endl
<< " more rich quality value information." << endl << endl
<< " reads.bas.h5|reads.pls.h5 Is the native output format in Hierarchical Data Format of " <<endl
<< " SMRT reads. This is the preferred input to blasr because rich quality" << endl
<< " value (insertion,deletion, and substitution quality values) information is " << endl
<< " maintained. The extra quality information improves variant detection and mapping"<<endl
<< " speed." << endl <<endl
<< " -sa suffixArrayFile"<< endl
<< " Use the suffix array 'sa' for detecting matches" << endl
<< " between the reads and the reference. The suffix" << endl
<< " array has been prepared by the sawriter program." << endl << endl
<< " -ctab tab "<<endl
<< " A table of tuple counts used to estimate match significance. This is " << endl
<< " by the program 'printTupleCountTable'. While it is quick to generate on " << endl
<< " the fly, if there are many invocations of blasr, it is useful to"<<endl
<< " precompute the ctab." <<endl << endl
<< " -regionTable table" << endl
<< " Read in a read-region table in HDF format for masking portions of reads." << endl
<< " This may be a single table if there is just one input file. " << endl
<< " or a fofn. When a region table is specified, any region table inside " << endl
<< " the reads.bas.h5 or reads.bas.h5 files are ignored."<< endl
<< endl
<< " Options for modifying reads. There is ancilliary information about substrings of reads " << endl
<< " that is stored in a 'region table' for each read file. Because " << endl
<< " HDF is used, the region table may be part of the .bas.h5 or .pls.h5 file," << endl
<< " or a separate file. A contiguously read substring from the template " << endl
<< " is a subread, and any read may contain multiple subreads. The boundaries " << endl
<< " of the subreads may be inferred from the region table either directly or " <<endl
<< " by definition of adapter boundaries. Typically region tables also" << endl
<< " contain information for the location of the high and low quality regions of"<<endl
<< " reads. Reads produced by spurrious reads from empty ZMWs have a high"<<endl
<< " quality start coordinate equal to high quality end, making no usable read." <<endl
<< " -useccs " << endl
<< " Align the circular consensus sequence (ccs), then report alignments" << endl
<< " of the ccs subreads to the window that the ccs was mapped to. Only " << endl
<< " alignments of the subreads are reported." << endl
<< " -useccsall"<<endl
<< " Similar to -useccs, except all subreads are aligned, rather than just" << endl
<< " the subreads used to call the ccs. This will include reads that only"<<endl
<< " cover part of the template." << endl
<< " -useccsdenovo" << endl
<< " Align the circular consensus, and report only the alignment of the ccs"<<endl
<< " sequence." << endl
<< " -noSplitSubreads (false)" <<endl
<< " Do not split subreads at adapters. This is typically only " << endl
<< " useful when the genome in an unrolled version of a known template, and " << endl
<< " contains template-adapter-reverse_template sequence." << endl
<< " -ignoreRegions(false)" << endl
<< " Ignore any information in the region table." << endl
<< " -ignoreHQRegions (false)Ignore any hq regions in the region table." << endl
<< endl
<< " Alignment Output." << endl
<< " -bestn n (10)" <<endl
<< " Report the top 'n' alignments." << endl
<< " -sam Write output in SAM format." << endl
<< " -clipping [none|hard|soft|subread] (none)" << endl
<< " Use no/hard/soft clipping for SAM output."<< endl
<< " -out out (terminal) " << endl
<< " Write output to 'out'." << endl
<< " -unaligned file" << endl
<< " Output reads that are not aligned to 'file'" << endl
<< " -m t " << endl
<< " If not printing SAM, modify the output of the alignment." << endl
<< " t=" << StickPrint << " Print blast like output with |'s connecting matched nucleotides." << endl
<< " " << SummaryPrint << " Print only a summary: score and pos." << endl
<< " " << CompareXML << " Print in Compare.xml format." << endl
<< " " << Vulgar << " Print in vulgar format (deprecated)." << endl
<< " " << Interval << " Print a longer tabular version of the alignment." << endl
<< " " << CompareSequencesParsable << " Print in a machine-parsable format that is read by compareSequences.py." << endl
<< " -noSortRefinedAlignments (false) " << endl
<< " Once candidate alignments are generated and scored via sparse dynamic "<< endl
<< " programming, they are rescored using local alignment that accounts " << endl
<< " for different error profiles." <<endl
<< " Resorting based on the local alignment may change the order the hits are returned." << endl
<< " -allowAdjacentIndels " << endl
<< " When specified, adjacent insertion or deletions are allowed. Otherwise, adjacent " << endl
<< " insertion and deletions are merged into one operation. Using quality values " << endl
<< " to guide pairwise alignments may dictate that the higher probability alignment "<<endl
<< " contains adjacent insertions or deletions. Current tools such as GATK do not permit" << endl
<< " this and so they are not reported by default." << endl
<< " -header" <<endl
<< " Print a header as the first line of the output file describing the contents of each column."<<endl
<< " -titleTable tab (NULL) " << endl
<< " Construct a table of reference sequence titles. The reference sequences are " << endl
<< " enumerated by row, 0,1,... The reference index is printed in alignment results" << endl
<< " rather than the full reference name. This makes output concise, particularly when" <<endl
<< " very verbose titles exist in reference names."<<endl
<< " -minPctIdentity p (0)"<< endl
<< " Only report alignments if they are greater than p percent identity."<<endl
<< " -minAlignLength l (0)"<< endl
<< " Only report alignments if they are greater than l bases on the genome."<<endl
<< " -unaligned file" << endl
<< " Output reads that are not aligned to 'file'." << endl
<< endl
<< " Options for anchoring alignment regions. This will have the greatest effect on speed and sensitivity." << endl
<< " -minMatch m (10) " << endl
<< " Minimum seed length. Higher minMatch will speed up alignment, " << endl
<< " but decrease sensitivity." << endl
<< " -maxMatch l (inf)" << endl
<< " Stop mapping a read to the genome when the lcp length reaches l. " << endl
<< " This is useful when the query is part of the reference, for example when " <<endl
<< " constructing pairwise alignments for de novo assembly."<<endl
<< " -maxLCPLength l (inf)" << endl
<< " The same as -maxMatch." << endl
<< " -maxAnchorsPerPosition m (inf) " << endl
<< " Do not add anchors from a position if it matches to more than 'm' locations in the target." << endl
<< " -advanceExactMatches E (0)" << endl
<< " Another trick for speeding up alignments with match - E fewer anchors. Rather than" << endl
<< " finding anchors between the read and the genome at every position in the read, " <<endl
<< " when an anchor is found at position i in a read of length L, the next position " << endl
<< " in a read to find an anchor is at i+L-E." << endl
<< " Use this when alignining already assembled contigs." << endl
<< " -nCandidates n (10)" << endl
<< " Keep up to 'n' candidates for the best alignment. A large value of n will slow mapping" << endl
<< " because the slower dynamic programming steps are applied to more clusters of anchors" <<endl
<< " which can be a rate limiting step when reads are very long."<<endl
<< endl
<< " Options for Refining Hits." << endl
<< " -sdpTupleSize K (11)" << endl
<< " Use matches of length K to speed dynamic programming alignments. This controls" <<endl
<< " accuracy of assigning gaps in pairwise alignments once a mapping has been found,"<<endl
<< " rather than mapping sensitivity itself."<<endl
<< " -scoreMatrix \"score matrix string\" " << endl
<< " Specify an alternative score matrix for scoring fasta reads. The matrix is " << endl
<< " in the format " << endl
<< " ACGTN" << endl
<< " A abcde" << endl
<< " C fghij" << endl
<< " G klmno" << endl
<< " T pqrst" << endl
<< " N uvwxy" << " . The values a...y should be input as a quoted space separated " << endl
<< " string: \"a b c ... y\". Lower scores are better, so matches should be less " << endl
<< " than mismatches e.g. a,g,m,s = -5 (match), mismatch = 6. " << endl
<< " -affineOpen value (10) " << endl
<< " Set the penalty for opening an affine alignment." << endl
<< " -affineExtend value (0)" << endl
<< " Change affine (extension) gap penalty. Lower value allows more gaps." << endl
<< " -alignContigs" << endl
<< " Configure mapping parameters to map very long (10s of Mbp) contigs against a reference." << endl << endl
<< " Options for overlap/dynamic programming alignments and pairwise overlap for de novo assembly. " << endl
<< " -useQuality (false)" << endl
<< " Use substitution/insertion/deletion/merge quality values to score gap and " << endl
<< " mismatch penalties in pairwise alignments. Because the insertion and deletion" << endl
<< " rates are much higher than substitution, this will make many alignments " <<endl
<< " favor an insertion/deletion over a substitution. Naive consensus calling methods "<<endl
<< " will then often miss substitution polymorphisms. This option should be " << endl
<< " used when calling consensus using the Quiver method. Furthermore, when " << endl
<< " not using quality values to score alignments, there will be a lower consensus " << endl
<< " accuracy in homolymer regions." << endl
<< " -affineAlign (true)" << endl
<< " Refine alignment using affine guided align." << endl << endl
<< " Options for filtering reads." << endl
<< " -minReadLength l(50)" << endl
<< " Skip reads that have a full length less than l. Subreads may be shorter." << endl
<< " -minSubreadLength l(0)" << endl
<< " Do not align subreads of length less than l." << endl
<< " -maxScore m (0)" << endl
<< " Maximum score to output (high is bad, negative good)." << endl << endl
<< " Options for parallel alignment." << endl
<< " -nproc N (1)" << endl
<< " Align using N processes. All large data structures such as the suffix array and " << endl
<< " tuple count table are shared."<<endl
<< " -start S (0)" << endl
<< " Index of the first read to begin aligning. This is useful when multiple instances " << endl
<< " are running on the same data, for example when on a multi-rack cluster."<<endl
<< " -stride S (1)" << endl
<< " Align one read every 'S' reads." << endl << endl
<< " Options for subsampling reads." << endl
<< " -subsample (0)" << endl
<< " Proportion of reads to randomly subsample (expressed as a decimal) and align." << endl
<< endl
// << " Options for dynamic programming alignments. " << endl << endl
// << " -ignoreQuality" << endl
// << " Ignore quality values when computing alignments (they still may be used." << endl
// << " when mapping)." << endl << endl
<< " -v Print some verbose information." << endl
<< " -V 2 Make verbosity more verbose. Probably only useful for development." << endl
<< " -h Print this help file." << endl << endl
<< "To cite BLASR, please use: Chaisson M.J., and Tesler G., Mapping " << endl
<< "single molecule sequencing reads using Basic Local Alignment with " << endl
<< "Successive Refinement (BLASR): Theory and Application, BMC " << endl
<< "Bioinformatics 2012, 13:238 ." << endl << endl;
str = helpStream.str();
}
void SetConciseHelp(string &conciseHelp) {
stringstream strm;
strm << "blasr - a program to map reads to a genome" << endl
<< " usage: blasr reads genome " << endl
<< " Run with -h for a list of commands " << endl
<< " -help for verbose discussion of how to run blasr." << endl;
conciseHelp = strm.str();
}
void PrintDiscussion() {
cout << "NAME"<<endl;
cout << " blasr - Map SMRT Sequences to a reference genome."<< endl << endl;
cout << "SYNOPSIS" << endl
<< " blasr reads.fasta genome.fasta " << endl << endl
<< " blasr reads.fasta genome.fasta -sa genome.fasta.sa" << endl << endl
<< " blasr reads.bas.h5 genome.fasta [-sa genome.fasta.sa] " << endl << endl
<< " blasr reads.bas.h5 genome.fasta -sa genome.fasta.sa -maxScore -100 -minMatch 15 ... " << endl << endl
<< " blasr reads.bas.h5 genome.fasta -sa genome.fasta.sa -nproc 24 -out alignment.out ... " << endl << endl
<< "DESCRIPTION " << endl
<< " blasr is a read mapping program that maps reads to positions " << endl
<< " in a genome by clustering short exact matches between the read and" << endl
<< " the genome, and scoring clusters using alignment. The matches are" << endl
<< " generated by searching all suffixes of a read against the genome" << endl
<< " using a suffix array. Global chaining methods are used to score " << endl
<< " clusters of matches." << endl << endl
<< " The only required inputs to blasr are a file of reads and a" << endl
<< " reference genome. It is exremely useful to have read filtering" << endl
<< " information, and mapping runtime may decrease substantially when a" << endl
<< " precomputed suffix array index on the reference sequence is" << endl
<< " specified." << endl
<< " " << endl
<< " Although reads may be input in FASTA format, the recommended input is HDF" << endl
<< " bas.h5 and pls.h5 files because these contain qualtiy value" << endl
<< " information that is used in the alignment and produces higher quality" << endl
<< " variant detection. " << endl
<< " " << endl
<< " Read filtering information is contained in the .bas.h5 input files as" << endl
<< " well as generated by other post-processing programs with analysis of" << endl
<< " pulse files and read in from a separate .region.h5 file. The current" << endl
<< " set of filters that are applied to reads are high quality region" << endl
<< " filtering, and adapter filtering. Regions outside high-quality" << endl
<< " regions are ignored in mapping. Reads that contain regions annotated" << endl
<< " as adapter are split into non-adapter (template) regions, and mapped" << endl
<< " separately." << endl
<< " " << endl
<< " When suffix array index of a genome is not specified, the suffix array is" << endl
<< " built before producing alignment. This may be prohibitively slow" << endl
<< " when the genome is large (e.g. Human). It is best to precompute the" << endl
<< " suffix array of a genome using the program sawriter, and then specify" << endl
<< " the suffix array on the command line using -sa genome.fa.sa." << endl
<< " " << endl
<< " The optional parameters are roughly divided into three categories:" << endl
<< " control over anchoring, alignment scoring, and output. " << endl
<< " " << endl
<< " The default anchoring parameters are optimal for small genomes and" << endl
<< " samples with up to 5% divergence from the reference genome. The main" << endl
<< " parameter governing speed and sensitivity is the -minMatch parameter." << endl
<< " For human genome alignments, a value of 11 or higher is recommended. " << endl
<< " Several methods may be used to speed up alignments, at the expense of" << endl
<< " possibly decreasing sensitivity. " << endl
<< " " << endl
<< " Regions that are too repetitive may be ignored during mapping by" << endl
<< " limiting the number of positions a read maps to with the" << endl
<< " -maxAnchorsPerPosition option. Values between 500 and 1000 are effective" << endl
<< " in the human genome." << endl
<< " " << endl
<< " For small genomes such as bacterial genomes or BACs, the default parameters " << endl
<< " are sufficient for maximal sensitivity and good speed." << endl
<< endl << endl;
}
int CountZero(unsigned char *ptr, int length) {
int i;
int nZero = 0;
for (i = 0; i < length; i++) {
if (ptr[i] == 0) { ++nZero; }
}
return nZero;
}
bool ReadHasMeaningfulQualityValues(FASTQSequence &sequence) {
if (sequence.qual.Empty() == true) {
return 0;
}
else {
int q;
int numZero=0, numNonZero=0;
if (sequence.qual.data == NULL) {
return false;
}
numZero = CountZero(sequence.qual.data, sequence.length);
numNonZero = sequence.length - numZero;
int subNumZero = 0, subNonZero = 0;
if (sequence.substitutionQV.data == NULL) {
return false;
}
subNumZero = CountZero(sequence.substitutionQV.data, sequence.length);
subNonZero = sequence.length - subNumZero;
if (numZero < 0.5*numNonZero and subNumZero < 0.5 * subNonZero) {
return true;
}
else {
return false;
}
}
}
template<typename T_RefSequence, typename T_Sequence>
void PairwiseLocalAlign(T_Sequence &qSeq, T_RefSequence &tSeq,
int k,
MappingParameters ¶ms, T_AlignmentCandidate &alignment,
MappingBuffers &mappingBuffers,
AlignmentType alignType=Global) {
//
// Perform a pairwise alignment between qSeq and tSeq, but choose
// the pairwise alignment method based on the parameters. The
// options for pairwise alignment are:
// - Affine KBanded alignment: usually used for sequences with no
// quality information.
// - KBanded alignment: For sequences with quality information.
// Gaps are scored with quality values.
//
DistanceMatrixScoreFunction<DNASequence, FASTQSequence> distScoreFn;
params.InitializeScoreFunction(distScoreFn);
int kbandScore;
int qvAwareScore;
if (params.ignoreQualities || qSeq.qual.Empty() || !ReadHasMeaningfulQualityValues(qSeq) ) {
kbandScore = AffineKBandAlign(qSeq, tSeq, SMRTDistanceMatrix,
params.indel+2, params.indel - 3, // homopolymer insertion open and extend
params.indel+2, params.indel - 1, // any insertion open and extend
params.indel, // deletion
k*1.2,
mappingBuffers.scoreMat, mappingBuffers.pathMat,
mappingBuffers.hpInsScoreMat, mappingBuffers.hpInsPathMat,
mappingBuffers.insScoreMat, mappingBuffers.insPathMat,
alignment, Global);
alignment.score = kbandScore;
if (params.verbosity >= 2) {
cout << "align score: " << kbandScore << endl;
}
}
else {
if (qSeq.insertionQV.Empty() == false) {
qvAwareScore = KBandAlign(qSeq, tSeq, SMRTDistanceMatrix,
params.indel+2, // ins
params.indel+2, // del
k,
mappingBuffers.scoreMat, mappingBuffers.pathMat,
alignment, distScoreFn, alignType);
if (params.verbosity >= 2) {
cout << "ids score fn score: " << qvAwareScore << endl;
}
}
else {
qvAwareScore = KBandAlign(qSeq, tSeq, SMRTDistanceMatrix,
params.indel+2, // ins
params.indel+2, // del
k,
mappingBuffers.scoreMat, mappingBuffers.pathMat,
alignment, distScoreFn, alignType);
if (params.verbosity >= 2) {
cout << "qv score fn score: " << qvAwareScore << endl;
}
}
alignment.sumQVScore = qvAwareScore;
alignment.score = qvAwareScore;
alignment.probScore = 0;
}
// Compute stats and assign a default alignment score using an edit distance.
ComputeAlignmentStats(alignment, qSeq.seq, tSeq.seq, distScoreFn);
if (params.scoreType == 1) {
alignment.score = alignment.sumQVScore;
}
}
int SDPAlignLite(DNASequence &query, DNASequence &target, int wordSize, int maxMatchesPerPosition,
vector<Fragment> &fragmentSet ) {
TupleList<PositionDNATuple> targetTupleList;
/*
Collect a set of matching fragments between query and target.
Since this function is an inner-loop for alignment, anything to
speed it up will help. One way to speed it up is to re-use the
vectors that contain the sdp matches.
*/
TupleMetrics tm, tmSmall;
tm.Initialize(wordSize);
SequenceToTupleList(target, tm, targetTupleList);
targetTupleList.Sort();
//
// Store in fragmentSet the tuples that match between the target
// and query.
//
StoreMatchingPositions(query, tm, targetTupleList, fragmentSet, maxMatchesPerPosition);
VectorIndex f;
for (f = 0; f < fragmentSet.size(); f++) {
fragmentSet[f].weight = tm.tupleSize;
fragmentSet[f].length = tm.tupleSize;
}
std::sort(fragmentSet.begin(), fragmentSet.end(), LexicographicFragmentSort<Fragment>());
//
// Assume inversion will be in rc max frament chain set.
//
std::vector<int> maxFragmentChain;
SDPLongestCommonSubsequence(query.length, fragmentSet, tm.tupleSize, 2, 2, -5, maxFragmentChain, Local);
//GlobalChainFragmnetList(fragmentSet, maxFragmentChain);
for (f = 0; f < maxFragmentChain.size(); f++) {
fragmentSet[f] = fragmentSet[maxFragmentChain[f]];
}
fragmentSet.resize(f);
return maxFragmentChain.size();
}
template<typename T_RefSequence, typename T_Sequence>
void RefineAlignment(T_Sequence &query,
T_RefSequence &genome,
T_AlignmentCandidate &alignmentCandidate, MappingParameters ¶ms,
MappingBuffers &mappingBuffers) {
FASTQSequence qSeq;
DNASequence tSeq;
DistanceMatrixScoreFunction<DNASequence, FASTQSequence> distScoreFn;
params.InitializeScoreFunction(distScoreFn);
distScoreFn.InitializeScoreMatrix(SMRTDistanceMatrix);
if (params.doGlobalAlignment) {
SMRTSequence subread;
((FASTQSequence*)&subread)->ReferenceSubstring(query,
query.subreadStart,
query.subreadEnd - query.subreadStart);
int drift = ComputeDrift(alignmentCandidate);
T_AlignmentCandidate refinedAlignment;
KBandAlign(subread, alignmentCandidate.tAlignedSeq, SMRTDistanceMatrix,
params.insertion, params.deletion,
drift,
mappingBuffers.scoreMat, mappingBuffers.pathMat,
refinedAlignment, distScoreFn, Global);
refinedAlignment.RemoveEndGaps();
alignmentCandidate.blocks = refinedAlignment.blocks;
alignmentCandidate.gaps = refinedAlignment.gaps;
alignmentCandidate.tPos = refinedAlignment.tPos;
alignmentCandidate.qPos = refinedAlignment.qPos + query.subreadStart;
alignmentCandidate.score = refinedAlignment.score;
}
else if (params.useGuidedAlign) {
T_AlignmentCandidate refinedAlignment;
int lastBlock = alignmentCandidate.blocks.size() - 1;
if (alignmentCandidate.blocks.size() > 0) {
/*
* Refine the alignment without expanding past the current
* boundaries of the sequences that are already aligned.
*/
//
// NOTE** this only makes sense when
// alignmentCandidate.blocks[0].tPos == 0. Otherwise the length
// of the sequence is not correct.
//
tSeq.Copy(alignmentCandidate.tAlignedSeq,
alignmentCandidate.tPos,
(alignmentCandidate.blocks[lastBlock].tPos +
alignmentCandidate.blocks[lastBlock].length));
// qSeq.ReferenceSubstring(alignmentCandidate.qAlignedSeq,
qSeq.ReferenceSubstring(query,
alignmentCandidate.qAlignedSeqPos + alignmentCandidate.qPos,
(alignmentCandidate.blocks[lastBlock].qPos +
alignmentCandidate.blocks[lastBlock].length));
if (params.affineAlign) {
AffineGuidedAlign(qSeq, tSeq, alignmentCandidate,
distScoreFn, params.bandSize,
mappingBuffers,
refinedAlignment, Global, false);
}
else {
GuidedAlign(qSeq, tSeq, alignmentCandidate,
distScoreFn, params.guidedAlignBandSize,
mappingBuffers,
refinedAlignment, Global, false);
}
ComputeAlignmentStats(refinedAlignment,
qSeq.seq,
tSeq.seq,
distScoreFn, params.affineAlign);
//
// Copy the refine alignment, which may be a subsequence of the
// alignmentCandidate into the alignment candidate.
//
// First copy the alignment block and gap (the description of
// the base by base alignment).
alignmentCandidate.blocks.clear();
alignmentCandidate.blocks = refinedAlignment.blocks;
alignmentCandidate.CopyStats(refinedAlignment);
alignmentCandidate.gaps = refinedAlignment.gaps;
alignmentCandidate.score = refinedAlignment.score;
alignmentCandidate.nCells = refinedAlignment.nCells;
// Next copy the information that describes what interval was
// aligned. Since the reference sequences of the alignment
// candidate have been modified, they are reassigned.
alignmentCandidate.tAlignedSeq.TakeOwnership(tSeq);
alignmentCandidate.ReassignQSequence(qSeq);
alignmentCandidate.tAlignedSeqPos += alignmentCandidate.tPos;
alignmentCandidate.qAlignedSeqPos += alignmentCandidate.qPos;
//
// tPos and qPos are the positions within the interval where the
// alignment begins. The refined alignment has adifferent tPos
// and qPos from the alignment candidate.
alignmentCandidate.tPos = refinedAlignment.tPos;
alignmentCandidate.qPos = refinedAlignment.qPos;
// The lengths of the newly aligned sequences may differ, update those.
alignmentCandidate.tAlignedSeqLength = tSeq.length;
alignmentCandidate.qAlignedSeqLength = qSeq.length;
}
}
else {
//
// This assumes an SDP alignment has been performed to create 'alignmentCandidate'.
//
// Recompute the alignment using a banded smith waterman to
// get rid of any spurious effects of usign the seeded gaps.
//
//
// The k-banded alignment is over a subsequence of the first
// (sparse dynamic programming, SDP) alignment. The SDP
// alignment is over a large window that may contain the
// candidate sequence. The k-band alignment is over a tighter
// region.
int drift = ComputeDrift(alignmentCandidate);
//
// Rescore the alignment with a banded alignment that has a
// better model of sequencing error.
//
if (alignmentCandidate.blocks.size() == 0 ){
alignmentCandidate.score = 0;
return;
}
int lastBlock = alignmentCandidate.blocks.size() - 1;
//
// Assign the sequences that are going to be realigned using
// banded alignment. The SDP alignment does not give that great
// of a score, but it does do a good job at finding a backbone
// alignment that closely defines the sequence that is aligned.
// Reassign the subsequences for alignment with a tight bound
// around the beginning and ending of each sequence, so that
// global banded alignment may be performed.
//
//
// This section needs to be cleaned up substantially. Right now it
// copies a substring from the ref to a temp, then from the temp
// back to the ref. It may be possible to just keep one pointer per
// read to the memory that was allocated, then allow the seq
// parameter to float around. The reason for all the copying is
// that in case there is a compressed version of the genome the
// seqences must be transformed before alignment.
//
if (alignmentCandidate.qIsSubstring) {
qSeq.ReferenceSubstring(query, // the original sequence
alignmentCandidate.qPos + alignmentCandidate.qAlignedSeqPos,
alignmentCandidate.blocks[lastBlock].qPos + alignmentCandidate.blocks[lastBlock].length);
}
else {
qSeq.ReferenceSubstring(alignmentCandidate.qAlignedSeq, // the subsequence that the alignment points to
alignmentCandidate.qPos + alignmentCandidate.qAlignedSeqPos,
alignmentCandidate.blocks[lastBlock].qPos + alignmentCandidate.blocks[lastBlock].length - alignmentCandidate.blocks[0].qPos);
}
tSeq.Copy(alignmentCandidate.tAlignedSeq, // the subsequence the alignment points to
alignmentCandidate.tPos, // ofset into the subsequence
alignmentCandidate.blocks[lastBlock].tPos + alignmentCandidate.blocks[lastBlock].length - alignmentCandidate.blocks[0].tPos);
T_AlignmentCandidate refinedAlignment;
//
// When the parameter bandSize is 0, set the alignment band size
// to the drift off the diagonal, plus a little more for wiggle
// room. When the parameteris nonzero, use that as a fixed band.
//
int k;
if (params.bandSize == 0) {
k = abs(drift) * 1.5;
}
else {
k = params.bandSize;
}
if (params.verbosity > 0) {
cout << "drift: " << drift << " qlen: " << alignmentCandidate.qAlignedSeq.length << " tlen: " << alignmentCandidate.tAlignedSeq.length << " k: " << k << endl;
cout << "aligning in " << k << " * " << alignmentCandidate.tAlignedSeq.length << " " << k * alignmentCandidate.tAlignedSeq.length << endl;
}
if (k < 10) {
k = 10;
}
alignmentCandidate.tAlignedSeqPos += alignmentCandidate.tPos;
VectorIndex lastSDPBlock = alignmentCandidate.blocks.size() - 1;
if (alignmentCandidate.blocks.size() > 0) {
DNALength prevLength = alignmentCandidate.tAlignedSeqLength -= alignmentCandidate.tPos;
alignmentCandidate.tAlignedSeqLength = (alignmentCandidate.blocks[lastSDPBlock].tPos
+ alignmentCandidate.blocks[lastSDPBlock].length
- alignmentCandidate.blocks[0].tPos);
}
else {
alignmentCandidate.tAlignedSeqLength = 0;
}
alignmentCandidate.tPos = 0;
alignmentCandidate.qAlignedSeqPos += alignmentCandidate.qPos;
if (alignmentCandidate.blocks.size() > 0) {
DNALength prevLength = alignmentCandidate.qAlignedSeqLength -= alignmentCandidate.qPos;
alignmentCandidate.qAlignedSeqLength = (alignmentCandidate.blocks[lastSDPBlock].qPos
+ alignmentCandidate.blocks[lastSDPBlock].length
- alignmentCandidate.blocks[0].qPos);
}
else {
alignmentCandidate.qAlignedSeqLength = 0;
}
alignmentCandidate.qPos = 0;
alignmentCandidate.blocks.clear();
alignmentCandidate.tAlignedSeq.Free();
alignmentCandidate.tAlignedSeq.TakeOwnership(tSeq);
alignmentCandidate.ReassignQSequence(qSeq);
if (params.verbosity >= 2) {
cout << "refining target: " << endl;
alignmentCandidate.tAlignedSeq.PrintSeq(cout);
cout << "refining query: " << endl;
((DNASequence*)&alignmentCandidate.qAlignedSeq)->PrintSeq(cout);
cout << endl;
}
PairwiseLocalAlign(qSeq, tSeq, k, params, alignmentCandidate, mappingBuffers, Fit);
}
}
int AlignSubstring(DNASequence &tSeq, int tPos, int tLength,
FASTQSequence &qSeq, int qPos, int qLength,
MappingParameters ¶ms,
int sdpTupleSize,
DistanceMatrixScoreFunction<DNASequence, FASTQSequence> &distScoreFn,
MappingBuffers &refinementBuffers,
T_AlignmentCandidate &alignment) {
DNASequence tSubSeq;
FASTQSequence qSubSeq;
tSubSeq.ReferenceSubstring(tSeq, tPos, tLength);
qSubSeq.ReferenceSubstring(qSeq, qPos, qLength);
int alignScore;
if ((tLength < params.bandSize or qLength < params.bandSize) and
((tLength >= qLength and tLength < 1.5 * qLength) or
(tLength <= qLength and tLength > 0.5 * qLength))) {
alignScore = AffineKBandAlign(qSubSeq, tSubSeq, distScoreFn.scoreMatrix,
params.indel+2, params.indel - 3, // homopolymer insertion open and extend
params.indel+2, params.indel - 1, // any insertion open and extend
params.indel, // deletion
params.bandSize,
refinementBuffers.scoreMat, refinementBuffers.pathMat,
refinementBuffers.hpInsScoreMat, refinementBuffers.hpInsPathMat,
refinementBuffers.insScoreMat, refinementBuffers.insPathMat,
alignment, Global);
}
else {
AlignmentType alignType = Global;
alignScore = SDPAlign(qSubSeq, tSubSeq, distScoreFn, sdpTupleSize,
params.sdpIns, params.sdpDel, 0.25,
alignment, refinementBuffers, alignType,
params.detailedSDPAlignment,
true,
params.sdpPrefix,
params.recurse,
params.recurseOver,
params.sdpMaxAnchorsPerPosition, Global);
alignment.qAlignedSeq.ReferenceSubstring(qSubSeq);
alignment.tAlignedSeq.ReferenceSubstring(tSubSeq);
if (alignment.blocks.size() > 0) {
int last = alignment.blocks.size()-1;
if (alignment.blocks[last].tPos + alignment.blocks[last].length < tSubSeq.length and
alignment.blocks[last].qPos + alignment.blocks[last].length < qSubSeq.length) {
Block end;
end.tPos = tSubSeq.length - 1;
end.qPos = qSubSeq.length - 1;
end.length = 1;
alignment.blocks.push_back(end);
}
if (alignment.blocks[0].tPos > 0 and alignment.blocks[0].qPos > 0) {
//
// Pin the alignment to the beginning of the sequences.
//
Block start;
start.tPos = 0;
start.qPos = 0;
start.length = 1;
alignment.blocks.insert(alignment.blocks.begin(), start);
}
}
RefineAlignment(qSubSeq, tSubSeq,
alignment,
params,
refinementBuffers);
}
return alignScore;
}
void AppendSubseqAlignment(T_AlignmentCandidate &alignment,
T_AlignmentCandidate &alignmentInGap,
DNALength qPos,
DNALength tPos) {
if (alignmentInGap.blocks.size() > 0) {
int b;
//
// Configure this block to be relative to the beginning
// of the aligned substring.
//
for (b = 0; b < alignmentInGap.size(); b++) {
alignmentInGap.blocks[b].tPos += tPos + alignmentInGap.tPos + alignmentInGap.tAlignedSeqPos;
alignmentInGap.blocks[b].qPos += qPos + alignmentInGap.qPos + alignmentInGap.qAlignedSeqPos;
assert(alignmentInGap.blocks[b].tPos < alignment.tAlignedSeq.length);
assert(alignmentInGap.blocks[b].qPos < alignment.qAlignedSeq.length);
}
}
// Add the blocks for the refined aignment.
alignment.blocks.insert(alignment.blocks.end(),
alignmentInGap.blocks.begin(),
alignmentInGap.blocks.end());
}
bool LengthInBounds(DNALength len, DNALength min, DNALength max) {
return (len > min and len < max);
}
template<typename T_TargetSequence, typename T_QuerySequence, typename TDBSequence>
void AlignIntervals(T_TargetSequence &genome, T_QuerySequence &read, T_QuerySequence &rcRead,
WeightedIntervalSet<ChainedMatchPos> &weightedIntervals,
int mutationCostMatrix[][5],
int ins, int del, int sdpTupleSize,
int useSeqDB, SequenceIndexDatabase<TDBSequence> &seqDB,
vector<T_AlignmentCandidate*> &alignments,
MappingParameters ¶ms,
int useScoreCutoff, int maxScore,
MappingBuffers &mappingBuffers,
int procId=0) {
vector<T_QuerySequence*> forrev;
forrev.resize(2);
forrev[Forward] = &read;
forrev[Reverse] = &rcRead;
//
// Use an edit distance scoring function instead of IDS. Although
// the IDS should be more accurate, it is more slow, and it is more
// important at this stage to have faster alignments than accurate,
// since all alignments are rerun using GuidedAlignment later on.
//
DistanceMatrixScoreFunction<DNASequence, FASTQSequence> distScoreFn(SMRTDistanceMatrix, params.insertion, params.deletion);
distScoreFn.affineOpen = params.affineOpen;
distScoreFn.affineExtend = params.affineExtend;
//
// Assume there is at least one interval.
//
if (weightedIntervals.size() == 0)
return;
WeightedIntervalSet<ChainedMatchPos>::iterator intvIt = weightedIntervals.begin();
int alignmentIndex = 0;
if (params.progress) {
cout << "Mapping intervals " << endl;
}
do {
T_AlignmentCandidate *alignment = alignments[alignmentIndex];
alignment->clusterWeight= (*intvIt).totalAnchorSize;
alignment->clusterScore = (*intvIt).pValue;
//
// Advance references. Intervals are stored in reverse order, so
// go backwards in the list, and alignments are in forward order.
// That should probably be changed.
//
++alignmentIndex;
//
// Try aligning the read to the genome.
//
DNALength matchIntervalStart, matchIntervalEnd;
matchIntervalStart = (*intvIt).start;
matchIntervalEnd = (*intvIt).end;
bool readOverlapsContigStart = false;
bool readOverlapsContigEnd = false;
int startOverlappedContigIndex = 0;
int endOverlappedContigIndex = 0;
if (params.verbosity > 0) {
cout << "aligning interval : " << read.length << " " << (*intvIt).start << " "
<< (*intvIt).end << " " << (*intvIt).qStart << " " << (*intvIt).qEnd
<< " " << matchIntervalStart << " to " << matchIntervalEnd << " "
<< params.approximateMaxInsertionRate << " " << endl;
}
assert(matchIntervalEnd >= matchIntervalStart);
//
// If using a sequence database, check to make sure that the
// boundaries of the sequence windows do not overlap with
// the boundaries of the reads. If the beginning is before
// the boundary, move the beginning up to the start of the read.
// If the end is past the end boundary of the read, similarly move
// the window boundary to the end of the read boundary.
DNALength tAlignedContigStart = 0;
int seqDBIndex = 0;
//
// Stretch the alignment interval so that it is close to where
// the read actually starts.
//
DNALength subreadStart = read.subreadStart;
DNALength subreadEnd = read.subreadEnd;
if ((*intvIt).GetStrandIndex() == Reverse) {
subreadEnd = read.MakeRCCoordinate(read.subreadStart) + 1;
subreadStart = read.MakeRCCoordinate(read.subreadEnd-1);
}
if (params.extendEnds) {
DNALength lengthBeforeFirstMatch = ((*intvIt).qStart - subreadStart) * params.approximateMaxInsertionRate ;
DNALength lengthAfterLastMatch = (subreadEnd - (*intvIt).qEnd) * params.approximateMaxInsertionRate;
if (matchIntervalStart < lengthBeforeFirstMatch or params.doGlobalAlignment) {
matchIntervalStart = 0;
}
else {
matchIntervalStart -= lengthBeforeFirstMatch;
}
if (genome.length < matchIntervalEnd + lengthAfterLastMatch or params.doGlobalAlignment) {
matchIntervalEnd = genome.length;
}
else {
matchIntervalEnd += lengthAfterLastMatch;
}
}
bool trimMatches = false;
DNALength intervalContigStartPos, intervalContigEndPos;
if (useSeqDB) {
//
// The sequence db index is the one where the actual match is
// contained. The matchIntervalStart might be before the sequence
// index boundary due to the extrapolation of alignment start by
// insertion rate. If this is the case, bump up the
// matchIntervalStart to be at the beginning of the boundary.
// Modify bounds similarly for the matchIntervalEnd and the end
// of a boundary.
//
seqDBIndex = seqDB.SearchForIndex((*intvIt).start);
intervalContigStartPos = seqDB.seqStartPos[seqDBIndex];
if (intervalContigStartPos > matchIntervalStart) {
matchIntervalStart = intervalContigStartPos;
}
intervalContigEndPos = seqDB.seqStartPos[seqDBIndex+1] - 1;
if (intervalContigEndPos < matchIntervalEnd) {
matchIntervalEnd = intervalContigEndPos;
trimMatches = true;
}
alignment->tName = seqDB.GetSpaceDelimitedName(seqDBIndex);
alignment->tLength = intervalContigEndPos - intervalContigStartPos;
//
// When there are multiple sequences in the database, store the
// index of this sequence. This lets one compare the contigs
// that reads are mapped to, for instance.
//
alignment->tIndex = seqDBIndex;
}
else {
alignment->tLength = genome.length;
alignment->tName = genome.GetName();
intervalContigStartPos = 0;
intervalContigEndPos = genome.length;
}
alignment->qName = read.title;
int alignScore;
alignScore = 0;
alignment->tAlignedSeqPos = matchIntervalStart;
alignment->tAlignedSeqLength = matchIntervalEnd - matchIntervalStart;
//
// Below is a hack to get around a bug where a match interval extends past the end of a
// target interval because of an N in the query sequence. If the match interval is truncated,
// it is possible that the matches index past the interval length. This trims it back.
//
if ((*intvIt).GetStrandIndex() == Forward) {
alignment->tAlignedSeq.Copy(genome, alignment->tAlignedSeqPos, alignment->tAlignedSeqLength);
alignment->tStrand = Forward;
}
else {
DNALength rcAlignedSeqPos = genome.MakeRCCoordinate(alignment->tAlignedSeqPos + alignment->tAlignedSeqLength - 1);
genome.CopyAsRC(alignment->tAlignedSeq, rcAlignedSeqPos, alignment->tAlignedSeqLength);
// Map forward coordinates into reverse complement.
intervalContigStartPos = genome.MakeRCCoordinate(intervalContigStartPos) + 1;
intervalContigEndPos = genome.MakeRCCoordinate(intervalContigEndPos - 1);
swap(intervalContigStartPos, intervalContigEndPos);
alignment->tAlignedSeqPos = rcAlignedSeqPos;
alignment->tStrand = Reverse;
}
//
// Reference the subread of the query, always in the forward
// strand for refining alignments.
//
alignment->qAlignedSeqPos = read.subreadStart;
alignment->qAlignedSeq.ReferenceSubstring(read, read.subreadStart, subreadEnd - subreadStart);
alignment->qAlignedSeqLength = alignment->qAlignedSeq.length;
alignment->qLength = read.length;
alignment->qStrand = 0;
//
// First count how much of the read matches the genome exactly.
// It may be too low to bother refining.
//
int intervalSize = 0;
for (int m = 0; m < intvIt->matches.size(); m++) {
intervalSize += intvIt->matches[m].l;
}
// cout << "Interval size: " << intervalSize << endl;
int subreadLength = forrev[(*intvIt).GetStrandIndex()]->subreadEnd - forrev[(*intvIt).GetStrandIndex()]->subreadStart;
if ((1.0*intervalSize) / subreadLength < params.sdpBypassThreshold and !params.emulateNucmer) {
//
// Not enough of the read maps to the genome, need to use
// sdp alignment to define the regions of the read that map.
//
if (params.refineBetweenAnchorsOnly) {
//
// Run SDP alignment only between the genomic anchors,
// including the genomic anchors as part of the alignment.
//
int m;
vector<ChainedMatchPos> *matches;
Alignment anchorsOnly;
//
// The strand bookkeeping is a bit confusing, so hopefully
// this will set things straight.
//
// If the alignment is forward strand, the coordinates of the
// blocks are relative to the forward read, starting at 0, not
// the subread start.
// If the alignment is reverse strand, the coordinates of the
// blocks are relative to the reverse strand, starting at the
// position of the subread on the reverse strand.
//
// The coordinates of the blocks in the genome are always
// relative to the forward strand on the genome, starting at
// 0.
//
//
// The first step to refining between anchors only is to make
// the anchors relative to the tAlignedSeq.
//
matches=(vector<ChainedMatchPos>*)&intvIt->matches;
//
// Flip the target.
//
DNALength targetOffset = alignment->tAlignedSeqPos;
if (alignment->tStrand == 1) {
targetOffset = genome.MakeRCCoordinate(alignment->tAlignedSeqPos+ alignment->tAlignedSeq.length- 1);
}
for (m = 0; m < matches->size(); m++) {
(*matches)[m].t -= targetOffset;
}
//
// If the alignment was on the reverse strand, swap the coordinates so they are on the forward strand of the read.
//
if (alignment->tStrand == 1) {
for (m = 0; m < (*matches).size(); m++) {
(*matches)[m].q = alignment->qAlignedSeq.length - ((*matches)[m].q + (*matches)[m].l);
(*matches)[m].t = alignment->tAlignedSeq.length - ((*matches)[m].t + (*matches)[m].l);
}
std::reverse(matches->begin(), matches->end());
}
vector<bool> toRemove(matches->size(), false);
if (matches->size() > 0) {
m = 0;
while (m < matches->size()-1) {
int n = m+1;
while (n < matches->size() and
(((*matches)[m].q+(*matches)[m].l > (*matches)[n].q) or
((*matches)[m].t+(*matches)[m].l > (*matches)[n].t))) {
toRemove[n] = true;
n++;
}
m=n;
}
m=0;
int n=0;
for(n=0;n<matches->size();n++) {
if (toRemove[n] == false) {
(*matches)[m] = (*matches)[n];
m++;
}
}
matches->resize(m);
}
if (matches->size() > 0) {
toRemove.resize(matches->size());
m = 0;
int nRemoved =0;
for (m = 1; m < matches->size() - 1; m++) {
int qPrevGap, tPrevGap, qNextGap, tNextGap;
qPrevGap = (*matches)[m].q - (*matches)[m-1].q+(*matches)[m-1].l;
tPrevGap = (*matches)[m].t - (*matches)[m-1].t+(*matches)[m-1].l;
qNextGap = (*matches)[m+1].q - (*matches)[m].q+(*matches)[m].l;
tNextGap = (*matches)[m+1].t - (*matches)[m].t+(*matches)[m].l;
int MG=20;
if (tNextGap - qNextGap > MG) {
toRemove[m] = true;
++nRemoved;
}
}
m=0;
int n=0;
for(n=0;n<matches->size();n++) {
if (toRemove[n] == false) {
(*matches)[m] = (*matches)[n];
m++;
}
}
matches->resize(m);
}
DNASequence tSubSeq;
FASTQSequence qSubSeq, mSubSeq;
//
// Refine alignments between matches.
//
MappingBuffers refinementBuffers;
int f = 0, r = matches->size();
int tGap, qGap;
for (m = 0; matches->size() > 0 and m < matches->size()-1; m++) {
Block block;
block.qPos = (*matches)[m].q;
block.tPos = (*matches)[m].t;
block.length = (*matches)[m].l;
//
// Find the lengths of the gaps between anchors.
//
tGap = (*matches)[m+1].t - ((*matches)[m].t + (*matches)[m].l);
qGap = (*matches)[m+1].q - ((*matches)[m].q + (*matches)[m].l);
float gapRatio = (1.0*tGap)/qGap;
//
// Add the original block
//
alignment->blocks.push_back(block);
anchorsOnly.blocks.push_back(block);
if (tGap > 0 and qGap > 0) {
T_AlignmentCandidate alignmentInGap;
DNALength tPos, qPos;
tPos = block.tPos + block.length;
qPos = block.qPos + block.length;
//
// The following is to prevent the attempt to align massive gaps.
//
float tRatio = ((float)tGap)/qGap;
float qRatio = 1/tRatio;
int maxGap = 100000;
if (tRatio > 0.001 and qRatio > 0.001 and tGap < maxGap and qGap< maxGap) {
AlignSubstring(alignment->tAlignedSeq, tPos, tGap,
alignment->qAlignedSeq, qPos, qGap,
params,
sdpTupleSize,
distScoreFn,
refinementBuffers,
alignmentInGap);
//
// Now, splice the fragment alignment into the current
// alignment.
//
AppendSubseqAlignment(*alignment, alignmentInGap, qPos, tPos);
}
}
}
//
// Add the last block.
//
if (matches->size() > 0) {
Block block;
block.qPos = (*matches)[matches->size()-1].q;
block.tPos = (*matches)[matches->size()-1].t;
if (block.tPos > alignment->tAlignedSeq.length) {
cout << "ERROR mapping " << read.title << endl;
read.PrintSeq(cout);
}
assert(block.tPos <= alignment->tAlignedSeq.length);
assert(block.qPos <= alignment->qAlignedSeq.length);
block.length = (*matches)[m].l;
alignment->blocks.push_back(block);
anchorsOnly.blocks.push_back(block);
}
//
// By convention, blocks start at 0, and the
// alignment->tPos,qPos give the start of the alignment.
// Modify the block positions so that they are offset by 0.
//
if (alignment->blocks.size() > 0) {
alignment->tPos = alignment->blocks[0].tPos;
alignment->qPos = alignment->blocks[0].qPos;
int b;
int blocksSize = alignment->blocks.size();
for (b = 0; b < blocksSize ; b++) {
assert(alignment->tPos <= alignment->blocks[b].tPos);
assert(alignment->qPos <= alignment->blocks[b].qPos);
alignment->blocks[b].tPos -= alignment->tPos;
alignment->blocks[b].qPos -= alignment->qPos;
}
for (b = 0; b < anchorsOnly.blocks.size(); b++) {
anchorsOnly.blocks[b].tPos -= alignment->tPos;
anchorsOnly.blocks[b].qPos -= alignment->qPos;
}
anchorsOnly.tPos = alignment->tPos;
anchorsOnly.qPos = alignment->qPos;
//
// Adjacent blocks without gaps (e.g. 50M50M50M) are not yet merged. Do the merging now.
//
int cur = 0, next = 1;
while (next < alignment->blocks.size()) {
while (next < alignment->blocks.size() and
alignment->blocks[cur].tPos + alignment->blocks[cur].length == alignment->blocks[next].tPos and
alignment->blocks[cur].qPos + alignment->blocks[cur].length == alignment->blocks[next].qPos) {
alignment->blocks[cur].length += alignment->blocks[next].length;
alignment->blocks[next].length = 0;
next +=1;
}
cur = next;
next += 1;
}
cur = 0; next = 0;
while (next < alignment->blocks.size()) {
while (next < alignment->blocks.size() and alignment->blocks[next].length == 0) {
next +=1;
}
if (next < alignment->blocks.size()) {
alignment->blocks[cur] = alignment->blocks[next];
cur+=1;
next+=1;
}
}
alignment->blocks.resize(cur);
alignment->gaps.clear();
ComputeAlignmentStats(*alignment, alignment->qAlignedSeq.seq, alignment->tAlignedSeq.seq,
distScoreFn, params.affineAlign);
}
}
else {
alignScore = SDPAlign(alignment->qAlignedSeq, alignment->tAlignedSeq, distScoreFn,
sdpTupleSize, params.sdpIns, params.sdpDel, params.indelRate*3,
*alignment, mappingBuffers,
Local,
params.detailedSDPAlignment,
params.extendFrontAlignment,
params.sdpPrefix, params.recurse, params.recurseOver, params.sdpMaxAnchorsPerPosition);
ComputeAlignmentStats(*alignment, alignment->qAlignedSeq.seq, alignment->tAlignedSeq.seq,
distScoreFn, params.affineAlign);
}
}
else {
//
// The anchors used to anchor the sequence are sufficient to extend the alignment.
//
int m;
for (m = 0; m < (*intvIt).matches.size(); m++ ){
Block block;
block.qPos = (*intvIt).matches[m].q - alignment->qAlignedSeqPos;
block.tPos = (*intvIt).matches[m].t - alignment->tAlignedSeqPos;
block.length = (*intvIt).matches[m].l;
alignment->blocks.push_back(block);
}
}
//
// The anchors/sdp alignments may leave portions of the read
// unaligned at the beginning and end. If the parameters
// specify extending alignments, try and align extra bases at
// the beginning and end of alignments.
if (params.extendAlignments) {
//
// Modify the alignment so that the start and end of the
// alignment strings are at the alignment boundaries.
//
// Since the query sequence is pointing at a subsequence of the
// read (and is always in the forward direction), just reference
// a new portion of the read.
alignment->qAlignedSeqPos = alignment->qAlignedSeqPos + alignment->qPos;
alignment->qAlignedSeqLength = alignment->QEnd();
alignment->qAlignedSeq.ReferenceSubstring(read, alignment->qAlignedSeqPos, alignment->qAlignedSeqLength );
alignment->qPos = 0;
//
// Since the target sequence may be on the forward or reverse
// strand, a copy of the subsequence is made, and the original
// sequence free'd.
//
DNASequence tSubseq;
alignment->tAlignedSeqPos = alignment->tAlignedSeqPos + alignment->tPos;
alignment->tAlignedSeqLength = alignment->TEnd();
tSubseq.Copy(alignment->tAlignedSeq, alignment->tPos, alignment->tAlignedSeqLength);
alignment->tPos = 0;
alignment->tAlignedSeq.Free();
alignment->tAlignedSeq.TakeOwnership(tSubseq);
DNALength maximumExtendLength = 500;
if (alignment->blocks.size() > 0 ){
int lastAlignedBlock = alignment->blocks.size() - 1;
DNALength lastAlignedQPos = alignment->blocks[lastAlignedBlock].QEnd() + alignment->qPos + alignment->qAlignedSeqPos;
DNALength lastAlignedTPos = alignment->blocks[lastAlignedBlock].TEnd() + alignment->tPos + alignment->tAlignedSeqPos;
T_AlignmentCandidate extendedAlignmentForward, extendedAlignmentReverse;
int forwardScore, reverseScore;
SMRTSequence readSuffix;
DNALength readSuffixLength;
DNASequence genomeSuffix;
DNALength genomeSuffixLength;
SMRTSequence readPrefix;
DNALength readPrefixLength;
DNASequence genomePrefix;
DNALength genomePrefixLength;
//
// Align the entire end of the read if it is short enough.
//
readSuffixLength = min(read.length - lastAlignedQPos, maximumExtendLength);
if (readSuffixLength > 0) {
readSuffix.ReferenceSubstring(read, lastAlignedQPos, readSuffixLength);
}
else {
readSuffix.length = 0;
}
//
// Align The entire end of the genome up to the maximum extend length;
//
genomeSuffixLength = min(intervalContigEndPos - lastAlignedTPos, maximumExtendLength);
if (genomeSuffixLength > 0) {
if (alignment->tStrand == Forward) {
genomeSuffix.Copy(genome, lastAlignedTPos, genomeSuffixLength);
}
else {
((DNASequence)genome).CopyAsRC(genomeSuffix, lastAlignedTPos, genomeSuffixLength);
}
}
else {
genomeSuffix.length = 0;
}
forwardScore = 0;
if (readSuffix.length > 0 and genomeSuffix.length > 0) {
forwardScore = ExtendAlignmentForward(readSuffix, 0,
genomeSuffix, 0,
params.extendBandSize,
// Reuse buffers to speed up alignment
mappingBuffers.scoreMat,
mappingBuffers.pathMat,
// Do the alignment in the forward direction.
extendedAlignmentForward,
distScoreFn,
1, // don't bother attempting
// to extend the alignment
// if one of the sequences
// is less than 1 base long
params.maxExtendDropoff);
}
if ( forwardScore < 0 ) {
//
// The extended alignment considers the whole genome, but
// should be modified to be starting at the end of where
// the original alignment left off.
//
if (params.verbosity > 0) {
cout << "forward extended an alignment of score " << alignment->score << " with score " << forwardScore << " by " << extendedAlignmentForward.blocks.size() << " blocks and length " << extendedAlignmentForward.blocks[extendedAlignmentForward.blocks.size()-1].qPos << endl;
}
extendedAlignmentForward.tAlignedSeqPos = lastAlignedTPos;
extendedAlignmentForward.qAlignedSeqPos = lastAlignedQPos;
genomeSuffix.length = extendedAlignmentForward.tPos + extendedAlignmentForward.TEnd();
alignment->tAlignedSeq.Append(genomeSuffix);
alignment->qAlignedSeq.length += extendedAlignmentForward.qPos + extendedAlignmentForward.QEnd();
assert(alignment->qAlignedSeq.length <= read.length);
alignment->AppendAlignment(extendedAlignmentForward);
}
genomeSuffix.Free();
DNALength firstAlignedQPos = alignment->qPos + alignment->qAlignedSeqPos;
DNALength firstAlignedTPos = alignment->tPos + alignment->tAlignedSeqPos;
readPrefixLength = min(firstAlignedQPos, maximumExtendLength);
if (readPrefixLength > 0) {
readPrefix.ReferenceSubstring(read, firstAlignedQPos-readPrefixLength, readPrefixLength);
}
else {
readPrefix.length = 0;
}
genomePrefixLength = min(firstAlignedTPos - intervalContigStartPos, maximumExtendLength);
if (genomePrefixLength > 0) {
if (alignment->tStrand == 0) {
genomePrefix.Copy(genome, firstAlignedTPos - genomePrefixLength, genomePrefixLength);
}
else {
((DNASequence)genome).MakeRC(genomePrefix, firstAlignedTPos - genomePrefixLength, genomePrefixLength);
}
}
reverseScore = 0;
if (readPrefix.length > 0 and genomePrefix.length > 0) {
reverseScore = ExtendAlignmentReverse(readPrefix, readPrefix.length-1,
genomePrefix, genomePrefixLength - 1,
params.extendBandSize, //k
mappingBuffers.scoreMat,
mappingBuffers.pathMat,
extendedAlignmentReverse,
distScoreFn,
1, // don't bother attempting
// to extend the alignment
// if one of the sequences
// is less than 1 base long
params.maxExtendDropoff);
}
if (reverseScore < 0 ) {
//
// Make alignment->tPos relative to the beginning of the
// extended alignment so that when it is appended, the
// coordinates match correctly.
if (params.verbosity > 0) {
cout << "reverse extended an alignment of score " << alignment->score << " with score " << reverseScore << " by " << extendedAlignmentReverse.blocks.size() << " blocks and length " << extendedAlignmentReverse.blocks[extendedAlignmentReverse.blocks.size()-1].qPos << endl;
}
extendedAlignmentReverse.tAlignedSeqPos = firstAlignedTPos - genomePrefixLength;
extendedAlignmentReverse.qAlignedSeqPos = firstAlignedQPos - readPrefixLength;
extendedAlignmentReverse.AppendAlignment(*alignment);
genomePrefix.Append(alignment->tAlignedSeq, genomePrefix.length - alignment->tPos);
alignment->tAlignedSeq.Free();
alignment->tAlignedSeq.TakeOwnership(genomePrefix);
alignment->blocks = extendedAlignmentReverse.blocks;
alignment->tAlignedSeqPos = extendedAlignmentReverse.tAlignedSeqPos;
alignment->tPos = extendedAlignmentReverse.tPos;
alignment->qAlignedSeqPos = extendedAlignmentReverse.qAlignedSeqPos;
alignment->qAlignedSeq.length = readPrefix.length + alignment->qAlignedSeq.length;
alignment->qPos = extendedAlignmentReverse.qPos;
alignment->qAlignedSeq.seq = readPrefix.seq;
//
// Make sure the two ways of accounting for aligned sequence
// length are in sync. This needs to go.
//
if (alignment->blocks.size() > 0) {
int lastBlock = alignment->blocks.size() - 1;
alignment->qAlignedSeqLength = alignment->qAlignedSeq.length;
alignment->tAlignedSeqLength = alignment->tAlignedSeq.length;
}
else {
alignment->qAlignedSeqLength = alignment->qAlignedSeq.length = 0;
alignment->tAlignedSeqLength = alignment->tAlignedSeq.length = 0;
}
}
else {
genomePrefix.Free();
}
}
}
ComputeAlignmentStats(*alignment,
alignment->qAlignedSeq.seq,
alignment->tAlignedSeq.seq, distScoreFn, params.affineAlign);
intvIt++;
if (params.progress) {
cout << "done with interval " << alignmentIndex << endl;
}
if (params.verbosity > 0) {
cout << "interval align score: " << alignScore << endl;
StickPrintAlignment(*alignment,
(DNASequence&) alignment->qAlignedSeq,
(DNASequence&) alignment->tAlignedSeq,
cout,
0, alignment->tAlignedSeqPos);
}
} while (intvIt != weightedIntervals.end());
}
bool FirstContainsSecond(DNALength aStart, DNALength aEnd, DNALength bStart, DNALength bEnd) {
return ((bStart > aStart and bEnd <= aEnd) or
(bStart >= aStart and bEnd < aEnd));
}
template<typename T_Sequence>
bool CheckForSufficientMatch(T_Sequence &read, vector<T_AlignmentCandidate*> &alignmentPtrs, MappingParameters ¶ms) {
if (alignmentPtrs.size() > 0 and alignmentPtrs[0]->score < params.maxScore) {
return true;
}
else {
return false;
}
}
void DeleteAlignments(vector<T_AlignmentCandidate*> &alignmentPtrs, int startIndex=0) {
int i;
for (i = startIndex; i < alignmentPtrs.size(); i++ ) {
delete alignmentPtrs[i];
}
alignmentPtrs.resize(0);
}
int RemoveLowQualitySDPAlignments(int readLength, vector<T_AlignmentCandidate*> &alignmentPtrs, MappingParameters ¶ms) {
// Just a hack. For now, assume there is at least 1 match per 50 bases.
int totalBasesMatched = 0;
int a;
for (a = 0; a < alignmentPtrs.size(); a++) {
int b;
for (b = 0; b < alignmentPtrs[a]->blocks.size(); b++) {
totalBasesMatched += alignmentPtrs[a]->blocks[b].length;
}
int expectedMatches = params.sdpTupleSize/50.0 * readLength;
if (totalBasesMatched < expectedMatches) {
delete alignmentPtrs[a];
alignmentPtrs[a] = NULL;
}
}
int packedAlignmentIndex = 0;
for (a = 0; a < alignmentPtrs.size(); a++) {
if (alignmentPtrs[a] != NULL) {
alignmentPtrs[packedAlignmentIndex] = alignmentPtrs[a];
packedAlignmentIndex++;
}
}
alignmentPtrs.resize(packedAlignmentIndex);
return packedAlignmentIndex;
}
template<typename T_Sequence>
int RemoveLowQualityAlignments(T_Sequence &read, vector<T_AlignmentCandidate*> &alignmentPtrs, MappingParameters ¶ms) {
if (params.verbosity > 0) {
cout << "checking at least " << alignmentPtrs.size() << " alignments to see if they are accurate." << endl;
}
UInt i;
for (i = 0; i < MIN(params.nCandidates, alignmentPtrs.size()); i++) {
if (params.verbosity > 0) {
cout << "Quality check " << i << " " << alignmentPtrs[i]->score << endl;
}
if (params.maxGap > 0) {
UInt j;
for (j = 1; j < alignmentPtrs[i]->blocks.size(); j++) {
int gq, gt;
gq = alignmentPtrs[i]->blocks[j].qPos - alignmentPtrs[i]->blocks[j-1].qPos - alignmentPtrs[i]->blocks[j].length;
gt = alignmentPtrs[i]->blocks[j].tPos - alignmentPtrs[i]->blocks[j-1].tPos - alignmentPtrs[i]->blocks[j].length;
if ((gq >= params.maxGap and gt < params.maxGap) or
(gt > params.maxGap and gq < params.maxGap) ) {
//
// Flag alignment to be deleted.
//
alignmentPtrs[i]->score = params.maxScore;
break;
}
}
}
if (alignmentPtrs[i]->blocks.size() == 0 or
alignmentPtrs[i]->score > params.maxScore) {
//
// Since the alignments are sorted according to alignment
// score, once one of the alignments is too low of a score,
// all remaining alignments are also too low, and should be
// removed as well. Do that all at once.
//
if (alignmentPtrs[i]->blocks.size() == 0 and params.verbosity > 0) {
cout << "Removing empty alignment " << alignmentPtrs[i]->qName << endl;
}
if (params.verbosity > 0) {
cout << alignmentPtrs[i]->qName << " alignment " << i << " is too low of a score." << alignmentPtrs[i]->score << endl;
}
int deletedIndex = i;
for (; deletedIndex < alignmentPtrs.size(); deletedIndex++) {
delete alignmentPtrs[deletedIndex];
alignmentPtrs[deletedIndex] = NULL;
}
alignmentPtrs.erase(i + alignmentPtrs.begin(), alignmentPtrs.end());
break;
}
else {
if (params.verbosity > 0) {
cout << "Keeping alignment " << i << " " << alignmentPtrs[i]->qPos << " " << alignmentPtrs[i]->qPos + alignmentPtrs[i]->qLength
<< " " << alignmentPtrs[i]->tName << " " << alignmentPtrs[i]->tPos << " " << alignmentPtrs[i]->tPos + alignmentPtrs[i]->tLength << " " << alignmentPtrs[i]->tStrand
<< " from score: " << alignmentPtrs[i]->score << endl;
}
}
}
return alignmentPtrs.size();
}
int RemoveOverlappingAlignments(vector<T_AlignmentCandidate*> &alignmentPtrs, MappingParameters ¶ms) {
vector<unsigned char> alignmentIsContained;
alignmentIsContained.resize(alignmentPtrs.size());
std::fill(alignmentIsContained.begin(), alignmentIsContained.end(), false);
int j;
int numContained = 0;
int curNotContained = 0;
if (alignmentPtrs.size() > 0) {
UInt i;
for (i = 0; i < alignmentPtrs.size()-1; i++ ){
T_AlignmentCandidate *aref = alignmentPtrs[i];
if (aref->pctSimilarity < params.minPctIdentity) {
continue;
}
for (j = i + 1; j < alignmentPtrs.size(); j++ ){
//
// Make sure this alignment isn't already removed.
//
if (alignmentIsContained[j]) {
continue;
}
//
// Only check for containment if the two sequences are from the same contig.
//
if (alignmentPtrs[i]->tIndex != alignmentPtrs[j]->tIndex) {
continue;
}
//
// Check for an alignment that is fully overlapping another
// alignment.
if (aref->GenomicTBegin() <= alignmentPtrs[j]->GenomicTBegin() and
aref->GenomicTEnd() >= alignmentPtrs[j]->GenomicTEnd() and
alignmentPtrs[i]->tStrand == alignmentPtrs[j]->tStrand) {
//
// Alignment i is contained in j is only true if it has a worse score.
//
if (aref->score <= alignmentPtrs[j]->score) {
alignmentIsContained[j] = true;
}
if (params.verbosity >= 2) {
cout << "alignment " << i << " is contained in " << j << endl;
cout << aref->tAlignedSeqPos << " " << alignmentPtrs[j]->tAlignedSeqPos << " "
<< aref->tAlignedSeqPos + aref->tAlignedSeqLength << " "
<< alignmentPtrs[j]->tAlignedSeqPos + alignmentPtrs[j]->tAlignedSeqLength << endl;
}
}
else if (alignmentPtrs[j]->GenomicTBegin() <= aref->GenomicTBegin() and
alignmentPtrs[j]->GenomicTEnd() >= aref->GenomicTEnd() and
alignmentPtrs[i]->tStrand == alignmentPtrs[j]->tStrand) {
if (params.verbosity >= 2) {
cout << "ALIGNMENT " << j << " is contained in " << i << endl;
cout << alignmentPtrs[j]->tAlignedSeqPos << " " << aref->tAlignedSeqPos << " "
<< alignmentPtrs[j]->tAlignedSeqPos + alignmentPtrs[j]->tAlignedSeqLength << " "
<< aref->tAlignedSeqPos + aref->tAlignedSeqLength << endl;
}
if (alignmentPtrs[j]->score <= aref->score) {
alignmentIsContained[i] = true;
}
}
}
}
for (i = 0; i < alignmentPtrs.size(); i++) {
T_AlignmentCandidate *aref = alignmentPtrs[i];
if (alignmentIsContained[i]) {
delete alignmentPtrs[i];
alignmentPtrs[i] = NULL;
numContained++;
}
else {
alignmentPtrs[curNotContained] = aref;
++curNotContained;
}
}
alignmentPtrs.resize(alignmentPtrs.size() - numContained);
}
return alignmentPtrs.size();
}
template<typename T_RefSequence, typename T_Sequence>
void RefineAlignments(vector<T_Sequence*> &bothQueryStrands,
T_RefSequence &genome,
vector<T_AlignmentCandidate*> &alignmentPtrs, MappingParameters ¶ms, MappingBuffers &mappingBuffers) {
UInt i;
for (i = 0; i < alignmentPtrs.size(); i++ ) {
RefineAlignment(*bothQueryStrands[0], genome, *alignmentPtrs[i], params, mappingBuffers);
}
//
// It's possible the alignment references change their order after running
// the local alignments. This is made into a parameter rather than resorting
// every time so that the performance gain by resorting may be measured.
//
if (params.sortRefinedAlignments) {
std::sort(alignmentPtrs.begin(), alignmentPtrs.end(), SortAlignmentPointersByScore());
}
}
void AssignRefContigLocation(T_AlignmentCandidate &alignment, SequenceIndexDatabase<FASTQSequence> &seqdb, DNASequence &genome) {
//
// If the sequence database is used, the start position of
// the alignment is relative to the start of the chromosome,
// not the entire index. Subtract off the start position of
// the chromosome to get the true position.
//
DNALength forwardTPos;
int seqDBIndex;
if (alignment.tStrand == 0) {
forwardTPos = alignment.tAlignedSeqPos;
seqDBIndex = seqdb.SearchForIndex(forwardTPos);
alignment.tAlignedSeqPos -= seqdb.seqStartPos[seqDBIndex];
}
else {
//
// Flip coordinates into forward strand in order to find the boundaries
// of the contig, then reverse them in order to find offset.
//
// Find the reverse complement coordinate of the index of the last aligned base.
assert(alignment.tAlignedSeqLength > 0);
forwardTPos = genome.MakeRCCoordinate(alignment.tAlignedSeqPos + alignment.tAlignedSeqLength - 1);
seqDBIndex = seqdb.SearchForIndex(forwardTPos);
//
// Find the reverse comlement coordinate of the last base of this
// sequence. This would normally be the start of the next contig
// -1 to get the length, but since an 'N' is added between every
// pair of sequences, this is -2.
//
DNALength reverseTOffset;
reverseTOffset = genome.MakeRCCoordinate(seqdb.seqStartPos[seqDBIndex+1]-2);
alignment.tAlignedSeqPos -= reverseTOffset;
}
}
void AssignRefContigLocations(vector<T_AlignmentCandidate*> &alignmentPtrs, SequenceIndexDatabase<FASTQSequence> &seqdb, DNASequence &genome) {
UInt i;
for (i = 0; i < alignmentPtrs.size(); i++) {
T_AlignmentCandidate *aref = alignmentPtrs[i];
AssignRefContigLocation(*aref, seqdb, genome);
}
}
template<typename T_RefSequence>
void AssignGenericRefContigName(vector<T_AlignmentCandidate*> &alignmentPtrs, T_RefSequence &genome) {
UInt i;
for (i = 0; i < alignmentPtrs.size(); i++) {
T_AlignmentCandidate *aref = alignmentPtrs[i];
aref->tName = genome.title;
}
}
int basesAligned = 0;
int nReads = 0;
template<typename T_Sequence, typename T_RefSequence, typename T_SuffixArray, typename T_TupleCountTable>
void MapRead(T_Sequence &read, T_Sequence &readRC, T_RefSequence &genome,
T_SuffixArray &sarray,
BWT &bwt,
SeqBoundaryFtr<FASTQSequence> &seqBoundary,
T_TupleCountTable &ct,
SequenceIndexDatabase<FASTQSequence> &seqdb,
MappingParameters ¶ms,
MappingMetrics &metrics,
vector<T_AlignmentCandidate*> &alignmentPtrs,
MappingBuffers &mappingBuffers,
MappingIPC *mapData) {
bool matchFound;
WeightedIntervalSet<ChainedMatchPos> topIntervals(params.nCandidates);
int numKeysMatched=0, rcNumKeysMatched=0;
int expand = params.minExpand;
metrics.clocks.total.Tick();
int nTotalCells = 0;
int forwardNumBasesMatched = 0, reverseNumBasesMatched = 0;
do {
matchFound = false;
mappingBuffers.matchPosList.clear();
mappingBuffers.rcMatchPosList.clear();
alignmentPtrs.clear();
topIntervals.clear();
params.anchorParameters.expand = expand;
metrics.clocks.mapToGenome.Tick();
if (params.verbosity > 1) {
cerr << "mapping to genome." << endl;
}
if (params.useSuffixArray) {
params.anchorParameters.lcpBoundsOutPtr = mapData->lcpBoundsOutPtr;
numKeysMatched =
MapReadToGenome(genome, sarray, read,
params.lookupTableLength,
mappingBuffers.matchPosList,
params.anchorParameters);
//
// Only print values for the read in forward direction (and only
// the first read).
//
mapData->lcpBoundsOutPtr = NULL;
if (!params.forwardOnly) {
rcNumKeysMatched =
MapReadToGenome(genome, sarray, readRC, params.lookupTableLength, mappingBuffers.rcMatchPosList,
params.anchorParameters);
}
}
else if (params.useBwt){
numKeysMatched = MapReadToGenome(bwt, read, read.subreadStart, read.subreadEnd,
mappingBuffers.matchPosList, params.anchorParameters, forwardNumBasesMatched);
if (!params.forwardOnly) {
rcNumKeysMatched = MapReadToGenome(bwt, readRC, readRC.subreadStart, readRC.subreadEnd,
mappingBuffers.rcMatchPosList, params.anchorParameters, reverseNumBasesMatched);
}
}
//
// Look to see if only the anchors are printed.
if (params.anchorFileName != "") {
int i;
if (params.nProc > 1) {
#ifdef __APPLE__
sem_wait(semaphores.writer);
#else
sem_wait(&semaphores.writer);
#endif
}
cout << "writing anchors to " << params.anchorFileName << endl;
for (i = 0; i < mappingBuffers.matchPosList.size(); i++) {
*mapData->anchorFilePtr << mappingBuffers.matchPosList[i].q << " " << mappingBuffers.matchPosList[i].t << " " << mappingBuffers.matchPosList[i].l << " " << 0 << endl;
}
for (i = 0; i < mappingBuffers.rcMatchPosList.size(); i++) {
*mapData->anchorFilePtr << read.length - mappingBuffers.rcMatchPosList[i].q << " " << mappingBuffers.rcMatchPosList[i].t << " " << mappingBuffers.rcMatchPosList[i].l << " " << 1 << endl;
}
if (params.nProc > 1) {
#ifdef __APPLE__
sem_post(semaphores.writer);
#else
sem_post(&semaphores.writer);
#endif
}
}
metrics.totalAnchors += mappingBuffers.matchPosList.size() + mappingBuffers.rcMatchPosList.size();
metrics.clocks.mapToGenome.Tock();
metrics.clocks.sortMatchPosList.Tick();
SortMatchPosList(mappingBuffers.matchPosList);
SortMatchPosList(mappingBuffers.rcMatchPosList);
metrics.clocks.sortMatchPosList.Tock();
PValueWeightor lisPValue(read, genome, ct.tm, &ct);
// MultiplicityPValueWeightor lisPValueByWeight(genome);
LISSumOfLogPWeightor<T_GenomeSequence,vector<ChainedMatchPos> > lisPValueByLogSum(genome);
LISSizeWeightor<vector<ChainedMatchPos> > lisWeightFn;
IntervalSearchParameters intervalSearchParameters;
params.InitializeIntervalSearchParameters(intervalSearchParameters);
//
// If specified, only align a band from the anchors.
//
DNALength squareRefLength = read.length * 1.25 + params.limsAlign;
if (params.limsAlign != 0) {
int fi;
for (fi = 0; fi < mappingBuffers.matchPosList.size(); fi++) {
if (mappingBuffers.matchPosList[fi].t >= squareRefLength) { break; }
}
if (fi < mappingBuffers.matchPosList.size()) {
mappingBuffers.matchPosList.resize(fi);
}
}
metrics.clocks.findMaxIncreasingInterval.Tick();
//
// For now say that something that has a 50% chance of happening
// by chance is too high of a p value. This is probably many times
// the size.
//
intervalSearchParameters.maxPValue = log(0.5);
//
// Remove anchors that are fully encompassed by longer ones. This
// speeds up limstemplate a lot.
//
RemoveOverlappingAnchors(mappingBuffers.matchPosList);
RemoveOverlappingAnchors(mappingBuffers.rcMatchPosList);
if (params.progress != 0) {
cout << "anchors " << mappingBuffers.matchPosList.size() << " " << mappingBuffers.rcMatchPosList.size() << endl;
}
if (params.pValueType == 0) {
int original = mappingBuffers.matchPosList.size();
int numMerged = 0;
if (params.printDotPlots) {
ofstream dotPlotOut;
string dotPlotName = string(read.title) + ".anchors";
CrucialOpen(dotPlotName, dotPlotOut, std::ios::out);
int mp;
for (mp = 0; mp < mappingBuffers.matchPosList.size(); mp++ ){
dotPlotOut << mappingBuffers.matchPosList[mp].q << " " << mappingBuffers.matchPosList[mp].t << " " << mappingBuffers.matchPosList[mp].l << " " << endl;
}
dotPlotOut.close();
}
DNALength maxGapLength = 50000;
DNALength intervalLength = (read.subreadEnd - read.subreadStart) * (1 + params.indelRate);
if (intervalLength - (read.subreadEnd - read.subreadStart) > maxGapLength) {
intervalLength = (read.subreadEnd - read.subreadStart) + maxGapLength;
}
if ( params.piecewiseMatch) {
LISPValueWeightor<T_GenomeSequence, DNATuple, vector<DirMatch > > pwPValue(read, genome, ct.tm, &ct);
LISSizeWeightor<vector<DirMatch> > pwWeightFn;
PiecewiseMatch(mappingBuffers.matchPosList,
mappingBuffers.rcMatchPosList,
params.nCandidates,
seqBoundary,
pwPValue,
pwWeightFn,
topIntervals, genome, read, intervalSearchParameters);
}
else {
FindMaxIncreasingInterval(Forward,
mappingBuffers.matchPosList,
// allow for indels to stretch out the mapping of the read.
intervalLength, params.nCandidates,
seqBoundary,
lisPValue,//lisPValue2,
lisWeightFn,
topIntervals, genome, read, intervalSearchParameters,
&mappingBuffers.globalChainEndpointBuffer,
&mappingBuffers.sdpFragmentSet, read.title);
// Uncomment when the version of the weight functor needs the sequence.
FindMaxIncreasingInterval(Reverse, mappingBuffers.rcMatchPosList,
intervalLength, params.nCandidates,
seqBoundary,
lisPValue,//lisPValue2
lisWeightFn,
topIntervals, genome, readRC, intervalSearchParameters,
&mappingBuffers.globalChainEndpointBuffer,
&mappingBuffers.sdpFragmentSet, read.title);
}
}
/* else if (params.pValueType == 1) {
FindMaxIncreasingInterval(Forward,
mappingBuffers.matchPosList,
// allow for indels to stretch out the mapping of the read.
(DNALength) ((read.subreadEnd - read.subreadStart) * (1 + params.indelRate)), params.nCandidates,
seqBoundary,
lisPValueByWeight,
lisWeightFn,
topIntervals, genome, read, intervalSearchParameters,
&mappingBuffers.globalChainEndpointBuffer,
read.title);
FindMaxIncreasingInterval(Reverse, mappingBuffers.rcMatchPosList,
(DNALength) ((read.subreadEnd - read.subreadStart) * (1 + params.indelRate)), params.nCandidates,
seqBoundary,
lisPValueByWeight,
lisWeightFn,
topIntervals, genome, readRC, intervalSearchParameters,
&mappingBuffers.globalChainEndpointBuffer,
read.title);
}*/
else if (params.pValueType == 2) {
FindMaxIncreasingInterval(Forward,
mappingBuffers.matchPosList,
// allow for indels to stretch out the mapping of the read.
(DNALength) ((read.subreadEnd - read.subreadStart) * (1 + params.indelRate)), params.nCandidates,
seqBoundary,
lisPValueByLogSum,
lisWeightFn,
topIntervals, genome, read, intervalSearchParameters,
&mappingBuffers.globalChainEndpointBuffer,
&mappingBuffers.sdpFragmentSet,
read.title);
FindMaxIncreasingInterval(Reverse, mappingBuffers.rcMatchPosList,
(DNALength) ((read.subreadEnd - read.subreadStart) * (1 + params.indelRate)), params.nCandidates,
seqBoundary,
lisPValueByLogSum,
lisWeightFn,
topIntervals, genome, readRC, intervalSearchParameters,
&mappingBuffers.globalChainEndpointBuffer,
&mappingBuffers.sdpFragmentSet,
read.title);
}
metrics.clocks.findMaxIncreasingInterval.Tock();
//
// Print verbose output.
//
WeightedIntervalSet<ChainedMatchPos>::iterator topIntIt, topIntEnd;
topIntEnd = topIntervals.end();
if (params.removeContainedIntervals) {
topIntervals.RemoveContained();
}
//
// Allocate candidate alignments on the stack. Each interval is aligned.
//
alignmentPtrs.resize(topIntervals.size());
if (params.verbosity > 0) {
int topintind = 0;
cout << " intv: index start end qstart qend seq_boundary_start seq_boundary_end strand pvalue " << endl;
for (topIntIt = topIntervals.begin();topIntIt != topIntEnd ; ++topIntIt) {
cout << " intv: " << topintind << " " << (*topIntIt).start << " "
<< (*topIntIt).end << " "
<< (*topIntIt).qStart << " " << (*topIntIt).qEnd << " "
<< seqBoundary((*topIntIt).start) << " " << seqBoundary((*topIntIt).end) << " "
<< (*topIntIt).GetStrandIndex() << " "
<< (*topIntIt).pValue << endl;
if (params.verbosity > 2) {
int m;
for (m = 0; m < (*topIntIt).matches.size(); m++) {
cout << " (" << (*topIntIt).matches[m].q << ", " << (*topIntIt).matches[m].t << ", " << (*topIntIt).matches[m].l << ") ";
}
cout << endl;
}
++topintind;
}
}
UInt i;
for (i = 0; i < alignmentPtrs.size(); i++ ) {
alignmentPtrs[i] = new T_AlignmentCandidate;
}
metrics.clocks.alignIntervals.Tick();
AlignIntervals( genome, read, readRC,
topIntervals,
SMRTDistanceMatrix,
params.indel, params.indel,
params.sdpTupleSize,
params.useSeqDB, seqdb,
alignmentPtrs,
params,
params.useScoreCutoff, params.maxScore,
mappingBuffers,
params.startRead );
std::sort(alignmentPtrs.begin(), alignmentPtrs.end(), SortAlignmentPointersByScore());
metrics.clocks.alignIntervals.Tock();
//
// Evalutate the matches that are found for 'good enough'.
//
matchFound = CheckForSufficientMatch(read, alignmentPtrs, params);
//
// When no proper alignments are found, the loop will resume.
// Delete all alignments because they are bad.
//
if (expand < params.maxExpand and matchFound == false) {
DeleteAlignments(alignmentPtrs, 0);
}
//
// Record some metrics that show how long this took to run per base.
//
if (alignmentPtrs.size() > 0) {
metrics.RecordNumAlignedBases(read.length);
metrics.RecordNumCells(alignmentPtrs[0]->nCells);
}
if (matchFound == true) {
metrics.totalAnchorsForMappedReads += mappingBuffers.matchPosList.size() + mappingBuffers.rcMatchPosList.size();
}
++expand;
} while ( expand <= params.maxExpand and matchFound == false);
metrics.clocks.total.Tock();
UInt i;
int totalCells = 0;
for (i = 0; i< alignmentPtrs.size(); i++) {
totalCells += alignmentPtrs[i]->nCells;
}
//
// Some of the alignments are to spurious regions. Delete the
// references that have too small of a score.
//
int effectiveReadLength = 0;
for (i = 0; i< read.length; i++) {
if (read.seq[i] != 'N') effectiveReadLength++;
}
if (params.sdpFilterType == 0) {
RemoveLowQualityAlignments(read, alignmentPtrs, params);
}
else if (params.sdpFilterType == 1) {
RemoveLowQualitySDPAlignments(effectiveReadLength, alignmentPtrs, params);
}
//
// Now remove overlapping alignments.
//
vector<T_Sequence*> bothQueryStrands;
bothQueryStrands.resize(2);
bothQueryStrands[Forward] = &read;
bothQueryStrands[Reverse] = &readRC;
//
// Possibly use banded dynamic programming to refine the columns
// of an alignment and the alignment score.
//
if (params.refineAlignments) {
RefineAlignments(bothQueryStrands, genome, alignmentPtrs, params, mappingBuffers);
}
RemoveLowQualityAlignments(read,alignmentPtrs, params);
RemoveOverlappingAlignments(alignmentPtrs, params);
if (params.forPicard) {
int a;
for (a = 0; a < alignmentPtrs.size(); a++ ) {
alignmentPtrs[a]->OrderGapsByType();
}
}
//
// Assign the query name and strand for each alignment.
//
for (i = 0; i < alignmentPtrs.size(); i++) {
T_AlignmentCandidate *aref = alignmentPtrs[i];
// aref->qStrand = aref->readIndex;
if (aref->tStrand == 0) {
aref->qName = read.GetName();
}
else {
aref->qName = readRC.GetName();
}
}
AssignRefContigLocations(alignmentPtrs, seqdb, genome);
}
void SumMismatches(SMRTSequence &read,
T_AlignmentCandidate &alignment,
int mismatchScore,
int fullIntvStart, int fullIntvEnd,
int &sum) {
int alnStart, alnEnd;
alignment.GetQIntervalOnForwardStrand(alnStart, alnEnd);
int p;
sum = 0;
if (read.substitutionQV.Empty() == false) {
for (p = fullIntvStart; p < alnStart; p++) {
sum += read.substitutionQV[p];
}
for (p = alnEnd; p < fullIntvEnd; p++) {
sum += read.substitutionQV[p];
}
}
else {
sum += mismatchScore * ((alnStart - fullIntvStart) + (fullIntvEnd - alnEnd));
}
}
int FindMaxLengthAlignment(vector<T_AlignmentCandidate*> alignmentPtrs,
int &maxLengthIndex) {
int i;
int maxLength = 0;
maxLengthIndex = -1;
for (i = 0; i < alignmentPtrs.size(); i++) {
int qStart, qEnd;
alignmentPtrs[i]->GetQInterval(qStart, qEnd);
if (qEnd - qStart > maxLength) {
maxLengthIndex = i;
maxLength = qEnd - qStart;
}
}
return (maxLength != -1);
}
bool AlignmentsOverlap(T_AlignmentCandidate &alnA, T_AlignmentCandidate &alnB, float minPercentOverlap) {
int alnAStart, alnAEnd, alnBStart, alnBEnd;
bool useForwardStrand=true;
alnA.GetQInterval(alnAStart, alnAEnd, useForwardStrand);
alnB.GetQInterval(alnBStart, alnBEnd, useForwardStrand);
// Look if one alignment encompasses the other
int ovp = 0;
if (alnAStart <= alnBStart and alnAEnd >= alnBEnd) {
return true;
}
else if (alnBStart <= alnAStart and alnBEnd >= alnAEnd) {
return true;
}
else {
//
// Look to see if the alignments overlap
//
if (alnAEnd >= alnBStart and alnAEnd <= alnBEnd) {
ovp = alnAEnd - alnBStart;
}
else if (alnAStart >= alnBStart and alnAStart <= alnBEnd) {
ovp = alnBEnd - alnAStart;
}
}
float ovpPercent;
if (alnAEnd - alnAStart > 0 and alnBEnd - alnBStart > 0) {
ovpPercent = max(float(ovp) / float((alnAEnd - alnAStart)),
float(ovp) / float((alnBEnd - alnBStart)));
}
else {
ovpPercent = 0;
}
// returns true when an overlap is found.
return ( ovpPercent > minPercentOverlap);
}
void PartitionOverlappingAlignments(vector<T_AlignmentCandidate*> &alignmentPtrs,
vector<set<int> > &partitions,
float minOverlap) {
if (alignmentPtrs.size() == 0) {
partitions.clear();
return;
}
set<int>::iterator setIt, setEnd;
int i, p;
bool overlapFound = false;
for (i = 0; i < alignmentPtrs.size(); i++) {
overlapFound = false;
for (p = 0; p < partitions.size() and overlapFound == false; p++) {
setEnd = partitions[p].end();
for (setIt = partitions[p].begin(); setIt != partitions[p].end() and overlapFound == false; ++setIt) {
if (AlignmentsOverlap(*alignmentPtrs[i], *alignmentPtrs[*setIt], minOverlap) or
(alignmentPtrs[i]->QAlignStart() <= alignmentPtrs[*setIt]->QAlignStart()) and
(alignmentPtrs[i]->QAlignEnd() > alignmentPtrs[*setIt]->QAlignEnd())) {
partitions[p].insert(i);
overlapFound = true;
}
}
}
//
// If this alignment does not overlap any other, create a
// partition with it as the first element.
//
if (overlapFound == false) {
partitions.push_back(set<int>());
partitions[partitions.size()-1].insert(i);
}
}
}
void StoreMapQVs(SMRTSequence &read,
vector<T_AlignmentCandidate*> &alignmentPtrs,
MappingParameters ¶ms,
MappingBuffers &mappingBuffers,
string title="") {
//
// Only weight alignments for mapqv against eachother if they are overlapping.
//
int a;
vector<set<int> > partitions; // Each set contains alignments that overlap on the read.
DistanceMatrixScoreFunction<DNASequence, FASTQSequence> distScoreFn;
params.InitializeScoreFunction(distScoreFn);
distScoreFn.InitializeScoreMatrix(SMRTLogProbMatrix);
//
// Rescore the alignment so that it uses probabilities.
//
for (a = 0; a < alignmentPtrs.size(); a++) {
alignmentPtrs[a]->probScore = -ComputeAlignmentScore(*alignmentPtrs[a],
alignmentPtrs[a]->qAlignedSeq,
alignmentPtrs[a]->tAlignedSeq,
distScoreFn, params.affineAlign) / 10.0;
}
PartitionOverlappingAlignments(alignmentPtrs, partitions, params.minFractionToBeConsideredOverlapping);
int p;
set<int>::iterator partIt, partEnd;
//
// For each partition, store where on the read it begins, and where
// it ends.
//
vector<int> partitionBeginPos, partitionEndPos, partitionScore;
partitionBeginPos.resize(partitions.size(), -1);
partitionEndPos.resize(partitions.size(), -1);
partitionScore.resize(partitions.size(), 0);
vector<char> assigned;
assigned.resize( alignmentPtrs.size());
fill(assigned.begin(), assigned.end(), false);
for (p = 0; p < partitions.size(); p++) {
partEnd = partitions[p].end();
int alnStart, alnEnd;
if (partitions[p].size() > 0) {
partIt = partitions[p].begin();
alignmentPtrs[*partIt]->GetQInterval(alnStart, alnEnd);
partitionBeginPos[p] = alnStart;
partitionEndPos[p] = alnEnd;
partitionScore[p] = alignmentPtrs[*partIt]->nMatch;
++partIt;
partEnd = partitions[p].end();
for (; partIt != partEnd; ++partIt) {
alignmentPtrs[*partIt]->GetQInterval(alnStart, alnEnd);
//
if (alnEnd - alnStart > partitionEndPos[p] - partitionBeginPos[p] and alignmentPtrs[*partIt]->nMatch *1.20 >= partitionScore[p]) {
partitionBeginPos[p] = alnStart;
partitionEndPos[p] = alnEnd;
partitionScore[p] = alignmentPtrs[*partIt]->nMatch;
}
}
}
}
//
// For each partition, determine the widest parts of the read that
// are aligned in the partition. All alignments will be extended to
// the end of the widest parts of the partition.
//
const static bool convertToForwardStrand = true;
UInt i;
//
// For now, just use the alignment score as the probability score.
// Although it is possible to use the full forward probability, for
// the most part it is pretty much the same as the Vitterbi
// probability, but it takes a lot longer to compute.
//
//
// Now estimate what the alignment scores would be if they were
// extended past the ends of their current alignment.
//
for (p = 0; p < partitions.size(); p++) {
partEnd = partitions[p].end();
int alnStart, alnEnd;
for (partIt = partitions[p].begin(); partitions[p].size() > 0 and partIt != partEnd; ++partIt) {
int frontSum = 0, endSum = 0;
int alnStart, alnEnd;
int mismatchSum = 0;
alignmentPtrs[*partIt]->GetQInterval(alnStart, alnEnd, convertToForwardStrand);
if (alnStart - partitionBeginPos[p] > MAPQV_END_ALIGN_WIGGLE or
partitionEndPos[p] - alnEnd > MAPQV_END_ALIGN_WIGGLE) {
SumMismatches(read, *alignmentPtrs[*partIt], 15,
partitionBeginPos[p], partitionEndPos[p], mismatchSum);
}
//
// Random sequence can be aligned with about 50% similarity due
// to optimization, so weight the qv sum
//
alignmentPtrs[*partIt]->probScore += -(mismatchSum) * 0.5;
}
}
//
// Determine mapqv by summing qvscores in partitions
float mapQVDenominator = 0;
for (p = 0; p < partitions.size(); p++) {
set<int>::iterator nextIt;
if (partitions[p].size() == 0) {
continue;
}
int index = *partitions[p].begin();
mapQVDenominator = alignmentPtrs[index]->probScore;
int maxNMatch = alignmentPtrs[index]->nMatch;
if (partitions[p].size() > 1) {
partIt = partitions[p].begin();
partEnd = partitions[p].end();
++partIt;
for (; partIt != partEnd; ++partIt) {
index = *partIt;
if (alignmentPtrs[index]->nMatch > maxNMatch) {
maxNMatch = alignmentPtrs[index]->nMatch;
}
if (alignmentPtrs[index]->nMatch * 1.2 >= maxNMatch) {
mapQVDenominator = LogSumOfTwo(mapQVDenominator, alignmentPtrs[index]->probScore);
}
}
}
for (partIt = partitions[p].begin();
partIt != partitions[p].end(); ++partIt) {
//
// If only one alignment is found, assume maximum mapqv.
//
assigned[*partIt] = true;
if (partitions[p].size() == 1) {
alignmentPtrs[*partIt]->mapQV = MAX_PHRED_SCORE;
}
//
// Look for overflow.
//
else if (alignmentPtrs[*partIt]->probScore - mapQVDenominator < -20) {
alignmentPtrs[*partIt]->mapQV = 0;
}
else {
double log10 = log(10);
double sub = alignmentPtrs[*partIt]->probScore - mapQVDenominator;
double expo = exp(log10*sub);
double diff = 1.0 - expo;
int phredValue;
if (expo == 0) {
phredValue = 0;
}
else if (diff == 0) {
phredValue = MAX_PHRED_SCORE;
}
else {
phredValue = Phred(diff);
}
if (phredValue > MAX_PHRED_SCORE) {
phredValue = MAX_PHRED_SCORE;
}
if (phredValue < 0) {
phredValue = 0;
}
alignmentPtrs[*partIt]->mapQV = phredValue;
assigned[*partIt]=true;
}
}
}
for (i = 0; i < assigned.size(); i++) {
assert(assigned[i]);
}
}
//
// The full read is not the subread, and does not have masked off characters.
//
void PrintAlignment(T_AlignmentCandidate &alignment, SMRTSequence &fullRead, MappingParameters ¶ms, AlignmentContext &alignmentContext, ostream &outFile) {
if (alignment.score > params.maxScore) {
if (params.verbosity > 0) {
cout << "Not using " << alignment.qAlignedSeqPos << " " << alignment.tAlignedSeqPos << " because score: " << alignment.score << " is too low (" << params.maxScore << ")" << endl;
}
return;
}
if (alignment.pctSimilarity < params.minPctIdentity) {
if (params.verbosity > 0) {
cout << "Not using " << alignment.qAlignedSeqPos << " " << alignment.tAlignedSeqPos << " because identity: " << alignment.pctSimilarity << " is too low (" << params.minPctIdentity << ")" << endl;
}
return;
}
if (alignment.tAlignedSeq.length < params.minAlignLength) {
if (params.verbosity > 0) {
cout << "Not using " << alignment.qAlignedSeqPos << " " << alignment.tAlignedSeqPos << " because length: " << alignment.tAlignedSeq.length << " is too short (" << params.minAlignLength << ")" << endl;
}
return;
}
if (alignment.mapQV < params.minMapQV) {
return;
}
try {
int lastBlock = alignment.blocks.size() - 1;
if (params.printFormat == StickPrint) {
PrintAlignmentStats(alignment, outFile);
StickPrintAlignment(alignment,
(DNASequence&) alignment.qAlignedSeq,
(DNASequence&) alignment.tAlignedSeq,
outFile,
alignment.qAlignedSeqPos, alignment.tAlignedSeqPos);
}
else if (params.printFormat == SAM) {
SAMOutput::PrintAlignment(alignment, fullRead, outFile, alignmentContext, params.samQVList, params.clipping);
}
else if (params.printFormat == CompareXML) {
CompareXMLPrintAlignment(alignment,
(DNASequence&) alignment.qAlignedSeq, (DNASequence&) alignment.tAlignedSeq,
outFile,
alignment.qAlignedSeqPos, alignment.tAlignedSeqPos);
}
else if (params.printFormat == Vulgar) {
PrintAlignmentStats(alignment, outFile);
VulgarPrintAlignment(alignment, outFile);
}
else if (params.printFormat == CompareSequencesParsable) {
PrintCompareSequencesAlignment(alignment, alignment.qAlignedSeq, alignment.tAlignedSeq, outFile);
}
else if (params.printFormat == Interval) {
if (alignment.blocks.size() > 0) {
IntervalAlignmentPrinter::Print(alignment, outFile);
}
}
else if (params.printFormat == SummaryPrint) {
if (alignment.blocks.size() > 0) {
SummaryAlignmentPrinter::Print(alignment, outFile);
}
}
}
catch (ostream::failure f) {
cout << "ERROR writing to output file. The output drive may be full, or you " << endl;
cout << "may not have proper write permissions." << endl;
exit(1);
}
}
void PrintAlignments(vector<T_AlignmentCandidate*> alignmentPtrs,
SMRTSequence &read,
MappingParameters ¶ms, ostream &outFile,
AlignmentContext alignmentContext) {
//
// Print all alignments, unless the parameter placeRandomly is set.
// In this case only one read is printed and it is selected from all
// equally top scoring hits.
//
UInt i;
int optScore;
int nOpt = 0;
if (params.verbosity > 0) {
cout << "Printing " << alignmentPtrs.size() << " alignments." << endl;
}
if (params.placeRandomly) {
if (alignmentPtrs.size() > 0) {
optScore = alignmentPtrs[0]->score;
nOpt = 1;
// First find the minimum score, and count how many times it
// exists
for (i = 1; i < alignmentPtrs.size(); i++) {
if (alignmentPtrs[i]->score < optScore) {
optScore = alignmentPtrs[i]->score;
nOpt = 1;
}
else if (alignmentPtrs[i]->score == optScore) {
nOpt++;
}
}
}
}
int prev=totalBases / 10000000;
totalBases += read.length;
totalReads += 1;
if (totalBases / 10000000 > prev) {
cerr << "Processed " << totalReads << " (" << totalBases << " bp)" << endl;
}
if (params.nProc > 1) {
#ifdef __APPLE__
sem_wait(semaphores.writer);
#else
sem_wait(&semaphores.writer);
#endif
}
int optIndex = 0;
int startIndex = 0;
int endIndex = 0;
if (params.placeRandomly) {
startIndex = RandomInt(nOpt);
assert(startIndex < nOpt);
endIndex = startIndex + 1;
}
else {
startIndex = 0;
endIndex = MIN(params.nBest, alignmentPtrs.size());
}
for (i = startIndex; i < endIndex; i++) {
T_AlignmentCandidate *aref = alignmentPtrs[i];
if (aref->blocks.size() == 0) {
//
// If the SDP alignment finds nothing, there will be no
// blocks. This may happen if the sdp block size is larger
// than the anchor size found with the suffix array. When no
// blocks are found there is no alignment, so zero-out the
// score and continue.
//
aref->score = 0;
if (params.verbosity > 0) {
cout << "Zero blocks found for " << aref->qName << " " << aref->qAlignedSeqPos << " " << aref->tAlignedSeqPos << endl;
}
continue;
}
//
// Configure some of the alignment context before printing.
//
if (i > 0 and params.placeRandomly == false) {
alignmentContext.isPrimary = false;
}
else {
alignmentContext.isPrimary = true;
}
PrintAlignment(*alignmentPtrs[i], read, params, alignmentContext, outFile);
}
if (params.nProc > 1) {
#ifdef __APPLE__
sem_post(semaphores.writer);
#else
sem_post(&semaphores.writer);
#endif
}
}
template<typename T_Sequence>
bool GetNextReadThroughSemaphore(ReaderAgglomerate &reader, MappingParameters ¶ms, T_Sequence &read, AlignmentContext &context) {
//
// Grab the value of the semaphore for debugging purposes.
//
// uncomment when needed
// int semvalue;
// if (params.nProc > 1) {
// sem_getvalue(&semaphores.reader, &semvalue);
// }
//
// Wait on a semaphore
if (params.nProc > 1) {
#ifdef __APPLE__
sem_wait(semaphores.reader);
#else
sem_wait(&semaphores.reader);
#endif
}
bool returnValue = true;
//
// CCS Reads are read differently from other reads. Do static casting here
// of this.
//
if (reader.GetNext(read) == 0) {
returnValue = false;
}
//
// Set the read group id before releasing the semaphore, since other
// threads may change the reader object to a new read group before
// sending this alignment out to printing.
context.readGroupId = reader.readGroupId;
if (params.nProc > 1) {
#ifdef __APPLE__
sem_post(semaphores.reader);
#else
sem_post(&semaphores.reader);
#endif
}
return returnValue;
}
void AssignMapQV(vector<T_AlignmentCandidate*> &alignmentPtrs) {
int i;
int mapQV = 1;
if (alignmentPtrs.size() > 1 and alignmentPtrs[0]->score == alignmentPtrs[1]->score) {
// the top two alignments have the same score, don't consider them as mapped.
mapQV = 0;
}
for (i = 0; i < alignmentPtrs.size(); i++) {
alignmentPtrs[i]->mapQV = mapQV;
}
}
//template<typename T_SuffixArray, typename T_GenomeSequence, typename T_Tuple>
void MapReads(MappingData<T_SuffixArray, T_GenomeSequence, T_Tuple> *mapData) {
//
// Step 1, initialize local pointers to map data
// for programming shorthand.
//
MappingParameters params = mapData->params;
DNASuffixArray sarray;
TupleCountTable<T_GenomeSequence, DNATuple> ct;
SequenceIndexDatabase<FASTQSequence> seqdb;
FASTQSequence fastaGenome;
T_GenomeSequence genome;
BWT *bwtPtr;
mapData->ShallowCopySuffixArray(sarray);
mapData->ShallowCopyReferenceSequence(genome);
mapData->ShallowCopySequenceIndexDatabase(seqdb);
mapData->ShallowCopyTupleCountTable(ct);
bwtPtr = mapData->bwtPtr;
SeqBoundaryFtr<FASTQSequence> seqBoundary(&seqdb);
VectorIndex i, j;
if (params.match != 0) {
}
int numAligned = 0;
SMRTSequence smrtRead, smrtReadRC;
SMRTSequence unrolledReadRC;
CCSSequence ccsRead;
RegionAnnotation annotation;
T_Sequence read;
int readIndex = -1;
int readsFileIndex;
bool readIsCCS = false;
//
// Reuse the following buffers during alignment. Since these keep
// storage contiguous, hopefully this will decrease memory
// fragmentation.
//
MappingBuffers mappingBuffers;
while (true) {
//
// Scan the next read from input. This may either be a CCS read,
// or regular read (though this may be aligned in whole, or by
// subread).
//
AlignmentContext alignmentContext;
if (mapData->reader->GetFileType() == HDFCCS) {
if (GetNextReadThroughSemaphore(*mapData->reader, params, ccsRead, alignmentContext) == false) {
break;
}
else {
if (params.unrollCcs == false) {
readIsCCS = true;
smrtRead.Copy(ccsRead);
ccsRead.zmwData = smrtRead.zmwData = ccsRead.unrolledRead.zmwData;
ccsRead.SetQVScale(params.qvScaleType);
}
else {
smrtRead.Copy(ccsRead.unrolledRead);
}
++readIndex;
}
}
else {
if (GetNextReadThroughSemaphore(*mapData->reader, params, smrtRead, alignmentContext) == false) {
break;
}
else {
++readIndex;
smrtRead.SetQVScale(params.qvScaleType);
}
}
//
// Only normal (non-CCS) reads should be masked. Since CCS reads store the raw read, that is masked.
//
bool readHasGoodRegion = true;
if (params.useRegionTable and params.useHQRegionTable) {
if (readIsCCS) {
readHasGoodRegion = MaskRead(ccsRead.unrolledRead, ccsRead.unrolledRead.zmwData, *mapData->regionTablePtr);
}
else {
readHasGoodRegion = MaskRead(smrtRead, smrtRead.zmwData, *mapData->regionTablePtr);
}
//
// Store the high quality start and end of this read for masking purposes when printing.
//
int hqStart, hqEnd;
int score;
LookupHQRegion(smrtRead.zmwData.holeNumber, *mapData->regionTablePtr, hqStart, hqEnd, score);
smrtRead.lowQualityPrefix = hqStart;
smrtRead.lowQualitySuffix = smrtRead.length - hqEnd;
}
else {
smrtRead.lowQualityPrefix = 0;
smrtRead.lowQualitySuffix = 0;
}
//
// Give the opportunity to align a subset of reads.
//
if (params.maxReadIndex >= 0 and smrtRead.zmwData.holeNumber > params.maxReadIndex) {
smrtRead.Free();
break;
}
if (params.SkipRead(smrtRead.zmwData.holeNumber)) {
if (readIsCCS) {
ccsRead.Free();
}
smrtRead.Free();
continue;
}
if (readHasGoodRegion == false or (params.readIndex >= 0 and smrtRead.zmwData.holeNumber != params.readIndex)) {
//
// Nothing to do with this read. Skip aligning it entirely.
//
if (readIsCCS) {
ccsRead.Free();
}
smrtRead.Free();
// Stop processing once the specified read index is reached.
// Eventually this will change to just seek to readIndex, and
// just align one read anyway.
if (smrtRead.zmwData.holeNumber > params.readIndex) {
break;
}
continue;
}
//
// Discard reads that are too small, or not labeled as having any
// useable/good sequence.
//
if (smrtRead.length < params.minReadLength or readHasGoodRegion == false or
(params.maxReadLength != 0 and
smrtRead.length > params.maxReadLength)) {
if (readIsCCS) {
ccsRead.Free();
}
smrtRead.Free();
continue;
}
if (smrtRead.qual.Empty() == false and smrtRead.GetAverageQuality() < params.minAvgQual) {
if (readIsCCS) {
ccsRead.Free();
}
smrtRead.Free();
continue;
}
smrtRead.MakeRC(smrtReadRC);
if (readIsCCS) {
ccsRead.unrolledRead.MakeRC(unrolledReadRC);
}
//
// When aligning subreads separately, iterate over each subread, and print the alignments for these.
//
ReadAlignments allReadAlignments;
allReadAlignments.read = smrtRead;
if (readIsCCS == false and params.mapSubreadsSeparately) {
vector<ReadInterval> subreadIntervals;
//
// Determine endpoints of this subread in the main read.
//
if (params.useRegionTable == false) {
//
// When there is no region table, the subread is the entire
// read.
//
ReadInterval wholeRead(0, smrtRead.length);
// The set of subread intervals is just the entire read.
subreadIntervals.push_back(wholeRead);
}
else {
//
// Grab the subread intervals from the entire region table to
// iterate over.
//
CollectSubreadIntervals(smrtRead, mapData->regionTablePtr, subreadIntervals, params.byAdapter);
}
//
// Make room for alignments.
//
allReadAlignments.Resize(subreadIntervals.size());
allReadAlignments.alignMode = Subread;
int endIndex = subreadIntervals.size();
DNALength highQualityStartPos = smrtRead.lowQualityPrefix;
DNALength highQualityEndPos = smrtRead.length - smrtRead.lowQualitySuffix;
DNALength intvIndex;
for (intvIndex = 0; intvIndex < endIndex; intvIndex++) {
SMRTSequence subreadSequence, subreadSequenceRC;
//
// There is a user specified minimum read length. Don't
// bother with reads shorter than this.
//
if ( (subreadIntervals[intvIndex].end < highQualityStartPos) or
(subreadIntervals[intvIndex].start > highQualityEndPos) ) {
continue;
}
if (subreadIntervals[intvIndex].end - subreadIntervals[intvIndex].start < params.minSubreadLength) {
continue;
}
//
// subreadMapType is a way of limiting the portion of the read
// that is aligned. The output is similar, but the
// computation is slightly different. The subreadMapType 0
// was written first, and just creates a hard mask over the
// regions that are not to be aligned. The subreadMapType is
// slightly more formal mode where a new read is pointed to
// the subread then aligned.
//
// subreadMapType of 0 is always used, however eventually it
// may be faster to go to 1, just 1 isn't tested thoroughly
// yet.
//
// Note, for proper SAM printing, subreadMaptype of 0 is needed.
//
if (params.subreadMapType == 0) {
smrtRead.MakeSubreadAsMasked(subreadSequence, subreadIntervals[intvIndex].start, subreadIntervals[intvIndex].end);
}
else if (params.subreadMapType == 1) {
smrtRead.MakeSubreadAsReference(subreadSequence, subreadIntervals[intvIndex].start, subreadIntervals[intvIndex].end);
}
//
// Trim the boundaries of the read so that only the hq regions are aligned, and no N's.
//
if ((subreadSequence.subreadStart < highQualityStartPos) and
(subreadSequence.subreadEnd > highQualityStartPos)) {
subreadSequence.subreadStart = highQualityStartPos;
}
if (subreadSequence.subreadStart < highQualityEndPos and
subreadSequence.subreadEnd > highQualityEndPos) {
subreadSequence.subreadEnd = highQualityEndPos;
}
if (!params.preserveReadTitle) {
smrtRead.SetSubreadTitle(subreadSequence, subreadSequence.subreadStart, subreadSequence.subreadEnd);
}
else {
subreadSequence.CopyTitle(smrtRead.title);
}
subreadSequence.MakeRC(subreadSequenceRC);
subreadSequenceRC.subreadStart = smrtRead.length - subreadSequence.subreadEnd;
subreadSequenceRC.subreadEnd = smrtRead.length - subreadSequence.subreadStart;
//
// Store the sequence that is being mapped in case no hits are
// found, and missing sequences are printed.
//
allReadAlignments.SetSequence(intvIndex, subreadSequence);
vector<T_AlignmentCandidate*> alignmentPtrs;
mapData->metrics.numReads++;
//
// Try default and fast parameters to map the read.
//
subreadSequence.zmwData.holeNumber = smrtRead.zmwData.holeNumber;
MapRead(subreadSequence, subreadSequenceRC,
genome, // possibly multi fasta file read into one sequence
sarray, *bwtPtr, // The suffix array, and the bwt-fm index structures
seqBoundary, // Boundaries of contigs in the
// genome, alignments do not span
// the ends of boundaries.
ct, // Count table to use word frequencies in the genome to weight matches.
seqdb, // Information about the names of
// chromosomes in the genome, and
// where their sequences are in the genome.
params, // A huge list of parameters for
// mapping, only compile/command
// line values set.
mapData->metrics, // Keep track of time/ hit counts,
// etc.. Not fully developed, but
// should be.
alignmentPtrs, // Where the results are stored.
mappingBuffers, // A class of buffers for structurs
// like dyanmic programming
// matrices, match lists, etc., that are not
// reallocated between calls to
// MapRead. They are cleared though.
mapData // Some values that are shared
// across threads.
);
//
// No alignments were found, sometimes parameters are
// specified to try really hard again to find an alignment.
// This sets some parameters that use a more sensitive search
// at the cost of time.
//
if ((alignmentPtrs.size() == 0 or alignmentPtrs[0]->pctSimilarity < 80) and params.doSensitiveSearch) {
MappingParameters sensitiveParams = params;
sensitiveParams.SetForSensitivity();
MapRead(subreadSequence, subreadSequenceRC, genome,
sarray, *bwtPtr,
seqBoundary, ct, seqdb,
sensitiveParams, mapData->metrics,
alignmentPtrs, mappingBuffers,
mapData);
}
//
// Store the mapping quality values.
//
if (alignmentPtrs.size() > 0 and
alignmentPtrs[0]->score < params.maxScore and
params.storeMapQV) {
StoreMapQVs(subreadSequence, alignmentPtrs, params, mappingBuffers, subreadSequence.title);
}
allReadAlignments.AddAlignmentsForSeq(intvIndex, alignmentPtrs);
//
// Move reference from subreadSequence, which will be freed at
// the end of this loop to the smrtRead, which exists for the
// duration of aligning all subread of the smrtRead.
//
if (params.subreadMapType == 0) {
int a;
for (a = 0; a < alignmentPtrs.size(); a++) {
if (alignmentPtrs[a]->qStrand == 0) {
alignmentPtrs[a]->qAlignedSeq.ReferenceSubstring(smrtRead,
alignmentPtrs[a]->qAlignedSeq.seq - subreadSequence.seq,
alignmentPtrs[a]->qAlignedSeqLength);
}
else {
alignmentPtrs[a]->qAlignedSeq.ReferenceSubstring(smrtReadRC,
alignmentPtrs[a]->qAlignedSeq.seq - subreadSequenceRC.seq,
alignmentPtrs[a]->qAlignedSeqLength);
}
}
subreadSequence.Free();
subreadSequenceRC.Free();
}
}
}
else {
//
// The read The read must be mapped as a whole, even it it contains subreads.
//
vector<T_AlignmentCandidate*> alignmentPtrs;
mapData->metrics.numReads++;
smrtRead.subreadStart = 0; smrtRead.subreadEnd = smrtRead.length;
smrtReadRC.subreadStart = 0; smrtReadRC.subreadEnd = smrtRead.length;
MapRead(smrtRead, smrtReadRC,
genome, sarray, *bwtPtr, seqBoundary, ct, seqdb, params, mapData->metrics,
alignmentPtrs, mappingBuffers, mapData);
//
// Just one sequence is aligned. There is one primary hit, and
// all other are secondary.
//
if (readIsCCS == false or params.useCcsOnly) {
//
// Record some information for proper SAM Annotation.
//
allReadAlignments.Resize(1);
allReadAlignments.AddAlignmentsForSeq(0, alignmentPtrs);
if (params.useCcsOnly) {
allReadAlignments.alignMode = CCSDeNovo;
}
else {
allReadAlignments.alignMode = Fullread;
}
allReadAlignments.SetSequence(0, smrtRead);
}
else if (readIsCCS) {
//
// Align ccs reads.
//
//
// Align the ccs subread to where the denovo sequence mapped (explode).
//
SMRTSequence readRC;
CCSIterator ccsIterator;
FragmentCCSIterator fragmentCCSIterator;
CCSIterator *subreadIterator;
//
// Choose a different iterator over subreads depending on the
// alignment mode. When the mode is allpass, include the
// framgents that are not necessarily full pass.
//
if (params.useAllSubreadsInCcs) {
//
// Use all subreads even if they are not full pass
fragmentCCSIterator.Initialize(&ccsRead, mapData->regionTablePtr);
subreadIterator = &fragmentCCSIterator;
allReadAlignments.alignMode = CCSAllPass;
}
else {
// Use only full pass reads.
ccsIterator.Initialize(&ccsRead);
subreadIterator = &ccsIterator;
allReadAlignments.alignMode = CCSFullPass;
}
allReadAlignments.Resize(subreadIterator->GetNumPasses());
int passDirection, passStartBase, passNumBases;
SMRTSequence subread;
//
// The read was previously set to the smrtRead, which was the
// de novo ccs sequence. Since the alignments of exploded
// reads are reported, the unrolled read should be used as the
// reference when printing.
//
allReadAlignments.read = ccsRead.unrolledRead;
subreadIterator->Reset();
int subreadIndex;
//
// Realign all subreads.
//
for (subreadIndex = 0; subreadIndex < subreadIterator->GetNumPasses(); subreadIndex++) {
subreadIterator->GetNext(passDirection, passStartBase, passNumBases);
if (passNumBases <= 0) { continue; }
subread.ReferenceSubstring(ccsRead.unrolledRead, passStartBase, passNumBases-1);
subread.CopyTitle(ccsRead.title);
//allReadAlignments.SetSequence(subreadIndex, subread);
// The unrolled alignment should be relative to the entire read.
allReadAlignments.SetSequence(subreadIndex, ccsRead.unrolledRead);
int alignmentIndex;
//
// Align all subreads to the positions that the de novo
// sequence has aligned to.
//
for (alignmentIndex = 0; alignmentIndex < alignmentPtrs.size(); alignmentIndex++) {
T_AlignmentCandidate *alignment = alignmentPtrs[alignmentIndex];
if (alignment->score > params.maxScore) break;
//
// Determine where in the genome the subread has mapped.
//
DNASequence ccsAlignedForwardRefSequence, ccsAlignedReverseRefSequence;
if (alignment->tStrand == 0) {
// This needs to be changed -- copy copies RHS into LHS,
// CopyAsRC copies LHS into RHS
ccsAlignedForwardRefSequence.Copy(alignment->tAlignedSeq);
alignment->tAlignedSeq.CopyAsRC(ccsAlignedReverseRefSequence);
}
else {
alignment->tAlignedSeq.CopyAsRC(ccsAlignedForwardRefSequence);
ccsAlignedReverseRefSequence.Copy(alignment->tAlignedSeq);
}
DistanceMatrixScoreFunction<DNASequence, FASTQSequence> distScoreFn;
distScoreFn.del = params.deletion;
distScoreFn.ins = params.insertion;
distScoreFn.InitializeScoreMatrix(SMRTDistanceMatrix);
/*
* Determine the strand to align the subread strand to.
*/
if (alignment->tStrand == passDirection) {
//
// The alignment is in the same direction as the subread. Easy.
//
T_AlignmentCandidate exploded;
int explodedScore;
bool computeProbIsFalse = false;
// need to make this more compact...
explodedScore = GuidedAlign(subread, ccsAlignedForwardRefSequence,
distScoreFn, 12,
params.sdpIns, params.sdpDel, params.indelRate,
mappingBuffers,
exploded,
// Use a small tuple size
Local, computeProbIsFalse, 6);
if (params.verbosity > 0) {
StickPrintAlignment(exploded,
(DNASequence&) subread,
(DNASequence&) ccsAlignedForwardRefSequence,
cout,
exploded.qAlignedSeqPos, exploded.tAlignedSeqPos);
}
if (exploded.blocks.size() > 0) {
ComputeAlignmentStats(exploded, subread.seq, ccsAlignedForwardRefSequence.seq, distScoreFn); //SMRTDistanceMatrix, params.indel, params.indel );
if (exploded.score <= params.maxScore) {
//
// Reset the coordinates of the alignment so that
// they are relative to the genome, not the aligned
// substring.
//
exploded.qStrand = 0;
exploded.tStrand = alignment->tStrand;
exploded.qLength = ccsRead.unrolledRead.length;
exploded.tLength = alignment->tLength;
exploded.tAlignedSeq.Copy(ccsAlignedForwardRefSequence);
exploded.tAlignedSeqPos = alignment->tAlignedSeqPos;
exploded.tAlignedSeqLength = alignment->tAlignedSeqLength;
exploded.qAlignedSeq.ReferenceSubstring(subread);
exploded.qAlignedSeqPos = passStartBase;
exploded.qAlignedSeqLength = passNumBases;
exploded.mapQV = alignment->mapQV;
//
// Assign the name of this subread.
//
exploded.tName = alignment->tName;
stringstream namestrm;
namestrm << "/" << passStartBase << "_" << passStartBase + passNumBases;
exploded.qName = string(ccsRead.unrolledRead.title) + namestrm.str();
//
// Assign the proper chromosome coordiantes.
//
AssignRefContigLocation(exploded, seqdb, genome);
//
// Save this alignment for printing later.
//
T_AlignmentCandidate *alignmentPtr = new T_AlignmentCandidate;
*alignmentPtr = exploded;
allReadAlignments.AddAlignmentForSeq(subreadIndex, alignmentPtr);
}
}
}
else {
int pos = 0;
T_AlignmentCandidate explodedrc;
int explodedRCScore;
bool computeProbIsFalse = false;
explodedRCScore = GuidedAlign(subread, ccsAlignedReverseRefSequence,
distScoreFn, 10,
params.sdpIns, params.sdpDel, params.indelRate,
mappingBuffers,
explodedrc,
Global, computeProbIsFalse, 4);
int explodedrcscore = explodedrc.score;
if (params.verbosity > 0) {
cout << "subread: " << endl;
((DNASequence) subread).PrintSeq(cout);
cout << endl;
cout << "ccsAlignedSequence " << endl;
((DNASequence) ccsAlignedReverseRefSequence).PrintSeq(cout);
StickPrintAlignment(explodedrc,
(DNASequence&) subread,
(DNASequence&) ccsAlignedReverseRefSequence,
cout,
explodedrc.qAlignedSeqPos, explodedrc.tAlignedSeqPos);
}
if (explodedrc.blocks.size() > 0) {
ComputeAlignmentStats(explodedrc, subread.seq, ccsAlignedReverseRefSequence.seq, distScoreFn);//SMRTDistanceMatrix, params.indel, params.indel );
if (explodedrc.score <= params.maxScore) {
explodedrc.qStrand = 0;
explodedrc.tStrand = 1;
explodedrc.qLength = ccsRead.unrolledRead.length;
explodedrc.tLength = alignment->tLength;
explodedrc.tAlignedSeq.Copy(ccsAlignedReverseRefSequence);
explodedrc.qAlignedSeq.ReferenceSubstring(subread);
explodedrc.tAlignedSeqPos = genome.MakeRCCoordinate(alignment->tAlignedSeqPos + alignment->tAlignedSeqLength);
explodedrc.tAlignedSeqLength = alignment->tAlignedSeqLength;
explodedrc.qAlignedSeqPos = passStartBase;
explodedrc.mapQV = alignment->mapQV;
explodedrc.tName = alignment->tName;
stringstream namestrm;
namestrm << "/" << passStartBase << "_" << passStartBase + passNumBases;
explodedrc.qName = string(ccsRead.unrolledRead.title) + namestrm.str();
AssignRefContigLocation(explodedrc, seqdb, genome);
T_AlignmentCandidate *alignmentPtr = new T_AlignmentCandidate;
*alignmentPtr = explodedrc;
allReadAlignments.AddAlignmentForSeq(subreadIndex, alignmentPtr);
}
}
}
}
}
}
}
int subreadIndex;
int nAlignedSubreads = allReadAlignments.GetNAlignedSeq();
//
// Initialize the alignemnt context with information applicable to SAM output.
//
alignmentContext.alignMode = allReadAlignments.alignMode;
for (subreadIndex = 0; subreadIndex < nAlignedSubreads; subreadIndex++) {
if (allReadAlignments.subreadAlignments[subreadIndex].size() > 0) {
alignmentContext.numProperlyAlignedSubreads++;
}
}
if (alignmentContext.numProperlyAlignedSubreads == allReadAlignments.subreadAlignments.size()) {
alignmentContext.allSubreadsProperlyAligned = true;
}
alignmentContext.nSubreads = nAlignedSubreads;
for (subreadIndex = 0; subreadIndex < nAlignedSubreads; subreadIndex++) {
alignmentContext.subreadIndex = subreadIndex;
if (subreadIndex < nAlignedSubreads-1 and allReadAlignments.subreadAlignments[subreadIndex+1].size() > 0) {
alignmentContext.nextSubreadPos = allReadAlignments.subreadAlignments[subreadIndex+1][0]->QAlignStart();
alignmentContext.nextSubreadDir = allReadAlignments.subreadAlignments[subreadIndex+1][0]->qStrand;
alignmentContext.rNext = allReadAlignments.subreadAlignments[subreadIndex+1][0]->tName;
alignmentContext.hasNextSubreadPos = true;
}
else {
alignmentContext.nextSubreadPos = 0;
alignmentContext.nextSubreadDir = 0;
alignmentContext.rNext = "";
alignmentContext.hasNextSubreadPos = false;
}
if (allReadAlignments.subreadAlignments[subreadIndex].size() > 0) {
int alnIndex;
PrintAlignments(allReadAlignments.subreadAlignments[subreadIndex],
// smrtRead, // the source read
allReadAlignments.subreads[subreadIndex], // the source read
// for these alignments
params, *mapData->outFilePtr,
alignmentContext);
}
else {
//
// Print the unaligned sequences.
//
if (params.printFormat == SAM) {
if (params.nProc == 1) {
SAMOutput::PrintUnalignedRead(allReadAlignments.subreads[subreadIndex], *mapData->outFilePtr, alignmentContext, params.samQVList, params.clipping);
}
else {
#ifdef __APPLE__
sem_wait(semaphores.writer);
#else
sem_wait(&semaphores.writer);
#endif
SAMOutput::PrintUnalignedRead(allReadAlignments.subreads[subreadIndex], *mapData->outFilePtr, alignmentContext, params.samQVList, params.clipping);
#ifdef __APPLE__
sem_post(semaphores.writer);
#else
sem_post(&semaphores.writer);
#endif
}
}
if (params.printUnaligned == true) {
if (params.nProc == 1) {
allReadAlignments.subreads[subreadIndex].PrintSeq(*mapData->unalignedFilePtr);
}
else {
#ifdef __APPLE__
sem_wait(semaphores.unaligned);
#else
sem_wait(&semaphores.unaligned);
#endif
allReadAlignments.subreads[subreadIndex].PrintSeq(*mapData->unalignedFilePtr);
#ifdef __APPLE__
sem_post(semaphores.unaligned);
#else
sem_post(&semaphores.unaligned);
#endif
}
}
}
}
allReadAlignments.Clear();
smrtReadRC.Free();
smrtRead.Free();
if (readIsCCS) {
ccsRead.Free();
unrolledReadRC.Free();
}
numAligned++;
if(numAligned % 200 == 0) {
mappingBuffers.Reset();
}
}
if (params.nProc > 1) {
#ifdef __APPLE__
sem_wait(semaphores.reader);
sem_post(semaphores.reader);
#else
sem_wait(&semaphores.reader);
sem_post(&semaphores.reader);
#endif
}
if (params.nProc > 1) {
pthread_exit(NULL);
}
}
float ComputePMatch(float accuracy, int anchorLength) {
assert(anchorLength >= 0);
if (anchorLength == 0) {
return 0;
}
else {
return pow(accuracy,anchorLength);
}
}
//
// Assume the number of mismatches in a row follow a geometric distribution.
//
void GeometricDistributionSummaryStats(float pSuccess,
float &mean, float &variance) {
mean = 1/pSuccess;
variance = (1-pSuccess)/ (pow(pSuccess,2));
}
int ComputeExpectedWaitingBases(float mean, float variance, float certainty) {
float nStdDev;
assert(FindQNorm(certainty, nStdDev) != false);
return mean + sqrt(variance) * nStdDev;
}
int main(int argc, char* argv[]) {
//
// Configure parameters for refining alignments.
//
MappingParameters params;
ReverseCompressIndex index;
pid_t parentPID;
pid_t *pids;
CommandLineParser clp;
string commandLine;
string helpString;
SetHelp(helpString);
string conciseHelpString;
SetConciseHelp(conciseHelpString);
stringstream usageSStrm;
usageSStrm << " Basic usage: 'blasr reads.{fasta,bas.h5} genome.fasta [-options] " << endl
<< " [option]\tDescription (default_value)." << endl << endl
<< " Input Files." << endl
<< " reads.fasta is a multi-fasta file of reads. While any fasta file is valid input, "
"it is preferable to use pls.h5 or bas.h5 files because they contain "
"more rich quality value information." << endl
<< " reads.bas.h5|reads.pls.h5 Is the native output format in Hierarchical Data Format of "
"SMRT reads. This is the preferred input to blasr because rich quality"
"value (insertion,deletion, and substitution quality values) information is "
"maintained. The extra quality information improves variant detection and mapping"<<
"speed." << endl << endl;
clp.SetHelp(helpString);
clp.SetConciseHelp(conciseHelpString);
clp.SetProgramSummary(usageSStrm.str());
clp.SetProgramName("blasr");
//
// Make the default arguments.
//
bool required=true;
bool optional=false;
int trashbinInt;
float trashbinFloat;
bool trashbinBool;
// clp.RegisterStringListOption("input_files", ¶ms.readsFileNames, "Read files followed by genome.");
// clp.RegisterPreviousFlagsAsHidden();
bool printVerboseHelp = false;
bool printLongHelp = false;
clp.RegisterStringOption("sa", ¶ms.suffixArrayFileName, "");
clp.RegisterStringOption("ctab", ¶ms.countTableName, "" );
clp.RegisterStringOption("regionTable", ¶ms.regionTableFileName, "");
clp.RegisterIntOption("bestn", (int*) ¶ms.nBest, "", CommandLineParser::PositiveInteger);
clp.RegisterIntOption("limsAlign", ¶ms.limsAlign, "", CommandLineParser::PositiveInteger);
clp.RegisterFlagOption("printOnlyBest", ¶ms.printOnlyBest, "");
clp.RegisterFlagOption("outputByThread", ¶ms.outputByThread, "");
clp.RegisterFlagOption("rbao", ¶ms.refineBetweenAnchorsOnly, "");
clp.RegisterFlagOption("allowAdjacentIndels", ¶ms.forPicard, "");
clp.RegisterFlagOption("onegap", ¶ms.separateGaps, "");
clp.RegisterFlagOption("overlap", ¶ms.overlap, "");
clp.RegisterFlagOption("allowAdjacentIndels", ¶ms.forPicard, "");
clp.RegisterFlagOption("placeRepeatsRandomly", ¶ms.placeRandomly, "");
clp.RegisterIntOption("randomSeed", ¶ms.randomSeed, "", CommandLineParser::Integer);
clp.RegisterFlagOption("extend", ¶ms.extendAlignments, "");
clp.RegisterIntOption("branchExpand", ¶ms.anchorParameters.branchExpand, "", CommandLineParser::NonNegativeInteger);
clp.RegisterIntOption("maxExtendDropoff", ¶ms.maxExtendDropoff, "", CommandLineParser::NonNegativeInteger);
clp.RegisterFlagOption("nucmer", ¶ms.emulateNucmer, "");
clp.RegisterIntOption("maxExpand", ¶ms.maxExpand, "", CommandLineParser::PositiveInteger);
clp.RegisterIntOption("minExpand", ¶ms.minExpand, "", CommandLineParser::NonNegativeInteger);
clp.RegisterStringOption("seqdb", ¶ms.seqDBName, "");
clp.RegisterStringOption("anchors", ¶ms.anchorFileName, "");
clp.RegisterStringOption("clusters", ¶ms.clusterFileName, "");
clp.RegisterFlagOption("noStoreMapQV", ¶ms.storeMapQV, "");
clp.RegisterFlagOption("noRefineAlign", (bool*) ¶ms.refineAlign, "");
clp.RegisterFlagOption("guidedAlign", (bool*)¶ms.useGuidedAlign, "");
clp.RegisterFlagOption("useGuidedAlign", (bool*)&trashbinBool, "");
clp.RegisterFlagOption("noUseGuidedAlign", (bool*)¶ms.useGuidedAlign, "");
clp.RegisterFlagOption("header", (bool*)¶ms.printHeader, "");
clp.RegisterIntOption("subreadImplType", ¶ms.subreadMapType, "", CommandLineParser::PositiveInteger);
clp.RegisterIntOption("bandSize", ¶ms.bandSize, "", CommandLineParser::PositiveInteger);
clp.RegisterIntOption("extendBandSize", ¶ms.extendBandSize, "", CommandLineParser::PositiveInteger);
clp.RegisterIntOption("guidedAlignBandSize", ¶ms.guidedAlignBandSize, "", CommandLineParser::PositiveInteger);
clp.RegisterIntOption("maxAnchorsPerPosition", ¶ms.anchorParameters.maxAnchorsPerPosition, "", CommandLineParser::PositiveInteger);
clp.RegisterIntOption("sdpMaxAnchorsPerPosition", ¶ms.sdpMaxAnchorsPerPosition, "", CommandLineParser::PositiveInteger);
clp.RegisterIntOption("stopMappingOnceUnique", (int*) ¶ms.anchorParameters.stopMappingOnceUnique, "", CommandLineParser::NonNegativeInteger);
clp.RegisterStringOption("out", ¶ms.outFileName, "");
clp.RegisterIntOption("match", ¶ms.match, "", CommandLineParser::Integer);
clp.RegisterIntOption("mismatch", ¶ms.mismatch, "", CommandLineParser::Integer);
clp.RegisterIntOption("minMatch", ¶ms.minMatchLength, "", CommandLineParser::PositiveInteger);
clp.RegisterIntOption("maxMatch", ¶ms.anchorParameters.maxLCPLength, "", CommandLineParser::NonNegativeInteger);
clp.RegisterIntOption("maxLCPLength", ¶ms.anchorParameters.maxLCPLength, "", CommandLineParser::NonNegativeInteger);
clp.RegisterIntOption("indel", ¶ms.indel, "", CommandLineParser::Integer);
clp.RegisterIntOption("insertion", ¶ms.insertion, "", CommandLineParser::Integer);
clp.RegisterIntOption("deletion", ¶ms.deletion, "", CommandLineParser::Integer);
clp.RegisterIntOption("idsIndel", ¶ms.idsIndel, "", CommandLineParser::Integer);
clp.RegisterIntOption("sdpindel", ¶ms.sdpIndel, "", CommandLineParser::Integer);
clp.RegisterIntOption("sdpIns", ¶ms.sdpIns, "", CommandLineParser::Integer);
clp.RegisterIntOption("sdpDel", ¶ms.sdpDel, "", CommandLineParser::Integer);
clp.RegisterFloatOption("indelRate", ¶ms.indelRate, "", CommandLineParser::NonNegativeFloat);
clp.RegisterFloatOption("minRatio", ¶ms.minRatio, "", CommandLineParser::NonNegativeFloat);
clp.RegisterFloatOption("sdpbypass", ¶ms.sdpBypassThreshold, "", CommandLineParser::NonNegativeFloat);
clp.RegisterFloatOption("minFrac", &trashbinFloat, "", CommandLineParser::NonNegativeFloat);
clp.RegisterIntOption("maxScore", ¶ms.maxScore, "", CommandLineParser::Integer);
clp.RegisterStringOption("bwt", ¶ms.bwtFileName, "");
clp.RegisterIntOption("m", ¶ms.printFormat, "", CommandLineParser::NonNegativeInteger);
clp.RegisterFlagOption("sam", ¶ms.printSAM, "");
clp.RegisterStringOption("clipping", ¶ms.clippingString, "");
clp.RegisterIntOption("sdpTupleSize", ¶ms.sdpTupleSize, "", CommandLineParser::PositiveInteger);
clp.RegisterIntOption("sdpPrefix", ¶ms.sdpPrefix, "", CommandLineParser::NonNegativeInteger);
clp.RegisterIntOption("pvaltype", ¶ms.pValueType, "", CommandLineParser::NonNegativeInteger);
clp.RegisterIntOption("start", ¶ms.startRead, "", CommandLineParser::NonNegativeInteger);
clp.RegisterIntOption("stride", ¶ms.stride, "", CommandLineParser::NonNegativeInteger);
clp.RegisterFloatOption("subsample", ¶ms.subsample, "", CommandLineParser::PositiveFloat);
clp.RegisterIntOption("nproc", ¶ms.nProc, "", CommandLineParser::PositiveInteger);
clp.RegisterFlagOption("sortRefinedAlignments",(bool*) ¶ms.sortRefinedAlignments, "");
clp.RegisterIntOption("quallc", ¶ms.qualityLowerCaseThreshold, "", CommandLineParser::Integer);
clp.RegisterFlagOption("p", (bool*) ¶ms.progress, "");
clp.RegisterFlagOption("v", (bool*) ¶ms.verbosity, "");
clp.RegisterIntOption("V", ¶ms.verbosity, "Specify a level of verbosity.", CommandLineParser::NonNegativeInteger);
clp.RegisterIntOption("contextAlignLength", ¶ms.anchorParameters.contextAlignLength, "", CommandLineParser::PositiveInteger);
clp.RegisterFlagOption("skipLookupTable", ¶ms.anchorParameters.useLookupTable, "");
clp.RegisterStringOption("metrics", ¶ms.metricsFileName, "");
clp.RegisterStringOption("lcpBounds", ¶ms.lcpBoundsFileName, "");
clp.RegisterStringOption("fullMetrics", ¶ms.fullMetricsFileName, "");
clp.RegisterIntOption("nbranch", ¶ms.anchorParameters.numBranches, "", CommandLineParser::NonNegativeInteger);
clp.RegisterFlagOption("divideByAdapter", ¶ms.byAdapter, "");
clp.RegisterFlagOption("useQuality", ¶ms.ignoreQualities, "");
clp.RegisterFlagOption("noFrontAlign", ¶ms.extendFrontAlignment, "");
clp.RegisterIntOption("minReadLength", ¶ms.minReadLength, "", CommandLineParser::NonNegativeInteger);
clp.RegisterIntOption("minAlignLength", ¶ms.minAlignLength, "", CommandLineParser::NonNegativeInteger);
clp.RegisterIntOption("maxReadLength", ¶ms.maxReadLength, "", CommandLineParser::NonNegativeInteger);
clp.RegisterIntOption("minSubreadLength", ¶ms.minSubreadLength, "", CommandLineParser::NonNegativeInteger);
clp.RegisterIntOption("minAvgQual", ¶ms.minAvgQual, "", CommandLineParser::Integer);
clp.RegisterFlagOption("advanceHalf", ¶ms.advanceHalf, "");
clp.RegisterIntOption("advanceExactMatches", ¶ms.anchorParameters.advanceExactMatches, "", CommandLineParser::NonNegativeInteger);
clp.RegisterFlagOption("unrollCcs", ¶ms.unrollCcs, "");
clp.RegisterFlagOption("useccs", ¶ms.useCcs, "");
clp.RegisterFlagOption("useccsdenovo", ¶ms.useCcsOnly, "");
clp.RegisterFlagOption("useccsall", ¶ms.useAllSubreadsInCcs, "");
clp.RegisterFlagOption("extendDenovoCCSSubreads", ¶ms.extendDenovoCCSSubreads, "");
clp.RegisterFlagOption("noRefineAlignments", ¶ms.refineAlignments, "");
clp.RegisterFloatOption("minPctIdentity", ¶ms.minPctIdentity, "", CommandLineParser::NonNegativeFloat);
clp.RegisterFloatOption("maxPctIdentity", ¶ms.maxPctIdentity, "", CommandLineParser::NonNegativeFloat);
clp.RegisterIntOption("nCandidates", ¶ms.nCandidates, "", CommandLineParser::NonNegativeInteger);
clp.RegisterFlagOption("useTemp", (bool*) ¶ms.tempDirectory, "");
clp.RegisterFlagOption("noSplitSubreads", ¶ms.mapSubreadsSeparately, "");
clp.RegisterIntOption("subreadMapType", ¶ms.subreadMapType, "", CommandLineParser::NonNegativeInteger);
clp.RegisterStringOption("titleTable", ¶ms.titleTableName, "");
clp.RegisterFlagOption("useSensitiveSearch", ¶ms.doSensitiveSearch, "");
clp.RegisterFlagOption("ignoreRegions", ¶ms.useRegionTable, "");
clp.RegisterFlagOption("ignoreHQRegions", ¶ms.useHQRegionTable, "");
clp.RegisterFlagOption("computeAlignProbability", ¶ms.computeAlignProbability, "");
clp.RegisterStringOption("unaligned", ¶ms.unalignedFileName, "");
clp.RegisterFlagOption("global", ¶ms.doGlobalAlignment, "");
clp.RegisterIntOption("globalChainType", ¶ms.globalChainType, "", CommandLineParser::NonNegativeInteger);
clp.RegisterFlagOption("noPrintSubreadTitle", (bool*) ¶ms.printSubreadTitle, "");
clp.RegisterIntOption("saLookupTableLength", ¶ms.lookupTableLength, "", CommandLineParser::PositiveInteger);
clp.RegisterFlagOption("useDetailedSDP", ¶ms.detailedSDPAlignment, "");
clp.RegisterFlagOption("nouseDetailedSDP", &trashbinBool, "");
clp.RegisterIntOption("sdpFilterType", ¶ms.sdpFilterType, "", CommandLineParser::NonNegativeInteger);
clp.RegisterIntOption("scoreType", ¶ms.scoreType, "", CommandLineParser::NonNegativeInteger);
clp.RegisterFlagOption("help", ¶ms.printDiscussion, "");
clp.RegisterFlagOption("h", &printVerboseHelp, "");
clp.RegisterFloatOption("accuracyPrior", ¶ms.readAccuracyPrior, "", CommandLineParser::NonNegativeFloat);
clp.RegisterIntOption("readIndex", ¶ms.readIndex, "", CommandLineParser::NonNegativeInteger);
clp.RegisterIntListOption("readIndices", ¶ms.readIndices, "", false);
clp.RegisterIntOption("maxReadIndex", ¶ms.maxReadIndex, "", CommandLineParser::NonNegativeInteger);
clp.RegisterFlagOption("version", (bool*)¶ms.printVersion, "");
clp.RegisterIntOption("substitutionPrior", ¶ms.substitutionPrior, "", CommandLineParser::NonNegativeInteger);
clp.RegisterIntOption("deletionPrior", ¶ms.globalDeletionPrior, "", CommandLineParser::NonNegativeInteger);
clp.RegisterIntOption("recurseOver", ¶ms.recurseOver, "", CommandLineParser::NonNegativeInteger);
clp.RegisterStringOption("scoreMatrix", ¶ms.scoreMatrixString, "");
clp.RegisterFlagOption("printDotPlots", ¶ms.printDotPlots, "");
clp.RegisterFlagOption("preserveReadTitle", ¶ms.preserveReadTitle,"");
clp.RegisterFlagOption("forwardOnly", ¶ms.forwardOnly,"");
clp.RegisterFlagOption("affineAlign", ¶ms.affineAlign, "");
clp.RegisterIntOption("affineOpen", ¶ms.affineOpen, "", CommandLineParser::NonNegativeInteger);
clp.RegisterIntOption("affineExtend", ¶ms.affineExtend, "", CommandLineParser::NonNegativeInteger);
clp.RegisterFlagOption("alignContigs", ¶ms.alignContigs, "", false);
clp.RegisterStringOption("findex", ¶ms.findex, "", false);
clp.RegisterIntOption("minInterval", ¶ms.minInterval, "", CommandLineParser::NonNegativeInteger);
clp.RegisterStringListOption("samqv", ¶ms.samqv, "", false);
clp.RegisterIntOption("minMapQV", ¶ms.minMapQV, "", CommandLineParser::NonNegativeInteger);
clp.RegisterIntOption("maxRefine", ¶ms.maxRefine, "", CommandLineParser::NonNegativeInteger);
clp.RegisterFlagOption("removeContained", ¶ms.removeContainedIntervals, "", false);
clp.RegisterFlagOption("piecewise", ¶ms.piecewiseMatch, "", false);
clp.RegisterFlagOption("noSelf", ¶ms.noSelf, "", false);
clp.RegisterIntOption("maxAnchorGap", ¶ms.maxAnchorGap, "", CommandLineParser::NonNegativeInteger);
clp.RegisterIntOption("maxGap", ¶ms.maxGap, "", CommandLineParser::NonNegativeInteger);
clp.RegisterStringOption("fileType", ¶ms.fileType, "");
clp.RegisterFlagOption("streaming", ¶ms.streaming, "", false);
clp.ParseCommandLine(argc, argv, params.readsFileNames);
clp.CommandLineToString(argc, argv, commandLine);
if (params.printVersion) {
string version;
GetVersion(version);
cout << version << endl;
exit(0);
}
if (printVerboseHelp) {
cout << helpString << endl;
exit(0);
}
if (params.printDiscussion) {
PrintDiscussion();
exit(0);
}
if (argc < 3) {
cout << conciseHelpString;
exit(1);
}
int a, b;
for (a = 0; a < 5; a++ ){
for (b = 0; b < 5; b++ ){
if (a != b) {
SMRTDistanceMatrix[a][b] += params.mismatch;
}
else {
SMRTDistanceMatrix[a][b] += params.match;
}
}
}
if (params.scoreMatrixString != "") {
if (StringToScoreMatrix(params.scoreMatrixString, SMRTDistanceMatrix) == false) {
cout << "ERROR. The string " << endl
<< params.scoreMatrixString << endl
<< "is not a valid format. It should be a quoted, space separated string of " << endl
<< "integer values. The matrix: " << endl
<< " A C G T N" << endl
<< " A 1 2 3 4 5" << endl
<< " C 6 7 8 9 10" << endl
<< " G 11 12 13 14 15" << endl
<< " T 16 17 18 19 20" << endl
<< " N 21 22 23 24 25" << endl
<< " should be specified as \"1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25\"" << endl;
exit(1);
}
}
FileOfFileNames::ExpandFileNameList(params.readsFileNames);
// The last reads file is the genome
if (params.readsFileNames.size() > 0) {
params.genomeFileName = params.readsFileNames[params.readsFileNames.size()-1];
}
if (params.printDiscussion == true) {
PrintDiscussion();
exit(0);
}
params.MakeSane();
params.anchorParameters.verbosity = params.verbosity;
//
// The random number generator is used for subsampling for debugging
// and testing consensus.
//
if (params.useRandomSeed == true) {
InitializeRandomGenerator(params.randomSeed);
}
else {
InitializeRandomGeneratorWithTime();
}
//
// Various aspects of timing are stored here. However this isn't
// quite finished.
//
MappingMetrics metrics;
ofstream fullMetricsFile;
if (params.fullMetricsFileName != "") {
CrucialOpen(params.fullMetricsFileName, fullMetricsFile, std::ios::out);
metrics.SetStoreList();
}
/*
* If reading a separate region table, there is a 1-1 correspondence
* between region table and bas file.
*/
if (params.readSeparateRegionTable) {
if (FileOfFileNames::IsFOFN(params.regionTableFileName)) {
FileOfFileNames::FOFNToList(params.regionTableFileName, params.regionTableFileNames);
}
else {
params.regionTableFileNames.push_back(params.regionTableFileName);
}
}
if (params.regionTableFileNames.size() != 0 and
params.regionTableFileNames.size() != params.readsFileNames.size() - 1) {
cout << "Error, there are not the same number of region table files as input files." << endl;
exit(1);
}
// params.readsFileNames.pop_back();
if (params.readsFileNames.size() < 2) {
cout << "Error, you must provide at least one reads file and a genome file." <<endl;
exit(1);
}
// The input reads files must have file extensions.
for (int i = 0; i < params.readsFileNames.size()-1; i++) {
if (params.readsFileNames[i] != "/dev/stdin") {
size_t dotPos = params.readsFileNames[i].find_last_of('.');
if (dotPos == string::npos) {
cout<<"ERROR, the input reads files must include file extensions."<<endl;
exit(1);
}
}
}
// -useQuality can not be used in combination with a fasta input
if (!params.ignoreQualities) {
for (int i = 0; i < params.readsFileNames.size()-1; i++) {
size_t dotPos = params.readsFileNames[i].find_last_of('.');
assert (dotPos != string::npos); //dotPos should have been checked above
string suffix = params.readsFileNames[i].substr(dotPos+1);
if (suffix == "fasta") {
cout<<"ERROR, you can not use -useQuality option when any of the input reads files are in multi-fasta format."<<endl;
exit(1);
}
}
}
if (params.nProc > 1 and params.outFileName == "") {
cout << "ERROR: You must explicitly specify an output file name with the option -out "<<endl
<< "when aligning in parallel mode. "<<endl;
exit(1);
}
parentPID = getpid();
SequenceIndexDatabase<FASTASequence> seqdb;
SeqBoundaryFtr<FASTASequence> seqBoundary(&seqdb);
//
// Initialize the sequence index database if it used. If it is not
// specified, it is initialized by default when reading a multiFASTA
// file.
//
if (params.useSeqDB) {
ifstream seqdbin;
CrucialOpen(params.seqDBName, seqdbin);
seqdb.ReadDatabase(seqdbin);
}
//
// Make sure the reads file exists and can be opened before
// trying to read any of the larger data structures.
//
FASTASequence fastaGenome;
T_Sequence genome;
FASTAReader genomeReader;
//
// The genome is in normal FASTA, or condensed (lossy homopolymer->unipolymer)
// format. Both may be read in using a FASTA reader.
//
if (!genomeReader.Init(params.genomeFileName)) {
cout << "Could not open genome file " << params.genomeFileName << endl;
exit(1);
}
if (params.printSAM) {
genomeReader.computeMD5 = true;
}
//
// If no sequence title database is supplied, initialize one when
// reading in the reference, and consider a seqdb to be present.
//
if (!params.useSeqDB) {
genomeReader.ReadAllSequencesIntoOne(fastaGenome, &seqdb);
params.useSeqDB = true;
if (params.noSelf) {
seqdb.BuildNameMaps();
}
}
else {
genomeReader.ReadAllSequencesIntoOne(fastaGenome);
}
genomeReader.Close();
//
// The genome may have extra spaces in the fasta name. Get rid of those.
//
VectorIndex t;
for (t = 0; t < fastaGenome.titleLength; t++ ){
if (fastaGenome.title[t] == ' ') {
fastaGenome.titleLength = t;
fastaGenome.title[t] = '\0';
break;
}
}
genome.seq = fastaGenome.seq;
genome.length = fastaGenome.length;
genome.title = fastaGenome.title;
genome.titleLength = fastaGenome.titleLength;
genome.ToUpper();
DNASuffixArray sarray;
TupleCountTable<T_GenomeSequence, DNATuple> ct;
int listTupleSize;
ofstream outFile;
outFile.exceptions(ostream::failbit);
ofstream unalignedOutFile;
BWT bwt;
//
// Look to see if:
// 1. no indices have been specified on the command line
// 2. If so, if a .bwt exitsts
// 2. If not, if a .sa exists
if (params.useBwt == false and params.useSuffixArray == false) {
params.bwtFileName = params.genomeFileName + ".bwt";
ifstream in(params.bwtFileName.c_str());
if (in.good()) {
params.useBwt = true;
}
else {
params.bwtFileName = "";
params.suffixArrayFileName = params.genomeFileName + ".sa";
ifstream saIn(params.suffixArrayFileName.c_str());
if (saIn) {
params.useSuffixArray = true;
}
else {
params.suffixArrayFileName = "";
}
}
in.close();
}
if (params.useBwt) {
if (bwt.Read(params.bwtFileName) == 0) {
cout << "ERROR! Could not read the BWT file. " << params.bwtFileName << endl;
exit(1);
}
}
else {
if (!params.useSuffixArray) {
//
// There was no explicit specification of a suffix
// array on the command line, so build it on the fly here.
//
genome.ToThreeBit();
vector<int> alphabet;
sarray.InitThreeBitDNAAlphabet(alphabet);
sarray.LarssonBuildSuffixArray(genome.seq, genome.length, alphabet);
if (params.minMatchLength > 0) {
if (params.anchorParameters.useLookupTable == true) {
if (params.lookupTableLength > params.minMatchLength) {
params.lookupTableLength = params.minMatchLength;
}
sarray.BuildLookupTable(genome.seq, genome.length, params.lookupTableLength);
}
}
genome.ConvertThreeBitToAscii();
params.useSuffixArray = 1;
}
else if (params.useSuffixArray) {
if (sarray.Read(params.suffixArrayFileName)) {
if (params.minMatchLength != 0) {
params.listTupleSize = min(8, params.minMatchLength);
}
else {
params.listTupleSize = sarray.lookupPrefixLength;
}
if (params.minMatchLength < sarray.lookupPrefixLength) {
cerr << "WARNING. The value of -minMatch " << params.minMatchLength << " is less than the smallest searched length of " << sarray.lookupPrefixLength << ". Setting -minMatch to " << sarray.lookupPrefixLength << "." << endl;
params.minMatchLength = sarray.lookupPrefixLength;
}
}
else {
cout << "ERROR. " << params.suffixArrayFileName << " is not a valid suffix array. " << endl
<< " Make sure it is generated with the latest version of sawriter." << endl;
exit(1);
}
}
}
if (params.minMatchLength < sarray.lookupPrefixLength) {
cerr << "WARNING. The value of -minMatch " << params.minMatchLength << " is less than the smallest searched length of " << sarray.lookupPrefixLength << ". Setting -minMatch to " << sarray.lookupPrefixLength << "." << endl;
params.minMatchLength = sarray.lookupPrefixLength;
}
//
// It is required to have a tuple count table
// for estimating the background frequencies
// for word matching.
// If one is specified on the command line, simply read
// it in. If not, this is operating under the mode
// that everything is computed from scratch.
//
long l;
TupleMetrics saLookupTupleMetrics;
if (params.useCountTable == false) {
params.countTableName = params.genomeFileName + ".ctab";
ifstream ctab(params.countTableName.c_str());
if (ctab.good() == true) {
params.useCountTable = true;
}
else {
params.countTableName = "";
}
}
if (params.useCountTable) {
ifstream ctIn;
CrucialOpen(params.countTableName, ctIn, std::ios::in | std::ios::binary);
ct.Read(ctIn);
saLookupTupleMetrics = ct.tm;
} else {
saLookupTupleMetrics.Initialize(params.lookupTableLength);
ct.InitCountTable(saLookupTupleMetrics);
ct.AddSequenceTupleCountsLR(genome);
}
TitleTable titleTable;
if (params.useTitleTable) {
ofstream titleTableOut;
CrucialOpen(params.titleTableName, titleTableOut);
//
// When using a sequence index database, the title table is simply copied
// from the sequencedb.
//
if (params.useSeqDB) {
titleTable.Copy(seqdb.names, seqdb.nSeqPos-1);
titleTable.ResetTableToIntegers(seqdb.names, seqdb.nameLengths, seqdb.nSeqPos-1);
}
else {
//
// No seqdb, so there is just one sequence. Still the user specified a title
// table, so just the first sequence in the fasta file should be used.
//
titleTable.Copy(&fastaGenome.title, 1);
titleTable.ResetTableToIntegers(&genome.title, &genome.titleLength, 1);
fastaGenome.titleLength = strlen(genome.title);
}
titleTable.Write(titleTableOut);
}
else {
if (params.useSeqDB) {
//
// When using a sequence index database, but not the titleTable,
// it is necessary to truncate the titles at the first space to
// be compatible with the way other alignment programs interpret
// fasta titles. When printing the title table, there is all
// sorts of extra storage space, so the full line is stored.
//
seqdb.SequenceTitleLinesToNames();
}
}
ostream *outFilePtr = &cout;
ofstream outFileStrm;
ofstream unalignedFile;
ostream *unalignedFilePtr = NULL;
ofstream metricsOut, lcpBoundsOut;
ofstream anchorFileStrm;
ofstream clusterOut, *clusterOutPtr;
if (params.anchorFileName != "") {
CrucialOpen(params.anchorFileName, anchorFileStrm, std::ios::out);
}
if (params.clusterFileName != "") {
CrucialOpen(params.clusterFileName, clusterOut, std::ios::out);
clusterOutPtr = &clusterOut;
clusterOut << "total_size p_value n_anchors read_length align_score read_accuracy anchor_probability min_exp_anchors seq_length" << endl;
}
else {
clusterOutPtr = NULL;
}
if (params.outFileName != "") {
CrucialOpen(params.outFileName, outFileStrm, std::ios::out);
outFilePtr = &outFileStrm;
}
if (params.printHeader) {
switch(params.printFormat) {
case(SummaryPrint):
SummaryAlignmentPrinter::PrintHeader(*outFilePtr);
break;
case(Interval):
IntervalAlignmentPrinter::PrintHeader(*outFilePtr);
break;
}
}
if (params.printUnaligned == true) {
CrucialOpen(params.unalignedFileName, unalignedFile, std::ios::out);
unalignedFilePtr = &unalignedFile;
}
if (params.metricsFileName != "") {
CrucialOpen(params.metricsFileName, metricsOut);
}
if (params.lcpBoundsFileName != "") {
CrucialOpen(params.lcpBoundsFileName, lcpBoundsOut);
// lcpBoundsOut << "pos depth width lnwidth" << endl;
}
//
// Configure the mapping database.
//
MappingData<T_SuffixArray, T_GenomeSequence, T_Tuple> *mapdb = new MappingData<T_SuffixArray, T_GenomeSequence, T_Tuple>[params.nProc];
int procIndex;
pthread_attr_t *threadAttr = new pthread_attr_t[params.nProc];
// MappingSemaphores semaphores;
//
// When there are multiple processes running along, sometimes there
// are semaphores to worry about.
//
if (params.nProc > 1) {
semaphores.InitializeAll();
}
for (procIndex = 0; procIndex < params.nProc; procIndex++ ){
pthread_attr_init(&threadAttr[procIndex]);
}
//
// Start the mapping jobs.
//
int readsFileIndex = 0;
if (params.subsample < 1) {
InitializeRandomGeneratorWithTime();
reader = new ReaderAgglomerate(params.subsample);
}
else {
reader = new ReaderAgglomerate(params.startRead, params.stride);
}
// In case the input is fasta, make all bases in upper case.
reader->SetToUpper();
regionTableReader = new HDFRegionTableReader;
RegionTable regionTable;
//
// Store lists of how long it took to map each read.
//
metrics.clocks.SetStoreList(true);
if (params.useCcs) {
reader->UseCCS();
}
vector<int > holeNumbers;
if (params.readIndex != -1 or params.readIndices.size() > 0) {
if (params.readIndices.size() > 0) {
holeNumbers = params.readIndices;
}
else {
holeNumbers.push_back(params.readIndex);
}
}
if (params.printSAM) {
string hdString, sqString, rgString, pgString;
MakeSAMHDString(hdString);
*outFilePtr << hdString << endl;
seqdb.MakeSAMSQString(sqString);
*outFilePtr << sqString; // this already outputs endl
set<string> readGroups;
for (readsFileIndex = 0; readsFileIndex < params.readsFileNames.size() - 1; readsFileIndex++ ) {
reader->SetReadFileName(params.readsFileNames[readsFileIndex], params.fileType);
reader->Initialize();
string movieNameMD5;
ScanData scanData;
reader->GetScanData(scanData);
MakeMD5(scanData.movieName, movieNameMD5, 10);
string chipId;
ParseChipIdFromMovieName(scanData.movieName, chipId);
//
// Each movie may only be represented once in the header.
//
string changelistId;
reader->GetChangelistId(changelistId);
string softwareVersion;
GetSoftwareVersion(changelistId, softwareVersion);
if (readGroups.find(scanData.movieName) == readGroups.end()) {
*outFilePtr << "@RG\t"
<< "ID:" << movieNameMD5 << "\t"
<< "PU:"<< scanData.movieName << "\t"
<< "SM:"<< chipId << "\t"
<< "PL:PACBIO" << "\t"
<< "DS:READTYPE=SUBREAD;"
<< "CHANGELISTID="<<changelistId <<";"
<< "BINDINGKIT=" << scanData.bindingKit << ";"
<< "SEQUENCINGKIT=" << scanData.sequencingKit << ";"
<< "FRAMERATEHZ=100;"
<< "BASECALLERVERSION=" << softwareVersion;
int q;
for (q = 0; q < params.samQVList.nTags; q++){
if (params.samQVList.useqv & params.samQVList.qvFlagIndex[q]) {
*outFilePtr << ";" << params.samQVList.qvNames[q] << "=" << params.samQVList.qvTags[q];
}
}
*outFilePtr << endl;
}
readGroups.insert(scanData.movieName);
if (params.streaming == false) {
reader->Close();
}
}
string commandLineString;
clp.CommandLineToString(argc, argv, commandLineString);
MakeSAMPGString(commandLineString, pgString);
*outFilePtr << pgString << endl;
}
for (readsFileIndex = 0; readsFileIndex < params.readsFileNames.size() - 1; readsFileIndex++ ){
params.readsFileIndex = readsFileIndex;
//
// Configure the reader to use the correct read and region
// file names.
//
reader->SetReadFileName(params.readsFileNames[params.readsFileIndex], params.fileType);
if (holeNumbers.size() > 0) {
reader->InitializeHoleNumbers(holeNumbers);
}
//
// Initialize using already set file names.
//
int initReturnValue = 1;
//
// Not the best approach. When writing SAM output, all the input
// files must be scanned for read groups so that the header may be
// written. When streaming, we don't want to close this since the
// streaming pipe will be killed, so during header initialization
// of streamed files, the reader is not closed. This is ok since
// only one file is ever read from (stdin).
//
if (params.streaming == false or reader->IsInitialized() == false) {
initReturnValue = reader->Initialize();
} else {
initReturnValue = reader->IsInitialized();
}
string changeListIdString;
reader->hdfBasReader.GetChangeListID(changeListIdString);
ChangeListID changeListId(changeListIdString);
params.qvScaleType = DetermineQVScaleFromChangeListID(changeListId);
if (reader->FileHasZMWInformation() and params.useRegionTable) {
if (params.readSeparateRegionTable) {
if (regionTableReader->Initialize(params.regionTableFileNames[params.readsFileIndex]) == 0) {
cout << "ERROR! Could not read the region table " << params.regionTableFileNames[params.readsFileIndex] <<endl;
exit(1);
}
params.useRegionTable = true;
}
else {
if (reader->HasRegionTable()) {
if (regionTableReader->Initialize(params.readsFileNames[params.readsFileIndex]) == 0) {
cout << "ERROR! Could not read the region table " << params.regionTableFileNames[params.readsFileIndex] <<endl;
exit(1);
}
params.useRegionTable = true;
}
else {
params.useRegionTable = false;
}
}
}
else {
params.useRegionTable = false;
}
/*
* Check to see if there is a region table. If there is a separate
* region table, use that (over the region table in the bas
* file). If there is a region table in the bas file, use that,
* without having to specify a region table on the command line.
*/
if (params.useRegionTable) {
regionTable.Reset();
regionTableReader->ReadTable(regionTable);
regionTableReader->Close();
regionTable.SortTableByHoleNumber();
}
#ifdef USE_GOOGLE_PROFILER
char *profileFileName = getenv("CPUPROFILE");
if (profileFileName != NULL) {
ProfilerStart(profileFileName);
}
else {
ProfilerStart("google_profile.txt");
}
#endif
if (initReturnValue > 0) {
if (params.nProc == 1) {
mapdb[0].Initialize(&sarray, &genome, &seqdb, &ct, &index, params, reader, ®ionTable,
outFilePtr, unalignedFilePtr, &anchorFileStrm, clusterOutPtr);
mapdb[0].bwtPtr = &bwt;
if (params.fullMetricsFileName != "") {
mapdb[0].metrics.SetStoreList(true);
}
if (params.lcpBoundsFileName != "") {
mapdb[0].lcpBoundsOutPtr = &lcpBoundsOut;
}
else {
mapdb[0].lcpBoundsOutPtr = NULL;
}
MapReads(&mapdb[0]);
metrics.Collect(mapdb[0].metrics);
}
else {
pthread_t *threads = new pthread_t[params.nProc];
for (procIndex = 0; procIndex < params.nProc; procIndex++ ){
//
// Initialize thread-specific parameters.
//
mapdb[procIndex].Initialize(&sarray, &genome, &seqdb, &ct, &index, params, reader, ®ionTable,
outFilePtr, unalignedFilePtr, &anchorFileStrm, clusterOutPtr);
mapdb[procIndex].bwtPtr = &bwt;
if (params.fullMetricsFileName != "") {
mapdb[procIndex].metrics.SetStoreList(true);
}
if (params.lcpBoundsFileName != "") {
mapdb[procIndex].lcpBoundsOutPtr = &lcpBoundsOut;
}
else {
mapdb[procIndex].lcpBoundsOutPtr = NULL;
}
if (params.outputByThread) {
ofstream *outPtr =new ofstream;
mapdb[procIndex].outFilePtr = outPtr;
stringstream outNameStream;
outNameStream << params.outFileName << "." << procIndex;
mapdb[procIndex].params.outFileName = outNameStream.str();
CrucialOpen(mapdb[procIndex].params.outFileName, *outPtr, std::ios::out);
}
pthread_create(&threads[procIndex], &threadAttr[procIndex], (void* (*)(void*))MapReads, &mapdb[procIndex]);
}
for (procIndex = 0; procIndex < params.nProc; procIndex++) {
pthread_join(threads[procIndex], NULL);
}
for (procIndex = 0; procIndex < params.nProc; procIndex++) {
metrics.Collect(mapdb[procIndex].metrics);
if (params.outputByThread) {
delete mapdb[procIndex].outFilePtr;
}
}
}
}
reader->Close();
}
delete reader;
fastaGenome.Free();
#ifdef USE_GOOGLE_PROFILER
ProfilerStop();
#endif
if (mapdb != NULL) {
delete[] mapdb;
}
if (threadAttr != NULL) {
delete[] threadAttr;
}
seqdb.FreeDatabase();
delete regionTableReader;
if (params.metricsFileName != "") {
metrics.PrintSummary(metricsOut);
}
if (params.fullMetricsFileName != "") {
metrics.PrintFullList(fullMetricsFile);
}
if (params.outFileName != "") {
outFileStrm.close();
}
cerr << "Finished mapping " << totalReads << " (" << totalBases << " bp)" << endl;
return 0;
}
| [
"1587504387@qq.com"
] | 1587504387@qq.com |
efc50cbff762ce7fa102ddaab3b78134a095bab7 | 084a13e82aa2f8ffe99054cb1eb04b41c87233ed | /orchagent/p4orch/tests/test_main.cpp | 23cf37d8e1302ffaa07686559e36b0340ec3537e | [
"Apache-2.0"
] | permissive | noaOrMlnx/sonic-swss | bb6c8e474454e229dd9987762fc9e0dd2d9e88ad | 45bdd1928e7d2e61d10fd1ce0da99abe1418bd13 | refs/heads/master | 2023-04-14T23:14:46.936193 | 2022-02-15T23:52:41 | 2022-02-15T23:52:41 | 225,886,985 | 1 | 0 | NOASSERTION | 2022-03-16T10:24:06 | 2019-12-04T14:32:38 | C++ | UTF-8 | C++ | false | false | 6,624 | cpp | extern "C"
{
#include "sai.h"
}
#include <gmock/gmock.h>
#include <vector>
#include "copporch.h"
#include "crmorch.h"
#include "dbconnector.h"
#include "directory.h"
#include "mock_sai_virtual_router.h"
#include "p4orch.h"
#include "portsorch.h"
#include "sai_serialize.h"
#include "switchorch.h"
#include "vrforch.h"
#include "gtest/gtest.h"
using ::testing::StrictMock;
/* Global variables */
sai_object_id_t gVirtualRouterId = SAI_NULL_OBJECT_ID;
sai_object_id_t gSwitchId = SAI_NULL_OBJECT_ID;
sai_object_id_t gVrfOid = 111;
sai_object_id_t gTrapGroupStartOid = 20;
sai_object_id_t gHostifStartOid = 30;
sai_object_id_t gUserDefinedTrapStartOid = 40;
char *gVrfName = "b4-traffic";
char *gMirrorSession1 = "mirror-session-1";
sai_object_id_t kMirrorSessionOid1 = 9001;
char *gMirrorSession2 = "mirror-session-2";
sai_object_id_t kMirrorSessionOid2 = 9002;
sai_object_id_t gUnderlayIfId;
#define DEFAULT_BATCH_SIZE 128
int gBatchSize = DEFAULT_BATCH_SIZE;
bool gSairedisRecord = true;
bool gSwssRecord = true;
bool gLogRotate = false;
bool gSaiRedisLogRotate = false;
bool gResponsePublisherRecord = false;
bool gResponsePublisherLogRotate = false;
bool gSyncMode = false;
bool gIsNatSupported = false;
PortsOrch *gPortsOrch;
CrmOrch *gCrmOrch;
P4Orch *gP4Orch;
VRFOrch *gVrfOrch;
SwitchOrch *gSwitchOrch;
Directory<Orch *> gDirectory;
ofstream gRecordOfs;
string gRecordFile;
swss::DBConnector *gAppDb;
swss::DBConnector *gStateDb;
swss::DBConnector *gConfigDb;
swss::DBConnector *gCountersDb;
MacAddress gVxlanMacAddress;
sai_router_interface_api_t *sai_router_intfs_api;
sai_neighbor_api_t *sai_neighbor_api;
sai_next_hop_api_t *sai_next_hop_api;
sai_next_hop_group_api_t *sai_next_hop_group_api;
sai_route_api_t *sai_route_api;
sai_acl_api_t *sai_acl_api;
sai_policer_api_t *sai_policer_api;
sai_virtual_router_api_t *sai_virtual_router_api;
sai_hostif_api_t *sai_hostif_api;
sai_switch_api_t *sai_switch_api;
sai_mirror_api_t *sai_mirror_api;
sai_udf_api_t *sai_udf_api;
sai_tunnel_api_t *sai_tunnel_api;
namespace
{
using ::testing::_;
using ::testing::DoAll;
using ::testing::Return;
using ::testing::SetArgPointee;
using ::testing::StrictMock;
void CreatePort(const std::string port_name, const uint32_t speed, const uint32_t mtu, const sai_object_id_t port_oid,
Port::Type port_type = Port::PHY, const sai_port_oper_status_t oper_status = SAI_PORT_OPER_STATUS_DOWN,
const sai_object_id_t vrouter_id = gVirtualRouterId, const bool admin_state_up = true)
{
Port port(port_name, port_type);
port.m_speed = speed;
port.m_mtu = mtu;
if (port_type == Port::LAG)
{
port.m_lag_id = port_oid;
}
else
{
port.m_port_id = port_oid;
}
port.m_vr_id = vrouter_id;
port.m_admin_state_up = admin_state_up;
port.m_oper_status = oper_status;
gPortsOrch->setPort(port_name, port);
}
void SetupPorts()
{
CreatePort(/*port_name=*/"Ethernet1", /*speed=*/100000,
/*mtu=*/1500, /*port_oid=*/0x112233);
CreatePort(/*port_name=*/"Ethernet2", /*speed=*/400000,
/*mtu=*/4500, /*port_oid=*/0x1fed3);
CreatePort(/*port_name=*/"Ethernet3", /*speed=*/50000,
/*mtu=*/9100, /*port_oid=*/0xaabbccdd);
CreatePort(/*port_name=*/"Ethernet4", /*speed=*/100000,
/*mtu=*/1500, /*port_oid=*/0x9988);
CreatePort(/*port_name=*/"Ethernet5", /*speed=*/400000,
/*mtu=*/4500, /*port_oid=*/0x56789abcdef);
CreatePort(/*port_name=*/"Ethernet6", /*speed=*/50000,
/*mtu=*/9100, /*port_oid=*/0x56789abcdff, Port::PHY, SAI_PORT_OPER_STATUS_UP);
CreatePort(/*port_name=*/"Ethernet7", /*speed=*/100000,
/*mtu=*/9100, /*port_oid=*/0x1234, /*port_type*/ Port::LAG);
CreatePort(/*port_name=*/"Ethernet8", /*speed=*/100000,
/*mtu=*/9100, /*port_oid=*/0x5678, /*port_type*/ Port::MGMT);
CreatePort(/*port_name=*/"Ethernet9", /*speed=*/50000,
/*mtu=*/9100, /*port_oid=*/0x56789abcfff, Port::PHY, SAI_PORT_OPER_STATUS_UNKNOWN);
}
void AddVrf()
{
Table app_vrf_table(gAppDb, APP_VRF_TABLE_NAME);
std::vector<swss::FieldValueTuple> attributes;
app_vrf_table.set(gVrfName, attributes);
StrictMock<MockSaiVirtualRouter> mock_sai_virtual_router_;
mock_sai_virtual_router = &mock_sai_virtual_router_;
sai_virtual_router_api->create_virtual_router = create_virtual_router;
sai_virtual_router_api->remove_virtual_router = remove_virtual_router;
sai_virtual_router_api->set_virtual_router_attribute = set_virtual_router_attribute;
EXPECT_CALL(mock_sai_virtual_router_, create_virtual_router(_, _, _, _))
.WillOnce(DoAll(SetArgPointee<0>(gVrfOid), Return(SAI_STATUS_SUCCESS)));
gVrfOrch->addExistingData(&app_vrf_table);
static_cast<Orch *>(gVrfOrch)->doTask();
}
} // namespace
int main(int argc, char *argv[])
{
testing::InitGoogleTest(&argc, argv);
sai_router_interface_api_t router_intfs_api;
sai_neighbor_api_t neighbor_api;
sai_next_hop_api_t next_hop_api;
sai_next_hop_group_api_t next_hop_group_api;
sai_route_api_t route_api;
sai_acl_api_t acl_api;
sai_policer_api_t policer_api;
sai_virtual_router_api_t virtual_router_api;
sai_hostif_api_t hostif_api;
sai_switch_api_t switch_api;
sai_mirror_api_t mirror_api;
sai_udf_api_t udf_api;
sai_router_intfs_api = &router_intfs_api;
sai_neighbor_api = &neighbor_api;
sai_next_hop_api = &next_hop_api;
sai_next_hop_group_api = &next_hop_group_api;
sai_route_api = &route_api;
sai_acl_api = &acl_api;
sai_policer_api = &policer_api;
sai_virtual_router_api = &virtual_router_api;
sai_hostif_api = &hostif_api;
sai_switch_api = &switch_api;
sai_mirror_api = &mirror_api;
sai_udf_api = &udf_api;
swss::DBConnector appl_db("APPL_DB", 0);
swss::DBConnector state_db("STATE_DB", 0);
swss::DBConnector config_db("CONFIG_DB", 0);
swss::DBConnector counters_db("COUNTERS_DB", 0);
gAppDb = &appl_db;
gStateDb = &state_db;
gConfigDb = &config_db;
gCountersDb = &counters_db;
std::vector<table_name_with_pri_t> ports_tables;
PortsOrch ports_orch(gAppDb, gStateDb, ports_tables, gAppDb);
gPortsOrch = &ports_orch;
CrmOrch crm_orch(gConfigDb, CFG_CRM_TABLE_NAME);
gCrmOrch = &crm_orch;
VRFOrch vrf_orch(gAppDb, APP_VRF_TABLE_NAME, gStateDb, STATE_VRF_OBJECT_TABLE_NAME);
gVrfOrch = &vrf_orch;
gDirectory.set(static_cast<VRFOrch *>(&vrf_orch));
// Setup ports for all tests.
SetupPorts();
AddVrf();
return RUN_ALL_TESTS();
}
| [
"noreply@github.com"
] | noaOrMlnx.noreply@github.com |
269b53727c797f0d387651aa70dee198cafc48aa | ac8e27210d8ae1c79e7d0d9db1bcf4e31c737718 | /tools/flang/runtime/libpgmath/lib/common/acos/fma3/vdacos2.cpp | 9ab2aaa643c7ab4aa10ab943afeb31e0ebc03f33 | [
"Apache-2.0",
"NCSA",
"LLVM-exception"
] | permissive | steleman/flang9 | d583d619bfb67d27a995274e30c8c1a642696ec1 | 4ad7c213b30422e1e0fcb3ac826640d576977d04 | refs/heads/master | 2020-11-27T09:50:18.644313 | 2020-03-07T14:37:32 | 2020-03-07T14:37:32 | 229,387,867 | 0 | 0 | Apache-2.0 | 2019-12-21T06:35:35 | 2019-12-21T06:35:34 | null | UTF-8 | C++ | false | false | 4,173 | cpp |
/*
* Copyright (c) 2017-2018, NVIDIA CORPORATION. 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.
*
*/
#if defined(TARGET_LINUX_POWER)
#include "xmm2altivec.h"
#elif defined(TARGET_LINUX_ARM64)
#include "arm64intrin.h"
#else
#include <immintrin.h>
#endif
#include "dacos_defs.h"
extern "C" __m128d __fvd_acos_fma3(__m128d);
__m128d __fvd_acos_fma3(__m128d const a)
{
__m128i const ABS_MASK = _mm_set1_epi64x(ABS_MASK_LL);
__m128d const ZERO = _mm_set1_pd(0.0);
__m128d const ONE = _mm_set1_pd(1.0);
__m128d const SGN_MASK = (__m128d)_mm_set1_epi64x(SGN_MASK_LL);
__m128d const THRESHOLD = _mm_set1_pd(THRESHOLD_D);
__m128d const PI_HI = _mm_set1_pd(PI_HI_D);
__m128d const A0 = _mm_set1_pd(A0_D);
__m128d const B0 = _mm_set1_pd(B0_D);
__m128d const C0 = _mm_set1_pd(C0_D);
__m128d const D0 = _mm_set1_pd(D0_D);
__m128d const E0 = _mm_set1_pd(E0_D);
__m128d const F0 = _mm_set1_pd(F0_D);
__m128d const G0 = _mm_set1_pd(G0_D);
__m128d const H0 = _mm_set1_pd(H0_D);
__m128d const I0 = _mm_set1_pd(I0_D);
__m128d const J0 = _mm_set1_pd(J0_D);
__m128d const K0 = _mm_set1_pd(K0_D);
__m128d const L0 = _mm_set1_pd(L0_D);
__m128d const M0 = _mm_set1_pd(M0_D);
__m128d const N0 = _mm_set1_pd(N0_D);
__m128d const A1 = _mm_set1_pd(A1_D);
__m128d const B1 = _mm_set1_pd(B1_D);
__m128d const C1 = _mm_set1_pd(C1_D);
__m128d const D1 = _mm_set1_pd(D1_D);
__m128d const E1 = _mm_set1_pd(E1_D);
__m128d const F1 = _mm_set1_pd(F1_D);
__m128d const G1 = _mm_set1_pd(G1_D);
__m128d const H1 = _mm_set1_pd(H1_D);
__m128d const I1 = _mm_set1_pd(I1_D);
__m128d const J1 = _mm_set1_pd(J1_D);
__m128d const K1 = _mm_set1_pd(K1_D);
__m128d const L1 = _mm_set1_pd(L1_D);
__m128d const M1 = _mm_set1_pd(M1_D);
__m128d x, x2, a3, x6, x12, a15, c;
__m128d sq, p0, p1;
__m128d res, cmp, sign, fix;
__m128d p0hi, p0lo, p1hi, p1lo;
x = _mm_and_pd(a, (__m128d)ABS_MASK);
x2 = _mm_mul_pd(a, a);
sq = _mm_sub_pd(ONE, x);
sq = _mm_sqrt_pd(sq);
p1hi = _mm_fmadd_pd(A1, x, B1);
p1hi = _mm_fmadd_pd(p1hi, x, C1);
p1lo = _mm_fmadd_pd(H1, x, I1);
p1hi = _mm_fmadd_pd(p1hi, x, D1);
p1lo = _mm_fmadd_pd(p1lo, x, J1);
p0hi = _mm_fmadd_pd(A0, x2, B0);
p0lo = _mm_fmadd_pd(H0, x2, I0);
p1hi = _mm_fmadd_pd(p1hi, x, E1);
p1lo = _mm_fmadd_pd(p1lo, x, K1);
p0hi = _mm_fmadd_pd(p0hi, x2, C0);
p0lo = _mm_fmadd_pd(p0lo, x2, J0);
a3 = _mm_mul_pd(x2, a);
p1hi = _mm_fmadd_pd(p1hi, x, F1);
p1lo = _mm_fmadd_pd(p1lo, x, L1);
p0hi = _mm_fmadd_pd(p0hi, x2, D0);
p0lo = _mm_fmadd_pd(p0lo, x2, K0);
p1hi = _mm_fmadd_pd(p1hi, x, G1);
x6 = _mm_mul_pd(a3, a3);
p1lo = _mm_fmadd_pd(p1lo, x, M1);
__m128d pi_mask = _mm_cmp_pd(ZERO, a, _CMP_GT_OQ);
fix = _mm_cmp_pd(a, ONE, _CMP_GT_OQ);
p0hi = _mm_fmadd_pd(p0hi, x2, E0);
p0lo = _mm_fmadd_pd(p0lo, x2, L0);
p1 = _mm_fmadd_pd(p1hi, x6, p1lo);
__m128d pi_hi = _mm_and_pd(pi_mask, PI_HI);
fix = _mm_and_pd(fix, SGN_MASK);
sign = _mm_and_pd(a, SGN_MASK);
p0hi = _mm_fmadd_pd(p0hi, x2, F0);
x12 = _mm_mul_pd(x6, x6);
p0lo = _mm_fmadd_pd(p0lo, x2, M0);
c = _mm_sub_pd(N0, a);
p1 = _mm_fmsub_pd(sq, p1, pi_hi);
fix = _mm_xor_pd(fix, sign);
p0hi = _mm_fmadd_pd(p0hi, x2, G0);
a15 = _mm_mul_pd(x12, a3);
p0lo = _mm_fmadd_pd(p0lo, a3, c);
p1 = _mm_xor_pd(p1, fix);
p0 = _mm_fmadd_pd(p0hi, a15, p0lo);
cmp = _mm_cmp_pd(x, THRESHOLD, _CMP_LT_OQ);
res = _mm_blendv_pd(p1, p0, cmp);
return res;
}
| [
"stefan.teleman@cavium.com"
] | stefan.teleman@cavium.com |
a6e0acf7ffa0abf5a3d26bf5e4d34692f919bc74 | b131d350e15c595f0baaa85157e8cbd1641d312d | /tree/LeftView-iterative.cpp | 821f39446cea25d62016e4b0ca2e8461ad8eb655 | [] | no_license | pkb07815/coding_practice | 4b3d51f6869a67b9d29b8ed6ceac9acfa844add9 | 92b64198682addf049f7675ed2588000756e8776 | refs/heads/master | 2021-07-20T10:33:58.766106 | 2021-07-15T17:41:40 | 2021-07-15T17:41:40 | 238,877,444 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,232 | cpp | /**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<int> rightSideView(TreeNode* root) {
queue<TreeNode *> que;
vector<int> vct;
if(!root) return vct;
que.push(root);
while(!que.empty())
{
// for left view take the front element from queue
vct.push_back(que.front()->val);
int n=que.size();
while(n--)
{
TreeNode *node=que.front();
que.pop();
if(node->left)
que.push(node->left);
if(node->right)
que.push(node->right);
}
}
return vct;
}
};
| [
"noreply@github.com"
] | pkb07815.noreply@github.com |
53c33b1bb1db9b11c06a8f087dcb337a70fb15bf | 90e66232f6d02811acf1d9123dd1b7b5d19ed35a | /a1paper.cpp | 4169a12788f819ad0e7ee610a0559a544ec13862 | [] | no_license | lukevand/kattis-submissions | 8396fb2dbc4d5550c47eae7525bf9482d5155955 | fc61a5117e507ef283241dec1dd3caa242df8934 | refs/heads/master | 2021-07-12T16:42:43.582376 | 2020-03-13T05:57:51 | 2021-05-27T19:40:12 | 246,996,282 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,028 | cpp | #include <bits/stdc++.h>
using namespace std;
#define debugp(X) for(auto const& CCC:X) std::cerr<<CCC<<' '; cerr<<'\n'
#define debugvii(X) for(auto const& CCC:X) std::cerr<<CCC.first<<', '<<CC.second << '\n'
#define debug(XXX) cerr << #XXX << ": " << XXX << '\n'
#define debuga(X, _a, _b) cerr << #X << ": "; for (int _i=_a; _i<_b; _i++) cout << X[_i] << " "; cout << '\n';
int paper[35];
int n;
double length(int nn) {
return pow(2, 0.25 - nn/2.0);
}
int main()
{
scanf("%d", &n);
for (int i=2; i<n+3; i++) {
scanf("%d", &paper[i]);
}
double re = 0;
int need = 2;
bool done = false;
for (int i=2; i<n+3 && !done; i++) {
/* debug(re); */
if (paper[i] >= need) {
re += length(i)*(need>>1);
done = true;
} else {
re += length(i)*(need>>1);
need -= paper[i];
need *= 2;
}
}
if (!done) {
printf("impossible\n");
} else {
printf("%.11f\n", re);
}
return 0;
}
| [
"lvanduuren@protonmail.com"
] | lvanduuren@protonmail.com |
900bc4d73005c9ef3788977607df85fe56ef8c9e | 053770753a862f6406d5d3c20218d48a68ff777d | /src/abr/bola_basic.cc | 44e64094dde35abdf7fce44192a1e8d5a659877d | [] | no_license | bradparks/puffer__stream_live_tv_us | 4091e91beafa3bd62f61e302e0881c7a653a8814 | d9d28209193b89396bc113ec8dc53d0098753786 | refs/heads/master | 2022-10-02T04:13:40.169149 | 2020-06-09T20:19:31 | 2020-06-09T20:30:26 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,549 | cc | #include "bola_basic.hh"
#include "ws_client.hh"
#include <math.h>
#include <fstream>
#include <algorithm>
using namespace std;
BolaBasic::BolaBasic(const WebSocketClient & client, const string & abr_name)
: ABRAlgo(client, abr_name)
{
// TODO: Make gamma and V configurable
}
/* Note BOLA uses the raw value of utility directly. */
double BolaBasic::utility(double raw_ssim) const
{
return ssim_db(raw_ssim);
}
/* Size units affect objective value, but not the decision */
/* Note: X_buf_chunks represents a number of chunks,
* but may be fractional (as in paper) */
double BolaBasic::objective(const Encoded & encoded, double client_buf_chunks,
double chunk_duration_s) const
{
// paper uses V rather than Vp for objective
double V = params.Vp / chunk_duration_s;
return (V * (encoded.utility + params.gp) - client_buf_chunks) / encoded.size;
}
BolaBasic::Encoded
BolaBasic::choose_max_objective(const vector<Encoded> & encoded_formats,
double client_buf_chunks,
double chunk_duration_s) const
{
const auto chosen = max_element(encoded_formats.begin(),
encoded_formats.end(),
[this, client_buf_chunks, chunk_duration_s](const Encoded& a,
const Encoded& b) {
return objective(a, client_buf_chunks, chunk_duration_s) <
objective(b, client_buf_chunks, chunk_duration_s);
}
);
return *chosen;
}
VideoFormat BolaBasic::select_video_format()
{
const auto & channel = client_.channel();
double chunk_duration_s = channel->vduration() * 1.0 / channel->timescale();
double client_buf_s = max(client_.video_playback_buf(), 0.0);
double client_buf_chunks = client_buf_s / chunk_duration_s;
/* 1. Get info for each encoded format */
vector<Encoded> encoded_formats;
uint64_t next_vts = client_.next_vts().value();
const auto & data_map = channel->vdata(next_vts);
const auto & ssim_map = channel->vssim(next_vts);
const auto & vformats = channel->vformats();
transform(vformats.begin(), vformats.end(), back_inserter(encoded_formats),
[this, data_map, ssim_map](const VideoFormat & vf) {
return Encoded { vf, get<1>(data_map.at(vf)), utility(ssim_map.at(vf)) };
}
);
/* 2. Using parameters, calculate objective for each format.
* Choose format with max objective. */
return choose_max_objective(encoded_formats, client_buf_chunks,
chunk_duration_s).vf;
}
| [
"emilykmarx@gmail.com"
] | emilykmarx@gmail.com |
3a12c0fed3efa7730b73c96f01d7944dc8d7f5e1 | 16d46f116d9b769801e745d763949b8f82dfeb18 | /foofxp/model/ftp/server_reply.hpp | 08cbb79a738a8d67cb7ab7f81a2a43b82820b50f | [] | no_license | rdingwall/foofxp | a89605c018fa14402ac81848ccfd478885f9286f | 0c2c42be5b5d75465d5a7b6a2eaf9786e135270c | refs/heads/master | 2016-09-06T20:12:37.713306 | 2012-08-06T20:38:14 | 2012-08-06T20:38:14 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,099 | hpp | #ifndef FOOFXP_SERVER_REPLY_HPP_INCLUDED
#define FOOFXP_SERVER_REPLY_HPP_INCLUDED
#include <stdexcept>
#include <string>
namespace foofxp {
namespace model {
namespace ftp {
class server_reply
{
public:
typedef unsigned short reply_code_type;
server_reply(const std::string & line);
bool is_end_of_reply() const;
bool is_valid_format() const { return is_valid_format_; };
bool is_transient_negative_reply() const throw(std::invalid_argument);
bool is_permanent_negative_reply() const throw(std::invalid_argument);
bool is_negative_reply() const throw(std::invalid_argument);
std::string get_message() const throw(std::invalid_argument);
const std::string & original_line() const { return line_; };
reply_code_type get_reply_code() const
throw (std::invalid_argument, std::out_of_range);
std::string get_pwd_path() const throw (std::invalid_argument);
private:
static bool is_valid_format(const std::string & line);
std::string line_;
bool is_valid_format_;
};
} // namespace ftp
} // namespace model
} // namespace foofxp
#endif // FOOFXP_SERVER_REPLY_HPP_INCLUDED
| [
"rdingwall@gmail.com"
] | rdingwall@gmail.com |
ee76c405f9bd006a80415e7606ceabce522a4dfe | 6ed471f36e5188f77dc61cca24daa41496a6d4a0 | /SDK/EngramEntry_ClothGloves_functions.cpp | 8e107cf50ff5a1b8ea9c68ca9201ea1fef28462f | [] | no_license | zH4x-SDK/zARKSotF-SDK | 77bfaf9b4b9b6a41951ee18db88f826dd720c367 | 714730f4bb79c07d065181caf360d168761223f6 | refs/heads/main | 2023-07-16T22:33:15.140456 | 2021-08-27T13:40:06 | 2021-08-27T13:40:06 | 400,521,086 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,036 | cpp |
#include "../SDK.h"
// Name: ARKSotF, Version: 178.8.0
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
namespace SDK
{
//---------------------------------------------------------------------------
// Functions
//---------------------------------------------------------------------------
// Function EngramEntry_ClothGloves.EngramEntry_ClothGloves_C.ExecuteUbergraph_EngramEntry_ClothGloves
// ()
// Parameters:
// int EntryPoint (Parm, ZeroConstructor, IsPlainOldData)
void UEngramEntry_ClothGloves_C::ExecuteUbergraph_EngramEntry_ClothGloves(int EntryPoint)
{
static auto fn = UObject::FindObject<UFunction>("Function EngramEntry_ClothGloves.EngramEntry_ClothGloves_C.ExecuteUbergraph_EngramEntry_ClothGloves");
UEngramEntry_ClothGloves_C_ExecuteUbergraph_EngramEntry_ClothGloves_Params params;
params.EntryPoint = EntryPoint;
auto flags = fn->FunctionFlags;
UObject::ProcessEvent(fn, ¶ms);
fn->FunctionFlags = flags;
}
}
#ifdef _MSC_VER
#pragma pack(pop)
#endif
| [
"zp2kshield@gmail.com"
] | zp2kshield@gmail.com |
84ab2aa16985c967f720abaa413b4e8790fafbff | 61e6710132ac14b9a8a318576f11132fd48bd9c0 | /unityLibrary/src/main/Il2CppOutputProject/Source/il2cppOutput/UnityEngine.AnimationModule.cpp | 3cf151793a6e1dd64195b14dea3f8aef73b2821d | [] | no_license | gundarsv/FlyIt-Android | 3863976aac1fd9824a965669b4ec5437054d7ceb | 0669e7e8dbe502158eb6c8e8a17ec9e3aab1da73 | refs/heads/master | 2023-02-05T09:03:09.807679 | 2020-12-16T16:21:58 | 2020-12-16T16:21:58 | 296,871,087 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 242,284 | cpp | #include "pch-cpp.hpp"
#ifndef _MSC_VER
# include <alloca.h>
#else
# include <malloc.h>
#endif
#include <limits>
#include <stdint.h>
template <typename R, typename T1>
struct VirtFuncInvoker1
{
typedef R (*Func)(void*, T1, const RuntimeMethod*);
static inline R Invoke (Il2CppMethodSlot slot, RuntimeObject* obj, T1 p1)
{
const VirtualInvokeData& invokeData = il2cpp_codegen_get_virtual_invoke_data(slot, obj);
return ((Func)invokeData.methodPtr)(obj, p1, invokeData.method);
}
};
struct VirtActionInvoker0
{
typedef void (*Action)(void*, const RuntimeMethod*);
static inline void Invoke (Il2CppMethodSlot slot, RuntimeObject* obj)
{
const VirtualInvokeData& invokeData = il2cpp_codegen_get_virtual_invoke_data(slot, obj);
((Action)invokeData.methodPtr)(obj, invokeData.method);
}
};
struct GenericVirtActionInvoker0
{
typedef void (*Action)(void*, const RuntimeMethod*);
static inline void Invoke (const RuntimeMethod* method, RuntimeObject* obj)
{
VirtualInvokeData invokeData;
il2cpp_codegen_get_generic_virtual_invoke_data(method, obj, &invokeData);
((Action)invokeData.methodPtr)(obj, invokeData.method);
}
};
struct InterfaceActionInvoker0
{
typedef void (*Action)(void*, const RuntimeMethod*);
static inline void Invoke (Il2CppMethodSlot slot, RuntimeClass* declaringInterface, RuntimeObject* obj)
{
const VirtualInvokeData& invokeData = il2cpp_codegen_get_interface_invoke_data(slot, obj, declaringInterface);
((Action)invokeData.methodPtr)(obj, invokeData.method);
}
};
struct GenericInterfaceActionInvoker0
{
typedef void (*Action)(void*, const RuntimeMethod*);
static inline void Invoke (const RuntimeMethod* method, RuntimeObject* obj)
{
VirtualInvokeData invokeData;
il2cpp_codegen_get_generic_interface_invoke_data(method, obj, &invokeData);
((Action)invokeData.methodPtr)(obj, invokeData.method);
}
};
// UnityEngine.AnimationEvent
struct AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF;
// UnityEngine.AnimationState
struct AnimationState_tDB7088046A65ABCEC66B45147693CA0AD803A3AD;
// UnityEngine.Animator
struct Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149;
// UnityEngine.AnimatorOverrideController
struct AnimatorOverrideController_t4630AA9761965F735AEB26B9A92D210D6338B2DA;
// System.Delegate
struct Delegate_t;
// System.DelegateData
struct DelegateData_t17DD30660E330C49381DAA99F934BE75CB11F288;
// System.Collections.IDictionary
struct IDictionary_t99871C56B8EC2452AC5C4CF3831695E617B89D3A;
// System.Reflection.MethodInfo
struct MethodInfo_t;
// UnityEngine.Object
struct Object_tF2F3778131EFF286AF62B7B013A170F95A91571A;
// System.Runtime.Serialization.SafeSerializationManager
struct SafeSerializationManager_tDE44F029589A028F8A3053C5C06153FAB4AAE29F;
// UnityEngine.StateMachineBehaviour
struct StateMachineBehaviour_tBEDE439261DEB4C7334646339BC6F1E7958F095F;
// System.Void
struct Void_t700C6383A2A510C2CF4DD86DABD5CA9FF70ADAC5;
// UnityEngine.AnimatorOverrideController/OnOverrideControllerDirtyCallback
struct OnOverrideControllerDirtyCallback_t9E38572D7CF06EEFF943EA68082DAC68AB40476C;
// System.AsyncCallback
struct AsyncCallback_tA7921BEF974919C46FF8F9D9867C567B200BB0EA;
// System.Char[]
struct CharU5BU5D_t7B7FC5BC8091AA3B9CB0B29CDD80B5EE9254AA34;
// System.Delegate[]
struct DelegateU5BU5D_t677D8FE08A5F99E8EE49150B73966CD6E9BF7DB8;
// System.IAsyncResult
struct IAsyncResult_tC9F97BF36FCF122D29D3101D80642278297BF370;
// System.IntPtr[]
struct IntPtrU5BU5D_t27FC72B0409D75AAF33EC42498E8094E95FEE9A6;
// System.InvalidCastException
struct InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463;
// System.InvalidOperationException
struct InvalidOperationException_t10D3EE59AD28EC641ACEE05BCA4271A527E5ECAB;
// UnityEngine.ScriptableObject
struct ScriptableObject_t4361E08CEBF052C650D3666C7CEC37EB31DE116A;
// System.Diagnostics.StackTrace[]
struct StackTraceU5BU5D_t4AD999C288CB6D1F38A299D12B1598D606588971;
// System.String
struct String_t;
IL2CPP_EXTERN_C RuntimeClass* AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880_il2cpp_TypeInfo_var;
IL2CPP_EXTERN_C RuntimeClass* AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741_il2cpp_TypeInfo_var;
IL2CPP_EXTERN_C RuntimeClass* AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076_il2cpp_TypeInfo_var;
IL2CPP_EXTERN_C RuntimeClass* AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941_il2cpp_TypeInfo_var;
IL2CPP_EXTERN_C RuntimeClass* AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9_il2cpp_TypeInfo_var;
IL2CPP_EXTERN_C RuntimeClass* AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429_il2cpp_TypeInfo_var;
IL2CPP_EXTERN_C RuntimeClass* AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B_il2cpp_TypeInfo_var;
IL2CPP_EXTERN_C RuntimeClass* AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4_il2cpp_TypeInfo_var;
IL2CPP_EXTERN_C RuntimeClass* InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463_il2cpp_TypeInfo_var;
IL2CPP_EXTERN_C RuntimeClass* InvalidOperationException_t10D3EE59AD28EC641ACEE05BCA4271A527E5ECAB_il2cpp_TypeInfo_var;
IL2CPP_EXTERN_C RuntimeClass* PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A_il2cpp_TypeInfo_var;
IL2CPP_EXTERN_C String_t* _stringLiteral4DEE968069F34C26613ADFCD69C41EFC29314286;
IL2CPP_EXTERN_C String_t* _stringLiteral860B9EA7CDAB02A8A4B38336805EAE2FBA31F09C;
IL2CPP_EXTERN_C String_t* _stringLiteral8DC2252638D84FAF2C30B95D54EC83F52FA6C630;
IL2CPP_EXTERN_C String_t* _stringLiteral98C704D69BD1A288ED31DEE4ED4E50097A2D7018;
IL2CPP_EXTERN_C String_t* _stringLiteralA3C8FF345EC45846B2EE6801F84DD49340F0A9E1;
IL2CPP_EXTERN_C String_t* _stringLiteralBF563F6FCC25CE41FFE0BF7590AF9F4475916665;
IL2CPP_EXTERN_C String_t* _stringLiteralD2435BFAEB0372E848D9BE812E3B06AB862CC3D1;
IL2CPP_EXTERN_C String_t* _stringLiteralDA39A3EE5E6B4B0D3255BFEF95601890AFD80709;
IL2CPP_EXTERN_C String_t* _stringLiteralE066D08B565F88D413FDACA14C42BFF008FF4EB9;
IL2CPP_EXTERN_C String_t* _stringLiteralF5510C45DDAD777CCB4893578D995C9739F990F2;
IL2CPP_EXTERN_C const RuntimeMethod* AnimationLayerMixerPlayable__ctor_m42F8E5BB37A175AF298324D3072932ED9946427B_RuntimeMethod_var;
IL2CPP_EXTERN_C const RuntimeMethod* AnimationMixerPlayable__ctor_mA03CF37709B7854227E25F91BE4F7559981058B0_RuntimeMethod_var;
IL2CPP_EXTERN_C const RuntimeMethod* AnimationMotionXToDeltaPlayable__ctor_m11668860161B62484EA095BD6360AFD26A86DE93_RuntimeMethod_var;
IL2CPP_EXTERN_C const RuntimeMethod* AnimationOffsetPlayable__ctor_m9527E52AEA325EAE188AB9843497F2AB33CB742E_RuntimeMethod_var;
IL2CPP_EXTERN_C const RuntimeMethod* AnimationPosePlayable__ctor_m318607F120F21EDE3D7C1ED07C8B2ED13A23BF57_RuntimeMethod_var;
IL2CPP_EXTERN_C const RuntimeMethod* AnimationRemoveScalePlayable__ctor_m08810C8ECE9A3A100087DD84B13204EC3AF73A8F_RuntimeMethod_var;
IL2CPP_EXTERN_C const RuntimeMethod* AnimationScriptPlayable__ctor_m0B751F7A7D28F59AADACE7C13704D653E0879C56_RuntimeMethod_var;
IL2CPP_EXTERN_C const RuntimeMethod* AnimatorControllerPlayable_SetHandle_m19111E2A65EDAB3382AC9BE815503459A495FF38_RuntimeMethod_var;
IL2CPP_EXTERN_C const RuntimeMethod* PlayableHandle_IsPlayableOfType_TisAnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880_m866298E26CA43C28F7948D46E99D65FAA09722C5_RuntimeMethod_var;
IL2CPP_EXTERN_C const RuntimeMethod* PlayableHandle_IsPlayableOfType_TisAnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741_m30062CF184CC05FFAA026881BEFE337C13B7E70E_RuntimeMethod_var;
IL2CPP_EXTERN_C const RuntimeMethod* PlayableHandle_IsPlayableOfType_TisAnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076_m19943D18384297A3129F799C12E91B0D8162A02F_RuntimeMethod_var;
IL2CPP_EXTERN_C const RuntimeMethod* PlayableHandle_IsPlayableOfType_TisAnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941_m1B2FA89CE8F4A1EBD1AE3FF4E7154CFE120EDF85_RuntimeMethod_var;
IL2CPP_EXTERN_C const RuntimeMethod* PlayableHandle_IsPlayableOfType_TisAnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9_m171336A5BD550FD80BFD4B2BDF5903DF72C0E1C2_RuntimeMethod_var;
IL2CPP_EXTERN_C const RuntimeMethod* PlayableHandle_IsPlayableOfType_TisAnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429_mEF5219AC94275FE2811CEDC16FE0B850DBA7E9BE_RuntimeMethod_var;
IL2CPP_EXTERN_C const RuntimeMethod* PlayableHandle_IsPlayableOfType_TisAnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B_m529F82044C8D4F4B60EA35E96D1C0592644AD76B_RuntimeMethod_var;
IL2CPP_EXTERN_C const RuntimeMethod* PlayableHandle_IsPlayableOfType_TisAnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4_mFB1F4B388070EC30EC8DA09EB2869306EE60F2B8_RuntimeMethod_var;
IL2CPP_EXTERN_C const uint32_t AnimationClipPlayable_Equals_m73BDBE0839B6AA4782C37B21DD58D3388B5EC814_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimationEvent__ctor_mA2780A113EA8DD56C3C2EDD0D60BBA78047BACDE_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimationLayerMixerPlayable_Equals_m018BD27B24B3EDC5101A475A14F13F753F2323AA_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimationLayerMixerPlayable__cctor_mBE9F47E968D356F7BB549E705A4E91E1AEAEE807_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimationLayerMixerPlayable__ctor_m42F8E5BB37A175AF298324D3072932ED9946427B_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimationMixerPlayable_Equals_m8979D90ED92FF553B5D6AB0BDD616C544352816B_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimationMixerPlayable__cctor_m8DB71DF60AD75D3274E24FDB9DAC8F4D8FDD5C1D_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimationMixerPlayable__ctor_mA03CF37709B7854227E25F91BE4F7559981058B0_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimationMotionXToDeltaPlayable_Equals_mB08A41C628755AF909489716A1D62AECC2BFDD9E_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimationMotionXToDeltaPlayable__cctor_m0C46BAE776A8D7FAB7CEE08C4D6EBC63B08708FD_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimationMotionXToDeltaPlayable__ctor_m11668860161B62484EA095BD6360AFD26A86DE93_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimationOffsetPlayable_Equals_m9AFE60B035481569924E20C6953B4B21EF7734AA_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimationOffsetPlayable__cctor_m00251ED10BD7F52F20BC9D0A36B9C8AC52F15FA6_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimationOffsetPlayable__ctor_m9527E52AEA325EAE188AB9843497F2AB33CB742E_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimationPosePlayable_Equals_mECC5FA256AAA5334C38DBB6D00EE8AC1BDC015A1_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimationPosePlayable__cctor_m61B5F097B084BBB3CD21AE5E565AB35450C85B1C_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimationPosePlayable__ctor_m318607F120F21EDE3D7C1ED07C8B2ED13A23BF57_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimationRemoveScalePlayable_Equals_m7FE9E55B027861A0B91347F18DAC7E11E2740397_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimationRemoveScalePlayable__cctor_mA35B93BA4FDEDAA98ACE6A314BF0ED50839B8A98_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimationRemoveScalePlayable__ctor_m08810C8ECE9A3A100087DD84B13204EC3AF73A8F_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimationScriptPlayable_Equals_m1705DCC80312E3D34E17B32BDBAF4BBB78D435D8_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimationScriptPlayable__cctor_m2E7AD0269606C2EB23E1A6A1407E53ACAE1C6F31_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimationScriptPlayable__ctor_m0B751F7A7D28F59AADACE7C13704D653E0879C56_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimatorControllerPlayable_Equals_m9D2F918EE07AE657A11C13F285317C05BB257730_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimatorControllerPlayable_SetHandle_m19111E2A65EDAB3382AC9BE815503459A495FF38_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimatorControllerPlayable__cctor_m82C2FF3AEAD5D042648E50B513269EF367C51EB4_MetadataUsageId;
IL2CPP_EXTERN_C const uint32_t AnimatorControllerPlayable__ctor_mBD4E1368EB671F6349C5740B1BF131F97BD12CC8_MetadataUsageId;
struct Delegate_t_marshaled_com;
struct Delegate_t_marshaled_pinvoke;
struct Exception_t_marshaled_com;
struct Exception_t_marshaled_pinvoke;
struct Object_tF2F3778131EFF286AF62B7B013A170F95A91571A;;
struct Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshaled_com;
struct Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshaled_com;;
struct Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshaled_pinvoke;
struct Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshaled_pinvoke;;
struct DelegateU5BU5D_t677D8FE08A5F99E8EE49150B73966CD6E9BF7DB8;
IL2CPP_EXTERN_C_BEGIN
IL2CPP_EXTERN_C_END
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
// <Module>
struct U3CModuleU3E_t3C417EDD55E853BAA084114A5B12880739B4473C
{
public:
public:
};
// System.Object
struct Il2CppArrayBounds;
// System.Array
// System.Attribute
struct Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71 : public RuntimeObject
{
public:
public:
};
// System.String
struct String_t : public RuntimeObject
{
public:
// System.Int32 System.String::m_stringLength
int32_t ___m_stringLength_0;
// System.Char System.String::m_firstChar
Il2CppChar ___m_firstChar_1;
public:
inline static int32_t get_offset_of_m_stringLength_0() { return static_cast<int32_t>(offsetof(String_t, ___m_stringLength_0)); }
inline int32_t get_m_stringLength_0() const { return ___m_stringLength_0; }
inline int32_t* get_address_of_m_stringLength_0() { return &___m_stringLength_0; }
inline void set_m_stringLength_0(int32_t value)
{
___m_stringLength_0 = value;
}
inline static int32_t get_offset_of_m_firstChar_1() { return static_cast<int32_t>(offsetof(String_t, ___m_firstChar_1)); }
inline Il2CppChar get_m_firstChar_1() const { return ___m_firstChar_1; }
inline Il2CppChar* get_address_of_m_firstChar_1() { return &___m_firstChar_1; }
inline void set_m_firstChar_1(Il2CppChar value)
{
___m_firstChar_1 = value;
}
};
struct String_t_StaticFields
{
public:
// System.String System.String::Empty
String_t* ___Empty_5;
public:
inline static int32_t get_offset_of_Empty_5() { return static_cast<int32_t>(offsetof(String_t_StaticFields, ___Empty_5)); }
inline String_t* get_Empty_5() const { return ___Empty_5; }
inline String_t** get_address_of_Empty_5() { return &___Empty_5; }
inline void set_Empty_5(String_t* value)
{
___Empty_5 = value;
Il2CppCodeGenWriteBarrier((void**)(&___Empty_5), (void*)value);
}
};
// System.ValueType
struct ValueType_tDBF999C1B75C48C68621878250DBF6CDBCF51E52 : public RuntimeObject
{
public:
public:
};
// Native definition for P/Invoke marshalling of System.ValueType
struct ValueType_tDBF999C1B75C48C68621878250DBF6CDBCF51E52_marshaled_pinvoke
{
};
// Native definition for COM marshalling of System.ValueType
struct ValueType_tDBF999C1B75C48C68621878250DBF6CDBCF51E52_marshaled_com
{
};
// System.Boolean
struct Boolean_t07D1E3F34E4813023D64F584DFF7B34C9D922F37
{
public:
// System.Boolean System.Boolean::m_value
bool ___m_value_0;
public:
inline static int32_t get_offset_of_m_value_0() { return static_cast<int32_t>(offsetof(Boolean_t07D1E3F34E4813023D64F584DFF7B34C9D922F37, ___m_value_0)); }
inline bool get_m_value_0() const { return ___m_value_0; }
inline bool* get_address_of_m_value_0() { return &___m_value_0; }
inline void set_m_value_0(bool value)
{
___m_value_0 = value;
}
};
struct Boolean_t07D1E3F34E4813023D64F584DFF7B34C9D922F37_StaticFields
{
public:
// System.String System.Boolean::TrueString
String_t* ___TrueString_5;
// System.String System.Boolean::FalseString
String_t* ___FalseString_6;
public:
inline static int32_t get_offset_of_TrueString_5() { return static_cast<int32_t>(offsetof(Boolean_t07D1E3F34E4813023D64F584DFF7B34C9D922F37_StaticFields, ___TrueString_5)); }
inline String_t* get_TrueString_5() const { return ___TrueString_5; }
inline String_t** get_address_of_TrueString_5() { return &___TrueString_5; }
inline void set_TrueString_5(String_t* value)
{
___TrueString_5 = value;
Il2CppCodeGenWriteBarrier((void**)(&___TrueString_5), (void*)value);
}
inline static int32_t get_offset_of_FalseString_6() { return static_cast<int32_t>(offsetof(Boolean_t07D1E3F34E4813023D64F584DFF7B34C9D922F37_StaticFields, ___FalseString_6)); }
inline String_t* get_FalseString_6() const { return ___FalseString_6; }
inline String_t** get_address_of_FalseString_6() { return &___FalseString_6; }
inline void set_FalseString_6(String_t* value)
{
___FalseString_6 = value;
Il2CppCodeGenWriteBarrier((void**)(&___FalseString_6), (void*)value);
}
};
// System.Enum
struct Enum_t23B90B40F60E677A8025267341651C94AE079CDA : public ValueType_tDBF999C1B75C48C68621878250DBF6CDBCF51E52
{
public:
public:
};
struct Enum_t23B90B40F60E677A8025267341651C94AE079CDA_StaticFields
{
public:
// System.Char[] System.Enum::enumSeperatorCharArray
CharU5BU5D_t7B7FC5BC8091AA3B9CB0B29CDD80B5EE9254AA34* ___enumSeperatorCharArray_0;
public:
inline static int32_t get_offset_of_enumSeperatorCharArray_0() { return static_cast<int32_t>(offsetof(Enum_t23B90B40F60E677A8025267341651C94AE079CDA_StaticFields, ___enumSeperatorCharArray_0)); }
inline CharU5BU5D_t7B7FC5BC8091AA3B9CB0B29CDD80B5EE9254AA34* get_enumSeperatorCharArray_0() const { return ___enumSeperatorCharArray_0; }
inline CharU5BU5D_t7B7FC5BC8091AA3B9CB0B29CDD80B5EE9254AA34** get_address_of_enumSeperatorCharArray_0() { return &___enumSeperatorCharArray_0; }
inline void set_enumSeperatorCharArray_0(CharU5BU5D_t7B7FC5BC8091AA3B9CB0B29CDD80B5EE9254AA34* value)
{
___enumSeperatorCharArray_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___enumSeperatorCharArray_0), (void*)value);
}
};
// Native definition for P/Invoke marshalling of System.Enum
struct Enum_t23B90B40F60E677A8025267341651C94AE079CDA_marshaled_pinvoke
{
};
// Native definition for COM marshalling of System.Enum
struct Enum_t23B90B40F60E677A8025267341651C94AE079CDA_marshaled_com
{
};
// System.Int32
struct Int32_tFDE5F8CD43D10453F6A2E0C77FE48C6CC7009046
{
public:
// System.Int32 System.Int32::m_value
int32_t ___m_value_0;
public:
inline static int32_t get_offset_of_m_value_0() { return static_cast<int32_t>(offsetof(Int32_tFDE5F8CD43D10453F6A2E0C77FE48C6CC7009046, ___m_value_0)); }
inline int32_t get_m_value_0() const { return ___m_value_0; }
inline int32_t* get_address_of_m_value_0() { return &___m_value_0; }
inline void set_m_value_0(int32_t value)
{
___m_value_0 = value;
}
};
// System.IntPtr
struct IntPtr_t
{
public:
// System.Void* System.IntPtr::m_value
void* ___m_value_0;
public:
inline static int32_t get_offset_of_m_value_0() { return static_cast<int32_t>(offsetof(IntPtr_t, ___m_value_0)); }
inline void* get_m_value_0() const { return ___m_value_0; }
inline void** get_address_of_m_value_0() { return &___m_value_0; }
inline void set_m_value_0(void* value)
{
___m_value_0 = value;
}
};
struct IntPtr_t_StaticFields
{
public:
// System.IntPtr System.IntPtr::Zero
intptr_t ___Zero_1;
public:
inline static int32_t get_offset_of_Zero_1() { return static_cast<int32_t>(offsetof(IntPtr_t_StaticFields, ___Zero_1)); }
inline intptr_t get_Zero_1() const { return ___Zero_1; }
inline intptr_t* get_address_of_Zero_1() { return &___Zero_1; }
inline void set_Zero_1(intptr_t value)
{
___Zero_1 = value;
}
};
// System.Single
struct Single_tE07797BA3C98D4CA9B5A19413C19A76688AB899E
{
public:
// System.Single System.Single::m_value
float ___m_value_0;
public:
inline static int32_t get_offset_of_m_value_0() { return static_cast<int32_t>(offsetof(Single_tE07797BA3C98D4CA9B5A19413C19A76688AB899E, ___m_value_0)); }
inline float get_m_value_0() const { return ___m_value_0; }
inline float* get_address_of_m_value_0() { return &___m_value_0; }
inline void set_m_value_0(float value)
{
___m_value_0 = value;
}
};
// System.Void
struct Void_t700C6383A2A510C2CF4DD86DABD5CA9FF70ADAC5
{
public:
union
{
struct
{
};
uint8_t Void_t700C6383A2A510C2CF4DD86DABD5CA9FF70ADAC5__padding[1];
};
public:
};
// UnityEngine.Animations.NotKeyableAttribute
struct NotKeyableAttribute_tE0C94B5FF990C6B4BB118486BCA35CCDA91AA905 : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
public:
};
// UnityEngine.AnimatorClipInfo
struct AnimatorClipInfo_t758011D6F2B4C04893FCD364DAA936C801FBC610
{
public:
// System.Int32 UnityEngine.AnimatorClipInfo::m_ClipInstanceID
int32_t ___m_ClipInstanceID_0;
// System.Single UnityEngine.AnimatorClipInfo::m_Weight
float ___m_Weight_1;
public:
inline static int32_t get_offset_of_m_ClipInstanceID_0() { return static_cast<int32_t>(offsetof(AnimatorClipInfo_t758011D6F2B4C04893FCD364DAA936C801FBC610, ___m_ClipInstanceID_0)); }
inline int32_t get_m_ClipInstanceID_0() const { return ___m_ClipInstanceID_0; }
inline int32_t* get_address_of_m_ClipInstanceID_0() { return &___m_ClipInstanceID_0; }
inline void set_m_ClipInstanceID_0(int32_t value)
{
___m_ClipInstanceID_0 = value;
}
inline static int32_t get_offset_of_m_Weight_1() { return static_cast<int32_t>(offsetof(AnimatorClipInfo_t758011D6F2B4C04893FCD364DAA936C801FBC610, ___m_Weight_1)); }
inline float get_m_Weight_1() const { return ___m_Weight_1; }
inline float* get_address_of_m_Weight_1() { return &___m_Weight_1; }
inline void set_m_Weight_1(float value)
{
___m_Weight_1 = value;
}
};
// UnityEngine.AnimatorStateInfo
struct AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA
{
public:
// System.Int32 UnityEngine.AnimatorStateInfo::m_Name
int32_t ___m_Name_0;
// System.Int32 UnityEngine.AnimatorStateInfo::m_Path
int32_t ___m_Path_1;
// System.Int32 UnityEngine.AnimatorStateInfo::m_FullPath
int32_t ___m_FullPath_2;
// System.Single UnityEngine.AnimatorStateInfo::m_NormalizedTime
float ___m_NormalizedTime_3;
// System.Single UnityEngine.AnimatorStateInfo::m_Length
float ___m_Length_4;
// System.Single UnityEngine.AnimatorStateInfo::m_Speed
float ___m_Speed_5;
// System.Single UnityEngine.AnimatorStateInfo::m_SpeedMultiplier
float ___m_SpeedMultiplier_6;
// System.Int32 UnityEngine.AnimatorStateInfo::m_Tag
int32_t ___m_Tag_7;
// System.Int32 UnityEngine.AnimatorStateInfo::m_Loop
int32_t ___m_Loop_8;
public:
inline static int32_t get_offset_of_m_Name_0() { return static_cast<int32_t>(offsetof(AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA, ___m_Name_0)); }
inline int32_t get_m_Name_0() const { return ___m_Name_0; }
inline int32_t* get_address_of_m_Name_0() { return &___m_Name_0; }
inline void set_m_Name_0(int32_t value)
{
___m_Name_0 = value;
}
inline static int32_t get_offset_of_m_Path_1() { return static_cast<int32_t>(offsetof(AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA, ___m_Path_1)); }
inline int32_t get_m_Path_1() const { return ___m_Path_1; }
inline int32_t* get_address_of_m_Path_1() { return &___m_Path_1; }
inline void set_m_Path_1(int32_t value)
{
___m_Path_1 = value;
}
inline static int32_t get_offset_of_m_FullPath_2() { return static_cast<int32_t>(offsetof(AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA, ___m_FullPath_2)); }
inline int32_t get_m_FullPath_2() const { return ___m_FullPath_2; }
inline int32_t* get_address_of_m_FullPath_2() { return &___m_FullPath_2; }
inline void set_m_FullPath_2(int32_t value)
{
___m_FullPath_2 = value;
}
inline static int32_t get_offset_of_m_NormalizedTime_3() { return static_cast<int32_t>(offsetof(AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA, ___m_NormalizedTime_3)); }
inline float get_m_NormalizedTime_3() const { return ___m_NormalizedTime_3; }
inline float* get_address_of_m_NormalizedTime_3() { return &___m_NormalizedTime_3; }
inline void set_m_NormalizedTime_3(float value)
{
___m_NormalizedTime_3 = value;
}
inline static int32_t get_offset_of_m_Length_4() { return static_cast<int32_t>(offsetof(AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA, ___m_Length_4)); }
inline float get_m_Length_4() const { return ___m_Length_4; }
inline float* get_address_of_m_Length_4() { return &___m_Length_4; }
inline void set_m_Length_4(float value)
{
___m_Length_4 = value;
}
inline static int32_t get_offset_of_m_Speed_5() { return static_cast<int32_t>(offsetof(AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA, ___m_Speed_5)); }
inline float get_m_Speed_5() const { return ___m_Speed_5; }
inline float* get_address_of_m_Speed_5() { return &___m_Speed_5; }
inline void set_m_Speed_5(float value)
{
___m_Speed_5 = value;
}
inline static int32_t get_offset_of_m_SpeedMultiplier_6() { return static_cast<int32_t>(offsetof(AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA, ___m_SpeedMultiplier_6)); }
inline float get_m_SpeedMultiplier_6() const { return ___m_SpeedMultiplier_6; }
inline float* get_address_of_m_SpeedMultiplier_6() { return &___m_SpeedMultiplier_6; }
inline void set_m_SpeedMultiplier_6(float value)
{
___m_SpeedMultiplier_6 = value;
}
inline static int32_t get_offset_of_m_Tag_7() { return static_cast<int32_t>(offsetof(AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA, ___m_Tag_7)); }
inline int32_t get_m_Tag_7() const { return ___m_Tag_7; }
inline int32_t* get_address_of_m_Tag_7() { return &___m_Tag_7; }
inline void set_m_Tag_7(int32_t value)
{
___m_Tag_7 = value;
}
inline static int32_t get_offset_of_m_Loop_8() { return static_cast<int32_t>(offsetof(AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA, ___m_Loop_8)); }
inline int32_t get_m_Loop_8() const { return ___m_Loop_8; }
inline int32_t* get_address_of_m_Loop_8() { return &___m_Loop_8; }
inline void set_m_Loop_8(int32_t value)
{
___m_Loop_8 = value;
}
};
// UnityEngine.AnimatorTransitionInfo
struct AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0
{
public:
// System.Int32 UnityEngine.AnimatorTransitionInfo::m_FullPath
int32_t ___m_FullPath_0;
// System.Int32 UnityEngine.AnimatorTransitionInfo::m_UserName
int32_t ___m_UserName_1;
// System.Int32 UnityEngine.AnimatorTransitionInfo::m_Name
int32_t ___m_Name_2;
// System.Boolean UnityEngine.AnimatorTransitionInfo::m_HasFixedDuration
bool ___m_HasFixedDuration_3;
// System.Single UnityEngine.AnimatorTransitionInfo::m_Duration
float ___m_Duration_4;
// System.Single UnityEngine.AnimatorTransitionInfo::m_NormalizedTime
float ___m_NormalizedTime_5;
// System.Boolean UnityEngine.AnimatorTransitionInfo::m_AnyState
bool ___m_AnyState_6;
// System.Int32 UnityEngine.AnimatorTransitionInfo::m_TransitionType
int32_t ___m_TransitionType_7;
public:
inline static int32_t get_offset_of_m_FullPath_0() { return static_cast<int32_t>(offsetof(AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0, ___m_FullPath_0)); }
inline int32_t get_m_FullPath_0() const { return ___m_FullPath_0; }
inline int32_t* get_address_of_m_FullPath_0() { return &___m_FullPath_0; }
inline void set_m_FullPath_0(int32_t value)
{
___m_FullPath_0 = value;
}
inline static int32_t get_offset_of_m_UserName_1() { return static_cast<int32_t>(offsetof(AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0, ___m_UserName_1)); }
inline int32_t get_m_UserName_1() const { return ___m_UserName_1; }
inline int32_t* get_address_of_m_UserName_1() { return &___m_UserName_1; }
inline void set_m_UserName_1(int32_t value)
{
___m_UserName_1 = value;
}
inline static int32_t get_offset_of_m_Name_2() { return static_cast<int32_t>(offsetof(AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0, ___m_Name_2)); }
inline int32_t get_m_Name_2() const { return ___m_Name_2; }
inline int32_t* get_address_of_m_Name_2() { return &___m_Name_2; }
inline void set_m_Name_2(int32_t value)
{
___m_Name_2 = value;
}
inline static int32_t get_offset_of_m_HasFixedDuration_3() { return static_cast<int32_t>(offsetof(AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0, ___m_HasFixedDuration_3)); }
inline bool get_m_HasFixedDuration_3() const { return ___m_HasFixedDuration_3; }
inline bool* get_address_of_m_HasFixedDuration_3() { return &___m_HasFixedDuration_3; }
inline void set_m_HasFixedDuration_3(bool value)
{
___m_HasFixedDuration_3 = value;
}
inline static int32_t get_offset_of_m_Duration_4() { return static_cast<int32_t>(offsetof(AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0, ___m_Duration_4)); }
inline float get_m_Duration_4() const { return ___m_Duration_4; }
inline float* get_address_of_m_Duration_4() { return &___m_Duration_4; }
inline void set_m_Duration_4(float value)
{
___m_Duration_4 = value;
}
inline static int32_t get_offset_of_m_NormalizedTime_5() { return static_cast<int32_t>(offsetof(AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0, ___m_NormalizedTime_5)); }
inline float get_m_NormalizedTime_5() const { return ___m_NormalizedTime_5; }
inline float* get_address_of_m_NormalizedTime_5() { return &___m_NormalizedTime_5; }
inline void set_m_NormalizedTime_5(float value)
{
___m_NormalizedTime_5 = value;
}
inline static int32_t get_offset_of_m_AnyState_6() { return static_cast<int32_t>(offsetof(AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0, ___m_AnyState_6)); }
inline bool get_m_AnyState_6() const { return ___m_AnyState_6; }
inline bool* get_address_of_m_AnyState_6() { return &___m_AnyState_6; }
inline void set_m_AnyState_6(bool value)
{
___m_AnyState_6 = value;
}
inline static int32_t get_offset_of_m_TransitionType_7() { return static_cast<int32_t>(offsetof(AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0, ___m_TransitionType_7)); }
inline int32_t get_m_TransitionType_7() const { return ___m_TransitionType_7; }
inline int32_t* get_address_of_m_TransitionType_7() { return &___m_TransitionType_7; }
inline void set_m_TransitionType_7(int32_t value)
{
___m_TransitionType_7 = value;
}
};
// Native definition for P/Invoke marshalling of UnityEngine.AnimatorTransitionInfo
struct AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0_marshaled_pinvoke
{
int32_t ___m_FullPath_0;
int32_t ___m_UserName_1;
int32_t ___m_Name_2;
int32_t ___m_HasFixedDuration_3;
float ___m_Duration_4;
float ___m_NormalizedTime_5;
int32_t ___m_AnyState_6;
int32_t ___m_TransitionType_7;
};
// Native definition for COM marshalling of UnityEngine.AnimatorTransitionInfo
struct AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0_marshaled_com
{
int32_t ___m_FullPath_0;
int32_t ___m_UserName_1;
int32_t ___m_Name_2;
int32_t ___m_HasFixedDuration_3;
float ___m_Duration_4;
float ___m_NormalizedTime_5;
int32_t ___m_AnyState_6;
int32_t ___m_TransitionType_7;
};
// UnityEngine.Quaternion
struct Quaternion_t6D28618CF65156D4A0AD747370DDFD0C514A31B4
{
public:
// System.Single UnityEngine.Quaternion::x
float ___x_0;
// System.Single UnityEngine.Quaternion::y
float ___y_1;
// System.Single UnityEngine.Quaternion::z
float ___z_2;
// System.Single UnityEngine.Quaternion::w
float ___w_3;
public:
inline static int32_t get_offset_of_x_0() { return static_cast<int32_t>(offsetof(Quaternion_t6D28618CF65156D4A0AD747370DDFD0C514A31B4, ___x_0)); }
inline float get_x_0() const { return ___x_0; }
inline float* get_address_of_x_0() { return &___x_0; }
inline void set_x_0(float value)
{
___x_0 = value;
}
inline static int32_t get_offset_of_y_1() { return static_cast<int32_t>(offsetof(Quaternion_t6D28618CF65156D4A0AD747370DDFD0C514A31B4, ___y_1)); }
inline float get_y_1() const { return ___y_1; }
inline float* get_address_of_y_1() { return &___y_1; }
inline void set_y_1(float value)
{
___y_1 = value;
}
inline static int32_t get_offset_of_z_2() { return static_cast<int32_t>(offsetof(Quaternion_t6D28618CF65156D4A0AD747370DDFD0C514A31B4, ___z_2)); }
inline float get_z_2() const { return ___z_2; }
inline float* get_address_of_z_2() { return &___z_2; }
inline void set_z_2(float value)
{
___z_2 = value;
}
inline static int32_t get_offset_of_w_3() { return static_cast<int32_t>(offsetof(Quaternion_t6D28618CF65156D4A0AD747370DDFD0C514A31B4, ___w_3)); }
inline float get_w_3() const { return ___w_3; }
inline float* get_address_of_w_3() { return &___w_3; }
inline void set_w_3(float value)
{
___w_3 = value;
}
};
struct Quaternion_t6D28618CF65156D4A0AD747370DDFD0C514A31B4_StaticFields
{
public:
// UnityEngine.Quaternion UnityEngine.Quaternion::identityQuaternion
Quaternion_t6D28618CF65156D4A0AD747370DDFD0C514A31B4 ___identityQuaternion_4;
public:
inline static int32_t get_offset_of_identityQuaternion_4() { return static_cast<int32_t>(offsetof(Quaternion_t6D28618CF65156D4A0AD747370DDFD0C514A31B4_StaticFields, ___identityQuaternion_4)); }
inline Quaternion_t6D28618CF65156D4A0AD747370DDFD0C514A31B4 get_identityQuaternion_4() const { return ___identityQuaternion_4; }
inline Quaternion_t6D28618CF65156D4A0AD747370DDFD0C514A31B4 * get_address_of_identityQuaternion_4() { return &___identityQuaternion_4; }
inline void set_identityQuaternion_4(Quaternion_t6D28618CF65156D4A0AD747370DDFD0C514A31B4 value)
{
___identityQuaternion_4 = value;
}
};
// UnityEngine.SharedBetweenAnimatorsAttribute
struct SharedBetweenAnimatorsAttribute_t1F94A6AF21AC0F90F38FFEDE964054F34A117279 : public Attribute_t037CA9D9F3B742C063DB364D2EEBBF9FC5772C71
{
public:
public:
};
// UnityEngine.Vector3
struct Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E
{
public:
// System.Single UnityEngine.Vector3::x
float ___x_2;
// System.Single UnityEngine.Vector3::y
float ___y_3;
// System.Single UnityEngine.Vector3::z
float ___z_4;
public:
inline static int32_t get_offset_of_x_2() { return static_cast<int32_t>(offsetof(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E, ___x_2)); }
inline float get_x_2() const { return ___x_2; }
inline float* get_address_of_x_2() { return &___x_2; }
inline void set_x_2(float value)
{
___x_2 = value;
}
inline static int32_t get_offset_of_y_3() { return static_cast<int32_t>(offsetof(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E, ___y_3)); }
inline float get_y_3() const { return ___y_3; }
inline float* get_address_of_y_3() { return &___y_3; }
inline void set_y_3(float value)
{
___y_3 = value;
}
inline static int32_t get_offset_of_z_4() { return static_cast<int32_t>(offsetof(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E, ___z_4)); }
inline float get_z_4() const { return ___z_4; }
inline float* get_address_of_z_4() { return &___z_4; }
inline void set_z_4(float value)
{
___z_4 = value;
}
};
struct Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E_StaticFields
{
public:
// UnityEngine.Vector3 UnityEngine.Vector3::zeroVector
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E ___zeroVector_5;
// UnityEngine.Vector3 UnityEngine.Vector3::oneVector
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E ___oneVector_6;
// UnityEngine.Vector3 UnityEngine.Vector3::upVector
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E ___upVector_7;
// UnityEngine.Vector3 UnityEngine.Vector3::downVector
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E ___downVector_8;
// UnityEngine.Vector3 UnityEngine.Vector3::leftVector
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E ___leftVector_9;
// UnityEngine.Vector3 UnityEngine.Vector3::rightVector
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E ___rightVector_10;
// UnityEngine.Vector3 UnityEngine.Vector3::forwardVector
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E ___forwardVector_11;
// UnityEngine.Vector3 UnityEngine.Vector3::backVector
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E ___backVector_12;
// UnityEngine.Vector3 UnityEngine.Vector3::positiveInfinityVector
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E ___positiveInfinityVector_13;
// UnityEngine.Vector3 UnityEngine.Vector3::negativeInfinityVector
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E ___negativeInfinityVector_14;
public:
inline static int32_t get_offset_of_zeroVector_5() { return static_cast<int32_t>(offsetof(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E_StaticFields, ___zeroVector_5)); }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E get_zeroVector_5() const { return ___zeroVector_5; }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E * get_address_of_zeroVector_5() { return &___zeroVector_5; }
inline void set_zeroVector_5(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E value)
{
___zeroVector_5 = value;
}
inline static int32_t get_offset_of_oneVector_6() { return static_cast<int32_t>(offsetof(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E_StaticFields, ___oneVector_6)); }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E get_oneVector_6() const { return ___oneVector_6; }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E * get_address_of_oneVector_6() { return &___oneVector_6; }
inline void set_oneVector_6(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E value)
{
___oneVector_6 = value;
}
inline static int32_t get_offset_of_upVector_7() { return static_cast<int32_t>(offsetof(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E_StaticFields, ___upVector_7)); }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E get_upVector_7() const { return ___upVector_7; }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E * get_address_of_upVector_7() { return &___upVector_7; }
inline void set_upVector_7(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E value)
{
___upVector_7 = value;
}
inline static int32_t get_offset_of_downVector_8() { return static_cast<int32_t>(offsetof(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E_StaticFields, ___downVector_8)); }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E get_downVector_8() const { return ___downVector_8; }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E * get_address_of_downVector_8() { return &___downVector_8; }
inline void set_downVector_8(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E value)
{
___downVector_8 = value;
}
inline static int32_t get_offset_of_leftVector_9() { return static_cast<int32_t>(offsetof(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E_StaticFields, ___leftVector_9)); }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E get_leftVector_9() const { return ___leftVector_9; }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E * get_address_of_leftVector_9() { return &___leftVector_9; }
inline void set_leftVector_9(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E value)
{
___leftVector_9 = value;
}
inline static int32_t get_offset_of_rightVector_10() { return static_cast<int32_t>(offsetof(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E_StaticFields, ___rightVector_10)); }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E get_rightVector_10() const { return ___rightVector_10; }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E * get_address_of_rightVector_10() { return &___rightVector_10; }
inline void set_rightVector_10(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E value)
{
___rightVector_10 = value;
}
inline static int32_t get_offset_of_forwardVector_11() { return static_cast<int32_t>(offsetof(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E_StaticFields, ___forwardVector_11)); }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E get_forwardVector_11() const { return ___forwardVector_11; }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E * get_address_of_forwardVector_11() { return &___forwardVector_11; }
inline void set_forwardVector_11(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E value)
{
___forwardVector_11 = value;
}
inline static int32_t get_offset_of_backVector_12() { return static_cast<int32_t>(offsetof(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E_StaticFields, ___backVector_12)); }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E get_backVector_12() const { return ___backVector_12; }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E * get_address_of_backVector_12() { return &___backVector_12; }
inline void set_backVector_12(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E value)
{
___backVector_12 = value;
}
inline static int32_t get_offset_of_positiveInfinityVector_13() { return static_cast<int32_t>(offsetof(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E_StaticFields, ___positiveInfinityVector_13)); }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E get_positiveInfinityVector_13() const { return ___positiveInfinityVector_13; }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E * get_address_of_positiveInfinityVector_13() { return &___positiveInfinityVector_13; }
inline void set_positiveInfinityVector_13(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E value)
{
___positiveInfinityVector_13 = value;
}
inline static int32_t get_offset_of_negativeInfinityVector_14() { return static_cast<int32_t>(offsetof(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E_StaticFields, ___negativeInfinityVector_14)); }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E get_negativeInfinityVector_14() const { return ___negativeInfinityVector_14; }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E * get_address_of_negativeInfinityVector_14() { return &___negativeInfinityVector_14; }
inline void set_negativeInfinityVector_14(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E value)
{
___negativeInfinityVector_14 = value;
}
};
// System.Delegate
struct Delegate_t : public RuntimeObject
{
public:
// System.IntPtr System.Delegate::method_ptr
Il2CppMethodPointer ___method_ptr_0;
// System.IntPtr System.Delegate::invoke_impl
intptr_t ___invoke_impl_1;
// System.Object System.Delegate::m_target
RuntimeObject * ___m_target_2;
// System.IntPtr System.Delegate::method
intptr_t ___method_3;
// System.IntPtr System.Delegate::delegate_trampoline
intptr_t ___delegate_trampoline_4;
// System.IntPtr System.Delegate::extra_arg
intptr_t ___extra_arg_5;
// System.IntPtr System.Delegate::method_code
intptr_t ___method_code_6;
// System.Reflection.MethodInfo System.Delegate::method_info
MethodInfo_t * ___method_info_7;
// System.Reflection.MethodInfo System.Delegate::original_method_info
MethodInfo_t * ___original_method_info_8;
// System.DelegateData System.Delegate::data
DelegateData_t17DD30660E330C49381DAA99F934BE75CB11F288 * ___data_9;
// System.Boolean System.Delegate::method_is_virtual
bool ___method_is_virtual_10;
public:
inline static int32_t get_offset_of_method_ptr_0() { return static_cast<int32_t>(offsetof(Delegate_t, ___method_ptr_0)); }
inline Il2CppMethodPointer get_method_ptr_0() const { return ___method_ptr_0; }
inline Il2CppMethodPointer* get_address_of_method_ptr_0() { return &___method_ptr_0; }
inline void set_method_ptr_0(Il2CppMethodPointer value)
{
___method_ptr_0 = value;
}
inline static int32_t get_offset_of_invoke_impl_1() { return static_cast<int32_t>(offsetof(Delegate_t, ___invoke_impl_1)); }
inline intptr_t get_invoke_impl_1() const { return ___invoke_impl_1; }
inline intptr_t* get_address_of_invoke_impl_1() { return &___invoke_impl_1; }
inline void set_invoke_impl_1(intptr_t value)
{
___invoke_impl_1 = value;
}
inline static int32_t get_offset_of_m_target_2() { return static_cast<int32_t>(offsetof(Delegate_t, ___m_target_2)); }
inline RuntimeObject * get_m_target_2() const { return ___m_target_2; }
inline RuntimeObject ** get_address_of_m_target_2() { return &___m_target_2; }
inline void set_m_target_2(RuntimeObject * value)
{
___m_target_2 = value;
Il2CppCodeGenWriteBarrier((void**)(&___m_target_2), (void*)value);
}
inline static int32_t get_offset_of_method_3() { return static_cast<int32_t>(offsetof(Delegate_t, ___method_3)); }
inline intptr_t get_method_3() const { return ___method_3; }
inline intptr_t* get_address_of_method_3() { return &___method_3; }
inline void set_method_3(intptr_t value)
{
___method_3 = value;
}
inline static int32_t get_offset_of_delegate_trampoline_4() { return static_cast<int32_t>(offsetof(Delegate_t, ___delegate_trampoline_4)); }
inline intptr_t get_delegate_trampoline_4() const { return ___delegate_trampoline_4; }
inline intptr_t* get_address_of_delegate_trampoline_4() { return &___delegate_trampoline_4; }
inline void set_delegate_trampoline_4(intptr_t value)
{
___delegate_trampoline_4 = value;
}
inline static int32_t get_offset_of_extra_arg_5() { return static_cast<int32_t>(offsetof(Delegate_t, ___extra_arg_5)); }
inline intptr_t get_extra_arg_5() const { return ___extra_arg_5; }
inline intptr_t* get_address_of_extra_arg_5() { return &___extra_arg_5; }
inline void set_extra_arg_5(intptr_t value)
{
___extra_arg_5 = value;
}
inline static int32_t get_offset_of_method_code_6() { return static_cast<int32_t>(offsetof(Delegate_t, ___method_code_6)); }
inline intptr_t get_method_code_6() const { return ___method_code_6; }
inline intptr_t* get_address_of_method_code_6() { return &___method_code_6; }
inline void set_method_code_6(intptr_t value)
{
___method_code_6 = value;
}
inline static int32_t get_offset_of_method_info_7() { return static_cast<int32_t>(offsetof(Delegate_t, ___method_info_7)); }
inline MethodInfo_t * get_method_info_7() const { return ___method_info_7; }
inline MethodInfo_t ** get_address_of_method_info_7() { return &___method_info_7; }
inline void set_method_info_7(MethodInfo_t * value)
{
___method_info_7 = value;
Il2CppCodeGenWriteBarrier((void**)(&___method_info_7), (void*)value);
}
inline static int32_t get_offset_of_original_method_info_8() { return static_cast<int32_t>(offsetof(Delegate_t, ___original_method_info_8)); }
inline MethodInfo_t * get_original_method_info_8() const { return ___original_method_info_8; }
inline MethodInfo_t ** get_address_of_original_method_info_8() { return &___original_method_info_8; }
inline void set_original_method_info_8(MethodInfo_t * value)
{
___original_method_info_8 = value;
Il2CppCodeGenWriteBarrier((void**)(&___original_method_info_8), (void*)value);
}
inline static int32_t get_offset_of_data_9() { return static_cast<int32_t>(offsetof(Delegate_t, ___data_9)); }
inline DelegateData_t17DD30660E330C49381DAA99F934BE75CB11F288 * get_data_9() const { return ___data_9; }
inline DelegateData_t17DD30660E330C49381DAA99F934BE75CB11F288 ** get_address_of_data_9() { return &___data_9; }
inline void set_data_9(DelegateData_t17DD30660E330C49381DAA99F934BE75CB11F288 * value)
{
___data_9 = value;
Il2CppCodeGenWriteBarrier((void**)(&___data_9), (void*)value);
}
inline static int32_t get_offset_of_method_is_virtual_10() { return static_cast<int32_t>(offsetof(Delegate_t, ___method_is_virtual_10)); }
inline bool get_method_is_virtual_10() const { return ___method_is_virtual_10; }
inline bool* get_address_of_method_is_virtual_10() { return &___method_is_virtual_10; }
inline void set_method_is_virtual_10(bool value)
{
___method_is_virtual_10 = value;
}
};
// Native definition for P/Invoke marshalling of System.Delegate
struct Delegate_t_marshaled_pinvoke
{
intptr_t ___method_ptr_0;
intptr_t ___invoke_impl_1;
Il2CppIUnknown* ___m_target_2;
intptr_t ___method_3;
intptr_t ___delegate_trampoline_4;
intptr_t ___extra_arg_5;
intptr_t ___method_code_6;
MethodInfo_t * ___method_info_7;
MethodInfo_t * ___original_method_info_8;
DelegateData_t17DD30660E330C49381DAA99F934BE75CB11F288 * ___data_9;
int32_t ___method_is_virtual_10;
};
// Native definition for COM marshalling of System.Delegate
struct Delegate_t_marshaled_com
{
intptr_t ___method_ptr_0;
intptr_t ___invoke_impl_1;
Il2CppIUnknown* ___m_target_2;
intptr_t ___method_3;
intptr_t ___delegate_trampoline_4;
intptr_t ___extra_arg_5;
intptr_t ___method_code_6;
MethodInfo_t * ___method_info_7;
MethodInfo_t * ___original_method_info_8;
DelegateData_t17DD30660E330C49381DAA99F934BE75CB11F288 * ___data_9;
int32_t ___method_is_virtual_10;
};
// System.Exception
struct Exception_t : public RuntimeObject
{
public:
// System.String System.Exception::_className
String_t* ____className_1;
// System.String System.Exception::_message
String_t* ____message_2;
// System.Collections.IDictionary System.Exception::_data
RuntimeObject* ____data_3;
// System.Exception System.Exception::_innerException
Exception_t * ____innerException_4;
// System.String System.Exception::_helpURL
String_t* ____helpURL_5;
// System.Object System.Exception::_stackTrace
RuntimeObject * ____stackTrace_6;
// System.String System.Exception::_stackTraceString
String_t* ____stackTraceString_7;
// System.String System.Exception::_remoteStackTraceString
String_t* ____remoteStackTraceString_8;
// System.Int32 System.Exception::_remoteStackIndex
int32_t ____remoteStackIndex_9;
// System.Object System.Exception::_dynamicMethods
RuntimeObject * ____dynamicMethods_10;
// System.Int32 System.Exception::_HResult
int32_t ____HResult_11;
// System.String System.Exception::_source
String_t* ____source_12;
// System.Runtime.Serialization.SafeSerializationManager System.Exception::_safeSerializationManager
SafeSerializationManager_tDE44F029589A028F8A3053C5C06153FAB4AAE29F * ____safeSerializationManager_13;
// System.Diagnostics.StackTrace[] System.Exception::captured_traces
StackTraceU5BU5D_t4AD999C288CB6D1F38A299D12B1598D606588971* ___captured_traces_14;
// System.IntPtr[] System.Exception::native_trace_ips
IntPtrU5BU5D_t27FC72B0409D75AAF33EC42498E8094E95FEE9A6* ___native_trace_ips_15;
public:
inline static int32_t get_offset_of__className_1() { return static_cast<int32_t>(offsetof(Exception_t, ____className_1)); }
inline String_t* get__className_1() const { return ____className_1; }
inline String_t** get_address_of__className_1() { return &____className_1; }
inline void set__className_1(String_t* value)
{
____className_1 = value;
Il2CppCodeGenWriteBarrier((void**)(&____className_1), (void*)value);
}
inline static int32_t get_offset_of__message_2() { return static_cast<int32_t>(offsetof(Exception_t, ____message_2)); }
inline String_t* get__message_2() const { return ____message_2; }
inline String_t** get_address_of__message_2() { return &____message_2; }
inline void set__message_2(String_t* value)
{
____message_2 = value;
Il2CppCodeGenWriteBarrier((void**)(&____message_2), (void*)value);
}
inline static int32_t get_offset_of__data_3() { return static_cast<int32_t>(offsetof(Exception_t, ____data_3)); }
inline RuntimeObject* get__data_3() const { return ____data_3; }
inline RuntimeObject** get_address_of__data_3() { return &____data_3; }
inline void set__data_3(RuntimeObject* value)
{
____data_3 = value;
Il2CppCodeGenWriteBarrier((void**)(&____data_3), (void*)value);
}
inline static int32_t get_offset_of__innerException_4() { return static_cast<int32_t>(offsetof(Exception_t, ____innerException_4)); }
inline Exception_t * get__innerException_4() const { return ____innerException_4; }
inline Exception_t ** get_address_of__innerException_4() { return &____innerException_4; }
inline void set__innerException_4(Exception_t * value)
{
____innerException_4 = value;
Il2CppCodeGenWriteBarrier((void**)(&____innerException_4), (void*)value);
}
inline static int32_t get_offset_of__helpURL_5() { return static_cast<int32_t>(offsetof(Exception_t, ____helpURL_5)); }
inline String_t* get__helpURL_5() const { return ____helpURL_5; }
inline String_t** get_address_of__helpURL_5() { return &____helpURL_5; }
inline void set__helpURL_5(String_t* value)
{
____helpURL_5 = value;
Il2CppCodeGenWriteBarrier((void**)(&____helpURL_5), (void*)value);
}
inline static int32_t get_offset_of__stackTrace_6() { return static_cast<int32_t>(offsetof(Exception_t, ____stackTrace_6)); }
inline RuntimeObject * get__stackTrace_6() const { return ____stackTrace_6; }
inline RuntimeObject ** get_address_of__stackTrace_6() { return &____stackTrace_6; }
inline void set__stackTrace_6(RuntimeObject * value)
{
____stackTrace_6 = value;
Il2CppCodeGenWriteBarrier((void**)(&____stackTrace_6), (void*)value);
}
inline static int32_t get_offset_of__stackTraceString_7() { return static_cast<int32_t>(offsetof(Exception_t, ____stackTraceString_7)); }
inline String_t* get__stackTraceString_7() const { return ____stackTraceString_7; }
inline String_t** get_address_of__stackTraceString_7() { return &____stackTraceString_7; }
inline void set__stackTraceString_7(String_t* value)
{
____stackTraceString_7 = value;
Il2CppCodeGenWriteBarrier((void**)(&____stackTraceString_7), (void*)value);
}
inline static int32_t get_offset_of__remoteStackTraceString_8() { return static_cast<int32_t>(offsetof(Exception_t, ____remoteStackTraceString_8)); }
inline String_t* get__remoteStackTraceString_8() const { return ____remoteStackTraceString_8; }
inline String_t** get_address_of__remoteStackTraceString_8() { return &____remoteStackTraceString_8; }
inline void set__remoteStackTraceString_8(String_t* value)
{
____remoteStackTraceString_8 = value;
Il2CppCodeGenWriteBarrier((void**)(&____remoteStackTraceString_8), (void*)value);
}
inline static int32_t get_offset_of__remoteStackIndex_9() { return static_cast<int32_t>(offsetof(Exception_t, ____remoteStackIndex_9)); }
inline int32_t get__remoteStackIndex_9() const { return ____remoteStackIndex_9; }
inline int32_t* get_address_of__remoteStackIndex_9() { return &____remoteStackIndex_9; }
inline void set__remoteStackIndex_9(int32_t value)
{
____remoteStackIndex_9 = value;
}
inline static int32_t get_offset_of__dynamicMethods_10() { return static_cast<int32_t>(offsetof(Exception_t, ____dynamicMethods_10)); }
inline RuntimeObject * get__dynamicMethods_10() const { return ____dynamicMethods_10; }
inline RuntimeObject ** get_address_of__dynamicMethods_10() { return &____dynamicMethods_10; }
inline void set__dynamicMethods_10(RuntimeObject * value)
{
____dynamicMethods_10 = value;
Il2CppCodeGenWriteBarrier((void**)(&____dynamicMethods_10), (void*)value);
}
inline static int32_t get_offset_of__HResult_11() { return static_cast<int32_t>(offsetof(Exception_t, ____HResult_11)); }
inline int32_t get__HResult_11() const { return ____HResult_11; }
inline int32_t* get_address_of__HResult_11() { return &____HResult_11; }
inline void set__HResult_11(int32_t value)
{
____HResult_11 = value;
}
inline static int32_t get_offset_of__source_12() { return static_cast<int32_t>(offsetof(Exception_t, ____source_12)); }
inline String_t* get__source_12() const { return ____source_12; }
inline String_t** get_address_of__source_12() { return &____source_12; }
inline void set__source_12(String_t* value)
{
____source_12 = value;
Il2CppCodeGenWriteBarrier((void**)(&____source_12), (void*)value);
}
inline static int32_t get_offset_of__safeSerializationManager_13() { return static_cast<int32_t>(offsetof(Exception_t, ____safeSerializationManager_13)); }
inline SafeSerializationManager_tDE44F029589A028F8A3053C5C06153FAB4AAE29F * get__safeSerializationManager_13() const { return ____safeSerializationManager_13; }
inline SafeSerializationManager_tDE44F029589A028F8A3053C5C06153FAB4AAE29F ** get_address_of__safeSerializationManager_13() { return &____safeSerializationManager_13; }
inline void set__safeSerializationManager_13(SafeSerializationManager_tDE44F029589A028F8A3053C5C06153FAB4AAE29F * value)
{
____safeSerializationManager_13 = value;
Il2CppCodeGenWriteBarrier((void**)(&____safeSerializationManager_13), (void*)value);
}
inline static int32_t get_offset_of_captured_traces_14() { return static_cast<int32_t>(offsetof(Exception_t, ___captured_traces_14)); }
inline StackTraceU5BU5D_t4AD999C288CB6D1F38A299D12B1598D606588971* get_captured_traces_14() const { return ___captured_traces_14; }
inline StackTraceU5BU5D_t4AD999C288CB6D1F38A299D12B1598D606588971** get_address_of_captured_traces_14() { return &___captured_traces_14; }
inline void set_captured_traces_14(StackTraceU5BU5D_t4AD999C288CB6D1F38A299D12B1598D606588971* value)
{
___captured_traces_14 = value;
Il2CppCodeGenWriteBarrier((void**)(&___captured_traces_14), (void*)value);
}
inline static int32_t get_offset_of_native_trace_ips_15() { return static_cast<int32_t>(offsetof(Exception_t, ___native_trace_ips_15)); }
inline IntPtrU5BU5D_t27FC72B0409D75AAF33EC42498E8094E95FEE9A6* get_native_trace_ips_15() const { return ___native_trace_ips_15; }
inline IntPtrU5BU5D_t27FC72B0409D75AAF33EC42498E8094E95FEE9A6** get_address_of_native_trace_ips_15() { return &___native_trace_ips_15; }
inline void set_native_trace_ips_15(IntPtrU5BU5D_t27FC72B0409D75AAF33EC42498E8094E95FEE9A6* value)
{
___native_trace_ips_15 = value;
Il2CppCodeGenWriteBarrier((void**)(&___native_trace_ips_15), (void*)value);
}
};
struct Exception_t_StaticFields
{
public:
// System.Object System.Exception::s_EDILock
RuntimeObject * ___s_EDILock_0;
public:
inline static int32_t get_offset_of_s_EDILock_0() { return static_cast<int32_t>(offsetof(Exception_t_StaticFields, ___s_EDILock_0)); }
inline RuntimeObject * get_s_EDILock_0() const { return ___s_EDILock_0; }
inline RuntimeObject ** get_address_of_s_EDILock_0() { return &___s_EDILock_0; }
inline void set_s_EDILock_0(RuntimeObject * value)
{
___s_EDILock_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___s_EDILock_0), (void*)value);
}
};
// Native definition for P/Invoke marshalling of System.Exception
struct Exception_t_marshaled_pinvoke
{
char* ____className_1;
char* ____message_2;
RuntimeObject* ____data_3;
Exception_t_marshaled_pinvoke* ____innerException_4;
char* ____helpURL_5;
Il2CppIUnknown* ____stackTrace_6;
char* ____stackTraceString_7;
char* ____remoteStackTraceString_8;
int32_t ____remoteStackIndex_9;
Il2CppIUnknown* ____dynamicMethods_10;
int32_t ____HResult_11;
char* ____source_12;
SafeSerializationManager_tDE44F029589A028F8A3053C5C06153FAB4AAE29F * ____safeSerializationManager_13;
StackTraceU5BU5D_t4AD999C288CB6D1F38A299D12B1598D606588971* ___captured_traces_14;
Il2CppSafeArray/*NONE*/* ___native_trace_ips_15;
};
// Native definition for COM marshalling of System.Exception
struct Exception_t_marshaled_com
{
Il2CppChar* ____className_1;
Il2CppChar* ____message_2;
RuntimeObject* ____data_3;
Exception_t_marshaled_com* ____innerException_4;
Il2CppChar* ____helpURL_5;
Il2CppIUnknown* ____stackTrace_6;
Il2CppChar* ____stackTraceString_7;
Il2CppChar* ____remoteStackTraceString_8;
int32_t ____remoteStackIndex_9;
Il2CppIUnknown* ____dynamicMethods_10;
int32_t ____HResult_11;
Il2CppChar* ____source_12;
SafeSerializationManager_tDE44F029589A028F8A3053C5C06153FAB4AAE29F * ____safeSerializationManager_13;
StackTraceU5BU5D_t4AD999C288CB6D1F38A299D12B1598D606588971* ___captured_traces_14;
Il2CppSafeArray/*NONE*/* ___native_trace_ips_15;
};
// UnityEngine.AnimationEventSource
struct AnimationEventSource_t1B170B0043F7F21E0AA3577B3220584CA3797630
{
public:
// System.Int32 UnityEngine.AnimationEventSource::value__
int32_t ___value___2;
public:
inline static int32_t get_offset_of_value___2() { return static_cast<int32_t>(offsetof(AnimationEventSource_t1B170B0043F7F21E0AA3577B3220584CA3797630, ___value___2)); }
inline int32_t get_value___2() const { return ___value___2; }
inline int32_t* get_address_of_value___2() { return &___value___2; }
inline void set_value___2(int32_t value)
{
___value___2 = value;
}
};
// UnityEngine.Animations.AnimationHumanStream
struct AnimationHumanStream_t98A25119C1A24795BA152F54CF9F0673EEDF1C3F
{
public:
// System.IntPtr UnityEngine.Animations.AnimationHumanStream::stream
intptr_t ___stream_0;
public:
inline static int32_t get_offset_of_stream_0() { return static_cast<int32_t>(offsetof(AnimationHumanStream_t98A25119C1A24795BA152F54CF9F0673EEDF1C3F, ___stream_0)); }
inline intptr_t get_stream_0() const { return ___stream_0; }
inline intptr_t* get_address_of_stream_0() { return &___stream_0; }
inline void set_stream_0(intptr_t value)
{
___stream_0 = value;
}
};
// UnityEngine.Animations.AnimationStream
struct AnimationStream_t32D9239CBAA66CE867094B820035B2121D7E2714
{
public:
// System.UInt32 UnityEngine.Animations.AnimationStream::m_AnimatorBindingsVersion
uint32_t ___m_AnimatorBindingsVersion_0;
// System.IntPtr UnityEngine.Animations.AnimationStream::constant
intptr_t ___constant_1;
// System.IntPtr UnityEngine.Animations.AnimationStream::input
intptr_t ___input_2;
// System.IntPtr UnityEngine.Animations.AnimationStream::output
intptr_t ___output_3;
// System.IntPtr UnityEngine.Animations.AnimationStream::workspace
intptr_t ___workspace_4;
// System.IntPtr UnityEngine.Animations.AnimationStream::inputStreamAccessor
intptr_t ___inputStreamAccessor_5;
// System.IntPtr UnityEngine.Animations.AnimationStream::animationHandleBinder
intptr_t ___animationHandleBinder_6;
public:
inline static int32_t get_offset_of_m_AnimatorBindingsVersion_0() { return static_cast<int32_t>(offsetof(AnimationStream_t32D9239CBAA66CE867094B820035B2121D7E2714, ___m_AnimatorBindingsVersion_0)); }
inline uint32_t get_m_AnimatorBindingsVersion_0() const { return ___m_AnimatorBindingsVersion_0; }
inline uint32_t* get_address_of_m_AnimatorBindingsVersion_0() { return &___m_AnimatorBindingsVersion_0; }
inline void set_m_AnimatorBindingsVersion_0(uint32_t value)
{
___m_AnimatorBindingsVersion_0 = value;
}
inline static int32_t get_offset_of_constant_1() { return static_cast<int32_t>(offsetof(AnimationStream_t32D9239CBAA66CE867094B820035B2121D7E2714, ___constant_1)); }
inline intptr_t get_constant_1() const { return ___constant_1; }
inline intptr_t* get_address_of_constant_1() { return &___constant_1; }
inline void set_constant_1(intptr_t value)
{
___constant_1 = value;
}
inline static int32_t get_offset_of_input_2() { return static_cast<int32_t>(offsetof(AnimationStream_t32D9239CBAA66CE867094B820035B2121D7E2714, ___input_2)); }
inline intptr_t get_input_2() const { return ___input_2; }
inline intptr_t* get_address_of_input_2() { return &___input_2; }
inline void set_input_2(intptr_t value)
{
___input_2 = value;
}
inline static int32_t get_offset_of_output_3() { return static_cast<int32_t>(offsetof(AnimationStream_t32D9239CBAA66CE867094B820035B2121D7E2714, ___output_3)); }
inline intptr_t get_output_3() const { return ___output_3; }
inline intptr_t* get_address_of_output_3() { return &___output_3; }
inline void set_output_3(intptr_t value)
{
___output_3 = value;
}
inline static int32_t get_offset_of_workspace_4() { return static_cast<int32_t>(offsetof(AnimationStream_t32D9239CBAA66CE867094B820035B2121D7E2714, ___workspace_4)); }
inline intptr_t get_workspace_4() const { return ___workspace_4; }
inline intptr_t* get_address_of_workspace_4() { return &___workspace_4; }
inline void set_workspace_4(intptr_t value)
{
___workspace_4 = value;
}
inline static int32_t get_offset_of_inputStreamAccessor_5() { return static_cast<int32_t>(offsetof(AnimationStream_t32D9239CBAA66CE867094B820035B2121D7E2714, ___inputStreamAccessor_5)); }
inline intptr_t get_inputStreamAccessor_5() const { return ___inputStreamAccessor_5; }
inline intptr_t* get_address_of_inputStreamAccessor_5() { return &___inputStreamAccessor_5; }
inline void set_inputStreamAccessor_5(intptr_t value)
{
___inputStreamAccessor_5 = value;
}
inline static int32_t get_offset_of_animationHandleBinder_6() { return static_cast<int32_t>(offsetof(AnimationStream_t32D9239CBAA66CE867094B820035B2121D7E2714, ___animationHandleBinder_6)); }
inline intptr_t get_animationHandleBinder_6() const { return ___animationHandleBinder_6; }
inline intptr_t* get_address_of_animationHandleBinder_6() { return &___animationHandleBinder_6; }
inline void set_animationHandleBinder_6(intptr_t value)
{
___animationHandleBinder_6 = value;
}
};
// UnityEngine.HumanLimit
struct HumanLimit_t8F488DD21062BE1259B0F4C77E4EB24FB931E8D8
{
public:
// UnityEngine.Vector3 UnityEngine.HumanLimit::m_Min
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E ___m_Min_0;
// UnityEngine.Vector3 UnityEngine.HumanLimit::m_Max
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E ___m_Max_1;
// UnityEngine.Vector3 UnityEngine.HumanLimit::m_Center
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E ___m_Center_2;
// System.Single UnityEngine.HumanLimit::m_AxisLength
float ___m_AxisLength_3;
// System.Int32 UnityEngine.HumanLimit::m_UseDefaultValues
int32_t ___m_UseDefaultValues_4;
public:
inline static int32_t get_offset_of_m_Min_0() { return static_cast<int32_t>(offsetof(HumanLimit_t8F488DD21062BE1259B0F4C77E4EB24FB931E8D8, ___m_Min_0)); }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E get_m_Min_0() const { return ___m_Min_0; }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E * get_address_of_m_Min_0() { return &___m_Min_0; }
inline void set_m_Min_0(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E value)
{
___m_Min_0 = value;
}
inline static int32_t get_offset_of_m_Max_1() { return static_cast<int32_t>(offsetof(HumanLimit_t8F488DD21062BE1259B0F4C77E4EB24FB931E8D8, ___m_Max_1)); }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E get_m_Max_1() const { return ___m_Max_1; }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E * get_address_of_m_Max_1() { return &___m_Max_1; }
inline void set_m_Max_1(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E value)
{
___m_Max_1 = value;
}
inline static int32_t get_offset_of_m_Center_2() { return static_cast<int32_t>(offsetof(HumanLimit_t8F488DD21062BE1259B0F4C77E4EB24FB931E8D8, ___m_Center_2)); }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E get_m_Center_2() const { return ___m_Center_2; }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E * get_address_of_m_Center_2() { return &___m_Center_2; }
inline void set_m_Center_2(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E value)
{
___m_Center_2 = value;
}
inline static int32_t get_offset_of_m_AxisLength_3() { return static_cast<int32_t>(offsetof(HumanLimit_t8F488DD21062BE1259B0F4C77E4EB24FB931E8D8, ___m_AxisLength_3)); }
inline float get_m_AxisLength_3() const { return ___m_AxisLength_3; }
inline float* get_address_of_m_AxisLength_3() { return &___m_AxisLength_3; }
inline void set_m_AxisLength_3(float value)
{
___m_AxisLength_3 = value;
}
inline static int32_t get_offset_of_m_UseDefaultValues_4() { return static_cast<int32_t>(offsetof(HumanLimit_t8F488DD21062BE1259B0F4C77E4EB24FB931E8D8, ___m_UseDefaultValues_4)); }
inline int32_t get_m_UseDefaultValues_4() const { return ___m_UseDefaultValues_4; }
inline int32_t* get_address_of_m_UseDefaultValues_4() { return &___m_UseDefaultValues_4; }
inline void set_m_UseDefaultValues_4(int32_t value)
{
___m_UseDefaultValues_4 = value;
}
};
// UnityEngine.Object
struct Object_tF2F3778131EFF286AF62B7B013A170F95A91571A : public RuntimeObject
{
public:
// System.IntPtr UnityEngine.Object::m_CachedPtr
intptr_t ___m_CachedPtr_0;
public:
inline static int32_t get_offset_of_m_CachedPtr_0() { return static_cast<int32_t>(offsetof(Object_tF2F3778131EFF286AF62B7B013A170F95A91571A, ___m_CachedPtr_0)); }
inline intptr_t get_m_CachedPtr_0() const { return ___m_CachedPtr_0; }
inline intptr_t* get_address_of_m_CachedPtr_0() { return &___m_CachedPtr_0; }
inline void set_m_CachedPtr_0(intptr_t value)
{
___m_CachedPtr_0 = value;
}
};
struct Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_StaticFields
{
public:
// System.Int32 UnityEngine.Object::OffsetOfInstanceIDInCPlusPlusObject
int32_t ___OffsetOfInstanceIDInCPlusPlusObject_1;
public:
inline static int32_t get_offset_of_OffsetOfInstanceIDInCPlusPlusObject_1() { return static_cast<int32_t>(offsetof(Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_StaticFields, ___OffsetOfInstanceIDInCPlusPlusObject_1)); }
inline int32_t get_OffsetOfInstanceIDInCPlusPlusObject_1() const { return ___OffsetOfInstanceIDInCPlusPlusObject_1; }
inline int32_t* get_address_of_OffsetOfInstanceIDInCPlusPlusObject_1() { return &___OffsetOfInstanceIDInCPlusPlusObject_1; }
inline void set_OffsetOfInstanceIDInCPlusPlusObject_1(int32_t value)
{
___OffsetOfInstanceIDInCPlusPlusObject_1 = value;
}
};
// Native definition for P/Invoke marshalling of UnityEngine.Object
struct Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshaled_pinvoke
{
intptr_t ___m_CachedPtr_0;
};
// Native definition for COM marshalling of UnityEngine.Object
struct Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshaled_com
{
intptr_t ___m_CachedPtr_0;
};
// UnityEngine.Playables.PlayableHandle
struct PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A
{
public:
// System.IntPtr UnityEngine.Playables.PlayableHandle::m_Handle
intptr_t ___m_Handle_0;
// System.UInt32 UnityEngine.Playables.PlayableHandle::m_Version
uint32_t ___m_Version_1;
public:
inline static int32_t get_offset_of_m_Handle_0() { return static_cast<int32_t>(offsetof(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A, ___m_Handle_0)); }
inline intptr_t get_m_Handle_0() const { return ___m_Handle_0; }
inline intptr_t* get_address_of_m_Handle_0() { return &___m_Handle_0; }
inline void set_m_Handle_0(intptr_t value)
{
___m_Handle_0 = value;
}
inline static int32_t get_offset_of_m_Version_1() { return static_cast<int32_t>(offsetof(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A, ___m_Version_1)); }
inline uint32_t get_m_Version_1() const { return ___m_Version_1; }
inline uint32_t* get_address_of_m_Version_1() { return &___m_Version_1; }
inline void set_m_Version_1(uint32_t value)
{
___m_Version_1 = value;
}
};
struct PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A_StaticFields
{
public:
// UnityEngine.Playables.PlayableHandle UnityEngine.Playables.PlayableHandle::m_Null
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___m_Null_2;
public:
inline static int32_t get_offset_of_m_Null_2() { return static_cast<int32_t>(offsetof(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A_StaticFields, ___m_Null_2)); }
inline PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A get_m_Null_2() const { return ___m_Null_2; }
inline PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * get_address_of_m_Null_2() { return &___m_Null_2; }
inline void set_m_Null_2(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A value)
{
___m_Null_2 = value;
}
};
// UnityEngine.Playables.PlayableOutputHandle
struct PlayableOutputHandle_t8C84BCDB2AECFEDBCF0E7CC7CDBADD517D148CD1
{
public:
// System.IntPtr UnityEngine.Playables.PlayableOutputHandle::m_Handle
intptr_t ___m_Handle_0;
// System.UInt32 UnityEngine.Playables.PlayableOutputHandle::m_Version
uint32_t ___m_Version_1;
public:
inline static int32_t get_offset_of_m_Handle_0() { return static_cast<int32_t>(offsetof(PlayableOutputHandle_t8C84BCDB2AECFEDBCF0E7CC7CDBADD517D148CD1, ___m_Handle_0)); }
inline intptr_t get_m_Handle_0() const { return ___m_Handle_0; }
inline intptr_t* get_address_of_m_Handle_0() { return &___m_Handle_0; }
inline void set_m_Handle_0(intptr_t value)
{
___m_Handle_0 = value;
}
inline static int32_t get_offset_of_m_Version_1() { return static_cast<int32_t>(offsetof(PlayableOutputHandle_t8C84BCDB2AECFEDBCF0E7CC7CDBADD517D148CD1, ___m_Version_1)); }
inline uint32_t get_m_Version_1() const { return ___m_Version_1; }
inline uint32_t* get_address_of_m_Version_1() { return &___m_Version_1; }
inline void set_m_Version_1(uint32_t value)
{
___m_Version_1 = value;
}
};
struct PlayableOutputHandle_t8C84BCDB2AECFEDBCF0E7CC7CDBADD517D148CD1_StaticFields
{
public:
// UnityEngine.Playables.PlayableOutputHandle UnityEngine.Playables.PlayableOutputHandle::m_Null
PlayableOutputHandle_t8C84BCDB2AECFEDBCF0E7CC7CDBADD517D148CD1 ___m_Null_2;
public:
inline static int32_t get_offset_of_m_Null_2() { return static_cast<int32_t>(offsetof(PlayableOutputHandle_t8C84BCDB2AECFEDBCF0E7CC7CDBADD517D148CD1_StaticFields, ___m_Null_2)); }
inline PlayableOutputHandle_t8C84BCDB2AECFEDBCF0E7CC7CDBADD517D148CD1 get_m_Null_2() const { return ___m_Null_2; }
inline PlayableOutputHandle_t8C84BCDB2AECFEDBCF0E7CC7CDBADD517D148CD1 * get_address_of_m_Null_2() { return &___m_Null_2; }
inline void set_m_Null_2(PlayableOutputHandle_t8C84BCDB2AECFEDBCF0E7CC7CDBADD517D148CD1 value)
{
___m_Null_2 = value;
}
};
// UnityEngine.SkeletonBone
struct SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E
{
public:
// System.String UnityEngine.SkeletonBone::name
String_t* ___name_0;
// System.String UnityEngine.SkeletonBone::parentName
String_t* ___parentName_1;
// UnityEngine.Vector3 UnityEngine.SkeletonBone::position
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E ___position_2;
// UnityEngine.Quaternion UnityEngine.SkeletonBone::rotation
Quaternion_t6D28618CF65156D4A0AD747370DDFD0C514A31B4 ___rotation_3;
// UnityEngine.Vector3 UnityEngine.SkeletonBone::scale
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E ___scale_4;
public:
inline static int32_t get_offset_of_name_0() { return static_cast<int32_t>(offsetof(SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E, ___name_0)); }
inline String_t* get_name_0() const { return ___name_0; }
inline String_t** get_address_of_name_0() { return &___name_0; }
inline void set_name_0(String_t* value)
{
___name_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___name_0), (void*)value);
}
inline static int32_t get_offset_of_parentName_1() { return static_cast<int32_t>(offsetof(SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E, ___parentName_1)); }
inline String_t* get_parentName_1() const { return ___parentName_1; }
inline String_t** get_address_of_parentName_1() { return &___parentName_1; }
inline void set_parentName_1(String_t* value)
{
___parentName_1 = value;
Il2CppCodeGenWriteBarrier((void**)(&___parentName_1), (void*)value);
}
inline static int32_t get_offset_of_position_2() { return static_cast<int32_t>(offsetof(SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E, ___position_2)); }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E get_position_2() const { return ___position_2; }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E * get_address_of_position_2() { return &___position_2; }
inline void set_position_2(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E value)
{
___position_2 = value;
}
inline static int32_t get_offset_of_rotation_3() { return static_cast<int32_t>(offsetof(SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E, ___rotation_3)); }
inline Quaternion_t6D28618CF65156D4A0AD747370DDFD0C514A31B4 get_rotation_3() const { return ___rotation_3; }
inline Quaternion_t6D28618CF65156D4A0AD747370DDFD0C514A31B4 * get_address_of_rotation_3() { return &___rotation_3; }
inline void set_rotation_3(Quaternion_t6D28618CF65156D4A0AD747370DDFD0C514A31B4 value)
{
___rotation_3 = value;
}
inline static int32_t get_offset_of_scale_4() { return static_cast<int32_t>(offsetof(SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E, ___scale_4)); }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E get_scale_4() const { return ___scale_4; }
inline Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E * get_address_of_scale_4() { return &___scale_4; }
inline void set_scale_4(Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E value)
{
___scale_4 = value;
}
};
// Native definition for P/Invoke marshalling of UnityEngine.SkeletonBone
struct SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E_marshaled_pinvoke
{
char* ___name_0;
char* ___parentName_1;
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E ___position_2;
Quaternion_t6D28618CF65156D4A0AD747370DDFD0C514A31B4 ___rotation_3;
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E ___scale_4;
};
// Native definition for COM marshalling of UnityEngine.SkeletonBone
struct SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E_marshaled_com
{
Il2CppChar* ___name_0;
Il2CppChar* ___parentName_1;
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E ___position_2;
Quaternion_t6D28618CF65156D4A0AD747370DDFD0C514A31B4 ___rotation_3;
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E ___scale_4;
};
// UnityEngine.TrackedReference
struct TrackedReference_t17AA313389C655DCF279F96A2D85332B29596514 : public RuntimeObject
{
public:
// System.IntPtr UnityEngine.TrackedReference::m_Ptr
intptr_t ___m_Ptr_0;
public:
inline static int32_t get_offset_of_m_Ptr_0() { return static_cast<int32_t>(offsetof(TrackedReference_t17AA313389C655DCF279F96A2D85332B29596514, ___m_Ptr_0)); }
inline intptr_t get_m_Ptr_0() const { return ___m_Ptr_0; }
inline intptr_t* get_address_of_m_Ptr_0() { return &___m_Ptr_0; }
inline void set_m_Ptr_0(intptr_t value)
{
___m_Ptr_0 = value;
}
};
// Native definition for P/Invoke marshalling of UnityEngine.TrackedReference
struct TrackedReference_t17AA313389C655DCF279F96A2D85332B29596514_marshaled_pinvoke
{
intptr_t ___m_Ptr_0;
};
// Native definition for COM marshalling of UnityEngine.TrackedReference
struct TrackedReference_t17AA313389C655DCF279F96A2D85332B29596514_marshaled_com
{
intptr_t ___m_Ptr_0;
};
// System.MulticastDelegate
struct MulticastDelegate_t : public Delegate_t
{
public:
// System.Delegate[] System.MulticastDelegate::delegates
DelegateU5BU5D_t677D8FE08A5F99E8EE49150B73966CD6E9BF7DB8* ___delegates_11;
public:
inline static int32_t get_offset_of_delegates_11() { return static_cast<int32_t>(offsetof(MulticastDelegate_t, ___delegates_11)); }
inline DelegateU5BU5D_t677D8FE08A5F99E8EE49150B73966CD6E9BF7DB8* get_delegates_11() const { return ___delegates_11; }
inline DelegateU5BU5D_t677D8FE08A5F99E8EE49150B73966CD6E9BF7DB8** get_address_of_delegates_11() { return &___delegates_11; }
inline void set_delegates_11(DelegateU5BU5D_t677D8FE08A5F99E8EE49150B73966CD6E9BF7DB8* value)
{
___delegates_11 = value;
Il2CppCodeGenWriteBarrier((void**)(&___delegates_11), (void*)value);
}
};
// Native definition for P/Invoke marshalling of System.MulticastDelegate
struct MulticastDelegate_t_marshaled_pinvoke : public Delegate_t_marshaled_pinvoke
{
Delegate_t_marshaled_pinvoke** ___delegates_11;
};
// Native definition for COM marshalling of System.MulticastDelegate
struct MulticastDelegate_t_marshaled_com : public Delegate_t_marshaled_com
{
Delegate_t_marshaled_com** ___delegates_11;
};
// System.SystemException
struct SystemException_tC551B4D6EE3772B5F32C71EE8C719F4B43ECCC62 : public Exception_t
{
public:
public:
};
// UnityEngine.AnimationEvent
struct AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF : public RuntimeObject
{
public:
// System.Single UnityEngine.AnimationEvent::m_Time
float ___m_Time_0;
// System.String UnityEngine.AnimationEvent::m_FunctionName
String_t* ___m_FunctionName_1;
// System.String UnityEngine.AnimationEvent::m_StringParameter
String_t* ___m_StringParameter_2;
// UnityEngine.Object UnityEngine.AnimationEvent::m_ObjectReferenceParameter
Object_tF2F3778131EFF286AF62B7B013A170F95A91571A * ___m_ObjectReferenceParameter_3;
// System.Single UnityEngine.AnimationEvent::m_FloatParameter
float ___m_FloatParameter_4;
// System.Int32 UnityEngine.AnimationEvent::m_IntParameter
int32_t ___m_IntParameter_5;
// System.Int32 UnityEngine.AnimationEvent::m_MessageOptions
int32_t ___m_MessageOptions_6;
// UnityEngine.AnimationEventSource UnityEngine.AnimationEvent::m_Source
int32_t ___m_Source_7;
// UnityEngine.AnimationState UnityEngine.AnimationEvent::m_StateSender
AnimationState_tDB7088046A65ABCEC66B45147693CA0AD803A3AD * ___m_StateSender_8;
// UnityEngine.AnimatorStateInfo UnityEngine.AnimationEvent::m_AnimatorStateInfo
AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA ___m_AnimatorStateInfo_9;
// UnityEngine.AnimatorClipInfo UnityEngine.AnimationEvent::m_AnimatorClipInfo
AnimatorClipInfo_t758011D6F2B4C04893FCD364DAA936C801FBC610 ___m_AnimatorClipInfo_10;
public:
inline static int32_t get_offset_of_m_Time_0() { return static_cast<int32_t>(offsetof(AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF, ___m_Time_0)); }
inline float get_m_Time_0() const { return ___m_Time_0; }
inline float* get_address_of_m_Time_0() { return &___m_Time_0; }
inline void set_m_Time_0(float value)
{
___m_Time_0 = value;
}
inline static int32_t get_offset_of_m_FunctionName_1() { return static_cast<int32_t>(offsetof(AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF, ___m_FunctionName_1)); }
inline String_t* get_m_FunctionName_1() const { return ___m_FunctionName_1; }
inline String_t** get_address_of_m_FunctionName_1() { return &___m_FunctionName_1; }
inline void set_m_FunctionName_1(String_t* value)
{
___m_FunctionName_1 = value;
Il2CppCodeGenWriteBarrier((void**)(&___m_FunctionName_1), (void*)value);
}
inline static int32_t get_offset_of_m_StringParameter_2() { return static_cast<int32_t>(offsetof(AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF, ___m_StringParameter_2)); }
inline String_t* get_m_StringParameter_2() const { return ___m_StringParameter_2; }
inline String_t** get_address_of_m_StringParameter_2() { return &___m_StringParameter_2; }
inline void set_m_StringParameter_2(String_t* value)
{
___m_StringParameter_2 = value;
Il2CppCodeGenWriteBarrier((void**)(&___m_StringParameter_2), (void*)value);
}
inline static int32_t get_offset_of_m_ObjectReferenceParameter_3() { return static_cast<int32_t>(offsetof(AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF, ___m_ObjectReferenceParameter_3)); }
inline Object_tF2F3778131EFF286AF62B7B013A170F95A91571A * get_m_ObjectReferenceParameter_3() const { return ___m_ObjectReferenceParameter_3; }
inline Object_tF2F3778131EFF286AF62B7B013A170F95A91571A ** get_address_of_m_ObjectReferenceParameter_3() { return &___m_ObjectReferenceParameter_3; }
inline void set_m_ObjectReferenceParameter_3(Object_tF2F3778131EFF286AF62B7B013A170F95A91571A * value)
{
___m_ObjectReferenceParameter_3 = value;
Il2CppCodeGenWriteBarrier((void**)(&___m_ObjectReferenceParameter_3), (void*)value);
}
inline static int32_t get_offset_of_m_FloatParameter_4() { return static_cast<int32_t>(offsetof(AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF, ___m_FloatParameter_4)); }
inline float get_m_FloatParameter_4() const { return ___m_FloatParameter_4; }
inline float* get_address_of_m_FloatParameter_4() { return &___m_FloatParameter_4; }
inline void set_m_FloatParameter_4(float value)
{
___m_FloatParameter_4 = value;
}
inline static int32_t get_offset_of_m_IntParameter_5() { return static_cast<int32_t>(offsetof(AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF, ___m_IntParameter_5)); }
inline int32_t get_m_IntParameter_5() const { return ___m_IntParameter_5; }
inline int32_t* get_address_of_m_IntParameter_5() { return &___m_IntParameter_5; }
inline void set_m_IntParameter_5(int32_t value)
{
___m_IntParameter_5 = value;
}
inline static int32_t get_offset_of_m_MessageOptions_6() { return static_cast<int32_t>(offsetof(AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF, ___m_MessageOptions_6)); }
inline int32_t get_m_MessageOptions_6() const { return ___m_MessageOptions_6; }
inline int32_t* get_address_of_m_MessageOptions_6() { return &___m_MessageOptions_6; }
inline void set_m_MessageOptions_6(int32_t value)
{
___m_MessageOptions_6 = value;
}
inline static int32_t get_offset_of_m_Source_7() { return static_cast<int32_t>(offsetof(AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF, ___m_Source_7)); }
inline int32_t get_m_Source_7() const { return ___m_Source_7; }
inline int32_t* get_address_of_m_Source_7() { return &___m_Source_7; }
inline void set_m_Source_7(int32_t value)
{
___m_Source_7 = value;
}
inline static int32_t get_offset_of_m_StateSender_8() { return static_cast<int32_t>(offsetof(AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF, ___m_StateSender_8)); }
inline AnimationState_tDB7088046A65ABCEC66B45147693CA0AD803A3AD * get_m_StateSender_8() const { return ___m_StateSender_8; }
inline AnimationState_tDB7088046A65ABCEC66B45147693CA0AD803A3AD ** get_address_of_m_StateSender_8() { return &___m_StateSender_8; }
inline void set_m_StateSender_8(AnimationState_tDB7088046A65ABCEC66B45147693CA0AD803A3AD * value)
{
___m_StateSender_8 = value;
Il2CppCodeGenWriteBarrier((void**)(&___m_StateSender_8), (void*)value);
}
inline static int32_t get_offset_of_m_AnimatorStateInfo_9() { return static_cast<int32_t>(offsetof(AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF, ___m_AnimatorStateInfo_9)); }
inline AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA get_m_AnimatorStateInfo_9() const { return ___m_AnimatorStateInfo_9; }
inline AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA * get_address_of_m_AnimatorStateInfo_9() { return &___m_AnimatorStateInfo_9; }
inline void set_m_AnimatorStateInfo_9(AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA value)
{
___m_AnimatorStateInfo_9 = value;
}
inline static int32_t get_offset_of_m_AnimatorClipInfo_10() { return static_cast<int32_t>(offsetof(AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF, ___m_AnimatorClipInfo_10)); }
inline AnimatorClipInfo_t758011D6F2B4C04893FCD364DAA936C801FBC610 get_m_AnimatorClipInfo_10() const { return ___m_AnimatorClipInfo_10; }
inline AnimatorClipInfo_t758011D6F2B4C04893FCD364DAA936C801FBC610 * get_address_of_m_AnimatorClipInfo_10() { return &___m_AnimatorClipInfo_10; }
inline void set_m_AnimatorClipInfo_10(AnimatorClipInfo_t758011D6F2B4C04893FCD364DAA936C801FBC610 value)
{
___m_AnimatorClipInfo_10 = value;
}
};
// Native definition for P/Invoke marshalling of UnityEngine.AnimationEvent
struct AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF_marshaled_pinvoke
{
float ___m_Time_0;
char* ___m_FunctionName_1;
char* ___m_StringParameter_2;
Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshaled_pinvoke ___m_ObjectReferenceParameter_3;
float ___m_FloatParameter_4;
int32_t ___m_IntParameter_5;
int32_t ___m_MessageOptions_6;
int32_t ___m_Source_7;
AnimationState_tDB7088046A65ABCEC66B45147693CA0AD803A3AD * ___m_StateSender_8;
AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA ___m_AnimatorStateInfo_9;
AnimatorClipInfo_t758011D6F2B4C04893FCD364DAA936C801FBC610 ___m_AnimatorClipInfo_10;
};
// Native definition for COM marshalling of UnityEngine.AnimationEvent
struct AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF_marshaled_com
{
float ___m_Time_0;
Il2CppChar* ___m_FunctionName_1;
Il2CppChar* ___m_StringParameter_2;
Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshaled_com* ___m_ObjectReferenceParameter_3;
float ___m_FloatParameter_4;
int32_t ___m_IntParameter_5;
int32_t ___m_MessageOptions_6;
int32_t ___m_Source_7;
AnimationState_tDB7088046A65ABCEC66B45147693CA0AD803A3AD * ___m_StateSender_8;
AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA ___m_AnimatorStateInfo_9;
AnimatorClipInfo_t758011D6F2B4C04893FCD364DAA936C801FBC610 ___m_AnimatorClipInfo_10;
};
// UnityEngine.AnimationState
struct AnimationState_tDB7088046A65ABCEC66B45147693CA0AD803A3AD : public TrackedReference_t17AA313389C655DCF279F96A2D85332B29596514
{
public:
public:
};
// UnityEngine.Animations.AnimationClipPlayable
struct AnimationClipPlayable_t6386488B0C0300A21A352B4C17B9E6D5D38DF953
{
public:
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationClipPlayable::m_Handle
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___m_Handle_0;
public:
inline static int32_t get_offset_of_m_Handle_0() { return static_cast<int32_t>(offsetof(AnimationClipPlayable_t6386488B0C0300A21A352B4C17B9E6D5D38DF953, ___m_Handle_0)); }
inline PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A get_m_Handle_0() const { return ___m_Handle_0; }
inline PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * get_address_of_m_Handle_0() { return &___m_Handle_0; }
inline void set_m_Handle_0(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A value)
{
___m_Handle_0 = value;
}
};
// UnityEngine.Animations.AnimationLayerMixerPlayable
struct AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880
{
public:
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationLayerMixerPlayable::m_Handle
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___m_Handle_0;
public:
inline static int32_t get_offset_of_m_Handle_0() { return static_cast<int32_t>(offsetof(AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880, ___m_Handle_0)); }
inline PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A get_m_Handle_0() const { return ___m_Handle_0; }
inline PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * get_address_of_m_Handle_0() { return &___m_Handle_0; }
inline void set_m_Handle_0(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A value)
{
___m_Handle_0 = value;
}
};
struct AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880_StaticFields
{
public:
// UnityEngine.Animations.AnimationLayerMixerPlayable UnityEngine.Animations.AnimationLayerMixerPlayable::m_NullPlayable
AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880 ___m_NullPlayable_1;
public:
inline static int32_t get_offset_of_m_NullPlayable_1() { return static_cast<int32_t>(offsetof(AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880_StaticFields, ___m_NullPlayable_1)); }
inline AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880 get_m_NullPlayable_1() const { return ___m_NullPlayable_1; }
inline AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880 * get_address_of_m_NullPlayable_1() { return &___m_NullPlayable_1; }
inline void set_m_NullPlayable_1(AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880 value)
{
___m_NullPlayable_1 = value;
}
};
// UnityEngine.Animations.AnimationMixerPlayable
struct AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741
{
public:
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationMixerPlayable::m_Handle
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___m_Handle_0;
public:
inline static int32_t get_offset_of_m_Handle_0() { return static_cast<int32_t>(offsetof(AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741, ___m_Handle_0)); }
inline PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A get_m_Handle_0() const { return ___m_Handle_0; }
inline PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * get_address_of_m_Handle_0() { return &___m_Handle_0; }
inline void set_m_Handle_0(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A value)
{
___m_Handle_0 = value;
}
};
struct AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741_StaticFields
{
public:
// UnityEngine.Animations.AnimationMixerPlayable UnityEngine.Animations.AnimationMixerPlayable::m_NullPlayable
AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741 ___m_NullPlayable_1;
public:
inline static int32_t get_offset_of_m_NullPlayable_1() { return static_cast<int32_t>(offsetof(AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741_StaticFields, ___m_NullPlayable_1)); }
inline AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741 get_m_NullPlayable_1() const { return ___m_NullPlayable_1; }
inline AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741 * get_address_of_m_NullPlayable_1() { return &___m_NullPlayable_1; }
inline void set_m_NullPlayable_1(AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741 value)
{
___m_NullPlayable_1 = value;
}
};
// UnityEngine.Animations.AnimationMotionXToDeltaPlayable
struct AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076
{
public:
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationMotionXToDeltaPlayable::m_Handle
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___m_Handle_0;
public:
inline static int32_t get_offset_of_m_Handle_0() { return static_cast<int32_t>(offsetof(AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076, ___m_Handle_0)); }
inline PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A get_m_Handle_0() const { return ___m_Handle_0; }
inline PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * get_address_of_m_Handle_0() { return &___m_Handle_0; }
inline void set_m_Handle_0(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A value)
{
___m_Handle_0 = value;
}
};
struct AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076_StaticFields
{
public:
// UnityEngine.Animations.AnimationMotionXToDeltaPlayable UnityEngine.Animations.AnimationMotionXToDeltaPlayable::m_NullPlayable
AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076 ___m_NullPlayable_1;
public:
inline static int32_t get_offset_of_m_NullPlayable_1() { return static_cast<int32_t>(offsetof(AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076_StaticFields, ___m_NullPlayable_1)); }
inline AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076 get_m_NullPlayable_1() const { return ___m_NullPlayable_1; }
inline AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076 * get_address_of_m_NullPlayable_1() { return &___m_NullPlayable_1; }
inline void set_m_NullPlayable_1(AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076 value)
{
___m_NullPlayable_1 = value;
}
};
// UnityEngine.Animations.AnimationOffsetPlayable
struct AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941
{
public:
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationOffsetPlayable::m_Handle
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___m_Handle_0;
public:
inline static int32_t get_offset_of_m_Handle_0() { return static_cast<int32_t>(offsetof(AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941, ___m_Handle_0)); }
inline PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A get_m_Handle_0() const { return ___m_Handle_0; }
inline PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * get_address_of_m_Handle_0() { return &___m_Handle_0; }
inline void set_m_Handle_0(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A value)
{
___m_Handle_0 = value;
}
};
struct AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941_StaticFields
{
public:
// UnityEngine.Animations.AnimationOffsetPlayable UnityEngine.Animations.AnimationOffsetPlayable::m_NullPlayable
AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941 ___m_NullPlayable_1;
public:
inline static int32_t get_offset_of_m_NullPlayable_1() { return static_cast<int32_t>(offsetof(AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941_StaticFields, ___m_NullPlayable_1)); }
inline AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941 get_m_NullPlayable_1() const { return ___m_NullPlayable_1; }
inline AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941 * get_address_of_m_NullPlayable_1() { return &___m_NullPlayable_1; }
inline void set_m_NullPlayable_1(AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941 value)
{
___m_NullPlayable_1 = value;
}
};
// UnityEngine.Animations.AnimationPlayableOutput
struct AnimationPlayableOutput_t14570F3E63619E52ABB0B0306D4F4AAA6225DE17
{
public:
// UnityEngine.Playables.PlayableOutputHandle UnityEngine.Animations.AnimationPlayableOutput::m_Handle
PlayableOutputHandle_t8C84BCDB2AECFEDBCF0E7CC7CDBADD517D148CD1 ___m_Handle_0;
public:
inline static int32_t get_offset_of_m_Handle_0() { return static_cast<int32_t>(offsetof(AnimationPlayableOutput_t14570F3E63619E52ABB0B0306D4F4AAA6225DE17, ___m_Handle_0)); }
inline PlayableOutputHandle_t8C84BCDB2AECFEDBCF0E7CC7CDBADD517D148CD1 get_m_Handle_0() const { return ___m_Handle_0; }
inline PlayableOutputHandle_t8C84BCDB2AECFEDBCF0E7CC7CDBADD517D148CD1 * get_address_of_m_Handle_0() { return &___m_Handle_0; }
inline void set_m_Handle_0(PlayableOutputHandle_t8C84BCDB2AECFEDBCF0E7CC7CDBADD517D148CD1 value)
{
___m_Handle_0 = value;
}
};
// UnityEngine.Animations.AnimationPosePlayable
struct AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9
{
public:
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationPosePlayable::m_Handle
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___m_Handle_0;
public:
inline static int32_t get_offset_of_m_Handle_0() { return static_cast<int32_t>(offsetof(AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9, ___m_Handle_0)); }
inline PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A get_m_Handle_0() const { return ___m_Handle_0; }
inline PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * get_address_of_m_Handle_0() { return &___m_Handle_0; }
inline void set_m_Handle_0(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A value)
{
___m_Handle_0 = value;
}
};
struct AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9_StaticFields
{
public:
// UnityEngine.Animations.AnimationPosePlayable UnityEngine.Animations.AnimationPosePlayable::m_NullPlayable
AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9 ___m_NullPlayable_1;
public:
inline static int32_t get_offset_of_m_NullPlayable_1() { return static_cast<int32_t>(offsetof(AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9_StaticFields, ___m_NullPlayable_1)); }
inline AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9 get_m_NullPlayable_1() const { return ___m_NullPlayable_1; }
inline AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9 * get_address_of_m_NullPlayable_1() { return &___m_NullPlayable_1; }
inline void set_m_NullPlayable_1(AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9 value)
{
___m_NullPlayable_1 = value;
}
};
// UnityEngine.Animations.AnimationRemoveScalePlayable
struct AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429
{
public:
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationRemoveScalePlayable::m_Handle
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___m_Handle_0;
public:
inline static int32_t get_offset_of_m_Handle_0() { return static_cast<int32_t>(offsetof(AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429, ___m_Handle_0)); }
inline PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A get_m_Handle_0() const { return ___m_Handle_0; }
inline PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * get_address_of_m_Handle_0() { return &___m_Handle_0; }
inline void set_m_Handle_0(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A value)
{
___m_Handle_0 = value;
}
};
struct AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429_StaticFields
{
public:
// UnityEngine.Animations.AnimationRemoveScalePlayable UnityEngine.Animations.AnimationRemoveScalePlayable::m_NullPlayable
AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429 ___m_NullPlayable_1;
public:
inline static int32_t get_offset_of_m_NullPlayable_1() { return static_cast<int32_t>(offsetof(AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429_StaticFields, ___m_NullPlayable_1)); }
inline AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429 get_m_NullPlayable_1() const { return ___m_NullPlayable_1; }
inline AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429 * get_address_of_m_NullPlayable_1() { return &___m_NullPlayable_1; }
inline void set_m_NullPlayable_1(AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429 value)
{
___m_NullPlayable_1 = value;
}
};
// UnityEngine.Animations.AnimationScriptPlayable
struct AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B
{
public:
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationScriptPlayable::m_Handle
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___m_Handle_0;
public:
inline static int32_t get_offset_of_m_Handle_0() { return static_cast<int32_t>(offsetof(AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B, ___m_Handle_0)); }
inline PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A get_m_Handle_0() const { return ___m_Handle_0; }
inline PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * get_address_of_m_Handle_0() { return &___m_Handle_0; }
inline void set_m_Handle_0(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A value)
{
___m_Handle_0 = value;
}
};
struct AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B_StaticFields
{
public:
// UnityEngine.Animations.AnimationScriptPlayable UnityEngine.Animations.AnimationScriptPlayable::m_NullPlayable
AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B ___m_NullPlayable_1;
public:
inline static int32_t get_offset_of_m_NullPlayable_1() { return static_cast<int32_t>(offsetof(AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B_StaticFields, ___m_NullPlayable_1)); }
inline AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B get_m_NullPlayable_1() const { return ___m_NullPlayable_1; }
inline AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B * get_address_of_m_NullPlayable_1() { return &___m_NullPlayable_1; }
inline void set_m_NullPlayable_1(AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B value)
{
___m_NullPlayable_1 = value;
}
};
// UnityEngine.Animations.AnimatorControllerPlayable
struct AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4
{
public:
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimatorControllerPlayable::m_Handle
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___m_Handle_0;
public:
inline static int32_t get_offset_of_m_Handle_0() { return static_cast<int32_t>(offsetof(AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4, ___m_Handle_0)); }
inline PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A get_m_Handle_0() const { return ___m_Handle_0; }
inline PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * get_address_of_m_Handle_0() { return &___m_Handle_0; }
inline void set_m_Handle_0(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A value)
{
___m_Handle_0 = value;
}
};
struct AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4_StaticFields
{
public:
// UnityEngine.Animations.AnimatorControllerPlayable UnityEngine.Animations.AnimatorControllerPlayable::m_NullPlayable
AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 ___m_NullPlayable_1;
public:
inline static int32_t get_offset_of_m_NullPlayable_1() { return static_cast<int32_t>(offsetof(AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4_StaticFields, ___m_NullPlayable_1)); }
inline AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 get_m_NullPlayable_1() const { return ___m_NullPlayable_1; }
inline AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 * get_address_of_m_NullPlayable_1() { return &___m_NullPlayable_1; }
inline void set_m_NullPlayable_1(AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 value)
{
___m_NullPlayable_1 = value;
}
};
// UnityEngine.Component
struct Component_t62FBC8D2420DA4BE9037AFE430740F6B3EECA684 : public Object_tF2F3778131EFF286AF62B7B013A170F95A91571A
{
public:
public:
};
// UnityEngine.HumanBone
struct HumanBone_tFEE7CD9B6E62BBB95CC4A6F1AA7FC7A26541D62D
{
public:
// System.String UnityEngine.HumanBone::m_BoneName
String_t* ___m_BoneName_0;
// System.String UnityEngine.HumanBone::m_HumanName
String_t* ___m_HumanName_1;
// UnityEngine.HumanLimit UnityEngine.HumanBone::limit
HumanLimit_t8F488DD21062BE1259B0F4C77E4EB24FB931E8D8 ___limit_2;
public:
inline static int32_t get_offset_of_m_BoneName_0() { return static_cast<int32_t>(offsetof(HumanBone_tFEE7CD9B6E62BBB95CC4A6F1AA7FC7A26541D62D, ___m_BoneName_0)); }
inline String_t* get_m_BoneName_0() const { return ___m_BoneName_0; }
inline String_t** get_address_of_m_BoneName_0() { return &___m_BoneName_0; }
inline void set_m_BoneName_0(String_t* value)
{
___m_BoneName_0 = value;
Il2CppCodeGenWriteBarrier((void**)(&___m_BoneName_0), (void*)value);
}
inline static int32_t get_offset_of_m_HumanName_1() { return static_cast<int32_t>(offsetof(HumanBone_tFEE7CD9B6E62BBB95CC4A6F1AA7FC7A26541D62D, ___m_HumanName_1)); }
inline String_t* get_m_HumanName_1() const { return ___m_HumanName_1; }
inline String_t** get_address_of_m_HumanName_1() { return &___m_HumanName_1; }
inline void set_m_HumanName_1(String_t* value)
{
___m_HumanName_1 = value;
Il2CppCodeGenWriteBarrier((void**)(&___m_HumanName_1), (void*)value);
}
inline static int32_t get_offset_of_limit_2() { return static_cast<int32_t>(offsetof(HumanBone_tFEE7CD9B6E62BBB95CC4A6F1AA7FC7A26541D62D, ___limit_2)); }
inline HumanLimit_t8F488DD21062BE1259B0F4C77E4EB24FB931E8D8 get_limit_2() const { return ___limit_2; }
inline HumanLimit_t8F488DD21062BE1259B0F4C77E4EB24FB931E8D8 * get_address_of_limit_2() { return &___limit_2; }
inline void set_limit_2(HumanLimit_t8F488DD21062BE1259B0F4C77E4EB24FB931E8D8 value)
{
___limit_2 = value;
}
};
// Native definition for P/Invoke marshalling of UnityEngine.HumanBone
struct HumanBone_tFEE7CD9B6E62BBB95CC4A6F1AA7FC7A26541D62D_marshaled_pinvoke
{
char* ___m_BoneName_0;
char* ___m_HumanName_1;
HumanLimit_t8F488DD21062BE1259B0F4C77E4EB24FB931E8D8 ___limit_2;
};
// Native definition for COM marshalling of UnityEngine.HumanBone
struct HumanBone_tFEE7CD9B6E62BBB95CC4A6F1AA7FC7A26541D62D_marshaled_com
{
Il2CppChar* ___m_BoneName_0;
Il2CppChar* ___m_HumanName_1;
HumanLimit_t8F488DD21062BE1259B0F4C77E4EB24FB931E8D8 ___limit_2;
};
// UnityEngine.Motion
struct Motion_t3EAEF01D52B05F10A21CC9B54A35C8F3F6BA3A67 : public Object_tF2F3778131EFF286AF62B7B013A170F95A91571A
{
public:
public:
};
// UnityEngine.RuntimeAnimatorController
struct RuntimeAnimatorController_t6F70D5BE51CCBA99132F444EFFA41439DFE71BAB : public Object_tF2F3778131EFF286AF62B7B013A170F95A91571A
{
public:
public:
};
// UnityEngine.ScriptableObject
struct ScriptableObject_t4361E08CEBF052C650D3666C7CEC37EB31DE116A : public Object_tF2F3778131EFF286AF62B7B013A170F95A91571A
{
public:
public:
};
// Native definition for P/Invoke marshalling of UnityEngine.ScriptableObject
struct ScriptableObject_t4361E08CEBF052C650D3666C7CEC37EB31DE116A_marshaled_pinvoke : public Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshaled_pinvoke
{
};
// Native definition for COM marshalling of UnityEngine.ScriptableObject
struct ScriptableObject_t4361E08CEBF052C650D3666C7CEC37EB31DE116A_marshaled_com : public Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshaled_com
{
};
// System.AsyncCallback
struct AsyncCallback_tA7921BEF974919C46FF8F9D9867C567B200BB0EA : public MulticastDelegate_t
{
public:
public:
};
// System.InvalidCastException
struct InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463 : public SystemException_tC551B4D6EE3772B5F32C71EE8C719F4B43ECCC62
{
public:
public:
};
// System.InvalidOperationException
struct InvalidOperationException_t10D3EE59AD28EC641ACEE05BCA4271A527E5ECAB : public SystemException_tC551B4D6EE3772B5F32C71EE8C719F4B43ECCC62
{
public:
public:
};
// UnityEngine.AnimationClip
struct AnimationClip_tD9BFD73D43793BA608D5C0B46BE29EB59E40D178 : public Motion_t3EAEF01D52B05F10A21CC9B54A35C8F3F6BA3A67
{
public:
public:
};
// UnityEngine.AnimatorOverrideController
struct AnimatorOverrideController_t4630AA9761965F735AEB26B9A92D210D6338B2DA : public RuntimeAnimatorController_t6F70D5BE51CCBA99132F444EFFA41439DFE71BAB
{
public:
// UnityEngine.AnimatorOverrideController_OnOverrideControllerDirtyCallback UnityEngine.AnimatorOverrideController::OnOverrideControllerDirty
OnOverrideControllerDirtyCallback_t9E38572D7CF06EEFF943EA68082DAC68AB40476C * ___OnOverrideControllerDirty_4;
public:
inline static int32_t get_offset_of_OnOverrideControllerDirty_4() { return static_cast<int32_t>(offsetof(AnimatorOverrideController_t4630AA9761965F735AEB26B9A92D210D6338B2DA, ___OnOverrideControllerDirty_4)); }
inline OnOverrideControllerDirtyCallback_t9E38572D7CF06EEFF943EA68082DAC68AB40476C * get_OnOverrideControllerDirty_4() const { return ___OnOverrideControllerDirty_4; }
inline OnOverrideControllerDirtyCallback_t9E38572D7CF06EEFF943EA68082DAC68AB40476C ** get_address_of_OnOverrideControllerDirty_4() { return &___OnOverrideControllerDirty_4; }
inline void set_OnOverrideControllerDirty_4(OnOverrideControllerDirtyCallback_t9E38572D7CF06EEFF943EA68082DAC68AB40476C * value)
{
___OnOverrideControllerDirty_4 = value;
Il2CppCodeGenWriteBarrier((void**)(&___OnOverrideControllerDirty_4), (void*)value);
}
};
// UnityEngine.AnimatorOverrideController_OnOverrideControllerDirtyCallback
struct OnOverrideControllerDirtyCallback_t9E38572D7CF06EEFF943EA68082DAC68AB40476C : public MulticastDelegate_t
{
public:
public:
};
// UnityEngine.Behaviour
struct Behaviour_t1A3DDDCF73B4627928FBFE02ED52B7251777DBD9 : public Component_t62FBC8D2420DA4BE9037AFE430740F6B3EECA684
{
public:
public:
};
// UnityEngine.StateMachineBehaviour
struct StateMachineBehaviour_tBEDE439261DEB4C7334646339BC6F1E7958F095F : public ScriptableObject_t4361E08CEBF052C650D3666C7CEC37EB31DE116A
{
public:
public:
};
// UnityEngine.Animator
struct Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 : public Behaviour_t1A3DDDCF73B4627928FBFE02ED52B7251777DBD9
{
public:
public:
};
#ifdef __clang__
#pragma clang diagnostic pop
#endif
// System.Delegate[]
struct DelegateU5BU5D_t677D8FE08A5F99E8EE49150B73966CD6E9BF7DB8 : public RuntimeArray
{
public:
ALIGN_FIELD (8) Delegate_t * m_Items[1];
public:
inline Delegate_t * GetAt(il2cpp_array_size_t index) const
{
IL2CPP_ARRAY_BOUNDS_CHECK(index, (uint32_t)(this)->max_length);
return m_Items[index];
}
inline Delegate_t ** GetAddressAt(il2cpp_array_size_t index)
{
IL2CPP_ARRAY_BOUNDS_CHECK(index, (uint32_t)(this)->max_length);
return m_Items + index;
}
inline void SetAt(il2cpp_array_size_t index, Delegate_t * value)
{
IL2CPP_ARRAY_BOUNDS_CHECK(index, (uint32_t)(this)->max_length);
m_Items[index] = value;
Il2CppCodeGenWriteBarrier((void**)m_Items + index, (void*)value);
}
inline Delegate_t * GetAtUnchecked(il2cpp_array_size_t index) const
{
return m_Items[index];
}
inline Delegate_t ** GetAddressAtUnchecked(il2cpp_array_size_t index)
{
return m_Items + index;
}
inline void SetAtUnchecked(il2cpp_array_size_t index, Delegate_t * value)
{
m_Items[index] = value;
Il2CppCodeGenWriteBarrier((void**)m_Items + index, (void*)value);
}
};
IL2CPP_EXTERN_C void Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshal_pinvoke(const Object_tF2F3778131EFF286AF62B7B013A170F95A91571A& unmarshaled, Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshaled_pinvoke& marshaled);
IL2CPP_EXTERN_C void Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshal_pinvoke_back(const Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshaled_pinvoke& marshaled, Object_tF2F3778131EFF286AF62B7B013A170F95A91571A& unmarshaled);
IL2CPP_EXTERN_C void Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshal_pinvoke_cleanup(Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshaled_pinvoke& marshaled);
IL2CPP_EXTERN_C void Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshal_com(const Object_tF2F3778131EFF286AF62B7B013A170F95A91571A& unmarshaled, Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshaled_com& marshaled);
IL2CPP_EXTERN_C void Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshal_com_back(const Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshaled_com& marshaled, Object_tF2F3778131EFF286AF62B7B013A170F95A91571A& unmarshaled);
IL2CPP_EXTERN_C void Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshal_com_cleanup(Object_tF2F3778131EFF286AF62B7B013A170F95A91571A_marshaled_com& marshaled);
// System.Boolean UnityEngine.Playables.PlayableHandle::IsPlayableOfType<UnityEngine.Animations.AnimationLayerMixerPlayable>()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool PlayableHandle_IsPlayableOfType_TisAnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880_m866298E26CA43C28F7948D46E99D65FAA09722C5_gshared (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * __this, const RuntimeMethod* method);
// System.Boolean UnityEngine.Playables.PlayableHandle::IsPlayableOfType<UnityEngine.Animations.AnimationMixerPlayable>()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool PlayableHandle_IsPlayableOfType_TisAnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741_m30062CF184CC05FFAA026881BEFE337C13B7E70E_gshared (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * __this, const RuntimeMethod* method);
// System.Boolean UnityEngine.Playables.PlayableHandle::IsPlayableOfType<UnityEngine.Animations.AnimationMotionXToDeltaPlayable>()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool PlayableHandle_IsPlayableOfType_TisAnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076_m19943D18384297A3129F799C12E91B0D8162A02F_gshared (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * __this, const RuntimeMethod* method);
// System.Boolean UnityEngine.Playables.PlayableHandle::IsPlayableOfType<UnityEngine.Animations.AnimationOffsetPlayable>()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool PlayableHandle_IsPlayableOfType_TisAnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941_m1B2FA89CE8F4A1EBD1AE3FF4E7154CFE120EDF85_gshared (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * __this, const RuntimeMethod* method);
// System.Boolean UnityEngine.Playables.PlayableHandle::IsPlayableOfType<UnityEngine.Animations.AnimationPosePlayable>()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool PlayableHandle_IsPlayableOfType_TisAnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9_m171336A5BD550FD80BFD4B2BDF5903DF72C0E1C2_gshared (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * __this, const RuntimeMethod* method);
// System.Boolean UnityEngine.Playables.PlayableHandle::IsPlayableOfType<UnityEngine.Animations.AnimationRemoveScalePlayable>()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool PlayableHandle_IsPlayableOfType_TisAnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429_mEF5219AC94275FE2811CEDC16FE0B850DBA7E9BE_gshared (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * __this, const RuntimeMethod* method);
// System.Boolean UnityEngine.Playables.PlayableHandle::IsPlayableOfType<UnityEngine.Animations.AnimationScriptPlayable>()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool PlayableHandle_IsPlayableOfType_TisAnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B_m529F82044C8D4F4B60EA35E96D1C0592644AD76B_gshared (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * __this, const RuntimeMethod* method);
// System.Boolean UnityEngine.Playables.PlayableHandle::IsPlayableOfType<UnityEngine.Animations.AnimatorControllerPlayable>()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool PlayableHandle_IsPlayableOfType_TisAnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4_mFB1F4B388070EC30EC8DA09EB2869306EE60F2B8_gshared (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * __this, const RuntimeMethod* method);
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationClipPlayable::GetHandle()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationClipPlayable_GetHandle_m93C27911A3C7107750C2A6BE529C58FB2FDB1122 (AnimationClipPlayable_t6386488B0C0300A21A352B4C17B9E6D5D38DF953 * __this, const RuntimeMethod* method);
// System.Boolean UnityEngine.Playables.PlayableHandle::op_Equality(UnityEngine.Playables.PlayableHandle,UnityEngine.Playables.PlayableHandle)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool PlayableHandle_op_Equality_mFD26CFA8ECF2B622B1A3D4117066CAE965C9F704 (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___x0, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___y1, const RuntimeMethod* method);
// System.Boolean UnityEngine.Animations.AnimationClipPlayable::Equals(UnityEngine.Animations.AnimationClipPlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool AnimationClipPlayable_Equals_m73BDBE0839B6AA4782C37B21DD58D3388B5EC814 (AnimationClipPlayable_t6386488B0C0300A21A352B4C17B9E6D5D38DF953 * __this, AnimationClipPlayable_t6386488B0C0300A21A352B4C17B9E6D5D38DF953 ___other0, const RuntimeMethod* method);
// System.Void System.Object::.ctor()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void Object__ctor_m88880E0413421D13FD95325EDCE231707CE1F405 (RuntimeObject * __this, const RuntimeMethod* method);
// System.Boolean UnityEngine.Playables.PlayableHandle::IsValid()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool PlayableHandle_IsValid_m237A5E7818768641BAC928BD08EC0AB439E3DAF6 (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * __this, const RuntimeMethod* method);
// System.Boolean UnityEngine.Playables.PlayableHandle::IsPlayableOfType<UnityEngine.Animations.AnimationLayerMixerPlayable>()
inline bool PlayableHandle_IsPlayableOfType_TisAnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880_m866298E26CA43C28F7948D46E99D65FAA09722C5 (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * __this, const RuntimeMethod* method)
{
return (( bool (*) (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *, const RuntimeMethod*))PlayableHandle_IsPlayableOfType_TisAnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880_m866298E26CA43C28F7948D46E99D65FAA09722C5_gshared)(__this, method);
}
// System.Void System.InvalidCastException::.ctor(System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void InvalidCastException__ctor_m50103CBF0C211B93BF46697875413A10B5A5C5A3 (InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463 * __this, String_t* ___message0, const RuntimeMethod* method);
// System.Void UnityEngine.Animations.AnimationLayerMixerPlayable::.ctor(UnityEngine.Playables.PlayableHandle)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimationLayerMixerPlayable__ctor_m42F8E5BB37A175AF298324D3072932ED9946427B (AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880 * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method);
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationLayerMixerPlayable::GetHandle()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationLayerMixerPlayable_GetHandle_mBFA950F140D76E10983B9AB946397F4C12ABC439 (AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880 * __this, const RuntimeMethod* method);
// System.Boolean UnityEngine.Animations.AnimationLayerMixerPlayable::Equals(UnityEngine.Animations.AnimationLayerMixerPlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool AnimationLayerMixerPlayable_Equals_m018BD27B24B3EDC5101A475A14F13F753F2323AA (AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880 * __this, AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880 ___other0, const RuntimeMethod* method);
// UnityEngine.Playables.PlayableHandle UnityEngine.Playables.PlayableHandle::get_Null()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A PlayableHandle_get_Null_mD1C6FC2D7F6A7A23955ACDD87BE934B75463E612 (const RuntimeMethod* method);
// System.Boolean UnityEngine.Playables.PlayableHandle::IsPlayableOfType<UnityEngine.Animations.AnimationMixerPlayable>()
inline bool PlayableHandle_IsPlayableOfType_TisAnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741_m30062CF184CC05FFAA026881BEFE337C13B7E70E (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * __this, const RuntimeMethod* method)
{
return (( bool (*) (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *, const RuntimeMethod*))PlayableHandle_IsPlayableOfType_TisAnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741_m30062CF184CC05FFAA026881BEFE337C13B7E70E_gshared)(__this, method);
}
// System.Void UnityEngine.Animations.AnimationMixerPlayable::.ctor(UnityEngine.Playables.PlayableHandle)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimationMixerPlayable__ctor_mA03CF37709B7854227E25F91BE4F7559981058B0 (AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741 * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method);
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationMixerPlayable::GetHandle()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationMixerPlayable_GetHandle_mE8F7D1A18F1BD1C00BA1EC6AA8036044E8907FC3 (AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741 * __this, const RuntimeMethod* method);
// System.Boolean UnityEngine.Animations.AnimationMixerPlayable::Equals(UnityEngine.Animations.AnimationMixerPlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool AnimationMixerPlayable_Equals_m8979D90ED92FF553B5D6AB0BDD616C544352816B (AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741 * __this, AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741 ___other0, const RuntimeMethod* method);
// System.Boolean UnityEngine.Playables.PlayableHandle::IsPlayableOfType<UnityEngine.Animations.AnimationMotionXToDeltaPlayable>()
inline bool PlayableHandle_IsPlayableOfType_TisAnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076_m19943D18384297A3129F799C12E91B0D8162A02F (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * __this, const RuntimeMethod* method)
{
return (( bool (*) (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *, const RuntimeMethod*))PlayableHandle_IsPlayableOfType_TisAnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076_m19943D18384297A3129F799C12E91B0D8162A02F_gshared)(__this, method);
}
// System.Void UnityEngine.Animations.AnimationMotionXToDeltaPlayable::.ctor(UnityEngine.Playables.PlayableHandle)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimationMotionXToDeltaPlayable__ctor_m11668860161B62484EA095BD6360AFD26A86DE93 (AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076 * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method);
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationMotionXToDeltaPlayable::GetHandle()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationMotionXToDeltaPlayable_GetHandle_m840D19A4E2DFB4BF2397061B833E63AD786587BA (AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076 * __this, const RuntimeMethod* method);
// System.Boolean UnityEngine.Animations.AnimationMotionXToDeltaPlayable::Equals(UnityEngine.Animations.AnimationMotionXToDeltaPlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool AnimationMotionXToDeltaPlayable_Equals_mB08A41C628755AF909489716A1D62AECC2BFDD9E (AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076 * __this, AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076 ___other0, const RuntimeMethod* method);
// System.Boolean UnityEngine.Playables.PlayableHandle::IsPlayableOfType<UnityEngine.Animations.AnimationOffsetPlayable>()
inline bool PlayableHandle_IsPlayableOfType_TisAnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941_m1B2FA89CE8F4A1EBD1AE3FF4E7154CFE120EDF85 (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * __this, const RuntimeMethod* method)
{
return (( bool (*) (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *, const RuntimeMethod*))PlayableHandle_IsPlayableOfType_TisAnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941_m1B2FA89CE8F4A1EBD1AE3FF4E7154CFE120EDF85_gshared)(__this, method);
}
// System.Void UnityEngine.Animations.AnimationOffsetPlayable::.ctor(UnityEngine.Playables.PlayableHandle)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimationOffsetPlayable__ctor_m9527E52AEA325EAE188AB9843497F2AB33CB742E (AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941 * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method);
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationOffsetPlayable::GetHandle()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationOffsetPlayable_GetHandle_m8C3C08EC531127B002D3AFAB5AF259D8030B0049 (AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941 * __this, const RuntimeMethod* method);
// System.Boolean UnityEngine.Animations.AnimationOffsetPlayable::Equals(UnityEngine.Animations.AnimationOffsetPlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool AnimationOffsetPlayable_Equals_m9AFE60B035481569924E20C6953B4B21EF7734AA (AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941 * __this, AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941 ___other0, const RuntimeMethod* method);
// System.Boolean UnityEngine.Playables.PlayableHandle::IsPlayableOfType<UnityEngine.Animations.AnimationPosePlayable>()
inline bool PlayableHandle_IsPlayableOfType_TisAnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9_m171336A5BD550FD80BFD4B2BDF5903DF72C0E1C2 (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * __this, const RuntimeMethod* method)
{
return (( bool (*) (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *, const RuntimeMethod*))PlayableHandle_IsPlayableOfType_TisAnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9_m171336A5BD550FD80BFD4B2BDF5903DF72C0E1C2_gshared)(__this, method);
}
// System.Void UnityEngine.Animations.AnimationPosePlayable::.ctor(UnityEngine.Playables.PlayableHandle)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimationPosePlayable__ctor_m318607F120F21EDE3D7C1ED07C8B2ED13A23BF57 (AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9 * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method);
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationPosePlayable::GetHandle()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationPosePlayable_GetHandle_m0354C54EB680FC70D4B48D95F7FC4BA4700A0DCE (AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9 * __this, const RuntimeMethod* method);
// System.Boolean UnityEngine.Animations.AnimationPosePlayable::Equals(UnityEngine.Animations.AnimationPosePlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool AnimationPosePlayable_Equals_mECC5FA256AAA5334C38DBB6D00EE8AC1BDC015A1 (AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9 * __this, AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9 ___other0, const RuntimeMethod* method);
// System.Boolean UnityEngine.Playables.PlayableHandle::IsPlayableOfType<UnityEngine.Animations.AnimationRemoveScalePlayable>()
inline bool PlayableHandle_IsPlayableOfType_TisAnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429_mEF5219AC94275FE2811CEDC16FE0B850DBA7E9BE (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * __this, const RuntimeMethod* method)
{
return (( bool (*) (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *, const RuntimeMethod*))PlayableHandle_IsPlayableOfType_TisAnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429_mEF5219AC94275FE2811CEDC16FE0B850DBA7E9BE_gshared)(__this, method);
}
// System.Void UnityEngine.Animations.AnimationRemoveScalePlayable::.ctor(UnityEngine.Playables.PlayableHandle)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimationRemoveScalePlayable__ctor_m08810C8ECE9A3A100087DD84B13204EC3AF73A8F (AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429 * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method);
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationRemoveScalePlayable::GetHandle()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationRemoveScalePlayable_GetHandle_m1949202B58BDF17726A1ADC934EB5232E835CCA8 (AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429 * __this, const RuntimeMethod* method);
// System.Boolean UnityEngine.Animations.AnimationRemoveScalePlayable::Equals(UnityEngine.Animations.AnimationRemoveScalePlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool AnimationRemoveScalePlayable_Equals_m7FE9E55B027861A0B91347F18DAC7E11E2740397 (AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429 * __this, AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429 ___other0, const RuntimeMethod* method);
// System.Boolean UnityEngine.Playables.PlayableHandle::IsPlayableOfType<UnityEngine.Animations.AnimationScriptPlayable>()
inline bool PlayableHandle_IsPlayableOfType_TisAnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B_m529F82044C8D4F4B60EA35E96D1C0592644AD76B (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * __this, const RuntimeMethod* method)
{
return (( bool (*) (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *, const RuntimeMethod*))PlayableHandle_IsPlayableOfType_TisAnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B_m529F82044C8D4F4B60EA35E96D1C0592644AD76B_gshared)(__this, method);
}
// System.Void UnityEngine.Animations.AnimationScriptPlayable::.ctor(UnityEngine.Playables.PlayableHandle)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimationScriptPlayable__ctor_m0B751F7A7D28F59AADACE7C13704D653E0879C56 (AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method);
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationScriptPlayable::GetHandle()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationScriptPlayable_GetHandle_mCEA7899E7E43FC2C73B3331AE27C289327F03B18 (AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B * __this, const RuntimeMethod* method);
// System.Boolean UnityEngine.Animations.AnimationScriptPlayable::Equals(UnityEngine.Animations.AnimationScriptPlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool AnimationScriptPlayable_Equals_m1705DCC80312E3D34E17B32BDBAF4BBB78D435D8 (AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B * __this, AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B ___other0, const RuntimeMethod* method);
// System.Void UnityEngine.Animator::SetTriggerString(System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void Animator_SetTriggerString_m38F66A49276BCED56B89BB6AF8A36183BE4285F0 (Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 * __this, String_t* ___name0, const RuntimeMethod* method);
// System.Void UnityEngine.Animator::ResetTriggerString(System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void Animator_ResetTriggerString_m6FC21A6B7732A31338EE22E78F3D6220903EDBB2 (Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 * __this, String_t* ___name0, const RuntimeMethod* method);
// System.Void UnityEngine.Animations.AnimatorControllerPlayable::SetHandle(UnityEngine.Playables.PlayableHandle)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimatorControllerPlayable_SetHandle_m19111E2A65EDAB3382AC9BE815503459A495FF38 (AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method);
// System.Void UnityEngine.Animations.AnimatorControllerPlayable::.ctor(UnityEngine.Playables.PlayableHandle)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimatorControllerPlayable__ctor_mBD4E1368EB671F6349C5740B1BF131F97BD12CC8 (AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method);
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimatorControllerPlayable::GetHandle()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimatorControllerPlayable_GetHandle_mBB2911E1B1867ED9C9080BEF16838119A51E0C0C (AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 * __this, const RuntimeMethod* method);
// System.Void System.InvalidOperationException::.ctor(System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void InvalidOperationException__ctor_mC012CE552988309733C896F3FEA8249171E4402E (InvalidOperationException_t10D3EE59AD28EC641ACEE05BCA4271A527E5ECAB * __this, String_t* ___message0, const RuntimeMethod* method);
// System.Boolean UnityEngine.Playables.PlayableHandle::IsPlayableOfType<UnityEngine.Animations.AnimatorControllerPlayable>()
inline bool PlayableHandle_IsPlayableOfType_TisAnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4_mFB1F4B388070EC30EC8DA09EB2869306EE60F2B8 (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * __this, const RuntimeMethod* method)
{
return (( bool (*) (PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *, const RuntimeMethod*))PlayableHandle_IsPlayableOfType_TisAnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4_mFB1F4B388070EC30EC8DA09EB2869306EE60F2B8_gshared)(__this, method);
}
// System.Boolean UnityEngine.Animations.AnimatorControllerPlayable::Equals(UnityEngine.Animations.AnimatorControllerPlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool AnimatorControllerPlayable_Equals_m9D2F918EE07AE657A11C13F285317C05BB257730 (AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 * __this, AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 ___other0, const RuntimeMethod* method);
// System.Void UnityEngine.AnimatorOverrideController/OnOverrideControllerDirtyCallback::Invoke()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void OnOverrideControllerDirtyCallback_Invoke_m21DB79300E852ED93F2521FFC03EC4D858F6B330 (OnOverrideControllerDirtyCallback_t9E38572D7CF06EEFF943EA68082DAC68AB40476C * __this, const RuntimeMethod* method);
// System.Void UnityEngine.ScriptableObject::.ctor()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void ScriptableObject__ctor_m8DAE6CDCFA34E16F2543B02CC3669669FF203063 (ScriptableObject_t4361E08CEBF052C650D3666C7CEC37EB31DE116A * __this, const RuntimeMethod* method);
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationClipPlayable::GetHandle()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationClipPlayable_GetHandle_m93C27911A3C7107750C2A6BE529C58FB2FDB1122 (AnimationClipPlayable_t6386488B0C0300A21A352B4C17B9E6D5D38DF953 * __this, const RuntimeMethod* method)
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A V_0;
memset((&V_0), 0, sizeof(V_0));
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = __this->get_m_Handle_0();
V_0 = L_0;
goto IL_000a;
}
IL_000a:
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_1 = V_0;
return L_1;
}
}
IL2CPP_EXTERN_C PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationClipPlayable_GetHandle_m93C27911A3C7107750C2A6BE529C58FB2FDB1122_AdjustorThunk (RuntimeObject * __this, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationClipPlayable_t6386488B0C0300A21A352B4C17B9E6D5D38DF953 * _thisAdjusted = reinterpret_cast<AnimationClipPlayable_t6386488B0C0300A21A352B4C17B9E6D5D38DF953 *>(__this + _offset);
return AnimationClipPlayable_GetHandle_m93C27911A3C7107750C2A6BE529C58FB2FDB1122(_thisAdjusted, method);
}
// System.Boolean UnityEngine.Animations.AnimationClipPlayable::Equals(UnityEngine.Animations.AnimationClipPlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool AnimationClipPlayable_Equals_m73BDBE0839B6AA4782C37B21DD58D3388B5EC814 (AnimationClipPlayable_t6386488B0C0300A21A352B4C17B9E6D5D38DF953 * __this, AnimationClipPlayable_t6386488B0C0300A21A352B4C17B9E6D5D38DF953 ___other0, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationClipPlayable_Equals_m73BDBE0839B6AA4782C37B21DD58D3388B5EC814_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
bool V_0 = false;
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = AnimationClipPlayable_GetHandle_m93C27911A3C7107750C2A6BE529C58FB2FDB1122((AnimationClipPlayable_t6386488B0C0300A21A352B4C17B9E6D5D38DF953 *)__this, /*hidden argument*/NULL);
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_1 = AnimationClipPlayable_GetHandle_m93C27911A3C7107750C2A6BE529C58FB2FDB1122((AnimationClipPlayable_t6386488B0C0300A21A352B4C17B9E6D5D38DF953 *)(&___other0), /*hidden argument*/NULL);
IL2CPP_RUNTIME_CLASS_INIT(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A_il2cpp_TypeInfo_var);
bool L_2 = PlayableHandle_op_Equality_mFD26CFA8ECF2B622B1A3D4117066CAE965C9F704(L_0, L_1, /*hidden argument*/NULL);
V_0 = L_2;
goto IL_0016;
}
IL_0016:
{
bool L_3 = V_0;
return L_3;
}
}
IL2CPP_EXTERN_C bool AnimationClipPlayable_Equals_m73BDBE0839B6AA4782C37B21DD58D3388B5EC814_AdjustorThunk (RuntimeObject * __this, AnimationClipPlayable_t6386488B0C0300A21A352B4C17B9E6D5D38DF953 ___other0, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationClipPlayable_t6386488B0C0300A21A352B4C17B9E6D5D38DF953 * _thisAdjusted = reinterpret_cast<AnimationClipPlayable_t6386488B0C0300A21A352B4C17B9E6D5D38DF953 *>(__this + _offset);
return AnimationClipPlayable_Equals_m73BDBE0839B6AA4782C37B21DD58D3388B5EC814(_thisAdjusted, ___other0, method);
}
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
// Conversion methods for marshalling of: UnityEngine.AnimationEvent
IL2CPP_EXTERN_C void AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF_marshal_pinvoke(const AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF& unmarshaled, AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF_marshaled_pinvoke& marshaled)
{
Exception_t* ___m_StateSender_8Exception = il2cpp_codegen_get_marshal_directive_exception("Cannot marshal field 'm_StateSender' of type 'AnimationEvent': Reference type field marshaling is not supported.");
IL2CPP_RAISE_MANAGED_EXCEPTION(___m_StateSender_8Exception, NULL);
}
IL2CPP_EXTERN_C void AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF_marshal_pinvoke_back(const AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF_marshaled_pinvoke& marshaled, AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF& unmarshaled)
{
Exception_t* ___m_StateSender_8Exception = il2cpp_codegen_get_marshal_directive_exception("Cannot marshal field 'm_StateSender' of type 'AnimationEvent': Reference type field marshaling is not supported.");
IL2CPP_RAISE_MANAGED_EXCEPTION(___m_StateSender_8Exception, NULL);
}
// Conversion method for clean up from marshalling of: UnityEngine.AnimationEvent
IL2CPP_EXTERN_C void AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF_marshal_pinvoke_cleanup(AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF_marshaled_pinvoke& marshaled)
{
}
// Conversion methods for marshalling of: UnityEngine.AnimationEvent
IL2CPP_EXTERN_C void AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF_marshal_com(const AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF& unmarshaled, AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF_marshaled_com& marshaled)
{
Exception_t* ___m_StateSender_8Exception = il2cpp_codegen_get_marshal_directive_exception("Cannot marshal field 'm_StateSender' of type 'AnimationEvent': Reference type field marshaling is not supported.");
IL2CPP_RAISE_MANAGED_EXCEPTION(___m_StateSender_8Exception, NULL);
}
IL2CPP_EXTERN_C void AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF_marshal_com_back(const AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF_marshaled_com& marshaled, AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF& unmarshaled)
{
Exception_t* ___m_StateSender_8Exception = il2cpp_codegen_get_marshal_directive_exception("Cannot marshal field 'm_StateSender' of type 'AnimationEvent': Reference type field marshaling is not supported.");
IL2CPP_RAISE_MANAGED_EXCEPTION(___m_StateSender_8Exception, NULL);
}
// Conversion method for clean up from marshalling of: UnityEngine.AnimationEvent
IL2CPP_EXTERN_C void AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF_marshal_com_cleanup(AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF_marshaled_com& marshaled)
{
}
// System.Void UnityEngine.AnimationEvent::.ctor()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimationEvent__ctor_mA2780A113EA8DD56C3C2EDD0D60BBA78047BACDE (AnimationEvent_tC15CA47BE450896AF876FFA75D7A8E22C2D286AF * __this, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationEvent__ctor_mA2780A113EA8DD56C3C2EDD0D60BBA78047BACDE_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
{
Object__ctor_m88880E0413421D13FD95325EDCE231707CE1F405(__this, /*hidden argument*/NULL);
__this->set_m_Time_0((0.0f));
__this->set_m_FunctionName_1(_stringLiteralDA39A3EE5E6B4B0D3255BFEF95601890AFD80709);
__this->set_m_StringParameter_2(_stringLiteralDA39A3EE5E6B4B0D3255BFEF95601890AFD80709);
__this->set_m_ObjectReferenceParameter_3((Object_tF2F3778131EFF286AF62B7B013A170F95A91571A *)NULL);
__this->set_m_FloatParameter_4((0.0f));
__this->set_m_IntParameter_5(0);
__this->set_m_MessageOptions_6(0);
__this->set_m_Source_7(0);
__this->set_m_StateSender_8((AnimationState_tDB7088046A65ABCEC66B45147693CA0AD803A3AD *)NULL);
return;
}
}
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
// System.Void UnityEngine.Animations.AnimationLayerMixerPlayable::.ctor(UnityEngine.Playables.PlayableHandle)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimationLayerMixerPlayable__ctor_m42F8E5BB37A175AF298324D3072932ED9946427B (AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880 * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationLayerMixerPlayable__ctor_m42F8E5BB37A175AF298324D3072932ED9946427B_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
bool V_0 = false;
bool V_1 = false;
{
bool L_0 = PlayableHandle_IsValid_m237A5E7818768641BAC928BD08EC0AB439E3DAF6((PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *)(&___handle0), /*hidden argument*/NULL);
V_0 = L_0;
bool L_1 = V_0;
if (!L_1)
{
goto IL_0027;
}
}
{
bool L_2 = PlayableHandle_IsPlayableOfType_TisAnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880_m866298E26CA43C28F7948D46E99D65FAA09722C5((PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *)(&___handle0), /*hidden argument*/PlayableHandle_IsPlayableOfType_TisAnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880_m866298E26CA43C28F7948D46E99D65FAA09722C5_RuntimeMethod_var);
V_1 = (bool)((((int32_t)L_2) == ((int32_t)0))? 1 : 0);
bool L_3 = V_1;
if (!L_3)
{
goto IL_0026;
}
}
{
InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463 * L_4 = (InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463 *)il2cpp_codegen_object_new(InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463_il2cpp_TypeInfo_var);
InvalidCastException__ctor_m50103CBF0C211B93BF46697875413A10B5A5C5A3(L_4, _stringLiteralD2435BFAEB0372E848D9BE812E3B06AB862CC3D1, /*hidden argument*/NULL);
IL2CPP_RAISE_MANAGED_EXCEPTION(L_4, AnimationLayerMixerPlayable__ctor_m42F8E5BB37A175AF298324D3072932ED9946427B_RuntimeMethod_var);
}
IL_0026:
{
}
IL_0027:
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_5 = ___handle0;
__this->set_m_Handle_0(L_5);
return;
}
}
IL2CPP_EXTERN_C void AnimationLayerMixerPlayable__ctor_m42F8E5BB37A175AF298324D3072932ED9946427B_AdjustorThunk (RuntimeObject * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880 * _thisAdjusted = reinterpret_cast<AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880 *>(__this + _offset);
AnimationLayerMixerPlayable__ctor_m42F8E5BB37A175AF298324D3072932ED9946427B(_thisAdjusted, ___handle0, method);
}
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationLayerMixerPlayable::GetHandle()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationLayerMixerPlayable_GetHandle_mBFA950F140D76E10983B9AB946397F4C12ABC439 (AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880 * __this, const RuntimeMethod* method)
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A V_0;
memset((&V_0), 0, sizeof(V_0));
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = __this->get_m_Handle_0();
V_0 = L_0;
goto IL_000a;
}
IL_000a:
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_1 = V_0;
return L_1;
}
}
IL2CPP_EXTERN_C PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationLayerMixerPlayable_GetHandle_mBFA950F140D76E10983B9AB946397F4C12ABC439_AdjustorThunk (RuntimeObject * __this, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880 * _thisAdjusted = reinterpret_cast<AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880 *>(__this + _offset);
return AnimationLayerMixerPlayable_GetHandle_mBFA950F140D76E10983B9AB946397F4C12ABC439(_thisAdjusted, method);
}
// System.Boolean UnityEngine.Animations.AnimationLayerMixerPlayable::Equals(UnityEngine.Animations.AnimationLayerMixerPlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool AnimationLayerMixerPlayable_Equals_m018BD27B24B3EDC5101A475A14F13F753F2323AA (AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880 * __this, AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880 ___other0, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationLayerMixerPlayable_Equals_m018BD27B24B3EDC5101A475A14F13F753F2323AA_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
bool V_0 = false;
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = AnimationLayerMixerPlayable_GetHandle_mBFA950F140D76E10983B9AB946397F4C12ABC439((AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880 *)__this, /*hidden argument*/NULL);
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_1 = AnimationLayerMixerPlayable_GetHandle_mBFA950F140D76E10983B9AB946397F4C12ABC439((AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880 *)(&___other0), /*hidden argument*/NULL);
IL2CPP_RUNTIME_CLASS_INIT(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A_il2cpp_TypeInfo_var);
bool L_2 = PlayableHandle_op_Equality_mFD26CFA8ECF2B622B1A3D4117066CAE965C9F704(L_0, L_1, /*hidden argument*/NULL);
V_0 = L_2;
goto IL_0016;
}
IL_0016:
{
bool L_3 = V_0;
return L_3;
}
}
IL2CPP_EXTERN_C bool AnimationLayerMixerPlayable_Equals_m018BD27B24B3EDC5101A475A14F13F753F2323AA_AdjustorThunk (RuntimeObject * __this, AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880 ___other0, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880 * _thisAdjusted = reinterpret_cast<AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880 *>(__this + _offset);
return AnimationLayerMixerPlayable_Equals_m018BD27B24B3EDC5101A475A14F13F753F2323AA(_thisAdjusted, ___other0, method);
}
// System.Void UnityEngine.Animations.AnimationLayerMixerPlayable::.cctor()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimationLayerMixerPlayable__cctor_mBE9F47E968D356F7BB549E705A4E91E1AEAEE807 (const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationLayerMixerPlayable__cctor_mBE9F47E968D356F7BB549E705A4E91E1AEAEE807_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
{
IL2CPP_RUNTIME_CLASS_INIT(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A_il2cpp_TypeInfo_var);
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = PlayableHandle_get_Null_mD1C6FC2D7F6A7A23955ACDD87BE934B75463E612(/*hidden argument*/NULL);
AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880 L_1;
memset((&L_1), 0, sizeof(L_1));
AnimationLayerMixerPlayable__ctor_m42F8E5BB37A175AF298324D3072932ED9946427B((&L_1), L_0, /*hidden argument*/NULL);
((AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880_StaticFields*)il2cpp_codegen_static_fields_for(AnimationLayerMixerPlayable_tF647DD9BCA6E0F49367A5F13AAE0D5B093A91880_il2cpp_TypeInfo_var))->set_m_NullPlayable_1(L_1);
return;
}
}
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
// System.Void UnityEngine.Animations.AnimationMixerPlayable::.ctor(UnityEngine.Playables.PlayableHandle)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimationMixerPlayable__ctor_mA03CF37709B7854227E25F91BE4F7559981058B0 (AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741 * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationMixerPlayable__ctor_mA03CF37709B7854227E25F91BE4F7559981058B0_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
bool V_0 = false;
bool V_1 = false;
{
bool L_0 = PlayableHandle_IsValid_m237A5E7818768641BAC928BD08EC0AB439E3DAF6((PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *)(&___handle0), /*hidden argument*/NULL);
V_0 = L_0;
bool L_1 = V_0;
if (!L_1)
{
goto IL_0027;
}
}
{
bool L_2 = PlayableHandle_IsPlayableOfType_TisAnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741_m30062CF184CC05FFAA026881BEFE337C13B7E70E((PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *)(&___handle0), /*hidden argument*/PlayableHandle_IsPlayableOfType_TisAnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741_m30062CF184CC05FFAA026881BEFE337C13B7E70E_RuntimeMethod_var);
V_1 = (bool)((((int32_t)L_2) == ((int32_t)0))? 1 : 0);
bool L_3 = V_1;
if (!L_3)
{
goto IL_0026;
}
}
{
InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463 * L_4 = (InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463 *)il2cpp_codegen_object_new(InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463_il2cpp_TypeInfo_var);
InvalidCastException__ctor_m50103CBF0C211B93BF46697875413A10B5A5C5A3(L_4, _stringLiteral4DEE968069F34C26613ADFCD69C41EFC29314286, /*hidden argument*/NULL);
IL2CPP_RAISE_MANAGED_EXCEPTION(L_4, AnimationMixerPlayable__ctor_mA03CF37709B7854227E25F91BE4F7559981058B0_RuntimeMethod_var);
}
IL_0026:
{
}
IL_0027:
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_5 = ___handle0;
__this->set_m_Handle_0(L_5);
return;
}
}
IL2CPP_EXTERN_C void AnimationMixerPlayable__ctor_mA03CF37709B7854227E25F91BE4F7559981058B0_AdjustorThunk (RuntimeObject * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741 * _thisAdjusted = reinterpret_cast<AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741 *>(__this + _offset);
AnimationMixerPlayable__ctor_mA03CF37709B7854227E25F91BE4F7559981058B0(_thisAdjusted, ___handle0, method);
}
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationMixerPlayable::GetHandle()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationMixerPlayable_GetHandle_mE8F7D1A18F1BD1C00BA1EC6AA8036044E8907FC3 (AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741 * __this, const RuntimeMethod* method)
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A V_0;
memset((&V_0), 0, sizeof(V_0));
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = __this->get_m_Handle_0();
V_0 = L_0;
goto IL_000a;
}
IL_000a:
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_1 = V_0;
return L_1;
}
}
IL2CPP_EXTERN_C PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationMixerPlayable_GetHandle_mE8F7D1A18F1BD1C00BA1EC6AA8036044E8907FC3_AdjustorThunk (RuntimeObject * __this, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741 * _thisAdjusted = reinterpret_cast<AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741 *>(__this + _offset);
return AnimationMixerPlayable_GetHandle_mE8F7D1A18F1BD1C00BA1EC6AA8036044E8907FC3(_thisAdjusted, method);
}
// System.Boolean UnityEngine.Animations.AnimationMixerPlayable::Equals(UnityEngine.Animations.AnimationMixerPlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool AnimationMixerPlayable_Equals_m8979D90ED92FF553B5D6AB0BDD616C544352816B (AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741 * __this, AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741 ___other0, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationMixerPlayable_Equals_m8979D90ED92FF553B5D6AB0BDD616C544352816B_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
bool V_0 = false;
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = AnimationMixerPlayable_GetHandle_mE8F7D1A18F1BD1C00BA1EC6AA8036044E8907FC3((AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741 *)__this, /*hidden argument*/NULL);
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_1 = AnimationMixerPlayable_GetHandle_mE8F7D1A18F1BD1C00BA1EC6AA8036044E8907FC3((AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741 *)(&___other0), /*hidden argument*/NULL);
IL2CPP_RUNTIME_CLASS_INIT(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A_il2cpp_TypeInfo_var);
bool L_2 = PlayableHandle_op_Equality_mFD26CFA8ECF2B622B1A3D4117066CAE965C9F704(L_0, L_1, /*hidden argument*/NULL);
V_0 = L_2;
goto IL_0016;
}
IL_0016:
{
bool L_3 = V_0;
return L_3;
}
}
IL2CPP_EXTERN_C bool AnimationMixerPlayable_Equals_m8979D90ED92FF553B5D6AB0BDD616C544352816B_AdjustorThunk (RuntimeObject * __this, AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741 ___other0, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741 * _thisAdjusted = reinterpret_cast<AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741 *>(__this + _offset);
return AnimationMixerPlayable_Equals_m8979D90ED92FF553B5D6AB0BDD616C544352816B(_thisAdjusted, ___other0, method);
}
// System.Void UnityEngine.Animations.AnimationMixerPlayable::.cctor()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimationMixerPlayable__cctor_m8DB71DF60AD75D3274E24FDB9DAC8F4D8FDD5C1D (const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationMixerPlayable__cctor_m8DB71DF60AD75D3274E24FDB9DAC8F4D8FDD5C1D_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
{
IL2CPP_RUNTIME_CLASS_INIT(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A_il2cpp_TypeInfo_var);
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = PlayableHandle_get_Null_mD1C6FC2D7F6A7A23955ACDD87BE934B75463E612(/*hidden argument*/NULL);
AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741 L_1;
memset((&L_1), 0, sizeof(L_1));
AnimationMixerPlayable__ctor_mA03CF37709B7854227E25F91BE4F7559981058B0((&L_1), L_0, /*hidden argument*/NULL);
((AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741_StaticFields*)il2cpp_codegen_static_fields_for(AnimationMixerPlayable_t7C6D407FE0D55712B07081F8114CFA347F124741_il2cpp_TypeInfo_var))->set_m_NullPlayable_1(L_1);
return;
}
}
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
// System.Void UnityEngine.Animations.AnimationMotionXToDeltaPlayable::.ctor(UnityEngine.Playables.PlayableHandle)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimationMotionXToDeltaPlayable__ctor_m11668860161B62484EA095BD6360AFD26A86DE93 (AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076 * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationMotionXToDeltaPlayable__ctor_m11668860161B62484EA095BD6360AFD26A86DE93_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
bool V_0 = false;
bool V_1 = false;
{
bool L_0 = PlayableHandle_IsValid_m237A5E7818768641BAC928BD08EC0AB439E3DAF6((PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *)(&___handle0), /*hidden argument*/NULL);
V_0 = L_0;
bool L_1 = V_0;
if (!L_1)
{
goto IL_0027;
}
}
{
bool L_2 = PlayableHandle_IsPlayableOfType_TisAnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076_m19943D18384297A3129F799C12E91B0D8162A02F((PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *)(&___handle0), /*hidden argument*/PlayableHandle_IsPlayableOfType_TisAnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076_m19943D18384297A3129F799C12E91B0D8162A02F_RuntimeMethod_var);
V_1 = (bool)((((int32_t)L_2) == ((int32_t)0))? 1 : 0);
bool L_3 = V_1;
if (!L_3)
{
goto IL_0026;
}
}
{
InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463 * L_4 = (InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463 *)il2cpp_codegen_object_new(InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463_il2cpp_TypeInfo_var);
InvalidCastException__ctor_m50103CBF0C211B93BF46697875413A10B5A5C5A3(L_4, _stringLiteral8DC2252638D84FAF2C30B95D54EC83F52FA6C630, /*hidden argument*/NULL);
IL2CPP_RAISE_MANAGED_EXCEPTION(L_4, AnimationMotionXToDeltaPlayable__ctor_m11668860161B62484EA095BD6360AFD26A86DE93_RuntimeMethod_var);
}
IL_0026:
{
}
IL_0027:
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_5 = ___handle0;
__this->set_m_Handle_0(L_5);
return;
}
}
IL2CPP_EXTERN_C void AnimationMotionXToDeltaPlayable__ctor_m11668860161B62484EA095BD6360AFD26A86DE93_AdjustorThunk (RuntimeObject * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076 * _thisAdjusted = reinterpret_cast<AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076 *>(__this + _offset);
AnimationMotionXToDeltaPlayable__ctor_m11668860161B62484EA095BD6360AFD26A86DE93(_thisAdjusted, ___handle0, method);
}
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationMotionXToDeltaPlayable::GetHandle()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationMotionXToDeltaPlayable_GetHandle_m840D19A4E2DFB4BF2397061B833E63AD786587BA (AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076 * __this, const RuntimeMethod* method)
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A V_0;
memset((&V_0), 0, sizeof(V_0));
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = __this->get_m_Handle_0();
V_0 = L_0;
goto IL_000a;
}
IL_000a:
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_1 = V_0;
return L_1;
}
}
IL2CPP_EXTERN_C PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationMotionXToDeltaPlayable_GetHandle_m840D19A4E2DFB4BF2397061B833E63AD786587BA_AdjustorThunk (RuntimeObject * __this, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076 * _thisAdjusted = reinterpret_cast<AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076 *>(__this + _offset);
return AnimationMotionXToDeltaPlayable_GetHandle_m840D19A4E2DFB4BF2397061B833E63AD786587BA(_thisAdjusted, method);
}
// System.Boolean UnityEngine.Animations.AnimationMotionXToDeltaPlayable::Equals(UnityEngine.Animations.AnimationMotionXToDeltaPlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool AnimationMotionXToDeltaPlayable_Equals_mB08A41C628755AF909489716A1D62AECC2BFDD9E (AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076 * __this, AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076 ___other0, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationMotionXToDeltaPlayable_Equals_mB08A41C628755AF909489716A1D62AECC2BFDD9E_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
bool V_0 = false;
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = AnimationMotionXToDeltaPlayable_GetHandle_m840D19A4E2DFB4BF2397061B833E63AD786587BA((AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076 *)__this, /*hidden argument*/NULL);
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_1 = AnimationMotionXToDeltaPlayable_GetHandle_m840D19A4E2DFB4BF2397061B833E63AD786587BA((AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076 *)(&___other0), /*hidden argument*/NULL);
IL2CPP_RUNTIME_CLASS_INIT(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A_il2cpp_TypeInfo_var);
bool L_2 = PlayableHandle_op_Equality_mFD26CFA8ECF2B622B1A3D4117066CAE965C9F704(L_0, L_1, /*hidden argument*/NULL);
V_0 = L_2;
goto IL_0016;
}
IL_0016:
{
bool L_3 = V_0;
return L_3;
}
}
IL2CPP_EXTERN_C bool AnimationMotionXToDeltaPlayable_Equals_mB08A41C628755AF909489716A1D62AECC2BFDD9E_AdjustorThunk (RuntimeObject * __this, AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076 ___other0, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076 * _thisAdjusted = reinterpret_cast<AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076 *>(__this + _offset);
return AnimationMotionXToDeltaPlayable_Equals_mB08A41C628755AF909489716A1D62AECC2BFDD9E(_thisAdjusted, ___other0, method);
}
// System.Void UnityEngine.Animations.AnimationMotionXToDeltaPlayable::.cctor()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimationMotionXToDeltaPlayable__cctor_m0C46BAE776A8D7FAB7CEE08C4D6EBC63B08708FD (const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationMotionXToDeltaPlayable__cctor_m0C46BAE776A8D7FAB7CEE08C4D6EBC63B08708FD_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
{
IL2CPP_RUNTIME_CLASS_INIT(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A_il2cpp_TypeInfo_var);
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = PlayableHandle_get_Null_mD1C6FC2D7F6A7A23955ACDD87BE934B75463E612(/*hidden argument*/NULL);
AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076 L_1;
memset((&L_1), 0, sizeof(L_1));
AnimationMotionXToDeltaPlayable__ctor_m11668860161B62484EA095BD6360AFD26A86DE93((&L_1), L_0, /*hidden argument*/NULL);
((AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076_StaticFields*)il2cpp_codegen_static_fields_for(AnimationMotionXToDeltaPlayable_t6E21B629D4689F5E3CFCFACA0B31411082773076_il2cpp_TypeInfo_var))->set_m_NullPlayable_1(L_1);
return;
}
}
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
// System.Void UnityEngine.Animations.AnimationOffsetPlayable::.ctor(UnityEngine.Playables.PlayableHandle)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimationOffsetPlayable__ctor_m9527E52AEA325EAE188AB9843497F2AB33CB742E (AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941 * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationOffsetPlayable__ctor_m9527E52AEA325EAE188AB9843497F2AB33CB742E_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
bool V_0 = false;
bool V_1 = false;
{
bool L_0 = PlayableHandle_IsValid_m237A5E7818768641BAC928BD08EC0AB439E3DAF6((PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *)(&___handle0), /*hidden argument*/NULL);
V_0 = L_0;
bool L_1 = V_0;
if (!L_1)
{
goto IL_0027;
}
}
{
bool L_2 = PlayableHandle_IsPlayableOfType_TisAnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941_m1B2FA89CE8F4A1EBD1AE3FF4E7154CFE120EDF85((PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *)(&___handle0), /*hidden argument*/PlayableHandle_IsPlayableOfType_TisAnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941_m1B2FA89CE8F4A1EBD1AE3FF4E7154CFE120EDF85_RuntimeMethod_var);
V_1 = (bool)((((int32_t)L_2) == ((int32_t)0))? 1 : 0);
bool L_3 = V_1;
if (!L_3)
{
goto IL_0026;
}
}
{
InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463 * L_4 = (InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463 *)il2cpp_codegen_object_new(InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463_il2cpp_TypeInfo_var);
InvalidCastException__ctor_m50103CBF0C211B93BF46697875413A10B5A5C5A3(L_4, _stringLiteralA3C8FF345EC45846B2EE6801F84DD49340F0A9E1, /*hidden argument*/NULL);
IL2CPP_RAISE_MANAGED_EXCEPTION(L_4, AnimationOffsetPlayable__ctor_m9527E52AEA325EAE188AB9843497F2AB33CB742E_RuntimeMethod_var);
}
IL_0026:
{
}
IL_0027:
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_5 = ___handle0;
__this->set_m_Handle_0(L_5);
return;
}
}
IL2CPP_EXTERN_C void AnimationOffsetPlayable__ctor_m9527E52AEA325EAE188AB9843497F2AB33CB742E_AdjustorThunk (RuntimeObject * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941 * _thisAdjusted = reinterpret_cast<AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941 *>(__this + _offset);
AnimationOffsetPlayable__ctor_m9527E52AEA325EAE188AB9843497F2AB33CB742E(_thisAdjusted, ___handle0, method);
}
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationOffsetPlayable::GetHandle()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationOffsetPlayable_GetHandle_m8C3C08EC531127B002D3AFAB5AF259D8030B0049 (AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941 * __this, const RuntimeMethod* method)
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A V_0;
memset((&V_0), 0, sizeof(V_0));
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = __this->get_m_Handle_0();
V_0 = L_0;
goto IL_000a;
}
IL_000a:
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_1 = V_0;
return L_1;
}
}
IL2CPP_EXTERN_C PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationOffsetPlayable_GetHandle_m8C3C08EC531127B002D3AFAB5AF259D8030B0049_AdjustorThunk (RuntimeObject * __this, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941 * _thisAdjusted = reinterpret_cast<AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941 *>(__this + _offset);
return AnimationOffsetPlayable_GetHandle_m8C3C08EC531127B002D3AFAB5AF259D8030B0049(_thisAdjusted, method);
}
// System.Boolean UnityEngine.Animations.AnimationOffsetPlayable::Equals(UnityEngine.Animations.AnimationOffsetPlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool AnimationOffsetPlayable_Equals_m9AFE60B035481569924E20C6953B4B21EF7734AA (AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941 * __this, AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941 ___other0, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationOffsetPlayable_Equals_m9AFE60B035481569924E20C6953B4B21EF7734AA_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
bool V_0 = false;
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = AnimationOffsetPlayable_GetHandle_m8C3C08EC531127B002D3AFAB5AF259D8030B0049((AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941 *)(&___other0), /*hidden argument*/NULL);
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_1 = L_0;
RuntimeObject * L_2 = Box(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A_il2cpp_TypeInfo_var, &L_1);
RuntimeObject * L_3 = Box(AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941_il2cpp_TypeInfo_var, __this);
NullCheck(L_3);
bool L_4 = VirtFuncInvoker1< bool, RuntimeObject * >::Invoke(0 /* System.Boolean System.Object::Equals(System.Object) */, L_3, L_2);
*__this = *(AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941 *)UnBox(L_3);
V_0 = L_4;
goto IL_001c;
}
IL_001c:
{
bool L_5 = V_0;
return L_5;
}
}
IL2CPP_EXTERN_C bool AnimationOffsetPlayable_Equals_m9AFE60B035481569924E20C6953B4B21EF7734AA_AdjustorThunk (RuntimeObject * __this, AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941 ___other0, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941 * _thisAdjusted = reinterpret_cast<AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941 *>(__this + _offset);
return AnimationOffsetPlayable_Equals_m9AFE60B035481569924E20C6953B4B21EF7734AA(_thisAdjusted, ___other0, method);
}
// System.Void UnityEngine.Animations.AnimationOffsetPlayable::.cctor()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimationOffsetPlayable__cctor_m00251ED10BD7F52F20BC9D0A36B9C8AC52F15FA6 (const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationOffsetPlayable__cctor_m00251ED10BD7F52F20BC9D0A36B9C8AC52F15FA6_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
{
IL2CPP_RUNTIME_CLASS_INIT(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A_il2cpp_TypeInfo_var);
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = PlayableHandle_get_Null_mD1C6FC2D7F6A7A23955ACDD87BE934B75463E612(/*hidden argument*/NULL);
AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941 L_1;
memset((&L_1), 0, sizeof(L_1));
AnimationOffsetPlayable__ctor_m9527E52AEA325EAE188AB9843497F2AB33CB742E((&L_1), L_0, /*hidden argument*/NULL);
((AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941_StaticFields*)il2cpp_codegen_static_fields_for(AnimationOffsetPlayable_tBB8333A8E35A23D8FAA2D34E35FF02BD53FF9941_il2cpp_TypeInfo_var))->set_m_NullPlayable_1(L_1);
return;
}
}
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
// System.Void UnityEngine.Animations.AnimationPosePlayable::.ctor(UnityEngine.Playables.PlayableHandle)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimationPosePlayable__ctor_m318607F120F21EDE3D7C1ED07C8B2ED13A23BF57 (AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9 * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationPosePlayable__ctor_m318607F120F21EDE3D7C1ED07C8B2ED13A23BF57_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
bool V_0 = false;
bool V_1 = false;
{
bool L_0 = PlayableHandle_IsValid_m237A5E7818768641BAC928BD08EC0AB439E3DAF6((PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *)(&___handle0), /*hidden argument*/NULL);
V_0 = L_0;
bool L_1 = V_0;
if (!L_1)
{
goto IL_0027;
}
}
{
bool L_2 = PlayableHandle_IsPlayableOfType_TisAnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9_m171336A5BD550FD80BFD4B2BDF5903DF72C0E1C2((PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *)(&___handle0), /*hidden argument*/PlayableHandle_IsPlayableOfType_TisAnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9_m171336A5BD550FD80BFD4B2BDF5903DF72C0E1C2_RuntimeMethod_var);
V_1 = (bool)((((int32_t)L_2) == ((int32_t)0))? 1 : 0);
bool L_3 = V_1;
if (!L_3)
{
goto IL_0026;
}
}
{
InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463 * L_4 = (InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463 *)il2cpp_codegen_object_new(InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463_il2cpp_TypeInfo_var);
InvalidCastException__ctor_m50103CBF0C211B93BF46697875413A10B5A5C5A3(L_4, _stringLiteralE066D08B565F88D413FDACA14C42BFF008FF4EB9, /*hidden argument*/NULL);
IL2CPP_RAISE_MANAGED_EXCEPTION(L_4, AnimationPosePlayable__ctor_m318607F120F21EDE3D7C1ED07C8B2ED13A23BF57_RuntimeMethod_var);
}
IL_0026:
{
}
IL_0027:
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_5 = ___handle0;
__this->set_m_Handle_0(L_5);
return;
}
}
IL2CPP_EXTERN_C void AnimationPosePlayable__ctor_m318607F120F21EDE3D7C1ED07C8B2ED13A23BF57_AdjustorThunk (RuntimeObject * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9 * _thisAdjusted = reinterpret_cast<AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9 *>(__this + _offset);
AnimationPosePlayable__ctor_m318607F120F21EDE3D7C1ED07C8B2ED13A23BF57(_thisAdjusted, ___handle0, method);
}
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationPosePlayable::GetHandle()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationPosePlayable_GetHandle_m0354C54EB680FC70D4B48D95F7FC4BA4700A0DCE (AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9 * __this, const RuntimeMethod* method)
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A V_0;
memset((&V_0), 0, sizeof(V_0));
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = __this->get_m_Handle_0();
V_0 = L_0;
goto IL_000a;
}
IL_000a:
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_1 = V_0;
return L_1;
}
}
IL2CPP_EXTERN_C PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationPosePlayable_GetHandle_m0354C54EB680FC70D4B48D95F7FC4BA4700A0DCE_AdjustorThunk (RuntimeObject * __this, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9 * _thisAdjusted = reinterpret_cast<AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9 *>(__this + _offset);
return AnimationPosePlayable_GetHandle_m0354C54EB680FC70D4B48D95F7FC4BA4700A0DCE(_thisAdjusted, method);
}
// System.Boolean UnityEngine.Animations.AnimationPosePlayable::Equals(UnityEngine.Animations.AnimationPosePlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool AnimationPosePlayable_Equals_mECC5FA256AAA5334C38DBB6D00EE8AC1BDC015A1 (AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9 * __this, AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9 ___other0, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationPosePlayable_Equals_mECC5FA256AAA5334C38DBB6D00EE8AC1BDC015A1_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
bool V_0 = false;
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = AnimationPosePlayable_GetHandle_m0354C54EB680FC70D4B48D95F7FC4BA4700A0DCE((AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9 *)(&___other0), /*hidden argument*/NULL);
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_1 = L_0;
RuntimeObject * L_2 = Box(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A_il2cpp_TypeInfo_var, &L_1);
RuntimeObject * L_3 = Box(AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9_il2cpp_TypeInfo_var, __this);
NullCheck(L_3);
bool L_4 = VirtFuncInvoker1< bool, RuntimeObject * >::Invoke(0 /* System.Boolean System.Object::Equals(System.Object) */, L_3, L_2);
*__this = *(AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9 *)UnBox(L_3);
V_0 = L_4;
goto IL_001c;
}
IL_001c:
{
bool L_5 = V_0;
return L_5;
}
}
IL2CPP_EXTERN_C bool AnimationPosePlayable_Equals_mECC5FA256AAA5334C38DBB6D00EE8AC1BDC015A1_AdjustorThunk (RuntimeObject * __this, AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9 ___other0, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9 * _thisAdjusted = reinterpret_cast<AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9 *>(__this + _offset);
return AnimationPosePlayable_Equals_mECC5FA256AAA5334C38DBB6D00EE8AC1BDC015A1(_thisAdjusted, ___other0, method);
}
// System.Void UnityEngine.Animations.AnimationPosePlayable::.cctor()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimationPosePlayable__cctor_m61B5F097B084BBB3CD21AE5E565AB35450C85B1C (const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationPosePlayable__cctor_m61B5F097B084BBB3CD21AE5E565AB35450C85B1C_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
{
IL2CPP_RUNTIME_CLASS_INIT(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A_il2cpp_TypeInfo_var);
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = PlayableHandle_get_Null_mD1C6FC2D7F6A7A23955ACDD87BE934B75463E612(/*hidden argument*/NULL);
AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9 L_1;
memset((&L_1), 0, sizeof(L_1));
AnimationPosePlayable__ctor_m318607F120F21EDE3D7C1ED07C8B2ED13A23BF57((&L_1), L_0, /*hidden argument*/NULL);
((AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9_StaticFields*)il2cpp_codegen_static_fields_for(AnimationPosePlayable_t455DFF8AB153FC8930BD1B79342EC791033662B9_il2cpp_TypeInfo_var))->set_m_NullPlayable_1(L_1);
return;
}
}
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
// System.Void UnityEngine.Animations.AnimationRemoveScalePlayable::.ctor(UnityEngine.Playables.PlayableHandle)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimationRemoveScalePlayable__ctor_m08810C8ECE9A3A100087DD84B13204EC3AF73A8F (AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429 * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationRemoveScalePlayable__ctor_m08810C8ECE9A3A100087DD84B13204EC3AF73A8F_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
bool V_0 = false;
bool V_1 = false;
{
bool L_0 = PlayableHandle_IsValid_m237A5E7818768641BAC928BD08EC0AB439E3DAF6((PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *)(&___handle0), /*hidden argument*/NULL);
V_0 = L_0;
bool L_1 = V_0;
if (!L_1)
{
goto IL_0027;
}
}
{
bool L_2 = PlayableHandle_IsPlayableOfType_TisAnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429_mEF5219AC94275FE2811CEDC16FE0B850DBA7E9BE((PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *)(&___handle0), /*hidden argument*/PlayableHandle_IsPlayableOfType_TisAnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429_mEF5219AC94275FE2811CEDC16FE0B850DBA7E9BE_RuntimeMethod_var);
V_1 = (bool)((((int32_t)L_2) == ((int32_t)0))? 1 : 0);
bool L_3 = V_1;
if (!L_3)
{
goto IL_0026;
}
}
{
InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463 * L_4 = (InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463 *)il2cpp_codegen_object_new(InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463_il2cpp_TypeInfo_var);
InvalidCastException__ctor_m50103CBF0C211B93BF46697875413A10B5A5C5A3(L_4, _stringLiteral98C704D69BD1A288ED31DEE4ED4E50097A2D7018, /*hidden argument*/NULL);
IL2CPP_RAISE_MANAGED_EXCEPTION(L_4, AnimationRemoveScalePlayable__ctor_m08810C8ECE9A3A100087DD84B13204EC3AF73A8F_RuntimeMethod_var);
}
IL_0026:
{
}
IL_0027:
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_5 = ___handle0;
__this->set_m_Handle_0(L_5);
return;
}
}
IL2CPP_EXTERN_C void AnimationRemoveScalePlayable__ctor_m08810C8ECE9A3A100087DD84B13204EC3AF73A8F_AdjustorThunk (RuntimeObject * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429 * _thisAdjusted = reinterpret_cast<AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429 *>(__this + _offset);
AnimationRemoveScalePlayable__ctor_m08810C8ECE9A3A100087DD84B13204EC3AF73A8F(_thisAdjusted, ___handle0, method);
}
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationRemoveScalePlayable::GetHandle()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationRemoveScalePlayable_GetHandle_m1949202B58BDF17726A1ADC934EB5232E835CCA8 (AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429 * __this, const RuntimeMethod* method)
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A V_0;
memset((&V_0), 0, sizeof(V_0));
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = __this->get_m_Handle_0();
V_0 = L_0;
goto IL_000a;
}
IL_000a:
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_1 = V_0;
return L_1;
}
}
IL2CPP_EXTERN_C PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationRemoveScalePlayable_GetHandle_m1949202B58BDF17726A1ADC934EB5232E835CCA8_AdjustorThunk (RuntimeObject * __this, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429 * _thisAdjusted = reinterpret_cast<AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429 *>(__this + _offset);
return AnimationRemoveScalePlayable_GetHandle_m1949202B58BDF17726A1ADC934EB5232E835CCA8(_thisAdjusted, method);
}
// System.Boolean UnityEngine.Animations.AnimationRemoveScalePlayable::Equals(UnityEngine.Animations.AnimationRemoveScalePlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool AnimationRemoveScalePlayable_Equals_m7FE9E55B027861A0B91347F18DAC7E11E2740397 (AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429 * __this, AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429 ___other0, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationRemoveScalePlayable_Equals_m7FE9E55B027861A0B91347F18DAC7E11E2740397_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
bool V_0 = false;
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = AnimationRemoveScalePlayable_GetHandle_m1949202B58BDF17726A1ADC934EB5232E835CCA8((AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429 *)(&___other0), /*hidden argument*/NULL);
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_1 = L_0;
RuntimeObject * L_2 = Box(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A_il2cpp_TypeInfo_var, &L_1);
RuntimeObject * L_3 = Box(AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429_il2cpp_TypeInfo_var, __this);
NullCheck(L_3);
bool L_4 = VirtFuncInvoker1< bool, RuntimeObject * >::Invoke(0 /* System.Boolean System.Object::Equals(System.Object) */, L_3, L_2);
*__this = *(AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429 *)UnBox(L_3);
V_0 = L_4;
goto IL_001c;
}
IL_001c:
{
bool L_5 = V_0;
return L_5;
}
}
IL2CPP_EXTERN_C bool AnimationRemoveScalePlayable_Equals_m7FE9E55B027861A0B91347F18DAC7E11E2740397_AdjustorThunk (RuntimeObject * __this, AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429 ___other0, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429 * _thisAdjusted = reinterpret_cast<AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429 *>(__this + _offset);
return AnimationRemoveScalePlayable_Equals_m7FE9E55B027861A0B91347F18DAC7E11E2740397(_thisAdjusted, ___other0, method);
}
// System.Void UnityEngine.Animations.AnimationRemoveScalePlayable::.cctor()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimationRemoveScalePlayable__cctor_mA35B93BA4FDEDAA98ACE6A314BF0ED50839B8A98 (const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationRemoveScalePlayable__cctor_mA35B93BA4FDEDAA98ACE6A314BF0ED50839B8A98_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
{
IL2CPP_RUNTIME_CLASS_INIT(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A_il2cpp_TypeInfo_var);
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = PlayableHandle_get_Null_mD1C6FC2D7F6A7A23955ACDD87BE934B75463E612(/*hidden argument*/NULL);
AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429 L_1;
memset((&L_1), 0, sizeof(L_1));
AnimationRemoveScalePlayable__ctor_m08810C8ECE9A3A100087DD84B13204EC3AF73A8F((&L_1), L_0, /*hidden argument*/NULL);
((AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429_StaticFields*)il2cpp_codegen_static_fields_for(AnimationRemoveScalePlayable_t774D428669D5CF715E9A7E80E52A619AECC80429_il2cpp_TypeInfo_var))->set_m_NullPlayable_1(L_1);
return;
}
}
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
// System.Void UnityEngine.Animations.AnimationScriptPlayable::.ctor(UnityEngine.Playables.PlayableHandle)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimationScriptPlayable__ctor_m0B751F7A7D28F59AADACE7C13704D653E0879C56 (AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationScriptPlayable__ctor_m0B751F7A7D28F59AADACE7C13704D653E0879C56_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
bool V_0 = false;
bool V_1 = false;
{
bool L_0 = PlayableHandle_IsValid_m237A5E7818768641BAC928BD08EC0AB439E3DAF6((PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *)(&___handle0), /*hidden argument*/NULL);
V_0 = L_0;
bool L_1 = V_0;
if (!L_1)
{
goto IL_0027;
}
}
{
bool L_2 = PlayableHandle_IsPlayableOfType_TisAnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B_m529F82044C8D4F4B60EA35E96D1C0592644AD76B((PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *)(&___handle0), /*hidden argument*/PlayableHandle_IsPlayableOfType_TisAnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B_m529F82044C8D4F4B60EA35E96D1C0592644AD76B_RuntimeMethod_var);
V_1 = (bool)((((int32_t)L_2) == ((int32_t)0))? 1 : 0);
bool L_3 = V_1;
if (!L_3)
{
goto IL_0026;
}
}
{
InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463 * L_4 = (InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463 *)il2cpp_codegen_object_new(InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463_il2cpp_TypeInfo_var);
InvalidCastException__ctor_m50103CBF0C211B93BF46697875413A10B5A5C5A3(L_4, _stringLiteral860B9EA7CDAB02A8A4B38336805EAE2FBA31F09C, /*hidden argument*/NULL);
IL2CPP_RAISE_MANAGED_EXCEPTION(L_4, AnimationScriptPlayable__ctor_m0B751F7A7D28F59AADACE7C13704D653E0879C56_RuntimeMethod_var);
}
IL_0026:
{
}
IL_0027:
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_5 = ___handle0;
__this->set_m_Handle_0(L_5);
return;
}
}
IL2CPP_EXTERN_C void AnimationScriptPlayable__ctor_m0B751F7A7D28F59AADACE7C13704D653E0879C56_AdjustorThunk (RuntimeObject * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B * _thisAdjusted = reinterpret_cast<AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B *>(__this + _offset);
AnimationScriptPlayable__ctor_m0B751F7A7D28F59AADACE7C13704D653E0879C56(_thisAdjusted, ___handle0, method);
}
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimationScriptPlayable::GetHandle()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationScriptPlayable_GetHandle_mCEA7899E7E43FC2C73B3331AE27C289327F03B18 (AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B * __this, const RuntimeMethod* method)
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A V_0;
memset((&V_0), 0, sizeof(V_0));
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = __this->get_m_Handle_0();
V_0 = L_0;
goto IL_000a;
}
IL_000a:
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_1 = V_0;
return L_1;
}
}
IL2CPP_EXTERN_C PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimationScriptPlayable_GetHandle_mCEA7899E7E43FC2C73B3331AE27C289327F03B18_AdjustorThunk (RuntimeObject * __this, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B * _thisAdjusted = reinterpret_cast<AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B *>(__this + _offset);
return AnimationScriptPlayable_GetHandle_mCEA7899E7E43FC2C73B3331AE27C289327F03B18(_thisAdjusted, method);
}
// System.Boolean UnityEngine.Animations.AnimationScriptPlayable::Equals(UnityEngine.Animations.AnimationScriptPlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool AnimationScriptPlayable_Equals_m1705DCC80312E3D34E17B32BDBAF4BBB78D435D8 (AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B * __this, AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B ___other0, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationScriptPlayable_Equals_m1705DCC80312E3D34E17B32BDBAF4BBB78D435D8_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
bool V_0 = false;
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = AnimationScriptPlayable_GetHandle_mCEA7899E7E43FC2C73B3331AE27C289327F03B18((AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B *)__this, /*hidden argument*/NULL);
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_1 = AnimationScriptPlayable_GetHandle_mCEA7899E7E43FC2C73B3331AE27C289327F03B18((AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B *)(&___other0), /*hidden argument*/NULL);
IL2CPP_RUNTIME_CLASS_INIT(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A_il2cpp_TypeInfo_var);
bool L_2 = PlayableHandle_op_Equality_mFD26CFA8ECF2B622B1A3D4117066CAE965C9F704(L_0, L_1, /*hidden argument*/NULL);
V_0 = L_2;
goto IL_0016;
}
IL_0016:
{
bool L_3 = V_0;
return L_3;
}
}
IL2CPP_EXTERN_C bool AnimationScriptPlayable_Equals_m1705DCC80312E3D34E17B32BDBAF4BBB78D435D8_AdjustorThunk (RuntimeObject * __this, AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B ___other0, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B * _thisAdjusted = reinterpret_cast<AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B *>(__this + _offset);
return AnimationScriptPlayable_Equals_m1705DCC80312E3D34E17B32BDBAF4BBB78D435D8(_thisAdjusted, ___other0, method);
}
// System.Void UnityEngine.Animations.AnimationScriptPlayable::.cctor()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimationScriptPlayable__cctor_m2E7AD0269606C2EB23E1A6A1407E53ACAE1C6F31 (const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimationScriptPlayable__cctor_m2E7AD0269606C2EB23E1A6A1407E53ACAE1C6F31_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
{
IL2CPP_RUNTIME_CLASS_INIT(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A_il2cpp_TypeInfo_var);
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = PlayableHandle_get_Null_mD1C6FC2D7F6A7A23955ACDD87BE934B75463E612(/*hidden argument*/NULL);
AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B L_1;
memset((&L_1), 0, sizeof(L_1));
AnimationScriptPlayable__ctor_m0B751F7A7D28F59AADACE7C13704D653E0879C56((&L_1), L_0, /*hidden argument*/NULL);
((AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B_StaticFields*)il2cpp_codegen_static_fields_for(AnimationScriptPlayable_tC1413FB51680271522811045B1BAA555B8F01C6B_il2cpp_TypeInfo_var))->set_m_NullPlayable_1(L_1);
return;
}
}
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
// System.Void UnityEngine.Animator::SetTrigger(System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void Animator_SetTrigger_m2D79D155CABD81B1CC75EFC35D90508B58D7211C (Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 * __this, String_t* ___name0, const RuntimeMethod* method)
{
{
String_t* L_0 = ___name0;
Animator_SetTriggerString_m38F66A49276BCED56B89BB6AF8A36183BE4285F0(__this, L_0, /*hidden argument*/NULL);
return;
}
}
// System.Void UnityEngine.Animator::ResetTrigger(System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void Animator_ResetTrigger_m02F8CF7EABE466CC3D008A8538171E14BFB907FA (Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 * __this, String_t* ___name0, const RuntimeMethod* method)
{
{
String_t* L_0 = ___name0;
Animator_ResetTriggerString_m6FC21A6B7732A31338EE22E78F3D6220903EDBB2(__this, L_0, /*hidden argument*/NULL);
return;
}
}
// System.Boolean UnityEngine.Animator::get_hasBoundPlayables()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool Animator_get_hasBoundPlayables_m1ADEF28BC77A4C8DBC707DA02A1B72E00AC0C88A (Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 * __this, const RuntimeMethod* method)
{
typedef bool (*Animator_get_hasBoundPlayables_m1ADEF28BC77A4C8DBC707DA02A1B72E00AC0C88A_ftn) (Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 *);
static Animator_get_hasBoundPlayables_m1ADEF28BC77A4C8DBC707DA02A1B72E00AC0C88A_ftn _il2cpp_icall_func;
if (!_il2cpp_icall_func)
_il2cpp_icall_func = (Animator_get_hasBoundPlayables_m1ADEF28BC77A4C8DBC707DA02A1B72E00AC0C88A_ftn)il2cpp_codegen_resolve_icall ("UnityEngine.Animator::get_hasBoundPlayables()");
bool retVal = _il2cpp_icall_func(__this);
return retVal;
}
// System.Void UnityEngine.Animator::SetTriggerString(System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void Animator_SetTriggerString_m38F66A49276BCED56B89BB6AF8A36183BE4285F0 (Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 * __this, String_t* ___name0, const RuntimeMethod* method)
{
typedef void (*Animator_SetTriggerString_m38F66A49276BCED56B89BB6AF8A36183BE4285F0_ftn) (Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 *, String_t*);
static Animator_SetTriggerString_m38F66A49276BCED56B89BB6AF8A36183BE4285F0_ftn _il2cpp_icall_func;
if (!_il2cpp_icall_func)
_il2cpp_icall_func = (Animator_SetTriggerString_m38F66A49276BCED56B89BB6AF8A36183BE4285F0_ftn)il2cpp_codegen_resolve_icall ("UnityEngine.Animator::SetTriggerString(System.String)");
_il2cpp_icall_func(__this, ___name0);
}
// System.Void UnityEngine.Animator::ResetTriggerString(System.String)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void Animator_ResetTriggerString_m6FC21A6B7732A31338EE22E78F3D6220903EDBB2 (Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 * __this, String_t* ___name0, const RuntimeMethod* method)
{
typedef void (*Animator_ResetTriggerString_m6FC21A6B7732A31338EE22E78F3D6220903EDBB2_ftn) (Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 *, String_t*);
static Animator_ResetTriggerString_m6FC21A6B7732A31338EE22E78F3D6220903EDBB2_ftn _il2cpp_icall_func;
if (!_il2cpp_icall_func)
_il2cpp_icall_func = (Animator_ResetTriggerString_m6FC21A6B7732A31338EE22E78F3D6220903EDBB2_ftn)il2cpp_codegen_resolve_icall ("UnityEngine.Animator::ResetTriggerString(System.String)");
_il2cpp_icall_func(__this, ___name0);
}
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
// System.Void UnityEngine.Animations.AnimatorControllerPlayable::.ctor(UnityEngine.Playables.PlayableHandle)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimatorControllerPlayable__ctor_mBD4E1368EB671F6349C5740B1BF131F97BD12CC8 (AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimatorControllerPlayable__ctor_mBD4E1368EB671F6349C5740B1BF131F97BD12CC8_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
{
IL2CPP_RUNTIME_CLASS_INIT(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A_il2cpp_TypeInfo_var);
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = PlayableHandle_get_Null_mD1C6FC2D7F6A7A23955ACDD87BE934B75463E612(/*hidden argument*/NULL);
__this->set_m_Handle_0(L_0);
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_1 = ___handle0;
AnimatorControllerPlayable_SetHandle_m19111E2A65EDAB3382AC9BE815503459A495FF38((AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 *)__this, L_1, /*hidden argument*/NULL);
return;
}
}
IL2CPP_EXTERN_C void AnimatorControllerPlayable__ctor_mBD4E1368EB671F6349C5740B1BF131F97BD12CC8_AdjustorThunk (RuntimeObject * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 * _thisAdjusted = reinterpret_cast<AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 *>(__this + _offset);
AnimatorControllerPlayable__ctor_mBD4E1368EB671F6349C5740B1BF131F97BD12CC8(_thisAdjusted, ___handle0, method);
}
// UnityEngine.Playables.PlayableHandle UnityEngine.Animations.AnimatorControllerPlayable::GetHandle()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimatorControllerPlayable_GetHandle_mBB2911E1B1867ED9C9080BEF16838119A51E0C0C (AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 * __this, const RuntimeMethod* method)
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A V_0;
memset((&V_0), 0, sizeof(V_0));
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = __this->get_m_Handle_0();
V_0 = L_0;
goto IL_000a;
}
IL_000a:
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_1 = V_0;
return L_1;
}
}
IL2CPP_EXTERN_C PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A AnimatorControllerPlayable_GetHandle_mBB2911E1B1867ED9C9080BEF16838119A51E0C0C_AdjustorThunk (RuntimeObject * __this, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 * _thisAdjusted = reinterpret_cast<AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 *>(__this + _offset);
return AnimatorControllerPlayable_GetHandle_mBB2911E1B1867ED9C9080BEF16838119A51E0C0C(_thisAdjusted, method);
}
// System.Void UnityEngine.Animations.AnimatorControllerPlayable::SetHandle(UnityEngine.Playables.PlayableHandle)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimatorControllerPlayable_SetHandle_m19111E2A65EDAB3382AC9BE815503459A495FF38 (AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimatorControllerPlayable_SetHandle_m19111E2A65EDAB3382AC9BE815503459A495FF38_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
bool V_0 = false;
bool V_1 = false;
bool V_2 = false;
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A * L_0 = __this->get_address_of_m_Handle_0();
bool L_1 = PlayableHandle_IsValid_m237A5E7818768641BAC928BD08EC0AB439E3DAF6((PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *)L_0, /*hidden argument*/NULL);
V_0 = L_1;
bool L_2 = V_0;
if (!L_2)
{
goto IL_001b;
}
}
{
InvalidOperationException_t10D3EE59AD28EC641ACEE05BCA4271A527E5ECAB * L_3 = (InvalidOperationException_t10D3EE59AD28EC641ACEE05BCA4271A527E5ECAB *)il2cpp_codegen_object_new(InvalidOperationException_t10D3EE59AD28EC641ACEE05BCA4271A527E5ECAB_il2cpp_TypeInfo_var);
InvalidOperationException__ctor_mC012CE552988309733C896F3FEA8249171E4402E(L_3, _stringLiteralBF563F6FCC25CE41FFE0BF7590AF9F4475916665, /*hidden argument*/NULL);
IL2CPP_RAISE_MANAGED_EXCEPTION(L_3, AnimatorControllerPlayable_SetHandle_m19111E2A65EDAB3382AC9BE815503459A495FF38_RuntimeMethod_var);
}
IL_001b:
{
bool L_4 = PlayableHandle_IsValid_m237A5E7818768641BAC928BD08EC0AB439E3DAF6((PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *)(&___handle0), /*hidden argument*/NULL);
V_1 = L_4;
bool L_5 = V_1;
if (!L_5)
{
goto IL_0041;
}
}
{
bool L_6 = PlayableHandle_IsPlayableOfType_TisAnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4_mFB1F4B388070EC30EC8DA09EB2869306EE60F2B8((PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A *)(&___handle0), /*hidden argument*/PlayableHandle_IsPlayableOfType_TisAnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4_mFB1F4B388070EC30EC8DA09EB2869306EE60F2B8_RuntimeMethod_var);
V_2 = (bool)((((int32_t)L_6) == ((int32_t)0))? 1 : 0);
bool L_7 = V_2;
if (!L_7)
{
goto IL_0040;
}
}
{
InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463 * L_8 = (InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463 *)il2cpp_codegen_object_new(InvalidCastException_tD99F9FF94C3859C78E90F68C2F77A1558BCAF463_il2cpp_TypeInfo_var);
InvalidCastException__ctor_m50103CBF0C211B93BF46697875413A10B5A5C5A3(L_8, _stringLiteralF5510C45DDAD777CCB4893578D995C9739F990F2, /*hidden argument*/NULL);
IL2CPP_RAISE_MANAGED_EXCEPTION(L_8, AnimatorControllerPlayable_SetHandle_m19111E2A65EDAB3382AC9BE815503459A495FF38_RuntimeMethod_var);
}
IL_0040:
{
}
IL_0041:
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_9 = ___handle0;
__this->set_m_Handle_0(L_9);
return;
}
}
IL2CPP_EXTERN_C void AnimatorControllerPlayable_SetHandle_m19111E2A65EDAB3382AC9BE815503459A495FF38_AdjustorThunk (RuntimeObject * __this, PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A ___handle0, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 * _thisAdjusted = reinterpret_cast<AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 *>(__this + _offset);
AnimatorControllerPlayable_SetHandle_m19111E2A65EDAB3382AC9BE815503459A495FF38(_thisAdjusted, ___handle0, method);
}
// System.Boolean UnityEngine.Animations.AnimatorControllerPlayable::Equals(UnityEngine.Animations.AnimatorControllerPlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR bool AnimatorControllerPlayable_Equals_m9D2F918EE07AE657A11C13F285317C05BB257730 (AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 * __this, AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 ___other0, const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimatorControllerPlayable_Equals_m9D2F918EE07AE657A11C13F285317C05BB257730_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
bool V_0 = false;
{
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = AnimatorControllerPlayable_GetHandle_mBB2911E1B1867ED9C9080BEF16838119A51E0C0C((AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 *)__this, /*hidden argument*/NULL);
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_1 = AnimatorControllerPlayable_GetHandle_mBB2911E1B1867ED9C9080BEF16838119A51E0C0C((AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 *)(&___other0), /*hidden argument*/NULL);
IL2CPP_RUNTIME_CLASS_INIT(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A_il2cpp_TypeInfo_var);
bool L_2 = PlayableHandle_op_Equality_mFD26CFA8ECF2B622B1A3D4117066CAE965C9F704(L_0, L_1, /*hidden argument*/NULL);
V_0 = L_2;
goto IL_0016;
}
IL_0016:
{
bool L_3 = V_0;
return L_3;
}
}
IL2CPP_EXTERN_C bool AnimatorControllerPlayable_Equals_m9D2F918EE07AE657A11C13F285317C05BB257730_AdjustorThunk (RuntimeObject * __this, AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 ___other0, const RuntimeMethod* method)
{
int32_t _offset = 1;
AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 * _thisAdjusted = reinterpret_cast<AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 *>(__this + _offset);
return AnimatorControllerPlayable_Equals_m9D2F918EE07AE657A11C13F285317C05BB257730(_thisAdjusted, ___other0, method);
}
// System.Void UnityEngine.Animations.AnimatorControllerPlayable::.cctor()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimatorControllerPlayable__cctor_m82C2FF3AEAD5D042648E50B513269EF367C51EB4 (const RuntimeMethod* method)
{
static bool s_Il2CppMethodInitialized;
if (!s_Il2CppMethodInitialized)
{
il2cpp_codegen_initialize_method (AnimatorControllerPlayable__cctor_m82C2FF3AEAD5D042648E50B513269EF367C51EB4_MetadataUsageId);
s_Il2CppMethodInitialized = true;
}
{
IL2CPP_RUNTIME_CLASS_INIT(PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A_il2cpp_TypeInfo_var);
PlayableHandle_t50DCD240B0400DDAD0822C13E5DBC7AD64DC027A L_0 = PlayableHandle_get_Null_mD1C6FC2D7F6A7A23955ACDD87BE934B75463E612(/*hidden argument*/NULL);
AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 L_1;
memset((&L_1), 0, sizeof(L_1));
AnimatorControllerPlayable__ctor_mBD4E1368EB671F6349C5740B1BF131F97BD12CC8((&L_1), L_0, /*hidden argument*/NULL);
((AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4_StaticFields*)il2cpp_codegen_static_fields_for(AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4_il2cpp_TypeInfo_var))->set_m_NullPlayable_1(L_1);
return;
}
}
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
// System.Void UnityEngine.AnimatorOverrideController::OnInvalidateOverrideController(UnityEngine.AnimatorOverrideController)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void AnimatorOverrideController_OnInvalidateOverrideController_m579571520B7C607B6983D4973EBAE982EAC9AA40 (AnimatorOverrideController_t4630AA9761965F735AEB26B9A92D210D6338B2DA * ___controller0, const RuntimeMethod* method)
{
bool V_0 = false;
{
AnimatorOverrideController_t4630AA9761965F735AEB26B9A92D210D6338B2DA * L_0 = ___controller0;
NullCheck(L_0);
OnOverrideControllerDirtyCallback_t9E38572D7CF06EEFF943EA68082DAC68AB40476C * L_1 = L_0->get_OnOverrideControllerDirty_4();
V_0 = (bool)((!(((RuntimeObject*)(OnOverrideControllerDirtyCallback_t9E38572D7CF06EEFF943EA68082DAC68AB40476C *)L_1) <= ((RuntimeObject*)(RuntimeObject *)NULL)))? 1 : 0);
bool L_2 = V_0;
if (!L_2)
{
goto IL_001a;
}
}
{
AnimatorOverrideController_t4630AA9761965F735AEB26B9A92D210D6338B2DA * L_3 = ___controller0;
NullCheck(L_3);
OnOverrideControllerDirtyCallback_t9E38572D7CF06EEFF943EA68082DAC68AB40476C * L_4 = L_3->get_OnOverrideControllerDirty_4();
NullCheck(L_4);
OnOverrideControllerDirtyCallback_Invoke_m21DB79300E852ED93F2521FFC03EC4D858F6B330(L_4, /*hidden argument*/NULL);
}
IL_001a:
{
return;
}
}
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
// Conversion methods for marshalling of: UnityEngine.AnimatorTransitionInfo
IL2CPP_EXTERN_C void AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0_marshal_pinvoke(const AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0& unmarshaled, AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0_marshaled_pinvoke& marshaled)
{
marshaled.___m_FullPath_0 = unmarshaled.get_m_FullPath_0();
marshaled.___m_UserName_1 = unmarshaled.get_m_UserName_1();
marshaled.___m_Name_2 = unmarshaled.get_m_Name_2();
marshaled.___m_HasFixedDuration_3 = static_cast<int32_t>(unmarshaled.get_m_HasFixedDuration_3());
marshaled.___m_Duration_4 = unmarshaled.get_m_Duration_4();
marshaled.___m_NormalizedTime_5 = unmarshaled.get_m_NormalizedTime_5();
marshaled.___m_AnyState_6 = static_cast<int32_t>(unmarshaled.get_m_AnyState_6());
marshaled.___m_TransitionType_7 = unmarshaled.get_m_TransitionType_7();
}
IL2CPP_EXTERN_C void AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0_marshal_pinvoke_back(const AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0_marshaled_pinvoke& marshaled, AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0& unmarshaled)
{
int32_t unmarshaled_m_FullPath_temp_0 = 0;
unmarshaled_m_FullPath_temp_0 = marshaled.___m_FullPath_0;
unmarshaled.set_m_FullPath_0(unmarshaled_m_FullPath_temp_0);
int32_t unmarshaled_m_UserName_temp_1 = 0;
unmarshaled_m_UserName_temp_1 = marshaled.___m_UserName_1;
unmarshaled.set_m_UserName_1(unmarshaled_m_UserName_temp_1);
int32_t unmarshaled_m_Name_temp_2 = 0;
unmarshaled_m_Name_temp_2 = marshaled.___m_Name_2;
unmarshaled.set_m_Name_2(unmarshaled_m_Name_temp_2);
bool unmarshaled_m_HasFixedDuration_temp_3 = false;
unmarshaled_m_HasFixedDuration_temp_3 = static_cast<bool>(marshaled.___m_HasFixedDuration_3);
unmarshaled.set_m_HasFixedDuration_3(unmarshaled_m_HasFixedDuration_temp_3);
float unmarshaled_m_Duration_temp_4 = 0.0f;
unmarshaled_m_Duration_temp_4 = marshaled.___m_Duration_4;
unmarshaled.set_m_Duration_4(unmarshaled_m_Duration_temp_4);
float unmarshaled_m_NormalizedTime_temp_5 = 0.0f;
unmarshaled_m_NormalizedTime_temp_5 = marshaled.___m_NormalizedTime_5;
unmarshaled.set_m_NormalizedTime_5(unmarshaled_m_NormalizedTime_temp_5);
bool unmarshaled_m_AnyState_temp_6 = false;
unmarshaled_m_AnyState_temp_6 = static_cast<bool>(marshaled.___m_AnyState_6);
unmarshaled.set_m_AnyState_6(unmarshaled_m_AnyState_temp_6);
int32_t unmarshaled_m_TransitionType_temp_7 = 0;
unmarshaled_m_TransitionType_temp_7 = marshaled.___m_TransitionType_7;
unmarshaled.set_m_TransitionType_7(unmarshaled_m_TransitionType_temp_7);
}
// Conversion method for clean up from marshalling of: UnityEngine.AnimatorTransitionInfo
IL2CPP_EXTERN_C void AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0_marshal_pinvoke_cleanup(AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0_marshaled_pinvoke& marshaled)
{
}
// Conversion methods for marshalling of: UnityEngine.AnimatorTransitionInfo
IL2CPP_EXTERN_C void AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0_marshal_com(const AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0& unmarshaled, AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0_marshaled_com& marshaled)
{
marshaled.___m_FullPath_0 = unmarshaled.get_m_FullPath_0();
marshaled.___m_UserName_1 = unmarshaled.get_m_UserName_1();
marshaled.___m_Name_2 = unmarshaled.get_m_Name_2();
marshaled.___m_HasFixedDuration_3 = static_cast<int32_t>(unmarshaled.get_m_HasFixedDuration_3());
marshaled.___m_Duration_4 = unmarshaled.get_m_Duration_4();
marshaled.___m_NormalizedTime_5 = unmarshaled.get_m_NormalizedTime_5();
marshaled.___m_AnyState_6 = static_cast<int32_t>(unmarshaled.get_m_AnyState_6());
marshaled.___m_TransitionType_7 = unmarshaled.get_m_TransitionType_7();
}
IL2CPP_EXTERN_C void AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0_marshal_com_back(const AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0_marshaled_com& marshaled, AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0& unmarshaled)
{
int32_t unmarshaled_m_FullPath_temp_0 = 0;
unmarshaled_m_FullPath_temp_0 = marshaled.___m_FullPath_0;
unmarshaled.set_m_FullPath_0(unmarshaled_m_FullPath_temp_0);
int32_t unmarshaled_m_UserName_temp_1 = 0;
unmarshaled_m_UserName_temp_1 = marshaled.___m_UserName_1;
unmarshaled.set_m_UserName_1(unmarshaled_m_UserName_temp_1);
int32_t unmarshaled_m_Name_temp_2 = 0;
unmarshaled_m_Name_temp_2 = marshaled.___m_Name_2;
unmarshaled.set_m_Name_2(unmarshaled_m_Name_temp_2);
bool unmarshaled_m_HasFixedDuration_temp_3 = false;
unmarshaled_m_HasFixedDuration_temp_3 = static_cast<bool>(marshaled.___m_HasFixedDuration_3);
unmarshaled.set_m_HasFixedDuration_3(unmarshaled_m_HasFixedDuration_temp_3);
float unmarshaled_m_Duration_temp_4 = 0.0f;
unmarshaled_m_Duration_temp_4 = marshaled.___m_Duration_4;
unmarshaled.set_m_Duration_4(unmarshaled_m_Duration_temp_4);
float unmarshaled_m_NormalizedTime_temp_5 = 0.0f;
unmarshaled_m_NormalizedTime_temp_5 = marshaled.___m_NormalizedTime_5;
unmarshaled.set_m_NormalizedTime_5(unmarshaled_m_NormalizedTime_temp_5);
bool unmarshaled_m_AnyState_temp_6 = false;
unmarshaled_m_AnyState_temp_6 = static_cast<bool>(marshaled.___m_AnyState_6);
unmarshaled.set_m_AnyState_6(unmarshaled_m_AnyState_temp_6);
int32_t unmarshaled_m_TransitionType_temp_7 = 0;
unmarshaled_m_TransitionType_temp_7 = marshaled.___m_TransitionType_7;
unmarshaled.set_m_TransitionType_7(unmarshaled_m_TransitionType_temp_7);
}
// Conversion method for clean up from marshalling of: UnityEngine.AnimatorTransitionInfo
IL2CPP_EXTERN_C void AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0_marshal_com_cleanup(AnimatorTransitionInfo_t7D0BAD3D274C055F1FC7ACE0F3A195CA3C9026A0_marshaled_com& marshaled)
{
}
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
// Conversion methods for marshalling of: UnityEngine.HumanBone
IL2CPP_EXTERN_C void HumanBone_tFEE7CD9B6E62BBB95CC4A6F1AA7FC7A26541D62D_marshal_pinvoke(const HumanBone_tFEE7CD9B6E62BBB95CC4A6F1AA7FC7A26541D62D& unmarshaled, HumanBone_tFEE7CD9B6E62BBB95CC4A6F1AA7FC7A26541D62D_marshaled_pinvoke& marshaled)
{
marshaled.___m_BoneName_0 = il2cpp_codegen_marshal_string(unmarshaled.get_m_BoneName_0());
marshaled.___m_HumanName_1 = il2cpp_codegen_marshal_string(unmarshaled.get_m_HumanName_1());
marshaled.___limit_2 = unmarshaled.get_limit_2();
}
IL2CPP_EXTERN_C void HumanBone_tFEE7CD9B6E62BBB95CC4A6F1AA7FC7A26541D62D_marshal_pinvoke_back(const HumanBone_tFEE7CD9B6E62BBB95CC4A6F1AA7FC7A26541D62D_marshaled_pinvoke& marshaled, HumanBone_tFEE7CD9B6E62BBB95CC4A6F1AA7FC7A26541D62D& unmarshaled)
{
unmarshaled.set_m_BoneName_0(il2cpp_codegen_marshal_string_result(marshaled.___m_BoneName_0));
unmarshaled.set_m_HumanName_1(il2cpp_codegen_marshal_string_result(marshaled.___m_HumanName_1));
HumanLimit_t8F488DD21062BE1259B0F4C77E4EB24FB931E8D8 unmarshaled_limit_temp_2;
memset((&unmarshaled_limit_temp_2), 0, sizeof(unmarshaled_limit_temp_2));
unmarshaled_limit_temp_2 = marshaled.___limit_2;
unmarshaled.set_limit_2(unmarshaled_limit_temp_2);
}
// Conversion method for clean up from marshalling of: UnityEngine.HumanBone
IL2CPP_EXTERN_C void HumanBone_tFEE7CD9B6E62BBB95CC4A6F1AA7FC7A26541D62D_marshal_pinvoke_cleanup(HumanBone_tFEE7CD9B6E62BBB95CC4A6F1AA7FC7A26541D62D_marshaled_pinvoke& marshaled)
{
il2cpp_codegen_marshal_free(marshaled.___m_BoneName_0);
marshaled.___m_BoneName_0 = NULL;
il2cpp_codegen_marshal_free(marshaled.___m_HumanName_1);
marshaled.___m_HumanName_1 = NULL;
}
// Conversion methods for marshalling of: UnityEngine.HumanBone
IL2CPP_EXTERN_C void HumanBone_tFEE7CD9B6E62BBB95CC4A6F1AA7FC7A26541D62D_marshal_com(const HumanBone_tFEE7CD9B6E62BBB95CC4A6F1AA7FC7A26541D62D& unmarshaled, HumanBone_tFEE7CD9B6E62BBB95CC4A6F1AA7FC7A26541D62D_marshaled_com& marshaled)
{
marshaled.___m_BoneName_0 = il2cpp_codegen_marshal_bstring(unmarshaled.get_m_BoneName_0());
marshaled.___m_HumanName_1 = il2cpp_codegen_marshal_bstring(unmarshaled.get_m_HumanName_1());
marshaled.___limit_2 = unmarshaled.get_limit_2();
}
IL2CPP_EXTERN_C void HumanBone_tFEE7CD9B6E62BBB95CC4A6F1AA7FC7A26541D62D_marshal_com_back(const HumanBone_tFEE7CD9B6E62BBB95CC4A6F1AA7FC7A26541D62D_marshaled_com& marshaled, HumanBone_tFEE7CD9B6E62BBB95CC4A6F1AA7FC7A26541D62D& unmarshaled)
{
unmarshaled.set_m_BoneName_0(il2cpp_codegen_marshal_bstring_result(marshaled.___m_BoneName_0));
unmarshaled.set_m_HumanName_1(il2cpp_codegen_marshal_bstring_result(marshaled.___m_HumanName_1));
HumanLimit_t8F488DD21062BE1259B0F4C77E4EB24FB931E8D8 unmarshaled_limit_temp_2;
memset((&unmarshaled_limit_temp_2), 0, sizeof(unmarshaled_limit_temp_2));
unmarshaled_limit_temp_2 = marshaled.___limit_2;
unmarshaled.set_limit_2(unmarshaled_limit_temp_2);
}
// Conversion method for clean up from marshalling of: UnityEngine.HumanBone
IL2CPP_EXTERN_C void HumanBone_tFEE7CD9B6E62BBB95CC4A6F1AA7FC7A26541D62D_marshal_com_cleanup(HumanBone_tFEE7CD9B6E62BBB95CC4A6F1AA7FC7A26541D62D_marshaled_com& marshaled)
{
il2cpp_codegen_marshal_free_bstring(marshaled.___m_BoneName_0);
marshaled.___m_BoneName_0 = NULL;
il2cpp_codegen_marshal_free_bstring(marshaled.___m_HumanName_1);
marshaled.___m_HumanName_1 = NULL;
}
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
// Conversion methods for marshalling of: UnityEngine.SkeletonBone
IL2CPP_EXTERN_C void SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E_marshal_pinvoke(const SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E& unmarshaled, SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E_marshaled_pinvoke& marshaled)
{
marshaled.___name_0 = il2cpp_codegen_marshal_string(unmarshaled.get_name_0());
marshaled.___parentName_1 = il2cpp_codegen_marshal_string(unmarshaled.get_parentName_1());
marshaled.___position_2 = unmarshaled.get_position_2();
marshaled.___rotation_3 = unmarshaled.get_rotation_3();
marshaled.___scale_4 = unmarshaled.get_scale_4();
}
IL2CPP_EXTERN_C void SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E_marshal_pinvoke_back(const SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E_marshaled_pinvoke& marshaled, SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E& unmarshaled)
{
unmarshaled.set_name_0(il2cpp_codegen_marshal_string_result(marshaled.___name_0));
unmarshaled.set_parentName_1(il2cpp_codegen_marshal_string_result(marshaled.___parentName_1));
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E unmarshaled_position_temp_2;
memset((&unmarshaled_position_temp_2), 0, sizeof(unmarshaled_position_temp_2));
unmarshaled_position_temp_2 = marshaled.___position_2;
unmarshaled.set_position_2(unmarshaled_position_temp_2);
Quaternion_t6D28618CF65156D4A0AD747370DDFD0C514A31B4 unmarshaled_rotation_temp_3;
memset((&unmarshaled_rotation_temp_3), 0, sizeof(unmarshaled_rotation_temp_3));
unmarshaled_rotation_temp_3 = marshaled.___rotation_3;
unmarshaled.set_rotation_3(unmarshaled_rotation_temp_3);
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E unmarshaled_scale_temp_4;
memset((&unmarshaled_scale_temp_4), 0, sizeof(unmarshaled_scale_temp_4));
unmarshaled_scale_temp_4 = marshaled.___scale_4;
unmarshaled.set_scale_4(unmarshaled_scale_temp_4);
}
// Conversion method for clean up from marshalling of: UnityEngine.SkeletonBone
IL2CPP_EXTERN_C void SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E_marshal_pinvoke_cleanup(SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E_marshaled_pinvoke& marshaled)
{
il2cpp_codegen_marshal_free(marshaled.___name_0);
marshaled.___name_0 = NULL;
il2cpp_codegen_marshal_free(marshaled.___parentName_1);
marshaled.___parentName_1 = NULL;
}
// Conversion methods for marshalling of: UnityEngine.SkeletonBone
IL2CPP_EXTERN_C void SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E_marshal_com(const SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E& unmarshaled, SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E_marshaled_com& marshaled)
{
marshaled.___name_0 = il2cpp_codegen_marshal_bstring(unmarshaled.get_name_0());
marshaled.___parentName_1 = il2cpp_codegen_marshal_bstring(unmarshaled.get_parentName_1());
marshaled.___position_2 = unmarshaled.get_position_2();
marshaled.___rotation_3 = unmarshaled.get_rotation_3();
marshaled.___scale_4 = unmarshaled.get_scale_4();
}
IL2CPP_EXTERN_C void SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E_marshal_com_back(const SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E_marshaled_com& marshaled, SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E& unmarshaled)
{
unmarshaled.set_name_0(il2cpp_codegen_marshal_bstring_result(marshaled.___name_0));
unmarshaled.set_parentName_1(il2cpp_codegen_marshal_bstring_result(marshaled.___parentName_1));
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E unmarshaled_position_temp_2;
memset((&unmarshaled_position_temp_2), 0, sizeof(unmarshaled_position_temp_2));
unmarshaled_position_temp_2 = marshaled.___position_2;
unmarshaled.set_position_2(unmarshaled_position_temp_2);
Quaternion_t6D28618CF65156D4A0AD747370DDFD0C514A31B4 unmarshaled_rotation_temp_3;
memset((&unmarshaled_rotation_temp_3), 0, sizeof(unmarshaled_rotation_temp_3));
unmarshaled_rotation_temp_3 = marshaled.___rotation_3;
unmarshaled.set_rotation_3(unmarshaled_rotation_temp_3);
Vector3_t65B972D6A585A0A5B63153CF1177A90D3C90D65E unmarshaled_scale_temp_4;
memset((&unmarshaled_scale_temp_4), 0, sizeof(unmarshaled_scale_temp_4));
unmarshaled_scale_temp_4 = marshaled.___scale_4;
unmarshaled.set_scale_4(unmarshaled_scale_temp_4);
}
// Conversion method for clean up from marshalling of: UnityEngine.SkeletonBone
IL2CPP_EXTERN_C void SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E_marshal_com_cleanup(SkeletonBone_t0AD95EAD0BE7D2EC13B2C7505225D340CB456A9E_marshaled_com& marshaled)
{
il2cpp_codegen_marshal_free_bstring(marshaled.___name_0);
marshaled.___name_0 = NULL;
il2cpp_codegen_marshal_free_bstring(marshaled.___parentName_1);
marshaled.___parentName_1 = NULL;
}
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
// System.Void UnityEngine.StateMachineBehaviour::OnStateEnter(UnityEngine.Animator,UnityEngine.AnimatorStateInfo,System.Int32)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void StateMachineBehaviour_OnStateEnter_m0B5055A01EEF9070E7611D3C3165AAA118D22953 (StateMachineBehaviour_tBEDE439261DEB4C7334646339BC6F1E7958F095F * __this, Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 * ___animator0, AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA ___stateInfo1, int32_t ___layerIndex2, const RuntimeMethod* method)
{
{
return;
}
}
// System.Void UnityEngine.StateMachineBehaviour::OnStateUpdate(UnityEngine.Animator,UnityEngine.AnimatorStateInfo,System.Int32)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void StateMachineBehaviour_OnStateUpdate_m2FF9D5AD07DF99860C7B0033791FE08F2EF919F1 (StateMachineBehaviour_tBEDE439261DEB4C7334646339BC6F1E7958F095F * __this, Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 * ___animator0, AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA ___stateInfo1, int32_t ___layerIndex2, const RuntimeMethod* method)
{
{
return;
}
}
// System.Void UnityEngine.StateMachineBehaviour::OnStateExit(UnityEngine.Animator,UnityEngine.AnimatorStateInfo,System.Int32)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void StateMachineBehaviour_OnStateExit_mE8EADFCEA482A101BF13AFB773A06C3C2C8B3208 (StateMachineBehaviour_tBEDE439261DEB4C7334646339BC6F1E7958F095F * __this, Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 * ___animator0, AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA ___stateInfo1, int32_t ___layerIndex2, const RuntimeMethod* method)
{
{
return;
}
}
// System.Void UnityEngine.StateMachineBehaviour::OnStateMove(UnityEngine.Animator,UnityEngine.AnimatorStateInfo,System.Int32)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void StateMachineBehaviour_OnStateMove_mB51A6EA16DA5038BF7C4E46863C8ECA1338EFBDD (StateMachineBehaviour_tBEDE439261DEB4C7334646339BC6F1E7958F095F * __this, Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 * ___animator0, AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA ___stateInfo1, int32_t ___layerIndex2, const RuntimeMethod* method)
{
{
return;
}
}
// System.Void UnityEngine.StateMachineBehaviour::OnStateIK(UnityEngine.Animator,UnityEngine.AnimatorStateInfo,System.Int32)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void StateMachineBehaviour_OnStateIK_m2BB5A0CD4B083CCDFAC7EE2F8233D2B11825197F (StateMachineBehaviour_tBEDE439261DEB4C7334646339BC6F1E7958F095F * __this, Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 * ___animator0, AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA ___stateInfo1, int32_t ___layerIndex2, const RuntimeMethod* method)
{
{
return;
}
}
// System.Void UnityEngine.StateMachineBehaviour::OnStateMachineEnter(UnityEngine.Animator,System.Int32)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void StateMachineBehaviour_OnStateMachineEnter_m8696CC6EE9DC7577A07023F84DCF6E4F80E75ACC (StateMachineBehaviour_tBEDE439261DEB4C7334646339BC6F1E7958F095F * __this, Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 * ___animator0, int32_t ___stateMachinePathHash1, const RuntimeMethod* method)
{
{
return;
}
}
// System.Void UnityEngine.StateMachineBehaviour::OnStateMachineExit(UnityEngine.Animator,System.Int32)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void StateMachineBehaviour_OnStateMachineExit_m7FD170C30229751A93F64C26AFFF9C9BA057BF3D (StateMachineBehaviour_tBEDE439261DEB4C7334646339BC6F1E7958F095F * __this, Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 * ___animator0, int32_t ___stateMachinePathHash1, const RuntimeMethod* method)
{
{
return;
}
}
// System.Void UnityEngine.StateMachineBehaviour::OnStateEnter(UnityEngine.Animator,UnityEngine.AnimatorStateInfo,System.Int32,UnityEngine.Animations.AnimatorControllerPlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void StateMachineBehaviour_OnStateEnter_m0027D5548D58C0E2777A4CF9420F015FD56CEC18 (StateMachineBehaviour_tBEDE439261DEB4C7334646339BC6F1E7958F095F * __this, Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 * ___animator0, AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA ___stateInfo1, int32_t ___layerIndex2, AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 ___controller3, const RuntimeMethod* method)
{
{
return;
}
}
// System.Void UnityEngine.StateMachineBehaviour::OnStateUpdate(UnityEngine.Animator,UnityEngine.AnimatorStateInfo,System.Int32,UnityEngine.Animations.AnimatorControllerPlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void StateMachineBehaviour_OnStateUpdate_mF81F7D0AB02EB31012A7C50E75295C40301A5055 (StateMachineBehaviour_tBEDE439261DEB4C7334646339BC6F1E7958F095F * __this, Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 * ___animator0, AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA ___stateInfo1, int32_t ___layerIndex2, AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 ___controller3, const RuntimeMethod* method)
{
{
return;
}
}
// System.Void UnityEngine.StateMachineBehaviour::OnStateExit(UnityEngine.Animator,UnityEngine.AnimatorStateInfo,System.Int32,UnityEngine.Animations.AnimatorControllerPlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void StateMachineBehaviour_OnStateExit_m795DAE1099CF045D5E61ABBBAD017455F48B0707 (StateMachineBehaviour_tBEDE439261DEB4C7334646339BC6F1E7958F095F * __this, Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 * ___animator0, AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA ___stateInfo1, int32_t ___layerIndex2, AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 ___controller3, const RuntimeMethod* method)
{
{
return;
}
}
// System.Void UnityEngine.StateMachineBehaviour::OnStateMove(UnityEngine.Animator,UnityEngine.AnimatorStateInfo,System.Int32,UnityEngine.Animations.AnimatorControllerPlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void StateMachineBehaviour_OnStateMove_m29F850CE0258906408520515E4E157D43AFEB181 (StateMachineBehaviour_tBEDE439261DEB4C7334646339BC6F1E7958F095F * __this, Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 * ___animator0, AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA ___stateInfo1, int32_t ___layerIndex2, AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 ___controller3, const RuntimeMethod* method)
{
{
return;
}
}
// System.Void UnityEngine.StateMachineBehaviour::OnStateIK(UnityEngine.Animator,UnityEngine.AnimatorStateInfo,System.Int32,UnityEngine.Animations.AnimatorControllerPlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void StateMachineBehaviour_OnStateIK_m96E18AE1A75046F85EB7FEB5C05CEC7377F72C1F (StateMachineBehaviour_tBEDE439261DEB4C7334646339BC6F1E7958F095F * __this, Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 * ___animator0, AnimatorStateInfo_t052E146D2DB1EC155950ECA45734BF57134258AA ___stateInfo1, int32_t ___layerIndex2, AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 ___controller3, const RuntimeMethod* method)
{
{
return;
}
}
// System.Void UnityEngine.StateMachineBehaviour::OnStateMachineEnter(UnityEngine.Animator,System.Int32,UnityEngine.Animations.AnimatorControllerPlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void StateMachineBehaviour_OnStateMachineEnter_mF2DF6E7A25D30F05E99984F3E8D4083D695F23CA (StateMachineBehaviour_tBEDE439261DEB4C7334646339BC6F1E7958F095F * __this, Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 * ___animator0, int32_t ___stateMachinePathHash1, AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 ___controller2, const RuntimeMethod* method)
{
{
return;
}
}
// System.Void UnityEngine.StateMachineBehaviour::OnStateMachineExit(UnityEngine.Animator,System.Int32,UnityEngine.Animations.AnimatorControllerPlayable)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void StateMachineBehaviour_OnStateMachineExit_m8AC70A1160FE329D0E1EC31F08B1E85B59DB516D (StateMachineBehaviour_tBEDE439261DEB4C7334646339BC6F1E7958F095F * __this, Animator_t9DD1D43680A61D65A3C98C6EFF559709DC9CE149 * ___animator0, int32_t ___stateMachinePathHash1, AnimatorControllerPlayable_tEABD56FA5A36BD337DA6E049FCB4F1D521DA17A4 ___controller2, const RuntimeMethod* method)
{
{
return;
}
}
// System.Void UnityEngine.StateMachineBehaviour::.ctor()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void StateMachineBehaviour__ctor_mDB0650FD738799E5880150E656D4A88524D0EBE0 (StateMachineBehaviour_tBEDE439261DEB4C7334646339BC6F1E7958F095F * __this, const RuntimeMethod* method)
{
{
ScriptableObject__ctor_m8DAE6CDCFA34E16F2543B02CC3669669FF203063(__this, /*hidden argument*/NULL);
return;
}
}
#ifdef __clang__
#pragma clang diagnostic pop
#endif
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Winvalid-offsetof"
#pragma clang diagnostic ignored "-Wunused-variable"
#endif
IL2CPP_EXTERN_C void DelegatePInvokeWrapper_OnOverrideControllerDirtyCallback_t9E38572D7CF06EEFF943EA68082DAC68AB40476C (OnOverrideControllerDirtyCallback_t9E38572D7CF06EEFF943EA68082DAC68AB40476C * __this, const RuntimeMethod* method)
{
typedef void (DEFAULT_CALL *PInvokeFunc)();
PInvokeFunc il2cppPInvokeFunc = reinterpret_cast<PInvokeFunc>(il2cpp_codegen_get_method_pointer(((RuntimeDelegate*)__this)->method));
// Native function invocation
il2cppPInvokeFunc();
}
// System.Void UnityEngine.AnimatorOverrideController_OnOverrideControllerDirtyCallback::.ctor(System.Object,System.IntPtr)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void OnOverrideControllerDirtyCallback__ctor_mA35F55BEB8A4BD57D109684E857F85C1F0A6C1B5 (OnOverrideControllerDirtyCallback_t9E38572D7CF06EEFF943EA68082DAC68AB40476C * __this, RuntimeObject * ___object0, intptr_t ___method1, const RuntimeMethod* method)
{
__this->set_method_ptr_0(il2cpp_codegen_get_method_pointer((RuntimeMethod*)___method1));
__this->set_method_3(___method1);
__this->set_m_target_2(___object0);
}
// System.Void UnityEngine.AnimatorOverrideController_OnOverrideControllerDirtyCallback::Invoke()
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void OnOverrideControllerDirtyCallback_Invoke_m21DB79300E852ED93F2521FFC03EC4D858F6B330 (OnOverrideControllerDirtyCallback_t9E38572D7CF06EEFF943EA68082DAC68AB40476C * __this, const RuntimeMethod* method)
{
DelegateU5BU5D_t677D8FE08A5F99E8EE49150B73966CD6E9BF7DB8* delegateArrayToInvoke = __this->get_delegates_11();
Delegate_t** delegatesToInvoke;
il2cpp_array_size_t length;
if (delegateArrayToInvoke != NULL)
{
length = delegateArrayToInvoke->max_length;
delegatesToInvoke = reinterpret_cast<Delegate_t**>(delegateArrayToInvoke->GetAddressAtUnchecked(0));
}
else
{
length = 1;
delegatesToInvoke = reinterpret_cast<Delegate_t**>(&__this);
}
for (il2cpp_array_size_t i = 0; i < length; i++)
{
Delegate_t* currentDelegate = delegatesToInvoke[i];
Il2CppMethodPointer targetMethodPointer = currentDelegate->get_method_ptr_0();
RuntimeObject* targetThis = currentDelegate->get_m_target_2();
RuntimeMethod* targetMethod = (RuntimeMethod*)(currentDelegate->get_method_3());
if (!il2cpp_codegen_method_is_virtual(targetMethod))
{
il2cpp_codegen_raise_execution_engine_exception_if_method_is_not_found(targetMethod);
}
bool ___methodIsStatic = MethodIsStatic(targetMethod);
int ___parameterCount = il2cpp_codegen_method_parameter_count(targetMethod);
if (___methodIsStatic)
{
if (___parameterCount == 0)
{
// open
typedef void (*FunctionPointerType) (const RuntimeMethod*);
((FunctionPointerType)targetMethodPointer)(targetMethod);
}
else
{
// closed
typedef void (*FunctionPointerType) (void*, const RuntimeMethod*);
((FunctionPointerType)targetMethodPointer)(targetThis, targetMethod);
}
}
else
{
// closed
if (il2cpp_codegen_method_is_virtual(targetMethod) && !il2cpp_codegen_object_is_of_sealed_type(targetThis) && il2cpp_codegen_delegate_has_invoker((Il2CppDelegate*)__this))
{
if (il2cpp_codegen_method_is_generic_instance(targetMethod))
{
if (il2cpp_codegen_method_is_interface_method(targetMethod))
GenericInterfaceActionInvoker0::Invoke(targetMethod, targetThis);
else
GenericVirtActionInvoker0::Invoke(targetMethod, targetThis);
}
else
{
if (il2cpp_codegen_method_is_interface_method(targetMethod))
InterfaceActionInvoker0::Invoke(il2cpp_codegen_method_get_slot(targetMethod), il2cpp_codegen_method_get_declaring_type(targetMethod), targetThis);
else
VirtActionInvoker0::Invoke(il2cpp_codegen_method_get_slot(targetMethod), targetThis);
}
}
else
{
typedef void (*FunctionPointerType) (void*, const RuntimeMethod*);
((FunctionPointerType)targetMethodPointer)(targetThis, targetMethod);
}
}
}
}
// System.IAsyncResult UnityEngine.AnimatorOverrideController_OnOverrideControllerDirtyCallback::BeginInvoke(System.AsyncCallback,System.Object)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR RuntimeObject* OnOverrideControllerDirtyCallback_BeginInvoke_m40D5810BF8C5066DB2C7987E7C76FD23D2AC47E3 (OnOverrideControllerDirtyCallback_t9E38572D7CF06EEFF943EA68082DAC68AB40476C * __this, AsyncCallback_tA7921BEF974919C46FF8F9D9867C567B200BB0EA * ___callback0, RuntimeObject * ___object1, const RuntimeMethod* method)
{
void *__d_args[1] = {0};
return (RuntimeObject*)il2cpp_codegen_delegate_begin_invoke((RuntimeDelegate*)__this, __d_args, (RuntimeDelegate*)___callback0, (RuntimeObject*)___object1);
}
// System.Void UnityEngine.AnimatorOverrideController_OnOverrideControllerDirtyCallback::EndInvoke(System.IAsyncResult)
IL2CPP_EXTERN_C IL2CPP_METHOD_ATTR void OnOverrideControllerDirtyCallback_EndInvoke_mAF3C7805FADE63999DC2121032B11DF86668E9F4 (OnOverrideControllerDirtyCallback_t9E38572D7CF06EEFF943EA68082DAC68AB40476C * __this, RuntimeObject* ___result0, const RuntimeMethod* method)
{
il2cpp_codegen_delegate_end_invoke((Il2CppAsyncResult*) ___result0, 0);
}
#ifdef __clang__
#pragma clang diagnostic pop
#endif
| [
"ionutputinicabz@gmail.com"
] | ionutputinicabz@gmail.com |
2ee5ddf3494b01d1e348d3673d38ee9a552ac0a6 | 50b48614c67693952500d1c4124f788ee643d1b4 | /Assignment 4/question 2 assignment 4.cpp | 292423a1b34df3fdf74ec7aa36055b6086791954 | [] | no_license | Noorfatimadev/Programming-Fundamentals-Semester-Assignments | 211b794b52348b03b66d0295a1aa2e0f178ebfa5 | 50bf2a4bae948f29a2c452340d9e8c8bf6f05bc9 | refs/heads/main | 2023-08-13T20:49:39.516773 | 2021-09-16T04:50:09 | 2021-09-16T04:50:09 | 406,918,592 | 1 | 0 | null | null | null | null | WINDOWS-1250 | C++ | false | false | 882 | cpp | /*
Senior salesperson is paid Rs. 400 a week, and a junior salesperson is paid Rs. 275 a week.
Write a program that accepts as input a salesperson’s status in the character variable status. IF
status is ‘s’ or ‘S’ the senior person’s salary should be displayed; if status is ‘j’ or ‘J’, the junior
person’s salary should be displayed, otherwise display error message.
*/
#include<iostream>
#include<iomanip>
using namespace std;
int main ()
{
char status;
cout<<"enter your sales person status :"<<endl;
cout<<"if senior enter S || if junior enter endl"<<endl;
cin>>status;
if (status=='S'|| status=='s')
{ cout<< "salary = 400 RS a week"<<endl;
}
else if (status=='J' || status=='j')
{cout<<"salary = 275 RS a week"<<endl;
}
else
{cout<<"wrong input : You can only enter J/j OR S/s"<<endl;
}
return 0;
}
| [
"noreply@github.com"
] | Noorfatimadev.noreply@github.com |
6681db0f9c7fff1a0f31e81abef08d88b6b052dd | 019a9c2de0eeccb4f31eecbeb0e91cc2db5404c2 | /CodeForces/680B - Bear and Finding Criminals.cpp | dc57644e9c6b0ffe3db976a8b8556cf89863f534 | [] | no_license | Prakhar-FF13/Competitive-Programming | 4e9bd1944a55b0b89ff21537e0960f058f1693fd | 3f0937475d2985da323e5ceb65b20dc458155e74 | refs/heads/master | 2023-01-09T05:09:27.574518 | 2023-01-04T11:32:01 | 2023-01-04T11:32:01 | 133,995,411 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 549 | cpp | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,a;
cin>>n>>a;
a--;
int arr[n];
for(int i = 0 ; i < n ; i++){
cin>>arr[i];
}
int left = a-1, right = a+1;
int cnt = (arr[a] == 1);
while(left >= 0 && right < n){
if(arr[left] == 1 && arr[right] == 1) cnt+=2;
left--;
right++;
}
while(left >= 0){
cnt += (arr[left] == 1);
left--;
}
while(right < n){
cnt += (arr[right] == 1);
right++;
}
cout<<cnt;
return 0;
}
| [
"prakhar.meerut@gmail.com"
] | prakhar.meerut@gmail.com |
9c044830d185d99f299b02e026b676fb821df7c4 | 3760b0d86a3f16efb85a3944a3fdc25114050c00 | /ViCon/NetworkSender.cpp | e23bd72a51829a6fcf69151c4a451252684beb86 | [] | no_license | luringens/ViCon | 726a7eb271ac5c000275889987cd6cc36a6bd83b | 70d6d012c15d2bf605426d416d6ce558721e24e0 | refs/heads/master | 2023-08-09T03:28:53.234517 | 2017-03-01T09:05:54 | 2017-03-01T09:10:47 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,215 | cpp | #include "NetworkSender.h"
#include <iostream>
#include <string>
NetworkSender::NetworkSender(const char* port, const char* host)
{
// Set hints (blanking to zero)
struct addrinfo hints, *result;
memset(&hints, 0, sizeof hints);
hints.ai_family = AF_UNSPEC;
hints.ai_socktype = SOCK_DGRAM;
// Get address info of recipient
auto rv = getaddrinfo(host, port, &hints, &result);
if (rv != 0) {
std::cerr << "getaddrinfo err: " << rv;
throw;
}
for (servinfo = result; servinfo != nullptr; servinfo = servinfo->ai_next)
{
mySocket = socket(servinfo->ai_family, servinfo->ai_socktype, servinfo->ai_protocol);
if (mySocket == -1) continue;
break;
}
if (servinfo == nullptr)
{
std::cerr << "socket err:";
throw;
}
}
void NetworkSender::Send(char* data, int length) const
{
auto total = 0; // how many bytes we've sent
auto bytesleft = length; // how many we have left to send
while (total < length)
{
auto numbytes = sendto(mySocket, data+total, bytesleft, 0,
servinfo->ai_addr, servinfo->ai_addrlen);
if (numbytes == -1) break;
total += numbytes;
bytesleft -= numbytes;
}
}
NetworkSender::~NetworkSender()
{
freeaddrinfo(servinfo);
closesocket(mySocket);
}
| [
"soltvedt.stian@gmail.com"
] | soltvedt.stian@gmail.com |
d58de5a98808ba83f4adb971ef14e28838935d58 | 667fd9708e38e78331d16a58634bee468c26ec0c | /kernel/mem/intel_page_mapper.h | 76f4bc0bcc3f2cec59a5c20b9434fdd85d2e40de | [] | no_license | jcredland/fos | 16ffb9ec5122994628e1503728b250662f815795 | 23030d095d7c917380a2533d6b690cdf0ab30890 | refs/heads/master | 2020-05-05T02:22:21.594508 | 2015-03-18T08:38:06 | 2015-03-18T08:38:06 | 31,543,774 | 8 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 8,853 | h | #pragma once
#include <klibrary/klibrary.h>
#include <mem/mem_layout.h>
#include <mem/physical.h>
/*
* From the intel documentation:
*
All three paging modes translate linear addresses use hierarchical paging structures.
This section provides an overview of their operation. Section 4.3, Section 4.4,
and Section 4.5 provide details for the three paging modes.
Every paging structure is 4096 Bytes in size and comprises a number of individual
entries. With 32-bit paging, each entry is 32 bits (4 bytes); there are thus
1024 entries in each structure. With PAE paging and IA-32e paging, each entry
is 64 bits (8 bytes); there are thus 512 entries in each structure. (PAE paging
includes one exception, a paging structure that is 32 bytes in size, containing
4 64-bit entries.)
The first paging structure used for any translation is located at the physical
address in CR3. A linear address is translated using the following iterative
procedure. A portion of the linear address (initially the uppermost bits) select
an entry in a paging structure (initially the one located using CR3). If that
entry references another paging structure, the process continues with that paging
structure and with the portion of the linear address immediately below that just
used. If instead the entry maps a page, the process completes: the physical address
in the entry is that of the page frame and the remaining lower portion of the
linear address is the page offset.
*/
/* The default mode is non-PAE paging. */
/** Short assembly routines. */
extern "C" {
void paging_enable();
void paging_set_address(uintptr_t); /* Sets CR3 register. */
};
template <typename T>
void check_page_alignment(T ptr)
{
uintptr_t p = (uintptr_t) ptr;
if ((p & 0xFFFFFF000) != p)
{
kerror("page alignment problem. halting.");
while (1) {}
}
}
/**
Page tables should be allocated as raw physical memory pages.
*/
class PageTable32
{
public:
PageTable32()
{
check_page_alignment(this);
}
struct Entry
{
Entry()
:
value(0)
{}
void set_physical_address(uintptr_t physical_address)
{
check_page_alignment(physical_address);
value = (value & 0xFFF) | physical_address;
}
void set_present(bool is_present)
{
if (is_present)
value = (value & 0xFFFFFFFE) | 1;
else
value = (value & 0xFFFFFFFE);
}
bool is_present() const
{
return (value & 0x1) == 1;
}
uint32 value;
};
Entry & operator[] (int index)
{
return data[index];
}
private:
/* Page aligned structure. */
Entry data[1024];
};
/** Must be aligned to a 4k page boundary. */
class PageDirectory32
{
public:
PageDirectory32()
{
check_page_alignment(this);
}
struct Entry
{
uint32 value;
PageTable32 * get_linked_table()
{
return reinterpret_cast<PageTable32 *>(value & 0xFFFFF000);
}
void set_linked_table(PageTable32 * physical_addr)
{
check_page_alignment(physical_addr);
value = (value & 0xFFF) | reinterpret_cast<uintptr_t>(physical_addr);
}
bool is_present() const
{
return (value & 0x1) == 1;
}
void set_present(bool is_present)
{
if (is_present)
value = (value & 0xFFFFFFFE) | 1;
else
value = (value & 0xFFFFFFFE);
}
};
Entry & operator[] (int index)
{
return data[index];
}
private:
Entry data[1024];
};
/**
* Paging manager deals with the configuration of an Intel processors virtual memory
* paging.
*
* Presumably there is not way of writing to a page table when it's not mapping into
* virtual memory space, but that the tables continue to operate even if they aren't
* accessible to the running code.
*
* So the first pages for the kernel need to be allocated with the physical memory
* manager into identity mapped space. After that we can just allocated from the
* kernel's heap.
*/
class IntelPageMapper
{
public:
IntelPageMapper()
{
page_dir = new ((PageDirectory32 *) pmem.get_4k_page(kPRangePageDirectory)) PageDirectory32();
}
void set_active()
{
::paging_set_address(reinterpret_cast<uintptr_t>(page_dir));
}
/**
* Calls a short asm routine to enable paging on the CPU.
*/
void enable_paging()
{
kdebug("paging: about to enable");
::paging_enable();
kdebug("paging: enabled");
}
/**
* Maps a linear address to a page.
*
* The physical_address must be page aligned.
*
* Returns the physical address of the page table that the memory allocation
* was assigned to. This might be useful information when setting up
* identity mapping.
*
* Returns nullptr if there was some kind of error.
*/
PageTable32 * map_page(uintptr_t linear_address, uintptr_t physical_address)
{
PageTable32 * table = nullptr;
auto & dir_entry = (*page_dir)[get_page_dir_index(linear_address)];
if (! dir_entry.is_present())
{
table = allocate_new_table();
if (! table)
return nullptr;
dir_entry.set_linked_table(table);
dir_entry.set_present(true);
}
else
{
table = dir_entry.get_linked_table();
}
auto & table_entry = (*table)[get_page_table_index(linear_address)];
table_entry.set_physical_address(physical_address);
table_entry.set_present(true);
return table;
}
/* Each table maps 4Mb. This function can be used to get empty PageTable32
* objects. */
PageTable32 * create_empty_table(int entry_number)
{
auto & dir_entry = (*page_dir)[entry_number];
if (dir_entry.is_present())
{
kerror("halted: empty table requested but was already mapped");
while (1) {}
}
PageTable32 * table = allocate_new_table();
if (! table)
return nullptr;
dir_entry.set_linked_table(table);
dir_entry.set_present(true);
return table;
}
void set_page_table_addr(int table_number, PageTable32 * address_of_table)
{
auto & dir_entry = (*page_dir)[table_number];
if (dir_entry.is_present())
{
kdebug("trying to set address of a page table that already exists. halted.");
while (1) {}
}
dir_entry.set_linked_table(address_of_table);
dir_entry.set_present(true);
}
PageTable32 * get_page_table_addr(int table_number) const
{
auto & dir_entry = (*page_dir)[table_number];
return dir_entry.get_linked_table();
}
void free_page(uintptr_t linear_address);
private:
PageTable32 * allocate_new_table()
{
/* Placement new for the page table object in an identity mapped part of the kernel
* memory space. */
return new ((PageTable32 *) pmem.get_4k_page(kPRangePageDirectory)) PageTable32();
}
/* INTEL: If a paging-structure entry maps a page when more than
12 bits remain in the linear address, the entry identifies
a page frame larger than 4 KBytes. For example, 32-bit
paging uses the upper 10 bits of a linear address to locate
the first paging-structure entry; 22 bits remain. */
uintptr_t get_page_dir_index(uintptr_t linear_address) const
{
return linear_address >> 22;
}
/* After this operation to get the next ten bits, only 12 bits
* remain. These are the offset into the physical page that
* this page table points to. */
uintptr_t get_page_table_index(uintptr_t linear_address) const
{
return (linear_address >> 12) & 0x3FF;
}
PageDirectory32 * page_dir;
F_NO_COPY(IntelPageMapper)
};
/** Rubicon Scala Fish. */
void page_fault_handler();
| [
"jim@cernproductions.com"
] | jim@cernproductions.com |
7434286203b565510202c6e9344f3abeaf545b06 | 8a6656dd0dea2836c9b7cc63a3282054960ceec2 | /epos_arm_control/src/imu_velocity_control3.cpp | 7e9bfa3e14a364cada49408a770c43628d9f5cbd | [] | no_license | 1-mr-robot/Epos4-Control | ea3b61005d8acf5cb3be92a124b801447dd6cac8 | 92237a923330e657082991724492d96f6f4f3348 | refs/heads/main | 2023-04-18T02:08:23.864852 | 2021-05-03T12:31:17 | 2021-05-03T12:31:17 | 343,724,829 | 2 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,235 | cpp | #include "ros/ros.h"
#include "epos4.h"
#include <epos_arm_control/epos.h>
#include <std_msgs/Float64MultiArray.h>
#include <std_msgs/Float64.h>
epos_arm_control::epos arm_control;
std_msgs::Float64MultiArray angle;
std_msgs::Float64 error;
std_msgs::Float64 error_prev;
void arrayCallback(const std_msgs::Float64MultiArray::ConstPtr& array)
{
angle=*array;
}
void moveArm(const epos_arm_control::epos::ConstPtr& params)
{
arm_control=*params;
}
int main(int argc, char **argv)
{
int lResult = MMC_FAILED;
unsigned int ulErrorCode = 0;
long error_inc;
float proportional;
float derivative;
// Print maxon headerline
PrintHeader();
// Set parameter for usb IO operation
SetDefaultParameters();
//Print default parameters
PrintSettings3();
// open device
if((lResult = OpenDevice3(&ulErrorCode))!=MMC_SUCCESS)
{
LogError("OpenDevice3", lResult, ulErrorCode);
return lResult;
}
// VCS_ClearFault(g_pKeyHandle3, g_usNodeId3, &ulErrorCode);
// printf("Fault Cleared");
// set enable state
if((lResult = SetEnableState(g_pKeyHandle3,g_usNodeId3,&ulErrorCode))!=MMC_SUCCESS)
{
LogError("EnableState", lResult, ulErrorCode);
return lResult;
}
if((lResult = ActivateProfileVelocityMode(g_pKeyHandle3,g_usNodeId3,&ulErrorCode))!=MMC_SUCCESS)
{
LogError("Activate Mode", lResult, ulErrorCode);
return lResult;
}
// get_VelocityProfile(g_pKeyHandle,g_usNodeId,&ulErrorCode);
ros::init(argc, argv, "epos_imu_velocity3");
ros::NodeHandle n;
ros::Publisher pub=n.advertise<std_msgs::Float64>("pid_position",1000);
ros::Rate loop_rate(200);
ros::Subscriber sub1 = n.subscribe("flexion_angle", 1000, arrayCallback);
ros::Subscriber sub = n.subscribe("exoskel_control", 1000, moveArm);
while(ros::ok())
{
// printf("Entered while loop");
if(arm_control.mode == 1)
{
stringstream msg;
int absolute=1;
int relative=0;
float Kp=15;
float Kd=0.0003;
int current_velocity;
long desired_velocity;
msg << "move to position = " << (long)arm_control.angle << ", node = " << g_usNodeId3<<"\n";
LogInfo(msg.str());
error.data=(arm_control.angle-angle.data[1]);
proportional=Kp*error.data;
derivative=Kd*((error.data-error_prev.data)/0.005);
error_prev.data=error.data;
desired_velocity=-(proportional+derivative);
if(desired_velocity>400)
{
desired_velocity=400;
}
else if (desired_velocity<-400)
{
desired_velocity=-400;
}
printf("error= %lf \n",error.data);
if(angle.data[1]>arm_control.angle-0.2 && angle.data[1]<arm_control.angle+0.2)
{
HaltVelocity(g_pKeyHandle3,g_usNodeId3);
}
else
{
MoveWithVelocity(g_pKeyHandle3, g_usNodeId3,desired_velocity,&ulErrorCode);
get_velocity(g_pKeyHandle3,g_usNodeId3,¤t_velocity,&ulErrorCode);
}
}
pub.publish(error);
ros::spinOnce();
}
// ros::spin();
//disable epos
SetDisableState(g_pKeyHandle3, g_usNodeId3, &ulErrorCode);
//close device
if((lResult = CloseDevice3(&ulErrorCode))!=MMC_SUCCESS)
{
LogError("CloseDevice3", lResult, ulErrorCode);
return lResult;
}
return 0;
} | [
"dhyan.bohra@gmail.com"
] | dhyan.bohra@gmail.com |
4b4992ae028622524e99882743f73a627f151d23 | aae79375bee5bbcaff765fc319a799f843b75bac | /atcoder/arc_083/b.cpp | e201e3983723d3e1dc7faaf693f944836e44fb3b | [] | no_license | firewood/topcoder | b50b6a709ea0f5d521c2c8870012940f7adc6b19 | 4ad02fc500bd63bc4b29750f97d4642eeab36079 | refs/heads/master | 2023-08-17T18:50:01.575463 | 2023-08-11T10:28:59 | 2023-08-11T10:28:59 | 1,628,606 | 21 | 6 | null | null | null | null | UTF-8 | C++ | false | false | 238 | cpp | // B.
#include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int n, k, x, ans = 0;
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> x;
ans += min(x, abs(x - k)) * 2;
}
cout << ans << endl;
return 0;
}
| [
"karamaki@gmail.com"
] | karamaki@gmail.com |
47672f30fc0db0b3cae2c64dd9aa9d991ba15463 | 1741a8daf997608e9756c5cdee3391db030da3a0 | /svr/hall/src/HallHandlerProxy.cpp | 04a9266c96e2df4294742018b68def9975241826 | [] | no_license | Michael-Z/coins_ddz | 5cf13aa192cecde0b897a60c47dbfc7911fbba90 | 7fe015952ad7b7e0525eaaceb80c0c9ffbfe2864 | refs/heads/master | 2020-04-10T14:18:13.992316 | 2018-10-10T06:27:04 | 2018-10-10T06:27:04 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,083 | cpp | #include "HallHandlerProxy.h"
#include "global.h"
#include "Packet.h"
#include "ProcesserManager.h"
#include "SessionManager.h"
#include "HandlerManager.h"
#include "HallHandlerToken.h"
CPacketDecoder HallHandlerProxy::_decoder;
int HallHandlerProxy::OnAttachPoller(CTCPSocketHandler * phandler)
{
if (phandler->_decode == NULL)
{
phandler->_decode = &_decoder;
}
assert(phandler->_decode);
phandler->EnableInput();
return 0;
}
int HallHandlerProxy::OnConnected(CTCPSocketHandler * phandler)
{
//句柄被Accept后触发
//todo 为了防止内存泄漏 应该先检测一下 handler是否已经绑定过
phandler->EnableReconnect();
HallHandlerToken * ptoken = new HallHandlerToken(phandler);
HandlerManager::Instance()->BindHandlerToken(phandler, ptoken);
return 0;
}
int HallHandlerProxy::OnConnectedByRequest(CTCPSocketHandler * phandler)
{
HallHandlerToken * ptoken = new HallHandlerToken(phandler);
HandlerManager::Instance()->BindHandlerToken(phandler, ptoken);
return 0;
}
int HallHandlerProxy::OnClose(CTCPSocketHandler * phandler)
{
//HandlerManager::Instance()->UnBindHandlerToken(phandler);
return 0;
}
int HallHandlerProxy::ProcessPacket(HallHandlerToken * ptoken, const PBHead & head, const PBCSMsg & msg, const PBRoute & route)
{
VLogMsg(CLIB_LOG_LEV_DEBUG, "Process Packet[cmd:0x%x] From[%d]", msg.msg_union_case(), route.source());
CSession * psession = NULL;
switch (route.source())
{
case EN_Node_Client:
psession = SessionManager::Instance()->AllocSession();
if (psession == NULL)
{
return 0;
}
psession->_head.CopyFrom(head);
psession->_request_msg.CopyFrom(msg);
psession->set_msgtype(EN_Node_Client);
psession->_message_logic_type = EN_Message_Request;
//psession->_head.set_session_cmd(head.cmd());
psession->set_request_cmd(head.cmd());
break;
default:
if (route.mtype() == EN_Message_Response)
{
int session_id = route.session_id();
psession = SessionManager::Instance()->GetSession(session_id);
if (psession == NULL)
{
ErrMsg("failed to found session[%d] cmd[0x%x].", session_id, msg.msg_union_case());
return 0;
}
psession->_response_msg.CopyFrom(msg);
psession->_response_route.CopyFrom(route);
psession->set_msgtype(route.source());
psession->AddResponseMsg(msg);
}
else if (route.mtype() == EN_Message_Request)
{
psession = SessionManager::Instance()->AllocSession();
if (psession == NULL)
{
return 0;
}
psession->_head.CopyFrom(head);
psession->_request_msg.CopyFrom(msg);
psession->_request_route.CopyFrom(route);
psession->set_msgtype(route.source());
long long uid = psession->_request_route.uid();
psession->_uid = uid;
if (route.has_session_id() && route.session_id() >= 0)
{
psession->set_request_sessionid(route.session_id());
}
//psession->_head.set_session_cmd(head.cmd());
psession->set_request_cmd(head.cmd());
}
else
{
ErrMsg("fatal error. invalid message type[%d] cmd[0x%x]", route.mtype(), msg.msg_union_case());
return 0;
}
psession->_message_logic_type = route.mtype();
break;
}
ProcesserManager::Instance()->Process(ptoken, psession);
return 0;
}
int HallHandlerProxy::OnPacketComplete(CTCPSocketHandler * phandler, const char * data, int len)
{
HallHandlerToken * ptoken = (HallHandlerToken *)HandlerManager::Instance()->GetHandlerToken(phandler);
if (ptoken == NULL)
{
VLogMsg(CLIB_LOG_LEV_ERROR, "fatal error.failed to find token for handler.");
return 0;
}
CPBInputPacket pb_input;
if (!pb_input.Copy(data, len))
{
VLogMsg(CLIB_LOG_LEV_ERROR, "fatal error.copy failed.");
return 0;
}
PBRoute route;
if (!pb_input.DecodeProtoRoute(route))
{
ErrMsg("session process packet route failed.request by client[ip:%s,port:%d]", phandler->_sip.c_str(), phandler->_port);
return 0;
}
PBHead head;
if (!pb_input.DecodeProtoHead(head))
{
ErrMsg("session process packet head failed.request by client[ip:%s,port:%d]", phandler->_sip.c_str(), phandler->_port);
return 0;
}
PBCSMsg msg;
if (!pb_input.DecodeProtoMsg(msg))
{
ErrMsg("session process packet msg failed.request by client[ip:%s,port:%d] . cmd[0x%lx] . from[%d,%d]",
phandler->_sip.c_str(), phandler->_port, head.cmd(), route.source(), route.source_id());
return 0;
}
return ProcessPacket(ptoken, head, msg, route);
}
int HallHandlerProxy::OnProcessOnTimerOut(CTCPSocketHandler * phandler, int Timerid)
{
return 0;
} | [
"Administrator@PV-X00179798"
] | Administrator@PV-X00179798 |
b37a5dcbe93be479cd68f0592ac52b1d08062ad9 | 6b40e9dccf2edc767c44df3acd9b626fcd586b4d | /NT/base/wmi/cimmap/testinfo.cpp | f6a7e4ce64e3b048a4475186325dc40f9821db33 | [] | no_license | jjzhang166/WinNT5_src_20201004 | 712894fcf94fb82c49e5cd09d719da00740e0436 | b2db264153b80fbb91ef5fc9f57b387e223dbfc2 | refs/heads/Win2K3 | 2023-08-12T01:31:59.670176 | 2021-10-14T15:14:37 | 2021-10-14T15:14:37 | 586,134,273 | 1 | 0 | null | 2023-01-07T03:47:45 | 2023-01-07T03:47:44 | null | UTF-8 | C++ | false | false | 33,452 | cpp | //***************************************************************************
//
// TestInfo.CPP
//
// Module: CDM Provider
//
// Purpose: Defines the CClassPro class. An object of this class is
// created by the class factory for each connection.
//
// Copyright (c) 2000 Microsoft Corporation
//
//***************************************************************************
#include <objbase.h>
#ifndef _MT
#define _MT
#endif
#include <wbemidl.h>
#include "debug.h"
#include "useful.h"
#include "wbemmisc.h"
#include "testinfo.h"
#include "cimmap.h"
#include "text.h"
IWbemServices *pCimServices;
IWbemServices *pWdmServices;
HRESULT TestInfoInitialize(
void
)
/*+++
Routine Description:
This routine will establishes a connection to the root\wmi and
root\cimv2 namespaces in global memory
Arguments:
Return Value:
HRESULT
---*/
{
HRESULT hr;
WmipAssert(pCimServices == NULL);
WmipAssert(pWdmServices == NULL);
hr = WmiConnectToWbem(L"root\\cimv2",
&pCimServices);
if (hr == WBEM_S_NO_ERROR)
{
hr = WmiConnectToWbem(L"root\\wmi",
&pWdmServices);
if (hr != WBEM_S_NO_ERROR)
{
pCimServices->Release();
pCimServices = NULL;
}
}
return(hr);
}
void TestInfoDeinitialize(
void
)
/*+++
Routine Description:
This routine will disestablish a connection to the root\wmi and
root\cimv2 namespaces in global memory
Arguments:
Return Value:
---*/
{
WmipAssert(pCimServices != NULL);
WmipAssert(pWdmServices != NULL);
pCimServices->Release();
pCimServices = NULL;
pWdmServices->Release();
pWdmServices = NULL;
}
CWdmClass::CWdmClass()
/*+++
Routine Description:
Constructor for CWdmClass class
Arguments:
Return Value:
---*/
{
Next = NULL;
Prev = NULL;
WdmShadowClassName = NULL;
WdmMappingClassName = NULL;
WdmMappingProperty = NULL;
CimClassName = NULL;
CimMappingClassName = NULL;
CimMappingProperty = NULL;
PnPDeviceIds = NULL;
FriendlyName = NULL;
DeviceDesc = NULL;
CimMapRelPaths = NULL;
WdmRelPaths = NULL;
CimInstances = NULL;
RelPathCount = (int)-1;
DerivationType = UnknownDerivation;
//
// Start out with the class marked as not having instances
// availabel
//
MappingInProgress = 1;
}
CWdmClass::~CWdmClass()
/*+++
Routine Description:
Destructor for CWdmClass class
Arguments:
Return Value:
---*/
{
int i;
if (WdmShadowClassName != NULL)
{
SysFreeString(WdmShadowClassName);
}
if (WdmMappingClassName != NULL)
{
SysFreeString(WdmMappingClassName);
}
if (WdmMappingProperty != NULL)
{
SysFreeString(WdmMappingProperty);
}
if (CimMappingClassName != NULL)
{
SysFreeString(CimMappingClassName);
}
if (CimClassName != NULL)
{
SysFreeString(CimClassName);
}
if (CimMappingProperty != NULL)
{
SysFreeString(CimMappingProperty);
}
if (WdmMappingProperty != NULL)
{
SysFreeString(WdmMappingProperty);
}
if (CimMapRelPaths != NULL)
{
delete CimMapRelPaths;
}
if (WdmRelPaths != NULL)
{
delete WdmRelPaths;
}
if (CimInstances != NULL)
{
delete CimInstances;
}
if (PnPDeviceIds != NULL)
{
delete PnPDeviceIds;
}
if (FriendlyName != NULL)
{
delete FriendlyName;
}
if (DeviceDesc != NULL)
{
delete DeviceDesc;
}
}
IWbemServices *CWdmClass::GetWdmServices(
void
)
/*+++
Routine Description:
Accessor for the WDM namespace IWbemServices
Arguments:
Return Value:
IWbemServices
---*/
{
WmipAssert(pWdmServices != NULL);
return(pWdmServices);
}
IWbemServices *CWdmClass::GetCimServices(
void
)
/*+++
Routine Description:
Accessor for the CIM namespace IWbemServices
Arguments:
Return Value:
IWbemServices
---*/
{
WmipAssert(pCimServices != NULL);
return(pCimServices);
}
HRESULT CWdmClass::DiscoverPropertyTypes(
IWbemContext *pCtx,
IWbemClassObject *pCimClassObject
)
{
HRESULT hr, hrDontCare;
VARIANT v;
BSTR PropertyName;
ULONG Count;
IWbemQualifierSet *pQualifierList;
WmipAssert(pCimClassObject != NULL);
if (DerivationType == ConcreteDerivation)
{
//
// For a concrete derivation, get all of the key properties
// from the superclass so we can populate them too
//
hr = pCimClassObject->BeginEnumeration(WBEM_FLAG_KEYS_ONLY);
if (hr == WBEM_S_NO_ERROR)
{
//
// TODO: Make CBstrArray allocation dynamic
//
PropertyList.Initialize(10);
Count = 0;
do
{
hr = pCimClassObject->Next(0,
&PropertyName,
NULL,
NULL,
NULL);
if (hr == WBEM_S_NO_ERROR)
{
PropertyList.Set(Count++, PropertyName);
} else if (hr == WBEM_S_NO_MORE_DATA) {
//
// This signifies the end of the enumerations
//
hr = WBEM_S_NO_ERROR;
break;
}
} while (hr == WBEM_S_NO_ERROR);
pCimClassObject->EndEnumeration();
}
} else if (DerivationType == NonConcreteDerivation) {
//
// TODO: Figure out how we want to create the list of
// superclass properties to fill
//
PropertyList.Initialize(1);
hr = WBEM_S_NO_ERROR;
}
return(hr);
}
HRESULT CWdmClass::InitializeSelf(
IWbemContext *pCtx,
PWCHAR CimClass
)
{
HRESULT hr;
VARIANT v, vSuper;
IWbemClassObject *pClass;
IWbemQualifierSet *pQualifiers;
PWCHAR Names[6];
VARTYPE Types[6];
VARIANT Values[6];
WmipAssert(CimClass != NULL);
WmipAssert(CimMappingClassName == NULL);
WmipAssert(WdmShadowClassName == NULL);
WmipAssert(CimClassName == NULL);
//
// We assume that this method will always be the first one called
// by the class provider
//
EnterCritSection();
if ((pCimServices == NULL) &&
(pWdmServices == NULL))
{
hr = TestInfoInitialize();
if (hr != WBEM_S_NO_ERROR)
{
LeaveCritSection();
WmipDebugPrint(("WMIMAP: TestInfoInitialize -> %x\n", hr));
return(hr);
}
}
LeaveCritSection();
CimClassName = SysAllocString(CimClass);
if (CimClassName != NULL)
{
//
// Get the WdmShadowClass class qualifier to discover the name of
// the Wdm class that is represented by this cim class
//
hr = GetCimServices()->GetObject(CimClassName,
WBEM_FLAG_USE_AMENDED_QUALIFIERS,
pCtx,
&pClass,
NULL);
if (hr == WBEM_S_NO_ERROR)
{
//
// See if this is a derived class or not
//
VariantInit(&vSuper);
hr = WmiGetProperty(pClass,
SUPERCLASS,
CIM_STRING,
&vSuper);
if (hr == WBEM_S_NO_ERROR)
{
hr = pClass->GetQualifierSet(&pQualifiers);
if (hr == WBEM_S_NO_ERROR)
{
Names[0] = WDM_SHADOW_CLASS;
Types[0] = VT_BSTR;
Names[1] = WDM_MAPPING_CLASS;
Types[1] = VT_BSTR;
Names[2] = WDM_MAPPING_PROPERTY;
Types[2] = VT_BSTR;
Names[3] = CIM_MAPPING_CLASS;
Types[3] = VT_BSTR;
Names[4] = CIM_MAPPING_PROPERTY;
Types[4] = VT_BSTR;
Names[5] = DERIVED_CLASS_TYPE;
Types[5] = VT_BSTR;
hr = GetListOfQualifiers(pQualifiers,
6,
Names,
Types,
Values,
FALSE);
if (hr == WBEM_S_NO_ERROR)
{
//
// First determine if this is a concrete or non
// concrete derivation
//
if (Values[5].vt == VT_BSTR)
{
if (_wcsicmp(Values[5].bstrVal, CONCRETE) == 0)
{
DerivationType = ConcreteDerivation;
} else if (_wcsicmp(Values[5].bstrVal, NONCONCRETE) == 0)
{
DerivationType = NonConcreteDerivation;
}
}
if (DerivationType == UnknownDerivation)
{
//
// Must specify derivation type
//
hr = WBEM_E_AMBIGUOUS_OPERATION;
WmipDebugPrint(("WMIMAP: class %ws must specify derivation type\n",
CimClass));
} else {
if (Values[3].vt == VT_BSTR)
{
//
// Use CimMappingClass as specified
//
CimMappingClassName = Values[3].bstrVal;
VariantInit(&Values[3]);
} else {
//
// CimMappingClass not specified, use
// superclass as mapping class
//
CimMappingClassName = vSuper.bstrVal;
VariantInit(&vSuper);
}
if (Values[0].vt == VT_BSTR)
{
//
// WdmShadowClass is required
//
WdmShadowClassName = Values[0].bstrVal;
VariantInit(&Values[0]);
if (Values[1].vt == VT_BSTR)
{
//
// WdmMappingClass can specify that
// the mapping class is different
// from the shadow class
//
WdmMappingClassName = Values[1].bstrVal;
VariantInit(&Values[1]);
}
if (Values[2].vt == VT_BSTR)
{
WdmMappingProperty = Values[2].bstrVal;
VariantInit(&Values[2]);
}
if (Values[4].vt == VT_BSTR)
{
CimMappingProperty = Values[4].bstrVal;
VariantInit(&Values[4]);
if (WdmMappingProperty == NULL)
{
//
// If CimMappingProperty
// specified then
// WdmMappingProperty is
// required
//
hr = WBEM_E_INVALID_CLASS;
}
} else {
if (WdmMappingProperty != NULL)
{
//
// If CimMappingProperty is not
// specified then
// WdmMappingProperty should
// not be specified
//
hr = WBEM_E_INVALID_CLASS;
}
}
if (hr == WBEM_S_NO_ERROR)
{
//
// Look at all properties to discover which ones
// need to be handled
//
hr = DiscoverPropertyTypes(pCtx,
pClass);
}
} else {
//
// WDMShadowClass qualifier is required
//
hr = WBEM_E_INVALID_CLASS;
}
}
VariantClear(&Values[0]);
VariantClear(&Values[1]);
VariantClear(&Values[2]);
VariantClear(&Values[3]);
VariantClear(&Values[4]);
VariantClear(&Values[5]);
}
pQualifiers->Release();
}
VariantClear(&vSuper);
} else {
//
// No superclass implies no derivation
//
DerivationType = NoDerivation;
hr = WBEM_S_NO_ERROR;
}
pClass->Release();
}
} else {
hr = WBEM_E_OUT_OF_MEMORY;
}
return(hr);
}
HRESULT CWdmClass::RemapToCimClass(
IWbemContext *pCtx
)
/*+++
Routine Description:
This routine will setup this class and initialize everything so
that the provider can interact with the CDM and WDM classes
Arguments:
CdmClass is the name of the CDM class
Return Value:
HRESULT
---*/
{
CBstrArray WdmInstanceNames;
CBstrArray *WdmPaths;
CBstrArray *CimPaths;
CBstrArray *CimMapPaths;
IWbemClassObject *CimInstance;
HRESULT hr;
int i;
WmipAssert(CimMappingClassName != NULL);
WmipAssert(WdmShadowClassName != NULL);
//
// Increment this to indicate that mapping is in progress and thus
// there are no instances available. Consider changing this to some
// kind of synchronization mechanism
//
IncrementMappingInProgress();
//
// Free rel path bstr arrays
//
if (CimMapRelPaths != NULL)
{
delete CimMapRelPaths;
}
if (CimInstances != NULL)
{
delete CimInstances;
}
if (WdmRelPaths != NULL)
{
delete WdmRelPaths;
}
//
// allocate new rel paths
//
CimMapRelPaths = new CBstrArray;
WdmRelPaths = new CBstrArray;
CimInstances = new CWbemObjectList;
PnPDeviceIds = new CBstrArray;
FriendlyName = new CBstrArray;
DeviceDesc = new CBstrArray;
if ((CimMapRelPaths != NULL) &&
(CimInstances != NULL) &&
(PnPDeviceIds != NULL) &&
(FriendlyName != NULL) &&
(DeviceDesc != NULL) &&
(WdmRelPaths != NULL))
{
if ((WdmMappingProperty == NULL) &&
(CimMappingProperty == NULL))
{
//
// Use worker function to determine which
// Wdm relpaths map to which CIM_LogicalDevice relpaths
// via the PnP ids
//
hr = MapWdmClassToCimClassViaPnpId(pCtx,
pWdmServices,
pCimServices,
WdmShadowClassName,
CimMappingClassName,
PnPDeviceIds,
FriendlyName,
DeviceDesc,
&WdmInstanceNames,
WdmRelPaths,
CimMapRelPaths,
&RelPathCount);
} else {
//
// Use worker function to map WDM relpaths to CIM relpaths
// using a common property in both classes
//
hr = MapWdmClassToCimClassViaProperty(pCtx,
pWdmServices,
pCimServices,
WdmShadowClassName,
WdmMappingClassName ?
WdmMappingClassName :
WdmShadowClassName,
WdmMappingProperty,
CimMappingClassName,
CimMappingProperty,
&WdmInstanceNames,
WdmRelPaths,
CimMapRelPaths,
&RelPathCount);
}
if (hr == WBEM_S_NO_ERROR)
{
//
// Collect the relpaths for our cim instances that we are
// providing. Best way to do this is to create our instances
//
CimInstances->Initialize(RelPathCount);
for (i = 0; i < RelPathCount; i++)
{
WmipDebugPrint(("WMIMAP: %ws maps to %ws\n",
WdmRelPaths->Get(i),
CimMapRelPaths->Get(i)));
hr = CreateCimInstance(pCtx,
i,
&CimInstance);
if (hr == WBEM_S_NO_ERROR)
{
hr = CimInstances->Set(i,
CimInstance);
if (hr != WBEM_S_NO_ERROR)
{
break;
}
} else {
break;
}
}
}
}
if (hr != WBEM_S_NO_ERROR)
{
delete CimMapRelPaths;
CimMapRelPaths = NULL;
delete WdmRelPaths;
WdmRelPaths = NULL;
delete CimInstances;
CimInstances = NULL;
}
DecrementMappingInProgress();
return(hr);
}
HRESULT CWdmClass::WdmPropertyToCimProperty(
IN IWbemClassObject *pCdmClassInstance,
IN IWbemClassObject *pWdmClassInstance,
IN BSTR PropertyName,
IN OUT VARIANT *PropertyValue,
IN CIMTYPE CdmCimType,
IN CIMTYPE WdmCimType
)
/*+++
Routine Description:
This routine will convert a property in a Wdm class into the form
required for the property in the Cdm class.
Arguments:
pCdmClassInstance is the instnace of the Cdm class that will get
the property value
pWdmClassInstance is the instance of the Wdm class that has the
property value
PropertyName is the name of the property in the Wdm and Cdm classes
PropertyValue on entry has the value of the property in the Wdm
instance and on return has the value to set in the Cdm instance
CdmCimType is the property type for the property in the Cdm
instance
WdmCimType is the property type for the property in the Wdm
instance
Return Value:
HRESULT
---*/
{
HRESULT hr;
CIMTYPE BaseWdmCimType, BaseCdmCimType;
CIMTYPE WdmCimArray, CdmCimArray;
WmipAssert(pCdmClassInstance != NULL);
WmipAssert(pWdmClassInstance != NULL);
WmipAssert(PropertyName != NULL);
WmipAssert(PropertyValue != NULL);
WmipAssert(IsThisInitialized());
//
// Rules for converting Wdm Classes into Cdm Classes
// Wdm Class Type Cdm Class Type Conversion Done
// enumeration string Build string from enum
//
BaseWdmCimType = WdmCimType & ~CIM_FLAG_ARRAY;
BaseCdmCimType = CdmCimType & ~CIM_FLAG_ARRAY;
WdmCimArray = WdmCimType & CIM_FLAG_ARRAY;
CdmCimArray = CdmCimType & CIM_FLAG_ARRAY;
if (((BaseWdmCimType == CIM_UINT32) ||
(BaseWdmCimType == CIM_UINT16) ||
(BaseWdmCimType == CIM_UINT8)) &&
(BaseCdmCimType == CIM_STRING) &&
(WdmCimArray == CdmCimArray) &&
(PropertyValue->vt != VT_NULL))
{
CValueMapping ValueMapping;
hr = ValueMapping.EstablishByName(GetWdmServices(),
WdmShadowClassName,
PropertyName);
if (hr == WBEM_S_NO_ERROR)
{
hr = ValueMapping.MapVariantToString(PropertyValue,
WdmCimType);
}
} else {
//
// No conversion needs to occur
//
hr = WBEM_S_NO_ERROR;
}
return(hr);
}
HRESULT CWdmClass::CimPropertyToWdmProperty(
IN IWbemClassObject *pWdmClassInstance,
IN IWbemClassObject *pCdmClassInstance,
IN BSTR PropertyName,
IN OUT VARIANT *PropertyValue,
IN CIMTYPE WdmCimType,
IN CIMTYPE CdmCimType
)
/*+++
Routine Description:
This routine will convert a property in a Cdm class into the form
required for the property in the Wdm class.
Arguments:
pWdmClassInstance is the instance of the Wdm class that has the
property value
pCdmClassInstance is the instnace of the Cdm class that will get
the property value
PropertyName is the name of the property in the Wdm and Cdm classes
PropertyValue on entry has the value of the property in the Wdm
instance and on return has the value to set in the Cdm instance
WdmCimType is the property type for the property in the Wdm
instance
CdmCimType is the property type for the property in the Cdm
instance
Return Value:
HRESULT
---*/
{
HRESULT hr;
CIMTYPE BaseWdmCimType, BaseCdmCimType;
CIMTYPE WdmCimArray, CdmCimArray;
WmipAssert(pCdmClassInstance != NULL);
WmipAssert(pWdmClassInstance != NULL);
WmipAssert(PropertyName != NULL);
WmipAssert(PropertyValue != NULL);
WmipAssert(IsThisInitialized());
//
// Rules for converting Wdm Classes into Cdm Classes
// Wdm Class Type Cdm Class Type Conversion Done
// enumeration string Map string to enum value
//
//
BaseWdmCimType = WdmCimType & ~CIM_FLAG_ARRAY;
BaseCdmCimType = CdmCimType & ~CIM_FLAG_ARRAY;
WdmCimArray = WdmCimType & CIM_FLAG_ARRAY;
CdmCimArray = CdmCimType & CIM_FLAG_ARRAY;
if (((BaseWdmCimType == CIM_UINT32) ||
(BaseWdmCimType == CIM_UINT16) ||
(BaseWdmCimType == CIM_UINT8)) &&
(BaseCdmCimType == CIM_STRING) &&
(WdmCimArray == CdmCimArray) &&
(PropertyValue->vt != VT_NULL))
{
CValueMapping ValueMapping;
hr = ValueMapping.EstablishByName(GetWdmServices(),
WdmShadowClassName,
PropertyName);
if (hr == WBEM_S_NO_ERROR)
{
hr = ValueMapping.MapVariantToNumber(PropertyValue,
(VARTYPE)BaseWdmCimType);
}
} else {
//
// No conversion needs to occur
//
hr = WBEM_S_NO_ERROR;
}
return(hr);
}
HRESULT CWdmClass::CopyBetweenCimAndWdmClasses(
IN IWbemClassObject *pDestinationInstance,
IN IWbemClassObject *pSourceInstance,
IN BOOLEAN WdmToCdm
)
/*+++
Routine Description:
This routine will do the work to copy and convert all properties in
an instance of a Wdm or Cdm class to an instance of a Cdm or Wdm
class.
Note that properties from one instance are only copied to
properties of another instance when the property names are
identical. No assumption is ever made on the name of the
properties. The only info used to determine how to convert a
property is based upon the source and destination cim type.
Arguments:
pDestinationInstance is the class instance that the properties will
be copied into
pSourceInstance is the class instance that the properties will be
copied from
WdmToCdm is TRUE if copying from Wdm to Cdm, else FALSE
Return Value:
HRESULT
---*/
{
HRESULT hr;
VARIANT PropertyValue;
BSTR PropertyName;
CIMTYPE SourceCimType, DestCimType;
HRESULT hrDontCare;
WmipAssert(pDestinationInstance != NULL);
WmipAssert(pSourceInstance != NULL);
WmipAssert(IsThisInitialized());
//
// Now we need to move over all of the properties from the source
// class into the destination class. Note that some properties need
// some special effort such as OtherCharacteristics which needs
// to be converted from an enumeration value (in wdm) to a
// string (in CDM).
//
// Our strategy is to enumerate all of the proeprties in the
// source class and then look for a property with the same name
// and type in the destination class. If so we just copy over the
// value. If the data type is different we need to do some
// conversion.
//
hr = pSourceInstance->BeginEnumeration(WBEM_FLAG_NONSYSTEM_ONLY);
if (hr == WBEM_S_NO_ERROR)
{
do
{
//
// Get a property from the source class
//
hr = pSourceInstance->Next(0,
&PropertyName,
&PropertyValue,
&SourceCimType,
NULL);
if (hr == WBEM_S_NO_ERROR)
{
//
// Try to get a property with the same name from the
// dest class. If the identically named property does
// not exist in the destination class then it is ignored
//
hrDontCare = pDestinationInstance->Get(PropertyName,
0,
NULL,
&DestCimType,
NULL);
if (hrDontCare == WBEM_S_NO_ERROR)
{
if (WdmToCdm)
{
hr = WdmPropertyToCimProperty(pDestinationInstance,
pSourceInstance,
PropertyName,
&PropertyValue,
DestCimType,
SourceCimType);
} else {
hr = CimPropertyToWdmProperty(pDestinationInstance,
pSourceInstance,
PropertyName,
&PropertyValue,
DestCimType,
SourceCimType);
}
if (hr == WBEM_S_NO_ERROR)
{
//
// Try to place the transformed property into the
// destination class.
//
hr = pDestinationInstance->Put(PropertyName,
0,
&PropertyValue,
0);
}
}
SysFreeString(PropertyName);
VariantClear(&PropertyValue);
} else if (hr == WBEM_S_NO_MORE_DATA) {
//
// This signifies the end of the enumerations
//
hr = WBEM_S_NO_ERROR;
break;
}
} while (hr == WBEM_S_NO_ERROR);
pSourceInstance->EndEnumeration();
}
return(hr);
}
HRESULT CWdmClass::FillInCimInstance(
IN IWbemContext *pCtx,
IN int RelPathIndex,
IN OUT IWbemClassObject *pCimInstance,
IN IWbemClassObject *pWdmInstance
)
{
IWbemClassObject *pSuperInstance;
ULONG Count;
ULONG i;
BSTR Property;
VARIANT v;
HRESULT hr, hrDontCare;
CIMTYPE CimType;
BSTR s;
WmipAssert(RelPathIndex < RelPathCount);
WmipAssert(pCimInstance != NULL);
WmipAssert(pWdmInstance != NULL);
switch (DerivationType)
{
case ConcreteDerivation:
{
//
// We derived from a concrete class, so we need to duplicate
// the key properties
//
hr = GetCimServices()->GetObject(CimMapRelPaths->Get(RelPathIndex),
0,
pCtx,
&pSuperInstance,
NULL);
if (hr == WBEM_S_NO_ERROR)
{
Count = PropertyList.GetListSize();
for (i = 0; (i < Count) && (hr == WBEM_S_NO_ERROR); i++)
{
Property = PropertyList.Get(i);
WmipDebugPrint(("WMIMAP: Concrete Property %ws\n", Property));
if (Property != NULL)
{
hr = pSuperInstance->Get(Property,
0,
&v,
&CimType,
NULL);
if (hr == WBEM_S_NO_ERROR)
{
hr = pCimInstance->Put(Property,
0,
&v,
CimType);
VariantClear(&v);
}
}
}
pSuperInstance->Release();
}
break;
}
case NonConcreteDerivation:
{
//
// We derived from a non concrete class, so we need to fill
// in any properties from the super class that we feel we
// should. The list includes
// Description (from FriendlyName device property)
// Caption (from DeviceDesc device property)
// Name (From DeviceDesc device property)
// Status (always OK)
// PNPDeviceID
//
if (PnPDeviceIds != NULL)
{
s = PnPDeviceIds->Get(RelPathIndex);
v.vt = VT_BSTR;
v.bstrVal = s;
hrDontCare = pCimInstance->Put(PNP_DEVICE_ID,
0,
&v,
0);
}
if (FriendlyName != NULL)
{
s = FriendlyName->Get(RelPathIndex);
if (s != NULL)
{
v.vt = VT_BSTR;
v.bstrVal = s;
hrDontCare = pCimInstance->Put(DESCRIPTION,
0,
&v,
0);
}
}
if (DeviceDesc != NULL)
{
s = DeviceDesc->Get(RelPathIndex);
if (s != NULL)
{
v.vt = VT_BSTR;
v.bstrVal = s;
hrDontCare = pCimInstance->Put(NAME,
0,
&v,
0);
hrDontCare = pCimInstance->Put(CAPTION,
0,
&v,
0);
}
}
s = SysAllocString(OK);
if (s != NULL)
{
v.vt = VT_BSTR;
v.bstrVal = s;
hrDontCare = pCimInstance->Put(STATUS,
0,
&v,
0);
SysFreeString(s);
}
break;
}
case NoDerivation:
{
//
// Nothing to do
//
hr = WBEM_S_NO_ERROR;
break;
}
default:
{
WmipAssert(FALSE);
hr = WBEM_S_NO_ERROR;
break;
}
}
return(hr);
}
HRESULT CWdmClass::CreateCimInstance(
IN IWbemContext *pCtx,
IN int RelPathIndex,
OUT IWbemClassObject **pCimInstance
)
/*+++
Routine Description:
This routine will create a CIM instance corresponding to the WDM
instance for the relpath index. No data is cached as the WDM class
is always queried to create the instance.
Arguments:
pCtx is the WBEM context
RelPathIndex is the index into the class corresponding to the
instance
*pCimInstance returns with a CIM class instance
Return Value:
HRESULT
---*/
{
IWbemClassObject *pWdmInstance;
HRESULT hr;
WmipAssert(pCimInstance != NULL);
WmipAssert(RelPathIndex < RelPathCount);
WmipAssert(IsThisInitialized());
//
// Create a template Cim instance to be filled with WDM properties
//
hr = CreateInst(pCtx,
GetCimServices(),
CimClassName,
pCimInstance);
if (hr == WBEM_S_NO_ERROR)
{
hr = GetWdmInstanceByIndex(pCtx,
RelPathIndex,
&pWdmInstance);
if (hr == WBEM_S_NO_ERROR)
{
hr = CopyBetweenCimAndWdmClasses(*pCimInstance,
pWdmInstance,
TRUE);
if (hr == WBEM_S_NO_ERROR)
{
//
// Fill in additional CIM properties in the case of
// classes derived from concrete and non concrete classes
//
hr = FillInCimInstance(pCtx,
RelPathIndex,
*pCimInstance,
pWdmInstance);
}
pWdmInstance->Release();
}
if (hr != WBEM_S_NO_ERROR)
{
(*pCimInstance)->Release();
*pCimInstance = NULL;
}
}
return(hr);
}
HRESULT CWdmClass::GetIndexByCimRelPath(
BSTR CimObjectPath,
int *RelPathIndex
)
/*+++
Routine Description:
This routine will return the RelPathIndex for a specific Cim
Relpath
Arguments:
CimRelPath is the Cim relpath
*RelPathIndex returns with the relpath index
Return Value:
HRESULT
---*/
{
int i;
WmipAssert(CimObjectPath != NULL);
WmipAssert(CimInstances->IsInitialized());
WmipAssert(WdmRelPaths->IsInitialized());
WmipAssert(IsThisInitialized());
for (i = 0; i < RelPathCount; i++)
{
if (_wcsicmp(CimObjectPath, GetCimRelPath(i)) == 0)
{
*RelPathIndex = i;
return(WBEM_S_NO_ERROR);
}
}
return(WBEM_E_NOT_FOUND);
}
HRESULT CWdmClass::GetWdmInstanceByIndex(
IN IWbemContext *pCtx,
IN int RelPathIndex,
OUT IWbemClassObject **ppWdmInstance
)
/*+++
Routine Description:
This routine will return a IWbemClassObject pointer associated
with the RelPath index
Arguments:
RelPathIndex
*ppWdmClassObject returns with an instance for the relpaht
Return Value:
HRESULT
---*/
{
HRESULT hr;
WmipAssert(ppWdmInstance != NULL);
WmipAssert(IsThisInitialized());
//
// Run in the caller's context so that if he is not able to access
// the WDM classes, he can't
//
hr = CoImpersonateClient();
if (hr == WBEM_S_NO_ERROR)
{
*ppWdmInstance = NULL;
hr = GetWdmServices()->GetObject(WdmRelPaths->Get(RelPathIndex),
WBEM_FLAG_USE_AMENDED_QUALIFIERS,
pCtx,
ppWdmInstance,
NULL);
CoRevertToSelf();
}
return(hr);
}
BOOLEAN CWdmClass::IsThisInitialized(
void
)
/*+++
Routine Description:
This routine determines if this class has been initialized to
access CDM and WDM classes
Arguments:
Return Value:
TRUE if initialiezed else FALSE
---*/
{
return( (CimClassName != NULL) );
}
IWbemClassObject *CWdmClass::GetCimInstance(
int RelPathIndex
)
{
WmipAssert(CimInstances->IsInitialized());
WmipAssert(RelPathIndex < RelPathCount);
WmipAssert(IsThisInitialized());
return(CimInstances->Get(RelPathIndex));
}
BSTR /* NOFREE */ CWdmClass::GetCimRelPath(
int RelPathIndex
)
/*+++
Routine Description:
This routine will return the Cim relpath for a RelPathIndex
Arguments:
RelPathIndex
Return Value:
Cim RelPath. This should not be freed
---*/
{
WmipAssert(CimInstances->IsInitialized());
WmipAssert(RelPathIndex < RelPathCount);
WmipAssert(IsThisInitialized());
return(CimInstances->GetRelPath(RelPathIndex));
}
BSTR /* NOFREE */ CWdmClass::GetWdmRelPath(
int RelPathIndex
)
/*+++
Routine Description:
This routine will return the Wdm relpath for a RelPathIndex
Arguments:
RelPathIndex
Return Value:
Cim RelPath. This should not be freed
---*/
{
WmipAssert(WdmRelPaths->IsInitialized());
WmipAssert(RelPathIndex < RelPathCount);
WmipAssert(IsThisInitialized());
return(WdmRelPaths->Get(RelPathIndex));
}
//
// Linked list management routines
//
CWdmClass *CWdmClass::GetNext(
)
{
return(Next);
}
CWdmClass *CWdmClass::GetPrev(
)
{
return(Prev);
}
void CWdmClass::InsertSelf(
CWdmClass **Head
)
{
WmipAssert(Next == NULL);
WmipAssert(Prev == NULL);
if (*Head != NULL)
{
Next = (*Head);
(*Head)->Prev = this;
}
*Head = this;
}
BOOLEAN CWdmClass::ClaimCimClassName(
PWCHAR ClassName
)
{
//
// If this class has the same CIM class name as the one we are
// looking for then we have a match
//
if (_wcsicmp(ClassName, CimClassName) == 0)
{
return(TRUE);
}
return(FALSE);
}
HRESULT CWdmClass::PutInstance(
IWbemContext *pCtx,
int RelPathIndex,
IWbemClassObject *pCimInstance
)
{
HRESULT hr;
IWbemClassObject *pWdmInstance;
WmipAssert(pCimInstance != NULL);
WmipAssert(RelPathIndex < RelPathCount);
//
// First thing is to obtain the WDM instance that corresponds to
// the cim instance
//
hr = GetWdmServices()->GetObject(WdmRelPaths->Get(RelPathIndex),
0,
pCtx,
&pWdmInstance,
NULL);
if (hr == WBEM_S_NO_ERROR)
{
//
// Now copy properties from the CIM class into the WDM class
//
hr = CopyBetweenCimAndWdmClasses(pWdmInstance,
pCimInstance,
FALSE);
if (hr == WBEM_S_NO_ERROR)
{
//
// Finally put the WDM instance to reflect the changed
// properties down into the driver
//
hr = GetWdmServices()->PutInstance(pWdmInstance,
WBEM_FLAG_UPDATE_ONLY,
pCtx,
NULL);
}
}
return(hr);
}
| [
"seta7D5@protonmail.com"
] | seta7D5@protonmail.com |
a9d61905b96fb623a7013e923ea4fb7f7db9e7e9 | 74212aa37999516a0aeba7ba1e71620a217f8e9d | /GameDemonstrator/game/GameOwnerRepository.cpp | fc8f15103b4430485fba9d0442869eeba900eebe | [] | no_license | raubwuerger/StrategicGameProject | 21729192518baa541f2c74f35cb0558a64292c2b | ce3e4c31383c44809e970996091067b94602fd92 | refs/heads/master | 2022-04-30T18:31:55.283915 | 2021-11-08T19:14:43 | 2021-11-08T19:14:43 | 19,796,707 | 0 | 0 | null | null | null | null | ISO-8859-1 | C++ | false | false | 2,201 | cpp | #include "stdafx.h"
#include "GameOwnerRepository.h"
#include "GameOwner.h"
#include "LogInterface.h"
GameOwnerRepository* GameOwnerRepository::Instance = nullptr;
GameOwnerRepository::GameOwnerRepository()
: BaseRepository(),
DefaultGameOwnerTypeId(NOT_INITIALIZED_INT)
{
}
GameOwnerRepository* GameOwnerRepository::GetInstance()
{
if (nullptr != Instance)
{
return Instance;
}
Instance = new GameOwnerRepository();
return Instance;
}
void GameOwnerRepository::Release()
{
delete Instance;
Instance = nullptr;
}
bool GameOwnerRepository::Init()
{
GameOwners.clear();
return true;
}
bool GameOwnerRepository::Register(GameOwner* gameOwner)
{
if (nullptr == gameOwner)
{
jha::GetLog()->Log_WARNING(QObject::tr("Handover <GameOwner> parameter is null!"));
return false;
}
if (true == GameOwners.contains(gameOwner->GetId()))
{
jha::GetLog()->Log_WARNING(QObject::tr("GameOwner with id=%1 already exists!").arg(gameOwner->GetId()));
return false;
}
if (0 == GetCount())
{
DefaultGameOwnerTypeId = gameOwner->GetId();
}
GameOwners.insert(gameOwner->GetId(), gameOwner);
return true;
}
const GameOwner* GameOwnerRepository::GetById(int id) const
{
if (false == GameOwners.contains(id))
{
return nullptr;
}
return GameOwners.value(id);
}
QMap<int, GameOwner*>::const_iterator GameOwnerRepository::GetFirstIterator() const
{
return GameOwners.cbegin();
}
QMap<int, GameOwner*>::const_iterator GameOwnerRepository::GetLastIterator() const
{
return GameOwners.cend();
}
const GameOwner* GameOwnerRepository::GetHuman() const
{
QMapIterator<int, GameOwner*> iterator(GameOwners);
while (iterator.hasNext())
{
if (false == iterator.next().value()->GetIsHuman())
{
continue;
}
return iterator.value();
}
return nullptr;
}
int GameOwnerRepository::CreateNewId()
{
//TODO: Gefährlich da beim laden diese Id schon vorhanden sein könnte!
//TODO: Testen ob die erzeugte id schon in der map ist!!
int newId = GameOwners.size();
return ++newId;
}
int GameOwnerRepository::GetCount() const
{
return GameOwners.size();
}
const GameOwner* GameOwnerRepository::GetDefaultOwnerType() const
{
return GameOwners.value(DefaultGameOwnerTypeId);
}
| [
"hannuschka@web.de"
] | hannuschka@web.de |
57c4bc9608ddcfae00b91c1ffde4a9cc02912e4c | 39adfee7b03a59c40f0b2cca7a3b5d2381936207 | /codeforces/196/C.cpp | 09e8cf5eae21eeac358d3b893b0cfa3ce39e1f02 | [] | no_license | ngthanhtrung23/CompetitiveProgramming | c4dee269c320c972482d5f56d3808a43356821ca | 642346c18569df76024bfb0678142e513d48d514 | refs/heads/master | 2023-07-06T05:46:25.038205 | 2023-06-24T14:18:48 | 2023-06-24T14:18:48 | 179,512,787 | 78 | 22 | null | null | null | null | UTF-8 | C++ | false | false | 2,626 | cpp | #include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <complex>
#define FOR(i,a,b) for(int i = a; i <= b; ++i)
#define FORD(i,a,b) for(int i = a; i >= b; --i)
#define REP(i,a) for(int i = 0; i < a; ++i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define DEBUG(x) cout << #x << " = " << x << endl;
#define PR(x,n) cout << #x << " = "; FOR(__,1,n) cout << x[__] << ' '; puts("");
#define PR0(x,n) cout << #x << " = "; REP(__,n) cout << x[__] << ' '; puts("");
#define ll long long
using namespace std;
struct Point {
int x, y;
int index;
Point() { x = y = 0; }
Point(int x, int y, int index) : x(x), y(y), index(index) {}
} a[1511];
inline int ccw(const Point &a, const Point &b, const Point &c) {
long long t = (b.x-a.x)*(ll)(c.y-a.y) - (b.y-a.y)*(ll)(c.x-a.x);
if (t == 0) return 0;
else if (t < 0) return -1;
else return 1;
}
Point pivot;
inline bool operator < (const Point &a, const Point &b) {
return ccw(pivot, a, b) == 1;
}
vector<int> ke[1511];
int res[1511], n, sz[1511];
void dfs(int u, int fu = -1) {
sz[u] = 1;
REP(i,ke[u].size()) {
int v = ke[u][i];
if (v == fu) continue;
dfs(v, u);
sz[u] += sz[v];
}
}
void solve(int root, int fat, int l, int r) {
pivot = a[l];
sort(a+l+1, a+r+1);
// cout << "solve: " << root << ": ";
// FOR(i,l,r) cout << a[i].index << ' '; puts("");
res[a[l].index] = root;
int now = l+1;
REP(i,ke[root].size()) {
int v = ke[root][i];
if (v == fat) continue;
solve(v, root, now, now+sz[v]-1);
now = now + sz[v];
}
}
int main() {
while (scanf("%d", &n) == 1) {
FOR(i,1,n) ke[i].clear();
memset(res, 0, sizeof res);
FOR(i,1,n-1) {
int u, v; scanf("%d%d", &u, &v);
ke[u].PB(v);
ke[v].PB(u);
}
FOR(i,1,n) {
int x, y; scanf("%d%d", &x, &y);
a[i] = Point(x, y, i);
}
int save = 1;
FOR(i,1,n)
if (a[i].y < a[save].y || (a[i].y == a[save].y && a[i].x < a[save].x)) save = i;
swap(a[save], a[1]);
pivot = a[1];
sort(a+2, a+n+1);
dfs(1);
solve(1, -1, 1, n);
FOR(i,1,n) printf("%d ", res[i]); puts("");
}
return 0;
}
| [
"ngthanhtrung23@gmail.com"
] | ngthanhtrung23@gmail.com |
7b3b6eeaa074dad8daccd9021e3aec9ff1d390aa | ac1c9fbc1f1019efb19d0a8f3a088e8889f1e83c | /out/release/gen/services/viz/public/mojom/compositing/filter_operations.mojom-blink-forward.h | b266020e3474e49d55c1e17e07f375ec80d5b47c | [
"BSD-3-Clause"
] | permissive | xueqiya/chromium_src | 5d20b4d3a2a0251c063a7fb9952195cda6d29e34 | d4aa7a8f0e07cfaa448fcad8c12b29242a615103 | refs/heads/main | 2022-07-30T03:15:14.818330 | 2021-01-16T16:47:22 | 2021-01-16T16:47:22 | 330,115,551 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 996 | h | // services/viz/public/mojom/compositing/filter_operations.mojom-blink-forward.h is auto generated by mojom_bindings_generator.py, do not edit
// Copyright 2019 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef SERVICES_VIZ_PUBLIC_MOJOM_COMPOSITING_FILTER_OPERATIONS_MOJOM_BLINK_FORWARD_H_
#define SERVICES_VIZ_PUBLIC_MOJOM_COMPOSITING_FILTER_OPERATIONS_MOJOM_BLINK_FORWARD_H_
#include "mojo/public/cpp/bindings/struct_forward.h"
#include "mojo/public/interfaces/bindings/native_struct.mojom-forward.h"
namespace viz {
namespace mojom {
} // namespace viz
} // namespace mojom
namespace viz {
namespace mojom {
namespace blink {
class FilterOperations;
using FilterOperationsPtr = mojo::StructPtr<FilterOperations>;
} // namespace blink
} // namespace mojom
} // namespace viz
#endif // SERVICES_VIZ_PUBLIC_MOJOM_COMPOSITING_FILTER_OPERATIONS_MOJOM_BLINK_FORWARD_H_ | [
"xueqi@zjmedia.net"
] | xueqi@zjmedia.net |
08ac03775476373d6a5c0f147c2b8685f15b5df1 | 3ea22cdb46fd3e688cb66e1bd89500e59dea7203 | /Unidade 1/Códigos/Complex_V1/complex.cpp | 536fd368c432445c3fbce0d383ab92ced9a0c42a | [] | no_license | lariskelmer/PA | 8e8ce724cac4b5370cadfc43bf0cf85ddd8432ae | 286e3c8b91c2afeccadf39987c34a47edba94bd1 | refs/heads/master | 2020-08-28T01:46:56.053323 | 2018-05-30T05:18:44 | 2018-05-30T05:18:44 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 722 | cpp | #include <iostream>
#include <cmath>
#include "complex.h"
using namespace std;
// As funcoes
istream &operator>>(istream &X, Complex &C)
{
cout << "R? ";
X >> C.real;
cout << "I? ";
X >> C.imag;
return X;
}
ostream &operator<<(ostream &X, const Complex &C)
{
X << C.real << (C.imag<0.0 ? '-' : '+') << 'j' << fabs(C.imag);
return X;
}
// Os metodos
Complex Complex::operator+(const Complex &C2) const
{
Complex prov;
prov.real = real+C2.real;
prov.imag = imag+C2.imag;
return prov;
}
Complex Complex::operator*(const Complex &C2) const
{
Complex prov;
prov.real = real*C2.real - imag*C2.imag;
prov.imag = real*C2.imag + C2.real*imag;
return prov;
}
| [
"luizfelipeplm@gmail.com"
] | luizfelipeplm@gmail.com |
7e576fcaa06c0e6fdcc549b741b68f68e4049e8d | bcc7aa460aadb5abbd78c0376778590edae25d16 | /Laborator 1/Lab-1-ex-3.cpp | 96c45b10c089675dbab9e4cb9ece7e5d4546da50 | [] | no_license | Daniela-Petrea/POO_FII_PetreaDaniela_A5 | d00bbfb2f4e4cb816420d1eb894eff23f0bd762f | b25e7e5c065550d1cf491dbda2894cca38a0335a | refs/heads/main | 2023-05-02T18:18:16.210175 | 2021-05-23T13:04:41 | 2021-05-23T13:04:41 | 339,986,475 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,092 | cpp | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
int main()
{
char str[100];
char newString[10][10];
char aux[10] = " ";
int i, j, ctr;
printf("Introdu o propozitie :\n");
scanf("%[^\n]", str);
j = 0; ctr = 0;
for (i = 0; i <= (strlen(str)); ++i)
{
if (str[i] == ' ' || str[i] == '\0')
{
newString[ctr][j] = '\0';
ctr++;
j = 0;
}
else
{
newString[ctr][j] = str[i];
j++;
}
}
for (i = 0; i < ctr - 1; ++i)
{
for (j = i + 1; j < ctr; ++j) {
if ((strlen(newString[i]) < strlen(newString[j])) || ((strlen(newString[i]) == strlen(newString[j])) && (strcmp(newString[i], newString[j]) > 0))) {
strcpy(aux, newString[i]);
strcpy(newString[i], newString[j]);
strcpy(newString[j], aux);
}
}
}
for (i = 0; i < ctr; ++i)
{
printf(" %s\n", newString[i]);
}
return 0;
}
| [
"noreply@github.com"
] | Daniela-Petrea.noreply@github.com |
cb276429b8f580be94c49f03f0622ccee6f53c7e | cecf6991e6007ee4bc32a82e438c9120b3826dad | /Win/Source/CoInitializer.h | a70c6dd049258c4366f0a0c5259f5e1af75894a5 | [] | no_license | thinking2535/Rso | 172a3499400331439a530cab78934fa4c4433771 | 35d556463118825a1d5d36f49d46f18a05806169 | refs/heads/main | 2022-11-30T12:43:50.917063 | 2022-11-23T10:47:59 | 2022-11-23T10:47:59 | 31,525,549 | 11 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 293 | h | #pragma once
#include "Base.h"
namespace rso
{
namespace win
{
class CCoInitializer
{
HRESULT _Result = S_FALSE;
public:
CCoInitializer();
CCoInitializer(CCoInitializer&& Var_);
virtual ~CCoInitializer();
CCoInitializer& operator = (CCoInitializer&& Var_);
};
}
}
| [
"thinking2535@gmail.com"
] | thinking2535@gmail.com |
e9cfbb91f4a31c5c8ad345b4cdfb043dbb99722f | ddf831f5865504bddb5ecef46b3e1c7d24be4ba1 | /flat.cpp | 9b4c8c894271cdbf5f1199f92a82ea4fd57c7a42 | [
"BSD-3-Clause"
] | permissive | termoshtt/flat_ffi_example | 9a60c1a88eb4c221a729105dbbb5ca93d33d2067 | 34e95857cf13133f36cde7bed924f55c4186c025 | refs/heads/master | 2020-06-18T20:33:45.195665 | 2019-07-12T11:02:49 | 2019-07-12T11:02:49 | 196,438,020 | 5 | 0 | BSD-3-Clause | 2019-07-12T11:02:50 | 2019-07-11T17:25:26 | CMake | UTF-8 | C++ | false | false | 434 | cpp | #include <boost/python.hpp>
#include <boost/python/numpy.hpp>
#include "data_generated.h"
namespace p = boost::python;
namespace np = boost::python::numpy;
np::ndarray new_zero1(unsigned int N) {
p::tuple shape = p::make_tuple(N);
np::dtype dtype = np::dtype::get_builtin<double>();
return np::zeros(shape, dtype);
}
BOOST_PYTHON_MODULE(flat_cpp) {
Py_Initialize();
np::initialize();
p::def("new_zero", new_zero1);
}
| [
"toshiki.teramura@gmail.com"
] | toshiki.teramura@gmail.com |
85f7154aabf6ef4c0b7fc97b49d4b7a130d4b68a | d597f3f100b681fe3dc3b83f991daef591cdf23b | /fibbonacci using functions.cpp | 014611fcaf5929034c660a241b70ca108536fd48 | [] | no_license | infernus01/DSA | 0c3c34185305f0695101bbdd7858113c82a40247 | f9a8c5077a2cc2956cce8f95568d81b941dd2b47 | refs/heads/main | 2023-07-15T19:10:22.813733 | 2021-08-18T10:20:14 | 2021-08-18T10:20:14 | 397,557,678 | 2 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 287 | cpp | #include<iostream>
using namespace std;
int fib(int a);
int main()
{
int a=0,b=1,c,n,res;
cin>>n;
res=fib(n);
cout<<res;
}
int fib(int a)
{ int n1=0,n2=1,n3;
for(int i=0;i<a;i++)
{
n3=n1+n2;
n1=n2;
n2=n3;
}
return fib(n1);
} | [
"noreply@github.com"
] | infernus01.noreply@github.com |
491eabef4de83000a7ccbe7d4cbe12c209e88e54 | 83bacfbdb7ad17cbc2fc897b3460de1a6726a3b1 | /v8_4_5/src/cpu-profiler.cc | f48499e5f0f62a827010335f5b78f195a98c93c2 | [
"bzip2-1.0.6",
"BSD-3-Clause",
"Apache-2.0"
] | permissive | cool2528/miniblink49 | d909e39012f2c5d8ab658dc2a8b314ad0050d8ea | 7f646289d8074f098cf1244adc87b95e34ab87a8 | refs/heads/master | 2020-06-05T03:18:43.211372 | 2019-06-01T08:57:37 | 2019-06-01T08:59:56 | 192,294,645 | 2 | 0 | Apache-2.0 | 2019-06-17T07:16:28 | 2019-06-17T07:16:27 | null | UTF-8 | C++ | false | false | 17,847 | cc | // Copyright 2012 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "src/v8.h"
#include "src/cpu-profiler-inl.h"
#include "src/compiler.h"
#include "src/deoptimizer.h"
#include "src/frames-inl.h"
#include "src/hashmap.h"
#include "src/log-inl.h"
#include "src/vm-state-inl.h"
#include "include/v8-profiler.h"
namespace v8 {
namespace internal {
static const int kProfilerStackSize = 64 * KB;
ProfilerEventsProcessor::ProfilerEventsProcessor(ProfileGenerator* generator,
Sampler* sampler,
base::TimeDelta period)
: Thread(Thread::Options("v8:ProfEvntProc", kProfilerStackSize)),
generator_(generator),
sampler_(sampler),
running_(1),
period_(period),
last_code_event_id_(0),
last_processed_code_event_id_(0) {}
void ProfilerEventsProcessor::Enqueue(const CodeEventsContainer& event) {
event.generic.order = ++last_code_event_id_;
events_buffer_.Enqueue(event);
}
void ProfilerEventsProcessor::AddDeoptStack(Isolate* isolate, Address from,
int fp_to_sp_delta) {
TickSampleEventRecord record(last_code_event_id_);
RegisterState regs;
Address fp = isolate->c_entry_fp(isolate->thread_local_top());
regs.sp = fp - fp_to_sp_delta;
regs.fp = fp;
regs.pc = from;
record.sample.Init(isolate, regs, TickSample::kSkipCEntryFrame);
ticks_from_vm_buffer_.Enqueue(record);
}
void ProfilerEventsProcessor::AddCurrentStack(Isolate* isolate) {
TickSampleEventRecord record(last_code_event_id_);
RegisterState regs;
StackFrameIterator it(isolate);
if (!it.done()) {
StackFrame* frame = it.frame();
regs.sp = frame->sp();
regs.fp = frame->fp();
regs.pc = frame->pc();
}
record.sample.Init(isolate, regs, TickSample::kSkipCEntryFrame);
ticks_from_vm_buffer_.Enqueue(record);
}
void ProfilerEventsProcessor::StopSynchronously() {
if (!base::NoBarrier_AtomicExchange(&running_, 0)) return;
Join();
}
bool ProfilerEventsProcessor::ProcessCodeEvent() {
CodeEventsContainer record;
if (events_buffer_.Dequeue(&record)) {
switch (record.generic.type) {
#define PROFILER_TYPE_CASE(type, clss) \
case CodeEventRecord::type: \
record.clss##_.UpdateCodeMap(generator_->code_map()); \
break;
CODE_EVENTS_TYPE_LIST(PROFILER_TYPE_CASE)
#undef PROFILER_TYPE_CASE
default: return true; // Skip record.
}
last_processed_code_event_id_ = record.generic.order;
return true;
}
return false;
}
ProfilerEventsProcessor::SampleProcessingResult
ProfilerEventsProcessor::ProcessOneSample() {
if (!ticks_from_vm_buffer_.IsEmpty()
&& ticks_from_vm_buffer_.Peek()->order ==
last_processed_code_event_id_) {
TickSampleEventRecord record;
ticks_from_vm_buffer_.Dequeue(&record);
generator_->RecordTickSample(record.sample);
return OneSampleProcessed;
}
const TickSampleEventRecord* record = ticks_buffer_.Peek();
if (record == NULL) {
if (ticks_from_vm_buffer_.IsEmpty()) return NoSamplesInQueue;
return FoundSampleForNextCodeEvent;
}
if (record->order != last_processed_code_event_id_) {
return FoundSampleForNextCodeEvent;
}
generator_->RecordTickSample(record->sample);
ticks_buffer_.Remove();
return OneSampleProcessed;
}
void ProfilerEventsProcessor::Run() {
while (!!base::NoBarrier_Load(&running_)) {
base::TimeTicks nextSampleTime =
base::TimeTicks::HighResolutionNow() + period_;
base::TimeTicks now;
SampleProcessingResult result;
// Keep processing existing events until we need to do next sample
// or the ticks buffer is empty.
do {
result = ProcessOneSample();
if (result == FoundSampleForNextCodeEvent) {
// All ticks of the current last_processed_code_event_id_ are
// processed, proceed to the next code event.
ProcessCodeEvent();
}
now = base::TimeTicks::HighResolutionNow();
} while (result != NoSamplesInQueue && now < nextSampleTime);
if (nextSampleTime > now) {
#if V8_OS_WIN
// Do not use Sleep on Windows as it is very imprecise.
// Could be up to 16ms jitter, which is unacceptable for the purpose.
while (base::TimeTicks::HighResolutionNow() < nextSampleTime) {
}
#else
base::OS::Sleep(nextSampleTime - now);
#endif
}
// Schedule next sample. sampler_ is NULL in tests.
if (sampler_) sampler_->DoSample();
}
// Process remaining tick events.
do {
SampleProcessingResult result;
do {
result = ProcessOneSample();
} while (result == OneSampleProcessed);
} while (ProcessCodeEvent());
}
void* ProfilerEventsProcessor::operator new(size_t size) {
return AlignedAlloc(size, V8_ALIGNOF(ProfilerEventsProcessor));
}
void ProfilerEventsProcessor::operator delete(void* ptr) {
AlignedFree(ptr);
}
int CpuProfiler::GetProfilesCount() {
// The count of profiles doesn't depend on a security token.
return profiles_->profiles()->length();
}
CpuProfile* CpuProfiler::GetProfile(int index) {
return profiles_->profiles()->at(index);
}
void CpuProfiler::DeleteAllProfiles() {
if (is_profiling_) StopProcessor();
ResetProfiles();
}
void CpuProfiler::DeleteProfile(CpuProfile* profile) {
profiles_->RemoveProfile(profile);
delete profile;
if (profiles_->profiles()->is_empty() && !is_profiling_) {
// If this was the last profile, clean up all accessory data as well.
ResetProfiles();
}
}
static bool FilterOutCodeCreateEvent(Logger::LogEventsAndTags tag) {
return FLAG_prof_browser_mode
&& (tag != Logger::CALLBACK_TAG
&& tag != Logger::FUNCTION_TAG
&& tag != Logger::LAZY_COMPILE_TAG
&& tag != Logger::REG_EXP_TAG
&& tag != Logger::SCRIPT_TAG);
}
void CpuProfiler::CallbackEvent(Name* name, Address entry_point) {
if (FilterOutCodeCreateEvent(Logger::CALLBACK_TAG)) return;
CodeEventsContainer evt_rec(CodeEventRecord::CODE_CREATION);
CodeCreateEventRecord* rec = &evt_rec.CodeCreateEventRecord_;
rec->start = entry_point;
rec->entry = profiles_->NewCodeEntry(
Logger::CALLBACK_TAG,
profiles_->GetName(name));
rec->size = 1;
processor_->Enqueue(evt_rec);
}
void CpuProfiler::CodeCreateEvent(Logger::LogEventsAndTags tag,
Code* code,
const char* name) {
if (FilterOutCodeCreateEvent(tag)) return;
CodeEventsContainer evt_rec(CodeEventRecord::CODE_CREATION);
CodeCreateEventRecord* rec = &evt_rec.CodeCreateEventRecord_;
rec->start = code->address();
rec->entry = profiles_->NewCodeEntry(
tag, profiles_->GetFunctionName(name), CodeEntry::kEmptyNamePrefix,
CodeEntry::kEmptyResourceName, CpuProfileNode::kNoLineNumberInfo,
CpuProfileNode::kNoColumnNumberInfo, NULL, code->instruction_start());
rec->size = code->ExecutableSize();
processor_->Enqueue(evt_rec);
}
void CpuProfiler::CodeCreateEvent(Logger::LogEventsAndTags tag,
Code* code,
Name* name) {
if (FilterOutCodeCreateEvent(tag)) return;
CodeEventsContainer evt_rec(CodeEventRecord::CODE_CREATION);
CodeCreateEventRecord* rec = &evt_rec.CodeCreateEventRecord_;
rec->start = code->address();
rec->entry = profiles_->NewCodeEntry(
tag, profiles_->GetFunctionName(name), CodeEntry::kEmptyNamePrefix,
CodeEntry::kEmptyResourceName, CpuProfileNode::kNoLineNumberInfo,
CpuProfileNode::kNoColumnNumberInfo, NULL, code->instruction_start());
rec->size = code->ExecutableSize();
processor_->Enqueue(evt_rec);
}
void CpuProfiler::CodeCreateEvent(Logger::LogEventsAndTags tag, Code* code,
SharedFunctionInfo* shared,
CompilationInfo* info, Name* script_name) {
if (FilterOutCodeCreateEvent(tag)) return;
CodeEventsContainer evt_rec(CodeEventRecord::CODE_CREATION);
CodeCreateEventRecord* rec = &evt_rec.CodeCreateEventRecord_;
rec->start = code->address();
rec->entry = profiles_->NewCodeEntry(
tag, profiles_->GetFunctionName(shared->DebugName()),
CodeEntry::kEmptyNamePrefix, profiles_->GetName(script_name),
CpuProfileNode::kNoLineNumberInfo, CpuProfileNode::kNoColumnNumberInfo,
NULL, code->instruction_start());
if (info) {
rec->entry->set_no_frame_ranges(info->ReleaseNoFrameRanges());
rec->entry->set_inlined_function_infos(info->inlined_function_infos());
}
rec->entry->FillFunctionInfo(shared);
rec->size = code->ExecutableSize();
processor_->Enqueue(evt_rec);
}
void CpuProfiler::CodeCreateEvent(Logger::LogEventsAndTags tag, Code* code,
SharedFunctionInfo* shared,
CompilationInfo* info, Name* script_name,
int line, int column) {
if (FilterOutCodeCreateEvent(tag)) return;
CodeEventsContainer evt_rec(CodeEventRecord::CODE_CREATION);
CodeCreateEventRecord* rec = &evt_rec.CodeCreateEventRecord_;
rec->start = code->address();
Script* script = Script::cast(shared->script());
JITLineInfoTable* line_table = NULL;
if (script) {
line_table = new JITLineInfoTable();
for (RelocIterator it(code); !it.done(); it.next()) {
RelocInfo::Mode mode = it.rinfo()->rmode();
if (RelocInfo::IsPosition(mode)) {
int position = static_cast<int>(it.rinfo()->data());
if (position >= 0) {
int pc_offset = static_cast<int>(it.rinfo()->pc() - code->address());
int line_number = script->GetLineNumber(position) + 1;
line_table->SetPosition(pc_offset, line_number);
}
}
}
}
rec->entry = profiles_->NewCodeEntry(
tag, profiles_->GetFunctionName(shared->DebugName()),
CodeEntry::kEmptyNamePrefix, profiles_->GetName(script_name), line,
column, line_table, code->instruction_start());
if (info) {
rec->entry->set_no_frame_ranges(info->ReleaseNoFrameRanges());
rec->entry->set_inlined_function_infos(info->inlined_function_infos());
}
rec->entry->FillFunctionInfo(shared);
rec->size = code->ExecutableSize();
processor_->Enqueue(evt_rec);
}
void CpuProfiler::CodeCreateEvent(Logger::LogEventsAndTags tag,
Code* code,
int args_count) {
if (FilterOutCodeCreateEvent(tag)) return;
CodeEventsContainer evt_rec(CodeEventRecord::CODE_CREATION);
CodeCreateEventRecord* rec = &evt_rec.CodeCreateEventRecord_;
rec->start = code->address();
rec->entry = profiles_->NewCodeEntry(
tag, profiles_->GetName(args_count), "args_count: ",
CodeEntry::kEmptyResourceName, CpuProfileNode::kNoLineNumberInfo,
CpuProfileNode::kNoColumnNumberInfo, NULL, code->instruction_start());
rec->size = code->ExecutableSize();
processor_->Enqueue(evt_rec);
}
void CpuProfiler::CodeMoveEvent(Address from, Address to) {
CodeEventsContainer evt_rec(CodeEventRecord::CODE_MOVE);
CodeMoveEventRecord* rec = &evt_rec.CodeMoveEventRecord_;
rec->from = from;
rec->to = to;
processor_->Enqueue(evt_rec);
}
void CpuProfiler::CodeDisableOptEvent(Code* code, SharedFunctionInfo* shared) {
CodeEventsContainer evt_rec(CodeEventRecord::CODE_DISABLE_OPT);
CodeDisableOptEventRecord* rec = &evt_rec.CodeDisableOptEventRecord_;
rec->start = code->address();
rec->bailout_reason = GetBailoutReason(shared->disable_optimization_reason());
processor_->Enqueue(evt_rec);
}
void CpuProfiler::CodeDeoptEvent(Code* code, Address pc, int fp_to_sp_delta) {
CodeEventsContainer evt_rec(CodeEventRecord::CODE_DEOPT);
CodeDeoptEventRecord* rec = &evt_rec.CodeDeoptEventRecord_;
Deoptimizer::DeoptInfo info = Deoptimizer::GetDeoptInfo(code, pc);
rec->start = code->address();
rec->deopt_reason = Deoptimizer::GetDeoptReason(info.deopt_reason);
rec->position = info.position;
rec->pc_offset = pc - code->instruction_start();
processor_->Enqueue(evt_rec);
processor_->AddDeoptStack(isolate_, pc, fp_to_sp_delta);
}
void CpuProfiler::CodeDeleteEvent(Address from) {
}
void CpuProfiler::GetterCallbackEvent(Name* name, Address entry_point) {
if (FilterOutCodeCreateEvent(Logger::CALLBACK_TAG)) return;
CodeEventsContainer evt_rec(CodeEventRecord::CODE_CREATION);
CodeCreateEventRecord* rec = &evt_rec.CodeCreateEventRecord_;
rec->start = entry_point;
rec->entry = profiles_->NewCodeEntry(
Logger::CALLBACK_TAG,
profiles_->GetName(name),
"get ");
rec->size = 1;
processor_->Enqueue(evt_rec);
}
void CpuProfiler::RegExpCodeCreateEvent(Code* code, String* source) {
if (FilterOutCodeCreateEvent(Logger::REG_EXP_TAG)) return;
CodeEventsContainer evt_rec(CodeEventRecord::CODE_CREATION);
CodeCreateEventRecord* rec = &evt_rec.CodeCreateEventRecord_;
rec->start = code->address();
rec->entry = profiles_->NewCodeEntry(
Logger::REG_EXP_TAG, profiles_->GetName(source), "RegExp: ",
CodeEntry::kEmptyResourceName, CpuProfileNode::kNoLineNumberInfo,
CpuProfileNode::kNoColumnNumberInfo, NULL, code->instruction_start());
rec->size = code->ExecutableSize();
processor_->Enqueue(evt_rec);
}
void CpuProfiler::SetterCallbackEvent(Name* name, Address entry_point) {
if (FilterOutCodeCreateEvent(Logger::CALLBACK_TAG)) return;
CodeEventsContainer evt_rec(CodeEventRecord::CODE_CREATION);
CodeCreateEventRecord* rec = &evt_rec.CodeCreateEventRecord_;
rec->start = entry_point;
rec->entry = profiles_->NewCodeEntry(
Logger::CALLBACK_TAG,
profiles_->GetName(name),
"set ");
rec->size = 1;
processor_->Enqueue(evt_rec);
}
CpuProfiler::CpuProfiler(Isolate* isolate)
: isolate_(isolate),
sampling_interval_(base::TimeDelta::FromMicroseconds(
FLAG_cpu_profiler_sampling_interval)),
profiles_(new CpuProfilesCollection(isolate->heap())),
generator_(NULL),
processor_(NULL),
is_profiling_(false) {
}
CpuProfiler::CpuProfiler(Isolate* isolate,
CpuProfilesCollection* test_profiles,
ProfileGenerator* test_generator,
ProfilerEventsProcessor* test_processor)
: isolate_(isolate),
sampling_interval_(base::TimeDelta::FromMicroseconds(
FLAG_cpu_profiler_sampling_interval)),
profiles_(test_profiles),
generator_(test_generator),
processor_(test_processor),
is_profiling_(false) {
}
CpuProfiler::~CpuProfiler() {
DCHECK(!is_profiling_);
delete profiles_;
}
void CpuProfiler::set_sampling_interval(base::TimeDelta value) {
DCHECK(!is_profiling_);
sampling_interval_ = value;
}
void CpuProfiler::ResetProfiles() {
delete profiles_;
profiles_ = new CpuProfilesCollection(isolate()->heap());
}
void CpuProfiler::StartProfiling(const char* title, bool record_samples) {
if (profiles_->StartProfiling(title, record_samples)) {
StartProcessorIfNotStarted();
}
}
void CpuProfiler::StartProfiling(String* title, bool record_samples) {
StartProfiling(profiles_->GetName(title), record_samples);
}
void CpuProfiler::StartProcessorIfNotStarted() {
if (processor_ != NULL) {
processor_->AddCurrentStack(isolate_);
return;
}
Logger* logger = isolate_->logger();
// Disable logging when using the new implementation.
saved_is_logging_ = logger->is_logging_;
logger->is_logging_ = false;
generator_ = new ProfileGenerator(profiles_);
Sampler* sampler = logger->sampler();
processor_ = new ProfilerEventsProcessor(
generator_, sampler, sampling_interval_);
is_profiling_ = true;
// Enumerate stuff we already have in the heap.
DCHECK(isolate_->heap()->HasBeenSetUp());
if (!FLAG_prof_browser_mode) {
logger->LogCodeObjects();
}
logger->LogCompiledFunctions();
logger->LogAccessorCallbacks();
LogBuiltins();
// Enable stack sampling.
sampler->SetHasProcessingThread(true);
sampler->IncreaseProfilingDepth();
processor_->AddCurrentStack(isolate_);
processor_->StartSynchronously();
}
CpuProfile* CpuProfiler::StopProfiling(const char* title) {
if (!is_profiling_) return NULL;
StopProcessorIfLastProfile(title);
CpuProfile* result = profiles_->StopProfiling(title);
if (result != NULL) {
result->Print();
}
return result;
}
CpuProfile* CpuProfiler::StopProfiling(String* title) {
if (!is_profiling_) return NULL;
const char* profile_title = profiles_->GetName(title);
StopProcessorIfLastProfile(profile_title);
return profiles_->StopProfiling(profile_title);
}
void CpuProfiler::StopProcessorIfLastProfile(const char* title) {
if (profiles_->IsLastProfile(title)) StopProcessor();
}
void CpuProfiler::StopProcessor() {
Logger* logger = isolate_->logger();
Sampler* sampler = reinterpret_cast<Sampler*>(logger->ticker_);
is_profiling_ = false;
processor_->StopSynchronously();
delete processor_;
delete generator_;
processor_ = NULL;
generator_ = NULL;
sampler->SetHasProcessingThread(false);
sampler->DecreaseProfilingDepth();
logger->is_logging_ = saved_is_logging_;
}
void CpuProfiler::LogBuiltins() {
Builtins* builtins = isolate_->builtins();
DCHECK(builtins->is_initialized());
for (int i = 0; i < Builtins::builtin_count; i++) {
CodeEventsContainer evt_rec(CodeEventRecord::REPORT_BUILTIN);
ReportBuiltinEventRecord* rec = &evt_rec.ReportBuiltinEventRecord_;
Builtins::Name id = static_cast<Builtins::Name>(i);
rec->start = builtins->builtin(id)->address();
rec->builtin_id = id;
processor_->Enqueue(evt_rec);
}
}
} // namespace internal
} // namespace v8
| [
"22249030@qq.com"
] | 22249030@qq.com |
95a3b2c5b29786f927eedb518cdd49ee0bbd6472 | c57624029247759a6a21dbca7234941888c3c7f2 | /I_University-Graduate-Information-System_MaxHeap/University-Graduate-Information-System_MaxHeap.cpp | d8fe419aee2a5049b182d5ada89362d6a16ece71 | [
"MIT"
] | permissive | SYangChen/DS_practice | 858ecf54ff3851d7aef053ec1a3519116ab1b982 | 1c43606910894b5a1b5b1577663ec906ac8a8183 | refs/heads/master | 2022-11-24T13:38:49.433645 | 2020-07-24T01:44:55 | 2020-07-24T01:44:55 | 281,609,104 | 1 | 0 | null | null | null | null | BIG5 | C++ | false | false | 8,276 | cpp | #include <cstdlib>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <fstream>
#include <vector>
#include <cmath>
using namespace std;
fstream fin ; // file input
fstream fout ; // file output
typedef struct Data {
int schoolCode ; // 學校代碼
string schoolName ; // 學校名稱 !!!
string deptCode ; // 科系代碼
string deptName ; // 科系名稱 !!!
string dayType ; // 日間/進修別 !!!
string level ; // 等級別 !!!
string stdnt ; // 學生人數
string teacher ; // 教師人數
int graduate ; // 畢業生人數
}Data;
typedef struct Item {
int num ;
int graduate ;
}Item;
class Heap {
private :
Item *heapArray ;
public :
Heap( int size ) {
heapArray = new Item[size] ;
}
void HeapInsert( Item newItem, int size ) {
heapArray[size] = newItem ;
int cur = size ; // current node
int parent = ( cur-1 )/2 ; // current node's parent
while (( parent >= 0) && ( heapArray[cur].graduate > heapArray[parent].graduate )) {
Item temp = heapArray[parent] ;
heapArray[parent] = heapArray[cur] ; // swap
heapArray[cur] = temp ;
cur = parent ;
parent = ( cur-1 )/2 ;
}
// size++ ;
}
void HeapPrint( int size ) {
cout << "root : [" << heapArray[0].num << "] " << heapArray[0].graduate << endl ;
cout << "bottom : [" << heapArray[size-1].num << "] " << heapArray[size-1].graduate << endl ;
size = log(size)/log(2) ; // log2(x)
size = pow( 2, size ) ; // 2^x
cout << "leftmost bottom : [" << heapArray[size-1].num << "] " << heapArray[size-1].graduate << endl ;
}
};
class Assignment {
private :
vector<Data> list ;
vector<Data> modifiedList ;
Heap *heap ;
public :
Assignment() {
;
}
void Clear() {
modifiedList.clear() ;
}
int getMSize() {
return modifiedList.size() ;
}
void Read() {
Data temp ;
string s ;
string tempstring ;
char c ;
int i = 0 ;
getline( fin, s ) ; // first line will not input list
getline( fin, s ) ;
getline( fin, s ) ;
while( getline( fin, s ) ) {
for ( i = 0 ; s[i] != '\t' ; i++ )
tempstring = tempstring+s[i] ;
temp.schoolCode = atoi( tempstring.c_str() ) ; // std::stoi require newest compiler
for ( i++ ; s[i] != '\t' ; i++ )
temp.schoolName = temp.schoolName+s[i] ;
for ( i++ ; s[i] != '\t' ; i++ )
temp.deptCode = temp.deptCode+s[i] ;
for ( i++ ; s[i] != '\t' ; i++ )
temp.deptName = temp.deptName+s[i] ;
for ( i++ ; s[i] != '\t' ; i++ )
temp.dayType = temp.dayType+s[i] ;
for ( i++ ; s[i] != '\t' ; i++ )
temp.level = temp.level+s[i] ;
for ( i++ ; s[i] != '\t' ; i++ )
temp.stdnt = temp.stdnt+s[i] ;
for ( i++ ; s[i] != '\t' ; i++ )
temp.teacher = temp.teacher+s[i] ;
tempstring.clear() ;
for ( i++ ; s[i] != '\t' ; i++ )
tempstring = tempstring+s[i] ;
if ( !tempstring.empty() ) {
temp.graduate = atoi( tempstring.c_str() ) ;
list.push_back( temp ) ; // if the graduate number is a empty blank
} // than ignore this data
temp.schoolName.clear() ;
temp.deptCode.clear() ;
temp.deptName.clear() ;
temp.dayType.clear() ;
temp.level.clear() ;
temp.stdnt.clear() ;
temp.teacher.clear() ;
} // while
} // Read()
// *************************************************
void Print() {
cout << "*** There are " << modifiedList.size() << " matched records, listed as below:" << endl ;
for ( int i = 0 ; i < modifiedList.size() ; i++ ) {
cout << "[" << i+1 << "] " << modifiedList[i].schoolName << modifiedList[i].deptName << ",\t"\
<< modifiedList[i].dayType << ",\t" << modifiedList[i].level << ",\t" << modifiedList[i].graduate << endl ;
}
cout << "*******************************************************************\n" << endl ;
} // Print
// *************************************************
bool LoadIn( std::string num ) {
// load in by file
std::string read = "input";
read.append( num ) ;
read.append( ".txt") ;
fin.open( read.c_str(), ios::in ); // file open / read
if ( !fin )
return false ;
else {
Read() ;
// "getline" or "get" here (input)
fin.close() ;
return true ;
} // end else
} // LoadIn()
// *************************************************
void WriteOut( std::string num ) {
std::string write ;
write = "output" ;
write.append( num ) ;
write.append( "txt" ) ;
fout.open( write.c_str(), ios::out ); // file open / out & append ( ios::out|ios::app )
// fout << "Hello!! success" << endl; // output data in file
fout.close() ;
cout << "\nFile build : " << fout << endl ;
} // WriteOut()
// *************************************************
void Pick( std::string sName, std::string dName, std::string dType, std::string level ) {
std::size_t found ;
for ( int i = 0 ; i < list.size() ; i++ ) {
found = list[i].schoolName.find( sName ) ;
if ( sName == "*" || found != std::string::npos ) {
found = list[i].deptName.find( dName ) ;
if ( dName == "*" || found != std::string::npos ) {
found = list[i].dayType.find( dType ) ;
if ( dType == "*" || found != std::string::npos ) {
found = list[i].level.find( level ) ;
if ( level == "*" || found != std::string::npos )
modifiedList.push_back( list[i] ) ; // all matched
}
}
}
}
}
void BuildHeap() {
heap = new Heap( modifiedList.size() ) ;
for ( int i = 0 ; i < modifiedList.size() ; i++ ) {
Item newItem ;
newItem.num = i+1 ; // stream number
newItem.graduate = modifiedList[i].graduate ;
heap->HeapInsert( newItem, i ) ;
}
heap->HeapPrint( modifiedList.size() ) ;
}
};
int main() {
Assignment assignment ;
std::string num ;
std::string schoolName ;
std::string deptName ;
std::string dayType ;
std::string level ;
std::string command = "87" ;
cout << "Input the file number: 101, 102, ... [0]Quit" << endl ;
cin >> num ;
if ( num == "0" ) return 0 ;
while ( num != "0" ) {
if ( !assignment.LoadIn( num ) ) {
cout << "No such file, please enter again!" << endl << "Input the file number: 101, 102, ... [0]Quit" << endl ;
cin >> num ;
if ( num == "0" ) return 0 ;
}
else num = "0" ;
}
while ( command != "0" ) {
cout << "\n\n************************************************************\n" ;
cout << "*** Mission One: Select Matched Records from a Text File ***\n" ;
cout << "************************************************************\n" ;
cout << "Enter a keyword of 學校名稱: [*]for all" << endl ;
getline( cin, num ) ; // read trash ( \n )
getline( cin, schoolName ) ;
cout << "Enter a keyword of 科系名稱: [*]for all" << endl ;
getline( cin, deptName );
cout << "Enter a keyword of 日間/進修別: [*]for all" << endl ;
getline( cin, dayType ) ;
cout << "Enter a keyword of 等級別: [*]for all" << endl ;
getline( cin, level ) ;
assignment.Pick( schoolName, deptName, dayType, level ) ;
assignment.Print() ;
system("pause") ;
cout << "\n@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@" << endl ;
cout << "@@@ Mission Two: Build a Max Heap from the Selected Data @@@" << endl ;
cout << "@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@\n" << endl ;
cout << "<Max Heap>" << endl ;
if ( assignment.getMSize() == 0 )
cout << "### There is nothing mathced! ###" << endl ;
else
assignment.BuildHeap() ;
cout << "\n[0]Quit or [Any other]continue?" << endl ;
cin >> command ;
assignment.Clear() ;
}
} // main()
| [
"yang870313@gmail.com"
] | yang870313@gmail.com |
282dddfb2c05304cdfc6d8fca31cf8838ad76261 | 73c170c1fd36044d834853883fd8c555b12a065d | /src/show.h | a97d9fabea02db3e5c489cb98db60bd1d2e3d1b1 | [] | no_license | LnL7/scp2 | ce1fc5ce8408e69d6bf1ae229bf74494dcd1c095 | d9196137ea334b6b484e621517cb25ab414444be | refs/heads/master | 2016-09-07T18:54:48.382718 | 2014-11-24T13:02:32 | 2014-11-24T13:02:32 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 297 | h | #include "types.h"
#ifndef SHOW_H
#define SHOW_H
namespace Show {
template< class A
, class Show = typename A::Show >
String show(const A& a) { return Show(a).s; }
OString buf() {
OString os;
os.setf(std::ios::fixed);
os.precision(2);
return os;
}
};
#endif
| [
"daiderd@gmail.com"
] | daiderd@gmail.com |
7974965a1e23d05763f2508866076efcb560c04b | f049bfc58b5f7076e03b23e4508b0e63e2089890 | /Week_07/547.朋友圈.cpp | 46d97b3bf001e739a619ec38f579246e38877448 | [] | no_license | kangshuaibing/algorithm014-algorithm014 | 7335014eac544f642c961805137f39d6078fa774 | 879df27da75fac6042583d1e4a234ce7cb81c747 | refs/heads/master | 2022-12-28T20:14:26.640776 | 2020-10-16T08:32:50 | 2020-10-16T08:32:50 | 287,421,050 | 0 | 0 | null | 2020-08-14T02:04:45 | 2020-08-14T02:04:45 | null | UTF-8 | C++ | false | false | 187 | cpp | /*
* @lc app=leetcode.cn id=547 lang=cpp
*
* [547] 朋友圈
*/
// @lc code=start
class Solution {
public:
int findCircleNum(vector<vector<int>>& M) {
}
};
// @lc code=end
| [
"1326799350@qq.com"
] | 1326799350@qq.com |
4723ea6198ccff811412c423dfc8c9aceae61e85 | 6b40e9dccf2edc767c44df3acd9b626fcd586b4d | /NT/multimedia/dshow/filters/core/filgraph/filgraph/efcache.h | 3ee92656303941851a5c97c28049233c13d6b7eb | [] | no_license | jjzhang166/WinNT5_src_20201004 | 712894fcf94fb82c49e5cd09d719da00740e0436 | b2db264153b80fbb91ef5fc9f57b387e223dbfc2 | refs/heads/Win2K3 | 2023-08-12T01:31:59.670176 | 2021-10-14T15:14:37 | 2021-10-14T15:14:37 | 586,134,273 | 1 | 0 | null | 2023-01-07T03:47:45 | 2023-01-07T03:47:44 | null | UTF-8 | C++ | false | false | 1,666 | h | // Copyright (c) Microsoft Corporation 1999. All Rights Reserved
//
//
// efcache.h
// Definition of CEnumCacheFilter which implementents
// the filter enumerator for the filter cache
//
#ifndef EnumCachedFilter_h
#define EnumCachedFilter_h
class CMsgMutex;
class CFilterCache;
class CEnumCachedFilter : public IEnumFilters, public CUnknown
{
public:
CEnumCachedFilter( CFilterCache* pEnumeratedFilterCache, CMsgMutex* pcsFilterCache );
~CEnumCachedFilter();
// IUnknown Interface
DECLARE_IUNKNOWN
// INonDelegatingUnknown Interface
STDMETHODIMP NonDelegatingQueryInterface( REFIID riid, void** ppv );
// IEnumFilters Interface
STDMETHODIMP Next( ULONG cFilters, IBaseFilter** ppFilter, ULONG* pcFetched );
STDMETHODIMP Skip( ULONG cFilters );
STDMETHODIMP Reset( void );
STDMETHODIMP Clone( IEnumFilters** ppCloanedEnum );
private:
CEnumCachedFilter::CEnumCachedFilter
(
CFilterCache* pEnumeratedFilterCache,
CMsgMutex* pcsFilterCache,
POSITION posCurrentFilter,
DWORD dwCurrentCacheVersion
);
void Init
(
CFilterCache* pEnumeratedFilterCache,
CMsgMutex* pcsFilterCache,
POSITION posCurrentFilter,
DWORD dwCurrentCacheVersion
);
bool IsEnumOutOfSync( void );
bool GetNextFilter( IBaseFilter** ppNextFilter );
bool AdvanceCurrentPosition( void );
CFilterCache* m_pEnumeratedFilterCache;
DWORD m_dwEnumCacheVersion;
POSITION m_posCurrentFilter;
CMsgMutex* m_pcsFilterCache;
};
#endif // EnumCachedFilter_h
| [
"seta7D5@protonmail.com"
] | seta7D5@protonmail.com |
366c8023dc7f88cf4ca0cd48daa7646d5ea3abad | 87990bd79a7305428fb9e324dab7103e14010ccf | /include/Mesh.hpp | c960147e15f9dbcf5883f8f0daa1c7c9eefef13d | [] | no_license | code-overseer/Gravity | 6b68ff0f8f26ac6a79639722daceb9ad08878454 | 1514834486706608176c7be3f7f1c257b6b400b6 | refs/heads/master | 2023-02-04T22:29:29.084036 | 2020-03-21T20:26:19 | 2020-03-21T20:26:19 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 578 | hpp | #ifndef GRAVITY_MESH_HPP
#define GRAVITY_MESH_HPP
#include <mathsimd.hpp>
#include <vector>
#include <cstdint>
namespace gravity {
struct Mesh {
Mesh() = default;
Mesh(Mesh const&mesh) = default;
Mesh(Mesh &&mesh) noexcept : vertices(std::move(mesh.vertices)), triangles(std::move(mesh.triangles)) {}
Mesh& operator=(Mesh const&mesh);
Mesh& operator=(Mesh &&mesh) noexcept ;
std::vector<mathsimd::float2> vertices;
std::vector<uint16_t> triangles;
static Mesh makeCircle();
};
}
#endif //GRAVITY_MESH_HPP
| [
"wongjengyan@gmail.com"
] | wongjengyan@gmail.com |
b3b5a6dd72a5918bc6d9e04381331f5ac253efa2 | 402b890909f0bea35c52bf5c67cf47c49ec7b93b | /11 - GTLib/weblapok_GTlib jeles/webpageEnor.cpp | 42cb8476cbacca15b5141f05600952353c8a3b19 | [] | no_license | kovacs-levent/ELTEProg | 528baee1bb8bd57b17087eee1e095997a29586f2 | 2f8c0ee953628381709ba0876943568b038156f6 | refs/heads/master | 2020-07-27T14:54:52.652474 | 2019-05-15T16:56:19 | 2019-05-15T16:56:19 | 145,883,210 | 3 | 2 | null | null | null | null | UTF-8 | C++ | false | false | 297 | cpp | #include "webpageEnor.h"
void webpageEnor::next()
{
isEnd = f.end();
if(!isEnd)
{
actpage.url = f.current().url;
unpopular up(actpage.url, f.current().onceUnpopular);
up.addEnumerator(&f);
up.run();
actpage.onceUnpopular = up.result();
}
}
| [
"42651399+kovacs-levent@users.noreply.github.com"
] | 42651399+kovacs-levent@users.noreply.github.com |
8475dde519418d51419088b94478785dbf73f91c | 0eff74b05b60098333ad66cf801bdd93becc9ea4 | /second/download/squid/gumtree/squid_repos_function_2865_last_repos.cpp | 71914a1f7d705a1154da57e4c7467f8963cd9b6e | [] | no_license | niuxu18/logTracker-old | 97543445ea7e414ed40bdc681239365d33418975 | f2b060f13a0295387fe02187543db124916eb446 | refs/heads/master | 2021-09-13T21:39:37.686481 | 2017-12-11T03:36:34 | 2017-12-11T03:36:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 698 | cpp | static void
snmpConstructReponse(SnmpRequest * rq)
{
struct snmp_pdu *RespPDU;
debugs(49, 5, "snmpConstructReponse: Called.");
if (UsingSmp() && IamWorkerProcess()) {
AsyncJob::Start(new Snmp::Forwarder(static_cast<Snmp::Pdu&>(*rq->PDU),
static_cast<Snmp::Session&>(rq->session), rq->sock, rq->from));
snmp_free_pdu(rq->PDU);
return;
}
RespPDU = snmpAgentResponse(rq->PDU);
snmp_free_pdu(rq->PDU);
if (RespPDU != NULL) {
snmp_build(&rq->session, RespPDU, rq->outbuf, &rq->outlen);
comm_udp_sendto(rq->sock, rq->from, rq->outbuf, rq->outlen);
snmp_free_pdu(RespPDU);
}
} | [
"993273596@qq.com"
] | 993273596@qq.com |
c5384efb2b6f0acf6aa88dbba7a23cfa935d093b | 47cceefe390101069de80d0b1af4ee7bdbec1d6e | /groups/bdl/bdlmt/bdlmt_multiprioritythreadpool.t.cpp | 5439a5d30ece12d8280934b0478c047c89ca5870 | [
"Apache-2.0"
] | permissive | mversche/bde | a184da814209038c8687edaa761f420aa3234ae2 | 842c7e5c372eb5c29f7984f3beb4010d1c493521 | refs/heads/master | 2021-01-21T23:45:25.376416 | 2015-11-06T19:15:10 | 2015-11-06T19:15:10 | 29,453,231 | 2 | 0 | null | 2015-01-19T04:13:24 | 2015-01-19T04:13:22 | null | UTF-8 | C++ | false | false | 63,997 | cpp | // bdlmt_multiprioritythreadpool.t.cpp -*-C++-*-
// ----------------------------------------------------------------------------
// NOTICE
//
// This component is not up to date with current BDE coding standards, and
// should not be used as an example for new development.
// ----------------------------------------------------------------------------
#include <bdlmt_multiprioritythreadpool.h>
#include <bslim_testutil.h>
#include <bdlcc_queue.h>
#include <bdlma_concurrentpool.h>
#include <bslmt_barrier.h>
#include <bslmt_lockguard.h>
#include <bslmt_mutex.h>
#include <bslmt_qlock.h>
#include <bdlt_currenttime.h>
#include <bsl_algorithm.h>
#include <bsl_cctype.h>
#include <bsl_cstdio.h>
#include <bsl_cstdlib.h> // atoi()
#include <bsl_cstring.h>
#include <bsl_iostream.h>
#include <bsl_list.h>
#include <bsl_string.h>
#include <bslma_default.h>
#include <bslma_defaultallocatorguard.h>
#include <bslma_newdeleteallocator.h>
#include <bslma_testallocator.h>
#include <bslma_testallocator.h> // for testing only
#include <bsls_atomic.h>
#include <bsls_timeinterval.h>
#include <sys/stat.h>
#include <sys/types.h>
using namespace BloombergLP;
using namespace bsl; // automatically added by script
// ============================================================================
// TEST PLAN
// ----------------------------------------------------------------------------
// Overview
// --------
//
// ----------------------------------------------------------------------------
// ----------------------------------------------------------------------------
//
// CREATORS
// [ 4] all constructors, destructor
//
// MANIPULATORS
// [ 2] enqueueJob(void (*)(), void *)
// [ 6] enqueueJob(ThreadFunctor)
// [ 3] drainJobs()
// [ 5] enableQueue(), disableQueue(), isEnabled()
// [ 5] startThreads(), stopThreads(), isStarted(), numStartedThreads()
// [ 5] suspendProcessing(), resumeProcessing(), isSuspended()
// [ 9] removeJobs()
// [ 9] shutdown()
//
// ACCESSORS
// [ 4] numThreads()
// [ 4] numPriorities()
// [ 6] numPendingJobs()
// [ 8] numActiveThreads()
//
// ----------------------------------------------------------------------------
// [ 1] BREATHING TEST
// [ 6] // transitions between non-processing states
// [ 6] // enqueuing fails on disabled queue
// [ 7] // queue sorting
// [10] stress test
// [11] ignoring 'joinable' trait of attributes passed
// [12] usage example 2
// [13] usage example 1
// ============================================================================
// STANDARD BDE ASSERT TEST FUNCTION
// ----------------------------------------------------------------------------
namespace {
int testStatus = 0;
void aSsErT(bool condition, const char *message, int line)
{
if (condition) {
cout << "Error " __FILE__ "(" << line << "): " << message
<< " (failed)" << endl;
if (0 <= testStatus && testStatus <= 100) {
++testStatus;
}
}
}
} // close unnamed namespace
// ============================================================================
// STANDARD BDE TEST DRIVER MACRO ABBREVIATIONS
// ----------------------------------------------------------------------------
#define ASSERT BSLIM_TESTUTIL_ASSERT
#define ASSERTV BSLIM_TESTUTIL_ASSERTV
#define LOOP_ASSERT BSLIM_TESTUTIL_LOOP_ASSERT
#define LOOP0_ASSERT BSLIM_TESTUTIL_LOOP0_ASSERT
#define LOOP1_ASSERT BSLIM_TESTUTIL_LOOP1_ASSERT
#define LOOP2_ASSERT BSLIM_TESTUTIL_LOOP2_ASSERT
#define LOOP3_ASSERT BSLIM_TESTUTIL_LOOP3_ASSERT
#define LOOP4_ASSERT BSLIM_TESTUTIL_LOOP4_ASSERT
#define LOOP5_ASSERT BSLIM_TESTUTIL_LOOP5_ASSERT
#define LOOP6_ASSERT BSLIM_TESTUTIL_LOOP6_ASSERT
#define Q BSLIM_TESTUTIL_Q // Quote identifier literally.
#define P BSLIM_TESTUTIL_P // Print identifier and value.
#define P_ BSLIM_TESTUTIL_P_ // P(X) without '\n'.
#define T_ BSLIM_TESTUTIL_T_ // Print a tab (w/o newline).
#define L_ BSLIM_TESTUTIL_L_ // current Line number
// ============================================================================
// GLOBAL TYPEDEFS, CONSTANTS, ROUTINES & MACROS FOR TESTING
// ----------------------------------------------------------------------------
typedef bdlmt::MultipriorityThreadPool Obj;
#define LO_ARRAY_LENGTH(array) (sizeof(array) / sizeof((array)[0]))
namespace {
// Have the default allocator be of different type than the allocator usually
// used -- then we can put breakpoints in bslma::TestAllocator code to find
// unintentional uses of the default allocator.
bslma::NewDeleteAllocator taDefault;
bslma::TestAllocator ta;
int verbose;
int veryVerbose;
int veryVeryVerbose;
int veryVeryVeryVerbose;
} // close unnamed namespace
// ============================================================================
// Classes for test case 13 -- usage example 1
// ============================================================================
namespace MULTIPRIORITYTHREADPOOL_CASE_13 {
// The idea here is we have a large number of jobs submitted in too little time
// for all of them to be completed. All jobs take the same amount of time to
// complete, but there are two different priorities of jobs. There are 100
// times more jobs of less urgent priority than of the more urgent priority,
// and there is more than enough time for the jobs of more urgent priority to
// be completed. Verify that all the jobs of more urgent priority get
// completed while most of the jobs of less urgent priority do not. This
// demonstrates that we can construct an arrangement where traffic of low
// priority, while massively more numerous, does not impede the progress of
// higher priority jobs.
bsls::AtomicInt urgentJobsDone;
bsls::AtomicInt lessUrgentJobsDone;
extern "C" void *urgentJob(void *) {
bslmt::ThreadUtil::microSleep(10000); // 10 mSec
++urgentJobsDone;
return 0;
}
extern "C" void *lessUrgentJob(void *) {
bslmt::ThreadUtil::microSleep(10000); // 10 mSec
++lessUrgentJobsDone;
return 0;
}
} // close namespace MULTIPRIORITYTHREADPOOL_CASE_13
// ============================================================================
// Classes for test case 12 -- usage example 2
// ============================================================================
// The idea here is to have a multithreaded algorithm for calculating prime
// prime numbers. This is just to serve as an illustration, although it works,
// it is not really any faster than doing it with a single thread.
//
// For every prime number P, we have to mark all multiples of it up in two
// ranges '[P .. P**2]', and '[P**2 .. TOP_NUMBER]' as non-prime. For any
// P**2, if we can determine that all primes below P have marked all their
// multiples up to P**2, then we can scan that range and any unmarked values in
// it will be a new prime. The we can start out with our first prime, 2, and
// mark all primes between it and 2**2 == 4, thus discovering 3 is prime. Once
// we have marked all multiples of 2 and 3 below 3*3 == 9, we can then scan
// that range and discover 5 and 7 are primes, and repeat the process to
// discover bigger and bigger primes until we have covered an entire range, in
// this example all ints below TOP_NUMBER == 2000.
namespace MULTIPRIORITYTHREADPOOL_CASE_12 {
enum {
TOP_NUMBER = 2000,
NUM_PRIORITIES = 32
};
bool isStillPrime[TOP_NUMBER];
bsls::AtomicInt scannedTo[TOP_NUMBER]; // is P is a prime, what is the highest
// multiple of P that we have marked
// isStillPrime[P] = false;
bsls::AtomicInt maxPrimeFound; // maximum prime we have identified so far
int primeNumbers[TOP_NUMBER]; // elements in the range
// '0 .. numPrimeNumbers - 1' are the prime
// numbers we have found so far
bsls::AtomicInt numPrimeNumbers;
bdlmt::MultipriorityThreadPool *threadPool;
bool doneFlag; // set this flag to signal other jobs
// that we're done
bslmt::Barrier doneBarrier(2); // we wait on this barrier to signal
// the main thread that we're done
struct Functor {
static bslmt::Mutex s_mutex;
int d_numToScan;
int d_priority;
int d_limit;
Functor(int numToScan)
: d_numToScan(numToScan)
, d_priority(0)
{
d_limit = (int) bsl::min((double) numToScan * numToScan,
(double) TOP_NUMBER);
}
void setNewPrime(int newPrime) {
maxPrimeFound = newPrime;
primeNumbers[numPrimeNumbers] = newPrime;
++numPrimeNumbers;
if (2 * newPrime < TOP_NUMBER) {
Functor f(newPrime);
threadPool->enqueueJob(f, 0);
}
}
void evaluateCandidatesForPrime() {
if (maxPrimeFound > d_limit) {
return; // RETURN
}
int numToScanI;
for (numToScanI = numPrimeNumbers - 1; 0 < numToScanI; --numToScanI) {
if (primeNumbers[numToScanI] == d_numToScan) {
break;
}
}
for (int i = numToScanI - 1; 0 < i; --i) {
if (TOP_NUMBER < scannedTo[primeNumbers[i]]) {
for (int j = i + 1; numPrimeNumbers > j; ++j) {
if (TOP_NUMBER == scannedTo[primeNumbers[j]]) {
scannedTo[primeNumbers[j]] = TOP_NUMBER + 1;
}
else {
break;
}
}
break;
}
if (scannedTo[primeNumbers[i]] < d_limit) {
// Not all multiples of all prime numbers below us have been
// adequately marked as nonPrime. We cannot yet draw any new
// conclusions about what is and what is not prime in this
// range.
// Resubmit ourselves to back of the priority queue so that
// we'll get reevaluated when previous prime numbers are done
// scanning. Note we could get reenqueued several times.
// Note that jobs marking the isStillPrime array are at
// priority 0, while later incarnations that can only set new
// primes are at priority 1 and keep getting resubmitted at
// less and less urgent priorities until all their
// prerequisites (which are at priority 0) are done.
d_priority = bsl::min(NUM_PRIORITIES - 2, d_priority + 1);
threadPool->enqueueJob(*this, d_priority);
return; // RETURN
}
}
// everything up to d_limit that has not been marked nonPrime is prime
bslmt::LockGuard<bslmt::Mutex> guard(&s_mutex);
for (int i = maxPrimeFound + 1; d_limit > i; ++i) {
if (isStillPrime[i]) {
setNewPrime(i);
}
}
if (TOP_NUMBER == d_limit && !doneFlag) {
// We have successfully listed all primes below TOP_NUMBER. Touch
// the done barrier and our caller will then know that we are done
// and shut down the queue.
doneFlag = true;
doneBarrier.wait();
}
}
void operator()() {
if (0 == d_priority) {
bsls::AtomicInt& rScannedTo = scannedTo[d_numToScan];
#if 0
bsls::AtomicInt& rScannedTo(scannedTo[d_numToScan]);
#endif
for (int i = d_numToScan; d_limit > i; i += d_numToScan) {
isStillPrime[i] = false;
rScannedTo = i;
}
d_priority = 1;
threadPool->enqueueJob(*this, d_priority);
for (int i = d_limit; TOP_NUMBER > i; i += d_numToScan) {
isStillPrime[i] = false;
rScannedTo = i;
}
rScannedTo = TOP_NUMBER;
}
else {
evaluateCandidatesForPrime();
}
}
};
bslmt::Mutex Functor::s_mutex;
} // close namespace MULTIPRIORITYTHREADPOOL_CASE_12
// ============================================================================
// Classes for test case 11
// ============================================================================
namespace MULTIPRIORITYTHREADPOOL_CASE_11 {
struct Functor {
bslmt::Barrier *d_barrier;
bsls::AtomicInt *d_jobsCompleted;
void operator()() {
d_barrier->wait();
bslmt::ThreadUtil::microSleep(50 * 1000); // 0.05 sec
bslmt::ThreadUtil::yield();
bslmt::ThreadUtil::microSleep(50 * 1000); // 0.05 sec
++*d_jobsCompleted;
}
};
} // close namespace MULTIPRIORITYTHREADPOOL_CASE_11
// ============================================================================
// Classes for test case 10
// ============================================================================
namespace MULTIPRIORITYTHREADPOOL_CASE_10 {
enum {
NUM_PRIORITIES = 2,
PRIORITY_MASK = 1,
NUM_POOL_THREADS = 2,
NUM_PRODUCER_THREADS = 25
};
struct Worker {
int d_priority;
int d_submittedTime;
int d_doneTime;
static bdlmt::MultipriorityThreadPool *s_pool;
static bdlcc::Queue<Worker> *s_doneQueue;
static bsls::AtomicInt s_time;
Worker(int priority) {
d_priority = priority;
}
int submitMe() {
d_submittedTime = ++s_time;
if (s_pool->enqueueJob(*this, d_priority)) {
return -1; // RETURN
}
return 0;
}
void operator()() {
d_doneTime = ++s_time;
s_doneQueue->pushBack(*this);
}
};
bdlmt::MultipriorityThreadPool *Worker::s_pool = 0;
bdlcc::Queue<Worker> *Worker::s_doneQueue = 0;
bsls::AtomicInt Worker::s_time;
struct ProducerThread {
int d_workersPerProducer;
static bslmt::Barrier *s_barrier;
ProducerThread(int workersPerProducer)
: d_workersPerProducer(workersPerProducer) {}
void operator()() {
s_barrier->wait();
int i;
for (i = 0; d_workersPerProducer > i; ++i) {
Worker w(i & PRIORITY_MASK);
if (w.submitMe()) {
break;
}
}
if (veryVerbose && d_workersPerProducer - i) {
static bslmt::Mutex mutex;
bslmt::LockGuard<bslmt::Mutex> lock(&mutex);
cout << "Aborted with " << d_workersPerProducer - i <<
" submissions to go\n";
}
}
};
bslmt::Barrier *ProducerThread::s_barrier = 0;
} // close namespace MULTIPRIORITYTHREADPOOL_CASE_10
// ============================================================================
// Classes for test case 8
// ============================================================================
namespace MULTIPRIORITYTHREADPOOL_CASE_8 {
bool veryVerboseCase8;
bslmt::Barrier barrier2(2);
bslmt::Barrier barrier8(8);
struct BlockFunctor {
void operator()() {
barrier2.wait();
barrier8.wait();
#if 0
static bslmt::Mutex *mutex_p;
BSLMT_ONCE_DO {
static bslmt::Mutex mutex;
mutex_p = &mutex;
}
bslmt::LockGuard<bslmt::Mutex> lock(mutex_p);
#endif
static bslmt::QLock mutex = BSLMT_QLOCK_INITIALIZER;
bslmt::QLockGuard guard(&mutex);
if (veryVerboseCase8) cout << "Thread finishing\n";
}
};
} // close namespace MULTIPRIORITYTHREADPOOL_CASE_8
// ============================================================================
// Classes for test case 5
// also partially used in cases 4, 6, and 7
// ============================================================================
namespace MULTIPRIORITYTHREADPOOL_CASE_5 {
long resultsVec[100];
bsls::AtomicInt resultsVecIdx;
extern "C" void *pushInt(void *arg)
{
resultsVec[resultsVecIdx++] = (char *) arg - (char *) 0;
return 0;
}
struct PushIntFunctor {
int d_arg;
void operator()() {
resultsVec[resultsVecIdx++] = d_arg;
}
};
// Generally check out that a threadpool is healthy, given the state it thinks
// it's in.
void checkOutPool(bdlmt::MultipriorityThreadPool *pool) {
ASSERT(pool->isEnabled());
ASSERT(0 == pool->numActiveThreads());
LOOP_ASSERT(pool->numPendingJobs(), 0 == pool->numPendingJobs());
if (pool->isStarted()) {
ASSERT(16 == pool->numStartedThreads());
}
else {
ASSERT(0 == pool->numStartedThreads());
}
if (pool->isStarted() && !pool->isSuspended()) {
memset(resultsVec, 0x3f, sizeof(resultsVec));
resultsVecIdx = 0;
for (long i = 0; 10 > i; ++i) {
pool->enqueueJob(&pushInt, (void *) (i * i), 1);
}
pool->drainJobs();
ASSERT(10 == resultsVecIdx);
sort(resultsVec, resultsVec + resultsVecIdx);
for (int i = 0; 10 > i; ++i) {
ASSERT(resultsVec[i] == i * i);
}
}
else {
for (long i = 0; 10 > i; ++i) {
pool->enqueueJob(&pushInt, (void *) (i * i), 1);
}
ASSERT(0 == pool->numActiveThreads());
bslmt::ThreadUtil::microSleep(10 * 1000);
LOOP_ASSERT(pool->numPendingJobs(), 10 == pool->numPendingJobs());
pool->removeJobs();
}
ASSERT(0 == pool->numPendingJobs());
}
} // close namespace MULTIPRIORITYTHREADPOOL_CASE_5
// ============================================================================
// Classes for test case 3
// ============================================================================
namespace MULTIPRIORITYTHREADPOOL_CASE_3 {
long counter;
extern "C" void *sleepAndAmassCounterBy(void *arg)
{
bslmt::ThreadUtil::microSleep(50 * 1000); // 50 mSeconds
counter += (char *) arg - (char *) 0;
counter *= counter;
return 0;
}
} // close namespace MULTIPRIORITYTHREADPOOL_CASE_3
// ============================================================================
// Classes for test case 2
// ============================================================================
namespace MULTIPRIORITYTHREADPOOL_CASE_2 {
int callCount;
long counter;
extern "C" void *amassCounterBy(void *arg)
{
++callCount;
counter += (char *) arg - (char *) 0;
counter *= counter;
return 0;
}
extern "C" void *waiter(void *arg) {
static_cast<bslmt::Barrier *>(arg)->wait();
return 0;
}
} // close namespace MULTIPRIORITYTHREADPOOL_CASE_2
// ============================================================================
// Classes for test case 1 - breathing test
// ============================================================================
namespace MULTIPRIORITYTHREADPOOL_CASE_1 {
bsls::AtomicInt counter;
extern "C" void *incCounter(void *)
{
++counter;
return 0;
}
} // close namespace MULTIPRIORITYTHREADPOOL_CASE_1
// ============================================================================
// MAIN PROGRAM
// ----------------------------------------------------------------------------
int main(int argc, char *argv[])
{
int test = argc > 1 ? atoi(argv[1]) : 0;
verbose = argc > 2;
veryVerbose = argc > 3;
veryVeryVerbose = argc > 4;
veryVeryVeryVerbose = argc > 5;
bslma::DefaultAllocatorGuard guard(&taDefault);
ASSERT(&taDefault == bslma::Default::defaultAllocator());
cout << "TEST " << __FILE__ << " CASE " << test << endl;;
switch (test) { case 0: // Zero is always the leading case.
case 13: {
// --------------------------------------------------------------------
// USAGE EXAMPLE 1
//
// Concerns:
// That usage example 1 compiles and links.
// --------------------------------------------------------------------
if (verbose) {
cout << "===============\n"
"Usage example 2\n"
"===============\n";
}
using namespace MULTIPRIORITYTHREADPOOL_CASE_13;
bdlmt::MultipriorityThreadPool pool(20, // threads
2, // priorities
&ta);
bsls::TimeInterval finishTime = bdlt::CurrentTime::now() + 0.5;
pool.startThreads();
for (int i = 0; 100 > i; ++i) {
for (int j = 0; 100 > j; ++j) {
pool.enqueueJob(&lessUrgentJob, (void *) 0, 1); // less urgent
// priority
}
pool.enqueueJob(&urgentJob, (void *) 0, 0); // urgent priority
}
bslmt::ThreadUtil::sleep(finishTime - bdlt::CurrentTime::now());
pool.shutdown();
if (verbose) {
bsl::cout << "Jobs done: urgent: " << urgentJobsDone <<
", less urgent: " << lessUrgentJobsDone << bsl::endl;
}
} break;
case 12: {
// --------------------------------------------------------------------
// USAGE EXAMPLE 2
//
// Concerns:
// That usage example 2 compiles and links.
// --------------------------------------------------------------------
using namespace MULTIPRIORITYTHREADPOOL_CASE_12;
double startTime = bdlt::CurrentTime::now().totalSecondsAsDouble();
for (int i = 0; TOP_NUMBER > i; ++i) {
isStillPrime[i] = true;
scannedTo[i] = 0;
}
scannedTo[0] = TOP_NUMBER + 1;
scannedTo[1] = TOP_NUMBER + 1;
maxPrimeFound = 2;
primeNumbers[0] = 2;
numPrimeNumbers = 1;
doneFlag = false;
threadPool =
new (ta) bdlmt::MultipriorityThreadPool(20, NUM_PRIORITIES, &ta);
threadPool->startThreads();
double startJobs = bdlt::CurrentTime::now().totalSecondsAsDouble();
Functor f(2);
threadPool->enqueueJob(f, 0);
doneBarrier.wait();
double finish = bdlt::CurrentTime::now().totalSecondsAsDouble();
threadPool->shutdown();
ta.deleteObjectRaw(threadPool);
if (verbose) {
double now = bdlt::CurrentTime::now().totalSecondsAsDouble();
printf("Runtime: %g seconds, %g seconds w/o init & cleanup\n",
now - startTime,
finish - startJobs);
printf("%d prime numbers below %d:", (int) numPrimeNumbers,
TOP_NUMBER);
for (int i = 0; numPrimeNumbers > i; ++i) {
printf("%s%4d", 0 == i % 10 ? "\n " : ", ",
primeNumbers[i]);
}
printf("\n");
}
} break;
case 11: {
// --------------------------------------------------------------------
// JOINABLE ATTRIBUTE IGNORED TEST
//
// Concerns:
// That the joinable/detached characteristic of attributes passed
// to the threadpool is ignored.
//
// Plan:
// Create threadpools with attributes specified, both with joinable
// and detached state, and in both cases verify that 'stopThreads()'
// blocks until all started jobs have been completed.
// --------------------------------------------------------------------
using namespace MULTIPRIORITYTHREADPOOL_CASE_11;
if (verbose) {
cout << "===================================\n"
"Testing attribute qualities ignored\n"
"===================================\n";
}
enum {
NUM_THREADS = 10
};
enum {
ATTRIB_DEFAULT,
ATTRIB_DETACHED,
ATTRIB_JOINABLE
};
bslmt::Barrier barrier(NUM_THREADS + 1);
bsls::AtomicInt jobsCompleted;
Functor functor;
functor.d_barrier = &barrier;
functor.d_jobsCompleted = &jobsCompleted;
for (int attrState = ATTRIB_JOINABLE; attrState >= ATTRIB_DEFAULT;
--attrState) {
bslma::TestAllocator localTa;
bslmt::ThreadAttributes attrib;
if (ATTRIB_DETACHED == attrState) {
attrib.setDetachedState(
bslmt::ThreadAttributes::e_CREATE_DETACHED);
}
else if (ATTRIB_JOINABLE == attrState) {
attrib.setDetachedState(
bslmt::ThreadAttributes::e_CREATE_JOINABLE);
}
jobsCompleted = 0;
bdlmt::MultipriorityThreadPool pool(NUM_THREADS,
1, // # priorities
attrib,
&localTa);
pool.startThreads();
for (int i = 0; NUM_THREADS > i; ++i) {
pool.enqueueJob(functor, 0);
}
barrier.wait(); // we know all threads have started jobs when
// we pass this point
pool.stopThreads();
ASSERT(NUM_THREADS == jobsCompleted); // verifies that the stop
// blocked until all jobs
// were completed
if (veryVerbose) {
cout << "Pass " << attrState << " completed\n";
}
}
} break;
case 10: {
// --------------------------------------------------------------------
// STRESS TEST
//
// Concerns:
// Run many jobs on a threadpool, verify that more urgent jobs
// get done faster than less urgent ones.
//
// Plan:
// Using an atomicInt as a 'timer', have a lightweight job that is
// a functor that records two times -- when it is submitted to the
// threadpool, and when the functor is executed. Submit otherwise
// identical jobs of varying priorities, and observe at the end
// that jobs of more urgent priority got executed faster than
// jobs of lower priority.
// --------------------------------------------------------------------
if (verbose) {
cout << "===========\n"
"Stress Test\n"
"===========\n";
}
using namespace MULTIPRIORITYTHREADPOOL_CASE_10;
bslma::TestAllocator taDefaultLocal;
bslma::DefaultAllocatorGuard guard(&taDefaultLocal);
bdlcc::Queue<Worker> doneQueue(&ta);
Worker::s_doneQueue = &doneQueue;
enum {
NUM_WORKERS_PER_PRODUCER = 1000
};
bdlmt::MultipriorityThreadPool pool(NUM_POOL_THREADS,
NUM_PRIORITIES,
&ta);
Worker::s_pool = &pool;
bslmt::Barrier barrier(NUM_PRODUCER_THREADS + 1);
ProducerThread::s_barrier = &barrier;
bslmt::ThreadUtil::Handle handles[NUM_PRODUCER_THREADS];
for (int i = 0; NUM_PRODUCER_THREADS > i; ++i) {
ProducerThread producer(NUM_WORKERS_PER_PRODUCER);
bslmt::ThreadUtil::create(&handles[i], producer);
}
pool.startThreads();
LOOP_ASSERT(taDefaultLocal.numBytesMax(),
0 == taDefaultLocal.numBytesMax());
ASSERT(0 == Worker::s_time);
barrier.wait(); // set all producer threads loose
double startTime = bdlt::CurrentTime::now().totalSecondsAsDouble();
for (int i = 0; NUM_PRODUCER_THREADS > i; ++i) {
bslmt::ThreadUtil::join(handles[i]);
}
pool.drainJobs();
pool.stopThreads();
LOOP_ASSERT(taDefaultLocal.numBytesInUse(),
0 == taDefaultLocal.numBytesInUse());
if (verbose) {
cout << doneQueue.queue().length() << " mini-jobs processed in " <<
bdlt::CurrentTime::now().totalSecondsAsDouble() - startTime <<
" seconds\n";
cout << "Atomictime = " << Worker::s_time << endl;
}
ASSERT(doneQueue.queue().length() == NUM_WORKERS_PER_PRODUCER *
NUM_PRODUCER_THREADS);
int dataPoints[ NUM_PRIORITIES];
double averages[NUM_PRIORITIES]; // starts out sums
memset(dataPoints, 0, sizeof(dataPoints));
memset(averages, 0, sizeof(averages));
while (0 < doneQueue.queue().length()) {
Worker w = doneQueue.popFront();
++dataPoints[w.d_priority];
averages[ w.d_priority] += w.d_doneTime - w.d_submittedTime;
}
for (int i = 0; NUM_PRIORITIES > i; ++i) {
if (dataPoints[i]) {
averages[i] /= dataPoints[i];
}
}
if (verbose) {
T_ P(averages[0]) T_ P(averages[1])
}
LOOP2_ASSERT(averages[0], averages[1], averages[0] < averages[1]);
LOOP_ASSERT(taDefaultLocal.numBytesInUse(),
0 == taDefaultLocal.numBytesInUse());
} break;
case 9: {
// --------------------------------------------------------------------
// REMOVEJOBS AND SHUTDOWN
//
// Concerns:
// That removeJobs and shutdown can successfully cancel enqueued
// jobs before they execute.
//
// Plan:
// Create a threadpool. Before starting it, enqueue a bunch of
// jobs. Then call 'removeJobs()'. Then start and drain the
// threadpool, and verify that none of the jobs have run.
//
// Repeat the experiment, except using 'shutdown()' instead of
// 'removeJobs()'.
//
// Testing:
// removeJobs()
// shutdown()
// --------------------------------------------------------------------
if (verbose) {
cout << "================================\n"
"removeJobs() and shutdown() test\n"
"================================\n";
}
using namespace MULTIPRIORITYTHREADPOOL_CASE_5;
bdlmt::MultipriorityThreadPool pool(1, 1, &ta);
memset(resultsVec, 0x8f, sizeof resultsVec);
resultsVecIdx = 0;
pool.enqueueJob(&pushInt, (void *) 0, 0);
pool.enqueueJob(&pushInt, (void *) 0, 0);
pool.enqueueJob(&pushInt, (void *) 0, 0);
pool.enqueueJob(&pushInt, (void *) 0, 0);
ASSERT(0 == resultsVecIdx);
ASSERT(4 == pool.numPendingJobs());
pool.removeJobs();
if (verbose) {
cout << "After removeJobs(): " << pool.numPendingJobs() <<
" jobs\n";
}
ASSERT(0 == resultsVecIdx);
ASSERT(0 == pool.numPendingJobs());
pool.startThreads();
pool.drainJobs();
ASSERT(0 == resultsVecIdx);
ASSERT(0 == pool.numPendingJobs());
pool.suspendProcessing();
pool.removeJobs();
pool.enqueueJob(&pushInt, (void *) 0, 0);
pool.enqueueJob(&pushInt, (void *) 0, 0);
pool.enqueueJob(&pushInt, (void *) 0, 0);
pool.enqueueJob(&pushInt, (void *) 0, 0);
ASSERT(0 == resultsVecIdx);
ASSERT(4 == pool.numPendingJobs());
pool.shutdown();
if (verbose) {
cout << "After shutdown(): " << pool.numPendingJobs() << " jobs\n";
}
ASSERT(0 == resultsVecIdx);
ASSERT(0 == pool.numPendingJobs());
pool.startThreads();
pool.resumeProcessing();
pool.enableQueue();
pool.drainJobs();
ASSERT(0 == resultsVecIdx);
ASSERT(0 == pool.numPendingJobs());
pool.shutdown();
} break;
case 8: {
// --------------------------------------------------------------------
// NUMACTIVETHREADS ACCESSOR
//
// Concerns:
// That numActiveThreads() properly reflects the number of active
// threads.
//
// Plan:
// Create two barriers, one with a threshold of 2 and one with
// a much high threshold. Create a threadpool with a large number
// of threads. Create a functor that will block first on the first
// barrier then on the second. Repeatedly submit the functor and
// block on the first barrier, thus ensuring the job has started.
// Observe then that numActiveThreads() is equal to the number
// of executing jobs. Eventually reach the higher threshold and
// allow all jobs to finish.
//
// Testing:
// numActiveThreads()
// --------------------------------------------------------------------
if (verbose) {
cout << "=====================\n"
"numActiveThreads test\n"
"=====================\n";
}
using namespace MULTIPRIORITYTHREADPOOL_CASE_8;
enum {
NUM_THREADS = 7
};
veryVerboseCase8 = veryVerbose;
bdlmt::MultipriorityThreadPool pool(NUM_THREADS,
1, // single priority
&ta);
pool.startThreads();
for (int i = 0; 7 > i; ++i) {
BlockFunctor bfInner;
pool.enqueueJob(bfInner, 0);
barrier2.wait();
ASSERT(i + 1 == pool.numActiveThreads());
}
barrier8.wait();
pool.stopThreads();
ASSERT(0 == pool.numActiveThreads());
} break;
case 7: {
// --------------------------------------------------------------------
// QUEUE SORTING
//
// Concerns:
// That jobs in the queue are sorted by priority.
//
// Plan:
// Create a single thread threadpool. Before starting it, enqueue
// a bunch of distinctly identifiable jobs with different
// priorities. Then start and drain the threadpool, then verify
// that all the jobs have been executed in exactly the right order.
// --------------------------------------------------------------------
if (verbose) {
cout << "==================\n"
"queue sorting test\n"
"==================\n";
}
using namespace MULTIPRIORITYTHREADPOOL_CASE_5;
static const long scramble[] = { 5, 8, 3, 1, 7, 9, 0, 4, 6, 2 };
// ints 0-9 in scrambled order
const int scrambleLen = sizeof scramble / sizeof scramble[0];
const char garbageVal = 0x8f;
bdlmt::MultipriorityThreadPool pool(1, // single thread
scrambleLen, // priorities
&ta);
memset(resultsVec, garbageVal, sizeof resultsVec);
resultsVecIdx = 0;
for (int i = 0; scrambleLen > i; ++i) {
pool.enqueueJob(&pushInt,
(void *)(scramble[i] * scramble[i]),
(int)scramble[i]);
}
ASSERT(scrambleLen == pool.numPendingJobs());
pool.startThreads();
pool.drainJobs();
ASSERT(scrambleLen == resultsVecIdx);
for (int i = 0; scrambleLen > i; ++i) {
LOOP2_ASSERT(i, resultsVec[i], i * i == resultsVec[i]);
}
if (verbose) {
cout << "Results: ";
for (int i = 0; resultsVecIdx > i; ++i) {
cout << (i ? ", " : "") << resultsVec[i];
}
cout << endl;
}
pool.stopThreads();
} break;
case 6: {
// --------------------------------------------------------------------
// FURTHER TESTING OF FUNDAMENTAL THREADPOOL STATES
//
// Concerns:
// That transitions between states properly affect enqueued jobs.
//
// Plan:
// Attempt to enqueue a job into a disabled queue, verify that it
// fails, the job does not run, and is not in the queue.
// Then, successfully enqueue several jobs while the queue is
// stopped and suspended, then start the queue, then stop the
// queue, then resume, then suspend, verifying the entire time
// that the job never disappears
// or gets processed. Eventually start and resume the queue, and
// verify the jobs get executed.
//
// Testing:
// numPendingJobs()
// enqueueJob(ThreadFunctor)
// --------------------------------------------------------------------
if (verbose) {
cout << "====================\n"
"Intensive state test\n"
"====================\n";
}
using namespace MULTIPRIORITYTHREADPOOL_CASE_5;
enum {
NUM_THREADS = 8,
NUM_PRIORITIES = 4,
GARBAGE_VAL = 0x8f,
NUM_JOBS = 10,
MAX_LOOP = 4
};
int ii;
for (ii = 0; ii <= MAX_LOOP; ++ii) {
bool startOverFromScratch = false;
bdlmt::MultipriorityThreadPool pool(NUM_THREADS,
NUM_PRIORITIES,
&ta);
ASSERT(pool.isEnabled());
ASSERT(!pool.isStarted());
ASSERT(!pool.isSuspended());
checkOutPool(&pool);
pool.disableQueue();
ASSERT(!pool.isEnabled());
PushIntFunctor pif;
pif.d_arg = 0;
int sts = pool.enqueueJob(pif, 0);
ASSERT(sts); // should fail
ASSERT(0 == pool.numPendingJobs());
pool.enableQueue();
ASSERT(pool.isEnabled());
ASSERT(!pool.isStarted());
ASSERT(!pool.isSuspended());
ASSERT(0 == pool.numStartedThreads());
pool.suspendProcessing();
pool.removeJobs();
ASSERT(!pool.isStarted());
ASSERT(pool.isSuspended());
ASSERT(0 == pool.numStartedThreads());
memset(resultsVec, GARBAGE_VAL, sizeof resultsVec);
resultsVecIdx = 0;
// push jobs. The queue is not started, so they won't run
for (int i = 0; NUM_JOBS > i; ++i) {
pif.d_arg = i * i;
sts = pool.enqueueJob(pif, 0);
ASSERT(!sts);
ASSERT(1 + i == pool.numPendingJobs());
}
// now go back and forth between states of the queue that don't
// execute jobs and verify the jobs have not begun executing
for (int j = 0; 10 > j; ++j) {
if (pool.startThreads()) {
startOverFromScratch = true;
if (verbose) {
P_(L_) P_(ii) P(j)
}
break;
}
bslmt::ThreadUtil::yield();
bslmt::ThreadUtil::microSleep(10 * 1000);
ASSERT(pool.isStarted());
ASSERT(pool.isSuspended());
ASSERT(NUM_THREADS == pool.numStartedThreads());
ASSERT(0 == resultsVecIdx);
ASSERT(NUM_JOBS == pool.numPendingJobs());
pool.stopThreads();
bslmt::ThreadUtil::yield();
bslmt::ThreadUtil::microSleep(10 * 1000);
ASSERT(!pool.isStarted());
ASSERT(pool.isSuspended());
ASSERT(0 == pool.numStartedThreads());
ASSERT(0 == resultsVecIdx);
ASSERT(NUM_JOBS == pool.numPendingJobs());
pool.resumeProcessing();
bslmt::ThreadUtil::yield();
bslmt::ThreadUtil::microSleep(10 * 1000);
ASSERT(!pool.isStarted());
ASSERT(!pool.isSuspended());
ASSERT(0 == pool.numStartedThreads());
ASSERT(0 == resultsVecIdx);
ASSERT(NUM_JOBS == pool.numPendingJobs());
pool.suspendProcessing();
bslmt::ThreadUtil::yield();
bslmt::ThreadUtil::microSleep(10 * 1000);
ASSERT(!pool.isStarted());
ASSERT(pool.isSuspended());
ASSERT(0 == pool.numStartedThreads());
ASSERT(0 == resultsVecIdx);
ASSERT(NUM_JOBS == pool.numPendingJobs());
}
if (startOverFromScratch) {
continue;
}
// repeat that last experiment, not as many times, redundantly
// calling the state changes.
for (int j = 0; 5 > j; ++j) {
if (pool.startThreads()) {
startOverFromScratch = true;
if (verbose) {
P_(L_) P_(ii) P(j)
}
break;
}
ASSERT(0 == pool.startThreads());
bslmt::ThreadUtil::yield();
bslmt::ThreadUtil::microSleep(10 * 1000);
ASSERT(pool.isStarted());
ASSERT(pool.isSuspended());
ASSERT(NUM_THREADS == pool.numStartedThreads());
ASSERT(0 == resultsVecIdx);
ASSERT(NUM_JOBS == pool.numPendingJobs());
pool.stopThreads();
pool.stopThreads();
bslmt::ThreadUtil::yield();
bslmt::ThreadUtil::microSleep(10 * 1000);
ASSERT(!pool.isStarted());
ASSERT(pool.isSuspended());
ASSERT(0 == pool.numStartedThreads());
ASSERT(0 == resultsVecIdx);
ASSERT(NUM_JOBS == pool.numPendingJobs());
pool.resumeProcessing();
pool.resumeProcessing();
bslmt::ThreadUtil::yield();
bslmt::ThreadUtil::microSleep(10 * 1000);
ASSERT(!pool.isStarted());
ASSERT(!pool.isSuspended());
ASSERT(0 == pool.numStartedThreads());
ASSERT(0 == resultsVecIdx);
ASSERT(10 == pool.numPendingJobs());
pool.suspendProcessing();
pool.suspendProcessing();
bslmt::ThreadUtil::yield();
bslmt::ThreadUtil::microSleep(10 * 1000);
ASSERT(!pool.isStarted());
ASSERT(pool.isSuspended());
ASSERT(0 == pool.numStartedThreads());
ASSERT(0 == resultsVecIdx);
ASSERT(NUM_JOBS == pool.numPendingJobs());
}
if (startOverFromScratch) {
continue;
}
if (pool.startThreads()) {
if (verbose) {
P_(L_) P(ii)
}
continue;
}
pool.resumeProcessing();
pool.drainJobs();
ASSERT(0 == pool.numPendingJobs());
ASSERT(NUM_JOBS == resultsVecIdx);
sort(resultsVec, resultsVec + resultsVecIdx);
for (int i = 0; resultsVecIdx > i; ++i) {
ASSERT(resultsVec[i] == i * i);
}
if (verbose) {
cout << "First pass: ";
for (int i = 0; resultsVecIdx > i; ++i) {
cout << (i ? ", " : "") << resultsVec[i];
}
cout << endl;
}
// redundant state transitions, then repeat the jobs
ASSERT(pool.isStarted());
ASSERT(0 == pool.startThreads());
pool.resumeProcessing();
// push jobs. The queue is ready to go, so they'll start right
// away
memset(resultsVec, GARBAGE_VAL, sizeof resultsVec);
resultsVecIdx = 0;
for (int i = 0; NUM_JOBS > i; ++i) {
pif.d_arg = i * i;
sts = pool.enqueueJob(pif, 0);
ASSERT(!sts);
}
pool.drainJobs();
ASSERT(0 == pool.numPendingJobs());
ASSERT(10 == resultsVecIdx);
sort(resultsVec, resultsVec + resultsVecIdx);
for (int i = 0; resultsVecIdx > i; ++i) {
ASSERT(resultsVec[i] == i * i);
}
if (verbose) {
cout << "Second pass: ";
for (int i = 0; resultsVecIdx > i; ++i) {
cout << (i ? ", " : "") << resultsVec[i];
}
cout << endl;
}
pool.stopThreads();
break;
}
ASSERT(ii <= MAX_LOOP);
if (verbose) { P_(L_) P(ii) }
} break;
case 5: {
// --------------------------------------------------------------------
// FIRST TESTING OF BASIC ACCESSORS THROUGH FUNDAMENTAL THREADPOOL
// STATES
//
// Concerns:
// The threadpool has 3 orthogonal properties, therefore 8 states
// it can be in. The enable/disable axis is trivially independent
// of the other two and can be tested separately. The
// started/stopped axis and the suspended/resumed axis interact in
// complicated ways, so it will be necessary to move through all
// possible transitions between the four states created by those
// two properties, verifying that it does not hang, and that the
// accessors properly reflect the state at any time.
//
// Testing:
// enableQueue()
// disableQueue()
// isEnabled()
// startThreads()
// stopThreads()
// isStarted()
// numStartedThreads()
// suspendProcessing()
// resumeProcessing()
// isSuspended()
// --------------------------------------------------------------------
if (verbose) {
cout << "==========\n"
"State test\n"
"==========\n";
}
using namespace MULTIPRIORITYTHREADPOOL_CASE_5;
bdlmt::MultipriorityThreadPool pool(16, // num threads
4, // num priorities
&ta);
ASSERT(pool.isEnabled());
ASSERT(!pool.isStarted());
ASSERT(!pool.isSuspended());
checkOutPool(&pool);
pool.disableQueue();
ASSERT(!pool.isEnabled());
pool.enableQueue();
ASSERT(pool.isEnabled());
ASSERT(!pool.isStarted());
ASSERT(!pool.isSuspended());
checkOutPool(&pool);
pool.startThreads();
ASSERT(pool.isStarted());
ASSERT(!pool.isSuspended());
checkOutPool(&pool);
pool.suspendProcessing();
pool.removeJobs();
ASSERT(pool.isStarted());
ASSERT(pool.isSuspended());
checkOutPool(&pool);
pool.stopThreads();
pool.removeJobs();
ASSERT(!pool.isStarted());
ASSERT(pool.isSuspended());
checkOutPool(&pool);
pool.resumeProcessing();
ASSERT(!pool.isStarted());
ASSERT(!pool.isSuspended());
checkOutPool(&pool);
// now go around the same 4 states in the opposite direction
pool.suspendProcessing();
pool.removeJobs();
ASSERT(!pool.isStarted());
ASSERT(pool.isSuspended());
checkOutPool(&pool);
pool.startThreads();
ASSERT(pool.isStarted());
ASSERT(pool.isSuspended());
checkOutPool(&pool);
pool.resumeProcessing();
ASSERT(pool.isStarted());
ASSERT(!pool.isSuspended());
checkOutPool(&pool);
pool.stopThreads();
pool.removeJobs();
ASSERT(!pool.isStarted());
ASSERT(!pool.isSuspended());
checkOutPool(&pool);
pool.startThreads();
ASSERT(pool.isStarted());
ASSERT(!pool.isSuspended());
checkOutPool(&pool);
pool.stopThreads();
} break;
case 4: {
// --------------------------------------------------------------------
// TESTING ALL POSSIBLE CONSTRUCTORS AND NUMTHREADS
//
// Concerns:
// Test all combinations of args in the constructors with a range
// of values of numThreads, and that numThreads() accurately reflects
// the constructed number of threads.
//
// Plan:
// Go in a 2 loops nested loops, the outer loop selecting all
// possible prototypes of the constructor, the inner loop selecting
// multiple possible values of numThreads and multiple possible
// values of priorities. Verify that numThreads() and
// numPriorities() reflect the constructed values. Then do a
// simple test on the created queue and verify it works. Test
// both an attempt to set the attributes to attached and detached
// and that the queue works reasonably well in either case.
//
// Testing:
// bdlmt::MultipriorityThreadPool(numThreads, numPriorities, alloc)
// bdlmt::MultipriorityThreadPool(numThreads, numPriorities,
// attributes, alloc)
// bdlmt::MultipriorityThreadPool(numThreads, numPriorities)
// bdlmt::MultipriorityThreadPool(numThreads, numPriorities,
// attributes)
// ~bdlmt::MultipriorityThreadPool()
// numThreads()
// numPriorities()
// --------------------------------------------------------------------
if (verbose) {
cout << "===========================================\n"
"Testing all constructors and 'numThreads()'\n"
"===========================================\n";
}
using namespace MULTIPRIORITYTHREADPOOL_CASE_5;
enum {
DEBUG_ALLOC,
DEFAULT_ALLOC
};
enum {
ATTRIBS_NONE,
ATTRIBS_YES
};
static const int numArray[] = { 1, 2, 3, 7, 10, 15, 32 };
// numbers to use as priorities as well as numThreads
const int numArrayLen = sizeof numArray / sizeof numArray[0];
bslma::TestAllocator taDefault;
bslma::DefaultAllocatorGuard guard(&taDefault);
ASSERT(&taDefault == bslma::Default::defaultAllocator());
ASSERT(taDefault.numBytesMax() == 0);
for (int allocS = DEBUG_ALLOC; DEFAULT_ALLOC >= allocS; ++allocS) {
for (int aS = ATTRIBS_NONE; ATTRIBS_YES >= aS; ++aS) {
for (int i = 0; numArrayLen > i; ++i) {
for (int j = 0; numArrayLen > j; ++j) {
bdlmt::MultipriorityThreadPool *pool = 0;
const int numThreads = numArray[i];
const int numPri = numArray[j];
if (DEBUG_ALLOC == allocS) {
if (ATTRIBS_NONE == aS) {
pool = new (ta)
bdlmt::MultipriorityThreadPool(numThreads,
numPri,
&ta);
}
else {
bslmt::ThreadAttributes attrib;
pool = new (ta) bdlmt::MultipriorityThreadPool(
numThreads,
numPri,
attrib,
&ta);
}
}
else { // default allocator
if (ATTRIBS_NONE == aS) {
pool = new (taDefault)
bdlmt::MultipriorityThreadPool(numThreads,
numPri);
}
else {
bslmt::ThreadAttributes attrib;
pool = new (taDefault)
bdlmt::MultipriorityThreadPool(numThreads,
numPri,
attrib);
}
}
ASSERT(numThreads == pool->numThreads());
ASSERT(numPri == pool->numPriorities());
memset(resultsVec, 0, sizeof(resultsVec));
resultsVecIdx = 0;
pool->startThreads();
for (long i = 0; 10 > i; ++i) {
int sts = pool->enqueueJob(&pushInt,
(void *)(i * i),
numPri - 1);
ASSERT(!sts);
}
pool->drainJobs();
if (1 < numThreads) {
sort(resultsVec, resultsVec + resultsVecIdx);
}
bool ok = true;
ok &= (10 == resultsVecIdx);
for (int i = 0; 10 > i; ++i) {
ok &= (resultsVec[i] == i * i);
}
LOOP5_ASSERT(allocS, aS, numThreads, numPri,
resultsVecIdx, ok);
if (!ok || veryVeryVeryVerbose) {
cout << (ok ? "Vector: " : "Bad vector: ");
for (int i = 0; resultsVecIdx > i; ++i) {
cout << (i ? ", " : "") << resultsVec[i];
}
cout << endl;
}
ASSERT(numThreads == pool->numThreads());
ASSERT(numPri == pool->numPriorities());
pool->stopThreads();
ASSERT(numThreads == pool->numThreads());
ASSERT(numPri == pool->numPriorities());
if (DEBUG_ALLOC == allocS) {
ta.deleteObjectRaw(pool);
}
else {
taDefault.deleteObjectRaw(pool);
}
ASSERT(ta.numBytesInUse() == 0);
ASSERT(taDefault.numBytesInUse() == 0);
if (veryVeryVerbose) {
cout << "Finished loop: allocS: " << allocS <<
", aS: " << aS <<
", numThreads: " << numThreads <<
", numPri: " << numPri << endl;
}
} // for j
} // for i
} // for attachedState
} // for allocS
} break;
case 3: {
// --------------------------------------------------------------------
// DRAINJOBS
//
// Concerns:
// That 'drainJobs()' properly blocks until a queue is emptied.
//
// Plan:
// Repeat test case 2, except without the barriers but with quite
// slow jobs, call drainJobs() and verify that it blocks until all
// the jobs are finished.
//
// Testing:
// drainJobs()
// --------------------------------------------------------------------
if (verbose) {
cout << "===================\n"
"Testing drainJobs()\n"
"===================\n";
}
using namespace MULTIPRIORITYTHREADPOOL_CASE_3;
static long incBy[] = { 473, 9384, 273, 132, 182, 191, 282, 934 };
const int incByLength = sizeof incBy / sizeof incBy[0];
bslmt::Barrier barrier(2);
bdlmt::MultipriorityThreadPool pool(1 /* threads */,
1 /* priorities */,
&ta);
counter = 0;
long otherCounter = 0;
for (int i = 0; incByLength > i; ++i) {
int sts =
pool.enqueueJob(&sleepAndAmassCounterBy, (void *)incBy[i], 0);
ASSERT(!sts);
}
ASSERT(!counter && !otherCounter);
for (int i = 0; incByLength > i; ++i) {
otherCounter += incBy[i];
otherCounter *= otherCounter;
}
pool.startThreads();
pool.drainJobs();
LOOP2_ASSERT(counter, otherCounter, counter == otherCounter);
if (verbose) {
cout << "Total sum: " << counter << endl;
}
pool.stopThreads();
} break;
case 2: {
// --------------------------------------------------------------------
// TESTING BASIC OPERATION (BOOTSTRAP, SINGLE THREAD POOL)
//
// Concerns:
// That a threadpool executes jobs in the order in which they were
// received.
//
// Plan:
// Create a threadpool with one thread, enqueue several jobs, all of
// the same priority, then enqueue a barrier job and then wait on
// the barrier, verify all jobs before the barrier job got executed
// in the order enqueued.
//
// Testing:
// enqueueJob(void (*)(), void *)
// --------------------------------------------------------------------
if (verbose) {
cout << "===============================================\n"
"Testing basic operation, order of job execution\n"
"===============================================\n";
}
using namespace MULTIPRIORITYTHREADPOOL_CASE_2;
static long incBy[] = { 473, 9384, 273, 132, 182, 191, 282, 934 };
const int incByLength = sizeof incBy / sizeof incBy[0];
bslmt::Barrier barrier(2);
bdlmt::MultipriorityThreadPool pool(1 /* threads */,
1 /* priorities */,
&ta);
for (int j = 0; 100 > j; ++j) {
counter = 0;
long otherCounter = 0;
for (int i = 0; incByLength > i; ++i) {
ASSERT(!pool.enqueueJob(&amassCounterBy, (void *) incBy[i],0));
ASSERT(!pool.enqueueJob(&waiter, &barrier, 0));
ASSERT(!pool.enqueueJob(&waiter, &barrier, 0));
}
ASSERT(!counter && !otherCounter);
pool.startThreads();
for (int i = 0; incByLength > i; ++i) {
barrier.wait();
otherCounter += incBy[i];
otherCounter *= otherCounter;
LOOP2_ASSERT(counter, otherCounter, counter == otherCounter);
if (veryVerbose) {
cout << "Sum[" << i << "] = " << counter << endl;
}
barrier.wait();
}
pool.stopThreads();
} // for j
} break;
case 1: {
// --------------------------------------------------------------------
// BREATHING TEST
//
// Concerns:
// Exercise some basic functionality.
//
// Plan:
// Create a threadpool, enqueue a job, see it execute.
// --------------------------------------------------------------------
if (verbose) {
cout << "==============\n"
"Breathing test\n"
"==============\n";
}
using namespace MULTIPRIORITYTHREADPOOL_CASE_1;
{
bslma::TestAllocator taDefault;
bslma::DefaultAllocatorGuard guard(&taDefault);
bslma::TestAllocator ta;
bdlmt::MultipriorityThreadPool *pool =
new (ta) bdlmt::MultipriorityThreadPool(1 /* threads */,
1 /* priorities */,
&ta);
pool->startThreads();
counter = 0;
ASSERT(!pool->enqueueJob(&incCounter, 0, 0));
ASSERT(!pool->enqueueJob(&incCounter, 0, 0));
ASSERT(!pool->enqueueJob(&incCounter, 0, 0));
ASSERT(!pool->enqueueJob(&incCounter, 0, 0));
ASSERT(!pool->enqueueJob(&incCounter, 0, 0));
bslmt::ThreadUtil::yield();
bslmt::ThreadUtil::microSleep(100 * 1000); // 0.1 seconds
LOOP_ASSERT(counter, 5 == counter);
if (verbose) {
cout << "counter = " << counter << endl;
}
pool->drainJobs();
pool->stopThreads();
ASSERT(0 == taDefault.numBytesInUse());
ta.deleteObjectRaw(pool);
}
} break;
default: {
cerr << "WARNING: CASE `" << test << "' NOT FOUND." << endl;
testStatus = -1;
}
} // switch (test)
if (testStatus > 0) {
cerr << "Error, non-zero test status = " << testStatus << "." << endl;
}
return testStatus;
}
// ----------------------------------------------------------------------------
// Copyright 2015 Bloomberg Finance L.P.
//
// 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.
// ----------------------------- END-OF-FILE ----------------------------------
| [
"mgiroux@bloomberg.net"
] | mgiroux@bloomberg.net |
882af3f0d3dfee924b6ba1cd6a2b131af0273094 | dc1031bd6a17f5eb67abe8702f70465f2dc31b5b | /core/core/src/Component.cpp | 6388bd4efa110345505ffabb956380fbd7b86ddb | [] | no_license | y0rshl/SimpleEngine | 46e03219474f2dbee71554deebd0f5af96121bad | 196f9131d17293ef27924b054e0041b16af5f08e | refs/heads/master | 2020-05-21T15:02:32.648992 | 2016-09-08T21:55:38 | 2016-09-08T21:56:17 | 64,023,935 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 70 | cpp | //
// Created by SANDSTORM04 on 8/11/16.
//
#include "Component.hpp"
| [
"jorge@sandstormi.com"
] | jorge@sandstormi.com |
e7fb41475352f5af5ee01ac71545abc250ff78a6 | 73ea06441b74590dd0eba308a217f0a75de758b2 | /include/person_detection_pcl/impl/head_based_subcluster.hpp | 89b69112c1630b577a16bcd74775bcea370a6458 | [] | no_license | songlang/csapex_person_detection_pcl | e71aefcf2d2386b51d55fdefe02b002465fe9f51 | d3dcf9a6b9742c2a9baf4a3a1dcfe96ef9c7ac71 | refs/heads/master | 2020-06-13T21:44:52.141639 | 2017-09-15T15:16:33 | 2017-09-15T15:16:33 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 15,066 | hpp | /*
* Software License Agreement (BSD License)
*
* Point Cloud Library (PCL) - www.pointclouds.org
* Copyright (c) 2013-, Open Perception, Inc.
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
* * Neither the name of the copyright holder(s) nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*
* head_based_subcluster.hpp
* Created on: Nov 30, 2012
* Author: Matteo Munaro
*/
#ifndef PCL_PEOPLE_HEAD_BASED_SUBCLUSTER_HPP_
#define PCL_PEOPLE_HEAD_BASED_SUBCLUSTER_HPP_
#include <person_detection_pcl/head_based_subcluster.h>
template <typename PointT>
pcl_backport::people::HeadBasedSubclustering<PointT>::HeadBasedSubclustering ()
{
// set default values for optional parameters:
vertical_ = false;
head_centroid_ = true;
min_height_ = 1.3;
max_height_ = 2.3;
min_points_ = 30;
max_points_ = 5000;
heads_minimum_distance_ = 0.3;
// set flag values for mandatory parameters:
sqrt_ground_coeffs_ = std::numeric_limits<float>::quiet_NaN();
}
template <typename PointT> void
pcl_backport::people::HeadBasedSubclustering<PointT>::setInputCloud (PointCloudPtr& cloud)
{
cloud_ = cloud;
}
template <typename PointT> void
pcl_backport::people::HeadBasedSubclustering<PointT>::setGround (Eigen::VectorXf& ground_coeffs)
{
ground_coeffs_ = ground_coeffs;
sqrt_ground_coeffs_ = (ground_coeffs - Eigen::Vector4f(0.0f, 0.0f, 0.0f, ground_coeffs(3))).norm();
}
template <typename PointT> void
pcl_backport::people::HeadBasedSubclustering<PointT>::setInitialClusters (std::vector<pcl::PointIndices>& cluster_indices)
{
cluster_indices_ = cluster_indices;
}
template <typename PointT> void
pcl_backport::people::HeadBasedSubclustering<PointT>::setSensorPortraitOrientation (bool vertical)
{
vertical_ = vertical;
}
template <typename PointT> void
pcl_backport::people::HeadBasedSubclustering<PointT>::setHeightLimits (float min_height, float max_height)
{
min_height_ = min_height;
max_height_ = max_height;
}
template <typename PointT> void
pcl_backport::people::HeadBasedSubclustering<PointT>::setDimensionLimits (int min_points, int max_points)
{
min_points_ = min_points;
max_points_ = max_points;
}
template <typename PointT> void
pcl_backport::people::HeadBasedSubclustering<PointT>::setMinimumDistanceBetweenHeads (float heads_minimum_distance)
{
heads_minimum_distance_= heads_minimum_distance;
}
template <typename PointT> void
pcl_backport::people::HeadBasedSubclustering<PointT>::setHeadCentroid (bool head_centroid)
{
head_centroid_ = head_centroid;
}
template <typename PointT> void
pcl_backport::people::HeadBasedSubclustering<PointT>::getHeightLimits (float& min_height, float& max_height)
{
min_height = min_height_;
max_height = max_height_;
}
template <typename PointT> void
pcl_backport::people::HeadBasedSubclustering<PointT>::getDimensionLimits (int& min_points, int& max_points)
{
min_points = min_points_;
max_points = max_points_;
}
template <typename PointT> float
pcl_backport::people::HeadBasedSubclustering<PointT>::getMinimumDistanceBetweenHeads ()
{
return (heads_minimum_distance_);
}
template <typename PointT> void
pcl_backport::people::HeadBasedSubclustering<PointT>::mergeClustersCloseInFloorCoordinates (std::vector<pcl_backport::people::PersonCluster<PointT> >& input_clusters,
std::vector<pcl_backport::people::PersonCluster<PointT> >& output_clusters)
{
float min_distance_between_cluster_centers = 0.4; // meters
float normalize_factor = std::pow(sqrt_ground_coeffs_, 2); // sqrt_ground_coeffs ^ 2 (precomputed for speed)
Eigen::Vector3f head_ground_coeffs = ground_coeffs_.head(3); // ground plane normal (precomputed for speed)
std::vector <std::vector<int> > connected_clusters;
connected_clusters.resize(input_clusters.size());
std::vector<bool> used_clusters; // 0 in correspondence of clusters remained to process, 1 for already used clusters
used_clusters.resize(input_clusters.size());
for(unsigned int i = 0; i < input_clusters.size(); i++) // for every cluster
{
Eigen::Vector3f theoretical_center = input_clusters[i].getTCenter();
float t = theoretical_center.dot(head_ground_coeffs) / normalize_factor; // height from the ground
Eigen::Vector3f current_cluster_center_projection = theoretical_center - head_ground_coeffs * t; // projection of the point on the groundplane
for(unsigned int j = i+1; j < input_clusters.size(); j++) // for every remaining cluster
{
theoretical_center = input_clusters[j].getTCenter();
float t = theoretical_center.dot(head_ground_coeffs) / normalize_factor; // height from the ground
Eigen::Vector3f new_cluster_center_projection = theoretical_center - head_ground_coeffs * t; // projection of the point on the groundplane
if (((new_cluster_center_projection - current_cluster_center_projection).norm()) < min_distance_between_cluster_centers)
{
connected_clusters[i].push_back(j);
}
}
}
for(unsigned int i = 0; i < connected_clusters.size(); i++) // for every cluster
{
if (!used_clusters[i]) // if this cluster has not been used yet
{
used_clusters[i] = true;
if (connected_clusters[i].empty()) // no other clusters to merge
{
output_clusters.push_back(input_clusters[i]);
}
else
{
// Copy cluster points into new cluster:
pcl::PointIndices point_indices;
point_indices = input_clusters[i].getIndices();
for(unsigned int j = 0; j < connected_clusters[i].size(); j++)
{
if (!used_clusters[connected_clusters[i][j]]) // if this cluster has not been used yet
{
used_clusters[connected_clusters[i][j]] = true;
for(std::vector<int>::const_iterator points_iterator = input_clusters[connected_clusters[i][j]].getIndices().indices.begin();
points_iterator != input_clusters[connected_clusters[i][j]].getIndices().indices.end(); points_iterator++)
{
point_indices.indices.push_back(*points_iterator);
}
}
}
pcl_backport::people::PersonCluster<PointT> cluster(cloud_, point_indices, ground_coeffs_, sqrt_ground_coeffs_, head_centroid_, vertical_);
output_clusters.push_back(cluster);
}
}
}
}
template <typename PointT> void
pcl_backport::people::HeadBasedSubclustering<PointT>::createSubClusters (pcl_backport::people::PersonCluster<PointT>& cluster, int maxima_number,
std::vector<int>& maxima_cloud_indices, std::vector<pcl_backport::people::PersonCluster<PointT> >& subclusters)
{
// create new clusters from the current cluster and put corresponding indices into sub_clusters_indices:
float normalize_factor = std::pow(sqrt_ground_coeffs_, 2); // sqrt_ground_coeffs ^ 2 (precomputed for speed)
Eigen::Vector3f head_ground_coeffs = ground_coeffs_.head(3); // ground plane normal (precomputed for speed)
Eigen::Matrix3Xf maxima_projected(3,maxima_number); // matrix containing the projection of maxima onto the ground plane
Eigen::VectorXi subclusters_number_of_points(maxima_number); // subclusters number of points
std::vector <std::vector <int> > sub_clusters_indices; // vector of vectors with the cluster indices for every maximum
sub_clusters_indices.resize(maxima_number); // resize to number of maxima
// Project maxima on the ground plane:
for(int i = 0; i < maxima_number; i++) // for every maximum
{
PointT* current_point = &cloud_->points[maxima_cloud_indices[i]]; // current maximum point cloud point
Eigen::Vector3f p_current_eigen(current_point->x, current_point->y, current_point->z); // conversion to eigen
float t = p_current_eigen.dot(head_ground_coeffs) / normalize_factor; // height from the ground
maxima_projected.col(i).matrix () = p_current_eigen - head_ground_coeffs * t; // projection of the point on the groundplane
subclusters_number_of_points(i) = 0; // intialize number of points
}
// Associate cluster points to one of the maximum:
for(std::vector<int>::const_iterator points_iterator = cluster.getIndices().indices.begin(); points_iterator != cluster.getIndices().indices.end(); points_iterator++)
{
PointT* current_point = &cloud_->points[*points_iterator]; // current point cloud point
Eigen::Vector3f p_current_eigen(current_point->x, current_point->y, current_point->z); // conversion to eigen
float t = p_current_eigen.dot(head_ground_coeffs) / normalize_factor; // height from the ground
p_current_eigen = p_current_eigen - head_ground_coeffs * t; // projection of the point on the groundplane
int i = 0;
bool correspondence_detected = false;
while ((!correspondence_detected) && (i < maxima_number))
{
if (((p_current_eigen - maxima_projected.col(i)).norm()) < heads_minimum_distance_)
{
correspondence_detected = true;
sub_clusters_indices[i].push_back(*points_iterator);
subclusters_number_of_points(i)++;
}
else
i++;
}
}
// Create a subcluster if the number of points associated to a maximum is over a threshold:
for(int i = 0; i < maxima_number; i++) // for every maximum
{
if (subclusters_number_of_points(i) > min_points_)
{
pcl::PointIndices point_indices;
point_indices.indices = sub_clusters_indices[i]; // indices associated to the i-th maximum
pcl_backport::people::PersonCluster<PointT> cluster(cloud_, point_indices, ground_coeffs_, sqrt_ground_coeffs_, head_centroid_, vertical_);
subclusters.push_back(cluster);
//std::cout << "Cluster number of points: " << subclusters_number_of_points(i) << std::endl;
}
}
}
template <typename PointT> void
pcl_backport::people::HeadBasedSubclustering<PointT>::subcluster (std::vector<pcl_backport::people::PersonCluster<PointT> >& clusters)
{
// Check if all mandatory variables have been set:
if (sqrt_ground_coeffs_ != sqrt_ground_coeffs_)
{
PCL_ERROR ("[pcl_backport::people::pcl_backport::people::HeadBasedSubclustering::subcluster] Floor parameters have not been set or they are not valid!\n");
return;
}
if (cluster_indices_.size() == 0)
{
PCL_ERROR ("[pcl_backport::people::pcl_backport::people::HeadBasedSubclustering::subcluster] Cluster indices have not been set!\n");
return;
}
if (cloud_ == NULL)
{
PCL_ERROR ("[pcl_backport::people::pcl_backport::people::HeadBasedSubclustering::subcluster] Input cloud has not been set!\n");
return;
}
// Person clusters creation from clusters indices:
for(std::vector<pcl::PointIndices>::const_iterator it = cluster_indices_.begin(); it != cluster_indices_.end(); ++it)
{
pcl_backport::people::PersonCluster<PointT> cluster(cloud_, *it, ground_coeffs_, sqrt_ground_coeffs_, head_centroid_, vertical_); // PersonCluster creation
clusters.push_back(cluster);
}
// Remove clusters with too high height from the ground plane:
std::vector<pcl_backport::people::PersonCluster<PointT> > new_clusters;
for(unsigned int i = 0; i < clusters.size(); i++) // for every cluster
{
if (clusters[i].getHeight() <= max_height_)
new_clusters.push_back(clusters[i]);
}
clusters = new_clusters;
new_clusters.clear();
// Merge clusters close in floor coordinates:
mergeClustersCloseInFloorCoordinates(clusters, new_clusters);
clusters = new_clusters;
std::vector<pcl_backport::people::PersonCluster<PointT> > subclusters;
int cluster_min_points_sub = int(float(min_points_) * 1.5);
// int cluster_max_points_sub = max_points_;
// create HeightMap2D object:
pcl_backport::people::HeightMap2D<PointT> height_map_obj;
height_map_obj.setGround(ground_coeffs_);
height_map_obj.setInputCloud(cloud_);
height_map_obj.setSensorPortraitOrientation(vertical_);
height_map_obj.setMinimumDistanceBetweenMaxima(heads_minimum_distance_);
for(typename std::vector<pcl_backport::people::PersonCluster<PointT> >::iterator it = clusters.begin(); it != clusters.end(); ++it) // for every cluster
{
float height = it->getHeight();
int number_of_points = it->getNumberPoints();
if(height > min_height_ && height < max_height_)
{
if (number_of_points > cluster_min_points_sub) // && number_of_points < cluster_max_points_sub)
{
// Compute height map associated to the current cluster and its local maxima (heads):
height_map_obj.compute(*it);
if (height_map_obj.getMaximaNumberAfterFiltering() > 1) // if more than one maximum
{
// create new clusters from the current cluster and put corresponding indices into sub_clusters_indices:
createSubClusters(*it, height_map_obj.getMaximaNumberAfterFiltering(), height_map_obj.getMaximaCloudIndicesFiltered(), subclusters);
}
else
{ // Only one maximum --> copy original cluster:
subclusters.push_back(*it);
}
}
else
{
// Cluster properties not good for sub-clustering --> copy original cluster:
subclusters.push_back(*it);
}
}
}
clusters = subclusters; // substitute clusters with subclusters
}
template <typename PointT>
pcl_backport::people::HeadBasedSubclustering<PointT>::~HeadBasedSubclustering ()
{
// TODO Auto-generated destructor stub
}
#endif /* PCL_PEOPLE_HEAD_BASED_SUBCLUSTER_HPP_ */
| [
"philipp.kuhlmann@student.uni-tuebingen.de"
] | philipp.kuhlmann@student.uni-tuebingen.de |
e543557c6c755b3aa4ec7ef7eff35d2c865e43a8 | 9dc8658d35c6d7e15b93595a46e23f80c1303c84 | /ray_tracing_in_1_weekend/given/sphere.h | d47bbf3894dba28c870a5220e2cc48fbe2959f40 | [] | no_license | fengjilanghen/DirectX11Tutorial11 | a5e0622bc29d22559aacb2ee2e32f6a5c18b9485 | 42de7071f6128165deba5e016011b242a4486ccc | refs/heads/master | 2021-01-22T10:09:22.726402 | 2017-09-24T10:07:38 | 2017-09-24T10:07:38 | 102,335,787 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,259 | h | #ifndef SPHEREH
#define SPHEREH
#include "hitable.h"
class sphere: public hitable {
public:
sphere() {}
sphere(vec3 cen, float r, material *m) : center(cen), radius(r), mat_ptr(m) {};
virtual bool hit(const ray& r, float tmin, float tmax, hit_record& rec) const;
vec3 center;
float radius;
material *mat_ptr;
};
bool sphere::hit(const ray& r, float t_min, float t_max, hit_record& rec) const {
vec3 oc = r.A - center;
float a = dot(r.B, r.B);
float b = dot(oc, r.B);
float c = dot(oc, oc) - radius*radius;
float discriminant = b*b - a*c;
if (discriminant > 0) {
float temp = (-b - sqrt(discriminant))/a;
if (temp < t_max && temp > t_min) {
rec.t = temp;
rec.p = r.point_at_parameter(rec.t);
rec.normal = (rec.p - center) / radius;
rec.mat_ptr = mat_ptr;
return true;
}
temp = (-b + sqrt(discriminant)) / a;
if (temp < t_max && temp > t_min) {
rec.t = temp;
rec.p = r.point_at_parameter(rec.t);
rec.normal = (rec.p - center) / radius;
rec.mat_ptr = mat_ptr;
return true;
}
}
return false;
}
#endif
| [
"fengjilanghen@gmail.com"
] | fengjilanghen@gmail.com |
ae69bb02fb40bb1791bb2ce973e458a5cf72aeab | b3e63b99e7e9c4c7b85c282fdfa5df292e48c5ea | /Unreal/UnTexture4.cpp | 6e40271946eed8c3f7e79d238e4ed3c1d524eb78 | [] | no_license | shyanxiaowen/UModel | fdd82d27b33430412e5b9d97284f791507011864 | 5657d09317dc5c1d32853aaff1c8b41c64f30f37 | refs/heads/master | 2021-01-15T10:26:40.606336 | 2015-06-26T15:09:06 | 2015-06-26T15:09:06 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 5,275 | cpp | #include "Core.h"
#include "UnCore.h"
#include "UnObject.h"
#include "UnMaterial.h"
#include "UnMaterial3.h"
#include "UnPackage.h"
//#define DEBUG_TEX 1
#if DEBUG_TEX
#define DBG(...) appPrintf(__VA_ARGS__);
#else
#define DBG(...)
#endif
/*-----------------------------------------------------------------------------
UTexture/UTexture2D (Unreal engine 4)
-----------------------------------------------------------------------------*/
#if UNREAL4
struct FTexturePlatformData
{
int SizeX;
int SizeY;
int NumSlices; // 1 for simple texture, 6 for cubemap - 6 textures are joined into one (check!!)
FString PixelFormat;
TArray<FTexture2DMipMap> Mips;
friend FArchive& operator<<(FArchive& Ar, FTexturePlatformData& D)
{
Ar << D.SizeX << D.SizeY << D.NumSlices << D.PixelFormat;
int FirstMip;
Ar << FirstMip; // only for cooked, but we don't read FTexturePlatformData for non-cooked textures
DBG(" SizeX=%d SizeY=%d NumSlices=%d PixelFormat=%s FirstMip=%d\n", D.SizeX, D.SizeY, D.NumSlices, *D.PixelFormat, FirstMip);
Ar << D.Mips;
return Ar;
}
};
void UTexture3::Serialize4(FArchive& Ar)
{
guard(UTexture3::Serialize4);
Super::Serialize(Ar); // UObject
FStripDataFlags StripFlags(Ar);
// For version prior to VER_UE4_TEXTURE_SOURCE_ART_REFACTOR, UTexture::Serialize will do exactly the same
// serialization action, but it will perform some extra processing of format and compression settings.
// Cooked packages are not affected by this code.
if (!StripFlags.IsEditorDataStripped())
{
SourceArt.Serialize(Ar);
}
unguard;
}
void UTexture2D::Serialize4(FArchive& Ar)
{
guard(UTexture2D::Serialize4);
Super::Serialize4(Ar);
FStripDataFlags StripFlags(Ar); // note: these flags are used for pre-VER_UE4_TEXTURE_SOURCE_ART_REFACTOR versions
bool bCooked = false;
if (Ar.ArVer >= VER_UE4_ADD_COOKED_TO_TEXTURE2D) Ar << bCooked;
if (Ar.ArVer < VER_UE4_TEXTURE_SOURCE_ART_REFACTOR)
{
appNotify("Untested code: UTexture2D::LegacySerialize");
// This code lives in UTexture2D::LegacySerialize(). It relies on some depracated properties, and modern
// code UE4 can't read cooked packages prepared with pre-VER_UE4_TEXTURE_SOURCE_ART_REFACTOR version of
// the engine. So, it's not possible to know what should happen there unless we'll get some working game
// which uses old UE4 version.bDisableDerivedDataCache_DEPRECATED in UE4 serialized as property, when set
// to true - has serialization of TArray<FTexture2DMipMap>. We suppose here that it's 'false'.
FGuid TextureFileCacheGuid_DEPRECATED;
Ar << TextureFileCacheGuid_DEPRECATED;
}
// Formats are added in UE4 in Source/Developer/<Platform>TargetPlatform/Private/<Platform>TargetPlatform.h,
// in TTargetPlatformBase::GetTextureFormats(). Formats are choosen depending on platform settings (for example,
// for Android) or depending on UTexture::CompressionSettings. Windows, Linux and Mac platform uses the same
// texture format (see FTargetPlatformBase::GetDefaultTextureFormatName()). Other platforms uses different formats,
// but all of them (except Android) uses single texture format per object.
if (bCooked)
{
FName PixelFormatEnum;
Ar << PixelFormatEnum;
while (stricmp(PixelFormatEnum, "None") != 0)
{
int SkipOffset;
Ar << SkipOffset;
EPixelFormat PixelFormat = (EPixelFormat)NameToEnum("EPixelFormat", PixelFormatEnum);
//?? check whether we can support this pixel format
//!! add support for PVRTC textures - for UE3 these formats are mapped to DXT, but
//!! in UE4 there's separate enums - should support them in UTexture2D::GetTextureData
if (Format == PF_Unknown)
{
appPrintf("Loading data for format %s ...\n", PixelFormatEnum.Str);
// the texture was not loaded yet
FTexturePlatformData Data;
Ar << Data;
assert(Ar.Tell() == SkipOffset);
// copy data to UTexture2D
Exchange(Mips, Data.Mips); // swap arrays to avoid copying
SizeX = Data.SizeX;
SizeY = Data.SizeY;
Format = PixelFormat;
//!! NumSlices
}
else
{
appPrintf("Skipping data for format %s\n", PixelFormatEnum.Str);
Ar.Seek(SkipOffset);
}
// read next format name
Ar << PixelFormatEnum;
}
}
unguard;
}
void UMaterial3::ScanForTextures()
{
guard(UMaterial3::ScanForTextures);
// printf("--> %d imports\n", Package->Summary.ImportCount);
//!! NOTE: this code will not work when textures are located in the same package - they don't present in import table
//!! but could be found in export table. That's true for Simplygon-generated materials.
for (int i = 0; i < Package->Summary.ImportCount; i++)
{
const FObjectImport &Imp = Package->GetImport(i);
// printf("--> import %d (%s)\n", i, *Imp.ClassName);
if (stricmp(Imp.ClassName, "Class") == 0 || stricmp(Imp.ClassName, "Package") == 0)
continue; // avoid spamming to log
UObject* obj = Package->CreateImport(i);
// if (obj) printf("--> %s (%s)\n", obj->Name, obj->GetClassName());
if (obj && obj->IsA("Texture3"))
ReferencedTextures.AddItem(static_cast<UTexture3*>(obj));
}
unguard;
}
#endif // UNREAL4
| [
"git@gildor.org"
] | git@gildor.org |
d4e56acb960133f2f8aea88ad92d529c078f419d | eaed8df7c2ec6574742906453b41a9a988e97849 | /src/RcppExports.cpp | 3dfec1ba4ca005dc294284e63a1d9c5d796c8eaf | [] | no_license | ssnorrizaurous/prioritizr | ad3320e8de08f804de5e26bbc0b0f5293e8efde0 | 00d8fcacc519031e1e03fe667f085df886868924 | refs/heads/master | 2020-06-11T12:16:29.799739 | 2019-06-13T18:17:57 | 2019-06-13T18:17:57 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 25,074 | cpp | // Generated by using Rcpp::compileAttributes() -> do not edit by hand
// Generator token: 10BE3573-1514-4C36-9D1C-5A225CD40393
#include <RcppArmadillo.h>
#include <Rcpp.h>
using namespace Rcpp;
// rcpp_new_optimization_problem
SEXP rcpp_new_optimization_problem(std::size_t nrow, std::size_t ncol, std::size_t ncell);
RcppExport SEXP _prioritizr_rcpp_new_optimization_problem(SEXP nrowSEXP, SEXP ncolSEXP, SEXP ncellSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< std::size_t >::type nrow(nrowSEXP);
Rcpp::traits::input_parameter< std::size_t >::type ncol(ncolSEXP);
Rcpp::traits::input_parameter< std::size_t >::type ncell(ncellSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_new_optimization_problem(nrow, ncol, ncell));
return rcpp_result_gen;
END_RCPP
}
// rcpp_predefined_optimization_problem
SEXP rcpp_predefined_optimization_problem(Rcpp::List l);
RcppExport SEXP _prioritizr_rcpp_predefined_optimization_problem(SEXP lSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< Rcpp::List >::type l(lSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_predefined_optimization_problem(l));
return rcpp_result_gen;
END_RCPP
}
// rcpp_optimization_problem_as_list
Rcpp::List rcpp_optimization_problem_as_list(SEXP x);
RcppExport SEXP _prioritizr_rcpp_optimization_problem_as_list(SEXP xSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_optimization_problem_as_list(x));
return rcpp_result_gen;
END_RCPP
}
// rcpp_get_optimization_problem_ncol
std::size_t rcpp_get_optimization_problem_ncol(SEXP x);
RcppExport SEXP _prioritizr_rcpp_get_optimization_problem_ncol(SEXP xSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_get_optimization_problem_ncol(x));
return rcpp_result_gen;
END_RCPP
}
// rcpp_get_optimization_problem_nrow
std::size_t rcpp_get_optimization_problem_nrow(SEXP x);
RcppExport SEXP _prioritizr_rcpp_get_optimization_problem_nrow(SEXP xSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_get_optimization_problem_nrow(x));
return rcpp_result_gen;
END_RCPP
}
// rcpp_get_optimization_problem_ncell
std::size_t rcpp_get_optimization_problem_ncell(SEXP x);
RcppExport SEXP _prioritizr_rcpp_get_optimization_problem_ncell(SEXP xSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_get_optimization_problem_ncell(x));
return rcpp_result_gen;
END_RCPP
}
// rcpp_get_optimization_problem_A
Rcpp::List rcpp_get_optimization_problem_A(SEXP x);
RcppExport SEXP _prioritizr_rcpp_get_optimization_problem_A(SEXP xSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_get_optimization_problem_A(x));
return rcpp_result_gen;
END_RCPP
}
// rcpp_get_optimization_problem_modelsense
std::string rcpp_get_optimization_problem_modelsense(SEXP x);
RcppExport SEXP _prioritizr_rcpp_get_optimization_problem_modelsense(SEXP xSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_get_optimization_problem_modelsense(x));
return rcpp_result_gen;
END_RCPP
}
// rcpp_get_optimization_problem_number_of_planning_units
std::size_t rcpp_get_optimization_problem_number_of_planning_units(SEXP x);
RcppExport SEXP _prioritizr_rcpp_get_optimization_problem_number_of_planning_units(SEXP xSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_get_optimization_problem_number_of_planning_units(x));
return rcpp_result_gen;
END_RCPP
}
// rcpp_get_optimization_problem_number_of_features
std::size_t rcpp_get_optimization_problem_number_of_features(SEXP x);
RcppExport SEXP _prioritizr_rcpp_get_optimization_problem_number_of_features(SEXP xSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_get_optimization_problem_number_of_features(x));
return rcpp_result_gen;
END_RCPP
}
// rcpp_get_optimization_problem_number_of_zones
std::size_t rcpp_get_optimization_problem_number_of_zones(SEXP x);
RcppExport SEXP _prioritizr_rcpp_get_optimization_problem_number_of_zones(SEXP xSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_get_optimization_problem_number_of_zones(x));
return rcpp_result_gen;
END_RCPP
}
// rcpp_get_optimization_problem_vtype
std::vector<std::string> rcpp_get_optimization_problem_vtype(SEXP x);
RcppExport SEXP _prioritizr_rcpp_get_optimization_problem_vtype(SEXP xSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_get_optimization_problem_vtype(x));
return rcpp_result_gen;
END_RCPP
}
// rcpp_get_optimization_problem_obj
std::vector<double> rcpp_get_optimization_problem_obj(SEXP x);
RcppExport SEXP _prioritizr_rcpp_get_optimization_problem_obj(SEXP xSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_get_optimization_problem_obj(x));
return rcpp_result_gen;
END_RCPP
}
// rcpp_get_optimization_problem_rhs
std::vector<double> rcpp_get_optimization_problem_rhs(SEXP x);
RcppExport SEXP _prioritizr_rcpp_get_optimization_problem_rhs(SEXP xSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_get_optimization_problem_rhs(x));
return rcpp_result_gen;
END_RCPP
}
// rcpp_get_optimization_problem_sense
std::vector<std::string> rcpp_get_optimization_problem_sense(SEXP x);
RcppExport SEXP _prioritizr_rcpp_get_optimization_problem_sense(SEXP xSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_get_optimization_problem_sense(x));
return rcpp_result_gen;
END_RCPP
}
// rcpp_get_optimization_problem_lb
std::vector<double> rcpp_get_optimization_problem_lb(SEXP x);
RcppExport SEXP _prioritizr_rcpp_get_optimization_problem_lb(SEXP xSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_get_optimization_problem_lb(x));
return rcpp_result_gen;
END_RCPP
}
// rcpp_get_optimization_problem_ub
std::vector<double> rcpp_get_optimization_problem_ub(SEXP x);
RcppExport SEXP _prioritizr_rcpp_get_optimization_problem_ub(SEXP xSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_get_optimization_problem_ub(x));
return rcpp_result_gen;
END_RCPP
}
// rcpp_get_optimization_problem_col_ids
std::vector<std::string> rcpp_get_optimization_problem_col_ids(SEXP x);
RcppExport SEXP _prioritizr_rcpp_get_optimization_problem_col_ids(SEXP xSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_get_optimization_problem_col_ids(x));
return rcpp_result_gen;
END_RCPP
}
// rcpp_get_optimization_problem_row_ids
std::vector<std::string> rcpp_get_optimization_problem_row_ids(SEXP x);
RcppExport SEXP _prioritizr_rcpp_get_optimization_problem_row_ids(SEXP xSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_get_optimization_problem_row_ids(x));
return rcpp_result_gen;
END_RCPP
}
// rcpp_get_optimization_problem_compressed_formulation
bool rcpp_get_optimization_problem_compressed_formulation(SEXP x);
RcppExport SEXP _prioritizr_rcpp_get_optimization_problem_compressed_formulation(SEXP xSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_get_optimization_problem_compressed_formulation(x));
return rcpp_result_gen;
END_RCPP
}
// rcpp_set_optimization_problem_shuffled
Rcpp::IntegerVector rcpp_set_optimization_problem_shuffled(SEXP x);
RcppExport SEXP _prioritizr_rcpp_set_optimization_problem_shuffled(SEXP xSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_set_optimization_problem_shuffled(x));
return rcpp_result_gen;
END_RCPP
}
// rcpp_add_rij_data
bool rcpp_add_rij_data(SEXP x, Rcpp::List rij_list, Rcpp::List targets_list, bool compressed_formulation);
RcppExport SEXP _prioritizr_rcpp_add_rij_data(SEXP xSEXP, SEXP rij_listSEXP, SEXP targets_listSEXP, SEXP compressed_formulationSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
Rcpp::traits::input_parameter< Rcpp::List >::type rij_list(rij_listSEXP);
Rcpp::traits::input_parameter< Rcpp::List >::type targets_list(targets_listSEXP);
Rcpp::traits::input_parameter< bool >::type compressed_formulation(compressed_formulationSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_add_rij_data(x, rij_list, targets_list, compressed_formulation));
return rcpp_result_gen;
END_RCPP
}
// rcpp_add_zones_constraints
bool rcpp_add_zones_constraints(SEXP x, std::string sense);
RcppExport SEXP _prioritizr_rcpp_add_zones_constraints(SEXP xSEXP, SEXP senseSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
Rcpp::traits::input_parameter< std::string >::type sense(senseSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_add_zones_constraints(x, sense));
return rcpp_result_gen;
END_RCPP
}
// rcpp_apply_boundary_penalties
bool rcpp_apply_boundary_penalties(SEXP x, double penalty, Rcpp::NumericVector edge_factor, Rcpp::NumericMatrix zones_matrix, arma::sp_mat boundary_matrix);
RcppExport SEXP _prioritizr_rcpp_apply_boundary_penalties(SEXP xSEXP, SEXP penaltySEXP, SEXP edge_factorSEXP, SEXP zones_matrixSEXP, SEXP boundary_matrixSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
Rcpp::traits::input_parameter< double >::type penalty(penaltySEXP);
Rcpp::traits::input_parameter< Rcpp::NumericVector >::type edge_factor(edge_factorSEXP);
Rcpp::traits::input_parameter< Rcpp::NumericMatrix >::type zones_matrix(zones_matrixSEXP);
Rcpp::traits::input_parameter< arma::sp_mat >::type boundary_matrix(boundary_matrixSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_apply_boundary_penalties(x, penalty, edge_factor, zones_matrix, boundary_matrix));
return rcpp_result_gen;
END_RCPP
}
// rcpp_apply_connectivity_penalties
bool rcpp_apply_connectivity_penalties(SEXP x, double penalty, Rcpp::List data);
RcppExport SEXP _prioritizr_rcpp_apply_connectivity_penalties(SEXP xSEXP, SEXP penaltySEXP, SEXP dataSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
Rcpp::traits::input_parameter< double >::type penalty(penaltySEXP);
Rcpp::traits::input_parameter< Rcpp::List >::type data(dataSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_apply_connectivity_penalties(x, penalty, data));
return rcpp_result_gen;
END_RCPP
}
// rcpp_apply_contiguity_constraints
bool rcpp_apply_contiguity_constraints(SEXP x, arma::sp_mat data, Rcpp::IntegerVector clusters);
RcppExport SEXP _prioritizr_rcpp_apply_contiguity_constraints(SEXP xSEXP, SEXP dataSEXP, SEXP clustersSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
Rcpp::traits::input_parameter< arma::sp_mat >::type data(dataSEXP);
Rcpp::traits::input_parameter< Rcpp::IntegerVector >::type clusters(clustersSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_apply_contiguity_constraints(x, data, clusters));
return rcpp_result_gen;
END_RCPP
}
// rcpp_apply_decisions
bool rcpp_apply_decisions(SEXP x, std::string vtype, double default_lower, double default_upper);
RcppExport SEXP _prioritizr_rcpp_apply_decisions(SEXP xSEXP, SEXP vtypeSEXP, SEXP default_lowerSEXP, SEXP default_upperSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
Rcpp::traits::input_parameter< std::string >::type vtype(vtypeSEXP);
Rcpp::traits::input_parameter< double >::type default_lower(default_lowerSEXP);
Rcpp::traits::input_parameter< double >::type default_upper(default_upperSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_apply_decisions(x, vtype, default_lower, default_upper));
return rcpp_result_gen;
END_RCPP
}
// rcpp_apply_feature_contiguity_constraints
bool rcpp_apply_feature_contiguity_constraints(SEXP x, Rcpp::List data, Rcpp::List clusters_list);
RcppExport SEXP _prioritizr_rcpp_apply_feature_contiguity_constraints(SEXP xSEXP, SEXP dataSEXP, SEXP clusters_listSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
Rcpp::traits::input_parameter< Rcpp::List >::type data(dataSEXP);
Rcpp::traits::input_parameter< Rcpp::List >::type clusters_list(clusters_listSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_apply_feature_contiguity_constraints(x, data, clusters_list));
return rcpp_result_gen;
END_RCPP
}
// rcpp_apply_feature_weights
bool rcpp_apply_feature_weights(SEXP x, Rcpp::NumericVector weights);
RcppExport SEXP _prioritizr_rcpp_apply_feature_weights(SEXP xSEXP, SEXP weightsSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
Rcpp::traits::input_parameter< Rcpp::NumericVector >::type weights(weightsSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_apply_feature_weights(x, weights));
return rcpp_result_gen;
END_RCPP
}
// rcpp_apply_locked_constraints
bool rcpp_apply_locked_constraints(SEXP x, Rcpp::IntegerVector pu, Rcpp::IntegerVector zone, Rcpp::NumericVector status);
RcppExport SEXP _prioritizr_rcpp_apply_locked_constraints(SEXP xSEXP, SEXP puSEXP, SEXP zoneSEXP, SEXP statusSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
Rcpp::traits::input_parameter< Rcpp::IntegerVector >::type pu(puSEXP);
Rcpp::traits::input_parameter< Rcpp::IntegerVector >::type zone(zoneSEXP);
Rcpp::traits::input_parameter< Rcpp::NumericVector >::type status(statusSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_apply_locked_constraints(x, pu, zone, status));
return rcpp_result_gen;
END_RCPP
}
// rcpp_apply_max_cover_objective
bool rcpp_apply_max_cover_objective(SEXP x, Rcpp::NumericMatrix costs, Rcpp::NumericVector budget);
RcppExport SEXP _prioritizr_rcpp_apply_max_cover_objective(SEXP xSEXP, SEXP costsSEXP, SEXP budgetSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
Rcpp::traits::input_parameter< Rcpp::NumericMatrix >::type costs(costsSEXP);
Rcpp::traits::input_parameter< Rcpp::NumericVector >::type budget(budgetSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_apply_max_cover_objective(x, costs, budget));
return rcpp_result_gen;
END_RCPP
}
// rcpp_apply_max_features_objective
bool rcpp_apply_max_features_objective(SEXP x, Rcpp::List targets_list, Rcpp::NumericMatrix costs, Rcpp::NumericVector budget);
RcppExport SEXP _prioritizr_rcpp_apply_max_features_objective(SEXP xSEXP, SEXP targets_listSEXP, SEXP costsSEXP, SEXP budgetSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
Rcpp::traits::input_parameter< Rcpp::List >::type targets_list(targets_listSEXP);
Rcpp::traits::input_parameter< Rcpp::NumericMatrix >::type costs(costsSEXP);
Rcpp::traits::input_parameter< Rcpp::NumericVector >::type budget(budgetSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_apply_max_features_objective(x, targets_list, costs, budget));
return rcpp_result_gen;
END_RCPP
}
// rcpp_apply_max_phylo_objective
bool rcpp_apply_max_phylo_objective(SEXP x, Rcpp::List targets_list, Rcpp::NumericMatrix costs, Rcpp::NumericVector budget, arma::sp_mat branch_matrix, Rcpp::NumericVector branch_lengths);
RcppExport SEXP _prioritizr_rcpp_apply_max_phylo_objective(SEXP xSEXP, SEXP targets_listSEXP, SEXP costsSEXP, SEXP budgetSEXP, SEXP branch_matrixSEXP, SEXP branch_lengthsSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
Rcpp::traits::input_parameter< Rcpp::List >::type targets_list(targets_listSEXP);
Rcpp::traits::input_parameter< Rcpp::NumericMatrix >::type costs(costsSEXP);
Rcpp::traits::input_parameter< Rcpp::NumericVector >::type budget(budgetSEXP);
Rcpp::traits::input_parameter< arma::sp_mat >::type branch_matrix(branch_matrixSEXP);
Rcpp::traits::input_parameter< Rcpp::NumericVector >::type branch_lengths(branch_lengthsSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_apply_max_phylo_objective(x, targets_list, costs, budget, branch_matrix, branch_lengths));
return rcpp_result_gen;
END_RCPP
}
// rcpp_apply_max_utility_objective
bool rcpp_apply_max_utility_objective(SEXP x, Rcpp::NumericMatrix abundances, Rcpp::NumericMatrix costs, Rcpp::NumericVector budget);
RcppExport SEXP _prioritizr_rcpp_apply_max_utility_objective(SEXP xSEXP, SEXP abundancesSEXP, SEXP costsSEXP, SEXP budgetSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
Rcpp::traits::input_parameter< Rcpp::NumericMatrix >::type abundances(abundancesSEXP);
Rcpp::traits::input_parameter< Rcpp::NumericMatrix >::type costs(costsSEXP);
Rcpp::traits::input_parameter< Rcpp::NumericVector >::type budget(budgetSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_apply_max_utility_objective(x, abundances, costs, budget));
return rcpp_result_gen;
END_RCPP
}
// rcpp_apply_min_set_objective
bool rcpp_apply_min_set_objective(SEXP x, Rcpp::List targets_list, Rcpp::NumericMatrix costs);
RcppExport SEXP _prioritizr_rcpp_apply_min_set_objective(SEXP xSEXP, SEXP targets_listSEXP, SEXP costsSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
Rcpp::traits::input_parameter< Rcpp::List >::type targets_list(targets_listSEXP);
Rcpp::traits::input_parameter< Rcpp::NumericMatrix >::type costs(costsSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_apply_min_set_objective(x, targets_list, costs));
return rcpp_result_gen;
END_RCPP
}
// rcpp_apply_min_shortfall_objective
bool rcpp_apply_min_shortfall_objective(SEXP x, Rcpp::List targets_list, Rcpp::NumericMatrix costs, Rcpp::NumericVector budget);
RcppExport SEXP _prioritizr_rcpp_apply_min_shortfall_objective(SEXP xSEXP, SEXP targets_listSEXP, SEXP costsSEXP, SEXP budgetSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
Rcpp::traits::input_parameter< Rcpp::List >::type targets_list(targets_listSEXP);
Rcpp::traits::input_parameter< Rcpp::NumericMatrix >::type costs(costsSEXP);
Rcpp::traits::input_parameter< Rcpp::NumericVector >::type budget(budgetSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_apply_min_shortfall_objective(x, targets_list, costs, budget));
return rcpp_result_gen;
END_RCPP
}
// rcpp_apply_neighbor_constraints
bool rcpp_apply_neighbor_constraints(SEXP x, Rcpp::List connected_data, Rcpp::IntegerVector k);
RcppExport SEXP _prioritizr_rcpp_apply_neighbor_constraints(SEXP xSEXP, SEXP connected_dataSEXP, SEXP kSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
Rcpp::traits::input_parameter< Rcpp::List >::type connected_data(connected_dataSEXP);
Rcpp::traits::input_parameter< Rcpp::IntegerVector >::type k(kSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_apply_neighbor_constraints(x, connected_data, k));
return rcpp_result_gen;
END_RCPP
}
// rcpp_boundary_data
Rcpp::List rcpp_boundary_data(Rcpp::DataFrame data, arma::sp_mat strm, bool str_tree, double tolerance);
RcppExport SEXP _prioritizr_rcpp_boundary_data(SEXP dataSEXP, SEXP strmSEXP, SEXP str_treeSEXP, SEXP toleranceSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< Rcpp::DataFrame >::type data(dataSEXP);
Rcpp::traits::input_parameter< arma::sp_mat >::type strm(strmSEXP);
Rcpp::traits::input_parameter< bool >::type str_tree(str_treeSEXP);
Rcpp::traits::input_parameter< double >::type tolerance(toleranceSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_boundary_data(data, strm, str_tree, tolerance));
return rcpp_result_gen;
END_RCPP
}
// rcpp_branch_matrix
arma::sp_mat rcpp_branch_matrix(Rcpp::List x);
RcppExport SEXP _prioritizr_rcpp_branch_matrix(SEXP xSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< Rcpp::List >::type x(xSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_branch_matrix(x));
return rcpp_result_gen;
END_RCPP
}
// rcpp_forbid_solution
bool rcpp_forbid_solution(SEXP x, Rcpp::IntegerVector solution);
RcppExport SEXP _prioritizr_rcpp_forbid_solution(SEXP xSEXP, SEXP solutionSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< SEXP >::type x(xSEXP);
Rcpp::traits::input_parameter< Rcpp::IntegerVector >::type solution(solutionSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_forbid_solution(x, solution));
return rcpp_result_gen;
END_RCPP
}
// rcpp_list_to_matrix_indices
Rcpp::List rcpp_list_to_matrix_indices(Rcpp::List x, std::size_t n_preallocate);
RcppExport SEXP _prioritizr_rcpp_list_to_matrix_indices(SEXP xSEXP, SEXP n_preallocateSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< Rcpp::List >::type x(xSEXP);
Rcpp::traits::input_parameter< std::size_t >::type n_preallocate(n_preallocateSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_list_to_matrix_indices(x, n_preallocate));
return rcpp_result_gen;
END_RCPP
}
// rcpp_sp_to_polyset
Rcpp::DataFrame rcpp_sp_to_polyset(Rcpp::List x, std::string slot, std::size_t n_preallocate);
RcppExport SEXP _prioritizr_rcpp_sp_to_polyset(SEXP xSEXP, SEXP slotSEXP, SEXP n_preallocateSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< Rcpp::List >::type x(xSEXP);
Rcpp::traits::input_parameter< std::string >::type slot(slotSEXP);
Rcpp::traits::input_parameter< std::size_t >::type n_preallocate(n_preallocateSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_sp_to_polyset(x, slot, n_preallocate));
return rcpp_result_gen;
END_RCPP
}
// rcpp_str_tree_to_sparse_matrix
Rcpp::List rcpp_str_tree_to_sparse_matrix(Rcpp::List data);
RcppExport SEXP _prioritizr_rcpp_str_tree_to_sparse_matrix(SEXP dataSEXP) {
BEGIN_RCPP
Rcpp::RObject rcpp_result_gen;
Rcpp::RNGScope rcpp_rngScope_gen;
Rcpp::traits::input_parameter< Rcpp::List >::type data(dataSEXP);
rcpp_result_gen = Rcpp::wrap(rcpp_str_tree_to_sparse_matrix(data));
return rcpp_result_gen;
END_RCPP
}
| [
"jeffrey.hanson@uqconnect.edu.au"
] | jeffrey.hanson@uqconnect.edu.au |
44afadfedf11b5ce7fbe2eeb1423a633134fa8ea | 2c465b240d5718b89a2b2ed0c560a5a3d7f28190 | /qtree.h | 85bedaaaa652d4a923fb1c7dd6bccbd55ba70858 | [] | no_license | AlexZhou876/nbody | d96ff20edc371752fe69421ae1f25e66f41b0e78 | c8640d37c9eed0ccd40e9a06186eeed0b80c897d | refs/heads/master | 2023-05-03T10:01:04.952098 | 2021-05-16T01:07:15 | 2021-05-16T01:07:15 | 366,889,443 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,330 | h | #ifndef QTREE_H_
#define QTREE_H_
#include <vector>
#include "particle.h"
#include "vec2d.h"
#include "sim.h"
#include "SFML/Graphics.hpp"
class Node;
class QTree : public Sim {
public:
QTree();
QTree(std::vector<Particle*> particles, float width);
// nested tree traversal to compute next position for all particles
void next(int iterations);
// and rebuild tree based on new positions
void rebuild();
// return number of nodes in tree
int size();
// render the tree's node boundaries onto window
void renderTree(sf::RenderWindow& window);
// render the particles onto window
void renderParticles(sf::RenderWindow& window);
void render(sf::RenderWindow& w);
/*
* @param rhs The right hand side of the assignment statement.
*/
QTree & operator=(const QTree& rhs);
/*
* copy constructor
* @param other The QTree instance being copied into this
*/
QTree(const QTree& other);
/*
* destructor
*/
~QTree();
// class Leaf : Node {
// Particle* particle;
// };
// class Particle {
// public:
// Vec2d pos;
// Vec2d vel;
// Vec2d acc;
// float mass;
// Particle();
// Particle(Vec2d pos, Vec2d vel, Vec2d acc, float mass);
// void updateAccel(const Particle& other);
// void updateAccel(const QTree::Node& other);
// private:
// };
private:
Node* root;
//std::vector<Particle*> particles;
Node* build(Vec2d ul, std::vector<Particle*>& particles, float width);
};
class Node {
public:
Node(Vec2d ul, float width, Vec2d centerOfMass, float totalMass);
Node(Vec2d ul, float width);
//std::vector<Particle*> particles;
Node* nw;
Node* ne;
Node* sw;
Node* se;
Vec2d ul;
Vec2d centerOfMass;
float width;
float totalMass;
//int numParticles;
bool empty;
void update();
void insert(const Particle& p);
private:
float incrementalCtrMass(float newTotalMass, float nthMass, float nthPos, float prevCtrMass);
};
#endif | [
"azhou02@students.cs.ubc.ca"
] | azhou02@students.cs.ubc.ca |
de0b0ac8353db2717df78c60ebe4d64305824221 | 90db83e7fb4d95400e62fa2ce48bd371754987e0 | /src/chrome/browser/chromeos/net/network_diagnostics/network_diagnostics_util.h | 037fb3411c6fd7fde0dd5a11a521c9522f97d8d8 | [
"BSD-3-Clause"
] | permissive | FinalProjectNEG/NEG-Browser | 5bf10eb1fb8b414313d5d4be6b5af863c4175223 | 66c824bc649affa8f09e7b1dc9d3db38a3f0dfeb | refs/heads/main | 2023-05-09T05:40:37.994363 | 2021-06-06T14:07:21 | 2021-06-06T14:07:21 | 335,742,507 | 2 | 4 | null | null | null | null | UTF-8 | C++ | false | false | 2,903 | h | // Copyright 2020 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_CHROMEOS_NET_NETWORK_DIAGNOSTICS_NETWORK_DIAGNOSTICS_UTIL_H_
#define CHROME_BROWSER_CHROMEOS_NET_NETWORK_DIAGNOSTICS_NETWORK_DIAGNOSTICS_UTIL_H_
#include <string>
#include <vector>
class Profile;
namespace chromeos {
namespace network_diagnostics {
namespace util {
// Generate 204 path.
extern const char kGenerate204Path[];
// Returns the Gstatic host suffix. Network diagnostic routines attach a random
// prefix to |kGstaticHostSuffix| to get a complete hostname.
const char* GetGstaticHostSuffix();
// Returns the list representing a fixed set of hostnames used by routines.
const std::vector<std::string>& GetFixedHosts();
// Returns a string of length |length|. Contains characters 'a'-'z', inclusive.
std::string GetRandomString(int length);
// Returns |num_hosts| random hosts, each suffixed with |kGstaticHostSuffix| and
// prefixed with a random string of length |prefix_length|.
std::vector<std::string> GetRandomHosts(int num_hosts, int prefix_length);
// Similar to GetRandomHosts(), but the fixed hosts are prepended to the list.
// The total number of hosts in this list is GetFixedHosts().size() +
// num_random_hosts.
std::vector<std::string> GetRandomHostsWithFixedHosts(int num_random_hosts,
int prefix_length);
// Similar to GetRandomHosts, but with a |scheme| prepended to the hosts.
std::vector<std::string> GetRandomHostsWithScheme(int num_hosts,
int prefix_length,
std::string scheme);
// Similar to GetRandomHostsWithFixedHosts, but with a |scheme| prepended to the
// hosts.
std::vector<std::string> GetRandomAndFixedHostsWithScheme(int num_random_hosts,
int prefix_length,
std::string scheme);
// Similar to GetRandomAndFixedHostsWithSchemeAndPort, but with |port|, followed
// by "/", appended to the hosts. E.g. A host will look like:
// "https://www.google.com:443/".
std::vector<std::string> GetRandomAndFixedHostsWithSchemeAndPort(
int num_random_hosts,
int prefix_length,
std::string scheme,
int port_number);
// Similar to GetRandomHostsWithScheme, but with the 204 path appended to hosts.
std::vector<std::string> GetRandomHostsWithSchemeAndGenerate204Path(
int num_hosts,
int prefix_length,
std::string scheme);
// Returns the profile associated with this account.
Profile* GetUserProfile();
} // namespace util
} // namespace network_diagnostics
} // namespace chromeos
#endif // CHROME_BROWSER_CHROMEOS_NET_NETWORK_DIAGNOSTICS_NETWORK_DIAGNOSTICS_UTIL_H_
| [
"sapirsa3@ac.sce.ac.il"
] | sapirsa3@ac.sce.ac.il |
4dd7fc228c38f25c1ebd65e6a1f1a1b473453d01 | 3d2f45bcecde8dff7e4131b65cdeb0ce32cff03f | /CppSystemCase01/SystemApp/EasyXDemo/EasyXDemo.cpp | b324ef27d9a58886ff780f0df648bb6cb7d2b772 | [
"Unlicense"
] | permissive | lvse301/CppCase01 | 94ffa8071daa372e274faad4fb4798f9b36fb9c1 | 339611a9200aee83ce5399699920a6867443f014 | refs/heads/main | 2023-03-07T10:55:38.102298 | 2021-02-21T10:06:06 | 2021-02-21T10:06:06 | 337,090,149 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 6,796 | cpp | // EasyXDemo.cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。
//
#include <iostream>
#include <graphics.h>
#include <ctime>
#include <conio.h>
#include <vector>
using namespace std;
// 枚举蛇的方向
enum position { Up=1, Down, Left, Right };
// 坐标属性
struct point
{
int x;
int y;
};
// 蛇的属性
struct Snake
{
vector <point> xy; // 每节坐标
point next; // 为下一节预留的位置
vector <COLORREF> color; // 每节颜色
int num; // 长度
int position; // 方向
}snake;
// 食物的属性
struct Food
{
point fdxy[10]; // 坐标
int grade; // 分数
int num = 1; // 食物总数
COLORREF color[10]; // 食物颜色
}food;
// 初始化蛇
void initSnake()
{
point xy;
xy.x = 20;
xy.y = 0;
snake.xy.push_back(xy);
snake.color.push_back(RGB(rand() % 256, rand() % 256, rand() % 256)); // 设置一个随机颜色
xy.x = 10;
xy.y = 0;
snake.xy.push_back(xy);
snake.color.push_back(RGB(rand() % 256, rand() % 256, rand() % 256)); // 设置一个随机颜色
xy.x = 0;
xy.y = 0;
snake.xy.push_back(xy);
snake.color.push_back(RGB(rand() % 256, rand() % 256, rand() % 256)); // 设置一个随机颜色
snake.num = 3;
snake.position = Right;
}
// 画蛇
void drawSnake()
{
for (int i = 0; i < snake.num; i++)
{
setfillcolor(snake.color[i]);
fillrectangle(snake.xy[i].x, snake.xy[i].y, snake.xy[i].x + 10, snake.xy[i].y + 10);
}
}
// 移动蛇
void moveSnake()
{
// 将预留节设置为未移动前的尾节
snake.next = snake.xy[snake.num - 1];
// 将除蛇头以外的节移动到它的前面一节
for (int i = snake.num - 1; i >= 1; i--)
snake.xy[i] = snake.xy[i - 1];
// 根据当前移动方向移动蛇头
switch (snake.position)
{
case Right:
snake.xy[0].x += 10;
break;
case Left:
snake.xy[0].x -= 10;
break;
case Up:
snake.xy[0].y -= 10;
break;
case Down:
snake.xy[0].y += 10;
}
}
// 按键交互
void keyDown()
{
char userKey = _getch();
if (userKey == -32) // 表明这是方向键
userKey = -_getch(); // 获取具体方向，并避免与其他字母的 ASCII 冲突
switch (userKey)
{
case 'w':
case 'W':
case -72:
if (snake.position != Down)
snake.position = Up;
break;
case 's':
case 'S':
case -80:
if (snake.position != Up)
snake.position = Down;
break;
case 'a':
case 'A':
case -75:
if (snake.position != Right)
snake.position = Left;
break;
case 'd':
case 'D':
case -77:
if (snake.position != Left)
snake.position = Right;
break;
}
}
// 初始化食物
void initFood(int num /* 食物编号 */)
{
food.fdxy[num].x = rand() % 80 * 10;
food.fdxy[num].y = rand() % 60 * 10;
for (int i = 0; i < snake.num; i++)
if (food.fdxy[num].x == snake.xy[i].x && food.fdxy[num].y == snake.xy[i].y) // 避免食物生成在蛇身上
{
food.fdxy[num].x = rand() % 80 * 10;
food.fdxy[num].y = rand() % 60 * 10;
}
}
// 画食物
void drawFood()
{
for (int i = 0; i <= food.num - 1; i++)
{
setfillcolor(food.color[i] = RGB(rand() % 256, rand() % 256, rand() % 256)); // 每次重新赋予食物一个随机的颜色
fillrectangle(food.fdxy[i].x, food.fdxy[i].y, food.fdxy[i].x + 10, food.fdxy[i].y + 10);
}
}
// 吃食物
void eatFood()
{
for (int i = 0; i <= food.num - 1; i++)
if (snake.xy[0].x == food.fdxy[i].x && snake.xy[0].y == food.fdxy[i].y)
{
snake.num++;
snake.xy.push_back(snake.next); // 新增一个节到预留位置
snake.color.push_back(food.color[i]); // 将新增节的颜色设置为当前吃掉食物的颜色
food.grade += 100;
initFood(i);
if (food.num < 10 && food.grade % 500 == 0 && food.grade != 0)
{
food.num++; // 每得 500 分，增加一个食物，但食物总数不超过 10 个
initFood(food.num - 1); // 初始化新增加的食物
}
break;
}
}
// 分数显示
void showgrade()
{
wchar_t grade[20] = L"";
swprintf_s(grade, L"分数:%d", food.grade);
outtextxy(650, 50, grade);
}
// 游戏结束
bool gameOver()
{
// 撞墙，将墙向外扩展一圈（否则蛇无法到达地图边缘）
if (snake.xy[0].y <= -10 && snake.position == Up) return true;
if (snake.xy[0].y + 10 >= 610 && snake.position == Down) return true;
if (snake.xy[0].x <= -10 && snake.position == Left) return true;
if (snake.xy[0].x + 10 >= 810 && snake.position == Right) return true;
// 撞自己
for (int i = 1; i < snake.num; i++)
{
if (snake.xy[0].x <= snake.xy[i].x + 10 && snake.xy[0].x >= snake.xy[i].x && snake.xy[0].y == snake.xy[i].y && snake.position == Left)
return true;
if (snake.xy[0].x + 10 >= snake.xy[i].x && snake.xy[0].x + 10 <= snake.xy[i].x + 10 && snake.xy[0].y == snake.xy[i].y && snake.position == Right)
return true;
if (snake.xy[0].y <= snake.xy[i].y + 10 && snake.xy[0].y >= snake.xy[i].y && snake.xy[0].x == snake.xy[i].x && snake.position == Up)
return true;
if (snake.xy[0].y + 10 >= snake.xy[i].y && snake.xy[0].y + 10 <= snake.xy[i].y + 10 && snake.xy[0].x == snake.xy[i].x && snake.position == Down)
return true;
}
return false;
}
int main()
{
std::cout << "Hello World!\n";
initgraph(800, 600);
setbkcolor(RGB(95, 183, 72));
srand((unsigned)time(NULL));
settextcolor(BLUE);
setbkmode(TRANSPARENT); // 设置文字输出模式为透明
initSnake();
initFood(0);
drawSnake();
while (!gameOver())
{
Sleep(150);
BeginBatchDraw(); // 开始批量绘图，作用是避免闪烁
cleardevice();
if (_kbhit()) keyDown();
moveSnake();
eatFood();
drawFood();
drawSnake();
showgrade();
EndBatchDraw(); // 结束批量绘图
}
// 如果因为撞墙死亡则退回到撞墙前的状态以便将蛇完整显示出来
if (snake.xy[0].y <= -10 && snake.position == Up ||
snake.xy[0].y + 10 >= 610 && snake.position == Down ||
snake.xy[0].x <= -10 && snake.position == Left ||
snake.xy[0].x + 10 >= 810 && snake.position == Right)
{
for (int i = 0; i <= snake.num - 2; i++)
snake.xy[i] = snake.xy[i + 1];
snake.xy[snake.num - 1] = snake.next;
drawSnake();
}
_getch(); // 按任意键退出
return 0;
}
// 运行程序: Ctrl + F5 或调试 >“开始执行(不调试)”菜单
// 调试程序: F5 或调试 >“开始调试”菜单
// 入门使用技巧:
// 1. 使用解决方案资源管理器窗口添加/管理文件
// 2. 使用团队资源管理器窗口连接到源代码管理
// 3. 使用输出窗口查看生成输出和其他消息
// 4. 使用错误列表窗口查看错误
// 5. 转到“项目”>“添加新项”以创建新的代码文件，或转到“项目”>“添加现有项”以将现有代码文件添加到项目
// 6. 将来，若要再次打开此项目，请转到“文件”>“打开”>“项目”并选择 .sln 文件
| [
"lvese301@gmail.com"
] | lvese301@gmail.com |
ff22e61b8e326591a8b86777a060cb9e1fa44ebd | 916b2132bcd49372fca98c3002d49b70daf741d3 | /overloading.cpp | 72a89b51b5e34b17aadb949d2084231394589a67 | [] | no_license | JaeHun0304/cpp_study | 863e07b07506d6c0b920f476aa38e3006a458261 | afb10ff210a91ea13e476a6f71a1db42f625e92d | refs/heads/main | 2023-01-13T09:45:16.689204 | 2020-11-09T03:30:20 | 2020-11-09T03:30:20 | 310,962,593 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,496 | cpp | // The <bits/stdc++.h> is a header file. This file includes all standard library.
#include <bits/stdc++.h>
using namespace std;
// function overloading class example (compile time polymorphism)
class Funcoverload
{
public:
// function with 1 int parameter
void func(int x){
cout << "value of x is " << x << endl;
}
// function with 1 double parameter, same function name "func" will be overloaded
void func(double x){
cout << "value of x is " << x << endl;
}
// function with 2 int parameters, same function name "func" will be overloaded
void func(int x, int y){
cout << "value of x and y are " << x << ", " << y << endl;
}
};
// overlator overloading class example (compile time polymorphism)
class Complex
{
private:
int real, imag;
public:
// Constructor with 1 real and 1 imag int parameters
Complex(int r = 0, int i = 0) {real = r; imag = i;}
// Overload + operator with const reference to Complex object
Complex operator + (Complex const &obj){
Complex res;
res.real = real + obj.real;
res.imag = imag + obj.imag;
return res;
}
//print method
void print() { cout << real << " + i" << imag << endl; }
};
int main(){
//instantitae class A with object a1
Funcoverload a1;
// 1st form of func
a1.func(7);
// 2nd form of func
a1.func(9.132);
// 3rd form of func
a1.func(85, 64);
Complex c1(10, 5), c2(2, 4);
// '+' operator has been overloaded
Complex c3 = c1 + c2;
c3.print();
return 0;
} | [
"jaehjung@DESKTOP-56SU65I.localdomain"
] | jaehjung@DESKTOP-56SU65I.localdomain |
85a83521b2a1ae7ec86fedc6103300e85377618e | aa07f25902c510ce7b7e2d4c2544e47960521fa9 | /interface/gen-cpp/ant_types.cpp | 560c1a233fce197aa6e76317ff2918deb83aab97 | [] | no_license | thejasper/JAMAnt | 68c44b50eaa576c3e1613c369042327862a323c1 | 21de0fdb1f5512372b6d76cf8698dae1d5de1541 | refs/heads/master | 2016-08-05T03:57:30.812195 | 2013-02-21T09:38:28 | 2013-02-21T09:38:28 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | true | 2,252 | cpp | /**
* Autogenerated by Thrift Compiler (0.9.0)
*
* DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING
* @generated
*/
#include "ant_types.h"
#include <algorithm>
namespace robotics {
const char* AntSettings::ascii_fingerprint = "EEBC915CE44901401D881E6091423036";
const uint8_t AntSettings::binary_fingerprint[16] = {0xEE,0xBC,0x91,0x5C,0xE4,0x49,0x01,0x40,0x1D,0x88,0x1E,0x60,0x91,0x42,0x30,0x36};
uint32_t AntSettings::read(::apache::thrift::protocol::TProtocol* iprot) {
uint32_t xfer = 0;
std::string fname;
::apache::thrift::protocol::TType ftype;
int16_t fid;
xfer += iprot->readStructBegin(fname);
using ::apache::thrift::protocol::TProtocolException;
while (true)
{
xfer += iprot->readFieldBegin(fname, ftype, fid);
if (ftype == ::apache::thrift::protocol::T_STOP) {
break;
}
switch (fid)
{
case 1:
if (ftype == ::apache::thrift::protocol::T_STRING) {
xfer += iprot->readString(this->port);
this->__isset.port = true;
} else {
xfer += iprot->skip(ftype);
}
break;
case 2:
if (ftype == ::apache::thrift::protocol::T_I32) {
xfer += iprot->readI32(this->baudrate);
this->__isset.baudrate = true;
} else {
xfer += iprot->skip(ftype);
}
break;
default:
xfer += iprot->skip(ftype);
break;
}
xfer += iprot->readFieldEnd();
}
xfer += iprot->readStructEnd();
return xfer;
}
uint32_t AntSettings::write(::apache::thrift::protocol::TProtocol* oprot) const {
uint32_t xfer = 0;
xfer += oprot->writeStructBegin("AntSettings");
xfer += oprot->writeFieldBegin("port", ::apache::thrift::protocol::T_STRING, 1);
xfer += oprot->writeString(this->port);
xfer += oprot->writeFieldEnd();
xfer += oprot->writeFieldBegin("baudrate", ::apache::thrift::protocol::T_I32, 2);
xfer += oprot->writeI32(this->baudrate);
xfer += oprot->writeFieldEnd();
xfer += oprot->writeFieldStop();
xfer += oprot->writeStructEnd();
return xfer;
}
void swap(AntSettings &a, AntSettings &b) {
using ::std::swap;
swap(a.port, b.port);
swap(a.baudrate, b.baudrate);
swap(a.__isset, b.__isset);
}
} // namespace
| [
"jasper_desmadryl@hotmail.com"
] | jasper_desmadryl@hotmail.com |
2a517a5c8400cb5aaf380e7df1f6e03a8314ad73 | a0f05422a36a84de78631999edd3510f014fd532 | /code/quicksort/cpp/2276.cpp | 650170997709f6d0a948097ff1d153ca95a5bb9b | [] | no_license | yijunyu/bi-tbcnn | 20093acc433cac7ee69d297117a6b928151d7cc5 | 74d0410d6ff07dad99014d7ef34a7d353202ca8b | refs/heads/master | 2021-09-18T13:17:22.526840 | 2018-02-21T16:25:49 | 2018-02-21T16:25:49 | 111,034,124 | 6 | 3 | null | 2017-11-16T23:31:54 | 2017-11-16T23:31:54 | null | UTF-8 | C++ | false | false | 874 | cpp | #include<iostream>
using namespace std;
int Partition(int a[], int beg, int end) //Function to Find Pivot Point
{
int p=beg, pivot=a[beg], loc;
for(loc=beg+1;loc<=end;loc++)
{
if(pivot>a[loc])
{
a[p]=a[loc];
a[loc]=a[p+1];
a[p+1]=pivot;
p=p+1;
}
}
return p;
}
void QuickSort(int a[], int beg, int end)
{
if(beg<end)
{
int p=Partition(a,beg,end); //Calling Procedure to Find Pivot
QuickSort(a,beg,p-1); //Calls Itself (Recursion)
QuickSort(a,p+1,end); //Calls Itself (Recursion)
}
}
int *a;
int main()
{
int i,n,beg,end;
//cout<<"Enter the No. of Elements : ";
cin>>n;
a=new int[n];
for(i=1;i<=n;i++)
{
cin>>a[i];
}
beg=1;
end=n;
QuickSort(a,beg,end); //Calling of QuickSort Function
//cout<<"\nAfter Sorting : \n";
for(i=1;i<=n;i++)
{
cout<<a[i]<<endl;
}
}
| [
"y.yu@open.ac.uk"
] | y.yu@open.ac.uk |
a4603c66aaaa9ca05fd823bd5993af1ccec43953 | 22d3eb446ad65e5d5228c228d37a82845580bac1 | /src/include/entry.h | c5349af068a7903c8f11694bff495c25117a4c4d | [] | no_license | chenanton/issue-tracker | d5cd1adc4a218efb1356cbb0feafd7c9f40042b7 | 7fbfc9eaba8259f86e86196e1c2921a83dac453f | refs/heads/master | 2022-12-17T13:49:35.020973 | 2020-09-08T00:49:32 | 2020-09-08T00:49:32 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,714 | h | /*
Anton Chen 2020
github.com/azychen/issue-tracker
*/
#pragma once
#include <algorithm>
#include <chrono>
#include <ctime>
#include <iostream>
#include <string>
#include <dirent.h>
// Abstract class, represents a generic entry,
// is inherited by Group and Issue classes.
class Entry {
protected:
static int prev_id;
const static int creation_date_length = 20;
// Fields
int id;
int parent_id;
std::string creation_date;
std::string title;
bool is_active;
public:
// Constructors
Entry() {}
Entry(std::string t, int pid = -1);
Entry(int pid, std::string cd, std::string t);
Entry(int id, int pid, std::string cd, std::string t, bool active = true);
Entry(const Entry& e);
// Get fields
int get_id() const { return id; }
int get_parent_id() const { return parent_id; }
virtual bool add_entry(Entry* e) { return false; }
const std::string& get_creation_date() const { return creation_date; }
const std::string& get_title() const { return title; }
bool get_active() { return is_active; }
// Edit fields
void set_parent_id(int id) { parent_id = id; }
void set_title(std::string t) { title = t; }
virtual bool delete_entry(int id);
virtual void set_repository(std::string r) = 0;
virtual void deactivate() = 0;
virtual void activate() = 0;
// Auxiliary methods
virtual void print_info(const int level = 0) const = 0;
virtual bool save_to_file(std::string file_path, bool overwrite = true) = 0;
virtual bool can_add_entry() = 0;
virtual Entry* get_copy() const = 0;
virtual void clear() {}
// protected:
std::string& sanitize(std::string& s);
};
| [
"antonzychen+github@gmail.com"
] | antonzychen+github@gmail.com |
7a538350ca9488d16e751a2817b04a57f9bc61dc | 80e24133e76a3c760ecd6a8e60be59d3dcfad6e8 | /src/entities/enttypes.h | 7b4b981c8b91d9acdc2d2f1ead31ec56eaffc264 | [] | no_license | CiprianBeldean/omega-Y | 385840926e823bb9665bf272d8048eb278972712 | 3426da42f8dff4033efe53cf9cef1bb11eeb1c7c | refs/heads/master | 2022-02-05T00:01:57.712787 | 2019-07-29T10:54:04 | 2019-07-29T10:54:04 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 374 | h | #ifndef __ENTTYPES_H__
#define __ENTTYPES_H__
namespace EntityTypes {
enum GameEntityTypes : unsigned {
FREE_CAMERA = 101, // we start at 101 to avoid collision with EntityTypes::EType from boglfw
PLAYER = 102,
TERRAIN = 103,
SKYBOX = 104,
PROJECTILE = 105, // all projectiles have this entity type
};
} // namespace
#endif // __ENTTYPES_H__
| [
"bog2k3@gmail.com"
] | bog2k3@gmail.com |
ec8d60d5fe138c033a5652fbb724b803c6f0f8ca | 97a019b52a56cfd16cd7c4dbb730e83c581d2b3e | /Archived/Research/Benchmark/SetupEnvironment.h | d52e124bf1b64d6b92d6e2f5c54a13037829d51b | [] | no_license | nalinraut/high-level-Motion-Planning | f0263dcfa344b914159b0486370bc544552ac360 | 08cd792124defba63583ba6ae6394b20329d38c0 | refs/heads/master | 2020-03-09T04:20:12.846801 | 2018-04-09T06:11:29 | 2018-04-09T06:11:29 | 128,585,159 | 1 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 3,020 | h | /*
* File: SetupEnvironment.h
* Author: Jingru
*
* Created on March 13, 2012, 11:35 AM
*/
#ifndef READENVIRONMENT_H
#define READENVIRONMENT_H
#include <iostream>
#include <fstream>
#include <sstream>
#include <cstring>
#include <ompl/base/ScopedState.h>
#include <math/vector.h>
#include "Polyhedron.h"
#include "CEState.h"
namespace ob = ompl::base;
static const double lowbound = 0;
static const double highbound = 0;
//int nD_global = 2;
//int mD_global = 2*nD_global;
static const double width_global = 0.2;
static const double thin_global = 0.1;
static const double onefourth_global = 0.25;
static const double onesecond_global = 0.5;
static const double joint_start_5D[] = {120, -90, -80, -110, -120};
static const double joint_goal_5D[] = {179, 0, 0, 0, 0};
static const double joint_start_6D[] = {120, -90, -60, -110, -80, -130};
static const double joint_goal_6D[] = {179, 0, 0, 0, 0, 0};
static const double joint_start_7D[] = {150, -90, -50, -80, -90, -100, -130};
static const double joint_goal_7D[] = {179, 0, 0, 0, 0, 0, 0};
static const double joint_start_8D[] = {150, -90, -50, -80, -80, -80, -100, -125};
static const double joint_goal_8D[] = {179, 0, 0, 0, 0, 0, 0, 0};
static const int num_config_best_path_kink = 8;
enum ScenarioIndex{
NarrowPassage_2_homotopy,
NarrowPassage_1_homotopy,
PlanaryLinkage,
NarrowKink_1_homotopy
};
const double stateCheckResolution = 0.001;
double getBestPathCost(ScenarioIndex scenario, int nD, double width, double thin, double valuePerturb = 0);
double getBestPathCost_Linkage(int nD);
double getBestPathCost_1_Kink(int nD, double width, double thin, double valuePerturb = 0);
double getBestPathCost_2_homotopy(int nD, double width, double thin, double valuePerturb = 0);
double getBestPathCost_1_homotopy(int nD, double width, double thin, double valuePerturb = 0);
void getScenarioBounds(ScenarioIndex scenario, double &low, double &high);
ob::StateValidityChecker* setupNarrowPassage(ScenarioIndex scenario, ob::SpaceInformationPtr &si, const int &nD, const double &width, const double &thin, double valuePerturb = 0);
//width is the width of narrow passage, thin is the horizontal length of the horizontal narrow passage
vector<Polyhedron> setupNarrowPassage_1_Kink(const int &nD, const double &width, double thin, double valuePerturb = 0);
vector<Polyhedron> setupNarrowPassage_2_homotopy(const int &nD, const double &width, const double &thin, double valuePerturb = 0);
vector<Polyhedron> setupNarrowPassage_1_homotopy(const int &nD, const double &width, const double &thin, double valuePerturb = 0);
vector<Polyhedron> readNarrowPassage(const char* filename, CEState &sp, CEState &gp, int &D);
bool readFile(const char* filename, int &nD, double &width, double &thin);
void setupStartandGoal(ScenarioIndex scenario, const int &nD, const double &thin, ob::ScopedState<> &start, ob::ScopedState<> &goal);
#endif /* READENVIRONMENT_H */
| [
"rautnalin@gmail.com"
] | rautnalin@gmail.com |
42cbfc83712cfc13890c8248c9033cc7bec25faf | 1dfd12072c1926b6ea710c090573ecbb7bdc08bd | /FactoryReset/FactoryReset.ino | c27149473d53bd8f5650135bed06359bc1802955 | [] | no_license | prudolph/arduinoProjects | c57c65d5e13e45848a1039a545516cae35321a4d | b8297a64fda05a2b4efb2d4aa4071fc6a3994142 | refs/heads/master | 2020-04-12T05:16:32.693407 | 2018-12-18T17:34:53 | 2018-12-18T17:34:53 | 162,320,964 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,946 | ino | /**************************************************************
*
* To run this tool you need StreamDebugger library:
* https://github.com/vshymanskyy/StreamDebugger
* or from http://librarymanager/all#StreamDebugger
*
* TinyGSM Getting Started guide:
* http://tiny.cc/tiny-gsm-readme
*
**************************************************************/
// Select your modem:
#define TINY_GSM_MODEM_SIM800
// #define TINY_GSM_MODEM_SIM900
// #define TINY_GSM_MODEM_A6
// #define TINY_GSM_MODEM_A7
// #define TINY_GSM_MODEM_M590
// #define TINY_GSM_MODEM_ESP8266
#include <TinyGsmClient.h>
// Set serial for debug console (to the Serial Monitor, speed 115200)
#define SerialMon Serial
// Set serial for AT commands (to the module)
// Use Hardware Serial on Mega, Leonardo, Micro
#define SerialAT Serial1
// or Software Serial on Uno, Nano
#include <SoftwareSerial.h>
SoftwareSerial SerialAT(3, 2); // RX, TX
//#include <StreamDebugger.h>
//StreamDebugger debugger(SerialAT, SerialMon);
TinyGsm modem(SerialAT);
void setup() {
// Set console baud rate
SerialMon.begin(115200);
delay(10);
// Set GSM module baud rate
SerialAT.begin(115200);
delay(3000);
if (!modem.init()) {
SerialMon.println(F("***********************************************************"));
SerialMon.println(F(" Cannot initialize modem!"));
SerialMon.println(F(" Use File -> Examples -> TinyGSM -> tools -> AT_Debug"));
SerialMon.println(F(" to find correct configuration"));
SerialMon.println(F("***********************************************************"));
return;
}
bool ret = modem.factoryDefault();
SerialMon.println(F("***********************************************************"));
SerialMon.print (F(" Return settings to Factory Defaults: "));
SerialMon.println((ret) ? "OK" : "FAIL");
SerialMon.println(F("***********************************************************"));
}
void loop() {
}
| [
"paul.e.rudolph@gmail.com"
] | paul.e.rudolph@gmail.com |
833dda8483449645a785b1540fcca6625f630984 | dc650d6e924de04990458c8f5a42dca4a165450a | /2016.08.14-2016-CCPC2016-Online/C.cpp | 2b7c53bf25c56feaa6d73800dfce172d93f96685 | [] | no_license | Nerer/Mjolnir | 2d5f465988d9792682b16599d50af316a261fef8 | 823870125697f8355f3df52e97836af2a74c78c7 | refs/heads/master | 2021-01-21T01:44:22.618215 | 2016-08-14T12:38:05 | 2016-08-14T12:38:05 | 64,058,347 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,282 | cpp | #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int n, a[N];
struct edge
{
int v, w, next;
}e[N * 2];
int head[N], k;
int fa[N];
int f[N], g[N], ff[N], gg[N], ans[N];
vector <int> f1[N], f2[N];
vector <int> g1[N], g2[N];
int dis[N];
void adde(int u, int v, int w)
{
e[k].v = v;
e[k].w = w;
e[k].next = head[u];
head[u] = k++;
}
inline int fix(int x)
{
if(x < 0) return 0;
return x;
}
void dfs1(int u)
{
for(int i = head[u]; ~i; i = e[i].next)
{
int v = e[i].v;
if(v == fa[u]) continue;
fa[v] = u;
dfs1(v);
dis[v] = e[i].w;
}
vector <int> son;
for(int i = head[u]; ~i; i = e[i].next)
{
int v = e[i].v;
if(v == fa[u]) continue;
son.push_back(v);
}
f1[u].resize(son.size());
f2[u].resize(son.size());
g1[u].resize(son.size());
g2[u].resize(son.size());
int mx1 = 0, mx2 = 0;
f[u] = a[u];
g[u] = a[u];
for(int i = 0; i < (int) son.size(); i++)
{
int v = son[i];
if(f[v] - 2 * dis[v] >= 0)
{
f[u] += f[v] - 2 * dis[v];
mx1 = max(mx1, (g[v] - dis[v]) - (f[v] - 2 * dis[v]));
}
else
{
mx2 = max(mx2, g[v] - dis[v]);
}
g[u] = max(f[u] + mx1, f[u] + mx2);
f1[u][i] = f[u];
g1[u][i] = g[u];
}
mx1 = mx2 = 0;
f[u] = a[u];
g[u] = a[u];
for(int i = (int) son.size() - 1; i >= 0; i--)
{
int v = son[i];
if(f[v] - 2 * dis[v] >= 0)
{
f[u] += f[v] - 2 * dis[v];
mx1 = max(mx1, (g[v] - dis[v]) - (f[v] - 2 * dis[v]));
}
else
{
mx2 = max(mx2, g[v] - dis[v]);
}
g[u] = max(f[u] + mx1, f[u] + mx2);
f2[u][i] = f[u];
g2[u][i] = g[u];
}
}
void dfs2(int u)
{
vector <int> son;
for(int i = head[u]; ~i; i = e[i].next)
{
int v = e[i].v;
if(v == fa[u]) continue;
son.push_back(v);
}
for(int i = 0; i < (int) son.size(); i++)
{
int v = son[i];
ff[v] = ff[u] + f[u];
if(f[v] - 2 * dis[v] >= 0) ff[v] -= f[v] - 2 * dis[v];
ff[v] -= 2 * dis[v];
if(ff[v] < 0) ff[v] = 0;
gg[v] = (i == 0 ? 0 : fix(f1[u][i - 1] - a[u])) + ((i == (int) son.size() - 1) ? 0: fix(f2[u][i + 1] - a[u])) + a[u] + gg[u] - dis[v];
gg[v] = max(gg[v], ff[u] + (i == 0 ? 0 : fix(f1[u][i - 1] - a[u])) + ((i == (int) son.size() - 1) ? 0 : fix(g2[u][i + 1] - a[u])) + a[u] - dis[v]);
gg[v] = max(gg[v], ff[u] + (i == 0 ? 0 : fix(g1[u][i - 1] - a[u])) + ((i == (int) son.size() - 1) ? 0 : fix(f2[u][i + 1] - a[u])) + a[u] - dis[v]);
if(gg[v] < 0) gg[v] = 0;
}
son.clear();
for(int i = head[u]; ~i; i = e[i].next)
{
int v = e[i].v;
if(v == fa[u]) continue;
dfs2(v);
}
}
void solve()
{
dfs1(1);
dfs2(1);
for(int u = 1; u <= n; u++)
{
ans[u] = max(f[u] + gg[u], ff[u] + g[u]);
}
for(int i = 1; i <= n; i++)
{
printf("%d\n", ans[i]);
}
}
int main()
{
int t;
cin >> t;
for(int i = 1; i <= t; i++)
{
printf("Case #%d:\n", i);
scanf("%d", &n);
for(int j = 1; j <= n; j++) head[j] = -1;
k = 0;
for(int j = 1; j <= n; j++)
{
f1[j].clear();
f2[j].clear();
g1[j].clear();
g2[j].clear();
f[j] = g[j] = ff[j] = gg[j] = fa[j] = 0;
}
for(int j = 1; j <= n; j++) scanf("%d", &a[j]);
for(int j = 2; j <= n; j++)
{
int u, v, w;
scanf("%d%d%d", &u, &v, &w);
adde(u, v, w);
adde(v, u, w);
}
solve();
}
return 0;
}
/*
Case #1:
99
95 99 0 0
100
98 100 0 0
100
100 100 0 0
97
1 1 94 96
97
1 1 94 96
*/
| [
"xunayun1996@163.com"
] | xunayun1996@163.com |
7bd9678b54f6db4de4b099d6e54007c4b419c293 | c6a311cec2cdca13e2facf1e93c92cc01656de7b | /filter/FilterEdge.cpp | f1a2ef7763992896db60ceb138d60b2e5a6b65a5 | [] | no_license | junewoop/projects | f01cba4037fb855fd03806c387e1ffc1d3d2167d | bb4543980eedd33676310ec4ce0201d2378c437a | refs/heads/master | 2023-08-27T02:55:58.514142 | 2021-11-05T21:16:55 | 2021-11-05T21:16:55 | 298,744,123 | 0 | 0 | null | 2020-09-26T05:28:07 | 2020-09-26T05:28:06 | null | UTF-8 | C++ | false | false | 1,882 | cpp | #include "FilterEdge.h"
FilterEdge::FilterEdge(float p) :
m_p(p)
{
}
FilterEdge::~FilterEdge()
{
}
void FilterEdge::apply(Canvas2D *canvas){
// apply Grayscale
FilterGray::apply(canvas);
// load image
std::vector<float> vec_gray, tmp_g_x, tmp_g_y;
loadImage(canvas, vec_gray, tmp_g_x, tmp_g_y);
// apply horizontal 1D kernel
int ind = 0;
for (int r = 0; r < m_height; r++){
for (int c = 0; c < m_width; c++){
if(c == 0){
tmp_g_x[ind] = -vec_gray[ind] + vec_gray[ind + 1];
tmp_g_y[ind] = 2* vec_gray[ind] + vec_gray[ind + 1];
}
else if (c == m_width - 1){
tmp_g_x[ind] = -vec_gray[ind-1] + vec_gray[ind];
tmp_g_y[ind] = vec_gray[ind-1] + 2*vec_gray[ind];
}
else{
tmp_g_x[ind] = -vec_gray[ind-1] + vec_gray[ind+1];
tmp_g_y[ind] = vec_gray[ind-1] + 2*vec_gray[ind] + vec_gray[ind + 1];
}
ind++;
}
}
// apply vertical 1D kernel
ind = 0;
float g_x = 0.f, g_y = 0.f;
for (int r = 0; r < m_height; r++){
for(int c = 0; c < m_width; c++){
if(r == 0){
g_x = 2*tmp_g_x[ind] + tmp_g_x[ind+m_width];
g_y = tmp_g_y[ind] - tmp_g_y[ind+m_width];
}
else if (r == m_height - 1){
g_x = tmp_g_x[ind-m_width] + 2*tmp_g_x[ind];
g_y = -tmp_g_y[ind-m_width] + tmp_g_y[ind];
}
else{
g_x = tmp_g_x[ind-m_width] + 2*tmp_g_x[ind] + tmp_g_x[ind + m_width];
g_y = -tmp_g_y[ind-m_width] + tmp_g_y[ind+m_width];
}
vec_gray[ind] = sqrtf(g_x*g_x+g_y*g_y)*m_p;
ind++;
}
}
// save image
saveImage(canvas, vec_gray, vec_gray, vec_gray);
}
| [
"40329273+junewoop@users.noreply.github.com"
] | 40329273+junewoop@users.noreply.github.com |
17114ae5eab86ba0d9f08ba65e2d1768736e6aba | f63196d2f8340031e2ad4845eda2cf02212b6506 | /drawer/D3DEngine.cpp | 7da70305a81ee735b9fc3e4db4379cf670ab86dd | [] | no_license | RoyLab/TuneCurve | 3af103534eb4af661ff588dd15181682e7c5e696 | 5a6b610cd818097edad743961071e073421031c3 | refs/heads/master | 2021-01-01T15:40:25.356752 | 2014-08-27T02:21:59 | 2014-08-27T02:21:59 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 3,770 | cpp | #include "stdafx.h"
#include "D3DEngine.h"
#include "VirtualDeviceDx11.h"
#include "Camera.h"
#include "Shader2D.h"
#include "Ellipse.h"
D3DEngine::D3DEngine(void):
mD3D(nullptr), mCamera(nullptr),
mShader(nullptr), mCircle(nullptr)
{
}
D3DEngine::~D3DEngine(void)
{
}
bool D3DEngine::Initialize(int width, int height, HWND hWnd)
{
bool res = false;
mD3D = new VirtualDeviceDx11;
res = mD3D->Initialize(width, height, true, hWnd, false, 1000.0f, 0.1f);
if (!res) return false;
mCamera = new Camera;
if(!mCamera) return false;
mCamera->SetPosition(0.0f, 0.0f, -10.0f);
mShader = new Shader2D;
if(!mShader)
return false;
// Initialize the texture shader object.
res = mShader->Initialize(mD3D->GetDevice(), hWnd);
if(!res)
{
MessageBox(hWnd, L"Could not initialize the shader object.", L"Error", MB_OK);
return false;
}
//mCircle = new Circle;
mCircle = new MyEllipse(mD3D->GetDevice(), mD3D->GetDeviceContext());
if (!mCircle) return false;
//res = mCircle->Initialize(mD3D->GetDevice(), width, height);
MyEllipse::CirclePara cPara;
cPara.center = float2(0, 0);
cPara.maxSize = 500.0f;
cPara.count = 1;
mCircle->SetCircleParameter(cPara);
MyEllipse::PixelBufferType pBufferData;
pBufferData.coef[0] = 1.0f;
pBufferData.coef[1] = 40.0f;
pBufferData.coef[2] = 0.0f;
pBufferData.coef[3] = 0.0f;
pBufferData.C = -40000.0f;
pBufferData.width = 8.0f;
pBufferData.AAMode = AA_GAUSS;
mCircle->SetPixelBufferData(pBufferData);
res = mCircle->Initialize(width, height);
if(!res)
{
MessageBox(hWnd, L"Could not initialize the circle object.", L"Error", MB_OK);
return false;
}
return true;
}
void D3DEngine::Shutdown()
{
if (mCircle)
{
mCircle->Shutdown();
delete mCircle;
mCircle = nullptr;
}
if (mCamera)
{
delete mCamera;
mCamera = nullptr;
}
if (mShader)
{
mShader->Release();
delete mShader;
mShader = nullptr;
}
if (mD3D)
{
mD3D->Shutdown();
delete mD3D;
mD3D = nullptr;
}
}
bool D3DEngine::Frame()
{
D3DXMATRIX worldMatrix, viewMatrix, orthoMatrix;
bool res(false);
mD3D->BeginScene(0.1f, 0.1f, 0.2f, 1.0f);
mCamera->Render();
mCamera->GetViewMatrix(viewMatrix);
mD3D->GetWorldMatrix(worldMatrix);
mD3D->GetOrthoMatrix(orthoMatrix);
mD3D->TurnZBufferOff();
//res = mCircle->Render(mD3D->GetDeviceContext(), 100, 100, 256, 256, mSigma, mMSAAlvl);
res = mCircle->Frame();
if (!res) return false;
res = mShader->Render(mD3D->GetDeviceContext(), mCircle->GetIndexCount(),
worldMatrix, viewMatrix, orthoMatrix, mCamera->GetScale());
if (!res) return false;
mD3D->EndScene();
return true;
}
void D3DEngine::SetAAMode(AA_MODE mode)
{
mCircle->GetPixelBufferData()->AAMode = mode;
}
AA_MODE D3DEngine::GetAAMode()const
{
return mCircle->GetPixelBufferData()->AAMode;
}
void D3DEngine::SetSigmaValue(int val)
{
float tmp = (float)2.0e-2*val;
//mCircle->GetPixelBufferData()->sigma_2 = -2.0*tmp*tmp;
}
void D3DEngine::SetThetValue(int val)
{
//mCircle->GetPixelBufferData()->thet = (float)val/100.0f+1.0f;
}
void D3DEngine::SetMSAAlvl(int val)
{
//mCircle->GetPixelBufferData()->samplelvl = val;
}
void D3DEngine::SetClipEdgeValue(int val)
{
//mCircle->GetPixelBufferData()->clipEdge = (float)val/20.0f+1.0f;
}
void D3DEngine::SetNoiseValue(float val)
{
//mCircle->GetPixelBufferData()->noise = int(val*200);
}
void D3DEngine::SetLineWidth(float val)
{
mCircle->GetPixelBufferData()->width = val;
}
void D3DEngine::SetYAxis(float val)
{
if (val < 1) mCircle->GetPixelBufferData()->coef[1] = 40000.0f;
else mCircle->GetPixelBufferData()->coef[1] = 40000.0f/val/val;
}
void D3DEngine::SetXAxis(float val)
{
if (val < 1) mCircle->GetPixelBufferData()->coef[0] = 40000.0f;
else mCircle->GetPixelBufferData()->coef[0] = 40000.0f/val/val;
} | [
"t_wangr@SHACNG210WV8D.ads.autodesk.com"
] | t_wangr@SHACNG210WV8D.ads.autodesk.com |
65494cd7a54172a3194c040bbf6f339e821ee436 | 36e79e538d25d851744597f7f76afffc13d1f3f2 | /inc/vtl/xtl/Xtl_Progress.hpp | 203d6c40e36d844e70ba8d2d067a05f3995d5c60 | [] | no_license | nagyistoce/VideoCollage | fb5cea8244e7d06b7bc19fa5661bce515ec7d725 | 60d715d4a3926040855f6e0b4b4e23663f959ac5 | refs/heads/master | 2021-01-16T06:05:03.056906 | 2014-07-03T06:20:09 | 2014-07-03T06:20:09 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,762 | hpp | #ifndef __XTL_HELPER_HPP__
#define __XTL_HELPER_HPP__
/*************************************************************************\
Oliver Liyin Copyright (c) 2003
Module Name:
Abstract:
General helper functions and classes
Notes:
Usage:
1. IProgress interface
History:
Created on 2004 June 6 by oliver_liyin
2004 Jul 19. by liyin, Merged with xtl_traits for better organization
\*************************************************************************/
#include <vector>
#include <tchar.h>
namespace xtl
{
class IProgress
{
public:
/// dtor is virtual to be inherited
virtual ~IProgress() {}
/// Set the value of current progress between min and max value
virtual void SetValue(int value, int minValue, int maxValue)
{
for(size_t k = 0; k < m_rangeMapping.size(); k ++)
{
MapRange(value, minValue, maxValue, m_rangeMapping[k]);
}
RealizeValue(value, minValue, maxValue);
}
/// Push a range mapping in stack.
/// The value and range in function SetValue function will be mapped to
/// the subRange, and then mapped to entireRange.
/// And the entireRange will be mapped to next subRange in entireRange, and so on.
virtual void PushRangeMapping(int startValue, int endValue, int minValue, int maxValue)
{
RangeMapping mapping = {startValue, endValue, minValue, maxValue};
m_rangeMapping.push_back(mapping);
}
/// Pop the last range mapping
virtual void PopRangeMapping()
{
m_rangeMapping.pop_back();
}
/// Set the title of the progress
virtual void SetMessage(const TCHAR* /*message*/)
{
/// default ignores the message
}
protected:
/// Override this function to realize the value and range on UI, or in console
virtual void RealizeValue(int value, int minValue, int maxValue) = 0;
private:
struct RangeMapping
{
int startValue, endValue, minValue, maxValue;
};
void MapRange(int& value, int& minValue, int& maxValue, const RangeMapping& mapping)
{
const int oldExpand = maxValue - minValue;
const int newExpand = mapping.endValue - mapping.startValue;
value = mapping.startValue + (value - minValue) * newExpand / oldExpand;
minValue = mapping.minValue;
maxValue = mapping.maxValue;
}
std::vector<RangeMapping> m_rangeMapping;
};
} // namespace xtl
#endif//__XTL_HELPER_HPP__
| [
"junx1992@gmail.com"
] | junx1992@gmail.com |
112585c0e28bf2efa7ff0a7f06e0e569c6b856c5 | 410e45283cf691f932b07c5fdf18d8d8ac9b57c3 | /ui/compositor/host/host_context_factory_private.cc | f8b1e4b8c64809bf3b151f0578e3bfe6f5b2d6b6 | [
"BSD-3-Clause"
] | permissive | yanhuashengdian/chrome_browser | f52a7f533a6b8417e19b85f765f43ea63307a1fb | 972d284a9ffa4b794f659f5acc4116087704394c | refs/heads/master | 2022-12-21T03:43:07.108853 | 2019-04-29T14:20:05 | 2019-04-29T14:20:05 | 184,068,841 | 0 | 2 | BSD-3-Clause | 2022-12-17T17:35:55 | 2019-04-29T12:40:27 | null | UTF-8 | C++ | false | false | 11,637 | cc | // Copyright 2018 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 "ui/compositor/host/host_context_factory_private.h"
#include "base/command_line.h"
#include "base/trace_event/trace_event.h"
#include "build/build_config.h"
#include "cc/mojo_embedder/async_layer_tree_frame_sink.h"
#include "components/viz/client/hit_test_data_provider_draw_quad.h"
#include "components/viz/client/local_surface_id_provider.h"
#include "components/viz/common/features.h"
#include "components/viz/common/switches.h"
#include "components/viz/host/host_display_client.h"
#include "components/viz/host/host_frame_sink_manager.h"
#include "components/viz/host/renderer_settings_creation.h"
#include "services/viz/privileged/interfaces/compositing/frame_sink_manager.mojom.h"
#include "services/viz/privileged/interfaces/compositing/vsync_parameter_observer.mojom.h"
#include "services/viz/public/interfaces/compositing/compositor_frame_sink.mojom.h"
#include "ui/compositor/host/external_begin_frame_controller_client_impl.h"
#include "ui/compositor/reflector.h"
#if defined(OS_WIN)
#include "ui/gfx/win/rendering_window_manager.h"
#endif
namespace ui {
namespace {
static const char* kBrowser = "Browser";
} // namespace
HostContextFactoryPrivate::HostContextFactoryPrivate(
uint32_t client_id,
viz::HostFrameSinkManager* host_frame_sink_manager,
scoped_refptr<base::SingleThreadTaskRunner> resize_task_runner)
: frame_sink_id_allocator_(client_id),
host_frame_sink_manager_(host_frame_sink_manager),
resize_task_runner_(std::move(resize_task_runner)) {
DCHECK(host_frame_sink_manager_);
}
HostContextFactoryPrivate::~HostContextFactoryPrivate() = default;
void HostContextFactoryPrivate::AddCompositor(Compositor* compositor) {
compositor_data_map_.try_emplace(compositor);
}
void HostContextFactoryPrivate::ConfigureCompositor(
Compositor* compositor,
scoped_refptr<viz::ContextProvider> context_provider,
scoped_refptr<viz::RasterContextProvider> worker_context_provider) {
bool gpu_compositing =
!is_gpu_compositing_disabled_ && !compositor->force_software_compositor();
#if defined(OS_WIN)
gfx::RenderingWindowManager::GetInstance()->RegisterParent(
compositor->widget());
#endif
auto& compositor_data = compositor_data_map_[compositor];
auto root_params = viz::mojom::RootCompositorFrameSinkParams::New();
// Create interfaces for a root CompositorFrameSink.
viz::mojom::CompositorFrameSinkAssociatedPtrInfo sink_info;
root_params->compositor_frame_sink = mojo::MakeRequest(&sink_info);
viz::mojom::CompositorFrameSinkClientRequest client_request =
mojo::MakeRequest(&root_params->compositor_frame_sink_client);
root_params->display_private =
mojo::MakeRequest(&compositor_data.display_private);
compositor_data.display_client =
std::make_unique<viz::HostDisplayClient>(compositor->widget());
root_params->display_client =
compositor_data.display_client->GetBoundPtr(resize_task_runner_)
.PassInterface();
// Initialize ExternalBeginFrameController client if enabled.
compositor_data.external_begin_frame_controller_client.reset();
if (compositor->external_begin_frame_client()) {
compositor_data.external_begin_frame_controller_client =
std::make_unique<ExternalBeginFrameControllerClientImpl>(
compositor->external_begin_frame_client());
root_params->external_begin_frame_controller =
compositor_data.external_begin_frame_controller_client
->GetControllerRequest();
root_params->external_begin_frame_controller_client =
compositor_data.external_begin_frame_controller_client->GetBoundPtr()
.PassInterface();
}
root_params->frame_sink_id = compositor->frame_sink_id();
#if defined(GPU_SURFACE_HANDLE_IS_ACCELERATED_WINDOW)
root_params->widget = compositor->widget();
#endif
root_params->gpu_compositing = gpu_compositing;
root_params->renderer_settings = viz::CreateRendererSettings();
base::CommandLine* command_line = base::CommandLine::ForCurrentProcess();
if (command_line->HasSwitch(switches::kDisableFrameRateLimit))
root_params->disable_frame_rate_limit = true;
// Connects the viz process end of CompositorFrameSink message pipes. The
// browser compositor may request a new CompositorFrameSink on context loss,
// which will destroy the existing CompositorFrameSink.
GetHostFrameSinkManager()->CreateRootCompositorFrameSink(
std::move(root_params));
compositor_data.display_private->Resize(compositor->size());
compositor_data.display_private->SetOutputIsSecure(
compositor_data.output_is_secure);
// Create LayerTreeFrameSink with the browser end of CompositorFrameSink.
cc::mojo_embedder::AsyncLayerTreeFrameSink::InitParams params;
params.compositor_task_runner = compositor->task_runner();
params.gpu_memory_buffer_manager =
compositor->context_factory()->GetGpuMemoryBufferManager();
params.pipes.compositor_frame_sink_associated_info = std::move(sink_info);
params.pipes.client_request = std::move(client_request);
params.enable_surface_synchronization = true;
if (features::IsVizHitTestingDrawQuadEnabled()) {
params.hit_test_data_provider =
std::make_unique<viz::HitTestDataProviderDrawQuad>(
false /* should_ask_for_child_region */,
true /* root_accepts_events */);
}
params.client_name = kBrowser;
compositor->SetLayerTreeFrameSink(
std::make_unique<cc::mojo_embedder::AsyncLayerTreeFrameSink>(
std::move(context_provider), std::move(worker_context_provider),
¶ms));
}
void HostContextFactoryPrivate::UnconfigureCompositor(Compositor* compositor) {
#if defined(OS_WIN)
gfx::RenderingWindowManager::GetInstance()->UnregisterParent(
compositor->widget());
#endif
compositor_data_map_.erase(compositor);
}
base::flat_set<Compositor*> HostContextFactoryPrivate::GetAllCompositors() {
base::flat_set<Compositor*> all_compositors;
all_compositors.reserve(compositor_data_map_.size());
for (auto& pair : compositor_data_map_)
all_compositors.insert(pair.first);
return all_compositors;
}
std::unique_ptr<Reflector> HostContextFactoryPrivate::CreateReflector(
Compositor* source,
Layer* target) {
// TODO(crbug.com/601869): Reflector needs to be rewritten for viz.
NOTIMPLEMENTED();
return nullptr;
}
void HostContextFactoryPrivate::RemoveReflector(Reflector* reflector) {
// TODO(crbug.com/601869): Reflector needs to be rewritten for viz.
NOTIMPLEMENTED();
}
viz::FrameSinkId HostContextFactoryPrivate::AllocateFrameSinkId() {
return frame_sink_id_allocator_.NextFrameSinkId();
}
viz::HostFrameSinkManager*
HostContextFactoryPrivate::GetHostFrameSinkManager() {
return host_frame_sink_manager_;
}
void HostContextFactoryPrivate::SetDisplayVisible(Compositor* compositor,
bool visible) {
auto iter = compositor_data_map_.find(compositor);
if (iter == compositor_data_map_.end() || !iter->second.display_private)
return;
iter->second.display_private->SetDisplayVisible(visible);
}
void HostContextFactoryPrivate::ResizeDisplay(Compositor* compositor,
const gfx::Size& size) {
auto iter = compositor_data_map_.find(compositor);
if (iter == compositor_data_map_.end() || !iter->second.display_private)
return;
iter->second.display_private->Resize(size);
}
void HostContextFactoryPrivate::DisableSwapUntilResize(Compositor* compositor) {
auto iter = compositor_data_map_.find(compositor);
if (iter == compositor_data_map_.end() || !iter->second.display_private)
return;
{
// Browser needs to block for Viz to receive and process this message.
// Otherwise when we return from WM_WINDOWPOSCHANGING message handler and
// receive a WM_WINDOWPOSCHANGED the resize is finalized and any swaps of
// wrong size by Viz can cause the swapped content to get scaled.
// TODO(crbug.com/859168): Investigate nonblocking ways for solving.
TRACE_EVENT0("viz", "Blocked UI for DisableSwapUntilResize");
mojo::SyncCallRestrictions::ScopedAllowSyncCall scoped_allow_sync_call;
iter->second.display_private->DisableSwapUntilResize();
}
}
void HostContextFactoryPrivate::SetDisplayColorMatrix(
Compositor* compositor,
const SkMatrix44& matrix) {
auto iter = compositor_data_map_.find(compositor);
if (iter == compositor_data_map_.end() || !iter->second.display_private)
return;
iter->second.display_private->SetDisplayColorMatrix(gfx::Transform(matrix));
}
void HostContextFactoryPrivate::SetDisplayColorSpace(
Compositor* compositor,
const gfx::ColorSpace& blending_color_space,
const gfx::ColorSpace& output_color_space) {
auto iter = compositor_data_map_.find(compositor);
if (iter == compositor_data_map_.end() || !iter->second.display_private)
return;
iter->second.display_private->SetDisplayColorSpace(blending_color_space,
output_color_space);
}
void HostContextFactoryPrivate::SetDisplayVSyncParameters(
Compositor* compositor,
base::TimeTicks timebase,
base::TimeDelta interval) {
auto iter = compositor_data_map_.find(compositor);
if (iter == compositor_data_map_.end() || !iter->second.display_private)
return;
iter->second.display_private->SetDisplayVSyncParameters(timebase, interval);
}
void HostContextFactoryPrivate::IssueExternalBeginFrame(
Compositor* compositor,
const viz::BeginFrameArgs& args) {
auto iter = compositor_data_map_.find(compositor);
if (iter == compositor_data_map_.end() || !iter->second.display_private)
return;
DCHECK(iter->second.external_begin_frame_controller_client);
iter->second.external_begin_frame_controller_client->GetController()
->IssueExternalBeginFrame(args);
}
void HostContextFactoryPrivate::SetOutputIsSecure(Compositor* compositor,
bool secure) {
auto iter = compositor_data_map_.find(compositor);
if (iter == compositor_data_map_.end())
return;
iter->second.output_is_secure = secure;
if (iter->second.display_private)
iter->second.display_private->SetOutputIsSecure(secure);
}
void HostContextFactoryPrivate::AddVSyncParameterObserver(
Compositor* compositor,
viz::mojom::VSyncParameterObserverPtr observer) {
auto iter = compositor_data_map_.find(compositor);
if (iter == compositor_data_map_.end())
return;
if (iter->second.display_private) {
iter->second.display_private->AddVSyncParameterObserver(
std::move(observer));
}
}
viz::FrameSinkManagerImpl* HostContextFactoryPrivate::GetFrameSinkManager() {
// When running with viz there is no FrameSinkManagerImpl in the browser
// process. FrameSinkManagerImpl runs in the GPU process instead. Anything in
// the browser process that relies FrameSinkManagerImpl or SurfaceManager
// internal state needs to change. See https://crbug.com/787097 and
// https://crbug.com/760181 for more context.
NOTREACHED();
return nullptr;
}
HostContextFactoryPrivate::CompositorData::CompositorData() = default;
HostContextFactoryPrivate::CompositorData::CompositorData(
CompositorData&& other) = default;
HostContextFactoryPrivate::CompositorData::~CompositorData() = default;
HostContextFactoryPrivate::CompositorData&
HostContextFactoryPrivate::CompositorData::operator=(CompositorData&& other) =
default;
} // namespace ui
| [
"279687673@qq.com"
] | 279687673@qq.com |
713d89c733d45ec1ea501179e5554e03a3f91604 | 71873fbecd1786d3f1eeb94c04a46c3a8b0afd71 | /cycle1/experiment2/filemanipulation.cpp | 2a8db6bdbf25d573dc379e1b48438c0b054460f4 | [] | no_license | abhishek-sankar/NetworkingLab | 1580b444e7510f9be63b12e96bfe4440a7c3df7f | 0c4693f3cb03cf11b7bf7fb74ff54babdd91af57 | refs/heads/master | 2022-01-11T17:46:47.661133 | 2019-06-27T16:31:04 | 2019-06-27T16:31:04 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 543 | cpp | #include<iostream>
#include<fstream>
using namespace std;
int main(){
ifstream in;
in.open("helloworld.txt");
if(in == NULL){
cout<<"Error opening file";
return 1;
}
ofstream out;
out.open("byeworld.txt");
string line;
if(out == NULL){
cout<<"Error opening file ";
return 1;
}
while(in){
cout<<"Writing to byeworld.txt ... \n";
getline(in,line);
out<<line;
}
cout<<"Writing finished...\n";
out.close();
in.close();
return 0;
} | [
"bilaljaleel123@gmail.com"
] | bilaljaleel123@gmail.com |
9eee432b15f6b6fdbcc959d344acb747d6f53b3d | 6d54a7b26d0eb82152a549a6a9dfde656687752c | /src/platform/Darwin/DnssdHostNameRegistrar.cpp | 287bc0bec3380f625427c981f745a096d0291d10 | [
"Apache-2.0",
"LicenseRef-scancode-warranty-disclaimer"
] | permissive | project-chip/connectedhomeip | 81a123d675cf527773f70047d1ed1c43be5ffe6d | ea3970a7f11cd227ac55917edaa835a2a9bc4fc8 | refs/heads/master | 2023-09-01T11:43:37.546040 | 2023-09-01T08:01:32 | 2023-09-01T08:01:32 | 244,694,174 | 6,409 | 1,789 | Apache-2.0 | 2023-09-14T20:56:31 | 2020-03-03T17:05:10 | C++ | UTF-8 | C++ | false | false | 14,409 | cpp | /*
*
* Copyright (c) 2022 Project CHIP Authors
*
* 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 "DnssdHostNameRegistrar.h"
#include "DnssdImpl.h"
#include "MdnsError.h"
#include <arpa/inet.h>
#include <ifaddrs.h>
#include <net/ethernet.h>
#include <net/if_dl.h>
#include <netdb.h>
#include <set>
#include <platform/CHIPDeviceLayer.h>
constexpr DNSServiceFlags kRegisterRecordFlags = kDNSServiceFlagsShared;
namespace chip {
namespace Dnssd {
namespace {
#if CHIP_PROGRESS_LOGGING
constexpr const char * kPathStatusInvalid = "Invalid";
constexpr const char * kPathStatusUnsatisfied = "Unsatisfied";
constexpr const char * kPathStatusSatisfied = "Satisfied";
constexpr const char * kPathStatusSatisfiable = "Satisfiable";
constexpr const char * kPathStatusUnknown = "Unknown";
constexpr const char * kInterfaceTypeCellular = "Cellular";
constexpr const char * kInterfaceTypeWiFi = "WiFi";
constexpr const char * kInterfaceTypeWired = "Wired";
constexpr const char * kInterfaceTypeLoopback = "Loopback";
constexpr const char * kInterfaceTypeOther = "Other";
constexpr const char * kInterfaceTypeUnknown = "Unknown";
const char * GetPathStatusString(nw_path_status_t status)
{
const char * str = nullptr;
if (status == nw_path_status_invalid)
{
str = kPathStatusInvalid;
}
else if (status == nw_path_status_unsatisfied)
{
str = kPathStatusUnsatisfied;
}
else if (status == nw_path_status_satisfied)
{
str = kPathStatusSatisfied;
}
else if (status == nw_path_status_satisfiable)
{
str = kPathStatusSatisfiable;
}
else
{
str = kPathStatusUnknown;
}
return str;
}
const char * GetInterfaceTypeString(nw_interface_type_t type)
{
const char * str = nullptr;
if (type == nw_interface_type_cellular)
{
str = kInterfaceTypeCellular;
}
else if (type == nw_interface_type_wifi)
{
str = kInterfaceTypeWiFi;
}
else if (type == nw_interface_type_wired)
{
str = kInterfaceTypeWired;
}
else if (type == nw_interface_type_loopback)
{
str = kInterfaceTypeLoopback;
}
else if (type == nw_interface_type_other)
{
str = kInterfaceTypeOther;
}
else
{
str = kInterfaceTypeUnknown;
}
return str;
}
void LogDetails(uint32_t interfaceId, InetInterfacesVector inetInterfaces, Inet6InterfacesVector inet6Interfaces)
{
for (auto & inetInterface : inetInterfaces)
{
if (interfaceId == inetInterface.first)
{
char addr[INET_ADDRSTRLEN] = {};
inet_ntop(AF_INET, &inetInterface.second, addr, sizeof(addr));
ChipLogProgress(Discovery, "\t\t* ipv4: %s", addr);
}
}
for (auto & inet6Interface : inet6Interfaces)
{
if (interfaceId == inet6Interface.first)
{
char addr[INET6_ADDRSTRLEN] = {};
inet_ntop(AF_INET6, &inet6Interface.second, addr, sizeof(addr));
ChipLogProgress(Discovery, "\t\t* ipv6: %s", addr);
}
}
}
void LogDetails(nw_path_t path)
{
auto status = nw_path_get_status(path);
ChipLogProgress(Discovery, "Status: %s", GetPathStatusString(status));
}
void LogDetails(InetInterfacesVector inetInterfaces, Inet6InterfacesVector inet6Interfaces)
{
std::set<uint32_t> interfaceIds;
for (auto & inetInterface : inetInterfaces)
{
interfaceIds.insert(inetInterface.first);
}
for (auto & inet6Interface : inet6Interfaces)
{
interfaceIds.insert(inet6Interface.first);
}
for (auto interfaceId : interfaceIds)
{
char interfaceName[IFNAMSIZ] = {};
if_indextoname(interfaceId, interfaceName);
ChipLogProgress(Discovery, "\t%s (%u)", interfaceName, interfaceId);
LogDetails(interfaceId, inetInterfaces, inet6Interfaces);
}
}
void LogDetails(nw_interface_t interface, InetInterfacesVector inetInterfaces, Inet6InterfacesVector inet6Interfaces)
{
auto interfaceId = nw_interface_get_index(interface);
auto interfaceName = nw_interface_get_name(interface);
auto interfaceType = nw_interface_get_type(interface);
ChipLogProgress(Discovery, "\t%s (%u / %s)", interfaceName, interfaceId, GetInterfaceTypeString(interfaceType));
LogDetails(interfaceId, inetInterfaces, inet6Interfaces);
}
#endif // CHIP_PROGRESS_LOGGING
bool HasValidFlags(unsigned int flags, bool allowLoopbackOnly)
{
VerifyOrReturnValue(!allowLoopbackOnly || (flags & IFF_LOOPBACK), false);
VerifyOrReturnValue((flags & IFF_RUNNING), false);
VerifyOrReturnValue((flags & IFF_MULTICAST), false);
return true;
}
bool HasValidNetworkType(nw_interface_t interface)
{
auto interfaceType = nw_interface_get_type(interface);
return interfaceType == nw_interface_type_wifi || interfaceType == nw_interface_type_wired ||
interfaceType == nw_interface_type_other;
}
bool IsValidInterfaceId(uint32_t targetInterfaceId, nw_interface_t interface)
{
auto currentInterfaceId = nw_interface_get_index(interface);
return targetInterfaceId == kDNSServiceInterfaceIndexAny || targetInterfaceId == currentInterfaceId;
}
void ShouldUseVersion(chip::Inet::IPAddressType addressType, bool & shouldUseIPv4, bool & shouldUseIPv6)
{
#if INET_CONFIG_ENABLE_IPV4
shouldUseIPv4 = addressType == Inet::IPAddressType::kIPv4 || addressType == Inet::IPAddressType::kAny;
#else
shouldUseIPv4 = false;
#endif // INET_CONFIG_ENABLE_IPV4
shouldUseIPv6 = addressType == Inet::IPAddressType::kIPv6 || addressType == Inet::IPAddressType::kAny;
}
static void OnRegisterRecord(DNSServiceRef sdRef, DNSRecordRef recordRef, DNSServiceFlags flags, DNSServiceErrorType err,
void * context)
{
ChipLogProgress(Discovery, "Mdns: %s flags: %d", __func__, flags);
if (kDNSServiceErr_NoError != err)
{
ChipLogError(Discovery, "%s (%s)", __func__, Error::ToString(err));
}
}
void GetInterfaceAddresses(uint32_t interfaceId, chip::Inet::IPAddressType addressType, InetInterfacesVector & inetInterfaces,
Inet6InterfacesVector & inet6Interfaces, bool searchLoopbackOnly = false)
{
bool shouldUseIPv4, shouldUseIPv6;
ShouldUseVersion(addressType, shouldUseIPv4, shouldUseIPv6);
ifaddrs * ifap;
VerifyOrReturn(getifaddrs(&ifap) >= 0);
for (struct ifaddrs * ifa = ifap; ifa != nullptr; ifa = ifa->ifa_next)
{
auto interfaceAddress = ifa->ifa_addr;
if (interfaceAddress == nullptr)
{
continue;
}
if (!HasValidFlags(ifa->ifa_flags, searchLoopbackOnly))
{
continue;
}
auto currentInterfaceId = if_nametoindex(ifa->ifa_name);
if (interfaceId != kDNSServiceInterfaceIndexAny && interfaceId != currentInterfaceId)
{
continue;
}
if (shouldUseIPv4 && (AF_INET == interfaceAddress->sa_family))
{
auto inetAddress = reinterpret_cast<struct sockaddr_in *>(interfaceAddress)->sin_addr;
inetInterfaces.push_back(InetInterface(currentInterfaceId, inetAddress));
}
else if (shouldUseIPv6 && (AF_INET6 == interfaceAddress->sa_family))
{
auto inet6Address = reinterpret_cast<struct sockaddr_in6 *>(interfaceAddress)->sin6_addr;
inet6Interfaces.push_back(Inet6Interface(currentInterfaceId, inet6Address));
}
}
freeifaddrs(ifap);
}
} // namespace
HostNameRegistrar::~HostNameRegistrar()
{
Unregister();
if (mLivenessTracker != nullptr)
{
*mLivenessTracker = false;
}
}
DNSServiceErrorType HostNameRegistrar::Init(const char * hostname, Inet::IPAddressType addressType, uint32_t interfaceId)
{
mHostname = hostname;
mInterfaceId = interfaceId;
mAddressType = addressType;
mServiceRef = nullptr;
mInterfaceMonitor = nullptr;
mLivenessTracker = std::make_shared<bool>(true);
if (mLivenessTracker == nullptr)
{
return kDNSServiceErr_NoMemory;
}
return kDNSServiceErr_NoError;
}
CHIP_ERROR HostNameRegistrar::Register()
{
// If the target interface is kDNSServiceInterfaceIndexLocalOnly, just
// register the loopback addresses.
if (IsLocalOnly())
{
ReturnErrorOnFailure(ResetSharedConnection());
InetInterfacesVector inetInterfaces;
Inet6InterfacesVector inet6Interfaces;
// Instead of mInterfaceId (which will not match any actual interface),
// use kDNSServiceInterfaceIndexAny and restrict to loopback interfaces.
GetInterfaceAddresses(kDNSServiceInterfaceIndexAny, mAddressType, inetInterfaces, inet6Interfaces,
true /* searchLoopbackOnly */);
// But we register the IPs with mInterfaceId, not the actual interface
// IDs, so that resolution code that is grouping addresses by interface
// ends up doing the right thing, since we registered our SRV record on
// mInterfaceId.
//
// And only register the IPv6 ones, for simplicity.
for (auto & interface : inet6Interfaces)
{
ReturnErrorOnFailure(RegisterInterface(mInterfaceId, interface.second, kDNSServiceType_AAAA));
}
return CHIP_NO_ERROR;
}
return StartMonitorInterfaces(^(InetInterfacesVector inetInterfaces, Inet6InterfacesVector inet6Interfaces) {
ReturnOnFailure(ResetSharedConnection());
RegisterInterfaces(inetInterfaces, kDNSServiceType_A);
RegisterInterfaces(inet6Interfaces, kDNSServiceType_AAAA);
});
}
CHIP_ERROR HostNameRegistrar::RegisterInterface(uint32_t interfaceId, uint16_t rtype, const void * rdata, uint16_t rdlen)
{
DNSRecordRef dnsRecordRef;
auto err = DNSServiceRegisterRecord(mServiceRef, &dnsRecordRef, kRegisterRecordFlags, interfaceId, mHostname.c_str(), rtype,
kDNSServiceClass_IN, rdlen, rdata, 0, OnRegisterRecord, nullptr);
return Error::ToChipError(err);
}
void HostNameRegistrar::Unregister()
{
if (!IsLocalOnly())
{
StopMonitorInterfaces();
}
StopSharedConnection();
}
CHIP_ERROR HostNameRegistrar::StartMonitorInterfaces(OnInterfaceChanges interfaceChangesBlock)
{
mInterfaceMonitor = nw_path_monitor_create();
VerifyOrReturnError(mInterfaceMonitor != nullptr, CHIP_ERROR_NO_MEMORY);
nw_path_monitor_set_queue(mInterfaceMonitor, chip::DeviceLayer::PlatformMgrImpl().GetWorkQueue());
// Our update handler closes over "this", but can't keep us alive (because we
// are not refcounted). Make sure it closes over a shared ref to our
// liveness tracker, which it _can_ keep alive, so it can bail out if we
// have been destroyed between when the task was queued and when it ran.
std::shared_ptr<bool> livenessTracker = mLivenessTracker;
nw_path_monitor_set_update_handler(mInterfaceMonitor, ^(nw_path_t path) {
if (!*livenessTracker)
{
// The HostNameRegistrar has been destroyed; just bail out.
return;
}
#if CHIP_PROGRESS_LOGGING
LogDetails(path);
#endif // CHIP_PROGRESS_LOGGING
__block InetInterfacesVector inet;
__block Inet6InterfacesVector inet6;
// The loopback interfaces needs to be manually added. While lo0 is usually 1, this is not guaranteed. So search for a
// loopback interface with the specified interface id. If the specified interface id is kDNSServiceInterfaceIndexAny, it
// will look for all available loopback interfaces.
GetInterfaceAddresses(mInterfaceId, mAddressType, inet, inet6, true /* searchLoopbackOnly */);
#if CHIP_PROGRESS_LOGGING
LogDetails(inet, inet6);
#endif // CHIP_PROGRESS_LOGGING
auto status = nw_path_get_status(path);
if (status == nw_path_status_satisfied)
{
nw_path_enumerate_interfaces(path, ^(nw_interface_t interface) {
VerifyOrReturnValue(HasValidNetworkType(interface), true);
VerifyOrReturnValue(IsValidInterfaceId(mInterfaceId, interface), true);
auto targetInterfaceId = nw_interface_get_index(interface);
GetInterfaceAddresses(targetInterfaceId, mAddressType, inet, inet6);
#if CHIP_PROGRESS_LOGGING
LogDetails(interface, inet, inet6);
#endif // CHIP_PROGRESS_LOGGING
return true;
});
}
interfaceChangesBlock(inet, inet6);
});
nw_path_monitor_start(mInterfaceMonitor);
return CHIP_NO_ERROR;
}
void HostNameRegistrar::StopMonitorInterfaces()
{
if (mInterfaceMonitor != nullptr)
{
nw_path_monitor_cancel(mInterfaceMonitor);
nw_release(mInterfaceMonitor);
mInterfaceMonitor = nullptr;
}
}
CHIP_ERROR HostNameRegistrar::StartSharedConnection()
{
VerifyOrReturnError(mServiceRef == nullptr, CHIP_ERROR_INCORRECT_STATE);
auto err = DNSServiceCreateConnection(&mServiceRef);
VerifyOrReturnValue(kDNSServiceErr_NoError == err, Error::ToChipError(err));
err = DNSServiceSetDispatchQueue(mServiceRef, chip::DeviceLayer::PlatformMgrImpl().GetWorkQueue());
if (kDNSServiceErr_NoError != err)
{
StopSharedConnection();
}
return Error::ToChipError(err);
}
void HostNameRegistrar::StopSharedConnection()
{
if (mServiceRef != nullptr)
{
// All the DNSRecordRefs registered to the shared DNSServiceRef will be deallocated.
DNSServiceRefDeallocate(mServiceRef);
mServiceRef = nullptr;
}
}
CHIP_ERROR HostNameRegistrar::ResetSharedConnection()
{
StopSharedConnection();
ReturnLogErrorOnFailure(StartSharedConnection());
return CHIP_NO_ERROR;
}
} // namespace Dnssd
} // namespace chip
| [
"noreply@github.com"
] | project-chip.noreply@github.com |
dab2b3b60cee9b2eba8fa2c5f8615b9abbaa1ae8 | 8f2d8e1e85e2962721e32093fbb4deaf3e318e3f | /SDK/PUBG_MasteryPoseScene_structs.hpp | a6f8677f90203e935008bd8cfe0f2d56a16c74b4 | [] | no_license | besimbicer89/PUBG-SDK | f8878bea83bb1e560e3ae3d026e9245ab7d5a360 | bdb95dfd6176ec54f8df1653968c7bfbea90150d | refs/heads/master | 2022-04-17T01:47:26.574416 | 2020-04-09T10:42:19 | 2020-04-09T10:42:19 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,672 | hpp | #pragma once
// PUBG (7.2.8.10) SDK
#ifdef _MSC_VER
#pragma pack(push, 0x8)
#endif
#include "PUBG_Basic.hpp"
#include "PUBG_CoreUObject_classes.hpp"
namespace SDK
{
//---------------------------------------------------------------------------
//Script Structs
//---------------------------------------------------------------------------
// UserDefinedStruct MasteryPoseScene.MasteryPoseScene
// 0x0090
struct FMasteryPoseScene
{
class UAnimSequence* PlayerPose_14_680F16F24620F93F5BE08482E4B331B7; // 0x0000(0x0008) (Edit, BlueprintVisible, ZeroConstructor, IsPlainOldData)
unsigned char UnknownData00[0x8]; // 0x0008(0x0008) MISSED OFFSET
struct FTransform SurvivalPageTransform_28_E1AEFE1A4C1AF0311D9296932584D6CD;// 0x0010(0x0030) (Edit, BlueprintVisible, IsPlainOldData)
struct FString SurvivalPageScene_32_2ABD8C7C4E1D741795EAF682098530DC; // 0x0040(0x0010) (Edit, BlueprintVisible, ZeroConstructor)
class UClass* PoseAsset_39_39BCBF6D4675AACDF881B18FB8699A6A; // 0x0050(0x0008) (Edit, BlueprintVisible, ZeroConstructor, DisableEditOnTemplate, IsPlainOldData)
unsigned char UnknownData01[0x8]; // 0x0058(0x0008) MISSED OFFSET
struct FTransform PlayerCardTransform_29_2E4AAD5846444AF931B52F8BEF3C7786; // 0x0060(0x0030) (Edit, BlueprintVisible, IsPlainOldData)
};
}
#ifdef _MSC_VER
#pragma pack(pop)
#endif
| [
"1263178881@qq.com"
] | 1263178881@qq.com |
483901516e4aa989184ca0d7238b0321995981fd | 57a7d082c3553fdd592eedbdaede23495b5c5644 | /MyPoker/proj.ios_mac/Common/RoomConfig.cpp | 410d4099acc9c0c4a0bc5e2a6f7eb8f2988b8220 | [] | no_license | cnceo/NewProject | f18ed4edaa33ba7dde129dd8ce51648cc509c58e | f87d4cd3702cb567a0c282043c42cf4a2b4f637f | refs/heads/master | 2020-03-28T23:04:06.802755 | 2017-04-13T08:25:34 | 2017-04-13T08:25:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 4,947 | cpp | #include "RoomConfig.h"
#include "CommonDefine.h"
#include "LogManager.h"
#include <assert.h>
void stSpeedRoomConfigs::AddConfig(stTaxasRoomConfig* pConfig)
{
VEC_BLIND_ROOM_CONFIG* pVec ;
if ( pConfig->nMaxSeat == 5 )
{
pVec = &m_vPlayerCountRoom[eSeatCount_5] ;
}
else
{
pVec = &m_vPlayerCountRoom[eSeatCount_9];
}
for ( int i = 0; i < pVec->size(); ++i )
{
if ( pConfig->nBigBlind == (*pVec)[i]->nBigBlind )
{
return ;
}
}
pVec->push_back(pConfig) ;
}
void stSpeedRoomConfigs::Reset()
{
for ( int i = 0 ; i < eSeatCount_Max ; ++i )
{
m_vPlayerCountRoom[i].clear();
}
}
bool CRoomConfigMgr::OnPaser(CReaderRow& refReaderRow )
{
unsigned char cType = refReaderRow["GameType"]->IntValue() ;
stBaseRoomConfig* pRoomConfig = NULL ;
switch ( cType )
{
case eRoom_TexasPoker:
case eRoom_TexasPoker_Diamoned:
{
stTaxasRoomConfig* pConfig = new stTaxasRoomConfig ;
pConfig->nBigBlind = refReaderRow["BigBlind"]->IntValue();
pConfig->nMaxTakeInCoin = refReaderRow["MaxCoin"]->IntValue() ;
pRoomConfig = pConfig ;
}
break;
case eRoom_Gold:
{
stGoldenRoomConfig* pConfig = new stGoldenRoomConfig ;
pConfig->bCanDoublePK = refReaderRow["CanDoublePK"]->IntValue();
pConfig->nChangeCardRound = refReaderRow["ChangeCardRound"]->IntValue();
pConfig->nMiniBet = refReaderRow["MiniBet"]->IntValue();
pConfig->nTitleNeedToEnter = refReaderRow["TitleNeedToEnter"]->IntValue();
#ifndef GAME_SERVER
char pBuffer[256] = {0};
for ( int i = 0 ; i < GOLDEN_ROOM_COIN_LEVEL_CNT ; ++i )
{
memset(pBuffer,0,sizeof(pBuffer));
sprintf(pBuffer,"CoinLevel%d",i);
pConfig->vCoinLevels[i] = refReaderRow[pBuffer]->IntValue();
}
#endif
pRoomConfig = pConfig ;
}
//case eRoom_Baccarat:
//case eRoom_PaiJiu:
// {
// stPaiJiurRoomConfig* pConfig = new stPaiJiurRoomConfig ;
// pConfig->nBankerNeedCoin = refReaderRow["BankerNeedCoin"]->IntValue();
// pRoomConfig = pConfig ;
// }
// break;
default:
CLogMgr::SharedLogMgr()->ErrorLog( "unknown room config ,room type = %d",cType ) ;
return false;
}
pRoomConfig->nRoomType = cType ;
pRoomConfig->nMaxSeat = refReaderRow["MaxSeat"]->IntValue();
pRoomConfig->nMinNeedToEnter = refReaderRow["MiniCoin"]->IntValue();
pRoomConfig->nRoomLevel = refReaderRow["RoomLevel"]->IntValue() ;
pRoomConfig->nRoomID = refReaderRow["RoomID"]->IntValue();
pRoomConfig->nWaitOperateTime = refReaderRow["OperateTime"]->IntValue();
pRoomConfig->nCreateCount = refReaderRow["CreateCount"]->IntValue();
m_vAllConfig.push_back(pRoomConfig) ;
return true ;
}
stBaseRoomConfig* CRoomConfigMgr::GetRoomConfig(unsigned int nRoomID )
{
LIST_ROOM_CONFIG::iterator iter = m_vAllConfig.begin();
for ( ; iter != m_vAllConfig.end() ; ++iter )
{
stBaseRoomConfig* pRoom = *iter ;
if ( nRoomID == pRoom->nRoomID )
{
return pRoom ;
}
}
return NULL ;
}
stBaseRoomConfig* CRoomConfigMgr::GetRoomConfig( char cRoomType , char cRoomLevel )
{
LIST_ROOM_CONFIG::iterator iter = m_vAllConfig.begin();
for ( ; iter != m_vAllConfig.end() ; ++iter )
{
stBaseRoomConfig* pRoom = *iter ;
if ( cRoomType == pRoom->nRoomType && cRoomLevel == pRoom->nRoomLevel )
{
return pRoom ;
}
}
return NULL ;
}
void CRoomConfigMgr::Clear()
{
LIST_ROOM_CONFIG::iterator iter = m_vAllConfig.begin();
for ( ; iter != m_vAllConfig.end() ; ++iter )
{
delete *iter ;
*iter = NULL ;
}
m_vAllConfig.clear() ;
}
void CRoomConfigMgr::OnFinishPaseFile()
{
IConfigFile::OnFinishPaseFile();
// clear
for ( int i = 0 ; i < eSpeed_Max ; ++i )
{
m_vSpeedRoomConfig[i].Reset();
}
LIST_ITER iter = m_vAllConfig.begin();
for ( ; iter != m_vAllConfig.end(); ++iter )
{
stTaxasRoomConfig* pConfig = (stTaxasRoomConfig*)(*iter);
if ( pConfig->nWaitOperateTime >= TIME_LOW_LIMIT_FOR_NORMAL_ROOM )
{
m_vSpeedRoomConfig[eSpeed_Normal].AddConfig(pConfig);
}
else
{
m_vSpeedRoomConfig[eSpeed_Quick].AddConfig(pConfig);
}
}
}
int CRoomConfigMgr::GetConfigCnt(eSpeed speed , eRoomSeat eSeatCn )
{
if ( speed < 0 || speed >= eSpeed_Max )
{
return 0 ;
}
return m_vSpeedRoomConfig[speed].m_vPlayerCountRoom[eSeatCn].size() ;
}
stTaxasRoomConfig* CRoomConfigMgr::GetConfig( eSpeed speed , eRoomSeat eSeatCn , unsigned int nIdx )
{
VEC_BLIND_ROOM_CONFIG& vConfigs = m_vSpeedRoomConfig[speed].m_vPlayerCountRoom[eSeatCn];
if ( vConfigs.size() <= nIdx )
{
return NULL ;
}
return vConfigs[nIdx] ;
}
stGoldenRoomConfig* CRoomConfigMgr::GetGoldenConfig(unsigned short cLevel )
{
LIST_ROOM_CONFIG::iterator iter = m_vAllConfig.begin() ;
for ( ; iter != m_vAllConfig.end() ; ++iter )
{
if ( (*iter)->nRoomType == eRoom_Gold && (*iter)->nRoomLevel == cLevel )
{
return (stGoldenRoomConfig*)(*iter);
}
}
return NULL ;
} | [
"xuwenyanbill@gmail.com"
] | xuwenyanbill@gmail.com |
c091a6d6a65789b643fe1d67629f779c82a4ac84 | 9234165c806c95e5ba32c518b669c553341f2d2e | /Course Design/处理机调度的模拟实现/ot/c-c++ 多种实现/bar/HRRN.cpp | 8c5a83a13836dd551942962fb3b03330af8502e1 | [] | no_license | daisyr07/Operating-System | 584e481e4f29ed86dc2252c51d7915268e2f48e4 | 434adf5a2947164f3c98d8a6df610fa3771bb1f8 | refs/heads/master | 2022-04-05T09:04:54.908957 | 2020-01-26T07:45:33 | 2020-01-26T07:45:33 | null | 0 | 0 | null | null | null | null | GB18030 | C++ | false | false | 7,854 | cpp | #include<iostream>
using namespace std;
#define MAX_NUM 3 //进程数量
#define INF 100000 //无穷大
//定义进程控制块的结构
typedef struct pcb_struct
{
char name[2]; //进程名称
char ProcState; //进程状态
int ArriveTime; //进程到达时间
int StartTime; //进程开始时间
int FinishTime; //进程结束时间
int ServeTime; //进程服务时间
int RunTime; //已经占用cpu时间
int MoreTime; //进程还需要运行时间
int TurnaroundTime; //进程周转时间
float ResponseRatio; //响应比
struct pcb_struct *next; //结构体指针
} pcb;
int time=0; //cpu时间
pcb* head=NULL; //链表头指针
//pcb* tail=NULL; //链表尾指针
//进程初始化，输入各进程的名称，到达时间，服务时间，
void FCFS_initial()
{
cout<<"请输入"<<MAX_NUM<<"个进程的进程名、达到时间、服务时间" <<endl;
for(int i=1;i<=MAX_NUM;i++)
{
pcb* new_proc=NULL;
if((new_proc=new pcb)==NULL)
{
cout<<"创建新进程失败"<<endl;
return;
}
cout<<"第"<<i<<"个进程:"<<endl;
cin>>new_proc->name;
cin>>new_proc->ArriveTime;
cin>>new_proc->ServeTime;
new_proc->StartTime=0; //开始时间置0
new_proc->FinishTime=0; //结束时间置0
new_proc->ProcState= 'w'; //进程状态置为等待
new_proc->RunTime=0; //已经占用cpu时间置0
new_proc->MoreTime=0; //进程还需要运行时间置0
new_proc->TurnaroundTime=0; //进程的周转时间置为0
new_proc->next=NULL; //新进程尾指针悬空
if(head==NULL) //输入第一个进程时
{
head=new_proc;//头指针指向第一个进程
// tail=head;
}
else
{
if(head->ArriveTime>new_proc->ArriveTime) //新进程的到达时间小于第一个进程的达到时间，置于第一个节点之前
{
new_proc->next=head;
head=new_proc;
}
else
{
pcb *iterator_proc=head; //用来遍历寻找的指针
while(iterator_proc->next!=NULL&&iterator_proc->next->ArriveTime<new_proc->ArriveTime) //遍历链表，找到新进程的放置位置
{
iterator_proc=iterator_proc->next;
}
/* if(iterator_proc->next==NULL) //如果遍历到尾节点
{
tail=new_proc; //改变尾指针
}
*/
new_proc->next=iterator_proc->next;
iterator_proc->next=new_proc;
}
}
}
}
pcb *ArriveTime_SortList(pcb *head) //对链表中的进程按照到达时间进行排序
{
//链表快速排序
if(head == NULL || head->next == NULL) return head;
pcb *p = NULL;
bool isChange = true;
while(p != head->next && isChange)
{
pcb* q = head;
isChange = false;//标志当前这一轮中又没有发生元素交换，如果没有则表示数组已经有序
for(; q->next && q->next != p; q = q->next)
{
if(q->ArriveTime > q->next->ArriveTime)
{
//交换了节点名、到达时间、服务时间，相当于交换了两个节点本身
swap(q->name, q->next->name);
swap(q->ArriveTime, q->next->ArriveTime);
swap(q->ServeTime, q->next->ServeTime);
isChange = true;
}
}
p = q;
}
return head;
}
pcb *HRRN_SortList(pcb *head) //对链表中的进程按照响应比从大到小排序
{
//链表快速排序
if(head == NULL || head->next == NULL) return head;
//计算响应比
pcb* iterator_proc=head;
for(int i=1;i<=MAX_NUM;i++)
{
if(iterator_proc->ArriveTime<=time&&iterator_proc->ProcState!='f') //进程此刻已经到来，并且还未运行结束
iterator_proc->ResponseRatio=(1.0+(time-iterator_proc->ArriveTime)/iterator_proc->ServeTime);
else
iterator_proc->ResponseRatio=-1;
iterator_proc=iterator_proc->next;
}
pcb *p = NULL;
bool isChange = true;
while(p != head->next && isChange)
{
pcb* q = head;
isChange = false;//标志当前这一轮中又没有发生元素交换，如果没有则表示数组已经有序
for(; q->next && q->next != p; q = q->next)
{
if(q->ResponseRatio < q->next->ResponseRatio)
{
swap(q->name, q->next->name);
swap(q->ArriveTime, q->next->ArriveTime);
swap(q->ServeTime, q->next->ServeTime);
swap(q->MoreTime, q->next->MoreTime);
swap(q->ProcState, q->next->ProcState);
swap(q->RunTime, q->next->RunTime);
swap(q->ResponseRatio, q->next->ResponseRatio);
isChange = true;
}
}
p = q;
}
iterator_proc=head;
for(int i=1;i<=MAX_NUM;i++)
{
iterator_proc=iterator_proc->next;
}
return head;
}
void HRRN()
{
cout<<"HRRN:"<<endl;
ArriveTime_SortList(head); //对链表中的元素按照到达时间（此时等于剩余时间）从小到大排序
time=0; //cpu时间置0
pcb* run_proc=head; //遍历运行进程的指针
pcb* new_proc=head; //遍历修改PCB的状态的指针
int process_count=0;
for(int i=1;i<=MAX_NUM;i++)
{
new_proc->StartTime=0; //开始时间置0
new_proc->FinishTime=0; //结束时间置0
new_proc->RunTime=0; //已经占用cpu时间置0
new_proc->ProcState='w'; //进程状态置为等待
new_proc->MoreTime=new_proc->ServeTime; //进程还需要运行时间初始值与服务时间相等
new_proc->TurnaroundTime=0; //进程的周转时间置为0
new_proc->ResponseRatio=-1.0; //响应比设置为-1
new_proc=new_proc->next;
}
while(process_count < MAX_NUM)
{
cout<<time<<"时刻 ，"<<run_proc->name<<"进程正在执行"<<endl;
run_proc->StartTime=time; //修改开始运行时间
//思路是每运行一个时间刻度，进行一次检查
run_proc->RunTime++;
time++;
run_proc->MoreTime=run_proc->ServeTime-run_proc->RunTime;
if(run_proc->MoreTime <= 0)
{
cout<<time<<"时刻，"<<run_proc->name<<"进程运行结束"<<endl;
run_proc->FinishTime=time;
run_proc->TurnaroundTime=run_proc->FinishTime-run_proc->ArriveTime;//周转时间=进程完成时间-进程到达时间
cout<<run_proc->name<<"完成时间:"<<run_proc->FinishTime<<" "<<"周转时间："<<run_proc->TurnaroundTime<<" "
<<"响应比："<< (1+(run_proc->StartTime-run_proc->ArriveTime)/run_proc->ServeTime)<<endl;
run_proc->ProcState = 'f' ; //状态修改
run_proc->ResponseRatio=-2 ; //响应比设置为-2
process_count++; //完成进程数+1
}
else
{
cout<<time<<"时刻 ，"<<run_proc->name<<" 进入运行判定 " <<endl;
cout<<"已经运行了"<<run_proc->RunTime<<"还需要执行"<<run_proc->MoreTime<<endl;
}
if(run_proc->ProcState=='f') //当前进程运行完成，则进入下一个进程
{
if(process_count < MAX_NUM) //判断是否还有进程待运行
run_proc=run_proc->next;
else
break;
if (run_proc->ProcState=='w' ) //还未结束的进程
{
if(time<run_proc->ArriveTime) //如果进程当前还没到来
{
time=run_proc->ArriveTime;
}
}
else
{
for( ; run_proc->ProcState=='f' && run_proc->next!=NULL ; )
run_proc=run_proc->next; //搜索还未结束的下一个进程
}
}
else //否则根据响应比从大到小排序
{
HRRN_SortList(head);
run_proc=head;
if(run_proc->ArriveTime>time&&run_proc->ProcState=='w') //如果当前进程还未到来
{
time=run_proc->ArriveTime;
}
}
}
}
int main()
{
FCFS_initial();
HRRN();
return 0;
}
| [
"noreply@github.com"
] | daisyr07.noreply@github.com |
8a312c38fc352b86e8e929f992ddac7b65394a70 | 44f646690d471a8770311944f8b94abb13a7a438 | /IEEEXtreme Programming Competition/IEEEXtreme 11.0/Blackgate Penitentiary.cpp | d2251f95b09a959902bb01279ed5918fad963897 | [] | no_license | JArturoHReyes/Competitive-Programming | b373c8d46613284c2447c3bed778e39378b97de3 | 45232b2ee7e40a38e3f3e912e62fe12cf4509b46 | refs/heads/master | 2021-06-06T18:18:46.014845 | 2021-05-15T15:17:10 | 2021-05-15T15:17:10 | 164,688,739 | 4 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 778 | cpp | #include<bits/stdc++.h>
#define endl '\n'
#define maxn 300
using namespace std;
set < string > info[maxn];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cout << setprecision(3) << fixed;
if(fopen("ArturoTextA.txt" , "r")) freopen("ArturoTextA.txt" , "r" , stdin);
int n , r;
string x;
cin >> n;
while(n--)
{
cin >> x >> r;
info[r].insert(x);
}
int pos = 1;
for(int i = 120; i <= 250; i++)
{
int how = 0;
for(string h : info[i])
{
how++;
cout << h << " ";
}
if(how)
{
cout << pos << " " << pos + how - 1 << endl;
pos += how;
}
}
return 0;
}
| [
"noreply@github.com"
] | JArturoHReyes.noreply@github.com |
a3630e9b2a2a6684bd36a5286f7a308612c77561 | 646b92654d11cdd269b82cd819d5b72ed5c0ef69 | /qnx_system/backtrace/main.cpp | 5ce2e9107c49c3b856b2e7424638a5afe4b9587f | [] | no_license | yanvasilij/cpp_examples | 832b8d20665b107e486b2a915325ab99ad5fe408 | 35bd2effac66cc6217bd5fdec899f97ab5b73873 | refs/heads/master | 2023-03-24T09:04:18.589338 | 2021-03-05T06:55:03 | 2021-03-05T06:55:03 | 302,635,669 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,400 | cpp | /**
* @brief Пример получения дампа при аварийном завершении программы
* @author Yanikeev-VS
*/
#include <thread>
#include <iostream>
#include <chrono>
#include <backtrace.h>
using VoidFunction = void (*)();
bt_accessor_t acc;
bt_accessor_t acc_sighandler1;
bt_addr_t pc_sighandler1[10];
int cnt_sighandler1;
bt_memmap_t memmap;
void sigfaultHandler (int sig_number)
{
char out[512];
std::cout << "sigfault!" << std::endl;
cnt_sighandler1 =
bt_get_backtrace(&acc_sighandler1, pc_sighandler1,
sizeof(pc_sighandler1)/sizeof(bt_addr_t));
// bt_sprnf_addrs(&memmap, pc_sighandler1, cnt_sighandler1, "%a",
// out, sizeof(out), 0);
bt_sprn_memmap(&memmap, out, sizeof(out));
puts(out);
bt_release_accessor(&acc);
exit(-1);
}
class CrashThread
{
void execCrash ()
{
std::cout << "Prepare for crash..." << std::endl;
std::this_thread::sleep_for(std::chrono::seconds(1));
VoidFunction f{nullptr};
f();
}
public:
void start ()
{
std::thread t1 (&CrashThread::execCrash, this);
t1.join();
}
};
int main( )
{
//signal(SIGSEGV, sigfaultHandler );
bt_init_accessor(&acc, BT_SELF);
bt_load_memmap(&acc, &memmap);
CrashThread test;
test.start();
return 0;
}
| [
"yanikeev-vs@nefteavtomatika.ru"
] | yanikeev-vs@nefteavtomatika.ru |
329a34a72ca31e2dd02f163e7e7d36e25ca7f6d5 | 1f63dde39fcc5f8be29f2acb947c41f1b6f1683e | /Boss2D/addon/tensorflow-1.2.1_for_boss/tensorflow/stream_executor/stream_executor_pimpl.cc | fe5da12639fdb73b18e9b5526b00e101dd509e25 | [
"MIT",
"Apache-2.0"
] | permissive | koobonil/Boss2D | 09ca948823e0df5a5a53b64a10033c4f3665483a | e5eb355b57228a701495f2660f137bd05628c202 | refs/heads/master | 2022-10-20T09:02:51.341143 | 2019-07-18T02:13:44 | 2019-07-18T02:13:44 | 105,999,368 | 7 | 2 | MIT | 2022-10-04T23:31:12 | 2017-10-06T11:57:07 | C++ | UTF-8 | C++ | false | false | 26,290 | cc | /* Copyright 2015 The TensorFlow 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.
==============================================================================*/
// Implements the StreamExecutor interface by passing through to its
// implementation_ value (in pointer-to-implementation style), which
// implements StreamExecutorInterface.
#include "tensorflow/stream_executor/stream_executor_pimpl.h"
#include <atomic>
#include <utility>
#include "tensorflow/stream_executor/blas.h"
#include "tensorflow/stream_executor/fft.h"
#include "tensorflow/stream_executor/lib/env.h"
#include "tensorflow/stream_executor/lib/error.h"
#include "tensorflow/stream_executor/lib/notification.h"
#include "tensorflow/stream_executor/lib/stacktrace.h"
#include "tensorflow/stream_executor/lib/str_util.h"
#include "tensorflow/stream_executor/lib/stringprintf.h"
#include "tensorflow/stream_executor/lib/threadpool.h"
#include "tensorflow/stream_executor/platform/port.h"
#include "tensorflow/stream_executor/rng.h"
#include "tensorflow/stream_executor/stream_executor_internal.h"
namespace {
bool FLAGS_check_gpu_leaks = false;
} // namespace
namespace perftools {
namespace gputools {
namespace {
string StackTraceIfVLOG10() {
if (VLOG_IS_ON(10)) {
return port::StrCat(" ", port::CurrentStackTrace(), "\n");
} else {
return "";
}
}
// Make sure the executor is done with its work; we know (because this isn't
// publicly visible) that all enqueued work is quick.
void BlockOnThreadExecutor(port::ThreadPool *executor) {
port::Notification n;
executor->Schedule([&n]() { n.Notify(); });
n.WaitForNotification();
}
internal::StreamExecutorInterface *StreamExecutorImplementationFromPlatformKind(
PlatformKind platform_kind, const PluginConfig &plugin_config) {
// Note: we use this factory-assignment-in-switch pattern instead of just
// invoking the callable in case linkage is messed up -- instead of invoking a
// nullptr std::function (due to failed registration) we give a nice
// LOG(FATAL) message.
internal::StreamExecutorFactory factory;
switch (platform_kind) {
case PlatformKind::kCuda:
factory = *internal::MakeCUDAExecutorImplementation();
break;
case PlatformKind::kOpenCL:
factory = *internal::MakeOpenCLExecutorImplementation();
break;
case PlatformKind::kHost:
factory = internal::MakeHostExecutorImplementation;
break;
default:
factory = nullptr;
}
if (factory == nullptr) {
LOG(FATAL)
<< "cannot create GPU executor implementation for platform kind: "
<< PlatformKindString(platform_kind);
}
return factory(plugin_config);
}
std::atomic_int_fast64_t correlation_id_generator(0);
} // namespace
template <typename BeginCallT, typename CompleteCallT,
typename ReturnT, typename... BeginArgsT>
class ScopedTracer {
public:
ScopedTracer(StreamExecutor *stream_exec, BeginCallT begin_call,
CompleteCallT complete_call, const ReturnT *result,
BeginArgsT... begin_args)
: stream_exec_(stream_exec),
complete_call_(complete_call),
result_(result) {
if (stream_exec_->tracing_enabled_) {
correlation_id_ =
correlation_id_generator.fetch_add(1, std::memory_order_relaxed) - 1;
Trace(begin_call, begin_args...);
}
}
~ScopedTracer() {
if (stream_exec_->tracing_enabled_) {
Trace(complete_call_, result_);
}
}
private:
template <typename CallbackT, typename... TraceArgsT>
void Trace(CallbackT callback, TraceArgsT... args) {
{
// Instance tracers held in a block to limit the lock lifetime.
shared_lock lock{stream_exec_->mu_};
for (TraceListener *listener : stream_exec_->listeners_) {
(listener->*callback)(correlation_id_,
std::forward<TraceArgsT>(args)...);
}
}
}
StreamExecutor *stream_exec_;
CompleteCallT complete_call_;
const ReturnT* result_;
int64 correlation_id_;
};
template <typename BeginCallT, typename CompleteCallT, typename ReturnT,
typename... BeginArgsT>
ScopedTracer<BeginCallT, CompleteCallT, ReturnT, BeginArgsT...>
MakeScopedTracer(StreamExecutor *stream_exec, BeginCallT begin_call,
CompleteCallT complete_call, ReturnT *result,
BeginArgsT... begin_args) {
return ScopedTracer<BeginCallT, CompleteCallT, ReturnT, BeginArgsT...>(
stream_exec, begin_call, complete_call, result,
std::forward<BeginArgsT>(begin_args)...);
}
#define SCOPED_TRACE(LOC, ...) \
auto tracer = MakeScopedTracer(this, &LOC ## Begin, \
&LOC ## Complete, ## __VA_ARGS__);
/* static */ mutex StreamExecutor::static_mu_{LINKER_INITIALIZED};
StreamExecutor::StreamExecutor(PlatformKind platform_kind,
const PluginConfig &plugin_config)
: platform_(nullptr),
implementation_(StreamExecutorImplementationFromPlatformKind(
platform_kind, plugin_config)),
platform_kind_(platform_kind),
device_ordinal_(-1),
background_threads_(new port::ThreadPool(
port::Env::Default(), "stream_executor", kNumBackgroundThreads)),
live_stream_count_(0),
tracing_enabled_(false) {
CheckPlatformKindIsValid(platform_kind);
}
StreamExecutor::StreamExecutor(
const Platform *platform,
std::unique_ptr<internal::StreamExecutorInterface> implementation)
: platform_(platform),
implementation_(std::move(implementation)),
device_ordinal_(-1),
background_threads_(new port::ThreadPool(
port::Env::Default(), "stream_executor", kNumBackgroundThreads)),
live_stream_count_(0),
tracing_enabled_(false) {
if (port::Lowercase(platform_->Name()) == "cuda") {
platform_kind_ = PlatformKind::kCuda;
} else if (port::Lowercase(platform_->Name()) == "opencl") {
platform_kind_ = PlatformKind::kOpenCL;
} else if (port::Lowercase(platform_->Name()) == "host") {
platform_kind_ = PlatformKind::kHost;
}
}
StreamExecutor::~StreamExecutor() {
BlockOnThreadExecutor(background_threads_.get());
if (live_stream_count_.load() != 0) {
LOG(WARNING) << "Not all streams were deallocated at executor destruction "
<< "time. This may lead to unexpected/bad behavior - "
<< "especially if any stream is still active!";
}
if (FLAGS_check_gpu_leaks) {
for (auto it : mem_allocs_) {
LOG(INFO) << "Memory alloced at executor exit: addr: "
<< port::Printf("%p", it.first)
<< ", bytes: " << it.second.bytes << ", trace: \n"
<< it.second.stack_trace;
}
}
}
port::Status StreamExecutor::Init(int device_ordinal,
DeviceOptions device_options) {
device_ordinal_ = device_ordinal;
return implementation_->Init(device_ordinal, std::move(device_options));
}
port::Status StreamExecutor::Init() {
return Init(0, DeviceOptions::Default());
}
bool StreamExecutor::GetKernel(const MultiKernelLoaderSpec &spec,
KernelBase *kernel) {
return implementation_->GetKernel(spec, kernel);
}
void StreamExecutor::Deallocate(DeviceMemoryBase *mem) {
VLOG(1) << "Called StreamExecutor::Deallocate(mem=" << mem->opaque()
<< ") mem->size()=" << mem->size() << StackTraceIfVLOG10();
if (mem->opaque() != nullptr) {
EraseAllocRecord(mem->opaque());
}
implementation_->Deallocate(mem);
mem->Reset(nullptr, 0);
}
void StreamExecutor::GetMemAllocs(std::map<void *, AllocRecord> *records_out) {
shared_lock lock{mu_};
*records_out = mem_allocs_;
}
bool StreamExecutor::CanEnablePeerAccessTo(StreamExecutor *other) {
return implementation_->CanEnablePeerAccessTo(other->implementation_.get());
}
port::Status StreamExecutor::EnablePeerAccessTo(StreamExecutor *other) {
return implementation_->EnablePeerAccessTo(other->implementation_.get());
}
SharedMemoryConfig StreamExecutor::GetDeviceSharedMemoryConfig() {
return implementation_->GetDeviceSharedMemoryConfig();
}
port::Status StreamExecutor::SetDeviceSharedMemoryConfig(
SharedMemoryConfig config) {
if (config != SharedMemoryConfig::kDefault &&
config != SharedMemoryConfig::kFourByte &&
config != SharedMemoryConfig::kEightByte) {
string error_msg = port::Printf(
"Invalid shared memory config specified: %d", static_cast<int>(config));
LOG(ERROR) << error_msg;
return port::Status{port::error::INVALID_ARGUMENT, error_msg};
}
return implementation_->SetDeviceSharedMemoryConfig(config);
}
const DeviceDescription &StreamExecutor::GetDeviceDescription() const {
mutex_lock lock{mu_};
if (device_description_ != nullptr) {
return *device_description_;
}
device_description_.reset(PopulateDeviceDescription());
return *device_description_;
}
int StreamExecutor::PlatformDeviceCount() const {
return implementation_->PlatformDeviceCount();
}
bool StreamExecutor::SupportsBlas() const {
return implementation_->SupportsBlas();
}
bool StreamExecutor::SupportsRng() const {
return implementation_->SupportsRng();
}
bool StreamExecutor::SupportsDnn() const {
return implementation_->SupportsDnn();
}
bool StreamExecutor::GetConvolveAlgorithms(
std::vector<dnn::AlgorithmType> *out_algorithms) {
dnn::DnnSupport *dnn_support = AsDnn();
if (!dnn_support) {
return false;
}
return dnn_support->GetConvolveAlgorithms(out_algorithms);
}
bool StreamExecutor::GetConvolveBackwardDataAlgorithms(
std::vector<dnn::AlgorithmType> *out_algorithms) {
dnn::DnnSupport *dnn_support = AsDnn();
if (!dnn_support) {
return false;
}
return dnn_support->GetConvolveBackwardDataAlgorithms(out_algorithms);
}
bool StreamExecutor::GetConvolveBackwardFilterAlgorithms(
std::vector<dnn::AlgorithmType> *out_algorithms) {
dnn::DnnSupport *dnn_support = AsDnn();
if (!dnn_support) {
return false;
}
return dnn_support->GetConvolveBackwardFilterAlgorithms(out_algorithms);
}
bool StreamExecutor::GetBlasGemmAlgorithms(
std::vector<blas::AlgorithmType> *out_algorithms) {
blas::BlasSupport *blas_support = AsBlas();
if (!blas_support) {
return false;
}
return blas_support->GetBlasGemmAlgorithms(out_algorithms);
}
port::StatusOr<std::unique_ptr<dnn::RnnDescriptor>>
StreamExecutor::createRnnDescriptor(
int num_layers, int hidden_size, int input_size,
dnn::RnnInputMode input_mode, dnn::RnnDirectionMode direction_mode,
dnn::RnnMode rnn_mode, dnn::DataType data_type, float dropout, uint64 seed,
ScratchAllocator *state_allocator) {
dnn::DnnSupport *dnn_support = AsDnn();
if (!dnn_support) {
return port::Status(port::error::UNKNOWN,
"Fail to find the dnn implementation.");
}
return dnn_support->createRnnDescriptor(
num_layers, hidden_size, input_size, input_mode, direction_mode, rnn_mode,
data_type, dropout, seed, state_allocator);
}
port::StatusOr<std::unique_ptr<dnn::RnnSequenceTensorDescriptor>>
StreamExecutor::createRnnSequenceTensorDescriptor(int seq_length,
int batch_size, int data_size,
dnn::DataType data_type) {
dnn::DnnSupport *dnn_support = AsDnn();
if (!dnn_support) {
return port::Status(port::error::UNKNOWN,
"Fail to find the dnn implementation.");
}
return dnn_support->createRnnSequenceTensorDescriptor(seq_length, batch_size,
data_size, data_type);
}
port::StatusOr<std::unique_ptr<dnn::RnnStateTensorDescriptor>>
StreamExecutor::createRnnStateTensorDescriptor(int num_layer, int batch_size,
int data_size,
dnn::DataType data_type) {
dnn::DnnSupport *dnn_support = AsDnn();
if (!dnn_support) {
return port::Status(port::error::UNKNOWN,
"Fail to find the dnn implementation.");
}
return dnn_support->createRnnStateTensorDescriptor(num_layer, batch_size,
data_size, data_type);
}
dnn::DnnSupport *StreamExecutor::AsDnn() {
mutex_lock lock{mu_};
if (dnn_ != nullptr) {
return dnn_.get();
}
dnn_.reset(implementation_->CreateDnn());
return dnn_.get();
}
blas::BlasSupport *StreamExecutor::AsBlas() {
mutex_lock lock{mu_};
if (blas_ != nullptr) {
return blas_.get();
}
blas_.reset(implementation_->CreateBlas());
return blas_.get();
}
fft::FftSupport *StreamExecutor::AsFft() {
mutex_lock lock{mu_};
if (fft_ != nullptr) {
return fft_.get();
}
fft_.reset(implementation_->CreateFft());
return fft_.get();
}
rng::RngSupport *StreamExecutor::AsRng() {
mutex_lock lock{mu_};
if (rng_ != nullptr) {
return rng_.get();
}
rng_.reset(implementation_->CreateRng());
return rng_.get();
}
bool StreamExecutor::Launch(Stream *stream, const ThreadDim &thread_dims,
const BlockDim &block_dims,
const KernelBase &kernel,
const KernelArgsArrayBase &args) {
SubmitTrace(&TraceListener::LaunchSubmit, stream, thread_dims, block_dims,
kernel, args);
return implementation_->Launch(stream, thread_dims, block_dims, kernel, args);
}
bool StreamExecutor::BlockHostUntilDone(Stream *stream) {
bool result;
SCOPED_TRACE(TraceListener::BlockHostUntilDone, &result, stream);
result = implementation_->BlockHostUntilDone(stream);
return result;
}
void *StreamExecutor::Allocate(uint64 size) {
void *buf = implementation_->Allocate(size);
VLOG(1) << "Called StreamExecutor::Allocate(size=" << size << ") returns "
<< buf << StackTraceIfVLOG10();
CreateAllocRecord(buf, size);
return buf;
}
bool StreamExecutor::GetSymbol(const string &symbol_name, void **mem,
size_t *bytes) {
return implementation_->GetSymbol(symbol_name, mem, bytes);
}
void *StreamExecutor::HostMemoryAllocate(uint64 size) {
void *buffer = implementation_->HostMemoryAllocate(size);
VLOG(1) << "Called StreamExecutor::HostMemoryAllocate(size=" << size
<< ") returns " << buffer << StackTraceIfVLOG10();
return buffer;
}
void StreamExecutor::HostMemoryDeallocate(void *location) {
VLOG(1) << "Called StreamExecutor::HostMemoryDeallocate(location=" << location
<< ")" << StackTraceIfVLOG10();
return implementation_->HostMemoryDeallocate(location);
}
bool StreamExecutor::HostMemoryRegister(void *location, uint64 size) {
VLOG(1) << "Called StreamExecutor::HostMemoryRegister(location=" << location
<< ", size=" << size << ")" << StackTraceIfVLOG10();
if (location == nullptr || size == 0) {
LOG(WARNING) << "attempting to register null or zero-sized memory: "
<< location << "; size " << size;
}
return implementation_->HostMemoryRegister(location, size);
}
bool StreamExecutor::HostMemoryUnregister(void *location) {
VLOG(1) << "Called StreamExecutor::HostMemoryUnregister(location=" << location
<< ")" << StackTraceIfVLOG10();
return implementation_->HostMemoryUnregister(location);
}
bool StreamExecutor::SynchronizeAllActivity() {
VLOG(1) << "Called StreamExecutor::SynchronizeAllActivity()"
<< StackTraceIfVLOG10();
bool ok = implementation_->SynchronizeAllActivity();
// This should all be quick and infallible work, so we can perform the
// synchronization even in the case of failure.
BlockOnThreadExecutor(background_threads_.get());
return ok;
}
bool StreamExecutor::SynchronousMemZero(DeviceMemoryBase *location,
uint64 size) {
VLOG(1) << "Called StreamExecutor::SynchronousMemZero(location=" << location
<< ", size=" << size << ")" << StackTraceIfVLOG10();
return implementation_->SynchronousMemZero(location, size);
}
bool StreamExecutor::SynchronousMemSet(DeviceMemoryBase *location, int value,
uint64 size) {
VLOG(1) << "Called StreamExecutor::SynchronousMemSet(location=" << location
<< ", value=" << value << ", size=" << size << ")"
<< StackTraceIfVLOG10();
return implementation_->SynchronousMemSet(location, value, size);
}
bool StreamExecutor::SynchronousMemcpy(DeviceMemoryBase *gpu_dst,
const void *host_src, uint64 size) {
VLOG(1) << "Called StreamExecutor::SynchronousMemcpy(gpu_dst="
<< gpu_dst->opaque() << ", host_src=" << host_src << ", size=" << size
<< ") H2D" << StackTraceIfVLOG10();
// Tracing overloaded methods is very difficult due to issues with type
// inference on template args. Since use of these overloaded methods is
// discouraged anyway, this isn't a huge deal.
port::Status status =
implementation_->SynchronousMemcpy(gpu_dst, host_src, size);
if (!status.ok()) {
LOG(ERROR) << "synchronous memcpy: " << status;
}
return status.ok();
}
bool StreamExecutor::SynchronousMemcpy(void *host_dst,
const DeviceMemoryBase &gpu_src,
uint64 size) {
VLOG(1) << "Called StreamExecutor::SynchronousMemcpy(host_dst=" << host_dst
<< ", gpu_src=" << gpu_src.opaque() << ", size=" << size << ") D2H"
<< StackTraceIfVLOG10();
port::Status status =
implementation_->SynchronousMemcpy(host_dst, gpu_src, size);
if (!status.ok()) {
LOG(ERROR) << "synchronous memcpy: " << status;
}
return status.ok();
}
bool StreamExecutor::SynchronousMemcpy(DeviceMemoryBase *gpu_dst,
const DeviceMemoryBase &gpu_src,
uint64 size) {
VLOG(1) << "Called StreamExecutor::SynchronousMemcpy(gpu_dst="
<< gpu_dst->opaque() << ", gpu_src=" << gpu_src.opaque()
<< ", size=" << size << ") D2D" << StackTraceIfVLOG10();
port::Status status =
implementation_->SynchronousMemcpyDeviceToDevice(gpu_dst, gpu_src, size);
if (!status.ok()) {
LOG(ERROR) << "synchronous memcpy: " << status;
}
return status.ok();
}
port::Status StreamExecutor::SynchronousMemcpyD2H(
const DeviceMemoryBase &gpu_src, int64 size, void *host_dst) {
VLOG(1) << "Called StreamExecutor::SynchronousMemcpyD2H(gpu_src="
<< gpu_src.opaque() << ", size=" << size << ", host_dst=" << host_dst
<< ")" << StackTraceIfVLOG10();
port::Status result{port::Status::OK()};
SCOPED_TRACE(TraceListener::SynchronousMemcpyD2H,
&result, gpu_src, size, host_dst);
port::Status status =
implementation_->SynchronousMemcpy(host_dst, gpu_src, size);
if (!status.ok()) {
return port::Status{
port::error::INTERNAL,
port::Printf(
"failed to synchronously memcpy device-to-host: GPU %p to host %p "
"size %lld: %s",
gpu_src.opaque(), host_dst, size, status.ToString().c_str())};
}
return result;
}
port::Status StreamExecutor::SynchronousMemcpyH2D(const void *host_src,
int64 size,
DeviceMemoryBase *gpu_dst) {
VLOG(1) << "Called StreamExecutor::SynchronousMemcpyH2D(host_src=" << host_src
<< ", size=" << size << ", gpu_dst" << gpu_dst->opaque() << ")"
<< StackTraceIfVLOG10();
port::Status result{port::Status::OK()};
SCOPED_TRACE(TraceListener::SynchronousMemcpyH2D,
&result, host_src, size, gpu_dst);
port::Status status =
implementation_->SynchronousMemcpy(gpu_dst, host_src, size);
if (!status.ok()) {
result = port::Status{
port::error::INTERNAL,
port::Printf("failed to synchronously memcpy host-to-device: host "
"%p to GPU %p size %lld: %s",
host_src, gpu_dst->opaque(), size,
status.ToString().c_str())};
}
return result;
}
bool StreamExecutor::Memcpy(Stream *stream, void *host_dst,
const DeviceMemoryBase &gpu_src, uint64 size) {
return implementation_->Memcpy(stream, host_dst, gpu_src, size);
}
bool StreamExecutor::Memcpy(Stream *stream, DeviceMemoryBase *gpu_dst,
const void *host_src, uint64 size) {
return implementation_->Memcpy(stream, gpu_dst, host_src, size);
}
bool StreamExecutor::MemcpyDeviceToDevice(Stream *stream,
DeviceMemoryBase *gpu_dst,
const DeviceMemoryBase &gpu_src,
uint64 size) {
return implementation_->MemcpyDeviceToDevice(stream, gpu_dst, gpu_src, size);
}
bool StreamExecutor::MemZero(Stream *stream, DeviceMemoryBase *location,
uint64 size) {
return implementation_->MemZero(stream, location, size);
}
bool StreamExecutor::Memset32(Stream *stream, DeviceMemoryBase *location,
uint32 pattern, uint64 size) {
CHECK_EQ(0, size % 4)
<< "need 32-bit multiple size to fill with 32-bit pattern";
return implementation_->Memset32(stream, location, pattern, size);
}
bool StreamExecutor::HostCallback(Stream *stream,
std::function<void()> callback) {
return implementation_->HostCallback(stream, std::move(callback));
}
port::Status StreamExecutor::AllocateEvent(Event *event) {
return implementation_->AllocateEvent(event);
}
port::Status StreamExecutor::DeallocateEvent(Event *event) {
return implementation_->DeallocateEvent(event);
}
port::Status StreamExecutor::RecordEvent(Stream *stream, Event *event) {
return implementation_->RecordEvent(stream, event);
}
port::Status StreamExecutor::WaitForEvent(Stream *stream, Event *event) {
return implementation_->WaitForEvent(stream, event);
}
Event::Status StreamExecutor::PollForEventStatus(Event *event) {
return implementation_->PollForEventStatus(event);
}
bool StreamExecutor::AllocateStream(Stream *stream) {
live_stream_count_.fetch_add(1, std::memory_order_relaxed);
if (!implementation_->AllocateStream(stream)) {
auto count = live_stream_count_.fetch_sub(1);
CHECK_GE(count, 0) << "live stream count should not dip below zero";
LOG(INFO) << "failed to allocate stream; live stream count: " << count;
return false;
}
return true;
}
void StreamExecutor::DeallocateStream(Stream *stream) {
implementation_->DeallocateStream(stream);
CHECK_GE(live_stream_count_.fetch_sub(1), 0)
<< "live stream count should not dip below zero";
}
bool StreamExecutor::CreateStreamDependency(Stream *dependent, Stream *other) {
return implementation_->CreateStreamDependency(dependent, other);
}
bool StreamExecutor::AllocateTimer(Timer *timer) {
return implementation_->AllocateTimer(timer);
}
void StreamExecutor::DeallocateTimer(Timer *timer) {
return implementation_->DeallocateTimer(timer);
}
bool StreamExecutor::StartTimer(Stream *stream, Timer *timer) {
return implementation_->StartTimer(stream, timer);
}
bool StreamExecutor::StopTimer(Stream *stream, Timer *timer) {
return implementation_->StopTimer(stream, timer);
}
DeviceDescription *StreamExecutor::PopulateDeviceDescription() const {
return implementation_->PopulateDeviceDescription();
}
bool StreamExecutor::DeviceMemoryUsage(int64 *free, int64 *total) const {
return implementation_->DeviceMemoryUsage(free, total);
}
void StreamExecutor::EnqueueOnBackgroundThread(std::function<void()> task) {
background_threads_->Schedule(std::move(task));
}
void StreamExecutor::CreateAllocRecord(void *opaque, uint64 bytes) {
if (FLAGS_check_gpu_leaks && opaque != nullptr && bytes != 0) {
mutex_lock lock{mu_};
mem_allocs_[opaque] = AllocRecord{
bytes, ""};
}
}
void StreamExecutor::EraseAllocRecord(void *opaque) {
if (FLAGS_check_gpu_leaks && opaque != nullptr) {
mutex_lock lock{mu_};
if (mem_allocs_.find(opaque) == mem_allocs_.end()) {
LOG(ERROR) << "Deallocating unknown pointer: "
<< port::Printf("0x%p", opaque);
} else {
mem_allocs_.erase(opaque);
}
}
}
void StreamExecutor::EnableTracing(bool enabled) { tracing_enabled_ = enabled; }
void StreamExecutor::RegisterTraceListener(TraceListener *listener) {
{
mutex_lock lock{mu_};
if (listeners_.find(listener) != listeners_.end()) {
LOG(INFO) << "Attempt to register already-registered listener, "
<< listener;
} else {
listeners_.insert(listener);
}
}
implementation_->RegisterTraceListener(listener);
}
bool StreamExecutor::UnregisterTraceListener(TraceListener *listener) {
{
mutex_lock lock{mu_};
if (listeners_.find(listener) == listeners_.end()) {
LOG(INFO) << "Attempt to unregister unknown listener, " << listener;
return false;
}
listeners_.erase(listener);
}
implementation_->UnregisterTraceListener(listener);
return true;
}
template <typename TraceCallT, typename... ArgsT>
void StreamExecutor::SubmitTrace(TraceCallT trace_call, ArgsT &&... args) {
if (tracing_enabled_) {
{
// instance tracers held in a block to limit the lock lifetime.
shared_lock lock{mu_};
for (TraceListener *listener : listeners_) {
(listener->*trace_call)(std::forward<ArgsT>(args)...);
}
}
}
}
internal::StreamExecutorInterface *StreamExecutor::implementation() {
return implementation_->GetUnderlyingExecutor();
}
} // namespace gputools
} // namespace perftools
| [
"slacealic@gmail.com"
] | slacealic@gmail.com |
aea1ba8e7b00a8035a5ead2b69661937800d5a86 | 7029a18f2e72cac9e8c0af3f43a0f37dcbd429f8 | /gunir/utils/create_tablet.cc | 9807dea95ae7da99d18ad4bf83e31d8c574dfcf4 | [] | no_license | GregHWayne/gunir | f542975e1eaf9a6a72ea533d03a6ea488d7979ac | 66a57a961cc9169dbf1d0a8cc0e0d6e99e106a01 | refs/heads/master | 2021-01-17T21:52:05.581720 | 2015-07-29T03:51:25 | 2015-07-29T03:51:25 | 39,935,844 | 1 | 0 | null | 2015-07-30T06:53:44 | 2015-07-30T06:53:44 | null | UTF-8 | C++ | false | false | 2,598 | cc | // Copyright (C) 2015. The Gunir Authors. All rights reserved.
// Author: An Qin (anqin.qin@gmail.com)
//
// Description:
#include "gunir/utils/create_tablet.h"
#include <vector>
#include "thirdparty/gflags/gflags.h"
#include "thirdparty/glog/logging.h"
#include "gunir/io/dissector.h"
#include "gunir/io/tablet_writer.h"
DECLARE_uint64(gunir_tablet_file_size);
DECLARE_uint64(gunir_max_record_size);
namespace gunir {
CreateTablet::CreateTablet() {}
CreateTablet::~CreateTablet() {}
bool CreateTablet::Setup(const std::string& schema_string,
const std::string& tablet_name,
const std::string& output_prefix) {
// Init dissector.
io::SchemaDescriptor schema_descriptor;
schema_descriptor.ParseFromString(schema_string);
m_dissector.reset(
CREATE_RECORD_DISSECTOR_OBJECT(schema_descriptor.type()));
if (m_dissector.get() == NULL) {
return false;
}
m_buffer.reset(new char[FLAGS_gunir_tablet_file_size + FLAGS_gunir_max_record_size]);
m_dissector->SetBuffer(m_buffer.get(), FLAGS_gunir_max_record_size);
m_dissector->Init(schema_descriptor);
std::vector<io::ColumnStaticInfo> column_static_infos;
m_dissector->GetSchemaColumnStat(&column_static_infos);
// Init tablet writer.
m_tablet_writer.reset(new io::TabletWriter());
m_tablet_writer->SetBuffer(m_buffer.get() + FLAGS_gunir_max_record_size,
FLAGS_gunir_tablet_file_size);
if (!m_tablet_writer->BuildTabletSchema(tablet_name,
schema_descriptor,
column_static_infos)) {
LOG(ERROR) << "construct tablet schema failed";
return false;
}
if (!m_tablet_writer->Open(output_prefix)) {
LOG(ERROR) << "open column writer failed";
return false;
}
return true;
}
bool CreateTablet::Flush() {
if (!m_tablet_writer->Close()) {
LOG(ERROR) << "close tablet writer fail";
return false;
}
m_dissector.reset();
m_tablet_writer.reset();
m_buffer.reset();
return true;
}
bool CreateTablet::WriteMessage(const StringPiece& value) {
std::vector<const io::Block*> blocks;
std::vector<uint32_t> indexes;
if (!m_dissector->DissectRecord(value, &blocks, &indexes)) {
LOG(ERROR) << "Error to dissect record data";
return false;
}
if (!m_tablet_writer->Write(blocks, indexes)) {
LOG(ERROR) << "write field failed";
return false;
}
return true;
}
} // namespace gunir
| [
"qinan@baidu.com"
] | qinan@baidu.com |
c5e4180f101ca6546b50972174de1aee60db7b6a | 5466c25ca58b5a5c6fdd128f882c1405a8373d80 | /modules/engine/include/bullet3/BulletCollision/CollisionShapes/btBoxShape.h | 3202fc2628aa778c1ed9f8a3bff5c573f4501fa8 | [
"MIT"
] | permissive | alexlitty/randar | 73781d877daafb1a62b5e86251c31ee101831bcb | 95daae57b1ec7d87194cdbcf6e3946b4ed9fc79b | refs/heads/master | 2020-05-27T12:59:49.744931 | 2018-03-27T05:15:35 | 2018-03-27T05:16:01 | 73,526,607 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 9,837 | h | /*
Bullet Continuous Collision Detection and Physics Library
Copyright (c) 2003-2009 Erwin Coumans http://bulletphysics.org
This software is provided 'as-is', without any express or implied warranty.
In no event will the authors be held liable for any damages arising from the use of this software.
Permission is granted to anyone to use this software for any purpose,
including commercial applications, and to alter it and redistribute it freely,
subject to the following restrictions:
1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
3. This notice may not be removed or altered from any source distribution.
*/
#ifndef BT_OBB_BOX_MINKOWSKI_H
#define BT_OBB_BOX_MINKOWSKI_H
#include "btPolyhedralConvexShape.h"
#include "btCollisionMargin.h"
#include "BulletCollision/BroadphaseCollision/btBroadphaseProxy.h"
#include "LinearMath/btVector3.h"
#include "LinearMath/btMinMax.h"
///The btBoxShape is a box primitive around the origin, its sides axis aligned with length specified by half extents, in local shape coordinates. When used as part of a btCollisionObject or btRigidBody it will be an oriented box in world space.
ATTRIBUTE_ALIGNED16(class) btBoxShape: public btPolyhedralConvexShape
{
//btVector3 m_boxHalfExtents1; //use m_implicitShapeDimensions instead
public:
BT_DECLARE_ALIGNED_ALLOCATOR();
btVector3 getHalfExtentsWithMargin() const
{
btVector3 halfExtents = getHalfExtentsWithoutMargin();
btVector3 margin(getMargin(),getMargin(),getMargin());
halfExtents += margin;
return halfExtents;
}
const btVector3& getHalfExtentsWithoutMargin() const
{
return m_implicitShapeDimensions;//scaling is included, margin is not
}
virtual btVector3 localGetSupportingVertex(const btVector3& vec) const
{
btVector3 halfExtents = getHalfExtentsWithoutMargin();
btVector3 margin(getMargin(),getMargin(),getMargin());
halfExtents += margin;
return btVector3(btFsels(vec.x(), halfExtents.x(), -halfExtents.x()),
btFsels(vec.y(), halfExtents.y(), -halfExtents.y()),
btFsels(vec.z(), halfExtents.z(), -halfExtents.z()));
}
SIMD_FORCE_INLINE btVector3 localGetSupportingVertexWithoutMargin(const btVector3& vec)const
{
const btVector3& halfExtents = getHalfExtentsWithoutMargin();
return btVector3(btFsels(vec.x(), halfExtents.x(), -halfExtents.x()),
btFsels(vec.y(), halfExtents.y(), -halfExtents.y()),
btFsels(vec.z(), halfExtents.z(), -halfExtents.z()));
}
virtual void batchedUnitVectorGetSupportingVertexWithoutMargin(const btVector3* vectors,btVector3* supportVerticesOut,int numVectors) const
{
const btVector3& halfExtents = getHalfExtentsWithoutMargin();
for (int i=0;i<numVectors;i++)
{
const btVector3& vec = vectors[i];
supportVerticesOut[i].setValue(btFsels(vec.x(), halfExtents.x(), -halfExtents.x()),
btFsels(vec.y(), halfExtents.y(), -halfExtents.y()),
btFsels(vec.z(), halfExtents.z(), -halfExtents.z()));
}
}
btBoxShape( const btVector3& boxHalfExtents);
virtual void setMargin(btScalar collisionMargin)
{
//correct the m_implicitShapeDimensions for the margin
btVector3 oldMargin(getMargin(),getMargin(),getMargin());
btVector3 implicitShapeDimensionsWithMargin = m_implicitShapeDimensions+oldMargin;
btConvexInternalShape::setMargin(collisionMargin);
btVector3 newMargin(getMargin(),getMargin(),getMargin());
m_implicitShapeDimensions = implicitShapeDimensionsWithMargin - newMargin;
}
virtual void setLocalScaling(const btVector3& scaling)
{
btVector3 oldMargin(getMargin(),getMargin(),getMargin());
btVector3 implicitShapeDimensionsWithMargin = m_implicitShapeDimensions+oldMargin;
btVector3 unScaledImplicitShapeDimensionsWithMargin = implicitShapeDimensionsWithMargin / m_localScaling;
btConvexInternalShape::setLocalScaling(scaling);
m_implicitShapeDimensions = (unScaledImplicitShapeDimensionsWithMargin * m_localScaling) - oldMargin;
}
virtual void getAabb(const btTransform& t,btVector3& aabbMin,btVector3& aabbMax) const;
virtual void calculateLocalInertia(btScalar mass,btVector3& inertia) const;
virtual void getPlane(btVector3& planeNormal,btVector3& planeSupport,int i ) const
{
//this plane might not be aligned...
btVector4 plane ;
getPlaneEquation(plane,i);
planeNormal = btVector3(plane.getX(),plane.getY(),plane.getZ());
planeSupport = localGetSupportingVertex(-planeNormal);
}
virtual int getNumPlanes() const
{
return 6;
}
virtual int getNumVertices() const
{
return 8;
}
virtual int getNumEdges() const
{
return 12;
}
virtual void getVertex(int i,btVector3& vtx) const
{
btVector3 halfExtents = getHalfExtentsWithMargin();
vtx = btVector3(
halfExtents.x() * (1-(i&1)) - halfExtents.x() * (i&1),
halfExtents.y() * (1-((i&2)>>1)) - halfExtents.y() * ((i&2)>>1),
halfExtents.z() * (1-((i&4)>>2)) - halfExtents.z() * ((i&4)>>2));
}
virtual void getPlaneEquation(btVector4& plane,int i) const
{
btVector3 halfExtents = getHalfExtentsWithoutMargin();
switch (i)
{
case 0:
plane.setValue(btScalar(1.),btScalar(0.),btScalar(0.),-halfExtents.x());
break;
case 1:
plane.setValue(btScalar(-1.),btScalar(0.),btScalar(0.),-halfExtents.x());
break;
case 2:
plane.setValue(btScalar(0.),btScalar(1.),btScalar(0.),-halfExtents.y());
break;
case 3:
plane.setValue(btScalar(0.),btScalar(-1.),btScalar(0.),-halfExtents.y());
break;
case 4:
plane.setValue(btScalar(0.),btScalar(0.),btScalar(1.),-halfExtents.z());
break;
case 5:
plane.setValue(btScalar(0.),btScalar(0.),btScalar(-1.),-halfExtents.z());
break;
default:
btAssert(0);
}
}
virtual void getEdge(int i,btVector3& pa,btVector3& pb) const
//virtual void getEdge(int i,Edge& edge) const
{
int edgeVert0 = 0;
int edgeVert1 = 0;
switch (i)
{
case 0:
edgeVert0 = 0;
edgeVert1 = 1;
break;
case 1:
edgeVert0 = 0;
edgeVert1 = 2;
break;
case 2:
edgeVert0 = 1;
edgeVert1 = 3;
break;
case 3:
edgeVert0 = 2;
edgeVert1 = 3;
break;
case 4:
edgeVert0 = 0;
edgeVert1 = 4;
break;
case 5:
edgeVert0 = 1;
edgeVert1 = 5;
break;
case 6:
edgeVert0 = 2;
edgeVert1 = 6;
break;
case 7:
edgeVert0 = 3;
edgeVert1 = 7;
break;
case 8:
edgeVert0 = 4;
edgeVert1 = 5;
break;
case 9:
edgeVert0 = 4;
edgeVert1 = 6;
break;
case 10:
edgeVert0 = 5;
edgeVert1 = 7;
break;
case 11:
edgeVert0 = 6;
edgeVert1 = 7;
break;
default:
btAssert(0);
}
getVertex(edgeVert0,pa );
getVertex(edgeVert1,pb );
}
virtual bool isInside(const btVector3& pt,btScalar tolerance) const
{
btVector3 halfExtents = getHalfExtentsWithoutMargin();
//btScalar minDist = 2*tolerance;
bool result = (pt.x() <= (halfExtents.x()+tolerance)) &&
(pt.x() >= (-halfExtents.x()-tolerance)) &&
(pt.y() <= (halfExtents.y()+tolerance)) &&
(pt.y() >= (-halfExtents.y()-tolerance)) &&
(pt.z() <= (halfExtents.z()+tolerance)) &&
(pt.z() >= (-halfExtents.z()-tolerance));
return result;
}
//debugging
virtual const char* getName()const
{
return "Box";
}
virtual int getNumPreferredPenetrationDirections() const
{
return 6;
}
virtual void getPreferredPenetrationDirection(int index, btVector3& penetrationVector) const
{
switch (index)
{
case 0:
penetrationVector.setValue(btScalar(1.),btScalar(0.),btScalar(0.));
break;
case 1:
penetrationVector.setValue(btScalar(-1.),btScalar(0.),btScalar(0.));
break;
case 2:
penetrationVector.setValue(btScalar(0.),btScalar(1.),btScalar(0.));
break;
case 3:
penetrationVector.setValue(btScalar(0.),btScalar(-1.),btScalar(0.));
break;
case 4:
penetrationVector.setValue(btScalar(0.),btScalar(0.),btScalar(1.));
break;
case 5:
penetrationVector.setValue(btScalar(0.),btScalar(0.),btScalar(-1.));
break;
default:
btAssert(0);
}
}
};
#endif //BT_OBB_BOX_MINKOWSKI_H
| [
"github@alexlitty.com"
] | github@alexlitty.com |
3f4281f33746d0db30b09320a01bb3164ce2bc9e | 86c164c2af0779d80adbaa84c995e90541b923b8 | /plugins/com.phonegap.plugins.barcodescanner/src/ios/ZXingWidgetLibrary/ZXingWidgetLibrary/core/zxing/oned/OneDReader.h | 5fa01927f7f458ec9d6707cd2c05532e512e42ce | [
"Apache-2.0",
"MIT"
] | permissive | vinfo/personalID | 59cb1681e4fd2381c6490e8af23b4da78a498158 | 836c9fddb77cdfc076d0cff2b80d7b56b4666c98 | refs/heads/master | 2020-05-27T01:31:12.258354 | 2019-05-24T23:39:56 | 2019-05-24T23:39:56 | 188,438,768 | 0 | 0 | NOASSERTION | 2019-10-30T07:42:52 | 2019-05-24T14:44:54 | Java | UTF-8 | C++ | false | false | 2,277 | h | // -*- mode:c++; tab-width:2; indent-tabs-mode:nil; c-basic-offset:2 -*-
#ifndef __ONED_READER_H__
#define __ONED_READER_H__
/*
* OneDReader.h
* ZXing
*
* Copyright 2010 ZXing 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 "Reader.h"
namespace zxing {
namespace oned {
class OneDReader : public Reader {
private:
Ref<Result> doDecode(Ref<BinaryBitmap> image, DecodeHints hints);
protected:
static const int INTEGER_MATH_SHIFT = 8;
struct Range {
private:
int data[2];
public:
Range() {}
Range(int zero, int one) {
data[0] = zero;
data[1] = one;
}
int& operator [] (int index) {
return data[index];
}
int const& operator [] (int index) const {
return data[index];
}
};
static int patternMatchVariance(std::vector<int>& counters,
std::vector<int> const& pattern,
int maxIndividualVariance);
static int patternMatchVariance(std::vector<int>& counters,
int const pattern[],
int maxIndividualVariance);
protected:
static const int PATTERN_MATCH_RESULT_SCALE_FACTOR = 1 << INTEGER_MATH_SHIFT;
public:
OneDReader();
virtual Ref<Result> decode(Ref<BinaryBitmap> image, DecodeHints hints);
// Implementations must not throw any exceptions. If a barcode is not found on this row,
// a empty ref should be returned e.g. return Ref<Result>();
virtual Ref<Result> decodeRow(int rowNumber, Ref<BitArray> row) = 0;
static void recordPattern(Ref<BitArray> row,
int start,
std::vector<int>& counters);
virtual ~OneDReader();
};
}
}
#endif
| [
"victor.valencia@gmail.com"
] | victor.valencia@gmail.com |
f16025fc4e1e707ab9f0d7596acc605576f2a4b5 | 4bcc9806152542ab43fc2cf47c499424f200896c | /tensorflow/examples/custom_ops_doc/multiplex_2/multiplex_2_kernel.cc | bf42b49b55cd36df4570c487a4fde309bbd1fc6e | [
"Apache-2.0",
"LicenseRef-scancode-generic-cla",
"BSD-2-Clause"
] | permissive | tensorflow/tensorflow | 906276dbafcc70a941026aa5dc50425ef71ee282 | a7f3934a67900720af3d3b15389551483bee50b8 | refs/heads/master | 2023-08-25T04:24:41.611870 | 2023-08-25T04:06:24 | 2023-08-25T04:14:08 | 45,717,250 | 208,740 | 109,943 | Apache-2.0 | 2023-09-14T20:55:50 | 2015-11-07T01:19:20 | C++ | UTF-8 | C++ | false | false | 1,543 | cc | /* Copyright 2021 The TensorFlow 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 "tensorflow/examples/custom_ops_doc/multiplex_2/multiplex_2_kernel.h"
// Please use the appropriate namespace for your project
namespace tensorflow {
namespace custom_op_examples {
using CPUDevice = Eigen::ThreadPoolDevice;
// To support tensors containing different types (e.g. int32, float), one
// kernel per type is registered and is templatized by the "T" attr value.
// See go/tf-custom-ops-guide
#define REGISTER_KERNELS_CPU(type) \
REGISTER_KERNEL_BUILDER(Name("Examples>MultiplexDense") \
.Device(::tensorflow::DEVICE_CPU) \
.TypeConstraint<type>("T"), \
MultiplexDenseOp<CPUDevice, type>)
TF_CALL_ALL_TYPES(REGISTER_KERNELS_CPU);
#undef REGISTER_KERNELS_CPU
} // namespace custom_op_examples
} // namespace tensorflow
| [
"gardener@tensorflow.org"
] | gardener@tensorflow.org |
83669b4d74a0c157fbddb273b7664c8363cb9cf3 | c73288f7d678db17b08b72277b02f7dadb558ed8 | /lib/Time/examples/TimeArduinoDue/TimeArduinoDue.ino | a1470605ec18750d0503c21d7e85fdbb1df06e74 | [] | no_license | judsonc/esp-medidor | 608a13da63fbd9fd6141b48bb70fd487261823c9 | dbf0a3f173d9b6a565241fb9c6f3f7bae2111a72 | refs/heads/master | 2021-01-21T14:24:47.798039 | 2017-06-28T06:15:34 | 2017-06-28T06:15:34 | 95,278,608 | 0 | 1 | null | null | null | null | UTF-8 | C++ | false | false | 1,964 | ino | #include <Arduino.h>
/*
* TimeRTC.pde
* example code illustrating Time library with Real Time Clock.
*
* This example requires Markus Lange's Arduino Due RTC Library
* https://github.com/MarkusLange/Arduino-Due-RTC-Library
*/
#include <TimeLib.h>
#include <rtc_clock.h>
// Select the Slowclock source
//RTC_clock rtc_clock(RC);
RTC_clock rtc_clock(XTAL);
void setup() {
Serial.begin(9600);
rtc_clock.init();
if (rtc_clock.date_already_set() == 0) {
// Unfortunately, the Arduino Due hardware does not seem to
// be designed to maintain the RTC clock state when the
// board resets. Markus described it thusly: "Uhh the Due
// does reset with the NRSTB pin. This resets the full chip
// with all backup regions including RTC, RTT and SC. Only
// if the reset is done with the NRST pin will these regions
// stay with their old values."
rtc_clock.set_time(__TIME__);
rtc_clock.set_date(__DATE__);
// However, this might work on other unofficial SAM3X boards
// with different reset circuitry than Arduino Due?
}
setSyncProvider(getArduinoDueTime);
if(timeStatus()!= timeSet)
Serial.println("Unable to sync with the RTC");
else
Serial.println("RTC has set the system time");
}
time_t getArduinoDueTime()
{
return rtc_clock.unixtime();
}
void loop()
{
digitalClockDisplay();
delay(1000);
}
void digitalClockDisplay(){
// digital clock display of the time
Serial.print(hour());
printDigits(minute());
printDigits(second());
Serial.print(" ");
Serial.print(day());
Serial.print(" ");
Serial.print(month());
Serial.print(" ");
Serial.print(year());
Serial.println();
}
void printDigits(int digits){
// utility function for digital clock display: prints preceding colon and leading 0
Serial.print(":");
if(digits < 10)
Serial.print('0');
Serial.print(digits);
}
| [
"judson.scosta@hotmail.com"
] | judson.scosta@hotmail.com |
5a94fc0825251160c0fe1fe00c004a5520257395 | 9befd4e34b23e172f29bfa8c6a8ca3b6dd5fdb8e | /include/Console.h | 4463df36d9f7c11fefd4ff068f7bab7dceb04143 | [] | no_license | Toliak/BMSTU-AL-HW4 | 7b5c9e6a1cba7385864227ca7dde09df362b682d | 307a49eb02df24408f1f3e3b39fb10c0304feb80 | refs/heads/master | 2020-05-04T18:54:13.766686 | 2019-05-02T17:17:51 | 2019-05-02T17:17:51 | 179,371,002 | 5 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,855 | h | #pragma once
#include <string>
#include <unordered_map>
#include <list>
#include "Shortcut.h"
class Console
{
private:
std::istream *istream = nullptr;
std::ostream *ostream = nullptr;
std::list<std::string> prefixes = {};
public:
Console() = default;
Console(std::istream &istream, std::ostream &ostream)
: istream(&istream), ostream(&ostream)
{
}
std::istream &getIstream() const noexcept
{
return *istream;
}
std::ostream &getOstream() const noexcept
{
return *ostream;
}
std::list<std::string> &getPrefixes() noexcept
{
return prefixes;
}
void start() const
{
*ostream << "Welcome to the Toliak's DB.\nEnter 'help' to get available commands." << std::endl;
}
/**
* @brief Выводит текст, затем считывает строку, приводя ее к указанному типу
* @tparam T Приводимый тип
* @param output Вывод в поток, перед захватом строки
* @return Приводимый тип, переведенный из строки
*/
template<typename T>
T pureInput(const std::string &output)
{
*ostream << output;
std::string input;
std::getline(*istream, input);
return fromString<T>(input);
}
/**
* @brief Считывает строки из консоли
* @return Введенная строка
*/
std::string getLine();
/**
* @brief Разделяет строку на команду и аргументы
* @param line Исходная строка
* @return Пара строк вида (команда, аргуметы)
*/
static std::pair<std::string, std::string> divideCommand(const std::string &line);
}; | [
"ibolosik@gmail.com"
] | ibolosik@gmail.com |
f6e3ebb8414b7c4060407c7d039bfc2c35071aa9 | 794ec36417d1f5fe9f8a8dfefee17169ba346447 | /UESTC/205/10148932_AC_267ms_5084kB.cpp | 29ebea2653fb4f95d79e26b0b66aa5b9a06b1099 | [] | no_license | riba2534/My_ACM_Code | 1d2f7dacb50f7e9ed719484419b3a7a41ba407cf | fa914ca98ad0794073bc1ccac8ab7dca4fe13f25 | refs/heads/master | 2020-03-24T01:19:19.889558 | 2019-03-11T03:01:09 | 2019-03-11T03:01:09 | 142,331,120 | 3 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,523 | cpp | #include <cstdio>
#include <cstring>
#include <cctype>
#include <string>
#include <set>
#include <iostream>
#include <stack>
#include <cmath>
#include <queue>
#include <vector>
#include <algorithm>
#define mem(a,b) memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
#define N 101000
#define ll long long
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
ll sum[N<<2],lazy[N<<2];
void pushup(ll rt)
{
sum[rt]=sum[rt<<1]+sum[rt<<1|1];
}
void pushdown(ll rt,ll m)
{
if(lazy[rt])
{
lazy[rt<<1]+=lazy[rt];
lazy[rt<<1|1]+=lazy[rt];
sum[rt<<1]+=lazy[rt]*(m-(m>>1));
sum[rt<<1|1]+=lazy[rt]*(m>>1);
lazy[rt]=0;
}
}
void build(ll l,ll r,ll rt)
{
lazy[rt]=0;
if(l==r)
{
scanf("%lld",&sum[rt]);
return;
}
ll m=(l+r)>>1;
build(lson);
build(rson);
pushup(rt);
}
void update(ll L,ll R,ll c,ll l,ll r,ll rt)
{
if(L<=l&&r<=R)
{
lazy[rt]+=c;
sum[rt]+=(ll)c*(r-l+1);
return;
}
pushdown(rt,r-l+1);
ll m=(l+r)>>1;
if(L<=m) update(L,R,c,lson);
if(m<R) update(L,R,c,rson);
pushup(rt);
}
ll query(ll L,ll R,ll l,ll r,ll rt)
{
if(L<=l&&r<=R)
return sum[rt];
pushdown(rt,r-l+1);
ll m=(l+r)>>1;
ll ans=0;
if(L<=m)
ans+=query(L,R,lson);
if(R>m)
ans+=query(L,R,rson);
return ans;
}
int main()
{
ll n,m,a,b,c;
char s[5];
scanf("%lld%lld",&n,&m);
build(1,n,1);
while(m--)
{
scanf("%s",s);
if(s[0]=='Q')
{
scanf("%lld%lld",&a,&b);
printf("%lld\n",query(a,b,1,n,1));
}
if(s[0]=='C')
{
scanf("%lld%lld%lld",&a,&b,&c);
update(a,b,c,1,n,1);
}
}
return 0;
}
| [
"riba2534@qq.com"
] | riba2534@qq.com |
aee8fbe73a254b2acfb414e7ef448640f72eb351 | d3a8d73036e63168b5d461564073c9c8da114a48 | /EulerP67/main.cpp | f27182a584eaf93477ab72ce6b6379e4e5ee4e3d | [] | no_license | BhandariRupraj/projecteuler | 42cb7b87c2e28129ee19ec0e3f07d7e05f629635 | 5e8aae487daa571b88f6a26bae323fb062a3a036 | refs/heads/master | 2021-08-23T21:57:23.374612 | 2017-12-06T18:21:51 | 2017-12-06T18:21:51 | 109,030,162 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,503 | cpp | #include <fstream>
#include <iostream>
#include <sstream>
#include <vector>
#include <algorithm>
using namespace std;
const string INPUT_FILE_NAME = "C:/Users/s521059/CLionProjects/Euler Project/EulerP67/p067_triangle.txt";
void parseFile(ifstream& inFile, vector<vector<unsigned> >& lines);
// Returns the sum of the optimal path through the triangle
unsigned calculate(vector<vector<unsigned> >& lines);
int main() {
ifstream inFile;
inFile.open(INPUT_FILE_NAME.c_str());
// 1D=lines 2D=numbers in each line
vector<vector<unsigned> > lines;
parseFile(inFile, lines);
cout << calculate(lines) << endl;
}
void parseFile(ifstream& inFile, vector<vector<unsigned> >& lines) {
string line;
unsigned number;
while (getline(inFile, line)) {
lines.push_back(vector<unsigned> ());
istringstream stringStream(line);
while (stringStream >> number)
lines.back().push_back(number);
}
reverse(lines.begin(), lines.end());
}
unsigned calculate(vector<vector<unsigned> >& lines) {
// Starting at the bottom of the triangle...
for (int k = 0; k < lines.size() - 1; ++k) {
vector<unsigned>& current = lines.at(k);
vector<unsigned>& next = lines.at(k + 1);
for (int i = 0; i < current.size() - 1; i++)
if (current[i] >= current[i + 1]) next[i] += current[i];
else next[i] += current[i + 1];
}
// the new value at top of the triangle
return lines.back()[0];
} | [
"noreply@github.com"
] | BhandariRupraj.noreply@github.com |
64f9bebee5581c36b7b2a3ba9859e0d7b2e9473e | e0012591e312e6578f91ee720a313f1e4d629e99 | /3a713236.cpp | c2d181d5d9a0d876290bc3be5eb076d15fdef80b | [] | no_license | joe881118/basic-homework23 | 68a05f6f7418052bb2d6638ced7b4d8635969585 | 912016a534eab3035e730d8686540eb55cbc9049 | refs/heads/master | 2020-05-30T03:35:34.757998 | 2019-05-31T03:14:32 | 2019-05-31T03:14:32 | 189,519,207 | 0 | 0 | null | null | null | null | WINDOWS-1252 | C++ | false | false | 322 | cpp | #include<stdio.h>
#include<stdlib.h>
int main(void){
FILE *fptr;
char ch;
fptr=fopen("data.txt","r");
if(fptr!=NULL){
while((ch=getc(fptr))!=EOF){
printf("%c", ch);
}
fclose(fptr);
}
else{
printf("3a713236 ³¯¯q³¹");
}
system("pause");
return 0;
}
| [
"noreply@github.com"
] | joe881118.noreply@github.com |
cde4fc3ecff55e901b481eec2af0d9bcf8614d4d | 4c4a17ddb659849c0e46df83ef910cc5e74a6afd | /src/marnav/seatalk/message_89.hpp | ff5ce3c008215993f8d4bff6f6584bd667f518ae | [
"BSD-3-Clause",
"BSD-4-Clause"
] | permissive | Kasetkin/marnav | 39e8754d8c0223b4c99df0799b5d259024d240c8 | 7cb912387d6f66dc3e9201c2f4cdabed86f08e16 | refs/heads/master | 2021-01-23T05:03:51.172254 | 2017-03-19T23:08:16 | 2017-03-19T23:08:16 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,243 | hpp | #ifndef MARNAV__SEATALK__MESSAGE_89__HPP
#define MARNAV__SEATALK__MESSAGE_89__HPP
#include <marnav/seatalk/message.hpp>
namespace marnav
{
namespace seatalk
{
/// @brief Compass heading sent by ST40 compass instrument
///
/// @code
/// 89 U2 VW XY 2Z
///
/// Compass heading sent by ST40 compass instrument
/// (it is read as a compass heading by the ST1000(+) or ST2000(+) autopilot)
/// Compass heading in degrees:
/// The two lower bits of U * 90 +
/// the six lower bits of VW * 2 +
/// the two higher bits of U / 2 =
///
/// The meaning of XY and Z is unknown.
/// @endcode
///
class message_89 : public message
{
public:
constexpr static const message_id ID = message_id::st40_compass_heading;
constexpr static size_t SIZE = 5;
message_89();
message_89(const message_89 &) = default;
message_89 & operator=(const message_89 &) = default;
virtual raw get_data() const override;
static std::unique_ptr<message> parse(const raw & data);
private:
double value;
public:
/// Returns the heading in degrees, resolution of `0.5` degrees.
///
/// This value will always be in the interval `[0.0 .. 359.5]`.
double get_heading() const noexcept { return value; }
void set_heading(double t);
};
}
}
#endif
| [
"mario.konrad@gmx.net"
] | mario.konrad@gmx.net |
c8e9c2355dc4f24287945b3b9b714ac5e16d76c4 | 3edd3da6213c96cf342dc842e8b43fe2358c960d | /abc/abc060/c/main.cpp | 838222def1dd4cfd6486d96ee908d4a681627172 | [] | no_license | tic40/atcoder | 7c5d12cc147741d90a1f5f52ceddd708b103bace | 3c8ff68fe73e101baa2aff955bed077cae893e52 | refs/heads/main | 2023-08-30T20:10:32.191136 | 2023-08-30T00:58:07 | 2023-08-30T00:58:07 | 179,283,303 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 270 | cpp | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
using ll = long long;
int main() {
int t,n,T,ans=0,y=0; cin >> n >> T;
REP(i,n) {
cin >> t;
ans += min(T,t-y);
y = t;
}
cout << ans + T << endl;
return 0;
} | [
"ccpzjoh@gmail.com"
] | ccpzjoh@gmail.com |
541dc949044b21600d132257e2bea5ff37145e6d | 1f69ad2e0e3a4f95128552116e0b6f9d178ffbee | /sgm-vulkan/sgm-vulkan.h | b9cf8749ec9e09f91989c0986d8ef8837fc37eb4 | [] | no_license | AbyssGaze/stereo-sgm-opencl | 59feb4cb26e528e8a2a2c92aa873157ffbf5197c | c14471392df338bbf72689b96c4804060f5bc082 | refs/heads/master | 2021-01-02T09:18:51.809612 | 2017-06-24T19:45:20 | 2017-06-24T19:45:20 | 99,192,400 | 2 | 0 | null | 2017-08-03T04:59:33 | 2017-08-03T04:59:33 | null | UTF-8 | C++ | false | false | 2,019 | h | #pragma once
#include <vulkan/vulkan.hpp>
class StereoSGMVULKAN
{
public:
StereoSGMVULKAN(int width, int height, int max_disp_size);
~StereoSGMVULKAN();
bool init();
void execute(void * left_data, void * right_data, void * output_buffer);
private:
void initVulkan();
void census();
void mem_init();
void matching_cost();
void scan_cost();
void winner_takes_all();
void median();
void check_consistency_left();
private:
int m_width = -1;
int m_height = -1;
int m_max_disparity = -1;
bool m_enable_validation = true;
vk::Instance m_vk_instance;
vk::PhysicalDevice m_vk_physical_device;
vk::PhysicalDeviceFeatures m_vk_device_features;
vk::Device m_vk_device;
vk::Queue m_vk_queue;
PFN_vkCreateDebugReportCallbackEXT CreateDebugReportCallback = VK_NULL_HANDLE;
PFN_vkDestroyDebugReportCallbackEXT DestroyDebugReportCallback = VK_NULL_HANDLE;
PFN_vkDebugReportMessageEXT dbgBreakCallback = VK_NULL_HANDLE;
VkDebugReportCallbackEXT msgCallback;
// cl::Context m_context;
// cl::CommandQueue m_command_queue;
// cl::Program m_program;
// cl::Device m_device;
// //cl::Kernel
// //buffers
//
//
//
// cl::Kernel m_census_kernel;
// cl::Kernel m_matching_cost_kernel_128;
//
// cl::Kernel m_compute_stereo_horizontal_dir_kernel_0;
// cl::Kernel m_compute_stereo_horizontal_dir_kernel_4;
// cl::Kernel m_compute_stereo_vertical_dir_kernel_2;
// cl::Kernel m_compute_stereo_vertical_dir_kernel_6;
//
// cl::Kernel m_compute_stereo_oblique_dir_kernel_1;
// cl::Kernel m_compute_stereo_oblique_dir_kernel_3;
// cl::Kernel m_compute_stereo_oblique_dir_kernel_5;
// cl::Kernel m_compute_stereo_oblique_dir_kernel_7;
//
//
// cl::Kernel m_winner_takes_all_kernel128;
//
// cl::Kernel m_check_consistency_left;
//
// cl::Kernel m_median_3x3;
//
// cl::Kernel m_copy_u8_to_u16;
// cl::Kernel m_clear_buffer;
//
//
vk::Buffer d_src_left, d_src_right, d_left, d_right, d_matching_cost,
d_scost, d_left_disparity, d_right_disparity,
d_tmp_left_disp, d_tmp_right_disp;
}; | [
"siposcsaba89@live.com"
] | siposcsaba89@live.com |
dfb82ee6e2232980d48b9d2b18d862c4bb30e925 | 46fc9ccf00cc6e59e31a7ad9914e06ba5d76edf2 | /src/qt/dogecash/settings/settingssignmessagewidgets.h | 1cd3cbcc3a0dede462df5970b5e0fdd5863397a6 | [
"MIT"
] | permissive | Grimer123/dogecash | c5618a304fa84860f56ca6dc6ddf626ee9ef591c | 86efd92f340187a972f0b8d5b9778c65bbe34ef2 | refs/heads/master | 2020-09-12T13:14:54.871320 | 2019-11-17T23:28:37 | 2019-11-17T23:28:37 | 222,436,653 | 0 | 0 | MIT | 2019-11-18T11:47:56 | 2019-11-18T11:47:55 | null | UTF-8 | C++ | false | false | 1,269 | h | // Copyright (c) 2019 The DogeCash developers
// Copyright (c) 2019 The PIVX developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#ifndef SETTINGSSIGNMESSAGEWIDGETS_H
#define SETTINGSSIGNMESSAGEWIDGETS_H
#include <QWidget>
#include "qt/dogecash/pwidget.h"
#include "qt/dogecash/contactsdropdown.h"
namespace Ui {
class SettingsSignMessageWidgets;
}
class SettingsSignMessageWidgets : public PWidget
{
Q_OBJECT
public:
explicit SettingsSignMessageWidgets(DogeCashGUI* _window, QWidget *parent = nullptr);
~SettingsSignMessageWidgets();
void setAddress_SM(const QString& address);
protected:
void resizeEvent(QResizeEvent *event) override;
public slots:
void onSignMessageButtonSMClicked();
void onVerifyMessage();
void onPasteButtonSMClicked();
void onAddressBookButtonSMClicked();
void onGoClicked();
void onClearAll();
void onAddressesClicked();
void onModeSelected(bool isSign);
void updateMode();
private:
Ui::SettingsSignMessageWidgets *ui;
QAction *btnContact;
ContactsDropdown *menuContacts = nullptr;
bool isSign = true;
void resizeMenu();
};
#endif // SETTINGSSIGNMESSAGEWIDGETS_H
| [
"akshaycm@hotmail.com"
] | akshaycm@hotmail.com |
8ed41a845798203dcbf6d07590d02fc4dc1ff44e | 0eff74b05b60098333ad66cf801bdd93becc9ea4 | /second/download/xgboost/xgboost-old-new/xgboost-old-new/dmlc_xgboost_old_file_386.cpp | fd6800ce49b09016987cb799bcf2c130fe8f2c66 | [] | no_license | niuxu18/logTracker-old | 97543445ea7e414ed40bdc681239365d33418975 | f2b060f13a0295387fe02187543db124916eb446 | refs/heads/master | 2021-09-13T21:39:37.686481 | 2017-12-11T03:36:34 | 2017-12-11T03:36:34 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 17,825 | cpp | #ifndef XGBOOST_REGRANK_H
#define XGBOOST_REGRANK_H
/*!
* \file xgboost_regrank.h
* \brief class for gradient boosted regression and ranking
* \author Kailong Chen: chenkl198812@gmail.com, Tianqi Chen: tianqi.tchen@gmail.com
*/
#include <cmath>
#include <cstdlib>
#include <cstring>
#include "xgboost_regrank_data.h"
#include "xgboost_regrank_eval.h"
#include "xgboost_regrank_obj.h"
#include "../utils/xgboost_omp.h"
#include "../booster/xgboost_gbmbase.h"
#include "../utils/xgboost_utils.h"
#include "../utils/xgboost_stream.h"
namespace xgboost{
namespace regrank{
/*! \brief class for gradient boosted regression and ranking */
class RegRankBoostLearner{
public:
/*! \brief constructor */
RegRankBoostLearner(void){
silent = 0;
obj_ = NULL;
name_obj_ = "reg:linear";
}
/*! \brief destructor */
~RegRankBoostLearner(void){
if( obj_ != NULL ) delete obj_;
}
/*!
* \brief a regression booter associated with training and evaluating data
* \param mats array of pointers to matrix whose prediction result need to be cached
*/
RegRankBoostLearner(const std::vector<DMatrix *>& mats){
silent = 0;
obj_ = NULL;
name_obj_ = "reg:linear";
this->SetCacheData(mats);
}
/*!
* \brief add internal cache space for mat, this can speedup prediction for matrix,
* please cache prediction for training and eval data
* warning: if the model is loaded from file from some previous training history
* set cache data must be called with exactly SAME
* data matrices to continue training otherwise it will cause error
* \param mats array of pointers to matrix whose prediction result need to be cached
*/
inline void SetCacheData(const std::vector<DMatrix *>& mats){
// estimate feature bound
int num_feature = 0;
// assign buffer index
unsigned buffer_size = 0;
utils::Assert( cache_.size() == 0, "can only call cache data once" );
for( size_t i = 0; i < mats.size(); ++i ){
bool dupilicate = false;
for( size_t j = 0; j < i; ++ j ){
if( mats[i] == mats[j] ) dupilicate = true;
}
if( dupilicate ) continue;
// set mats[i]'s cache learner pointer to this
mats[i]->cache_learner_ptr_ = this;
cache_.push_back( CacheEntry( mats[i], buffer_size, mats[i]->Size() ) );
buffer_size += static_cast<unsigned>(mats[i]->Size());
num_feature = std::max(num_feature, (int)(mats[i]->data.NumCol()));
}
char str_temp[25];
if (num_feature > mparam.num_feature){
mparam.num_feature = num_feature;
sprintf(str_temp, "%d", num_feature);
base_gbm.SetParam("bst:num_feature", str_temp);
}
sprintf(str_temp, "%u", buffer_size);
base_gbm.SetParam("num_pbuffer", str_temp);
if (!silent){
printf("buffer_size=%u\n", buffer_size);
}
}
/*!
* \brief set parameters from outside
* \param name name of the parameter
* \param val value of the parameter
*/
inline void SetParam(const char *name, const char *val){
if (!strcmp(name, "silent")) silent = atoi(val);
if (!strcmp(name, "eval_metric")) evaluator_.AddEval(val);
if (!strcmp(name, "objective") ) name_obj_ = val;
if (!strcmp(name, "num_class") ) base_gbm.SetParam("num_booster_group", val );
mparam.SetParam(name, val);
base_gbm.SetParam(name, val);
cfg_.push_back( std::make_pair( std::string(name), std::string(val) ) );
}
/*!
* \brief initialize solver before training, called before training
* this function is reserved for solver to allocate necessary space and do other preparation
*/
inline void InitTrainer(void){
if( mparam.num_class != 0 ){
if( name_obj_ != "multi:softmax" ){
name_obj_ = "multi:softmax";
printf("auto select objective=softmax to support multi-class classification\n" );
}
}
base_gbm.InitTrainer();
obj_ = CreateObjFunction( name_obj_.c_str() );
for( size_t i = 0; i < cfg_.size(); ++ i ){
obj_->SetParam( cfg_[i].first.c_str(), cfg_[i].second.c_str() );
}
evaluator_.AddEval( obj_->DefaultEvalMetric() );
}
/*!
* \brief initialize the current data storage for model, if the model is used first time, call this function
*/
inline void InitModel(void){
base_gbm.InitModel();
mparam.AdjustBase(name_obj_.c_str());
}
/*!
* \brief load model from file
* \param fname file name
*/
inline void LoadModel(const char *fname){
utils::FileStream fi(utils::FopenCheck(fname, "rb"));
this->LoadModel(fi);
fi.Close();
}
/*!
* \brief load model from stream
* \param fi input stream
*/
inline void LoadModel(utils::IStream &fi){
base_gbm.LoadModel(fi);
utils::Assert(fi.Read(&mparam, sizeof(ModelParam)) != 0);
}
/*!
* \brief DumpModel
* \param fo text file
* \param fmap feature map that may help give interpretations of feature
* \param with_stats whether print statistics as well
*/
inline void DumpModel(FILE *fo, const utils::FeatMap& fmap, bool with_stats){
base_gbm.DumpModel(fo, fmap, with_stats);
}
/*!
* \brief Dump path of all trees
* \param fo text file
* \param data input data
*/
inline void DumpPath(FILE *fo, const DMatrix &data){
base_gbm.DumpPath(fo, data.data);
}
/*!
* \brief save model to stream
* \param fo output stream
*/
inline void SaveModel(utils::IStream &fo) const{
base_gbm.SaveModel(fo);
fo.Write(&mparam, sizeof(ModelParam));
}
/*!
* \brief save model into file
* \param fname file name
*/
inline void SaveModel(const char *fname) const{
utils::FileStream fo(utils::FopenCheck(fname, "wb"));
this->SaveModel(fo);
fo.Close();
}
/*!
* \brief update the model for one iteration
*/
inline void UpdateOneIter(const DMatrix &train){
this->PredictRaw(preds_, train);
obj_->GetGradient(preds_, train.info, base_gbm.NumBoosters(), grad_, hess_);
if( grad_.size() == train.Size() ){
base_gbm.DoBoost(grad_, hess_, train.data, train.info.root_index);
}else{
int ngroup = base_gbm.NumBoosterGroup();
utils::Assert( grad_.size() == train.Size() * (size_t)ngroup, "BUG: UpdateOneIter: mclass" );
std::vector<float> tgrad( train.Size() ), thess( train.Size() );
for( int g = 0; g < ngroup; ++ g ){
memcpy( &tgrad[0], &grad_[g*tgrad.size()], sizeof(float)*tgrad.size() );
memcpy( &thess[0], &hess_[g*tgrad.size()], sizeof(float)*tgrad.size() );
base_gbm.DoBoost(tgrad, thess, train.data, train.info.root_index, g );
}
}
}
/*!
* \brief evaluate the model for specific iteration
* \param iter iteration number
* \param evals datas i want to evaluate
* \param evname name of each dataset
* \param fo file to output log
*/
inline void EvalOneIter(int iter,
const std::vector<const DMatrix*> &evals,
const std::vector<std::string> &evname,
FILE *fo=stderr ){
fprintf(fo, "[%d]", iter);
for (size_t i = 0; i < evals.size(); ++i){
this->PredictRaw(preds_, *evals[i]);
obj_->PredTransform(preds_);
evaluator_.Eval(fo, evname[i].c_str(), preds_, evals[i]->info);
}
fprintf(fo, "\n");
fflush(fo);
}
/*!
* \brief get prediction
* \param storage to store prediction
* \param data input data
* \param bst_group booster group we are in
*/
inline void Predict(std::vector<float> &preds, const DMatrix &data, int bst_group = -1){
this->PredictRaw( preds, data, bst_group );
obj_->PredTransform( preds );
}
public:
/*!
* \brief interactive update
* \param action action type
* \parma train training data
*/
inline void UpdateInteract(std::string action, const DMatrix& train){
for(size_t i = 0; i < cache_.size(); ++i){
this->InteractPredict(preds_, *cache_[i].mat_);
}
if (action == "remove"){
base_gbm.DelteBooster(); return;
}
obj_->GetGradient(preds_, train.info, base_gbm.NumBoosters(), grad_, hess_);
std::vector<unsigned> root_index;
base_gbm.DoBoost(grad_, hess_, train.data, root_index);
for(size_t i = 0; i < cache_.size(); ++i){
this->InteractRePredict(*cache_[i].mat_);
}
}
private:
/*! \brief get the transformed predictions, given data */
inline void InteractPredict(std::vector<float> &preds, const DMatrix &data){
int buffer_offset = this->FindBufferOffset(data);
utils::Assert( buffer_offset >=0, "interact mode must cache training data" );
preds.resize(data.Size());
const unsigned ndata = static_cast<unsigned>(data.Size());
#pragma omp parallel for schedule( static )
for (unsigned j = 0; j < ndata; ++j){
preds[j] = mparam.base_score + base_gbm.InteractPredict(data.data, j, buffer_offset + j);
}
obj_->PredTransform( preds );
}
/*! \brief repredict trial */
inline void InteractRePredict(const DMatrix &data){
int buffer_offset = this->FindBufferOffset(data);
utils::Assert( buffer_offset >=0, "interact mode must cache training data" );
const unsigned ndata = static_cast<unsigned>(data.Size());
#pragma omp parallel for schedule( static )
for (unsigned j = 0; j < ndata; ++j){
base_gbm.InteractRePredict(data.data, j, buffer_offset + j);
}
}
/*! \brief get un-transformed prediction*/
inline void PredictRaw(std::vector<float> &preds, const DMatrix &data, int bst_group = -1 ){
int buffer_offset = this->FindBufferOffset(data);
if( bst_group < 0 ){
int ngroup = base_gbm.NumBoosterGroup();
preds.resize( data.Size() * ngroup );
for( int g = 0; g < ngroup; ++ g ){
this->PredictBuffer(&preds[ data.Size() * g ], data, buffer_offset, g );
}
}else{
preds.resize( data.Size() );
this->PredictBuffer(&preds[0], data, buffer_offset, bst_group );
}
}
/*! \brief get the un-transformed predictions, given data */
inline void PredictBuffer(float *preds, const DMatrix &data, int buffer_offset, int bst_group ){
const unsigned ndata = static_cast<unsigned>(data.Size());
if( buffer_offset >= 0 ){
#pragma omp parallel for schedule( static )
for (unsigned j = 0; j < ndata; ++j){
preds[j] = mparam.base_score + base_gbm.Predict(data.data, j, buffer_offset + j, data.info.GetRoot(j), bst_group );
}
}else
#pragma omp parallel for schedule( static )
for (unsigned j = 0; j < ndata; ++j){
preds[j] = mparam.base_score + base_gbm.Predict(data.data, j, -1, data.info.GetRoot(j), bst_group );
}{
}
}
private:
/*! \brief training parameter for regression */
struct ModelParam{
/* \brief global bias */
float base_score;
/* \brief type of loss function */
int loss_type;
/* \brief number of features */
int num_feature;
/* \brief number of class, if it is multi-class classification */
int num_class;
/*! \brief reserved field */
int reserved[15];
/*! \brief constructor */
ModelParam(void){
base_score = 0.5f;
loss_type = -1;
num_feature = 0;
num_class = 0;
memset(reserved, 0, sizeof(reserved));
}
/*!
* \brief set parameters from outside
* \param name name of the parameter
* \param val value of the parameter
*/
inline void SetParam(const char *name, const char *val){
if (!strcmp("base_score", name)) base_score = (float)atof(val);
if (!strcmp("num_class", name)) num_class = atoi(val);
if (!strcmp("loss_type", name)) loss_type = atoi(val);
if (!strcmp("bst:num_feature", name)) num_feature = atoi(val);
}
/*!
* \brief adjust base_score based on loss type and objective function
*/
inline void AdjustBase(const char *obj){
// some tweaks for loss type
if( loss_type == -1 ){
loss_type = 1;
if( !strcmp("reg:linear", obj ) ) loss_type = 0;
}
if (loss_type == 1 || loss_type == 2|| loss_type == 3){
utils::Assert(base_score > 0.0f && base_score < 1.0f, "sigmoid range constrain");
base_score = -logf(1.0f / base_score - 1.0f);
}
}
};
private:
struct CacheEntry{
const DMatrix *mat_;
int buffer_offset_;
size_t num_row_;
CacheEntry(const DMatrix *mat, int buffer_offset, size_t num_row)
:mat_(mat), buffer_offset_(buffer_offset), num_row_(num_row){}
};
/*! \brief the entries indicates that we have internal prediction cache */
std::vector<CacheEntry> cache_;
private:
// find internal bufer offset for certain matrix, if not exist, return -1
inline int FindBufferOffset(const DMatrix &mat){
for(size_t i = 0; i < cache_.size(); ++i){
if( cache_[i].mat_ == &mat && mat.cache_learner_ptr_ == this ) {
if( cache_[i].num_row_ == mat.Size() ){
return cache_[i].buffer_offset_;
}else{
fprintf( stderr, "warning: number of rows in input matrix changed as remembered in cachelist, ignore cached results\n" );
fflush( stderr );
}
}
}
return -1;
}
protected:
int silent;
EvalSet evaluator_;
booster::GBMBase base_gbm;
ModelParam mparam;
// objective fnction
IObjFunction *obj_;
// name of objective function
std::string name_obj_;
std::vector< std::pair<std::string, std::string> > cfg_;
protected:
std::vector<float> grad_, hess_, preds_;
};
}
};
#endif
| [
"993273596@qq.com"
] | 993273596@qq.com |
3f81d43cf5b328d327697395db2fae44d8566bbe | 5525d270883134aff70cc686ca3be2484ceffb9c | /src/app/widget/Vector.h | 80d830a7d09583d9e0882a6405fe55c878c209bf | [] | no_license | WilstonOreo/Tomo | 7907a3811c19b70eb64c978ce0feba291adb9e5c | c5bcdd18878f7950b8e5f607d3d48aaf9d95a05e | refs/heads/master | 2021-01-19T01:26:39.373934 | 2016-06-21T11:43:02 | 2016-06-21T11:43:02 | 61,629,539 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 482 | h | #pragma once
#include "ui_Vector.h"
#include <tomo/base/gex.hpp>
namespace tomo
{
namespace widget
{
class Vector : public QWidget, public Ui::Vector
{
Q_OBJECT
public:
Vector(QWidget* _parent =nullptr);
~Vector();
void setValue(const Vec3&);
TBD_PROPERTY_REF_RO(Vec3,value)
private slots:
void changeX(double);
void changeY(double);
void changeZ(double);
signals:
void valueChanged();
};
}
}
| [
"m@cr8tr.org"
] | m@cr8tr.org |
7d577e9630d1771cea12874c7db5ba7a6990668f | 37aed740a238ff7b083c769a01361b3050cde7fb | /cpp04/ex01/main.cpp | e8f16fb4991c528dc4ed67a5e678a8ffb2393b90 | [] | no_license | nawaraing/cppModule | e96961510b7974203befb5edd4d9a336696ddb59 | 437265c5070fd2714d20fea36248d22e2515ed34 | refs/heads/master | 2023-03-28T18:00:36.821494 | 2021-03-29T11:40:53 | 2021-03-29T11:40:53 | 340,276,195 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 503 | cpp | #include "Character.hpp"
#include "PowerFist.hpp"
#include "PlasmaRifle.hpp"
#include "RadScorpion.hpp"
#include "SuperMutant.hpp"
int main()
{
Character* me = new Character("me");
std::cout << *me;
Enemy* b = new RadScorpion();
AWeapon* pr = new PlasmaRifle();
AWeapon* pf = new PowerFist();
me->equip(pr);
std::cout << *me;
me->equip(pf);
me->attack(b);
std::cout << *me;
me->equip(pr);
std::cout << *me;
me->attack(b);
std::cout << *me;
me->attack(b);
std::cout << *me;
return 0;
} | [
"nawaddaing@gmail.com"
] | nawaddaing@gmail.com |
f8c521a28e3b1c67df0859c1c568b0acab804040 | 0fc3861eca64f9a7b145ec67a71108e6f4ea025a | /Protobuf.CPP/Protos/SeverSocketMessages.pb.h | de388529104a2669f0622f36d65b2235502651da | [] | no_license | lobboAngelov/FlexSoft.CommonProto | 40b80565dcb7ca36d2106ab2b273c7a1f1d7dcaa | 6580857b7d70bea32abb8a0e795975e8082bf0f4 | refs/heads/master | 2020-03-06T22:59:48.045562 | 2018-03-31T13:26:08 | 2018-03-31T13:26:08 | 127,120,091 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | true | 24,545 | h | // Generated by the protocol buffer compiler. DO NOT EDIT!
// source: Protos/SeverSocketMessages.proto
#ifndef PROTOBUF_Protos_2fSeverSocketMessages_2eproto__INCLUDED
#define PROTOBUF_Protos_2fSeverSocketMessages_2eproto__INCLUDED
#include <string>
#include <google/protobuf/stubs/common.h>
#if GOOGLE_PROTOBUF_VERSION < 3005000
#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 3005001 < GOOGLE_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/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/metadata.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)
namespace protobuf_Protos_2fSeverSocketMessages_2eproto {
// Internal implementation detail -- do not use these members.
struct TableStruct {
static const ::google::protobuf::internal::ParseTableField entries[];
static const ::google::protobuf::internal::AuxillaryParseTableField aux[];
static const ::google::protobuf::internal::ParseTable schema[4];
static const ::google::protobuf::internal::FieldMetadata field_metadata[];
static const ::google::protobuf::internal::SerializationTable serialization_table[];
static const ::google::protobuf::uint32 offsets[];
};
void AddDescriptors();
void InitDefaultsTESTImpl();
void InitDefaultsTEST();
void InitDefaultsServerMessageImpl();
void InitDefaultsServerMessage();
void InitDefaultsArduinoConnectedImpl();
void InitDefaultsArduinoConnected();
void InitDefaultsClientConnectedImpl();
void InitDefaultsClientConnected();
inline void InitDefaults() {
InitDefaultsTEST();
InitDefaultsServerMessage();
InitDefaultsArduinoConnected();
InitDefaultsClientConnected();
}
} // namespace protobuf_Protos_2fSeverSocketMessages_2eproto
class ArduinoConnected;
class ArduinoConnectedDefaultTypeInternal;
extern ArduinoConnectedDefaultTypeInternal _ArduinoConnected_default_instance_;
class ClientConnected;
class ClientConnectedDefaultTypeInternal;
extern ClientConnectedDefaultTypeInternal _ClientConnected_default_instance_;
class ServerMessage;
class ServerMessageDefaultTypeInternal;
extern ServerMessageDefaultTypeInternal _ServerMessage_default_instance_;
class TEST;
class TESTDefaultTypeInternal;
extern TESTDefaultTypeInternal _TEST_default_instance_;
// ===================================================================
class TEST : public ::google::protobuf::Message /* @@protoc_insertion_point(class_definition:TEST) */ {
public:
TEST();
virtual ~TEST();
TEST(const TEST& from);
inline TEST& operator=(const TEST& from) {
CopyFrom(from);
return *this;
}
#if LANG_CXX11
TEST(TEST&& from) noexcept
: TEST() {
*this = ::std::move(from);
}
inline TEST& operator=(TEST&& from) noexcept {
if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) {
if (this != &from) InternalSwap(&from);
} else {
CopyFrom(from);
}
return *this;
}
#endif
static const ::google::protobuf::Descriptor* descriptor();
static const TEST& default_instance();
static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY
static inline const TEST* internal_default_instance() {
return reinterpret_cast<const TEST*>(
&_TEST_default_instance_);
}
static PROTOBUF_CONSTEXPR int const kIndexInFileMessages =
0;
void Swap(TEST* other);
friend void swap(TEST& a, TEST& b) {
a.Swap(&b);
}
// implements Message ----------------------------------------------
inline TEST* New() const PROTOBUF_FINAL { return New(NULL); }
TEST* New(::google::protobuf::Arena* arena) const PROTOBUF_FINAL;
void CopyFrom(const ::google::protobuf::Message& from) PROTOBUF_FINAL;
void MergeFrom(const ::google::protobuf::Message& from) PROTOBUF_FINAL;
void CopyFrom(const TEST& from);
void MergeFrom(const TEST& from);
void Clear() PROTOBUF_FINAL;
bool IsInitialized() const PROTOBUF_FINAL;
size_t ByteSizeLong() const PROTOBUF_FINAL;
bool MergePartialFromCodedStream(
::google::protobuf::io::CodedInputStream* input) PROTOBUF_FINAL;
void SerializeWithCachedSizes(
::google::protobuf::io::CodedOutputStream* output) const PROTOBUF_FINAL;
::google::protobuf::uint8* InternalSerializeWithCachedSizesToArray(
bool deterministic, ::google::protobuf::uint8* target) const PROTOBUF_FINAL;
int GetCachedSize() const PROTOBUF_FINAL { return _cached_size_; }
private:
void SharedCtor();
void SharedDtor();
void SetCachedSize(int size) const PROTOBUF_FINAL;
void InternalSwap(TEST* other);
private:
inline ::google::protobuf::Arena* GetArenaNoVirtual() const {
return NULL;
}
inline void* MaybeArenaPtr() const {
return NULL;
}
public:
::google::protobuf::Metadata GetMetadata() const PROTOBUF_FINAL;
// nested types ----------------------------------------------------
// accessors -------------------------------------------------------
// int32 number = 1;
void clear_number();
static const int kNumberFieldNumber = 1;
::google::protobuf::int32 number() const;
void set_number(::google::protobuf::int32 value);
// @@protoc_insertion_point(class_scope:TEST)
private:
::google::protobuf::internal::InternalMetadataWithArena _internal_metadata_;
::google::protobuf::int32 number_;
mutable int _cached_size_;
friend struct ::protobuf_Protos_2fSeverSocketMessages_2eproto::TableStruct;
friend void ::protobuf_Protos_2fSeverSocketMessages_2eproto::InitDefaultsTESTImpl();
};
// -------------------------------------------------------------------
class ServerMessage : public ::google::protobuf::Message /* @@protoc_insertion_point(class_definition:ServerMessage) */ {
public:
ServerMessage();
virtual ~ServerMessage();
ServerMessage(const ServerMessage& from);
inline ServerMessage& operator=(const ServerMessage& from) {
CopyFrom(from);
return *this;
}
#if LANG_CXX11
ServerMessage(ServerMessage&& from) noexcept
: ServerMessage() {
*this = ::std::move(from);
}
inline ServerMessage& operator=(ServerMessage&& from) noexcept {
if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) {
if (this != &from) InternalSwap(&from);
} else {
CopyFrom(from);
}
return *this;
}
#endif
static const ::google::protobuf::Descriptor* descriptor();
static const ServerMessage& default_instance();
enum MessageCase {
kArduinoConnectedMessage = 1,
kClientConnectedMessage = 2,
MESSAGE_NOT_SET = 0,
};
static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY
static inline const ServerMessage* internal_default_instance() {
return reinterpret_cast<const ServerMessage*>(
&_ServerMessage_default_instance_);
}
static PROTOBUF_CONSTEXPR int const kIndexInFileMessages =
1;
void Swap(ServerMessage* other);
friend void swap(ServerMessage& a, ServerMessage& b) {
a.Swap(&b);
}
// implements Message ----------------------------------------------
inline ServerMessage* New() const PROTOBUF_FINAL { return New(NULL); }
ServerMessage* New(::google::protobuf::Arena* arena) const PROTOBUF_FINAL;
void CopyFrom(const ::google::protobuf::Message& from) PROTOBUF_FINAL;
void MergeFrom(const ::google::protobuf::Message& from) PROTOBUF_FINAL;
void CopyFrom(const ServerMessage& from);
void MergeFrom(const ServerMessage& from);
void Clear() PROTOBUF_FINAL;
bool IsInitialized() const PROTOBUF_FINAL;
size_t ByteSizeLong() const PROTOBUF_FINAL;
bool MergePartialFromCodedStream(
::google::protobuf::io::CodedInputStream* input) PROTOBUF_FINAL;
void SerializeWithCachedSizes(
::google::protobuf::io::CodedOutputStream* output) const PROTOBUF_FINAL;
::google::protobuf::uint8* InternalSerializeWithCachedSizesToArray(
bool deterministic, ::google::protobuf::uint8* target) const PROTOBUF_FINAL;
int GetCachedSize() const PROTOBUF_FINAL { return _cached_size_; }
private:
void SharedCtor();
void SharedDtor();
void SetCachedSize(int size) const PROTOBUF_FINAL;
void InternalSwap(ServerMessage* other);
private:
inline ::google::protobuf::Arena* GetArenaNoVirtual() const {
return NULL;
}
inline void* MaybeArenaPtr() const {
return NULL;
}
public:
::google::protobuf::Metadata GetMetadata() const PROTOBUF_FINAL;
// nested types ----------------------------------------------------
// accessors -------------------------------------------------------
// .ArduinoConnected arduinoConnectedMessage = 1;
bool has_arduinoconnectedmessage() const;
void clear_arduinoconnectedmessage();
static const int kArduinoConnectedMessageFieldNumber = 1;
const ::ArduinoConnected& arduinoconnectedmessage() const;
::ArduinoConnected* release_arduinoconnectedmessage();
::ArduinoConnected* mutable_arduinoconnectedmessage();
void set_allocated_arduinoconnectedmessage(::ArduinoConnected* arduinoconnectedmessage);
// .ClientConnected clientConnectedMessage = 2;
bool has_clientconnectedmessage() const;
void clear_clientconnectedmessage();
static const int kClientConnectedMessageFieldNumber = 2;
const ::ClientConnected& clientconnectedmessage() const;
::ClientConnected* release_clientconnectedmessage();
::ClientConnected* mutable_clientconnectedmessage();
void set_allocated_clientconnectedmessage(::ClientConnected* clientconnectedmessage);
MessageCase message_case() const;
// @@protoc_insertion_point(class_scope:ServerMessage)
private:
void set_has_arduinoconnectedmessage();
void set_has_clientconnectedmessage();
inline bool has_message() const;
void clear_message();
inline void clear_has_message();
::google::protobuf::internal::InternalMetadataWithArena _internal_metadata_;
union MessageUnion {
MessageUnion() {}
::ArduinoConnected* arduinoconnectedmessage_;
::ClientConnected* clientconnectedmessage_;
} message_;
mutable int _cached_size_;
::google::protobuf::uint32 _oneof_case_[1];
friend struct ::protobuf_Protos_2fSeverSocketMessages_2eproto::TableStruct;
friend void ::protobuf_Protos_2fSeverSocketMessages_2eproto::InitDefaultsServerMessageImpl();
};
// -------------------------------------------------------------------
class ArduinoConnected : public ::google::protobuf::Message /* @@protoc_insertion_point(class_definition:ArduinoConnected) */ {
public:
ArduinoConnected();
virtual ~ArduinoConnected();
ArduinoConnected(const ArduinoConnected& from);
inline ArduinoConnected& operator=(const ArduinoConnected& from) {
CopyFrom(from);
return *this;
}
#if LANG_CXX11
ArduinoConnected(ArduinoConnected&& from) noexcept
: ArduinoConnected() {
*this = ::std::move(from);
}
inline ArduinoConnected& operator=(ArduinoConnected&& from) noexcept {
if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) {
if (this != &from) InternalSwap(&from);
} else {
CopyFrom(from);
}
return *this;
}
#endif
static const ::google::protobuf::Descriptor* descriptor();
static const ArduinoConnected& default_instance();
static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY
static inline const ArduinoConnected* internal_default_instance() {
return reinterpret_cast<const ArduinoConnected*>(
&_ArduinoConnected_default_instance_);
}
static PROTOBUF_CONSTEXPR int const kIndexInFileMessages =
2;
void Swap(ArduinoConnected* other);
friend void swap(ArduinoConnected& a, ArduinoConnected& b) {
a.Swap(&b);
}
// implements Message ----------------------------------------------
inline ArduinoConnected* New() const PROTOBUF_FINAL { return New(NULL); }
ArduinoConnected* New(::google::protobuf::Arena* arena) const PROTOBUF_FINAL;
void CopyFrom(const ::google::protobuf::Message& from) PROTOBUF_FINAL;
void MergeFrom(const ::google::protobuf::Message& from) PROTOBUF_FINAL;
void CopyFrom(const ArduinoConnected& from);
void MergeFrom(const ArduinoConnected& from);
void Clear() PROTOBUF_FINAL;
bool IsInitialized() const PROTOBUF_FINAL;
size_t ByteSizeLong() const PROTOBUF_FINAL;
bool MergePartialFromCodedStream(
::google::protobuf::io::CodedInputStream* input) PROTOBUF_FINAL;
void SerializeWithCachedSizes(
::google::protobuf::io::CodedOutputStream* output) const PROTOBUF_FINAL;
::google::protobuf::uint8* InternalSerializeWithCachedSizesToArray(
bool deterministic, ::google::protobuf::uint8* target) const PROTOBUF_FINAL;
int GetCachedSize() const PROTOBUF_FINAL { return _cached_size_; }
private:
void SharedCtor();
void SharedDtor();
void SetCachedSize(int size) const PROTOBUF_FINAL;
void InternalSwap(ArduinoConnected* other);
private:
inline ::google::protobuf::Arena* GetArenaNoVirtual() const {
return NULL;
}
inline void* MaybeArenaPtr() const {
return NULL;
}
public:
::google::protobuf::Metadata GetMetadata() const PROTOBUF_FINAL;
// nested types ----------------------------------------------------
// accessors -------------------------------------------------------
// bool fail = 1;
void clear_fail();
static const int kFailFieldNumber = 1;
bool fail() const;
void set_fail(bool value);
// int32 arduinoId = 2;
void clear_arduinoid();
static const int kArduinoIdFieldNumber = 2;
::google::protobuf::int32 arduinoid() const;
void set_arduinoid(::google::protobuf::int32 value);
// int32 rfIdCardNo = 3;
void clear_rfidcardno();
static const int kRfIdCardNoFieldNumber = 3;
::google::protobuf::int32 rfidcardno() const;
void set_rfidcardno(::google::protobuf::int32 value);
// @@protoc_insertion_point(class_scope:ArduinoConnected)
private:
::google::protobuf::internal::InternalMetadataWithArena _internal_metadata_;
bool fail_;
::google::protobuf::int32 arduinoid_;
::google::protobuf::int32 rfidcardno_;
mutable int _cached_size_;
friend struct ::protobuf_Protos_2fSeverSocketMessages_2eproto::TableStruct;
friend void ::protobuf_Protos_2fSeverSocketMessages_2eproto::InitDefaultsArduinoConnectedImpl();
};
// -------------------------------------------------------------------
class ClientConnected : public ::google::protobuf::Message /* @@protoc_insertion_point(class_definition:ClientConnected) */ {
public:
ClientConnected();
virtual ~ClientConnected();
ClientConnected(const ClientConnected& from);
inline ClientConnected& operator=(const ClientConnected& from) {
CopyFrom(from);
return *this;
}
#if LANG_CXX11
ClientConnected(ClientConnected&& from) noexcept
: ClientConnected() {
*this = ::std::move(from);
}
inline ClientConnected& operator=(ClientConnected&& from) noexcept {
if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) {
if (this != &from) InternalSwap(&from);
} else {
CopyFrom(from);
}
return *this;
}
#endif
static const ::google::protobuf::Descriptor* descriptor();
static const ClientConnected& default_instance();
static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY
static inline const ClientConnected* internal_default_instance() {
return reinterpret_cast<const ClientConnected*>(
&_ClientConnected_default_instance_);
}
static PROTOBUF_CONSTEXPR int const kIndexInFileMessages =
3;
void Swap(ClientConnected* other);
friend void swap(ClientConnected& a, ClientConnected& b) {
a.Swap(&b);
}
// implements Message ----------------------------------------------
inline ClientConnected* New() const PROTOBUF_FINAL { return New(NULL); }
ClientConnected* New(::google::protobuf::Arena* arena) const PROTOBUF_FINAL;
void CopyFrom(const ::google::protobuf::Message& from) PROTOBUF_FINAL;
void MergeFrom(const ::google::protobuf::Message& from) PROTOBUF_FINAL;
void CopyFrom(const ClientConnected& from);
void MergeFrom(const ClientConnected& from);
void Clear() PROTOBUF_FINAL;
bool IsInitialized() const PROTOBUF_FINAL;
size_t ByteSizeLong() const PROTOBUF_FINAL;
bool MergePartialFromCodedStream(
::google::protobuf::io::CodedInputStream* input) PROTOBUF_FINAL;
void SerializeWithCachedSizes(
::google::protobuf::io::CodedOutputStream* output) const PROTOBUF_FINAL;
::google::protobuf::uint8* InternalSerializeWithCachedSizesToArray(
bool deterministic, ::google::protobuf::uint8* target) const PROTOBUF_FINAL;
int GetCachedSize() const PROTOBUF_FINAL { return _cached_size_; }
private:
void SharedCtor();
void SharedDtor();
void SetCachedSize(int size) const PROTOBUF_FINAL;
void InternalSwap(ClientConnected* other);
private:
inline ::google::protobuf::Arena* GetArenaNoVirtual() const {
return NULL;
}
inline void* MaybeArenaPtr() const {
return NULL;
}
public:
::google::protobuf::Metadata GetMetadata() const PROTOBUF_FINAL;
// nested types ----------------------------------------------------
// accessors -------------------------------------------------------
// int32 rfIdCardNo = 1;
void clear_rfidcardno();
static const int kRfIdCardNoFieldNumber = 1;
::google::protobuf::int32 rfidcardno() const;
void set_rfidcardno(::google::protobuf::int32 value);
// @@protoc_insertion_point(class_scope:ClientConnected)
private:
::google::protobuf::internal::InternalMetadataWithArena _internal_metadata_;
::google::protobuf::int32 rfidcardno_;
mutable int _cached_size_;
friend struct ::protobuf_Protos_2fSeverSocketMessages_2eproto::TableStruct;
friend void ::protobuf_Protos_2fSeverSocketMessages_2eproto::InitDefaultsClientConnectedImpl();
};
// ===================================================================
// ===================================================================
#ifdef __GNUC__
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wstrict-aliasing"
#endif // __GNUC__
// TEST
// int32 number = 1;
inline void TEST::clear_number() {
number_ = 0;
}
inline ::google::protobuf::int32 TEST::number() const {
// @@protoc_insertion_point(field_get:TEST.number)
return number_;
}
inline void TEST::set_number(::google::protobuf::int32 value) {
number_ = value;
// @@protoc_insertion_point(field_set:TEST.number)
}
// -------------------------------------------------------------------
// ServerMessage
// .ArduinoConnected arduinoConnectedMessage = 1;
inline bool ServerMessage::has_arduinoconnectedmessage() const {
return message_case() == kArduinoConnectedMessage;
}
inline void ServerMessage::set_has_arduinoconnectedmessage() {
_oneof_case_[0] = kArduinoConnectedMessage;
}
inline void ServerMessage::clear_arduinoconnectedmessage() {
if (has_arduinoconnectedmessage()) {
delete message_.arduinoconnectedmessage_;
clear_has_message();
}
}
inline ::ArduinoConnected* ServerMessage::release_arduinoconnectedmessage() {
// @@protoc_insertion_point(field_release:ServerMessage.arduinoConnectedMessage)
if (has_arduinoconnectedmessage()) {
clear_has_message();
::ArduinoConnected* temp = message_.arduinoconnectedmessage_;
message_.arduinoconnectedmessage_ = NULL;
return temp;
} else {
return NULL;
}
}
inline const ::ArduinoConnected& ServerMessage::arduinoconnectedmessage() const {
// @@protoc_insertion_point(field_get:ServerMessage.arduinoConnectedMessage)
return has_arduinoconnectedmessage()
? *message_.arduinoconnectedmessage_
: *reinterpret_cast< ::ArduinoConnected*>(&::_ArduinoConnected_default_instance_);
}
inline ::ArduinoConnected* ServerMessage::mutable_arduinoconnectedmessage() {
if (!has_arduinoconnectedmessage()) {
clear_message();
set_has_arduinoconnectedmessage();
message_.arduinoconnectedmessage_ = new ::ArduinoConnected;
}
// @@protoc_insertion_point(field_mutable:ServerMessage.arduinoConnectedMessage)
return message_.arduinoconnectedmessage_;
}
// .ClientConnected clientConnectedMessage = 2;
inline bool ServerMessage::has_clientconnectedmessage() const {
return message_case() == kClientConnectedMessage;
}
inline void ServerMessage::set_has_clientconnectedmessage() {
_oneof_case_[0] = kClientConnectedMessage;
}
inline void ServerMessage::clear_clientconnectedmessage() {
if (has_clientconnectedmessage()) {
delete message_.clientconnectedmessage_;
clear_has_message();
}
}
inline ::ClientConnected* ServerMessage::release_clientconnectedmessage() {
// @@protoc_insertion_point(field_release:ServerMessage.clientConnectedMessage)
if (has_clientconnectedmessage()) {
clear_has_message();
::ClientConnected* temp = message_.clientconnectedmessage_;
message_.clientconnectedmessage_ = NULL;
return temp;
} else {
return NULL;
}
}
inline const ::ClientConnected& ServerMessage::clientconnectedmessage() const {
// @@protoc_insertion_point(field_get:ServerMessage.clientConnectedMessage)
return has_clientconnectedmessage()
? *message_.clientconnectedmessage_
: *reinterpret_cast< ::ClientConnected*>(&::_ClientConnected_default_instance_);
}
inline ::ClientConnected* ServerMessage::mutable_clientconnectedmessage() {
if (!has_clientconnectedmessage()) {
clear_message();
set_has_clientconnectedmessage();
message_.clientconnectedmessage_ = new ::ClientConnected;
}
// @@protoc_insertion_point(field_mutable:ServerMessage.clientConnectedMessage)
return message_.clientconnectedmessage_;
}
inline bool ServerMessage::has_message() const {
return message_case() != MESSAGE_NOT_SET;
}
inline void ServerMessage::clear_has_message() {
_oneof_case_[0] = MESSAGE_NOT_SET;
}
inline ServerMessage::MessageCase ServerMessage::message_case() const {
return ServerMessage::MessageCase(_oneof_case_[0]);
}
// -------------------------------------------------------------------
// ArduinoConnected
// bool fail = 1;
inline void ArduinoConnected::clear_fail() {
fail_ = false;
}
inline bool ArduinoConnected::fail() const {
// @@protoc_insertion_point(field_get:ArduinoConnected.fail)
return fail_;
}
inline void ArduinoConnected::set_fail(bool value) {
fail_ = value;
// @@protoc_insertion_point(field_set:ArduinoConnected.fail)
}
// int32 arduinoId = 2;
inline void ArduinoConnected::clear_arduinoid() {
arduinoid_ = 0;
}
inline ::google::protobuf::int32 ArduinoConnected::arduinoid() const {
// @@protoc_insertion_point(field_get:ArduinoConnected.arduinoId)
return arduinoid_;
}
inline void ArduinoConnected::set_arduinoid(::google::protobuf::int32 value) {
arduinoid_ = value;
// @@protoc_insertion_point(field_set:ArduinoConnected.arduinoId)
}
// int32 rfIdCardNo = 3;
inline void ArduinoConnected::clear_rfidcardno() {
rfidcardno_ = 0;
}
inline ::google::protobuf::int32 ArduinoConnected::rfidcardno() const {
// @@protoc_insertion_point(field_get:ArduinoConnected.rfIdCardNo)
return rfidcardno_;
}
inline void ArduinoConnected::set_rfidcardno(::google::protobuf::int32 value) {
rfidcardno_ = value;
// @@protoc_insertion_point(field_set:ArduinoConnected.rfIdCardNo)
}
// -------------------------------------------------------------------
// ClientConnected
// int32 rfIdCardNo = 1;
inline void ClientConnected::clear_rfidcardno() {
rfidcardno_ = 0;
}
inline ::google::protobuf::int32 ClientConnected::rfidcardno() const {
// @@protoc_insertion_point(field_get:ClientConnected.rfIdCardNo)
return rfidcardno_;
}
inline void ClientConnected::set_rfidcardno(::google::protobuf::int32 value) {
rfidcardno_ = value;
// @@protoc_insertion_point(field_set:ClientConnected.rfIdCardNo)
}
#ifdef __GNUC__
#pragma GCC diagnostic pop
#endif // __GNUC__
// -------------------------------------------------------------------
// -------------------------------------------------------------------
// -------------------------------------------------------------------
// @@protoc_insertion_point(namespace_scope)
// @@protoc_insertion_point(global_scope)
#endif // PROTOBUF_Protos_2fSeverSocketMessages_2eproto__INCLUDED
| [
"langelov@melontech.com"
] | langelov@melontech.com |
739faf2332e5e2b1cf1b0d36bcf77269a56c6784 | 5181e2dd87941613b74be655fd621c13c1032d31 | /1. Nhap mon lap trinh_chuong04_ma tran/bai080.cpp | ccbc835e1855d476c8e25eeca94c65b094b24999 | [] | no_license | my-hoang-huu/My-hh | 36c57bcc0ff2a6f09d1404af502a63c94dfd7b92 | 176a0ec629438260ef1a44db82fe1a99a59c809f | refs/heads/main | 2023-06-05T03:03:18.421699 | 2021-05-07T00:36:26 | 2021-05-07T00:36:26 | 342,750,649 | 0 | 0 | null | 2021-05-07T00:36:27 | 2021-02-27T02:18:47 | C++ | UTF-8 | C++ | false | false | 1,450 | cpp | #include<iostream>
#include<iomanip>
#include<cstdlib>
#include<ctime>
using namespace std;
void Nhap(float[][50], int&, int&);
void Xuat(float[][50], int, int);
float Kt(float[][50], int, int);
void XuLy(float[][50], int, int);
int main()
{
float a[20][50];
int m;
int n;
Nhap(a, m, n);
cout << "Ma tran ban dau: \n";
Xuat(a, m, n);
XuLy(a, m, n);
return 1;
}
void Nhap(float a[][50], int& m, int& n)
{
cout << "Nhap so dong m = ";
cin >> m;
cout << "\nNhap so cot n = ";
cin >> n;
srand(time(NULL));
for (int i = 0; i < m; i++)
{
for (int j = 0; j < n; j++)
{
a[i][j] = rand() % 21 - 10;
/* cout << setw(7) << "a[" << i << "]" << "[" << j << "] = ";
cin >> a[i][j];*/
}
}
cout << endl;
}
void Xuat(float a[][50], int m, int n)
{
for (int i = 0; i < m; i++)
{
cout << endl;
for (int j = 0; j < n; j++)
{
cout << setw(8) << "a[" << i << "][" << j << "] = " << fixed << setprecision(2) << a[i][j];
}
}
cout << endl;
}
float Kt(float a[][50], int m, int n)
{
float lc = a[0][0];
for (int i = 0; i < m; i++)
{
for (int j = 0; j < n; j++)
{
if (a[i][j] > lc)
lc = a[i][j];
}
}
return lc;
}
void XuLy(float a[][50], int m, int n)
{
cout << "\nCac dong chua gia tri lon nhat trong ma tran: ";
float s = 0;
int lc = -1;
for (int i = 0; i < m; i++)
{
for (int j = 0; j < n; j++)
{
if (a[i][j] == Kt(a, m, n) && i != lc)
{
lc = i;
cout << setw(8) << i ;
}
}
}
} | [
"hhmy1995@gmail.com"
] | hhmy1995@gmail.com |
2f167d5bac90b3af4ecf93fc73f3e59d4dbc36bd | e87fdccb0e4ff05d414981920328256fe8e27911 | /party_A_div1.cpp | 3cc1e64bbedbd09e12886e79504c1bf4a84eab5a | [] | no_license | CP-lands/Codeforces | 4250ff459d2b0c700682f92b250769153d33e6bf | b5a14e254e17740415c84acdde9deab98326ffa6 | refs/heads/master | 2023-08-28T11:25:16.331344 | 2021-11-10T11:53:29 | 2021-11-10T11:53:29 | 394,057,952 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,099 | cpp | //--------Anivia_kid---------//
//-------did you test n = 1 ?-------//
//https://codeforces.com/contest/115/problem/A
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
typedef long long ll;
const int MOD = 1e9 + 7;
const int MAXN = 1e5 + 100;
int l[2001];
void Anivia_kid(){
int n;
cin>>n;
vector<int> g[2001];
queue<int> q;
vector<bool> visited(2001);
for(int i = 1; i <= n; i++){
int x;
cin>>x;
if(x == -1){
q.push(i);
visited[i] = true;
l[i] = 1;
}
else g[x].pb(i);
}
int res = 1;
while(!q.empty()){
int k = q.front();
q.pop();
for(auto x: g[k]){
if(!visited[x]){
visited[x] = true;
l[x] = l[k] + 1;
if(res < l[x]) res = l[x];
q.push(x);
}
}
}
cout<<res<<endl;
return;
}
int main()
{
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int q = 1;
//cin>>q;
while(q--){
Anivia_kid();
}
return 0;
}
| [
"noreply@github.com"
] | CP-lands.noreply@github.com |
445480b79021eeaa3b35b571838d690ecd5ccbca | 2098c74a59133c985e10f57a901bc5839a6d1333 | /Source/Editors/XrECore/Editor/UIRenderForm.cpp | c6b4c5440a607e2bd156c136d193edbe7b77b65c | [] | no_license | ChuniMuni/XRayEngine | 28672b4c5939e95c6dfb24c9514041dd25cfa306 | cdb13c23552fd86409b6e4e2925ac78064ee8739 | refs/heads/master | 2023-04-02T01:04:01.134317 | 2021-04-10T07:44:41 | 2021-04-10T07:44:41 | 266,738,168 | 1 | 0 | null | 2021-04-10T07:44:41 | 2020-05-25T09:27:11 | C++ | UTF-8 | C++ | false | false | 3,356 | cpp | #include "stdafx.h"
#include "UIRenderForm.h"
#include "ui_main.h"
UIRenderForm::UIRenderForm()
{
m_mouse_down = false;
m_mouse_move = false;
m_shiftstate_down = false;
}
UIRenderForm::~UIRenderForm()
{
}
void UIRenderForm::Draw()
{
ImGui::Begin("Render");
if (UI && UI->RT->pSurface)
{
int ShiftState = ssNone;
if (ImGui::GetIO().KeyShift)ShiftState |= ssShift;
if (ImGui::GetIO().KeyCtrl)ShiftState |= ssCtrl;
if (ImGui::GetIO().KeyAlt)ShiftState |= ssAlt;
if (ImGui::IsMouseDown(ImGuiMouseButton_Left))ShiftState |= ssLeft;
if (ImGui::IsMouseDown(ImGuiMouseButton_Right))ShiftState |= ssRight;
//VERIFY(!(ShiftState & ssLeft && ShiftState & ssRight));
ImDrawList* draw_list = ImGui::GetWindowDrawList();
ImVec2 canvas_pos = ImGui::GetCursorScreenPos();
ImVec2 canvas_size = ImGui::GetContentRegionAvail();
ImVec2 mouse_pos = ImGui::GetIO().MousePos;
bool cursor_in_zone = true;
if (mouse_pos.x < canvas_pos.x)
{
cursor_in_zone = false;
mouse_pos.x = canvas_pos.x;
}
if (mouse_pos.y < canvas_pos.y)
{
cursor_in_zone = false;
mouse_pos.y = canvas_pos.y;
}
if (mouse_pos.x > canvas_pos.x + canvas_size.x)
{
cursor_in_zone = false;
mouse_pos.x = canvas_pos.x + canvas_size.x;
}
if (mouse_pos.y > canvas_pos.y + canvas_size.y)
{
cursor_in_zone = false;
mouse_pos.y = canvas_pos.y + canvas_size.y;
}
bool curent_shiftstate_down = m_shiftstate_down;
if (ImGui::IsWindowFocused())
{
if ((ImGui::IsMouseDown(ImGuiMouseButton_Left) || ImGui::IsMouseDown(ImGuiMouseButton_Right)) && !m_mouse_down&& cursor_in_zone)
{
UI->MousePress(TShiftState(ShiftState), mouse_pos.x - canvas_pos.x, mouse_pos.y - canvas_pos.y);
m_mouse_down = true;
}
else if ((ImGui::IsMouseReleased(ImGuiMouseButton_Left) || ImGui::IsMouseReleased(ImGuiMouseButton_Right) )&& m_mouse_down)
{
if (!ImGui::IsMouseDown(ImGuiMouseButton_Left) &&! ImGui::IsMouseDown(ImGuiMouseButton_Right))
{
UI->MouseRelease(TShiftState(ShiftState), mouse_pos.x - canvas_pos.x, mouse_pos.y - canvas_pos.y);
m_mouse_down = false;
m_mouse_move = false;
m_shiftstate_down = false;
}
}
else if (m_mouse_down)
{
UI->MouseMove(TShiftState(ShiftState), mouse_pos.x - canvas_pos.x, mouse_pos.y - canvas_pos.y);
m_mouse_move = true;
m_shiftstate_down = m_shiftstate_down||( ShiftState & (ssShift | ssCtrl | ssAlt));
}
}
else if (m_mouse_down)
{
if (!ImGui::IsMouseDown(ImGuiMouseButton_Left) && !ImGui::IsMouseDown(ImGuiMouseButton_Right))
{
UI->MouseRelease(TShiftState(ShiftState), mouse_pos.x - canvas_pos.x, mouse_pos.y - canvas_pos.y);
m_mouse_down = false;
m_mouse_move = false;
m_shiftstate_down = false;
}
}
m_mouse_position.set(mouse_pos.x - canvas_pos.x, mouse_pos.y - canvas_pos.y);
if (canvas_size.x < 32.0f) canvas_size.x = 32.0f;
if (canvas_size.y < 32.0f) canvas_size.y = 32.0f;
UI->RTSize.set(canvas_size.x, canvas_size.y);
ImGui::InvisibleButton("canvas", canvas_size);
if (!m_OnContextMenu.empty()&& !curent_shiftstate_down)
{
if (ImGui::BeginPopupContextItem("Menu"))
{
m_OnContextMenu();
ImGui::EndPopup();
}
}
draw_list->AddImage(UI->RT->pSurface, canvas_pos, ImVec2(canvas_pos.x + canvas_size.x, canvas_pos.y + canvas_size.y));
}
ImGui::End();
}
| [
"i-sobolevskiy@mail.ru"
] | i-sobolevskiy@mail.ru |
4f18623ad06821be0fba3f55cf54ca488114fa6d | a39cdf77168b11d7eea4e0ac29919884560a3211 | /2303.cpp | e0623a2988ee78151706f4fad14d4aef86ec03e3 | [] | no_license | EEngblo/GBS_2014_info | e8eb082922e89017f8a60a4a52f7b9264b93dade | 6d5e0b349efc2e6c5f745b146741de1d8619107b | refs/heads/master | 2016-09-05T13:02:37.751706 | 2014-11-05T02:33:04 | 2014-11-05T02:33:04 | null | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 298 | cpp | #include <iostream>
using namespace std;
int main(){
int n, a, b, answ;
int arr[10001] = {};
cin >> n;
for (int i = 1; i <= n; i++)
cin >> arr[i];
do{
answ = 0;
cin >> a >> b;
for (int i = a; i <= b; i++)
answ += arr[i];
cout << answ << endl;
} while (a || b);
return 0;
} | [
"sheogorath0213@gmail.com"
] | sheogorath0213@gmail.com |
2ad5e141de705b754e8a133a2acffee70e76a617 | cf3302a478551167d14c577be171fe0c1b4a3507 | /src/cpp/activemq/activemq-cpp-3.2.5/src/test/activemq/wireformat/openwire/marshal/v2/ActiveMQBlobMessageMarshallerTest.h | 2a98a7c52194301a919c5d93c757021fe61deb2b | [
"Apache-2.0"
] | permissive | WilliamDrewAeroNomos/muthur | 7babb320ed3bfb6ed7905a1a943e3d35aa03aedc | 0c66c78af245ef3b06b92172e0df62eb54b3fb84 | refs/heads/master | 2016-09-05T11:15:50.083267 | 2015-07-01T15:49:56 | 2015-07-01T15:49:56 | 38,366,076 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 2,276 | h | /*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef _ACTIVEMQ_WIREFORMAT_OPENWIRE_MARSAHAL_V2_ACTIVEMQBLOBMESSAGEMARSHALLERTEST_H_
#define _ACTIVEMQ_WIREFORMAT_OPENWIRE_MARSAHAL_V2_ACTIVEMQBLOBMESSAGEMARSHALLERTEST_H_
// Turn off warning message for ignored exception specification
#ifdef _MSC_VER
#pragma warning( disable : 4290 )
#endif
#include <cppunit/TestFixture.h>
#include <cppunit/extensions/HelperMacros.h>
namespace activemq{
namespace wireformat{
namespace openwire{
namespace marshal{
namespace v2{
/**
* Marshalling Test code for Open Wire Format for ActiveMQBlobMessageMarshallerTest
*
* NOTE!: This file is autogenerated - do not modify!
* if you need to make a change, please see the Java Classes
* in the activemq-openwire-generator module
*/
class ActiveMQBlobMessageMarshallerTest : public CppUnit::TestFixture {
CPPUNIT_TEST_SUITE( ActiveMQBlobMessageMarshallerTest );
CPPUNIT_TEST( test );
CPPUNIT_TEST( testLooseMarshal );
CPPUNIT_TEST( testTightMarshal );
CPPUNIT_TEST_SUITE_END();
public:
ActiveMQBlobMessageMarshallerTest() {}
virtual ~ActiveMQBlobMessageMarshallerTest() {}
/**
* Test the marshaller and its marshalled type.
*/
virtual void test();
virtual void testLooseMarshal();
virtual void testTightMarshal();
};
}}}}}
#endif /*_ACTIVEMQ_WIREFORMAT_OPENWIRE_MARSAHAL_V2_ACTIVEMQBLOBMESSAGEMARSHALLERTEST_H_*/
| [
"wdrew@aeronomos.com"
] | wdrew@aeronomos.com |
d168457c625f43e1c86632b03bda64ecb33afc28 | 433410a07309822d47614d879aa95208150a0b61 | /canYouWin.cpp | 5c97a7a35158c1be8de232aca3cbeb199424cb0e | [] | no_license | aditya1944/Scaler-Questions | c141b12cfcf618101e7f47d9ebcdaf097fdebdee | f1fe38d165751d239d2471d7a89b3d397cde1d9a | refs/heads/master | 2023-01-07T08:02:55.230168 | 2020-11-09T11:46:47 | 2020-11-09T11:46:47 | 271,989,746 | 0 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 1,126 | cpp | #include<iostream>
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
void find(TreeNode* A, int C,TreeNode** ptr){
if(!A){
return ;
}
if(A->val==C){
*ptr = A;
return;
}
find(A->left,C,ptr);
find(A->right,C,ptr);
}
int calculate(TreeNode* node){
if(!node){
return 0;
}
return 1 + calculate(node->left) + calculate(node->right);
}
int solve(TreeNode* A, int B, int C) {
//total there are B nodes.
//initially friend has taken node with value C
//function to return the node with value C
TreeNode* ptr;
TreeNode** temp = &ptr;
find(A,C,temp);
//ptr has the value
//now calculate all node in left and right subtree
int leftNodes = calculate(ptr->left);
int rightNodes = calculate(ptr->right);
//total node i have is the max of 3 parts
int myNodes = std::max(leftNodes, std::max(rightNodes, B - (leftNodes+ rightNodes+1)));
int hisNodes = B - myNodes;
if(myNodes>hisNodes){
return 1;
}
return 0;
}
| [
"aditya1944@live.com"
] | aditya1944@live.com |
35eca4f2fa77db6935ca18221cc5a9b754b39b67 | 3ae80dbc18ed3e89bedf846d098b2a98d8e4b776 | /src/IO/ViewFileBufferL.cpp | 683571767cf38940fcc365cc6acb24b47896734f | [] | no_license | sswroom/SClass | deee467349ca249a7401f5d3c177cdf763a253ca | 9a403ec67c6c4dfd2402f19d44c6573e25d4b347 | refs/heads/main | 2023-09-01T07:24:58.907606 | 2023-08-31T11:24:34 | 2023-08-31T11:24:34 | 329,970,172 | 10 | 7 | null | null | null | null | UTF-8 | C++ | false | false | 1,259 | cpp | #include "Stdafx.h"
#include "MyMemory.h"
#include "IO/ViewFileBuffer.h"
#include <unistd.h>
#include <stdio.h>
#include <fcntl.h>
#include <sys/types.h>
#include <sys/mman.h>
IO::ViewFileBuffer::ViewFileBuffer(const UTF8Char *fileName)
{
this->filePtr = 0;
this->fileHandle = (void*)(OSInt)open((const Char*)fileName, O_RDWR);
if ((OSInt)this->fileHandle < 0)
{
return;
}
this->mapHandle = mmap(0, (size_t)GetLength(), PROT_READ|PROT_WRITE, MAP_PRIVATE, (int)(OSInt)this->fileHandle, 0);
if ((OSInt)this->mapHandle < 0)
{
return;
}
}
IO::ViewFileBuffer::~ViewFileBuffer()
{
if ((OSInt)this->fileHandle >= 0)
{
if ((OSInt)this->mapHandle >= 0)
{
munmap(mapHandle, (size_t)GetLength());
}
close((int)(OSInt)fileHandle);
}
}
UInt8 *IO::ViewFileBuffer::GetPointer()
{
if ((OSInt)this->fileHandle < 0 || (OSInt)this->mapHandle < 0)
{
return 0;
}
return (UInt8*)mapHandle;
}
UInt64 IO::ViewFileBuffer::GetLength()
{
UInt64 pos = (UInt64)lseek((int)(OSInt)fileHandle, 0, SEEK_CUR);
UInt64 leng = (UInt64)lseek((int)(OSInt)fileHandle, 0, SEEK_END);
lseek((int)(OSInt)fileHandle, (off_t)pos, SEEK_SET);
return leng;
}
void IO::ViewFileBuffer::FreePointer()
{
}
| [
"sswroom@yahoo.com"
] | sswroom@yahoo.com |
430bb6c3b68246c26a00b127895ce8e08c7dcc3f | 9f520bcbde8a70e14d5870fd9a88c0989a8fcd61 | /pitzDaily/804/phia | a8cba1ac4a1f9059fd25e3e928299eaff0a3e639 | [] | no_license | asAmrita/adjoinShapOptimization | 6d47c89fb14d090941da706bd7c39004f515cfea | 079cbec87529be37f81cca3ea8b28c50b9ceb8c5 | refs/heads/master | 2020-08-06T21:32:45.429939 | 2019-10-06T09:58:20 | 2019-10-06T09:58:20 | 213,144,901 | 1 | 0 | null | null | null | null | UTF-8 | C++ | false | false | 235,037 | /*--------------------------------*- C++ -*----------------------------------*\
| ========= | |
| \\ / F ield | OpenFOAM: The Open Source CFD Toolbox |
| \\ / O peration | Version: v1806 |
| \\ / A nd | Web: www.OpenFOAM.com |
| \\/ M anipulation | |
\*---------------------------------------------------------------------------*/
FoamFile
{
version 2.0;
format ascii;
class surfaceScalarField;
location "804";
object phia;
}
// * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
dimensions [0 3 -1 0 0 0 0];
oriented oriented;
internalField nonuniform List<scalar>
12640
(
3.91782898793e-08
-3.80104844563e-08
7.40466619403e-08
-3.39635078318e-08
1.04425725842e-07
-2.97150635378e-08
1.30632055811e-07
-2.5676030175e-08
1.51719299473e-07
-2.06102177488e-08
1.6771455939e-07
-1.55470344294e-08
1.82366735538e-07
-1.42469834654e-08
2.02930514044e-07
-2.01986300883e-08
2.29543571847e-07
-2.6282725816e-08
2.56682419476e-07
-2.68482210916e-08
2.83711021247e-07
-2.67794083197e-08
3.12744691325e-07
-2.88072711564e-08
3.42204820536e-07
-2.92515253094e-08
3.71413478432e-07
-2.90140297638e-08
4.01886778395e-07
-3.02932410418e-08
4.36150433312e-07
-3.40924863679e-08
4.72666918152e-07
-3.63559906309e-08
5.08820118168e-07
-3.60000277666e-08
5.44391108714e-07
-3.54281740866e-08
5.81877155045e-07
-3.73473811669e-08
6.25201015189e-07
-4.3189063854e-08
6.73804559116e-07
-4.84708247471e-08
7.23998317113e-07
-5.00670296131e-08
7.74015338786e-07
-4.98948145226e-08
8.23435109999e-07
-4.93040905637e-08
8.72636776497e-07
-4.9088607003e-08
9.22401656232e-07
-4.96555817188e-08
9.72423726767e-07
-4.99137061178e-08
1.02225568844e-06
-4.97266933437e-08
1.07213128518e-06
-4.97710622571e-08
1.12284143429e-06
-5.06081965128e-08
1.17399203977e-06
-5.10483397835e-08
1.22520066525e-06
-5.11067319253e-08
1.27801123564e-06
-5.27071663009e-08
1.33224415075e-06
-5.41295286482e-08
1.38719921863e-06
-5.48494913305e-08
1.44282828928e-06
-5.55237409489e-08
1.49769947667e-06
-5.47648785376e-08
1.55082596204e-06
-5.30193981778e-08
1.60242027794e-06
-5.1484442327e-08
1.65351630008e-06
-5.09857640032e-08
1.70185184812e-06
-4.82251794731e-08
1.74443854892e-06
-4.24766369298e-08
1.78291229461e-06
-3.83615743447e-08
1.81892659438e-06
-3.58998819769e-08
1.85214026564e-06
-3.30955035885e-08
1.88213572193e-06
-2.9873655936e-08
1.90813282464e-06
-2.58706885281e-08
1.93003228005e-06
-2.17684896418e-08
1.94990007272e-06
-1.97314830897e-08
1.97030513235e-06
-2.02628679162e-08
1.98804627486e-06
-1.75921524936e-08
1.99579178062e-06
-7.58729782046e-09
1.99590118406e-06
6.06421734142e-11
1.98771490507e-06
8.36736771669e-09
1.96868973303e-06
1.92187792077e-08
1.95037392452e-06
1.85299020758e-08
1.93782180063e-06
1.27959253244e-08
1.9210708884e-06
1.70321882974e-08
1.90062313324e-06
2.07758564871e-08
1.88810839939e-06
1.29032190955e-08
1.86914296492e-06
1.94436920362e-08
1.80586730308e-06
6.38632355138e-08
1.67515992717e-06
1.31276886663e-07
1.53490870609e-06
1.40659774461e-07
1.42879696521e-06
1.0640255767e-07
1.32985949904e-06
9.91923849382e-08
1.22881984758e-06
1.01311027792e-07
1.11979849253e-06
1.09330557403e-07
9.9714739693e-07
1.22996399133e-07
8.67982857685e-07
1.29522780958e-07
7.42025169457e-07
1.26297501621e-07
6.22972258424e-07
1.19371660434e-07
4.98377285499e-07
1.24902490704e-07
3.92103043837e-07
1.06555251683e-07
3.00372955593e-07
9.1996665074e-08
2.35444951739e-07
6.51963269384e-08
1.63585039059e-07
7.21246209409e-08
9.90900431716e-08
6.49081724884e-08
9.93790505498e-08
2.08238923535e-08
-5.82749825307e-08
4.815965798e-08
-6.06502867923e-08
7.48805984669e-08
-5.59170563653e-08
1.02430610384e-07
-5.27914553514e-08
1.36199886576e-07
-5.39428768078e-08
1.63039953245e-07
-4.19553360746e-08
1.82654891181e-07
-3.34425567131e-08
2.04569290448e-07
-4.17326554735e-08
2.29327224578e-07
-5.07015498053e-08
2.56382907813e-07
-5.36123688034e-08
2.84094737338e-07
-5.42328260317e-08
3.1084714473e-07
-5.53318987656e-08
3.38166533332e-07
-5.635783284e-08
3.67125421455e-07
-5.77750151426e-08
3.98285413834e-07
-6.12618628888e-08
4.3342155177e-07
-6.90523357829e-08
4.68974942442e-07
-7.1745423953e-08
5.00610862965e-07
-6.748964178e-08
5.33450320777e-07
-6.81268164896e-08
5.72869524658e-07
-7.66307269534e-08
6.19362923574e-07
-8.95433572792e-08
6.70806220727e-07
-9.97803477521e-08
7.22272961497e-07
-1.01402357553e-07
7.71064811985e-07
-9.85639248968e-08
8.19651015891e-07
-9.7770233812e-08
8.69826515554e-07
-9.91501754866e-08
9.19844161524e-07
-9.95596129141e-08
9.69451059739e-07
-9.94114352454e-08
1.01932881879e-06
-9.94951552212e-08
1.06958546698e-06
-9.99220323568e-08
1.11994279827e-06
-1.00859462423e-07
1.17038591397e-06
-1.01387540183e-07
1.22091433547e-06
-1.0152972843e-07
1.27357559766e-06
-1.05263227106e-07
1.32922723664e-06
-1.09673888059e-07
1.38474983021e-06
-1.10264749972e-07
1.4401014718e-06
-1.10766467566e-07
1.49652413626e-06
-1.11079055415e-07
1.55310790921e-06
-1.09492469749e-07
1.60625868808e-06
-1.04522694622e-07
1.64885589155e-06
-9.3469341311e-08
1.68391001985e-06
-8.31668135365e-08
1.72152901857e-06
-7.99829141018e-08
1.76153983264e-06
-7.8257823039e-08
1.80041960561e-06
-7.46623733866e-08
1.83734465699e-06
-6.98995350188e-08
1.87122254018e-06
-6.36267014356e-08
1.90198881526e-06
-5.65072300059e-08
1.92904354578e-06
-4.86887689031e-08
1.94882214293e-06
-3.93697414102e-08
1.95826586827e-06
-2.95613513564e-08
1.96444987223e-06
-2.36240170262e-08
1.98038174429e-06
-2.33578647367e-08
1.99234268204e-06
-1.17262500057e-08
1.98941008477e-06
1.14846375021e-08
1.98554462587e-06
2.32846497411e-08
1.98019829366e-06
2.40989743459e-08
1.96770823862e-06
2.55387264745e-08
1.95423116869e-06
3.08002715299e-08
1.93738544321e-06
3.79613563855e-08
1.89922251252e-06
5.14631326679e-08
1.85427711078e-06
6.48671857805e-08
1.78208672061e-06
1.3661712815e-07
1.65365603285e-06
2.60237780706e-07
1.49101924971e-06
3.03682618693e-07
1.33528367856e-06
2.62414549941e-07
1.2409997128e-06
1.93724287899e-07
1.17295986809e-06
1.69619072057e-07
1.08540645762e-06
1.97187810541e-07
9.691447318e-07
2.39595053095e-07
8.33526580597e-07
2.65483960904e-07
6.97645682683e-07
2.62499727199e-07
5.8503595412e-07
2.32290438386e-07
5.00643467387e-07
2.09611653805e-07
4.18754730239e-07
1.88756816513e-07
3.43056690909e-07
1.6800022891e-07
2.6408486826e-07
1.44484642829e-07
1.93736355224e-07
1.42827631356e-07
1.01349652492e-07
1.57696473434e-07
2.01063442639e-07
2.51809031639e-08
-8.28545927018e-08
3.8862331175e-08
-7.38003616217e-08
6.93739261691e-08
-8.59175822058e-08
1.04641192708e-07
-8.75786846921e-08
1.38071934437e-07
-8.69345428507e-08
1.56740241792e-07
-6.02694286072e-08
1.70136611131e-07
-4.64898952049e-08
1.93720104455e-07
-6.49447086907e-08
2.2084731276e-07
-7.74933905494e-08
2.48510908572e-07
-8.09844540884e-08
2.76279632269e-07
-8.17468201864e-08
3.03147709838e-07
-8.19677113665e-08
3.30136570653e-07
-8.31289998109e-08
3.59311282375e-07
-8.67427334931e-08
3.88543409203e-07
-9.03015989123e-08
4.0828736885e-07
-8.86236654389e-08
4.21647414073e-07
-8.49595141739e-08
4.46813955936e-07
-9.25218543793e-08
4.90946330298e-07
-1.12126655147e-07
5.51644595609e-07
-1.37191140931e-07
6.14339590735e-07
-1.5209811305e-07
6.66404169884e-07
-1.51707345072e-07
7.14030763029e-07
-1.48899236195e-07
7.63881395665e-07
-1.48289627371e-07
8.14243751351e-07
-1.48013531125e-07
8.63355865468e-07
-1.48146312918e-07
9.12468761717e-07
-1.48560477685e-07
9.62253599838e-07
-1.49085562499e-07
1.01235590585e-06
-1.4948941591e-07
1.06298242109e-06
-1.50441257411e-07
1.11308189333e-06
-1.50853710767e-07
1.16356190229e-06
-1.51762811364e-07
1.2155201152e-06
-1.53382934535e-07
1.26625185432e-06
-1.5588859691e-07
1.3202951273e-06
-1.6361078462e-07
1.38004850493e-06
-1.69910147297e-07
1.43698748623e-06
-1.67596874164e-07
1.49210749605e-06
-1.66089897629e-07
1.54971983965e-06
-1.66994401966e-07
1.6050376243e-06
-1.59727876744e-07
1.65598735539e-06
-1.44305686725e-07
1.70298110646e-06
-1.30046870884e-07
1.74535625872e-06
-1.22243796783e-07
1.78431238579e-06
-1.17097901214e-07
1.82068543041e-06
-1.10916780325e-07
1.85412456203e-06
-1.03216780462e-07
1.88469171316e-06
-9.40681408553e-08
1.91214575991e-06
-8.38313821513e-08
1.93611010471e-06
-7.25184011333e-08
1.95688259536e-06
-6.0002289783e-08
1.97504485064e-06
-4.75774198264e-08
1.98886237124e-06
-3.72881763034e-08
1.99238302297e-06
-2.67160365981e-08
1.98956133201e-06
-8.7325507173e-09
1.99046093025e-06
1.07688933612e-08
1.99078819938e-06
2.31576609014e-08
1.98343995446e-06
3.1669285001e-08
1.96943161946e-06
3.97974301e-08
1.95136840957e-06
4.91502319754e-08
1.92791080864e-06
6.17499237588e-08
1.89763096298e-06
8.21291312434e-08
1.82933081368e-06
1.33619866806e-07
1.68342581812e-06
2.83013358144e-07
1.48780462057e-06
4.56293576599e-07
1.33951955318e-06
4.52294862731e-07
1.27300672913e-06
3.29189683725e-07
1.19491044115e-06
2.72062276736e-07
1.09469155722e-06
2.70085347471e-07
9.84978013179e-07
3.07174002088e-07
8.63544146644e-07
3.61328022268e-07
7.47212874644e-07
3.82121066614e-07
6.56722144497e-07
3.53299440586e-07
5.78552289314e-07
3.10777233141e-07
4.99261105489e-07
2.89216574162e-07
4.07323504111e-07
2.80999716954e-07
3.15335211719e-07
2.60297314289e-07
2.37733183793e-07
2.22383434476e-07
1.79777350759e-07
2.01069986407e-07
7.75323926618e-08
2.60403382446e-07
2.78714852112e-07
1.68822055639e-08
-9.93235717372e-08
2.32597909273e-08
-7.98164798198e-08
5.57177389913e-08
-1.17901586939e-07
8.38693351679e-08
-1.1527230631e-07
8.91658732214e-08
-9.18925554911e-08
8.21297111599e-08
-5.3052373521e-08
1.15306002714e-07
-7.94211254958e-08
1.6696454246e-07
-1.16262772133e-07
2.04701979996e-07
-1.14904553827e-07
2.35144898464e-07
-1.11140337853e-07
2.64307554216e-07
-1.10652718892e-07
2.92095745077e-07
-1.09518046171e-07
3.17472496214e-07
-1.08284732212e-07
3.33962955789e-07
-1.03032952526e-07
3.43650521714e-07
-9.98129762121e-08
3.60550620713e-07
-1.0537011908e-07
3.96014761055e-07
-1.20281650497e-07
4.49737396847e-07
-1.4610429154e-07
5.11538299577e-07
-1.73782633288e-07
5.64624093027e-07
-1.90131466965e-07
6.09026690635e-07
-1.96358686128e-07
6.56057487596e-07
-1.98601947562e-07
7.05404289221e-07
-1.98115273237e-07
7.54227890403e-07
-1.96988990809e-07
8.02874857577e-07
-1.96540917027e-07
8.5168833315e-07
-1.96844904568e-07
9.01359877708e-07
-1.98119627614e-07
9.51456257325e-07
-1.99072439521e-07
1.00215944708e-06
-2.00084401708e-07
1.05247097565e-06
-2.00646417247e-07
1.10386354839e-06
-2.02140955914e-07
1.15364640573e-06
-2.01441400436e-07
1.20311034212e-06
-2.02742520156e-07
1.26054313792e-06
-2.13215666532e-07
1.31859343187e-06
-2.21553968257e-07
1.37613826724e-06
-2.27347578655e-07
1.43962348231e-06
-2.30973432875e-07
1.50104178413e-06
-2.27398648194e-07
1.5547109643e-06
-2.20553025225e-07
1.60477687439e-06
-2.09682336437e-07
1.65440409227e-06
-1.93820471055e-07
1.70235005579e-06
-1.77879758231e-07
1.74627669058e-06
-1.66056321177e-07
1.78614041666e-06
-1.56845829726e-07
1.82273545406e-06
-1.47393554651e-07
1.85628940558e-06
-1.36649397725e-07
1.88686438744e-06
-1.2451825791e-07
1.91431786443e-06
-1.11155998747e-07
1.93850390175e-06
-9.65709694779e-08
1.95949566677e-06
-8.08552028124e-08
1.97687353966e-06
-6.48102937782e-08
1.98875139703e-06
-4.9013588102e-08
1.99376755705e-06
-3.15716827565e-08
1.99559296662e-06
-1.03878330292e-08
1.99607313531e-06
1.04704704759e-08
1.99224795029e-06
2.71795840149e-08
1.98236563403e-06
4.17687261962e-08
1.96566199631e-06
5.67442442235e-08
1.94059231514e-06
7.44954560163e-08
1.90224101538e-06
1.004151314e-07
1.83666908447e-06
1.480554087e-07
1.72197621206e-06
2.48703367017e-07
1.58356479972e-06
4.21815079038e-07
1.45948228181e-06
5.80736989854e-07
1.31994849268e-06
5.9214506631e-07
1.18889940747e-06
4.60487655775e-07
1.08777884306e-06
3.73402109378e-07
9.99956534446e-07
3.58131527622e-07
9.14819516283e-07
3.92554946118e-07
8.23077351152e-07
4.53340656465e-07
7.21955645861e-07
4.83540066818e-07
6.20292800384e-07
4.55266487486e-07
5.18425475111e-07
4.12926348906e-07
4.19195072536e-07
3.88708335574e-07
3.27939471105e-07
3.72518825677e-07
2.34897099929e-07
3.53604489746e-07
1.54894974346e-07
3.02621076087e-07
1.03922765537e-07
2.52266882544e-07
5.33772298581e-08
3.11102063287e-07
3.3226408039e-07
2.44294355213e-09
-1.01457276853e-07
1.85928976129e-08
-9.56730894423e-08
4.29840746293e-08
-1.41887321794e-07
6.27249480733e-08
-1.34633707985e-07
6.02089024984e-08
-8.91333605895e-08
7.97591055271e-08
-7.24154508407e-08
1.21324568806e-07
-1.2071764076e-07
1.52879360828e-07
-1.47501566181e-07
1.8338526259e-07
-1.45107013044e-07
2.14845027805e-07
-1.42317939272e-07
2.46523671393e-07
-1.42069082269e-07
2.69191673347e-07
-1.31956039664e-07
2.78236433652e-07
-1.17131211404e-07
2.88428747128e-07
-1.13052625455e-07
3.15302053438e-07
-1.26526204033e-07
3.59386447816e-07
-1.49297680594e-07
4.14374506766e-07
-1.75113699758e-07
4.67578003307e-07
-1.991528771e-07
5.10121842422e-07
-2.16175625527e-07
5.49808289156e-07
-2.29671473589e-07
5.94723341445e-07
-2.41131706625e-07
6.4251568812e-07
-2.4625751058e-07
6.90872350663e-07
-2.46341762631e-07
7.39095170775e-07
-2.45087504952e-07
7.87511097524e-07
-2.4483788178e-07
8.36839919978e-07
-2.46058682331e-07
8.86279707386e-07
-2.47448282236e-07
9.37091547358e-07
-2.4977505213e-07
9.87245503798e-07
-2.50130795966e-07
1.03818622888e-06
-2.5148082866e-07
1.08695831654e-06
-2.50808854964e-07
1.13987286534e-06
-2.54252809504e-07
1.19882964636e-06
-2.61595317152e-07
1.25582336677e-06
-2.70103581309e-07
1.31698940925e-06
-2.82613119073e-07
1.38203662169e-06
-2.92286654106e-07
1.44256003567e-06
-2.9138823434e-07
1.49937267961e-06
-2.84102217911e-07
1.55281856821e-06
-2.73889291918e-07
1.60386772841e-06
-2.60620982449e-07
1.65400053498e-06
-2.43841893268e-07
1.70249823886e-06
-2.26265163233e-07
1.74747207022e-06
-2.10916687603e-07
1.7883280954e-06
-1.97586652156e-07
1.82550910887e-06
-1.84457043738e-07
1.85939071161e-06
-1.70410655321e-07
1.89011324042e-06
-1.55117228749e-07
1.91762433828e-06
-1.38539614283e-07
1.94181183759e-06
-1.20626448889e-07
1.96251836849e-06
-1.01424238735e-07
1.97910420288e-06
-8.12521474839e-08
1.99035624957e-06
-6.01148056206e-08
1.99607120016e-06
-3.71278777548e-08
1.99813953449e-06
-1.2288952017e-08
1.99697182879e-06
1.18156342056e-08
1.99040033006e-06
3.39423158025e-08
1.97599689082e-06
5.63809135171e-08
1.95060425362e-06
8.23671881587e-08
1.90893208479e-06
1.16423944885e-07
1.84228249645e-06
1.67348264118e-07
1.74069247836e-06
2.49953219715e-07
1.61188051624e-06
3.77828570657e-07
1.49938172286e-06
5.34624109494e-07
1.40598973278e-06
6.74444777136e-07
1.30916060104e-06
6.89256770243e-07
1.180894088e-06
5.88987786515e-07
1.04220152873e-06
5.12302682486e-07
9.24099539478e-07
4.76433163074e-07
8.2909745187e-07
4.87769652015e-07
7.39322791003e-07
5.43359696701e-07
6.37277294695e-07
5.85853281824e-07
5.34497372641e-07
5.58299174751e-07
4.38831876421e-07
5.08815836091e-07
3.44604997291e-07
4.831554385e-07
2.51691571204e-07
4.65661794323e-07
1.68409538319e-07
4.37109977528e-07
1.19775967239e-07
3.51420043282e-07
7.36171471544e-08
2.9854631882e-07
2.86626095069e-08
3.5633232223e-07
3.6096757231e-07
-9.99835525112e-13
-1.01281560267e-07
2.05453135168e-08
-1.15963103795e-07
3.23116029305e-08
-1.53309146047e-07
4.11352602841e-08
-1.43164186408e-07
4.05379009838e-08
-8.8360210496e-08
8.00652130846e-08
-1.11724303448e-07
1.17454311802e-07
-1.57817629896e-07
1.37291092929e-07
-1.67049140537e-07
1.62155272505e-07
-1.69682670824e-07
1.89081337318e-07
-1.68967478288e-07
2.10009695027e-07
-1.6274706183e-07
2.11477840045e-07
-1.33230679128e-07
2.21748795057e-07
-1.27239453977e-07
2.51504541918e-07
-1.42653104236e-07
2.97291697652e-07
-1.72154692178e-07
3.54611739093e-07
-2.06452683254e-07
4.08541082267e-07
-2.28877484698e-07
4.49145201934e-07
-2.39597937486e-07
4.86949834955e-07
-2.5382793894e-07
5.31737748871e-07
-2.74311118121e-07
5.7821509069e-07
-2.87465904654e-07
6.2437258601e-07
-2.9227846785e-07
6.71689148282e-07
-2.93528416939e-07
7.20263370641e-07
-2.93538108058e-07
7.68958800321e-07
-2.934147609e-07
8.16100235853e-07
-2.93086247032e-07
8.66759276317e-07
-2.97996408919e-07
9.16878125982e-07
-2.99785521522e-07
9.68066946038e-07
-3.01213019264e-07
1.0149396548e-06
-2.98249142597e-07
1.06622069554e-06
-3.01986818328e-07
1.12163985054e-06
-3.09569465819e-07
1.17955834803e-06
-3.19411038733e-07
1.24900095743e-06
-3.39440850877e-07
1.31899053588e-06
-3.5249512255e-07
1.38181312415e-06
-3.55001137558e-07
1.44021114201e-06
-3.49678174706e-07
1.49632875854e-06
-3.40111643547e-07
1.55046224869e-06
-3.27914148179e-07
1.60282854176e-06
-3.12877956814e-07
1.65388263179e-06
-2.94785768282e-07
1.70305605406e-06
-2.75327317077e-07
1.74895960146e-06
-2.567076496e-07
1.7908438564e-06
-2.39356619733e-07
1.82882172035e-06
-2.22318502031e-07
1.8632041296e-06
-2.04674202465e-07
1.89416420853e-06
-1.85955256633e-07
1.92168532241e-06
-1.65935003837e-07
1.94563643254e-06
-1.44446907894e-07
1.96576010682e-06
-1.21411566601e-07
1.98149726666e-06
-9.6846664268e-08
1.99216700143e-06
-7.06350576079e-08
1.99778126917e-06
-4.25861700043e-08
1.99893553294e-06
-1.32800505764e-08
1.99480919496e-06
1.61128029057e-08
1.98264038609e-06
4.62934705566e-08
1.95859367147e-06
8.06228288184e-08
1.91739331546e-06
1.23779271891e-07
1.85213749877e-06
1.81910062125e-07
1.75710768783e-06
2.62624457811e-07
1.63473631389e-06
3.72579524779e-07
1.50499390653e-06
5.07825922552e-07
1.40645946279e-06
6.334139767e-07
1.30871688156e-06
7.72439360082e-07
1.19328697932e-06
8.04923987497e-07
1.08816399661e-06
6.94312390677e-07
9.65591685611e-07
6.35058580126e-07
8.44977616972e-07
5.97234937153e-07
7.446168412e-07
5.88324229103e-07
6.47910708449e-07
6.40279159162e-07
5.45278378571e-07
6.88704429693e-07
4.57708963885e-07
6.46064523744e-07
3.6466760678e-07
6.020431455e-07
2.70234193553e-07
5.7778042983e-07
1.84273763919e-07
5.51817014162e-07
1.28760046889e-07
4.92792155848e-07
8.45826212458e-08
3.95743277867e-07
4.46649516286e-08
3.3864095039e-07
1.89108245976e-08
3.82148616577e-07
3.80011337384e-07
6.46606012798e-09
-1.07541641107e-07
2.77403185731e-08
-1.3698080282e-07
3.52776666173e-08
-1.60532544769e-07
2.72605188994e-08
-1.34892316235e-07
4.26153556765e-08
-1.03527067742e-07
8.31810355464e-08
-1.52035977674e-07
1.02560663737e-07
-1.76923636423e-07
1.18924273099e-07
-1.83135279145e-07
1.37120878459e-07
-1.87610381467e-07
1.63055599676e-07
-1.94639366438e-07
1.65878989862e-07
-1.65354086317e-07
1.72074375406e-07
-1.3926060637e-07
1.99218825378e-07
-1.54228695635e-07
2.36377921934e-07
-1.79658245514e-07
2.89730340833e-07
-2.25338799044e-07
3.43151691065e-07
-2.59698026761e-07
3.81403084583e-07
-2.66961366414e-07
4.16873299749e-07
-2.74910618882e-07
4.62865090612e-07
-2.99665412489e-07
5.10479672527e-07
-3.21775316791e-07
5.55863354288e-07
-3.32706109209e-07
6.0186365861e-07
-3.38142247791e-07
6.49469493015e-07
-3.4100503764e-07
6.96454238558e-07
-3.40399830922e-07
7.42922416314e-07
-3.3976495561e-07
7.9094054369e-07
-3.40991484101e-07
8.39705503451e-07
-3.46651114432e-07
8.91007022945e-07
-3.50980243758e-07
9.39428948305e-07
-3.49530432996e-07
9.87543730439e-07
-3.46261580856e-07
1.04527877234e-06
-3.59619289488e-07
1.1059550861e-06
-3.7014415496e-07
1.17461388967e-06
-3.8796675902e-07
1.24506683062e-06
-4.0978811946e-07
1.31421689388e-06
-4.215378083e-07
1.37672596533e-06
-4.17402788198e-07
1.43531950694e-06
-4.08164620057e-07
1.49225974001e-06
-3.96944816384e-07
1.54780106943e-06
-3.83348065185e-07
1.60172914352e-06
-3.66697985396e-07
1.65399917203e-06
-3.46946883602e-07
1.704099817e-06
-3.25318002741e-07
1.75098976605e-06
-3.03486324873e-07
1.79392861559e-06
-2.82182631403e-07
1.83280070052e-06
-2.61075929612e-07
1.8677706809e-06
-2.39527062106e-07
1.89895615945e-06
-2.17020720843e-07
1.9263321113e-06
-1.93186492427e-07
1.94977065823e-06
-1.67756072176e-07
1.96904263157e-06
-1.40547909694e-07
1.98375589425e-06
-1.11418141175e-07
1.99347689008e-06
-8.02086649173e-08
1.99793760637e-06
-4.68939642169e-08
1.99650596139e-06
-1.16919528779e-08
1.98699570024e-06
2.57865111651e-08
1.96547451669e-06
6.79860669627e-08
1.92699722727e-06
1.1928169667e-07
1.86661802947e-06
1.84350219332e-07
1.78161420535e-06
2.67114601689e-07
1.67486543769e-06
3.69583061581e-07
1.56053072863e-06
4.87127382052e-07
1.45968217536e-06
6.08885375226e-07
1.35820452961e-06
7.3509725881e-07
1.25354793374e-06
8.773076887e-07
1.10601233276e-06
9.52654487519e-07
9.89564883823e-07
8.10932099905e-07
8.9576605851e-07
7.2903707777e-07
7.86655682398e-07
7.0652186603e-07
6.72392320409e-07
7.02766666424e-07
5.62588826079e-07
7.50262450788e-07
4.75575604674e-07
7.75889295418e-07
3.90700071145e-07
7.31099575247e-07
2.91109280797e-07
7.01796722118e-07
1.99177639532e-07
6.69880137787e-07
1.27710861123e-07
6.23445024335e-07
9.18617426548e-08
5.2879336665e-07
4.63663903115e-08
4.41366450058e-07
1.06542391707e-08
3.74434524763e-07
5.45010543724e-09
3.8760068498e-07
3.85480265655e-07
1.18438240983e-08
-1.19214339916e-07
2.74686762102e-08
-1.52351426051e-07
2.98584709808e-08
-1.62683947173e-07
1.56471427556e-08
-1.20505901144e-07
4.21936338039e-08
-1.29872969693e-07
7.04561470411e-08
-1.80039129967e-07
8.45443787839e-08
-1.90749258326e-07
9.98739776013e-08
-1.98206742259e-07
1.06604946273e-07
-1.94083106911e-07
1.22697632849e-07
-2.10499755934e-07
1.20540694172e-07
-1.63028241859e-07
1.46742478761e-07
-1.65307303376e-07
1.77045184516e-07
-1.84379613147e-07
2.22664662164e-07
-2.25114320329e-07
2.7401217962e-07
-2.76506358261e-07
3.11956297513e-07
-2.97464425022e-07
3.4329245943e-07
-2.98133303313e-07
3.8774292492e-07
-3.19201768541e-07
4.36997822628e-07
-3.48763054064e-07
4.82741660935e-07
-3.67367476219e-07
5.27573472145e-07
-3.77394082144e-07
5.73332871127e-07
-3.8376637875e-07
6.21938635517e-07
-3.89482248391e-07
6.7042485089e-07
-3.88763168127e-07
7.14810276555e-07
-3.84034590195e-07
7.65902064738e-07
-3.91970653321e-07
8.13321839368e-07
-3.93962028806e-07
8.60479154534e-07
-3.98031700621e-07
9.0857722851e-07
-3.97526730779e-07
9.73855062639e-07
-4.11437586653e-07
1.03348204214e-06
-4.19144418266e-07
1.09395981762e-06
-4.30520087951e-07
1.16592566763e-06
-4.59829105986e-07
1.24055017646e-06
-4.84306825032e-07
1.30595611605e-06
-4.86837452775e-07
1.36799901468e-06
-4.79339586186e-07
1.42839055663e-06
-4.68450377152e-07
1.48731346111e-06
-4.5576200671e-07
1.54476107906e-06
-4.40689758948e-07
1.60051993326e-06
-4.22350367816e-07
1.65432132388e-06
-4.00641026107e-07
1.70565532854e-06
-3.76543715044e-07
1.75371100886e-06
-3.51432509182e-07
1.79779451129e-06
-3.26155278834e-07
1.83762438378e-06
-3.00793112012e-07
1.87318642108e-06
-2.74974180412e-07
1.90448615308e-06
-2.48201652012e-07
1.93146524165e-06
-2.20042646738e-07
1.95403927208e-06
-1.90200717407e-07
1.97208686924e-06
-1.58460681388e-07
1.9853694348e-06
-1.24559953361e-07
1.99345237434e-06
-8.81463352307e-08
1.99547290993e-06
-4.87666939264e-08
1.98946536992e-06
-5.53620861871e-09
1.97174531472e-06
4.36639252368e-08
1.93754665482e-06
1.02343196845e-07
1.88303208269e-06
1.7395957956e-07
1.80779207582e-06
2.59763733995e-07
1.71497731106e-06
3.60111158383e-07
1.61018676601e-06
4.7455657838e-07
1.50666311101e-06
5.90830590794e-07
1.41401585979e-06
7.01706726161e-07
1.32948559405e-06
8.19797166149e-07
1.2630248358e-06
9.43936710953e-07
1.13732760612e-06
1.07852577765e-06
9.31756754808e-07
1.01666931274e-06
7.9935338338e-07
8.61596643028e-07
6.89732387822e-07
8.16312153331e-07
5.7956524066e-07
8.13100070892e-07
4.89782304767e-07
8.40191141523e-07
4.16305741691e-07
8.4949680865e-07
3.18835740357e-07
8.28702499124e-07
2.14725746078e-07
8.0604937615e-07
1.29988511589e-07
7.54761293663e-07
7.5701209341e-08
6.77870705795e-07
3.61257342224e-08
5.68498511055e-07
-3.07178808335e-09
4.80697251053e-07
-3.28154527964e-08
4.04358401656e-07
-2.20049382732e-08
3.76815893209e-07
3.63602225437e-07
1.34849464259e-08
-1.32468272344e-07
2.13595606225e-08
-1.59972651519e-07
1.6075264654e-08
-1.57164590906e-07
1.66809051101e-08
-1.20938946174e-07
4.38891630778e-08
-1.5686463125e-07
5.34864281409e-08
-1.89387645638e-07
6.51007016714e-08
-2.02113220619e-07
7.91413537674e-08
-2.12006901467e-07
8.18001479368e-08
-1.96522413022e-07
8.98564852317e-08
-2.18335505211e-07
1.01505424467e-07
-1.74521328024e-07
1.2560664955e-07
-1.89259582043e-07
1.56832478893e-07
-2.15452266224e-07
2.0520958598e-07
-2.73318519575e-07
2.48116629836e-07
-3.19228151215e-07
2.75540495274e-07
-3.24711840944e-07
3.10480032357e-07
-3.32908142846e-07
3.57103379358e-07
-3.65663237859e-07
4.04492134092e-07
-3.95993026607e-07
4.50063010523e-07
-4.12786788775e-07
4.95325034534e-07
-4.22513443588e-07
5.39865324832e-07
-4.28171595466e-07
5.85674786079e-07
-4.35162342592e-07
6.32998248893e-07
-4.35967182994e-07
6.7686946654e-07
-4.27791567189e-07
7.2632353055e-07
-4.41313063559e-07
7.78333997301e-07
-4.45866690402e-07
8.3350172682e-07
-4.53094704697e-07
8.91818756787e-07
-4.55742379282e-07
9.49316077086e-07
-4.68834775158e-07
1.01195168917e-06
-4.81680057092e-07
1.08874350571e-06
-5.07209373061e-07
1.16263560278e-06
-5.33616884045e-07
1.22917690857e-06
-5.50743298703e-07
1.29370916091e-06
-5.51264872569e-07
1.35737447295e-06
-5.42900427997e-07
1.42008799943e-06
-5.31059747772e-07
1.4814363909e-06
-5.17006400147e-07
1.54118465644e-06
-5.0033383919e-07
1.59910544198e-06
-4.80166549059e-07
1.65482444555e-06
-4.56254712489e-07
1.70777947996e-06
-4.29392580259e-07
1.7572696115e-06
-4.0081549021e-07
1.80265364776e-06
-3.71430854479e-07
1.84351286917e-06
-3.41542179029e-07
1.87962113513e-06
-3.10969026235e-07
1.91083353697e-06
-2.7929719675e-07
1.9370577616e-06
-2.46143272306e-07
1.95828495317e-06
-2.11299778401e-07
1.97455594911e-06
-1.74596267309e-07
1.98577126832e-06
-1.35636470939e-07
1.9913513647e-06
-9.35842316273e-08
1.98964294348e-06
-4.69207853478e-08
1.97722714723e-06
7.02689015773e-09
1.9489637882e-06
7.2066735008e-08
1.90044608338e-06
1.5100852272e-07
1.83205875735e-06
2.42511659631e-07
1.75056873158e-06
3.41415876456e-07
1.65999920129e-06
4.50842923573e-07
1.55500522374e-06
5.79709197318e-07
1.4476128973e-06
6.98376389365e-07
1.3589576698e-06
7.90502321521e-07
1.29305152589e-06
8.85838978714e-07
1.24405570158e-06
9.93069090397e-07
1.19851254531e-06
1.12421364462e-06
9.94962248955e-07
1.22037337457e-06
7.24094855053e-07
1.13264235349e-06
6.02476279649e-07
9.38102278366e-07
5.12682102982e-07
9.03041247464e-07
4.38088331062e-07
9.14910676642e-07
3.54676807533e-07
9.33022243682e-07
2.41229862937e-07
9.42268726243e-07
1.33290059414e-07
9.1411372132e-07
5.95573810618e-08
8.28616409904e-07
8.16468094895e-09
7.29394257074e-07
-4.20696450522e-08
6.18871918687e-07
-7.5576692893e-08
5.14333708753e-07
-8.66416320172e-08
4.15492294606e-07
-5.5541438713e-08
3.45951432355e-07
3.08062390798e-07
1.3005536472e-08
-1.45293065812e-07
1.77342855208e-08
-1.64473741543e-07
6.72402172755e-09
-1.4595813037e-07
1.44295181657e-08
-1.28455832867e-07
3.41034853855e-08
-1.76300678541e-07
3.60989683715e-08
-1.91144255896e-07
4.36360161449e-08
-2.09415610645e-07
5.08913638744e-08
-2.19040556582e-07
6.24809240876e-08
-2.07921692377e-07
5.65265140859e-08
-2.12205665937e-07
7.61949532264e-08
-1.94041477989e-07
1.02631219191e-07
-2.15550781192e-07
1.33562272103e-07
-2.46226412274e-07
1.7511184213e-07
-3.14687350572e-07
2.07884785391e-07
-3.51819166024e-07
2.30411520617e-07
-3.47071179619e-07
2.71094992792e-07
-3.73427333025e-07
3.19087682474e-07
-4.13491905871e-07
3.65798772122e-07
-4.42545349489e-07
4.12418287521e-07
-4.59255732443e-07
4.59211133922e-07
-4.69163234365e-07
5.05027126463e-07
-4.73851170352e-07
5.47622695923e-07
-4.77630951175e-07
5.93599760173e-07
-4.81825044104e-07
6.43406297335e-07
-4.7748581696e-07
6.88877670886e-07
-4.86675967505e-07
7.39292377322e-07
-4.96175099048e-07
7.87550777002e-07
-5.01251438676e-07
8.53704287564e-07
-5.2179577896e-07
9.2144290198e-07
-5.36474711804e-07
9.93969905888e-07
-5.54108004072e-07
1.06738329115e-06
-5.80521704648e-07
1.14501550379e-06
-6.11145620226e-07
1.21413340915e-06
-6.19757586334e-07
1.27969688223e-06
-6.16725448352e-07
1.34522771689e-06
-6.08328848993e-07
1.41049271781e-06
-5.962226681e-07
1.4745995571e-06
-5.8101126879e-07
1.53702980972e-06
-5.62662089283e-07
1.59747736641e-06
-5.40511777714e-07
1.65551347769e-06
-5.14188001727e-07
1.71052256583e-06
-4.84298213783e-07
1.76181181531e-06
-4.52000397694e-07
1.80873251135e-06
-4.18245856198e-07
1.85073388905e-06
-3.83435152941e-07
1.88734886407e-06
-3.47472514619e-07
1.91821933281e-06
-3.10049524905e-07
1.94319619116e-06
-2.70998097614e-07
1.9624039244e-06
-2.30376960958e-07
1.97611961464e-06
-1.88178713465e-07
1.98445384054e-06
-1.43833097598e-07
1.98670324984e-06
-9.5699815148e-08
1.98041872532e-06
-4.05020632985e-08
1.96062803993e-06
2.69471258138e-08
1.92074341695e-06
1.12092594086e-07
1.85791344413e-06
2.13990472885e-07
1.779294583e-06
3.21247089575e-07
1.69990282021e-06
4.2098764115e-07
1.61697703215e-06
5.33941543694e-07
1.49602847462e-06
7.00791710733e-07
1.36464304399e-06
8.29834778602e-07
1.27650063389e-06
8.78697147853e-07
1.22425505176e-06
9.38133997489e-07
1.19783567564e-06
1.01954491648e-06
1.19384343694e-06
1.12828426684e-06
1.14034423587e-06
1.27400982458e-06
8.51514905655e-07
1.42163428334e-06
5.31584978474e-07
1.25820012938e-06
4.47453827956e-07
9.87318846461e-07
3.8978290264e-07
9.72681073507e-07
2.87976964095e-07
1.03490525561e-06
1.54918324688e-07
1.075399389e-06
4.09017468077e-08
1.02820676527e-06
-1.33254127374e-08
8.82942763043e-07
-7.66790433253e-08
7.92865267667e-07
-1.38183053748e-07
6.80494377057e-07
-1.66222957629e-07
5.42528568251e-07
-1.45922278928e-07
3.95366192428e-07
-8.59697589283e-08
2.85985059147e-07
2.22195199653e-07
9.08840519906e-09
-1.54140994432e-07
1.13425911407e-08
-1.66504571301e-07
2.98871671055e-09
-1.3742731928e-07
1.33952573688e-08
-1.38672542971e-07
1.42035777775e-08
-1.76885510522e-07
1.74278365462e-08
-1.9415028968e-07
2.21316006601e-08
-2.13889622205e-07
2.0574946859e-08
-2.17283681318e-07
4.17251245058e-08
-2.28884402329e-07
3.52521589567e-08
-2.05580915417e-07
5.31857405524e-08
-2.11831701875e-07
7.79193035113e-08
-2.40137984586e-07
1.08172011398e-07
-2.7632484792e-07
1.406532987e-07
-3.46988721131e-07
1.64672775774e-07
-3.75658402375e-07
1.89683100965e-07
-3.71918623355e-07
2.30126559321e-07
-4.1370753953e-07
2.75334334138e-07
-4.58535725357e-07
3.20772214349e-07
-4.87823761583e-07
3.68006753492e-07
-5.06338460636e-07
4.17101246178e-07
-5.18115656692e-07
4.67968839316e-07
-5.24587461023e-07
5.07289838818e-07
-5.16825938816e-07
5.5064125255e-07
-5.25056367243e-07
5.98302621607e-07
-5.25039084595e-07
6.42276229893e-07
-5.30542891582e-07
7.06349122955e-07
-5.60141669084e-07
7.69054907489e-07
-5.63855493166e-07
8.28102464344e-07
-5.80742194932e-07
8.8724375432e-07
-5.95519004459e-07
9.5835432033e-07
-6.25121446294e-07
1.04476463488e-06
-6.66831730802e-07
1.12334661079e-06
-6.8962570109e-07
1.19409545956e-06
-6.90405101934e-07
1.26261070694e-06
-6.85140130375e-07
1.33108140162e-06
-6.7669954859e-07
1.39937781186e-06
-6.6441940266e-07
1.46666109488e-06
-6.48195110188e-07
1.53222449183e-06
-6.28126022356e-07
1.59563406362e-06
-6.03821765448e-07
1.65643860981e-06
-5.74892717568e-07
1.71397815741e-06
-5.41737490659e-07
1.7675077324e-06
-5.05428668307e-07
1.8163131873e-06
-4.66947932685e-07
1.85966179347e-06
-4.26677426942e-07
1.89678214647e-06
-3.84480507044e-07
1.92702786904e-06
-3.40178937104e-07
1.95015584387e-06
-2.94000820793e-07
1.96644513555e-06
-2.46538245829e-07
1.9765523134e-06
-1.98152674624e-07
1.98103852912e-06
-1.4818750713e-07
1.97939737832e-06
-9.39368268522e-08
1.96870205483e-06
-2.96840841982e-08
1.94258286844e-06
5.31939570732e-08
1.89214830001e-06
1.62654211159e-07
1.81506228516e-06
2.91153821338e-07
1.72407448027e-06
4.12475903085e-07
1.65044079104e-06
4.94881256916e-07
1.58928777513e-06
5.95327220247e-07
1.42836715103e-06
8.61798635329e-07
1.23515837792e-06
1.02300736889e-06
1.14651145883e-06
9.67275001545e-07
1.10686757048e-06
9.77711824472e-07
1.09516661946e-06
1.03119967651e-06
1.09021275058e-06
1.13322724954e-06
1.08510397247e-06
1.27914545932e-06
1.02200326995e-06
1.48486350853e-06
6.7038290564e-07
1.60997708395e-06
4.49730797377e-07
1.20804009359e-06
3.50375347261e-07
1.07206800472e-06
2.14180570155e-07
1.17110276046e-06
4.82259776547e-08
1.24134853209e-06
-8.70281020385e-08
1.16348462954e-06
-8.27123472134e-08
8.78717096151e-07
-1.63661798345e-07
8.73947641581e-07
-2.45875487814e-07
7.62940057793e-07
-2.72801093742e-07
5.69610937247e-07
-2.19532550016e-07
3.42166939357e-07
-1.2555309611e-07
1.92214857992e-07
9.66154548195e-08
2.4118987729e-09
-1.56385649044e-07
7.81487545555e-10
-1.64690219837e-07
2.539851073e-09
-1.3902355824e-07
8.9896855781e-09
-1.44951327592e-07
-1.18716641349e-09
-1.6652092594e-07
1.39447507158e-09
-1.96522858051e-07
4.4915345097e-09
-2.16791364562e-07
-4.52409198066e-09
-2.08070120293e-07
1.34594857588e-08
-2.46687230586e-07
1.64418248416e-08
-2.08415610103e-07
3.04215041851e-08
-2.25670098201e-07
5.13460306247e-08
-2.60919212788e-07
8.02501582907e-08
-3.05069589184e-07
1.07841638212e-07
-3.74406575526e-07
1.17812116877e-07
-3.85462395963e-07
1.4407616844e-07
-3.98024051475e-07
1.84983947899e-07
-4.54452914599e-07
2.27434054394e-07
-5.00822586564e-07
2.70833044093e-07
-5.31063666303e-07
3.17572987399e-07
-5.5292693518e-07
3.68208000492e-07
-5.68609903934e-07
4.21570907645e-07
-5.77818722171e-07
4.61765481589e-07
-5.56900254806e-07
4.99694827874e-07
-5.62872619511e-07
5.56675599615e-07
-5.81909370083e-07
6.11290215188e-07
-5.85051741406e-07
6.60609130495e-07
-6.09356658508e-07
7.2070523554e-07
-6.2385134729e-07
7.87221953459e-07
-6.47161923804e-07
8.6656717503e-07
-6.74766371458e-07
9.45541183233e-07
-7.03997441655e-07
1.02506228771e-06
-7.46253361528e-07
1.09723358123e-06
-7.61697886159e-07
1.1695658667e-06
-7.62638937288e-07
1.24211731607e-06
-7.57593878352e-07
1.3143675172e-06
-7.48852607052e-07
1.38630967246e-06
-7.36264888354e-07
1.45738365207e-06
-7.19172665417e-07
1.52671598432e-06
-6.9736210723e-07
1.59362960876e-06
-6.70639207907e-07
1.65764300147e-06
-6.38809921386e-07
1.71820115672e-06
-6.02198895869e-07
1.77453415816e-06
-5.61663455861e-07
1.8257404536e-06
-5.18053011849e-07
1.87080482768e-06
-4.71635146137e-07
1.90855608814e-06
-4.22120363613e-07
1.9379412759e-06
-3.69443952217e-07
1.958513652e-06
-3.14449821103e-07
1.97072764494e-06
-2.58622625333e-07
1.97581155181e-06
-2.03108769621e-07
1.97524095686e-06
-1.4749985659e-07
1.96945660191e-06
-8.80410865532e-08
1.9562847266e-06
-1.64062707774e-08
1.92927569407e-06
8.03034284692e-08
1.87388977448e-06
2.18149743945e-07
1.77763099779e-06
3.87640218666e-07
1.64754025524e-06
5.42867427205e-07
1.58027449055e-06
5.62534915299e-07
1.60979666223e-06
5.66084400261e-07
1.35541465819e-06
1.1162242661e-06
1.01836947333e-06
1.36005423997e-06
9.49005541035e-07
1.03662591032e-06
9.32161990942e-07
9.94552073513e-07
9.38339262698e-07
1.02503374529e-06
9.3199217795e-07
1.13960041615e-06
9.21219844848e-07
1.28999580481e-06
9.32081538313e-07
1.47411228424e-06
8.27681034161e-07
1.7144989366e-06
5.67514878623e-07
1.46831482627e-06
3.92962342536e-07
1.24665253903e-06
1.46057328318e-07
1.41802061259e-06
-8.38976430033e-08
1.47133244809e-06
-2.80944919163e-07
1.36063479511e-06
-9.42932049751e-08
6.92222206556e-07
-2.3358170554e-07
1.01351026122e-06
-3.73119100118e-07
9.02712373462e-07
-4.25087105612e-07
6.21805430291e-07
-3.2863984113e-07
2.45905979786e-07
-1.93802797454e-07
5.73006734048e-08
-9.71071125297e-08
-3.56020639496e-09
-1.52596136881e-07
-1.0152820656e-08
-1.57892445576e-07
-2.07125766401e-09
-1.4692702988e-07
-2.18509851698e-09
-1.44669675582e-07
-9.35590733065e-09
-1.59180341009e-07
-1.07635574731e-08
-1.9493024093e-07
-1.20256546904e-08
-2.1533380561e-07
-2.06740331824e-08
-1.99260444405e-07
-1.28046742994e-08
-2.54366530426e-07
-7.86341490458e-09
-2.13214922158e-07
4.5910318759e-09
-2.37984246542e-07
2.16393283033e-08
-2.77819949547e-07
4.56101324007e-08
-3.28884963231e-07
6.84224841782e-08
-3.9705106752e-07
7.1610217298e-08
-3.88498985663e-07
9.85529008057e-08
-4.2481520456e-07
1.36587439886e-07
-4.92327692256e-07
1.75646683486e-07
-5.3972154864e-07
2.16856713985e-07
-5.72116720987e-07
2.61905035877e-07
-5.97823902051e-07
3.12918445879e-07
-6.19478510292e-07
3.67443794537e-07
-6.32214633082e-07
4.07226803716e-07
-5.96573474471e-07
4.41651612245e-07
-5.97187884283e-07
5.02758566085e-07
-6.42904939737e-07
5.58294133265e-07
-6.40486069277e-07
6.04311532596e-07
-6.55274819289e-07
6.74897784119e-07
-6.94338277088e-07
7.43065575405e-07
-7.15232989348e-07
8.16946810749e-07
-7.48552646415e-07
9.0899327798e-07
-7.95947289876e-07
9.92834418874e-07
-8.29996971597e-07
1.06814746209e-06
-8.36914516031e-07
1.14276593907e-06
-8.37162209803e-07
1.21880794766e-06
-8.33541442728e-07
1.29517637384e-06
-8.25127299782e-07
1.37113232058e-06
-8.12127607857e-07
1.44627832207e-06
-7.94225906621e-07
1.51996439691e-06
-7.70955746075e-07
1.59125529464e-06
-7.4183797812e-07
1.65927084788e-06
-7.06733230229e-07
1.72342108078e-06
-6.662560022e-07
1.78311245928e-06
-6.21258781487e-07
1.83739039993e-06
-5.7223008895e-07
1.88482542425e-06
-5.18963630766e-07
1.92362091145e-06
-4.60801216145e-07
1.95207942397e-06
-3.97783441902e-07
1.96937552113e-06
-3.31620422971e-07
1.97607514401e-06
-2.65198521253e-07
1.9741458057e-06
-2.01064423058e-07
1.96662031706e-06
-1.39873461334e-07
1.95621070683e-06
-7.75421359514e-08
1.9447603767e-06
-4.88247822431e-09
1.93158551067e-06
9.36447762315e-08
1.887531886e-06
2.62364345737e-07
1.75252827216e-06
5.22883718543e-07
1.48702549124e-06
8.08688776967e-07
1.42502928216e-06
6.24776528394e-07
1.8343218834e-06
1.56940174403e-07
1.60759493855e-06
1.34310604747e-06
7.70274554561e-07
2.19795369473e-06
9.49583638078e-07
8.57752517088e-07
1.07720137277e-06
8.67310198983e-07
1.20782552523e-06
8.94744167844e-07
1.27472670733e-06
1.07301238791e-06
1.28328830357e-06
1.28172068119e-06
1.19185349913e-06
1.56584501505e-06
1.87959902953e-06
1.02710560933e-06
2.32012323945e-06
1.02809930254e-06
9.94607528547e-07
2.57239417917e-06
1.62908050559e-07
2.24995718292e-06
-3.98420673777e-07
2.03293276469e-06
-1.22232076648e-06
2.18482730485e-06
-1.45063722575e-08
-5.15373741574e-07
-2.49834786799e-07
1.24904555461e-06
-5.34692986958e-07
1.18777003982e-06
-6.56443855173e-07
7.43644650631e-07
-4.68010540829e-07
5.7419189331e-08
-3.01222056181e-07
-1.09356665446e-07
-3.98346697481e-07
-5.92395234309e-09
-1.4652236019e-07
-1.38453748226e-08
-1.49787985351e-07
-1.68552319779e-08
-1.43729010924e-07
-1.7658258859e-08
-1.43703584382e-07
-2.00324918076e-08
-1.56637979339e-07
-2.40682370025e-08
-1.90706031912e-07
-3.0223427869e-08
-2.09007480953e-07
-3.38044474205e-08
-1.9550526461e-07
-3.74505491407e-08
-2.50548973485e-07
-3.33732634052e-08
-2.17150297627e-07
-2.31344474468e-08
-2.48082993157e-07
-1.02566593756e-08
-2.90551892244e-07
7.0140131631e-09
-3.45993997324e-07
2.35001643935e-08
-4.13375813843e-07
3.43577918371e-08
-3.99211024008e-07
5.88786724759e-08
-4.49187143836e-07
8.8306879983e-08
-5.21600402595e-07
1.21632650526e-07
-5.72890768625e-07
1.59773464371e-07
-6.10103727235e-07
2.02704916377e-07
-6.40604893357e-07
2.51637126029e-07
-6.68268349914e-07
3.05720532431e-07
-6.86168825427e-07
3.5876240429e-07
-6.49501201142e-07
4.01476901187e-07
-6.39796716888e-07
4.39240814717e-07
-6.80566657915e-07
5.05021515425e-07
-7.0616697707e-07
5.69282792388e-07
-7.19438484962e-07
6.27309577549e-07
-7.52267324283e-07
7.01948767311e-07
-7.89776627957e-07
7.92264975283e-07
-8.3877247909e-07
8.81483757818e-07
-8.85069669237e-07
9.5671687886e-07
-9.05135497922e-07
1.03341601709e-06
-9.13520747116e-07
1.11222167101e-06
-9.15876116948e-07
1.1922193264e-06
-9.13448439789e-07
1.27286943875e-06
-9.05687542235e-07
1.35363816711e-06
-8.9280721599e-07
1.43358358328e-06
-8.74082839861e-07
1.5119340359e-06
-8.4921840385e-07
1.58802867863e-06
-8.17845116613e-07
1.66094911468e-06
-7.79565685181e-07
1.72969947623e-06
-7.34916019734e-07
1.79358154251e-06
-6.85046384142e-07
1.85176267964e-06
-6.30310417101e-07
1.90255544458e-06
-5.69647685841e-07
1.94331716983e-06
-5.01447432136e-07
1.97127200015e-06
-4.25616545318e-07
1.98475311152e-06
-3.44978877197e-07
1.98419785246e-06
-2.64532648224e-07
1.97233150342e-06
-1.8910431662e-07
1.95427237885e-06
-1.21732415423e-07
1.9361674575e-06
-5.93895575467e-08
1.93040679723e-06
1.04760241682e-09
1.96472187071e-06
5.94579254407e-08
1.98760259125e-06
2.39741141226e-07
1.80922614353e-06
7.01425727907e-07
1.3278440184e-06
1.29018143226e-06
1.33615786442e-06
6.17309465832e-07
4.96850621671e-06
-3.47489758318e-06
1.74333351875e-05
-1.11209147458e-05
3.16807625387e-05
-1.20480018524e-05
3.45972909829e-05
-2.05767803634e-06
3.53062583617e-05
1.59248847021e-07
3.51330091041e-05
1.06877444681e-06
3.45890771304e-05
1.61761187644e-06
3.38056614963e-05
2.06571189998e-06
3.29093817003e-05
2.46262122491e-06
3.13558414292e-05
2.58111267661e-06
2.95028987632e-05
2.88154603802e-06
2.81194893162e-05
3.9563758564e-06
2.52270286157e-05
5.14300383744e-06
2.0337035041e-05
6.92347531605e-06
1.40397446065e-05
8.48258303621e-06
4.63417789951e-06
8.89032617386e-06
9.13517161123e-07
4.96981478e-06
-6.88886275746e-07
2.79021375322e-06
-1.44290828645e-06
1.4977366844e-06
-7.06643536846e-07
-6.78782145023e-07
-4.91667768573e-07
-3.24343739454e-07
-8.89979198461e-07
-7.08211752723e-09
-1.39220515915e-07
-1.41226294507e-08
-1.42541891616e-07
-2.89088058895e-08
-1.28778520959e-07
-3.12709347271e-08
-1.41175082437e-07
-3.26559071918e-08
-1.55086124455e-07
-3.83090310292e-08
-1.84875206803e-07
-4.59692278663e-08
-2.01171152745e-07
-4.76218213486e-08
-1.93696182839e-07
-6.41463220996e-08
-2.33855707218e-07
-5.98168559741e-08
-2.21343954152e-07
-5.17142236101e-08
-2.56046889352e-07
-4.27576082651e-08
-2.99363686218e-07
-3.12345838405e-08
-3.57361418377e-07
-2.17178221172e-08
-4.22728243305e-07
-7.1991598721e-09
-4.13585330394e-07
1.55990535438e-08
-4.71838278129e-07
3.86403296875e-08
-5.44488389512e-07
6.60899745525e-08
-6.0018685224e-07
1.00370790664e-07
-6.44233214779e-07
1.41151824021e-07
-6.81239229243e-07
1.87593297354e-07
-7.14566927971e-07
2.40329462429e-07
-7.38771008144e-07
3.04259283512e-07
-7.13318304326e-07
3.47221959566e-07
-6.82662157278e-07
3.7332262321e-07
-7.06568496336e-07
4.43444567887e-07
-7.76188223285e-07
5.11946209908e-07
-7.87847078643e-07
5.78334413467e-07
-8.18562693879e-07
6.65470885955e-07
-8.76815650278e-07
7.57423834799e-07
-9.30629353812e-07
8.38294652833e-07
-9.65846639973e-07
9.16941490279e-07
-9.83690647717e-07
9.96713080776e-07
-9.93202610382e-07
1.07844237531e-06
-9.9751758318e-07
1.16230873951e-06
-9.97228163619e-07
1.24760845381e-06
-9.90901835394e-07
1.33330277118e-06
-9.78417151215e-07
1.41851381239e-06
-9.59210524411e-07
1.50243111381e-06
-9.33053058626e-07
1.58400531239e-06
-8.99336614513e-07
1.66244383337e-06
-8.57919850424e-07
1.7367786794e-06
-8.09162751572e-07
1.80601738258e-06
-7.54190387164e-07
1.86932774313e-06
-6.93517955359e-07
1.92503986586e-06
-6.25248320588e-07
1.96954419546e-06
-5.45834184048e-07
1.99818651793e-06
-4.54137325903e-07
2.00780539893e-06
-3.54491988435e-07
1.99847176791e-06
-2.5511044727e-07
1.9726426487e-06
-1.63196034247e-07
1.93735046133e-06
-8.64127552818e-08
1.89996832292e-06
-2.1860803457e-08
1.88931644263e-06
1.18103438015e-08
2.0436272649e-06
-9.45850274709e-08
2.36038671302e-06
-7.69034286542e-08
3.08088294778e-06
-1.8835245399e-08
1.87167856358e-05
-1.43444503213e-05
4.0703304153e-05
-2.13674151701e-05
4.80836807713e-05
-1.08542990818e-05
4.75687315327e-05
-1.06052419325e-05
4.54699964575e-05
-9.94876506453e-06
4.84363243276e-05
-5.02356430654e-06
5.22599336091e-05
-3.6639374964e-06
5.60342404032e-05
-2.70512814153e-06
5.97637058417e-05
-2.11147942004e-06
6.32515262368e-05
-1.42177619373e-06
6.62732172443e-05
-5.58768742412e-07
6.82716099683e-05
5.83019858118e-07
6.89559887707e-05
2.19750243893e-06
6.84863155026e-05
4.42641290586e-06
6.63194456822e-05
7.31020029687e-06
6.24042376415e-05
1.08389993949e-05
5.64550675207e-05
1.44319763687e-05
4.84743264569e-05
1.68712761416e-05
3.70498654531e-05
1.63944162103e-05
2.42341286851e-05
1.56061689165e-05
1.19196046583e-05
1.38124039818e-05
8.93730765993e-07
1.03471437462e-05
-8.71960244641e-07
1.44155879661e-06
-1.76196282578e-06
-1.04068040659e-08
-1.28663920041e-07
-2.11393609877e-08
-1.31650298829e-07
-3.56451750299e-08
-1.14112286855e-07
-4.21885616678e-08
-1.34470650173e-07
-4.55538920677e-08
-1.51550104745e-07
-5.40922785202e-08
-1.76160060033e-07
-6.27533678396e-08
-1.92342043853e-07
-6.19670732851e-08
-1.94327363401e-07
-8.23343813355e-08
-2.13346972288e-07
-8.36432475617e-08
-2.19901185204e-07
-7.95157449751e-08
-2.60038889267e-07
-7.45833014024e-08
-3.04151126015e-07
-6.85959980514e-08
-3.63190971669e-07
-6.65511565702e-08
-4.24617059894e-07
-5.35347722131e-08
-4.26456942784e-07
-3.32010902844e-08
-4.92023811472e-07
-1.45537975977e-08
-5.6298512177e-07
7.90102732632e-09
-6.22491445996e-07
3.81069528837e-08
-6.74291629863e-07
7.59721464743e-08
-7.18959701448e-07
1.20575121315e-07
-7.59030148004e-07
1.71917157528e-07
-7.89982776543e-07
2.38333078218e-07
-7.79618231833e-07
2.91062816944e-07
-7.35290371731e-07
3.29070766224e-07
-7.44482261629e-07
3.72551397922e-07
-8.19575857035e-07
4.46946440223e-07
-8.62149021367e-07
5.22922220588e-07
-8.94446245628e-07
5.99748710015e-07
-9.53550413534e-07
6.9636480853e-07
-1.02715162384e-06
7.86201231053e-07
-1.0555907324e-06
8.7061771468e-07
-1.06801794266e-06
9.54553397314e-07
-1.07705208483e-06
1.0408066207e-06
-1.08368665368e-06
1.12919190851e-06
-1.08553154594e-06
1.21927747426e-06
-1.0809070028e-06
1.31020666896e-06
-1.0692673828e-06
1.40104300937e-06
-1.04996914061e-06
1.49081770391e-06
-1.02275058426e-06
1.5786345146e-06
-9.8707517831e-07
1.66349634432e-06
-9.42699991524e-07
1.74451593556e-06
-8.90094648721e-07
1.82050478496e-06
-8.30083671199e-07
1.89050643227e-06
-7.63415089681e-07
1.95296795856e-06
-6.87597854082e-07
2.00359864891e-06
-5.96346014642e-07
2.03573636814e-06
-4.86167609308e-07
2.04395583141e-06
-3.6262271496e-07
2.0258879237e-06
-2.36969527164e-07
1.9803710278e-06
-1.17670582468e-07
1.91915149526e-06
-2.50413862491e-08
1.83148198571e-06
6.59518552917e-08
1.72750980949e-06
1.15961693218e-07
2.25226654241e-06
-6.19240669399e-07
7.16689817459e-06
-4.99097882828e-06
3.07186329806e-05
-2.35695204486e-05
5.36091391694e-05
-3.72339424838e-05
5.2924777179e-05
-2.06825130649e-05
5.67872132616e-05
-1.47163054752e-05
5.94507830969e-05
-1.32685224221e-05
6.09817987449e-05
-1.14795383565e-05
6.5512557068e-05
-9.55408458378e-06
7.11861430533e-05
-9.33727991523e-06
7.73825803322e-05
-8.90131890892e-06
8.36543993651e-05
-8.38305643772e-06
8.96672196794e-05
-7.4343685425e-06
9.50810427729e-05
-5.97238062322e-06
9.95092976632e-05
-3.84502479985e-06
0.000102633449651
-9.2641761614e-07
0.000104181827285
2.87827336793e-06
0.000103864929767
7.62733954516e-06
0.000101585568695
1.31185595097e-05
9.69722850911e-05
1.90454631119e-05
8.93359269372e-05
2.45078026386e-05
7.70383592481e-05
2.86921336736e-05
6.13313985554e-05
3.13132236233e-05
4.38533797591e-05
3.1290516363e-05
2.71309116575e-05
2.70698616403e-05
8.79458027921e-06
1.97776249364e-05
7.03279386559e-06
-1.36172979576e-08
-1.1483087637e-07
-2.69140252441e-08
-1.18148769548e-07
-4.26078051809e-08
-9.82732906125e-08
-5.24133647615e-08
-1.24498175667e-07
-6.01825727012e-08
-1.43607902244e-07
-7.2207174138e-08
-1.63956264979e-07
-8.43792436091e-08
-1.80005704191e-07
-8.52971855506e-08
-1.93253605867e-07
-1.00107792167e-07
-1.98395005513e-07
-1.05983885939e-07
-2.13895150206e-07
-1.06477672396e-07
-2.59407252786e-07
-1.04938861883e-07
-3.05549091415e-07
-1.0359489529e-07
-3.64383037673e-07
-1.12160189982e-07
-4.15898194899e-07
-1.01402547766e-07
-4.3707344956e-07
-8.50129909371e-08
-5.08269015087e-07
-7.05579274609e-08
-5.77293521907e-07
-5.34548767798e-08
-6.39448727277e-07
-2.75993995404e-08
-7.00003138329e-07
6.44899296027e-09
-7.52867754708e-07
4.89268235015e-08
-8.01371016848e-07
9.95345239218e-08
-8.40458026944e-07
1.64009121949e-07
-8.43973520307e-07
2.2485047152e-07
-7.96033304573e-07
2.70987658547e-07
-7.90533055343e-07
2.9728699844e-07
-8.45785188089e-07
3.74542618077e-07
-9.39311949502e-07
4.59887593116e-07
-9.7970099753e-07
5.51500367749e-07
-1.04507106959e-06
6.40573285148e-07
-1.11613118966e-06
7.27867707894e-07
-1.1427953755e-06
8.15365194662e-07
-1.15542917807e-06
9.05190450968e-07
-1.16679428607e-06
9.97626566907e-07
-1.17604348962e-06
1.09139393718e-06
-1.17922183166e-06
1.18671715865e-06
-1.17615546307e-06
1.28353142954e-06
-1.16600875335e-06
1.38063867716e-06
-1.14700473389e-06
1.47678145822e-06
-1.11882125588e-06
1.57152636016e-06
-1.08174508325e-06
1.66373538342e-06
-1.03482883938e-06
1.75210162212e-06
-9.78373043111e-07
1.83560322749e-06
-9.13488700519e-07
1.91381203272e-06
-8.41517581994e-07
1.98639353404e-06
-7.60064410566e-07
2.04845283666e-06
-6.5829492248e-07
2.08968881124e-06
-5.2731289094e-07
2.10090910212e-06
-3.73778796035e-07
2.07602341154e-06
-2.1208755667e-07
2.00436722512e-06
-4.5846751039e-08
1.9215851024e-06
5.79404791725e-08
1.73257783509e-06
2.55112503715e-07
1.46431544663e-06
3.84331077323e-07
1.69164949594e-05
-1.60699507087e-05
4.65866525858e-05
-3.46599198814e-05
6.59263662778e-05
-4.2908456188e-05
6.3032745987e-05
-3.43401023813e-05
6.38830484457e-05
-2.15326670691e-05
6.77634384977e-05
-1.85965431734e-05
7.21191410678e-05
-1.76240709604e-05
7.76244171029e-05
-1.69846663647e-05
8.48278266029e-05
-1.67573430139e-05
9.26588789621e-05
-1.71681738496e-05
0.000100831872176
-1.70741483155e-05
0.000108916775748
-1.64677953174e-05
0.000116584021299
-1.51014551818e-05
0.000123517261909
-1.2905469025e-05
0.00012943726803
-9.76488042449e-06
0.000134105123706
-5.59411903035e-06
0.000137297188539
-3.13624580797e-07
0.000138766765045
6.1579188473e-06
0.000138213178898
1.36722988258e-05
0.000135207269753
2.2051513481e-05
0.000129103607972
3.06115903651e-05
0.000118787343086
3.90084793142e-05
0.000103616667204
4.64839528643e-05
8.35709330623e-05
5.13362281957e-05
5.96249356689e-05
5.10157877605e-05
3.02889949506e-05
4.91139282539e-05
3.73216931699e-05
-1.73371804673e-08
-9.73363194267e-08
-3.41395128601e-08
-1.01195429267e-07
-4.85703300035e-08
-8.36933221629e-08
-6.15537299591e-08
-1.11347701108e-07
-7.52993331014e-08
-1.29681620032e-07
-9.0557455243e-08
-1.48525287309e-07
-1.06836881982e-07
-1.63552155871e-07
-1.11873047912e-07
-1.88056832745e-07
-1.24040826909e-07
-1.86090342997e-07
-1.31476157401e-07
-2.06327200611e-07
-1.35162287435e-07
-2.55586497712e-07
-1.36114675026e-07
-3.044524203e-07
-1.36093651963e-07
-3.64257207351e-07
-1.53192394805e-07
-3.98659830134e-07
-1.47652103687e-07
-4.42476393895e-07
-1.3675818595e-07
-5.19021452097e-07
-1.26436014053e-07
-5.87474144273e-07
-1.16286545727e-07
-6.49457586985e-07
-9.59203273797e-08
-7.20230372706e-07
-6.70610920167e-08
-7.81590790428e-07
-2.80072181273e-08
-8.40291812575e-07
2.12126275024e-08
-8.89549351851e-07
8.25166042939e-08
-9.05159479131e-07
1.47704511875e-07
-8.61120610346e-07
2.07053416952e-07
-8.49792071799e-07
2.48995736887e-07
-8.87644334842e-07
3.07362299075e-07
-9.97592349662e-07
3.93226800123e-07
-1.06547627811e-06
4.86524715623e-07
-1.13827783691e-06
5.73958837813e-07
-1.20347505863e-06
6.64903911038e-07
-1.23365286587e-06
7.55121847844e-07
-1.24556350414e-06
8.51223525664e-07
-1.26281680522e-06
9.49917203745e-07
-1.27466119479e-06
1.04760152028e-06
-1.27683475405e-06
1.14859166418e-06
-1.27707722036e-06
1.25250460245e-06
-1.26985531593e-06
1.35660267247e-06
-1.25103675845e-06
1.45993314364e-06
-1.22208374068e-06
1.56161502254e-06
-1.18335411281e-06
1.66130993668e-06
-1.13444334106e-06
1.7584776552e-06
-1.07545195479e-06
1.8524840487e-06
-1.00739703514e-06
1.94070993093e-06
-9.29637103406e-07
2.01754985486e-06
-8.3679937461e-07
2.07760499561e-06
-7.18257692239e-07
2.12489452325e-06
-5.74540668101e-07
2.16068424919e-06
-4.09559026852e-07
2.15400467257e-06
-2.0527163938e-07
2.05366011354e-06
5.47294638642e-08
2.06595524735e-06
4.58137906001e-08
2.39166330411e-06
-7.04623048862e-08
3.62075918586e-05
-3.34294394342e-05
7.21562232317e-05
-5.20164143738e-05
7.61578264928e-05
-3.86609798493e-05
7.44813827167e-05
-4.12319542989e-05
7.18086378017e-05
-3.16673869685e-05
7.52610301565e-05
-2.49850370314e-05
8.09219707659e-05
-2.42574097456e-05
8.78738742826e-05
-2.45758833658e-05
9.62731430906e-05
-2.53838370598e-05
0.00010579509982
-2.62791950294e-05
0.000115672314884
-2.7045278961e-05
0.000125642806699
-2.70445259966e-05
0.000135370582586
-2.61954556416e-05
0.000144585849549
-2.43166081124e-05
0.000153018219639
-2.13377305671e-05
0.000160418283812
-1.71648404059e-05
0.000166547907538
-1.17236357603e-05
0.000171167862155
-4.93347551457e-06
0.000174014797635
3.311083021e-06
0.000174610733417
1.30764600828e-05
0.00017243258447
2.422975864e-05
0.000166602277814
3.64419771474e-05
0.000155997820677
4.96129957241e-05
0.000139259769884
6.32220082311e-05
0.000114986753072
7.5609237237e-05
8.28296137085e-05
8.31730241612e-05
5.07477027942e-05
8.11956112868e-05
8.80694517319e-05
-2.12945402971e-08
-7.5819306544e-08
-4.24827415036e-08
-7.9802044888e-08
-5.73112718088e-08
-6.87166903898e-08
-7.36884763545e-08
-9.47881444673e-08
-9.16840839939e-08
-1.11504768908e-07
-1.09160752992e-07
-1.30864384782e-07
-1.27202786988e-07
-1.45344686237e-07
-1.38960462127e-07
-1.76131146149e-07
-1.50528559929e-07
-1.743815052e-07
-1.59888958992e-07
-1.96836863539e-07
-1.66909450536e-07
-2.48426907931e-07
-1.71683980124e-07
-2.99538906186e-07
-1.7358979298e-07
-3.62206364817e-07
-1.87535897863e-07
-3.84580203847e-07
-1.90662231623e-07
-4.39216976624e-07
-1.87604939947e-07
-5.21941627909e-07
-1.81780849233e-07
-5.93161061688e-07
-1.76692097503e-07
-6.54412725127e-07
-1.63774179789e-07
-7.3301568273e-07
-1.42647193161e-07
-8.02587751457e-07
-1.09822298009e-07
-8.72987755025e-07
-6.26848711917e-08
-9.36560592026e-07
-5.56761670945e-09
-9.62158940541e-07
6.08540418602e-08
-9.27439346517e-07
1.29943245779e-07
-9.18795107119e-07
1.83437306972e-07
-9.4105959202e-07
2.25161933377e-07
-1.03923709163e-06
3.00978200939e-07
-1.14121046859e-06
3.99985129539e-07
-1.23719922319e-06
4.95125286346e-07
-1.29852911655e-06
5.904187235e-07
-1.32886190356e-06
6.88606153811e-07
-1.34367060904e-06
7.91235889081e-07
-1.36536937345e-06
8.94575277069e-07
-1.3779302298e-06
9.97721539949e-07
-1.37991539092e-06
1.10617940956e-06
-1.3854729554e-06
1.21636657163e-06
-1.3799821221e-06
1.32731240883e-06
-1.36192162446e-06
1.43828075601e-06
-1.33298668235e-06
1.54835574361e-06
-1.29335658196e-06
1.65699645753e-06
-1.24300307933e-06
1.76230827573e-06
-1.18067453122e-06
1.86074693476e-06
-1.10573892327e-06
1.94757872365e-06
-1.01637373662e-06
2.02699191196e-06
-9.16120775158e-07
2.11184316543e-06
-8.03049828738e-07
2.20448011868e-06
-6.67151209942e-07
2.27602787371e-06
-4.81032845496e-07
2.275042418e-06
-2.04085299231e-07
1.99562074414e-06
3.34370520574e-07
2.36972628249e-06
-3.28088307099e-07
4.50595749296e-05
-4.27579397216e-05
8.13790689115e-05
-6.97469852183e-05
7.86949275763e-05
-4.93319617876e-05
8.16742417211e-05
-4.16402796121e-05
8.0376944096e-05
-3.99347117056e-05
8.19568192271e-05
-3.32473088402e-05
8.82460575077e-05
-3.12742772178e-05
9.64322521976e-05
-3.24435660148e-05
0.000106089380357
-3.4232950569e-05
0.000116906180277
-3.62005653944e-05
0.000128463709228
-3.78366475633e-05
0.000140250983828
-3.88324739744e-05
0.00015201822214
-3.8811683426e-05
0.000163499353789
-3.76765061477e-05
0.0001744748727
-3.5292048372e-05
0.000184721664819
-3.15844483376e-05
0.000194020988521
-2.64640958995e-05
0.000202144460713
-1.98470479483e-05
0.000208843310188
-1.16322705976e-05
0.000213841735678
-1.68728791732e-06
0.000216620301388
1.02979428346e-05
0.000216481669028
2.43684374349e-05
0.00021210362999
4.08200511127e-05
0.000202010457655
5.97061951273e-05
0.000183888216819
8.13442355673e-05
0.00015470888519
0.000104788546631
0.000112354357981
0.000125527320874
5.60895267555e-05
0.000137460505419
0.000144158858834
-2.47609840651e-08
-5.09001528155e-08
-4.9439209734e-08
-5.49664837553e-08
-6.70452330303e-08
-5.09456421741e-08
-8.83580179484e-08
-7.32898451837e-08
-1.09762326304e-07
-8.9909017123e-08
-1.29430813723e-07
-1.11016427894e-07
-1.47636275155e-07
-1.26962283889e-07
-1.65612241756e-07
-1.5798811997e-07
-1.77861990413e-07
-1.61995138803e-07
-1.89843893563e-07
-1.84721529051e-07
-2.00828634646e-07
-2.37305827846e-07
-2.10573011424e-07
-2.89648488819e-07
-2.18829851602e-07
-3.53807699307e-07
-2.27821986655e-07
-3.75456399065e-07
-2.35164780112e-07
-4.31742762346e-07
-2.39756001526e-07
-5.17216181217e-07
-2.4001948834e-07
-5.92765741486e-07
-2.37533415213e-07
-6.56769782334e-07
-2.30205643844e-07
-7.40216275912e-07
-2.17756069349e-07
-8.14912595728e-07
-1.94718393955e-07
-8.95903856294e-07
-1.51582838494e-07
-9.79576326701e-07
-9.90494254913e-08
-1.01457797643e-06
-3.43080440944e-08
-9.9208016058e-07
3.84254369944e-08
-9.91438532496e-07
1.01603073335e-07
-1.00415831715e-06
1.54929423157e-07
-1.09248912677e-06
2.26122349775e-07
-1.21232552133e-06
3.18984559864e-07
-1.329982076e-06
4.10267161613e-07
-1.38973082229e-06
5.04340125007e-07
-1.4228559962e-06
6.09862570875e-07
-1.44911521815e-06
7.17721118977e-07
-1.47315561168e-06
8.31026593482e-07
-1.49116864441e-06
9.44055471811e-07
-1.49288369942e-06
1.05852828387e-06
-1.49988948543e-06
1.17470169911e-06
-1.49610069183e-06
1.29251276382e-06
-1.47967498621e-06
1.41125899258e-06
-1.45166860845e-06
1.52940923927e-06
-1.41143382948e-06
1.64535722014e-06
-1.35886880573e-06
1.75587875535e-06
-1.29110729446e-06
1.85351184938e-06
-1.20328325757e-06
1.94627804536e-06
-1.10905535022e-06
2.05836060051e-06
-1.02815790442e-06
2.19415594658e-06
-9.3882880918e-07
2.33767966289e-06
-8.10618866859e-07
2.4493088039e-06
-5.92569448755e-07
2.48961530327e-06
-2.44212782195e-07
1.68801310844e-06
1.1362606014e-06
4.83766471271e-05
-4.70135595843e-05
8.87992263704e-05
-8.31782896206e-05
8.48349901102e-05
-6.57825524924e-05
8.37628169186e-05
-4.82598514858e-05
8.60904026098e-05
-4.39679443578e-05
8.80939239695e-05
-4.19383024407e-05
9.40203880199e-05
-3.91738152605e-05
0.000103202287675
-4.04561813777e-05
0.000114053043496
-4.32942961399e-05
0.000126228157042
-4.6408020971e-05
0.000139308151707
-4.92805089214e-05
0.000152942907148
-5.14713480597e-05
0.000166806777465
-5.26962883723e-05
0.00018070576333
-5.27106134107e-05
0.000194441401742
-5.14120900675e-05
0.000207834962102
-4.86855566419e-05
0.000220691259004
-4.44406981187e-05
0.000232795071326
-3.8567868544e-05
0.000243896434852
-3.09483814552e-05
0.000253712581449
-2.14483946642e-05
0.000261944729597
-9.91942574701e-06
0.000268359404857
3.883278964e-06
0.000272204799966
2.05230518809e-05
0.000272420211197
4.0604652028e-05
0.000267752983202
6.43734211473e-05
0.000256284929432
9.28122622709e-05
0.00023478461547
0.000126288767438
0.000195806782613
0.000164505054354
0.000124331992384
0.00020893507687
0.000268490794306
-2.76358514073e-08
-2.30378003129e-08
-5.53029136212e-08
-2.70958604882e-08
-7.68559844357e-08
-2.92279750878e-08
-1.02892318164e-07
-4.70583755785e-08
-1.27981236552e-07
-6.46320853713e-08
-1.51439165713e-07
-8.7371379791e-08
-1.71424827845e-07
-1.0679982184e-07
-1.93202042062e-07
-1.36046593977e-07
-2.05801826141e-07
-1.49251605432e-07
-2.20518284928e-07
-1.69873773117e-07
-2.35546878687e-07
-2.2213644924e-07
-2.49411440123e-07
-2.75644147308e-07
-2.62576597073e-07
-3.40496836466e-07
-2.72757463916e-07
-3.65144034583e-07
-2.82260669078e-07
-4.22111784906e-07
-2.929898346e-07
-5.06356608711e-07
-3.00262065603e-07
-5.85363607978e-07
-3.02148675487e-07
-6.54758923523e-07
-2.97817648107e-07
-7.44425905718e-07
-2.92139002984e-07
-8.2047479371e-07
-2.80759522788e-07
-9.07167945898e-07
-2.45101534126e-07
-1.01511813009e-06
-1.96014428127e-07
-1.06355691476e-06
-1.34816584451e-07
-1.05317809443e-06
-6.22634160335e-08
-1.0639035664e-06
1.0742607604e-08
-1.07708702658e-06
7.85541458211e-08
-1.1602249482e-06
1.53747608466e-07
-1.28744674794e-06
2.22315766065e-07
-1.39847518381e-06
3.14031252925e-07
-1.48137346016e-06
4.14823533569e-07
-1.52357355748e-06
5.29912914925e-07
-1.56413135937e-06
6.42398509214e-07
-1.58557119249e-06
7.62018305047e-07
-1.6107256927e-06
8.84192513477e-07
-1.61500233652e-06
1.00358535433e-06
-1.61923115848e-06
1.12710166146e-06
-1.61956608826e-06
1.25253396859e-06
-1.60505124821e-06
1.37844471081e-06
-1.57751495608e-06
1.50375972519e-06
-1.53667402361e-06
1.62595333324e-06
-1.4809812279e-06
1.73496207088e-06
-1.40002969802e-06
1.82943136616e-06
-1.29767333164e-06
1.93929761668e-06
-1.21888531585e-06
2.07956070054e-06
-1.1684183632e-06
2.23876508521e-06
-1.09797271487e-06
2.41220696649e-06
-9.84061518623e-07
2.67446205106e-06
-8.54782216714e-07
3.83854571977e-06
-1.40805687981e-06
1.32563403383e-05
-8.27970661993e-06
7.98807320421e-05
-0.00011363570719
9.05097331758e-05
-9.38071873736e-05
8.62855750268e-05
-6.15585840696e-05
8.85815416501e-05
-5.05559803016e-05
9.27640291258e-05
-4.81505318103e-05
9.86536909322e-05
-4.78280213831e-05
0.00010818459496
-4.87047456866e-05
0.000120103478441
-5.23750664875e-05
0.000133516792534
-5.67075928686e-05
0.000148071619857
-6.09628192166e-05
0.000163404960824
-6.46138144921e-05
0.000179247958257
-6.73143074349e-05
0.000195372673064
-6.88209643947e-05
0.000211612243373
-6.89501453967e-05
0.000227788046434
-6.75878561014e-05
0.000243718783065
-6.46162585299e-05
0.000259204610844
-5.9926495086e-05
0.000274032333544
-5.33955674641e-05
0.000287976782571
-4.4892815897e-05
0.000300810664942
-3.42822755043e-05
0.00031230863975
-2.14174045744e-05
0.000322262684293
-6.0707736282e-06
0.000330660517339
1.21252108357e-05
0.000337476312228
3.37888494841e-05
0.000342037212901
5.98125133905e-05
0.000344015176972
9.08342637059e-05
0.000342524277977
0.000127779553995
0.000334000153783
0.000173028975116
0.000308614959095
0.000234320122672
0.000321449112559
-2.98221415161e-08
6.93287045263e-09
-5.98007266703e-08
3.04448379087e-09
-8.55038765711e-08
-3.35132388069e-09
-1.14963192566e-07
-1.74122385138e-08
-1.4304286179e-07
-3.63651564701e-08
-1.70226496801e-07
-6.00003713358e-08
-1.9424296169e-07
-8.26070830663e-08
-2.19638124866e-07
-1.10485447702e-07
-2.35131121204e-07
-1.33618467804e-07
-2.52466887078e-07
-1.52401985397e-07
-2.71039275139e-07
-2.03425412473e-07
-2.88523747269e-07
-2.58012630964e-07
-3.05620443406e-07
-3.23259208228e-07
-3.18317686634e-07
-3.523166884e-07
-3.29766943709e-07
-4.10533769647e-07
-3.4500219902e-07
-4.90992662636e-07
-3.60930997039e-07
-5.69310582044e-07
-3.68713598593e-07
-6.4685604065e-07
-3.6754469088e-07
-7.45478481554e-07
-3.66763273302e-07
-8.21144043999e-07
-3.66310445498e-07
-9.07513251049e-07
-3.43029868134e-07
-1.0382947389e-06
-2.95616737326e-07
-1.11086871718e-06
-2.38781749505e-07
-1.10991918307e-06
-1.70452667503e-07
-1.13214530191e-06
-9.15009920869e-08
-1.15595723312e-06
-1.56761958407e-08
-1.23597811515e-06
6.90248736923e-08
-1.37207549772e-06
1.29768314906e-07
-1.45915206886e-06
2.08984036072e-07
-1.56052161421e-06
3.06525418245e-07
-1.62104904969e-06
4.2855158521e-07
-1.68609112641e-06
5.55652799736e-07
-1.71260923758e-06
6.82497258356e-07
-1.73751128721e-06
8.15665991904e-07
-1.7481184619e-06
9.43647688125e-07
-1.74716476224e-06
1.07318676162e-06
-1.74905588532e-06
1.20548364941e-06
-1.73729250746e-06
1.3391688219e-06
-1.7111338588e-06
1.47148512598e-06
-1.66891538218e-06
1.59196938505e-06
-1.60138339463e-06
1.68872807291e-06
-1.49670976557e-06
1.78929320002e-06
-1.39819145543e-06
1.91799102907e-06
-1.34757731714e-06
2.05182851855e-06
-1.30223990443e-06
2.13930577995e-06
-1.18550246286e-06
2.12455404311e-06
-9.69148355727e-07
1.9227611351e-06
-6.52895514376e-07
4.2519461972e-06
-3.7372325352e-06
6.37266463951e-05
-6.77537602213e-05
9.39600325211e-05
-0.000143869051512
8.931723643e-05
-8.91647321612e-05
8.97599692871e-05
-6.20016120302e-05
9.49426074699e-05
-5.57387988486e-05
0.000102030837456
-5.52388590551e-05
0.000111599156494
-5.73963910613e-05
0.000124124172605
-6.12297859584e-05
0.000138529633981
-6.67805336133e-05
0.000154248671131
-7.24266227961e-05
0.000170925502075
-7.76396345199e-05
0.000188249293962
-8.19375858323e-05
0.000205974085279
-8.50390757816e-05
0.000223879565805
-8.67264209263e-05
0.000241770444041
-8.6840999836e-05
0.00025944779117
-8.52651801061e-05
0.00027672554891
-8.18939948161e-05
0.000293439604743
-7.66405323051e-05
0.000309468074412
-6.94240236515e-05
0.00032474279125
-6.01675281844e-05
0.000339251565214
-4.87910548899e-05
0.00035303791533
-3.52037709431e-05
0.000366234081272
-1.92669617517e-05
0.000379067667996
-7.0839721753e-07
0.000391810040108
2.10464624772e-05
0.000404837091814
4.67854461251e-05
0.000418943093538
7.67282212871e-05
0.000435026653814
0.0001116958857
0.000453588412073
0.000154467036111
0.000477787809637
0.000210120582991
0.000277865388385
-3.13164938273e-08
3.84682901497e-08
-6.3184007805e-08
3.51082918033e-08
-9.21009773639e-08
2.57364655658e-08
-1.22958062844e-07
1.36275732964e-08
-1.53639933028e-07
-5.5033568862e-09
-1.84921381213e-07
-2.85389290826e-08
-2.13142450637e-07
-5.42066835827e-08
-2.41095030487e-07
-8.23794522124e-08
-2.62257323253e-07
-1.12302038278e-07
-2.84035884108e-07
-1.3048718511e-07
-3.06669001711e-07
-1.80649486874e-07
-3.27987842039e-07
-2.36552808497e-07
-3.49014725508e-07
-3.02087016299e-07
-3.64658713808e-07
-3.36540888763e-07
-3.77762500541e-07
-3.97303040704e-07
-3.93859653407e-07
-4.74769942871e-07
-4.18124204486e-07
-5.44926210788e-07
-4.32974333959e-07
-6.31892301989e-07
-4.37865365924e-07
-7.40475036649e-07
-4.42511685435e-07
-8.16395718073e-07
-4.47916225338e-07
-9.02013964098e-07
-4.43334161161e-07
-1.04278075805e-06
-4.0160251822e-07
-1.15250575573e-06
-3.45178221465e-07
-1.16625445771e-06
-2.83476520013e-07
-1.19376248419e-06
-2.05287766211e-07
-1.23407019693e-06
-1.2754852541e-07
-1.31364024421e-06
-3.72755218466e-08
-1.46227875359e-06
4.00901716695e-08
-1.53645400138e-06
1.10086137838e-07
-1.63045911534e-06
1.96067841801e-07
-1.70697216239e-06
3.18535794057e-07
-1.80849982075e-06
4.59063424897e-07
-1.85307931072e-06
5.95889708243e-07
-1.87428482687e-06
7.3576065907e-07
-1.88794076766e-06
8.77012955254e-07
-1.88837062962e-06
1.01435978602e-06
-1.88635367004e-06
1.15358836422e-06
-1.87646343762e-06
1.29366465053e-06
-1.85114266494e-06
1.42655069045e-06
-1.80172650597e-06
1.53225392647e-06
-1.70700862223e-06
1.62362782699e-06
-1.58801891359e-06
1.73834345313e-06
-1.51288505054e-06
1.86765670552e-06
-1.4769139355e-06
1.97390195448e-06
-1.40856535359e-06
2.02124205321e-06
-1.2325118791e-06
2.10248470952e-06
-1.05026222652e-06
1.45860539095e-06
-8.80123257726e-09
5.89917399416e-05
-6.12694744943e-05
0.000116403554407
-0.000125165183799
9.97829423776e-05
-0.000127248896676
9.21994285761e-05
-8.15816947818e-05
9.59647107447e-05
-6.57672178251e-05
0.000103472710952
-6.3246986588e-05
0.000113558876694
-6.5325126267e-05
0.000126226125564
-7.00636945894e-05
0.000141250856086
-7.62545458577e-05
0.000157797173399
-8.33268653002e-05
0.00017542636414
-9.00558180445e-05
0.00019378376526
-9.59970332924e-05
0.000212573734366
-0.000100727548222
0.000231541897232
-0.000104007228896
0.000250460443229
-0.000105644955689
0.000269132744796
-0.000105513289124
0.00028739444533
-0.000103526868441
0.000305134010807
-9.96335483559e-05
0.00032230488901
-9.38114003317e-05
0.000338935424001
-8.60545517607e-05
0.000355126917792
-7.63590216985e-05
0.000371041863428
-6.47060094792e-05
0.000386884496415
-5.10464216024e-05
0.000402886926691
-3.52694147529e-05
0.000419326065302
-1.71475583142e-05
0.000436797734435
3.57477470875e-06
0.000456213225631
2.73699386529e-05
0.000478458978941
5.44824295169e-05
0.00050473988731
8.54148789606e-05
0.000536915068115
0.000122291720828
0.000580735347001
0.00016630019911
0.000210852757312
-3.30840676507e-08
7.16925934795e-08
-6.68132639628e-08
6.9003232827e-08
-9.78968322978e-08
5.6991061188e-08
-1.30131373e-07
4.60329714017e-08
-1.64379573168e-07
2.89196576184e-08
-1.99923453206e-07
7.18873807482e-09
-2.34710545687e-07
-1.92506854354e-08
-2.68777851129e-07
-4.814493279e-08
-2.96426468783e-07
-8.44998873355e-08
-3.1786235844e-07
-1.08909542922e-07
-3.42827641659e-07
-1.5554218878e-07
-3.67851734547e-07
-2.11380475308e-07
-3.93185740389e-07
-2.76611381296e-07
-4.12861628739e-07
-3.16732919651e-07
-4.29450009081e-07
-3.80585291757e-07
-4.44800903071e-07
-4.59295533901e-07
-4.68831710145e-07
-5.20782438494e-07
-4.91736833814e-07
-6.08877261013e-07
-5.07605860123e-07
-7.24502218964e-07
-5.21186259202e-07
-8.02720306087e-07
-5.26797083072e-07
-8.96314903247e-07
-5.38924676906e-07
-1.03056712483e-06
-5.25501619034e-07
-1.16584348928e-06
-4.63103334881e-07
-1.22856925551e-06
-4.04635597126e-07
-1.25215142492e-06
-3.29399536602e-07
-1.30922726286e-06
-2.51946908104e-07
-1.39102157551e-06
-1.62438865187e-07
-1.55171497559e-06
-6.96473158492e-08
-1.62918192628e-06
1.13741731389e-08
-1.71142490057e-06
9.66123260094e-08
-1.79216036213e-06
1.94411510362e-07
-1.90625181475e-06
3.36468662388e-07
-1.99509073913e-06
4.94754551526e-07
-2.03252458581e-06
6.47086479585e-07
-2.04022814388e-06
7.99216409373e-07
-2.04045409048e-06
9.48755623042e-07
-2.03583966686e-06
1.09581652699e-06
-2.02346305159e-06
1.24141603329e-06
-1.99667327538e-06
1.3603928232e-06
-1.92062935597e-06
1.44889820587e-06
-1.79544195192e-06
1.54413939128e-06
-1.68321288781e-06
1.65850031579e-06
-1.6272518935e-06
1.77038991086e-06
-1.58886726017e-06
1.89048734941e-06
-1.52847358482e-06
2.31742926845e-06
-1.65910975637e-06
4.62695900278e-06
-3.35931417078e-06
2.16119395075e-05
-1.69931549419e-05
9.53139315326e-05
-0.000134970245035
0.000114050944915
-0.000143902727324
9.98779720841e-05
-0.000113076573353
9.77815330022e-05
-7.94857426787e-05
0.000104109805817
-7.20957994504e-05
0.000113929935425
-7.30672968865e-05
0.000126688337348
-7.80836321083e-05
0.000141828930464
-8.52043498076e-05
0.00015885844066
-9.32840955752e-05
0.000177083336765
-0.000101551787722
0.000196101251361
-0.000109073749958
0.000215557677173
-0.000115453470199
0.00023516334952
-0.000120333226692
0.000254672701912
-0.000123516584114
0.00027388945507
-0.000124861708841
0.000292676366
-0.000124300198568
0.000310963956494
-0.000121814456029
0.000328760062521
-0.000117429651311
0.000346147825552
-0.000111199160314
0.000363277595982
-0.000103184321209
0.000380353098326
-9.34345268681e-05
0.000397617071587
-8.19699924817e-05
0.000415339604725
-6.87689719963e-05
0.000433824810549
-5.37546439454e-05
0.000453467564347
-3.67903375543e-05
0.000474768102956
-1.77257848229e-05
0.000498735782926
3.4022407606e-06
0.000526484137232
2.67340473505e-05
0.000559192854412
5.27060995856e-05
0.000599248845692
8.22356267992e-05
0.000651346647176
0.000114202341337
0.000142310051035
-3.61170477905e-08
1.0802998906e-07
-7.20536684318e-08
1.05137686065e-07
-1.06078895372e-07
9.11910237597e-08
-1.41505498052e-07
8.16376030005e-08
-1.77750121787e-07
6.53424969792e-08
-2.1487611231e-07
4.44904897201e-08
-2.52515578634e-07
1.85691195407e-08
-2.88325421774e-07
-1.21787567487e-08
-3.22936488083e-07
-4.97268139233e-08
-3.49867647594e-07
-8.18345805404e-08
-3.78590888428e-07
-1.26673935468e-07
-4.0771359136e-07
-1.82114458671e-07
-4.37695369229e-07
-2.46483661213e-07
-4.62357761291e-07
-2.91937258745e-07
-4.85199281843e-07
-3.57615657054e-07
-5.07637634602e-07
-4.36734722691e-07
-5.30155049207e-07
-4.98153823676e-07
-5.5582390878e-07
-5.83104945301e-07
-5.81423790779e-07
-6.98802315039e-07
-6.04759757993e-07
-7.79295938431e-07
-6.1081450373e-07
-8.90179426358e-07
-6.30412600048e-07
-1.0108901836e-06
-6.49185519233e-07
-1.14699042521e-06
-6.17300942978e-07
-1.26037718266e-06
-5.5392880466e-07
-1.31545030321e-06
-4.73887526108e-07
-1.38919877889e-06
-3.93882165724e-07
-1.47094970859e-06
-3.06647142529e-07
-1.63887626427e-06
-2.03463835244e-07
-1.73230184236e-06
-1.07456231897e-07
-1.80738037099e-06
-1.08983711916e-08
-1.88867660815e-06
7.79727566348e-08
-1.99508629416e-06
2.07005004449e-07
-2.12408484001e-06
3.67232879093e-07
-2.19271506605e-06
5.38557031691e-07
-2.21150929007e-06
7.11252634622e-07
-2.21309921628e-06
8.76363877653e-07
-2.20089406285e-06
1.0311822834e-06
-2.17821796827e-06
1.17127061424e-06
-2.13669438982e-06
1.27191632446e-06
-2.02120717132e-06
1.35791878191e-06
-1.88138261267e-06
1.45405882331e-06
-1.77933936431e-06
1.5443190833e-06
-1.71753698644e-06
1.58816843557e-06
-1.63272842174e-06
1.67158839314e-06
-1.61157806249e-06
2.26093705482e-06
-2.24787381014e-06
5.10136916384e-06
-6.1994631119e-06
7.15347684128e-05
-8.34254440357e-05
0.000113601346924
-0.000177037408013
0.000109424622168
-0.000139726833448
0.000100853683443
-0.000104506293707
0.000104248426427
-8.28809336687e-05
0.000113276589516
-8.11242453315e-05
0.000125593418945
-8.53843003302e-05
0.00014063712173
-9.31274442716e-05
0.000157701622869
-0.000102268923794
0.000176226226047
-0.00011180875102
0.000195605615995
-0.000120931217092
0.000215451990832
-0.000128920155656
0.00023542620163
-0.000135427705
0.00025526749064
-0.000140174534668
0.000274777516195
-0.00014302662409
0.000293832042636
-0.000143916246603
0.000312384876883
-0.00014285304116
0.000330467573747
-0.000139897159578
0.000348182611464
-0.000135144693972
0.00036568926535
-0.000128705818838
0.000383189515843
-0.000120684576343
0.000400918176902
-0.000111163195157
0.000419140954537
-0.000100192781265
0.000438161911727
-8.77899463321e-05
0.000458346716687
-7.39394702981e-05
0.00048016724775
-5.86108914205e-05
0.000504235818547
-4.17943749162e-05
0.000531216067176
-2.35780228421e-05
0.000562109711104
-4.15962065273e-06
0.000598273294194
1.65424716773e-05
0.000641930314268
3.85785565339e-05
0.000696140175474
5.999243645e-05
7.64859216345e-05
-3.98130232218e-08
1.4799778854e-07
-7.83924055685e-08
1.43896888994e-07
-1.15189869597e-07
1.28172594482e-07
-1.55244185833e-07
1.21874913647e-07
-1.93350214146e-07
1.03629440561e-07
-2.31744910636e-07
8.30713677552e-08
-2.70564774382e-07
5.75604566701e-08
-3.067155301e-07
2.41384498756e-08
-3.4558591192e-07
-1.06998029412e-08
-3.80048526487e-07
-4.72260754471e-08
-4.13739245378e-07
-9.28375499631e-08
-4.47320105434e-07
-1.48383729641e-07
-4.81836133276e-07
-2.11824663562e-07
-5.11128014884e-07
-2.625116398e-07
-5.39248523628e-07
-3.29366244703e-07
-5.68172508895e-07
-4.0768965226e-07
-5.93800208011e-07
-4.72416886923e-07
-6.22769912964e-07
-5.54032831223e-07
-6.55979868234e-07
-6.65498169745e-07
-6.90579764587e-07
-7.44610974037e-07
-7.07201384438e-07
-8.73477314316e-07
-7.29721873946e-07
-9.88295283527e-07
-7.46662401324e-07
-1.12998365408e-06
-7.52572362079e-07
-1.25440377854e-06
-7.2535785471e-07
-1.34260139051e-06
-6.63734825314e-07
-1.45075159291e-06
-5.7196270224e-07
-1.56265658364e-06
-4.77098714479e-07
-1.73367388898e-06
-3.63645427872e-07
-1.84569085186e-06
-2.58910084651e-07
-1.91206425526e-06
-1.4905555399e-07
-1.99849387777e-06
-4.0550326915e-08
-2.10356297682e-06
7.34671883416e-08
-2.23808062388e-06
2.30928649105e-07
-2.35014752129e-06
4.08709838111e-07
-2.38925060348e-06
6.03701579361e-07
-2.40803982456e-06
7.92478000582e-07
-2.38960645555e-06
9.58741151391e-07
-2.34441308753e-06
1.08742654198e-06
-2.26531524078e-06
1.18376114859e-06
-2.11747773003e-06
1.28257337341e-06
-1.98017298811e-06
1.39053084565e-06
-1.88729254495e-06
1.49456647319e-06
-1.8216178217e-06
1.62638437498e-06
-1.76449489504e-06
1.71476823043e-06
-1.69950706816e-06
5.38020121627e-07
-1.07057909167e-06
7.02941965292e-05
-7.59528878302e-05
0.00012813467168
-0.000141265956876
0.000119272842776
-0.000168176493644
0.000107655021163
-0.000128109837926
0.000104713618565
-0.00010156548377
0.000111716108002
-8.98838161905e-05
0.000123232581504
-9.26409731144e-05
0.000137823167076
-9.99750526219e-05
0.00015470720577
-0.0001100115972
0.000173189337707
-0.000120751139368
0.000192704035744
-0.00013132351396
0.000212719149952
-0.000140946384193
0.000232872401013
-0.000149073450451
0.000252864808338
-0.000155420149207
0.000272489823086
-0.000159799580093
0.000291619864739
-0.000162156691738
0.000310212312487
-0.000162508715853
0.000328302462791
-0.000160943209882
0.00034599279367
-0.000157587505754
0.000363438024737
-0.000152589938568
0.000380830692506
-0.000146098498206
0.00039839273366
-0.000138246628766
0.000416374802466
-0.000129145275105
0.000435062477214
-0.000118880469573
0.00045478859062
-0.000107516075725
0.000475955351484
-9.51062505204e-05
0.000499067676126
-8.17232353596e-05
0.000524753137254
-6.74798518924e-05
0.000553675179976
-5.25000778996e-05
0.000586392599522
-3.6877053304e-05
0.000623853324281
-2.09182774769e-05
0.000668021348529
-5.58950659181e-06
0.000721006569273
7.00720306356e-06
1.41926248146e-05
-4.34317613099e-08
1.91664360959e-07
-8.53231799379e-08
1.85997772614e-07
-1.27351231858e-07
1.70392384789e-07
-1.71823690511e-07
1.66546656155e-07
-2.11547272518e-07
1.43542578509e-07
-2.52284260292e-07
1.23992287856e-07
-2.93572911481e-07
9.90344944077e-08
-3.32845739281e-07
6.35755280258e-08
-3.73696433576e-07
3.03148222906e-08
-4.11696600204e-07
-9.07446674989e-09
-4.49526990769e-07
-5.48581219686e-08
-4.87129048776e-07
-1.10633733933e-07
-5.25693943614e-07
-1.73113406567e-07
-5.59327445566e-07
-2.28743434003e-07
-5.91679038626e-07
-2.9688578101e-07
-6.24573024116e-07
-3.74675162377e-07
-6.53540567449e-07
-4.43340233705e-07
-6.85769506702e-07
-5.21704358163e-07
-7.19902764282e-07
-6.31271487544e-07
-7.53177630521e-07
-7.11254005455e-07
-7.84383224777e-07
-8.42195978668e-07
-8.17083414322e-07
-9.55531890412e-07
-8.44911331287e-07
-1.10209985603e-06
-8.45107958737e-07
-1.25415732301e-06
-8.36412139605e-07
-1.35124943284e-06
-8.22820415296e-07
-1.46429942101e-06
-7.6874447396e-07
-1.61667721261e-06
-6.68892008413e-07
-1.83346272398e-06
-5.48093403879e-07
-1.96643285029e-06
-4.37860182334e-07
-2.02225154795e-06
-3.26308998591e-07
-2.11001293812e-06
-1.99104241626e-07
-2.23075148333e-06
-7.38449098685e-08
-2.36332446939e-06
8.23517849233e-08
-2.50632136535e-06
2.64719719339e-07
-2.57158087984e-06
4.73814764077e-07
-2.61707068058e-06
6.88683063045e-07
-2.60440278595e-06
8.73986814561e-07
-2.5296510852e-06
1.00261325683e-06
-2.39387317455e-06
1.11067612897e-06
-2.22550805959e-06
1.23591386256e-06
-2.10539170075e-06
1.39735321066e-06
-2.04875744263e-06
1.62446293089e-06
-2.04881814314e-06
2.02885533171e-06
-2.16868638843e-06
3.32738504597e-06
-2.99743698079e-06
1.14783358878e-05
-9.21932145868e-06
9.45855793865e-05
-0.000159058179715
0.0001276730556
-0.000174354019257
0.000116184173247
-0.000156688473993
0.000108551771576
-0.000120478133849
0.000110423830625
-0.000103438034618
0.000120085712013
-9.95460312088e-05
0.000133728581896
-0.000106284071011
0.000150116486445
-0.000116363118504
0.000168348070528
-0.000128243301716
0.000187754186701
-0.000140157350193
0.000207782615692
-0.000151352021007
0.00022797030072
-0.000161134135104
0.000247998821887
-0.000169102028506
0.000267631000127
-0.000175052376421
0.000286730319605
-0.000178898942325
0.000305245522834
-0.000180671931804
0.000323206937038
-0.000180470162431
0.00034071093299
-0.000178447233816
0.000357904261006
-0.000174780858725
0.00037496879475
-0.000169654494086
0.000392111354863
-0.0001632410782
0.000409560387194
-0.000155695678764
0.00042756855359
-0.000147153458508
0.000446418953382
-0.000137730885537
0.000466434649526
-0.000127531789096
0.000487994285954
-0.00011666590375
0.000511551959375
-0.000105280924547
0.000537644114511
-9.35720186681e-05
0.000566864687844
-8.17206584407e-05
0.000599851232723
-6.9863607385e-05
0.000637280634125
-5.83476911089e-05
0.000680152853056
-4.84617328114e-05
0.0007297769231
-4.26168810628e-05
-4.25202306443e-05
-4.756676576e-08
2.39399801552e-07
-9.10935771658e-08
2.29717309903e-07
-1.38277233092e-07
2.17777378303e-07
-1.84902389105e-07
2.1337372644e-07
-2.29406693908e-07
1.88242232316e-07
-2.74180134694e-07
1.68963303329e-07
-3.18969602007e-07
1.44009199916e-07
-3.62028707526e-07
1.06811708161e-07
-4.0465778035e-07
7.31131501206e-08
-4.45744649983e-07
3.21667491419e-08
-4.87060519247e-07
-1.33903549642e-08
-5.27982263842e-07
-6.95586143229e-08
-5.69868560392e-07
-1.31081150735e-07
-6.08591953595e-07
-1.89883596666e-07
-6.45907846352e-07
-2.59440877785e-07
-6.81385548994e-07
-3.39076821599e-07
-7.12302165666e-07
-4.12314033818e-07
-7.48572325709e-07
-4.85333315986e-07
-7.85154670856e-07
-5.94598030794e-07
-8.16452634054e-07
-6.79874442768e-07
-8.53947495009e-07
-8.04631348638e-07
-8.8605508853e-07
-9.23366737391e-07
-9.31108821147e-07
-1.05700178102e-06
-9.65410583376e-07
-1.21981886801e-06
-9.59620631903e-07
-1.35700883474e-06
-9.54986629484e-07
-1.4688946648e-06
-9.52356080783e-07
-1.61927208887e-06
-8.74865050968e-07
-1.91091909103e-06
-7.56946885642e-07
-2.08430615679e-06
-6.32979310276e-07
-2.14617862128e-06
-5.22196947887e-07
-2.22076886673e-06
-4.00119464267e-07
-2.3528144836e-06
-2.67548391829e-07
-2.49588707131e-06
-1.02929316828e-07
-2.67092841992e-06
9.9827819133e-08
-2.77429613099e-06
3.24401378996e-07
-2.84158922181e-06
5.65251514234e-07
-2.84518297575e-06
7.76048957161e-07
-2.74035656443e-06
9.19801815246e-07
-2.53756921686e-06
1.04836545947e-06
-2.35403510391e-06
1.20060755019e-06
-2.25764794096e-06
1.41587831535e-06
-2.26408218888e-06
1.6611255751e-06
-2.29399246566e-06
1.84320524368e-06
-2.35039404245e-06
4.17712250082e-07
-1.57155510591e-06
8.31045121186e-05
-9.19039407617e-05
0.000123085287387
-0.000199038749529
0.000123615633996
-0.000174885092026
0.000112599720592
-0.000145673290202
0.000110709100896
-0.000118588075931
0.000116742793811
-0.000109472129716
0.000128843969328
-0.000111647492679
0.000144292063874
-0.000121732374414
0.000162009182097
-0.000134080396184
0.000181119010335
-0.000147353257223
0.000200993319762
-0.00016003176561
0.000221117093815
-0.000171475885536
0.000241098676812
-0.000181115797143
0.000260679075858
-0.000188682496801
0.000279693977611
-0.000194067339607
0.000298079425436
-0.000197284444229
0.000315852573213
-0.000198445127825
0.000333099761664
-0.000197717393452
0.000349957253449
-0.00019530476391
0.000366595480996
-0.000191419120252
0.000383206795084
-0.000186265839095
0.00039999937547
-0.000180033686019
0.000417196520181
-0.000172892848535
0.000435039680441
-0.000164996640648
0.000453793580777
-0.000156484805918
0.000473753353279
-0.000147491578699
0.000495253879674
-0.000138166445194
0.000518677086842
-0.000128704142373
0.000544449775063
-0.000119344712301
0.00057303729478
-0.000110308179386
0.000604957605042
-0.000101783915168
0.000640846418456
-9.42365022221e-05
0.000681383591807
-8.89989085742e-05
0.000726931128628
-8.816440645e-05
-9.25880603532e-05
-5.03006700402e-08
2.89936079538e-07
-9.64066682359e-08
2.76034640931e-07
-1.47567750883e-07
2.69144536483e-07
-1.96972752496e-07
2.62988846003e-07
-2.46146098308e-07
2.37619113307e-07
-2.95403139856e-07
2.18419504792e-07
-3.44285194151e-07
1.93088472195e-07
-3.91605003436e-07
1.54314187244e-07
-4.37012348579e-07
1.18694783143e-07
-4.82307483834e-07
7.76258426904e-08
-5.27049551264e-07
3.15069604812e-08
-5.71631711547e-07
-2.48213140039e-08
-6.16663891907e-07
-8.58999878739e-08
-6.61376399031e-07
-1.45032752252e-07
-7.05743667272e-07
-2.1494270378e-07
-7.46778948161e-07
-2.97919636225e-07
-7.79930638883e-07
-3.7904865251e-07
-8.15969807327e-07
-4.49193014132e-07
-8.55758473311e-07
-5.54716925219e-07
-8.87616434665e-07
-6.47937518459e-07
-9.31226665445e-07
-7.60954254634e-07
-9.73385800036e-07
-8.81157795957e-07
-1.01054132269e-06
-1.01980807741e-06
-1.06890319338e-06
-1.16142983011e-06
-1.10057591835e-06
-1.3253098109e-06
-1.11549722454e-06
-1.45396586659e-06
-1.13781458497e-06
-1.59695130316e-06
-1.11881019848e-06
-1.92990350262e-06
-1.00583780819e-06
-2.19725417056e-06
-8.6282207315e-07
-2.28916843372e-06
-7.31306043762e-07
-2.35226554793e-06
-6.14886969268e-07
-2.46922405869e-06
-4.90279264647e-07
-2.62049649864e-06
-3.3620404854e-07
-2.82498760423e-06
-1.18618884079e-07
-2.991853421e-06
1.32932426606e-07
-3.09306799648e-06
4.14536604784e-07
-3.12667015004e-06
6.65559286076e-07
-2.99127678793e-06
8.40889530458e-07
-2.7128072355e-06
1.00728640505e-06
-2.52038971576e-06
1.23314288456e-06
-2.4834885448e-06
1.49287868732e-06
-2.52373558683e-06
1.81546789011e-06
-2.61668090992e-06
3.32677145123e-06
-3.861177443e-06
1.16526153158e-05
-9.89590040068e-06
0.000110560353592
-0.000190811062726
0.000126151676015
-0.000214630756083
0.0001178638626
-0.000166598022379
0.000111502590502
-0.000139312619678
0.000114093042205
-0.000121178976637
0.000123396729397
-0.000118776147492
0.000137587026044
-0.000125838038803
0.000154470040348
-0.00013861558455
0.000173100859755
-0.000152711375541
0.00019267776303
-0.000166930295903
0.000212633012367
-0.00017998713209
0.000232513822136
-0.000191356798705
0.000252005500262
-0.000200607566965
0.000270917992856
-0.000207595071631
0.000289160436267
-0.000212309856452
0.000306734153177
-0.000214858227371
0.00032371038609
-0.00021542142002
0.000340213660274
-0.000214220721418
0.000356402766585
-0.000211493918537
0.000372457449869
-0.000207473847696
0.000388569807532
-0.000202378236394
0.000404941220267
-0.000196405134904
0.000421783116444
-0.000189734776333
0.000439320209437
-0.000182533761552
0.00045779531279
-0.000174959931832
0.00047747515405
-0.000167171437907
0.000498655284421
-0.000159346586717
0.00052165956257
-0.000151708424576
0.000546833440129
-0.000144518585839
0.000574543079508
-0.000138017808391
0.000605189293294
-0.000132430117241
0.000639202022604
-0.000128249216527
0.0006768937823
-0.000126690646969
0.000718172473983
-0.000129443094618
-0.000136870573162
-5.28733646846e-08
3.42994336913e-07
-1.04529153225e-07
3.27893834259e-07
-1.57059146615e-07
3.21887571924e-07
-2.10158421684e-07
3.16300571779e-07
-2.62813197416e-07
2.90481586208e-07
-3.15694801906e-07
2.71510544986e-07
-3.68940841431e-07
2.46536145637e-07
-4.211052965e-07
2.06668566448e-07
-4.70022477511e-07
1.67796087681e-07
-5.20843807635e-07
1.28615874593e-07
-5.69765467078e-07
8.0588598052e-08
-6.19510464631e-07
2.508279543e-08
-6.67517389295e-07
-3.77402444529e-08
-7.16350716934e-07
-9.60575978387e-08
-7.68200538423e-07
-1.62960726632e-07
-8.16553260982e-07
-2.49441026329e-07
-8.56147909566e-07
-3.39338576478e-07
-8.90874816916e-07
-4.14363167593e-07
-9.30300065082e-07
-5.15200519053e-07
-9.67288860371e-07
-6.10870726318e-07
-1.0086082245e-06
-7.19572754232e-07
-1.0597908127e-06
-8.2992604309e-07
-1.11512070242e-06
-9.6444443167e-07
-1.16817467074e-06
-1.10835114704e-06
-1.21578582045e-06
-1.27769294117e-06
-1.24475514911e-06
-1.4249984008e-06
-1.28441581853e-06
-1.55729752618e-06
-1.34534406114e-06
-1.86899369661e-06
-1.28840170752e-06
-2.2542130853e-06
-1.15454144172e-06
-2.42302668126e-06
-9.93843795214e-07
-2.51295356228e-06
-8.57042761435e-07
-2.60602010436e-06
-7.27436527287e-07
-2.75009422284e-06
-6.0375649917e-07
-2.94866134343e-06
-4.06900100606e-07
-3.18865800734e-06
-1.29022613151e-07
-3.37087320367e-06
2.09016493948e-07
-3.46457740159e-06
5.3235500732e-07
-3.31443854285e-06
7.54169990306e-07
-2.93448207238e-06
9.87722416524e-07
-2.75382380018e-06
1.33248465658e-06
-2.82811814854e-06
1.572280141e-06
-2.76372506766e-06
1.4939495752e-06
-2.53771029783e-06
-7.0398588139e-07
-1.66379203638e-06
9.33942632708e-05
-0.000103993973539
0.000129368892263
-0.000226786677976
0.000122825023945
-0.000208087781025
0.000113784210151
-0.000157557897103
0.000112290486764
-0.000137819400881
0.000118359093644
-0.000127247955943
0.000130244291433
-0.000130661630938
0.000146042555697
-0.0001416365322
0.000163944754676
-0.000156517974966
0.000183103313415
-0.000171870099449
0.000202794134798
-0.000186621262482
0.000222520373201
-0.000199713500184
0.00024190547941
-0.000210742021241
0.00026071428694
-0.000219416479794
0.000278827682704
-0.000225708562464
0.000296221500986
-0.000229703761245
0.000312950370556
-0.000231587175222
0.000329124443252
-0.000231595564247
0.000344891485091
-0.000229987828151
0.000360420364106
-0.000227022857164
0.000375890901175
-0.000222944438848
0.000391488344529
-0.000217975729366
0.000407402172816
-0.000212319007367
0.000423827435784
-0.000206160078614
0.000440967660959
-0.00019967401923
0.000459038775833
-0.000193031072572
0.000478273080002
-0.00018640575873
0.000498920809892
-0.000179994323752
0.000521246558411
-0.000174034168605
0.000545524089011
-0.000168796101419
0.000572039669568
-0.000164533367092
0.000601094037168
-0.000161484457877
0.000632949901422
-0.000160105052084
0.000667681225022
-0.000161421947219
0.000705022392966
-0.000166784233191
-0.000176322150772
-5.59415321932e-08
3.99174322339e-07
-1.11825102815e-07
3.83999680933e-07
-1.67231900813e-07
3.77513083995e-07
-2.24285485824e-07
3.73575824781e-07
-2.7977226802e-07
3.46184015452e-07
-3.35153378077e-07
3.27104331334e-07
-3.92530539033e-07
3.04121964192e-07
-4.50526391233e-07
2.6486283537e-07
-5.0501449921e-07
2.2247091922e-07
-5.62612790682e-07
1.86395708407e-07
-6.15340178841e-07
1.33479256608e-07
-6.70653071014e-07
8.05578852953e-08
-7.24831797435e-07
1.65951317753e-08
-7.77442421678e-07
-4.32981567807e-08
-8.31960629076e-07
-1.08307605403e-07
-8.86112098717e-07
-1.95163493167e-07
-9.35174778468e-07
-2.90157402986e-07
-9.76102529186e-07
-3.73332794825e-07
-1.01490182756e-06
-4.7631023576e-07
-1.05250003419e-06
-5.73195645647e-07
-1.09187208703e-06
-6.80136347464e-07
-1.12040258811e-06
-8.01346622109e-07
-1.17154908392e-06
-9.13262547967e-07
-1.22800130476e-06
-1.0518794651e-06
-1.30037607456e-06
-1.20530920094e-06
-1.35936420594e-06
-1.36602376708e-06
-1.41637120517e-06
-1.50033019961e-06
-1.53543751838e-06
-1.74999034936e-06
-1.59016485597e-06
-2.19953775439e-06
-1.50472452494e-06
-2.50850940891e-06
-1.35372994347e-06
-2.66397079599e-06
-1.17949498952e-06
-2.78026320522e-06
-1.02450309711e-06
-2.90509637063e-06
-8.85185552724e-07
-3.0879581009e-06
-7.45878525991e-07
-3.3279627584e-06
-4.92382511561e-07
-3.62425108207e-06
-1.08639498609e-07
-3.84809775094e-06
3.55663307398e-07
-3.77847310391e-06
6.4741263692e-07
-3.22593974752e-06
9.77275189799e-07
-3.08346206276e-06
1.44553188726e-06
-3.29633529497e-06
1.87631446593e-06
-3.19407281763e-06
2.51778137501e-06
-3.17944821054e-06
-7.50355865336e-07
1.60473343721e-06
0.000104111711932
-0.000208859364294
0.000127132659238
-0.000249808528031
0.000116331947199
-0.000197287775183
0.000111621954342
-0.00015284844417
0.000114152404515
-0.000140350255481
0.000123092331231
-0.00013618819645
0.000137006247731
-0.000144575803304
0.000153957934615
-0.000158588437558
0.000172490191099
-0.00017505042407
0.000191832332621
-0.000191212413728
0.000211344757374
-0.000206133844014
0.000230606729873
-0.000218975615247
0.000249322097202
-0.000229457518985
0.000267332395405
-0.000237426896977
0.000284584607331
-0.000242960883566
0.000301110313962
-0.000246229567602
0.000317004205243
-0.000247481158252
0.000332401689473
-0.00024699313241
0.000347462013299
-0.000245048229469
0.000362355009709
-0.000241915924506
0.000377253795163
-0.000237843289789
0.000392331410883
-0.000233053404327
0.000407760601719
-0.000227748251737
0.000423715252579
-0.000222114775328
0.000440372848737
-0.000216331653345
0.000457917630645
-0.000210575881421
0.000476543382754
-0.000205031525993
0.000496453627813
-0.000199904568857
0.000517858021559
-0.000195438547118
0.000540969759055
-0.000191907808614
0.000566010007213
-0.000189573575839
0.000593200940822
-0.000188675351133
0.000622700187938
-0.000189604255596
0.000654473550357
-0.000193195261969
0.000688225038766
-0.000200535705665
-0.000211644426066
-5.89376986813e-08
4.58323705679e-07
-1.18045129989e-07
4.43329654038e-07
-1.78334340165e-07
4.38030785722e-07
-2.38508162825e-07
4.339784648e-07
-2.96222727686e-07
4.04119577675e-07
-3.53565704536e-07
3.84666876193e-07
-4.14236574644e-07
3.65008334059e-07
-4.79291062427e-07
3.30119707994e-07
-5.42141914715e-07
2.85518513819e-07
-6.04608616099e-07
2.49049330407e-07
-6.60477575088e-07
1.89516783688e-07
-7.20980729959e-07
1.41226204926e-07
-7.85026230932e-07
8.08044096746e-08
-8.43967044786e-07
1.57961734493e-08
-8.97008455702e-07
-5.51286929984e-08
-9.54668900331e-07
-1.37374023224e-07
-1.0118276301e-06
-2.32881758173e-07
-1.06263462747e-06
-3.22422413263e-07
-1.10926051213e-06
-4.29593938318e-07
-1.14813189784e-06
-5.34245358001e-07
-1.19796996789e-06
-6.30233919203e-07
-1.22986640745e-06
-7.69399194808e-07
-1.26004174519e-06
-8.83051898034e-07
-1.29895498906e-06
-1.01294527853e-06
-1.35178888785e-06
-1.15247553182e-06
-1.41860094403e-06
-1.29923349626e-06
-1.48389168969e-06
-1.43509057814e-06
-1.62022743008e-06
-1.61372236231e-06
-1.82001159044e-06
-1.99985346229e-06
-1.84871400809e-06
-2.47990385319e-06
-1.76551161364e-06
-2.74725077597e-06
-1.61535765096e-06
-2.93046703308e-06
-1.45348359344e-06
-3.06699098211e-06
-1.27458967192e-06
-3.2668669591e-06
-1.12694586561e-06
-3.47555828242e-06
-9.53119422169e-07
-3.79790287266e-06
-6.2016519921e-07
-4.18074838655e-06
2.16288606392e-08
-4.41982181204e-06
5.25586228063e-07
-3.72958397957e-06
1.07960153506e-06
-3.63712596681e-06
1.74804918509e-06
-3.96447275863e-06
2.58190547456e-06
-4.02768752751e-06
7.22080457025e-06
-7.81793388468e-06
2.8357969276e-05
-1.95332783685e-05
0.000109311518616
-0.000289812686
0.000121893766222
-0.000262391331821
0.000110604975511
-0.000185999531844
0.000110823101412
-0.000153067006237
0.000116554535935
-0.000146082033279
0.00012794638005
-0.000147580322987
0.000143390517095
-0.000160020184831
0.000161111335989
-0.000176309475858
0.000179941587514
-0.000193880876064
0.000199183354632
-0.000210454365743
0.000218291299813
-0.000225241959724
0.000236923225633
-0.000237607698791
0.000254862065223
-0.000247396503935
0.000272019071923
-0.00025458403813
0.000288398116556
-0.000259340052057
0.000304073961935
-0.000261905527677
0.000319168663876
-0.000262575965914
0.000333831279985
-0.000261655846638
0.000348223147904
-0.000259440187877
0.00036250773808
-0.00025620059871
0.000376845583125
-0.000252181211806
0.000391392371329
-0.00024760026304
0.000406299325599
-0.000242655268305
0.000421714777911
-0.00023753028137
0.000437786587875
-0.000232403505223
0.000454665147791
-0.000227454470242
0.000472505994719
-0.000222872384633
0.000491470171745
-0.000218868739618
0.000511721909314
-0.000215690257634
0.000533427726432
-0.00021361358128
0.000556759943594
-0.000212905740593
0.000581886546894
-0.000213801897989
0.00060891136964
-0.000216629023934
0.000637774119186
-0.00022205796779
0.000668211262366
-0.000230972796692
-0.000243317113322
-6.21482320908e-08
5.20712561241e-07
-1.25384976019e-07
5.06802671328e-07
-1.91275906006e-07
5.04160619377e-07
-2.52161042281e-07
4.95101700819e-07
-3.11613372766e-07
4.63800650179e-07
-3.72333636042e-07
4.45612209055e-07
-4.36458837568e-07
4.29355808721e-07
-5.05575827711e-07
3.99450709668e-07
-5.69489225744e-07
3.49630112681e-07
-6.33542825609e-07
3.13295087655e-07
-6.9998015307e-07
2.56129050137e-07
-7.65447263975e-07
2.06861717459e-07
-8.33939122634e-07
1.49461779173e-07
-8.98811079685e-07
8.08256328495e-08
-9.57682527842e-07
3.8818294056e-09
-1.01939807245e-06
-7.55294162045e-08
-1.08179633163e-06
-1.70366006423e-07
-1.141643478e-06
-2.62473970649e-07
-1.20356197563e-06
-3.67584263514e-07
-1.2494388305e-06
-4.88290920886e-07
-1.29067823603e-06
-5.8893162034e-07
-1.33398659557e-06
-7.26040807653e-07
-1.36656465683e-06
-8.50439917146e-07
-1.39608143515e-06
-9.83410021623e-07
-1.4306190051e-06
-1.11793296167e-06
-1.46741176641e-06
-1.26245373706e-06
-1.51150978491e-06
-1.39102951079e-06
-1.59481491387e-06
-1.53049399458e-06
-1.83698226967e-06
-1.75779477556e-06
-2.07636537723e-06
-2.24066771952e-06
-2.11343813648e-06
-2.71031400733e-06
-2.05596514125e-06
-2.98806915156e-06
-1.91638365573e-06
-3.20664516966e-06
-1.78781265247e-06
-3.39550799576e-06
-1.63385773332e-06
-3.62945677892e-06
-1.50665461327e-06
-3.9249789379e-06
-1.33701190928e-06
-4.35004515478e-06
-8.02605540308e-07
-4.95388575388e-06
2.47352527946e-07
-4.77876974861e-06
1.06676963025e-06
-4.45630985282e-06
1.97367334819e-06
-4.87102499548e-06
2.03603972069e-06
-4.08970702357e-06
-3.02801778473e-06
-2.75369391667e-06
9.81761870028e-05
-0.000120735187951
0.00012354045442
-0.000315176611059
0.000115282348827
-0.000254133676518
0.000107209045142
-0.000177926701043
0.000111102972949
-0.00015696131995
0.000119320385706
-0.000154299762222
0.000132677288844
-0.000160937498744
0.00014918237564
-0.00017652551785
0.000167344955105
-0.000194472283184
0.000186196473702
-0.000212732607865
0.000205117337761
-0.000229375429232
0.000223658810246
-0.000243783618851
0.00024155596641
-0.000255505028811
0.000258665585863
-0.000264506285562
0.000274959066714
-0.000270877669617
0.000290485985408
-0.000274867111162
0.000305351819288
-0.0002767714919
0.000319694604072
-0.000276918872304
0.000333667356496
-0.000275628711962
0.000347425876905
-0.000273198813673
0.000361121275348
-0.000269896094643
0.000374896631467
-0.000265956658208
0.000388886179706
-0.000261589892943
0.000403216213482
-0.000256985374831
0.000418006967266
-0.000252321095919
0.000433375258448
-0.000247771843847
0.000449437680262
-0.000243516921386
0.000466313513486
-0.000239748227747
0.000484126082858
-0.000236681294635
0.000503002566783
-0.000234566702321
0.000523075039196
-0.000233685993852
0.000544483622367
-0.000234314253462
0.00056736806738
-0.000236686278296
0.000591822312408
-0.000241083202296
0.00061781616023
-0.000248051735591
0.000645151811793
-0.000258308418201
-0.000271711375485
-6.56915212164e-08
5.86646812811e-07
-1.36355251223e-07
5.77714022756e-07
-2.03403742409e-07
5.71459463832e-07
-2.6264099005e-07
5.54583095497e-07
-3.25861580645e-07
5.27256441917e-07
-3.92062630986e-07
5.12046055176e-07
-4.60122981785e-07
4.97648110621e-07
-5.3107654524e-07
4.70625787684e-07
-5.9865641281e-07
4.17415729077e-07
-6.65052053331e-07
3.7988705526e-07
-7.39797107832e-07
3.3105567623e-07
-8.08319085755e-07
2.75555481228e-07
-8.7873725177e-07
2.20047955907e-07
-9.47606287957e-07
1.4985132141e-07
-1.01634361122e-06
7.27607203916e-08
-1.08316037985e-06
-8.58297758261e-09
-1.14828540356e-06
-1.05124768135e-07
-1.21402056067e-06
-1.96635822882e-07
-1.28140034766e-06
-3.00116112569e-07
-1.33948993728e-06
-4.30125329257e-07
-1.38432090238e-06
-5.44040096078e-07
-1.43191565514e-06
-6.78400173312e-07
-1.4728159829e-06
-8.09507007543e-07
-1.50735283294e-06
-9.48853073243e-07
-1.53100297652e-06
-1.09427491481e-06
-1.54394267259e-06
-1.24952149794e-06
-1.55502581062e-06
-1.37997570756e-06
-1.56954454818e-06
-1.51603559198e-06
-1.67351271021e-06
-1.65393234318e-06
-1.98783495199e-06
-1.92649220356e-06
-2.26229658235e-06
-2.4360500828e-06
-2.36804415787e-06
-2.88250135064e-06
-2.35689067812e-06
-3.21797845692e-06
-2.27827816573e-06
-3.47421287959e-06
-2.19778757569e-06
-3.70999769618e-06
-2.14224717233e-06
-3.98040326166e-06
-2.14751178884e-06
-4.34458691803e-06
-2.10197587031e-06
-4.99851167096e-06
-1.03616636403e-06
-5.84401593734e-06
5.80593045675e-07
-6.07271064494e-06
2.71220813386e-06
-7.00259633296e-06
3.56508859097e-06
-4.94225340029e-06
5.68776525802e-07
2.44863595965e-07
0.000113308382826
-0.000233469420091
0.00012555566908
-0.000327423896849
0.000109835917004
-0.000238414407977
0.000106046520541
-0.00017413775659
0.000112137156133
-0.0001630523262
0.000122302433504
-0.000164465353092
0.000137088964228
-0.000175724309208
0.000154242208245
-0.000193679020914
0.000172565643384
-0.000212795962444
0.000191212884766
-0.000231380079969
0.000209650000853
-0.000247812763386
0.000227518563414
-0.000261652386473
0.000244626066157
-0.000272612724326
0.000260894617704
-0.000280775017507
0.000276344837286
-0.000286328058371
0.000291060528743
-0.00028958296067
0.000305166584859
-0.000290877696223
0.000318807409611
-0.00029055983548
0.000332132203892
-0.000288953636095
0.000345285250798
-0.00028635198163
0.000358400613434
-0.000283011570338
0.000371600131808
-0.000279156280589
0.000384993435147
-0.000274983291107
0.000398679315758
-0.000270671338463
0.000412747980998
-0.000266389831055
0.000427284112712
-0.000262308027698
0.000442370581455
-0.000258603422697
0.000458092203295
-0.000255469856804
0.000474538786429
-0.000253127857994
0.000491808023634
-0.000251835890525
0.000510009785615
-0.000251887686585
0.000529270144812
-0.000253574538967
0.000549725615685
-0.000257141675236
0.00057149577184
-0.000262853294179
0.000594628713149
-0.000271184606367
0.000619029533217
-0.000282709129281
-0.000297152661084
-6.97794332333e-08
6.56668597019e-07
-1.45654294285e-07
6.53843039464e-07
-2.07631552114e-07
6.33687374606e-07
-2.68509225707e-07
6.1570713109e-07
-3.38042878595e-07
5.97032166126e-07
-4.09663446011e-07
5.83906600262e-07
-4.80840746116e-07
5.6906281439e-07
-5.54899652409e-07
5.44914323945e-07
-6.3089090775e-07
4.93619804662e-07
-7.00089928613e-07
4.49287661677e-07
-7.80493733671e-07
4.11650686598e-07
-8.54557549233e-07
3.49793430863e-07
-9.29044067304e-07
2.94704149605e-07
-1.00290060227e-06
2.23866764579e-07
-1.08253771821e-06
1.52541823003e-07
-1.16014265914e-06
6.91527735491e-08
-1.23044274473e-06
-3.47051805122e-08
-1.29732276359e-06
-1.29652514281e-07
-1.365828073e-06
-2.31522377609e-07
-1.43028843237e-06
-3.65591020561e-07
-1.4873736624e-06
-4.86896902952e-07
-1.54186722933e-06
-6.23862046179e-07
-1.57783645689e-06
-7.73506685937e-07
-1.62062118436e-06
-9.06050151403e-07
-1.65352902481e-06
-1.06136020134e-06
-1.67288940682e-06
-1.23016499922e-06
-1.6655794471e-06
-1.38730634627e-06
-1.64500857573e-06
-1.53665118021e-06
-1.62357680307e-06
-1.6754469246e-06
-1.72763691337e-06
-1.8225526792e-06
-2.055790588e-06
-2.10806135757e-06
-2.36396260299e-06
-2.57451954111e-06
-2.57963142812e-06
-3.0025072386e-06
-2.67060056076e-06
-3.38339236806e-06
-2.70554375022e-06
-3.67512010203e-06
-2.75307353377e-06
-3.93281136593e-06
-2.92262065496e-06
-4.17470129617e-06
-3.40819441698e-06
-4.51230960264e-06
-3.97116333266e-06
-5.28053600683e-06
-3.6831463458e-06
-6.36099926962e-06
5.1813681057e-06
-1.58682864764e-05
8.90852062683e-06
-8.66906841856e-06
2.52820796695e-05
-1.61272134912e-05
0.000110349195012
-0.000318536642352
0.000119527186858
-0.000336602552409
0.000104695175559
-0.000223582992228
0.000105663184797
-0.000175106231093
0.000113410084736
-0.000170799602596
0.000125240474788
-0.000176296068105
0.000140993513892
-0.000191477644923
0.000158473146962
-0.000211158932797
0.000176727275174
-0.000231050355447
0.000194996822282
-0.000249649879094
0.000212838118665
-0.000265654298646
0.00022997284852
-0.000278787342469
0.000246273807736
-0.000288913896633
0.000261717854075
-0.000296219264824
0.000276363578096
-0.000300973971274
0.000290318087118
-0.000303537647677
0.000303715831595
-0.00030427560786
0.000316699555744
-0.000303543717158
0.000329408322213
-0.000301662550359
0.000341970058332
-0.000298913856705
0.000354498037338
-0.000295539678765
0.000367089993353
-0.000291748356552
0.000379828904066
-0.000287722310305
0.000392784907437
-0.000283627437668
0.000406018059255
-0.000279623062122
0.000419581920101
-0.000275871949131
0.000433527884898
-0.000272549423423
0.000447909674725
-0.000269851655872
0.000462787549078
-0.000268005708351
0.00047823367171
-0.000267281960538
0.000494340876598
-0.000267994814207
0.000511230577986
-0.000270464154283
0.000529049051784
-0.000274960091107
0.000547959185757
-0.000281763321775
0.000568137301941
-0.000291362527767
0.000589681753282
-0.000304253453936
-0.000319902574637
-7.15892998125e-08
7.28537701979e-07
-1.42000692012e-07
7.24521840521e-07
-2.11057130485e-07
7.03000730178e-07
-2.78579583178e-07
6.8348163196e-07
-3.51466557984e-07
6.7016864836e-07
-4.25618550233e-07
6.58305403717e-07
-4.98142073518e-07
6.41829273038e-07
-5.75947241097e-07
6.2295435727e-07
-6.59414669832e-07
5.77306672481e-07
-7.39247155356e-07
5.29328339617e-07
-8.24582867419e-07
4.97184909309e-07
-9.07060434399e-07
4.32451735072e-07
-9.90214396402e-07
3.78029847762e-07
-1.07499452536e-06
3.08809629179e-07
-1.16263296254e-06
2.40329728201e-07
-1.24798755843e-06
1.54641456833e-07
-1.33566331543e-06
5.30911880755e-08
-1.40962584992e-06
-5.55832552705e-08
-1.47620274651e-06
-1.64856422505e-07
-1.54459623509e-06
-2.97124938555e-07
-1.60477648502e-06
-4.26658593664e-07
-1.67399115427e-06
-5.54604631087e-07
-1.71687168102e-06
-7.30597410194e-07
-1.745992255e-06
-8.76913339856e-07
-1.76961021703e-06
-1.0377390686e-06
-1.79630402259e-06
-1.2034783832e-06
-1.8016715477e-06
-1.38195674958e-06
-1.78397772087e-06
-1.55438213882e-06
-1.74280841792e-06
-1.71667261253e-06
-1.69174114022e-06
-1.87371203969e-06
-1.74919592031e-06
-2.05072745622e-06
-1.9950730708e-06
-2.32881152792e-06
-2.280251259e-06
-2.71750755798e-06
-2.52373664816e-06
-3.14008741906e-06
-2.68303121037e-06
-3.51591809384e-06
-2.78027610709e-06
-3.83560564814e-06
-2.89406012083e-06
-4.06076942281e-06
-3.27754892996e-06
-4.12864484721e-06
-4.53927771703e-06
-4.01905199557e-06
-8.28956455612e-06
-2.61240724101e-06
-5.77163504629e-06
-1.83829794693e-05
2.84519521897e-06
-1.72892872045e-05
9.97319457266e-05
-0.000113013990759
0.000125017874345
-0.000343823893029
0.000113150337202
-0.000324735997536
0.000100891677796
-0.000211325024599
0.00010544044157
-0.000179655502294
0.000114607090999
-0.000179966657006
0.000127869814007
-0.000189559143366
0.000144233224135
-0.00020784137862
0.000161808913779
-0.000228734927571
0.000179818128017
-0.000249059860268
0.000197588343243
-0.000267420370912
0.000214765619974
-0.00028283183852
0.0002311417802
-0.000295163751987
0.000246646741139
-0.000304419093809
0.000261301006718
-0.00031087375352
0.000275190529928
-0.000314863705623
0.000288436045141
-0.000316783362131
0.000301173483031
-0.000317013234286
0.000313537757566
-0.000315908169521
0.000325653311004
-0.000313778271895
0.00033762868436
-0.000310889388018
0.000349554457363
-0.00030746559988
0.000361503248857
-0.000303697284883
0.000373531006067
-0.000299750192169
0.000385679131565
-0.000295775672513
0.000397977242556
-0.00029192126498
0.000410446668316
-0.000288341443957
0.000423104828264
-0.000285207626642
0.000435970236612
-0.000282717074189
0.000449067876575
-0.000281103326373
0.00046243751333
-0.000280651538433
0.000476150766298
-0.000281707988847
0.00049033376509
-0.000284647081678
0.000505171196751
-0.000289797443914
0.000520897687406
-0.000297489651545
0.000537862953773
-0.000308327616712
0.000556528411379
-0.000322918606491
-0.000340252429831
-7.34553343636e-08
8.02231862052e-07
-1.44067057013e-07
7.95398988331e-07
-2.24399988472e-07
7.83601666079e-07
-2.94411839276e-07
7.53755067946e-07
-3.65494312078e-07
7.41509101723e-07
-4.39299822648e-07
7.32364426523e-07
-5.13567248699e-07
7.16344728957e-07
-5.94150496577e-07
7.03779353928e-07
-6.84421258758e-07
6.6780441432e-07
-7.72060523311e-07
6.17180738903e-07
-8.58936471571e-07
5.84266478525e-07
-9.57419775403e-07
5.31122045023e-07
-1.05028419433e-06
4.7106700148e-07
-1.15118817649e-06
4.09881039338e-07
-1.24459603654e-06
3.33892354217e-07
-1.33179917901e-06
2.41977952506e-07
-1.42645901104e-06
1.47872913821e-07
-1.51141077275e-06
2.94755716321e-08
-1.59155423905e-06
-8.46258836444e-08
-1.67800078847e-06
-2.10605329139e-07
-1.74209752556e-06
-3.62504992127e-07
-1.79737218017e-06
-4.99291650136e-07
-1.85580495316e-06
-6.72138266587e-07
-1.89613285453e-06
-8.36575481322e-07
-1.92670526654e-06
-1.00716860069e-06
-1.94665434125e-06
-1.18354386533e-06
-1.96253635858e-06
-1.36609978544e-06
-1.95703344086e-06
-1.5599199245e-06
-1.92556712077e-06
-1.74819179417e-06
-1.86996034131e-06
-1.92939565489e-06
-1.78842058956e-06
-2.13237629434e-06
-1.784901454e-06
-2.33246694776e-06
-1.87647133824e-06
-2.62610108319e-06
-2.03296626291e-06
-2.98375308292e-06
-2.15250398891e-06
-3.39652166054e-06
-2.2017993233e-06
-3.78641522766e-06
-2.11127073046e-06
-4.15134258229e-06
-1.82181285917e-06
-4.41817705223e-06
-1.3462662196e-06
-4.49487672692e-06
-7.60705575989e-08
-3.88223520117e-06
-1.52133471784e-05
-3.24857780962e-06
-5.51241701046e-05
2.26238262559e-05
8.64694158106e-05
-0.000254609020435
0.000122886390989
-0.000380241566949
0.000105858443924
-0.000307708809481
9.86009914499e-05
-0.000204068206117
0.000105327418838
-0.000186382438851
0.000115672659319
-0.000190312326815
0.000130035303954
-0.000203922171065
0.000146720829638
-0.000224527259539
0.000164221505697
-0.000246235939644
0.000181857740415
-0.000266696414567
0.000199052103931
-0.000284615039044
0.000215532882191
-0.000299312906311
0.000231153158357
-0.000310784303454
0.000245891162858
-0.000319157359323
0.000259800479655
-0.00032478331818
0.000272984997449
-0.000328048458254
0.000285570883602
-0.000329369471314
0.000297689096213
-0.000329131658216
0.000309461955786
-0.000327681229759
0.000320995885864
-0.000325312391801
0.000332377631256
-0.000322271312919
0.000343673239018
-0.00031876137589
0.000354928569723
-0.000314952772018
0.000366170772022
-0.00031099253677
0.000377410417861
-0.000307015444509
0.000388644295988
-0.000303155248848
0.000399859175253
-0.000299556405109
0.000411037081165
-0.000296385583009
0.000422162214543
-0.000293842226605
0.000433228878409
-0.000292169966936
0.000444251773639
-0.000291674384687
0.000455287719382
-0.000292743851459
0.000466475522913
-0.000295834826296
0.000478057558282
-0.000301379363037
0.000490324407346
-0.000309756315238
0.000503654825184
-0.00032165742462
0.000518934209288
-0.000338197310926
-0.000358312183428
-7.73445732845e-08
8.79894769816e-07
-1.55455930268e-07
8.73803098654e-07
-2.31092632051e-07
8.59520899668e-07
-3.01739022113e-07
8.24671223871e-07
-3.73288614636e-07
8.13322467161e-07
-4.49986557222e-07
8.09322323744e-07
-5.30191915411e-07
7.96804829217e-07
-6.15913504248e-07
7.89750056184e-07
-7.12213854911e-07
7.64341778021e-07
-8.06742809024e-07
7.11930744654e-07
-8.95791834358e-07
6.73525179507e-07
-1.00244298105e-06
6.37969034923e-07
-1.10358659026e-06
5.72388492543e-07
-1.20684631652e-06
5.13308860957e-07
-1.30487500799e-06
4.32074970218e-07
-1.41018929759e-06
3.47430371016e-07
-1.51276955752e-06
2.50574692943e-07
-1.60852187284e-06
1.25332815472e-07
-1.70037704315e-06
7.3187397225e-09
-1.79217664705e-06
-1.18734102712e-07
-1.87276965814e-06
-2.81859172389e-07
-1.93987991989e-06
-4.3214276894e-07
-2.00824360722e-06
-6.03754675457e-07
-2.05370089425e-06
-7.91112162339e-07
-2.09950834672e-06
-9.61369931291e-07
-2.12546904894e-06
-1.15760556887e-06
-2.14834388254e-06
-1.34325864116e-06
-2.15246415218e-06
-1.55584497755e-06
-2.13855609256e-06
-1.76215891243e-06
-2.11034914739e-06
-1.95767716474e-06
-2.05846868862e-06
-2.18435494744e-06
-1.98770093462e-06
-2.40335642383e-06
-1.95271878834e-06
-2.66122547468e-06
-1.99038825014e-06
-2.94623478837e-06
-2.06515371717e-06
-3.32190069506e-06
-2.10214360507e-06
-3.749521808e-06
-2.01382378942e-06
-4.23973528832e-06
-1.66847855978e-06
-4.76364753852e-06
-8.74700817074e-07
-5.28836407378e-06
8.43196618853e-07
-5.59969311407e-06
2.62503363039e-06
-5.02979844694e-06
2.55106861086e-05
-2.61593068244e-07
0.000105028149207
-0.000334123526002
0.00011791689936
-0.000393130906847
9.88639968861e-05
-0.000288656718562
9.67988915099e-05
-0.0002020037874
0.000105038389257
-0.000194622495552
0.000116505494701
-0.000201779908382
0.000131640160183
-0.000219057262058
0.000148427007861
-0.000241314501438
0.000165719994201
-0.000263529297106
0.000182893531754
-0.000283870304634
0.000199470613425
-0.000301192455708
0.000215249278599
-0.000315091890432
0.000230135578694
-0.000325670906612
0.000244146818149
-0.000333168887248
0.000257360174624
-0.000337996948755
0.000269889459671
-0.000340578004341
0.000281859710195
-0.00034133997003
0.000293392115099
-0.000340664299625
0.000304593192584
-0.000338882532081
0.000315549461554
-0.000336268874665
0.000326325065133
-0.000333047118915
0.000336961593406
-0.000329398094925
0.000347479020573
-0.000325470376656
0.000357877348638
-0.000321391027428
0.000368138776726
-0.000317277016893
0.000378230402076
-0.000313246996807
0.000388107611936
-0.000309433709072
0.000397718537335
-0.000305996571056
0.000407009807418
-0.000303133517778
0.000415932492414
-0.000301092637537
0.000424447057799
-0.000300188888652
0.000432535936072
-0.000300832657953
0.000440253446202
-0.000303552244213
0.00044781936992
-0.000308945141336
0.000455619219864
-0.000317555659618
0.00046404000332
-0.000330077450872
0.000474254106235
-0.000348410847725
-0.000375177285234
-7.90458615923e-08
9.59171805872e-07
-1.61016500402e-07
9.56046861074e-07
-2.30284188078e-07
9.2906493365e-07
-2.99387826153e-07
8.94043292083e-07
-3.77893058845e-07
8.92095543041e-07
-4.60575742029e-07
8.92270871638e-07
-5.4745658451e-07
8.83946852926e-07
-6.37464342819e-07
8.80015792127e-07
-7.37341708028e-07
8.64466360095e-07
-8.4191428359e-07
8.16731216115e-07
-9.45364194601e-07
7.77191891336e-07
-1.05329768651e-06
7.46109450057e-07
-1.16532412475e-06
6.8459825394e-07
-1.27326917839e-06
6.2142212715e-07
-1.38823053742e-06
5.47196163635e-07
-1.50525495361e-06
4.645968374e-07
-1.61666252581e-06
3.62103226559e-07
-1.73624275665e-06
2.45021196907e-07
-1.83868650517e-06
1.09853171445e-07
-1.9295908159e-06
-2.77609713449e-08
-2.02222049969e-06
-1.89175258425e-07
-2.10047748786e-06
-3.53852299529e-07
-2.18821695991e-06
-5.15999082666e-07
-2.25247328288e-06
-7.26855453515e-07
-2.30198446542e-06
-9.11874662117e-07
-2.34104619828e-06
-1.11857549281e-06
-2.36493215043e-06
-1.31941857761e-06
-2.38628049026e-06
-1.53455791736e-06
-2.39183877837e-06
-1.75667220831e-06
-2.37896120042e-06
-1.97064453664e-06
-2.37238563108e-06
-2.19103649222e-06
-2.35225240605e-06
-2.42362041786e-06
-2.34290227211e-06
-2.67072026616e-06
-2.35881141988e-06
-2.93050521927e-06
-2.43329086048e-06
-3.24757570858e-06
-2.53389499227e-06
-3.64909235029e-06
-2.59470082541e-06
-4.17909059388e-06
-2.43146271275e-06
-4.92708156266e-06
-1.58275459832e-06
-6.13715941793e-06
1.33446904537e-06
-8.51621858414e-06
7.38134054768e-06
-1.10766349579e-05
2.64968205275e-05
-1.93760200431e-05
9.89584263817e-05
-0.000406587721934
0.000109767657402
-0.000403941975473
9.29140731753e-05
-0.000271804408156
9.51686873627e-05
-0.000204259295799
0.000104472860898
-0.000203927346298
0.000116987013381
-0.000214294614857
0.000132614188127
-0.000234684922301
0.000149350885038
-0.000258051640648
0.000166338071578
-0.000280516896742
0.000182992615002
-0.000300525237333
0.000198937476578
-0.000317137686611
0.000214027502478
-0.000330182266916
0.000228213921871
-0.000339857659805
0.000241543989914
-0.000346499272869
0.000254110316059
-0.000350563577845
0.000266030056209
-0.00035249803322
0.000277422086472
-0.000352732276154
0.000288394439763
-0.000351636916138
0.000299035781074
-0.000349524124928
0.000309411675514
-0.000346645008757
0.000319563210305
-0.000343198881672
0.000329507187086
-0.00033934228691
0.000339236894461
-0.000335200285377
0.000348723150236
-0.000330877468138
0.00035791549957
-0.000326469531519
0.00036674360557
-0.000322075243364
0.000375118950908
-0.000317809164176
0.000382937432737
-0.000313815126284
0.00039008425935
-0.00031028037501
0.000396442470566
-0.000307450838303
0.000401904867108
-0.000305651229318
0.000406394957567
-0.000305322691869
0.000409939532344
-0.000307096718456
0.000412887071225
-0.000311892487239
0.000416222662586
-0.000320890883529
0.000421318229432
-0.000335172203542
0.000428791515648
-0.000355882513668
-0.000387617531311
-7.66868562975e-08
1.03621252893e-06
-1.54628625617e-07
1.03429914684e-06
-2.24509495978e-07
9.99230135292e-07
-3.04798164324e-07
9.74606422153e-07
-3.8909130709e-07
9.76663711829e-07
-4.73933930561e-07
9.77386014663e-07
-5.63140287576e-07
9.73422251625e-07
-6.52960553303e-07
9.7009941284e-07
-7.52603861416e-07
9.64363680299e-07
-8.66223277503e-07
9.30588425855e-07
-9.7926198218e-07
8.90453593711e-07
-1.08625363923e-06
8.53311338798e-07
-1.21633117492e-06
8.14870030921e-07
-1.33850463859e-06
7.43769937874e-07
-1.47108071175e-06
6.79934151289e-07
-1.5945259225e-06
5.88187977599e-07
-1.71963924277e-06
4.8734392459e-07
-1.85056552337e-06
3.7605715349e-07
-1.96625055895e-06
2.256278918e-07
-2.07641284531e-06
8.24735157674e-08
-2.19330273661e-06
-7.22348494477e-08
-2.2839323002e-06
-2.63191576586e-07
-2.36192515108e-06
-4.37992631765e-07
-2.44269871199e-06
-6.46087787832e-07
-2.49682314346e-06
-8.57774442282e-07
-2.56204498192e-06
-1.0533936818e-06
-2.60902094922e-06
-1.27250219961e-06
-2.64524021086e-06
-1.4984124275e-06
-2.67094927264e-06
-1.73105699777e-06
-2.68551435344e-06
-1.95618880786e-06
-2.70414111455e-06
-2.17254152975e-06
-2.72117206218e-06
-2.40673516026e-06
-2.75278709307e-06
-2.63928697569e-06
-2.80972769957e-06
-2.87375415896e-06
-2.92638116117e-06
-3.13115133482e-06
-3.15821177948e-06
-3.41750781281e-06
-3.53568475636e-06
-3.80202538679e-06
-4.0507684142e-06
-4.41273243661e-06
-4.56917697238e-06
-5.61883377886e-06
-3.71170712881e-06
-9.37409993903e-06
6.61685637431e-07
-1.54537288434e-05
0.00011469164132
-0.000133411279424
0.000117116803232
-0.000409016970447
0.000103509379685
-0.000390336867877
8.83668976453e-05
-0.000256663422781
9.35635431702e-05
-0.000209456975269
0.000103638831848
-0.000214003406706
0.000117044044951
-0.000227700456097
0.000132929297906
-0.000250570719548
0.000149512958806
-0.000274635794654
0.000166126102648
-0.000297130497289
0.000182233816252
-0.000316633380142
0.000197551272141
-0.000332455547938
0.000211979104319
-0.000344610484176
0.000225506438036
-0.000353385359609
0.000238202134691
-0.000359195318763
0.000250167511396
-0.000362529287718
0.000261517862353
-0.000363848702931
0.000272362248969
-0.000363576967597
0.000282793350945
-0.000362068310225
0.000292880917928
-0.000359611971415
0.000302669327379
-0.000356433685651
0.000312176911099
-0.0003527067202
0.000321396303992
-0.000348561921409
0.000330295032799
-0.000344099240793
0.000338816279825
-0.000339398924183
0.000346880019762
-0.000334533458836
0.000354384862149
-0.000329580245314
0.000361210873565
-0.00032463530207
0.000367223869442
-0.000319828206725
0.000372282352032
-0.000315338900867
0.00037624810604
-0.000311416583105
0.000378996925895
-0.000308400018946
0.000380420524357
-0.000306746208188
0.000380426768869
-0.000307102900023
0.000379003836888
-0.000310469428253
0.000376417649987
-0.000318304154258
0.000373098915614
-0.000331851789446
0.000366046277982
-0.000348829725157
-0.000361233274664
-7.5126878482e-08
1.11155816666e-06
-1.50487276762e-07
1.10993813876e-06
-2.20888126669e-07
1.06991888836e-06
-3.21743476233e-07
1.07575143167e-06
-4.04651516086e-07
1.05985434672e-06
-4.87497003569e-07
1.06051155804e-06
-5.75889140739e-07
1.06208842973e-06
-6.65721460079e-07
1.06020065757e-06
-7.69514998501e-07
1.06842110761e-06
-8.91994044498e-07
1.05331757462e-06
-1.01700153096e-06
1.01569199741e-06
-1.1442428375e-06
9.80772129439e-07
-1.27729507922e-06
9.48129710681e-07
-1.41394495983e-06
8.80603027262e-07
-1.55155404603e-06
8.17708291208e-07
-1.69691065534e-06
7.3369865727e-07
-1.84056230688e-06
6.31130344268e-07
-1.97874291718e-06
5.14348554236e-07
-2.1219179261e-06
3.68897344898e-07
-2.24574637527e-06
2.06373795133e-07
-2.36270130043e-06
4.47692538305e-08
-2.4741299635e-06
-1.51732835073e-07
-2.5633687443e-06
-3.48745625815e-07
-2.67151166477e-06
-5.37956869852e-07
-2.75338029358e-06
-7.75934914152e-07
-2.81101766528e-06
-9.95806844402e-07
-2.86541497698e-06
-1.21817297922e-06
-2.91236035621e-06
-1.45155550806e-06
-2.95669499619e-06
-1.68683128549e-06
-2.98386631287e-06
-1.92914717051e-06
-3.00658942314e-06
-2.14996418456e-06
-3.03804365121e-06
-2.37544779422e-06
-3.08545037125e-06
-2.59206617995e-06
-3.16362891087e-06
-2.79578770904e-06
-3.30248264154e-06
-2.99253067994e-06
-3.57104748146e-06
-3.14924119164e-06
-4.12300896679e-06
-3.25060455064e-06
-5.30551507865e-06
-3.23066166804e-06
-7.73903257679e-06
-3.18594422197e-06
-1.48033064862e-05
-2.31322239751e-06
-5.65723617271e-05
2.63011216917e-05
6.29759851184e-05
-0.000252972149867
0.000109731069267
-0.00045577521934
9.45226649457e-05
-0.000375130578914
8.46475610587e-05
-0.000246789811477
9.18424659584e-05
-0.000216652965026
0.000102535915217
-0.000224697695098
0.00011663177396
-0.000241797006455
0.000132592123
-0.000266531671405
0.000148952279086
-0.000290996494832
0.000165147659834
-0.000313326381111
0.000180702729232
-0.000332188920107
0.000195411416606
-0.000347164679597
0.000209211512207
-0.000358411000722
0.000222123125491
-0.000366297373703
0.000234229579092
-0.000371302154481
0.00024563556841
-0.000373935642644
0.000256450594326
-0.000374664078817
0.000266771430716
-0.00037389813988
0.000276674177368
-0.000371971379151
0.00028620936752
-0.000369147471118
0.000295400514724
-0.000365625129592
0.000304243816615
-0.000361550305949
0.000312708328711
-0.000357026703404
0.000320735948092
-0.000352127114287
0.000328241175856
-0.000346904387199
0.000335110629995
-0.000341403124073
0.000341201882948
-0.000335671679997
0.000346340182805
-0.000329773746532
0.000350310206198
-0.000323798334646
0.000352838351594
-0.000317867103187
0.000353557606169
-0.000312135858744
0.000351937339953
-0.000306779726528
0.000347144034077
-0.00030195288999
0.000337790986579
-0.000297749819568
0.000321489005024
-0.000294167336478
0.0002936972295
-0.000290511828538
0.000244301799534
-0.000282456197564
0.000152596560944
-0.00025712164206
-0.000208636461419
-7.8026176431e-08
1.18997556061e-06
-1.59769837531e-07
1.19201178624e-06
-2.33957712053e-07
1.14441665608e-06
-3.27553168524e-07
1.16965217161e-06
-4.13307598829e-07
1.14590254302e-06
-4.96784387531e-07
1.14427377157e-06
-5.85090852183e-07
1.15067507946e-06
-6.79213485094e-07
1.15459865244e-06
-7.84395747682e-07
1.17387536175e-06
-9.053254358e-07
1.17450842646e-06
-1.03985410715e-06
1.15046544107e-06
-1.17913811402e-06
1.12028362361e-06
-1.31577863043e-06
1.08498533386e-06
-1.47035052929e-06
1.03536962144e-06
-1.62695348019e-06
9.74486574094e-07
-1.79205115647e-06
8.98954610872e-07
-1.94361366373e-06
7.82831263627e-07
-2.1019951103e-06
6.72847067925e-07
-2.267075093e-06
5.34071119233e-07
-2.40919430498e-06
3.48564101008e-07
-2.54278603278e-06
1.78409340738e-07
-2.69204671142e-06
-2.44624860319e-09
-2.81293740852e-06
-2.27851202544e-07
-2.90824669625e-06
-4.42662756121e-07
-3.00335784849e-06
-6.80862964757e-07
-3.07384297341e-06
-9.25380462641e-07
-3.13797159385e-06
-1.15412395137e-06
-3.18967676908e-06
-1.3999532369e-06
-3.22828270578e-06
-1.64834928996e-06
-3.26050789813e-06
-1.89706501821e-06
-3.28768100134e-06
-2.12295267563e-06
-3.31207378668e-06
-2.35123244068e-06
-3.33434924338e-06
-2.56998585922e-06
-3.36448840032e-06
-2.76586971578e-06
-3.4335673685e-06
-2.92369409719e-06
-3.55304587715e-06
-3.03003377902e-06
-3.77638300197e-06
-3.0276440049e-06
-4.23390149786e-06
-2.77366112712e-06
-5.4590541298e-06
-1.96074673617e-06
-9.04593246391e-06
1.2707628888e-06
-2.35240216899e-05
4.07697801344e-05
9.19428963742e-05
-0.000368444280099
0.000103580846256
-0.0004674157255
8.46423450797e-05
-0.000356193894342
8.07664772783e-05
-0.000242915306761
8.95788881489e-05
-0.000225466438792
0.000101051394692
-0.00023617106884
0.000115699405337
-0.000256445756789
0.000131625219159
-0.000282458139662
0.000147720370142
-0.000307092240674
0.000163475996751
-0.000329082557536
0.000178488513474
-0.000347201951353
0.000192615749873
-0.000361292400627
0.000205826418712
-0.000371622129067
0.000218165133616
-0.000378636525538
0.000229723865834
-0.000382861304058
0.000240606584058
-0.000384818760115
0.000250914145038
-0.000384972023007
0.000260729465936
-0.000383713828802
0.000270111456978
-0.000381353724331
0.0002790914335
-0.000378127788208
0.000287672233747
-0.000374206257252
0.000295827775678
-0.000369706161708
0.000303502354806
-0.000364701581692
0.000310609025702
-0.000359234067632
0.000317026853324
-0.000353322476304
0.000322596497694
-0.000346973004576
0.000327112809909
-0.000340188196265
0.000330311736887
-0.00033297284162
0.000331847198404
-0.000325333923563
0.000331252069941
-0.0003172720663
0.000327876170922
-0.000308760014072
0.000320792187154
-0.000299695791797
0.000308657741428
-0.000289818481772
0.000289508680403
-0.000278600842341
0.000260378971912
-0.000265037656761
0.000216644090335
-0.000246776783526
0.000152651264353
-0.000218461753128
7.10435750506e-05
-0.000175513893746
-0.000137592113795
-7.97860605184e-08
1.26995716958e-06
-1.65172900909e-07
1.27768233352e-06
-2.51281083902e-07
1.23081545645e-06
-3.12804073656e-07
1.23147942574e-06
-4.13607632812e-07
1.24700259496e-06
-5.02031968553e-07
1.23298759048e-06
-5.91833812721e-07
1.24076203846e-06
-6.90213378505e-07
1.2532595859e-06
-7.90928118617e-07
1.27486971606e-06
-9.11566623685e-07
1.29542253586e-06
-1.05517931339e-06
1.29433834408e-06
-1.20399485633e-06
1.26934204487e-06
-1.35790169667e-06
1.23911372336e-06
-1.52123914553e-06
1.19891679646e-06
-1.70509334697e-06
1.15852524173e-06
-1.88812226238e-06
1.08214256659e-06
-2.09005573218e-06
9.84905996697e-07
-2.27861453396e-06
8.61526074413e-07
-2.44607042969e-06
7.0161796945e-07
-2.63479712677e-06
5.37359672774e-07
-2.79417474594e-06
3.37833464108e-07
-2.92987176669e-06
1.33271812051e-07
-3.06550441768e-06
-9.22189046193e-08
-3.17506204883e-06
-3.33130201897e-07
-3.28429201254e-06
-5.71679700754e-07
-3.37626403606e-06
-8.33478787691e-07
-3.44080526999e-06
-1.08967730992e-06
-3.49527288973e-06
-1.3456017374e-06
-3.5317350635e-06
-1.61202352758e-06
-3.55750494045e-06
-1.87145109817e-06
-3.56362376088e-06
-2.11700150173e-06
-3.54850365882e-06
-2.36653275114e-06
-3.52438887893e-06
-2.59429953165e-06
-3.48801918922e-06
-2.80245871526e-06
-3.44538823434e-06
-2.96655348866e-06
-3.38402333981e-06
-3.09166332684e-06
-3.2524920261e-06
-3.15941466821e-06
-2.81882776752e-06
-3.20739876063e-06
-1.56314305262e-06
-3.21710626926e-06
4.10803997373e-06
-4.40081617876e-06
5.86520963613e-05
-1.37760571322e-05
8.1512520181e-05
-0.0003913118556
8.96485897695e-05
-0.000475554238243
7.61516625013e-05
-0.000342698498259
7.69704848863e-05
-0.000243735300797
8.6854522005e-05
-0.00023535145693
9.91691195237e-05
-0.000248486517986
0.000114234696758
-0.000271512094415
0.000130069654666
-0.000298293788453
0.00014587969788
-0.000322902920688
0.000161191307896
-0.00034439476062
0.000175681605683
-0.000361692805387
0.000189259045272
-0.000374870365466
0.00020191902759
-0.000384282609254
0.000213724802645
-0.000390442774944
0.000224772455652
-0.000393909410056
0.000235162099522
-0.000395208838325
0.000244983924401
-0.000394794264898
0.000254305988838
-0.000393036294713
0.00026316963335
-0.000390217755509
0.000271586769764
-0.000386545297395
0.000279539033407
-0.000382158879907
0.000286976513503
-0.000377143986738
0.000293815363386
-0.000371540761249
0.000299933697078
-0.000365352712729
0.000305165564354
-0.000358554633029
0.000309292435951
-0.000351100138355
0.000312031068585
-0.000342927059236
0.000313016006768
-0.000333957975919
0.000311774537611
-0.000324092617132
0.000307692154344
-0.000313189818128
0.000299969322947
-0.00030103730021
0.000287577810012
-0.000287304392472
0.00026923114807
-0.00027147197686
0.000243363716423
-0.000252733528323
0.000208085009032
-0.000229758908321
0.000161425193041
-0.000200116608491
0.000103567183205
-0.000160603800133
4.33234375672e-05
-0.000115268973508
-9.42693332878e-05
-7.685343522e-08
1.34723838802e-06
-1.57966476414e-07
1.35912856641e-06
-2.65852454093e-07
1.33901699909e-06
-3.22005334649e-07
1.28792832655e-06
-4.17424267986e-07
1.34272823594e-06
-5.03587555382e-07
1.31944679017e-06
-5.90777397907e-07
1.32823888853e-06
-6.87485498964e-07
1.35025221429e-06
-7.87034378149e-07
1.37470268835e-06
-9.10792665838e-07
1.41946387353e-06
-1.05305792044e-06
1.43688169414e-06
-1.2228618659e-06
1.43940263309e-06
-1.39999941813e-06
1.4164915215e-06
-1.58374518104e-06
1.38287682443e-06
-1.77668962972e-06
1.35166521567e-06
-1.98446444645e-06
1.29008001609e-06
-2.20409145489e-06
1.20467147761e-06
-2.41632461691e-06
1.07387074006e-06
-2.62089348608e-06
9.06273126719e-07
-2.82709587408e-06
7.43625308272e-07
-3.01362738775e-06
5.24403340529e-07
-3.16879325617e-06
2.88453278072e-07
-3.32088939708e-06
5.98680427879e-08
-3.45481449291e-06
-1.99238878218e-07
-3.56215841351e-06
-4.64394603022e-07
-3.66362306364e-06
-7.32098835593e-07
-3.74255087255e-06
-1.01085665716e-06
-3.80490944277e-06
-1.28337170839e-06
-3.85553243852e-06
-1.56154953193e-06
-3.86752502344e-06
-1.85961998611e-06
-3.84477295837e-06
-2.1399250529e-06
-3.80099873206e-06
-2.41049093772e-06
-3.72899062288e-06
-2.66650791543e-06
-3.62552866783e-06
-2.90614206621e-06
-3.49505343873e-06
-3.09726195819e-06
-3.34217194718e-06
-3.24472612475e-06
-3.16460925401e-06
-3.33710968935e-06
-2.96689300164e-06
-3.4056430106e-06
-2.70772707532e-06
-3.4765582104e-06
-1.55615801862e-06
-5.55336105805e-06
7.48367097903e-05
-9.01872207999e-05
6.63453163914e-05
-0.000382825762089
8.09941827696e-05
-0.000490205536839
6.94766385246e-05
-0.00033118242285
7.31889975229e-05
-0.00024744877964
8.38767134887e-05
-0.000246040130372
9.69637474778e-05
-0.00026157441606
0.000112292880535
-0.000286842019343
0.00012799647841
-0.000313998119589
0.000143507023293
-0.000338414148205
0.000158379830621
-0.000359268206764
0.000172372316081
-0.000375685891789
0.000185432035597
-0.000387930652492
0.000197577712671
-0.000396428825054
0.000208885971551
-0.000401751546754
0.000219453502525
-0.000404477431663
0.000229374129574
-0.000405129935643
0.000238725878839
-0.000404146466501
0.000247561161864
-0.000401872013293
0.000255903198194
-0.000398560212062
0.000263743683713
-0.00039438618837
0.000271041352952
-0.000389456940207
0.000277719188608
-0.00038382219866
0.000283659714774
-0.000377481647009
0.000288698155475
-0.000370391493739
0.00029261377111
-0.00036247056531
0.000295119546117
-0.000353606202279
0.000295850469474
-0.000343658241796
0.000294351164798
-0.000332458901613
0.000290064321582
-0.000319805981818
0.000282322223218
-0.000305447914893
0.000270347540625
-0.000289062817271
0.000253281485099
-0.000270238567314
0.000230267435333
-0.000248458144689
0.000200584575342
-0.000223050796768
0.000163801097326
-0.000192975343675
0.000120303699656
-0.000156618755167
7.31029209648e-05
-0.000113402613135
3.00854891397e-05
-7.22527580724e-05
-6.41850904771e-05
-7.34521213117e-08
1.42085433681e-06
-1.55896914564e-07
1.44185867338e-06
-2.68971657966e-07
1.45239307185e-06
-3.47486983092e-07
1.3667457222e-06
-4.06133357367e-07
1.40168240503e-06
-4.90696512417e-07
1.4043016111e-06
-5.75012977842e-07
1.41284577533e-06
-6.68791983563e-07
1.44431846936e-06
-7.75259487049e-07
1.48145737334e-06
-8.95952180104e-07
1.54045174886e-06
-1.04838256623e-06
1.58960081086e-06
-1.22650144527e-06
1.61780469866e-06
-1.42177369156e-06
1.61201093212e-06
-1.63910562604e-06
1.60043339614e-06
-1.86793533169e-06
1.5806838009e-06
-2.12244921648e-06
1.54475656573e-06
-2.35866371779e-06
1.44100660716e-06
-2.60568054524e-06
1.32098456915e-06
-2.83959898157e-06
1.1402637917e-06
-3.04679350843e-06
9.50868472689e-07
-3.2632942485e-06
7.40931521396e-07
-3.45178501374e-06
4.7694688176e-07
-3.60687030107e-06
2.1493125369e-07
-3.75522689285e-06
-5.09298729672e-08
-3.8825334698e-06
-3.37162356737e-07
-3.98768897151e-06
-6.27040722289e-07
-4.07926442553e-06
-9.19402209254e-07
-4.14819629034e-06
-1.21458110463e-06
-4.1838681617e-06
-1.52603354908e-06
-4.1907050073e-06
-1.85295313215e-06
-4.16328463186e-06
-2.16752821795e-06
-4.09221093773e-06
-2.48175771582e-06
-3.96209564059e-06
-2.7968350718e-06
-3.78265726946e-06
-3.08580637674e-06
-3.54612484066e-06
-3.33401823199e-06
-3.27276021765e-06
-3.51823158606e-06
-3.01365956375e-06
-3.59638518139e-06
-2.94214346373e-06
-3.47720572708e-06
-3.83092956878e-06
-2.58806933983e-06
-1.01030045414e-05
7.03529306583e-07
-0.000145877971811
4.55698675784e-05
3.33489549262e-05
-0.000562059660033
6.76518637376e-05
-0.000524510737638
6.19061115626e-05
-0.000325437998543
6.916626151e-05
-0.000254709964129
8.07439155487e-05
-0.000257618715257
9.45022159228e-05
-0.000275333583782
0.000109959853196
-0.000302300473753
0.000125495795924
-0.000329534830839
0.000140690364755
-0.000353609440311
0.00015513161659
-0.000373710139865
0.000168649349174
-0.000389204267343
0.000181220542175
-0.000400502454531
0.000192883802826
-0.000408092664153
0.000203724329962
-0.000412592625767
0.000213836586609
-0.000414590216091
0.000223306074806
-0.000414599930607
0.000232197385157
-0.000413038264177
0.000240546379274
-0.00041022147733
0.00024835710817
-0.000406371394408
0.000255599312175
-0.000401628830399
0.000262205790998
-0.000396063841844
0.000268067579321
-0.00038968439374
0.000273026807411
-0.000382441264164
0.000276867915809
-0.000374232969952
0.000279308683022
-0.00036491167588
0.000279992644969
-0.000354290480453
0.000278485069765
-0.000342150957712
0.000274275990986
-0.000328250092044
0.000266794756189
-0.000312325011536
0.000255439975814
-0.0002940934048
0.000239630321379
-0.000273253460445
0.000218895283247
-0.000249503858302
0.000193046599209
-0.000222609744988
0.000162437295046
-0.000192441582197
0.000128188049243
-0.000158725531996
9.24791459204e-05
-0.00012090976946
5.95764908539e-05
-8.05003578785e-05
3.53586213382e-05
-4.80368206039e-05
-2.88275815598e-05
-6.51828110153e-08
1.4864624309e-06
-1.47605839548e-07
1.52461592112e-06
-2.29710580955e-07
1.53481397462e-06
-3.29035951723e-07
1.46636306298e-06
-3.87093499674e-07
1.46002313324e-06
-4.71582595846e-07
1.48908441318e-06
-5.47679616667e-07
1.48922632615e-06
-6.37090405958e-07
1.53401236112e-06
-7.47205357312e-07
1.59186243436e-06
-8.6216735296e-07
1.65570385109e-06
-1.0146633075e-06
1.74239624003e-06
-1.18831368867e-06
1.79173498291e-06
-1.41497031027e-06
1.83893279424e-06
-1.6634823162e-06
1.84916294355e-06
-1.93972454146e-06
1.85711493908e-06
-2.22644119778e-06
1.83162041567e-06
-2.52416527983e-06
1.73884598733e-06
-2.80043646105e-06
1.59733581364e-06
-3.08655718226e-06
1.42644293897e-06
-3.32903675601e-06
1.19338467237e-06
-3.53883140364e-06
9.50739171936e-07
-3.76065132883e-06
6.98756963592e-07
-3.94643339517e-06
4.00676709512e-07
-4.09660504873e-06
9.91797459834e-08
-4.24131037902e-06
-1.92544802539e-07
-4.36157568165e-06
-5.06888425332e-07
-4.4492015978e-06
-8.31911185444e-07
-4.49734384591e-06
-1.16659096663e-06
-4.50908911347e-06
-1.51445815741e-06
-4.49854393886e-06
-1.86367996203e-06
-4.44110711039e-06
-2.22515709062e-06
-4.35252387669e-06
-2.57054654345e-06
-4.2157376233e-06
-2.93384124058e-06
-4.00542180322e-06
-3.29635980023e-06
-3.69827451665e-06
-3.64135469382e-06
-3.26652292656e-06
-3.95009243386e-06
-2.66994116656e-06
-4.19291977502e-06
-1.70320567003e-06
-4.44391803579e-06
-3.26255267603e-08
-4.25880336606e-06
3.77032325143e-06
-3.0991171977e-06
5.00614091208e-05
-7.24647280801e-07
6.05195607213e-05
-0.000572520318548
6.1082943281e-05
-0.000525075908003
5.5820271833e-05
-0.000320176658604
6.53238686233e-05
-0.000264214660626
7.75554342632e-05
-0.000269851264844
9.18467772497e-05
-0.000289625842877
0.00010732608828
-0.000317780648217
0.000122660586634
-0.000344870145013
0.00013752052084
-0.000368470145026
0.000151535811803
-0.000387726158376
0.000164597402583
-0.000402266546318
0.000176704305991
-0.000412610009978
0.000187911263292
-0.000419300241682
0.00019830767248
-0.000422989626338
0.000207983295473
-0.000424266405409
0.000217013427087
-0.000423630605582
0.000225447898967
-0.000421473259174
0.000233304745479
-0.000418078827995
0.000240567097437
-0.000413634233232
0.000247180015962
-0.000408242219146
0.00025304625985
-0.000401930539427
0.00025801937889
-0.00039465794919
0.000261894915682
-0.000386317217564
0.000264401873751
-0.000376740322375
0.000265197602409
-0.000365707773911
0.000263869248343
-0.000352962471951
0.000259945383531
-0.000338227417093
0.000252922761284
-0.000321227790792
0.0002423136554
-0.000301716233298
0.000227715619054
-0.000279495725439
0.000208902032753
-0.000254440286664
0.000185942823688
-0.000226545033374
0.000159398461503
-0.000196065628979
0.000130636332885
-0.00016367915178
0.000102054591557
-0.000130143756071
7.62791189304e-05
-9.51339075363e-05
5.53136152364e-05
-5.95362266374e-05
2.69749556256e-05
-1.9699964e-05
-1.85267506293e-06
-4.59686738949e-08
1.53254557898e-06
-1.18165215699e-07
1.59705288609e-06
-1.7741529126e-07
1.59433732128e-06
-2.97144274554e-07
1.58637471152e-06
-3.99889608904e-07
1.56304960204e-06
-4.66481824635e-07
1.55594668072e-06
-5.14504776028e-07
1.53751804978e-06
-5.92255621731e-07
1.61204128327e-06
-6.9658610753e-07
1.6964745908e-06
-8.17788823785e-07
1.77720172858e-06
-9.56932773341e-07
1.88183652491e-06
-1.15631576556e-06
1.99141702707e-06
-1.38045835324e-06
2.06334215898e-06
-1.67256488656e-06
2.14150836628e-06
-2.00210307013e-06
2.18683815818e-06
-2.34156371252e-06
2.17122470852e-06
-2.68520263694e-06
2.0825851731e-06
-3.019702143e-06
1.93190711974e-06
-3.34200174951e-06
1.74878859966e-06
-3.65344379169e-06
1.50485037824e-06
-3.90405243762e-06
1.20134914121e-06
-4.10532802728e-06
9.00006777503e-07
-4.30892704863e-06
6.04226580389e-07
-4.48402053204e-06
2.74194695572e-07
-4.61741824206e-06
-5.92511223273e-08
-4.7228851498e-06
-4.01552591944e-07
-4.7886664596e-06
-7.66282782875e-07
-4.82702174416e-06
-1.12841162908e-06
-4.84641154848e-06
-1.49525779875e-06
-4.84539266184e-06
-1.86490269407e-06
-4.82960608782e-06
-2.24116296184e-06
-4.76919805775e-06
-2.6311885969e-06
-4.65298070765e-06
-3.05031110588e-06
-4.45459228283e-06
-3.49499447428e-06
-4.13985162362e-06
-3.95626922507e-06
-3.68150696288e-06
-4.40846108753e-06
-2.90575059274e-06
-4.9686436935e-06
-1.44281403471e-06
-5.90673628702e-06
1.29012298918e-06
-6.99081639001e-06
6.46697970538e-06
-8.27693425832e-06
1.48464802958e-05
-9.10424656481e-06
5.59987414458e-05
-0.000613677016427
5.68122399471e-05
-0.000525891279911
5.26042923972e-05
-0.000315970141296
6.23494690065e-05
-0.000273961055775
7.45828885076e-05
-0.000282085765157
8.91226969105e-05
-0.000304166643651
0.000104493929499
-0.000333152806513
0.000119582120197
-0.000359959206292
0.000134084748829
-0.000382973594089
0.000147675982458
-0.000401318166842
0.000160294471406
-0.000414885767861
0.00017195561886
-0.000424271852418
0.00018272626268
-0.000430071546209
0.000192696050051
-0.000432960044549
0.000201947728695
-0.000433518687622
0.000210544482689
-0.000432227939297
0.000218519851636
-0.000429449185619
0.000225872303835
-0.000425431817799
0.000232561672308
-0.000420324120399
0.000238504999434
-0.000414186047085
0.00024357068544
-0.000406996708242
0.000247570157294
-0.000398657884462
0.000250249268833
-0.000388996771286
0.000251283552645
-0.000377775024998
0.00025028225187
-0.000364706867911
0.000246805169048
-0.000349485763441
0.000240395445039
-0.000331818060922
0.000230631961531
-0.000311464680607
0.000217205127205
-0.000288289804535
0.000200012054476
-0.000262303121011
0.000179250261091
-0.000233678940091
0.000155483494423
-0.000202778630611
0.000129664944914
-0.00017024716868
0.000103122913426
-0.000137137240234
7.77571729943e-05
-0.000104777897553
5.44916810926e-05
-7.18698393739e-05
1.99632365337e-05
-2.50090963795e-05
1.07690629484e-06
-8.13864330213e-07
-7.76154034266e-07
-1.70070573688e-08
1.54991115786e-06
-7.44209704892e-08
1.65475117021e-06
-1.46605544276e-07
1.6668014769e-06
-2.55122669652e-07
1.69517451654e-06
-3.77763614691e-07
1.68596563636e-06
-4.46302275403e-07
1.62475068584e-06
-4.83446501288e-07
1.57491852799e-06
-5.49789056327e-07
1.67865159876e-06
-6.42350615697e-07
1.78931983542e-06
-7.62777829034e-07
1.89791162953e-06
-8.98161163929e-07
2.01752050246e-06
-1.10039010688e-06
2.193925412e-06
-1.34491945834e-06
2.30813991878e-06
-1.67992192336e-06
2.47673309538e-06
-2.05339415467e-06
2.56050622423e-06
-2.48304832228e-06
2.60103066991e-06
-2.9015779599e-06
2.50123499991e-06
-3.30444225092e-06
2.33485458174e-06
-3.65942948899e-06
2.10382506262e-06
-3.99174395939e-06
1.83718746291e-06
-4.30306262304e-06
1.51265796813e-06
-4.54539392657e-06
1.14230352281e-06
-4.72864426853e-06
7.87411950226e-07
-4.90496793772e-06
4.50426566549e-07
-5.02956888911e-06
6.52248160698e-08
-5.10827192523e-06
-3.23001340643e-07
-5.18069040889e-06
-6.94045492622e-07
-5.24958134391e-06
-1.05972163074e-06
-5.31507218169e-06
-1.42998833821e-06
-5.36457762382e-06
-1.81563965232e-06
-5.37734541789e-06
-2.22865527765e-06
-5.32918229291e-06
-2.6796172994e-06
-5.24581265459e-06
-3.13395914935e-06
-5.11448400578e-06
-3.626557345e-06
-4.89160422169e-06
-4.17926566831e-06
-4.51967488594e-06
-4.78040557487e-06
-3.83837256772e-06
-5.64993967082e-06
-2.48956107378e-06
-7.25497012512e-06
3.85784312351e-07
-9.86614157525e-06
7.30822250661e-06
-1.51990468506e-05
2.78453506374e-05
-2.9643425173e-05
4.60747305923e-05
-0.000631909055267
4.81756552983e-05
-0.000527993979935
4.84661744413e-05
-0.000316262203261
5.9263381841e-05
-0.000284759602784
7.16941181107e-05
-0.000294517687581
8.63725570825e-05
-0.000318846157469
0.000101544061423
-0.000348325305656
0.000116341118317
-0.000374757193029
0.00013046163854
-0.000397094988775
0.000143626647578
-0.000414483999944
0.000155809690489
-0.000427069589986
0.000167038177233
-0.000435501077359
0.000177386808813
-0.000440420880127
0.000186941925709
-0.000442515831146
0.000195776978059
-0.00044235438128
0.000203941031221
-0.000440392607514
0.000211449505092
-0.000436958251323
0.000218279117532
-0.000432262000132
0.000224363582079
-0.000426409134716
0.000229588443087
-0.000419411438034
0.000233784107889
-0.000411192883018
0.000236717546696
-0.000401591811931
0.000238086724044
-0.000390366414708
0.000237523862445
-0.000377212605619
0.000234613662037
-0.000361797088568
0.000228929983078
-0.000343802494674
0.00022009061975
-0.000322979107921
0.000207827986337
-0.000299202491593
0.000192073991367
-0.000272536309267
0.000173045460396
-0.000243275097816
0.000151274465909
-0.00021190841455
0.000127504657949
-0.00017900913297
0.00010247570742
-0.000145218224965
7.65018748824e-05
-0.000111163729909
4.87593645109e-05
-7.70369294042e-05
2.26469149735e-05
-4.57591543119e-05
7.96912297169e-08
-2.44226224039e-06
-5.54751680054e-08
-6.79534873956e-07
-8.31736368373e-07
1.2118271376e-08
1.53785678665e-06
-3.81966455e-08
1.70526367659e-06
-1.20766169368e-07
1.74961814473e-06
-2.07438339493e-07
1.78212408718e-06
-3.17306041911e-07
1.79612062846e-06
-4.13197506465e-07
1.72090950963e-06
-4.86791147144e-07
1.64876388095e-06
-5.29342576565e-07
1.72146708748e-06
-5.95201128954e-07
1.85543889397e-06
-6.91640013095e-07
1.99463174611e-06
-8.23508796958e-07
2.149651814e-06
-9.73810482632e-07
2.34450591459e-06
-1.25697747145e-06
2.59155512154e-06
-1.60414808989e-06
2.82416873887e-06
-2.09681641224e-06
3.0534209376e-06
-2.60282228914e-06
3.10726420999e-06
-3.11625797771e-06
3.01483448817e-06
-3.61985285558e-06
2.83857489552e-06
-4.06003209539e-06
2.54409295489e-06
-4.42223631513e-06
2.19942728574e-06
-4.73907964197e-06
1.82950500846e-06
-5.02733911968e-06
1.43052697708e-06
-5.239583906e-06
9.99585080839e-07
-5.36433262734e-06
5.75064928881e-07
-5.48340086702e-06
1.84148752999e-07
-5.58945637753e-06
-2.1712596053e-07
-5.68987131361e-06
-5.93838063742e-07
-5.78285521807e-06
-9.66973061066e-07
-5.85085428237e-06
-1.36225304183e-06
-5.88128463019e-06
-1.78549675783e-06
-5.89001951664e-06
-2.22020659024e-06
-5.927613174e-06
-2.64233878081e-06
-5.9585136463e-06
-3.10334292244e-06
-5.95558673792e-06
-3.62968765076e-06
-5.91771411253e-06
-4.21725574599e-06
-5.78611669045e-06
-4.91215625295e-06
-5.56422603866e-06
-5.87140567908e-06
-5.40573383504e-06
-7.41323965248e-06
-5.85495808672e-06
-9.4167451339e-06
-6.33569768825e-06
-1.4719078064e-05
0.000135347734885
-0.000171337134662
5.86317255648e-05
-0.000555195911889
4.58695914719e-05
-0.000515234092644
4.53559070296e-05
-0.000315750372109
5.61150286006e-05
-0.000295520271068
6.87987538292e-05
-0.000307202738555
8.35801467183e-05
-0.000333628729774
9.85192656956e-05
-0.000363265499947
0.000112997600343
-0.000389236525009
0.000126715748216
-0.000410814068397
0.000139450519588
-0.000427219647124
0.000151201832547
-0.000438821728459
0.000162006358925
-0.000446306385587
0.000171942595334
-0.000450357858919
0.000181090399337
-0.000451664343388
0.000189511629922
-0.000450776288815
0.000197239116916
-0.000448120744022
0.00020426811585
-0.000443987873987
0.000210551210071
-0.000438545694925
0.000215993261394
-0.00043185176412
0.000220445617749
-0.000423864351006
0.000223699105552
-0.000414446904995
0.000225477916609
-0.000403371134282
0.000225440507098
-0.000390329492427
0.000223194924081
-0.000374967487131
0.000218334429746
-0.000356937043087
0.000210494413587
-0.00033596292245
0.000199422659003
-0.000311907828063
0.000185047636579
-0.000284827983864
0.000167534808328
-0.000255024052018
0.000147330267411
-0.000223071103369
0.00012515037937
-0.000189728931723
0.000101766459654
-0.00015562502284
7.76923594805e-05
-0.000121144480137
5.3843110029e-05
-8.73154647749e-05
3.17127309775e-05
-5.4909444682e-05
2.49146649738e-06
-1.6540432807e-05
-4.58336120059e-08
9.44184254791e-08
-9.26350723906e-08
-6.329050124e-07
-9.24735483683e-07
2.87486480722e-08
1.50940167746e-06
-1.36830633514e-08
1.7479360171e-06
-8.27797577697e-08
1.81896613679e-06
-1.6102804239e-07
1.86063957816e-06
-2.47154236816e-07
1.88253433674e-06
-3.65223325937e-07
1.83924807883e-06
-4.85061981298e-07
1.76886332818e-06
-5.12857564922e-07
1.74951390437e-06
-5.47918400207e-07
1.89075780552e-06
-6.08948595533e-07
2.05592362384e-06
-7.0558731055e-07
2.24654471751e-06
-8.42530887661e-07
2.48167490989e-06
-1.07766453902e-06
2.8269313302e-06
-1.50795577673e-06
3.25470843721e-06
-1.97862812108e-06
3.52442795836e-06
-2.65584482226e-06
3.78473049514e-06
-3.37000655293e-06
3.72928693203e-06
-3.99965642038e-06
3.4684143259e-06
-4.51917785444e-06
3.06372193932e-06
-4.97418431519e-06
2.65449028347e-06
-5.27176374448e-06
2.12708311528e-06
-5.52143830535e-06
1.68015701023e-06
-5.72418722887e-06
1.20224593046e-06
-5.8612543302e-06
7.1200151748e-07
-5.95103179156e-06
2.73755521125e-07
-6.06443008868e-06
-1.03932570735e-07
-6.16321041357e-06
-4.95300519136e-07
-6.23400782333e-06
-8.96451737522e-07
-6.28347378214e-06
-1.31309221286e-06
-6.35253937189e-06
-1.71674883414e-06
-6.48345876171e-06
-2.08963860615e-06
-6.62553623725e-06
-2.50059089517e-06
-6.73766951185e-06
-2.99150437667e-06
-6.82897554048e-06
-3.53859181883e-06
-6.90830075751e-06
-4.13813395614e-06
-7.00876942075e-06
-4.81147598025e-06
-7.17680942742e-06
-5.70343814064e-06
-7.91772920859e-06
-6.67225823499e-06
-1.22811631241e-05
-5.05397856351e-06
-9.05954253811e-05
6.35825637065e-05
-9.10196739182e-05
-0.000170934870334
9.71765136192e-06
-0.000655936745777
3.53043416976e-05
-0.000540823347726
4.06665911637e-05
-0.000321114653631
5.28063090398e-05
-0.000307661659491
6.596633131e-05
-0.000320364191038
8.07927130361e-05
-0.00034845637785
9.5468269239e-05
-0.000377942207844
0.000109601029087
-0.000403370347183
0.000122898471579
-0.000424112500686
0.000135197875459
-0.000439519977442
0.000146518770726
-0.000450143495923
0.00015690507526
-0.000456693513872
0.000166435214391
-0.000459888780251
0.00017517971367
-0.000460409587285
0.000183186535139
-0.000458783822286
0.00019047010398
-0.000455404994533
0.000197003356268
-0.000450521781031
0.000202712374789
-0.00044425534236
0.000207470837997
-0.000436610832272
0.000211094364892
-0.000427488458411
0.000213334981753
-0.000416688078282
0.00021387981695
-0.000403916500884
0.000212362058315
-0.00038881224165
0.00020839128616
-0.000370997202704
0.000201605982761
-0.000350152219413
0.000191745127373
-0.000326102564038
0.000178724118838
-0.000298887348105
0.000162687998219
-0.000268792478173
0.000144035160645
-0.000236371798197
0.000123462677596
-0.000202499087474
0.000102091668164
-0.000168357849875
8.14163402264e-05
-0.000134949997983
6.19964048073e-05
-0.00010172484688
4.29955181404e-05
-6.83173949183e-05
1.17846752374e-05
-2.37007982698e-05
-2.38358401882e-06
-2.37258302871e-06
-1.14453189663e-06
-1.14488666929e-06
-4.65217199363e-07
-1.31295892947e-06
-1.38999318814e-06
1.72301558855e-08
1.49217973854e-06
1.08468454887e-09
1.76423486183e-06
-5.27158652607e-08
1.8729693407e-06
-1.12782128336e-07
1.92095368162e-06
-1.81383762103e-07
1.95139259207e-06
-2.77137709844e-07
1.93527726767e-06
-4.33051607369e-07
1.92505605172e-06
-4.9721421909e-07
1.81392124323e-06
-5.02720412247e-07
1.89652787174e-06
-5.21853776657e-07
2.07526152958e-06
-5.60976617131e-07
2.28582870504e-06
-6.50427394704e-07
2.57126606689e-06
-8.33232204748e-07
3.0098932389e-06
-1.22618069691e-06
3.64806134961e-06
-1.81353812937e-06
4.11212542951e-06
-2.77295464154e-06
4.74463640612e-06
-3.87056301923e-06
4.82726581382e-06
-4.62329317207e-06
4.22142653267e-06
-5.13909087477e-06
3.57967931728e-06
-5.62444499232e-06
3.13990444384e-06
-5.9919992842e-06
2.49463807916e-06
-6.17407446018e-06
1.86217647935e-06
-6.23779390935e-06
1.26585959752e-06
-6.32196408157e-06
7.96018438321e-07
-6.40577909953e-06
3.57374386562e-07
-6.47895866333e-06
-3.09947756058e-08
-6.55222437879e-06
-4.22315868541e-07
-6.61375705607e-06
-8.35235162398e-07
-6.72331423584e-06
-1.20387842516e-06
-6.91696033635e-06
-1.5234798184e-06
-7.10592518931e-06
-1.90104570283e-06
-7.25600374515e-06
-2.35087430345e-06
-7.41658602639e-06
-2.83121840455e-06
-7.58624645163e-06
-3.36918528632e-06
-7.74833240378e-06
-3.9761428374e-06
-7.8995353929e-06
-4.66044055552e-06
-7.86489797488e-06
-5.73831053977e-06
-7.35516386755e-06
-7.18270054984e-06
-6.9933226496e-05
5.75178792006e-05
-2.00838896508e-05
1.37213947067e-05
7.47945954791e-06
-0.000198509298293
2.80771663815e-05
-0.000676537774437
3.0388924667e-05
-0.000543137580482
3.57915785248e-05
-0.000326519331932
4.95455267936e-05
-0.000321417325691
6.32497604635e-05
-0.00033406992404
7.80705885692e-05
-0.000363278548806
9.24446902451e-05
-0.000392317532451
0.000106195196748
-0.000417121981639
0.000119050589426
-0.000436968940016
0.000130907506572
-0.000451377872526
0.000141797886536
-0.000461034793096
0.00015177015396
-0.000466666646919
0.000160898637755
-0.00046901808367
0.000169241812559
-0.000468753542296
0.000176831428736
-0.000466374182556
0.000183661365363
-0.000462235643556
0.000189680193726
-0.000456541291739
0.000194785571994
-0.000449361375689
0.000198818830393
-0.000440644718648
0.000201560717117
-0.000430230947138
0.000202729354149
-0.000417857290663
0.000201986579599
-0.000403174276845
0.000198962169768
-0.00038578835887
0.000193300790556
-0.000365336338228
0.000184729025513
-0.000341580972513
0.000173138108763
-0.000314512191576
0.000158672390674
-0.000284422268106
0.000141786401454
-0.000251907094322
0.000123232734902
-0.000217818661541
0.000104009013893
-0.000183275596886
8.52868622183e-05
-0.000149635991446
6.85826915843e-05
-0.00011824602119
5.37330687271e-05
-8.68775440337e-05
1.85338248749e-05
-3.31200475205e-05
-1.81223597384e-06
-3.35528811781e-06
-1.86855160225e-06
-2.31673046758e-06
-1.08777766528e-06
-1.92620751082e-06
-5.02801003551e-07
-1.8979847634e-06
-1.89313528341e-06
-7.36752096642e-09
1.49976692912e-06
2.73858538212e-09
1.75429326934e-06
-3.93854211417e-08
1.91528813998e-06
-8.11308720136e-08
1.96292155058e-06
-1.22522129204e-07
1.99302443438e-06
-2.08486256899e-07
2.02149308931e-06
-3.12803273724e-07
2.02961590008e-06
-4.61833935193e-07
1.96320179374e-06
-4.81055979647e-07
1.91597188012e-06
-4.53846358902e-07
2.04823614948e-06
-4.08457071392e-07
2.24057091707e-06
-3.60070062323e-07
2.52291012423e-06
-4.46203151938e-07
3.09622940209e-06
-5.97620998954e-07
3.7998459922e-06
-1.57160943011e-06
5.08670420785e-06
-3.2549938368e-06
6.42867452932e-06
-4.695010621e-06
6.26794740482e-06
-5.49925140224e-06
5.02602516192e-06
-6.22750768693e-06
4.30809612772e-06
-6.5716422191e-06
3.48409506963e-06
-6.70329647493e-06
2.62626319925e-06
-6.77796891143e-06
1.93676429759e-06
-6.80027286816e-06
1.2880276555e-06
-6.79553909707e-06
7.91103219554e-07
-6.84014027365e-06
4.01744421187e-07
-6.89409305753e-06
2.26813837798e-08
-6.94496638685e-06
-3.71763608192e-07
-7.07091226971e-06
-7.09646070338e-07
-7.27989053135e-06
-9.95298779388e-07
-7.4682311982e-06
-1.33554793579e-06
-7.63865276391e-06
-1.73103849194e-06
-7.86676332625e-06
-2.12315073254e-06
-8.14118276386e-06
-2.5571639263e-06
-8.45954770262e-06
-3.05112797486e-06
-8.78433852633e-06
-3.6516449203e-06
-9.02544444158e-06
-4.41984548363e-06
-8.87061376881e-06
-5.89371539958e-06
-7.37891672948e-06
-8.67765920377e-06
-5.87727240821e-05
0.000108899796247
-9.22763216415e-06
-3.5835864396e-05
8.8644507135e-06
-0.000216608393979
3.67641534654e-05
-0.000704440673082
3.05875100805e-05
-0.000536963380902
3.44907253571e-05
-0.00033042459626
4.76629722149e-05
-0.000334591348436
6.10233154401e-05
-0.000347431843363
7.55439399139e-05
-0.000377800593699
8.95043085102e-05
-0.000406279197916
0.000102813735038
-0.000430432599793
0.000115200754646
-0.00044935706283
0.000126606746084
-0.000462784889698
0.000137066613439
-0.000471495621017
0.000146629099664
-0.000476230036577
0.000155360103815
-0.000477749943047
0.000163303392527
-0.000476697642982
0.00017047226447
-0.000473543828991
0.00017683812858
-0.000468602247226
0.000182323527596
-0.000462027398993
0.000186796540059
-0.000453835065955
0.000190066323688
-0.000443915151379
0.000191881685358
-0.000432046928914
0.00019193449703
-0.000417910695419
0.000189876310029
-0.000401116657226
0.000185359041988
-0.000381271640814
0.000178101688754
-0.00035807953065
0.000167971311644
-0.000331451157952
0.000155066700662
-0.000301608221032
0.000139799407637
-0.000269155623346
0.000122901474181
-0.000235009786486
0.000105201937943
-0.000200119557289
8.72555547332e-05
-0.00016532932089
6.89017958767e-05
-0.000131282657911
4.80684349778e-05
-9.74145469738e-05
2.76410609182e-05
-6.64528290046e-05
-8.2136140174e-07
-4.65812951263e-06
-1.46809215139e-06
-2.70906420301e-06
-1.29398718085e-06
-2.49124105791e-06
-8.57193959484e-07
-2.36319954062e-06
-4.14563490038e-07
-2.34129516676e-06
-2.30771828112e-06
-1.42804514408e-09
1.50115376821e-06
-4.04846552366e-09
1.75699944432e-06
-4.37979966615e-08
1.95518918697e-06
-8.32012760033e-08
2.00247937634e-06
-8.68476332013e-08
1.99680754445e-06
-1.12143772941e-07
2.04692771544e-06
-1.97650296253e-07
2.11531949392e-06
-3.43801071751e-07
2.10965522846e-06
-4.98662322578e-07
2.07114180436e-06
-4.47762819577e-07
1.99758765508e-06
-2.95374225278e-07
2.08817998641e-06
-2.88693404394e-08
2.25635314696e-06
1.05047970882e-07
2.96242014766e-06
1.28377594659e-07
3.77695983598e-06
-6.65091496201e-07
5.88091657696e-06
-4.60227438902e-06
1.03669457378e-05
-5.52897558284e-06
7.19513788969e-06
-6.7372890737e-06
6.23462034729e-06
-7.30650515418e-06
4.87736729149e-06
-7.58297005095e-06
3.76050616708e-06
-7.59882792159e-06
2.64201866787e-06
-7.40688777835e-06
1.74468196906e-06
-7.29371628346e-06
1.17467522098e-06
-7.25152365017e-06
7.48685439676e-07
-7.24425651546e-06
3.94206612989e-07
-7.27774455659e-06
5.58527147779e-08
-7.38671698097e-06
-2.63149872049e-07
-7.55276692327e-06
-5.44004930164e-07
-7.70747043082e-06
-8.41030843967e-07
-7.86635549016e-06
-1.17712068081e-06
-8.10876332683e-06
-1.4890828244e-06
-8.4220621665e-06
-1.81031957411e-06
-8.84188608944e-06
-2.13777753094e-06
-9.3905998406e-06
-2.50289964647e-06
-1.00901549193e-05
-2.95268833672e-06
-1.08670012504e-05
-3.64345215151e-06
-1.14603863944e-05
-5.30103919821e-06
-1.1642461806e-05
-8.49924320864e-06
-8.14170288409e-05
0.000178663107597
-3.39554375141e-05
-8.33156964889e-05
6.89865326878e-06
-0.000257468989881
3.95087279534e-05
-0.0007370540686
2.94868257064e-05
-0.000526944005395
3.41384628523e-05
-0.000335078355468
4.65844765599e-05
-0.000347039218621
5.92705099045e-05
-0.000360119533497
7.32517561655e-05
-0.000391783339555
8.66660884437e-05
-0.000419694896217
9.9468300971e-05
-0.000443236065811
0.000111361449205
-0.000461251365853
0.000122310598159
-0.000473735110495
0.000132342836655
-0.000481528859325
0.000141501930451
-0.000485390070127
0.000149841017108
-0.00048608991669
0.00015738666575
-0.000484244133599
0.000164131677521
-0.000480289641672
0.00017002336115
-0.000474494695343
0.000174957061733
-0.000466961829447
0.000178771086106
-0.000457649788113
0.000181244461878
-0.000446389193396
0.000182100468599
-0.000432903572398
0.00018101863882
-0.000416829474666
0.000177665348222
-0.000397763953659
0.000171753402443
-0.000375360272113
0.000163126567166
-0.000349453281212
0.000151839222591
-0.000320164452894
0.000138192548951
-0.000287962246222
0.000122746209608
-0.000253709988836
0.000106330449674
-0.000218594594578
8.97576922193e-05
-0.00018354678475
7.32003274279e-05
-0.000148772413774
5.72730698504e-05
-0.000115356523774
4.31627362062e-05
-8.33080970456e-05
2.97363223487e-06
-2.62670365138e-05
-3.19669625723e-07
-1.36524275849e-06
-8.26903869837e-07
-2.20223758119e-06
-8.36059232339e-07
-2.48247644727e-06
-6.08194196399e-07
-2.59157135742e-06
-3.09945045345e-07
-2.63956960962e-06
-2.61799570892e-06
4.47844506862e-08
1.4564316804e-06
-5.43852291078e-09
1.807269911e-06
-8.76685572513e-08
2.03745624937e-06
-1.38486824896e-07
2.05336530882e-06
-1.04134311449e-07
1.96250148599e-06
-1.50498826242e-08
1.95791860957e-06
-3.78131664061e-08
2.13824957077e-06
-2.97281610982e-07
2.36949326831e-06
-4.6721125462e-07
2.24153967232e-06
-5.47772466122e-07
2.07841221973e-06
-3.21560013989e-07
1.86212677628e-06
2.33889115493e-07
1.70074979773e-06
5.16479846933e-07
2.68006511411e-06
2.66765002313e-07
4.02714211797e-06
-3.83544684219e-06
9.98439308012e-06
-5.85403326568e-06
1.2386597169e-05
-8.32246258838e-06
9.664227454e-06
-9.23300995147e-06
7.14520477007e-06
-9.38099930621e-06
5.02523791428e-06
-9.02757211895e-06
3.40693196268e-06
-8.34063021094e-06
1.95490240846e-06
-7.97592883811e-06
1.37978759176e-06
-7.76926482285e-06
9.67784827758e-07
-7.66736974469e-06
6.46526029108e-07
-7.62115689718e-06
3.47687304607e-07
-7.62199933813e-06
5.63490062389e-08
-7.70299051711e-06
-1.82553272242e-07
-7.81598295893e-06
-4.31445788588e-07
-7.94845915212e-06
-7.09025805578e-07
-8.1724568114e-06
-9.53609261508e-07
-8.48796943029e-06
-1.17409288288e-06
-8.93196815855e-06
-1.36686407945e-06
-9.5340187484e-06
-1.53633804591e-06
-1.03767489452e-05
-1.66083147398e-06
-1.15622907596e-05
-1.76780431205e-06
-1.32605434805e-05
-1.94623413594e-06
-1.58695403198e-05
-2.69320680517e-06
-2.86495673122e-05
4.27787544939e-06
-0.000116662604406
0.000266656200312
-9.54271300459e-05
-0.000104575170803
7.54342221619e-06
-0.000360446416625
4.2401641593e-05
-0.000771915733116
2.7022833495e-05
-0.000511567829129
3.34641132176e-05
-0.000341521862615
4.5442743112e-05
-0.000359019802764
5.76138625293e-05
-0.000372292398664
7.1038187665e-05
-0.00040520923874
8.38640092172e-05
-0.000432522147556
9.61319688533e-05
-0.000455505329973
0.00010752439489
-0.00047264499081
0.000118021330451
-0.000484233154266
0.000127635799382
-0.000491144361406
0.00013640247683
-0.000494157716238
0.000144358350401
-0.00049404670481
0.000151510926029
-0.000491397575554
0.00015783102873
-0.000486610568488
0.000163240982033
-0.000479905433383
0.000167608892658
-0.000471330488837
0.000170744941903
-0.000460786551448
0.000172402775963
-0.000448047709162
0.000172289848605
-0.000432791296091
0.000170089728386
-0.000414629979516
0.00016550667812
-0.000393181512158
0.000158339045324
-0.000368193248935
0.000148574199527
-0.000339689076278
0.000136475139958
-0.000308066102889
0.000122602989395
-0.000274090847435
0.000107818105212
-0.000238925794552
9.35715709936e-05
-0.000204348268653
8.21072483253e-05
-0.000172082994446
7.38852469017e-05
-0.000140550974784
6.51510674278e-05
-0.000106625909453
2.0633360327e-05
-3.87931920983e-05
-2.3199812482e-06
-3.31407640473e-06
-1.3286992558e-06
-2.35691247345e-06
-9.44697752384e-07
-2.58662531064e-06
-6.99769178949e-07
-2.72773704957e-06
-4.69812788562e-07
-2.82170346216e-06
-2.43600435824e-07
-2.86643105195e-06
-2.86161339779e-06
1.08366659271e-07
1.34795567281e-06
2.4415529715e-08
1.891102486e-06
-2.14061081252e-07
2.27592686314e-06
-2.95513355461e-07
2.13477206999e-06
-2.27778973884e-07
1.89470770875e-06
-1.66584654731e-08
1.7466598211e-06
2.61061046465e-07
1.86066435625e-06
-2.88634384065e-07
2.91962745015e-06
-5.07162673248e-07
2.46041932924e-06
-6.44133272473e-07
2.21582293791e-06
-6.19343266965e-07
1.83723682032e-06
1.68572211156e-07
9.13091145462e-07
-9.51896547183e-07
3.80125740235e-06
-5.75887114951e-06
8.8354184904e-06
-1.13998864593e-05
1.5626954984e-05
-1.46856694751e-05
1.56734198929e-05
-1.50440794094e-05
1.002267558e-05
-1.23830536805e-05
4.4839448878e-06
-1.17698735258e-05
4.41185552089e-06
-9.77824594636e-06
1.41507855439e-06
-8.94698887495e-06
1.12341421263e-06
-8.39109901154e-06
8.23653874581e-07
-8.10883282646e-06
6.85251064686e-07
-7.92900894882e-06
4.66402076379e-07
-7.81430789525e-06
2.32651257543e-07
-7.80729847442e-06
4.89623480482e-08
-7.85165032217e-06
-1.38617469117e-07
-7.94445411085e-06
-3.39105926824e-07
-8.13010808755e-06
-5.2386874376e-07
-8.40152221877e-06
-6.82737962992e-07
-8.76994864066e-06
-8.06252231801e-07
-9.25583777535e-06
-8.8166132714e-07
-9.95290121843e-06
-8.40057813186e-07
-1.09606064325e-05
-6.54045952455e-07
-1.24229454265e-05
-3.06776081893e-07
-1.46661085166e-05
2.95658255385e-07
-1.84861997031e-05
1.12605714578e-06
-3.64028923117e-05
2.21848859314e-05
-4.60330194801e-05
0.000276268354588
-0.000175741563942
2.51106227175e-05
1.59098811071e-05
-0.000552103184461
3.99864183258e-05
-0.000795995766773
2.35110177413e-05
-0.000495095201385
3.26747399268e-05
-0.000350687931657
4.4041376734e-05
-0.000370388486045
5.58273884488e-05
-0.000384080226772
6.87329751981e-05
-0.000418116454599
8.09978039869e-05
-0.00044478844827
9.27523714373e-05
-0.00046726123724
0.000103665411248
-0.000483559258408
0.000113731503006
-0.000494300381188
0.000122948451397
-0.00050036236673
0.000131340246886
-0.000502550503757
0.000138926037378
-0.000501633430763
0.000145693353621
-0.000498165778425
0.000151590256178
-0.000492508312886
0.00015651378954
-0.000484829768132
0.000160305385751
-0.000475122847942
0.000162749422567
-0.000463231315709
0.000163579737588
-0.000448878718054
0.000162499069824
-0.00043171129306
0.000159215752676
-0.00041134730421
0.000153510112374
-0.000387476505375
0.000145333828052
-0.000360017612188
0.000134934856185
-0.000329290810076
0.000122995431745
-0.00029612745691
0.000110685597551
-0.000261781781405
9.93841591158e-05
-0.000227624921247
9.02812104502e-05
-0.000195246026176
8.50951926604e-05
-0.000166897642617
8.26946116338e-05
-0.00013815332267
3.20795639563e-05
-5.60133006294e-05
-1.80185119364e-06
-4.91232161847e-06
-1.78427928354e-06
-3.33207121947e-06
-1.17165440533e-06
-2.9699066173e-06
-8.1544241967e-07
-2.94316205337e-06
-5.65508870462e-07
-2.97801370024e-06
-3.6681695003e-07
-3.02086913821e-06
-1.89497914439e-07
-3.04377275393e-06
-3.05143311856e-06
1.82594893309e-07
1.16524223494e-06
1.25705829271e-07
1.94793803908e-06
-5.10166032093e-07
2.91174053153e-06
-6.51653878691e-07
2.27618559184e-06
-5.27491511476e-07
1.7703248747e-06
-2.12777794473e-07
1.43177154125e-06
3.43735665386e-07
1.3041594246e-06
5.21570631526e-07
2.7416256305e-06
-7.78852051616e-07
3.76094891594e-06
-8.74697551158e-07
2.31166454591e-06
-1.90919495895e-06
2.87221439635e-06
-3.3667899727e-06
2.37115401845e-06
-9.92924155112e-06
1.03657207547e-05
-1.67646794218e-05
1.56722940517e-05
-1.96376954872e-05
1.85005027514e-05
-2.09842088859e-05
1.70199723273e-05
-2.01920567714e-05
9.22999790976e-06
-1.79721329004e-05
2.26356141105e-06
-1.17497364699e-05
-1.81081625374e-06
-1.01049942063e-05
-2.29936345564e-07
-9.04131739069e-06
5.94737529641e-08
-8.53111820385e-06
3.13184255157e-07
-8.17159771048e-06
3.25442128142e-07
-7.95159138493e-06
2.46081468349e-07
-7.86571070781e-06
1.46418427368e-07
-7.83966018666e-06
2.25243944218e-08
-7.88752105844e-06
-9.11910494034e-08
-8.02020862897e-06
-2.06890798226e-07
-8.22011075187e-06
-3.24489988085e-07
-8.49435925587e-06
-4.09062976114e-07
-8.86029997741e-06
-4.40980091487e-07
-9.3680627572e-06
-3.74696235055e-07
-1.00406509894e-05
-1.68493203782e-07
-1.09538626648e-05
2.57794817795e-07
-1.23527132733e-05
1.09062451652e-06
-1.49399728055e-05
2.88149012881e-06
-2.09214200282e-05
7.10239005354e-06
-1.96410695927e-05
2.08992747062e-05
4.30038122798e-05
0.00021360165791
6.63172731978e-05
1.7948441938e-06
6.43926989992e-05
-0.000550186695651
4.18520428958e-05
-0.000773459115384
2.27757586251e-05
-0.000476021891805
3.24587196329e-05
-0.000360373339021
4.25048555294e-05
-0.000380436726159
5.38775648558e-05
-0.000395454783154
6.62493644674e-05
-0.000430489900985
7.79950343239e-05
-0.000456535600909
8.92821534354e-05
-0.000478549704305
9.97589725678e-05
-0.000494037314123
0.00010943140912
-0.000503973962238
0.000118281743157
-0.000509213769276
0.000126323253512
-0.000510593018012
0.000133557103177
-0.000508868229056
0.000139951051808
-0.000504560625907
0.000145430643033
-0.00049798875815
0.000149868625174
-0.000489268562173
0.000153082321069
-0.000478337317114
0.000154836181315
-0.000464985913157
0.000154856226007
-0.000448899467622
0.000152862590834
-0.000429718334054
0.000148625410589
-0.000407110782904
0.000142056203768
-0.000380907958252
0.000133322511471
-0.000351284614876
0.000122942975911
-0.000318912037451
0.000111827498945
-0.000285012793884
0.000101191531097
-0.000251146575986
9.18313763683e-05
-0.000218265508413
8.19267496311e-05
-0.000185342392061
6.54894230609e-05
-0.000150462534522
4.7137572644e-05
-0.000119805220223
-2.05751968276e-07
-8.67056905228e-06
-1.22485455048e-06
-3.89370272632e-06
-1.11409547278e-06
-3.44323478705e-06
-8.45384810898e-07
-3.23896793808e-06
-6.05889731489e-07
-3.18300385048e-06
-4.20292654438e-07
-3.16391045623e-06
-2.74436638486e-07
-3.1668932217e-06
-1.30453242407e-07
-3.18837714021e-06
-3.1819124183e-06
4.06784822021e-07
7.584383149e-07
2.155972167e-07
2.13917271335e-06
-1.4300785526e-06
4.55751197209e-06
-1.34839014153e-06
2.19440333691e-06
-1.04049366789e-06
1.46217952731e-06
-6.78586899523e-07
1.06958700817e-06
-2.21868598012e-07
8.47027568847e-07
9.36853591002e-07
1.5825386821e-06
-7.29664148736e-07
5.42706968034e-06
-1.53061922668e-06
3.11305325052e-06
-1.71554999712e-06
3.05681786609e-06
-6.54714405852e-06
7.20313344438e-06
-1.57450396672e-05
1.95638893825e-05
-2.06854632307e-05
2.06129044955e-05
-2.20054797945e-05
1.98204262109e-05
-2.03755373978e-05
1.53891915681e-05
-1.54189739357e-05
4.27276007338e-06
-1.02274591923e-05
-2.92825273896e-06
-9.97122740268e-06
-2.06731683726e-06
-9.08785636171e-06
-1.11355189151e-06
-8.59914828991e-06
-4.2948645799e-07
-8.19036905299e-06
-9.58567701728e-08
-7.95244177993e-06
8.72321345249e-08
-7.81407200637e-06
1.07397513041e-07
-7.75651646754e-06
8.85152880971e-08
-7.79331586571e-06
5.89337483679e-08
-7.88029650761e-06
-4.63836378022e-09
-8.01570184826e-06
-7.19619393696e-08
-8.22024716342e-06
-1.20473232879e-07
-8.48912122869e-06
-1.40787986709e-07
-8.81975180216e-06
-1.11068859903e-07
-9.19860854256e-06
3.22857983855e-09
-9.64058418229e-06
2.72192110724e-07
-1.01398854519e-05
7.55650447607e-07
-1.08018960905e-05
1.75063426666e-06
-1.14571103585e-05
3.53398254597e-06
-1.06879352474e-05
6.33230431192e-06
-8.09065152064e-07
1.10078574153e-05
4.1707468776e-05
0.000171072273703
4.29867655805e-05
5.11397790822e-07
6.51618134328e-05
-0.000572367537105
4.12713277547e-05
-0.000749572579832
2.40546895112e-05
-0.000458808288447
3.24196479245e-05
-0.000368740791231
4.07992717588e-05
-0.000388818460478
5.17184367352e-05
-0.000406375782766
6.35287298529e-05
-0.0004423018156
7.48108206214e-05
-0.000467819149389
8.56909918784e-05
-0.000489431201413
9.57890334031e-05
-0.000504136576802
0.000105116379582
-0.000513302443872
0.00011363923755
-0.000517737692036
0.000121360869626
-0.000518315654713
0.000128265314148
-0.000515773625033
0.000134301571586
-0.00051059778677
0.00013937363484
-0.000503061679952
0.000143331536563
-0.000493227280893
0.000145971433867
-0.000480977992896
0.000147043350026
-0.000466058572705
0.000146274938664
-0.000448131767181
0.000143417773066
-0.000426861854533
0.000138320022574
-0.000402013706506
0.000131034401465
-0.000373623023085
0.000121937480948
-0.000342188434476
0.000111796702503
-0.00030877207777
0.000101736684854
-0.000274953596009
9.32260033183e-05
-0.000242636641376
8.79426186461e-05
-0.00021298306436
8.50624948175e-05
-0.000182463530086
8.04330039034e-05
-0.00014583748266
7.72603552809e-06
-4.71025163547e-05
6.41451538709e-07
-1.58645076057e-06
-3.67051807997e-07
-2.88563882272e-06
-5.96946402137e-07
-3.21371979294e-06
-5.40747369316e-07
-3.29550795232e-06
-4.10843553346e-07
-3.31320791107e-06
-2.83907800009e-07
-3.29117177582e-06
-1.98724965917e-07
-3.25251753111e-06
-8.63603437751e-08
-3.30077367083e-06
-3.26855940032e-06
4.8316549177e-07
2.75332207698e-07
-2.10531054109e-06
4.72779659184e-06
-3.11350881883e-06
5.56566831239e-06
-2.15672467069e-06
1.23742087652e-06
-1.53009139352e-06
8.35236718043e-07
-1.09547371795e-06
6.34610852947e-07
-7.33954318052e-07
4.85272995432e-07
3.21332966173e-07
5.2689026047e-07
1.88688170616e-06
3.86119057189e-06
-2.23111420895e-06
7.23090540784e-06
-1.03615278511e-05
1.11874469211e-05
-2.26428057699e-05
1.94839916904e-05
-2.68939924105e-05
2.38147141256e-05
-2.42257008597e-05
1.79441724648e-05
-2.09949794379e-05
1.65891412488e-05
-1.36699336192e-05
8.06350881528e-06
-7.59586252516e-06
-1.80160986661e-06
-8.04312941263e-06
-2.48123388332e-06
-8.33068418219e-06
-1.7799712158e-06
-8.23032722933e-06
-1.21412651764e-06
-8.00597756549e-06
-6.5405961636e-07
-7.84809561795e-06
-2.53985138374e-07
-7.69130977782e-06
-6.9821050269e-08
-7.62538326671e-06
4.11760773202e-08
-7.63597720471e-06
9.87750034125e-08
-7.67916348154e-06
1.01751368459e-07
-7.78190518329e-06
9.76911270258e-08
-7.93818223993e-06
8.38590071924e-08
-8.13082342517e-06
7.16581696373e-08
-8.35576476518e-06
8.35493586984e-08
-8.59472850208e-06
1.27137463545e-07
-8.8241772405e-06
2.31617491036e-07
-8.95939951804e-06
4.06151033585e-07
-9.03187092754e-06
8.26306445344e-07
-8.94663351971e-06
1.66325373134e-06
-8.38716582313e-06
2.972752488e-06
-6.91747045801e-06
4.85814913113e-06
-3.24254619346e-06
7.32826519887e-06
3.73687259738e-05
0.000130431048679
3.95046577478e-05
-1.62674054338e-06
5.43290704877e-05
-0.000587202188512
3.45540627815e-05
-0.000729802471205
2.26397863622e-05
-0.000446897300157
3.07577636811e-05
-0.000376861287173
3.83893605561e-05
-0.000396452113364
4.91168832921e-05
-0.000417105064403
6.04707744893e-05
-0.000453657256798
7.14031661268e-05
-0.000478752935597
8.19612500638e-05
-0.000499990561912
9.17516529911e-05
-0.000513928162494
0.000100790566204
-0.000522342465226
0.000109030288517
-0.000525978459842
0.000116466164723
-0.000525752522471
0.000123066971983
-0.000522375374938
0.000128764781024
-0.000516296493
0.000133443959442
-0.000507741712632
0.000136934829532
-0.000496718965382
0.000139017843542
-0.000483061785036
0.000139438949738
-0.000466480423825
0.000137946842855
-0.000446640375014
0.000134360053768
-0.000423275757348
0.000128667979507
-0.000396322319141
0.00012117266325
-0.000366128420951
0.00011264471664
-0.000333661263725
0.000104435853132
-0.000300564044424
9.83846720024e-05
-0.000268903226701
9.62382501995e-05
-0.000240491005395
9.9669993051e-05
-0.000216415686368
0.000107305392321
-0.000190101780672
3.83706304256e-05
-7.69052280988e-05
-2.89859556673e-06
-5.83366909381e-06
-1.18062010303e-06
-3.30483193522e-06
-7.14272516986e-07
-3.35236593415e-06
-5.39017592521e-07
-3.38931932123e-06
-4.19013446464e-07
-3.41583172872e-06
-3.14000465904e-07
-3.4185477114e-06
-2.09131256015e-07
-3.39631342351e-06
-1.45542150999e-07
-3.31625384204e-06
-7.75335027855e-08
-3.36933052382e-06
-3.34610832808e-06
2.21948179036e-07
5.33971802536e-08
-2.68774687165e-06
7.63750562486e-06
-2.71153388888e-06
5.58935524517e-06
-2.19934966706e-06
7.24965269759e-07
-1.61274939413e-06
2.48366409032e-07
-1.23425839442e-06
2.55882728808e-07
-9.4048677927e-07
1.91313442028e-07
-5.17485810769e-07
1.03666878608e-07
-3.46961331276e-07
3.69022850706e-06
-8.92743391721e-06
1.58112712461e-05
-1.91523039727e-05
2.14119237751e-05
-2.40373102205e-05
2.43684200572e-05
-2.52671725753e-05
2.50439448846e-05
-2.22659216697e-05
1.49429636555e-05
-1.29645640021e-05
7.2871803242e-06
-5.55104971284e-06
6.49735395175e-07
-5.97281859751e-06
-1.38005633427e-06
-6.8352656786e-06
-1.6189655427e-06
-7.19168717196e-06
-1.42371465624e-06
-7.37238341583e-06
-1.03359406367e-06
-7.40996282947e-06
-6.16668783576e-07
-7.33628402204e-06
-3.27866634685e-07
-7.31957765771e-06
-8.67540389685e-08
-7.34596648387e-06
6.73050967467e-08
-7.40638959127e-06
1.58906652173e-07
-7.5213230664e-06
2.16355255547e-07
-7.65479350992e-06
2.30793941578e-07
-7.81080781447e-06
2.39463473593e-07
-8.00043829298e-06
2.60817802448e-07
-8.18801308611e-06
2.70540959442e-07
-8.31576853574e-06
2.54119625363e-07
-8.33238817787e-06
2.47198427255e-07
-8.27769801605e-06
3.50038134332e-07
-8.0698830941e-06
6.16777810338e-07
-7.51468184621e-06
1.10573991527e-06
-6.53113745112e-06
1.98525228097e-06
-4.98468131793e-06
3.31058189796e-06
-2.75485799076e-06
5.0845618299e-06
3.6344486547e-05
9.13160577008e-05
3.75576494517e-05
-2.84529848365e-06
4.46835881843e-05
-0.000594333995768
2.68704700171e-05
-0.000711994007207
1.89425914954e-05
-0.000438972852384
2.71837323516e-05
-0.00038510497428
3.49577901835e-05
-0.000404228191652
4.58495666243e-05
-0.000427998524412
5.69839020836e-05
-0.000464793060368
6.77431419131e-05
-0.000489513494703
7.80909001438e-05
-0.000510339531155
8.76569846419e-05
-0.000523495377447
9.64687786211e-05
-0.000531155325065
0.000104471551924
-0.00053398224625
0.000111656881758
-0.00053293881805
0.000117981208008
-0.00052870062366
0.000123362070218
-0.000521678235807
0.000127666524134
-0.000512047008006
0.0001307083996
-0.000499761646145
0.000132257731561
-0.000484611889583
0.00013206543967
-0.000466288872004
0.000129916265774
-0.000444491912405
0.000125717946975
-0.000419078130779
0.000119625210647
-0.000390230276635
0.000112185286012
-0.000358689233038
0.00010443157518
-0.000325908365969
9.78230229868e-05
-0.000293956353853
9.38989243784e-05
-0.000264979970961
9.23035940498e-05
-0.000238896624057
8.28221849133e-05
-0.000206936142952
6.48662687879e-05
-0.000172149858412
-6.17483886861e-07
-1.14218672911e-05
-1.44985685042e-06
-5.00163276401e-06
-8.44111744555e-07
-3.91092790904e-06
-5.80599102861e-07
-3.6162186196e-06
-4.3292767352e-07
-3.53731725567e-06
-3.37295707745e-07
-3.51178028461e-06
-2.63724672189e-07
-3.49240189138e-06
-1.8932284779e-07
-3.47101800289e-06
-1.174790669e-07
-3.38849936103e-06
-7.97345034446e-08
-3.40709530144e-06
-3.42610349326e-06
-5.78405726829e-07
6.31763428964e-07
-2.27113277987e-06
9.33008282587e-06
-1.95760647496e-06
5.27476089081e-06
-1.59550629428e-06
3.62678440747e-07
-1.39356098312e-06
4.62242043402e-08
-1.21450666482e-06
7.66579568697e-08
-1.09910881571e-06
7.57852637573e-08
-1.0741720824e-06
7.85016685682e-08
-1.05204205503e-07
2.72119959674e-06
-4.66355409974e-06
2.03693794554e-05
-1.07581601775e-05
2.75061915629e-05
-1.49758389189e-05
2.85856474413e-05
-1.82227805831e-05
2.82907048012e-05
-1.3810250043e-05
1.05298983972e-05
-7.72381435141e-06
1.20016088145e-06
-5.20810728986e-06
-1.86613496246e-06
-5.28867011602e-06
-1.29965527026e-06
-5.73906533008e-06
-1.16872197849e-06
-6.25381946103e-06
-9.09083056733e-07
-6.64264624681e-06
-6.44905254751e-07
-6.80003623637e-06
-4.59420397205e-07
-6.8895366401e-06
-2.38531017773e-07
-6.98191454332e-06
5.43753958803e-09
-7.09491358267e-06
1.80094514901e-07
-7.22423688312e-06
2.87989016282e-07
-7.34825217135e-06
3.40097014297e-07
-7.50143655823e-06
3.83673807596e-07
-7.67567831832e-06
4.13364681552e-07
-7.83740991893e-06
4.22135030858e-07
-7.93056587408e-06
3.6317035554e-07
-7.92873011974e-06
2.51569461787e-07
-7.87296455108e-06
1.90419977778e-07
-7.71165422154e-06
1.87456405646e-07
-7.32702576565e-06
2.30356252954e-07
-6.60021605189e-06
3.76398502555e-07
-5.2999388818e-06
6.82924979478e-07
-3.22200355539e-06
1.230830224e-06
-2.63927728123e-07
2.1205476016e-06
3.83023592187e-05
5.27094700604e-05
3.64840872612e-05
-1.0285038448e-06
3.55819542928e-05
-0.000593440752042
1.92751344281e-05
-0.000695691040146
1.40539622495e-05
-0.000433754336397
2.23487911504e-05
-0.000393401876398
3.06751841723e-05
-0.000412556302959
4.19385073605e-05
-0.000439263328275
5.30922612297e-05
-0.000475948132238
6.3857634764e-05
-0.000500280069332
7.41101539245e-05
-0.000520593167613
8.35353638683e-05
-0.000532921640571
9.21786623828e-05
-0.000539799627256
9.99877351267e-05
-0.000541792279816
0.000106955686567
-0.000539907692282
0.000113030277869
-0.000534776100389
0.000118117466661
-0.000526766274749
0.00012207015149
-0.000516000509244
0.000124690582431
-0.000502382863371
0.000125747191318
-0.000485669255334
0.000125011888631
-0.000465554299487
0.000122333792256
-0.00044181451885
0.000117756406936
-0.00041450143351
0.000111665082467
-0.000384139652038
0.000104926389411
-0.000351951291691
9.8918975531e-05
-0.000319901778474
9.52075259871e-05
-0.000290245818711
9.45971970152e-05
-0.000264370664257
9.79510521205e-05
-0.000242251801737
0.000106877205304
-0.000215866756027
1.09730179554e-05
-7.62499484211e-05
1.51047683133e-06
-1.9596431919e-06
-4.2244162543e-08
-3.44923950894e-06
-3.43898546503e-07
-3.60960273829e-06
-3.56944062127e-07
-3.60349693843e-06
-3.10504010178e-07
-3.58407420588e-06
-2.59961630341e-07
-3.56263157741e-06
-2.12814751652e-07
-3.53987016018e-06
-1.65903195782e-07
-3.51820279301e-06
-1.02604133468e-07
-3.45194510719e-06
-5.71194312926e-08
-3.45309946777e-06
-3.48325164751e-06
-3.04542776933e-06
3.67720177888e-06
-3.05539602728e-06
9.33868854197e-06
-1.60943770945e-06
3.82804225111e-06
-1.25749583453e-06
1.0593088761e-08
-1.17318213657e-06
-3.82264021999e-08
-1.09863036301e-06
1.96286730096e-09
-1.04621940629e-06
2.32828531973e-08
-1.02305454879e-06
5.5346466676e-08
3.99455630511e-07
1.29845392173e-06
-2.78703389444e-06
2.35557720171e-05
-7.25538751088e-06
3.19741940381e-05
-1.04678969749e-05
3.17976304063e-05
-7.33339851573e-06
2.51557565157e-05
-2.18818181988e-06
5.38466046641e-06
-2.1547463814e-06
1.16649264394e-06
-4.11640095719e-06
9.52984855849e-08
-4.95167352178e-06
-4.64572878273e-07
-5.41517648476e-06
-7.05366067849e-07
-5.74559830739e-06
-5.78783676614e-07
-5.99411809362e-06
-3.96482723144e-07
-6.26681862784e-06
-1.8682427169e-07
-6.50323934644e-06
-2.22331191514e-09
-6.66916031682e-06
1.71231391704e-07
-6.82907643473e-06
3.39866962296e-07
-6.98893628985e-06
4.47679297085e-07
-7.16169344625e-06
5.12664159665e-07
-7.32363478829e-06
5.45398612227e-07
-7.48098557393e-06
5.70470857072e-07
-7.57433383474e-06
5.15166676542e-07
-7.56052663775e-06
3.48965843086e-07
-7.544462031e-06
2.34898495628e-07
-7.49135716729e-06
1.36598211543e-07
-7.27326548574e-06
-3.17481625899e-08
-6.82131343518e-06
-2.22850165352e-07
-6.0012584833e-06
-4.45496592799e-07
-4.56705753968e-06
-7.51560485511e-07
-2.29857515087e-06
-1.03863573193e-06
5.95180842465e-07
-7.91380431521e-07
4.99111381758e-05
3.3766957103e-06
4.11611479992e-05
7.71684901371e-06
2.81097304012e-05
-0.000580389121385
1.12833356606e-05
-0.000678867293943
8.01662379791e-06
-0.000430489593726
1.66582132209e-05
-0.000402045049315
2.58094127921e-05
-0.000421708872177
3.7575681144e-05
-0.000451030840974
4.89397800421e-05
-0.000487313379693
5.98454681526e-05
-0.000511186832747
7.00918636642e-05
-0.000530840579997
7.94416164201e-05
-0.000542272364457
8.7961740102e-05
-0.000548320683748
9.56111657908e-05
-0.00054944260557
0.000102389112231
-0.000546686507091
0.000108238017374
-0.000540625844206
0.000113054912962
-0.000531583979708
0.000116681272607
-0.000519627652552
0.000118911673963
-0.000504614024264
0.000119519033468
-0.000486277352381
0.000118305018883
-0.000464340993042
0.000115193886739
-0.000438704069591
0.000110373970623
-0.000409682186022
0.000104448849132
-0.000378215221766
9.84992526787e-05
-0.000346002450104
9.39475974929e-05
-0.000315351013931
9.21743988908e-05
-0.000288473663239
9.25067660736e-05
-0.000264704257705
8.30342285997e-05
-0.000232781762497
6.39389931799e-05
-0.000196776234043
-2.89544692068e-06
-9.41585275836e-06
-7.88948935302e-07
-4.06647717764e-06
-4.12064458594e-07
-3.8264481766e-06
-3.15351552926e-07
-3.70663789721e-06
-2.65399653265e-07
-3.65376695631e-06
-2.25414795272e-07
-3.62437548406e-06
-1.90083313727e-07
-3.59827793499e-06
-1.56988801794e-07
-3.57325219437e-06
-1.25361693429e-07
-3.55013378396e-06
-8.04400357565e-08
-3.49726435729e-06
-3.26906066286e-08
-3.50089437753e-06
-3.51619062056e-06
-3.05994584831e-06
6.73554805098e-06
-3.26569292062e-06
9.54354985606e-06
-1.25662773795e-06
1.8180738869e-06
-9.96713846197e-07
-2.49382829518e-07
-9.83498072296e-07
-5.15294599838e-08
-9.71673925047e-07
-9.93465316905e-09
-9.3678289483e-07
-1.16530448528e-08
-8.49032354303e-07
-3.25969835556e-08
-2.18198781143e-07
6.67719524546e-07
-2.77829506226e-06
2.61154757627e-05
-6.05671217737e-06
3.52521993696e-05
-7.77367444307e-06
3.35140483888e-05
-6.937139742e-06
2.43191536032e-05
-5.98933278081e-06
4.43469550723e-06
-3.17670677042e-06
-1.64751709968e-06
-4.59802285084e-06
1.51639855925e-06
-4.83759301466e-06
-2.25073296164e-07
-5.21703719766e-06
-3.26010892288e-07
-5.49917404465e-06
-2.9672024607e-07
-5.72992020635e-06
-1.65805640843e-07
-5.93868318494e-06
2.18815504021e-08
-6.16523851628e-06
2.24272584064e-07
-6.38975788821e-06
3.95690425792e-07
-6.58605791805e-06
5.36089677651e-07
-6.77647595461e-06
6.38013775894e-07
-6.94219623819e-06
6.78283031062e-07
-7.10581404735e-06
7.089110656e-07
-7.20847677351e-06
6.72989701367e-07
-7.21770420509e-06
5.24220784178e-07
-7.26928854238e-06
4.00274245518e-07
-7.31258603657e-06
2.77877478114e-07
-7.23592323254e-06
5.93466027517e-08
-7.00665150591e-06
-2.61597124588e-07
-6.51797103828e-06
-7.12455550995e-07
-5.60942601185e-06
-1.35420791081e-06
-4.09097870548e-06
-2.27065943045e-06
-1.53491581203e-06
-3.5962814781e-06
3.11715193042e-06
-5.44533396582e-06
1.34811191987e-05
-6.99030062561e-06
3.61486384399e-05
-1.49482628745e-05
1.3818582635e-05
-0.000558060872837
-2.11488654559e-06
-0.000662935296664
-2.79000084176e-07
-0.000432326602127
1.00605378823e-05
-0.000412385560222
2.05036920885e-05
-0.000432152973142
3.29895870127e-05
-0.000463517669805
4.47287804703e-05
-0.000499053490655
5.58551402383e-05
-0.000522314086028
6.61429298091e-05
-0.000541129239644
7.54506176292e-05
-0.000551580899438
8.38702284259e-05
-0.000556741121887
9.13790864415e-05
-0.000556952270427
9.79852661461e-05
-0.00055329347459
0.000103628220696
-0.000546269566028
0.000108198230182
-0.000536154738913
0.000111528464473
-0.00052295861985
0.000113411823691
-0.000506498102288
0.000113637888367
-0.000486504116273
0.000112061582995
-0.000462765366947
0.000108724735115
-0.000435367877542
0.000104034156949
-0.000404992254637
9.89339437023e-05
-0.000373115678163
9.4911702053e-05
-0.000341980978473
9.35957041761e-05
-0.000314035979028
9.58248940804e-05
-0.000290704174667
0.000103208034725
-0.000272089058633
0.000120382187111
-0.000249960932514
8.05055303851e-06
-8.44493548686e-05
8.58761139893e-07
-2.22433131355e-06
7.12453359485e-08
-3.27926034674e-06
-1.45592657734e-07
-3.60992425834e-06
-1.78868376909e-07
-3.67368007646e-06
-1.661071787e-07
-3.66684529931e-06
-1.44893090339e-07
-3.64590457578e-06
-1.22785480988e-07
-3.62069573692e-06
-1.01813535016e-07
-3.59454434016e-06
-8.47177833847e-08
-3.56750384548e-06
-5.06381230107e-08
-3.53150311313e-06
-1.43544317723e-08
-3.53767368867e-06
-3.53058515285e-06
-6.20814234534e-07
7.35664176362e-06
-1.00117090438e-06
9.92355072664e-06
-3.13024238045e-07
1.13004776216e-06
-7.95693755146e-07
2.33249519645e-07
-9.24969939977e-07
7.77116087598e-08
-9.30940115641e-07
-4.03291284674e-09
-8.86954011764e-07
-5.57614438169e-08
-8.09178636091e-07
-1.10260778707e-07
-4.58671465546e-07
3.16926157525e-07
-2.76617768913e-06
2.84229063507e-05
-5.23641230753e-06
3.77220123435e-05
-6.7894262666e-06
3.50666267645e-05
-6.58907251297e-06
2.41176126194e-05
-5.64927180184e-06
3.49325674685e-06
-8.24880415451e-06
9.49361324178e-07
-5.07037092805e-06
-1.66189730578e-06
-4.76313582769e-06
-5.32285805776e-07
-4.8840500773e-06
-2.05136264561e-07
-5.1045520247e-06
-7.62639876705e-08
-5.36055722097e-06
9.01807330384e-08
-5.62449084294e-06
2.8581405154e-07
-5.88336054839e-06
4.83152967106e-07
-6.11679465618e-06
6.29126454084e-07
-6.33268462717e-06
7.51996775559e-07
-6.51183763092e-06
8.17178724436e-07
-6.67779341417e-06
8.44255023779e-07
-6.81002909957e-06
8.41154813912e-07
-6.89002831582e-06
7.52993581321e-07
-7.00966540453e-06
6.43828691545e-07
-7.13623352428e-06
5.26785654279e-07
-7.20009995084e-06
3.4158476142e-07
-7.14771294682e-06
6.78458369183e-09
-6.95090071851e-06
-4.58695226278e-07
-6.66595048905e-06
-9.97626968591e-07
-6.19709957085e-06
-1.82341806219e-06
-5.22486349351e-06
-3.24238710842e-06
-3.2574859165e-06
-5.56380365338e-06
9.74849503166e-07
-9.68019784445e-06
-6.84432010072e-07
-5.32902930557e-06
9.95060368903e-05
-0.000115125933551
-5.54270401445e-06
-0.00045301067893
-1.8693474382e-05
-0.000649783243074
-9.45995369682e-06
-0.000441559568811
2.91156210759e-06
-0.000424757075886
1.50442831223e-05
-0.000444286028461
2.8482979585e-05
-0.000476956891268
4.06994200919e-05
-0.000511270551843
5.20614762208e-05
-0.000533676811705
6.23867634878e-05
-0.000551455216861
7.16456097191e-05
-0.00056084044489
7.99592660845e-05
-0.000565055477431
8.73282179097e-05
-0.000564321919011
9.3769834802e-05
-0.000559735780893
9.92213923884e-05
-0.000551721807164
0.000103567446319
-0.000540501469592
0.000106634827668
-0.000526026674253
0.000108218332745
-0.000508082275227
0.00010812983736
-0.000486416279197
0.000106283589224
-0.000460919752443
0.000102836869223
-0.000431921762484
9.83882737104e-05
-0.000400544251059
9.41364888051e-05
-0.000368864527804
9.17610082237e-05
-0.000339606306805
9.29366797865e-05
-0.000315212858954
9.71108685646e-05
-0.000294879871617
9.03256455437e-05
-0.00026530677893
7.14180594049e-05
-0.000231057749363
-3.06767839786e-06
-9.96388274007e-06
-9.45235095392e-07
-4.34704678284e-06
-3.17476338663e-07
-3.90731587575e-06
-1.59619159301e-07
-3.76809449339e-06
-1.13330784857e-07
-3.72028772113e-06
-8.88809125618e-08
-3.69161601347e-06
-7.34811424914e-08
-3.66162582886e-06
-6.05544694648e-08
-3.63394260389e-06
-4.82098406311e-08
-3.60718341075e-06
-4.19548137254e-08
-3.57406607216e-06
-2.14855972148e-08
-3.55236410686e-06
-8.26755360563e-10
-3.55840609161e-06
-3.53164867786e-06
7.54559363295e-07
6.60157076521e-06
1.85099200129e-06
8.82832391186e-06
-7.34213711385e-07
3.71486985622e-06
-9.95752130256e-07
4.94779797679e-07
-1.0290124404e-06
1.10932597329e-07
-1.00759483802e-06
-2.55099313134e-08
-9.37824977669e-07
-1.25517737946e-07
-8.24617307937e-07
-2.23712327794e-07
-6.04098932418e-07
9.65984799706e-08
-2.73184158893e-06
3.05502119246e-05
-4.46469725142e-06
3.94543631416e-05
-4.87845108275e-06
3.5479904245e-05
-3.83120276226e-06
2.30696788503e-05
-4.91554630471e-06
4.57623568261e-06
-2.8506019236e-06
-1.11529687747e-06
-3.84342492726e-06
-6.68970218748e-07
-4.24725183259e-06
-1.28463347009e-07
-4.42586971744e-06
-2.65532444652e-08
-4.7222098804e-06
2.2006809193e-07
-5.06997410761e-06
4.37970601634e-07
-5.35376035473e-06
5.69649218763e-07
-5.59172388246e-06
7.2117621523e-07
-5.83590897085e-06
8.73404217419e-07
-6.05351310627e-06
9.6969936071e-07
-6.22921465966e-06
9.92996786601e-07
-6.40612184623e-06
1.02128883961e-06
-6.56544233086e-06
1.00061697024e-06
-6.7293494923e-06
9.17040471481e-07
-6.90067438696e-06
8.15301703926e-07
-7.0660300541e-06
6.92278285091e-07
-7.17331431476e-06
4.48995615071e-07
-7.21984749647e-06
5.34058608504e-08
-7.34122701962e-06
-3.37236644642e-07
-7.52277544782e-06
-8.16045254144e-07
-7.6571818948e-06
-1.68771337237e-06
-7.60347934814e-06
-3.29452329638e-06
-6.87541117233e-06
-6.2938311529e-06
-3.07466440548e-06
-1.34781205592e-05
-0.000178402160185
0.000170010331588
-0.000137329412191
-0.000156172920101
-8.84891084794e-05
-0.000501846253746
-4.11609488564e-05
-0.000697108467199
-1.97432703237e-05
-0.000462975687771
-4.34195216333e-06
-0.000440157684473
1.00547178351e-05
-0.000458682504772
2.45107395037e-05
-0.000491413017177
3.71450217883e-05
-0.000523905119212
4.86560493425e-05
-0.000545188228325
5.89477462442e-05
-0.000561747371181
6.81047821413e-05
-0.000569997978315
7.62768604996e-05
-0.000573228082961
8.34874521155e-05
-0.00057153305437
8.97606537123e-05
-0.000566009541166
9.50305565828e-05
-0.000556992277762
9.91759281118e-05
-0.000544647421414
0.000102019218919
-0.000528870554443
0.00010336302432
-0.000509426676539
0.000103056758084
-0.00048611060098
0.000101111957869
-0.000458975528094
9.78833448158e-05
-0.00042869369553
9.43214122533e-05
-0.000396982855728
9.22139778071e-05
-0.000366757689715
9.39124889174e-05
-0.000341305758782
0.00010078922545
-0.000322091057334
0.000114494863106
-0.000308587481581
0.000140430886119
-0.000291247640638
8.42907145231e-06
-9.90602537335e-05
1.06884893229e-06
-2.60387332596e-06
2.11436495214e-07
-3.48989436412e-06
3.13165503434e-08
-3.72749338346e-06
2.31328211281e-09
-3.73940785033e-06
-1.53839929404e-09
-3.7167612955e-06
1.3725277941e-09
-3.69485577168e-06
2.39434894725e-09
-3.66297666175e-06
2.08690260565e-09
-3.63396112108e-06
2.15951075411e-09
-3.60759036935e-06
5.29938587338e-09
-3.5774961972e-06
1.10582257868e-08
-3.55830844682e-06
1.36911589692e-08
-3.56152488323e-06
-3.51801399828e-06
1.31283469176e-06
5.29038424312e-06
2.74705798001e-06
7.3936240011e-06
-1.64531699666e-06
8.108530703e-06
-1.27754613057e-06
1.27019122041e-07
-1.17508921129e-06
8.44374610734e-09
-1.11782718584e-06
-8.28038208568e-08
-1.06196409e-06
-1.81559789574e-07
-9.84220968753e-07
-3.01264742012e-07
-9.80268023805e-07
9.24369440896e-08
-2.76199552798e-06
3.2332118763e-05
-4.0919657978e-06
4.07843113412e-05
-4.86780542212e-06
3.62552511743e-05
-5.5283560494e-06
2.3730870152e-05
-2.37929220517e-06
1.42758805762e-06
-3.19950142536e-06
-2.94947835621e-07
-3.61346356438e-06
-2.5496826493e-07
-3.81569176444e-06
7.37388895114e-08
-4.1791482635e-06
3.3687803816e-07
-4.48492234197e-06
5.2584933083e-07
-4.69145040076e-06
6.44546584526e-07
-4.98420366856e-06
8.62493298369e-07
-5.32637728765e-06
1.06348846576e-06
-5.5763390044e-06
1.12352299377e-06
-5.75080109745e-06
1.14435735663e-06
-5.9777924549e-06
1.22020686497e-06
-6.20206929927e-06
1.24581263787e-06
-6.37566176046e-06
1.17447418089e-06
-6.5724547723e-06
1.11413903774e-06
-6.80507390103e-06
1.04824382593e-06
-7.0004982518e-06
8.88065814553e-07
-7.14236431468e-06
5.91205110907e-07
-7.40455362351e-06
3.15926636327e-07
-7.84778188867e-06
1.06352589673e-07
-8.44716869997e-06
-2.15866548049e-07
-9.38700115325e-06
-7.47077394357e-07
-1.10812707419e-05
-1.59969374438e-06
-1.44513569832e-05
-2.91950914365e-06
-2.50300546165e-05
-2.9033168047e-06
-0.000205724299624
0.000350733802927
-0.000271768497325
-9.01089906879e-05
-0.000131839810489
-0.000641770434496
-5.50350282014e-05
-0.000773911074148
-2.97678386428e-05
-0.00048824143451
-1.03803671583e-05
-0.000459544206255
6.44984654566e-06
-0.00047551213488
2.15889263512e-05
-0.000506551799802
3.43684676253e-05
-0.000536684565069
4.58189491267e-05
-0.000556638770289
5.59306275662e-05
-0.000571859216687
6.48864344666e-05
-0.000578954037805
7.28532275195e-05
-0.000581195186931
7.98702858589e-05
-0.000578550474173
8.59625049668e-05
-0.000572102157258
9.105807018e-05
-0.000562088277285
9.50291198956e-05
-0.00054861893358
9.76954304792e-05
-0.000531537357132
9.88719574105e-05
-0.000510603713689
9.84520166704e-05
-0.000485691184049
9.65500596798e-05
-0.000457074065677
9.37048863755e-05
-0.000425848987302
9.1070358813e-05
-0.00039434875339
9.0517123866e-05
-0.000366205115831
9.47151509141e-05
-0.000345504853732
0.00010410878382
-0.00033148653133
0.000101268521328
-0.000305750374113
8.40839092387e-05
-0.000274066651809
-3.39847045678e-06
-1.15780618835e-05
-9.48904230869e-07
-5.05365690714e-06
-1.71082116616e-07
-4.26798340308e-06
4.44133912155e-08
-3.94329272022e-06
1.02230615705e-07
-3.79754715337e-06
1.08091854217e-07
-3.7229537283e-06
1.03340682361e-07
-3.69044167137e-06
9.26229652819e-08
-3.65260012487e-06
7.86021984369e-08
-3.62028259611e-06
6.31920853836e-08
-3.5925000082e-06
5.34237766797e-08
-3.5680603705e-06
3.7139129878e-08
-3.54242933045e-06
1.92949127162e-08
-3.54379204895e-06
-3.49895510021e-06
6.74286980103e-07
4.61519107123e-06
1.53426760943e-06
6.53513522805e-06
-1.31826113357e-06
1.0960092551e-05
-1.26633580023e-06
7.50559205811e-08
-1.23248241706e-06
-2.54392899932e-08
-1.21069920885e-06
-1.0469374115e-07
-1.19746139499e-06
-1.94809097767e-07
-1.22083664391e-06
-2.77889627412e-07
-1.74261308939e-06
6.14403402687e-07
-2.96220467147e-06
3.35515209919e-05
-3.72845889189e-06
4.15501924815e-05
-4.00115857276e-06
3.6529051618e-05
-3.732071091e-06
2.34617219674e-05
-3.14953189635e-06
8.45239317913e-07
-3.38703019612e-06
-5.73004217673e-08
-3.58874618644e-06
-5.3226155026e-08
-3.69009823024e-06
1.75058247673e-07
-3.88958086045e-06
5.36318869693e-07
-4.12973842116e-06
7.66009809367e-07
-4.45182450879e-06
9.66699069407e-07
-4.79174434416e-06
1.20254693023e-06
-5.00308249359e-06
1.27500315664e-06
-5.19461498532e-06
1.31528978336e-06
-5.48995649097e-06
1.43997567253e-06
-5.76462226955e-06
1.49519430901e-06
-5.94540654722e-06
1.42694275241e-06
-6.17584570567e-06
1.4053109069e-06
-6.44707424247e-06
1.38580031749e-06
-6.67590767425e-06
1.27757198463e-06
-6.89495739375e-06
1.10762303822e-06
-7.1837513869e-06
8.80522161573e-07
-7.60704319075e-06
7.39775158685e-07
-8.18536532418e-06
6.85283924099e-07
-8.99726257134e-06
5.96316010619e-07
-1.02500806764e-05
5.07454328077e-07
-1.24017668445e-05
5.54723041837e-07
-1.64683900739e-05
1.14222762153e-06
-2.56812973041e-05
6.32103733134e-06
-0.000114437439985
0.000439468215218
-0.000220584595593
1.60429851642e-05
-8.14631142765e-05
-0.000780890263765
-4.58263273936e-05
-0.000809545762838
-3.10267972077e-05
-0.000503039251951
-1.11758950802e-05
-0.000479393762058
5.66486653604e-06
-0.000492351893186
2.02840011126e-05
-0.000521170211244
3.26343724238e-05
-0.000549034455858
4.36768724604e-05
-0.00056768097308
5.33936299806e-05
-0.000581575831747
6.20122776506e-05
-0.000587572656518
6.96898904157e-05
-0.000588872869832
7.64671929713e-05
-0.000585327919968
8.23610396144e-05
-0.00057799621794
8.7289446599e-05
-0.000567016953384
9.11158158646e-05
-0.000552445629153
9.36574414517e-05
-0.000534079351396
9.47453723055e-05
-0.000511692053308
9.43281576108e-05
-0.00048527438102
9.26598049659e-05
-0.000455406125502
9.06069488071e-05
-0.000423796484422
8.99595235998e-05
-0.000393701723715
9.3234635617e-05
-0.00036948090754
0.000103483077116
-0.000355755021559
0.000127363945553
-0.000355369686498
0.000165295311424
-0.000343685403966
1.0900222636e-05
-0.000119674469128
2.03359312365e-06
-2.71152125716e-06
7.51842538709e-07
-3.77208228758e-06
4.13730816214e-07
-3.93012737838e-06
3.26606716964e-07
-3.85646837016e-06
2.91623823622e-07
-3.76288576949e-06
2.61107437697e-07
-3.69277194386e-06
2.32760560448e-07
-3.6624395328e-06
2.03075161184e-07
-3.62326399634e-06
1.71428404262e-07
-3.58898551264e-06
1.38436866317e-07
-3.55986850877e-06
1.02288631976e-07
-3.53223072162e-06
5.92007090098e-08
-3.49955935054e-06
1.78667547742e-08
-3.50294956431e-06
-3.4811665304e-06
1.27328945451e-07
4.48996702569e-06
1.39948377167e-06
5.26131853097e-06
-1.27607015447e-06
1.36365226419e-05
-1.27740020635e-06
7.63718433329e-08
-1.28746263048e-06
-1.54657221772e-08
-1.28833439071e-06
-1.03954804658e-07
-1.25785797428e-06
-2.25250139161e-07
-1.19482221917e-06
-3.41097219908e-07
-2.28998671699e-06
1.70964541059e-06
-3.55555986091e-06
3.48169585949e-05
-3.72158591992e-06
4.17166085463e-05
-3.63163354684e-06
3.6438223875e-05
-3.27188572704e-06
2.31030944279e-05
-3.04681936342e-06
6.20383102803e-07
-3.26361003614e-06
1.59537890477e-07
-3.45307751831e-06
1.36239158339e-07
-3.58586098818e-06
3.07786362133e-07
-3.66782525015e-06
6.18241576126e-07
-3.87151793496e-06
9.69702643779e-07
-4.16374960446e-06
1.25900314262e-06
-4.39597807993e-06
1.43493021774e-06
-4.63563979473e-06
1.51489976838e-06
-4.97069027531e-06
1.65063320797e-06
-5.29798573542e-06
1.76763145232e-06
-5.50551083284e-06
1.70310831294e-06
-5.73564932649e-06
1.65752761115e-06
-6.01063083342e-06
1.68079403754e-06
-6.27250192684e-06
1.64824690147e-06
-6.54895295123e-06
1.55463996369e-06
-6.85505296639e-06
1.41441039666e-06
-7.20216131868e-06
1.22833239927e-06
-7.66665570776e-06
1.20503230467e-06
-8.26916882422e-06
1.28857651402e-06
-9.06368589688e-06
1.39220577064e-06
-1.01408019258e-05
1.58513417239e-06
-1.15853894169e-05
1.9985013599e-06
-1.32851076122e-05
2.84860262464e-06
-1.32978693576e-05
6.31803629204e-06
2.74396363574e-06
0.000423473374606
2.07683509013e-05
-1.97967342409e-06
-4.55798170172e-06
-0.000755557308526
-2.2031155214e-05
-0.000792069203315
-2.03657164121e-05
-0.000504702273109
-5.27979364547e-06
-0.000494477810557
8.13280856425e-06
-0.00050576300581
2.08005830005e-05
-0.000533836825263
3.20187922233e-05
-0.00056025176666
4.22388140892e-05
-0.000577900326131
5.13186093477e-05
-0.000590655135797
5.94520248006e-05
-0.000595705739466
6.6750938014e-05
-0.000596171572562
7.32402471537e-05
-0.000591817134154
7.89194760153e-05
-0.000583675443476
8.36928342332e-05
-0.000571790400811
8.74146197951e-05
-0.000556167575907
8.99037131456e-05
-0.0005365686792
9.10194441981e-05
-0.000512808068141
9.0791552295e-05
-0.000485046813662
8.96447163925e-05
-0.000454259583401
8.87329707345e-05
-0.000422884950513
9.01884043397e-05
-0.000395157629553
9.60884013282e-05
-0.000375382021289
0.000103987109724
-0.000363656004216
0.000100913762571
-0.000352298257758
9.91185207996e-05
-0.000341891103049
-3.68819217357e-06
-1.68677707823e-05
-3.19820543338e-07
-6.07991705391e-06
4.55862523859e-07
-4.54791330982e-06
5.66919761008e-07
-4.0414259622e-06
5.37344472398e-07
-3.82718462944e-06
4.85905011812e-07
-3.71176563201e-06
4.3785920784e-07
-3.64506231444e-06
3.82524291363e-07
-3.60745284592e-06
3.27594458872e-07
-3.56869130639e-06
2.72293325687e-07
-3.53404644624e-06
2.165363259e-07
-3.50445463014e-06
1.55105571311e-07
-3.47115178265e-06
9.58844373172e-08
-3.44075403191e-06
3.80372669736e-08
-3.44525587885e-06
-3.44336937328e-06
-7.21571875973e-07
5.20931953517e-06
1.84576703367e-06
2.69549831322e-06
-1.18568988879e-06
1.6666418124e-05
-1.32963699046e-06
2.20225153382e-07
-1.38143107577e-06
3.62296576558e-08
-1.47756313008e-06
-7.90188692547e-09
-1.83337880992e-06
1.30356327597e-07
-2.97749800467e-06
8.03506651864e-07
-1.10932520613e-05
9.82448116742e-06
-5.60354837549e-06
2.93272048299e-05
-3.54284395586e-06
3.96553529407e-05
-3.16283734673e-06
3.60594764608e-05
-2.92086990394e-06
2.28606003792e-05
-2.80364798875e-06
5.03103788442e-07
-2.89468440255e-06
2.50683207537e-07
-3.10505975012e-06
3.46680570213e-07
-3.34114609193e-06
5.43865091027e-07
-3.52081128365e-06
7.97840260615e-07
-3.6525835167e-06
1.10143682342e-06
-3.85619740474e-06
1.46267692166e-06
-4.13707007972e-06
1.71599334758e-06
-4.47279238964e-06
1.85090520805e-06
-4.81157416298e-06
1.98978064715e-06
-5.04431718915e-06
2.00077849494e-06
-5.26916339141e-06
1.92841545208e-06
-5.55989965929e-06
1.94878999229e-06
-5.86631763614e-06
1.98782409868e-06
-6.15007488026e-06
1.93267071099e-06
-6.4179419487e-06
1.8232497701e-06
-6.71729695435e-06
1.71454025721e-06
-7.09931140009e-06
1.61121163324e-06
-7.58409139896e-06
1.69078398216e-06
-8.15786100641e-06
1.86351317131e-06
-8.858250191e-06
2.09334877561e-06
-9.71392226804e-06
2.44289806511e-06
-1.07319327641e-05
3.02027284817e-06
-1.18592474567e-05
3.97071747983e-06
-1.27159791115e-05
7.20455571641e-06
4.02724780793e-06
0.000406725104439
3.2391103703e-06
-1.18766604213e-06
9.40497780544e-06
-0.000761718488107
-6.17376386262e-06
-0.000776486488031
-6.96439750741e-06
-0.000503908531583
3.01996336687e-06
-0.000504459706497
1.22424559182e-05
-0.000514983529464
2.25352384443e-05
-0.000544128014946
3.22221109387e-05
-0.000569937359117
4.1327828742e-05
-0.000587005010081
4.95863645292e-05
-0.000598912854997
5.71133699517e-05
-0.000603232101826
6.39582303763e-05
-0.000603015951492
7.01197172595e-05
-0.000597978271611
7.55749386418e-05
-0.000589130445358
8.0212742567e-05
-0.000576428091744
8.3878059104e-05
-0.000559832887054
8.63901759591e-05
-0.000539080875846
8.76300141339e-05
-0.000514048062584
8.76840608353e-05
-0.000485101042909
8.70813640962e-05
-0.000453657038797
8.70909340218e-05
-0.000422894762897
8.97457548052e-05
-0.000397812951373
9.66120524592e-05
-0.000382250209401
0.000104899567849
-0.000371944557661
9.34783969984e-05
-0.000340878413299
2.12893527615e-05
-0.00026970386335
5.10223435058e-06
-6.80660397684e-07
2.22793493833e-06
-3.20574179332e-06
1.32602610943e-06
-3.64620122415e-06
9.94199949387e-07
-3.70985141607e-06
8.31845859009e-07
-3.66511939399e-06
7.19553464438e-07
-3.59978754219e-06
6.34106753177e-07
-3.55994954574e-06
5.46191148792e-07
-3.51988567004e-06
4.61984481084e-07
-3.48484319468e-06
3.80561087455e-07
-3.45298614154e-06
2.99497434032e-07
-3.42376447074e-06
2.11400082772e-07
-3.3833890878e-06
1.41311597237e-07
-3.37091041044e-06
7.17095836396e-08
-3.37614333752e-06
-3.37176102606e-06
-8.90074969717e-07
6.10203198744e-06
7.72314054947e-07
1.0322104904e-06
-1.24007271029e-06
1.86798433831e-05
-1.44053967128e-06
4.20685295797e-07
-1.4131803094e-06
8.79663248799e-09
-1.33614920067e-06
-8.50383741534e-08
-1.0805595019e-06
-1.24820127984e-07
-9.4635997237e-07
6.68789392282e-07
-1.24838709418e-06
1.01269946496e-05
-2.81897483202e-06
3.08976544398e-05
-2.51472188462e-06
3.93516945927e-05
-2.5716159165e-06
3.61152735651e-05
-2.62634739158e-06
2.29152403329e-05
-2.482555854e-06
3.59458366081e-07
-2.64883444701e-06
4.16982270067e-07
-2.78397147224e-06
4.81838463945e-07
-2.93612302975e-06
6.95945636291e-07
-3.17223210346e-06
1.03382538696e-06
-3.4986254225e-06
1.42776846913e-06
-3.78870995033e-06
1.75287540463e-06
-4.03023993975e-06
1.95776953726e-06
-4.3306585388e-06
2.15167361116e-06
-4.61795711727e-06
2.27747804228e-06
-4.85131586996e-06
2.23459323197e-06
-5.11300452897e-06
2.19061864144e-06
-5.38429444654e-06
2.22067313762e-06
-5.65378636961e-06
2.25798124193e-06
-5.93392023967e-06
2.21353593419e-06
-6.26155970768e-06
2.15167375422e-06
-6.61969853744e-06
2.073562181e-06
-6.97636955131e-06
1.96882211381e-06
-7.41131972356e-06
2.1268363958e-06
-7.91942476022e-06
2.37272949015e-06
-8.49186339021e-06
2.66743860709e-06
-9.10807007229e-06
3.06009822329e-06
-9.70914013077e-06
3.62060645769e-06
-1.01621309317e-05
4.43159409278e-06
-9.97614602777e-06
7.00624641964e-06
1.30035424299e-05
0.000383796129385
1.34902037667e-05
-1.67163657534e-06
1.18394834751e-05
-0.000760059964049
-4.55481016098e-07
-0.000764186507139
1.12850439421e-06
-0.000505488712599
9.10485972265e-06
-0.000512433077561
1.59427077233e-05
-0.000521818976062
2.44756289074e-05
-0.000552658970258
3.26871214362e-05
-0.000578147217145
4.06248140512e-05
-0.000594941341895
4.79942016727e-05
-0.000606281103345
5.48515741816e-05
-0.000610088536125
6.11969593522e-05
-0.000609360568522
6.70073312318e-05
-0.000603788040132
7.22395735497e-05
-0.000594362225868
7.67709886431e-05
-0.000580959187307
8.04414883806e-05
-0.000563503185833
8.30790467519e-05
-0.000541718349297
8.46063443298e-05
-0.000515575360221
8.52168241411e-05
-0.000485711581792
8.56666348742e-05
-0.000454106830665
8.77107830552e-05
-0.000424939018429
9.39887886021e-05
-0.000404091802846
0.000105219759708
-0.000393482551634
0.000122404209977
-0.000389130624801
0.000159887170662
-0.000378362128322
1.63845968094e-07
-0.000109981890564
1.62285407817e-06
-2.13993692267e-06
1.5204316327e-06
-3.10356352771e-06
1.36336683314e-06
-3.48937669729e-06
1.20652197447e-06
-3.55326418698e-06
1.07302412649e-06
-3.53190517675e-06
9.52564306797e-07
-3.47963454928e-06
8.34275517594e-07
-3.44198885516e-06
7.14933741982e-07
-3.40088875423e-06
6.00051852036e-07
-3.37032054996e-06
4.89915697938e-07
-3.34321828948e-06
3.80764570295e-07
-3.31496598267e-06
2.75703528147e-07
-3.27868742059e-06
1.89765485525e-07
-3.28539135235e-06
1.03885988351e-07
-3.29046032316e-06
-3.26810843525e-06
4.81846488973e-07
5.6207493786e-06
-4.36580489682e-07
1.95163194727e-06
-1.77332278689e-06
2.00158752292e-05
-1.71875299083e-06
3.6607771035e-07
-1.75979989218e-06
4.9854961236e-08
-1.99395807663e-06
1.4934910375e-07
-2.6255765547e-06
5.0627888699e-07
-3.34457540962e-06
1.38897801852e-06
-8.87111707416e-06
1.56538959468e-05
-3.95032154194e-06
2.59769891367e-05
-1.66826327048e-06
3.70690728534e-05
-1.55097160544e-06
3.59983249605e-05
-1.92135718686e-06
2.32853705674e-05
-2.30012214652e-06
7.37773294408e-07
-2.29065156591e-06
4.07550074069e-07
-2.38998181237e-06
5.81238781115e-07
-2.5714504396e-06
8.77358625621e-07
-2.83325345078e-06
1.29547920675e-06
-3.17610682169e-06
1.77053891452e-06
-3.55696005191e-06
2.13375895201e-06
-3.95867115284e-06
2.35977723832e-06
-4.2767157598e-06
2.47013861071e-06
-4.47138988014e-06
2.47263598717e-06
-4.64816544046e-06
2.41187779194e-06
-4.88212919224e-06
2.42513996342e-06
-5.17979964417e-06
2.51898194708e-06
-5.5151349608e-06
2.5940314424e-06
-5.83000267054e-06
2.52916613542e-06
-6.12615585825e-06
2.44866655088e-06
-6.40535893396e-06
2.35364244555e-06
-6.74195340601e-06
2.30642325921e-06
-7.16379380233e-06
2.54982912656e-06
-7.61679732769e-06
2.82704200273e-06
-8.0874110165e-06
3.13899129187e-06
-8.5313269495e-06
3.50564549702e-06
-8.86525933938e-06
3.95799694514e-06
-8.96792884288e-06
4.53024404794e-06
-8.3691564726e-06
6.43650932976e-06
1.88766895459e-05
0.00035655942987
1.99227705292e-05
-2.71379592465e-06
1.45071838227e-05
-0.000754637952741
3.02692720249e-06
-0.000752700914736
5.44820277613e-06
-0.000507905721872
1.24763009085e-05
-0.000519457773181
1.83855106102e-05
-0.00052772542068
2.58821204919e-05
-0.000560153284219
3.29154945733e-05
-0.000585178650148
3.98075779133e-05
-0.000601831761156
4.6320256728e-05
-0.000612792358853
5.24982329636e-05
-0.000616265291455
5.8328675679e-05
-0.00061518998651
6.37798957933e-05
-0.000609238405439
6.88005745115e-05
-0.000599382223213
7.32650243351e-05
-0.000585423105381
7.7017737819e-05
-0.000567255519962
7.99008756096e-05
-0.00054460123107
8.18772207735e-05
-0.000517551563636
8.32243077794e-05
-0.000487058502248
8.47735099399e-05
-0.000455655925194
8.83022192182e-05
-0.000428467845552
9.72771877723e-05
-0.000413068100576
0.000112439936523
-0.000408645505994
0.00011184561573
-0.00038853619836
9.22582564671e-05
-0.000358775186009
-3.75462476789e-06
-1.39691647296e-05
-2.36466525814e-07
-5.65839372299e-06
1.06660660129e-06
-4.40690833937e-06
1.39894130337e-06
-3.82195954549e-06
1.41373322008e-06
-3.56831396473e-06
1.31736746765e-06
-3.43581658513e-06
1.19434468127e-06
-3.35691074884e-06
1.04565287304e-06
-3.29361634136e-06
8.93404790147e-07
-3.24898025992e-06
7.44298048511e-07
-3.22157073783e-06
6.0200027659e-07
-3.20128684074e-06
4.6408022348e-07
-3.17742341483e-06
3.47280952779e-07
-3.16223421068e-06
2.36518996671e-07
-3.17490135384e-06
1.30746911477e-07
-3.18516499011e-06
-3.13748325941e-06
2.64363972902e-06
2.97876961078e-06
-2.43150774321e-06
7.02602019601e-06
-2.42343945761e-06
2.00082119035e-05
-2.31607022637e-06
2.58766360229e-07
-2.55223862669e-06
2.86059506717e-07
-2.89386553973e-06
4.91022959309e-07
-3.19247013901e-06
8.05859509634e-07
-3.43385538624e-06
1.63086452696e-06
-2.92310611241e-06
1.51443045713e-05
-4.85243951479e-07
2.3539687728e-05
7.31314970232e-07
3.5852926007e-05
3.52092651777e-07
3.6377340849e-05
-7.14665929746e-07
2.43508093588e-05
-1.7579240045e-06
1.78138757125e-06
-2.16620287334e-06
8.15930887021e-07
-2.336189323e-06
7.51175220406e-07
-2.43129778834e-06
9.72262604841e-07
-2.54395309379e-06
1.40783549515e-06
-2.76955634793e-06
1.99585283906e-06
-3.19927098743e-06
2.56359743613e-06
-3.6580498595e-06
2.81887188903e-06
-4.01456122875e-06
2.82713169052e-06
-4.29082570122e-06
2.74942729029e-06
-4.54968399335e-06
2.67130041741e-06
-4.83343145204e-06
2.70950318679e-06
-5.1340996319e-06
2.82032671759e-06
-5.383510417e-06
2.84414880426e-06
-5.61606512281e-06
2.76248153169e-06
-5.85359207598e-06
2.68699093612e-06
-6.13219993805e-06
2.63316814514e-06
-6.48794623031e-06
2.66319825216e-06
-6.88507738188e-06
2.94815302945e-06
-7.30115797134e-06
3.24431307196e-06
-7.71454042874e-06
3.55366104617e-06
-8.07026661576e-06
3.86240211949e-06
-8.27841691259e-06
4.16576025886e-06
-8.21460537301e-06
4.47207684628e-06
-7.56654499903e-06
5.78423124586e-06
2.00374355919e-05
0.000329010118641
2.08582867989e-05
-3.53132765119e-06
1.69305223473e-05
-0.000750702316
6.92042202587e-06
-0.000742685052987
8.93010793421e-06
-0.000509910806753
1.47847678038e-05
-0.000525308698078
1.9976176201e-05
-0.00053291375274
2.66396452141e-05
-0.000566814154163
3.26816690155e-05
-0.000591218433855
3.8667287422e-05
-0.000607815433443
4.43815367949e-05
-0.000618504897875
4.98992302631e-05
-0.000621781502425
5.52143167088e-05
-0.000620503781172
6.03075630543e-05
-0.000614330562364
6.51294574908e-05
-0.000604203200561
6.95659105109e-05
-0.000589858828518
7.34761148005e-05
-0.000571165146472
7.67342628815e-05
-0.00054785896625
7.93706213277e-05
-0.000520187593307
8.1876579052e-05
-0.000489564185046
8.56891934297e-05
-0.000459468283966
9.36281085381e-05
-0.00043640707409
0.000111238442953
-0.000430677914419
0.000150001333384
-0.000447409902
0.000210503928468
-0.00044903746195
1.24178379769e-05
-0.000160688871118
2.7963313078e-06
-4.34795660783e-06
1.85137298965e-06
-4.71375434225e-06
1.80230013318e-06
-4.35810841026e-06
1.85392250492e-06
-3.87382936826e-06
1.76916124556e-06
-3.48379553701e-06
1.63494738218e-06
-3.30186384354e-06
1.46837617762e-06
-3.19062493939e-06
1.28460452107e-06
-3.11015553574e-06
1.09483083056e-06
-3.0595421414e-06
9.05514459532e-07
-3.03261277379e-06
7.25839373156e-07
-3.021986085e-06
5.59717721551e-07
-3.01166834329e-06
4.18524811209e-07
-3.02141775762e-06
2.80141331685e-07
-3.03694663341e-06
1.48942781254e-07
-3.05421357985e-06
-2.98877009743e-06
2.18346327827e-06
7.95128223825e-07
-4.08013303938e-07
9.619559309e-06
-1.84544609442e-06
2.14453286336e-05
-1.89108229884e-06
3.0436093993e-07
-2.27240234322e-06
6.67543796992e-07
-2.85145609559e-06
1.07063143113e-06
-3.33388947601e-06
1.28863041958e-06
-3.37100084589e-06
1.66905957583e-06
3.50616245877e-08
1.1743190732e-05
2.2464747048e-06
2.13289133496e-05
3.21491952953e-06
3.48848442972e-05
2.55748344148e-06
3.70346090806e-05
1.65749622754e-06
2.52525321785e-05
-1.82559893942e-06
5.26348336185e-06
-2.0033892101e-06
9.93545695483e-07
-2.02324863401e-06
7.71199887366e-07
-1.96261519962e-06
9.11467599797e-07
-1.94222616534e-06
1.3870521832e-06
-2.24189443117e-06
2.29555090315e-06
-2.99779390208e-06
3.31947664318e-06
-3.52956262506e-06
3.35081229823e-06
-3.84831380198e-06
3.14630771005e-06
-4.10736464068e-06
3.00906951722e-06
-4.40117457746e-06
2.96566721693e-06
-4.70961379137e-06
3.01858219734e-06
-4.98503957857e-06
3.09635259866e-06
-5.19403461989e-06
3.05385570371e-06
-5.37972117176e-06
2.94890169932e-06
-5.58370159403e-06
2.89182726715e-06
-5.86357929378e-06
2.91394422071e-06
-6.21520617096e-06
3.01586623795e-06
-6.58830713194e-06
3.32241485669e-06
-6.99316538378e-06
3.65033507783e-06
-7.40538555334e-06
3.96669564076e-06
-7.76425148001e-06
4.2222713835e-06
-7.96604542044e-06
4.37004881882e-06
-7.87095480182e-06
4.37597682362e-06
-7.13868208544e-06
5.0810723358e-06
2.05019570208e-05
0.000301414488617
2.10492813467e-05
-4.07476313544e-06
1.88797921936e-05
-0.000748525593742
1.07363968983e-05
-0.000734535790237
1.22856021634e-05
-0.000511455173583
1.69362514687e-05
-0.000529955377673
2.12815118953e-05
-0.000537255689536
2.69607802365e-05
-0.000572490572995
3.20360283319e-05
-0.000596291206983
3.71398113143e-05
-0.00061291701486
4.20775006587e-05
-0.000623440655002
4.69260125008e-05
-0.000626628284341
5.17155945101e-05
-0.000625291868638
5.64355393037e-05
-0.000619049192348
6.10639314887e-05
-0.00060883049971
6.55083540785e-05
-0.000594302324477
6.96718163976e-05
-0.000575327891884
7.34906488853e-05
-0.000551677210978
7.71025840333e-05
-0.000523799073047
8.11578951836e-05
-0.000493619035811
8.75232107289e-05
-0.000465833275841
9.93208168839e-05
-0.000448204500141
0.000115979821516
-0.00044733822154
0.000121231982041
-0.000452660066501
0.000127738654596
-0.000455546420289
-4.21064259361e-06
-2.87398454053e-05
4.58168779388e-07
-9.01706502387e-06
1.86642348875e-06
-6.12227676437e-06
2.21670509495e-06
-4.70862615226e-06
2.27391816455e-06
-3.93125217845e-06
2.18064147719e-06
-3.39073616974e-06
2.00268929642e-06
-3.12415645258e-06
1.78401014458e-06
-2.97222241887e-06
1.55592107501e-06
-2.88237036088e-06
1.32308293965e-06
-2.82703809e-06
1.08736966547e-06
-2.79725942854e-06
8.69168400038e-07
-2.80416639854e-06
6.73916229728e-07
-2.81681747733e-06
4.98835690186e-07
-2.84672073929e-06
3.31944450716e-07
-2.87037725572e-06
1.66427878605e-07
-2.88918482304e-06
-2.82249733427e-06
4.92553763541e-07
3.03487527981e-07
3.79518322695e-06
6.31625344266e-06
7.86714095272e-07
2.44538096889e-05
-1.29942780152e-06
2.39068149021e-06
-2.28011900823e-06
1.64836126597e-06
-2.97731035674e-06
1.76792410191e-06
-3.43009631026e-06
1.74186242651e-06
-3.71801339116e-06
1.95964915212e-06
1.77518527011e-06
6.25172597446e-06
4.55055009174e-06
1.85552471387e-05
5.6621615234e-06
3.37745033662e-05
4.86029920734e-06
3.78379483046e-05
3.4821795578e-06
2.66288525708e-05
-2.70095313501e-06
1.14461471764e-05
-2.13970596016e-06
4.32869028271e-07
-1.95988372967e-06
5.9119734014e-07
-1.64899981502e-06
6.00386078021e-07
-1.29701586048e-06
1.03537735356e-06
-1.44924650368e-06
2.44739405093e-06
-2.88913547057e-06
4.75903913653e-06
-3.5088438729e-06
3.97069912982e-06
-3.75245677987e-06
3.39028043084e-06
-3.95063697112e-06
3.207618286e-06
-4.18988678986e-06
3.20548063864e-06
-4.47073515167e-06
3.29987835619e-06
-4.73700502664e-06
3.36325981326e-06
-4.95285129061e-06
3.27033595308e-06
-5.15299883528e-06
3.14979989497e-06
-5.34853241327e-06
3.08812940977e-06
-5.58213255984e-06
3.14847129145e-06
-5.91440266313e-06
3.34912400112e-06
-6.26113847182e-06
3.67033120306e-06
-6.6835971383e-06
4.07374099084e-06
-7.15619692892e-06
4.44010682491e-06
-7.62011878435e-06
4.6871912015e-06
-7.95880924404e-06
4.7099046402e-06
-7.96292554855e-06
4.38330574338e-06
-7.06280272086e-06
4.1952076503e-06
2.28189065365e-05
0.000271614893652
2.32904447243e-05
-4.54262176876e-06
2.16500769056e-05
-0.000746878116032
1.44565210312e-05
-0.000727336332334
1.52702686372e-05
-0.000512263945477
1.88818753923e-05
-0.000533562779959
2.22159350841e-05
-0.000540586155094
2.68837790608e-05
-0.000577155307525
3.09324378546e-05
-0.000600337098814
3.51819415605e-05
-0.000617164082753
3.93137349646e-05
-0.0006275702459
4.34929039051e-05
-0.000630805526541
4.77245878296e-05
-0.000629521822439
5.20547478833e-05
-0.000623377875866
5.64673692266e-05
-0.000613241827316
6.09249696219e-05
-0.000598758873638
6.53599182908e-05
-0.000579761955196
6.97799992827e-05
-0.000556096609494
7.44016476461e-05
-0.00052842012898
7.98745706398e-05
-0.000499091444665
8.76619609191e-05
-0.000473620376781
0.000100873095823
-0.000461415774169
0.000119558380678
-0.000466023398622
0.00011451840555
-0.000447623053786
3.8026844665e-05
-0.000379053520335
9.77980855561e-06
-4.92861289209e-07
5.08266317948e-06
-4.32007833186e-06
3.58552880349e-06
-4.62531928791e-06
3.08947786415e-06
-4.21274156916e-06
2.84834044414e-06
-3.69029156598e-06
2.66888451747e-06
-3.21147370413e-06
2.40499339827e-06
-2.86048779417e-06
2.13231468699e-06
-2.69980171842e-06
1.85321956084e-06
-2.60357554362e-06
1.57623475719e-06
-2.55038777931e-06
1.3074504692e-06
-2.52884445629e-06
1.05096169778e-06
-2.54807782712e-06
8.09581107828e-07
-2.57584596269e-06
5.88380049707e-07
-2.62594324073e-06
3.93375806614e-07
-2.67584275649e-06
1.86345678153e-07
-2.68248148413e-06
-2.63639379341e-06
-2.37426931619e-07
5.40819318282e-07
3.50026068893e-06
2.57904988574e-06
3.74071752648e-06
2.42143547841e-05
-2.72589415922e-06
8.85690462649e-06
-2.99314302876e-06
1.91558991909e-06
-2.66867450302e-06
1.44356221239e-06
-2.26045671613e-06
1.33398860065e-06
-1.55539632713e-06
1.25465488089e-06
3.1573991426e-06
1.54014491666e-06
6.03605671394e-06
1.56807975574e-05
7.41284938957e-06
3.23989965893e-05
5.6432281296e-06
3.96073935647e-05
1.90646122407e-06
3.0366361288e-05
-1.57159402424e-06
1.49257526683e-05
-1.88774471449e-06
7.47923448583e-07
-1.89248962047e-06
5.95894798886e-07
-1.44778474619e-06
1.56163798835e-07
-7.22693211145e-07
3.10022211617e-07
1.24186806045e-07
1.60067417613e-06
-3.57174089125e-06
8.4569969115e-06
-3.54197110112e-06
3.9406306232e-06
-3.44934450679e-06
3.29768647105e-06
-3.63473031846e-06
3.39318346371e-06
-3.93176432759e-06
3.50300116586e-06
-4.27903068013e-06
3.64746578705e-06
-4.55676010583e-06
3.64148949969e-06
-4.7744234949e-06
3.48846971677e-06
-4.91940534405e-06
3.2955549971e-06
-5.02460002857e-06
3.19411181523e-06
-5.21876840086e-06
3.34350713856e-06
-5.53793157616e-06
3.66922608468e-06
-5.85773099189e-06
3.99104300885e-06
-6.32955841178e-06
4.54630274044e-06
-6.92509719697e-06
5.03622173984e-06
-7.6166813534e-06
5.37995581859e-06
-8.31368525292e-06
5.40848481817e-06
-8.76878650071e-06
4.84000364341e-06
-7.96210705887e-06
3.42823588269e-06
2.8855444768e-05
0.000234928067928
2.88720475163e-05
-4.55554244232e-06
2.48469817617e-05
-0.00074284542336
1.79513600468e-05
-0.000720434713173
1.80272027187e-05
-0.000512334784764
2.03995734784e-05
-0.000535930921429
2.30110600953e-05
-0.000543193955356
2.64639412578e-05
-0.00058060495795
2.95889216991e-05
-0.000603459164424
3.28171660177e-05
-0.000620389736004
3.61191902278e-05
-0.000630869908226
3.94915842305e-05
-0.000634175844989
4.31010353449e-05
-0.000633129393411
4.69247198701e-05
-0.000627199957017
5.10637817121e-05
-0.000617379464559
5.54912412695e-05
-0.000603185179414
6.0272479137e-05
-0.000584542193985
6.54962414858e-05
-0.000561319607858
7.16192476184e-05
-0.000534542384816
7.96325035284e-05
-0.000507104120149
9.12051685288e-05
-0.000485192669359
0.000110008140261
-0.000480219471793
0.000149307820476
-0.000505324041993
0.000209411036956
-0.000507724190565
1.0329071709e-06
-0.00017067292411
3.9960507409e-06
-3.45577752202e-06
4.05531721843e-06
-4.37933157585e-06
3.82986416934e-06
-4.39995948228e-06
3.56999069119e-06
-3.9529829732e-06
3.3234590405e-06
-3.44390848629e-06
3.08931183271e-06
-2.97748533389e-06
2.80236286493e-06
-2.57374096002e-06
2.49449050663e-06
-2.39217556971e-06
2.17446125137e-06
-2.28384567738e-06
1.85663141708e-06
-2.23289474819e-06
1.54499345269e-06
-2.21758957959e-06
1.24167825825e-06
-2.24517602523e-06
9.57651376803e-07
-2.29226930408e-06
6.874525545e-07
-2.35619185416e-06
4.62807378694e-07
-2.45160017736e-06
2.18729273145e-07
-2.4389204744e-06
-2.41786323338e-06
-1.47786736324e-07
6.88980493543e-07
1.31077464972e-06
1.12082155652e-06
9.77099285986e-07
2.45477036161e-05
-3.62731417059e-06
1.34620711646e-05
-2.30775003932e-06
5.96056081065e-07
-1.67887833161e-06
8.14763844737e-07
-1.38602594818e-06
1.04110272473e-06
-1.3369010787e-06
1.20600830023e-06
-9.68749954426e-07
1.17418940603e-06
5.90786419724e-06
8.8061385022e-06
8.91630144426e-06
2.93926992844e-05
7.18370967932e-06
4.1341793186e-05
2.54400856929e-06
3.50064283212e-05
-6.3166986424e-07
1.80966598145e-05
-1.96598505292e-06
2.08088063789e-06
-2.1275815285e-06
7.57537543863e-07
-1.28706501725e-06
-6.84399073532e-07
1.14249560752e-07
-1.09013639712e-06
2.15867131361e-06
-4.39505933855e-07
5.14628417924e-06
5.46343602965e-06
-2.35649982276e-06
1.14431025148e-05
-2.93918820274e-06
3.87969460018e-06
-3.35285577259e-06
3.80711662956e-06
-3.68363340167e-06
3.83313874807e-06
-4.10619527702e-06
4.07030549577e-06
-4.43132376341e-06
3.96657864126e-06
-4.66227989984e-06
3.7202262536e-06
-4.76472798356e-06
3.39865201659e-06
-4.74123509832e-06
3.17141554347e-06
-4.79271652198e-06
3.39562352874e-06
-4.98322164961e-06
3.86037730436e-06
-5.31483446021e-06
4.32311346083e-06
-5.85217692289e-06
5.08389057527e-06
-6.60871462438e-06
5.79296660554e-06
-7.63485936121e-06
6.40673006397e-06
-8.99037733203e-06
6.76622525944e-06
-1.06409715595e-05
6.49295453911e-06
-1.16631065089e-05
4.50475075593e-06
4.38682872458e-05
0.000179518745873
3.96844508035e-05
-3.67813469013e-07
3.14246435978e-05
-0.000734578813836
2.27173450378e-05
-0.000711721721239
2.00389719377e-05
-0.000509651616859
2.13261388131e-05
-0.000537213889092
2.25617283245e-05
-0.000544425939217
2.53246396976e-05
-0.000583364530651
2.73590491904e-05
-0.000605490668212
2.98499423964e-05
-0.000622877859032
3.2235621213e-05
-0.000633253217544
3.49086389588e-05
-0.000636846585754
3.78128547302e-05
-0.000636031733743
4.11367617138e-05
-0.000630522061165
4.48957997601e-05
-0.000621137101111
4.92223994666e-05
-0.000607510439709
5.41804359178e-05
-0.000589499270341
6.00217821581e-05
-0.00056715997763
6.73031616341e-05
-0.000541823035526
7.77878683365e-05
-0.000517588078429
9.42865567583e-05
-0.000501691225635
0.000115000842028
-0.000500934044933
0.000123141328568
-0.000513463862565
0.000131712800381
-0.000516292013885
-5.29352817368e-06
-3.36659800368e-05
1.77430028746e-06
-1.05231818267e-05
3.88080695806e-06
-6.4857718034e-06
4.20723536103e-06
-4.72641866287e-06
4.05884443819e-06
-3.8047010653e-06
3.78724822634e-06
-3.17242147576e-06
3.49187354736e-06
-2.68227536363e-06
3.19901594635e-06
-2.28106089584e-06
2.86121730733e-06
-2.05461652481e-06
2.51057085016e-06
-1.93348202301e-06
2.15984378103e-06
-1.88252087329e-06
1.81028979686e-06
-1.86843027901e-06
1.4642731513e-06
-1.8996122506e-06
1.1349718753e-06
-1.96344201622e-06
8.20786866364e-07
-2.04250129583e-06
5.46997376879e-07
-2.17834370688e-06
2.81534074486e-07
-2.17387910805e-06
-2.13658959959e-06
-4.18848752555e-07
1.10781927995e-06
-4.34818685263e-07
1.13696922542e-06
-2.02564501727e-06
2.61399765993e-05
-1.69021174471e-06
1.3126249774e-05
-1.35895699344e-06
2.64817517738e-07
-1.23201017344e-06
6.87882139368e-07
-1.27043668858e-06
1.0797452665e-06
-1.44776863804e-06
1.38373326944e-06
-1.81124902264e-06
1.5378958704e-06
4.30517025799e-06
2.69136479673e-06
9.89437938946e-06
2.3807654703e-05
9.93978634813e-06
4.12975598102e-05
5.04350110508e-06
3.99019138168e-05
1.74834788509e-07
2.29639775271e-05
-5.43727167564e-06
7.69159185843e-06
-3.13951638329e-06
-1.5404166234e-06
-1.08991818618e-06
-2.73283905647e-06
8.42198753754e-06
-1.05985231064e-05
1.94843296482e-05
-1.15024581287e-05
2.04945730844e-05
4.45504385873e-06
6.13839914762e-06
2.57952351488e-05
-1.62465423562e-06
1.16414653608e-05
-2.86704713876e-06
5.0482493891e-06
-3.31482754206e-06
4.28085458395e-06
-4.04395910426e-06
4.79915223797e-06
-4.46055885588e-06
4.38348903201e-06
-4.74473893779e-06
4.00522246413e-06
-4.84225750895e-06
3.49681415442e-06
-4.53441526421e-06
2.86405001346e-06
-4.29945272543e-06
3.16089431373e-06
-4.34138953597e-06
3.90258709486e-06
-4.57975096527e-06
4.56135884549e-06
-5.16747837177e-06
5.67131500572e-06
-6.02606362178e-06
6.65112409414e-06
-7.37025759055e-06
7.75150721819e-06
-9.63417110203e-06
9.0315875487e-06
-1.38381051053e-05
1.06980216661e-05
-2.5932308839e-05
1.66276359774e-05
8.89813966085e-05
6.46601634507e-05
6.0249426824e-05
2.83658735773e-05
3.54087424462e-05
-0.000709733928933
2.48936886801e-05
-0.000701202824664
2.21984736079e-05
-0.000506952691503
2.12129174077e-05
-0.000536224897028
2.37909926346e-05
-0.000547000770824
2.41231254075e-05
-0.000583693662171
2.60393701963e-05
-0.000607404100128
2.65921798197e-05
-0.000623428075814
2.82951277212e-05
-0.000634953779441
2.95052545744e-05
-0.000638054545487
3.16624662763e-05
-0.000638187003106
3.39297602945e-05
-0.000632787630833
3.7168659974e-05
-0.000624374512064
4.10318918178e-05
-0.000611372379608
4.62980306482e-05
-0.000594764333719
5.31718344954e-05
-0.000574032772927
6.29863464286e-05
-0.00055163656037
7.67112077014e-05
-0.00053131200542
9.69411240062e-05
-0.000521921187282
0.000118724229381
-0.000522716247611
0.000116650947876
-0.000511387332209
4.48352064703e-05
-0.000444470591218
1.35460917681e-05
-2.37617499494e-06
7.92601744177e-06
-4.9031880143e-06
6.05516488039e-06
-4.61500346847e-06
5.25556501242e-06
-3.92687151495e-06
4.72671770093e-06
-3.27593047591e-06
4.28953776477e-06
-2.73533868577e-06
3.90343504297e-06
-2.29630552658e-06
3.56701229024e-06
-1.94479866725e-06
3.19257954585e-06
-1.68040150273e-06
2.82121675323e-06
-1.5623973252e-06
2.45126535528e-06
-1.51292107408e-06
2.08613871559e-06
-1.50371569848e-06
1.71363873344e-06
-1.52758806315e-06
1.3399253147e-06
-1.59024988744e-06
9.8780863106e-07
-1.69092355543e-06
6.61512534905e-07
-1.85255694437e-06
3.55334324745e-07
-1.86827309942e-06
-1.78149524604e-06
-4.39583230412e-07
1.54729739983e-06
-2.58269989602e-06
3.2805490405e-06
-3.20529891017e-06
2.67618251398e-05
-8.96023927786e-07
1.08171945381e-05
-7.42108466334e-07
1.10996240284e-07
-7.81160203315e-07
7.27069590317e-07
-8.99468496385e-07
1.19828693467e-06
-1.17836446292e-06
1.66269808885e-06
-1.71222847235e-06
2.07229588164e-06
-1.5619659552e-06
2.54302016995e-06
8.31659110489e-06
1.3932205466e-05
1.25298630791e-05
3.70879184006e-05
8.41695294291e-06
4.40168083577e-05
6.50635995185e-06
2.48758989479e-05
-3.18344782622e-06
1.73823164384e-05
-3.45222180744e-06
-1.27079536211e-06
1.46512203176e-05
-2.08348007223e-05
2.46439169748e-05
-2.05904284196e-05
3.01289267667e-05
-1.6984312047e-05
3.26468223514e-05
1.93720085808e-06
1.3034903199e-05
4.54079560403e-05
6.31382366846e-06
1.83626021819e-05
-4.53468146444e-06
1.58967994792e-05
-3.52852433347e-06
3.2747287238e-06
-4.4554183773e-06
5.7254414552e-06
-4.78661144821e-06
4.71581248786e-06
-5.08651498753e-06
4.30497629903e-06
-5.36721599968e-06
3.77712662357e-06
-4.50364519991e-06
2.00019191469e-06
-3.74815590638e-06
2.40507109067e-06
-3.55794236302e-06
3.71165723255e-06
-3.59130970417e-06
4.59374520222e-06
-4.08469755901e-06
6.1631799876e-06
-4.93863185036e-06
7.50339734868e-06
-6.02462046713e-06
8.83651587244e-06
-7.59314849769e-06
1.05987601064e-05
-9.94233025772e-06
1.30418150463e-05
-1.1581656984e-05
1.82642035735e-05
2.16784710263e-05
3.13964327565e-05
4.08319361051e-05
9.21137922331e-06
4.97156477136e-05
-0.000718616821871
3.21377282554e-05
-0.000683623441944
1.82244678349e-05
-0.000493037615928
2.11178938127e-05
-0.000539116384126
1.86123526913e-05
-0.000544492980398
2.14442309244e-05
-0.000586523433964
2.09354168626e-05
-0.000606892927496
2.22947655353e-05
-0.000624785392273
2.25294880946e-05
-0.000635186250241
2.37556020945e-05
-0.000639278850217
2.48320230642e-05
-0.000639261418385
2.6832262854e-05
-0.000634786375616
2.92376814301e-05
-0.000626778244871
3.27927966533e-05
-0.000614926358122
3.73640420765e-05
-0.000599334189836
4.37047058301e-05
-0.000580372348124
5.23811803802e-05
-0.000560311700613
6.51530095317e-05
-0.000544083086608
9.10496054131e-05
-0.000547816239548
0.000155747451948
-0.000587413270629
0.00025698055058
-0.000612615330617
9.99023322564e-06
-0.000197474056519
8.78036307311e-06
-1.16668240271e-06
7.511078074e-06
-3.63415529121e-06
6.59888316256e-06
-3.70307292519e-06
5.87773505592e-06
-3.20588368196e-06
5.26496381193e-06
-2.66319111887e-06
4.73065435165e-06
-2.20112152928e-06
4.26339798762e-06
-1.82912226246e-06
3.85773545565e-06
-1.53928734884e-06
3.45873729008e-06
-1.28156878172e-06
3.08413442721e-06
-1.18806269901e-06
2.71423602977e-06
-1.14334166063e-06
2.3385767225e-06
-1.12847495212e-06
1.96043007426e-06
-1.14991506421e-06
1.57998091189e-06
-1.2103425826e-06
1.19222570572e-06
-1.30373875624e-06
7.73661299958e-07
-1.43460419531e-06
3.4475025471e-07
-1.43989037966e-06
-1.43698301273e-06
5.24923511657e-08
1.49508667463e-06
-2.97549885515e-06
6.30828640207e-06
1.55010528995e-06
2.22370457848e-05
1.60387954294e-07
1.22081916082e-05
-7.28016896468e-08
3.44264195976e-07
-2.13358142956e-07
8.67984736815e-07
-3.68918377663e-07
1.35389971011e-06
-6.90106587539e-07
1.98418644444e-06
-1.38933042714e-06
2.7716319972e-06
-2.81616045354e-06
3.9702450723e-06
4.22446409278e-06
6.89304929154e-06
1.09967210046e-05
3.03185011115e-05
1.19946232035e-05
4.30219201385e-05
1.32005935904e-05
2.36738220567e-05
1.05996283436e-05
1.99869385058e-05
-1.44636934246e-05
2.37928814665e-05
-1.28248343248e-05
-2.24742706586e-05
-8.72413309821e-06
-2.46893017258e-05
3.48206961641e-06
-2.91914270683e-05
8.96936498355e-06
-3.54747595775e-06
6.55178352966e-06
4.78342600386e-05
3.32344369795e-06
2.15950975969e-05
1.46822957165e-05
4.54143993661e-06
2.52428490273e-06
1.54326986957e-05
-4.05811957031e-06
1.2309777297e-05
-5.88389463088e-06
6.54059919433e-06
-6.23725934498e-06
4.65622795347e-06
-7.49146988077e-06
5.03122869096e-06
-4.82461269786e-06
-6.67706038938e-07
-3.10846327901e-06
6.89177954468e-07
-2.8712304988e-06
3.47299861002e-06
-2.31094887729e-06
4.03211588263e-06
-2.65633107427e-06
6.50597164236e-06
-3.09545927546e-06
7.94039298745e-06
-4.21138762897e-06
9.94997727052e-06
-4.81018419585e-06
1.11939164789e-05
-4.00537423092e-06
1.22330214392e-05
6.65585578722e-08
1.41887261951e-05
6.13854214513e-06
2.53211979323e-05
1.31035354506e-05
2.24542811523e-06
1.46514482544e-05
-0.000720165803466
7.38055481366e-06
-0.000676353701818
1.45524728603e-05
-0.00050021009856
2.41582828301e-05
-0.000548721908204
2.37109366515e-05
-0.000544044863748
2.58204191006e-05
-0.000588631608832
2.18173723538e-05
-0.000602888484009
2.13296144852e-05
-0.000624295941106
1.81880154688e-05
-0.000632043084037
1.7591151964e-05
-0.000638680245189
1.60182285881e-05
-0.000637686991319
1.62681762776e-05
-0.000635034711458
1.65478769695e-05
-0.000627056625746
1.87394587068e-05
-0.000617116523072
2.26151741519e-05
-0.000603208662129
3.06392297575e-05
-0.000588394967911
4.63055799314e-05
-0.000575976626642
7.53441062805e-05
-0.000573119911826
0.000113813483827
-0.000586284905859
0.000123522408186
-0.000597119161888
0.000144551256813
-0.000633641855267
-7.45499149868e-07
-5.21773304105e-05
4.78830199511e-06
-6.70070408621e-06
7.07224701771e-06
-5.91870832307e-06
6.98914177865e-06
-3.62030778247e-06
6.39346031419e-06
-2.61025773732e-06
5.72341564184e-06
-1.99314423278e-06
5.10380870068e-06
-1.58149873612e-06
4.55945422427e-06
-1.28480352585e-06
4.0803186947e-06
-1.06022107546e-06
3.66701941754e-06
-8.68407198792e-07
3.29311905033e-06
-8.14364944539e-07
2.92612575186e-06
-7.76641227053e-07
2.55240745103e-06
-7.55127045468e-07
2.16491682206e-06
-7.62875551393e-07
1.75314023035e-06
-7.99069632865e-07
1.30722810965e-06
-8.58367810142e-07
8.0927259905e-07
-9.3719692116e-07
3.25147799734e-07
-9.562556884e-07
-1.11213243943e-06
1.43633006245e-06
5.86423556442e-08
4.21197289324e-06
3.53363441828e-06
1.0128885318e-05
1.63230842085e-05
4.60121324458e-06
1.77373919202e-05
9.05072699342e-07
4.04196523386e-06
5.71968189248e-07
1.20210233658e-06
5.00229284752e-07
1.4268553371e-06
4.11810963895e-07
2.07303397416e-06
1.00110713656e-07
3.08399462185e-06
-9.91122390951e-07
5.06131908466e-06
-3.12609940539e-06
9.02840783324e-06
1.23196500636e-05
1.48740891228e-05
2.60507385854e-05
2.92951732664e-05
3.54086943397e-05
1.43191771509e-05
4.05277370938e-05
1.48698765816e-05
4.24475211648e-05
2.18736988316e-05
1.55516686149e-05
4.42240880962e-06
-3.53338949169e-06
-5.60794948835e-06
-4.75420948949e-06
-2.79694747613e-05
1.76682596702e-05
-2.59651215052e-05
-1.18911824972e-05
7.74037811435e-05
-2.75102557959e-06
1.24613444084e-05
2.43159458882e-06
-6.37247423548e-07
6.32979041304e-06
1.15389590802e-05
1.94516194499e-06
1.66949538072e-05
-1.00868239929e-05
1.85702020677e-05
1.16713426857e-05
-1.71000797975e-05
-2.3788653703e-05
4.0481509104e-05
-2.98039060955e-06
-2.14726886882e-05
-9.08628982499e-08
-2.20044170717e-06
-3.97623747874e-07
3.77914732571e-06
5.47047355861e-07
3.0833043411e-06
7.63015006341e-07
6.28487884025e-06
4.92158958211e-07
8.20298357191e-06
-1.36685004204e-06
1.18018330542e-05
-3.37590517632e-06
1.31975682974e-05
-1.21772558179e-06
1.00704369038e-05
8.2058044665e-06
4.75363711131e-06
-1.19988417475e-05
4.55090017383e-05
-4.06789351358e-05
3.0923676447e-05
0.000176141539653
-0.000936990542208
3.06628671573e-05
-0.000530878447619
-3.62002913143e-05
-0.000433349240852
6.14989244101e-05
-0.000646422161239
-3.88501346633e-05
-0.000443696095585
4.58887039547e-05
-0.000673370000804
-1.7156668103e-05
-0.000539842443965
2.92808470694e-05
-0.000670732384223
-3.63610257367e-06
-0.000599125107608
2.0206457947e-05
-0.000662521522163
3.17635605707e-06
-0.000620655775097
1.65945424808e-05
-0.000648451583453
7.58869516445e-06
-0.000618049688393
1.71609181212e-05
-0.000626687473166
1.22729961066e-05
-0.000598319557396
2.1672244788e-05
-0.000597792670685
1.2984909518e-05
-0.000567287840422
1.74026869938e-05
-0.000577536508827
-1.65629733972e-05
-0.000552317547552
7.54731357251e-05
-0.000689154053837
0.000105673711689
-0.000663840449355
4.19963300654e-05
1.14999911346e-05
1.0740840082e-05
2.45527585931e-05
9.52040341816e-06
-4.69860430819e-06
8.14822068343e-06
-2.24824818331e-06
7.05386075966e-06
-1.51582442728e-06
6.15257886849e-06
-1.09178235532e-06
5.4084029183e-06
-8.37234653576e-07
4.78985893689e-06
-6.66243241915e-07
4.26970719693e-06
-5.40086490925e-07
3.83301311571e-06
-4.31807024543e-07
3.42513846127e-06
-4.06642771151e-07
3.04049875851e-06
-3.92244112072e-07
2.66104088358e-06
-3.75985330729e-07
2.26845335582e-06
-3.7068389308e-07
1.85586584081e-06
-3.86934933113e-07
1.42133035326e-06
-4.24336601374e-07
9.50557231015e-07
-4.6689171918e-07
4.63079543453e-07
-4.69361400021e-07
-6.49482400458e-07
5.8679168056e-08
3.59255757254e-06
1.99162378026e-05
3.76563268632e-05
4.17002138066e-05
4.29043832807e-05
4.4332133585e-05
4.64062148787e-05
4.94900171384e-05
5.45516944931e-05
6.35806881777e-05
7.8456914908e-05
0.000107754173795
0.000122075217973
0.000136945994311
0.000158820179267
0.000163240165086
0.000157632808005
0.00012966461987
0.000103702281898
0.000181108847062
0.000193572988537
0.000192937668176
0.000204477800415
0.000221173527365
0.000239745567246
0.000222642775445
0.000263128249204
0.000241656587922
0.000239455694393
0.000243229602266
0.000246305405568
0.000252577812463
0.000260768791223
0.000272561619347
0.000285752016317
0.000295804020373
0.000300528674993
0.000346022207896
0.000376943934752
6.49509925729e-05
0.000159070749351
0.000350720483387
0.000329297758144
0.000510601597743
0.000462231672104
0.000547389595372
0.000501657548902
0.000527532981697
0.00049001189634
0.000494356726381
0.000470905611152
0.000477856531911
0.000476169581597
0.000502850769628
0.000530058795333
0.000587771605098
0.000635235618836
0.000707918285625
0.000643765201083
-2.00752468378e-05
-8.5769318344e-06
1.59740297991e-05
1.12753490433e-05
9.02713770096e-06
7.51136377464e-06
6.41964819294e-06
5.58244312505e-06
4.91621676821e-06
4.37610702469e-06
3.94425412731e-06
3.53752251388e-06
3.14515628049e-06
2.76900646618e-06
2.39812386578e-06
2.01095835453e-06
1.58640132003e-06
1.11924460004e-06
6.49482400458e-07
)
;
boundaryField
{
frontAndBack
{
type empty;
value nonuniform 0();
}
upperWall
{
type calculated;
value uniform 0;
}
lowerWall
{
type calculated;
value uniform 0;
}
inlet
{
type calculated;
value nonuniform List<scalar>
20
(
-0.000625
-0.000625
-0.000625
-0.000625
-0.000625
-0.000625
-0.000625
-0.000625
-0.000625
-0.000625
-0.000625
-0.000625
-0.000625
-0.000625
-0.000625
-0.000625
-0.000625
-0.000625
-0.000625
-0.000625
)
;
}
outlet
{
type calculated;
value nonuniform List<scalar>
20
(
0.000255656588184
0.000521371496064
0.000647747954873
0.000719889337202
0.000761964298257
0.000783299859844
0.000786489779981
0.000776998957852
0.000762454993129
0.00074447397449
0.000723547324558
0.000699883960102
0.00067354609103
0.00064447086053
0.000612431713924
0.000576878470351
0.000536994120794
0.000491119710247
0.000441231849097
0.000339663371201
)
;
}
}
// ************************************************************************* //
| [
"as998@snu.edu.in"
] | as998@snu.edu.in | |
670c5a964a6ac105f3deb3345fa693491c3d6ffa | 105d30f94b958b5548adcaec2eb52aead72e26ff | /src/StateEnemy.cpp | 7cb83de97c81eabc2517b396dc457a4417d5d174 | [
"MIT"
] | permissive | CaioIcy/Dauphine | fc51dd9c6d9b7387943075c02f1a6642e76e816c | 8fd9bb649fea25ff5422ce11c305cffc52080d63 | refs/heads/master | 2020-12-24T16:40:35.059079 | 2015-12-04T17:54:37 | 2015-12-04T17:54:37 | 41,003,672 | 1 | 1 | null | 2015-08-19T00:05:51 | 2015-08-19T00:05:50 | null | UTF-8 | C++ | false | false | 145 | cpp | #include "StateEnemy.h"
StateEnemy::StateEnemy(Enemy* const enemy_) :
enemy(enemy_)
{
}
StateEnemy::~StateEnemy(){
this->enemy = nullptr;
}
| [
"caio.nardelli@hotmail.com"
] | caio.nardelli@hotmail.com |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.